Lines Matching refs:nodes
217 if (!p->nodes[i])
220 btrfs_tree_unlock_rw(p->nodes[i], p->locks[i]);
223 free_extent_buffer(p->nodes[i]);
224 p->nodes[i] = NULL;
911 * leaves and nodes.
1037 * node level balancing, used to make sure nodes are in proper order for
1058 mid = path->nodes[level];
1066 parent = path->nodes[level + 1];
1109 path->nodes[level] = NULL;
1266 path->nodes[level] = left;
1280 btrfs_node_blockptr(path->nodes[level], path->slots[level]))
1288 if (path->nodes[level] != left)
1295 /* Node balancing for insertion. Here we only split or push nodes around
1316 mid = path->nodes[level];
1320 parent = path->nodes[level + 1];
1367 path->nodes[level] = left;
1428 path->nodes[level] = right;
1468 if (!path->nodes[level])
1471 node = path->nodes[level];
1475 * between visiting nodes, limit read ahead of nodes to 1, to avoid too
1539 parent = path->nodes[level + 1];
1575 if (!path->nodes[i])
1589 nritems = btrfs_header_nritems(path->nodes[i]);
1599 btrfs_tree_unlock_rw(path->nodes[i], path->locks[i]);
1645 * on upper level nodes, we unlock all the upper nodes before reading the
1765 b = p->nodes[level];
1780 b = p->nodes[level];
1809 eb = path->nodes[0];
1814 eb = path->nodes[0];
1898 p->nodes[level] = b;
1923 struct extent_buffer *lowest = path->nodes[i];
1938 path->nodes[i] = clone;
1972 struct extent_buffer *leaf = path->nodes[0];
1981 * write lock on the parent, and any other upper nodes, before doing the
1983 * tasks to lock the parent and any other upper nodes.
2014 * nodes and we have to do the binary search.
2018 * nodes with a slot of 0 - we can safely unlock
2031 * We can not unlock upper nodes when the key is
2034 * and possibly of other upper nodes too.
2036 * unlock all the upper nodes, using
2098 * @p: Holds all btree nodes along the search path
2112 * If @ins_len > 0, nodes and leaves will be split as we walk down the tree.
2113 * If @ins_len < 0, nodes will be merged as we walk down the tree (if possible)
2145 WARN_ON(p->nodes[0] != NULL);
2220 p->nodes[level + 1])) {
2232 p->nodes[level + 1],
2241 p->nodes[level] = b;
2258 btrfs_tree_unlock_rw(p->nodes[u], p->locks[u]);
2292 b = p->nodes[level];
2343 p->nodes[level] = b;
2388 WARN_ON(p->nodes[0] != NULL);
2409 p->nodes[level] = b;
2458 p->nodes[level] = b;
2484 btrfs_item_key_to_cpu(path->nodes[0], &key, 0);
2516 if (path->slots[0] < btrfs_header_nritems(path->nodes[0])) {
2517 btrfs_item_key(path->nodes[0], &found_key, path->slots[0]);
2532 btrfs_item_key(path->nodes[0], &found_key, 0);
2580 leaf = p->nodes[0];
2604 leaf = p->nodes[0];
2642 btrfs_item_key_to_cpu(path->nodes[0], key, path->slots[0]);
2661 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
2669 btrfs_item_key_to_cpu(path->nodes[0], key, path->slots[0]);
2692 if (!path->nodes[i])
2694 t = path->nodes[i];
2699 btrfs_mark_buffer_dirty(trans, path->nodes[i]);
2720 eb = path->nodes[0];
2987 BUG_ON(path->nodes[level]);
2988 BUG_ON(path->nodes[level-1] != root->node);
2990 lower = path->nodes[level-1];
3029 path->nodes[level] = c;
3051 BUG_ON(!path->nodes[level]);
3052 btrfs_assert_tree_write_locked(path->nodes[level]);
3053 lower = path->nodes[level];
3110 c = path->nodes[level];
3128 c = path->nodes[level];
3178 path->nodes[level] = split;
3241 struct extent_buffer *left = path->nodes[0];
3242 struct extent_buffer *upper = path->nodes[1];
3343 if (btrfs_header_nritems(path->nodes[0]) == 0)
3344 btrfs_clear_buffer_dirty(trans, path->nodes[0]);
3345 btrfs_tree_unlock(path->nodes[0]);
3346 free_extent_buffer(path->nodes[0]);
3347 path->nodes[0] = right;
3376 struct extent_buffer *left = path->nodes[0];
3384 if (!path->nodes[1])
3388 upper = path->nodes[1];
3392 btrfs_assert_tree_write_locked(path->nodes[1]);
3427 path->nodes[0] = right;
3457 struct extent_buffer *right = path->nodes[0];
3562 btrfs_tree_unlock(path->nodes[0]);
3563 free_extent_buffer(path->nodes[0]);
3564 path->nodes[0] = left;
3591 struct extent_buffer *right = path->nodes[0];
3601 if (!path->nodes[1])
3608 btrfs_assert_tree_write_locked(path->nodes[1]);
3610 left = btrfs_read_node_slot(path->nodes[1], slot - 1);
3623 path->nodes[1], slot - 1, &left,
3693 btrfs_tree_unlock(path->nodes[0]);
3694 free_extent_buffer(path->nodes[0]);
3695 path->nodes[0] = right;
3730 if (slot < btrfs_header_nritems(path->nodes[0]))
3731 space_needed -= btrfs_leaf_free_space(path->nodes[0]);
3744 nritems = btrfs_header_nritems(path->nodes[0]);
3752 if (btrfs_leaf_free_space(path->nodes[0]) >= data_size)
3759 space_needed -= btrfs_leaf_free_space(path->nodes[0]);
3797 l = path->nodes[0];
3804 if (data_size && path->nodes[1]) {
3823 l = path->nodes[0];
3830 if (!path->nodes[1]) {
3837 l = path->nodes[0];
3911 btrfs_tree_unlock(path->nodes[0]);
3912 free_extent_buffer(path->nodes[0]);
3913 path->nodes[0] = right;
3925 btrfs_tree_unlock(path->nodes[0]);
3926 free_extent_buffer(path->nodes[0]);
3927 path->nodes[0] = right;
3958 if (btrfs_leaf_free_space(path->nodes[0]) >= data_size)
3974 leaf = path->nodes[0];
4001 leaf = path->nodes[0];
4007 if (btrfs_leaf_free_space(path->nodes[0]) >= ins_len)
4042 leaf = path->nodes[0];
4146 leaf = path->nodes[0];
4237 leaf = path->nodes[0];
4320 leaf = path->nodes[0];
4453 leaf = path->nodes[0];
4479 leaf = path->nodes[0];
4488 leaf = path->nodes[0];
4507 struct extent_buffer *parent = path->nodes[level];
4553 * path->nodes[1].
4555 * This deletes the pointer in path->nodes[1] and frees the leaf
4559 * all the proper balancing. path->nodes[1] must be locked.
4599 leaf = path->nodes[0];
4675 if (path->nodes[0] == leaf &&
4708 if (path->nodes[0] == leaf)
4721 * for nodes or leaves that are have a minimum transaction id.
4732 * in walking through. Any nodes or leaves older than min_trans are
4756 WARN_ON(path->nodes[level]);
4757 path->nodes[level] = cur;
4830 path->nodes[level - 1] = cur;
4861 if (!path->nodes[level])
4865 c = path->nodes[level];
4872 !path->nodes[level + 1])
4895 c = path->nodes[level];
4939 nritems = btrfs_header_nritems(path->nodes[0]);
4943 btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1);
4973 nritems = btrfs_header_nritems(path->nodes[0]);
5006 if (!path->nodes[level]) {
5012 c = path->nodes[level];
5026 * and nodes from 0 to our current level.
5030 btrfs_tree_read_unlock(path->nodes[i]);
5033 free_extent_buffer(path->nodes[i]);
5034 path->nodes[i] = NULL;
5075 path->nodes[level] = next;
5122 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0]))
5150 leaf = path->nodes[0];
5191 leaf = path->nodes[0];