X-Git-Url: http://git.chise.org/gitweb/?p=chise%2Fxemacs-chise.git.1;a=blobdiff_plain;f=src%2Fralloc.c;h=5f336a9cb29baae4db7f451afa9e7d240a6b6eaa;hp=4c97bfca2e0d8e0bedbd0606c9f6f4a7309e339a;hb=77dcef404dc78635f6ffa8f71a803d2bc7cc8921;hpb=fc475e6669a613cd6d98eb5511c749a23b63c7ac

diff --git a/src/ralloc.c b/src/ralloc.c
index 4c97bfc..5f336a9 100644
--- a/src/ralloc.c
+++ b/src/ralloc.c
@@ -1409,12 +1409,12 @@ static int r_alloc_initialized = 0;
 static int DEV_ZERO_FD = -1;
 
 
-/* We actually need a datastructure that can be usefully structured
+/* We actually need a data structure that can be usefully structured
    based on the VM address, and allows an ~O(1) lookup on an arbitrary
-   address, ie a hash-table.  Maybe the XEmacs hash table can be
-   coaxed enough.  At the moment, we use lookup on a hash-table to
+   address, i.e. a hash table.  Maybe the XEmacs hash table can be
+   coaxed enough.  At the moment, we use lookup on a hash table to
    decide whether to do an O(n) search on the malloced block list.
-   Addresses are hashed to a bucket modulo MHASH_PRIME */
+   Addresses are hashed to a bucket modulo MHASH_PRIME. */
 
 
 /* We settle for a standard doubly-linked-list.  The dynarr type isn't