[linux-2.6-block.git] / fs / f2fs / node.h

/*
 * fs/f2fs/node.h
 *
 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
 *             http://www.samsung.com/
 *
 * 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.
 */
/* start node id of a node block dedicated to the given node id */
#define	START_NID(nid) ((nid / NAT_ENTRY_PER_BLOCK) * NAT_ENTRY_PER_BLOCK)

/* node block offset on the NAT area dedicated to the given start node id */
#define	NAT_BLOCK_OFFSET(start_nid) (start_nid / NAT_ENTRY_PER_BLOCK)

/* # of pages to perform synchronous readahead before building free nids */
#define FREE_NID_PAGES 4

#define DEF_RA_NID_PAGES	4	/* # of nid pages to be readaheaded */

/* maximum readahead size for node during getting data blocks */
#define MAX_RA_NODE		128

/* control the memory footprint threshold (10MB per 1GB ram) */
#define DEF_RAM_THRESHOLD	10

/* vector size for gang look-up from nat cache that consists of radix tree */
#define NATVEC_SIZE	64
#define SETVEC_SIZE	32

/* return value for read_node_page */
#define LOCKED_PAGE	1

/* For flag in struct node_info */
enum {
	IS_CHECKPOINTED,	/* is it checkpointed before? */
	HAS_FSYNCED_INODE,	/* is the inode fsynced before? */
	HAS_LAST_FSYNC,		/* has the latest node fsync mark? */
	IS_DIRTY,		/* this nat entry is dirty? */
};

/*
 * For node information
 */
struct node_info {
	nid_t nid;		/* node id */
	nid_t ino;		/* inode number of the node's owner */
	block_t	blk_addr;	/* block address of the node */
	unsigned char version;	/* version of the node */
	unsigned char flag;	/* for node information bits */
};

struct nat_entry {
	struct list_head list;	/* for clean or dirty nat list */
	struct node_info ni;	/* in-memory node information */
};

#define nat_get_nid(nat)		(nat->ni.nid)
#define nat_set_nid(nat, n)		(nat->ni.nid = n)
#define nat_get_blkaddr(nat)		(nat->ni.blk_addr)
#define nat_set_blkaddr(nat, b)		(nat->ni.blk_addr = b)
#define nat_get_ino(nat)		(nat->ni.ino)
#define nat_set_ino(nat, i)		(nat->ni.ino = i)
#define nat_get_version(nat)		(nat->ni.version)
#define nat_set_version(nat, v)		(nat->ni.version = v)

#define inc_node_version(version)	(++version)

static inline void copy_node_info(struct node_info *dst,
						struct node_info *src)
{
	dst->nid = src->nid;
	dst->ino = src->ino;
	dst->blk_addr = src->blk_addr;
	dst->version = src->version;
	/* should not copy flag here */
}

static inline void set_nat_flag(struct nat_entry *ne,
				unsigned int type, bool set)
{
	unsigned char mask = 0x01 << type;
	if (set)
		ne->ni.flag |= mask;
	else
		ne->ni.flag &= ~mask;
}

static inline bool get_nat_flag(struct nat_entry *ne, unsigned int type)
{
	unsigned char mask = 0x01 << type;
	return ne->ni.flag & mask;
}

static inline void nat_reset_flag(struct nat_entry *ne)
{
	/* these states can be set only after checkpoint was done */
	set_nat_flag(ne, IS_CHECKPOINTED, true);
	set_nat_flag(ne, HAS_FSYNCED_INODE, false);
	set_nat_flag(ne, HAS_LAST_FSYNC, true);
}

static inline void node_info_from_raw_nat(struct node_info *ni,
						struct f2fs_nat_entry *raw_ne)
{
	ni->ino = le32_to_cpu(raw_ne->ino);
	ni->blk_addr = le32_to_cpu(raw_ne->block_addr);
	ni->version = raw_ne->version;
}

static inline void raw_nat_from_node_info(struct f2fs_nat_entry *raw_ne,
						struct node_info *ni)
{
	raw_ne->ino = cpu_to_le32(ni->ino);
	raw_ne->block_addr = cpu_to_le32(ni->blk_addr);
	raw_ne->version = ni->version;
}

