826 	struct check_info *ci = priv;  in dbg_orphan_check()  local
831 	if (inum != ci->last_ino) {  in dbg_orphan_check()
836 		ci->last_ino = inum;  in dbg_orphan_check()
837 		ci->tot_inos += 1;  in dbg_orphan_check()
838 		err = ubifs_tnc_read_node(c, zbr, ci->node);  in dbg_orphan_check()
843 		if (ci->node->nlink == 0)  in dbg_orphan_check()
845 			if (!dbg_find_check_orphan(&ci->root, inum) &&  in dbg_orphan_check()
849 				ci->missing += 1;  in dbg_orphan_check()
852 	ci->leaf_cnt += 1;  in dbg_orphan_check()
856 static int dbg_read_orphans(struct check_info *ci, struct ubifs_scan_leb *sleb)  in dbg_read_orphans()  argument
871 			err = dbg_ins_check_orphan(&ci->root, inum);  in dbg_read_orphans()
879 static int dbg_scan_orphans(struct ubifs_info *c, struct check_info *ci)  in dbg_scan_orphans()  argument
903 		err = dbg_read_orphans(ci, sleb);  in dbg_scan_orphans()
915 	struct check_info ci;  in dbg_check_orphans()  local
921 	ci.last_ino = 0;  in dbg_check_orphans()
922 	ci.tot_inos = 0;  in dbg_check_orphans()
923 	ci.missing  = 0;  in dbg_check_orphans()
924 	ci.leaf_cnt = 0;  in dbg_check_orphans()
925 	ci.root = RB_ROOT;  in dbg_check_orphans()
926 	ci.node = kmalloc(UBIFS_MAX_INO_NODE_SZ, GFP_NOFS);  in dbg_check_orphans()
927 	if (!ci.node) {  in dbg_check_orphans()
932 	err = dbg_scan_orphans(c, &ci);  in dbg_check_orphans()
936 	err = dbg_walk_index(c, &dbg_orphan_check, NULL, &ci);  in dbg_check_orphans()
942 	if (ci.missing) {  in dbg_check_orphans()
943 		ubifs_err(c, "%lu missing orphan(s)", ci.missing);  in dbg_check_orphans()
948 	dbg_cmt("last inode number is %lu", ci.last_ino);  in dbg_check_orphans()
949 	dbg_cmt("total number of inodes is %lu", ci.tot_inos);  in dbg_check_orphans()
950 	dbg_cmt("total number of leaf nodes is %llu", ci.leaf_cnt);  in dbg_check_orphans()
953 	dbg_free_check_tree(&ci.root);  in dbg_check_orphans()
954 	kfree(ci.node);  in dbg_check_orphans()