Windows驱动开发小练习-内存分配与链表操作

typedef struct _MYDATA
{
LIST_ENTRY    ListEntry;
LONG        number;
}MYDATA, *PMYDATA;

void LinkedListTest()
{
LIST_ENTRY head;
MYDATA *pMyData;
PLIST_ENTRY pListEntry;
InitializeListHead(&head);

// 创建链表
for (int i = 0; i < 10; i++)
{
// 分配分页内存
pMyData = (PMYDATA)ExAllocatePool(PagedPool, sizeof(MYDATA));
pMyData->number = i;
InsertTailList(&head, &pMyData->ListEntry);
}

// 遍历链表
pMyData = (PMYDATA)head.Flink;
while (pMyData != (PMYDATA)&head)
{
KdPrint(("%d\n", pMyData->number));
pMyData = (PMYDATA)pMyData->ListEntry.Flink;
}

// 释放链表
KdPrint(("now removing linked list..."));
while (!IsListEmpty(&head))
{
pListEntry = RemoveTailList(&head); // 从尾部删除一个节点（如果需要从中间删除，使用RemoveEntryList函数）
pMyData = (PMYDATA)pListEntry;
KdPrint(("Removed data:%d\n", pMyData->number));
ExFreePool(pListEntry);                // 释放删除掉的节点所占用的内存
}
}