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