Lines Matching refs:ct_data
840 typedef struct ct_data {
849 } ct_data;
860 ct_data *dyn_tree; /* the dynamic tree */
861 ct_data *static_tree; /* corresponding static tree or NULL */
879 ct_data dyn_ltree[HEAP_SIZE]; /* literal and length tree */
880 ct_data dyn_dtree[2 * D_CODES + 1]; /* distance tree */
882 ct_data static_ltree[L_CODES + 2];
890 ct_data static_dtree[D_CODES];
896 ct_data bl_tree[2 * BL_CODES + 1];
962 static void gen_codes(ct_data * tree, int max_code);
964 static void scan_tree(ct_data * tree, int max_code);
965 static void send_tree(ct_data * tree, int max_code);
968 static void compress_block(ct_data * ltree, ct_data * dtree);
1027 static void pqdownheap(ct_data * tree, int k)
1064 ct_data *tree = desc->dyn_tree;
1069 ct_data *stree = desc->static_tree;
1158 static void gen_codes(ct_data * tree, int max_code)
1218 ct_data *tree = desc->dyn_tree;
1219 ct_data *stree = desc->static_tree;
1298 gen_codes((ct_data *) tree, max_code);
1308 static void scan_tree(ct_data * tree, int max_code)
1361 static void send_tree(ct_data * tree, int max_code)
1471 send_tree((ct_data *) G2.dyn_ltree, lcodes - 1); /* send the literal tree */
1474 send_tree((ct_data *) G2.dyn_dtree, dcodes - 1); /* send the distance tree */
1539 static void compress_block(ct_data * ltree, ct_data * dtree)
1652 compress_block((ct_data *) G2.static_ltree, (ct_data *) G2.static_dtree);
1658 compress_block((ct_data *) G2.dyn_ltree, (ct_data *) G2.dyn_dtree);
1958 gen_codes((ct_data *) G2.static_ltree, L_CODES + 1);