X-Git-Url: http://git.ozlabs.org/?a=blobdiff_plain;f=ccan%2Fblock_pool%2F_info;h=a42cdba4b5c6148ddf347ea3087cd2cc63cef3c8;hb=5c345a1e1044f78709621857224f503f985dc5b0;hp=53afc7bd8826e5a3474392548c1af31458b8559f;hpb=2622d34405aa838770d9c72c523db4ed8defadaa;p=ccan

diff --git a/ccan/block_pool/_info b/ccan/block_pool/_info
index 53afc7bd..a42cdba4 100644
--- a/ccan/block_pool/_info
+++ b/ccan/block_pool/_info
@@ -1,10 +1,9 @@
+#include "config.h"
 #include <stdio.h>
 #include <string.h>
-#include "config.h"
 
 /**
- * block_pool - An efficient allocator for blocks that don't need to be
- * resized or freed.
+ * block_pool - An efficient allocator for blocks that don't need to be resized or freed.
  *
  * block_pool allocates blocks by packing them into buffers, making the
  * overhead per block virtually zero.  Because of this, you cannot resize or
@@ -29,12 +28,19 @@
  *      int array[] = {0,1,1,2,3,5,8,13,21,34};
  *      int *array_copy = block_pool_memdup(bp, array, sizeof(array));
  *
+ *	memset(buffer, 0xff, 4096);
+ *	printf("string = %s\n", string);
+ *	printf("array_copy[0] == %i\n", array_copy[0]);
  *      block_pool_free(bp);
  *    return 0;
  * }
  *
- *	Author: Joey Adams
- *	License: BSD
+ * Author: Joey Adams <joeyadams3.14159@gmail.com>
+ * License: MIT
+ * Version: 0.1
+ * Ccanlint:
+ *	// We actually depend on the LGPL talloc
+ *	license_depends_compat FAIL
  */
 int main(int argc, char *argv[])
 {