update avl implementation from packetbb

diff --git a/avl.c b/avl.c
index bde40b7..fa23b03 100644 (file)
--- a/avl.c
+++ b/avl.c
@@ -111,7 +111,7 @@ avl_init(struct avl_tree *tree, avl_tree_comp comp, bool allow_dups, void *ptr)
  * @param pointer to elemen, NULL if no fitting one was found
  */
 void *
  * @param pointer to elemen, NULL if no fitting one was found
  */
 void *

-__avl_find_element(struct avl_tree *tree, const void *key, size_t offset, enum avl_find_mode mode) {
+__avl_find_element(const struct avl_tree *tree, const void *key, size_t offset, enum avl_find_mode mode) {

   void *node = NULL;
 
   switch (mode) {
   void *node = NULL;
 
   switch (mode) {


@@ -136,7 +136,7 @@ __avl_find_element(struct avl_tree *tree, const void *key, size_t offset, enum a
  *    this key exists.
  */
 struct avl_node *
  *    this key exists.
  */
 struct avl_node *

-avl_find(struct avl_tree *tree, const void *key)
+avl_find(const struct avl_tree *tree, const void *key)

 {
   struct avl_node *node;
   int diff;
 {
   struct avl_node *node;
   int diff;


@@ -158,7 +158,7 @@ avl_find(struct avl_tree *tree, const void *key)
  *    key less or equal specified key exists.
  */
 struct avl_node *
  *    key less or equal specified key exists.
  */
 struct avl_node *

-avl_find_lessequal(struct avl_tree *tree, const void *key) {
+avl_find_lessequal(const struct avl_tree *tree, const void *key) {

   struct avl_node *node, *next;
   int diff;
 
   struct avl_node *node, *next;
   int diff;
 


@@ -200,7 +200,7 @@ avl_find_lessequal(struct avl_tree *tree, const void *key) {
  *    key greater or equal specified key exists.
  */
 struct avl_node *
  *    key greater or equal specified key exists.
  */
 struct avl_node *

-avl_find_greaterequal(struct avl_tree *tree, const void *key) {
+avl_find_greaterequal(const struct avl_tree *tree, const void *key) {

   struct avl_node *node, *next;
   int diff;
 
   struct avl_node *node, *next;
   int diff;
 

diff --git a/avl.h b/avl.h
index 1c57604..80a29b7 100644 (file)
--- a/avl.h
+++ b/avl.h
@@ -155,12 +155,12 @@ enum avl_find_mode {
 };
 
 void EXPORT(avl_init)(struct avl_tree *, avl_tree_comp, bool, void *);
 };
 
 void EXPORT(avl_init)(struct avl_tree *, avl_tree_comp, bool, void *);

-struct avl_node *EXPORT(avl_find)(struct avl_tree *, const void *);
-struct avl_node *EXPORT(avl_find_greaterequal)(struct avl_tree *tree, const void *key);
-struct avl_node *EXPORT(avl_find_lessequal)(struct avl_tree *tree, const void *key);
+struct avl_node *EXPORT(avl_find)(const struct avl_tree *, const void *);
+struct avl_node *EXPORT(avl_find_greaterequal)(const struct avl_tree *tree, const void *key);
+struct avl_node *EXPORT(avl_find_lessequal)(const struct avl_tree *tree, const void *key);

 int EXPORT(avl_insert)(struct avl_tree *, struct avl_node *);
 void EXPORT(avl_delete)(struct avl_tree *, struct avl_node *);
 int EXPORT(avl_insert)(struct avl_tree *, struct avl_node *);
 void EXPORT(avl_delete)(struct avl_tree *, struct avl_node *);

-void *EXPORT(__avl_find_element)(struct avl_tree *tree, const void *key,
+void *EXPORT(__avl_find_element)(const struct avl_tree *tree, const void *key,

     size_t offset, enum avl_find_mode mode);
 
 /**
     size_t offset, enum avl_find_mode mode);
 
 /**