-
Notifications
You must be signed in to change notification settings - Fork 0
/
nodes.c
71 lines (51 loc) · 1.61 KB
/
nodes.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
/*
Copyright contributors as noted in the AUTHORS file.
This file is part of PLATANOS.
PLATANOS is free software; you can redistribute it and/or modify it under
the terms of the GNU Affero General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
PLATANOS is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "nodes.h"
//NODES HASH is used to find a node only by its key
void
nodes_init (khash_t (nodes_t) ** nodes)
{
*nodes = kh_init (nodes_t);
}
void
nodes_put (khash_t (nodes_t) * nodes, node_t * node)
{
int is_missing;
khiter_t k;
k = kh_put (nodes_t, nodes, node->key, &is_missing);
kh_value (nodes, k) = node;
}
//deletes the entry if present
//the node is deleted bu router_delete
void
nodes_delete (khash_t (nodes_t) * nodes, char *key)
{
khiter_t k;
k = kh_get (nodes_t, nodes, key);
if (k != kh_end (nodes)) {
kh_del (nodes_t, nodes, k);
}
}
//returns NULL if not found
node_t *
nodes_search (khash_t (nodes_t) * nodes, char *key)
{
khiter_t k;
k = kh_get (nodes_t, nodes, key);
if (k != kh_end (nodes)) {
return kh_value (nodes, k);
}
return NULL;
}