aboutsummaryrefslogtreecommitdiffstats
path: root/src/util/tests/sparse_array/multi_threaded.c
blob: b084ac994e4cb434066ba0079bcea99e705c2ac2 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
/*
 * 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);
   }

   util_sparse_array_finish(&arr);
}

int
main(int argc, char **argv)
{
   for (unsigned i = 0; i < NUM_RUNS; i++)
      run_test(i);
}