85 				struct extent_tree *et, unsigned int fofs)  in __lookup_extent_tree()  argument
93 		if (cei->fofs <= fofs && cei->fofs + cei->len > fofs) {  in __lookup_extent_tree()
102 		if (fofs < en->ei.fofs) {  in __lookup_extent_tree()
104 		} else if (fofs >= en->ei.fofs + en->ei.len) {  in __lookup_extent_tree()
159 					pgoff_t fofs, unsigned int len)  in __drop_largest_extent()  argument
163 	if (fofs < largest->fofs + largest->len && fofs + len > largest->fofs)  in __drop_largest_extent()
167 void f2fs_drop_largest_extent(struct inode *inode, pgoff_t fofs)  in f2fs_drop_largest_extent()  argument
172 	__drop_largest_extent(inode, fofs, 1);  in f2fs_drop_largest_extent()
190 	set_extent_info(&ei, le32_to_cpu(i_ext->fofs),  in f2fs_init_extent_tree()
221 	if (et->largest.fofs <= pgofs &&  in f2fs_lookup_extent_tree()
222 			et->largest.fofs + et->largest.len > pgofs) {  in f2fs_lookup_extent_tree()
258 				unsigned int fofs,  in __lookup_extent_tree_ret()  argument
279 		if (cei->fofs <= fofs && cei->fofs + cei->len > fofs)  in __lookup_extent_tree_ret()
287 		if (fofs < en->ei.fofs)  in __lookup_extent_tree_ret()
289 		else if (fofs >= en->ei.fofs + en->ei.len)  in __lookup_extent_tree_ret()
300 	if (parent && fofs > en->ei.fofs)  in __lookup_extent_tree_ret()
306 	if (parent && fofs < en->ei.fofs)  in __lookup_extent_tree_ret()
313 	if (fofs == en->ei.fofs) {  in __lookup_extent_tree_ret()
319 	if (fofs == en->ei.fofs + en->ei.len - 1) {  in __lookup_extent_tree_ret()
347 		next_ex->ei.fofs = ei->fofs;  in __try_merge_extent_node()
379 		if (ei->fofs < en->ei.fofs)  in __insert_extent_tree()
381 		else if (ei->fofs >= en->ei.fofs + en->ei.len)  in __insert_extent_tree()
397 				pgoff_t fofs, block_t blkaddr, unsigned int len)  in f2fs_update_extent_tree_range()  argument
405 	unsigned int end = fofs + len;  in f2fs_update_extent_tree_range()
406 	unsigned int pos = (unsigned int)fofs;  in f2fs_update_extent_tree_range()
411 	trace_f2fs_update_extent_tree_range(inode, fofs, blkaddr, len);  in f2fs_update_extent_tree_range()
427 	__drop_largest_extent(inode, fofs, len);  in f2fs_update_extent_tree_range()
430 	en = __lookup_extent_tree_ret(et, fofs, &prev_en, &next_en,  in f2fs_update_extent_tree_range()
436 	while (en && en->ei.fofs < end) {  in f2fs_update_extent_tree_range()
443 		org_end = dei.fofs + dei.len;  in f2fs_update_extent_tree_range()
446 		if (pos > dei.fofs &&	pos - dei.fofs >= F2FS_MIN_EXTENT_LEN) {  in f2fs_update_extent_tree_range()
447 			en->ei.len = pos - en->ei.fofs;  in f2fs_update_extent_tree_range()
455 						end - dei.fofs + dei.blk,  in f2fs_update_extent_tree_range()
461 				en->ei.fofs = end;  in f2fs_update_extent_tree_range()
462 				en->ei.blk += end - dei.fofs;  in f2fs_update_extent_tree_range()
463 				en->ei.len -= end - dei.fofs;  in f2fs_update_extent_tree_range()
511 		set_extent_info(&ei, fofs, blkaddr, len);  in f2fs_update_extent_tree_range()
693 	pgoff_t fofs;  in f2fs_update_extent_cache()  local
701 	fofs = start_bidx_of_node(ofs_of_node(dn->node_page), fi) +  in f2fs_update_extent_cache()
704 	if (f2fs_update_extent_tree_range(dn->inode, fofs, dn->data_blkaddr, 1))  in f2fs_update_extent_cache()
709 				pgoff_t fofs, block_t blkaddr, unsigned int len)  in f2fs_update_extent_cache_range()  argument
715 	if (f2fs_update_extent_tree_range(dn->inode, fofs, blkaddr, len))  in f2fs_update_extent_cache_range()