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
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
|
#include <stdlib.h>
#include <stdio.h>
#include <netdb.h>
#include <assert.h>
#include <freeradius-devel/libradius.h>
/*
* We need knowlege of the internal structures.
* This needs to be kept in lockstep with rbtree.c
*/
/* RED-BLACK tree description */
typedef enum {
BLACK,
RED
} node_colour_t;
struct rbnode_t {
rbnode_t *left; //!< left child
rbnode_t *right; //!< right child
rbnode_t *parent; //!< Parent
node_colour_t colour; //!< Node colour (BLACK, RED)
void *data; //!< data stored in node
};
struct rbtree_t {
#ifndef NDEBUG
uint32_t magic;
#endif
rbnode_t *root;
int num_elements;
rb_comparator_t compare;
rb_free_t free;
bool replace;
#ifdef HAVE_PTHREAD_H
bool lock;
pthread_mutex_t mutex;
#endif
};
/* Storage for the NIL pointer. */
static rbnode_t *NIL;
static int comp(void const *a, void const *b)
{
if (*(uint32_t const *)a > *(uint32_t const *)b) {
return -1;
}
if (*(uint32_t const *)a < *(uint32_t const *)b) {
return 1;
}
return 0;
}
#if 0
static int print_cb(UNUSED void *ctx, void *i)
{
fprintf(stderr, "%i\n", *(int*)i);
return 0;
}
#endif
#define MAXSIZE 1024
static int r = 0;
static uint32_t rvals[MAXSIZE];
static int store_cb(UNUSED void *ctx, void *i)
{
rvals[r++] = *(int const *)i;
return 0;
}
static uint32_t mask;
static int filter_cb(void *ctx, void *i)
{
if ((*(uint32_t *)i & mask) == (*(uint32_t *)ctx & mask)) {
return 2;
}
return 0;
}
/*
* Returns the count of BLACK nodes from root to child leaves, or a
* negative number indicating which RED-BLACK rule was broken.
*/
static int rbcount(rbtree_t *t)
{
rbnode_t *n;
int count, count_expect;
count_expect = -1;
n = t->root;
if (!n || n == NIL) {
return 0;
}
if (n->colour != BLACK) {
return -2; /* root not BLACK */
}
count = 0;
descend:
while (n->left != NIL) {
if (n->colour == RED) {
if (n->left->colour != BLACK || n->right->colour != BLACK) {
return -4; /* Children of RED nodes must be BLACK */
}
}
else {
count++;
}
n = n->left;
}
if (n->right != NIL) {
if (n->colour == RED) {
if (n->left->colour != BLACK || n->right->colour != BLACK) {
return -4; /* Children of RED nodes must be BLACK */
}
}
else {
count++;
}
n = n->right;
}
if (n->left != NIL || n->right != NIL) {
goto descend;
}
if (count_expect < 0) {
count_expect = count + (n->colour == BLACK);
}
else {
if (count_expect != count + (n->colour == BLACK)) {
fprintf(stderr,"Expected %i got %i\n", count_expect, count);
return -5; /* All paths must traverse the same number of BLACK nodes. */
}
}
ascend:
if (n->parent != NIL) return count_expect;
while (n->parent->right == n) {
n = n->parent;
if (!n->parent) return count_expect;
if (n->colour == BLACK) {
count--;
}
}
if (n->parent->left == n) {
if (n->parent->right != NIL) {
n = n->parent->right;
goto descend;
}
n = n->parent;
if (!n->parent) return count_expect;
if (n->colour == BLACK) {
count--;
}
}
goto ascend;
}
#define REPS 10
int main(UNUSED int argc, UNUSED char *argv[])
{
rbtree_t *t;
int i, j;
uint32_t thresh;
int n, rep;
uint32_t vals[MAXSIZE];
struct timeval now;
gettimeofday(&now, NULL);
/* TODO: make starting seed and repetitions a CLI option */
rep = REPS;
again:
if (!--rep) return 0;
thresh = fr_rand();
mask = 0xff >> (fr_rand() & 7);
thresh &= mask;
n = (fr_rand() % MAXSIZE) + 1;
fprintf(stderr, "filter = %x mask = %x n= %i\n",
thresh, mask, n);
t = rbtree_create(NULL, comp, free, RBTREE_FLAG_LOCK);
/* Find out the value of the NIL node */
assert(t->root != NULL);
assert(t->root->parent == t->root);
NIL = t->root;
for (i = 0; i < n; i++) {
int *p;
p = malloc(sizeof(*p));
*p = fr_rand();
vals[i] = *p;
rbtree_insert(t, p);
}
i = rbcount(t);
fprintf(stderr,"After insert rbcount is %i.\n", i);
if (i < 0) { return i; }
qsort(vals, n, sizeof(int), comp);
/*
* For testing deletebydata instead
for (i = 0; i < n; i++) {
if (filter_cb(&vals[i], &thresh) == 2) {
rbtree_deletebydata(t, &vals[i]);
}
}
*
*/
(void) rbtree_walk(t, RBTREE_DELETE_ORDER, filter_cb, &thresh);
i = rbcount(t);
fprintf(stderr,"After delete rbcount is %i.\n", i);
if (i < 0) { return i; }
r = 0;
rbtree_walk(t, RBTREE_IN_ORDER, &store_cb, NULL);
for (j = i = 0; i < n; i++) {
if (i && vals[i-1] == vals[i]) continue;
if (!filter_cb(&thresh, &vals[i])) {
if (vals[i] != rvals[j]) goto bad;
j++;
}
}
fprintf(stderr,"matched OK\n");
rbtree_free(t);
goto again;
bad:
for (j = i = 0; i < n; i++) {
if (i && vals[i-1] == vals[i]) continue;
if (!filter_cb(&thresh, &vals[i])) {
fprintf(stderr, "%i: %x %x\n", j, vals[i], rvals[j]);
j++;
} else {
fprintf(stderr, "skipped %x\n", vals[i]);
}
}
return -1;
}
|
