Lines Matching refs:rb_node
36 static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset, in tree_insert()
37 struct rb_node *node) in tree_insert()
39 struct rb_node **p = &root->rb_node; in tree_insert()
40 struct rb_node *parent = NULL; in tree_insert()
45 entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node); in tree_insert()
64 static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset, in __tree_search()
65 struct rb_node **prev_ret) in __tree_search()
67 struct rb_node *n = root->rb_node; in __tree_search()
68 struct rb_node *prev = NULL; in __tree_search()
69 struct rb_node *test; in __tree_search()
74 entry = rb_entry(n, struct btrfs_ordered_extent, rb_node); in __tree_search()
93 rb_node); in __tree_search()
101 rb_node); in __tree_search()
107 rb_node); in __tree_search()
127 static inline struct rb_node *ordered_tree_search(struct btrfs_inode *inode, in ordered_tree_search()
130 struct rb_node *prev = NULL; in ordered_tree_search()
131 struct rb_node *ret; in ordered_tree_search()
136 rb_node); in ordered_tree_search()
230 struct rb_node *node; in insert_ordered_extent()
242 &entry->rb_node); in insert_ordered_extent()
482 struct rb_node *node; in btrfs_mark_ordered_io_finished()
502 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_mark_ordered_io_finished()
515 rb_node); in btrfs_mark_ordered_io_finished()
574 struct rb_node *node; in btrfs_dec_test_ordered_pending()
589 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_dec_test_ordered_pending()
634 ASSERT(RB_EMPTY_NODE(&entry->rb_node)); in btrfs_put_ordered_extent()
651 struct rb_node *node; in btrfs_remove_ordered_extent()
682 node = &entry->rb_node; in btrfs_remove_ordered_extent()
972 struct rb_node *node; in btrfs_lookup_ordered_extent()
981 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_lookup_ordered_extent()
999 struct rb_node *node; in btrfs_lookup_ordered_range()
1011 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_lookup_ordered_range()
1040 struct rb_node *n; in btrfs_get_ordered_extents_for_logging()
1048 ordered = rb_entry(n, struct btrfs_ordered_extent, rb_node); in btrfs_get_ordered_extents_for_logging()
1068 struct rb_node *node; in btrfs_lookup_first_ordered_extent()
1076 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_lookup_first_ordered_extent()
1096 struct rb_node *node; in btrfs_lookup_first_ordered_range()
1097 struct rb_node *cur; in btrfs_lookup_first_ordered_range()
1098 struct rb_node *prev; in btrfs_lookup_first_ordered_range()
1099 struct rb_node *next; in btrfs_lookup_first_ordered_range()
1103 node = inode->ordered_tree.rb_node; in btrfs_lookup_first_ordered_range()
1111 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_lookup_first_ordered_range()
1130 cur = &entry->rb_node; in btrfs_lookup_first_ordered_range()
1140 entry = rb_entry(prev, struct btrfs_ordered_extent, rb_node); in btrfs_lookup_first_ordered_range()
1145 entry = rb_entry(next, struct btrfs_ordered_extent, rb_node); in btrfs_lookup_first_ordered_range()
1243 struct rb_node *node; in btrfs_split_ordered_extent()
1341 node = tree_insert(&inode->ordered_tree, new->file_offset, &new->rb_node); in btrfs_split_ordered_extent()