blob: 3cd07edc495c8e9444ef60364cef9ce4427d94f7 [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
Mike Kleinc0bd9f92019-04-23 12:05:21 -05008#include "src/gpu/ccpr/GrCCPathProcessor.h"
Chris Dalton1a325d22017-07-14 15:17:41 -06009
Mike Kleinc0bd9f92019-04-23 12:05:21 -050010#include "include/gpu/GrTexture.h"
11#include "src/gpu/GrGpuCommandBuffer.h"
12#include "src/gpu/GrOnFlushResourceProvider.h"
Chris Daltonf91b7552019-04-29 16:21:18 -060013#include "src/gpu/GrTexturePriv.h"
Mike Kleinc0bd9f92019-04-23 12:05:21 -050014#include "src/gpu/ccpr/GrCCPerFlushResources.h"
15#include "src/gpu/glsl/GrGLSLFragmentShaderBuilder.h"
16#include "src/gpu/glsl/GrGLSLGeometryProcessor.h"
17#include "src/gpu/glsl/GrGLSLProgramBuilder.h"
18#include "src/gpu/glsl/GrGLSLVarying.h"
Chris Dalton1a325d22017-07-14 15:17:41 -060019
Chris Dalton1a325d22017-07-14 15:17:41 -060020// Paths are drawn as octagons. Each point on the octagon is the intersection of two lines: one edge
Chris Dalton377b18b2019-04-18 13:33:50 -060021// from the path's bounding box and one edge from its 45-degree bounding box. The selectors
22// below indicate one corner from the bounding box, paired with a corner from the 45-degree bounding
23// box. The octagon vertex is the point that lies between these two corners, found by intersecting
24// their edges.
25static constexpr float kOctoEdgeNorms[8*4] = {
Chris Dalton1a325d22017-07-14 15:17:41 -060026 // bbox // bbox45
Chris Dalton377b18b2019-04-18 13:33:50 -060027 0,0, 0,0,
28 0,0, 1,0,
29 1,0, 1,0,
30 1,0, 1,1,
31 1,1, 1,1,
32 1,1, 0,1,
33 0,1, 0,1,
34 0,1, 0,0,
Chris Dalton1a325d22017-07-14 15:17:41 -060035};
36
37GR_DECLARE_STATIC_UNIQUE_KEY(gVertexBufferKey);
38
Brian Salomondbf70722019-02-07 11:31:24 -050039sk_sp<const GrGpuBuffer> GrCCPathProcessor::FindVertexBuffer(GrOnFlushResourceProvider* onFlushRP) {
Chris Dalton5d2de082017-12-19 10:40:23 -070040 GR_DEFINE_STATIC_UNIQUE_KEY(gVertexBufferKey);
Brian Salomonae64c192019-02-05 09:41:37 -050041 return onFlushRP->findOrMakeStaticBuffer(GrGpuBufferType::kVertex, sizeof(kOctoEdgeNorms),
Chris Dalton5d2de082017-12-19 10:40:23 -070042 kOctoEdgeNorms, gVertexBufferKey);
43}
44
Chris Dalton27059d32018-01-23 14:06:50 -070045static constexpr uint16_t kRestartStrip = 0xffff;
46
47static constexpr uint16_t kOctoIndicesAsStrips[] = {
Chris Dalton377b18b2019-04-18 13:33:50 -060048 3, 4, 2, 0, 1, kRestartStrip, // First half.
49 7, 0, 6, 4, 5 // Second half.
Chris Dalton27059d32018-01-23 14:06:50 -070050};
51
52static constexpr uint16_t kOctoIndicesAsTris[] = {
53 // First half.
Chris Dalton377b18b2019-04-18 13:33:50 -060054 3, 4, 2,
55 4, 0, 2,
56 2, 0, 1,
Chris Dalton27059d32018-01-23 14:06:50 -070057
58 // Second half.
Chris Dalton377b18b2019-04-18 13:33:50 -060059 7, 0, 6,
60 0, 4, 6,
61 6, 4, 5,
Chris Dalton1a325d22017-07-14 15:17:41 -060062};
63
64GR_DECLARE_STATIC_UNIQUE_KEY(gIndexBufferKey);
65
Brian Salomon92be2f72018-06-19 14:33:47 -040066constexpr GrPrimitiveProcessor::Attribute GrCCPathProcessor::kInstanceAttribs[];
Chris Dalton377b18b2019-04-18 13:33:50 -060067constexpr GrPrimitiveProcessor::Attribute GrCCPathProcessor::kCornersAttrib;
Brian Salomon92be2f72018-06-19 14:33:47 -040068
Brian Salomondbf70722019-02-07 11:31:24 -050069sk_sp<const GrGpuBuffer> GrCCPathProcessor::FindIndexBuffer(GrOnFlushResourceProvider* onFlushRP) {
Chris Dalton5d2de082017-12-19 10:40:23 -070070 GR_DEFINE_STATIC_UNIQUE_KEY(gIndexBufferKey);
Chris Dalton27059d32018-01-23 14:06:50 -070071 if (onFlushRP->caps()->usePrimitiveRestart()) {
Brian Salomonae64c192019-02-05 09:41:37 -050072 return onFlushRP->findOrMakeStaticBuffer(GrGpuBufferType::kIndex,
73 sizeof(kOctoIndicesAsStrips), kOctoIndicesAsStrips,
74 gIndexBufferKey);
Chris Dalton27059d32018-01-23 14:06:50 -070075 } else {
Brian Salomonae64c192019-02-05 09:41:37 -050076 return onFlushRP->findOrMakeStaticBuffer(GrGpuBufferType::kIndex,
77 sizeof(kOctoIndicesAsTris), kOctoIndicesAsTris,
78 gIndexBufferKey);
Chris Dalton27059d32018-01-23 14:06:50 -070079 }
Chris Dalton5d2de082017-12-19 10:40:23 -070080}
81
Chris Daltonf91b7552019-04-29 16:21:18 -060082GrCCPathProcessor::GrCCPathProcessor(const GrTexture* atlasTexture, GrSurfaceOrigin atlasOrigin,
Chris Dalton1c548942018-05-22 13:09:48 -060083 const SkMatrix& viewMatrixIfUsingLocalCoords)
Chris Dalton383a2ef2018-01-08 17:21:41 -050084 : INHERITED(kGrCCPathProcessor_ClassID)
Chris Daltonf91b7552019-04-29 16:21:18 -060085 , fAtlasAccess(atlasTexture->texturePriv().textureType(), atlasTexture->config(),
86 GrSamplerState::Filter::kNearest, GrSamplerState::WrapMode::kClamp)
87 , fAtlasSize(SkISize::Make(atlasTexture->width(), atlasTexture->height()))
88 , fAtlasOrigin(atlasOrigin) {
Brian Salomon7eae3e02018-08-07 14:02:38 +000089 // TODO: Can we just assert that atlas has GrCCAtlas::kTextureOrigin and remove fAtlasOrigin?
Chris Dalton377b18b2019-04-18 13:33:50 -060090 this->setInstanceAttributes(kInstanceAttribs, SK_ARRAY_COUNT(kInstanceAttribs));
Brian Osmanf04fb3c2018-11-12 15:34:00 -050091 SkASSERT(this->instanceStride() == sizeof(Instance));
Chris Dalton1a325d22017-07-14 15:17:41 -060092
Chris Dalton377b18b2019-04-18 13:33:50 -060093 this->setVertexAttributes(&kCornersAttrib, 1);
Brian Salomonf7dcd762018-07-30 14:48:15 -040094 this->setTextureSamplerCnt(1);
Chris Dalton27059d32018-01-23 14:06:50 -070095
Chris Dalton1c548942018-05-22 13:09:48 -060096 if (!viewMatrixIfUsingLocalCoords.invert(&fLocalMatrix)) {
97 fLocalMatrix.setIdentity();
Chris Dalton27059d32018-01-23 14:06:50 -070098 }
Chris Dalton1a325d22017-07-14 15:17:41 -060099}
100
Chris Dalton377b18b2019-04-18 13:33:50 -0600101class GrCCPathProcessor::Impl : public GrGLSLGeometryProcessor {
Chris Dalton1a325d22017-07-14 15:17:41 -0600102public:
103 void onEmitCode(EmitArgs& args, GrGPArgs* gpArgs) override;
104
105private:
106 void setData(const GrGLSLProgramDataManager& pdman, const GrPrimitiveProcessor& primProc,
107 FPCoordTransformIter&& transformIter) override {
Chris Daltonf91b7552019-04-29 16:21:18 -0600108 const auto& proc = primProc.cast<GrCCPathProcessor>();
109 pdman.set2f(
110 fAtlasAdjustUniform, 1.0f / proc.fAtlasSize.fWidth, 1.0f / proc.fAtlasSize.fHeight);
111 this->setTransformDataHelper(proc.fLocalMatrix, pdman, &transformIter);
Chris Dalton1a325d22017-07-14 15:17:41 -0600112 }
113
114 GrGLSLUniformHandler::UniformHandle fAtlasAdjustUniform;
115
116 typedef GrGLSLGeometryProcessor INHERITED;
117};
118
Chris Dalton383a2ef2018-01-08 17:21:41 -0500119GrGLSLPrimitiveProcessor* GrCCPathProcessor::createGLSLInstance(const GrShaderCaps&) const {
Chris Dalton377b18b2019-04-18 13:33:50 -0600120 return new Impl();
Chris Dalton1a325d22017-07-14 15:17:41 -0600121}
122
Chris Daltond925f2d2018-05-07 19:19:06 -0600123void GrCCPathProcessor::drawPaths(GrOpFlushState* flushState, const GrPipeline& pipeline,
Brian Salomon49348902018-06-26 09:12:38 -0400124 const GrPipeline::FixedDynamicState* fixedDynamicState,
Chris Dalton4da70192018-06-18 09:51:36 -0600125 const GrCCPerFlushResources& resources, int baseInstance,
126 int endInstance, const SkRect& bounds) const {
Chris Daltond925f2d2018-05-07 19:19:06 -0600127 const GrCaps& caps = flushState->caps();
128 GrPrimitiveType primitiveType = caps.usePrimitiveRestart()
129 ? GrPrimitiveType::kTriangleStrip
130 : GrPrimitiveType::kTriangles;
131 int numIndicesPerInstance = caps.usePrimitiveRestart()
132 ? SK_ARRAY_COUNT(kOctoIndicesAsStrips)
133 : SK_ARRAY_COUNT(kOctoIndicesAsTris);
134 GrMesh mesh(primitiveType);
Brian Salomon802cb312018-06-08 18:05:20 -0400135 auto enablePrimitiveRestart = GrPrimitiveRestart(flushState->caps().usePrimitiveRestart());
136
Brian Salomon12d22642019-01-29 14:38:50 -0500137 mesh.setIndexedInstanced(resources.refIndexBuffer(), numIndicesPerInstance,
138 resources.refInstanceBuffer(), endInstance - baseInstance,
139 baseInstance, enablePrimitiveRestart);
140 mesh.setVertexData(resources.refVertexBuffer());
Chris Daltond925f2d2018-05-07 19:19:06 -0600141
Brian Salomon49348902018-06-26 09:12:38 -0400142 flushState->rtCommandBuffer()->draw(*this, pipeline, fixedDynamicState, nullptr, &mesh, 1,
143 bounds);
Chris Daltond925f2d2018-05-07 19:19:06 -0600144}
145
Chris Dalton377b18b2019-04-18 13:33:50 -0600146void GrCCPathProcessor::Impl::onEmitCode(EmitArgs& args, GrGPArgs* gpArgs) {
Chris Dalton7b046312018-02-02 11:06:30 -0700147 using Interpolation = GrGLSLVaryingHandler::Interpolation;
148
Chris Dalton383a2ef2018-01-08 17:21:41 -0500149 const GrCCPathProcessor& proc = args.fGP.cast<GrCCPathProcessor>();
Chris Dalton1a325d22017-07-14 15:17:41 -0600150 GrGLSLUniformHandler* uniHandler = args.fUniformHandler;
151 GrGLSLVaryingHandler* varyingHandler = args.fVaryingHandler;
152
153 const char* atlasAdjust;
154 fAtlasAdjustUniform = uniHandler->addUniform(
Chris Dalton377b18b2019-04-18 13:33:50 -0600155 kVertex_GrShaderFlag, 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);
Chris Dalton377b18b2019-04-18 13:33:50 -0600162 varyingHandler->addPassThroughAttribute(
163 kInstanceAttribs[kColorAttribIdx], 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 Dalton5b5403e2019-06-05 11:54:39 -0600169 // Are we clockwise? (Positive wind => nonzero fill rule.)
170 // Or counter-clockwise? (negative wind => even/odd fill rule.)
Chris Dalton377b18b2019-04-18 13:33:50 -0600171 v->codeAppendf("float wind = sign(devbounds.z - devbounds.x);");
Chris Dalton1a325d22017-07-14 15:17:41 -0600172
Chris Dalton377b18b2019-04-18 13:33:50 -0600173 // Find our reference corner from the device-space bounding box.
174 v->codeAppendf("float2 refpt = mix(devbounds.xy, devbounds.zw, corners.xy);");
Chris Dalton1a325d22017-07-14 15:17:41 -0600175
Chris Dalton377b18b2019-04-18 13:33:50 -0600176 // Find our reference corner from the 45-degree bounding box.
177 v->codeAppendf("float2 refpt45 = mix(devbounds45.xy, devbounds45.zw, corners.zw);");
178 // Transform back to device space.
179 v->codeAppendf("refpt45 *= float2x2(+1, +1, -wind, +wind) * .5;");
Chris Dalton1a325d22017-07-14 15:17:41 -0600180
Chris Dalton377b18b2019-04-18 13:33:50 -0600181 // Find the normals to each edge, then intersect them to find our octagon vertex.
182 v->codeAppendf("float2x2 N = float2x2("
183 "corners.z + corners.w - 1, corners.w - corners.z, "
184 "corners.xy*2 - 1);");
185 v->codeAppendf("N = float2x2(wind, 0, 0, 1) * N;");
186 v->codeAppendf("float2 K = float2(dot(N[0], refpt), dot(N[1], refpt45));");
Ethan Nicholas8aa45692017-09-20 11:24:15 -0400187 v->codeAppendf("float2 octocoord = K * inverse(N);");
Chris Dalton1a325d22017-07-14 15:17:41 -0600188
Chris Dalton51e8b7e2018-10-09 21:18:45 -0600189 // Round the octagon out to ensure we rasterize every pixel the path might touch. (Positive
190 // bloatdir means we should take the "ceil" and negative means to take the "floor".)
191 //
192 // NOTE: If we were just drawing a rect, ceil/floor would be enough. But since there are also
193 // diagonals in the octagon that cross through pixel centers, we need to outset by another
194 // quarter px to ensure those pixels get rasterized.
Chris Dalton377b18b2019-04-18 13:33:50 -0600195 v->codeAppendf("float2 bloatdir = (0 != N[0].x) "
196 "? float2(N[0].x, N[1].y)"
197 ": float2(N[1].x, N[0].y);");
198 v->codeAppendf("octocoord = (ceil(octocoord * bloatdir - 1e-4) + 0.25) * bloatdir;");
Chris Dalton1a325d22017-07-14 15:17:41 -0600199
200 // Convert to atlas coordinates in order to do our texture lookup.
Chris Dalton377b18b2019-04-18 13:33:50 -0600201 v->codeAppendf("float2 atlascoord = octocoord + float2(dev_to_atlas_offset);");
Chris Daltonf91b7552019-04-29 16:21:18 -0600202 if (kTopLeft_GrSurfaceOrigin == proc.fAtlasOrigin) {
Chris Daltondaef06a2018-05-23 17:11:09 -0600203 v->codeAppendf("%s.xy = atlascoord * %s;", texcoord.vsOut(), atlasAdjust);
Chris Dalton1a325d22017-07-14 15:17:41 -0600204 } else {
Chris Daltonf91b7552019-04-29 16:21:18 -0600205 SkASSERT(kBottomLeft_GrSurfaceOrigin == proc.fAtlasOrigin);
Chris Daltondaef06a2018-05-23 17:11:09 -0600206 v->codeAppendf("%s.xy = float2(atlascoord.x * %s.x, 1 - atlascoord.y * %s.y);",
Chris Dalton1a325d22017-07-14 15:17:41 -0600207 texcoord.vsOut(), atlasAdjust, atlasAdjust);
208 }
Chris Dalton377b18b2019-04-18 13:33:50 -0600209 v->codeAppendf("%s.z = wind * .5;", texcoord.vsOut());
Chris Dalton1a325d22017-07-14 15:17:41 -0600210
Chris Dalton377b18b2019-04-18 13:33:50 -0600211 gpArgs->fPositionVar.set(kFloat2_GrSLType, "octocoord");
Chris Daltonf91b7552019-04-29 16:21:18 -0600212 this->emitTransforms(v, varyingHandler, uniHandler, gpArgs->fPositionVar, proc.fLocalMatrix,
Chris Dalton377b18b2019-04-18 13:33:50 -0600213 args.fFPCoordTransformHandler);
Chris Dalton1a325d22017-07-14 15:17:41 -0600214
215 // Fragment shader.
Chris Dalton60283612018-02-14 13:38:14 -0700216 GrGLSLFPFragmentBuilder* f = args.fFragBuilder;
Chris Dalton1a325d22017-07-14 15:17:41 -0600217
Chris Daltondaef06a2018-05-23 17:11:09 -0600218 // Look up coverage count in the atlas.
219 f->codeAppend ("half coverage = ");
220 f->appendTextureLookup(args.fTexSamplers[0], SkStringPrintf("%s.xy", texcoord.fsIn()).c_str(),
221 kFloat2_GrSLType);
Chris Dalton1a325d22017-07-14 15:17:41 -0600222 f->codeAppend (".a;");
223
Chris Daltondaef06a2018-05-23 17:11:09 -0600224 // Scale coverage count by .5. Make it negative for even-odd paths and positive for winding
225 // ones. Clamp winding coverage counts at 1.0 (i.e. min(coverage/2, .5)).
Ethan Nicholase1f55022019-02-05 17:17:40 -0500226 f->codeAppendf("coverage = min(abs(coverage) * half(%s.z), .5);", texcoord.fsIn());
Chris Daltondaef06a2018-05-23 17:11:09 -0600227
228 // For negative values, this finishes the even-odd sawtooth function. Since positive (winding)
229 // values were clamped at "coverage/2 = .5", this only undoes the previous multiply by .5.
230 f->codeAppend ("coverage = 1 - abs(fract(coverage) * 2 - 1);");
231
232 f->codeAppendf("%s = half4(coverage);", args.fOutputCoverage);
Chris Dalton1a325d22017-07-14 15:17:41 -0600233}