[NTOSKRNL]

- begin search at the highest possible address in VAD tree

svn path=/trunk/; revision=53060

diff --git a/reactos/ntoskrnl/mm/ARM3/vadnode.c b/reactos/ntoskrnl/mm/ARM3/vadnode.c
index 551a194..09cd835 100644 (file)
--- a/reactos/ntoskrnl/mm/ARM3/vadnode.c
+++ b/reactos/ntoskrnl/mm/ARM3/vadnode.c
@@ -396,8 +396,7 @@ MiFindEmptyAddressRangeDownTree(IN SIZE_T Length,
     /* Starting from the root, go down until the right-most child,
        trying to stay below the boundary. */
     LowestNode = Node = RtlRightChildAvl(&Table->BalancedRoot);
-    while ( (Child = RtlRightChildAvl(Node)) &&
-             Child->EndingVpn < HighVpn ) Node = Child;
+    while (Child = RtlRightChildAvl(Node)) Node = Child;
 
     /* Now loop the Vad nodes */
     while (Node)