| /external/skia/tests/ |
| H A D | PathOpsThreeWayTest.cpp | 15 int ptCount; member in struct:Curve
58 if (oTest.ptCount == 1 && iTest.ptCount == 1) {
60 } else if (oTest.ptCount == 1 && iTest.ptCount == 4) {
62 } else if (oTest.ptCount == 4 && iTest.ptCount == 1) {
64 } else if (oTest.ptCount == 4 && iTest.ptCount == 4) {
|
| /external/skqp/tests/ |
| H A D | PathOpsThreeWayTest.cpp | 15 int ptCount; member in struct:Curve
58 if (oTest.ptCount == 1 && iTest.ptCount == 1) {
60 } else if (oTest.ptCount == 1 && iTest.ptCount == 4) {
62 } else if (oTest.ptCount == 4 && iTest.ptCount == 1) {
64 } else if (oTest.ptCount == 4 && iTest.ptCount == 4) {
|
| /external/skia/src/core/ |
| H A D | SkPathRef.cpp | 240 int ptCount = 0;
246 ptCount = safe.addInt(ptCount, 1);
252 ptCount = safe.addInt(ptCount, 2);
255 ptCount = safe.addInt(ptCount, 3);
266 *ptCountPtr = ptCount;
|
| H A D | SkScan_Hairline.cpp | 426 void extend_pts(SkPath::Verb prevVerb, SkPath::Verb nextVerb, SkPoint* pts, int ptCount) {
433 int controls = ptCount - 1;
440 controls = ptCount - 1; // If all points are equal, move all but one
448 } while (++controls < ptCount);
452 SkPoint* last = &pts[ptCount - 1];
454 int controls = ptCount - 1;
461 controls = ptCount - 1;
469 } while (++controls < ptCount);
|
| H A D | SkDraw.h | 73 const uint16_t indices[], int ptCount,
|
| H A D | SkGlyphCache.h | 223 static void AddPoints(const SkPoint* pts, int ptCount, const SkScalar bounds[2],
|
| H A D | SkGeometry.cpp | 1270 const int ptCount = 2 * quadCount + 1; local
1271 SkASSERT(endPts - pts == ptCount);
1272 if (!SkPointPriv::AreFinite(pts, ptCount)) {
1275 for (int i = 1; i < ptCount - 1; ++i) {
|
| H A D | SkGlyphCache.cpp | 253 void SkGlyphCache::AddPoints(const SkPoint* pts, int ptCount, const SkScalar bounds[2], argument
255 for (int i = 0; i < ptCount; ++i) {
|
| H A D | SkPath.cpp | 2555 int ptCount = 1; // moveTo local
2563 ptCount += 1;
2569 ptCount += 2;
2572 ptCount += 3;
2582 fCurrPtCount = ptCount;
|
| /external/skqp/src/core/ |
| H A D | SkPathRef.cpp | 240 int ptCount = 0;
246 ptCount = safe.addInt(ptCount, 1);
252 ptCount = safe.addInt(ptCount, 2);
255 ptCount = safe.addInt(ptCount, 3);
266 *ptCountPtr = ptCount;
|
| H A D | SkScan_Hairline.cpp | 426 void extend_pts(SkPath::Verb prevVerb, SkPath::Verb nextVerb, SkPoint* pts, int ptCount) {
433 int controls = ptCount - 1;
440 controls = ptCount - 1; // If all points are equal, move all but one
448 } while (++controls < ptCount);
452 SkPoint* last = &pts[ptCount - 1];
454 int controls = ptCount - 1;
461 controls = ptCount - 1;
469 } while (++controls < ptCount);
|
| H A D | SkDraw.h | 72 const uint16_t indices[], int ptCount,
|
| H A D | SkGlyphCache.h | 223 static void AddPoints(const SkPoint* pts, int ptCount, const SkScalar bounds[2],
|
| H A D | SkGeometry.cpp | 1263 const int ptCount = 2 * quadCount + 1; local
1264 SkASSERT(endPts - pts == ptCount);
1265 if (!SkPointPriv::AreFinite(pts, ptCount)) {
1268 for (int i = 1; i < ptCount - 1; ++i) {
|
| H A D | SkGlyphCache.cpp | 253 void SkGlyphCache::AddPoints(const SkPoint* pts, int ptCount, const SkScalar bounds[2], argument
255 for (int i = 0; i < ptCount; ++i) {
|
| /external/skia/src/pathops/ |
| H A D | SkOpEdgeBuilder.cpp | 155 int ptCount = SkPathOpsVerbToPoints(verb); local
156 fPathPts.append(ptCount, &pts[1]);
160 curve[0] = pts[ptCount];
|
| H A D | SkPathOpsCubic.h | 81 bool hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const;
|
| H A D | SkOpAngle.cpp | 410 int ptCount = SkPathOpsVerbToPoints(segment.verb()); local
412 for (int idx1 = 0; idx1 <= ptCount - 1; ++idx1) {
413 for (int idx2 = idx1 + 1; idx2 <= ptCount; ++idx2) {
504 int ptCount = index ? rPts : lPts; local
505 for (int idx2 = 0; idx2 <= ptCount; ++idx2) {
|
| H A D | SkPathOpsCubic.cpp | 149 bool SkDCubic::hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const { argument
181 for (int n = 0; n < ptCount; ++n) {
|
| /external/skqp/src/pathops/ |
| H A D | SkOpEdgeBuilder.cpp | 155 int ptCount = SkPathOpsVerbToPoints(verb); local
156 fPathPts.append(ptCount, &pts[1]);
160 curve[0] = pts[ptCount];
|
| H A D | SkPathOpsCubic.h | 81 bool hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const;
|
| H A D | SkOpAngle.cpp | 410 int ptCount = SkPathOpsVerbToPoints(segment.verb()); local
412 for (int idx1 = 0; idx1 <= ptCount - 1; ++idx1) {
413 for (int idx2 = idx1 + 1; idx2 <= ptCount; ++idx2) {
504 int ptCount = index ? rPts : lPts; local
505 for (int idx2 = 0; idx2 <= ptCount; ++idx2) {
|
| H A D | SkPathOpsCubic.cpp | 149 bool SkDCubic::hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const { argument
181 for (int n = 0; n < ptCount; ++n) {
|
| /external/skia/src/utils/ |
| H A D | SkDashPath.cpp | 314 SkScalar ptCount = pathLength * intervalCount / (float)intervalLength;
315 ptCount = SkTMin(ptCount, SkDashPath::kMaxDashCount);
316 int n = SkScalarCeilToInt(ptCount) << 2;
|
| /external/skqp/src/utils/ |
| H A D | SkDashPath.cpp | 314 SkScalar ptCount = pathLength * intervalCount / (float)intervalLength;
315 ptCount = SkTMin(ptCount, SkDashPath::kMaxDashCount);
316 int n = SkScalarCeilToInt(ptCount) << 2;
|