Lines Matching refs:left
117 left: number of available bit patterns at length len
123 left: 2..syms - 1, but only the evens (so syms == 8 -> 2, 4, 6)
126 syms == 2 is not saved since that immediately leads to a single code. left
129 left ends at syms-1 since left == syms immediately results in a single code.
130 (left > sym is not allowed since that would result in an incomplete code.)
148 to the num[] array as described above for the (syms, left, len) triplet.
196 len through max inclusive, coding syms symbols, with left bit patterns of
200 local big_t count(int syms, int len, int left)
210 if (syms == left)
214 assert(syms > left && left > 0 && len < max);
217 index = INDEX(syms, left, len);
224 least = (left << 1) - syms;
230 no limit to the code length, this would become: most = left - 1) */
231 most = (((code_t)left << (max - len)) - syms) /
237 got = count(syms - use, len + 1, (left - use) << 1);
252 bit vector to indicate visiting this state. Each (syms,len,left) state
255 local int beenhere(int syms, int len, int left, int mem, int rem)
263 /* point to vector for (syms,left,len), bit in vector for (mem,rem) */
264 index = INDEX(syms, left, len);
314 /* Examine all possible codes from the given node (syms, len, left). Compute
319 local void examine(int syms, int len, int left, int mem, int rem)
326 if (syms == left) {
328 code[len] = left;
331 while (rem < left) {
332 left -= rem;
336 assert(rem == left);
355 if (beenhere(syms, len, left, mem, rem))
360 least = (left << 1) - syms;
366 no limit to the code length, this would become: most = left - 1) */
367 most = (((code_t)left << (max - len)) - syms) /
382 examine(syms - use, len + 1, (left - use) << 1,
396 intermediate code states (syms, left, len). For each completed code,
403 int left; /* number of unused bit patterns at this length */
414 for (left = 2; left < n; left += 2)
418 index = INDEX(n, left, root + 1);
420 examine(n, root + 1, left, 1 << root, 0);
424 if (num[index - 1] && n <= left << 1)
425 examine((n - left) << 1, root + 1, (n - left) << 1,