Lines Matching refs:level
158 unsigned level; member
198 return f->level < (info->levels - 1); in is_internal_level()
201 static int push_frame(struct del_stack *s, dm_block_t b, unsigned level) in push_frame() argument
233 f->level = level; in push_frame()
287 r = push_frame(s, b, f->level); in dm_btree_del()
294 r = push_frame(s, b, f->level + 1); in dm_btree_del()
351 unsigned level, last_level = info->levels - 1; in dm_btree_lookup() local
358 for (level = 0; level < info->levels; level++) { in dm_btree_lookup()
362 if (level == last_level) { in dm_btree_lookup()
371 r = btree_lookup_raw(&spine, root, keys[level], in dm_btree_lookup()
376 if (rkey != keys[level]) { in dm_btree_lookup()
664 unsigned level, index = -1, last_level = info->levels - 1; in insert() local
673 for (level = 0; level < (info->levels - 1); level++) { in insert()
674 r = btree_insert_raw(&spine, block, &le64_type, keys[level], &index); in insert()
680 (le64_to_cpu(n->keys[index]) != keys[level])); in insert()
694 keys[level], &new_le); in insert()
699 if (level < last_level) in insert()
704 keys[level], &index); in insert()
710 (le64_to_cpu(n->keys[index]) != keys[level])); in insert()
717 keys[level], value); in insert()
804 int r = 0, count = 0, level; in dm_btree_find_key() local
808 for (level = 0; level < info->levels; level++) { in dm_btree_find_key()
809 r = find_key(&spine, root, find_highest, result_keys + level, in dm_btree_find_key()
810 level == info->levels - 1 ? NULL : &root); in dm_btree_find_key()