X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;f=lib%2FTODO;h=4b3fe850e5bdf2b90255af1cd860e279eebc0a9e;hb=5fa5d3d767b29cf1d757609afbb56459b09743fa;hp=3f2bceaa90900e12cb0370c9e971d79115210b7e;hpb=a76c548ed8e80ac79b273a091690c976bd685278;p=gnulib.git

diff --git a/lib/TODO b/lib/TODO
index 3f2bceaa9..4b3fe850e 100644
--- a/lib/TODO
+++ b/lib/TODO
@@ -1,3 +1,4 @@
+Things to do to hash.c:
 
 Always use curly braces around statements in if/else/while/do/etc.
 that span more than a line -- even around multiline simple statements
@@ -13,3 +14,19 @@ like stdc-print and think I sent you an early verison.
 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) ?
+
+remove.c: s/done/successful or ok