Skip to content

Commit

Permalink
lib/decompressors: fix spelling mistakes
Browse files Browse the repository at this point in the history
Fix some spelling mistakes in comments:
sentinal ==> sentinel
compresed ==> compressed
dependeny ==> dependency
immediatelly ==> immediately
dervied ==> derived
splitted ==> split
nore ==> not
independed ==> independent
asumed ==> assumed

Link: https://lkml.kernel.org/r/[email protected]
Signed-off-by: Zhen Lei <[email protected]>
Cc: Jiri Kosina <[email protected]>
Cc: Thomas Bogendoerfer <[email protected]>
Signed-off-by: Andrew Morton <[email protected]>
Signed-off-by: Linus Torvalds <[email protected]>
  • Loading branch information
Zhen Lei authored and torvalds committed Jul 1, 2021
1 parent b6c75c4 commit 05911c5
Show file tree
Hide file tree
Showing 7 changed files with 12 additions and 12 deletions.
4 changes: 2 additions & 2 deletions lib/decompress_bunzip2.c
Original file line number Diff line number Diff line change
Expand Up @@ -80,7 +80,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];
Expand Down Expand Up @@ -337,7 +337,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;
Expand Down
2 changes: 1 addition & 1 deletion lib/decompress_unxz.c
Original file line number Diff line number Diff line change
Expand Up @@ -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)
Expand Down
4 changes: 2 additions & 2 deletions lib/decompress_unzstd.c
Original file line number Diff line number Diff line change
Expand Up @@ -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)
Expand Down Expand Up @@ -56,7 +56,7 @@
/*
* Preboot environments #include "path/to/decompress_unzstd.c".
* All of the source files we depend on must be #included.
* zstd's only source dependeny is xxhash, which has no source
* zstd's only source dependency is xxhash, which has no source
* dependencies.
*
* When UNZSTD_PREBOOT is defined we declare __decompress(), which is
Expand Down
2 changes: 1 addition & 1 deletion lib/xz/xz_dec_bcj.c
Original file line number Diff line number Diff line change
Expand Up @@ -422,7 +422,7 @@ XZ_EXTERN enum xz_ret 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) {
Expand Down
8 changes: 4 additions & 4 deletions lib/xz/xz_dec_lzma2.c
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down Expand Up @@ -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
Expand Down Expand Up @@ -761,7 +761,7 @@ static bool 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 lzma_reset(struct xz_dec_lzma2 *s)
Expand Down
2 changes: 1 addition & 1 deletion lib/zlib_inflate/inffast.c
Original file line number Diff line number Diff line change
Expand Up @@ -15,7 +15,7 @@ union uu {
unsigned char b[2];
};

/* Endian independed version */
/* Endian independent version */
static inline unsigned short
get_unaligned16(const unsigned short *p)
{
Expand Down
2 changes: 1 addition & 1 deletion lib/zstd/huf.h
Original file line number Diff line number Diff line change
Expand Up @@ -134,7 +134,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.
Expand Down

0 comments on commit 05911c5

Please sign in to comment.