enum mem_type {
	FREE_NIDS,	/* indicates the free nid list */
	NAT_ENTRIES,	/* indicates the cached nat entry */
	DIRTY_DENTS,	/* indicates dirty dentry pages */
	INO_ENTRIES,	/* indicates inode entries */
	EXTENT_CACHE,	/* indicates extent cache */
	BASE_CHECK,	/* check kernel status */
};

struct nat_entry_set {
	struct list_head set_list;	/* link with other nat sets */
	struct list_head entry_list;	/* link with dirty nat entries */
	nid_t set;			/* set number*/
	unsigned int entry_cnt;		/* the # of nat entries in set */
};

/*
 * For free nid mangement
 */
enum nid_state {
	NID_NEW,	/* newly added to free nid list */
	NID_ALLOC	/* it is allocated */
};

struct free_nid {
	struct list_head list;	/* for free node id list */
	nid_t nid;		/* node id */
	int state;		/* in use or not: NID_NEW or NID_ALLOC */
};

static inline void next_free_nid(struct f2fs_sb_info *sbi, nid_t *nid)
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	struct free_nid *fnid;

	spin_lock(&nm_i->free_nid_list_lock);
	if (nm_i->fcnt <= 0) {
		spin_unlock(&nm_i->free_nid_list_lock);
		return;
	}
	fnid = list_entry(nm_i->free_nid_list.next, struct free_nid, list);
	*nid = fnid->nid;
	spin_unlock(&nm_i->free_nid_list_lock);
}

/*
 * inline functions
 */
static inline void get_nat_bitmap(struct f2fs_sb_info *sbi, void *addr)
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	memcpy(addr, nm_i->nat_bitmap, nm_i->bitmap_size);
}

static inline pgoff_t current_nat_addr(struct f2fs_sb_info *sbi, nid_t start)
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);
	pgoff_t block_off;
	pgoff_t block_addr;
	int seg_off;

	block_off = NAT_BLOCK_OFFSET(start);
	seg_off = block_off >> sbi->log_blocks_per_seg;

	block_addr = (pgoff_t)(nm_i->nat_blkaddr +
		(seg_off << sbi->log_blocks_per_seg << 1) +
		(block_off & ((1 << sbi->log_blocks_per_seg) - 1)));

	if (f2fs_test_bit(block_off, nm_i->nat_bitmap))
		block_addr += sbi->blocks_per_seg;

	return block_addr;
}

static inline pgoff_t next_nat_addr(struct f2fs_sb_info *sbi,
						pgoff_t block_addr)
{
	struct f2fs_nm_info *nm_i = NM_I(sbi);

	block_addr -= nm_i->nat_blkaddr;
	if ((block_addr >> sbi->log_blocks_per_seg) % 2)
		block_addr -= sbi->blocks_per_seg;
	else
		block_addr += sbi->blocks_per_seg;

	return block_addr + nm_i->nat_blkaddr;
}

static inline void set_to_next_nat(struct f2fs_nm_info *nm_i, nid_t start_nid)
{
	unsigned int block_off = NAT_BLOCK_OFFSET(start_nid);

	f2fs_change_bit(block_off, nm_i->nat_bitmap);
}

static inline void fill_node_footer(struct page *page, nid_t nid,
				nid_t ino, unsigned int ofs, bool reset)
{
	struct f2fs_node *rn = F2FS_NODE(page);
	unsigned int old_flag = 0;

	if (reset)
		memset(rn, 0, sizeof(*rn));
	else
		old_flag = le32_to_cpu(rn->footer.flag);

	rn->footer.nid = cpu_to_le32(nid);
	rn->footer.ino = cpu_to_le32(ino);

	/* should remain old flag bits such as COLD_BIT_SHIFT */
	rn->footer.flag = cpu_to_le32((ofs << OFFSET_BIT_SHIFT) |
					(old_flag & OFFSET_BIT_MASK));
}

