Lines Matching defs:node
206 if (ref1->node.type == BTRFS_TREE_BLOCK_REF_KEY) {
226 if (ref1->node.type == BTRFS_EXTENT_DATA_REF_KEY) {
278 struct rb_node *node)
287 ins = rb_entry(node, struct btrfs_delayed_ref_head, href_node);
304 rb_link_node(node, parent_node, p);
305 rb_insert_color_cached(node, root, leftmost);
313 struct rb_node *node = &ins->ref_node;
335 rb_link_node(node, parent_node, p);
336 rb_insert_color_cached(node, root, leftmost);
436 struct rb_node *node = rb_next(&ref->ref_node);
439 while (!done && node) {
442 next = rb_entry(node, struct btrfs_delayed_ref_node, ref_node);
443 node = rb_next(node);
482 struct rb_node *node;
505 for (node = rb_first_cached(&head->ref_tree); node;
506 node = rb_next(node)) {
507 ref = rb_entry(node, struct btrfs_delayed_ref_node, ref_node);
553 struct rb_node *node;
555 node = rb_next(&head->href_node);
556 if (!node) {
562 head = rb_entry(node, struct btrfs_delayed_ref_head,
762 * The head node stores the sum of all the mods, so dropping a ref
763 * should drop the sum in the head node by one.
812 * helper function to actually insert a head node into the rbtree.
978 init_delayed_ref_common(fs_info, &ref->node, bytenr, num_bytes,
993 * insert both the head node and the new ref without dropping
999 ret = insert_delayed_ref(trans, delayed_refs, head_ref, &ref->node);
1008 trace_add_delayed_tree_ref(fs_info, &ref->node, ref,
1052 init_delayed_ref_common(fs_info, &ref->node, bytenr, num_bytes,
1087 * insert both the head node and the new ref without dropping
1093 ret = insert_delayed_ref(trans, delayed_refs, head_ref, &ref->node);
1102 trace_add_delayed_data_ref(trans->fs_info, &ref->node, ref,
1147 * This does a simple search for the head node for a given extent. Returns the
1148 * head node if found, or NULL if not.