Searched refs:BL_CODES (Results 1 – 4 of 4) sorted by relevance
| /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
| 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 */
|
| D | fx_zlib_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; in init_block()
820 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { in build_bl_tree()
843 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()
|
| /external/zlib/src/ |
| 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 */
|
| 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,
|