Fix typos in comments and documentation

No functional change

Signed-off-by: Tobias Stoeckmann <tobias@stoeckmann.org>

doc/WRITING_TESTS.md

@@ -172,7 +172,7 @@ And assertions that verify particular file properties, such as:
 - `assertFileSize(path, expected_size)`
 - `assertTextFileContents(expected_text, path)`
 
-The full set of asertions is listed in `test_utils/test_common.h`.
+The full set of assertions is listed in `test_utils/test_common.h`.
 You can search the existing tests to find examples of their usage.
 
 ---

libarchive/archive_read_support_format_cab.c

@@ -112,8 +112,8 @@ struct lzx_dec {
 		unsigned char	*bitlen;
 
 		/*
-		 * Use a index table. It's faster than searching a huffman
-		 * coding tree, which is a binary tree. But a use of a large
+		 * Use an index table. It's faster than searching a huffman
+		 * coding tree, which is a binary tree. But usage of a large
 		 * index table causes L1 cache read miss many times.
 		 */
 		int		 max_bits;
@@ -279,7 +279,7 @@ struct cab {
 	struct cfheader		 cfheader;
 	struct archive_wstring	 ws;
 
-	/* Flag to mark progress that an archive was read their first header.*/
+	/* Flag to mark progress that first header of an archive was read.*/
 	char			 found_header;
 	char			 end_of_archive;
 	char			 end_of_entry;
@@ -433,7 +433,7 @@ archive_read_format_cab_bid(struct archive_read *a, int best_bid)
 	/*
 	 * Attempt to handle self-extracting archives
 	 * by noting a PE header and searching forward
-	 * up to 128k for a 'MSCF' marker.
+	 * up to 128k for an 'MSCF' marker.
 	 */
 	if (p[0] == 'M' && p[1] == 'Z') {
 		offset = 0;
@@ -501,7 +501,7 @@ cab_skip_sfx(struct archive_read *a)
 	for (;;) {
 		const char *h = __archive_read_ahead(a, window, &bytes);
 		if (h == NULL) {
-			/* Remaining size are less than window. */
+			/* Remaining size is less than window. */
 			window >>= 1;
 			if (window < 128) {
 				archive_set_error(&a->archive,

libarchive/archive_read_support_format_lha.c

@@ -107,8 +107,8 @@ struct lzh_dec {
 		unsigned char	*bitlen;
 
 		/*
-		 * Use a index table. It's faster than searching a huffman
-		 * coding tree, which is a binary tree. But a use of a large
+		 * Use an index table. It's faster than searching a huffman
+		 * coding tree, which is a binary tree. But usage of a large
 		 * index table causes L1 cache read miss many times.
 		 */
 #define HTBL_BITS	10

libarchive/archive_write_set_format_ar.c

@@ -172,7 +172,7 @@ archive_write_ar_header(struct archive_write *a, struct archive_entry *entry)
 
 	/*
 	 * If we are now at the beginning of the archive,
-	 * we need first write the ar global header.
+	 * we have to write the ar global header first.
 	 */
 	if (!ar->wrote_global_header) {
 		__archive_write_output(a, "!<arch>\n", 8);

libarchive/test/test_archive_string_conversion.c

@@ -338,13 +338,13 @@ test_archive_string_normalization_nfc(const char *testdata)
 		nfd[sizeof(nfd)-1] = '\0';
 
 		/*
-		 * Get an NFC patterns.
+		 * Get an NFC pattern.
 		 */
 		scan_unicode_pattern(utf8_nfc, wc_nfc, utf16be_nfc, utf16le_nfc,
 		    nfc, 0);
 
 		/*
-		 * Get an NFD patterns.
+		 * Get an NFD pattern.
 		 */
 		scan_unicode_pattern(utf8_nfd, wc_nfd, utf16be_nfd, utf16le_nfd,
 		    nfd, 0);
@@ -550,7 +550,7 @@ test_archive_string_normalization_mac_nfd(const char *testdata)
 		nfd[sizeof(nfd)-1] = '\0';
 
 		/*
-		 * Get an NFC patterns.
+		 * Get an NFC pattern.
 		 */
 		should_be_nfc = scan_unicode_pattern(utf8_nfc, wc_nfc,
 			utf16be_nfc, utf16le_nfc, nfc, 1);

libarchive/test/test_write_filter_lzma.c

@@ -55,7 +55,7 @@ DEFINE_TEST(test_write_filter_lzma)
 	memset(data, 0, datasize);
 
 	/*
-	 * Write a 100 files and read them all back.
+	 * Write 100 files and read them all back.
 	 */
 	assert((a = archive_write_new()) != NULL);
 	assertEqualIntA(a, ARCHIVE_OK, archive_write_set_format_ustar(a));