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