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-2009 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);
26 static void print_slheap(int level, void *ctx);
35 struct slab_heap *sh = data;
36 int pad = 2*sizeof(int)-1, pad_shift;
37 int order_start = -1, i;
38 struct slab_object *so;
41 ber_memfree_x(sh->sh_base, NULL);
42 ber_memfree_x(sh, NULL);
47 } while (pad_shift >>= 1);
49 for (i = 0; i <= sh->sh_maxorder - order_start; i++) {
50 so = LDAP_LIST_FIRST(&sh->sh_free[i]);
52 struct slab_object *so_tmp = so;
53 so = LDAP_LIST_NEXT(so, so_link);
54 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_tmp, so_link);
56 ch_free(sh->sh_map[i]);
61 so = LDAP_LIST_FIRST(&sh->sh_sopool);
63 struct slab_object *so_tmp = so;
64 so = LDAP_LIST_NEXT(so, so_link);
65 if (!so_tmp->so_blockhead) {
66 LDAP_LIST_REMOVE(so_tmp, so_link);
69 so = LDAP_LIST_FIRST(&sh->sh_sopool);
71 struct slab_object *so_tmp = so;
72 so = LDAP_LIST_NEXT(so, so_link);
75 ber_memfree_x(sh->sh_base, NULL);
76 ber_memfree_x(sh, NULL);
80 BerMemoryFunctions slap_sl_mfuncs =
81 { slap_sl_malloc, slap_sl_calloc, slap_sl_realloc, slap_sl_free };
86 ber_set_option( NULL, LBER_OPT_MEMORY_FNS, &slap_sl_mfuncs );
90 static struct slab_heap *slheap;
101 struct slab_heap *sh;
102 ber_len_t size_shift;
103 int pad = 2*sizeof(int)-1, pad_shift;
104 int order = -1, order_start = -1, order_end = -1;
106 struct slab_object *so;
112 ldap_pvt_thread_pool_getkey(
113 ctx, (void *)slap_sl_mem_init, &sh_tmp, NULL );
120 /* round up to doubleword boundary */
126 sh = ch_malloc(sizeof(struct slab_heap));
127 sh->sh_base = ch_malloc(size);
131 ldap_pvt_thread_pool_setkey(ctx, (void *)slap_sl_mem_init,
132 (void *)sh, slap_sl_mem_destroy, NULL, NULL);
134 } else if ( size > (char *)sh->sh_end - (char *)sh->sh_base ) {
137 newptr = ch_realloc( sh->sh_base, size );
138 if ( newptr == NULL ) return NULL;
139 sh->sh_base = newptr;
141 sh->sh_last = sh->sh_base;
142 sh->sh_end = (char *) sh->sh_base + size;
143 sh->sh_stack = stack;
146 size_shift = size - 1;
149 } while (size_shift >>= 1);
154 } while (pad_shift >>= 1);
156 order = order_end - order_start + 1;
159 sh = (struct slab_heap *) ch_malloc(sizeof(struct slab_heap));
160 sh->sh_base = ch_malloc(size);
164 ldap_pvt_thread_pool_setkey(ctx, (void *)slap_sl_mem_init,
165 (void *)sh, slap_sl_mem_destroy, NULL, NULL);
168 for (i = 0; i <= sh->sh_maxorder - order_start; i++) {
169 so = LDAP_LIST_FIRST(&sh->sh_free[i]);
171 struct slab_object *so_tmp = so;
172 so = LDAP_LIST_NEXT(so, so_link);
173 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_tmp, so_link);
175 ch_free(sh->sh_map[i]);
177 ch_free(sh->sh_free);
180 so = LDAP_LIST_FIRST(&sh->sh_sopool);
182 struct slab_object *so_tmp = so;
183 so = LDAP_LIST_NEXT(so, so_link);
184 if (!so_tmp->so_blockhead) {
185 LDAP_LIST_REMOVE(so_tmp, so_link);
188 so = LDAP_LIST_FIRST(&sh->sh_sopool);
190 struct slab_object *so_tmp = so;
191 so = LDAP_LIST_NEXT(so, so_link);
195 if (size > (char *)sh->sh_end - (char *)sh->sh_base) {
198 newptr = ch_realloc( sh->sh_base, size );
199 if ( newptr == NULL ) return NULL;
200 sh->sh_base = newptr;
203 sh->sh_end = (char *)sh->sh_base + size;
204 sh->sh_maxorder = order_end;
206 sh->sh_free = (struct sh_freelist *)
207 ch_malloc(order * sizeof(struct sh_freelist));
208 for (i = 0; i < order; i++) {
209 LDAP_LIST_INIT(&sh->sh_free[i]);
212 LDAP_LIST_INIT(&sh->sh_sopool);
214 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
215 slap_replenish_sopool(sh);
217 so = LDAP_LIST_FIRST(&sh->sh_sopool);
218 LDAP_LIST_REMOVE(so, so_link);
219 so->so_ptr = sh->sh_base;
221 LDAP_LIST_INSERT_HEAD(&sh->sh_free[order-1], so, so_link);
223 sh->sh_map = (unsigned char **)
224 ch_malloc(order * sizeof(unsigned char *));
225 for (i = 0; i < order; i++) {
226 int shiftamt = order_start + 1 + i;
227 int nummaps = size >> shiftamt;
230 if (!nummaps) nummaps = 1;
231 sh->sh_map[i] = (unsigned char *) ch_malloc(nummaps);
232 memset(sh->sh_map[i], 0, nummaps);
234 sh->sh_stack = stack;
248 /* separate from context */
249 ldap_pvt_thread_pool_setkey( ctx, (void *)slap_sl_mem_init,
250 NULL, 0, NULL, NULL );
260 struct slab_heap *sh = ctx;
261 ber_len_t size_shift;
262 int pad = 2*sizeof(int)-1, pad_shift;
263 int order = -1, order_start = -1;
264 struct slab_object *so_new, *so_left, *so_right;
265 ber_len_t *ptr, *newptr;
269 #ifdef SLAP_NO_SL_MALLOC
270 newptr = ber_memalloc_x( size, NULL );
271 if ( newptr ) return newptr;
273 exit( EXIT_FAILURE );
276 /* ber_set_option calls us like this */
278 newptr = ber_memalloc_x( size, NULL );
279 if ( newptr ) return newptr;
281 exit( EXIT_FAILURE );
284 /* round up to doubleword boundary */
285 size += sizeof(ber_len_t) + pad;
289 if ((char *)sh->sh_last + size >= (char *)sh->sh_end) {
290 Debug(LDAP_DEBUG_TRACE,
291 "slap_sl_malloc of %lu bytes failed, using ch_malloc\n",
293 return ch_malloc(size);
295 newptr = sh->sh_last;
296 *newptr++ = size - sizeof(ber_len_t);
297 sh->sh_last = (char *) sh->sh_last + size;
298 return( (void *)newptr );
300 size_shift = size - 1;
303 } while (size_shift >>= 1);
308 } while (pad_shift >>= 1);
310 for (i = order; i <= sh->sh_maxorder &&
311 LDAP_LIST_EMPTY(&sh->sh_free[i-order_start]); i++);
314 so_new = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
315 LDAP_LIST_REMOVE(so_new, so_link);
316 ptr = so_new->so_ptr;
317 diff = (unsigned long)((char*)ptr -
318 (char*)sh->sh_base) >> (order + 1);
319 sh->sh_map[order-order_start][diff>>3] |= (1 << (diff & 0x7));
320 *ptr++ = size - sizeof(ber_len_t);
321 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_new, so_link);
323 } else if (i <= sh->sh_maxorder) {
324 for (j = i; j > order; j--) {
325 so_left = LDAP_LIST_FIRST(&sh->sh_free[j-order_start]);
326 LDAP_LIST_REMOVE(so_left, so_link);
327 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
328 slap_replenish_sopool(sh);
330 so_right = LDAP_LIST_FIRST(&sh->sh_sopool);
331 LDAP_LIST_REMOVE(so_right, so_link);
332 so_right->so_ptr = (void *)((char *)so_left->so_ptr + (1 << j));
333 if (j == order + 1) {
334 ptr = so_left->so_ptr;
335 diff = (unsigned long)((char*)ptr -
336 (char*)sh->sh_base) >> (order+1);
337 sh->sh_map[order-order_start][diff>>3] |=
339 *ptr++ = size - sizeof(ber_len_t);
340 LDAP_LIST_INSERT_HEAD(
341 &sh->sh_free[j-1-order_start], so_right, so_link);
342 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_left, so_link);
345 LDAP_LIST_INSERT_HEAD(
346 &sh->sh_free[j-1-order_start], so_right, so_link);
347 LDAP_LIST_INSERT_HEAD(
348 &sh->sh_free[j-1-order_start], so_left, so_link);
352 Debug( LDAP_DEBUG_TRACE,
353 "slap_sl_malloc of %lu bytes failed, using ch_malloc\n",
355 return (void*)ch_malloc(size);
359 /* FIXME: missing return; guessing... */
364 slap_sl_calloc( ber_len_t n, ber_len_t size, void *ctx )
368 newptr = slap_sl_malloc( n*size, ctx );
370 memset( newptr, 0, n*size );
376 slap_sl_realloc(void *ptr, ber_len_t size, void *ctx)
378 struct slab_heap *sh = ctx;
379 int pad = 2*sizeof(int) -1;
380 ber_len_t *p = (ber_len_t *)ptr, *newptr;
383 return slap_sl_malloc(size, ctx);
385 #ifdef SLAP_NO_SL_MALLOC
386 newptr = ber_memrealloc_x( ptr, size, NULL );
387 if ( newptr ) return newptr;
389 exit( EXIT_FAILURE );
392 /* Not our memory? */
393 if (!sh || ptr < sh->sh_base || ptr >= sh->sh_end) {
394 /* duplicate of realloc behavior, oh well */
395 newptr = ber_memrealloc_x(ptr, size, NULL);
399 Debug(LDAP_DEBUG_ANY, "ch_realloc of %lu bytes failed\n",
402 exit( EXIT_FAILURE );
406 slap_sl_free(ptr, ctx);
411 /* round up to doubleword boundary */
412 size += pad + sizeof( ber_len_t );
415 /* Never shrink blocks */
419 /* If reallocing the last block, we can grow it */
420 } else if ((char *)ptr + p[-1] == sh->sh_last &&
421 (char *)ptr + size < (char *)sh->sh_end ) {
423 sh->sh_last = (char *)sh->sh_last + size - p[-1];
426 /* Nowhere to grow, need to alloc and copy */
428 newptr = slap_sl_malloc(size, ctx);
429 AC_MEMCPY(newptr, ptr, p[-1]);
435 newptr2 = slap_sl_malloc(size, ctx);
437 AC_MEMCPY(newptr2, ptr, size);
439 AC_MEMCPY(newptr2, ptr, p[-1]);
441 slap_sl_free(ptr, ctx);
447 slap_sl_free(void *ptr, void *ctx)
449 struct slab_heap *sh = ctx;
450 int size, size_shift, order_size;
451 int pad = 2*sizeof(int)-1, pad_shift;
452 ber_len_t *p = (ber_len_t *)ptr, *tmpp;
453 int order_start = -1, order = -1;
454 struct slab_object *so;
461 #ifdef SLAP_NO_SL_MALLOC
462 ber_memfree_x( ptr, NULL );
466 if (!sh || ptr < sh->sh_base || ptr >= sh->sh_end) {
467 ber_memfree_x(ptr, NULL);
468 } else if (sh->sh_stack && (char *)ptr + p[-1] == sh->sh_last) {
471 } else if (!sh->sh_stack) {
473 size_shift = size + sizeof(ber_len_t) - 1;
476 } while (size_shift >>= 1);
481 } while (pad_shift >>= 1);
483 for (i = order, tmpp = p; i <= sh->sh_maxorder; i++) {
484 order_size = 1 << (i+1);
485 diff = (unsigned long)((char*)tmpp - (char*)sh->sh_base) >> (i+1);
486 sh->sh_map[i-order_start][diff>>3] &= (~(1 << (diff & 0x7)));
487 if (diff == ((diff>>1)<<1)) {
488 if (!(sh->sh_map[i-order_start][(diff+1)>>3] &
489 (1<<((diff+1)&0x7)))) {
490 so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
492 if ((char*)so->so_ptr == (char*)tmpp) {
493 LDAP_LIST_REMOVE( so, so_link );
494 } else if ((char*)so->so_ptr ==
495 (char*)tmpp + order_size) {
496 LDAP_LIST_REMOVE(so, so_link);
499 so = LDAP_LIST_NEXT(so, so_link);
502 if (i < sh->sh_maxorder) {
505 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start+1],
510 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
511 slap_replenish_sopool(sh);
513 so = LDAP_LIST_FIRST(&sh->sh_sopool);
514 LDAP_LIST_REMOVE(so, so_link);
516 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
520 Debug(LDAP_DEBUG_TRACE, "slap_sl_free: "
521 "free object not found while bit is clear.\n",
528 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
529 slap_replenish_sopool(sh);
531 so = LDAP_LIST_FIRST(&sh->sh_sopool);
532 LDAP_LIST_REMOVE(so, so_link);
534 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
540 if (!(sh->sh_map[i-order_start][(diff-1)>>3] &
541 (1<<((diff-1)&0x7)))) {
542 so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
544 if ((char*)so->so_ptr == (char*)tmpp) {
545 LDAP_LIST_REMOVE(so, so_link);
546 } else if ((char*)tmpp == (char *)so->so_ptr + order_size) {
547 LDAP_LIST_REMOVE(so, so_link);
551 so = LDAP_LIST_NEXT(so, so_link);
554 if (i < sh->sh_maxorder) {
556 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start+1], so, so_link);
560 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
561 slap_replenish_sopool(sh);
563 so = LDAP_LIST_FIRST(&sh->sh_sopool);
564 LDAP_LIST_REMOVE(so, so_link);
566 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
570 Debug(LDAP_DEBUG_TRACE, "slap_sl_free: "
571 "free object not found while bit is clear.\n",
578 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
579 slap_replenish_sopool(sh);
581 so = LDAP_LIST_FIRST(&sh->sh_sopool);
582 LDAP_LIST_REMOVE(so, so_link);
584 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
595 slap_sl_context( void *ptr )
597 struct slab_heap *sh;
600 if ( slapMode & SLAP_TOOL_MODE ) return NULL;
605 ctx = ldap_pvt_thread_pool_context();
608 ldap_pvt_thread_pool_getkey(
609 ctx, (void *)slap_sl_mem_init, &sh_tmp, NULL);
613 if (sh && ptr >= sh->sh_base && ptr <= sh->sh_end) {
619 static struct slab_object *
620 slap_replenish_sopool(
624 struct slab_object *so_block;
627 so_block = (struct slab_object *)ch_malloc(
628 SLAP_SLAB_SOBLOCK * sizeof(struct slab_object));
630 if ( so_block == NULL ) {
634 so_block[0].so_blockhead = 1;
635 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, &so_block[0], so_link);
636 for (i = 1; i < SLAP_SLAB_SOBLOCK; i++) {
637 so_block[i].so_blockhead = 0;
638 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, &so_block[i], so_link );
646 print_slheap(int level, void *ctx)
648 struct slab_heap *sh = ctx;
649 int order_start = -1;
650 int pad = 2*sizeof(int)-1, pad_shift;
651 struct slab_object *so;
655 Debug(level, "NULL memctx\n", 0, 0, 0);
662 } while (pad_shift >>= 1);
664 Debug(level, "sh->sh_maxorder=%d\n", sh->sh_maxorder, 0, 0);
666 for (i = order_start; i <= sh->sh_maxorder; i++) {
668 Debug(level, "order=%d\n", i, 0, 0);
669 for (j = 0; j < (1<<(sh->sh_maxorder-i))/8; j++) {
670 Debug(level, "%02x ", sh->sh_map[i-order_start][j], 0, 0);
674 Debug(level, "%02x ", sh->sh_map[i-order_start][0], 0, 0);
676 Debug(level, "\n", 0, 0, 0);
677 Debug(level, "free list:\n", 0, 0, 0);
678 so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
680 Debug(level, "%lx\n", (unsigned long) so->so_ptr, 0, 0);
681 so = LDAP_LIST_NEXT(so, so_link);