Lines Matching defs:root
28 requested root table index bits, and on return it is the actual root
38 unsigned root; /* number of index bits for root table */
46 unsigned low; /* low bits for current root entry */
47 unsigned mask; /* mask for low root bits */
107 /* bound code lengths, force root to be within code lengths */
108 root = *bits;
111 if (root > max) root = max;
123 if (root < min) root = min;
152 root is the number of index bits for the root table. When len exceeds
153 root, sub-tables are created pointed to by the root entry with an index
154 of the low root bits of huff. This is saved in low to check for when a
155 new sub-table should be started. drop is zero when the root table is
156 being filled, and drop is root when sub-tables are being filled.
166 the initial root table size constants. See the comments in inftrees.h
197 curr = root; /* current table index bits */
199 low = (unsigned)(-1); /* trigger new sub-table when len > root */
200 used = 1U << root; /* use root table entries */
253 if (len > root && (huff & mask) != low) {
256 drop = root;
277 /* point entry in root table to sub-table */
280 (*table)[low].bits = (unsigned char)root;
297 *bits = root;