Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 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; |
| 73 | sbi->total_ext_tree++; |
| 74 | } |
| 75 | atomic_inc(&et->refcount); |
| 76 | up_write(&sbi->extent_tree_lock); |
| 77 | |
| 78 | /* never died until evict_inode */ |
| 79 | F2FS_I(inode)->extent_tree = et; |
| 80 | |
| 81 | return et; |
| 82 | } |
| 83 | |
Chao Yu | 91c481f | 2015-08-19 19:12:20 +0800 | [diff] [blame] | 84 | static struct extent_node *__lookup_extent_tree(struct f2fs_sb_info *sbi, |
| 85 | struct extent_tree *et, unsigned int fofs) |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 86 | { |
| 87 | struct rb_node *node = et->root.rb_node; |
Fan Li | f8b703d | 2015-08-18 17:13:13 +0800 | [diff] [blame] | 88 | struct extent_node *en = et->cached_en; |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 89 | |
Fan Li | f8b703d | 2015-08-18 17:13:13 +0800 | [diff] [blame] | 90 | if (en) { |
| 91 | struct extent_info *cei = &en->ei; |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 92 | |
Chao Yu | 91c481f | 2015-08-19 19:12:20 +0800 | [diff] [blame] | 93 | if (cei->fofs <= fofs && cei->fofs + cei->len > fofs) { |
| 94 | stat_inc_cached_node_hit(sbi); |
Fan Li | f8b703d | 2015-08-18 17:13:13 +0800 | [diff] [blame] | 95 | return en; |
Chao Yu | 91c481f | 2015-08-19 19:12:20 +0800 | [diff] [blame] | 96 | } |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 97 | } |
| 98 | |
| 99 | while (node) { |
| 100 | en = rb_entry(node, struct extent_node, rb_node); |
| 101 | |
Chao Yu | 029e13c | 2015-08-19 19:13:25 +0800 | [diff] [blame] | 102 | if (fofs < en->ei.fofs) { |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 103 | node = node->rb_left; |
Chao Yu | 029e13c | 2015-08-19 19:13:25 +0800 | [diff] [blame] | 104 | } else if (fofs >= en->ei.fofs + en->ei.len) { |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 105 | node = node->rb_right; |
Chao Yu | 029e13c | 2015-08-19 19:13:25 +0800 | [diff] [blame] | 106 | } else { |
| 107 | stat_inc_rbtree_node_hit(sbi); |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 108 | return en; |
Chao Yu | 029e13c | 2015-08-19 19:13:25 +0800 | [diff] [blame] | 109 | } |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 110 | } |
| 111 | return NULL; |
| 112 | } |
| 113 | |
Chao Yu | a6f7834 | 2015-08-19 19:14:15 +0800 | [diff] [blame] | 114 | static struct extent_node *__init_extent_tree(struct f2fs_sb_info *sbi, |
| 115 | struct extent_tree *et, struct extent_info *ei) |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 116 | { |
| 117 | struct rb_node **p = &et->root.rb_node; |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 118 | struct extent_node *en; |
| 119 | |
Chao Yu | a6f7834 | 2015-08-19 19:14:15 +0800 | [diff] [blame] | 120 | en = __attach_extent_node(sbi, et, ei, NULL, p); |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 121 | if (!en) |
| 122 | return NULL; |
Chao Yu | a6f7834 | 2015-08-19 19:14:15 +0800 | [diff] [blame] | 123 | |
| 124 | et->largest = en->ei; |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 125 | et->cached_en = en; |
| 126 | return en; |
| 127 | } |
| 128 | |
| 129 | static unsigned int __free_extent_tree(struct f2fs_sb_info *sbi, |
| 130 | struct extent_tree *et, bool free_all) |
| 131 | { |
| 132 | struct rb_node *node, *next; |
| 133 | struct extent_node *en; |
| 134 | unsigned int count = et->count; |
| 135 | |
| 136 | node = rb_first(&et->root); |
| 137 | while (node) { |
| 138 | next = rb_next(node); |
| 139 | en = rb_entry(node, struct extent_node, rb_node); |
| 140 | |
| 141 | if (free_all) { |
| 142 | spin_lock(&sbi->extent_lock); |
| 143 | if (!list_empty(&en->list)) |
| 144 | list_del_init(&en->list); |
| 145 | spin_unlock(&sbi->extent_lock); |
| 146 | } |
| 147 | |
| 148 | if (free_all || list_empty(&en->list)) { |
| 149 | __detach_extent_node(sbi, et, en); |
| 150 | kmem_cache_free(extent_node_slab, en); |
| 151 | } |
| 152 | node = next; |
| 153 | } |
| 154 | |
| 155 | return count - et->count; |
| 156 | } |
| 157 | |
| 158 | void f2fs_drop_largest_extent(struct inode *inode, pgoff_t fofs) |
| 159 | { |
| 160 | struct extent_info *largest = &F2FS_I(inode)->extent_tree->largest; |
| 161 | |
| 162 | if (largest->fofs <= fofs && largest->fofs + largest->len > fofs) |
| 163 | largest->len = 0; |
| 164 | } |
| 165 | |
| 166 | void f2fs_init_extent_tree(struct inode *inode, struct f2fs_extent *i_ext) |
| 167 | { |
| 168 | struct f2fs_sb_info *sbi = F2FS_I_SB(inode); |
| 169 | struct extent_tree *et; |
| 170 | struct extent_node *en; |
| 171 | struct extent_info ei; |
| 172 | |
| 173 | if (!f2fs_may_extent_tree(inode)) |
| 174 | return; |
| 175 | |
| 176 | et = __grab_extent_tree(inode); |
| 177 | |
| 178 | if (!i_ext || le32_to_cpu(i_ext->len) < F2FS_MIN_EXTENT_LEN) |
| 179 | return; |
| 180 | |
| 181 | set_extent_info(&ei, le32_to_cpu(i_ext->fofs), |
| 182 | le32_to_cpu(i_ext->blk), le32_to_cpu(i_ext->len)); |
| 183 | |
| 184 | write_lock(&et->lock); |
| 185 | if (et->count) |
| 186 | goto out; |
| 187 | |
Chao Yu | a6f7834 | 2015-08-19 19:14:15 +0800 | [diff] [blame] | 188 | en = __init_extent_tree(sbi, et, &ei); |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 189 | if (en) { |
| 190 | spin_lock(&sbi->extent_lock); |
| 191 | list_add_tail(&en->list, &sbi->extent_list); |
| 192 | spin_unlock(&sbi->extent_lock); |
| 193 | } |
| 194 | out: |
| 195 | write_unlock(&et->lock); |
| 196 | } |
| 197 | |
| 198 | static bool f2fs_lookup_extent_tree(struct inode *inode, pgoff_t pgofs, |
| 199 | struct extent_info *ei) |
| 200 | { |
| 201 | struct f2fs_sb_info *sbi = F2FS_I_SB(inode); |
| 202 | struct extent_tree *et = F2FS_I(inode)->extent_tree; |
| 203 | struct extent_node *en; |
| 204 | bool ret = false; |
| 205 | |
| 206 | f2fs_bug_on(sbi, !et); |
| 207 | |
| 208 | trace_f2fs_lookup_extent_tree_start(inode, pgofs); |
| 209 | |
| 210 | read_lock(&et->lock); |
| 211 | |
| 212 | if (et->largest.fofs <= pgofs && |
| 213 | et->largest.fofs + et->largest.len > pgofs) { |
| 214 | *ei = et->largest; |
| 215 | ret = true; |
Chao Yu | 91c481f | 2015-08-19 19:12:20 +0800 | [diff] [blame] | 216 | stat_inc_largest_node_hit(sbi); |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 217 | goto out; |
| 218 | } |
| 219 | |
Chao Yu | 91c481f | 2015-08-19 19:12:20 +0800 | [diff] [blame] | 220 | en = __lookup_extent_tree(sbi, et, pgofs); |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 221 | if (en) { |
| 222 | *ei = en->ei; |
| 223 | spin_lock(&sbi->extent_lock); |
| 224 | if (!list_empty(&en->list)) |
| 225 | list_move_tail(&en->list, &sbi->extent_list); |
| 226 | et->cached_en = en; |
| 227 | spin_unlock(&sbi->extent_lock); |
| 228 | ret = true; |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 229 | } |
| 230 | out: |
Chao Yu | 727edac | 2015-07-15 17:29:49 +0800 | [diff] [blame] | 231 | stat_inc_total_hit(sbi); |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 232 | read_unlock(&et->lock); |
| 233 | |
| 234 | trace_f2fs_lookup_extent_tree_end(inode, pgofs, ei); |
| 235 | return ret; |
| 236 | } |
| 237 | |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 238 | |
| 239 | /* |
| 240 | * lookup extent at @fofs, if hit, return the extent |
| 241 | * if not, return NULL and |
| 242 | * @prev_ex: extent before fofs |
| 243 | * @next_ex: extent after fofs |
| 244 | * @insert_p: insert point for new extent at fofs |
| 245 | * in order to simpfy the insertion after. |
| 246 | * tree must stay unchanged between lookup and insertion. |
| 247 | */ |
| 248 | static struct extent_node *__lookup_extent_tree_ret(struct extent_tree *et, |
Chao Yu | 91c481f | 2015-08-19 19:12:20 +0800 | [diff] [blame] | 249 | unsigned int fofs, |
| 250 | struct extent_node **prev_ex, |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 251 | struct extent_node **next_ex, |
| 252 | struct rb_node ***insert_p, |
| 253 | struct rb_node **insert_parent) |
| 254 | { |
| 255 | struct rb_node **pnode = &et->root.rb_node; |
| 256 | struct rb_node *parent = NULL, *tmp_node; |
Chao Yu | dac2dde | 2015-08-19 19:16:09 +0800 | [diff] [blame^] | 257 | struct extent_node *en = et->cached_en; |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 258 | |
Chao Yu | dac2dde | 2015-08-19 19:16:09 +0800 | [diff] [blame^] | 259 | *insert_p = NULL; |
| 260 | *insert_parent = NULL; |
| 261 | *prev_ex = NULL; |
| 262 | *next_ex = NULL; |
| 263 | |
| 264 | if (RB_EMPTY_ROOT(&et->root)) |
| 265 | return NULL; |
| 266 | |
| 267 | if (en) { |
| 268 | struct extent_info *cei = &en->ei; |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 269 | |
| 270 | if (cei->fofs <= fofs && cei->fofs + cei->len > fofs) |
Chao Yu | dac2dde | 2015-08-19 19:16:09 +0800 | [diff] [blame^] | 271 | goto lookup_neighbors; |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 272 | } |
| 273 | |
| 274 | while (*pnode) { |
| 275 | parent = *pnode; |
| 276 | en = rb_entry(*pnode, struct extent_node, rb_node); |
| 277 | |
| 278 | if (fofs < en->ei.fofs) |
| 279 | pnode = &(*pnode)->rb_left; |
| 280 | else if (fofs >= en->ei.fofs + en->ei.len) |
| 281 | pnode = &(*pnode)->rb_right; |
| 282 | else |
Chao Yu | dac2dde | 2015-08-19 19:16:09 +0800 | [diff] [blame^] | 283 | goto lookup_neighbors; |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 284 | } |
| 285 | |
| 286 | *insert_p = pnode; |
| 287 | *insert_parent = parent; |
| 288 | |
| 289 | en = rb_entry(parent, struct extent_node, rb_node); |
| 290 | tmp_node = parent; |
| 291 | if (parent && fofs > en->ei.fofs) |
| 292 | tmp_node = rb_next(parent); |
| 293 | *next_ex = tmp_node ? |
| 294 | rb_entry(tmp_node, struct extent_node, rb_node) : NULL; |
| 295 | |
| 296 | tmp_node = parent; |
| 297 | if (parent && fofs < en->ei.fofs) |
| 298 | tmp_node = rb_prev(parent); |
| 299 | *prev_ex = tmp_node ? |
| 300 | rb_entry(tmp_node, struct extent_node, rb_node) : NULL; |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 301 | return NULL; |
Chao Yu | dac2dde | 2015-08-19 19:16:09 +0800 | [diff] [blame^] | 302 | |
| 303 | lookup_neighbors: |
| 304 | if (fofs == en->ei.fofs) { |
| 305 | /* lookup prev node for merging backward later */ |
| 306 | tmp_node = rb_prev(&en->rb_node); |
| 307 | *prev_ex = tmp_node ? |
| 308 | rb_entry(tmp_node, struct extent_node, rb_node) : NULL; |
| 309 | } |
| 310 | if (fofs == en->ei.fofs + en->ei.len - 1) { |
| 311 | /* lookup next node for merging frontward later */ |
| 312 | tmp_node = rb_next(&en->rb_node); |
| 313 | *next_ex = tmp_node ? |
| 314 | rb_entry(tmp_node, struct extent_node, rb_node) : NULL; |
| 315 | } |
| 316 | return en; |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 317 | } |
| 318 | |
Chao Yu | ef05e22 | 2015-08-19 19:15:09 +0800 | [diff] [blame] | 319 | static struct extent_node *__try_merge_extent_node(struct f2fs_sb_info *sbi, |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 320 | struct extent_tree *et, struct extent_info *ei, |
| 321 | struct extent_node **den, |
| 322 | struct extent_node *prev_ex, |
Chao Yu | ef05e22 | 2015-08-19 19:15:09 +0800 | [diff] [blame] | 323 | struct extent_node *next_ex) |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 324 | { |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 325 | struct extent_node *en = NULL; |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 326 | |
| 327 | if (prev_ex && __is_back_mergeable(ei, &prev_ex->ei)) { |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 328 | prev_ex->ei.len += ei->len; |
| 329 | ei = &prev_ex->ei; |
| 330 | en = prev_ex; |
| 331 | } |
Chao Yu | ef05e22 | 2015-08-19 19:15:09 +0800 | [diff] [blame] | 332 | |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 333 | if (next_ex && __is_front_mergeable(ei, &next_ex->ei)) { |
Chao Yu | ef05e22 | 2015-08-19 19:15:09 +0800 | [diff] [blame] | 334 | if (en) { |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 335 | __detach_extent_node(sbi, et, prev_ex); |
| 336 | *den = prev_ex; |
| 337 | } |
| 338 | next_ex->ei.fofs = ei->fofs; |
| 339 | next_ex->ei.blk = ei->blk; |
| 340 | next_ex->ei.len += ei->len; |
| 341 | en = next_ex; |
| 342 | } |
Chao Yu | ef05e22 | 2015-08-19 19:15:09 +0800 | [diff] [blame] | 343 | |
| 344 | if (en) { |
| 345 | if (en->ei.len > et->largest.len) |
| 346 | et->largest = en->ei; |
| 347 | et->cached_en = en; |
| 348 | } |
| 349 | return en; |
| 350 | } |
| 351 | |
| 352 | static struct extent_node *__insert_extent_tree(struct f2fs_sb_info *sbi, |
| 353 | struct extent_tree *et, struct extent_info *ei, |
| 354 | struct rb_node **insert_p, |
| 355 | struct rb_node *insert_parent) |
| 356 | { |
| 357 | struct rb_node **p = &et->root.rb_node; |
| 358 | struct rb_node *parent = NULL; |
| 359 | struct extent_node *en = NULL; |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 360 | |
| 361 | if (insert_p && insert_parent) { |
| 362 | parent = insert_parent; |
| 363 | p = insert_p; |
| 364 | goto do_insert; |
| 365 | } |
| 366 | |
| 367 | while (*p) { |
| 368 | parent = *p; |
| 369 | en = rb_entry(parent, struct extent_node, rb_node); |
| 370 | |
| 371 | if (ei->fofs < en->ei.fofs) |
| 372 | p = &(*p)->rb_left; |
| 373 | else if (ei->fofs >= en->ei.fofs + en->ei.len) |
| 374 | p = &(*p)->rb_right; |
| 375 | else |
| 376 | f2fs_bug_on(sbi, 1); |
| 377 | } |
| 378 | do_insert: |
| 379 | en = __attach_extent_node(sbi, et, ei, parent, p); |
| 380 | if (!en) |
| 381 | return NULL; |
Chao Yu | ef05e22 | 2015-08-19 19:15:09 +0800 | [diff] [blame] | 382 | |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 383 | if (en->ei.len > et->largest.len) |
| 384 | et->largest = en->ei; |
| 385 | et->cached_en = en; |
| 386 | return en; |
| 387 | } |
| 388 | |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 389 | /* return true, if on-disk extent should be updated */ |
| 390 | static bool f2fs_update_extent_tree(struct inode *inode, pgoff_t fofs, |
| 391 | block_t blkaddr) |
| 392 | { |
| 393 | struct f2fs_sb_info *sbi = F2FS_I_SB(inode); |
| 394 | struct extent_tree *et = F2FS_I(inode)->extent_tree; |
| 395 | struct extent_node *en = NULL, *en1 = NULL, *en2 = NULL, *en3 = NULL; |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 396 | struct extent_node *den = NULL, *prev_ex = NULL, *next_ex = NULL; |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 397 | struct extent_info ei, dei, prev; |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 398 | struct rb_node **insert_p = NULL, *insert_parent = NULL; |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 399 | unsigned int endofs; |
| 400 | |
| 401 | if (!et) |
| 402 | return false; |
| 403 | |
| 404 | trace_f2fs_update_extent_tree(inode, fofs, blkaddr); |
| 405 | |
| 406 | write_lock(&et->lock); |
| 407 | |
| 408 | if (is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT)) { |
| 409 | write_unlock(&et->lock); |
| 410 | return false; |
| 411 | } |
| 412 | |
| 413 | prev = et->largest; |
| 414 | dei.len = 0; |
| 415 | |
| 416 | /* we do not guarantee that the largest extent is cached all the time */ |
| 417 | f2fs_drop_largest_extent(inode, fofs); |
| 418 | |
| 419 | /* 1. lookup and remove existing extent info in cache */ |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 420 | en = __lookup_extent_tree_ret(et, fofs, &prev_ex, &next_ex, |
| 421 | &insert_p, &insert_parent); |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 422 | if (!en) |
| 423 | goto update_extent; |
| 424 | |
| 425 | dei = en->ei; |
| 426 | __detach_extent_node(sbi, et, en); |
| 427 | |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 428 | /* 2. if extent can be split, try to split it */ |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 429 | if (dei.len > F2FS_MIN_EXTENT_LEN) { |
| 430 | /* insert left part of split extent into cache */ |
| 431 | if (fofs - dei.fofs >= F2FS_MIN_EXTENT_LEN) { |
| 432 | set_extent_info(&ei, dei.fofs, dei.blk, |
Fan Li | 0f825ee | 2015-07-15 18:05:17 +0800 | [diff] [blame] | 433 | fofs - dei.fofs); |
Chao Yu | ef05e22 | 2015-08-19 19:15:09 +0800 | [diff] [blame] | 434 | en1 = __insert_extent_tree(sbi, et, &ei, NULL, NULL); |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 435 | } |
| 436 | |
| 437 | /* insert right part of split extent into cache */ |
| 438 | endofs = dei.fofs + dei.len - 1; |
| 439 | if (endofs - fofs >= F2FS_MIN_EXTENT_LEN) { |
| 440 | set_extent_info(&ei, fofs + 1, |
| 441 | fofs - dei.fofs + dei.blk + 1, endofs - fofs); |
Chao Yu | ef05e22 | 2015-08-19 19:15:09 +0800 | [diff] [blame] | 442 | en2 = __insert_extent_tree(sbi, et, &ei, NULL, NULL); |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 443 | } |
| 444 | } |
| 445 | |
| 446 | update_extent: |
| 447 | /* 3. update extent in extent cache */ |
| 448 | if (blkaddr) { |
| 449 | set_extent_info(&ei, fofs, blkaddr, 1); |
Chao Yu | ef05e22 | 2015-08-19 19:15:09 +0800 | [diff] [blame] | 450 | en3 = __try_merge_extent_node(sbi, et, &ei, &den, |
| 451 | prev_ex, next_ex); |
| 452 | if (!en3) |
| 453 | en3 = __insert_extent_tree(sbi, et, &ei, |
| 454 | insert_p, insert_parent); |
Chao Yu | a28ef1f | 2015-07-08 17:59:36 +0800 | [diff] [blame] | 455 | |
| 456 | /* give up extent_cache, if split and small updates happen */ |
| 457 | if (dei.len >= 1 && |
| 458 | prev.len < F2FS_MIN_EXTENT_LEN && |
| 459 | et->largest.len < F2FS_MIN_EXTENT_LEN) { |
| 460 | et->largest.len = 0; |
| 461 | set_inode_flag(F2FS_I(inode), FI_NO_EXTENT); |
| 462 | } |
| 463 | } |
| 464 | |
| 465 | /* 4. update in global extent list */ |
| 466 | spin_lock(&sbi->extent_lock); |
| 467 | if (en && !list_empty(&en->list)) |
| 468 | list_del(&en->list); |
| 469 | /* |
| 470 | * en1 and en2 split from en, they will become more and more smaller |
| 471 | * fragments after splitting several times. So if the length is smaller |
| 472 | * than F2FS_MIN_EXTENT_LEN, we will not add them into extent tree. |
| 473 | */ |
| 474 | if (en1) |
| 475 | list_add_tail(&en1->list, &sbi->extent_list); |
| 476 | if (en2) |
| 477 | list_add_tail(&en2->list, &sbi->extent_list); |
| 478 | if (en3) { |
| 479 | if (list_empty(&en3->list)) |
| 480 | list_add_tail(&en3->list, &sbi->extent_list); |
| 481 | else |
| 482 | list_move_tail(&en3->list, &sbi->extent_list); |
| 483 | } |
| 484 | if (den && !list_empty(&den->list)) |
| 485 | list_del(&den->list); |
| 486 | spin_unlock(&sbi->extent_lock); |
| 487 | |
| 488 | /* 5. release extent node */ |
| 489 | if (en) |
| 490 | kmem_cache_free(extent_node_slab, en); |
| 491 | if (den) |
| 492 | kmem_cache_free(extent_node_slab, den); |
| 493 | |
| 494 | if (is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT)) |
| 495 | __free_extent_tree(sbi, et, true); |
| 496 | |
| 497 | write_unlock(&et->lock); |
| 498 | |
| 499 | return !__is_extent_same(&prev, &et->largest); |
| 500 | } |
| 501 | |
| 502 | unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *sbi, int nr_shrink) |
| 503 | { |
| 504 | struct extent_tree *treevec[EXT_TREE_VEC_SIZE]; |
| 505 | struct extent_node *en, *tmp; |
| 506 | unsigned long ino = F2FS_ROOT_INO(sbi); |
| 507 | struct radix_tree_root *root = &sbi->extent_tree_root; |
| 508 | unsigned int found; |
| 509 | unsigned int node_cnt = 0, tree_cnt = 0; |
| 510 | int remained; |
| 511 | |
| 512 | if (!test_opt(sbi, EXTENT_CACHE)) |
| 513 | return 0; |
| 514 | |
| 515 | if (!down_write_trylock(&sbi->extent_tree_lock)) |
| 516 | goto out; |
| 517 | |
| 518 | /* 1. remove unreferenced extent tree */ |
| 519 | while ((found = radix_tree_gang_lookup(root, |
| 520 | (void **)treevec, ino, EXT_TREE_VEC_SIZE))) { |
| 521 | unsigned i; |
| 522 | |
| 523 | ino = treevec[found - 1]->ino + 1; |
| 524 | for (i = 0; i < found; i++) { |
| 525 | struct extent_tree *et = treevec[i]; |
| 526 | |
| 527 | if (!atomic_read(&et->refcount)) { |
| 528 | write_lock(&et->lock); |
| 529 | node_cnt += __free_extent_tree(sbi, et, true); |
| 530 | write_unlock(&et->lock); |
| 531 | |
| 532 | radix_tree_delete(root, et->ino); |
| 533 | kmem_cache_free(extent_tree_slab, et); |
| 534 | sbi->total_ext_tree--; |
| 535 | tree_cnt++; |
| 536 | |
| 537 | if (node_cnt + tree_cnt >= nr_shrink) |
| 538 | goto unlock_out; |
| 539 | } |
| 540 | } |
| 541 | } |
| 542 | up_write(&sbi->extent_tree_lock); |
| 543 | |
| 544 | /* 2. remove LRU extent entries */ |
| 545 | if (!down_write_trylock(&sbi->extent_tree_lock)) |
| 546 | goto out; |
| 547 | |
| 548 | remained = nr_shrink - (node_cnt + tree_cnt); |
| 549 | |
| 550 | spin_lock(&sbi->extent_lock); |
| 551 | list_for_each_entry_safe(en, tmp, &sbi->extent_list, list) { |
| 552 | if (!remained--) |
| 553 | break; |
| 554 | list_del_init(&en->list); |
| 555 | } |
| 556 | spin_unlock(&sbi->extent_lock); |
| 557 | |
| 558 | while ((found = radix_tree_gang_lookup(root, |
| 559 | (void **)treevec, ino, EXT_TREE_VEC_SIZE))) { |
| 560 | unsigned i; |
| 561 | |
| 562 | ino = treevec[found - 1]->ino + 1; |
| 563 | for (i = 0; i < found; i++) { |
| 564 | struct extent_tree *et = treevec[i]; |
| 565 | |
| 566 | write_lock(&et->lock); |
| 567 | node_cnt += __free_extent_tree(sbi, et, false); |
| 568 | write_unlock(&et->lock); |
| 569 | |
| 570 | if (node_cnt + tree_cnt >= nr_shrink) |
| 571 | break; |
| 572 | } |
| 573 | } |
| 574 | unlock_out: |
| 575 | up_write(&sbi->extent_tree_lock); |
| 576 | out: |
| 577 | trace_f2fs_shrink_extent_tree(sbi, node_cnt, tree_cnt); |
| 578 | |
| 579 | return node_cnt + tree_cnt; |
| 580 | } |
| 581 | |
| 582 | unsigned int f2fs_destroy_extent_node(struct inode *inode) |
| 583 | { |
| 584 | struct f2fs_sb_info *sbi = F2FS_I_SB(inode); |
| 585 | struct extent_tree *et = F2FS_I(inode)->extent_tree; |
| 586 | unsigned int node_cnt = 0; |
| 587 | |
| 588 | if (!et) |
| 589 | return 0; |
| 590 | |
| 591 | write_lock(&et->lock); |
| 592 | node_cnt = __free_extent_tree(sbi, et, true); |
| 593 | write_unlock(&et->lock); |
| 594 | |
| 595 | return node_cnt; |
| 596 | } |
| 597 | |
| 598 | void f2fs_destroy_extent_tree(struct inode *inode) |
| 599 | { |
| 600 | struct f2fs_sb_info *sbi = F2FS_I_SB(inode); |
| 601 | struct extent_tree *et = F2FS_I(inode)->extent_tree; |
| 602 | unsigned int node_cnt = 0; |
| 603 | |
| 604 | if (!et) |
| 605 | return; |
| 606 | |
| 607 | if (inode->i_nlink && !is_bad_inode(inode) && et->count) { |
| 608 | atomic_dec(&et->refcount); |
| 609 | return; |
| 610 | } |
| 611 | |
| 612 | /* free all extent info belong to this extent tree */ |
| 613 | node_cnt = f2fs_destroy_extent_node(inode); |
| 614 | |
| 615 | /* delete extent tree entry in radix tree */ |
| 616 | down_write(&sbi->extent_tree_lock); |
| 617 | atomic_dec(&et->refcount); |
| 618 | f2fs_bug_on(sbi, atomic_read(&et->refcount) || et->count); |
| 619 | radix_tree_delete(&sbi->extent_tree_root, inode->i_ino); |
| 620 | kmem_cache_free(extent_tree_slab, et); |
| 621 | sbi->total_ext_tree--; |
| 622 | up_write(&sbi->extent_tree_lock); |
| 623 | |
| 624 | F2FS_I(inode)->extent_tree = NULL; |
| 625 | |
| 626 | trace_f2fs_destroy_extent_tree(inode, node_cnt); |
| 627 | } |
| 628 | |
| 629 | bool f2fs_lookup_extent_cache(struct inode *inode, pgoff_t pgofs, |
| 630 | struct extent_info *ei) |
| 631 | { |
| 632 | if (!f2fs_may_extent_tree(inode)) |
| 633 | return false; |
| 634 | |
| 635 | return f2fs_lookup_extent_tree(inode, pgofs, ei); |
| 636 | } |
| 637 | |
| 638 | void f2fs_update_extent_cache(struct dnode_of_data *dn) |
| 639 | { |
| 640 | struct f2fs_inode_info *fi = F2FS_I(dn->inode); |
| 641 | pgoff_t fofs; |
| 642 | |
| 643 | if (!f2fs_may_extent_tree(dn->inode)) |
| 644 | return; |
| 645 | |
| 646 | f2fs_bug_on(F2FS_I_SB(dn->inode), dn->data_blkaddr == NEW_ADDR); |
| 647 | |
| 648 | fofs = start_bidx_of_node(ofs_of_node(dn->node_page), fi) + |
| 649 | dn->ofs_in_node; |
| 650 | |
| 651 | if (f2fs_update_extent_tree(dn->inode, fofs, dn->data_blkaddr)) |
| 652 | sync_inode_page(dn); |
| 653 | } |
| 654 | |
| 655 | void init_extent_cache_info(struct f2fs_sb_info *sbi) |
| 656 | { |
| 657 | INIT_RADIX_TREE(&sbi->extent_tree_root, GFP_NOIO); |
| 658 | init_rwsem(&sbi->extent_tree_lock); |
| 659 | INIT_LIST_HEAD(&sbi->extent_list); |
| 660 | spin_lock_init(&sbi->extent_lock); |
| 661 | sbi->total_ext_tree = 0; |
| 662 | atomic_set(&sbi->total_ext_node, 0); |
| 663 | } |
| 664 | |
| 665 | int __init create_extent_cache(void) |
| 666 | { |
| 667 | extent_tree_slab = f2fs_kmem_cache_create("f2fs_extent_tree", |
| 668 | sizeof(struct extent_tree)); |
| 669 | if (!extent_tree_slab) |
| 670 | return -ENOMEM; |
| 671 | extent_node_slab = f2fs_kmem_cache_create("f2fs_extent_node", |
| 672 | sizeof(struct extent_node)); |
| 673 | if (!extent_node_slab) { |
| 674 | kmem_cache_destroy(extent_tree_slab); |
| 675 | return -ENOMEM; |
| 676 | } |
| 677 | return 0; |
| 678 | } |
| 679 | |
| 680 | void destroy_extent_cache(void) |
| 681 | { |
| 682 | kmem_cache_destroy(extent_node_slab); |
| 683 | kmem_cache_destroy(extent_tree_slab); |
| 684 | } |