ApfelTeeSaft/reactos
1
0
Fork 0
mirror of https://github.com/ApfelTeeSaft/reactos.git synced 2026-09-03 04:13:31 +00:00
Code Issues Packages Projects Releases Wiki Activity

[NTOSKRNL]

Browse Source 
- begin search at the highest possible address in VAD tree

svn path=/trunk/; revision=53060
This commit is contained in:
Jérôme Gardou
2011-08-04 16:21:22 +00:00
parent 8be271b56b
commit 415db7e8f3
1 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
reactos/ntoskrnl/mm/ARM3/vadnode.c
+1 -2
View File
@@ -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)