Lines Matching defs:SkASSERT
10 #undef SkASSERT
11 #define SkASSERT(cond) while (!(cond)) { sk_throw(); }
379 SkASSERT(edge.fPts[0].fY <= y);
460 SkASSERT(fFill && UlpsDiff(lastCurve[lastVerb].fY,
488 SkASSERT(lastCurve[lastVerb] == *curve[0] ||
632 SkASSERT(!fFill || count > 1);
675 SkASSERT(UlpsDiff(left.fPts[leftIndex < 0 ? 0 : left.fVerb].fY,
705 SkASSERT(fMismatches.count() == 0);
793 SkASSERT(0);
971 SkASSERT(fIntercepts.count() == 1);
973 SkASSERT(intercepts.fExplicit);
998 SkASSERT(0);
1012 SkASSERT(fIntercepts.count() == 1);
1014 SkASSERT(intercepts.fExplicit);
1015 SkASSERT(fVerbs.count() == 1);
1018 SkASSERT(fPts.count() == 3);
1021 SkASSERT(fVerbs[0] == SkPath::kCubic_Verb);
1022 SkASSERT(fPts.count() == 4);
1201 SkASSERT(fCurrentEdge);
1266 SkASSERT(fCurrentEdge);
1290 SkASSERT(fCurrentEdge);
1331 SkASSERT(fVerb < fEdge->fVerbs.end());
1337 SkASSERT(fPts >= fEdge->fPts.begin() + lastVerb());
1342 SkASSERT(fVerb > fEdge->fVerbs.begin());
1457 SkASSERT(fWorkEdge.fVerb[0] == SkPath::kLine_Verb);
1459 SkASSERT(pts == 1);
1472 SkASSERT(insertedAt + 2 == fTIndex);
1479 SkASSERT(fTIndex <= fTs->count() - fExplicitTs);
1493 SkASSERT(fWorkEdge.fEdge->fVerbs.begin() < fWorkEdge.fVerb);
1495 SkASSERT(fWorkEdge.fEdge->fPts.begin() <= fWorkEdge.fPts);
1498 SkASSERT(!fExplicitTs);
1529 SkASSERT(0);
1554 SkASSERT(tAbove != tBelow);
1561 SkASSERT(fTIndex + add >= 0);
1565 SkASSERT(fTIndex - ~add <= fTs->count() + 1);
1596 SkASSERT(fWorkEdge.verbIndex() <= fWorkEdge.fEdge->fIntercepts.count());
1607 SkASSERT(fVerb > SkPath::kMove_Verb);
1626 SkASSERT(0);
1688 SkASSERT(fVerb != SkPath::kLine_Verb
1758 SkASSERT(edge->fVerb == SkPath::kQuad_Verb);
1776 SkASSERT(fTIndex <= fTs->count() - fExplicitTs);
1786 SkASSERT(tIndex < fTs->count());
1819 SkASSERT(0);
1906 SkASSERT(0); // FIXME ? should this work?
1995 SkASSERT(0);
2014 SkASSERT(0);
2033 SkASSERT(0);
2037 SkASSERT(0);
2123 SkASSERT(0); // should never get here
2297 SkASSERT(index > 1);
2325 SkASSERT(activePtr == edgeList[index - 1]);
2326 SkASSERT(nextPtr == edgeList[index]);
2339 SkASSERT(activePtr == edgeList[index - 1]);
2340 SkASSERT(nextPtr == edgeList[index]);
2350 SkASSERT(activePtr == edgeList[index - 1]);
2351 SkASSERT(nextPtr == edgeList[index]);
2359 SkASSERT(activePtr == edgeList[index - 1]);
2360 SkASSERT(nextPtr == edgeList[index]);
2364 SkASSERT(activePtr == edgeList[index - 1]);
2365 SkASSERT(nextPtr == edgeList[index]);
2478 SkASSERT(!opener | !closer);
2506 SkASSERT(0);