36 	struct rb_node *node = root->rb_node;  in __lookup_rb_tree_slow()
40 		re = rb_entry(node, struct rb_entry, rb_node);  in __lookup_rb_tree_slow()
64 struct rb_node **f2fs_lookup_rb_tree_for_insert(struct f2fs_sb_info *sbi,  in f2fs_lookup_rb_tree_for_insert()
65 				struct rb_root *root, struct rb_node **parent,  in f2fs_lookup_rb_tree_for_insert()
68 	struct rb_node **p = &root->rb_node;  in f2fs_lookup_rb_tree_for_insert()
73 		re = rb_entry(*parent, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_for_insert()
100 				struct rb_node ***insert_p,  in f2fs_lookup_rb_tree_ret()
101 				struct rb_node **insert_parent,  in f2fs_lookup_rb_tree_ret()
104 	struct rb_node **pnode = &root->rb_node;  in f2fs_lookup_rb_tree_ret()
105 	struct rb_node *parent = NULL, *tmp_node;  in f2fs_lookup_rb_tree_ret()
123 		re = rb_entry(*pnode, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
136 	re = rb_entry(parent, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
140 	*next_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
145 	*prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
151 		tmp_node = rb_prev(&re->rb_node);  in f2fs_lookup_rb_tree_ret()
152 		*prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
156 		tmp_node = rb_next(&re->rb_node);  in f2fs_lookup_rb_tree_ret()
157 		*next_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);  in f2fs_lookup_rb_tree_ret()
166 	struct rb_node *cur = rb_first(root), *next;  in f2fs_check_rb_tree_consistence()
177 		cur_re = rb_entry(cur, struct rb_entry, rb_node);  in f2fs_check_rb_tree_consistence()
178 		next_re = rb_entry(next, struct rb_entry, rb_node);  in f2fs_check_rb_tree_consistence()
199 				struct rb_node *parent, struct rb_node **p)  in __attach_extent_node()
211 	rb_link_node(&en->rb_node, parent, p);  in __attach_extent_node()
212 	rb_insert_color(&en->rb_node, &et->root);  in __attach_extent_node()
221 	rb_erase(&en->rb_node, &et->root);  in __detach_extent_node()
281 	struct rb_node **p = &et->root.rb_node;  in __init_extent_tree()
296 	struct rb_node *node, *next;  in __free_extent_tree()
303 		en = rb_entry(node, struct extent_node, rb_node);  in __free_extent_tree()
459 				struct rb_node **insert_p,  in __insert_extent_tree()
460 				struct rb_node *insert_parent)  in __insert_extent_tree()
463 	struct rb_node **p;  in __insert_extent_tree()
464 	struct rb_node *parent = NULL;  in __insert_extent_tree()
497 	struct rb_node **insert_p = NULL, *insert_parent = NULL;  in f2fs_update_extent_tree_range()
566 			struct rb_node *node = rb_next(&en->rb_node);  in f2fs_update_extent_tree_range()
569 						rb_node);  in f2fs_update_extent_tree_range()