Lines Matching refs:mid
761 int mid; in generic_bin_search() local
763 mid = (low + high) / 2; in generic_bin_search()
764 offset = p + mid * item_size; in generic_bin_search()
781 low = mid + 1; in generic_bin_search()
783 high = mid; in generic_bin_search()
785 *slot = mid; in generic_bin_search()
865 struct extent_buffer *mid; in balance_level() local
876 mid = path->nodes[level]; in balance_level()
879 WARN_ON(btrfs_header_generation(mid) != trans->transid); in balance_level()
881 orig_ptr = btrfs_node_blockptr(mid, orig_slot); in balance_level()
895 if (btrfs_header_nritems(mid) != 1) in balance_level()
899 child = btrfs_read_node_slot(mid, 0); in balance_level()
907 ret = btrfs_cow_block(trans, root, child, mid, 0, &child, in balance_level()
924 btrfs_clean_tree_block(mid); in balance_level()
925 btrfs_tree_unlock(mid); in balance_level()
927 free_extent_buffer(mid); in balance_level()
929 root_sub_used(root, mid->len); in balance_level()
930 btrfs_free_tree_block(trans, btrfs_root_id(root), mid, 0, 1); in balance_level()
932 free_extent_buffer_stale(mid); in balance_level()
935 if (btrfs_header_nritems(mid) > in balance_level()
972 wret = push_node_left(trans, left, mid, 1); in balance_level()
981 wret = push_node_left(trans, mid, right, 1); in balance_level()
1003 if (btrfs_header_nritems(mid) == 1) { in balance_level()
1018 wret = balance_node_right(trans, mid, left); in balance_level()
1024 wret = push_node_left(trans, left, mid, 1); in balance_level()
1030 if (btrfs_header_nritems(mid) == 0) { in balance_level()
1031 btrfs_clean_tree_block(mid); in balance_level()
1032 btrfs_tree_unlock(mid); in balance_level()
1034 root_sub_used(root, mid->len); in balance_level()
1035 btrfs_free_tree_block(trans, btrfs_root_id(root), mid, 0, 1); in balance_level()
1036 free_extent_buffer_stale(mid); in balance_level()
1037 mid = NULL; in balance_level()
1041 btrfs_node_key(mid, &mid_key, 0); in balance_level()
1057 if (mid) { in balance_level()
1058 btrfs_tree_unlock(mid); in balance_level()
1059 free_extent_buffer(mid); in balance_level()
1093 struct extent_buffer *mid; in push_nodes_for_insert() local
1104 mid = path->nodes[level]; in push_nodes_for_insert()
1105 WARN_ON(btrfs_header_generation(mid) != trans->transid); in push_nodes_for_insert()
1135 wret = push_node_left(trans, left, mid, 0); in push_nodes_for_insert()
1143 btrfs_node_key(mid, &disk_key, 0); in push_nodes_for_insert()
1153 btrfs_tree_unlock(mid); in push_nodes_for_insert()
1154 free_extent_buffer(mid); in push_nodes_for_insert()
1189 wret = balance_node_right(trans, right, mid); in push_nodes_for_insert()
1204 if (btrfs_header_nritems(mid) <= orig_slot) { in push_nodes_for_insert()
1208 btrfs_header_nritems(mid); in push_nodes_for_insert()
1209 btrfs_tree_unlock(mid); in push_nodes_for_insert()
1210 free_extent_buffer(mid); in push_nodes_for_insert()
2538 int mid; in split_node() local
2569 mid = (c_nritems + 1) / 2; in split_node()
2570 btrfs_node_key(c, &disk_key, mid); in split_node()
2581 ret = btrfs_tree_mod_log_eb_copy(split, c, 0, mid, c_nritems - mid); in split_node()
2588 btrfs_node_key_ptr_offset(mid), in split_node()
2589 (c_nritems - mid) * sizeof(struct btrfs_key_ptr)); in split_node()
2590 btrfs_set_header_nritems(split, c_nritems - mid); in split_node()
2591 btrfs_set_header_nritems(c, mid); in split_node()
2599 if (path->slots[level] >= mid) { in split_node()
2600 path->slots[level] -= mid; in split_node()
3126 int slot, int mid, int nritems) in copy_for_split() argument
3135 nritems = nritems - mid; in copy_for_split()
3137 data_copy_size = btrfs_item_end_nr(l, mid) - leaf_data_end(l); in copy_for_split()
3140 btrfs_item_nr_offset(mid), in copy_for_split()
3148 rt_data_off = BTRFS_LEAF_DATA_SIZE(fs_info) - btrfs_item_end_nr(l, mid); in copy_for_split()
3159 btrfs_set_header_nritems(l, mid); in copy_for_split()
3167 if (mid <= slot) { in copy_for_split()
3171 path->slots[0] -= mid; in copy_for_split()
3260 int mid; in split_leaf() local
3313 mid = (nritems + 1) / 2; in split_leaf()
3315 if (mid <= slot) { in split_leaf()
3317 leaf_space_used(l, mid, nritems - mid) + data_size > in split_leaf()
3322 mid = slot; in split_leaf()
3323 if (mid != nritems && in split_leaf()
3324 leaf_space_used(l, mid, nritems - mid) + in split_leaf()
3333 if (leaf_space_used(l, 0, mid) + data_size > in split_leaf()
3338 mid = 1; in split_leaf()
3340 mid = slot; in split_leaf()
3341 if (mid != nritems && in split_leaf()
3342 leaf_space_used(l, mid, nritems - mid) + in split_leaf()
3355 btrfs_item_key(l, &disk_key, mid); in split_leaf()
3375 if (mid <= slot) { in split_leaf()
3403 copy_for_split(trans, path, l, right, slot, mid, nritems); in split_leaf()