X-Git-Url: https://git.ozlabs.org/?p=ccan;a=blobdiff_plain;f=ccan%2Ftal%2F_info;h=3f7c22c717d93b0e69182c2a55de8db27ff85e82;hp=ca0d18500595fb8b863e1d5416cdb5a856bb1967;hb=0f6d854ab9d85ac7e4487ff3eee464be6bb528aa;hpb=932d65dd6537250e617516749f03a00fea3b34f6

diff --git a/ccan/tal/_info b/ccan/tal/_info
index ca0d1850..3f7c22c7 100644
--- a/ccan/tal/_info
+++ b/ccan/tal/_info
@@ -18,10 +18,10 @@
  * tal_free(X->name) would free X->name as expected, by tal_free(X) would
  * free X and X->name.
  *
- * With an overhead of approximately 2.1 pointers per object (vs. talloc's
- * 12 pointers), it's a little slower in freeing single objects, though
- * comparable for allocation and freeing whole object trees).  It does not
- * support talloc's references or failing destructors.
+ * With an overhead of approximately 4 pointers per object
+ * (vs. talloc's 12 pointers), it uses dynamic allocation for
+ * destructors and child lists, so those operations can fail.  It does
+ * not support talloc's references or failing destructors.
  *
  * Example:
  *	#include <stdio.h>
@@ -92,7 +92,6 @@ int main(int argc, char *argv[])
 
 	if (strcmp(argv[1], "depends") == 0) {
 		printf("ccan/compiler\n");
-		printf("ccan/hash\n");
 		printf("ccan/likely\n");
 		printf("ccan/list\n");
 		printf("ccan/str\n");