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" | |
51dd6249 | 22 | #include <trace/events/f2fs.h> |
e05df3b1 | 23 | |
f978f5a0 GZ |
24 | #define on_build_free_nids(nmi) mutex_is_locked(&nm_i->build_lock) |
25 | ||
e05df3b1 JK |
26 | static struct kmem_cache *nat_entry_slab; |
27 | static struct kmem_cache *free_nid_slab; | |
28 | ||
cdfc41c1 JK |
29 | static inline bool available_free_memory(struct f2fs_nm_info *nm_i, int type) |
30 | { | |
31 | struct sysinfo val; | |
32 | unsigned long mem_size = 0; | |
33 | ||
34 | si_meminfo(&val); | |
35 | if (type == FREE_NIDS) | |
36 | mem_size = nm_i->fcnt * sizeof(struct free_nid); | |
37 | else if (type == NAT_ENTRIES) | |
38 | mem_size += nm_i->nat_cnt * sizeof(struct nat_entry); | |
39 | mem_size >>= 12; | |
40 | ||
41 | /* give 50:50 memory for free nids and nat caches respectively */ | |
42 | return (mem_size < ((val.totalram * nm_i->ram_thresh) >> 11)); | |
43 | } | |
44 | ||
e05df3b1 JK |
45 | static void clear_node_page_dirty(struct page *page) |
46 | { | |
47 | struct address_space *mapping = page->mapping; | |
48 | struct f2fs_sb_info *sbi = F2FS_SB(mapping->host->i_sb); | |
49 | unsigned int long flags; | |
50 | ||
51 | if (PageDirty(page)) { | |
52 | spin_lock_irqsave(&mapping->tree_lock, flags); | |
53 | radix_tree_tag_clear(&mapping->page_tree, | |
54 | page_index(page), | |
55 | PAGECACHE_TAG_DIRTY); | |
56 | spin_unlock_irqrestore(&mapping->tree_lock, flags); | |
57 | ||
58 | clear_page_dirty_for_io(page); | |
59 | dec_page_count(sbi, F2FS_DIRTY_NODES); | |
60 | } | |
61 | ClearPageUptodate(page); | |
62 | } | |
63 | ||
64 | static struct page *get_current_nat_page(struct f2fs_sb_info *sbi, nid_t nid) | |
65 | { | |
66 | pgoff_t index = current_nat_addr(sbi, nid); | |
67 | return get_meta_page(sbi, index); | |
68 | } | |
69 | ||
70 | static struct page *get_next_nat_page(struct f2fs_sb_info *sbi, nid_t nid) | |
71 | { | |
72 | struct page *src_page; | |
73 | struct page *dst_page; | |
74 | pgoff_t src_off; | |
75 | pgoff_t dst_off; | |
76 | void *src_addr; | |
77 | void *dst_addr; | |
78 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
79 | ||
80 | src_off = current_nat_addr(sbi, nid); | |
81 | dst_off = next_nat_addr(sbi, src_off); | |
82 | ||
83 | /* get current nat block page with lock */ | |
84 | src_page = get_meta_page(sbi, src_off); | |
85 | ||
86 | /* Dirty src_page means that it is already the new target NAT page. */ | |
87 | if (PageDirty(src_page)) | |
88 | return src_page; | |
89 | ||
90 | dst_page = grab_meta_page(sbi, dst_off); | |
91 | ||
92 | src_addr = page_address(src_page); | |
93 | dst_addr = page_address(dst_page); | |
94 | memcpy(dst_addr, src_addr, PAGE_CACHE_SIZE); | |
95 | set_page_dirty(dst_page); | |
96 | f2fs_put_page(src_page, 1); | |
97 | ||
98 | set_to_next_nat(nm_i, nid); | |
99 | ||
100 | return dst_page; | |
101 | } | |
102 | ||
e05df3b1 JK |
103 | static struct nat_entry *__lookup_nat_cache(struct f2fs_nm_info *nm_i, nid_t n) |
104 | { | |
105 | return radix_tree_lookup(&nm_i->nat_root, n); | |
106 | } | |
107 | ||
108 | static unsigned int __gang_lookup_nat_cache(struct f2fs_nm_info *nm_i, | |
109 | nid_t start, unsigned int nr, struct nat_entry **ep) | |
110 | { | |
111 | return radix_tree_gang_lookup(&nm_i->nat_root, (void **)ep, start, nr); | |
112 | } | |
113 | ||
114 | static void __del_from_nat_cache(struct f2fs_nm_info *nm_i, struct nat_entry *e) | |
115 | { | |
116 | list_del(&e->list); | |
117 | radix_tree_delete(&nm_i->nat_root, nat_get_nid(e)); | |
118 | nm_i->nat_cnt--; | |
119 | kmem_cache_free(nat_entry_slab, e); | |
120 | } | |
121 | ||
122 | int is_checkpointed_node(struct f2fs_sb_info *sbi, nid_t nid) | |
123 | { | |
124 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
125 | struct nat_entry *e; | |
126 | int is_cp = 1; | |
127 | ||
128 | read_lock(&nm_i->nat_tree_lock); | |
129 | e = __lookup_nat_cache(nm_i, nid); | |
130 | if (e && !e->checkpointed) | |
131 | is_cp = 0; | |
132 | read_unlock(&nm_i->nat_tree_lock); | |
133 | return is_cp; | |
134 | } | |
135 | ||
479f40c4 JK |
136 | bool fsync_mark_done(struct f2fs_sb_info *sbi, nid_t nid) |
137 | { | |
138 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
139 | struct nat_entry *e; | |
140 | bool fsync_done = false; | |
141 | ||
142 | read_lock(&nm_i->nat_tree_lock); | |
143 | e = __lookup_nat_cache(nm_i, nid); | |
144 | if (e) | |
145 | fsync_done = e->fsync_done; | |
146 | read_unlock(&nm_i->nat_tree_lock); | |
147 | return fsync_done; | |
148 | } | |
149 | ||
e05df3b1 JK |
150 | static struct nat_entry *grab_nat_entry(struct f2fs_nm_info *nm_i, nid_t nid) |
151 | { | |
152 | struct nat_entry *new; | |
153 | ||
154 | new = kmem_cache_alloc(nat_entry_slab, GFP_ATOMIC); | |
155 | if (!new) | |
156 | return NULL; | |
157 | if (radix_tree_insert(&nm_i->nat_root, nid, new)) { | |
158 | kmem_cache_free(nat_entry_slab, new); | |
159 | return NULL; | |
160 | } | |
161 | memset(new, 0, sizeof(struct nat_entry)); | |
162 | nat_set_nid(new, nid); | |
fffc2a00 | 163 | new->checkpointed = true; |
e05df3b1 JK |
164 | list_add_tail(&new->list, &nm_i->nat_entries); |
165 | nm_i->nat_cnt++; | |
166 | return new; | |
167 | } | |
168 | ||
169 | static void cache_nat_entry(struct f2fs_nm_info *nm_i, nid_t nid, | |
170 | struct f2fs_nat_entry *ne) | |
171 | { | |
172 | struct nat_entry *e; | |
173 | retry: | |
174 | write_lock(&nm_i->nat_tree_lock); | |
175 | e = __lookup_nat_cache(nm_i, nid); | |
176 | if (!e) { | |
177 | e = grab_nat_entry(nm_i, nid); | |
178 | if (!e) { | |
179 | write_unlock(&nm_i->nat_tree_lock); | |
180 | goto retry; | |
181 | } | |
182 | nat_set_blkaddr(e, le32_to_cpu(ne->block_addr)); | |
183 | nat_set_ino(e, le32_to_cpu(ne->ino)); | |
184 | nat_set_version(e, ne->version); | |
e05df3b1 JK |
185 | } |
186 | write_unlock(&nm_i->nat_tree_lock); | |
187 | } | |
188 | ||
189 | static void set_node_addr(struct f2fs_sb_info *sbi, struct node_info *ni, | |
479f40c4 | 190 | block_t new_blkaddr, bool fsync_done) |
e05df3b1 JK |
191 | { |
192 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
193 | struct nat_entry *e; | |
194 | retry: | |
195 | write_lock(&nm_i->nat_tree_lock); | |
196 | e = __lookup_nat_cache(nm_i, ni->nid); | |
197 | if (!e) { | |
198 | e = grab_nat_entry(nm_i, ni->nid); | |
199 | if (!e) { | |
200 | write_unlock(&nm_i->nat_tree_lock); | |
201 | goto retry; | |
202 | } | |
203 | e->ni = *ni; | |
5d56b671 | 204 | f2fs_bug_on(ni->blk_addr == NEW_ADDR); |
e05df3b1 JK |
205 | } else if (new_blkaddr == NEW_ADDR) { |
206 | /* | |
207 | * when nid is reallocated, | |
208 | * previous nat entry can be remained in nat cache. | |
209 | * So, reinitialize it with new information. | |
210 | */ | |
211 | e->ni = *ni; | |
5d56b671 | 212 | f2fs_bug_on(ni->blk_addr != NULL_ADDR); |
e05df3b1 JK |
213 | } |
214 | ||
e05df3b1 | 215 | /* sanity check */ |
5d56b671 JK |
216 | f2fs_bug_on(nat_get_blkaddr(e) != ni->blk_addr); |
217 | f2fs_bug_on(nat_get_blkaddr(e) == NULL_ADDR && | |
e05df3b1 | 218 | new_blkaddr == NULL_ADDR); |
5d56b671 | 219 | f2fs_bug_on(nat_get_blkaddr(e) == NEW_ADDR && |
e05df3b1 | 220 | new_blkaddr == NEW_ADDR); |
5d56b671 | 221 | f2fs_bug_on(nat_get_blkaddr(e) != NEW_ADDR && |
e05df3b1 JK |
222 | nat_get_blkaddr(e) != NULL_ADDR && |
223 | new_blkaddr == NEW_ADDR); | |
224 | ||
225 | /* increament version no as node is removed */ | |
226 | if (nat_get_blkaddr(e) != NEW_ADDR && new_blkaddr == NULL_ADDR) { | |
227 | unsigned char version = nat_get_version(e); | |
228 | nat_set_version(e, inc_node_version(version)); | |
229 | } | |
230 | ||
231 | /* change address */ | |
232 | nat_set_blkaddr(e, new_blkaddr); | |
233 | __set_nat_cache_dirty(nm_i, e); | |
479f40c4 JK |
234 | |
235 | /* update fsync_mark if its inode nat entry is still alive */ | |
236 | e = __lookup_nat_cache(nm_i, ni->ino); | |
237 | if (e) | |
238 | e->fsync_done = fsync_done; | |
e05df3b1 JK |
239 | write_unlock(&nm_i->nat_tree_lock); |
240 | } | |
241 | ||
4660f9c0 | 242 | int try_to_free_nats(struct f2fs_sb_info *sbi, int nr_shrink) |
e05df3b1 JK |
243 | { |
244 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
245 | ||
a5f42010 | 246 | if (available_free_memory(nm_i, NAT_ENTRIES)) |
e05df3b1 JK |
247 | return 0; |
248 | ||
249 | write_lock(&nm_i->nat_tree_lock); | |
250 | while (nr_shrink && !list_empty(&nm_i->nat_entries)) { | |
251 | struct nat_entry *ne; | |
252 | ne = list_first_entry(&nm_i->nat_entries, | |
253 | struct nat_entry, list); | |
254 | __del_from_nat_cache(nm_i, ne); | |
255 | nr_shrink--; | |
256 | } | |
257 | write_unlock(&nm_i->nat_tree_lock); | |
258 | return nr_shrink; | |
259 | } | |
260 | ||
0a8165d7 | 261 | /* |
e05df3b1 JK |
262 | * This function returns always success |
263 | */ | |
264 | void get_node_info(struct f2fs_sb_info *sbi, nid_t nid, struct node_info *ni) | |
265 | { | |
266 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
267 | struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); | |
268 | struct f2fs_summary_block *sum = curseg->sum_blk; | |
269 | nid_t start_nid = START_NID(nid); | |
270 | struct f2fs_nat_block *nat_blk; | |
271 | struct page *page = NULL; | |
272 | struct f2fs_nat_entry ne; | |
273 | struct nat_entry *e; | |
274 | int i; | |
275 | ||
be4124f8 | 276 | memset(&ne, 0, sizeof(struct f2fs_nat_entry)); |
e05df3b1 JK |
277 | ni->nid = nid; |
278 | ||
279 | /* Check nat cache */ | |
280 | read_lock(&nm_i->nat_tree_lock); | |
281 | e = __lookup_nat_cache(nm_i, nid); | |
282 | if (e) { | |
283 | ni->ino = nat_get_ino(e); | |
284 | ni->blk_addr = nat_get_blkaddr(e); | |
285 | ni->version = nat_get_version(e); | |
286 | } | |
287 | read_unlock(&nm_i->nat_tree_lock); | |
288 | if (e) | |
289 | return; | |
290 | ||
291 | /* Check current segment summary */ | |
292 | mutex_lock(&curseg->curseg_mutex); | |
293 | i = lookup_journal_in_cursum(sum, NAT_JOURNAL, nid, 0); | |
294 | if (i >= 0) { | |
295 | ne = nat_in_journal(sum, i); | |
296 | node_info_from_raw_nat(ni, &ne); | |
297 | } | |
298 | mutex_unlock(&curseg->curseg_mutex); | |
299 | if (i >= 0) | |
300 | goto cache; | |
301 | ||
302 | /* Fill node_info from nat page */ | |
303 | page = get_current_nat_page(sbi, start_nid); | |
304 | nat_blk = (struct f2fs_nat_block *)page_address(page); | |
305 | ne = nat_blk->entries[nid - start_nid]; | |
306 | node_info_from_raw_nat(ni, &ne); | |
307 | f2fs_put_page(page, 1); | |
308 | cache: | |
309 | /* cache nat entry */ | |
310 | cache_nat_entry(NM_I(sbi), nid, &ne); | |
311 | } | |
312 | ||
0a8165d7 | 313 | /* |
e05df3b1 JK |
314 | * The maximum depth is four. |
315 | * Offset[0] will have raw inode offset. | |
316 | */ | |
de93653f JK |
317 | static int get_node_path(struct f2fs_inode_info *fi, long block, |
318 | int offset[4], unsigned int noffset[4]) | |
e05df3b1 | 319 | { |
de93653f | 320 | const long direct_index = ADDRS_PER_INODE(fi); |
e05df3b1 JK |
321 | const long direct_blks = ADDRS_PER_BLOCK; |
322 | const long dptrs_per_blk = NIDS_PER_BLOCK; | |
323 | const long indirect_blks = ADDRS_PER_BLOCK * NIDS_PER_BLOCK; | |
324 | const long dindirect_blks = indirect_blks * NIDS_PER_BLOCK; | |
325 | int n = 0; | |
326 | int level = 0; | |
327 | ||
328 | noffset[0] = 0; | |
329 | ||
330 | if (block < direct_index) { | |
25c0a6e5 | 331 | offset[n] = block; |
e05df3b1 JK |
332 | goto got; |
333 | } | |
334 | block -= direct_index; | |
335 | if (block < direct_blks) { | |
336 | offset[n++] = NODE_DIR1_BLOCK; | |
337 | noffset[n] = 1; | |
25c0a6e5 | 338 | offset[n] = block; |
e05df3b1 JK |
339 | level = 1; |
340 | goto got; | |
341 | } | |
342 | block -= direct_blks; | |
343 | if (block < direct_blks) { | |
344 | offset[n++] = NODE_DIR2_BLOCK; | |
345 | noffset[n] = 2; | |
25c0a6e5 | 346 | offset[n] = block; |
e05df3b1 JK |
347 | level = 1; |
348 | goto got; | |
349 | } | |
350 | block -= direct_blks; | |
351 | if (block < indirect_blks) { | |
352 | offset[n++] = NODE_IND1_BLOCK; | |
353 | noffset[n] = 3; | |
354 | offset[n++] = block / direct_blks; | |
355 | noffset[n] = 4 + offset[n - 1]; | |
25c0a6e5 | 356 | offset[n] = block % direct_blks; |
e05df3b1 JK |
357 | level = 2; |
358 | goto got; | |
359 | } | |
360 | block -= indirect_blks; | |
361 | if (block < indirect_blks) { | |
362 | offset[n++] = NODE_IND2_BLOCK; | |
363 | noffset[n] = 4 + dptrs_per_blk; | |
364 | offset[n++] = block / direct_blks; | |
365 | noffset[n] = 5 + dptrs_per_blk + offset[n - 1]; | |
25c0a6e5 | 366 | offset[n] = block % direct_blks; |
e05df3b1 JK |
367 | level = 2; |
368 | goto got; | |
369 | } | |
370 | block -= indirect_blks; | |
371 | if (block < dindirect_blks) { | |
372 | offset[n++] = NODE_DIND_BLOCK; | |
373 | noffset[n] = 5 + (dptrs_per_blk * 2); | |
374 | offset[n++] = block / indirect_blks; | |
375 | noffset[n] = 6 + (dptrs_per_blk * 2) + | |
376 | offset[n - 1] * (dptrs_per_blk + 1); | |
377 | offset[n++] = (block / direct_blks) % dptrs_per_blk; | |
378 | noffset[n] = 7 + (dptrs_per_blk * 2) + | |
379 | offset[n - 2] * (dptrs_per_blk + 1) + | |
380 | offset[n - 1]; | |
25c0a6e5 | 381 | offset[n] = block % direct_blks; |
e05df3b1 JK |
382 | level = 3; |
383 | goto got; | |
384 | } else { | |
385 | BUG(); | |
386 | } | |
387 | got: | |
388 | return level; | |
389 | } | |
390 | ||
391 | /* | |
392 | * Caller should call f2fs_put_dnode(dn). | |
4f4124d0 CY |
393 | * Also, it should grab and release a rwsem by calling f2fs_lock_op() and |
394 | * f2fs_unlock_op() only if ro is not set RDONLY_NODE. | |
39936837 | 395 | * In the case of RDONLY_NODE, we don't need to care about mutex. |
e05df3b1 | 396 | */ |
266e97a8 | 397 | int get_dnode_of_data(struct dnode_of_data *dn, pgoff_t index, int mode) |
e05df3b1 JK |
398 | { |
399 | struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); | |
400 | struct page *npage[4]; | |
401 | struct page *parent; | |
402 | int offset[4]; | |
403 | unsigned int noffset[4]; | |
404 | nid_t nids[4]; | |
405 | int level, i; | |
406 | int err = 0; | |
407 | ||
de93653f | 408 | level = get_node_path(F2FS_I(dn->inode), index, offset, noffset); |
e05df3b1 JK |
409 | |
410 | nids[0] = dn->inode->i_ino; | |
1646cfac | 411 | npage[0] = dn->inode_page; |
e05df3b1 | 412 | |
1646cfac JK |
413 | if (!npage[0]) { |
414 | npage[0] = get_node_page(sbi, nids[0]); | |
415 | if (IS_ERR(npage[0])) | |
416 | return PTR_ERR(npage[0]); | |
417 | } | |
e05df3b1 | 418 | parent = npage[0]; |
52c2db3f CL |
419 | if (level != 0) |
420 | nids[1] = get_nid(parent, offset[0], true); | |
e05df3b1 JK |
421 | dn->inode_page = npage[0]; |
422 | dn->inode_page_locked = true; | |
423 | ||
424 | /* get indirect or direct nodes */ | |
425 | for (i = 1; i <= level; i++) { | |
426 | bool done = false; | |
427 | ||
266e97a8 | 428 | if (!nids[i] && mode == ALLOC_NODE) { |
e05df3b1 JK |
429 | /* alloc new node */ |
430 | if (!alloc_nid(sbi, &(nids[i]))) { | |
e05df3b1 JK |
431 | err = -ENOSPC; |
432 | goto release_pages; | |
433 | } | |
434 | ||
435 | dn->nid = nids[i]; | |
8ae8f162 | 436 | npage[i] = new_node_page(dn, noffset[i], NULL); |
e05df3b1 JK |
437 | if (IS_ERR(npage[i])) { |
438 | alloc_nid_failed(sbi, nids[i]); | |
e05df3b1 JK |
439 | err = PTR_ERR(npage[i]); |
440 | goto release_pages; | |
441 | } | |
442 | ||
443 | set_nid(parent, offset[i - 1], nids[i], i == 1); | |
444 | alloc_nid_done(sbi, nids[i]); | |
e05df3b1 | 445 | done = true; |
266e97a8 | 446 | } else if (mode == LOOKUP_NODE_RA && i == level && level > 1) { |
e05df3b1 JK |
447 | npage[i] = get_node_page_ra(parent, offset[i - 1]); |
448 | if (IS_ERR(npage[i])) { | |
449 | err = PTR_ERR(npage[i]); | |
450 | goto release_pages; | |
451 | } | |
452 | done = true; | |
453 | } | |
454 | if (i == 1) { | |
455 | dn->inode_page_locked = false; | |
456 | unlock_page(parent); | |
457 | } else { | |
458 | f2fs_put_page(parent, 1); | |
459 | } | |
460 | ||
461 | if (!done) { | |
462 | npage[i] = get_node_page(sbi, nids[i]); | |
463 | if (IS_ERR(npage[i])) { | |
464 | err = PTR_ERR(npage[i]); | |
465 | f2fs_put_page(npage[0], 0); | |
466 | goto release_out; | |
467 | } | |
468 | } | |
469 | if (i < level) { | |
470 | parent = npage[i]; | |
471 | nids[i + 1] = get_nid(parent, offset[i], false); | |
472 | } | |
473 | } | |
474 | dn->nid = nids[level]; | |
475 | dn->ofs_in_node = offset[level]; | |
476 | dn->node_page = npage[level]; | |
477 | dn->data_blkaddr = datablock_addr(dn->node_page, dn->ofs_in_node); | |
478 | return 0; | |
479 | ||
480 | release_pages: | |
481 | f2fs_put_page(parent, 1); | |
482 | if (i > 1) | |
483 | f2fs_put_page(npage[0], 0); | |
484 | release_out: | |
485 | dn->inode_page = NULL; | |
486 | dn->node_page = NULL; | |
487 | return err; | |
488 | } | |
489 | ||
490 | static void truncate_node(struct dnode_of_data *dn) | |
491 | { | |
492 | struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); | |
493 | struct node_info ni; | |
494 | ||
495 | get_node_info(sbi, dn->nid, &ni); | |
71e9fec5 | 496 | if (dn->inode->i_blocks == 0) { |
5d56b671 | 497 | f2fs_bug_on(ni.blk_addr != NULL_ADDR); |
71e9fec5 JK |
498 | goto invalidate; |
499 | } | |
5d56b671 | 500 | f2fs_bug_on(ni.blk_addr == NULL_ADDR); |
e05df3b1 | 501 | |
e05df3b1 | 502 | /* Deallocate node address */ |
71e9fec5 | 503 | invalidate_blocks(sbi, ni.blk_addr); |
ef86d709 | 504 | dec_valid_node_count(sbi, dn->inode); |
479f40c4 | 505 | set_node_addr(sbi, &ni, NULL_ADDR, false); |
e05df3b1 JK |
506 | |
507 | if (dn->nid == dn->inode->i_ino) { | |
508 | remove_orphan_inode(sbi, dn->nid); | |
509 | dec_valid_inode_count(sbi); | |
510 | } else { | |
511 | sync_inode_page(dn); | |
512 | } | |
71e9fec5 | 513 | invalidate: |
e05df3b1 JK |
514 | clear_node_page_dirty(dn->node_page); |
515 | F2FS_SET_SB_DIRT(sbi); | |
516 | ||
517 | f2fs_put_page(dn->node_page, 1); | |
bf39c00a JK |
518 | |
519 | invalidate_mapping_pages(NODE_MAPPING(sbi), | |
520 | dn->node_page->index, dn->node_page->index); | |
521 | ||
e05df3b1 | 522 | dn->node_page = NULL; |
51dd6249 | 523 | trace_f2fs_truncate_node(dn->inode, dn->nid, ni.blk_addr); |
e05df3b1 JK |
524 | } |
525 | ||
526 | static int truncate_dnode(struct dnode_of_data *dn) | |
527 | { | |
528 | struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); | |
529 | struct page *page; | |
530 | ||
531 | if (dn->nid == 0) | |
532 | return 1; | |
533 | ||
534 | /* get direct node */ | |
535 | page = get_node_page(sbi, dn->nid); | |
536 | if (IS_ERR(page) && PTR_ERR(page) == -ENOENT) | |
537 | return 1; | |
538 | else if (IS_ERR(page)) | |
539 | return PTR_ERR(page); | |
540 | ||
541 | /* Make dnode_of_data for parameter */ | |
542 | dn->node_page = page; | |
543 | dn->ofs_in_node = 0; | |
544 | truncate_data_blocks(dn); | |
545 | truncate_node(dn); | |
546 | return 1; | |
547 | } | |
548 | ||
549 | static int truncate_nodes(struct dnode_of_data *dn, unsigned int nofs, | |
550 | int ofs, int depth) | |
551 | { | |
552 | struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); | |
553 | struct dnode_of_data rdn = *dn; | |
554 | struct page *page; | |
555 | struct f2fs_node *rn; | |
556 | nid_t child_nid; | |
557 | unsigned int child_nofs; | |
558 | int freed = 0; | |
559 | int i, ret; | |
560 | ||
561 | if (dn->nid == 0) | |
562 | return NIDS_PER_BLOCK + 1; | |
563 | ||
51dd6249 NJ |
564 | trace_f2fs_truncate_nodes_enter(dn->inode, dn->nid, dn->data_blkaddr); |
565 | ||
e05df3b1 | 566 | page = get_node_page(sbi, dn->nid); |
51dd6249 NJ |
567 | if (IS_ERR(page)) { |
568 | trace_f2fs_truncate_nodes_exit(dn->inode, PTR_ERR(page)); | |
e05df3b1 | 569 | return PTR_ERR(page); |
51dd6249 | 570 | } |
e05df3b1 | 571 | |
45590710 | 572 | rn = F2FS_NODE(page); |
e05df3b1 JK |
573 | if (depth < 3) { |
574 | for (i = ofs; i < NIDS_PER_BLOCK; i++, freed++) { | |
575 | child_nid = le32_to_cpu(rn->in.nid[i]); | |
576 | if (child_nid == 0) | |
577 | continue; | |
578 | rdn.nid = child_nid; | |
579 | ret = truncate_dnode(&rdn); | |
580 | if (ret < 0) | |
581 | goto out_err; | |
582 | set_nid(page, i, 0, false); | |
583 | } | |
584 | } else { | |
585 | child_nofs = nofs + ofs * (NIDS_PER_BLOCK + 1) + 1; | |
586 | for (i = ofs; i < NIDS_PER_BLOCK; i++) { | |
587 | child_nid = le32_to_cpu(rn->in.nid[i]); | |
588 | if (child_nid == 0) { | |
589 | child_nofs += NIDS_PER_BLOCK + 1; | |
590 | continue; | |
591 | } | |
592 | rdn.nid = child_nid; | |
593 | ret = truncate_nodes(&rdn, child_nofs, 0, depth - 1); | |
594 | if (ret == (NIDS_PER_BLOCK + 1)) { | |
595 | set_nid(page, i, 0, false); | |
596 | child_nofs += ret; | |
597 | } else if (ret < 0 && ret != -ENOENT) { | |
598 | goto out_err; | |
599 | } | |
600 | } | |
601 | freed = child_nofs; | |
602 | } | |
603 | ||
604 | if (!ofs) { | |
605 | /* remove current indirect node */ | |
606 | dn->node_page = page; | |
607 | truncate_node(dn); | |
608 | freed++; | |
609 | } else { | |
610 | f2fs_put_page(page, 1); | |
611 | } | |
51dd6249 | 612 | trace_f2fs_truncate_nodes_exit(dn->inode, freed); |
e05df3b1 JK |
613 | return freed; |
614 | ||
615 | out_err: | |
616 | f2fs_put_page(page, 1); | |
51dd6249 | 617 | trace_f2fs_truncate_nodes_exit(dn->inode, ret); |
e05df3b1 JK |
618 | return ret; |
619 | } | |
620 | ||
621 | static int truncate_partial_nodes(struct dnode_of_data *dn, | |
622 | struct f2fs_inode *ri, int *offset, int depth) | |
623 | { | |
624 | struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); | |
625 | struct page *pages[2]; | |
626 | nid_t nid[3]; | |
627 | nid_t child_nid; | |
628 | int err = 0; | |
629 | int i; | |
630 | int idx = depth - 2; | |
631 | ||
632 | nid[0] = le32_to_cpu(ri->i_nid[offset[0] - NODE_DIR1_BLOCK]); | |
633 | if (!nid[0]) | |
634 | return 0; | |
635 | ||
636 | /* get indirect nodes in the path */ | |
a225dca3 | 637 | for (i = 0; i < idx + 1; i++) { |
e05df3b1 JK |
638 | /* refernece count'll be increased */ |
639 | pages[i] = get_node_page(sbi, nid[i]); | |
640 | if (IS_ERR(pages[i])) { | |
e05df3b1 | 641 | err = PTR_ERR(pages[i]); |
a225dca3 | 642 | idx = i - 1; |
e05df3b1 JK |
643 | goto fail; |
644 | } | |
645 | nid[i + 1] = get_nid(pages[i], offset[i + 1], false); | |
646 | } | |
647 | ||
648 | /* free direct nodes linked to a partial indirect node */ | |
a225dca3 | 649 | for (i = offset[idx + 1]; i < NIDS_PER_BLOCK; i++) { |
e05df3b1 JK |
650 | child_nid = get_nid(pages[idx], i, false); |
651 | if (!child_nid) | |
652 | continue; | |
653 | dn->nid = child_nid; | |
654 | err = truncate_dnode(dn); | |
655 | if (err < 0) | |
656 | goto fail; | |
657 | set_nid(pages[idx], i, 0, false); | |
658 | } | |
659 | ||
a225dca3 | 660 | if (offset[idx + 1] == 0) { |
e05df3b1 JK |
661 | dn->node_page = pages[idx]; |
662 | dn->nid = nid[idx]; | |
663 | truncate_node(dn); | |
664 | } else { | |
665 | f2fs_put_page(pages[idx], 1); | |
666 | } | |
667 | offset[idx]++; | |
a225dca3 | 668 | offset[idx + 1] = 0; |
669 | idx--; | |
e05df3b1 | 670 | fail: |
a225dca3 | 671 | for (i = idx; i >= 0; i--) |
e05df3b1 | 672 | f2fs_put_page(pages[i], 1); |
51dd6249 NJ |
673 | |
674 | trace_f2fs_truncate_partial_nodes(dn->inode, nid, depth, err); | |
675 | ||
e05df3b1 JK |
676 | return err; |
677 | } | |
678 | ||
0a8165d7 | 679 | /* |
e05df3b1 JK |
680 | * All the block addresses of data and nodes should be nullified. |
681 | */ | |
682 | int truncate_inode_blocks(struct inode *inode, pgoff_t from) | |
683 | { | |
684 | struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb); | |
685 | int err = 0, cont = 1; | |
686 | int level, offset[4], noffset[4]; | |
7dd690c8 | 687 | unsigned int nofs = 0; |
58bfaf44 | 688 | struct f2fs_inode *ri; |
e05df3b1 JK |
689 | struct dnode_of_data dn; |
690 | struct page *page; | |
691 | ||
51dd6249 NJ |
692 | trace_f2fs_truncate_inode_blocks_enter(inode, from); |
693 | ||
de93653f | 694 | level = get_node_path(F2FS_I(inode), from, offset, noffset); |
afcb7ca0 | 695 | restart: |
e05df3b1 | 696 | page = get_node_page(sbi, inode->i_ino); |
51dd6249 NJ |
697 | if (IS_ERR(page)) { |
698 | trace_f2fs_truncate_inode_blocks_exit(inode, PTR_ERR(page)); | |
e05df3b1 | 699 | return PTR_ERR(page); |
51dd6249 | 700 | } |
e05df3b1 JK |
701 | |
702 | set_new_dnode(&dn, inode, page, NULL, 0); | |
703 | unlock_page(page); | |
704 | ||
58bfaf44 | 705 | ri = F2FS_INODE(page); |
e05df3b1 JK |
706 | switch (level) { |
707 | case 0: | |
708 | case 1: | |
709 | nofs = noffset[1]; | |
710 | break; | |
711 | case 2: | |
712 | nofs = noffset[1]; | |
713 | if (!offset[level - 1]) | |
714 | goto skip_partial; | |
58bfaf44 | 715 | err = truncate_partial_nodes(&dn, ri, offset, level); |
e05df3b1 JK |
716 | if (err < 0 && err != -ENOENT) |
717 | goto fail; | |
718 | nofs += 1 + NIDS_PER_BLOCK; | |
719 | break; | |
720 | case 3: | |
721 | nofs = 5 + 2 * NIDS_PER_BLOCK; | |
722 | if (!offset[level - 1]) | |
723 | goto skip_partial; | |
58bfaf44 | 724 | err = truncate_partial_nodes(&dn, ri, offset, level); |
e05df3b1 JK |
725 | if (err < 0 && err != -ENOENT) |
726 | goto fail; | |
727 | break; | |
728 | default: | |
729 | BUG(); | |
730 | } | |
731 | ||
732 | skip_partial: | |
733 | while (cont) { | |
58bfaf44 | 734 | dn.nid = le32_to_cpu(ri->i_nid[offset[0] - NODE_DIR1_BLOCK]); |
e05df3b1 JK |
735 | switch (offset[0]) { |
736 | case NODE_DIR1_BLOCK: | |
737 | case NODE_DIR2_BLOCK: | |
738 | err = truncate_dnode(&dn); | |
739 | break; | |
740 | ||
741 | case NODE_IND1_BLOCK: | |
742 | case NODE_IND2_BLOCK: | |
743 | err = truncate_nodes(&dn, nofs, offset[1], 2); | |
744 | break; | |
745 | ||
746 | case NODE_DIND_BLOCK: | |
747 | err = truncate_nodes(&dn, nofs, offset[1], 3); | |
748 | cont = 0; | |
749 | break; | |
750 | ||
751 | default: | |
752 | BUG(); | |
753 | } | |
754 | if (err < 0 && err != -ENOENT) | |
755 | goto fail; | |
756 | if (offset[1] == 0 && | |
58bfaf44 | 757 | ri->i_nid[offset[0] - NODE_DIR1_BLOCK]) { |
e05df3b1 | 758 | lock_page(page); |
4ef51a8f | 759 | if (unlikely(page->mapping != NODE_MAPPING(sbi))) { |
afcb7ca0 JK |
760 | f2fs_put_page(page, 1); |
761 | goto restart; | |
762 | } | |
3cb5ad15 | 763 | f2fs_wait_on_page_writeback(page, NODE); |
58bfaf44 | 764 | ri->i_nid[offset[0] - NODE_DIR1_BLOCK] = 0; |
e05df3b1 JK |
765 | set_page_dirty(page); |
766 | unlock_page(page); | |
767 | } | |
768 | offset[1] = 0; | |
769 | offset[0]++; | |
770 | nofs += err; | |
771 | } | |
772 | fail: | |
773 | f2fs_put_page(page, 0); | |
51dd6249 | 774 | trace_f2fs_truncate_inode_blocks_exit(inode, err); |
e05df3b1 JK |
775 | return err > 0 ? 0 : err; |
776 | } | |
777 | ||
4f16fb0f JK |
778 | int truncate_xattr_node(struct inode *inode, struct page *page) |
779 | { | |
780 | struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb); | |
781 | nid_t nid = F2FS_I(inode)->i_xattr_nid; | |
782 | struct dnode_of_data dn; | |
783 | struct page *npage; | |
784 | ||
785 | if (!nid) | |
786 | return 0; | |
787 | ||
788 | npage = get_node_page(sbi, nid); | |
789 | if (IS_ERR(npage)) | |
790 | return PTR_ERR(npage); | |
791 | ||
792 | F2FS_I(inode)->i_xattr_nid = 0; | |
65985d93 JK |
793 | |
794 | /* need to do checkpoint during fsync */ | |
795 | F2FS_I(inode)->xattr_ver = cur_cp_version(F2FS_CKPT(sbi)); | |
796 | ||
4f16fb0f JK |
797 | set_new_dnode(&dn, inode, page, npage, nid); |
798 | ||
799 | if (page) | |
01d2d1aa | 800 | dn.inode_page_locked = true; |
4f16fb0f JK |
801 | truncate_node(&dn); |
802 | return 0; | |
803 | } | |
804 | ||
39936837 | 805 | /* |
4f4124d0 CY |
806 | * Caller should grab and release a rwsem by calling f2fs_lock_op() and |
807 | * f2fs_unlock_op(). | |
39936837 | 808 | */ |
58e674d6 | 809 | void remove_inode_page(struct inode *inode) |
e05df3b1 JK |
810 | { |
811 | struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb); | |
812 | struct page *page; | |
813 | nid_t ino = inode->i_ino; | |
814 | struct dnode_of_data dn; | |
815 | ||
e05df3b1 | 816 | page = get_node_page(sbi, ino); |
39936837 | 817 | if (IS_ERR(page)) |
58e674d6 | 818 | return; |
e05df3b1 | 819 | |
58e674d6 | 820 | if (truncate_xattr_node(inode, page)) { |
4f16fb0f | 821 | f2fs_put_page(page, 1); |
58e674d6 | 822 | return; |
e05df3b1 | 823 | } |
71e9fec5 | 824 | /* 0 is possible, after f2fs_new_inode() is failed */ |
5d56b671 | 825 | f2fs_bug_on(inode->i_blocks != 0 && inode->i_blocks != 1); |
71e9fec5 JK |
826 | set_new_dnode(&dn, inode, page, page, ino); |
827 | truncate_node(&dn); | |
e05df3b1 JK |
828 | } |
829 | ||
44a83ff6 | 830 | struct page *new_inode_page(struct inode *inode, const struct qstr *name) |
e05df3b1 | 831 | { |
e05df3b1 JK |
832 | struct dnode_of_data dn; |
833 | ||
834 | /* allocate inode page for new inode */ | |
835 | set_new_dnode(&dn, inode, NULL, NULL, inode->i_ino); | |
44a83ff6 JK |
836 | |
837 | /* caller should f2fs_put_page(page, 1); */ | |
8ae8f162 | 838 | return new_node_page(&dn, 0, NULL); |
e05df3b1 JK |
839 | } |
840 | ||
8ae8f162 JK |
841 | struct page *new_node_page(struct dnode_of_data *dn, |
842 | unsigned int ofs, struct page *ipage) | |
e05df3b1 JK |
843 | { |
844 | struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb); | |
e05df3b1 JK |
845 | struct node_info old_ni, new_ni; |
846 | struct page *page; | |
847 | int err; | |
848 | ||
6bacf52f | 849 | if (unlikely(is_inode_flag_set(F2FS_I(dn->inode), FI_NO_ALLOC))) |
e05df3b1 JK |
850 | return ERR_PTR(-EPERM); |
851 | ||
3cb5ad15 JK |
852 | page = grab_cache_page_write_begin(NODE_MAPPING(sbi), |
853 | dn->nid, AOP_FLAG_NOFS); | |
e05df3b1 JK |
854 | if (!page) |
855 | return ERR_PTR(-ENOMEM); | |
856 | ||
6bacf52f | 857 | if (unlikely(!inc_valid_node_count(sbi, dn->inode))) { |
9c02740c JK |
858 | err = -ENOSPC; |
859 | goto fail; | |
860 | } | |
e05df3b1 | 861 | |
9c02740c | 862 | get_node_info(sbi, dn->nid, &old_ni); |
e05df3b1 JK |
863 | |
864 | /* Reinitialize old_ni with new node page */ | |
5d56b671 | 865 | f2fs_bug_on(old_ni.blk_addr != NULL_ADDR); |
e05df3b1 JK |
866 | new_ni = old_ni; |
867 | new_ni.ino = dn->inode->i_ino; | |
479f40c4 | 868 | set_node_addr(sbi, &new_ni, NEW_ADDR, false); |
9c02740c JK |
869 | |
870 | fill_node_footer(page, dn->nid, dn->inode->i_ino, ofs, true); | |
398b1ac5 | 871 | set_cold_node(dn->inode, page); |
9c02740c JK |
872 | SetPageUptodate(page); |
873 | set_page_dirty(page); | |
e05df3b1 | 874 | |
4bc8e9bc | 875 | if (f2fs_has_xattr_block(ofs)) |
479bd73a JK |
876 | F2FS_I(dn->inode)->i_xattr_nid = dn->nid; |
877 | ||
e05df3b1 | 878 | dn->node_page = page; |
8ae8f162 JK |
879 | if (ipage) |
880 | update_inode(dn->inode, ipage); | |
881 | else | |
882 | sync_inode_page(dn); | |
e05df3b1 JK |
883 | if (ofs == 0) |
884 | inc_valid_inode_count(sbi); | |
885 | ||
886 | return page; | |
887 | ||
888 | fail: | |
71e9fec5 | 889 | clear_node_page_dirty(page); |
e05df3b1 JK |
890 | f2fs_put_page(page, 1); |
891 | return ERR_PTR(err); | |
892 | } | |
893 | ||
56ae674c JK |
894 | /* |
895 | * Caller should do after getting the following values. | |
896 | * 0: f2fs_put_page(page, 0) | |
897 | * LOCKED_PAGE: f2fs_put_page(page, 1) | |
898 | * error: nothing | |
899 | */ | |
93dfe2ac | 900 | static int read_node_page(struct page *page, int rw) |
e05df3b1 JK |
901 | { |
902 | struct f2fs_sb_info *sbi = F2FS_SB(page->mapping->host->i_sb); | |
903 | struct node_info ni; | |
904 | ||
905 | get_node_info(sbi, page->index, &ni); | |
906 | ||
6bacf52f | 907 | if (unlikely(ni.blk_addr == NULL_ADDR)) { |
393ff91f | 908 | f2fs_put_page(page, 1); |
e05df3b1 | 909 | return -ENOENT; |
393ff91f JK |
910 | } |
911 | ||
56ae674c JK |
912 | if (PageUptodate(page)) |
913 | return LOCKED_PAGE; | |
393ff91f | 914 | |
93dfe2ac | 915 | return f2fs_submit_page_bio(sbi, page, ni.blk_addr, rw); |
e05df3b1 JK |
916 | } |
917 | ||
0a8165d7 | 918 | /* |
e05df3b1 JK |
919 | * Readahead a node page |
920 | */ | |
921 | void ra_node_page(struct f2fs_sb_info *sbi, nid_t nid) | |
922 | { | |
e05df3b1 | 923 | struct page *apage; |
56ae674c | 924 | int err; |
e05df3b1 | 925 | |
4ef51a8f | 926 | apage = find_get_page(NODE_MAPPING(sbi), nid); |
393ff91f JK |
927 | if (apage && PageUptodate(apage)) { |
928 | f2fs_put_page(apage, 0); | |
929 | return; | |
930 | } | |
e05df3b1 JK |
931 | f2fs_put_page(apage, 0); |
932 | ||
4ef51a8f | 933 | apage = grab_cache_page(NODE_MAPPING(sbi), nid); |
e05df3b1 JK |
934 | if (!apage) |
935 | return; | |
936 | ||
56ae674c JK |
937 | err = read_node_page(apage, READA); |
938 | if (err == 0) | |
393ff91f | 939 | f2fs_put_page(apage, 0); |
56ae674c JK |
940 | else if (err == LOCKED_PAGE) |
941 | f2fs_put_page(apage, 1); | |
e05df3b1 JK |
942 | } |
943 | ||
944 | struct page *get_node_page(struct f2fs_sb_info *sbi, pgoff_t nid) | |
945 | { | |
56ae674c JK |
946 | struct page *page; |
947 | int err; | |
afcb7ca0 | 948 | repeat: |
3cb5ad15 JK |
949 | page = grab_cache_page_write_begin(NODE_MAPPING(sbi), |
950 | nid, AOP_FLAG_NOFS); | |
e05df3b1 JK |
951 | if (!page) |
952 | return ERR_PTR(-ENOMEM); | |
953 | ||
954 | err = read_node_page(page, READ_SYNC); | |
56ae674c | 955 | if (err < 0) |
e05df3b1 | 956 | return ERR_PTR(err); |
56ae674c JK |
957 | else if (err == LOCKED_PAGE) |
958 | goto got_it; | |
e05df3b1 | 959 | |
393ff91f | 960 | lock_page(page); |
3bb5e2c8 | 961 | if (unlikely(!PageUptodate(page) || nid != nid_of_node(page))) { |
393ff91f JK |
962 | f2fs_put_page(page, 1); |
963 | return ERR_PTR(-EIO); | |
964 | } | |
4ef51a8f | 965 | if (unlikely(page->mapping != NODE_MAPPING(sbi))) { |
afcb7ca0 JK |
966 | f2fs_put_page(page, 1); |
967 | goto repeat; | |
968 | } | |
56ae674c | 969 | got_it: |
e05df3b1 JK |
970 | mark_page_accessed(page); |
971 | return page; | |
972 | } | |
973 | ||
0a8165d7 | 974 | /* |
e05df3b1 JK |
975 | * Return a locked page for the desired node page. |
976 | * And, readahead MAX_RA_NODE number of node pages. | |
977 | */ | |
978 | struct page *get_node_page_ra(struct page *parent, int start) | |
979 | { | |
980 | struct f2fs_sb_info *sbi = F2FS_SB(parent->mapping->host->i_sb); | |
c718379b | 981 | struct blk_plug plug; |
e05df3b1 | 982 | struct page *page; |
56ae674c JK |
983 | int err, i, end; |
984 | nid_t nid; | |
e05df3b1 JK |
985 | |
986 | /* First, try getting the desired direct node. */ | |
987 | nid = get_nid(parent, start, false); | |
988 | if (!nid) | |
989 | return ERR_PTR(-ENOENT); | |
afcb7ca0 | 990 | repeat: |
4ef51a8f | 991 | page = grab_cache_page(NODE_MAPPING(sbi), nid); |
e05df3b1 JK |
992 | if (!page) |
993 | return ERR_PTR(-ENOMEM); | |
994 | ||
66d36a29 | 995 | err = read_node_page(page, READ_SYNC); |
56ae674c | 996 | if (err < 0) |
e05df3b1 | 997 | return ERR_PTR(err); |
56ae674c JK |
998 | else if (err == LOCKED_PAGE) |
999 | goto page_hit; | |
e05df3b1 | 1000 | |
c718379b JK |
1001 | blk_start_plug(&plug); |
1002 | ||
e05df3b1 JK |
1003 | /* Then, try readahead for siblings of the desired node */ |
1004 | end = start + MAX_RA_NODE; | |
1005 | end = min(end, NIDS_PER_BLOCK); | |
1006 | for (i = start + 1; i < end; i++) { | |
1007 | nid = get_nid(parent, i, false); | |
1008 | if (!nid) | |
1009 | continue; | |
1010 | ra_node_page(sbi, nid); | |
1011 | } | |
1012 | ||
c718379b JK |
1013 | blk_finish_plug(&plug); |
1014 | ||
e05df3b1 | 1015 | lock_page(page); |
4ef51a8f | 1016 | if (unlikely(page->mapping != NODE_MAPPING(sbi))) { |
afcb7ca0 JK |
1017 | f2fs_put_page(page, 1); |
1018 | goto repeat; | |
1019 | } | |
e0f56cb4 | 1020 | page_hit: |
6bacf52f | 1021 | if (unlikely(!PageUptodate(page))) { |
e05df3b1 JK |
1022 | f2fs_put_page(page, 1); |
1023 | return ERR_PTR(-EIO); | |
1024 | } | |
393ff91f | 1025 | mark_page_accessed(page); |
e05df3b1 JK |
1026 | return page; |
1027 | } | |
1028 | ||
1029 | void sync_inode_page(struct dnode_of_data *dn) | |
1030 | { | |
1031 | if (IS_INODE(dn->node_page) || dn->inode_page == dn->node_page) { | |
1032 | update_inode(dn->inode, dn->node_page); | |
1033 | } else if (dn->inode_page) { | |
1034 | if (!dn->inode_page_locked) | |
1035 | lock_page(dn->inode_page); | |
1036 | update_inode(dn->inode, dn->inode_page); | |
1037 | if (!dn->inode_page_locked) | |
1038 | unlock_page(dn->inode_page); | |
1039 | } else { | |
39936837 | 1040 | update_inode_page(dn->inode); |
e05df3b1 JK |
1041 | } |
1042 | } | |
1043 | ||
1044 | int sync_node_pages(struct f2fs_sb_info *sbi, nid_t ino, | |
1045 | struct writeback_control *wbc) | |
1046 | { | |
e05df3b1 JK |
1047 | pgoff_t index, end; |
1048 | struct pagevec pvec; | |
1049 | int step = ino ? 2 : 0; | |
1050 | int nwritten = 0, wrote = 0; | |
1051 | ||
1052 | pagevec_init(&pvec, 0); | |
1053 | ||
1054 | next_step: | |
1055 | index = 0; | |
1056 | end = LONG_MAX; | |
1057 | ||
1058 | while (index <= end) { | |
1059 | int i, nr_pages; | |
4ef51a8f | 1060 | nr_pages = pagevec_lookup_tag(&pvec, NODE_MAPPING(sbi), &index, |
e05df3b1 JK |
1061 | PAGECACHE_TAG_DIRTY, |
1062 | min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1); | |
1063 | if (nr_pages == 0) | |
1064 | break; | |
1065 | ||
1066 | for (i = 0; i < nr_pages; i++) { | |
1067 | struct page *page = pvec.pages[i]; | |
1068 | ||
1069 | /* | |
1070 | * flushing sequence with step: | |
1071 | * 0. indirect nodes | |
1072 | * 1. dentry dnodes | |
1073 | * 2. file dnodes | |
1074 | */ | |
1075 | if (step == 0 && IS_DNODE(page)) | |
1076 | continue; | |
1077 | if (step == 1 && (!IS_DNODE(page) || | |
1078 | is_cold_node(page))) | |
1079 | continue; | |
1080 | if (step == 2 && (!IS_DNODE(page) || | |
1081 | !is_cold_node(page))) | |
1082 | continue; | |
1083 | ||
1084 | /* | |
1085 | * If an fsync mode, | |
1086 | * we should not skip writing node pages. | |
1087 | */ | |
1088 | if (ino && ino_of_node(page) == ino) | |
1089 | lock_page(page); | |
1090 | else if (!trylock_page(page)) | |
1091 | continue; | |
1092 | ||
4ef51a8f | 1093 | if (unlikely(page->mapping != NODE_MAPPING(sbi))) { |
e05df3b1 JK |
1094 | continue_unlock: |
1095 | unlock_page(page); | |
1096 | continue; | |
1097 | } | |
1098 | if (ino && ino_of_node(page) != ino) | |
1099 | goto continue_unlock; | |
1100 | ||
1101 | if (!PageDirty(page)) { | |
1102 | /* someone wrote it for us */ | |
1103 | goto continue_unlock; | |
1104 | } | |
1105 | ||
1106 | if (!clear_page_dirty_for_io(page)) | |
1107 | goto continue_unlock; | |
1108 | ||
1109 | /* called by fsync() */ | |
1110 | if (ino && IS_DNODE(page)) { | |
1111 | int mark = !is_checkpointed_node(sbi, ino); | |
1112 | set_fsync_mark(page, 1); | |
1113 | if (IS_INODE(page)) | |
1114 | set_dentry_mark(page, mark); | |
1115 | nwritten++; | |
1116 | } else { | |
1117 | set_fsync_mark(page, 0); | |
1118 | set_dentry_mark(page, 0); | |
1119 | } | |
4ef51a8f | 1120 | NODE_MAPPING(sbi)->a_ops->writepage(page, wbc); |
e05df3b1 JK |
1121 | wrote++; |
1122 | ||
1123 | if (--wbc->nr_to_write == 0) | |
1124 | break; | |
1125 | } | |
1126 | pagevec_release(&pvec); | |
1127 | cond_resched(); | |
1128 | ||
1129 | if (wbc->nr_to_write == 0) { | |
1130 | step = 2; | |
1131 | break; | |
1132 | } | |
1133 | } | |
1134 | ||
1135 | if (step < 2) { | |
1136 | step++; | |
1137 | goto next_step; | |
1138 | } | |
1139 | ||
1140 | if (wrote) | |
458e6197 | 1141 | f2fs_submit_merged_bio(sbi, NODE, WRITE); |
e05df3b1 JK |
1142 | return nwritten; |
1143 | } | |
1144 | ||
cfe58f9d JK |
1145 | int wait_on_node_pages_writeback(struct f2fs_sb_info *sbi, nid_t ino) |
1146 | { | |
cfe58f9d JK |
1147 | pgoff_t index = 0, end = LONG_MAX; |
1148 | struct pagevec pvec; | |
cfe58f9d JK |
1149 | int ret2 = 0, ret = 0; |
1150 | ||
1151 | pagevec_init(&pvec, 0); | |
4ef51a8f JK |
1152 | |
1153 | while (index <= end) { | |
1154 | int i, nr_pages; | |
1155 | nr_pages = pagevec_lookup_tag(&pvec, NODE_MAPPING(sbi), &index, | |
1156 | PAGECACHE_TAG_WRITEBACK, | |
1157 | min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1); | |
1158 | if (nr_pages == 0) | |
1159 | break; | |
cfe58f9d JK |
1160 | |
1161 | for (i = 0; i < nr_pages; i++) { | |
1162 | struct page *page = pvec.pages[i]; | |
1163 | ||
1164 | /* until radix tree lookup accepts end_index */ | |
cfb271d4 | 1165 | if (unlikely(page->index > end)) |
cfe58f9d JK |
1166 | continue; |
1167 | ||
4bf08ff6 | 1168 | if (ino && ino_of_node(page) == ino) { |
3cb5ad15 | 1169 | f2fs_wait_on_page_writeback(page, NODE); |
4bf08ff6 CY |
1170 | if (TestClearPageError(page)) |
1171 | ret = -EIO; | |
1172 | } | |
cfe58f9d JK |
1173 | } |
1174 | pagevec_release(&pvec); | |
1175 | cond_resched(); | |
1176 | } | |
1177 | ||
4ef51a8f | 1178 | if (unlikely(test_and_clear_bit(AS_ENOSPC, &NODE_MAPPING(sbi)->flags))) |
cfe58f9d | 1179 | ret2 = -ENOSPC; |
4ef51a8f | 1180 | if (unlikely(test_and_clear_bit(AS_EIO, &NODE_MAPPING(sbi)->flags))) |
cfe58f9d JK |
1181 | ret2 = -EIO; |
1182 | if (!ret) | |
1183 | ret = ret2; | |
1184 | return ret; | |
1185 | } | |
1186 | ||
e05df3b1 JK |
1187 | static int f2fs_write_node_page(struct page *page, |
1188 | struct writeback_control *wbc) | |
1189 | { | |
1190 | struct f2fs_sb_info *sbi = F2FS_SB(page->mapping->host->i_sb); | |
1191 | nid_t nid; | |
e05df3b1 JK |
1192 | block_t new_addr; |
1193 | struct node_info ni; | |
fb5566da JK |
1194 | struct f2fs_io_info fio = { |
1195 | .type = NODE, | |
6c311ec6 | 1196 | .rw = (wbc->sync_mode == WB_SYNC_ALL) ? WRITE_SYNC : WRITE, |
fb5566da | 1197 | }; |
e05df3b1 | 1198 | |
cfb271d4 | 1199 | if (unlikely(sbi->por_doing)) |
87a9bd26 JK |
1200 | goto redirty_out; |
1201 | ||
3cb5ad15 | 1202 | f2fs_wait_on_page_writeback(page, NODE); |
e05df3b1 | 1203 | |
e05df3b1 JK |
1204 | /* get old block addr of this node page */ |
1205 | nid = nid_of_node(page); | |
5d56b671 | 1206 | f2fs_bug_on(page->index != nid); |
e05df3b1 JK |
1207 | |
1208 | get_node_info(sbi, nid, &ni); | |
1209 | ||
1210 | /* This page is already truncated */ | |
6bacf52f | 1211 | if (unlikely(ni.blk_addr == NULL_ADDR)) { |
39936837 JK |
1212 | dec_page_count(sbi, F2FS_DIRTY_NODES); |
1213 | unlock_page(page); | |
1214 | return 0; | |
1215 | } | |
e05df3b1 | 1216 | |
87a9bd26 JK |
1217 | if (wbc->for_reclaim) |
1218 | goto redirty_out; | |
08d8058b | 1219 | |
39936837 | 1220 | mutex_lock(&sbi->node_write); |
e05df3b1 | 1221 | set_page_writeback(page); |
fb5566da | 1222 | write_node_page(sbi, page, &fio, nid, ni.blk_addr, &new_addr); |
479f40c4 | 1223 | set_node_addr(sbi, &ni, new_addr, is_fsync_dnode(page)); |
e05df3b1 | 1224 | dec_page_count(sbi, F2FS_DIRTY_NODES); |
39936837 | 1225 | mutex_unlock(&sbi->node_write); |
e05df3b1 JK |
1226 | unlock_page(page); |
1227 | return 0; | |
87a9bd26 JK |
1228 | |
1229 | redirty_out: | |
1230 | dec_page_count(sbi, F2FS_DIRTY_NODES); | |
1231 | wbc->pages_skipped++; | |
9cf3c389 | 1232 | account_page_redirty(page); |
87a9bd26 JK |
1233 | set_page_dirty(page); |
1234 | return AOP_WRITEPAGE_ACTIVATE; | |
e05df3b1 JK |
1235 | } |
1236 | ||
1237 | static int f2fs_write_node_pages(struct address_space *mapping, | |
1238 | struct writeback_control *wbc) | |
1239 | { | |
1240 | struct f2fs_sb_info *sbi = F2FS_SB(mapping->host->i_sb); | |
50c8cdb3 | 1241 | long diff; |
e05df3b1 | 1242 | |
4660f9c0 JK |
1243 | /* balancing f2fs's metadata in background */ |
1244 | f2fs_balance_fs_bg(sbi); | |
e05df3b1 | 1245 | |
a7fdffbd | 1246 | /* collect a number of dirty node pages and write together */ |
87d6f890 | 1247 | if (get_pages(sbi, F2FS_DIRTY_NODES) < nr_pages_to_skip(sbi, NODE)) |
d3baf95d | 1248 | goto skip_write; |
a7fdffbd | 1249 | |
50c8cdb3 | 1250 | diff = nr_pages_to_write(sbi, NODE, wbc); |
fb5566da | 1251 | wbc->sync_mode = WB_SYNC_NONE; |
e05df3b1 | 1252 | sync_node_pages(sbi, 0, wbc); |
50c8cdb3 | 1253 | wbc->nr_to_write = max((long)0, wbc->nr_to_write - diff); |
e05df3b1 | 1254 | return 0; |
d3baf95d JK |
1255 | |
1256 | skip_write: | |
1257 | wbc->pages_skipped += get_pages(sbi, F2FS_DIRTY_NODES); | |
1258 | return 0; | |
e05df3b1 JK |
1259 | } |
1260 | ||
1261 | static int f2fs_set_node_page_dirty(struct page *page) | |
1262 | { | |
1263 | struct address_space *mapping = page->mapping; | |
1264 | struct f2fs_sb_info *sbi = F2FS_SB(mapping->host->i_sb); | |
1265 | ||
26c6b887 JK |
1266 | trace_f2fs_set_page_dirty(page, NODE); |
1267 | ||
e05df3b1 JK |
1268 | SetPageUptodate(page); |
1269 | if (!PageDirty(page)) { | |
1270 | __set_page_dirty_nobuffers(page); | |
1271 | inc_page_count(sbi, F2FS_DIRTY_NODES); | |
1272 | SetPagePrivate(page); | |
1273 | return 1; | |
1274 | } | |
1275 | return 0; | |
1276 | } | |
1277 | ||
d47992f8 LC |
1278 | static void f2fs_invalidate_node_page(struct page *page, unsigned int offset, |
1279 | unsigned int length) | |
e05df3b1 JK |
1280 | { |
1281 | struct inode *inode = page->mapping->host; | |
1282 | struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb); | |
1283 | if (PageDirty(page)) | |
1284 | dec_page_count(sbi, F2FS_DIRTY_NODES); | |
1285 | ClearPagePrivate(page); | |
1286 | } | |
1287 | ||
1288 | static int f2fs_release_node_page(struct page *page, gfp_t wait) | |
1289 | { | |
1290 | ClearPagePrivate(page); | |
c3850aa1 | 1291 | return 1; |
e05df3b1 JK |
1292 | } |
1293 | ||
0a8165d7 | 1294 | /* |
e05df3b1 JK |
1295 | * Structure of the f2fs node operations |
1296 | */ | |
1297 | const struct address_space_operations f2fs_node_aops = { | |
1298 | .writepage = f2fs_write_node_page, | |
1299 | .writepages = f2fs_write_node_pages, | |
1300 | .set_page_dirty = f2fs_set_node_page_dirty, | |
1301 | .invalidatepage = f2fs_invalidate_node_page, | |
1302 | .releasepage = f2fs_release_node_page, | |
1303 | }; | |
1304 | ||
8a7ed66a JK |
1305 | static struct free_nid *__lookup_free_nid_list(struct f2fs_nm_info *nm_i, |
1306 | nid_t n) | |
e05df3b1 | 1307 | { |
8a7ed66a | 1308 | return radix_tree_lookup(&nm_i->free_nid_root, n); |
e05df3b1 JK |
1309 | } |
1310 | ||
8a7ed66a JK |
1311 | static void __del_from_free_nid_list(struct f2fs_nm_info *nm_i, |
1312 | struct free_nid *i) | |
e05df3b1 JK |
1313 | { |
1314 | list_del(&i->list); | |
8a7ed66a | 1315 | radix_tree_delete(&nm_i->free_nid_root, i->nid); |
e05df3b1 JK |
1316 | } |
1317 | ||
59bbd474 | 1318 | static int add_free_nid(struct f2fs_nm_info *nm_i, nid_t nid, bool build) |
e05df3b1 JK |
1319 | { |
1320 | struct free_nid *i; | |
59bbd474 JK |
1321 | struct nat_entry *ne; |
1322 | bool allocated = false; | |
e05df3b1 | 1323 | |
cdfc41c1 | 1324 | if (!available_free_memory(nm_i, FREE_NIDS)) |
23d38844 | 1325 | return -1; |
9198aceb JK |
1326 | |
1327 | /* 0 nid should not be used */ | |
cfb271d4 | 1328 | if (unlikely(nid == 0)) |
9198aceb | 1329 | return 0; |
59bbd474 | 1330 | |
7bd59381 GZ |
1331 | if (build) { |
1332 | /* do not add allocated nids */ | |
1333 | read_lock(&nm_i->nat_tree_lock); | |
1334 | ne = __lookup_nat_cache(nm_i, nid); | |
8a7ed66a JK |
1335 | if (ne && |
1336 | (!ne->checkpointed || nat_get_blkaddr(ne) != NULL_ADDR)) | |
7bd59381 GZ |
1337 | allocated = true; |
1338 | read_unlock(&nm_i->nat_tree_lock); | |
1339 | if (allocated) | |
1340 | return 0; | |
e05df3b1 | 1341 | } |
7bd59381 GZ |
1342 | |
1343 | i = f2fs_kmem_cache_alloc(free_nid_slab, GFP_NOFS); | |
e05df3b1 JK |
1344 | i->nid = nid; |
1345 | i->state = NID_NEW; | |
1346 | ||
1347 | spin_lock(&nm_i->free_nid_list_lock); | |
8a7ed66a | 1348 | if (radix_tree_insert(&nm_i->free_nid_root, i->nid, i)) { |
e05df3b1 JK |
1349 | spin_unlock(&nm_i->free_nid_list_lock); |
1350 | kmem_cache_free(free_nid_slab, i); | |
1351 | return 0; | |
1352 | } | |
1353 | list_add_tail(&i->list, &nm_i->free_nid_list); | |
1354 | nm_i->fcnt++; | |
1355 | spin_unlock(&nm_i->free_nid_list_lock); | |
1356 | return 1; | |
1357 | } | |
1358 | ||
1359 | static void remove_free_nid(struct f2fs_nm_info *nm_i, nid_t nid) | |
1360 | { | |
1361 | struct free_nid *i; | |
cf0ee0f0 CY |
1362 | bool need_free = false; |
1363 | ||
e05df3b1 | 1364 | spin_lock(&nm_i->free_nid_list_lock); |
8a7ed66a | 1365 | i = __lookup_free_nid_list(nm_i, nid); |
e05df3b1 | 1366 | if (i && i->state == NID_NEW) { |
8a7ed66a | 1367 | __del_from_free_nid_list(nm_i, i); |
e05df3b1 | 1368 | nm_i->fcnt--; |
cf0ee0f0 | 1369 | need_free = true; |
e05df3b1 JK |
1370 | } |
1371 | spin_unlock(&nm_i->free_nid_list_lock); | |
cf0ee0f0 CY |
1372 | |
1373 | if (need_free) | |
1374 | kmem_cache_free(free_nid_slab, i); | |
e05df3b1 JK |
1375 | } |
1376 | ||
8760952d | 1377 | static void scan_nat_page(struct f2fs_nm_info *nm_i, |
e05df3b1 JK |
1378 | struct page *nat_page, nid_t start_nid) |
1379 | { | |
1380 | struct f2fs_nat_block *nat_blk = page_address(nat_page); | |
1381 | block_t blk_addr; | |
e05df3b1 JK |
1382 | int i; |
1383 | ||
e05df3b1 JK |
1384 | i = start_nid % NAT_ENTRY_PER_BLOCK; |
1385 | ||
1386 | for (; i < NAT_ENTRY_PER_BLOCK; i++, start_nid++) { | |
23d38844 | 1387 | |
cfb271d4 | 1388 | if (unlikely(start_nid >= nm_i->max_nid)) |
04431c44 | 1389 | break; |
23d38844 HL |
1390 | |
1391 | blk_addr = le32_to_cpu(nat_blk->entries[i].block_addr); | |
5d56b671 | 1392 | f2fs_bug_on(blk_addr == NEW_ADDR); |
23d38844 | 1393 | if (blk_addr == NULL_ADDR) { |
59bbd474 | 1394 | if (add_free_nid(nm_i, start_nid, true) < 0) |
23d38844 HL |
1395 | break; |
1396 | } | |
e05df3b1 | 1397 | } |
e05df3b1 JK |
1398 | } |
1399 | ||
1400 | static void build_free_nids(struct f2fs_sb_info *sbi) | |
1401 | { | |
e05df3b1 JK |
1402 | struct f2fs_nm_info *nm_i = NM_I(sbi); |
1403 | struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); | |
1404 | struct f2fs_summary_block *sum = curseg->sum_blk; | |
8760952d | 1405 | int i = 0; |
55008d84 | 1406 | nid_t nid = nm_i->next_scan_nid; |
e05df3b1 | 1407 | |
55008d84 JK |
1408 | /* Enough entries */ |
1409 | if (nm_i->fcnt > NAT_ENTRY_PER_BLOCK) | |
1410 | return; | |
e05df3b1 | 1411 | |
55008d84 | 1412 | /* readahead nat pages to be scanned */ |
662befda | 1413 | ra_meta_pages(sbi, NAT_BLOCK_OFFSET(nid), FREE_NID_PAGES, META_NAT); |
e05df3b1 JK |
1414 | |
1415 | while (1) { | |
1416 | struct page *page = get_current_nat_page(sbi, nid); | |
1417 | ||
8760952d | 1418 | scan_nat_page(nm_i, page, nid); |
e05df3b1 JK |
1419 | f2fs_put_page(page, 1); |
1420 | ||
1421 | nid += (NAT_ENTRY_PER_BLOCK - (nid % NAT_ENTRY_PER_BLOCK)); | |
cfb271d4 | 1422 | if (unlikely(nid >= nm_i->max_nid)) |
e05df3b1 | 1423 | nid = 0; |
55008d84 JK |
1424 | |
1425 | if (i++ == FREE_NID_PAGES) | |
e05df3b1 JK |
1426 | break; |
1427 | } | |
1428 | ||
55008d84 JK |
1429 | /* go to the next free nat pages to find free nids abundantly */ |
1430 | nm_i->next_scan_nid = nid; | |
e05df3b1 JK |
1431 | |
1432 | /* find free nids from current sum_pages */ | |
1433 | mutex_lock(&curseg->curseg_mutex); | |
1434 | for (i = 0; i < nats_in_cursum(sum); i++) { | |
1435 | block_t addr = le32_to_cpu(nat_in_journal(sum, i).block_addr); | |
1436 | nid = le32_to_cpu(nid_in_journal(sum, i)); | |
1437 | if (addr == NULL_ADDR) | |
59bbd474 | 1438 | add_free_nid(nm_i, nid, true); |
e05df3b1 JK |
1439 | else |
1440 | remove_free_nid(nm_i, nid); | |
1441 | } | |
1442 | mutex_unlock(&curseg->curseg_mutex); | |
e05df3b1 JK |
1443 | } |
1444 | ||
1445 | /* | |
1446 | * If this function returns success, caller can obtain a new nid | |
1447 | * from second parameter of this function. | |
1448 | * The returned nid could be used ino as well as nid when inode is created. | |
1449 | */ | |
1450 | bool alloc_nid(struct f2fs_sb_info *sbi, nid_t *nid) | |
1451 | { | |
1452 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
1453 | struct free_nid *i = NULL; | |
1454 | struct list_head *this; | |
1455 | retry: | |
cfb271d4 | 1456 | if (unlikely(sbi->total_valid_node_count + 1 >= nm_i->max_nid)) |
55008d84 | 1457 | return false; |
e05df3b1 | 1458 | |
e05df3b1 | 1459 | spin_lock(&nm_i->free_nid_list_lock); |
e05df3b1 | 1460 | |
55008d84 | 1461 | /* We should not use stale free nids created by build_free_nids */ |
f978f5a0 | 1462 | if (nm_i->fcnt && !on_build_free_nids(nm_i)) { |
5d56b671 | 1463 | f2fs_bug_on(list_empty(&nm_i->free_nid_list)); |
55008d84 JK |
1464 | list_for_each(this, &nm_i->free_nid_list) { |
1465 | i = list_entry(this, struct free_nid, list); | |
1466 | if (i->state == NID_NEW) | |
1467 | break; | |
1468 | } | |
e05df3b1 | 1469 | |
5d56b671 | 1470 | f2fs_bug_on(i->state != NID_NEW); |
55008d84 JK |
1471 | *nid = i->nid; |
1472 | i->state = NID_ALLOC; | |
1473 | nm_i->fcnt--; | |
1474 | spin_unlock(&nm_i->free_nid_list_lock); | |
1475 | return true; | |
1476 | } | |
e05df3b1 | 1477 | spin_unlock(&nm_i->free_nid_list_lock); |
55008d84 JK |
1478 | |
1479 | /* Let's scan nat pages and its caches to get free nids */ | |
1480 | mutex_lock(&nm_i->build_lock); | |
55008d84 | 1481 | build_free_nids(sbi); |
55008d84 JK |
1482 | mutex_unlock(&nm_i->build_lock); |
1483 | goto retry; | |
e05df3b1 JK |
1484 | } |
1485 | ||
0a8165d7 | 1486 | /* |
e05df3b1 JK |
1487 | * alloc_nid() should be called prior to this function. |
1488 | */ | |
1489 | void alloc_nid_done(struct f2fs_sb_info *sbi, nid_t nid) | |
1490 | { | |
1491 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
1492 | struct free_nid *i; | |
1493 | ||
1494 | spin_lock(&nm_i->free_nid_list_lock); | |
8a7ed66a | 1495 | i = __lookup_free_nid_list(nm_i, nid); |
5d56b671 | 1496 | f2fs_bug_on(!i || i->state != NID_ALLOC); |
8a7ed66a | 1497 | __del_from_free_nid_list(nm_i, i); |
e05df3b1 | 1498 | spin_unlock(&nm_i->free_nid_list_lock); |
cf0ee0f0 CY |
1499 | |
1500 | kmem_cache_free(free_nid_slab, i); | |
e05df3b1 JK |
1501 | } |
1502 | ||
0a8165d7 | 1503 | /* |
e05df3b1 JK |
1504 | * alloc_nid() should be called prior to this function. |
1505 | */ | |
1506 | void alloc_nid_failed(struct f2fs_sb_info *sbi, nid_t nid) | |
1507 | { | |
49952fa1 JK |
1508 | struct f2fs_nm_info *nm_i = NM_I(sbi); |
1509 | struct free_nid *i; | |
cf0ee0f0 | 1510 | bool need_free = false; |
49952fa1 | 1511 | |
65985d93 JK |
1512 | if (!nid) |
1513 | return; | |
1514 | ||
49952fa1 | 1515 | spin_lock(&nm_i->free_nid_list_lock); |
8a7ed66a | 1516 | i = __lookup_free_nid_list(nm_i, nid); |
5d56b671 | 1517 | f2fs_bug_on(!i || i->state != NID_ALLOC); |
cdfc41c1 | 1518 | if (!available_free_memory(nm_i, FREE_NIDS)) { |
8a7ed66a | 1519 | __del_from_free_nid_list(nm_i, i); |
cf0ee0f0 | 1520 | need_free = true; |
95630cba HL |
1521 | } else { |
1522 | i->state = NID_NEW; | |
1523 | nm_i->fcnt++; | |
1524 | } | |
49952fa1 | 1525 | spin_unlock(&nm_i->free_nid_list_lock); |
cf0ee0f0 CY |
1526 | |
1527 | if (need_free) | |
1528 | kmem_cache_free(free_nid_slab, i); | |
e05df3b1 JK |
1529 | } |
1530 | ||
1531 | void recover_node_page(struct f2fs_sb_info *sbi, struct page *page, | |
1532 | struct f2fs_summary *sum, struct node_info *ni, | |
1533 | block_t new_blkaddr) | |
1534 | { | |
1535 | rewrite_node_page(sbi, page, sum, ni->blk_addr, new_blkaddr); | |
479f40c4 | 1536 | set_node_addr(sbi, ni, new_blkaddr, false); |
e05df3b1 JK |
1537 | clear_node_page_dirty(page); |
1538 | } | |
1539 | ||
28cdce04 CY |
1540 | void recover_inline_xattr(struct inode *inode, struct page *page) |
1541 | { | |
1542 | struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb); | |
1543 | void *src_addr, *dst_addr; | |
1544 | size_t inline_size; | |
1545 | struct page *ipage; | |
1546 | struct f2fs_inode *ri; | |
1547 | ||
987c7c31 | 1548 | if (!f2fs_has_inline_xattr(inode)) |
28cdce04 CY |
1549 | return; |
1550 | ||
1551 | if (!IS_INODE(page)) | |
1552 | return; | |
1553 | ||
1554 | ri = F2FS_INODE(page); | |
1555 | if (!(ri->i_inline & F2FS_INLINE_XATTR)) | |
1556 | return; | |
1557 | ||
1558 | ipage = get_node_page(sbi, inode->i_ino); | |
1559 | f2fs_bug_on(IS_ERR(ipage)); | |
1560 | ||
1561 | dst_addr = inline_xattr_addr(ipage); | |
1562 | src_addr = inline_xattr_addr(page); | |
1563 | inline_size = inline_xattr_size(inode); | |
1564 | ||
1565 | memcpy(dst_addr, src_addr, inline_size); | |
1566 | ||
1567 | update_inode(inode, ipage); | |
1568 | f2fs_put_page(ipage, 1); | |
1569 | } | |
1570 | ||
abb2366c JK |
1571 | bool recover_xattr_data(struct inode *inode, struct page *page, block_t blkaddr) |
1572 | { | |
1573 | struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb); | |
1574 | nid_t prev_xnid = F2FS_I(inode)->i_xattr_nid; | |
1575 | nid_t new_xnid = nid_of_node(page); | |
1576 | struct node_info ni; | |
1577 | ||
28cdce04 CY |
1578 | recover_inline_xattr(inode, page); |
1579 | ||
4bc8e9bc | 1580 | if (!f2fs_has_xattr_block(ofs_of_node(page))) |
abb2366c JK |
1581 | return false; |
1582 | ||
1583 | /* 1: invalidate the previous xattr nid */ | |
1584 | if (!prev_xnid) | |
1585 | goto recover_xnid; | |
1586 | ||
1587 | /* Deallocate node address */ | |
1588 | get_node_info(sbi, prev_xnid, &ni); | |
1589 | f2fs_bug_on(ni.blk_addr == NULL_ADDR); | |
1590 | invalidate_blocks(sbi, ni.blk_addr); | |
1591 | dec_valid_node_count(sbi, inode); | |
479f40c4 | 1592 | set_node_addr(sbi, &ni, NULL_ADDR, false); |
abb2366c JK |
1593 | |
1594 | recover_xnid: | |
1595 | /* 2: allocate new xattr nid */ | |
1596 | if (unlikely(!inc_valid_node_count(sbi, inode))) | |
1597 | f2fs_bug_on(1); | |
1598 | ||
1599 | remove_free_nid(NM_I(sbi), new_xnid); | |
1600 | get_node_info(sbi, new_xnid, &ni); | |
1601 | ni.ino = inode->i_ino; | |
479f40c4 | 1602 | set_node_addr(sbi, &ni, NEW_ADDR, false); |
abb2366c JK |
1603 | F2FS_I(inode)->i_xattr_nid = new_xnid; |
1604 | ||
1605 | /* 3: update xattr blkaddr */ | |
1606 | refresh_sit_entry(sbi, NEW_ADDR, blkaddr); | |
479f40c4 | 1607 | set_node_addr(sbi, &ni, blkaddr, false); |
abb2366c JK |
1608 | |
1609 | update_inode_page(inode); | |
1610 | return true; | |
1611 | } | |
1612 | ||
e05df3b1 JK |
1613 | int recover_inode_page(struct f2fs_sb_info *sbi, struct page *page) |
1614 | { | |
58bfaf44 | 1615 | struct f2fs_inode *src, *dst; |
e05df3b1 JK |
1616 | nid_t ino = ino_of_node(page); |
1617 | struct node_info old_ni, new_ni; | |
1618 | struct page *ipage; | |
1619 | ||
4ef51a8f | 1620 | ipage = grab_cache_page(NODE_MAPPING(sbi), ino); |
e05df3b1 JK |
1621 | if (!ipage) |
1622 | return -ENOMEM; | |
1623 | ||
1624 | /* Should not use this inode from free nid list */ | |
1625 | remove_free_nid(NM_I(sbi), ino); | |
1626 | ||
1627 | get_node_info(sbi, ino, &old_ni); | |
1628 | SetPageUptodate(ipage); | |
1629 | fill_node_footer(ipage, ino, ino, 0, true); | |
1630 | ||
58bfaf44 JK |
1631 | src = F2FS_INODE(page); |
1632 | dst = F2FS_INODE(ipage); | |
e05df3b1 | 1633 | |
58bfaf44 JK |
1634 | memcpy(dst, src, (unsigned long)&src->i_ext - (unsigned long)src); |
1635 | dst->i_size = 0; | |
1636 | dst->i_blocks = cpu_to_le64(1); | |
1637 | dst->i_links = cpu_to_le32(1); | |
1638 | dst->i_xattr_nid = 0; | |
e05df3b1 JK |
1639 | |
1640 | new_ni = old_ni; | |
1641 | new_ni.ino = ino; | |
1642 | ||
cfb271d4 | 1643 | if (unlikely(!inc_valid_node_count(sbi, NULL))) |
65e5cd0a | 1644 | WARN_ON(1); |
479f40c4 | 1645 | set_node_addr(sbi, &new_ni, NEW_ADDR, false); |
e05df3b1 | 1646 | inc_valid_inode_count(sbi); |
e05df3b1 JK |
1647 | f2fs_put_page(ipage, 1); |
1648 | return 0; | |
1649 | } | |
1650 | ||
9af0ff1c CY |
1651 | /* |
1652 | * ra_sum_pages() merge contiguous pages into one bio and submit. | |
1653 | * these pre-readed pages are linked in pages list. | |
1654 | */ | |
1655 | static int ra_sum_pages(struct f2fs_sb_info *sbi, struct list_head *pages, | |
1656 | int start, int nrpages) | |
1657 | { | |
1658 | struct page *page; | |
1659 | int page_idx = start; | |
458e6197 JK |
1660 | struct f2fs_io_info fio = { |
1661 | .type = META, | |
7e8f2308 | 1662 | .rw = READ_SYNC | REQ_META | REQ_PRIO |
458e6197 | 1663 | }; |
9af0ff1c CY |
1664 | |
1665 | for (; page_idx < start + nrpages; page_idx++) { | |
1666 | /* alloc temporal page for read node summary info*/ | |
a0acdfe0 | 1667 | page = alloc_page(GFP_F2FS_ZERO); |
d653788a GZ |
1668 | if (!page) |
1669 | break; | |
9af0ff1c CY |
1670 | |
1671 | lock_page(page); | |
1672 | page->index = page_idx; | |
1673 | list_add_tail(&page->lru, pages); | |
1674 | } | |
1675 | ||
1676 | list_for_each_entry(page, pages, lru) | |
458e6197 | 1677 | f2fs_submit_page_mbio(sbi, page, page->index, &fio); |
9af0ff1c | 1678 | |
458e6197 | 1679 | f2fs_submit_merged_bio(sbi, META, READ); |
d653788a GZ |
1680 | |
1681 | return page_idx - start; | |
9af0ff1c CY |
1682 | } |
1683 | ||
e05df3b1 JK |
1684 | int restore_node_summary(struct f2fs_sb_info *sbi, |
1685 | unsigned int segno, struct f2fs_summary_block *sum) | |
1686 | { | |
1687 | struct f2fs_node *rn; | |
1688 | struct f2fs_summary *sum_entry; | |
9af0ff1c | 1689 | struct page *page, *tmp; |
e05df3b1 | 1690 | block_t addr; |
9af0ff1c CY |
1691 | int bio_blocks = MAX_BIO_BLOCKS(max_hw_blocks(sbi)); |
1692 | int i, last_offset, nrpages, err = 0; | |
1693 | LIST_HEAD(page_list); | |
e05df3b1 JK |
1694 | |
1695 | /* scan the node segment */ | |
1696 | last_offset = sbi->blocks_per_seg; | |
1697 | addr = START_BLOCK(sbi, segno); | |
1698 | sum_entry = &sum->entries[0]; | |
1699 | ||
d653788a | 1700 | for (i = 0; !err && i < last_offset; i += nrpages, addr += nrpages) { |
9af0ff1c | 1701 | nrpages = min(last_offset - i, bio_blocks); |
393ff91f | 1702 | |
9af0ff1c | 1703 | /* read ahead node pages */ |
d653788a GZ |
1704 | nrpages = ra_sum_pages(sbi, &page_list, addr, nrpages); |
1705 | if (!nrpages) | |
1706 | return -ENOMEM; | |
e05df3b1 | 1707 | |
9af0ff1c | 1708 | list_for_each_entry_safe(page, tmp, &page_list, lru) { |
d653788a GZ |
1709 | if (err) |
1710 | goto skip; | |
9af0ff1c CY |
1711 | |
1712 | lock_page(page); | |
6bacf52f JK |
1713 | if (unlikely(!PageUptodate(page))) { |
1714 | err = -EIO; | |
1715 | } else { | |
9af0ff1c CY |
1716 | rn = F2FS_NODE(page); |
1717 | sum_entry->nid = rn->footer.nid; | |
1718 | sum_entry->version = 0; | |
1719 | sum_entry->ofs_in_node = 0; | |
1720 | sum_entry++; | |
9af0ff1c | 1721 | } |
9af0ff1c | 1722 | unlock_page(page); |
d653788a GZ |
1723 | skip: |
1724 | list_del(&page->lru); | |
9af0ff1c CY |
1725 | __free_pages(page, 0); |
1726 | } | |
e05df3b1 | 1727 | } |
9af0ff1c | 1728 | return err; |
e05df3b1 JK |
1729 | } |
1730 | ||
1731 | static bool flush_nats_in_journal(struct f2fs_sb_info *sbi) | |
1732 | { | |
1733 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
1734 | struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); | |
1735 | struct f2fs_summary_block *sum = curseg->sum_blk; | |
1736 | int i; | |
1737 | ||
1738 | mutex_lock(&curseg->curseg_mutex); | |
1739 | ||
1740 | if (nats_in_cursum(sum) < NAT_JOURNAL_ENTRIES) { | |
1741 | mutex_unlock(&curseg->curseg_mutex); | |
1742 | return false; | |
1743 | } | |
1744 | ||
1745 | for (i = 0; i < nats_in_cursum(sum); i++) { | |
1746 | struct nat_entry *ne; | |
1747 | struct f2fs_nat_entry raw_ne; | |
1748 | nid_t nid = le32_to_cpu(nid_in_journal(sum, i)); | |
1749 | ||
1750 | raw_ne = nat_in_journal(sum, i); | |
1751 | retry: | |
1752 | write_lock(&nm_i->nat_tree_lock); | |
1753 | ne = __lookup_nat_cache(nm_i, nid); | |
1754 | if (ne) { | |
1755 | __set_nat_cache_dirty(nm_i, ne); | |
1756 | write_unlock(&nm_i->nat_tree_lock); | |
1757 | continue; | |
1758 | } | |
1759 | ne = grab_nat_entry(nm_i, nid); | |
1760 | if (!ne) { | |
1761 | write_unlock(&nm_i->nat_tree_lock); | |
1762 | goto retry; | |
1763 | } | |
1764 | nat_set_blkaddr(ne, le32_to_cpu(raw_ne.block_addr)); | |
1765 | nat_set_ino(ne, le32_to_cpu(raw_ne.ino)); | |
1766 | nat_set_version(ne, raw_ne.version); | |
1767 | __set_nat_cache_dirty(nm_i, ne); | |
1768 | write_unlock(&nm_i->nat_tree_lock); | |
1769 | } | |
1770 | update_nats_in_cursum(sum, -i); | |
1771 | mutex_unlock(&curseg->curseg_mutex); | |
1772 | return true; | |
1773 | } | |
1774 | ||
0a8165d7 | 1775 | /* |
e05df3b1 JK |
1776 | * This function is called during the checkpointing process. |
1777 | */ | |
1778 | void flush_nat_entries(struct f2fs_sb_info *sbi) | |
1779 | { | |
1780 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
1781 | struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); | |
1782 | struct f2fs_summary_block *sum = curseg->sum_blk; | |
1783 | struct list_head *cur, *n; | |
1784 | struct page *page = NULL; | |
1785 | struct f2fs_nat_block *nat_blk = NULL; | |
1786 | nid_t start_nid = 0, end_nid = 0; | |
1787 | bool flushed; | |
1788 | ||
1789 | flushed = flush_nats_in_journal(sbi); | |
1790 | ||
1791 | if (!flushed) | |
1792 | mutex_lock(&curseg->curseg_mutex); | |
1793 | ||
1794 | /* 1) flush dirty nat caches */ | |
1795 | list_for_each_safe(cur, n, &nm_i->dirty_nat_entries) { | |
1796 | struct nat_entry *ne; | |
1797 | nid_t nid; | |
1798 | struct f2fs_nat_entry raw_ne; | |
1799 | int offset = -1; | |
2b50638d | 1800 | block_t new_blkaddr; |
e05df3b1 JK |
1801 | |
1802 | ne = list_entry(cur, struct nat_entry, list); | |
1803 | nid = nat_get_nid(ne); | |
1804 | ||
1805 | if (nat_get_blkaddr(ne) == NEW_ADDR) | |
1806 | continue; | |
1807 | if (flushed) | |
1808 | goto to_nat_page; | |
1809 | ||
1810 | /* if there is room for nat enries in curseg->sumpage */ | |
1811 | offset = lookup_journal_in_cursum(sum, NAT_JOURNAL, nid, 1); | |
1812 | if (offset >= 0) { | |
1813 | raw_ne = nat_in_journal(sum, offset); | |
e05df3b1 JK |
1814 | goto flush_now; |
1815 | } | |
1816 | to_nat_page: | |
1817 | if (!page || (start_nid > nid || nid > end_nid)) { | |
1818 | if (page) { | |
1819 | f2fs_put_page(page, 1); | |
1820 | page = NULL; | |
1821 | } | |
1822 | start_nid = START_NID(nid); | |
1823 | end_nid = start_nid + NAT_ENTRY_PER_BLOCK - 1; | |
1824 | ||
1825 | /* | |
1826 | * get nat block with dirty flag, increased reference | |
1827 | * count, mapped and lock | |
1828 | */ | |
1829 | page = get_next_nat_page(sbi, start_nid); | |
1830 | nat_blk = page_address(page); | |
1831 | } | |
1832 | ||
5d56b671 | 1833 | f2fs_bug_on(!nat_blk); |
e05df3b1 | 1834 | raw_ne = nat_blk->entries[nid - start_nid]; |
e05df3b1 JK |
1835 | flush_now: |
1836 | new_blkaddr = nat_get_blkaddr(ne); | |
1837 | ||
1838 | raw_ne.ino = cpu_to_le32(nat_get_ino(ne)); | |
1839 | raw_ne.block_addr = cpu_to_le32(new_blkaddr); | |
1840 | raw_ne.version = nat_get_version(ne); | |
1841 | ||
1842 | if (offset < 0) { | |
1843 | nat_blk->entries[nid - start_nid] = raw_ne; | |
1844 | } else { | |
1845 | nat_in_journal(sum, offset) = raw_ne; | |
1846 | nid_in_journal(sum, offset) = cpu_to_le32(nid); | |
1847 | } | |
1848 | ||
fa372417 | 1849 | if (nat_get_blkaddr(ne) == NULL_ADDR && |
59bbd474 | 1850 | add_free_nid(NM_I(sbi), nid, false) <= 0) { |
e05df3b1 JK |
1851 | write_lock(&nm_i->nat_tree_lock); |
1852 | __del_from_nat_cache(nm_i, ne); | |
1853 | write_unlock(&nm_i->nat_tree_lock); | |
e05df3b1 JK |
1854 | } else { |
1855 | write_lock(&nm_i->nat_tree_lock); | |
1856 | __clear_nat_cache_dirty(nm_i, ne); | |
e05df3b1 JK |
1857 | write_unlock(&nm_i->nat_tree_lock); |
1858 | } | |
1859 | } | |
1860 | if (!flushed) | |
1861 | mutex_unlock(&curseg->curseg_mutex); | |
1862 | f2fs_put_page(page, 1); | |
e05df3b1 JK |
1863 | } |
1864 | ||
1865 | static int init_node_manager(struct f2fs_sb_info *sbi) | |
1866 | { | |
1867 | struct f2fs_super_block *sb_raw = F2FS_RAW_SUPER(sbi); | |
1868 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
1869 | unsigned char *version_bitmap; | |
1870 | unsigned int nat_segs, nat_blocks; | |
1871 | ||
1872 | nm_i->nat_blkaddr = le32_to_cpu(sb_raw->nat_blkaddr); | |
1873 | ||
1874 | /* segment_count_nat includes pair segment so divide to 2. */ | |
1875 | nat_segs = le32_to_cpu(sb_raw->segment_count_nat) >> 1; | |
1876 | nat_blocks = nat_segs << le32_to_cpu(sb_raw->log_blocks_per_seg); | |
b63da15e JK |
1877 | |
1878 | /* not used nids: 0, node, meta, (and root counted as valid node) */ | |
1879 | nm_i->max_nid = NAT_ENTRY_PER_BLOCK * nat_blocks - 3; | |
e05df3b1 JK |
1880 | nm_i->fcnt = 0; |
1881 | nm_i->nat_cnt = 0; | |
cdfc41c1 | 1882 | nm_i->ram_thresh = DEF_RAM_THRESHOLD; |
e05df3b1 | 1883 | |
8a7ed66a | 1884 | INIT_RADIX_TREE(&nm_i->free_nid_root, GFP_ATOMIC); |
e05df3b1 JK |
1885 | INIT_LIST_HEAD(&nm_i->free_nid_list); |
1886 | INIT_RADIX_TREE(&nm_i->nat_root, GFP_ATOMIC); | |
1887 | INIT_LIST_HEAD(&nm_i->nat_entries); | |
1888 | INIT_LIST_HEAD(&nm_i->dirty_nat_entries); | |
1889 | ||
1890 | mutex_init(&nm_i->build_lock); | |
1891 | spin_lock_init(&nm_i->free_nid_list_lock); | |
1892 | rwlock_init(&nm_i->nat_tree_lock); | |
1893 | ||
e05df3b1 | 1894 | nm_i->next_scan_nid = le32_to_cpu(sbi->ckpt->next_free_nid); |
79b5793b | 1895 | nm_i->bitmap_size = __bitmap_size(sbi, NAT_BITMAP); |
e05df3b1 JK |
1896 | version_bitmap = __bitmap_ptr(sbi, NAT_BITMAP); |
1897 | if (!version_bitmap) | |
1898 | return -EFAULT; | |
1899 | ||
79b5793b AG |
1900 | nm_i->nat_bitmap = kmemdup(version_bitmap, nm_i->bitmap_size, |
1901 | GFP_KERNEL); | |
1902 | if (!nm_i->nat_bitmap) | |
1903 | return -ENOMEM; | |
e05df3b1 JK |
1904 | return 0; |
1905 | } | |
1906 | ||
1907 | int build_node_manager(struct f2fs_sb_info *sbi) | |
1908 | { | |
1909 | int err; | |
1910 | ||
1911 | sbi->nm_info = kzalloc(sizeof(struct f2fs_nm_info), GFP_KERNEL); | |
1912 | if (!sbi->nm_info) | |
1913 | return -ENOMEM; | |
1914 | ||
1915 | err = init_node_manager(sbi); | |
1916 | if (err) | |
1917 | return err; | |
1918 | ||
1919 | build_free_nids(sbi); | |
1920 | return 0; | |
1921 | } | |
1922 | ||
1923 | void destroy_node_manager(struct f2fs_sb_info *sbi) | |
1924 | { | |
1925 | struct f2fs_nm_info *nm_i = NM_I(sbi); | |
1926 | struct free_nid *i, *next_i; | |
1927 | struct nat_entry *natvec[NATVEC_SIZE]; | |
1928 | nid_t nid = 0; | |
1929 | unsigned int found; | |
1930 | ||
1931 | if (!nm_i) | |
1932 | return; | |
1933 | ||
1934 | /* destroy free nid list */ | |
1935 | spin_lock(&nm_i->free_nid_list_lock); | |
1936 | list_for_each_entry_safe(i, next_i, &nm_i->free_nid_list, list) { | |
5d56b671 | 1937 | f2fs_bug_on(i->state == NID_ALLOC); |
8a7ed66a | 1938 | __del_from_free_nid_list(nm_i, i); |
e05df3b1 | 1939 | nm_i->fcnt--; |
cf0ee0f0 CY |
1940 | spin_unlock(&nm_i->free_nid_list_lock); |
1941 | kmem_cache_free(free_nid_slab, i); | |
1942 | spin_lock(&nm_i->free_nid_list_lock); | |
e05df3b1 | 1943 | } |
5d56b671 | 1944 | f2fs_bug_on(nm_i->fcnt); |
e05df3b1 JK |
1945 | spin_unlock(&nm_i->free_nid_list_lock); |
1946 | ||
1947 | /* destroy nat cache */ | |
1948 | write_lock(&nm_i->nat_tree_lock); | |
1949 | while ((found = __gang_lookup_nat_cache(nm_i, | |
1950 | nid, NATVEC_SIZE, natvec))) { | |
1951 | unsigned idx; | |
b6ce391e GZ |
1952 | nid = nat_get_nid(natvec[found - 1]) + 1; |
1953 | for (idx = 0; idx < found; idx++) | |
1954 | __del_from_nat_cache(nm_i, natvec[idx]); | |
e05df3b1 | 1955 | } |
5d56b671 | 1956 | f2fs_bug_on(nm_i->nat_cnt); |
e05df3b1 JK |
1957 | write_unlock(&nm_i->nat_tree_lock); |
1958 | ||
1959 | kfree(nm_i->nat_bitmap); | |
1960 | sbi->nm_info = NULL; | |
1961 | kfree(nm_i); | |
1962 | } | |
1963 | ||
6e6093a8 | 1964 | int __init create_node_manager_caches(void) |
e05df3b1 JK |
1965 | { |
1966 | nat_entry_slab = f2fs_kmem_cache_create("nat_entry", | |
e8512d2e | 1967 | sizeof(struct nat_entry)); |
e05df3b1 JK |
1968 | if (!nat_entry_slab) |
1969 | return -ENOMEM; | |
1970 | ||
1971 | free_nid_slab = f2fs_kmem_cache_create("free_nid", | |
e8512d2e | 1972 | sizeof(struct free_nid)); |
e05df3b1 JK |
1973 | if (!free_nid_slab) { |
1974 | kmem_cache_destroy(nat_entry_slab); | |
1975 | return -ENOMEM; | |
1976 | } | |
1977 | return 0; | |
1978 | } | |
1979 | ||
1980 | void destroy_node_manager_caches(void) | |
1981 | { | |
1982 | kmem_cache_destroy(free_nid_slab); | |
1983 | kmem_cache_destroy(nat_entry_slab); | |
1984 | } |