Lines Matching defs:node
29 /* returns NULL if the insertion worked, or it returns the node it did find
33 struct rb_node *node)
51 rb_link_node(node, parent, p);
52 rb_insert_color(node, root);
170 struct rb_node *node;
223 node = tree_insert(&tree->tree, file_offset,
225 if (node)
317 struct rb_node *node;
326 node = tree_search(tree, *file_offset);
327 if (!node) {
332 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
386 struct rb_node *node;
397 node = tree_search(tree, file_offset);
398 if (!node) {
403 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
472 struct rb_node *node;
489 node = &entry->rb_node;
490 rb_erase(node, &tree->tree);
491 RB_CLEAR_NODE(node);
492 if (tree->last == node)
746 struct rb_node *node;
751 node = tree_search(tree, file_offset);
752 if (!node)
755 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
772 struct rb_node *node;
777 node = tree_search(tree, file_offset);
778 if (!node) {
779 node = tree_search(tree, file_offset + len);
780 if (!node)
785 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
794 node = rb_next(node);
795 if (!node)
841 struct rb_node *node;
846 node = tree_search(tree, file_offset);
847 if (!node)
850 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);