Lines Matching defs:level
167 unsigned level;
207 return f->level < (info->levels - 1);
210 static int push_frame(struct del_stack *s, dm_block_t b, unsigned level)
242 f->level = level;
311 r = push_frame(s, b, f->level);
318 r = push_frame(s, b, f->level + 1);
380 unsigned level, last_level = info->levels - 1;
387 for (level = 0; level < info->levels; level++) {
391 if (level == last_level) {
400 r = btree_lookup_raw(&spine, root, keys[level],
405 if (rkey != keys[level]) {
476 unsigned level;
482 for (level = 0; level < info->levels - 1u; level++) {
483 r = btree_lookup_raw(&spine, root, keys[level],
489 if (*rkey != keys[level]) {
497 r = dm_btree_lookup_next_single(info, root, keys[level], rkey, value_le);
759 unsigned level, unsigned index)
762 (le64_to_cpu(node->keys[index]) != keys[level]));
771 unsigned level, index = -1, last_level = info->levels - 1;
780 for (level = 0; level < (info->levels - 1); level++) {
781 r = btree_insert_raw(&spine, block, &le64_type, keys[level], &index);
787 if (need_insert(n, keys, level, index)) {
799 keys[level], &new_le);
804 if (level < last_level)
809 keys[level], &index);
815 if (need_insert(n, keys, level, index)) {
820 keys[level], value);
911 int r = 0, count = 0, level;
915 for (level = 0; level < info->levels; level++) {
916 r = find_key(&spine, root, find_highest, result_keys + level,
917 level == info->levels - 1 ? NULL : &root);
950 * space. Also this only works for single level trees.