Lines Matching refs:mid

788 		int mid;  in generic_bin_search()  local
790 mid = (low + high) / 2; in generic_bin_search()
791 offset = p + mid * item_size; in generic_bin_search()
808 low = mid + 1; in generic_bin_search()
810 high = mid; in generic_bin_search()
812 *slot = mid; in generic_bin_search()
887 struct extent_buffer *mid; in balance_level() local
898 mid = path->nodes[level]; in balance_level()
901 WARN_ON(btrfs_header_generation(mid) != trans->transid); in balance_level()
903 orig_ptr = btrfs_node_blockptr(mid, orig_slot); in balance_level()
917 if (btrfs_header_nritems(mid) != 1) in balance_level()
921 child = btrfs_read_node_slot(mid, 0); in balance_level()
929 ret = btrfs_cow_block(trans, root, child, mid, 0, &child, in balance_level()
946 btrfs_clean_tree_block(mid); in balance_level()
947 btrfs_tree_unlock(mid); in balance_level()
949 free_extent_buffer(mid); in balance_level()
951 root_sub_used(root, mid->len); in balance_level()
952 btrfs_free_tree_block(trans, btrfs_root_id(root), mid, 0, 1); in balance_level()
954 free_extent_buffer_stale(mid); in balance_level()
957 if (btrfs_header_nritems(mid) > in balance_level()
994 wret = push_node_left(trans, left, mid, 1); in balance_level()
1003 wret = push_node_left(trans, mid, right, 1); in balance_level()
1025 if (btrfs_header_nritems(mid) == 1) { in balance_level()
1040 wret = balance_node_right(trans, mid, left); in balance_level()
1046 wret = push_node_left(trans, left, mid, 1); in balance_level()
1052 if (btrfs_header_nritems(mid) == 0) { in balance_level()
1053 btrfs_clean_tree_block(mid); in balance_level()
1054 btrfs_tree_unlock(mid); in balance_level()
1056 root_sub_used(root, mid->len); in balance_level()
1057 btrfs_free_tree_block(trans, btrfs_root_id(root), mid, 0, 1); in balance_level()
1058 free_extent_buffer_stale(mid); in balance_level()
1059 mid = NULL; in balance_level()
1063 btrfs_node_key(mid, &mid_key, 0); in balance_level()
1079 if (mid) { in balance_level()
1080 btrfs_tree_unlock(mid); in balance_level()
1081 free_extent_buffer(mid); in balance_level()
1115 struct extent_buffer *mid; in push_nodes_for_insert() local
1126 mid = path->nodes[level]; in push_nodes_for_insert()
1127 WARN_ON(btrfs_header_generation(mid) != trans->transid); in push_nodes_for_insert()
1157 wret = push_node_left(trans, left, mid, 0); in push_nodes_for_insert()
1165 btrfs_node_key(mid, &disk_key, 0); in push_nodes_for_insert()
1175 btrfs_tree_unlock(mid); in push_nodes_for_insert()
1176 free_extent_buffer(mid); in push_nodes_for_insert()
1211 wret = balance_node_right(trans, right, mid); in push_nodes_for_insert()
1226 if (btrfs_header_nritems(mid) <= orig_slot) { in push_nodes_for_insert()
1230 btrfs_header_nritems(mid); in push_nodes_for_insert()
1231 btrfs_tree_unlock(mid); in push_nodes_for_insert()
1232 free_extent_buffer(mid); in push_nodes_for_insert()
2808 int mid; in split_node() local
2839 mid = (c_nritems + 1) / 2; in split_node()
2840 btrfs_node_key(c, &disk_key, mid); in split_node()
2851 ret = btrfs_tree_mod_log_eb_copy(split, c, 0, mid, c_nritems - mid); in split_node()
2858 btrfs_node_key_ptr_offset(mid), in split_node()
2859 (c_nritems - mid) * sizeof(struct btrfs_key_ptr)); in split_node()
2860 btrfs_set_header_nritems(split, c_nritems - mid); in split_node()
2861 btrfs_set_header_nritems(c, mid); in split_node()
2869 if (path->slots[level] >= mid) { in split_node()
2870 path->slots[level] -= mid; in split_node()
3370 int slot, int mid, int nritems) in copy_for_split() argument
3379 nritems = nritems - mid; in copy_for_split()
3381 data_copy_size = btrfs_item_data_end(l, mid) - leaf_data_end(l); in copy_for_split()
3384 btrfs_item_nr_offset(mid), in copy_for_split()
3392 rt_data_off = BTRFS_LEAF_DATA_SIZE(fs_info) - btrfs_item_data_end(l, mid); in copy_for_split()
3402 btrfs_set_header_nritems(l, mid); in copy_for_split()
3410 if (mid <= slot) { in copy_for_split()
3414 path->slots[0] -= mid; in copy_for_split()
3503 int mid; in split_leaf() local
3556 mid = (nritems + 1) / 2; in split_leaf()
3558 if (mid <= slot) { in split_leaf()
3560 leaf_space_used(l, mid, nritems - mid) + data_size > in split_leaf()
3565 mid = slot; in split_leaf()
3566 if (mid != nritems && in split_leaf()
3567 leaf_space_used(l, mid, nritems - mid) + in split_leaf()
3576 if (leaf_space_used(l, 0, mid) + data_size > in split_leaf()
3581 mid = 1; in split_leaf()
3583 mid = slot; in split_leaf()
3584 if (mid != nritems && in split_leaf()
3585 leaf_space_used(l, mid, nritems - mid) + in split_leaf()
3598 btrfs_item_key(l, &disk_key, mid); in split_leaf()
3618 if (mid <= slot) { in split_leaf()
3646 copy_for_split(trans, path, l, right, slot, mid, nritems); in split_leaf()