562 	struct extent_state *cached;  in __clear_extent_bit()  local
598 		cached = *cached_state;  in __clear_extent_bit()
605 		if (cached && extent_state_in_tree(cached) &&  in __clear_extent_bit()
606 		    cached->start <= start && cached->end > start) {  in __clear_extent_bit()
608 				refcount_dec(&cached->refs);  in __clear_extent_bit()
609 			state = cached;  in __clear_extent_bit()
613 			free_extent_state(cached);  in __clear_extent_bit()
1251 		 * here for the first iteration. We might have a cached state  in convert_extent_bit()
1548  * @cached_state: A cached state to be used across multiple calls to this
1563 	struct extent_state *cached;  in count_range_bits()  local
1577 	cached = *cached_state;  in count_range_bits()
1579 	if (!extent_state_in_tree(cached))  in count_range_bits()
1582 	if (cached->start <= cur_start && cur_start <= cached->end) {  in count_range_bits()
1583 		state = cached;  in count_range_bits()
1584 	} else if (cached->start > cur_start) {  in count_range_bits()
1588 		 * The cached state starts after our search range's start. Check  in count_range_bits()
1592 		 * no previous state record, we can start from our cached state.  in count_range_bits()
1594 		prev = prev_state(cached);  in count_range_bits()
1596 			state = cached;  in count_range_bits()
1648 		   u32 bits, int filled, struct extent_state *cached)  in test_range_bit()  argument
1654 	if (cached && extent_state_in_tree(cached) && cached->start <= start &&  in test_range_bit()
1655 	    cached->end > start)  in test_range_bit()
1656 		state = cached;  in test_range_bit()
1721 		    struct extent_state **cached)  in try_lock_extent()  argument
1727 			       NULL, cached, NULL);  in try_lock_extent()
1731 					 EXTENT_LOCKED, cached);  in try_lock_extent()