# HG changeset patch
# User Jim Meyering <jim@meyering.net>
# Date 891822414 0
# Node ID fc1d87c1bdb9f91617cb32364006f5c4dd7fd80b
# Parent  2b31071502105dcaa70de92c6dd8f2018176a230
*** empty log message ***

diff --git a/lib/TODO b/lib/TODO
--- a/lib/TODO
+++ b/lib/TODO
@@ -14,3 +14,17 @@
 I don't like the name `cursor'.  I much prefer short names
 like `p' for index variables.  I doubt I'll change all of them,
 but thought you should know why some will probably end up changing.
+
+#define USE_OBSTACK somewhere
+
+Fix this comment.  Depending on system and application...
+Mention fragmentation.
+  +#if USE_OBSTACK
+  +    /* Whenever obstacks are used, it is possible to allocate all overflowed
+  +       entries into a single stack, so they all can be freed in a single
+  +       operation.  It is not clear if the speedup is worth the trouble.  */
+  +    struct obstack entry_stack;
+  +#endif
+
+
+assert (bucket_limit - bucket == n_buckets) ?