static inline void copy_node_footer(struct page *dst, struct page *src)
{
	struct f2fs_node *src_rn = F2FS_NODE(src);
	struct f2fs_node *dst_rn = F2FS_NODE(dst);
	memcpy(&dst_rn->footer, &src_rn->footer, sizeof(struct node_footer));
}

static inline void fill_node_footer_blkaddr(struct page *page, block_t blkaddr)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(F2FS_P_SB(page));
	struct f2fs_node *rn = F2FS_NODE(page);

	rn->footer.cp_ver = ckpt->checkpoint_ver;
	rn->footer.next_blkaddr = cpu_to_le32(blkaddr);
}

static inline nid_t ino_of_node(struct page *node_page)
{
	struct f2fs_node *rn = F2FS_NODE(node_page);
	return le32_to_cpu(rn->footer.ino);
}

static inline nid_t nid_of_node(struct page *node_page)
{
	struct f2fs_node *rn = F2FS_NODE(node_page);
	return le32_to_cpu(rn->footer.nid);
}

static inline unsigned int ofs_of_node(struct page *node_page)
{
	struct f2fs_node *rn = F2FS_NODE(node_page);
	unsigned flag = le32_to_cpu(rn->footer.flag);
	return flag >> OFFSET_BIT_SHIFT;
}

static inline unsigned long long cpver_of_node(struct page *node_page)
{
	struct f2fs_node *rn = F2FS_NODE(node_page);
	return le64_to_cpu(rn->footer.cp_ver);
}

static inline block_t next_blkaddr_of_node(struct page *node_page)
{
	struct f2fs_node *rn = F2FS_NODE(node_page);
	return le32_to_cpu(rn->footer.next_blkaddr);
}

/*
 * f2fs assigns the following node offsets described as (num).
 * N = NIDS_PER_BLOCK
 *
 *  Inode block (0)
 *    |- direct node (1)
 *    |- direct node (2)
 *    |- indirect node (3)
 *    |            `- direct node (4 => 4 + N - 1)
 *    |- indirect node (4 + N)
 *    |            `- direct node (5 + N => 5 + 2N - 1)
 *    `- double indirect node (5 + 2N)
 *                 `- indirect node (6 + 2N)
 *                       `- direct node
 *                 ......
 *                 `- indirect node ((6 + 2N) + x(N + 1))
 *                       `- direct node
 *                 ......
 *                 `- indirect node ((6 + 2N) + (N - 1)(N + 1))
 *                       `- direct node
 */
static inline bool IS_DNODE(struct page *node_page)
{
	unsigned int ofs = ofs_of_node(node_page);

	if (f2fs_has_xattr_block(ofs))
		return false;

	if (ofs == 3 || ofs == 4 + NIDS_PER_BLOCK ||
			ofs == 5 + 2 * NIDS_PER_BLOCK)
		return false;
	if (ofs >= 6 + 2 * NIDS_PER_BLOCK) {
		ofs -= 6 + 2 * NIDS_PER_BLOCK;
		if (!((long int)ofs % (NIDS_PER_BLOCK + 1)))
			return false;
	}
	return true;
}

static inline void set_nid(struct page *p, int off, nid_t nid, bool i)
{
	struct f2fs_node *rn = F2FS_NODE(p);

	f2fs_wait_on_page_writeback(p, NODE);

	if (i)
		rn->i.i_nid[off - NODE_DIR1_BLOCK] = cpu_to_le32(nid);
	else
		rn->in.nid[off] = cpu_to_le32(nid);
	set_page_dirty(p);
}

static inline nid_t get_nid(struct page *p, int off, bool i)
{
	struct f2fs_node *rn = F2FS_NODE(p);

	if (i)
		return le32_to_cpu(rn->i.i_nid[off - NODE_DIR1_BLOCK]);
	return le32_to_cpu(rn->in.nid[off]);
}

/*
 * Coldness identification:
 *  - Mark cold files in f2fs_inode_info
 *  - Mark cold node blocks in their node footer
 *  - Mark cold data pages in page cache
 */
static inline int is_cold_data(struct page *page)
{
	return PageChecked(page);
}

static inline void set_cold_data(struct page *page)
{
	SetPageChecked(page);
}

