/external/skia/src/pathops/ |
H A D | SkPathOpsLine.h | 13 SkDPoint fPts[2]; member in struct:SkDLine 15 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < 2); return fPts[n]; } 16 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < 2); return fPts[n]; } 19 fPts[0] = pts[0]; 20 fPts[1] = pts[1];
|
H A D | SkPathOpsQuad.h | 26 SkDPoint fPts[kPointCount]; member in struct:SkDQuad 29 return fPts[0].approximatelyEqual(fPts[1]) && fPts[0].approximatelyEqual(fPts[2]); 33 SkDVector v01 = fPts[0] - fPts[1]; 34 SkDVector v02 = fPts[0] - fPts[2]; 35 SkDVector v12 = fPts[ [all...] |
H A D | SkPathOpsConic.h | 19 SkDQuad fPts; member in struct:SkDConic 23 return fPts.collapsed(); 27 return fPts.controlsInside(); 31 fPts.debugInit(); 35 SkDConic result = {{{fPts[2], fPts[1], fPts[0]}}, fWeight}; 42 fPts.set(pts); 47 const SkDPoint& operator[](int n) const { return fPts[n]; } 48 SkDPoint& operator[](int n) { return fPts[ [all...] |
H A D | SkPathOpsCubic.h | 38 return fPts[0].approximatelyEqual(fPts[1]) && fPts[0].approximatelyEqual(fPts[2]) 39 && fPts[0].approximatelyEqual(fPts[3]); 43 SkDVector v01 = fPts[0] - fPts[1]; 44 SkDVector v02 = fPts[0] - fPts[ 136 SkDPoint fPts[kPointCount]; member in struct:SkDCubic [all...] |
H A D | SkOpSegment.h | 164 return (*CurveDPointAtT[fVerb])(fPts, fWeight, mid); 168 return (*CurveDSlopeAtT[fVerb])(fPts, fWeight, mid); 225 return (*CurveIsVertical[fVerb])(fPts, fWeight, start->t(), end->t()); 231 return fPts[SkPathOpsVerbToPoints(fVerb)]; 270 return (*CurvePointAtT[fVerb])(fPts, fWeight, mid); 274 return fPts; 379 return &fPts[end ? SkPathOpsVerbToPoints(fVerb) : 0]; 388 SkPoint* fPts; // pointer into array of points owned by edge builder that may be tweaked member in class:SkOpSegment
|
H A D | SkPathOpsCurve.h | 19 SkPoint fPts[4]; member in struct:SkOpCurve 25 return fPts[n]; 32 fPts[index] = quad[index].asSkPoint(); 40 fPts[index] = cubic[index].asSkPoint();
|
/external/skia/bench/ |
H A D | LineBench.cpp | 26 SkPoint fPts[PTS]; member in class:LineBench 36 fPts[i].set(rand.nextUScalar1() * 640, rand.nextUScalar1() * 480); 54 canvas->drawPoints(SkCanvas::kLines_PointMode, PTS, fPts, paint);
|
H A D | ScalarBench.cpp | 132 SkPoint fPts[PTS]; member in class:RectBoundsBench 138 fPts[i].fX = rand.nextSScalar1(); 139 fPts[i].fY = rand.nextSScalar1(); 156 r.set(fPts, PTS);
|
H A D | VertBench.cpp | 31 SkPoint fPts[PTS]; member in class:VertBench 46 SkPoint* pts = fPts; 67 SkASSERT(PTS == pts - fPts); 86 fPts, NULL, fColors, NULL, fIdx, IDX, paint);
|
H A D | GeometryBench.cpp | 137 SkPoint fPts[4]; member in class:QuadBenchBase 142 fPts[i].set(rand.nextUScalar1(), rand.nextUScalar1()); 154 SkEvalQuadAt(fPts, 0.5f, &result); 155 SkEvalQuadAt(fPts, 0.5f, &result); 156 SkEvalQuadAt(fPts, 0.5f, &result); 157 SkEvalQuadAt(fPts, 0.5f, &result); 170 result = SkEvalQuadAt(fPts, 0.5f); 171 result = SkEvalQuadAt(fPts, 0.5f); 172 result = SkEvalQuadAt(fPts, 0.5f); 173 result = SkEvalQuadAt(fPts, 0. [all...] |
H A D | DashBench.cpp | 37 SkPoint fPts[2]; member in class:DashBench 51 fPts[0].set(SkIntToScalar(10), SkIntToScalar(10)); 52 fPts[1].set(SkIntToScalar(600), SkIntToScalar(10)); 91 // canvas->drawPoints(SkCanvas::kLines_PointMode, 2, fPts, paint); 301 SkPoint fPts[2]; member in class:GiantDashBench 351 matrix.mapPoints(fPts, pts, 2); 367 canvas->drawPoints(SkCanvas::kLines_PointMode, 2, fPts, p);
|
/external/skia/include/utils/ |
H A D | SkBoundaryPatch.h | 51 SkPoint fPts[4]; member in class:SkLineBoundary 60 SkPoint fPts[13]; member in class:SkCubicBoundary
|
/external/skia/tests/ |
H A D | DashPathEffectTest.cpp | 40 SkPoint fPts[2]; member in struct:__anon14112 75 src.moveTo(testCases[j].fPts[k]); 76 src.lineTo(testCases[j].fPts[(k+1)%2]);
|
H A D | BlitRowTest.cpp | 160 SkPoint fPts[4]; member in struct:Mesh 165 fPts[0].set(0, 0); 166 fPts[1].set(w, 0); 167 fPts[2].set(w, h); 168 fPts[3].set(0, h); 176 canvas->drawVertices(SkCanvas::kTriangleFan_VertexMode, 4, fPts, fPts,
|
H A D | ScalarTest.cpp | 29 const SkPoint* fPts; member in struct:PointSet 56 const SkPoint* fPts; member in struct:__anon14160 71 r.set(gSets[i].fPts, gSets[i].fCount);
|
H A D | PathOpsAngleTest.cpp | 222 const SkDCubic fPts; 243 data.fShortPts[idx2] = data.fPts.fPts[idx2].asSkPoint(); 265 const SkDCubic fPts; member in struct:IntersectData 442 temp[idx2] = data.fPts.fPts[idx2].asSkPoint();
|
/external/skia/include/core/ |
H A D | SkPathMeasure.h | 92 unsigned fPtIndex : 15; // index into the fPts array 99 SkTDArray<SkPoint> fPts; // Points used to define the segments member in class:SkPathMeasure
|
/external/skia/gm/ |
H A D | vertices.cpp | 26 SkPoint fPts[9]; member in class:VerticesGM 46 fPts[0].set(0, 0); fPts[1].set(X/2, 10); fPts[2].set(X, 0); 47 fPts[3].set(10, Y/2); fPts[4].set(X/2, Y/2); fPts[5].set(X-10, Y/2); 48 fPts[6].set(0, Y); fPts[7].set(X/2, Y-10); fPts[ [all...] |
/external/skia/samplecode/ |
H A D | ClockFaceView.cpp | 72 : Sk2DPathEffect(matrix), fRadius(radius), fPts(pts) {} 78 if (fPts) { 79 fPts->reset(); 86 if (fPts) { 87 *fPts->append() = loc; 99 SkTDArray<SkPoint>* fPts; member in class:Dot2DPathEffect
|
H A D | SamplePath.cpp | 234 SkPoint fPts[N]; member in class:ArcToView 241 fPts[i].fX = 20 + rand.nextUScalar1() * 640; 242 fPts[i].fY = 20 + rand.nextUScalar1() * 480; 294 path->moveTo(fPts[0]); 296 path->lineTo(fPts[i]); 304 canvas->drawPoints(SkCanvas::kPoints_PointMode, N, fPts, fPtsPaint); 323 fPts[index] = click->fCurr; 334 if (r.intersects(SkRect::MakeXYWH(fPts[i].fX, fPts[i].fY, 1, 1))) {
|
H A D | SampleFatBits.cpp | 380 SkPoint fPts[3]; member in class:DrawLineView 385 fPts[0].set(48, 48); 386 fPts[1].set(48 * 5, 48 * 4); 387 fPts[2].set(48 * 2, 48 * 6); 452 fFB.drawTriangle(canvas, fPts); 455 fFB.drawRect(canvas, fPts); 457 fFB.drawLine(canvas, fPts); 484 if (fPts[i].equalsWithinTolerance(pt, tol)) { 495 fPts[index] = click->fCurr; 499 fPts[ [all...] |
H A D | SamplePatch.cpp | 53 Patch() { sk_bzero(fPts, sizeof(fPts)); } 57 memcpy(fPts, pts, 12 * sizeof(SkPoint)); 58 fPts[12] = pts[0]; // the last shall be first 66 SkPoint fPts[13]; member in class:Patch 142 eval_patch_edge(fPts + 0, edge0, nu); 143 eval_patch_edge(fPts + 3, edge1, nv); 144 eval_patch_edge(fPts + 6, edge2, nu); 145 eval_patch_edge(fPts + 9, edge3, nv); 229 SkPoint fPts[1 member in class:PatchView [all...] |
/external/skia/src/core/ |
H A D | SkGeometry.h | 210 fPts[0] = p0; 211 fPts[1] = p1; 212 fPts[2] = p2; 216 memcpy(fPts, pts, sizeof(fPts)); 220 SkPoint fPts[3]; member in struct:SkConic 224 memcpy(fPts, pts, 3 * sizeof(SkPoint)); 229 fPts[0] = p0; 230 fPts[1] = p1; 231 fPts[ [all...] |
/external/skia/src/gpu/ |
H A D | GrAAConvexTessellator.h | 43 int numPts() const { return fPts.count(); } 46 const SkPoint& lastPoint() const { return fPts.top(); } 47 const SkPoint& point(int index) const { return fPts[index]; } 63 void setReserve(int numPts) { fPts.setReserve(numPts); } 64 void rewind() { fPts.rewind(); } 66 int numPts() const { return fPts.count(); } 68 const SkPoint& lastPoint() const { return fPts.top().fPt; } 69 const SkPoint& firstPoint() const { return fPts[0].fPt; } 70 const SkPoint& point(int index) const { return fPts[index].fPt; } 72 int originatingIdx(int index) const { return fPts[inde 116 SkTDArray<struct PointData> fPts; member in class:GrAAConvexTessellator::CandidateVerts 160 SkTDArray<PointData> fPts; member in class:GrAAConvexTessellator::Ring 210 SkTDArray<SkPoint> fPts; member in class:GrAAConvexTessellator [all...] |
/external/skia/src/utils/ |
H A D | SkDashPath.cpp | 156 if (rec->isHairlineStyle() || !src.isLine(fPts)) { 165 SkScalar pathLength = SkPoint::Distance(fPts[0], fPts[1]); 167 fTangent = fPts[1] - fPts[0]; 199 SkScalar x0 = fPts[0].fX + SkScalarMul(fTangent.fX, d0); 200 SkScalar x1 = fPts[0].fX + SkScalarMul(fTangent.fX, d1); 201 SkScalar y0 = fPts[0].fY + SkScalarMul(fTangent.fY, d0); 202 SkScalar y1 = fPts[0].fY + SkScalarMul(fTangent.fY, d1); 214 SkPoint fPts[ member in class:SpecialLineRec [all...] |