2 * Copyright © 2018 Intel Corporation
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:
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
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
24 #include "anv_private.h"
25 #include "test_common.h"
27 int main(int argc
, char **argv
)
29 struct anv_physical_device physical_device
= {
32 struct anv_device device
= {
33 .physical
= &physical_device
,
35 struct anv_state_pool state_pool
;
37 pthread_mutex_init(&device
.mutex
, NULL
);
38 anv_bo_cache_init(&device
.bo_cache
);
39 anv_state_pool_init(&state_pool
, &device
, 4096, 0, 4096);
41 /* Get the size of the underlying block_pool */
42 struct anv_block_pool
*bp
= &state_pool
.block_pool
;
43 uint64_t pool_size
= bp
->size
;
45 /* Grab one so the pool has some initial usage */
46 anv_state_pool_alloc(&state_pool
, 16, 16);
48 /* Grab a state that is the size of the initial allocation */
49 struct anv_state state
= anv_state_pool_alloc(&state_pool
, pool_size
, 16);
51 /* The pool must have grown */
52 ASSERT(bp
->size
> pool_size
);
54 /* And the state must have been allocated at the end of the original size */
55 ASSERT(state
.offset
== pool_size
);
57 /* A new allocation that fits into the returned empty space should have an
58 * offset within the original pool size
60 state
= anv_state_pool_alloc(&state_pool
, 4096, 16);
61 ASSERT(state
.offset
+ state
.alloc_size
<= pool_size
);
63 /* We should be able to allocate pool->block_size'd chunks in the returned area
65 int left_chunks
= pool_size
/ 4096 - 2;
66 for (int i
= 0; i
< left_chunks
; i
++) {
67 state
= anv_state_pool_alloc(&state_pool
, 4096, 16);
68 ASSERT(state
.offset
+ state
.alloc_size
<= pool_size
);
71 /* Now the next chunk to be allocated should make the pool grow again */
73 state
= anv_state_pool_alloc(&state_pool
, 4096, 16);
74 ASSERT(bp
->size
> pool_size
);
75 ASSERT(state
.offset
== pool_size
);
77 anv_state_pool_finish(&state_pool
);