816 	struct check_info *ci = priv;  in dbg_orphan_check()  local
821 	if (inum != ci->last_ino) {  in dbg_orphan_check()
826 		ci->last_ino = inum;  in dbg_orphan_check()
827 		ci->tot_inos += 1;  in dbg_orphan_check()
828 		err = ubifs_tnc_read_node(c, zbr, ci->node);  in dbg_orphan_check()
833 		if (ci->node->nlink == 0)  in dbg_orphan_check()
835 			if (!dbg_find_check_orphan(&ci->root, inum) &&  in dbg_orphan_check()
839 				ci->missing += 1;  in dbg_orphan_check()
842 	ci->leaf_cnt += 1;  in dbg_orphan_check()
846 static int dbg_read_orphans(struct check_info *ci, struct ubifs_scan_leb *sleb)  in dbg_read_orphans()  argument
861 			err = dbg_ins_check_orphan(&ci->root, inum);  in dbg_read_orphans()
869 static int dbg_scan_orphans(struct ubifs_info *c, struct check_info *ci)  in dbg_scan_orphans()  argument
893 		err = dbg_read_orphans(ci, sleb);  in dbg_scan_orphans()
905 	struct check_info ci;  in dbg_check_orphans()  local
911 	ci.last_ino = 0;  in dbg_check_orphans()
912 	ci.tot_inos = 0;  in dbg_check_orphans()
913 	ci.missing  = 0;  in dbg_check_orphans()
914 	ci.leaf_cnt = 0;  in dbg_check_orphans()
915 	ci.root = RB_ROOT;  in dbg_check_orphans()
916 	ci.node = kmalloc(UBIFS_MAX_INO_NODE_SZ, GFP_NOFS);  in dbg_check_orphans()
917 	if (!ci.node) {  in dbg_check_orphans()
922 	err = dbg_scan_orphans(c, &ci);  in dbg_check_orphans()
926 	err = dbg_walk_index(c, &dbg_orphan_check, NULL, &ci);  in dbg_check_orphans()
932 	if (ci.missing) {  in dbg_check_orphans()
933 		ubifs_err(c, "%lu missing orphan(s)", ci.missing);  in dbg_check_orphans()
938 	dbg_cmt("last inode number is %lu", ci.last_ino);  in dbg_check_orphans()
939 	dbg_cmt("total number of inodes is %lu", ci.tot_inos);  in dbg_check_orphans()
940 	dbg_cmt("total number of leaf nodes is %llu", ci.leaf_cnt);  in dbg_check_orphans()
943 	dbg_free_check_tree(&ci.root);  in dbg_check_orphans()
944 	kfree(ci.node);  in dbg_check_orphans()