diff --git a/man/lrzip.1 b/man/lrzip.1
index b24ec41..472afe8 100644
--- a/man/lrzip.1
+++ b/man/lrzip.1
@@ -209,7 +209,7 @@ LRZIP operates in two stages. The first stage finds and encodes large chunks of
 duplicated data over potentially very long distances in the input file. The
 second stage is to use a compression algorithm to compress the output of the
 first stage. The compression algorithm can be chosen to be optimised for extreme
-size (zpaq), size (lzma - default), speed (lzo), legacy (bzip2) or (gzip) or can
+size (zpaq), size (lzma - default), speed (lzo), legacy (bzip2 or gzip) or can
 be omitted entirely doing only the first stage. A one stage only compressed file
 can almost always improve both the compression size and speed done by a
 subsequent compression program.
@@ -290,9 +290,9 @@ zpaq was written by Matt Mahoney.
 lrzip was bastardised from rzip by Con Kolivas.
 .br
 Peter Hyman added informational output, updated LZMA SDK,
-and aded multi-threading capabilities.
+and added multi-threading capabilities.
 .PP
-If you wish to report a problem or make a suggestion then please email Con at
+If you wish to report a problem, or make a suggestion, then please email Con at
 kernel@kolivas.org
 .PP
 lrzip is released under the GNU General Public License version 2.
diff --git a/runzip.c b/runzip.c
index cd7179d..86ecc93 100644
--- a/runzip.c
+++ b/runzip.c
@@ -70,8 +70,6 @@ static i64 unzip_literal(void *ss, i64 len, int fd_out, uint32 *cksum)
 	if (unlikely(len < 0))
 		fatal("len %lld is negative in unzip_literal!\n",len);
 
-	/* We use anonymous mmap instead of malloc to allow us to allocate up
-	 * to 2^44 even on 32 bits */
 	buf = (uchar *)mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_ANONYMOUS | MAP_PRIVATE, -1, 0);
 	if (unlikely(buf == MAP_FAILED))
 		fatal("Failed to allocate literal buffer of size %lld\n", len);