static inline void clear_cold_data(struct page *page)
{
	ClearPageChecked(page);
}

static inline int is_node(struct page *page, int type)
{
	struct f2fs_node *rn = F2FS_NODE(page);
	return le32_to_cpu(rn->footer.flag) & (1 << type);
}

#define is_cold_node(page)	is_node(page, COLD_BIT_SHIFT)
#define is_fsync_dnode(page)	is_node(page, FSYNC_BIT_SHIFT)
#define is_dent_dnode(page)	is_node(page, DENT_BIT_SHIFT)

static inline void set_cold_node(struct inode *inode, struct page *page)
{
	struct f2fs_node *rn = F2FS_NODE(page);
	unsigned int flag = le32_to_cpu(rn->footer.flag);

	if (S_ISDIR(inode->i_mode))
		flag &= ~(0x1 << COLD_BIT_SHIFT);
	else
		flag |= (0x1 << COLD_BIT_SHIFT);
	rn->footer.flag = cpu_to_le32(flag);
}

static inline void set_mark(struct page *page, int mark, int type)
{
	struct f2fs_node *rn = F2FS_NODE(page);
	unsigned int flag = le32_to_cpu(rn->footer.flag);
	if (mark)
		flag |= (0x1 << type);
	else
		flag &= ~(0x1 << type);
	rn->footer.flag = cpu_to_le32(flag);
}
#define set_dentry_mark(page, mark)	set_mark(page, mark, DENT_BIT_SHIFT)
#define set_fsync_mark(page, mark)	set_mark(page, mark, FSYNC_BIT_SHIFT)
Commit	Line	Data
0a8165d7	1	/*
39a53e0c JK	2	* fs/f2fs/node.h
	3	*
	4	* Copyright (c) 2012 Samsung Electronics Co., Ltd.
	5	* http://www.samsung.com/
	6	*
	7	* This program is free software; you can redistribute it and/or modify
	8	* it under the terms of the GNU General Public License version 2 as
	9	* published by the Free Software Foundation.
	10	*/
	11	/* start node id of a node block dedicated to the given node id */
	12	#define START_NID(nid) ((nid / NAT_ENTRY_PER_BLOCK) * NAT_ENTRY_PER_BLOCK)
	13
	14	/* node block offset on the NAT area dedicated to the given start node id */
	15	#define NAT_BLOCK_OFFSET(start_nid) (start_nid / NAT_ENTRY_PER_BLOCK)
	16
ea1a29a0	17	/* # of pages to perform synchronous readahead before building free nids */
39a53e0c JK	18	#define FREE_NID_PAGES 4
39a53e0c JK	19
ea1a29a0 CY	20	#define DEF_RA_NID_PAGES 4 /* # of nid pages to be readaheaded */
ea1a29a0 CY	21
39a53e0c JK	22	/* maximum readahead size for node during getting data blocks */
	23	#define MAX_RA_NODE 128
	24
cdfc41c1 JK	25	/* control the memory footprint threshold (10MB per 1GB ram) */
	26	#define DEF_RAM_THRESHOLD 10
	27
39a53e0c JK	28	/* vector size for gang look-up from nat cache that consists of radix tree */
39a53e0c JK	29	#define NATVEC_SIZE 64
7aed0d45	30	#define SETVEC_SIZE 32
39a53e0c	31
56ae674c JK	32	/* return value for read_node_page */
	33	#define LOCKED_PAGE 1
	34
5c27f4ee CY	35	/* For flag in struct node_info */
	36	enum {
	37	IS_CHECKPOINTED, /* is it checkpointed before? */
	38	HAS_FSYNCED_INODE, /* is the inode fsynced before? */
	39	HAS_LAST_FSYNC, /* has the latest node fsync mark? */
	40	IS_DIRTY, /* this nat entry is dirty? */
	41	};
	42
