6 * block_pool - An efficient allocator for blocks that don't need to be
9 * block_pool allocates blocks by packing them into buffers, making the
10 * overhead per block virtually zero. Because of this, you cannot resize or
11 * free individual blocks, but you can free the entire block_pool.
13 * The rationale behind block_pool is that talloc uses a lot of bytes per
14 * block (48 on 32-bit, 80 on 64-bit). Nevertheless, talloc is an excellent
15 * tool for C programmers of all ages. Because a block_pool is a talloc
16 * context, it can be useful in talloc-based applications where many small
17 * blocks need to be allocated.
21 * #include <ccan/block_pool/block_pool.h>
24 * struct block_pool *bp = block_pool_new(NULL);
26 * void *buffer = block_pool_alloc(bp, 4096);
27 * char *string = block_pool_strdup(bp, "A string");
29 * int array[] = {0,1,1,2,3,5,8,13,21,34};
30 * int *array_copy = block_pool_memdup(bp, array, sizeof(array));
32 * block_pool_free(bp);
39 int main(int argc, char *argv[])
41 /* Expect exactly one argument */
45 if (strcmp(argv[1], "depends") == 0) {
46 printf("ccan/talloc\n");