Lines Matching refs:root
30 requested root table index bits, and on return it is the actual root
45 unsigned root; /* number of index bits for root table */
53 unsigned low; /* low bits for current root entry */
54 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;
130 if (root < min) root = min;
159 root is the number of index bits for the root table. When len exceeds
160 root, sub-tables are created pointed to by the root entry with an index
161 of the low root bits of huff. This is saved in low to check for when a
162 new sub-table should be started. drop is zero when the root table is
163 being filled, and drop is root when sub-tables are being filled.
207 curr = root; /* current table index bits */
209 low = (unsigned)(-1); /* trigger new sub-table when len > root */
210 used = 1U << root; /* use root table entries */
262 if (len > root && (huff & mask) != low) {
265 drop = root;
285 /* point entry in root table to sub-table */
288 (*table)[low].bits = (unsigned char)root;
298 drops back to the root table to fill in any remaining entries there.
304 /* when done with sub-table, drop back to root table */
307 len = root;
329 *bits = root;