1 /* Apache License, Version 2.0 */
2 
3 #include "testing/testing.h"
4 #include <string.h>
5 
6 #include "atomic_ops.h"
7 
8 #include "MEM_guardedalloc.h"
9 
10 #include "BLI_utildefines.h"
11 
12 #include "BLI_listbase.h"
13 #include "BLI_mempool.h"
14 #include "BLI_task.h"
15 
16 #define NUM_ITEMS 10000
17 
18 /* *** Parallel iterations over range of integer values. *** */
19 
task_range_iter_func(void * userdata,int index,const TaskParallelTLS * __restrict tls)20 static void task_range_iter_func(void *userdata, int index, const TaskParallelTLS *__restrict tls)
21 {
22   int *data = (int *)userdata;
23   data[index] = index;
24   *((int *)tls->userdata_chunk) += index;
25   //  printf("%d, %d, %d\n", index, data[index], *((int *)tls->userdata_chunk));
26 }
27 
task_range_iter_reduce_func(const void * __restrict UNUSED (userdata),void * __restrict join_v,void * __restrict userdata_chunk)28 static void task_range_iter_reduce_func(const void *__restrict UNUSED(userdata),
29                                         void *__restrict join_v,
30                                         void *__restrict userdata_chunk)
31 {
32   int *join = (int *)join_v;
33   int *chunk = (int *)userdata_chunk;
34   *join += *chunk;
35   //  printf("%d, %d\n", data[NUM_ITEMS], *((int *)userdata_chunk));
36 }
37 
TEST(task,RangeIter)38 TEST(task, RangeIter)
39 {
40   int data[NUM_ITEMS] = {0};
41   int sum = 0;
42 
43   BLI_threadapi_init();
44 
45   TaskParallelSettings settings;
46   BLI_parallel_range_settings_defaults(&settings);
47   settings.min_iter_per_thread = 1;
48 
49   settings.userdata_chunk = &sum;
50   settings.userdata_chunk_size = sizeof(sum);
51   settings.func_reduce = task_range_iter_reduce_func;
52 
53   BLI_task_parallel_range(0, NUM_ITEMS, data, task_range_iter_func, &settings);
54 
55   /* Those checks should ensure us all items of the listbase were processed once, and only once
56    * as expected. */
57 
58   int expected_sum = 0;
59   for (int i = 0; i < NUM_ITEMS; i++) {
60     EXPECT_EQ(data[i], i);
61     expected_sum += i;
62   }
63   EXPECT_EQ(sum, expected_sum);
64 
65   BLI_threadapi_exit();
66 }
67 
68 /* *** Parallel iterations over mempool items. *** */
69 
task_mempool_iter_func(void * userdata,MempoolIterData * item)70 static void task_mempool_iter_func(void *userdata, MempoolIterData *item)
71 {
72   int *data = (int *)item;
73   int *count = (int *)userdata;
74 
75   EXPECT_TRUE(data != NULL);
76 
77   *data += 1;
78   atomic_sub_and_fetch_uint32((uint32_t *)count, 1);
79 }
80 
TEST(task,MempoolIter)81 TEST(task, MempoolIter)
82 {
83   int *data[NUM_ITEMS];
84   BLI_threadapi_init();
85   BLI_mempool *mempool = BLI_mempool_create(
86       sizeof(*data[0]), NUM_ITEMS, 32, BLI_MEMPOOL_ALLOW_ITER);
87 
88   int i;
89 
90   /* 'Randomly' add and remove some items from mempool, to create a non-homogenous one. */
91   int num_items = 0;
92   for (i = 0; i < NUM_ITEMS; i++) {
93     data[i] = (int *)BLI_mempool_alloc(mempool);
94     *data[i] = i - 1;
95     num_items++;
96   }
97 
98   for (i = 0; i < NUM_ITEMS; i += 3) {
99     BLI_mempool_free(mempool, data[i]);
100     data[i] = NULL;
101     num_items--;
102   }
103 
104   for (i = 0; i < NUM_ITEMS; i += 7) {
105     if (data[i] == NULL) {
106       data[i] = (int *)BLI_mempool_alloc(mempool);
107       *data[i] = i - 1;
108       num_items++;
109     }
110   }
111 
112   for (i = 0; i < NUM_ITEMS - 5; i += 23) {
113     for (int j = 0; j < 5; j++) {
114       if (data[i + j] != NULL) {
115         BLI_mempool_free(mempool, data[i + j]);
116         data[i + j] = NULL;
117         num_items--;
118       }
119     }
120   }
121 
122   BLI_task_parallel_mempool(mempool, &num_items, task_mempool_iter_func, true);
123 
124   /* Those checks should ensure us all items of the mempool were processed once, and only once - as
125    * expected. */
126   EXPECT_EQ(num_items, 0);
127   for (i = 0; i < NUM_ITEMS; i++) {
128     if (data[i] != NULL) {
129       EXPECT_EQ(*data[i], i);
130     }
131   }
132 
133   BLI_mempool_destroy(mempool);
134   BLI_threadapi_exit();
135 }
136 
137 /* *** Parallel iterations over double-linked list items. *** */
138 
task_listbase_iter_func(void * userdata,void * item,int index,const TaskParallelTLS * __restrict UNUSED (tls))139 static void task_listbase_iter_func(void *userdata,
140                                     void *item,
141                                     int index,
142                                     const TaskParallelTLS *__restrict UNUSED(tls))
143 {
144   LinkData *data = (LinkData *)item;
145   int *count = (int *)userdata;
146 
147   data->data = POINTER_FROM_INT(POINTER_AS_INT(data->data) + index);
148   atomic_sub_and_fetch_uint32((uint32_t *)count, 1);
149 }
150 
TEST(task,ListBaseIter)151 TEST(task, ListBaseIter)
152 {
153   ListBase list = {NULL, NULL};
154   LinkData *items_buffer = (LinkData *)MEM_calloc_arrayN(
155       NUM_ITEMS, sizeof(*items_buffer), __func__);
156   BLI_threadapi_init();
157 
158   int i;
159 
160   int num_items = 0;
161   for (i = 0; i < NUM_ITEMS; i++) {
162     BLI_addtail(&list, &items_buffer[i]);
163     num_items++;
164   }
165 
166   TaskParallelSettings settings;
167   BLI_parallel_range_settings_defaults(&settings);
168 
169   BLI_task_parallel_listbase(&list, &num_items, task_listbase_iter_func, &settings);
170 
171   /* Those checks should ensure us all items of the listbase were processed once, and only once -
172    * as expected. */
173   EXPECT_EQ(num_items, 0);
174   LinkData *item;
175   for (i = 0, item = (LinkData *)list.first; i < NUM_ITEMS && item != NULL;
176        i++, item = item->next) {
177     EXPECT_EQ(POINTER_AS_INT(item->data), i);
178   }
179   EXPECT_EQ(NUM_ITEMS, i);
180 
181   MEM_freeN(items_buffer);
182   BLI_threadapi_exit();
183 }
184