adulau/aha
1
0
Fork 0
mirror of https://github.com/adulau/aha.git synced 2024-12-28 03:36:19 +00:00
Code Issues Projects Releases Packages Wiki Activity

lib/: Spelling fixes

Browse source 
Signed-off-by: Joe Perches <joe@perches.com>
Signed-off-by: Adrian Bunk <bunk@kernel.org>
This commit is contained in:
Joe Perches 2008-02-03 17:48:52 +02:00 committed by Adrian Bunk
parent 0b0a3e7b18
commit 643d1f7fe3
2 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
lib/crc32.c
View file

@ -348,7 +348,7 @@ EXPORT_SYMBOL(crc32_be);
* but again the multiple of the polynomial to subtract depends only on * but again the multiple of the polynomial to subtract depends only on
* the high bits, the high 8 bits in this case. * the high bits, the high 8 bits in this case.
* *
* The multile we need in that case is the low 32 bits of a 40-bit * The multiple we need in that case is the low 32 bits of a 40-bit
* value whose high 8 bits are given, and which is a multiple of the * value whose high 8 bits are given, and which is a multiple of the
* generator polynomial. This is simply the CRC-32 of the given * generator polynomial. This is simply the CRC-32 of the given
* one-byte message. * one-byte message.

2
lib/zlib_deflate/defutil.h
View file

@ -164,7 +164,7 @@ typedef struct deflate_state {
int nice_match; /* Stop searching when current match exceeds this */ int nice_match; /* Stop searching when current match exceeds this */
/* used by trees.c: */ /* used by trees.c: */
/* Didn't use ct_data typedef below to supress compiler warning */ /* Didn't use ct_data typedef below to suppress compiler warning */
struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */