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-2007 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 #ifdef SLAP_NO_SL_MALLOC
 265         return ber_malloc_x( size, NULL );
 266 #endif
 267
 268         /* ber_set_option calls us like this */
 269         if (!ctx) return ber_memalloc_x(size, NULL);
 270
 271         /* round up to doubleword boundary */
 272         size += sizeof(ber_len_t) + pad;
 273         size &= ~pad;
 274
 275         if (sh->sh_stack) {
 276                 if ((char *)sh->sh_last + size >= (char *)sh->sh_end) {
 277                         Debug(LDAP_DEBUG_TRACE,
 278                                 "slap_sl_malloc of %lu bytes failed, using ch_malloc\n",
 279                                 (long)size, 0, 0);
 280                         return ch_malloc(size);
 281                 }
 282                 newptr = sh->sh_last;
 283                 *newptr++ = size - sizeof(ber_len_t);
 284                 sh->sh_last = (char *) sh->sh_last + size;
 285                 return( (void *)newptr );
 286         } else {
 287                 size_shift = size - 1;
 288                 do {
 289                         order++;
 290                 } while (size_shift >>= 1);
 291
 292                 pad_shift = pad - 1;
 293                 do {
 294                         order_start++;
 295                 } while (pad_shift >>= 1);
 296
 297                 for (i = order; i <= sh->sh_maxorder &&
 298                                 LDAP_LIST_EMPTY(&sh->sh_free[i-order_start]); i++);
 299
 300                 if (i == order) {
 301                         so_new = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
 302                         LDAP_LIST_REMOVE(so_new, so_link);
 303                         ptr = so_new->so_ptr;
 304                         diff = (unsigned long)((char*)ptr -
 305                                         (char*)sh->sh_base) >> (order + 1);
 306                         sh->sh_map[order-order_start][diff>>3] |= (1 << (diff & 0x7));
 307                         *ptr++ = size - sizeof(ber_len_t);
 308                         LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_new, so_link);
 309                         return((void*)ptr);
 310                 } else if (i <= sh->sh_maxorder) {
 311                         for (j = i; j > order; j--) {
 312                                 so_left = LDAP_LIST_FIRST(&sh->sh_free[j-order_start]);
 313                                 LDAP_LIST_REMOVE(so_left, so_link);
 314                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 315                                         slap_replenish_sopool(sh);
 316                                 }
 317                                 so_right = LDAP_LIST_FIRST(&sh->sh_sopool);
 318                                 LDAP_LIST_REMOVE(so_right, so_link);
 319                                 so_right->so_ptr = (void *)((char *)so_left->so_ptr + (1 << j));
 320                                 if (j == order + 1) {
 321                                         ptr = so_left->so_ptr;
 322                                         diff = (unsigned long)((char*)ptr -
 323                                                         (char*)sh->sh_base) >> (order+1);
 324                                         sh->sh_map[order-order_start][diff>>3] |=
 325                                                         (1 << (diff & 0x7));
 326                                         *ptr++ = size - sizeof(ber_len_t);
 327                                         LDAP_LIST_INSERT_HEAD(
 328                                                         &sh->sh_free[j-1-order_start], so_right, so_link);
 329                                         LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, so_left, so_link);
 330                                         return((void*)ptr);
 331                                 } else {
 332                                         LDAP_LIST_INSERT_HEAD(
 333                                                         &sh->sh_free[j-1-order_start], so_right, so_link);
 334                                         LDAP_LIST_INSERT_HEAD(
 335                                                         &sh->sh_free[j-1-order_start], so_left, so_link);
 336                                 }
 337                         }
 338                 } else {
 339                         Debug( LDAP_DEBUG_TRACE,
 340                                 "slap_sl_malloc of %lu bytes failed, using ch_malloc\n",
 341                                 (long)size, 0, 0);
 342                         return (void*)ch_malloc(size);
 343                 }
 344         }
 345
 346         /* FIXME: missing return; guessing... */
 347         return NULL;
 348 }
 349
 350 void *
 351 slap_sl_calloc( ber_len_t n, ber_len_t size, void *ctx )
 352 {
 353         void *newptr;
 354
 355         newptr = slap_sl_malloc( n*size, ctx );
 356         if ( newptr ) {
 357                 memset( newptr, 0, n*size );
 358         }
 359         return newptr;
 360 }
 361
 362 void *
 363 slap_sl_realloc(void *ptr, ber_len_t size, void *ctx)
 364 {
 365         struct slab_heap *sh = ctx;
 366         int pad = 2*sizeof(int) -1;
 367         ber_len_t *p = (ber_len_t *)ptr, *newptr;
 368
 369         if (ptr == NULL)
 370                 return slap_sl_malloc(size, ctx);
 371
 372 #ifdef SLAP_NO_SL_MALLOC
 373         return ber_memrealloc_x( ptr, size, NULL );
 374 #endif
 375
 376         /* Not our memory? */
 377         if (!sh || ptr < sh->sh_base || ptr >= sh->sh_end) {
 378                 /* duplicate of realloc behavior, oh well */
 379                 newptr = ber_memrealloc_x(ptr, size, NULL);
 380                 if (newptr) {
 381                         return newptr;
 382                 }
 383                 Debug(LDAP_DEBUG_ANY, "ch_realloc of %lu bytes failed\n",
 384                                 (long) size, 0, 0);
 385                 assert(0);
 386                 exit( EXIT_FAILURE );
 387         }
 388
 389         if (size == 0) {
 390                 slap_sl_free(ptr, ctx);
 391                 return NULL;
 392         }
 393
 394         if (sh->sh_stack) {
 395                 /* round up to doubleword boundary */
 396                 size += pad + sizeof( ber_len_t );
 397                 size &= ~pad;
 398
 399                 /* Never shrink blocks */
 400                 if (size <= p[-1]) {
 401                         newptr = p;
 402
 403                 /* If reallocing the last block, we can grow it */
 404                 } else if ((char *)ptr + p[-1] == sh->sh_last &&
 405                         (char *)ptr + size < (char *)sh->sh_end ) {
 406                         newptr = p;
 407                         sh->sh_last = (char *)sh->sh_last + size - p[-1];
 408                         p[-1] = size;
 409
 410                 /* Nowhere to grow, need to alloc and copy */
 411                 } else {
 412                         newptr = slap_sl_malloc(size, ctx);
 413                         AC_MEMCPY(newptr, ptr, p[-1]);
 414                 }
 415                 return newptr;
 416         } else {
 417                 void *newptr2;
 418
 419                 newptr2 = slap_sl_malloc(size, ctx);
 420                 if (size < p[-1]) {
 421                         AC_MEMCPY(newptr2, ptr, size);
 422                 } else {
 423                         AC_MEMCPY(newptr2, ptr, p[-1]);
 424                 }
 425                 slap_sl_free(ptr, ctx);
 426                 return newptr2;
 427         }
 428 }
 429
 430 void
 431 slap_sl_free(void *ptr, void *ctx)
 432 {
 433         struct slab_heap *sh = ctx;
 434         int size, size_shift, order_size;
 435         int pad = 2*sizeof(int)-1, pad_shift;
 436         ber_len_t *p = (ber_len_t *)ptr, *tmpp;
 437         int order_start = -1, order = -1;
 438         struct slab_object *so;
 439         unsigned long diff;
 440         int i, inserted = 0;
 441
 442         if (!ptr)
 443                 return;
 444
 445 #ifdef SLAP_NO_SL_MALLOC
 446         ber_memfree_x( ptr, NULL );
 447         return;
 448 #endif
 449
 450         if (!sh || ptr < sh->sh_base || ptr >= sh->sh_end) {
 451                 ber_memfree_x(ptr, NULL);
 452         } else if (sh->sh_stack && (char *)ptr + p[-1] == sh->sh_last) {
 453                 p--;
 454                 sh->sh_last = p;
 455         } else if (!sh->sh_stack) {
 456                 size = *(--p);
 457                 size_shift = size + sizeof(ber_len_t) - 1;
 458                 do {
 459                         order++;
 460                 } while (size_shift >>= 1);
 461
 462                 pad_shift = pad - 1;
 463                 do {
 464                         order_start++;
 465                 } while (pad_shift >>= 1);
 466
 467                 for (i = order, tmpp = p; i <= sh->sh_maxorder; i++) {
 468                         order_size = 1 << (i+1);
 469                         diff = (unsigned long)((char*)tmpp - (char*)sh->sh_base) >> (i+1);
 470                         sh->sh_map[i-order_start][diff>>3] &= (~(1 << (diff & 0x7)));
 471                         if (diff == ((diff>>1)<<1)) {
 472                                 if (!(sh->sh_map[i-order_start][(diff+1)>>3] &
 473                                                 (1<<((diff+1)&0x7)))) {
 474                                         so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
 475                                         while (so) {
 476                                                 if ((char*)so->so_ptr == (char*)tmpp) {
 477                                                         LDAP_LIST_REMOVE( so, so_link );
 478                                                 } else if ((char*)so->so_ptr ==
 479                                                                 (char*)tmpp + order_size) {
 480                                                         LDAP_LIST_REMOVE(so, so_link);
 481                                                         break;
 482                                                 }
 483                                                 so = LDAP_LIST_NEXT(so, so_link);
 484                                         }
 485                                         if (so) {
 486                                                 if (i < sh->sh_maxorder) {
 487                                                         inserted = 1;
 488                                                         so->so_ptr = tmpp;
 489                                                         LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start+1],
 490                                                                         so, so_link);
 491                                                 }
 492                                                 continue;
 493                                         } else {
 494                                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 495                                                         slap_replenish_sopool(sh);
 496                                                 }
 497                                                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 498                                                 LDAP_LIST_REMOVE(so, so_link);
 499                                                 so->so_ptr = tmpp;
 500                                                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
 501                                                                 so, so_link);
 502                                                 break;
 503
 504                                                 Debug(LDAP_DEBUG_TRACE, "slap_sl_free: "
 505                                                         "free object not found while bit is clear.\n",
 506                                                         0, 0, 0);
 507                                                 assert(so != NULL);
 508
 509                                         }
 510                                 } else {
 511                                         if (!inserted) {
 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                                         }
 521                                         break;
 522                                 }
 523                         } else {
 524                                 if (!(sh->sh_map[i-order_start][(diff-1)>>3] &
 525                                                 (1<<((diff-1)&0x7)))) {
 526                                         so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
 527                                         while (so) {
 528                                                 if ((char*)so->so_ptr == (char*)tmpp) {
 529                                                         LDAP_LIST_REMOVE(so, so_link);
 530                                                 } else if ((char*)tmpp == (char *)so->so_ptr + order_size) {
 531                                                         LDAP_LIST_REMOVE(so, so_link);
 532                                                         tmpp = so->so_ptr;
 533                                                         break;
 534                                                 }
 535                                                 so = LDAP_LIST_NEXT(so, so_link);
 536                                         }
 537                                         if (so) {
 538                                                 if (i < sh->sh_maxorder) {
 539                                                         inserted = 1;
 540                                                         LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start+1],                                                                    so, so_link);
 541                                                         continue;
 542                                                 }
 543                                         } else {
 544                                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 545                                                         slap_replenish_sopool(sh);
 546                                                 }
 547                                                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 548                                                 LDAP_LIST_REMOVE(so, so_link);
 549                                                 so->so_ptr = tmpp;
 550                                                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
 551                                                                 so, so_link);
 552                                                 break;
 553
 554                                                 Debug(LDAP_DEBUG_TRACE, "slap_sl_free: "
 555                                                         "free object not found while bit is clear.\n",
 556                                                         0, 0, 0 );
 557                                                 assert(so != NULL);
 558
 559                                         }
 560                                 } else {
 561                                         if ( !inserted ) {
 562                                                 if (LDAP_LIST_EMPTY(&sh->sh_sopool)) {
 563                                                         slap_replenish_sopool(sh);
 564                                                 }
 565                                                 so = LDAP_LIST_FIRST(&sh->sh_sopool);
 566                                                 LDAP_LIST_REMOVE(so, so_link);
 567                                                 so->so_ptr = tmpp;
 568                                                 LDAP_LIST_INSERT_HEAD(&sh->sh_free[i-order_start],
 569                                                                 so, so_link);
 570                                         }
 571                                         break;
 572                                 }
 573                         }
 574                 }
 575         }
 576 }
 577
 578 void *
 579 slap_sl_context( void *ptr )
 580 {
 581         struct slab_heap *sh;
 582         void *ctx, *sh_tmp;
 583
 584         if ( slapMode & SLAP_TOOL_MODE ) return NULL;
 585
 586 #ifdef NO_THREADS
 587         sh = slheap;
 588 #else
 589         ctx = ldap_pvt_thread_pool_context();
 590
 591         sh_tmp = NULL;
 592         ldap_pvt_thread_pool_getkey(
 593                 ctx, (void *)slap_sl_mem_init, &sh_tmp, NULL);
 594         sh = sh_tmp;
 595 #endif
 596
 597         if (sh && ptr >= sh->sh_base && ptr <= sh->sh_end) {
 598                 return sh;
 599         }
 600         return NULL;
 601 }
 602
 603 static struct slab_object *
 604 slap_replenish_sopool(
 605     struct slab_heap* sh
 606 )
 607 {
 608     struct slab_object *so_block;
 609     int i;
 610
 611     so_block = (struct slab_object *)ch_malloc(
 612                     SLAP_SLAB_SOBLOCK * sizeof(struct slab_object));
 613
 614     if ( so_block == NULL ) {
 615         return NULL;
 616     }
 617
 618     so_block[0].so_blockhead = 1;
 619     LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, &so_block[0], so_link);
 620     for (i = 1; i < SLAP_SLAB_SOBLOCK; i++) {
 621         so_block[i].so_blockhead = 0;
 622         LDAP_LIST_INSERT_HEAD(&sh->sh_sopool, &so_block[i], so_link );
 623     }
 624
 625     return so_block;
 626 }
 627
 628 #ifdef SLAPD_UNUSED
 629 static void
 630 print_slheap(int level, void *ctx)
 631 {
 632         struct slab_heap *sh = ctx;
 633         int order_start = -1;
 634         int pad = 2*sizeof(int)-1, pad_shift;
 635         struct slab_object *so;
 636         int i, j, once = 0;
 637
 638         if (!ctx) {
 639                 Debug(level, "NULL memctx\n", 0, 0, 0);
 640                 return;
 641         }
 642
 643         pad_shift = pad - 1;
 644         do {
 645                 order_start++;
 646         } while (pad_shift >>= 1);
 647
 648         Debug(level, "sh->sh_maxorder=%d\n", sh->sh_maxorder, 0, 0);
 649
 650         for (i = order_start; i <= sh->sh_maxorder; i++) {
 651                 once = 0;
 652                 Debug(level, "order=%d\n", i, 0, 0);
 653                 for (j = 0; j < (1<<(sh->sh_maxorder-i))/8; j++) {
 654                         Debug(level, "%02x ", sh->sh_map[i-order_start][j], 0, 0);
 655                         once = 1;
 656                 }
 657                 if (!once) {
 658                         Debug(level, "%02x ", sh->sh_map[i-order_start][0], 0, 0);
 659                 }
 660                 Debug(level, "\n", 0, 0, 0);
 661                 Debug(level, "free list:\n", 0, 0, 0);
 662                 so = LDAP_LIST_FIRST(&sh->sh_free[i-order_start]);
 663                 while (so) {
 664                         Debug(level, "%lx\n", (unsigned long) so->so_ptr, 0, 0);
 665                         so = LDAP_LIST_NEXT(so, so_link);
 666                 }
 667         }
 668 }
 669 #endif