src/vulkan/tests/state_pool_no_free.c

   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
  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
  55 static void run_test()
  56 {
  57    struct anv_device device;
  58    struct anv_block_pool block_pool;
  59    struct anv_state_pool state_pool;
  60
  61    anv_block_pool_init(&block_pool, &device, 64);
  62    anv_state_pool_init(&state_pool, &block_pool);
  63
  64    pthread_barrier_init(&barrier, NULL, NUM_THREADS);
  65
  66    for (unsigned i = 0; i < NUM_THREADS; i++) {
  67       jobs[i].pool = &state_pool;
  68       jobs[i].id = i;
  69       pthread_create(&jobs[i].thread, NULL, alloc_states, &jobs[i]);
  70    }
  71
  72    for (unsigned i = 0; i < NUM_THREADS; i++)
  73       pthread_join(jobs[i].thread, NULL);
  74
  75    /* A list of indices, one per thread */
  76    unsigned next[NUM_THREADS];
  77    memset(next, 0, sizeof(next));
  78
  79    int highest = -1;
  80    while (true) {
  81       /* First, we find which thread has the highest next element */
  82       int thread_max = -1;
  83       int max_thread_idx = -1;
  84       for (unsigned i = 0; i < NUM_THREADS; i++) {
  85          if (next[i] >= STATES_PER_THREAD)
  86             continue;
  87
  88          if (thread_max < jobs[i].offsets[next[i]]) {
  89             thread_max = jobs[i].offsets[next[i]];
  90             max_thread_idx = i;
  91          }
  92       }
  93
  94       /* The only way this can happen is if all of the next[] values are at
  95        * BLOCKS_PER_THREAD, in which case, we're done.
  96        */
  97       if (thread_max == -1)
  98          break;
  99
 100       /* That next element had better be higher than the previous highest */
 101       assert(jobs[max_thread_idx].offsets[next[max_thread_idx]] > highest);
 102
 103       highest = jobs[max_thread_idx].offsets[next[max_thread_idx]];
 104       next[max_thread_idx]++;
 105    }
 106
 107    anv_state_pool_finish(&state_pool);
 108    anv_block_pool_finish(&block_pool);
 109 }
 110
 111 int main(int argc, char **argv)
 112 {
 113    for (unsigned i = 0; i < NUM_RUNS; i++)
 114       run_test();
 115 }