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