200 local big_t count(int syms, int len, int left)  in count()  argument
210     if (syms == left)  in count()
214     assert(syms > left && left > 0 && len < max);  in count()
217     index = INDEX(syms, left, len);  in count()
224     least = (left << 1) - syms;  in count()
231     most = (((code_t)left << (max - len)) - syms) /  in count()
237         got = count(syms - use, len + 1, (left - use) << 1);  in count()
255 local int beenhere(int syms, int len, int left, int mem, int rem)  in beenhere()  argument
264     index = INDEX(syms, left, len);  in beenhere()
319 local void examine(int syms, int len, int left, int mem, int rem)  in examine()  argument
326     if (syms == left) {  in examine()
355     if (beenhere(syms, len, left, mem, rem))  in examine()
360     least = (left << 1) - syms;  in examine()
367     most = (((code_t)left << (max - len)) - syms) /  in examine()
382         examine(syms - use, len + 1, (left - use) << 1,  in examine()
400 local void enough(int syms)  in enough()  argument
413         for (n = 3; n <= syms; n++)  in enough()
457     int syms;           /* total number of symbols to code */  in main()  local
468     syms = 286;  in main()
472         syms = atoi(argv[1]);  in main()
479     if (argc > 4 || syms < 2 || root < 1 || max < 1) {  in main()
486     if (max > syms - 1)  in main()
487         max = syms - 1;  in main()
495     if (max > n || syms - 2 >= (((code_t)0 - 1) >> (max - 1))) {  in main()
501     if (syms - 1 > ((code_t)1 << max) - 1) {  in main()
503                 syms, max);  in main()
516     if (syms == 2)              /* iff max == 1 */  in main()
519         size = syms >> 1;  in main()
520         if (size > ((size_t)0 - 1) / (n = (syms - 1) >> 1) ||  in main()
532     for (n = 2; n <= syms; n++) {  in main()
542     printf("%llu total codes for 2 to %d symbols", sum, syms);  in main()
543     if (max < syms - 1)  in main()
549     if (syms == 2)  in main()
561     if (syms < ((code_t)1 << (root + 1)))  in main()
562         enough(syms);  in main()