Lines Matching refs:level
44 * tree levels, each level would consume 1 byte (See [1]).
58 * last level symbol count by 2 which makes it a number in
70 * and store pointers to each level's first symbol. In addition to
71 * that, maintain two counts for each level: inner nodes count and
79 * level */
81 * each level */
86 * first symbol of each tree level */
118 unpackd_fill_inodesin(const unpack_descriptor_t *unpackd, int level)
123 * leaf nodes in the next level. For the last level there
126 if (level < unpackd->treelevels) {
127 unpackd_fill_inodesin(unpackd, level + 1);
128 unpackd->inodesin[level] = (unpackd->inodesin[level + 1] +
129 unpackd->symbolsin[level + 1]) / 2;
131 unpackd->inodesin[level] = 0;
224 * it by reducing 2 from the actual number from the last level.
226 * We adjust the last level's symbol count by 1 here, because