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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
|
/*
* Copyright (c) 2009 Nicira Networks.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <config.h>
#include "shash.h"
#include <assert.h>
#include "hash.h"
static size_t
hash_name(const char *name)
{
return hash_string(name, 0);
}
void
shash_init(struct shash *sh)
{
hmap_init(&sh->map);
}
void
shash_destroy(struct shash *sh)
{
if (sh) {
shash_clear(sh);
hmap_destroy(&sh->map);
}
}
void
shash_clear(struct shash *sh)
{
struct shash_node *node, *next;
SHASH_FOR_EACH_SAFE (node, next, sh) {
hmap_remove(&sh->map, &node->node);
free(node->name);
free(node);
}
}
bool
shash_is_empty(const struct shash *shash)
{
return hmap_is_empty(&shash->map);
}
size_t
shash_count(const struct shash *shash)
{
return hmap_count(&shash->map);
}
/* It is the caller's responsibility to avoid duplicate names, if that is
* desirable. */
struct shash_node *
shash_add(struct shash *sh, const char *name, const void *data)
{
struct shash_node *node = xmalloc(sizeof *node);
node->name = xstrdup(name);
node->data = (void *) data;
hmap_insert(&sh->map, &node->node, hash_name(name));
return node;
}
void
shash_delete(struct shash *sh, struct shash_node *node)
{
hmap_remove(&sh->map, &node->node);
free(node->name);
free(node);
}
/* If there are duplicates, returns a random element. */
struct shash_node *
shash_find(const struct shash *sh, const char *name)
{
struct shash_node *node;
HMAP_FOR_EACH_WITH_HASH (node, struct shash_node, node,
hash_name(name), &sh->map) {
if (!strcmp(node->name, name)) {
return node;
}
}
return NULL;
}
void *
shash_find_data(const struct shash *sh, const char *name)
{
struct shash_node *node = shash_find(sh, name);
return node ? node->data : NULL;
}
void *
shash_find_and_delete(struct shash *sh, const char *name)
{
struct shash_node *node = shash_find(sh, name);
if (node) {
void *data = node->data;
shash_delete(sh, node);
return data;
} else {
return NULL;
}
}
struct shash_node *
shash_first(const struct shash *shash)
{
struct hmap_node *node = hmap_first(&shash->map);
return node ? CONTAINER_OF(node, struct shash_node, node) : NULL;
}
static int
compare_nodes_by_name(const void *a_, const void *b_)
{
const struct shash_node *const *a = a_;
const struct shash_node *const *b = b_;
return strcmp((*a)->name, (*b)->name);
}
const struct shash_node **
shash_sort(const struct shash *sh)
{
if (shash_is_empty(sh)) {
return NULL;
} else {
const struct shash_node **nodes;
struct shash_node *node;
size_t i, n;
n = shash_count(sh);
nodes = xmalloc(n * sizeof *nodes);
i = 0;
SHASH_FOR_EACH (node, sh) {
nodes[i++] = node;
}
assert(i == n);
qsort(nodes, n, sizeof *nodes, compare_nodes_by_name);
return nodes;
}
}
|
