| H A D | dm-btree-remove.c | 307  * We dump as many entries from center as possible into left, then the rest313 			      struct btree_node *left, struct btree_node *center, struct btree_node *right,  in delete_center_node()  argument
 324 	node_copy(left, center, -shift);  in delete_center_node()
 336 		node_copy(center, right, shift);  in delete_center_node()
 353 			 struct btree_node *left, struct btree_node *center, struct btree_node *right,  in redistribute3()  argument
 371 			ret = shift(left, center, -nr_center);  in redistribute3()
 382 			ret = shift(left, center, s);  in redistribute3()
 387 		ret = shift(center, right, target_right - nr_right);  in redistribute3()
 394 			ret = shift(center, right, nr_center);  in redistribute3()
 403 			ret = shift(center, right, s);  in redistribute3()
 [all …]
 
 |