1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
/*
* Copyright © 2018 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 "anv_private.h"
int main(int argc, char **argv)
{
struct anv_instance instance;
struct anv_device device = {
.instance = &instance,
};
struct anv_state_pool state_pool;
anv_state_pool_init(&state_pool, &device, 4096, 4096, EXEC_OBJECT_PINNED);
/* Get the size of the underlying block_pool */
struct anv_block_pool *bp = &state_pool.block_pool;
uint64_t pool_size = bp->size;
/* Grab one so the pool has some initial usage */
anv_state_pool_alloc(&state_pool, 16, 16);
/* Grab a state that is the size of the initial allocation */
struct anv_state state = anv_state_pool_alloc(&state_pool, pool_size, 16);
/* The pool must have grown */
assert(bp->size > pool_size);
/* And the state must have been allocated at the end of the original size */
assert(state.offset == pool_size);
/* A new allocation that fits into the returned empty space should have an
* offset within the original pool size
*/
state = anv_state_pool_alloc(&state_pool, 4096, 16);
assert(state.offset + state.alloc_size <= pool_size);
/* We should be able to allocate pool->block_size'd chunks in the returned area
*/
int left_chunks = pool_size / 4096 - 2;
for (int i = 0; i < left_chunks; i++) {
state = anv_state_pool_alloc(&state_pool, 4096, 16);
assert(state.offset + state.alloc_size <= pool_size);
}
/* Now the next chunk to be allocated should make the pool grow again */
pool_size = bp->size;
state = anv_state_pool_alloc(&state_pool, 4096, 16);
assert(bp->size > pool_size);
assert(state.offset == pool_size);
anv_state_pool_finish(&state_pool);
}
|
