33 	struct rb_node *node = root->rb_root.rb_node;  in __lookup_rb_tree_slow()
37 		re = rb_entry(node, struct rb_entry, rb_node);  in __lookup_rb_tree_slow()
61 struct rb_node **f2fs_lookup_rb_tree_ext(struct f2fs_sb_info *sbi,  in f2fs_lookup_rb_tree_ext()
63 					struct rb_node **parent,  in f2fs_lookup_rb_tree_ext()
66 	struct rb_node **p = &root->rb_root.rb_node;  in f2fs_lookup_rb_tree_ext()
71 		re = rb_entry(*parent, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ext()
84 struct rb_node **f2fs_lookup_rb_tree_for_insert(struct f2fs_sb_info *sbi,  in f2fs_lookup_rb_tree_for_insert()
86 				struct rb_node **parent,  in f2fs_lookup_rb_tree_for_insert()
89 	struct rb_node **p = &root->rb_root.rb_node;  in f2fs_lookup_rb_tree_for_insert()
94 		re = rb_entry(*parent, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_for_insert()
123 				struct rb_node ***insert_p,  in f2fs_lookup_rb_tree_ret()
124 				struct rb_node **insert_parent,  in f2fs_lookup_rb_tree_ret()
127 	struct rb_node **pnode = &root->rb_root.rb_node;  in f2fs_lookup_rb_tree_ret()
128 	struct rb_node *parent = NULL, *tmp_node;  in f2fs_lookup_rb_tree_ret()
149 		re = rb_entry(*pnode, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
165 	re = rb_entry(parent, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
169 	*next_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
174 	*prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
180 		tmp_node = rb_prev(&re->rb_node);  in f2fs_lookup_rb_tree_ret()
181 		*prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
185 		tmp_node = rb_next(&re->rb_node);  in f2fs_lookup_rb_tree_ret()
186 		*next_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
195 	struct rb_node *cur = rb_first_cached(root), *next;  in f2fs_check_rb_tree_consistence()
206 		cur_re = rb_entry(cur, struct rb_entry, rb_node);  in f2fs_check_rb_tree_consistence()
207 		next_re = rb_entry(next, struct rb_entry, rb_node);  in f2fs_check_rb_tree_consistence()
237 				struct rb_node *parent, struct rb_node **p,  in __attach_extent_node()
250 	rb_link_node(&en->rb_node, parent, p);  in __attach_extent_node()
251 	rb_insert_color_cached(&en->rb_node, &et->root, leftmost);  in __attach_extent_node()
260 	rb_erase_cached(&en->rb_node, &et->root);  in __detach_extent_node()
320 	struct rb_node **p = &et->root.rb_root.rb_node;  in __init_extent_tree()
335 	struct rb_node *node, *next;  in __free_extent_tree()
342 		en = rb_entry(node, struct extent_node, rb_node);  in __free_extent_tree()
497 				struct rb_node **insert_p,  in __insert_extent_tree()
498 				struct rb_node *insert_parent,  in __insert_extent_tree()
501 	struct rb_node **p;  in __insert_extent_tree()
502 	struct rb_node *parent = NULL;  in __insert_extent_tree()
538 	struct rb_node **insert_p = NULL, *insert_parent = NULL;  in f2fs_update_extent_tree_range()
610 			struct rb_node *node = rb_next(&en->rb_node);  in f2fs_update_extent_tree_range()
613 						rb_node);  in f2fs_update_extent_tree_range()