diff options
| author | Rob Landley <rob@landley.net> | 2007-11-15 18:30:30 -0600 |
|---|---|---|
| committer | Rob Landley <rob@landley.net> | 2007-11-15 18:30:30 -0600 |
| commit | 2c226859cfc911c4a1eea009897050a16714aeec (patch) | |
| tree | 9ae05df2a1907a25eb8eec8af0e677775bb3e74b /lib/bunzip.c | |
| parent | 5d43eb420e036d993a9e100c9b46d7b78e323123 (diff) | |
| download | toybox-2c226859cfc911c4a1eea009897050a16714aeec.tar.gz | |
Remove trailing whitespace (thanks to Charlie Shepherd), and a couple comment
tweaks.
Diffstat (limited to 'lib/bunzip.c')
| -rw-r--r-- | lib/bunzip.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/lib/bunzip.c b/lib/bunzip.c index b7996983..17c91a9b 100644 --- a/lib/bunzip.c +++ b/lib/bunzip.c @@ -212,7 +212,7 @@ int read_bunzip_data(bunzip_data *bd) * * permute[] is the lookup table for converting huffman coded symbols * into decoded symbols. It contains symbol values sorted by length. - * + * * base[] is the amount to subtract from the value of a huffman symbol * of a given length when using permute[]. * @@ -235,9 +235,9 @@ int read_bunzip_data(bunzip_data *bd) // Calculate permute[], and zero temp[] and limit[]. pp = 0; - for (i = minLen; i <= maxLen; i++) + for (i = minLen; i <= maxLen; i++) temp[i] = limit[i] = 0; - for (t = 0; t < symCount; t++) + for (t = 0; t < symCount; t++) if (length[t] == i) hufGroup->permute[pp++] = t; // Count symbols coded for at each bit length |