111 static void delete_at(struct btree_node *n, unsigned index)  in delete_at()  argument
114 	unsigned nr_to_copy = nr_entries - (index + 1);  in delete_at()
116 	BUG_ON(index >= nr_entries);  in delete_at()
119 		memmove(key_ptr(n, index),  in delete_at()
120 			key_ptr(n, index + 1),  in delete_at()
123 		memmove(value_ptr(n, index),  in delete_at()
124 			value_ptr(n, index + 1),  in delete_at()
137 	unsigned index;  member
144 		      unsigned index, struct child *result)  in init_child()  argument
149 	result->index = index;  in init_child()
150 	root = value64(parent, index);  in init_child()
162 	*((__le64 *) value_ptr(parent, index)) =  in init_child()
214 		delete_at(parent, r->index);  in __rebalance2()
227 		*key_ptr(parent, r->index) = right->keys[0];  in __rebalance2()
285 	*key_ptr(parent, r->index) = right->keys[0];  in delete_center_node()
287 	delete_at(parent, c->index);  in delete_center_node()
288 	r->index--;  in delete_center_node()
340 	*key_ptr(parent, c->index) = center->keys[0];  in redistribute3()
341 	*key_ptr(parent, r->index) = right->keys[0];  in redistribute3()
485 static int do_leaf(struct btree_node *n, uint64_t key, unsigned *index)  in do_leaf()  argument
494 	*index = i;  in do_leaf()
505 		      uint64_t key, unsigned *index)  in remove_raw()  argument
507 	int i = *index, r;  in remove_raw()
529 			return do_leaf(n, key, index);  in remove_raw()
537 			return do_leaf(n, key, index);  in remove_raw()
556 	int index = 0, r = 0;  in dm_btree_remove()  local
567 			       root, keys[level], (unsigned *)&index);  in dm_btree_remove()
573 			root = value64(n, index);  in dm_btree_remove()
577 		BUG_ON(index < 0 || index >= le32_to_cpu(n->header.nr_entries));  in dm_btree_remove()
581 					     value_ptr(n, index));  in dm_btree_remove()
583 		delete_at(n, index);  in dm_btree_remove()