blob: e05af5df56485eff71c95f58b5d3f877cbcb8e53 [file] [log] [blame]
Chao Yu6d1a8322018-09-12 09:16:07 +08001// SPDX-License-Identifier: GPL-2.0
Jaegeuk Kim0a8165d2012-11-29 13:28:09 +09002/*
Jaegeuk Kim39a53e02012-11-28 13:37:31 +09003 * fs/f2fs/node.h
4 *
5 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
6 * http://www.samsung.com/
Jaegeuk Kim39a53e02012-11-28 13:37:31 +09007 */
8/* start node id of a node block dedicated to the given node id */
Jaegeuk Kime6b120d2017-07-10 12:55:09 -07009#define START_NID(nid) (((nid) / NAT_ENTRY_PER_BLOCK) * NAT_ENTRY_PER_BLOCK)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090010
11/* node block offset on the NAT area dedicated to the given start node id */
Jaegeuk Kime6b120d2017-07-10 12:55:09 -070012#define NAT_BLOCK_OFFSET(start_nid) ((start_nid) / NAT_ENTRY_PER_BLOCK)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090013
Chao Yuea1a29a02015-10-12 17:08:48 +080014/* # of pages to perform synchronous readahead before building free nids */
Jaegeuk Kimad4edb82016-06-16 16:41:49 -070015#define FREE_NID_PAGES 8
16#define MAX_FREE_NIDS (NAT_ENTRY_PER_BLOCK * FREE_NID_PAGES)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090017
Jaegeuk Kimad4edb82016-06-16 16:41:49 -070018#define DEF_RA_NID_PAGES 0 /* # of nid pages to be readaheaded */
Chao Yuea1a29a02015-10-12 17:08:48 +080019
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090020/* maximum readahead size for node during getting data blocks */
21#define MAX_RA_NODE 128
22
Jaegeuk Kimcdfc41c2014-03-19 13:31:37 +090023/* control the memory footprint threshold (10MB per 1GB ram) */
Jaegeuk Kim29710bc2016-06-02 15:26:27 -070024#define DEF_RAM_THRESHOLD 1
Jaegeuk Kimcdfc41c2014-03-19 13:31:37 +090025
Chao Yu7d768d22016-01-18 18:31:18 +080026/* control dirty nats ratio threshold (default: 10% over max nid count) */
27#define DEF_DIRTY_NAT_RATIO_THRESHOLD 10
Jaegeuk Kime589c2c2016-06-02 15:24:24 -070028/* control total # of nats */
29#define DEF_NAT_CACHE_THRESHOLD 100000
Chao Yu7d768d22016-01-18 18:31:18 +080030
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090031/* vector size for gang look-up from nat cache that consists of radix tree */
32#define NATVEC_SIZE 64
Jaegeuk Kim7aed0d42015-01-07 10:47:57 -080033#define SETVEC_SIZE 32
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090034
Jaegeuk Kim56ae6742013-03-31 12:47:20 +090035/* return value for read_node_page */
36#define LOCKED_PAGE 1
37
Chao Yu5c27f4e2014-12-18 17:37:21 +080038/* For flag in struct node_info */
39enum {
40 IS_CHECKPOINTED, /* is it checkpointed before? */
41 HAS_FSYNCED_INODE, /* is the inode fsynced before? */
42 HAS_LAST_FSYNC, /* has the latest node fsync mark? */
43 IS_DIRTY, /* this nat entry is dirty? */
Chao Yu83b9bb92018-03-20 23:08:30 +080044 IS_PREALLOC, /* nat entry is preallocated */
Chao Yu5c27f4e2014-12-18 17:37:21 +080045};
46
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090047/*
48 * For node information
49 */
50struct node_info {
51 nid_t nid; /* node id */
52 nid_t ino; /* inode number of the node's owner */
53 block_t blk_addr; /* block address of the node */
54 unsigned char version; /* version of the node */
Chao Yu5c27f4e2014-12-18 17:37:21 +080055 unsigned char flag; /* for node information bits */
Jaegeuk Kim7ef35e32014-09-15 12:07:13 -070056};
57
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090058struct nat_entry {
59 struct list_head list; /* for clean or dirty nat list */
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090060 struct node_info ni; /* in-memory node information */
61};
62
Jaegeuk Kime6b120d2017-07-10 12:55:09 -070063#define nat_get_nid(nat) ((nat)->ni.nid)
64#define nat_set_nid(nat, n) ((nat)->ni.nid = (n))
65#define nat_get_blkaddr(nat) ((nat)->ni.blk_addr)
66#define nat_set_blkaddr(nat, b) ((nat)->ni.blk_addr = (b))
67#define nat_get_ino(nat) ((nat)->ni.ino)
68#define nat_set_ino(nat, i) ((nat)->ni.ino = (i))
69#define nat_get_version(nat) ((nat)->ni.version)
70#define nat_set_version(nat, v) ((nat)->ni.version = (v))
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090071
Jaegeuk Kime6b120d2017-07-10 12:55:09 -070072#define inc_node_version(version) (++(version))
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090073
Chao Yu5c27f4e2014-12-18 17:37:21 +080074static inline void copy_node_info(struct node_info *dst,
75 struct node_info *src)
76{
77 dst->nid = src->nid;
78 dst->ino = src->ino;
79 dst->blk_addr = src->blk_addr;
80 dst->version = src->version;
81 /* should not copy flag here */
82}
83
Jaegeuk Kim7ef35e32014-09-15 12:07:13 -070084static inline void set_nat_flag(struct nat_entry *ne,
85 unsigned int type, bool set)
86{
87 unsigned char mask = 0x01 << type;
88 if (set)
Chao Yu5c27f4e2014-12-18 17:37:21 +080089 ne->ni.flag |= mask;
Jaegeuk Kim7ef35e32014-09-15 12:07:13 -070090 else
Chao Yu5c27f4e2014-12-18 17:37:21 +080091 ne->ni.flag &= ~mask;
Jaegeuk Kim7ef35e32014-09-15 12:07:13 -070092}
93
94static inline bool get_nat_flag(struct nat_entry *ne, unsigned int type)
95{
96 unsigned char mask = 0x01 << type;
Chao Yu5c27f4e2014-12-18 17:37:21 +080097 return ne->ni.flag & mask;
Jaegeuk Kim7ef35e32014-09-15 12:07:13 -070098}
99
Jaegeuk Kim88bd02c2014-09-15 14:50:48 -0700100static inline void nat_reset_flag(struct nat_entry *ne)
101{
102 /* these states can be set only after checkpoint was done */
103 set_nat_flag(ne, IS_CHECKPOINTED, true);
104 set_nat_flag(ne, HAS_FSYNCED_INODE, false);
105 set_nat_flag(ne, HAS_LAST_FSYNC, true);
106}
107
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900108static inline void node_info_from_raw_nat(struct node_info *ni,
109 struct f2fs_nat_entry *raw_ne)
110{
111 ni->ino = le32_to_cpu(raw_ne->ino);
112 ni->blk_addr = le32_to_cpu(raw_ne->block_addr);
113 ni->version = raw_ne->version;
114}
115
Chao Yu94dac222014-04-17 10:51:05 +0800116static inline void raw_nat_from_node_info(struct f2fs_nat_entry *raw_ne,
117 struct node_info *ni)
118{
119 raw_ne->ino = cpu_to_le32(ni->ino);
120 raw_ne->block_addr = cpu_to_le32(ni->blk_addr);
121 raw_ne->version = ni->version;
122}
123
Chao Yu7d768d22016-01-18 18:31:18 +0800124static inline bool excess_dirty_nats(struct f2fs_sb_info *sbi)
125{
126 return NM_I(sbi)->dirty_nat_cnt >= NM_I(sbi)->max_nid *
Chao Yu2304cb02016-01-18 18:32:58 +0800127 NM_I(sbi)->dirty_nats_ratio / 100;
Chao Yu7d768d22016-01-18 18:31:18 +0800128}
129
Jaegeuk Kime589c2c2016-06-02 15:24:24 -0700130static inline bool excess_cached_nats(struct f2fs_sb_info *sbi)
131{
132 return NM_I(sbi)->nat_cnt >= DEF_NAT_CACHE_THRESHOLD;
133}
134
Chao Yu5cf8d7b2018-07-25 19:16:21 +0800135static inline bool excess_dirty_nodes(struct f2fs_sb_info *sbi)
136{
137 return get_pages(sbi, F2FS_DIRTY_NODES) >= sbi->blocks_per_seg * 8;
138}
139
Jaegeuk Kim6fb03f32014-04-16 10:47:06 +0900140enum mem_type {
Jaegeuk Kimcdfc41c2014-03-19 13:31:37 +0900141 FREE_NIDS, /* indicates the free nid list */
Jaegeuk Kim6fb03f32014-04-16 10:47:06 +0900142 NAT_ENTRIES, /* indicates the cached nat entry */
Jaegeuk Kima1257022015-10-08 10:40:07 -0700143 DIRTY_DENTS, /* indicates dirty dentry pages */
Jaegeuk Kime5e7ea32014-11-06 15:24:46 -0800144 INO_ENTRIES, /* indicates inode entries */
Chao Yu13054c52015-02-05 17:52:58 +0800145 EXTENT_CACHE, /* indicates extent cache */
Jaegeuk Kim35e13ca2017-10-18 19:05:57 -0700146 INMEM_PAGES, /* indicates inmemory pages */
Jaegeuk Kim1e843712014-12-09 06:08:59 -0800147 BASE_CHECK, /* check kernel status */
Jaegeuk Kimcdfc41c2014-03-19 13:31:37 +0900148};
149
Chao Yuaec71382014-06-24 09:18:20 +0800150struct nat_entry_set {
Jaegeuk Kim309cc2b2014-09-22 11:40:48 -0700151 struct list_head set_list; /* link with other nat sets */
Chao Yuaec71382014-06-24 09:18:20 +0800152 struct list_head entry_list; /* link with dirty nat entries */
Jaegeuk Kim309cc2b2014-09-22 11:40:48 -0700153 nid_t set; /* set number*/
Chao Yuaec71382014-06-24 09:18:20 +0800154 unsigned int entry_cnt; /* the # of nat entries in set */
155};
156
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900157struct free_nid {
158 struct list_head list; /* for free node id list */
159 nid_t nid; /* node id */
Chao Yu84af6ae2017-09-29 13:59:35 +0800160 int state; /* in use or not: FREE_NID or PREALLOC_NID */
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900161};
162
Jaegeuk Kim120c2cb2014-10-03 15:12:42 -0700163static inline void next_free_nid(struct f2fs_sb_info *sbi, nid_t *nid)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900164{
165 struct f2fs_nm_info *nm_i = NM_I(sbi);
166 struct free_nid *fnid;
167
Jaegeuk Kime6b120d2017-07-10 12:55:09 -0700168 spin_lock(&nm_i->nid_list_lock);
Chao Yu84af6ae2017-09-29 13:59:35 +0800169 if (nm_i->nid_cnt[FREE_NID] <= 0) {
Jaegeuk Kime6b120d2017-07-10 12:55:09 -0700170 spin_unlock(&nm_i->nid_list_lock);
Jaegeuk Kim120c2cb2014-10-03 15:12:42 -0700171 return;
Huang Yingc6e48932014-09-12 19:21:11 +0800172 }
Chao Yu84af6ae2017-09-29 13:59:35 +0800173 fnid = list_first_entry(&nm_i->free_nid_list, struct free_nid, list);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900174 *nid = fnid->nid;
Jaegeuk Kime6b120d2017-07-10 12:55:09 -0700175 spin_unlock(&nm_i->nid_list_lock);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900176}
177
178/*
179 * inline functions
180 */
181static inline void get_nat_bitmap(struct f2fs_sb_info *sbi, void *addr)
182{
183 struct f2fs_nm_info *nm_i = NM_I(sbi);
Jaegeuk Kime6b120d2017-07-10 12:55:09 -0700184
185#ifdef CONFIG_F2FS_CHECK_FS
186 if (memcmp(nm_i->nat_bitmap, nm_i->nat_bitmap_mir,
187 nm_i->bitmap_size))
188 f2fs_bug_on(sbi, 1);
189#endif
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900190 memcpy(addr, nm_i->nat_bitmap, nm_i->bitmap_size);
191}
192
193static inline pgoff_t current_nat_addr(struct f2fs_sb_info *sbi, nid_t start)
194{
195 struct f2fs_nm_info *nm_i = NM_I(sbi);
196 pgoff_t block_off;
197 pgoff_t block_addr;
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900198
Jaegeuk Kime6b120d2017-07-10 12:55:09 -0700199 /*
200 * block_off = segment_off * 512 + off_in_segment
201 * OLD = (segment_off * 512) * 2 + off_in_segment
202 * NEW = 2 * (segment_off * 512 + off_in_segment) - off_in_segment
203 */
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900204 block_off = NAT_BLOCK_OFFSET(start);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900205
206 block_addr = (pgoff_t)(nm_i->nat_blkaddr +
Jaegeuk Kime6b120d2017-07-10 12:55:09 -0700207 (block_off << 1) -
Chao Yu3519e3f2015-12-01 11:56:52 +0800208 (block_off & (sbi->blocks_per_seg - 1)));
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900209
210 if (f2fs_test_bit(block_off, nm_i->nat_bitmap))
211 block_addr += sbi->blocks_per_seg;
212
213 return block_addr;
214}
215
216static inline pgoff_t next_nat_addr(struct f2fs_sb_info *sbi,
217 pgoff_t block_addr)
218{
219 struct f2fs_nm_info *nm_i = NM_I(sbi);
220
221 block_addr -= nm_i->nat_blkaddr;
Fan Lie1e16f02017-06-02 15:45:42 +0800222 block_addr ^= 1 << sbi->log_blocks_per_seg;
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900223 return block_addr + nm_i->nat_blkaddr;
224}
225
226static inline void set_to_next_nat(struct f2fs_nm_info *nm_i, nid_t start_nid)
227{
228 unsigned int block_off = NAT_BLOCK_OFFSET(start_nid);
229
Gu Zhengc6ac4c02014-10-20 17:45:50 +0800230 f2fs_change_bit(block_off, nm_i->nat_bitmap);
Jaegeuk Kime6b120d2017-07-10 12:55:09 -0700231#ifdef CONFIG_F2FS_CHECK_FS
232 f2fs_change_bit(block_off, nm_i->nat_bitmap_mir);
233#endif
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900234}
235
Jaegeuk Kima468f0e2016-09-19 17:55:10 -0700236static inline nid_t ino_of_node(struct page *node_page)
237{
238 struct f2fs_node *rn = F2FS_NODE(node_page);
239 return le32_to_cpu(rn->footer.ino);
240}
241
242static inline nid_t nid_of_node(struct page *node_page)
243{
244 struct f2fs_node *rn = F2FS_NODE(node_page);
245 return le32_to_cpu(rn->footer.nid);
246}
247
248static inline unsigned int ofs_of_node(struct page *node_page)
249{
250 struct f2fs_node *rn = F2FS_NODE(node_page);
251 unsigned flag = le32_to_cpu(rn->footer.flag);
252 return flag >> OFFSET_BIT_SHIFT;
253}
254
255static inline __u64 cpver_of_node(struct page *node_page)
256{
257 struct f2fs_node *rn = F2FS_NODE(node_page);
258 return le64_to_cpu(rn->footer.cp_ver);
259}
260
261static inline block_t next_blkaddr_of_node(struct page *node_page)
262{
263 struct f2fs_node *rn = F2FS_NODE(node_page);
264 return le32_to_cpu(rn->footer.next_blkaddr);
265}
266
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900267static inline void fill_node_footer(struct page *page, nid_t nid,
268 nid_t ino, unsigned int ofs, bool reset)
269{
Gu Zheng45590712013-07-15 17:57:38 +0800270 struct f2fs_node *rn = F2FS_NODE(page);
Jaegeuk Kim09eb4832014-12-23 16:26:31 -0800271 unsigned int old_flag = 0;
272
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900273 if (reset)
274 memset(rn, 0, sizeof(*rn));
Jaegeuk Kim09eb4832014-12-23 16:26:31 -0800275 else
276 old_flag = le32_to_cpu(rn->footer.flag);
277
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900278 rn->footer.nid = cpu_to_le32(nid);
279 rn->footer.ino = cpu_to_le32(ino);
Jaegeuk Kim09eb4832014-12-23 16:26:31 -0800280
281 /* should remain old flag bits such as COLD_BIT_SHIFT */
282 rn->footer.flag = cpu_to_le32((ofs << OFFSET_BIT_SHIFT) |
283 (old_flag & OFFSET_BIT_MASK));
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900284}
285
286static inline void copy_node_footer(struct page *dst, struct page *src)
287{
Gu Zheng45590712013-07-15 17:57:38 +0800288 struct f2fs_node *src_rn = F2FS_NODE(src);
289 struct f2fs_node *dst_rn = F2FS_NODE(dst);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900290 memcpy(&dst_rn->footer, &src_rn->footer, sizeof(struct node_footer));
291}
292
293static inline void fill_node_footer_blkaddr(struct page *page, block_t blkaddr)
294{
Jaegeuk Kim40813632014-09-02 15:31:18 -0700295 struct f2fs_checkpoint *ckpt = F2FS_CKPT(F2FS_P_SB(page));
Gu Zheng45590712013-07-15 17:57:38 +0800296 struct f2fs_node *rn = F2FS_NODE(page);
Jaegeuk Kime6b120d2017-07-10 12:55:09 -0700297 __u64 cp_ver = cur_cp_version(ckpt);
Gu Zheng45590712013-07-15 17:57:38 +0800298
Jaegeuk Kime6b120d2017-07-10 12:55:09 -0700299 if (__is_set_ckpt_flags(ckpt, CP_CRC_RECOVERY_FLAG))
300 cp_ver |= (cur_cp_crc(ckpt) << 32);
301
Jaegeuk Kima468f0e2016-09-19 17:55:10 -0700302 rn->footer.cp_ver = cpu_to_le64(cp_ver);
Jaegeuk Kim25ca9232012-11-28 16:12:41 +0900303 rn->footer.next_blkaddr = cpu_to_le32(blkaddr);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900304}
305
Jaegeuk Kima468f0e2016-09-19 17:55:10 -0700306static inline bool is_recoverable_dnode(struct page *page)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900307{
Jaegeuk Kima468f0e2016-09-19 17:55:10 -0700308 struct f2fs_checkpoint *ckpt = F2FS_CKPT(F2FS_P_SB(page));
Jaegeuk Kima468f0e2016-09-19 17:55:10 -0700309 __u64 cp_ver = cur_cp_version(ckpt);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900310
Jaegeuk Kim111e8452018-01-19 13:42:33 -0800311 /* Don't care crc part, if fsck.f2fs sets it. */
312 if (__is_set_ckpt_flags(ckpt, CP_NOCRC_RECOVERY_FLAG))
313 return (cp_ver << 32) == (cpver_of_node(page) << 32);
314
Jaegeuk Kime6b120d2017-07-10 12:55:09 -0700315 if (__is_set_ckpt_flags(ckpt, CP_CRC_RECOVERY_FLAG))
316 cp_ver |= (cur_cp_crc(ckpt) << 32);
317
318 return cp_ver == cpver_of_node(page);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900319}
320
321/*
322 * f2fs assigns the following node offsets described as (num).
323 * N = NIDS_PER_BLOCK
324 *
325 * Inode block (0)
326 * |- direct node (1)
327 * |- direct node (2)
328 * |- indirect node (3)
329 * | `- direct node (4 => 4 + N - 1)
330 * |- indirect node (4 + N)
331 * | `- direct node (5 + N => 5 + 2N - 1)
332 * `- double indirect node (5 + 2N)
333 * `- indirect node (6 + 2N)
Chao Yu4f4124d2013-12-21 18:02:14 +0800334 * `- direct node
335 * ......
336 * `- indirect node ((6 + 2N) + x(N + 1))
337 * `- direct node
338 * ......
339 * `- indirect node ((6 + 2N) + (N - 1)(N + 1))
340 * `- direct node
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900341 */
342static inline bool IS_DNODE(struct page *node_page)
343{
344 unsigned int ofs = ofs_of_node(node_page);
Jaegeuk Kimdbe6a5f2013-08-09 08:14:06 +0900345
Chao Yu4bc8e9b2014-03-17 16:35:06 +0800346 if (f2fs_has_xattr_block(ofs))
Jaegeuk Kime6b120d2017-07-10 12:55:09 -0700347 return true;
Jaegeuk Kimdbe6a5f2013-08-09 08:14:06 +0900348
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900349 if (ofs == 3 || ofs == 4 + NIDS_PER_BLOCK ||
350 ofs == 5 + 2 * NIDS_PER_BLOCK)
351 return false;
352 if (ofs >= 6 + 2 * NIDS_PER_BLOCK) {
353 ofs -= 6 + 2 * NIDS_PER_BLOCK;
Zhihui Zhang33151012013-04-07 12:57:04 -0400354 if (!((long int)ofs % (NIDS_PER_BLOCK + 1)))
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900355 return false;
356 }
357 return true;
358}
359
Jaegeuk Kim12719ae2016-01-07 13:23:12 -0800360static inline int set_nid(struct page *p, int off, nid_t nid, bool i)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900361{
Gu Zheng45590712013-07-15 17:57:38 +0800362 struct f2fs_node *rn = F2FS_NODE(p);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900363
Chao Yud9b3df52018-12-25 17:43:42 +0800364 f2fs_wait_on_page_writeback(p, NODE, true, true);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900365
366 if (i)
367 rn->i.i_nid[off - NODE_DIR1_BLOCK] = cpu_to_le32(nid);
368 else
369 rn->in.nid[off] = cpu_to_le32(nid);
Jaegeuk Kim12719ae2016-01-07 13:23:12 -0800370 return set_page_dirty(p);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900371}
372
373static inline nid_t get_nid(struct page *p, int off, bool i)
374{
Gu Zheng45590712013-07-15 17:57:38 +0800375 struct f2fs_node *rn = F2FS_NODE(p);
376
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900377 if (i)
378 return le32_to_cpu(rn->i.i_nid[off - NODE_DIR1_BLOCK]);
379 return le32_to_cpu(rn->in.nid[off]);
380}
381
382/*
383 * Coldness identification:
384 * - Mark cold files in f2fs_inode_info
385 * - Mark cold node blocks in their node footer
386 * - Mark cold data pages in page cache
387 */
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900388static inline int is_cold_data(struct page *page)
389{
390 return PageChecked(page);
391}
392
393static inline void set_cold_data(struct page *page)
394{
395 SetPageChecked(page);
396}
397
398static inline void clear_cold_data(struct page *page)
399{
400 ClearPageChecked(page);
401}
402
Namjae Jeona06a2412013-05-23 22:58:40 +0900403static inline int is_node(struct page *page, int type)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900404{
Gu Zheng45590712013-07-15 17:57:38 +0800405 struct f2fs_node *rn = F2FS_NODE(page);
Namjae Jeona06a2412013-05-23 22:58:40 +0900406 return le32_to_cpu(rn->footer.flag) & (1 << type);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900407}
408
Namjae Jeona06a2412013-05-23 22:58:40 +0900409#define is_cold_node(page) is_node(page, COLD_BIT_SHIFT)
410#define is_fsync_dnode(page) is_node(page, FSYNC_BIT_SHIFT)
411#define is_dent_dnode(page) is_node(page, DENT_BIT_SHIFT)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900412
Jaegeuk Kim2049d4f2016-01-25 05:57:05 -0800413static inline int is_inline_node(struct page *page)
414{
415 return PageChecked(page);
416}
417
418static inline void set_inline_node(struct page *page)
419{
420 SetPageChecked(page);
421}
422
423static inline void clear_inline_node(struct page *page)
424{
425 ClearPageChecked(page);
426}
427
Chao Yuc7930ee82018-03-09 14:24:22 +0800428static inline void set_cold_node(struct page *page, bool is_dir)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900429{
Gu Zheng45590712013-07-15 17:57:38 +0800430 struct f2fs_node *rn = F2FS_NODE(page);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900431 unsigned int flag = le32_to_cpu(rn->footer.flag);
432
Chao Yuc7930ee82018-03-09 14:24:22 +0800433 if (is_dir)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900434 flag &= ~(0x1 << COLD_BIT_SHIFT);
435 else
436 flag |= (0x1 << COLD_BIT_SHIFT);
437 rn->footer.flag = cpu_to_le32(flag);
438}
439
Namjae Jeona06a2412013-05-23 22:58:40 +0900440static inline void set_mark(struct page *page, int mark, int type)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900441{
Gu Zheng45590712013-07-15 17:57:38 +0800442 struct f2fs_node *rn = F2FS_NODE(page);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900443 unsigned int flag = le32_to_cpu(rn->footer.flag);
444 if (mark)
Namjae Jeona06a2412013-05-23 22:58:40 +0900445 flag |= (0x1 << type);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900446 else
Namjae Jeona06a2412013-05-23 22:58:40 +0900447 flag &= ~(0x1 << type);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900448 rn->footer.flag = cpu_to_le32(flag);
Weichao Guof7467672018-03-09 23:10:21 +0800449
450#ifdef CONFIG_F2FS_CHECK_FS
451 f2fs_inode_chksum_set(F2FS_P_SB(page), page);
452#endif
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900453}
Namjae Jeona06a2412013-05-23 22:58:40 +0900454#define set_dentry_mark(page, mark) set_mark(page, mark, DENT_BIT_SHIFT)
455#define set_fsync_mark(page, mark) set_mark(page, mark, FSYNC_BIT_SHIFT)