123 	int r;  in dm_btree_empty()  local
129 	r = new_block(info, &b);  in dm_btree_empty()
130 	if (r < 0)  in dm_btree_empty()
131 		return r;  in dm_btree_empty()
203 	int r;  in push_frame()  local
211 	r = dm_tm_ref(s->tm, b, &ref_count);  in push_frame()
212 	if (r)  in push_frame()
213 		return r;  in push_frame()
226 		r = dm_tm_read_lock(s->tm, b, &btree_node_validator, &f->b);  in push_frame()
227 		if (r) {  in push_frame()
229 			return r;  in push_frame()
255 	int r;  in dm_btree_del()  local
265 	r = push_frame(s, root, 0);  in dm_btree_del()
266 	if (r)  in dm_btree_del()
274 		r = top_frame(s, &f);  in dm_btree_del()
275 		if (r)  in dm_btree_del()
287 			r = push_frame(s, b, f->level);  in dm_btree_del()
288 			if (r)  in dm_btree_del()
294 			r = push_frame(s, b, f->level + 1);  in dm_btree_del()
295 			if (r)  in dm_btree_del()
312 	return r;  in dm_btree_del()
322 	int i, r;  in btree_lookup_raw()  local
326 		r = ro_step(s, block);  in btree_lookup_raw()
327 		if (r < 0)  in btree_lookup_raw()
328 			return r;  in btree_lookup_raw()
352 	int r = -ENODATA;  in dm_btree_lookup()  local
371 		r = btree_lookup_raw(&spine, root, keys[level],  in dm_btree_lookup()
375 		if (!r) {  in dm_btree_lookup()
382 			return r;  in dm_btree_lookup()
389 	return r;  in dm_btree_lookup()
426 	int r;  in btree_split_sibling()  local
435 	r = new_block(s->info, &right);  in btree_split_sibling()
436 	if (r < 0)  in btree_split_sibling()
437 		return r;  in btree_split_sibling()
472 	r = insert_at(sizeof(__le64), pn, parent_index + 1,  in btree_split_sibling()
474 	if (r)  in btree_split_sibling()
475 		return r;  in btree_split_sibling()
511 	int r;  in btree_split_beneath()  local
520 	r = new_block(s->info, &left);  in btree_split_beneath()
521 	if (r < 0)  in btree_split_beneath()
522 		return r;  in btree_split_beneath()
524 	r = new_block(s->info, &right);  in btree_split_beneath()
525 	if (r < 0) {  in btree_split_beneath()
527 		return r;  in btree_split_beneath()
599 	int r, i = *index, top = 1;  in btree_insert_raw()  local
603 		r = shadow_step(s, root, vt);  in btree_insert_raw()
604 		if (r < 0)  in btree_insert_raw()
605 			return r;  in btree_insert_raw()
626 				r = btree_split_beneath(s, key);  in btree_insert_raw()
628 				r = btree_split_sibling(s, root, i, key);  in btree_insert_raw()
630 			if (r < 0)  in btree_insert_raw()
631 				return r;  in btree_insert_raw()
663 	int r, need_insert;  in insert()  local
674 		r = btree_insert_raw(&spine, block, &le64_type, keys[level], &index);  in insert()
675 		if (r < 0)  in insert()
686 			r = dm_btree_empty(info, &new_tree);  in insert()
687 			if (r < 0)  in insert()
693 			r = insert_at(sizeof(uint64_t), n, index,  in insert()
695 			if (r)  in insert()
703 	r = btree_insert_raw(&spine, block, &info->value_type,  in insert()
705 	if (r < 0)  in insert()
716 		r = insert_at(info->value_type.size, n, index,  in insert()
718 		if (r)  in insert()
746 	return r;  in insert()
771 	int i, r;  in find_key()  local
775 		r = ro_step(s, block);  in find_key()
776 		if (r < 0)  in find_key()
777 			return r;  in find_key()
804 	int r = 0, count = 0, level;  in dm_btree_find_key()  local
809 		r = find_key(&spine, root, find_highest, result_keys + level,  in dm_btree_find_key()
811 		if (r == -ENODATA) {  in dm_btree_find_key()
812 			r = 0;  in dm_btree_find_key()
815 		} else if (r)  in dm_btree_find_key()
822 	return r ? r : count;  in dm_btree_find_key()
849 	int r;  in walk_node()  local
855 	r = bn_read_lock(info, block, &node);  in walk_node()
856 	if (r)  in walk_node()
857 		return r;  in walk_node()
864 			r = walk_node(info, value64(n, i), fn, context);  in walk_node()
865 			if (r)  in walk_node()
869 			r = fn(context, &keys, value_ptr(n, i));  in walk_node()
870 			if (r)  in walk_node()
877 	return r;  in walk_node()