util: Add a util_sparse_array data structure

Reviewed-by: Lionel Landwerlin <[email protected]>

2 files changed, 112 insertions, 0 deletions

diff --git a/src/util/tests/sparse_array/meson.build b/src/util/tests/sparse_array/meson.build
new file mode 100644
index 00000000000..036591e3bae
--- /dev/null
+++ b/src/util/tests/sparse_array/meson.build
@@ -0,0 +1,30 @@
+# Copyright © 2019 Intel Corporation
+
+# Permission is hereby granted, free of charge, to any person obtaining a copy
+# of this software and associated documentation files (the "Software"), to deal
+# in the Software without restriction, including without limitation the rights
+# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+# copies of the Software, and to permit persons to whom the Software is
+# furnished to do so, subject to the following conditions:
+
+# The above copyright notice and this permission notice shall be included in
+# all copies or substantial portions of the Software.
+
+# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+# SOFTWARE.
+
+test(
+  'sparse_array_multi_threaded',
+  executable(
+    'multi_threaded',
+    'multi_threaded.c',
+    dependencies : [idep_mesautil],
+    include_directories : inc_common,
+  ),
+  suite : ['util'],
+)
diff --git a/src/util/tests/sparse_array/multi_threaded.c b/src/util/tests/sparse_array/multi_threaded.c
new file mode 100644
index 00000000000..b7b4e73a1dc
--- /dev/null
+++ b/src/util/tests/sparse_array/multi_threaded.c
@@ -0,0 +1,82 @@
+/*
+ * Copyright © 2019 Intel Corporation
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice (including the next
+ * paragraph) shall be included in all copies or substantial portions of the
+ * Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+ * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
+ * IN THE SOFTWARE.
+ */
+
+#undef NDEBUG
+
+#include "util/sparse_array.h"
+
+#include <assert.h>
+#include <stdlib.h>
+#include "c11/threads.h"
+
+#define NUM_THREADS 16
+#define NUM_RUNS 16
+#define NUM_SETS_PER_THREAD (1 << 10)
+#define MAX_ARR_SIZE (1 << 20)
+
+static int
+test_thread(void *_state)
+{
+   struct util_sparse_array *arr = _state;
+   for (unsigned i = 0; i < NUM_SETS_PER_THREAD; i++) {
+      uint32_t idx = rand() % MAX_ARR_SIZE;
+      uint32_t *elem = util_sparse_array_get(arr, idx);
+      *elem = idx;
+   }
+
+   return 0;
+}
+
+static void
+run_test(unsigned run_idx)
+{
+   size_t node_size = 4 << (run_idx / 2);
+
+   struct util_sparse_array arr;
+   util_sparse_array_init(&arr, sizeof(uint32_t), node_size);
+
+   thrd_t threads[NUM_THREADS];
+   for (unsigned i = 0; i < NUM_THREADS; i++) {
+      int ret = thrd_create(&threads[i], test_thread, &arr);
+      assert(ret == thrd_success);
+   }
+
+   for (unsigned i = 0; i < NUM_THREADS; i++) {
+      int ret = thrd_join(threads[i], NULL);
+      assert(ret == thrd_success);
+   }
+
+   util_sparse_array_validate(&arr);
+
+   for (unsigned i = 0; i < MAX_ARR_SIZE; i++) {
+      uint32_t *elem = util_sparse_array_get(&arr, i);
+      assert(*elem == 0 || *elem == i);
+   }
+}
+
+int
+main(int argc, char **argv)
+{
+   for (unsigned i = 0; i < NUM_RUNS; i++)
+      run_test(i);
+}