blob: bb53e9955ff2ab8456dd75c0d83ebdf9e6ef3b55 [file] [log] [blame]
Jaegeuk Kim0a8165d2012-11-29 13:28:09 +09001/*
Jaegeuk Kim39a53e02012-11-28 13:37:31 +09002 * 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 */
Tomohiro Kusumi68afcf22017-04-09 02:11:36 +030012#define START_NID(nid) (((nid) / NAT_ENTRY_PER_BLOCK) * NAT_ENTRY_PER_BLOCK)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090013
14/* node block offset on the NAT area dedicated to the given start node id */
Tomohiro Kusumi68afcf22017-04-09 02:11:36 +030015#define NAT_BLOCK_OFFSET(start_nid) ((start_nid) / NAT_ENTRY_PER_BLOCK)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090016
Chao Yuea1a29a02015-10-12 17:08:48 +080017/* # of pages to perform synchronous readahead before building free nids */
Jaegeuk Kimad4edb82016-06-16 16:41:49 -070018#define FREE_NID_PAGES 8
19#define MAX_FREE_NIDS (NAT_ENTRY_PER_BLOCK * FREE_NID_PAGES)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090020
Jaegeuk Kimad4edb82016-06-16 16:41:49 -070021#define DEF_RA_NID_PAGES 0 /* # of nid pages to be readaheaded */
Chao Yuea1a29a02015-10-12 17:08:48 +080022
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090023/* maximum readahead size for node during getting data blocks */
24#define MAX_RA_NODE 128
25
Jaegeuk Kimcdfc41c2014-03-19 13:31:37 +090026/* control the memory footprint threshold (10MB per 1GB ram) */
Jaegeuk Kim29710bc2016-06-02 15:26:27 -070027#define DEF_RAM_THRESHOLD 1
Jaegeuk Kimcdfc41c2014-03-19 13:31:37 +090028
Chao Yu7d768d22016-01-18 18:31:18 +080029/* control dirty nats ratio threshold (default: 10% over max nid count) */
30#define DEF_DIRTY_NAT_RATIO_THRESHOLD 10
Jaegeuk Kime589c2c2016-06-02 15:24:24 -070031/* control total # of nats */
32#define DEF_NAT_CACHE_THRESHOLD 100000
Chao Yu7d768d22016-01-18 18:31:18 +080033
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090034/* vector size for gang look-up from nat cache that consists of radix tree */
35#define NATVEC_SIZE 64
Jaegeuk Kim7aed0d42015-01-07 10:47:57 -080036#define SETVEC_SIZE 32
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090037
Jaegeuk Kim56ae6742013-03-31 12:47:20 +090038/* return value for read_node_page */
39#define LOCKED_PAGE 1
40
Chao Yu5c27f4e2014-12-18 17:37:21 +080041/* For flag in struct node_info */
42enum {
43 IS_CHECKPOINTED, /* is it checkpointed before? */
44 HAS_FSYNCED_INODE, /* is the inode fsynced before? */
45 HAS_LAST_FSYNC, /* has the latest node fsync mark? */
46 IS_DIRTY, /* this nat entry is dirty? */
47};
48
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090049/*
50 * For node information
51 */
52struct node_info {
53 nid_t nid; /* node id */
54 nid_t ino; /* inode number of the node's owner */
55 block_t blk_addr; /* block address of the node */
56 unsigned char version; /* version of the node */
Chao Yu5c27f4e2014-12-18 17:37:21 +080057 unsigned char flag; /* for node information bits */
Jaegeuk Kim7ef35e32014-09-15 12:07:13 -070058};
59
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090060struct nat_entry {
61 struct list_head list; /* for clean or dirty nat list */
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090062 struct node_info ni; /* in-memory node information */
63};
64
Tomohiro Kusumi68afcf22017-04-09 02:11:36 +030065#define nat_get_nid(nat) ((nat)->ni.nid)
66#define nat_set_nid(nat, n) ((nat)->ni.nid = (n))
67#define nat_get_blkaddr(nat) ((nat)->ni.blk_addr)
68#define nat_set_blkaddr(nat, b) ((nat)->ni.blk_addr = (b))
69#define nat_get_ino(nat) ((nat)->ni.ino)
70#define nat_set_ino(nat, i) ((nat)->ni.ino = (i))
71#define nat_get_version(nat) ((nat)->ni.version)
72#define nat_set_version(nat, v) ((nat)->ni.version = (v))
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090073
Tomohiro Kusumi68afcf22017-04-09 02:11:36 +030074#define inc_node_version(version) (++(version))
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090075
Chao Yu5c27f4e2014-12-18 17:37:21 +080076static inline void copy_node_info(struct node_info *dst,
77 struct node_info *src)
78{
79 dst->nid = src->nid;
80 dst->ino = src->ino;
81 dst->blk_addr = src->blk_addr;
82 dst->version = src->version;
83 /* should not copy flag here */
84}
85
Jaegeuk Kim7ef35e32014-09-15 12:07:13 -070086static inline void set_nat_flag(struct nat_entry *ne,
87 unsigned int type, bool set)
88{
89 unsigned char mask = 0x01 << type;
90 if (set)
Chao Yu5c27f4e2014-12-18 17:37:21 +080091 ne->ni.flag |= mask;
Jaegeuk Kim7ef35e32014-09-15 12:07:13 -070092 else
Chao Yu5c27f4e2014-12-18 17:37:21 +080093 ne->ni.flag &= ~mask;
Jaegeuk Kim7ef35e32014-09-15 12:07:13 -070094}
95
96static inline bool get_nat_flag(struct nat_entry *ne, unsigned int type)
97{
98 unsigned char mask = 0x01 << type;
Chao Yu5c27f4e2014-12-18 17:37:21 +080099 return ne->ni.flag & mask;
Jaegeuk Kim7ef35e32014-09-15 12:07:13 -0700100}
101
Jaegeuk Kim88bd02c2014-09-15 14:50:48 -0700102static inline void nat_reset_flag(struct nat_entry *ne)
103{
104 /* these states can be set only after checkpoint was done */
105 set_nat_flag(ne, IS_CHECKPOINTED, true);
106 set_nat_flag(ne, HAS_FSYNCED_INODE, false);
107 set_nat_flag(ne, HAS_LAST_FSYNC, true);
108}
109
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900110static inline void node_info_from_raw_nat(struct node_info *ni,
111 struct f2fs_nat_entry *raw_ne)
112{
113 ni->ino = le32_to_cpu(raw_ne->ino);
114 ni->blk_addr = le32_to_cpu(raw_ne->block_addr);
115 ni->version = raw_ne->version;
116}
117
Chao Yu94dac222014-04-17 10:51:05 +0800118static inline void raw_nat_from_node_info(struct f2fs_nat_entry *raw_ne,
119 struct node_info *ni)
120{
121 raw_ne->ino = cpu_to_le32(ni->ino);
122 raw_ne->block_addr = cpu_to_le32(ni->blk_addr);
123 raw_ne->version = ni->version;
124}
125
Chao Yu7d768d22016-01-18 18:31:18 +0800126static inline bool excess_dirty_nats(struct f2fs_sb_info *sbi)
127{
128 return NM_I(sbi)->dirty_nat_cnt >= NM_I(sbi)->max_nid *
Chao Yu2304cb02016-01-18 18:32:58 +0800129 NM_I(sbi)->dirty_nats_ratio / 100;
Chao Yu7d768d22016-01-18 18:31:18 +0800130}
131
Jaegeuk Kime589c2c2016-06-02 15:24:24 -0700132static inline bool excess_cached_nats(struct f2fs_sb_info *sbi)
133{
134 return NM_I(sbi)->nat_cnt >= DEF_NAT_CACHE_THRESHOLD;
135}
136
Jaegeuk Kim6fb03f32014-04-16 10:47:06 +0900137enum mem_type {
Jaegeuk Kimcdfc41c2014-03-19 13:31:37 +0900138 FREE_NIDS, /* indicates the free nid list */
Jaegeuk Kim6fb03f32014-04-16 10:47:06 +0900139 NAT_ENTRIES, /* indicates the cached nat entry */
Jaegeuk Kima1257022015-10-08 10:40:07 -0700140 DIRTY_DENTS, /* indicates dirty dentry pages */
Jaegeuk Kime5e7ea32014-11-06 15:24:46 -0800141 INO_ENTRIES, /* indicates inode entries */
Chao Yu13054c52015-02-05 17:52:58 +0800142 EXTENT_CACHE, /* indicates extent cache */
Jaegeuk Kim1e843712014-12-09 06:08:59 -0800143 BASE_CHECK, /* check kernel status */
Jaegeuk Kimcdfc41c2014-03-19 13:31:37 +0900144};
145
Chao Yuaec71382014-06-24 09:18:20 +0800146struct nat_entry_set {
Jaegeuk Kim309cc2b2014-09-22 11:40:48 -0700147 struct list_head set_list; /* link with other nat sets */
Chao Yuaec71382014-06-24 09:18:20 +0800148 struct list_head entry_list; /* link with dirty nat entries */
Jaegeuk Kim309cc2b2014-09-22 11:40:48 -0700149 nid_t set; /* set number*/
Chao Yuaec71382014-06-24 09:18:20 +0800150 unsigned int entry_cnt; /* the # of nat entries in set */
151};
152
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900153/*
154 * For free nid mangement
155 */
156enum nid_state {
157 NID_NEW, /* newly added to free nid list */
158 NID_ALLOC /* it is allocated */
159};
160
161struct free_nid {
162 struct list_head list; /* for free node id list */
163 nid_t nid; /* node id */
164 int state; /* in use or not: NID_NEW or NID_ALLOC */
165};
166
Jaegeuk Kim120c2cb2014-10-03 15:12:42 -0700167static inline void next_free_nid(struct f2fs_sb_info *sbi, nid_t *nid)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900168{
169 struct f2fs_nm_info *nm_i = NM_I(sbi);
170 struct free_nid *fnid;
171
Chao Yub8559dc2016-10-12 19:28:29 +0800172 spin_lock(&nm_i->nid_list_lock);
173 if (nm_i->nid_cnt[FREE_NID_LIST] <= 0) {
174 spin_unlock(&nm_i->nid_list_lock);
Jaegeuk Kim120c2cb2014-10-03 15:12:42 -0700175 return;
Huang Yingc6e48932014-09-12 19:21:11 +0800176 }
Chao Yu939afa92017-01-07 18:49:42 +0800177 fnid = list_first_entry(&nm_i->nid_list[FREE_NID_LIST],
Chao Yub8559dc2016-10-12 19:28:29 +0800178 struct free_nid, list);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900179 *nid = fnid->nid;
Chao Yub8559dc2016-10-12 19:28:29 +0800180 spin_unlock(&nm_i->nid_list_lock);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900181}
182
183/*
184 * inline functions
185 */
186static inline void get_nat_bitmap(struct f2fs_sb_info *sbi, void *addr)
187{
188 struct f2fs_nm_info *nm_i = NM_I(sbi);
Chao Yu599a09b2017-01-07 18:52:01 +0800189
190#ifdef CONFIG_F2FS_CHECK_FS
191 if (memcmp(nm_i->nat_bitmap, nm_i->nat_bitmap_mir,
192 nm_i->bitmap_size))
193 f2fs_bug_on(sbi, 1);
194#endif
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900195 memcpy(addr, nm_i->nat_bitmap, nm_i->bitmap_size);
196}
197
198static inline pgoff_t current_nat_addr(struct f2fs_sb_info *sbi, nid_t start)
199{
200 struct f2fs_nm_info *nm_i = NM_I(sbi);
201 pgoff_t block_off;
202 pgoff_t block_addr;
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900203
Fan Li8a6aa322017-03-08 13:39:16 +0800204 /*
205 * block_off = segment_off * 512 + off_in_segment
206 * OLD = (segment_off * 512) * 2 + off_in_segment
207 * NEW = 2 * (segment_off * 512 + off_in_segment) - off_in_segment
208 */
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900209 block_off = NAT_BLOCK_OFFSET(start);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900210
211 block_addr = (pgoff_t)(nm_i->nat_blkaddr +
Fan Li8a6aa322017-03-08 13:39:16 +0800212 (block_off << 1) -
Chao Yu3519e3f2015-12-01 11:56:52 +0800213 (block_off & (sbi->blocks_per_seg - 1)));
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900214
215 if (f2fs_test_bit(block_off, nm_i->nat_bitmap))
216 block_addr += sbi->blocks_per_seg;
217
218 return block_addr;
219}
220
221static inline pgoff_t next_nat_addr(struct f2fs_sb_info *sbi,
222 pgoff_t block_addr)
223{
224 struct f2fs_nm_info *nm_i = NM_I(sbi);
225
226 block_addr -= nm_i->nat_blkaddr;
Fan Li72fdbe22017-06-02 15:45:42 +0800227 block_addr ^= 1 << sbi->log_blocks_per_seg;
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900228 return block_addr + nm_i->nat_blkaddr;
229}
230
231static inline void set_to_next_nat(struct f2fs_nm_info *nm_i, nid_t start_nid)
232{
233 unsigned int block_off = NAT_BLOCK_OFFSET(start_nid);
234
Gu Zhengc6ac4c02014-10-20 17:45:50 +0800235 f2fs_change_bit(block_off, nm_i->nat_bitmap);
Chao Yu599a09b2017-01-07 18:52:01 +0800236#ifdef CONFIG_F2FS_CHECK_FS
237 f2fs_change_bit(block_off, nm_i->nat_bitmap_mir);
238#endif
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900239}
240
Jaegeuk Kima468f0e2016-09-19 17:55:10 -0700241static inline nid_t ino_of_node(struct page *node_page)
242{
243 struct f2fs_node *rn = F2FS_NODE(node_page);
244 return le32_to_cpu(rn->footer.ino);
245}
246
247static inline nid_t nid_of_node(struct page *node_page)
248{
249 struct f2fs_node *rn = F2FS_NODE(node_page);
250 return le32_to_cpu(rn->footer.nid);
251}
252
253static inline unsigned int ofs_of_node(struct page *node_page)
254{
255 struct f2fs_node *rn = F2FS_NODE(node_page);
256 unsigned flag = le32_to_cpu(rn->footer.flag);
257 return flag >> OFFSET_BIT_SHIFT;
258}
259
260static inline __u64 cpver_of_node(struct page *node_page)
261{
262 struct f2fs_node *rn = F2FS_NODE(node_page);
263 return le64_to_cpu(rn->footer.cp_ver);
264}
265
266static inline block_t next_blkaddr_of_node(struct page *node_page)
267{
268 struct f2fs_node *rn = F2FS_NODE(node_page);
269 return le32_to_cpu(rn->footer.next_blkaddr);
270}
271
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900272static inline void fill_node_footer(struct page *page, nid_t nid,
273 nid_t ino, unsigned int ofs, bool reset)
274{
Gu Zheng45590712013-07-15 17:57:38 +0800275 struct f2fs_node *rn = F2FS_NODE(page);
Jaegeuk Kim09eb4832014-12-23 16:26:31 -0800276 unsigned int old_flag = 0;
277
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900278 if (reset)
279 memset(rn, 0, sizeof(*rn));
Jaegeuk Kim09eb4832014-12-23 16:26:31 -0800280 else
281 old_flag = le32_to_cpu(rn->footer.flag);
282
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900283 rn->footer.nid = cpu_to_le32(nid);
284 rn->footer.ino = cpu_to_le32(ino);
Jaegeuk Kim09eb4832014-12-23 16:26:31 -0800285
286 /* should remain old flag bits such as COLD_BIT_SHIFT */
287 rn->footer.flag = cpu_to_le32((ofs << OFFSET_BIT_SHIFT) |
288 (old_flag & OFFSET_BIT_MASK));
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900289}
290
291static inline void copy_node_footer(struct page *dst, struct page *src)
292{
Gu Zheng45590712013-07-15 17:57:38 +0800293 struct f2fs_node *src_rn = F2FS_NODE(src);
294 struct f2fs_node *dst_rn = F2FS_NODE(dst);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900295 memcpy(&dst_rn->footer, &src_rn->footer, sizeof(struct node_footer));
296}
297
298static inline void fill_node_footer_blkaddr(struct page *page, block_t blkaddr)
299{
Jaegeuk Kim40813632014-09-02 15:31:18 -0700300 struct f2fs_checkpoint *ckpt = F2FS_CKPT(F2FS_P_SB(page));
Gu Zheng45590712013-07-15 17:57:38 +0800301 struct f2fs_node *rn = F2FS_NODE(page);
Kinglong Meeced2c7e2017-02-25 19:53:39 +0800302 __u64 cp_ver = cur_cp_version(ckpt);
Gu Zheng45590712013-07-15 17:57:38 +0800303
Kinglong Meeced2c7e2017-02-25 19:53:39 +0800304 if (__is_set_ckpt_flags(ckpt, CP_CRC_RECOVERY_FLAG))
305 cp_ver |= (cur_cp_crc(ckpt) << 32);
306
Jaegeuk Kima468f0e2016-09-19 17:55:10 -0700307 rn->footer.cp_ver = cpu_to_le64(cp_ver);
Jaegeuk Kim25ca9232012-11-28 16:12:41 +0900308 rn->footer.next_blkaddr = cpu_to_le32(blkaddr);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900309}
310
Jaegeuk Kima468f0e2016-09-19 17:55:10 -0700311static inline bool is_recoverable_dnode(struct page *page)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900312{
Jaegeuk Kima468f0e2016-09-19 17:55:10 -0700313 struct f2fs_checkpoint *ckpt = F2FS_CKPT(F2FS_P_SB(page));
Jaegeuk Kima468f0e2016-09-19 17:55:10 -0700314 __u64 cp_ver = cur_cp_version(ckpt);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900315
Kinglong Meeced2c7e2017-02-25 19:53:39 +0800316 if (__is_set_ckpt_flags(ckpt, CP_CRC_RECOVERY_FLAG))
317 cp_ver |= (cur_cp_crc(ckpt) << 32);
318
Eric Biggers0c0b4712016-10-11 10:36:12 -0700319 return cp_ver == cpver_of_node(page);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900320}
321
322/*
323 * f2fs assigns the following node offsets described as (num).
324 * N = NIDS_PER_BLOCK
325 *
326 * Inode block (0)
327 * |- direct node (1)
328 * |- direct node (2)
329 * |- indirect node (3)
330 * | `- direct node (4 => 4 + N - 1)
331 * |- indirect node (4 + N)
332 * | `- direct node (5 + N => 5 + 2N - 1)
333 * `- double indirect node (5 + 2N)
334 * `- indirect node (6 + 2N)
Chao Yu4f4124d2013-12-21 18:02:14 +0800335 * `- direct node
336 * ......
337 * `- indirect node ((6 + 2N) + x(N + 1))
338 * `- direct node
339 * ......
340 * `- indirect node ((6 + 2N) + (N - 1)(N + 1))
341 * `- direct node
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900342 */
343static inline bool IS_DNODE(struct page *node_page)
344{
345 unsigned int ofs = ofs_of_node(node_page);
Jaegeuk Kimdbe6a5f2013-08-09 08:14:06 +0900346
Chao Yu4bc8e9b2014-03-17 16:35:06 +0800347 if (f2fs_has_xattr_block(ofs))
Chao Yud2600812017-02-08 17:39:45 +0800348 return true;
Jaegeuk Kimdbe6a5f2013-08-09 08:14:06 +0900349
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900350 if (ofs == 3 || ofs == 4 + NIDS_PER_BLOCK ||
351 ofs == 5 + 2 * NIDS_PER_BLOCK)
352 return false;
353 if (ofs >= 6 + 2 * NIDS_PER_BLOCK) {
354 ofs -= 6 + 2 * NIDS_PER_BLOCK;
Zhihui Zhang33151012013-04-07 12:57:04 -0400355 if (!((long int)ofs % (NIDS_PER_BLOCK + 1)))
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900356 return false;
357 }
358 return true;
359}
360
Jaegeuk Kim12719ae2016-01-07 13:23:12 -0800361static inline int set_nid(struct page *p, int off, nid_t nid, bool i)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900362{
Gu Zheng45590712013-07-15 17:57:38 +0800363 struct f2fs_node *rn = F2FS_NODE(p);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900364
Jaegeuk Kimfec1d652016-01-20 23:43:51 +0800365 f2fs_wait_on_page_writeback(p, NODE, true);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900366
367 if (i)
368 rn->i.i_nid[off - NODE_DIR1_BLOCK] = cpu_to_le32(nid);
369 else
370 rn->in.nid[off] = cpu_to_le32(nid);
Jaegeuk Kim12719ae2016-01-07 13:23:12 -0800371 return set_page_dirty(p);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900372}
373
374static inline nid_t get_nid(struct page *p, int off, bool i)
375{
Gu Zheng45590712013-07-15 17:57:38 +0800376 struct f2fs_node *rn = F2FS_NODE(p);
377
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900378 if (i)
379 return le32_to_cpu(rn->i.i_nid[off - NODE_DIR1_BLOCK]);
380 return le32_to_cpu(rn->in.nid[off]);
381}
382
383/*
384 * Coldness identification:
385 * - Mark cold files in f2fs_inode_info
386 * - Mark cold node blocks in their node footer
387 * - Mark cold data pages in page cache
388 */
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900389static inline int is_cold_data(struct page *page)
390{
391 return PageChecked(page);
392}
393
394static inline void set_cold_data(struct page *page)
395{
396 SetPageChecked(page);
397}
398
399static inline void clear_cold_data(struct page *page)
400{
401 ClearPageChecked(page);
402}
403
Namjae Jeona06a2412013-05-23 22:58:40 +0900404static inline int is_node(struct page *page, int type)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900405{
Gu Zheng45590712013-07-15 17:57:38 +0800406 struct f2fs_node *rn = F2FS_NODE(page);
Namjae Jeona06a2412013-05-23 22:58:40 +0900407 return le32_to_cpu(rn->footer.flag) & (1 << type);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900408}
409
Namjae Jeona06a2412013-05-23 22:58:40 +0900410#define is_cold_node(page) is_node(page, COLD_BIT_SHIFT)
411#define is_fsync_dnode(page) is_node(page, FSYNC_BIT_SHIFT)
412#define is_dent_dnode(page) is_node(page, DENT_BIT_SHIFT)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900413
Jaegeuk Kim2049d4f2016-01-25 05:57:05 -0800414static inline int is_inline_node(struct page *page)
415{
416 return PageChecked(page);
417}
418
419static inline void set_inline_node(struct page *page)
420{
421 SetPageChecked(page);
422}
423
424static inline void clear_inline_node(struct page *page)
425{
426 ClearPageChecked(page);
427}
428
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900429static inline void set_cold_node(struct inode *inode, struct page *page)
430{
Gu Zheng45590712013-07-15 17:57:38 +0800431 struct f2fs_node *rn = F2FS_NODE(page);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900432 unsigned int flag = le32_to_cpu(rn->footer.flag);
433
434 if (S_ISDIR(inode->i_mode))
435 flag &= ~(0x1 << COLD_BIT_SHIFT);
436 else
437 flag |= (0x1 << COLD_BIT_SHIFT);
438 rn->footer.flag = cpu_to_le32(flag);
439}
440
Namjae Jeona06a2412013-05-23 22:58:40 +0900441static inline void set_mark(struct page *page, int mark, int type)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900442{
Gu Zheng45590712013-07-15 17:57:38 +0800443 struct f2fs_node *rn = F2FS_NODE(page);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900444 unsigned int flag = le32_to_cpu(rn->footer.flag);
445 if (mark)
Namjae Jeona06a2412013-05-23 22:58:40 +0900446 flag |= (0x1 << type);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900447 else
Namjae Jeona06a2412013-05-23 22:58:40 +0900448 flag &= ~(0x1 << type);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900449 rn->footer.flag = cpu_to_le32(flag);
450}
Namjae Jeona06a2412013-05-23 22:58:40 +0900451#define set_dentry_mark(page, mark) set_mark(page, mark, DENT_BIT_SHIFT)
452#define set_fsync_mark(page, mark) set_mark(page, mark, FSYNC_BIT_SHIFT)