Lines Matching refs:Code
321 #define Code fc.code
1303 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1986 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
1992 send_bits(s, tree[c].Code, tree[c].Len); }
2129 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
2360 tree[n].Code = bi_reverse(next_code[len]++, len);
2363 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
3647 6. There are up to 286 literal/length codes. Code 256 represents the
3662 10. In the tree reconstruction algorithm, Code = Code + Increment