75 		o = rb_entry(parent, struct ubifs_orphan, rb);  in ubifs_add_orphan()
89 	rb_link_node(&orphan->rb, parent, p);  in ubifs_add_orphan()
90 	rb_insert_color(&orphan->rb, &c->orph_tree);  in ubifs_add_orphan()
113 		o = rb_entry(p, struct ubifs_orphan, rb);  in ubifs_delete_orphan()
441 		rb_erase(&orphan->rb, &c->orph_tree);  in erase_deleted()
515 		o = rb_entry(parent, struct ubifs_orphan, rb);  in insert_dead_orphan()
527 	rb_link_node(&orphan->rb, parent, p);  in insert_dead_orphan()
528 	rb_insert_color(&orphan->rb, &c->orph_tree);  in insert_dead_orphan()
724 	struct rb_node rb;  member
745 		o = rb_entry(p, struct ubifs_orphan, rb);  in dbg_find_orphan()
772 		o = rb_entry(parent, struct check_orphan, rb);  in dbg_ins_check_orphan()
782 	rb_link_node(&orphan->rb, parent, p);  in dbg_ins_check_orphan()
783 	rb_insert_color(&orphan->rb, root);  in dbg_ins_check_orphan()
794 		o = rb_entry(p, struct check_orphan, rb);  in dbg_find_check_orphan()
809 	rbtree_postorder_for_each_entry_safe(o, n, root, rb)  in dbg_free_check_tree()