blob: 5021aa7a553c9ddfa64f148b8e669035def57ace [file] [log] [blame]
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +00001/*
2 * Copyright 2012 Google Inc.
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
Mike Kleinc0bd9f92019-04-23 12:05:21 -05008#include "include/core/SkString.h"
9#include "include/core/SkTypes.h"
10#include "src/core/SkGeometry.h"
11#include "src/core/SkPathPriv.h"
12#include "src/core/SkPointPriv.h"
Greg Danielf91aeb22019-06-18 09:58:02 -040013#include "src/gpu/GrAuditTrail.h"
Mike Kleinc0bd9f92019-04-23 12:05:21 -050014#include "src/gpu/GrCaps.h"
15#include "src/gpu/GrDrawOpTest.h"
16#include "src/gpu/GrGeometryProcessor.h"
Mike Kleinc0bd9f92019-04-23 12:05:21 -050017#include "src/gpu/GrProcessor.h"
18#include "src/gpu/GrRenderTargetContext.h"
Mike Kleinc0bd9f92019-04-23 12:05:21 -050019#include "src/gpu/GrVertexWriter.h"
Michael Ludwig663afe52019-06-03 16:46:19 -040020#include "src/gpu/geometry/GrPathUtils.h"
21#include "src/gpu/geometry/GrShape.h"
Mike Kleinc0bd9f92019-04-23 12:05:21 -050022#include "src/gpu/glsl/GrGLSLFragmentShaderBuilder.h"
23#include "src/gpu/glsl/GrGLSLGeometryProcessor.h"
24#include "src/gpu/glsl/GrGLSLProgramDataManager.h"
25#include "src/gpu/glsl/GrGLSLUniformHandler.h"
26#include "src/gpu/glsl/GrGLSLVarying.h"
27#include "src/gpu/glsl/GrGLSLVertexGeoBuilder.h"
28#include "src/gpu/ops/GrAAConvexPathRenderer.h"
29#include "src/gpu/ops/GrMeshDrawOp.h"
30#include "src/gpu/ops/GrSimpleMeshDrawOpHelper.h"
commit-bot@chromium.org234d4fb2013-09-30 19:55:49 +000031
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +000032GrAAConvexPathRenderer::GrAAConvexPathRenderer() {
33}
34
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +000035struct Segment {
36 enum {
bsalomon@google.com9b1517e2012-03-05 17:58:34 +000037 // These enum values are assumed in member functions below.
38 kLine = 0,
39 kQuad = 1,
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +000040 } fType;
bsalomon@google.com9b1517e2012-03-05 17:58:34 +000041
bsalomon@google.com9aed1142012-01-30 14:28:39 +000042 // line uses one pt, quad uses 2 pts
commit-bot@chromium.org972f9cd2014-03-28 17:58:28 +000043 SkPoint fPts[2];
bsalomon@google.com9aed1142012-01-30 14:28:39 +000044 // normal to edge ending at each pt
commit-bot@chromium.org972f9cd2014-03-28 17:58:28 +000045 SkVector fNorms[2];
bsalomon@google.com9aed1142012-01-30 14:28:39 +000046 // is the corner where the previous segment meets this segment
47 // sharp. If so, fMid is a normalized bisector facing outward.
commit-bot@chromium.org972f9cd2014-03-28 17:58:28 +000048 SkVector fMid;
bsalomon@google.com9aed1142012-01-30 14:28:39 +000049
50 int countPoints() {
bsalomon@google.com9b1517e2012-03-05 17:58:34 +000051 GR_STATIC_ASSERT(0 == kLine && 1 == kQuad);
52 return fType + 1;
bsalomon@google.com9aed1142012-01-30 14:28:39 +000053 }
54 const SkPoint& endPt() const {
bsalomon@google.com9b1517e2012-03-05 17:58:34 +000055 GR_STATIC_ASSERT(0 == kLine && 1 == kQuad);
56 return fPts[fType];
Mike Kleinfc6c37b2016-09-27 09:34:10 -040057 }
bsalomon@google.com9aed1142012-01-30 14:28:39 +000058 const SkPoint& endNorm() const {
bsalomon@google.com9b1517e2012-03-05 17:58:34 +000059 GR_STATIC_ASSERT(0 == kLine && 1 == kQuad);
60 return fNorms[fType];
Mike Kleinfc6c37b2016-09-27 09:34:10 -040061 }
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +000062};
63
64typedef SkTArray<Segment, true> SegmentArray;
65
Greg Daniel8b09b962018-04-03 14:53:45 -040066static bool center_of_mass(const SegmentArray& segments, SkPoint* c) {
bsalomon@google.com81712882012-11-01 17:12:34 +000067 SkScalar area = 0;
vandebo@chromium.org6390c722012-03-28 21:03:22 +000068 SkPoint center = {0, 0};
bsalomon@google.com9aed1142012-01-30 14:28:39 +000069 int count = segments.count();
vandebo@chromium.org6390c722012-03-28 21:03:22 +000070 SkPoint p0 = {0, 0};
bsalomon@google.com5b56d9e2012-02-23 19:18:37 +000071 if (count > 2) {
72 // We translate the polygon so that the first point is at the origin.
73 // This avoids some precision issues with small area polygons far away
74 // from the origin.
75 p0 = segments[0].endPt();
76 SkPoint pi;
77 SkPoint pj;
bsalomon@google.coma51ab842012-07-10 19:53:34 +000078 // the first and last iteration of the below loop would compute
bsalomon@google.com5b56d9e2012-02-23 19:18:37 +000079 // zeros since the starting / ending point is (0,0). So instead we start
80 // at i=1 and make the last iteration i=count-2.
81 pj = segments[1].endPt() - p0;
82 for (int i = 1; i < count - 1; ++i) {
83 pi = pj;
robertphillips44c31282015-09-03 12:58:48 -070084 pj = segments[i + 1].endPt() - p0;
bsalomon@google.com5b56d9e2012-02-23 19:18:37 +000085
robertphillips44c31282015-09-03 12:58:48 -070086 SkScalar t = SkPoint::CrossProduct(pi, pj);
bsalomon@google.com5b56d9e2012-02-23 19:18:37 +000087 area += t;
88 center.fX += (pi.fX + pj.fX) * t;
89 center.fY += (pi.fY + pj.fY) * t;
bsalomon@google.com5b56d9e2012-02-23 19:18:37 +000090 }
bsalomon@google.com9aed1142012-01-30 14:28:39 +000091 }
robertphillips44c31282015-09-03 12:58:48 -070092
bsalomon@google.com278dc692012-02-15 16:52:51 +000093 // If the poly has no area then we instead return the average of
94 // its points.
bsalomon@google.com5b56d9e2012-02-23 19:18:37 +000095 if (SkScalarNearlyZero(area)) {
bsalomon@google.com278dc692012-02-15 16:52:51 +000096 SkPoint avg;
97 avg.set(0, 0);
98 for (int i = 0; i < count; ++i) {
99 const SkPoint& pt = segments[i].endPt();
100 avg.fX += pt.fX;
101 avg.fY += pt.fY;
102 }
103 SkScalar denom = SK_Scalar1 / count;
104 avg.scale(denom);
105 *c = avg;
106 } else {
107 area *= 3;
reed80ea19c2015-05-12 10:37:34 -0700108 area = SkScalarInvert(area);
robertphillips44c31282015-09-03 12:58:48 -0700109 center.scale(area);
bsalomon@google.com5b56d9e2012-02-23 19:18:37 +0000110 // undo the translate of p0 to the origin.
111 *c = center + p0;
bsalomon@google.com278dc692012-02-15 16:52:51 +0000112 }
Greg Daniel62473ad2018-04-03 15:44:18 -0400113 return !SkScalarIsNaN(c->fX) && !SkScalarIsNaN(c->fY) && c->isFinite();
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000114}
115
Greg Daniel8b09b962018-04-03 14:53:45 -0400116static bool compute_vectors(SegmentArray* segments,
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000117 SkPoint* fanPt,
reed026beb52015-06-10 14:23:15 -0700118 SkPathPriv::FirstDirection dir,
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000119 int* vCount,
120 int* iCount) {
Greg Daniel8b09b962018-04-03 14:53:45 -0400121 if (!center_of_mass(*segments, fanPt)) {
122 return false;
123 }
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000124 int count = segments->count();
125
bsalomon@google.com278dc692012-02-15 16:52:51 +0000126 // Make the normals point towards the outside
Cary Clarkdf429f32017-11-08 11:44:31 -0500127 SkPointPriv::Side normSide;
reed026beb52015-06-10 14:23:15 -0700128 if (dir == SkPathPriv::kCCW_FirstDirection) {
Cary Clarkdf429f32017-11-08 11:44:31 -0500129 normSide = SkPointPriv::kRight_Side;
bsalomon@google.com278dc692012-02-15 16:52:51 +0000130 } else {
Cary Clarkdf429f32017-11-08 11:44:31 -0500131 normSide = SkPointPriv::kLeft_Side;
bsalomon@google.com278dc692012-02-15 16:52:51 +0000132 }
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000133
Greg Danield5b45932018-06-07 13:15:10 -0400134 int64_t vCount64 = 0;
135 int64_t iCount64 = 0;
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000136 // compute normals at all points
137 for (int a = 0; a < count; ++a) {
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000138 Segment& sega = (*segments)[a];
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000139 int b = (a + 1) % count;
140 Segment& segb = (*segments)[b];
141
commit-bot@chromium.org972f9cd2014-03-28 17:58:28 +0000142 const SkPoint* prevPt = &sega.endPt();
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000143 int n = segb.countPoints();
144 for (int p = 0; p < n; ++p) {
145 segb.fNorms[p] = segb.fPts[p] - *prevPt;
146 segb.fNorms[p].normalize();
Brian Salomon0235c642018-08-31 12:04:18 -0400147 segb.fNorms[p] = SkPointPriv::MakeOrthog(segb.fNorms[p], normSide);
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000148 prevPt = &segb.fPts[p];
149 }
150 if (Segment::kLine == segb.fType) {
Greg Danield5b45932018-06-07 13:15:10 -0400151 vCount64 += 5;
152 iCount64 += 9;
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000153 } else {
Greg Danield5b45932018-06-07 13:15:10 -0400154 vCount64 += 6;
155 iCount64 += 12;
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000156 }
157 }
158
159 // compute mid-vectors where segments meet. TODO: Detect shallow corners
160 // and leave out the wedges and close gaps by stitching segments together.
161 for (int a = 0; a < count; ++a) {
162 const Segment& sega = (*segments)[a];
163 int b = (a + 1) % count;
164 Segment& segb = (*segments)[b];
165 segb.fMid = segb.fNorms[0] + sega.endNorm();
166 segb.fMid.normalize();
167 // corner wedges
Greg Danield5b45932018-06-07 13:15:10 -0400168 vCount64 += 4;
169 iCount64 += 6;
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000170 }
Greg Danield5b45932018-06-07 13:15:10 -0400171 if (vCount64 > SK_MaxS32 || iCount64 > SK_MaxS32) {
172 return false;
173 }
174 *vCount = vCount64;
175 *iCount = iCount64;
Greg Daniel8b09b962018-04-03 14:53:45 -0400176 return true;
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000177}
178
bsalomon@google.com9732f622012-01-31 15:19:21 +0000179struct DegenerateTestData {
180 DegenerateTestData() { fStage = kInitial; }
181 bool isDegenerate() const { return kNonDegenerate != fStage; }
182 enum {
183 kInitial,
184 kPoint,
185 kLine,
186 kNonDegenerate
187 } fStage;
commit-bot@chromium.org972f9cd2014-03-28 17:58:28 +0000188 SkPoint fFirstPoint;
189 SkVector fLineNormal;
bsalomon@google.com81712882012-11-01 17:12:34 +0000190 SkScalar fLineC;
bsalomon@google.com9732f622012-01-31 15:19:21 +0000191};
192
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000193static const SkScalar kClose = (SK_Scalar1 / 16);
Mike Reed8be952a2017-02-13 20:44:33 -0500194static const SkScalar kCloseSqd = kClose * kClose;
bsalomon@google.com9732f622012-01-31 15:19:21 +0000195
commit-bot@chromium.org972f9cd2014-03-28 17:58:28 +0000196static void update_degenerate_test(DegenerateTestData* data, const SkPoint& pt) {
bsalomon@google.com9732f622012-01-31 15:19:21 +0000197 switch (data->fStage) {
198 case DegenerateTestData::kInitial:
199 data->fFirstPoint = pt;
200 data->fStage = DegenerateTestData::kPoint;
201 break;
202 case DegenerateTestData::kPoint:
Cary Clarkdf429f32017-11-08 11:44:31 -0500203 if (SkPointPriv::DistanceToSqd(pt, data->fFirstPoint) > kCloseSqd) {
bsalomon@google.com9732f622012-01-31 15:19:21 +0000204 data->fLineNormal = pt - data->fFirstPoint;
205 data->fLineNormal.normalize();
Brian Salomon0235c642018-08-31 12:04:18 -0400206 data->fLineNormal = SkPointPriv::MakeOrthog(data->fLineNormal);
bsalomon@google.com9732f622012-01-31 15:19:21 +0000207 data->fLineC = -data->fLineNormal.dot(data->fFirstPoint);
208 data->fStage = DegenerateTestData::kLine;
209 }
210 break;
211 case DegenerateTestData::kLine:
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000212 if (SkScalarAbs(data->fLineNormal.dot(pt) + data->fLineC) > kClose) {
bsalomon@google.com9732f622012-01-31 15:19:21 +0000213 data->fStage = DegenerateTestData::kNonDegenerate;
214 }
215 case DegenerateTestData::kNonDegenerate:
216 break;
217 default:
Ben Wagnerb4aab9a2017-08-16 10:53:04 -0400218 SK_ABORT("Unexpected degenerate test stage.");
bsalomon@google.com9732f622012-01-31 15:19:21 +0000219 }
220}
221
reed026beb52015-06-10 14:23:15 -0700222static inline bool get_direction(const SkPath& path, const SkMatrix& m,
223 SkPathPriv::FirstDirection* dir) {
224 if (!SkPathPriv::CheapComputeFirstDirection(path, dir)) {
bsalomon@google.coma51ab842012-07-10 19:53:34 +0000225 return false;
226 }
bsalomon@google.comaf90f7f2012-03-05 20:50:10 +0000227 // check whether m reverses the orientation
tfarina@chromium.orgf6de4752013-08-17 00:02:59 +0000228 SkASSERT(!m.hasPerspective());
Mike Reed8be952a2017-02-13 20:44:33 -0500229 SkScalar det2x2 = m.get(SkMatrix::kMScaleX) * m.get(SkMatrix::kMScaleY) -
230 m.get(SkMatrix::kMSkewX) * m.get(SkMatrix::kMSkewY);
bsalomon@google.comaf90f7f2012-03-05 20:50:10 +0000231 if (det2x2 < 0) {
reed026beb52015-06-10 14:23:15 -0700232 *dir = SkPathPriv::OppositeFirstDirection(*dir);
bsalomon@google.comaf90f7f2012-03-05 20:50:10 +0000233 }
bsalomon@google.coma51ab842012-07-10 19:53:34 +0000234 return true;
bsalomon@google.comaf90f7f2012-03-05 20:50:10 +0000235}
236
commit-bot@chromium.org106655e2013-09-03 21:28:55 +0000237static inline void add_line_to_segment(const SkPoint& pt,
joshualitt27f398f2015-02-05 14:39:01 -0800238 SegmentArray* segments) {
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000239 segments->push_back();
240 segments->back().fType = Segment::kLine;
241 segments->back().fPts[0] = pt;
242}
243
commit-bot@chromium.org106655e2013-09-03 21:28:55 +0000244static inline void add_quad_segment(const SkPoint pts[3],
joshualitt27f398f2015-02-05 14:39:01 -0800245 SegmentArray* segments) {
Brian Salomon5f8a62b2019-03-29 13:55:32 -0400246 if (SkPointPriv::DistanceToLineSegmentBetweenSqd(pts[1], pts[0], pts[2]) < kCloseSqd) {
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000247 if (pts[0] != pts[2]) {
joshualitt27f398f2015-02-05 14:39:01 -0800248 add_line_to_segment(pts[2], segments);
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000249 }
250 } else {
251 segments->push_back();
252 segments->back().fType = Segment::kQuad;
253 segments->back().fPts[0] = pts[1];
254 segments->back().fPts[1] = pts[2];
255 }
256}
257
258static inline void add_cubic_segments(const SkPoint pts[4],
reed026beb52015-06-10 14:23:15 -0700259 SkPathPriv::FirstDirection dir,
joshualitt27f398f2015-02-05 14:39:01 -0800260 SegmentArray* segments) {
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000261 SkSTArray<15, SkPoint, true> quads;
bsalomon18fab302016-02-16 08:00:05 -0800262 GrPathUtils::convertCubicToQuadsConstrainToTangents(pts, SK_Scalar1, dir, &quads);
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000263 int count = quads.count();
264 for (int q = 0; q < count; q += 3) {
joshualitt27f398f2015-02-05 14:39:01 -0800265 add_quad_segment(&quads[q], segments);
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000266 }
267}
268
269static bool get_segments(const SkPath& path,
270 const SkMatrix& m,
271 SegmentArray* segments,
272 SkPoint* fanPt,
273 int* vCount,
joshualitt27f398f2015-02-05 14:39:01 -0800274 int* iCount) {
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000275 SkPath::Iter iter(path, true);
bsalomon@google.com30c174b2012-11-13 14:36:42 +0000276 // This renderer over-emphasizes very thin path regions. We use the distance
bsalomon@google.com5cc90d12012-01-17 16:28:34 +0000277 // to the path from the sample to compute coverage. Every pixel intersected
278 // by the path will be hit and the maximum distance is sqrt(2)/2. We don't
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000279 // notice that the sample may be close to a very thin area of the path and
bsalomon@google.com5cc90d12012-01-17 16:28:34 +0000280 // thus should be very light. This is particularly egregious for degenerate
281 // line paths. We detect paths that are very close to a line (zero area) and
282 // draw nothing.
bsalomon@google.com9732f622012-01-31 15:19:21 +0000283 DegenerateTestData degenerateData;
reed026beb52015-06-10 14:23:15 -0700284 SkPathPriv::FirstDirection dir;
bsalomon@google.coma51ab842012-07-10 19:53:34 +0000285 // get_direction can fail for some degenerate paths.
286 if (!get_direction(path, m, &dir)) {
287 return false;
288 }
bsalomon@google.com9732f622012-01-31 15:19:21 +0000289
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000290 for (;;) {
commit-bot@chromium.org972f9cd2014-03-28 17:58:28 +0000291 SkPoint pts[4];
Mike Reedba7e9a62019-08-16 13:30:34 -0400292 SkPath::Verb verb = iter.next(pts);
bsalomon@google.com94b284d2013-05-10 17:14:06 +0000293 switch (verb) {
294 case SkPath::kMove_Verb:
bsalomon@google.com1a38d552012-03-15 14:40:46 +0000295 m.mapPoints(pts, 1);
bsalomon@google.com9732f622012-01-31 15:19:21 +0000296 update_degenerate_test(&degenerateData, pts[0]);
297 break;
bsalomon@google.com94b284d2013-05-10 17:14:06 +0000298 case SkPath::kLine_Verb: {
Mike Reedba7e9a62019-08-16 13:30:34 -0400299 if (!SkPathPriv::AllPointsEq(pts, 2)) {
300 m.mapPoints(&pts[1], 1);
301 update_degenerate_test(&degenerateData, pts[1]);
302 add_line_to_segment(pts[1], segments);
303 }
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000304 break;
305 }
bsalomon@google.com94b284d2013-05-10 17:14:06 +0000306 case SkPath::kQuad_Verb:
Mike Reedba7e9a62019-08-16 13:30:34 -0400307 if (!SkPathPriv::AllPointsEq(pts, 3)) {
308 m.mapPoints(pts, 3);
309 update_degenerate_test(&degenerateData, pts[1]);
310 update_degenerate_test(&degenerateData, pts[2]);
311 add_quad_segment(pts, segments);
312 }
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000313 break;
egdanielaf18a092015-01-05 10:22:28 -0800314 case SkPath::kConic_Verb: {
Mike Reedba7e9a62019-08-16 13:30:34 -0400315 if (!SkPathPriv::AllPointsEq(pts, 3)) {
316 m.mapPoints(pts, 3);
317 SkScalar weight = iter.conicWeight();
318 SkAutoConicToQuads converter;
319 const SkPoint* quadPts = converter.computeQuads(pts, weight, 0.25f);
320 for (int i = 0; i < converter.countQuads(); ++i) {
321 update_degenerate_test(&degenerateData, quadPts[2*i + 1]);
322 update_degenerate_test(&degenerateData, quadPts[2*i + 2]);
323 add_quad_segment(quadPts + 2*i, segments);
324 }
egdanielaf18a092015-01-05 10:22:28 -0800325 }
326 break;
327 }
bsalomon@google.com94b284d2013-05-10 17:14:06 +0000328 case SkPath::kCubic_Verb: {
Mike Reedba7e9a62019-08-16 13:30:34 -0400329 if (!SkPathPriv::AllPointsEq(pts, 4)) {
330 m.mapPoints(pts, 4);
331 update_degenerate_test(&degenerateData, pts[1]);
332 update_degenerate_test(&degenerateData, pts[2]);
333 update_degenerate_test(&degenerateData, pts[3]);
334 add_cubic_segments(pts, dir, segments);
335 }
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000336 break;
Brian Salomon23356442018-11-30 15:33:19 -0500337 }
bsalomon@google.com94b284d2013-05-10 17:14:06 +0000338 case SkPath::kDone_Verb:
bsalomon@google.com9732f622012-01-31 15:19:21 +0000339 if (degenerateData.isDegenerate()) {
340 return false;
341 } else {
Greg Daniel8b09b962018-04-03 14:53:45 -0400342 return compute_vectors(segments, fanPt, dir, vCount, iCount);
bsalomon@google.com9732f622012-01-31 15:19:21 +0000343 }
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000344 default:
345 break;
346 }
347 }
348}
349
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000350struct Draw {
351 Draw() : fVertexCnt(0), fIndexCnt(0) {}
352 int fVertexCnt;
353 int fIndexCnt;
354};
355
356typedef SkTArray<Draw, true> DrawArray;
357
Brian Salomon60fb0b22017-06-15 17:09:36 -0400358static void create_vertices(const SegmentArray& segments,
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000359 const SkPoint& fanPt,
Brian Osman7f4735b2019-01-02 13:55:10 +0000360 const GrVertexColor& color,
Brian Salomon60fb0b22017-06-15 17:09:36 -0400361 DrawArray* draws,
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500362 GrVertexWriter& verts,
363 uint16_t* idxs,
364 size_t vertexStride) {
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000365 Draw* draw = &draws->push_back();
366 // alias just to make vert/index assignments easier to read.
367 int* v = &draw->fVertexCnt;
368 int* i = &draw->fIndexCnt;
Brian Osman7f4735b2019-01-02 13:55:10 +0000369 const size_t uvOffset = sizeof(SkPoint) + color.size();
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000370
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000371 int count = segments.count();
372 for (int a = 0; a < count; ++a) {
373 const Segment& sega = segments[a];
374 int b = (a + 1) % count;
375 const Segment& segb = segments[b];
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000376
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000377 // Check whether adding the verts for this segment to the current draw would cause index
378 // values to overflow.
379 int vCount = 4;
380 if (Segment::kLine == segb.fType) {
381 vCount += 5;
382 } else {
383 vCount += 6;
384 }
385 if (draw->fVertexCnt + vCount > (1 << 16)) {
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000386 idxs += *i;
387 draw = &draws->push_back();
388 v = &draw->fVertexCnt;
389 i = &draw->fIndexCnt;
390 }
391
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500392 const SkScalar negOneDists[2] = { -SK_Scalar1, -SK_Scalar1 };
393
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000394 // FIXME: These tris are inset in the 1 unit arc around the corner
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500395 SkPoint p0 = sega.endPt();
396 // Position, Color, UV, D0, D1
397 verts.write(p0, color, SkPoint{0, 0}, negOneDists);
398 verts.write(p0 + sega.endNorm(), color, SkPoint{0, -SK_Scalar1}, negOneDists);
399 verts.write(p0 + segb.fMid, color, SkPoint{0, -SK_Scalar1}, negOneDists);
400 verts.write(p0 + segb.fNorms[0], color, SkPoint{0, -SK_Scalar1}, negOneDists);
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000401
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000402 idxs[*i + 0] = *v + 0;
403 idxs[*i + 1] = *v + 2;
404 idxs[*i + 2] = *v + 1;
405 idxs[*i + 3] = *v + 0;
406 idxs[*i + 4] = *v + 3;
407 idxs[*i + 5] = *v + 2;
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000408
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000409 *v += 4;
410 *i += 6;
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000411
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000412 if (Segment::kLine == segb.fType) {
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000413 // we draw the line edge as a degenerate quad (u is 0, v is the
414 // signed distance to the edge)
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500415 SkPoint v1Pos = sega.endPt();
416 SkPoint v2Pos = segb.fPts[0];
417 SkScalar dist = SkPointPriv::DistanceToLineBetween(fanPt, v1Pos, v2Pos);
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000418
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500419 verts.write(fanPt, color, SkPoint{0, dist}, negOneDists);
420 verts.write(v1Pos, color, SkPoint{0, 0}, negOneDists);
421 verts.write(v2Pos, color, SkPoint{0, 0}, negOneDists);
422 verts.write(v1Pos + segb.fNorms[0], color, SkPoint{0, -SK_Scalar1}, negOneDists);
423 verts.write(v2Pos + segb.fNorms[0], color, SkPoint{0, -SK_Scalar1}, negOneDists);
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000424
cdalton35964822015-04-29 10:14:03 -0700425 idxs[*i + 0] = *v + 3;
426 idxs[*i + 1] = *v + 1;
427 idxs[*i + 2] = *v + 2;
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000428
cdalton35964822015-04-29 10:14:03 -0700429 idxs[*i + 3] = *v + 4;
430 idxs[*i + 4] = *v + 3;
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000431 idxs[*i + 5] = *v + 2;
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000432
cdalton35964822015-04-29 10:14:03 -0700433 *i += 6;
434
435 // Draw the interior fan if it exists.
436 // TODO: Detect and combine colinear segments. This will ensure we catch every case
437 // with no interior, and that the resulting shared edge uses the same endpoints.
438 if (count >= 3) {
439 idxs[*i + 0] = *v + 0;
440 idxs[*i + 1] = *v + 2;
441 idxs[*i + 2] = *v + 1;
442
443 *i += 3;
444 }
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000445
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000446 *v += 5;
bsalomon@google.com06809612012-01-21 15:03:39 +0000447 } else {
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500448 void* quadVertsBegin = verts.fPtr;
449
commit-bot@chromium.org972f9cd2014-03-28 17:58:28 +0000450 SkPoint qpts[] = {sega.endPt(), segb.fPts[0], segb.fPts[1]};
bsalomon@google.com495e2102012-01-21 14:48:36 +0000451
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500452 SkScalar c0 = segb.fNorms[0].dot(qpts[0]);
453 SkScalar c1 = segb.fNorms[1].dot(qpts[2]);
454 GrVertexWriter::Skip<SkPoint> skipUVs;
455
456 verts.write(fanPt,
457 color, skipUVs,
458 -segb.fNorms[0].dot(fanPt) + c0,
459 -segb.fNorms[1].dot(fanPt) + c1);
460
461 verts.write(qpts[0],
462 color, skipUVs,
463 0.0f,
464 -segb.fNorms[1].dot(qpts[0]) + c1);
465
466 verts.write(qpts[2],
467 color, skipUVs,
468 -segb.fNorms[0].dot(qpts[2]) + c0,
469 0.0f);
470
471 verts.write(qpts[0] + segb.fNorms[0],
472 color, skipUVs,
473 -SK_ScalarMax/100,
474 -SK_ScalarMax/100);
475
476 verts.write(qpts[2] + segb.fNorms[1],
477 color, skipUVs,
478 -SK_ScalarMax/100,
479 -SK_ScalarMax/100);
480
commit-bot@chromium.org972f9cd2014-03-28 17:58:28 +0000481 SkVector midVec = segb.fNorms[0] + segb.fNorms[1];
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000482 midVec.normalize();
bsalomon@google.com06809612012-01-21 15:03:39 +0000483
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500484 verts.write(qpts[1] + midVec,
485 color, skipUVs,
486 -SK_ScalarMax/100,
487 -SK_ScalarMax/100);
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000488
bsalomon@google.com19713172012-03-15 13:51:08 +0000489 GrPathUtils::QuadUVMatrix toUV(qpts);
Brian Osman7f4735b2019-01-02 13:55:10 +0000490 toUV.apply(quadVertsBegin, 6, vertexStride, uvOffset);
bsalomon@google.com06809612012-01-21 15:03:39 +0000491
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000492 idxs[*i + 0] = *v + 3;
493 idxs[*i + 1] = *v + 1;
494 idxs[*i + 2] = *v + 2;
495 idxs[*i + 3] = *v + 4;
496 idxs[*i + 4] = *v + 3;
497 idxs[*i + 5] = *v + 2;
bsalomon@google.com06809612012-01-21 15:03:39 +0000498
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000499 idxs[*i + 6] = *v + 5;
500 idxs[*i + 7] = *v + 3;
501 idxs[*i + 8] = *v + 4;
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000502
cdalton35964822015-04-29 10:14:03 -0700503 *i += 9;
504
505 // Draw the interior fan if it exists.
506 // TODO: Detect and combine colinear segments. This will ensure we catch every case
507 // with no interior, and that the resulting shared edge uses the same endpoints.
508 if (count >= 3) {
509 idxs[*i + 0] = *v + 0;
510 idxs[*i + 1] = *v + 2;
511 idxs[*i + 2] = *v + 1;
512
513 *i += 3;
514 }
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000515
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000516 *v += 6;
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000517 }
518 }
519}
520
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000521///////////////////////////////////////////////////////////////////////////////
522
523/*
524 * Quadratic specified by 0=u^2-v canonical coords. u and v are the first
525 * two components of the vertex attribute. Coverage is based on signed
526 * distance with negative being inside, positive outside. The edge is specified in
527 * window space (y-down). If either the third or fourth component of the interpolated
528 * vertex coord is > 0 then the pixel is considered outside the edge. This is used to
skia.committer@gmail.com041e2db2013-04-03 07:01:14 +0000529 * attempt to trim to a portion of the infinite quad.
530 * Requires shader derivative instruction support.
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000531 */
532
joshualitt249af152014-09-15 11:41:13 -0700533class QuadEdgeEffect : public GrGeometryProcessor {
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000534public:
Brian Osman7f4735b2019-01-02 13:55:10 +0000535 static sk_sp<GrGeometryProcessor> Make(const SkMatrix& localMatrix, bool usesLocalCoords,
536 bool wideColor) {
537 return sk_sp<GrGeometryProcessor>(
538 new QuadEdgeEffect(localMatrix, usesLocalCoords, wideColor));
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000539 }
540
Brian Salomond3b65972017-03-22 12:05:03 -0400541 ~QuadEdgeEffect() override {}
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000542
mtklein36352bf2015-03-25 18:17:31 -0700543 const char* name() const override { return "QuadEdge"; }
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000544
egdaniel57d3b032015-11-13 11:57:27 -0800545 class GLSLProcessor : public GrGLSLGeometryProcessor {
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000546 public:
Brian Salomon60fb0b22017-06-15 17:09:36 -0400547 GLSLProcessor() {}
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000548
mtklein36352bf2015-03-25 18:17:31 -0700549 void onEmitCode(EmitArgs& args, GrGPArgs* gpArgs) override {
joshualitt2dd1ae02014-12-03 06:24:10 -0800550 const QuadEdgeEffect& qe = args.fGP.cast<QuadEdgeEffect>();
egdaniel4ca2e602015-11-18 08:01:26 -0800551 GrGLSLVertexBuilder* vertBuilder = args.fVertBuilder;
egdaniel0eafe792015-11-20 14:01:22 -0800552 GrGLSLVaryingHandler* varyingHandler = args.fVaryingHandler;
egdaniel7ea439b2015-12-03 09:20:44 -0800553 GrGLSLUniformHandler* uniformHandler = args.fUniformHandler;
joshualitt2dd1ae02014-12-03 06:24:10 -0800554
joshualittabb52a12015-01-13 15:02:10 -0800555 // emit attributes
egdaniel0eafe792015-11-20 14:01:22 -0800556 varyingHandler->emitAttributes(qe);
joshualittabb52a12015-01-13 15:02:10 -0800557
Chris Dalton27372882017-12-08 13:34:21 -0700558 GrGLSLVarying v(kHalf4_GrSLType);
egdaniel0eafe792015-11-20 14:01:22 -0800559 varyingHandler->addVarying("QuadEdge", &v);
Brian Osmanf04fb3c2018-11-12 15:34:00 -0500560 vertBuilder->codeAppendf("%s = %s;", v.vsOut(), qe.fInQuadEdge.name());
Brian Salomon60fb0b22017-06-15 17:09:36 -0400561
562 // Setup pass through color
Brian Osmanf04fb3c2018-11-12 15:34:00 -0500563 varyingHandler->addPassThroughAttribute(qe.fInColor, args.fOutputColor);
joshualitt2dd1ae02014-12-03 06:24:10 -0800564
Chris Dalton60283612018-02-14 13:38:14 -0700565 GrGLSLFPFragmentBuilder* fragBuilder = args.fFragBuilder;
joshualitt9b989322014-12-15 14:16:27 -0800566
joshualittabb52a12015-01-13 15:02:10 -0800567 // Setup position
Brian Osmanf04fb3c2018-11-12 15:34:00 -0500568 this->writeOutputPosition(vertBuilder, gpArgs, qe.fInPosition.name());
joshualittabb52a12015-01-13 15:02:10 -0800569
570 // emit transforms
egdaniel7ea439b2015-12-03 09:20:44 -0800571 this->emitTransforms(vertBuilder,
egdaniel0eafe792015-11-20 14:01:22 -0800572 varyingHandler,
egdaniel7ea439b2015-12-03 09:20:44 -0800573 uniformHandler,
Brian Osmanf04fb3c2018-11-12 15:34:00 -0500574 qe.fInPosition.asShaderVar(),
Brian Salomon60fb0b22017-06-15 17:09:36 -0400575 qe.fLocalMatrix,
bsalomona624bf32016-09-20 09:12:47 -0700576 args.fFPCoordTransformHandler);
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000577
Ethan Nicholasf7b88202017-09-18 14:10:39 -0400578 fragBuilder->codeAppendf("half edgeAlpha;");
joshualitt30ba4362014-08-21 20:18:45 -0700579
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000580 // keep the derivative instructions outside the conditional
Ethan Nicholase1f55022019-02-05 17:17:40 -0500581 fragBuilder->codeAppendf("half2 duvdx = half2(dFdx(%s.xy));", v.fsIn());
582 fragBuilder->codeAppendf("half2 duvdy = half2(dFdy(%s.xy));", v.fsIn());
egdaniel4ca2e602015-11-18 08:01:26 -0800583 fragBuilder->codeAppendf("if (%s.z > 0.0 && %s.w > 0.0) {", v.fsIn(), v.fsIn());
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000584 // today we know z and w are in device space. We could use derivatives
egdaniel4ca2e602015-11-18 08:01:26 -0800585 fragBuilder->codeAppendf("edgeAlpha = min(min(%s.z, %s.w) + 0.5, 1.0);", v.fsIn(),
586 v.fsIn());
587 fragBuilder->codeAppendf ("} else {");
Ethan Nicholasf7b88202017-09-18 14:10:39 -0400588 fragBuilder->codeAppendf("half2 gF = half2(2.0*%s.x*duvdx.x - duvdx.y,"
egdaniel4ca2e602015-11-18 08:01:26 -0800589 " 2.0*%s.x*duvdy.x - duvdy.y);",
590 v.fsIn(), v.fsIn());
591 fragBuilder->codeAppendf("edgeAlpha = (%s.x*%s.x - %s.y);", v.fsIn(), v.fsIn(),
592 v.fsIn());
593 fragBuilder->codeAppendf("edgeAlpha = "
Ethan Nicholas12fb9cf2018-08-03 16:16:57 -0400594 "saturate(0.5 - edgeAlpha / length(gF));}");
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000595
Ethan Nicholasf7b88202017-09-18 14:10:39 -0400596 fragBuilder->codeAppendf("%s = half4(edgeAlpha);", args.fOutputCoverage);
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000597 }
598
joshualitt9b989322014-12-15 14:16:27 -0800599 static inline void GenKey(const GrGeometryProcessor& gp,
Brian Salomon94efbf52016-11-29 13:43:05 -0500600 const GrShaderCaps&,
joshualitt9b989322014-12-15 14:16:27 -0800601 GrProcessorKeyBuilder* b) {
joshualitte3ababe2015-05-15 07:56:07 -0700602 const QuadEdgeEffect& qee = gp.cast<QuadEdgeEffect>();
Brian Salomon60fb0b22017-06-15 17:09:36 -0400603 b->add32(SkToBool(qee.fUsesLocalCoords && qee.fLocalMatrix.hasPerspective()));
joshualitt9b989322014-12-15 14:16:27 -0800604 }
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000605
egdaniel018fb622015-10-28 07:26:40 -0700606 void setData(const GrGLSLProgramDataManager& pdman,
bsalomona624bf32016-09-20 09:12:47 -0700607 const GrPrimitiveProcessor& gp,
608 FPCoordTransformIter&& transformIter) override {
joshualittb8c241a2015-05-19 08:23:30 -0700609 const QuadEdgeEffect& qe = gp.cast<QuadEdgeEffect>();
bsalomona624bf32016-09-20 09:12:47 -0700610 this->setTransformDataHelper(qe.fLocalMatrix, pdman, &transformIter);
joshualitte3ababe2015-05-15 07:56:07 -0700611 }
612
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000613 private:
egdaniele659a582015-11-13 09:55:43 -0800614 typedef GrGLSLGeometryProcessor INHERITED;
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000615 };
skia.committer@gmail.com041e2db2013-04-03 07:01:14 +0000616
Brian Salomon94efbf52016-11-29 13:43:05 -0500617 void getGLSLProcessorKey(const GrShaderCaps& caps, GrProcessorKeyBuilder* b) const override {
egdaniel57d3b032015-11-13 11:57:27 -0800618 GLSLProcessor::GenKey(*this, caps, b);
joshualitteb2a6762014-12-04 11:35:33 -0800619 }
620
Brian Salomon94efbf52016-11-29 13:43:05 -0500621 GrGLSLPrimitiveProcessor* createGLSLInstance(const GrShaderCaps&) const override {
egdaniel57d3b032015-11-13 11:57:27 -0800622 return new GLSLProcessor();
joshualitteb2a6762014-12-04 11:35:33 -0800623 }
624
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000625private:
Brian Osman7f4735b2019-01-02 13:55:10 +0000626 QuadEdgeEffect(const SkMatrix& localMatrix, bool usesLocalCoords, bool wideColor)
Ethan Nicholasabff9562017-10-09 10:54:08 -0400627 : INHERITED(kQuadEdgeEffect_ClassID)
628 , fLocalMatrix(localMatrix)
629 , fUsesLocalCoords(usesLocalCoords) {
Brian Osmanf04fb3c2018-11-12 15:34:00 -0500630 fInPosition = {"inPosition", kFloat2_GrVertexAttribType, kFloat2_GrSLType};
Brian Osman7f4735b2019-01-02 13:55:10 +0000631 fInColor = MakeColorAttribute("inColor", wideColor);
Brian Osmanf04fb3c2018-11-12 15:34:00 -0500632 fInQuadEdge = {"inQuadEdge", kFloat4_GrVertexAttribType, kHalf4_GrSLType};
633 this->setVertexAttributes(&fInPosition, 3);
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000634 }
635
Brian Osmanf04fb3c2018-11-12 15:34:00 -0500636 Attribute fInPosition;
637 Attribute fInColor;
638 Attribute fInQuadEdge;
639
Brian Salomon92be2f72018-06-19 14:33:47 -0400640 SkMatrix fLocalMatrix;
641 bool fUsesLocalCoords;
joshualitt249af152014-09-15 11:41:13 -0700642
Brian Salomon0c26a9d2017-07-06 10:09:38 -0400643 GR_DECLARE_GEOMETRY_PROCESSOR_TEST
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000644
joshualitt2e3b3e32014-12-09 13:31:14 -0800645 typedef GrGeometryProcessor INHERITED;
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000646};
647
joshualittb0a8a372014-09-23 09:50:21 -0700648GR_DEFINE_GEOMETRY_PROCESSOR_TEST(QuadEdgeEffect);
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000649
Hal Canary6f6961e2017-01-31 13:50:44 -0500650#if GR_TEST_UTILS
bungeman06ca8ec2016-06-09 08:01:03 -0700651sk_sp<GrGeometryProcessor> QuadEdgeEffect::TestCreate(GrProcessorTestData* d) {
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000652 // Doesn't work without derivative instructions.
Robert Phillips296b1cc2017-03-15 10:42:12 -0400653 return d->caps()->shaderCaps()->shaderDerivativeSupport()
Brian Osman7f4735b2019-01-02 13:55:10 +0000654 ? QuadEdgeEffect::Make(GrTest::TestMatrix(d->fRandom), d->fRandom->nextBool(),
655 d->fRandom->nextBool())
Brian Salomon9ae32a22017-01-25 14:58:24 -0500656 : nullptr;
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000657}
Hal Canary6f6961e2017-01-31 13:50:44 -0500658#endif
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000659
660///////////////////////////////////////////////////////////////////////////////
661
Chris Dalton5ed44232017-09-07 13:22:46 -0600662GrPathRenderer::CanDrawPath
663GrAAConvexPathRenderer::onCanDrawPath(const CanDrawPathArgs& args) const {
664 if (args.fCaps->shaderCaps()->shaderDerivativeSupport() &&
Chris Dalton6ce447a2019-06-23 18:07:38 -0600665 (GrAAType::kCoverage == args.fAAType) && args.fShape->style().isSimpleFill() &&
Chris Dalton5ed44232017-09-07 13:22:46 -0600666 !args.fShape->inverseFilled() && args.fShape->knownToBeConvex()) {
667 return CanDrawPath::kYes;
668 }
669 return CanDrawPath::kNo;
robertphillips@google.comfa662942012-05-17 12:20:22 +0000670}
671
Brian Salomon10978a62017-06-15 16:21:49 -0400672namespace {
673
674class AAConvexPathOp final : public GrMeshDrawOp {
675private:
676 using Helper = GrSimpleMeshDrawOpHelperWithStencil;
677
joshualitt27f398f2015-02-05 14:39:01 -0800678public:
Brian Salomon25a88092016-12-01 09:36:50 -0500679 DEFINE_OP_CLASS_ID
Robert Phillipsb493eeb2017-09-13 13:10:52 -0400680
Robert Phillipsb97da532019-02-12 15:24:12 -0500681 static std::unique_ptr<GrDrawOp> Make(GrRecordingContext* context,
Robert Phillips7c525e62018-06-12 10:11:12 -0400682 GrPaint&& paint,
683 const SkMatrix& viewMatrix,
Brian Salomon10978a62017-06-15 16:21:49 -0400684 const SkPath& path,
685 const GrUserStencilSettings* stencilSettings) {
Robert Phillips7c525e62018-06-12 10:11:12 -0400686 return Helper::FactoryHelper<AAConvexPathOp>(context, std::move(paint), viewMatrix, path,
Brian Salomon10978a62017-06-15 16:21:49 -0400687 stencilSettings);
688 }
689
Brian Osmancf860852018-10-31 14:04:39 -0400690 AAConvexPathOp(const Helper::MakeArgs& helperArgs, const SkPMColor4f& color,
Brian Osman936fe7d2018-10-30 15:30:35 -0400691 const SkMatrix& viewMatrix, const SkPath& path,
692 const GrUserStencilSettings* stencilSettings)
Brian Salomon60fb0b22017-06-15 17:09:36 -0400693 : INHERITED(ClassID()), fHelper(helperArgs, GrAAType::kCoverage, stencilSettings) {
694 fPaths.emplace_back(PathData{viewMatrix, path, color});
Brian Salomon10978a62017-06-15 16:21:49 -0400695 this->setTransformedBounds(path.getBounds(), viewMatrix, HasAABloat::kYes, IsZeroArea::kNo);
bsalomonf1703092016-06-29 18:41:53 -0700696 }
joshualitt27f398f2015-02-05 14:39:01 -0800697
Brian Salomond0a0a652016-12-15 15:25:22 -0500698 const char* name() const override { return "AAConvexPathOp"; }
joshualitt27f398f2015-02-05 14:39:01 -0800699
Chris Dalton1706cbf2019-05-21 19:35:29 -0600700 void visitProxies(const VisitProxyFunc& func) const override {
Robert Phillipsb493eeb2017-09-13 13:10:52 -0400701 fHelper.visitProxies(func);
702 }
703
Brian Osman9a390ac2018-11-12 09:47:48 -0500704#ifdef SK_DEBUG
Brian Salomon7c3e7182016-12-01 09:35:30 -0500705 SkString dumpInfo() const override {
706 SkString string;
Brian Salomon60fb0b22017-06-15 17:09:36 -0400707 string.appendf("Count: %d\n", fPaths.count());
Brian Salomon10978a62017-06-15 16:21:49 -0400708 string += fHelper.dumpInfo();
709 string += INHERITED::dumpInfo();
Brian Salomon7c3e7182016-12-01 09:35:30 -0500710 return string;
711 }
Brian Osman9a390ac2018-11-12 09:47:48 -0500712#endif
Brian Salomon7c3e7182016-12-01 09:35:30 -0500713
Brian Salomon10978a62017-06-15 16:21:49 -0400714 FixedFunctionFlags fixedFunctionFlags() const override { return fHelper.fixedFunctionFlags(); }
715
Chris Dalton6ce447a2019-06-23 18:07:38 -0600716 GrProcessorSet::Analysis finalize(
717 const GrCaps& caps, const GrAppliedClip* clip, bool hasMixedSampledCoverage,
718 GrClampType clampType) override {
Chris Daltonb8fff0d2019-03-05 10:11:58 -0700719 return fHelper.finalizeProcessors(
Chris Dalton6ce447a2019-06-23 18:07:38 -0600720 caps, clip, hasMixedSampledCoverage, clampType,
721 GrProcessorAnalysisCoverage::kSingleChannel, &fPaths.back().fColor, &fWideColor);
Brian Salomon10978a62017-06-15 16:21:49 -0400722 }
723
bsalomone46f9fe2015-08-18 06:05:14 -0700724private:
Brian Salomon91326c32017-08-09 16:02:19 -0400725 void onPrepareDraws(Target* target) override {
Brian Salomond0a0a652016-12-15 15:25:22 -0500726 int instanceCount = fPaths.count();
joshualitt27f398f2015-02-05 14:39:01 -0800727
728 SkMatrix invert;
Brian Salomon10978a62017-06-15 16:21:49 -0400729 if (fHelper.usesLocalCoords() && !fPaths.back().fViewMatrix.invert(&invert)) {
joshualitt27f398f2015-02-05 14:39:01 -0800730 return;
731 }
732
733 // Setup GrGeometryProcessor
bungeman06ca8ec2016-06-09 08:01:03 -0700734 sk_sp<GrGeometryProcessor> quadProcessor(
Brian Osman7f4735b2019-01-02 13:55:10 +0000735 QuadEdgeEffect::Make(invert, fHelper.usesLocalCoords(), fWideColor));
736 const size_t kVertexStride = quadProcessor->vertexStride();
joshualitt27f398f2015-02-05 14:39:01 -0800737
joshualitt27f398f2015-02-05 14:39:01 -0800738 // TODO generate all segments for all paths and use one vertex buffer
739 for (int i = 0; i < instanceCount; i++) {
Brian Salomond0a0a652016-12-15 15:25:22 -0500740 const PathData& args = fPaths[i];
joshualitt27f398f2015-02-05 14:39:01 -0800741
742 // We use the fact that SkPath::transform path does subdivision based on
743 // perspective. Otherwise, we apply the view matrix when copying to the
744 // segment representation.
745 const SkMatrix* viewMatrix = &args.fViewMatrix;
joshualitt144c3c82015-11-30 12:30:13 -0800746
747 // We avoid initializing the path unless we have to
748 const SkPath* pathPtr = &args.fPath;
749 SkTLazy<SkPath> tmpPath;
joshualitt27f398f2015-02-05 14:39:01 -0800750 if (viewMatrix->hasPerspective()) {
joshualitt144c3c82015-11-30 12:30:13 -0800751 SkPath* tmpPathPtr = tmpPath.init(*pathPtr);
752 tmpPathPtr->setIsVolatile(true);
753 tmpPathPtr->transform(*viewMatrix);
joshualitt27f398f2015-02-05 14:39:01 -0800754 viewMatrix = &SkMatrix::I();
joshualitt144c3c82015-11-30 12:30:13 -0800755 pathPtr = tmpPathPtr;
joshualitt27f398f2015-02-05 14:39:01 -0800756 }
757
758 int vertexCount;
759 int indexCount;
760 enum {
761 kPreallocSegmentCnt = 512 / sizeof(Segment),
762 kPreallocDrawCnt = 4,
763 };
764 SkSTArray<kPreallocSegmentCnt, Segment, true> segments;
765 SkPoint fanPt;
766
joshualitt144c3c82015-11-30 12:30:13 -0800767 if (!get_segments(*pathPtr, *viewMatrix, &segments, &fanPt, &vertexCount,
joshualitt27f398f2015-02-05 14:39:01 -0800768 &indexCount)) {
769 continue;
770 }
771
Brian Salomon12d22642019-01-29 14:38:50 -0500772 sk_sp<const GrBuffer> vertexBuffer;
Chris Daltonbca46e22017-05-15 11:03:26 -0600773 int firstVertex;
774
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500775 GrVertexWriter verts{target->makeVertexSpace(kVertexStride, vertexCount,
776 &vertexBuffer, &firstVertex)};
bsalomone64eb572015-05-07 11:35:55 -0700777
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500778 if (!verts.fPtr) {
joshualitt4b31de82015-03-05 14:33:41 -0800779 SkDebugf("Could not allocate vertices\n");
780 return;
781 }
782
Brian Salomon12d22642019-01-29 14:38:50 -0500783 sk_sp<const GrBuffer> indexBuffer;
Chris Daltonbca46e22017-05-15 11:03:26 -0600784 int firstIndex;
785
786 uint16_t *idxs = target->makeIndexSpace(indexCount, &indexBuffer, &firstIndex);
robertphillipse40d3972015-05-07 09:51:43 -0700787 if (!idxs) {
joshualitt4b31de82015-03-05 14:33:41 -0800788 SkDebugf("Could not allocate indices\n");
789 return;
790 }
791
joshualitt27f398f2015-02-05 14:39:01 -0800792 SkSTArray<kPreallocDrawCnt, Draw, true> draws;
Brian Osman7f4735b2019-01-02 13:55:10 +0000793 GrVertexColor color(args.fColor, fWideColor);
794 create_vertices(segments, fanPt, color, &draws, verts, idxs, kVertexStride);
joshualitt27f398f2015-02-05 14:39:01 -0800795
Brian Salomon7eae3e02018-08-07 14:02:38 +0000796 GrMesh* meshes = target->allocMeshes(draws.count());
robertphillips44c31282015-09-03 12:58:48 -0700797 for (int j = 0; j < draws.count(); ++j) {
798 const Draw& draw = draws[j];
Brian Salomon7eae3e02018-08-07 14:02:38 +0000799 meshes[j].setPrimitiveType(GrPrimitiveType::kTriangles);
800 meshes[j].setIndexed(indexBuffer, draw.fIndexCnt, firstIndex, 0,
801 draw.fVertexCnt - 1, GrPrimitiveRestart::kNo);
802 meshes[j].setVertexData(vertexBuffer, firstVertex);
Chris Daltonbca46e22017-05-15 11:03:26 -0600803 firstIndex += draw.fIndexCnt;
804 firstVertex += draw.fVertexCnt;
joshualitt27f398f2015-02-05 14:39:01 -0800805 }
Chris Dalton07cdcfc92019-02-26 11:13:22 -0700806 target->recordDraw(quadProcessor, meshes, draws.count());
joshualitt27f398f2015-02-05 14:39:01 -0800807 }
808 }
809
Chris Dalton07cdcfc92019-02-26 11:13:22 -0700810 void onExecute(GrOpFlushState* flushState, const SkRect& chainBounds) override {
811 fHelper.executeDrawsAndUploads(this, flushState, chainBounds);
812 }
813
Brian Salomon7eae3e02018-08-07 14:02:38 +0000814 CombineResult onCombineIfPossible(GrOp* t, const GrCaps& caps) override {
Brian Salomond0a0a652016-12-15 15:25:22 -0500815 AAConvexPathOp* that = t->cast<AAConvexPathOp>();
Brian Salomon10978a62017-06-15 16:21:49 -0400816 if (!fHelper.isCompatible(that->fHelper, caps, this->bounds(), that->bounds())) {
Brian Salomon7eae3e02018-08-07 14:02:38 +0000817 return CombineResult::kCannotCombine;
joshualitt8cab9a72015-07-16 09:13:50 -0700818 }
Brian Salomon10978a62017-06-15 16:21:49 -0400819 if (fHelper.usesLocalCoords() &&
820 !fPaths[0].fViewMatrix.cheapEqualTo(that->fPaths[0].fViewMatrix)) {
Brian Salomon7eae3e02018-08-07 14:02:38 +0000821 return CombineResult::kCannotCombine;
joshualitt27f398f2015-02-05 14:39:01 -0800822 }
823
Brian Salomond0a0a652016-12-15 15:25:22 -0500824 fPaths.push_back_n(that->fPaths.count(), that->fPaths.begin());
Brian Osman7f4735b2019-01-02 13:55:10 +0000825 fWideColor |= that->fWideColor;
Brian Salomon7eae3e02018-08-07 14:02:38 +0000826 return CombineResult::kMerged;
joshualitt27f398f2015-02-05 14:39:01 -0800827 }
828
Brian Salomond0a0a652016-12-15 15:25:22 -0500829 struct PathData {
bsalomonf1703092016-06-29 18:41:53 -0700830 SkMatrix fViewMatrix;
831 SkPath fPath;
Brian Osmancf860852018-10-31 14:04:39 -0400832 SkPMColor4f fColor;
bsalomonf1703092016-06-29 18:41:53 -0700833 };
834
Brian Salomon10978a62017-06-15 16:21:49 -0400835 Helper fHelper;
Brian Salomond0a0a652016-12-15 15:25:22 -0500836 SkSTArray<1, PathData, true> fPaths;
Brian Osman7f4735b2019-01-02 13:55:10 +0000837 bool fWideColor;
reed1b55a962015-09-17 20:16:13 -0700838
Brian Salomon10978a62017-06-15 16:21:49 -0400839 typedef GrMeshDrawOp INHERITED;
joshualitt27f398f2015-02-05 14:39:01 -0800840};
841
Brian Salomon10978a62017-06-15 16:21:49 -0400842} // anonymous namespace
843
bsalomon0aff2fa2015-07-31 06:48:27 -0700844bool GrAAConvexPathRenderer::onDrawPath(const DrawPathArgs& args) {
Brian Osman11052242016-10-27 14:47:55 -0400845 GR_AUDIT_TRAIL_AUTO_FRAME(args.fRenderTargetContext->auditTrail(),
robertphillips976f5f02016-06-03 10:59:20 -0700846 "GrAAConvexPathRenderer::onDrawPath");
Chris Dalton6ce447a2019-06-23 18:07:38 -0600847 SkASSERT(args.fRenderTargetContext->numSamples() <= 1);
bsalomon8acedde2016-06-24 10:42:16 -0700848 SkASSERT(!args.fShape->isEmpty());
bsalomon@google.com4647f902013-03-26 14:45:27 +0000849
bsalomonf1703092016-06-29 18:41:53 -0700850 SkPath path;
851 args.fShape->asPath(&path);
bsalomon@google.comaf90f7f2012-03-05 20:50:10 +0000852
Robert Phillips7c525e62018-06-12 10:11:12 -0400853 std::unique_ptr<GrDrawOp> op = AAConvexPathOp::Make(args.fContext, std::move(args.fPaint),
854 *args.fViewMatrix,
Brian Salomon10978a62017-06-15 16:21:49 -0400855 path, args.fUserStencilSettings);
856 args.fRenderTargetContext->addDrawOp(*args.fClip, std::move(op));
bsalomon@google.comc2099d22012-03-02 21:26:50 +0000857 return true;
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000858}
joshualitt8e5c1772015-05-11 08:58:52 -0700859
860///////////////////////////////////////////////////////////////////////////////////////////////////
861
Hal Canary6f6961e2017-01-31 13:50:44 -0500862#if GR_TEST_UTILS
joshualitt8e5c1772015-05-11 08:58:52 -0700863
Brian Salomon10978a62017-06-15 16:21:49 -0400864GR_DRAW_OP_TEST_DEFINE(AAConvexPathOp) {
bsalomonf1703092016-06-29 18:41:53 -0700865 SkMatrix viewMatrix = GrTest::TestMatrixInvertible(random);
866 SkPath path = GrTest::TestPathConvex(random);
Brian Salomon10978a62017-06-15 16:21:49 -0400867 const GrUserStencilSettings* stencilSettings = GrGetRandomStencil(random, context);
Robert Phillips7c525e62018-06-12 10:11:12 -0400868 return AAConvexPathOp::Make(context, std::move(paint), viewMatrix, path, stencilSettings);
joshualitt8e5c1772015-05-11 08:58:52 -0700869}
870
871#endif