163 #  define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)  argument
167 #  define send_code(s, c, tree) \  argument
176 #define put_short(s, w) { \  argument
190 send_bits(deflate_state *s, int value, int length)  in send_bits()
212 #define send_bits(s, value, length) \  argument
385 _tr_init(deflate_state *s)  in _tr_init()
414 init_block(deflate_state *s)  in init_block()
436 #define pqremove(s, tree, top) \  argument
459 pqdownheap(deflate_state *s, ct_data *tree, int k) /* the tree to restore, node to move down */  in pqdownheap()
493 gen_bitlen(deflate_state *s, tree_desc *desc)  in gen_bitlen()
624 build_tree(deflate_state *s, tree_desc *desc) /* the tree descriptor */  in build_tree()
712 scan_tree (deflate_state *s, ct_data *tree, int max_code)  in scan_tree()
758 send_tree (deflate_state *s, ct_data *tree, int max_code) /* same as above */  in send_tree()
808 build_bl_tree(deflate_state *s)  in build_bl_tree()
844 send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes)  in send_all_trees()
874 _tr_stored_block(deflate_state *s, charf *buf,  in _tr_stored_block()
890 _tr_flush_bits(deflate_state *s)  in _tr_flush_bits()
901 _tr_align(deflate_state *s)  in _tr_align()
917 _tr_flush_block(deflate_state *s, charf *buf,
1019 _tr_tally (deflate_state *s, unsigned dist, unsigned lc)
1068 compress_block(deflate_state *s, const ct_data *ltree, const ct_data *dtree)
1127 detect_data_type(deflate_state *s)
1177 bi_flush(deflate_state *s)
1195 bi_windup(deflate_state *s)
1215 copy_block(deflate_state *s, charf *buf, unsigned len, int header)