Lines Matching refs:ct_data

329 } FAR ct_data;  typedef
339     ct_data *dyn_tree;           /* the dynamic tree */
1928 local ct_data static_ltree[L_CODES+2];
1935 local ct_data static_dtree[D_CODES];
1956     ct_data *static_tree;        /* static tree or NULL */
1970 {(ct_data *)0, extra_blbits, 0,      BL_CODES, MAX_BL_BITS};
1978 local void pqdownheap     OF((deflate_state *s, ct_data *tree, int k));
1980 local void gen_codes      OF((ct_data *tree, int max_code, ushf *bl_count));
1982 local void scan_tree      OF((deflate_state *s, ct_data *tree, int max_code));
1983 local void send_tree      OF((deflate_state *s, ct_data *tree, int max_code));
1987 local void compress_block OF((deflate_state *s, ct_data *ltree,
1988                               ct_data *dtree));
2133     gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);  in tr_static_init()
2222     ct_data *tree;  /* the tree to restore */
2259     ct_data *tree  = desc->dyn_tree;
2261     ct_data *stree = desc->stat_desc->static_tree;
2343     ct_data *tree;             /* the tree to decorate */  in gen_codes()
2388     ct_data *tree   = desc->dyn_tree;
2389     ct_data *stree  = desc->stat_desc->static_tree;
2464     gen_codes ((ct_data *)tree, max_code, s->bl_count);
2473     ct_data *tree;   /* the tree to be scanned */
2518     ct_data *tree; /* the tree to be scanned */
2573     scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
2574     scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
2621     send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
2624     send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
2778         compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree);
2784         compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
2854     ct_data *ltree; /* literal tree */
2855     ct_data *dtree; /* distance tree */