Lines Matching defs:root
28 requested root table index bits, and on return it is the actual root
43 unsigned root; /* number of index bits for root table */
51 unsigned low; /* low bits for current root entry */
52 unsigned mask; /* mask for low root bits */
114 /* bound code lengths, force root to be within code lengths */
115 root = *bits;
118 if (root > max) root = max;
122 if (root < min) root = min;
151 root is the number of index bits for the root table. When len exceeds
152 root, sub-tables are created pointed to by the root entry with an index
153 of the low root bits of huff. This is saved in low to check for when a
154 new sub-table should be started. drop is zero when the root table is
155 being filled, and drop is root when sub-tables are being filled.
165 the initial root table size constants. See the comments in inftree9.h
198 curr = root; /* current table index bits */
200 low = (unsigned)(-1); /* trigger new sub-table when len > root */
201 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;
290 drops back to the root table to fill in any remaining entries there.
296 /* when done with sub-table, drop back to root table */
299 len = root;
301 curr = root;
322 *bits = root;