Lines Matching defs:ct_data
219 typedef struct ct_data {
228 } ct_data;
238 local ct_data near dyn_ltree[HEAP_SIZE]; /* literal and length tree */
239 local ct_data near dyn_dtree[2*D_CODES+1]; /* distance tree */
241 local ct_data near static_ltree[L_CODES+2];
248 local ct_data near static_dtree[D_CODES];
253 local ct_data near bl_tree[2*BL_CODES+1];
257 ct_data near *dyn_tree; /* the dynamic tree */
258 ct_data near *static_tree; /* corresponding static tree or NULL */
429 local void pqdownheap OF((ct_data near *tree, int k));
431 local void gen_codes OF((ct_data near *tree, int max_code));
433 local void scan_tree OF((ct_data near *tree, int max_code));
434 local void send_tree OF((ct_data near *tree, int max_code));
437 local void compress_block OF((ct_data near *ltree, ct_data near *dtree));
544 gen_codes((ct_data near *)static_ltree, L_CODES+1);
604 ct_data near *tree; /* the tree to restore */
642 ct_data near *tree = desc->dyn_tree;
647 ct_data near *stree = desc->static_tree;
725 ct_data near *tree; /* the tree to decorate */
768 ct_data near *tree = desc->dyn_tree;
769 ct_data near *stree = desc->static_tree;
843 gen_codes ((ct_data near *)tree, max_code);
853 ct_data near *tree; /* the tree to be scanned */
897 ct_data near *tree; /* the tree to be scanned */
951 scan_tree((ct_data near *)dyn_ltree, l_desc.max_code);
952 scan_tree((ct_data near *)dyn_dtree, d_desc.max_code);
999 send_tree((ct_data near *)dyn_ltree, lcodes-1); /* send the literal tree */
1003 send_tree((ct_data near *)dyn_dtree, dcodes-1); /* send the distance tree */
1101 compress_block((ct_data near *)static_ltree, (ct_data near *)static_dtree);
1108 compress_block((ct_data near *)dyn_ltree, (ct_data near *)dyn_dtree);
1198 ct_data near *ltree; /* literal tree */
1199 ct_data near *dtree; /* distance tree */