49 	struct rb_node **p, *parent = NULL;  in orphan_add()  local
64 	p = &c->orph_tree.rb_node;  in orphan_add()
65 	while (*p) {  in orphan_add()
66 		parent = *p;  in orphan_add()
69 			p = &(*p)->rb_left;  in orphan_add()
71 			p = &(*p)->rb_right;  in orphan_add()
81 	rb_link_node(&orphan->rb, parent, p);  in orphan_add()
99 	struct rb_node *p;  in lookup_orphan()  local
101 	p = c->orph_tree.rb_node;  in lookup_orphan()
102 	while (p) {  in lookup_orphan()
103 		o = rb_entry(p, struct ubifs_orphan, rb);  in lookup_orphan()
105 			p = p->rb_left;  in lookup_orphan()
107 			p = p->rb_right;  in lookup_orphan()
585 	struct rb_node **p, *parent = NULL;  in insert_dead_orphan()  local
592 	p = &c->orph_tree.rb_node;  in insert_dead_orphan()
593 	while (*p) {  in insert_dead_orphan()
594 		parent = *p;  in insert_dead_orphan()
597 			p = &(*p)->rb_left;  in insert_dead_orphan()
599 			p = &(*p)->rb_right;  in insert_dead_orphan()
607 	rb_link_node(&orphan->rb, parent, p);  in insert_dead_orphan()
868 	struct rb_node **p, *parent = NULL;  in dbg_ins_check_orphan()  local
875 	p = &root->rb_node;  in dbg_ins_check_orphan()
876 	while (*p) {  in dbg_ins_check_orphan()
877 		parent = *p;  in dbg_ins_check_orphan()
880 			p = &(*p)->rb_left;  in dbg_ins_check_orphan()
882 			p = &(*p)->rb_right;  in dbg_ins_check_orphan()
888 	rb_link_node(&orphan->rb, parent, p);  in dbg_ins_check_orphan()
896 	struct rb_node *p;  in dbg_find_check_orphan()  local
898 	p = root->rb_node;  in dbg_find_check_orphan()
899 	while (p) {  in dbg_find_check_orphan()
900 		o = rb_entry(p, struct check_orphan, rb);  in dbg_find_check_orphan()
902 			p = p->rb_left;  in dbg_find_check_orphan()
904 			p = p->rb_right;  in dbg_find_check_orphan()