48 	struct ubifs_orphan *orphan, *o;  in orphan_add()  local
51 	orphan = kzalloc(sizeof(struct ubifs_orphan), GFP_NOFS);  in orphan_add()
52 	if (!orphan)  in orphan_add()
54 	orphan->inum = inum;  in orphan_add()
55 	orphan->new = 1;  in orphan_add()
56 	INIT_LIST_HEAD(&orphan->child_list);  in orphan_add()
61 		kfree(orphan);  in orphan_add()
75 			kfree(orphan);  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()
83 	list_add_tail(&orphan->list, &c->orph_list);  in orphan_add()
84 	list_add_tail(&orphan->new_list, &c->orph_new);  in orphan_add()
87 		list_add_tail(&orphan->child_list,  in orphan_add()
93 	return orphan;  in orphan_add()
163 	struct ubifs_orphan *orphan;  in ubifs_add_orphan()  local
165 	orphan = orphan_add(c, inum, NULL);  in ubifs_add_orphan()
166 	if (IS_ERR(orphan))  in ubifs_add_orphan()
167 		return PTR_ERR(orphan);  in ubifs_add_orphan()
183 		xattr_orphan = orphan_add(c, xattr_inum, orphan);  in ubifs_add_orphan()
233 	struct ubifs_orphan *orphan, **last;  in ubifs_orphan_start_commit()  local
237 	list_for_each_entry(orphan, &c->orph_new, new_list) {  in ubifs_orphan_start_commit()
238 		ubifs_assert(c, orphan->new);  in ubifs_orphan_start_commit()
239 		ubifs_assert(c, !orphan->cmt);  in ubifs_orphan_start_commit()
240 		orphan->new = 0;  in ubifs_orphan_start_commit()
241 		orphan->cmt = 1;  in ubifs_orphan_start_commit()
242 		*last = orphan;  in ubifs_orphan_start_commit()
243 		last = &orphan->cnext;  in ubifs_orphan_start_commit()
338 	struct ubifs_orphan *orphan, *cnext;  in write_orph_node()  local
367 		orphan = cnext;  in write_orph_node()
368 		ubifs_assert(c, orphan->cmt);  in write_orph_node()
369 		orph->inos[i] = cpu_to_le64(orphan->inum);  in write_orph_node()
370 		orphan->cmt = 0;  in write_orph_node()
371 		cnext = orphan->cnext;  in write_orph_node()
372 		orphan->cnext = NULL;  in write_orph_node()
440 		struct ubifs_orphan *orphan, **last;  in consolidate()  local
445 		list_for_each_entry(orphan, &c->orph_list, list) {  in consolidate()
446 			if (orphan->new)  in consolidate()
448 			orphan->cmt = 1;  in consolidate()
449 			*last = orphan;  in consolidate()
450 			last = &orphan->cnext;  in consolidate()
505 	struct ubifs_orphan *orphan, *dnext;  in erase_deleted()  local
510 		orphan = dnext;  in erase_deleted()
511 		dnext = orphan->dnext;  in erase_deleted()
512 		ubifs_assert(c, !orphan->new);  in erase_deleted()
513 		ubifs_assert(c, orphan->del);  in erase_deleted()
514 		rb_erase(&orphan->rb, &c->orph_tree);  in erase_deleted()
515 		list_del(&orphan->list);  in erase_deleted()
517 		dbg_gen("deleting orphan ino %lu", (unsigned long)orphan->inum);  in erase_deleted()
518 		kfree(orphan);  in erase_deleted()
577 	struct ubifs_orphan *orphan, *o;  in insert_dead_orphan()  local
580 	orphan = kzalloc(sizeof(struct ubifs_orphan), GFP_KERNEL);  in insert_dead_orphan()
581 	if (!orphan)  in insert_dead_orphan()
583 	orphan->inum = inum;  in insert_dead_orphan()
595 			kfree(orphan);  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()
602 	list_add_tail(&orphan->list, &c->orph_list);  in insert_dead_orphan()
603 	orphan->del = 1;  in insert_dead_orphan()
604 	orphan->dnext = c->orph_dnext;  in insert_dead_orphan()
605 	c->orph_dnext = orphan;  in insert_dead_orphan()
858 	struct check_orphan *orphan, *o;  in dbg_ins_check_orphan()  local
861 	orphan = kzalloc(sizeof(struct check_orphan), GFP_NOFS);  in dbg_ins_check_orphan()
862 	if (!orphan)  in dbg_ins_check_orphan()
864 	orphan->inum = inum;  in dbg_ins_check_orphan()
875 			kfree(orphan);  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()