]>
Commit | Line | Data |
---|---|---|
7c1a000d | 1 | // SPDX-License-Identifier: GPL-2.0 |
0a8165d7 | 2 | /* |
e05df3b1 JK |
3 | * fs/f2fs/node.c |
4 | * | |
5 | * Copyright (c) 2012 Samsung Electronics Co., Ltd. | |
6 | * http://www.samsung.com/ | |
e05df3b1 JK |
7 | */ |
8 | #include <linux/fs.h> | |
9 | #include <linux/f2fs_fs.h> | |
10 | #include <linux/mpage.h> | |
11 | #include <linux/backing-dev.h> | |
12 | #include <linux/blkdev.h> | |
13 | #include <linux/pagevec.h> | |
14 | #include <linux/swap.h> | |
15 | ||
16 | #include "f2fs.h" | |
17 | #include "node.h" | |
18 | #include "segment.h" | |
87905682 | 19 | #include "xattr.h" |
52118743 | 20 | #include "iostat.h" |
51dd6249 | 21 | #include <trace/events/f2fs.h> |
e05df3b1 | 22 | |
4d57b86d | 23 | #define on_f2fs_build_free_nids(nmi) mutex_is_locked(&(nm_i)->build_lock) |
f978f5a0 | 24 | |
e05df3b1 JK |
25 | static struct kmem_cache *nat_entry_slab; |
26 | static struct kmem_cache *free_nid_slab; | |
aec71382 | 27 | static struct kmem_cache *nat_entry_set_slab; |
50fa53ec | 28 | static struct kmem_cache *fsync_node_entry_slab; |
e05df3b1 | 29 | |
a4f843bd JK |
30 | /* |
31 | * Check whether the given nid is within node id range. | |
32 | */ | |
4d57b86d | 33 | int f2fs_check_nid_range(struct f2fs_sb_info *sbi, nid_t nid) |
a4f843bd JK |
34 | { |
35 | if (unlikely(nid < F2FS_ROOT_INO(sbi) || nid >= NM_I(sbi)->max_nid)) { | |
36 | set_sbi_flag(sbi, SBI_NEED_FSCK); | |
dcbb4c10 JP |
37 | f2fs_warn(sbi, "%s: out-of-range nid=%x, run fsck to fix.", |
38 | __func__, nid); | |
10f966bb | 39 | return -EFSCORRUPTED; |
a4f843bd JK |
40 | } |
41 | return 0; | |
42 | } | |
43 | ||
4d57b86d | 44 | bool f2fs_available_free_memory(struct f2fs_sb_info *sbi, int type) |
cdfc41c1 | 45 | { |
6fb03f3a | 46 | struct f2fs_nm_info *nm_i = NM_I(sbi); |
d6d2b491 | 47 | struct discard_cmd_control *dcc = SM_I(sbi)->dcc_info; |
cdfc41c1 | 48 | struct sysinfo val; |
e5e7ea3c | 49 | unsigned long avail_ram; |
cdfc41c1 | 50 | unsigned long mem_size = 0; |
6fb03f3a | 51 | bool res = false; |
cdfc41c1 | 52 | |
d6d2b491 ST |
53 | if (!nm_i) |
54 | return true; | |
55 | ||
cdfc41c1 | 56 | si_meminfo(&val); |
e5e7ea3c JK |
57 | |
58 | /* only uses low memory */ | |
59 | avail_ram = val.totalram - val.totalhigh; | |
60 | ||
429511cd CY |
61 | /* |
62 | * give 25%, 25%, 50%, 50%, 50% memory for each components respectively | |
63 | */ | |
6fb03f3a | 64 | if (type == FREE_NIDS) { |
9a4ffdf5 | 65 | mem_size = (nm_i->nid_cnt[FREE_NID] * |
b8559dc2 | 66 | sizeof(struct free_nid)) >> PAGE_SHIFT; |
e5e7ea3c | 67 | res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 2); |
6fb03f3a | 68 | } else if (type == NAT_ENTRIES) { |
a95ba66a JK |
69 | mem_size = (nm_i->nat_cnt[TOTAL_NAT] * |
70 | sizeof(struct nat_entry)) >> PAGE_SHIFT; | |
e5e7ea3c | 71 | res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 2); |
e589c2c4 JK |
72 | if (excess_cached_nats(sbi)) |
73 | res = false; | |
a1257023 JK |
74 | } else if (type == DIRTY_DENTS) { |
75 | if (sbi->sb->s_bdi->wb.dirty_exceeded) | |
76 | return false; | |
77 | mem_size = get_pages(sbi, F2FS_DIRTY_DENTS); | |
78 | res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 1); | |
e5e7ea3c JK |
79 | } else if (type == INO_ENTRIES) { |
80 | int i; | |
81 | ||
39d787be | 82 | for (i = 0; i < MAX_INO_ENTRY; i++) |
8f73cbb7 KM |
83 | mem_size += sbi->im[i].ino_num * |
84 | sizeof(struct ino_entry); | |
85 | mem_size >>= PAGE_SHIFT; | |
e5e7ea3c | 86 | res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 1); |
429511cd | 87 | } else if (type == EXTENT_CACHE) { |
7441ccef JK |
88 | mem_size = (atomic_read(&sbi->total_ext_tree) * |
89 | sizeof(struct extent_tree) + | |
429511cd | 90 | atomic_read(&sbi->total_ext_node) * |
09cbfeaf | 91 | sizeof(struct extent_node)) >> PAGE_SHIFT; |
429511cd | 92 | res = mem_size < ((avail_ram * nm_i->ram_thresh / 100) >> 1); |
57864ae5 JK |
93 | } else if (type == INMEM_PAGES) { |
94 | /* it allows 20% / total_ram for inmemory pages */ | |
95 | mem_size = get_pages(sbi, F2FS_INMEM_PAGES); | |
96 | res = mem_size < (val.totalram / 5); | |
d6d2b491 ST |
97 | } else if (type == DISCARD_CACHE) { |
98 | mem_size = (atomic_read(&dcc->discard_cmd_cnt) * | |
99 | sizeof(struct discard_cmd)) >> PAGE_SHIFT; | |
100 | res = mem_size < (avail_ram * nm_i->ram_thresh / 100); | |
6ce19aff CY |
101 | } else if (type == COMPRESS_PAGE) { |
102 | #ifdef CONFIG_F2FS_FS_COMPRESSION | |
103 | unsigned long free_ram = val.freeram; | |
104 | ||
105 | /* | |
106 | * free memory is lower than watermark or cached page count | |
107 | * exceed threshold, deny caching compress page. | |
108 | */ | |
109 | res = (free_ram > avail_ram * sbi->compress_watermark / 100) && | |
110 | (COMPRESS_MAPPING(sbi)->nrpages < | |
111 | free_ram * sbi->compress_percent / 100); | |
112 | #else | |
113 | res = false; | |
114 | #endif | |
1e84371f | 115 | } else { |
1663cae4 JK |
116 | if (!sbi->sb->s_bdi->wb.dirty_exceeded) |
117 | return true; | |
6fb03f3a JK |
118 | } |
119 | return res; | |
cdfc41c1 JK |
120 | } |
121 | ||
e05df3b1 JK |
122 | static void clear_node_page_dirty(struct page *page) |
123 | { | |
e05df3b1 | 124 | if (PageDirty(page)) { |
5ec2d99d | 125 | f2fs_clear_page_cache_dirty_tag(page); |
e05df3b1 | 126 | clear_page_dirty_for_io(page); |
aec2f729 | 127 | dec_page_count(F2FS_P_SB(page), F2FS_DIRTY_NODES); |
e05df3b1 JK |
128 | } |
129 | ClearPageUptodate(page); | |
130 | } | |
131 | ||
132 | static struct page *get_current_nat_page(struct f2fs_sb_info *sbi, nid_t nid) | |
133 | { | |
3acc4522 | 134 | return f2fs_get_meta_page_retry(sbi, current_nat_addr(sbi, nid)); |
e05df3b1 JK |
135 | } |
136 | ||
137 | static struct page *get_next_nat_page(struct f2fs_sb_info *sbi, nid_t nid) | |
138 | { | |
139 | struct page *src_page; | |
140 | struct page *dst_page; | |
e05df3b1 JK |
141 | pgoff_t dst_off; |
142 | void *src_addr; | |
143 | void *dst_addr; | |
144 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
145 | ||
80551d17 | 146 | dst_off = next_nat_addr(sbi, current_nat_addr(sbi, nid)); |
e05df3b1 JK |
147 | |
148 | /* get current nat block page with lock */ | |
80551d17 | 149 | src_page = get_current_nat_page(sbi, nid); |
edc55aaf JK |
150 | if (IS_ERR(src_page)) |
151 | return src_page; | |
4d57b86d | 152 | dst_page = f2fs_grab_meta_page(sbi, dst_off); |
9850cf4a | 153 | f2fs_bug_on(sbi, PageDirty(src_page)); |
e05df3b1 JK |
154 | |
155 | src_addr = page_address(src_page); | |
156 | dst_addr = page_address(dst_page); | |
09cbfeaf | 157 | memcpy(dst_addr, src_addr, PAGE_SIZE); |
e05df3b1 JK |
158 | set_page_dirty(dst_page); |
159 | f2fs_put_page(src_page, 1); | |
160 | ||
161 | set_to_next_nat(nm_i, nid); | |
162 | ||
163 | return dst_page; | |
164 | } | |
165 | ||
32410577 CY |
166 | static struct nat_entry *__alloc_nat_entry(struct f2fs_sb_info *sbi, |
167 | nid_t nid, bool no_fail) | |
12f9ef37 YH |
168 | { |
169 | struct nat_entry *new; | |
170 | ||
32410577 CY |
171 | new = f2fs_kmem_cache_alloc(nat_entry_slab, |
172 | GFP_F2FS_ZERO, no_fail, sbi); | |
12f9ef37 YH |
173 | if (new) { |
174 | nat_set_nid(new, nid); | |
175 | nat_reset_flag(new); | |
176 | } | |
177 | return new; | |
178 | } | |
179 | ||
180 | static void __free_nat_entry(struct nat_entry *e) | |
181 | { | |
182 | kmem_cache_free(nat_entry_slab, e); | |
183 | } | |
184 | ||
185 | /* must be locked by nat_tree_lock */ | |
186 | static struct nat_entry *__init_nat_entry(struct f2fs_nm_info *nm_i, | |
187 | struct nat_entry *ne, struct f2fs_nat_entry *raw_ne, bool no_fail) | |
188 | { | |
189 | if (no_fail) | |
190 | f2fs_radix_tree_insert(&nm_i->nat_root, nat_get_nid(ne), ne); | |
191 | else if (radix_tree_insert(&nm_i->nat_root, nat_get_nid(ne), ne)) | |
192 | return NULL; | |
193 | ||
194 | if (raw_ne) | |
195 | node_info_from_raw_nat(&ne->ni, raw_ne); | |
22969158 CY |
196 | |
197 | spin_lock(&nm_i->nat_list_lock); | |
12f9ef37 | 198 | list_add_tail(&ne->list, &nm_i->nat_entries); |
22969158 CY |
199 | spin_unlock(&nm_i->nat_list_lock); |
200 | ||
a95ba66a JK |
201 | nm_i->nat_cnt[TOTAL_NAT]++; |
202 | nm_i->nat_cnt[RECLAIMABLE_NAT]++; | |
12f9ef37 YH |
203 | return ne; |
204 | } | |
205 | ||
e05df3b1 JK |
206 | static struct nat_entry *__lookup_nat_cache(struct f2fs_nm_info *nm_i, nid_t n) |
207 | { | |
22969158 CY |
208 | struct nat_entry *ne; |
209 | ||
210 | ne = radix_tree_lookup(&nm_i->nat_root, n); | |
211 | ||
212 | /* for recent accessed nat entry, move it to tail of lru list */ | |
213 | if (ne && !get_nat_flag(ne, IS_DIRTY)) { | |
214 | spin_lock(&nm_i->nat_list_lock); | |
215 | if (!list_empty(&ne->list)) | |
216 | list_move_tail(&ne->list, &nm_i->nat_entries); | |
217 | spin_unlock(&nm_i->nat_list_lock); | |
218 | } | |
219 | ||
220 | return ne; | |
e05df3b1 JK |
221 | } |
222 | ||
223 | static unsigned int __gang_lookup_nat_cache(struct f2fs_nm_info *nm_i, | |
224 | nid_t start, unsigned int nr, struct nat_entry **ep) | |
225 | { | |
226 | return radix_tree_gang_lookup(&nm_i->nat_root, (void **)ep, start, nr); | |
227 | } | |
228 | ||
229 | static void __del_from_nat_cache(struct f2fs_nm_info *nm_i, struct nat_entry *e) | |
230 | { | |
e05df3b1 | 231 | radix_tree_delete(&nm_i->nat_root, nat_get_nid(e)); |
a95ba66a JK |
232 | nm_i->nat_cnt[TOTAL_NAT]--; |
233 | nm_i->nat_cnt[RECLAIMABLE_NAT]--; | |
12f9ef37 | 234 | __free_nat_entry(e); |
e05df3b1 JK |
235 | } |
236 | ||
780de47c CY |
237 | static struct nat_entry_set *__grab_nat_entry_set(struct f2fs_nm_info *nm_i, |
238 | struct nat_entry *ne) | |
309cc2b6 JK |
239 | { |
240 | nid_t set = NAT_BLOCK_OFFSET(ne->ni.nid); | |
241 | struct nat_entry_set *head; | |
242 | ||
309cc2b6 JK |
243 | head = radix_tree_lookup(&nm_i->nat_set_root, set); |
244 | if (!head) { | |
32410577 CY |
245 | head = f2fs_kmem_cache_alloc(nat_entry_set_slab, |
246 | GFP_NOFS, true, NULL); | |
309cc2b6 JK |
247 | |
248 | INIT_LIST_HEAD(&head->entry_list); | |
249 | INIT_LIST_HEAD(&head->set_list); | |
250 | head->set = set; | |
251 | head->entry_cnt = 0; | |
9be32d72 | 252 | f2fs_radix_tree_insert(&nm_i->nat_set_root, set, head); |
309cc2b6 | 253 | } |
780de47c CY |
254 | return head; |
255 | } | |
256 | ||
257 | static void __set_nat_cache_dirty(struct f2fs_nm_info *nm_i, | |
258 | struct nat_entry *ne) | |
259 | { | |
260 | struct nat_entry_set *head; | |
261 | bool new_ne = nat_get_blkaddr(ne) == NEW_ADDR; | |
262 | ||
263 | if (!new_ne) | |
264 | head = __grab_nat_entry_set(nm_i, ne); | |
265 | ||
266 | /* | |
267 | * update entry_cnt in below condition: | |
268 | * 1. update NEW_ADDR to valid block address; | |
269 | * 2. update old block address to new one; | |
270 | */ | |
271 | if (!new_ne && (get_nat_flag(ne, IS_PREALLOC) || | |
272 | !get_nat_flag(ne, IS_DIRTY))) | |
273 | head->entry_cnt++; | |
274 | ||
275 | set_nat_flag(ne, IS_PREALLOC, new_ne); | |
febeca6d CY |
276 | |
277 | if (get_nat_flag(ne, IS_DIRTY)) | |
278 | goto refresh_list; | |
279 | ||
a95ba66a JK |
280 | nm_i->nat_cnt[DIRTY_NAT]++; |
281 | nm_i->nat_cnt[RECLAIMABLE_NAT]--; | |
309cc2b6 | 282 | set_nat_flag(ne, IS_DIRTY, true); |
febeca6d | 283 | refresh_list: |
22969158 | 284 | spin_lock(&nm_i->nat_list_lock); |
780de47c | 285 | if (new_ne) |
febeca6d CY |
286 | list_del_init(&ne->list); |
287 | else | |
288 | list_move_tail(&ne->list, &head->entry_list); | |
22969158 | 289 | spin_unlock(&nm_i->nat_list_lock); |
309cc2b6 JK |
290 | } |
291 | ||
292 | static void __clear_nat_cache_dirty(struct f2fs_nm_info *nm_i, | |
0b28b71e | 293 | struct nat_entry_set *set, struct nat_entry *ne) |
309cc2b6 | 294 | { |
22969158 | 295 | spin_lock(&nm_i->nat_list_lock); |
0b28b71e | 296 | list_move_tail(&ne->list, &nm_i->nat_entries); |
22969158 CY |
297 | spin_unlock(&nm_i->nat_list_lock); |
298 | ||
0b28b71e KM |
299 | set_nat_flag(ne, IS_DIRTY, false); |
300 | set->entry_cnt--; | |
a95ba66a JK |
301 | nm_i->nat_cnt[DIRTY_NAT]--; |
302 | nm_i->nat_cnt[RECLAIMABLE_NAT]++; | |
309cc2b6 JK |
303 | } |
304 | ||
305 | static unsigned int __gang_lookup_nat_set(struct f2fs_nm_info *nm_i, | |
306 | nid_t start, unsigned int nr, struct nat_entry_set **ep) | |
307 | { | |
308 | return radix_tree_gang_lookup(&nm_i->nat_set_root, (void **)ep, | |
309 | start, nr); | |
310 | } | |
311 | ||
50fa53ec CY |
312 | bool f2fs_in_warm_node_list(struct f2fs_sb_info *sbi, struct page *page) |
313 | { | |
314 | return NODE_MAPPING(sbi) == page->mapping && | |
315 | IS_DNODE(page) && is_cold_node(page); | |
316 | } | |
317 | ||
318 | void f2fs_init_fsync_node_info(struct f2fs_sb_info *sbi) | |
319 | { | |
320 | spin_lock_init(&sbi->fsync_node_lock); | |
321 | INIT_LIST_HEAD(&sbi->fsync_node_list); | |
322 | sbi->fsync_seg_id = 0; | |
323 | sbi->fsync_node_num = 0; | |
324 | } | |
325 | ||
326 | static unsigned int f2fs_add_fsync_node_entry(struct f2fs_sb_info *sbi, | |
327 | struct page *page) | |
328 | { | |
329 | struct fsync_node_entry *fn; | |
330 | unsigned long flags; | |
331 | unsigned int seq_id; | |
332 | ||
32410577 CY |
333 | fn = f2fs_kmem_cache_alloc(fsync_node_entry_slab, |
334 | GFP_NOFS, true, NULL); | |
50fa53ec CY |
335 | |
336 | get_page(page); | |
337 | fn->page = page; | |
338 | INIT_LIST_HEAD(&fn->list); | |
339 | ||
340 | spin_lock_irqsave(&sbi->fsync_node_lock, flags); | |
341 | list_add_tail(&fn->list, &sbi->fsync_node_list); | |
342 | fn->seq_id = sbi->fsync_seg_id++; | |
343 | seq_id = fn->seq_id; | |
344 | sbi->fsync_node_num++; | |
345 | spin_unlock_irqrestore(&sbi->fsync_node_lock, flags); | |
346 | ||
347 | return seq_id; | |
348 | } | |
349 | ||
350 | void f2fs_del_fsync_node_entry(struct f2fs_sb_info *sbi, struct page *page) | |
351 | { | |
352 | struct fsync_node_entry *fn; | |
353 | unsigned long flags; | |
354 | ||
355 | spin_lock_irqsave(&sbi->fsync_node_lock, flags); | |
356 | list_for_each_entry(fn, &sbi->fsync_node_list, list) { | |
357 | if (fn->page == page) { | |
358 | list_del(&fn->list); | |
359 | sbi->fsync_node_num--; | |
360 | spin_unlock_irqrestore(&sbi->fsync_node_lock, flags); | |
361 | kmem_cache_free(fsync_node_entry_slab, fn); | |
362 | put_page(page); | |
363 | return; | |
364 | } | |
365 | } | |
366 | spin_unlock_irqrestore(&sbi->fsync_node_lock, flags); | |
367 | f2fs_bug_on(sbi, 1); | |
368 | } | |
369 | ||
370 | void f2fs_reset_fsync_node_info(struct f2fs_sb_info *sbi) | |
371 | { | |
372 | unsigned long flags; | |
373 | ||
374 | spin_lock_irqsave(&sbi->fsync_node_lock, flags); | |
375 | sbi->fsync_seg_id = 0; | |
376 | spin_unlock_irqrestore(&sbi->fsync_node_lock, flags); | |
377 | } | |
378 | ||
4d57b86d | 379 | int f2fs_need_dentry_mark(struct f2fs_sb_info *sbi, nid_t nid) |
e05df3b1 JK |
380 | { |
381 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
382 | struct nat_entry *e; | |
2dcf51ab | 383 | bool need = false; |
e05df3b1 | 384 | |
b873b798 | 385 | down_read(&nm_i->nat_tree_lock); |
e05df3b1 | 386 | e = __lookup_nat_cache(nm_i, nid); |
2dcf51ab JK |
387 | if (e) { |
388 | if (!get_nat_flag(e, IS_CHECKPOINTED) && | |
389 | !get_nat_flag(e, HAS_FSYNCED_INODE)) | |
390 | need = true; | |
391 | } | |
b873b798 | 392 | up_read(&nm_i->nat_tree_lock); |
2dcf51ab | 393 | return need; |
e05df3b1 JK |
394 | } |
395 | ||
4d57b86d | 396 | bool f2fs_is_checkpointed_node(struct f2fs_sb_info *sbi, nid_t nid) |
479f40c4 JK |
397 | { |
398 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
399 | struct nat_entry *e; | |
2dcf51ab | 400 | bool is_cp = true; |
479f40c4 | 401 | |
b873b798 | 402 | down_read(&nm_i->nat_tree_lock); |
2dcf51ab JK |
403 | e = __lookup_nat_cache(nm_i, nid); |
404 | if (e && !get_nat_flag(e, IS_CHECKPOINTED)) | |
405 | is_cp = false; | |
b873b798 | 406 | up_read(&nm_i->nat_tree_lock); |
2dcf51ab | 407 | return is_cp; |
479f40c4 JK |
408 | } |
409 | ||
4d57b86d | 410 | bool f2fs_need_inode_block_update(struct f2fs_sb_info *sbi, nid_t ino) |
b6fe5873 JK |
411 | { |
412 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
413 | struct nat_entry *e; | |
88bd02c9 | 414 | bool need_update = true; |
b6fe5873 | 415 | |
b873b798 | 416 | down_read(&nm_i->nat_tree_lock); |
88bd02c9 JK |
417 | e = __lookup_nat_cache(nm_i, ino); |
418 | if (e && get_nat_flag(e, HAS_LAST_FSYNC) && | |
419 | (get_nat_flag(e, IS_CHECKPOINTED) || | |
420 | get_nat_flag(e, HAS_FSYNCED_INODE))) | |
421 | need_update = false; | |
b873b798 | 422 | up_read(&nm_i->nat_tree_lock); |
88bd02c9 | 423 | return need_update; |
b6fe5873 JK |
424 | } |
425 | ||
12f9ef37 | 426 | /* must be locked by nat_tree_lock */ |
1515aef0 | 427 | static void cache_nat_entry(struct f2fs_sb_info *sbi, nid_t nid, |
e05df3b1 JK |
428 | struct f2fs_nat_entry *ne) |
429 | { | |
1515aef0 | 430 | struct f2fs_nm_info *nm_i = NM_I(sbi); |
12f9ef37 | 431 | struct nat_entry *new, *e; |
9be32d72 | 432 | |
32410577 | 433 | new = __alloc_nat_entry(sbi, nid, false); |
12f9ef37 YH |
434 | if (!new) |
435 | return; | |
436 | ||
437 | down_write(&nm_i->nat_tree_lock); | |
e05df3b1 | 438 | e = __lookup_nat_cache(nm_i, nid); |
12f9ef37 YH |
439 | if (!e) |
440 | e = __init_nat_entry(nm_i, new, ne, false); | |
441 | else | |
0c0b471e EB |
442 | f2fs_bug_on(sbi, nat_get_ino(e) != le32_to_cpu(ne->ino) || |
443 | nat_get_blkaddr(e) != | |
444 | le32_to_cpu(ne->block_addr) || | |
1515aef0 | 445 | nat_get_version(e) != ne->version); |
12f9ef37 YH |
446 | up_write(&nm_i->nat_tree_lock); |
447 | if (e != new) | |
448 | __free_nat_entry(new); | |
e05df3b1 JK |
449 | } |
450 | ||
451 | static void set_node_addr(struct f2fs_sb_info *sbi, struct node_info *ni, | |
479f40c4 | 452 | block_t new_blkaddr, bool fsync_done) |
e05df3b1 JK |
453 | { |
454 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
455 | struct nat_entry *e; | |
32410577 | 456 | struct nat_entry *new = __alloc_nat_entry(sbi, ni->nid, true); |
9be32d72 | 457 | |
b873b798 | 458 | down_write(&nm_i->nat_tree_lock); |
e05df3b1 JK |
459 | e = __lookup_nat_cache(nm_i, ni->nid); |
460 | if (!e) { | |
12f9ef37 | 461 | e = __init_nat_entry(nm_i, new, NULL, true); |
5c27f4ee | 462 | copy_node_info(&e->ni, ni); |
9850cf4a | 463 | f2fs_bug_on(sbi, ni->blk_addr == NEW_ADDR); |
e05df3b1 JK |
464 | } else if (new_blkaddr == NEW_ADDR) { |
465 | /* | |
466 | * when nid is reallocated, | |
467 | * previous nat entry can be remained in nat cache. | |
468 | * So, reinitialize it with new information. | |
469 | */ | |
5c27f4ee | 470 | copy_node_info(&e->ni, ni); |
9850cf4a | 471 | f2fs_bug_on(sbi, ni->blk_addr != NULL_ADDR); |
e05df3b1 | 472 | } |
12f9ef37 YH |
473 | /* let's free early to reduce memory consumption */ |
474 | if (e != new) | |
475 | __free_nat_entry(new); | |
e05df3b1 | 476 | |
e05df3b1 | 477 | /* sanity check */ |
9850cf4a JK |
478 | f2fs_bug_on(sbi, nat_get_blkaddr(e) != ni->blk_addr); |
479 | f2fs_bug_on(sbi, nat_get_blkaddr(e) == NULL_ADDR && | |
e05df3b1 | 480 | new_blkaddr == NULL_ADDR); |
9850cf4a | 481 | f2fs_bug_on(sbi, nat_get_blkaddr(e) == NEW_ADDR && |
e05df3b1 | 482 | new_blkaddr == NEW_ADDR); |
93770ab7 | 483 | f2fs_bug_on(sbi, __is_valid_data_blkaddr(nat_get_blkaddr(e)) && |
e05df3b1 JK |
484 | new_blkaddr == NEW_ADDR); |
485 | ||
e1c42045 | 486 | /* increment version no as node is removed */ |
e05df3b1 JK |
487 | if (nat_get_blkaddr(e) != NEW_ADDR && new_blkaddr == NULL_ADDR) { |
488 | unsigned char version = nat_get_version(e); | |
5f029c04 | 489 | |
e05df3b1 JK |
490 | nat_set_version(e, inc_node_version(version)); |
491 | } | |
492 | ||
493 | /* change address */ | |
494 | nat_set_blkaddr(e, new_blkaddr); | |
93770ab7 | 495 | if (!__is_valid_data_blkaddr(new_blkaddr)) |
88bd02c9 | 496 | set_nat_flag(e, IS_CHECKPOINTED, false); |
e05df3b1 | 497 | __set_nat_cache_dirty(nm_i, e); |
479f40c4 JK |
498 | |
499 | /* update fsync_mark if its inode nat entry is still alive */ | |
d5b692b7 CY |
500 | if (ni->nid != ni->ino) |
501 | e = __lookup_nat_cache(nm_i, ni->ino); | |
88bd02c9 JK |
502 | if (e) { |
503 | if (fsync_done && ni->nid == ni->ino) | |
504 | set_nat_flag(e, HAS_FSYNCED_INODE, true); | |
505 | set_nat_flag(e, HAS_LAST_FSYNC, fsync_done); | |
506 | } | |
b873b798 | 507 | up_write(&nm_i->nat_tree_lock); |
e05df3b1 JK |
508 | } |
509 | ||
4d57b86d | 510 | int f2fs_try_to_free_nats(struct f2fs_sb_info *sbi, int nr_shrink) |
e05df3b1 JK |
511 | { |
512 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
1b38dc8e | 513 | int nr = nr_shrink; |
e05df3b1 | 514 | |
b873b798 JK |
515 | if (!down_write_trylock(&nm_i->nat_tree_lock)) |
516 | return 0; | |
e05df3b1 | 517 | |
22969158 CY |
518 | spin_lock(&nm_i->nat_list_lock); |
519 | while (nr_shrink) { | |
e05df3b1 | 520 | struct nat_entry *ne; |
22969158 CY |
521 | |
522 | if (list_empty(&nm_i->nat_entries)) | |
523 | break; | |
524 | ||
e05df3b1 JK |
525 | ne = list_first_entry(&nm_i->nat_entries, |
526 | struct nat_entry, list); | |
22969158 CY |
527 | list_del(&ne->list); |
528 | spin_unlock(&nm_i->nat_list_lock); | |
529 | ||
e05df3b1 JK |
530 | __del_from_nat_cache(nm_i, ne); |
531 | nr_shrink--; | |
22969158 CY |
532 | |
533 | spin_lock(&nm_i->nat_list_lock); | |
e05df3b1 | 534 | } |
22969158 CY |
535 | spin_unlock(&nm_i->nat_list_lock); |
536 | ||
b873b798 | 537 | up_write(&nm_i->nat_tree_lock); |
1b38dc8e | 538 | return nr - nr_shrink; |
e05df3b1 JK |
539 | } |
540 | ||
7735730d | 541 | int f2fs_get_node_info(struct f2fs_sb_info *sbi, nid_t nid, |
4d57b86d | 542 | struct node_info *ni) |
e05df3b1 JK |
543 | { |
544 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
545 | struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); | |
b7ad7512 | 546 | struct f2fs_journal *journal = curseg->journal; |
e05df3b1 JK |
547 | nid_t start_nid = START_NID(nid); |
548 | struct f2fs_nat_block *nat_blk; | |
549 | struct page *page = NULL; | |
550 | struct f2fs_nat_entry ne; | |
551 | struct nat_entry *e; | |
66a82d1f | 552 | pgoff_t index; |
93770ab7 | 553 | block_t blkaddr; |
e05df3b1 JK |
554 | int i; |
555 | ||
556 | ni->nid = nid; | |
2eeb0dce | 557 | retry: |
e05df3b1 | 558 | /* Check nat cache */ |
b873b798 | 559 | down_read(&nm_i->nat_tree_lock); |
e05df3b1 JK |
560 | e = __lookup_nat_cache(nm_i, nid); |
561 | if (e) { | |
562 | ni->ino = nat_get_ino(e); | |
563 | ni->blk_addr = nat_get_blkaddr(e); | |
564 | ni->version = nat_get_version(e); | |
b873b798 | 565 | up_read(&nm_i->nat_tree_lock); |
7735730d | 566 | return 0; |
1515aef0 | 567 | } |
e05df3b1 | 568 | |
2eeb0dce JK |
569 | /* |
570 | * Check current segment summary by trying to grab journal_rwsem first. | |
571 | * This sem is on the critical path on the checkpoint requiring the above | |
572 | * nat_tree_lock. Therefore, we should retry, if we failed to grab here | |
573 | * while not bothering checkpoint. | |
574 | */ | |
575 | if (!rwsem_is_locked(&sbi->cp_global_sem)) { | |
576 | down_read(&curseg->journal_rwsem); | |
577 | } else if (!down_read_trylock(&curseg->journal_rwsem)) { | |
578 | up_read(&nm_i->nat_tree_lock); | |
579 | goto retry; | |
580 | } | |
3547ea96 | 581 | |
4d57b86d | 582 | i = f2fs_lookup_journal_in_cursum(journal, NAT_JOURNAL, nid, 0); |
e05df3b1 | 583 | if (i >= 0) { |
dfc08a12 | 584 | ne = nat_in_journal(journal, i); |
e05df3b1 JK |
585 | node_info_from_raw_nat(ni, &ne); |
586 | } | |
b7ad7512 | 587 | up_read(&curseg->journal_rwsem); |
66a82d1f YH |
588 | if (i >= 0) { |
589 | up_read(&nm_i->nat_tree_lock); | |
e05df3b1 | 590 | goto cache; |
66a82d1f | 591 | } |
e05df3b1 JK |
592 | |
593 | /* Fill node_info from nat page */ | |
66a82d1f YH |
594 | index = current_nat_addr(sbi, nid); |
595 | up_read(&nm_i->nat_tree_lock); | |
596 | ||
4d57b86d | 597 | page = f2fs_get_meta_page(sbi, index); |
7735730d CY |
598 | if (IS_ERR(page)) |
599 | return PTR_ERR(page); | |
600 | ||
e05df3b1 JK |
601 | nat_blk = (struct f2fs_nat_block *)page_address(page); |
602 | ne = nat_blk->entries[nid - start_nid]; | |
603 | node_info_from_raw_nat(ni, &ne); | |
604 | f2fs_put_page(page, 1); | |
605 | cache: | |
93770ab7 CY |
606 | blkaddr = le32_to_cpu(ne.block_addr); |
607 | if (__is_valid_data_blkaddr(blkaddr) && | |
608 | !f2fs_is_valid_blkaddr(sbi, blkaddr, DATA_GENERIC_ENHANCE)) | |
609 | return -EFAULT; | |
610 | ||
e05df3b1 | 611 | /* cache nat entry */ |
1515aef0 | 612 | cache_nat_entry(sbi, nid, &ne); |
7735730d | 613 | return 0; |
e05df3b1 JK |
614 | } |
615 | ||
79344efb JK |
616 | /* |
617 | * readahead MAX_RA_NODE number of node pages. | |
618 | */ | |
4d57b86d | 619 | static void f2fs_ra_node_pages(struct page *parent, int start, int n) |
79344efb JK |
620 | { |
621 | struct f2fs_sb_info *sbi = F2FS_P_SB(parent); | |
622 | struct blk_plug plug; | |
623 | int i, end; | |
624 | nid_t nid; | |
625 | ||
626 | blk_start_plug(&plug); | |
627 | ||
628 | /* Then, try readahead for siblings of the desired node */ | |
629 | end = start + n; | |
630 | end = min(end, NIDS_PER_BLOCK); | |
631 | for (i = start; i < end; i++) { | |
632 | nid = get_nid(parent, i, false); | |
4d57b86d | 633 | f2fs_ra_node_page(sbi, nid); |
79344efb JK |
634 | } |
635 | ||
636 | blk_finish_plug(&plug); | |
637 | } | |
638 | ||
4d57b86d | 639 | pgoff_t f2fs_get_next_page_offset(struct dnode_of_data *dn, pgoff_t pgofs) |
3cf45747 CY |
640 | { |
641 | const long direct_index = ADDRS_PER_INODE(dn->inode); | |
d02a6e61 CY |
642 | const long direct_blks = ADDRS_PER_BLOCK(dn->inode); |
643 | const long indirect_blks = ADDRS_PER_BLOCK(dn->inode) * NIDS_PER_BLOCK; | |
644 | unsigned int skipped_unit = ADDRS_PER_BLOCK(dn->inode); | |
3cf45747 CY |
645 | int cur_level = dn->cur_level; |
646 | int max_level = dn->max_level; | |
647 | pgoff_t base = 0; | |
648 | ||
649 | if (!dn->max_level) | |
650 | return pgofs + 1; | |
651 | ||
652 | while (max_level-- > cur_level) | |
653 | skipped_unit *= NIDS_PER_BLOCK; | |
654 | ||
655 | switch (dn->max_level) { | |
656 | case 3: | |
657 | base += 2 * indirect_blks; | |
df561f66 | 658 | fallthrough; |
3cf45747 CY |
659 | case 2: |
660 | base += 2 * direct_blks; | |
df561f66 | 661 | fallthrough; |
3cf45747 CY |
662 | case 1: |
663 | base += direct_index; | |
664 | break; | |
665 | default: | |
666 | f2fs_bug_on(F2FS_I_SB(dn->inode), 1); | |
667 | } | |
668 | ||
669 | return ((pgofs - base) / skipped_unit + 1) * skipped_unit + base; | |
670 | } | |
671 | ||
0a8165d7 | 672 | /* |
e05df3b1 JK |
673 | * The maximum depth is four. |
674 | * Offset[0] will have raw inode offset. | |
675 | */ | |
81ca7350 | 676 | static int get_node_path(struct inode *inode, long block, |
de93653f | 677 | int offset[4], unsigned int noffset[4]) |
e05df3b1 | 678 | { |
81ca7350 | 679 | const long direct_index = ADDRS_PER_INODE(inode); |
d02a6e61 | 680 | const long direct_blks = ADDRS_PER_BLOCK(inode); |
e05df3b1 | 681 | const long dptrs_per_blk = NIDS_PER_BLOCK; |
d02a6e61 | 682 | const long indirect_blks = ADDRS_PER_BLOCK(inode) * NIDS_PER_BLOCK; |
e05df3b1 JK |
683 | const long dindirect_blks = indirect_blks * NIDS_PER_BLOCK; |
684 | int n = 0; | |
685 | int level = 0; | |
686 | ||
687 | noffset[0] = 0; | |
688 | ||
689 | if (block < direct_index) { | |
25c0a6e5 | 690 | offset[n] = block; |
e05df3b1 JK |
691 | goto got; |
692 | } | |
693 | block -= direct_index; | |
694 | if (block < direct_blks) { | |
695 | offset[n++] = NODE_DIR1_BLOCK; | |
696 | noffset[n] = 1; | |
25c0a6e5 | 697 | offset[n] = block; |
e05df3b1 JK |
698 | level = 1; |
699 | goto got; | |
700 | } | |
701 | block -= direct_blks; | |
702 | if (block < direct_blks) { | |
703 | offset[n++] = NODE_DIR2_BLOCK; | |
704 | noffset[n] = 2; | |
25c0a6e5 | 705 | offset[n] = block; |
e05df3b1 JK |
706 | level = 1; |
707 | goto got; | |
708 | } | |
709 | block -= direct_blks; | |
710 | if (block < indirect_blks) { | |
711 | offset[n++] = NODE_IND1_BLOCK; | |
712 | noffset[n] = 3; | |
713 | offset[n++] = block / direct_blks; | |
714 | noffset[n] = 4 + offset[n - 1]; | |
25c0a6e5 | 715 | offset[n] = block % direct_blks; |
e05df3b1 JK |
716 | level = 2; |
717 | goto got; | |
718 | } | |
719 | block -= indirect_blks; | |
720 | if (block < indirect_blks) { | |
721 | offset[n++] = NODE_IND2_BLOCK; | |
722 | noffset[n] = 4 + dptrs_per_blk; | |
723 | offset[n++] = block / direct_blks; | |
724 | noffset[n] = 5 + dptrs_per_blk + offset[n - 1]; | |
25c0a6e5 | 725 | offset[n] = block % direct_blks; |
e05df3b1 JK |
726 | level = 2; |
727 | goto got; | |
728 | } | |
729 | block -= indirect_blks; | |
730 | if (block < dindirect_blks) { | |
731 | offset[n++] = NODE_DIND_BLOCK; | |
732 | noffset[n] = 5 + (dptrs_per_blk * 2); | |
733 | offset[n++] = block / indirect_blks; | |
734 | noffset[n] = 6 + (dptrs_per_blk * 2) + | |
735 | offset[n - 1] * (dptrs_per_blk + 1); | |
736 | offset[n++] = (block / direct_blks) % dptrs_per_blk; | |
737 | noffset[n] = 7 + (dptrs_per_blk * 2) + | |
738 | offset[n - 2] * (dptrs_per_blk + 1) + | |
739 | offset[n - 1]; | |
25c0a6e5 | 740 | offset[n] = block % direct_blks; |
e05df3b1 JK |
741 | level = 3; |
742 | goto got; | |
743 | } else { | |
adb6dc19 | 744 | return -E2BIG; |
e05df3b1 JK |
745 | } |
746 | got: | |
747 | return level; | |
748 | } | |
749 | ||
750 | /* | |
751 | * Caller should call f2fs_put_dnode(dn). | |
4f4124d0 | 752 | * Also, it should grab and release a rwsem by calling f2fs_lock_op() and |
7a88ddb5 | 753 | * f2fs_unlock_op() only if mode is set with ALLOC_NODE. |
e05df3b1 | 754 | */ |
4d57b86d | 755 | int f2fs_get_dnode_of_data(struct dnode_of_data *dn, pgoff_t index, int mode) |
e05df3b1 | 756 | { |
4081363f | 757 | struct f2fs_sb_info *sbi = F2FS_I_SB(dn->inode); |
e05df3b1 | 758 | struct page *npage[4]; |
f1a3b98e | 759 | struct page *parent = NULL; |
e05df3b1 JK |
760 | int offset[4]; |
761 | unsigned int noffset[4]; | |
762 | nid_t nids[4]; | |
3cf45747 | 763 | int level, i = 0; |
e05df3b1 JK |
764 | int err = 0; |
765 | ||
81ca7350 | 766 | level = get_node_path(dn->inode, index, offset, noffset); |
adb6dc19 JK |
767 | if (level < 0) |
768 | return level; | |
e05df3b1 JK |
769 | |
770 | nids[0] = dn->inode->i_ino; | |
1646cfac | 771 | npage[0] = dn->inode_page; |
e05df3b1 | 772 | |
1646cfac | 773 | if (!npage[0]) { |
4d57b86d | 774 | npage[0] = f2fs_get_node_page(sbi, nids[0]); |
1646cfac JK |
775 | if (IS_ERR(npage[0])) |
776 | return PTR_ERR(npage[0]); | |
777 | } | |
f1a3b98e JK |
778 | |
779 | /* if inline_data is set, should not report any block indices */ | |
780 | if (f2fs_has_inline_data(dn->inode) && index) { | |
76629165 | 781 | err = -ENOENT; |
f1a3b98e JK |
782 | f2fs_put_page(npage[0], 1); |
783 | goto release_out; | |
784 | } | |
785 | ||
e05df3b1 | 786 | parent = npage[0]; |
52c2db3f CL |
787 | if (level != 0) |
788 | nids[1] = get_nid(parent, offset[0], true); | |
e05df3b1 JK |
789 | dn->inode_page = npage[0]; |
790 | dn->inode_page_locked = true; | |
791 | ||
792 | /* get indirect or direct nodes */ | |
793 | for (i = 1; i <= level; i++) { | |
794 | bool done = false; | |
795 | ||
266e97a8 | 796 | if (!nids[i] && mode == ALLOC_NODE) { |
e05df3b1 | 797 | /* alloc new node */ |
4d57b86d | 798 | if (!f2fs_alloc_nid(sbi, &(nids[i]))) { |
e05df3b1 JK |
799 | err = -ENOSPC; |
800 | goto release_pages; | |
801 | } | |
802 | ||
803 | dn->nid = nids[i]; | |
4d57b86d | 804 | npage[i] = f2fs_new_node_page(dn, noffset[i]); |
e05df3b1 | 805 | if (IS_ERR(npage[i])) { |
4d57b86d | 806 | f2fs_alloc_nid_failed(sbi, nids[i]); |
e05df3b1 JK |
807 | err = PTR_ERR(npage[i]); |
808 | goto release_pages; | |
809 | } | |
810 | ||
811 | set_nid(parent, offset[i - 1], nids[i], i == 1); | |
4d57b86d | 812 | f2fs_alloc_nid_done(sbi, nids[i]); |
e05df3b1 | 813 | done = true; |
266e97a8 | 814 | } else if (mode == LOOKUP_NODE_RA && i == level && level > 1) { |
4d57b86d | 815 | npage[i] = f2fs_get_node_page_ra(parent, offset[i - 1]); |
e05df3b1 JK |
816 | if (IS_ERR(npage[i])) { |
817 | err = PTR_ERR(npage[i]); | |
818 | goto release_pages; | |
819 | } | |
820 | done = true; | |
821 | } | |
822 | if (i == 1) { | |
823 | dn->inode_page_locked = false; | |
824 | unlock_page(parent); | |
825 | } else { | |
826 | f2fs_put_page(parent, 1); | |
827 | } | |
828 | ||
829 | if (!done) { | |
4d57b86d | 830 | npage[i] = f2fs_get_node_page(sbi, nids[i]); |
e05df3b1 JK |
831 | if (IS_ERR(npage[i])) { |
832 | err = PTR_ERR(npage[i]); | |
833 | f2fs_put_page(npage[0], 0); | |
834 | goto release_out; | |
835 | } | |
836 | } | |
837 | if (i < level) { | |
838 | parent = npage[i]; | |
839 | nids[i + 1] = get_nid(parent, offset[i], false); | |
840 | } | |
841 | } | |
842 | dn->nid = nids[level]; | |
843 | dn->ofs_in_node = offset[level]; | |
844 | dn->node_page = npage[level]; | |
a2ced1ce | 845 | dn->data_blkaddr = f2fs_data_blkaddr(dn); |
94afd6d6 CY |
846 | |
847 | if (is_inode_flag_set(dn->inode, FI_COMPRESSED_FILE) && | |
848 | f2fs_sb_has_readonly(sbi)) { | |
849 | unsigned int c_len = f2fs_cluster_blocks_are_contiguous(dn); | |
850 | block_t blkaddr; | |
851 | ||
852 | if (!c_len) | |
853 | goto out; | |
854 | ||
855 | blkaddr = f2fs_data_blkaddr(dn); | |
856 | if (blkaddr == COMPRESS_ADDR) | |
857 | blkaddr = data_blkaddr(dn->inode, dn->node_page, | |
858 | dn->ofs_in_node + 1); | |
859 | ||
860 | f2fs_update_extent_tree_range_compressed(dn->inode, | |
861 | index, blkaddr, | |
862 | F2FS_I(dn->inode)->i_cluster_size, | |
863 | c_len); | |
864 | } | |
865 | out: | |
e05df3b1 JK |
866 | return 0; |
867 | ||
868 | release_pages: | |
869 | f2fs_put_page(parent, 1); | |
870 | if (i > 1) | |
871 | f2fs_put_page(npage[0], 0); | |
872 | release_out: | |
873 | dn->inode_page = NULL; | |
874 | dn->node_page = NULL; | |
3cf45747 CY |
875 | if (err == -ENOENT) { |
876 | dn->cur_level = i; | |
877 | dn->max_level = level; | |
0a2aa8fb | 878 | dn->ofs_in_node = offset[level]; |
3cf45747 | 879 | } |
e05df3b1 JK |
880 | return err; |
881 | } | |
882 | ||
7735730d | 883 | static int truncate_node(struct dnode_of_data *dn) |
e05df3b1 | 884 | { |
4081363f | 885 | struct f2fs_sb_info *sbi = F2FS_I_SB(dn->inode); |
e05df3b1 | 886 | struct node_info ni; |
7735730d | 887 | int err; |
0ea295dd | 888 | pgoff_t index; |
e05df3b1 | 889 | |
7735730d CY |
890 | err = f2fs_get_node_info(sbi, dn->nid, &ni); |
891 | if (err) | |
892 | return err; | |
e05df3b1 | 893 | |
e05df3b1 | 894 | /* Deallocate node address */ |
4d57b86d | 895 | f2fs_invalidate_blocks(sbi, ni.blk_addr); |
000519f2 | 896 | dec_valid_node_count(sbi, dn->inode, dn->nid == dn->inode->i_ino); |
479f40c4 | 897 | set_node_addr(sbi, &ni, NULL_ADDR, false); |
e05df3b1 JK |
898 | |
899 | if (dn->nid == dn->inode->i_ino) { | |
4d57b86d | 900 | f2fs_remove_orphan_inode(sbi, dn->nid); |
e05df3b1 | 901 | dec_valid_inode_count(sbi); |
0f18b462 | 902 | f2fs_inode_synced(dn->inode); |
e05df3b1 | 903 | } |
000519f2 | 904 | |
e05df3b1 | 905 | clear_node_page_dirty(dn->node_page); |
caf0047e | 906 | set_sbi_flag(sbi, SBI_IS_DIRTY); |
e05df3b1 | 907 | |
0ea295dd | 908 | index = dn->node_page->index; |
e05df3b1 | 909 | f2fs_put_page(dn->node_page, 1); |
bf39c00a JK |
910 | |
911 | invalidate_mapping_pages(NODE_MAPPING(sbi), | |
0ea295dd | 912 | index, index); |
bf39c00a | 913 | |
e05df3b1 | 914 | dn->node_page = NULL; |
51dd6249 | 915 | trace_f2fs_truncate_node(dn->inode, dn->nid, ni.blk_addr); |
7735730d CY |
916 | |
917 | return 0; | |
e05df3b1 JK |
918 | } |
919 | ||
920 | static int truncate_dnode(struct dnode_of_data *dn) | |
921 | { | |
e05df3b1 | 922 | struct page *page; |
7735730d | 923 | int err; |
e05df3b1 JK |
924 | |
925 | if (dn->nid == 0) | |
926 | return 1; | |
927 | ||
928 | /* get direct node */ | |
4d57b86d | 929 | page = f2fs_get_node_page(F2FS_I_SB(dn->inode), dn->nid); |
45586c70 | 930 | if (PTR_ERR(page) == -ENOENT) |
e05df3b1 JK |
931 | return 1; |
932 | else if (IS_ERR(page)) | |
933 | return PTR_ERR(page); | |
934 | ||
935 | /* Make dnode_of_data for parameter */ | |
936 | dn->node_page = page; | |
937 | dn->ofs_in_node = 0; | |
4d57b86d | 938 | f2fs_truncate_data_blocks(dn); |
7735730d CY |
939 | err = truncate_node(dn); |
940 | if (err) | |
941 | return err; | |
942 | ||
e05df3b1 JK |
943 | return 1; |
944 | } | |
945 | ||
946 | static int truncate_nodes(struct dnode_of_data *dn, unsigned int nofs, | |
947 | int ofs, int depth) | |
948 | { | |
e05df3b1 JK |
949 | struct dnode_of_data rdn = *dn; |
950 | struct page *page; | |
951 | struct f2fs_node *rn; | |
952 | nid_t child_nid; | |
953 | unsigned int child_nofs; | |
954 | int freed = 0; | |
955 | int i, ret; | |
956 | ||
957 | if (dn->nid == 0) | |
958 | return NIDS_PER_BLOCK + 1; | |
959 | ||
51dd6249 NJ |
960 | trace_f2fs_truncate_nodes_enter(dn->inode, dn->nid, dn->data_blkaddr); |
961 | ||
4d57b86d | 962 | page = f2fs_get_node_page(F2FS_I_SB(dn->inode), dn->nid); |
51dd6249 NJ |
963 | if (IS_ERR(page)) { |
964 | trace_f2fs_truncate_nodes_exit(dn->inode, PTR_ERR(page)); | |
e05df3b1 | 965 | return PTR_ERR(page); |
51dd6249 | 966 | } |
e05df3b1 | 967 | |
4d57b86d | 968 | f2fs_ra_node_pages(page, ofs, NIDS_PER_BLOCK); |
79344efb | 969 | |
45590710 | 970 | rn = F2FS_NODE(page); |
e05df3b1 JK |
971 | if (depth < 3) { |
972 | for (i = ofs; i < NIDS_PER_BLOCK; i++, freed++) { | |
973 | child_nid = le32_to_cpu(rn->in.nid[i]); | |
974 | if (child_nid == 0) | |
975 | continue; | |
976 | rdn.nid = child_nid; | |
977 | ret = truncate_dnode(&rdn); | |
978 | if (ret < 0) | |
979 | goto out_err; | |
12719ae1 JK |
980 | if (set_nid(page, i, 0, false)) |
981 | dn->node_changed = true; | |
e05df3b1 JK |
982 | } |
983 | } else { | |
984 | child_nofs = nofs + ofs * (NIDS_PER_BLOCK + 1) + 1; | |
985 | for (i = ofs; i < NIDS_PER_BLOCK; i++) { | |
986 | child_nid = le32_to_cpu(rn->in.nid[i]); | |
987 | if (child_nid == 0) { | |
988 | child_nofs += NIDS_PER_BLOCK + 1; | |
989 | continue; | |
990 | } | |
991 | rdn.nid = child_nid; | |
992 | ret = truncate_nodes(&rdn, child_nofs, 0, depth - 1); | |
993 | if (ret == (NIDS_PER_BLOCK + 1)) { | |
12719ae1 JK |
994 | if (set_nid(page, i, 0, false)) |
995 | dn->node_changed = true; | |
e05df3b1 JK |
996 | child_nofs += ret; |
997 | } else if (ret < 0 && ret != -ENOENT) { | |
998 | goto out_err; | |
999 | } | |
1000 | } | |
1001 | freed = child_nofs; | |
1002 | } | |
1003 | ||
1004 | if (!ofs) { | |
1005 | /* remove current indirect node */ | |
1006 | dn->node_page = page; | |
7735730d CY |
1007 | ret = truncate_node(dn); |
1008 | if (ret) | |
1009 | goto out_err; | |
e05df3b1 JK |
1010 | freed++; |
1011 | } else { | |
1012 | f2fs_put_page(page, 1); | |
1013 | } | |
51dd6249 | 1014 | trace_f2fs_truncate_nodes_exit(dn->inode, freed); |
e05df3b1 JK |
1015 | return freed; |
1016 | ||
1017 | out_err: | |
1018 | f2fs_put_page(page, 1); | |
51dd6249 | 1019 | trace_f2fs_truncate_nodes_exit(dn->inode, ret); |
e05df3b1 JK |
1020 | return ret; |
1021 | } | |
1022 | ||
1023 | static int truncate_partial_nodes(struct dnode_of_data *dn, | |
1024 | struct f2fs_inode *ri, int *offset, int depth) | |
1025 | { | |
e05df3b1 JK |
1026 | struct page *pages[2]; |
1027 | nid_t nid[3]; | |
1028 | nid_t child_nid; | |
1029 | int err = 0; | |
1030 | int i; | |
1031 | int idx = depth - 2; | |
1032 | ||
1033 | nid[0] = le32_to_cpu(ri->i_nid[offset[0] - NODE_DIR1_BLOCK]); | |
1034 | if (!nid[0]) | |
1035 | return 0; | |
1036 | ||
1037 | /* get indirect nodes in the path */ | |
a225dca3 | 1038 | for (i = 0; i < idx + 1; i++) { |
e1c42045 | 1039 | /* reference count'll be increased */ |
4d57b86d | 1040 | pages[i] = f2fs_get_node_page(F2FS_I_SB(dn->inode), nid[i]); |
e05df3b1 | 1041 | if (IS_ERR(pages[i])) { |
e05df3b1 | 1042 | err = PTR_ERR(pages[i]); |
a225dca3 | 1043 | idx = i - 1; |
e05df3b1 JK |
1044 | goto fail; |
1045 | } | |
1046 | nid[i + 1] = get_nid(pages[i], offset[i + 1], false); | |
1047 | } | |
1048 | ||
4d57b86d | 1049 | f2fs_ra_node_pages(pages[idx], offset[idx + 1], NIDS_PER_BLOCK); |
79344efb | 1050 | |
e05df3b1 | 1051 | /* free direct nodes linked to a partial indirect node */ |
a225dca3 | 1052 | for (i = offset[idx + 1]; i < NIDS_PER_BLOCK; i++) { |
e05df3b1 JK |
1053 | child_nid = get_nid(pages[idx], i, false); |
1054 | if (!child_nid) | |
1055 | continue; | |
1056 | dn->nid = child_nid; | |
1057 | err = truncate_dnode(dn); | |
1058 | if (err < 0) | |
1059 | goto fail; | |
12719ae1 JK |
1060 | if (set_nid(pages[idx], i, 0, false)) |
1061 | dn->node_changed = true; | |
e05df3b1 JK |
1062 | } |
1063 | ||
a225dca3 | 1064 | if (offset[idx + 1] == 0) { |
e05df3b1 JK |
1065 | dn->node_page = pages[idx]; |
1066 | dn->nid = nid[idx]; | |
7735730d CY |
1067 | err = truncate_node(dn); |
1068 | if (err) | |
1069 | goto fail; | |
e05df3b1 JK |
1070 | } else { |
1071 | f2fs_put_page(pages[idx], 1); | |
1072 | } | |
1073 | offset[idx]++; | |
a225dca3 | 1074 | offset[idx + 1] = 0; |
1075 | idx--; | |
e05df3b1 | 1076 | fail: |
a225dca3 | 1077 | for (i = idx; i >= 0; i--) |
e05df3b1 | 1078 | f2fs_put_page(pages[i], 1); |
51dd6249 NJ |
1079 | |
1080 | trace_f2fs_truncate_partial_nodes(dn->inode, nid, depth, err); | |
1081 | ||
e05df3b1 JK |
1082 | return err; |
1083 | } | |
1084 | ||
0a8165d7 | 1085 | /* |
e05df3b1 JK |
1086 | * All the block addresses of data and nodes should be nullified. |
1087 | */ | |
4d57b86d | 1088 | int f2fs_truncate_inode_blocks(struct inode *inode, pgoff_t from) |
e05df3b1 | 1089 | { |
4081363f | 1090 | struct f2fs_sb_info *sbi = F2FS_I_SB(inode); |
e05df3b1 JK |
1091 | int err = 0, cont = 1; |
1092 | int level, offset[4], noffset[4]; | |
7dd690c8 | 1093 | unsigned int nofs = 0; |
58bfaf44 | 1094 | struct f2fs_inode *ri; |
e05df3b1 JK |
1095 | struct dnode_of_data dn; |
1096 | struct page *page; | |
1097 | ||
51dd6249 NJ |
1098 | trace_f2fs_truncate_inode_blocks_enter(inode, from); |
1099 | ||
81ca7350 | 1100 | level = get_node_path(inode, from, offset, noffset); |
9039d835 YF |
1101 | if (level < 0) { |
1102 | trace_f2fs_truncate_inode_blocks_exit(inode, level); | |
adb6dc19 | 1103 | return level; |
9039d835 | 1104 | } |
ff373558 | 1105 | |
4d57b86d | 1106 | page = f2fs_get_node_page(sbi, inode->i_ino); |
51dd6249 NJ |
1107 | if (IS_ERR(page)) { |
1108 | trace_f2fs_truncate_inode_blocks_exit(inode, PTR_ERR(page)); | |
e05df3b1 | 1109 | return PTR_ERR(page); |
51dd6249 | 1110 | } |
e05df3b1 JK |
1111 | |
1112 | set_new_dnode(&dn, inode, page, NULL, 0); | |
1113 | unlock_page(page); | |
1114 | ||
58bfaf44 | 1115 | ri = F2FS_INODE(page); |
e05df3b1 JK |
1116 | switch (level) { |
1117 | case 0: | |
1118 | case 1: | |
1119 | nofs = noffset[1]; | |
1120 | break; | |
1121 | case 2: | |
1122 | nofs = noffset[1]; | |
1123 | if (!offset[level - 1]) | |
1124 | goto skip_partial; | |
58bfaf44 | 1125 | err = truncate_partial_nodes(&dn, ri, offset, level); |
e05df3b1 JK |
1126 | if (err < 0 && err != -ENOENT) |
1127 | goto fail; | |
1128 | nofs += 1 + NIDS_PER_BLOCK; | |
1129 | break; | |
1130 | case 3: | |
1131 | nofs = 5 + 2 * NIDS_PER_BLOCK; | |
1132 | if (!offset[level - 1]) | |
1133 | goto skip_partial; | |
58bfaf44 | 1134 | err = truncate_partial_nodes(&dn, ri, offset, level); |
e05df3b1 JK |
1135 | if (err < 0 && err != -ENOENT) |
1136 | goto fail; | |
1137 | break; | |
1138 | default: | |
1139 | BUG(); | |
1140 | } | |
1141 | ||
1142 | skip_partial: | |
1143 | while (cont) { | |
58bfaf44 | 1144 | dn.nid = le32_to_cpu(ri->i_nid[offset[0] - NODE_DIR1_BLOCK]); |
e05df3b1 JK |
1145 | switch (offset[0]) { |
1146 | case NODE_DIR1_BLOCK: | |
1147 | case NODE_DIR2_BLOCK: | |
1148 | err = truncate_dnode(&dn); | |
1149 | break; | |
1150 | ||
1151 | case NODE_IND1_BLOCK: | |
1152 | case NODE_IND2_BLOCK: | |
1153 | err = truncate_nodes(&dn, nofs, offset[1], 2); | |
1154 | break; | |
1155 | ||
1156 | case NODE_DIND_BLOCK: | |
1157 | err = truncate_nodes(&dn, nofs, offset[1], 3); | |
1158 | cont = 0; | |
1159 | break; | |
1160 | ||
1161 | default: | |
1162 | BUG(); | |
1163 | } | |
1164 | if (err < 0 && err != -ENOENT) | |
1165 | goto fail; | |
1166 | if (offset[1] == 0 && | |
58bfaf44 | 1167 | ri->i_nid[offset[0] - NODE_DIR1_BLOCK]) { |
e05df3b1 | 1168 | lock_page(page); |
ff373558 | 1169 | BUG_ON(page->mapping != NODE_MAPPING(sbi)); |
bae0ee7a | 1170 | f2fs_wait_on_page_writeback(page, NODE, true, true); |
58bfaf44 | 1171 | ri->i_nid[offset[0] - NODE_DIR1_BLOCK] = 0; |
e05df3b1 JK |
1172 | set_page_dirty(page); |
1173 | unlock_page(page); | |
1174 | } | |
1175 | offset[1] = 0; | |
1176 | offset[0]++; | |
1177 | nofs += err; | |
1178 | } | |
1179 | fail: | |
1180 | f2fs_put_page(page, 0); | |
51dd6249 | 1181 | trace_f2fs_truncate_inode_blocks_exit(inode, err); |
e05df3b1 JK |
1182 | return err > 0 ? 0 : err; |
1183 | } | |
1184 | ||
9c77f754 | 1185 | /* caller must lock inode page */ |
4d57b86d | 1186 | int f2fs_truncate_xattr_node(struct inode *inode) |
4f16fb0f | 1187 | { |
4081363f | 1188 | struct f2fs_sb_info *sbi = F2FS_I_SB(inode); |
4f16fb0f JK |
1189 | nid_t nid = F2FS_I(inode)->i_xattr_nid; |
1190 | struct dnode_of_data dn; | |
1191 | struct page *npage; | |
7735730d | 1192 | int err; |
4f16fb0f JK |
1193 | |
1194 | if (!nid) | |
1195 | return 0; | |
1196 | ||
4d57b86d | 1197 | npage = f2fs_get_node_page(sbi, nid); |
4f16fb0f JK |
1198 | if (IS_ERR(npage)) |
1199 | return PTR_ERR(npage); | |
1200 | ||
7735730d CY |
1201 | set_new_dnode(&dn, inode, NULL, npage, nid); |
1202 | err = truncate_node(&dn); | |
1203 | if (err) { | |
1204 | f2fs_put_page(npage, 1); | |
1205 | return err; | |
1206 | } | |
1207 | ||
205b9822 | 1208 | f2fs_i_xnid_write(inode, 0); |
65985d93 | 1209 | |
4f16fb0f JK |
1210 | return 0; |
1211 | } | |
1212 | ||
39936837 | 1213 | /* |
4f4124d0 CY |
1214 | * Caller should grab and release a rwsem by calling f2fs_lock_op() and |
1215 | * f2fs_unlock_op(). | |
39936837 | 1216 | */ |
4d57b86d | 1217 | int f2fs_remove_inode_page(struct inode *inode) |
e05df3b1 | 1218 | { |
e05df3b1 | 1219 | struct dnode_of_data dn; |
13ec7297 | 1220 | int err; |
e05df3b1 | 1221 | |
c2e69583 | 1222 | set_new_dnode(&dn, inode, NULL, NULL, inode->i_ino); |
4d57b86d | 1223 | err = f2fs_get_dnode_of_data(&dn, 0, LOOKUP_NODE); |
13ec7297 CY |
1224 | if (err) |
1225 | return err; | |
e05df3b1 | 1226 | |
4d57b86d | 1227 | err = f2fs_truncate_xattr_node(inode); |
13ec7297 | 1228 | if (err) { |
c2e69583 | 1229 | f2fs_put_dnode(&dn); |
13ec7297 | 1230 | return err; |
e05df3b1 | 1231 | } |
c2e69583 JK |
1232 | |
1233 | /* remove potential inline_data blocks */ | |
1234 | if (S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) || | |
1235 | S_ISLNK(inode->i_mode)) | |
4d57b86d | 1236 | f2fs_truncate_data_blocks_range(&dn, 1); |
c2e69583 | 1237 | |
e1c42045 | 1238 | /* 0 is possible, after f2fs_new_inode() has failed */ |
8d714f8a JK |
1239 | if (unlikely(f2fs_cp_error(F2FS_I_SB(inode)))) { |
1240 | f2fs_put_dnode(&dn); | |
1241 | return -EIO; | |
1242 | } | |
8b6810f8 CY |
1243 | |
1244 | if (unlikely(inode->i_blocks != 0 && inode->i_blocks != 8)) { | |
097a7686 CY |
1245 | f2fs_warn(F2FS_I_SB(inode), |
1246 | "f2fs_remove_inode_page: inconsistent i_blocks, ino:%lu, iblocks:%llu", | |
1247 | inode->i_ino, (unsigned long long)inode->i_blocks); | |
8b6810f8 CY |
1248 | set_sbi_flag(F2FS_I_SB(inode), SBI_NEED_FSCK); |
1249 | } | |
c2e69583 JK |
1250 | |
1251 | /* will put inode & node pages */ | |
7735730d CY |
1252 | err = truncate_node(&dn); |
1253 | if (err) { | |
1254 | f2fs_put_dnode(&dn); | |
1255 | return err; | |
1256 | } | |
13ec7297 | 1257 | return 0; |
e05df3b1 JK |
1258 | } |
1259 | ||
4d57b86d | 1260 | struct page *f2fs_new_inode_page(struct inode *inode) |
e05df3b1 | 1261 | { |
e05df3b1 JK |
1262 | struct dnode_of_data dn; |
1263 | ||
1264 | /* allocate inode page for new inode */ | |
1265 | set_new_dnode(&dn, inode, NULL, NULL, inode->i_ino); | |
44a83ff6 JK |
1266 | |
1267 | /* caller should f2fs_put_page(page, 1); */ | |
4d57b86d | 1268 | return f2fs_new_node_page(&dn, 0); |
e05df3b1 JK |
1269 | } |
1270 | ||
4d57b86d | 1271 | struct page *f2fs_new_node_page(struct dnode_of_data *dn, unsigned int ofs) |
e05df3b1 | 1272 | { |
4081363f | 1273 | struct f2fs_sb_info *sbi = F2FS_I_SB(dn->inode); |
25cc5d3b | 1274 | struct node_info new_ni; |
e05df3b1 JK |
1275 | struct page *page; |
1276 | int err; | |
1277 | ||
91942321 | 1278 | if (unlikely(is_inode_flag_set(dn->inode, FI_NO_ALLOC))) |
e05df3b1 JK |
1279 | return ERR_PTR(-EPERM); |
1280 | ||
300e129c | 1281 | page = f2fs_grab_cache_page(NODE_MAPPING(sbi), dn->nid, false); |
e05df3b1 JK |
1282 | if (!page) |
1283 | return ERR_PTR(-ENOMEM); | |
1284 | ||
0abd675e | 1285 | if (unlikely((err = inc_valid_node_count(sbi, dn->inode, !ofs)))) |
9c02740c | 1286 | goto fail; |
0abd675e | 1287 | |
25cc5d3b | 1288 | #ifdef CONFIG_F2FS_CHECK_FS |
7735730d CY |
1289 | err = f2fs_get_node_info(sbi, dn->nid, &new_ni); |
1290 | if (err) { | |
1291 | dec_valid_node_count(sbi, dn->inode, !ofs); | |
1292 | goto fail; | |
1293 | } | |
25cc5d3b JK |
1294 | f2fs_bug_on(sbi, new_ni.blk_addr != NULL_ADDR); |
1295 | #endif | |
1296 | new_ni.nid = dn->nid; | |
e05df3b1 | 1297 | new_ni.ino = dn->inode->i_ino; |
25cc5d3b JK |
1298 | new_ni.blk_addr = NULL_ADDR; |
1299 | new_ni.flag = 0; | |
1300 | new_ni.version = 0; | |
479f40c4 | 1301 | set_node_addr(sbi, &new_ni, NEW_ADDR, false); |
9c02740c | 1302 | |
bae0ee7a | 1303 | f2fs_wait_on_page_writeback(page, NODE, true, true); |
9c02740c | 1304 | fill_node_footer(page, dn->nid, dn->inode->i_ino, ofs, true); |
c5667575 | 1305 | set_cold_node(page, S_ISDIR(dn->inode->i_mode)); |
237c0790 JK |
1306 | if (!PageUptodate(page)) |
1307 | SetPageUptodate(page); | |
12719ae1 JK |
1308 | if (set_page_dirty(page)) |
1309 | dn->node_changed = true; | |
e05df3b1 | 1310 | |
4bc8e9bc | 1311 | if (f2fs_has_xattr_block(ofs)) |
205b9822 | 1312 | f2fs_i_xnid_write(dn->inode, dn->nid); |
479bd73a | 1313 | |
e05df3b1 JK |
1314 | if (ofs == 0) |
1315 | inc_valid_inode_count(sbi); | |
e05df3b1 JK |
1316 | return page; |
1317 | ||
1318 | fail: | |
71e9fec5 | 1319 | clear_node_page_dirty(page); |
e05df3b1 JK |
1320 | f2fs_put_page(page, 1); |
1321 | return ERR_PTR(err); | |
1322 | } | |
1323 | ||
56ae674c JK |
1324 | /* |
1325 | * Caller should do after getting the following values. | |
1326 | * 0: f2fs_put_page(page, 0) | |
86531d6b | 1327 | * LOCKED_PAGE or error: f2fs_put_page(page, 1) |
56ae674c | 1328 | */ |
04d328de | 1329 | static int read_node_page(struct page *page, int op_flags) |
e05df3b1 | 1330 | { |
4081363f | 1331 | struct f2fs_sb_info *sbi = F2FS_P_SB(page); |
e05df3b1 | 1332 | struct node_info ni; |
cf04e8eb | 1333 | struct f2fs_io_info fio = { |
05ca3632 | 1334 | .sbi = sbi, |
cf04e8eb | 1335 | .type = NODE, |
04d328de MC |
1336 | .op = REQ_OP_READ, |
1337 | .op_flags = op_flags, | |
05ca3632 | 1338 | .page = page, |
4375a336 | 1339 | .encrypted_page = NULL, |
cf04e8eb | 1340 | }; |
7735730d | 1341 | int err; |
e05df3b1 | 1342 | |
54c55c4e | 1343 | if (PageUptodate(page)) { |
b42b179b CY |
1344 | if (!f2fs_inode_chksum_verify(sbi, page)) { |
1345 | ClearPageUptodate(page); | |
10f966bb | 1346 | return -EFSBADCRC; |
b42b179b | 1347 | } |
3bdad3c7 | 1348 | return LOCKED_PAGE; |
54c55c4e | 1349 | } |
3bdad3c7 | 1350 | |
7735730d CY |
1351 | err = f2fs_get_node_info(sbi, page->index, &ni); |
1352 | if (err) | |
1353 | return err; | |
e05df3b1 | 1354 | |
b7ec2061 JK |
1355 | /* NEW_ADDR can be seen, after cp_error drops some dirty node pages */ |
1356 | if (unlikely(ni.blk_addr == NULL_ADDR || ni.blk_addr == NEW_ADDR) || | |
83a3bfdb | 1357 | is_sbi_flag_set(sbi, SBI_IS_SHUTDOWN)) { |
2bca1e23 | 1358 | ClearPageUptodate(page); |
e05df3b1 | 1359 | return -ENOENT; |
393ff91f JK |
1360 | } |
1361 | ||
7a9d7548 | 1362 | fio.new_blkaddr = fio.old_blkaddr = ni.blk_addr; |
8b83ac81 CY |
1363 | |
1364 | err = f2fs_submit_page_bio(&fio); | |
1365 | ||
1366 | if (!err) | |
1367 | f2fs_update_iostat(sbi, FS_NODE_READ_IO, F2FS_BLKSIZE); | |
1368 | ||
1369 | return err; | |
e05df3b1 JK |
1370 | } |
1371 | ||
0a8165d7 | 1372 | /* |
e05df3b1 JK |
1373 | * Readahead a node page |
1374 | */ | |
4d57b86d | 1375 | void f2fs_ra_node_page(struct f2fs_sb_info *sbi, nid_t nid) |
e05df3b1 | 1376 | { |
e05df3b1 | 1377 | struct page *apage; |
56ae674c | 1378 | int err; |
e05df3b1 | 1379 | |
e8458725 CY |
1380 | if (!nid) |
1381 | return; | |
4d57b86d | 1382 | if (f2fs_check_nid_range(sbi, nid)) |
a4f843bd | 1383 | return; |
e8458725 | 1384 | |
5ec2d99d | 1385 | apage = xa_load(&NODE_MAPPING(sbi)->i_pages, nid); |
999270de | 1386 | if (apage) |
393ff91f | 1387 | return; |
e05df3b1 | 1388 | |
300e129c | 1389 | apage = f2fs_grab_cache_page(NODE_MAPPING(sbi), nid, false); |
e05df3b1 JK |
1390 | if (!apage) |
1391 | return; | |
1392 | ||
70246286 | 1393 | err = read_node_page(apage, REQ_RAHEAD); |
86531d6b | 1394 | f2fs_put_page(apage, err ? 1 : 0); |
e05df3b1 JK |
1395 | } |
1396 | ||
17a0ee55 | 1397 | static struct page *__get_node_page(struct f2fs_sb_info *sbi, pgoff_t nid, |
0e022ea8 | 1398 | struct page *parent, int start) |
e05df3b1 | 1399 | { |
e05df3b1 | 1400 | struct page *page; |
0e022ea8 | 1401 | int err; |
e05df3b1 | 1402 | |
e05df3b1 JK |
1403 | if (!nid) |
1404 | return ERR_PTR(-ENOENT); | |
4d57b86d | 1405 | if (f2fs_check_nid_range(sbi, nid)) |
a4f843bd | 1406 | return ERR_PTR(-EINVAL); |
afcb7ca0 | 1407 | repeat: |
300e129c | 1408 | page = f2fs_grab_cache_page(NODE_MAPPING(sbi), nid, false); |
e05df3b1 JK |
1409 | if (!page) |
1410 | return ERR_PTR(-ENOMEM); | |
1411 | ||
70fd7614 | 1412 | err = read_node_page(page, 0); |
86531d6b JK |
1413 | if (err < 0) { |
1414 | f2fs_put_page(page, 1); | |
e05df3b1 | 1415 | return ERR_PTR(err); |
86531d6b | 1416 | } else if (err == LOCKED_PAGE) { |
1f258ec1 | 1417 | err = 0; |
56ae674c | 1418 | goto page_hit; |
86531d6b | 1419 | } |
e05df3b1 | 1420 | |
0e022ea8 | 1421 | if (parent) |
4d57b86d | 1422 | f2fs_ra_node_pages(parent, start + 1, MAX_RA_NODE); |
c718379b | 1423 | |
e05df3b1 | 1424 | lock_page(page); |
0e022ea8 | 1425 | |
4ef51a8f | 1426 | if (unlikely(page->mapping != NODE_MAPPING(sbi))) { |
afcb7ca0 JK |
1427 | f2fs_put_page(page, 1); |
1428 | goto repeat; | |
1429 | } | |
1563ac75 | 1430 | |
1f258ec1 CY |
1431 | if (unlikely(!PageUptodate(page))) { |
1432 | err = -EIO; | |
1563ac75 | 1433 | goto out_err; |
1f258ec1 | 1434 | } |
704956ec CY |
1435 | |
1436 | if (!f2fs_inode_chksum_verify(sbi, page)) { | |
10f966bb | 1437 | err = -EFSBADCRC; |
704956ec CY |
1438 | goto out_err; |
1439 | } | |
e0f56cb4 | 1440 | page_hit: |
5f029c04 | 1441 | if (unlikely(nid != nid_of_node(page))) { |
dcbb4c10 JP |
1442 | f2fs_warn(sbi, "inconsistent node block, nid:%lu, node_footer[nid:%u,ino:%u,ofs:%u,cpver:%llu,blkaddr:%u]", |
1443 | nid, nid_of_node(page), ino_of_node(page), | |
1444 | ofs_of_node(page), cpver_of_node(page), | |
1445 | next_blkaddr_of_node(page)); | |
51e6c504 | 1446 | set_sbi_flag(sbi, SBI_NEED_FSCK); |
1f258ec1 | 1447 | err = -EINVAL; |
0c9df7fb | 1448 | out_err: |
ee605234 | 1449 | ClearPageUptodate(page); |
0c9df7fb | 1450 | f2fs_put_page(page, 1); |
1f258ec1 | 1451 | return ERR_PTR(err); |
0c9df7fb | 1452 | } |
e05df3b1 JK |
1453 | return page; |
1454 | } | |
1455 | ||
4d57b86d | 1456 | struct page *f2fs_get_node_page(struct f2fs_sb_info *sbi, pgoff_t nid) |
0e022ea8 CY |
1457 | { |
1458 | return __get_node_page(sbi, nid, NULL, 0); | |
1459 | } | |
1460 | ||
4d57b86d | 1461 | struct page *f2fs_get_node_page_ra(struct page *parent, int start) |
0e022ea8 CY |
1462 | { |
1463 | struct f2fs_sb_info *sbi = F2FS_P_SB(parent); | |
1464 | nid_t nid = get_nid(parent, start, false); | |
1465 | ||
1466 | return __get_node_page(sbi, nid, parent, start); | |
1467 | } | |
1468 | ||
2049d4fc JK |
1469 | static void flush_inline_data(struct f2fs_sb_info *sbi, nid_t ino) |
1470 | { | |
1471 | struct inode *inode; | |
1472 | struct page *page; | |
0f3311a8 | 1473 | int ret; |
2049d4fc JK |
1474 | |
1475 | /* should flush inline_data before evict_inode */ | |
1476 | inode = ilookup(sbi->sb, ino); | |
1477 | if (!inode) | |
1478 | return; | |
1479 | ||
01eccef7 CY |
1480 | page = f2fs_pagecache_get_page(inode->i_mapping, 0, |
1481 | FGP_LOCK|FGP_NOWAIT, 0); | |
2049d4fc JK |
1482 | if (!page) |
1483 | goto iput_out; | |
1484 | ||
1485 | if (!PageUptodate(page)) | |
1486 | goto page_out; | |
1487 | ||
1488 | if (!PageDirty(page)) | |
1489 | goto page_out; | |
1490 | ||
1491 | if (!clear_page_dirty_for_io(page)) | |
1492 | goto page_out; | |
1493 | ||
0f3311a8 CY |
1494 | ret = f2fs_write_inline_data(inode, page); |
1495 | inode_dec_dirty_pages(inode); | |
4d57b86d | 1496 | f2fs_remove_dirty_inode(inode); |
0f3311a8 | 1497 | if (ret) |
2049d4fc JK |
1498 | set_page_dirty(page); |
1499 | page_out: | |
4a6de50d | 1500 | f2fs_put_page(page, 1); |
2049d4fc JK |
1501 | iput_out: |
1502 | iput(inode); | |
1503 | } | |
1504 | ||
608514de JK |
1505 | static struct page *last_fsync_dnode(struct f2fs_sb_info *sbi, nid_t ino) |
1506 | { | |
028a63a6 | 1507 | pgoff_t index; |
608514de JK |
1508 | struct pagevec pvec; |
1509 | struct page *last_page = NULL; | |
028a63a6 | 1510 | int nr_pages; |
608514de | 1511 | |
86679820 | 1512 | pagevec_init(&pvec); |
608514de | 1513 | index = 0; |
028a63a6 JK |
1514 | |
1515 | while ((nr_pages = pagevec_lookup_tag(&pvec, NODE_MAPPING(sbi), &index, | |
67fd707f | 1516 | PAGECACHE_TAG_DIRTY))) { |
028a63a6 | 1517 | int i; |
608514de JK |
1518 | |
1519 | for (i = 0; i < nr_pages; i++) { | |
1520 | struct page *page = pvec.pages[i]; | |
1521 | ||
1522 | if (unlikely(f2fs_cp_error(sbi))) { | |
1523 | f2fs_put_page(last_page, 0); | |
1524 | pagevec_release(&pvec); | |
1525 | return ERR_PTR(-EIO); | |
1526 | } | |
1527 | ||
1528 | if (!IS_DNODE(page) || !is_cold_node(page)) | |
1529 | continue; | |
1530 | if (ino_of_node(page) != ino) | |
1531 | continue; | |
1532 | ||
1533 | lock_page(page); | |
1534 | ||
1535 | if (unlikely(page->mapping != NODE_MAPPING(sbi))) { | |
1536 | continue_unlock: | |
1537 | unlock_page(page); | |
1538 | continue; | |
1539 | } | |
1540 | if (ino_of_node(page) != ino) | |
1541 | goto continue_unlock; | |
1542 | ||
1543 | if (!PageDirty(page)) { | |
1544 | /* someone wrote it for us */ | |
1545 | goto continue_unlock; | |
1546 | } | |
1547 | ||
1548 | if (last_page) | |
1549 | f2fs_put_page(last_page, 0); | |
1550 | ||
1551 | get_page(page); | |
1552 | last_page = page; | |
1553 | unlock_page(page); | |
1554 | } | |
1555 | pagevec_release(&pvec); | |
1556 | cond_resched(); | |
1557 | } | |
1558 | return last_page; | |
1559 | } | |
1560 | ||
d68f735b | 1561 | static int __write_node_page(struct page *page, bool atomic, bool *submitted, |
b0af6d49 | 1562 | struct writeback_control *wbc, bool do_balance, |
50fa53ec | 1563 | enum iostat_type io_type, unsigned int *seq_id) |
faa24895 JK |
1564 | { |
1565 | struct f2fs_sb_info *sbi = F2FS_P_SB(page); | |
1566 | nid_t nid; | |
1567 | struct node_info ni; | |
1568 | struct f2fs_io_info fio = { | |
1569 | .sbi = sbi, | |
39d787be | 1570 | .ino = ino_of_node(page), |
faa24895 JK |
1571 | .type = NODE, |
1572 | .op = REQ_OP_WRITE, | |
1573 | .op_flags = wbc_to_write_flags(wbc), | |
1574 | .page = page, | |
1575 | .encrypted_page = NULL, | |
d68f735b | 1576 | .submitted = false, |
b0af6d49 | 1577 | .io_type = io_type, |
578c6478 | 1578 | .io_wbc = wbc, |
faa24895 | 1579 | }; |
50fa53ec | 1580 | unsigned int seq; |
faa24895 JK |
1581 | |
1582 | trace_f2fs_writepage(page, NODE); | |
1583 | ||
6d7c865c | 1584 | if (unlikely(f2fs_cp_error(sbi))) { |
28607bf3 JK |
1585 | ClearPageUptodate(page); |
1586 | dec_page_count(sbi, F2FS_DIRTY_NODES); | |
1587 | unlock_page(page); | |
1588 | return 0; | |
6d7c865c | 1589 | } |
db198ae0 | 1590 | |
faa24895 JK |
1591 | if (unlikely(is_sbi_flag_set(sbi, SBI_POR_DOING))) |
1592 | goto redirty_out; | |
faa24895 | 1593 | |
100c0655 JK |
1594 | if (!is_sbi_flag_set(sbi, SBI_CP_DISABLED) && |
1595 | wbc->sync_mode == WB_SYNC_NONE && | |
fd8c8caf CY |
1596 | IS_DNODE(page) && is_cold_node(page)) |
1597 | goto redirty_out; | |
1598 | ||
faa24895 JK |
1599 | /* get old block addr of this node page */ |
1600 | nid = nid_of_node(page); | |
1601 | f2fs_bug_on(sbi, page->index != nid); | |
1602 | ||
7735730d CY |
1603 | if (f2fs_get_node_info(sbi, nid, &ni)) |
1604 | goto redirty_out; | |
1605 | ||
faa24895 JK |
1606 | if (wbc->for_reclaim) { |
1607 | if (!down_read_trylock(&sbi->node_write)) | |
1608 | goto redirty_out; | |
1609 | } else { | |
1610 | down_read(&sbi->node_write); | |
1611 | } | |
1612 | ||
faa24895 JK |
1613 | /* This page is already truncated */ |
1614 | if (unlikely(ni.blk_addr == NULL_ADDR)) { | |
1615 | ClearPageUptodate(page); | |
1616 | dec_page_count(sbi, F2FS_DIRTY_NODES); | |
1617 | up_read(&sbi->node_write); | |
1618 | unlock_page(page); | |
1619 | return 0; | |
1620 | } | |
1621 | ||
c9b60788 | 1622 | if (__is_valid_data_blkaddr(ni.blk_addr) && |
93770ab7 CY |
1623 | !f2fs_is_valid_blkaddr(sbi, ni.blk_addr, |
1624 | DATA_GENERIC_ENHANCE)) { | |
89d13c38 | 1625 | up_read(&sbi->node_write); |
c9b60788 | 1626 | goto redirty_out; |
89d13c38 | 1627 | } |
c9b60788 | 1628 | |
e7c75ab0 JK |
1629 | if (atomic && !test_opt(sbi, NOBARRIER)) |
1630 | fio.op_flags |= REQ_PREFLUSH | REQ_FUA; | |
1631 | ||
dc5a9412 | 1632 | /* should add to global list before clearing PAGECACHE status */ |
50fa53ec CY |
1633 | if (f2fs_in_warm_node_list(sbi, page)) { |
1634 | seq = f2fs_add_fsync_node_entry(sbi, page); | |
1635 | if (seq_id) | |
1636 | *seq_id = seq; | |
1637 | } | |
1638 | ||
dc5a9412 CY |
1639 | set_page_writeback(page); |
1640 | ClearPageError(page); | |
1641 | ||
faa24895 | 1642 | fio.old_blkaddr = ni.blk_addr; |
4d57b86d | 1643 | f2fs_do_write_node_page(nid, &fio); |
faa24895 JK |
1644 | set_node_addr(sbi, &ni, fio.new_blkaddr, is_fsync_dnode(page)); |
1645 | dec_page_count(sbi, F2FS_DIRTY_NODES); | |
1646 | up_read(&sbi->node_write); | |
1647 | ||
d68f735b | 1648 | if (wbc->for_reclaim) { |
bab475c5 | 1649 | f2fs_submit_merged_write_cond(sbi, NULL, page, 0, NODE); |
d68f735b JK |
1650 | submitted = NULL; |
1651 | } | |
faa24895 JK |
1652 | |
1653 | unlock_page(page); | |
1654 | ||
d68f735b | 1655 | if (unlikely(f2fs_cp_error(sbi))) { |
b9109b0e | 1656 | f2fs_submit_merged_write(sbi, NODE); |
d68f735b JK |
1657 | submitted = NULL; |
1658 | } | |
1659 | if (submitted) | |
1660 | *submitted = fio.submitted; | |
faa24895 | 1661 | |
401db79f YS |
1662 | if (do_balance) |
1663 | f2fs_balance_fs(sbi, false); | |
faa24895 JK |
1664 | return 0; |
1665 | ||
1666 | redirty_out: | |
1667 | redirty_page_for_writepage(wbc, page); | |
1668 | return AOP_WRITEPAGE_ACTIVATE; | |
1669 | } | |
1670 | ||
48018b4c | 1671 | int f2fs_move_node_page(struct page *node_page, int gc_type) |
f15194fc | 1672 | { |
48018b4c CY |
1673 | int err = 0; |
1674 | ||
f15194fc YH |
1675 | if (gc_type == FG_GC) { |
1676 | struct writeback_control wbc = { | |
1677 | .sync_mode = WB_SYNC_ALL, | |
1678 | .nr_to_write = 1, | |
1679 | .for_reclaim = 0, | |
1680 | }; | |
1681 | ||
bae0ee7a | 1682 | f2fs_wait_on_page_writeback(node_page, NODE, true, true); |
8d64d365 CY |
1683 | |
1684 | set_page_dirty(node_page); | |
1685 | ||
48018b4c CY |
1686 | if (!clear_page_dirty_for_io(node_page)) { |
1687 | err = -EAGAIN; | |
f15194fc | 1688 | goto out_page; |
48018b4c | 1689 | } |
f15194fc YH |
1690 | |
1691 | if (__write_node_page(node_page, false, NULL, | |
48018b4c CY |
1692 | &wbc, false, FS_GC_NODE_IO, NULL)) { |
1693 | err = -EAGAIN; | |
f15194fc | 1694 | unlock_page(node_page); |
48018b4c | 1695 | } |
f15194fc YH |
1696 | goto release_page; |
1697 | } else { | |
1698 | /* set page dirty and write it */ | |
1699 | if (!PageWriteback(node_page)) | |
1700 | set_page_dirty(node_page); | |
1701 | } | |
1702 | out_page: | |
1703 | unlock_page(node_page); | |
1704 | release_page: | |
1705 | f2fs_put_page(node_page, 0); | |
48018b4c | 1706 | return err; |
f15194fc YH |
1707 | } |
1708 | ||
faa24895 JK |
1709 | static int f2fs_write_node_page(struct page *page, |
1710 | struct writeback_control *wbc) | |
1711 | { | |
50fa53ec CY |
1712 | return __write_node_page(page, false, NULL, wbc, false, |
1713 | FS_NODE_IO, NULL); | |
faa24895 JK |
1714 | } |
1715 | ||
4d57b86d | 1716 | int f2fs_fsync_node_pages(struct f2fs_sb_info *sbi, struct inode *inode, |
50fa53ec CY |
1717 | struct writeback_control *wbc, bool atomic, |
1718 | unsigned int *seq_id) | |
e05df3b1 | 1719 | { |
028a63a6 | 1720 | pgoff_t index; |
e05df3b1 | 1721 | struct pagevec pvec; |
c267ec15 | 1722 | int ret = 0; |
608514de JK |
1723 | struct page *last_page = NULL; |
1724 | bool marked = false; | |
26de9b11 | 1725 | nid_t ino = inode->i_ino; |
028a63a6 | 1726 | int nr_pages; |
bab475c5 | 1727 | int nwritten = 0; |
52681375 | 1728 | |
608514de JK |
1729 | if (atomic) { |
1730 | last_page = last_fsync_dnode(sbi, ino); | |
1731 | if (IS_ERR_OR_NULL(last_page)) | |
1732 | return PTR_ERR_OR_ZERO(last_page); | |
1733 | } | |
1734 | retry: | |
86679820 | 1735 | pagevec_init(&pvec); |
52681375 | 1736 | index = 0; |
028a63a6 JK |
1737 | |
1738 | while ((nr_pages = pagevec_lookup_tag(&pvec, NODE_MAPPING(sbi), &index, | |
67fd707f | 1739 | PAGECACHE_TAG_DIRTY))) { |
028a63a6 | 1740 | int i; |
52681375 JK |
1741 | |
1742 | for (i = 0; i < nr_pages; i++) { | |
1743 | struct page *page = pvec.pages[i]; | |
d68f735b | 1744 | bool submitted = false; |
52681375 JK |
1745 | |
1746 | if (unlikely(f2fs_cp_error(sbi))) { | |
608514de | 1747 | f2fs_put_page(last_page, 0); |
52681375 | 1748 | pagevec_release(&pvec); |
9de69279 CY |
1749 | ret = -EIO; |
1750 | goto out; | |
52681375 JK |
1751 | } |
1752 | ||
1753 | if (!IS_DNODE(page) || !is_cold_node(page)) | |
1754 | continue; | |
1755 | if (ino_of_node(page) != ino) | |
1756 | continue; | |
1757 | ||
1758 | lock_page(page); | |
1759 | ||
1760 | if (unlikely(page->mapping != NODE_MAPPING(sbi))) { | |
1761 | continue_unlock: | |
1762 | unlock_page(page); | |
1763 | continue; | |
1764 | } | |
1765 | if (ino_of_node(page) != ino) | |
1766 | goto continue_unlock; | |
1767 | ||
608514de | 1768 | if (!PageDirty(page) && page != last_page) { |
52681375 JK |
1769 | /* someone wrote it for us */ |
1770 | goto continue_unlock; | |
1771 | } | |
1772 | ||
bae0ee7a | 1773 | f2fs_wait_on_page_writeback(page, NODE, true, true); |
52681375 | 1774 | |
d29fd172 JK |
1775 | set_fsync_mark(page, 0); |
1776 | set_dentry_mark(page, 0); | |
1777 | ||
608514de JK |
1778 | if (!atomic || page == last_page) { |
1779 | set_fsync_mark(page, 1); | |
26de9b11 JK |
1780 | if (IS_INODE(page)) { |
1781 | if (is_inode_flag_set(inode, | |
1782 | FI_DIRTY_INODE)) | |
4d57b86d | 1783 | f2fs_update_inode(inode, page); |
608514de | 1784 | set_dentry_mark(page, |
4d57b86d | 1785 | f2fs_need_dentry_mark(sbi, ino)); |
26de9b11 | 1786 | } |
a87aff1d | 1787 | /* may be written by other thread */ |
608514de JK |
1788 | if (!PageDirty(page)) |
1789 | set_page_dirty(page); | |
1790 | } | |
1791 | ||
1792 | if (!clear_page_dirty_for_io(page)) | |
1793 | goto continue_unlock; | |
52681375 | 1794 | |
e7c75ab0 | 1795 | ret = __write_node_page(page, atomic && |
d68f735b | 1796 | page == last_page, |
b0af6d49 | 1797 | &submitted, wbc, true, |
50fa53ec | 1798 | FS_NODE_IO, seq_id); |
c267ec15 | 1799 | if (ret) { |
52681375 | 1800 | unlock_page(page); |
608514de JK |
1801 | f2fs_put_page(last_page, 0); |
1802 | break; | |
d68f735b | 1803 | } else if (submitted) { |
bab475c5 | 1804 | nwritten++; |
608514de | 1805 | } |
3f5f4959 | 1806 | |
608514de JK |
1807 | if (page == last_page) { |
1808 | f2fs_put_page(page, 0); | |
1809 | marked = true; | |
52681375 | 1810 | break; |
c267ec15 | 1811 | } |
52681375 JK |
1812 | } |
1813 | pagevec_release(&pvec); | |
1814 | cond_resched(); | |
1815 | ||
608514de | 1816 | if (ret || marked) |
52681375 JK |
1817 | break; |
1818 | } | |
608514de | 1819 | if (!ret && atomic && !marked) { |
dcbb4c10 JP |
1820 | f2fs_debug(sbi, "Retry to write fsync mark: ino=%u, idx=%lx", |
1821 | ino, last_page->index); | |
608514de | 1822 | lock_page(last_page); |
bae0ee7a | 1823 | f2fs_wait_on_page_writeback(last_page, NODE, true, true); |
608514de JK |
1824 | set_page_dirty(last_page); |
1825 | unlock_page(last_page); | |
1826 | goto retry; | |
1827 | } | |
9de69279 | 1828 | out: |
bab475c5 CY |
1829 | if (nwritten) |
1830 | f2fs_submit_merged_write_cond(sbi, NULL, NULL, ino, NODE); | |
5f029c04 | 1831 | return ret ? -EIO : 0; |
52681375 JK |
1832 | } |
1833 | ||
052a82d8 CY |
1834 | static int f2fs_match_ino(struct inode *inode, unsigned long ino, void *data) |
1835 | { | |
1836 | struct f2fs_sb_info *sbi = F2FS_I_SB(inode); | |
1837 | bool clean; | |
1838 | ||
1839 | if (inode->i_ino != ino) | |
1840 | return 0; | |
1841 | ||
1842 | if (!is_inode_flag_set(inode, FI_DIRTY_INODE)) | |
1843 | return 0; | |
1844 | ||
1845 | spin_lock(&sbi->inode_lock[DIRTY_META]); | |
1846 | clean = list_empty(&F2FS_I(inode)->gdirty_list); | |
1847 | spin_unlock(&sbi->inode_lock[DIRTY_META]); | |
1848 | ||
1849 | if (clean) | |
1850 | return 0; | |
1851 | ||
1852 | inode = igrab(inode); | |
1853 | if (!inode) | |
1854 | return 0; | |
1855 | return 1; | |
1856 | } | |
1857 | ||
1858 | static bool flush_dirty_inode(struct page *page) | |
1859 | { | |
1860 | struct f2fs_sb_info *sbi = F2FS_P_SB(page); | |
1861 | struct inode *inode; | |
1862 | nid_t ino = ino_of_node(page); | |
1863 | ||
1864 | inode = find_inode_nowait(sbi->sb, ino, f2fs_match_ino, NULL); | |
1865 | if (!inode) | |
1866 | return false; | |
1867 | ||
1868 | f2fs_update_inode(inode, page); | |
1869 | unlock_page(page); | |
1870 | ||
1871 | iput(inode); | |
1872 | return true; | |
1873 | } | |
1874 | ||
68e79baf | 1875 | void f2fs_flush_inline_data(struct f2fs_sb_info *sbi) |
34c061ad SL |
1876 | { |
1877 | pgoff_t index = 0; | |
1878 | struct pagevec pvec; | |
1879 | int nr_pages; | |
34c061ad SL |
1880 | |
1881 | pagevec_init(&pvec); | |
1882 | ||
1883 | while ((nr_pages = pagevec_lookup_tag(&pvec, | |
1884 | NODE_MAPPING(sbi), &index, PAGECACHE_TAG_DIRTY))) { | |
1885 | int i; | |
1886 | ||
1887 | for (i = 0; i < nr_pages; i++) { | |
1888 | struct page *page = pvec.pages[i]; | |
1889 | ||
1890 | if (!IS_DNODE(page)) | |
1891 | continue; | |
1892 | ||
1893 | lock_page(page); | |
1894 | ||
1895 | if (unlikely(page->mapping != NODE_MAPPING(sbi))) { | |
1896 | continue_unlock: | |
1897 | unlock_page(page); | |
1898 | continue; | |
1899 | } | |
1900 | ||
1901 | if (!PageDirty(page)) { | |
1902 | /* someone wrote it for us */ | |
1903 | goto continue_unlock; | |
1904 | } | |
1905 | ||
1906 | /* flush inline_data, if it's async context. */ | |
b763f3be CY |
1907 | if (page_private_inline(page)) { |
1908 | clear_page_private_inline(page); | |
34c061ad SL |
1909 | unlock_page(page); |
1910 | flush_inline_data(sbi, ino_of_node(page)); | |
1911 | continue; | |
1912 | } | |
1913 | unlock_page(page); | |
1914 | } | |
1915 | pagevec_release(&pvec); | |
1916 | cond_resched(); | |
1917 | } | |
34c061ad SL |
1918 | } |
1919 | ||
4d57b86d CY |
1920 | int f2fs_sync_node_pages(struct f2fs_sb_info *sbi, |
1921 | struct writeback_control *wbc, | |
b0af6d49 | 1922 | bool do_balance, enum iostat_type io_type) |
52681375 | 1923 | { |
028a63a6 | 1924 | pgoff_t index; |
52681375 JK |
1925 | struct pagevec pvec; |
1926 | int step = 0; | |
12bb0a8f | 1927 | int nwritten = 0; |
3f5f4959 | 1928 | int ret = 0; |
c29fd0c0 | 1929 | int nr_pages, done = 0; |
e05df3b1 | 1930 | |
86679820 | 1931 | pagevec_init(&pvec); |
e05df3b1 JK |
1932 | |
1933 | next_step: | |
1934 | index = 0; | |
028a63a6 | 1935 | |
c29fd0c0 CY |
1936 | while (!done && (nr_pages = pagevec_lookup_tag(&pvec, |
1937 | NODE_MAPPING(sbi), &index, PAGECACHE_TAG_DIRTY))) { | |
028a63a6 | 1938 | int i; |
e05df3b1 JK |
1939 | |
1940 | for (i = 0; i < nr_pages; i++) { | |
1941 | struct page *page = pvec.pages[i]; | |
d68f735b | 1942 | bool submitted = false; |
052a82d8 | 1943 | bool may_dirty = true; |
e05df3b1 | 1944 | |
c29fd0c0 CY |
1945 | /* give a priority to WB_SYNC threads */ |
1946 | if (atomic_read(&sbi->wb_sync_req[NODE]) && | |
1947 | wbc->sync_mode == WB_SYNC_NONE) { | |
1948 | done = 1; | |
1949 | break; | |
1950 | } | |
1951 | ||
e05df3b1 JK |
1952 | /* |
1953 | * flushing sequence with step: | |
1954 | * 0. indirect nodes | |
1955 | * 1. dentry dnodes | |
1956 | * 2. file dnodes | |
1957 | */ | |
1958 | if (step == 0 && IS_DNODE(page)) | |
1959 | continue; | |
1960 | if (step == 1 && (!IS_DNODE(page) || | |
1961 | is_cold_node(page))) | |
1962 | continue; | |
1963 | if (step == 2 && (!IS_DNODE(page) || | |
1964 | !is_cold_node(page))) | |
1965 | continue; | |
9a4cbc9e | 1966 | lock_node: |
4b270a8c CY |
1967 | if (wbc->sync_mode == WB_SYNC_ALL) |
1968 | lock_page(page); | |
1969 | else if (!trylock_page(page)) | |
e05df3b1 JK |
1970 | continue; |
1971 | ||
4ef51a8f | 1972 | if (unlikely(page->mapping != NODE_MAPPING(sbi))) { |
e05df3b1 JK |
1973 | continue_unlock: |
1974 | unlock_page(page); | |
1975 | continue; | |
1976 | } | |
e05df3b1 JK |
1977 | |
1978 | if (!PageDirty(page)) { | |
1979 | /* someone wrote it for us */ | |
1980 | goto continue_unlock; | |
1981 | } | |
1982 | ||
b0f3b87f JK |
1983 | /* flush inline_data/inode, if it's async context. */ |
1984 | if (!do_balance) | |
1985 | goto write_node; | |
1986 | ||
1987 | /* flush inline_data */ | |
b763f3be CY |
1988 | if (page_private_inline(page)) { |
1989 | clear_page_private_inline(page); | |
2049d4fc JK |
1990 | unlock_page(page); |
1991 | flush_inline_data(sbi, ino_of_node(page)); | |
9a4cbc9e | 1992 | goto lock_node; |
052a82d8 CY |
1993 | } |
1994 | ||
1995 | /* flush dirty inode */ | |
1996 | if (IS_INODE(page) && may_dirty) { | |
1997 | may_dirty = false; | |
1998 | if (flush_dirty_inode(page)) | |
1999 | goto lock_node; | |
2049d4fc | 2000 | } |
b0f3b87f | 2001 | write_node: |
bae0ee7a | 2002 | f2fs_wait_on_page_writeback(page, NODE, true, true); |
fa3d2bdf | 2003 | |
e05df3b1 JK |
2004 | if (!clear_page_dirty_for_io(page)) |
2005 | goto continue_unlock; | |
2006 | ||
52681375 JK |
2007 | set_fsync_mark(page, 0); |
2008 | set_dentry_mark(page, 0); | |
52746519 | 2009 | |
401db79f | 2010 | ret = __write_node_page(page, false, &submitted, |
50fa53ec | 2011 | wbc, do_balance, io_type, NULL); |
d68f735b | 2012 | if (ret) |
52746519 | 2013 | unlock_page(page); |
d68f735b | 2014 | else if (submitted) |
3f5f4959 | 2015 | nwritten++; |
e05df3b1 JK |
2016 | |
2017 | if (--wbc->nr_to_write == 0) | |
2018 | break; | |
2019 | } | |
2020 | pagevec_release(&pvec); | |
2021 | cond_resched(); | |
2022 | ||
2023 | if (wbc->nr_to_write == 0) { | |
2024 | step = 2; | |
2025 | break; | |
2026 | } | |
2027 | } | |
2028 | ||
2029 | if (step < 2) { | |
100c0655 JK |
2030 | if (!is_sbi_flag_set(sbi, SBI_CP_DISABLED) && |
2031 | wbc->sync_mode == WB_SYNC_NONE && step == 1) | |
fd8c8caf | 2032 | goto out; |
e05df3b1 JK |
2033 | step++; |
2034 | goto next_step; | |
2035 | } | |
fd8c8caf | 2036 | out: |
3f5f4959 | 2037 | if (nwritten) |
b9109b0e | 2038 | f2fs_submit_merged_write(sbi, NODE); |
db198ae0 CY |
2039 | |
2040 | if (unlikely(f2fs_cp_error(sbi))) | |
2041 | return -EIO; | |
3f5f4959 | 2042 | return ret; |
e05df3b1 JK |
2043 | } |
2044 | ||
50fa53ec CY |
2045 | int f2fs_wait_on_node_pages_writeback(struct f2fs_sb_info *sbi, |
2046 | unsigned int seq_id) | |
cfe58f9d | 2047 | { |
50fa53ec CY |
2048 | struct fsync_node_entry *fn; |
2049 | struct page *page; | |
2050 | struct list_head *head = &sbi->fsync_node_list; | |
2051 | unsigned long flags; | |
2052 | unsigned int cur_seq_id = 0; | |
280db3c8 | 2053 | int ret2, ret = 0; |
cfe58f9d | 2054 | |
50fa53ec CY |
2055 | while (seq_id && cur_seq_id < seq_id) { |
2056 | spin_lock_irqsave(&sbi->fsync_node_lock, flags); | |
2057 | if (list_empty(head)) { | |
2058 | spin_unlock_irqrestore(&sbi->fsync_node_lock, flags); | |
2059 | break; | |
2060 | } | |
2061 | fn = list_first_entry(head, struct fsync_node_entry, list); | |
2062 | if (fn->seq_id > seq_id) { | |
2063 | spin_unlock_irqrestore(&sbi->fsync_node_lock, flags); | |
2064 | break; | |
2065 | } | |
2066 | cur_seq_id = fn->seq_id; | |
2067 | page = fn->page; | |
2068 | get_page(page); | |
2069 | spin_unlock_irqrestore(&sbi->fsync_node_lock, flags); | |
4ef51a8f | 2070 | |
bae0ee7a | 2071 | f2fs_wait_on_page_writeback(page, NODE, true, false); |
50fa53ec CY |
2072 | if (TestClearPageError(page)) |
2073 | ret = -EIO; | |
cfe58f9d | 2074 | |
50fa53ec | 2075 | put_page(page); |
cfe58f9d | 2076 | |
50fa53ec CY |
2077 | if (ret) |
2078 | break; | |
cfe58f9d JK |
2079 | } |
2080 | ||
280db3c8 | 2081 | ret2 = filemap_check_errors(NODE_MAPPING(sbi)); |
cfe58f9d JK |
2082 | if (!ret) |
2083 | ret = ret2; | |
50fa53ec | 2084 | |
cfe58f9d JK |
2085 | return ret; |
2086 | } | |
2087 | ||
e05df3b1 JK |
2088 | static int f2fs_write_node_pages(struct address_space *mapping, |
2089 | struct writeback_control *wbc) | |
2090 | { | |
4081363f | 2091 | struct f2fs_sb_info *sbi = F2FS_M_SB(mapping); |
9dfa1baf | 2092 | struct blk_plug plug; |
50c8cdb3 | 2093 | long diff; |
e05df3b1 | 2094 | |
0771fcc7 CY |
2095 | if (unlikely(is_sbi_flag_set(sbi, SBI_POR_DOING))) |
2096 | goto skip_write; | |
2097 | ||
4660f9c0 | 2098 | /* balancing f2fs's metadata in background */ |
7bcd0cfa | 2099 | f2fs_balance_fs_bg(sbi, true); |
e05df3b1 | 2100 | |
a7fdffbd | 2101 | /* collect a number of dirty node pages and write together */ |
812a9597 JK |
2102 | if (wbc->sync_mode != WB_SYNC_ALL && |
2103 | get_pages(sbi, F2FS_DIRTY_NODES) < | |
2104 | nr_pages_to_skip(sbi, NODE)) | |
d3baf95d | 2105 | goto skip_write; |
a7fdffbd | 2106 | |
c29fd0c0 CY |
2107 | if (wbc->sync_mode == WB_SYNC_ALL) |
2108 | atomic_inc(&sbi->wb_sync_req[NODE]); | |
a4e317db CY |
2109 | else if (atomic_read(&sbi->wb_sync_req[NODE])) { |
2110 | /* to avoid potential deadlock */ | |
2111 | if (current->plug) | |
2112 | blk_finish_plug(current->plug); | |
c29fd0c0 | 2113 | goto skip_write; |
a4e317db | 2114 | } |
c29fd0c0 | 2115 | |
d31c7c3f YH |
2116 | trace_f2fs_writepages(mapping->host, wbc, NODE); |
2117 | ||
50c8cdb3 | 2118 | diff = nr_pages_to_write(sbi, NODE, wbc); |
9dfa1baf | 2119 | blk_start_plug(&plug); |
4d57b86d | 2120 | f2fs_sync_node_pages(sbi, wbc, true, FS_NODE_IO); |
9dfa1baf | 2121 | blk_finish_plug(&plug); |
50c8cdb3 | 2122 | wbc->nr_to_write = max((long)0, wbc->nr_to_write - diff); |
c29fd0c0 CY |
2123 | |
2124 | if (wbc->sync_mode == WB_SYNC_ALL) | |
2125 | atomic_dec(&sbi->wb_sync_req[NODE]); | |
e05df3b1 | 2126 | return 0; |
d3baf95d JK |
2127 | |
2128 | skip_write: | |
2129 | wbc->pages_skipped += get_pages(sbi, F2FS_DIRTY_NODES); | |
d31c7c3f | 2130 | trace_f2fs_writepages(mapping->host, wbc, NODE); |
d3baf95d | 2131 | return 0; |
e05df3b1 JK |
2132 | } |
2133 | ||
2134 | static int f2fs_set_node_page_dirty(struct page *page) | |
2135 | { | |
26c6b887 JK |
2136 | trace_f2fs_set_page_dirty(page, NODE); |
2137 | ||
237c0790 JK |
2138 | if (!PageUptodate(page)) |
2139 | SetPageUptodate(page); | |
54c55c4e WG |
2140 | #ifdef CONFIG_F2FS_CHECK_FS |
2141 | if (IS_INODE(page)) | |
2142 | f2fs_inode_chksum_set(F2FS_P_SB(page), page); | |
2143 | #endif | |
e05df3b1 | 2144 | if (!PageDirty(page)) { |
b87078ad | 2145 | __set_page_dirty_nobuffers(page); |
4081363f | 2146 | inc_page_count(F2FS_P_SB(page), F2FS_DIRTY_NODES); |
b763f3be | 2147 | set_page_private_reference(page); |
e05df3b1 JK |
2148 | return 1; |
2149 | } | |
2150 | return 0; | |
2151 | } | |
2152 | ||
0a8165d7 | 2153 | /* |
e05df3b1 JK |
2154 | * Structure of the f2fs node operations |
2155 | */ | |
2156 | const struct address_space_operations f2fs_node_aops = { | |
2157 | .writepage = f2fs_write_node_page, | |
2158 | .writepages = f2fs_write_node_pages, | |
2159 | .set_page_dirty = f2fs_set_node_page_dirty, | |
487261f3 CY |
2160 | .invalidatepage = f2fs_invalidate_page, |
2161 | .releasepage = f2fs_release_page, | |
5b7a487c | 2162 | #ifdef CONFIG_MIGRATION |
a87aff1d | 2163 | .migratepage = f2fs_migrate_page, |
5b7a487c | 2164 | #endif |
e05df3b1 JK |
2165 | }; |
2166 | ||
8a7ed66a JK |
2167 | static struct free_nid *__lookup_free_nid_list(struct f2fs_nm_info *nm_i, |
2168 | nid_t n) | |
e05df3b1 | 2169 | { |
8a7ed66a | 2170 | return radix_tree_lookup(&nm_i->free_nid_root, n); |
e05df3b1 JK |
2171 | } |
2172 | ||
9a4ffdf5 | 2173 | static int __insert_free_nid(struct f2fs_sb_info *sbi, |
b815bdc7 | 2174 | struct free_nid *i) |
e05df3b1 | 2175 | { |
b8559dc2 | 2176 | struct f2fs_nm_info *nm_i = NM_I(sbi); |
a0761f63 | 2177 | int err = radix_tree_insert(&nm_i->free_nid_root, i->nid, i); |
5f029c04 | 2178 | |
a0761f63 FL |
2179 | if (err) |
2180 | return err; | |
eb0aa4b8 | 2181 | |
b815bdc7 LS |
2182 | nm_i->nid_cnt[FREE_NID]++; |
2183 | list_add_tail(&i->list, &nm_i->free_nid_list); | |
eb0aa4b8 | 2184 | return 0; |
b8559dc2 CY |
2185 | } |
2186 | ||
9a4ffdf5 | 2187 | static void __remove_free_nid(struct f2fs_sb_info *sbi, |
a0761f63 | 2188 | struct free_nid *i, enum nid_state state) |
b8559dc2 CY |
2189 | { |
2190 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
2191 | ||
9a4ffdf5 CY |
2192 | f2fs_bug_on(sbi, state != i->state); |
2193 | nm_i->nid_cnt[state]--; | |
2194 | if (state == FREE_NID) | |
2195 | list_del(&i->list); | |
a0761f63 FL |
2196 | radix_tree_delete(&nm_i->free_nid_root, i->nid); |
2197 | } | |
2198 | ||
2199 | static void __move_free_nid(struct f2fs_sb_info *sbi, struct free_nid *i, | |
2200 | enum nid_state org_state, enum nid_state dst_state) | |
b8559dc2 CY |
2201 | { |
2202 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
2203 | ||
a0761f63 FL |
2204 | f2fs_bug_on(sbi, org_state != i->state); |
2205 | i->state = dst_state; | |
2206 | nm_i->nid_cnt[org_state]--; | |
2207 | nm_i->nid_cnt[dst_state]++; | |
2208 | ||
2209 | switch (dst_state) { | |
2210 | case PREALLOC_NID: | |
2211 | list_del(&i->list); | |
2212 | break; | |
2213 | case FREE_NID: | |
2214 | list_add_tail(&i->list, &nm_i->free_nid_list); | |
2215 | break; | |
2216 | default: | |
2217 | BUG_ON(1); | |
2218 | } | |
e05df3b1 JK |
2219 | } |
2220 | ||
94c821fb CY |
2221 | bool f2fs_nat_bitmap_enabled(struct f2fs_sb_info *sbi) |
2222 | { | |
2223 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
2224 | unsigned int i; | |
2225 | bool ret = true; | |
2226 | ||
2227 | down_read(&nm_i->nat_tree_lock); | |
2228 | for (i = 0; i < nm_i->nat_blocks; i++) { | |
2229 | if (!test_bit_le(i, nm_i->nat_block_bitmap)) { | |
2230 | ret = false; | |
2231 | break; | |
2232 | } | |
2233 | } | |
2234 | up_read(&nm_i->nat_tree_lock); | |
2235 | ||
2236 | return ret; | |
2237 | } | |
2238 | ||
5921aaa1 L |
2239 | static void update_free_nid_bitmap(struct f2fs_sb_info *sbi, nid_t nid, |
2240 | bool set, bool build) | |
2241 | { | |
2242 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
2243 | unsigned int nat_ofs = NAT_BLOCK_OFFSET(nid); | |
2244 | unsigned int nid_ofs = nid - START_NID(nid); | |
2245 | ||
2246 | if (!test_bit_le(nat_ofs, nm_i->nat_block_bitmap)) | |
2247 | return; | |
2248 | ||
2249 | if (set) { | |
2250 | if (test_bit_le(nid_ofs, nm_i->free_nid_bitmap[nat_ofs])) | |
2251 | return; | |
2252 | __set_bit_le(nid_ofs, nm_i->free_nid_bitmap[nat_ofs]); | |
2253 | nm_i->free_nid_count[nat_ofs]++; | |
2254 | } else { | |
2255 | if (!test_bit_le(nid_ofs, nm_i->free_nid_bitmap[nat_ofs])) | |
2256 | return; | |
2257 | __clear_bit_le(nid_ofs, nm_i->free_nid_bitmap[nat_ofs]); | |
2258 | if (!build) | |
2259 | nm_i->free_nid_count[nat_ofs]--; | |
2260 | } | |
2261 | } | |
2262 | ||
4ac91242 | 2263 | /* return if the nid is recognized as free */ |
5921aaa1 L |
2264 | static bool add_free_nid(struct f2fs_sb_info *sbi, |
2265 | nid_t nid, bool build, bool update) | |
e05df3b1 | 2266 | { |
6fb03f3a | 2267 | struct f2fs_nm_info *nm_i = NM_I(sbi); |
30a61ddf | 2268 | struct free_nid *i, *e; |
59bbd474 | 2269 | struct nat_entry *ne; |
30a61ddf CY |
2270 | int err = -EINVAL; |
2271 | bool ret = false; | |
9198aceb JK |
2272 | |
2273 | /* 0 nid should not be used */ | |
cfb271d4 | 2274 | if (unlikely(nid == 0)) |
4ac91242 | 2275 | return false; |
59bbd474 | 2276 | |
626bcf2b CY |
2277 | if (unlikely(f2fs_check_nid_range(sbi, nid))) |
2278 | return false; | |
2279 | ||
32410577 | 2280 | i = f2fs_kmem_cache_alloc(free_nid_slab, GFP_NOFS, true, NULL); |
e05df3b1 | 2281 | i->nid = nid; |
9a4ffdf5 | 2282 | i->state = FREE_NID; |
e05df3b1 | 2283 | |
5921aaa1 | 2284 | radix_tree_preload(GFP_NOFS | __GFP_NOFAIL); |
769ec6e5 | 2285 | |
b8559dc2 | 2286 | spin_lock(&nm_i->nid_list_lock); |
30a61ddf CY |
2287 | |
2288 | if (build) { | |
2289 | /* | |
2290 | * Thread A Thread B | |
2291 | * - f2fs_create | |
2292 | * - f2fs_new_inode | |
4d57b86d | 2293 | * - f2fs_alloc_nid |
9a4ffdf5 | 2294 | * - __insert_nid_to_list(PREALLOC_NID) |
30a61ddf | 2295 | * - f2fs_balance_fs_bg |
4d57b86d CY |
2296 | * - f2fs_build_free_nids |
2297 | * - __f2fs_build_free_nids | |
30a61ddf CY |
2298 | * - scan_nat_page |
2299 | * - add_free_nid | |
2300 | * - __lookup_nat_cache | |
2301 | * - f2fs_add_link | |
4d57b86d CY |
2302 | * - f2fs_init_inode_metadata |
2303 | * - f2fs_new_inode_page | |
2304 | * - f2fs_new_node_page | |
30a61ddf | 2305 | * - set_node_addr |
4d57b86d | 2306 | * - f2fs_alloc_nid_done |
9a4ffdf5 CY |
2307 | * - __remove_nid_from_list(PREALLOC_NID) |
2308 | * - __insert_nid_to_list(FREE_NID) | |
30a61ddf CY |
2309 | */ |
2310 | ne = __lookup_nat_cache(nm_i, nid); | |
2311 | if (ne && (!get_nat_flag(ne, IS_CHECKPOINTED) || | |
2312 | nat_get_blkaddr(ne) != NULL_ADDR)) | |
2313 | goto err_out; | |
2314 | ||
2315 | e = __lookup_free_nid_list(nm_i, nid); | |
2316 | if (e) { | |
9a4ffdf5 | 2317 | if (e->state == FREE_NID) |
30a61ddf CY |
2318 | ret = true; |
2319 | goto err_out; | |
2320 | } | |
2321 | } | |
2322 | ret = true; | |
b815bdc7 | 2323 | err = __insert_free_nid(sbi, i); |
30a61ddf | 2324 | err_out: |
5921aaa1 L |
2325 | if (update) { |
2326 | update_free_nid_bitmap(sbi, nid, ret, build); | |
2327 | if (!build) | |
2328 | nm_i->available_nids++; | |
2329 | } | |
eb0aa4b8 JK |
2330 | spin_unlock(&nm_i->nid_list_lock); |
2331 | radix_tree_preload_end(); | |
5921aaa1 | 2332 | |
30a61ddf | 2333 | if (err) |
e05df3b1 | 2334 | kmem_cache_free(free_nid_slab, i); |
30a61ddf | 2335 | return ret; |
e05df3b1 JK |
2336 | } |
2337 | ||
b8559dc2 | 2338 | static void remove_free_nid(struct f2fs_sb_info *sbi, nid_t nid) |
e05df3b1 | 2339 | { |
b8559dc2 | 2340 | struct f2fs_nm_info *nm_i = NM_I(sbi); |
e05df3b1 | 2341 | struct free_nid *i; |
cf0ee0f0 CY |
2342 | bool need_free = false; |
2343 | ||
b8559dc2 | 2344 | spin_lock(&nm_i->nid_list_lock); |
8a7ed66a | 2345 | i = __lookup_free_nid_list(nm_i, nid); |
9a4ffdf5 | 2346 | if (i && i->state == FREE_NID) { |
a0761f63 | 2347 | __remove_free_nid(sbi, i, FREE_NID); |
cf0ee0f0 | 2348 | need_free = true; |
e05df3b1 | 2349 | } |
b8559dc2 | 2350 | spin_unlock(&nm_i->nid_list_lock); |
cf0ee0f0 CY |
2351 | |
2352 | if (need_free) | |
2353 | kmem_cache_free(free_nid_slab, i); | |
e05df3b1 JK |
2354 | } |
2355 | ||
e2374015 | 2356 | static int scan_nat_page(struct f2fs_sb_info *sbi, |
e05df3b1 JK |
2357 | struct page *nat_page, nid_t start_nid) |
2358 | { | |
6fb03f3a | 2359 | struct f2fs_nm_info *nm_i = NM_I(sbi); |
e05df3b1 JK |
2360 | struct f2fs_nat_block *nat_blk = page_address(nat_page); |
2361 | block_t blk_addr; | |
4ac91242 | 2362 | unsigned int nat_ofs = NAT_BLOCK_OFFSET(start_nid); |
e05df3b1 JK |
2363 | int i; |
2364 | ||
23380b85 | 2365 | __set_bit_le(nat_ofs, nm_i->nat_block_bitmap); |
4ac91242 | 2366 | |
e05df3b1 JK |
2367 | i = start_nid % NAT_ENTRY_PER_BLOCK; |
2368 | ||
2369 | for (; i < NAT_ENTRY_PER_BLOCK; i++, start_nid++) { | |
cfb271d4 | 2370 | if (unlikely(start_nid >= nm_i->max_nid)) |
04431c44 | 2371 | break; |
23d38844 HL |
2372 | |
2373 | blk_addr = le32_to_cpu(nat_blk->entries[i].block_addr); | |
e2374015 CY |
2374 | |
2375 | if (blk_addr == NEW_ADDR) | |
2376 | return -EINVAL; | |
2377 | ||
5921aaa1 L |
2378 | if (blk_addr == NULL_ADDR) { |
2379 | add_free_nid(sbi, start_nid, true, true); | |
2380 | } else { | |
2381 | spin_lock(&NM_I(sbi)->nid_list_lock); | |
2382 | update_free_nid_bitmap(sbi, start_nid, false, true); | |
2383 | spin_unlock(&NM_I(sbi)->nid_list_lock); | |
2384 | } | |
4ac91242 | 2385 | } |
e2374015 CY |
2386 | |
2387 | return 0; | |
4ac91242 CY |
2388 | } |
2389 | ||
2fbaa25f | 2390 | static void scan_curseg_cache(struct f2fs_sb_info *sbi) |
4ac91242 | 2391 | { |
4ac91242 CY |
2392 | struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); |
2393 | struct f2fs_journal *journal = curseg->journal; | |
2fbaa25f CY |
2394 | int i; |
2395 | ||
2396 | down_read(&curseg->journal_rwsem); | |
2397 | for (i = 0; i < nats_in_cursum(journal); i++) { | |
2398 | block_t addr; | |
2399 | nid_t nid; | |
2400 | ||
2401 | addr = le32_to_cpu(nat_in_journal(journal, i).block_addr); | |
2402 | nid = le32_to_cpu(nid_in_journal(journal, i)); | |
2403 | if (addr == NULL_ADDR) | |
5921aaa1 | 2404 | add_free_nid(sbi, nid, true, false); |
2fbaa25f CY |
2405 | else |
2406 | remove_free_nid(sbi, nid); | |
2407 | } | |
2408 | up_read(&curseg->journal_rwsem); | |
2409 | } | |
2410 | ||
2411 | static void scan_free_nid_bits(struct f2fs_sb_info *sbi) | |
2412 | { | |
2413 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
4ac91242 | 2414 | unsigned int i, idx; |
97456574 | 2415 | nid_t nid; |
4ac91242 CY |
2416 | |
2417 | down_read(&nm_i->nat_tree_lock); | |
2418 | ||
2419 | for (i = 0; i < nm_i->nat_blocks; i++) { | |
2420 | if (!test_bit_le(i, nm_i->nat_block_bitmap)) | |
2421 | continue; | |
586d1492 CY |
2422 | if (!nm_i->free_nid_count[i]) |
2423 | continue; | |
4ac91242 | 2424 | for (idx = 0; idx < NAT_ENTRY_PER_BLOCK; idx++) { |
97456574 FL |
2425 | idx = find_next_bit_le(nm_i->free_nid_bitmap[i], |
2426 | NAT_ENTRY_PER_BLOCK, idx); | |
2427 | if (idx >= NAT_ENTRY_PER_BLOCK) | |
2428 | break; | |
4ac91242 CY |
2429 | |
2430 | nid = i * NAT_ENTRY_PER_BLOCK + idx; | |
5921aaa1 | 2431 | add_free_nid(sbi, nid, true, false); |
4ac91242 | 2432 | |
9a4ffdf5 | 2433 | if (nm_i->nid_cnt[FREE_NID] >= MAX_FREE_NIDS) |
4ac91242 CY |
2434 | goto out; |
2435 | } | |
2436 | } | |
2437 | out: | |
2fbaa25f | 2438 | scan_curseg_cache(sbi); |
4ac91242 | 2439 | |
4ac91242 | 2440 | up_read(&nm_i->nat_tree_lock); |
e05df3b1 JK |
2441 | } |
2442 | ||
e2374015 | 2443 | static int __f2fs_build_free_nids(struct f2fs_sb_info *sbi, |
4d57b86d | 2444 | bool sync, bool mount) |
e05df3b1 | 2445 | { |
e05df3b1 | 2446 | struct f2fs_nm_info *nm_i = NM_I(sbi); |
e2374015 | 2447 | int i = 0, ret; |
55008d84 | 2448 | nid_t nid = nm_i->next_scan_nid; |
e05df3b1 | 2449 | |
e9cdd307 YH |
2450 | if (unlikely(nid >= nm_i->max_nid)) |
2451 | nid = 0; | |
2452 | ||
e2cab031 ST |
2453 | if (unlikely(nid % NAT_ENTRY_PER_BLOCK)) |
2454 | nid = NAT_BLOCK_OFFSET(nid) * NAT_ENTRY_PER_BLOCK; | |
2455 | ||
55008d84 | 2456 | /* Enough entries */ |
9a4ffdf5 | 2457 | if (nm_i->nid_cnt[FREE_NID] >= NAT_ENTRY_PER_BLOCK) |
e2374015 | 2458 | return 0; |
e05df3b1 | 2459 | |
4d57b86d | 2460 | if (!sync && !f2fs_available_free_memory(sbi, FREE_NIDS)) |
e2374015 | 2461 | return 0; |
e05df3b1 | 2462 | |
4ac91242 CY |
2463 | if (!mount) { |
2464 | /* try to find free nids in free_nid_bitmap */ | |
2465 | scan_free_nid_bits(sbi); | |
2466 | ||
74986213 | 2467 | if (nm_i->nid_cnt[FREE_NID] >= NAT_ENTRY_PER_BLOCK) |
e2374015 | 2468 | return 0; |
22ad0b6a JK |
2469 | } |
2470 | ||
55008d84 | 2471 | /* readahead nat pages to be scanned */ |
4d57b86d | 2472 | f2fs_ra_meta_pages(sbi, NAT_BLOCK_OFFSET(nid), FREE_NID_PAGES, |
26879fb1 | 2473 | META_NAT, true); |
e05df3b1 | 2474 | |
b873b798 | 2475 | down_read(&nm_i->nat_tree_lock); |
a5131193 | 2476 | |
e05df3b1 | 2477 | while (1) { |
66e83361 YH |
2478 | if (!test_bit_le(NAT_BLOCK_OFFSET(nid), |
2479 | nm_i->nat_block_bitmap)) { | |
2480 | struct page *page = get_current_nat_page(sbi, nid); | |
e05df3b1 | 2481 | |
edc55aaf JK |
2482 | if (IS_ERR(page)) { |
2483 | ret = PTR_ERR(page); | |
2484 | } else { | |
2485 | ret = scan_nat_page(sbi, page, nid); | |
2486 | f2fs_put_page(page, 1); | |
2487 | } | |
e2374015 CY |
2488 | |
2489 | if (ret) { | |
2490 | up_read(&nm_i->nat_tree_lock); | |
dcbb4c10 | 2491 | f2fs_err(sbi, "NAT is corrupt, run fsck to fix it"); |
edc55aaf | 2492 | return ret; |
e2374015 | 2493 | } |
66e83361 | 2494 | } |
e05df3b1 JK |
2495 | |
2496 | nid += (NAT_ENTRY_PER_BLOCK - (nid % NAT_ENTRY_PER_BLOCK)); | |
cfb271d4 | 2497 | if (unlikely(nid >= nm_i->max_nid)) |
e05df3b1 | 2498 | nid = 0; |
55008d84 | 2499 | |
a6d494b6 | 2500 | if (++i >= FREE_NID_PAGES) |
e05df3b1 JK |
2501 | break; |
2502 | } | |
2503 | ||
55008d84 JK |
2504 | /* go to the next free nat pages to find free nids abundantly */ |
2505 | nm_i->next_scan_nid = nid; | |
e05df3b1 JK |
2506 | |
2507 | /* find free nids from current sum_pages */ | |
2fbaa25f | 2508 | scan_curseg_cache(sbi); |
dfc08a12 | 2509 | |
b873b798 | 2510 | up_read(&nm_i->nat_tree_lock); |
2db2388f | 2511 | |
4d57b86d | 2512 | f2fs_ra_meta_pages(sbi, NAT_BLOCK_OFFSET(nm_i->next_scan_nid), |
ea1a29a0 | 2513 | nm_i->ra_nid_pages, META_NAT, false); |
e2374015 CY |
2514 | |
2515 | return 0; | |
e05df3b1 JK |
2516 | } |
2517 | ||
e2374015 | 2518 | int f2fs_build_free_nids(struct f2fs_sb_info *sbi, bool sync, bool mount) |
2411cf5b | 2519 | { |
e2374015 CY |
2520 | int ret; |
2521 | ||
2411cf5b | 2522 | mutex_lock(&NM_I(sbi)->build_lock); |
e2374015 | 2523 | ret = __f2fs_build_free_nids(sbi, sync, mount); |
2411cf5b | 2524 | mutex_unlock(&NM_I(sbi)->build_lock); |
e2374015 CY |
2525 | |
2526 | return ret; | |
2411cf5b CY |
2527 | } |
2528 | ||
e05df3b1 JK |
2529 | /* |
2530 | * If this function returns success, caller can obtain a new nid | |
2531 | * from second parameter of this function. | |
2532 | * The returned nid could be used ino as well as nid when inode is created. | |
2533 | */ | |
4d57b86d | 2534 | bool f2fs_alloc_nid(struct f2fs_sb_info *sbi, nid_t *nid) |
e05df3b1 JK |
2535 | { |
2536 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
2537 | struct free_nid *i = NULL; | |
e05df3b1 | 2538 | retry: |
55523519 | 2539 | if (time_to_inject(sbi, FAULT_ALLOC_NID)) { |
c45d6002 | 2540 | f2fs_show_injection_info(sbi, FAULT_ALLOC_NID); |
cb78942b | 2541 | return false; |
55523519 | 2542 | } |
7fa750a1 | 2543 | |
b8559dc2 | 2544 | spin_lock(&nm_i->nid_list_lock); |
e05df3b1 | 2545 | |
04d47e67 CY |
2546 | if (unlikely(nm_i->available_nids == 0)) { |
2547 | spin_unlock(&nm_i->nid_list_lock); | |
2548 | return false; | |
2549 | } | |
e05df3b1 | 2550 | |
4d57b86d CY |
2551 | /* We should not use stale free nids created by f2fs_build_free_nids */ |
2552 | if (nm_i->nid_cnt[FREE_NID] && !on_f2fs_build_free_nids(nm_i)) { | |
9a4ffdf5 CY |
2553 | f2fs_bug_on(sbi, list_empty(&nm_i->free_nid_list)); |
2554 | i = list_first_entry(&nm_i->free_nid_list, | |
b8559dc2 | 2555 | struct free_nid, list); |
55008d84 | 2556 | *nid = i->nid; |
b8559dc2 | 2557 | |
a0761f63 | 2558 | __move_free_nid(sbi, i, FREE_NID, PREALLOC_NID); |
04d47e67 | 2559 | nm_i->available_nids--; |
4ac91242 | 2560 | |
346fe752 | 2561 | update_free_nid_bitmap(sbi, *nid, false, false); |
4ac91242 | 2562 | |
b8559dc2 | 2563 | spin_unlock(&nm_i->nid_list_lock); |
55008d84 JK |
2564 | return true; |
2565 | } | |
b8559dc2 | 2566 | spin_unlock(&nm_i->nid_list_lock); |
55008d84 JK |
2567 | |
2568 | /* Let's scan nat pages and its caches to get free nids */ | |
f84262b0 JK |
2569 | if (!f2fs_build_free_nids(sbi, true, false)) |
2570 | goto retry; | |
2571 | return false; | |
e05df3b1 JK |
2572 | } |
2573 | ||
0a8165d7 | 2574 | /* |
4d57b86d | 2575 | * f2fs_alloc_nid() should be called prior to this function. |
e05df3b1 | 2576 | */ |
4d57b86d | 2577 | void f2fs_alloc_nid_done(struct f2fs_sb_info *sbi, nid_t nid) |
e05df3b1 JK |
2578 | { |
2579 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
2580 | struct free_nid *i; | |
2581 | ||
b8559dc2 | 2582 | spin_lock(&nm_i->nid_list_lock); |
8a7ed66a | 2583 | i = __lookup_free_nid_list(nm_i, nid); |
b8559dc2 | 2584 | f2fs_bug_on(sbi, !i); |
a0761f63 | 2585 | __remove_free_nid(sbi, i, PREALLOC_NID); |
b8559dc2 | 2586 | spin_unlock(&nm_i->nid_list_lock); |
cf0ee0f0 CY |
2587 | |
2588 | kmem_cache_free(free_nid_slab, i); | |
e05df3b1 JK |
2589 | } |
2590 | ||
0a8165d7 | 2591 | /* |
4d57b86d | 2592 | * f2fs_alloc_nid() should be called prior to this function. |
e05df3b1 | 2593 | */ |
4d57b86d | 2594 | void f2fs_alloc_nid_failed(struct f2fs_sb_info *sbi, nid_t nid) |
e05df3b1 | 2595 | { |
49952fa1 JK |
2596 | struct f2fs_nm_info *nm_i = NM_I(sbi); |
2597 | struct free_nid *i; | |
cf0ee0f0 | 2598 | bool need_free = false; |
49952fa1 | 2599 | |
65985d93 JK |
2600 | if (!nid) |
2601 | return; | |
2602 | ||
b8559dc2 | 2603 | spin_lock(&nm_i->nid_list_lock); |
8a7ed66a | 2604 | i = __lookup_free_nid_list(nm_i, nid); |
b8559dc2 CY |
2605 | f2fs_bug_on(sbi, !i); |
2606 | ||
4d57b86d | 2607 | if (!f2fs_available_free_memory(sbi, FREE_NIDS)) { |
a0761f63 | 2608 | __remove_free_nid(sbi, i, PREALLOC_NID); |
cf0ee0f0 | 2609 | need_free = true; |
95630cba | 2610 | } else { |
a0761f63 | 2611 | __move_free_nid(sbi, i, PREALLOC_NID, FREE_NID); |
95630cba | 2612 | } |
04d47e67 CY |
2613 | |
2614 | nm_i->available_nids++; | |
2615 | ||
346fe752 | 2616 | update_free_nid_bitmap(sbi, nid, true, false); |
4ac91242 | 2617 | |
b8559dc2 | 2618 | spin_unlock(&nm_i->nid_list_lock); |
cf0ee0f0 CY |
2619 | |
2620 | if (need_free) | |
2621 | kmem_cache_free(free_nid_slab, i); | |
e05df3b1 JK |
2622 | } |
2623 | ||
4d57b86d | 2624 | int f2fs_try_to_free_nids(struct f2fs_sb_info *sbi, int nr_shrink) |
31696580 CY |
2625 | { |
2626 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
31696580 CY |
2627 | int nr = nr_shrink; |
2628 | ||
9a4ffdf5 | 2629 | if (nm_i->nid_cnt[FREE_NID] <= MAX_FREE_NIDS) |
ad4edb83 JK |
2630 | return 0; |
2631 | ||
31696580 CY |
2632 | if (!mutex_trylock(&nm_i->build_lock)) |
2633 | return 0; | |
2634 | ||
042be373 CY |
2635 | while (nr_shrink && nm_i->nid_cnt[FREE_NID] > MAX_FREE_NIDS) { |
2636 | struct free_nid *i, *next; | |
2637 | unsigned int batch = SHRINK_NID_BATCH_SIZE; | |
b8559dc2 | 2638 | |
042be373 CY |
2639 | spin_lock(&nm_i->nid_list_lock); |
2640 | list_for_each_entry_safe(i, next, &nm_i->free_nid_list, list) { | |
2641 | if (!nr_shrink || !batch || | |
2642 | nm_i->nid_cnt[FREE_NID] <= MAX_FREE_NIDS) | |
2643 | break; | |
2644 | __remove_free_nid(sbi, i, FREE_NID); | |
2645 | kmem_cache_free(free_nid_slab, i); | |
2646 | nr_shrink--; | |
2647 | batch--; | |
2648 | } | |
2649 | spin_unlock(&nm_i->nid_list_lock); | |
31696580 | 2650 | } |
042be373 | 2651 | |
31696580 CY |
2652 | mutex_unlock(&nm_i->build_lock); |
2653 | ||
2654 | return nr - nr_shrink; | |
2655 | } | |
2656 | ||
9627a7b3 | 2657 | int f2fs_recover_inline_xattr(struct inode *inode, struct page *page) |
28cdce04 | 2658 | { |
28cdce04 CY |
2659 | void *src_addr, *dst_addr; |
2660 | size_t inline_size; | |
2661 | struct page *ipage; | |
2662 | struct f2fs_inode *ri; | |
2663 | ||
4d57b86d | 2664 | ipage = f2fs_get_node_page(F2FS_I_SB(inode), inode->i_ino); |
9627a7b3 CY |
2665 | if (IS_ERR(ipage)) |
2666 | return PTR_ERR(ipage); | |
28cdce04 | 2667 | |
e3b4d43f | 2668 | ri = F2FS_INODE(page); |
1eca05aa | 2669 | if (ri->i_inline & F2FS_INLINE_XATTR) { |
96dd0251 CY |
2670 | if (!f2fs_has_inline_xattr(inode)) { |
2671 | set_inode_flag(inode, FI_INLINE_XATTR); | |
2672 | stat_inc_inline_xattr(inode); | |
2673 | } | |
1eca05aa | 2674 | } else { |
96dd0251 CY |
2675 | if (f2fs_has_inline_xattr(inode)) { |
2676 | stat_dec_inline_xattr(inode); | |
2677 | clear_inode_flag(inode, FI_INLINE_XATTR); | |
2678 | } | |
e3b4d43f JK |
2679 | goto update_inode; |
2680 | } | |
2681 | ||
6afc662e CY |
2682 | dst_addr = inline_xattr_addr(inode, ipage); |
2683 | src_addr = inline_xattr_addr(inode, page); | |
28cdce04 CY |
2684 | inline_size = inline_xattr_size(inode); |
2685 | ||
bae0ee7a | 2686 | f2fs_wait_on_page_writeback(ipage, NODE, true, true); |
28cdce04 | 2687 | memcpy(dst_addr, src_addr, inline_size); |
e3b4d43f | 2688 | update_inode: |
4d57b86d | 2689 | f2fs_update_inode(inode, ipage); |
28cdce04 | 2690 | f2fs_put_page(ipage, 1); |
9627a7b3 | 2691 | return 0; |
28cdce04 CY |
2692 | } |
2693 | ||
4d57b86d | 2694 | int f2fs_recover_xattr_data(struct inode *inode, struct page *page) |
abb2366c | 2695 | { |
4081363f | 2696 | struct f2fs_sb_info *sbi = F2FS_I_SB(inode); |
abb2366c | 2697 | nid_t prev_xnid = F2FS_I(inode)->i_xattr_nid; |
87905682 YH |
2698 | nid_t new_xnid; |
2699 | struct dnode_of_data dn; | |
abb2366c | 2700 | struct node_info ni; |
d260081c | 2701 | struct page *xpage; |
7735730d | 2702 | int err; |
abb2366c | 2703 | |
abb2366c JK |
2704 | if (!prev_xnid) |
2705 | goto recover_xnid; | |
2706 | ||
d260081c | 2707 | /* 1: invalidate the previous xattr nid */ |
7735730d CY |
2708 | err = f2fs_get_node_info(sbi, prev_xnid, &ni); |
2709 | if (err) | |
2710 | return err; | |
2711 | ||
4d57b86d | 2712 | f2fs_invalidate_blocks(sbi, ni.blk_addr); |
000519f2 | 2713 | dec_valid_node_count(sbi, inode, false); |
479f40c4 | 2714 | set_node_addr(sbi, &ni, NULL_ADDR, false); |
abb2366c JK |
2715 | |
2716 | recover_xnid: | |
d260081c | 2717 | /* 2: update xattr nid in inode */ |
4d57b86d | 2718 | if (!f2fs_alloc_nid(sbi, &new_xnid)) |
87905682 YH |
2719 | return -ENOSPC; |
2720 | ||
2721 | set_new_dnode(&dn, inode, NULL, NULL, new_xnid); | |
4d57b86d | 2722 | xpage = f2fs_new_node_page(&dn, XATTR_NODE_OFFSET); |
87905682 | 2723 | if (IS_ERR(xpage)) { |
4d57b86d | 2724 | f2fs_alloc_nid_failed(sbi, new_xnid); |
87905682 YH |
2725 | return PTR_ERR(xpage); |
2726 | } | |
2727 | ||
4d57b86d CY |
2728 | f2fs_alloc_nid_done(sbi, new_xnid); |
2729 | f2fs_update_inode_page(inode); | |
d260081c CY |
2730 | |
2731 | /* 3: update and set xattr node page dirty */ | |
87905682 | 2732 | memcpy(F2FS_NODE(xpage), F2FS_NODE(page), VALID_XATTR_BLOCK_SIZE); |
abb2366c | 2733 | |
d260081c CY |
2734 | set_page_dirty(xpage); |
2735 | f2fs_put_page(xpage, 1); | |
abb2366c | 2736 | |
d260081c | 2737 | return 0; |
abb2366c JK |
2738 | } |
2739 | ||
4d57b86d | 2740 | int f2fs_recover_inode_page(struct f2fs_sb_info *sbi, struct page *page) |
e05df3b1 | 2741 | { |
58bfaf44 | 2742 | struct f2fs_inode *src, *dst; |
e05df3b1 JK |
2743 | nid_t ino = ino_of_node(page); |
2744 | struct node_info old_ni, new_ni; | |
2745 | struct page *ipage; | |
7735730d | 2746 | int err; |
e05df3b1 | 2747 | |
7735730d CY |
2748 | err = f2fs_get_node_info(sbi, ino, &old_ni); |
2749 | if (err) | |
2750 | return err; | |
e8271fa3 JK |
2751 | |
2752 | if (unlikely(old_ni.blk_addr != NULL_ADDR)) | |
2753 | return -EINVAL; | |
e8ea9b3d | 2754 | retry: |
300e129c | 2755 | ipage = f2fs_grab_cache_page(NODE_MAPPING(sbi), ino, false); |
e8ea9b3d | 2756 | if (!ipage) { |
5df7731f | 2757 | congestion_wait(BLK_RW_ASYNC, DEFAULT_IO_TIMEOUT); |
e8ea9b3d JK |
2758 | goto retry; |
2759 | } | |
e05df3b1 | 2760 | |
e1c42045 | 2761 | /* Should not use this inode from free nid list */ |
b8559dc2 | 2762 | remove_free_nid(sbi, ino); |
e05df3b1 | 2763 | |
237c0790 JK |
2764 | if (!PageUptodate(ipage)) |
2765 | SetPageUptodate(ipage); | |
e05df3b1 | 2766 | fill_node_footer(ipage, ino, ino, 0, true); |
ef2a0071 | 2767 | set_cold_node(ipage, false); |
e05df3b1 | 2768 | |
58bfaf44 JK |
2769 | src = F2FS_INODE(page); |
2770 | dst = F2FS_INODE(ipage); | |
e05df3b1 | 2771 | |
36218b81 | 2772 | memcpy(dst, src, offsetof(struct f2fs_inode, i_ext)); |
58bfaf44 JK |
2773 | dst->i_size = 0; |
2774 | dst->i_blocks = cpu_to_le64(1); | |
2775 | dst->i_links = cpu_to_le32(1); | |
2776 | dst->i_xattr_nid = 0; | |
7a2af766 | 2777 | dst->i_inline = src->i_inline & (F2FS_INLINE_XATTR | F2FS_EXTRA_ATTR); |
5c57132e | 2778 | if (dst->i_inline & F2FS_EXTRA_ATTR) { |
7a2af766 | 2779 | dst->i_extra_isize = src->i_extra_isize; |
6afc662e | 2780 | |
7beb01f7 | 2781 | if (f2fs_sb_has_flexible_inline_xattr(sbi) && |
6afc662e CY |
2782 | F2FS_FITS_IN_INODE(src, le16_to_cpu(src->i_extra_isize), |
2783 | i_inline_xattr_size)) | |
2784 | dst->i_inline_xattr_size = src->i_inline_xattr_size; | |
2785 | ||
7beb01f7 | 2786 | if (f2fs_sb_has_project_quota(sbi) && |
5c57132e CY |
2787 | F2FS_FITS_IN_INODE(src, le16_to_cpu(src->i_extra_isize), |
2788 | i_projid)) | |
2789 | dst->i_projid = src->i_projid; | |
5cd1f387 | 2790 | |
7beb01f7 | 2791 | if (f2fs_sb_has_inode_crtime(sbi) && |
5cd1f387 CY |
2792 | F2FS_FITS_IN_INODE(src, le16_to_cpu(src->i_extra_isize), |
2793 | i_crtime_nsec)) { | |
2794 | dst->i_crtime = src->i_crtime; | |
2795 | dst->i_crtime_nsec = src->i_crtime_nsec; | |
2796 | } | |
5c57132e | 2797 | } |
e05df3b1 JK |
2798 | |
2799 | new_ni = old_ni; | |
2800 | new_ni.ino = ino; | |
2801 | ||
0abd675e | 2802 | if (unlikely(inc_valid_node_count(sbi, NULL, true))) |
65e5cd0a | 2803 | WARN_ON(1); |
479f40c4 | 2804 | set_node_addr(sbi, &new_ni, NEW_ADDR, false); |
e05df3b1 | 2805 | inc_valid_inode_count(sbi); |
617deb8c | 2806 | set_page_dirty(ipage); |
e05df3b1 JK |
2807 | f2fs_put_page(ipage, 1); |
2808 | return 0; | |
2809 | } | |
2810 | ||
7735730d | 2811 | int f2fs_restore_node_summary(struct f2fs_sb_info *sbi, |
e05df3b1 JK |
2812 | unsigned int segno, struct f2fs_summary_block *sum) |
2813 | { | |
2814 | struct f2fs_node *rn; | |
2815 | struct f2fs_summary *sum_entry; | |
e05df3b1 | 2816 | block_t addr; |
9ecf4b80 | 2817 | int i, idx, last_offset, nrpages; |
e05df3b1 JK |
2818 | |
2819 | /* scan the node segment */ | |
2820 | last_offset = sbi->blocks_per_seg; | |
2821 | addr = START_BLOCK(sbi, segno); | |
2822 | sum_entry = &sum->entries[0]; | |
2823 | ||
9ecf4b80 | 2824 | for (i = 0; i < last_offset; i += nrpages, addr += nrpages) { |
5f7136db | 2825 | nrpages = bio_max_segs(last_offset - i); |
393ff91f | 2826 | |
e1c42045 | 2827 | /* readahead node pages */ |
4d57b86d | 2828 | f2fs_ra_meta_pages(sbi, addr, nrpages, META_POR, true); |
e05df3b1 | 2829 | |
9ecf4b80 | 2830 | for (idx = addr; idx < addr + nrpages; idx++) { |
4d57b86d | 2831 | struct page *page = f2fs_get_tmp_page(sbi, idx); |
9af0ff1c | 2832 | |
7735730d CY |
2833 | if (IS_ERR(page)) |
2834 | return PTR_ERR(page); | |
2835 | ||
9ecf4b80 CY |
2836 | rn = F2FS_NODE(page); |
2837 | sum_entry->nid = rn->footer.nid; | |
2838 | sum_entry->version = 0; | |
2839 | sum_entry->ofs_in_node = 0; | |
2840 | sum_entry++; | |
2841 | f2fs_put_page(page, 1); | |
9af0ff1c | 2842 | } |
bac4eef6 | 2843 | |
9ecf4b80 | 2844 | invalidate_mapping_pages(META_MAPPING(sbi), addr, |
bac4eef6 | 2845 | addr + nrpages); |
e05df3b1 | 2846 | } |
7735730d | 2847 | return 0; |
e05df3b1 JK |
2848 | } |
2849 | ||
aec71382 | 2850 | static void remove_nats_in_journal(struct f2fs_sb_info *sbi) |
e05df3b1 JK |
2851 | { |
2852 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
2853 | struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); | |
b7ad7512 | 2854 | struct f2fs_journal *journal = curseg->journal; |
e05df3b1 JK |
2855 | int i; |
2856 | ||
b7ad7512 | 2857 | down_write(&curseg->journal_rwsem); |
dfc08a12 | 2858 | for (i = 0; i < nats_in_cursum(journal); i++) { |
e05df3b1 JK |
2859 | struct nat_entry *ne; |
2860 | struct f2fs_nat_entry raw_ne; | |
dfc08a12 | 2861 | nid_t nid = le32_to_cpu(nid_in_journal(journal, i)); |
e05df3b1 | 2862 | |
b862676e CY |
2863 | if (f2fs_check_nid_range(sbi, nid)) |
2864 | continue; | |
2865 | ||
dfc08a12 | 2866 | raw_ne = nat_in_journal(journal, i); |
9be32d72 | 2867 | |
e05df3b1 | 2868 | ne = __lookup_nat_cache(nm_i, nid); |
e05df3b1 | 2869 | if (!ne) { |
32410577 | 2870 | ne = __alloc_nat_entry(sbi, nid, true); |
12f9ef37 | 2871 | __init_nat_entry(nm_i, ne, &raw_ne, true); |
e05df3b1 | 2872 | } |
04d47e67 CY |
2873 | |
2874 | /* | |
2875 | * if a free nat in journal has not been used after last | |
2876 | * checkpoint, we should remove it from available nids, | |
2877 | * since later we will add it again. | |
2878 | */ | |
2879 | if (!get_nat_flag(ne, IS_DIRTY) && | |
2880 | le32_to_cpu(raw_ne.block_addr) == NULL_ADDR) { | |
2881 | spin_lock(&nm_i->nid_list_lock); | |
2882 | nm_i->available_nids--; | |
2883 | spin_unlock(&nm_i->nid_list_lock); | |
2884 | } | |
2885 | ||
e05df3b1 | 2886 | __set_nat_cache_dirty(nm_i, ne); |
e05df3b1 | 2887 | } |
dfc08a12 | 2888 | update_nats_in_cursum(journal, -i); |
b7ad7512 | 2889 | up_write(&curseg->journal_rwsem); |
e05df3b1 JK |
2890 | } |
2891 | ||
309cc2b6 JK |
2892 | static void __adjust_nat_entry_set(struct nat_entry_set *nes, |
2893 | struct list_head *head, int max) | |
e05df3b1 | 2894 | { |
309cc2b6 | 2895 | struct nat_entry_set *cur; |
e05df3b1 | 2896 | |
309cc2b6 JK |
2897 | if (nes->entry_cnt >= max) |
2898 | goto add_out; | |
e05df3b1 | 2899 | |
309cc2b6 JK |
2900 | list_for_each_entry(cur, head, set_list) { |
2901 | if (cur->entry_cnt >= nes->entry_cnt) { | |
2902 | list_add(&nes->set_list, cur->set_list.prev); | |
2903 | return; | |
2904 | } | |
aec71382 | 2905 | } |
309cc2b6 JK |
2906 | add_out: |
2907 | list_add_tail(&nes->set_list, head); | |
2908 | } | |
e05df3b1 | 2909 | |
94c821fb CY |
2910 | static void __update_nat_bits(struct f2fs_nm_info *nm_i, unsigned int nat_ofs, |
2911 | unsigned int valid) | |
2912 | { | |
2913 | if (valid == 0) { | |
2914 | __set_bit_le(nat_ofs, nm_i->empty_nat_bits); | |
2915 | __clear_bit_le(nat_ofs, nm_i->full_nat_bits); | |
2916 | return; | |
2917 | } | |
2918 | ||
2919 | __clear_bit_le(nat_ofs, nm_i->empty_nat_bits); | |
2920 | if (valid == NAT_ENTRY_PER_BLOCK) | |
2921 | __set_bit_le(nat_ofs, nm_i->full_nat_bits); | |
2922 | else | |
2923 | __clear_bit_le(nat_ofs, nm_i->full_nat_bits); | |
2924 | } | |
2925 | ||
2926 | static void update_nat_bits(struct f2fs_sb_info *sbi, nid_t start_nid, | |
22ad0b6a JK |
2927 | struct page *page) |
2928 | { | |
2929 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
2930 | unsigned int nat_index = start_nid / NAT_ENTRY_PER_BLOCK; | |
2931 | struct f2fs_nat_block *nat_blk = page_address(page); | |
2932 | int valid = 0; | |
37a0ab2a | 2933 | int i = 0; |
22ad0b6a | 2934 | |
94c821fb | 2935 | if (!is_set_ckpt_flags(sbi, CP_NAT_BITS_FLAG)) |
22ad0b6a JK |
2936 | return; |
2937 | ||
37a0ab2a FL |
2938 | if (nat_index == 0) { |
2939 | valid = 1; | |
2940 | i = 1; | |
2941 | } | |
2942 | for (; i < NAT_ENTRY_PER_BLOCK; i++) { | |
36af5f40 | 2943 | if (le32_to_cpu(nat_blk->entries[i].block_addr) != NULL_ADDR) |
22ad0b6a JK |
2944 | valid++; |
2945 | } | |
94c821fb CY |
2946 | |
2947 | __update_nat_bits(nm_i, nat_index, valid); | |
2948 | } | |
2949 | ||
2950 | void f2fs_enable_nat_bits(struct f2fs_sb_info *sbi) | |
2951 | { | |
2952 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
2953 | unsigned int nat_ofs; | |
2954 | ||
2955 | down_read(&nm_i->nat_tree_lock); | |
2956 | ||
2957 | for (nat_ofs = 0; nat_ofs < nm_i->nat_blocks; nat_ofs++) { | |
2958 | unsigned int valid = 0, nid_ofs = 0; | |
2959 | ||
2960 | /* handle nid zero due to it should never be used */ | |
2961 | if (unlikely(nat_ofs == 0)) { | |
2962 | valid = 1; | |
2963 | nid_ofs = 1; | |
2964 | } | |
2965 | ||
2966 | for (; nid_ofs < NAT_ENTRY_PER_BLOCK; nid_ofs++) { | |
2967 | if (!test_bit_le(nid_ofs, | |
2968 | nm_i->free_nid_bitmap[nat_ofs])) | |
2969 | valid++; | |
2970 | } | |
2971 | ||
2972 | __update_nat_bits(nm_i, nat_ofs, valid); | |
22ad0b6a JK |
2973 | } |
2974 | ||
94c821fb | 2975 | up_read(&nm_i->nat_tree_lock); |
22ad0b6a JK |
2976 | } |
2977 | ||
edc55aaf | 2978 | static int __flush_nat_entry_set(struct f2fs_sb_info *sbi, |
22ad0b6a | 2979 | struct nat_entry_set *set, struct cp_control *cpc) |
309cc2b6 JK |
2980 | { |
2981 | struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); | |
b7ad7512 | 2982 | struct f2fs_journal *journal = curseg->journal; |
309cc2b6 JK |
2983 | nid_t start_nid = set->set * NAT_ENTRY_PER_BLOCK; |
2984 | bool to_journal = true; | |
2985 | struct f2fs_nat_block *nat_blk; | |
2986 | struct nat_entry *ne, *cur; | |
2987 | struct page *page = NULL; | |
e05df3b1 | 2988 | |
aec71382 CY |
2989 | /* |
2990 | * there are two steps to flush nat entries: | |
2991 | * #1, flush nat entries to journal in current hot data summary block. | |
2992 | * #2, flush nat entries to nat page. | |
2993 | */ | |
94c821fb | 2994 | if ((cpc->reason & CP_UMOUNT) || |
22ad0b6a | 2995 | !__has_cursum_space(journal, set->entry_cnt, NAT_JOURNAL)) |
309cc2b6 JK |
2996 | to_journal = false; |
2997 | ||
2998 | if (to_journal) { | |
b7ad7512 | 2999 | down_write(&curseg->journal_rwsem); |
309cc2b6 JK |
3000 | } else { |
3001 | page = get_next_nat_page(sbi, start_nid); | |
edc55aaf JK |
3002 | if (IS_ERR(page)) |
3003 | return PTR_ERR(page); | |
3004 | ||
309cc2b6 JK |
3005 | nat_blk = page_address(page); |
3006 | f2fs_bug_on(sbi, !nat_blk); | |
3007 | } | |
aec71382 | 3008 | |
309cc2b6 JK |
3009 | /* flush dirty nats in nat entry set */ |
3010 | list_for_each_entry_safe(ne, cur, &set->entry_list, list) { | |
3011 | struct f2fs_nat_entry *raw_ne; | |
3012 | nid_t nid = nat_get_nid(ne); | |
3013 | int offset; | |
3014 | ||
febeca6d | 3015 | f2fs_bug_on(sbi, nat_get_blkaddr(ne) == NEW_ADDR); |
aec71382 CY |
3016 | |
3017 | if (to_journal) { | |
4d57b86d | 3018 | offset = f2fs_lookup_journal_in_cursum(journal, |
309cc2b6 JK |
3019 | NAT_JOURNAL, nid, 1); |
3020 | f2fs_bug_on(sbi, offset < 0); | |
dfc08a12 CY |
3021 | raw_ne = &nat_in_journal(journal, offset); |
3022 | nid_in_journal(journal, offset) = cpu_to_le32(nid); | |
aec71382 | 3023 | } else { |
309cc2b6 | 3024 | raw_ne = &nat_blk->entries[nid - start_nid]; |
e05df3b1 | 3025 | } |
309cc2b6 | 3026 | raw_nat_from_node_info(raw_ne, &ne->ni); |
309cc2b6 | 3027 | nat_reset_flag(ne); |
0b28b71e | 3028 | __clear_nat_cache_dirty(NM_I(sbi), set, ne); |
04d47e67 | 3029 | if (nat_get_blkaddr(ne) == NULL_ADDR) { |
5921aaa1 | 3030 | add_free_nid(sbi, nid, false, true); |
4ac91242 CY |
3031 | } else { |
3032 | spin_lock(&NM_I(sbi)->nid_list_lock); | |
346fe752 | 3033 | update_free_nid_bitmap(sbi, nid, false, false); |
04d47e67 CY |
3034 | spin_unlock(&NM_I(sbi)->nid_list_lock); |
3035 | } | |
309cc2b6 | 3036 | } |
e05df3b1 | 3037 | |
22ad0b6a | 3038 | if (to_journal) { |
b7ad7512 | 3039 | up_write(&curseg->journal_rwsem); |
22ad0b6a | 3040 | } else { |
94c821fb | 3041 | update_nat_bits(sbi, start_nid, page); |
309cc2b6 | 3042 | f2fs_put_page(page, 1); |
22ad0b6a | 3043 | } |
aec71382 | 3044 | |
59c9081b YH |
3045 | /* Allow dirty nats by node block allocation in write_begin */ |
3046 | if (!set->entry_cnt) { | |
3047 | radix_tree_delete(&NM_I(sbi)->nat_set_root, set->set); | |
3048 | kmem_cache_free(nat_entry_set_slab, set); | |
3049 | } | |
edc55aaf | 3050 | return 0; |
309cc2b6 | 3051 | } |
aec71382 | 3052 | |
309cc2b6 JK |
3053 | /* |
3054 | * This function is called during the checkpointing process. | |
3055 | */ | |
edc55aaf | 3056 | int f2fs_flush_nat_entries(struct f2fs_sb_info *sbi, struct cp_control *cpc) |
309cc2b6 JK |
3057 | { |
3058 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
3059 | struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); | |
b7ad7512 | 3060 | struct f2fs_journal *journal = curseg->journal; |
7aed0d45 | 3061 | struct nat_entry_set *setvec[SETVEC_SIZE]; |
309cc2b6 JK |
3062 | struct nat_entry_set *set, *tmp; |
3063 | unsigned int found; | |
3064 | nid_t set_idx = 0; | |
3065 | LIST_HEAD(sets); | |
edc55aaf | 3066 | int err = 0; |
309cc2b6 | 3067 | |
a95ba66a JK |
3068 | /* |
3069 | * during unmount, let's flush nat_bits before checking | |
3070 | * nat_cnt[DIRTY_NAT]. | |
3071 | */ | |
94c821fb | 3072 | if (cpc->reason & CP_UMOUNT) { |
7f2ecdd8 JK |
3073 | down_write(&nm_i->nat_tree_lock); |
3074 | remove_nats_in_journal(sbi); | |
3075 | up_write(&nm_i->nat_tree_lock); | |
3076 | } | |
3077 | ||
a95ba66a | 3078 | if (!nm_i->nat_cnt[DIRTY_NAT]) |
edc55aaf | 3079 | return 0; |
a5131193 | 3080 | |
b873b798 | 3081 | down_write(&nm_i->nat_tree_lock); |
a5131193 | 3082 | |
309cc2b6 JK |
3083 | /* |
3084 | * if there are no enough space in journal to store dirty nat | |
3085 | * entries, remove all entries from journal and merge them | |
3086 | * into nat entry set. | |
3087 | */ | |
94c821fb | 3088 | if (cpc->reason & CP_UMOUNT || |
a95ba66a JK |
3089 | !__has_cursum_space(journal, |
3090 | nm_i->nat_cnt[DIRTY_NAT], NAT_JOURNAL)) | |
309cc2b6 JK |
3091 | remove_nats_in_journal(sbi); |
3092 | ||
309cc2b6 | 3093 | while ((found = __gang_lookup_nat_set(nm_i, |
7aed0d45 | 3094 | set_idx, SETVEC_SIZE, setvec))) { |
309cc2b6 | 3095 | unsigned idx; |
5f029c04 | 3096 | |
309cc2b6 JK |
3097 | set_idx = setvec[found - 1]->set + 1; |
3098 | for (idx = 0; idx < found; idx++) | |
3099 | __adjust_nat_entry_set(setvec[idx], &sets, | |
dfc08a12 | 3100 | MAX_NAT_JENTRIES(journal)); |
e05df3b1 | 3101 | } |
aec71382 | 3102 | |
309cc2b6 | 3103 | /* flush dirty nats in nat entry set */ |
edc55aaf JK |
3104 | list_for_each_entry_safe(set, tmp, &sets, set_list) { |
3105 | err = __flush_nat_entry_set(sbi, set, cpc); | |
3106 | if (err) | |
3107 | break; | |
3108 | } | |
309cc2b6 | 3109 | |
b873b798 | 3110 | up_write(&nm_i->nat_tree_lock); |
59c9081b | 3111 | /* Allow dirty nats by node block allocation in write_begin */ |
edc55aaf JK |
3112 | |
3113 | return err; | |
e05df3b1 JK |
3114 | } |
3115 | ||
22ad0b6a JK |
3116 | static int __get_nat_bitmaps(struct f2fs_sb_info *sbi) |
3117 | { | |
3118 | struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi); | |
3119 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
3120 | unsigned int nat_bits_bytes = nm_i->nat_blocks / BITS_PER_BYTE; | |
3121 | unsigned int i; | |
3122 | __u64 cp_ver = cur_cp_version(ckpt); | |
22ad0b6a JK |
3123 | block_t nat_bits_addr; |
3124 | ||
df033caf | 3125 | nm_i->nat_bits_blocks = F2FS_BLK_ALIGN((nat_bits_bytes << 1) + 8); |
0b6d4ca0 | 3126 | nm_i->nat_bits = f2fs_kvzalloc(sbi, |
acbf054d | 3127 | nm_i->nat_bits_blocks << F2FS_BLKSIZE_BITS, GFP_KERNEL); |
22ad0b6a JK |
3128 | if (!nm_i->nat_bits) |
3129 | return -ENOMEM; | |
3130 | ||
94c821fb CY |
3131 | nm_i->full_nat_bits = nm_i->nat_bits + 8; |
3132 | nm_i->empty_nat_bits = nm_i->full_nat_bits + nat_bits_bytes; | |
3133 | ||
3134 | if (!is_set_ckpt_flags(sbi, CP_NAT_BITS_FLAG)) | |
3135 | return 0; | |
3136 | ||
22ad0b6a JK |
3137 | nat_bits_addr = __start_cp_addr(sbi) + sbi->blocks_per_seg - |
3138 | nm_i->nat_bits_blocks; | |
3139 | for (i = 0; i < nm_i->nat_bits_blocks; i++) { | |
7735730d CY |
3140 | struct page *page; |
3141 | ||
3142 | page = f2fs_get_meta_page(sbi, nat_bits_addr++); | |
3b30eb19 | 3143 | if (IS_ERR(page)) |
7735730d | 3144 | return PTR_ERR(page); |
22ad0b6a JK |
3145 | |
3146 | memcpy(nm_i->nat_bits + (i << F2FS_BLKSIZE_BITS), | |
3147 | page_address(page), F2FS_BLKSIZE); | |
3148 | f2fs_put_page(page, 1); | |
3149 | } | |
3150 | ||
ced2c7ea | 3151 | cp_ver |= (cur_cp_crc(ckpt) << 32); |
22ad0b6a | 3152 | if (cpu_to_le64(cp_ver) != *(__le64 *)nm_i->nat_bits) { |
94c821fb CY |
3153 | clear_ckpt_flags(sbi, CP_NAT_BITS_FLAG); |
3154 | f2fs_notice(sbi, "Disable nat_bits due to incorrect cp_ver (%llu, %llu)", | |
3155 | cp_ver, le64_to_cpu(*(__le64 *)nm_i->nat_bits)); | |
22ad0b6a JK |
3156 | return 0; |
3157 | } | |
3158 | ||
dcbb4c10 | 3159 | f2fs_notice(sbi, "Found nat_bits in checkpoint"); |
22ad0b6a JK |
3160 | return 0; |
3161 | } | |
3162 | ||
bd80a4b9 | 3163 | static inline void load_free_nid_bitmap(struct f2fs_sb_info *sbi) |
7041d5d2 CY |
3164 | { |
3165 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
3166 | unsigned int i = 0; | |
3167 | nid_t nid, last_nid; | |
3168 | ||
94c821fb | 3169 | if (!is_set_ckpt_flags(sbi, CP_NAT_BITS_FLAG)) |
7041d5d2 CY |
3170 | return; |
3171 | ||
3172 | for (i = 0; i < nm_i->nat_blocks; i++) { | |
3173 | i = find_next_bit_le(nm_i->empty_nat_bits, nm_i->nat_blocks, i); | |
3174 | if (i >= nm_i->nat_blocks) | |
3175 | break; | |
3176 | ||
3177 | __set_bit_le(i, nm_i->nat_block_bitmap); | |
3178 | ||
3179 | nid = i * NAT_ENTRY_PER_BLOCK; | |
f6986ede | 3180 | last_nid = nid + NAT_ENTRY_PER_BLOCK; |
7041d5d2 | 3181 | |
346fe752 | 3182 | spin_lock(&NM_I(sbi)->nid_list_lock); |
7041d5d2 | 3183 | for (; nid < last_nid; nid++) |
346fe752 CY |
3184 | update_free_nid_bitmap(sbi, nid, true, true); |
3185 | spin_unlock(&NM_I(sbi)->nid_list_lock); | |
7041d5d2 CY |
3186 | } |
3187 | ||
3188 | for (i = 0; i < nm_i->nat_blocks; i++) { | |
3189 | i = find_next_bit_le(nm_i->full_nat_bits, nm_i->nat_blocks, i); | |
3190 | if (i >= nm_i->nat_blocks) | |
3191 | break; | |
3192 | ||
3193 | __set_bit_le(i, nm_i->nat_block_bitmap); | |
3194 | } | |
3195 | } | |
3196 | ||
e05df3b1 JK |
3197 | static int init_node_manager(struct f2fs_sb_info *sbi) |
3198 | { | |
3199 | struct f2fs_super_block *sb_raw = F2FS_RAW_SUPER(sbi); | |
3200 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
3201 | unsigned char *version_bitmap; | |
22ad0b6a JK |
3202 | unsigned int nat_segs; |
3203 | int err; | |
e05df3b1 JK |
3204 | |
3205 | nm_i->nat_blkaddr = le32_to_cpu(sb_raw->nat_blkaddr); | |
3206 | ||
3207 | /* segment_count_nat includes pair segment so divide to 2. */ | |
3208 | nat_segs = le32_to_cpu(sb_raw->segment_count_nat) >> 1; | |
22ad0b6a JK |
3209 | nm_i->nat_blocks = nat_segs << le32_to_cpu(sb_raw->log_blocks_per_seg); |
3210 | nm_i->max_nid = NAT_ENTRY_PER_BLOCK * nm_i->nat_blocks; | |
7ee0eeab | 3211 | |
b63da15e | 3212 | /* not used nids: 0, node, meta, (and root counted as valid node) */ |
04d47e67 | 3213 | nm_i->available_nids = nm_i->max_nid - sbi->total_valid_node_count - |
27cae0bc | 3214 | F2FS_RESERVED_NODE_NUM; |
9a4ffdf5 CY |
3215 | nm_i->nid_cnt[FREE_NID] = 0; |
3216 | nm_i->nid_cnt[PREALLOC_NID] = 0; | |
cdfc41c1 | 3217 | nm_i->ram_thresh = DEF_RAM_THRESHOLD; |
ea1a29a0 | 3218 | nm_i->ra_nid_pages = DEF_RA_NID_PAGES; |
2304cb0c | 3219 | nm_i->dirty_nats_ratio = DEF_DIRTY_NAT_RATIO_THRESHOLD; |
e05df3b1 | 3220 | |
8a7ed66a | 3221 | INIT_RADIX_TREE(&nm_i->free_nid_root, GFP_ATOMIC); |
9a4ffdf5 | 3222 | INIT_LIST_HEAD(&nm_i->free_nid_list); |
769ec6e5 JK |
3223 | INIT_RADIX_TREE(&nm_i->nat_root, GFP_NOIO); |
3224 | INIT_RADIX_TREE(&nm_i->nat_set_root, GFP_NOIO); | |
e05df3b1 | 3225 | INIT_LIST_HEAD(&nm_i->nat_entries); |
22969158 | 3226 | spin_lock_init(&nm_i->nat_list_lock); |
e05df3b1 JK |
3227 | |
3228 | mutex_init(&nm_i->build_lock); | |
b8559dc2 | 3229 | spin_lock_init(&nm_i->nid_list_lock); |
b873b798 | 3230 | init_rwsem(&nm_i->nat_tree_lock); |
e05df3b1 | 3231 | |
e05df3b1 | 3232 | nm_i->next_scan_nid = le32_to_cpu(sbi->ckpt->next_free_nid); |
79b5793b | 3233 | nm_i->bitmap_size = __bitmap_size(sbi, NAT_BITMAP); |
e05df3b1 | 3234 | version_bitmap = __bitmap_ptr(sbi, NAT_BITMAP); |
79b5793b AG |
3235 | nm_i->nat_bitmap = kmemdup(version_bitmap, nm_i->bitmap_size, |
3236 | GFP_KERNEL); | |
3237 | if (!nm_i->nat_bitmap) | |
3238 | return -ENOMEM; | |
599a09b2 | 3239 | |
22ad0b6a JK |
3240 | err = __get_nat_bitmaps(sbi); |
3241 | if (err) | |
3242 | return err; | |
3243 | ||
599a09b2 CY |
3244 | #ifdef CONFIG_F2FS_CHECK_FS |
3245 | nm_i->nat_bitmap_mir = kmemdup(version_bitmap, nm_i->bitmap_size, | |
3246 | GFP_KERNEL); | |
3247 | if (!nm_i->nat_bitmap_mir) | |
3248 | return -ENOMEM; | |
3249 | #endif | |
3250 | ||
e05df3b1 JK |
3251 | return 0; |
3252 | } | |
3253 | ||
9f7e4a2c | 3254 | static int init_free_nid_cache(struct f2fs_sb_info *sbi) |
4ac91242 CY |
3255 | { |
3256 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
bb1105e4 | 3257 | int i; |
4ac91242 | 3258 | |
026f0507 | 3259 | nm_i->free_nid_bitmap = |
0b6d4ca0 EB |
3260 | f2fs_kvzalloc(sbi, array_size(sizeof(unsigned char *), |
3261 | nm_i->nat_blocks), | |
3262 | GFP_KERNEL); | |
4ac91242 CY |
3263 | if (!nm_i->free_nid_bitmap) |
3264 | return -ENOMEM; | |
3265 | ||
bb1105e4 JK |
3266 | for (i = 0; i < nm_i->nat_blocks; i++) { |
3267 | nm_i->free_nid_bitmap[i] = f2fs_kvzalloc(sbi, | |
e15d54d5 | 3268 | f2fs_bitmap_size(NAT_ENTRY_PER_BLOCK), GFP_KERNEL); |
68c43a23 | 3269 | if (!nm_i->free_nid_bitmap[i]) |
bb1105e4 JK |
3270 | return -ENOMEM; |
3271 | } | |
3272 | ||
628b3d14 | 3273 | nm_i->nat_block_bitmap = f2fs_kvzalloc(sbi, nm_i->nat_blocks / 8, |
4ac91242 CY |
3274 | GFP_KERNEL); |
3275 | if (!nm_i->nat_block_bitmap) | |
3276 | return -ENOMEM; | |
586d1492 | 3277 | |
9d2a789c KC |
3278 | nm_i->free_nid_count = |
3279 | f2fs_kvzalloc(sbi, array_size(sizeof(unsigned short), | |
3280 | nm_i->nat_blocks), | |
3281 | GFP_KERNEL); | |
586d1492 CY |
3282 | if (!nm_i->free_nid_count) |
3283 | return -ENOMEM; | |
4ac91242 CY |
3284 | return 0; |
3285 | } | |
3286 | ||
4d57b86d | 3287 | int f2fs_build_node_manager(struct f2fs_sb_info *sbi) |
e05df3b1 JK |
3288 | { |
3289 | int err; | |
3290 | ||
acbf054d CY |
3291 | sbi->nm_info = f2fs_kzalloc(sbi, sizeof(struct f2fs_nm_info), |
3292 | GFP_KERNEL); | |
e05df3b1 JK |
3293 | if (!sbi->nm_info) |
3294 | return -ENOMEM; | |
3295 | ||
3296 | err = init_node_manager(sbi); | |
3297 | if (err) | |
3298 | return err; | |
3299 | ||
4ac91242 CY |
3300 | err = init_free_nid_cache(sbi); |
3301 | if (err) | |
3302 | return err; | |
3303 | ||
7041d5d2 CY |
3304 | /* load free nid status from nat_bits table */ |
3305 | load_free_nid_bitmap(sbi); | |
3306 | ||
e2374015 | 3307 | return f2fs_build_free_nids(sbi, true, true); |
e05df3b1 JK |
3308 | } |
3309 | ||
4d57b86d | 3310 | void f2fs_destroy_node_manager(struct f2fs_sb_info *sbi) |
e05df3b1 JK |
3311 | { |
3312 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
3313 | struct free_nid *i, *next_i; | |
3314 | struct nat_entry *natvec[NATVEC_SIZE]; | |
7aed0d45 | 3315 | struct nat_entry_set *setvec[SETVEC_SIZE]; |
e05df3b1 JK |
3316 | nid_t nid = 0; |
3317 | unsigned int found; | |
3318 | ||
3319 | if (!nm_i) | |
3320 | return; | |
3321 | ||
3322 | /* destroy free nid list */ | |
b8559dc2 | 3323 | spin_lock(&nm_i->nid_list_lock); |
9a4ffdf5 | 3324 | list_for_each_entry_safe(i, next_i, &nm_i->free_nid_list, list) { |
a0761f63 | 3325 | __remove_free_nid(sbi, i, FREE_NID); |
b8559dc2 | 3326 | spin_unlock(&nm_i->nid_list_lock); |
cf0ee0f0 | 3327 | kmem_cache_free(free_nid_slab, i); |
b8559dc2 | 3328 | spin_lock(&nm_i->nid_list_lock); |
e05df3b1 | 3329 | } |
9a4ffdf5 CY |
3330 | f2fs_bug_on(sbi, nm_i->nid_cnt[FREE_NID]); |
3331 | f2fs_bug_on(sbi, nm_i->nid_cnt[PREALLOC_NID]); | |
3332 | f2fs_bug_on(sbi, !list_empty(&nm_i->free_nid_list)); | |
b8559dc2 | 3333 | spin_unlock(&nm_i->nid_list_lock); |
e05df3b1 JK |
3334 | |
3335 | /* destroy nat cache */ | |
b873b798 | 3336 | down_write(&nm_i->nat_tree_lock); |
e05df3b1 JK |
3337 | while ((found = __gang_lookup_nat_cache(nm_i, |
3338 | nid, NATVEC_SIZE, natvec))) { | |
3339 | unsigned idx; | |
7aed0d45 | 3340 | |
b6ce391e | 3341 | nid = nat_get_nid(natvec[found - 1]) + 1; |
22969158 CY |
3342 | for (idx = 0; idx < found; idx++) { |
3343 | spin_lock(&nm_i->nat_list_lock); | |
3344 | list_del(&natvec[idx]->list); | |
3345 | spin_unlock(&nm_i->nat_list_lock); | |
3346 | ||
b6ce391e | 3347 | __del_from_nat_cache(nm_i, natvec[idx]); |
22969158 | 3348 | } |
e05df3b1 | 3349 | } |
a95ba66a | 3350 | f2fs_bug_on(sbi, nm_i->nat_cnt[TOTAL_NAT]); |
7aed0d45 JK |
3351 | |
3352 | /* destroy nat set cache */ | |
3353 | nid = 0; | |
3354 | while ((found = __gang_lookup_nat_set(nm_i, | |
3355 | nid, SETVEC_SIZE, setvec))) { | |
3356 | unsigned idx; | |
3357 | ||
3358 | nid = setvec[found - 1]->set + 1; | |
3359 | for (idx = 0; idx < found; idx++) { | |
3360 | /* entry_cnt is not zero, when cp_error was occurred */ | |
3361 | f2fs_bug_on(sbi, !list_empty(&setvec[idx]->entry_list)); | |
3362 | radix_tree_delete(&nm_i->nat_set_root, setvec[idx]->set); | |
3363 | kmem_cache_free(nat_entry_set_slab, setvec[idx]); | |
3364 | } | |
3365 | } | |
b873b798 | 3366 | up_write(&nm_i->nat_tree_lock); |
e05df3b1 | 3367 | |
4ac91242 | 3368 | kvfree(nm_i->nat_block_bitmap); |
bb1105e4 JK |
3369 | if (nm_i->free_nid_bitmap) { |
3370 | int i; | |
3371 | ||
3372 | for (i = 0; i < nm_i->nat_blocks; i++) | |
3373 | kvfree(nm_i->free_nid_bitmap[i]); | |
5222595d | 3374 | kvfree(nm_i->free_nid_bitmap); |
bb1105e4 | 3375 | } |
586d1492 | 3376 | kvfree(nm_i->free_nid_count); |
4ac91242 | 3377 | |
5222595d JK |
3378 | kvfree(nm_i->nat_bitmap); |
3379 | kvfree(nm_i->nat_bits); | |
599a09b2 | 3380 | #ifdef CONFIG_F2FS_CHECK_FS |
5222595d | 3381 | kvfree(nm_i->nat_bitmap_mir); |
599a09b2 | 3382 | #endif |
e05df3b1 | 3383 | sbi->nm_info = NULL; |
c8eb7024 | 3384 | kfree(nm_i); |
e05df3b1 JK |
3385 | } |
3386 | ||
4d57b86d | 3387 | int __init f2fs_create_node_manager_caches(void) |
e05df3b1 | 3388 | { |
98510003 | 3389 | nat_entry_slab = f2fs_kmem_cache_create("f2fs_nat_entry", |
e8512d2e | 3390 | sizeof(struct nat_entry)); |
e05df3b1 | 3391 | if (!nat_entry_slab) |
aec71382 | 3392 | goto fail; |
e05df3b1 | 3393 | |
98510003 | 3394 | free_nid_slab = f2fs_kmem_cache_create("f2fs_free_nid", |
e8512d2e | 3395 | sizeof(struct free_nid)); |
aec71382 | 3396 | if (!free_nid_slab) |
ce3e6d25 | 3397 | goto destroy_nat_entry; |
aec71382 | 3398 | |
98510003 | 3399 | nat_entry_set_slab = f2fs_kmem_cache_create("f2fs_nat_entry_set", |
aec71382 CY |
3400 | sizeof(struct nat_entry_set)); |
3401 | if (!nat_entry_set_slab) | |
ce3e6d25 | 3402 | goto destroy_free_nid; |
50fa53ec | 3403 | |
98510003 | 3404 | fsync_node_entry_slab = f2fs_kmem_cache_create("f2fs_fsync_node_entry", |
50fa53ec CY |
3405 | sizeof(struct fsync_node_entry)); |
3406 | if (!fsync_node_entry_slab) | |
3407 | goto destroy_nat_entry_set; | |
e05df3b1 | 3408 | return 0; |
aec71382 | 3409 | |
50fa53ec CY |
3410 | destroy_nat_entry_set: |
3411 | kmem_cache_destroy(nat_entry_set_slab); | |
ce3e6d25 | 3412 | destroy_free_nid: |
aec71382 | 3413 | kmem_cache_destroy(free_nid_slab); |
ce3e6d25 | 3414 | destroy_nat_entry: |
aec71382 CY |
3415 | kmem_cache_destroy(nat_entry_slab); |
3416 | fail: | |
3417 | return -ENOMEM; | |
e05df3b1 JK |
3418 | } |
3419 | ||
4d57b86d | 3420 | void f2fs_destroy_node_manager_caches(void) |
e05df3b1 | 3421 | { |
50fa53ec | 3422 | kmem_cache_destroy(fsync_node_entry_slab); |
aec71382 | 3423 | kmem_cache_destroy(nat_entry_set_slab); |
e05df3b1 JK |
3424 | kmem_cache_destroy(free_nid_slab); |
3425 | kmem_cache_destroy(nat_entry_slab); | |
3426 | } |