blob: 036b887176ff0d016cf4b60923373d093d3628cb [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 */
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
17/* # of pages to perform readahead before building free nids */
18#define FREE_NID_PAGES 4
19
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) */
24#define DEF_RAM_THRESHOLD 10
25
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090026/* vector size for gang look-up from nat cache that consists of radix tree */
27#define NATVEC_SIZE 64
28
Jaegeuk Kim56ae6742013-03-31 12:47:20 +090029/* return value for read_node_page */
30#define LOCKED_PAGE 1
31
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090032/*
33 * For node information
34 */
35struct node_info {
36 nid_t nid; /* node id */
37 nid_t ino; /* inode number of the node's owner */
38 block_t blk_addr; /* block address of the node */
39 unsigned char version; /* version of the node */
40};
41
Jaegeuk Kim7ef35e32014-09-15 12:07:13 -070042enum {
43 IS_CHECKPOINTED, /* is it checkpointed before? */
Jaegeuk Kim88bd02c2014-09-15 14:50:48 -070044 HAS_FSYNCED_INODE, /* is the inode fsynced before? */
45 HAS_LAST_FSYNC, /* has the latest node fsync mark? */
Jaegeuk Kim309cc2b2014-09-22 11:40:48 -070046 IS_DIRTY, /* this nat entry is dirty? */
Jaegeuk Kim7ef35e32014-09-15 12:07:13 -070047};
48
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090049struct nat_entry {
50 struct list_head list; /* for clean or dirty nat list */
Jaegeuk Kim7ef35e32014-09-15 12:07:13 -070051 unsigned char flag; /* for node information bits */
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090052 struct node_info ni; /* in-memory node information */
53};
54
55#define nat_get_nid(nat) (nat->ni.nid)
56#define nat_set_nid(nat, n) (nat->ni.nid = n)
57#define nat_get_blkaddr(nat) (nat->ni.blk_addr)
58#define nat_set_blkaddr(nat, b) (nat->ni.blk_addr = b)
59#define nat_get_ino(nat) (nat->ni.ino)
60#define nat_set_ino(nat, i) (nat->ni.ino = i)
61#define nat_get_version(nat) (nat->ni.version)
62#define nat_set_version(nat, v) (nat->ni.version = v)
63
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090064#define inc_node_version(version) (++version)
65
Jaegeuk Kim7ef35e32014-09-15 12:07:13 -070066static inline void set_nat_flag(struct nat_entry *ne,
67 unsigned int type, bool set)
68{
69 unsigned char mask = 0x01 << type;
70 if (set)
71 ne->flag |= mask;
72 else
73 ne->flag &= ~mask;
74}
75
76static inline bool get_nat_flag(struct nat_entry *ne, unsigned int type)
77{
78 unsigned char mask = 0x01 << type;
79 return ne->flag & mask;
80}
81
Jaegeuk Kim88bd02c2014-09-15 14:50:48 -070082static inline void nat_reset_flag(struct nat_entry *ne)
83{
84 /* these states can be set only after checkpoint was done */
85 set_nat_flag(ne, IS_CHECKPOINTED, true);
86 set_nat_flag(ne, HAS_FSYNCED_INODE, false);
87 set_nat_flag(ne, HAS_LAST_FSYNC, true);
88}
89
Jaegeuk Kim39a53e02012-11-28 13:37:31 +090090static inline void node_info_from_raw_nat(struct node_info *ni,
91 struct f2fs_nat_entry *raw_ne)
92{
93 ni->ino = le32_to_cpu(raw_ne->ino);
94 ni->blk_addr = le32_to_cpu(raw_ne->block_addr);
95 ni->version = raw_ne->version;
96}
97
Chao Yu94dac222014-04-17 10:51:05 +080098static inline void raw_nat_from_node_info(struct f2fs_nat_entry *raw_ne,
99 struct node_info *ni)
100{
101 raw_ne->ino = cpu_to_le32(ni->ino);
102 raw_ne->block_addr = cpu_to_le32(ni->blk_addr);
103 raw_ne->version = ni->version;
104}
105
Jaegeuk Kim6fb03f32014-04-16 10:47:06 +0900106enum mem_type {
Jaegeuk Kimcdfc41c2014-03-19 13:31:37 +0900107 FREE_NIDS, /* indicates the free nid list */
Jaegeuk Kim6fb03f32014-04-16 10:47:06 +0900108 NAT_ENTRIES, /* indicates the cached nat entry */
Jaegeuk Kime5e7ea32014-11-06 15:24:46 -0800109 DIRTY_DENTS, /* indicates dirty dentry pages */
110 INO_ENTRIES, /* indicates inode entries */
Jaegeuk Kim1e843712014-12-09 06:08:59 -0800111 BASE_CHECK, /* check kernel status */
Jaegeuk Kimcdfc41c2014-03-19 13:31:37 +0900112};
113
Chao Yuaec71382014-06-24 09:18:20 +0800114struct nat_entry_set {
Jaegeuk Kim309cc2b2014-09-22 11:40:48 -0700115 struct list_head set_list; /* link with other nat sets */
Chao Yuaec71382014-06-24 09:18:20 +0800116 struct list_head entry_list; /* link with dirty nat entries */
Jaegeuk Kim309cc2b2014-09-22 11:40:48 -0700117 nid_t set; /* set number*/
Chao Yuaec71382014-06-24 09:18:20 +0800118 unsigned int entry_cnt; /* the # of nat entries in set */
119};
120
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900121/*
122 * For free nid mangement
123 */
124enum nid_state {
125 NID_NEW, /* newly added to free nid list */
126 NID_ALLOC /* it is allocated */
127};
128
129struct free_nid {
130 struct list_head list; /* for free node id list */
131 nid_t nid; /* node id */
132 int state; /* in use or not: NID_NEW or NID_ALLOC */
133};
134
Jaegeuk Kim120c2cb2014-10-03 15:12:42 -0700135static inline void next_free_nid(struct f2fs_sb_info *sbi, nid_t *nid)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900136{
137 struct f2fs_nm_info *nm_i = NM_I(sbi);
138 struct free_nid *fnid;
139
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900140 spin_lock(&nm_i->free_nid_list_lock);
Huang Yingc6e48932014-09-12 19:21:11 +0800141 if (nm_i->fcnt <= 0) {
142 spin_unlock(&nm_i->free_nid_list_lock);
Jaegeuk Kim120c2cb2014-10-03 15:12:42 -0700143 return;
Huang Yingc6e48932014-09-12 19:21:11 +0800144 }
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900145 fnid = list_entry(nm_i->free_nid_list.next, struct free_nid, list);
146 *nid = fnid->nid;
147 spin_unlock(&nm_i->free_nid_list_lock);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900148}
149
150/*
151 * inline functions
152 */
153static inline void get_nat_bitmap(struct f2fs_sb_info *sbi, void *addr)
154{
155 struct f2fs_nm_info *nm_i = NM_I(sbi);
156 memcpy(addr, nm_i->nat_bitmap, nm_i->bitmap_size);
157}
158
159static inline pgoff_t current_nat_addr(struct f2fs_sb_info *sbi, nid_t start)
160{
161 struct f2fs_nm_info *nm_i = NM_I(sbi);
162 pgoff_t block_off;
163 pgoff_t block_addr;
164 int seg_off;
165
166 block_off = NAT_BLOCK_OFFSET(start);
167 seg_off = block_off >> sbi->log_blocks_per_seg;
168
169 block_addr = (pgoff_t)(nm_i->nat_blkaddr +
170 (seg_off << sbi->log_blocks_per_seg << 1) +
171 (block_off & ((1 << sbi->log_blocks_per_seg) - 1)));
172
173 if (f2fs_test_bit(block_off, nm_i->nat_bitmap))
174 block_addr += sbi->blocks_per_seg;
175
176 return block_addr;
177}
178
179static inline pgoff_t next_nat_addr(struct f2fs_sb_info *sbi,
180 pgoff_t block_addr)
181{
182 struct f2fs_nm_info *nm_i = NM_I(sbi);
183
184 block_addr -= nm_i->nat_blkaddr;
185 if ((block_addr >> sbi->log_blocks_per_seg) % 2)
186 block_addr -= sbi->blocks_per_seg;
187 else
188 block_addr += sbi->blocks_per_seg;
189
190 return block_addr + nm_i->nat_blkaddr;
191}
192
193static inline void set_to_next_nat(struct f2fs_nm_info *nm_i, nid_t start_nid)
194{
195 unsigned int block_off = NAT_BLOCK_OFFSET(start_nid);
196
Gu Zhengc6ac4c02014-10-20 17:45:50 +0800197 f2fs_change_bit(block_off, nm_i->nat_bitmap);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900198}
199
200static inline void fill_node_footer(struct page *page, nid_t nid,
201 nid_t ino, unsigned int ofs, bool reset)
202{
Gu Zheng45590712013-07-15 17:57:38 +0800203 struct f2fs_node *rn = F2FS_NODE(page);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900204 if (reset)
205 memset(rn, 0, sizeof(*rn));
206 rn->footer.nid = cpu_to_le32(nid);
207 rn->footer.ino = cpu_to_le32(ino);
208 rn->footer.flag = cpu_to_le32(ofs << OFFSET_BIT_SHIFT);
209}
210
211static inline void copy_node_footer(struct page *dst, struct page *src)
212{
Gu Zheng45590712013-07-15 17:57:38 +0800213 struct f2fs_node *src_rn = F2FS_NODE(src);
214 struct f2fs_node *dst_rn = F2FS_NODE(dst);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900215 memcpy(&dst_rn->footer, &src_rn->footer, sizeof(struct node_footer));
216}
217
218static inline void fill_node_footer_blkaddr(struct page *page, block_t blkaddr)
219{
Jaegeuk Kim40813632014-09-02 15:31:18 -0700220 struct f2fs_checkpoint *ckpt = F2FS_CKPT(F2FS_P_SB(page));
Gu Zheng45590712013-07-15 17:57:38 +0800221 struct f2fs_node *rn = F2FS_NODE(page);
222
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900223 rn->footer.cp_ver = ckpt->checkpoint_ver;
Jaegeuk Kim25ca9232012-11-28 16:12:41 +0900224 rn->footer.next_blkaddr = cpu_to_le32(blkaddr);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900225}
226
227static inline nid_t ino_of_node(struct page *node_page)
228{
Gu Zheng45590712013-07-15 17:57:38 +0800229 struct f2fs_node *rn = F2FS_NODE(node_page);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900230 return le32_to_cpu(rn->footer.ino);
231}
232
233static inline nid_t nid_of_node(struct page *node_page)
234{
Gu Zheng45590712013-07-15 17:57:38 +0800235 struct f2fs_node *rn = F2FS_NODE(node_page);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900236 return le32_to_cpu(rn->footer.nid);
237}
238
239static inline unsigned int ofs_of_node(struct page *node_page)
240{
Gu Zheng45590712013-07-15 17:57:38 +0800241 struct f2fs_node *rn = F2FS_NODE(node_page);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900242 unsigned flag = le32_to_cpu(rn->footer.flag);
243 return flag >> OFFSET_BIT_SHIFT;
244}
245
246static inline unsigned long long cpver_of_node(struct page *node_page)
247{
Gu Zheng45590712013-07-15 17:57:38 +0800248 struct f2fs_node *rn = F2FS_NODE(node_page);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900249 return le64_to_cpu(rn->footer.cp_ver);
250}
251
252static inline block_t next_blkaddr_of_node(struct page *node_page)
253{
Gu Zheng45590712013-07-15 17:57:38 +0800254 struct f2fs_node *rn = F2FS_NODE(node_page);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900255 return le32_to_cpu(rn->footer.next_blkaddr);
256}
257
258/*
259 * f2fs assigns the following node offsets described as (num).
260 * N = NIDS_PER_BLOCK
261 *
262 * Inode block (0)
263 * |- direct node (1)
264 * |- direct node (2)
265 * |- indirect node (3)
266 * | `- direct node (4 => 4 + N - 1)
267 * |- indirect node (4 + N)
268 * | `- direct node (5 + N => 5 + 2N - 1)
269 * `- double indirect node (5 + 2N)
270 * `- indirect node (6 + 2N)
Chao Yu4f4124d2013-12-21 18:02:14 +0800271 * `- direct node
272 * ......
273 * `- indirect node ((6 + 2N) + x(N + 1))
274 * `- direct node
275 * ......
276 * `- indirect node ((6 + 2N) + (N - 1)(N + 1))
277 * `- direct node
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900278 */
279static inline bool IS_DNODE(struct page *node_page)
280{
281 unsigned int ofs = ofs_of_node(node_page);
Jaegeuk Kimdbe6a5f2013-08-09 08:14:06 +0900282
Chao Yu4bc8e9b2014-03-17 16:35:06 +0800283 if (f2fs_has_xattr_block(ofs))
Jaegeuk Kimdbe6a5f2013-08-09 08:14:06 +0900284 return false;
285
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900286 if (ofs == 3 || ofs == 4 + NIDS_PER_BLOCK ||
287 ofs == 5 + 2 * NIDS_PER_BLOCK)
288 return false;
289 if (ofs >= 6 + 2 * NIDS_PER_BLOCK) {
290 ofs -= 6 + 2 * NIDS_PER_BLOCK;
Zhihui Zhang33151012013-04-07 12:57:04 -0400291 if (!((long int)ofs % (NIDS_PER_BLOCK + 1)))
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900292 return false;
293 }
294 return true;
295}
296
297static inline void set_nid(struct page *p, int off, nid_t nid, bool i)
298{
Gu Zheng45590712013-07-15 17:57:38 +0800299 struct f2fs_node *rn = F2FS_NODE(p);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900300
Jaegeuk Kim54b591d2014-04-29 17:28:32 +0900301 f2fs_wait_on_page_writeback(p, NODE);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900302
303 if (i)
304 rn->i.i_nid[off - NODE_DIR1_BLOCK] = cpu_to_le32(nid);
305 else
306 rn->in.nid[off] = cpu_to_le32(nid);
307 set_page_dirty(p);
308}
309
310static inline nid_t get_nid(struct page *p, int off, bool i)
311{
Gu Zheng45590712013-07-15 17:57:38 +0800312 struct f2fs_node *rn = F2FS_NODE(p);
313
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900314 if (i)
315 return le32_to_cpu(rn->i.i_nid[off - NODE_DIR1_BLOCK]);
316 return le32_to_cpu(rn->in.nid[off]);
317}
318
319/*
320 * Coldness identification:
321 * - Mark cold files in f2fs_inode_info
322 * - Mark cold node blocks in their node footer
323 * - Mark cold data pages in page cache
324 */
Namjae Jeona06a2412013-05-23 22:58:40 +0900325static inline int is_file(struct inode *inode, int type)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900326{
Namjae Jeona06a2412013-05-23 22:58:40 +0900327 return F2FS_I(inode)->i_advise & type;
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900328}
329
Namjae Jeona06a2412013-05-23 22:58:40 +0900330static inline void set_file(struct inode *inode, int type)
Jaegeuk Kim953a3e22013-03-21 15:21:57 +0900331{
Namjae Jeona06a2412013-05-23 22:58:40 +0900332 F2FS_I(inode)->i_advise |= type;
Jaegeuk Kim953a3e22013-03-21 15:21:57 +0900333}
334
Jaegeuk Kim354a3392013-06-14 08:52:35 +0900335static inline void clear_file(struct inode *inode, int type)
336{
337 F2FS_I(inode)->i_advise &= ~type;
338}
339
340#define file_is_cold(inode) is_file(inode, FADVISE_COLD_BIT)
341#define file_wrong_pino(inode) is_file(inode, FADVISE_LOST_PINO_BIT)
342#define file_set_cold(inode) set_file(inode, FADVISE_COLD_BIT)
343#define file_lost_pino(inode) set_file(inode, FADVISE_LOST_PINO_BIT)
344#define file_clear_cold(inode) clear_file(inode, FADVISE_COLD_BIT)
345#define file_got_pino(inode) clear_file(inode, FADVISE_LOST_PINO_BIT)
Jaegeuk Kim953a3e22013-03-21 15:21:57 +0900346
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900347static inline int is_cold_data(struct page *page)
348{
349 return PageChecked(page);
350}
351
352static inline void set_cold_data(struct page *page)
353{
354 SetPageChecked(page);
355}
356
357static inline void clear_cold_data(struct page *page)
358{
359 ClearPageChecked(page);
360}
361
Namjae Jeona06a2412013-05-23 22:58:40 +0900362static inline int is_node(struct page *page, int type)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900363{
Gu Zheng45590712013-07-15 17:57:38 +0800364 struct f2fs_node *rn = F2FS_NODE(page);
Namjae Jeona06a2412013-05-23 22:58:40 +0900365 return le32_to_cpu(rn->footer.flag) & (1 << type);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900366}
367
Namjae Jeona06a2412013-05-23 22:58:40 +0900368#define is_cold_node(page) is_node(page, COLD_BIT_SHIFT)
369#define is_fsync_dnode(page) is_node(page, FSYNC_BIT_SHIFT)
370#define is_dent_dnode(page) is_node(page, DENT_BIT_SHIFT)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900371
372static inline void set_cold_node(struct inode *inode, struct page *page)
373{
Gu Zheng45590712013-07-15 17:57:38 +0800374 struct f2fs_node *rn = F2FS_NODE(page);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900375 unsigned int flag = le32_to_cpu(rn->footer.flag);
376
377 if (S_ISDIR(inode->i_mode))
378 flag &= ~(0x1 << COLD_BIT_SHIFT);
379 else
380 flag |= (0x1 << COLD_BIT_SHIFT);
381 rn->footer.flag = cpu_to_le32(flag);
382}
383
Namjae Jeona06a2412013-05-23 22:58:40 +0900384static inline void set_mark(struct page *page, int mark, int type)
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900385{
Gu Zheng45590712013-07-15 17:57:38 +0800386 struct f2fs_node *rn = F2FS_NODE(page);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900387 unsigned int flag = le32_to_cpu(rn->footer.flag);
388 if (mark)
Namjae Jeona06a2412013-05-23 22:58:40 +0900389 flag |= (0x1 << type);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900390 else
Namjae Jeona06a2412013-05-23 22:58:40 +0900391 flag &= ~(0x1 << type);
Jaegeuk Kim39a53e02012-11-28 13:37:31 +0900392 rn->footer.flag = cpu_to_le32(flag);
393}
Namjae Jeona06a2412013-05-23 22:58:40 +0900394#define set_dentry_mark(page, mark) set_mark(page, mark, DENT_BIT_SHIFT)
395#define set_fsync_mark(page, mark) set_mark(page, mark, FSYNC_BIT_SHIFT)