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