* ChangeLog (5.0alpha6): Fix typo ("DATASTART").
* include/private/gcconfig.h: Likewise.
* backgraph.c: Fix typo in comment ("If").
* cord/tests/de.c: Fix typo in comment ("Unbounded").
in a barely measurable performance gain. Added support for interleaved
lookups of two pointers, but unconfigured that since the performance
gain is currently near zero, and it adds to code size.
-* Changed Linux DATA_START definition to check both data_start and
+* Changed Linux DATASTART definition to check both data_start and
__data_start, since nothing else seems to be portable.
* Added -DUSE_LD_WRAP to optionally take advantage of the GNU ld function
wrapping mechanism. Probably currently useful only on Linux.
*
* One restriction is that we drop all back-edges from nodes with very
* high in-degree, and simply add them add them to a list of such
- * nodes. They are then treated as permanent roots. Id this by itself
+ * nodes. They are then treated as permanent roots. If this by itself
* doesn't introduce a space leak, then such nodes can't contribute to
* a growing space leak.
*/
* A really simple-minded text editor based on cords.
* Things it does right:
* No size bounds.
- * Inbounded undo.
+ * Unbounded undo.
* Shouldn't crash no matter what file you invoke it on (e.g. /vmunix)
* (Make sure /vmunix is not writable before you try this.)
* Scrolls horizontally.
*
* DATASTART is the beginning of the data segment.
* On some platforms SEARCH_FOR_DATA_START is defined.
- * SEARCH_FOR_DATASTART will cause GC_data_start to
+ * The latter will cause GC_data_start to
* be set to an address determined by accessing data backwards from _end
* until an unmapped page is found. DATASTART will be defined to be
* GC_data_start.