summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
authorSimon MacMullen <simon@rabbitmq.com>2011-01-11 17:03:56 +0000
committerSimon MacMullen <simon@rabbitmq.com>2011-01-11 17:03:56 +0000
commit4db63f30162ae870df2811918a272f138dd09d8e (patch)
treed6cab11b2815c656403c3861ee0f83c3828b6732 /src
parentf657edded754ac464fbc450e731d9409907ac2eb (diff)
downloadrabbitmq-server-git-4db63f30162ae870df2811918a272f138dd09d8e.tar.gz
Revert this to the old version that we want.
Diffstat (limited to 'src')
-rw-r--r--src/rabbit_upgrade.erl4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/rabbit_upgrade.erl b/src/rabbit_upgrade.erl
index 9ce9b3856c..23dd416afe 100644
--- a/src/rabbit_upgrade.erl
+++ b/src/rabbit_upgrade.erl
@@ -211,8 +211,8 @@ edges(_Module, Steps, Scope0) ->
Require <- Requires,
Scope0 == Scope1].
-unknown_heads(Heads, Known) ->
- lists:filter(fun(H) -> not lists:member(H, Known) end, Heads).
+unknown_heads(Heads, G) ->
+ [H || H <- Heads, digraph:vertex(G, H) =:= false].
upgrades_to_apply(Heads, G) ->
%% Take all the vertices which can reach the known heads. That's