Lines Matching defs:end
338 const char* end;
339 while ((end = strchr(s, '\n'))) {
340 SkDebugf("%.*s", end - s + 1, s);
341 s = end + 1;
836 // the end of C that the intersection is replaced with the end of C.
1241 double testEndT = test->end()->t();
1254 double nextEndT = next->end()->t();
1336 const SkOpSpan* minSpan = next->start()->starter(next->end());
1396 // sets the span's end to the ptT referenced by the previous-next
1443 const SkOpSpanBase* end = coinPtTEnd()->span();
1444 SkOpSpanBase* next = end->final() ? nullptr : end->upCast()->next();
1452 double midT = (end->t() + next->t()) / 2;
1556 is not the endpoint (i.e., there's an implied line connecting B-end and A)
1559 ptT list on B-segment adjacent to the B-end/A ptT loop (not in the loop, but
1561 coincident pair. If so, check for a new coincident span between B-end/A ptT loop
1577 if (!oOnEnd) { // if both are on end, any nearby intersect was already found
1626 const SkOpSpanBase* end = coin->coinPtTEnd()->span();
1636 while (test != end || oTest != oEnd) {
1681 end = coin->coinPtTEnd()->span();
1684 if (test != end) {
1873 // addifmissing adds to head freely then add saved head in the end
2034 const SkOpSpanBase* end = coin->coinPtTEndWritable()->span();
2035 // SkASSERT(end->deleted());
2048 end->debugInsertCoinEnd(log, oEnd);
2055 while ((next = next->upCast()->next()) != end) {
2115 static void DebugCheckBetween(const SkOpSpanBase* next, const SkOpSpanBase* end,
2118 SkASSERT(next != end);
2119 SkASSERT(!next->contains(end) || log);
2120 if (next->t() > end->t()) {
2122 swap(next, end);
2155 } while (next != end && (next = next->upCast()->next()));
2444 SkDebugf("*** bad coincident end loop ***\n");
2563 const SkOpSpanBase* end = *endPtr;
2564 SkASSERT(this->segment() == end->segment());
2566 if (t() < end->t()) {
2569 result = end;
2748 const SkOpPtT* SkOpPtT::debugEnder(const SkOpPtT* end) const {
2749 return fT < end->fT ? end : this;