1 // SPDX-License-Identifier: GPL-2.0-only
3 * This file is part of UBIFS.
5 * Copyright (C) 2006-2008 Nokia Corporation.
7 * Author: Adrian Hunter
13 * An orphan is an inode number whose inode node has been committed to the index
14 * with a link count of zero. That happens when an open file is deleted
15 * (unlinked) and then a commit is run. In the normal course of events the inode
16 * would be deleted when the file is closed. However in the case of an unclean
17 * unmount, orphans need to be accounted for. After an unclean unmount, the
18 * orphans' inodes must be deleted which means either scanning the entire index
19 * looking for them, or keeping a list on flash somewhere. This unit implements
20 * the latter approach.
22 * The orphan area is a fixed number of LEBs situated between the LPT area and
23 * the main area. The number of orphan area LEBs is specified when the file
24 * system is created. The minimum number is 1. The size of the orphan area
25 * should be so that it can hold the maximum number of orphans that are expected
26 * to ever exist at one time.
28 * The number of orphans that can fit in a LEB is:
30 * (c->leb_size - UBIFS_ORPH_NODE_SZ) / sizeof(__le64)
32 * For example: a 15872 byte LEB can fit 1980 orphans so 1 LEB may be enough.
34 * Orphans are accumulated in a rb-tree. When an inode's link count drops to
35 * zero, the inode number is added to the rb-tree. It is removed from the tree
36 * when the inode is deleted. Any new orphans that are in the orphan tree when
37 * the commit is run, are written to the orphan area in 1 or more orphan nodes.
38 * If the orphan area is full, it is consolidated to make space. There is
39 * always enough space because validation prevents the user from creating more
40 * than the maximum number of orphans allowed.
43 static int dbg_check_orphans(struct ubifs_info *c);
45 static struct ubifs_orphan *orphan_add(struct ubifs_info *c, ino_t inum,
46 struct ubifs_orphan *parent_orphan)
48 struct ubifs_orphan *orphan, *o;
49 struct rb_node **p, *parent = NULL;
51 orphan = kzalloc(sizeof(struct ubifs_orphan), GFP_NOFS);
53 return ERR_PTR(-ENOMEM);
56 INIT_LIST_HEAD(&orphan->child_list);
58 spin_lock(&c->orphan_lock);
59 if (c->tot_orphans >= c->max_orphans) {
60 spin_unlock(&c->orphan_lock);
62 return ERR_PTR(-ENFILE);
64 p = &c->orph_tree.rb_node;
67 o = rb_entry(parent, struct ubifs_orphan, rb);
70 else if (inum > o->inum)
73 ubifs_err(c, "orphaned twice");
74 spin_unlock(&c->orphan_lock);
76 return ERR_PTR(-EINVAL);
81 rb_link_node(&orphan->rb, parent, p);
82 rb_insert_color(&orphan->rb, &c->orph_tree);
83 list_add_tail(&orphan->list, &c->orph_list);
84 list_add_tail(&orphan->new_list, &c->orph_new);
87 list_add_tail(&orphan->child_list,
88 &parent_orphan->child_list);
91 spin_unlock(&c->orphan_lock);
92 dbg_gen("ino %lu", (unsigned long)inum);
96 static struct ubifs_orphan *lookup_orphan(struct ubifs_info *c, ino_t inum)
98 struct ubifs_orphan *o;
101 p = c->orph_tree.rb_node;
103 o = rb_entry(p, struct ubifs_orphan, rb);
106 else if (inum > o->inum)
115 static void __orphan_drop(struct ubifs_info *c, struct ubifs_orphan *o)
117 rb_erase(&o->rb, &c->orph_tree);
122 list_del(&o->new_list);
129 static void orphan_delete(struct ubifs_info *c, struct ubifs_orphan *orph)
132 spin_unlock(&c->orphan_lock);
133 dbg_gen("deleted twice ino %lu", orph->inum);
139 orph->dnext = c->orph_dnext;
140 c->orph_dnext = orph;
141 spin_unlock(&c->orphan_lock);
142 dbg_gen("delete later ino %lu", orph->inum);
146 __orphan_drop(c, orph);
150 * ubifs_add_orphan - add an orphan.
151 * @c: UBIFS file-system description object
152 * @inum: orphan inode number
154 * Add an orphan. This function is called when an inodes link count drops to
157 int ubifs_add_orphan(struct ubifs_info *c, ino_t inum)
162 struct ubifs_dent_node *xent;
163 struct fscrypt_name nm = {0};
164 struct ubifs_orphan *xattr_orphan;
165 struct ubifs_orphan *orphan;
167 orphan = orphan_add(c, inum, NULL);
169 return PTR_ERR(orphan);
171 lowest_xent_key(c, &key, inum);
173 xent = ubifs_tnc_next_ent(c, &key, &nm);
181 fname_name(&nm) = xent->name;
182 fname_len(&nm) = le16_to_cpu(xent->nlen);
183 xattr_inum = le64_to_cpu(xent->inum);
185 xattr_orphan = orphan_add(c, xattr_inum, orphan);
186 if (IS_ERR(xattr_orphan))
187 return PTR_ERR(xattr_orphan);
189 key_read(c, &xent->key, &key);
196 * ubifs_delete_orphan - delete an orphan.
197 * @c: UBIFS file-system description object
198 * @inum: orphan inode number
200 * Delete an orphan. This function is called when an inode is deleted.
202 void ubifs_delete_orphan(struct ubifs_info *c, ino_t inum)
204 struct ubifs_orphan *orph, *child_orph, *tmp_o;
206 spin_lock(&c->orphan_lock);
208 orph = lookup_orphan(c, inum);
210 spin_unlock(&c->orphan_lock);
211 ubifs_err(c, "missing orphan ino %lu", (unsigned long)inum);
217 list_for_each_entry_safe(child_orph, tmp_o, &orph->child_list, child_list) {
218 list_del(&child_orph->child_list);
219 orphan_delete(c, child_orph);
222 orphan_delete(c, orph);
224 spin_unlock(&c->orphan_lock);
228 * ubifs_orphan_start_commit - start commit of orphans.
229 * @c: UBIFS file-system description object
231 * Start commit of orphans.
233 int ubifs_orphan_start_commit(struct ubifs_info *c)
235 struct ubifs_orphan *orphan, **last;
237 spin_lock(&c->orphan_lock);
238 last = &c->orph_cnext;
239 list_for_each_entry(orphan, &c->orph_new, new_list) {
240 ubifs_assert(c, orphan->new);
241 ubifs_assert(c, !orphan->cmt);
245 last = &orphan->cnext;
248 c->cmt_orphans = c->new_orphans;
250 dbg_cmt("%d orphans to commit", c->cmt_orphans);
251 INIT_LIST_HEAD(&c->orph_new);
252 if (c->tot_orphans == 0)
256 spin_unlock(&c->orphan_lock);
261 * avail_orphs - calculate available space.
262 * @c: UBIFS file-system description object
264 * This function returns the number of orphans that can be written in the
267 static int avail_orphs(struct ubifs_info *c)
269 int avail_lebs, avail, gap;
271 avail_lebs = c->orph_lebs - (c->ohead_lnum - c->orph_first) - 1;
273 ((c->leb_size - UBIFS_ORPH_NODE_SZ) / sizeof(__le64));
274 gap = c->leb_size - c->ohead_offs;
275 if (gap >= UBIFS_ORPH_NODE_SZ + sizeof(__le64))
276 avail += (gap - UBIFS_ORPH_NODE_SZ) / sizeof(__le64);
281 * tot_avail_orphs - calculate total space.
282 * @c: UBIFS file-system description object
284 * This function returns the number of orphans that can be written in half
285 * the total space. That leaves half the space for adding new orphans.
287 static int tot_avail_orphs(struct ubifs_info *c)
289 int avail_lebs, avail;
291 avail_lebs = c->orph_lebs;
293 ((c->leb_size - UBIFS_ORPH_NODE_SZ) / sizeof(__le64));
298 * do_write_orph_node - write a node to the orphan head.
299 * @c: UBIFS file-system description object
300 * @len: length of node
301 * @atomic: write atomically
303 * This function writes a node to the orphan head from the orphan buffer. If
304 * %atomic is not zero, then the write is done atomically. On success, %0 is
305 * returned, otherwise a negative error code is returned.
307 static int do_write_orph_node(struct ubifs_info *c, int len, int atomic)
312 ubifs_assert(c, c->ohead_offs == 0);
313 ubifs_prepare_node(c, c->orph_buf, len, 1);
314 len = ALIGN(len, c->min_io_size);
315 err = ubifs_leb_change(c, c->ohead_lnum, c->orph_buf, len);
317 if (c->ohead_offs == 0) {
318 /* Ensure LEB has been unmapped */
319 err = ubifs_leb_unmap(c, c->ohead_lnum);
323 err = ubifs_write_node(c, c->orph_buf, len, c->ohead_lnum,
330 * write_orph_node - write an orphan node.
331 * @c: UBIFS file-system description object
332 * @atomic: write atomically
334 * This function builds an orphan node from the cnext list and writes it to the
335 * orphan head. On success, %0 is returned, otherwise a negative error code
338 static int write_orph_node(struct ubifs_info *c, int atomic)
340 struct ubifs_orphan *orphan, *cnext;
341 struct ubifs_orph_node *orph;
342 int gap, err, len, cnt, i;
344 ubifs_assert(c, c->cmt_orphans > 0);
345 gap = c->leb_size - c->ohead_offs;
346 if (gap < UBIFS_ORPH_NODE_SZ + sizeof(__le64)) {
350 if (c->ohead_lnum > c->orph_last) {
352 * We limit the number of orphans so that this should
355 ubifs_err(c, "out of space in orphan area");
359 cnt = (gap - UBIFS_ORPH_NODE_SZ) / sizeof(__le64);
360 if (cnt > c->cmt_orphans)
361 cnt = c->cmt_orphans;
362 len = UBIFS_ORPH_NODE_SZ + cnt * sizeof(__le64);
363 ubifs_assert(c, c->orph_buf);
365 orph->ch.node_type = UBIFS_ORPH_NODE;
366 spin_lock(&c->orphan_lock);
367 cnext = c->orph_cnext;
368 for (i = 0; i < cnt; i++) {
370 ubifs_assert(c, orphan->cmt);
371 orph->inos[i] = cpu_to_le64(orphan->inum);
373 cnext = orphan->cnext;
374 orphan->cnext = NULL;
376 c->orph_cnext = cnext;
377 c->cmt_orphans -= cnt;
378 spin_unlock(&c->orphan_lock);
380 orph->cmt_no = cpu_to_le64(c->cmt_no);
382 /* Mark the last node of the commit */
383 orph->cmt_no = cpu_to_le64((c->cmt_no) | (1ULL << 63));
384 ubifs_assert(c, c->ohead_offs + len <= c->leb_size);
385 ubifs_assert(c, c->ohead_lnum >= c->orph_first);
386 ubifs_assert(c, c->ohead_lnum <= c->orph_last);
387 err = do_write_orph_node(c, len, atomic);
388 c->ohead_offs += ALIGN(len, c->min_io_size);
389 c->ohead_offs = ALIGN(c->ohead_offs, 8);
394 * write_orph_nodes - write orphan nodes until there are no more to commit.
395 * @c: UBIFS file-system description object
396 * @atomic: write atomically
398 * This function writes orphan nodes for all the orphans to commit. On success,
399 * %0 is returned, otherwise a negative error code is returned.
401 static int write_orph_nodes(struct ubifs_info *c, int atomic)
405 while (c->cmt_orphans > 0) {
406 err = write_orph_node(c, atomic);
413 /* Unmap any unused LEBs after consolidation */
414 for (lnum = c->ohead_lnum + 1; lnum <= c->orph_last; lnum++) {
415 err = ubifs_leb_unmap(c, lnum);
424 * consolidate - consolidate the orphan area.
425 * @c: UBIFS file-system description object
427 * This function enables consolidation by putting all the orphans into the list
428 * to commit. The list is in the order that the orphans were added, and the
429 * LEBs are written atomically in order, so at no time can orphans be lost by
430 * an unclean unmount.
432 * This function returns %0 on success and a negative error code on failure.
434 static int consolidate(struct ubifs_info *c)
436 int tot_avail = tot_avail_orphs(c), err = 0;
438 spin_lock(&c->orphan_lock);
439 dbg_cmt("there is space for %d orphans and there are %d",
440 tot_avail, c->tot_orphans);
441 if (c->tot_orphans - c->new_orphans <= tot_avail) {
442 struct ubifs_orphan *orphan, **last;
445 /* Change the cnext list to include all non-new orphans */
446 last = &c->orph_cnext;
447 list_for_each_entry(orphan, &c->orph_list, list) {
452 last = &orphan->cnext;
456 ubifs_assert(c, cnt == c->tot_orphans - c->new_orphans);
457 c->cmt_orphans = cnt;
458 c->ohead_lnum = c->orph_first;
462 * We limit the number of orphans so that this should
465 ubifs_err(c, "out of space in orphan area");
468 spin_unlock(&c->orphan_lock);
473 * commit_orphans - commit orphans.
474 * @c: UBIFS file-system description object
476 * This function commits orphans to flash. On success, %0 is returned,
477 * otherwise a negative error code is returned.
479 static int commit_orphans(struct ubifs_info *c)
481 int avail, atomic = 0, err;
483 ubifs_assert(c, c->cmt_orphans > 0);
484 avail = avail_orphs(c);
485 if (avail < c->cmt_orphans) {
486 /* Not enough space to write new orphans, so consolidate */
487 err = consolidate(c);
492 err = write_orph_nodes(c, atomic);
497 * erase_deleted - erase the orphans marked for deletion.
498 * @c: UBIFS file-system description object
500 * During commit, the orphans being committed cannot be deleted, so they are
501 * marked for deletion and deleted by this function. Also, the recovery
502 * adds killed orphans to the deletion list, and therefore they are deleted
505 static void erase_deleted(struct ubifs_info *c)
507 struct ubifs_orphan *orphan, *dnext;
509 spin_lock(&c->orphan_lock);
510 dnext = c->orph_dnext;
513 dnext = orphan->dnext;
514 ubifs_assert(c, !orphan->new);
515 ubifs_assert(c, orphan->del);
516 rb_erase(&orphan->rb, &c->orph_tree);
517 list_del(&orphan->list);
519 dbg_gen("deleting orphan ino %lu", (unsigned long)orphan->inum);
522 c->orph_dnext = NULL;
523 spin_unlock(&c->orphan_lock);
527 * ubifs_orphan_end_commit - end commit of orphans.
528 * @c: UBIFS file-system description object
530 * End commit of orphans.
532 int ubifs_orphan_end_commit(struct ubifs_info *c)
536 if (c->cmt_orphans != 0) {
537 err = commit_orphans(c);
542 err = dbg_check_orphans(c);
547 * ubifs_clear_orphans - erase all LEBs used for orphans.
548 * @c: UBIFS file-system description object
550 * If recovery is not required, then the orphans from the previous session
551 * are not needed. This function locates the LEBs used to record
552 * orphans, and un-maps them.
554 int ubifs_clear_orphans(struct ubifs_info *c)
558 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) {
559 err = ubifs_leb_unmap(c, lnum);
563 c->ohead_lnum = c->orph_first;
569 * insert_dead_orphan - insert an orphan.
570 * @c: UBIFS file-system description object
571 * @inum: orphan inode number
573 * This function is a helper to the 'do_kill_orphans()' function. The orphan
574 * must be kept until the next commit, so it is added to the rb-tree and the
577 static int insert_dead_orphan(struct ubifs_info *c, ino_t inum)
579 struct ubifs_orphan *orphan, *o;
580 struct rb_node **p, *parent = NULL;
582 orphan = kzalloc(sizeof(struct ubifs_orphan), GFP_KERNEL);
587 p = &c->orph_tree.rb_node;
590 o = rb_entry(parent, struct ubifs_orphan, rb);
593 else if (inum > o->inum)
596 /* Already added - no problem */
602 rb_link_node(&orphan->rb, parent, p);
603 rb_insert_color(&orphan->rb, &c->orph_tree);
604 list_add_tail(&orphan->list, &c->orph_list);
606 orphan->dnext = c->orph_dnext;
607 c->orph_dnext = orphan;
608 dbg_mnt("ino %lu, new %d, tot %d", (unsigned long)inum,
609 c->new_orphans, c->tot_orphans);
614 * do_kill_orphans - remove orphan inodes from the index.
615 * @c: UBIFS file-system description object
617 * @last_cmt_no: cmt_no of last orphan node read is passed and returned here
618 * @outofdate: whether the LEB is out of date is returned here
619 * @last_flagged: whether the end orphan node is encountered
621 * This function is a helper to the 'kill_orphans()' function. It goes through
622 * every orphan node in a LEB and for every inode number recorded, removes
623 * all keys for that inode from the TNC.
625 static int do_kill_orphans(struct ubifs_info *c, struct ubifs_scan_leb *sleb,
626 unsigned long long *last_cmt_no, int *outofdate,
629 struct ubifs_scan_node *snod;
630 struct ubifs_orph_node *orph;
631 struct ubifs_ino_node *ino = NULL;
632 unsigned long long cmt_no;
634 int i, n, err, first = 1;
636 list_for_each_entry(snod, &sleb->nodes, list) {
637 if (snod->type != UBIFS_ORPH_NODE) {
638 ubifs_err(c, "invalid node type %d in orphan area at %d:%d",
639 snod->type, sleb->lnum, snod->offs);
640 ubifs_dump_node(c, snod->node);
646 /* Check commit number */
647 cmt_no = le64_to_cpu(orph->cmt_no) & LLONG_MAX;
649 * The commit number on the master node may be less, because
650 * of a failed commit. If there are several failed commits in a
651 * row, the commit number written on orphan nodes will continue
652 * to increase (because the commit number is adjusted here) even
653 * though the commit number on the master node stays the same
654 * because the master node has not been re-written.
656 if (cmt_no > c->cmt_no)
658 if (cmt_no < *last_cmt_no && *last_flagged) {
660 * The last orphan node had a higher commit number and
661 * was flagged as the last written for that commit
662 * number. That makes this orphan node, out of date.
665 ubifs_err(c, "out of order commit number %llu in orphan node at %d:%d",
666 cmt_no, sleb->lnum, snod->offs);
667 ubifs_dump_node(c, snod->node);
670 dbg_rcvry("out of date LEB %d", sleb->lnum);
678 ino = kmalloc(UBIFS_MAX_INO_NODE_SZ, GFP_NOFS);
682 n = (le32_to_cpu(orph->ch.len) - UBIFS_ORPH_NODE_SZ) >> 3;
683 for (i = 0; i < n; i++) {
684 union ubifs_key key1, key2;
686 inum = le64_to_cpu(orph->inos[i]);
688 ino_key_init(c, &key1, inum);
689 err = ubifs_tnc_lookup(c, &key1, ino);
694 * Check whether an inode can really get deleted.
695 * linkat() with O_TMPFILE allows rebirth of an inode.
697 if (ino->nlink == 0) {
698 dbg_rcvry("deleting orphaned inode %lu",
699 (unsigned long)inum);
701 lowest_ino_key(c, &key1, inum);
702 highest_ino_key(c, &key2, inum);
704 err = ubifs_tnc_remove_range(c, &key1, &key2);
709 err = insert_dead_orphan(c, inum);
714 *last_cmt_no = cmt_no;
715 if (le64_to_cpu(orph->cmt_no) & (1ULL << 63)) {
716 dbg_rcvry("last orph node for commit %llu at %d:%d",
717 cmt_no, sleb->lnum, snod->offs);
729 ubifs_ro_mode(c, err);
735 * kill_orphans - remove all orphan inodes from the index.
736 * @c: UBIFS file-system description object
738 * If recovery is required, then orphan inodes recorded during the previous
739 * session (which ended with an unclean unmount) must be deleted from the index.
740 * This is done by updating the TNC, but since the index is not updated until
741 * the next commit, the LEBs where the orphan information is recorded are not
742 * erased until the next commit.
744 static int kill_orphans(struct ubifs_info *c)
746 unsigned long long last_cmt_no = 0;
747 int lnum, err = 0, outofdate = 0, last_flagged = 0;
749 c->ohead_lnum = c->orph_first;
751 /* Check no-orphans flag and skip this if no orphans */
753 dbg_rcvry("no orphans");
757 * Orph nodes always start at c->orph_first and are written to each
758 * successive LEB in turn. Generally unused LEBs will have been unmapped
759 * but may contain out of date orphan nodes if the unmap didn't go
760 * through. In addition, the last orphan node written for each commit is
761 * marked (top bit of orph->cmt_no is set to 1). It is possible that
762 * there are orphan nodes from the next commit (i.e. the commit did not
763 * complete successfully). In that case, no orphans will have been lost
764 * due to the way that orphans are written, and any orphans added will
765 * be valid orphans anyway and so can be deleted.
767 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) {
768 struct ubifs_scan_leb *sleb;
770 dbg_rcvry("LEB %d", lnum);
771 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1);
773 if (PTR_ERR(sleb) == -EUCLEAN)
774 sleb = ubifs_recover_leb(c, lnum, 0,
781 err = do_kill_orphans(c, sleb, &last_cmt_no, &outofdate,
783 if (err || outofdate) {
784 ubifs_scan_destroy(sleb);
788 c->ohead_lnum = lnum;
789 c->ohead_offs = sleb->endpt;
791 ubifs_scan_destroy(sleb);
797 * ubifs_mount_orphans - delete orphan inodes and erase LEBs that recorded them.
798 * @c: UBIFS file-system description object
799 * @unclean: indicates recovery from unclean unmount
800 * @read_only: indicates read only mount
802 * This function is called when mounting to erase orphans from the previous
803 * session. If UBIFS was not unmounted cleanly, then the inodes recorded as
804 * orphans are deleted.
806 int ubifs_mount_orphans(struct ubifs_info *c, int unclean, int read_only)
810 c->max_orphans = tot_avail_orphs(c);
813 c->orph_buf = vmalloc(c->leb_size);
819 err = kill_orphans(c);
821 err = ubifs_clear_orphans(c);
827 * Everything below is related to debugging.
830 struct check_orphan {
836 unsigned long last_ino;
837 unsigned long tot_inos;
838 unsigned long missing;
839 unsigned long long leaf_cnt;
840 struct ubifs_ino_node *node;
844 static bool dbg_find_orphan(struct ubifs_info *c, ino_t inum)
848 spin_lock(&c->orphan_lock);
849 found = !!lookup_orphan(c, inum);
850 spin_unlock(&c->orphan_lock);
855 static int dbg_ins_check_orphan(struct rb_root *root, ino_t inum)
857 struct check_orphan *orphan, *o;
858 struct rb_node **p, *parent = NULL;
860 orphan = kzalloc(sizeof(struct check_orphan), GFP_NOFS);
868 o = rb_entry(parent, struct check_orphan, rb);
871 else if (inum > o->inum)
878 rb_link_node(&orphan->rb, parent, p);
879 rb_insert_color(&orphan->rb, root);
883 static int dbg_find_check_orphan(struct rb_root *root, ino_t inum)
885 struct check_orphan *o;
890 o = rb_entry(p, struct check_orphan, rb);
893 else if (inum > o->inum)
901 static void dbg_free_check_tree(struct rb_root *root)
903 struct check_orphan *o, *n;
905 rbtree_postorder_for_each_entry_safe(o, n, root, rb)
909 static int dbg_orphan_check(struct ubifs_info *c, struct ubifs_zbranch *zbr,
912 struct check_info *ci = priv;
916 inum = key_inum(c, &zbr->key);
917 if (inum != ci->last_ino) {
918 /* Lowest node type is the inode node, so it comes first */
919 if (key_type(c, &zbr->key) != UBIFS_INO_KEY)
920 ubifs_err(c, "found orphan node ino %lu, type %d",
921 (unsigned long)inum, key_type(c, &zbr->key));
924 err = ubifs_tnc_read_node(c, zbr, ci->node);
926 ubifs_err(c, "node read failed, error %d", err);
929 if (ci->node->nlink == 0)
930 /* Must be recorded as an orphan */
931 if (!dbg_find_check_orphan(&ci->root, inum) &&
932 !dbg_find_orphan(c, inum)) {
933 ubifs_err(c, "missing orphan, ino %lu",
934 (unsigned long)inum);
942 static int dbg_read_orphans(struct check_info *ci, struct ubifs_scan_leb *sleb)
944 struct ubifs_scan_node *snod;
945 struct ubifs_orph_node *orph;
949 list_for_each_entry(snod, &sleb->nodes, list) {
951 if (snod->type != UBIFS_ORPH_NODE)
954 n = (le32_to_cpu(orph->ch.len) - UBIFS_ORPH_NODE_SZ) >> 3;
955 for (i = 0; i < n; i++) {
956 inum = le64_to_cpu(orph->inos[i]);
957 err = dbg_ins_check_orphan(&ci->root, inum);
965 static int dbg_scan_orphans(struct ubifs_info *c, struct check_info *ci)
970 /* Check no-orphans flag and skip this if no orphans */
974 buf = __vmalloc(c->leb_size, GFP_NOFS, PAGE_KERNEL);
976 ubifs_err(c, "cannot allocate memory to check orphans");
980 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) {
981 struct ubifs_scan_leb *sleb;
983 sleb = ubifs_scan(c, lnum, 0, buf, 0);
989 err = dbg_read_orphans(ci, sleb);
990 ubifs_scan_destroy(sleb);
999 static int dbg_check_orphans(struct ubifs_info *c)
1001 struct check_info ci;
1004 if (!dbg_is_chk_orph(c))
1012 ci.node = kmalloc(UBIFS_MAX_INO_NODE_SZ, GFP_NOFS);
1014 ubifs_err(c, "out of memory");
1018 err = dbg_scan_orphans(c, &ci);
1022 err = dbg_walk_index(c, &dbg_orphan_check, NULL, &ci);
1024 ubifs_err(c, "cannot scan TNC, error %d", err);
1029 ubifs_err(c, "%lu missing orphan(s)", ci.missing);
1034 dbg_cmt("last inode number is %lu", ci.last_ino);
1035 dbg_cmt("total number of inodes is %lu", ci.tot_inos);
1036 dbg_cmt("total number of leaf nodes is %llu", ci.leaf_cnt);
1039 dbg_free_check_tree(&ci.root);