1 /* sl_malloc.c - malloc routines using a per-thread slab */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2003-2005 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
20 #include <ac/string.h>
24 static struct slab_object * slap_replenish_sopool(struct slab_heap* sh);
25 static void print_slheap(int level, void *ctx);
33 struct slab_heap *sh = data;
34 int pad = 2*sizeof(int)-1, pad_shift;
35 int order_start = -1, i;
36 struct slab_object *so;
39 ber_memfree_x(sh->sh_base, NULL);
40 ber_memfree_x(sh, NULL);
45 } while (pad_shift >>= 1);
47 for (i = 0; i <= sh->sh_maxorder - order_start; i++) {
48 so = LDAP_LIST_FIRST(&sh->sh_free[i]);
50 struct slab_object *so_tmp = so;
51 so = LDAP_LIST_NEXT(so, so_link);
52 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_tmp, so_link);
54 ch_free(sh->sh_map[i]);
59 so = LDAP_LIST_FIRST(&sh->sh_sopool);
61 struct slab_object *so_tmp = so;
62 so = LDAP_LIST_NEXT(so, so_link);
63 if (!so_tmp->so_blockhead) {
64 LDAP_LIST_REMOVE(so_tmp, so_link);
67 so = LDAP_LIST_FIRST(&sh->sh_sopool);
69 struct slab_object *so_tmp = so;
70 so = LDAP_LIST_NEXT(so, so_link);
73 ber_memfree_x(sh->sh_base, NULL);
74 ber_memfree_x(sh, NULL);
78 BerMemoryFunctions slap_sl_mfuncs =
79 { slap_sl_malloc, slap_sl_calloc, slap_sl_realloc, slap_sl_free };
84 ber_set_option( NULL, LBER_OPT_MEMORY_FNS, &slap_sl_mfuncs );
88 static struct slab_heap *slheap;
98 struct slab_heap *sh = NULL;
100 int pad = 2*sizeof(int)-1, pad_shift;
101 int order = -1, order_start = -1, order_end = -1;
103 struct slab_object *so;
108 ldap_pvt_thread_pool_getkey(
109 ctx, (void *)slap_sl_mem_init, (void **)&sh, NULL );
112 /* round up to doubleword boundary */
118 sh = ch_malloc(sizeof(struct slab_heap));
119 sh->sh_base = ch_malloc(size);
123 ldap_pvt_thread_pool_setkey(ctx, (void *)slap_sl_mem_init,
124 (void *)sh, slap_sl_mem_destroy);
126 } else if ( size > (char *)sh->sh_end - (char *)sh->sh_base ) {
127 sh->sh_base = ch_realloc(sh->sh_base, size);
129 sh->sh_last = sh->sh_base;
130 sh->sh_end = (char *) sh->sh_base + size;
131 sh->sh_stack = stack;
134 size_shift = size - 1;
137 } while (size_shift >>= 1);
142 } while (pad_shift >>= 1);
144 order = order_end - order_start + 1;
147 sh = (struct slab_heap *) ch_malloc(sizeof(struct slab_heap));
148 sh->sh_base = ch_malloc(size);
152 ldap_pvt_thread_pool_setkey(ctx, (void *)slap_sl_mem_init,
153 (void *)sh, slap_sl_mem_destroy);
156 for (i = 0; i <= sh->sh_maxorder - order_start; i++) {
157 so = LDAP_LIST_FIRST(&sh->sh_free[i]);
159 struct slab_object *so_tmp = so;
160 so = LDAP_LIST_NEXT(so, so_link);
161 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_tmp, so_link);
163 ch_free(sh->sh_map[i]);
165 ch_free(sh->sh_free);
168 so = LDAP_LIST_FIRST(&sh->sh_sopool);
170 struct slab_object *so_tmp = so;
171 so = LDAP_LIST_NEXT(so, so_link);
172 if (!so_tmp->so_blockhead) {
173 LDAP_LIST_REMOVE(so_tmp, so_link);
176 so = LDAP_LIST_FIRST(&sh->sh_sopool);
178 struct slab_object *so_tmp = so;
179 so = LDAP_LIST_NEXT(so, so_link);
183 if (size > (char *)sh->sh_end - (char *)sh->sh_base) {
184 sh->sh_base = realloc(sh->sh_base, size);
187 sh->sh_end = (char *)sh->sh_base + size;
188 sh->sh_maxorder = order_end;
190 sh->sh_free = (struct sh_freelist *)
191 ch_malloc(order * sizeof(struct sh_freelist));
192 for (i = 0; i < order; i++) {
193 LDAP_LIST_INIT(&sh->sh_free[i]);
196 LDAP_LIST_INIT(&sh->sh_sopool);
198 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
199 slap_replenish_sopool(sh);
201 so = LDAP_LIST_FIRST(&sh->sh_sopool);
202 LDAP_LIST_REMOVE(so, so_link);
203 so->so_ptr = sh->sh_base;
205 LDAP_LIST_INSERT_HEAD(&sh->sh_free[order-1], so, so_link);
207 sh->sh_map = (unsigned char **)
208 ch_malloc(order * sizeof(unsigned char *));
209 for (i = 0; i < order; i++) {
210 int shiftamt = order_start + 1 + i;
211 int nummaps = size >> shiftamt;
214 if (!nummaps) nummaps = 1;
215 sh->sh_map[i] = (unsigned char *) ch_malloc(nummaps);
216 memset(sh->sh_map[i], 0, nummaps);
218 sh->sh_stack = stack;
232 /* separate from context */
233 ldap_pvt_thread_pool_setkey( ctx, (void *)slap_sl_mem_init, NULL, NULL );
243 struct slab_heap *sh = ctx;
244 ber_len_t size_shift;
245 int pad = 2*sizeof(int)-1, pad_shift;
246 int order = -1, order_start = -1;
247 struct slab_object *so_new, *so_left, *so_right;
248 ber_len_t *ptr, *new;
252 /* ber_set_option calls us like this */
253 if (!ctx) return ber_memalloc_x(size, NULL);
255 /* round up to doubleword boundary */
256 size += sizeof(ber_len_t) + pad;
260 if ((char *)sh->sh_last + size >= (char *)sh->sh_end) {
261 Debug(LDAP_DEBUG_TRACE,
262 "slap_sl_malloc of %lu bytes failed, using ch_malloc\n",
264 return ch_malloc(size);
267 *new++ = size - sizeof(ber_len_t);
268 sh->sh_last = (char *) sh->sh_last + size;
269 return( (void *)new );
271 size_shift = size - 1;
274 } while (size_shift >>= 1);
279 } while (pad_shift >>= 1);
281 for (i = order; i <= sh->sh_maxorder &&
282 LDAP_LIST_EMPTY(&sh->sh_free[i-order_start]); i++);
285 so_new = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
286 LDAP_LIST_REMOVE(so_new, so_link);
287 ptr = so_new->so_ptr;
288 diff = (unsigned long)((char*)ptr -
289 (char*)sh->sh_base) >> (order + 1);
290 sh->sh_map[order-order_start][diff>>3] |= (1 << (diff & 0x7));
291 *ptr++ = size - sizeof(ber_len_t);
292 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_new, so_link);
294 } else if (i <= sh->sh_maxorder) {
295 for (j = i; j > order; j--) {
296 so_left = LDAP_LIST_FIRST(&sh->sh_free[j-order_start]);
297 LDAP_LIST_REMOVE(so_left, so_link);
298 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
299 slap_replenish_sopool(sh);
301 so_right = LDAP_LIST_FIRST(&sh->sh_sopool);
302 LDAP_LIST_REMOVE(so_right, so_link);
303 so_right->so_ptr = so_left->so_ptr + (1 << j);
304 if (j == order + 1) {
305 ptr = so_left->so_ptr;
306 diff = (unsigned long)((char*)ptr -
307 (char*)sh->sh_base) >> (order+1);
308 sh->sh_map[order-order_start][diff>>3] |=
310 *ptr++ = size - sizeof(ber_len_t);
311 LDAP_LIST_INSERT_HEAD(
312 &sh->sh_free[j-1-order_start], so_right, so_link);
313 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_left, so_link);
316 LDAP_LIST_INSERT_HEAD(
317 &sh->sh_free[j-1-order_start], so_right, so_link);
318 LDAP_LIST_INSERT_HEAD(
319 &sh->sh_free[j-1-order_start], so_left, so_link);
323 Debug( LDAP_DEBUG_TRACE,
324 "slap_sl_malloc of %lu bytes failed, using ch_malloc\n",
326 return (void*)ch_malloc(size);
332 slap_sl_calloc( ber_len_t n, ber_len_t size, void *ctx )
336 new = slap_sl_malloc( n*size, ctx );
338 memset( new, 0, n*size );
344 slap_sl_realloc(void *ptr, ber_len_t size, void *ctx)
346 struct slab_heap *sh = ctx;
348 int pad = 2*sizeof(int)-1, pad_shift;
349 int order_start = -1, order = -1;
350 struct slab_object *so;
351 ber_len_t *p = (ber_len_t *)ptr, *new;
355 return slap_sl_malloc(size, ctx);
357 /* Not our memory? */
358 if (!sh || ptr < sh->sh_base || ptr >= sh->sh_end) {
359 /* duplicate of realloc behavior, oh well */
360 new = ber_memrealloc_x(ptr, size, NULL);
364 Debug(LDAP_DEBUG_ANY, "ch_realloc of %lu bytes failed\n",
367 exit( EXIT_FAILURE );
371 slap_sl_free(ptr, ctx);
376 /* Never shrink blocks */
380 /* If reallocing the last block, we can grow it */
381 } else if ((char *)ptr + p[-1] == sh->sh_last &&
382 (char *)ptr + size < (char *)sh->sh_end ) {
384 sh->sh_last = (char *)sh->sh_last + size - p[-1];
387 /* Nowhere to grow, need to alloc and copy */
389 new = slap_sl_malloc(size, ctx);
390 AC_MEMCPY(new, ptr, p[-1]);
395 newptr = slap_sl_malloc(size, ctx);
397 AC_MEMCPY(newptr, ptr, size);
399 AC_MEMCPY(newptr, ptr, p[-1]);
401 slap_sl_free(ptr, ctx);
407 slap_sl_free(void *ptr, void *ctx)
409 struct slab_heap *sh = ctx;
410 int size, size_shift, order_size;
411 int pad = 2*sizeof(int)-1, pad_shift;
412 ber_len_t *p = (ber_len_t *)ptr, *tmpp;
413 int order_start = -1, order = -1;
414 struct slab_object *so;
416 int i, k, inserted = 0;
418 if (!sh || ptr < sh->sh_base || ptr >= sh->sh_end) {
419 ber_memfree_x(ptr, NULL);
420 } else if (sh->sh_stack && (char *)ptr + p[-1] == sh->sh_last) {
423 } else if (!sh->sh_stack) {
425 size_shift = size + sizeof(ber_len_t) - 1;
428 } while (size_shift >>= 1);
433 } while (pad_shift >>= 1);
435 for (i = order, tmpp = p; i <= sh->sh_maxorder; i++) {
436 order_size = 1 << (i+1);
437 diff = (unsigned long)((char*)tmpp - (char*)sh->sh_base) >> (i+1);
438 sh->sh_map[i-order_start][diff>>3] &= (~(1 << (diff & 0x7)));
439 if (diff == ((diff>>1)<<1)) {
440 if (!(sh->sh_map[i-order_start][(diff+1)>>3] &
441 (1<<((diff+1)&0x7)))) {
442 so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
444 if ((char*)so->so_ptr == (char*)tmpp) {
445 LDAP_LIST_REMOVE( so, so_link );
446 } else if ((char*)so->so_ptr ==
447 (char*)tmpp + order_size) {
448 LDAP_LIST_REMOVE(so, so_link);
451 so = LDAP_LIST_NEXT(so, so_link);
454 if (i < sh->sh_maxorder) {
457 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start+1],
462 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
463 slap_replenish_sopool(sh);
465 so = LDAP_LIST_FIRST(&sh->sh_sopool);
466 LDAP_LIST_REMOVE(so, so_link);
468 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
472 Debug(LDAP_DEBUG_TRACE, "slap_sl_free: "
473 "free object not found while bit is clear.\n",
480 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
481 slap_replenish_sopool(sh);
483 so = LDAP_LIST_FIRST(&sh->sh_sopool);
484 LDAP_LIST_REMOVE(so, so_link);
486 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
492 if (!(sh->sh_map[i-order_start][(diff-1)>>3] &
493 (1<<((diff-1)&0x7)))) {
494 so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
496 if ((char*)so->so_ptr == (char*)tmpp) {
497 LDAP_LIST_REMOVE(so, so_link);
498 } else if ((char*)tmpp == so->so_ptr + order_size) {
499 LDAP_LIST_REMOVE(so, so_link);
503 so = LDAP_LIST_NEXT(so, so_link);
506 if (i < sh->sh_maxorder) {
508 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start+1], so, so_link);
512 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
513 slap_replenish_sopool(sh);
515 so = LDAP_LIST_FIRST(&sh->sh_sopool);
516 LDAP_LIST_REMOVE(so, so_link);
518 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
522 Debug(LDAP_DEBUG_TRACE, "slap_sl_free: "
523 "free object not found while bit is clear.\n",
530 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
531 slap_replenish_sopool(sh);
533 so = LDAP_LIST_FIRST(&sh->sh_sopool);
534 LDAP_LIST_REMOVE(so, so_link);
536 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
547 slap_sl_context( void *ptr )
549 struct slab_heap *sh = NULL;
555 ctx = ldap_pvt_thread_pool_context();
557 ldap_pvt_thread_pool_getkey(ctx, (void *)slap_sl_mem_init,
561 if (sh && ptr >= sh->sh_base && ptr <= sh->sh_end) {
567 static struct slab_object *
568 slap_replenish_sopool(
572 struct slab_object *so_block;
575 so_block = (struct slab_object *)ch_malloc(
576 SLAP_SLAB_SOBLOCK * sizeof(struct slab_object));
578 if ( so_block == NULL ) {
582 so_block[0].so_blockhead = 1;
583 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, &so_block[0], so_link);
584 for (i = 1; i < SLAP_SLAB_SOBLOCK; i++) {
585 so_block[i].so_blockhead = 0;
586 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, &so_block[i], so_link );
593 print_slheap(int level, void *ctx)
595 struct slab_heap *sh = ctx;
596 int order_start = -1;
597 int pad = 2*sizeof(int)-1, pad_shift;
598 struct slab_object *so;
602 Debug(level, "NULL memctx\n", 0, 0, 0);
609 } while (pad_shift >>= 1);
611 Debug(level, "sh->sh_maxorder=%d\n", sh->sh_maxorder, 0, 0);
613 for (i = order_start; i <= sh->sh_maxorder; i++) {
615 Debug(level, "order=%d\n", i, 0, 0);
616 for (j = 0; j < (1<<(sh->sh_maxorder-i))/8; j++) {
617 Debug(level, "%02x ", sh->sh_map[i-order_start][j], 0, 0);
621 Debug(level, "%02x ", sh->sh_map[i-order_start][0], 0, 0);
623 Debug(level, "\n", 0, 0, 0);
624 Debug(level, "free list:\n", 0, 0, 0);
625 so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
627 Debug(level, "%x\n",so->so_ptr, 0, 0);
628 so = LDAP_LIST_NEXT(so, so_link);