X-Git-Url: https://git.sur5r.net/?a=blobdiff_plain;f=include%2Favl.h;h=2f8ad2124dfc98c88b7ded39c2bfd28ebdc85dd3;hb=3028424f68dda535b57a69e6619a3b1de0182872;hp=745cc17d61ee4cfd1f55a40d6cb9c2630fba3253;hpb=42e0d83cb3a1a1c5b25183f1ab74ce7edbe25de7;p=openldap

diff --git a/include/avl.h b/include/avl.h
index 745cc17d61..2f8ad2124d 100644
--- a/include/avl.h
+++ b/include/avl.h
@@ -1,5 +1,13 @@
-/* avl.h - avl tree definitions */
 /*
+ * Copyright 1998,1999 The OpenLDAP Foundation, Redwood City, California, USA
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms are permitted only
+ * as authorized by the OpenLDAP Public License.  A copy of this
+ * license is available at http://www.OpenLDAP.org/license.html or
+ * in file LICENSE in the top-level directory of the distribution.
+ */
+/* Portions
  * Copyright (c) 1993 Regents of the University of Michigan.
  * All rights reserved.
  *
@@ -10,18 +18,23 @@
  * software without specific prior written permission. This software
  * is provided ``as is'' without express or implied warranty.
  */
+/* avl.h - avl tree definitions */
 
 
 #ifndef _AVL
 #define _AVL
 
+#include <ldap_cdefs.h>
+
 /*
  * this structure represents a generic avl tree node.
  */
 
+LDAP_BEGIN_DECL
+
 typedef struct avlnode {
-	caddr_t		avl_data;
-	char		avl_bf;
+	void*		avl_data;
+	signed char		avl_bf;
 	struct avlnode	*avl_left;
 	struct avlnode	*avl_right;
 } Avlnode;
@@ -29,28 +42,65 @@ typedef struct avlnode {
 #define NULLAVL	((Avlnode *) NULL)
 
 /* balance factor values */
-#define LH 	-1
+#define LH 	(-1)
 #define EH 	0
 #define RH 	1
 
 /* avl routines */
-#define avl_getone(x)	(x == 0 ? 0 : (x)->avl_data)
-#define avl_onenode(x)	(x == 0 || ((x)->avl_left == 0 && (x)->avl_right == 0))
-extern int		avl_insert();
-extern caddr_t		avl_delete();
-extern caddr_t		avl_find();
-extern caddr_t		avl_getfirst();
-extern caddr_t		avl_getnext();
-extern int		avl_dup_error();
-extern int		avl_apply();
+#define avl_getone(x)	((x) == 0 ? 0 : (x)->avl_data)
+#define avl_onenode(x)	((x) == 0 || ((x)->avl_left == 0 && (x)->avl_right == 0))
+
+typedef int		(*AVL_APPLY) LDAP_P((void *, void*));
+typedef int		(*AVL_CMP) LDAP_P((void*, void*));
+typedef int		(*AVL_DUP) LDAP_P((void*, void*));
+typedef void	(*AVL_FREE) LDAP_P((void*));
+
+LDAP_F int
+avl_free LDAP_P(( Avlnode *root, AVL_FREE dfree ));
+
+LDAP_F int
+avl_insert LDAP_P((Avlnode **, void*, AVL_CMP, AVL_DUP));
+
+LDAP_F void*
+avl_delete LDAP_P((Avlnode **, void*, AVL_CMP));
+
+LDAP_F void*
+avl_find LDAP_P((Avlnode *, void*, AVL_CMP));
+
+LDAP_F void*
+avl_find_lin LDAP_P((Avlnode *, void*, AVL_CMP));
+
+LDAP_F void*
+avl_getfirst LDAP_P((Avlnode *));
+
+#ifdef AVL_REENTRANT
+/* ??? avl.c does not provide this version ??? */
+LDAP_F void*
+avl_getnext LDAP_P((Avlnode *, void* ));
+#else
+LDAP_F void*
+avl_getnext LDAP_P((void));
+#endif
+
+LDAP_F int
+avl_dup_error LDAP_P((void*, void*));
+
+LDAP_F int
+avl_dup_ok LDAP_P((void*, void*));
+
+LDAP_F int
+avl_apply LDAP_P((Avlnode *, AVL_APPLY, void*, int, int));
+
+LDAP_F int
+avl_prefixapply LDAP_P((Avlnode *, void*, AVL_CMP, void*, AVL_CMP, void*, int));
 
 /* apply traversal types */
 #define AVL_PREORDER	1
 #define AVL_INORDER	2
 #define AVL_POSTORDER	3
 /* what apply returns if it ran out of nodes */
-#define AVL_NOMORE	-6
+#define AVL_NOMORE	(-6)
 
-typedef int	(*IFP)();
+LDAP_END_DECL
 
 #endif /* _AVL */