Lines Matching refs:node
42 struct btrfs_delayed_ref_node *node, u64 parent,
54 struct btrfs_delayed_ref_node *node,
107 * the head node for delayed ref is used to store the sum of all the
109 * node may also store the extent flags to set. This way you can check
1389 * @node: The delayed ref node used to get the bytenr/length for
1419 struct btrfs_delayed_ref_node *node,
1428 u64 bytenr = node->bytenr;
1429 u64 num_bytes = node->num_bytes;
1480 struct btrfs_delayed_ref_node *node,
1491 ins.objectid = node->bytenr;
1492 ins.offset = node->num_bytes;
1495 ref = btrfs_delayed_node_to_data_ref(node);
1496 trace_run_delayed_data_ref(trans->fs_info, node, ref, node->action);
1498 if (node->type == BTRFS_SHARED_DATA_REF_KEY)
1502 if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) {
1508 node->ref_mod);
1509 } else if (node->action == BTRFS_ADD_DELAYED_REF) {
1510 ret = __btrfs_inc_extent_ref(trans, node, parent, ref_root,
1512 node->ref_mod, extent_op);
1513 } else if (node->action == BTRFS_DROP_DELAYED_REF) {
1514 ret = __btrfs_free_extent(trans, node, parent,
1516 ref->offset, node->ref_mod,
1629 struct btrfs_delayed_ref_node *node,
1638 ref = btrfs_delayed_node_to_tree_ref(node);
1639 trace_run_delayed_tree_ref(trans->fs_info, node, ref, node->action);
1641 if (node->type == BTRFS_SHARED_BLOCK_REF_KEY)
1645 if (unlikely(node->ref_mod != 1)) {
1648 node->bytenr, node->ref_mod, node->action, ref_root,
1652 if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) {
1654 ret = alloc_reserved_tree_block(trans, node, extent_op);
1655 } else if (node->action == BTRFS_ADD_DELAYED_REF) {
1656 ret = __btrfs_inc_extent_ref(trans, node, parent, ref_root,
1658 } else if (node->action == BTRFS_DROP_DELAYED_REF) {
1659 ret = __btrfs_free_extent(trans, node, parent, ref_root,
1669 struct btrfs_delayed_ref_node *node,
1677 btrfs_pin_extent(trans, node->bytenr, node->num_bytes, 1);
1681 if (node->type == BTRFS_TREE_BLOCK_REF_KEY ||
1682 node->type == BTRFS_SHARED_BLOCK_REF_KEY)
1683 ret = run_delayed_tree_ref(trans, node, extent_op,
1685 else if (node->type == BTRFS_EXTENT_DATA_REF_KEY ||
1686 node->type == BTRFS_SHARED_DATA_REF_KEY)
1687 ret = run_delayed_data_ref(trans, node, extent_op,
1692 btrfs_pin_extent(trans, node->bytenr, node->num_bytes, 1);
1696 node->bytenr, node->num_bytes, node->type,
1697 node->action, node->ref_mod, ret);
1996 * Or we can get node references of the same type that weren't
2134 struct rb_node *node;
2165 node = rb_first_cached(&delayed_refs->href_root);
2166 if (!node) {
2170 head = rb_entry(node, struct btrfs_delayed_ref_head,
2219 struct rb_node *node;
2262 for (node = rb_first_cached(&head->ref_tree); node;
2263 node = rb_next(node)) {
2264 ref = rb_entry(node, struct btrfs_delayed_ref_node, ref_node);
2895 * Drop one or more refs of @node.
2914 * node->bytenr = 13631488
2915 * node->num_bytes = 1048576
2939 * node->bytenr = 13631488
2940 * node->num_bytes = 1048576
2954 struct btrfs_delayed_ref_node *node, u64 parent,
2973 u64 bytenr = node->bytenr;
2974 u64 num_bytes = node->num_bytes;
2989 node->bytenr, refs_to_drop);
4427 struct btrfs_delayed_ref_node *node,
4444 ref = btrfs_delayed_node_to_tree_ref(node);
4446 extent_key.objectid = node->bytenr;
4452 extent_key.offset = node->num_bytes;
4455 num_bytes = node->num_bytes;
4487 if (node->type == BTRFS_SHARED_BLOCK_REF_KEY) {
5250 if (eb == root->node) {
5404 * dropped as we unlock the root node and parent nodes as we walk down
5411 level = btrfs_header_level(root->node);
5440 level = btrfs_header_level(root->node);
5599 * drop subtree rooted at tree block 'node'.
5601 * NOTE: this function will unlock and release tree block 'node'
5606 struct extent_buffer *node,
5635 btrfs_assert_tree_locked(node);
5636 level = btrfs_header_level(node);
5637 path->nodes[level] = node;