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         ber_set_option( NULL, LBER_OPT_MEMORY_FNS, NULL );
  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                         sh->sh_base = ch_realloc(sh->sh_base, size);
 132                 }
 133                 sh->sh_last = sh->sh_base;
 134                 sh->sh_end = (char *) sh->sh_base + size;
 135                 sh->sh_stack = stack;
 136                 return sh;
 137         } else {
 138                 size_shift = size - 1;
 139                 do {
 140                         order_end++;
 141                 } while (size_shift >>= 1);
 142
 143                 pad_shift = pad - 1;
 144                 do {
 145                         order_start++;
 146                 } while (pad_shift >>= 1);
 147
 148                 order = order_end - order_start + 1;
 149
 150                 if (!sh) {
 151                         sh = (struct slab_heap *) ch_malloc(sizeof(struct slab_heap));
 152                         sh->sh_base = ch_malloc(size);
 153 #ifdef NO_THREADS
 154                         slheap = sh;
 155 #else
 156                         ldap_pvt_thread_pool_setkey(ctx, (void *)slap_sl_mem_init,
 157                                 (void *)sh, slap_sl_mem_destroy);
 158 #endif
 159                 } else {
 160                         for (i = 0; i <= sh->sh_maxorder - order_start; i++) {
 161                                 so = LDAP_LIST_FIRST(&sh->sh_free[i]);
 162                                 while (so) {
 163                                         struct slab_object *so_tmp = so;
 164                                         so = LDAP_LIST_NEXT(so, so_link);
 165                                         LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_tmp, so_link);
 166                                 }
 167                                 ch_free(sh->sh_map[i]);
 168                         }
 169                         ch_free(sh->sh_free);
 170                         ch_free(sh->sh_map);
 171
 172                         so = LDAP_LIST_FIRST(&sh->sh_sopool);
 173                         while (so) {
 174                                 struct slab_object *so_tmp = so;
 175                                 so = LDAP_LIST_NEXT(so, so_link);
 176                                 if (!so_tmp->so_blockhead) {
 177                                         LDAP_LIST_REMOVE(so_tmp, so_link);
 178                                 }
 179                         }
 180                         so = LDAP_LIST_FIRST(&sh->sh_sopool);
 181                         while (so) {
 182                                 struct slab_object *so_tmp = so;
 183                                 so = LDAP_LIST_NEXT(so, so_link);
 184                                 ch_free(so_tmp);
 185                         }
 186
 187                         if (size > (char *)sh->sh_end - (char *)sh->sh_base) {
 188                                 sh->sh_base = realloc(sh->sh_base, size);
 189                         }
 190                 }
 191                 sh->sh_end = (char *)sh->sh_base + size;
 192                 sh->sh_maxorder = order_end;
 193
 194                 sh->sh_free = (struct sh_freelist *)
 195                                                 ch_malloc(order * sizeof(struct sh_freelist));
 196                 for (i = 0; i < order; i++) {
 197                         LDAP_LIST_INIT(&sh->sh_free[i]);
 198                 }
 199
 200                 LDAP_LIST_INIT(&sh->sh_sopool);
 201
 202                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 203                         slap_replenish_sopool(sh);
 204                 }
 205                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 206                 LDAP_LIST_REMOVE(so, so_link);
 207                 so->so_ptr = sh->sh_base;
 208
 209                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[order-1], so, so_link);
 210
 211                 sh->sh_map = (unsigned char **)
 212                                         ch_malloc(order * sizeof(unsigned char *));
 213                 for (i = 0; i < order; i++) {
 214                         int shiftamt = order_start + 1 + i;
 215                         int nummaps = size >> shiftamt;
 216                         assert(nummaps);
 217                         nummaps >>= 3;
 218                         if (!nummaps) nummaps = 1;
 219                         sh->sh_map[i] = (unsigned char *) ch_malloc(nummaps);
 220                         memset(sh->sh_map[i], 0, nummaps);
 221                 }
 222                 sh->sh_stack = stack;
 223                 return sh;
 224         }
 225 }
 226
 227 void
 228 slap_sl_mem_detach(
 229         void *ctx,
 230         void *memctx
 231 )
 232 {
 233 #ifdef NO_THREADS
 234         slheap = NULL;
 235 #else
 236         /* separate from context */
 237         ldap_pvt_thread_pool_setkey( ctx, (void *)slap_sl_mem_init, NULL, NULL );
 238 #endif
 239 }
 240
 241 void *
 242 slap_sl_malloc(
 243     ber_len_t   size,
 244     void *ctx
 245 )
 246 {
 247         struct slab_heap *sh = ctx;
 248         ber_len_t size_shift;
 249         int pad = 2*sizeof(int)-1, pad_shift;
 250         int order = -1, order_start = -1;
 251         struct slab_object *so_new, *so_left, *so_right;
 252         ber_len_t *ptr, *new;
 253         unsigned long diff;
 254         int i, j;
 255
 256         /* ber_set_option calls us like this */
 257         if (!ctx) return ber_memalloc_x(size, NULL);
 258
 259         /* round up to doubleword boundary */
 260         size += sizeof(ber_len_t) + pad;
 261         size &= ~pad;
 262
 263         if (sh->sh_stack) {
 264                 if ((char *)sh->sh_last + size >= (char *)sh->sh_end) {
 265                         Debug(LDAP_DEBUG_TRACE,
 266                                 "slap_sl_malloc of %lu bytes failed, using ch_malloc\n",
 267                                 (long)size, 0, 0);
 268                         return ch_malloc(size);
 269                 }
 270                 new = sh->sh_last;
 271                 *new++ = size - sizeof(ber_len_t);
 272                 sh->sh_last = (char *) sh->sh_last + size;
 273                 return( (void *)new );
 274         } else {
 275                 size_shift = size - 1;
 276                 do {
 277                         order++;
 278                 } while (size_shift >>= 1);
 279
 280                 pad_shift = pad - 1;
 281                 do {
 282                         order_start++;
 283                 } while (pad_shift >>= 1);
 284
 285                 for (i = order; i <= sh->sh_maxorder &&
 286                                 LDAP_LIST_EMPTY(&sh->sh_free[i-order_start]); i++);
 287
 288                 if (i == order) {
 289                         so_new = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
 290                         LDAP_LIST_REMOVE(so_new, so_link);
 291                         ptr = so_new->so_ptr;
 292                         diff = (unsigned long)((char*)ptr -
 293                                         (char*)sh->sh_base) >> (order + 1);
 294                         sh->sh_map[order-order_start][diff>>3] |= (1 << (diff & 0x7));
 295                         *ptr++ = size - sizeof(ber_len_t);
 296                         LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_new, so_link);
 297                         return((void*)ptr);
 298                 } else if (i <= sh->sh_maxorder) {
 299                         for (j = i; j > order; j--) {
 300                                 so_left = LDAP_LIST_FIRST(&sh->sh_free[j-order_start]);
 301                                 LDAP_LIST_REMOVE(so_left, so_link);
 302                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 303                                         slap_replenish_sopool(sh);
 304                                 }
 305                                 so_right = LDAP_LIST_FIRST(&sh->sh_sopool);
 306                                 LDAP_LIST_REMOVE(so_right, so_link);
 307                                 so_right->so_ptr = (void *)((char *)so_left->so_ptr + (1 << j));
 308                                 if (j == order + 1) {
 309                                         ptr = so_left->so_ptr;
 310                                         diff = (unsigned long)((char*)ptr -
 311                                                         (char*)sh->sh_base) >> (order+1);
 312                                         sh->sh_map[order-order_start][diff>>3] |=
 313                                                         (1 << (diff & 0x7));
 314                                         *ptr++ = size - sizeof(ber_len_t);
 315                                         LDAP_LIST_INSERT_HEAD(
 316                                                         &sh->sh_free[j-1-order_start], so_right, so_link);
 317                                         LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_left, so_link);
 318                                         return((void*)ptr);
 319                                 } else {
 320                                         LDAP_LIST_INSERT_HEAD(
 321                                                         &sh->sh_free[j-1-order_start], so_right, so_link);
 322                                         LDAP_LIST_INSERT_HEAD(
 323                                                         &sh->sh_free[j-1-order_start], so_left, so_link);
 324                                 }
 325                         }
 326                 } else {
 327                         Debug( LDAP_DEBUG_TRACE,
 328                                 "slap_sl_malloc of %lu bytes failed, using ch_malloc\n",
 329                                 (long)size, 0, 0);
 330                         return (void*)ch_malloc(size);
 331                 }
 332         }
 333
 334         /* FIXME: missing return; guessing... */
 335         return NULL;
 336 }
 337
 338 void *
 339 slap_sl_calloc( ber_len_t n, ber_len_t size, void *ctx )
 340 {
 341         void *new;
 342
 343         new = slap_sl_malloc( n*size, ctx );
 344         if ( new ) {
 345                 memset( new, 0, n*size );
 346         }
 347         return new;
 348 }
 349
 350 void *
 351 slap_sl_realloc(void *ptr, ber_len_t size, void *ctx)
 352 {
 353         struct slab_heap *sh = ctx;
 354         int pad = 2*sizeof(int) -1;
 355         ber_len_t *p = (ber_len_t *)ptr, *new;
 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, 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 != NULL);
 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 != NULL);
 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;
 557         void *ctx, *sh_tmp;
 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         sh_tmp = NULL;
 567         ldap_pvt_thread_pool_getkey(
 568                 ctx, (void *)slap_sl_mem_init, &sh_tmp, NULL);
 569         sh = sh_tmp;
 570 #endif
 571
 572         if (sh && ptr >= sh->sh_base && ptr <= sh->sh_end) {
 573                 return sh;
 574         }
 575         return NULL;
 576 }
 577
 578 static struct slab_object *
 579 slap_replenish_sopool(
 580     struct slab_heap* sh
 581 )
 582 {
 583     struct slab_object *so_block;
 584     int i;
 585
 586     so_block = (struct slab_object *)ch_malloc(
 587                     SLAP_SLAB_SOBLOCK * sizeof(struct slab_object));
 588
 589     if ( so_block == NULL ) {
 590         return NULL;
 591     }
 592
 593     so_block[0].so_blockhead = 1;
 594     LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, &so_block[0], so_link);
 595     for (i = 1; i < SLAP_SLAB_SOBLOCK; i++) {
 596         so_block[i].so_blockhead = 0;
 597         LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, &so_block[i], so_link );
 598     }
 599
 600     return so_block;
 601 }
 602
 603 static void
 604 print_slheap(int level, void *ctx)
 605 {
 606         struct slab_heap *sh = ctx;
 607         int order_start = -1;
 608         int pad = 2*sizeof(int)-1, pad_shift;
 609         struct slab_object *so;
 610         int i, j, once = 0;
 611
 612         if (!ctx) {
 613                 Debug(level, "NULL memctx\n", 0, 0, 0);
 614                 return;
 615         }
 616
 617         pad_shift = pad - 1;
 618         do {
 619                 order_start++;
 620         } while (pad_shift >>= 1);
 621
 622         Debug(level, "sh->sh_maxorder=%d\n", sh->sh_maxorder, 0, 0);
 623
 624         for (i = order_start; i <= sh->sh_maxorder; i++) {
 625                 once = 0;
 626                 Debug(level, "order=%d\n", i, 0, 0);
 627                 for (j = 0; j < (1<<(sh->sh_maxorder-i))/8; j++) {
 628                         Debug(level, "%02x ", sh->sh_map[i-order_start][j], 0, 0);
 629                         once = 1;
 630                 }
 631                 if (!once) {
 632                         Debug(level, "%02x ", sh->sh_map[i-order_start][0], 0, 0);
 633                 }
 634                 Debug(level, "\n", 0, 0, 0);
 635                 Debug(level, "free list:\n", 0, 0, 0);
 636                 so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
 637                 while (so) {
 638                         Debug(level, "%lx\n", (unsigned long) so->so_ptr, 0, 0);
 639                         so = LDAP_LIST_NEXT(so, so_link);
 640                 }
 641         }
 642 }