1 /* SPDX-License-Identifier: LGPL-2.1+ */
16 void* mempool_alloc_tile(struct mempool *mp) {
19 /* When a tile is released we add it to the list and simply
20 * place the next pointer at its offset 0. */
22 assert(mp->tile_size >= sizeof(void*));
23 assert(mp->at_least > 0);
29 mp->freelist = * (void**) mp->freelist;
33 if (_unlikely_(!mp->first_pool) ||
34 _unlikely_(mp->first_pool->n_used >= mp->first_pool->n_tiles)) {
38 n = mp->first_pool ? mp->first_pool->n_tiles : 0;
39 n = MAX(mp->at_least, n * 2);
40 size = PAGE_ALIGN(ALIGN(sizeof(struct pool)) + n*mp->tile_size);
41 n = (size - ALIGN(sizeof(struct pool))) / mp->tile_size;
47 p->next = mp->first_pool;
54 i = mp->first_pool->n_used++;
56 return ((uint8_t*) mp->first_pool) + ALIGN(sizeof(struct pool)) + i*mp->tile_size;
59 void* mempool_alloc0_tile(struct mempool *mp) {
62 p = mempool_alloc_tile(mp);
64 memzero(p, mp->tile_size);
68 void mempool_free_tile(struct mempool *mp, void *p) {
69 * (void**) p = mp->freelist;
75 void mempool_drop(struct mempool *mp) {
76 struct pool *p = mp->first_pool;