2 * Copyright (c) 2009, 2010 Nicira Networks.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at:
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
23 hash_name(const char *name)
25 return hash_string(name, 0);
29 shash_init(struct shash *sh)
35 shash_destroy(struct shash *sh)
39 hmap_destroy(&sh->map);
44 shash_swap(struct shash *a, struct shash *b)
46 hmap_swap(&a->map, &b->map);
50 shash_moved(struct shash *sh)
56 shash_clear(struct shash *sh)
58 struct shash_node *node, *next;
60 SHASH_FOR_EACH_SAFE (node, next, sh) {
61 hmap_remove(&sh->map, &node->node);
68 shash_is_empty(const struct shash *shash)
70 return hmap_is_empty(&shash->map);
74 shash_count(const struct shash *shash)
76 return hmap_count(&shash->map);
79 /* It is the caller's responsibility to avoid duplicate names, if that is
82 shash_add_nocopy(struct shash *sh, char *name, const void *data)
84 struct shash_node *node = xmalloc(sizeof *node);
86 node->data = (void *) data;
87 hmap_insert(&sh->map, &node->node, hash_name(name));
91 /* It is the caller's responsibility to avoid duplicate names, if that is
94 shash_add(struct shash *sh, const char *name, const void *data)
96 return shash_add_nocopy(sh, xstrdup(name), data);
100 shash_add_once(struct shash *sh, const char *name, const void *data)
102 if (!shash_find(sh, name)) {
103 shash_add(sh, name, data);
111 shash_add_assert(struct shash *sh, const char *name, const void *data)
113 bool added OVS_UNUSED = shash_add_once(sh, name, data);
118 shash_delete(struct shash *sh, struct shash_node *node)
120 hmap_remove(&sh->map, &node->node);
125 /* If there are duplicates, returns a random element. */
127 shash_find(const struct shash *sh, const char *name)
129 struct shash_node *node;
131 HMAP_FOR_EACH_WITH_HASH (node, struct shash_node, node,
132 hash_name(name), &sh->map) {
133 if (!strcmp(node->name, name)) {
141 shash_find_data(const struct shash *sh, const char *name)
143 struct shash_node *node = shash_find(sh, name);
144 return node ? node->data : NULL;
148 shash_find_and_delete(struct shash *sh, const char *name)
150 struct shash_node *node = shash_find(sh, name);
152 void *data = node->data;
153 shash_delete(sh, node);
161 shash_find_and_delete_assert(struct shash *sh, const char *name)
163 void *data = shash_find_and_delete(sh, name);
164 assert(data != NULL);
169 shash_first(const struct shash *shash)
171 struct hmap_node *node = hmap_first(&shash->map);
172 return node ? CONTAINER_OF(node, struct shash_node, node) : NULL;
176 compare_nodes_by_name(const void *a_, const void *b_)
178 const struct shash_node *const *a = a_;
179 const struct shash_node *const *b = b_;
180 return strcmp((*a)->name, (*b)->name);
183 const struct shash_node **
184 shash_sort(const struct shash *sh)
186 if (shash_is_empty(sh)) {
189 const struct shash_node **nodes;
190 struct shash_node *node;
194 nodes = xmalloc(n * sizeof *nodes);
196 SHASH_FOR_EACH (node, sh) {
201 qsort(nodes, n, sizeof *nodes, compare_nodes_by_name);
207 /* Returns true if 'a' and 'b' contain the same keys (regardless of their
208 * values), false otherwise. */
210 shash_equal_keys(const struct shash *a, const struct shash *b)
212 struct shash_node *node;
214 if (hmap_count(&a->map) != hmap_count(&b->map)) {
217 SHASH_FOR_EACH (node, a) {
218 if (!shash_find(b, node->name)) {