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
|
/*
* Copyright (c) 2010-2017 Richard Braun.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "../hash.h"
#include "../macros.h"
#include "../rbtree.h"
#define SIZE 28
struct obj {
struct rbtree_node node;
int id;
};
static inline int
obj_cmp_lookup(int id, struct rbtree_node *node)
{
struct obj *obj;
obj = rbtree_entry(node, struct obj, node);
return id - obj->id;
}
static void
print_subtree(struct rbtree_node *node, int level)
{
struct obj *obj;
char color;
int i;
if (node == NULL) {
return;
}
print_subtree(node->children[RBTREE_RIGHT], level + 1);
for (i = level; i > 0; i--) {
putchar(' ');
}
obj = rbtree_entry(node, struct obj, node);
color = (node->parent & RBTREE_COLOR_MASK) ? 'b' : 'r';
printf("%d:%c\n", obj->id, color);
print_subtree(node->children[RBTREE_LEFT], level + 1);
}
static void
print_tree(struct rbtree *tree)
{
print_subtree(tree->root, 0);
}
static int
get_id(int i)
{
return hash_int32(i, 6);
}
int
main(int argc, char *argv[])
{
struct rbtree tree;
struct rbtree_node *node, *tmp;
struct obj *obj;
rbtree_slot_t slot;
int i, id;
(void)argc;
(void)argv;
rbtree_init(&tree);
for (i = 0; i < SIZE; i++) {
id = get_id(i);
node = rbtree_lookup_slot(&tree, id, obj_cmp_lookup, slot);
if (node != NULL) {
continue;
}
obj = malloc(sizeof(*obj));
obj->id = id;
printf("%d ", obj->id);
rbtree_insert_slot(&tree, slot, &obj->node);
}
printf("\n");
print_tree(&tree);
rbtree_for_each_remove(&tree, node, tmp) {
obj = rbtree_entry(node, struct obj, node);
printf("freeing obj %d\n", obj->id);
free(obj);
}
return 0;
}
|
