send_bits
send_bits(s, lc, extra); /* send the extra length bits */
send_bits(s, dist, extra); /* send the extra distance bits */
# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
send_bits(s, tree[c].Code, tree[c].Len); }
local void send_bits (deflate_state *s, int value, int length);
send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);
send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);
send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);
send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */
send_bits(s, dcodes-1, 5);
send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
send_bits(s, (STORED_BLOCK<<1)+last, 3); /* send block type */
send_bits(s, STATIC_TREES<<1, 3);
send_bits(s, (STATIC_TREES<<1)+last, 3);
send_bits(s, (DYN_TREES<<1)+last, 3);
# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
send_bits(s, tree[c].Code, tree[c].Len); }
local void send_bits OF((deflate_state *s, int value, int length));
send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);
send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);
send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);
send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */
send_bits(s, dcodes-1, 5);
send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
send_bits(s, (STORED_BLOCK<<1)+eof, 3); /* send block type */
send_bits(s, (STORED_BLOCK << 1), 3);
send_bits(s, STATIC_TREES<<1, 3);
send_bits(s, STATIC_TREES<<1, 3);
send_bits(s, (STATIC_TREES<<1)+eof, 3);
send_bits(s, (DYN_TREES<<1)+eof, 3);
send_bits(s, lc, extra); /* send the extra length bits */
send_bits(s, dist, extra); /* send the extra distance bits */
send_bits(s, lc, extra); /* send the extra length bits */
send_bits(s, dist, extra); /* send the extra distance bits */
# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
send_bits(s, tree[c].Code, tree[c].Len); }
local void send_bits (deflate_state *s, int value, int length);
send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);
send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);
send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);
send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */
send_bits(s, dcodes-1, 5);
send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
send_bits(s, (STORED_BLOCK<<1)+last, 3); /* send block type */
send_bits(s, STATIC_TREES<<1, 3);
send_bits(s, (STATIC_TREES<<1)+last, 3);
send_bits(s, (DYN_TREES<<1)+last, 3);
send_bits(s, lc, extra); /* send the extra length bits */
send_bits(s, dist, extra); /* send the extra distance bits */
# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
send_bits(s, tree[c].Code, tree[c].Len); }
local void send_bits (deflate_state *s, int value, int length);
send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);
send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);
send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);
send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */
send_bits(s, dcodes-1, 5);
send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
send_bits(s, (STORED_BLOCK<<1)+last, 3); /* send block type */
send_bits(s, STATIC_TREES<<1, 3);
send_bits(s, (STATIC_TREES<<1)+last, 3);
send_bits(s, (DYN_TREES<<1)+last, 3);