2015-12-10 00:18:44 +00:00
|
|
|
/**
|
|
|
|
* node.h
|
|
|
|
*
|
|
|
|
* Many parts of codes are copied from Linux kernel/fs/f2fs.
|
|
|
|
*
|
|
|
|
* Copyright (C) 2015 Huawei Ltd.
|
|
|
|
* Witten by:
|
|
|
|
* Hou Pengyang <houpengyang@huawei.com>
|
|
|
|
* Liu Shuoran <liushuoran@huawei.com>
|
|
|
|
* Jaegeuk Kim <jaegeuk@kernel.org>
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License version 2 as
|
|
|
|
* published by the Free Software Foundation.
|
|
|
|
*/
|
|
|
|
#ifndef _NODE_H_
|
|
|
|
#define _NODE_H_
|
|
|
|
|
|
|
|
#include "fsck.h"
|
|
|
|
|
|
|
|
static inline int IS_INODE(struct f2fs_node *node)
|
|
|
|
{
|
|
|
|
return ((node)->footer.nid == (node)->footer.ino);
|
|
|
|
}
|
|
|
|
|
2019-03-25 13:19:35 +00:00
|
|
|
static inline unsigned int ADDRS_PER_PAGE(struct f2fs_sb_info *sbi,
|
|
|
|
struct f2fs_node *node_blk, struct f2fs_node *inode_blk)
|
|
|
|
{
|
|
|
|
nid_t ino = le32_to_cpu(node_blk->footer.ino);
|
|
|
|
unsigned int nblocks;
|
|
|
|
|
|
|
|
if (IS_INODE(node_blk))
|
|
|
|
return ADDRS_PER_INODE(&node_blk->i);
|
|
|
|
|
|
|
|
if (!inode_blk) {
|
|
|
|
struct node_info ni;
|
|
|
|
|
|
|
|
inode_blk = calloc(BLOCK_SZ, 2);
|
|
|
|
ASSERT(inode_blk);
|
|
|
|
|
|
|
|
get_node_info(sbi, ino, &ni);
|
|
|
|
ASSERT(dev_read_block(inode_blk, ni.blk_addr) >= 0);
|
|
|
|
nblocks = ADDRS_PER_BLOCK(&inode_blk->i);
|
|
|
|
free(inode_blk);
|
|
|
|
} else {
|
|
|
|
nblocks = ADDRS_PER_BLOCK(&inode_blk->i);
|
|
|
|
}
|
|
|
|
return nblocks;
|
|
|
|
}
|
|
|
|
|
2017-07-26 14:49:57 +00:00
|
|
|
static inline __le32 *blkaddr_in_inode(struct f2fs_node *node)
|
|
|
|
{
|
|
|
|
return node->i.i_addr + get_extra_isize(node);
|
|
|
|
}
|
|
|
|
|
2015-12-10 00:18:44 +00:00
|
|
|
static inline __le32 *blkaddr_in_node(struct f2fs_node *node)
|
|
|
|
{
|
2017-07-26 14:49:57 +00:00
|
|
|
return IS_INODE(node) ? blkaddr_in_inode(node) : node->dn.addr;
|
2015-12-10 00:18:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline block_t datablock_addr(struct f2fs_node *node_page,
|
|
|
|
unsigned int offset)
|
|
|
|
{
|
|
|
|
__le32 *addr_array;
|
|
|
|
|
|
|
|
ASSERT(node_page);
|
|
|
|
addr_array = blkaddr_in_node(node_page);
|
|
|
|
return le32_to_cpu(addr_array[offset]);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void set_nid(struct f2fs_node * rn, int off, nid_t nid, int i)
|
|
|
|
{
|
|
|
|
if (i)
|
|
|
|
rn->i.i_nid[off - NODE_DIR1_BLOCK] = cpu_to_le32(nid);
|
|
|
|
else
|
|
|
|
rn->in.nid[off] = cpu_to_le32(nid);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline nid_t get_nid(struct f2fs_node * rn, int off, int i)
|
|
|
|
{
|
|
|
|
if (i)
|
|
|
|
return le32_to_cpu(rn->i.i_nid[off - NODE_DIR1_BLOCK]);
|
|
|
|
else
|
|
|
|
return le32_to_cpu(rn->in.nid[off]);
|
|
|
|
}
|
|
|
|
|
|
|
|
enum {
|
|
|
|
ALLOC_NODE, /* allocate a new node page if needed */
|
|
|
|
LOOKUP_NODE, /* lookup up a node without readahead */
|
|
|
|
LOOKUP_NODE_RA,
|
|
|
|
};
|
|
|
|
|
|
|
|
static inline void set_new_dnode(struct dnode_of_data *dn,
|
|
|
|
struct f2fs_node *iblk, struct f2fs_node *nblk, nid_t nid)
|
|
|
|
{
|
|
|
|
memset(dn, 0, sizeof(*dn));
|
|
|
|
dn->inode_blk = iblk;
|
|
|
|
dn->node_blk = nblk;
|
|
|
|
dn->nid = nid;
|
|
|
|
dn->idirty = 0;
|
|
|
|
dn->ndirty = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void inc_inode_blocks(struct dnode_of_data *dn)
|
|
|
|
{
|
|
|
|
u64 blocks = le64_to_cpu(dn->inode_blk->i.i_blocks);
|
|
|
|
|
|
|
|
dn->inode_blk->i.i_blocks = cpu_to_le64(blocks + 1);
|
|
|
|
dn->idirty = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int IS_DNODE(struct f2fs_node *node_page)
|
|
|
|
{
|
|
|
|
unsigned int ofs = ofs_of_node(node_page);
|
|
|
|
|
|
|
|
if (ofs == 3 || ofs == 4 + NIDS_PER_BLOCK ||
|
|
|
|
ofs == 5 + 2 * NIDS_PER_BLOCK)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (ofs >= 6 + 2 * NIDS_PER_BLOCK) {
|
|
|
|
ofs -= 6 + 2 * NIDS_PER_BLOCK;
|
|
|
|
if (!((long int)ofs % (NIDS_PER_BLOCK + 1)))
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
f2fs-tools: fix to skip block allocation for fsynced data
Previously, we don't allow block allocation on unclean umounted image,
result in failing to repair quota system file.
In this patch, we port most recovery codes from kernel to userspace
tools, so that on unclean image, during fsck initialization, we will
record all data/node block address we may recover in kernel, and
then during allocation of quota file repair, we can skip those blocks
to avoid block use conflict.
Eventually, if free space is enough, we can repair the quota system
file on an unclean umounted image.
Signed-off-by: Chao Yu <yuchao0@huawei.com>
[Jaegeuk Kim: remove unnecessary parameter]
Signed-off-by: Jaegeuk Kim <jaegeuk@kernel.org>
2019-08-14 08:48:55 +00:00
|
|
|
static inline nid_t ino_of_node(struct f2fs_node *node_blk)
|
|
|
|
{
|
|
|
|
return le32_to_cpu(node_blk->footer.ino);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline __u64 cpver_of_node(struct f2fs_node *node_blk)
|
|
|
|
{
|
|
|
|
return le64_to_cpu(node_blk->footer.cp_ver);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline bool is_recoverable_dnode(struct f2fs_sb_info *sbi,
|
|
|
|
struct f2fs_node *node_blk)
|
|
|
|
{
|
|
|
|
struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
|
|
|
|
__u64 cp_ver = cur_cp_version(ckpt);
|
|
|
|
|
|
|
|
/* Don't care crc part, if fsck.f2fs sets it. */
|
|
|
|
if (is_set_ckpt_flags(ckpt, CP_NOCRC_RECOVERY_FLAG))
|
|
|
|
return (cp_ver << 32) == (cpver_of_node(node_blk) << 32);
|
|
|
|
|
|
|
|
if (is_set_ckpt_flags(ckpt, CP_CRC_RECOVERY_FLAG))
|
|
|
|
cp_ver |= (cur_cp_crc(ckpt) << 32);
|
|
|
|
|
|
|
|
return cp_ver == cpver_of_node(node_blk);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline block_t next_blkaddr_of_node(struct f2fs_node *node_blk)
|
|
|
|
{
|
|
|
|
return le32_to_cpu(node_blk->footer.next_blkaddr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int is_node(struct f2fs_node *node_blk, int type)
|
|
|
|
{
|
|
|
|
return le32_to_cpu(node_blk->footer.flag) & (1 << type);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define is_fsync_dnode(node_blk) is_node(node_blk, FSYNC_BIT_SHIFT)
|
|
|
|
#define is_dent_dnode(node_blk) is_node(node_blk, DENT_BIT_SHIFT)
|
|
|
|
|
2015-12-10 00:18:44 +00:00
|
|
|
#endif
|