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

  /external/chromium_org/third_party/zlib/
trees.h 3 local const ct_data static_ltree[L_CODES+2] = {
64 local const ct_data static_dtree[D_CODES] = {
trees.c 91 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 *dtree))
    [all...]
deflate.h 71 } FAR ct_data; typedef in typeref:struct:ct_data_s
81 ct_data *dyn_tree; /* the dynamic tree */
196 /* Didn't use ct_data typedef below to supress compiler warning */
  /external/qemu/distrib/zlib-1.2.3/
trees.h 3 local const ct_data static_ltree[L_CODES+2] = {
64 local const ct_data static_dtree[D_CODES] = {
trees.c 90 local ct_data static_ltree[L_CODES+2];
97 local ct_data static_dtree[D_CODES];
122 const ct_data *static_tree; /* static tree or NULL */
136 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
144 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
146 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
148 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
149 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
153 local void compress_block OF((deflate_state *s, ct_data *ltree,
154 ct_data *dtree))
    [all...]
deflate.h 71 } FAR ct_data; typedef in typeref:struct:ct_data_s
81 ct_data *dyn_tree; /* the dynamic tree */
191 /* Didn't use ct_data typedef below to supress compiler warning */
  /external/zlib/src/
trees.h 3 local const ct_data static_ltree[L_CODES+2] = {
64 local const ct_data static_dtree[D_CODES] = {
trees.c 86 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 *dtree))
    [all...]
deflate.h 74 } FAR ct_data; typedef in typeref:struct:ct_data_s
84 ct_data *dyn_tree; /* the dynamic tree */
194 /* Didn't use ct_data typedef below to suppress compiler warning */

Completed in 298 milliseconds