Lines Matching full:root

29    requested root table index bits, and on return it is the actual root
44     unsigned root;              /* number of index bits for root table */  local
52     unsigned low;               /* low bits for current root entry */
53     unsigned mask;              /* mask for low root bits */
113     /* bound code lengths, force root to be within code lengths */
114     root = *bits;
117     if (root > max) root = max;
129     if (root < min) root = min;
158        root is the number of index bits for the root table.  When len exceeds
159        root, sub-tables are created pointed to by the root entry with an index
160        of the low root bits of huff.  This is saved in low to check for when a
161        new sub-table should be started.  drop is zero when the root table is
162        being filled, and drop is root when sub-tables are being filled.
172        the initial root table size constants.  See the comments in inftrees.h
203     curr = root;                /* current table index bits */
205     low = (unsigned)(-1);       /* trigger new sub-table when len > root */
206     used = 1U << root;          /* use root table entries */
259         if (len > root && (huff & mask) != low) {
262                 drop = root;
283             /* point entry in root table to sub-table */
286             (*table)[low].bits = (unsigned char)root;
303     *bits = root;