Home | History | Annotate | Download | only in tests
      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 struct job {
     27    struct anv_state_pool *pool;
     28    unsigned id;
     29    pthread_t thread;
     30 } jobs[NUM_THREADS];
     31 
     32 pthread_barrier_t barrier;
     33 
     34 static void *alloc_states(void *void_job)
     35 {
     36    struct job *job = void_job;
     37 
     38    const unsigned chunk_size = 1 << (job->id % STATES_PER_THREAD_LOG2);
     39    const unsigned num_chunks = STATES_PER_THREAD / chunk_size;
     40 
     41    struct anv_state states[chunk_size];
     42 
     43    pthread_barrier_wait(&barrier);
     44 
     45    for (unsigned c = 0; c < num_chunks; c++) {
     46       for (unsigned i = 0; i < chunk_size; i++) {
     47          states[i] = anv_state_pool_alloc(job->pool, 16, 16);
     48          memset(states[i].map, 139, 16);
     49          assert(states[i].offset != 0);
     50       }
     51 
     52       for (unsigned i = 0; i < chunk_size; i++)
     53          anv_state_pool_free(job->pool, states[i]);
     54    }
     55 
     56    return NULL;
     57 }
     58 
     59 static void run_state_pool_test(struct anv_state_pool *state_pool)
     60 {
     61    pthread_barrier_init(&barrier, NULL, NUM_THREADS);
     62 
     63    for (unsigned i = 0; i < NUM_THREADS; i++) {
     64       jobs[i].pool = state_pool;
     65       jobs[i].id = i;
     66       pthread_create(&jobs[i].thread, NULL, alloc_states, &jobs[i]);
     67    }
     68 
     69    for (unsigned i = 0; i < NUM_THREADS; i++)
     70       pthread_join(jobs[i].thread, NULL);
     71 }
     72