/
rb_bench.c
163 lines (130 loc) · 3.22 KB
/
rb_bench.c
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
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <stdint.h>
#define NDEBUG
#include <assert.h>
#define RB_COMPACT
#include "rb.h"
#define NNODES 1500
#define NSETS 25
#define NSEARCH 0
#define NITER 0
//#define VERBOSE
typedef struct node_s node_t;
struct node_s {
#define NODE_MAGIC 0x9823af7e
uint32_t magic;
rb_node(node_t) link;
long key;
};
static inline int
nodeCmpEq(node_t *aA, node_t *aB) {
assert(aA->magic == NODE_MAGIC);
assert(aB->magic == NODE_MAGIC);
return (aA->key > aB->key) - (aA->key < aB->key);
}
static inline int
nodeCmpIdent(node_t *aA, node_t *aB) {
int rVal = nodeCmpEq(aA, aB);
if (rVal == 0) {
// Duplicates are not allowed in the tree, so force an arbitrary
// ordering for non-identical items with equal keys.
rVal = (((uintptr_t) aA) > ((uintptr_t) aB))
- (((uintptr_t) aA) < ((uintptr_t) aB));
}
return rVal;
}
typedef rbt(node_t) tree_t;
rb_gen(static inline, tree_, tree_t, node_t, link, nodeCmpIdent);
static node_t *
treeIterateCb(tree_t *aTree, node_t *aNode, void *data) {
unsigned *i = (unsigned *)data;
node_t *sNode, key;
assert(aNode->magic == NODE_MAGIC);
/* Test rb_search(). */
key.key = aNode->key;
key.magic = NODE_MAGIC;
sNode = tree_search(aTree, &key);
assert(sNode != NULL);
assert(sNode->key == key.key);
/* Test rb_nsearch(). */
sNode = tree_nsearch(aTree, &key);
assert(sNode != NULL);
assert(sNode->key == key.key);
(*i)++;
return NULL;
}
static unsigned
treeIterate(tree_t *aTree) {
unsigned i;
i = 0;
tree_iter(aTree, NULL, treeIterateCb, (void *)&i);
return i;
}
static unsigned
treeIterateReverse(tree_t *aTree) {
unsigned i;
i = 0;
tree_reverse_iter(aTree, NULL, treeIterateCb, (void *)&i);
return i;
}
int
main(void) {
tree_t tree;
long set[NNODES];
node_t nodes[NNODES], key, *sNode;
unsigned i, j, k, l, m;
srandom(42);
for (i = 0; i < NSETS; i++) {
for (j = 0; j < NNODES; j++) {
set[j] = (long) (((double) NNODES)
* ((double) random() / ((double)RAND_MAX)));
}
for (j = 1; j <= NNODES; j++) {
#ifdef VERBOSE
fprintf(stderr, "Tree %u, %u node%s\n", i, j, j != 1 ? "s" : "");
#endif
/* Initialize tree and nodes. */
tree_new(&tree);
for (k = 0; k < j; k++) {
nodes[k].magic = NODE_MAGIC;
nodes[k].key = set[k];
}
/* Insert nodes. */
for (k = 0; k < j; k++) {
tree_insert(&tree, &nodes[k]);
for (l = 0; l < NSEARCH; l++) {
for (m = 0; m <= k; m++) {
sNode = tree_first(&tree);
sNode = tree_last(&tree);
key.key = nodes[m].key;
key.magic = NODE_MAGIC;
sNode = tree_search(&tree, &key);
sNode = tree_nsearch(&tree, &key);
}
}
}
for (k = 0; k < NITER; k++) {
treeIterate(&tree);
treeIterateReverse(&tree);
}
/* Remove nodes. */
for (k = 0; k < j; k++) {
for (l = 0; l < NSEARCH; l++) {
for (m = 0; m <= k; m++) {
sNode = tree_first(&tree);
sNode = tree_last(&tree);
key.key = nodes[m].key;
key.magic = NODE_MAGIC;
sNode = tree_search(&tree, &key);
sNode = tree_nsearch(&tree, &key);
}
}
tree_remove(&tree, &nodes[k]);
nodes[k].magic = 0;
}
}
}
return 0;
}