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