2 * ircd-ratbox: A slightly useful ircd.
3 * balloc.c: A block allocator.
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
9 * Below are the orignal headers from the old blalloc.c
12 * Owner: Wohali (Joan Touzet)
14 * Modified 2001/11/29 for mmap() support by Aaron Sethman <androsyn@ratbox.org>
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.
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.
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
31 * $Id: balloc.c 25861 2008-08-06 19:51:44Z androsyn $
35 * About the block allocator
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.
40 * 1. mmap() anonymous pages with the MMAP_ANON flag.
41 * 2. mmap() via the /dev/zero trick.
42 * 3. HeapCreate/HeapAlloc (on win32)
45 * The advantages of 1 and 2 are this. We can munmap() the pages which will
46 * return the pages back to the operating system, thus reducing the size
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.
59 #include <libratbox_config.h>
60 #include <ratbox_lib.h>
62 #ifdef HAVE_MMAP /* We've got mmap() that is good */
67 #define MAP_ANON MAP_ANONYMOUS
72 static uintptr_t offset_pad
;
74 /* status information for an allocated block in heap */
79 unsigned long free_count
;
80 void *elems
; /* Points to allocated memory */
82 typedef struct rb_heap_block rb_heap_block
;
84 /* information for the root node of the heap */
88 size_t elemSize
; /* Size of each element to be stored */
89 unsigned long elemsPerBlock
; /* Number of elements per block */
90 rb_dlink_list block_list
;
91 rb_dlink_list free_list
;
96 static int newblock(rb_bh
* bh
);
97 static void rb_bh_gc_event(void *unused
);
98 #endif /* !NOBALLOC */
99 static rb_dlink_list
*heap_lists
;
102 static HANDLE block_heap
;
105 #define rb_bh_fail(x) _rb_bh_fail(x, __FILE__, __LINE__)
108 _rb_bh_fail(const char *reason
, const char *file
, int line
)
110 rb_lib_log("rb_heap_blockheap failure: %s (%s:%d)", reason
, file
, line
);
116 * static inline void free_block(void *ptr, size_t size)
118 * Inputs: The block and its size
120 * Side Effects: Returns memory for the block back to the OS
123 free_block(void *ptr
, size_t size
)
129 HeapFree(block_heap
, 0, ptr
);
135 #endif /* !NOBALLOC */
138 * void rb_init_bh(void)
142 * Side Effects: Initializes the block heap
148 heap_lists
= rb_malloc(sizeof(rb_dlink_list
));
149 offset_pad
= sizeof(void *);
150 /* XXX if you get SIGBUS when trying to use a long long..here is where you need to
154 if((offset_pad
% __alignof__(long long)) != 0)
156 offset_pad
+= __alignof__(long long);
157 offset_pad
&= ~(__alignof__(long long) - 1);
163 block_heap
= HeapCreate(HEAP_NO_SERIALIZE
, 0, 0);
165 rb_event_addish("rb_bh_gc_event", rb_bh_gc_event
, NULL
, 300);
166 #endif /* !NOBALLOC */
171 * static inline void *get_block(size_t size)
173 * Input: Size of block to allocate
174 * Output: Pointer to new block
178 get_block(size_t size
)
183 ptr
= mmap(NULL
, size
, PROT_READ
| PROT_WRITE
, MAP_PRIVATE
| MAP_ANON
, -1, 0);
186 zero_fd
= open("/dev/zero", O_RDWR
);
188 rb_bh_fail("Failed opening /dev/zero");
189 ptr
= mmap(NULL
, size
, PROT_READ
| PROT_WRITE
, MAP_PRIVATE
, zero_fd
, 0);
191 #endif /* MAP_ANON */
192 if(ptr
== MAP_FAILED
)
196 ptr
= HeapAlloc(block_heap
, 0, size
);
206 rb_bh_gc_event(void *unused
)
209 RB_DLINK_FOREACH(ptr
, heap_lists
->head
)
215 /* ************************************************************************ */
216 /* FUNCTION DOCUMENTATION: */
219 /* Allocates a new block for addition to a blockheap */
221 /* bh (IN): Pointer to parent blockheap. */
223 /* 0 if successful, 1 if not */
224 /* ************************************************************************ */
233 /* Setup the initial data structure. */
234 b
= rb_malloc(sizeof(rb_heap_block
));
236 b
->alloc_size
= bh
->elemsPerBlock
* bh
->elemSize
;
238 b
->elems
= get_block(b
->alloc_size
);
239 if(rb_unlikely(b
->elems
== NULL
))
243 offset
= (uintptr_t)b
->elems
;
244 /* Setup our blocks now */
245 for (i
= 0; i
< bh
->elemsPerBlock
; i
++, offset
+= bh
->elemSize
)
247 *((void **)offset
) = b
;
248 node
= (void *)(offset
+ offset_pad
);
249 rb_dlinkAdd((void *)offset
, node
, &bh
->free_list
);
251 rb_dlinkAdd(b
, &b
->node
, &bh
->block_list
);
252 b
->free_count
= bh
->elemsPerBlock
;
255 #endif /* !NOBALLOC */
257 /* ************************************************************************ */
258 /* FUNCTION DOCUMENTATION: */
261 /* Creates a new blockheap from which smaller blocks can be allocated. */
262 /* Intended to be used instead of multiple calls to malloc() when */
263 /* performance is an issue. */
265 /* elemsize (IN): Size of the basic element to be stored */
266 /* elemsperblock (IN): Number of elements to be stored in a single block */
267 /* of memory. When the blockheap runs out of free memory, it will */
268 /* allocate elemsize * elemsperblock more. */
270 /* Pointer to new rb_bh, or NULL if unsuccessful */
271 /* ************************************************************************ */
273 rb_bh_create(size_t elemsize
, int elemsperblock
, const char *desc
)
276 lrb_assert(elemsize
> 0 && elemsperblock
> 0);
277 lrb_assert(elemsize
>= sizeof(rb_dlink_node
));
279 /* Catch idiotic requests up front */
280 if((elemsize
== 0) || (elemsperblock
<= 0))
282 rb_bh_fail("Attempting to rb_bh_create idiotic sizes");
285 if(elemsize
< sizeof(rb_dlink_node
))
286 rb_bh_fail("Attempt to rb_bh_create smaller than sizeof(rb_dlink_node)");
288 /* Allocate our new rb_bh */
289 bh
= rb_malloc(sizeof(rb_bh
));
291 elemsize
+= offset_pad
;
292 if((elemsize
% sizeof(void *)) != 0)
294 /* Pad to even pointer boundary */
295 elemsize
+= sizeof(void *);
296 elemsize
&= ~(sizeof(void *) - 1);
300 bh
->elemSize
= elemsize
;
301 bh
->elemsPerBlock
= elemsperblock
;
303 bh
->desc
= rb_strdup(desc
);
306 /* Be sure our malloc was successful */
311 rb_lib_log("newblock() failed");
312 rb_outofmemory(); /* die.. out of memory */
314 #endif /* !NOBALLOC */
318 rb_bh_fail("bh == NULL when it shouldn't be");
320 rb_dlinkAdd(bh
, &bh
->hlist
, heap_lists
);
324 /* ************************************************************************ */
325 /* FUNCTION DOCUMENTATION: */
328 /* Returns a pointer to a struct within our rb_bh that's free for */
331 /* bh (IN): Pointer to the Blockheap. */
333 /* Pointer to a structure (void *), or NULL if unsuccessful. */
334 /* ************************************************************************ */
337 rb_bh_alloc(rb_bh
* bh
)
340 rb_dlink_node
*new_node
;
341 rb_heap_block
*block
;
344 lrb_assert(bh
!= NULL
);
345 if(rb_unlikely(bh
== NULL
))
347 rb_bh_fail("Cannot allocate if bh == NULL");
351 return(rb_malloc(bh
->elemSize
));
353 if(bh
->free_list
.head
== NULL
)
355 /* Allocate new block and assign */
356 /* newblock returns 1 if unsuccessful, 0 if not */
358 if(rb_unlikely(newblock(bh
)))
360 rb_lib_log("newblock() failed");
361 rb_outofmemory(); /* Well that didn't work either...bail */
363 if(bh
->free_list
.head
== NULL
)
365 rb_lib_log("out of memory after newblock()...");
370 new_node
= bh
->free_list
.head
;
371 block
= new_node
->data
;
372 ptr
= new_node
->data
+ offset_pad
;
373 rb_dlinkDelete(new_node
, &bh
->free_list
);
374 memset(ptr
, 0, bh
->elemSize
- offset_pad
);
380 /* ************************************************************************ */
381 /* FUNCTION DOCUMENTATION: */
384 /* Returns an element to the free pool, does not free() */
386 /* bh (IN): Pointer to rb_bh containing element */
387 /* ptr (in): Pointer to element to be "freed" */
389 /* 0 if successful, 1 if element not contained within rb_bh. */
390 /* ************************************************************************ */
392 rb_bh_free(rb_bh
* bh
, void *ptr
)
395 rb_heap_block
*block
;
398 lrb_assert(bh
!= NULL
);
399 lrb_assert(ptr
!= NULL
);
401 if(rb_unlikely(bh
== NULL
))
403 rb_lib_log("balloc.c:rb_bhFree() bh == NULL");
407 if(rb_unlikely(ptr
== NULL
))
409 rb_lib_log("balloc.rb_bhFree() ptr == NULL");
416 data
= (void *)(ptr
- offset_pad
);
417 block
= *(rb_heap_block
**)data
;
419 if(rb_unlikely(!((uintptr_t)ptr
>= (uintptr_t)block
->elems
&& (uintptr_t)ptr
< (uintptr_t)block
->elems
+ (uintptr_t)block
->alloc_size
)))
421 rb_bh_fail("rb_bh_free() bogus pointer");
424 rb_dlinkAdd(data
, (rb_dlink_node
*)ptr
, &bh
->free_list
);
425 #endif /* !NOBALLOC */
430 /* ************************************************************************ */
431 /* FUNCTION DOCUMENTATION: */
434 /* Completely free()s a rb_bh. Use for cleanup. */
436 /* bh (IN): Pointer to the rb_bh to be destroyed. */
438 /* 0 if successful, 1 if bh == NULL */
439 /* ************************************************************************ */
441 rb_bh_destroy(rb_bh
* bh
)
444 rb_dlink_node
*ptr
, *next
;
451 RB_DLINK_FOREACH_SAFE(ptr
, next
, bh
->block_list
.head
)
454 free_block(b
->elems
, b
->alloc_size
);
457 #endif /* !NOBALLOC */
459 rb_dlinkDelete(&bh
->hlist
, heap_lists
);
467 rb_bh_usage(rb_bh
* bh
, size_t * bused
, size_t * bfree
, size_t * bmemusage
, const char **desc
)
469 size_t used
, freem
, memusage
;
476 freem
= rb_dlink_list_length(&bh
->free_list
);
477 used
= (rb_dlink_list_length(&bh
->block_list
) * bh
->elemsPerBlock
) - freem
;
478 memusage
= used
* bh
->elemSize
;
483 if(bmemusage
!= NULL
)
484 *bmemusage
= memusage
;
489 void rb_bh_usage_all(rb_bh_usage_cb
*cb
, void *data
)
493 size_t used
, freem
, memusage
, heapalloc
;
494 static const char *unnamed
= "(unnamed_heap)";
495 const char *desc
= unnamed
;
500 RB_DLINK_FOREACH(ptr
, heap_lists
->head
)
502 bh
= (rb_bh
*)ptr
->data
;
503 freem
= rb_dlink_list_length(&bh
->free_list
);
504 used
= (rb_dlink_list_length(&bh
->block_list
) * bh
->elemsPerBlock
) - freem
;
505 memusage
= used
* bh
->elemSize
;
506 heapalloc
= (freem
+ used
) * bh
->elemSize
;
509 cb(used
, freem
, memusage
, heapalloc
, desc
, data
);
515 rb_bh_total_usage(size_t *total_alloc
, size_t *total_used
)
518 size_t total_memory
= 0, used_memory
= 0, used
, freem
;
521 RB_DLINK_FOREACH(ptr
, heap_lists
->head
)
523 bh
= (rb_bh
*)ptr
->data
;
524 freem
= rb_dlink_list_length(&bh
->free_list
);
525 used
= (rb_dlink_list_length(&bh
->block_list
) * bh
->elemsPerBlock
) - freem
;
526 used_memory
+= used
* bh
->elemSize
;
527 total_memory
+= (freem
+ used
) * bh
->elemSize
;
530 if(total_alloc
!= NULL
)
531 *total_alloc
= total_memory
;
532 if(total_used
!= NULL
)
533 *total_used
= used_memory
;
541 rb_dlink_node
*ptr
, *next
;
547 /* somebody is smoking some craq..(probably lee, but don't tell him that) */
551 if((rb_dlink_list_length(&bh
->free_list
) < bh
->elemsPerBlock
) || rb_dlink_list_length(&bh
->block_list
) == 1)
553 /* There couldn't possibly be an entire free block. Return. */
557 RB_DLINK_FOREACH_SAFE(ptr
, next
, bh
->block_list
.head
)
560 if(rb_dlink_list_length(&bh
->block_list
) == 1)
563 if(b
->free_count
== bh
->elemsPerBlock
)
565 /* i'm seriously going to hell for this.. */
567 offset
= (uintptr_t)b
->elems
;
568 for (i
= 0; i
< bh
->elemsPerBlock
; i
++, offset
+= (uintptr_t)bh
->elemSize
)
570 rb_dlinkDelete(((rb_dlink_node
*)offset
), &bh
->free_list
);
572 rb_dlinkDelete(&b
->node
, &bh
->block_list
);
573 free_block(b
->elems
, b
->alloc_size
);
580 #endif /* !NOBALLOC */