_info 1.3 KB

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