Searched defs:opp (Results 1 - 13 of 13) sorted by relevance

/external/skia/src/pathops/
H A DSkDConicLineIntersection.cpp127 double opp = (*fLine)[1].fY - (*fLine)[0].fY; local
130 r[n] = (fConic[n].fY - (*fLine)[0].fY) * adj - (fConic[n].fX - (*fLine)[0].fX) * opp;
H A DSkDCubicLineIntersection.cpp123 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 DSkDQuadLineIntersection.cpp156 double opp = (*fLine)[1].fY - (*fLine)[0].fY; local
159 r[n] = (fQuad[n].fY - (*fLine)[0].fY) * adj - (fQuad[n].fX - (*fLine)[0].fX) * opp;
H A DSkOpSpan.cpp153 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 DSkOpSpan.h34 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 DSkPathOpsCubic.cpp164 double opp = endPt[1]->fY - origY; local
167 double sign = (fPts[oddMan].fY - origY) * adj - (fPts[oddMan].fX - origX) * opp;
169 double sign2 = (fPts[oddMan2].fY - origY) * adj - (fPts[oddMan2].fX - origX) * opp;
182 double test = (pts[n].fY - origY) * adj - (pts[n].fX - origX) * opp;
H A DSkPathOpsQuad.cpp51 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 DSkOpCoincidence.cpp163 const SkOpPtT* opp = next->contains(oppSeg); local
164 if (!opp) {
168 if ((oppLastT > opp->fT) != flipped) {
172 oppLastT = opp->fT;
913 bool SkOpCoincidence::contains(const SkOpSegment* seg, const SkOpSegment* opp, double oppT) const { argument
914 if (this->contains(fHead, seg, opp, oppT)) {
917 if (this->contains(fTop, seg, opp, oppT)) {
924 const SkOpSegment* opp, double oppT) const {
929 if (coin->coinPtTStart()->segment() == seg && coin->oppPtTStart()->segment() == opp
933 if (coin->oppPtTStart()->segment() == seg && coin->coinPtTStart()->segment() == opp
923 contains(const SkCoincidentSpans* coin, const SkOpSegment* seg, const SkOpSegment* opp, double oppT) const argument
[all...]
H A DSkOpSegment.cpp191 const SkOpPtT* SkOpSegment::existing(double t, const SkOpSegment* opp) const {
206 if (!opp) {
219 return opp && !test->contains(opp) ? nullptr : testPtT;
811 bool SkOpSegment::isClose(double t, const SkOpSegment* opp) const {
816 (*CurveIntersectRay[opp->verb()])(opp->pts(), opp->weight(), perp, &i);
1092 SkOpSegment* opp = ptT->segment(); local
1093 opp
1122 SkOpSegment* opp = ptT->span()->segment(); local
[all...]
H A DSkPathOpsTSect.h124 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
1333 intersects(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp, SkTSpan<OppCurve, TCurve>* oppSpan, int* oppResult) argument
1388 is_parallel(const SkDLine& thisLine, const TCurve& opp) argument
1416 linesIntersect(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp, SkTSpan<OppCurve, TCurve>* oppSpan, SkIntersections* i) argument
1697 removeAllBut(const SkTSpan<OppCurve, TCurve>* keep, SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp) argument
1718 removeByPerpendicular(SkTSect<OppCurve, TCurve>* opp) argument
1790 removeSpans(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp) argument
1835 trim(SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp) argument
[all...]
H A DSkPathOpsDebug.cpp136 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...]
/external/blktrace/btt/
H A Doutput.c863 struct __op *opp = arg; local
864 output_regions(opp->ofp, pip->name, &pip->regions, opp->base);
865 opp->base += 1.0;
/external/tcpdump/
H A Dprint-icmp6.c1259 const struct nd_opt_prefix_info *opp; local
1304 opp = (struct nd_opt_prefix_info *)op;
1305 ND_TCHECK(opp->nd_opt_pi_prefix);
1307 ip6addr_string(ndo, &opp->nd_opt_pi_prefix),
1308 opp->nd_opt_pi_prefix_len,
1310 bittok2str(icmp6_opt_pi_flag_values, "none", opp->nd_opt_pi_flags_reserved),
1311 get_lifetime(EXTRACT_32BITS(&opp->nd_opt_pi_valid_time))));
1312 ND_PRINT((ndo,", pref. time %s", get_lifetime(EXTRACT_32BITS(&opp->nd_opt_pi_preferred_time))));

Completed in 238 milliseconds