blob: f734453e5e9e37f5970160973b1d0d4ee28fda85 [file] [log] [blame]
Chris Dalton1a325d22017-07-14 15:17:41 -06001/*
2 * Copyright 2017 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
Chris Dalton383a2ef2018-01-08 17:21:41 -05008#ifndef GrCCCoverageProcessor_DEFINED
9#define GrCCCoverageProcessor_DEFINED
Chris Dalton1a325d22017-07-14 15:17:41 -060010
Mike Kleinc0bd9f92019-04-23 12:05:21 -050011#include "include/private/SkNx.h"
12#include "src/gpu/GrCaps.h"
13#include "src/gpu/GrGeometryProcessor.h"
14#include "src/gpu/GrPipeline.h"
15#include "src/gpu/GrShaderCaps.h"
16#include "src/gpu/glsl/GrGLSLGeometryProcessor.h"
Robert Phillips03e4c952019-11-26 16:20:22 -050017#include "src/gpu/glsl/GrGLSLShaderBuilder.h"
Mike Kleinc0bd9f92019-04-23 12:05:21 -050018#include "src/gpu/glsl/GrGLSLVarying.h"
Chris Dalton1a325d22017-07-14 15:17:41 -060019
Chris Dalton60283612018-02-14 13:38:14 -070020class GrGLSLFPFragmentBuilder;
Chris Dalton1fbdb612017-12-12 12:48:47 -070021class GrGLSLVertexGeoBuilder;
Chris Dalton8dfc70f2018-03-26 19:15:22 -060022class GrOpFlushState;
Chris Dalton1a325d22017-07-14 15:17:41 -060023
24/**
Chris Dalton1fbdb612017-12-12 12:48:47 -070025 * This is the geometry processor for the simple convex primitive shapes (triangles and closed,
26 * convex bezier curves) from which ccpr paths are composed. The output is a single-channel alpha
27 * value, positive for clockwise shapes and negative for counter-clockwise, that indicates coverage.
Chris Dalton1a325d22017-07-14 15:17:41 -060028 *
Chris Dalton8dfc70f2018-03-26 19:15:22 -060029 * The caller is responsible to draw all primitives as produced by GrCCGeometry into a cleared,
30 * floating point, alpha-only render target using SkBlendMode::kPlus. Once all of a path's
31 * primitives have been drawn, the render target contains a composite coverage count that can then
32 * be used to draw the path (see GrCCPathProcessor).
Chris Dalton1a325d22017-07-14 15:17:41 -060033 *
Chris Dalton8dfc70f2018-03-26 19:15:22 -060034 * To draw primitives, use appendMesh() and draw() (defined below).
Chris Dalton1a325d22017-07-14 15:17:41 -060035 */
Chris Dalton383a2ef2018-01-08 17:21:41 -050036class GrCCCoverageProcessor : public GrGeometryProcessor {
Chris Dalton1a325d22017-07-14 15:17:41 -060037public:
Chris Dalton8dfc70f2018-03-26 19:15:22 -060038 enum class PrimitiveType {
39 kTriangles,
Chris Dalton2c5e0112019-03-29 13:14:18 -050040 kWeightedTriangles, // Triangles (from the tessellator) whose winding magnitude > 1.
Chris Dalton8dfc70f2018-03-26 19:15:22 -060041 kQuadratics,
42 kCubics,
Chris Dalton9f2dab02018-04-18 14:07:03 -060043 kConics
Chris Dalton8dfc70f2018-03-26 19:15:22 -060044 };
45 static const char* PrimitiveTypeName(PrimitiveType);
46
Chris Dalton84403d72018-02-13 21:46:17 -050047 // Defines a single primitive shape with 3 input points (i.e. Triangles and Quadratics).
48 // X,Y point values are transposed.
49 struct TriPointInstance {
Chris Daltonc3318f02019-07-19 14:20:53 -060050 float fValues[6];
Chris Daltonc1e59632017-09-05 00:30:07 -060051
Chris Daltonc3318f02019-07-19 14:20:53 -060052 enum class Ordering : bool {
53 kXYTransposed,
54 kXYInterleaved,
55 };
56
57 void set(const SkPoint[3], const Sk2f& translate, Ordering);
58 void set(const SkPoint&, const SkPoint&, const SkPoint&, const Sk2f& translate, Ordering);
59 void set(const Sk2f& P0, const Sk2f& P1, const Sk2f& P2, const Sk2f& translate, Ordering);
Chris Daltonc1e59632017-09-05 00:30:07 -060060 };
61
Chris Dalton9f2dab02018-04-18 14:07:03 -060062 // Defines a single primitive shape with 4 input points, or 3 input points plus a "weight"
63 // parameter duplicated in both lanes of the 4th input (i.e. Cubics, Conics, and Triangles with
64 // a weighted winding number). X,Y point values are transposed.
Chris Dalton84403d72018-02-13 21:46:17 -050065 struct QuadPointInstance {
Chris Daltona3e92712017-12-04 11:45:51 -070066 float fX[4];
67 float fY[4];
68
69 void set(const SkPoint[4], float dx, float dy);
Chris Dalton9f2dab02018-04-18 14:07:03 -060070 void setW(const SkPoint[3], const Sk2f& trans, float w);
Chris Dalton703b4762018-04-06 16:11:48 -060071 void setW(const SkPoint&, const SkPoint&, const SkPoint&, const Sk2f& trans, float w);
Chris Dalton09a7bb22018-08-31 19:53:15 +080072 void setW(const Sk2f& P0, const Sk2f& P1, const Sk2f& P2, const Sk2f& trans, float w);
Chris Daltona3e92712017-12-04 11:45:51 -070073 };
Chris Daltonbaf3e782018-03-08 15:55:58 +000074
Chris Dalton2c5e0112019-03-29 13:14:18 -050075 PrimitiveType primitiveType() const { return fPrimitiveType; }
76
77 // Number of bezier points for curves, or 3 for triangles.
78 int numInputPoints() const { return PrimitiveType::kCubics == fPrimitiveType ? 4 : 3; }
79
80 bool isTriangles() const {
81 return PrimitiveType::kTriangles == fPrimitiveType ||
82 PrimitiveType::kWeightedTriangles == fPrimitiveType;
83 }
84
85 int hasInputWeight() const {
86 return PrimitiveType::kWeightedTriangles == fPrimitiveType ||
87 PrimitiveType::kConics == fPrimitiveType;
Chris Daltona3e92712017-12-04 11:45:51 -070088 }
89
Chris Dalton23261772017-12-10 16:41:45 -070090 // GrPrimitiveProcessor overrides.
Chris Dalton8dfc70f2018-03-26 19:15:22 -060091 const char* name() const override { return PrimitiveTypeName(fPrimitiveType); }
Chris Dalton2c5e0112019-03-29 13:14:18 -050092 void getGLSLProcessorKey(const GrShaderCaps&, GrProcessorKeyBuilder* b) const override {
93 SkDEBUGCODE(this->getDebugBloatKey(b));
94 b->add32((int)fPrimitiveType);
95 }
96 GrGLSLPrimitiveProcessor* createGLSLInstance(const GrShaderCaps&) const final;
Chris Dalton23261772017-12-10 16:41:45 -070097
98#ifdef SK_DEBUG
Chris Dalton8d38a7f2018-03-19 14:16:44 -060099 // Increases the 1/2 pixel AA bloat by a factor of debugBloat.
100 void enableDebugBloat(float debugBloat) { fDebugBloat = debugBloat; }
101 bool debugBloatEnabled() const { return fDebugBloat > 0; }
102 float debugBloat() const { SkASSERT(this->debugBloatEnabled()); return fDebugBloat; }
Chris Dalton2c5e0112019-03-29 13:14:18 -0500103 void getDebugBloatKey(GrProcessorKeyBuilder* b) const {
104 uint32_t bloatBits;
105 memcpy(&bloatBits, &fDebugBloat, 4);
106 b->add32(bloatBits);
107 }
Chris Dalton23261772017-12-10 16:41:45 -0700108#endif
109
Chris Dalton39ca9732020-03-10 10:34:17 -0600110 // The caller uses these methods to actualy draw the coverage PrimitiveTypes. For each
111 // subpassIdx of each PrimitiveType, it calls reset/bind*/drawInstances.
112 virtual int numSubpasses() const = 0;
113 virtual void reset(PrimitiveType, int subpassIdx, GrResourceProvider*) = 0;
114 void bindPipeline(GrOpFlushState*, const GrPipeline&, const SkRect& drawBounds) const;
Greg Daniel426274b2020-07-20 11:37:38 -0400115 virtual void bindBuffers(GrOpsRenderPass*, sk_sp<const GrBuffer> instanceBuffer) const = 0;
Chris Dalton39ca9732020-03-10 10:34:17 -0600116 virtual void drawInstances(GrOpsRenderPass*, int instanceCount, int baseInstance) const = 0;
Robert Phillipscea290f2019-11-06 11:21:03 -0500117
Chris Daltonfe462ef2018-03-08 15:54:01 +0000118 // The Shader provides code to calculate each pixel's coverage in a RenderPass. It also
119 // provides details about shape-specific geometry.
Chris Dalton6a3dbee2017-10-16 10:44:41 -0600120 class Shader {
121 public:
Chris Dalton84d36cd2019-04-17 14:47:17 -0600122 // Returns true if the Impl should not calculate the coverage argument for emitVaryings().
123 // If true, then "coverage" will have a signed magnitude of 1.
124 virtual bool calculatesOwnEdgeCoverage() const { return false; }
125
Chris Dalton21ba5512018-03-21 17:20:21 -0600126 // Called before generating geometry. Subclasses may set up internal member variables during
127 // this time that will be needed during onEmitVaryings (e.g. transformation matrices).
Chris Daltonfe462ef2018-03-08 15:54:01 +0000128 //
Chris Dalton9713dcf2018-04-10 00:48:41 -0600129 // If the 'outHull4' parameter is provided, and there are not 4 input points, the subclass
130 // is required to fill it with the name of a 4-point hull around which the Impl can generate
131 // its geometry. If it is left unchanged, the Impl will use the regular input points.
Chris Dalton84d36cd2019-04-17 14:47:17 -0600132 virtual void emitSetupCode(
133 GrGLSLVertexGeoBuilder*, const char* pts, const char** outHull4 = nullptr) const {
Chris Dalton9713dcf2018-04-10 00:48:41 -0600134 SkASSERT(!outHull4);
135 }
Chris Daltonfe462ef2018-03-08 15:54:01 +0000136
Chris Dalton84d36cd2019-04-17 14:47:17 -0600137 void emitVaryings(
138 GrGLSLVaryingHandler* varyingHandler, GrGLSLVarying::Scope scope, SkString* code,
139 const char* position, const char* coverage, const char* cornerCoverage,
140 const char* wind) {
Chris Daltonfe462ef2018-03-08 15:54:01 +0000141 SkASSERT(GrGLSLVarying::Scope::kVertToGeo != scope);
Chris Dalton84d36cd2019-04-17 14:47:17 -0600142 this->onEmitVaryings(
143 varyingHandler, scope, code, position, coverage, cornerCoverage, wind);
Chris Daltonfe462ef2018-03-08 15:54:01 +0000144 }
Chris Dalton622650a2018-03-07 17:30:10 -0700145
Chris Daltonc3318f02019-07-19 14:20:53 -0600146 // Writes the signed coverage value at the current pixel to "outputCoverage".
147 virtual void emitFragmentCoverageCode(
148 GrGLSLFPFragmentBuilder*, const char* outputCoverage) const = 0;
149
150 // Assigns the built-in sample mask at the current pixel.
151 virtual void emitSampleMaskCode(GrGLSLFPFragmentBuilder*) const = 0;
Chris Dalton6a3dbee2017-10-16 10:44:41 -0600152
Chris Dalton6f5e77a2018-04-23 21:14:42 -0600153 // Calculates the winding direction of the input points (+1, -1, or 0). Wind for extremely
154 // thin triangles gets rounded to zero.
155 static void CalcWind(const GrCCCoverageProcessor&, GrGLSLVertexGeoBuilder*, const char* pts,
156 const char* outputWind);
157
Chris Dalton0a793812018-03-07 11:18:30 -0700158 // Calculates an edge's coverage at a conservative raster vertex. The edge is defined by two
159 // clockwise-ordered points, 'leftPt' and 'rightPt'. 'rasterVertexDir' is a pair of +/-1
160 // values that point in the direction of conservative raster bloat, starting from an
161 // endpoint.
162 //
163 // Coverage values ramp from -1 (completely outside the edge) to 0 (completely inside).
164 static void CalcEdgeCoverageAtBloatVertex(GrGLSLVertexGeoBuilder*, const char* leftPt,
165 const char* rightPt, const char* rasterVertexDir,
166 const char* outputCoverage);
167
Chris Dalton8738cf42018-03-09 11:57:40 -0700168 // Calculates an edge's coverage at two conservative raster vertices.
169 // (See CalcEdgeCoverageAtBloatVertex).
170 static void CalcEdgeCoveragesAtBloatVertices(GrGLSLVertexGeoBuilder*, const char* leftPt,
171 const char* rightPt, const char* bloatDir1,
172 const char* bloatDir2,
173 const char* outputCoverages);
174
Chris Dalton04a1de52018-03-14 02:04:09 -0600175 // Corner boxes require an additional "attenuation" varying that is multiplied by the
176 // regular (linearly-interpolated) coverage. This function calculates the attenuation value
177 // to use in the single, outermost vertex. The remaining three vertices of the corner box
178 // all use an attenuation value of 1.
Chris Dalton4c239342018-04-05 18:43:40 -0600179 static void CalcCornerAttenuation(GrGLSLVertexGeoBuilder*, const char* leftDir,
180 const char* rightDir, const char* outputAttenuation);
Chris Dalton04a1de52018-03-14 02:04:09 -0600181
Chris Dalton6a3dbee2017-10-16 10:44:41 -0600182 virtual ~Shader() {}
183
184 protected:
Chris Dalton622650a2018-03-07 17:30:10 -0700185 // Here the subclass adds its internal varyings to the handler and produces code to
Chris Dalton21ba5512018-03-21 17:20:21 -0600186 // initialize those varyings from a given position and coverage values.
Chris Dalton622650a2018-03-07 17:30:10 -0700187 //
Chris Dalton21ba5512018-03-21 17:20:21 -0600188 // NOTE: the coverage values are signed appropriately for wind.
189 // 'coverage' will only be +1 or -1 on curves.
Chris Dalton84d36cd2019-04-17 14:47:17 -0600190 virtual void onEmitVaryings(
191 GrGLSLVaryingHandler*, GrGLSLVarying::Scope, SkString* code, const char* position,
192 const char* coverage, const char* cornerCoverage, const char* wind) = 0;
Chris Dalton622650a2018-03-07 17:30:10 -0700193
Chris Dalton90e8fb12017-12-22 02:24:53 -0700194 // Returns the name of a Shader's internal varying at the point where where its value is
195 // assigned. This is intended to work whether called for a vertex or a geometry shader.
196 const char* OutName(const GrGLSLVarying& varying) const {
197 using Scope = GrGLSLVarying::Scope;
198 SkASSERT(Scope::kVertToGeo != varying.scope());
199 return Scope::kGeoToFrag == varying.scope() ? varying.gsOut() : varying.vsOut();
200 }
Chris Dalton4c239342018-04-05 18:43:40 -0600201
Chris Dalton2c5e0112019-03-29 13:14:18 -0500202 // Our friendship with GrGLSLShaderBuilder does not propagate to subclasses.
Chris Dalton4c239342018-04-05 18:43:40 -0600203 inline static SkString& AccessCodeString(GrGLSLShaderBuilder* s) { return s->code(); }
Chris Dalton6a3dbee2017-10-16 10:44:41 -0600204 };
205
Chris Dalton2c5e0112019-03-29 13:14:18 -0500206protected:
Chris Dalton1a325d22017-07-14 15:17:41 -0600207 // Slightly undershoot a bloat radius of 0.5 so vertices that fall on integer boundaries don't
208 // accidentally bleed into neighbor pixels.
209 static constexpr float kAABloatRadius = 0.491111f;
210
Chris Dalton2c5e0112019-03-29 13:14:18 -0500211 GrCCCoverageProcessor(ClassID classID) : INHERITED(classID) {}
Chris Dalton1fbdb612017-12-12 12:48:47 -0700212
Chris Dalton39ca9732020-03-10 10:34:17 -0600213 virtual GrPrimitiveType primType() const = 0;
214
Chris Dalton2c5e0112019-03-29 13:14:18 -0500215 virtual GrGLSLPrimitiveProcessor* onCreateGLSLInstance(std::unique_ptr<Shader>) const = 0;
Chris Dalton6f5e77a2018-04-23 21:14:42 -0600216
Chris Dalton2c5e0112019-03-29 13:14:18 -0500217 // Our friendship with GrGLSLShaderBuilder does not propagate to subclasses.
218 inline static SkString& AccessCodeString(GrGLSLShaderBuilder* s) { return s->code(); }
Chris Dalton9f2dab02018-04-18 14:07:03 -0600219
Chris Dalton2c5e0112019-03-29 13:14:18 -0500220 PrimitiveType fPrimitiveType;
Chris Dalton383a2ef2018-01-08 17:21:41 -0500221 SkDEBUGCODE(float fDebugBloat = 0);
Chris Dalton1a325d22017-07-14 15:17:41 -0600222
Chris Dalton2c5e0112019-03-29 13:14:18 -0500223 class TriangleShader;
Chris Dalton27059d32018-01-23 14:06:50 -0700224
Chris Dalton6a3dbee2017-10-16 10:44:41 -0600225 typedef GrGeometryProcessor INHERITED;
Chris Dalton1a325d22017-07-14 15:17:41 -0600226};
227
Chris Dalton8dfc70f2018-03-26 19:15:22 -0600228inline const char* GrCCCoverageProcessor::PrimitiveTypeName(PrimitiveType type) {
229 switch (type) {
230 case PrimitiveType::kTriangles: return "kTriangles";
Chris Dalton703b4762018-04-06 16:11:48 -0600231 case PrimitiveType::kWeightedTriangles: return "kWeightedTriangles";
Chris Dalton8dfc70f2018-03-26 19:15:22 -0600232 case PrimitiveType::kQuadratics: return "kQuadratics";
233 case PrimitiveType::kCubics: return "kCubics";
Chris Dalton9f2dab02018-04-18 14:07:03 -0600234 case PrimitiveType::kConics: return "kConics";
Chris Dalton8dfc70f2018-03-26 19:15:22 -0600235 }
236 SK_ABORT("Invalid PrimitiveType");
Chris Dalton8dfc70f2018-03-26 19:15:22 -0600237}
238
Chris Daltonc3318f02019-07-19 14:20:53 -0600239inline void GrCCCoverageProcessor::TriPointInstance::set(
240 const SkPoint p[3], const Sk2f& translate, Ordering ordering) {
241 this->set(p[0], p[1], p[2], translate, ordering);
Chris Daltona3e92712017-12-04 11:45:51 -0700242}
243
Chris Daltonc3318f02019-07-19 14:20:53 -0600244inline void GrCCCoverageProcessor::TriPointInstance::set(
245 const SkPoint& p0, const SkPoint& p1, const SkPoint& p2, const Sk2f& translate,
246 Ordering ordering) {
Chris Dalton09a7bb22018-08-31 19:53:15 +0800247 Sk2f P0 = Sk2f::Load(&p0);
248 Sk2f P1 = Sk2f::Load(&p1);
249 Sk2f P2 = Sk2f::Load(&p2);
Chris Daltonc3318f02019-07-19 14:20:53 -0600250 this->set(P0, P1, P2, translate, ordering);
Chris Dalton09a7bb22018-08-31 19:53:15 +0800251}
252
Chris Daltonc3318f02019-07-19 14:20:53 -0600253inline void GrCCCoverageProcessor::TriPointInstance::set(
254 const Sk2f& P0, const Sk2f& P1, const Sk2f& P2, const Sk2f& translate, Ordering ordering) {
255 if (Ordering::kXYTransposed == ordering) {
256 Sk2f::Store3(fValues, P0 + translate, P1 + translate, P2 + translate);
257 } else {
258 (P0 + translate).store(fValues);
259 (P1 + translate).store(fValues + 2);
260 (P2 + translate).store(fValues + 4);
261 }
Chris Daltona3e92712017-12-04 11:45:51 -0700262}
263
Chris Dalton84403d72018-02-13 21:46:17 -0500264inline void GrCCCoverageProcessor::QuadPointInstance::set(const SkPoint p[4], float dx, float dy) {
Chris Daltona3e92712017-12-04 11:45:51 -0700265 Sk4f X,Y;
266 Sk4f::Load2(p, &X, &Y);
267 (X + dx).store(&fX);
268 (Y + dy).store(&fY);
269}
270
Chris Dalton9f2dab02018-04-18 14:07:03 -0600271inline void GrCCCoverageProcessor::QuadPointInstance::setW(const SkPoint p[3], const Sk2f& trans,
272 float w) {
273 this->setW(p[0], p[1], p[2], trans, w);
274}
275
Chris Dalton703b4762018-04-06 16:11:48 -0600276inline void GrCCCoverageProcessor::QuadPointInstance::setW(const SkPoint& p0, const SkPoint& p1,
277 const SkPoint& p2, const Sk2f& trans,
278 float w) {
Chris Dalton09a7bb22018-08-31 19:53:15 +0800279 Sk2f P0 = Sk2f::Load(&p0);
280 Sk2f P1 = Sk2f::Load(&p1);
281 Sk2f P2 = Sk2f::Load(&p2);
282 this->setW(P0, P1, P2, trans, w);
283}
284
285inline void GrCCCoverageProcessor::QuadPointInstance::setW(const Sk2f& P0, const Sk2f& P1,
286 const Sk2f& P2, const Sk2f& trans,
287 float w) {
Chris Dalton84403d72018-02-13 21:46:17 -0500288 Sk2f W = Sk2f(w);
Chris Dalton09a7bb22018-08-31 19:53:15 +0800289 Sk2f::Store4(this, P0 + trans, P1 + trans, P2 + trans, W);
Chris Dalton84403d72018-02-13 21:46:17 -0500290}
291
Chris Dalton1a325d22017-07-14 15:17:41 -0600292#endif