203 local big_t count(int syms, int len, int left)  in count()  argument
213     if (syms == left)  in count()
217     assert(syms > left && left > 0 && len < max);  in count()
220     index = INDEX(syms, left, len);  in count()
227     least = (left << 1) - syms;  in count()
234     most = (((code_t)left << (max - len)) - syms) /  in count()
240         got = count(syms - use, len + 1, (left - use) << 1);  in count()
258 local int beenhere(int syms, int len, int left, int mem, int rem)  in beenhere()  argument
267     index = INDEX(syms, left, len);  in beenhere()
322 local void examine(int syms, int len, int left, int mem, int rem)  in examine()  argument
329     if (syms == left) {  in examine()
331         code[len] = left;  in examine()
334         while (rem < left) {  in examine()
335             left -= rem;  in examine()
339         assert(rem == left);  in examine()
358     if (beenhere(syms, len, left, mem, rem))  in examine()
363     least = (left << 1) - syms;  in examine()
370     most = (((code_t)left << (max - len)) - syms) /  in examine()
385         examine(syms - use, len + 1, (left - use) << 1,  in examine()
406     int left;           /* number of unused bit patterns at this length */  in enough()  local
417             for (left = 2; left < n; left += 2)  in enough()
421                 index = INDEX(n, left, root + 1);  in enough()
423                     examine(n, root + 1, left, 1 << root, 0);  in enough()
427                 if (num[index - 1] && n <= left << 1)  in enough()
428                     examine((n - left) << 1, root + 1, (n - left) << 1,  in enough()