Home
last modified time | relevance | path

Searched refs:ct_data (Results 1 - 15 of 15) sorted by relevance

/third_party/node/deps/v8/third_party/zlib/
H A Dtrees.c86 local ct_data static_ltree[L_CODES+2];
93 local ct_data static_dtree[D_CODES];
118 const ct_data *static_tree; /* static tree or NULL */
132 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
140 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
144 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
145 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
149 local void compress_block OF((deflate_state *s, const ct_data *ltree,
150 const ct_data *dtre
[all...]
H A Dtrees.h3 local const ct_data static_ltree[L_CODES+2] = {
64 local const ct_data static_dtree[D_CODES] = {
H A Ddeflate.h77 } FAR ct_data; typedef
87 ct_data *dyn_tree; /* the dynamic tree */
197 /* Didn't use ct_data typedef below to suppress compiler warning */
/third_party/libwebsockets/win32port/zlib/
H A Dtrees.c91 local ct_data static_ltree[L_CODES+2];
98 local ct_data static_dtree[D_CODES];
123 const ct_data *static_tree; /* static tree or NULL */
137 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
145 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
147 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
149 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
150 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
154 local void compress_block OF((deflate_state *s, ct_data *ltree,
155 ct_data *dtre
[all...]
H A Dtrees.h3 local const ct_data static_ltree[L_CODES+2] = {
64 local const ct_data static_dtree[D_CODES] = {
H A Ddeflate.h71 } FAR ct_data; typedef
81 ct_data *dyn_tree; /* the dynamic tree */
191 /* Didn't use ct_data typedef below to supress compiler warning */
/third_party/skia/third_party/externals/zlib/
H A Dtrees.c86 local ct_data static_ltree[L_CODES+2];
93 local ct_data static_dtree[D_CODES];
118 const ct_data *static_tree; /* static tree or NULL */
132 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
140 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
144 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
145 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
149 local void compress_block OF((deflate_state *s, const ct_data *ltree,
150 const ct_data *dtre
[all...]
H A Dtrees.h3 local const ct_data static_ltree[L_CODES+2] = {
64 local const ct_data static_dtree[D_CODES] = {
H A Ddeflate.h77 } FAR ct_data; typedef
87 ct_data *dyn_tree; /* the dynamic tree */
197 /* Didn't use ct_data typedef below to suppress compiler warning */
/third_party/node/deps/zlib/
H A Dtrees.c86 local ct_data static_ltree[L_CODES+2];
93 local ct_data static_dtree[D_CODES];
118 const ct_data *static_tree; /* static tree or NULL */
138 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
202 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) { in gen_codes()
360 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
395 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n"); in gen_trees_header()
401 fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n"); in gen_trees_header()
507 local void pqdownheap(deflate_state *s, ct_data *tree, int k) { in pqdownheap()
539 ct_data *tre in gen_bitlen()
[all...]
H A Dtrees.h3 local const ct_data static_ltree[L_CODES+2] = {
64 local const ct_data static_dtree[D_CODES] = {
H A Ddeflate.h81 } FAR ct_data; typedef
91 ct_data *dyn_tree; /* the dynamic tree */
201 /* Didn't use ct_data typedef below to suppress compiler warning */
/third_party/zlib/
H A Dtrees.c86 local ct_data static_ltree[L_CODES+2];
93 local ct_data static_dtree[D_CODES];
118 const ct_data *static_tree; /* static tree or NULL */
138 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
214 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) in gen_codes()
375 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
411 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n"); in gen_trees_header()
417 fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n"); in gen_trees_header()
524 local void pqdownheap(deflate_state *s, ct_data *tree, int k) in pqdownheap()
558 ct_data *tre in gen_bitlen()
[all...]
H A Dtrees.h3 local const ct_data static_ltree[L_CODES+2] = {
64 local const ct_data static_dtree[D_CODES] = {
H A Ddeflate.h81 } FAR ct_data; typedef
91 ct_data *dyn_tree; /* the dynamic tree */
201 /* Didn't use ct_data typedef below to suppress compiler warning */

Completed in 11 milliseconds