summaryrefslogtreecommitdiffstats
path: root/winpr/libwinpr/interlocked/test/TestInterlockedSList.c
blob: 71ac8bcb1375d84db49c379ae663ece76cbbdc2c (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include <stdio.h>
#include <winpr/crt.h>
#include <winpr/windows.h>
#include <winpr/interlocked.h>

typedef struct
{
	WINPR_SLIST_ENTRY ItemEntry;
	ULONG Signature;
} PROGRAM_ITEM, *PPROGRAM_ITEM;

int TestInterlockedSList(int argc, char* argv[])
{
	ULONG Count = 0;
	WINPR_PSLIST_ENTRY pFirstEntry = NULL;
	WINPR_PSLIST_HEADER pListHead = NULL;
	WINPR_UNUSED(argc);
	WINPR_UNUSED(argv);
	/* Initialize the list header to a MEMORY_ALLOCATION_ALIGNMENT boundary. */
	pListHead = (WINPR_PSLIST_HEADER)winpr_aligned_malloc(sizeof(WINPR_SLIST_HEADER),
	                                                      MEMORY_ALLOCATION_ALIGNMENT);

	if (!pListHead)
	{
		printf("Memory allocation failed.\n");
		return -1;
	}

	InitializeSListHead(pListHead);

	/* Insert 10 items into the list. */
	for (Count = 1; Count <= 10; Count += 1)
	{
		PPROGRAM_ITEM pProgramItem =
		    (PPROGRAM_ITEM)winpr_aligned_malloc(sizeof(PROGRAM_ITEM), MEMORY_ALLOCATION_ALIGNMENT);

		if (!pProgramItem)
		{
			printf("Memory allocation failed.\n");
			return -1;
		}

		pProgramItem->Signature = Count;
		pFirstEntry = InterlockedPushEntrySList(pListHead, &(pProgramItem->ItemEntry));
	}

	/* Remove 10 items from the list and display the signature. */
	for (Count = 10; Count >= 1; Count -= 1)
	{
		PPROGRAM_ITEM pProgramItem = NULL;
		WINPR_PSLIST_ENTRY pListEntry = InterlockedPopEntrySList(pListHead);

		if (!pListEntry)
		{
			printf("List is empty.\n");
			return -1;
		}

		pProgramItem = (PPROGRAM_ITEM)pListEntry;
		printf("Signature is %" PRIu32 "\n", pProgramItem->Signature);

		/*
		 * This example assumes that the SLIST_ENTRY structure is the
		 * first member of the structure. If your structure does not
		 * follow this convention, you must compute the starting address
		 * of the structure before calling the free function.
		 */

		winpr_aligned_free(pListEntry);
	}

	/* Flush the list and verify that the items are gone. */
	pFirstEntry = InterlockedPopEntrySList(pListHead);

	if (pFirstEntry)
	{
		printf("Error: List is not empty.\n");
		return -1;
	}

	winpr_aligned_free(pListHead);

	return 0;
}