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