sbin/hammer2/zlib/hammer2_zlib_trees.c

163

# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)

sbin/hammer2/zlib/hammer2_zlib_trees.c

169

send_bits(s, tree[c].Code, tree[c].Len); }

sbin/hammer2/zlib/hammer2_zlib_trees.c

307

static_dtree[n].Code = bi_reverse((unsigned)n, 5);

sbin/hammer2/zlib/hammer2_zlib_trees.c

341

fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code,

sbin/hammer2/zlib/hammer2_zlib_trees.c

347

fprintf(header, "{{%2u},{%2u}}%s", static_dtree[i].Code,

sbin/hammer2/zlib/hammer2_zlib_trees.c

607

tree[n].Code = bi_reverse(next_code[len]++, len);

sbin/hammer2/zlib/hammer2_zlib_trees.c

610

n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));

sys/dev/acpica/Osd/OsdDebug.c

78

fatal->Type, fatal->Code, fatal->Argument);

sys/net/zlib.c

1979

# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)

sys/net/zlib.c

1985

send_bits(s, tree[c].Code, tree[c].Len); }

sys/net/zlib.c

2123

static_dtree[n].Code = bi_reverse((unsigned)n, 5);

sys/net/zlib.c

2361

tree[n].Code = bi_reverse(next_code[len]++, len);

sys/net/zlib.c

2364

n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

163

# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

169

send_bits(s, tree[c].Code, tree[c].Len); }

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

307

static_dtree[n].Code = bi_reverse((unsigned)n, 5);

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

341

fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code,

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

347

fprintf(header, "{{%2u},{%2u}}%s", static_dtree[i].Code,

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

607

tree[n].Code = bi_reverse(next_code[len]++, len);

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

610

n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

163

# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

169

send_bits(s, tree[c].Code, tree[c].Len); }

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

307

static_dtree[n].Code = bi_reverse((unsigned)n, 5);

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

341

fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code,

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

347

fprintf(header, "{{%2u},{%2u}}%s", static_dtree[i].Code,

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

607

tree[n].Code = bi_reverse(next_code[len]++, len);

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

610

n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));