blob: b1029e1eefdb3d5f9b7a1c0303656aaaa8973da5 [file] [log] [blame]
epoger@google.comec3ed6a2011-07-28 14:26:00 +00001/*
2 * Copyright 2006 The Android Open Source Project
3 *
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
6 */
7
reed@android.com8a1c16f2008-12-17 15:59:43 +00008#include "SkDashPathEffect.h"
egdaniela22ea182014-06-11 06:51:51 -07009
10#include "SkDashPathPriv.h"
commit-bot@chromium.org8b0e8ac2014-01-30 18:58:24 +000011#include "SkReadBuffer.h"
12#include "SkWriteBuffer.h"
halcanary435657f2015-09-15 12:53:07 -070013#include "SkStrokeRec.h"
reed@android.com8a1c16f2008-12-17 15:59:43 +000014
mtklein1c577cd2014-07-09 09:54:10 -070015SkDashPathEffect::SkDashPathEffect(const SkScalar intervals[], int count, SkScalar phase)
16 : fPhase(0)
caryclarkeb75c7d2016-03-18 06:04:26 -070017 , fInitialDashLength(-1)
mtklein1c577cd2014-07-09 09:54:10 -070018 , fInitialDashIndex(0)
19 , fIntervalLength(0) {
commit-bot@chromium.orgaec14382014-04-22 15:21:18 +000020 SkASSERT(intervals);
cblumeeafe9d12016-09-26 04:22:59 -070021 SkASSERT(count > 1 && SkIsAlign2(count));
commit-bot@chromium.orgaec14382014-04-22 15:21:18 +000022
23 fIntervals = (SkScalar*)sk_malloc_throw(sizeof(SkScalar) * count);
24 fCount = count;
25 for (int i = 0; i < count; i++) {
commit-bot@chromium.orgaec14382014-04-22 15:21:18 +000026 fIntervals[i] = intervals[i];
27 }
28
egdaniela22ea182014-06-11 06:51:51 -070029 // set the internal data members
mtklein1c577cd2014-07-09 09:54:10 -070030 SkDashPath::CalcDashParameters(phase, fIntervals, fCount,
31 &fInitialDashLength, &fInitialDashIndex, &fIntervalLength, &fPhase);
commit-bot@chromium.orgaec14382014-04-22 15:21:18 +000032}
33
mike@reedtribe.org3334c3a2011-04-20 11:39:28 +000034SkDashPathEffect::~SkDashPathEffect() {
reed@android.com8a1c16f2008-12-17 15:59:43 +000035 sk_free(fIntervals);
36}
37
mike@reedtribe.org3334c3a2011-04-20 11:39:28 +000038bool SkDashPathEffect::filterPath(SkPath* dst, const SkPath& src,
reed@google.com4bbdeac2013-01-24 21:03:11 +000039 SkStrokeRec* rec, const SkRect* cullRect) const {
caryclarkeb75c7d2016-03-18 06:04:26 -070040 return SkDashPath::InternalFilter(dst, src, rec, cullRect, fIntervals, fCount,
egdaniela22ea182014-06-11 06:51:51 -070041 fInitialDashLength, fInitialDashIndex, fIntervalLength);
reed@android.com8a1c16f2008-12-17 15:59:43 +000042}
43
robertphillips9f2251c2014-11-04 13:33:50 -080044static void outset_for_stroke(SkRect* rect, const SkStrokeRec& rec) {
45 SkScalar radius = SkScalarHalf(rec.getWidth());
46 if (0 == radius) {
47 radius = SK_Scalar1; // hairlines
48 }
49 if (SkPaint::kMiter_Join == rec.getJoin()) {
Mike Reed8be952a2017-02-13 20:44:33 -050050 radius *= rec.getMiter();
robertphillips9f2251c2014-11-04 13:33:50 -080051 }
52 rect->outset(radius, radius);
53}
54
mtklein88fd0fb2014-12-01 06:56:38 -080055// Attempt to trim the line to minimally cover the cull rect (currently
robertphillips9f2251c2014-11-04 13:33:50 -080056// only works for horizontal and vertical lines).
57// Return true if processing should continue; false otherwise.
58static bool cull_line(SkPoint* pts, const SkStrokeRec& rec,
59 const SkMatrix& ctm, const SkRect* cullRect,
60 const SkScalar intervalLength) {
halcanary96fcdcc2015-08-27 07:41:13 -070061 if (nullptr == cullRect) {
robertphillips9f2251c2014-11-04 13:33:50 -080062 SkASSERT(false); // Shouldn't ever occur in practice
63 return false;
64 }
65
66 SkScalar dx = pts[1].x() - pts[0].x();
67 SkScalar dy = pts[1].y() - pts[0].y();
68
egdaniel21402e32014-11-05 05:02:27 -080069 if ((dx && dy) || (!dx && !dy)) {
robertphillips9f2251c2014-11-04 13:33:50 -080070 return false;
71 }
72
73 SkRect bounds = *cullRect;
74 outset_for_stroke(&bounds, rec);
75
76 // cullRect is in device space while pts are in the local coordinate system
77 // defined by the ctm. We want our answer in the local coordinate system.
78
79 SkASSERT(ctm.rectStaysRect());
80 SkMatrix inv;
81 if (!ctm.invert(&inv)) {
82 return false;
83 }
84
85 inv.mapRect(&bounds);
86
87 if (dx) {
88 SkASSERT(dx && !dy);
89 SkScalar minX = pts[0].fX;
90 SkScalar maxX = pts[1].fX;
91
92 if (dx < 0) {
93 SkTSwap(minX, maxX);
94 }
95
96 SkASSERT(minX < maxX);
reedccc12ed2014-12-12 12:48:50 -080097 if (maxX <= bounds.fLeft || minX >= bounds.fRight) {
robertphillips9f2251c2014-11-04 13:33:50 -080098 return false;
99 }
100
101 // Now we actually perform the chop, removing the excess to the left and
102 // right of the bounds (keeping our new line "in phase" with the dash,
103 // hence the (mod intervalLength).
104
105 if (minX < bounds.fLeft) {
106 minX = bounds.fLeft - SkScalarMod(bounds.fLeft - minX, intervalLength);
107 }
108 if (maxX > bounds.fRight) {
109 maxX = bounds.fRight + SkScalarMod(maxX - bounds.fRight, intervalLength);
110 }
111
112 SkASSERT(maxX > minX);
113 if (dx < 0) {
114 SkTSwap(minX, maxX);
115 }
116 pts[0].fX = minX;
117 pts[1].fX = maxX;
118 } else {
119 SkASSERT(dy && !dx);
120 SkScalar minY = pts[0].fY;
121 SkScalar maxY = pts[1].fY;
122
123 if (dy < 0) {
124 SkTSwap(minY, maxY);
125 }
126
127 SkASSERT(minY < maxY);
reedccc12ed2014-12-12 12:48:50 -0800128 if (maxY <= bounds.fTop || minY >= bounds.fBottom) {
robertphillips9f2251c2014-11-04 13:33:50 -0800129 return false;
130 }
131
132 // Now we actually perform the chop, removing the excess to the top and
133 // bottom of the bounds (keeping our new line "in phase" with the dash,
134 // hence the (mod intervalLength).
135
136 if (minY < bounds.fTop) {
137 minY = bounds.fTop - SkScalarMod(bounds.fTop - minY, intervalLength);
138 }
139 if (maxY > bounds.fBottom) {
140 maxY = bounds.fBottom + SkScalarMod(maxY - bounds.fBottom, intervalLength);
141 }
142
143 SkASSERT(maxY > minY);
144 if (dy < 0) {
145 SkTSwap(minY, maxY);
146 }
147 pts[0].fY = minY;
148 pts[1].fY = maxY;
149 }
150
151 return true;
152}
153
robertphillips@google.com629ab542012-11-28 17:18:11 +0000154// Currently asPoints is more restrictive then it needs to be. In the future
155// we need to:
156// allow kRound_Cap capping (could allow rotations in the matrix with this)
robertphillips@google.com6d875572012-12-17 18:56:29 +0000157// allow paths to be returned
robertphillips@google.com629ab542012-11-28 17:18:11 +0000158bool SkDashPathEffect::asPoints(PointData* results,
159 const SkPath& src,
160 const SkStrokeRec& rec,
reed@google.com4bbdeac2013-01-24 21:03:11 +0000161 const SkMatrix& matrix,
162 const SkRect* cullRect) const {
robertphillips@google.com6d875572012-12-17 18:56:29 +0000163 // width < 0 -> fill && width == 0 -> hairline so requiring width > 0 rules both out
caryclarkeb75c7d2016-03-18 06:04:26 -0700164 if (0 >= rec.getWidth()) {
robertphillips@google.com629ab542012-11-28 17:18:11 +0000165 return false;
166 }
167
robertphillips@google.com6d875572012-12-17 18:56:29 +0000168 // TODO: this next test could be eased up. We could allow any number of
169 // intervals as long as all the ons match and all the offs match.
170 // Additionally, they do not necessarily need to be integers.
171 // We cannot allow arbitrary intervals since we want the returned points
172 // to be uniformly sized.
skia.committer@gmail.com7a03d862012-12-18 02:03:03 +0000173 if (fCount != 2 ||
robertphillips@google.com6d875572012-12-17 18:56:29 +0000174 !SkScalarNearlyEqual(fIntervals[0], fIntervals[1]) ||
175 !SkScalarIsInt(fIntervals[0]) ||
176 !SkScalarIsInt(fIntervals[1])) {
robertphillips@google.com629ab542012-11-28 17:18:11 +0000177 return false;
178 }
179
robertphillips@google.com629ab542012-11-28 17:18:11 +0000180 SkPoint pts[2];
181
robertphillips@google.com6d875572012-12-17 18:56:29 +0000182 if (!src.isLine(pts)) {
robertphillips@google.com629ab542012-11-28 17:18:11 +0000183 return false;
184 }
185
robertphillips@google.com6d875572012-12-17 18:56:29 +0000186 // TODO: this test could be eased up to allow circles
robertphillips@google.com629ab542012-11-28 17:18:11 +0000187 if (SkPaint::kButt_Cap != rec.getCap()) {
188 return false;
189 }
190
robertphillips@google.com6d875572012-12-17 18:56:29 +0000191 // TODO: this test could be eased up for circles. Rotations could be allowed.
robertphillips@google.com629ab542012-11-28 17:18:11 +0000192 if (!matrix.rectStaysRect()) {
193 return false;
194 }
195
robertphillips9f2251c2014-11-04 13:33:50 -0800196 // See if the line can be limited to something plausible.
197 if (!cull_line(pts, rec, matrix, cullRect, fIntervalLength)) {
198 return false;
199 }
200
201 SkScalar length = SkPoint::Distance(pts[1], pts[0]);
robertphillips@google.com629ab542012-11-28 17:18:11 +0000202
robertphillips@google.com6d875572012-12-17 18:56:29 +0000203 SkVector tangent = pts[1] - pts[0];
204 if (tangent.isZero()) {
205 return false;
206 }
207
208 tangent.scale(SkScalarInvert(length));
209
210 // TODO: make this test for horizontal & vertical lines more robust
211 bool isXAxis = true;
robertphillips9f2251c2014-11-04 13:33:50 -0800212 if (SkScalarNearlyEqual(SK_Scalar1, tangent.fX) ||
213 SkScalarNearlyEqual(-SK_Scalar1, tangent.fX)) {
robertphillips@google.com6d875572012-12-17 18:56:29 +0000214 results->fSize.set(SkScalarHalf(fIntervals[0]), SkScalarHalf(rec.getWidth()));
robertphillips9f2251c2014-11-04 13:33:50 -0800215 } else if (SkScalarNearlyEqual(SK_Scalar1, tangent.fY) ||
216 SkScalarNearlyEqual(-SK_Scalar1, tangent.fY)) {
robertphillips@google.com6d875572012-12-17 18:56:29 +0000217 results->fSize.set(SkScalarHalf(rec.getWidth()), SkScalarHalf(fIntervals[0]));
218 isXAxis = false;
219 } else if (SkPaint::kRound_Cap != rec.getCap()) {
220 // Angled lines don't have axis-aligned boxes.
robertphillips@google.com629ab542012-11-28 17:18:11 +0000221 return false;
222 }
223
bsalomon49f085d2014-09-05 13:34:00 -0700224 if (results) {
skia.committer@gmail.com7a03d862012-12-18 02:03:03 +0000225 results->fFlags = 0;
robertphillips@google.com5c4d5582013-01-15 12:53:31 +0000226 SkScalar clampedInitialDashLength = SkMinScalar(length, fInitialDashLength);
robertphillips@google.com629ab542012-11-28 17:18:11 +0000227
robertphillips@google.com6d875572012-12-17 18:56:29 +0000228 if (SkPaint::kRound_Cap == rec.getCap()) {
229 results->fFlags |= PointData::kCircles_PointFlag;
robertphillips@google.com629ab542012-11-28 17:18:11 +0000230 }
231
robertphillips@google.com6d875572012-12-17 18:56:29 +0000232 results->fNumPoints = 0;
233 SkScalar len2 = length;
robertphillips@google.com5c4d5582013-01-15 12:53:31 +0000234 if (clampedInitialDashLength > 0 || 0 == fInitialDashIndex) {
235 SkASSERT(len2 >= clampedInitialDashLength);
robertphillips@google.com6d875572012-12-17 18:56:29 +0000236 if (0 == fInitialDashIndex) {
robertphillips@google.com5c4d5582013-01-15 12:53:31 +0000237 if (clampedInitialDashLength > 0) {
robertphillips@google.com5c4d5582013-01-15 12:53:31 +0000238 if (clampedInitialDashLength >= fIntervals[0]) {
robertphillips@google.com6d875572012-12-17 18:56:29 +0000239 ++results->fNumPoints; // partial first dash
240 }
robertphillips@google.com5c4d5582013-01-15 12:53:31 +0000241 len2 -= clampedInitialDashLength;
robertphillips@google.com6d875572012-12-17 18:56:29 +0000242 }
243 len2 -= fIntervals[1]; // also skip first space
244 if (len2 < 0) {
245 len2 = 0;
246 }
247 } else {
robertphillips@google.com5c4d5582013-01-15 12:53:31 +0000248 len2 -= clampedInitialDashLength; // skip initial partial empty
robertphillips@google.com6d875572012-12-17 18:56:29 +0000249 }
250 }
lsalzmanf41ae2f2016-07-21 09:37:59 -0700251 // Too many midpoints can cause results->fNumPoints to overflow or
252 // otherwise cause the results->fPoints allocation below to OOM.
253 // Cap it to a sane value.
254 SkScalar numIntervals = len2 / fIntervalLength;
255 if (!SkScalarIsFinite(numIntervals) || numIntervals > SkDashPath::kMaxDashCount) {
256 return false;
257 }
258 int numMidPoints = SkScalarFloorToInt(numIntervals);
robertphillips@google.com6d875572012-12-17 18:56:29 +0000259 results->fNumPoints += numMidPoints;
260 len2 -= numMidPoints * fIntervalLength;
261 bool partialLast = false;
262 if (len2 > 0) {
263 if (len2 < fIntervals[0]) {
skia.committer@gmail.com7a03d862012-12-18 02:03:03 +0000264 partialLast = true;
robertphillips@google.com6d875572012-12-17 18:56:29 +0000265 } else {
266 ++numMidPoints;
267 ++results->fNumPoints;
268 }
269 }
robertphillips@google.com629ab542012-11-28 17:18:11 +0000270
robertphillips@google.com935ad022012-12-05 19:07:21 +0000271 results->fPoints = new SkPoint[results->fNumPoints];
robertphillips@google.com629ab542012-11-28 17:18:11 +0000272
robertphillips@google.com6d875572012-12-17 18:56:29 +0000273 SkScalar distance = 0;
274 int curPt = 0;
robertphillips@google.com629ab542012-11-28 17:18:11 +0000275
robertphillips@google.com5c4d5582013-01-15 12:53:31 +0000276 if (clampedInitialDashLength > 0 || 0 == fInitialDashIndex) {
277 SkASSERT(clampedInitialDashLength <= length);
robertphillips@google.com629ab542012-11-28 17:18:11 +0000278
robertphillips@google.com6d875572012-12-17 18:56:29 +0000279 if (0 == fInitialDashIndex) {
robertphillips@google.com5c4d5582013-01-15 12:53:31 +0000280 if (clampedInitialDashLength > 0) {
robertphillips@google.com6d875572012-12-17 18:56:29 +0000281 // partial first block
282 SkASSERT(SkPaint::kRound_Cap != rec.getCap()); // can't handle partial circles
Mike Reed8be952a2017-02-13 20:44:33 -0500283 SkScalar x = pts[0].fX + tangent.fX * SkScalarHalf(clampedInitialDashLength);
284 SkScalar y = pts[0].fY + tangent.fY * SkScalarHalf(clampedInitialDashLength);
robertphillips@google.com6d875572012-12-17 18:56:29 +0000285 SkScalar halfWidth, halfHeight;
286 if (isXAxis) {
robertphillips@google.com5c4d5582013-01-15 12:53:31 +0000287 halfWidth = SkScalarHalf(clampedInitialDashLength);
robertphillips@google.com6d875572012-12-17 18:56:29 +0000288 halfHeight = SkScalarHalf(rec.getWidth());
289 } else {
290 halfWidth = SkScalarHalf(rec.getWidth());
robertphillips@google.com5c4d5582013-01-15 12:53:31 +0000291 halfHeight = SkScalarHalf(clampedInitialDashLength);
robertphillips@google.com6d875572012-12-17 18:56:29 +0000292 }
robertphillips@google.com5c4d5582013-01-15 12:53:31 +0000293 if (clampedInitialDashLength < fIntervals[0]) {
robertphillips@google.com6d875572012-12-17 18:56:29 +0000294 // This one will not be like the others
295 results->fFirst.addRect(x - halfWidth, y - halfHeight,
296 x + halfWidth, y + halfHeight);
297 } else {
298 SkASSERT(curPt < results->fNumPoints);
299 results->fPoints[curPt].set(x, y);
300 ++curPt;
301 }
302
robertphillips@google.com5c4d5582013-01-15 12:53:31 +0000303 distance += clampedInitialDashLength;
robertphillips@google.com6d875572012-12-17 18:56:29 +0000304 }
305
306 distance += fIntervals[1]; // skip over the next blank block too
307 } else {
robertphillips@google.com5c4d5582013-01-15 12:53:31 +0000308 distance += clampedInitialDashLength;
robertphillips@google.com629ab542012-11-28 17:18:11 +0000309 }
robertphillips@google.com629ab542012-11-28 17:18:11 +0000310 }
robertphillips@google.com935ad022012-12-05 19:07:21 +0000311
robertphillips@google.com6d875572012-12-17 18:56:29 +0000312 if (0 != numMidPoints) {
313 distance += SkScalarHalf(fIntervals[0]);
314
315 for (int i = 0; i < numMidPoints; ++i) {
Mike Reed8be952a2017-02-13 20:44:33 -0500316 SkScalar x = pts[0].fX + tangent.fX * distance;
317 SkScalar y = pts[0].fY + tangent.fY * distance;
robertphillips@google.com6d875572012-12-17 18:56:29 +0000318
319 SkASSERT(curPt < results->fNumPoints);
320 results->fPoints[curPt].set(x, y);
321 ++curPt;
322
323 distance += fIntervalLength;
324 }
325
326 distance -= SkScalarHalf(fIntervals[0]);
327 }
328
329 if (partialLast) {
330 // partial final block
331 SkASSERT(SkPaint::kRound_Cap != rec.getCap()); // can't handle partial circles
332 SkScalar temp = length - distance;
333 SkASSERT(temp < fIntervals[0]);
Mike Reed8be952a2017-02-13 20:44:33 -0500334 SkScalar x = pts[0].fX + tangent.fX * (distance + SkScalarHalf(temp));
335 SkScalar y = pts[0].fY + tangent.fY * (distance + SkScalarHalf(temp));
robertphillips@google.com6d875572012-12-17 18:56:29 +0000336 SkScalar halfWidth, halfHeight;
337 if (isXAxis) {
338 halfWidth = SkScalarHalf(temp);
339 halfHeight = SkScalarHalf(rec.getWidth());
340 } else {
341 halfWidth = SkScalarHalf(rec.getWidth());
342 halfHeight = SkScalarHalf(temp);
343 }
344 results->fLast.addRect(x - halfWidth, y - halfHeight,
345 x + halfWidth, y + halfHeight);
346 }
347
348 SkASSERT(curPt == results->fNumPoints);
robertphillips@google.com629ab542012-11-28 17:18:11 +0000349 }
350
351 return true;
352}
353
commit-bot@chromium.orgaec14382014-04-22 15:21:18 +0000354SkPathEffect::DashType SkDashPathEffect::asADash(DashInfo* info) const {
355 if (info) {
bsalomon49f085d2014-09-05 13:34:00 -0700356 if (info->fCount >= fCount && info->fIntervals) {
commit-bot@chromium.orgaec14382014-04-22 15:21:18 +0000357 memcpy(info->fIntervals, fIntervals, fCount * sizeof(SkScalar));
358 }
359 info->fCount = fCount;
360 info->fPhase = fPhase;
361 }
362 return kDash_DashType;
363}
364
commit-bot@chromium.org8b0e8ac2014-01-30 18:58:24 +0000365void SkDashPathEffect::flatten(SkWriteBuffer& buffer) const {
commit-bot@chromium.orgaec14382014-04-22 15:21:18 +0000366 buffer.writeScalar(fPhase);
djsollen@google.comc73dd5c2012-08-07 15:54:32 +0000367 buffer.writeScalarArray(fIntervals, fCount);
reed@android.com8a1c16f2008-12-17 15:59:43 +0000368}
369
reed60c9b582016-04-03 09:11:13 -0700370sk_sp<SkFlattenable> SkDashPathEffect::CreateProc(SkReadBuffer& buffer) {
reed9fa60da2014-08-21 07:59:51 -0700371 const SkScalar phase = buffer.readScalar();
372 uint32_t count = buffer.getArrayCount();
373 SkAutoSTArray<32, SkScalar> intervals(count);
374 if (buffer.readScalarArray(intervals.get(), count)) {
reed60c9b582016-04-03 09:11:13 -0700375 return Make(intervals.get(), SkToInt(count), phase);
reed9fa60da2014-08-21 07:59:51 -0700376 }
halcanary96fcdcc2015-08-27 07:41:13 -0700377 return nullptr;
reed@android.com8a1c16f2008-12-17 15:59:43 +0000378}
robertphillips42dbfa82015-01-26 06:08:52 -0800379
380#ifndef SK_IGNORE_TO_STRING
381void SkDashPathEffect::toString(SkString* str) const {
382 str->appendf("SkDashPathEffect: (");
383 str->appendf("count: %d phase %.2f intervals: (", fCount, fPhase);
384 for (int i = 0; i < fCount; ++i) {
385 str->appendf("%.2f", fIntervals[i]);
386 if (i < fCount-1) {
387 str->appendf(", ");
388 }
389 }
390 str->appendf("))");
391}
392#endif
reedca726ab2016-02-22 12:50:25 -0800393
394//////////////////////////////////////////////////////////////////////////////////////////////////
395
reeda4393342016-03-18 11:22:57 -0700396sk_sp<SkPathEffect> SkDashPathEffect::Make(const SkScalar intervals[], int count, SkScalar phase) {
caryclarkeb75c7d2016-03-18 06:04:26 -0700397 if (!SkDashPath::ValidDashPath(phase, intervals, count)) {
reedca726ab2016-02-22 12:50:25 -0800398 return nullptr;
399 }
reeda4393342016-03-18 11:22:57 -0700400 return sk_sp<SkPathEffect>(new SkDashPathEffect(intervals, count, phase));
reedca726ab2016-02-22 12:50:25 -0800401}