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-2006 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;
100 struct slab_heap *sh;
101 ber_len_t size_shift;
102 int pad = 2*sizeof(int)-1, pad_shift;
103 int order = -1, order_start = -1, order_end = -1;
105 struct slab_object *so;
111 ldap_pvt_thread_pool_getkey(
112 ctx, (void *)slap_sl_mem_init, &sh_tmp, NULL );
116 /* round up to doubleword boundary */
122 sh = ch_malloc(sizeof(struct slab_heap));
123 sh->sh_base = ch_malloc(size);
127 ldap_pvt_thread_pool_setkey(ctx, (void *)slap_sl_mem_init,
128 (void *)sh, slap_sl_mem_destroy);
130 } else if ( size > (char *)sh->sh_end - (char *)sh->sh_base ) {
133 newptr = ch_realloc( sh->sh_base, size );
134 if ( newptr == NULL ) return NULL;
135 sh->sh_base = newptr;
137 sh->sh_last = sh->sh_base;
138 sh->sh_end = (char *) sh->sh_base + size;
139 sh->sh_stack = stack;
142 size_shift = size - 1;
145 } while (size_shift >>= 1);
150 } while (pad_shift >>= 1);
152 order = order_end - order_start + 1;
155 sh = (struct slab_heap *) ch_malloc(sizeof(struct slab_heap));
156 sh->sh_base = ch_malloc(size);
160 ldap_pvt_thread_pool_setkey(ctx, (void *)slap_sl_mem_init,
161 (void *)sh, slap_sl_mem_destroy);
164 for (i = 0; i <= sh->sh_maxorder - order_start; i++) {
165 so = LDAP_LIST_FIRST(&sh->sh_free[i]);
167 struct slab_object *so_tmp = so;
168 so = LDAP_LIST_NEXT(so, so_link);
169 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_tmp, so_link);
171 ch_free(sh->sh_map[i]);
173 ch_free(sh->sh_free);
176 so = LDAP_LIST_FIRST(&sh->sh_sopool);
178 struct slab_object *so_tmp = so;
179 so = LDAP_LIST_NEXT(so, so_link);
180 if (!so_tmp->so_blockhead) {
181 LDAP_LIST_REMOVE(so_tmp, so_link);
184 so = LDAP_LIST_FIRST(&sh->sh_sopool);
186 struct slab_object *so_tmp = so;
187 so = LDAP_LIST_NEXT(so, so_link);
191 if (size > (char *)sh->sh_end - (char *)sh->sh_base) {
194 newptr = realloc( sh->sh_base, size );
195 if ( newptr == NULL ) return NULL;
196 sh->sh_base = newptr;
199 sh->sh_end = (char *)sh->sh_base + size;
200 sh->sh_maxorder = order_end;
202 sh->sh_free = (struct sh_freelist *)
203 ch_malloc(order * sizeof(struct sh_freelist));
204 for (i = 0; i < order; i++) {
205 LDAP_LIST_INIT(&sh->sh_free[i]);
208 LDAP_LIST_INIT(&sh->sh_sopool);
210 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
211 slap_replenish_sopool(sh);
213 so = LDAP_LIST_FIRST(&sh->sh_sopool);
214 LDAP_LIST_REMOVE(so, so_link);
215 so->so_ptr = sh->sh_base;
217 LDAP_LIST_INSERT_HEAD(&sh->sh_free[order-1], so, so_link);
219 sh->sh_map = (unsigned char **)
220 ch_malloc(order * sizeof(unsigned char *));
221 for (i = 0; i < order; i++) {
222 int shiftamt = order_start + 1 + i;
223 int nummaps = size >> shiftamt;
226 if (!nummaps) nummaps = 1;
227 sh->sh_map[i] = (unsigned char *) ch_malloc(nummaps);
228 memset(sh->sh_map[i], 0, nummaps);
230 sh->sh_stack = stack;
244 /* separate from context */
245 ldap_pvt_thread_pool_setkey( ctx, (void *)slap_sl_mem_init, NULL, NULL );
255 struct slab_heap *sh = ctx;
256 ber_len_t size_shift;
257 int pad = 2*sizeof(int)-1, pad_shift;
258 int order = -1, order_start = -1;
259 struct slab_object *so_new, *so_left, *so_right;
260 ber_len_t *ptr, *newptr;
264 #ifdef SLAP_NO_SL_MALLOC
265 return ber_malloc_x( size, NULL );
268 /* ber_set_option calls us like this */
269 if (!ctx) return ber_memalloc_x(size, NULL);
271 /* round up to doubleword boundary */
272 size += sizeof(ber_len_t) + pad;
276 if ((char *)sh->sh_last + size >= (char *)sh->sh_end) {
277 Debug(LDAP_DEBUG_TRACE,
278 "slap_sl_malloc of %lu bytes failed, using ch_malloc\n",
280 return ch_malloc(size);
282 newptr = sh->sh_last;
283 *newptr++ = size - sizeof(ber_len_t);
284 sh->sh_last = (char *) sh->sh_last + size;
285 return( (void *)newptr );
287 size_shift = size - 1;
290 } while (size_shift >>= 1);
295 } while (pad_shift >>= 1);
297 for (i = order; i <= sh->sh_maxorder &&
298 LDAP_LIST_EMPTY(&sh->sh_free[i-order_start]); i++);
301 so_new = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
302 LDAP_LIST_REMOVE(so_new, so_link);
303 ptr = so_new->so_ptr;
304 diff = (unsigned long)((char*)ptr -
305 (char*)sh->sh_base) >> (order + 1);
306 sh->sh_map[order-order_start][diff>>3] |= (1 << (diff & 0x7));
307 *ptr++ = size - sizeof(ber_len_t);
308 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_new, so_link);
310 } else if (i <= sh->sh_maxorder) {
311 for (j = i; j > order; j--) {
312 so_left = LDAP_LIST_FIRST(&sh->sh_free[j-order_start]);
313 LDAP_LIST_REMOVE(so_left, so_link);
314 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
315 slap_replenish_sopool(sh);
317 so_right = LDAP_LIST_FIRST(&sh->sh_sopool);
318 LDAP_LIST_REMOVE(so_right, so_link);
319 so_right->so_ptr = (void *)((char *)so_left->so_ptr + (1 << j));
320 if (j == order + 1) {
321 ptr = so_left->so_ptr;
322 diff = (unsigned long)((char*)ptr -
323 (char*)sh->sh_base) >> (order+1);
324 sh->sh_map[order-order_start][diff>>3] |=
326 *ptr++ = size - sizeof(ber_len_t);
327 LDAP_LIST_INSERT_HEAD(
328 &sh->sh_free[j-1-order_start], so_right, so_link);
329 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_left, so_link);
332 LDAP_LIST_INSERT_HEAD(
333 &sh->sh_free[j-1-order_start], so_right, so_link);
334 LDAP_LIST_INSERT_HEAD(
335 &sh->sh_free[j-1-order_start], so_left, so_link);
339 Debug( LDAP_DEBUG_TRACE,
340 "slap_sl_malloc of %lu bytes failed, using ch_malloc\n",
342 return (void*)ch_malloc(size);
346 /* FIXME: missing return; guessing... */
351 slap_sl_calloc( ber_len_t n, ber_len_t size, void *ctx )
355 newptr = slap_sl_malloc( n*size, ctx );
357 memset( newptr, 0, n*size );
363 slap_sl_realloc(void *ptr, ber_len_t size, void *ctx)
365 struct slab_heap *sh = ctx;
366 int pad = 2*sizeof(int) -1;
367 ber_len_t *p = (ber_len_t *)ptr, *newptr;
370 return slap_sl_malloc(size, ctx);
372 #ifdef SLAP_NO_SL_MALLOC
373 return ber_memrealloc_x( ptr, size, NULL );
376 /* Not our memory? */
377 if (!sh || ptr < sh->sh_base || ptr >= sh->sh_end) {
378 /* duplicate of realloc behavior, oh well */
379 newptr = ber_memrealloc_x(ptr, size, NULL);
383 Debug(LDAP_DEBUG_ANY, "ch_realloc of %lu bytes failed\n",
386 exit( EXIT_FAILURE );
390 slap_sl_free(ptr, ctx);
395 /* round up to doubleword boundary */
396 size += pad + sizeof( ber_len_t );
399 /* Never shrink blocks */
403 /* If reallocing the last block, we can grow it */
404 } else if ((char *)ptr + p[-1] == sh->sh_last &&
405 (char *)ptr + size < (char *)sh->sh_end ) {
407 sh->sh_last = (char *)sh->sh_last + size - p[-1];
410 /* Nowhere to grow, need to alloc and copy */
412 newptr = slap_sl_malloc(size, ctx);
413 AC_MEMCPY(newptr, ptr, p[-1]);
419 newptr2 = slap_sl_malloc(size, ctx);
421 AC_MEMCPY(newptr2, ptr, size);
423 AC_MEMCPY(newptr2, ptr, p[-1]);
425 slap_sl_free(ptr, ctx);
431 slap_sl_free(void *ptr, void *ctx)
433 struct slab_heap *sh = ctx;
434 int size, size_shift, order_size;
435 int pad = 2*sizeof(int)-1, pad_shift;
436 ber_len_t *p = (ber_len_t *)ptr, *tmpp;
437 int order_start = -1, order = -1;
438 struct slab_object *so;
445 #ifdef SLAP_NO_SL_MALLOC
446 ber_memfree_x( ptr, NULL );
450 if (!sh || ptr < sh->sh_base || ptr >= sh->sh_end) {
451 ber_memfree_x(ptr, NULL);
452 } else if (sh->sh_stack && (char *)ptr + p[-1] == sh->sh_last) {
455 } else if (!sh->sh_stack) {
457 size_shift = size + sizeof(ber_len_t) - 1;
460 } while (size_shift >>= 1);
465 } while (pad_shift >>= 1);
467 for (i = order, tmpp = p; i <= sh->sh_maxorder; i++) {
468 order_size = 1 << (i+1);
469 diff = (unsigned long)((char*)tmpp - (char*)sh->sh_base) >> (i+1);
470 sh->sh_map[i-order_start][diff>>3] &= (~(1 << (diff & 0x7)));
471 if (diff == ((diff>>1)<<1)) {
472 if (!(sh->sh_map[i-order_start][(diff+1)>>3] &
473 (1<<((diff+1)&0x7)))) {
474 so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
476 if ((char*)so->so_ptr == (char*)tmpp) {
477 LDAP_LIST_REMOVE( so, so_link );
478 } else if ((char*)so->so_ptr ==
479 (char*)tmpp + order_size) {
480 LDAP_LIST_REMOVE(so, so_link);
483 so = LDAP_LIST_NEXT(so, so_link);
486 if (i < sh->sh_maxorder) {
489 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start+1],
494 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
495 slap_replenish_sopool(sh);
497 so = LDAP_LIST_FIRST(&sh->sh_sopool);
498 LDAP_LIST_REMOVE(so, so_link);
500 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
504 Debug(LDAP_DEBUG_TRACE, "slap_sl_free: "
505 "free object not found while bit is clear.\n",
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],
524 if (!(sh->sh_map[i-order_start][(diff-1)>>3] &
525 (1<<((diff-1)&0x7)))) {
526 so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
528 if ((char*)so->so_ptr == (char*)tmpp) {
529 LDAP_LIST_REMOVE(so, so_link);
530 } else if ((char*)tmpp == (char *)so->so_ptr + order_size) {
531 LDAP_LIST_REMOVE(so, so_link);
535 so = LDAP_LIST_NEXT(so, so_link);
538 if (i < sh->sh_maxorder) {
540 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start+1], so, so_link);
544 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
545 slap_replenish_sopool(sh);
547 so = LDAP_LIST_FIRST(&sh->sh_sopool);
548 LDAP_LIST_REMOVE(so, so_link);
550 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
554 Debug(LDAP_DEBUG_TRACE, "slap_sl_free: "
555 "free object not found while bit is clear.\n",
562 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
563 slap_replenish_sopool(sh);
565 so = LDAP_LIST_FIRST(&sh->sh_sopool);
566 LDAP_LIST_REMOVE(so, so_link);
568 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
579 slap_sl_context( void *ptr )
581 struct slab_heap *sh;
584 if ( slapMode & SLAP_TOOL_MODE ) return NULL;
589 ctx = ldap_pvt_thread_pool_context();
592 ldap_pvt_thread_pool_getkey(
593 ctx, (void *)slap_sl_mem_init, &sh_tmp, NULL);
597 if (sh && ptr >= sh->sh_base && ptr <= sh->sh_end) {
603 static struct slab_object *
604 slap_replenish_sopool(
608 struct slab_object *so_block;
611 so_block = (struct slab_object *)ch_malloc(
612 SLAP_SLAB_SOBLOCK * sizeof(struct slab_object));
614 if ( so_block == NULL ) {
618 so_block[0].so_blockhead = 1;
619 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, &so_block[0], so_link);
620 for (i = 1; i < SLAP_SLAB_SOBLOCK; i++) {
621 so_block[i].so_blockhead = 0;
622 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, &so_block[i], so_link );
630 print_slheap(int level, void *ctx)
632 struct slab_heap *sh = ctx;
633 int order_start = -1;
634 int pad = 2*sizeof(int)-1, pad_shift;
635 struct slab_object *so;
639 Debug(level, "NULL memctx\n", 0, 0, 0);
646 } while (pad_shift >>= 1);
648 Debug(level, "sh->sh_maxorder=%d\n", sh->sh_maxorder, 0, 0);
650 for (i = order_start; i <= sh->sh_maxorder; i++) {
652 Debug(level, "order=%d\n", i, 0, 0);
653 for (j = 0; j < (1<<(sh->sh_maxorder-i))/8; j++) {
654 Debug(level, "%02x ", sh->sh_map[i-order_start][j], 0, 0);
658 Debug(level, "%02x ", sh->sh_map[i-order_start][0], 0, 0);
660 Debug(level, "\n", 0, 0, 0);
661 Debug(level, "free list:\n", 0, 0, 0);
662 so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
664 Debug(level, "%lx\n", (unsigned long) so->so_ptr, 0, 0);
665 so = LDAP_LIST_NEXT(so, so_link);