123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757 |
- /*
- avl_tree.c -- avl_ tree and linked list convenience
- Copyright (C) 1998 Michael H. Buselli
- 2000-2005 Ivo Timmermans,
- 2000-2015 Guus Sliepen <guus@tinc-vpn.org>
- 2000-2005 Wessel Dankers <wsl@tinc-vpn.org>
- This program is free software; you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation; either version 2 of the License, or
- (at your option) any later version.
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
- You should have received a copy of the GNU General Public License along
- with this program; if not, write to the Free Software Foundation, Inc.,
- 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
- Original AVL tree library by Michael H. Buselli <cosine@cosine.org>.
- Modified 2000-11-28 by Wessel Dankers <wsl@tinc-vpn.org> to use counts
- instead of depths, to add the ->next and ->prev and to generally obfuscate
- the code. Mail me if you found a bug.
- Cleaned up and incorporated some of the ideas from the red-black tree
- library for inclusion into tinc (https://www.tinc-vpn.org/) by
- Guus Sliepen <guus@tinc-vpn.org>.
- */
- #include "system.h"
- #include "avl_tree.h"
- #include "xalloc.h"
- #ifdef AVL_COUNT
- #define AVL_NODE_COUNT(n) ((n) ? (n)->count : 0)
- #define AVL_L_COUNT(n) (AVL_NODE_COUNT((n)->left))
- #define AVL_R_COUNT(n) (AVL_NODE_COUNT((n)->right))
- #define AVL_CALC_COUNT(n) (AVL_L_COUNT(n) + AVL_R_COUNT(n) + 1)
- #endif
- #ifdef AVL_DEPTH
- #define AVL_NODE_DEPTH(n) ((n) ? (n)->depth : 0)
- #define L_AVL_DEPTH(n) (AVL_NODE_DEPTH((n)->left))
- #define R_AVL_DEPTH(n) (AVL_NODE_DEPTH((n)->right))
- #define AVL_CALC_DEPTH(n) ((L_AVL_DEPTH(n)>R_AVL_DEPTH(n)?L_AVL_DEPTH(n):R_AVL_DEPTH(n)) + 1)
- #endif
- #ifndef AVL_DEPTH
- static int lg(unsigned int u) __attribute__((__const__));
- static int lg(unsigned int u) {
- int r = 1;
- if(!u) {
- return 0;
- }
- if(u & 0xffff0000) {
- u >>= 16;
- r += 16;
- }
- if(u & 0x0000ff00) {
- u >>= 8;
- r += 8;
- }
- if(u & 0x000000f0) {
- u >>= 4;
- r += 4;
- }
- if(u & 0x0000000c) {
- u >>= 2;
- r += 2;
- }
- if(u & 0x00000002) {
- r++;
- }
- return r;
- }
- #endif
- /* Internal helper functions */
- static int avl_check_balance(const avl_node_t *node) {
- #ifdef AVL_DEPTH
- int d;
- d = R_AVL_DEPTH(node) - L_AVL_DEPTH(node);
- return d < -1 ? -1 : d > 1 ? 1 : 0;
- #else
- /* int d;
- * d = lg(AVL_R_COUNT(node)) - lg(AVL_L_COUNT(node));
- * d = d<-1?-1:d>1?1:0;
- */
- int pl, r;
- pl = lg(AVL_L_COUNT(node));
- r = AVL_R_COUNT(node);
- if(r >> pl + 1) {
- return 1;
- }
- if(pl < 2 || r >> pl - 2) {
- return 0;
- }
- return -1;
- #endif
- }
- static void avl_rebalance(avl_tree_t *tree, avl_node_t *node) {
- avl_node_t *child;
- avl_node_t *gchild;
- avl_node_t *parent;
- avl_node_t **superparent;
- while(node) {
- parent = node->parent;
- superparent =
- parent ? node ==
- parent->left ? &parent->left : &parent->right : &tree->root;
- switch(avl_check_balance(node)) {
- case -1:
- child = node->left;
- #ifdef AVL_DEPTH
- if(L_AVL_DEPTH(child) >= R_AVL_DEPTH(child)) {
- #else
- if(AVL_L_COUNT(child) >= AVL_R_COUNT(child)) {
- #endif
- node->left = child->right;
- if(node->left) {
- node->left->parent = node;
- }
- child->right = node;
- node->parent = child;
- *superparent = child;
- child->parent = parent;
- #ifdef AVL_COUNT
- node->count = AVL_CALC_COUNT(node);
- child->count = AVL_CALC_COUNT(child);
- #endif
- #ifdef AVL_DEPTH
- node->depth = AVL_CALC_DEPTH(node);
- child->depth = AVL_CALC_DEPTH(child);
- #endif
- } else {
- gchild = child->right;
- node->left = gchild->right;
- if(node->left) {
- node->left->parent = node;
- }
- child->right = gchild->left;
- if(child->right) {
- child->right->parent = child;
- }
- gchild->right = node;
- gchild->right->parent = gchild;
- gchild->left = child;
- gchild->left->parent = gchild;
- *superparent = gchild;
- gchild->parent = parent;
- #ifdef AVL_COUNT
- node->count = AVL_CALC_COUNT(node);
- child->count = AVL_CALC_COUNT(child);
- gchild->count = AVL_CALC_COUNT(gchild);
- #endif
- #ifdef AVL_DEPTH
- node->depth = AVL_CALC_DEPTH(node);
- child->depth = AVL_CALC_DEPTH(child);
- gchild->depth = AVL_CALC_DEPTH(gchild);
- #endif
- }
- break;
- case 1:
- child = node->right;
- #ifdef AVL_DEPTH
- if(R_AVL_DEPTH(child) >= L_AVL_DEPTH(child)) {
- #else
- if(AVL_R_COUNT(child) >= AVL_L_COUNT(child)) {
- #endif
- node->right = child->left;
- if(node->right) {
- node->right->parent = node;
- }
- child->left = node;
- node->parent = child;
- *superparent = child;
- child->parent = parent;
- #ifdef AVL_COUNT
- node->count = AVL_CALC_COUNT(node);
- child->count = AVL_CALC_COUNT(child);
- #endif
- #ifdef AVL_DEPTH
- node->depth = AVL_CALC_DEPTH(node);
- child->depth = AVL_CALC_DEPTH(child);
- #endif
- } else {
- gchild = child->left;
- node->right = gchild->left;
- if(node->right) {
- node->right->parent = node;
- }
- child->left = gchild->right;
- if(child->left) {
- child->left->parent = child;
- }
- gchild->left = node;
- gchild->left->parent = gchild;
- gchild->right = child;
- gchild->right->parent = gchild;
- *superparent = gchild;
- gchild->parent = parent;
- #ifdef AVL_COUNT
- node->count = AVL_CALC_COUNT(node);
- child->count = AVL_CALC_COUNT(child);
- gchild->count = AVL_CALC_COUNT(gchild);
- #endif
- #ifdef AVL_DEPTH
- node->depth = AVL_CALC_DEPTH(node);
- child->depth = AVL_CALC_DEPTH(child);
- gchild->depth = AVL_CALC_DEPTH(gchild);
- #endif
- }
- break;
- default:
- #ifdef AVL_COUNT
- node->count = AVL_CALC_COUNT(node);
- #endif
- #ifdef AVL_DEPTH
- node->depth = AVL_CALC_DEPTH(node);
- #endif
- }
- node = parent;
- }
- }
- /* (De)constructors */
- avl_tree_t *avl_alloc_tree(avl_compare_t compare, avl_action_t delete) {
- avl_tree_t *tree;
- tree = xmalloc_and_zero(sizeof(avl_tree_t));
- tree->compare = compare;
- tree->delete = delete;
- return tree;
- }
- void avl_free_tree(avl_tree_t *tree) {
- free(tree);
- }
- avl_node_t *avl_alloc_node(void) {
- return xmalloc_and_zero(sizeof(avl_node_t));
- }
- void avl_free_node(avl_tree_t *tree, avl_node_t *node) {
- if(node->data && tree->delete) {
- tree->delete(node->data);
- }
- free(node);
- }
- /* Searching */
- void *avl_search(const avl_tree_t *tree, const void *data) {
- avl_node_t *node;
- node = avl_search_node(tree, data);
- return node ? node->data : NULL;
- }
- void *avl_search_closest(const avl_tree_t *tree, const void *data, int *result) {
- avl_node_t *node;
- node = avl_search_closest_node(tree, data, result);
- return node ? node->data : NULL;
- }
- void *avl_search_closest_smaller(const avl_tree_t *tree, const void *data) {
- avl_node_t *node;
- node = avl_search_closest_smaller_node(tree, data);
- return node ? node->data : NULL;
- }
- void *avl_search_closest_greater(const avl_tree_t *tree, const void *data) {
- avl_node_t *node;
- node = avl_search_closest_greater_node(tree, data);
- return node ? node->data : NULL;
- }
- avl_node_t *avl_search_node(const avl_tree_t *tree, const void *data) {
- avl_node_t *node;
- int result;
- node = avl_search_closest_node(tree, data, &result);
- return result ? NULL : node;
- }
- avl_node_t *avl_search_closest_node(const avl_tree_t *tree, const void *data,
- int *result) {
- avl_node_t *node;
- int c;
- node = tree->root;
- if(!node) {
- if(result) {
- *result = 0;
- }
- return NULL;
- }
- for(;;) {
- c = tree->compare(data, node->data);
- if(c < 0) {
- if(node->left) {
- node = node->left;
- } else {
- if(result) {
- *result = -1;
- }
- break;
- }
- } else if(c > 0) {
- if(node->right) {
- node = node->right;
- } else {
- if(result) {
- *result = 1;
- }
- break;
- }
- } else {
- if(result) {
- *result = 0;
- }
- break;
- }
- }
- return node;
- }
- avl_node_t *avl_search_closest_smaller_node(const avl_tree_t *tree,
- const void *data) {
- avl_node_t *node;
- int result;
- node = avl_search_closest_node(tree, data, &result);
- if(result < 0) {
- node = node->prev;
- }
- return node;
- }
- avl_node_t *avl_search_closest_greater_node(const avl_tree_t *tree,
- const void *data) {
- avl_node_t *node;
- int result;
- node = avl_search_closest_node(tree, data, &result);
- if(result > 0) {
- node = node->next;
- }
- return node;
- }
- /* Insertion and deletion */
- avl_node_t *avl_insert(avl_tree_t *tree, void *data) {
- avl_node_t *closest, *new;
- int result;
- if(!tree->root) {
- new = avl_alloc_node();
- new->data = data;
- avl_insert_top(tree, new);
- } else {
- closest = avl_search_closest_node(tree, data, &result);
- switch(result) {
- case -1:
- new = avl_alloc_node();
- new->data = data;
- avl_insert_before(tree, closest, new);
- break;
- case 1:
- new = avl_alloc_node();
- new->data = data;
- avl_insert_after(tree, closest, new);
- break;
- default:
- return NULL;
- }
- }
- #ifdef AVL_COUNT
- new->count = 1;
- #endif
- #ifdef AVL_DEPTH
- new->depth = 1;
- #endif
- return new;
- }
- avl_node_t *avl_insert_node(avl_tree_t *tree, avl_node_t *node) {
- avl_node_t *closest;
- int result;
- if(!tree->root) {
- avl_insert_top(tree, node);
- } else {
- closest = avl_search_closest_node(tree, node->data, &result);
- switch(result) {
- case -1:
- avl_insert_before(tree, closest, node);
- break;
- case 1:
- avl_insert_after(tree, closest, node);
- break;
- case 0:
- return NULL;
- }
- }
- #ifdef AVL_COUNT
- node->count = 1;
- #endif
- #ifdef AVL_DEPTH
- node->depth = 1;
- #endif
- return node;
- }
- void avl_insert_top(avl_tree_t *tree, avl_node_t *node) {
- node->prev = node->next = node->parent = NULL;
- tree->head = tree->tail = tree->root = node;
- }
- void avl_insert_before(avl_tree_t *tree, avl_node_t *before,
- avl_node_t *node) {
- if(!before) {
- if(tree->tail) {
- avl_insert_after(tree, tree->tail, node);
- } else {
- avl_insert_top(tree, node);
- }
- return;
- }
- node->next = before;
- node->parent = before;
- node->prev = before->prev;
- if(before->left) {
- avl_insert_after(tree, before->prev, node);
- return;
- }
- if(before->prev) {
- before->prev->next = node;
- } else {
- tree->head = node;
- }
- before->prev = node;
- before->left = node;
- avl_rebalance(tree, before);
- }
- void avl_insert_after(avl_tree_t *tree, avl_node_t *after, avl_node_t *node) {
- if(!after) {
- if(tree->head) {
- avl_insert_before(tree, tree->head, node);
- } else {
- avl_insert_top(tree, node);
- }
- return;
- }
- if(after->right) {
- avl_insert_before(tree, after->next, node);
- return;
- }
- node->prev = after;
- node->parent = after;
- node->next = after->next;
- if(after->next) {
- after->next->prev = node;
- } else {
- tree->tail = node;
- }
- after->next = node;
- after->right = node;
- avl_rebalance(tree, after);
- }
- avl_node_t *avl_unlink(avl_tree_t *tree, void *data) {
- avl_node_t *node;
- node = avl_search_node(tree, data);
- if(node) {
- avl_unlink_node(tree, node);
- }
- return node;
- }
- void avl_unlink_node(avl_tree_t *tree, avl_node_t *node) {
- avl_node_t *parent;
- avl_node_t **superparent;
- avl_node_t *subst, *left, *right;
- avl_node_t *balnode;
- if(node->prev) {
- node->prev->next = node->next;
- } else {
- tree->head = node->next;
- }
- if(node->next) {
- node->next->prev = node->prev;
- } else {
- tree->tail = node->prev;
- }
- parent = node->parent;
- superparent =
- parent ? node ==
- parent->left ? &parent->left : &parent->right : &tree->root;
- left = node->left;
- right = node->right;
- if(!left) {
- *superparent = right;
- if(right) {
- right->parent = parent;
- }
- balnode = parent;
- } else if(!right) {
- *superparent = left;
- left->parent = parent;
- balnode = parent;
- } else {
- subst = node->prev;
- if(!subst) { // This only happens if node is not actually in a tree at all.
- abort();
- }
- if(subst == left) {
- balnode = subst;
- } else {
- balnode = subst->parent;
- balnode->right = subst->left;
- if(balnode->right) {
- balnode->right->parent = balnode;
- }
- subst->left = left;
- left->parent = subst;
- }
- subst->right = right;
- subst->parent = parent;
- right->parent = subst;
- *superparent = subst;
- }
- avl_rebalance(tree, balnode);
- node->next = node->prev = node->parent = node->left = node->right = NULL;
- #ifdef AVL_COUNT
- node->count = 0;
- #endif
- #ifdef AVL_DEPTH
- node->depth = 0;
- #endif
- }
- void avl_delete_node(avl_tree_t *tree, avl_node_t *node) {
- avl_unlink_node(tree, node);
- avl_free_node(tree, node);
- }
- void avl_delete(avl_tree_t *tree, void *data) {
- avl_node_t *node;
- node = avl_search_node(tree, data);
- if(node) {
- avl_delete_node(tree, node);
- }
- }
- /* Fast tree cleanup */
- void avl_delete_tree(avl_tree_t *tree) {
- avl_node_t *node, *next;
- for(node = tree->head; node; node = next) {
- next = node->next;
- avl_free_node(tree, node);
- }
- avl_free_tree(tree);
- }
- /* Tree walking */
- void avl_foreach(const avl_tree_t *tree, avl_action_t action) {
- avl_node_t *node, *next;
- for(node = tree->head; node; node = next) {
- next = node->next;
- action(node->data);
- }
- }
- void avl_foreach_node(const avl_tree_t *tree, avl_action_t action) {
- avl_node_t *node, *next;
- for(node = tree->head; node; node = next) {
- next = node->next;
- action(node);
- }
- }
- /* Indexing */
- #ifdef AVL_COUNT
- unsigned int avl_count(const avl_tree_t *tree) {
- return AVL_NODE_COUNT(tree->root);
- }
- avl_node_t *avl_get_node(const avl_tree_t *tree, unsigned int index) {
- avl_node_t *node;
- unsigned int c;
- node = tree->root;
- while(node) {
- c = AVL_L_COUNT(node);
- if(index < c) {
- node = node->left;
- } else if(index > c) {
- node = node->right;
- index -= c + 1;
- } else {
- return node;
- }
- }
- return NULL;
- }
- unsigned int avl_index(const avl_node_t *node) {
- avl_node_t *next;
- unsigned int index;
- index = AVL_L_COUNT(node);
- while((next = node->parent)) {
- if(node == next->right) {
- index += AVL_L_COUNT(next) + 1;
- }
- node = next;
- }
- return index;
- }
- #endif
- #ifdef AVL_DEPTH
- unsigned int avl_depth(const avl_tree_t *tree) {
- return AVL_NODE_DEPTH(tree->root);
- }
- #endif
|