1 /*
2 * Copyright © 2015 Intel Corporation
3 *
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
10 *
11 * The above copyright notice and this permission notice (including the next
12 * paragraph) shall be included in all copies or substantial portions of the
13 * Software.
14 *
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
21 * IN THE SOFTWARE.
22 */
23
24 #include <pthread.h>
25
26 #include "anv_private.h"
27
28 #define NUM_THREADS 16
29 #define STATES_PER_THREAD 1024
30 #define NUM_RUNS 64
31
32 struct job {
33 pthread_t thread;
34 unsigned id;
35 struct anv_state_pool *pool;
36 uint32_t offsets[STATES_PER_THREAD];
37 } jobs[NUM_THREADS];
38
39 pthread_barrier_t barrier;
40
alloc_states(void * _job)41 static void *alloc_states(void *_job)
42 {
43 struct job *job = _job;
44
45 pthread_barrier_wait(&barrier);
46
47 for (unsigned i = 0; i < STATES_PER_THREAD; i++) {
48 struct anv_state state = anv_state_pool_alloc(job->pool, 16, 16);
49 job->offsets[i] = state.offset;
50 }
51
52 return NULL;
53 }
54
run_test()55 static void run_test()
56 {
57 struct anv_instance instance;
58 struct anv_device device = {
59 .instance = &instance,
60 };
61 struct anv_state_pool state_pool;
62
63 pthread_mutex_init(&device.mutex, NULL);
64 anv_state_pool_init(&state_pool, &device, 64, 0);
65
66 pthread_barrier_init(&barrier, NULL, NUM_THREADS);
67
68 for (unsigned i = 0; i < NUM_THREADS; i++) {
69 jobs[i].pool = &state_pool;
70 jobs[i].id = i;
71 pthread_create(&jobs[i].thread, NULL, alloc_states, &jobs[i]);
72 }
73
74 for (unsigned i = 0; i < NUM_THREADS; i++)
75 pthread_join(jobs[i].thread, NULL);
76
77 /* A list of indices, one per thread */
78 unsigned next[NUM_THREADS];
79 memset(next, 0, sizeof(next));
80
81 int highest = -1;
82 while (true) {
83 /* First, we find which thread has the highest next element */
84 int thread_max = -1;
85 int max_thread_idx = -1;
86 for (unsigned i = 0; i < NUM_THREADS; i++) {
87 if (next[i] >= STATES_PER_THREAD)
88 continue;
89
90 if (thread_max < jobs[i].offsets[next[i]]) {
91 thread_max = jobs[i].offsets[next[i]];
92 max_thread_idx = i;
93 }
94 }
95
96 /* The only way this can happen is if all of the next[] values are at
97 * BLOCKS_PER_THREAD, in which case, we're done.
98 */
99 if (thread_max == -1)
100 break;
101
102 /* That next element had better be higher than the previous highest */
103 assert(jobs[max_thread_idx].offsets[next[max_thread_idx]] > highest);
104
105 highest = jobs[max_thread_idx].offsets[next[max_thread_idx]];
106 next[max_thread_idx]++;
107 }
108
109 anv_state_pool_finish(&state_pool);
110 pthread_mutex_destroy(&device.mutex);
111 }
112
main(int argc,char ** argv)113 int main(int argc, char **argv)
114 {
115 for (unsigned i = 0; i < NUM_RUNS; i++)
116 run_test();
117 }
118