Lines Matching defs:root
19 requested root table index bits, and on return it is the actual root
29 unsigned root; /* number of index bits for root table */
37 unsigned low; /* low bits for current root entry */
38 unsigned mask; /* mask for low root bits */
98 /* bound code lengths, force root to be within code lengths */
99 root = *bits;
102 if (root > max) root = max;
114 if (root < min) root = min;
143 root is the number of index bits for the root table. When len exceeds
144 root, sub-tables are created pointed to by the root entry with an index
145 of the low root bits of huff. This is saved in low to check for when a
146 new sub-table should be started. drop is zero when the root table is
147 being filled, and drop is root when sub-tables are being filled.
191 curr = root; /* current table index bits */
193 low = (unsigned)(-1); /* trigger new sub-table when len > root */
194 used = 1U << root; /* use root table entries */
246 if (len > root && (huff & mask) != low) {
249 drop = root;
269 /* point entry in root table to sub-table */
272 (*table)[low].bits = (unsigned char)root;
282 drops back to the root table to fill in any remaining entries there.
288 /* when done with sub-table, drop back to root table */
291 len = root;
313 *bits = root;