2 * This file is part of UBIFS.
4 * Copyright (C) 2006-2008 Nokia Corporation.
6 * This program is free software; you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License version 2 as published by
8 * the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
15 * You should have received a copy of the GNU General Public License along with
16 * this program; if not, write to the Free Software Foundation, Inc., 51
17 * Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
19 * Author: Adrian Hunter
25 * An orphan is an inode number whose inode node has been committed to the index
26 * with a link count of zero. That happens when an open file is deleted
27 * (unlinked) and then a commit is run. In the normal course of events the inode
28 * would be deleted when the file is closed. However in the case of an unclean
29 * unmount, orphans need to be accounted for. After an unclean unmount, the
30 * orphans' inodes must be deleted which means either scanning the entire index
31 * looking for them, or keeping a list on flash somewhere. This unit implements
32 * the latter approach.
34 * The orphan area is a fixed number of LEBs situated between the LPT area and
35 * the main area. The number of orphan area LEBs is specified when the file
36 * system is created. The minimum number is 1. The size of the orphan area
37 * should be so that it can hold the maximum number of orphans that are expected
38 * to ever exist at one time.
40 * The number of orphans that can fit in a LEB is:
42 * (c->leb_size - UBIFS_ORPH_NODE_SZ) / sizeof(__le64)
44 * For example: a 15872 byte LEB can fit 1980 orphans so 1 LEB may be enough.
46 * Orphans are accumulated in a rb-tree. When an inode's link count drops to
47 * zero, the inode number is added to the rb-tree. It is removed from the tree
48 * when the inode is deleted. Any new orphans that are in the orphan tree when
49 * the commit is run, are written to the orphan area in 1 or more orphan nodes.
50 * If the orphan area is full, it is consolidated to make space. There is
51 * always enough space because validation prevents the user from creating more
52 * than the maximum number of orphans allowed.
55 #ifdef CONFIG_UBIFS_FS_DEBUG
56 static int dbg_check_orphans(struct ubifs_info *c);
58 #define dbg_check_orphans(c) 0
62 * ubifs_add_orphan - add an orphan.
63 * @c: UBIFS file-system description object
64 * @inum: orphan inode number
66 * Add an orphan. This function is called when an inodes link count drops to
69 int ubifs_add_orphan(struct ubifs_info *c, ino_t inum)
71 struct ubifs_orphan *orphan, *o;
72 struct rb_node **p, *parent = NULL;
74 orphan = kzalloc(sizeof(struct ubifs_orphan), GFP_NOFS);
80 spin_lock(&c->orphan_lock);
81 if (c->tot_orphans >= c->max_orphans) {
82 spin_unlock(&c->orphan_lock);
86 p = &c->orph_tree.rb_node;
89 o = rb_entry(parent, struct ubifs_orphan, rb);
92 else if (inum > o->inum)
95 dbg_err("orphaned twice");
96 spin_unlock(&c->orphan_lock);
103 rb_link_node(&orphan->rb, parent, p);
104 rb_insert_color(&orphan->rb, &c->orph_tree);
105 list_add_tail(&orphan->list, &c->orph_list);
106 list_add_tail(&orphan->new_list, &c->orph_new);
107 spin_unlock(&c->orphan_lock);
108 dbg_gen("ino %lu", (unsigned long)inum);
113 * ubifs_delete_orphan - delete an orphan.
114 * @c: UBIFS file-system description object
115 * @inum: orphan inode number
117 * Delete an orphan. This function is called when an inode is deleted.
119 void ubifs_delete_orphan(struct ubifs_info *c, ino_t inum)
121 struct ubifs_orphan *o;
124 spin_lock(&c->orphan_lock);
125 p = c->orph_tree.rb_node;
127 o = rb_entry(p, struct ubifs_orphan, rb);
130 else if (inum > o->inum)
134 spin_unlock(&c->orphan_lock);
135 dbg_gen("deleted twice ino %lu",
136 (unsigned long)inum);
141 o->dnext = c->orph_dnext;
143 spin_unlock(&c->orphan_lock);
144 dbg_gen("delete later ino %lu",
145 (unsigned long)inum);
148 rb_erase(p, &c->orph_tree);
152 list_del(&o->new_list);
155 spin_unlock(&c->orphan_lock);
157 dbg_gen("inum %lu", (unsigned long)inum);
161 spin_unlock(&c->orphan_lock);
162 dbg_err("missing orphan ino %lu", (unsigned long)inum);
167 * ubifs_orphan_start_commit - start commit of orphans.
168 * @c: UBIFS file-system description object
170 * Start commit of orphans.
172 int ubifs_orphan_start_commit(struct ubifs_info *c)
174 struct ubifs_orphan *orphan, **last;
176 spin_lock(&c->orphan_lock);
177 last = &c->orph_cnext;
178 list_for_each_entry(orphan, &c->orph_new, new_list) {
179 ubifs_assert(orphan->new);
182 last = &orphan->cnext;
184 *last = orphan->cnext;
185 c->cmt_orphans = c->new_orphans;
187 dbg_cmt("%d orphans to commit", c->cmt_orphans);
188 INIT_LIST_HEAD(&c->orph_new);
189 if (c->tot_orphans == 0)
193 spin_unlock(&c->orphan_lock);
198 * avail_orphs - calculate available space.
199 * @c: UBIFS file-system description object
201 * This function returns the number of orphans that can be written in the
204 static int avail_orphs(struct ubifs_info *c)
206 int avail_lebs, avail, gap;
208 avail_lebs = c->orph_lebs - (c->ohead_lnum - c->orph_first) - 1;
210 ((c->leb_size - UBIFS_ORPH_NODE_SZ) / sizeof(__le64));
211 gap = c->leb_size - c->ohead_offs;
212 if (gap >= UBIFS_ORPH_NODE_SZ + sizeof(__le64))
213 avail += (gap - UBIFS_ORPH_NODE_SZ) / sizeof(__le64);
218 * tot_avail_orphs - calculate total space.
219 * @c: UBIFS file-system description object
221 * This function returns the number of orphans that can be written in half
222 * the total space. That leaves half the space for adding new orphans.
224 static int tot_avail_orphs(struct ubifs_info *c)
226 int avail_lebs, avail;
228 avail_lebs = c->orph_lebs;
230 ((c->leb_size - UBIFS_ORPH_NODE_SZ) / sizeof(__le64));
235 * do_write_orph_node - write a node to the orphan head.
236 * @c: UBIFS file-system description object
237 * @len: length of node
238 * @atomic: write atomically
240 * This function writes a node to the orphan head from the orphan buffer. If
241 * %atomic is not zero, then the write is done atomically. On success, %0 is
242 * returned, otherwise a negative error code is returned.
244 static int do_write_orph_node(struct ubifs_info *c, int len, int atomic)
249 ubifs_assert(c->ohead_offs == 0);
250 ubifs_prepare_node(c, c->orph_buf, len, 1);
251 len = ALIGN(len, c->min_io_size);
252 err = ubifs_leb_change(c, c->ohead_lnum, c->orph_buf, len,
255 if (c->ohead_offs == 0) {
256 /* Ensure LEB has been unmapped */
257 err = ubifs_leb_unmap(c, c->ohead_lnum);
261 err = ubifs_write_node(c, c->orph_buf, len, c->ohead_lnum,
262 c->ohead_offs, UBI_SHORTTERM);
268 * write_orph_node - write an orphan node.
269 * @c: UBIFS file-system description object
270 * @atomic: write atomically
272 * This function builds an orphan node from the cnext list and writes it to the
273 * orphan head. On success, %0 is returned, otherwise a negative error code
276 static int write_orph_node(struct ubifs_info *c, int atomic)
278 struct ubifs_orphan *orphan, *cnext;
279 struct ubifs_orph_node *orph;
280 int gap, err, len, cnt, i;
282 ubifs_assert(c->cmt_orphans > 0);
283 gap = c->leb_size - c->ohead_offs;
284 if (gap < UBIFS_ORPH_NODE_SZ + sizeof(__le64)) {
288 if (c->ohead_lnum > c->orph_last) {
290 * We limit the number of orphans so that this should
293 ubifs_err("out of space in orphan area");
297 cnt = (gap - UBIFS_ORPH_NODE_SZ) / sizeof(__le64);
298 if (cnt > c->cmt_orphans)
299 cnt = c->cmt_orphans;
300 len = UBIFS_ORPH_NODE_SZ + cnt * sizeof(__le64);
301 ubifs_assert(c->orph_buf);
303 orph->ch.node_type = UBIFS_ORPH_NODE;
304 spin_lock(&c->orphan_lock);
305 cnext = c->orph_cnext;
306 for (i = 0; i < cnt; i++) {
308 orph->inos[i] = cpu_to_le64(orphan->inum);
309 cnext = orphan->cnext;
310 orphan->cnext = NULL;
312 c->orph_cnext = cnext;
313 c->cmt_orphans -= cnt;
314 spin_unlock(&c->orphan_lock);
316 orph->cmt_no = cpu_to_le64(c->cmt_no);
318 /* Mark the last node of the commit */
319 orph->cmt_no = cpu_to_le64((c->cmt_no) | (1ULL << 63));
320 ubifs_assert(c->ohead_offs + len <= c->leb_size);
321 ubifs_assert(c->ohead_lnum >= c->orph_first);
322 ubifs_assert(c->ohead_lnum <= c->orph_last);
323 err = do_write_orph_node(c, len, atomic);
324 c->ohead_offs += ALIGN(len, c->min_io_size);
325 c->ohead_offs = ALIGN(c->ohead_offs, 8);
330 * write_orph_nodes - write orphan nodes until there are no more to commit.
331 * @c: UBIFS file-system description object
332 * @atomic: write atomically
334 * This function writes orphan nodes for all the orphans to commit. On success,
335 * %0 is returned, otherwise a negative error code is returned.
337 static int write_orph_nodes(struct ubifs_info *c, int atomic)
341 while (c->cmt_orphans > 0) {
342 err = write_orph_node(c, atomic);
349 /* Unmap any unused LEBs after consolidation */
350 lnum = c->ohead_lnum + 1;
351 for (lnum = c->ohead_lnum + 1; lnum <= c->orph_last; lnum++) {
352 err = ubifs_leb_unmap(c, lnum);
361 * consolidate - consolidate the orphan area.
362 * @c: UBIFS file-system description object
364 * This function enables consolidation by putting all the orphans into the list
365 * to commit. The list is in the order that the orphans were added, and the
366 * LEBs are written atomically in order, so at no time can orphans be lost by
367 * an unclean unmount.
369 * This function returns %0 on success and a negative error code on failure.
371 static int consolidate(struct ubifs_info *c)
373 int tot_avail = tot_avail_orphs(c), err = 0;
375 spin_lock(&c->orphan_lock);
376 dbg_cmt("there is space for %d orphans and there are %d",
377 tot_avail, c->tot_orphans);
378 if (c->tot_orphans - c->new_orphans <= tot_avail) {
379 struct ubifs_orphan *orphan, **last;
382 /* Change the cnext list to include all non-new orphans */
383 last = &c->orph_cnext;
384 list_for_each_entry(orphan, &c->orph_list, list) {
388 last = &orphan->cnext;
391 *last = orphan->cnext;
392 ubifs_assert(cnt == c->tot_orphans - c->new_orphans);
393 c->cmt_orphans = cnt;
394 c->ohead_lnum = c->orph_first;
398 * We limit the number of orphans so that this should
401 ubifs_err("out of space in orphan area");
404 spin_unlock(&c->orphan_lock);
409 * commit_orphans - commit orphans.
410 * @c: UBIFS file-system description object
412 * This function commits orphans to flash. On success, %0 is returned,
413 * otherwise a negative error code is returned.
415 static int commit_orphans(struct ubifs_info *c)
417 int avail, atomic = 0, err;
419 ubifs_assert(c->cmt_orphans > 0);
420 avail = avail_orphs(c);
421 if (avail < c->cmt_orphans) {
422 /* Not enough space to write new orphans, so consolidate */
423 err = consolidate(c);
428 err = write_orph_nodes(c, atomic);
433 * erase_deleted - erase the orphans marked for deletion.
434 * @c: UBIFS file-system description object
436 * During commit, the orphans being committed cannot be deleted, so they are
437 * marked for deletion and deleted by this function. Also, the recovery
438 * adds killed orphans to the deletion list, and therefore they are deleted
441 static void erase_deleted(struct ubifs_info *c)
443 struct ubifs_orphan *orphan, *dnext;
445 spin_lock(&c->orphan_lock);
446 dnext = c->orph_dnext;
449 dnext = orphan->dnext;
450 ubifs_assert(!orphan->new);
451 ubifs_assert(orphan->del);
452 rb_erase(&orphan->rb, &c->orph_tree);
453 list_del(&orphan->list);
455 dbg_gen("deleting orphan ino %lu", (unsigned long)orphan->inum);
458 c->orph_dnext = NULL;
459 spin_unlock(&c->orphan_lock);
463 * ubifs_orphan_end_commit - end commit of orphans.
464 * @c: UBIFS file-system description object
466 * End commit of orphans.
468 int ubifs_orphan_end_commit(struct ubifs_info *c)
472 if (c->cmt_orphans != 0) {
473 err = commit_orphans(c);
478 err = dbg_check_orphans(c);
483 * ubifs_clear_orphans - erase all LEBs used for orphans.
484 * @c: UBIFS file-system description object
486 * If recovery is not required, then the orphans from the previous session
487 * are not needed. This function locates the LEBs used to record
488 * orphans, and un-maps them.
490 int ubifs_clear_orphans(struct ubifs_info *c)
494 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) {
495 err = ubifs_leb_unmap(c, lnum);
499 c->ohead_lnum = c->orph_first;
505 * insert_dead_orphan - insert an orphan.
506 * @c: UBIFS file-system description object
507 * @inum: orphan inode number
509 * This function is a helper to the 'do_kill_orphans()' function. The orphan
510 * must be kept until the next commit, so it is added to the rb-tree and the
513 static int insert_dead_orphan(struct ubifs_info *c, ino_t inum)
515 struct ubifs_orphan *orphan, *o;
516 struct rb_node **p, *parent = NULL;
518 orphan = kzalloc(sizeof(struct ubifs_orphan), GFP_KERNEL);
523 p = &c->orph_tree.rb_node;
526 o = rb_entry(parent, struct ubifs_orphan, rb);
529 else if (inum > o->inum)
532 /* Already added - no problem */
538 rb_link_node(&orphan->rb, parent, p);
539 rb_insert_color(&orphan->rb, &c->orph_tree);
540 list_add_tail(&orphan->list, &c->orph_list);
542 orphan->dnext = c->orph_dnext;
543 c->orph_dnext = orphan;
544 dbg_mnt("ino %lu, new %d, tot %d", (unsigned long)inum,
545 c->new_orphans, c->tot_orphans);
550 * do_kill_orphans - remove orphan inodes from the index.
551 * @c: UBIFS file-system description object
553 * @last_cmt_no: cmt_no of last orphan node read is passed and returned here
554 * @outofdate: whether the LEB is out of date is returned here
555 * @last_flagged: whether the end orphan node is encountered
557 * This function is a helper to the 'kill_orphans()' function. It goes through
558 * every orphan node in a LEB and for every inode number recorded, removes
559 * all keys for that inode from the TNC.
561 static int do_kill_orphans(struct ubifs_info *c, struct ubifs_scan_leb *sleb,
562 unsigned long long *last_cmt_no, int *outofdate,
565 struct ubifs_scan_node *snod;
566 struct ubifs_orph_node *orph;
567 unsigned long long cmt_no;
569 int i, n, err, first = 1;
571 list_for_each_entry(snod, &sleb->nodes, list) {
572 if (snod->type != UBIFS_ORPH_NODE) {
573 ubifs_err("invalid node type %d in orphan area at "
574 "%d:%d", snod->type, sleb->lnum, snod->offs);
575 dbg_dump_node(c, snod->node);
581 /* Check commit number */
582 cmt_no = le64_to_cpu(orph->cmt_no) & LLONG_MAX;
584 * The commit number on the master node may be less, because
585 * of a failed commit. If there are several failed commits in a
586 * row, the commit number written on orphan nodes will continue
587 * to increase (because the commit number is adjusted here) even
588 * though the commit number on the master node stays the same
589 * because the master node has not been re-written.
591 if (cmt_no > c->cmt_no)
593 if (cmt_no < *last_cmt_no && *last_flagged) {
595 * The last orphan node had a higher commit number and
596 * was flagged as the last written for that commit
597 * number. That makes this orphan node, out of date.
600 ubifs_err("out of order commit number %llu in "
601 "orphan node at %d:%d",
602 cmt_no, sleb->lnum, snod->offs);
603 dbg_dump_node(c, snod->node);
606 dbg_rcvry("out of date LEB %d", sleb->lnum);
614 n = (le32_to_cpu(orph->ch.len) - UBIFS_ORPH_NODE_SZ) >> 3;
615 for (i = 0; i < n; i++) {
616 inum = le64_to_cpu(orph->inos[i]);
617 dbg_rcvry("deleting orphaned inode %lu",
618 (unsigned long)inum);
619 err = ubifs_tnc_remove_ino(c, inum);
622 err = insert_dead_orphan(c, inum);
627 *last_cmt_no = cmt_no;
628 if (le64_to_cpu(orph->cmt_no) & (1ULL << 63)) {
629 dbg_rcvry("last orph node for commit %llu at %d:%d",
630 cmt_no, sleb->lnum, snod->offs);
640 * kill_orphans - remove all orphan inodes from the index.
641 * @c: UBIFS file-system description object
643 * If recovery is required, then orphan inodes recorded during the previous
644 * session (which ended with an unclean unmount) must be deleted from the index.
645 * This is done by updating the TNC, but since the index is not updated until
646 * the next commit, the LEBs where the orphan information is recorded are not
647 * erased until the next commit.
649 static int kill_orphans(struct ubifs_info *c)
651 unsigned long long last_cmt_no = 0;
652 int lnum, err = 0, outofdate = 0, last_flagged = 0;
654 c->ohead_lnum = c->orph_first;
656 /* Check no-orphans flag and skip this if no orphans */
658 dbg_rcvry("no orphans");
662 * Orph nodes always start at c->orph_first and are written to each
663 * successive LEB in turn. Generally unused LEBs will have been unmapped
664 * but may contain out of date orphan nodes if the unmap didn't go
665 * through. In addition, the last orphan node written for each commit is
666 * marked (top bit of orph->cmt_no is set to 1). It is possible that
667 * there are orphan nodes from the next commit (i.e. the commit did not
668 * complete successfully). In that case, no orphans will have been lost
669 * due to the way that orphans are written, and any orphans added will
670 * be valid orphans anyway and so can be deleted.
672 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) {
673 struct ubifs_scan_leb *sleb;
675 dbg_rcvry("LEB %d", lnum);
676 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1);
678 if (PTR_ERR(sleb) == -EUCLEAN)
679 sleb = ubifs_recover_leb(c, lnum, 0,
686 err = do_kill_orphans(c, sleb, &last_cmt_no, &outofdate,
688 if (err || outofdate) {
689 ubifs_scan_destroy(sleb);
693 c->ohead_lnum = lnum;
694 c->ohead_offs = sleb->endpt;
696 ubifs_scan_destroy(sleb);
702 * ubifs_mount_orphans - delete orphan inodes and erase LEBs that recorded them.
703 * @c: UBIFS file-system description object
704 * @unclean: indicates recovery from unclean unmount
705 * @read_only: indicates read only mount
707 * This function is called when mounting to erase orphans from the previous
708 * session. If UBIFS was not unmounted cleanly, then the inodes recorded as
709 * orphans are deleted.
711 int ubifs_mount_orphans(struct ubifs_info *c, int unclean, int read_only)
715 c->max_orphans = tot_avail_orphs(c);
718 c->orph_buf = vmalloc(c->leb_size);
724 err = kill_orphans(c);
726 err = ubifs_clear_orphans(c);
731 #ifdef CONFIG_UBIFS_FS_DEBUG
733 struct check_orphan {
739 unsigned long last_ino;
740 unsigned long tot_inos;
741 unsigned long missing;
742 unsigned long long leaf_cnt;
743 struct ubifs_ino_node *node;
747 static int dbg_find_orphan(struct ubifs_info *c, ino_t inum)
749 struct ubifs_orphan *o;
752 spin_lock(&c->orphan_lock);
753 p = c->orph_tree.rb_node;
755 o = rb_entry(p, struct ubifs_orphan, rb);
758 else if (inum > o->inum)
761 spin_unlock(&c->orphan_lock);
765 spin_unlock(&c->orphan_lock);
769 static int dbg_ins_check_orphan(struct rb_root *root, ino_t inum)
771 struct check_orphan *orphan, *o;
772 struct rb_node **p, *parent = NULL;
774 orphan = kzalloc(sizeof(struct check_orphan), GFP_NOFS);
782 o = rb_entry(parent, struct check_orphan, rb);
785 else if (inum > o->inum)
792 rb_link_node(&orphan->rb, parent, p);
793 rb_insert_color(&orphan->rb, root);
797 static int dbg_find_check_orphan(struct rb_root *root, ino_t inum)
799 struct check_orphan *o;
804 o = rb_entry(p, struct check_orphan, rb);
807 else if (inum > o->inum)
815 static void dbg_free_check_tree(struct rb_root *root)
817 struct rb_node *this = root->rb_node;
818 struct check_orphan *o;
822 this = this->rb_left;
824 } else if (this->rb_right) {
825 this = this->rb_right;
828 o = rb_entry(this, struct check_orphan, rb);
829 this = rb_parent(this);
831 if (this->rb_left == &o->rb)
832 this->rb_left = NULL;
834 this->rb_right = NULL;
840 static int dbg_orphan_check(struct ubifs_info *c, struct ubifs_zbranch *zbr,
843 struct check_info *ci = priv;
847 inum = key_inum(c, &zbr->key);
848 if (inum != ci->last_ino) {
849 /* Lowest node type is the inode node, so it comes first */
850 if (key_type(c, &zbr->key) != UBIFS_INO_KEY)
851 ubifs_err("found orphan node ino %lu, type %d",
852 (unsigned long)inum, key_type(c, &zbr->key));
855 err = ubifs_tnc_read_node(c, zbr, ci->node);
857 ubifs_err("node read failed, error %d", err);
860 if (ci->node->nlink == 0)
861 /* Must be recorded as an orphan */
862 if (!dbg_find_check_orphan(&ci->root, inum) &&
863 !dbg_find_orphan(c, inum)) {
864 ubifs_err("missing orphan, ino %lu",
865 (unsigned long)inum);
873 static int dbg_read_orphans(struct check_info *ci, struct ubifs_scan_leb *sleb)
875 struct ubifs_scan_node *snod;
876 struct ubifs_orph_node *orph;
880 list_for_each_entry(snod, &sleb->nodes, list) {
882 if (snod->type != UBIFS_ORPH_NODE)
885 n = (le32_to_cpu(orph->ch.len) - UBIFS_ORPH_NODE_SZ) >> 3;
886 for (i = 0; i < n; i++) {
887 inum = le64_to_cpu(orph->inos[i]);
888 err = dbg_ins_check_orphan(&ci->root, inum);
896 static int dbg_scan_orphans(struct ubifs_info *c, struct check_info *ci)
901 /* Check no-orphans flag and skip this if no orphans */
905 buf = __vmalloc(c->leb_size, GFP_NOFS, PAGE_KERNEL);
907 ubifs_err("cannot allocate memory to check orphans");
911 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) {
912 struct ubifs_scan_leb *sleb;
914 sleb = ubifs_scan(c, lnum, 0, buf, 0);
920 err = dbg_read_orphans(ci, sleb);
921 ubifs_scan_destroy(sleb);
930 static int dbg_check_orphans(struct ubifs_info *c)
932 struct check_info ci;
935 if (!dbg_is_chk_orph(c))
943 ci.node = kmalloc(UBIFS_MAX_INO_NODE_SZ, GFP_NOFS);
945 ubifs_err("out of memory");
949 err = dbg_scan_orphans(c, &ci);
953 err = dbg_walk_index(c, &dbg_orphan_check, NULL, &ci);
955 ubifs_err("cannot scan TNC, error %d", err);
960 ubifs_err("%lu missing orphan(s)", ci.missing);
965 dbg_cmt("last inode number is %lu", ci.last_ino);
966 dbg_cmt("total number of inodes is %lu", ci.tot_inos);
967 dbg_cmt("total number of leaf nodes is %llu", ci.leaf_cnt);
970 dbg_free_check_tree(&ci.root);
975 #endif /* CONFIG_UBIFS_FS_DEBUG */