1 /* sl_malloc.c - malloc routines using a per-thread slab */
4 * Copyright 2003 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
11 #include <ac/string.h>
27 struct slab_heap *sh = data;
29 ber_memfree_x(sh->h_base, NULL);
30 ber_memfree_x(sh, NULL);
33 BER_MEMALLOC_FN sl_malloc;
34 BER_MEMCALLOC_FN sl_calloc;
35 BER_MEMREALLOC_FN sl_realloc;
36 BER_MEMFREE_FN sl_free;
39 BerMemoryFunctions sl_mfuncs =
40 { sl_malloc, sl_calloc, sl_realloc, sl_free };
45 ber_set_option( NULL, LBER_OPT_MEMORY_FNS, &sl_mfuncs );
54 struct slab_heap *sh = NULL;
55 int pad = 2*sizeof(int)-1;
57 ldap_pvt_thread_pool_getkey( ctx, sl_mem_init, (void **)&sh, NULL );
59 /* round up to doubleword boundary */
64 sh = ch_malloc( sizeof(struct slab_heap) );
65 sh->h_base = ch_malloc( size );
66 ldap_pvt_thread_pool_setkey( ctx, sl_mem_init, (void *)sh, sl_mem_destroy );
67 } else if ( size > (char *) sh->h_end - (char *) sh->h_base ) {
68 sh->h_base = ch_realloc( sh->h_base, size );
70 sh->h_last = sh->h_base;
71 sh->h_end = (char *) sh->h_base + size;
81 ldap_pvt_thread_pool_setkey( ctx, sl_mem_init, NULL, NULL );
90 struct slab_heap *sh = ctx;
91 int pad = 2*sizeof(int)-1;
94 /* ber_set_option calls us like this */
95 if (!ctx) return ber_memalloc_x( size, NULL );
97 /* round up to doubleword boundary */
98 size += pad + sizeof( ber_len_t );
101 if ((char *) sh->h_last + size >= (char *) sh->h_end ) {
103 LDAP_LOG( OPERATION, INFO,
104 "sl_malloc of %lu bytes failed, using ch_malloc\n", (long)size, 0,0 );
106 Debug( LDAP_DEBUG_TRACE,
107 "sl_malloc of %lu bytes failed, using ch_malloc\n", (long)size, 0,0 );
109 return ch_malloc( size );
112 *new++ = size - sizeof(ber_len_t);
113 sh->h_last = (char *) sh->h_last + size;
115 return( (void *)new );
119 sl_calloc( ber_len_t n, ber_len_t size, void *ctx )
123 new = sl_malloc( n*size, ctx );
125 memset( new, 0, n*size );
131 sl_realloc( void *ptr, ber_len_t size, void *ctx )
133 struct slab_heap *sh = ctx;
134 int pad = 2*sizeof(int)-1;
135 ber_len_t *p = (ber_len_t *)ptr;
138 if ( ptr == NULL ) return sl_malloc( size, ctx );
140 /* Not our memory? */
141 if ( !sh || ptr < sh->h_base || ptr >= sh->h_end ) {
142 /* duplicate of ch_realloc behavior, oh well */
143 new = ber_memrealloc_x( ptr, size, NULL );
148 LDAP_LOG( OPERATION, ERR,
149 "ch_realloc: reallocation of %lu bytes failed\n", (long)size, 0,0 );
151 Debug( LDAP_DEBUG_ANY, "ch_realloc of %lu bytes failed\n",
155 exit( EXIT_FAILURE );
163 /* round up to doubleword boundary */
164 size += pad + sizeof( ber_len_t );
167 /* Never shrink blocks */
171 /* If reallocing the last block, we can grow it */
172 } else if ( (char *)ptr + p[-1] == sh->h_last ) {
174 sh->h_last = (char *) sh->h_last + size - p[-1];
177 /* Nowhere to grow, need to alloc and copy */
179 new = sl_malloc( size, ctx );
180 AC_MEMCPY( new, ptr, p[-1] );
186 sl_free( void *ptr, void *ctx )
188 struct slab_heap *sh = ctx;
189 ber_len_t *p = (ber_len_t *)ptr;
191 if ( !sh || ptr < sh->h_base || ptr >= sh->h_end ) {
192 ber_memfree_x( ptr, NULL );
193 } else if ( (char *)ptr + p[-1] == sh->h_last ) {
200 sl_release( void *ptr, void *ctx )
202 struct slab_heap *sh = ctx;
204 if ( sh && ptr >= sh->h_base && ptr <= sh->h_end ) {
212 struct slab_heap *sh = ctx;
215 if (sh) ret = sh->h_last;
221 sl_context( void *ptr )
223 struct slab_heap *sh = NULL;
226 ctx = ldap_pvt_thread_pool_context();
228 ldap_pvt_thread_pool_getkey( ctx, sl_mem_init, (void **)&sh, NULL );
230 if ( sh && ptr >= sh->h_base && ptr <= sh->h_end ) {