MiCheckForConflictingNode MiFindEmptyAddressRangeDownBasedTree MiFindEmptyAddressRangeDownTree MiFindEmptyAddressRangeInTree MiGetNextNode MiGetPreviousNode MiInsertBasedSection MiInsertNode MiInsertVad MiLocateAddress MiRemoveNode MODULE_INVOLVED_IN_ARM3 NDEBUG

PMMADDRESS_NODE NTAPI MiGetNextNode ( IN PMMADDRESS_NODE  Node ) Definition at line 288 of file vadnode.c. Referenced by MiFindEmptyAddressRangeInTree(), and MiQueryMemoryBasicInformation(). { PMMADDRESS_NODE Parent; /* Get the right child */ if (RtlRightChildAvl(Node)) { /* Get left-most child */ Node = RtlRightChildAvl(Node); while (RtlLeftChildAvl(Node)) Node = RtlLeftChildAvl(Node); return Node; } Parent = RtlParentAvl(Node); ASSERT(Parent != NULL); while (Parent != Node) { /* The parent should be a left child, return the real predecessor */ if (RtlIsLeftChildAvl(Node)) { /* Return it */ return Parent; } /* Keep lopping until we find our parent */ Node = Parent; Parent = RtlParentAvl(Node); } /* Nothing found */ return NULL; }