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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
|
/* $Id: tstRTList.cpp $ */
/** @file
* IPRT Testcase - List interface.
*/
/*
* Copyright (C) 2010-2019 Oracle Corporation
*
* This file is part of VirtualBox Open Source Edition (OSE), as
* available from http://www.virtualbox.org. This file is free software;
* you can redistribute it and/or modify it under the terms of the GNU
* General Public License (GPL) as published by the Free Software
* Foundation, in version 2 as it comes in the "COPYING" file of the
* VirtualBox OSE distribution. VirtualBox OSE is distributed in the
* hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
*
* The contents of this file may alternatively be used under the terms
* of the Common Development and Distribution License Version 1.0
* (CDDL) only, as it comes in the "COPYING.CDDL" file of the
* VirtualBox OSE distribution, in which case the provisions of the
* CDDL are applicable instead of those of the GPL.
*
* You may elect to license modified versions of this file under the
* terms and conditions of either the GPL or the CDDL or both.
*/
/*********************************************************************************************************************************
* Header Files *
*********************************************************************************************************************************/
#include <iprt/list.h>
#include <iprt/errcore.h>
#include <iprt/mem.h>
#include <iprt/string.h>
#include <iprt/test.h>
/*********************************************************************************************************************************
* Structures and Typedefs *
*********************************************************************************************************************************/
typedef struct LISTELEM
{
/** Test data */
unsigned idx;
/** Node */
RTLISTNODE Node;
} LISTELEM, *PLISTELEM;
static void tstRTListOrder(RTTEST hTest, PRTLISTNODE pList, unsigned cElements,
unsigned idxFirst, unsigned idxLast, unsigned idxStep)
{
RTTEST_CHECK(hTest, RTListIsEmpty(pList) == false);
RTTEST_CHECK(hTest, RTListGetFirst(pList, LISTELEM, Node) != NULL);
RTTEST_CHECK(hTest, RTListGetLast(pList, LISTELEM, Node) != NULL);
if (cElements > 1)
RTTEST_CHECK(hTest, RTListGetLast(pList, LISTELEM, Node) != RTListGetFirst(pList, LISTELEM, Node));
else
RTTEST_CHECK(hTest, RTListGetLast(pList, LISTELEM, Node) == RTListGetFirst(pList, LISTELEM, Node));
/* Check that the order is right. */
PLISTELEM pNode = RTListGetFirst(pList, LISTELEM, Node);
for (unsigned i = idxFirst; i < idxLast; i += idxStep)
{
RTTEST_CHECK(hTest, pNode->idx == i);
pNode = RTListNodeGetNext(&pNode->Node, LISTELEM, Node);
}
RTTEST_CHECK(hTest, pNode->idx == idxLast);
RTTEST_CHECK(hTest, RTListGetLast(pList, LISTELEM, Node) == pNode);
RTTEST_CHECK(hTest, RTListNodeIsLast(pList, &pNode->Node) == true);
/* Check reverse order */
pNode = RTListGetLast(pList, LISTELEM, Node);
for (unsigned i = idxLast; i > idxFirst; i -= idxStep)
{
RTTEST_CHECK(hTest, pNode->idx == i);
pNode = RTListNodeGetPrev(&pNode->Node, LISTELEM, Node);
}
RTTEST_CHECK(hTest, pNode->idx == idxFirst);
RTTEST_CHECK(hTest, RTListGetFirst(pList, LISTELEM, Node) == pNode);
RTTEST_CHECK(hTest, RTListNodeIsFirst(pList, &pNode->Node) == true);
/* The list enumeration. */
unsigned idx = idxFirst;
RTListForEach(pList, pNode, LISTELEM, Node)
{
RTTEST_CHECK_RETV(hTest, idx == pNode->idx);
idx += idxStep;
}
RTTEST_CHECK_MSG_RETV(hTest, idx == idxLast + idxStep || (idx == idxFirst && idxFirst == idxLast),
(hTest, "idx=%u idxFirst=%u idxLast=%u idxStep=%u\n", idx, idxFirst, idxLast, idxStep));
idx = idxLast;
RTListForEachReverse(pList, pNode, LISTELEM, Node)
{
RTTEST_CHECK_RETV(hTest, idx == pNode->idx);
idx -= idxStep;
}
RTTEST_CHECK_MSG_RETV(hTest, idx == idxFirst - idxStep || (idx == idxLast && idxFirst == idxLast),
(hTest, "idx=%u idxFirst=%u idxLast=%u idxStep=%u\n", idx, idxFirst, idxLast, idxStep));
}
static void tstRTListCreate(RTTEST hTest, unsigned cElements)
{
RTTestISubF("Creating and moving - %u elements", cElements);
Assert(cElements > 0);
RTLISTANCHOR ListHead;
RTListInit(&ListHead);
RTTEST_CHECK(hTest, RTListIsEmpty(&ListHead) == true);
RTTEST_CHECK(hTest, RTListGetFirst(&ListHead, LISTELEM, Node) == NULL);
RTTEST_CHECK(hTest, RTListGetLast(&ListHead, LISTELEM, Node) == NULL);
/* Create the list */
for (unsigned i = 0; i< cElements; i++)
{
PLISTELEM pNode = (PLISTELEM)RTMemAlloc(sizeof(LISTELEM));
pNode->idx = i;
pNode->Node.pPrev = NULL;
pNode->Node.pNext = NULL;
RTListAppend(&ListHead, &pNode->Node);
}
tstRTListOrder(hTest, &ListHead, cElements, 0, cElements-1, 1);
/* Move the list to a new one. */
RTLISTANCHOR ListHeadNew;
RTListMove(&ListHeadNew, &ListHead);
RTTEST_CHECK(hTest, RTListIsEmpty(&ListHead) == true);
RTTEST_CHECK(hTest, RTListGetFirst(&ListHead, LISTELEM, Node) == NULL);
RTTEST_CHECK(hTest, RTListGetLast(&ListHead, LISTELEM, Node) == NULL);
tstRTListOrder(hTest, &ListHeadNew, cElements, 0, cElements-1, 1);
/*
* Safe iteration w/ removal.
*/
RTTestISubF("Safe iteration w/ removal - %u elements", cElements);
/* Move it element by element. */
PLISTELEM pNode, pSafe;
RTListForEachSafe(&ListHeadNew, pNode, pSafe, LISTELEM, Node)
{
RTListNodeRemove(&pNode->Node);
RTListAppend(&ListHead, &pNode->Node);
}
RTTESTI_CHECK(RTListIsEmpty(&ListHeadNew) == true);
tstRTListOrder(hTest, &ListHead, cElements, 0, cElements-1, 1);
/* And the other way. */
RTListForEachReverseSafe(&ListHead, pNode, pSafe, LISTELEM, Node)
{
RTListNodeRemove(&pNode->Node);
RTListPrepend(&ListHeadNew, &pNode->Node);
}
RTTESTI_CHECK(RTListIsEmpty(&ListHead) == true);
tstRTListOrder(hTest, &ListHeadNew, cElements, 0, cElements-1, 1);
/*
* Remove elements now.
*/
if (cElements > 1)
{
/* Remove every second */
RTTestISubF("Remove every second node - %u elements", cElements);
pNode = RTListGetFirst(&ListHeadNew, LISTELEM, Node);
for (unsigned i = 0; i < cElements; i++)
{
PLISTELEM pNext = RTListNodeGetNext(&pNode->Node, LISTELEM, Node);
if (!(pNode->idx % 2))
{
RTListNodeRemove(&pNode->Node);
RTMemFree(pNode);
}
pNode = pNext;
}
bool fElementsEven = (cElements % 2) == 0;
unsigned idxEnd = fElementsEven ? cElements - 1 : cElements - 2;
cElements /= 2;
tstRTListOrder(hTest, &ListHeadNew, cElements, 1, idxEnd, 2);
}
/* Remove the rest now. */
RTTestISubF("Remove all nodes - %u elements", cElements);
pNode = RTListGetFirst(&ListHeadNew, LISTELEM, Node);
for (unsigned i = 0; i < cElements; i++)
{
PLISTELEM pNext = RTListNodeGetNext(&pNode->Node, LISTELEM, Node);
RTListNodeRemove(&pNode->Node);
RTMemFree(pNode);
pNode = pNext;
}
/* List should be empty again */
RTTEST_CHECK(hTest, RTListIsEmpty(&ListHeadNew) == true);
RTTEST_CHECK(hTest, RTListGetFirst(&ListHeadNew, LISTELEM, Node) == NULL);
RTTEST_CHECK(hTest, RTListGetLast(&ListHeadNew, LISTELEM, Node) == NULL);
}
int main()
{
RTTEST hTest;
int rc = RTTestInitAndCreate("tstRTList", &hTest);
if (rc)
return rc;
RTTestBanner(hTest);
tstRTListCreate(hTest, 1);
tstRTListCreate(hTest, 2);
tstRTListCreate(hTest, 3);
tstRTListCreate(hTest, 99);
tstRTListCreate(hTest, 100);
tstRTListCreate(hTest, 101);
/*
* Summary.
*/
return RTTestSummaryAndDestroy(hTest);
}
|
