366 				struct rb_node *parent, struct rb_node **p)  in __attach_extent_node()
377 	rb_link_node(&en->rb_node, parent, p);  in __attach_extent_node()
378 	rb_insert_color(&en->rb_node, &et->root);  in __attach_extent_node()
387 	rb_erase(&en->rb_node, &et->root);  in __detach_extent_node()
441 	struct rb_node *node = et->root.rb_node;  in __lookup_extent_tree()
452 		en = rb_entry(node, struct extent_node, rb_node);  in __lookup_extent_tree()
470 	struct rb_node *node;  in __try_back_merge()
472 	node = rb_prev(&en->rb_node);  in __try_back_merge()
476 	prev = rb_entry(node, struct extent_node, rb_node);  in __try_back_merge()
491 	struct rb_node *node;  in __try_front_merge()
493 	node = rb_next(&en->rb_node);  in __try_front_merge()
497 	next = rb_entry(node, struct extent_node, rb_node);  in __try_front_merge()
510 	struct rb_node **p = &et->root.rb_node;  in __insert_extent_tree()
511 	struct rb_node *parent = NULL;  in __insert_extent_tree()
516 		en = rb_entry(parent, struct extent_node, rb_node);  in __insert_extent_tree()
547 	struct rb_node *node, *next;  in __free_extent_tree()
554 		en = rb_entry(node, struct extent_node, rb_node);  in __free_extent_tree()
745 			struct rb_node *node = rb_first(&et->root);  in f2fs_preserve_extent_tree()
749 			en = rb_entry(node, struct extent_node, rb_node);  in f2fs_preserve_extent_tree()