blob: feefd4fc8c8a8154b91c458a74e1728e56100fb6 [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#include "GrCCPathProcessor.h"
Chris Dalton1a325d22017-07-14 15:17:41 -06009
Chris Daltond925f2d2018-05-07 19:19:06 -060010#include "GrGpuCommandBuffer.h"
Chris Dalton1a325d22017-07-14 15:17:41 -060011#include "GrOnFlushResourceProvider.h"
12#include "GrTexture.h"
Chris Dalton4da70192018-06-18 09:51:36 -060013#include "ccpr/GrCCPerFlushResources.h"
Chris Dalton1a325d22017-07-14 15:17:41 -060014#include "glsl/GrGLSLFragmentShaderBuilder.h"
15#include "glsl/GrGLSLGeometryProcessor.h"
16#include "glsl/GrGLSLProgramBuilder.h"
17#include "glsl/GrGLSLVarying.h"
18
Chris Dalton1a325d22017-07-14 15:17:41 -060019// Paths are drawn as octagons. Each point on the octagon is the intersection of two lines: one edge
20// from the path's bounding box and one edge from its 45-degree bounding box. The below inputs
21// define a vertex by the two edges that need to be intersected. Normals point out of the octagon,
22// and the bounding boxes are sent in as instance attribs.
23static constexpr float kOctoEdgeNorms[8 * 4] = {
24 // bbox // bbox45
25 -1, 0, -1,+1,
26 -1, 0, -1,-1,
27 0,-1, -1,-1,
28 0,-1, +1,-1,
29 +1, 0, +1,-1,
30 +1, 0, +1,+1,
31 0,+1, +1,+1,
32 0,+1, -1,+1,
33};
34
35GR_DECLARE_STATIC_UNIQUE_KEY(gVertexBufferKey);
36
Brian Salomondbf70722019-02-07 11:31:24 -050037sk_sp<const GrGpuBuffer> GrCCPathProcessor::FindVertexBuffer(GrOnFlushResourceProvider* onFlushRP) {
Chris Dalton5d2de082017-12-19 10:40:23 -070038 GR_DEFINE_STATIC_UNIQUE_KEY(gVertexBufferKey);
Brian Salomonae64c192019-02-05 09:41:37 -050039 return onFlushRP->findOrMakeStaticBuffer(GrGpuBufferType::kVertex, sizeof(kOctoEdgeNorms),
Chris Dalton5d2de082017-12-19 10:40:23 -070040 kOctoEdgeNorms, gVertexBufferKey);
41}
42
Chris Dalton27059d32018-01-23 14:06:50 -070043static constexpr uint16_t kRestartStrip = 0xffff;
44
45static constexpr uint16_t kOctoIndicesAsStrips[] = {
46 1, 0, 2, 4, 3, kRestartStrip, // First half.
47 5, 4, 6, 0, 7 // Second half.
48};
49
50static constexpr uint16_t kOctoIndicesAsTris[] = {
51 // First half.
52 1, 0, 2,
Chris Dalton1a325d22017-07-14 15:17:41 -060053 0, 4, 2,
Chris Dalton1a325d22017-07-14 15:17:41 -060054 2, 4, 3,
Chris Dalton27059d32018-01-23 14:06:50 -070055
56 // Second half.
57 5, 4, 6,
58 4, 0, 6,
Chris Dalton1a325d22017-07-14 15:17:41 -060059 6, 0, 7,
60};
61
62GR_DECLARE_STATIC_UNIQUE_KEY(gIndexBufferKey);
63
Brian Salomon92be2f72018-06-19 14:33:47 -040064constexpr GrPrimitiveProcessor::Attribute GrCCPathProcessor::kInstanceAttribs[];
65constexpr GrPrimitiveProcessor::Attribute GrCCPathProcessor::kEdgeNormsAttrib;
66
Brian Salomondbf70722019-02-07 11:31:24 -050067sk_sp<const GrGpuBuffer> GrCCPathProcessor::FindIndexBuffer(GrOnFlushResourceProvider* onFlushRP) {
Chris Dalton5d2de082017-12-19 10:40:23 -070068 GR_DEFINE_STATIC_UNIQUE_KEY(gIndexBufferKey);
Chris Dalton27059d32018-01-23 14:06:50 -070069 if (onFlushRP->caps()->usePrimitiveRestart()) {
Brian Salomonae64c192019-02-05 09:41:37 -050070 return onFlushRP->findOrMakeStaticBuffer(GrGpuBufferType::kIndex,
71 sizeof(kOctoIndicesAsStrips), kOctoIndicesAsStrips,
72 gIndexBufferKey);
Chris Dalton27059d32018-01-23 14:06:50 -070073 } else {
Brian Salomonae64c192019-02-05 09:41:37 -050074 return onFlushRP->findOrMakeStaticBuffer(GrGpuBufferType::kIndex,
75 sizeof(kOctoIndicesAsTris), kOctoIndicesAsTris,
76 gIndexBufferKey);
Chris Dalton27059d32018-01-23 14:06:50 -070077 }
Chris Dalton5d2de082017-12-19 10:40:23 -070078}
79
Brian Salomon7eae3e02018-08-07 14:02:38 +000080GrCCPathProcessor::GrCCPathProcessor(const GrTextureProxy* atlas,
Chris Dalton1c548942018-05-22 13:09:48 -060081 const SkMatrix& viewMatrixIfUsingLocalCoords)
Chris Dalton383a2ef2018-01-08 17:21:41 -050082 : INHERITED(kGrCCPathProcessor_ClassID)
Brian Salomon7eae3e02018-08-07 14:02:38 +000083 , fAtlasAccess(atlas->textureType(), atlas->config(), GrSamplerState::Filter::kNearest,
Greg Daniel0f70be82018-10-08 17:35:08 +000084 GrSamplerState::WrapMode::kClamp)
Brian Salomon7eae3e02018-08-07 14:02:38 +000085 , fAtlasSize(atlas->isize())
86 , fAtlasOrigin(atlas->origin()) {
87 // TODO: Can we just assert that atlas has GrCCAtlas::kTextureOrigin and remove fAtlasOrigin?
Brian Osmanf04fb3c2018-11-12 15:34:00 -050088 this->setInstanceAttributes(kInstanceAttribs, kNumInstanceAttribs);
89 SkASSERT(this->instanceStride() == sizeof(Instance));
Chris Dalton1a325d22017-07-14 15:17:41 -060090
Brian Osmanf04fb3c2018-11-12 15:34:00 -050091 this->setVertexAttributes(&kEdgeNormsAttrib, 1);
Brian Salomonf7dcd762018-07-30 14:48:15 -040092 this->setTextureSamplerCnt(1);
Chris Dalton27059d32018-01-23 14:06:50 -070093
Chris Dalton1c548942018-05-22 13:09:48 -060094 if (!viewMatrixIfUsingLocalCoords.invert(&fLocalMatrix)) {
95 fLocalMatrix.setIdentity();
Chris Dalton27059d32018-01-23 14:06:50 -070096 }
Chris Dalton1a325d22017-07-14 15:17:41 -060097}
98
Chris Dalton1a325d22017-07-14 15:17:41 -060099class GLSLPathProcessor : public GrGLSLGeometryProcessor {
100public:
101 void onEmitCode(EmitArgs& args, GrGPArgs* gpArgs) override;
102
103private:
104 void setData(const GrGLSLProgramDataManager& pdman, const GrPrimitiveProcessor& primProc,
105 FPCoordTransformIter&& transformIter) override {
Chris Dalton383a2ef2018-01-08 17:21:41 -0500106 const GrCCPathProcessor& proc = primProc.cast<GrCCPathProcessor>();
Brian Salomon7eae3e02018-08-07 14:02:38 +0000107 pdman.set2f(fAtlasAdjustUniform, 1.0f / proc.atlasSize().fWidth,
108 1.0f / proc.atlasSize().fHeight);
Chris Dalton1c548942018-05-22 13:09:48 -0600109 this->setTransformDataHelper(proc.localMatrix(), pdman, &transformIter);
Chris Dalton1a325d22017-07-14 15:17:41 -0600110 }
111
112 GrGLSLUniformHandler::UniformHandle fAtlasAdjustUniform;
113
114 typedef GrGLSLGeometryProcessor INHERITED;
115};
116
Chris Dalton383a2ef2018-01-08 17:21:41 -0500117GrGLSLPrimitiveProcessor* GrCCPathProcessor::createGLSLInstance(const GrShaderCaps&) const {
Chris Dalton1a325d22017-07-14 15:17:41 -0600118 return new GLSLPathProcessor();
119}
120
Chris Daltond925f2d2018-05-07 19:19:06 -0600121void GrCCPathProcessor::drawPaths(GrOpFlushState* flushState, const GrPipeline& pipeline,
Brian Salomon49348902018-06-26 09:12:38 -0400122 const GrPipeline::FixedDynamicState* fixedDynamicState,
Chris Dalton4da70192018-06-18 09:51:36 -0600123 const GrCCPerFlushResources& resources, int baseInstance,
124 int endInstance, const SkRect& bounds) const {
Chris Daltond925f2d2018-05-07 19:19:06 -0600125 const GrCaps& caps = flushState->caps();
126 GrPrimitiveType primitiveType = caps.usePrimitiveRestart()
127 ? GrPrimitiveType::kTriangleStrip
128 : GrPrimitiveType::kTriangles;
129 int numIndicesPerInstance = caps.usePrimitiveRestart()
130 ? SK_ARRAY_COUNT(kOctoIndicesAsStrips)
131 : SK_ARRAY_COUNT(kOctoIndicesAsTris);
132 GrMesh mesh(primitiveType);
Brian Salomon802cb312018-06-08 18:05:20 -0400133 auto enablePrimitiveRestart = GrPrimitiveRestart(flushState->caps().usePrimitiveRestart());
134
Brian Salomon12d22642019-01-29 14:38:50 -0500135 mesh.setIndexedInstanced(resources.refIndexBuffer(), numIndicesPerInstance,
136 resources.refInstanceBuffer(), endInstance - baseInstance,
137 baseInstance, enablePrimitiveRestart);
138 mesh.setVertexData(resources.refVertexBuffer());
Chris Daltond925f2d2018-05-07 19:19:06 -0600139
Brian Salomon49348902018-06-26 09:12:38 -0400140 flushState->rtCommandBuffer()->draw(*this, pipeline, fixedDynamicState, nullptr, &mesh, 1,
141 bounds);
Chris Daltond925f2d2018-05-07 19:19:06 -0600142}
143
Chris Dalton1a325d22017-07-14 15:17:41 -0600144void GLSLPathProcessor::onEmitCode(EmitArgs& args, GrGPArgs* gpArgs) {
Chris Dalton383a2ef2018-01-08 17:21:41 -0500145 using InstanceAttribs = GrCCPathProcessor::InstanceAttribs;
Chris Dalton7b046312018-02-02 11:06:30 -0700146 using Interpolation = GrGLSLVaryingHandler::Interpolation;
147
Chris Dalton383a2ef2018-01-08 17:21:41 -0500148 const GrCCPathProcessor& proc = args.fGP.cast<GrCCPathProcessor>();
Chris Dalton1a325d22017-07-14 15:17:41 -0600149 GrGLSLUniformHandler* uniHandler = args.fUniformHandler;
150 GrGLSLVaryingHandler* varyingHandler = args.fVaryingHandler;
151
152 const char* atlasAdjust;
153 fAtlasAdjustUniform = uniHandler->addUniform(
154 kVertex_GrShaderFlag,
Ethan Nicholas8aa45692017-09-20 11:24:15 -0400155 kFloat2_GrSLType, "atlas_adjust", &atlasAdjust);
Chris Dalton1a325d22017-07-14 15:17:41 -0600156
157 varyingHandler->emitAttributes(proc);
158
Chris Daltondaef06a2018-05-23 17:11:09 -0600159 GrGLSLVarying texcoord(kFloat3_GrSLType);
Chris Dalton27372882017-12-08 13:34:21 -0700160 GrGLSLVarying color(kHalf4_GrSLType);
Chris Daltonfdde34e2017-10-16 14:15:26 -0600161 varyingHandler->addVarying("texcoord", &texcoord);
Brian Salomon92be2f72018-06-19 14:33:47 -0400162 varyingHandler->addPassThroughAttribute(proc.getInstanceAttrib(InstanceAttribs::kColor),
Chris Dalton7b046312018-02-02 11:06:30 -0700163 args.fOutputColor, Interpolation::kCanBeFlat);
Chris Dalton1a325d22017-07-14 15:17:41 -0600164
Chris Daltond0b8d932017-12-21 16:48:52 -0700165 // The vertex shader bloats and intersects the devBounds and devBounds45 rectangles, in order to
166 // find an octagon that circumscribes the (bloated) path.
Chris Dalton1a325d22017-07-14 15:17:41 -0600167 GrGLSLVertexBuilder* v = args.fVertBuilder;
168
Chris Daltond0b8d932017-12-21 16:48:52 -0700169 // Each vertex is the intersection of one edge from devBounds and one from devBounds45.
170 // 'N' holds the normals to these edges as column vectors.
171 //
172 // NOTE: "float2x2(float4)" is valid and equivalent to "float2x2(float4.xy, float4.zw)",
173 // however Intel compilers crash when we use the former syntax in this shader.
Brian Salomon70132d02018-05-29 15:33:06 -0400174 v->codeAppendf("float2x2 N = float2x2(%s.xy, %s.zw);", proc.getEdgeNormsAttrib().name(),
175 proc.getEdgeNormsAttrib().name());
Chris Dalton1a325d22017-07-14 15:17:41 -0600176
177 // N[0] is the normal for the edge we are intersecting from the regular bounding box, pointing
178 // out of the octagon.
Chris Daltondaef06a2018-05-23 17:11:09 -0600179 v->codeAppendf("float4 devbounds = %s;",
Brian Salomon70132d02018-05-29 15:33:06 -0400180 proc.getInstanceAttrib(InstanceAttribs::kDevBounds).name());
Chris Daltondaef06a2018-05-23 17:11:09 -0600181 v->codeAppend ("float2 refpt = (0 == sk_VertexID >> 2)"
182 "? float2(min(devbounds.x, devbounds.z), devbounds.y)"
183 ": float2(max(devbounds.x, devbounds.z), devbounds.w);");
Chris Dalton1a325d22017-07-14 15:17:41 -0600184
185 // N[1] is the normal for the edge we are intersecting from the 45-degree bounding box, pointing
186 // out of the octagon.
Chris Dalton5cd67002018-04-30 11:04:40 -0600187 v->codeAppendf("float2 refpt45 = (0 == ((sk_VertexID + 1) & (1 << 2))) ? %s.xy : %s.zw;",
Brian Salomon70132d02018-05-29 15:33:06 -0400188 proc.getInstanceAttrib(InstanceAttribs::kDevBounds45).name(),
189 proc.getInstanceAttrib(InstanceAttribs::kDevBounds45).name());
Ethan Nicholas8aa45692017-09-20 11:24:15 -0400190 v->codeAppendf("refpt45 *= float2x2(.5,.5,-.5,.5);"); // transform back to device space.
Chris Dalton1a325d22017-07-14 15:17:41 -0600191
Ethan Nicholas8aa45692017-09-20 11:24:15 -0400192 v->codeAppend ("float2 K = float2(dot(N[0], refpt), dot(N[1], refpt45));");
193 v->codeAppendf("float2 octocoord = K * inverse(N);");
Chris Dalton1a325d22017-07-14 15:17:41 -0600194
Chris Dalton51e8b7e2018-10-09 21:18:45 -0600195 // Round the octagon out to ensure we rasterize every pixel the path might touch. (Positive
196 // bloatdir means we should take the "ceil" and negative means to take the "floor".)
197 //
198 // NOTE: If we were just drawing a rect, ceil/floor would be enough. But since there are also
199 // diagonals in the octagon that cross through pixel centers, we need to outset by another
200 // quarter px to ensure those pixels get rasterized.
Ethan Nicholase1f55022019-02-05 17:17:40 -0500201 v->codeAppend ("half2 bloatdir = (0 != N[0].x) "
202 "? half2(half(N[0].x), half(N[1].y))"
203 ": half2(half(N[1].x), half(N[0].y));");
Chris Dalton51e8b7e2018-10-09 21:18:45 -0600204 v->codeAppend ("octocoord = (ceil(octocoord * bloatdir - 1e-4) + 0.25) * bloatdir;");
205
Ethan Nicholas8aa45692017-09-20 11:24:15 -0400206 gpArgs->fPositionVar.set(kFloat2_GrSLType, "octocoord");
Chris Dalton1a325d22017-07-14 15:17:41 -0600207
208 // Convert to atlas coordinates in order to do our texture lookup.
Ethan Nicholas8aa45692017-09-20 11:24:15 -0400209 v->codeAppendf("float2 atlascoord = octocoord + float2(%s);",
Chris Dalton9414c962018-06-14 10:14:50 -0600210 proc.getInstanceAttrib(InstanceAttribs::kDevToAtlasOffset).name());
Brian Salomon7eae3e02018-08-07 14:02:38 +0000211 if (kTopLeft_GrSurfaceOrigin == proc.atlasOrigin()) {
Chris Daltondaef06a2018-05-23 17:11:09 -0600212 v->codeAppendf("%s.xy = atlascoord * %s;", texcoord.vsOut(), atlasAdjust);
Chris Dalton1a325d22017-07-14 15:17:41 -0600213 } else {
Brian Salomon7eae3e02018-08-07 14:02:38 +0000214 SkASSERT(kBottomLeft_GrSurfaceOrigin == proc.atlasOrigin());
Chris Daltondaef06a2018-05-23 17:11:09 -0600215 v->codeAppendf("%s.xy = float2(atlascoord.x * %s.x, 1 - atlascoord.y * %s.y);",
Chris Dalton1a325d22017-07-14 15:17:41 -0600216 texcoord.vsOut(), atlasAdjust, atlasAdjust);
217 }
Chris Daltondaef06a2018-05-23 17:11:09 -0600218 // The third texture coordinate is -.5 for even-odd paths and +.5 for winding ones.
219 // ("right < left" indicates even-odd fill type.)
220 v->codeAppendf("%s.z = sign(devbounds.z - devbounds.x) * .5;", texcoord.vsOut());
Chris Dalton1a325d22017-07-14 15:17:41 -0600221
Chris Dalton1c548942018-05-22 13:09:48 -0600222 this->emitTransforms(v, varyingHandler, uniHandler, GrShaderVar("octocoord", kFloat2_GrSLType),
223 proc.localMatrix(), args.fFPCoordTransformHandler);
Chris Dalton1a325d22017-07-14 15:17:41 -0600224
225 // Fragment shader.
Chris Dalton60283612018-02-14 13:38:14 -0700226 GrGLSLFPFragmentBuilder* f = args.fFragBuilder;
Chris Dalton1a325d22017-07-14 15:17:41 -0600227
Chris Daltondaef06a2018-05-23 17:11:09 -0600228 // Look up coverage count in the atlas.
229 f->codeAppend ("half coverage = ");
230 f->appendTextureLookup(args.fTexSamplers[0], SkStringPrintf("%s.xy", texcoord.fsIn()).c_str(),
231 kFloat2_GrSLType);
Chris Dalton1a325d22017-07-14 15:17:41 -0600232 f->codeAppend (".a;");
233
Chris Daltondaef06a2018-05-23 17:11:09 -0600234 // Scale coverage count by .5. Make it negative for even-odd paths and positive for winding
235 // ones. Clamp winding coverage counts at 1.0 (i.e. min(coverage/2, .5)).
Ethan Nicholase1f55022019-02-05 17:17:40 -0500236 f->codeAppendf("coverage = min(abs(coverage) * half(%s.z), .5);", texcoord.fsIn());
Chris Daltondaef06a2018-05-23 17:11:09 -0600237
238 // For negative values, this finishes the even-odd sawtooth function. Since positive (winding)
239 // values were clamped at "coverage/2 = .5", this only undoes the previous multiply by .5.
240 f->codeAppend ("coverage = 1 - abs(fract(coverage) * 2 - 1);");
241
242 f->codeAppendf("%s = half4(coverage);", args.fOutputCoverage);
Chris Dalton1a325d22017-07-14 15:17:41 -0600243}