Home
last modified time | relevance | path

Searched refs:BL_CODES (Results 1 – 4 of 4) sorted by relevance

/openbmc/u-boot/lib/zlib/
H A Ddeflate.h42 #define BL_CODES 19 macro
194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
H A Dtrees.c68 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
71 local const uch bl_order[BL_CODES]
137 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
423 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
826 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {
849 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
/openbmc/linux/lib/zlib_deflate/
H A Ddeftree.c70 static const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
73 static const uch bl_order[BL_CODES]
125 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
281 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; in init_block()
690 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { in build_bl_tree()
716 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()
H A Ddefutil.h26 #define BL_CODES 19 macro
172 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */