/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/lib/zlib_deflate/ |
H A D | defutil.h | 24 #define BL_CODES 19 macro 170 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
|
H A D | deftree.c | 69 static const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 72 static const uch bl_order[BL_CODES] 129 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; 335 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; 744 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { 770 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/zlib-1.2.8/ |
H A D | deflate.h | 42 #define BL_CODES 19 macro 197 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
|
H A D | trees.c | 68 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 71 local const uch bl_order[BL_CODES] 132 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; 417 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; 820 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { 843 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/zlib/ |
H A D | deflate.h | 42 #define BL_CODES 19 macro 194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
|
H A D | trees.c | 67 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 70 local const uch bl_order[BL_CODES] 136 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; 419 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; 822 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { 845 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/zlib-1.2.3/ |
H A D | deflate.h | 42 #define BL_CODES 19 macro 194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
|
H A D | trees.c | 67 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 70 local const uch bl_order[BL_CODES] 136 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; 419 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; 822 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { 845 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/transmission/zlib-1.2.3/ |
H A D | deflate.h | 42 #define BL_CODES 19 macro 194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
|
H A D | trees.c | 67 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 70 local const uch bl_order[BL_CODES] 136 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; 419 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; 822 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { 845 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/zlib-1.2.7/ |
H A D | deflate.h | 42 #define BL_CODES 19 macro 197 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
|
H A D | trees.c | 68 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 71 local const uch bl_order[BL_CODES] 132 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; 417 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; 820 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { 843 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/ |
H A D | trees.c | 154 #define BL_CODES 19 macro 164 local int near extra_blbits[BL_CODES]/* extra bits for each bit length code */ 253 local ct_data near bl_tree[2*BL_CODES+1]; 273 {bl_tree, NULL, extra_blbits, 0, BL_CODES, MAX_BL_BITS, 0}; 279 local uch near bl_order[BL_CODES] 566 for (n = 0; n < BL_CODES; n++) bl_tree[n].Freq = 0; 964 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { 985 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
|
/netgear-R7000-V1.0.7.12_1.2.5/src/router/busybox-1.x/archival/ |
H A D | gzip.c | 768 #define BL_CODES 19 macro 784 static const uint8_t extra_blbits[BL_CODES] ALIGN1 = { 788 static const uint8_t bl_order[BL_CODES] ALIGN1 = { 896 ct_data bl_tree[2 * BL_CODES + 1]; 1003 for (n = 0; n < BL_CODES; n++) 1437 for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) { 1460 && blcodes <= BL_CODES, "too many codes"); 2068 G2.bl_desc.elems = BL_CODES;
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/ppp-2.4.4/pppdump/ |
H A D | zlib.c | 167 #define BL_CODES 19 macro 315 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ 1502 local int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 1505 local uch bl_order[BL_CODES] 1563 {(ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; 1777 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; 2179 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { 2202 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
|
/netgear-R7000-V1.0.7.12_1.2.5/src/router/ppp/pppdump/ |
H A D | zlib.c | 167 #define BL_CODES 19 macro 315 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ 1502 local int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 1505 local uch bl_order[BL_CODES] 1563 {(ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; 1777 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; 2179 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { 2202 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/ppp-2.4.4/common/ |
H A D | zlib.c | 293 #define BL_CODES 19 macro 440 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ 1899 local int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 1902 local uch bl_order[BL_CODES] 1959 {(ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; 2175 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; 2577 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { 2600 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
|
/netgear-R7000-V1.0.7.12_1.2.5/src/router/ppp/common/ |
H A D | zlib.c | 293 #define BL_CODES 19 macro 440 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ 1899 local int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 1902 local uch bl_order[BL_CODES] 1959 {(ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; 2175 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; 2577 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { 2600 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
|