Code
tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len] - 1));
# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
send_bits(s, tree[c].Code, tree[c].Len); }
static_dtree[n].Code = bi_reverse((unsigned)n, 5);
fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code,
fprintf(header, "{{%2u},{%2u}}%s", static_dtree[i].Code,
u_char Code[0x1000]; /* 0x3000-0x3fff code area */
info->Type, info->Code, info->Argument);
# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
send_bits(s, tree[c].Code, tree[c].Len); }
static_dtree[n].Code = bi_reverse((unsigned)n, 5);
fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code,
fprintf(header, "{{%2u},{%2u}}%s", static_dtree[i].Code,
tree[n].Code = bi_reverse(next_code[len]++, len);
n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
printf("\tCode=0x%04x\n", (u_int)ctlreg->Code);