Home
last modified time | relevance | path

Searched refs:BL_CODES (Results 1 - 10 of 10) sorted by relevance

/third_party/node/deps/zlib/
H A Ddeflate.h46 #define BL_CODES 19 macro
204 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]
138 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
445 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; in init_block()
815 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { in build_bl_tree()
836 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()
/third_party/node/deps/v8/third_party/zlib/
H A Ddeflate.h42 #define BL_CODES 19 macro
200 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]
132 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
415 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
818 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {
841 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
/third_party/libwebsockets/win32port/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,
/third_party/skia/third_party/externals/zlib/
H A Ddeflate.h42 #define BL_CODES 19 macro
200 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]
132 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
415 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
818 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {
841 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
/third_party/zlib/
H A Ddeflate.h46 #define BL_CODES 19 macro
204 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]
138 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
462 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; in init_block()
838 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { in build_bl_tree()
860 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()

Completed in 12 milliseconds