Lines Matching refs:intvl
72 if (Interval* intvl = fIntvlHash.find(proxy->uniqueID().asUInt())) { variable
79 SkASSERT(0 == intvl->start());
83 SkASSERT(intvl->start() <= start && intvl->end() >= end);
85 SkASSERT(intvl->end() <= start && intvl->end() <= end);
88 intvl->extendEnd(end);
137 void GrResourceAllocator::IntervalList::insertByIncreasingStart(Interval* intvl) { in insertByIncreasingStart() argument
139 SkASSERT(!intvl->next()); in insertByIncreasingStart()
143 fHead = fTail = intvl; in insertByIncreasingStart()
144 } else if (intvl->start() <= fHead->start()) { in insertByIncreasingStart()
146 intvl->setNext(fHead); in insertByIncreasingStart()
147 fHead = intvl; in insertByIncreasingStart()
148 } else if (fTail->start() <= intvl->start()) { in insertByIncreasingStart()
150 fTail->setNext(intvl); in insertByIncreasingStart()
151 fTail = intvl; in insertByIncreasingStart()
156 for (; intvl->start() > next->start(); prev = next, next = next->next()) { in insertByIncreasingStart()
160 intvl->setNext(next); in insertByIncreasingStart()
161 prev->setNext(intvl); in insertByIncreasingStart()
168 void GrResourceAllocator::IntervalList::insertByIncreasingEnd(Interval* intvl) { in insertByIncreasingEnd() argument
170 SkASSERT(!intvl->next()); in insertByIncreasingEnd()
174 fHead = fTail = intvl; in insertByIncreasingEnd()
175 } else if (intvl->end() <= fHead->end()) { in insertByIncreasingEnd()
177 intvl->setNext(fHead); in insertByIncreasingEnd()
178 fHead = intvl; in insertByIncreasingEnd()
179 } else if (fTail->end() <= intvl->end()) { in insertByIncreasingEnd()
181 fTail->setNext(intvl); in insertByIncreasingEnd()
182 fTail = intvl; in insertByIncreasingEnd()
187 for (; intvl->end() > next->end(); prev = next, next = next->next()) { in insertByIncreasingEnd()
191 intvl->setNext(next); in insertByIncreasingEnd()
192 prev->setNext(intvl); in insertByIncreasingEnd()