| /external/skia/src/pathops/ |
| SkDCubicToQuads.cpp | 37 quad[0] = fPts[0];
38 const SkDPoint fromC1 = {(3 * fPts[1].fX - fPts[0].fX) / 2, (3 * fPts[1].fY - fPts[0].fY) / 2};
39 const SkDPoint fromC2 = {(3 * fPts[2].fX - fPts[3].fX) / 2, (3 * fPts[2].fY - fPts[3].fY) / 2};
42 quad[2] = fPts[3]
[all...] |
| SkPathOpsQuad.h | 26 SkDPoint fPts[kPointCount];
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[1] - fPts[2]
[all...] |
| SkPathOpsConic.h | 19 SkDQuad fPts;
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[n];
[all...] |
| SkPathOpsCubic.h | 31 return fPts[0].approximatelyEqual(fPts[1]) && fPts[0].approximatelyEqual(fPts[2])
32 && fPts[0].approximatelyEqual(fPts[3]);
36 SkDVector v01 = fPts[0] - fPts[1];
37 SkDVector v02 = fPts[0] - fPts[2]
[all...] |
| SkPathOpsQuad.cpp | 30 double sign = (fPts[oddMan].fY - origY) * adj - (fPts[oddMan].fX - origX) * opp;
72 endPt[opp - 1] = &fPts[end];
151 double tiniest = SkTMin(SkTMin(SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY),
152 fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY);
153 double largest = SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY)
[all...] |
| SkOpCubicHull.cpp | 60 if (fPts[yMin].fY > fPts[index].fY || (fPts[yMin].fY == fPts[index].fY
61 && fPts[yMin].fX > fPts[index].fX)) {
92 if (fPts[1] == fPts[0] || fPts[1] == fPts[3])
[all...] |
| SkPathOpsConic.cpp | 48 conic_eval_tan(&fPts[0].fX, fWeight, t),
49 conic_eval_tan(&fPts[0].fY, fWeight, t)
53 result = fPts[2] - fPts[0];
86 return fPts[0];
89 return fPts[2];
93 conic_eval_numerator(&fPts[0].fX, fWeight, t) / denominator,
94 conic_eval_numerator(&fPts[0].fY, fWeight, t) / denominator
123 ax = fPts[0].fX;
124 ay = fPts[0].fY
[all...] |
| SkPathOpsCubic.cpp | 20 if (fPts[endIndex].fX == fPts[ctrlIndex].fX) {
21 dstPt->fX = fPts[endIndex].fX;
23 if (fPts[endIndex].fY == fPts[ctrlIndex].fY) {
24 dstPt->fY = fPts[endIndex].fY;
109 dst.pts[0] = fPts[0];
110 dst.pts[1].fX = (fPts[0].fX + fPts[1].fX) / 2;
111 dst.pts[1].fY = (fPts[0].fY + fPts[1].fY) / 2
[all...] |
| SkPathOpsLine.cpp | 11 return fPts[0];
14 return fPts[1];
17 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY };
22 if (xy == fPts[0]) { // do cheapest test first
25 if (xy == fPts[1]) {
32 if (!AlmostBetweenUlps(fPts[0].fX, xy.fX, fPts[1].fX
[all...] |
| SkPathOpsLine.h | 13 SkDPoint fPts[2];
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];
|
| /external/skia/src/gpu/batches/ |
| GrAAConvexTessellator.h | 48 int numPts() const { return fPts.count(); }
51 const SkPoint& lastPoint() const { return fPts.top(); }
52 const SkPoint& point(int index) const { return fPts[index]; }
68 void setReserve(int numPts) { fPts.setReserve(numPts); }
69 void rewind() { fPts.rewind(); }
71 int numPts() const { return fPts.count(); }
73 const SkPoint& lastPoint() const { return fPts.top().fPt; }
74 const SkPoint& firstPoint() const { return fPts[0].fPt; }
75 const SkPoint& point(int index) const { return fPts[index].fPt; }
77 int originatingIdx(int index) const { return fPts[index].fOriginatingIdx;
[all...] |
| GrAAConvexTessellator.cpp | 66 int index = fPts.count();
67 *fPts.push() = pt;
79 fPts.pop();
89 fPts.removeShuffle(0);
103 fPts[index] = pt;
118 fPts.rewind();
244 SkPoint v = p - fPts[edgeIdx];
261 SkScalar t = perp_intersect(fPts[startIdx], bisector, fPts[edgeIdx], norm);
264 SkASSERT(startIdx < fPts.count())
[all...] |
| /external/skia/tests/ |
| PathOpsConicIntersectionTest.cpp | 53 up.set(chopped[cIndex].fPts[pIndex]);
54 SkASSERT(dChopped[cIndex].fPts[pIndex].approximatelyEqual(up));
77 conic.fPts[index].fX = c.fPts[index].fX * scale;
78 conic.fPts[index].fY = c.fPts[index].fY * scale;
80 chopped[chIndex].fPts[index].fX = ch[chIndex].fPts[index].fX * scale;
81 chopped[chIndex].fPts[index].fY = ch[chIndex].fPts[index].fY * scale
[all...] |
| PathOpsConicLineIntersectionTest.cpp | 103 SkPoint pts[3] = { conic.fPts.fPts[0].asSkPoint(), conic.fPts.fPts[1].asSkPoint(),
104 conic.fPts.fPts[2].asSkPoint() };
|
| /external/skia/bench/ |
| GeometryBench.cpp | 137 SkPoint fPts[4];
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.5f)
[all...] |
| VertBench.cpp | 31 SkPoint fPts[PTS];
46 SkPoint* pts = fPts;
67 SkASSERT(PTS == pts - fPts);
86 fPts, nullptr, fColors, nullptr, fIdx, IDX, paint);
|
| LineBench.cpp | 26 SkPoint fPts[PTS];
36 fPts[i].set(rand.nextUScalar1() * 640, rand.nextUScalar1() * 480);
54 canvas->drawPoints(SkCanvas::kLines_PointMode, PTS, fPts, paint);
|
| ScalarBench.cpp | 132 SkPoint fPts[PTS];
138 fPts[i].fX = rand.nextSScalar1();
139 fPts[i].fY = rand.nextSScalar1();
156 r.set(fPts, PTS);
|
| /external/skia/gm/ |
| vertices.cpp | 26 SkPoint fPts[9];
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[8].set(X, Y)
[all...] |
| /external/skia/include/utils/ |
| SkBoundaryPatch.h | 51 SkPoint fPts[4];
60 SkPoint fPts[13];
|
| /external/skia/samplecode/ |
| PerlinPatch.cpp | 69 SkPoint fPts[SkPatchUtils::kNumCtrlPts];
80 fPts[0].set(100 * s, 100 * s);
81 fPts[1].set(150 * s, 50 * s);
82 fPts[2].set(250 * s, 150 * s);
83 fPts[3].set(300 * s, 100 * s);
85 fPts[4].set(275 * s, 150 * s);
86 fPts[5].set(350 * s, 250 * s);
88 fPts[6].set(300 * s, 300 * s);
89 fPts[7].set(250 * s, 250 * s);
91 fPts[8].set(150 * s, 350 * s)
[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];
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[12]
[all...] |
| SampleQuadStroker.cpp | 105 SkPoint fPts[kCount];
143 fPts[0].set(50, 200); // cubic
144 fPts[1].set(50, 100);
145 fPts[2].set(150, 50);
146 fPts[3].set(300, 50);
148 fPts[4].set(350, 200); // conic
149 fPts[5].set(350, 100);
150 fPts[6].set(450, 50);
152 fPts[7].set(150, 300); // quad
153 fPts[8].set(150, 200)
[all...] |
| /external/skia/src/utils/ |
| SkBoundaryPatch.cpp | 67 return SkPointInterp(fPts[e], fPts[(e + 1) & 3], t);
74 fPts[12] = fPts[0];
77 SkEvalCubicAt(&fPts[e * 3], t, &loc, nullptr, nullptr);
|
| /external/skia/src/core/ |
| SkGeometry.h | 185 fPts[0] = p0;
186 fPts[1] = p1;
187 fPts[2] = p2;
191 memcpy(fPts, pts, sizeof(fPts));
195 SkPoint fPts[3];
199 memcpy(fPts, pts, 3 * sizeof(SkPoint));
204 fPts[0] = p0;
205 fPts[1] = p1;
206 fPts[2] = p2
[all...] |
