Lines Matching defs:test
14 bool SkCoincidentSpans::collapsed(const SkOpPtT* test) const {
15 return (fCoinPtTStart == test && fCoinPtTEnd->contains(test))
16 || (fCoinPtTEnd == test && fCoinPtTStart->contains(test))
17 || (fOppPtTStart == test && fOppPtTEnd->contains(test))
18 || (fOppPtTEnd == test && fOppPtTStart->contains(test));
193 SkCoincidentSpans* test = fHead;
194 if (!test) {
212 if (coinSeg != test->coinPtTStart()->segment()) {
215 if (oppSeg != test->oppPtTStart()->segment()) {
218 double oTestMinT = std::min(test->oppPtTStart()->fT, test->oppPtTEnd()->fT);
219 double oTestMaxT = std::max(test->oppPtTStart()->fT, test->oppPtTEnd()->fT);
221 SkASSERT(test->coinPtTStart()->fT > coinPtTStart->fT
222 || coinPtTEnd->fT > test->coinPtTEnd()->fT
224 if ((test->coinPtTStart()->fT <= coinPtTEnd->fT
225 && coinPtTStart->fT <= test->coinPtTEnd()->fT)
227 test->extend(coinPtTStart, coinPtTEnd, oppPtTStart, oppPtTEnd);
230 } while ((test = test->next()));
285 int escapeHatch = 100000; // this is 100 times larger than the debugLoopLimit test
288 return false; // if triggered (likely by a fuzz-generated test) too complex to succeed
451 const SkOpSpanBase* test = start->upCast()->next();
457 while (test != end || oTest != oEnd) {
458 const SkOpPtT* containedOpp = test->ptT()->contains(oSeg);
464 nextT = test->t();
471 const SkOpSpanBase* walk = test;
485 double startPart = (test->t() - priorT) / startRange;
494 oPriorT + oStartRange * startPart, test, &startOver)
499 test = start;
505 if (test != end) {
506 FAIL_IF(!test->upCastable());
507 priorT = test->t();
508 test = test->upCast()->next();
673 SkCoincidentSpans* test = overlaps[index];
674 if (overlap->coinPtTStart()->fT > test->coinPtTStart()->fT) {
675 overlap->setCoinPtTStart(test->coinPtTStart());
677 if (overlap->coinPtTEnd()->fT < test->coinPtTEnd()->fT) {
678 overlap->setCoinPtTEnd(test->coinPtTEnd());
681 ? overlap->oppPtTStart()->fT < test->oppPtTStart()->fT
682 : overlap->oppPtTStart()->fT > test->oppPtTStart()->fT) {
683 overlap->setOppPtTStart(test->oppPtTStart());
686 ? overlap->oppPtTEnd()->fT > test->oppPtTEnd()->fT
687 : overlap->oppPtTEnd()->fT < test->oppPtTEnd()->fT) {
688 overlap->setOppPtTEnd(test->oppPtTEnd());
690 if (!fHead || !this->release(fHead, test)) {
691 SkAssertResult(this->release(fTop, test));
964 const SkCoincidentSpans* test = fHead;
965 if (!test) {
983 if (coinSeg != test->coinPtTStart()->segment()) {
986 if (coinPtTStart->fT < test->coinPtTStart()->fT) {
989 if (coinPtTEnd->fT > test->coinPtTEnd()->fT) {
992 if (oppSeg != test->oppPtTStart()->segment()) {
995 if (oppMinT < std::min(test->oppPtTStart()->fT, test->oppPtTEnd()->fT)) {
998 if (oppMaxT > std::max(test->oppPtTStart()->fT, test->oppPtTEnd()->fT)) {
1002 } while ((test = test->next()));
1215 SkCoincidentSpans* test = *headPtr;
1216 if (test->coinPtTStart()->segment()->done() || test->oppPtTStart()->segment()->done()) {
1217 *headPtr = test->next();
1236 SkCoincidentSpans* test = fHead;
1238 if (coin == test) {
1241 if (coin->coinPtTStart() == test->coinPtTStart()
1242 && coin->oppPtTStart() == test->oppPtTStart()) {
1243 this->release(fHead, test);
1246 } while ((test = test->next()));
1381 void SkOpCoincidence::markCollapsed(SkCoincidentSpans* coin, SkOpPtT* test) {
1384 if (coin->collapsed(test)) {
1398 void SkOpCoincidence::markCollapsed(SkOpPtT* test) {
1399 markCollapsed(fHead, test);
1400 markCollapsed(fTop, test);