2 node.c -- node 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.
24 #include "meshlink_internal.h"
28 #include "splay_tree.h"
32 static int node_compare(const node_t *a, const node_t *b) {
33 return strcmp(a->name, b->name);
36 void init_nodes(meshlink_handle_t *mesh) {
37 mesh->nodes = splay_alloc_tree((splay_compare_t) node_compare, (splay_action_t) free_node);
38 mesh->node_udp_cache = hash_alloc(0x100, sizeof(sockaddr_t));
41 void exit_nodes(meshlink_handle_t *mesh) {
42 if(mesh->node_udp_cache) {
43 hash_free(mesh->node_udp_cache);
47 splay_delete_tree(mesh->nodes);
50 mesh->node_udp_cache = NULL;
54 node_t *new_node(void) {
55 node_t *n = xzalloc(sizeof(*n));
57 n->edge_tree = new_edge_tree();
60 n->devclass = DEV_CLASS_UNKNOWN;
65 void free_node(node_t *n) {
66 n->status.destroyed = true;
71 free_edge_tree(n->edge_tree);
74 sockaddrfree(&n->address);
77 sptps_stop(&n->sptps);
79 if(n->mtutimeout.cb) {
84 free(n->canonical_address);
89 void node_add(meshlink_handle_t *mesh, node_t *n) {
91 splay_insert(mesh->nodes, n);
94 void node_del(meshlink_handle_t *mesh, node_t *n) {
95 timeout_del(&mesh->loop, &n->mtutimeout);
97 for splay_each(edge_t, e, n->edge_tree) {
101 splay_delete(mesh->nodes, n);
104 node_t *lookup_node(meshlink_handle_t *mesh, const char *name) {
105 const node_t n = {.name = (char *)name};
108 result = splay_search(mesh->nodes, &n);
113 node_t *lookup_node_udp(meshlink_handle_t *mesh, const sockaddr_t *sa) {
114 return hash_search(mesh->node_udp_cache, sa);
117 void update_node_udp(meshlink_handle_t *mesh, node_t *n, const sockaddr_t *sa) {
118 if(n == mesh->self) {
119 logger(mesh, MESHLINK_WARNING, "Trying to update UDP address of mesh->self!");
123 hash_insert(mesh->node_udp_cache, &n->address, NULL);
129 for(int i = 0; i < mesh->listen_sockets; i++) {
130 if(mesh->listen_socket[i].sa.sa.sa_family == sa->sa.sa_family) {
136 hash_insert(mesh->node_udp_cache, sa, n);
138 node_add_recent_address(mesh, n, sa);
140 if(mesh->log_level <= MESHLINK_DEBUG) {
141 char *hostname = sockaddr2hostname(&n->address);
142 logger(mesh, MESHLINK_DEBUG, "UDP address of %s set to %s", n->name, hostname);
148 bool node_add_recent_address(meshlink_handle_t *mesh, node_t *n, const sockaddr_t *sa) {
153 /* Check if we already know this address */
154 for(i = 0; i < MAX_RECENT && n->recent[i].sa.sa_family; i++) {
155 if(!sockaddrcmp(&n->recent[i], sa)) {
161 if(found && i == 0) {
162 /* It's already the most recent address, nothing to do. */
166 if(i >= MAX_RECENT) {
170 memmove(n->recent + 1, n->recent, i * sizeof(*n->recent));
171 memcpy(n->recent, sa, SALEN(sa->sa));
173 n->status.dirty = true;