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