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 */
109 /* bound code lengths, force root to be within code lengths */
110 root = *bits;
113 if (root > max) root = max;
117 if (root < min) root = min;
146 root is the number of index bits for the root table. When len exceeds
147 root, sub-tables are created pointed to by the root entry with an index
148 of the low root bits of huff. This is saved in low to check for when a
149 new sub-table should be started. drop is zero when the root table is
150 being filled, and drop is root when sub-tables are being filled.
160 the initial root table size constants. See the comments in inftree9.h
193 curr = root; /* current table index bits */
195 low = (unsigned)(-1); /* trigger new sub-table when len > root */
196 used = 1U << root; /* use root table entries */
248 if (len > root && (huff & mask) != low) {
251 drop = root;
272 /* point entry in root table to sub-table */
275 (*table)[low].bits = (unsigned char)root;
285 drops back to the root table to fill in any remaining entries there.
291 /* when done with sub-table, drop back to root table */
294 len = root;
296 curr = root;
317 *bits = root;