2
* Copyright © 2015 Intel Corporation
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:
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
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
26
#include "anv_private.h"
27
#include "test_common.h"
29
#define NUM_THREADS 16
30
#define STATES_PER_THREAD 1024
36
struct anv_state_pool *pool;
37
uint32_t offsets[STATES_PER_THREAD];
40
pthread_barrier_t barrier;
42
static void *alloc_states(void *_job)
44
struct job *job = _job;
46
pthread_barrier_wait(&barrier);
48
for (unsigned i = 0; i < STATES_PER_THREAD; i++) {
49
struct anv_state state = anv_state_pool_alloc(job->pool, 16, 16);
50
job->offsets[i] = state.offset;
56
static void run_test()
58
struct anv_physical_device physical_device = { };
59
struct anv_device device = {
60
.physical = &physical_device,
62
struct anv_state_pool state_pool;
64
pthread_mutex_init(&device.mutex, NULL);
65
anv_bo_cache_init(&device.bo_cache, &device);
66
anv_state_pool_init(&state_pool, &device, "test", 4096, 0, 64);
68
pthread_barrier_init(&barrier, NULL, NUM_THREADS);
70
for (unsigned i = 0; i < NUM_THREADS; i++) {
71
jobs[i].pool = &state_pool;
73
pthread_create(&jobs[i].thread, NULL, alloc_states, &jobs[i]);
76
for (unsigned i = 0; i < NUM_THREADS; i++)
77
pthread_join(jobs[i].thread, NULL);
79
/* A list of indices, one per thread */
80
unsigned next[NUM_THREADS];
81
memset(next, 0, sizeof(next));
85
/* First, we find which thread has the highest next element */
87
int max_thread_idx = -1;
88
for (unsigned i = 0; i < NUM_THREADS; i++) {
89
if (next[i] >= STATES_PER_THREAD)
92
if (thread_max < jobs[i].offsets[next[i]]) {
93
thread_max = jobs[i].offsets[next[i]];
98
/* The only way this can happen is if all of the next[] values are at
99
* BLOCKS_PER_THREAD, in which case, we're done.
101
if (thread_max == -1)
104
/* That next element had better be higher than the previous highest */
105
ASSERT(jobs[max_thread_idx].offsets[next[max_thread_idx]] > highest);
107
highest = jobs[max_thread_idx].offsets[next[max_thread_idx]];
108
next[max_thread_idx]++;
111
anv_state_pool_finish(&state_pool);
112
anv_bo_cache_finish(&device.bo_cache);
113
pthread_mutex_destroy(&device.mutex);
118
for (unsigned i = 0; i < NUM_RUNS; i++)