Home
last modified time | relevance | path

Searched refs:next_code (Results 1 – 4 of 4) sorted by relevance

/plan9/sys/src/cmd/gs/src/
H A Dslzwd.c62 ss->next_code = code_0; in s_LZWD_reset()
114 int next_code = ss->next_code; in s_LZWD_process() local
116 lzw_decode *dc_next = table + next_code; /* invariant */ in s_LZWD_process()
127 code_size, next_code); in s_LZWD_process()
244 if (code >= next_code) { in s_LZWD_process()
245 if (code > next_code) { in s_LZWD_process()
248 code, next_code); in s_LZWD_process()
261 next_code, prev_code, dc_next->datum); in s_LZWD_process()
271 next_code); in s_LZWD_process()
272 next_code = code_0; in s_LZWD_process()
[all …]
H A Dslzwe.c84 ss->next_code = code_0; in lzw_reset_encode()
161 if ( ss->next_code == limit_code ) in s_LZWE_process()
164 if ( ss->next_code == encode_max ) in s_LZWE_process()
174 ss->next_code, code, c); in s_LZWE_process()
175 *tp = ss->next_code++; in s_LZWE_process()
H A Dslzwx.h48 uint next_code; /* next code to be assigned */ member
/plan9/sys/src/cmd/gs/zlib/
H A Dtrees.c582 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
591 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
604 tree[n].Code = bi_reverse(next_code[len]++, len);
607 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));