Home
last modified time | relevance | path

Searched refs:code_length (Results 1 – 6 of 6) sorted by relevance

/plan9/sys/src/cmd/gs/src/
H A Dscfdgen.c72 uint code, int code_length, int run_length, int initial_bits) in cfd_count_nodes() argument
74 if (code_length <= initial_bits) { in cfd_count_nodes()
76 int sh = initial_bits - code_length; in cfd_count_nodes()
82 np->code_length = code_length; in cfd_count_nodes()
85 cfd_node *np = &tree[code >> (code_length - initial_bits)]; in cfd_count_nodes()
87 np->code_length = max(np->code_length, code_length); in cfd_count_nodes()
94 uint code, int code_length, int run_length, int initial_bits) in cfd_init2_nodes() argument
96 int xbits = code_length - initial_bits; in cfd_init2_nodes()
105 xrep = np1->code_length - code_length; in cfd_init2_nodes()
110 np2->code_length = xbits; in cfd_init2_nodes()
[all …]
H A Dshcgen.c38 uint code_length; /* length of Huffman code */ member
55 i, nodes[i].freq, nodes[i].value, nodes[i].code_length, in print_nodes_proc()
61 int len = nodes[--j].code_length; in print_nodes_proc()
63 while (j > 0 && nodes[j - 1].code_length == len) in print_nodes_proc()
88 int diff = pn1->code_length - pn2->code_length; in compare_code_lengths()
113 int length = longest[-1].code_length; in hc_limit_code_lengths()
117 while ((next_length = longest[-1].code_length) > max_length) { in hc_limit_code_lengths()
120 (--longest)->code_length = max_length; in hc_limit_code_lengths()
129 while (longest[-1].code_length == max_length) in hc_limit_code_lengths()
148 int M1 = ++(longest[-1].code_length); in hc_limit_code_lengths()
[all …]
H A Dshc.h89 ushort code_length; member
118 #define hc_print_code(rp) hc_print_value((rp)->code, (rp)->code_length)
147 hc_put_value(ss, q, (cp)->code, (cp)->code_length)
174 ushort code_length; member
H A Dsbhc.c124 if (!hce_bits_available(cp->code_length)) in s_BHCE_process()
134 if (!hce_bits_available(cp->code_length)) in s_BHCE_process()
238 if ((clen = cp->code_length) > initial_bits) { in s_BHCD_process()
250 hcd_skip_bits(cp->code_length); in s_BHCD_process()
271 if ((clen = cp->code_length) <= bits_left) in s_BHCD_process()
H A Dscfe.c77 hc_put_value(ss, q, rr.code, rr.code_length);\
96 hc_put_value(ss, q, rr.code, rr.code_length); in cf_put_long_run()
101 hc_put_value(ss, q, rr.code, rr.code_length); in cf_put_long_run()
294 run.code_length += in s_CFE_process()
296 if (run.code_length > 16) /* <= 23 */ in s_CFE_process()
297 bits_left -= run.code_length & 7, in s_CFE_process()
298 run.code_length = 16; in s_CFE_process()
343 hc_bits_size - ss->bits_left + i * rp->code_length; in s_CFE_process()
H A Dscfd.c130 if ((clen = np->code_length) > bits_left) goto outl;\
134 if ((clen = np->code_length) > initial_bits) {\
142 (init_bits << np->code_length) +\
143 peek_var_bits(np->code_length),\
144 initial_bits + np->code_length,\
146 skip_bits(np->code_length);\
789 clen = np->code_length; in cf_decode_uncompressed()
811 skip_bits(np->code_length); in cf_decode_uncompressed()