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
|
#include <ccan/idtree/idtree.c>
#include <ccan/tap/tap.h>
#include <limits.h>
#define ALLOC_MAX (2 * IDTREE_SIZE)
static bool check_tal_parent(const tal_t *parent, const tal_t *ctx)
{
while (ctx) {
if (ctx == parent)
return true;
ctx = tal_parent(ctx);
}
return false;
}
int main(int argc, char *argv[])
{
unsigned int i;
const char allocated[ALLOC_MAX] = { 0 };
struct idtree *idtree;
void *ctx;
plan_tests(ALLOC_MAX * 5 + 2);
ctx = tal(NULL, char);
idtree = idtree_new(ctx);
ok1(check_tal_parent(ctx, idtree));
for (i = 0; i < ALLOC_MAX; i++) {
int id = idtree_add(idtree, &allocated[i], ALLOC_MAX-1);
ok1(id == i);
ok1(idtree_lookup(idtree, i) == &allocated[i]);
}
ok1(idtree_add(idtree, &allocated[i], ALLOC_MAX-1) == -1);
/* Remove every second one. */
for (i = 0; i < ALLOC_MAX; i += 2)
ok1(idtree_remove(idtree, i));
for (i = 0; i < ALLOC_MAX; i++) {
if (i % 2 == 0)
ok1(!idtree_lookup(idtree, i));
else
ok1(idtree_lookup(idtree, i) == &allocated[i]);
}
/* Now, finally, reallocate. */
for (i = 0; i < ALLOC_MAX/2; i++) {
ok1(idtree_add(idtree, &allocated[i*2], INT_MAX) == i * 2);
}
for (i = 0; i < ALLOC_MAX; i++) {
ok1(idtree_lookup(idtree, i) == &allocated[i]);
}
tal_free(ctx);
exit(exit_status());
}
|
