epoger@google.com | ec3ed6a | 2011-07-28 14:26:00 +0000 | [diff] [blame] | 1 | /* |
| 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 | |
Hal Canary | c640d0d | 2018-06-13 09:59:02 -0400 | [diff] [blame^] | 8 | #include "SkPath.h" |
| 9 | |
djsollen@google.com | 94e75ee | 2012-06-08 18:30:46 +0000 | [diff] [blame] | 10 | #include "SkBuffer.h" |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 11 | #include "SkCubicClipper.h" |
Mike Reed | 41a930f | 2017-07-26 17:33:44 -0400 | [diff] [blame] | 12 | #include "SkData.h" |
reed | 220f926 | 2014-12-17 08:21:04 -0800 | [diff] [blame] | 13 | #include "SkGeometry.h" |
Hal Canary | 22be4c4 | 2018-06-12 12:37:31 -0400 | [diff] [blame] | 14 | #include "SkMacros.h" |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 15 | #include "SkMath.h" |
Cary Clark | 9480d82 | 2017-10-19 18:01:13 -0400 | [diff] [blame] | 16 | #include "SkMatrixPriv.h" |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 17 | #include "SkPathPriv.h" |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 18 | #include "SkPathRef.h" |
Cary Clark | df429f3 | 2017-11-08 11:44:31 -0500 | [diff] [blame] | 19 | #include "SkPointPriv.h" |
reed@google.com | 4ed0fb7 | 2012-12-12 20:48:18 +0000 | [diff] [blame] | 20 | #include "SkRRect.h" |
Mike Reed | 267eccc | 2018-02-21 15:55:14 -0500 | [diff] [blame] | 21 | #include "SkSafeMath.h" |
Hal Canary | c640d0d | 2018-06-13 09:59:02 -0400 | [diff] [blame^] | 22 | #include "SkTo.h" |
| 23 | |
| 24 | #include <cmath> |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 25 | |
Mike Reed | a99b6ce | 2017-02-04 11:04:26 -0500 | [diff] [blame] | 26 | static float poly_eval(float A, float B, float C, float t) { |
| 27 | return (A * t + B) * t + C; |
| 28 | } |
| 29 | |
| 30 | static float poly_eval(float A, float B, float C, float D, float t) { |
| 31 | return ((A * t + B) * t + C) * t + D; |
| 32 | } |
| 33 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 34 | //////////////////////////////////////////////////////////////////////////// |
| 35 | |
reed@google.com | 3563c9e | 2011-11-14 19:34:57 +0000 | [diff] [blame] | 36 | /** |
| 37 | * Path.bounds is defined to be the bounds of all the control points. |
| 38 | * If we called bounds.join(r) we would skip r if r was empty, which breaks |
| 39 | * our promise. Hence we have a custom joiner that doesn't look at emptiness |
| 40 | */ |
| 41 | static void joinNoEmptyChecks(SkRect* dst, const SkRect& src) { |
| 42 | dst->fLeft = SkMinScalar(dst->fLeft, src.fLeft); |
| 43 | dst->fTop = SkMinScalar(dst->fTop, src.fTop); |
| 44 | dst->fRight = SkMaxScalar(dst->fRight, src.fRight); |
| 45 | dst->fBottom = SkMaxScalar(dst->fBottom, src.fBottom); |
| 46 | } |
| 47 | |
bsalomon@google.com | fb6f0f6 | 2012-01-31 18:44:34 +0000 | [diff] [blame] | 48 | static bool is_degenerate(const SkPath& path) { |
| 49 | SkPath::Iter iter(path, false); |
| 50 | SkPoint pts[4]; |
| 51 | return SkPath::kDone_Verb == iter.next(pts); |
| 52 | } |
| 53 | |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 54 | class SkAutoDisableDirectionCheck { |
| 55 | public: |
| 56 | SkAutoDisableDirectionCheck(SkPath* path) : fPath(path) { |
herb | 9f4dbca | 2015-09-28 11:05:47 -0700 | [diff] [blame] | 57 | fSaved = static_cast<SkPathPriv::FirstDirection>(fPath->fFirstDirection.load()); |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 58 | } |
| 59 | |
| 60 | ~SkAutoDisableDirectionCheck() { |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 61 | fPath->fFirstDirection = fSaved; |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 62 | } |
| 63 | |
| 64 | private: |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 65 | SkPath* fPath; |
| 66 | SkPathPriv::FirstDirection fSaved; |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 67 | }; |
commit-bot@chromium.org | e61a86c | 2013-11-18 16:03:59 +0000 | [diff] [blame] | 68 | #define SkAutoDisableDirectionCheck(...) SK_REQUIRE_LOCAL_VAR(SkAutoDisableDirectionCheck) |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 69 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 70 | /* This guy's constructor/destructor bracket a path editing operation. It is |
| 71 | used when we know the bounds of the amount we are going to add to the path |
| 72 | (usually a new contour, but not required). |
reed@google.com | abf15c1 | 2011-01-18 20:35:51 +0000 | [diff] [blame] | 73 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 74 | It captures some state about the path up front (i.e. if it already has a |
robertphillips@google.com | ca0c838 | 2013-09-26 12:18:23 +0000 | [diff] [blame] | 75 | cached bounds), and then if it can, it updates the cache bounds explicitly, |
reed@android.com | d252db0 | 2009-04-01 18:31:44 +0000 | [diff] [blame] | 76 | avoiding the need to revisit all of the points in getBounds(). |
reed@google.com | abf15c1 | 2011-01-18 20:35:51 +0000 | [diff] [blame] | 77 | |
bsalomon@google.com | fb6f0f6 | 2012-01-31 18:44:34 +0000 | [diff] [blame] | 78 | It also notes if the path was originally degenerate, and if so, sets |
| 79 | isConvex to true. Thus it can only be used if the contour being added is |
robertphillips@google.com | 466310d | 2013-12-03 16:43:54 +0000 | [diff] [blame] | 80 | convex. |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 81 | */ |
| 82 | class SkAutoPathBoundsUpdate { |
| 83 | public: |
| 84 | SkAutoPathBoundsUpdate(SkPath* path, const SkRect& r) : fRect(r) { |
| 85 | this->init(path); |
| 86 | } |
| 87 | |
| 88 | SkAutoPathBoundsUpdate(SkPath* path, SkScalar left, SkScalar top, |
| 89 | SkScalar right, SkScalar bottom) { |
| 90 | fRect.set(left, top, right, bottom); |
| 91 | this->init(path); |
| 92 | } |
reed@google.com | abf15c1 | 2011-01-18 20:35:51 +0000 | [diff] [blame] | 93 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 94 | ~SkAutoPathBoundsUpdate() { |
reed@google.com | 4469938 | 2013-10-31 17:28:30 +0000 | [diff] [blame] | 95 | fPath->setConvexity(fDegenerate ? SkPath::kConvex_Convexity |
| 96 | : SkPath::kUnknown_Convexity); |
Mike Reed | 926e193 | 2018-01-29 15:56:11 -0500 | [diff] [blame] | 97 | if ((fEmpty || fHasValidBounds) && fRect.isFinite()) { |
robertphillips@google.com | ca0c838 | 2013-09-26 12:18:23 +0000 | [diff] [blame] | 98 | fPath->setBounds(fRect); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 99 | } |
| 100 | } |
reed@google.com | abf15c1 | 2011-01-18 20:35:51 +0000 | [diff] [blame] | 101 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 102 | private: |
reed@android.com | 6b82d1a | 2009-06-03 02:35:01 +0000 | [diff] [blame] | 103 | SkPath* fPath; |
| 104 | SkRect fRect; |
robertphillips@google.com | ca0c838 | 2013-09-26 12:18:23 +0000 | [diff] [blame] | 105 | bool fHasValidBounds; |
bsalomon@google.com | fb6f0f6 | 2012-01-31 18:44:34 +0000 | [diff] [blame] | 106 | bool fDegenerate; |
reed@android.com | 6b82d1a | 2009-06-03 02:35:01 +0000 | [diff] [blame] | 107 | bool fEmpty; |
reed@google.com | abf15c1 | 2011-01-18 20:35:51 +0000 | [diff] [blame] | 108 | |
reed@android.com | 6b82d1a | 2009-06-03 02:35:01 +0000 | [diff] [blame] | 109 | void init(SkPath* path) { |
robertphillips@google.com | ca0c838 | 2013-09-26 12:18:23 +0000 | [diff] [blame] | 110 | // Cannot use fRect for our bounds unless we know it is sorted |
| 111 | fRect.sort(); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 112 | fPath = path; |
reed@google.com | a8790de | 2012-10-24 21:04:04 +0000 | [diff] [blame] | 113 | // Mark the path's bounds as dirty if (1) they are, or (2) the path |
| 114 | // is non-finite, and therefore its bounds are not meaningful |
robertphillips@google.com | ca0c838 | 2013-09-26 12:18:23 +0000 | [diff] [blame] | 115 | fHasValidBounds = path->hasComputedBounds() && path->isFinite(); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 116 | fEmpty = path->isEmpty(); |
robertphillips@google.com | ca0c838 | 2013-09-26 12:18:23 +0000 | [diff] [blame] | 117 | if (fHasValidBounds && !fEmpty) { |
| 118 | joinNoEmptyChecks(&fRect, fPath->getBounds()); |
| 119 | } |
| 120 | fDegenerate = is_degenerate(*path); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 121 | } |
| 122 | }; |
commit-bot@chromium.org | e61a86c | 2013-11-18 16:03:59 +0000 | [diff] [blame] | 123 | #define SkAutoPathBoundsUpdate(...) SK_REQUIRE_LOCAL_VAR(SkAutoPathBoundsUpdate) |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 124 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 125 | //////////////////////////////////////////////////////////////////////////// |
| 126 | |
| 127 | /* |
| 128 | Stores the verbs and points as they are given to us, with exceptions: |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 129 | - we only record "Close" if it was immediately preceeded by Move | Line | Quad | Cubic |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 130 | - we insert a Move(0,0) if Line | Quad | Cubic is our first command |
| 131 | |
| 132 | The iterator does more cleanup, especially if forceClose == true |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 133 | 1. If we encounter degenerate segments, remove them |
| 134 | 2. if we encounter Close, return a cons'd up Line() first (if the curr-pt != start-pt) |
| 135 | 3. if we encounter Move without a preceeding Close, and forceClose is true, goto #2 |
| 136 | 4. if we encounter Line | Quad | Cubic after Close, cons up a Move |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 137 | */ |
| 138 | |
| 139 | //////////////////////////////////////////////////////////////////////////// |
| 140 | |
commit-bot@chromium.org | 5e1a7f2 | 2014-02-12 17:44:30 +0000 | [diff] [blame] | 141 | // flag to require a moveTo if we begin with something else, like lineTo etc. |
| 142 | #define INITIAL_LASTMOVETOINDEX_VALUE ~0 |
| 143 | |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 144 | SkPath::SkPath() |
djsollen | 523cda3 | 2015-02-17 08:06:32 -0800 | [diff] [blame] | 145 | : fPathRef(SkPathRef::CreateEmpty()) { |
bungeman@google.com | a5809a3 | 2013-06-21 15:13:34 +0000 | [diff] [blame] | 146 | this->resetFields(); |
jvanverth | b3eb687 | 2014-10-24 07:12:51 -0700 | [diff] [blame] | 147 | fIsVolatile = false; |
Yuqian Li | 9438790 | 2018-04-11 16:34:06 -0400 | [diff] [blame] | 148 | fIsBadForDAA = false; |
bungeman@google.com | a5809a3 | 2013-06-21 15:13:34 +0000 | [diff] [blame] | 149 | } |
| 150 | |
| 151 | void SkPath::resetFields() { |
| 152 | //fPathRef is assumed to have been emptied by the caller. |
commit-bot@chromium.org | 5e1a7f2 | 2014-02-12 17:44:30 +0000 | [diff] [blame] | 153 | fLastMoveToIndex = INITIAL_LASTMOVETOINDEX_VALUE; |
bungeman@google.com | a5809a3 | 2013-06-21 15:13:34 +0000 | [diff] [blame] | 154 | fFillType = kWinding_FillType; |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 155 | fConvexity = kUnknown_Convexity; |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 156 | fFirstDirection = SkPathPriv::kUnknown_FirstDirection; |
commit-bot@chromium.org | 1ab9f73 | 2013-10-30 18:57:55 +0000 | [diff] [blame] | 157 | |
| 158 | // We don't touch Android's fSourcePath. It's used to track texture garbage collection, so we |
halcanary | 96fcdcc | 2015-08-27 07:41:13 -0700 | [diff] [blame] | 159 | // don't want to muck with it if it's been set to something non-nullptr. |
reed@android.com | 6b82d1a | 2009-06-03 02:35:01 +0000 | [diff] [blame] | 160 | } |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 161 | |
bungeman@google.com | a5809a3 | 2013-06-21 15:13:34 +0000 | [diff] [blame] | 162 | SkPath::SkPath(const SkPath& that) |
mtklein@google.com | 9c9d4a7 | 2013-08-07 19:17:53 +0000 | [diff] [blame] | 163 | : fPathRef(SkRef(that.fPathRef.get())) { |
bungeman@google.com | a5809a3 | 2013-06-21 15:13:34 +0000 | [diff] [blame] | 164 | this->copyFields(that); |
| 165 | SkDEBUGCODE(that.validate();) |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 166 | } |
| 167 | |
| 168 | SkPath::~SkPath() { |
| 169 | SkDEBUGCODE(this->validate();) |
| 170 | } |
| 171 | |
bungeman@google.com | a5809a3 | 2013-06-21 15:13:34 +0000 | [diff] [blame] | 172 | SkPath& SkPath::operator=(const SkPath& that) { |
| 173 | SkDEBUGCODE(that.validate();) |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 174 | |
bungeman@google.com | a5809a3 | 2013-06-21 15:13:34 +0000 | [diff] [blame] | 175 | if (this != &that) { |
| 176 | fPathRef.reset(SkRef(that.fPathRef.get())); |
| 177 | this->copyFields(that); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 178 | } |
| 179 | SkDEBUGCODE(this->validate();) |
| 180 | return *this; |
| 181 | } |
| 182 | |
bungeman@google.com | a5809a3 | 2013-06-21 15:13:34 +0000 | [diff] [blame] | 183 | void SkPath::copyFields(const SkPath& that) { |
| 184 | //fPathRef is assumed to have been set by the caller. |
commit-bot@chromium.org | 5e1a7f2 | 2014-02-12 17:44:30 +0000 | [diff] [blame] | 185 | fLastMoveToIndex = that.fLastMoveToIndex; |
bungeman@google.com | a5809a3 | 2013-06-21 15:13:34 +0000 | [diff] [blame] | 186 | fFillType = that.fFillType; |
jvanverth | b3eb687 | 2014-10-24 07:12:51 -0700 | [diff] [blame] | 187 | fIsVolatile = that.fIsVolatile; |
Yuqian Li | 9438790 | 2018-04-11 16:34:06 -0400 | [diff] [blame] | 188 | fIsBadForDAA = that.fIsBadForDAA; |
Mike Klein | b9b5de5 | 2017-09-27 13:26:22 -0400 | [diff] [blame] | 189 | |
| 190 | // Non-atomic assignment of atomic values. |
| 191 | fConvexity .store(that.fConvexity .load()); |
| 192 | fFirstDirection.store(that.fFirstDirection.load()); |
bungeman@google.com | a5809a3 | 2013-06-21 15:13:34 +0000 | [diff] [blame] | 193 | } |
| 194 | |
djsollen@google.com | 9c1a967 | 2013-08-09 13:49:13 +0000 | [diff] [blame] | 195 | bool operator==(const SkPath& a, const SkPath& b) { |
reed@android.com | 6b82d1a | 2009-06-03 02:35:01 +0000 | [diff] [blame] | 196 | // note: don't need to look at isConvex or bounds, since just comparing the |
| 197 | // raw data is sufficient. |
reed@android.com | 3abec1d | 2009-03-02 05:36:20 +0000 | [diff] [blame] | 198 | return &a == &b || |
robertphillips@google.com | 6b8dbb6 | 2013-12-12 23:03:51 +0000 | [diff] [blame] | 199 | (a.fFillType == b.fFillType && *a.fPathRef.get() == *b.fPathRef.get()); |
reed@android.com | 3abec1d | 2009-03-02 05:36:20 +0000 | [diff] [blame] | 200 | } |
| 201 | |
bungeman@google.com | a5809a3 | 2013-06-21 15:13:34 +0000 | [diff] [blame] | 202 | void SkPath::swap(SkPath& that) { |
bungeman@google.com | a5809a3 | 2013-06-21 15:13:34 +0000 | [diff] [blame] | 203 | if (this != &that) { |
bungeman | 77a53de | 2015-10-01 12:28:49 -0700 | [diff] [blame] | 204 | fPathRef.swap(that.fPathRef); |
Ben Wagner | cee46e5 | 2018-06-12 16:30:29 -0400 | [diff] [blame] | 205 | SkTSwap(fLastMoveToIndex, that.fLastMoveToIndex); |
| 206 | SkTSwap(fFillType, that.fFillType); |
| 207 | SkTSwap(fIsVolatile, that.fIsVolatile); |
Mike Klein | b9b5de5 | 2017-09-27 13:26:22 -0400 | [diff] [blame] | 208 | |
| 209 | // Non-atomic swaps of atomic values. |
| 210 | Convexity c = fConvexity.load(); |
| 211 | fConvexity.store(that.fConvexity.load()); |
| 212 | that.fConvexity.store(c); |
| 213 | |
| 214 | uint8_t fd = fFirstDirection.load(); |
| 215 | fFirstDirection.store(that.fFirstDirection.load()); |
| 216 | that.fFirstDirection.store(fd); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 217 | } |
| 218 | } |
| 219 | |
caryclark | 8e7b19d | 2016-02-18 04:11:48 -0800 | [diff] [blame] | 220 | bool SkPath::isInterpolatable(const SkPath& compare) const { |
| 221 | int count = fPathRef->countVerbs(); |
| 222 | if (count != compare.fPathRef->countVerbs()) { |
| 223 | return false; |
| 224 | } |
| 225 | if (!count) { |
| 226 | return true; |
| 227 | } |
| 228 | if (memcmp(fPathRef->verbsMemBegin(), compare.fPathRef->verbsMemBegin(), |
| 229 | count)) { |
| 230 | return false; |
| 231 | } |
caryclark | dcd1fcc | 2016-02-18 09:00:01 -0800 | [diff] [blame] | 232 | return !fPathRef->countWeights() || |
| 233 | !SkToBool(memcmp(fPathRef->conicWeights(), compare.fPathRef->conicWeights(), |
caryclark | 8e7b19d | 2016-02-18 04:11:48 -0800 | [diff] [blame] | 234 | fPathRef->countWeights() * sizeof(*fPathRef->conicWeights()))); |
| 235 | } |
| 236 | |
| 237 | bool SkPath::interpolate(const SkPath& ending, SkScalar weight, SkPath* out) const { |
Cary Clark | 7487ec8 | 2018-03-06 09:30:46 -0500 | [diff] [blame] | 238 | int pointCount = fPathRef->countPoints(); |
| 239 | if (pointCount != ending.fPathRef->countPoints()) { |
caryclark | 8e7b19d | 2016-02-18 04:11:48 -0800 | [diff] [blame] | 240 | return false; |
| 241 | } |
Cary Clark | 7487ec8 | 2018-03-06 09:30:46 -0500 | [diff] [blame] | 242 | if (!pointCount) { |
caryclark | a110538 | 2016-02-18 06:13:25 -0800 | [diff] [blame] | 243 | return true; |
| 244 | } |
caryclark | 8e7b19d | 2016-02-18 04:11:48 -0800 | [diff] [blame] | 245 | out->reset(); |
| 246 | out->addPath(*this); |
bungeman | 6bd5284 | 2016-10-27 09:30:08 -0700 | [diff] [blame] | 247 | fPathRef->interpolate(*ending.fPathRef, weight, out->fPathRef.get()); |
caryclark | 8e7b19d | 2016-02-18 04:11:48 -0800 | [diff] [blame] | 248 | return true; |
| 249 | } |
| 250 | |
bsalomon@google.com | 9bee33a | 2012-11-13 21:51:38 +0000 | [diff] [blame] | 251 | static inline bool check_edge_against_rect(const SkPoint& p0, |
| 252 | const SkPoint& p1, |
| 253 | const SkRect& rect, |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 254 | SkPathPriv::FirstDirection dir) { |
bsalomon@google.com | 9bee33a | 2012-11-13 21:51:38 +0000 | [diff] [blame] | 255 | const SkPoint* edgeBegin; |
| 256 | SkVector v; |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 257 | if (SkPathPriv::kCW_FirstDirection == dir) { |
bsalomon@google.com | 9bee33a | 2012-11-13 21:51:38 +0000 | [diff] [blame] | 258 | v = p1 - p0; |
| 259 | edgeBegin = &p0; |
| 260 | } else { |
| 261 | v = p0 - p1; |
| 262 | edgeBegin = &p1; |
| 263 | } |
| 264 | if (v.fX || v.fY) { |
| 265 | // check the cross product of v with the vec from edgeBegin to each rect corner |
Mike Reed | a99b6ce | 2017-02-04 11:04:26 -0500 | [diff] [blame] | 266 | SkScalar yL = v.fY * (rect.fLeft - edgeBegin->fX); |
| 267 | SkScalar xT = v.fX * (rect.fTop - edgeBegin->fY); |
| 268 | SkScalar yR = v.fY * (rect.fRight - edgeBegin->fX); |
| 269 | SkScalar xB = v.fX * (rect.fBottom - edgeBegin->fY); |
bsalomon@google.com | 9bee33a | 2012-11-13 21:51:38 +0000 | [diff] [blame] | 270 | if ((xT < yL) || (xT < yR) || (xB < yL) || (xB < yR)) { |
| 271 | return false; |
| 272 | } |
| 273 | } |
| 274 | return true; |
| 275 | } |
| 276 | |
| 277 | bool SkPath::conservativelyContainsRect(const SkRect& rect) const { |
| 278 | // This only handles non-degenerate convex paths currently. |
| 279 | if (kConvex_Convexity != this->getConvexity()) { |
| 280 | return false; |
| 281 | } |
skia.committer@gmail.com | cec8de6 | 2012-11-14 02:01:22 +0000 | [diff] [blame] | 282 | |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 283 | SkPathPriv::FirstDirection direction; |
| 284 | if (!SkPathPriv::CheapComputeFirstDirection(*this, &direction)) { |
bsalomon@google.com | 9bee33a | 2012-11-13 21:51:38 +0000 | [diff] [blame] | 285 | return false; |
| 286 | } |
| 287 | |
| 288 | SkPoint firstPt; |
| 289 | SkPoint prevPt; |
Lee Salzman | a19f024 | 2017-01-12 13:06:21 -0500 | [diff] [blame] | 290 | SkPath::Iter iter(*this, true); |
bsalomon@google.com | 9bee33a | 2012-11-13 21:51:38 +0000 | [diff] [blame] | 291 | SkPath::Verb verb; |
| 292 | SkPoint pts[4]; |
Brian Salomon | e9bf6dc | 2017-08-07 11:15:00 -0400 | [diff] [blame] | 293 | int segmentCount = 0; |
bsalomon@google.com | 9bee33a | 2012-11-13 21:51:38 +0000 | [diff] [blame] | 294 | SkDEBUGCODE(int moveCnt = 0;) |
commit-bot@chromium.org | 62df526 | 2013-08-01 15:35:06 +0000 | [diff] [blame] | 295 | SkDEBUGCODE(int closeCount = 0;) |
bsalomon@google.com | 9bee33a | 2012-11-13 21:51:38 +0000 | [diff] [blame] | 296 | |
Lee Salzman | a19f024 | 2017-01-12 13:06:21 -0500 | [diff] [blame] | 297 | while ((verb = iter.next(pts, true, true)) != kDone_Verb) { |
bsalomon@google.com | 9bee33a | 2012-11-13 21:51:38 +0000 | [diff] [blame] | 298 | int nextPt = -1; |
| 299 | switch (verb) { |
| 300 | case kMove_Verb: |
commit-bot@chromium.org | 62df526 | 2013-08-01 15:35:06 +0000 | [diff] [blame] | 301 | SkASSERT(!segmentCount && !closeCount); |
bsalomon@google.com | 9bee33a | 2012-11-13 21:51:38 +0000 | [diff] [blame] | 302 | SkDEBUGCODE(++moveCnt); |
| 303 | firstPt = prevPt = pts[0]; |
| 304 | break; |
| 305 | case kLine_Verb: |
| 306 | nextPt = 1; |
commit-bot@chromium.org | 62df526 | 2013-08-01 15:35:06 +0000 | [diff] [blame] | 307 | SkASSERT(moveCnt && !closeCount); |
Brian Salomon | e9bf6dc | 2017-08-07 11:15:00 -0400 | [diff] [blame] | 308 | ++segmentCount; |
bsalomon@google.com | 9bee33a | 2012-11-13 21:51:38 +0000 | [diff] [blame] | 309 | break; |
| 310 | case kQuad_Verb: |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 311 | case kConic_Verb: |
commit-bot@chromium.org | 62df526 | 2013-08-01 15:35:06 +0000 | [diff] [blame] | 312 | SkASSERT(moveCnt && !closeCount); |
Brian Salomon | e9bf6dc | 2017-08-07 11:15:00 -0400 | [diff] [blame] | 313 | ++segmentCount; |
bsalomon@google.com | 9bee33a | 2012-11-13 21:51:38 +0000 | [diff] [blame] | 314 | nextPt = 2; |
| 315 | break; |
| 316 | case kCubic_Verb: |
commit-bot@chromium.org | 62df526 | 2013-08-01 15:35:06 +0000 | [diff] [blame] | 317 | SkASSERT(moveCnt && !closeCount); |
Brian Salomon | e9bf6dc | 2017-08-07 11:15:00 -0400 | [diff] [blame] | 318 | ++segmentCount; |
bsalomon@google.com | 9bee33a | 2012-11-13 21:51:38 +0000 | [diff] [blame] | 319 | nextPt = 3; |
| 320 | break; |
| 321 | case kClose_Verb: |
commit-bot@chromium.org | 62df526 | 2013-08-01 15:35:06 +0000 | [diff] [blame] | 322 | SkDEBUGCODE(++closeCount;) |
bsalomon@google.com | 9bee33a | 2012-11-13 21:51:38 +0000 | [diff] [blame] | 323 | break; |
| 324 | default: |
| 325 | SkDEBUGFAIL("unknown verb"); |
| 326 | } |
| 327 | if (-1 != nextPt) { |
reed | 220f926 | 2014-12-17 08:21:04 -0800 | [diff] [blame] | 328 | if (SkPath::kConic_Verb == verb) { |
| 329 | SkConic orig; |
| 330 | orig.set(pts, iter.conicWeight()); |
| 331 | SkPoint quadPts[5]; |
| 332 | int count = orig.chopIntoQuadsPOW2(quadPts, 1); |
djsollen | f2b340f | 2016-01-29 08:51:04 -0800 | [diff] [blame] | 333 | SkASSERT_RELEASE(2 == count); |
reed | 220f926 | 2014-12-17 08:21:04 -0800 | [diff] [blame] | 334 | |
| 335 | if (!check_edge_against_rect(quadPts[0], quadPts[2], rect, direction)) { |
| 336 | return false; |
| 337 | } |
| 338 | if (!check_edge_against_rect(quadPts[2], quadPts[4], rect, direction)) { |
| 339 | return false; |
| 340 | } |
| 341 | } else { |
| 342 | if (!check_edge_against_rect(prevPt, pts[nextPt], rect, direction)) { |
| 343 | return false; |
| 344 | } |
bsalomon@google.com | 9bee33a | 2012-11-13 21:51:38 +0000 | [diff] [blame] | 345 | } |
| 346 | prevPt = pts[nextPt]; |
| 347 | } |
| 348 | } |
| 349 | |
Brian Salomon | e9bf6dc | 2017-08-07 11:15:00 -0400 | [diff] [blame] | 350 | if (segmentCount) { |
| 351 | return check_edge_against_rect(prevPt, firstPt, rect, direction); |
| 352 | } |
| 353 | return false; |
bsalomon@google.com | 9bee33a | 2012-11-13 21:51:38 +0000 | [diff] [blame] | 354 | } |
| 355 | |
robertphillips@google.com | 7101abe | 2013-10-29 22:45:37 +0000 | [diff] [blame] | 356 | uint32_t SkPath::getGenerationID() const { |
commit-bot@chromium.org | 1ab9f73 | 2013-10-30 18:57:55 +0000 | [diff] [blame] | 357 | uint32_t genID = fPathRef->genID(); |
djsollen | 523cda3 | 2015-02-17 08:06:32 -0800 | [diff] [blame] | 358 | #ifdef SK_BUILD_FOR_ANDROID_FRAMEWORK |
Cary Clark | b201544 | 2017-09-14 10:31:36 -0400 | [diff] [blame] | 359 | SkASSERT((unsigned)fFillType < (1 << (32 - SkPathPriv::kPathRefGenIDBitCnt))); |
| 360 | genID |= static_cast<uint32_t>(fFillType) << SkPathPriv::kPathRefGenIDBitCnt; |
commit-bot@chromium.org | 1ab9f73 | 2013-10-30 18:57:55 +0000 | [diff] [blame] | 361 | #endif |
| 362 | return genID; |
djsollen@google.com | f5dbe2f | 2011-04-15 13:41:26 +0000 | [diff] [blame] | 363 | } |
djsollen@google.com | e63793a | 2012-03-21 15:39:03 +0000 | [diff] [blame] | 364 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 365 | void SkPath::reset() { |
| 366 | SkDEBUGCODE(this->validate();) |
| 367 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 368 | fPathRef.reset(SkPathRef::CreateEmpty()); |
bungeman@google.com | a5809a3 | 2013-06-21 15:13:34 +0000 | [diff] [blame] | 369 | this->resetFields(); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 370 | } |
| 371 | |
| 372 | void SkPath::rewind() { |
| 373 | SkDEBUGCODE(this->validate();) |
| 374 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 375 | SkPathRef::Rewind(&fPathRef); |
bungeman@google.com | a5809a3 | 2013-06-21 15:13:34 +0000 | [diff] [blame] | 376 | this->resetFields(); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 377 | } |
| 378 | |
fs | b1475b0 | 2016-01-20 09:51:07 -0800 | [diff] [blame] | 379 | bool SkPath::isLastContourClosed() const { |
| 380 | int verbCount = fPathRef->countVerbs(); |
| 381 | if (0 == verbCount) { |
| 382 | return false; |
| 383 | } |
| 384 | return kClose_Verb == fPathRef->atVerb(verbCount - 1); |
| 385 | } |
| 386 | |
reed@google.com | 7e6c4d1 | 2012-05-10 14:05:43 +0000 | [diff] [blame] | 387 | bool SkPath::isLine(SkPoint line[2]) const { |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 388 | int verbCount = fPathRef->countVerbs(); |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 389 | |
commit-bot@chromium.org | a62efcc | 2013-08-05 13:23:13 +0000 | [diff] [blame] | 390 | if (2 == verbCount) { |
| 391 | SkASSERT(kMove_Verb == fPathRef->atVerb(0)); |
| 392 | if (kLine_Verb == fPathRef->atVerb(1)) { |
| 393 | SkASSERT(2 == fPathRef->countPoints()); |
reed@google.com | 7e6c4d1 | 2012-05-10 14:05:43 +0000 | [diff] [blame] | 394 | if (line) { |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 395 | const SkPoint* pts = fPathRef->points(); |
reed@google.com | 7e6c4d1 | 2012-05-10 14:05:43 +0000 | [diff] [blame] | 396 | line[0] = pts[0]; |
| 397 | line[1] = pts[1]; |
| 398 | } |
| 399 | return true; |
| 400 | } |
| 401 | } |
| 402 | return false; |
| 403 | } |
| 404 | |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 405 | /* |
| 406 | Determines if path is a rect by keeping track of changes in direction |
| 407 | and looking for a loop either clockwise or counterclockwise. |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 408 | |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 409 | The direction is computed such that: |
| 410 | 0: vertical up |
caryclark@google.com | f68154a | 2012-11-21 15:18:06 +0000 | [diff] [blame] | 411 | 1: horizontal left |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 412 | 2: vertical down |
caryclark@google.com | f68154a | 2012-11-21 15:18:06 +0000 | [diff] [blame] | 413 | 3: horizontal right |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 414 | |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 415 | A rectangle cycles up/right/down/left or up/left/down/right. |
| 416 | |
| 417 | The test fails if: |
| 418 | The path is closed, and followed by a line. |
| 419 | A second move creates a new endpoint. |
| 420 | A diagonal line is parsed. |
| 421 | There's more than four changes of direction. |
| 422 | There's a discontinuity on the line (e.g., a move in the middle) |
| 423 | The line reverses direction. |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 424 | The path contains a quadratic or cubic. |
| 425 | The path contains fewer than four points. |
commit-bot@chromium.org | 05ec223 | 2014-01-15 18:00:57 +0000 | [diff] [blame] | 426 | *The rectangle doesn't complete a cycle. |
| 427 | *The final point isn't equal to the first point. |
| 428 | |
| 429 | *These last two conditions we relax if we have a 3-edge path that would |
| 430 | form a rectangle if it were closed (as we do when we fill a path) |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 431 | |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 432 | It's OK if the path has: |
| 433 | Several colinear line segments composing a rectangle side. |
| 434 | Single points on the rectangle side. |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 435 | |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 436 | The direction takes advantage of the corners found since opposite sides |
| 437 | must travel in opposite directions. |
| 438 | |
| 439 | FIXME: Allow colinear quads and cubics to be treated like lines. |
| 440 | FIXME: If the API passes fill-only, return true if the filled stroke |
| 441 | is a rectangle, though the caller failed to close the path. |
commit-bot@chromium.org | 05ec223 | 2014-01-15 18:00:57 +0000 | [diff] [blame] | 442 | |
Cary Clark | 48c464a | 2018-04-16 12:06:07 -0400 | [diff] [blame] | 443 | directions values: |
commit-bot@chromium.org | 05ec223 | 2014-01-15 18:00:57 +0000 | [diff] [blame] | 444 | 0x1 is set if the segment is horizontal |
| 445 | 0x2 is set if the segment is moving to the right or down |
| 446 | thus: |
| 447 | two directions are opposites iff (dirA ^ dirB) == 0x2 |
| 448 | two directions are perpendicular iff (dirA ^ dirB) == 0x1 |
skia.committer@gmail.com | f5e67c1 | 2014-01-16 07:01:48 +0000 | [diff] [blame] | 449 | |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 450 | */ |
commit-bot@chromium.org | 05ec223 | 2014-01-15 18:00:57 +0000 | [diff] [blame] | 451 | static int rect_make_dir(SkScalar dx, SkScalar dy) { |
| 452 | return ((0 != dx) << 0) | ((dx > 0 || dy > 0) << 1); |
| 453 | } |
Cary Clark | 88ba971 | 2018-04-12 14:00:24 -0400 | [diff] [blame] | 454 | |
caryclark@google.com | f68154a | 2012-11-21 15:18:06 +0000 | [diff] [blame] | 455 | bool SkPath::isRectContour(bool allowPartial, int* currVerb, const SkPoint** ptsPtr, |
Cary Clark | 5c71518 | 2018-04-09 16:07:11 -0400 | [diff] [blame] | 456 | bool* isClosed, Direction* direction, SkRect* rect) const { |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 457 | int corners = 0; |
Cary Clark | 1cd6098 | 2018-04-17 11:53:34 -0400 | [diff] [blame] | 458 | SkPoint closeXY; // used to determine if final line falls on a diagonal |
Cary Clark | 88ba971 | 2018-04-12 14:00:24 -0400 | [diff] [blame] | 459 | SkPoint lineStart; // used to construct line from previous point |
Cary Clark | 8540e11 | 2018-04-11 14:30:27 -0400 | [diff] [blame] | 460 | const SkPoint* firstPt = nullptr; // first point in the rect (last of first moves) |
| 461 | const SkPoint* lastPt = nullptr; // last point in the rect (last of lines or first if closed) |
Cary Clark | dbc59ba | 2018-04-19 07:37:29 -0400 | [diff] [blame] | 462 | SkPoint firstCorner; |
| 463 | SkPoint thirdCorner; |
caryclark@google.com | 56f233a | 2012-11-19 13:06:06 +0000 | [diff] [blame] | 464 | const SkPoint* pts = *ptsPtr; |
Cary Clark | 8540e11 | 2018-04-11 14:30:27 -0400 | [diff] [blame] | 465 | const SkPoint* savePts = nullptr; // used to allow caller to iterate through a pair of rects |
Cary Clark | 88ba971 | 2018-04-12 14:00:24 -0400 | [diff] [blame] | 466 | lineStart.set(0, 0); |
Cary Clark | dbc59ba | 2018-04-19 07:37:29 -0400 | [diff] [blame] | 467 | signed char directions[] = {-1, -1, -1, -1, -1}; // -1 to 3; -1 is uninitialized |
tomhudson@google.com | 2c2508d | 2011-07-29 13:44:30 +0000 | [diff] [blame] | 468 | bool closedOrMoved = false; |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 469 | bool autoClose = false; |
caryclark | 95bc5f3 | 2015-04-08 08:34:15 -0700 | [diff] [blame] | 470 | bool insertClose = false; |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 471 | int verbCnt = fPathRef->countVerbs(); |
caryclark@google.com | 56f233a | 2012-11-19 13:06:06 +0000 | [diff] [blame] | 472 | while (*currVerb < verbCnt && (!allowPartial || !autoClose)) { |
caryclark | 95bc5f3 | 2015-04-08 08:34:15 -0700 | [diff] [blame] | 473 | uint8_t verb = insertClose ? (uint8_t) kClose_Verb : fPathRef->atVerb(*currVerb); |
| 474 | switch (verb) { |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 475 | case kClose_Verb: |
caryclark@google.com | 56f233a | 2012-11-19 13:06:06 +0000 | [diff] [blame] | 476 | savePts = pts; |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 477 | autoClose = true; |
caryclark | 95bc5f3 | 2015-04-08 08:34:15 -0700 | [diff] [blame] | 478 | insertClose = false; |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 479 | case kLine_Verb: { |
Cary Clark | a765156 | 2018-04-17 09:30:14 -0400 | [diff] [blame] | 480 | if (kClose_Verb != verb) { |
Cary Clark | 8540e11 | 2018-04-11 14:30:27 -0400 | [diff] [blame] | 481 | lastPt = pts; |
| 482 | } |
Cary Clark | 88ba971 | 2018-04-12 14:00:24 -0400 | [diff] [blame] | 483 | SkPoint lineEnd = kClose_Verb == verb ? *firstPt : *pts++; |
| 484 | SkVector lineDelta = lineEnd - lineStart; |
| 485 | if (lineDelta.fX && lineDelta.fY) { |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 486 | return false; // diagonal |
| 487 | } |
Cary Clark | 1eece78 | 2018-04-20 10:14:41 -0400 | [diff] [blame] | 488 | if (!lineDelta.isFinite()) { |
| 489 | return false; // path contains infinity or NaN |
| 490 | } |
Cary Clark | 88ba971 | 2018-04-12 14:00:24 -0400 | [diff] [blame] | 491 | if (lineStart == lineEnd) { |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 492 | break; // single point on side OK |
| 493 | } |
Cary Clark | 48c464a | 2018-04-16 12:06:07 -0400 | [diff] [blame] | 494 | int nextDirection = rect_make_dir(lineDelta.fX, lineDelta.fY); // 0 to 3 |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 495 | if (0 == corners) { |
Cary Clark | 48c464a | 2018-04-16 12:06:07 -0400 | [diff] [blame] | 496 | directions[0] = nextDirection; |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 497 | corners = 1; |
| 498 | closedOrMoved = false; |
Cary Clark | dbc59ba | 2018-04-19 07:37:29 -0400 | [diff] [blame] | 499 | lineStart = lineEnd; |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 500 | break; |
| 501 | } |
| 502 | if (closedOrMoved) { |
| 503 | return false; // closed followed by a line |
| 504 | } |
Cary Clark | 48c464a | 2018-04-16 12:06:07 -0400 | [diff] [blame] | 505 | if (autoClose && nextDirection == directions[0]) { |
caryclark@google.com | bfe9037 | 2012-11-21 13:56:20 +0000 | [diff] [blame] | 506 | break; // colinear with first |
| 507 | } |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 508 | closedOrMoved = autoClose; |
Cary Clark | 48c464a | 2018-04-16 12:06:07 -0400 | [diff] [blame] | 509 | if (directions[corners - 1] == nextDirection) { |
Cary Clark | b120e92 | 2018-04-18 12:25:08 -0400 | [diff] [blame] | 510 | if (3 == corners && kLine_Verb == verb) { |
Cary Clark | dbc59ba | 2018-04-19 07:37:29 -0400 | [diff] [blame] | 511 | thirdCorner = lineEnd; |
Cary Clark | b120e92 | 2018-04-18 12:25:08 -0400 | [diff] [blame] | 512 | } |
Cary Clark | dbc59ba | 2018-04-19 07:37:29 -0400 | [diff] [blame] | 513 | lineStart = lineEnd; |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 514 | break; // colinear segment |
| 515 | } |
Cary Clark | 48c464a | 2018-04-16 12:06:07 -0400 | [diff] [blame] | 516 | directions[corners++] = nextDirection; |
| 517 | // opposite lines must point in opposite directions; xoring them should equal 2 |
Cary Clark | dbc59ba | 2018-04-19 07:37:29 -0400 | [diff] [blame] | 518 | switch (corners) { |
| 519 | case 2: |
| 520 | firstCorner = lineStart; |
| 521 | break; |
| 522 | case 3: |
| 523 | if ((directions[0] ^ directions[2]) != 2) { |
| 524 | return false; |
| 525 | } |
| 526 | thirdCorner = lineEnd; |
| 527 | break; |
| 528 | case 4: |
| 529 | if ((directions[1] ^ directions[3]) != 2) { |
| 530 | return false; |
| 531 | } |
| 532 | break; |
| 533 | default: |
| 534 | return false; // too many direction changes |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 535 | } |
Cary Clark | dbc59ba | 2018-04-19 07:37:29 -0400 | [diff] [blame] | 536 | lineStart = lineEnd; |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 537 | break; |
| 538 | } |
| 539 | case kQuad_Verb: |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 540 | case kConic_Verb: |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 541 | case kCubic_Verb: |
| 542 | return false; // quadratic, cubic not allowed |
| 543 | case kMove_Verb: |
Cary Clark | 48c464a | 2018-04-16 12:06:07 -0400 | [diff] [blame] | 544 | if (allowPartial && !autoClose && directions[0] >= 0) { |
caryclark | 95bc5f3 | 2015-04-08 08:34:15 -0700 | [diff] [blame] | 545 | insertClose = true; |
| 546 | *currVerb -= 1; // try move again afterwards |
| 547 | goto addMissingClose; |
| 548 | } |
Cary Clark | dbc59ba | 2018-04-19 07:37:29 -0400 | [diff] [blame] | 549 | if (!corners) { |
Cary Clark | 8540e11 | 2018-04-11 14:30:27 -0400 | [diff] [blame] | 550 | firstPt = pts; |
Cary Clark | 8540e11 | 2018-04-11 14:30:27 -0400 | [diff] [blame] | 551 | } else { |
Cary Clark | 1cd6098 | 2018-04-17 11:53:34 -0400 | [diff] [blame] | 552 | closeXY = *firstPt - *lastPt; |
| 553 | if (closeXY.fX && closeXY.fY) { |
| 554 | return false; // we're diagonal, abort |
| 555 | } |
Cary Clark | 8540e11 | 2018-04-11 14:30:27 -0400 | [diff] [blame] | 556 | } |
Cary Clark | 88ba971 | 2018-04-12 14:00:24 -0400 | [diff] [blame] | 557 | lineStart = *pts++; |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 558 | closedOrMoved = true; |
| 559 | break; |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 560 | default: |
mtklein@google.com | 330313a | 2013-08-22 15:37:26 +0000 | [diff] [blame] | 561 | SkDEBUGFAIL("unexpected verb"); |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 562 | break; |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 563 | } |
caryclark@google.com | 56f233a | 2012-11-19 13:06:06 +0000 | [diff] [blame] | 564 | *currVerb += 1; |
caryclark | 95bc5f3 | 2015-04-08 08:34:15 -0700 | [diff] [blame] | 565 | addMissingClose: |
| 566 | ; |
caryclark@google.com | f131694 | 2011-07-26 19:54:45 +0000 | [diff] [blame] | 567 | } |
| 568 | // Success if 4 corners and first point equals last |
Cary Clark | 8540e11 | 2018-04-11 14:30:27 -0400 | [diff] [blame] | 569 | if (corners < 3 || corners > 4) { |
| 570 | return false; |
| 571 | } |
caryclark@google.com | bfe9037 | 2012-11-21 13:56:20 +0000 | [diff] [blame] | 572 | if (savePts) { |
| 573 | *ptsPtr = savePts; |
| 574 | } |
Cary Clark | dbc59ba | 2018-04-19 07:37:29 -0400 | [diff] [blame] | 575 | // check if close generates diagonal |
| 576 | closeXY = *firstPt - *lastPt; |
| 577 | if (closeXY.fX && closeXY.fY) { |
| 578 | return false; |
Cary Clark | 5c71518 | 2018-04-09 16:07:11 -0400 | [diff] [blame] | 579 | } |
Cary Clark | dbc59ba | 2018-04-19 07:37:29 -0400 | [diff] [blame] | 580 | if (rect) { |
| 581 | rect->set(firstCorner, thirdCorner); |
| 582 | } |
| 583 | if (isClosed) { |
caryclark@google.com | f68154a | 2012-11-21 15:18:06 +0000 | [diff] [blame] | 584 | *isClosed = autoClose; |
| 585 | } |
Cary Clark | dbc59ba | 2018-04-19 07:37:29 -0400 | [diff] [blame] | 586 | if (direction) { |
Cary Clark | 48c464a | 2018-04-16 12:06:07 -0400 | [diff] [blame] | 587 | *direction = directions[0] == ((directions[1] + 1) & 3) ? kCW_Direction : kCCW_Direction; |
caryclark@google.com | f68154a | 2012-11-21 15:18:06 +0000 | [diff] [blame] | 588 | } |
Cary Clark | dbc59ba | 2018-04-19 07:37:29 -0400 | [diff] [blame] | 589 | return true; |
caryclark@google.com | 56f233a | 2012-11-19 13:06:06 +0000 | [diff] [blame] | 590 | } |
| 591 | |
robertphillips | 4f662e6 | 2014-12-29 14:06:51 -0800 | [diff] [blame] | 592 | bool SkPath::isRect(SkRect* rect, bool* isClosed, Direction* direction) const { |
caryclark@google.com | 56f233a | 2012-11-19 13:06:06 +0000 | [diff] [blame] | 593 | SkDEBUGCODE(this->validate();) |
| 594 | int currVerb = 0; |
| 595 | const SkPoint* pts = fPathRef->points(); |
Cary Clark | 5c71518 | 2018-04-09 16:07:11 -0400 | [diff] [blame] | 596 | return this->isRectContour(false, &currVerb, &pts, isClosed, direction, rect); |
robertphillips@google.com | 8fd1603 | 2013-06-25 15:39:58 +0000 | [diff] [blame] | 597 | } |
skia.committer@gmail.com | 020b25b | 2013-06-22 07:00:58 +0000 | [diff] [blame] | 598 | |
caryclark | 95bc5f3 | 2015-04-08 08:34:15 -0700 | [diff] [blame] | 599 | bool SkPath::isNestedFillRects(SkRect rects[2], Direction dirs[2]) const { |
caryclark@google.com | 56f233a | 2012-11-19 13:06:06 +0000 | [diff] [blame] | 600 | SkDEBUGCODE(this->validate();) |
| 601 | int currVerb = 0; |
| 602 | const SkPoint* pts = fPathRef->points(); |
robertphillips@google.com | 83d1a68 | 2013-05-17 12:50:27 +0000 | [diff] [blame] | 603 | Direction testDirs[2]; |
Cary Clark | 5c71518 | 2018-04-09 16:07:11 -0400 | [diff] [blame] | 604 | SkRect testRects[2]; |
| 605 | if (!isRectContour(true, &currVerb, &pts, nullptr, &testDirs[0], &testRects[0])) { |
caryclark@google.com | 56f233a | 2012-11-19 13:06:06 +0000 | [diff] [blame] | 606 | return false; |
| 607 | } |
Cary Clark | 5c71518 | 2018-04-09 16:07:11 -0400 | [diff] [blame] | 608 | if (isRectContour(false, &currVerb, &pts, nullptr, &testDirs[1], &testRects[1])) { |
caryclark@google.com | 56f233a | 2012-11-19 13:06:06 +0000 | [diff] [blame] | 609 | if (testRects[0].contains(testRects[1])) { |
| 610 | if (rects) { |
| 611 | rects[0] = testRects[0]; |
| 612 | rects[1] = testRects[1]; |
| 613 | } |
robertphillips@google.com | 83d1a68 | 2013-05-17 12:50:27 +0000 | [diff] [blame] | 614 | if (dirs) { |
| 615 | dirs[0] = testDirs[0]; |
| 616 | dirs[1] = testDirs[1]; |
| 617 | } |
caryclark@google.com | 56f233a | 2012-11-19 13:06:06 +0000 | [diff] [blame] | 618 | return true; |
| 619 | } |
| 620 | if (testRects[1].contains(testRects[0])) { |
| 621 | if (rects) { |
| 622 | rects[0] = testRects[1]; |
| 623 | rects[1] = testRects[0]; |
| 624 | } |
robertphillips@google.com | 83d1a68 | 2013-05-17 12:50:27 +0000 | [diff] [blame] | 625 | if (dirs) { |
| 626 | dirs[0] = testDirs[1]; |
| 627 | dirs[1] = testDirs[0]; |
| 628 | } |
caryclark@google.com | 56f233a | 2012-11-19 13:06:06 +0000 | [diff] [blame] | 629 | return true; |
| 630 | } |
| 631 | } |
| 632 | return false; |
| 633 | } |
| 634 | |
Mike Reed | 0c3137c | 2018-02-20 13:57:05 -0500 | [diff] [blame] | 635 | bool SkPath::isOval(SkRect* bounds) const { |
| 636 | return SkPathPriv::IsOval(*this, bounds, nullptr, nullptr); |
| 637 | } |
| 638 | |
| 639 | bool SkPath::isRRect(SkRRect* rrect) const { |
| 640 | return SkPathPriv::IsRRect(*this, rrect, nullptr, nullptr); |
| 641 | } |
| 642 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 643 | int SkPath::countPoints() const { |
| 644 | return fPathRef->countPoints(); |
| 645 | } |
| 646 | |
bsalomon@google.com | df9d656 | 2012-06-07 21:43:15 +0000 | [diff] [blame] | 647 | int SkPath::getPoints(SkPoint dst[], int max) const { |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 648 | SkDEBUGCODE(this->validate();) |
| 649 | |
| 650 | SkASSERT(max >= 0); |
bsalomon@google.com | df9d656 | 2012-06-07 21:43:15 +0000 | [diff] [blame] | 651 | SkASSERT(!max || dst); |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 652 | int count = SkMin32(max, fPathRef->countPoints()); |
mtklein | 8bf5d17 | 2015-12-09 13:15:07 -0800 | [diff] [blame] | 653 | sk_careful_memcpy(dst, fPathRef->points(), count * sizeof(SkPoint)); |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 654 | return fPathRef->countPoints(); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 655 | } |
| 656 | |
reed@android.com | d3aa4ff | 2010-02-09 16:38:45 +0000 | [diff] [blame] | 657 | SkPoint SkPath::getPoint(int index) const { |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 658 | if ((unsigned)index < (unsigned)fPathRef->countPoints()) { |
| 659 | return fPathRef->atPoint(index); |
reed@android.com | d3aa4ff | 2010-02-09 16:38:45 +0000 | [diff] [blame] | 660 | } |
| 661 | return SkPoint::Make(0, 0); |
| 662 | } |
| 663 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 664 | int SkPath::countVerbs() const { |
| 665 | return fPathRef->countVerbs(); |
| 666 | } |
| 667 | |
| 668 | static inline void copy_verbs_reverse(uint8_t* inorderDst, |
| 669 | const uint8_t* reversedSrc, |
| 670 | int count) { |
| 671 | for (int i = 0; i < count; ++i) { |
| 672 | inorderDst[i] = reversedSrc[~i]; |
| 673 | } |
| 674 | } |
| 675 | |
bsalomon@google.com | df9d656 | 2012-06-07 21:43:15 +0000 | [diff] [blame] | 676 | int SkPath::getVerbs(uint8_t dst[], int max) const { |
| 677 | SkDEBUGCODE(this->validate();) |
| 678 | |
| 679 | SkASSERT(max >= 0); |
| 680 | SkASSERT(!max || dst); |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 681 | int count = SkMin32(max, fPathRef->countVerbs()); |
| 682 | copy_verbs_reverse(dst, fPathRef->verbs(), count); |
| 683 | return fPathRef->countVerbs(); |
bsalomon@google.com | df9d656 | 2012-06-07 21:43:15 +0000 | [diff] [blame] | 684 | } |
| 685 | |
reed@google.com | 294dd7b | 2011-10-11 11:58:32 +0000 | [diff] [blame] | 686 | bool SkPath::getLastPt(SkPoint* lastPt) const { |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 687 | SkDEBUGCODE(this->validate();) |
| 688 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 689 | int count = fPathRef->countPoints(); |
reed@google.com | 294dd7b | 2011-10-11 11:58:32 +0000 | [diff] [blame] | 690 | if (count > 0) { |
| 691 | if (lastPt) { |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 692 | *lastPt = fPathRef->atPoint(count - 1); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 693 | } |
reed@google.com | 294dd7b | 2011-10-11 11:58:32 +0000 | [diff] [blame] | 694 | return true; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 695 | } |
reed@google.com | 294dd7b | 2011-10-11 11:58:32 +0000 | [diff] [blame] | 696 | if (lastPt) { |
| 697 | lastPt->set(0, 0); |
| 698 | } |
| 699 | return false; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 700 | } |
| 701 | |
caryclark | aec2510 | 2015-04-29 08:28:30 -0700 | [diff] [blame] | 702 | void SkPath::setPt(int index, SkScalar x, SkScalar y) { |
| 703 | SkDEBUGCODE(this->validate();) |
| 704 | |
| 705 | int count = fPathRef->countPoints(); |
| 706 | if (count <= index) { |
| 707 | return; |
| 708 | } else { |
| 709 | SkPathRef::Editor ed(&fPathRef); |
| 710 | ed.atPoint(index)->set(x, y); |
| 711 | } |
| 712 | } |
| 713 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 714 | void SkPath::setLastPt(SkScalar x, SkScalar y) { |
| 715 | SkDEBUGCODE(this->validate();) |
| 716 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 717 | int count = fPathRef->countPoints(); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 718 | if (count == 0) { |
| 719 | this->moveTo(x, y); |
| 720 | } else { |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 721 | SkPathRef::Editor ed(&fPathRef); |
| 722 | ed.atPoint(count-1)->set(x, y); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 723 | } |
| 724 | } |
| 725 | |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 726 | void SkPath::setConvexity(Convexity c) { |
| 727 | if (fConvexity != c) { |
| 728 | fConvexity = c; |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 729 | } |
| 730 | } |
| 731 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 732 | ////////////////////////////////////////////////////////////////////////////// |
| 733 | // Construction methods |
| 734 | |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 735 | #define DIRTY_AFTER_EDIT \ |
| 736 | do { \ |
| 737 | fConvexity = kUnknown_Convexity; \ |
| 738 | fFirstDirection = SkPathPriv::kUnknown_FirstDirection; \ |
reed@google.com | b54455e | 2011-05-16 14:16:04 +0000 | [diff] [blame] | 739 | } while (0) |
| 740 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 741 | void SkPath::incReserve(U16CPU inc) { |
| 742 | SkDEBUGCODE(this->validate();) |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 743 | SkPathRef::Editor(&fPathRef, inc, inc); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 744 | SkDEBUGCODE(this->validate();) |
| 745 | } |
| 746 | |
| 747 | void SkPath::moveTo(SkScalar x, SkScalar y) { |
| 748 | SkDEBUGCODE(this->validate();) |
| 749 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 750 | SkPathRef::Editor ed(&fPathRef); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 751 | |
commit-bot@chromium.org | 5e1a7f2 | 2014-02-12 17:44:30 +0000 | [diff] [blame] | 752 | // remember our index |
| 753 | fLastMoveToIndex = fPathRef->countPoints(); |
| 754 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 755 | ed.growForVerb(kMove_Verb)->set(x, y); |
bsalomon | b17c129 | 2014-08-28 14:04:55 -0700 | [diff] [blame] | 756 | |
| 757 | DIRTY_AFTER_EDIT; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 758 | } |
| 759 | |
| 760 | void SkPath::rMoveTo(SkScalar x, SkScalar y) { |
| 761 | SkPoint pt; |
| 762 | this->getLastPt(&pt); |
| 763 | this->moveTo(pt.fX + x, pt.fY + y); |
| 764 | } |
| 765 | |
commit-bot@chromium.org | 5e1a7f2 | 2014-02-12 17:44:30 +0000 | [diff] [blame] | 766 | void SkPath::injectMoveToIfNeeded() { |
| 767 | if (fLastMoveToIndex < 0) { |
| 768 | SkScalar x, y; |
| 769 | if (fPathRef->countVerbs() == 0) { |
| 770 | x = y = 0; |
| 771 | } else { |
| 772 | const SkPoint& pt = fPathRef->atPoint(~fLastMoveToIndex); |
| 773 | x = pt.fX; |
| 774 | y = pt.fY; |
| 775 | } |
| 776 | this->moveTo(x, y); |
| 777 | } |
| 778 | } |
| 779 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 780 | void SkPath::lineTo(SkScalar x, SkScalar y) { |
| 781 | SkDEBUGCODE(this->validate();) |
| 782 | |
commit-bot@chromium.org | 5e1a7f2 | 2014-02-12 17:44:30 +0000 | [diff] [blame] | 783 | this->injectMoveToIfNeeded(); |
| 784 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 785 | SkPathRef::Editor ed(&fPathRef); |
| 786 | ed.growForVerb(kLine_Verb)->set(x, y); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 787 | |
reed@google.com | b54455e | 2011-05-16 14:16:04 +0000 | [diff] [blame] | 788 | DIRTY_AFTER_EDIT; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 789 | } |
| 790 | |
| 791 | void SkPath::rLineTo(SkScalar x, SkScalar y) { |
commit-bot@chromium.org | 9d54aeb | 2013-08-09 19:48:26 +0000 | [diff] [blame] | 792 | this->injectMoveToIfNeeded(); // This can change the result of this->getLastPt(). |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 793 | SkPoint pt; |
| 794 | this->getLastPt(&pt); |
| 795 | this->lineTo(pt.fX + x, pt.fY + y); |
| 796 | } |
| 797 | |
| 798 | void SkPath::quadTo(SkScalar x1, SkScalar y1, SkScalar x2, SkScalar y2) { |
| 799 | SkDEBUGCODE(this->validate();) |
skia.committer@gmail.com | 26da7f0 | 2013-06-01 07:01:39 +0000 | [diff] [blame] | 800 | |
commit-bot@chromium.org | 5e1a7f2 | 2014-02-12 17:44:30 +0000 | [diff] [blame] | 801 | this->injectMoveToIfNeeded(); |
| 802 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 803 | SkPathRef::Editor ed(&fPathRef); |
| 804 | SkPoint* pts = ed.growForVerb(kQuad_Verb); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 805 | pts[0].set(x1, y1); |
| 806 | pts[1].set(x2, y2); |
skia.committer@gmail.com | 26da7f0 | 2013-06-01 07:01:39 +0000 | [diff] [blame] | 807 | |
reed@google.com | b54455e | 2011-05-16 14:16:04 +0000 | [diff] [blame] | 808 | DIRTY_AFTER_EDIT; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 809 | } |
| 810 | |
| 811 | void SkPath::rQuadTo(SkScalar x1, SkScalar y1, SkScalar x2, SkScalar y2) { |
commit-bot@chromium.org | 9d54aeb | 2013-08-09 19:48:26 +0000 | [diff] [blame] | 812 | this->injectMoveToIfNeeded(); // This can change the result of this->getLastPt(). |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 813 | SkPoint pt; |
| 814 | this->getLastPt(&pt); |
| 815 | this->quadTo(pt.fX + x1, pt.fY + y1, pt.fX + x2, pt.fY + y2); |
| 816 | } |
| 817 | |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 818 | void SkPath::conicTo(SkScalar x1, SkScalar y1, SkScalar x2, SkScalar y2, |
| 819 | SkScalar w) { |
| 820 | // check for <= 0 or NaN with this test |
| 821 | if (!(w > 0)) { |
| 822 | this->lineTo(x2, y2); |
| 823 | } else if (!SkScalarIsFinite(w)) { |
| 824 | this->lineTo(x1, y1); |
| 825 | this->lineTo(x2, y2); |
| 826 | } else if (SK_Scalar1 == w) { |
| 827 | this->quadTo(x1, y1, x2, y2); |
| 828 | } else { |
| 829 | SkDEBUGCODE(this->validate();) |
skia.committer@gmail.com | 26da7f0 | 2013-06-01 07:01:39 +0000 | [diff] [blame] | 830 | |
commit-bot@chromium.org | 5e1a7f2 | 2014-02-12 17:44:30 +0000 | [diff] [blame] | 831 | this->injectMoveToIfNeeded(); |
| 832 | |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 833 | SkPathRef::Editor ed(&fPathRef); |
robertphillips@google.com | 6b8dbb6 | 2013-12-12 23:03:51 +0000 | [diff] [blame] | 834 | SkPoint* pts = ed.growForVerb(kConic_Verb, w); |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 835 | pts[0].set(x1, y1); |
| 836 | pts[1].set(x2, y2); |
skia.committer@gmail.com | 26da7f0 | 2013-06-01 07:01:39 +0000 | [diff] [blame] | 837 | |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 838 | DIRTY_AFTER_EDIT; |
| 839 | } |
| 840 | } |
| 841 | |
| 842 | void SkPath::rConicTo(SkScalar dx1, SkScalar dy1, SkScalar dx2, SkScalar dy2, |
| 843 | SkScalar w) { |
commit-bot@chromium.org | 9d54aeb | 2013-08-09 19:48:26 +0000 | [diff] [blame] | 844 | this->injectMoveToIfNeeded(); // This can change the result of this->getLastPt(). |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 845 | SkPoint pt; |
| 846 | this->getLastPt(&pt); |
| 847 | this->conicTo(pt.fX + dx1, pt.fY + dy1, pt.fX + dx2, pt.fY + dy2, w); |
| 848 | } |
| 849 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 850 | void SkPath::cubicTo(SkScalar x1, SkScalar y1, SkScalar x2, SkScalar y2, |
| 851 | SkScalar x3, SkScalar y3) { |
| 852 | SkDEBUGCODE(this->validate();) |
| 853 | |
commit-bot@chromium.org | 5e1a7f2 | 2014-02-12 17:44:30 +0000 | [diff] [blame] | 854 | this->injectMoveToIfNeeded(); |
| 855 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 856 | SkPathRef::Editor ed(&fPathRef); |
| 857 | SkPoint* pts = ed.growForVerb(kCubic_Verb); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 858 | pts[0].set(x1, y1); |
| 859 | pts[1].set(x2, y2); |
| 860 | pts[2].set(x3, y3); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 861 | |
reed@google.com | b54455e | 2011-05-16 14:16:04 +0000 | [diff] [blame] | 862 | DIRTY_AFTER_EDIT; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 863 | } |
| 864 | |
| 865 | void SkPath::rCubicTo(SkScalar x1, SkScalar y1, SkScalar x2, SkScalar y2, |
| 866 | SkScalar x3, SkScalar y3) { |
commit-bot@chromium.org | 9d54aeb | 2013-08-09 19:48:26 +0000 | [diff] [blame] | 867 | this->injectMoveToIfNeeded(); // This can change the result of this->getLastPt(). |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 868 | SkPoint pt; |
| 869 | this->getLastPt(&pt); |
| 870 | this->cubicTo(pt.fX + x1, pt.fY + y1, pt.fX + x2, pt.fY + y2, |
| 871 | pt.fX + x3, pt.fY + y3); |
| 872 | } |
| 873 | |
| 874 | void SkPath::close() { |
| 875 | SkDEBUGCODE(this->validate();) |
| 876 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 877 | int count = fPathRef->countVerbs(); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 878 | if (count > 0) { |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 879 | switch (fPathRef->atVerb(count - 1)) { |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 880 | case kLine_Verb: |
| 881 | case kQuad_Verb: |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 882 | case kConic_Verb: |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 883 | case kCubic_Verb: |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 884 | case kMove_Verb: { |
| 885 | SkPathRef::Editor ed(&fPathRef); |
| 886 | ed.growForVerb(kClose_Verb); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 887 | break; |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 888 | } |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 889 | case kClose_Verb: |
reed@google.com | fa2f2a4 | 2013-05-30 15:29:48 +0000 | [diff] [blame] | 890 | // don't add a close if it's the first verb or a repeat |
reed@google.com | 7950a9e | 2013-05-30 14:57:55 +0000 | [diff] [blame] | 891 | break; |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 892 | default: |
mtklein@google.com | 330313a | 2013-08-22 15:37:26 +0000 | [diff] [blame] | 893 | SkDEBUGFAIL("unexpected verb"); |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 894 | break; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 895 | } |
| 896 | } |
commit-bot@chromium.org | 5e1a7f2 | 2014-02-12 17:44:30 +0000 | [diff] [blame] | 897 | |
| 898 | // signal that we need a moveTo to follow us (unless we're done) |
| 899 | #if 0 |
| 900 | if (fLastMoveToIndex >= 0) { |
| 901 | fLastMoveToIndex = ~fLastMoveToIndex; |
| 902 | } |
| 903 | #else |
| 904 | fLastMoveToIndex ^= ~fLastMoveToIndex >> (8 * sizeof(fLastMoveToIndex) - 1); |
| 905 | #endif |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 906 | } |
| 907 | |
| 908 | /////////////////////////////////////////////////////////////////////////////// |
reed@google.com | abf15c1 | 2011-01-18 20:35:51 +0000 | [diff] [blame] | 909 | |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 910 | namespace { |
| 911 | |
| 912 | template <unsigned N> |
| 913 | class PointIterator { |
| 914 | public: |
| 915 | PointIterator(SkPath::Direction dir, unsigned startIndex) |
| 916 | : fCurrent(startIndex % N) |
| 917 | , fAdvance(dir == SkPath::kCW_Direction ? 1 : N - 1) { } |
| 918 | |
| 919 | const SkPoint& current() const { |
| 920 | SkASSERT(fCurrent < N); |
| 921 | return fPts[fCurrent]; |
| 922 | } |
| 923 | |
| 924 | const SkPoint& next() { |
| 925 | fCurrent = (fCurrent + fAdvance) % N; |
| 926 | return this->current(); |
| 927 | } |
| 928 | |
| 929 | protected: |
| 930 | SkPoint fPts[N]; |
| 931 | |
| 932 | private: |
| 933 | unsigned fCurrent; |
| 934 | unsigned fAdvance; |
| 935 | }; |
| 936 | |
| 937 | class RectPointIterator : public PointIterator<4> { |
| 938 | public: |
| 939 | RectPointIterator(const SkRect& rect, SkPath::Direction dir, unsigned startIndex) |
| 940 | : PointIterator(dir, startIndex) { |
| 941 | |
| 942 | fPts[0] = SkPoint::Make(rect.fLeft, rect.fTop); |
| 943 | fPts[1] = SkPoint::Make(rect.fRight, rect.fTop); |
| 944 | fPts[2] = SkPoint::Make(rect.fRight, rect.fBottom); |
| 945 | fPts[3] = SkPoint::Make(rect.fLeft, rect.fBottom); |
| 946 | } |
| 947 | }; |
| 948 | |
| 949 | class OvalPointIterator : public PointIterator<4> { |
| 950 | public: |
| 951 | OvalPointIterator(const SkRect& oval, SkPath::Direction dir, unsigned startIndex) |
| 952 | : PointIterator(dir, startIndex) { |
| 953 | |
| 954 | const SkScalar cx = oval.centerX(); |
| 955 | const SkScalar cy = oval.centerY(); |
| 956 | |
| 957 | fPts[0] = SkPoint::Make(cx, oval.fTop); |
| 958 | fPts[1] = SkPoint::Make(oval.fRight, cy); |
| 959 | fPts[2] = SkPoint::Make(cx, oval.fBottom); |
| 960 | fPts[3] = SkPoint::Make(oval.fLeft, cy); |
| 961 | } |
| 962 | }; |
| 963 | |
| 964 | class RRectPointIterator : public PointIterator<8> { |
| 965 | public: |
| 966 | RRectPointIterator(const SkRRect& rrect, SkPath::Direction dir, unsigned startIndex) |
| 967 | : PointIterator(dir, startIndex) { |
| 968 | |
| 969 | const SkRect& bounds = rrect.getBounds(); |
| 970 | const SkScalar L = bounds.fLeft; |
| 971 | const SkScalar T = bounds.fTop; |
| 972 | const SkScalar R = bounds.fRight; |
| 973 | const SkScalar B = bounds.fBottom; |
| 974 | |
| 975 | fPts[0] = SkPoint::Make(L + rrect.radii(SkRRect::kUpperLeft_Corner).fX, T); |
| 976 | fPts[1] = SkPoint::Make(R - rrect.radii(SkRRect::kUpperRight_Corner).fX, T); |
| 977 | fPts[2] = SkPoint::Make(R, T + rrect.radii(SkRRect::kUpperRight_Corner).fY); |
| 978 | fPts[3] = SkPoint::Make(R, B - rrect.radii(SkRRect::kLowerRight_Corner).fY); |
| 979 | fPts[4] = SkPoint::Make(R - rrect.radii(SkRRect::kLowerRight_Corner).fX, B); |
| 980 | fPts[5] = SkPoint::Make(L + rrect.radii(SkRRect::kLowerLeft_Corner).fX, B); |
| 981 | fPts[6] = SkPoint::Make(L, B - rrect.radii(SkRRect::kLowerLeft_Corner).fY); |
| 982 | fPts[7] = SkPoint::Make(L, T + rrect.radii(SkRRect::kUpperLeft_Corner).fY); |
| 983 | } |
| 984 | }; |
| 985 | |
| 986 | } // anonymous namespace |
| 987 | |
reed@google.com | a8a3b3d | 2012-11-26 18:16:27 +0000 | [diff] [blame] | 988 | static void assert_known_direction(int dir) { |
| 989 | SkASSERT(SkPath::kCW_Direction == dir || SkPath::kCCW_Direction == dir); |
| 990 | } |
| 991 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 992 | void SkPath::addRect(const SkRect& rect, Direction dir) { |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 993 | this->addRect(rect, dir, 0); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 994 | } |
| 995 | |
| 996 | void SkPath::addRect(SkScalar left, SkScalar top, SkScalar right, |
| 997 | SkScalar bottom, Direction dir) { |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 998 | this->addRect(SkRect::MakeLTRB(left, top, right, bottom), dir, 0); |
| 999 | } |
| 1000 | |
| 1001 | void SkPath::addRect(const SkRect &rect, Direction dir, unsigned startIndex) { |
reed@google.com | a8a3b3d | 2012-11-26 18:16:27 +0000 | [diff] [blame] | 1002 | assert_known_direction(dir); |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 1003 | fFirstDirection = this->hasOnlyMoveTos() ? |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 1004 | (SkPathPriv::FirstDirection)dir : SkPathPriv::kUnknown_FirstDirection; |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 1005 | SkAutoDisableDirectionCheck addc(this); |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 1006 | SkAutoPathBoundsUpdate apbu(this, rect); |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 1007 | |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 1008 | SkDEBUGCODE(int initialVerbCount = this->countVerbs()); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1009 | |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 1010 | const int kVerbs = 5; // moveTo + 3x lineTo + close |
| 1011 | this->incReserve(kVerbs); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1012 | |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 1013 | RectPointIterator iter(rect, dir, startIndex); |
| 1014 | |
| 1015 | this->moveTo(iter.current()); |
| 1016 | this->lineTo(iter.next()); |
| 1017 | this->lineTo(iter.next()); |
| 1018 | this->lineTo(iter.next()); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1019 | this->close(); |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 1020 | |
| 1021 | SkASSERT(this->countVerbs() == initialVerbCount + kVerbs); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1022 | } |
| 1023 | |
reed@google.com | 744faba | 2012-05-29 19:54:52 +0000 | [diff] [blame] | 1024 | void SkPath::addPoly(const SkPoint pts[], int count, bool close) { |
| 1025 | SkDEBUGCODE(this->validate();) |
| 1026 | if (count <= 0) { |
| 1027 | return; |
| 1028 | } |
| 1029 | |
commit-bot@chromium.org | 5e1a7f2 | 2014-02-12 17:44:30 +0000 | [diff] [blame] | 1030 | fLastMoveToIndex = fPathRef->countPoints(); |
| 1031 | |
robertphillips@google.com | 6b8dbb6 | 2013-12-12 23:03:51 +0000 | [diff] [blame] | 1032 | // +close makes room for the extra kClose_Verb |
| 1033 | SkPathRef::Editor ed(&fPathRef, count+close, count); |
| 1034 | |
| 1035 | ed.growForVerb(kMove_Verb)->set(pts[0].fX, pts[0].fY); |
reed@google.com | 744faba | 2012-05-29 19:54:52 +0000 | [diff] [blame] | 1036 | if (count > 1) { |
robertphillips@google.com | 6b8dbb6 | 2013-12-12 23:03:51 +0000 | [diff] [blame] | 1037 | SkPoint* p = ed.growForRepeatedVerb(kLine_Verb, count - 1); |
| 1038 | memcpy(p, &pts[1], (count-1) * sizeof(SkPoint)); |
reed@google.com | 744faba | 2012-05-29 19:54:52 +0000 | [diff] [blame] | 1039 | } |
robertphillips@google.com | 6b8dbb6 | 2013-12-12 23:03:51 +0000 | [diff] [blame] | 1040 | |
reed@google.com | 744faba | 2012-05-29 19:54:52 +0000 | [diff] [blame] | 1041 | if (close) { |
robertphillips@google.com | 6b8dbb6 | 2013-12-12 23:03:51 +0000 | [diff] [blame] | 1042 | ed.growForVerb(kClose_Verb); |
caryclark | 63c684a | 2015-02-25 09:04:04 -0800 | [diff] [blame] | 1043 | fLastMoveToIndex ^= ~fLastMoveToIndex >> (8 * sizeof(fLastMoveToIndex) - 1); |
reed@google.com | 744faba | 2012-05-29 19:54:52 +0000 | [diff] [blame] | 1044 | } |
| 1045 | |
reed@google.com | 744faba | 2012-05-29 19:54:52 +0000 | [diff] [blame] | 1046 | DIRTY_AFTER_EDIT; |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1047 | SkDEBUGCODE(this->validate();) |
reed@google.com | 744faba | 2012-05-29 19:54:52 +0000 | [diff] [blame] | 1048 | } |
| 1049 | |
robertphillips@google.com | 1cc385b | 2013-10-17 12:17:27 +0000 | [diff] [blame] | 1050 | #include "SkGeometry.h" |
| 1051 | |
reed | f90ea01 | 2015-01-29 12:03:58 -0800 | [diff] [blame] | 1052 | static bool arc_is_lone_point(const SkRect& oval, SkScalar startAngle, SkScalar sweepAngle, |
| 1053 | SkPoint* pt) { |
| 1054 | if (0 == sweepAngle && (0 == startAngle || SkIntToScalar(360) == startAngle)) { |
robertphillips@google.com | 1cc385b | 2013-10-17 12:17:27 +0000 | [diff] [blame] | 1055 | // Chrome uses this path to move into and out of ovals. If not |
| 1056 | // treated as a special case the moves can distort the oval's |
| 1057 | // bounding box (and break the circle special case). |
reed | f90ea01 | 2015-01-29 12:03:58 -0800 | [diff] [blame] | 1058 | pt->set(oval.fRight, oval.centerY()); |
| 1059 | return true; |
robertphillips@google.com | 1cc385b | 2013-10-17 12:17:27 +0000 | [diff] [blame] | 1060 | } else if (0 == oval.width() && 0 == oval.height()) { |
| 1061 | // Chrome will sometimes create 0 radius round rects. Having degenerate |
| 1062 | // quad segments in the path prevents the path from being recognized as |
| 1063 | // a rect. |
| 1064 | // TODO: optimizing the case where only one of width or height is zero |
| 1065 | // should also be considered. This case, however, doesn't seem to be |
| 1066 | // as common as the single point case. |
reed | f90ea01 | 2015-01-29 12:03:58 -0800 | [diff] [blame] | 1067 | pt->set(oval.fRight, oval.fTop); |
| 1068 | return true; |
robertphillips@google.com | 1cc385b | 2013-10-17 12:17:27 +0000 | [diff] [blame] | 1069 | } |
reed | f90ea01 | 2015-01-29 12:03:58 -0800 | [diff] [blame] | 1070 | return false; |
| 1071 | } |
robertphillips@google.com | 1cc385b | 2013-10-17 12:17:27 +0000 | [diff] [blame] | 1072 | |
reed | d5d27d9 | 2015-02-09 13:54:43 -0800 | [diff] [blame] | 1073 | // Return the unit vectors pointing at the start/stop points for the given start/sweep angles |
| 1074 | // |
| 1075 | static void angles_to_unit_vectors(SkScalar startAngle, SkScalar sweepAngle, |
| 1076 | SkVector* startV, SkVector* stopV, SkRotationDirection* dir) { |
| 1077 | startV->fY = SkScalarSinCos(SkDegreesToRadians(startAngle), &startV->fX); |
| 1078 | stopV->fY = SkScalarSinCos(SkDegreesToRadians(startAngle + sweepAngle), &stopV->fX); |
robertphillips@google.com | 1cc385b | 2013-10-17 12:17:27 +0000 | [diff] [blame] | 1079 | |
| 1080 | /* If the sweep angle is nearly (but less than) 360, then due to precision |
reed | d5d27d9 | 2015-02-09 13:54:43 -0800 | [diff] [blame] | 1081 | loss in radians-conversion and/or sin/cos, we may end up with coincident |
| 1082 | vectors, which will fool SkBuildQuadArc into doing nothing (bad) instead |
| 1083 | of drawing a nearly complete circle (good). |
| 1084 | e.g. canvas.drawArc(0, 359.99, ...) |
| 1085 | -vs- canvas.drawArc(0, 359.9, ...) |
| 1086 | We try to detect this edge case, and tweak the stop vector |
robertphillips@google.com | 1cc385b | 2013-10-17 12:17:27 +0000 | [diff] [blame] | 1087 | */ |
reed | d5d27d9 | 2015-02-09 13:54:43 -0800 | [diff] [blame] | 1088 | if (*startV == *stopV) { |
robertphillips@google.com | 1cc385b | 2013-10-17 12:17:27 +0000 | [diff] [blame] | 1089 | SkScalar sw = SkScalarAbs(sweepAngle); |
| 1090 | if (sw < SkIntToScalar(360) && sw > SkIntToScalar(359)) { |
| 1091 | SkScalar stopRad = SkDegreesToRadians(startAngle + sweepAngle); |
| 1092 | // make a guess at a tiny angle (in radians) to tweak by |
| 1093 | SkScalar deltaRad = SkScalarCopySign(SK_Scalar1/512, sweepAngle); |
| 1094 | // not sure how much will be enough, so we use a loop |
| 1095 | do { |
| 1096 | stopRad -= deltaRad; |
reed | d5d27d9 | 2015-02-09 13:54:43 -0800 | [diff] [blame] | 1097 | stopV->fY = SkScalarSinCos(stopRad, &stopV->fX); |
| 1098 | } while (*startV == *stopV); |
robertphillips@google.com | 1cc385b | 2013-10-17 12:17:27 +0000 | [diff] [blame] | 1099 | } |
| 1100 | } |
reed | d5d27d9 | 2015-02-09 13:54:43 -0800 | [diff] [blame] | 1101 | *dir = sweepAngle > 0 ? kCW_SkRotationDirection : kCCW_SkRotationDirection; |
| 1102 | } |
robertphillips@google.com | 1cc385b | 2013-10-17 12:17:27 +0000 | [diff] [blame] | 1103 | |
reed | 9e779d4 | 2015-02-17 11:43:14 -0800 | [diff] [blame] | 1104 | /** |
| 1105 | * If this returns 0, then the caller should just line-to the singlePt, else it should |
| 1106 | * ignore singlePt and append the specified number of conics. |
| 1107 | */ |
reed | d5d27d9 | 2015-02-09 13:54:43 -0800 | [diff] [blame] | 1108 | static int build_arc_conics(const SkRect& oval, const SkVector& start, const SkVector& stop, |
reed | 9e779d4 | 2015-02-17 11:43:14 -0800 | [diff] [blame] | 1109 | SkRotationDirection dir, SkConic conics[SkConic::kMaxConicsForArc], |
| 1110 | SkPoint* singlePt) { |
reed | d5d27d9 | 2015-02-09 13:54:43 -0800 | [diff] [blame] | 1111 | SkMatrix matrix; |
| 1112 | |
| 1113 | matrix.setScale(SkScalarHalf(oval.width()), SkScalarHalf(oval.height())); |
| 1114 | matrix.postTranslate(oval.centerX(), oval.centerY()); |
| 1115 | |
reed | 9e779d4 | 2015-02-17 11:43:14 -0800 | [diff] [blame] | 1116 | int count = SkConic::BuildUnitArc(start, stop, dir, &matrix, conics); |
| 1117 | if (0 == count) { |
xidachen | 95e34a3 | 2016-10-19 10:24:28 -0700 | [diff] [blame] | 1118 | matrix.mapXY(stop.x(), stop.y(), singlePt); |
reed | 9e779d4 | 2015-02-17 11:43:14 -0800 | [diff] [blame] | 1119 | } |
| 1120 | return count; |
reed | d5d27d9 | 2015-02-09 13:54:43 -0800 | [diff] [blame] | 1121 | } |
robertphillips@google.com | 1cc385b | 2013-10-17 12:17:27 +0000 | [diff] [blame] | 1122 | |
robertphillips@google.com | 4e18c7a | 2012-12-17 21:48:19 +0000 | [diff] [blame] | 1123 | void SkPath::addRoundRect(const SkRect& rect, const SkScalar radii[], |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1124 | Direction dir) { |
robertphillips@google.com | 4e18c7a | 2012-12-17 21:48:19 +0000 | [diff] [blame] | 1125 | SkRRect rrect; |
| 1126 | rrect.setRectRadii(rect, (const SkVector*) radii); |
| 1127 | this->addRRect(rrect, dir); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1128 | } |
| 1129 | |
reed@google.com | 4ed0fb7 | 2012-12-12 20:48:18 +0000 | [diff] [blame] | 1130 | void SkPath::addRRect(const SkRRect& rrect, Direction dir) { |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 1131 | // legacy start indices: 6 (CW) and 7(CCW) |
| 1132 | this->addRRect(rrect, dir, dir == kCW_Direction ? 6 : 7); |
| 1133 | } |
robertphillips@google.com | 4e18c7a | 2012-12-17 21:48:19 +0000 | [diff] [blame] | 1134 | |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 1135 | void SkPath::addRRect(const SkRRect &rrect, Direction dir, unsigned startIndex) { |
| 1136 | assert_known_direction(dir); |
robertphillips@google.com | 4e18c7a | 2012-12-17 21:48:19 +0000 | [diff] [blame] | 1137 | |
caryclark | da707bf | 2015-11-19 14:47:43 -0800 | [diff] [blame] | 1138 | bool isRRect = hasOnlyMoveTos(); |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 1139 | const SkRect& bounds = rrect.getBounds(); |
| 1140 | |
Brian Salomon | 0a241ce | 2017-12-15 11:31:05 -0500 | [diff] [blame] | 1141 | if (rrect.isRect() || rrect.isEmpty()) { |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 1142 | // degenerate(rect) => radii points are collapsing |
| 1143 | this->addRect(bounds, dir, (startIndex + 1) / 2); |
| 1144 | } else if (rrect.isOval()) { |
| 1145 | // degenerate(oval) => line points are collapsing |
| 1146 | this->addOval(bounds, dir, startIndex / 2); |
| 1147 | } else { |
| 1148 | fFirstDirection = this->hasOnlyMoveTos() ? |
| 1149 | (SkPathPriv::FirstDirection)dir : SkPathPriv::kUnknown_FirstDirection; |
| 1150 | |
| 1151 | SkAutoPathBoundsUpdate apbu(this, bounds); |
| 1152 | SkAutoDisableDirectionCheck addc(this); |
| 1153 | |
| 1154 | // we start with a conic on odd indices when moving CW vs. even indices when moving CCW |
| 1155 | const bool startsWithConic = ((startIndex & 1) == (dir == kCW_Direction)); |
| 1156 | const SkScalar weight = SK_ScalarRoot2Over2; |
| 1157 | |
| 1158 | SkDEBUGCODE(int initialVerbCount = this->countVerbs()); |
| 1159 | const int kVerbs = startsWithConic |
| 1160 | ? 9 // moveTo + 4x conicTo + 3x lineTo + close |
| 1161 | : 10; // moveTo + 4x lineTo + 4x conicTo + close |
| 1162 | this->incReserve(kVerbs); |
| 1163 | |
| 1164 | RRectPointIterator rrectIter(rrect, dir, startIndex); |
| 1165 | // Corner iterator indices follow the collapsed radii model, |
| 1166 | // adjusted such that the start pt is "behind" the radii start pt. |
| 1167 | const unsigned rectStartIndex = startIndex / 2 + (dir == kCW_Direction ? 0 : 1); |
| 1168 | RectPointIterator rectIter(bounds, dir, rectStartIndex); |
| 1169 | |
| 1170 | this->moveTo(rrectIter.current()); |
| 1171 | if (startsWithConic) { |
| 1172 | for (unsigned i = 0; i < 3; ++i) { |
| 1173 | this->conicTo(rectIter.next(), rrectIter.next(), weight); |
| 1174 | this->lineTo(rrectIter.next()); |
| 1175 | } |
| 1176 | this->conicTo(rectIter.next(), rrectIter.next(), weight); |
| 1177 | // final lineTo handled by close(). |
| 1178 | } else { |
| 1179 | for (unsigned i = 0; i < 4; ++i) { |
| 1180 | this->lineTo(rrectIter.next()); |
| 1181 | this->conicTo(rectIter.next(), rrectIter.next(), weight); |
| 1182 | } |
| 1183 | } |
| 1184 | this->close(); |
| 1185 | |
caryclark | da707bf | 2015-11-19 14:47:43 -0800 | [diff] [blame] | 1186 | SkPathRef::Editor ed(&fPathRef); |
bsalomon | 78d58d1 | 2016-05-27 09:17:04 -0700 | [diff] [blame] | 1187 | ed.setIsRRect(isRRect, dir, startIndex % 8); |
caryclark | da707bf | 2015-11-19 14:47:43 -0800 | [diff] [blame] | 1188 | |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 1189 | SkASSERT(this->countVerbs() == initialVerbCount + kVerbs); |
| 1190 | } |
| 1191 | |
| 1192 | SkDEBUGCODE(fPathRef->validate();) |
reed@google.com | 4ed0fb7 | 2012-12-12 20:48:18 +0000 | [diff] [blame] | 1193 | } |
| 1194 | |
bsalomon@google.com | 6aa2965 | 2012-04-18 13:29:52 +0000 | [diff] [blame] | 1195 | bool SkPath::hasOnlyMoveTos() const { |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1196 | int count = fPathRef->countVerbs(); |
| 1197 | const uint8_t* verbs = const_cast<const SkPathRef*>(fPathRef.get())->verbsMemBegin(); |
| 1198 | for (int i = 0; i < count; ++i) { |
bsalomon@google.com | 6aa2965 | 2012-04-18 13:29:52 +0000 | [diff] [blame] | 1199 | if (*verbs == kLine_Verb || |
| 1200 | *verbs == kQuad_Verb || |
commit-bot@chromium.org | a1a097e | 2013-11-14 16:53:22 +0000 | [diff] [blame] | 1201 | *verbs == kConic_Verb || |
bsalomon@google.com | 6aa2965 | 2012-04-18 13:29:52 +0000 | [diff] [blame] | 1202 | *verbs == kCubic_Verb) { |
| 1203 | return false; |
| 1204 | } |
| 1205 | ++verbs; |
| 1206 | } |
| 1207 | return true; |
| 1208 | } |
| 1209 | |
Brian Osman | a231857 | 2017-07-10 15:09:26 -0400 | [diff] [blame] | 1210 | bool SkPath::isZeroLengthSincePoint(int startPtIndex) const { |
| 1211 | int count = fPathRef->countPoints() - startPtIndex; |
caryclark | d49a86a | 2016-02-22 12:44:54 -0800 | [diff] [blame] | 1212 | if (count < 2) { |
| 1213 | return true; |
| 1214 | } |
Brian Osman | a231857 | 2017-07-10 15:09:26 -0400 | [diff] [blame] | 1215 | const SkPoint* pts = fPathRef.get()->points() + startPtIndex; |
caryclark | d49a86a | 2016-02-22 12:44:54 -0800 | [diff] [blame] | 1216 | const SkPoint& first = *pts; |
| 1217 | for (int index = 1; index < count; ++index) { |
| 1218 | if (first != pts[index]) { |
| 1219 | return false; |
| 1220 | } |
| 1221 | } |
| 1222 | return true; |
| 1223 | } |
| 1224 | |
mike@reedtribe.org | b16033a | 2013-01-04 03:16:52 +0000 | [diff] [blame] | 1225 | void SkPath::addRoundRect(const SkRect& rect, SkScalar rx, SkScalar ry, |
| 1226 | Direction dir) { |
| 1227 | assert_known_direction(dir); |
skia.committer@gmail.com | 3284017 | 2013-04-09 07:01:27 +0000 | [diff] [blame] | 1228 | |
humper@google.com | 75e3ca1 | 2013-04-08 21:44:11 +0000 | [diff] [blame] | 1229 | if (rx < 0 || ry < 0) { |
humper@google.com | 75e3ca1 | 2013-04-08 21:44:11 +0000 | [diff] [blame] | 1230 | return; |
| 1231 | } |
skia.committer@gmail.com | d9f65e3 | 2013-01-04 12:07:46 +0000 | [diff] [blame] | 1232 | |
commit-bot@chromium.org | 42feaaf | 2013-11-08 15:51:12 +0000 | [diff] [blame] | 1233 | SkRRect rrect; |
| 1234 | rrect.setRectXY(rect, rx, ry); |
| 1235 | this->addRRect(rrect, dir); |
mike@reedtribe.org | b16033a | 2013-01-04 03:16:52 +0000 | [diff] [blame] | 1236 | } |
| 1237 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1238 | void SkPath::addOval(const SkRect& oval, Direction dir) { |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 1239 | // legacy start index: 1 |
| 1240 | this->addOval(oval, dir, 1); |
| 1241 | } |
| 1242 | |
| 1243 | void SkPath::addOval(const SkRect &oval, Direction dir, unsigned startPointIndex) { |
reed@google.com | a8a3b3d | 2012-11-26 18:16:27 +0000 | [diff] [blame] | 1244 | assert_known_direction(dir); |
| 1245 | |
bsalomon@google.com | 6aa2965 | 2012-04-18 13:29:52 +0000 | [diff] [blame] | 1246 | /* If addOval() is called after previous moveTo(), |
| 1247 | this path is still marked as an oval. This is used to |
| 1248 | fit into WebKit's calling sequences. |
| 1249 | We can't simply check isEmpty() in this case, as additional |
| 1250 | moveTo() would mark the path non empty. |
| 1251 | */ |
robertphillips@google.com | 466310d | 2013-12-03 16:43:54 +0000 | [diff] [blame] | 1252 | bool isOval = hasOnlyMoveTos(); |
| 1253 | if (isOval) { |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 1254 | fFirstDirection = (SkPathPriv::FirstDirection)dir; |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 1255 | } else { |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 1256 | fFirstDirection = SkPathPriv::kUnknown_FirstDirection; |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 1257 | } |
bsalomon@google.com | 6aa2965 | 2012-04-18 13:29:52 +0000 | [diff] [blame] | 1258 | |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 1259 | SkAutoDisableDirectionCheck addc(this); |
Mike Klein | 8afa554 | 2018-05-22 12:19:13 +0000 | [diff] [blame] | 1260 | SkAutoPathBoundsUpdate apbu(this, oval); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1261 | |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 1262 | SkDEBUGCODE(int initialVerbCount = this->countVerbs()); |
| 1263 | const int kVerbs = 6; // moveTo + 4x conicTo + close |
| 1264 | this->incReserve(kVerbs); |
| 1265 | |
| 1266 | OvalPointIterator ovalIter(oval, dir, startPointIndex); |
| 1267 | // The corner iterator pts are tracking "behind" the oval/radii pts. |
| 1268 | RectPointIterator rectIter(oval, dir, startPointIndex + (dir == kCW_Direction ? 0 : 1)); |
reed | 220f926 | 2014-12-17 08:21:04 -0800 | [diff] [blame] | 1269 | const SkScalar weight = SK_ScalarRoot2Over2; |
| 1270 | |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 1271 | this->moveTo(ovalIter.current()); |
| 1272 | for (unsigned i = 0; i < 4; ++i) { |
| 1273 | this->conicTo(rectIter.next(), ovalIter.next(), weight); |
reed | 220f926 | 2014-12-17 08:21:04 -0800 | [diff] [blame] | 1274 | } |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1275 | this->close(); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1276 | |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 1277 | SkASSERT(this->countVerbs() == initialVerbCount + kVerbs); |
| 1278 | |
robertphillips@google.com | 466310d | 2013-12-03 16:43:54 +0000 | [diff] [blame] | 1279 | SkPathRef::Editor ed(&fPathRef); |
bsalomon@google.com | 6aa2965 | 2012-04-18 13:29:52 +0000 | [diff] [blame] | 1280 | |
bsalomon | 78d58d1 | 2016-05-27 09:17:04 -0700 | [diff] [blame] | 1281 | ed.setIsOval(isOval, kCCW_Direction == dir, startPointIndex % 4); |
bsalomon@google.com | 6aa2965 | 2012-04-18 13:29:52 +0000 | [diff] [blame] | 1282 | } |
| 1283 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1284 | void SkPath::addCircle(SkScalar x, SkScalar y, SkScalar r, Direction dir) { |
| 1285 | if (r > 0) { |
fmalita | c08d53e | 2015-11-17 09:53:29 -0800 | [diff] [blame] | 1286 | this->addOval(SkRect::MakeLTRB(x - r, y - r, x + r, y + r), dir); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1287 | } |
| 1288 | } |
| 1289 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1290 | void SkPath::arcTo(const SkRect& oval, SkScalar startAngle, SkScalar sweepAngle, |
| 1291 | bool forceMoveTo) { |
| 1292 | if (oval.width() < 0 || oval.height() < 0) { |
| 1293 | return; |
| 1294 | } |
| 1295 | |
reed | f90ea01 | 2015-01-29 12:03:58 -0800 | [diff] [blame] | 1296 | if (fPathRef->countVerbs() == 0) { |
| 1297 | forceMoveTo = true; |
| 1298 | } |
| 1299 | |
| 1300 | SkPoint lonePt; |
| 1301 | if (arc_is_lone_point(oval, startAngle, sweepAngle, &lonePt)) { |
| 1302 | forceMoveTo ? this->moveTo(lonePt) : this->lineTo(lonePt); |
| 1303 | return; |
| 1304 | } |
| 1305 | |
reed | d5d27d9 | 2015-02-09 13:54:43 -0800 | [diff] [blame] | 1306 | SkVector startV, stopV; |
| 1307 | SkRotationDirection dir; |
| 1308 | angles_to_unit_vectors(startAngle, sweepAngle, &startV, &stopV, &dir); |
| 1309 | |
reed | 9e779d4 | 2015-02-17 11:43:14 -0800 | [diff] [blame] | 1310 | SkPoint singlePt; |
xidachen | 6069dda | 2016-10-06 05:42:23 -0700 | [diff] [blame] | 1311 | |
Brian Salomon | e494940 | 2018-04-26 15:22:04 -0400 | [diff] [blame] | 1312 | // Adds a move-to to 'pt' if forceMoveTo is true. Otherwise a lineTo unless we're sufficiently |
| 1313 | // close to 'pt' currently. This prevents spurious lineTos when adding a series of contiguous |
| 1314 | // arcs from the same oval. |
| 1315 | auto addPt = [&forceMoveTo, this](const SkPoint& pt) { |
| 1316 | SkPoint lastPt; |
Brian Salomon | e494940 | 2018-04-26 15:22:04 -0400 | [diff] [blame] | 1317 | if (forceMoveTo) { |
| 1318 | this->moveTo(pt); |
Brian Salomon | 91840ab | 2018-05-04 14:11:40 -0400 | [diff] [blame] | 1319 | } else if (!this->getLastPt(&lastPt) || |
Brian Salomon | e494940 | 2018-04-26 15:22:04 -0400 | [diff] [blame] | 1320 | !SkScalarNearlyEqual(lastPt.fX, pt.fX) || |
| 1321 | !SkScalarNearlyEqual(lastPt.fY, pt.fY)) { |
| 1322 | this->lineTo(pt); |
| 1323 | } |
| 1324 | }; |
| 1325 | |
xidachen | 6069dda | 2016-10-06 05:42:23 -0700 | [diff] [blame] | 1326 | // At this point, we know that the arc is not a lone point, but startV == stopV |
| 1327 | // indicates that the sweepAngle is too small such that angles_to_unit_vectors |
| 1328 | // cannot handle it. |
| 1329 | if (startV == stopV) { |
| 1330 | SkScalar endAngle = SkDegreesToRadians(startAngle + sweepAngle); |
| 1331 | SkScalar radiusX = oval.width() / 2; |
| 1332 | SkScalar radiusY = oval.height() / 2; |
| 1333 | // We cannot use SkScalarSinCos function in the next line because |
| 1334 | // SkScalarSinCos has a threshold *SkScalarNearlyZero*. When sin(startAngle) |
| 1335 | // is 0 and sweepAngle is very small and radius is huge, the expected |
Mike Klein | e54c75f | 2016-10-13 14:18:09 -0400 | [diff] [blame] | 1336 | // behavior here is to draw a line. But calling SkScalarSinCos will |
xidachen | 6069dda | 2016-10-06 05:42:23 -0700 | [diff] [blame] | 1337 | // make sin(endAngle) to be 0 which will then draw a dot. |
| 1338 | singlePt.set(oval.centerX() + radiusX * sk_float_cos(endAngle), |
| 1339 | oval.centerY() + radiusY * sk_float_sin(endAngle)); |
Brian Salomon | e494940 | 2018-04-26 15:22:04 -0400 | [diff] [blame] | 1340 | addPt(singlePt); |
xidachen | 6069dda | 2016-10-06 05:42:23 -0700 | [diff] [blame] | 1341 | return; |
| 1342 | } |
| 1343 | |
reed | d5d27d9 | 2015-02-09 13:54:43 -0800 | [diff] [blame] | 1344 | SkConic conics[SkConic::kMaxConicsForArc]; |
reed | 9e779d4 | 2015-02-17 11:43:14 -0800 | [diff] [blame] | 1345 | int count = build_arc_conics(oval, startV, stopV, dir, conics, &singlePt); |
reed | d5d27d9 | 2015-02-09 13:54:43 -0800 | [diff] [blame] | 1346 | if (count) { |
| 1347 | this->incReserve(count * 2 + 1); |
| 1348 | const SkPoint& pt = conics[0].fPts[0]; |
Brian Salomon | e494940 | 2018-04-26 15:22:04 -0400 | [diff] [blame] | 1349 | addPt(pt); |
reed | d5d27d9 | 2015-02-09 13:54:43 -0800 | [diff] [blame] | 1350 | for (int i = 0; i < count; ++i) { |
| 1351 | this->conicTo(conics[i].fPts[1], conics[i].fPts[2], conics[i].fW); |
| 1352 | } |
reed | 9e779d4 | 2015-02-17 11:43:14 -0800 | [diff] [blame] | 1353 | } else { |
Brian Salomon | e494940 | 2018-04-26 15:22:04 -0400 | [diff] [blame] | 1354 | addPt(singlePt); |
reed | d5d27d9 | 2015-02-09 13:54:43 -0800 | [diff] [blame] | 1355 | } |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1356 | } |
| 1357 | |
caryclark | 55d4905 | 2016-01-23 05:07:04 -0800 | [diff] [blame] | 1358 | // This converts the SVG arc to conics. |
| 1359 | // Partly adapted from Niko's code in kdelibs/kdecore/svgicons. |
| 1360 | // Then transcribed from webkit/chrome's SVGPathNormalizer::decomposeArcToCubic() |
| 1361 | // See also SVG implementation notes: |
| 1362 | // http://www.w3.org/TR/SVG/implnote.html#ArcConversionEndpointToCenter |
| 1363 | // Note that arcSweep bool value is flipped from the original implementation. |
| 1364 | void SkPath::arcTo(SkScalar rx, SkScalar ry, SkScalar angle, SkPath::ArcSize arcLarge, |
| 1365 | SkPath::Direction arcSweep, SkScalar x, SkScalar y) { |
caryclark | f1d4151 | 2016-02-09 10:30:22 -0800 | [diff] [blame] | 1366 | this->injectMoveToIfNeeded(); |
caryclark | 55d4905 | 2016-01-23 05:07:04 -0800 | [diff] [blame] | 1367 | SkPoint srcPts[2]; |
| 1368 | this->getLastPt(&srcPts[0]); |
| 1369 | // If rx = 0 or ry = 0 then this arc is treated as a straight line segment (a "lineto") |
| 1370 | // joining the endpoints. |
| 1371 | // http://www.w3.org/TR/SVG/implnote.html#ArcOutOfRangeParameters |
| 1372 | if (!rx || !ry) { |
caryclark | fc75253 | 2016-01-25 05:39:04 -0800 | [diff] [blame] | 1373 | this->lineTo(x, y); |
caryclark | 55d4905 | 2016-01-23 05:07:04 -0800 | [diff] [blame] | 1374 | return; |
| 1375 | } |
| 1376 | // If the current point and target point for the arc are identical, it should be treated as a |
| 1377 | // zero length path. This ensures continuity in animations. |
| 1378 | srcPts[1].set(x, y); |
| 1379 | if (srcPts[0] == srcPts[1]) { |
caryclark | fc75253 | 2016-01-25 05:39:04 -0800 | [diff] [blame] | 1380 | this->lineTo(x, y); |
caryclark | 55d4905 | 2016-01-23 05:07:04 -0800 | [diff] [blame] | 1381 | return; |
| 1382 | } |
| 1383 | rx = SkScalarAbs(rx); |
| 1384 | ry = SkScalarAbs(ry); |
| 1385 | SkVector midPointDistance = srcPts[0] - srcPts[1]; |
| 1386 | midPointDistance *= 0.5f; |
| 1387 | |
| 1388 | SkMatrix pointTransform; |
| 1389 | pointTransform.setRotate(-angle); |
| 1390 | |
| 1391 | SkPoint transformedMidPoint; |
| 1392 | pointTransform.mapPoints(&transformedMidPoint, &midPointDistance, 1); |
| 1393 | SkScalar squareRx = rx * rx; |
| 1394 | SkScalar squareRy = ry * ry; |
| 1395 | SkScalar squareX = transformedMidPoint.fX * transformedMidPoint.fX; |
| 1396 | SkScalar squareY = transformedMidPoint.fY * transformedMidPoint.fY; |
| 1397 | |
| 1398 | // Check if the radii are big enough to draw the arc, scale radii if not. |
| 1399 | // http://www.w3.org/TR/SVG/implnote.html#ArcCorrectionOutOfRangeRadii |
| 1400 | SkScalar radiiScale = squareX / squareRx + squareY / squareRy; |
| 1401 | if (radiiScale > 1) { |
| 1402 | radiiScale = SkScalarSqrt(radiiScale); |
| 1403 | rx *= radiiScale; |
| 1404 | ry *= radiiScale; |
| 1405 | } |
| 1406 | |
| 1407 | pointTransform.setScale(1 / rx, 1 / ry); |
| 1408 | pointTransform.preRotate(-angle); |
| 1409 | |
| 1410 | SkPoint unitPts[2]; |
| 1411 | pointTransform.mapPoints(unitPts, srcPts, (int) SK_ARRAY_COUNT(unitPts)); |
| 1412 | SkVector delta = unitPts[1] - unitPts[0]; |
| 1413 | |
| 1414 | SkScalar d = delta.fX * delta.fX + delta.fY * delta.fY; |
| 1415 | SkScalar scaleFactorSquared = SkTMax(1 / d - 0.25f, 0.f); |
| 1416 | |
| 1417 | SkScalar scaleFactor = SkScalarSqrt(scaleFactorSquared); |
| 1418 | if (SkToBool(arcSweep) != SkToBool(arcLarge)) { // flipped from the original implementation |
| 1419 | scaleFactor = -scaleFactor; |
| 1420 | } |
| 1421 | delta.scale(scaleFactor); |
| 1422 | SkPoint centerPoint = unitPts[0] + unitPts[1]; |
| 1423 | centerPoint *= 0.5f; |
| 1424 | centerPoint.offset(-delta.fY, delta.fX); |
| 1425 | unitPts[0] -= centerPoint; |
| 1426 | unitPts[1] -= centerPoint; |
| 1427 | SkScalar theta1 = SkScalarATan2(unitPts[0].fY, unitPts[0].fX); |
| 1428 | SkScalar theta2 = SkScalarATan2(unitPts[1].fY, unitPts[1].fX); |
| 1429 | SkScalar thetaArc = theta2 - theta1; |
| 1430 | if (thetaArc < 0 && !arcSweep) { // arcSweep flipped from the original implementation |
| 1431 | thetaArc += SK_ScalarPI * 2; |
| 1432 | } else if (thetaArc > 0 && arcSweep) { // arcSweep flipped from the original implementation |
| 1433 | thetaArc -= SK_ScalarPI * 2; |
| 1434 | } |
| 1435 | pointTransform.setRotate(angle); |
| 1436 | pointTransform.preScale(rx, ry); |
| 1437 | |
Cary Clark | 1acd3c7 | 2017-12-08 11:37:01 -0500 | [diff] [blame] | 1438 | #ifdef SK_SUPPORT_LEGACY_SVG_ARC_TO |
Cary Clark | 5104137 | 2017-12-06 20:07:51 +0000 | [diff] [blame] | 1439 | int segments = SkScalarCeilToInt(SkScalarAbs(thetaArc / (SK_ScalarPI / 2))); |
Cary Clark | 1acd3c7 | 2017-12-08 11:37:01 -0500 | [diff] [blame] | 1440 | #else |
| 1441 | // the arc may be slightly bigger than 1/4 circle, so allow up to 1/3rd |
| 1442 | int segments = SkScalarCeilToInt(SkScalarAbs(thetaArc / (2 * SK_ScalarPI / 3))); |
| 1443 | #endif |
caryclark | 55d4905 | 2016-01-23 05:07:04 -0800 | [diff] [blame] | 1444 | SkScalar thetaWidth = thetaArc / segments; |
| 1445 | SkScalar t = SkScalarTan(0.5f * thetaWidth); |
| 1446 | if (!SkScalarIsFinite(t)) { |
| 1447 | return; |
| 1448 | } |
| 1449 | SkScalar startTheta = theta1; |
| 1450 | SkScalar w = SkScalarSqrt(SK_ScalarHalf + SkScalarCos(thetaWidth) * SK_ScalarHalf); |
Cary Clark | 1acd3c7 | 2017-12-08 11:37:01 -0500 | [diff] [blame] | 1451 | #ifndef SK_SUPPORT_LEGACY_SVG_ARC_TO |
| 1452 | auto scalar_is_integer = [](SkScalar scalar) -> bool { |
| 1453 | return scalar == SkScalarFloorToScalar(scalar); |
| 1454 | }; |
| 1455 | bool expectIntegers = SkScalarNearlyZero(SK_ScalarPI/2 - SkScalarAbs(thetaWidth)) && |
| 1456 | scalar_is_integer(rx) && scalar_is_integer(ry) && |
| 1457 | scalar_is_integer(x) && scalar_is_integer(y); |
| 1458 | #endif |
caryclark | 55d4905 | 2016-01-23 05:07:04 -0800 | [diff] [blame] | 1459 | for (int i = 0; i < segments; ++i) { |
| 1460 | SkScalar endTheta = startTheta + thetaWidth; |
| 1461 | SkScalar cosEndTheta, sinEndTheta = SkScalarSinCos(endTheta, &cosEndTheta); |
| 1462 | |
| 1463 | unitPts[1].set(cosEndTheta, sinEndTheta); |
| 1464 | unitPts[1] += centerPoint; |
| 1465 | unitPts[0] = unitPts[1]; |
| 1466 | unitPts[0].offset(t * sinEndTheta, -t * cosEndTheta); |
| 1467 | SkPoint mapped[2]; |
| 1468 | pointTransform.mapPoints(mapped, unitPts, (int) SK_ARRAY_COUNT(unitPts)); |
Cary Clark | 1acd3c7 | 2017-12-08 11:37:01 -0500 | [diff] [blame] | 1469 | /* |
| 1470 | Computing the arc width introduces rounding errors that cause arcs to start |
| 1471 | outside their marks. A round rect may lose convexity as a result. If the input |
| 1472 | values are on integers, place the conic on integers as well. |
| 1473 | */ |
| 1474 | #ifndef SK_SUPPORT_LEGACY_SVG_ARC_TO |
| 1475 | if (expectIntegers) { |
| 1476 | SkScalar* mappedScalars = &mapped[0].fX; |
| 1477 | for (unsigned index = 0; index < sizeof(mapped) / sizeof(SkScalar); ++index) { |
| 1478 | mappedScalars[index] = SkScalarRoundToScalar(mappedScalars[index]); |
| 1479 | } |
| 1480 | } |
| 1481 | #endif |
caryclark | 55d4905 | 2016-01-23 05:07:04 -0800 | [diff] [blame] | 1482 | this->conicTo(mapped[0], mapped[1], w); |
| 1483 | startTheta = endTheta; |
| 1484 | } |
| 1485 | } |
| 1486 | |
| 1487 | void SkPath::rArcTo(SkScalar rx, SkScalar ry, SkScalar xAxisRotate, SkPath::ArcSize largeArc, |
| 1488 | SkPath::Direction sweep, SkScalar dx, SkScalar dy) { |
| 1489 | SkPoint currentPoint; |
| 1490 | this->getLastPt(¤tPoint); |
| 1491 | this->arcTo(rx, ry, xAxisRotate, largeArc, sweep, currentPoint.fX + dx, currentPoint.fY + dy); |
| 1492 | } |
| 1493 | |
robertphillips@google.com | 1cc385b | 2013-10-17 12:17:27 +0000 | [diff] [blame] | 1494 | void SkPath::addArc(const SkRect& oval, SkScalar startAngle, SkScalar sweepAngle) { |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1495 | if (oval.isEmpty() || 0 == sweepAngle) { |
| 1496 | return; |
| 1497 | } |
| 1498 | |
| 1499 | const SkScalar kFullCircleAngle = SkIntToScalar(360); |
| 1500 | |
| 1501 | if (sweepAngle >= kFullCircleAngle || sweepAngle <= -kFullCircleAngle) { |
bsalomon | 1978ce2 | 2016-05-31 10:42:16 -0700 | [diff] [blame] | 1502 | // We can treat the arc as an oval if it begins at one of our legal starting positions. |
| 1503 | // See SkPath::addOval() docs. |
| 1504 | SkScalar startOver90 = startAngle / 90.f; |
| 1505 | SkScalar startOver90I = SkScalarRoundToScalar(startOver90); |
| 1506 | SkScalar error = startOver90 - startOver90I; |
| 1507 | if (SkScalarNearlyEqual(error, 0)) { |
| 1508 | // Index 1 is at startAngle == 0. |
| 1509 | SkScalar startIndex = std::fmod(startOver90I + 1.f, 4.f); |
| 1510 | startIndex = startIndex < 0 ? startIndex + 4.f : startIndex; |
| 1511 | this->addOval(oval, sweepAngle > 0 ? kCW_Direction : kCCW_Direction, |
| 1512 | (unsigned) startIndex); |
| 1513 | return; |
| 1514 | } |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1515 | } |
bsalomon | 1978ce2 | 2016-05-31 10:42:16 -0700 | [diff] [blame] | 1516 | this->arcTo(oval, startAngle, sweepAngle, true); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1517 | } |
| 1518 | |
| 1519 | /* |
| 1520 | Need to handle the case when the angle is sharp, and our computed end-points |
| 1521 | for the arc go behind pt1 and/or p2... |
| 1522 | */ |
reed | c778904 | 2015-01-29 12:59:11 -0800 | [diff] [blame] | 1523 | void SkPath::arcTo(SkScalar x1, SkScalar y1, SkScalar x2, SkScalar y2, SkScalar radius) { |
reed | a8b326c | 2014-12-09 11:50:32 -0800 | [diff] [blame] | 1524 | if (radius == 0) { |
| 1525 | this->lineTo(x1, y1); |
| 1526 | return; |
| 1527 | } |
| 1528 | |
| 1529 | SkVector before, after; |
reed@google.com | abf15c1 | 2011-01-18 20:35:51 +0000 | [diff] [blame] | 1530 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1531 | // need to know our prev pt so we can construct tangent vectors |
| 1532 | { |
| 1533 | SkPoint start; |
| 1534 | this->getLastPt(&start); |
senorblanco@chromium.org | 60eaa39 | 2010-10-13 18:47:00 +0000 | [diff] [blame] | 1535 | // Handle degenerate cases by adding a line to the first point and |
| 1536 | // bailing out. |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1537 | before.setNormalize(x1 - start.fX, y1 - start.fY); |
| 1538 | after.setNormalize(x2 - x1, y2 - y1); |
| 1539 | } |
reed@google.com | abf15c1 | 2011-01-18 20:35:51 +0000 | [diff] [blame] | 1540 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1541 | SkScalar cosh = SkPoint::DotProduct(before, after); |
| 1542 | SkScalar sinh = SkPoint::CrossProduct(before, after); |
| 1543 | |
| 1544 | if (SkScalarNearlyZero(sinh)) { // angle is too tight |
senorblanco@chromium.org | 60eaa39 | 2010-10-13 18:47:00 +0000 | [diff] [blame] | 1545 | this->lineTo(x1, y1); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1546 | return; |
| 1547 | } |
reed@google.com | abf15c1 | 2011-01-18 20:35:51 +0000 | [diff] [blame] | 1548 | |
Mike Reed | a99b6ce | 2017-02-04 11:04:26 -0500 | [diff] [blame] | 1549 | SkScalar dist = SkScalarAbs(radius * (1 - cosh) / sinh); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1550 | |
Mike Reed | a99b6ce | 2017-02-04 11:04:26 -0500 | [diff] [blame] | 1551 | SkScalar xx = x1 - dist * before.fX; |
| 1552 | SkScalar yy = y1 - dist * before.fY; |
caryclark | 88651ae | 2016-01-20 11:55:11 -0800 | [diff] [blame] | 1553 | after.setLength(dist); |
| 1554 | this->lineTo(xx, yy); |
| 1555 | SkScalar weight = SkScalarSqrt(SK_ScalarHalf + cosh * SK_ScalarHalf); |
| 1556 | this->conicTo(x1, y1, x1 + after.fX, y1 + after.fY, weight); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1557 | } |
| 1558 | |
| 1559 | /////////////////////////////////////////////////////////////////////////////// |
| 1560 | |
commit-bot@chromium.org | 14747e5 | 2014-02-11 21:16:29 +0000 | [diff] [blame] | 1561 | void SkPath::addPath(const SkPath& path, SkScalar dx, SkScalar dy, AddPathMode mode) { |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1562 | SkMatrix matrix; |
| 1563 | |
| 1564 | matrix.setTranslate(dx, dy); |
commit-bot@chromium.org | 14747e5 | 2014-02-11 21:16:29 +0000 | [diff] [blame] | 1565 | this->addPath(path, matrix, mode); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1566 | } |
| 1567 | |
commit-bot@chromium.org | 14747e5 | 2014-02-11 21:16:29 +0000 | [diff] [blame] | 1568 | void SkPath::addPath(const SkPath& path, const SkMatrix& matrix, AddPathMode mode) { |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1569 | SkPathRef::Editor(&fPathRef, path.countVerbs(), path.countPoints()); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1570 | |
schenney@chromium.org | 6630d8d | 2012-01-04 21:05:51 +0000 | [diff] [blame] | 1571 | RawIter iter(path); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1572 | SkPoint pts[4]; |
| 1573 | Verb verb; |
| 1574 | |
Cary Clark | 9480d82 | 2017-10-19 18:01:13 -0400 | [diff] [blame] | 1575 | SkMatrixPriv::MapPtsProc proc = SkMatrixPriv::GetMapPtsProc(matrix); |
commit-bot@chromium.org | 14747e5 | 2014-02-11 21:16:29 +0000 | [diff] [blame] | 1576 | bool firstVerb = true; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1577 | while ((verb = iter.next(pts)) != kDone_Verb) { |
| 1578 | switch (verb) { |
| 1579 | case kMove_Verb: |
| 1580 | proc(matrix, &pts[0], &pts[0], 1); |
commit-bot@chromium.org | 14747e5 | 2014-02-11 21:16:29 +0000 | [diff] [blame] | 1581 | if (firstVerb && mode == kExtend_AddPathMode && !isEmpty()) { |
| 1582 | injectMoveToIfNeeded(); // In case last contour is closed |
| 1583 | this->lineTo(pts[0]); |
| 1584 | } else { |
| 1585 | this->moveTo(pts[0]); |
| 1586 | } |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1587 | break; |
| 1588 | case kLine_Verb: |
| 1589 | proc(matrix, &pts[1], &pts[1], 1); |
| 1590 | this->lineTo(pts[1]); |
| 1591 | break; |
| 1592 | case kQuad_Verb: |
| 1593 | proc(matrix, &pts[1], &pts[1], 2); |
| 1594 | this->quadTo(pts[1], pts[2]); |
| 1595 | break; |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 1596 | case kConic_Verb: |
| 1597 | proc(matrix, &pts[1], &pts[1], 2); |
| 1598 | this->conicTo(pts[1], pts[2], iter.conicWeight()); |
| 1599 | break; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1600 | case kCubic_Verb: |
| 1601 | proc(matrix, &pts[1], &pts[1], 3); |
| 1602 | this->cubicTo(pts[1], pts[2], pts[3]); |
| 1603 | break; |
| 1604 | case kClose_Verb: |
| 1605 | this->close(); |
| 1606 | break; |
| 1607 | default: |
tomhudson@google.com | 0c00f21 | 2011-12-28 14:59:50 +0000 | [diff] [blame] | 1608 | SkDEBUGFAIL("unknown verb"); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1609 | } |
commit-bot@chromium.org | 14747e5 | 2014-02-11 21:16:29 +0000 | [diff] [blame] | 1610 | firstVerb = false; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1611 | } |
| 1612 | } |
| 1613 | |
| 1614 | /////////////////////////////////////////////////////////////////////////////// |
| 1615 | |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 1616 | static int pts_in_verb(unsigned verb) { |
| 1617 | static const uint8_t gPtsInVerb[] = { |
| 1618 | 1, // kMove |
| 1619 | 1, // kLine |
| 1620 | 2, // kQuad |
| 1621 | 2, // kConic |
| 1622 | 3, // kCubic |
| 1623 | 0, // kClose |
| 1624 | 0 // kDone |
| 1625 | }; |
| 1626 | |
| 1627 | SkASSERT(verb < SK_ARRAY_COUNT(gPtsInVerb)); |
| 1628 | return gPtsInVerb[verb]; |
| 1629 | } |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1630 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1631 | // ignore the last point of the 1st contour |
| 1632 | void SkPath::reversePathTo(const SkPath& path) { |
caryclark | 51c5678 | 2016-11-07 05:09:28 -0800 | [diff] [blame] | 1633 | const uint8_t* verbs = path.fPathRef->verbsMemBegin(); // points at the last verb |
| 1634 | if (!verbs) { // empty path returns nullptr |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1635 | return; |
| 1636 | } |
caryclark | 51c5678 | 2016-11-07 05:09:28 -0800 | [diff] [blame] | 1637 | const uint8_t* verbsEnd = path.fPathRef->verbs() - 1; // points just past the first verb |
| 1638 | SkASSERT(verbsEnd[0] == kMove_Verb); |
| 1639 | const SkPoint* pts = path.fPathRef->pointsEnd() - 1; |
| 1640 | const SkScalar* conicWeights = path.fPathRef->conicWeightsEnd(); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1641 | |
caryclark | 51c5678 | 2016-11-07 05:09:28 -0800 | [diff] [blame] | 1642 | while (verbs < verbsEnd) { |
| 1643 | uint8_t v = *verbs++; |
| 1644 | pts -= pts_in_verb(v); |
| 1645 | switch (v) { |
| 1646 | case kMove_Verb: |
| 1647 | // if the path has multiple contours, stop after reversing the last |
| 1648 | return; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1649 | case kLine_Verb: |
caryclark | 51c5678 | 2016-11-07 05:09:28 -0800 | [diff] [blame] | 1650 | this->lineTo(pts[0]); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1651 | break; |
| 1652 | case kQuad_Verb: |
caryclark | 51c5678 | 2016-11-07 05:09:28 -0800 | [diff] [blame] | 1653 | this->quadTo(pts[1], pts[0]); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1654 | break; |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 1655 | case kConic_Verb: |
caryclark | 51c5678 | 2016-11-07 05:09:28 -0800 | [diff] [blame] | 1656 | this->conicTo(pts[1], pts[0], *--conicWeights); |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 1657 | break; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1658 | case kCubic_Verb: |
caryclark | 51c5678 | 2016-11-07 05:09:28 -0800 | [diff] [blame] | 1659 | this->cubicTo(pts[2], pts[1], pts[0]); |
| 1660 | break; |
| 1661 | case kClose_Verb: |
| 1662 | SkASSERT(verbs - path.fPathRef->verbsMemBegin() == 1); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1663 | break; |
| 1664 | default: |
tomhudson@google.com | 0c00f21 | 2011-12-28 14:59:50 +0000 | [diff] [blame] | 1665 | SkDEBUGFAIL("bad verb"); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1666 | break; |
| 1667 | } |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1668 | } |
| 1669 | } |
| 1670 | |
reed@google.com | 63d7374 | 2012-01-10 15:33:12 +0000 | [diff] [blame] | 1671 | void SkPath::reverseAddPath(const SkPath& src) { |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1672 | SkPathRef::Editor ed(&fPathRef, src.fPathRef->countPoints(), src.fPathRef->countVerbs()); |
reed@google.com | 63d7374 | 2012-01-10 15:33:12 +0000 | [diff] [blame] | 1673 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1674 | const SkPoint* pts = src.fPathRef->pointsEnd(); |
| 1675 | // we will iterator through src's verbs backwards |
| 1676 | const uint8_t* verbs = src.fPathRef->verbsMemBegin(); // points at the last verb |
| 1677 | const uint8_t* verbsEnd = src.fPathRef->verbs(); // points just past the first verb |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 1678 | const SkScalar* conicWeights = src.fPathRef->conicWeightsEnd(); |
reed@google.com | 63d7374 | 2012-01-10 15:33:12 +0000 | [diff] [blame] | 1679 | |
| 1680 | bool needMove = true; |
| 1681 | bool needClose = false; |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1682 | while (verbs < verbsEnd) { |
| 1683 | uint8_t v = *(verbs++); |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 1684 | int n = pts_in_verb(v); |
reed@google.com | 63d7374 | 2012-01-10 15:33:12 +0000 | [diff] [blame] | 1685 | |
| 1686 | if (needMove) { |
| 1687 | --pts; |
| 1688 | this->moveTo(pts->fX, pts->fY); |
| 1689 | needMove = false; |
| 1690 | } |
| 1691 | pts -= n; |
| 1692 | switch (v) { |
| 1693 | case kMove_Verb: |
| 1694 | if (needClose) { |
| 1695 | this->close(); |
| 1696 | needClose = false; |
| 1697 | } |
| 1698 | needMove = true; |
| 1699 | pts += 1; // so we see the point in "if (needMove)" above |
| 1700 | break; |
| 1701 | case kLine_Verb: |
| 1702 | this->lineTo(pts[0]); |
| 1703 | break; |
| 1704 | case kQuad_Verb: |
| 1705 | this->quadTo(pts[1], pts[0]); |
| 1706 | break; |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 1707 | case kConic_Verb: |
| 1708 | this->conicTo(pts[1], pts[0], *--conicWeights); |
| 1709 | break; |
reed@google.com | 63d7374 | 2012-01-10 15:33:12 +0000 | [diff] [blame] | 1710 | case kCubic_Verb: |
| 1711 | this->cubicTo(pts[2], pts[1], pts[0]); |
| 1712 | break; |
| 1713 | case kClose_Verb: |
| 1714 | needClose = true; |
| 1715 | break; |
| 1716 | default: |
mtklein@google.com | 330313a | 2013-08-22 15:37:26 +0000 | [diff] [blame] | 1717 | SkDEBUGFAIL("unexpected verb"); |
reed@google.com | 63d7374 | 2012-01-10 15:33:12 +0000 | [diff] [blame] | 1718 | } |
| 1719 | } |
| 1720 | } |
| 1721 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1722 | /////////////////////////////////////////////////////////////////////////////// |
| 1723 | |
| 1724 | void SkPath::offset(SkScalar dx, SkScalar dy, SkPath* dst) const { |
| 1725 | SkMatrix matrix; |
| 1726 | |
| 1727 | matrix.setTranslate(dx, dy); |
| 1728 | this->transform(matrix, dst); |
| 1729 | } |
| 1730 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1731 | static void subdivide_cubic_to(SkPath* path, const SkPoint pts[4], |
| 1732 | int level = 2) { |
| 1733 | if (--level >= 0) { |
| 1734 | SkPoint tmp[7]; |
| 1735 | |
| 1736 | SkChopCubicAtHalf(pts, tmp); |
| 1737 | subdivide_cubic_to(path, &tmp[0], level); |
| 1738 | subdivide_cubic_to(path, &tmp[3], level); |
| 1739 | } else { |
| 1740 | path->cubicTo(pts[1], pts[2], pts[3]); |
| 1741 | } |
| 1742 | } |
| 1743 | |
| 1744 | void SkPath::transform(const SkMatrix& matrix, SkPath* dst) const { |
| 1745 | SkDEBUGCODE(this->validate();) |
halcanary | 96fcdcc | 2015-08-27 07:41:13 -0700 | [diff] [blame] | 1746 | if (dst == nullptr) { |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1747 | dst = (SkPath*)this; |
| 1748 | } |
| 1749 | |
tomhudson@google.com | 8d43018 | 2011-06-06 19:11:19 +0000 | [diff] [blame] | 1750 | if (matrix.hasPerspective()) { |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1751 | SkPath tmp; |
| 1752 | tmp.fFillType = fFillType; |
| 1753 | |
| 1754 | SkPath::Iter iter(*this, false); |
| 1755 | SkPoint pts[4]; |
| 1756 | SkPath::Verb verb; |
| 1757 | |
reed@google.com | 4a3b714 | 2012-05-16 17:16:46 +0000 | [diff] [blame] | 1758 | while ((verb = iter.next(pts, false)) != kDone_Verb) { |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1759 | switch (verb) { |
| 1760 | case kMove_Verb: |
| 1761 | tmp.moveTo(pts[0]); |
| 1762 | break; |
| 1763 | case kLine_Verb: |
| 1764 | tmp.lineTo(pts[1]); |
| 1765 | break; |
| 1766 | case kQuad_Verb: |
reed | 220f926 | 2014-12-17 08:21:04 -0800 | [diff] [blame] | 1767 | // promote the quad to a conic |
| 1768 | tmp.conicTo(pts[1], pts[2], |
| 1769 | SkConic::TransformW(pts, SK_Scalar1, matrix)); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1770 | break; |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 1771 | case kConic_Verb: |
reed | 220f926 | 2014-12-17 08:21:04 -0800 | [diff] [blame] | 1772 | tmp.conicTo(pts[1], pts[2], |
| 1773 | SkConic::TransformW(pts, iter.conicWeight(), matrix)); |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 1774 | break; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1775 | case kCubic_Verb: |
| 1776 | subdivide_cubic_to(&tmp, pts); |
| 1777 | break; |
| 1778 | case kClose_Verb: |
| 1779 | tmp.close(); |
| 1780 | break; |
| 1781 | default: |
tomhudson@google.com | 0c00f21 | 2011-12-28 14:59:50 +0000 | [diff] [blame] | 1782 | SkDEBUGFAIL("unknown verb"); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1783 | break; |
| 1784 | } |
| 1785 | } |
| 1786 | |
| 1787 | dst->swap(tmp); |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1788 | SkPathRef::Editor ed(&dst->fPathRef); |
| 1789 | matrix.mapPoints(ed.points(), ed.pathRef()->countPoints()); |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 1790 | dst->fFirstDirection = SkPathPriv::kUnknown_FirstDirection; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1791 | } else { |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1792 | SkPathRef::CreateTransformedCopy(&dst->fPathRef, *fPathRef.get(), matrix); |
| 1793 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1794 | if (this != dst) { |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1795 | dst->fFillType = fFillType; |
Mike Klein | b9b5de5 | 2017-09-27 13:26:22 -0400 | [diff] [blame] | 1796 | dst->fConvexity.store(fConvexity); |
jvanverth | b3eb687 | 2014-10-24 07:12:51 -0700 | [diff] [blame] | 1797 | dst->fIsVolatile = fIsVolatile; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1798 | } |
bsalomon@google.com | 6aa2965 | 2012-04-18 13:29:52 +0000 | [diff] [blame] | 1799 | |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 1800 | if (SkPathPriv::kUnknown_FirstDirection == fFirstDirection) { |
| 1801 | dst->fFirstDirection = SkPathPriv::kUnknown_FirstDirection; |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 1802 | } else { |
| 1803 | SkScalar det2x2 = |
Mike Reed | a99b6ce | 2017-02-04 11:04:26 -0500 | [diff] [blame] | 1804 | matrix.get(SkMatrix::kMScaleX) * matrix.get(SkMatrix::kMScaleY) - |
| 1805 | matrix.get(SkMatrix::kMSkewX) * matrix.get(SkMatrix::kMSkewY); |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 1806 | if (det2x2 < 0) { |
herb | 9f4dbca | 2015-09-28 11:05:47 -0700 | [diff] [blame] | 1807 | dst->fFirstDirection = SkPathPriv::OppositeFirstDirection( |
| 1808 | (SkPathPriv::FirstDirection)fFirstDirection.load()); |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 1809 | } else if (det2x2 > 0) { |
herb | 9f4dbca | 2015-09-28 11:05:47 -0700 | [diff] [blame] | 1810 | dst->fFirstDirection = fFirstDirection.load(); |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 1811 | } else { |
commit-bot@chromium.org | a1a097e | 2013-11-14 16:53:22 +0000 | [diff] [blame] | 1812 | dst->fConvexity = kUnknown_Convexity; |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 1813 | dst->fFirstDirection = SkPathPriv::kUnknown_FirstDirection; |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 1814 | } |
| 1815 | } |
| 1816 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1817 | SkDEBUGCODE(dst->validate();) |
| 1818 | } |
| 1819 | } |
| 1820 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1821 | /////////////////////////////////////////////////////////////////////////////// |
| 1822 | /////////////////////////////////////////////////////////////////////////////// |
| 1823 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1824 | SkPath::Iter::Iter() { |
| 1825 | #ifdef SK_DEBUG |
halcanary | 96fcdcc | 2015-08-27 07:41:13 -0700 | [diff] [blame] | 1826 | fPts = nullptr; |
| 1827 | fConicWeights = nullptr; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1828 | fMoveTo.fX = fMoveTo.fY = fLastPt.fX = fLastPt.fY = 0; |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1829 | fForceClose = fCloseLine = false; |
schenney@chromium.org | fde6b41 | 2012-01-19 15:31:01 +0000 | [diff] [blame] | 1830 | fSegmentState = kEmptyContour_SegmentState; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1831 | #endif |
| 1832 | // need to init enough to make next() harmlessly return kDone_Verb |
halcanary | 96fcdcc | 2015-08-27 07:41:13 -0700 | [diff] [blame] | 1833 | fVerbs = nullptr; |
| 1834 | fVerbStop = nullptr; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1835 | fNeedClose = false; |
| 1836 | } |
| 1837 | |
| 1838 | SkPath::Iter::Iter(const SkPath& path, bool forceClose) { |
| 1839 | this->setPath(path, forceClose); |
| 1840 | } |
| 1841 | |
| 1842 | void SkPath::Iter::setPath(const SkPath& path, bool forceClose) { |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1843 | fPts = path.fPathRef->points(); |
| 1844 | fVerbs = path.fPathRef->verbs(); |
| 1845 | fVerbStop = path.fPathRef->verbsMemBegin(); |
caryclark | 6942442 | 2016-10-04 13:06:17 -0700 | [diff] [blame] | 1846 | fConicWeights = path.fPathRef->conicWeights(); |
| 1847 | if (fConicWeights) { |
| 1848 | fConicWeights -= 1; // begin one behind |
| 1849 | } |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1850 | fLastPt.fX = fLastPt.fY = 0; |
schenney@chromium.org | 72785c4 | 2011-12-29 21:03:28 +0000 | [diff] [blame] | 1851 | fMoveTo.fX = fMoveTo.fY = 0; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1852 | fForceClose = SkToU8(forceClose); |
| 1853 | fNeedClose = false; |
schenney@chromium.org | fde6b41 | 2012-01-19 15:31:01 +0000 | [diff] [blame] | 1854 | fSegmentState = kEmptyContour_SegmentState; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1855 | } |
| 1856 | |
| 1857 | bool SkPath::Iter::isClosedContour() const { |
halcanary | 96fcdcc | 2015-08-27 07:41:13 -0700 | [diff] [blame] | 1858 | if (fVerbs == nullptr || fVerbs == fVerbStop) { |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1859 | return false; |
| 1860 | } |
| 1861 | if (fForceClose) { |
| 1862 | return true; |
| 1863 | } |
| 1864 | |
| 1865 | const uint8_t* verbs = fVerbs; |
| 1866 | const uint8_t* stop = fVerbStop; |
reed@google.com | abf15c1 | 2011-01-18 20:35:51 +0000 | [diff] [blame] | 1867 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1868 | if (kMove_Verb == *(verbs - 1)) { |
| 1869 | verbs -= 1; // skip the initial moveto |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1870 | } |
| 1871 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1872 | while (verbs > stop) { |
| 1873 | // verbs points one beyond the current verb, decrement first. |
| 1874 | unsigned v = *(--verbs); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1875 | if (kMove_Verb == v) { |
| 1876 | break; |
| 1877 | } |
| 1878 | if (kClose_Verb == v) { |
| 1879 | return true; |
| 1880 | } |
| 1881 | } |
| 1882 | return false; |
| 1883 | } |
| 1884 | |
| 1885 | SkPath::Verb SkPath::Iter::autoClose(SkPoint pts[2]) { |
reed@google.com | 9e25dbf | 2012-05-15 17:05:38 +0000 | [diff] [blame] | 1886 | SkASSERT(pts); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1887 | if (fLastPt != fMoveTo) { |
reed@android.com | 4ddfe35 | 2009-03-20 12:16:09 +0000 | [diff] [blame] | 1888 | // A special case: if both points are NaN, SkPoint::operation== returns |
| 1889 | // false, but the iterator expects that they are treated as the same. |
| 1890 | // (consider SkPoint is a 2-dimension float point). |
reed@android.com | 9da1ae3 | 2009-07-22 17:06:15 +0000 | [diff] [blame] | 1891 | if (SkScalarIsNaN(fLastPt.fX) || SkScalarIsNaN(fLastPt.fY) || |
| 1892 | SkScalarIsNaN(fMoveTo.fX) || SkScalarIsNaN(fMoveTo.fY)) { |
reed@android.com | 4ddfe35 | 2009-03-20 12:16:09 +0000 | [diff] [blame] | 1893 | return kClose_Verb; |
| 1894 | } |
| 1895 | |
reed@google.com | 9e25dbf | 2012-05-15 17:05:38 +0000 | [diff] [blame] | 1896 | pts[0] = fLastPt; |
| 1897 | pts[1] = fMoveTo; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1898 | fLastPt = fMoveTo; |
| 1899 | fCloseLine = true; |
| 1900 | return kLine_Verb; |
bsalomon@google.com | b3b8dfa | 2011-07-13 17:44:36 +0000 | [diff] [blame] | 1901 | } else { |
| 1902 | pts[0] = fMoveTo; |
| 1903 | return kClose_Verb; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1904 | } |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1905 | } |
| 1906 | |
reed@google.com | 9e25dbf | 2012-05-15 17:05:38 +0000 | [diff] [blame] | 1907 | const SkPoint& SkPath::Iter::cons_moveTo() { |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1908 | if (fSegmentState == kAfterMove_SegmentState) { |
| 1909 | // Set the first return pt to the move pt |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1910 | fSegmentState = kAfterPrimitive_SegmentState; |
reed@google.com | 9e25dbf | 2012-05-15 17:05:38 +0000 | [diff] [blame] | 1911 | return fMoveTo; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1912 | } |
Ben Wagner | cee46e5 | 2018-06-12 16:30:29 -0400 | [diff] [blame] | 1913 | |
| 1914 | SkASSERT(fSegmentState == kAfterPrimitive_SegmentState); |
| 1915 | // Set the first return pt to the last pt of the previous primitive. |
| 1916 | return fPts[-1]; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 1917 | } |
| 1918 | |
caryclark | e8c5666 | 2015-07-14 11:19:26 -0700 | [diff] [blame] | 1919 | void SkPath::Iter::consumeDegenerateSegments(bool exact) { |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1920 | // We need to step over anything that will not move the current draw point |
| 1921 | // forward before the next move is seen |
Ben Wagner | a93a14a | 2017-08-28 10:34:05 -0400 | [diff] [blame] | 1922 | const uint8_t* lastMoveVerb = nullptr; |
| 1923 | const SkPoint* lastMovePt = nullptr; |
halcanary | 96fcdcc | 2015-08-27 07:41:13 -0700 | [diff] [blame] | 1924 | const SkScalar* lastMoveWeight = nullptr; |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1925 | SkPoint lastPt = fLastPt; |
| 1926 | while (fVerbs != fVerbStop) { |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1927 | unsigned verb = *(fVerbs - 1); // fVerbs is one beyond the current verb |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1928 | switch (verb) { |
| 1929 | case kMove_Verb: |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1930 | // Keep a record of this most recent move |
| 1931 | lastMoveVerb = fVerbs; |
| 1932 | lastMovePt = fPts; |
robertphillips | b8de1f4 | 2015-02-23 11:17:01 -0800 | [diff] [blame] | 1933 | lastMoveWeight = fConicWeights; |
schenney@chromium.org | b0af6da | 2011-12-21 20:43:13 +0000 | [diff] [blame] | 1934 | lastPt = fPts[0]; |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1935 | fVerbs--; |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1936 | fPts++; |
| 1937 | break; |
| 1938 | |
| 1939 | case kClose_Verb: |
schenney@chromium.org | 7e96360 | 2012-06-13 17:05:43 +0000 | [diff] [blame] | 1940 | // A close when we are in a segment is always valid except when it |
| 1941 | // follows a move which follows a segment. |
| 1942 | if (fSegmentState == kAfterPrimitive_SegmentState && !lastMoveVerb) { |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1943 | return; |
| 1944 | } |
| 1945 | // A close at any other time must be ignored |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1946 | fVerbs--; |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1947 | break; |
| 1948 | |
| 1949 | case kLine_Verb: |
caryclark | e8c5666 | 2015-07-14 11:19:26 -0700 | [diff] [blame] | 1950 | if (!IsLineDegenerate(lastPt, fPts[0], exact)) { |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1951 | if (lastMoveVerb) { |
| 1952 | fVerbs = lastMoveVerb; |
| 1953 | fPts = lastMovePt; |
robertphillips | b8de1f4 | 2015-02-23 11:17:01 -0800 | [diff] [blame] | 1954 | fConicWeights = lastMoveWeight; |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1955 | return; |
| 1956 | } |
| 1957 | return; |
| 1958 | } |
| 1959 | // Ignore this line and continue |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1960 | fVerbs--; |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1961 | fPts++; |
| 1962 | break; |
| 1963 | |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 1964 | case kConic_Verb: |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1965 | case kQuad_Verb: |
caryclark | e8c5666 | 2015-07-14 11:19:26 -0700 | [diff] [blame] | 1966 | if (!IsQuadDegenerate(lastPt, fPts[0], fPts[1], exact)) { |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1967 | if (lastMoveVerb) { |
| 1968 | fVerbs = lastMoveVerb; |
| 1969 | fPts = lastMovePt; |
robertphillips | b8de1f4 | 2015-02-23 11:17:01 -0800 | [diff] [blame] | 1970 | fConicWeights = lastMoveWeight; |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1971 | return; |
| 1972 | } |
| 1973 | return; |
| 1974 | } |
| 1975 | // Ignore this line and continue |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1976 | fVerbs--; |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1977 | fPts += 2; |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 1978 | fConicWeights += (kConic_Verb == verb); |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1979 | break; |
| 1980 | |
| 1981 | case kCubic_Verb: |
caryclark | e8c5666 | 2015-07-14 11:19:26 -0700 | [diff] [blame] | 1982 | if (!IsCubicDegenerate(lastPt, fPts[0], fPts[1], fPts[2], exact)) { |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1983 | if (lastMoveVerb) { |
| 1984 | fVerbs = lastMoveVerb; |
| 1985 | fPts = lastMovePt; |
robertphillips | b8de1f4 | 2015-02-23 11:17:01 -0800 | [diff] [blame] | 1986 | fConicWeights = lastMoveWeight; |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1987 | return; |
| 1988 | } |
| 1989 | return; |
| 1990 | } |
| 1991 | // Ignore this line and continue |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 1992 | fVerbs--; |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1993 | fPts += 3; |
| 1994 | break; |
schenney@chromium.org | b0af6da | 2011-12-21 20:43:13 +0000 | [diff] [blame] | 1995 | |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1996 | default: |
tomhudson@google.com | 0c00f21 | 2011-12-28 14:59:50 +0000 | [diff] [blame] | 1997 | SkDEBUGFAIL("Should never see kDone_Verb"); |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 1998 | } |
| 1999 | } |
| 2000 | } |
| 2001 | |
reed@google.com | 4a3b714 | 2012-05-16 17:16:46 +0000 | [diff] [blame] | 2002 | SkPath::Verb SkPath::Iter::doNext(SkPoint ptsParam[4]) { |
reed@google.com | 9e25dbf | 2012-05-15 17:05:38 +0000 | [diff] [blame] | 2003 | SkASSERT(ptsParam); |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 2004 | |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2005 | if (fVerbs == fVerbStop) { |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 2006 | // Close the curve if requested and if there is some curve to close |
| 2007 | if (fNeedClose && fSegmentState == kAfterPrimitive_SegmentState) { |
reed@google.com | 9e25dbf | 2012-05-15 17:05:38 +0000 | [diff] [blame] | 2008 | if (kLine_Verb == this->autoClose(ptsParam)) { |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2009 | return kLine_Verb; |
| 2010 | } |
| 2011 | fNeedClose = false; |
| 2012 | return kClose_Verb; |
| 2013 | } |
| 2014 | return kDone_Verb; |
| 2015 | } |
| 2016 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 2017 | // fVerbs is one beyond the current verb, decrement first |
| 2018 | unsigned verb = *(--fVerbs); |
reed@google.com | 9e25dbf | 2012-05-15 17:05:38 +0000 | [diff] [blame] | 2019 | const SkPoint* SK_RESTRICT srcPts = fPts; |
| 2020 | SkPoint* SK_RESTRICT pts = ptsParam; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2021 | |
| 2022 | switch (verb) { |
| 2023 | case kMove_Verb: |
| 2024 | if (fNeedClose) { |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 2025 | fVerbs++; // move back one verb |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2026 | verb = this->autoClose(pts); |
| 2027 | if (verb == kClose_Verb) { |
| 2028 | fNeedClose = false; |
| 2029 | } |
| 2030 | return (Verb)verb; |
| 2031 | } |
| 2032 | if (fVerbs == fVerbStop) { // might be a trailing moveto |
| 2033 | return kDone_Verb; |
| 2034 | } |
schenney@chromium.org | b0af6da | 2011-12-21 20:43:13 +0000 | [diff] [blame] | 2035 | fMoveTo = *srcPts; |
reed@google.com | 9e25dbf | 2012-05-15 17:05:38 +0000 | [diff] [blame] | 2036 | pts[0] = *srcPts; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2037 | srcPts += 1; |
schenney@chromium.org | b0af6da | 2011-12-21 20:43:13 +0000 | [diff] [blame] | 2038 | fSegmentState = kAfterMove_SegmentState; |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 2039 | fLastPt = fMoveTo; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2040 | fNeedClose = fForceClose; |
| 2041 | break; |
| 2042 | case kLine_Verb: |
reed@google.com | 9e25dbf | 2012-05-15 17:05:38 +0000 | [diff] [blame] | 2043 | pts[0] = this->cons_moveTo(); |
| 2044 | pts[1] = srcPts[0]; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2045 | fLastPt = srcPts[0]; |
| 2046 | fCloseLine = false; |
| 2047 | srcPts += 1; |
| 2048 | break; |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 2049 | case kConic_Verb: |
| 2050 | fConicWeights += 1; |
| 2051 | // fall-through |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2052 | case kQuad_Verb: |
reed@google.com | 9e25dbf | 2012-05-15 17:05:38 +0000 | [diff] [blame] | 2053 | pts[0] = this->cons_moveTo(); |
| 2054 | memcpy(&pts[1], srcPts, 2 * sizeof(SkPoint)); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2055 | fLastPt = srcPts[1]; |
| 2056 | srcPts += 2; |
| 2057 | break; |
| 2058 | case kCubic_Verb: |
reed@google.com | 9e25dbf | 2012-05-15 17:05:38 +0000 | [diff] [blame] | 2059 | pts[0] = this->cons_moveTo(); |
| 2060 | memcpy(&pts[1], srcPts, 3 * sizeof(SkPoint)); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2061 | fLastPt = srcPts[2]; |
| 2062 | srcPts += 3; |
| 2063 | break; |
| 2064 | case kClose_Verb: |
| 2065 | verb = this->autoClose(pts); |
| 2066 | if (verb == kLine_Verb) { |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 2067 | fVerbs++; // move back one verb |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2068 | } else { |
| 2069 | fNeedClose = false; |
schenney@chromium.org | fde6b41 | 2012-01-19 15:31:01 +0000 | [diff] [blame] | 2070 | fSegmentState = kEmptyContour_SegmentState; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2071 | } |
schenney@chromium.org | 4da06ab | 2011-12-20 15:14:18 +0000 | [diff] [blame] | 2072 | fLastPt = fMoveTo; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2073 | break; |
| 2074 | } |
| 2075 | fPts = srcPts; |
| 2076 | return (Verb)verb; |
| 2077 | } |
| 2078 | |
| 2079 | /////////////////////////////////////////////////////////////////////////////// |
| 2080 | |
Ben Wagner | 4d1955c | 2017-03-10 13:08:15 -0500 | [diff] [blame] | 2081 | #include "SkString.h" |
reed | e05fed0 | 2014-12-15 07:59:53 -0800 | [diff] [blame] | 2082 | #include "SkStringUtils.h" |
caryclark | 66a5d8b | 2014-06-24 08:30:15 -0700 | [diff] [blame] | 2083 | #include "SkStream.h" |
reed@google.com | 51bbe75 | 2013-01-17 22:07:50 +0000 | [diff] [blame] | 2084 | |
reed@google.com | 51bbe75 | 2013-01-17 22:07:50 +0000 | [diff] [blame] | 2085 | static void append_params(SkString* str, const char label[], const SkPoint pts[], |
Mike Reed | 405b9d2 | 2018-01-09 15:11:08 -0500 | [diff] [blame] | 2086 | int count, SkScalarAsStringType strType, SkScalar conicWeight = -12345) { |
reed@google.com | 51bbe75 | 2013-01-17 22:07:50 +0000 | [diff] [blame] | 2087 | str->append(label); |
| 2088 | str->append("("); |
skia.committer@gmail.com | 15dd300 | 2013-01-18 07:07:28 +0000 | [diff] [blame] | 2089 | |
reed@google.com | 51bbe75 | 2013-01-17 22:07:50 +0000 | [diff] [blame] | 2090 | const SkScalar* values = &pts[0].fX; |
| 2091 | count *= 2; |
| 2092 | |
| 2093 | for (int i = 0; i < count; ++i) { |
reed | e05fed0 | 2014-12-15 07:59:53 -0800 | [diff] [blame] | 2094 | SkAppendScalar(str, values[i], strType); |
reed@google.com | 51bbe75 | 2013-01-17 22:07:50 +0000 | [diff] [blame] | 2095 | if (i < count - 1) { |
| 2096 | str->append(", "); |
| 2097 | } |
| 2098 | } |
Mike Reed | 405b9d2 | 2018-01-09 15:11:08 -0500 | [diff] [blame] | 2099 | if (conicWeight != -12345) { |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 2100 | str->append(", "); |
reed | e05fed0 | 2014-12-15 07:59:53 -0800 | [diff] [blame] | 2101 | SkAppendScalar(str, conicWeight, strType); |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 2102 | } |
caryclark | 08fa28c | 2014-10-23 13:08:56 -0700 | [diff] [blame] | 2103 | str->append(");"); |
reed | e05fed0 | 2014-12-15 07:59:53 -0800 | [diff] [blame] | 2104 | if (kHex_SkScalarAsStringType == strType) { |
caryclark | 08fa28c | 2014-10-23 13:08:56 -0700 | [diff] [blame] | 2105 | str->append(" // "); |
| 2106 | for (int i = 0; i < count; ++i) { |
reed | e05fed0 | 2014-12-15 07:59:53 -0800 | [diff] [blame] | 2107 | SkAppendScalarDec(str, values[i]); |
caryclark | 08fa28c | 2014-10-23 13:08:56 -0700 | [diff] [blame] | 2108 | if (i < count - 1) { |
| 2109 | str->append(", "); |
| 2110 | } |
| 2111 | } |
| 2112 | if (conicWeight >= 0) { |
| 2113 | str->append(", "); |
reed | e05fed0 | 2014-12-15 07:59:53 -0800 | [diff] [blame] | 2114 | SkAppendScalarDec(str, conicWeight); |
caryclark | 08fa28c | 2014-10-23 13:08:56 -0700 | [diff] [blame] | 2115 | } |
| 2116 | } |
| 2117 | str->append("\n"); |
reed@google.com | 51bbe75 | 2013-01-17 22:07:50 +0000 | [diff] [blame] | 2118 | } |
| 2119 | |
caryclark | e956259 | 2014-09-15 09:26:09 -0700 | [diff] [blame] | 2120 | void SkPath::dump(SkWStream* wStream, bool forceClose, bool dumpAsHex) const { |
reed | e05fed0 | 2014-12-15 07:59:53 -0800 | [diff] [blame] | 2121 | SkScalarAsStringType asType = dumpAsHex ? kHex_SkScalarAsStringType : kDec_SkScalarAsStringType; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2122 | Iter iter(*this, forceClose); |
| 2123 | SkPoint pts[4]; |
| 2124 | Verb verb; |
| 2125 | |
reed@google.com | 51bbe75 | 2013-01-17 22:07:50 +0000 | [diff] [blame] | 2126 | SkString builder; |
Cary Clark | 9f67f04 | 2016-12-16 11:32:54 -0500 | [diff] [blame] | 2127 | char const * const gFillTypeStrs[] = { |
| 2128 | "Winding", |
| 2129 | "EvenOdd", |
| 2130 | "InverseWinding", |
| 2131 | "InverseEvenOdd", |
| 2132 | }; |
| 2133 | builder.printf("path.setFillType(SkPath::k%s_FillType);\n", |
| 2134 | gFillTypeStrs[(int) this->getFillType()]); |
reed@google.com | 4a3b714 | 2012-05-16 17:16:46 +0000 | [diff] [blame] | 2135 | while ((verb = iter.next(pts, false)) != kDone_Verb) { |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2136 | switch (verb) { |
| 2137 | case kMove_Verb: |
reed | e05fed0 | 2014-12-15 07:59:53 -0800 | [diff] [blame] | 2138 | append_params(&builder, "path.moveTo", &pts[0], 1, asType); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2139 | break; |
| 2140 | case kLine_Verb: |
reed | e05fed0 | 2014-12-15 07:59:53 -0800 | [diff] [blame] | 2141 | append_params(&builder, "path.lineTo", &pts[1], 1, asType); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2142 | break; |
| 2143 | case kQuad_Verb: |
reed | e05fed0 | 2014-12-15 07:59:53 -0800 | [diff] [blame] | 2144 | append_params(&builder, "path.quadTo", &pts[1], 2, asType); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2145 | break; |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 2146 | case kConic_Verb: |
reed | e05fed0 | 2014-12-15 07:59:53 -0800 | [diff] [blame] | 2147 | append_params(&builder, "path.conicTo", &pts[1], 2, asType, iter.conicWeight()); |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 2148 | break; |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2149 | case kCubic_Verb: |
reed | e05fed0 | 2014-12-15 07:59:53 -0800 | [diff] [blame] | 2150 | append_params(&builder, "path.cubicTo", &pts[1], 3, asType); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2151 | break; |
| 2152 | case kClose_Verb: |
caryclark | 66a5d8b | 2014-06-24 08:30:15 -0700 | [diff] [blame] | 2153 | builder.append("path.close();\n"); |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2154 | break; |
| 2155 | default: |
| 2156 | SkDebugf(" path: UNKNOWN VERB %d, aborting dump...\n", verb); |
| 2157 | verb = kDone_Verb; // stop the loop |
| 2158 | break; |
| 2159 | } |
caryclark | 1049f12 | 2015-04-20 08:31:59 -0700 | [diff] [blame] | 2160 | if (!wStream && builder.size()) { |
| 2161 | SkDebugf("%s", builder.c_str()); |
| 2162 | builder.reset(); |
| 2163 | } |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2164 | } |
caryclark | 66a5d8b | 2014-06-24 08:30:15 -0700 | [diff] [blame] | 2165 | if (wStream) { |
| 2166 | wStream->writeText(builder.c_str()); |
caryclark | 66a5d8b | 2014-06-24 08:30:15 -0700 | [diff] [blame] | 2167 | } |
reed@android.com | 8a1c16f | 2008-12-17 15:59:43 +0000 | [diff] [blame] | 2168 | } |
| 2169 | |
reed@android.com | e522ca5 | 2009-11-23 20:10:41 +0000 | [diff] [blame] | 2170 | void SkPath::dump() const { |
halcanary | 96fcdcc | 2015-08-27 07:41:13 -0700 | [diff] [blame] | 2171 | this->dump(nullptr, false, false); |
caryclark | e956259 | 2014-09-15 09:26:09 -0700 | [diff] [blame] | 2172 | } |
| 2173 | |
| 2174 | void SkPath::dumpHex() const { |
halcanary | 96fcdcc | 2015-08-27 07:41:13 -0700 | [diff] [blame] | 2175 | this->dump(nullptr, false, true); |
reed@android.com | e522ca5 | 2009-11-23 20:10:41 +0000 | [diff] [blame] | 2176 | } |
| 2177 | |
Adrienne Walker | ad8da8e | 2017-08-10 12:16:37 -0700 | [diff] [blame] | 2178 | |
Cary Clark | 0461e9f | 2017-08-25 15:13:38 -0400 | [diff] [blame] | 2179 | bool SkPath::isValidImpl() const { |
Adrienne Walker | ad8da8e | 2017-08-10 12:16:37 -0700 | [diff] [blame] | 2180 | if ((fFillType & ~3) != 0) { |
| 2181 | return false; |
| 2182 | } |
reed@google.com | abf15c1 | 2011-01-18 20:35:51 +0000 | [diff] [blame] | 2183 | |
djsollen@google.com | 077348c | 2012-10-22 20:23:32 +0000 | [diff] [blame] | 2184 | #ifdef SK_DEBUG_PATH |
reed@android.com | e522ca5 | 2009-11-23 20:10:41 +0000 | [diff] [blame] | 2185 | if (!fBoundsIsDirty) { |
| 2186 | SkRect bounds; |
tomhudson@google.com | ed02c4d | 2012-08-10 14:10:45 +0000 | [diff] [blame] | 2187 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 2188 | bool isFinite = compute_pt_bounds(&bounds, *fPathRef.get()); |
Adrienne Walker | ad8da8e | 2017-08-10 12:16:37 -0700 | [diff] [blame] | 2189 | if (SkToBool(fIsFinite) != isFinite) { |
| 2190 | return false; |
| 2191 | } |
tomhudson@google.com | ed02c4d | 2012-08-10 14:10:45 +0000 | [diff] [blame] | 2192 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 2193 | if (fPathRef->countPoints() <= 1) { |
reed@android.com | e522ca5 | 2009-11-23 20:10:41 +0000 | [diff] [blame] | 2194 | // if we're empty, fBounds may be empty but translated, so we can't |
| 2195 | // necessarily compare to bounds directly |
| 2196 | // try path.addOval(2, 2, 2, 2) which is empty, but the bounds will |
| 2197 | // be [2, 2, 2, 2] |
Adrienne Walker | ad8da8e | 2017-08-10 12:16:37 -0700 | [diff] [blame] | 2198 | if (!bounds.isEmpty() || !fBounds.isEmpty()) { |
| 2199 | return false; |
| 2200 | } |
reed@android.com | e522ca5 | 2009-11-23 20:10:41 +0000 | [diff] [blame] | 2201 | } else { |
reed@google.com | eac52bd | 2011-11-14 18:13:59 +0000 | [diff] [blame] | 2202 | if (bounds.isEmpty()) { |
Adrienne Walker | ad8da8e | 2017-08-10 12:16:37 -0700 | [diff] [blame] | 2203 | if (!fBounds.isEmpty()) { |
| 2204 | return false; |
| 2205 | } |
reed@google.com | eac52bd | 2011-11-14 18:13:59 +0000 | [diff] [blame] | 2206 | } else { |
reed@google.com | 3563c9e | 2011-11-14 19:34:57 +0000 | [diff] [blame] | 2207 | if (!fBounds.isEmpty()) { |
Adrienne Walker | ad8da8e | 2017-08-10 12:16:37 -0700 | [diff] [blame] | 2208 | if (!fBounds.contains(bounds)) { |
| 2209 | return false; |
| 2210 | } |
reed@google.com | 3563c9e | 2011-11-14 19:34:57 +0000 | [diff] [blame] | 2211 | } |
reed@google.com | eac52bd | 2011-11-14 18:13:59 +0000 | [diff] [blame] | 2212 | } |
reed@android.com | e522ca5 | 2009-11-23 20:10:41 +0000 | [diff] [blame] | 2213 | } |
| 2214 | } |
djsollen@google.com | 077348c | 2012-10-22 20:23:32 +0000 | [diff] [blame] | 2215 | #endif // SK_DEBUG_PATH |
Adrienne Walker | ad8da8e | 2017-08-10 12:16:37 -0700 | [diff] [blame] | 2216 | return true; |
reed@android.com | e522ca5 | 2009-11-23 20:10:41 +0000 | [diff] [blame] | 2217 | } |
reed@android.com | e522ca5 | 2009-11-23 20:10:41 +0000 | [diff] [blame] | 2218 | |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2219 | /////////////////////////////////////////////////////////////////////////////// |
| 2220 | |
reed@google.com | 0b7b982 | 2011-05-16 12:29:27 +0000 | [diff] [blame] | 2221 | static int sign(SkScalar x) { return x < 0; } |
| 2222 | #define kValueNeverReturnedBySign 2 |
reed@google.com | 85b6e39 | 2011-05-15 20:25:17 +0000 | [diff] [blame] | 2223 | |
robertphillips | c506e30 | 2014-09-16 09:43:31 -0700 | [diff] [blame] | 2224 | enum DirChange { |
| 2225 | kLeft_DirChange, |
| 2226 | kRight_DirChange, |
| 2227 | kStraight_DirChange, |
| 2228 | kBackwards_DirChange, |
| 2229 | |
| 2230 | kInvalid_DirChange |
| 2231 | }; |
| 2232 | |
| 2233 | |
commit-bot@chromium.org | 8be07bb | 2014-05-22 14:58:53 +0000 | [diff] [blame] | 2234 | static bool almost_equal(SkScalar compA, SkScalar compB) { |
commit-bot@chromium.org | f91aaec | 2013-11-01 15:24:55 +0000 | [diff] [blame] | 2235 | // The error epsilon was empirically derived; worse case round rects |
| 2236 | // with a mid point outset by 2x float epsilon in tests had an error |
| 2237 | // of 12. |
| 2238 | const int epsilon = 16; |
| 2239 | if (!SkScalarIsFinite(compA) || !SkScalarIsFinite(compB)) { |
| 2240 | return false; |
| 2241 | } |
commit-bot@chromium.org | a1a097e | 2013-11-14 16:53:22 +0000 | [diff] [blame] | 2242 | // no need to check for small numbers because SkPath::Iter has removed degenerate values |
commit-bot@chromium.org | f91aaec | 2013-11-01 15:24:55 +0000 | [diff] [blame] | 2243 | int aBits = SkFloatAs2sCompliment(compA); |
| 2244 | int bBits = SkFloatAs2sCompliment(compB); |
| 2245 | return aBits < bBits + epsilon && bBits < aBits + epsilon; |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2246 | } |
| 2247 | |
caryclark | b421650 | 2015-03-02 13:02:34 -0800 | [diff] [blame] | 2248 | static bool approximately_zero_when_compared_to(double x, double y) { |
| 2249 | return x == 0 || fabs(x) < fabs(y * FLT_EPSILON); |
robertphillips | c506e30 | 2014-09-16 09:43:31 -0700 | [diff] [blame] | 2250 | } |
| 2251 | |
caryclark | b421650 | 2015-03-02 13:02:34 -0800 | [diff] [blame] | 2252 | |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2253 | // only valid for a single contour |
| 2254 | struct Convexicator { |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 2255 | Convexicator() |
| 2256 | : fPtCount(0) |
| 2257 | , fConvexity(SkPath::kConvex_Convexity) |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 2258 | , fFirstDirection(SkPathPriv::kUnknown_FirstDirection) |
caryclark | 5ccef57 | 2015-03-02 10:07:56 -0800 | [diff] [blame] | 2259 | , fIsFinite(true) |
Cary Clark | c8323aa | 2017-08-25 08:04:43 -0400 | [diff] [blame] | 2260 | , fIsCurve(false) |
| 2261 | , fBackwards(false) { |
robertphillips | c506e30 | 2014-09-16 09:43:31 -0700 | [diff] [blame] | 2262 | fExpectedDir = kInvalid_DirChange; |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2263 | // warnings |
djsollen | 2f12463 | 2016-04-29 13:53:05 -0700 | [diff] [blame] | 2264 | fPriorPt.set(0,0); |
commit-bot@chromium.org | f91aaec | 2013-11-01 15:24:55 +0000 | [diff] [blame] | 2265 | fLastPt.set(0, 0); |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2266 | fCurrPt.set(0, 0); |
commit-bot@chromium.org | 8be07bb | 2014-05-22 14:58:53 +0000 | [diff] [blame] | 2267 | fLastVec.set(0, 0); |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2268 | fFirstVec.set(0, 0); |
reed@google.com | 85b6e39 | 2011-05-15 20:25:17 +0000 | [diff] [blame] | 2269 | |
| 2270 | fDx = fDy = 0; |
reed@google.com | 0b7b982 | 2011-05-16 12:29:27 +0000 | [diff] [blame] | 2271 | fSx = fSy = kValueNeverReturnedBySign; |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2272 | } |
| 2273 | |
| 2274 | SkPath::Convexity getConvexity() const { return fConvexity; } |
| 2275 | |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 2276 | /** The direction returned is only valid if the path is determined convex */ |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 2277 | SkPathPriv::FirstDirection getFirstDirection() const { return fFirstDirection; } |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 2278 | |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2279 | void addPt(const SkPoint& pt) { |
caryclark | d3d1a98 | 2014-12-08 04:57:38 -0800 | [diff] [blame] | 2280 | if (SkPath::kConcave_Convexity == fConvexity || !fIsFinite) { |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2281 | return; |
| 2282 | } |
| 2283 | |
| 2284 | if (0 == fPtCount) { |
| 2285 | fCurrPt = pt; |
| 2286 | ++fPtCount; |
| 2287 | } else { |
| 2288 | SkVector vec = pt - fCurrPt; |
Cary Clark | df429f3 | 2017-11-08 11:44:31 -0500 | [diff] [blame] | 2289 | SkScalar lengthSqd = SkPointPriv::LengthSqd(vec); |
caryclark | d3d1a98 | 2014-12-08 04:57:38 -0800 | [diff] [blame] | 2290 | if (!SkScalarIsFinite(lengthSqd)) { |
| 2291 | fIsFinite = false; |
caryclark | e8c5666 | 2015-07-14 11:19:26 -0700 | [diff] [blame] | 2292 | } else if (lengthSqd) { |
caryclark | b421650 | 2015-03-02 13:02:34 -0800 | [diff] [blame] | 2293 | fPriorPt = fLastPt; |
commit-bot@chromium.org | f91aaec | 2013-11-01 15:24:55 +0000 | [diff] [blame] | 2294 | fLastPt = fCurrPt; |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2295 | fCurrPt = pt; |
| 2296 | if (++fPtCount == 2) { |
commit-bot@chromium.org | 8be07bb | 2014-05-22 14:58:53 +0000 | [diff] [blame] | 2297 | fFirstVec = fLastVec = vec; |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2298 | } else { |
| 2299 | SkASSERT(fPtCount > 2); |
| 2300 | this->addVec(vec); |
| 2301 | } |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 2302 | |
reed@google.com | 85b6e39 | 2011-05-15 20:25:17 +0000 | [diff] [blame] | 2303 | int sx = sign(vec.fX); |
| 2304 | int sy = sign(vec.fY); |
| 2305 | fDx += (sx != fSx); |
| 2306 | fDy += (sy != fSy); |
| 2307 | fSx = sx; |
| 2308 | fSy = sy; |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 2309 | |
reed@google.com | 85b6e39 | 2011-05-15 20:25:17 +0000 | [diff] [blame] | 2310 | if (fDx > 3 || fDy > 3) { |
| 2311 | fConvexity = SkPath::kConcave_Convexity; |
| 2312 | } |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2313 | } |
| 2314 | } |
| 2315 | } |
| 2316 | |
| 2317 | void close() { |
| 2318 | if (fPtCount > 2) { |
| 2319 | this->addVec(fFirstVec); |
| 2320 | } |
| 2321 | } |
| 2322 | |
caryclark | b421650 | 2015-03-02 13:02:34 -0800 | [diff] [blame] | 2323 | DirChange directionChange(const SkVector& curVec) { |
| 2324 | SkScalar cross = SkPoint::CrossProduct(fLastVec, curVec); |
| 2325 | |
| 2326 | SkScalar smallest = SkTMin(fCurrPt.fX, SkTMin(fCurrPt.fY, SkTMin(fLastPt.fX, fLastPt.fY))); |
| 2327 | SkScalar largest = SkTMax(fCurrPt.fX, SkTMax(fCurrPt.fY, SkTMax(fLastPt.fX, fLastPt.fY))); |
| 2328 | largest = SkTMax(largest, -smallest); |
| 2329 | |
| 2330 | if (!almost_equal(largest, largest + cross)) { |
| 2331 | int sign = SkScalarSignAsInt(cross); |
| 2332 | if (sign) { |
| 2333 | return (1 == sign) ? kRight_DirChange : kLeft_DirChange; |
| 2334 | } |
| 2335 | } |
| 2336 | |
| 2337 | if (cross) { |
| 2338 | double dLastVecX = SkScalarToDouble(fLastPt.fX) - SkScalarToDouble(fPriorPt.fX); |
| 2339 | double dLastVecY = SkScalarToDouble(fLastPt.fY) - SkScalarToDouble(fPriorPt.fY); |
| 2340 | double dCurrVecX = SkScalarToDouble(fCurrPt.fX) - SkScalarToDouble(fLastPt.fX); |
| 2341 | double dCurrVecY = SkScalarToDouble(fCurrPt.fY) - SkScalarToDouble(fLastPt.fY); |
| 2342 | double dCross = dLastVecX * dCurrVecY - dLastVecY * dCurrVecX; |
| 2343 | if (!approximately_zero_when_compared_to(dCross, SkScalarToDouble(largest))) { |
| 2344 | int sign = SkScalarSignAsInt(SkDoubleToScalar(dCross)); |
| 2345 | if (sign) { |
| 2346 | return (1 == sign) ? kRight_DirChange : kLeft_DirChange; |
| 2347 | } |
| 2348 | } |
| 2349 | } |
| 2350 | |
Cary Clark | df429f3 | 2017-11-08 11:44:31 -0500 | [diff] [blame] | 2351 | if (!SkScalarNearlyZero(SkPointPriv::LengthSqd(fLastVec), |
| 2352 | SK_ScalarNearlyZero*SK_ScalarNearlyZero) && |
| 2353 | !SkScalarNearlyZero(SkPointPriv::LengthSqd(curVec), |
| 2354 | SK_ScalarNearlyZero*SK_ScalarNearlyZero) && |
caryclark | b421650 | 2015-03-02 13:02:34 -0800 | [diff] [blame] | 2355 | fLastVec.dot(curVec) < 0.0f) { |
| 2356 | return kBackwards_DirChange; |
| 2357 | } |
| 2358 | |
| 2359 | return kStraight_DirChange; |
| 2360 | } |
| 2361 | |
Cary Clark | c8323aa | 2017-08-25 08:04:43 -0400 | [diff] [blame] | 2362 | bool hasBackwards() const { |
| 2363 | return fBackwards; |
| 2364 | } |
caryclark | b421650 | 2015-03-02 13:02:34 -0800 | [diff] [blame] | 2365 | |
caryclark | d3d1a98 | 2014-12-08 04:57:38 -0800 | [diff] [blame] | 2366 | bool isFinite() const { |
| 2367 | return fIsFinite; |
| 2368 | } |
| 2369 | |
caryclark | 5ccef57 | 2015-03-02 10:07:56 -0800 | [diff] [blame] | 2370 | void setCurve(bool isCurve) { |
| 2371 | fIsCurve = isCurve; |
| 2372 | } |
| 2373 | |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2374 | private: |
| 2375 | void addVec(const SkVector& vec) { |
| 2376 | SkASSERT(vec.fX || vec.fY); |
caryclark | b421650 | 2015-03-02 13:02:34 -0800 | [diff] [blame] | 2377 | DirChange dir = this->directionChange(vec); |
robertphillips | c506e30 | 2014-09-16 09:43:31 -0700 | [diff] [blame] | 2378 | switch (dir) { |
| 2379 | case kLeft_DirChange: // fall through |
| 2380 | case kRight_DirChange: |
| 2381 | if (kInvalid_DirChange == fExpectedDir) { |
| 2382 | fExpectedDir = dir; |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 2383 | fFirstDirection = (kRight_DirChange == dir) ? SkPathPriv::kCW_FirstDirection |
| 2384 | : SkPathPriv::kCCW_FirstDirection; |
robertphillips | c506e30 | 2014-09-16 09:43:31 -0700 | [diff] [blame] | 2385 | } else if (dir != fExpectedDir) { |
| 2386 | fConvexity = SkPath::kConcave_Convexity; |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 2387 | fFirstDirection = SkPathPriv::kUnknown_FirstDirection; |
robertphillips | c506e30 | 2014-09-16 09:43:31 -0700 | [diff] [blame] | 2388 | } |
| 2389 | fLastVec = vec; |
| 2390 | break; |
| 2391 | case kStraight_DirChange: |
| 2392 | break; |
| 2393 | case kBackwards_DirChange: |
caryclark | 5ccef57 | 2015-03-02 10:07:56 -0800 | [diff] [blame] | 2394 | if (fIsCurve) { |
liyuqian | bdabcc4 | 2016-11-03 11:40:19 -0700 | [diff] [blame] | 2395 | // If any of the subsequent dir is non-backward, it'll be concave. |
| 2396 | // Otherwise, it's still convex. |
| 2397 | fExpectedDir = dir; |
caryclark | 5ccef57 | 2015-03-02 10:07:56 -0800 | [diff] [blame] | 2398 | } |
robertphillips | c506e30 | 2014-09-16 09:43:31 -0700 | [diff] [blame] | 2399 | fLastVec = vec; |
Cary Clark | c8323aa | 2017-08-25 08:04:43 -0400 | [diff] [blame] | 2400 | fBackwards = true; |
robertphillips | c506e30 | 2014-09-16 09:43:31 -0700 | [diff] [blame] | 2401 | break; |
| 2402 | case kInvalid_DirChange: |
Ben Wagner | b4aab9a | 2017-08-16 10:53:04 -0400 | [diff] [blame] | 2403 | SK_ABORT("Use of invalid direction change flag"); |
robertphillips | c506e30 | 2014-09-16 09:43:31 -0700 | [diff] [blame] | 2404 | break; |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2405 | } |
| 2406 | } |
| 2407 | |
caryclark | b421650 | 2015-03-02 13:02:34 -0800 | [diff] [blame] | 2408 | SkPoint fPriorPt; |
commit-bot@chromium.org | f91aaec | 2013-11-01 15:24:55 +0000 | [diff] [blame] | 2409 | SkPoint fLastPt; |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2410 | SkPoint fCurrPt; |
commit-bot@chromium.org | 8be07bb | 2014-05-22 14:58:53 +0000 | [diff] [blame] | 2411 | // fLastVec does not necessarily start at fLastPt. We only advance it when the cross product |
| 2412 | // value with the current vec is deemed to be of a significant value. |
| 2413 | SkVector fLastVec, fFirstVec; |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2414 | int fPtCount; // non-degenerate points |
robertphillips | c506e30 | 2014-09-16 09:43:31 -0700 | [diff] [blame] | 2415 | DirChange fExpectedDir; |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2416 | SkPath::Convexity fConvexity; |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 2417 | SkPathPriv::FirstDirection fFirstDirection; |
reed@google.com | 0b7b982 | 2011-05-16 12:29:27 +0000 | [diff] [blame] | 2418 | int fDx, fDy, fSx, fSy; |
caryclark | d3d1a98 | 2014-12-08 04:57:38 -0800 | [diff] [blame] | 2419 | bool fIsFinite; |
caryclark | 5ccef57 | 2015-03-02 10:07:56 -0800 | [diff] [blame] | 2420 | bool fIsCurve; |
Cary Clark | c8323aa | 2017-08-25 08:04:43 -0400 | [diff] [blame] | 2421 | bool fBackwards; |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2422 | }; |
| 2423 | |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 2424 | SkPath::Convexity SkPath::internalGetConvexity() const { |
Yuqian Li | 46b0812 | 2018-04-25 16:40:25 -0400 | [diff] [blame] | 2425 | // Sometimes we think we need to calculate convexity but another thread already did. |
| 2426 | for (auto c = (Convexity)fConvexity; c != kUnknown_Convexity; ) { |
| 2427 | return c; |
| 2428 | } |
| 2429 | |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2430 | SkPoint pts[4]; |
| 2431 | SkPath::Verb verb; |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 2432 | SkPath::Iter iter(*this, true); |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2433 | |
| 2434 | int contourCount = 0; |
| 2435 | int count; |
| 2436 | Convexicator state; |
| 2437 | |
caryclark | d3d1a98 | 2014-12-08 04:57:38 -0800 | [diff] [blame] | 2438 | if (!isFinite()) { |
| 2439 | return kUnknown_Convexity; |
| 2440 | } |
Brian Osman | 205a126 | 2017-09-18 13:13:48 +0000 | [diff] [blame] | 2441 | while ((verb = iter.next(pts, false, false)) != SkPath::kDone_Verb) { |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2442 | switch (verb) { |
| 2443 | case kMove_Verb: |
| 2444 | if (++contourCount > 1) { |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 2445 | fConvexity = kConcave_Convexity; |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2446 | return kConcave_Convexity; |
| 2447 | } |
| 2448 | pts[1] = pts[0]; |
caryclark | 5ccef57 | 2015-03-02 10:07:56 -0800 | [diff] [blame] | 2449 | // fall through |
| 2450 | case kLine_Verb: |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2451 | count = 1; |
caryclark | 5ccef57 | 2015-03-02 10:07:56 -0800 | [diff] [blame] | 2452 | state.setCurve(false); |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2453 | break; |
caryclark | 5ccef57 | 2015-03-02 10:07:56 -0800 | [diff] [blame] | 2454 | case kQuad_Verb: |
| 2455 | // fall through |
| 2456 | case kConic_Verb: |
| 2457 | // fall through |
| 2458 | case kCubic_Verb: |
| 2459 | count = 2 + (kCubic_Verb == verb); |
| 2460 | // As an additional enhancement, this could set curve true only |
| 2461 | // if the curve is nonlinear |
| 2462 | state.setCurve(true); |
| 2463 | break; |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2464 | case kClose_Verb: |
caryclark | 5ccef57 | 2015-03-02 10:07:56 -0800 | [diff] [blame] | 2465 | state.setCurve(false); |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2466 | state.close(); |
| 2467 | count = 0; |
| 2468 | break; |
| 2469 | default: |
tomhudson@google.com | 0c00f21 | 2011-12-28 14:59:50 +0000 | [diff] [blame] | 2470 | SkDEBUGFAIL("bad verb"); |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 2471 | fConvexity = kConcave_Convexity; |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2472 | return kConcave_Convexity; |
| 2473 | } |
| 2474 | |
| 2475 | for (int i = 1; i <= count; i++) { |
| 2476 | state.addPt(pts[i]); |
| 2477 | } |
| 2478 | // early exit |
caryclark | d3d1a98 | 2014-12-08 04:57:38 -0800 | [diff] [blame] | 2479 | if (!state.isFinite()) { |
| 2480 | return kUnknown_Convexity; |
| 2481 | } |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2482 | if (kConcave_Convexity == state.getConvexity()) { |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 2483 | fConvexity = kConcave_Convexity; |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2484 | return kConcave_Convexity; |
| 2485 | } |
| 2486 | } |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 2487 | fConvexity = state.getConvexity(); |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 2488 | if (kConvex_Convexity == fConvexity && SkPathPriv::kUnknown_FirstDirection == fFirstDirection) { |
Cary Clark | c8323aa | 2017-08-25 08:04:43 -0400 | [diff] [blame] | 2489 | if (SkPathPriv::kUnknown_FirstDirection == state.getFirstDirection() && |
| 2490 | !this->getBounds().isEmpty() && !state.hasBackwards()) { |
| 2491 | fConvexity = Convexity::kConcave_Convexity; |
| 2492 | } else { |
| 2493 | fFirstDirection = state.getFirstDirection(); |
| 2494 | } |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 2495 | } |
| 2496 | return static_cast<Convexity>(fConvexity); |
reed@google.com | 04863fa | 2011-05-15 04:08:24 +0000 | [diff] [blame] | 2497 | } |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2498 | |
| 2499 | /////////////////////////////////////////////////////////////////////////////// |
| 2500 | |
| 2501 | class ContourIter { |
| 2502 | public: |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 2503 | ContourIter(const SkPathRef& pathRef); |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2504 | |
| 2505 | bool done() const { return fDone; } |
| 2506 | // if !done() then these may be called |
| 2507 | int count() const { return fCurrPtCount; } |
| 2508 | const SkPoint* pts() const { return fCurrPt; } |
| 2509 | void next(); |
| 2510 | |
| 2511 | private: |
| 2512 | int fCurrPtCount; |
| 2513 | const SkPoint* fCurrPt; |
| 2514 | const uint8_t* fCurrVerb; |
| 2515 | const uint8_t* fStopVerbs; |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 2516 | const SkScalar* fCurrConicWeight; |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2517 | bool fDone; |
reed@google.com | d1ab932 | 2012-01-10 18:40:03 +0000 | [diff] [blame] | 2518 | SkDEBUGCODE(int fContourCounter;) |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2519 | }; |
| 2520 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 2521 | ContourIter::ContourIter(const SkPathRef& pathRef) { |
| 2522 | fStopVerbs = pathRef.verbsMemBegin(); |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2523 | fDone = false; |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 2524 | fCurrPt = pathRef.points(); |
| 2525 | fCurrVerb = pathRef.verbs(); |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 2526 | fCurrConicWeight = pathRef.conicWeights(); |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2527 | fCurrPtCount = 0; |
reed@google.com | d1ab932 | 2012-01-10 18:40:03 +0000 | [diff] [blame] | 2528 | SkDEBUGCODE(fContourCounter = 0;) |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2529 | this->next(); |
| 2530 | } |
| 2531 | |
| 2532 | void ContourIter::next() { |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 2533 | if (fCurrVerb <= fStopVerbs) { |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2534 | fDone = true; |
| 2535 | } |
| 2536 | if (fDone) { |
| 2537 | return; |
| 2538 | } |
| 2539 | |
| 2540 | // skip pts of prev contour |
| 2541 | fCurrPt += fCurrPtCount; |
| 2542 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 2543 | SkASSERT(SkPath::kMove_Verb == fCurrVerb[~0]); |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2544 | int ptCount = 1; // moveTo |
| 2545 | const uint8_t* verbs = fCurrVerb; |
| 2546 | |
bsalomon@google.com | 1dfe88e | 2012-10-03 13:46:20 +0000 | [diff] [blame] | 2547 | for (--verbs; verbs > fStopVerbs; --verbs) { |
| 2548 | switch (verbs[~0]) { |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2549 | case SkPath::kMove_Verb: |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2550 | goto CONTOUR_END; |
| 2551 | case SkPath::kLine_Verb: |
| 2552 | ptCount += 1; |
| 2553 | break; |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 2554 | case SkPath::kConic_Verb: |
| 2555 | fCurrConicWeight += 1; |
| 2556 | // fall-through |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2557 | case SkPath::kQuad_Verb: |
| 2558 | ptCount += 2; |
| 2559 | break; |
| 2560 | case SkPath::kCubic_Verb: |
| 2561 | ptCount += 3; |
| 2562 | break; |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 2563 | case SkPath::kClose_Verb: |
| 2564 | break; |
| 2565 | default: |
mtklein@google.com | 330313a | 2013-08-22 15:37:26 +0000 | [diff] [blame] | 2566 | SkDEBUGFAIL("unexpected verb"); |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2567 | break; |
| 2568 | } |
| 2569 | } |
| 2570 | CONTOUR_END: |
| 2571 | fCurrPtCount = ptCount; |
| 2572 | fCurrVerb = verbs; |
reed@google.com | d1ab932 | 2012-01-10 18:40:03 +0000 | [diff] [blame] | 2573 | SkDEBUGCODE(++fContourCounter;) |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2574 | } |
| 2575 | |
bsalomon@google.com | f0ed80a | 2012-02-17 13:38:26 +0000 | [diff] [blame] | 2576 | // returns cross product of (p1 - p0) and (p2 - p0) |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2577 | static SkScalar cross_prod(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2) { |
bsalomon@google.com | f0ed80a | 2012-02-17 13:38:26 +0000 | [diff] [blame] | 2578 | SkScalar cross = SkPoint::CrossProduct(p1 - p0, p2 - p0); |
| 2579 | // We may get 0 when the above subtracts underflow. We expect this to be |
| 2580 | // very rare and lazily promote to double. |
| 2581 | if (0 == cross) { |
| 2582 | double p0x = SkScalarToDouble(p0.fX); |
| 2583 | double p0y = SkScalarToDouble(p0.fY); |
| 2584 | |
| 2585 | double p1x = SkScalarToDouble(p1.fX); |
| 2586 | double p1y = SkScalarToDouble(p1.fY); |
| 2587 | |
| 2588 | double p2x = SkScalarToDouble(p2.fX); |
| 2589 | double p2y = SkScalarToDouble(p2.fY); |
| 2590 | |
| 2591 | cross = SkDoubleToScalar((p1x - p0x) * (p2y - p0y) - |
| 2592 | (p1y - p0y) * (p2x - p0x)); |
| 2593 | |
| 2594 | } |
| 2595 | return cross; |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2596 | } |
| 2597 | |
reed@google.com | c1ea60a | 2012-01-31 15:15:36 +0000 | [diff] [blame] | 2598 | // Returns the first pt with the maximum Y coordinate |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2599 | static int find_max_y(const SkPoint pts[], int count) { |
| 2600 | SkASSERT(count > 0); |
| 2601 | SkScalar max = pts[0].fY; |
reed@google.com | c1ea60a | 2012-01-31 15:15:36 +0000 | [diff] [blame] | 2602 | int firstIndex = 0; |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2603 | for (int i = 1; i < count; ++i) { |
reed@google.com | c1ea60a | 2012-01-31 15:15:36 +0000 | [diff] [blame] | 2604 | SkScalar y = pts[i].fY; |
| 2605 | if (y > max) { |
| 2606 | max = y; |
| 2607 | firstIndex = i; |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2608 | } |
| 2609 | } |
reed@google.com | c1ea60a | 2012-01-31 15:15:36 +0000 | [diff] [blame] | 2610 | return firstIndex; |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2611 | } |
| 2612 | |
reed@google.com | cabaf1d | 2012-01-11 21:03:05 +0000 | [diff] [blame] | 2613 | static int find_diff_pt(const SkPoint pts[], int index, int n, int inc) { |
| 2614 | int i = index; |
| 2615 | for (;;) { |
| 2616 | i = (i + inc) % n; |
| 2617 | if (i == index) { // we wrapped around, so abort |
| 2618 | break; |
| 2619 | } |
| 2620 | if (pts[index] != pts[i]) { // found a different point, success! |
| 2621 | break; |
| 2622 | } |
| 2623 | } |
| 2624 | return i; |
| 2625 | } |
| 2626 | |
reed@google.com | c1ea60a | 2012-01-31 15:15:36 +0000 | [diff] [blame] | 2627 | /** |
| 2628 | * Starting at index, and moving forward (incrementing), find the xmin and |
| 2629 | * xmax of the contiguous points that have the same Y. |
| 2630 | */ |
| 2631 | static int find_min_max_x_at_y(const SkPoint pts[], int index, int n, |
| 2632 | int* maxIndexPtr) { |
| 2633 | const SkScalar y = pts[index].fY; |
| 2634 | SkScalar min = pts[index].fX; |
| 2635 | SkScalar max = min; |
| 2636 | int minIndex = index; |
| 2637 | int maxIndex = index; |
| 2638 | for (int i = index + 1; i < n; ++i) { |
| 2639 | if (pts[i].fY != y) { |
| 2640 | break; |
| 2641 | } |
| 2642 | SkScalar x = pts[i].fX; |
| 2643 | if (x < min) { |
| 2644 | min = x; |
| 2645 | minIndex = i; |
| 2646 | } else if (x > max) { |
| 2647 | max = x; |
| 2648 | maxIndex = i; |
| 2649 | } |
| 2650 | } |
| 2651 | *maxIndexPtr = maxIndex; |
| 2652 | return minIndex; |
| 2653 | } |
| 2654 | |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 2655 | static void crossToDir(SkScalar cross, SkPathPriv::FirstDirection* dir) { |
| 2656 | *dir = cross > 0 ? SkPathPriv::kCW_FirstDirection : SkPathPriv::kCCW_FirstDirection; |
bsalomon@google.com | 4eefe61 | 2012-07-10 18:28:12 +0000 | [diff] [blame] | 2657 | } |
| 2658 | |
reed@google.com | ac8543f | 2012-01-30 20:51:25 +0000 | [diff] [blame] | 2659 | /* |
| 2660 | * We loop through all contours, and keep the computed cross-product of the |
| 2661 | * contour that contained the global y-max. If we just look at the first |
| 2662 | * contour, we may find one that is wound the opposite way (correctly) since |
| 2663 | * it is the interior of a hole (e.g. 'o'). Thus we must find the contour |
| 2664 | * that is outer most (or at least has the global y-max) before we can consider |
| 2665 | * its cross product. |
| 2666 | */ |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 2667 | bool SkPathPriv::CheapComputeFirstDirection(const SkPath& path, FirstDirection* dir) { |
herb | 9f4dbca | 2015-09-28 11:05:47 -0700 | [diff] [blame] | 2668 | if (kUnknown_FirstDirection != path.fFirstDirection.load()) { |
| 2669 | *dir = static_cast<FirstDirection>(path.fFirstDirection.load()); |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 2670 | return true; |
| 2671 | } |
commit-bot@chromium.org | a1a097e | 2013-11-14 16:53:22 +0000 | [diff] [blame] | 2672 | |
| 2673 | // don't want to pay the cost for computing this if it |
| 2674 | // is unknown, so we don't call isConvex() |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 2675 | if (SkPath::kConvex_Convexity == path.getConvexityOrUnknown()) { |
| 2676 | SkASSERT(kUnknown_FirstDirection == path.fFirstDirection); |
herb | 9f4dbca | 2015-09-28 11:05:47 -0700 | [diff] [blame] | 2677 | *dir = static_cast<FirstDirection>(path.fFirstDirection.load()); |
commit-bot@chromium.org | a1a097e | 2013-11-14 16:53:22 +0000 | [diff] [blame] | 2678 | return false; |
| 2679 | } |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2680 | |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 2681 | ContourIter iter(*path.fPathRef.get()); |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2682 | |
reed@google.com | ac8543f | 2012-01-30 20:51:25 +0000 | [diff] [blame] | 2683 | // initialize with our logical y-min |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 2684 | SkScalar ymax = path.getBounds().fTop; |
reed@google.com | ac8543f | 2012-01-30 20:51:25 +0000 | [diff] [blame] | 2685 | SkScalar ymaxCross = 0; |
| 2686 | |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2687 | for (; !iter.done(); iter.next()) { |
| 2688 | int n = iter.count(); |
reed@google.com | cabaf1d | 2012-01-11 21:03:05 +0000 | [diff] [blame] | 2689 | if (n < 3) { |
| 2690 | continue; |
| 2691 | } |
djsollen@google.com | e63793a | 2012-03-21 15:39:03 +0000 | [diff] [blame] | 2692 | |
reed@google.com | cabaf1d | 2012-01-11 21:03:05 +0000 | [diff] [blame] | 2693 | const SkPoint* pts = iter.pts(); |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2694 | SkScalar cross = 0; |
commit-bot@chromium.org | a1a097e | 2013-11-14 16:53:22 +0000 | [diff] [blame] | 2695 | int index = find_max_y(pts, n); |
| 2696 | if (pts[index].fY < ymax) { |
| 2697 | continue; |
| 2698 | } |
| 2699 | |
| 2700 | // If there is more than 1 distinct point at the y-max, we take the |
| 2701 | // x-min and x-max of them and just subtract to compute the dir. |
| 2702 | if (pts[(index + 1) % n].fY == pts[index].fY) { |
| 2703 | int maxIndex; |
| 2704 | int minIndex = find_min_max_x_at_y(pts, index, n, &maxIndex); |
| 2705 | if (minIndex == maxIndex) { |
| 2706 | goto TRY_CROSSPROD; |
bsalomon@google.com | 4eefe61 | 2012-07-10 18:28:12 +0000 | [diff] [blame] | 2707 | } |
commit-bot@chromium.org | a1a097e | 2013-11-14 16:53:22 +0000 | [diff] [blame] | 2708 | SkASSERT(pts[minIndex].fY == pts[index].fY); |
| 2709 | SkASSERT(pts[maxIndex].fY == pts[index].fY); |
| 2710 | SkASSERT(pts[minIndex].fX <= pts[maxIndex].fX); |
| 2711 | // we just subtract the indices, and let that auto-convert to |
| 2712 | // SkScalar, since we just want - or + to signal the direction. |
| 2713 | cross = minIndex - maxIndex; |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2714 | } else { |
commit-bot@chromium.org | a1a097e | 2013-11-14 16:53:22 +0000 | [diff] [blame] | 2715 | TRY_CROSSPROD: |
| 2716 | // Find a next and prev index to use for the cross-product test, |
| 2717 | // but we try to find pts that form non-zero vectors from pts[index] |
| 2718 | // |
| 2719 | // Its possible that we can't find two non-degenerate vectors, so |
| 2720 | // we have to guard our search (e.g. all the pts could be in the |
| 2721 | // same place). |
| 2722 | |
| 2723 | // we pass n - 1 instead of -1 so we don't foul up % operator by |
| 2724 | // passing it a negative LH argument. |
| 2725 | int prev = find_diff_pt(pts, index, n, n - 1); |
| 2726 | if (prev == index) { |
| 2727 | // completely degenerate, skip to next contour |
reed@google.com | ac8543f | 2012-01-30 20:51:25 +0000 | [diff] [blame] | 2728 | continue; |
| 2729 | } |
commit-bot@chromium.org | a1a097e | 2013-11-14 16:53:22 +0000 | [diff] [blame] | 2730 | int next = find_diff_pt(pts, index, n, 1); |
| 2731 | SkASSERT(next != index); |
| 2732 | cross = cross_prod(pts[prev], pts[index], pts[next]); |
| 2733 | // if we get a zero and the points are horizontal, then we look at the spread in |
| 2734 | // x-direction. We really should continue to walk away from the degeneracy until |
| 2735 | // there is a divergence. |
| 2736 | if (0 == cross && pts[prev].fY == pts[index].fY && pts[next].fY == pts[index].fY) { |
| 2737 | // construct the subtract so we get the correct Direction below |
| 2738 | cross = pts[index].fX - pts[next].fX; |
reed@google.com | 188bfcf | 2012-01-17 18:26:38 +0000 | [diff] [blame] | 2739 | } |
commit-bot@chromium.org | a1a097e | 2013-11-14 16:53:22 +0000 | [diff] [blame] | 2740 | } |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 2741 | |
commit-bot@chromium.org | a1a097e | 2013-11-14 16:53:22 +0000 | [diff] [blame] | 2742 | if (cross) { |
| 2743 | // record our best guess so far |
| 2744 | ymax = pts[index].fY; |
| 2745 | ymaxCross = cross; |
reed@google.com | 69a9943 | 2012-01-10 18:00:10 +0000 | [diff] [blame] | 2746 | } |
| 2747 | } |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 2748 | if (ymaxCross) { |
| 2749 | crossToDir(ymaxCross, dir); |
reed | 026beb5 | 2015-06-10 14:23:15 -0700 | [diff] [blame] | 2750 | path.fFirstDirection = *dir; |
bsalomon@google.com | 30c174b | 2012-11-13 14:36:42 +0000 | [diff] [blame] | 2751 | return true; |
| 2752 | } else { |
| 2753 | return false; |
| 2754 | } |
reed@google.com | ac8543f | 2012-01-30 20:51:25 +0000 | [diff] [blame] | 2755 | } |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2756 | |
| 2757 | /////////////////////////////////////////////////////////////////////////////// |
| 2758 | |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2759 | static bool between(SkScalar a, SkScalar b, SkScalar c) { |
| 2760 | SkASSERT(((a <= b && b <= c) || (a >= b && b >= c)) == ((a - b) * (c - b) <= 0) |
| 2761 | || (SkScalarNearlyZero(a) && SkScalarNearlyZero(b) && SkScalarNearlyZero(c))); |
| 2762 | return (a - b) * (c - b) <= 0; |
| 2763 | } |
| 2764 | |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2765 | static SkScalar eval_cubic_pts(SkScalar c0, SkScalar c1, SkScalar c2, SkScalar c3, |
| 2766 | SkScalar t) { |
| 2767 | SkScalar A = c3 + 3*(c1 - c2) - c0; |
| 2768 | SkScalar B = 3*(c2 - c1 - c1 + c0); |
| 2769 | SkScalar C = 3*(c1 - c0); |
| 2770 | SkScalar D = c0; |
Mike Reed | a99b6ce | 2017-02-04 11:04:26 -0500 | [diff] [blame] | 2771 | return poly_eval(A, B, C, D, t); |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2772 | } |
| 2773 | |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2774 | template <size_t N> static void find_minmax(const SkPoint pts[], |
| 2775 | SkScalar* minPtr, SkScalar* maxPtr) { |
| 2776 | SkScalar min, max; |
| 2777 | min = max = pts[0].fX; |
| 2778 | for (size_t i = 1; i < N; ++i) { |
| 2779 | min = SkMinScalar(min, pts[i].fX); |
| 2780 | max = SkMaxScalar(max, pts[i].fX); |
| 2781 | } |
| 2782 | *minPtr = min; |
| 2783 | *maxPtr = max; |
| 2784 | } |
| 2785 | |
caryclark | 9cb5d75 | 2015-12-18 04:35:24 -0800 | [diff] [blame] | 2786 | static bool checkOnCurve(SkScalar x, SkScalar y, const SkPoint& start, const SkPoint& end) { |
| 2787 | if (start.fY == end.fY) { |
| 2788 | return between(start.fX, x, end.fX) && x != end.fX; |
| 2789 | } else { |
| 2790 | return x == start.fX && y == start.fY; |
| 2791 | } |
| 2792 | } |
| 2793 | |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2794 | static int winding_mono_cubic(const SkPoint pts[], SkScalar x, SkScalar y, int* onCurveCount) { |
caryclark | 9cb5d75 | 2015-12-18 04:35:24 -0800 | [diff] [blame] | 2795 | SkScalar y0 = pts[0].fY; |
| 2796 | SkScalar y3 = pts[3].fY; |
| 2797 | |
| 2798 | int dir = 1; |
| 2799 | if (y0 > y3) { |
| 2800 | SkTSwap(y0, y3); |
| 2801 | dir = -1; |
| 2802 | } |
| 2803 | if (y < y0 || y > y3) { |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2804 | return 0; |
| 2805 | } |
caryclark | 9cb5d75 | 2015-12-18 04:35:24 -0800 | [diff] [blame] | 2806 | if (checkOnCurve(x, y, pts[0], pts[3])) { |
| 2807 | *onCurveCount += 1; |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2808 | return 0; |
| 2809 | } |
caryclark | 9cb5d75 | 2015-12-18 04:35:24 -0800 | [diff] [blame] | 2810 | if (y == y3) { |
| 2811 | return 0; |
| 2812 | } |
| 2813 | |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2814 | // quickreject or quickaccept |
| 2815 | SkScalar min, max; |
| 2816 | find_minmax<4>(pts, &min, &max); |
| 2817 | if (x < min) { |
| 2818 | return 0; |
| 2819 | } |
| 2820 | if (x > max) { |
| 2821 | return dir; |
| 2822 | } |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 2823 | |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2824 | // compute the actual x(t) value |
commit-bot@chromium.org | a1a097e | 2013-11-14 16:53:22 +0000 | [diff] [blame] | 2825 | SkScalar t; |
mbarbella | 276e633 | 2016-05-31 14:44:01 -0700 | [diff] [blame] | 2826 | if (!SkCubicClipper::ChopMonoAtY(pts, y, &t)) { |
mbarbella | 99600d0 | 2016-06-01 15:39:47 -0700 | [diff] [blame] | 2827 | return 0; |
mbarbella | 276e633 | 2016-05-31 14:44:01 -0700 | [diff] [blame] | 2828 | } |
commit-bot@chromium.org | a1a097e | 2013-11-14 16:53:22 +0000 | [diff] [blame] | 2829 | SkScalar xt = eval_cubic_pts(pts[0].fX, pts[1].fX, pts[2].fX, pts[3].fX, t); |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2830 | if (SkScalarNearlyEqual(xt, x)) { |
| 2831 | if (x != pts[3].fX || y != pts[3].fY) { // don't test end points; they're start points |
| 2832 | *onCurveCount += 1; |
caryclark | 9cb5d75 | 2015-12-18 04:35:24 -0800 | [diff] [blame] | 2833 | return 0; |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2834 | } |
| 2835 | } |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2836 | return xt < x ? dir : 0; |
| 2837 | } |
| 2838 | |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2839 | static int winding_cubic(const SkPoint pts[], SkScalar x, SkScalar y, int* onCurveCount) { |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2840 | SkPoint dst[10]; |
| 2841 | int n = SkChopCubicAtYExtrema(pts, dst); |
| 2842 | int w = 0; |
| 2843 | for (int i = 0; i <= n; ++i) { |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2844 | w += winding_mono_cubic(&dst[i * 3], x, y, onCurveCount); |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2845 | } |
| 2846 | return w; |
| 2847 | } |
| 2848 | |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2849 | static double conic_eval_numerator(const SkScalar src[], SkScalar w, SkScalar t) { |
| 2850 | SkASSERT(src); |
| 2851 | SkASSERT(t >= 0 && t <= 1); |
| 2852 | SkScalar src2w = src[2] * w; |
| 2853 | SkScalar C = src[0]; |
| 2854 | SkScalar A = src[4] - 2 * src2w + C; |
| 2855 | SkScalar B = 2 * (src2w - C); |
Mike Reed | a99b6ce | 2017-02-04 11:04:26 -0500 | [diff] [blame] | 2856 | return poly_eval(A, B, C, t); |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2857 | } |
| 2858 | |
| 2859 | |
| 2860 | static double conic_eval_denominator(SkScalar w, SkScalar t) { |
| 2861 | SkScalar B = 2 * (w - 1); |
| 2862 | SkScalar C = 1; |
| 2863 | SkScalar A = -B; |
Mike Reed | a99b6ce | 2017-02-04 11:04:26 -0500 | [diff] [blame] | 2864 | return poly_eval(A, B, C, t); |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2865 | } |
| 2866 | |
| 2867 | static int winding_mono_conic(const SkConic& conic, SkScalar x, SkScalar y, int* onCurveCount) { |
| 2868 | const SkPoint* pts = conic.fPts; |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2869 | SkScalar y0 = pts[0].fY; |
| 2870 | SkScalar y2 = pts[2].fY; |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 2871 | |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2872 | int dir = 1; |
| 2873 | if (y0 > y2) { |
| 2874 | SkTSwap(y0, y2); |
| 2875 | dir = -1; |
| 2876 | } |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2877 | if (y < y0 || y > y2) { |
| 2878 | return 0; |
| 2879 | } |
caryclark | 9cb5d75 | 2015-12-18 04:35:24 -0800 | [diff] [blame] | 2880 | if (checkOnCurve(x, y, pts[0], pts[2])) { |
| 2881 | *onCurveCount += 1; |
| 2882 | return 0; |
| 2883 | } |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2884 | if (y == y2) { |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2885 | return 0; |
| 2886 | } |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 2887 | |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2888 | SkScalar roots[2]; |
| 2889 | SkScalar A = pts[2].fY; |
| 2890 | SkScalar B = pts[1].fY * conic.fW - y * conic.fW + y; |
| 2891 | SkScalar C = pts[0].fY; |
| 2892 | A += C - 2 * B; // A = a + c - 2*(b*w - yCept*w + yCept) |
| 2893 | B -= C; // B = b*w - w * yCept + yCept - a |
| 2894 | C -= y; |
| 2895 | int n = SkFindUnitQuadRoots(A, 2 * B, C, roots); |
| 2896 | SkASSERT(n <= 1); |
| 2897 | SkScalar xt; |
| 2898 | if (0 == n) { |
caryclark | 9cb5d75 | 2015-12-18 04:35:24 -0800 | [diff] [blame] | 2899 | // zero roots are returned only when y0 == y |
| 2900 | // Need [0] if dir == 1 |
| 2901 | // and [2] if dir == -1 |
| 2902 | xt = pts[1 - dir].fX; |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2903 | } else { |
| 2904 | SkScalar t = roots[0]; |
| 2905 | xt = conic_eval_numerator(&pts[0].fX, conic.fW, t) / conic_eval_denominator(conic.fW, t); |
| 2906 | } |
| 2907 | if (SkScalarNearlyEqual(xt, x)) { |
| 2908 | if (x != pts[2].fX || y != pts[2].fY) { // don't test end points; they're start points |
| 2909 | *onCurveCount += 1; |
caryclark | 9cb5d75 | 2015-12-18 04:35:24 -0800 | [diff] [blame] | 2910 | return 0; |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2911 | } |
| 2912 | } |
| 2913 | return xt < x ? dir : 0; |
| 2914 | } |
| 2915 | |
| 2916 | static bool is_mono_quad(SkScalar y0, SkScalar y1, SkScalar y2) { |
| 2917 | // return SkScalarSignAsInt(y0 - y1) + SkScalarSignAsInt(y1 - y2) != 0; |
| 2918 | if (y0 == y1) { |
| 2919 | return true; |
| 2920 | } |
| 2921 | if (y0 < y1) { |
| 2922 | return y1 <= y2; |
| 2923 | } else { |
| 2924 | return y1 >= y2; |
| 2925 | } |
| 2926 | } |
| 2927 | |
| 2928 | static int winding_conic(const SkPoint pts[], SkScalar x, SkScalar y, SkScalar weight, |
| 2929 | int* onCurveCount) { |
| 2930 | SkConic conic(pts, weight); |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2931 | SkConic chopped[2]; |
caryclark | 1e1e509 | 2016-01-06 08:27:44 -0800 | [diff] [blame] | 2932 | // If the data points are very large, the conic may not be monotonic but may also |
| 2933 | // fail to chop. Then, the chopper does not split the original conic in two. |
caryclark | e114dd6 | 2016-01-06 08:15:44 -0800 | [diff] [blame] | 2934 | bool isMono = is_mono_quad(pts[0].fY, pts[1].fY, pts[2].fY) || !conic.chopAtYExtrema(chopped); |
| 2935 | int w = winding_mono_conic(isMono ? conic : chopped[0], x, y, onCurveCount); |
| 2936 | if (!isMono) { |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2937 | w += winding_mono_conic(chopped[1], x, y, onCurveCount); |
| 2938 | } |
| 2939 | return w; |
| 2940 | } |
| 2941 | |
| 2942 | static int winding_mono_quad(const SkPoint pts[], SkScalar x, SkScalar y, int* onCurveCount) { |
| 2943 | SkScalar y0 = pts[0].fY; |
| 2944 | SkScalar y2 = pts[2].fY; |
| 2945 | |
| 2946 | int dir = 1; |
| 2947 | if (y0 > y2) { |
| 2948 | SkTSwap(y0, y2); |
| 2949 | dir = -1; |
| 2950 | } |
| 2951 | if (y < y0 || y > y2) { |
| 2952 | return 0; |
| 2953 | } |
caryclark | 9cb5d75 | 2015-12-18 04:35:24 -0800 | [diff] [blame] | 2954 | if (checkOnCurve(x, y, pts[0], pts[2])) { |
| 2955 | *onCurveCount += 1; |
| 2956 | return 0; |
| 2957 | } |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2958 | if (y == y2) { |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2959 | return 0; |
| 2960 | } |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2961 | // bounds check on X (not required. is it faster?) |
| 2962 | #if 0 |
| 2963 | if (pts[0].fX > x && pts[1].fX > x && pts[2].fX > x) { |
| 2964 | return 0; |
| 2965 | } |
| 2966 | #endif |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 2967 | |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2968 | SkScalar roots[2]; |
| 2969 | int n = SkFindUnitQuadRoots(pts[0].fY - 2 * pts[1].fY + pts[2].fY, |
| 2970 | 2 * (pts[1].fY - pts[0].fY), |
| 2971 | pts[0].fY - y, |
| 2972 | roots); |
| 2973 | SkASSERT(n <= 1); |
| 2974 | SkScalar xt; |
| 2975 | if (0 == n) { |
caryclark | 9cb5d75 | 2015-12-18 04:35:24 -0800 | [diff] [blame] | 2976 | // zero roots are returned only when y0 == y |
| 2977 | // Need [0] if dir == 1 |
| 2978 | // and [2] if dir == -1 |
| 2979 | xt = pts[1 - dir].fX; |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2980 | } else { |
| 2981 | SkScalar t = roots[0]; |
| 2982 | SkScalar C = pts[0].fX; |
| 2983 | SkScalar A = pts[2].fX - 2 * pts[1].fX + C; |
| 2984 | SkScalar B = 2 * (pts[1].fX - C); |
Mike Reed | a99b6ce | 2017-02-04 11:04:26 -0500 | [diff] [blame] | 2985 | xt = poly_eval(A, B, C, t); |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2986 | } |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2987 | if (SkScalarNearlyEqual(xt, x)) { |
| 2988 | if (x != pts[2].fX || y != pts[2].fY) { // don't test end points; they're start points |
| 2989 | *onCurveCount += 1; |
caryclark | 9cb5d75 | 2015-12-18 04:35:24 -0800 | [diff] [blame] | 2990 | return 0; |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2991 | } |
| 2992 | } |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2993 | return xt < x ? dir : 0; |
| 2994 | } |
| 2995 | |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 2996 | static int winding_quad(const SkPoint pts[], SkScalar x, SkScalar y, int* onCurveCount) { |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 2997 | SkPoint dst[5]; |
| 2998 | int n = 0; |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 2999 | |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3000 | if (!is_mono_quad(pts[0].fY, pts[1].fY, pts[2].fY)) { |
| 3001 | n = SkChopQuadAtYExtrema(pts, dst); |
| 3002 | pts = dst; |
| 3003 | } |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3004 | int w = winding_mono_quad(pts, x, y, onCurveCount); |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3005 | if (n > 0) { |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3006 | w += winding_mono_quad(&pts[2], x, y, onCurveCount); |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3007 | } |
| 3008 | return w; |
| 3009 | } |
| 3010 | |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3011 | static int winding_line(const SkPoint pts[], SkScalar x, SkScalar y, int* onCurveCount) { |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3012 | SkScalar x0 = pts[0].fX; |
| 3013 | SkScalar y0 = pts[0].fY; |
| 3014 | SkScalar x1 = pts[1].fX; |
| 3015 | SkScalar y1 = pts[1].fY; |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 3016 | |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3017 | SkScalar dy = y1 - y0; |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 3018 | |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3019 | int dir = 1; |
| 3020 | if (y0 > y1) { |
| 3021 | SkTSwap(y0, y1); |
| 3022 | dir = -1; |
| 3023 | } |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3024 | if (y < y0 || y > y1) { |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3025 | return 0; |
| 3026 | } |
caryclark | 9cb5d75 | 2015-12-18 04:35:24 -0800 | [diff] [blame] | 3027 | if (checkOnCurve(x, y, pts[0], pts[1])) { |
| 3028 | *onCurveCount += 1; |
| 3029 | return 0; |
| 3030 | } |
| 3031 | if (y == y1) { |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3032 | return 0; |
| 3033 | } |
Mike Reed | a99b6ce | 2017-02-04 11:04:26 -0500 | [diff] [blame] | 3034 | SkScalar cross = (x1 - x0) * (y - pts[0].fY) - dy * (x - x0); |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 3035 | |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3036 | if (!cross) { |
fs | c91065d | 2015-12-17 09:03:27 -0800 | [diff] [blame] | 3037 | // zero cross means the point is on the line, and since the case where |
| 3038 | // y of the query point is at the end point is handled above, we can be |
| 3039 | // sure that we're on the line (excluding the end point) here |
caryclark | 9cb5d75 | 2015-12-18 04:35:24 -0800 | [diff] [blame] | 3040 | if (x != x1 || y != pts[1].fY) { |
| 3041 | *onCurveCount += 1; |
| 3042 | } |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3043 | dir = 0; |
| 3044 | } else if (SkScalarSignAsInt(cross) == dir) { |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3045 | dir = 0; |
| 3046 | } |
| 3047 | return dir; |
| 3048 | } |
| 3049 | |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3050 | static void tangent_cubic(const SkPoint pts[], SkScalar x, SkScalar y, |
| 3051 | SkTDArray<SkVector>* tangents) { |
| 3052 | if (!between(pts[0].fY, y, pts[1].fY) && !between(pts[1].fY, y, pts[2].fY) |
| 3053 | && !between(pts[2].fY, y, pts[3].fY)) { |
| 3054 | return; |
| 3055 | } |
| 3056 | if (!between(pts[0].fX, x, pts[1].fX) && !between(pts[1].fX, x, pts[2].fX) |
| 3057 | && !between(pts[2].fX, x, pts[3].fX)) { |
| 3058 | return; |
| 3059 | } |
| 3060 | SkPoint dst[10]; |
| 3061 | int n = SkChopCubicAtYExtrema(pts, dst); |
| 3062 | for (int i = 0; i <= n; ++i) { |
| 3063 | SkPoint* c = &dst[i * 3]; |
| 3064 | SkScalar t; |
mbarbella | 276e633 | 2016-05-31 14:44:01 -0700 | [diff] [blame] | 3065 | if (!SkCubicClipper::ChopMonoAtY(c, y, &t)) { |
mbarbella | 99600d0 | 2016-06-01 15:39:47 -0700 | [diff] [blame] | 3066 | continue; |
mbarbella | 276e633 | 2016-05-31 14:44:01 -0700 | [diff] [blame] | 3067 | } |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3068 | SkScalar xt = eval_cubic_pts(c[0].fX, c[1].fX, c[2].fX, c[3].fX, t); |
| 3069 | if (!SkScalarNearlyEqual(x, xt)) { |
| 3070 | continue; |
| 3071 | } |
| 3072 | SkVector tangent; |
| 3073 | SkEvalCubicAt(c, t, nullptr, &tangent, nullptr); |
| 3074 | tangents->push(tangent); |
| 3075 | } |
| 3076 | } |
| 3077 | |
| 3078 | static void tangent_conic(const SkPoint pts[], SkScalar x, SkScalar y, SkScalar w, |
| 3079 | SkTDArray<SkVector>* tangents) { |
| 3080 | if (!between(pts[0].fY, y, pts[1].fY) && !between(pts[1].fY, y, pts[2].fY)) { |
| 3081 | return; |
| 3082 | } |
| 3083 | if (!between(pts[0].fX, x, pts[1].fX) && !between(pts[1].fX, x, pts[2].fX)) { |
| 3084 | return; |
| 3085 | } |
| 3086 | SkScalar roots[2]; |
| 3087 | SkScalar A = pts[2].fY; |
| 3088 | SkScalar B = pts[1].fY * w - y * w + y; |
| 3089 | SkScalar C = pts[0].fY; |
| 3090 | A += C - 2 * B; // A = a + c - 2*(b*w - yCept*w + yCept) |
| 3091 | B -= C; // B = b*w - w * yCept + yCept - a |
| 3092 | C -= y; |
| 3093 | int n = SkFindUnitQuadRoots(A, 2 * B, C, roots); |
| 3094 | for (int index = 0; index < n; ++index) { |
| 3095 | SkScalar t = roots[index]; |
| 3096 | SkScalar xt = conic_eval_numerator(&pts[0].fX, w, t) / conic_eval_denominator(w, t); |
| 3097 | if (!SkScalarNearlyEqual(x, xt)) { |
| 3098 | continue; |
| 3099 | } |
| 3100 | SkConic conic(pts, w); |
| 3101 | tangents->push(conic.evalTangentAt(t)); |
| 3102 | } |
| 3103 | } |
| 3104 | |
| 3105 | static void tangent_quad(const SkPoint pts[], SkScalar x, SkScalar y, |
| 3106 | SkTDArray<SkVector>* tangents) { |
| 3107 | if (!between(pts[0].fY, y, pts[1].fY) && !between(pts[1].fY, y, pts[2].fY)) { |
| 3108 | return; |
| 3109 | } |
| 3110 | if (!between(pts[0].fX, x, pts[1].fX) && !between(pts[1].fX, x, pts[2].fX)) { |
| 3111 | return; |
| 3112 | } |
| 3113 | SkScalar roots[2]; |
| 3114 | int n = SkFindUnitQuadRoots(pts[0].fY - 2 * pts[1].fY + pts[2].fY, |
| 3115 | 2 * (pts[1].fY - pts[0].fY), |
| 3116 | pts[0].fY - y, |
| 3117 | roots); |
| 3118 | for (int index = 0; index < n; ++index) { |
| 3119 | SkScalar t = roots[index]; |
| 3120 | SkScalar C = pts[0].fX; |
| 3121 | SkScalar A = pts[2].fX - 2 * pts[1].fX + C; |
| 3122 | SkScalar B = 2 * (pts[1].fX - C); |
Mike Reed | a99b6ce | 2017-02-04 11:04:26 -0500 | [diff] [blame] | 3123 | SkScalar xt = poly_eval(A, B, C, t); |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3124 | if (!SkScalarNearlyEqual(x, xt)) { |
| 3125 | continue; |
| 3126 | } |
| 3127 | tangents->push(SkEvalQuadTangentAt(pts, t)); |
| 3128 | } |
| 3129 | } |
| 3130 | |
| 3131 | static void tangent_line(const SkPoint pts[], SkScalar x, SkScalar y, |
| 3132 | SkTDArray<SkVector>* tangents) { |
| 3133 | SkScalar y0 = pts[0].fY; |
| 3134 | SkScalar y1 = pts[1].fY; |
| 3135 | if (!between(y0, y, y1)) { |
| 3136 | return; |
| 3137 | } |
| 3138 | SkScalar x0 = pts[0].fX; |
| 3139 | SkScalar x1 = pts[1].fX; |
| 3140 | if (!between(x0, x, x1)) { |
| 3141 | return; |
| 3142 | } |
| 3143 | SkScalar dx = x1 - x0; |
| 3144 | SkScalar dy = y1 - y0; |
| 3145 | if (!SkScalarNearlyEqual((x - x0) * dy, dx * (y - y0))) { |
| 3146 | return; |
| 3147 | } |
| 3148 | SkVector v; |
| 3149 | v.set(dx, dy); |
| 3150 | tangents->push(v); |
| 3151 | } |
| 3152 | |
reed@google.com | 4db592c | 2013-10-30 17:39:43 +0000 | [diff] [blame] | 3153 | static bool contains_inclusive(const SkRect& r, SkScalar x, SkScalar y) { |
| 3154 | return r.fLeft <= x && x <= r.fRight && r.fTop <= y && y <= r.fBottom; |
| 3155 | } |
| 3156 | |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3157 | bool SkPath::contains(SkScalar x, SkScalar y) const { |
| 3158 | bool isInverse = this->isInverseFillType(); |
| 3159 | if (this->isEmpty()) { |
| 3160 | return isInverse; |
| 3161 | } |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 3162 | |
reed@google.com | 4db592c | 2013-10-30 17:39:43 +0000 | [diff] [blame] | 3163 | if (!contains_inclusive(this->getBounds(), x, y)) { |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3164 | return isInverse; |
| 3165 | } |
rmistry@google.com | fbfcd56 | 2012-08-23 18:09:54 +0000 | [diff] [blame] | 3166 | |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3167 | SkPath::Iter iter(*this, true); |
| 3168 | bool done = false; |
| 3169 | int w = 0; |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3170 | int onCurveCount = 0; |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3171 | do { |
| 3172 | SkPoint pts[4]; |
| 3173 | switch (iter.next(pts, false)) { |
| 3174 | case SkPath::kMove_Verb: |
| 3175 | case SkPath::kClose_Verb: |
| 3176 | break; |
| 3177 | case SkPath::kLine_Verb: |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3178 | w += winding_line(pts, x, y, &onCurveCount); |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3179 | break; |
| 3180 | case SkPath::kQuad_Verb: |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3181 | w += winding_quad(pts, x, y, &onCurveCount); |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3182 | break; |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 3183 | case SkPath::kConic_Verb: |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3184 | w += winding_conic(pts, x, y, iter.conicWeight(), &onCurveCount); |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 3185 | break; |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3186 | case SkPath::kCubic_Verb: |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3187 | w += winding_cubic(pts, x, y, &onCurveCount); |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3188 | break; |
| 3189 | case SkPath::kDone_Verb: |
| 3190 | done = true; |
| 3191 | break; |
reed@google.com | 277c3f8 | 2013-05-31 15:17:50 +0000 | [diff] [blame] | 3192 | } |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3193 | } while (!done); |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3194 | bool evenOddFill = SkPath::kEvenOdd_FillType == this->getFillType() |
| 3195 | || SkPath::kInverseEvenOdd_FillType == this->getFillType(); |
| 3196 | if (evenOddFill) { |
| 3197 | w &= 1; |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3198 | } |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3199 | if (w) { |
| 3200 | return !isInverse; |
| 3201 | } |
| 3202 | if (onCurveCount <= 1) { |
| 3203 | return SkToBool(onCurveCount) ^ isInverse; |
| 3204 | } |
| 3205 | if ((onCurveCount & 1) || evenOddFill) { |
| 3206 | return SkToBool(onCurveCount & 1) ^ isInverse; |
| 3207 | } |
halcanary | 9d524f2 | 2016-03-29 09:03:52 -0700 | [diff] [blame] | 3208 | // If the point touches an even number of curves, and the fill is winding, check for |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3209 | // coincidence. Count coincidence as places where the on curve points have identical tangents. |
| 3210 | iter.setPath(*this, true); |
caryclark | 9cb5d75 | 2015-12-18 04:35:24 -0800 | [diff] [blame] | 3211 | done = false; |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3212 | SkTDArray<SkVector> tangents; |
| 3213 | do { |
| 3214 | SkPoint pts[4]; |
| 3215 | int oldCount = tangents.count(); |
| 3216 | switch (iter.next(pts, false)) { |
| 3217 | case SkPath::kMove_Verb: |
| 3218 | case SkPath::kClose_Verb: |
| 3219 | break; |
| 3220 | case SkPath::kLine_Verb: |
| 3221 | tangent_line(pts, x, y, &tangents); |
| 3222 | break; |
| 3223 | case SkPath::kQuad_Verb: |
| 3224 | tangent_quad(pts, x, y, &tangents); |
| 3225 | break; |
| 3226 | case SkPath::kConic_Verb: |
| 3227 | tangent_conic(pts, x, y, iter.conicWeight(), &tangents); |
| 3228 | break; |
| 3229 | case SkPath::kCubic_Verb: |
| 3230 | tangent_cubic(pts, x, y, &tangents); |
| 3231 | break; |
| 3232 | case SkPath::kDone_Verb: |
| 3233 | done = true; |
| 3234 | break; |
| 3235 | } |
| 3236 | if (tangents.count() > oldCount) { |
| 3237 | int last = tangents.count() - 1; |
| 3238 | const SkVector& tangent = tangents[last]; |
Cary Clark | df429f3 | 2017-11-08 11:44:31 -0500 | [diff] [blame] | 3239 | if (SkScalarNearlyZero(SkPointPriv::LengthSqd(tangent))) { |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3240 | tangents.remove(last); |
| 3241 | } else { |
| 3242 | for (int index = 0; index < last; ++index) { |
| 3243 | const SkVector& test = tangents[index]; |
| 3244 | if (SkScalarNearlyZero(test.cross(tangent)) |
caryclark | 9cb5d75 | 2015-12-18 04:35:24 -0800 | [diff] [blame] | 3245 | && SkScalarSignAsInt(tangent.fX * test.fX) <= 0 |
| 3246 | && SkScalarSignAsInt(tangent.fY * test.fY) <= 0) { |
caryclark | 9aacd90 | 2015-12-14 08:38:09 -0800 | [diff] [blame] | 3247 | tangents.remove(last); |
| 3248 | tangents.removeShuffle(index); |
| 3249 | break; |
| 3250 | } |
| 3251 | } |
| 3252 | } |
| 3253 | } |
| 3254 | } while (!done); |
| 3255 | return SkToBool(tangents.count()) ^ isInverse; |
mike@reedtribe.org | bad1b2f | 2012-07-11 01:51:33 +0000 | [diff] [blame] | 3256 | } |
fmalita | aa0df4e | 2015-12-01 09:13:23 -0800 | [diff] [blame] | 3257 | |
| 3258 | int SkPath::ConvertConicToQuads(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2, |
| 3259 | SkScalar w, SkPoint pts[], int pow2) { |
| 3260 | const SkConic conic(p0, p1, p2, w); |
| 3261 | return conic.chopIntoQuadsPOW2(pts, pow2); |
| 3262 | } |
bsalomon | edc743a | 2016-06-01 09:42:31 -0700 | [diff] [blame] | 3263 | |
| 3264 | bool SkPathPriv::IsSimpleClosedRect(const SkPath& path, SkRect* rect, SkPath::Direction* direction, |
| 3265 | unsigned* start) { |
| 3266 | if (path.getSegmentMasks() != SkPath::kLine_SegmentMask) { |
| 3267 | return false; |
| 3268 | } |
| 3269 | SkPath::RawIter iter(path); |
| 3270 | SkPoint verbPts[4]; |
| 3271 | SkPath::Verb v; |
| 3272 | SkPoint rectPts[5]; |
| 3273 | int rectPtCnt = 0; |
| 3274 | while ((v = iter.next(verbPts)) != SkPath::kDone_Verb) { |
| 3275 | switch (v) { |
| 3276 | case SkPath::kMove_Verb: |
| 3277 | if (0 != rectPtCnt) { |
| 3278 | return false; |
| 3279 | } |
| 3280 | rectPts[0] = verbPts[0]; |
| 3281 | ++rectPtCnt; |
| 3282 | break; |
| 3283 | case SkPath::kLine_Verb: |
| 3284 | if (5 == rectPtCnt) { |
| 3285 | return false; |
| 3286 | } |
| 3287 | rectPts[rectPtCnt] = verbPts[1]; |
| 3288 | ++rectPtCnt; |
| 3289 | break; |
| 3290 | case SkPath::kClose_Verb: |
| 3291 | if (4 == rectPtCnt) { |
| 3292 | rectPts[4] = rectPts[0]; |
| 3293 | rectPtCnt = 5; |
| 3294 | } |
| 3295 | break; |
| 3296 | default: |
| 3297 | return false; |
| 3298 | } |
| 3299 | } |
| 3300 | if (rectPtCnt < 5) { |
| 3301 | return false; |
| 3302 | } |
| 3303 | if (rectPts[0] != rectPts[4]) { |
| 3304 | return false; |
| 3305 | } |
bsalomon | 057ae8a | 2016-07-24 05:37:26 -0700 | [diff] [blame] | 3306 | // Check for two cases of rectangles: pts 0 and 3 form a vertical edge or a horizontal edge ( |
| 3307 | // and pts 1 and 2 the opposite vertical or horizontal edge). |
| 3308 | bool vec03IsVertical; |
| 3309 | if (rectPts[0].fX == rectPts[3].fX && rectPts[1].fX == rectPts[2].fX && |
| 3310 | rectPts[0].fY == rectPts[1].fY && rectPts[3].fY == rectPts[2].fY) { |
| 3311 | // Make sure it has non-zero width and height |
| 3312 | if (rectPts[0].fX == rectPts[1].fX || rectPts[0].fY == rectPts[3].fY) { |
bsalomon | edc743a | 2016-06-01 09:42:31 -0700 | [diff] [blame] | 3313 | return false; |
| 3314 | } |
bsalomon | 057ae8a | 2016-07-24 05:37:26 -0700 | [diff] [blame] | 3315 | vec03IsVertical = true; |
| 3316 | } else if (rectPts[0].fY == rectPts[3].fY && rectPts[1].fY == rectPts[2].fY && |
| 3317 | rectPts[0].fX == rectPts[1].fX && rectPts[3].fX == rectPts[2].fX) { |
| 3318 | // Make sure it has non-zero width and height |
| 3319 | if (rectPts[0].fY == rectPts[1].fY || rectPts[0].fX == rectPts[3].fX) { |
| 3320 | return false; |
| 3321 | } |
| 3322 | vec03IsVertical = false; |
| 3323 | } else { |
bsalomon | edc743a | 2016-06-01 09:42:31 -0700 | [diff] [blame] | 3324 | return false; |
| 3325 | } |
bsalomon | 057ae8a | 2016-07-24 05:37:26 -0700 | [diff] [blame] | 3326 | // Set sortFlags so that it has the low bit set if pt index 0 is on right edge and second bit |
| 3327 | // set if it is on the bottom edge. |
| 3328 | unsigned sortFlags = |
| 3329 | ((rectPts[0].fX < rectPts[2].fX) ? 0b00 : 0b01) | |
| 3330 | ((rectPts[0].fY < rectPts[2].fY) ? 0b00 : 0b10); |
| 3331 | switch (sortFlags) { |
| 3332 | case 0b00: |
| 3333 | rect->set(rectPts[0].fX, rectPts[0].fY, rectPts[2].fX, rectPts[2].fY); |
| 3334 | *direction = vec03IsVertical ? SkPath::kCW_Direction : SkPath::kCCW_Direction; |
| 3335 | *start = 0; |
| 3336 | break; |
| 3337 | case 0b01: |
| 3338 | rect->set(rectPts[2].fX, rectPts[0].fY, rectPts[0].fX, rectPts[2].fY); |
| 3339 | *direction = vec03IsVertical ? SkPath::kCCW_Direction : SkPath::kCW_Direction; |
| 3340 | *start = 1; |
| 3341 | break; |
| 3342 | case 0b10: |
| 3343 | rect->set(rectPts[0].fX, rectPts[2].fY, rectPts[2].fX, rectPts[0].fY); |
| 3344 | *direction = vec03IsVertical ? SkPath::kCCW_Direction : SkPath::kCW_Direction; |
| 3345 | *start = 3; |
| 3346 | break; |
| 3347 | case 0b11: |
| 3348 | rect->set(rectPts[2].fX, rectPts[2].fY, rectPts[0].fX, rectPts[0].fY); |
| 3349 | *direction = vec03IsVertical ? SkPath::kCW_Direction : SkPath::kCCW_Direction; |
| 3350 | *start = 2; |
| 3351 | break; |
bsalomon | edc743a | 2016-06-01 09:42:31 -0700 | [diff] [blame] | 3352 | } |
bsalomon | edc743a | 2016-06-01 09:42:31 -0700 | [diff] [blame] | 3353 | return true; |
| 3354 | } |
bsalomon | 21af9ca | 2016-08-25 12:29:23 -0700 | [diff] [blame] | 3355 | |
Brian Salomon | e494940 | 2018-04-26 15:22:04 -0400 | [diff] [blame] | 3356 | bool SkPathPriv::DrawArcIsConvex(SkScalar sweepAngle, bool useCenter, bool isFillNoPathEffect) { |
| 3357 | if (isFillNoPathEffect && SkScalarAbs(sweepAngle) >= 360.f) { |
| 3358 | // This gets converted to an oval. |
| 3359 | return true; |
| 3360 | } |
| 3361 | if (useCenter) { |
| 3362 | // This is a pie wedge. It's convex if the angle is <= 180. |
| 3363 | return SkScalarAbs(sweepAngle) <= 180.f; |
| 3364 | } |
| 3365 | // When the angle exceeds 360 this wraps back on top of itself. Otherwise it is a circle clipped |
| 3366 | // to a secant, i.e. convex. |
| 3367 | return SkScalarAbs(sweepAngle) <= 360.f; |
| 3368 | } |
| 3369 | |
bsalomon | 21af9ca | 2016-08-25 12:29:23 -0700 | [diff] [blame] | 3370 | void SkPathPriv::CreateDrawArcPath(SkPath* path, const SkRect& oval, SkScalar startAngle, |
| 3371 | SkScalar sweepAngle, bool useCenter, bool isFillNoPathEffect) { |
| 3372 | SkASSERT(!oval.isEmpty()); |
| 3373 | SkASSERT(sweepAngle); |
| 3374 | |
| 3375 | path->reset(); |
| 3376 | path->setIsVolatile(true); |
| 3377 | path->setFillType(SkPath::kWinding_FillType); |
| 3378 | if (isFillNoPathEffect && SkScalarAbs(sweepAngle) >= 360.f) { |
| 3379 | path->addOval(oval); |
Brian Salomon | e494940 | 2018-04-26 15:22:04 -0400 | [diff] [blame] | 3380 | SkASSERT(path->isConvex() && DrawArcIsConvex(sweepAngle, false, isFillNoPathEffect)); |
bsalomon | 21af9ca | 2016-08-25 12:29:23 -0700 | [diff] [blame] | 3381 | return; |
| 3382 | } |
| 3383 | if (useCenter) { |
| 3384 | path->moveTo(oval.centerX(), oval.centerY()); |
| 3385 | } |
Brian Salomon | e494940 | 2018-04-26 15:22:04 -0400 | [diff] [blame] | 3386 | auto firstDir = |
| 3387 | sweepAngle > 0 ? SkPathPriv::kCW_FirstDirection : SkPathPriv::kCCW_FirstDirection; |
| 3388 | bool convex = DrawArcIsConvex(sweepAngle, useCenter, isFillNoPathEffect); |
bsalomon | 21af9ca | 2016-08-25 12:29:23 -0700 | [diff] [blame] | 3389 | // Arc to mods at 360 and drawArc is not supposed to. |
| 3390 | bool forceMoveTo = !useCenter; |
| 3391 | while (sweepAngle <= -360.f) { |
| 3392 | path->arcTo(oval, startAngle, -180.f, forceMoveTo); |
| 3393 | startAngle -= 180.f; |
| 3394 | path->arcTo(oval, startAngle, -180.f, false); |
| 3395 | startAngle -= 180.f; |
| 3396 | forceMoveTo = false; |
| 3397 | sweepAngle += 360.f; |
| 3398 | } |
| 3399 | while (sweepAngle >= 360.f) { |
| 3400 | path->arcTo(oval, startAngle, 180.f, forceMoveTo); |
| 3401 | startAngle += 180.f; |
| 3402 | path->arcTo(oval, startAngle, 180.f, false); |
| 3403 | startAngle += 180.f; |
| 3404 | forceMoveTo = false; |
| 3405 | sweepAngle -= 360.f; |
| 3406 | } |
| 3407 | path->arcTo(oval, startAngle, sweepAngle, forceMoveTo); |
| 3408 | if (useCenter) { |
| 3409 | path->close(); |
| 3410 | } |
Brian Salomon | e494940 | 2018-04-26 15:22:04 -0400 | [diff] [blame] | 3411 | path->setConvexity(convex ? SkPath::kConvex_Convexity : SkPath::kConcave_Convexity); |
| 3412 | path->fFirstDirection.store(firstDir); |
bsalomon | 21af9ca | 2016-08-25 12:29:23 -0700 | [diff] [blame] | 3413 | } |
Mike Reed | 0d7dac8 | 2017-02-02 17:45:56 -0800 | [diff] [blame] | 3414 | |
| 3415 | /////////////////////////////////////////////////////////////////////////////////////////////////// |
| 3416 | #include "SkNx.h" |
| 3417 | |
| 3418 | static int compute_quad_extremas(const SkPoint src[3], SkPoint extremas[3]) { |
| 3419 | SkScalar ts[2]; |
| 3420 | int n = SkFindQuadExtrema(src[0].fX, src[1].fX, src[2].fX, ts); |
| 3421 | n += SkFindQuadExtrema(src[0].fY, src[1].fY, src[2].fY, &ts[n]); |
| 3422 | SkASSERT(n >= 0 && n <= 2); |
| 3423 | for (int i = 0; i < n; ++i) { |
| 3424 | extremas[i] = SkEvalQuadAt(src, ts[i]); |
| 3425 | } |
| 3426 | extremas[n] = src[2]; |
| 3427 | return n + 1; |
| 3428 | } |
| 3429 | |
| 3430 | static int compute_conic_extremas(const SkPoint src[3], SkScalar w, SkPoint extremas[3]) { |
| 3431 | SkConic conic(src[0], src[1], src[2], w); |
| 3432 | SkScalar ts[2]; |
| 3433 | int n = conic.findXExtrema(ts); |
| 3434 | n += conic.findYExtrema(&ts[n]); |
| 3435 | SkASSERT(n >= 0 && n <= 2); |
| 3436 | for (int i = 0; i < n; ++i) { |
| 3437 | extremas[i] = conic.evalAt(ts[i]); |
| 3438 | } |
| 3439 | extremas[n] = src[2]; |
| 3440 | return n + 1; |
| 3441 | } |
| 3442 | |
| 3443 | static int compute_cubic_extremas(const SkPoint src[3], SkPoint extremas[5]) { |
| 3444 | SkScalar ts[4]; |
| 3445 | int n = SkFindCubicExtrema(src[0].fX, src[1].fX, src[2].fX, src[3].fX, ts); |
| 3446 | n += SkFindCubicExtrema(src[0].fY, src[1].fY, src[2].fY, src[3].fY, &ts[n]); |
| 3447 | SkASSERT(n >= 0 && n <= 4); |
| 3448 | for (int i = 0; i < n; ++i) { |
| 3449 | SkEvalCubicAt(src, ts[i], &extremas[i], nullptr, nullptr); |
| 3450 | } |
| 3451 | extremas[n] = src[3]; |
| 3452 | return n + 1; |
| 3453 | } |
| 3454 | |
Mike Reed | 8d3196b | 2017-02-03 11:34:13 -0500 | [diff] [blame] | 3455 | SkRect SkPath::computeTightBounds() const { |
| 3456 | if (0 == this->countVerbs()) { |
| 3457 | return SkRect::MakeEmpty(); |
Mike Reed | 0d7dac8 | 2017-02-02 17:45:56 -0800 | [diff] [blame] | 3458 | } |
| 3459 | |
Mike Reed | 8d3196b | 2017-02-03 11:34:13 -0500 | [diff] [blame] | 3460 | if (this->getSegmentMasks() == SkPath::kLine_SegmentMask) { |
| 3461 | return this->getBounds(); |
Mike Reed | 0d7dac8 | 2017-02-02 17:45:56 -0800 | [diff] [blame] | 3462 | } |
Mike Klein | b9b5de5 | 2017-09-27 13:26:22 -0400 | [diff] [blame] | 3463 | |
Mike Reed | 0d7dac8 | 2017-02-02 17:45:56 -0800 | [diff] [blame] | 3464 | SkPoint extremas[5]; // big enough to hold worst-case curve type (cubic) extremas + 1 |
| 3465 | SkPoint pts[4]; |
Mike Reed | 8d3196b | 2017-02-03 11:34:13 -0500 | [diff] [blame] | 3466 | SkPath::RawIter iter(*this); |
Mike Reed | 0d7dac8 | 2017-02-02 17:45:56 -0800 | [diff] [blame] | 3467 | |
| 3468 | // initial with the first MoveTo, so we don't have to check inside the switch |
| 3469 | Sk2s min, max; |
Mike Reed | 8d3196b | 2017-02-03 11:34:13 -0500 | [diff] [blame] | 3470 | min = max = from_point(this->getPoint(0)); |
Mike Reed | 0d7dac8 | 2017-02-02 17:45:56 -0800 | [diff] [blame] | 3471 | for (;;) { |
| 3472 | int count = 0; |
| 3473 | switch (iter.next(pts)) { |
| 3474 | case SkPath::kMove_Verb: |
| 3475 | extremas[0] = pts[0]; |
| 3476 | count = 1; |
| 3477 | break; |
| 3478 | case SkPath::kLine_Verb: |
| 3479 | extremas[0] = pts[1]; |
| 3480 | count = 1; |
| 3481 | break; |
| 3482 | case SkPath::kQuad_Verb: |
| 3483 | count = compute_quad_extremas(pts, extremas); |
| 3484 | break; |
| 3485 | case SkPath::kConic_Verb: |
| 3486 | count = compute_conic_extremas(pts, iter.conicWeight(), extremas); |
| 3487 | break; |
| 3488 | case SkPath::kCubic_Verb: |
| 3489 | count = compute_cubic_extremas(pts, extremas); |
| 3490 | break; |
| 3491 | case SkPath::kClose_Verb: |
| 3492 | break; |
| 3493 | case SkPath::kDone_Verb: |
| 3494 | goto DONE; |
| 3495 | } |
| 3496 | for (int i = 0; i < count; ++i) { |
| 3497 | Sk2s tmp = from_point(extremas[i]); |
| 3498 | min = Sk2s::Min(min, tmp); |
| 3499 | max = Sk2s::Max(max, tmp); |
| 3500 | } |
| 3501 | } |
| 3502 | DONE: |
Mike Reed | 8d3196b | 2017-02-03 11:34:13 -0500 | [diff] [blame] | 3503 | SkRect bounds; |
| 3504 | min.store((SkPoint*)&bounds.fLeft); |
| 3505 | max.store((SkPoint*)&bounds.fRight); |
| 3506 | return bounds; |
Mike Reed | 0d7dac8 | 2017-02-02 17:45:56 -0800 | [diff] [blame] | 3507 | } |
Cary Clark | df429f3 | 2017-11-08 11:44:31 -0500 | [diff] [blame] | 3508 | |
| 3509 | bool SkPath::IsLineDegenerate(const SkPoint& p1, const SkPoint& p2, bool exact) { |
| 3510 | return exact ? p1 == p2 : SkPointPriv::EqualsWithinTolerance(p1, p2); |
| 3511 | } |
| 3512 | |
| 3513 | bool SkPath::IsQuadDegenerate(const SkPoint& p1, const SkPoint& p2, |
| 3514 | const SkPoint& p3, bool exact) { |
| 3515 | return exact ? p1 == p2 && p2 == p3 : SkPointPriv::EqualsWithinTolerance(p1, p2) && |
| 3516 | SkPointPriv::EqualsWithinTolerance(p2, p3); |
| 3517 | } |
| 3518 | |
| 3519 | bool SkPath::IsCubicDegenerate(const SkPoint& p1, const SkPoint& p2, |
| 3520 | const SkPoint& p3, const SkPoint& p4, bool exact) { |
| 3521 | return exact ? p1 == p2 && p2 == p3 && p3 == p4 : |
| 3522 | SkPointPriv::EqualsWithinTolerance(p1, p2) && |
| 3523 | SkPointPriv::EqualsWithinTolerance(p2, p3) && |
| 3524 | SkPointPriv::EqualsWithinTolerance(p3, p4); |
| 3525 | } |