projects
/
tinc
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Use splay trees instead of AVL trees.
[tinc]
/
src
/
edge.c
diff --git
a/src/edge.c
b/src/edge.c
index
97a57a6
..
861b945
100644
(file)
--- a/
src/edge.c
+++ b/
src/edge.c
@@
-22,7
+22,7
@@
#include "system.h"
#include "system.h"
-#include "
avl
_tree.h"
+#include "
splay
_tree.h"
#include "edge.h"
#include "logger.h"
#include "netutl.h"
#include "edge.h"
#include "logger.h"
#include "netutl.h"
@@
-30,7
+30,7
@@
#include "utils.h"
#include "xalloc.h"
#include "utils.h"
#include "xalloc.h"
-
avl_tree_t *edge_weight_tree;
/* Tree with all edges, sorted on weight */
+
splay_tree_t *edge_weight_tree;
/* Tree with all edges, sorted on weight */
static int edge_compare(const edge_t *a, const edge_t *b) {
return strcmp(a->to->name, b->to->name);
static int edge_compare(const edge_t *a, const edge_t *b) {
return strcmp(a->to->name, b->to->name);
@@
-55,25
+55,25
@@
static int edge_weight_compare(const edge_t *a, const edge_t *b) {
void init_edges(void) {
cp();
void init_edges(void) {
cp();
- edge_weight_tree =
avl_alloc_tree((avl
_compare_t) edge_weight_compare, NULL);
+ edge_weight_tree =
splay_alloc_tree((splay
_compare_t) edge_weight_compare, NULL);
}
}
-
avl
_tree_t *new_edge_tree(void) {
+
splay
_tree_t *new_edge_tree(void) {
cp();
cp();
- return
avl_alloc_tree((avl_compare_t) edge_compare, (avl
_action_t) free_edge);
+ return
splay_alloc_tree((splay_compare_t) edge_compare, (splay
_action_t) free_edge);
}
}
-void free_edge_tree(
avl
_tree_t *edge_tree) {
+void free_edge_tree(
splay
_tree_t *edge_tree) {
cp();
cp();
-
avl
_delete_tree(edge_tree);
+
splay
_delete_tree(edge_tree);
}
void exit_edges(void) {
cp();
}
void exit_edges(void) {
cp();
-
avl
_delete_tree(edge_weight_tree);
+
splay
_delete_tree(edge_weight_tree);
}
/* Creation and deletion of connection elements */
}
/* Creation and deletion of connection elements */
@@
-95,8
+95,8
@@
void free_edge(edge_t *e) {
void edge_add(edge_t *e) {
cp();
void edge_add(edge_t *e) {
cp();
-
avl
_insert(edge_weight_tree, e);
-
avl
_insert(e->from->edge_tree, e);
+
splay
_insert(edge_weight_tree, e);
+
splay
_insert(e->from->edge_tree, e);
e->reverse = lookup_edge(e->to, e->from);
e->reverse = lookup_edge(e->to, e->from);
@@
-110,8
+110,8
@@
void edge_del(edge_t *e) {
if(e->reverse)
e->reverse->reverse = NULL;
if(e->reverse)
e->reverse->reverse = NULL;
-
avl
_delete(edge_weight_tree, e);
-
avl
_delete(e->from->edge_tree, e);
+
splay
_delete(edge_weight_tree, e);
+
splay
_delete(e->from->edge_tree, e);
}
edge_t *lookup_edge(node_t *from, node_t *to) {
}
edge_t *lookup_edge(node_t *from, node_t *to) {
@@
-122,11
+122,11
@@
edge_t *lookup_edge(node_t *from, node_t *to) {
v.from = from;
v.to = to;
v.from = from;
v.to = to;
- return
avl
_search(from->edge_tree, &v);
+ return
splay
_search(from->edge_tree, &v);
}
void dump_edges(void) {
}
void dump_edges(void) {
-
avl
_node_t *node, *node2;
+
splay
_node_t *node, *node2;
node_t *n;
edge_t *e;
char *address;
node_t *n;
edge_t *e;
char *address;