39a53e0c JK	43	/*
	44	* For node information
	45	*/
	46	struct node_info {
	47	nid_t nid; /* node id */
	48	nid_t ino; /* inode number of the node's owner */
	49	block_t blk_addr; /* block address of the node */
	50	unsigned char version; /* version of the node */
5c27f4ee	51	unsigned char flag; /* for node information bits */
7ef35e3b JK	52	};
7ef35e3b JK	53
39a53e0c JK	54	struct nat_entry {
39a53e0c JK	55	struct list_head list; /* for clean or dirty nat list */
39a53e0c JK	56	struct node_info ni; /* in-memory node information */
	57	};
	58
	59	#define nat_get_nid(nat) (nat->ni.nid)
	60	#define nat_set_nid(nat, n) (nat->ni.nid = n)
	61	#define nat_get_blkaddr(nat) (nat->ni.blk_addr)
	62	#define nat_set_blkaddr(nat, b) (nat->ni.blk_addr = b)
	63	#define nat_get_ino(nat) (nat->ni.ino)
	64	#define nat_set_ino(nat, i) (nat->ni.ino = i)
	65	#define nat_get_version(nat) (nat->ni.version)
	66	#define nat_set_version(nat, v) (nat->ni.version = v)
	67
39a53e0c JK	68	#define inc_node_version(version) (++version)
39a53e0c JK	69
5c27f4ee CY	70	static inline void copy_node_info(struct node_info *dst,
	71	struct node_info *src)
	72	{
	73	dst->nid = src->nid;
	74	dst->ino = src->ino;
	75	dst->blk_addr = src->blk_addr;
	76	dst->version = src->version;
	77	/* should not copy flag here */
	78	}
	79
7ef35e3b JK	80	static inline void set_nat_flag(struct nat_entry *ne,
	81	unsigned int type, bool set)
	82	{
	83	unsigned char mask = 0x01 << type;
	84	if (set)
5c27f4ee	85	ne->ni.flag \|= mask;
7ef35e3b	86	else
5c27f4ee	87	ne->ni.flag &= ~mask;
7ef35e3b JK	88	}
	89
	90	static inline bool get_nat_flag(struct nat_entry *ne, unsigned int type)
	91	{
	92	unsigned char mask = 0x01 << type;
5c27f4ee	93	return ne->ni.flag & mask;
7ef35e3b JK	94	}
7ef35e3b JK	95
88bd02c9 JK	96	static inline void nat_reset_flag(struct nat_entry *ne)
	97	{
	98	/* these states can be set only after checkpoint was done */
	99	set_nat_flag(ne, IS_CHECKPOINTED, true);
	100	set_nat_flag(ne, HAS_FSYNCED_INODE, false);
	101	set_nat_flag(ne, HAS_LAST_FSYNC, true);
	102	}
	103
39a53e0c JK	104	static inline void node_info_from_raw_nat(struct node_info *ni,
	105	struct f2fs_nat_entry *raw_ne)
	106	{
	107	ni->ino = le32_to_cpu(raw_ne->ino);
	108	ni->blk_addr = le32_to_cpu(raw_ne->block_addr);
	109	ni->version = raw_ne->version;
	110	}
	111
94dac22e CY	112	static inline void raw_nat_from_node_info(struct f2fs_nat_entry *raw_ne,
	113	struct node_info *ni)
	114	{
	115	raw_ne->ino = cpu_to_le32(ni->ino);
	116	raw_ne->block_addr = cpu_to_le32(ni->blk_addr);
	117	raw_ne->version = ni->version;
	118	}
	119
6fb03f3a	120	enum mem_type {
cdfc41c1	121	FREE_NIDS, /* indicates the free nid list */
6fb03f3a	122	NAT_ENTRIES, /* indicates the cached nat entry */
a1257023	123	DIRTY_DENTS, /* indicates dirty dentry pages */
e5e7ea3c	124	INO_ENTRIES, /* indicates inode entries */
13054c54	125	EXTENT_CACHE, /* indicates extent cache */
1e84371f	126	BASE_CHECK, /* check kernel status */
cdfc41c1 JK	127	};
cdfc41c1 JK	128
aec71382	129	struct nat_entry_set {
309cc2b6	130	struct list_head set_list; /* link with other nat sets */
aec71382	131	struct list_head entry_list; /* link with dirty nat entries */
309cc2b6	132	nid_t set; /* set number*/
aec71382 CY	133	unsigned int entry_cnt; /* the # of nat entries in set */
	134	};
	135
