26 	struct extent_tree *et = fi->extent_tree[EX_READ];  in sanity_check_extent_cache()  local
29 	if (!et)  in sanity_check_extent_cache()
32 	ei = &et->largest;  in sanity_check_extent_cache()
39 		et->largest_updated = true;  in sanity_check_extent_cache()
126 static void __try_update_largest_extent(struct extent_tree *et,  in __try_update_largest_extent()  argument
129 	if (et->type != EX_READ)  in __try_update_largest_extent()
131 	if (en->ei.len <= et->largest.len)  in __try_update_largest_extent()
134 	et->largest = en->ei;  in __try_update_largest_extent()
135 	et->largest_updated = true;  in __try_update_largest_extent()
280 				struct extent_tree *et, struct extent_info *ei,  in __attach_extent_node()  argument
284 	struct extent_tree_info *eti = &sbi->extent_tree[et->type];  in __attach_extent_node()
293 	en->et = et;  in __attach_extent_node()
296 	rb_insert_color_cached(&en->rb_node, &et->root, leftmost);  in __attach_extent_node()
297 	atomic_inc(&et->node_cnt);  in __attach_extent_node()
303 				struct extent_tree *et, struct extent_node *en)  in __detach_extent_node()  argument
305 	struct extent_tree_info *eti = &sbi->extent_tree[et->type];  in __detach_extent_node()
307 	rb_erase_cached(&en->rb_node, &et->root);  in __detach_extent_node()
308 	atomic_dec(&et->node_cnt);  in __detach_extent_node()
311 	if (et->cached_en == en)  in __detach_extent_node()
312 		et->cached_en = NULL;  in __detach_extent_node()
323 			struct extent_tree *et, struct extent_node *en)  in __release_extent_node()  argument
325 	struct extent_tree_info *eti = &sbi->extent_tree[et->type];  in __release_extent_node()
332 	__detach_extent_node(sbi, et, en);  in __release_extent_node()
340 	struct extent_tree *et;  in __grab_extent_tree()  local
344 	et = radix_tree_lookup(&eti->extent_tree_root, ino);  in __grab_extent_tree()
345 	if (!et) {  in __grab_extent_tree()
346 		et = f2fs_kmem_cache_alloc(extent_tree_slab,  in __grab_extent_tree()
348 		f2fs_radix_tree_insert(&eti->extent_tree_root, ino, et);  in __grab_extent_tree()
349 		memset(et, 0, sizeof(struct extent_tree));  in __grab_extent_tree()
350 		et->ino = ino;  in __grab_extent_tree()
351 		et->type = type;  in __grab_extent_tree()
352 		et->root = RB_ROOT_CACHED;  in __grab_extent_tree()
353 		et->cached_en = NULL;  in __grab_extent_tree()
354 		rwlock_init(&et->lock);  in __grab_extent_tree()
355 		INIT_LIST_HEAD(&et->list);  in __grab_extent_tree()
356 		atomic_set(&et->node_cnt, 0);  in __grab_extent_tree()
360 		list_del_init(&et->list);  in __grab_extent_tree()
365 	F2FS_I(inode)->extent_tree[type] = et;  in __grab_extent_tree()
367 	return et;  in __grab_extent_tree()
371 					struct extent_tree *et)  in __free_extent_tree()  argument
375 	unsigned int count = atomic_read(&et->node_cnt);  in __free_extent_tree()
377 	node = rb_first_cached(&et->root);  in __free_extent_tree()
381 		__release_extent_node(sbi, et, en);  in __free_extent_tree()
385 	return count - atomic_read(&et->node_cnt);  in __free_extent_tree()
388 static void __drop_largest_extent(struct extent_tree *et,  in __drop_largest_extent()  argument
391 	if (fofs < et->largest.fofs + et->largest.len &&  in __drop_largest_extent()
392 			fofs + len > et->largest.fofs) {  in __drop_largest_extent()
393 		et->largest.len = 0;  in __drop_largest_extent()
394 		et->largest_updated = true;  in __drop_largest_extent()
403 	struct extent_tree *et;  in f2fs_init_read_extent_tree()  local
417 	et = __grab_extent_tree(inode, EX_READ);  in f2fs_init_read_extent_tree()
424 	write_lock(&et->lock);  in f2fs_init_read_extent_tree()
425 	if (atomic_read(&et->node_cnt))  in f2fs_init_read_extent_tree()
428 	en = __attach_extent_node(sbi, et, &ei, NULL,  in f2fs_init_read_extent_tree()
429 				&et->root.rb_root.rb_node, true);  in f2fs_init_read_extent_tree()
431 		et->largest = en->ei;  in f2fs_init_read_extent_tree()
432 		et->cached_en = en;  in f2fs_init_read_extent_tree()
439 	write_unlock(&et->lock);  in f2fs_init_read_extent_tree()
468 	struct extent_tree *et = F2FS_I(inode)->extent_tree[type];  in __lookup_extent_tree()  local
472 	if (!et)  in __lookup_extent_tree()
477 	read_lock(&et->lock);  in __lookup_extent_tree()
480 			et->largest.fofs <= pgofs &&  in __lookup_extent_tree()
481 			et->largest.fofs + et->largest.len > pgofs) {  in __lookup_extent_tree()
482 		*ei = et->largest;  in __lookup_extent_tree()
488 	en = __lookup_extent_node(&et->root, et->cached_en, pgofs);  in __lookup_extent_tree()
492 	if (en == et->cached_en)  in __lookup_extent_tree()
501 		et->cached_en = en;  in __lookup_extent_tree()
507 	read_unlock(&et->lock);  in __lookup_extent_tree()
517 				struct extent_tree *et, struct extent_info *ei,  in __try_merge_extent_node()  argument
521 	struct extent_tree_info *eti = &sbi->extent_tree[et->type];  in __try_merge_extent_node()
524 	if (prev_ex && __is_back_mergeable(ei, &prev_ex->ei, et->type)) {  in __try_merge_extent_node()
530 	if (next_ex && __is_front_mergeable(ei, &next_ex->ei, et->type)) {  in __try_merge_extent_node()
533 		if (et->type == EX_READ)  in __try_merge_extent_node()
536 			__release_extent_node(sbi, et, prev_ex);  in __try_merge_extent_node()
544 	__try_update_largest_extent(et, en);  in __try_merge_extent_node()
549 		et->cached_en = en;  in __try_merge_extent_node()
556 				struct extent_tree *et, struct extent_info *ei,  in __insert_extent_tree()  argument
561 	struct extent_tree_info *eti = &sbi->extent_tree[et->type];  in __insert_extent_tree()
562 	struct rb_node **p = &et->root.rb_root.rb_node;  in __insert_extent_tree()
590 	en = __attach_extent_node(sbi, et, ei, parent, p, leftmost);  in __insert_extent_tree()
594 	__try_update_largest_extent(et, en);  in __insert_extent_tree()
599 	et->cached_en = en;  in __insert_extent_tree()
608 	struct extent_tree *et = F2FS_I(inode)->extent_tree[type];  in __update_extent_tree_range()  local
618 	if (!et)  in __update_extent_tree_range()
628 	write_lock(&et->lock);  in __update_extent_tree_range()
632 			write_unlock(&et->lock);  in __update_extent_tree_range()
636 		prev = et->largest;  in __update_extent_tree_range()
643 		__drop_largest_extent(et, fofs, len);  in __update_extent_tree_range()
647 	en = __lookup_extent_node_ret(&et->root,  in __update_extent_tree_range()
648 					et->cached_en, fofs,  in __update_extent_tree_range()
681 				en1 = __insert_extent_tree(sbi, et, &ei,  in __update_extent_tree_range()
703 			__try_update_largest_extent(et, en);  in __update_extent_tree_range()
705 			__release_extent_node(sbi, et, en);  in __update_extent_tree_range()
728 		if (!__try_merge_extent_node(sbi, et, &ei, prev_en, next_en))  in __update_extent_tree_range()
729 			__insert_extent_tree(sbi, et, &ei,  in __update_extent_tree_range()
735 				et->largest.len < F2FS_MIN_EXTENT_LEN) {  in __update_extent_tree_range()
736 			et->largest.len = 0;  in __update_extent_tree_range()
737 			et->largest_updated = true;  in __update_extent_tree_range()
743 		__free_extent_tree(sbi, et);  in __update_extent_tree_range()
745 	if (et->largest_updated) {  in __update_extent_tree_range()
746 		et->largest_updated = false;  in __update_extent_tree_range()
756 	if (!__try_merge_extent_node(sbi, et, &ei, prev_en, next_en))  in __update_extent_tree_range()
757 		__insert_extent_tree(sbi, et, &ei,  in __update_extent_tree_range()
760 	write_unlock(&et->lock);  in __update_extent_tree_range()
772 	struct extent_tree *et = F2FS_I(inode)->extent_tree[EX_READ];  in f2fs_update_read_extent_tree_range_compressed()  local
786 	write_lock(&et->lock);  in f2fs_update_read_extent_tree_range_compressed()
788 	en = __lookup_extent_node_ret(&et->root,  in f2fs_update_read_extent_tree_range_compressed()
789 					et->cached_en, fofs,  in f2fs_update_read_extent_tree_range_compressed()
799 	if (!__try_merge_extent_node(sbi, et, &ei, prev_en, next_en))  in f2fs_update_read_extent_tree_range_compressed()
800 		__insert_extent_tree(sbi, et, &ei,  in f2fs_update_read_extent_tree_range_compressed()
803 	write_unlock(&et->lock);  in f2fs_update_read_extent_tree_range_compressed()
911 	struct extent_tree *et, *next;  in __shrink_extent_tree()  local
923 	list_for_each_entry_safe(et, next, &eti->zombie_list, list) {  in __shrink_extent_tree()
924 		if (atomic_read(&et->node_cnt)) {  in __shrink_extent_tree()
925 			write_lock(&et->lock);  in __shrink_extent_tree()
926 			node_cnt += __free_extent_tree(sbi, et);  in __shrink_extent_tree()
927 			write_unlock(&et->lock);  in __shrink_extent_tree()
929 		f2fs_bug_on(sbi, atomic_read(&et->node_cnt));  in __shrink_extent_tree()
930 		list_del_init(&et->list);  in __shrink_extent_tree()
931 		radix_tree_delete(&eti->extent_tree_root, et->ino);  in __shrink_extent_tree()
932 		kmem_cache_free(extent_tree_slab, et);  in __shrink_extent_tree()
956 		et = en->et;  in __shrink_extent_tree()
957 		if (!write_trylock(&et->lock)) {  in __shrink_extent_tree()
966 		__detach_extent_node(sbi, et, en);  in __shrink_extent_tree()
968 		write_unlock(&et->lock);  in __shrink_extent_tree()
1072 	struct extent_tree *et = F2FS_I(inode)->extent_tree[type];  in __destroy_extent_node()  local
1075 	if (!et || !atomic_read(&et->node_cnt))  in __destroy_extent_node()
1078 	write_lock(&et->lock);  in __destroy_extent_node()
1079 	node_cnt = __free_extent_tree(sbi, et);  in __destroy_extent_node()
1080 	write_unlock(&et->lock);  in __destroy_extent_node()
1094 	struct extent_tree *et = F2FS_I(inode)->extent_tree[type];  in __drop_extent_tree()  local
1100 	write_lock(&et->lock);  in __drop_extent_tree()
1101 	__free_extent_tree(sbi, et);  in __drop_extent_tree()
1104 		if (et->largest.len) {  in __drop_extent_tree()
1105 			et->largest.len = 0;  in __drop_extent_tree()
1109 	write_unlock(&et->lock);  in __drop_extent_tree()
1124 	struct extent_tree *et = F2FS_I(inode)->extent_tree[type];  in __destroy_extent_tree()  local
1127 	if (!et)  in __destroy_extent_tree()
1131 					atomic_read(&et->node_cnt)) {  in __destroy_extent_tree()
1133 		list_add_tail(&et->list, &eti->zombie_list);  in __destroy_extent_tree()
1144 	f2fs_bug_on(sbi, atomic_read(&et->node_cnt));  in __destroy_extent_tree()
1146 	kmem_cache_free(extent_tree_slab, et);  in __destroy_extent_tree()