]>
Commit | Line | Data |
---|---|---|
8e6ba6f9 AC |
1 | /* |
2 | * charybdis: an advanced ircd. | |
3 | * irc_radixtree.c: Dictionary-based information storage. | |
4 | * | |
5 | * Copyright (c) 2007-2016 William Pitcock <nenolod -at- dereferenced.org> | |
6 | * Copyright (c) 2007-2016 Jilles Tjoelker <jilles -at- stack.nl> | |
7 | * | |
8 | * Redistribution and use in source and binary forms, with or without | |
9 | * modification, are permitted provided that the following conditions are | |
10 | * met: | |
11 | * | |
12 | * 1. Redistributions of source code must retain the above copyright notice, | |
13 | * this list of conditions and the following disclaimer. | |
14 | * | |
15 | * 2. Redistributions in binary form must reproduce the above copyright | |
16 | * notice, this list of conditions and the following disclaimer in the | |
17 | * documentation and/or other materials provided with the distribution. | |
18 | * | |
19 | * 3. The name of the author may not be used to endorse or promote products | |
20 | * derived from this software without specific prior written permission. | |
21 | * | |
22 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR | |
23 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED | |
24 | * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE | |
25 | * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, | |
26 | * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES | |
27 | * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR | |
28 | * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
29 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | |
30 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING | |
31 | * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
32 | * POSSIBILITY OF SUCH DAMAGE. | |
33 | */ | |
34 | ||
35 | #include "stdinc.h" | |
36 | #include "s_assert.h" | |
db891ac3 | 37 | #include "match.h" |
8e6ba6f9 AC |
38 | #include "irc_radixtree.h" |
39 | ||
325cc939 AC |
40 | rb_dlink_list radixtree_list = {NULL, NULL, 0}; |
41 | ||
8e6ba6f9 AC |
42 | /* |
43 | * Patricia tree. | |
44 | * | |
45 | * A radix trie that avoids one-way branching and redundant nodes. | |
46 | * | |
47 | * To find a node, the tree is traversed starting from the root. The | |
48 | * nibnum in each node indicates which nibble of the key needs to be | |
49 | * tested, and the appropriate branch is taken. | |
50 | * | |
51 | * The nibnum values are strictly increasing while going down the tree. | |
52 | * | |
53 | * -- jilles | |
54 | */ | |
55 | ||
56 | union irc_radixtree_elem; | |
57 | ||
58 | struct irc_radixtree | |
59 | { | |
60 | void (*canonize_cb)(char *key); | |
61 | union irc_radixtree_elem *root; | |
62 | ||
63 | unsigned int count; | |
64 | char *id; | |
325cc939 AC |
65 | |
66 | rb_dlink_node node; | |
8e6ba6f9 AC |
67 | }; |
68 | ||
69 | #define POINTERS_PER_NODE 16 | |
70 | #define NIBBLE_VAL(key, nibnum) (((key)[(nibnum) / 2] >> ((nibnum) & 1 ? 0 : 4)) & 0xF) | |
71 | ||
72 | struct irc_radixtree_node | |
73 | { | |
74 | /* nibble to test (nibble NUM%2 of byte NUM/2) */ | |
75 | int nibnum; | |
76 | ||
77 | /* branches of the tree */ | |
78 | union irc_radixtree_elem *down[POINTERS_PER_NODE]; | |
79 | union irc_radixtree_elem *parent; | |
80 | ||
81 | char parent_val; | |
82 | }; | |
83 | ||
84 | struct irc_radixtree_leaf | |
85 | { | |
86 | /* -1 to indicate this is a leaf, not a node */ | |
87 | int nibnum; | |
88 | ||
89 | /* data associated with the key */ | |
90 | void *data; | |
91 | ||
92 | /* key (canonized copy) */ | |
93 | char *key; | |
94 | union irc_radixtree_elem *parent; | |
95 | ||
96 | char parent_val; | |
97 | }; | |
98 | ||
99 | union irc_radixtree_elem | |
100 | { | |
101 | int nibnum; | |
102 | struct irc_radixtree_node node; | |
103 | ||
104 | struct irc_radixtree_leaf leaf; | |
105 | }; | |
106 | ||
107 | #define IS_LEAF(elem) ((elem)->nibnum == -1) | |
108 | ||
109 | /* Preserve compatibility with the old mowgli_patricia.h */ | |
110 | #define STATE_CUR(state) ((state)->pspare[0]) | |
111 | #define STATE_NEXT(state) ((state)->pspare[1]) | |
112 | ||
113 | /* | |
114 | * first_leaf() | |
115 | * | |
116 | * Find the smallest leaf hanging off a subtree. | |
117 | * | |
118 | * Inputs: | |
119 | * - element (may be leaf or node) heading subtree | |
120 | * | |
121 | * Outputs: | |
122 | * - lowest leaf in subtree | |
123 | * | |
124 | * Side Effects: | |
125 | * - none | |
126 | */ | |
127 | static union irc_radixtree_elem * | |
128 | first_leaf(union irc_radixtree_elem *delem) | |
129 | { | |
130 | int val; | |
131 | ||
132 | while (!IS_LEAF(delem)) | |
133 | { | |
134 | for (val = 0; val < POINTERS_PER_NODE; val++) | |
135 | if (delem->node.down[val] != NULL) | |
136 | { | |
137 | delem = delem->node.down[val]; | |
138 | break; | |
139 | } | |
140 | } | |
141 | ||
142 | return delem; | |
143 | } | |
144 | ||
8e6ba6f9 AC |
145 | /* |
146 | * irc_radixtree_create_named(const char *name, | |
147 | * void (*canonize_cb)(char *key)) | |
148 | * | |
149 | * Dictionary object factory. | |
150 | * | |
151 | * Inputs: | |
152 | * - patricia name | |
153 | * - function to use for canonizing keys (for example, use | |
154 | * a function that makes the string upper case to create | |
155 | * a patricia with case-insensitive matching) | |
156 | * | |
157 | * Outputs: | |
158 | * - on success, a new patricia object. | |
159 | * | |
160 | * Side Effects: | |
161 | * - if services runs out of memory and cannot allocate the object, | |
162 | * the program will abort. | |
163 | */ | |
164 | struct irc_radixtree * | |
325cc939 | 165 | irc_radixtree_create(const char *name, void (*canonize_cb)(char *key)) |
8e6ba6f9 AC |
166 | { |
167 | struct irc_radixtree *dtree = (struct irc_radixtree *) rb_malloc(sizeof(struct irc_radixtree)); | |
168 | ||
169 | dtree->canonize_cb = canonize_cb; | |
170 | dtree->id = rb_strdup(name); | |
171 | dtree->root = NULL; | |
172 | ||
325cc939 AC |
173 | rb_dlinkAdd(dtree, &dtree->node, &radixtree_list); |
174 | ||
8e6ba6f9 AC |
175 | return dtree; |
176 | } | |
177 | ||
178 | /* | |
179 | * irc_radixtree_destroy(struct irc_radixtree *dtree, | |
180 | * void (*destroy_cb)(const char *key, void *data, void *privdata), | |
181 | * void *privdata); | |
182 | * | |
183 | * Recursively destroys all nodes in a patricia tree. | |
184 | * | |
185 | * Inputs: | |
186 | * - patricia tree object | |
187 | * - optional iteration callback | |
188 | * - optional opaque/private data to pass to callback | |
189 | * | |
190 | * Outputs: | |
191 | * - nothing | |
192 | * | |
193 | * Side Effects: | |
194 | * - on success, a dtree and optionally it's children are destroyed. | |
195 | * | |
196 | * Notes: | |
197 | * - if this is called without a callback, the objects bound to the | |
198 | * DTree will not be destroyed. | |
199 | */ | |
200 | void | |
201 | irc_radixtree_destroy(struct irc_radixtree *dtree, void (*destroy_cb)(const char *key, void *data, void *privdata), void *privdata) | |
202 | { | |
203 | struct irc_radixtree_iteration_state state; | |
204 | union irc_radixtree_elem *delem; | |
205 | ||
206 | void *entry; | |
207 | ||
208 | s_assert(dtree != NULL); | |
209 | ||
210 | IRC_RADIXTREE_FOREACH(entry, &state, dtree) | |
211 | { | |
212 | delem = STATE_CUR(&state); | |
213 | ||
214 | if (destroy_cb != NULL) | |
215 | (*destroy_cb)(delem->leaf.key, delem->leaf.data, | |
216 | privdata); | |
217 | ||
218 | irc_radixtree_delete(dtree, delem->leaf.key); | |
219 | } | |
220 | ||
221 | rb_free(dtree); | |
222 | } | |
223 | ||
224 | /* | |
225 | * irc_radixtree_foreach(struct irc_radixtree *dtree, | |
226 | * int (*foreach_cb)(const char *key, void *data, void *privdata), | |
227 | * void *privdata); | |
228 | * | |
229 | * Iterates over all entries in a DTree. | |
230 | * | |
231 | * Inputs: | |
232 | * - patricia tree object | |
233 | * - optional iteration callback | |
234 | * - optional opaque/private data to pass to callback | |
235 | * | |
236 | * Outputs: | |
237 | * - nothing | |
238 | * | |
239 | * Side Effects: | |
240 | * - on success, a dtree is iterated | |
241 | */ | |
242 | void | |
243 | irc_radixtree_foreach(struct irc_radixtree *dtree, int (*foreach_cb)(const char *key, void *data, void *privdata), void *privdata) | |
244 | { | |
245 | union irc_radixtree_elem *delem, *next; | |
246 | ||
247 | int val; | |
248 | ||
249 | s_assert(dtree != NULL); | |
250 | ||
251 | delem = dtree->root; | |
252 | ||
253 | if (delem == NULL) | |
254 | return; | |
255 | ||
256 | /* Only one element in the tree */ | |
257 | if (IS_LEAF(delem)) | |
258 | { | |
259 | if (foreach_cb != NULL) | |
260 | (*foreach_cb)(delem->leaf.key, delem->leaf.data, privdata); | |
261 | ||
262 | return; | |
263 | } | |
264 | ||
265 | val = 0; | |
266 | ||
267 | do | |
268 | { | |
269 | do | |
270 | next = delem->node.down[val++]; | |
271 | while (next == NULL && val < POINTERS_PER_NODE); | |
272 | ||
273 | if (next != NULL) | |
274 | { | |
275 | if (IS_LEAF(next)) | |
276 | { | |
277 | if (foreach_cb != NULL) | |
278 | (*foreach_cb)(next->leaf.key, next->leaf.data, privdata); | |
279 | } | |
280 | else | |
281 | { | |
282 | delem = next; | |
283 | val = 0; | |
284 | } | |
285 | } | |
286 | ||
287 | while (val >= POINTERS_PER_NODE) | |
288 | { | |
289 | val = delem->node.parent_val; | |
290 | delem = delem->node.parent; | |
291 | ||
292 | if (delem == NULL) | |
293 | break; | |
294 | ||
295 | val++; | |
296 | } | |
297 | } while (delem != NULL); | |
298 | } | |
299 | ||
300 | /* | |
301 | * irc_radixtree_search(struct irc_radixtree *dtree, | |
302 | * void *(*foreach_cb)(const char *key, void *data, void *privdata), | |
303 | * void *privdata); | |
304 | * | |
305 | * Searches all entries in a DTree using a custom callback. | |
306 | * | |
307 | * Inputs: | |
308 | * - patricia tree object | |
309 | * - optional iteration callback | |
310 | * - optional opaque/private data to pass to callback | |
311 | * | |
312 | * Outputs: | |
313 | * - on success, the requested object | |
314 | * - on failure, NULL. | |
315 | * | |
316 | * Side Effects: | |
317 | * - a dtree is iterated until the requested conditions are met | |
318 | */ | |
319 | void * | |
320 | irc_radixtree_search(struct irc_radixtree *dtree, void *(*foreach_cb)(const char *key, void *data, void *privdata), void *privdata) | |
321 | { | |
322 | union irc_radixtree_elem *delem, *next; | |
323 | ||
324 | int val; | |
325 | void *ret = NULL; | |
326 | ||
327 | s_assert(dtree != NULL); | |
328 | ||
329 | delem = dtree->root; | |
330 | ||
331 | if (delem == NULL) | |
332 | return NULL; | |
333 | ||
334 | /* Only one element in the tree */ | |
335 | if (IS_LEAF(delem)) | |
336 | { | |
337 | if (foreach_cb != NULL) | |
338 | return (*foreach_cb)(delem->leaf.key, delem->leaf.data, privdata); | |
339 | ||
340 | return NULL; | |
341 | } | |
342 | ||
343 | val = 0; | |
344 | ||
345 | for (;;) | |
346 | { | |
347 | do | |
348 | next = delem->node.down[val++]; | |
349 | while (next == NULL && val < POINTERS_PER_NODE); | |
350 | ||
351 | if (next != NULL) | |
352 | { | |
353 | if (IS_LEAF(next)) | |
354 | { | |
355 | if (foreach_cb != NULL) | |
356 | ret = (*foreach_cb)(next->leaf.key, next->leaf.data, privdata); | |
357 | ||
358 | if (ret != NULL) | |
359 | break; | |
360 | } | |
361 | else | |
362 | { | |
363 | delem = next; | |
364 | val = 0; | |
365 | } | |
366 | } | |
367 | ||
368 | while (val >= POINTERS_PER_NODE) | |
369 | { | |
370 | val = delem->node.parent_val; | |
371 | delem = delem->node.parent; | |
372 | ||
373 | if (delem == NULL) | |
374 | break; | |
375 | ||
376 | val++; | |
377 | } | |
378 | } | |
379 | ||
380 | return ret; | |
381 | } | |
382 | ||
383 | /* | |
384 | * irc_radixtree_foreach_start(struct irc_radixtree *dtree, | |
385 | * struct irc_radixtree_iteration_state *state); | |
386 | * | |
387 | * Initializes a static DTree iterator. | |
388 | * | |
389 | * Inputs: | |
390 | * - patricia tree object | |
391 | * - static DTree iterator | |
392 | * | |
393 | * Outputs: | |
394 | * - nothing | |
395 | * | |
396 | * Side Effects: | |
397 | * - the static iterator, &state, is initialized. | |
398 | */ | |
399 | void | |
400 | irc_radixtree_foreach_start(struct irc_radixtree *dtree, struct irc_radixtree_iteration_state *state) | |
401 | { | |
402 | if (dtree == NULL) | |
403 | return; | |
404 | ||
405 | s_assert(state != NULL); | |
406 | ||
407 | if (dtree->root != NULL) | |
408 | STATE_NEXT(state) = first_leaf(dtree->root); | |
409 | else | |
410 | STATE_NEXT(state) = NULL; | |
411 | ||
412 | STATE_CUR(state) = STATE_NEXT(state); | |
413 | ||
414 | if (STATE_NEXT(state) == NULL) | |
415 | return; | |
416 | ||
417 | /* make STATE_CUR point to first item and STATE_NEXT point to | |
418 | * second item */ | |
419 | irc_radixtree_foreach_next(dtree, state); | |
420 | } | |
421 | ||
422 | /* | |
423 | * irc_radixtree_foreach_cur(struct irc_radixtree *dtree, | |
424 | * struct irc_radixtree_iteration_state *state); | |
425 | * | |
426 | * Returns the data from the current node being iterated by the | |
427 | * static iterator. | |
428 | * | |
429 | * Inputs: | |
430 | * - patricia tree object | |
431 | * - static DTree iterator | |
432 | * | |
433 | * Outputs: | |
434 | * - reference to data in the current dtree node being iterated | |
435 | * | |
436 | * Side Effects: | |
437 | * - none | |
438 | */ | |
439 | void * | |
440 | irc_radixtree_foreach_cur(struct irc_radixtree *dtree, struct irc_radixtree_iteration_state *state) | |
441 | { | |
442 | if (dtree == NULL) | |
443 | return NULL; | |
444 | ||
445 | s_assert(state != NULL); | |
446 | ||
447 | return STATE_CUR(state) != NULL ? | |
448 | ((struct irc_radixtree_leaf *) STATE_CUR(state))->data : NULL; | |
449 | } | |
450 | ||
451 | /* | |
452 | * irc_radixtree_foreach_next(struct irc_radixtree *dtree, | |
453 | * struct irc_radixtree_iteration_state *state); | |
454 | * | |
455 | * Advances a static DTree iterator. | |
456 | * | |
457 | * Inputs: | |
458 | * - patricia tree object | |
459 | * - static DTree iterator | |
460 | * | |
461 | * Outputs: | |
462 | * - nothing | |
463 | * | |
464 | * Side Effects: | |
465 | * - the static iterator, &state, is advanced to a new DTree node. | |
466 | */ | |
467 | void | |
468 | irc_radixtree_foreach_next(struct irc_radixtree *dtree, struct irc_radixtree_iteration_state *state) | |
469 | { | |
470 | struct irc_radixtree_leaf *leaf; | |
471 | ||
472 | union irc_radixtree_elem *delem, *next; | |
473 | ||
474 | int val; | |
475 | ||
476 | if (dtree == NULL) | |
477 | return; | |
478 | ||
479 | s_assert(state != NULL); | |
480 | ||
481 | if (STATE_CUR(state) == NULL) | |
482 | return; | |
483 | ||
484 | STATE_CUR(state) = STATE_NEXT(state); | |
485 | ||
486 | if (STATE_NEXT(state) == NULL) | |
487 | return; | |
488 | ||
489 | leaf = STATE_NEXT(state); | |
490 | delem = leaf->parent; | |
491 | val = leaf->parent_val; | |
492 | ||
493 | while (delem != NULL) | |
494 | { | |
495 | do | |
496 | next = delem->node.down[val++]; | |
497 | while (next == NULL && val < POINTERS_PER_NODE); | |
498 | ||
499 | if (next != NULL) | |
500 | { | |
501 | if (IS_LEAF(next)) | |
502 | { | |
503 | /* We will find the original leaf first. */ | |
504 | if (&next->leaf != leaf) | |
505 | { | |
506 | if (strcmp(next->leaf.key, leaf->key) < 0) | |
507 | { | |
508 | STATE_NEXT(state) = NULL; | |
509 | return; | |
510 | } | |
511 | ||
512 | STATE_NEXT(state) = next; | |
513 | return; | |
514 | } | |
515 | } | |
516 | else | |
517 | { | |
518 | delem = next; | |
519 | val = 0; | |
520 | } | |
521 | } | |
522 | ||
523 | while (val >= POINTERS_PER_NODE) | |
524 | { | |
525 | val = delem->node.parent_val; | |
526 | delem = delem->node.parent; | |
527 | ||
528 | if (delem == NULL) | |
529 | break; | |
530 | ||
531 | val++; | |
532 | } | |
533 | } | |
534 | ||
535 | STATE_NEXT(state) = NULL; | |
536 | } | |
537 | ||
538 | /* | |
1b685743 | 539 | * irc_radixtree_elem_find(struct irc_radixtree *dtree, const char *key) |
8e6ba6f9 AC |
540 | * |
541 | * Looks up a DTree node by name. | |
542 | * | |
543 | * Inputs: | |
544 | * - patricia tree object | |
545 | * - name of node to lookup | |
704697b6 | 546 | * - whether to do a direct or fuzzy match |
8e6ba6f9 AC |
547 | * |
548 | * Outputs: | |
549 | * - on success, the dtree node requested | |
550 | * - on failure, NULL | |
551 | * | |
552 | * Side Effects: | |
553 | * - none | |
554 | */ | |
555 | struct irc_radixtree_leaf * | |
704697b6 | 556 | irc_radixtree_elem_find(struct irc_radixtree *dict, const char *key, int fuzzy) |
8e6ba6f9 AC |
557 | { |
558 | char ckey_store[256]; | |
559 | ||
560 | char *ckey_buf = NULL; | |
561 | const char *ckey; | |
562 | union irc_radixtree_elem *delem; | |
563 | ||
564 | int val, keylen; | |
565 | ||
566 | s_assert(dict != NULL); | |
567 | s_assert(key != NULL); | |
568 | ||
569 | keylen = strlen(key); | |
570 | ||
571 | if (dict->canonize_cb == NULL) | |
572 | { | |
573 | ckey = key; | |
574 | } | |
575 | else | |
576 | { | |
577 | if (keylen >= (int) sizeof(ckey_store)) | |
578 | { | |
579 | ckey_buf = rb_strdup(key); | |
580 | dict->canonize_cb(ckey_buf); | |
581 | ckey = ckey_buf; | |
582 | } | |
583 | else | |
584 | { | |
585 | rb_strlcpy(ckey_store, key, sizeof ckey_store); | |
586 | dict->canonize_cb(ckey_store); | |
587 | ckey = ckey_store; | |
588 | } | |
589 | } | |
590 | ||
591 | delem = dict->root; | |
592 | ||
593 | while (delem != NULL && !IS_LEAF(delem)) | |
594 | { | |
595 | if (delem->nibnum / 2 < keylen) | |
596 | val = NIBBLE_VAL(ckey, delem->nibnum); | |
597 | else | |
598 | val = 0; | |
599 | ||
600 | delem = delem->node.down[val]; | |
601 | } | |
602 | ||
603 | /* Now, if the key is in the tree, delem contains it. */ | |
704697b6 | 604 | if ((delem != NULL) && !fuzzy && strcmp(delem->leaf.key, ckey)) |
8e6ba6f9 AC |
605 | delem = NULL; |
606 | ||
607 | if (ckey_buf != NULL) | |
608 | rb_free(ckey_buf); | |
609 | ||
610 | return &delem->leaf; | |
611 | } | |
612 | ||
0d9a72de AC |
613 | /* |
614 | * irc_radixtree_foreach_start_from(struct irc_radixtree *dtree, struct irc_radixtree_iteration_state *state, const char *key) | |
615 | * | |
616 | * Starts iteration from a specified key, by wrapping irc_radixtree_elem_find(). | |
617 | * | |
618 | * Inputs: | |
619 | * - patricia tree object | |
620 | * - iterator | |
621 | * - key to start from | |
622 | * | |
623 | * Outputs: | |
624 | * - none | |
625 | * | |
626 | * Side Effects: | |
627 | * - the iterator's state is initialized at a specific point | |
628 | */ | |
629 | void | |
630 | irc_radixtree_foreach_start_from(struct irc_radixtree *dtree, struct irc_radixtree_iteration_state *state, const char *key) | |
631 | { | |
632 | s_assert(dtree != NULL); | |
633 | s_assert(state != NULL); | |
634 | ||
635 | if (key != NULL) | |
636 | { | |
637 | STATE_CUR(state) = NULL; | |
704697b6 | 638 | STATE_NEXT(state) = irc_radixtree_elem_find(dtree, key, 1); |
0d9a72de AC |
639 | |
640 | /* make STATE_CUR point to selected item and STATE_NEXT point to | |
641 | * next item in the tree */ | |
642 | irc_radixtree_foreach_next(dtree, state); | |
643 | } | |
644 | else | |
645 | irc_radixtree_foreach_start(dtree, state); | |
646 | } | |
647 | ||
8e6ba6f9 AC |
648 | /* |
649 | * irc_radixtree_add(struct irc_radixtree *dtree, const char *key, void *data) | |
650 | * | |
651 | * Creates a new DTree node and binds data to it. | |
652 | * | |
653 | * Inputs: | |
654 | * - patricia tree object | |
655 | * - name for new DTree node | |
656 | * - data to bind to the new DTree node | |
657 | * | |
658 | * Outputs: | |
659 | * - on success, TRUE | |
660 | * - on failure, FALSE | |
661 | * | |
662 | * Side Effects: | |
663 | * - data is inserted into the DTree. | |
664 | */ | |
665 | struct irc_radixtree_leaf * | |
1b685743 | 666 | irc_radixtree_elem_add(struct irc_radixtree *dict, const char *key, void *data) |
8e6ba6f9 AC |
667 | { |
668 | char *ckey; | |
669 | ||
670 | union irc_radixtree_elem *delem, *prev, *newnode; | |
671 | ||
672 | union irc_radixtree_elem **place1; | |
673 | ||
674 | int val, keylen; | |
675 | int i, j; | |
676 | ||
677 | s_assert(dict != NULL); | |
678 | s_assert(key != NULL); | |
679 | s_assert(data != NULL); | |
680 | ||
681 | keylen = strlen(key); | |
682 | ckey = rb_strdup(key); | |
683 | ||
684 | if (ckey == NULL) | |
685 | return NULL; | |
686 | ||
687 | if (dict->canonize_cb != NULL) | |
688 | dict->canonize_cb(ckey); | |
689 | ||
690 | prev = NULL; | |
691 | val = POINTERS_PER_NODE + 2; /* trap value */ | |
692 | delem = dict->root; | |
693 | ||
694 | while (delem != NULL && !IS_LEAF(delem)) | |
695 | { | |
696 | prev = delem; | |
697 | ||
698 | if (delem->nibnum / 2 < keylen) | |
699 | val = NIBBLE_VAL(ckey, delem->nibnum); | |
700 | else | |
701 | val = 0; | |
702 | ||
703 | delem = delem->node.down[val]; | |
704 | } | |
705 | ||
706 | /* Now, if the key is in the tree, delem contains it. */ | |
707 | if ((delem != NULL) && !strcmp(delem->leaf.key, ckey)) | |
708 | { | |
709 | rb_free(ckey); | |
710 | return NULL; | |
711 | } | |
712 | ||
713 | if ((delem == NULL) && (prev != NULL)) | |
714 | /* Get a leaf to compare with. */ | |
715 | delem = first_leaf(prev); | |
716 | ||
717 | if (delem == NULL) | |
718 | { | |
719 | s_assert(prev == NULL); | |
720 | s_assert(dict->count == 0); | |
721 | place1 = &dict->root; | |
722 | *place1 = rb_malloc(sizeof(struct irc_radixtree_leaf)); | |
723 | s_assert(*place1 != NULL); | |
724 | (*place1)->nibnum = -1; | |
725 | (*place1)->leaf.data = data; | |
726 | (*place1)->leaf.key = ckey; | |
727 | (*place1)->leaf.parent = prev; | |
728 | (*place1)->leaf.parent_val = val; | |
729 | dict->count++; | |
730 | return &(*place1)->leaf; | |
731 | } | |
732 | ||
733 | /* Find the first nibble where they differ. */ | |
734 | for (i = 0; NIBBLE_VAL(ckey, i) == NIBBLE_VAL(delem->leaf.key, i); i++) | |
735 | ; | |
736 | ||
737 | /* Find where to insert the new node. */ | |
738 | while (prev != NULL && prev->nibnum > i) | |
739 | { | |
740 | val = prev->node.parent_val; | |
741 | prev = prev->node.parent; | |
742 | } | |
743 | ||
744 | if ((prev == NULL) || (prev->nibnum < i)) | |
745 | { | |
746 | /* Insert new node below prev */ | |
747 | newnode = rb_malloc(sizeof(struct irc_radixtree_node)); | |
748 | s_assert(newnode != NULL); | |
749 | newnode->nibnum = i; | |
750 | newnode->node.parent = prev; | |
751 | newnode->node.parent_val = val; | |
752 | ||
753 | for (j = 0; j < POINTERS_PER_NODE; j++) | |
754 | newnode->node.down[j] = NULL; | |
755 | ||
756 | if (prev == NULL) | |
757 | { | |
758 | newnode->node.down[NIBBLE_VAL(delem->leaf.key, i)] = dict->root; | |
759 | ||
760 | if (IS_LEAF(dict->root)) | |
761 | { | |
762 | dict->root->leaf.parent = newnode; | |
763 | dict->root->leaf.parent_val = NIBBLE_VAL(delem->leaf.key, i); | |
764 | } | |
765 | else | |
766 | { | |
767 | s_assert(dict->root->nibnum > i); | |
768 | dict->root->node.parent = newnode; | |
769 | dict->root->node.parent_val = NIBBLE_VAL(delem->leaf.key, i); | |
770 | } | |
771 | ||
772 | dict->root = newnode; | |
773 | } | |
774 | else | |
775 | { | |
776 | newnode->node.down[NIBBLE_VAL(delem->leaf.key, i)] = prev->node.down[val]; | |
777 | ||
778 | if (IS_LEAF(prev->node.down[val])) | |
779 | { | |
780 | prev->node.down[val]->leaf.parent = newnode; | |
781 | prev->node.down[val]->leaf.parent_val = NIBBLE_VAL(delem->leaf.key, i); | |
782 | } | |
783 | else | |
784 | { | |
785 | prev->node.down[val]->node.parent = newnode; | |
786 | prev->node.down[val]->node.parent_val = NIBBLE_VAL(delem->leaf.key, i); | |
787 | } | |
788 | ||
789 | prev->node.down[val] = newnode; | |
790 | } | |
791 | } | |
792 | else | |
793 | { | |
794 | /* This nibble is already checked. */ | |
795 | s_assert(prev->nibnum == i); | |
796 | newnode = prev; | |
797 | } | |
798 | ||
799 | val = NIBBLE_VAL(ckey, i); | |
800 | place1 = &newnode->node.down[val]; | |
801 | s_assert(*place1 == NULL); | |
802 | *place1 = rb_malloc(sizeof(struct irc_radixtree_leaf)); | |
803 | s_assert(*place1 != NULL); | |
804 | (*place1)->nibnum = -1; | |
805 | (*place1)->leaf.data = data; | |
806 | (*place1)->leaf.key = ckey; | |
807 | (*place1)->leaf.parent = newnode; | |
808 | (*place1)->leaf.parent_val = val; | |
809 | dict->count++; | |
810 | return &(*place1)->leaf; | |
811 | } | |
812 | ||
813 | int | |
814 | irc_radixtree_add(struct irc_radixtree *dict, const char *key, void *data) | |
815 | { | |
1b685743 | 816 | return (irc_radixtree_elem_add(dict, key, data) != NULL); |
8e6ba6f9 AC |
817 | } |
818 | ||
819 | /* | |
820 | * irc_radixtree_delete(struct irc_radixtree *dtree, const char *key) | |
821 | * | |
822 | * Deletes data from a patricia tree. | |
823 | * | |
824 | * Inputs: | |
825 | * - patricia tree object | |
826 | * - name of DTree node to delete | |
827 | * | |
828 | * Outputs: | |
829 | * - on success, the remaining data that needs to be rb_freed | |
830 | * - on failure, NULL | |
831 | * | |
832 | * Side Effects: | |
833 | * - data is removed from the DTree. | |
834 | * | |
835 | * Notes: | |
836 | * - the returned data needs to be rb_freed/released manually! | |
837 | */ | |
838 | void * | |
839 | irc_radixtree_delete(struct irc_radixtree *dict, const char *key) | |
840 | { | |
841 | void *data; | |
842 | struct irc_radixtree_leaf *leaf; | |
843 | ||
704697b6 | 844 | leaf = irc_radixtree_elem_find(dict, key, 0); |
8e6ba6f9 AC |
845 | |
846 | if (leaf == NULL) | |
847 | return NULL; | |
848 | ||
849 | data = leaf->data; | |
850 | irc_radixtree_elem_delete(dict, leaf); | |
851 | return data; | |
852 | } | |
853 | ||
854 | void | |
855 | irc_radixtree_elem_delete(struct irc_radixtree *dict, struct irc_radixtree_leaf *leaf) | |
856 | { | |
857 | union irc_radixtree_elem *delem, *prev, *next; | |
858 | ||
859 | int val, i, used; | |
860 | ||
861 | s_assert(dict != NULL); | |
862 | s_assert(leaf != NULL); | |
863 | ||
864 | delem = (union irc_radixtree_elem *) leaf; | |
865 | ||
866 | val = delem->leaf.parent_val; | |
867 | prev = delem->leaf.parent; | |
868 | ||
869 | rb_free(delem->leaf.key); | |
870 | rb_free(delem); | |
871 | ||
872 | if (prev != NULL) | |
873 | { | |
874 | prev->node.down[val] = NULL; | |
875 | ||
876 | /* Leaf is gone, now consider the node it was in. */ | |
877 | delem = prev; | |
878 | ||
879 | used = -1; | |
880 | ||
881 | for (i = 0; i < POINTERS_PER_NODE; i++) | |
882 | if (delem->node.down[i] != NULL) | |
883 | used = used == -1 ? i : -2; | |
884 | ||
885 | s_assert(used == -2 || used >= 0); | |
886 | ||
887 | if (used >= 0) | |
888 | { | |
889 | /* Only one pointer in this node, remove it. | |
890 | * Replace the pointer that pointed to it by | |
891 | * the sole pointer in it. | |
892 | */ | |
893 | next = delem->node.down[used]; | |
894 | val = delem->node.parent_val; | |
895 | prev = delem->node.parent; | |
896 | ||
897 | if (prev != NULL) | |
898 | prev->node.down[val] = next; | |
899 | else | |
900 | dict->root = next; | |
901 | ||
902 | if (IS_LEAF(next)) | |
903 | next->leaf.parent = prev, next->leaf.parent_val = val; | |
904 | else | |
905 | next->node.parent = prev, next->node.parent_val = val; | |
906 | ||
907 | rb_free(delem); | |
908 | } | |
909 | } | |
910 | else | |
911 | { | |
912 | /* This was the last leaf. */ | |
913 | dict->root = NULL; | |
914 | } | |
915 | ||
916 | dict->count--; | |
917 | ||
918 | if (dict->count == 0) | |
919 | { | |
920 | s_assert(dict->root == NULL); | |
921 | dict->root = NULL; | |
922 | } | |
923 | } | |
924 | ||
925 | /* | |
926 | * irc_radixtree_retrieve(struct irc_radixtree *dtree, const char *key) | |
927 | * | |
928 | * Retrieves data from a patricia. | |
929 | * | |
930 | * Inputs: | |
931 | * - patricia tree object | |
932 | * - name of node to lookup | |
933 | * | |
934 | * Outputs: | |
935 | * - on success, the data bound to the DTree node. | |
936 | * - on failure, NULL | |
937 | * | |
938 | * Side Effects: | |
939 | * - none | |
940 | */ | |
941 | void * | |
942 | irc_radixtree_retrieve(struct irc_radixtree *dtree, const char *key) | |
943 | { | |
704697b6 | 944 | struct irc_radixtree_leaf *delem = irc_radixtree_elem_find(dtree, key, 0); |
8e6ba6f9 AC |
945 | |
946 | if (delem != NULL) | |
947 | return delem->data; | |
948 | ||
949 | return NULL; | |
950 | } | |
951 | ||
952 | const char * | |
1b685743 | 953 | irc_radixtree_elem_get_key(struct irc_radixtree_leaf *leaf) |
8e6ba6f9 AC |
954 | { |
955 | s_assert(leaf != NULL); | |
956 | ||
957 | return leaf->key; | |
958 | } | |
959 | ||
960 | void | |
1b685743 | 961 | irc_radixtree_elem_set_data(struct irc_radixtree_leaf *leaf, void *data) |
8e6ba6f9 AC |
962 | { |
963 | s_assert(leaf != NULL); | |
964 | ||
965 | leaf->data = data; | |
966 | } | |
967 | ||
968 | void * | |
1b685743 | 969 | irc_radixtree_elem_get_data(struct irc_radixtree_leaf *leaf) |
8e6ba6f9 AC |
970 | { |
971 | s_assert(leaf != NULL); | |
972 | ||
973 | return leaf->data; | |
974 | } | |
975 | ||
976 | /* | |
977 | * irc_radixtree_size(struct irc_radixtree *dict) | |
978 | * | |
979 | * Returns the size of a patricia. | |
980 | * | |
981 | * Inputs: | |
982 | * - patricia tree object | |
983 | * | |
984 | * Outputs: | |
985 | * - size of patricia | |
986 | * | |
987 | * Side Effects: | |
988 | * - none | |
989 | */ | |
990 | unsigned int | |
991 | irc_radixtree_size(struct irc_radixtree *dict) | |
992 | { | |
993 | s_assert(dict != NULL); | |
994 | ||
995 | return dict->count; | |
996 | } | |
997 | ||
998 | /* returns the sum of the depths of the subtree rooted in delem at depth depth */ | |
999 | /* there is no need for this to be recursive, but it is easier... */ | |
1000 | static int | |
1001 | stats_recurse(union irc_radixtree_elem *delem, int depth, int *pmaxdepth) | |
1002 | { | |
1003 | int result = 0; | |
1004 | int val; | |
1005 | union irc_radixtree_elem *next; | |
1006 | ||
1007 | if (depth > *pmaxdepth) | |
1008 | *pmaxdepth = depth; | |
1009 | ||
1010 | if (depth == 0) | |
1011 | { | |
1012 | if (IS_LEAF(delem)) | |
1013 | s_assert(delem->leaf.parent == NULL); | |
1014 | ||
1015 | else | |
1016 | s_assert(delem->node.parent == NULL); | |
1017 | } | |
1018 | ||
1019 | if (IS_LEAF(delem)) | |
1020 | return depth; | |
1021 | ||
1022 | for (val = 0; val < POINTERS_PER_NODE; val++) | |
1023 | { | |
1024 | next = delem->node.down[val]; | |
1025 | ||
1026 | if (next == NULL) | |
1027 | continue; | |
1028 | ||
1029 | result += stats_recurse(next, depth + 1, pmaxdepth); | |
1030 | ||
1031 | if (IS_LEAF(next)) | |
1032 | { | |
1033 | s_assert(next->leaf.parent == delem); | |
1034 | s_assert(next->leaf.parent_val == val); | |
1035 | } | |
1036 | else | |
1037 | { | |
1038 | s_assert(next->node.parent == delem); | |
1039 | s_assert(next->node.parent_val == val); | |
1040 | s_assert(next->node.nibnum > delem->node.nibnum); | |
1041 | } | |
1042 | } | |
1043 | ||
1044 | return result; | |
1045 | } | |
1046 | ||
1047 | /* | |
1048 | * irc_radixtree_stats(struct irc_radixtree *dict, void (*cb)(const char *line, void *privdata), void *privdata) | |
1049 | * | |
1050 | * Returns the size of a patricia. | |
1051 | * | |
1052 | * Inputs: | |
1053 | * - patricia tree object | |
1054 | * - callback | |
1055 | * - data for callback | |
1056 | * | |
1057 | * Outputs: | |
1058 | * - none | |
1059 | * | |
1060 | * Side Effects: | |
1061 | * - callback called with stats text | |
1062 | */ | |
1063 | void | |
1064 | irc_radixtree_stats(struct irc_radixtree *dict, void (*cb)(const char *line, void *privdata), void *privdata) | |
1065 | { | |
1066 | char str[256]; | |
1067 | int sum, maxdepth; | |
1068 | ||
1069 | s_assert(dict != NULL); | |
1070 | ||
8e6ba6f9 | 1071 | maxdepth = 0; |
8e6ba6f9 AC |
1072 | if (dict->count > 0) |
1073 | { | |
1074 | sum = stats_recurse(dict->root, 0, &maxdepth); | |
8dacf9e9 | 1075 | snprintf(str, sizeof str, "%-30s %-15s %-10d %-10d %-10d %-10d", dict->id, "RADIX", dict->count, sum, sum / dict->count, maxdepth); |
8e6ba6f9 AC |
1076 | } |
1077 | else | |
1078 | { | |
8dacf9e9 | 1079 | snprintf(str, sizeof str, "%-30s %-15s %-10s %-10s %-10s %-10s", dict->id, "RADIX", "0", "0", "0", "0"); |
8e6ba6f9 AC |
1080 | } |
1081 | ||
1082 | cb(str, privdata); | |
1083 | return; | |
1084 | } | |
325cc939 AC |
1085 | |
1086 | void | |
1087 | irc_radixtree_stats_walk(void (*cb)(const char *line, void *privdata), void *privdata) | |
1088 | { | |
1089 | rb_dlink_node *ptr; | |
1090 | ||
1091 | RB_DLINK_FOREACH(ptr, radixtree_list.head) | |
1092 | { | |
1093 | irc_radixtree_stats(ptr->data, cb, privdata); | |
1094 | } | |
1095 | } | |
db891ac3 AC |
1096 | |
1097 | void irc_radixtree_irccasecanon(char *str) | |
1098 | { | |
1099 | while (*str) | |
1100 | { | |
1101 | *str = ToUpper(*str); | |
1102 | str++; | |
1103 | } | |
1104 | return; | |
1105 | } | |
1106 | ||
1107 | void irc_radixtree_strcasecanon(char *str) | |
1108 | { | |
1109 | while (*str) | |
1110 | { | |
1111 | *str = toupper((unsigned char)*str); | |
1112 | str++; | |
1113 | } | |
1114 | return; | |
1115 | } | |
1116 |