Commit | Line | Data |
---|---|---|
a28ef1f5 CY |
1 | /* |
2 | * f2fs extent cache support | |
3 | * | |
4 | * Copyright (c) 2015 Motorola Mobility | |
5 | * Copyright (c) 2015 Samsung Electronics | |
6 | * Authors: Jaegeuk Kim <jaegeuk@kernel.org> | |
7 | * Chao Yu <chao2.yu@samsung.com> | |
8 | * | |
9 | * This program is free software; you can redistribute it and/or modify | |
10 | * it under the terms of the GNU General Public License version 2 as | |
11 | * published by the Free Software Foundation. | |
12 | */ | |
13 | ||
14 | #include <linux/fs.h> | |
15 | #include <linux/f2fs_fs.h> | |
16 | ||
17 | #include "f2fs.h" | |
18 | #include "node.h" | |
19 | #include <trace/events/f2fs.h> | |
20 | ||
21 | static struct kmem_cache *extent_tree_slab; | |
22 | static struct kmem_cache *extent_node_slab; | |
23 | ||
24 | static struct extent_node *__attach_extent_node(struct f2fs_sb_info *sbi, | |
25 | struct extent_tree *et, struct extent_info *ei, | |
26 | struct rb_node *parent, struct rb_node **p) | |
27 | { | |
28 | struct extent_node *en; | |
29 | ||
30 | en = kmem_cache_alloc(extent_node_slab, GFP_ATOMIC); | |
31 | if (!en) | |
32 | return NULL; | |
33 | ||
34 | en->ei = *ei; | |
35 | INIT_LIST_HEAD(&en->list); | |
36 | ||
37 | rb_link_node(&en->rb_node, parent, p); | |
38 | rb_insert_color(&en->rb_node, &et->root); | |
68e35385 | 39 | atomic_inc(&et->node_cnt); |
a28ef1f5 CY |
40 | atomic_inc(&sbi->total_ext_node); |
41 | return en; | |
42 | } | |
43 | ||
44 | static void __detach_extent_node(struct f2fs_sb_info *sbi, | |
45 | struct extent_tree *et, struct extent_node *en) | |
46 | { | |
47 | rb_erase(&en->rb_node, &et->root); | |
68e35385 | 48 | atomic_dec(&et->node_cnt); |
a28ef1f5 CY |
49 | atomic_dec(&sbi->total_ext_node); |
50 | ||
51 | if (et->cached_en == en) | |
52 | et->cached_en = NULL; | |
a03f01f2 HP |
53 | kmem_cache_free(extent_node_slab, en); |
54 | } | |
55 | ||
56 | /* | |
57 | * Flow to release an extent_node: | |
58 | * 1. list_del_init | |
59 | * 2. __detach_extent_node | |
60 | * 3. kmem_cache_free. | |
61 | */ | |
62 | static void __release_extent_node(struct f2fs_sb_info *sbi, | |
63 | struct extent_tree *et, struct extent_node *en) | |
64 | { | |
65 | spin_lock(&sbi->extent_lock); | |
66 | if (!list_empty(&en->list)) | |
67 | list_del_init(&en->list); | |
68 | spin_unlock(&sbi->extent_lock); | |
69 | ||
70 | __detach_extent_node(sbi, et, en); | |
a28ef1f5 CY |
71 | } |
72 | ||
73 | static struct extent_tree *__grab_extent_tree(struct inode *inode) | |
74 | { | |
75 | struct f2fs_sb_info *sbi = F2FS_I_SB(inode); | |
76 | struct extent_tree *et; | |
77 | nid_t ino = inode->i_ino; | |
78 | ||
79 | down_write(&sbi->extent_tree_lock); | |
80 | et = radix_tree_lookup(&sbi->extent_tree_root, ino); | |
81 | if (!et) { | |
82 | et = f2fs_kmem_cache_alloc(extent_tree_slab, GFP_NOFS); | |
83 | f2fs_radix_tree_insert(&sbi->extent_tree_root, ino, et); | |
84 | memset(et, 0, sizeof(struct extent_tree)); | |
85 | et->ino = ino; | |
86 | et->root = RB_ROOT; | |
87 | et->cached_en = NULL; | |
88 | rwlock_init(&et->lock); | |
137d09f0 | 89 | INIT_LIST_HEAD(&et->list); |
68e35385 | 90 | atomic_set(&et->node_cnt, 0); |
7441ccef | 91 | atomic_inc(&sbi->total_ext_tree); |
74fd8d99 JK |
92 | } else { |
93 | atomic_dec(&sbi->total_zombie_tree); | |
137d09f0 | 94 | list_del_init(&et->list); |
a28ef1f5 | 95 | } |
a28ef1f5 CY |
96 | up_write(&sbi->extent_tree_lock); |
97 | ||
98 | /* never died until evict_inode */ | |
99 | F2FS_I(inode)->extent_tree = et; | |
100 | ||
101 | return et; | |
102 | } | |
103 | ||
91c481ff CY |
104 | static struct extent_node *__lookup_extent_tree(struct f2fs_sb_info *sbi, |
105 | struct extent_tree *et, unsigned int fofs) | |
a28ef1f5 CY |
106 | { |
107 | struct rb_node *node = et->root.rb_node; | |
f8b703da | 108 | struct extent_node *en = et->cached_en; |
a28ef1f5 | 109 | |
f8b703da FL |
110 | if (en) { |
111 | struct extent_info *cei = &en->ei; | |
a28ef1f5 | 112 | |
91c481ff CY |
113 | if (cei->fofs <= fofs && cei->fofs + cei->len > fofs) { |
114 | stat_inc_cached_node_hit(sbi); | |
f8b703da | 115 | return en; |
91c481ff | 116 | } |
a28ef1f5 CY |
117 | } |
118 | ||
119 | while (node) { | |
120 | en = rb_entry(node, struct extent_node, rb_node); | |
121 | ||
029e13cc | 122 | if (fofs < en->ei.fofs) { |
a28ef1f5 | 123 | node = node->rb_left; |
029e13cc | 124 | } else if (fofs >= en->ei.fofs + en->ei.len) { |
a28ef1f5 | 125 | node = node->rb_right; |
029e13cc CY |
126 | } else { |
127 | stat_inc_rbtree_node_hit(sbi); | |
a28ef1f5 | 128 | return en; |
029e13cc | 129 | } |
a28ef1f5 CY |
130 | } |
131 | return NULL; | |
132 | } | |
133 | ||
a6f78345 CY |
134 | static struct extent_node *__init_extent_tree(struct f2fs_sb_info *sbi, |
135 | struct extent_tree *et, struct extent_info *ei) | |
a28ef1f5 CY |
136 | { |
137 | struct rb_node **p = &et->root.rb_node; | |
a28ef1f5 CY |
138 | struct extent_node *en; |
139 | ||
a6f78345 | 140 | en = __attach_extent_node(sbi, et, ei, NULL, p); |
a28ef1f5 CY |
141 | if (!en) |
142 | return NULL; | |
a6f78345 CY |
143 | |
144 | et->largest = en->ei; | |
a28ef1f5 CY |
145 | et->cached_en = en; |
146 | return en; | |
147 | } | |
148 | ||
149 | static unsigned int __free_extent_tree(struct f2fs_sb_info *sbi, | |
150 | struct extent_tree *et, bool free_all) | |
151 | { | |
152 | struct rb_node *node, *next; | |
153 | struct extent_node *en; | |
68e35385 | 154 | unsigned int count = atomic_read(&et->node_cnt); |
a28ef1f5 CY |
155 | |
156 | node = rb_first(&et->root); | |
157 | while (node) { | |
158 | next = rb_next(node); | |
159 | en = rb_entry(node, struct extent_node, rb_node); | |
160 | ||
a03f01f2 HP |
161 | if (free_all) |
162 | __release_extent_node(sbi, et, en); | |
163 | else if (list_empty(&en->list)) | |
a28ef1f5 | 164 | __detach_extent_node(sbi, et, en); |
a28ef1f5 CY |
165 | node = next; |
166 | } | |
167 | ||
68e35385 | 168 | return count - atomic_read(&et->node_cnt); |
a28ef1f5 CY |
169 | } |
170 | ||
41a099de FL |
171 | static void __drop_largest_extent(struct inode *inode, |
172 | pgoff_t fofs, unsigned int len) | |
a28ef1f5 CY |
173 | { |
174 | struct extent_info *largest = &F2FS_I(inode)->extent_tree->largest; | |
175 | ||
41a099de | 176 | if (fofs < largest->fofs + largest->len && fofs + len > largest->fofs) |
a28ef1f5 CY |
177 | largest->len = 0; |
178 | } | |
179 | ||
ed3d1256 JK |
180 | /* return true, if inode page is changed */ |
181 | bool f2fs_init_extent_tree(struct inode *inode, struct f2fs_extent *i_ext) | |
a28ef1f5 CY |
182 | { |
183 | struct f2fs_sb_info *sbi = F2FS_I_SB(inode); | |
184 | struct extent_tree *et; | |
185 | struct extent_node *en; | |
186 | struct extent_info ei; | |
187 | ||
ed3d1256 JK |
188 | if (!f2fs_may_extent_tree(inode)) { |
189 | /* drop largest extent */ | |
190 | if (i_ext && i_ext->len) { | |
191 | i_ext->len = 0; | |
192 | return true; | |
193 | } | |
194 | return false; | |
195 | } | |
a28ef1f5 CY |
196 | |
197 | et = __grab_extent_tree(inode); | |
198 | ||
ed3d1256 JK |
199 | if (!i_ext || !i_ext->len) |
200 | return false; | |
a28ef1f5 CY |
201 | |
202 | set_extent_info(&ei, le32_to_cpu(i_ext->fofs), | |
203 | le32_to_cpu(i_ext->blk), le32_to_cpu(i_ext->len)); | |
204 | ||
205 | write_lock(&et->lock); | |
68e35385 | 206 | if (atomic_read(&et->node_cnt)) |
a28ef1f5 CY |
207 | goto out; |
208 | ||
a6f78345 | 209 | en = __init_extent_tree(sbi, et, &ei); |
a28ef1f5 CY |
210 | if (en) { |
211 | spin_lock(&sbi->extent_lock); | |
212 | list_add_tail(&en->list, &sbi->extent_list); | |
213 | spin_unlock(&sbi->extent_lock); | |
214 | } | |
215 | out: | |
216 | write_unlock(&et->lock); | |
ed3d1256 | 217 | return false; |
a28ef1f5 CY |
218 | } |
219 | ||
220 | static bool f2fs_lookup_extent_tree(struct inode *inode, pgoff_t pgofs, | |
221 | struct extent_info *ei) | |
222 | { | |
223 | struct f2fs_sb_info *sbi = F2FS_I_SB(inode); | |
224 | struct extent_tree *et = F2FS_I(inode)->extent_tree; | |
225 | struct extent_node *en; | |
226 | bool ret = false; | |
227 | ||
228 | f2fs_bug_on(sbi, !et); | |
229 | ||
230 | trace_f2fs_lookup_extent_tree_start(inode, pgofs); | |
231 | ||
232 | read_lock(&et->lock); | |
233 | ||
234 | if (et->largest.fofs <= pgofs && | |
235 | et->largest.fofs + et->largest.len > pgofs) { | |
236 | *ei = et->largest; | |
237 | ret = true; | |
91c481ff | 238 | stat_inc_largest_node_hit(sbi); |
a28ef1f5 CY |
239 | goto out; |
240 | } | |
241 | ||
91c481ff | 242 | en = __lookup_extent_tree(sbi, et, pgofs); |
a28ef1f5 CY |
243 | if (en) { |
244 | *ei = en->ei; | |
245 | spin_lock(&sbi->extent_lock); | |
246 | if (!list_empty(&en->list)) | |
247 | list_move_tail(&en->list, &sbi->extent_list); | |
248 | et->cached_en = en; | |
249 | spin_unlock(&sbi->extent_lock); | |
250 | ret = true; | |
a28ef1f5 CY |
251 | } |
252 | out: | |
727edac5 | 253 | stat_inc_total_hit(sbi); |
a28ef1f5 CY |
254 | read_unlock(&et->lock); |
255 | ||
256 | trace_f2fs_lookup_extent_tree_end(inode, pgofs, ei); | |
257 | return ret; | |
258 | } | |
259 | ||
0f825ee6 FL |
260 | |
261 | /* | |
262 | * lookup extent at @fofs, if hit, return the extent | |
263 | * if not, return NULL and | |
264 | * @prev_ex: extent before fofs | |
265 | * @next_ex: extent after fofs | |
266 | * @insert_p: insert point for new extent at fofs | |
267 | * in order to simpfy the insertion after. | |
268 | * tree must stay unchanged between lookup and insertion. | |
269 | */ | |
270 | static struct extent_node *__lookup_extent_tree_ret(struct extent_tree *et, | |
91c481ff CY |
271 | unsigned int fofs, |
272 | struct extent_node **prev_ex, | |
0f825ee6 FL |
273 | struct extent_node **next_ex, |
274 | struct rb_node ***insert_p, | |
275 | struct rb_node **insert_parent) | |
276 | { | |
277 | struct rb_node **pnode = &et->root.rb_node; | |
278 | struct rb_node *parent = NULL, *tmp_node; | |
dac2ddef | 279 | struct extent_node *en = et->cached_en; |
0f825ee6 | 280 | |
dac2ddef CY |
281 | *insert_p = NULL; |
282 | *insert_parent = NULL; | |
283 | *prev_ex = NULL; | |
284 | *next_ex = NULL; | |
285 | ||
286 | if (RB_EMPTY_ROOT(&et->root)) | |
287 | return NULL; | |
288 | ||
289 | if (en) { | |
290 | struct extent_info *cei = &en->ei; | |
0f825ee6 FL |
291 | |
292 | if (cei->fofs <= fofs && cei->fofs + cei->len > fofs) | |
dac2ddef | 293 | goto lookup_neighbors; |
0f825ee6 FL |
294 | } |
295 | ||
296 | while (*pnode) { | |
297 | parent = *pnode; | |
298 | en = rb_entry(*pnode, struct extent_node, rb_node); | |
299 | ||
300 | if (fofs < en->ei.fofs) | |
301 | pnode = &(*pnode)->rb_left; | |
302 | else if (fofs >= en->ei.fofs + en->ei.len) | |
303 | pnode = &(*pnode)->rb_right; | |
304 | else | |
dac2ddef | 305 | goto lookup_neighbors; |
0f825ee6 FL |
306 | } |
307 | ||
308 | *insert_p = pnode; | |
309 | *insert_parent = parent; | |
310 | ||
311 | en = rb_entry(parent, struct extent_node, rb_node); | |
312 | tmp_node = parent; | |
313 | if (parent && fofs > en->ei.fofs) | |
314 | tmp_node = rb_next(parent); | |
315 | *next_ex = tmp_node ? | |
316 | rb_entry(tmp_node, struct extent_node, rb_node) : NULL; | |
317 | ||
318 | tmp_node = parent; | |
319 | if (parent && fofs < en->ei.fofs) | |
320 | tmp_node = rb_prev(parent); | |
321 | *prev_ex = tmp_node ? | |
322 | rb_entry(tmp_node, struct extent_node, rb_node) : NULL; | |
0f825ee6 | 323 | return NULL; |
dac2ddef CY |
324 | |
325 | lookup_neighbors: | |
326 | if (fofs == en->ei.fofs) { | |
327 | /* lookup prev node for merging backward later */ | |
328 | tmp_node = rb_prev(&en->rb_node); | |
329 | *prev_ex = tmp_node ? | |
330 | rb_entry(tmp_node, struct extent_node, rb_node) : NULL; | |
331 | } | |
332 | if (fofs == en->ei.fofs + en->ei.len - 1) { | |
333 | /* lookup next node for merging frontward later */ | |
334 | tmp_node = rb_next(&en->rb_node); | |
335 | *next_ex = tmp_node ? | |
336 | rb_entry(tmp_node, struct extent_node, rb_node) : NULL; | |
337 | } | |
338 | return en; | |
0f825ee6 FL |
339 | } |
340 | ||
ef05e221 | 341 | static struct extent_node *__try_merge_extent_node(struct f2fs_sb_info *sbi, |
0f825ee6 | 342 | struct extent_tree *et, struct extent_info *ei, |
0f825ee6 | 343 | struct extent_node *prev_ex, |
ef05e221 | 344 | struct extent_node *next_ex) |
0f825ee6 | 345 | { |
0f825ee6 | 346 | struct extent_node *en = NULL; |
0f825ee6 FL |
347 | |
348 | if (prev_ex && __is_back_mergeable(ei, &prev_ex->ei)) { | |
0f825ee6 FL |
349 | prev_ex->ei.len += ei->len; |
350 | ei = &prev_ex->ei; | |
351 | en = prev_ex; | |
352 | } | |
ef05e221 | 353 | |
0f825ee6 | 354 | if (next_ex && __is_front_mergeable(ei, &next_ex->ei)) { |
a03f01f2 HP |
355 | if (en) |
356 | __release_extent_node(sbi, et, prev_ex); | |
0f825ee6 FL |
357 | next_ex->ei.fofs = ei->fofs; |
358 | next_ex->ei.blk = ei->blk; | |
359 | next_ex->ei.len += ei->len; | |
360 | en = next_ex; | |
361 | } | |
ef05e221 CY |
362 | |
363 | if (en) { | |
4abd3f5a | 364 | __try_update_largest_extent(et, en); |
ef05e221 CY |
365 | et->cached_en = en; |
366 | } | |
367 | return en; | |
368 | } | |
369 | ||
370 | static struct extent_node *__insert_extent_tree(struct f2fs_sb_info *sbi, | |
371 | struct extent_tree *et, struct extent_info *ei, | |
372 | struct rb_node **insert_p, | |
373 | struct rb_node *insert_parent) | |
374 | { | |
375 | struct rb_node **p = &et->root.rb_node; | |
376 | struct rb_node *parent = NULL; | |
377 | struct extent_node *en = NULL; | |
0f825ee6 FL |
378 | |
379 | if (insert_p && insert_parent) { | |
380 | parent = insert_parent; | |
381 | p = insert_p; | |
382 | goto do_insert; | |
383 | } | |
384 | ||
385 | while (*p) { | |
386 | parent = *p; | |
387 | en = rb_entry(parent, struct extent_node, rb_node); | |
388 | ||
389 | if (ei->fofs < en->ei.fofs) | |
390 | p = &(*p)->rb_left; | |
391 | else if (ei->fofs >= en->ei.fofs + en->ei.len) | |
392 | p = &(*p)->rb_right; | |
393 | else | |
394 | f2fs_bug_on(sbi, 1); | |
395 | } | |
396 | do_insert: | |
397 | en = __attach_extent_node(sbi, et, ei, parent, p); | |
398 | if (!en) | |
399 | return NULL; | |
ef05e221 | 400 | |
4abd3f5a | 401 | __try_update_largest_extent(et, en); |
0f825ee6 FL |
402 | et->cached_en = en; |
403 | return en; | |
404 | } | |
405 | ||
514053e4 | 406 | static unsigned int f2fs_update_extent_tree_range(struct inode *inode, |
19b2c30d | 407 | pgoff_t fofs, block_t blkaddr, unsigned int len) |
a28ef1f5 CY |
408 | { |
409 | struct f2fs_sb_info *sbi = F2FS_I_SB(inode); | |
410 | struct extent_tree *et = F2FS_I(inode)->extent_tree; | |
4d1fa815 | 411 | struct extent_node *en = NULL, *en1 = NULL; |
19b2c30d | 412 | struct extent_node *prev_en = NULL, *next_en = NULL; |
a28ef1f5 | 413 | struct extent_info ei, dei, prev; |
0f825ee6 | 414 | struct rb_node **insert_p = NULL, *insert_parent = NULL; |
19b2c30d CY |
415 | unsigned int end = fofs + len; |
416 | unsigned int pos = (unsigned int)fofs; | |
a28ef1f5 CY |
417 | |
418 | if (!et) | |
419 | return false; | |
420 | ||
744288c7 CY |
421 | trace_f2fs_update_extent_tree_range(inode, fofs, blkaddr, len); |
422 | ||
a28ef1f5 CY |
423 | write_lock(&et->lock); |
424 | ||
425 | if (is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT)) { | |
426 | write_unlock(&et->lock); | |
427 | return false; | |
428 | } | |
429 | ||
430 | prev = et->largest; | |
431 | dei.len = 0; | |
432 | ||
4d1fa815 FL |
433 | /* |
434 | * drop largest extent before lookup, in case it's already | |
435 | * been shrunk from extent tree | |
436 | */ | |
41a099de | 437 | __drop_largest_extent(inode, fofs, len); |
a28ef1f5 | 438 | |
19b2c30d CY |
439 | /* 1. lookup first extent node in range [fofs, fofs + len - 1] */ |
440 | en = __lookup_extent_tree_ret(et, fofs, &prev_en, &next_en, | |
0f825ee6 | 441 | &insert_p, &insert_parent); |
4d1fa815 FL |
442 | if (!en) |
443 | en = next_en; | |
19b2c30d CY |
444 | |
445 | /* 2. invlidate all extent nodes in range [fofs, fofs + len - 1] */ | |
4d1fa815 FL |
446 | while (en && en->ei.fofs < end) { |
447 | unsigned int org_end; | |
448 | int parts = 0; /* # of parts current extent split into */ | |
19b2c30d | 449 | |
4d1fa815 | 450 | next_en = en1 = NULL; |
19b2c30d CY |
451 | |
452 | dei = en->ei; | |
4d1fa815 FL |
453 | org_end = dei.fofs + dei.len; |
454 | f2fs_bug_on(sbi, pos >= org_end); | |
19b2c30d | 455 | |
4d1fa815 FL |
456 | if (pos > dei.fofs && pos - dei.fofs >= F2FS_MIN_EXTENT_LEN) { |
457 | en->ei.len = pos - en->ei.fofs; | |
458 | prev_en = en; | |
459 | parts = 1; | |
460 | } | |
19b2c30d | 461 | |
4d1fa815 FL |
462 | if (end < org_end && org_end - end >= F2FS_MIN_EXTENT_LEN) { |
463 | if (parts) { | |
464 | set_extent_info(&ei, end, | |
465 | end - dei.fofs + dei.blk, | |
466 | org_end - end); | |
467 | en1 = __insert_extent_tree(sbi, et, &ei, | |
468 | NULL, NULL); | |
469 | next_en = en1; | |
470 | } else { | |
471 | en->ei.fofs = end; | |
472 | en->ei.blk += end - dei.fofs; | |
473 | en->ei.len -= end - dei.fofs; | |
474 | next_en = en; | |
19b2c30d | 475 | } |
4d1fa815 | 476 | parts++; |
19b2c30d CY |
477 | } |
478 | ||
4d1fa815 FL |
479 | if (!next_en) { |
480 | struct rb_node *node = rb_next(&en->rb_node); | |
19b2c30d | 481 | |
4d1fa815 FL |
482 | next_en = node ? |
483 | rb_entry(node, struct extent_node, rb_node) | |
484 | : NULL; | |
a28ef1f5 CY |
485 | } |
486 | ||
4abd3f5a CY |
487 | if (parts) |
488 | __try_update_largest_extent(et, en); | |
489 | else | |
a03f01f2 | 490 | __release_extent_node(sbi, et, en); |
19b2c30d CY |
491 | |
492 | /* | |
4d1fa815 FL |
493 | * if original extent is split into zero or two parts, extent |
494 | * tree has been altered by deletion or insertion, therefore | |
495 | * invalidate pointers regard to tree. | |
19b2c30d | 496 | */ |
4d1fa815 FL |
497 | if (parts != 1) { |
498 | insert_p = NULL; | |
499 | insert_parent = NULL; | |
a28ef1f5 | 500 | } |
4d1fa815 FL |
501 | |
502 | /* update in global extent list */ | |
19b2c30d | 503 | spin_lock(&sbi->extent_lock); |
19b2c30d CY |
504 | if (en1) |
505 | list_add_tail(&en1->list, &sbi->extent_list); | |
19b2c30d CY |
506 | spin_unlock(&sbi->extent_lock); |
507 | ||
4d1fa815 | 508 | en = next_en; |
a28ef1f5 CY |
509 | } |
510 | ||
a28ef1f5 CY |
511 | /* 3. update extent in extent cache */ |
512 | if (blkaddr) { | |
19b2c30d CY |
513 | |
514 | set_extent_info(&ei, fofs, blkaddr, len); | |
a03f01f2 | 515 | en1 = __try_merge_extent_node(sbi, et, &ei, prev_en, next_en); |
4d1fa815 FL |
516 | if (!en1) |
517 | en1 = __insert_extent_tree(sbi, et, &ei, | |
ef05e221 | 518 | insert_p, insert_parent); |
a28ef1f5 CY |
519 | |
520 | /* give up extent_cache, if split and small updates happen */ | |
521 | if (dei.len >= 1 && | |
522 | prev.len < F2FS_MIN_EXTENT_LEN && | |
523 | et->largest.len < F2FS_MIN_EXTENT_LEN) { | |
524 | et->largest.len = 0; | |
525 | set_inode_flag(F2FS_I(inode), FI_NO_EXTENT); | |
526 | } | |
a28ef1f5 | 527 | |
19b2c30d | 528 | spin_lock(&sbi->extent_lock); |
4d1fa815 FL |
529 | if (en1) { |
530 | if (list_empty(&en1->list)) | |
531 | list_add_tail(&en1->list, &sbi->extent_list); | |
19b2c30d | 532 | else |
4d1fa815 | 533 | list_move_tail(&en1->list, &sbi->extent_list); |
19b2c30d | 534 | } |
19b2c30d | 535 | spin_unlock(&sbi->extent_lock); |
19b2c30d | 536 | } |
a28ef1f5 CY |
537 | |
538 | if (is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT)) | |
539 | __free_extent_tree(sbi, et, true); | |
540 | ||
541 | write_unlock(&et->lock); | |
542 | ||
543 | return !__is_extent_same(&prev, &et->largest); | |
544 | } | |
545 | ||
546 | unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *sbi, int nr_shrink) | |
547 | { | |
548 | struct extent_tree *treevec[EXT_TREE_VEC_SIZE]; | |
137d09f0 | 549 | struct extent_tree *et, *next; |
a28ef1f5 CY |
550 | struct extent_node *en, *tmp; |
551 | unsigned long ino = F2FS_ROOT_INO(sbi); | |
a28ef1f5 CY |
552 | unsigned int found; |
553 | unsigned int node_cnt = 0, tree_cnt = 0; | |
554 | int remained; | |
74fd8d99 | 555 | bool do_free = false; |
a28ef1f5 CY |
556 | |
557 | if (!test_opt(sbi, EXTENT_CACHE)) | |
558 | return 0; | |
559 | ||
74fd8d99 JK |
560 | if (!atomic_read(&sbi->total_zombie_tree)) |
561 | goto free_node; | |
562 | ||
a28ef1f5 CY |
563 | if (!down_write_trylock(&sbi->extent_tree_lock)) |
564 | goto out; | |
565 | ||
566 | /* 1. remove unreferenced extent tree */ | |
137d09f0 | 567 | list_for_each_entry_safe(et, next, &sbi->zombie_list, list) { |
9b72a388 CY |
568 | if (atomic_read(&et->node_cnt)) { |
569 | write_lock(&et->lock); | |
570 | node_cnt += __free_extent_tree(sbi, et, true); | |
571 | write_unlock(&et->lock); | |
572 | } | |
a28ef1f5 | 573 | |
137d09f0 JK |
574 | list_del_init(&et->list); |
575 | radix_tree_delete(&sbi->extent_tree_root, et->ino); | |
576 | kmem_cache_free(extent_tree_slab, et); | |
577 | atomic_dec(&sbi->total_ext_tree); | |
578 | atomic_dec(&sbi->total_zombie_tree); | |
579 | tree_cnt++; | |
a28ef1f5 | 580 | |
137d09f0 JK |
581 | if (node_cnt + tree_cnt >= nr_shrink) |
582 | goto unlock_out; | |
a28ef1f5 CY |
583 | } |
584 | up_write(&sbi->extent_tree_lock); | |
585 | ||
74fd8d99 | 586 | free_node: |
a28ef1f5 CY |
587 | /* 2. remove LRU extent entries */ |
588 | if (!down_write_trylock(&sbi->extent_tree_lock)) | |
589 | goto out; | |
590 | ||
591 | remained = nr_shrink - (node_cnt + tree_cnt); | |
592 | ||
593 | spin_lock(&sbi->extent_lock); | |
594 | list_for_each_entry_safe(en, tmp, &sbi->extent_list, list) { | |
595 | if (!remained--) | |
596 | break; | |
597 | list_del_init(&en->list); | |
74fd8d99 | 598 | do_free = true; |
a28ef1f5 CY |
599 | } |
600 | spin_unlock(&sbi->extent_lock); | |
601 | ||
74fd8d99 JK |
602 | if (do_free == false) |
603 | goto unlock_out; | |
604 | ||
100136ac CY |
605 | /* |
606 | * reset ino for searching victims from beginning of global extent tree. | |
607 | */ | |
608 | ino = F2FS_ROOT_INO(sbi); | |
609 | ||
137d09f0 | 610 | while ((found = radix_tree_gang_lookup(&sbi->extent_tree_root, |
a28ef1f5 CY |
611 | (void **)treevec, ino, EXT_TREE_VEC_SIZE))) { |
612 | unsigned i; | |
613 | ||
614 | ino = treevec[found - 1]->ino + 1; | |
615 | for (i = 0; i < found; i++) { | |
616 | struct extent_tree *et = treevec[i]; | |
617 | ||
9b72a388 CY |
618 | if (!atomic_read(&et->node_cnt)) |
619 | continue; | |
620 | ||
760de791 JK |
621 | if (write_trylock(&et->lock)) { |
622 | node_cnt += __free_extent_tree(sbi, et, false); | |
623 | write_unlock(&et->lock); | |
624 | } | |
a28ef1f5 CY |
625 | |
626 | if (node_cnt + tree_cnt >= nr_shrink) | |
beaa57dd | 627 | goto unlock_out; |
a28ef1f5 CY |
628 | } |
629 | } | |
630 | unlock_out: | |
631 | up_write(&sbi->extent_tree_lock); | |
632 | out: | |
633 | trace_f2fs_shrink_extent_tree(sbi, node_cnt, tree_cnt); | |
634 | ||
635 | return node_cnt + tree_cnt; | |
636 | } | |
637 | ||
638 | unsigned int f2fs_destroy_extent_node(struct inode *inode) | |
639 | { | |
640 | struct f2fs_sb_info *sbi = F2FS_I_SB(inode); | |
641 | struct extent_tree *et = F2FS_I(inode)->extent_tree; | |
642 | unsigned int node_cnt = 0; | |
643 | ||
9b72a388 | 644 | if (!et || !atomic_read(&et->node_cnt)) |
a28ef1f5 CY |
645 | return 0; |
646 | ||
647 | write_lock(&et->lock); | |
648 | node_cnt = __free_extent_tree(sbi, et, true); | |
649 | write_unlock(&et->lock); | |
650 | ||
651 | return node_cnt; | |
652 | } | |
653 | ||
654 | void f2fs_destroy_extent_tree(struct inode *inode) | |
655 | { | |
656 | struct f2fs_sb_info *sbi = F2FS_I_SB(inode); | |
657 | struct extent_tree *et = F2FS_I(inode)->extent_tree; | |
658 | unsigned int node_cnt = 0; | |
659 | ||
660 | if (!et) | |
661 | return; | |
662 | ||
68e35385 CY |
663 | if (inode->i_nlink && !is_bad_inode(inode) && |
664 | atomic_read(&et->node_cnt)) { | |
137d09f0 JK |
665 | down_write(&sbi->extent_tree_lock); |
666 | list_add_tail(&et->list, &sbi->zombie_list); | |
74fd8d99 | 667 | atomic_inc(&sbi->total_zombie_tree); |
137d09f0 | 668 | up_write(&sbi->extent_tree_lock); |
a28ef1f5 CY |
669 | return; |
670 | } | |
671 | ||
672 | /* free all extent info belong to this extent tree */ | |
673 | node_cnt = f2fs_destroy_extent_node(inode); | |
674 | ||
675 | /* delete extent tree entry in radix tree */ | |
676 | down_write(&sbi->extent_tree_lock); | |
68e35385 | 677 | f2fs_bug_on(sbi, atomic_read(&et->node_cnt)); |
a28ef1f5 CY |
678 | radix_tree_delete(&sbi->extent_tree_root, inode->i_ino); |
679 | kmem_cache_free(extent_tree_slab, et); | |
7441ccef | 680 | atomic_dec(&sbi->total_ext_tree); |
a28ef1f5 CY |
681 | up_write(&sbi->extent_tree_lock); |
682 | ||
683 | F2FS_I(inode)->extent_tree = NULL; | |
684 | ||
685 | trace_f2fs_destroy_extent_tree(inode, node_cnt); | |
686 | } | |
687 | ||
688 | bool f2fs_lookup_extent_cache(struct inode *inode, pgoff_t pgofs, | |
689 | struct extent_info *ei) | |
690 | { | |
691 | if (!f2fs_may_extent_tree(inode)) | |
692 | return false; | |
693 | ||
694 | return f2fs_lookup_extent_tree(inode, pgofs, ei); | |
695 | } | |
696 | ||
697 | void f2fs_update_extent_cache(struct dnode_of_data *dn) | |
698 | { | |
699 | struct f2fs_inode_info *fi = F2FS_I(dn->inode); | |
700 | pgoff_t fofs; | |
701 | ||
702 | if (!f2fs_may_extent_tree(dn->inode)) | |
703 | return; | |
704 | ||
705 | f2fs_bug_on(F2FS_I_SB(dn->inode), dn->data_blkaddr == NEW_ADDR); | |
706 | ||
19b2c30d | 707 | |
a28ef1f5 CY |
708 | fofs = start_bidx_of_node(ofs_of_node(dn->node_page), fi) + |
709 | dn->ofs_in_node; | |
710 | ||
19b2c30d CY |
711 | if (f2fs_update_extent_tree_range(dn->inode, fofs, dn->data_blkaddr, 1)) |
712 | sync_inode_page(dn); | |
713 | } | |
714 | ||
715 | void f2fs_update_extent_cache_range(struct dnode_of_data *dn, | |
716 | pgoff_t fofs, block_t blkaddr, unsigned int len) | |
717 | ||
718 | { | |
719 | if (!f2fs_may_extent_tree(dn->inode)) | |
720 | return; | |
721 | ||
722 | if (f2fs_update_extent_tree_range(dn->inode, fofs, blkaddr, len)) | |
a28ef1f5 CY |
723 | sync_inode_page(dn); |
724 | } | |
725 | ||
726 | void init_extent_cache_info(struct f2fs_sb_info *sbi) | |
727 | { | |
728 | INIT_RADIX_TREE(&sbi->extent_tree_root, GFP_NOIO); | |
729 | init_rwsem(&sbi->extent_tree_lock); | |
730 | INIT_LIST_HEAD(&sbi->extent_list); | |
731 | spin_lock_init(&sbi->extent_lock); | |
7441ccef | 732 | atomic_set(&sbi->total_ext_tree, 0); |
137d09f0 | 733 | INIT_LIST_HEAD(&sbi->zombie_list); |
74fd8d99 | 734 | atomic_set(&sbi->total_zombie_tree, 0); |
a28ef1f5 CY |
735 | atomic_set(&sbi->total_ext_node, 0); |
736 | } | |
737 | ||
738 | int __init create_extent_cache(void) | |
739 | { | |
740 | extent_tree_slab = f2fs_kmem_cache_create("f2fs_extent_tree", | |
741 | sizeof(struct extent_tree)); | |
742 | if (!extent_tree_slab) | |
743 | return -ENOMEM; | |
744 | extent_node_slab = f2fs_kmem_cache_create("f2fs_extent_node", | |
745 | sizeof(struct extent_node)); | |
746 | if (!extent_node_slab) { | |
747 | kmem_cache_destroy(extent_tree_slab); | |
748 | return -ENOMEM; | |
749 | } | |
750 | return 0; | |
751 | } | |
752 | ||
753 | void destroy_extent_cache(void) | |
754 | { | |
755 | kmem_cache_destroy(extent_node_slab); | |
756 | kmem_cache_destroy(extent_tree_slab); | |
757 | } |