LIST_ENTRY 使用练习

//链表数据结构体
//根据实际需要，自行调整
typedef struct _LIST_ENTRY_DATA
{
	LIST_ENTRY ListEntry;
	ULONG64    number;
	ULONG64    data;
	ULONG64   ProcessId;
	ULONG64   ImageBase;
	CHAR* ImagePath;
}LIST_ENTRY_DATA,*PLIST_ENTRY_DATA;

_LIST_ENTRY ListEntryHead;
#define UNLOCKED 0
#define LOCKED 1
ULONG64     ListLock = UNLOCKED;//0 unlocked,1 locked

VOID InitList()
{
	//初始化链表
	ListEntryHead.Flink = &ListEntryHead;
	ListEntryHead.Blink = &ListEntryHead;
}

//判断链表是否为空
INT IsListEmpty()
{
	if (&ListEntryHead== ListEntryHead.Flink)
	{
		printf("[IsListEmpty]there is no entry in list!!!\n");
		//list is empty!
		return 0;
	}
	else
	{
		//list has entries.
		return 1;
	}
}

//通过给定的数据项，在链表中进行查找
//这个数据可以根据实际的需求进行设定
// 
//返回对应的链表数据项
//
PLIST_ENTRY_DATA SearchList(ULONG64 number, ULONG64 data)
{
	PLIST_ENTRY_DATA pListEntryData = NULL;
	PLIST_ENTRY pEntryList = NULL;
	int found = 0;


	if (ListLock == LOCKED)
	{
		printf("[SearchList]list is locked,wait!\n");
		return pListEntryData;
	}
	else
	{
		//lock the list
		ListLock = LOCKED;
	}

	if (0 == IsListEmpty())
	{
		ListLock = UNLOCKED;
		return pListEntryData;
	}

	pEntryList = ListEntryHead.Flink;
	printf("[SearchList]pEntryList:%p\n", pEntryList);
	do
	{
		pListEntryData = (PLIST_ENTRY_DATA)pEntryList;
		printf("{SearchList]addr:%p,number:%I64u,data:%I64u\n",pListEntryData, pListEntryData->number, pListEntryData->data);
		if (number == pListEntryData->number && data == pListEntryData->data)
		{
			printf("[SearchList]greate job!\n");
			found = 1;
			break;
		}
		else
		{
			pEntryList = pEntryList->Flink;
		}
	} while (pEntryList!= &ListEntryHead);

	//unlock the list
	{
		ListLock = UNLOCKED;
	}

	if (found == 0)
	{
		pListEntryData = NULL;
	}
	//return the result
	return pListEntryData;
}

//根据给定的数据成员，生成链表数据项
//并将该结构插入到链表头
//
int InsertHeadList(ULONG64 number, ULONG64 data)
{
	int result = 0;
	PLIST_ENTRY_DATA pListEntryData = NULL;
	PLIST_ENTRY tmpFirstEntry = NULL;

	if (ListLock == LOCKED)
	{
		printf("[InsertHeadList]list is locked,wait!\n");
		return result;
	}
	else
	{
		//lock the list
		ListLock = LOCKED;
	}

	//allocate LIST_ENTRY_DATA
	pListEntryData = (PLIST_ENTRY_DATA)malloc(sizeof(LIST_ENTRY_DATA));
	//printf("addr:%p,addr:%p\n", pListEntryData,&(pListEntryData->ListEntry));
	pListEntryData->number = number;
	pListEntryData->data = data;
	//insert the entry into the list
	tmpFirstEntry = ListEntryHead.Flink;

	pListEntryData->ListEntry.Flink = tmpFirstEntry;
	pListEntryData->ListEntry.Blink = &ListEntryHead;

	tmpFirstEntry->Blink = &(pListEntryData->ListEntry);
	ListEntryHead.Flink = &(pListEntryData->ListEntry);

	//unlock the list
	{
		ListLock = UNLOCKED;
	}
	return 1;
}

