2 edge.c -- edge tree management
3 Copyright (C) 2014 Guus Sliepen <guus@meshlink.io>
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License along
16 with this program; if not, write to the Free Software Foundation, Inc.,
17 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
22 #include "splay_tree.h"
30 splay_tree_t *edge_weight_tree;
32 static int edge_compare(const edge_t *a, const edge_t *b) {
33 return strcmp(a->to->name, b->to->name);
36 static int edge_weight_compare(const edge_t *a, const edge_t *b) {
39 result = a->weight - b->weight;
44 result = strcmp(a->from->name, b->from->name);
49 return strcmp(a->to->name, b->to->name);
52 void init_edges(void) {
53 edge_weight_tree = splay_alloc_tree((splay_compare_t) edge_weight_compare, NULL);
56 splay_tree_t *new_edge_tree(void) {
57 return splay_alloc_tree((splay_compare_t) edge_compare, (splay_action_t) free_edge);
60 void free_edge_tree(splay_tree_t *edge_tree) {
61 splay_delete_tree(edge_tree);
64 void exit_edges(void) {
65 splay_delete_tree(edge_weight_tree);
68 /* Creation and deletion of connection elements */
70 edge_t *new_edge(void) {
71 return xzalloc(sizeof(edge_t));
74 void free_edge(edge_t *e) {
75 sockaddrfree(&e->address);
80 void edge_add(edge_t *e) {
81 splay_insert(edge_weight_tree, e);
82 splay_insert(e->from->edge_tree, e);
84 e->reverse = lookup_edge(e->to, e->from);
87 e->reverse->reverse = e;
90 void edge_del(edge_t *e) {
92 e->reverse->reverse = NULL;
94 splay_delete(edge_weight_tree, e);
95 splay_delete(e->from->edge_tree, e);
98 edge_t *lookup_edge(node_t *from, node_t *to) {
104 return splay_search(from->edge_tree, &v);