57 	struct ubifs_orphan *orphan, *o;  in ubifs_add_orphan()  local
60 	orphan = kzalloc(sizeof(struct ubifs_orphan), GFP_NOFS);  in ubifs_add_orphan()
61 	if (!orphan)  in ubifs_add_orphan()
63 	orphan->inum = inum;  in ubifs_add_orphan()
64 	orphan->new = 1;  in ubifs_add_orphan()
69 		kfree(orphan);  in ubifs_add_orphan()
83 			kfree(orphan);  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()
91 	list_add_tail(&orphan->list, &c->orph_list);  in ubifs_add_orphan()
92 	list_add_tail(&orphan->new_list, &c->orph_new);  in ubifs_add_orphan()
160 	struct ubifs_orphan *orphan, **last;  in ubifs_orphan_start_commit()  local
164 	list_for_each_entry(orphan, &c->orph_new, new_list) {  in ubifs_orphan_start_commit()
165 		ubifs_assert(orphan->new);  in ubifs_orphan_start_commit()
166 		ubifs_assert(!orphan->cmt);  in ubifs_orphan_start_commit()
167 		orphan->new = 0;  in ubifs_orphan_start_commit()
168 		orphan->cmt = 1;  in ubifs_orphan_start_commit()
169 		*last = orphan;  in ubifs_orphan_start_commit()
170 		last = &orphan->cnext;  in ubifs_orphan_start_commit()
265 	struct ubifs_orphan *orphan, *cnext;  in write_orph_node()  local
294 		orphan = cnext;  in write_orph_node()
295 		ubifs_assert(orphan->cmt);  in write_orph_node()
296 		orph->inos[i] = cpu_to_le64(orphan->inum);  in write_orph_node()
297 		orphan->cmt = 0;  in write_orph_node()
298 		cnext = orphan->cnext;  in write_orph_node()
299 		orphan->cnext = NULL;  in write_orph_node()
367 		struct ubifs_orphan *orphan, **last;  in consolidate()  local
372 		list_for_each_entry(orphan, &c->orph_list, list) {  in consolidate()
373 			if (orphan->new)  in consolidate()
375 			orphan->cmt = 1;  in consolidate()
376 			*last = orphan;  in consolidate()
377 			last = &orphan->cnext;  in consolidate()
432 	struct ubifs_orphan *orphan, *dnext;  in erase_deleted()  local
437 		orphan = dnext;  in erase_deleted()
438 		dnext = orphan->dnext;  in erase_deleted()
439 		ubifs_assert(!orphan->new);  in erase_deleted()
440 		ubifs_assert(orphan->del);  in erase_deleted()
441 		rb_erase(&orphan->rb, &c->orph_tree);  in erase_deleted()
442 		list_del(&orphan->list);  in erase_deleted()
444 		dbg_gen("deleting orphan ino %lu", (unsigned long)orphan->inum);  in erase_deleted()
445 		kfree(orphan);  in erase_deleted()
504 	struct ubifs_orphan *orphan, *o;  in insert_dead_orphan()  local
507 	orphan = kzalloc(sizeof(struct ubifs_orphan), GFP_KERNEL);  in insert_dead_orphan()
508 	if (!orphan)  in insert_dead_orphan()
510 	orphan->inum = inum;  in insert_dead_orphan()
522 			kfree(orphan);  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()
529 	list_add_tail(&orphan->list, &c->orph_list);  in insert_dead_orphan()
530 	orphan->del = 1;  in insert_dead_orphan()
531 	orphan->dnext = c->orph_dnext;  in insert_dead_orphan()
532 	c->orph_dnext = orphan;  in insert_dead_orphan()
761 	struct check_orphan *orphan, *o;  in dbg_ins_check_orphan()  local
764 	orphan = kzalloc(sizeof(struct check_orphan), GFP_NOFS);  in dbg_ins_check_orphan()
765 	if (!orphan)  in dbg_ins_check_orphan()
767 	orphan->inum = inum;  in dbg_ins_check_orphan()
778 			kfree(orphan);  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()