Lines Matching refs:node
33 /* returns NULL if the insertion worked, or it returns the node it did find
37 struct rb_node *node)
55 rb_link_node(node, parent, p);
56 rb_insert_color(node, root);
215 struct rb_node *node;
226 node = tree_insert(&tree->tree, entry->file_offset, &entry->rb_node);
227 if (node)
409 struct rb_node *node;
424 node = tree_search(tree, cur);
426 if (!node)
429 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
437 node = rb_next(node);
439 if (!node)
441 entry = rb_entry(node, struct btrfs_ordered_extent,
502 struct rb_node *node;
513 node = tree_search(tree, file_offset);
514 if (!node)
517 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
585 struct rb_node *node;
617 node = &entry->rb_node;
618 rb_erase(node, &tree->tree);
619 RB_CLEAR_NODE(node);
620 if (tree->last == node)
882 struct rb_node *node;
888 node = tree_search(tree, file_offset);
889 if (!node)
892 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
911 struct rb_node *node;
916 node = tree_search(tree, file_offset);
917 if (!node) {
918 node = tree_search(tree, file_offset + len);
919 if (!node)
924 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
933 node = rb_next(node);
934 if (!node)
983 struct rb_node *node;
988 node = tree_search(tree, file_offset);
989 if (!node)
992 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
1013 struct rb_node *node;
1020 node = tree->tree.rb_node;
1027 while (node) {
1028 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
1031 node = node->rb_left;
1033 node = node->rb_right;
1161 struct rb_node *node;
1195 node = &ordered->rb_node;
1196 rb_erase(node, &tree->tree);
1197 RB_CLEAR_NODE(node);
1198 if (tree->last == node)
1229 /* Re-insert the node */
1230 node = tree_insert(&tree->tree, ordered->file_offset, &ordered->rb_node);
1231 if (node)
1236 node = tree_insert(&tree->tree, new->file_offset, &new->rb_node);
1237 if (node)