| /external/chromium_org/third_party/skia/experimental/StrokePathRenderer/ |
| H A D | GrStrokePathRenderer.cpp | 126 SkPoint *firstPt = verts, *lastPt = NULL; local
245 firstPt[idx0] = miterPt[0];
246 firstPt[idx1] = miterPt[1];
276 firstPt[0] -= firstDir;
277 firstPt[1] -= firstDir;
|
| /external/skia/experimental/StrokePathRenderer/ |
| H A D | GrStrokePathRenderer.cpp | 126 SkPoint *firstPt = verts, *lastPt = NULL; local
245 firstPt[idx0] = miterPt[0];
246 firstPt[idx1] = miterPt[1];
276 firstPt[0] -= firstDir;
277 firstPt[1] -= firstDir;
|
| /external/chromium_org/third_party/skia/tests/ |
| H A D | PathOpsExtendedTest.cpp | 59 SkPoint firstPt = {0, 0}, lastPt = {0, 0}; local
65 if (firstPtSet && lastPtSet && firstPt != lastPt) {
67 firstPt.fX, firstPt.fY);
70 firstPt = pts[0];
93 if (firstPtSet && lastPtSet && firstPt != lastPt) {
95 firstPt.fX, firstPt.fY);
104 if (firstPtSet && lastPtSet && firstPt != lastPt) {
106 firstPt
[all...] |
| /external/skia/tests/ |
| H A D | PathOpsExtendedTest.cpp | 153 SkPoint firstPt = {0, 0}, lastPt = {0, 0}; local
159 if (firstPtSet && lastPtSet && firstPt != lastPt) {
161 firstPt.fX, firstPt.fY);
164 firstPt = pts[0];
187 if (firstPtSet && lastPtSet && firstPt != lastPt) {
189 firstPt.fX, firstPt.fY);
198 if (firstPtSet && lastPtSet && firstPt != lastPt) {
200 firstPt
[all...] |
| /external/fonttools/Lib/fontTools/ttLib/tables/ |
| H A D | _g_l_y_f.py | 633 if hasattr(compo, "firstPt"):
635 x1,y1 = allCoords[compo.firstPt]
797 # XXX Ignoring self.firstPt & self.lastpt for now: I need to implement
822 self.firstPt, self.secondPt = int(x), int(y)
829 self.firstPt, self.secondPt = int(x), int(y)
865 if hasattr(self, "firstPt"):
866 if (0 <= self.firstPt <= 255) and (0 <= self.secondPt <= 255):
867 data = data + struct.pack(">BB", self.firstPt, self.secondPt)
869 data = data + struct.pack(">HH", self.firstPt, self.secondPt)
900 if not hasattr(self, "firstPt")
[all...] |
| /external/fonttools/Tools/fontTools/ttLib/tables/ |
| H A D | _g_l_y_f.py | 633 if hasattr(compo, "firstPt"):
635 x1,y1 = allCoords[compo.firstPt]
797 # XXX Ignoring self.firstPt & self.lastpt for now: I need to implement
822 self.firstPt, self.secondPt = int(x), int(y)
829 self.firstPt, self.secondPt = int(x), int(y)
865 if hasattr(self, "firstPt"):
866 if (0 <= self.firstPt <= 255) and (0 <= self.secondPt <= 255):
867 data = data + struct.pack(">BB", self.firstPt, self.secondPt)
869 data = data + struct.pack(">HH", self.firstPt, self.secondPt)
900 if not hasattr(self, "firstPt")
[all...] |
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| H A D | EdgeWalker.cpp | 413 SkPoint firstPt, lastCurve[4]; local
444 firstPt = *curve[0];
543 if (lastCurve[lastVerb] != firstPt) {
544 simple.lineTo(firstPt.fX, firstPt.fY);
547 firstIndex + 1, firstPt.fX, firstPt.fY);
|
| /external/skia/experimental/Intersection/ |
| H A D | EdgeWalker.cpp | 413 SkPoint firstPt, lastCurve[4]; local
444 firstPt = *curve[0];
543 if (lastCurve[lastVerb] != firstPt) {
544 simple.lineTo(firstPt.fX, firstPt.fY);
547 firstIndex + 1, firstPt.fX, firstPt.fY);
|
| /external/chromium_org/third_party/skia/src/core/ |
| H A D | SkPath.cpp | 242 SkPoint firstPt; local
257 firstPt = prevPt = pts[0];
289 return check_edge_against_rect(prevPt, firstPt, rect, direction);
|
| /external/skia/src/core/ |
| H A D | SkPath.cpp | 242 SkPoint firstPt; local
257 firstPt = prevPt = pts[0];
289 return check_edge_against_rect(prevPt, firstPt, rect, direction);
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| H A D | SkOpSegment.cpp | 557 const SkPoint& firstPt = fPts[0]; local
582 if ((pt == firstPt && newT == 0) || (span.fPt == lastPt && newT == 1)) {
3081 const SkPoint& firstPt = span->fPt;
3087 } while (SkDPoint::ApproximatelyEqual(span->fPt, firstPt)
|
| /external/skia/src/pathops/ |
| H A D | SkOpSegment.cpp | 553 const SkPoint& firstPt = fPts[0]; local
578 if ((pt == firstPt && newT == 0) || (span.fPt == lastPt && newT == 1)) {
3004 const SkPoint& firstPt = span->fPt;
3010 } while (SkDPoint::ApproximatelyEqual(span->fPt, firstPt)
|