blob: a7068a4b7bec5591b99ba5ded86da7f04b2785b6 [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
Chris Dalton27059d32018-01-23 14:06:50 -070011#include "GrCaps.h"
Chris Dalton1a325d22017-07-14 15:17:41 -060012#include "GrGeometryProcessor.h"
Chris Dalton8dfc70f2018-03-26 19:15:22 -060013#include "GrPipeline.h"
Chris Dalton90e8fb12017-12-22 02:24:53 -070014#include "GrShaderCaps.h"
Chris Daltona3e92712017-12-04 11:45:51 -070015#include "SkNx.h"
Chris Dalton1a325d22017-07-14 15:17:41 -060016#include "glsl/GrGLSLGeometryProcessor.h"
17#include "glsl/GrGLSLVarying.h"
18
Chris Dalton60283612018-02-14 13:38:14 -070019class GrGLSLFPFragmentBuilder;
Chris Dalton1fbdb612017-12-12 12:48:47 -070020class GrGLSLVertexGeoBuilder;
Chris Dalton23261772017-12-10 16:41:45 -070021class GrMesh;
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 Daltona3e92712017-12-04 11:45:51 -070050 float fX[3];
51 float fY[3];
Chris Daltonc1e59632017-09-05 00:30:07 -060052
Chris Daltona3e92712017-12-04 11:45:51 -070053 void set(const SkPoint[3], const Sk2f& trans);
54 void set(const SkPoint&, const SkPoint&, const SkPoint&, const Sk2f& trans);
Chris Dalton09a7bb22018-08-31 19:53:15 +080055 void set(const Sk2f& P0, const Sk2f& P1, const Sk2f& P2, const Sk2f& trans);
Chris Daltonc1e59632017-09-05 00:30:07 -060056 };
57
Chris Dalton9f2dab02018-04-18 14:07:03 -060058 // Defines a single primitive shape with 4 input points, or 3 input points plus a "weight"
59 // parameter duplicated in both lanes of the 4th input (i.e. Cubics, Conics, and Triangles with
60 // a weighted winding number). X,Y point values are transposed.
Chris Dalton84403d72018-02-13 21:46:17 -050061 struct QuadPointInstance {
Chris Daltona3e92712017-12-04 11:45:51 -070062 float fX[4];
63 float fY[4];
64
65 void set(const SkPoint[4], float dx, float dy);
Chris Dalton9f2dab02018-04-18 14:07:03 -060066 void setW(const SkPoint[3], const Sk2f& trans, float w);
Chris Dalton703b4762018-04-06 16:11:48 -060067 void setW(const SkPoint&, const SkPoint&, const SkPoint&, const Sk2f& trans, float w);
Chris Dalton09a7bb22018-08-31 19:53:15 +080068 void setW(const Sk2f& P0, const Sk2f& P1, const Sk2f& P2, const Sk2f& trans, float w);
Chris Daltona3e92712017-12-04 11:45:51 -070069 };
Chris Daltonbaf3e782018-03-08 15:55:58 +000070
Chris Dalton2c5e0112019-03-29 13:14:18 -050071 virtual void reset(PrimitiveType, GrResourceProvider*) = 0;
72
73 PrimitiveType primitiveType() const { return fPrimitiveType; }
74
75 // Number of bezier points for curves, or 3 for triangles.
76 int numInputPoints() const { return PrimitiveType::kCubics == fPrimitiveType ? 4 : 3; }
77
78 bool isTriangles() const {
79 return PrimitiveType::kTriangles == fPrimitiveType ||
80 PrimitiveType::kWeightedTriangles == fPrimitiveType;
81 }
82
83 int hasInputWeight() const {
84 return PrimitiveType::kWeightedTriangles == fPrimitiveType ||
85 PrimitiveType::kConics == fPrimitiveType;
Chris Daltona3e92712017-12-04 11:45:51 -070086 }
87
Chris Dalton23261772017-12-10 16:41:45 -070088 // GrPrimitiveProcessor overrides.
Chris Dalton8dfc70f2018-03-26 19:15:22 -060089 const char* name() const override { return PrimitiveTypeName(fPrimitiveType); }
Brian Osman9a390ac2018-11-12 09:47:48 -050090#ifdef SK_DEBUG
Chris Dalton23261772017-12-10 16:41:45 -070091 SkString dumpInfo() const override {
92 return SkStringPrintf("%s\n%s", this->name(), this->INHERITED::dumpInfo().c_str());
93 }
Brian Osman9a390ac2018-11-12 09:47:48 -050094#endif
Chris Dalton2c5e0112019-03-29 13:14:18 -050095 void getGLSLProcessorKey(const GrShaderCaps&, GrProcessorKeyBuilder* b) const override {
96 SkDEBUGCODE(this->getDebugBloatKey(b));
97 b->add32((int)fPrimitiveType);
98 }
99 GrGLSLPrimitiveProcessor* createGLSLInstance(const GrShaderCaps&) const final;
Chris Dalton23261772017-12-10 16:41:45 -0700100
101#ifdef SK_DEBUG
Chris Dalton8d38a7f2018-03-19 14:16:44 -0600102 // Increases the 1/2 pixel AA bloat by a factor of debugBloat.
103 void enableDebugBloat(float debugBloat) { fDebugBloat = debugBloat; }
104 bool debugBloatEnabled() const { return fDebugBloat > 0; }
105 float debugBloat() const { SkASSERT(this->debugBloatEnabled()); return fDebugBloat; }
Chris Dalton2c5e0112019-03-29 13:14:18 -0500106 void getDebugBloatKey(GrProcessorKeyBuilder* b) const {
107 uint32_t bloatBits;
108 memcpy(&bloatBits, &fDebugBloat, 4);
109 b->add32(bloatBits);
110 }
Chris Dalton23261772017-12-10 16:41:45 -0700111#endif
112
Chris Dalton8738cf42018-03-09 11:57:40 -0700113 // Appends a GrMesh that will draw the provided instances. The instanceBuffer must be an array
114 // of either TriPointInstance or QuadPointInstance, depending on this processor's RendererPass,
115 // with coordinates in the desired shape's final atlas-space position.
Chris Dalton2c5e0112019-03-29 13:14:18 -0500116 virtual void appendMesh(sk_sp<const GrGpuBuffer> instanceBuffer, int instanceCount,
117 int baseInstance, SkTArray<GrMesh>* out) const = 0;
Chris Dalton8738cf42018-03-09 11:57:40 -0700118
Chris Dalton2c5e0112019-03-29 13:14:18 -0500119 virtual void draw(GrOpFlushState*, const GrPipeline&, const SkIRect scissorRects[],
120 const GrMesh[], int meshCount, const SkRect& drawBounds) const;
Chris Dalton8dfc70f2018-03-26 19:15:22 -0600121
Chris Daltonfe462ef2018-03-08 15:54:01 +0000122 // The Shader provides code to calculate each pixel's coverage in a RenderPass. It also
123 // provides details about shape-specific geometry.
Chris Dalton6a3dbee2017-10-16 10:44:41 -0600124 class Shader {
125 public:
Chris Dalton84d36cd2019-04-17 14:47:17 -0600126 // Returns true if the Impl should not calculate the coverage argument for emitVaryings().
127 // If true, then "coverage" will have a signed magnitude of 1.
128 virtual bool calculatesOwnEdgeCoverage() const { return false; }
129
Chris Dalton21ba5512018-03-21 17:20:21 -0600130 // Called before generating geometry. Subclasses may set up internal member variables during
131 // this time that will be needed during onEmitVaryings (e.g. transformation matrices).
Chris Daltonfe462ef2018-03-08 15:54:01 +0000132 //
Chris Dalton9713dcf2018-04-10 00:48:41 -0600133 // If the 'outHull4' parameter is provided, and there are not 4 input points, the subclass
134 // is required to fill it with the name of a 4-point hull around which the Impl can generate
135 // its geometry. If it is left unchanged, the Impl will use the regular input points.
Chris Dalton84d36cd2019-04-17 14:47:17 -0600136 virtual void emitSetupCode(
137 GrGLSLVertexGeoBuilder*, const char* pts, const char** outHull4 = nullptr) const {
Chris Dalton9713dcf2018-04-10 00:48:41 -0600138 SkASSERT(!outHull4);
139 }
Chris Daltonfe462ef2018-03-08 15:54:01 +0000140
Chris Dalton84d36cd2019-04-17 14:47:17 -0600141 void emitVaryings(
142 GrGLSLVaryingHandler* varyingHandler, GrGLSLVarying::Scope scope, SkString* code,
143 const char* position, const char* coverage, const char* cornerCoverage,
144 const char* wind) {
Chris Daltonfe462ef2018-03-08 15:54:01 +0000145 SkASSERT(GrGLSLVarying::Scope::kVertToGeo != scope);
Chris Dalton84d36cd2019-04-17 14:47:17 -0600146 this->onEmitVaryings(
147 varyingHandler, scope, code, position, coverage, cornerCoverage, wind);
Chris Daltonfe462ef2018-03-08 15:54:01 +0000148 }
Chris Dalton622650a2018-03-07 17:30:10 -0700149
Chris Dalton0a793812018-03-07 11:18:30 -0700150 void emitFragmentCode(const GrCCCoverageProcessor&, GrGLSLFPFragmentBuilder*,
Chris Dalton6a3dbee2017-10-16 10:44:41 -0600151 const char* skOutputColor, const char* skOutputCoverage) const;
152
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 Daltonfe462ef2018-03-08 15:54:01 +0000194 // Emits the fragment code that calculates a pixel's signed coverage value.
Chris Daltonbaf3e782018-03-08 15:55:58 +0000195 virtual void onEmitFragmentCode(GrGLSLFPFragmentBuilder*,
Chris Daltonfe462ef2018-03-08 15:54:01 +0000196 const char* outputCoverage) const = 0;
Chris Dalton6a3dbee2017-10-16 10:44:41 -0600197
Chris Dalton90e8fb12017-12-22 02:24:53 -0700198 // Returns the name of a Shader's internal varying at the point where where its value is
199 // assigned. This is intended to work whether called for a vertex or a geometry shader.
200 const char* OutName(const GrGLSLVarying& varying) const {
201 using Scope = GrGLSLVarying::Scope;
202 SkASSERT(Scope::kVertToGeo != varying.scope());
203 return Scope::kGeoToFrag == varying.scope() ? varying.gsOut() : varying.vsOut();
204 }
Chris Dalton4c239342018-04-05 18:43:40 -0600205
Chris Dalton2c5e0112019-03-29 13:14:18 -0500206 // Our friendship with GrGLSLShaderBuilder does not propagate to subclasses.
Chris Dalton4c239342018-04-05 18:43:40 -0600207 inline static SkString& AccessCodeString(GrGLSLShaderBuilder* s) { return s->code(); }
Chris Dalton6a3dbee2017-10-16 10:44:41 -0600208 };
209
Chris Dalton2c5e0112019-03-29 13:14:18 -0500210protected:
Chris Dalton1a325d22017-07-14 15:17:41 -0600211 // Slightly undershoot a bloat radius of 0.5 so vertices that fall on integer boundaries don't
212 // accidentally bleed into neighbor pixels.
213 static constexpr float kAABloatRadius = 0.491111f;
214
Chris Dalton2c5e0112019-03-29 13:14:18 -0500215 GrCCCoverageProcessor(ClassID classID) : INHERITED(classID) {}
Chris Dalton1fbdb612017-12-12 12:48:47 -0700216
Chris Dalton2c5e0112019-03-29 13:14:18 -0500217 virtual GrGLSLPrimitiveProcessor* onCreateGLSLInstance(std::unique_ptr<Shader>) const = 0;
Chris Dalton6f5e77a2018-04-23 21:14:42 -0600218
Chris Dalton2c5e0112019-03-29 13:14:18 -0500219 // Our friendship with GrGLSLShaderBuilder does not propagate to subclasses.
220 inline static SkString& AccessCodeString(GrGLSLShaderBuilder* s) { return s->code(); }
Chris Dalton9f2dab02018-04-18 14:07:03 -0600221
Chris Dalton2c5e0112019-03-29 13:14:18 -0500222 PrimitiveType fPrimitiveType;
Chris Dalton383a2ef2018-01-08 17:21:41 -0500223 SkDEBUGCODE(float fDebugBloat = 0);
Chris Dalton1a325d22017-07-14 15:17:41 -0600224
Chris Dalton2c5e0112019-03-29 13:14:18 -0500225 class TriangleShader;
Chris Dalton27059d32018-01-23 14:06:50 -0700226
Chris Dalton6a3dbee2017-10-16 10:44:41 -0600227 typedef GrGeometryProcessor INHERITED;
Chris Dalton1a325d22017-07-14 15:17:41 -0600228};
229
Chris Dalton8dfc70f2018-03-26 19:15:22 -0600230inline const char* GrCCCoverageProcessor::PrimitiveTypeName(PrimitiveType type) {
231 switch (type) {
232 case PrimitiveType::kTriangles: return "kTriangles";
Chris Dalton703b4762018-04-06 16:11:48 -0600233 case PrimitiveType::kWeightedTriangles: return "kWeightedTriangles";
Chris Dalton8dfc70f2018-03-26 19:15:22 -0600234 case PrimitiveType::kQuadratics: return "kQuadratics";
235 case PrimitiveType::kCubics: return "kCubics";
Chris Dalton9f2dab02018-04-18 14:07:03 -0600236 case PrimitiveType::kConics: return "kConics";
Chris Dalton8dfc70f2018-03-26 19:15:22 -0600237 }
238 SK_ABORT("Invalid PrimitiveType");
239 return "";
240}
241
Chris Dalton84403d72018-02-13 21:46:17 -0500242inline void GrCCCoverageProcessor::TriPointInstance::set(const SkPoint p[3], const Sk2f& trans) {
Chris Daltona3e92712017-12-04 11:45:51 -0700243 this->set(p[0], p[1], p[2], trans);
244}
245
Chris Dalton84403d72018-02-13 21:46:17 -0500246inline void GrCCCoverageProcessor::TriPointInstance::set(const SkPoint& p0, const SkPoint& p1,
Chris Dalton383a2ef2018-01-08 17:21:41 -0500247 const SkPoint& p2, const Sk2f& trans) {
Chris Dalton09a7bb22018-08-31 19:53:15 +0800248 Sk2f P0 = Sk2f::Load(&p0);
249 Sk2f P1 = Sk2f::Load(&p1);
250 Sk2f P2 = Sk2f::Load(&p2);
251 this->set(P0, P1, P2, trans);
252}
253
254inline void GrCCCoverageProcessor::TriPointInstance::set(const Sk2f& P0, const Sk2f& P1,
255 const Sk2f& P2, const Sk2f& trans) {
256 Sk2f::Store3(this, P0 + trans, P1 + trans, P2 + trans);
Chris Daltona3e92712017-12-04 11:45:51 -0700257}
258
Chris Dalton84403d72018-02-13 21:46:17 -0500259inline void GrCCCoverageProcessor::QuadPointInstance::set(const SkPoint p[4], float dx, float dy) {
Chris Daltona3e92712017-12-04 11:45:51 -0700260 Sk4f X,Y;
261 Sk4f::Load2(p, &X, &Y);
262 (X + dx).store(&fX);
263 (Y + dy).store(&fY);
264}
265
Chris Dalton9f2dab02018-04-18 14:07:03 -0600266inline void GrCCCoverageProcessor::QuadPointInstance::setW(const SkPoint p[3], const Sk2f& trans,
267 float w) {
268 this->setW(p[0], p[1], p[2], trans, w);
269}
270
Chris Dalton703b4762018-04-06 16:11:48 -0600271inline void GrCCCoverageProcessor::QuadPointInstance::setW(const SkPoint& p0, const SkPoint& p1,
272 const SkPoint& p2, const Sk2f& trans,
273 float w) {
Chris Dalton09a7bb22018-08-31 19:53:15 +0800274 Sk2f P0 = Sk2f::Load(&p0);
275 Sk2f P1 = Sk2f::Load(&p1);
276 Sk2f P2 = Sk2f::Load(&p2);
277 this->setW(P0, P1, P2, trans, w);
278}
279
280inline void GrCCCoverageProcessor::QuadPointInstance::setW(const Sk2f& P0, const Sk2f& P1,
281 const Sk2f& P2, const Sk2f& trans,
282 float w) {
Chris Dalton84403d72018-02-13 21:46:17 -0500283 Sk2f W = Sk2f(w);
Chris Dalton09a7bb22018-08-31 19:53:15 +0800284 Sk2f::Store4(this, P0 + trans, P1 + trans, P2 + trans, W);
Chris Dalton84403d72018-02-13 21:46:17 -0500285}
286
Chris Dalton1a325d22017-07-14 15:17:41 -0600287#endif