Lines Matching defs:orph
129 static void orphan_delete(struct ubifs_info *c, struct ubifs_orphan *orph)
131 if (orph->del) {
132 dbg_gen("deleted twice ino %lu", (unsigned long)orph->inum);
136 if (orph->cmt) {
137 orph->del = 1;
138 orph->dnext = c->orph_dnext;
139 c->orph_dnext = orph;
140 dbg_gen("delete later ino %lu", (unsigned long)orph->inum);
144 __orphan_drop(c, orph);
209 struct ubifs_orphan *orph, *child_orph, *tmp_o;
213 orph = lookup_orphan(c, inum);
214 if (!orph) {
222 list_for_each_entry_safe(child_orph, tmp_o, &orph->child_list, child_list) {
227 orphan_delete(c, orph);
346 struct ubifs_orph_node *orph;
369 orph = c->orph_buf;
370 orph->ch.node_type = UBIFS_ORPH_NODE;
376 orph->inos[i] = cpu_to_le64(orphan->inum);
385 orph->cmt_no = cpu_to_le64(c->cmt_no);
388 orph->cmt_no = cpu_to_le64((c->cmt_no) | (1ULL << 63));
635 struct ubifs_orph_node *orph;
655 orph = snod->node;
658 cmt_no = le64_to_cpu(orph->cmt_no) & LLONG_MAX;
692 n = (le32_to_cpu(orph->ch.len) - UBIFS_ORPH_NODE_SZ) >> 3;
696 inum = le64_to_cpu(orph->inos[i]);
725 if (le64_to_cpu(orph->cmt_no) & (1ULL << 63)) {
726 dbg_rcvry("last orph node for commit %llu at %d:%d",
771 * marked (top bit of orph->cmt_no is set to 1). It is possible that
955 struct ubifs_orph_node *orph;
963 orph = snod->node;
964 n = (le32_to_cpu(orph->ch.len) - UBIFS_ORPH_NODE_SZ) >> 3;
966 inum = le64_to_cpu(orph->inos[i]);