185 	struct rb_node **p = &list->rb_tree.rb_node;  in add_list()
186 	struct rb_node *parent = NULL;  in add_list()
193 		cur = rb_entry(parent, struct gc_candidate, rb_node);  in add_list()
205 	rb_link_node(&cand->rb_node, parent, p);  in add_list()
206 	rb_insert_color(&cand->rb_node, &list->rb_tree);  in add_list()
212 	cand = rb_entry(rb_last(&list->rb_tree), struct gc_candidate, rb_node);  in add_list()
213 	rb_erase(&cand->rb_node, &list->rb_tree);  in add_list()
222 	rb_erase(&cand->rb_node, &list->rb_tree);  in remove_from_list()
241 	cand = rb_entry(rb_first(&list->rb_tree), struct gc_candidate, rb_node);  in get_best_cand()
352 	return rb_entry(rb_first(&list->rb_tree), struct gc_candidate, rb_node);  in first_in_list()
598 			struct gc_candidate, rb_node);  in logfs_journal_wl_pass()
705 		cand = rb_entry(list->rb_tree.rb_node, struct gc_candidate,  in logfs_cleanup_list()
706 				rb_node);  in logfs_cleanup_list()
710 	BUG_ON(list->rb_tree.rb_node);  in logfs_cleanup_list()