Fix various typos

diff --git a/README.WINDOWS b/README.WINDOWS
index cd8c7e0e32a2fde946809e4e8f1d3c5bc896b0e7..781fbe298c5acec3837274ae3ff63592e2c52c37 100644 (file)
--- a/README.WINDOWS
+++ b/README.WINDOWS
@@ -29,7 +29,7 @@ The Windows distribution of wimlib is a ZIP file containing the following items:
 
 Note that there are separate ZIP files for 32-bit (i686) and 64-bit (x86_64)
 binaries.  They are both fully supported, but you should prefer the 64-bit
-binaries when possible as they can be noticably faster.
+binaries when possible as they can be noticeably faster.
 
                                  WIMLIB-IMAGEX
 

diff --git a/include/wimlib.h b/include/wimlib.h
index 98f3d0234535c5c7ba3b943c10351d811c715d47..ac42e81a8f7f9f24b288ae00bf30d79915e5e010 100644 (file)
--- a/include/wimlib.h
+++ b/include/wimlib.h
@@ -503,7 +503,7 @@ enum wimlib_compression_type {
         * produce a better compression ratio, and work more quickly, than the
         * implementation in Microsoft's WIMGAPI (as of Windows 8.1).  There is
         * limited support for non-default compression levels, but compression
-        * will be noticably faster if you choose a level < 35.
+        * will be noticeably faster if you choose a level < 35.
         *
         * If using wimlib_create_compressor() to create an LZMS compressor
         * directly, the @p max_block_size parameter may be any positive value
@@ -776,7 +776,7 @@ union wimlib_progress_info {
                uint64_t completed_streams;
 
                /** The number of threads being used for data compression; or,
-                * if no compression is being peformed, this will be 1.  */
+                * if no compression is being performed, this will be 1.  */
                uint32_t num_threads;
 
                /** The compression type being used, as one of the
@@ -2254,7 +2254,7 @@ typedef int (*wimlib_iterate_lookup_table_callback_t)(const struct wimlib_resour
 #define WIMLIB_WRITE_FLAG_SEND_DONE_WITH_FILE_MESSAGES 0x00002000
 
 /**
- * Do not consider content similarily when arranging file data for solid
+ * Do not consider content similarity when arranging file data for solid
  * compression.  Providing this flag will typically worsen the compression
  * ratio, so only provide this flag if you know what you are doing.
  */

diff --git a/src/decompress_common.c b/src/decompress_common.c
index a490882d8542cd230877f6405ff34988ba98b322..76fb1278ab0efed9cdd2ca8cffe2bd5ecd10d8b3 100644 (file)
--- a/src/decompress_common.c
+++ b/src/decompress_common.c
@@ -377,7 +377,7 @@ make_huffman_decode_table(u16 decode_table[const],
                                 * of as simply the root of the tree.  The
                                 * representation of these internal nodes is
                                 * simply the index of the left child combined
-                                * with the special bits 0xC000 to distingush
+                                * with the special bits 0xC000 to distinguish
                                 * the entry from direct mapping and leaf node
                                 * entries.  */
                                do {

diff --git a/src/integrity.c b/src/integrity.c
index 0a7ea0fb7f704f30bec751fdd2afe6187abcc33e..0054c40219a381f954a36bd08c31becb3d924394 100644 (file)
--- a/src/integrity.c
+++ b/src/integrity.c
@@ -42,7 +42,7 @@
  * information. */
 #define INTEGRITY_CHUNK_SIZE 10485760
 
-/* Only use a different chunk size for compatiblity with an existing integrity
+/* Only use a different chunk size for compatibility with an existing integrity
  * table if the chunk size is between these two numbers. */
 #define INTEGRITY_MIN_CHUNK_SIZE 4096
 #define INTEGRITY_MAX_CHUNK_SIZE 134217728

diff --git a/src/lzms_compress.c b/src/lzms_compress.c
index ef67edb213f79fa2c1bf2b1057568a28e93d7fa5..e811a87658bda5eea3db465bf5c446f068a6229e 100644 (file)
--- a/src/lzms_compress.c
+++ b/src/lzms_compress.c
@@ -249,7 +249,7 @@ struct lzms_optimum_node {
         *
         * Note: this adaptive state structure also does not include the
         * probability entries or current Huffman codewords.  Those aren't
-        * maintained per-position and are only updated occassionally.
+        * maintained per-position and are only updated occasionally.
         */
        struct lzms_adaptive_state state;
 } _aligned_attribute(64);

diff --git a/src/sha1-ssse3.asm b/src/sha1-ssse3.asm
index 5f5872a7abffd1e308f1a4fbb0da937e72a3a4e5..c3b07abbb32c20b85bc0cb5790d6ffcade82beb0 100644 (file)
--- a/src/sha1-ssse3.asm
+++ b/src/sha1-ssse3.asm
@@ -8,7 +8,7 @@
 ;   C++ prototypes of implemented functions are below:
 ;
 ;   #ifndef INTEL_SHA1_SINGLEBLOCK
-;      // Updates 20-byte SHA-1 record in 'hash' for 'num_blocks' consequtive 64-byte blocks
+;      // Updates 20-byte SHA-1 record in 'hash' for 'num_blocks' consecutive 64-byte blocks
 ;      extern "C" void sha1_update_intel(int *hash, const char* input, size_t num_blocks );
 ;   #else
 ;      // Updates 20-byte SHA-1 record in 'hash' for one 64-byte block pointed by 'input'

diff --git a/src/win32_capture.c b/src/win32_capture.c
index 8937891e75ee205376142a627264470d8e00fb07..88e31248621119b7a0e176329bfca6933c5afdc5 100644 (file)
--- a/src/win32_capture.c
+++ b/src/win32_capture.c
@@ -628,7 +628,7 @@ winnt_try_rpfix(struct reparse_buffer_disk *rpbuf, u16 *rpbuflen_p,
         * SYMBOLIC_LINK_RELATIVE.  We will use this information, although this
         * may not always do what the user expects, since drive-relative
         * symbolic links such as "\Users\Public" have SYMBOLIC_LINK_RELATIVE
-        * set, in addition to truely relative symbolic links such as "Users" or
+        * set, in addition to truly relative symbolic links such as "Users" or
         * "Users\Public".  However, WIMGAPI (as of Windows 8.1) has this same
         * behavior.
         *

diff --git a/src/write.c b/src/write.c
index 9b1de1d3958ee2d8895078abf41c3d002339bee3..a649dfa4e36b0dc20c492bccb1d3bc264004e35d 100644 (file)
--- a/src/write.c
+++ b/src/write.c
@@ -1464,9 +1464,9 @@ init_done_with_file_info(struct list_head *blob_list)
  * identical to another blob already being written or one that would be filtered
  * out of the output WIM using blob_filtered() with the context @filter_ctx.
  * Each such duplicate blob will be removed from @blob_list, its reference count
- * transfered to the pre-existing duplicate blob, its memory freed, and will not
- * be written.  Alternatively, if a blob in @blob_list is a duplicate with any
- * blob in @blob_table that has not been marked for writing or would not be
+ * transferred to the pre-existing duplicate blob, its memory freed, and will
+ * not be written.  Alternatively, if a blob in @blob_list is a duplicate with
+ * any blob in @blob_table that has not been marked for writing or would not be
  * hard-filtered, it is freed and the pre-existing duplicate is written instead,
  * taking ownership of the reference count and slot in the @blob_table_list.
  *

diff --git a/src/xpress_compress.c b/src/xpress_compress.c
index a04bc52d207adf35db24bcb3725cefdcef8d897a..7ebff8766339862de7f31aaabc8f99589fe3c7f8 100644 (file)
--- a/src/xpress_compress.c
+++ b/src/xpress_compress.c
@@ -212,7 +212,7 @@ struct xpress_output_bitstream {
        /* Pointer to the start of the output buffer.  */
        u8 *start;
 
-       /* Pointer to the location in the ouput buffer at which to write the
+       /* Pointer to the location in the output buffer at which to write the
         * next 16 bits.  */
        u8 *next_bits;