1bf215546Sopenharmony_ci/* 2bf215546Sopenharmony_ci * Copyright © 2018 Intel Corporation 3bf215546Sopenharmony_ci * 4bf215546Sopenharmony_ci * Permission is hereby granted, free of charge, to any person obtaining a 5bf215546Sopenharmony_ci * copy of this software and associated documentation files (the "Software"), 6bf215546Sopenharmony_ci * to deal in the Software without restriction, including without limitation 7bf215546Sopenharmony_ci * the rights to use, copy, modify, merge, publish, distribute, sublicense, 8bf215546Sopenharmony_ci * and/or sell copies of the Software, and to permit persons to whom the 9bf215546Sopenharmony_ci * Software is furnished to do so, subject to the following conditions: 10bf215546Sopenharmony_ci * 11bf215546Sopenharmony_ci * The above copyright notice and this permission notice (including the next 12bf215546Sopenharmony_ci * paragraph) shall be included in all copies or substantial portions of the 13bf215546Sopenharmony_ci * Software. 14bf215546Sopenharmony_ci * 15bf215546Sopenharmony_ci * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 16bf215546Sopenharmony_ci * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 17bf215546Sopenharmony_ci * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL 18bf215546Sopenharmony_ci * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 19bf215546Sopenharmony_ci * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING 20bf215546Sopenharmony_ci * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS 21bf215546Sopenharmony_ci * IN THE SOFTWARE. 22bf215546Sopenharmony_ci */ 23bf215546Sopenharmony_ci 24bf215546Sopenharmony_ci#include "anv_private.h" 25bf215546Sopenharmony_ci#include "test_common.h" 26bf215546Sopenharmony_ci 27bf215546Sopenharmony_ciint main(void) 28bf215546Sopenharmony_ci{ 29bf215546Sopenharmony_ci struct anv_physical_device physical_device = { 30bf215546Sopenharmony_ci .use_softpin = true, 31bf215546Sopenharmony_ci }; 32bf215546Sopenharmony_ci struct anv_device device = { 33bf215546Sopenharmony_ci .physical = &physical_device, 34bf215546Sopenharmony_ci }; 35bf215546Sopenharmony_ci struct anv_state_pool state_pool; 36bf215546Sopenharmony_ci 37bf215546Sopenharmony_ci pthread_mutex_init(&device.mutex, NULL); 38bf215546Sopenharmony_ci anv_bo_cache_init(&device.bo_cache, &device); 39bf215546Sopenharmony_ci anv_state_pool_init(&state_pool, &device, "test", 4096, 0, 4096); 40bf215546Sopenharmony_ci 41bf215546Sopenharmony_ci /* Get the size of the underlying block_pool */ 42bf215546Sopenharmony_ci struct anv_block_pool *bp = &state_pool.block_pool; 43bf215546Sopenharmony_ci uint64_t pool_size = bp->size; 44bf215546Sopenharmony_ci 45bf215546Sopenharmony_ci /* Grab one so the pool has some initial usage */ 46bf215546Sopenharmony_ci anv_state_pool_alloc(&state_pool, 16, 16); 47bf215546Sopenharmony_ci 48bf215546Sopenharmony_ci /* Grab a state that is the size of the initial allocation */ 49bf215546Sopenharmony_ci struct anv_state state = anv_state_pool_alloc(&state_pool, pool_size, 16); 50bf215546Sopenharmony_ci 51bf215546Sopenharmony_ci /* The pool must have grown */ 52bf215546Sopenharmony_ci ASSERT(bp->size > pool_size); 53bf215546Sopenharmony_ci 54bf215546Sopenharmony_ci /* And the state must have been allocated at the end of the original size */ 55bf215546Sopenharmony_ci ASSERT(state.offset == pool_size); 56bf215546Sopenharmony_ci 57bf215546Sopenharmony_ci /* A new allocation that fits into the returned empty space should have an 58bf215546Sopenharmony_ci * offset within the original pool size 59bf215546Sopenharmony_ci */ 60bf215546Sopenharmony_ci state = anv_state_pool_alloc(&state_pool, 4096, 16); 61bf215546Sopenharmony_ci ASSERT(state.offset + state.alloc_size <= pool_size); 62bf215546Sopenharmony_ci 63bf215546Sopenharmony_ci /* We should be able to allocate pool->block_size'd chunks in the returned area 64bf215546Sopenharmony_ci */ 65bf215546Sopenharmony_ci int left_chunks = pool_size / 4096 - 2; 66bf215546Sopenharmony_ci for (int i = 0; i < left_chunks; i++) { 67bf215546Sopenharmony_ci state = anv_state_pool_alloc(&state_pool, 4096, 16); 68bf215546Sopenharmony_ci ASSERT(state.offset + state.alloc_size <= pool_size); 69bf215546Sopenharmony_ci } 70bf215546Sopenharmony_ci 71bf215546Sopenharmony_ci /* Now the next chunk to be allocated should make the pool grow again */ 72bf215546Sopenharmony_ci pool_size = bp->size; 73bf215546Sopenharmony_ci state = anv_state_pool_alloc(&state_pool, 4096, 16); 74bf215546Sopenharmony_ci ASSERT(bp->size > pool_size); 75bf215546Sopenharmony_ci ASSERT(state.offset == pool_size); 76bf215546Sopenharmony_ci 77bf215546Sopenharmony_ci anv_state_pool_finish(&state_pool); 78bf215546Sopenharmony_ci anv_bo_cache_finish(&device.bo_cache); 79bf215546Sopenharmony_ci pthread_mutex_destroy(&device.mutex); 80bf215546Sopenharmony_ci} 81