39a53e0c JK	136	/*
	137	* For free nid mangement
	138	*/
	139	enum nid_state {
	140	NID_NEW, /* newly added to free nid list */
	141	NID_ALLOC /* it is allocated */
	142	};
	143
	144	struct free_nid {
	145	struct list_head list; /* for free node id list */
	146	nid_t nid; /* node id */
	147	int state; /* in use or not: NID_NEW or NID_ALLOC */
	148	};
	149
120c2cba	150	static inline void next_free_nid(struct f2fs_sb_info sbi, nid_t nid)
39a53e0c JK	151	{
	152	struct f2fs_nm_info *nm_i = NM_I(sbi);
	153	struct free_nid *fnid;
	154
39a53e0c	155	spin_lock(&nm_i->free_nid_list_lock);
c6e48930 HY	156	if (nm_i->fcnt <= 0) {
c6e48930 HY	157	spin_unlock(&nm_i->free_nid_list_lock);
120c2cba	158	return;
c6e48930	159	}
39a53e0c JK	160	fnid = list_entry(nm_i->free_nid_list.next, struct free_nid, list);
	161	*nid = fnid->nid;
	162	spin_unlock(&nm_i->free_nid_list_lock);
39a53e0c JK	163	}
	164
	165	/*
	166	* inline functions
	167	*/
	168	static inline void get_nat_bitmap(struct f2fs_sb_info sbi, void addr)
	169	{
	170	struct f2fs_nm_info *nm_i = NM_I(sbi);
	171	memcpy(addr, nm_i->nat_bitmap, nm_i->bitmap_size);
	172	}
	173
	174	static inline pgoff_t current_nat_addr(struct f2fs_sb_info *sbi, nid_t start)
	175	{
	176	struct f2fs_nm_info *nm_i = NM_I(sbi);
	177	pgoff_t block_off;
	178	pgoff_t block_addr;
	179	int seg_off;
	180
	181	block_off = NAT_BLOCK_OFFSET(start);
	182	seg_off = block_off >> sbi->log_blocks_per_seg;
	183
	184	block_addr = (pgoff_t)(nm_i->nat_blkaddr +
	185	(seg_off << sbi->log_blocks_per_seg << 1) +
	186	(block_off & ((1 << sbi->log_blocks_per_seg) - 1)));
	187
	188	if (f2fs_test_bit(block_off, nm_i->nat_bitmap))
	189	block_addr += sbi->blocks_per_seg;
	190
	191	return block_addr;
	192	}
	193
	194	static inline pgoff_t next_nat_addr(struct f2fs_sb_info *sbi,
	195	pgoff_t block_addr)
	196	{
	197	struct f2fs_nm_info *nm_i = NM_I(sbi);
	198
	199	block_addr -= nm_i->nat_blkaddr;
	200	if ((block_addr >> sbi->log_blocks_per_seg) % 2)
	201	block_addr -= sbi->blocks_per_seg;
	202	else
	203	block_addr += sbi->blocks_per_seg;
	204
	205	return block_addr + nm_i->nat_blkaddr;
	206	}
	207
	208	static inline void set_to_next_nat(struct f2fs_nm_info *nm_i, nid_t start_nid)
	209	{
	210	unsigned int block_off = NAT_BLOCK_OFFSET(start_nid);
	211
c6ac4c0e	212	f2fs_change_bit(block_off, nm_i->nat_bitmap);
39a53e0c JK	213	}
	214
	215	static inline void fill_node_footer(struct page *page, nid_t nid,
	216	nid_t ino, unsigned int ofs, bool reset)
	217	{
45590710	218	struct f2fs_node *rn = F2FS_NODE(page);
09eb483e JK	219	unsigned int old_flag = 0;
09eb483e JK	220
39a53e0c JK	221	if (reset)
39a53e0c JK	222	memset(rn, 0, sizeof(*rn));
09eb483e JK	223	else
	224	old_flag = le32_to_cpu(rn->footer.flag);
	225
39a53e0c JK	226	rn->footer.nid = cpu_to_le32(nid);
39a53e0c JK	227	rn->footer.ino = cpu_to_le32(ino);
09eb483e JK	228
	229	/* should remain old flag bits such as COLD_BIT_SHIFT */
	230	rn->footer.flag = cpu_to_le32((ofs << OFFSET_BIT_SHIFT) \|
	231	(old_flag & OFFSET_BIT_MASK));
39a53e0c JK	232	}
	233
	234	static inline void copy_node_footer(struct page dst, struct page src)
	235	{
45590710 GZ	236	struct f2fs_node *src_rn = F2FS_NODE(src);
45590710 GZ	237	struct f2fs_node *dst_rn = F2FS_NODE(dst);
39a53e0c JK	238	memcpy(&dst_rn->footer, &src_rn->footer, sizeof(struct node_footer));
	239	}
	240
	241	static inline void fill_node_footer_blkaddr(struct page *page, block_t blkaddr)
	242	{
4081363f	243	struct f2fs_checkpoint *ckpt = F2FS_CKPT(F2FS_P_SB(page));
45590710 GZ	244	struct f2fs_node *rn = F2FS_NODE(page);
45590710 GZ	245
39a53e0c	246	rn->footer.cp_ver = ckpt->checkpoint_ver;
25ca923b	247	rn->footer.next_blkaddr = cpu_to_le32(blkaddr);
39a53e0c JK	248	}
	249
	250	static inline nid_t ino_of_node(struct page *node_page)
	251	{
45590710	252	struct f2fs_node *rn = F2FS_NODE(node_page);
39a53e0c JK	253	return le32_to_cpu(rn->footer.ino);
	254	}
	255
	256	static inline nid_t nid_of_node(struct page *node_page)
	257	{
45590710	258	struct f2fs_node *rn = F2FS_NODE(node_page);
39a53e0c JK	259	return le32_to_cpu(rn->footer.nid);
	260	}
	261
	262	static inline unsigned int ofs_of_node(struct page *node_page)
	263	{
45590710	264	struct f2fs_node *rn = F2FS_NODE(node_page);
39a53e0c JK	265	unsigned flag = le32_to_cpu(rn->footer.flag);
	266	return flag >> OFFSET_BIT_SHIFT;
	267	}
	268
	269	static inline unsigned long long cpver_of_node(struct page *node_page)
	270	{
45590710	271	struct f2fs_node *rn = F2FS_NODE(node_page);
39a53e0c JK	272	return le64_to_cpu(rn->footer.cp_ver);
	273	}
	274
	275	static inline block_t next_blkaddr_of_node(struct page *node_page)
	276	{
45590710	277	struct f2fs_node *rn = F2FS_NODE(node_page);
39a53e0c JK	278	return le32_to_cpu(rn->footer.next_blkaddr);
	279	}
	280
	281	/*
	282	* f2fs assigns the following node offsets described as (num).
	283	* N = NIDS_PER_BLOCK
	284	*
	285	* Inode block (0)
	286	* \|- direct node (1)
	287	* \|- direct node (2)
	288	* \|- indirect node (3)
	289	* \| `- direct node (4 => 4 + N - 1)
	290	* \|- indirect node (4 + N)
	291	* \| `- direct node (5 + N => 5 + 2N - 1)
	292	* `- double indirect node (5 + 2N)
	293	* `- indirect node (6 + 2N)
4f4124d0 CY	294	* `- direct node
	295	* ......
	296	* `- indirect node ((6 + 2N) + x(N + 1))
	297	* `- direct node
	298	* ......
	299	* `- indirect node ((6 + 2N) + (N - 1)(N + 1))
	300	* `- direct node
39a53e0c JK	301	*/
	302	static inline bool IS_DNODE(struct page *node_page)
	303	{
	304	unsigned int ofs = ofs_of_node(node_page);
dbe6a5ff	305
4bc8e9bc	306	if (f2fs_has_xattr_block(ofs))
dbe6a5ff JK	307	return false;
dbe6a5ff JK	308
39a53e0c JK	309	if (ofs == 3 \|\| ofs == 4 + NIDS_PER_BLOCK \|\|
	310	ofs == 5 + 2 * NIDS_PER_BLOCK)
	311	return false;
	312	if (ofs >= 6 + 2 * NIDS_PER_BLOCK) {
	313	ofs -= 6 + 2 * NIDS_PER_BLOCK;
3315101f	314	if (!((long int)ofs % (NIDS_PER_BLOCK + 1)))
39a53e0c JK	315	return false;
	316	}
	317	return true;
	318	}
	319
	320	static inline void set_nid(struct page *p, int off, nid_t nid, bool i)
	321	{
45590710	322	struct f2fs_node *rn = F2FS_NODE(p);
39a53e0c	323
54b591df	324	f2fs_wait_on_page_writeback(p, NODE);
39a53e0c JK	325
	326	if (i)
	327	rn->i.i_nid[off - NODE_DIR1_BLOCK] = cpu_to_le32(nid);
	328	else
	329	rn->in.nid[off] = cpu_to_le32(nid);
	330	set_page_dirty(p);
	331	}
	332
	333	static inline nid_t get_nid(struct page *p, int off, bool i)
	334	{
45590710 GZ	335	struct f2fs_node *rn = F2FS_NODE(p);
45590710 GZ	336
39a53e0c JK	337	if (i)
	338	return le32_to_cpu(rn->i.i_nid[off - NODE_DIR1_BLOCK]);
	339	return le32_to_cpu(rn->in.nid[off]);
	340	}
	341
	342	/*
	343	* Coldness identification:
	344	* - Mark cold files in f2fs_inode_info
	345	* - Mark cold node blocks in their node footer
	346	* - Mark cold data pages in page cache
	347	*/
