2 * Copyright (c) 2011, 2012, 2013, 2015, 2016 Nicira, Inc.
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.
24 hash_name__(const char *name, size_t length)
26 return hash_bytes(name, length, 0);
30 hash_name(const char *name)
32 return hash_name__(name, strlen(name));
35 static struct sset_node *
36 sset_find__(const struct sset *set, const char *name, size_t hash)
38 struct sset_node *node;
40 HMAP_FOR_EACH_WITH_HASH (node, hmap_node, hash, &set->map) {
41 if (!strcmp(node->name, name)) {
48 static struct sset_node *
49 sset_add__(struct sset *set, const char *name, size_t length, size_t hash)
51 struct sset_node *node = xmalloc(length + sizeof *node);
52 memcpy(node->name, name, length + 1);
53 hmap_insert(&set->map, &node->hmap_node, hash);
57 /* Initializes 'set' as an empty set of strings. */
59 sset_init(struct sset *set)
64 /* Destroys 'sets'. */
66 sset_destroy(struct sset *set)
70 hmap_destroy(&set->map);
74 /* Initializes 'set' to contain the same strings as 'orig'. */
76 sset_clone(struct sset *set, const struct sset *orig)
78 struct sset_node *node;
81 HMAP_FOR_EACH (node, hmap_node, &orig->map) {
82 sset_add__(set, node->name, strlen(node->name),
83 node->hmap_node.hash);
87 /* Exchanges the contents of 'a' and 'b'. */
89 sset_swap(struct sset *a, struct sset *b)
91 hmap_swap(&a->map, &b->map);
94 /* Adjusts 'set' so that it is still valid after it has been moved around in
95 * memory (e.g. due to realloc()). */
97 sset_moved(struct sset *set)
99 hmap_moved(&set->map);
102 /* Initializes 'set' with substrings of 's' that are delimited by any of the
103 * characters in 'delimiters'. For example,
104 * sset_from_delimited_string(&set, "a b,c", " ,");
105 * initializes 'set' with three strings "a", "b", and "c". */
107 sset_from_delimited_string(struct sset *set, const char *s_,
108 const char *delimiters)
112 char *s = xstrdup(s_);
113 char *token, *save_ptr = NULL;
114 for (token = strtok_r(s, delimiters, &save_ptr); token != NULL;
115 token = strtok_r(NULL, delimiters, &save_ptr)) {
116 sset_add(set, token);
121 /* Returns true if 'set' contains no strings, false if it contains at least one
124 sset_is_empty(const struct sset *set)
126 return hmap_is_empty(&set->map);
129 /* Returns the number of strings in 'set'. */
131 sset_count(const struct sset *set)
133 return hmap_count(&set->map);
136 /* Adds 'name' to 'set'. If 'name' is new, returns the new sset_node;
137 * otherwise (if a copy of 'name' already existed in 'set'), returns NULL. */
139 sset_add(struct sset *set, const char *name)
141 size_t length = strlen(name);
142 uint32_t hash = hash_name__(name, length);
144 return (sset_find__(set, name, hash)
146 : sset_add__(set, name, length, hash));
149 /* Adds a copy of 'name' to 'set' and frees 'name'.
151 * If 'name' is new, returns the new sset_node; otherwise (if a copy of 'name'
152 * already existed in 'set'), returns NULL. */
154 sset_add_and_free(struct sset *set, char *name)
156 struct sset_node *node = sset_add(set, name);
161 /* Adds 'name' to 'set'. Assert-fails if a copy of 'name' was already in
164 sset_add_assert(struct sset *set, const char *name)
166 bool added OVS_UNUSED = sset_add(set, name);
170 /* Adds a copy of each of the 'n' names in 'names' to 'set'. */
172 sset_add_array(struct sset *set, char **names, size_t n)
176 for (i = 0; i < n; i++) {
177 sset_add(set, names[i]);
181 /* Removes all of the strings from 'set'. */
183 sset_clear(struct sset *set)
185 const char *name, *next;
187 SSET_FOR_EACH_SAFE (name, next, set) {
188 sset_delete(set, SSET_NODE_FROM_NAME(name));
192 /* Deletes 'node' from 'set' and frees 'node'. */
194 sset_delete(struct sset *set, struct sset_node *node)
196 hmap_remove(&set->map, &node->hmap_node);
200 /* Searches for 'name' in 'set'. If found, deletes it and returns true. If
201 * not found, returns false without modifying 'set'. */
203 sset_find_and_delete(struct sset *set, const char *name)
205 struct sset_node *node = sset_find(set, name);
207 sset_delete(set, node);
212 /* Searches for 'name' in 'set' and deletes it. Assert-fails if 'name' is not
215 sset_find_and_delete_assert(struct sset *set, const char *name)
217 bool deleted OVS_UNUSED = sset_find_and_delete(set, name);
221 /* Removes a string from 'set' and returns a copy of it. The caller must free
222 * the returned string (with free()).
224 * 'set' must not be empty.
226 * This is not a very good way to iterate through an sset: it copies each name
227 * and it takes O(n**2) time to remove all the names. Use SSET_FOR_EACH_SAFE
228 * instead, if you can. */
230 sset_pop(struct sset *set)
232 const char *name = SSET_FIRST(set);
233 char *copy = xstrdup(name);
234 sset_delete(set, SSET_NODE_FROM_NAME(name));
238 /* Searches for 'name' in 'set'. Returns its node, if found, otherwise a null
241 sset_find(const struct sset *set, const char *name)
243 return sset_find__(set, name, hash_name(name));
246 /* Returns true if 'set' contains a copy of 'name', false otherwise. */
248 sset_contains(const struct sset *set, const char *name)
250 return sset_find(set, name) != NULL;
253 /* Returns true if 'a' and 'b' contain the same strings, false otherwise. */
255 sset_equals(const struct sset *a, const struct sset *b)
257 struct sset_node *node;
259 if (sset_count(a) != sset_count(b)) {
263 HMAP_FOR_EACH (node, hmap_node, &a->map) {
264 if (!sset_find__(b, node->name, node->hmap_node.hash)) {
272 /* Returns the next node in 'set' in hash order, or NULL if no nodes remain in
273 * 'set'. Uses '*pos' to determine where to begin iteration, and updates
274 * '*pos' to pass on the next iteration into them before returning.
276 * It's better to use plain SSET_FOR_EACH and related functions, since they are
277 * faster and better at dealing with ssets that change during iteration.
279 * Before beginning iteration, set '*pos' to all zeros. */
281 sset_at_position(const struct sset *set, struct sset_position *pos)
283 struct hmap_node *hmap_node;
285 hmap_node = hmap_at_position(&set->map, &pos->pos);
286 return SSET_NODE_FROM_HMAP_NODE(hmap_node);
289 /* Replaces 'a' by the intersection of 'a' and 'b'. That is, removes from 'a'
290 * all of the strings that are not also in 'b'. */
292 sset_intersect(struct sset *a, const struct sset *b)
294 const char *name, *next;
296 SSET_FOR_EACH_SAFE (name, next, a) {
297 if (!sset_contains(b, name)) {
298 sset_delete(a, SSET_NODE_FROM_NAME(name));
303 /* Returns a null-terminated array of pointers to the strings in 'set', in no
304 * particular order. The caller must free the returned array when it is no
305 * longer needed, but the strings in the array belong to 'set' and thus must
306 * not be modified or freed. */
308 sset_array(const struct sset *set)
310 size_t n = sset_count(set);
315 array = xmalloc(sizeof *array * (n + 1));
317 SSET_FOR_EACH (s, set) {
327 compare_string_pointers(const void *a_, const void *b_)
329 const char *const *a = a_;
330 const char *const *b = b_;
332 return strcmp(*a, *b);
335 /* Returns a null-terminated array of pointers to the strings in 'set', sorted
336 * alphabetically. The caller must free the returned array when it is no
337 * longer needed, but the strings in the array belong to 'set' and thus must
338 * not be modified or freed. */
340 sset_sort(const struct sset *set)
342 const char **array = sset_array(set);
343 qsort(array, sset_count(set), sizeof *array, compare_string_pointers);