summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorSimon MacMullen <simon@rabbitmq.com>2013-09-23 14:40:56 +0100
committerSimon MacMullen <simon@rabbitmq.com>2013-09-23 14:40:56 +0100
commita4bc9613298645b2688ad044aa923f4192bea263 (patch)
tree9dafd03160c762425640c68a12b5271563b4859d
parent6c338f1ba2f59e77b72105fe173d36a16f2292dd (diff)
downloadrabbitmq-server-a4bc9613298645b2688ad044aa923f4192bea263.tar.gz
Don't go through the legacy code path when not dealing with a legacy file; don't arbitrarily rewrite the disc nodes field of this file at startup.
-rw-r--r--src/rabbit_node_monitor.erl18
1 files changed, 8 insertions, 10 deletions
diff --git a/src/rabbit_node_monitor.erl b/src/rabbit_node_monitor.erl
index 57dce7cd..0851cdbe 100644
--- a/src/rabbit_node_monitor.erl
+++ b/src/rabbit_node_monitor.erl
@@ -104,23 +104,18 @@ prepare_cluster_status_files() ->
%% The running nodes file might contain a set or a list, in case
%% of the legacy file
RunningNodes2 = lists:usort(ThisNode ++ RunningNodes1),
- {AllNodes1, WantDiscNode} =
+ {AllNodes1, DiscNodes} =
case try_read_file(cluster_status_filename()) of
{ok, [{AllNodes, DiscNodes0}]} ->
- {AllNodes, lists:member(node(), DiscNodes0)};
+ {AllNodes, DiscNodes0};
{ok, [AllNodes0]} when is_list(AllNodes0) ->
- {legacy_cluster_nodes(AllNodes0),
- legacy_should_be_disc_node(AllNodes0)};
+ {legacy_cluster_nodes(AllNodes0), legacy_disc_nodes(AllNodes0)};
{ok, Files} ->
Corrupt(Files);
{error, enoent} ->
{legacy_cluster_nodes([]), true}
end,
AllNodes2 = lists:usort(AllNodes1 ++ RunningNodes2),
- DiscNodes = case WantDiscNode of
- true -> ThisNode;
- false -> []
- end,
ok = write_cluster_status({AllNodes2, DiscNodes, RunningNodes2}).
write_cluster_status({All, Disc, Running}) ->
@@ -441,8 +436,11 @@ legacy_cluster_nodes(Nodes) ->
%% list otherwise)
lists:usort(Nodes ++ mnesia:system_info(db_nodes)).
-legacy_should_be_disc_node(DiscNodes) ->
- DiscNodes == [] orelse lists:member(node(), DiscNodes).
+legacy_disc_nodes(AllNodes) ->
+ case AllNodes == [] orelse lists:member(node(), AllNodes) of
+ true -> [node()];
+ false -> []
+ end.
add_node(Node, Nodes) -> lists:usort([Node | Nodes]).