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 dbg_gen("deleted twice ino %lu", orph->inum);
138 orph->dnext = c->orph_dnext;
139 c->orph_dnext = orph;
140 dbg_gen("delete later ino %lu", orph->inum);
144 __orphan_drop(c, orph);
148 * ubifs_add_orphan - add an orphan.
149 * @c: UBIFS file-system description object
150 * @inum: orphan inode number
152 * Add an orphan. This function is called when an inodes link count drops to
155 int ubifs_add_orphan(struct ubifs_info *c, ino_t inum)
160 struct ubifs_dent_node *xent;
161 struct fscrypt_name nm = {0};
162 struct ubifs_orphan *xattr_orphan;
163 struct ubifs_orphan *orphan;
165 orphan = orphan_add(c, inum, NULL);
167 return PTR_ERR(orphan);
169 lowest_xent_key(c, &key, inum);
171 xent = ubifs_tnc_next_ent(c, &key, &nm);
179 fname_name(&nm) = xent->name;
180 fname_len(&nm) = le16_to_cpu(xent->nlen);
181 xattr_inum = le64_to_cpu(xent->inum);
183 xattr_orphan = orphan_add(c, xattr_inum, orphan);
184 if (IS_ERR(xattr_orphan))
185 return PTR_ERR(xattr_orphan);
187 key_read(c, &xent->key, &key);
194 * ubifs_delete_orphan - delete an orphan.
195 * @c: UBIFS file-system description object
196 * @inum: orphan inode number
198 * Delete an orphan. This function is called when an inode is deleted.
200 void ubifs_delete_orphan(struct ubifs_info *c, ino_t inum)
202 struct ubifs_orphan *orph, *child_orph, *tmp_o;
204 spin_lock(&c->orphan_lock);
206 orph = lookup_orphan(c, inum);
208 spin_unlock(&c->orphan_lock);
209 ubifs_err(c, "missing orphan ino %lu", (unsigned long)inum);
215 list_for_each_entry_safe(child_orph, tmp_o, &orph->child_list, child_list) {
216 list_del(&child_orph->child_list);
217 orphan_delete(c, child_orph);
220 orphan_delete(c, orph);
222 spin_unlock(&c->orphan_lock);
226 * ubifs_orphan_start_commit - start commit of orphans.
227 * @c: UBIFS file-system description object
229 * Start commit of orphans.
231 int ubifs_orphan_start_commit(struct ubifs_info *c)
233 struct ubifs_orphan *orphan, **last;
235 spin_lock(&c->orphan_lock);
236 last = &c->orph_cnext;
237 list_for_each_entry(orphan, &c->orph_new, new_list) {
238 ubifs_assert(c, orphan->new);
239 ubifs_assert(c, !orphan->cmt);
243 last = &orphan->cnext;
246 c->cmt_orphans = c->new_orphans;
248 dbg_cmt("%d orphans to commit", c->cmt_orphans);
249 INIT_LIST_HEAD(&c->orph_new);
250 if (c->tot_orphans == 0)
254 spin_unlock(&c->orphan_lock);
259 * avail_orphs - calculate available space.
260 * @c: UBIFS file-system description object
262 * This function returns the number of orphans that can be written in the
265 static int avail_orphs(struct ubifs_info *c)
267 int avail_lebs, avail, gap;
269 avail_lebs = c->orph_lebs - (c->ohead_lnum - c->orph_first) - 1;
271 ((c->leb_size - UBIFS_ORPH_NODE_SZ) / sizeof(__le64));
272 gap = c->leb_size - c->ohead_offs;
273 if (gap >= UBIFS_ORPH_NODE_SZ + sizeof(__le64))
274 avail += (gap - UBIFS_ORPH_NODE_SZ) / sizeof(__le64);
279 * tot_avail_orphs - calculate total space.
280 * @c: UBIFS file-system description object
282 * This function returns the number of orphans that can be written in half
283 * the total space. That leaves half the space for adding new orphans.
285 static int tot_avail_orphs(struct ubifs_info *c)
287 int avail_lebs, avail;
289 avail_lebs = c->orph_lebs;
291 ((c->leb_size - UBIFS_ORPH_NODE_SZ) / sizeof(__le64));
296 * do_write_orph_node - write a node to the orphan head.
297 * @c: UBIFS file-system description object
298 * @len: length of node
299 * @atomic: write atomically
301 * This function writes a node to the orphan head from the orphan buffer. If
302 * %atomic is not zero, then the write is done atomically. On success, %0 is
303 * returned, otherwise a negative error code is returned.
305 static int do_write_orph_node(struct ubifs_info *c, int len, int atomic)
310 ubifs_assert(c, c->ohead_offs == 0);
311 ubifs_prepare_node(c, c->orph_buf, len, 1);
312 len = ALIGN(len, c->min_io_size);
313 err = ubifs_leb_change(c, c->ohead_lnum, c->orph_buf, len);
315 if (c->ohead_offs == 0) {
316 /* Ensure LEB has been unmapped */
317 err = ubifs_leb_unmap(c, c->ohead_lnum);
321 err = ubifs_write_node(c, c->orph_buf, len, c->ohead_lnum,
328 * write_orph_node - write an orphan node.
329 * @c: UBIFS file-system description object
330 * @atomic: write atomically
332 * This function builds an orphan node from the cnext list and writes it to the
333 * orphan head. On success, %0 is returned, otherwise a negative error code
336 static int write_orph_node(struct ubifs_info *c, int atomic)
338 struct ubifs_orphan *orphan, *cnext;
339 struct ubifs_orph_node *orph;
340 int gap, err, len, cnt, i;
342 ubifs_assert(c, c->cmt_orphans > 0);
343 gap = c->leb_size - c->ohead_offs;
344 if (gap < UBIFS_ORPH_NODE_SZ + sizeof(__le64)) {
348 if (c->ohead_lnum > c->orph_last) {
350 * We limit the number of orphans so that this should
353 ubifs_err(c, "out of space in orphan area");
357 cnt = (gap - UBIFS_ORPH_NODE_SZ) / sizeof(__le64);
358 if (cnt > c->cmt_orphans)
359 cnt = c->cmt_orphans;
360 len = UBIFS_ORPH_NODE_SZ + cnt * sizeof(__le64);
361 ubifs_assert(c, c->orph_buf);
363 orph->ch.node_type = UBIFS_ORPH_NODE;
364 spin_lock(&c->orphan_lock);
365 cnext = c->orph_cnext;
366 for (i = 0; i < cnt; i++) {
368 ubifs_assert(c, orphan->cmt);
369 orph->inos[i] = cpu_to_le64(orphan->inum);
371 cnext = orphan->cnext;
372 orphan->cnext = NULL;
374 c->orph_cnext = cnext;
375 c->cmt_orphans -= cnt;
376 spin_unlock(&c->orphan_lock);
378 orph->cmt_no = cpu_to_le64(c->cmt_no);
380 /* Mark the last node of the commit */
381 orph->cmt_no = cpu_to_le64((c->cmt_no) | (1ULL << 63));
382 ubifs_assert(c, c->ohead_offs + len <= c->leb_size);
383 ubifs_assert(c, c->ohead_lnum >= c->orph_first);
384 ubifs_assert(c, c->ohead_lnum <= c->orph_last);
385 err = do_write_orph_node(c, len, atomic);
386 c->ohead_offs += ALIGN(len, c->min_io_size);
387 c->ohead_offs = ALIGN(c->ohead_offs, 8);
392 * write_orph_nodes - write orphan nodes until there are no more to commit.
393 * @c: UBIFS file-system description object
394 * @atomic: write atomically
396 * This function writes orphan nodes for all the orphans to commit. On success,
397 * %0 is returned, otherwise a negative error code is returned.
399 static int write_orph_nodes(struct ubifs_info *c, int atomic)
403 while (c->cmt_orphans > 0) {
404 err = write_orph_node(c, atomic);
411 /* Unmap any unused LEBs after consolidation */
412 for (lnum = c->ohead_lnum + 1; lnum <= c->orph_last; lnum++) {
413 err = ubifs_leb_unmap(c, lnum);
422 * consolidate - consolidate the orphan area.
423 * @c: UBIFS file-system description object
425 * This function enables consolidation by putting all the orphans into the list
426 * to commit. The list is in the order that the orphans were added, and the
427 * LEBs are written atomically in order, so at no time can orphans be lost by
428 * an unclean unmount.
430 * This function returns %0 on success and a negative error code on failure.
432 static int consolidate(struct ubifs_info *c)
434 int tot_avail = tot_avail_orphs(c), err = 0;
436 spin_lock(&c->orphan_lock);
437 dbg_cmt("there is space for %d orphans and there are %d",
438 tot_avail, c->tot_orphans);
439 if (c->tot_orphans - c->new_orphans <= tot_avail) {
440 struct ubifs_orphan *orphan, **last;
443 /* Change the cnext list to include all non-new orphans */
444 last = &c->orph_cnext;
445 list_for_each_entry(orphan, &c->orph_list, list) {
450 last = &orphan->cnext;
454 ubifs_assert(c, cnt == c->tot_orphans - c->new_orphans);
455 c->cmt_orphans = cnt;
456 c->ohead_lnum = c->orph_first;
460 * We limit the number of orphans so that this should
463 ubifs_err(c, "out of space in orphan area");
466 spin_unlock(&c->orphan_lock);
471 * commit_orphans - commit orphans.
472 * @c: UBIFS file-system description object
474 * This function commits orphans to flash. On success, %0 is returned,
475 * otherwise a negative error code is returned.
477 static int commit_orphans(struct ubifs_info *c)
479 int avail, atomic = 0, err;
481 ubifs_assert(c, c->cmt_orphans > 0);
482 avail = avail_orphs(c);
483 if (avail < c->cmt_orphans) {
484 /* Not enough space to write new orphans, so consolidate */
485 err = consolidate(c);
490 err = write_orph_nodes(c, atomic);
495 * erase_deleted - erase the orphans marked for deletion.
496 * @c: UBIFS file-system description object
498 * During commit, the orphans being committed cannot be deleted, so they are
499 * marked for deletion and deleted by this function. Also, the recovery
500 * adds killed orphans to the deletion list, and therefore they are deleted
503 static void erase_deleted(struct ubifs_info *c)
505 struct ubifs_orphan *orphan, *dnext;
507 spin_lock(&c->orphan_lock);
508 dnext = c->orph_dnext;
511 dnext = orphan->dnext;
512 ubifs_assert(c, !orphan->new);
513 ubifs_assert(c, orphan->del);
514 rb_erase(&orphan->rb, &c->orph_tree);
515 list_del(&orphan->list);
517 dbg_gen("deleting orphan ino %lu", (unsigned long)orphan->inum);
520 c->orph_dnext = NULL;
521 spin_unlock(&c->orphan_lock);
525 * ubifs_orphan_end_commit - end commit of orphans.
526 * @c: UBIFS file-system description object
528 * End commit of orphans.
530 int ubifs_orphan_end_commit(struct ubifs_info *c)
534 if (c->cmt_orphans != 0) {
535 err = commit_orphans(c);
540 err = dbg_check_orphans(c);
545 * ubifs_clear_orphans - erase all LEBs used for orphans.
546 * @c: UBIFS file-system description object
548 * If recovery is not required, then the orphans from the previous session
549 * are not needed. This function locates the LEBs used to record
550 * orphans, and un-maps them.
552 int ubifs_clear_orphans(struct ubifs_info *c)
556 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) {
557 err = ubifs_leb_unmap(c, lnum);
561 c->ohead_lnum = c->orph_first;
567 * insert_dead_orphan - insert an orphan.
568 * @c: UBIFS file-system description object
569 * @inum: orphan inode number
571 * This function is a helper to the 'do_kill_orphans()' function. The orphan
572 * must be kept until the next commit, so it is added to the rb-tree and the
575 static int insert_dead_orphan(struct ubifs_info *c, ino_t inum)
577 struct ubifs_orphan *orphan, *o;
578 struct rb_node **p, *parent = NULL;
580 orphan = kzalloc(sizeof(struct ubifs_orphan), GFP_KERNEL);
585 p = &c->orph_tree.rb_node;
588 o = rb_entry(parent, struct ubifs_orphan, rb);
591 else if (inum > o->inum)
594 /* Already added - no problem */
600 rb_link_node(&orphan->rb, parent, p);
601 rb_insert_color(&orphan->rb, &c->orph_tree);
602 list_add_tail(&orphan->list, &c->orph_list);
604 orphan->dnext = c->orph_dnext;
605 c->orph_dnext = orphan;
606 dbg_mnt("ino %lu, new %d, tot %d", (unsigned long)inum,
607 c->new_orphans, c->tot_orphans);
612 * do_kill_orphans - remove orphan inodes from the index.
613 * @c: UBIFS file-system description object
615 * @last_cmt_no: cmt_no of last orphan node read is passed and returned here
616 * @outofdate: whether the LEB is out of date is returned here
617 * @last_flagged: whether the end orphan node is encountered
619 * This function is a helper to the 'kill_orphans()' function. It goes through
620 * every orphan node in a LEB and for every inode number recorded, removes
621 * all keys for that inode from the TNC.
623 static int do_kill_orphans(struct ubifs_info *c, struct ubifs_scan_leb *sleb,
624 unsigned long long *last_cmt_no, int *outofdate,
627 struct ubifs_scan_node *snod;
628 struct ubifs_orph_node *orph;
629 struct ubifs_ino_node *ino = NULL;
630 unsigned long long cmt_no;
632 int i, n, err, first = 1;
634 list_for_each_entry(snod, &sleb->nodes, list) {
635 if (snod->type != UBIFS_ORPH_NODE) {
636 ubifs_err(c, "invalid node type %d in orphan area at %d:%d",
637 snod->type, sleb->lnum, snod->offs);
638 ubifs_dump_node(c, snod->node);
644 /* Check commit number */
645 cmt_no = le64_to_cpu(orph->cmt_no) & LLONG_MAX;
647 * The commit number on the master node may be less, because
648 * of a failed commit. If there are several failed commits in a
649 * row, the commit number written on orphan nodes will continue
650 * to increase (because the commit number is adjusted here) even
651 * though the commit number on the master node stays the same
652 * because the master node has not been re-written.
654 if (cmt_no > c->cmt_no)
656 if (cmt_no < *last_cmt_no && *last_flagged) {
658 * The last orphan node had a higher commit number and
659 * was flagged as the last written for that commit
660 * number. That makes this orphan node, out of date.
663 ubifs_err(c, "out of order commit number %llu in orphan node at %d:%d",
664 cmt_no, sleb->lnum, snod->offs);
665 ubifs_dump_node(c, snod->node);
668 dbg_rcvry("out of date LEB %d", sleb->lnum);
676 ino = kmalloc(UBIFS_MAX_INO_NODE_SZ, GFP_NOFS);
680 n = (le32_to_cpu(orph->ch.len) - UBIFS_ORPH_NODE_SZ) >> 3;
681 for (i = 0; i < n; i++) {
682 union ubifs_key key1, key2;
684 inum = le64_to_cpu(orph->inos[i]);
686 ino_key_init(c, &key1, inum);
687 err = ubifs_tnc_lookup(c, &key1, ino);
692 * Check whether an inode can really get deleted.
693 * linkat() with O_TMPFILE allows rebirth of an inode.
695 if (ino->nlink == 0) {
696 dbg_rcvry("deleting orphaned inode %lu",
697 (unsigned long)inum);
699 lowest_ino_key(c, &key1, inum);
700 highest_ino_key(c, &key2, inum);
702 err = ubifs_tnc_remove_range(c, &key1, &key2);
707 err = insert_dead_orphan(c, inum);
712 *last_cmt_no = cmt_no;
713 if (le64_to_cpu(orph->cmt_no) & (1ULL << 63)) {
714 dbg_rcvry("last orph node for commit %llu at %d:%d",
715 cmt_no, sleb->lnum, snod->offs);
727 ubifs_ro_mode(c, err);
733 * kill_orphans - remove all orphan inodes from the index.
734 * @c: UBIFS file-system description object
736 * If recovery is required, then orphan inodes recorded during the previous
737 * session (which ended with an unclean unmount) must be deleted from the index.
738 * This is done by updating the TNC, but since the index is not updated until
739 * the next commit, the LEBs where the orphan information is recorded are not
740 * erased until the next commit.
742 static int kill_orphans(struct ubifs_info *c)
744 unsigned long long last_cmt_no = 0;
745 int lnum, err = 0, outofdate = 0, last_flagged = 0;
747 c->ohead_lnum = c->orph_first;
749 /* Check no-orphans flag and skip this if no orphans */
751 dbg_rcvry("no orphans");
755 * Orph nodes always start at c->orph_first and are written to each
756 * successive LEB in turn. Generally unused LEBs will have been unmapped
757 * but may contain out of date orphan nodes if the unmap didn't go
758 * through. In addition, the last orphan node written for each commit is
759 * marked (top bit of orph->cmt_no is set to 1). It is possible that
760 * there are orphan nodes from the next commit (i.e. the commit did not
761 * complete successfully). In that case, no orphans will have been lost
762 * due to the way that orphans are written, and any orphans added will
763 * be valid orphans anyway and so can be deleted.
765 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) {
766 struct ubifs_scan_leb *sleb;
768 dbg_rcvry("LEB %d", lnum);
769 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1);
771 if (PTR_ERR(sleb) == -EUCLEAN)
772 sleb = ubifs_recover_leb(c, lnum, 0,
779 err = do_kill_orphans(c, sleb, &last_cmt_no, &outofdate,
781 if (err || outofdate) {
782 ubifs_scan_destroy(sleb);
786 c->ohead_lnum = lnum;
787 c->ohead_offs = sleb->endpt;
789 ubifs_scan_destroy(sleb);
795 * ubifs_mount_orphans - delete orphan inodes and erase LEBs that recorded them.
796 * @c: UBIFS file-system description object
797 * @unclean: indicates recovery from unclean unmount
798 * @read_only: indicates read only mount
800 * This function is called when mounting to erase orphans from the previous
801 * session. If UBIFS was not unmounted cleanly, then the inodes recorded as
802 * orphans are deleted.
804 int ubifs_mount_orphans(struct ubifs_info *c, int unclean, int read_only)
808 c->max_orphans = tot_avail_orphs(c);
811 c->orph_buf = vmalloc(c->leb_size);
817 err = kill_orphans(c);
819 err = ubifs_clear_orphans(c);
825 * Everything below is related to debugging.
828 struct check_orphan {
834 unsigned long last_ino;
835 unsigned long tot_inos;
836 unsigned long missing;
837 unsigned long long leaf_cnt;
838 struct ubifs_ino_node *node;
842 static bool dbg_find_orphan(struct ubifs_info *c, ino_t inum)
846 spin_lock(&c->orphan_lock);
847 found = !!lookup_orphan(c, inum);
848 spin_unlock(&c->orphan_lock);
853 static int dbg_ins_check_orphan(struct rb_root *root, ino_t inum)
855 struct check_orphan *orphan, *o;
856 struct rb_node **p, *parent = NULL;
858 orphan = kzalloc(sizeof(struct check_orphan), GFP_NOFS);
866 o = rb_entry(parent, struct check_orphan, rb);
869 else if (inum > o->inum)
876 rb_link_node(&orphan->rb, parent, p);
877 rb_insert_color(&orphan->rb, root);
881 static int dbg_find_check_orphan(struct rb_root *root, ino_t inum)
883 struct check_orphan *o;
888 o = rb_entry(p, struct check_orphan, rb);
891 else if (inum > o->inum)
899 static void dbg_free_check_tree(struct rb_root *root)
901 struct check_orphan *o, *n;
903 rbtree_postorder_for_each_entry_safe(o, n, root, rb)
907 static int dbg_orphan_check(struct ubifs_info *c, struct ubifs_zbranch *zbr,
910 struct check_info *ci = priv;
914 inum = key_inum(c, &zbr->key);
915 if (inum != ci->last_ino) {
916 /* Lowest node type is the inode node, so it comes first */
917 if (key_type(c, &zbr->key) != UBIFS_INO_KEY)
918 ubifs_err(c, "found orphan node ino %lu, type %d",
919 (unsigned long)inum, key_type(c, &zbr->key));
922 err = ubifs_tnc_read_node(c, zbr, ci->node);
924 ubifs_err(c, "node read failed, error %d", err);
927 if (ci->node->nlink == 0)
928 /* Must be recorded as an orphan */
929 if (!dbg_find_check_orphan(&ci->root, inum) &&
930 !dbg_find_orphan(c, inum)) {
931 ubifs_err(c, "missing orphan, ino %lu",
932 (unsigned long)inum);
940 static int dbg_read_orphans(struct check_info *ci, struct ubifs_scan_leb *sleb)
942 struct ubifs_scan_node *snod;
943 struct ubifs_orph_node *orph;
947 list_for_each_entry(snod, &sleb->nodes, list) {
949 if (snod->type != UBIFS_ORPH_NODE)
952 n = (le32_to_cpu(orph->ch.len) - UBIFS_ORPH_NODE_SZ) >> 3;
953 for (i = 0; i < n; i++) {
954 inum = le64_to_cpu(orph->inos[i]);
955 err = dbg_ins_check_orphan(&ci->root, inum);
963 static int dbg_scan_orphans(struct ubifs_info *c, struct check_info *ci)
968 /* Check no-orphans flag and skip this if no orphans */
972 buf = __vmalloc(c->leb_size, GFP_NOFS, PAGE_KERNEL);
974 ubifs_err(c, "cannot allocate memory to check orphans");
978 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) {
979 struct ubifs_scan_leb *sleb;
981 sleb = ubifs_scan(c, lnum, 0, buf, 0);
987 err = dbg_read_orphans(ci, sleb);
988 ubifs_scan_destroy(sleb);
997 static int dbg_check_orphans(struct ubifs_info *c)
999 struct check_info ci;
1002 if (!dbg_is_chk_orph(c))
1010 ci.node = kmalloc(UBIFS_MAX_INO_NODE_SZ, GFP_NOFS);
1012 ubifs_err(c, "out of memory");
1016 err = dbg_scan_orphans(c, &ci);
1020 err = dbg_walk_index(c, &dbg_orphan_check, NULL, &ci);
1022 ubifs_err(c, "cannot scan TNC, error %d", err);
1027 ubifs_err(c, "%lu missing orphan(s)", ci.missing);
1032 dbg_cmt("last inode number is %lu", ci.last_ino);
1033 dbg_cmt("total number of inodes is %lu", ci.tot_inos);
1034 dbg_cmt("total number of leaf nodes is %llu", ci.leaf_cnt);
1037 dbg_free_check_tree(&ci.root);