Ksawlii/kernel_samsung_a53x
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

lib/decompressors: fix spelling mistakes

Browse source 
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/20210604085656.12257-1-thunder.leizhen@huawei.com
Signed-off-by: Zhen Lei <thunder.leizhen@huawei.com>
Cc: Jiri Kosina <jkosina@suse.cz>
Cc: Thomas Bogendoerfer <tsbogend@alpha.franken.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
This commit is contained in:
Zhen Lei 2021-06-30 18:55:55 -07:00 committed by Ksawlii
parent 867fdfeb8a
commit aa60ec0163
7 changed files with 12 additions and 12 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
lib/decompress_bunzip2.c
View file

@ -80,7 +80,7 @@
/* This is what we know about each Huffman coding group */ /* This is what we know about each Huffman coding group */
struct group_data { 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 limit[MAX_HUFCODE_BITS+1];
int base[MAX_HUFCODE_BITS]; int base[MAX_HUFCODE_BITS];
int permute[MAX_SYMBOLS]; int permute[MAX_SYMBOLS];
@ -337,7 +337,7 @@ static int INIT get_next_block(struct bunzip_data *bd)
pp <<= 1; pp <<= 1;
base[i+1] = pp-(t += temp[i]); 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. */ * reading next sym. */
limit[maxLen] = pp+temp[maxLen]-1; limit[maxLen] = pp+temp[maxLen]-1;
base[minLen] = 0; base[minLen] = 0;

2
lib/decompress_unxz.c
View file

@ -23,7 +23,7 @@
* uncompressible. Thus, we must look for worst-case expansion when the * uncompressible. Thus, we must look for worst-case expansion when the
* compressor is encoding uncompressible data. * 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. * Sizes (as bytes) of the fields are in parenthesis.
* *
* Stream Header (12) * Stream Header (12)

4
lib/decompress_unzstd.c
View file

@ -16,7 +16,7 @@
* uncompressible. Thus, we must look for worst-case expansion when the * uncompressible. Thus, we must look for worst-case expansion when the
* compressor is encoding uncompressible data. * 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. * Maximum sizes (as bytes) of the fields are in parenthesis.
* *
* Frame Header: (18) * Frame Header: (18)
@ -56,7 +56,7 @@
/* /*
* Preboot environments #include "path/to/decompress_unzstd.c". * Preboot environments #include "path/to/decompress_unzstd.c".
* All of the source files we depend on must be #included. * 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. * dependencies.
* *
* When UNZSTD_PREBOOT is defined we declare __decompress(), which is * When UNZSTD_PREBOOT is defined we declare __decompress(), which is

2
lib/xz/xz_dec_bcj.c
View file

@ -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 * 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. * filter in the chain had already returned XZ_STREAM_END.
*/ */
if (s->temp.filtered > 0) { if (s->temp.filtered > 0) {

8
lib/xz/xz_dec_lzma2.c
View file

@ -147,8 +147,8 @@ struct lzma_dec {
/* /*
* LZMA properties or related bit masks (number of literal * LZMA properties or related bit masks (number of literal
* context bits, a mask dervied from the number of literal * context bits, a mask derived from the number of literal
* position bits, and a mask dervied from the number * position bits, and a mask derived from the number
* position bits) * position bits)
*/ */
uint32_t lc; uint32_t lc;
@ -501,7 +501,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 * 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 * 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 * doesn't seem to be a good idea (tested with GCC 3.3.6, 3.4.6, and 4.3.3
@ -778,7 +778,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. * here, because LZMA state may be reset without resetting the dictionary.
*/ */
static void lzma_reset(struct xz_dec_lzma2 *s) static void lzma_reset(struct xz_dec_lzma2 *s)

2
lib/zlib_inflate/inffast.c
View file

@ -15,7 +15,7 @@ union uu {
unsigned char b[2]; unsigned char b[2];
}; };
/* Endian independed version */ /* Endian independent version */
static inline unsigned short static inline unsigned short
get_unaligned16(const unsigned short *p) get_unaligned16(const unsigned short *p)
{ {

2
lib/zstd/huf.h
View file

@ -134,7 +134,7 @@ typedef enum {
HUF_repeat_none, /**< Cannot use the previous table */ 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, 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 */ 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_repeat;
/** HUF_compress4X_repeat() : /** HUF_compress4X_repeat() :
* Same as HUF_compress4X_wksp(), but considers using hufTable if *repeat != HUF_repeat_none. * Same as HUF_compress4X_wksp(), but considers using hufTable if *repeat != HUF_repeat_none.