1 files changed, 80 insertions, 0 deletions
diff --git a/tools/uri_table.h b/tools/uri_table.h
new file mode 100644
index 0000000..5a337a3
--- /dev/null
+++ b/tools/uri_table.h
@@ -0,0 +1,80 @@
+/*
+  Copyright 2011-2019 David Robillard <d@drobilla.net>
+
+  Permission to use, copy, modify, and/or distribute this software for any
+  purpose with or without fee is hereby granted, provided that the above
+  copyright notice and this permission notice appear in all copies.
+
+  THIS SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+  WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+  MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+  ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+  WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+  ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+  OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+*/
+
+/**
+   @file uri_table.h A toy URI map/unmap implementation.
+
+   This file contains function definitions and must only be included once.
+*/
+
+#ifndef URI_TABLE_H
+#define URI_TABLE_H
+
+#include "lv2/urid/urid.h"
+
+#include <stdlib.h>
+#include <string.h>
+
+typedef struct {
+  char** uris;
+  size_t n_uris;
+} URITable;
+
+static void
+uri_table_init(URITable* table)
+{
+  table->uris   = NULL;
+  table->n_uris = 0;
+}
+
+static void
+uri_table_destroy(URITable* table)
+{
+  for (size_t i = 0; i < table->n_uris; ++i) {
+    free(table->uris[i]);
+  }
+
+  free(table->uris);
+}
+
+static LV2_URID
+uri_table_map(LV2_URID_Map_Handle handle, const char* uri)
+{
+  URITable* table = (URITable*)handle;
+  for (size_t i = 0; i < table->n_uris; ++i) {
+    if (!strcmp(table->uris[i], uri)) {
+      return i + 1;
+    }
+  }
+
+  const size_t len = strlen(uri);
+  table->uris = (char**)realloc(table->uris, ++table->n_uris * sizeof(char*));
+  table->uris[table->n_uris - 1] = (char*)malloc(len + 1);
+  memcpy(table->uris[table->n_uris - 1], uri, len + 1);
+  return table->n_uris;
+}
+
+static const char*
+uri_table_unmap(LV2_URID_Map_Handle handle, LV2_URID urid)
+{
+  URITable* table = (URITable*)handle;
+  if (urid > 0 && urid <= table->n_uris) {
+    return table->uris[urid - 1];
+  }
+  return NULL;
+}
+
+#endif /* URI_TABLE_H */