Lines Matching refs:node
50 struct btrfs_delayed_ref_node *node, u64 parent,
62 struct btrfs_delayed_ref_node *node,
95 * the head node for delayed ref is used to store the sum of all the
97 * node may also store the extent flags to set. This way you can check
1450 * @node: The delayed ref node used to get the bytenr/length for
1480 struct btrfs_delayed_ref_node *node,
1489 u64 bytenr = node->bytenr;
1490 u64 num_bytes = node->num_bytes;
1538 struct btrfs_delayed_ref_node *node,
1549 ins.objectid = node->bytenr;
1550 ins.offset = node->num_bytes;
1553 ref = btrfs_delayed_node_to_data_ref(node);
1554 trace_run_delayed_data_ref(trans->fs_info, node, ref, node->action);
1556 if (node->type == BTRFS_SHARED_DATA_REF_KEY)
1560 if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) {
1566 node->ref_mod);
1567 } else if (node->action == BTRFS_ADD_DELAYED_REF) {
1568 ret = __btrfs_inc_extent_ref(trans, node, parent, ref_root,
1570 node->ref_mod, extent_op);
1571 } else if (node->action == BTRFS_DROP_DELAYED_REF) {
1572 ret = __btrfs_free_extent(trans, node, parent,
1574 ref->offset, node->ref_mod,
1693 struct btrfs_delayed_ref_node *node,
1702 ref = btrfs_delayed_node_to_tree_ref(node);
1703 trace_run_delayed_tree_ref(trans->fs_info, node, ref, node->action);
1705 if (node->type == BTRFS_SHARED_BLOCK_REF_KEY)
1709 if (unlikely(node->ref_mod != 1)) {
1712 node->bytenr, node->ref_mod, node->action, ref_root,
1716 if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) {
1718 ret = alloc_reserved_tree_block(trans, node, extent_op);
1719 } else if (node->action == BTRFS_ADD_DELAYED_REF) {
1720 ret = __btrfs_inc_extent_ref(trans, node, parent, ref_root,
1722 } else if (node->action == BTRFS_DROP_DELAYED_REF) {
1723 ret = __btrfs_free_extent(trans, node, parent, ref_root,
1733 struct btrfs_delayed_ref_node *node,
1741 btrfs_pin_extent(trans, node->bytenr, node->num_bytes, 1);
1745 if (node->type == BTRFS_TREE_BLOCK_REF_KEY ||
1746 node->type == BTRFS_SHARED_BLOCK_REF_KEY)
1747 ret = run_delayed_tree_ref(trans, node, extent_op,
1749 else if (node->type == BTRFS_EXTENT_DATA_REF_KEY ||
1750 node->type == BTRFS_SHARED_DATA_REF_KEY)
1751 ret = run_delayed_data_ref(trans, node, extent_op,
1756 btrfs_pin_extent(trans, node->bytenr, node->num_bytes, 1);
1760 node->bytenr, node->num_bytes, node->type,
1761 node->action, node->ref_mod, ret);
2045 * Or we can get node references of the same type that weren't
2145 struct rb_node *node;
2176 node = rb_first_cached(&delayed_refs->href_root);
2177 if (!node) {
2181 head = rb_entry(node, struct btrfs_delayed_ref_head,
2229 struct rb_node *node;
2278 for (node = rb_first_cached(&head->ref_tree); node;
2279 node = rb_next(node)) {
2280 ref = rb_entry(node, struct btrfs_delayed_ref_node, ref_node);
2889 * Drop one or more refs of @node.
2908 * node->bytenr = 13631488
2909 * node->num_bytes = 1048576
2933 * node->bytenr = 13631488
2934 * node->num_bytes = 1048576
2948 struct btrfs_delayed_ref_node *node, u64 parent,
2967 u64 bytenr = node->bytenr;
2968 u64 num_bytes = node->num_bytes;
2983 node->bytenr, refs_to_drop);
3323 * operations for this node. If we re-allocate this node we
3324 * could replay operations on this node that happened when it
3332 * node or root points to this extent buffer, so if after this
3334 * existing log of operations on this node that we have to
4698 struct btrfs_delayed_ref_node *node,
4715 ref = btrfs_delayed_node_to_tree_ref(node);
4717 extent_key.objectid = node->bytenr;
4722 extent_key.offset = node->num_bytes;
4756 if (node->type == BTRFS_SHARED_BLOCK_REF_KEY) {
4769 return alloc_reserved_extent(trans, node->bytenr, fs_info->nodesize);
5525 if (eb == root->node) {
5683 * dropped as we unlock the root node and parent nodes as we walk down
5692 level = btrfs_header_level(root->node);
5720 level = btrfs_header_level(root->node);
5893 * drop subtree rooted at tree block 'node'.
5895 * NOTE: this function will unlock and release tree block 'node'
5900 struct extent_buffer *node,
5929 btrfs_assert_tree_write_locked(node);
5930 level = btrfs_header_level(node);
5931 path->nodes[level] = node;