Commit | Line | Data |
---|---|---|
d24c33a4 JA |
1 | /* |
2 | * simple memory allocator, backed by mmap() so that it hands out memory | |
3 | * that can be shared across processes and threads | |
4 | */ | |
5 | #include <sys/mman.h> | |
d24c33a4 JA |
6 | #include <assert.h> |
7 | #include <string.h> | |
d24c33a4 | 8 | |
248c9436 | 9 | #include "fio.h" |
971caeb1 | 10 | #include "fio_sem.h" |
3a8600b4 | 11 | #include "os/os.h" |
10aa136b | 12 | #include "smalloc.h" |
b0f0326a | 13 | #include "log.h" |
d24c33a4 | 14 | |
55f6491d | 15 | #define SMALLOC_REDZONE /* define to detect memory corruption */ |
d24c33a4 | 16 | |
ec996e9c JA |
17 | #define SMALLOC_BPB 32 /* block size, bytes-per-bit in bitmap */ |
18 | #define SMALLOC_BPI (sizeof(unsigned int) * 8) | |
19 | #define SMALLOC_BPL (SMALLOC_BPB * SMALLOC_BPI) | |
20 | ||
23bd40f9 | 21 | #define INITIAL_SIZE 16*1024*1024 /* new pool size */ |
5f9454a2 JA |
22 | #define INITIAL_POOLS 8 /* maximum number of pools to setup */ |
23 | ||
24 | #define MAX_POOLS 16 | |
d24c33a4 | 25 | |
55f6491d JA |
26 | #define SMALLOC_PRE_RED 0xdeadbeefU |
27 | #define SMALLOC_POST_RED 0x5aa55aa5U | |
55f6491d | 28 | |
2b386d25 | 29 | unsigned int smalloc_pool_size = INITIAL_SIZE; |
aa1af5fd | 30 | #ifdef SMALLOC_REDZONE |
10aa136b | 31 | static const int int_mask = sizeof(int) - 1; |
aa1af5fd | 32 | #endif |
2b386d25 | 33 | |
d24c33a4 | 34 | struct pool { |
971caeb1 | 35 | struct fio_sem *lock; /* protects this pool */ |
d24c33a4 | 36 | void *map; /* map of blocks */ |
ec996e9c | 37 | unsigned int *bitmap; /* blocks free/busy map */ |
a3ebe7e0 JA |
38 | size_t free_blocks; /* free blocks */ |
39 | size_t nr_blocks; /* total blocks */ | |
40 | size_t next_non_full; | |
41 | size_t mmap_size; | |
ec996e9c JA |
42 | }; |
43 | ||
44 | struct block_hdr { | |
a3ebe7e0 | 45 | size_t size; |
ec996e9c JA |
46 | #ifdef SMALLOC_REDZONE |
47 | unsigned int prered; | |
48 | #endif | |
d24c33a4 JA |
49 | }; |
50 | ||
38b253f3 VF |
51 | /* |
52 | * This suppresses the voluminous potential bitmap printout when | |
53 | * smalloc encounters an OOM error | |
54 | */ | |
55 | static const bool enable_smalloc_debug = false; | |
56 | ||
d24c33a4 JA |
57 | static struct pool mp[MAX_POOLS]; |
58 | static unsigned int nr_pools; | |
59 | static unsigned int last_pool; | |
d24c33a4 | 60 | |
d24c33a4 JA |
61 | static inline int ptr_valid(struct pool *pool, void *ptr) |
62 | { | |
dcb69098 | 63 | unsigned int pool_size = pool->nr_blocks * SMALLOC_BPL; |
ec996e9c JA |
64 | |
65 | return (ptr >= pool->map) && (ptr < pool->map + pool_size); | |
d24c33a4 JA |
66 | } |
67 | ||
a3ebe7e0 | 68 | static inline size_t size_to_blocks(size_t size) |
808e9ea8 JA |
69 | { |
70 | return (size + SMALLOC_BPB - 1) / SMALLOC_BPB; | |
71 | } | |
72 | ||
dcb69098 | 73 | static int blocks_iter(struct pool *pool, unsigned int pool_idx, |
a3ebe7e0 | 74 | unsigned int idx, size_t nr_blocks, |
ec996e9c | 75 | int (*func)(unsigned int *map, unsigned int mask)) |
d24c33a4 | 76 | { |
dcb69098 | 77 | |
ec996e9c JA |
78 | while (nr_blocks) { |
79 | unsigned int this_blocks, mask; | |
dcb69098 JA |
80 | unsigned int *map; |
81 | ||
82 | if (pool_idx >= pool->nr_blocks) | |
83 | return 0; | |
84 | ||
85 | map = &pool->bitmap[pool_idx]; | |
ec996e9c JA |
86 | |
87 | this_blocks = nr_blocks; | |
88 | if (this_blocks + idx > SMALLOC_BPI) { | |
89 | this_blocks = SMALLOC_BPI - idx; | |
90 | idx = SMALLOC_BPI - this_blocks; | |
91 | } | |
92 | ||
93 | if (this_blocks == SMALLOC_BPI) | |
94 | mask = -1U; | |
95 | else | |
96 | mask = ((1U << this_blocks) - 1) << idx; | |
97 | ||
98 | if (!func(map, mask)) | |
99 | return 0; | |
100 | ||
101 | nr_blocks -= this_blocks; | |
102 | idx = 0; | |
dcb69098 | 103 | pool_idx++; |
ec996e9c JA |
104 | } |
105 | ||
106 | return 1; | |
d24c33a4 JA |
107 | } |
108 | ||
ec996e9c | 109 | static int mask_cmp(unsigned int *map, unsigned int mask) |
d24c33a4 | 110 | { |
ec996e9c | 111 | return !(*map & mask); |
d24c33a4 JA |
112 | } |
113 | ||
ec996e9c | 114 | static int mask_clear(unsigned int *map, unsigned int mask) |
d24c33a4 | 115 | { |
dcb69098 | 116 | assert((*map & mask) == mask); |
ec996e9c JA |
117 | *map &= ~mask; |
118 | return 1; | |
d24c33a4 JA |
119 | } |
120 | ||
ec996e9c | 121 | static int mask_set(unsigned int *map, unsigned int mask) |
d24c33a4 | 122 | { |
dcb69098 | 123 | assert(!(*map & mask)); |
ec996e9c JA |
124 | *map |= mask; |
125 | return 1; | |
d24c33a4 JA |
126 | } |
127 | ||
dcb69098 | 128 | static int blocks_free(struct pool *pool, unsigned int pool_idx, |
a3ebe7e0 | 129 | unsigned int idx, size_t nr_blocks) |
d24c33a4 | 130 | { |
dcb69098 | 131 | return blocks_iter(pool, pool_idx, idx, nr_blocks, mask_cmp); |
d24c33a4 JA |
132 | } |
133 | ||
dcb69098 | 134 | static void set_blocks(struct pool *pool, unsigned int pool_idx, |
a3ebe7e0 | 135 | unsigned int idx, size_t nr_blocks) |
d24c33a4 | 136 | { |
dcb69098 | 137 | blocks_iter(pool, pool_idx, idx, nr_blocks, mask_set); |
d24c33a4 JA |
138 | } |
139 | ||
dcb69098 | 140 | static void clear_blocks(struct pool *pool, unsigned int pool_idx, |
a3ebe7e0 | 141 | unsigned int idx, size_t nr_blocks) |
d24c33a4 | 142 | { |
dcb69098 | 143 | blocks_iter(pool, pool_idx, idx, nr_blocks, mask_clear); |
d24c33a4 JA |
144 | } |
145 | ||
ec996e9c JA |
146 | static int find_next_zero(int word, int start) |
147 | { | |
148 | assert(word != -1U); | |
271067a6 JH |
149 | word >>= start; |
150 | return ffz(word) + start; | |
d24c33a4 JA |
151 | } |
152 | ||
5f9454a2 | 153 | static bool add_pool(struct pool *pool, unsigned int alloc_size) |
d24c33a4 | 154 | { |
8d5844e9 | 155 | int bitmap_blocks; |
c8931876 | 156 | int mmap_flags; |
b8a6582e | 157 | void *ptr; |
ec996e9c | 158 | |
5f9454a2 JA |
159 | if (nr_pools == MAX_POOLS) |
160 | return false; | |
161 | ||
55f6491d | 162 | #ifdef SMALLOC_REDZONE |
ec996e9c | 163 | alloc_size += sizeof(unsigned int); |
55f6491d | 164 | #endif |
ec996e9c JA |
165 | alloc_size += sizeof(struct block_hdr); |
166 | if (alloc_size < INITIAL_SIZE) | |
167 | alloc_size = INITIAL_SIZE; | |
168 | ||
169 | /* round up to nearest full number of blocks */ | |
170 | alloc_size = (alloc_size + SMALLOC_BPL - 1) & ~(SMALLOC_BPL - 1); | |
171 | bitmap_blocks = alloc_size / SMALLOC_BPL; | |
172 | alloc_size += bitmap_blocks * sizeof(unsigned int); | |
173 | pool->mmap_size = alloc_size; | |
0b9d69ec | 174 | |
ec996e9c JA |
175 | pool->nr_blocks = bitmap_blocks; |
176 | pool->free_blocks = bitmap_blocks * SMALLOC_BPB; | |
adf57099 | 177 | |
c8931876 JA |
178 | mmap_flags = OS_MAP_ANON; |
179 | #ifdef CONFIG_ESX | |
180 | mmap_flags |= MAP_PRIVATE; | |
181 | #else | |
182 | mmap_flags |= MAP_SHARED; | |
183 | #endif | |
184 | ptr = mmap(NULL, alloc_size, PROT_READ|PROT_WRITE, mmap_flags, -1, 0); | |
185 | ||
d24c33a4 | 186 | if (ptr == MAP_FAILED) |
8d5844e9 | 187 | goto out_fail; |
d24c33a4 | 188 | |
ec996e9c | 189 | pool->map = ptr; |
17f7fcd0 | 190 | pool->bitmap = (unsigned int *)((char *) ptr + (pool->nr_blocks * SMALLOC_BPL)); |
9c3e13e3 | 191 | memset(pool->bitmap, 0, bitmap_blocks * sizeof(unsigned int)); |
d24c33a4 | 192 | |
971caeb1 | 193 | pool->lock = fio_sem_init(FIO_SEM_UNLOCKED); |
d24c33a4 | 194 | if (!pool->lock) |
8d5844e9 | 195 | goto out_fail; |
d24c33a4 | 196 | |
d24c33a4 | 197 | nr_pools++; |
5f9454a2 | 198 | return true; |
8d5844e9 | 199 | out_fail: |
b0f0326a | 200 | log_err("smalloc: failed adding pool\n"); |
d24c33a4 | 201 | if (pool->map) |
ec996e9c | 202 | munmap(pool->map, pool->mmap_size); |
5f9454a2 | 203 | return false; |
d24c33a4 JA |
204 | } |
205 | ||
206 | void sinit(void) | |
207 | { | |
5f9454a2 JA |
208 | bool ret; |
209 | int i; | |
d24c33a4 | 210 | |
5f9454a2 JA |
211 | for (i = 0; i < INITIAL_POOLS; i++) { |
212 | ret = add_pool(&mp[nr_pools], smalloc_pool_size); | |
213 | if (!ret) | |
85492cb8 JA |
214 | break; |
215 | } | |
216 | ||
217 | /* | |
218 | * If we added at least one pool, we should be OK for most | |
219 | * cases. | |
220 | */ | |
221 | assert(i); | |
d24c33a4 JA |
222 | } |
223 | ||
224 | static void cleanup_pool(struct pool *pool) | |
225 | { | |
443bb114 JA |
226 | /* |
227 | * This will also remove the temporary file we used as a backing | |
228 | * store, it was already unlinked | |
229 | */ | |
ec996e9c | 230 | munmap(pool->map, pool->mmap_size); |
6548f47f JA |
231 | |
232 | if (pool->lock) | |
971caeb1 | 233 | fio_sem_remove(pool->lock); |
d24c33a4 JA |
234 | } |
235 | ||
236 | void scleanup(void) | |
237 | { | |
238 | unsigned int i; | |
239 | ||
240 | for (i = 0; i < nr_pools; i++) | |
241 | cleanup_pool(&mp[i]); | |
d24c33a4 JA |
242 | } |
243 | ||
89da54e8 | 244 | #ifdef SMALLOC_REDZONE |
cf98708d JA |
245 | static void *postred_ptr(struct block_hdr *hdr) |
246 | { | |
e43606c2 | 247 | uintptr_t ptr; |
cf98708d | 248 | |
e43606c2 | 249 | ptr = (uintptr_t) hdr + hdr->size - sizeof(unsigned int); |
248c9436 | 250 | ptr = (uintptr_t) PTR_ALIGN(ptr, int_mask); |
cf98708d JA |
251 | |
252 | return (void *) ptr; | |
253 | } | |
254 | ||
ec996e9c | 255 | static void fill_redzone(struct block_hdr *hdr) |
55f6491d | 256 | { |
cf98708d | 257 | unsigned int *postred = postred_ptr(hdr); |
55f6491d | 258 | |
ec996e9c JA |
259 | hdr->prered = SMALLOC_PRE_RED; |
260 | *postred = SMALLOC_POST_RED; | |
ec996e9c | 261 | } |
55f6491d | 262 | |
ec996e9c JA |
263 | static void sfree_check_redzone(struct block_hdr *hdr) |
264 | { | |
cf98708d | 265 | unsigned int *postred = postred_ptr(hdr); |
ec996e9c JA |
266 | |
267 | if (hdr->prered != SMALLOC_PRE_RED) { | |
b0f0326a JA |
268 | log_err("smalloc pre redzone destroyed!\n" |
269 | " ptr=%p, prered=%x, expected %x\n", | |
ec996e9c | 270 | hdr, hdr->prered, SMALLOC_PRE_RED); |
55f6491d JA |
271 | assert(0); |
272 | } | |
273 | if (*postred != SMALLOC_POST_RED) { | |
b0f0326a JA |
274 | log_err("smalloc post redzone destroyed!\n" |
275 | " ptr=%p, postred=%x, expected %x\n", | |
ec996e9c | 276 | hdr, *postred, SMALLOC_POST_RED); |
55f6491d JA |
277 | assert(0); |
278 | } | |
89da54e8 JA |
279 | } |
280 | #else | |
281 | static void fill_redzone(struct block_hdr *hdr) | |
282 | { | |
55f6491d JA |
283 | } |
284 | ||
89da54e8 JA |
285 | static void sfree_check_redzone(struct block_hdr *hdr) |
286 | { | |
287 | } | |
288 | #endif | |
289 | ||
d24c33a4 JA |
290 | static void sfree_pool(struct pool *pool, void *ptr) |
291 | { | |
ec996e9c | 292 | struct block_hdr *hdr; |
179446e0 | 293 | unsigned int i, idx; |
ec996e9c | 294 | unsigned long offset; |
d24c33a4 JA |
295 | |
296 | if (!ptr) | |
297 | return; | |
298 | ||
ec996e9c JA |
299 | ptr -= sizeof(*hdr); |
300 | hdr = ptr; | |
55f6491d | 301 | |
d24c33a4 JA |
302 | assert(ptr_valid(pool, ptr)); |
303 | ||
ec996e9c | 304 | sfree_check_redzone(hdr); |
d24c33a4 | 305 | |
ec996e9c JA |
306 | offset = ptr - pool->map; |
307 | i = offset / SMALLOC_BPL; | |
308 | idx = (offset % SMALLOC_BPL) / SMALLOC_BPB; | |
d24c33a4 | 309 | |
971caeb1 | 310 | fio_sem_down(pool->lock); |
dcb69098 | 311 | clear_blocks(pool, i, idx, size_to_blocks(hdr->size)); |
ec996e9c JA |
312 | if (i < pool->next_non_full) |
313 | pool->next_non_full = i; | |
179446e0 | 314 | pool->free_blocks += size_to_blocks(hdr->size); |
971caeb1 | 315 | fio_sem_up(pool->lock); |
d24c33a4 JA |
316 | } |
317 | ||
318 | void sfree(void *ptr) | |
319 | { | |
320 | struct pool *pool = NULL; | |
321 | unsigned int i; | |
322 | ||
8e5732e5 JA |
323 | if (!ptr) |
324 | return; | |
325 | ||
d24c33a4 JA |
326 | for (i = 0; i < nr_pools; i++) { |
327 | if (ptr_valid(&mp[i], ptr)) { | |
328 | pool = &mp[i]; | |
329 | break; | |
330 | } | |
331 | } | |
332 | ||
45a65144 JA |
333 | if (pool) { |
334 | sfree_pool(pool, ptr); | |
335 | return; | |
336 | } | |
337 | ||
338 | log_err("smalloc: ptr %p not from smalloc pool\n", ptr); | |
d24c33a4 JA |
339 | } |
340 | ||
a3ebe7e0 | 341 | static void *__smalloc_pool(struct pool *pool, size_t size) |
d24c33a4 | 342 | { |
a3ebe7e0 | 343 | size_t nr_blocks; |
ec996e9c JA |
344 | unsigned int i; |
345 | unsigned int offset; | |
346 | unsigned int last_idx; | |
347 | void *ret = NULL; | |
d24c33a4 | 348 | |
971caeb1 | 349 | fio_sem_down(pool->lock); |
179446e0 JA |
350 | |
351 | nr_blocks = size_to_blocks(size); | |
ec996e9c | 352 | if (nr_blocks > pool->free_blocks) |
8e5732e5 | 353 | goto fail; |
5ec10eaa | 354 | |
ec996e9c JA |
355 | i = pool->next_non_full; |
356 | last_idx = 0; | |
357 | offset = -1U; | |
358 | while (i < pool->nr_blocks) { | |
359 | unsigned int idx; | |
d24c33a4 | 360 | |
ec996e9c JA |
361 | if (pool->bitmap[i] == -1U) { |
362 | i++; | |
363 | pool->next_non_full = i; | |
364 | last_idx = 0; | |
365 | continue; | |
366 | } | |
d24c33a4 | 367 | |
ec996e9c | 368 | idx = find_next_zero(pool->bitmap[i], last_idx); |
dcb69098 | 369 | if (!blocks_free(pool, i, idx, nr_blocks)) { |
ec996e9c JA |
370 | idx += nr_blocks; |
371 | if (idx < SMALLOC_BPI) | |
372 | last_idx = idx; | |
373 | else { | |
374 | last_idx = 0; | |
375 | while (idx >= SMALLOC_BPI) { | |
376 | i++; | |
377 | idx -= SMALLOC_BPI; | |
378 | } | |
379 | } | |
380 | continue; | |
d24c33a4 | 381 | } |
dcb69098 | 382 | set_blocks(pool, i, idx, nr_blocks); |
ec996e9c JA |
383 | offset = i * SMALLOC_BPL + idx * SMALLOC_BPB; |
384 | break; | |
385 | } | |
386 | ||
387 | if (i < pool->nr_blocks) { | |
388 | pool->free_blocks -= nr_blocks; | |
389 | ret = pool->map + offset; | |
d24c33a4 | 390 | } |
ec996e9c | 391 | fail: |
971caeb1 | 392 | fio_sem_up(pool->lock); |
ec996e9c | 393 | return ret; |
d24c33a4 JA |
394 | } |
395 | ||
38b253f3 | 396 | static size_t size_to_alloc_size(size_t size) |
55f6491d | 397 | { |
a3ebe7e0 | 398 | size_t alloc_size = size + sizeof(struct block_hdr); |
55f6491d | 399 | |
cf98708d | 400 | /* |
122426da JA |
401 | * Round to int alignment, so that the postred pointer will |
402 | * be naturally aligned as well. | |
cf98708d | 403 | */ |
ec996e9c | 404 | #ifdef SMALLOC_REDZONE |
122426da JA |
405 | alloc_size += sizeof(unsigned int); |
406 | alloc_size = (alloc_size + int_mask) & ~int_mask; | |
ec996e9c JA |
407 | #endif |
408 | ||
38b253f3 VF |
409 | return alloc_size; |
410 | } | |
411 | ||
412 | static void *smalloc_pool(struct pool *pool, size_t size) | |
413 | { | |
414 | size_t alloc_size = size_to_alloc_size(size); | |
415 | void *ptr; | |
416 | ||
ec996e9c | 417 | ptr = __smalloc_pool(pool, alloc_size); |
89da54e8 JA |
418 | if (ptr) { |
419 | struct block_hdr *hdr = ptr; | |
55f6491d | 420 | |
89da54e8 JA |
421 | hdr->size = alloc_size; |
422 | fill_redzone(hdr); | |
55f6491d | 423 | |
89da54e8 JA |
424 | ptr += sizeof(*hdr); |
425 | memset(ptr, 0, size); | |
426 | } | |
ec996e9c | 427 | |
55f6491d | 428 | return ptr; |
55f6491d JA |
429 | } |
430 | ||
38b253f3 VF |
431 | static void smalloc_print_bitmap(struct pool *pool) |
432 | { | |
433 | size_t nr_blocks = pool->nr_blocks; | |
434 | unsigned int *bitmap = pool->bitmap; | |
435 | unsigned int i, j; | |
436 | char *buffer; | |
437 | ||
438 | if (!enable_smalloc_debug) | |
439 | return; | |
440 | ||
441 | buffer = malloc(SMALLOC_BPI + 1); | |
442 | if (!buffer) | |
443 | return; | |
444 | buffer[SMALLOC_BPI] = '\0'; | |
445 | ||
446 | for (i = 0; i < nr_blocks; i++) { | |
447 | unsigned int line = bitmap[i]; | |
448 | ||
449 | /* skip completely full lines */ | |
450 | if (line == -1U) | |
451 | continue; | |
452 | ||
453 | for (j = 0; j < SMALLOC_BPI; j++) | |
454 | if ((1 << j) & line) | |
455 | buffer[SMALLOC_BPI-1-j] = '1'; | |
456 | else | |
457 | buffer[SMALLOC_BPI-1-j] = '0'; | |
458 | ||
459 | log_err("smalloc: bitmap %5u, %s\n", i, buffer); | |
460 | } | |
461 | ||
462 | free(buffer); | |
463 | } | |
464 | ||
465 | void smalloc_debug(size_t size) | |
466 | { | |
467 | unsigned int i; | |
468 | size_t alloc_size = size_to_alloc_size(size); | |
469 | size_t alloc_blocks; | |
470 | ||
471 | alloc_blocks = size_to_blocks(alloc_size); | |
472 | ||
473 | if (size) | |
474 | log_err("smalloc: size = %lu, alloc_size = %lu, blocks = %lu\n", | |
475 | (unsigned long) size, (unsigned long) alloc_size, | |
476 | (unsigned long) alloc_blocks); | |
477 | for (i = 0; i < nr_pools; i++) { | |
478 | log_err("smalloc: pool %u, free/total blocks %u/%u\n", i, | |
479 | (unsigned int) (mp[i].free_blocks), | |
480 | (unsigned int) (mp[i].nr_blocks*sizeof(unsigned int)*8)); | |
481 | if (size && mp[i].free_blocks >= alloc_blocks) { | |
482 | void *ptr = smalloc_pool(&mp[i], size); | |
483 | if (ptr) { | |
484 | sfree(ptr); | |
485 | last_pool = i; | |
486 | log_err("smalloc: smalloc_pool %u succeeded\n", i); | |
487 | } else { | |
488 | log_err("smalloc: smalloc_pool %u failed\n", i); | |
489 | log_err("smalloc: next_non_full=%u, nr_blocks=%u\n", | |
490 | (unsigned int) mp[i].next_non_full, (unsigned int) mp[i].nr_blocks); | |
491 | smalloc_print_bitmap(&mp[i]); | |
492 | } | |
493 | } | |
494 | } | |
495 | } | |
496 | ||
5457259f | 497 | void *smalloc(size_t size) |
d24c33a4 | 498 | { |
85492cb8 | 499 | unsigned int i, end_pool; |
d24c33a4 | 500 | |
7982aa7d JA |
501 | if (size != (unsigned int) size) |
502 | return NULL; | |
503 | ||
d24c33a4 | 504 | i = last_pool; |
85492cb8 | 505 | end_pool = nr_pools; |
d24c33a4 JA |
506 | |
507 | do { | |
85492cb8 | 508 | for (; i < end_pool; i++) { |
d24c33a4 JA |
509 | void *ptr = smalloc_pool(&mp[i], size); |
510 | ||
511 | if (ptr) { | |
512 | last_pool = i; | |
d24c33a4 JA |
513 | return ptr; |
514 | } | |
515 | } | |
516 | if (last_pool) { | |
85492cb8 JA |
517 | end_pool = last_pool; |
518 | last_pool = i = 0; | |
d24c33a4 JA |
519 | continue; |
520 | } | |
521 | ||
85492cb8 | 522 | break; |
d24c33a4 JA |
523 | } while (1); |
524 | ||
81b3c86f JA |
525 | log_err("smalloc: OOM. Consider using --alloc-size to increase the " |
526 | "shared memory available.\n"); | |
38b253f3 | 527 | smalloc_debug(size); |
d24c33a4 JA |
528 | return NULL; |
529 | } | |
530 | ||
544992f7 JA |
531 | void *scalloc(size_t nmemb, size_t size) |
532 | { | |
5457259f | 533 | return smalloc(nmemb * size); |
544992f7 JA |
534 | } |
535 | ||
d24c33a4 JA |
536 | char *smalloc_strdup(const char *str) |
537 | { | |
2894a2d4 | 538 | char *ptr = NULL; |
d24c33a4 JA |
539 | |
540 | ptr = smalloc(strlen(str) + 1); | |
2894a2d4 CE |
541 | if (ptr) |
542 | strcpy(ptr, str); | |
d24c33a4 JA |
543 | return ptr; |
544 | } |