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-2006 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 )
  99 {
 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;
 104         int i;
 105         struct slab_object *so;
 106
 107 #ifdef NO_THREADS
 108         sh = slheap;
 109 #else
 110         void *sh_tmp = NULL;
 111         ldap_pvt_thread_pool_getkey(
 112                 ctx, (void *)slap_sl_mem_init, &sh_tmp, NULL );
 113         sh = sh_tmp;
 114 #endif
 115
 116         /* round up to doubleword boundary */
 117         size += pad;
 118         size &= ~pad;
 119
 120         if (stack) {
 121                 if (!sh) {
 122                         sh = ch_malloc(sizeof(struct slab_heap));
 123                         sh->sh_base = ch_malloc(size);
 124 #ifdef NO_THREADS
 125                         slheap = sh;
 126 #else
 127                         ldap_pvt_thread_pool_setkey(ctx, (void *)slap_sl_mem_init,
 128                                 (void *)sh, slap_sl_mem_destroy);
 129 #endif
 130                 } else if ( size > (char *)sh->sh_end - (char *)sh->sh_base ) {
 131                         void    *newptr;
 132
 133                         newptr = ch_realloc( sh->sh_base, size );
 134                         if ( newptr == NULL ) return NULL;
 135                         sh->sh_base = newptr;
 136                 }
 137                 sh->sh_last = sh->sh_base;
 138                 sh->sh_end = (char *) sh->sh_base + size;
 139                 sh->sh_stack = stack;
 140                 return sh;
 141         } else {
 142                 size_shift = size - 1;
 143                 do {
 144                         order_end++;
 145                 } while (size_shift >>= 1);
 146
 147                 pad_shift = pad - 1;
 148                 do {
 149                         order_start++;
 150                 } while (pad_shift >>= 1);
 151
 152                 order = order_end - order_start + 1;
 153
 154                 if (!sh) {
 155                         sh = (struct slab_heap *) ch_malloc(sizeof(struct slab_heap));
 156                         sh->sh_base = ch_malloc(size);
 157 #ifdef NO_THREADS
 158                         slheap = sh;
 159 #else
 160                         ldap_pvt_thread_pool_setkey(ctx, (void *)slap_sl_mem_init,
 161                                 (void *)sh, slap_sl_mem_destroy);
 162 #endif
 163                 } else {
 164                         for (i = 0; i <= sh->sh_maxorder - order_start; i++) {
 165                                 so = LDAP_LIST_FIRST(&sh->sh_free[i]);
 166                                 while (so) {
 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);
 170                                 }
 171                                 ch_free(sh->sh_map[i]);
 172                         }
 173                         ch_free(sh->sh_free);
 174                         ch_free(sh->sh_map);
 175
 176                         so = LDAP_LIST_FIRST(&sh->sh_sopool);
 177                         while (so) {
 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);
 182                                 }
 183                         }
 184                         so = LDAP_LIST_FIRST(&sh->sh_sopool);
 185                         while (so) {
 186                                 struct slab_object *so_tmp = so;
 187                                 so = LDAP_LIST_NEXT(so, so_link);
 188                                 ch_free(so_tmp);
 189                         }
 190
 191                         if (size > (char *)sh->sh_end - (char *)sh->sh_base) {
 192                                 void    *newptr;
 193
 194                                 newptr = realloc( sh->sh_base, size );
 195                                 if ( newptr == NULL ) return NULL;
 196                                 sh->sh_base = newptr;
 197                         }
 198                 }
 199                 sh->sh_end = (char *)sh->sh_base + size;
 200                 sh->sh_maxorder = order_end;
 201
 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]);
 206                 }
 207
 208                 LDAP_LIST_INIT(&sh->sh_sopool);
 209
 210                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 211                         slap_replenish_sopool(sh);
 212                 }
 213                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 214                 LDAP_LIST_REMOVE(so, so_link);
 215                 so->so_ptr = sh->sh_base;
 216
 217                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[order-1], so, so_link);
 218
 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;
 224                         assert(nummaps);
 225                         nummaps >>= 3;
 226                         if (!nummaps) nummaps = 1;
 227                         sh->sh_map[i] = (unsigned char *) ch_malloc(nummaps);
 228                         memset(sh->sh_map[i], 0, nummaps);
 229                 }
 230                 sh->sh_stack = stack;
 231                 return sh;
 232         }
 233 }
 234
 235 void
 236 slap_sl_mem_detach(
 237         void *ctx,
 238         void *memctx
 239 )
 240 {
 241 #ifdef NO_THREADS
 242         slheap = NULL;
 243 #else
 244         /* separate from context */
 245         ldap_pvt_thread_pool_setkey( ctx, (void *)slap_sl_mem_init, NULL, NULL );
 246 #endif
 247 }
 248
 249 void *
 250 slap_sl_malloc(
 251     ber_len_t   size,
 252     void *ctx
 253 )
 254 {
 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;
 261         unsigned long diff;
 262         int i, j;
 263
 264         /* ber_set_option calls us like this */
 265         if (!ctx) return ber_memalloc_x(size, NULL);
 266
 267         /* round up to doubleword boundary */
 268         size += sizeof(ber_len_t) + pad;
 269         size &= ~pad;
 270
 271         if (sh->sh_stack) {
 272                 if ((char *)sh->sh_last + size >= (char *)sh->sh_end) {
 273                         Debug(LDAP_DEBUG_TRACE,
 274                                 "slap_sl_malloc of %lu bytes failed, using ch_malloc\n",
 275                                 (long)size, 0, 0);
 276                         return ch_malloc(size);
 277                 }
 278                 newptr = sh->sh_last;
 279                 *newptr++ = size - sizeof(ber_len_t);
 280                 sh->sh_last = (char *) sh->sh_last + size;
 281                 return( (void *)newptr );
 282         } else {
 283                 size_shift = size - 1;
 284                 do {
 285                         order++;
 286                 } while (size_shift >>= 1);
 287
 288                 pad_shift = pad - 1;
 289                 do {
 290                         order_start++;
 291                 } while (pad_shift >>= 1);
 292
 293                 for (i = order; i <= sh->sh_maxorder &&
 294                                 LDAP_LIST_EMPTY(&sh->sh_free[i-order_start]); i++);
 295
 296                 if (i == order) {
 297                         so_new = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
 298                         LDAP_LIST_REMOVE(so_new, so_link);
 299                         ptr = so_new->so_ptr;
 300                         diff = (unsigned long)((char*)ptr -
 301                                         (char*)sh->sh_base) >> (order + 1);
 302                         sh->sh_map[order-order_start][diff>>3] |= (1 << (diff & 0x7));
 303                         *ptr++ = size - sizeof(ber_len_t);
 304                         LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_new, so_link);
 305                         return((void*)ptr);
 306                 } else if (i <= sh->sh_maxorder) {
 307                         for (j = i; j > order; j--) {
 308                                 so_left = LDAP_LIST_FIRST(&sh->sh_free[j-order_start]);
 309                                 LDAP_LIST_REMOVE(so_left, so_link);
 310                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 311                                         slap_replenish_sopool(sh);
 312                                 }
 313                                 so_right = LDAP_LIST_FIRST(&sh->sh_sopool);
 314                                 LDAP_LIST_REMOVE(so_right, so_link);
 315                                 so_right->so_ptr = (void *)((char *)so_left->so_ptr + (1 << j));
 316                                 if (j == order + 1) {
 317                                         ptr = so_left->so_ptr;
 318                                         diff = (unsigned long)((char*)ptr -
 319                                                         (char*)sh->sh_base) >> (order+1);
 320                                         sh->sh_map[order-order_start][diff>>3] |=
 321                                                         (1 << (diff & 0x7));
 322                                         *ptr++ = size - sizeof(ber_len_t);
 323                                         LDAP_LIST_INSERT_HEAD(
 324                                                         &sh->sh_free[j-1-order_start], so_right, so_link);
 325                                         LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_left, so_link);
 326                                         return((void*)ptr);
 327                                 } else {
 328                                         LDAP_LIST_INSERT_HEAD(
 329                                                         &sh->sh_free[j-1-order_start], so_right, so_link);
 330                                         LDAP_LIST_INSERT_HEAD(
 331                                                         &sh->sh_free[j-1-order_start], so_left, so_link);
 332                                 }
 333                         }
 334                 } else {
 335                         Debug( LDAP_DEBUG_TRACE,
 336                                 "slap_sl_malloc of %lu bytes failed, using ch_malloc\n",
 337                                 (long)size, 0, 0);
 338                         return (void*)ch_malloc(size);
 339                 }
 340         }
 341
 342         /* FIXME: missing return; guessing... */
 343         return NULL;
 344 }
 345
 346 void *
 347 slap_sl_calloc( ber_len_t n, ber_len_t size, void *ctx )
 348 {
 349         void *newptr;
 350
 351         newptr = slap_sl_malloc( n*size, ctx );
 352         if ( newptr ) {
 353                 memset( newptr, 0, n*size );
 354         }
 355         return newptr;
 356 }
 357
 358 void *
 359 slap_sl_realloc(void *ptr, ber_len_t size, void *ctx)
 360 {
 361         struct slab_heap *sh = ctx;
 362         int pad = 2*sizeof(int) -1;
 363         ber_len_t *p = (ber_len_t *)ptr, *newptr;
 364
 365         if (ptr == NULL)
 366                 return slap_sl_malloc(size, ctx);
 367
 368         /* Not our memory? */
 369         if (!sh || ptr < sh->sh_base || ptr >= sh->sh_end) {
 370                 /* duplicate of realloc behavior, oh well */
 371                 newptr = ber_memrealloc_x(ptr, size, NULL);
 372                 if (newptr) {
 373                         return newptr;
 374                 }
 375                 Debug(LDAP_DEBUG_ANY, "ch_realloc of %lu bytes failed\n",
 376                                 (long) size, 0, 0);
 377                 assert(0);
 378                 exit( EXIT_FAILURE );
 379         }
 380
 381         if (size == 0) {
 382                 slap_sl_free(ptr, ctx);
 383                 return NULL;
 384         }
 385
 386         if (sh->sh_stack) {
 387                 /* round up to doubleword boundary */
 388                 size += pad + sizeof( ber_len_t );
 389                 size &= ~pad;
 390
 391                 /* Never shrink blocks */
 392                 if (size <= p[-1]) {
 393                         newptr = p;
 394
 395                 /* If reallocing the last block, we can grow it */
 396                 } else if ((char *)ptr + p[-1] == sh->sh_last &&
 397                         (char *)ptr + size < (char *)sh->sh_end ) {
 398                         newptr = p;
 399                         sh->sh_last = (char *)sh->sh_last + size - p[-1];
 400                         p[-1] = size;
 401
 402                 /* Nowhere to grow, need to alloc and copy */
 403                 } else {
 404                         newptr = slap_sl_malloc(size, ctx);
 405                         AC_MEMCPY(newptr, ptr, p[-1]);
 406                 }
 407                 return newptr;
 408         } else {
 409                 void *newptr2;
 410
 411                 newptr2 = slap_sl_malloc(size, ctx);
 412                 if (size < p[-1]) {
 413                         AC_MEMCPY(newptr2, ptr, size);
 414                 } else {
 415                         AC_MEMCPY(newptr2, ptr, p[-1]);
 416                 }
 417                 slap_sl_free(ptr, ctx);
 418                 return newptr2;
 419         }
 420 }
 421
 422 void
 423 slap_sl_free(void *ptr, void *ctx)
 424 {
 425         struct slab_heap *sh = ctx;
 426         int size, size_shift, order_size;
 427         int pad = 2*sizeof(int)-1, pad_shift;
 428         ber_len_t *p = (ber_len_t *)ptr, *tmpp;
 429         int order_start = -1, order = -1;
 430         struct slab_object *so;
 431         unsigned long diff;
 432         int i, inserted = 0;
 433
 434         if (!ptr)
 435                 return;
 436
 437         if (!sh || ptr < sh->sh_base || ptr >= sh->sh_end) {
 438                 ber_memfree_x(ptr, NULL);
 439         } else if (sh->sh_stack && (char *)ptr + p[-1] == sh->sh_last) {
 440                 p--;
 441                 sh->sh_last = p;
 442         } else if (!sh->sh_stack) {
 443                 size = *(--p);
 444                 size_shift = size + sizeof(ber_len_t) - 1;
 445                 do {
 446                         order++;
 447                 } while (size_shift >>= 1);
 448
 449                 pad_shift = pad - 1;
 450                 do {
 451                         order_start++;
 452                 } while (pad_shift >>= 1);
 453
 454                 for (i = order, tmpp = p; i <= sh->sh_maxorder; i++) {
 455                         order_size = 1 << (i+1);
 456                         diff = (unsigned long)((char*)tmpp - (char*)sh->sh_base) >> (i+1);
 457                         sh->sh_map[i-order_start][diff>>3] &= (~(1 << (diff & 0x7)));
 458                         if (diff == ((diff>>1)<<1)) {
 459                                 if (!(sh->sh_map[i-order_start][(diff+1)>>3] &
 460                                                 (1<<((diff+1)&0x7)))) {
 461                                         so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
 462                                         while (so) {
 463                                                 if ((char*)so->so_ptr == (char*)tmpp) {
 464                                                         LDAP_LIST_REMOVE( so, so_link );
 465                                                 } else if ((char*)so->so_ptr ==
 466                                                                 (char*)tmpp + order_size) {
 467                                                         LDAP_LIST_REMOVE(so, so_link);
 468                                                         break;
 469                                                 }
 470                                                 so = LDAP_LIST_NEXT(so, so_link);
 471                                         }
 472                                         if (so) {
 473                                                 if (i < sh->sh_maxorder) {
 474                                                         inserted = 1;
 475                                                         so->so_ptr = tmpp;
 476                                                         LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start+1],
 477                                                                         so, so_link);
 478                                                 }
 479                                                 continue;
 480                                         } else {
 481                                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 482                                                         slap_replenish_sopool(sh);
 483                                                 }
 484                                                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 485                                                 LDAP_LIST_REMOVE(so, so_link);
 486                                                 so->so_ptr = tmpp;
 487                                                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
 488                                                                 so, so_link);
 489                                                 break;
 490
 491                                                 Debug(LDAP_DEBUG_TRACE, "slap_sl_free: "
 492                                                         "free object not found while bit is clear.\n",
 493                                                         0, 0, 0);
 494                                                 assert(so != NULL);
 495
 496                                         }
 497                                 } else {
 498                                         if (!inserted) {
 499                                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 500                                                         slap_replenish_sopool(sh);
 501                                                 }
 502                                                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 503                                                 LDAP_LIST_REMOVE(so, so_link);
 504                                                 so->so_ptr = tmpp;
 505                                                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
 506                                                                 so, so_link);
 507                                         }
 508                                         break;
 509                                 }
 510                         } else {
 511                                 if (!(sh->sh_map[i-order_start][(diff-1)>>3] &
 512                                                 (1<<((diff-1)&0x7)))) {
 513                                         so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
 514                                         while (so) {
 515                                                 if ((char*)so->so_ptr == (char*)tmpp) {
 516                                                         LDAP_LIST_REMOVE(so, so_link);
 517                                                 } else if ((char*)tmpp == (char *)so->so_ptr + order_size) {
 518                                                         LDAP_LIST_REMOVE(so, so_link);
 519                                                         tmpp = so->so_ptr;
 520                                                         break;
 521                                                 }
 522                                                 so = LDAP_LIST_NEXT(so, so_link);
 523                                         }
 524                                         if (so) {
 525                                                 if (i < sh->sh_maxorder) {
 526                                                         inserted = 1;
 527                                                         LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start+1],                                                                    so, so_link);
 528                                                         continue;
 529                                                 }
 530                                         } else {
 531                                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 532                                                         slap_replenish_sopool(sh);
 533                                                 }
 534                                                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 535                                                 LDAP_LIST_REMOVE(so, so_link);
 536                                                 so->so_ptr = tmpp;
 537                                                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
 538                                                                 so, so_link);
 539                                                 break;
 540
 541                                                 Debug(LDAP_DEBUG_TRACE, "slap_sl_free: "
 542                                                         "free object not found while bit is clear.\n",
 543                                                         0, 0, 0 );
 544                                                 assert(so != NULL);
 545
 546                                         }
 547                                 } else {
 548                                         if ( !inserted ) {
 549                                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 550                                                         slap_replenish_sopool(sh);
 551                                                 }
 552                                                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 553                                                 LDAP_LIST_REMOVE(so, so_link);
 554                                                 so->so_ptr = tmpp;
 555                                                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
 556                                                                 so, so_link);
 557                                         }
 558                                         break;
 559                                 }
 560                         }
 561                 }
 562         }
 563 }
 564
 565 void *
 566 slap_sl_context( void *ptr )
 567 {
 568         struct slab_heap *sh;
 569         void *ctx, *sh_tmp;
 570
 571         if ( slapMode & SLAP_TOOL_MODE ) return NULL;
 572
 573 #ifdef NO_THREADS
 574         sh = slheap;
 575 #else
 576         ctx = ldap_pvt_thread_pool_context();
 577
 578         sh_tmp = NULL;
 579         ldap_pvt_thread_pool_getkey(
 580                 ctx, (void *)slap_sl_mem_init, &sh_tmp, NULL);
 581         sh = sh_tmp;
 582 #endif
 583
 584         if (sh && ptr >= sh->sh_base && ptr <= sh->sh_end) {
 585                 return sh;
 586         }
 587         return NULL;
 588 }
 589
 590 static struct slab_object *
 591 slap_replenish_sopool(
 592     struct slab_heap* sh
 593 )
 594 {
 595     struct slab_object *so_block;
 596     int i;
 597
 598     so_block = (struct slab_object *)ch_malloc(
 599                     SLAP_SLAB_SOBLOCK * sizeof(struct slab_object));
 600
 601     if ( so_block == NULL ) {
 602         return NULL;
 603     }
 604
 605     so_block[0].so_blockhead = 1;
 606     LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, &so_block[0], so_link);
 607     for (i = 1; i < SLAP_SLAB_SOBLOCK; i++) {
 608         so_block[i].so_blockhead = 0;
 609         LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, &so_block[i], so_link );
 610     }
 611
 612     return so_block;
 613 }
 614
 615 #ifdef SLAPD_UNUSED
 616 static void
 617 print_slheap(int level, void *ctx)
 618 {
 619         struct slab_heap *sh = ctx;
 620         int order_start = -1;
 621         int pad = 2*sizeof(int)-1, pad_shift;
 622         struct slab_object *so;
 623         int i, j, once = 0;
 624
 625         if (!ctx) {
 626                 Debug(level, "NULL memctx\n", 0, 0, 0);
 627                 return;
 628         }
 629
 630         pad_shift = pad - 1;
 631         do {
 632                 order_start++;
 633         } while (pad_shift >>= 1);
 634
 635         Debug(level, "sh->sh_maxorder=%d\n", sh->sh_maxorder, 0, 0);
 636
 637         for (i = order_start; i <= sh->sh_maxorder; i++) {
 638                 once = 0;
 639                 Debug(level, "order=%d\n", i, 0, 0);
 640                 for (j = 0; j < (1<<(sh->sh_maxorder-i))/8; j++) {
 641                         Debug(level, "%02x ", sh->sh_map[i-order_start][j], 0, 0);
 642                         once = 1;
 643                 }
 644                 if (!once) {
 645                         Debug(level, "%02x ", sh->sh_map[i-order_start][0], 0, 0);
 646                 }
 647                 Debug(level, "\n", 0, 0, 0);
 648                 Debug(level, "free list:\n", 0, 0, 0);
 649                 so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
 650                 while (so) {
 651                         Debug(level, "%lx\n", (unsigned long) so->so_ptr, 0, 0);
 652                         so = LDAP_LIST_NEXT(so, so_link);
 653                 }
 654         }
 655 }
 656 #endif