//根据给定的数据成员，删除链表中对应的项
//
//
INT RemoveListEntry(ULONG64 number, ULONG64 data)
{
	INT result = 0;
	PLIST_ENTRY_DATA pListEntryData = NULL;
	PLIST_ENTRY pListEntry = NULL;
	PLIST_ENTRY tmpListEntry = NULL;

	if (ListLock == LOCKED)
	{
		printf("[RemoveListEntry]list is locked,wait!\n");
		return result;
	}
	else
	{
		//lock the list
		ListLock = LOCKED;
	}

	if (0 == IsListEmpty())
	{
		ListLock = UNLOCKED;
		return result;
	}
	//
	ListLock = UNLOCKED;
	pListEntryData = SearchList(number, data);
	//
	ListLock = LOCKED;
	if (pListEntryData)
	{
		printf("[RemoveListEntry]number:%I64u,data:%I64u is in list!\n", pListEntryData->number, pListEntryData->data);
		//
		//delete the list entry from list
		//
		pListEntry = &(pListEntryData->ListEntry);
		tmpListEntry = pListEntry->Flink;

		pListEntry->Blink->Flink = tmpListEntry;
		tmpListEntry->Blink = pListEntry->Blink;
		//free ListEntryData
		free(pListEntryData);

		//set result
		result = 1;
	}
	else
	{
		printf("[RemoveListEntry]there is no such entry[%I64u:%I64u] in list!good luck!!!\n",number,data);
	}

	//unlock the list
	ListLock = UNLOCKED;
	return result;
}

//
//删除头节点
//
INT RemoveHeadList(PLIST_ENTRY_DATA *ListEntryData)
{
	int result = 0;
	PLIST_ENTRY_DATA pListEntryData = NULL;
	PLIST_ENTRY tmpFirstEntry = NULL;

	if (ListLock == LOCKED)
	{
		printf("[RemoveHeadList]list is locked,wait!\n");
		return result;
	}
	else
	{
		//lock the list
		ListLock = LOCKED;
	}

	if (0 == IsListEmpty())
	{
		ListLock = UNLOCKED;
		return result;
	}

	//pop the first list entry
	pListEntryData = (PLIST_ENTRY_DATA)ListEntryHead.Flink;
	tmpFirstEntry = ListEntryHead.Flink;
	*ListEntryData = pListEntryData;

	//remove head entry from the list
	tmpFirstEntry->Flink->Blink = &ListEntryHead;
	ListEntryHead.Flink = tmpFirstEntry->Flink;

	//unlock the list
	{
		ListLock = UNLOCKED;
	}
	return 1;
}

//
//清空链表
//
VOID EmptyList()
{
	int result = 0;
	PLIST_ENTRY_DATA pListEntryData;

	do
	{
		pListEntryData = NULL;
		result = 0;
		result = RemoveHeadList(&pListEntryData);
		if (result == 1)
		{
			printf("[EmptyList]addr:%p,number:%I64u,data:%I64u\n", pListEntryData, pListEntryData->number, pListEntryData->data);
			if (pListEntryData != NULL)
			{
				free(pListEntryData);
			}
		}
	} while (result);
}

VOID TestListEntry()
{
	PLIST_ENTRY_DATA pListEntryData;
	InitList();

	InsertHeadList(0, 111);
	InsertHeadList(1, 222);
	InsertHeadList(9, 678);
	InsertHeadList(110, 996);
	InsertHeadList(110, 965);
	RemoveHeadList(&pListEntryData);
	RemoveListEntry(10, 111);
	RemoveListEntry(0, 111);
	InsertHeadList(101, 1024);
	InsertHeadList(5, 1000);
	//search the list
	if (NULL!=SearchList(110,996))
	{
		printf("[TestListEntry]find the target in the list\n");
	}
	else
	{
		printf("[TestListEntry]do not find the target!@\n");
	}

	EmptyList();

	printf("[TestListEntry]over!@#\n");
	//free the list entry data;
}

分割线-----------------------------

[吐槽] 微信的秀操作

来看一下它的登录验证方式，如下图：

我觉得它的验证方式是真的厉害，你觉得了。