summaryrefslogtreecommitdiffstats
path: root/sys/kern/inflate.c
diff options
context:
space:
mode:
Diffstat (limited to 'sys/kern/inflate.c')
-rw-r--r--sys/kern/inflate.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/sys/kern/inflate.c b/sys/kern/inflate.c
index 383ebc4..8fde5cb 100644
--- a/sys/kern/inflate.c
+++ b/sys/kern/inflate.c
@@ -206,7 +206,7 @@ extern void kzipfree (void*);
end-of-block. Note however that the static length tree defines
288 codes just to fill out the Huffman codes. Codes 286 and 287
cannot be used though, since there is no length base or extra bits
- defined for them. Similarily, there are up to 30 distance codes.
+ defined for them. Similarly, there are up to 30 distance codes.
However, static trees define 32 codes (all 5 bits) to fill out the
Huffman codes, but the last two had better not show up in the data.
7. Unzip can check dynamic Huffman blocks for complete code sets.
@@ -335,7 +335,7 @@ static const ush mask[] = {
where NEEDBITS makes sure that b has at least j bits in it, and
DUMPBITS removes the bits from b. The macros use the variable k
for the number of bits in b. Normally, b and k are register
- variables for speed, and are initialized at the begining of a
+ variables for speed, and are initialized at the beginning of a
routine that uses these macros from a global bit buffer and count.
In order to not ask for more bits than there are in the compressed
OpenPOWER on IntegriCloud