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, ino_t inum)
131 struct ubifs_orphan *orph, *child_orph, *tmp_o;
133 spin_lock(&c->orphan_lock);
135 orph = lookup_orphan(c, inum);
137 spin_unlock(&c->orphan_lock);
138 ubifs_err(c, "missing orphan ino %lu", (unsigned long)inum);
145 spin_unlock(&c->orphan_lock);
146 dbg_gen("deleted twice ino %lu",
147 (unsigned long)inum);
153 orph->dnext = c->orph_dnext;
154 c->orph_dnext = orph;
155 spin_unlock(&c->orphan_lock);
156 dbg_gen("delete later ino %lu",
157 (unsigned long)inum);
161 list_for_each_entry_safe(child_orph, tmp_o, &orph->child_list, child_list) {
162 list_del(&child_orph->child_list);
163 __orphan_drop(c, child_orph);
166 __orphan_drop(c, orph);
168 spin_unlock(&c->orphan_lock);
172 * ubifs_add_orphan - add an orphan.
173 * @c: UBIFS file-system description object
174 * @inum: orphan inode number
176 * Add an orphan. This function is called when an inodes link count drops to
179 int ubifs_add_orphan(struct ubifs_info *c, ino_t inum)
184 struct ubifs_dent_node *xent;
185 struct fscrypt_name nm = {0};
186 struct ubifs_orphan *xattr_orphan;
187 struct ubifs_orphan *orphan;
189 orphan = orphan_add(c, inum, NULL);
191 return PTR_ERR(orphan);
193 lowest_xent_key(c, &key, inum);
195 xent = ubifs_tnc_next_ent(c, &key, &nm);
203 fname_name(&nm) = xent->name;
204 fname_len(&nm) = le16_to_cpu(xent->nlen);
205 xattr_inum = le64_to_cpu(xent->inum);
207 xattr_orphan = orphan_add(c, xattr_inum, orphan);
208 if (IS_ERR(xattr_orphan))
209 return PTR_ERR(xattr_orphan);
211 key_read(c, &xent->key, &key);
218 * ubifs_delete_orphan - delete an orphan.
219 * @c: UBIFS file-system description object
220 * @inum: orphan inode number
222 * Delete an orphan. This function is called when an inode is deleted.
224 void ubifs_delete_orphan(struct ubifs_info *c, ino_t inum)
226 orphan_delete(c, inum);
230 * ubifs_orphan_start_commit - start commit of orphans.
231 * @c: UBIFS file-system description object
233 * Start commit of orphans.
235 int ubifs_orphan_start_commit(struct ubifs_info *c)
237 struct ubifs_orphan *orphan, **last;
239 spin_lock(&c->orphan_lock);
240 last = &c->orph_cnext;
241 list_for_each_entry(orphan, &c->orph_new, new_list) {
242 ubifs_assert(c, orphan->new);
243 ubifs_assert(c, !orphan->cmt);
247 last = &orphan->cnext;
250 c->cmt_orphans = c->new_orphans;
252 dbg_cmt("%d orphans to commit", c->cmt_orphans);
253 INIT_LIST_HEAD(&c->orph_new);
254 if (c->tot_orphans == 0)
258 spin_unlock(&c->orphan_lock);
263 * avail_orphs - calculate available space.
264 * @c: UBIFS file-system description object
266 * This function returns the number of orphans that can be written in the
269 static int avail_orphs(struct ubifs_info *c)
271 int avail_lebs, avail, gap;
273 avail_lebs = c->orph_lebs - (c->ohead_lnum - c->orph_first) - 1;
275 ((c->leb_size - UBIFS_ORPH_NODE_SZ) / sizeof(__le64));
276 gap = c->leb_size - c->ohead_offs;
277 if (gap >= UBIFS_ORPH_NODE_SZ + sizeof(__le64))
278 avail += (gap - UBIFS_ORPH_NODE_SZ) / sizeof(__le64);
283 * tot_avail_orphs - calculate total space.
284 * @c: UBIFS file-system description object
286 * This function returns the number of orphans that can be written in half
287 * the total space. That leaves half the space for adding new orphans.
289 static int tot_avail_orphs(struct ubifs_info *c)
291 int avail_lebs, avail;
293 avail_lebs = c->orph_lebs;
295 ((c->leb_size - UBIFS_ORPH_NODE_SZ) / sizeof(__le64));
300 * do_write_orph_node - write a node to the orphan head.
301 * @c: UBIFS file-system description object
302 * @len: length of node
303 * @atomic: write atomically
305 * This function writes a node to the orphan head from the orphan buffer. If
306 * %atomic is not zero, then the write is done atomically. On success, %0 is
307 * returned, otherwise a negative error code is returned.
309 static int do_write_orph_node(struct ubifs_info *c, int len, int atomic)
314 ubifs_assert(c, c->ohead_offs == 0);
315 ubifs_prepare_node(c, c->orph_buf, len, 1);
316 len = ALIGN(len, c->min_io_size);
317 err = ubifs_leb_change(c, c->ohead_lnum, c->orph_buf, len);
319 if (c->ohead_offs == 0) {
320 /* Ensure LEB has been unmapped */
321 err = ubifs_leb_unmap(c, c->ohead_lnum);
325 err = ubifs_write_node(c, c->orph_buf, len, c->ohead_lnum,
332 * write_orph_node - write an orphan node.
333 * @c: UBIFS file-system description object
334 * @atomic: write atomically
336 * This function builds an orphan node from the cnext list and writes it to the
337 * orphan head. On success, %0 is returned, otherwise a negative error code
340 static int write_orph_node(struct ubifs_info *c, int atomic)
342 struct ubifs_orphan *orphan, *cnext;
343 struct ubifs_orph_node *orph;
344 int gap, err, len, cnt, i;
346 ubifs_assert(c, c->cmt_orphans > 0);
347 gap = c->leb_size - c->ohead_offs;
348 if (gap < UBIFS_ORPH_NODE_SZ + sizeof(__le64)) {
352 if (c->ohead_lnum > c->orph_last) {
354 * We limit the number of orphans so that this should
357 ubifs_err(c, "out of space in orphan area");
361 cnt = (gap - UBIFS_ORPH_NODE_SZ) / sizeof(__le64);
362 if (cnt > c->cmt_orphans)
363 cnt = c->cmt_orphans;
364 len = UBIFS_ORPH_NODE_SZ + cnt * sizeof(__le64);
365 ubifs_assert(c, c->orph_buf);
367 orph->ch.node_type = UBIFS_ORPH_NODE;
368 spin_lock(&c->orphan_lock);
369 cnext = c->orph_cnext;
370 for (i = 0; i < cnt; i++) {
372 ubifs_assert(c, orphan->cmt);
373 orph->inos[i] = cpu_to_le64(orphan->inum);
375 cnext = orphan->cnext;
376 orphan->cnext = NULL;
378 c->orph_cnext = cnext;
379 c->cmt_orphans -= cnt;
380 spin_unlock(&c->orphan_lock);
382 orph->cmt_no = cpu_to_le64(c->cmt_no);
384 /* Mark the last node of the commit */
385 orph->cmt_no = cpu_to_le64((c->cmt_no) | (1ULL << 63));
386 ubifs_assert(c, c->ohead_offs + len <= c->leb_size);
387 ubifs_assert(c, c->ohead_lnum >= c->orph_first);
388 ubifs_assert(c, c->ohead_lnum <= c->orph_last);
389 err = do_write_orph_node(c, len, atomic);
390 c->ohead_offs += ALIGN(len, c->min_io_size);
391 c->ohead_offs = ALIGN(c->ohead_offs, 8);
396 * write_orph_nodes - write orphan nodes until there are no more to commit.
397 * @c: UBIFS file-system description object
398 * @atomic: write atomically
400 * This function writes orphan nodes for all the orphans to commit. On success,
401 * %0 is returned, otherwise a negative error code is returned.
403 static int write_orph_nodes(struct ubifs_info *c, int atomic)
407 while (c->cmt_orphans > 0) {
408 err = write_orph_node(c, atomic);
415 /* Unmap any unused LEBs after consolidation */
416 for (lnum = c->ohead_lnum + 1; lnum <= c->orph_last; lnum++) {
417 err = ubifs_leb_unmap(c, lnum);
426 * consolidate - consolidate the orphan area.
427 * @c: UBIFS file-system description object
429 * This function enables consolidation by putting all the orphans into the list
430 * to commit. The list is in the order that the orphans were added, and the
431 * LEBs are written atomically in order, so at no time can orphans be lost by
432 * an unclean unmount.
434 * This function returns %0 on success and a negative error code on failure.
436 static int consolidate(struct ubifs_info *c)
438 int tot_avail = tot_avail_orphs(c), err = 0;
440 spin_lock(&c->orphan_lock);
441 dbg_cmt("there is space for %d orphans and there are %d",
442 tot_avail, c->tot_orphans);
443 if (c->tot_orphans - c->new_orphans <= tot_avail) {
444 struct ubifs_orphan *orphan, **last;
447 /* Change the cnext list to include all non-new orphans */
448 last = &c->orph_cnext;
449 list_for_each_entry(orphan, &c->orph_list, list) {
454 last = &orphan->cnext;
458 ubifs_assert(c, cnt == c->tot_orphans - c->new_orphans);
459 c->cmt_orphans = cnt;
460 c->ohead_lnum = c->orph_first;
464 * We limit the number of orphans so that this should
467 ubifs_err(c, "out of space in orphan area");
470 spin_unlock(&c->orphan_lock);
475 * commit_orphans - commit orphans.
476 * @c: UBIFS file-system description object
478 * This function commits orphans to flash. On success, %0 is returned,
479 * otherwise a negative error code is returned.
481 static int commit_orphans(struct ubifs_info *c)
483 int avail, atomic = 0, err;
485 ubifs_assert(c, c->cmt_orphans > 0);
486 avail = avail_orphs(c);
487 if (avail < c->cmt_orphans) {
488 /* Not enough space to write new orphans, so consolidate */
489 err = consolidate(c);
494 err = write_orph_nodes(c, atomic);
499 * erase_deleted - erase the orphans marked for deletion.
500 * @c: UBIFS file-system description object
502 * During commit, the orphans being committed cannot be deleted, so they are
503 * marked for deletion and deleted by this function. Also, the recovery
504 * adds killed orphans to the deletion list, and therefore they are deleted
507 static void erase_deleted(struct ubifs_info *c)
509 struct ubifs_orphan *orphan, *dnext;
511 spin_lock(&c->orphan_lock);
512 dnext = c->orph_dnext;
515 dnext = orphan->dnext;
516 ubifs_assert(c, !orphan->new);
517 ubifs_assert(c, orphan->del);
518 rb_erase(&orphan->rb, &c->orph_tree);
519 list_del(&orphan->list);
521 dbg_gen("deleting orphan ino %lu", (unsigned long)orphan->inum);
524 c->orph_dnext = NULL;
525 spin_unlock(&c->orphan_lock);
529 * ubifs_orphan_end_commit - end commit of orphans.
530 * @c: UBIFS file-system description object
532 * End commit of orphans.
534 int ubifs_orphan_end_commit(struct ubifs_info *c)
538 if (c->cmt_orphans != 0) {
539 err = commit_orphans(c);
544 err = dbg_check_orphans(c);
549 * ubifs_clear_orphans - erase all LEBs used for orphans.
550 * @c: UBIFS file-system description object
552 * If recovery is not required, then the orphans from the previous session
553 * are not needed. This function locates the LEBs used to record
554 * orphans, and un-maps them.
556 int ubifs_clear_orphans(struct ubifs_info *c)
560 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) {
561 err = ubifs_leb_unmap(c, lnum);
565 c->ohead_lnum = c->orph_first;
571 * insert_dead_orphan - insert an orphan.
572 * @c: UBIFS file-system description object
573 * @inum: orphan inode number
575 * This function is a helper to the 'do_kill_orphans()' function. The orphan
576 * must be kept until the next commit, so it is added to the rb-tree and the
579 static int insert_dead_orphan(struct ubifs_info *c, ino_t inum)
581 struct ubifs_orphan *orphan, *o;
582 struct rb_node **p, *parent = NULL;
584 orphan = kzalloc(sizeof(struct ubifs_orphan), GFP_KERNEL);
589 p = &c->orph_tree.rb_node;
592 o = rb_entry(parent, struct ubifs_orphan, rb);
595 else if (inum > o->inum)
598 /* Already added - no problem */
604 rb_link_node(&orphan->rb, parent, p);
605 rb_insert_color(&orphan->rb, &c->orph_tree);
606 list_add_tail(&orphan->list, &c->orph_list);
608 orphan->dnext = c->orph_dnext;
609 c->orph_dnext = orphan;
610 dbg_mnt("ino %lu, new %d, tot %d", (unsigned long)inum,
611 c->new_orphans, c->tot_orphans);
616 * do_kill_orphans - remove orphan inodes from the index.
617 * @c: UBIFS file-system description object
619 * @last_cmt_no: cmt_no of last orphan node read is passed and returned here
620 * @outofdate: whether the LEB is out of date is returned here
621 * @last_flagged: whether the end orphan node is encountered
623 * This function is a helper to the 'kill_orphans()' function. It goes through
624 * every orphan node in a LEB and for every inode number recorded, removes
625 * all keys for that inode from the TNC.
627 static int do_kill_orphans(struct ubifs_info *c, struct ubifs_scan_leb *sleb,
628 unsigned long long *last_cmt_no, int *outofdate,
631 struct ubifs_scan_node *snod;
632 struct ubifs_orph_node *orph;
633 struct ubifs_ino_node *ino = NULL;
634 unsigned long long cmt_no;
636 int i, n, err, first = 1;
638 list_for_each_entry(snod, &sleb->nodes, list) {
639 if (snod->type != UBIFS_ORPH_NODE) {
640 ubifs_err(c, "invalid node type %d in orphan area at %d:%d",
641 snod->type, sleb->lnum, snod->offs);
642 ubifs_dump_node(c, snod->node);
648 /* Check commit number */
649 cmt_no = le64_to_cpu(orph->cmt_no) & LLONG_MAX;
651 * The commit number on the master node may be less, because
652 * of a failed commit. If there are several failed commits in a
653 * row, the commit number written on orphan nodes will continue
654 * to increase (because the commit number is adjusted here) even
655 * though the commit number on the master node stays the same
656 * because the master node has not been re-written.
658 if (cmt_no > c->cmt_no)
660 if (cmt_no < *last_cmt_no && *last_flagged) {
662 * The last orphan node had a higher commit number and
663 * was flagged as the last written for that commit
664 * number. That makes this orphan node, out of date.
667 ubifs_err(c, "out of order commit number %llu in orphan node at %d:%d",
668 cmt_no, sleb->lnum, snod->offs);
669 ubifs_dump_node(c, snod->node);
672 dbg_rcvry("out of date LEB %d", sleb->lnum);
680 ino = kmalloc(UBIFS_MAX_INO_NODE_SZ, GFP_NOFS);
684 n = (le32_to_cpu(orph->ch.len) - UBIFS_ORPH_NODE_SZ) >> 3;
685 for (i = 0; i < n; i++) {
686 union ubifs_key key1, key2;
688 inum = le64_to_cpu(orph->inos[i]);
690 ino_key_init(c, &key1, inum);
691 err = ubifs_tnc_lookup(c, &key1, ino);
696 * Check whether an inode can really get deleted.
697 * linkat() with O_TMPFILE allows rebirth of an inode.
699 if (ino->nlink == 0) {
700 dbg_rcvry("deleting orphaned inode %lu",
701 (unsigned long)inum);
703 lowest_ino_key(c, &key1, inum);
704 highest_ino_key(c, &key2, inum);
706 err = ubifs_tnc_remove_range(c, &key1, &key2);
711 err = insert_dead_orphan(c, inum);
716 *last_cmt_no = cmt_no;
717 if (le64_to_cpu(orph->cmt_no) & (1ULL << 63)) {
718 dbg_rcvry("last orph node for commit %llu at %d:%d",
719 cmt_no, sleb->lnum, snod->offs);
731 ubifs_ro_mode(c, err);
737 * kill_orphans - remove all orphan inodes from the index.
738 * @c: UBIFS file-system description object
740 * If recovery is required, then orphan inodes recorded during the previous
741 * session (which ended with an unclean unmount) must be deleted from the index.
742 * This is done by updating the TNC, but since the index is not updated until
743 * the next commit, the LEBs where the orphan information is recorded are not
744 * erased until the next commit.
746 static int kill_orphans(struct ubifs_info *c)
748 unsigned long long last_cmt_no = 0;
749 int lnum, err = 0, outofdate = 0, last_flagged = 0;
751 c->ohead_lnum = c->orph_first;
753 /* Check no-orphans flag and skip this if no orphans */
755 dbg_rcvry("no orphans");
759 * Orph nodes always start at c->orph_first and are written to each
760 * successive LEB in turn. Generally unused LEBs will have been unmapped
761 * but may contain out of date orphan nodes if the unmap didn't go
762 * through. In addition, the last orphan node written for each commit is
763 * marked (top bit of orph->cmt_no is set to 1). It is possible that
764 * there are orphan nodes from the next commit (i.e. the commit did not
765 * complete successfully). In that case, no orphans will have been lost
766 * due to the way that orphans are written, and any orphans added will
767 * be valid orphans anyway and so can be deleted.
769 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) {
770 struct ubifs_scan_leb *sleb;
772 dbg_rcvry("LEB %d", lnum);
773 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1);
775 if (PTR_ERR(sleb) == -EUCLEAN)
776 sleb = ubifs_recover_leb(c, lnum, 0,
783 err = do_kill_orphans(c, sleb, &last_cmt_no, &outofdate,
785 if (err || outofdate) {
786 ubifs_scan_destroy(sleb);
790 c->ohead_lnum = lnum;
791 c->ohead_offs = sleb->endpt;
793 ubifs_scan_destroy(sleb);
799 * ubifs_mount_orphans - delete orphan inodes and erase LEBs that recorded them.
800 * @c: UBIFS file-system description object
801 * @unclean: indicates recovery from unclean unmount
802 * @read_only: indicates read only mount
804 * This function is called when mounting to erase orphans from the previous
805 * session. If UBIFS was not unmounted cleanly, then the inodes recorded as
806 * orphans are deleted.
808 int ubifs_mount_orphans(struct ubifs_info *c, int unclean, int read_only)
812 c->max_orphans = tot_avail_orphs(c);
815 c->orph_buf = vmalloc(c->leb_size);
821 err = kill_orphans(c);
823 err = ubifs_clear_orphans(c);
829 * Everything below is related to debugging.
832 struct check_orphan {
838 unsigned long last_ino;
839 unsigned long tot_inos;
840 unsigned long missing;
841 unsigned long long leaf_cnt;
842 struct ubifs_ino_node *node;
846 static bool dbg_find_orphan(struct ubifs_info *c, ino_t inum)
850 spin_lock(&c->orphan_lock);
851 found = !!lookup_orphan(c, inum);
852 spin_unlock(&c->orphan_lock);
857 static int dbg_ins_check_orphan(struct rb_root *root, ino_t inum)
859 struct check_orphan *orphan, *o;
860 struct rb_node **p, *parent = NULL;
862 orphan = kzalloc(sizeof(struct check_orphan), GFP_NOFS);
870 o = rb_entry(parent, struct check_orphan, rb);
873 else if (inum > o->inum)
880 rb_link_node(&orphan->rb, parent, p);
881 rb_insert_color(&orphan->rb, root);
885 static int dbg_find_check_orphan(struct rb_root *root, ino_t inum)
887 struct check_orphan *o;
892 o = rb_entry(p, struct check_orphan, rb);
895 else if (inum > o->inum)
903 static void dbg_free_check_tree(struct rb_root *root)
905 struct check_orphan *o, *n;
907 rbtree_postorder_for_each_entry_safe(o, n, root, rb)
911 static int dbg_orphan_check(struct ubifs_info *c, struct ubifs_zbranch *zbr,
914 struct check_info *ci = priv;
918 inum = key_inum(c, &zbr->key);
919 if (inum != ci->last_ino) {
920 /* Lowest node type is the inode node, so it comes first */
921 if (key_type(c, &zbr->key) != UBIFS_INO_KEY)
922 ubifs_err(c, "found orphan node ino %lu, type %d",
923 (unsigned long)inum, key_type(c, &zbr->key));
926 err = ubifs_tnc_read_node(c, zbr, ci->node);
928 ubifs_err(c, "node read failed, error %d", err);
931 if (ci->node->nlink == 0)
932 /* Must be recorded as an orphan */
933 if (!dbg_find_check_orphan(&ci->root, inum) &&
934 !dbg_find_orphan(c, inum)) {
935 ubifs_err(c, "missing orphan, ino %lu",
936 (unsigned long)inum);
944 static int dbg_read_orphans(struct check_info *ci, struct ubifs_scan_leb *sleb)
946 struct ubifs_scan_node *snod;
947 struct ubifs_orph_node *orph;
951 list_for_each_entry(snod, &sleb->nodes, list) {
953 if (snod->type != UBIFS_ORPH_NODE)
956 n = (le32_to_cpu(orph->ch.len) - UBIFS_ORPH_NODE_SZ) >> 3;
957 for (i = 0; i < n; i++) {
958 inum = le64_to_cpu(orph->inos[i]);
959 err = dbg_ins_check_orphan(&ci->root, inum);
967 static int dbg_scan_orphans(struct ubifs_info *c, struct check_info *ci)
972 /* Check no-orphans flag and skip this if no orphans */
976 buf = __vmalloc(c->leb_size, GFP_NOFS, PAGE_KERNEL);
978 ubifs_err(c, "cannot allocate memory to check orphans");
982 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) {
983 struct ubifs_scan_leb *sleb;
985 sleb = ubifs_scan(c, lnum, 0, buf, 0);
991 err = dbg_read_orphans(ci, sleb);
992 ubifs_scan_destroy(sleb);
1001 static int dbg_check_orphans(struct ubifs_info *c)
1003 struct check_info ci;
1006 if (!dbg_is_chk_orph(c))
1014 ci.node = kmalloc(UBIFS_MAX_INO_NODE_SZ, GFP_NOFS);
1016 ubifs_err(c, "out of memory");
1020 err = dbg_scan_orphans(c, &ci);
1024 err = dbg_walk_index(c, &dbg_orphan_check, NULL, &ci);
1026 ubifs_err(c, "cannot scan TNC, error %d", err);
1031 ubifs_err(c, "%lu missing orphan(s)", ci.missing);
1036 dbg_cmt("last inode number is %lu", ci.last_ino);
1037 dbg_cmt("total number of inodes is %lu", ci.tot_inos);
1038 dbg_cmt("total number of leaf nodes is %llu", ci.leaf_cnt);
1041 dbg_free_check_tree(&ci.root);