projects
/
tinc
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Replace Opaque and Strict options with a TunnelServer option.
[tinc]
/
lib
/
avl_tree.c
diff --git
a/lib/avl_tree.c
b/lib/avl_tree.c
index
65df7b7
..
24f4a08
100644
(file)
--- a/
lib/avl_tree.c
+++ b/
lib/avl_tree.c
@@
-29,7
+29,7
@@
library for inclusion into tinc (http://tinc.nl.linux.org/) by
Guus Sliepen <guus@sliepen.eu.org>.
library for inclusion into tinc (http://tinc.nl.linux.org/) by
Guus Sliepen <guus@sliepen.eu.org>.
- $Id: avl_tree.c,v 1.1.2.1
6 2003/07/17 15:06:25
guus Exp $
+ $Id: avl_tree.c,v 1.1.2.1
9 2003/08/28 21:05:09
guus Exp $
*/
#include "system.h"
*/
#include "system.h"
@@
-52,7
+52,7
@@
#endif
#ifndef AVL_DEPTH
#endif
#ifndef AVL_DEPTH
-static int lg(unsigned int u) __attribute__ ((
const
));
+static int lg(unsigned int u) __attribute__ ((
__const__
));
static int lg(unsigned int u)
{
static int lg(unsigned int u)
{
@@
-90,7
+90,7
@@
static int lg(unsigned int u)
/* Internal helper functions */
/* Internal helper functions */
-static int avl_check_balance(avl_node_t *node)
+static int avl_check_balance(
const
avl_node_t *node)
{
#ifdef AVL_DEPTH
int d;
{
#ifdef AVL_DEPTH
int d;
@@
-280,7
+280,7
@@
void avl_free_tree(avl_tree_t *tree)
avl_node_t *avl_alloc_node(void)
{
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)
@@
-666,7
+666,7
@@
void avl_delete_tree(avl_tree_t *tree)
/* Tree walking */
/* 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;
{
avl_node_t *node, *next;
@@
-676,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;
{
avl_node_t *node, *next;
@@
-689,7
+689,7
@@
void avl_foreach_node(avl_tree_t *tree, avl_action_t action)
/* Indexing */
#ifdef AVL_COUNT
/* 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);
}
{
return AVL_NODE_COUNT(tree->root);
}
@@
-734,7
+734,7
@@
unsigned int avl_index(const avl_node_t *node)
}
#endif
#ifdef AVL_DEPTH
}
#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);
}
{
return AVL_NODE_DEPTH(tree->root);
}