760 		int mid;  in generic_bin_search()  local
762 		mid = (low + high) / 2;  in generic_bin_search()
763 		offset = p + mid * item_size;  in generic_bin_search()
780 			low = mid + 1;  in generic_bin_search()
782 			high = mid;  in generic_bin_search()
784 			*slot = mid;  in generic_bin_search()
864 	struct extent_buffer *mid;  in balance_level()  local
875 	mid = path->nodes[level];  in balance_level()
878 	WARN_ON(btrfs_header_generation(mid) != trans->transid);  in balance_level()
880 	orig_ptr = btrfs_node_blockptr(mid, orig_slot);  in balance_level()
894 		if (btrfs_header_nritems(mid) != 1)  in balance_level()
898 		child = btrfs_read_node_slot(mid, 0);  in balance_level()
906 		ret = btrfs_cow_block(trans, root, child, mid, 0, &child,  in balance_level()
923 		btrfs_clean_tree_block(mid);  in balance_level()
924 		btrfs_tree_unlock(mid);  in balance_level()
926 		free_extent_buffer(mid);  in balance_level()
928 		root_sub_used(root, mid->len);  in balance_level()
929 		btrfs_free_tree_block(trans, root, mid, 0, 1);  in balance_level()
931 		free_extent_buffer_stale(mid);  in balance_level()
934 	if (btrfs_header_nritems(mid) >  in balance_level()
971 		wret = push_node_left(trans, left, mid, 1);  in balance_level()
980 		wret = push_node_left(trans, mid, right, 1);  in balance_level()
1001 	if (btrfs_header_nritems(mid) == 1) {  in balance_level()
1016 		wret = balance_node_right(trans, mid, left);  in balance_level()
1022 			wret = push_node_left(trans, left, mid, 1);  in balance_level()
1028 	if (btrfs_header_nritems(mid) == 0) {  in balance_level()
1029 		btrfs_clean_tree_block(mid);  in balance_level()
1030 		btrfs_tree_unlock(mid);  in balance_level()
1032 		root_sub_used(root, mid->len);  in balance_level()
1033 		btrfs_free_tree_block(trans, root, mid, 0, 1);  in balance_level()
1034 		free_extent_buffer_stale(mid);  in balance_level()
1035 		mid = NULL;  in balance_level()
1039 		btrfs_node_key(mid, &mid_key, 0);  in balance_level()
1055 			if (mid) {  in balance_level()
1056 				btrfs_tree_unlock(mid);  in balance_level()
1057 				free_extent_buffer(mid);  in balance_level()
1091 	struct extent_buffer *mid;  in push_nodes_for_insert()  local
1102 	mid = path->nodes[level];  in push_nodes_for_insert()
1103 	WARN_ON(btrfs_header_generation(mid) != trans->transid);  in push_nodes_for_insert()
1133 				wret = push_node_left(trans, left, mid, 0);  in push_nodes_for_insert()
1141 			btrfs_node_key(mid, &disk_key, 0);  in push_nodes_for_insert()
1151 				btrfs_tree_unlock(mid);  in push_nodes_for_insert()
1152 				free_extent_buffer(mid);  in push_nodes_for_insert()
1187 				wret = balance_node_right(trans, right, mid);  in push_nodes_for_insert()
1202 			if (btrfs_header_nritems(mid) <= orig_slot) {  in push_nodes_for_insert()
1206 					btrfs_header_nritems(mid);  in push_nodes_for_insert()
1207 				btrfs_tree_unlock(mid);  in push_nodes_for_insert()
1208 				free_extent_buffer(mid);  in push_nodes_for_insert()
2536 	int mid;  in split_node()  local
2567 	mid = (c_nritems + 1) / 2;  in split_node()
2568 	btrfs_node_key(c, &disk_key, mid);  in split_node()
2579 	ret = btrfs_tree_mod_log_eb_copy(split, c, 0, mid, c_nritems - mid);  in split_node()
2586 			   btrfs_node_key_ptr_offset(mid),  in split_node()
2587 			   (c_nritems - mid) * sizeof(struct btrfs_key_ptr));  in split_node()
2588 	btrfs_set_header_nritems(split, c_nritems - mid);  in split_node()
2589 	btrfs_set_header_nritems(c, mid);  in split_node()
2597 	if (path->slots[level] >= mid) {  in split_node()
2598 		path->slots[level] -= mid;  in split_node()
3124 				    int slot, int mid, int nritems)  in copy_for_split()  argument
3133 	nritems = nritems - mid;  in copy_for_split()
3135 	data_copy_size = btrfs_item_end_nr(l, mid) - leaf_data_end(l);  in copy_for_split()
3138 			   btrfs_item_nr_offset(mid),  in copy_for_split()
3146 	rt_data_off = BTRFS_LEAF_DATA_SIZE(fs_info) - btrfs_item_end_nr(l, mid);  in copy_for_split()
3157 	btrfs_set_header_nritems(l, mid);  in copy_for_split()
3165 	if (mid <= slot) {  in copy_for_split()
3169 		path->slots[0] -= mid;  in copy_for_split()
3258 	int mid;  in split_leaf()  local
3311 	mid = (nritems + 1) / 2;  in split_leaf()
3313 	if (mid <= slot) {  in split_leaf()
3315 		    leaf_space_used(l, mid, nritems - mid) + data_size >  in split_leaf()
3320 				mid = slot;  in split_leaf()
3321 				if (mid != nritems &&  in split_leaf()
3322 				    leaf_space_used(l, mid, nritems - mid) +  in split_leaf()
3331 		if (leaf_space_used(l, 0, mid) + data_size >  in split_leaf()
3336 				mid = 1;  in split_leaf()
3338 				mid = slot;  in split_leaf()
3339 				if (mid != nritems &&  in split_leaf()
3340 				    leaf_space_used(l, mid, nritems - mid) +  in split_leaf()
3353 		btrfs_item_key(l, &disk_key, mid);  in split_leaf()
3373 		if (mid <= slot) {  in split_leaf()
3401 	copy_for_split(trans, path, l, right, slot, mid, nritems);  in split_leaf()