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