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