Home
last modified time | relevance | path

Searched refs:send_code (Results 1 – 4 of 4) sorted by relevance

/illumos-gate/usr/src/contrib/zlib/
H A Dtrees.c161 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) macro
165 # define send_code(s, c, tree) \ macro
769 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
773 send_code(s, curlen, s->bl_tree); count--;
776 send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);
779 send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);
782 send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);
901 send_code(s, END_BLOCK, static_ltree);
1059 send_code(s, lc, ltree); /* send a literal byte */
1064 send_code(s, code+LITERALS+1, ltree); /* send the length code */
[all …]
/illumos-gate/usr/src/tools/smatch/src/smatch_data/
H A Dkernel.ignore_side_effects61 send_code
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c1590 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) macro
1594 # define send_code(s, c, tree) \ macro
2130 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
2134 send_code(s, curlen, s->bl_tree); count--;
2137 send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);
2140 send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);
2143 send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);
2260 send_code(s, END_BLOCK, static_ltree);
2269 send_code(s, END_BLOCK, static_ltree);
2466 send_code(s, lc, ltree); /* send a literal byte */
[all …]
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c2376 #define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) macro
2380 #define send_code(s, c, tree) \ macro
2966 do { send_code(s, curlen, s->bl_tree); }
2971 send_code(s, curlen, s->bl_tree); count--;
2974 send_code(s, REP_3_6, s->bl_tree);
2978 send_code(s, REPZ_3_10, s->bl_tree);
2982 send_code(s, REPZ_11_138, s->bl_tree);
3130 send_code(s, END_BLOCK, static_ltree);
3142 send_code(s, END_BLOCK, static_ltree);
3373 send_code(s, lc, ltree);
[all …]