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;
100 int pad = 2*sizeof(int)-1, pad_shift;
101 int order = -1, order_start = -1, order_end = -1;
103 struct slab_object *so;
109 ldap_pvt_thread_pool_getkey(
110 ctx, (void *)slap_sl_mem_init, &sh_tmp, NULL );
114 /* round up to doubleword boundary */
120 sh = ch_malloc(sizeof(struct slab_heap));
121 sh->sh_base = ch_malloc(size);
125 ldap_pvt_thread_pool_setkey(ctx, (void *)slap_sl_mem_init,
126 (void *)sh, slap_sl_mem_destroy);
128 } else if ( size > (char *)sh->sh_end - (char *)sh->sh_base ) {
129 sh->sh_base = ch_realloc(sh->sh_base, size);
131 sh->sh_last = sh->sh_base;
132 sh->sh_end = (char *) sh->sh_base + size;
133 sh->sh_stack = stack;
136 size_shift = size - 1;
139 } while (size_shift >>= 1);
144 } while (pad_shift >>= 1);
146 order = order_end - order_start + 1;
149 sh = (struct slab_heap *) ch_malloc(sizeof(struct slab_heap));
150 sh->sh_base = ch_malloc(size);
154 ldap_pvt_thread_pool_setkey(ctx, (void *)slap_sl_mem_init,
155 (void *)sh, slap_sl_mem_destroy);
158 for (i = 0; i <= sh->sh_maxorder - order_start; i++) {
159 so = LDAP_LIST_FIRST(&sh->sh_free[i]);
161 struct slab_object *so_tmp = so;
162 so = LDAP_LIST_NEXT(so, so_link);
163 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_tmp, so_link);
165 ch_free(sh->sh_map[i]);
167 ch_free(sh->sh_free);
170 so = LDAP_LIST_FIRST(&sh->sh_sopool);
172 struct slab_object *so_tmp = so;
173 so = LDAP_LIST_NEXT(so, so_link);
174 if (!so_tmp->so_blockhead) {
175 LDAP_LIST_REMOVE(so_tmp, so_link);
178 so = LDAP_LIST_FIRST(&sh->sh_sopool);
180 struct slab_object *so_tmp = so;
181 so = LDAP_LIST_NEXT(so, so_link);
185 if (size > (char *)sh->sh_end - (char *)sh->sh_base) {
186 sh->sh_base = realloc(sh->sh_base, size);
189 sh->sh_end = (char *)sh->sh_base + size;
190 sh->sh_maxorder = order_end;
192 sh->sh_free = (struct sh_freelist *)
193 ch_malloc(order * sizeof(struct sh_freelist));
194 for (i = 0; i < order; i++) {
195 LDAP_LIST_INIT(&sh->sh_free[i]);
198 LDAP_LIST_INIT(&sh->sh_sopool);
200 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
201 slap_replenish_sopool(sh);
203 so = LDAP_LIST_FIRST(&sh->sh_sopool);
204 LDAP_LIST_REMOVE(so, so_link);
205 so->so_ptr = sh->sh_base;
207 LDAP_LIST_INSERT_HEAD(&sh->sh_free[order-1], so, so_link);
209 sh->sh_map = (unsigned char **)
210 ch_malloc(order * sizeof(unsigned char *));
211 for (i = 0; i < order; i++) {
212 int shiftamt = order_start + 1 + i;
213 int nummaps = size >> shiftamt;
216 if (!nummaps) nummaps = 1;
217 sh->sh_map[i] = (unsigned char *) ch_malloc(nummaps);
218 memset(sh->sh_map[i], 0, nummaps);
220 sh->sh_stack = stack;
234 /* separate from context */
235 ldap_pvt_thread_pool_setkey( ctx, (void *)slap_sl_mem_init, NULL, NULL );
245 struct slab_heap *sh = ctx;
246 ber_len_t size_shift;
247 int pad = 2*sizeof(int)-1, pad_shift;
248 int order = -1, order_start = -1;
249 struct slab_object *so_new, *so_left, *so_right;
250 ber_len_t *ptr, *new;
254 /* ber_set_option calls us like this */
255 if (!ctx) return ber_memalloc_x(size, NULL);
257 /* round up to doubleword boundary */
258 size += sizeof(ber_len_t) + pad;
262 if ((char *)sh->sh_last + size >= (char *)sh->sh_end) {
263 Debug(LDAP_DEBUG_TRACE,
264 "slap_sl_malloc of %lu bytes failed, using ch_malloc\n",
266 return ch_malloc(size);
269 *new++ = size - sizeof(ber_len_t);
270 sh->sh_last = (char *) sh->sh_last + size;
271 return( (void *)new );
273 size_shift = size - 1;
276 } while (size_shift >>= 1);
281 } while (pad_shift >>= 1);
283 for (i = order; i <= sh->sh_maxorder &&
284 LDAP_LIST_EMPTY(&sh->sh_free[i-order_start]); i++);
287 so_new = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
288 LDAP_LIST_REMOVE(so_new, so_link);
289 ptr = so_new->so_ptr;
290 diff = (unsigned long)((char*)ptr -
291 (char*)sh->sh_base) >> (order + 1);
292 sh->sh_map[order-order_start][diff>>3] |= (1 << (diff & 0x7));
293 *ptr++ = size - sizeof(ber_len_t);
294 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_new, so_link);
296 } else if (i <= sh->sh_maxorder) {
297 for (j = i; j > order; j--) {
298 so_left = LDAP_LIST_FIRST(&sh->sh_free[j-order_start]);
299 LDAP_LIST_REMOVE(so_left, so_link);
300 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
301 slap_replenish_sopool(sh);
303 so_right = LDAP_LIST_FIRST(&sh->sh_sopool);
304 LDAP_LIST_REMOVE(so_right, so_link);
305 so_right->so_ptr = (void *)((char *)so_left->so_ptr + (1 << j));
306 if (j == order + 1) {
307 ptr = so_left->so_ptr;
308 diff = (unsigned long)((char*)ptr -
309 (char*)sh->sh_base) >> (order+1);
310 sh->sh_map[order-order_start][diff>>3] |=
312 *ptr++ = size - sizeof(ber_len_t);
313 LDAP_LIST_INSERT_HEAD(
314 &sh->sh_free[j-1-order_start], so_right, so_link);
315 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_left, so_link);
318 LDAP_LIST_INSERT_HEAD(
319 &sh->sh_free[j-1-order_start], so_right, so_link);
320 LDAP_LIST_INSERT_HEAD(
321 &sh->sh_free[j-1-order_start], so_left, so_link);
325 Debug( LDAP_DEBUG_TRACE,
326 "slap_sl_malloc of %lu bytes failed, using ch_malloc\n",
328 return (void*)ch_malloc(size);
332 /* FIXME: missing return; guessing... */
337 slap_sl_calloc( ber_len_t n, ber_len_t size, void *ctx )
341 new = slap_sl_malloc( n*size, ctx );
343 memset( new, 0, n*size );
349 slap_sl_realloc(void *ptr, ber_len_t size, void *ctx)
351 struct slab_heap *sh = ctx;
352 int pad = 2*sizeof(int) -1;
353 ber_len_t *p = (ber_len_t *)ptr, *new;
356 return slap_sl_malloc(size, ctx);
358 /* Not our memory? */
359 if (!sh || ptr < sh->sh_base || ptr >= sh->sh_end) {
360 /* duplicate of realloc behavior, oh well */
361 new = ber_memrealloc_x(ptr, size, NULL);
365 Debug(LDAP_DEBUG_ANY, "ch_realloc of %lu bytes failed\n",
368 exit( EXIT_FAILURE );
372 slap_sl_free(ptr, ctx);
377 /* round up to doubleword boundary */
378 size += pad + sizeof( ber_len_t );
381 /* Never shrink blocks */
385 /* If reallocing the last block, we can grow it */
386 } else if ((char *)ptr + p[-1] == sh->sh_last &&
387 (char *)ptr + size < (char *)sh->sh_end ) {
389 sh->sh_last = (char *)sh->sh_last + size - p[-1];
392 /* Nowhere to grow, need to alloc and copy */
394 new = slap_sl_malloc(size, ctx);
395 AC_MEMCPY(new, ptr, p[-1]);
400 newptr = slap_sl_malloc(size, ctx);
402 AC_MEMCPY(newptr, ptr, size);
404 AC_MEMCPY(newptr, ptr, p[-1]);
406 slap_sl_free(ptr, ctx);
412 slap_sl_free(void *ptr, void *ctx)
414 struct slab_heap *sh = ctx;
415 int size, size_shift, order_size;
416 int pad = 2*sizeof(int)-1, pad_shift;
417 ber_len_t *p = (ber_len_t *)ptr, *tmpp;
418 int order_start = -1, order = -1;
419 struct slab_object *so;
423 if (!sh || ptr < sh->sh_base || ptr >= sh->sh_end) {
424 ber_memfree_x(ptr, NULL);
425 } else if (sh->sh_stack && (char *)ptr + p[-1] == sh->sh_last) {
428 } else if (!sh->sh_stack) {
430 size_shift = size + sizeof(ber_len_t) - 1;
433 } while (size_shift >>= 1);
438 } while (pad_shift >>= 1);
440 for (i = order, tmpp = p; i <= sh->sh_maxorder; i++) {
441 order_size = 1 << (i+1);
442 diff = (unsigned long)((char*)tmpp - (char*)sh->sh_base) >> (i+1);
443 sh->sh_map[i-order_start][diff>>3] &= (~(1 << (diff & 0x7)));
444 if (diff == ((diff>>1)<<1)) {
445 if (!(sh->sh_map[i-order_start][(diff+1)>>3] &
446 (1<<((diff+1)&0x7)))) {
447 so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
449 if ((char*)so->so_ptr == (char*)tmpp) {
450 LDAP_LIST_REMOVE( so, so_link );
451 } else if ((char*)so->so_ptr ==
452 (char*)tmpp + order_size) {
453 LDAP_LIST_REMOVE(so, so_link);
456 so = LDAP_LIST_NEXT(so, so_link);
459 if (i < sh->sh_maxorder) {
462 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start+1],
467 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
468 slap_replenish_sopool(sh);
470 so = LDAP_LIST_FIRST(&sh->sh_sopool);
471 LDAP_LIST_REMOVE(so, so_link);
473 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
477 Debug(LDAP_DEBUG_TRACE, "slap_sl_free: "
478 "free object not found while bit is clear.\n",
485 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
486 slap_replenish_sopool(sh);
488 so = LDAP_LIST_FIRST(&sh->sh_sopool);
489 LDAP_LIST_REMOVE(so, so_link);
491 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
497 if (!(sh->sh_map[i-order_start][(diff-1)>>3] &
498 (1<<((diff-1)&0x7)))) {
499 so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
501 if ((char*)so->so_ptr == (char*)tmpp) {
502 LDAP_LIST_REMOVE(so, so_link);
503 } else if ((char*)tmpp == (char *)so->so_ptr + order_size) {
504 LDAP_LIST_REMOVE(so, so_link);
508 so = LDAP_LIST_NEXT(so, so_link);
511 if (i < sh->sh_maxorder) {
513 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start+1], so, so_link);
517 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
518 slap_replenish_sopool(sh);
520 so = LDAP_LIST_FIRST(&sh->sh_sopool);
521 LDAP_LIST_REMOVE(so, so_link);
523 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
527 Debug(LDAP_DEBUG_TRACE, "slap_sl_free: "
528 "free object not found while bit is clear.\n",
535 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
536 slap_replenish_sopool(sh);
538 so = LDAP_LIST_FIRST(&sh->sh_sopool);
539 LDAP_LIST_REMOVE(so, so_link);
541 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
552 slap_sl_context( void *ptr )
554 struct slab_heap *sh;
557 if ( slapMode & SLAP_TOOL_MODE ) return NULL;
562 ctx = ldap_pvt_thread_pool_context();
565 ldap_pvt_thread_pool_getkey(
566 ctx, (void *)slap_sl_mem_init, &sh_tmp, NULL);
570 if (sh && ptr >= sh->sh_base && ptr <= sh->sh_end) {
576 static struct slab_object *
577 slap_replenish_sopool(
581 struct slab_object *so_block;
584 so_block = (struct slab_object *)ch_malloc(
585 SLAP_SLAB_SOBLOCK * sizeof(struct slab_object));
587 if ( so_block == NULL ) {
591 so_block[0].so_blockhead = 1;
592 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, &so_block[0], so_link);
593 for (i = 1; i < SLAP_SLAB_SOBLOCK; i++) {
594 so_block[i].so_blockhead = 0;
595 LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, &so_block[i], so_link );
602 print_slheap(int level, void *ctx)
604 struct slab_heap *sh = ctx;
605 int order_start = -1;
606 int pad = 2*sizeof(int)-1, pad_shift;
607 struct slab_object *so;
611 Debug(level, "NULL memctx\n", 0, 0, 0);
618 } while (pad_shift >>= 1);
620 Debug(level, "sh->sh_maxorder=%d\n", sh->sh_maxorder, 0, 0);
622 for (i = order_start; i <= sh->sh_maxorder; i++) {
624 Debug(level, "order=%d\n", i, 0, 0);
625 for (j = 0; j < (1<<(sh->sh_maxorder-i))/8; j++) {
626 Debug(level, "%02x ", sh->sh_map[i-order_start][j], 0, 0);
630 Debug(level, "%02x ", sh->sh_map[i-order_start][0], 0, 0);
632 Debug(level, "\n", 0, 0, 0);
633 Debug(level, "free list:\n", 0, 0, 0);
634 so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
636 Debug(level, "%lx\n", (unsigned long) so->so_ptr, 0, 0);
637 so = LDAP_LIST_NEXT(so, so_link);