HomeSort by relevance Sort by last modified time
    Searched refs:fOppValue (Results 1 - 6 of 6) sorted by null

  /external/chromium_org/third_party/skia/src/pathops/
SkOpSpan.h 26 int fOppValue; // normally 0 -- when binary coincident edges combine, opp value goes here
SkPathOpsDebug.cpp 170 SK_ALWAYSBREAK(span.fOppValue == 0 || abs(span.fOppValue) == 1);
286 SK_ALWAYSBREAK(!span.fOppValue);
363 || lastOpp != fTs[i].fOppValue;
371 lastOpp = fTs[i].fOppValue;
434 SkDebugf(" windValue=%d oppValue=%d\n", fTs[i].fWindValue, fTs[i].fOppValue);
484 SkDebugf(" windValue=%d oppValue=%d\n", span.fWindValue, span.fOppValue);
502 sum += fTs[i].fOppValue;
503 slots[slotCount + fTs[i].fOther->fID - 1] = as_digit(fTs[i].fOppValue);
SkOpSegment.cpp 74 if (upSpan.fWindValue || upSpan.fOppValue) {
93 if (downSpan.fWindValue || downSpan.fOppValue) {
609 span->fOppValue = 0;
735 test->fOppValue--;
751 oTest->fOppValue--;
783 oTest->fOppValue--;
    [all...]
SkOpSegment.h 106 return fTs[tIndex].fWindValue == 0 && fTs[tIndex].fOppValue == 0;
135 int result = startIndex < endIndex ? -fTs[startIndex].fOppValue : fTs[endIndex].fOppValue;
152 return fTs[tIndex].fOppValue;
157 return fTs[lesser].fOppValue;
  /external/chromium_org/third_party/skia/tests/
PathOpsDebug.cpp 195 if (mSpan.fOppValue != 0 || mSpan.fOppSum != SK_MinS32) {
196 SkDebugf(" oppVal=%d", mSpan.fOppValue);
671 if (fOppSum != SK_MinS32 && (SkPathOpsDebug::ValidWind(fOppSum) || fOppValue != 0)) {
675 if (SkPathOpsDebug::ValidWind(fOppSum) || fOppValue != 0) {
676 SkDebugf(" oppValue=%d", fOppValue);
  /external/chromium_org/third_party/skia/experimental/Intersection/
Simplify.cpp 664 int fOppValue; // normally 0 -- when binary coincident edges combine, opp value goes here
    [all...]

Completed in 45 milliseconds