170 local int max;          /* maximum allowed bit length for the codes */  variable
179 #define INDEX(i,j,k) (((size_t)((i-1)>>1)*((i-2)>>1)+(j>>1)-1)*(max-1)+k-1)
217     assert(syms > left && left > 0 && len < max);  in count()
234     most = (((code_t)left << (max - len)) - syms) /  in count()
235             (((code_t)1 << (max - len)) - 1);  in count()
345             for (use = root + 1; use <= max; use++)  in examine()
370     most = (((code_t)left << (max - len)) - syms) /  in examine()
371             (((code_t)1 << (max - len)) - 1);  in examine()
410     for (n = 0; n <= max; n++)  in enough()
415     if (root < max)                 /* otherwise, there's only a base table */  in enough()
422                 if (root + 1 < max && num[index])       /* reachable node */  in enough()
474     max = 15;  in main()
480                 max = atoi(argv[3]);  in main()
483     if (argc > 4 || syms < 2 || root < 1 || max < 1) {  in main()
490     if (max > syms - 1)  in main()
491         max = syms - 1;  in main()
498     if (max > n || (code_t)(syms - 2) >= (((code_t)0 - 1) >> (max - 1))) {  in main()
504     if ((code_t)(syms - 1) > ((code_t)1 << max) - 1) {  in main()
506                 syms, max);  in main()
511     code = calloc(max + 1, sizeof(int));  in main()
524                 (size *= n, size > ((size_t)0 - 1) / (n = max - 1)) ||  in main()
546     if (max < syms - 1)  in main()
547         printf(" (%d-bit length limit)\n", max);  in main()
562     if (root > max)                 /* reduce root to max length */  in main()
563         root = max;  in main()