165 	unsigned level;  member
205 	return f->level < (info->levels - 1);  in is_internal_level()
208 static int push_frame(struct del_stack *s, dm_block_t b, unsigned level)  in push_frame()  argument
240 		f->level = level;  in push_frame()
304 			r = push_frame(s, b, f->level);  in dm_btree_del()
311 			r = push_frame(s, b, f->level + 1);  in dm_btree_del()
372 	unsigned level, last_level = info->levels - 1;  in dm_btree_lookup()  local
379 	for (level = 0; level < info->levels; level++) {  in dm_btree_lookup()
383 		if (level == last_level) {  in dm_btree_lookup()
392 		r = btree_lookup_raw(&spine, root, keys[level],  in dm_btree_lookup()
397 			if (rkey != keys[level]) {  in dm_btree_lookup()
461 	unsigned level;  in dm_btree_lookup_next()  local
467 	for (level = 0; level < info->levels - 1u; level++) {  in dm_btree_lookup_next()
468 		r = btree_lookup_raw(&spine, root, keys[level],  in dm_btree_lookup_next()
474 		if (*rkey != keys[level]) {  in dm_btree_lookup_next()
482 	r = dm_btree_lookup_next_single(info, root, keys[level], rkey, value_le);  in dm_btree_lookup_next()
763 	unsigned level, index = -1, last_level = info->levels - 1;  in insert()  local
772 	for (level = 0; level < (info->levels - 1); level++) {  in insert()
773 		r = btree_insert_raw(&spine, block, &le64_type, keys[level], &index);  in insert()
779 			       (le64_to_cpu(n->keys[index]) != keys[level]));  in insert()
793 				      keys[level], &new_le);  in insert()
798 		if (level < last_level)  in insert()
803 			     keys[level], &index);  in insert()
809 		       (le64_to_cpu(n->keys[index]) != keys[level]));  in insert()
816 			      keys[level], value);  in insert()
903 	int r = 0, count = 0, level;  in dm_btree_find_key()  local
907 	for (level = 0; level < info->levels; level++) {  in dm_btree_find_key()
908 		r = find_key(&spine, root, find_highest, result_keys + level,  in dm_btree_find_key()
909 			     level == info->levels - 1 ? NULL : &root);  in dm_btree_find_key()