Lines Matching defs:Code
341 #define Code fc.code
1492 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1632 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
2378 #define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
2384 send_bits(s, tree[c].Code, tree[c].Len); }
2531 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
2784 tree[n].Code = bi_reverse(next_code[len]++, len);
2788 n, (isgraph(n) ? n : ' '), len, tree[n].Code,
4265 * 6. There are up to 286 literal/length codes. Code 256 represents the
4280 * 10. In the tree reconstruction algorithm, Code = Code + Increment