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
|
/* radare - LGPL - Copyright 2009-2013 - pancake */
#include <btree.h>
R_API void btree_init(struct btree_node **T) {
*T = NULL;
}
R_API struct btree_node *btree_remove(struct btree_node *p, BTREE_DEL(del)) {
struct btree_node *rp = NULL, *f;
if (p==NULL) return p;
if (p->right!=NULL) {
if (p->left!=NULL) {
f = p;
rp = p->right;
while (rp->left!=NULL) {
f = rp;
rp = rp->left;
}
if (f!=p) {
f->left = rp->right;
rp->right = p->right;
rp->left = p->left;
} else rp->left = p->left;
} else rp = p->right;
} else rp = p->left;
if (del) del (p->data);
free (p);
return(rp);
}
R_API void *btree_search(struct btree_node *root, void *x, BTREE_CMP(cmp), int parent) {
struct btree_node *p = NULL;
if (root!=NULL) {
if (cmp (x, root->data)<0)
p = btree_search (root->left, x, cmp, parent);
else if (cmp(x, root->data)>0)
p = btree_search (root->right, x, cmp, parent);
else p = root;
}
/* node found */
if (p) {
if (parent)
return root;
return p;
} return NULL;
}
R_API int btree_del(struct btree_node *proot, void *x, BTREE_CMP(cmp), BTREE_DEL(del)) {
struct btree_node *p = btree_search (proot, x, cmp, 1);
if (p) {
// p->right =
btree_remove (p->left, del);
return R_TRUE;
}
return R_FALSE;
}
R_API void *btree_get(struct btree_node *proot, void *x, BTREE_CMP(cmp)) {
struct btree_node *p = btree_search (proot, x, cmp, 0);
if (p) {
p->hits++;
return p->data;
}
return NULL;
}
R_API void btree_cleartree(struct btree_node *proot, BTREE_DEL(del)) {
if (proot!=NULL) {
btree_cleartree (proot->left, del);
btree_cleartree (proot->right, del);
if (del) del (proot->data);
free (proot);
}
}
R_API void btree_insert(struct btree_node **T, struct btree_node *p, BTREE_CMP(cmp)) {
int ret = cmp (p->data, (*T)->data);
if (ret<0) {
if ((*T)->left) btree_insert (&(*T)->left, p, cmp);
else (*T)->left = p;
} else if (ret>0) {
if ((*T)->right) btree_insert (&(*T)->right, p, cmp);
else (*T)->right = p;
}
}
R_API void btree_add(struct btree_node **T, void *e, BTREE_CMP(cmp)) {
struct btree_node *p = (struct btree_node*)
malloc(sizeof(struct btree_node));
p->data = e;
p->hits = 0;
p->left = p->right = NULL;
if (*T==NULL) *T = p;
else btree_insert (T, p, cmp);
}
/* unused */
R_API int btree_empty(struct btree_node **T) {
return !( (T && (*T) && ((*T)->right || (*T)->left)) );
}
R_API struct btree_node *btree_hittest(struct btree_node *root, struct btree_node *hn) {
struct btree_node *p = root;
if (root != NULL) {
struct btree_node *ml = btree_hittest(root->left, root);
struct btree_node *mr = btree_hittest(root->right, root);
if (ml && ml->hits > p->hits) p = ml;
if (mr && mr->hits > p->hits) p = mr;
}
return p;
}
R_API int btree_optimize(struct btree_node **T, BTREE_CMP(cmp)) {
struct btree_node *node, *NT = NULL;
do {
node = btree_hittest(*T, NULL);
if (node) {
btree_add (&NT, node->data, cmp);
btree_del (*T, node->data, cmp, NULL);
}
} while(node);
*T = NT; /* replace one tree with the other */
return 0;
}
#if MAIN
struct mydata {
unsigned long long addr;
char *str;
};
int shownode(char *str, struct mydata *m) {
if (m == NULL)
printf ("==> not found\n");
else printf ("==> %s: %s, %"PFMT64d"\n", str, m->str, m->addr);
return 0;
}
int mycmp(const void *a, const void *b) {
struct mydata *ma = (struct mydata *)a;
struct mydata *mb = (struct mydata *)b;
if (a==NULL || b == NULL)
return 0;
return (int)(ma->addr-mb->addr);
}
int main() {
struct btree_node *n, *bt = NULL;
//btree_init(&bt);
struct mydata foo = { 10, "hello" };
struct mydata bar = { 20, "world" };
printf("EMPTY TREE: %d\n", btree_empty(&bt));
btree_add(&bt, &foo, mycmp);
btree_add(&bt, &bar, mycmp);
printf ("EMPTY TREE: %d\n", btree_empty(&bt));
printf("==== go search ====\n");
/* find existent data */
struct mydata *p = btree_get (bt, &bar, mycmp);
shownode("result for 20: ", p);
printf("==== go search ====\n");
/* find unexistent data */
struct mydata nop = { 15, NULL };
p = btree_get(bt, &nop, mycmp);
shownode("result for 15: ", p);
printf("==== go get hittest ====\n");
n = btree_hittest(bt, NULL);
shownode("hitest is: ", p);
printf("==== go remove 20 ====\n");
if (btree_del(bt, &bar, mycmp, NULL))
printf("node found and removed\n");
else printf("oops\n");
printf("==== go search ====\n");
/* find existent data */
p = btree_get(bt, &bar, mycmp);
shownode("result for 20: ", p);
printf("==== go search ====\n");
/* find existent data */
p = btree_get(bt, &foo, mycmp);
shownode("result for 10: ", p);
btree_cleartree(bt, NULL);
return 0;
}
#endif
|
