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