| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsTriangle.h | 14 SkDPoint fPts[3];
|
| SkPathOpsCubic.cpp | 25 double sum = (fPts[0].fX - fPts[3].fX) * (fPts[0].fY + fPts[3].fY);
27 sum += (fPts[idx + 1].fX - fPts[idx].fX) * (fPts[idx + 1].fY + fPts[idx].fY);
43 SkDVector startTan = fPts[1] - fPts[0]
[all...] |
| SkPathOpsLine.cpp | 12 fPts[0].fX - t1 * delta.fX, fPts[0].fY - t1 * delta.fY}, {
13 fPts[0].fX - t2 * delta.fX, fPts[0].fY - t2 * delta.fY}}};
39 SkDVector p0 = fPts[1] - fPts[0];
40 SkDVector p2 = pt - fPts[0];
46 return fPts[0];
49 return fPts[1];
52 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY }
[all...] |
| SkPathOpsTriangle.cpp | 13 SkDVector v0 = fPts[2] - fPts[0];
14 SkDVector v1 = fPts[1] - fPts[0];
15 SkDVector v2 = pt - fPts[0];
|
| 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];
39 SkDVector tangent() const { return fPts[0] - fPts[1]; }
|
| SkPathOpsQuad.h | 20 SkDPoint fPts[3];
23 SkDQuad result = {{fPts[2], fPts[1], fPts[0]}};
28 fPts[0] = pts[0];
29 fPts[1] = pts[1];
30 fPts[2] = pts[2];
33 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < 3); return fPts[n]; }
34 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < 3); return fPts[n]; }
|
| SkPathOpsQuad.cpp | 16 SkDVector pos = fPts[0] - pt;
19 SkDVector A = fPts[1] - fPts[0];
20 SkDVector B = fPts[2] - fPts[1];
28 double d0 = pt.distanceSquared(fPts[0]);
29 double d2 = pt.distanceSquared(fPts[2]);
47 return ((const SkDTriangle&) fPts).contains(pt);
148 cubic[0] = fPts[0];
149 cubic[2] = fPts[1]
[all...] |
| SkPathOpsCubic.h | 22 SkDPoint fPts[4];
25 fPts[0] = pts[0];
26 fPts[1] = pts[1];
27 fPts[2] = pts[2];
28 fPts[3] = pts[3];
33 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < 4); return fPts[n]; }
34 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < 4); return fPts[n]; }
|
| SkDCubicToQuads.cpp | 82 quad[0] = fPts[0];
83 const SkDPoint fromC1 = {(3 * fPts[1].fX - fPts[0].fX) / 2, (3 * fPts[1].fY - fPts[0].fY) / 2};
84 const SkDPoint fromC2 = {(3 * fPts[2].fX - fPts[3].fX) / 2, (3 * fPts[2].fY - fPts[3].fY) / 2};
87 quad[2] = fPts[3]
[all...] |
| /external/skia/src/pathops/ |
| SkPathOpsTriangle.h | 14 SkDPoint fPts[3];
|
| SkPathOpsCubic.cpp | 25 double sum = (fPts[0].fX - fPts[3].fX) * (fPts[0].fY + fPts[3].fY);
27 sum += (fPts[idx + 1].fX - fPts[idx].fX) * (fPts[idx + 1].fY + fPts[idx].fY);
43 SkDVector startTan = fPts[1] - fPts[0]
[all...] |
| SkPathOpsLine.cpp | 12 fPts[0].fX - t1 * delta.fX, fPts[0].fY - t1 * delta.fY}, {
13 fPts[0].fX - t2 * delta.fX, fPts[0].fY - t2 * delta.fY}}};
39 SkDVector p0 = fPts[1] - fPts[0];
40 SkDVector p2 = pt - fPts[0];
46 return fPts[0];
49 return fPts[1];
52 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY }
[all...] |
| SkPathOpsTriangle.cpp | 13 SkDVector v0 = fPts[2] - fPts[0];
14 SkDVector v1 = fPts[1] - fPts[0];
15 SkDVector v2 = pt - fPts[0];
|
| 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];
39 SkDVector tangent() const { return fPts[0] - fPts[1]; }
|
| SkPathOpsQuad.h | 20 SkDPoint fPts[3];
23 SkDQuad result = {{fPts[2], fPts[1], fPts[0]}};
28 fPts[0] = pts[0];
29 fPts[1] = pts[1];
30 fPts[2] = pts[2];
33 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < 3); return fPts[n]; }
34 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < 3); return fPts[n]; }
|
| SkPathOpsQuad.cpp | 16 SkDVector pos = fPts[0] - pt;
19 SkDVector A = fPts[1] - fPts[0];
20 SkDVector B = fPts[2] - fPts[1];
28 double d0 = pt.distanceSquared(fPts[0]);
29 double d2 = pt.distanceSquared(fPts[2]);
47 return ((const SkDTriangle&) fPts).contains(pt);
148 cubic[0] = fPts[0];
149 cubic[2] = fPts[1]
[all...] |
| SkPathOpsCubic.h | 22 SkDPoint fPts[4];
25 fPts[0] = pts[0];
26 fPts[1] = pts[1];
27 fPts[2] = pts[2];
28 fPts[3] = pts[3];
33 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < 4); return fPts[n]; }
34 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < 4); return fPts[n]; }
|
| SkDCubicToQuads.cpp | 82 quad[0] = fPts[0];
83 const SkDPoint fromC1 = {(3 * fPts[1].fX - fPts[0].fX) / 2, (3 * fPts[1].fY - fPts[0].fY) / 2};
84 const SkDPoint fromC2 = {(3 * fPts[2].fX - fPts[3].fX) / 2, (3 * fPts[2].fY - fPts[3].fY) / 2};
87 quad[2] = fPts[3]
[all...] |
| /external/chromium_org/third_party/skia/include/utils/ |
| SkBoundaryPatch.h | 51 SkPoint fPts[4];
60 SkPoint fPts[13];
|
| /external/skia/include/utils/ |
| SkBoundaryPatch.h | 51 SkPoint fPts[4];
60 SkPoint fPts[13];
|
| /external/skia/bench/ |
| LineBench.cpp | 27 SkPoint fPts[PTS];
37 fPts[i].set(rand.nextUScalar1() * 640, rand.nextUScalar1() * 480);
55 canvas->drawPoints(SkCanvas::kLines_PointMode, PTS, fPts, paint);
|
| VertBench.cpp | 32 SkPoint fPts[PTS];
47 SkPoint* pts = fPts;
68 SkASSERT(PTS == pts - fPts);
87 fPts, NULL, fColors, NULL, fIdx, IDX, paint);
|
| /external/chromium_org/third_party/skia/src/utils/ |
| SkBoundaryPatch.cpp | 69 return SkPointInterp(fPts[e], fPts[(e + 1) & 3], t);
76 fPts[12] = fPts[0];
79 SkEvalCubicAt(&fPts[e * 3], t, &loc, NULL, NULL);
|
| /external/skia/src/utils/ |
| SkBoundaryPatch.cpp | 69 return SkPointInterp(fPts[e], fPts[(e + 1) & 3], t);
76 fPts[12] = fPts[0];
79 SkEvalCubicAt(&fPts[e * 3], t, &loc, NULL, NULL);
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkGeometry.cpp | [all...] |
