summaryrefslogtreecommitdiff
path: root/lib/shash.c
diff options
context:
space:
mode:
authorBen Pfaff <blp@nicira.com>2010-12-29 15:06:16 -0800
committerBen Pfaff <blp@nicira.com>2011-01-27 09:26:06 -0800
commitc56d226f8d3fc7a68716be87e3d651be604213fa (patch)
tree393db5da968fc233a0b06a7bdcd7918749389201 /lib/shash.c
parent3476fce34e05af370e90961a9df4d237d6ca2e51 (diff)
downloadopenvswitch-c56d226f8d3fc7a68716be87e3d651be604213fa.tar.gz
shash: New "smap" functions for working with string-to-string maps.
An shash always has string keys and sometimes it hash string values as well. Usually the general-purpose shash functions are fine for working with string-to-string maps, but this commit introduces a few more specialized functions that only work with string-to-string maps. It's not clear yet to me whether this should actually be a new data structure, so for now the new functions just work on shashes. This commit also converts one user of shash_destroy() to use smap_destroy(). This is the only existing user of these functions that I spotted as a trivial conversion candidate while grepping. These new functions will see more use in the following commit. Reviewed by Justin Pettit.
Diffstat (limited to 'lib/shash.c')
-rw-r--r--lib/shash.c54
1 files changed, 54 insertions, 0 deletions
diff --git a/lib/shash.c b/lib/shash.c
index 82791e31f..3269a4108 100644
--- a/lib/shash.c
+++ b/lib/shash.c
@@ -303,3 +303,57 @@ shash_random_node(struct shash *sh)
{
return CONTAINER_OF(hmap_random_node(&sh->map), struct shash_node, node);
}
+
+/* String-to-string maps (smaps). */
+
+/* Frees 'smap', including its keys and string values. */
+void
+smap_destroy(struct shash *smap)
+{
+ shash_destroy_free_data(smap);
+}
+
+/* Returns true if string-to-string maps 'a' and 'b' contain the same keys and
+ * values, false otherwise. */
+bool
+smap_equal(const struct shash *a, const struct shash *b)
+{
+ struct shash_node *a_node;
+
+ if (shash_count(a) != shash_count(b)) {
+ return false;
+ }
+
+ SHASH_FOR_EACH (a_node, a) {
+ uint32_t hash = a_node->node.hash;
+ struct shash_node *b_node = shash_find__(b, a_node->name, hash);
+ if (!b_node || strcmp(a_node->data, b_node->data)) {
+ return false;
+ }
+ }
+
+ return true;
+}
+
+/* Initializes 'dst' as a clone of 'src'. */
+void
+smap_clone(struct shash *dst, const struct shash *src)
+{
+ struct shash_node *node;
+
+ shash_init(dst);
+ SHASH_FOR_EACH (node, src) {
+ shash_add_nocopy__(dst, xstrdup(node->name), xstrdup(node->data),
+ node->node.hash);
+ }
+}
+
+/* Adds 'key' with string 'value' to 'smap', making a copy of each.
+ *
+ * It is the caller's responsibility to avoid duplicate names, if that is
+ * desirable. */
+void
+smap_add(struct shash *smap, const char *key, const char *value)
+{
+ shash_add(smap, key, xstrdup(value));
+}