Home
last modified time | relevance | path

Searched refs:startPt (Results 1 – 14 of 14) sorted by relevance

/external/chromium_org/third_party/skia/gm/
Ddegeneratesegments.cpp40 static SkPoint AddMove(SkPath& path, SkPoint& startPt) { in AddMove() argument
41 SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1); in AddMove()
46 static SkPoint AddMoveClose(SkPath& path, SkPoint& startPt) { in AddMoveClose() argument
47 SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1); in AddMoveClose()
53 static SkPoint AddDegenLine(SkPath& path, SkPoint& startPt) { in AddDegenLine() argument
54 path.lineTo(startPt); in AddDegenLine()
55 return startPt; in AddDegenLine()
58 static SkPoint AddMoveDegenLine(SkPath& path, SkPoint& startPt) { in AddMoveDegenLine() argument
59 SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1); in AddMoveDegenLine()
65 static SkPoint AddMoveDegenLineClose(SkPath& path, SkPoint& startPt) { in AddMoveDegenLineClose() argument
[all …]
/external/skia/gm/
Ddegeneratesegments.cpp40 static SkPoint AddMove(SkPath& path, SkPoint& startPt) { in AddMove() argument
41 SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1); in AddMove()
46 static SkPoint AddMoveClose(SkPath& path, SkPoint& startPt) { in AddMoveClose() argument
47 SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1); in AddMoveClose()
53 static SkPoint AddDegenLine(SkPath& path, SkPoint& startPt) { in AddDegenLine() argument
54 path.lineTo(startPt); in AddDegenLine()
55 return startPt; in AddDegenLine()
58 static SkPoint AddMoveDegenLine(SkPath& path, SkPoint& startPt) { in AddMoveDegenLine() argument
59 SkPoint moveToPt = startPt + SkPoint::Make(0, 10*SK_Scalar1); in AddMoveDegenLine()
65 static SkPoint AddMoveDegenLineClose(SkPath& path, SkPoint& startPt) { in AddMoveDegenLineClose() argument
[all …]
/external/chromium_org/third_party/skia/experimental/Intersection/
DIntersections.cpp12 const _Point& startPt, const _Point& endPt) { in insertCoincidentPair() argument
14 remove(s2, e2, startPt, endPt); in insertCoincidentPair()
16 remove(s1, e1, startPt, endPt); in insertCoincidentPair()
37 bool s1in = between(cs1, s1, ce1) || startPt.approximatelyEqual(fPt[i1]) in insertCoincidentPair()
38 || startPt.approximatelyEqual(fPt[iEnd1]); in insertCoincidentPair()
51 bool s2in = between(cs2, s2, ce2) || startPt.approximatelyEqual(fPt[i2]) in insertCoincidentPair()
52 || startPt.approximatelyEqual(fPt[iEnd2]); in insertCoincidentPair()
58 fPt[i1] = startPt; in insertCoincidentPair()
65 fPt[iEnd1] = startPt; in insertCoincidentPair()
88 insertCoincident(s1, s2, startPt); in insertCoincidentPair()
[all …]
DQuadraticBounds.cpp17 _Point startPt; in leftMostT() local
18 xy_at_t(quad, startT, startPt.x, startPt.y); in leftMostT()
21 return startPt.x <= endPt.x ? startT : endT; in leftMostT()
DIntersections.h69 const _Point& startPt, const _Point& endPt);
139 void remove(double one, double two, const _Point& startPt, const _Point& endPt);
/external/skia/experimental/Intersection/
DIntersections.cpp12 const _Point& startPt, const _Point& endPt) { in insertCoincidentPair() argument
14 remove(s2, e2, startPt, endPt); in insertCoincidentPair()
16 remove(s1, e1, startPt, endPt); in insertCoincidentPair()
37 bool s1in = between(cs1, s1, ce1) || startPt.approximatelyEqual(fPt[i1]) in insertCoincidentPair()
38 || startPt.approximatelyEqual(fPt[iEnd1]); in insertCoincidentPair()
51 bool s2in = between(cs2, s2, ce2) || startPt.approximatelyEqual(fPt[i2]) in insertCoincidentPair()
52 || startPt.approximatelyEqual(fPt[iEnd2]); in insertCoincidentPair()
58 fPt[i1] = startPt; in insertCoincidentPair()
65 fPt[iEnd1] = startPt; in insertCoincidentPair()
88 insertCoincident(s1, s2, startPt); in insertCoincidentPair()
[all …]
DQuadraticBounds.cpp17 _Point startPt; in leftMostT() local
18 xy_at_t(quad, startT, startPt.x, startPt.y); in leftMostT()
21 return startPt.x <= endPt.x ? startT : endT; in leftMostT()
DIntersections.h69 const _Point& startPt, const _Point& endPt);
139 void remove(double one, double two, const _Point& startPt, const _Point& endPt);
/external/skia/src/pathops/
DSkOpContour.cpp102 const SkPoint& startPt = coincidence.fPts[0][startSwapped]; in addCoincidentPoints() local
106 || thisOne.isMissing(startT, startPt) || other.isMissing(oEndT, startPt)) { in addCoincidentPoints()
107 thisOne.addTPair(startT, &other, oEndT, true, startPt, in addCoincidentPoints()
118 || thisOne.isMissing(startT, startPt) || other.isMissing(oStartT, startPt)) { in addCoincidentPoints()
119 thisOne.addTPair(startT, &other, oStartT, true, startPt, in addCoincidentPoints()
501 const SkPoint* startPt = &coincidence.fPts[0][0]; in joinCoincidence() local
506 SkTSwap(startPt, endPt); in joinCoincidence()
515 const SkPoint& oMatchStartPt = cancel ? *endPt : *startPt; in joinCoincidence()
519 (void) other.joinCoincidence(&thisOne, startT, *startPt, step, cancel); in joinCoincidence()
549 const SkPoint* startPt = &coincidence.fPts[0][0]; in calcCommonCoincidentWinding() local
[all …]
DSkOpSegment.h284 void addTCancel(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
285 void addTCoincident(const SkPoint& startPt, const SkPoint& endPt, double endT,
313 int step, SkPoint* startPt, SkPoint* endPt, double* endT) const;
399 void addCancelOutsides(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
400 void addCoinOutsides(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
472 void setCoincidentRange(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
479 const SkPoint& startPt);
480 static void TrackOutside(SkTArray<SkPoint, true>* outsideTs, const SkPoint& startPt);
DSkOpSegment.cpp212 void SkOpSegment::addCancelOutsides(const SkPoint& startPt, const SkPoint& endPt, in addCancelOutsides() argument
220 } while (startPt != fTs[tIndex].fPt && tIndex < tCount); in addCancelOutsides()
229 SkASSERT(fTs[tIndex].fT < 1 || startPt != *nextPt); in addCancelOutsides()
230 } while (startPt == *nextPt); in addCancelOutsides()
289 void SkOpSegment::addCoinOutsides(const SkPoint& startPt, const SkPoint& endPt, in addCoinOutsides() argument
298 } while (startPt != fTs[tIndex].fPt); in addCoinOutsides()
303 if (startPt != span.fPt) { in addCoinOutsides()
306 if (span.fOther == other && span.fPt == startPt) { in addCoinOutsides()
313 } while (startPt != other->fTs[oIndex].fPt); in addCoinOutsides()
319 if (startPt != oSpan.fPt) { in addCoinOutsides()
[all …]
/external/chromium_org/third_party/skia/src/pathops/
DSkOpContour.cpp102 const SkPoint& startPt = coincidence.fPts[0][startSwapped]; in addCoincidentPoints() local
106 || thisOne.isMissing(startT, startPt) || other.isMissing(oEndT, startPt)) { in addCoincidentPoints()
107 thisOne.addTPair(startT, &other, oEndT, true, startPt, in addCoincidentPoints()
118 || thisOne.isMissing(startT, startPt) || other.isMissing(oStartT, startPt)) { in addCoincidentPoints()
119 thisOne.addTPair(startT, &other, oStartT, true, startPt, in addCoincidentPoints()
501 const SkPoint* startPt = &coincidence.fPts[0][0]; in joinCoincidence() local
506 SkTSwap(startPt, endPt); in joinCoincidence()
515 const SkPoint& oMatchStartPt = cancel ? *endPt : *startPt; in joinCoincidence()
519 (void) other.joinCoincidence(&thisOne, startT, *startPt, step, cancel); in joinCoincidence()
549 const SkPoint* startPt = &coincidence.fPts[0][0]; in calcCommonCoincidentWinding() local
[all …]
DSkOpSegment.h284 void addTCancel(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
285 void addTCoincident(const SkPoint& startPt, const SkPoint& endPt, double endT,
313 int step, SkPoint* startPt, SkPoint* endPt, double* endT) const;
399 void addCancelOutsides(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
400 void addCoinOutsides(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
472 void setCoincidentRange(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
479 const SkPoint& startPt);
480 static void TrackOutside(SkTArray<SkPoint, true>* outsideTs, const SkPoint& startPt);
DSkOpSegment.cpp212 void SkOpSegment::addCancelOutsides(const SkPoint& startPt, const SkPoint& endPt, in addCancelOutsides() argument
220 } while (startPt != fTs[tIndex].fPt && tIndex < tCount); in addCancelOutsides()
229 SkASSERT(fTs[tIndex].fT < 1 || startPt != *nextPt); in addCancelOutsides()
230 } while (startPt == *nextPt); in addCancelOutsides()
289 void SkOpSegment::addCoinOutsides(const SkPoint& startPt, const SkPoint& endPt, in addCoinOutsides() argument
298 } while (startPt != fTs[tIndex].fPt); in addCoinOutsides()
303 if (startPt != span.fPt) { in addCoinOutsides()
306 if (span.fOther == other && span.fPt == startPt) { in addCoinOutsides()
313 } while (startPt != other->fTs[oIndex].fPt); in addCoinOutsides()
319 if (startPt != oSpan.fPt) { in addCoinOutsides()
[all …]