HomeSort by relevance Sort by last modified time
    Searched defs:fPts (Results 26 - 50 of 70) sorted by null

12 3

  /external/skqp/gm/
emptypath.cpp 160 SkPoint fPts[3];
164 fPts[0].set(40, 40);
165 fPts[1].set(80, 40);
166 fPts[2].set(120, 40);
196 procs[i](&path, fPts);
197 canvas->drawPoints(SkCanvas::kPoints_PointMode, 3, fPts, dotPaint);
vertices.cpp 86 SkPoint fPts[kMeshVertexCnt];
100 fill_mesh(fPts, fTexs, fColors, fShaderScale);
172 kMeshVertexCnt, fPts, texs, colors,
  /external/skqp/samplecode/
ClockFaceView.cpp 31 : Sk2DPathEffect(matrix), fRadius(radius), fPts(pts) {}
44 if (fPts) {
45 fPts->reset();
52 if (fPts) {
53 *fPts->append() = loc;
65 SkTDArray<SkPoint>* fPts;
PerlinPatch.cpp 69 SkPoint fPts[SkPatchUtils::kNumCtrlPts];
82 fPts[0].set(100 * s, 100 * s);
83 fPts[1].set(150 * s, 50 * s);
84 fPts[2].set(250 * s, 150 * s);
85 fPts[3].set(300 * s, 100 * s);
87 fPts[4].set(275 * s, 150 * s);
88 fPts[5].set(350 * s, 250 * s);
90 fPts[6].set(300 * s, 300 * s);
91 fPts[7].set(250 * s, 250 * s);
93 fPts[8].set(150 * s, 350 * s)
    [all...]
SamplePath.cpp 221 SkPoint fPts[N];
228 fPts[i].fX = 20 + rand.nextUScalar1() * 640;
229 fPts[i].fY = 20 + rand.nextUScalar1() * 480;
273 path->moveTo(fPts[0]);
275 path->lineTo(fPts[i]);
283 canvas->drawPoints(SkCanvas::kPoints_PointMode, N, fPts, fPtsPaint);
299 fPts[index] = click->fCurr;
309 if (r.intersects(SkRect::MakeXYWH(fPts[i].fX, fPts[i].fY, 1, 1))) {
334 SkPoint fPts[N]
    [all...]
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];
124 eval_patch_edge(fPts + 0, edge0, nu);
125 eval_patch_edge(fPts + 3, edge1, nv);
126 eval_patch_edge(fPts + 6, edge2, nu);
127 eval_patch_edge(fPts + 9, edge3, nv);
211 SkPoint fPts[12]
    [all...]
  /external/skqp/src/pathops/
SkPathOpsCubic.h 27 return fPts[0].approximatelyEqual(fPts[1]) && fPts[0].approximatelyEqual(fPts[2])
28 && fPts[0].approximatelyEqual(fPts[3]);
32 SkDVector v01 = fPts[0] - fPts[1];
33 SkDVector v02 = fPts[0] - fPts[2]
    [all...]
SkOpEdgeBuilder.cpp 254 SkPoint* curve1 = v1 != SkPath::kLine_Verb ? pair[0].fPts : cStorage[0];
255 SkPoint* curve2 = v2 != SkPath::kLine_Verb ? pair[1].fPts : cStorage[1];
279 SkPoint fPts[4];
291 if (!part.toFloatPoints(split->fPts)) {
294 split->fVerb = SkReduceOrder::Cubic(split->fPts, split->fReduced);
296 ? split->fPts : split->fReduced;
326 if (!part.toFloatPoints(split->fPts)) {
329 split->fVerb = SkReduceOrder::Cubic(split->fPts, split->fReduced);
332 ? split->fPts : split->fReduced;
  /external/skia/bench/
DashBench.cpp 37 SkPoint fPts[2];
51 fPts[0].set(SkIntToScalar(10), SkIntToScalar(10));
52 fPts[1].set(SkIntToScalar(600), SkIntToScalar(10));
90 // canvas->drawPoints(SkCanvas::kLines_PointMode, 2, fPts, paint);
300 SkPoint fPts[2];
349 matrix.mapPoints(fPts, pts, 2);
365 canvas->drawPoints(SkCanvas::kLines_PointMode, 2, fPts, p);
  /external/skia/samplecode/
SamplePath.cpp 221 SkPoint fPts[N];
228 fPts[i].fX = 20 + rand.nextUScalar1() * 640;
229 fPts[i].fY = 20 + rand.nextUScalar1() * 480;
273 path->moveTo(fPts[0]);
275 path->lineTo(fPts[i]);
283 canvas->drawPoints(SkCanvas::kPoints_PointMode, N, fPts, fPtsPaint);
299 fPts[index] = click->fCurr;
309 if (r.intersects(SkRect::MakeXYWH(fPts[i].fX, fPts[i].fY, 1, 1))) {
334 SkPoint fPts[N]
    [all...]
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];
124 eval_patch_edge(fPts + 0, edge0, nu);
125 eval_patch_edge(fPts + 3, edge1, nv);
126 eval_patch_edge(fPts + 6, edge2, nu);
127 eval_patch_edge(fPts + 9, edge3, nv);
211 SkPoint fPts[12]
    [all...]
  /external/skia/src/core/
SkGeometry.h 228 fPts[0] = p0;
229 fPts[1] = p1;
230 fPts[2] = p2;
234 memcpy(fPts, pts, sizeof(fPts));
238 SkPoint fPts[3];
242 memcpy(fPts, pts, 3 * sizeof(SkPoint));
247 fPts[0] = p0;
248 fPts[1] = p1;
249 fPts[2] = p2
    [all...]
  /external/skia/src/gpu/
GrShape.h 186 pts[0] = fLineData.fPts[0];
187 pts[1] = fLineData.fPts[1];
227 out->moveTo(fLineData.fPts[0]);
228 out->lineTo(fLineData.fPts[1]);
546 SkPoint fPts[2];
  /external/skia/src/gpu/ops/
GrAAConvexTessellator.h 51 int numPts() const { return fPts.count(); }
54 const SkPoint& lastPoint() const { return fPts.top(); }
55 const SkPoint& point(int index) const { return fPts[index]; }
71 void setReserve(int numPts) { fPts.setReserve(numPts); }
72 void rewind() { fPts.rewind(); }
74 int numPts() const { return fPts.count(); }
76 const SkPoint& lastPoint() const { return fPts.top().fPt; }
77 const SkPoint& firstPoint() const { return fPts[0].fPt; }
78 const SkPoint& point(int index) const { return fPts[index].fPt; }
80 int originatingIdx(int index) const { return fPts[index].fOriginatingIdx;
    [all...]
  /external/skia/src/pathops/
SkOpEdgeBuilder.cpp 254 SkPoint* curve1 = v1 != SkPath::kLine_Verb ? pair[0].fPts : cStorage[0];
255 SkPoint* curve2 = v2 != SkPath::kLine_Verb ? pair[1].fPts : cStorage[1];
279 SkPoint fPts[4];
291 if (!part.toFloatPoints(split->fPts)) {
294 split->fVerb = SkReduceOrder::Cubic(split->fPts, split->fReduced);
296 ? split->fPts : split->fReduced;
310 split->fPts[0] = splits[prior].fPts[0];
319 split->fPts[3] = splits[next].fPts[3]
    [all...]
SkOpSegment.h 199 return (*CurveDPointAtT[fVerb])(fPts, fWeight, mid);
203 return (*CurveDSlopeAtT[fVerb])(fPts, fWeight, mid);
263 return (*CurveIsVertical[fVerb])(fPts, fWeight, start->t(), end->t());
273 return fPts[SkPathOpsVerbToPoints(fVerb)];
313 return (*CurvePointAtT[fVerb])(fPts, fWeight, mid);
317 return fPts;
434 SkPoint* fPts; // pointer into array of points owned by edge builder that may be tweaked
SkPathOpsCurve.h 19 SkPoint fPts[4];
25 return fPts[n];
32 fPts[index] = quad[index].asSkPoint();
40 fPts[index] = cubic[index].asSkPoint();
215 return c.fLine.fPts[1] - c.fLine.fPts[0];
  /external/skia/tests/
ScalarTest.cpp 29 const SkPoint* fPts;
56 const SkPoint* fPts;
71 r.set(gSets[i].fPts, gSets[i].fCount);
  /external/skqp/bench/
DashBench.cpp 37 SkPoint fPts[2];
51 fPts[0].set(SkIntToScalar(10), SkIntToScalar(10));
52 fPts[1].set(SkIntToScalar(600), SkIntToScalar(10));
90 // canvas->drawPoints(SkCanvas::kLines_PointMode, 2, fPts, paint);
300 SkPoint fPts[2];
349 matrix.mapPoints(fPts, pts, 2);
365 canvas->drawPoints(SkCanvas::kLines_PointMode, 2, fPts, p);
  /external/skqp/src/core/
SkGeometry.h 228 fPts[0] = p0;
229 fPts[1] = p1;
230 fPts[2] = p2;
234 memcpy(fPts, pts, sizeof(fPts));
238 SkPoint fPts[3];
242 memcpy(fPts, pts, 3 * sizeof(SkPoint));
247 fPts[0] = p0;
248 fPts[1] = p1;
249 fPts[2] = p2
    [all...]
  /external/skqp/src/gpu/
GrShape.h 183 pts[0] = fLineData.fPts[0];
184 pts[1] = fLineData.fPts[1];
214 out->moveTo(fLineData.fPts[0]);
215 out->lineTo(fLineData.fPts[1]);
511 SkPoint fPts[2];
  /external/skqp/src/gpu/ops/
GrAAConvexTessellator.h 51 int numPts() const { return fPts.count(); }
54 const SkPoint& lastPoint() const { return fPts.top(); }
55 const SkPoint& point(int index) const { return fPts[index]; }
71 void setReserve(int numPts) { fPts.setReserve(numPts); }
72 void rewind() { fPts.rewind(); }
74 int numPts() const { return fPts.count(); }
76 const SkPoint& lastPoint() const { return fPts.top().fPt; }
77 const SkPoint& firstPoint() const { return fPts[0].fPt; }
78 const SkPoint& point(int index) const { return fPts[index].fPt; }
80 int originatingIdx(int index) const { return fPts[index].fOriginatingIdx;
    [all...]
  /external/skqp/tests/
ScalarTest.cpp 29 const SkPoint* fPts;
56 const SkPoint* fPts;
71 r.set(gSets[i].fPts, gSets[i].fCount);
  /external/skia/include/private/
SkPathRef.h 139 const SkPoint* fPts;
  /external/skqp/include/private/
SkPathRef.h 139 const SkPoint* fPts;

Completed in 1186 milliseconds

12 3