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