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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
|
/*
* Copyright 2010 Marek Olšák <maraeo@gmail.com>
*
* 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
* on the rights to use, copy, modify, merge, publish, distribute, sub
* license, 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 NON-INFRINGEMENT. IN NO EVENT SHALL
* THE AUTHOR(S) AND/OR THEIR SUPPLIERS 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 "util/u_mempool.h"
#include "util/u_math.h"
#include "util/u_memory.h"
#include "util/u_simple_list.h"
#include <stdio.h>
#define UTIL_MEMPOOL_MAGIC 0xcafe4321
/* The block is either allocated memory or free space. */
struct util_mempool_block {
/* The header. */
/* The first next free block. */
struct util_mempool_block *next_free;
intptr_t magic;
/* Memory after the last member is dedicated to the block itself.
* The allocated size is always larger than this structure. */
};
static struct util_mempool_block *
util_mempool_get_block(struct util_mempool *pool,
struct util_mempool_page *page, unsigned index)
{
return (struct util_mempool_block*)
((uint8_t*)page + sizeof(struct util_mempool_page) +
(pool->block_size * index));
}
static void util_mempool_add_new_page(struct util_mempool *pool)
{
struct util_mempool_page *page;
struct util_mempool_block *block;
int i;
page = MALLOC(pool->page_size);
insert_at_tail(&pool->list, page);
/* Mark all blocks as free. */
for (i = 0; i < pool->num_blocks-1; i++) {
block = util_mempool_get_block(pool, page, i);
block->next_free = util_mempool_get_block(pool, page, i+1);
block->magic = UTIL_MEMPOOL_MAGIC;
}
block = util_mempool_get_block(pool, page, pool->num_blocks-1);
block->next_free = pool->first_free;
block->magic = UTIL_MEMPOOL_MAGIC;
pool->first_free = util_mempool_get_block(pool, page, 0);
pool->num_pages++;
#if 0
fprintf(stderr, "New page! Num of pages: %i\n", pool->num_pages);
#endif
}
static void *util_mempool_malloc_st(struct util_mempool *pool)
{
struct util_mempool_block *block;
if (!pool->first_free)
util_mempool_add_new_page(pool);
block = pool->first_free;
assert(block->magic == UTIL_MEMPOOL_MAGIC);
pool->first_free = block->next_free;
return (uint8_t*)block + sizeof(struct util_mempool_block);
}
static void util_mempool_free_st(struct util_mempool *pool, void *ptr)
{
struct util_mempool_block *block =
(struct util_mempool_block*)
((uint8_t*)ptr - sizeof(struct util_mempool_block));
assert(block->magic == UTIL_MEMPOOL_MAGIC);
block->next_free = pool->first_free;
pool->first_free = block;
}
static void *util_mempool_malloc_mt(struct util_mempool *pool)
{
void *mem;
pipe_mutex_lock(pool->mutex);
mem = util_mempool_malloc_st(pool);
pipe_mutex_unlock(pool->mutex);
return mem;
}
static void util_mempool_free_mt(struct util_mempool *pool, void *ptr)
{
pipe_mutex_lock(pool->mutex);
util_mempool_free_st(pool, ptr);
pipe_mutex_unlock(pool->mutex);
}
void util_mempool_set_thread_safety(struct util_mempool *pool,
enum util_mempool_threading threading)
{
pool->threading = threading;
if (threading) {
pool->malloc = util_mempool_malloc_mt;
pool->free = util_mempool_free_mt;
} else {
pool->malloc = util_mempool_malloc_st;
pool->free = util_mempool_free_st;
}
}
void util_mempool_create(struct util_mempool *pool,
unsigned item_size,
unsigned num_blocks,
enum util_mempool_threading threading)
{
item_size = align(item_size, sizeof(intptr_t));
pool->num_pages = 0;
pool->num_blocks = num_blocks;
pool->block_size = sizeof(struct util_mempool_block) + item_size;
pool->block_size = align(pool->block_size, sizeof(intptr_t));
pool->page_size = sizeof(struct util_mempool_page) +
num_blocks * pool->block_size;
pool->first_free = NULL;
make_empty_list(&pool->list);
pipe_mutex_init(pool->mutex);
util_mempool_set_thread_safety(pool, threading);
}
void util_mempool_destroy(struct util_mempool *pool)
{
struct util_mempool_page *page, *temp;
foreach_s(page, temp, &pool->list) {
remove_from_list(page);
FREE(page);
}
pipe_mutex_destroy(pool->mutex);
}
|
