blob: 239828275557d50016fd33274b775b69fc3907b6 [file] [log] [blame]
Chris Dalton6a3dbee2017-10-16 10:44: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 "GrCCQuadraticShader.h"
Chris Dalton6a3dbee2017-10-16 10:44:41 -06009
Chris Dalton90e8fb12017-12-22 02:24:53 -070010#include "glsl/GrGLSLVertexGeoBuilder.h"
Chris Dalton6a3dbee2017-10-16 10:44:41 -060011#include "glsl/GrGLSLFragmentShaderBuilder.h"
Chris Dalton1fbdb612017-12-12 12:48:47 -070012#include "glsl/GrGLSLVertexGeoBuilder.h"
Chris Dalton6a3dbee2017-10-16 10:44:41 -060013
Chris Dalton383a2ef2018-01-08 17:21:41 -050014using Shader = GrCCCoverageProcessor::Shader;
Chris Daltonde5a8142017-12-18 10:05:15 -070015
Chris Daltonfe462ef2018-03-08 15:54:01 +000016void GrCCQuadraticShader::emitSetupCode(GrGLSLVertexGeoBuilder* s, const char* pts,
Chris Dalton21ba5512018-03-21 17:20:21 -060017 const char* wind, const char** tighterHull) const {
Chris Dalton52076d12018-03-21 12:14:10 -060018 s->declareGlobal(fQCoordMatrix);
19 s->codeAppendf("%s = float2x2(1, 1, .5, 0) * inverse(float2x2(%s[2] - %s[0], %s[1] - %s[0]));",
20 fQCoordMatrix.c_str(), pts, pts, pts, pts);
21
22 s->declareGlobal(fQCoord0);
23 s->codeAppendf("%s = %s[0];", fQCoord0.c_str(), pts);
Chris Dalton6a3dbee2017-10-16 10:44:41 -060024
Chris Daltonbaf3e782018-03-08 15:55:58 +000025 s->declareGlobal(fEdgeDistanceEquation);
26 s->codeAppendf("float2 edgept0 = %s[%s > 0 ? 2 : 0];", pts, wind);
27 s->codeAppendf("float2 edgept1 = %s[%s > 0 ? 0 : 2];", pts, wind);
28 Shader::EmitEdgeDistanceEquation(s, "edgept0", "edgept1", fEdgeDistanceEquation.c_str());
29
Chris Dalton21ba5512018-03-21 17:20:21 -060030 if (tighterHull) {
31 // Find the T value whose tangent is halfway between the tangents at the endpionts.
32 s->codeAppendf("float2 tan0 = %s[1] - %s[0];", pts, pts);
33 s->codeAppendf("float2 tan1 = %s[2] - %s[1];", pts, pts);
34 s->codeAppend ("float2 midnorm = normalize(tan0) - normalize(tan1);");
35 s->codeAppend ("float2 T = midnorm * float2x2(tan0 - tan1, tan0);");
36 s->codeAppend ("float t = clamp(T.t / T.s, 0, 1);"); // T.s!=0; we cull flat curves on CPU.
37
38 // Clip the bezier triangle by the tangent at our new t value. This is a simple application
39 // for De Casteljau's algorithm.
40 s->codeAppendf("float4x2 quadratic_hull = float4x2(%s[0], "
41 "%s[0] + tan0 * t, "
42 "%s[1] + tan1 * t, "
43 "%s[2]);", pts, pts, pts, pts);
44 *tighterHull = "quadratic_hull";
45 }
Chris Daltonbaf3e782018-03-08 15:55:58 +000046}
47
48void GrCCQuadraticShader::onEmitVaryings(GrGLSLVaryingHandler* varyingHandler,
49 GrGLSLVarying::Scope scope, SkString* code,
Chris Dalton04a1de52018-03-14 02:04:09 -060050 const char* position, const char* coverage,
Chris Dalton4c239342018-04-05 18:43:40 -060051 const char* cornerCoverage) {
52 fCoord_fGrad.reset(kFloat4_GrSLType, scope);
53 varyingHandler->addVarying("coord_and_grad", &fCoord_fGrad);
Chris Dalton21ba5512018-03-21 17:20:21 -060054 code->appendf("%s.xy = %s * (%s - %s);", // Quadratic coords.
Chris Dalton4c239342018-04-05 18:43:40 -060055 OutName(fCoord_fGrad), fQCoordMatrix.c_str(), position, fQCoord0.c_str());
Chris Dalton21ba5512018-03-21 17:20:21 -060056 code->appendf("%s.zw = 2*bloat * float2(2 * %s.x, -1) * %s;", // Gradient.
Chris Dalton4c239342018-04-05 18:43:40 -060057 OutName(fCoord_fGrad), OutName(fCoord_fGrad), fQCoordMatrix.c_str());
Chris Daltonbaf3e782018-03-08 15:55:58 +000058
Chris Dalton21ba5512018-03-21 17:20:21 -060059 // Coverages need full precision since distance to the opposite edge can be large.
Chris Dalton4c239342018-04-05 18:43:40 -060060 fEdge_fWind_fCorner.reset(cornerCoverage ? kFloat4_GrSLType : kFloat2_GrSLType, scope);
61 varyingHandler->addVarying("edge_and_wind_and_corner", &fEdge_fWind_fCorner);
62 code->appendf("float edge = dot(%s, float3(%s, 1));", // Distance to flat opposite edge.
63 fEdgeDistanceEquation.c_str(), position);
64 code->appendf("%s.x = edge;", OutName(fEdge_fWind_fCorner));
65 code->appendf("%s.y = %s;", OutName(fEdge_fWind_fCorner), coverage); // coverage == wind.
66
67 if (cornerCoverage) {
68 code->appendf("half hull_coverage;");
69 this->calcHullCoverage(code, OutName(fCoord_fGrad), "edge", "hull_coverage");
70 code->appendf("%s.zw = half2(hull_coverage, 1) * %s;",
71 OutName(fEdge_fWind_fCorner), cornerCoverage);
Chris Dalton21ba5512018-03-21 17:20:21 -060072 }
Chris Daltonbaf3e782018-03-08 15:55:58 +000073}
74
75void GrCCQuadraticShader::onEmitFragmentCode(GrGLSLFPFragmentBuilder* f,
76 const char* outputCoverage) const {
Chris Dalton4c239342018-04-05 18:43:40 -060077 this->calcHullCoverage(&AccessCodeString(f), fCoord_fGrad.fsIn(),
78 SkStringPrintf("%s.x", fEdge_fWind_fCorner.fsIn()).c_str(),
79 outputCoverage);
80 f->codeAppendf("%s *= %s.y;", outputCoverage, fEdge_fWind_fCorner.fsIn()); // Wind.
Chris Daltonbaf3e782018-03-08 15:55:58 +000081
Chris Dalton4c239342018-04-05 18:43:40 -060082 if (kFloat4_GrSLType == fEdge_fWind_fCorner.type()) {
83 f->codeAppendf("%s = %s.z * %s.w + %s;",// Attenuated corner coverage.
84 outputCoverage, fEdge_fWind_fCorner.fsIn(), fEdge_fWind_fCorner.fsIn(),
85 outputCoverage);
Chris Dalton21ba5512018-03-21 17:20:21 -060086 }
Chris Dalton6a3dbee2017-10-16 10:44:41 -060087}
Chris Dalton4c239342018-04-05 18:43:40 -060088
89void GrCCQuadraticShader::calcHullCoverage(SkString* code, const char* coordAndGrad,
90 const char* edge, const char* outputCoverage) const {
91 code->appendf("float x = %s.x, y = %s.y;", coordAndGrad, coordAndGrad);
92 code->appendf("float2 grad = %s.zw;", coordAndGrad);
93 code->append ("float f = x*x - y;");
94 code->append ("float fwidth = abs(grad.x) + abs(grad.y);");
95 code->appendf("%s = min(0.5 - f/fwidth, 1);", outputCoverage); // Curve coverage.
96 code->appendf("half d = min(%s, 0);", edge); // Flat edge opposite the curve.
97 code->appendf("%s = max(%s + d, 0);", outputCoverage, outputCoverage); // Total hull coverage.
98}