Eric Lee / linux-smarc-t335x-v3.2

Download as
Browse Code ยป

Commit 643d1f7fe3aa12c8bdea6fa5b4ba874ff6dd601d

Authored by Joe Perches
Committed by Adrian Bunk
1 parent 0b0a3e7b18
Exists in master and in 4 other branches v3.2_AM335xPSP_04.06.00.11, v3.2_NEWT335xPSP_04.06.00.11, v3.2_SBC_SMARTMEN, v3.2_SMARCT335xPSP_04.06.00.11

lib/: Spelling fixes 

Signed-off-by: Joe Perches <joe@perches.com>
Signed-off-by: Adrian Bunk <bunk@kernel.org>

Showing 2 changed files with 2 additions and 2 deletions Side-by-side Diff

... ... @@ -348,7 +348,7 @@
348 348 * but again the multiple of the polynomial to subtract depends only on
349 349 * the high bits, the high 8 bits in this case.
350 350 *
351   - * The multile we need in that case is the low 32 bits of a 40-bit
  351 + * The multiple we need in that case is the low 32 bits of a 40-bit
352 352 * value whose high 8 bits are given, and which is a multiple of the
353 353 * generator polynomial. This is simply the CRC-32 of the given
354 354 * one-byte message.
lib/zlib_deflate/defutil.h
Diff comments   View file @ 643d1f7
... ... @@ -164,7 +164,7 @@
164 164 int nice_match; /* Stop searching when current match exceeds this */
165 165  
166 166 /* used by trees.c: */
167   - /* Didn't use ct_data typedef below to supress compiler warning */
  167 + /* Didn't use ct_data typedef below to suppress compiler warning */
168 168 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
169 169 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
170 170 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */