Lines Matching refs:nid
39 u32 nid, u32 link_cnt)
47 node->nid = nid;
59 while (tmp && (nid < tmp->nid)) {
60 ASSERT(tmp->nid != nid);
74 DBG(2, "ino[0x%x] has hard links [0x%x]\n", nid, link_cnt);
78 static int find_and_dec_hard_link_list(struct f2fs_sb_info *sbi, u32 nid)
88 while (node && (nid < node->nid)) {
93 if (node == NULL || (nid != node->nid))
110 static int is_valid_ssa_node_blk(struct f2fs_sb_info *sbi, u32 nid,
123 if (le32_to_cpu(sum_entry.nid) != nid) {
124 DBG(0, "nid [0x%x]\n", nid);
132 DBG(0, "summary_entry.nid [0x%x]\n",
133 le32_to_cpu(sum_entry.nid));
134 DBG(0, "--> node block's nid [0x%x]\n", nid);
154 if (le32_to_cpu(sum_entry.nid) != parent_nid ||
158 DBG(0, "summary_entry.nid [0x%x]\n",
159 le32_to_cpu(sum_entry.nid));
164 DBG(0, "parent nid [0x%x]\n", parent_nid);
175 static int sanity_check_nid(struct f2fs_sb_info *sbi, u32 nid,
183 if (!IS_VALID_NID(sbi, nid)) {
184 ASSERT_MSG("nid is not valid. [0x%x]", nid);
188 get_node_info(sbi, nid, ni);
190 ASSERT_MSG("nid is NEW_ADDR. [0x%x]", nid);
199 if (is_valid_ssa_node_blk(sbi, nid, ni->blk_addr)) {
200 ASSERT_MSG("summary node block is not valid. [0x%x]", nid);
208 node_blk->footer.nid != node_blk->footer.ino) {
209 ASSERT_MSG("nid[0x%x] footer.nid[0x%x] footer.ino[0x%x]",
210 nid, le32_to_cpu(node_blk->footer.nid),
215 node_blk->footer.nid == node_blk->footer.ino) {
216 ASSERT_MSG("nid[0x%x] footer.nid[0x%x] footer.ino[0x%x]",
217 nid, le32_to_cpu(node_blk->footer.nid),
222 if (le32_to_cpu(node_blk->footer.nid) != nid) {
223 ASSERT_MSG("nid[0x%x] blk_addr[0x%x] footer.nid[0x%x]",
224 nid, ni->blk_addr,
225 le32_to_cpu(node_blk->footer.nid));
234 nid, flag);
243 ASSERT_MSG("Duplicated node blk. nid[0x%x][0x%x]\n",
244 nid, ni->blk_addr);
251 f2fs_test_bit(nid, fsck->nat_area_bitmap) != 0)
252 f2fs_clear_bit(nid, fsck->nat_area_bitmap);
254 ASSERT_MSG("orphan or xattr nid is duplicated [0x%x]\n",
255 nid);
297 u32 nid, enum FILE_TYPE ftype, enum NODE_TYPE ntype,
306 if (sanity_check_nid(sbi, nid, node_blk, ftype, ntype, &ni))
310 fsck_chk_inode_blk(sbi, nid, ftype, node_blk, blk_cnt, &ni);
316 fsck_chk_dnode_blk(sbi, inode, nid, ftype, node_blk,
338 /* start with valid nid and blkaddr */
339 void fsck_chk_inode_blk(struct f2fs_sb_info *sbi, u32 nid,
362 add_into_hard_link_list(sbi, nid, i_links);
366 DBG(3, "[0x%x] has hard links [0x%x]\n", nid, i_links);
367 if (find_and_dec_hard_link_list(sbi, nid)) {
369 nid, i_links);
376 nid, i_links, i_links + 1);
385 if (fsck_chk_xattr_blk(sbi, nid,
391 nid, le32_to_cpu(node_blk->i.i_xattr_nid));
418 DBG(3, "ino[0x%x] has inline data!\n", nid);
422 DBG(3, "ino[0x%x] has inline dentry!\n", nid);
439 ftype, nid, idx, ni->version);
445 FIX_MSG("[0x%x] i_addr[%d] = 0", nid, idx);
470 FIX_MSG("[0x%x] i_nid[%d] = 0", nid, idx);
490 nid, i_blocks, *blk_cnt);
495 nid, i_blocks, *blk_cnt);
500 nid, i_links, child_cnt);
505 nid, i_links, child_cnt);
511 nid, i_links);
519 u32 nid, enum FILE_TYPE ftype, struct f2fs_node *node_blk,
532 nid, idx, ni->version);
546 if (le32_to_cpu(node_blk->in.nid[i]) == 0x0)
549 le32_to_cpu(node_blk->in.nid[i]),
554 printf("delete in.nid[i] = 0;\n");
566 if (le32_to_cpu(node_blk->in.nid[i]) == 0x0)
569 le32_to_cpu(node_blk->in.nid[i]),
574 printf("delete in.nid[i] = 0;\n");
878 * 2. nat_area_bitmap has bitmap information of used nid in NAT.
993 node->nid, node->links);