HomeSort by relevance Sort by last modified time
    Searched refs:BL_CODES (Results 1 - 4 of 4) sorted by null

  /external/qemu/distrib/zlib-1.2.3/
deflate.h 42 #define BL_CODES 19
194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
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,
    [all...]
  /external/zlib/
deflate.h 42 #define BL_CODES 19
194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
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]
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,
    [all...]

Completed in 88 milliseconds