/external/skia/gm/ |
H A D | degeneratesegments.cpp | 117 SkPoint endPt = startPt + SkPoint::Make(40*SK_Scalar1, 0); local 118 path.lineTo(endPt); 119 return endPt; 124 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local 126 path.lineTo(endPt); 127 return endPt; 132 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local 134 path.lineTo(endPt); 136 return endPt; 141 SkPoint endPt local 149 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local 158 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local 168 SkPoint endPt = startPt + SkPoint::Make(40*SK_Scalar1, 0); local 177 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local 187 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local [all...] |
/external/skqp/gm/ |
H A D | degeneratesegments.cpp | 117 SkPoint endPt = startPt + SkPoint::Make(40*SK_Scalar1, 0); local 118 path.lineTo(endPt); 119 return endPt; 124 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local 126 path.lineTo(endPt); 127 return endPt; 132 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local 134 path.lineTo(endPt); 136 return endPt; 141 SkPoint endPt local 149 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local 158 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local 168 SkPoint endPt = startPt + SkPoint::Make(40*SK_Scalar1, 0); local 177 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local 187 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local [all...] |
/external/skia/src/pathops/ |
H A D | SkPathOpsCubic.cpp | 155 const SkDPoint* endPt[2]; local 156 endPt[0] = &fPts[end1]; 160 endPt[1] = &fPts[end2]; 161 double origX = endPt[0]->fX; 162 double origY = endPt[0]->fY; 163 double adj = endPt[1]->fX - origX; 164 double opp = endPt[1]->fY - origY; 191 endPt[0] = endPt[1];
|
H A D | SkPathOpsQuad.cpp | 49 const SkDPoint* endPt[2]; local 50 this->otherPts(oddMan, endPt); 51 double origX = endPt[0]->fX; 52 double origY = endPt[0]->fY; 53 double adj = endPt[1]->fX - origX; 54 double opp = endPt[1]->fY - origY; 101 void SkDQuad::otherPts(int oddMan, const SkDPoint* endPt[2]) const { 105 endPt[opp - 1] = &fPts[end];
|
H A D | SkOpAngle.cpp | 576 const SkDPoint* endPt = &rayEnd[0]; local 578 SkDVector vLeft = *endPt - start; 760 const SkPoint& endPt = this->fEnd->pt(); local 764 rayMid[0].fX = (startPt.fX + endPt.fX) / 2; 765 rayMid[0].fY = (startPt.fY + endPt.fY) / 2; 766 rayMid[1].fX = rayMid[0].fX + (endPt.fY - startPt.fY); 767 rayMid[1].fY = rayMid[0].fY - (endPt.fX - startPt.fX);
|
/external/skqp/src/pathops/ |
H A D | SkPathOpsCubic.cpp | 155 const SkDPoint* endPt[2]; local 156 endPt[0] = &fPts[end1]; 160 endPt[1] = &fPts[end2]; 161 double origX = endPt[0]->fX; 162 double origY = endPt[0]->fY; 163 double adj = endPt[1]->fX - origX; 164 double opp = endPt[1]->fY - origY; 191 endPt[0] = endPt[1];
|
H A D | SkPathOpsQuad.cpp | 46 const SkDPoint* endPt[2]; local 47 this->otherPts(oddMan, endPt); 48 double origX = endPt[0]->fX; 49 double origY = endPt[0]->fY; 50 double adj = endPt[1]->fX - origX; 51 double opp = endPt[1]->fY - origY; 98 void SkDQuad::otherPts(int oddMan, const SkDPoint* endPt[2]) const { 102 endPt[opp - 1] = &fPts[end];
|
H A D | SkOpAngle.cpp | 576 const SkDPoint* endPt = &rayEnd[0]; local 578 SkDVector vLeft = *endPt - start; 760 const SkPoint& endPt = this->fEnd->pt(); local 764 rayMid[0].fX = (startPt.fX + endPt.fX) / 2; 765 rayMid[0].fY = (startPt.fY + endPt.fY) / 2; 766 rayMid[1].fX = rayMid[0].fX + (endPt.fY - startPt.fY); 767 rayMid[1].fY = rayMid[0].fY - (endPt.fX - startPt.fX);
|
/external/skia/src/gpu/ccpr/ |
H A D | GrCCGeometry.cpp | 76 // Returns whether the (convex) curve segment is monotonic with respect to [endPt - startPt]. 78 const Sk2f& endPt, const Sk2f& endTan) { 79 Sk2f v = endPt - startPt; 77 is_convex_curve_monotonic(const Sk2f& startPt, const Sk2f& startTan, const Sk2f& endPt, const Sk2f& endTan) argument
|
/external/skia/src/gpu/ops/ |
H A D | GrAAConvexPathRenderer.cpp | 55 const SkPoint& endPt() const { function in struct:Segment 76 p0 = segments[0].endPt(); 82 pj = segments[1].endPt() - p0; 85 pj = segments[i + 1].endPt() - p0; 100 const SkPoint& pt = segments[i].endPt(); 141 const SkPoint* prevPt = &sega.endPt(); 387 verts[*v + 0].fPos = sega.endPt(); 416 verts[*v + 1].fPos = sega.endPt(); 467 SkPoint qpts[] = {sega.endPt(), segb.fPts[0], segb.fPts[1]};
|
/external/skqp/src/gpu/ccpr/ |
H A D | GrCCGeometry.cpp | 76 // Returns whether the (convex) curve segment is monotonic with respect to [endPt - startPt]. 78 const Sk2f& endPt, const Sk2f& endTan) { 79 Sk2f v = endPt - startPt; 77 is_convex_curve_monotonic(const Sk2f& startPt, const Sk2f& startTan, const Sk2f& endPt, const Sk2f& endTan) argument
|
/external/skqp/src/gpu/ops/ |
H A D | GrAAConvexPathRenderer.cpp | 55 const SkPoint& endPt() const { function in struct:Segment 76 p0 = segments[0].endPt(); 82 pj = segments[1].endPt() - p0; 85 pj = segments[i + 1].endPt() - p0; 100 const SkPoint& pt = segments[i].endPt(); 141 const SkPoint* prevPt = &sega.endPt(); 387 verts[*v + 0].fPos = sega.endPt(); 416 verts[*v + 1].fPos = sega.endPt(); 467 SkPoint qpts[] = {sega.endPt(), segb.fPts[0], segb.fPts[1]};
|
/external/skia/src/gpu/ |
H A D | GrDistanceFieldGenFromVector.cpp | 237 const SkPoint& endPt() const { function in class:PathSegment 247 const DPoint p2 = DPoint::Make(this->endPt().x(), this->endPt().y()); 253 fBoundingBox.set(fPts[0], this->endPt());
|
/external/skqp/src/gpu/ |
H A D | GrDistanceFieldGenFromVector.cpp | 237 const SkPoint& endPt() const { function in class:PathSegment 247 const DPoint p2 = DPoint::Make(this->endPt().x(), this->endPt().y()); 253 fBoundingBox.set(fPts[0], this->endPt());
|