]>
Commit | Line | Data |
---|---|---|
db137867 AC |
1 | /* |
2 | * ircd-ratbox: A slightly useful ircd. | |
3 | * balloc.c: A block allocator. | |
4 | * | |
5 | * Copyright (C) 1990 Jarkko Oikarinen and University of Oulu, Co Center | |
6 | * Copyright (C) 1996-2002 Hybrid Development Team | |
7 | * Copyright (C) 2002-2006 ircd-ratbox development team | |
8 | * | |
55abcbb2 | 9 | * Below are the orignal headers from the old blalloc.c |
db137867 AC |
10 | * |
11 | * File: blalloc.c | |
12 | * Owner: Wohali (Joan Touzet) | |
55abcbb2 | 13 | * |
db137867 AC |
14 | * Modified 2001/11/29 for mmap() support by Aaron Sethman <androsyn@ratbox.org> |
15 | * | |
16 | * This program is free software; you can redistribute it and/or modify | |
17 | * it under the terms of the GNU General Public License as published by | |
18 | * the Free Software Foundation; either version 2 of the License, or | |
19 | * (at your option) any later version. | |
20 | * | |
21 | * This program is distributed in the hope that it will be useful, | |
22 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
23 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
24 | * GNU General Public License for more details. | |
25 | * | |
26 | * You should have received a copy of the GNU General Public License | |
27 | * along with this program; if not, write to the Free Software | |
28 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 | |
29 | * USA | |
30 | * | |
3202e249 | 31 | * $Id: balloc.c 26100 2008-09-20 01:27:19Z androsyn $ |
db137867 AC |
32 | */ |
33 | ||
55abcbb2 | 34 | /* |
db137867 AC |
35 | * About the block allocator |
36 | * | |
37 | * Basically we have three ways of getting memory off of the operating | |
38 | * system. Below are this list of methods and the order of preference. | |
39 | * | |
40 | * 1. mmap() anonymous pages with the MMAP_ANON flag. | |
41 | * 2. mmap() via the /dev/zero trick. | |
55abcbb2 KB |
42 | * 3. HeapCreate/HeapAlloc (on win32) |
43 | * 4. malloc() | |
db137867 AC |
44 | * |
45 | * The advantages of 1 and 2 are this. We can munmap() the pages which will | |
55abcbb2 | 46 | * return the pages back to the operating system, thus reducing the size |
db137867 AC |
47 | * of the process as the memory is unused. malloc() on many systems just keeps |
48 | * a heap of memory to itself, which never gets given back to the OS, except on | |
49 | * exit. This of course is bad, if say we have an event that causes us to allocate | |
50 | * say, 200MB of memory, while our normal memory consumption would be 15MB. In the | |
51 | * malloc() case, the amount of memory allocated to our process never goes down, as | |
52 | * malloc() has it locked up in its heap. With the mmap() method, we can munmap() | |
53 | * the block and return it back to the OS, thus causing our memory consumption to go | |
54 | * down after we no longer need it. | |
55abcbb2 | 55 | * |
db137867 AC |
56 | * |
57 | * | |
58 | */ | |
fe037171 EM |
59 | #include <librb_config.h> |
60 | #include <rb_lib.h> | |
db137867 | 61 | |
ce1c921c VY |
62 | static uintptr_t offset_pad; |
63 | ||
db137867 AC |
64 | /* status information for an allocated block in heap */ |
65 | struct rb_heap_block | |
66 | { | |
67 | size_t alloc_size; | |
68 | rb_dlink_node node; | |
69 | unsigned long free_count; | |
70 | void *elems; /* Points to allocated memory */ | |
71 | }; | |
72 | typedef struct rb_heap_block rb_heap_block; | |
73 | ||
db137867 AC |
74 | /* information for the root node of the heap */ |
75 | struct rb_bh | |
76 | { | |
77 | rb_dlink_node hlist; | |
78 | size_t elemSize; /* Size of each element to be stored */ | |
79 | unsigned long elemsPerBlock; /* Number of elements per block */ | |
80 | rb_dlink_list block_list; | |
81 | rb_dlink_list free_list; | |
82 | char *desc; | |
83 | }; | |
84 | ||
db137867 AC |
85 | static rb_dlink_list *heap_lists; |
86 | ||
db137867 AC |
87 | #define rb_bh_fail(x) _rb_bh_fail(x, __FILE__, __LINE__) |
88 | ||
89 | static void | |
90 | _rb_bh_fail(const char *reason, const char *file, int line) | |
91 | { | |
92 | rb_lib_log("rb_heap_blockheap failure: %s (%s:%d)", reason, file, line); | |
93 | abort(); | |
94 | } | |
3202e249 | 95 | |
db137867 AC |
96 | /* |
97 | * void rb_init_bh(void) | |
55abcbb2 | 98 | * |
db137867 AC |
99 | * Inputs: None |
100 | * Outputs: None | |
101 | * Side Effects: Initializes the block heap | |
102 | */ | |
103 | ||
104 | void | |
105 | rb_init_bh(void) | |
106 | { | |
107 | heap_lists = rb_malloc(sizeof(rb_dlink_list)); | |
ce1c921c VY |
108 | offset_pad = sizeof(void *); |
109 | /* XXX if you get SIGBUS when trying to use a long long..here is where you need to | |
110 | * fix your shit | |
111 | */ | |
112 | #ifdef __sparc__ | |
113 | if((offset_pad % __alignof__(long long)) != 0) | |
114 | { | |
115 | offset_pad += __alignof__(long long); | |
116 | offset_pad &= ~(__alignof__(long long) - 1); | |
117 | } | |
3202e249 | 118 | #endif |
db137867 | 119 | } |
db137867 AC |
120 | |
121 | /* ************************************************************************ */ | |
122 | /* FUNCTION DOCUMENTATION: */ | |
123 | /* rb_bh_create */ | |
124 | /* Description: */ | |
125 | /* Creates a new blockheap from which smaller blocks can be allocated. */ | |
126 | /* Intended to be used instead of multiple calls to malloc() when */ | |
127 | /* performance is an issue. */ | |
128 | /* Parameters: */ | |
129 | /* elemsize (IN): Size of the basic element to be stored */ | |
130 | /* elemsperblock (IN): Number of elements to be stored in a single block */ | |
131 | /* of memory. When the blockheap runs out of free memory, it will */ | |
132 | /* allocate elemsize * elemsperblock more. */ | |
133 | /* Returns: */ | |
134 | /* Pointer to new rb_bh, or NULL if unsuccessful */ | |
135 | /* ************************************************************************ */ | |
136 | rb_bh * | |
137 | rb_bh_create(size_t elemsize, int elemsperblock, const char *desc) | |
138 | { | |
139 | rb_bh *bh; | |
140 | lrb_assert(elemsize > 0 && elemsperblock > 0); | |
141 | lrb_assert(elemsize >= sizeof(rb_dlink_node)); | |
ce1c921c | 142 | |
db137867 | 143 | /* Catch idiotic requests up front */ |
c2ac22cc | 144 | if((elemsize == 0) || (elemsperblock <= 0)) |
db137867 AC |
145 | { |
146 | rb_bh_fail("Attempting to rb_bh_create idiotic sizes"); | |
147 | } | |
3202e249 | 148 | |
db137867 AC |
149 | if(elemsize < sizeof(rb_dlink_node)) |
150 | rb_bh_fail("Attempt to rb_bh_create smaller than sizeof(rb_dlink_node)"); | |
3202e249 | 151 | |
db137867 AC |
152 | /* Allocate our new rb_bh */ |
153 | bh = rb_malloc(sizeof(rb_bh)); | |
db137867 AC |
154 | bh->elemSize = elemsize; |
155 | bh->elemsPerBlock = elemsperblock; | |
156 | if(desc != NULL) | |
157 | bh->desc = rb_strdup(desc); | |
158 | ||
db137867 AC |
159 | if(bh == NULL) |
160 | { | |
161 | rb_bh_fail("bh == NULL when it shouldn't be"); | |
162 | } | |
163 | rb_dlinkAdd(bh, &bh->hlist, heap_lists); | |
164 | return (bh); | |
165 | } | |
166 | ||
167 | /* ************************************************************************ */ | |
168 | /* FUNCTION DOCUMENTATION: */ | |
169 | /* rb_bh_alloc */ | |
170 | /* Description: */ | |
171 | /* Returns a pointer to a struct within our rb_bh that's free for */ | |
172 | /* the taking. */ | |
173 | /* Parameters: */ | |
174 | /* bh (IN): Pointer to the Blockheap. */ | |
175 | /* Returns: */ | |
176 | /* Pointer to a structure (void *), or NULL if unsuccessful. */ | |
177 | /* ************************************************************************ */ | |
178 | ||
179 | void * | |
3202e249 | 180 | rb_bh_alloc(rb_bh *bh) |
db137867 | 181 | { |
db137867 | 182 | lrb_assert(bh != NULL); |
c2ac22cc | 183 | if(rb_unlikely(bh == NULL)) |
db137867 AC |
184 | { |
185 | rb_bh_fail("Cannot allocate if bh == NULL"); | |
186 | } | |
187 | ||
3202e249 | 188 | return (rb_malloc(bh->elemSize)); |
db137867 AC |
189 | } |
190 | ||
191 | ||
192 | /* ************************************************************************ */ | |
193 | /* FUNCTION DOCUMENTATION: */ | |
194 | /* rb_bh_free */ | |
195 | /* Description: */ | |
196 | /* Returns an element to the free pool, does not free() */ | |
197 | /* Parameters: */ | |
198 | /* bh (IN): Pointer to rb_bh containing element */ | |
199 | /* ptr (in): Pointer to element to be "freed" */ | |
200 | /* Returns: */ | |
201 | /* 0 if successful, 1 if element not contained within rb_bh. */ | |
202 | /* ************************************************************************ */ | |
203 | int | |
3202e249 | 204 | rb_bh_free(rb_bh *bh, void *ptr) |
db137867 | 205 | { |
db137867 AC |
206 | lrb_assert(bh != NULL); |
207 | lrb_assert(ptr != NULL); | |
208 | ||
c2ac22cc | 209 | if(rb_unlikely(bh == NULL)) |
db137867 | 210 | { |
c2ac22cc | 211 | rb_lib_log("balloc.c:rb_bhFree() bh == NULL"); |
db137867 AC |
212 | return (1); |
213 | } | |
214 | ||
c2ac22cc | 215 | if(rb_unlikely(ptr == NULL)) |
db137867 | 216 | { |
c2ac22cc | 217 | rb_lib_log("balloc.rb_bhFree() ptr == NULL"); |
db137867 AC |
218 | return (1); |
219 | } | |
220 | ||
db137867 | 221 | rb_free(ptr); |
db137867 AC |
222 | return (0); |
223 | } | |
224 | ||
225 | ||
226 | /* ************************************************************************ */ | |
227 | /* FUNCTION DOCUMENTATION: */ | |
228 | /* rb_bhDestroy */ | |
229 | /* Description: */ | |
230 | /* Completely free()s a rb_bh. Use for cleanup. */ | |
231 | /* Parameters: */ | |
232 | /* bh (IN): Pointer to the rb_bh to be destroyed. */ | |
233 | /* Returns: */ | |
234 | /* 0 if successful, 1 if bh == NULL */ | |
235 | /* ************************************************************************ */ | |
236 | int | |
3202e249 | 237 | rb_bh_destroy(rb_bh *bh) |
db137867 | 238 | { |
db137867 AC |
239 | if(bh == NULL) |
240 | return (1); | |
241 | ||
db137867 AC |
242 | rb_dlinkDelete(&bh->hlist, heap_lists); |
243 | rb_free(bh->desc); | |
244 | rb_free(bh); | |
245 | ||
246 | return (0); | |
247 | } | |
248 | ||
249 | void | |
3202e249 | 250 | rb_bh_usage(rb_bh *bh, size_t *bused, size_t *bfree, size_t *bmemusage, const char **desc) |
db137867 | 251 | { |
74178a38 JT |
252 | if(bused != NULL) |
253 | *bused = 0; | |
254 | if(bfree != NULL) | |
255 | *bfree = 0; | |
256 | if(bmemusage != NULL) | |
257 | *bmemusage = 0; | |
258 | if(desc != NULL) | |
259 | *desc = "no blockheap"; | |
db137867 AC |
260 | } |
261 | ||
3202e249 VY |
262 | void |
263 | rb_bh_usage_all(rb_bh_usage_cb *cb, void *data) | |
db137867 AC |
264 | { |
265 | rb_dlink_node *ptr; | |
266 | rb_bh *bh; | |
267 | size_t used, freem, memusage, heapalloc; | |
268 | static const char *unnamed = "(unnamed_heap)"; | |
269 | const char *desc = unnamed; | |
270 | ||
271 | if(cb == NULL) | |
272 | return; | |
273 | ||
274 | RB_DLINK_FOREACH(ptr, heap_lists->head) | |
275 | { | |
3202e249 | 276 | bh = (rb_bh *)ptr->data; |
db137867 AC |
277 | freem = rb_dlink_list_length(&bh->free_list); |
278 | used = (rb_dlink_list_length(&bh->block_list) * bh->elemsPerBlock) - freem; | |
ce1c921c VY |
279 | memusage = used * bh->elemSize; |
280 | heapalloc = (freem + used) * bh->elemSize; | |
db137867 AC |
281 | if(bh->desc != NULL) |
282 | desc = bh->desc; | |
3202e249 | 283 | cb(used, freem, memusage, heapalloc, desc, data); |
db137867 AC |
284 | } |
285 | return; | |
286 | } | |
287 | ||
288 | void | |
289 | rb_bh_total_usage(size_t *total_alloc, size_t *total_used) | |
290 | { | |
291 | rb_dlink_node *ptr; | |
292 | size_t total_memory = 0, used_memory = 0, used, freem; | |
293 | rb_bh *bh; | |
3202e249 | 294 | |
db137867 AC |
295 | RB_DLINK_FOREACH(ptr, heap_lists->head) |
296 | { | |
297 | bh = (rb_bh *)ptr->data; | |
298 | freem = rb_dlink_list_length(&bh->free_list); | |
299 | used = (rb_dlink_list_length(&bh->block_list) * bh->elemsPerBlock) - freem; | |
ce1c921c VY |
300 | used_memory += used * bh->elemSize; |
301 | total_memory += (freem + used) * bh->elemSize; | |
db137867 | 302 | } |
3202e249 | 303 | |
db137867 AC |
304 | if(total_alloc != NULL) |
305 | *total_alloc = total_memory; | |
306 | if(total_used != NULL) | |
307 | *total_used = used_memory; | |
308 | } |