}
void init_nodes(void) {
- cp();
-
node_tree = avl_alloc_tree((avl_compare_t) node_compare, (avl_action_t) free_node);
node_udp_tree = avl_alloc_tree((avl_compare_t) node_udp_compare, NULL);
}
void exit_nodes(void) {
- cp();
-
avl_delete_tree(node_udp_tree);
avl_delete_tree(node_tree);
}
node_t *new_node(void) {
node_t *n = xmalloc_and_zero(sizeof(*n));
- cp();
-
n->subnet_tree = new_subnet_tree();
n->edge_tree = new_edge_tree();
EVP_CIPHER_CTX_init(&n->inctx);
}
void free_node(node_t *n) {
- cp();
-
if(n->inkey)
free(n->inkey);
}
void node_add(node_t *n) {
- cp();
-
avl_insert(node_tree, n);
}
edge_t *e;
subnet_t *s;
- cp();
-
for(node = n->subnet_tree->head; node; node = next) {
next = node->next;
s = node->data;
node_t *lookup_node(char *name) {
node_t n = {0};
- cp();
-
n.name = name;
return avl_search(node_tree, &n);
node_t *lookup_node_udp(const sockaddr_t *sa) {
node_t n = {0};
- cp();
-
n.address = *sa;
n.name = NULL;
avl_node_t *node;
node_t *n;
- cp();
-
- logger(LOG_DEBUG, _("Nodes:"));
+ logger(LOG_DEBUG, "Nodes:");
for(node = node_tree->head; node; node = node->next) {
n = node->data;
- logger(LOG_DEBUG, _(" %s at %s cipher %d digest %d maclength %d compression %d options %lx status %04x nexthop %s via %s pmtu %d (min %d max %d)"),
+ logger(LOG_DEBUG, " %s at %s cipher %d digest %d maclength %d compression %d options %x status %04x nexthop %s via %s pmtu %d (min %d max %d)",
n->name, n->hostname, n->outcipher ? n->outcipher->nid : 0,
n->outdigest ? n->outdigest->type : 0, n->outmaclength, n->outcompression,
n->options, bitfield_to_int(&n->status, sizeof n->status), n->nexthop ? n->nexthop->name : "-",
n->via ? n->via->name : "-", n->mtu, n->minmtu, n->maxmtu);
}
- logger(LOG_DEBUG, _("End of nodes."));
+ logger(LOG_DEBUG, "End of nodes.");
}