decompressors: fix spelling mistakes

Fix some spelling mistakes in comments:
sentinal ==> sentinel
compresed ==> compressed
immediatelly ==> immediately
dervied ==> derived
splitted ==> split
nore ==> not
independed ==> independent
asumed ==> assumed

Link: https://lkml.kernel.org/r/20210604085656.12257-1-thunder.leizhen@huawei.com
Signed-off-by: Zhen Lei <thunder.leizhen@huawei.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Origin: git://git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git 05911c5d964
Signed-off-by: Jan Beulich <jbeulich@suse.com>
Reviewed-by: Luca Fancellu <luca.fancellu@arm.com>
Acked-by: Andrew Cooper <andrew.cooper3@citrix.com>

diff --git a/xen/common/bunzip2.c b/xen/common/bunzip2.c
index 782b589a8b01fec9bdf38aedb4177b63e3938b5a..61b80aff1ba9bad72e7ce999ebe40198a21a83c1 100644 (file)
--- a/xen/common/bunzip2.c
+++ b/xen/common/bunzip2.c
@@ -73,7 +73,7 @@
 
 /* This is what we know about each Huffman coding group */
 struct group_data {
-       /* We have an extra slot at the end of limit[] for a sentinal value. */
+       /* We have an extra slot at the end of limit[] for a sentinel value. */
        int limit[MAX_HUFCODE_BITS+1];
        int base[MAX_HUFCODE_BITS];
        int permute[MAX_SYMBOLS];
@@ -326,7 +326,7 @@ static int __init get_next_block(struct bunzip_data *bd)
                        pp <<= 1;
                        base[i+1] = pp-(t += temp[i]);
                }
-               limit[maxLen+1] = INT_MAX; /* Sentinal value for
+               limit[maxLen+1] = INT_MAX; /* Sentinel value for
                                            * reading next sym. */
                limit[maxLen] = pp+temp[maxLen]-1;
                base[minLen] = 0;

diff --git a/xen/common/unxz.c b/xen/common/unxz.c
index 7bfe23f422558e92295a506a2079b39473855602..4f1b50cade99e13fb8996f5da49b7b2bfc8ec61a 100644 (file)
--- a/xen/common/unxz.c
+++ b/xen/common/unxz.c
@@ -23,7 +23,7 @@
  * uncompressible. Thus, we must look for worst-case expansion when the
  * compressor is encoding uncompressible data.
  *
- * The structure of the .xz file in case of a compresed kernel is as follows.
+ * The structure of the .xz file in case of a compressed kernel is as follows.
  * Sizes (as bytes) of the fields are in parenthesis.
  *
  *    Stream Header (12)

diff --git a/xen/common/unzstd.c b/xen/common/unzstd.c
index a034b69e86677793519f599bb764611d8ccf3ccd..47073dd3e3ead61263685272b9d07a928e54df7f 100644 (file)
--- a/xen/common/unzstd.c
+++ b/xen/common/unzstd.c
@@ -16,7 +16,7 @@
  * uncompressible. Thus, we must look for worst-case expansion when the
  * compressor is encoding uncompressible data.
  *
- * The structure of the .zst file in case of a compresed kernel is as follows.
+ * The structure of the .zst file in case of a compressed kernel is as follows.
  * Maximum sizes (as bytes) of the fields are in parenthesis.
  *
  *    Frame Header: (18)

diff --git a/xen/common/xz/dec_bcj.c b/xen/common/xz/dec_bcj.c
index 970d3d89ee748b5c91ecc0f6dee62fdf43c62d01..bfa498587ab884d7148758f070c1f0d0cfa27c50 100644 (file)
--- a/xen/common/xz/dec_bcj.c
+++ b/xen/common/xz/dec_bcj.c
@@ -422,7 +422,7 @@ XZ_EXTERN enum xz_ret __init xz_dec_bcj_run(struct xz_dec_bcj *s,
 
        /*
         * Flush pending already filtered data to the output buffer. Return
-        * immediatelly if we couldn't flush everything, or if the next
+        * immediately if we couldn't flush everything, or if the next
         * filter in the chain had already returned XZ_STREAM_END.
         */
        if (s->temp.filtered > 0) {

diff --git a/xen/common/xz/dec_lzma2.c b/xen/common/xz/dec_lzma2.c
index 68bcf0f29a132465e072bc958c177b3039978c7e..2748c8e18aad3fde7bb3b9d89da8b3ef7f30ea55 100644 (file)
--- a/xen/common/xz/dec_lzma2.c
+++ b/xen/common/xz/dec_lzma2.c
@@ -147,8 +147,8 @@ struct lzma_dec {
 
        /*
         * LZMA properties or related bit masks (number of literal
-        * context bits, a mask dervied from the number of literal
-        * position bits, and a mask dervied from the number
+        * context bits, a mask derived from the number of literal
+        * position bits, and a mask derived from the number
         * position bits)
         */
        uint32_t lc;
@@ -484,7 +484,7 @@ static always_inline void rc_normalize(struct rc_dec *rc)
 }
 
 /*
- * Decode one bit. In some versions, this function has been splitted in three
+ * Decode one bit. In some versions, this function has been split in three
  * functions so that the compiler is supposed to be able to more easily avoid
  * an extra branch. In this particular version of the LZMA decoder, this
  * doesn't seem to be a good idea (tested with GCC 3.3.6, 3.4.6, and 4.3.3
@@ -761,7 +761,7 @@ static bool_t __init lzma_main(struct xz_dec_lzma2 *s)
 }
 
 /*
- * Reset the LZMA decoder and range decoder state. Dictionary is nore reset
+ * Reset the LZMA decoder and range decoder state. Dictionary is not reset
  * here, because LZMA state may be reset without resetting the dictionary.
  */
 static void __init lzma_reset(struct xz_dec_lzma2 *s)

diff --git a/xen/common/zstd/huf.h b/xen/common/zstd/huf.h
index a498e0de28716b44fa635928cf1356780eedbb01..0e091dbffe3df40081df16468a285fdab579cdbb 100644 (file)
--- a/xen/common/zstd/huf.h
+++ b/xen/common/zstd/huf.h
@@ -131,7 +131,7 @@ typedef enum {
        HUF_repeat_none,  /**< Cannot use the previous table */
        HUF_repeat_check, /**< Can use the previous table but it must be checked. Note : The previous table must have been constructed by HUF_compress{1,
                             4}X_repeat */
-       HUF_repeat_valid  /**< Can use the previous table and it is asumed to be valid */
+       HUF_repeat_valid  /**< Can use the previous table and it is assumed to be valid */
 } HUF_repeat;
 /** HUF_compress4X_repeat() :
 *   Same as HUF_compress4X_wksp(), but considers using hufTable if *repeat != HUF_repeat_none.