Lines Matching refs:missing
1964 MissingSpan& missing = missingSpans.push_back();
1965 missing.fOther = NULL;
1966 SkDEBUGCODE(sk_bzero(&missing, sizeof(missing)));
1967 missing.fPt = thisSpan->fPt;
1970 missing.fSegment = this;
1971 missing.fT = thisSpan->fT;
1974 missing.fSegment = other;
1975 missing.fT = oSpan.fT;
1990 MissingSpan& missing = missingSpans[index];
1991 SkOpSegment* missingOther = missing.fOther;
1992 if (missing.fSegment == missing.fOther) {
1997 if (missing.fSegment->containsT(missing.fT, missing.fOther, missing.fOtherT)) {
1999 SkDebugf("skip 1 id=%d t=%1.9g other=%d otherT=%1.9g\n", missing.fSegment->fID,
2000 missing.fT, missing.fOther->fID, missing.fOtherT);
2004 if (missing.fOther->containsT(missing.fOtherT, missing.fSegment, missing.fT)) {
2006 SkDebugf("skip 2 id=%d t=%1.9g other=%d otherT=%1.9g\n", missing.fOther->fID,
2007 missing.fOtherT, missing.fSegment->fID, missing.fT);
2013 if (missing.fSegment->inCoincidentSpan(missing.fT, missingOther)
2014 && missingOther->inCoincidentSpan(missing.fOtherT, this)) {
2018 if (missing.fSegment->coincidentSmall(missing.fPt, missing.fT, missingOther)
2019 && missingOther->coincidentSmall(missing.fPt, missing.fOtherT, missing.fSegment)) {
2022 const SkOpSpan* added = missing.fSegment->addTPair(missing.fT, missingOther,
2023 missing.fOtherT, false, missing.fPt);
2025 missing.fSegment->checkSmallCoincidence(*added, &missingCoincidence);
2029 MissingSpan& missing = missingSpans[index];
2030 missing.fSegment->fixOtherTIndex();
2031 missing.fOther->fixOtherTIndex();
2034 MissingSpan& missing = missingCoincidence[index];
2035 missing.fSegment->fixOtherTIndex();
2121 SkDebugf("%s id=%d missing t=%1.9g other=%d otherT=%1.9g pt=(%1.9g,%1.9g)\n",
2124 // this segment is missing a entry that the other contains
2125 // remember so we can add the missing one and recompute the indices
2127 MissingSpan& missing = missingSpans.push_back();
2128 SkDEBUGCODE(sk_bzero(&missing, sizeof(missing)));
2129 missing.fT = t;
2130 missing.fOther = match;
2131 missing.fOtherT = matchT;
2132 missing.fPt = peekSpan.fPt;
2146 MissingSpan& missing = missingSpans[index];
2147 if (this != missing.fOther) {
2148 addTPair(missing.fT, missing.fOther, missing.fOtherT, false, missing.fPt);
2170 const SkOpSpan* missing = NULL;
2172 CheckOneLink(test, oSpan, oFirst, oLast, &missing, missingSpans);
2176 CheckOneLink(test, oSpan, oFirst, oLast, &missing, missingSpans);
2274 // at this point, check for missing computed intersections
2316 MissingSpan& missing = missingSpans.push_back();
2317 missing.fOther = NULL;
2318 SkDEBUGCODE(sk_bzero(&missing, sizeof(missing)));
2319 missing.fPt = testPt;
2322 missing.fSegment = this;
2323 missing.fT = thisSpan->fT;
2326 missing.fSegment = other;
2327 missing.fT = oSpan.fT;
2330 if (!missingSpans.back().fOther || missing.fSegment->done()) {
2339 MissingSpan& missing = missingSpans[index];
2340 SkOpSegment* missingOther = missing.fOther;
2342 if (!missing.fSegment->addTPair(missing.fT, missingOther, missing.fOtherT, false,
2343 missing.fPt)) {
2346 int otherTIndex = missingOther->findT(missing.fOtherT, missing.fPt, missing.fSegment);
2353 missing.fSegment->addTCoincident(missing.fPt, nextSpan->fPt, nextSpan->fT,
2361 missing.fSegment->addTCancel(missing.fPt, priorSpan->fPt, missingOther);
2368 MissingSpan& missing = missingSpans[index];
2369 missing.fSegment->fixOtherTIndex();
2370 missing.fOther->fixOtherTIndex();
2474 MissingSpan missing;
2475 missing.fSegment = testOther;
2476 checkMultiple->push_back(missing);
2538 // this segment is missing a entry that the other contains
2539 // remember so we can add the missing one and recompute the indices
2540 MissingSpan& missing = missingSpans.push_back();
2541 SkDEBUGCODE(sk_bzero(&missing, sizeof(missing)));
2542 missing.fSegment = thisOther;
2543 missing.fT = thisSpan->fOtherT;
2544 missing.fOther = nextOther;
2545 missing.fOtherT = nextSpan->fOtherT;
2546 missing.fPt = thisSpan->fPt;
2555 MissingSpan& missing = missingSpans[index];
2556 if (missing.fSegment != missing.fOther) {
2557 missing.fSegment->addTPair(missing.fT, missing.fOther, missing.fOtherT, false,
2558 missing.fPt);
2563 MissingSpan& missing = missingSpans[index];
2564 missing.fSegment->fixOtherTIndex();
2565 missing.fOther->fixOtherTIndex();
