mirror of
https://github.com/reactos/reactos.git
synced 2024-10-05 17:06:29 +00:00
[NTOSKRNL]
- begin search at the highest possible address in VAD tree svn path=/trunk/; revision=53060
This commit is contained in:
parent
8be271b56b
commit
415db7e8f3
|
@ -396,8 +396,7 @@ MiFindEmptyAddressRangeDownTree(IN SIZE_T Length,
|
||||||
/* Starting from the root, go down until the right-most child,
|
/* Starting from the root, go down until the right-most child,
|
||||||
trying to stay below the boundary. */
|
trying to stay below the boundary. */
|
||||||
LowestNode = Node = RtlRightChildAvl(&Table->BalancedRoot);
|
LowestNode = Node = RtlRightChildAvl(&Table->BalancedRoot);
|
||||||
while ( (Child = RtlRightChildAvl(Node)) &&
|
while (Child = RtlRightChildAvl(Node)) Node = Child;
|
||||||
Child->EndingVpn < HighVpn ) Node = Child;
|
|
||||||
|
|
||||||
/* Now loop the Vad nodes */
|
/* Now loop the Vad nodes */
|
||||||
while (Node)
|
while (Node)
|
||||||
|
|
Loading…
Reference in a new issue