85 static u64 range_end(u64 start, u64 len)  in range_end()  argument
87 	if (start + len < start)  in range_end()
89 	return start + len;  in range_end()
98 	u64 end = range_end(em->start, em->len);  in tree_insert()
104 		if (em->start < entry->start)  in tree_insert()
106 		else if (em->start >= extent_map_end(entry))  in tree_insert()
113 	while (parent && em->start >= extent_map_end(entry)) {  in tree_insert()
118 		if (end > entry->start && em->start < extent_map_end(entry))  in tree_insert()
123 	while (parent && em->start < entry->start) {  in tree_insert()
128 		if (end > entry->start && em->start < extent_map_end(entry))  in tree_insert()
155 		if (offset < entry->start)  in __tree_search()
175 		while (prev && offset < prev_entry->start) {  in __tree_search()
209 	if (extent_map_end(prev) == next->start &&  in mergable_maps()
230 	if (em->start != 0) {  in try_merge_map()
235 			em->start = merge->start;  in try_merge_map()
275 int unpin_extent_cache(struct extent_map_tree *tree, u64 start, u64 len,  in unpin_extent_cache()  argument
283 	em = lookup_extent_mapping(tree, start, len);  in unpin_extent_cache()
285 	WARN_ON(!em || em->start != start);  in unpin_extent_cache()
292 	em->mod_start = em->start;  in unpin_extent_cache()
303 		em->mod_start = em->start;  in unpin_extent_cache()
326 	em->mod_start = em->start;  in setup_extent_mapping()
361 			u64 start, u64 len, int strict)  in __lookup_extent_mapping()  argument
367 	u64 end = range_end(start, len);  in __lookup_extent_mapping()
369 	rb_node = __tree_search(&tree->map, start, &prev, &next);  in __lookup_extent_mapping()
381 	if (strict && !(end > em->start && start < extent_map_end(em)))  in __lookup_extent_mapping()
400 					 u64 start, u64 len)  in lookup_extent_mapping()  argument
402 	return __lookup_extent_mapping(tree, start, len, 1);  in lookup_extent_mapping()
417 					 u64 start, u64 len)  in search_extent_mapping()  argument
419 	return __lookup_extent_mapping(tree, start, len, 0);  in search_extent_mapping()