154 	struct rb_node *node = root->rb_root.rb_node;  in __lookup_rb_tree_slow()
158 		re = rb_entry(node, struct rb_entry, rb_node);  in __lookup_rb_tree_slow()
182 struct rb_node **f2fs_lookup_rb_tree_ext(struct f2fs_sb_info *sbi,  in f2fs_lookup_rb_tree_ext()
184 					struct rb_node **parent,  in f2fs_lookup_rb_tree_ext()
187 	struct rb_node **p = &root->rb_root.rb_node;  in f2fs_lookup_rb_tree_ext()
192 		re = rb_entry(*parent, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ext()
205 struct rb_node **f2fs_lookup_rb_tree_for_insert(struct f2fs_sb_info *sbi,  in f2fs_lookup_rb_tree_for_insert()
207 				struct rb_node **parent,  in f2fs_lookup_rb_tree_for_insert()
210 	struct rb_node **p = &root->rb_root.rb_node;  in f2fs_lookup_rb_tree_for_insert()
215 		re = rb_entry(*parent, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_for_insert()
244 				struct rb_node ***insert_p,  in f2fs_lookup_rb_tree_ret()
245 				struct rb_node **insert_parent,  in f2fs_lookup_rb_tree_ret()
248 	struct rb_node **pnode = &root->rb_root.rb_node;  in f2fs_lookup_rb_tree_ret()
249 	struct rb_node *parent = NULL, *tmp_node;  in f2fs_lookup_rb_tree_ret()
270 		re = rb_entry(*pnode, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
286 	re = rb_entry(parent, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
290 	*next_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
295 	*prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
301 		tmp_node = rb_prev(&re->rb_node);  in f2fs_lookup_rb_tree_ret()
302 		*prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
306 		tmp_node = rb_next(&re->rb_node);  in f2fs_lookup_rb_tree_ret()
307 		*next_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
316 	struct rb_node *cur = rb_first_cached(root), *next;  in f2fs_check_rb_tree_consistence()
327 		cur_re = rb_entry(cur, struct rb_entry, rb_node);  in f2fs_check_rb_tree_consistence()
328 		next_re = rb_entry(next, struct rb_entry, rb_node);  in f2fs_check_rb_tree_consistence()
358 				struct rb_node *parent, struct rb_node **p,  in __attach_extent_node()
372 	rb_link_node(&en->rb_node, parent, p);  in __attach_extent_node()
373 	rb_insert_color_cached(&en->rb_node, &et->root, leftmost);  in __attach_extent_node()
384 	rb_erase_cached(&en->rb_node, &et->root);  in __detach_extent_node()
449 	struct rb_node *node, *next;  in __free_extent_tree()
456 		en = rb_entry(node, struct extent_node, rb_node);  in __free_extent_tree()
505 				&et->root.rb_root.rb_node, true);  in f2fs_init_read_extent_tree()
634 				struct rb_node **insert_p,  in __insert_extent_tree()
635 				struct rb_node *insert_parent,  in __insert_extent_tree()
639 	struct rb_node **p;  in __insert_extent_tree()
640 	struct rb_node *parent = NULL;  in __insert_extent_tree()
676 	struct rb_node **insert_p = NULL, *insert_parent = NULL;  in __update_extent_tree_range()
761 			struct rb_node *node = rb_next(&en->rb_node);  in __update_extent_tree_range()
764 						rb_node);  in __update_extent_tree_range()
841 	struct rb_node **insert_p = NULL, *insert_parent = NULL;  in f2fs_update_read_extent_tree_range_compressed()