• Home
  • Raw
  • Download

Lines Matching refs:span

84     SkOpRayDir makeTestBase(SkOpSpan* span, double t) {  in makeTestBase()
86 fSpan = span; in makeTestBase()
87 fT = span->t() * (1 - t) + span->next()->t() * t; in makeTestBase()
88 SkOpSegment* segment = span->segment(); in makeTestBase()
171 SkOpSpan* span = this->windingSpanAtT(t); in rayCheck() local
172 if (!span) { in rayCheck()
174 } else if (!span->windValue() && !span->oppValue()) { in rayCheck()
181 newHit->fSpan = span; in rayCheck()
189 SkOpSpan* span = &fHead; in windingSpanAtT() local
192 next = span->next(); in windingSpanAtT()
197 return span; in windingSpanAtT()
199 } while (!next->final() && (span = next->upCast())); in windingSpanAtT()
275 SkOpSpan* span = hit->fSpan; in sortableTop() local
276 SkOpSegment* hitSegment = span ? span->segment() : nullptr; in sortableTop()
277 bool operand = span ? hitSegment->operand() : false; in sortableTop()
280 hit->fValid, operand, span ? span->debugID() : -1, ccw); in sortableTop()
281 if (span) { in sortableTop()
298 SkOpSpan* span = hit->fSpan; in sortableTop() local
299 if (!span) { in sortableTop()
302 SkOpSegment* hitSegment = span->segment(); in sortableTop()
303 if (span->windValue() == 0 && span->oppValue() == 0) { in sortableTop()
321 int windValue = ccw ? -span->windValue() : span->windValue(); in sortableTop()
322 int oppValue = ccw ? -span->oppValue() : span->oppValue(); in sortableTop()
326 int spanSum = span->windSum(); in sortableTop()
329 span->setWindSum(windSum); in sortableTop()
340 int oSpanSum = span->oppSum(); in sortableTop()
343 span->setOppSum(oppSum); in sortableTop()
355 … (void) hitSegment->markAndChaseWinding(span, span->next(), windSum, oppSum, nullptr); in sortableTop()
356 … (void) hitSegment->markAndChaseWinding(span->next(), span, windSum, oppSum, nullptr); in sortableTop()
369 SkOpSpan* span = &fHead; in findSortableTop() local
372 next = span->next(); in findSortableTop()
373 if (span->done()) { in findSortableTop()
376 if (span->windSum() != SK_MinS32) { in findSortableTop()
377 return span; in findSortableTop()
379 if (span->sortableTop(contourHead)) { in findSortableTop()
380 return span; in findSortableTop()
382 } while (!next->final() && (span = next->upCast())); in findSortableTop()