blob: 39a8d5fe8605982901522fcb245717ced4d6d7cf [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
8#include "GrAAConvexPathRenderer.h"
bsalomoneb1cb5c2015-05-22 08:01:09 -07009#include "GrCaps.h"
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +000010#include "GrContext.h"
Brian Salomon5ec9def2016-12-20 15:34:05 -050011#include "GrDrawOpTest.h"
joshualitteb2a6762014-12-04 11:35:33 -080012#include "GrGeometryProcessor.h"
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +000013#include "GrPathUtils.h"
Brian Salomondad29232016-12-01 16:40:24 -050014#include "GrProcessor.h"
Brian Salomon653f42f2018-07-10 10:07:31 -040015#include "GrRenderTargetContext.h"
16#include "GrShape.h"
Brian Salomon10978a62017-06-15 16:21:49 -040017#include "GrSimpleMeshDrawOpHelper.h"
Brian Osmanf9aabff2018-11-13 16:11:38 -050018#include "GrVertexWriter.h"
egdanielaf18a092015-01-05 10:22:28 -080019#include "SkGeometry.h"
reed026beb52015-06-10 14:23:15 -070020#include "SkPathPriv.h"
Cary Clarkdf429f32017-11-08 11:44:31 -050021#include "SkPointPriv.h"
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +000022#include "SkString.h"
Greg Danield5b45932018-06-07 13:15:10 -040023#include "SkTypes.h"
egdaniel7ea439b2015-12-03 09:20:44 -080024#include "glsl/GrGLSLFragmentShaderBuilder.h"
egdaniele659a582015-11-13 09:55:43 -080025#include "glsl/GrGLSLGeometryProcessor.h"
egdaniel018fb622015-10-28 07:26:40 -070026#include "glsl/GrGLSLProgramDataManager.h"
egdaniel7ea439b2015-12-03 09:20:44 -080027#include "glsl/GrGLSLUniformHandler.h"
egdaniel0eafe792015-11-20 14:01:22 -080028#include "glsl/GrGLSLVarying.h"
Chris Daltonc17bf322017-10-24 10:59:03 -060029#include "glsl/GrGLSLVertexGeoBuilder.h"
Brian Salomon89527432016-12-16 09:52:16 -050030#include "ops/GrMeshDrawOp.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) {
Cary Clarkdf429f32017-11-08 11:44:31 -0500246 if (SkPointPriv::DistanceToSqd(pts[0], pts[1]) < kCloseSqd ||
247 SkPointPriv::DistanceToSqd(pts[1], pts[2]) < kCloseSqd) {
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000248 if (pts[0] != pts[2]) {
joshualitt27f398f2015-02-05 14:39:01 -0800249 add_line_to_segment(pts[2], segments);
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000250 }
251 } else {
252 segments->push_back();
253 segments->back().fType = Segment::kQuad;
254 segments->back().fPts[0] = pts[1];
255 segments->back().fPts[1] = pts[2];
256 }
257}
258
259static inline void add_cubic_segments(const SkPoint pts[4],
reed026beb52015-06-10 14:23:15 -0700260 SkPathPriv::FirstDirection dir,
joshualitt27f398f2015-02-05 14:39:01 -0800261 SegmentArray* segments) {
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000262 SkSTArray<15, SkPoint, true> quads;
bsalomon18fab302016-02-16 08:00:05 -0800263 GrPathUtils::convertCubicToQuadsConstrainToTangents(pts, SK_Scalar1, dir, &quads);
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000264 int count = quads.count();
265 for (int q = 0; q < count; q += 3) {
joshualitt27f398f2015-02-05 14:39:01 -0800266 add_quad_segment(&quads[q], segments);
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000267 }
268}
269
270static bool get_segments(const SkPath& path,
271 const SkMatrix& m,
272 SegmentArray* segments,
273 SkPoint* fanPt,
274 int* vCount,
joshualitt27f398f2015-02-05 14:39:01 -0800275 int* iCount) {
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000276 SkPath::Iter iter(path, true);
bsalomon@google.com30c174b2012-11-13 14:36:42 +0000277 // This renderer over-emphasizes very thin path regions. We use the distance
bsalomon@google.com5cc90d12012-01-17 16:28:34 +0000278 // to the path from the sample to compute coverage. Every pixel intersected
279 // 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 +0000280 // notice that the sample may be close to a very thin area of the path and
bsalomon@google.com5cc90d12012-01-17 16:28:34 +0000281 // thus should be very light. This is particularly egregious for degenerate
282 // line paths. We detect paths that are very close to a line (zero area) and
283 // draw nothing.
bsalomon@google.com9732f622012-01-31 15:19:21 +0000284 DegenerateTestData degenerateData;
reed026beb52015-06-10 14:23:15 -0700285 SkPathPriv::FirstDirection dir;
bsalomon@google.coma51ab842012-07-10 19:53:34 +0000286 // get_direction can fail for some degenerate paths.
287 if (!get_direction(path, m, &dir)) {
288 return false;
289 }
bsalomon@google.com9732f622012-01-31 15:19:21 +0000290
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000291 for (;;) {
commit-bot@chromium.org972f9cd2014-03-28 17:58:28 +0000292 SkPoint pts[4];
Brian Salomon97042bf2017-02-28 11:21:28 -0500293 SkPath::Verb verb = iter.next(pts, true, true);
bsalomon@google.com94b284d2013-05-10 17:14:06 +0000294 switch (verb) {
295 case SkPath::kMove_Verb:
bsalomon@google.com1a38d552012-03-15 14:40:46 +0000296 m.mapPoints(pts, 1);
bsalomon@google.com9732f622012-01-31 15:19:21 +0000297 update_degenerate_test(&degenerateData, pts[0]);
298 break;
bsalomon@google.com94b284d2013-05-10 17:14:06 +0000299 case SkPath::kLine_Verb: {
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000300 m.mapPoints(&pts[1], 1);
bsalomon@google.com1a38d552012-03-15 14:40:46 +0000301 update_degenerate_test(&degenerateData, pts[1]);
joshualitt27f398f2015-02-05 14:39:01 -0800302 add_line_to_segment(pts[1], segments);
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000303 break;
304 }
bsalomon@google.com94b284d2013-05-10 17:14:06 +0000305 case SkPath::kQuad_Verb:
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000306 m.mapPoints(pts, 3);
bsalomon@google.com9732f622012-01-31 15:19:21 +0000307 update_degenerate_test(&degenerateData, pts[1]);
308 update_degenerate_test(&degenerateData, pts[2]);
joshualitt27f398f2015-02-05 14:39:01 -0800309 add_quad_segment(pts, segments);
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000310 break;
egdanielaf18a092015-01-05 10:22:28 -0800311 case SkPath::kConic_Verb: {
312 m.mapPoints(pts, 3);
313 SkScalar weight = iter.conicWeight();
314 SkAutoConicToQuads converter;
Brian Osmane3deee12018-11-20 11:10:15 -0500315 const SkPoint* quadPts = converter.computeQuads(pts, weight, 0.25f);
egdanielaf18a092015-01-05 10:22:28 -0800316 for (int i = 0; i < converter.countQuads(); ++i) {
317 update_degenerate_test(&degenerateData, quadPts[2*i + 1]);
318 update_degenerate_test(&degenerateData, quadPts[2*i + 2]);
joshualitt27f398f2015-02-05 14:39:01 -0800319 add_quad_segment(quadPts + 2*i, segments);
egdanielaf18a092015-01-05 10:22:28 -0800320 }
321 break;
322 }
bsalomon@google.com94b284d2013-05-10 17:14:06 +0000323 case SkPath::kCubic_Verb: {
bsalomon@google.com1a38d552012-03-15 14:40:46 +0000324 m.mapPoints(pts, 4);
bsalomon@google.com9732f622012-01-31 15:19:21 +0000325 update_degenerate_test(&degenerateData, pts[1]);
326 update_degenerate_test(&degenerateData, pts[2]);
327 update_degenerate_test(&degenerateData, pts[3]);
joshualitt27f398f2015-02-05 14:39:01 -0800328 add_cubic_segments(pts, dir, segments);
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000329 break;
Brian Salomon23356442018-11-30 15:33:19 -0500330 }
bsalomon@google.com94b284d2013-05-10 17:14:06 +0000331 case SkPath::kDone_Verb:
bsalomon@google.com9732f622012-01-31 15:19:21 +0000332 if (degenerateData.isDegenerate()) {
333 return false;
334 } else {
Greg Daniel8b09b962018-04-03 14:53:45 -0400335 return compute_vectors(segments, fanPt, dir, vCount, iCount);
bsalomon@google.com9732f622012-01-31 15:19:21 +0000336 }
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000337 default:
338 break;
339 }
340 }
341}
342
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000343struct Draw {
344 Draw() : fVertexCnt(0), fIndexCnt(0) {}
345 int fVertexCnt;
346 int fIndexCnt;
347};
348
349typedef SkTArray<Draw, true> DrawArray;
350
Brian Salomon60fb0b22017-06-15 17:09:36 -0400351static void create_vertices(const SegmentArray& segments,
commit-bot@chromium.orgfdfbb9d2013-08-15 18:16:27 +0000352 const SkPoint& fanPt,
Brian Osman7f4735b2019-01-02 13:55:10 +0000353 const GrVertexColor& color,
Brian Salomon60fb0b22017-06-15 17:09:36 -0400354 DrawArray* draws,
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500355 GrVertexWriter& verts,
356 uint16_t* idxs,
357 size_t vertexStride) {
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000358 Draw* draw = &draws->push_back();
359 // alias just to make vert/index assignments easier to read.
360 int* v = &draw->fVertexCnt;
361 int* i = &draw->fIndexCnt;
Brian Osman7f4735b2019-01-02 13:55:10 +0000362 const size_t uvOffset = sizeof(SkPoint) + color.size();
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000363
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000364 int count = segments.count();
365 for (int a = 0; a < count; ++a) {
366 const Segment& sega = segments[a];
367 int b = (a + 1) % count;
368 const Segment& segb = segments[b];
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000369
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000370 // Check whether adding the verts for this segment to the current draw would cause index
371 // values to overflow.
372 int vCount = 4;
373 if (Segment::kLine == segb.fType) {
374 vCount += 5;
375 } else {
376 vCount += 6;
377 }
378 if (draw->fVertexCnt + vCount > (1 << 16)) {
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000379 idxs += *i;
380 draw = &draws->push_back();
381 v = &draw->fVertexCnt;
382 i = &draw->fIndexCnt;
383 }
384
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500385 const SkScalar negOneDists[2] = { -SK_Scalar1, -SK_Scalar1 };
386
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000387 // FIXME: These tris are inset in the 1 unit arc around the corner
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500388 SkPoint p0 = sega.endPt();
389 // Position, Color, UV, D0, D1
390 verts.write(p0, color, SkPoint{0, 0}, negOneDists);
391 verts.write(p0 + sega.endNorm(), color, SkPoint{0, -SK_Scalar1}, negOneDists);
392 verts.write(p0 + segb.fMid, color, SkPoint{0, -SK_Scalar1}, negOneDists);
393 verts.write(p0 + segb.fNorms[0], color, SkPoint{0, -SK_Scalar1}, negOneDists);
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000394
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000395 idxs[*i + 0] = *v + 0;
396 idxs[*i + 1] = *v + 2;
397 idxs[*i + 2] = *v + 1;
398 idxs[*i + 3] = *v + 0;
399 idxs[*i + 4] = *v + 3;
400 idxs[*i + 5] = *v + 2;
rmistry@google.comfbfcd562012-08-23 18:09:54 +0000401
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000402 *v += 4;
403 *i += 6;
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000404
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000405 if (Segment::kLine == segb.fType) {
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000406 // we draw the line edge as a degenerate quad (u is 0, v is the
407 // signed distance to the edge)
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500408 SkPoint v1Pos = sega.endPt();
409 SkPoint v2Pos = segb.fPts[0];
410 SkScalar dist = SkPointPriv::DistanceToLineBetween(fanPt, v1Pos, v2Pos);
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000411
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500412 verts.write(fanPt, color, SkPoint{0, dist}, negOneDists);
413 verts.write(v1Pos, color, SkPoint{0, 0}, negOneDists);
414 verts.write(v2Pos, color, SkPoint{0, 0}, negOneDists);
415 verts.write(v1Pos + segb.fNorms[0], color, SkPoint{0, -SK_Scalar1}, negOneDists);
416 verts.write(v2Pos + segb.fNorms[0], color, SkPoint{0, -SK_Scalar1}, negOneDists);
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000417
cdalton35964822015-04-29 10:14:03 -0700418 idxs[*i + 0] = *v + 3;
419 idxs[*i + 1] = *v + 1;
420 idxs[*i + 2] = *v + 2;
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000421
cdalton35964822015-04-29 10:14:03 -0700422 idxs[*i + 3] = *v + 4;
423 idxs[*i + 4] = *v + 3;
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000424 idxs[*i + 5] = *v + 2;
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000425
cdalton35964822015-04-29 10:14:03 -0700426 *i += 6;
427
428 // Draw the interior fan if it exists.
429 // TODO: Detect and combine colinear segments. This will ensure we catch every case
430 // with no interior, and that the resulting shared edge uses the same endpoints.
431 if (count >= 3) {
432 idxs[*i + 0] = *v + 0;
433 idxs[*i + 1] = *v + 2;
434 idxs[*i + 2] = *v + 1;
435
436 *i += 3;
437 }
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000438
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000439 *v += 5;
bsalomon@google.com06809612012-01-21 15:03:39 +0000440 } else {
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500441 void* quadVertsBegin = verts.fPtr;
442
commit-bot@chromium.org972f9cd2014-03-28 17:58:28 +0000443 SkPoint qpts[] = {sega.endPt(), segb.fPts[0], segb.fPts[1]};
bsalomon@google.com495e2102012-01-21 14:48:36 +0000444
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500445 SkScalar c0 = segb.fNorms[0].dot(qpts[0]);
446 SkScalar c1 = segb.fNorms[1].dot(qpts[2]);
447 GrVertexWriter::Skip<SkPoint> skipUVs;
448
449 verts.write(fanPt,
450 color, skipUVs,
451 -segb.fNorms[0].dot(fanPt) + c0,
452 -segb.fNorms[1].dot(fanPt) + c1);
453
454 verts.write(qpts[0],
455 color, skipUVs,
456 0.0f,
457 -segb.fNorms[1].dot(qpts[0]) + c1);
458
459 verts.write(qpts[2],
460 color, skipUVs,
461 -segb.fNorms[0].dot(qpts[2]) + c0,
462 0.0f);
463
464 verts.write(qpts[0] + segb.fNorms[0],
465 color, skipUVs,
466 -SK_ScalarMax/100,
467 -SK_ScalarMax/100);
468
469 verts.write(qpts[2] + segb.fNorms[1],
470 color, skipUVs,
471 -SK_ScalarMax/100,
472 -SK_ScalarMax/100);
473
commit-bot@chromium.org972f9cd2014-03-28 17:58:28 +0000474 SkVector midVec = segb.fNorms[0] + segb.fNorms[1];
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000475 midVec.normalize();
bsalomon@google.com06809612012-01-21 15:03:39 +0000476
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500477 verts.write(qpts[1] + midVec,
478 color, skipUVs,
479 -SK_ScalarMax/100,
480 -SK_ScalarMax/100);
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000481
bsalomon@google.com19713172012-03-15 13:51:08 +0000482 GrPathUtils::QuadUVMatrix toUV(qpts);
Brian Osman7f4735b2019-01-02 13:55:10 +0000483 toUV.apply(quadVertsBegin, 6, vertexStride, uvOffset);
bsalomon@google.com06809612012-01-21 15:03:39 +0000484
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000485 idxs[*i + 0] = *v + 3;
486 idxs[*i + 1] = *v + 1;
487 idxs[*i + 2] = *v + 2;
488 idxs[*i + 3] = *v + 4;
489 idxs[*i + 4] = *v + 3;
490 idxs[*i + 5] = *v + 2;
bsalomon@google.com06809612012-01-21 15:03:39 +0000491
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000492 idxs[*i + 6] = *v + 5;
493 idxs[*i + 7] = *v + 3;
494 idxs[*i + 8] = *v + 4;
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000495
cdalton35964822015-04-29 10:14:03 -0700496 *i += 9;
497
498 // Draw the interior fan if it exists.
499 // TODO: Detect and combine colinear segments. This will ensure we catch every case
500 // with no interior, and that the resulting shared edge uses the same endpoints.
501 if (count >= 3) {
502 idxs[*i + 0] = *v + 0;
503 idxs[*i + 1] = *v + 2;
504 idxs[*i + 2] = *v + 1;
505
506 *i += 3;
507 }
bsalomon@google.com9aed1142012-01-30 14:28:39 +0000508
bsalomon@google.com7d9ffc82013-05-14 14:20:28 +0000509 *v += 6;
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000510 }
511 }
512}
513
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000514///////////////////////////////////////////////////////////////////////////////
515
516/*
517 * Quadratic specified by 0=u^2-v canonical coords. u and v are the first
518 * two components of the vertex attribute. Coverage is based on signed
519 * distance with negative being inside, positive outside. The edge is specified in
520 * window space (y-down). If either the third or fourth component of the interpolated
521 * 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 +0000522 * attempt to trim to a portion of the infinite quad.
523 * Requires shader derivative instruction support.
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000524 */
525
joshualitt249af152014-09-15 11:41:13 -0700526class QuadEdgeEffect : public GrGeometryProcessor {
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000527public:
Brian Osman7f4735b2019-01-02 13:55:10 +0000528 static sk_sp<GrGeometryProcessor> Make(const SkMatrix& localMatrix, bool usesLocalCoords,
529 bool wideColor) {
530 return sk_sp<GrGeometryProcessor>(
531 new QuadEdgeEffect(localMatrix, usesLocalCoords, wideColor));
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000532 }
533
Brian Salomond3b65972017-03-22 12:05:03 -0400534 ~QuadEdgeEffect() override {}
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000535
mtklein36352bf2015-03-25 18:17:31 -0700536 const char* name() const override { return "QuadEdge"; }
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000537
egdaniel57d3b032015-11-13 11:57:27 -0800538 class GLSLProcessor : public GrGLSLGeometryProcessor {
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000539 public:
Brian Salomon60fb0b22017-06-15 17:09:36 -0400540 GLSLProcessor() {}
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000541
mtklein36352bf2015-03-25 18:17:31 -0700542 void onEmitCode(EmitArgs& args, GrGPArgs* gpArgs) override {
joshualitt2dd1ae02014-12-03 06:24:10 -0800543 const QuadEdgeEffect& qe = args.fGP.cast<QuadEdgeEffect>();
egdaniel4ca2e602015-11-18 08:01:26 -0800544 GrGLSLVertexBuilder* vertBuilder = args.fVertBuilder;
egdaniel0eafe792015-11-20 14:01:22 -0800545 GrGLSLVaryingHandler* varyingHandler = args.fVaryingHandler;
egdaniel7ea439b2015-12-03 09:20:44 -0800546 GrGLSLUniformHandler* uniformHandler = args.fUniformHandler;
joshualitt2dd1ae02014-12-03 06:24:10 -0800547
joshualittabb52a12015-01-13 15:02:10 -0800548 // emit attributes
egdaniel0eafe792015-11-20 14:01:22 -0800549 varyingHandler->emitAttributes(qe);
joshualittabb52a12015-01-13 15:02:10 -0800550
Chris Dalton27372882017-12-08 13:34:21 -0700551 GrGLSLVarying v(kHalf4_GrSLType);
egdaniel0eafe792015-11-20 14:01:22 -0800552 varyingHandler->addVarying("QuadEdge", &v);
Brian Osmanf04fb3c2018-11-12 15:34:00 -0500553 vertBuilder->codeAppendf("%s = %s;", v.vsOut(), qe.fInQuadEdge.name());
Brian Salomon60fb0b22017-06-15 17:09:36 -0400554
555 // Setup pass through color
Brian Osmanf04fb3c2018-11-12 15:34:00 -0500556 varyingHandler->addPassThroughAttribute(qe.fInColor, args.fOutputColor);
joshualitt2dd1ae02014-12-03 06:24:10 -0800557
Chris Dalton60283612018-02-14 13:38:14 -0700558 GrGLSLFPFragmentBuilder* fragBuilder = args.fFragBuilder;
joshualitt9b989322014-12-15 14:16:27 -0800559
joshualittabb52a12015-01-13 15:02:10 -0800560 // Setup position
Brian Osmanf04fb3c2018-11-12 15:34:00 -0500561 this->writeOutputPosition(vertBuilder, gpArgs, qe.fInPosition.name());
joshualittabb52a12015-01-13 15:02:10 -0800562
563 // emit transforms
egdaniel7ea439b2015-12-03 09:20:44 -0800564 this->emitTransforms(vertBuilder,
egdaniel0eafe792015-11-20 14:01:22 -0800565 varyingHandler,
egdaniel7ea439b2015-12-03 09:20:44 -0800566 uniformHandler,
Brian Osmanf04fb3c2018-11-12 15:34:00 -0500567 qe.fInPosition.asShaderVar(),
Brian Salomon60fb0b22017-06-15 17:09:36 -0400568 qe.fLocalMatrix,
bsalomona624bf32016-09-20 09:12:47 -0700569 args.fFPCoordTransformHandler);
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000570
Ethan Nicholasf7b88202017-09-18 14:10:39 -0400571 fragBuilder->codeAppendf("half edgeAlpha;");
joshualitt30ba4362014-08-21 20:18:45 -0700572
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000573 // keep the derivative instructions outside the conditional
Ethan Nicholasf7b88202017-09-18 14:10:39 -0400574 fragBuilder->codeAppendf("half2 duvdx = dFdx(%s.xy);", v.fsIn());
575 fragBuilder->codeAppendf("half2 duvdy = dFdy(%s.xy);", v.fsIn());
egdaniel4ca2e602015-11-18 08:01:26 -0800576 fragBuilder->codeAppendf("if (%s.z > 0.0 && %s.w > 0.0) {", v.fsIn(), v.fsIn());
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000577 // today we know z and w are in device space. We could use derivatives
egdaniel4ca2e602015-11-18 08:01:26 -0800578 fragBuilder->codeAppendf("edgeAlpha = min(min(%s.z, %s.w) + 0.5, 1.0);", v.fsIn(),
579 v.fsIn());
580 fragBuilder->codeAppendf ("} else {");
Ethan Nicholasf7b88202017-09-18 14:10:39 -0400581 fragBuilder->codeAppendf("half2 gF = half2(2.0*%s.x*duvdx.x - duvdx.y,"
egdaniel4ca2e602015-11-18 08:01:26 -0800582 " 2.0*%s.x*duvdy.x - duvdy.y);",
583 v.fsIn(), v.fsIn());
584 fragBuilder->codeAppendf("edgeAlpha = (%s.x*%s.x - %s.y);", v.fsIn(), v.fsIn(),
585 v.fsIn());
586 fragBuilder->codeAppendf("edgeAlpha = "
Ethan Nicholas12fb9cf2018-08-03 16:16:57 -0400587 "saturate(0.5 - edgeAlpha / length(gF));}");
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000588
Ethan Nicholasf7b88202017-09-18 14:10:39 -0400589 fragBuilder->codeAppendf("%s = half4(edgeAlpha);", args.fOutputCoverage);
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000590 }
591
joshualitt9b989322014-12-15 14:16:27 -0800592 static inline void GenKey(const GrGeometryProcessor& gp,
Brian Salomon94efbf52016-11-29 13:43:05 -0500593 const GrShaderCaps&,
joshualitt9b989322014-12-15 14:16:27 -0800594 GrProcessorKeyBuilder* b) {
joshualitte3ababe2015-05-15 07:56:07 -0700595 const QuadEdgeEffect& qee = gp.cast<QuadEdgeEffect>();
Brian Salomon60fb0b22017-06-15 17:09:36 -0400596 b->add32(SkToBool(qee.fUsesLocalCoords && qee.fLocalMatrix.hasPerspective()));
joshualitt9b989322014-12-15 14:16:27 -0800597 }
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000598
egdaniel018fb622015-10-28 07:26:40 -0700599 void setData(const GrGLSLProgramDataManager& pdman,
bsalomona624bf32016-09-20 09:12:47 -0700600 const GrPrimitiveProcessor& gp,
601 FPCoordTransformIter&& transformIter) override {
joshualittb8c241a2015-05-19 08:23:30 -0700602 const QuadEdgeEffect& qe = gp.cast<QuadEdgeEffect>();
bsalomona624bf32016-09-20 09:12:47 -0700603 this->setTransformDataHelper(qe.fLocalMatrix, pdman, &transformIter);
joshualitte3ababe2015-05-15 07:56:07 -0700604 }
605
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000606 private:
egdaniele659a582015-11-13 09:55:43 -0800607 typedef GrGLSLGeometryProcessor INHERITED;
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000608 };
skia.committer@gmail.com041e2db2013-04-03 07:01:14 +0000609
Brian Salomon94efbf52016-11-29 13:43:05 -0500610 void getGLSLProcessorKey(const GrShaderCaps& caps, GrProcessorKeyBuilder* b) const override {
egdaniel57d3b032015-11-13 11:57:27 -0800611 GLSLProcessor::GenKey(*this, caps, b);
joshualitteb2a6762014-12-04 11:35:33 -0800612 }
613
Brian Salomon94efbf52016-11-29 13:43:05 -0500614 GrGLSLPrimitiveProcessor* createGLSLInstance(const GrShaderCaps&) const override {
egdaniel57d3b032015-11-13 11:57:27 -0800615 return new GLSLProcessor();
joshualitteb2a6762014-12-04 11:35:33 -0800616 }
617
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000618private:
Brian Osman7f4735b2019-01-02 13:55:10 +0000619 QuadEdgeEffect(const SkMatrix& localMatrix, bool usesLocalCoords, bool wideColor)
Ethan Nicholasabff9562017-10-09 10:54:08 -0400620 : INHERITED(kQuadEdgeEffect_ClassID)
621 , fLocalMatrix(localMatrix)
622 , fUsesLocalCoords(usesLocalCoords) {
Brian Osmanf04fb3c2018-11-12 15:34:00 -0500623 fInPosition = {"inPosition", kFloat2_GrVertexAttribType, kFloat2_GrSLType};
Brian Osman7f4735b2019-01-02 13:55:10 +0000624 fInColor = MakeColorAttribute("inColor", wideColor);
Brian Osmanf04fb3c2018-11-12 15:34:00 -0500625 fInQuadEdge = {"inQuadEdge", kFloat4_GrVertexAttribType, kHalf4_GrSLType};
626 this->setVertexAttributes(&fInPosition, 3);
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000627 }
628
Brian Osmanf04fb3c2018-11-12 15:34:00 -0500629 Attribute fInPosition;
630 Attribute fInColor;
631 Attribute fInQuadEdge;
632
Brian Salomon92be2f72018-06-19 14:33:47 -0400633 SkMatrix fLocalMatrix;
634 bool fUsesLocalCoords;
joshualitt249af152014-09-15 11:41:13 -0700635
Brian Salomon0c26a9d2017-07-06 10:09:38 -0400636 GR_DECLARE_GEOMETRY_PROCESSOR_TEST
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000637
joshualitt2e3b3e32014-12-09 13:31:14 -0800638 typedef GrGeometryProcessor INHERITED;
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000639};
640
joshualittb0a8a372014-09-23 09:50:21 -0700641GR_DEFINE_GEOMETRY_PROCESSOR_TEST(QuadEdgeEffect);
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000642
Hal Canary6f6961e2017-01-31 13:50:44 -0500643#if GR_TEST_UTILS
bungeman06ca8ec2016-06-09 08:01:03 -0700644sk_sp<GrGeometryProcessor> QuadEdgeEffect::TestCreate(GrProcessorTestData* d) {
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000645 // Doesn't work without derivative instructions.
Robert Phillips296b1cc2017-03-15 10:42:12 -0400646 return d->caps()->shaderCaps()->shaderDerivativeSupport()
Brian Osman7f4735b2019-01-02 13:55:10 +0000647 ? QuadEdgeEffect::Make(GrTest::TestMatrix(d->fRandom), d->fRandom->nextBool(),
648 d->fRandom->nextBool())
Brian Salomon9ae32a22017-01-25 14:58:24 -0500649 : nullptr;
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000650}
Hal Canary6f6961e2017-01-31 13:50:44 -0500651#endif
commit-bot@chromium.org90c240a2013-04-02 17:57:21 +0000652
653///////////////////////////////////////////////////////////////////////////////
654
Chris Dalton5ed44232017-09-07 13:22:46 -0600655GrPathRenderer::CanDrawPath
656GrAAConvexPathRenderer::onCanDrawPath(const CanDrawPathArgs& args) const {
657 if (args.fCaps->shaderCaps()->shaderDerivativeSupport() &&
658 (GrAAType::kCoverage == args.fAAType) && args.fShape->style().isSimpleFill() &&
659 !args.fShape->inverseFilled() && args.fShape->knownToBeConvex()) {
660 return CanDrawPath::kYes;
661 }
662 return CanDrawPath::kNo;
robertphillips@google.comfa662942012-05-17 12:20:22 +0000663}
664
Brian Salomon10978a62017-06-15 16:21:49 -0400665namespace {
666
667class AAConvexPathOp final : public GrMeshDrawOp {
668private:
669 using Helper = GrSimpleMeshDrawOpHelperWithStencil;
670
joshualitt27f398f2015-02-05 14:39:01 -0800671public:
Brian Salomon25a88092016-12-01 09:36:50 -0500672 DEFINE_OP_CLASS_ID
Robert Phillipsb493eeb2017-09-13 13:10:52 -0400673
Robert Phillips7c525e62018-06-12 10:11:12 -0400674 static std::unique_ptr<GrDrawOp> Make(GrContext* context,
675 GrPaint&& paint,
676 const SkMatrix& viewMatrix,
Brian Salomon10978a62017-06-15 16:21:49 -0400677 const SkPath& path,
678 const GrUserStencilSettings* stencilSettings) {
Robert Phillips7c525e62018-06-12 10:11:12 -0400679 return Helper::FactoryHelper<AAConvexPathOp>(context, std::move(paint), viewMatrix, path,
Brian Salomon10978a62017-06-15 16:21:49 -0400680 stencilSettings);
681 }
682
Brian Osmancf860852018-10-31 14:04:39 -0400683 AAConvexPathOp(const Helper::MakeArgs& helperArgs, const SkPMColor4f& color,
Brian Osman936fe7d2018-10-30 15:30:35 -0400684 const SkMatrix& viewMatrix, const SkPath& path,
685 const GrUserStencilSettings* stencilSettings)
Brian Salomon60fb0b22017-06-15 17:09:36 -0400686 : INHERITED(ClassID()), fHelper(helperArgs, GrAAType::kCoverage, stencilSettings) {
687 fPaths.emplace_back(PathData{viewMatrix, path, color});
Brian Salomon10978a62017-06-15 16:21:49 -0400688 this->setTransformedBounds(path.getBounds(), viewMatrix, HasAABloat::kYes, IsZeroArea::kNo);
Brian Osman7f4735b2019-01-02 13:55:10 +0000689 fWideColor = !SkPMColor4fFitsInBytes(color);
bsalomonf1703092016-06-29 18:41:53 -0700690 }
joshualitt27f398f2015-02-05 14:39:01 -0800691
Brian Salomond0a0a652016-12-15 15:25:22 -0500692 const char* name() const override { return "AAConvexPathOp"; }
joshualitt27f398f2015-02-05 14:39:01 -0800693
Brian Salomon7d94bb52018-10-12 14:37:19 -0400694 void visitProxies(const VisitProxyFunc& func, VisitorType) const override {
Robert Phillipsb493eeb2017-09-13 13:10:52 -0400695 fHelper.visitProxies(func);
696 }
697
Brian Osman9a390ac2018-11-12 09:47:48 -0500698#ifdef SK_DEBUG
Brian Salomon7c3e7182016-12-01 09:35:30 -0500699 SkString dumpInfo() const override {
700 SkString string;
Brian Salomon60fb0b22017-06-15 17:09:36 -0400701 string.appendf("Count: %d\n", fPaths.count());
Brian Salomon10978a62017-06-15 16:21:49 -0400702 string += fHelper.dumpInfo();
703 string += INHERITED::dumpInfo();
Brian Salomon7c3e7182016-12-01 09:35:30 -0500704 return string;
705 }
Brian Osman9a390ac2018-11-12 09:47:48 -0500706#endif
Brian Salomon7c3e7182016-12-01 09:35:30 -0500707
Brian Salomon10978a62017-06-15 16:21:49 -0400708 FixedFunctionFlags fixedFunctionFlags() const override { return fHelper.fixedFunctionFlags(); }
709
Chris Dalton4b62aed2019-01-15 11:53:00 -0700710 GrProcessorSet::Analysis finalize(const GrCaps& caps, const GrAppliedClip* clip) override {
711 return fHelper.finalizeProcessors(caps, clip, GrProcessorAnalysisCoverage::kSingleChannel,
712 &fPaths.back().fColor);
Brian Salomon10978a62017-06-15 16:21:49 -0400713 }
714
bsalomone46f9fe2015-08-18 06:05:14 -0700715private:
Brian Salomon91326c32017-08-09 16:02:19 -0400716 void onPrepareDraws(Target* target) override {
Brian Salomon49348902018-06-26 09:12:38 -0400717 auto pipe = fHelper.makePipeline(target);
Brian Salomond0a0a652016-12-15 15:25:22 -0500718 int instanceCount = fPaths.count();
joshualitt27f398f2015-02-05 14:39:01 -0800719
720 SkMatrix invert;
Brian Salomon10978a62017-06-15 16:21:49 -0400721 if (fHelper.usesLocalCoords() && !fPaths.back().fViewMatrix.invert(&invert)) {
joshualitt27f398f2015-02-05 14:39:01 -0800722 return;
723 }
724
725 // Setup GrGeometryProcessor
bungeman06ca8ec2016-06-09 08:01:03 -0700726 sk_sp<GrGeometryProcessor> quadProcessor(
Brian Osman7f4735b2019-01-02 13:55:10 +0000727 QuadEdgeEffect::Make(invert, fHelper.usesLocalCoords(), fWideColor));
728 const size_t kVertexStride = quadProcessor->vertexStride();
joshualitt27f398f2015-02-05 14:39:01 -0800729
joshualitt27f398f2015-02-05 14:39:01 -0800730 // TODO generate all segments for all paths and use one vertex buffer
731 for (int i = 0; i < instanceCount; i++) {
Brian Salomond0a0a652016-12-15 15:25:22 -0500732 const PathData& args = fPaths[i];
joshualitt27f398f2015-02-05 14:39:01 -0800733
734 // We use the fact that SkPath::transform path does subdivision based on
735 // perspective. Otherwise, we apply the view matrix when copying to the
736 // segment representation.
737 const SkMatrix* viewMatrix = &args.fViewMatrix;
joshualitt144c3c82015-11-30 12:30:13 -0800738
739 // We avoid initializing the path unless we have to
740 const SkPath* pathPtr = &args.fPath;
741 SkTLazy<SkPath> tmpPath;
joshualitt27f398f2015-02-05 14:39:01 -0800742 if (viewMatrix->hasPerspective()) {
joshualitt144c3c82015-11-30 12:30:13 -0800743 SkPath* tmpPathPtr = tmpPath.init(*pathPtr);
744 tmpPathPtr->setIsVolatile(true);
745 tmpPathPtr->transform(*viewMatrix);
joshualitt27f398f2015-02-05 14:39:01 -0800746 viewMatrix = &SkMatrix::I();
joshualitt144c3c82015-11-30 12:30:13 -0800747 pathPtr = tmpPathPtr;
joshualitt27f398f2015-02-05 14:39:01 -0800748 }
749
750 int vertexCount;
751 int indexCount;
752 enum {
753 kPreallocSegmentCnt = 512 / sizeof(Segment),
754 kPreallocDrawCnt = 4,
755 };
756 SkSTArray<kPreallocSegmentCnt, Segment, true> segments;
757 SkPoint fanPt;
758
joshualitt144c3c82015-11-30 12:30:13 -0800759 if (!get_segments(*pathPtr, *viewMatrix, &segments, &fanPt, &vertexCount,
joshualitt27f398f2015-02-05 14:39:01 -0800760 &indexCount)) {
761 continue;
762 }
763
Brian Salomon12d22642019-01-29 14:38:50 -0500764 sk_sp<const GrBuffer> vertexBuffer;
Chris Daltonbca46e22017-05-15 11:03:26 -0600765 int firstVertex;
766
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500767 GrVertexWriter verts{target->makeVertexSpace(kVertexStride, vertexCount,
768 &vertexBuffer, &firstVertex)};
bsalomone64eb572015-05-07 11:35:55 -0700769
Brian Osmand2fa2eb2018-12-26 16:48:40 -0500770 if (!verts.fPtr) {
joshualitt4b31de82015-03-05 14:33:41 -0800771 SkDebugf("Could not allocate vertices\n");
772 return;
773 }
774
Brian Salomon12d22642019-01-29 14:38:50 -0500775 sk_sp<const GrBuffer> indexBuffer;
Chris Daltonbca46e22017-05-15 11:03:26 -0600776 int firstIndex;
777
778 uint16_t *idxs = target->makeIndexSpace(indexCount, &indexBuffer, &firstIndex);
robertphillipse40d3972015-05-07 09:51:43 -0700779 if (!idxs) {
joshualitt4b31de82015-03-05 14:33:41 -0800780 SkDebugf("Could not allocate indices\n");
781 return;
782 }
783
joshualitt27f398f2015-02-05 14:39:01 -0800784 SkSTArray<kPreallocDrawCnt, Draw, true> draws;
Brian Osman7f4735b2019-01-02 13:55:10 +0000785 GrVertexColor color(args.fColor, fWideColor);
786 create_vertices(segments, fanPt, color, &draws, verts, idxs, kVertexStride);
joshualitt27f398f2015-02-05 14:39:01 -0800787
Brian Salomon7eae3e02018-08-07 14:02:38 +0000788 GrMesh* meshes = target->allocMeshes(draws.count());
robertphillips44c31282015-09-03 12:58:48 -0700789 for (int j = 0; j < draws.count(); ++j) {
790 const Draw& draw = draws[j];
Brian Salomon7eae3e02018-08-07 14:02:38 +0000791 meshes[j].setPrimitiveType(GrPrimitiveType::kTriangles);
792 meshes[j].setIndexed(indexBuffer, draw.fIndexCnt, firstIndex, 0,
793 draw.fVertexCnt - 1, GrPrimitiveRestart::kNo);
794 meshes[j].setVertexData(vertexBuffer, firstVertex);
Chris Daltonbca46e22017-05-15 11:03:26 -0600795 firstIndex += draw.fIndexCnt;
796 firstVertex += draw.fVertexCnt;
joshualitt27f398f2015-02-05 14:39:01 -0800797 }
Brian Salomonf7232642018-09-19 08:58:08 -0400798 target->draw(quadProcessor, pipe.fPipeline, pipe.fFixedDynamicState, nullptr, meshes,
Brian Salomon7eae3e02018-08-07 14:02:38 +0000799 draws.count());
joshualitt27f398f2015-02-05 14:39:01 -0800800 }
801 }
802
Brian Salomon7eae3e02018-08-07 14:02:38 +0000803 CombineResult onCombineIfPossible(GrOp* t, const GrCaps& caps) override {
Brian Salomond0a0a652016-12-15 15:25:22 -0500804 AAConvexPathOp* that = t->cast<AAConvexPathOp>();
Brian Salomon10978a62017-06-15 16:21:49 -0400805 if (!fHelper.isCompatible(that->fHelper, caps, this->bounds(), that->bounds())) {
Brian Salomon7eae3e02018-08-07 14:02:38 +0000806 return CombineResult::kCannotCombine;
joshualitt8cab9a72015-07-16 09:13:50 -0700807 }
Brian Salomon10978a62017-06-15 16:21:49 -0400808 if (fHelper.usesLocalCoords() &&
809 !fPaths[0].fViewMatrix.cheapEqualTo(that->fPaths[0].fViewMatrix)) {
Brian Salomon7eae3e02018-08-07 14:02:38 +0000810 return CombineResult::kCannotCombine;
joshualitt27f398f2015-02-05 14:39:01 -0800811 }
812
Brian Salomond0a0a652016-12-15 15:25:22 -0500813 fPaths.push_back_n(that->fPaths.count(), that->fPaths.begin());
Brian Osman7f4735b2019-01-02 13:55:10 +0000814 fWideColor |= that->fWideColor;
Brian Salomon7eae3e02018-08-07 14:02:38 +0000815 return CombineResult::kMerged;
joshualitt27f398f2015-02-05 14:39:01 -0800816 }
817
Brian Salomond0a0a652016-12-15 15:25:22 -0500818 struct PathData {
bsalomonf1703092016-06-29 18:41:53 -0700819 SkMatrix fViewMatrix;
820 SkPath fPath;
Brian Osmancf860852018-10-31 14:04:39 -0400821 SkPMColor4f fColor;
bsalomonf1703092016-06-29 18:41:53 -0700822 };
823
Brian Salomon10978a62017-06-15 16:21:49 -0400824 Helper fHelper;
Brian Salomond0a0a652016-12-15 15:25:22 -0500825 SkSTArray<1, PathData, true> fPaths;
Brian Osman7f4735b2019-01-02 13:55:10 +0000826 bool fWideColor;
reed1b55a962015-09-17 20:16:13 -0700827
Brian Salomon10978a62017-06-15 16:21:49 -0400828 typedef GrMeshDrawOp INHERITED;
joshualitt27f398f2015-02-05 14:39:01 -0800829};
830
Brian Salomon10978a62017-06-15 16:21:49 -0400831} // anonymous namespace
832
bsalomon0aff2fa2015-07-31 06:48:27 -0700833bool GrAAConvexPathRenderer::onDrawPath(const DrawPathArgs& args) {
Brian Osman11052242016-10-27 14:47:55 -0400834 GR_AUDIT_TRAIL_AUTO_FRAME(args.fRenderTargetContext->auditTrail(),
robertphillips976f5f02016-06-03 10:59:20 -0700835 "GrAAConvexPathRenderer::onDrawPath");
Brian Salomon7c8460e2017-05-12 11:36:10 -0400836 SkASSERT(GrFSAAType::kUnifiedMSAA != args.fRenderTargetContext->fsaaType());
bsalomon8acedde2016-06-24 10:42:16 -0700837 SkASSERT(!args.fShape->isEmpty());
bsalomon@google.com4647f902013-03-26 14:45:27 +0000838
bsalomonf1703092016-06-29 18:41:53 -0700839 SkPath path;
840 args.fShape->asPath(&path);
bsalomon@google.comaf90f7f2012-03-05 20:50:10 +0000841
Robert Phillips7c525e62018-06-12 10:11:12 -0400842 std::unique_ptr<GrDrawOp> op = AAConvexPathOp::Make(args.fContext, std::move(args.fPaint),
843 *args.fViewMatrix,
Brian Salomon10978a62017-06-15 16:21:49 -0400844 path, args.fUserStencilSettings);
845 args.fRenderTargetContext->addDrawOp(*args.fClip, std::move(op));
bsalomon@google.comc2099d22012-03-02 21:26:50 +0000846 return true;
bsalomon@google.com69cc6ad2012-01-17 14:25:10 +0000847}
joshualitt8e5c1772015-05-11 08:58:52 -0700848
849///////////////////////////////////////////////////////////////////////////////////////////////////
850
Hal Canary6f6961e2017-01-31 13:50:44 -0500851#if GR_TEST_UTILS
joshualitt8e5c1772015-05-11 08:58:52 -0700852
Brian Salomon10978a62017-06-15 16:21:49 -0400853GR_DRAW_OP_TEST_DEFINE(AAConvexPathOp) {
bsalomonf1703092016-06-29 18:41:53 -0700854 SkMatrix viewMatrix = GrTest::TestMatrixInvertible(random);
855 SkPath path = GrTest::TestPathConvex(random);
Brian Salomon10978a62017-06-15 16:21:49 -0400856 const GrUserStencilSettings* stencilSettings = GrGetRandomStencil(random, context);
Robert Phillips7c525e62018-06-12 10:11:12 -0400857 return AAConvexPathOp::Make(context, std::move(paint), viewMatrix, path, stencilSettings);
joshualitt8e5c1772015-05-11 08:58:52 -0700858}
859
860#endif