/external/swiftshader/third_party/subzero/src/ |
H A D | IceConditionCodesX8664.h | 28 #define X(val, encode, opp, dump, emit) val = encode,
|
H A D | IceConditionCodesARM32.h | 32 #define X(tag, encode, opp, emit) tag = encode,
|
H A D | IceConditionCodesMIPS32.h | 32 #define X(tag, opp, emit) tag,
|
H A D | IceConditionCodesX8632.h | 32 #define X(val, encode, opp, dump, emit) val = encode,
|
/external/skia/src/pathops/ |
H A D | SkOpSpan.h | 34 void addOpp(SkOpPtT* opp, SkOpPtT* oppPrev) { argument 36 SkASSERT(this != opp); 37 this->fNext = opp; 54 void debugAddOpp(const SkOpPtT* opp, const SkOpPtT* oppPrev) const; 63 const SkOpPtT* debugOppPrev(const SkOpPtT* opp) const; 103 // returns nullptr if this is already in the opp ptT loop 104 SkOpPtT* oppPrev(const SkOpPtT* opp) const { 105 // find the fOpp ptr to opp 106 SkOpPtT* oppPrev = opp->fNext; 110 while (oppPrev->fNext != opp) { [all...] |
H A D | SkPathOpsTSect.h | 124 SkTSpan<OppCurve, TCurve>* findOppSpan(const SkTSpan<OppCurve, TCurve>* opp) const; 158 bool onlyEndPointsInCommon(const SkTSpan<OppCurve, TCurve>* opp, bool* start, 166 bool removeBounded(const SkTSpan<OppCurve, TCurve>* opp); 196 int hullCheck(const SkTSpan<OppCurve, TCurve>* opp, bool* start, bool* oppStart); 299 int intersects(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp, 301 bool isParallel(const SkDLine& thisLine, const SkTSect<OppCurve, TCurve>* opp) const; 302 int linesIntersect(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp, 310 void removeByPerpendicular(SkTSect<OppCurve, TCurve>* opp); 314 SkTSect<OppCurve, TCurve>* opp); 317 void removeSpans(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp); 426 SkTSpan<TCurve, OppCurve>* opp = this->spanAtT(t, &priorSpan); local 519 hullCheck(const SkTSpan<OppCurve, TCurve>* opp, bool* start, bool* oppStart) argument 547 hullsIntersect(SkTSpan<OppCurve, TCurve>* opp, bool* start, bool* oppStart) argument 632 double opp = fPart[end].fY - origY; local 658 onlyEndPointsInCommon(const SkTSpan<OppCurve, TCurve>* opp, bool* start, bool* oppStart, bool* ptsInCommon) argument 710 SkTSpan<OppCurve, TCurve>* opp = bounded->fBounded; local 718 removeBounded(const SkTSpan<OppCurve, TCurve>* opp) argument 920 const OppCurve& opp = sect2->fCurve; local 1087 const OppCurve& opp = sect2->fCurve; local 1337 intersects(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp, SkTSpan<OppCurve, TCurve>* oppSpan, int* oppResult) argument 1392 is_parallel(const SkDLine& thisLine, const TCurve& opp) argument 1420 linesIntersect(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp, SkTSpan<OppCurve, TCurve>* oppSpan, SkIntersections* i) argument 1701 removeAllBut(const SkTSpan<OppCurve, TCurve>* keep, SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp) argument 1722 removeByPerpendicular(SkTSect<OppCurve, TCurve>* opp) argument 1799 removeSpans(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp) argument 1844 trim(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp) argument [all...] |
H A D | SkPathOpsQuad.cpp | 54 double opp = endPt[1]->fY - origY; local 55 double sign = (fPts[oddMan].fY - origY) * adj - (fPts[oddMan].fX - origX) * opp; 62 double test = (q2[n].fY - origY) * adj - (q2[n].fX - origX) * opp; 93 oddMan opp x=oddMan^opp x=x-oddMan m=x>>2 x&~m 102 for (int opp = 1; opp < kPointCount; ++opp) { 103 int end = (oddMan ^ opp) - oddMan; // choose a value not equal to oddMan 105 endPt[opp [all...] |
H A D | SkOpSpan.cpp | 153 void SkOpSpanBase::addOpp(SkOpSpanBase* opp) { argument 154 SkOpPtT* oppPrev = this->ptT()->oppPrev(opp->ptT()); 158 this->mergeMatches(opp); 159 this->ptT()->addOpp(opp->ptT(), oppPrev); 304 void SkOpSpanBase::mergeMatches(SkOpSpanBase* opp) { argument 319 SkOpPtT* inner = opp->ptT();
|
H A D | SkPathOpsCurve.cpp | 13 double SkDCurve::nearPoint(SkPath::Verb verb, const SkDPoint& xy, const SkDPoint& opp) const { 34 SkDLine perp = {{ xy, { xy.fX + opp.fY - xy.fY, xy.fY + xy.fX - opp.fX }}};
|
H A D | SkOpSegment.cpp | 192 const SkOpPtT* SkOpSegment::existing(double t, const SkOpSegment* opp) const { 207 if (!opp) { 220 return opp && !test->contains(opp) ? nullptr : testPtT; 810 bool SkOpSegment::isClose(double t, const SkOpSegment* opp) const { 815 (*CurveIntersectRay[opp->verb()])(opp->pts(), opp->weight(), perp, &i); 1091 SkOpSegment* opp = ptT->segment(); local 1092 opp 1121 SkOpSegment* opp = ptT->span()->segment(); local [all...] |
H A D | SkOpSegment.h | 78 SkOpPtT* addMissing(double t, SkOpSegment* opp, bool* allExist); 186 double distSq(double t, const SkOpAngle* opp) const; 213 const SkOpPtT* existing(double t, const SkOpSegment* opp) const; 248 bool isClose(double t, const SkOpSegment* opp) const; 396 const SkOpSpanBase* spanBase, const SkOpSegment* opp) const;
|
H A D | SkPathOpsDebug.cpp | 136 const SkCoincidentSpans* opp = NULL) { 140 if (opp) { 141 glitch->fOppSpan = opp->coinPtTStart(); 142 glitch->fOppEndSpan = opp->coinPtTEnd(); 844 const SkOpSegment* opp = ptT->segment(); local 845 opp->resetDebugVisited(); 876 const SkOpSegment* opp = ptT->span()->segment(); local 877 if (opp->done()) { 880 // when opp is encounted the 1st time, continue; on 2nd encounter, look for coincidence 881 if (!opp 1350 int opp = 0; local 2710 debugAddOpp(const SkOpPtT* opp, const SkOpPtT* oppPrev) const argument [all...] |
H A D | SkDCubicLineIntersection.cpp | 123 double opp = fLine[1].fY - fLine[0].fY; local 127 c[n].fX = (fCubic[n].fY - fLine[0].fY) * adj - (fCubic[n].fX - fLine[0].fX) * opp; 136 c[n].fY = (fCubic[n].fY - fLine[0].fY) * opp
|
H A D | SkOpCoincidence.h | 237 static bool Ordered(const SkOpSegment* coin, const SkOpSegment* opp); 264 bool contains(const SkOpSegment* seg, const SkOpSegment* opp, double oppT) const; 266 const SkOpSegment* opp, double oppT) const;
|
/external/skqp/src/pathops/ |
H A D | SkOpSpan.h | 34 void addOpp(SkOpPtT* opp, SkOpPtT* oppPrev) { argument 36 SkASSERT(this != opp); 37 this->fNext = opp; 54 void debugAddOpp(const SkOpPtT* opp, const SkOpPtT* oppPrev) const; 63 const SkOpPtT* debugOppPrev(const SkOpPtT* opp) const; 103 // returns nullptr if this is already in the opp ptT loop 104 SkOpPtT* oppPrev(const SkOpPtT* opp) const { 105 // find the fOpp ptr to opp 106 SkOpPtT* oppPrev = opp->fNext; 110 while (oppPrev->fNext != opp) { [all...] |
H A D | SkPathOpsTSect.h | 124 SkTSpan<OppCurve, TCurve>* findOppSpan(const SkTSpan<OppCurve, TCurve>* opp) const; 158 bool onlyEndPointsInCommon(const SkTSpan<OppCurve, TCurve>* opp, bool* start, 166 bool removeBounded(const SkTSpan<OppCurve, TCurve>* opp); 196 int hullCheck(const SkTSpan<OppCurve, TCurve>* opp, bool* start, bool* oppStart); 299 int intersects(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp, 301 bool isParallel(const SkDLine& thisLine, const SkTSect<OppCurve, TCurve>* opp) const; 302 int linesIntersect(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp, 310 void removeByPerpendicular(SkTSect<OppCurve, TCurve>* opp); 314 SkTSect<OppCurve, TCurve>* opp); 317 void removeSpans(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp); 426 SkTSpan<TCurve, OppCurve>* opp = this->spanAtT(t, &priorSpan); local 519 hullCheck(const SkTSpan<OppCurve, TCurve>* opp, bool* start, bool* oppStart) argument 547 hullsIntersect(SkTSpan<OppCurve, TCurve>* opp, bool* start, bool* oppStart) argument 632 double opp = fPart[end].fY - origY; local 658 onlyEndPointsInCommon(const SkTSpan<OppCurve, TCurve>* opp, bool* start, bool* oppStart, bool* ptsInCommon) argument 710 SkTSpan<OppCurve, TCurve>* opp = bounded->fBounded; local 718 removeBounded(const SkTSpan<OppCurve, TCurve>* opp) argument 920 const OppCurve& opp = sect2->fCurve; local 1087 const OppCurve& opp = sect2->fCurve; local 1337 intersects(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp, SkTSpan<OppCurve, TCurve>* oppSpan, int* oppResult) argument 1392 is_parallel(const SkDLine& thisLine, const TCurve& opp) argument 1420 linesIntersect(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp, SkTSpan<OppCurve, TCurve>* oppSpan, SkIntersections* i) argument 1701 removeAllBut(const SkTSpan<OppCurve, TCurve>* keep, SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp) argument 1722 removeByPerpendicular(SkTSect<OppCurve, TCurve>* opp) argument 1799 removeSpans(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp) argument 1844 trim(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp) argument [all...] |
H A D | SkPathOpsQuad.cpp | 51 double opp = endPt[1]->fY - origY; local 52 double sign = (fPts[oddMan].fY - origY) * adj - (fPts[oddMan].fX - origX) * opp; 59 double test = (q2[n].fY - origY) * adj - (q2[n].fX - origX) * opp; 90 oddMan opp x=oddMan^opp x=x-oddMan m=x>>2 x&~m 99 for (int opp = 1; opp < kPointCount; ++opp) { 100 int end = (oddMan ^ opp) - oddMan; // choose a value not equal to oddMan 102 endPt[opp [all...] |
H A D | SkOpSpan.cpp | 153 void SkOpSpanBase::addOpp(SkOpSpanBase* opp) { argument 154 SkOpPtT* oppPrev = this->ptT()->oppPrev(opp->ptT()); 158 this->mergeMatches(opp); 159 this->ptT()->addOpp(opp->ptT(), oppPrev); 304 void SkOpSpanBase::mergeMatches(SkOpSpanBase* opp) { argument 319 SkOpPtT* inner = opp->ptT();
|
H A D | SkPathOpsCurve.cpp | 13 double SkDCurve::nearPoint(SkPath::Verb verb, const SkDPoint& xy, const SkDPoint& opp) const { 34 SkDLine perp = {{ xy, { xy.fX + opp.fY - xy.fY, xy.fY + xy.fX - opp.fX }}};
|
H A D | SkOpSegment.cpp | 192 const SkOpPtT* SkOpSegment::existing(double t, const SkOpSegment* opp) const { 207 if (!opp) { 220 return opp && !test->contains(opp) ? nullptr : testPtT; 810 bool SkOpSegment::isClose(double t, const SkOpSegment* opp) const { 815 (*CurveIntersectRay[opp->verb()])(opp->pts(), opp->weight(), perp, &i); 1091 SkOpSegment* opp = ptT->segment(); local 1092 opp 1121 SkOpSegment* opp = ptT->span()->segment(); local [all...] |
H A D | SkOpSegment.h | 78 SkOpPtT* addMissing(double t, SkOpSegment* opp, bool* allExist); 186 double distSq(double t, const SkOpAngle* opp) const; 213 const SkOpPtT* existing(double t, const SkOpSegment* opp) const; 248 bool isClose(double t, const SkOpSegment* opp) const; 396 const SkOpSpanBase* spanBase, const SkOpSegment* opp) const;
|
H A D | SkPathOpsDebug.cpp | 136 const SkCoincidentSpans* opp = NULL) { 140 if (opp) { 141 glitch->fOppSpan = opp->coinPtTStart(); 142 glitch->fOppEndSpan = opp->coinPtTEnd(); 844 const SkOpSegment* opp = ptT->segment(); local 845 opp->resetDebugVisited(); 876 const SkOpSegment* opp = ptT->span()->segment(); local 877 if (opp->done()) { 880 // when opp is encounted the 1st time, continue; on 2nd encounter, look for coincidence 881 if (!opp 1350 int opp = 0; local 2710 debugAddOpp(const SkOpPtT* opp, const SkOpPtT* oppPrev) const argument [all...] |
H A D | SkDCubicLineIntersection.cpp | 123 double opp = fLine[1].fY - fLine[0].fY; local 127 c[n].fX = (fCubic[n].fY - fLine[0].fY) * adj - (fCubic[n].fX - fLine[0].fX) * opp; 136 c[n].fY = (fCubic[n].fY - fLine[0].fY) * opp
|
/external/skia/tests/ |
H A D | PathOpsTSectDebug.h | 64 void SkTSect<TCurve, OppCurve>::dumpBoth(SkTSect<OppCurve, TCurve>* opp) const { 71 opp->dump(); 78 if (opp->fHead) { 79 opp->dumpCurves();
|
/external/skqp/tests/ |
H A D | PathOpsTSectDebug.h | 64 void SkTSect<TCurve, OppCurve>::dumpBoth(SkTSect<OppCurve, TCurve>* opp) const { 71 opp->dump(); 78 if (opp->fHead) { 79 opp->dumpCurves();
|