X-Git-Url: https://www.tinc-vpn.org/git/browse?p=tinc;a=blobdiff_plain;f=lib%2Favl_tree.c;h=3bfdfeeeecaf1f23cd0252facf2692eabc816d13;hp=009c680b29f27ad16e922999410c40cc7a81647b;hb=3353ab37c2d6fb3652fbf7a85d85997be1c0c1b5;hpb=9f38e394636a177c00a4545de2a99c661de36386 diff --git a/lib/avl_tree.c b/lib/avl_tree.c index 009c680b..3bfdfeee 100644 --- a/lib/avl_tree.c +++ b/lib/avl_tree.c @@ -1,9 +1,9 @@ /* avl_tree.c -- avl_ tree and linked list convenience Copyright (C) 1998 Michael H. Buselli - 2000,2001 Ivo Timmermans , - 2000,2001 Guus Sliepen - 2000,2001 Wessel Dankers + 2000-2005 Ivo Timmermans, + 2000-2006 Guus Sliepen + 2000-2005 Wessel Dankers 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 @@ -21,22 +21,21 @@ Original AVL tree library by Michael H. Buselli . - Modified 2000-11-28 by Wessel Dankers to use counts + Modified 2000-11-28 by Wessel Dankers 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 (http://tinc.nl.linux.org/) by - Guus Sliepen . + library for inclusion into tinc (http://www.tinc-vpn.org/) by + Guus Sliepen . - $Id: avl_tree.c,v 1.1.2.10 2002/09/09 21:49:16 guus Exp $ + $Id$ */ -#include -#include -#include +#include "system.h" #include "avl_tree.h" +#include "xalloc.h" #ifdef AVL_COUNT #define AVL_NODE_COUNT(n) ((n) ? (n)->count : 0) @@ -53,7 +52,9 @@ #endif #ifndef AVL_DEPTH -int lg(unsigned int u) +static int lg(unsigned int u) __attribute__ ((__const__)); + +static int lg(unsigned int u) { int r = 1; @@ -89,7 +90,7 @@ int lg(unsigned int u) /* Internal helper functions */ -int avl_check_balance(avl_node_t * node) +static int avl_check_balance(const avl_node_t *node) { #ifdef AVL_DEPTH int d; @@ -117,7 +118,7 @@ int avl_check_balance(avl_node_t * node) #endif } -void avl_rebalance(avl_tree_t * tree, avl_node_t * node) +static void avl_rebalance(avl_tree_t *tree, avl_node_t *node) { avl_node_t *child; avl_node_t *gchild; @@ -272,17 +273,17 @@ avl_tree_t *avl_alloc_tree(avl_compare_t compare, avl_action_t delete) return tree; } -void avl_free_tree(avl_tree_t * tree) +void avl_free_tree(avl_tree_t *tree) { free(tree); } avl_node_t *avl_alloc_node(void) { - return (avl_node_t *)xmalloc_and_zero(sizeof(avl_node_t)); + return xmalloc_and_zero(sizeof(avl_node_t)); } -void avl_free_node(avl_tree_t * tree, avl_node_t * node) +void avl_free_node(avl_tree_t *tree, avl_node_t *node) { if(node->data && tree->delete) tree->delete(node->data); @@ -292,7 +293,7 @@ void avl_free_node(avl_tree_t * tree, avl_node_t * node) /* Searching */ -void *avl_search(const avl_tree_t * tree, const void *data) +void *avl_search(const avl_tree_t *tree, const void *data) { avl_node_t *node; @@ -301,7 +302,7 @@ void *avl_search(const avl_tree_t * tree, const void *data) return node ? node->data : NULL; } -void *avl_search_closest(const avl_tree_t * tree, const void *data, int *result) +void *avl_search_closest(const avl_tree_t *tree, const void *data, int *result) { avl_node_t *node; @@ -310,7 +311,7 @@ void *avl_search_closest(const avl_tree_t * tree, const void *data, int *result) return node ? node->data : NULL; } -void *avl_search_closest_smaller(const avl_tree_t * tree, const void *data) +void *avl_search_closest_smaller(const avl_tree_t *tree, const void *data) { avl_node_t *node; @@ -319,7 +320,7 @@ void *avl_search_closest_smaller(const avl_tree_t * tree, const void *data) return node ? node->data : NULL; } -void *avl_search_closest_greater(const avl_tree_t * tree, const void *data) +void *avl_search_closest_greater(const avl_tree_t *tree, const void *data) { avl_node_t *node; @@ -328,7 +329,7 @@ void *avl_search_closest_greater(const avl_tree_t * tree, const void *data) return node ? node->data : NULL; } -avl_node_t *avl_search_node(const avl_tree_t * tree, const void *data) +avl_node_t *avl_search_node(const avl_tree_t *tree, const void *data) { avl_node_t *node; int result; @@ -338,7 +339,7 @@ avl_node_t *avl_search_node(const avl_tree_t * tree, const void *data) return result ? NULL : node; } -avl_node_t *avl_search_closest_node(const avl_tree_t * tree, const void *data, +avl_node_t *avl_search_closest_node(const avl_tree_t *tree, const void *data, int *result) { avl_node_t *node; @@ -381,7 +382,7 @@ avl_node_t *avl_search_closest_node(const avl_tree_t * tree, const void *data, return node; } -avl_node_t *avl_search_closest_smaller_node(const avl_tree_t * tree, +avl_node_t *avl_search_closest_smaller_node(const avl_tree_t *tree, const void *data) { avl_node_t *node; @@ -395,7 +396,7 @@ avl_node_t *avl_search_closest_smaller_node(const avl_tree_t * tree, return node; } -avl_node_t *avl_search_closest_greater_node(const avl_tree_t * tree, +avl_node_t *avl_search_closest_greater_node(const avl_tree_t *tree, const void *data) { avl_node_t *node; @@ -411,7 +412,7 @@ avl_node_t *avl_search_closest_greater_node(const avl_tree_t * tree, /* Insertion and deletion */ -avl_node_t *avl_insert(avl_tree_t * tree, void *data) +avl_node_t *avl_insert(avl_tree_t *tree, void *data) { avl_node_t *closest, *new; int result; @@ -451,7 +452,7 @@ avl_node_t *avl_insert(avl_tree_t * tree, void *data) return new; } -avl_node_t *avl_insert_node(avl_tree_t * tree, avl_node_t * node) +avl_node_t *avl_insert_node(avl_tree_t *tree, avl_node_t *node) { avl_node_t *closest; int result; @@ -485,24 +486,31 @@ avl_node_t *avl_insert_node(avl_tree_t * tree, avl_node_t * node) return node; } -void avl_insert_top(avl_tree_t * tree, avl_node_t * 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) +void avl_insert_before(avl_tree_t *tree, avl_node_t *before, + avl_node_t *node) { - if(!before) - return tree->tail ? avl_insert_after(tree, tree->tail, node) : avl_insert_top(tree, 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) - return avl_insert_after(tree, before->prev, node); + if(before->left) { + avl_insert_after(tree, before->prev, node); + return; + } if(before->prev) before->prev->next = node; @@ -512,18 +520,23 @@ void avl_insert_before(avl_tree_t * tree, avl_node_t * before, before->prev = node; before->left = node; - avl_rebalance(tree, before->parent); + avl_rebalance(tree, before); } -void avl_insert_after(avl_tree_t * tree, avl_node_t * after, avl_node_t * node) +void avl_insert_after(avl_tree_t *tree, avl_node_t *after, avl_node_t *node) { - if(!after) - return tree->head ? avl_insert_before(tree, tree->head, - node) : avl_insert_top(tree, - node); + if(!after) { + if(tree->head) + avl_insert_before(tree, tree->head, node); + else + avl_insert_top(tree, node); + return; + } - if(after->right) - return avl_insert_before(tree, after->next, node); + if(after->right) { + avl_insert_before(tree, after->next, node); + return; + } node->prev = after; node->parent = after; @@ -537,10 +550,10 @@ void avl_insert_after(avl_tree_t * tree, avl_node_t * after, avl_node_t * node) after->next = node; after->right = node; - avl_rebalance(tree, after->parent); + avl_rebalance(tree, after); } -avl_node_t *avl_unlink(avl_tree_t * tree, void *data) +avl_node_t *avl_unlink(avl_tree_t *tree, void *data) { avl_node_t *node; @@ -552,7 +565,7 @@ avl_node_t *avl_unlink(avl_tree_t * tree, void *data) return node; } -void avl_unlink_node(avl_tree_t * tree, avl_node_t * node) +void avl_unlink_node(avl_tree_t *tree, avl_node_t *node) { avl_node_t *parent; avl_node_t **superparent; @@ -621,13 +634,13 @@ void avl_unlink_node(avl_tree_t * tree, avl_node_t * node) #endif } -void avl_delete_node(avl_tree_t * tree, avl_node_t * node) +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) +void avl_delete(avl_tree_t *tree, void *data) { avl_node_t *node; @@ -639,11 +652,11 @@ void avl_delete(avl_tree_t * tree, void *data) /* Fast tree cleanup */ -void avl_delete_tree(avl_tree_t * tree) +void avl_delete_tree(avl_tree_t *tree) { avl_node_t *node, *next; - for(node = tree->root; node; node = next) { + for(node = tree->head; node; node = next) { next = node->next; avl_free_node(tree, node); } @@ -653,7 +666,7 @@ void avl_delete_tree(avl_tree_t * tree) /* Tree walking */ -void avl_foreach(avl_tree_t * tree, avl_action_t action) +void avl_foreach(const avl_tree_t *tree, avl_action_t action) { avl_node_t *node, *next; @@ -663,7 +676,7 @@ void avl_foreach(avl_tree_t * tree, avl_action_t action) } } -void avl_foreach_node(avl_tree_t * tree, avl_action_t action) +void avl_foreach_node(const avl_tree_t *tree, avl_action_t action) { avl_node_t *node, *next; @@ -676,12 +689,12 @@ void avl_foreach_node(avl_tree_t * tree, avl_action_t action) /* Indexing */ #ifdef AVL_COUNT -unsigned int avl_count(avl_tree_t * tree) +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 *avl_get_node(const avl_tree_t *tree, unsigned int index) { avl_node_t *node; unsigned int c; @@ -704,7 +717,7 @@ avl_node_t *avl_get_node(const avl_tree_t * tree, unsigned int index) return NULL; } -unsigned int avl_index(const avl_node_t * node) +unsigned int avl_index(const avl_node_t *node) { avl_node_t *next; unsigned int index; @@ -721,7 +734,7 @@ unsigned int avl_index(const avl_node_t * node) } #endif #ifdef AVL_DEPTH -unsigned int avl_depth(avl_tree_t * tree) +unsigned int avl_depth(const avl_tree_t *tree) { return AVL_NODE_DEPTH(tree->root); }