67 		o = rb_entry(parent, struct ubifs_orphan, rb);  in orphan_add()
81 	rb_link_node(&orphan->rb, parent, p);  in orphan_add()
82 	rb_insert_color(&orphan->rb, &c->orph_tree);  in orphan_add()
103 		o = rb_entry(p, struct ubifs_orphan, rb);  in lookup_orphan()
117 	rb_erase(&o->rb, &c->orph_tree);  in __orphan_drop()
514 		rb_erase(&orphan->rb, &c->orph_tree);  in erase_deleted()
588 		o = rb_entry(parent, struct ubifs_orphan, rb);  in insert_dead_orphan()
600 	rb_link_node(&orphan->rb, parent, p);  in insert_dead_orphan()
601 	rb_insert_color(&orphan->rb, &c->orph_tree);  in insert_dead_orphan()
832 	struct rb_node rb;  member
869 		o = rb_entry(parent, struct check_orphan, rb);  in dbg_ins_check_orphan()
879 	rb_link_node(&orphan->rb, parent, p);  in dbg_ins_check_orphan()
880 	rb_insert_color(&orphan->rb, root);  in dbg_ins_check_orphan()
891 		o = rb_entry(p, struct check_orphan, rb);  in dbg_find_check_orphan()
906 	rbtree_postorder_for_each_entry_safe(o, n, root, rb)  in dbg_free_check_tree()