Searched refs:BL_CODES (Results 1 – 10 of 10) sorted by relevance
| /third_party/libwebsockets/win32port/zlib/ |
| D | deflate.h | 42 #define BL_CODES 19 macro
194 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]
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/zlib/ |
| D | deflate.h | 42 #define BL_CODES 19 macro
200 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};
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/node/deps/zlib/ |
| D | deflate.h | 42 #define BL_CODES 19 macro
200 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};
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/flutter/skia/third_party/externals/zlib/ |
| D | deflate.h | 42 #define BL_CODES 19 macro
200 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};
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/skia/third_party/externals/zlib/ |
| D | deflate.h | 42 #define BL_CODES 19 macro
200 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};
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,
|