Lines Matching refs:nodes
102 if (!p->nodes[i])
105 btrfs_tree_unlock_rw(p->nodes[i], p->locks[i]);
108 free_extent_buffer(p->nodes[i]);
109 p->nodes[i] = NULL;
1777 * leaves vs nodes
1840 * node level balancing, used to make sure nodes are in proper order for
1861 mid = path->nodes[level];
1870 parent = path->nodes[level + 1];
1910 path->nodes[level] = NULL;
2042 path->nodes[level] = left;
2056 btrfs_node_blockptr(path->nodes[level], path->slots[level]))
2064 if (path->nodes[level] != left)
2071 /* Node balancing for insertion. Here we only split or push nodes around
2092 mid = path->nodes[level];
2096 parent = path->nodes[level + 1];
2139 path->nodes[level] = left;
2195 path->nodes[level] = right;
2235 if (!path->nodes[level])
2238 node = path->nodes[level];
2291 parent = path->nodes[level + 1];
2350 if (!path->nodes[i])
2360 t = path->nodes[i];
2370 t = path->nodes[i];
2517 b = p->nodes[level];
2536 b = p->nodes[level];
2570 eb = path->nodes[0];
2575 eb = path->nodes[0];
2672 p->nodes[level] = b;
2687 * @p: Holds all btree nodes along the search path
2695 * If @ins_len > 0, nodes and leaves will be split as we walk down the tree.
2696 * If @ins_len < 0, nodes will be merged as we walk down the tree (if possible)
2725 WARN_ON(p->nodes[0] != NULL);
2785 p->nodes[level + 1])) {
2798 p->nodes[level + 1],
2807 p->nodes[level] = b;
2828 btrfs_tree_unlock_rw(p->nodes[u], p->locks[u]);
2889 b = p->nodes[level];
2936 p->nodes[level] = b;
2976 WARN_ON(p->nodes[0] != NULL);
2996 p->nodes[level] = b;
3048 p->nodes[level] = b;
3091 leaf = p->nodes[0];
3115 leaf = p->nodes[0];
3155 if (!path->nodes[i])
3157 t = path->nodes[i];
3162 btrfs_mark_buffer_dirty(path->nodes[i]);
3182 eb = path->nodes[0];
3442 BUG_ON(path->nodes[level]);
3443 BUG_ON(path->nodes[level-1] != root->node);
3445 lower = path->nodes[level-1];
3479 path->nodes[level] = c;
3501 BUG_ON(!path->nodes[level]);
3502 btrfs_assert_tree_locked(path->nodes[level]);
3503 lower = path->nodes[level];
3552 c = path->nodes[level];
3570 c = path->nodes[level];
3615 path->nodes[level] = split;
3682 struct extent_buffer *left = path->nodes[0];
3683 struct extent_buffer *upper = path->nodes[1];
3795 if (btrfs_header_nritems(path->nodes[0]) == 0)
3796 btrfs_clean_tree_block(path->nodes[0]);
3797 btrfs_tree_unlock(path->nodes[0]);
3798 free_extent_buffer(path->nodes[0]);
3799 path->nodes[0] = right;
3828 struct extent_buffer *left = path->nodes[0];
3836 if (!path->nodes[1])
3840 upper = path->nodes[1];
3844 btrfs_assert_tree_locked(path->nodes[1]);
3889 path->nodes[0] = right;
3918 struct extent_buffer *right = path->nodes[0];
4038 btrfs_tree_unlock(path->nodes[0]);
4039 free_extent_buffer(path->nodes[0]);
4040 path->nodes[0] = left;
4067 struct extent_buffer *right = path->nodes[0];
4077 if (!path->nodes[1])
4084 btrfs_assert_tree_locked(path->nodes[1]);
4086 left = btrfs_read_node_slot(path->nodes[1], slot - 1);
4105 path->nodes[1], slot - 1, &left,
4184 btrfs_tree_unlock(path->nodes[0]);
4185 free_extent_buffer(path->nodes[0]);
4186 path->nodes[0] = right;
4219 if (slot < btrfs_header_nritems(path->nodes[0]))
4220 space_needed -= btrfs_leaf_free_space(path->nodes[0]);
4233 nritems = btrfs_header_nritems(path->nodes[0]);
4241 if (btrfs_leaf_free_space(path->nodes[0]) >= data_size)
4248 space_needed -= btrfs_leaf_free_space(path->nodes[0]);
4286 l = path->nodes[0];
4293 if (data_size && path->nodes[1]) {
4312 l = path->nodes[0];
4319 if (!path->nodes[1]) {
4326 l = path->nodes[0];
4395 btrfs_tree_unlock(path->nodes[0]);
4396 free_extent_buffer(path->nodes[0]);
4397 path->nodes[0] = right;
4404 btrfs_tree_unlock(path->nodes[0]);
4405 free_extent_buffer(path->nodes[0]);
4406 path->nodes[0] = right;
4432 if (btrfs_leaf_free_space(path->nodes[0]) >= data_size)
4448 leaf = path->nodes[0];
4475 leaf = path->nodes[0];
4481 if (btrfs_leaf_free_space(path->nodes[0]) >= ins_len)
4518 leaf = path->nodes[0];
4621 leaf = path->nodes[0];
4630 leaf = path->nodes[0];
4657 leaf = path->nodes[0];
4752 leaf = path->nodes[0];
4839 leaf = path->nodes[0];
4957 leaf = path->nodes[0];
4975 struct extent_buffer *parent = path->nodes[level];
5014 * path->nodes[1].
5016 * This deletes the pointer in path->nodes[1] and frees the leaf
5020 * all the proper balancing. path->nodes[1] must be locked.
5059 leaf = path->nodes[0];
5126 if (path->nodes[0] == leaf &&
5145 if (path->nodes[0] == leaf)
5171 btrfs_item_key_to_cpu(path->nodes[0], &key, 0);
5203 if (path->slots[0] < btrfs_header_nritems(path->nodes[0])) {
5204 btrfs_item_key(path->nodes[0], &found_key, path->slots[0]);
5219 btrfs_item_key(path->nodes[0], &found_key, 0);
5238 * for nodes or leaves that are have a minimum transaction id.
5249 * in walking through. Any nodes or leaves older than min_trans are
5272 WARN_ON(path->nodes[level]);
5273 path->nodes[level] = cur;
5348 path->nodes[level - 1] = cur;
5380 if (!path->nodes[level])
5384 c = path->nodes[level];
5391 !path->nodes[level + 1])
5414 c = path->nodes[level];
5460 nritems = btrfs_header_nritems(path->nodes[0]);
5464 btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1);
5483 nritems = btrfs_header_nritems(path->nodes[0]);
5516 if (!path->nodes[level]) {
5522 c = path->nodes[level];
5577 c = path->nodes[level];
5582 path->nodes[level] = next;
5644 leaf = path->nodes[0];
5686 leaf = path->nodes[0];