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-2005 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 = (void *)((char *)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         /* FIXME: missing return; guessing... */
 331         return NULL;
 332 }
 333
 334 void *
 335 slap_sl_calloc( ber_len_t n, ber_len_t size, void *ctx )
 336 {
 337         void *new;
 338
 339         new = slap_sl_malloc( n*size, ctx );
 340         if ( new ) {
 341                 memset( new, 0, n*size );
 342         }
 343         return new;
 344 }
 345
 346 void *
 347 slap_sl_realloc(void *ptr, ber_len_t size, void *ctx)
 348 {
 349         struct slab_heap *sh = ctx;
 350         int size_shift;
 351         int pad = 2*sizeof(int)-1, pad_shift;
 352         int order_start = -1, order = -1;
 353         struct slab_object *so;
 354         ber_len_t *p = (ber_len_t *)ptr, *new;
 355         unsigned long diff;
 356
 357         if (ptr == NULL)
 358                 return slap_sl_malloc(size, ctx);
 359
 360         /* Not our memory? */
 361         if (!sh || ptr < sh->sh_base || ptr >= sh->sh_end) {
 362                 /* duplicate of realloc behavior, oh well */
 363                 new = ber_memrealloc_x(ptr, size, NULL);
 364                 if (new) {
 365                         return new;
 366                 }
 367                 Debug(LDAP_DEBUG_ANY, "ch_realloc of %lu bytes failed\n",
 368                                 (long) size, 0, 0);
 369                 assert(0);
 370                 exit( EXIT_FAILURE );
 371         }
 372
 373         if (size == 0) {
 374                 slap_sl_free(ptr, ctx);
 375                 return NULL;
 376         }
 377
 378         if (sh->sh_stack) {
 379                 /* round up to doubleword boundary */
 380                 size += pad + sizeof( ber_len_t );
 381                 size &= ~pad;
 382
 383                 /* Never shrink blocks */
 384                 if (size <= p[-1]) {
 385                         new = p;
 386
 387                 /* If reallocing the last block, we can grow it */
 388                 } else if ((char *)ptr + p[-1] == sh->sh_last &&
 389                         (char *)ptr + size < (char *)sh->sh_end ) {
 390                         new = p;
 391                         sh->sh_last = (char *)sh->sh_last + size - p[-1];
 392                         p[-1] = size;
 393
 394                 /* Nowhere to grow, need to alloc and copy */
 395                 } else {
 396                         new = slap_sl_malloc(size, ctx);
 397                         AC_MEMCPY(new, ptr, p[-1]);
 398                 }
 399                 return new;
 400         } else {
 401                 void *newptr;
 402                 newptr = slap_sl_malloc(size, ctx);
 403                 if (size < p[-1]) {
 404                         AC_MEMCPY(newptr, ptr, size);
 405                 } else {
 406                         AC_MEMCPY(newptr, ptr, p[-1]);
 407                 }
 408                 slap_sl_free(ptr, ctx);
 409                 return newptr;
 410         }
 411 }
 412
 413 void
 414 slap_sl_free(void *ptr, void *ctx)
 415 {
 416         struct slab_heap *sh = ctx;
 417         int size, size_shift, order_size;
 418         int pad = 2*sizeof(int)-1, pad_shift;
 419         ber_len_t *p = (ber_len_t *)ptr, *tmpp;
 420         int order_start = -1, order = -1;
 421         struct slab_object *so;
 422         unsigned long diff;
 423         int i, k, inserted = 0;
 424
 425         if (!sh || ptr < sh->sh_base || ptr >= sh->sh_end) {
 426                 ber_memfree_x(ptr, NULL);
 427         } else if (sh->sh_stack && (char *)ptr + p[-1] == sh->sh_last) {
 428                 p--;
 429                 sh->sh_last = p;
 430         } else if (!sh->sh_stack) {
 431                 size = *(--p);
 432                 size_shift = size + sizeof(ber_len_t) - 1;
 433                 do {
 434                         order++;
 435                 } while (size_shift >>= 1);
 436
 437                 pad_shift = pad - 1;
 438                 do {
 439                         order_start++;
 440                 } while (pad_shift >>= 1);
 441
 442                 for (i = order, tmpp = p; i <= sh->sh_maxorder; i++) {
 443                         order_size = 1 << (i+1);
 444                         diff = (unsigned long)((char*)tmpp - (char*)sh->sh_base) >> (i+1);
 445                         sh->sh_map[i-order_start][diff>>3] &= (~(1 << (diff & 0x7)));
 446                         if (diff == ((diff>>1)<<1)) {
 447                                 if (!(sh->sh_map[i-order_start][(diff+1)>>3] &
 448                                                 (1<<((diff+1)&0x7)))) {
 449                                         so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
 450                                         while (so) {
 451                                                 if ((char*)so->so_ptr == (char*)tmpp) {
 452                                                         LDAP_LIST_REMOVE( so, so_link );
 453                                                 } else if ((char*)so->so_ptr ==
 454                                                                 (char*)tmpp + order_size) {
 455                                                         LDAP_LIST_REMOVE(so, so_link);
 456                                                         break;
 457                                                 }
 458                                                 so = LDAP_LIST_NEXT(so, so_link);
 459                                         }
 460                                         if (so) {
 461                                                 if (i < sh->sh_maxorder) {
 462                                                         inserted = 1;
 463                                                         so->so_ptr = tmpp;
 464                                                         LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start+1],
 465                                                                         so, so_link);
 466                                                 }
 467                                                 continue;
 468                                         } else {
 469                                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 470                                                         slap_replenish_sopool(sh);
 471                                                 }
 472                                                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 473                                                 LDAP_LIST_REMOVE(so, so_link);
 474                                                 so->so_ptr = tmpp;
 475                                                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
 476                                                                 so, so_link);
 477                                                 break;
 478
 479                                                 Debug(LDAP_DEBUG_TRACE, "slap_sl_free: "
 480                                                         "free object not found while bit is clear.\n",
 481                                                         0, 0, 0);
 482                                                 assert(so);
 483
 484                                         }
 485                                 } else {
 486                                         if (!inserted) {
 487                                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 488                                                         slap_replenish_sopool(sh);
 489                                                 }
 490                                                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 491                                                 LDAP_LIST_REMOVE(so, so_link);
 492                                                 so->so_ptr = tmpp;
 493                                                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
 494                                                                 so, so_link);
 495                                         }
 496                                         break;
 497                                 }
 498                         } else {
 499                                 if (!(sh->sh_map[i-order_start][(diff-1)>>3] &
 500                                                 (1<<((diff-1)&0x7)))) {
 501                                         so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
 502                                         while (so) {
 503                                                 if ((char*)so->so_ptr == (char*)tmpp) {
 504                                                         LDAP_LIST_REMOVE(so, so_link);
 505                                                 } else if ((char*)tmpp == (char *)so->so_ptr + order_size) {
 506                                                         LDAP_LIST_REMOVE(so, so_link);
 507                                                         tmpp = so->so_ptr;
 508                                                         break;
 509                                                 }
 510                                                 so = LDAP_LIST_NEXT(so, so_link);
 511                                         }
 512                                         if (so) {
 513                                                 if (i < sh->sh_maxorder) {
 514                                                         inserted = 1;
 515                                                         LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start+1],                                                                    so, so_link);
 516                                                         continue;
 517                                                 }
 518                                         } else {
 519                                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 520                                                         slap_replenish_sopool(sh);
 521                                                 }
 522                                                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 523                                                 LDAP_LIST_REMOVE(so, so_link);
 524                                                 so->so_ptr = tmpp;
 525                                                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
 526                                                                 so, so_link);
 527                                                 break;
 528
 529                                                 Debug(LDAP_DEBUG_TRACE, "slap_sl_free: "
 530                                                         "free object not found while bit is clear.\n",
 531                                                         0, 0, 0 );
 532                                                 assert( so );
 533
 534                                         }
 535                                 } else {
 536                                         if ( !inserted ) {
 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                                         }
 546                                         break;
 547                                 }
 548                         }
 549                 }
 550         }
 551 }
 552
 553 void *
 554 slap_sl_context( void *ptr )
 555 {
 556         struct slab_heap *sh = NULL;
 557         void *ctx;
 558
 559         if ( slapMode & SLAP_TOOL_MODE ) return NULL;
 560
 561 #ifdef NO_THREADS
 562         sh = slheap;
 563 #else
 564         ctx = ldap_pvt_thread_pool_context();
 565
 566         ldap_pvt_thread_pool_getkey(ctx, (void *)slap_sl_mem_init,
 567                         (void **)&sh, NULL);
 568 #endif
 569
 570         if (sh && ptr >= sh->sh_base && ptr <= sh->sh_end) {
 571                 return sh;
 572         }
 573         return NULL;
 574 }
 575
 576 static struct slab_object *
 577 slap_replenish_sopool(
 578     struct slab_heap* sh
 579 )
 580 {
 581     struct slab_object *so_block;
 582     int i;
 583
 584     so_block = (struct slab_object *)ch_malloc(
 585                     SLAP_SLAB_SOBLOCK * sizeof(struct slab_object));
 586
 587     if ( so_block == NULL ) {
 588         return NULL;
 589     }
 590
 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 );
 596     }
 597
 598     return so_block;
 599 }
 600
 601 static void
 602 print_slheap(int level, void *ctx)
 603 {
 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;
 608         int i, j, once = 0;
 609
 610         if (!ctx) {
 611                 Debug(level, "NULL memctx\n", 0, 0, 0);
 612                 return;
 613         }
 614
 615         pad_shift = pad - 1;
 616         do {
 617                 order_start++;
 618         } while (pad_shift >>= 1);
 619
 620         Debug(level, "sh->sh_maxorder=%d\n", sh->sh_maxorder, 0, 0);
 621
 622         for (i = order_start; i <= sh->sh_maxorder; i++) {
 623                 once = 0;
 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);
 627                         once = 1;
 628                 }
 629                 if (!once) {
 630                         Debug(level, "%02x ", sh->sh_map[i-order_start][0], 0, 0);
 631                 }
 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]);
 635                 while (so) {
 636                         Debug(level, "%lx\n", (unsigned long) so->so_ptr, 0, 0);
 637                         so = LDAP_LIST_NEXT(so, so_link);
 638                 }
 639         }
 640 }