orph              521 fs/ubifs/debug.c 		const struct ubifs_orph_node *orph = node;
orph              525 fs/ubifs/debug.c 				le64_to_cpu(orph->cmt_no) & LLONG_MAX);
orph              527 fs/ubifs/debug.c 		       (unsigned long long)(le64_to_cpu(orph->cmt_no)) >> 63);
orph              532 fs/ubifs/debug.c 			       (unsigned long long)le64_to_cpu(orph->inos[i]));
orph              129 fs/ubifs/orphan.c static void orphan_delete(struct ubifs_info *c, struct ubifs_orphan *orph)
orph              131 fs/ubifs/orphan.c 	if (orph->del) {
orph              132 fs/ubifs/orphan.c 		dbg_gen("deleted twice ino %lu", (unsigned long)orph->inum);
orph              136 fs/ubifs/orphan.c 	if (orph->cmt) {
orph              137 fs/ubifs/orphan.c 		orph->del = 1;
orph              138 fs/ubifs/orphan.c 		orph->dnext = c->orph_dnext;
orph              139 fs/ubifs/orphan.c 		c->orph_dnext = orph;
orph              140 fs/ubifs/orphan.c 		dbg_gen("delete later ino %lu", (unsigned long)orph->inum);
orph              144 fs/ubifs/orphan.c 	__orphan_drop(c, orph);
orph              202 fs/ubifs/orphan.c 	struct ubifs_orphan *orph, *child_orph, *tmp_o;
orph              206 fs/ubifs/orphan.c 	orph = lookup_orphan(c, inum);
orph              207 fs/ubifs/orphan.c 	if (!orph) {
orph              215 fs/ubifs/orphan.c 	list_for_each_entry_safe(child_orph, tmp_o, &orph->child_list, child_list) {
orph              220 fs/ubifs/orphan.c 	orphan_delete(c, orph);
orph              339 fs/ubifs/orphan.c 	struct ubifs_orph_node *orph;
orph              362 fs/ubifs/orphan.c 	orph = c->orph_buf;
orph              363 fs/ubifs/orphan.c 	orph->ch.node_type = UBIFS_ORPH_NODE;
orph              369 fs/ubifs/orphan.c 		orph->inos[i] = cpu_to_le64(orphan->inum);
orph              378 fs/ubifs/orphan.c 		orph->cmt_no = cpu_to_le64(c->cmt_no);
orph              381 fs/ubifs/orphan.c 		orph->cmt_no = cpu_to_le64((c->cmt_no) | (1ULL << 63));
orph              628 fs/ubifs/orphan.c 	struct ubifs_orph_node *orph;
orph              647 fs/ubifs/orphan.c 		orph = snod->node;
orph              650 fs/ubifs/orphan.c 		cmt_no = le64_to_cpu(orph->cmt_no) & LLONG_MAX;
orph              683 fs/ubifs/orphan.c 		n = (le32_to_cpu(orph->ch.len) - UBIFS_ORPH_NODE_SZ) >> 3;
orph              687 fs/ubifs/orphan.c 			inum = le64_to_cpu(orph->inos[i]);
orph              716 fs/ubifs/orphan.c 		if (le64_to_cpu(orph->cmt_no) & (1ULL << 63)) {
orph              946 fs/ubifs/orphan.c 	struct ubifs_orph_node *orph;
orph              954 fs/ubifs/orphan.c 		orph = snod->node;
orph              955 fs/ubifs/orphan.c 		n = (le32_to_cpu(orph->ch.len) - UBIFS_ORPH_NODE_SZ) >> 3;
orph              957 fs/ubifs/orphan.c 			inum = le64_to_cpu(orph->inos[i]);
orph              868 fs/ubifs/super.c 	struct ubifs_orphan *orph;
orph              871 fs/ubifs/super.c 		orph = c->orph_dnext;
orph              872 fs/ubifs/super.c 		c->orph_dnext = orph->dnext;
orph              873 fs/ubifs/super.c 		list_del(&orph->list);
orph              874 fs/ubifs/super.c 		kfree(orph);
orph              878 fs/ubifs/super.c 		orph = list_entry(c->orph_list.next, struct ubifs_orphan, list);
orph              879 fs/ubifs/super.c 		list_del(&orph->list);
orph              880 fs/ubifs/super.c 		kfree(orph);