vk: Add four unit tests for our lock-free data-structures
This commit is contained in:
parent
16c5b9f4ed
commit
b4c02253c4
|
@ -2439,6 +2439,7 @@ AC_CONFIG_FILES([Makefile
|
||||||
src/mesa/drivers/x11/Makefile
|
src/mesa/drivers/x11/Makefile
|
||||||
src/mesa/main/tests/Makefile
|
src/mesa/main/tests/Makefile
|
||||||
src/vulkan/Makefile
|
src/vulkan/Makefile
|
||||||
|
src/vulkan/tests/Makefile
|
||||||
src/util/Makefile
|
src/util/Makefile
|
||||||
src/util/tests/hash_table/Makefile])
|
src/util/tests/hash_table/Makefile])
|
||||||
|
|
||||||
|
|
|
@ -19,6 +19,7 @@
|
||||||
# FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
# FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
||||||
# IN THE SOFTWARE.
|
# IN THE SOFTWARE.
|
||||||
|
|
||||||
|
SUBDIRS = . tests
|
||||||
|
|
||||||
vulkan_includedir = $(includedir)/vulkan
|
vulkan_includedir = $(includedir)/vulkan
|
||||||
|
|
||||||
|
|
|
@ -0,0 +1,4 @@
|
||||||
|
block_pool
|
||||||
|
state_pool
|
||||||
|
state_pool_free_list_only
|
||||||
|
state_pool_no_free
|
|
@ -0,0 +1,45 @@
|
||||||
|
# Copyright © 2009 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
|
||||||
|
# on the rights to use, copy, modify, merge, publish, distribute, sub
|
||||||
|
# license, 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 NON-INFRINGEMENT. IN NO EVENT SHALL
|
||||||
|
# ADAM JACKSON 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.
|
||||||
|
|
||||||
|
AM_CPPFLAGS = \
|
||||||
|
$(INTEL_CFLAGS) \
|
||||||
|
$(VALGRIND_CFLAGS) \
|
||||||
|
$(DEFINES) \
|
||||||
|
-I$(top_srcdir)/include \
|
||||||
|
-I$(top_srcdir)/src \
|
||||||
|
-I$(top_srcdir)/src/mapi \
|
||||||
|
-I$(top_srcdir)/src/mesa \
|
||||||
|
-I$(top_srcdir)/src/mesa/drivers/dri/common \
|
||||||
|
-I$(top_srcdir)/src/mesa/drivers/dri/i965 \
|
||||||
|
-I$(top_srcdir)/src/gallium/auxiliary \
|
||||||
|
-I$(top_srcdir)/src/gallium/include \
|
||||||
|
-I$(top_srcdir)/src/vulkan
|
||||||
|
|
||||||
|
LDADD = \
|
||||||
|
$(top_builddir)/src/vulkan/libvulkan-test.la \
|
||||||
|
$(PTHREAD_LIBS) -lm -lstdc++
|
||||||
|
|
||||||
|
check_PROGRAMS = \
|
||||||
|
block_pool_no_free \
|
||||||
|
state_pool_no_free \
|
||||||
|
state_pool_free_list_only \
|
||||||
|
state_pool
|
||||||
|
|
||||||
|
TESTS = $(check_PROGRAMS)
|
|
@ -0,0 +1,104 @@
|
||||||
|
/*
|
||||||
|
* 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];
|
||||||
|
} jobs[NUM_THREADS];
|
||||||
|
|
||||||
|
static void *alloc_blocks(void *_job)
|
||||||
|
{
|
||||||
|
struct job *job = _job;
|
||||||
|
|
||||||
|
for (unsigned i = 0; i < BLOCKS_PER_THREAD; i++)
|
||||||
|
job->blocks[i] = anv_block_pool_alloc(job->pool);
|
||||||
|
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void run_test()
|
||||||
|
{
|
||||||
|
struct anv_device device;
|
||||||
|
struct anv_block_pool pool;
|
||||||
|
|
||||||
|
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);
|
||||||
|
|
||||||
|
/* 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 < jobs[i].blocks[next[i]]) {
|
||||||
|
thread_max = jobs[i].blocks[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(jobs[max_thread_idx].blocks[next[max_thread_idx]] > highest);
|
||||||
|
|
||||||
|
highest = jobs[max_thread_idx].blocks[next[max_thread_idx]];
|
||||||
|
next[max_thread_idx]++;
|
||||||
|
}
|
||||||
|
|
||||||
|
anv_block_pool_finish(&pool);
|
||||||
|
}
|
||||||
|
|
||||||
|
int main(int argc, char **argv)
|
||||||
|
{
|
||||||
|
for (unsigned i = 0; i < NUM_RUNS; i++)
|
||||||
|
run_test();
|
||||||
|
}
|
|
@ -0,0 +1,53 @@
|
||||||
|
/*
|
||||||
|
* 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 8
|
||||||
|
#define STATES_PER_THREAD_LOG2 10
|
||||||
|
#define STATES_PER_THREAD (1 << STATES_PER_THREAD_LOG2)
|
||||||
|
#define NUM_RUNS 64
|
||||||
|
|
||||||
|
#include "state_pool_test_helper.h"
|
||||||
|
|
||||||
|
int main(int argc, char **argv)
|
||||||
|
{
|
||||||
|
struct anv_device device;
|
||||||
|
struct anv_block_pool block_pool;
|
||||||
|
struct anv_state_pool state_pool;
|
||||||
|
|
||||||
|
for (unsigned i = 0; i < NUM_RUNS; i++) {
|
||||||
|
anv_block_pool_init(&block_pool, &device, 256);
|
||||||
|
anv_state_pool_init(&state_pool, &block_pool);
|
||||||
|
|
||||||
|
/* Grab one so a zero offset is impossible */
|
||||||
|
anv_state_pool_alloc(&state_pool, 16, 16);
|
||||||
|
|
||||||
|
run_state_pool_test(&state_pool);
|
||||||
|
|
||||||
|
anv_state_pool_finish(&state_pool);
|
||||||
|
anv_block_pool_finish(&block_pool);
|
||||||
|
}
|
||||||
|
}
|
|
@ -0,0 +1,64 @@
|
||||||
|
/*
|
||||||
|
* 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 8
|
||||||
|
#define STATES_PER_THREAD_LOG2 12
|
||||||
|
#define STATES_PER_THREAD (1 << STATES_PER_THREAD_LOG2)
|
||||||
|
|
||||||
|
#include "state_pool_test_helper.h"
|
||||||
|
|
||||||
|
int main(int argc, char **argv)
|
||||||
|
{
|
||||||
|
struct anv_device device;
|
||||||
|
struct anv_block_pool block_pool;
|
||||||
|
struct anv_state_pool state_pool;
|
||||||
|
|
||||||
|
anv_block_pool_init(&block_pool, &device, 4096);
|
||||||
|
anv_state_pool_init(&state_pool, &block_pool);
|
||||||
|
|
||||||
|
/* Grab one so a zero offset is impossible */
|
||||||
|
anv_state_pool_alloc(&state_pool, 16, 16);
|
||||||
|
|
||||||
|
/* Grab and return enough states that the state pool test below won't
|
||||||
|
* actually ever resize anything.
|
||||||
|
*/
|
||||||
|
{
|
||||||
|
struct anv_state states[NUM_THREADS * STATES_PER_THREAD];
|
||||||
|
for (unsigned i = 0; i < NUM_THREADS * STATES_PER_THREAD; i++) {
|
||||||
|
states[i] = anv_state_pool_alloc(&state_pool, 16, 16);
|
||||||
|
assert(states[i].offset != 0);
|
||||||
|
}
|
||||||
|
|
||||||
|
for (unsigned i = 0; i < NUM_THREADS * STATES_PER_THREAD; i++)
|
||||||
|
anv_state_pool_free(&state_pool, states[i]);
|
||||||
|
}
|
||||||
|
|
||||||
|
run_state_pool_test(&state_pool);
|
||||||
|
|
||||||
|
anv_state_pool_finish(&state_pool);
|
||||||
|
anv_block_pool_finish(&block_pool);
|
||||||
|
}
|
|
@ -0,0 +1,115 @@
|
||||||
|
/*
|
||||||
|
* 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 STATES_PER_THREAD 1024
|
||||||
|
#define NUM_RUNS 64
|
||||||
|
|
||||||
|
struct job {
|
||||||
|
pthread_t thread;
|
||||||
|
unsigned id;
|
||||||
|
struct anv_state_pool *pool;
|
||||||
|
uint32_t offsets[STATES_PER_THREAD];
|
||||||
|
} jobs[NUM_THREADS];
|
||||||
|
|
||||||
|
pthread_barrier_t barrier;
|
||||||
|
|
||||||
|
static void *alloc_states(void *_job)
|
||||||
|
{
|
||||||
|
struct job *job = _job;
|
||||||
|
|
||||||
|
pthread_barrier_wait(&barrier);
|
||||||
|
|
||||||
|
for (unsigned i = 0; i < STATES_PER_THREAD; i++) {
|
||||||
|
struct anv_state state = anv_state_pool_alloc(job->pool, 16, 16);
|
||||||
|
job->offsets[i] = state.offset;
|
||||||
|
}
|
||||||
|
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void run_test()
|
||||||
|
{
|
||||||
|
struct anv_device device;
|
||||||
|
struct anv_block_pool block_pool;
|
||||||
|
struct anv_state_pool state_pool;
|
||||||
|
|
||||||
|
anv_block_pool_init(&block_pool, &device, 64);
|
||||||
|
anv_state_pool_init(&state_pool, &block_pool);
|
||||||
|
|
||||||
|
pthread_barrier_init(&barrier, NULL, NUM_THREADS);
|
||||||
|
|
||||||
|
for (unsigned i = 0; i < NUM_THREADS; i++) {
|
||||||
|
jobs[i].pool = &state_pool;
|
||||||
|
jobs[i].id = i;
|
||||||
|
pthread_create(&jobs[i].thread, NULL, alloc_states, &jobs[i]);
|
||||||
|
}
|
||||||
|
|
||||||
|
for (unsigned i = 0; i < NUM_THREADS; i++)
|
||||||
|
pthread_join(jobs[i].thread, NULL);
|
||||||
|
|
||||||
|
/* 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] >= STATES_PER_THREAD)
|
||||||
|
continue;
|
||||||
|
|
||||||
|
if (thread_max < jobs[i].offsets[next[i]]) {
|
||||||
|
thread_max = jobs[i].offsets[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(jobs[max_thread_idx].offsets[next[max_thread_idx]] > highest);
|
||||||
|
|
||||||
|
highest = jobs[max_thread_idx].offsets[next[max_thread_idx]];
|
||||||
|
next[max_thread_idx]++;
|
||||||
|
}
|
||||||
|
|
||||||
|
anv_state_pool_finish(&state_pool);
|
||||||
|
anv_block_pool_finish(&block_pool);
|
||||||
|
}
|
||||||
|
|
||||||
|
int main(int argc, char **argv)
|
||||||
|
{
|
||||||
|
for (unsigned i = 0; i < NUM_RUNS; i++)
|
||||||
|
run_test();
|
||||||
|
}
|
|
@ -0,0 +1,71 @@
|
||||||
|
/*
|
||||||
|
* 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>
|
||||||
|
|
||||||
|
struct job {
|
||||||
|
struct anv_state_pool *pool;
|
||||||
|
unsigned id;
|
||||||
|
pthread_t thread;
|
||||||
|
} jobs[NUM_THREADS];
|
||||||
|
|
||||||
|
pthread_barrier_t barrier;
|
||||||
|
|
||||||
|
static void *alloc_states(void *void_job)
|
||||||
|
{
|
||||||
|
struct job *job = void_job;
|
||||||
|
|
||||||
|
const unsigned chunk_size = 1 << (job->id % STATES_PER_THREAD_LOG2);
|
||||||
|
const unsigned num_chunks = STATES_PER_THREAD / chunk_size;
|
||||||
|
|
||||||
|
struct anv_state states[chunk_size];
|
||||||
|
|
||||||
|
pthread_barrier_wait(&barrier);
|
||||||
|
|
||||||
|
for (unsigned c = 0; c < num_chunks; c++) {
|
||||||
|
for (unsigned i = 0; i < chunk_size; i++) {
|
||||||
|
states[i] = anv_state_pool_alloc(job->pool, 16, 16);
|
||||||
|
memset(states[i].map, 139, 16);
|
||||||
|
assert(states[i].offset != 0);
|
||||||
|
}
|
||||||
|
|
||||||
|
for (unsigned i = 0; i < chunk_size; i++)
|
||||||
|
anv_state_pool_free(job->pool, states[i]);
|
||||||
|
}
|
||||||
|
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void run_state_pool_test(struct anv_state_pool *state_pool)
|
||||||
|
{
|
||||||
|
pthread_barrier_init(&barrier, NULL, NUM_THREADS);
|
||||||
|
|
||||||
|
for (unsigned i = 0; i < NUM_THREADS; i++) {
|
||||||
|
jobs[i].pool = state_pool;
|
||||||
|
jobs[i].id = i;
|
||||||
|
pthread_create(&jobs[i].thread, NULL, alloc_states, &jobs[i]);
|
||||||
|
}
|
||||||
|
|
||||||
|
for (unsigned i = 0; i < NUM_THREADS; i++)
|
||||||
|
pthread_join(jobs[i].thread, NULL);
|
||||||
|
}
|
Loading…
Reference in New Issue