Added dynamic ID generation & management for idhash tables.

This will allow us to use idhash tables to manage id handles a bit more
flexibly.  For example, sockets, pipe IDs, etc. can all be generated, and
we can use hash tables to ensure that values do not collide.

1 files changed, 34 insertions, 1 deletions

diff --git a/tests/idhash.c b/tests/idhash.c
index fb240078..b05b4b2f 100644
--- a/tests/idhash.c
+++ b/tests/idhash.c
@@ -7,9 +7,9 @@
 // found online at https://opensource.org/licenses/MIT.
 //
 
-#include "core/idhash.c"
 #include "convey.h"
 #include "stubs.h"
+#include "core/idhash.c"
 
 Main({
 	Test("General ID Hash", {
@@ -133,4 +133,37 @@ Main({
 			})
 		})
 	})
+
+	Test("Dynamic ID generation", {
+		Convey("Given a small ID hash", {
+			nni_idhash *h;
+			int expect[5];
+			uint32_t id;
+			int i;
+			So(nni_idhash_create(&h) == 0);
+			Reset({
+				nni_idhash_destroy(h);
+			})
+			nni_idhash_set_limits(h, 10, 13, 10);
+			So(1);
+			Convey("We can fill the table", {
+				for (i = 0; i < 4; i++) {
+					So(nni_idhash_alloc(h, &id, &expect[i]) == 0);
+					So(id == (i + 10));
+				}
+				Convey("Adding another fails", {
+					So(nni_idhash_alloc(h, &id, &expect[5]) == NNG_ENOMEM);
+				})
+				Convey("Deleting one lets us reinsert", {
+					nni_idhash_remove(h, 11);
+					So(nni_idhash_alloc(h, &id, &expect[5]) == 0);
+					So(id == 11);
+				})
+			})
+			Convey("We cannot insert bogus values", {
+				So(nni_idhash_insert(h, 1, &expect[0]) == NNG_EINVAL);
+				So(nni_idhash_insert(h, 100, &expect[0]) == NNG_EINVAL);
+			})
+		})
+	})
 })