| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/ |
| trees.h | 3 local const ct_data static_ltree[L_CODES+2] = {
|
| deflate.h | 36 #define L_CODES (LITERALS+1+LENGTH_CODES)
45 #define HEAP_SIZE (2*L_CODES+1)
206 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
213 uch depth[2*L_CODES+1];
|
| trees.c | 86 local ct_data static_ltree[L_CODES+2];
88 * need for the L_CODES extra codes used during heap construction. However
126 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
301 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
337 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
338 for (i = 0; i < L_CODES+2; i++) {
340 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
415 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
843 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/ |
| trees.h | 3 local const ct_data static_ltree[L_CODES+2] = {
|
| deflate.h | 36 #define L_CODES (LITERALS+1+LENGTH_CODES)
45 #define HEAP_SIZE (2*L_CODES+1)
203 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
210 uch depth[2*L_CODES+1];
|
| trees.c | 90 local ct_data static_ltree[L_CODES+2];
92 * need for the L_CODES extra codes used during heap construction. However
130 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
303 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
339 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
340 for (i = 0; i < L_CODES+2; i++) {
342 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
417 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
845 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
[all...] |
| /external/python/cpython2/Modules/zlib/ |
| trees.h | 3 local const ct_data static_ltree[L_CODES+2] = {
|
| deflate.h | 36 #define L_CODES (LITERALS+1+LENGTH_CODES)
45 #define HEAP_SIZE (2*L_CODES+1)
206 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
213 uch depth[2*L_CODES+1];
|
| trees.c | 86 local ct_data static_ltree[L_CODES+2];
88 * need for the L_CODES extra codes used during heap construction. However
126 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
301 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
337 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
338 for (i = 0; i < L_CODES+2; i++) {
340 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
415 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
843 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
[all...] |
| /external/python/cpython3/Modules/zlib/ |
| trees.h | 3 local const ct_data static_ltree[L_CODES+2] = {
|
| deflate.h | 36 #define L_CODES (LITERALS+1+LENGTH_CODES)
45 #define HEAP_SIZE (2*L_CODES+1)
209 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
216 uch depth[2*L_CODES+1];
|
| trees.c | 86 local ct_data static_ltree[L_CODES+2];
88 * need for the L_CODES extra codes used during heap construction. However
126 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
299 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
335 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
336 for (i = 0; i < L_CODES+2; i++) {
338 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
413 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
841 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
[all...] |
| /external/syslinux/com32/lib/zlib/ |
| trees.h | 3 local const ct_data static_ltree[L_CODES+2] = {
|
| deflate.h | 36 #define L_CODES (LITERALS+1+LENGTH_CODES)
45 #define HEAP_SIZE (2*L_CODES+1)
203 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
210 uch depth[2*L_CODES+1];
|
| trees.c | 91 local ct_data static_ltree[L_CODES+2];
93 * need for the L_CODES extra codes used during heap construction. However
131 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
306 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
342 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
343 for (i = 0; i < L_CODES+2; i++) {
345 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
421 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
849 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
[all...] |
| /external/zlib/src/ |
| trees.h | 3 local const ct_data static_ltree[L_CODES+2] = {
|
| deflate.h | 36 #define L_CODES (LITERALS+1+LENGTH_CODES)
45 #define HEAP_SIZE (2*L_CODES+1)
209 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
216 uch depth[2*L_CODES+1];
|
| trees.c | 86 local ct_data static_ltree[L_CODES+2];
88 * need for the L_CODES extra codes used during heap construction. However
126 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
299 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
335 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
336 for (i = 0; i < L_CODES+2; i++) {
338 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
413 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
841 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
[all...] |
| /toolchain/binutils/binutils-2.27/zlib/ |
| trees.h | 3 local const ct_data static_ltree[L_CODES+2] = {
|
| deflate.h | 36 #define L_CODES (LITERALS+1+LENGTH_CODES)
45 #define HEAP_SIZE (2*L_CODES+1)
206 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
213 uch depth[2*L_CODES+1];
|
| trees.c | 86 local ct_data static_ltree[L_CODES+2];
88 * need for the L_CODES extra codes used during heap construction. However
126 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
301 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
337 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
338 for (i = 0; i < L_CODES+2; i++) {
340 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
415 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
843 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
[all...] |