39a53e0c JK	348	static inline int is_cold_data(struct page *page)
	349	{
	350	return PageChecked(page);
	351	}
	352
	353	static inline void set_cold_data(struct page *page)
	354	{
	355	SetPageChecked(page);
	356	}
	357
	358	static inline void clear_cold_data(struct page *page)
	359	{
	360	ClearPageChecked(page);
	361	}
	362
a06a2416	363	static inline int is_node(struct page *page, int type)
39a53e0c	364	{
45590710	365	struct f2fs_node *rn = F2FS_NODE(page);
a06a2416	366	return le32_to_cpu(rn->footer.flag) & (1 << type);
39a53e0c JK	367	}
39a53e0c JK	368
a06a2416 NJ	369	#define is_cold_node(page) is_node(page, COLD_BIT_SHIFT)
	370	#define is_fsync_dnode(page) is_node(page, FSYNC_BIT_SHIFT)
	371	#define is_dent_dnode(page) is_node(page, DENT_BIT_SHIFT)
39a53e0c JK	372
	373	static inline void set_cold_node(struct inode inode, struct page page)
	374	{
45590710	375	struct f2fs_node *rn = F2FS_NODE(page);
39a53e0c JK	376	unsigned int flag = le32_to_cpu(rn->footer.flag);
	377
	378	if (S_ISDIR(inode->i_mode))
	379	flag &= ~(0x1 << COLD_BIT_SHIFT);
	380	else
	381	flag \|= (0x1 << COLD_BIT_SHIFT);
	382	rn->footer.flag = cpu_to_le32(flag);
	383	}
	384
a06a2416	385	static inline void set_mark(struct page *page, int mark, int type)
39a53e0c	386	{
45590710	387	struct f2fs_node *rn = F2FS_NODE(page);
39a53e0c JK	388	unsigned int flag = le32_to_cpu(rn->footer.flag);
39a53e0c JK	389	if (mark)
a06a2416	390	flag \|= (0x1 << type);
39a53e0c	391	else
a06a2416	392	flag &= ~(0x1 << type);
39a53e0c JK	393	rn->footer.flag = cpu_to_le32(flag);
39a53e0c JK	394	}
a06a2416 NJ	395	#define set_dentry_mark(page, mark) set_mark(page, mark, DENT_BIT_SHIFT)
a06a2416 NJ	396	#define set_fsync_mark(page, mark) set_mark(page, mark, FSYNC_BIT_SHIFT)