Lines Matching defs:child
556 struct child_info *child)
571 &ni, child);
579 blk_cnt, cbc, child, &ni);
585 blk_cnt, cbc, child);
591 blk_cnt, cbc, child);
612 static void check_extent_info(struct child_info *child,
615 struct extent_info *ei = &child->ei;
616 u32 pgofs = child->pgofs;
622 if (child->state & FSCK_UNMATCHED_EXTENT)
625 if ((child->state & FSCK_INLINE_INODE) && ei->len)
630 if (child->last_blk != ei->blk + ei->len - 1)
631 child->state |= FSCK_UNMATCHED_EXTENT;
643 if (!child->last_blk) {
647 } else if (child->last_blk + 1 != blkaddr) {
651 child->last_blk = blkaddr;
662 child->state |= FSCK_UNMATCHED_EXTENT;
695 struct child_info child;
734 memset(&child, 0, sizeof(child));
735 child.links = 2;
736 child.p_ino = nid;
737 child.pp_ino = le32_to_cpu(node_blk->i.i_pino);
738 child.dir_level = node_blk->i.i_dir_level;
748 memcpy(child.p_name, node_blk->i.i_name, namelen);
796 get_extent_info(&child.ei, &node_blk->i.i_ext);
797 child.last_blk = 0;
905 child.state |= FSCK_INLINE_INODE;
925 ret = fsck_chk_inline_dentries(sbi, node_blk, &child);
930 child.state |= FSCK_INLINE_INODE;
944 for (idx = 0; idx < addrs; idx++, child.pgofs++) {
948 check_extent_info(&child, blkaddr, 0);
953 if (!compressed || (child.pgofs &
967 cbc->cheader_pgofs = child.pgofs;
973 child.pgofs - cbc->cheader_pgofs < cluster_size)
978 &child, (i_blocks == *blk_cnt),
984 qf_last_blkofs[cur_qtype] = child.pgofs;
1015 ftype, ntype, blk_cnt, cbc, &child);
1026 child.pgofs += ADDRS_PER_BLOCK(&node_blk->i);
1028 child.pgofs += ADDRS_PER_BLOCK(&node_blk->i) *
1031 child.pgofs += ADDRS_PER_BLOCK(&node_blk->i) *
1039 check_extent_info(&child, 0, 1);
1041 if (child.state & FSCK_UNMATCHED_EXTENT) {
1043 nid, child.ei.fofs, child.ei.blk, child.ei.len);
1105 child.files);
1107 if (i_links != child.links) {
1109 nid, i_links, child.links);
1111 node_blk->i.i_links = cpu_to_le32(child.links);
1114 nid, i_links, child.links);
1117 if (child.dots < 2 &&
1120 nid, child.dots);
1204 struct child_info *child, struct node_info *ni)
1208 child->p_ino = nid;
1209 child->pp_ino = le32_to_cpu(inode->i_pino);
1215 for (idx = 0; idx < ADDRS_PER_BLOCK(inode); idx++, child->pgofs++) {
1218 check_extent_info(child, blkaddr, 0);
1223 if (!compressed || (child->pgofs &
1236 cbc->cheader_pgofs = child->pgofs;
1241 if (!compr_rel && blkaddr == NEW_ADDR && child->pgofs -
1245 blkaddr, child,
1252 qf_last_blkofs[cur_qtype] = child->pgofs;
1268 struct f2fs_compr_blk_cnt *cbc, struct child_info *child)
1281 cbc, child);
1293 child->pgofs += ADDRS_PER_BLOCK(&node_blk->i);
1311 struct f2fs_compr_blk_cnt *cbc, struct child_info *child)
1323 ftype, TYPE_INDIRECT_NODE, blk_cnt, cbc, child);
1335 child->pgofs += ADDRS_PER_BLOCK(&node_blk->i) *
1524 struct child_info *child,
1532 if (le32_to_cpu(dentry->ino) != child->p_ino) {
1534 le32_to_cpu(dentry->ino), child->p_ino);
1535 dentry->ino = cpu_to_le32(child->p_ino);
1541 if (child->p_ino == F2FS_ROOT_INO(sbi)) {
1548 } else if (le32_to_cpu(dentry->ino) != child->pp_ino) {
1550 le32_to_cpu(dentry->ino), child->pp_ino);
1551 dentry->ino = cpu_to_le32(child->pp_ino);
1577 struct child_info *child,
1672 child, name, name_len, &filenames[i],
1679 child->dots++;
1683 if (child->dots > 2) {
1687 child->dots--;
1704 child->pgofs, child->dir_level,
1705 child->p_ino);
1729 child->i_namelen = name_len;
1732 ftype, TYPE_INODE, &blk_cnt, &cbc, child);
1746 child->links++;
1748 child->files++;
1758 struct f2fs_node *node_blk, struct child_info *child)
1777 memcpy(new_dentry->name, child->p_name, F2FS_NAME_LEN);
1781 dentries = __chk_dentries(sbi, IS_CASEFOLDED(&node_blk->i), child,
1802 struct child_info *child, int last_blk, int enc_name)
1820 memcpy(new_dentry->name, child->p_name, F2FS_NAME_LEN);
1824 dentries = __chk_dentries(sbi, casefolded, child,
1850 u32 blk_addr, struct child_info *child, int last_blk,
1885 return fsck_chk_dentry_blk(sbi, casefolded, blk_addr, child,