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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
|
/*
* netlink/hashtable.c Netlink hashtable Utilities
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation version 2.1
* of the License.
*
* Copyright (c) 2012 Cumulus Networks, Inc
*/
#include <string.h>
#include <netlink-local.h>
#include <netlink/object.h>
#include <netlink/hash.h>
#include <netlink/hashtable.h>
nl_hash_table_t *nl_hash_table_alloc(int size)
{
nl_hash_table_t *ht;
ht = calloc(1, sizeof (*ht));
if (!ht)
goto errout;
ht->nodes = calloc(size, sizeof (*ht->nodes));
if (!ht->nodes) {
free(ht);
goto errout;
}
ht->size = size;
return ht;
errout:
return NULL;
}
void nl_hash_table_free(nl_hash_table_t *ht)
{
int i;
for(i = 0; i < ht->size; i++) {
nl_hash_node_t *node = ht->nodes[i];
nl_hash_node_t *saved_node;
while (node) {
saved_node = node;
node = node->next;
free(saved_node);
}
}
free(ht->nodes);
free(ht);
}
struct nl_object* nl_hash_table_lookup(nl_hash_table_t *ht,
struct nl_object *obj)
{
nl_hash_node_t *node;
uint32_t key_hash;
nl_object_keygen(obj, &key_hash, ht->size);
node = ht->nodes[key_hash];
while (node) {
if (nl_object_identical(node->obj, obj))
return node->obj;
node = node->next;
}
return NULL;
}
int nl_hash_table_add(nl_hash_table_t *ht, struct nl_object *obj)
{
nl_hash_node_t *node;
uint32_t key_hash;
nl_object_keygen(obj, &key_hash, ht->size);
node = ht->nodes[key_hash];
while (node) {
if (nl_object_identical(node->obj, obj)) {
NL_DBG(2, "Warning: Add to hashtable found duplicate...\n");
return -NLE_EXIST;
}
node = node->next;
}
NL_DBG (5, "adding cache entry of obj %p in table %p, with hash 0x%x\n",
obj, ht, key_hash);
node = malloc(sizeof(nl_hash_node_t));
if (!node)
return -NLE_NOMEM;
nl_object_get(obj);
node->obj = obj;
node->key = key_hash;
node->key_size = sizeof(uint32_t);
node->next = ht->nodes[key_hash];
ht->nodes[key_hash] = node;
return 0;
}
int nl_hash_table_del(nl_hash_table_t *ht, struct nl_object *obj)
{
nl_hash_node_t *node, *prev;
uint32_t key_hash;
nl_object_keygen(obj, &key_hash, ht->size);
prev = node = ht->nodes[key_hash];
while (node) {
if (nl_object_identical(node->obj, obj)) {
nl_object_put(obj);
NL_DBG (5, "deleting cache entry of obj %p in table %p, with"
" hash 0x%x\n", obj, ht, key_hash);
if (node == ht->nodes[key_hash])
ht->nodes[key_hash] = node->next;
else
prev->next = node->next;
free(node);
return 0;
}
prev = node;
node = node->next;
}
return -1;
}
uint32_t nl_hash(void *k, size_t length, uint32_t initval)
{
return(__nl_hash(k, length, initval));
}
|
