Lines Matching refs:level
40 * tree levels, each level would consume 1 byte (See [1]).
54 * last level symbol count by 2 which makes it a number in
66 * and store pointers to each level's first symbol. In addition to
67 * that, maintain two counts for each level: inner nodes count and
75 each level */
77 each level */
82 first symbol of each tree level */
114 unpackd_fill_inodesin(const unpack_descriptor_t *unpackd, int level)
119 * leaf nodes in the next level. For the last level there
122 if (level < unpackd->treelevels) {
123 unpackd_fill_inodesin(unpackd, level + 1);
124 unpackd->inodesin[level] = (unpackd->inodesin[level + 1] +
125 unpackd->symbolsin[level + 1]) / 2;
127 unpackd->inodesin[level] = 0;
218 * it by reducing 2 from the actual number from the last level.
220 * We adjust the last level's symbol count by 1 here, because