ReactOS寻找病返回最小StartingAddress所在结点。
MmIterateFirstNode()函数
文章目录
MmIterateFirstNode
/* INCLUDES *****************************************************************/
#include <ntoskrnl.h>
#define NDEBUG
#include <internal/debug.h>
#if defined (ALLOC_PRAGMA)
#pragma alloc_text(INIT, MmInitMemoryAreas)
#endif
/* #define VALIDATE_MEMORY_AREAS */
/* FUNCTIONS *****************************************************************/
/**
* @name MmIterateFirstNode
*
* @param Node
* Head node of the MEMORY_AREA tree.
*
* @return The leftmost MEMORY_AREA node (ie. the one with lowest
* address)
*/
static PMEMORY_AREA MmIterateFirstNode(PMEMORY_AREA Node)
{
//只要左孩子不为空,则一直遍历,对于AVL树而言,也就找到了它的最小的
while (Node->LeftChild != NULL)
Node = Node->LeftChild;
return Node;
}
标签:Node,ReactOS,AREA,小S,tartingAddress,MEMORY,MmIterateFirstNode
From: https://blog.csdn.net/zhyjhacker/article/details/143168132