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