git.sur5r.net Git - openldap/blob - servers/slapd/sl_malloc.c

   1 /* sl_malloc.c - malloc routines using a per-thread slab */
   2 /* $OpenLDAP$ */
   3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
   4  *
   5  * Copyright 2003-2009 The OpenLDAP Foundation.
   6  * All rights reserved.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted only as authorized by the OpenLDAP
  10  * Public License.
  11  *
  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>.
  15  */
  16
  17 #include "portable.h"
  18
  19 #include <stdio.h>
  20 #include <ac/string.h>
  21
  22 #include "slap.h"
  23
  24 static struct slab_object * slap_replenish_sopool(struct slab_heap* sh);
  25 #ifdef SLAPD_UNUSED
  26 static void print_slheap(int level, void *ctx);
  27 #endif
  28
  29 void
  30 slap_sl_mem_destroy(
  31         void *key,
  32         void *data
  33 )
  34 {
  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;
  39
  40         if (sh->sh_stack) {
  41                 ber_memfree_x(sh->sh_base, NULL);
  42                 ber_memfree_x(sh, NULL);
  43         } else {
  44                 pad_shift = pad - 1;
  45                 do {
  46                         order_start++;
  47                 } while (pad_shift >>= 1);
  48
  49                 for (i = 0; i <= sh->sh_maxorder - order_start; i++) {
  50                         so = LDAP_LIST_FIRST(&sh->sh_free[i]);
  51                         while (so) {
  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);
  55                         }
  56                         ch_free(sh->sh_map[i]);
  57                 }
  58                 ch_free(sh->sh_free);
  59                 ch_free(sh->sh_map);
  60
  61                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
  62                 while (so) {
  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);
  67                         }
  68                 }
  69                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
  70                 while (so) {
  71                         struct slab_object *so_tmp = so;
  72                         so = LDAP_LIST_NEXT(so, so_link);
  73                         ch_free(so_tmp);
  74                 }
  75                 ber_memfree_x(sh->sh_base, NULL);
  76                 ber_memfree_x(sh, NULL);
  77         }
  78 }
  79
  80 BerMemoryFunctions slap_sl_mfuncs =
  81         { slap_sl_malloc, slap_sl_calloc, slap_sl_realloc, slap_sl_free };
  82
  83 void
  84 slap_sl_mem_init()
  85 {
  86         ber_set_option( NULL, LBER_OPT_MEMORY_FNS, &slap_sl_mfuncs );
  87 }
  88
  89 #ifdef NO_THREADS
  90 static struct slab_heap *slheap;
  91 #endif
  92
  93 void *
  94 slap_sl_mem_create(
  95         ber_len_t size,
  96         int stack,
  97         void *ctx,
  98         int new
  99 )
 100 {
 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;
 105         int i;
 106         struct slab_object *so;
 107
 108 #ifdef NO_THREADS
 109         sh = slheap;
 110 #else
 111         void *sh_tmp = NULL;
 112         ldap_pvt_thread_pool_getkey(
 113                 ctx, (void *)slap_sl_mem_init, &sh_tmp, NULL );
 114         sh = sh_tmp;
 115 #endif
 116
 117         if ( !new )
 118                 return sh;
 119
 120         /* round up to doubleword boundary */
 121         size += pad;
 122         size &= ~pad;
 123
 124         if (stack) {
 125                 if (!sh) {
 126                         sh = ch_malloc(sizeof(struct slab_heap));
 127                         sh->sh_base = ch_malloc(size);
 128 #ifdef NO_THREADS
 129                         slheap = sh;
 130 #else
 131                         ldap_pvt_thread_pool_setkey(ctx, (void *)slap_sl_mem_init,
 132                                 (void *)sh, slap_sl_mem_destroy, NULL, NULL);
 133 #endif
 134                 } else if ( size > (char *)sh->sh_end - (char *)sh->sh_base ) {
 135                         void    *newptr;
 136
 137                         newptr = ch_realloc( sh->sh_base, size );
 138                         if ( newptr == NULL ) return NULL;
 139                         sh->sh_base = newptr;
 140                 }
 141                 /* insert dummy len */
 142                 {
 143                         ber_len_t *i = sh->sh_base;
 144                         *i++ = 0;
 145                         sh->sh_last = i;
 146                 }
 147                 sh->sh_end = (char *) sh->sh_base + size;
 148                 sh->sh_stack = stack;
 149                 return sh;
 150         } else {
 151                 size_shift = size - 1;
 152                 do {
 153                         order_end++;
 154                 } while (size_shift >>= 1);
 155
 156                 pad_shift = pad - 1;
 157                 do {
 158                         order_start++;
 159                 } while (pad_shift >>= 1);
 160
 161                 order = order_end - order_start + 1;
 162
 163                 if (!sh) {
 164                         sh = (struct slab_heap *) ch_malloc(sizeof(struct slab_heap));
 165                         sh->sh_base = ch_malloc(size);
 166 #ifdef NO_THREADS
 167                         slheap = sh;
 168 #else
 169                         ldap_pvt_thread_pool_setkey(ctx, (void *)slap_sl_mem_init,
 170                                 (void *)sh, slap_sl_mem_destroy, NULL, NULL);
 171 #endif
 172                 } else {
 173                         for (i = 0; i <= sh->sh_maxorder - order_start; i++) {
 174                                 so = LDAP_LIST_FIRST(&sh->sh_free[i]);
 175                                 while (so) {
 176                                         struct slab_object *so_tmp = so;
 177                                         so = LDAP_LIST_NEXT(so, so_link);
 178                                         LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_tmp, so_link);
 179                                 }
 180                                 ch_free(sh->sh_map[i]);
 181                         }
 182                         ch_free(sh->sh_free);
 183                         ch_free(sh->sh_map);
 184
 185                         so = LDAP_LIST_FIRST(&sh->sh_sopool);
 186                         while (so) {
 187                                 struct slab_object *so_tmp = so;
 188                                 so = LDAP_LIST_NEXT(so, so_link);
 189                                 if (!so_tmp->so_blockhead) {
 190                                         LDAP_LIST_REMOVE(so_tmp, so_link);
 191                                 }
 192                         }
 193                         so = LDAP_LIST_FIRST(&sh->sh_sopool);
 194                         while (so) {
 195                                 struct slab_object *so_tmp = so;
 196                                 so = LDAP_LIST_NEXT(so, so_link);
 197                                 ch_free(so_tmp);
 198                         }
 199
 200                         if (size > (char *)sh->sh_end - (char *)sh->sh_base) {
 201                                 void    *newptr;
 202
 203                                 newptr = ch_realloc( sh->sh_base, size );
 204                                 if ( newptr == NULL ) return NULL;
 205                                 sh->sh_base = newptr;
 206                         }
 207                 }
 208                 sh->sh_end = (char *)sh->sh_base + size;
 209                 sh->sh_maxorder = order_end;
 210
 211                 sh->sh_free = (struct sh_freelist *)
 212                                                 ch_malloc(order * sizeof(struct sh_freelist));
 213                 for (i = 0; i < order; i++) {
 214                         LDAP_LIST_INIT(&sh->sh_free[i]);
 215                 }
 216
 217                 LDAP_LIST_INIT(&sh->sh_sopool);
 218
 219                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 220                         slap_replenish_sopool(sh);
 221                 }
 222                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 223                 LDAP_LIST_REMOVE(so, so_link);
 224                 so->so_ptr = sh->sh_base;
 225
 226                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[order-1], so, so_link);
 227
 228                 sh->sh_map = (unsigned char **)
 229                                         ch_malloc(order * sizeof(unsigned char *));
 230                 for (i = 0; i < order; i++) {
 231                         int shiftamt = order_start + 1 + i;
 232                         int nummaps = size >> shiftamt;
 233                         assert(nummaps);
 234                         nummaps >>= 3;
 235                         if (!nummaps) nummaps = 1;
 236                         sh->sh_map[i] = (unsigned char *) ch_malloc(nummaps);
 237                         memset(sh->sh_map[i], 0, nummaps);
 238                 }
 239                 sh->sh_stack = stack;
 240                 return sh;
 241         }
 242 }
 243
 244 void
 245 slap_sl_mem_detach(
 246         void *ctx,
 247         void *memctx
 248 )
 249 {
 250 #ifdef NO_THREADS
 251         slheap = NULL;
 252 #else
 253         /* separate from context */
 254         ldap_pvt_thread_pool_setkey( ctx, (void *)slap_sl_mem_init,
 255                 NULL, 0, NULL, NULL );
 256 #endif
 257 }
 258
 259 void *
 260 slap_sl_malloc(
 261     ber_len_t   size,
 262     void *ctx
 263 )
 264 {
 265         struct slab_heap *sh = ctx;
 266         int pad = 2*sizeof(int)-1, pad_shift;
 267         ber_len_t *ptr, *newptr;
 268
 269 #ifdef SLAP_NO_SL_MALLOC
 270         newptr = ber_memalloc_x( size, NULL );
 271         if ( newptr ) return newptr;
 272         assert( 0 );
 273         exit( EXIT_FAILURE );
 274 #endif
 275
 276         /* ber_set_option calls us like this */
 277         if (!ctx) {
 278                 newptr = ber_memalloc_x( size, NULL );
 279                 if ( newptr ) return newptr;
 280                 assert( 0 );
 281                 exit( EXIT_FAILURE );
 282         }
 283
 284         /* round up to doubleword boundary, plus space for len at head and tail */
 285         size += 2*sizeof(ber_len_t) + pad;
 286         size &= ~pad;
 287
 288         if (sh->sh_stack) {
 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",
 292                                 (long)size, 0, 0);
 293                         return ch_malloc(size);
 294                 }
 295                 newptr = sh->sh_last;
 296                 *newptr++ = size - sizeof(ber_len_t);
 297                 sh->sh_last = (char *) sh->sh_last + size;
 298                 ptr = sh->sh_last;
 299                 ptr[-1] = size - sizeof(ber_len_t);
 300                 return( (void *)newptr );
 301         } else {
 302                 struct slab_object *so_new, *so_left, *so_right;
 303                 ber_len_t size_shift;
 304                 int order = -1, order_start = -1;
 305                 unsigned long diff;
 306                 int i, j;
 307
 308                 size_shift = size - 1;
 309                 do {
 310                         order++;
 311                 } while (size_shift >>= 1);
 312
 313                 pad_shift = pad - 1;
 314                 do {
 315                         order_start++;
 316                 } while (pad_shift >>= 1);
 317
 318                 for (i = order; i <= sh->sh_maxorder &&
 319                                 LDAP_LIST_EMPTY(&sh->sh_free[i-order_start]); i++);
 320
 321                 if (i == order) {
 322                         so_new = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
 323                         LDAP_LIST_REMOVE(so_new, so_link);
 324                         ptr = so_new->so_ptr;
 325                         diff = (unsigned long)((char*)ptr -
 326                                         (char*)sh->sh_base) >> (order + 1);
 327                         sh->sh_map[order-order_start][diff>>3] |= (1 << (diff & 0x7));
 328                         *ptr++ = size - sizeof(ber_len_t);
 329                         LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_new, so_link);
 330                         return((void*)ptr);
 331                 } else if (i <= sh->sh_maxorder) {
 332                         for (j = i; j > order; j--) {
 333                                 so_left = LDAP_LIST_FIRST(&sh->sh_free[j-order_start]);
 334                                 LDAP_LIST_REMOVE(so_left, so_link);
 335                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 336                                         slap_replenish_sopool(sh);
 337                                 }
 338                                 so_right = LDAP_LIST_FIRST(&sh->sh_sopool);
 339                                 LDAP_LIST_REMOVE(so_right, so_link);
 340                                 so_right->so_ptr = (void *)((char *)so_left->so_ptr + (1 << j));
 341                                 if (j == order + 1) {
 342                                         ptr = so_left->so_ptr;
 343                                         diff = (unsigned long)((char*)ptr -
 344                                                         (char*)sh->sh_base) >> (order+1);
 345                                         sh->sh_map[order-order_start][diff>>3] |=
 346                                                         (1 << (diff & 0x7));
 347                                         *ptr++ = size - sizeof(ber_len_t);
 348                                         LDAP_LIST_INSERT_HEAD(
 349                                                         &sh->sh_free[j-1-order_start], so_right, so_link);
 350                                         LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_left, so_link);
 351                                         return((void*)ptr);
 352                                 } else {
 353                                         LDAP_LIST_INSERT_HEAD(
 354                                                         &sh->sh_free[j-1-order_start], so_right, so_link);
 355                                         LDAP_LIST_INSERT_HEAD(
 356                                                         &sh->sh_free[j-1-order_start], so_left, so_link);
 357                                 }
 358                         }
 359                 } else {
 360                         Debug( LDAP_DEBUG_TRACE,
 361                                 "slap_sl_malloc of %lu bytes failed, using ch_malloc\n",
 362                                 (long)size, 0, 0);
 363                         return (void*)ch_malloc(size);
 364                 }
 365         }
 366
 367         /* FIXME: missing return; guessing... */
 368         return NULL;
 369 }
 370
 371 void *
 372 slap_sl_calloc( ber_len_t n, ber_len_t size, void *ctx )
 373 {
 374         void *newptr;
 375
 376         newptr = slap_sl_malloc( n*size, ctx );
 377         if ( newptr ) {
 378                 memset( newptr, 0, n*size );
 379         }
 380         return newptr;
 381 }
 382
 383 void *
 384 slap_sl_realloc(void *ptr, ber_len_t size, void *ctx)
 385 {
 386         struct slab_heap *sh = ctx;
 387         int pad = 2*sizeof(int) -1;
 388         ber_len_t *p = (ber_len_t *)ptr, *newptr;
 389
 390         if (ptr == NULL)
 391                 return slap_sl_malloc(size, ctx);
 392
 393 #ifdef SLAP_NO_SL_MALLOC
 394         newptr = ber_memrealloc_x( ptr, size, NULL );
 395         if ( newptr ) return newptr;
 396         assert( 0 );
 397         exit( EXIT_FAILURE );
 398 #endif
 399
 400         /* Not our memory? */
 401         if (!sh || ptr < sh->sh_base || ptr >= sh->sh_end) {
 402                 /* duplicate of realloc behavior, oh well */
 403                 newptr = ber_memrealloc_x(ptr, size, NULL);
 404                 if (newptr) {
 405                         return newptr;
 406                 }
 407                 Debug(LDAP_DEBUG_ANY, "ch_realloc of %lu bytes failed\n",
 408                                 (long) size, 0, 0);
 409                 assert(0);
 410                 exit( EXIT_FAILURE );
 411         }
 412
 413         if (size == 0) {
 414                 slap_sl_free(ptr, ctx);
 415                 return NULL;
 416         }
 417
 418         if (sh->sh_stack) {
 419                 /* round up to doubleword boundary */
 420                 size += pad + sizeof( ber_len_t );
 421                 size &= ~pad;
 422
 423                 /* Never shrink blocks */
 424                 if (size <= p[-1]) {
 425                         newptr = p;
 426
 427                 /* If reallocing the last block, we can grow it */
 428                 } else if ((char *)ptr + p[-1] == sh->sh_last &&
 429                         (char *)ptr + size < (char *)sh->sh_end ) {
 430                         newptr = p;
 431                         sh->sh_last = (char *)sh->sh_last + size - p[-1];
 432                         p[-1] = size;
 433                         p = sh->sh_last;
 434                         p[-1] = size;
 435
 436
 437                 /* Nowhere to grow, need to alloc and copy */
 438                 } else {
 439                         newptr = slap_sl_malloc(size-2*sizeof(ber_len_t), ctx);
 440                         AC_MEMCPY(newptr, ptr, p[-1]-sizeof(ber_len_t));
 441                         /* mark old region as free */
 442                         p[p[-1]/sizeof(ber_len_t)-1] |= 1;
 443                 }
 444                 return newptr;
 445         } else {
 446                 void *newptr2;
 447
 448                 newptr2 = slap_sl_malloc(size, ctx);
 449                 if (size < p[-1]) {
 450                         AC_MEMCPY(newptr2, ptr, size);
 451                 } else {
 452                         AC_MEMCPY(newptr2, ptr, p[-1]);
 453                 }
 454                 slap_sl_free(ptr, ctx);
 455                 return newptr2;
 456         }
 457 }
 458
 459 void
 460 slap_sl_free(void *ptr, void *ctx)
 461 {
 462         struct slab_heap *sh = ctx;
 463         int size, size_shift, order_size;
 464         int pad = 2*sizeof(int)-1, pad_shift;
 465         ber_len_t *p = (ber_len_t *)ptr, *tmpp;
 466         int order_start = -1, order = -1;
 467         struct slab_object *so;
 468         unsigned long diff;
 469         int i, inserted = 0;
 470
 471         if (!ptr)
 472                 return;
 473
 474 #ifdef SLAP_NO_SL_MALLOC
 475         ber_memfree_x( ptr, NULL );
 476         return;
 477 #endif
 478
 479         if (!sh || ptr < sh->sh_base || ptr >= sh->sh_end) {
 480                 ber_memfree_x(ptr, NULL);
 481         } else if (sh->sh_stack) {
 482                 tmpp = (ber_len_t *)((char *)ptr + p[-1]);
 483                 /* mark it free */
 484                 tmpp[-1] |= 1;
 485                 /* reclaim free space off tail */
 486                 while ( tmpp == sh->sh_last ) {
 487                         if ( tmpp[-1] & 1 ) {
 488                                 size = tmpp[-1] ^ 1;
 489                                 ptr = (char *)tmpp - size;
 490                                 p = (ber_len_t *)ptr;
 491                                 p--;
 492                                 sh->sh_last = p;
 493                                 tmpp = sh->sh_last;
 494                         } else {
 495                                 break;
 496                         }
 497                 }
 498         } else {
 499                 size = *(--p);
 500                 size_shift = size + sizeof(ber_len_t) - 1;
 501                 do {
 502                         order++;
 503                 } while (size_shift >>= 1);
 504
 505                 pad_shift = pad - 1;
 506                 do {
 507                         order_start++;
 508                 } while (pad_shift >>= 1);
 509
 510                 for (i = order, tmpp = p; i <= sh->sh_maxorder; i++) {
 511                         order_size = 1 << (i+1);
 512                         diff = (unsigned long)((char*)tmpp - (char*)sh->sh_base) >> (i+1);
 513                         sh->sh_map[i-order_start][diff>>3] &= (~(1 << (diff & 0x7)));
 514                         if (diff == ((diff>>1)<<1)) {
 515                                 if (!(sh->sh_map[i-order_start][(diff+1)>>3] &
 516                                                 (1<<((diff+1)&0x7)))) {
 517                                         so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
 518                                         while (so) {
 519                                                 if ((char*)so->so_ptr == (char*)tmpp) {
 520                                                         LDAP_LIST_REMOVE( so, so_link );
 521                                                 } else if ((char*)so->so_ptr ==
 522                                                                 (char*)tmpp + order_size) {
 523                                                         LDAP_LIST_REMOVE(so, so_link);
 524                                                         break;
 525                                                 }
 526                                                 so = LDAP_LIST_NEXT(so, so_link);
 527                                         }
 528                                         if (so) {
 529                                                 if (i < sh->sh_maxorder) {
 530                                                         inserted = 1;
 531                                                         so->so_ptr = tmpp;
 532                                                         LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start+1],
 533                                                                         so, so_link);
 534                                                 }
 535                                                 continue;
 536                                         } else {
 537                                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 538                                                         slap_replenish_sopool(sh);
 539                                                 }
 540                                                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 541                                                 LDAP_LIST_REMOVE(so, so_link);
 542                                                 so->so_ptr = tmpp;
 543                                                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
 544                                                                 so, so_link);
 545                                                 break;
 546
 547                                                 Debug(LDAP_DEBUG_TRACE, "slap_sl_free: "
 548                                                         "free object not found while bit is clear.\n",
 549                                                         0, 0, 0);
 550                                                 assert(so != NULL);
 551
 552                                         }
 553                                 } else {
 554                                         if (!inserted) {
 555                                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 556                                                         slap_replenish_sopool(sh);
 557                                                 }
 558                                                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 559                                                 LDAP_LIST_REMOVE(so, so_link);
 560                                                 so->so_ptr = tmpp;
 561                                                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
 562                                                                 so, so_link);
 563                                         }
 564                                         break;
 565                                 }
 566                         } else {
 567                                 if (!(sh->sh_map[i-order_start][(diff-1)>>3] &
 568                                                 (1<<((diff-1)&0x7)))) {
 569                                         so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
 570                                         while (so) {
 571                                                 if ((char*)so->so_ptr == (char*)tmpp) {
 572                                                         LDAP_LIST_REMOVE(so, so_link);
 573                                                 } else if ((char*)tmpp == (char *)so->so_ptr + order_size) {
 574                                                         LDAP_LIST_REMOVE(so, so_link);
 575                                                         tmpp = so->so_ptr;
 576                                                         break;
 577                                                 }
 578                                                 so = LDAP_LIST_NEXT(so, so_link);
 579                                         }
 580                                         if (so) {
 581                                                 if (i < sh->sh_maxorder) {
 582                                                         inserted = 1;
 583                                                         LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start+1],                                                                    so, so_link);
 584                                                         continue;
 585                                                 }
 586                                         } else {
 587                                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 588                                                         slap_replenish_sopool(sh);
 589                                                 }
 590                                                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 591                                                 LDAP_LIST_REMOVE(so, so_link);
 592                                                 so->so_ptr = tmpp;
 593                                                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
 594                                                                 so, so_link);
 595                                                 break;
 596
 597                                                 Debug(LDAP_DEBUG_TRACE, "slap_sl_free: "
 598                                                         "free object not found while bit is clear.\n",
 599                                                         0, 0, 0 );
 600                                                 assert(so != NULL);
 601
 602                                         }
 603                                 } else {
 604                                         if ( !inserted ) {
 605                                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 606                                                         slap_replenish_sopool(sh);
 607                                                 }
 608                                                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 609                                                 LDAP_LIST_REMOVE(so, so_link);
 610                                                 so->so_ptr = tmpp;
 611                                                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
 612                                                                 so, so_link);
 613                                         }
 614                                         break;
 615                                 }
 616                         }
 617                 }
 618         }
 619 }
 620
 621 void *
 622 slap_sl_context( void *ptr )
 623 {
 624         struct slab_heap *sh;
 625         void *ctx, *sh_tmp;
 626
 627         if ( slapMode & SLAP_TOOL_MODE ) return NULL;
 628
 629 #ifdef NO_THREADS
 630         sh = slheap;
 631 #else
 632         ctx = ldap_pvt_thread_pool_context();
 633
 634         sh_tmp = NULL;
 635         ldap_pvt_thread_pool_getkey(
 636                 ctx, (void *)slap_sl_mem_init, &sh_tmp, NULL);
 637         sh = sh_tmp;
 638 #endif
 639
 640         if (sh && ptr >= sh->sh_base && ptr <= sh->sh_end) {
 641                 return sh;
 642         }
 643         return NULL;
 644 }
 645
 646 static struct slab_object *
 647 slap_replenish_sopool(
 648     struct slab_heap* sh
 649 )
 650 {
 651     struct slab_object *so_block;
 652     int i;
 653
 654     so_block = (struct slab_object *)ch_malloc(
 655                     SLAP_SLAB_SOBLOCK * sizeof(struct slab_object));
 656
 657     if ( so_block == NULL ) {
 658         return NULL;
 659     }
 660
 661     so_block[0].so_blockhead = 1;
 662     LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, &so_block[0], so_link);
 663     for (i = 1; i < SLAP_SLAB_SOBLOCK; i++) {
 664         so_block[i].so_blockhead = 0;
 665         LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, &so_block[i], so_link );
 666     }
 667
 668     return so_block;
 669 }
 670
 671 #ifdef SLAPD_UNUSED
 672 static void
 673 print_slheap(int level, void *ctx)
 674 {
 675         struct slab_heap *sh = ctx;
 676         int order_start = -1;
 677         int pad = 2*sizeof(int)-1, pad_shift;
 678         struct slab_object *so;
 679         int i, j, once = 0;
 680
 681         if (!ctx) {
 682                 Debug(level, "NULL memctx\n", 0, 0, 0);
 683                 return;
 684         }
 685
 686         pad_shift = pad - 1;
 687         do {
 688                 order_start++;
 689         } while (pad_shift >>= 1);
 690
 691         Debug(level, "sh->sh_maxorder=%d\n", sh->sh_maxorder, 0, 0);
 692
 693         for (i = order_start; i <= sh->sh_maxorder; i++) {
 694                 once = 0;
 695                 Debug(level, "order=%d\n", i, 0, 0);
 696                 for (j = 0; j < (1<<(sh->sh_maxorder-i))/8; j++) {
 697                         Debug(level, "%02x ", sh->sh_map[i-order_start][j], 0, 0);
 698                         once = 1;
 699                 }
 700                 if (!once) {
 701                         Debug(level, "%02x ", sh->sh_map[i-order_start][0], 0, 0);
 702                 }
 703                 Debug(level, "\n", 0, 0, 0);
 704                 Debug(level, "free list:\n", 0, 0, 0);
 705                 so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
 706                 while (so) {
 707                         Debug(level, "%lx\n", (unsigned long) so->so_ptr, 0, 0);
 708                         so = LDAP_LIST_NEXT(so, so_link);
 709                 }
 710         }
 711 }
 712 #endif