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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
|
/*
* Copyright © 2015 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.
*/
#include <pthread.h>
#include "anv_private.h"
#define NUM_THREADS 16
#define BLOCKS_PER_THREAD 1024
#define NUM_RUNS 64
struct job {
pthread_t thread;
unsigned id;
struct anv_block_pool *pool;
uint32_t blocks[BLOCKS_PER_THREAD];
uint32_t back_blocks[BLOCKS_PER_THREAD];
} jobs[NUM_THREADS];
static void *alloc_blocks(void *_job)
{
struct job *job = _job;
int32_t block, *data;
for (unsigned i = 0; i < BLOCKS_PER_THREAD; i++) {
block = anv_block_pool_alloc(job->pool);
data = job->pool->map + block;
*data = block;
assert(block >= 0);
job->blocks[i] = block;
block = anv_block_pool_alloc_back(job->pool);
data = job->pool->map + block;
*data = block;
assert(block < 0);
job->back_blocks[i] = -block;
}
for (unsigned i = 0; i < BLOCKS_PER_THREAD; i++) {
block = job->blocks[i];
data = job->pool->map + block;
assert(*data == block);
block = -job->back_blocks[i];
data = job->pool->map + block;
assert(*data == block);
}
return NULL;
}
static void validate_monotonic(uint32_t **blocks)
{
/* A list of indices, one per thread */
unsigned next[NUM_THREADS];
memset(next, 0, sizeof(next));
int highest = -1;
while (true) {
/* First, we find which thread has the highest next element */
int thread_max = -1;
int max_thread_idx = -1;
for (unsigned i = 0; i < NUM_THREADS; i++) {
if (next[i] >= BLOCKS_PER_THREAD)
continue;
if (thread_max < blocks[i][next[i]]) {
thread_max = blocks[i][next[i]];
max_thread_idx = i;
}
}
/* The only way this can happen is if all of the next[] values are at
* BLOCKS_PER_THREAD, in which case, we're done.
*/
if (thread_max == -1)
break;
/* That next element had better be higher than the previous highest */
assert(blocks[max_thread_idx][next[max_thread_idx]] > highest);
highest = blocks[max_thread_idx][next[max_thread_idx]];
next[max_thread_idx]++;
}
}
static void run_test()
{
struct anv_device device;
struct anv_block_pool pool;
pthread_mutex_init(&device.mutex, NULL);
anv_block_pool_init(&pool, &device, 16);
for (unsigned i = 0; i < NUM_THREADS; i++) {
jobs[i].pool = &pool;
jobs[i].id = i;
pthread_create(&jobs[i].thread, NULL, alloc_blocks, &jobs[i]);
}
for (unsigned i = 0; i < NUM_THREADS; i++)
pthread_join(jobs[i].thread, NULL);
/* Validate that the block allocations were monotonic */
uint32_t *block_ptrs[NUM_THREADS];
for (unsigned i = 0; i < NUM_THREADS; i++)
block_ptrs[i] = jobs[i].blocks;
validate_monotonic(block_ptrs);
/* Validate that the back block allocations were monotonic */
for (unsigned i = 0; i < NUM_THREADS; i++)
block_ptrs[i] = jobs[i].back_blocks;
validate_monotonic(block_ptrs);
anv_block_pool_finish(&pool);
pthread_mutex_destroy(&device.mutex);
}
int main(int argc, char **argv)
{
for (unsigned i = 0; i < NUM_RUNS; i++)
run_test();
}
|
