blob: a0283199a7825d421907dc966ae65d29e62d725e (
plain)
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
|
// SPDX-License-Identifier: Apache-2.0 OR GPL-2.0-or-later
/*
* This file provides some functions to manage a pool of pre-allocated
* objects. It also provides a method to reserve a pre-defined number
* of objects for higher priorty requests. The allocations follow the
* following rules:
*
* 1. An allocation will succeed at any priority if there is more than
* the reserved number of objects free.
* 2. Only high priority allocations will succeed when there are less
* than the reserved number of objects free.
* 3. When an allocation is freed it is always added to the high priority
* pool if there are less than the reserved number of allocations
* available.
*
* Copyright 2013-2014 IBM Corp.
*/
#include <pool.h>
#include <string.h>
#include <stdlib.h>
#include <ccan/list/list.h>
void* pool_get(struct pool *pool, enum pool_priority priority)
{
void *obj;
if (!pool->free_count ||
((pool->free_count <= pool->reserved) && priority == POOL_NORMAL))
return NULL;
pool->free_count--;
obj = (void *) list_pop_(&pool->free_list, 0);
assert(obj);
memset(obj, 0, pool->obj_size);
return obj;
}
void pool_free_object(struct pool *pool, void *obj)
{
pool->free_count++;
list_add_tail(&pool->free_list,
(struct list_node *) (obj));
}
int pool_init(struct pool *pool, size_t obj_size, int count, int reserved)
{
int i;
if (obj_size < sizeof(struct list_node))
obj_size = sizeof(struct list_node);
assert(count >= reserved);
pool->buf = malloc(obj_size*count);
if (!pool->buf)
return -1;
pool->obj_size = obj_size;
pool->free_count = count;
pool->reserved = reserved;
list_head_init(&pool->free_list);
for(i = 0; i < count; i++)
list_add_tail(&pool->free_list,
(struct list_node *) (pool->buf + obj_size*i));
return 0;
}
|
