| inftrees.c (230837) | inftrees.c (237248) |
|---|---|
| 1/* inftrees.c -- generate Huffman trees for efficient decoding 2 * Copyright (C) 1995-2012 Mark Adler 3 * For conditions of distribution and use, see copyright notice in zlib.h 4 */ 5 6#include "zutil.h" 7#include "inftrees.h" 8 9#define MAXBITS 15 10 11const char inflate_copyright[] = | 1/* inftrees.c -- generate Huffman trees for efficient decoding 2 * Copyright (C) 1995-2012 Mark Adler 3 * For conditions of distribution and use, see copyright notice in zlib.h 4 */ 5 6#include "zutil.h" 7#include "inftrees.h" 8 9#define MAXBITS 15 10 11const char inflate_copyright[] = |
| 12 " inflate 1.2.6 Copyright 1995-2012 Mark Adler "; | 12 " inflate 1.2.7 Copyright 1995-2012 Mark Adler "; |
| 13/* 14 If you use the zlib library in a product, an acknowledgment is welcome 15 in the documentation of your product. If for some reason you cannot 16 include such an acknowledgment, I would appreciate that you keep this 17 copyright string in the executable of your product. 18 */ 19 20/* --- 36 unchanged lines hidden (view full) --- 57 int end; /* use base and extra for symbol > end */ 58 unsigned short count[MAXBITS+1]; /* number of codes of each length */ 59 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */ 60 static const unsigned short lbase[31] = { /* Length codes 257..285 base */ 61 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 62 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0}; 63 static const unsigned short lext[31] = { /* Length codes 257..285 extra */ 64 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, | 13/* 14 If you use the zlib library in a product, an acknowledgment is welcome 15 in the documentation of your product. If for some reason you cannot 16 include such an acknowledgment, I would appreciate that you keep this 17 copyright string in the executable of your product. 18 */ 19 20/* --- 36 unchanged lines hidden (view full) --- 57 int end; /* use base and extra for symbol > end */ 58 unsigned short count[MAXBITS+1]; /* number of codes of each length */ 59 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */ 60 static const unsigned short lbase[31] = { /* Length codes 257..285 base */ 61 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 62 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0}; 63 static const unsigned short lext[31] = { /* Length codes 257..285 extra */ 64 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, |
| 65 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 203, 69}; | 65 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 78, 68}; |
| 66 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */ 67 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 68 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 69 8193, 12289, 16385, 24577, 0, 0}; 70 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */ 71 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 72 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 73 28, 28, 29, 29, 64, 64}; --- 233 unchanged lines hidden --- | 66 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */ 67 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 68 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 69 8193, 12289, 16385, 24577, 0, 0}; 70 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */ 71 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 72 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 73 28, 28, 29, 29, 64, 64}; --- 233 unchanged lines hidden --- |