Searched refs:curr (Results 1 - 4 of 4) sorted by relevance
| /ast/src/lib/libz/ |
| H A D | inftrees.c | 50 unsigned curr; /* number of index bits for current table */ local
157 filled is at next and has curr index bits. The code being used is huff
159 bits off of the bottom. For codes where len is less than drop + curr,
160 those top drop + curr - len bits are incremented through all values to
211 curr = root; /* current table index bits */
240 fill = 1U << curr;
272 next += min; /* here min is 1 << curr */
275 curr = len - drop;
276 left = (int)(1 << curr);
277 while (curr
[all...] |
| /ast/src/lib/libbz/ |
| H A D | decompress.c | 159 Int32 curr; local
213 curr = s->save_curr;
341 GET_BITS(BZ_X_CODING_1, curr, 5);
344 if (curr < 1 || curr > 20) RETURN(BZ_DATA_ERROR);
348 if (uc == 0) curr++; else curr--;
350 s->len[t][i] = curr;
620 s->save_curr = curr;
|
| H A D | compress.c | 483 Int32 curr = s->len[t][0]; local
484 bsW ( s, 5, curr );
486 while (curr < s->len[t][i]) { bsW(s,2,2); curr++; /* 10 */ };
487 while (curr > s->len[t][i]) { bsW(s,2,3); curr--; /* 11 */ };
|
| /ast/src/cmd/INIT/ |
| H A D | ratz.c | 1717 unsigned curr; /* number of index bits for current table */ local
1824 filled is at next and has curr index bits. The code being used is huff
1826 bits off of the bottom. For codes where len is less than drop + curr,
1827 those top drop + curr - len bits are incremented through all values to
1878 curr = root; /* current table index bits */
1907 fill = ((unsigned int)1) << curr;
1939 next += min; /* here min is 1 << curr */
1942 curr = len - drop;
1943 left = (int)(1 << curr);
1944 while (curr
[all...] |
Completed in 40 milliseconds