Searched refs:L_CODES (Results 1 - 14 of 14) sorted by relevance
/macosx-10.10/rsync-45/rsync/zlib/ |
H A D | trees.h | 3 local const ct_data static_ltree[L_CODES+2] = {
|
H A D | deflate.h | 36 #define L_CODES (LITERALS+1+LENGTH_CODES) macro 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];
|
H A D | 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,
|
/macosx-10.10/sudo-73/src/zlib/ |
H A D | trees.h | 3 local const ct_data static_ltree[L_CODES+2] = {
|
H A D | deflate.h | 36 #define L_CODES (LITERALS+1+LENGTH_CODES) macro 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];
|
H A D | 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,
|
/macosx-10.10/xnu-2782.1.97/libkern/zlib/ |
H A D | trees.h | 30 local const ct_data static_ltree[L_CODES+2] = {
|
H A D | deflate.h | 63 #define L_CODES (LITERALS+1+LENGTH_CODES) macro 72 #define HEAP_SIZE (2*L_CODES+1) 230 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ 237 uch depth[2*L_CODES+1];
|
H A D | trees.c | 117 local ct_data static_ltree[L_CODES+2]; 119 * need for the L_CODES extra codes used during heap construction. However 157 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS}; 330 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); 366 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n"); 367 for (i = 0; i < L_CODES+2; i++) { 369 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); 444 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; 872 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
|
/macosx-10.10/zlib-55/zlib/ |
H A D | trees.h | 3 local const ct_data static_ltree[L_CODES+2] = {
|
H A D | deflate.h | 36 #define L_CODES (LITERALS+1+LENGTH_CODES) macro 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];
|
H A D | 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,
|
/macosx-10.10/ppp-786.1.1/Helpers/pppdump/ |
H A D | zlib.c | 183 #define L_CODES (LITERALS+1+LENGTH_CODES) macro 192 #define HEAP_SIZE (2*L_CODES+1) 346 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ 353 uch depth[2*L_CODES+1]; 1543 local ct_data static_ltree[L_CODES+2]; 1545 * need for the L_CODES extra codes used during heap construction. However 1579 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS}; 1746 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); 1797 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; 2224 Assert (lcodes <= L_CODES [all...] |
/macosx-10.10/ksh-23/ksh/src/cmd/INIT/ |
H A D | ratz.c | 1246 #define L_CODES (LITERALS+1+LENGTH_CODES) macro 1255 #define HEAP_SIZE (2*L_CODES+1) 1413 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ 1420 uch depth[2*L_CODES+1];
|
Completed in 296 milliseconds