Lines Matching defs:level
26 * Hash a block, writing the result to the next level's pending block buffer.
114 int level;
134 /* Compute number of levels and the number of blocks in each level. */
144 * in each level. It will be overwritten later.
150 * Compute the starting block of each level, using the convention where
151 * the root level is first, i.e. the convention used by
159 for (level = num_levels - 1; level >= 0; level--) {
160 blocks = level_offset[level];
161 level_offset[level] = offset;
170 * Buffers 0 <= level < num_levels are for the actual tree levels.
173 for (level = -1; level < num_levels; level++) {
174 buffers[level].data = libfsverity_zalloc(block_size);
175 if (!buffers[level].data) {
194 for (level = 0; level < num_levels; level++) {
195 if (!block_is_full(&buffers[level], block_size, hash))
197 hash_one_block(hash, &buffers[level], block_size,
200 &buffers[level],
202 &level_offset[level]);
208 for (level = 0; level < num_levels; level++) {
209 if (buffers[level].filled != 0) {
210 hash_one_block(hash, &buffers[level], block_size,
213 &buffers[level],
215 &level_offset[level]);
228 for (level = -1; level < num_levels; level++)
229 free(buffers[level].data);