Lines Matching defs:test
947 const SkOpSpanBase* test = &fHead;
949 int addCount = test->spanAddsCount();
954 const SkOpPtT* startPtT = test->ptT();
1006 // it contains spans of segments in test's loop but not including 'this'
1034 } while ((test = test->final() ? nullptr : test->upCast()->next()));
1049 const SkOpSpanBase* test = ptT->span();
1050 if (ptT->segment() == this && !ptT->deleted() && test != spanBase
1051 && test->ptT() == ptT) {
1052 if (test->final()) {
1058 } else if (test->prev()) {
1059 glitches->record(SkPathOpsDebug::kMoveNearbyRelease_Glitch, test, headPtT);
1070 const SkOpSpanBase* test = spanBase->upCast()->next();
1072 if (!this->spansNearby(spanBase, test, &found)) {
1073 glitches->record(SkPathOpsDebug::kMoveNearbyMergeFinal_Glitch, test);
1076 if (test->final()) {
1078 glitches->record(SkPathOpsDebug::kMoveNearbyMergeFinal_Glitch, test);
1087 spanBase = test;
1231 This should be rarely called -- the test below is thorough and time consuming.
1236 const SkOpAngle* test = this;
1238 const SkOpSegment* testSegment = test->segment();
1239 double testStartT = test->start()->t();
1241 double testEndT = test->end()->t();
1246 const SkOpAngle* next = test;
1256 double nextMidDistSq = nextSegment->distSq(nextMidT, test);
1257 double nextEndDistSq = nextSegment->distSq(nextEndT, test);
1269 test = test->fNext;
1270 } while (test->fNext != this);
1630 const SkOpSpanBase* test = start->upCast()->next();
1636 while (test != end || oTest != oEnd) {
1637 const SkOpPtT* containedOpp = test->ptT()->contains(oSeg);
1643 nextT = test->t();
1650 const SkOpSpanBase* walk = test;
1664 double startPart = (test->t() - priorT) / startRange;
1673 oPriorT + oStartRange * startPart, test)
1678 test = start;
1684 if (test != end) {
1685 FAIL_IF(!test->upCastable(), coin);
1686 priorT = test->t();
1687 test = test->upCast()->next();
1757 const SkCoincidentSpans* test = overlaps[index];
1758 if (overlap->coinPtTStart()->fT > test->coinPtTStart()->fT) {
1759 log->record(SkPathOpsDebug::kAddOrOverlap_Glitch, overlap, test->coinPtTStart());
1761 if (overlap->coinPtTEnd()->fT < test->coinPtTEnd()->fT) {
1762 log->record(SkPathOpsDebug::kAddOrOverlap_Glitch, overlap, test->coinPtTEnd());
1765 ? overlap->oppPtTStart()->fT < test->oppPtTStart()->fT
1766 : overlap->oppPtTStart()->fT > test->oppPtTStart()->fT) {
1767 log->record(SkPathOpsDebug::kAddOrOverlap_Glitch, overlap, test->oppPtTStart());
1770 ? overlap->oppPtTEnd()->fT > test->oppPtTEnd()->fT
1771 : overlap->oppPtTEnd()->fT < test->oppPtTEnd()->fT) {
1772 log->record(SkPathOpsDebug::kAddOrOverlap_Glitch, overlap, test->oppPtTEnd());
1774 if (!fHead) { this->debugRelease(log, fHead, test);
1775 this->debugRelease(log, fTop, test);
2006 const SkCoincidentSpans* test = fHead;
2008 if (coin == test) {
2011 if (coin->coinPtTStart() == test->coinPtTStart()
2012 && coin->oppPtTStart() == test->oppPtTStart()) {
2013 if (log) log->record(SkPathOpsDebug::kExpandCoin_Glitch, fHead, test->coinPtTStart());
2016 } while ((test = test->next()));
2074 void SkOpCoincidence::debugMarkCollapsed(SkPathOpsDebug::GlitchLog* log, const SkCoincidentSpans* coin, const SkOpPtT* test) const {
2077 if (coin->collapsed(test)) {
2091 void SkOpCoincidence::debugMarkCollapsed(SkPathOpsDebug::GlitchLog* log, const SkOpPtT* test) const {
2092 this->debugMarkCollapsed(log, fHead, test);
2093 this->debugMarkCollapsed(log, fTop, test);
2158 static void DebugCheckOverlap(const SkCoincidentSpans* test, const SkCoincidentSpans* list,
2163 const SkOpSegment* coinSeg = test->coinPtTStart()->segment();
2164 SkASSERT(coinSeg == test->coinPtTEnd()->segment());
2165 const SkOpSegment* oppSeg = test->oppPtTStart()->segment();
2166 SkASSERT(oppSeg == test->oppPtTEnd()->segment());
2167 SkASSERT(coinSeg != test->oppPtTStart()->segment());
2168 SkDEBUGCODE(double tcs = test->coinPtTStart()->fT);
2170 SkDEBUGCODE(double tce = test->coinPtTEnd()->fT);
2173 double tos = test->oppPtTStart()->fT;
2175 double toe = test->oppPtTEnd()->fT;
2220 const SkCoincidentSpans* test = head;
2221 while (test) {
2222 const SkCoincidentSpans* next = test->next();
2223 DebugCheckOverlap(test, next, log);
2224 DebugCheckOverlap(test, opt, log);
2225 test = next;
2421 const SkOpPtT* test = head;
2423 if (!test->coincident()) {
2426 coins->debugMarkCollapsed(log, test);
2427 } while ((test = test->next()) != head);
2476 const SkOpPtT* test = &fPtT;
2478 const SkOpPtT* stop = test;
2480 testNext = test->next();
2481 if (test->deleted()) {
2484 const SkOpSpanBase* testBase = test->span();
2485 SkASSERT(testBase->ptT() == test);
2486 const SkOpSegment* segment = test->segment();
2505 log->record(SkPathOpsDebug::kMergeMatches_Glitch, innerBase, test);
2507 SkASSERT(inner->fT != test->fT);
2508 if (!zero_or_one(test->fT)) {
2513 // test->setDeleted();
2534 } while ((test = testNext) != stop);
2675 // called only by test code
2718 const SkOpPtT* test = this;
2720 if (ptT == test) {
2723 test = test->next();
2738 const SkOpPtT* test = this;
2740 if (ptT == test) {
2743 test = test->next();