blob: 836be31e43197c45e28a1d4867c04f3990c3bad5 [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
8#include "GrCCPRTriangleShader.h"
9
10#include "glsl/GrGLSLFragmentShaderBuilder.h"
Chris Daltonc17bf322017-10-24 10:59:03 -060011#include "glsl/GrGLSLVertexGeoBuilder.h"
Chris Dalton6a3dbee2017-10-16 10:44:41 -060012
Chris Dalton6a3dbee2017-10-16 10:44:41 -060013GrCCPRTriangleHullShader::WindHandling
14GrCCPRTriangleHullShader::onEmitVaryings(GrGLSLVaryingHandler*, SkString* code,
15 const char* /*position*/, const char* /*coverage*/,
16 const char* /*wind*/) {
17 return WindHandling::kNotHandled; // No varyings.Let the base class handle wind.
18}
19
20void GrCCPRTriangleHullShader::onEmitFragmentCode(GrGLSLPPFragmentBuilder* f,
21 const char* outputCoverage) const {
22 f->codeAppendf("%s = 1;", outputCoverage);
23}
24
25GrCCPRTriangleEdgeShader::WindHandling
26GrCCPRTriangleEdgeShader::onEmitVaryings(GrGLSLVaryingHandler* varyingHandler, SkString* code,
27 const char* position, const char* coverage,
28 const char* wind) {
Chris Daltonfdde34e2017-10-16 14:15:26 -060029 varyingHandler->addVarying("coverage_times_wind", &fCoverageTimesWind);
Chris Dalton6a3dbee2017-10-16 10:44:41 -060030 code->appendf("%s = %s * %s;", fCoverageTimesWind.gsOut(), coverage, wind);
31 return WindHandling::kHandled;
32}
33
34void GrCCPRTriangleEdgeShader::onEmitFragmentCode(GrGLSLPPFragmentBuilder* f,
35 const char* outputCoverage) const {
36 f->codeAppendf("%s = %s;", outputCoverage, fCoverageTimesWind.fsIn());
37}
38
39void GrCCPRTriangleCornerShader::emitSetupCode(GrGLSLShaderBuilder* s, const char* pts,
Chris Daltonc17bf322017-10-24 10:59:03 -060040 const char* cornerId, const char* wind,
Chris Dalton6a3dbee2017-10-16 10:44:41 -060041 GeometryVars* vars) const {
42 s->codeAppendf("float2 corner = %s[sk_InvocationID];", pts);
43 vars->fCornerVars.fPoint = "corner";
44
45 s->codeAppendf("float2x2 vectors = float2x2(corner - %s[(sk_InvocationID + 2) %% 3], "
46 "corner - %s[(sk_InvocationID + 1) %% 3]);",
47 pts, pts);
48
49 // Make sure neither vector is 0 to avoid a divide-by-zero. Wind will be zero anyway if this
50 // is the case, so whatever we output won't have any effect as long it isn't NaN or Inf.
51 s->codeAppend ("for (int i = 0; i < 2; ++i) {");
52 s->codeAppend ( "vectors[i] = (vectors[i] != float2(0)) ? vectors[i] : float2(1);");
53 s->codeAppend ("}");
54
55 // Find the vector that bisects the region outside the incoming edges. Each edge is
56 // responsible to subtract the outside region on its own the side of the bisector.
57 s->codeAppendf("float2 leftdir = normalize(vectors[%s > 0 ? 0 : 1]);", wind);
58 s->codeAppendf("float2 rightdir = normalize(vectors[%s > 0 ? 1 : 0]);", wind);
59 s->codeAppend ("float2 bisect = dot(leftdir, rightdir) >= 0 ? "
60 "leftdir + rightdir : "
61 "float2(leftdir.y - rightdir.y, rightdir.x - leftdir.x);");
62
63 // In ccpr we don't calculate exact geometric pixel coverage. What the distance-to-edge
64 // method actually finds is coverage inside a logical "AA box", one that is rotated inline
65 // with the edge, and in our case, up-scaled to circumscribe the actual pixel. Below we set
66 // up transformations into normalized logical AA box space for both incoming edges. These
67 // will tell the fragment shader where the corner is located within each edge's AA box.
68 s->declareGlobal(fAABoxMatrices);
69 s->declareGlobal(fAABoxTranslates);
70 s->declareGlobal(fGeoShaderBisects);
71 s->codeAppendf("for (int i = 0; i < 2; ++i) {");
72 // The X component runs parallel to the edge (i.e. distance to the corner).
73 s->codeAppendf( "float2 n = -vectors[%s > 0 ? i : 1 - i];", wind);
Chris Daltonc17bf322017-10-24 10:59:03 -060074 s->codeAppend ( "float nwidth = (abs(n.x) + abs(n.y)) * (bloat * 2);");
Chris Dalton6a3dbee2017-10-16 10:44:41 -060075 s->codeAppend ( "n /= nwidth;"); // nwidth != 0 because both vectors != 0.
76 s->codeAppendf( "%s[i][0] = n;", fAABoxMatrices.c_str());
77 s->codeAppendf( "%s[i][0] = -dot(n, corner) + .5;", fAABoxTranslates.c_str());
78
79 // The Y component runs perpendicular to the edge (i.e. distance-to-edge).
Chris Dalton6a3dbee2017-10-16 10:44:41 -060080 s->codeAppend ( "n = (i == 0) ? float2(-n.y, n.x) : float2(n.y, -n.x);");
Chris Dalton6a3dbee2017-10-16 10:44:41 -060081 s->codeAppendf( "%s[i][1] = n;", fAABoxMatrices.c_str());
82 s->codeAppendf( "%s[i][1] = -dot(n, corner) + .5;", fAABoxTranslates.c_str());
83
84 // Translate the bisector into logical AA box space.
85 // NOTE: Since the region outside two edges of a convex shape is in [180 deg, 360 deg], the
86 // bisector will therefore be in [90 deg, 180 deg]. Or, x >= 0 and y <= 0 in AA box space.
87 s->codeAppendf( "%s[i] = -bisect * %s[i];",
88 fGeoShaderBisects.c_str(), fAABoxMatrices.c_str());
89 s->codeAppend ("}");
90}
91
92GrCCPRTriangleCornerShader::WindHandling
93GrCCPRTriangleCornerShader::onEmitVaryings(GrGLSLVaryingHandler* varyingHandler, SkString* code,
94 const char* position, const char* /*coverage*/,
95 const char* /*wind*/) {
96 varyingHandler->addVarying("corner_location_in_aa_boxes", &fCornerLocationInAABoxes);
97 varyingHandler->addFlatVarying("bisect_in_aa_boxes", &fBisectInAABoxes);
98 code->appendf("for (int i = 0; i < 2; ++i) {");
99 code->appendf( "%s[i] = %s * %s[i] + %s[i];",
100 fCornerLocationInAABoxes.gsOut(), position, fAABoxMatrices.c_str(),
101 fAABoxTranslates.c_str());
102 code->appendf( "%s[i] = %s[i];", fBisectInAABoxes.gsOut(), fGeoShaderBisects.c_str());
103 code->appendf("}");
104
105 return WindHandling::kNotHandled;
106}
107
108void GrCCPRTriangleCornerShader::onEmitFragmentCode(GrGLSLPPFragmentBuilder* f,
109 const char* outputCoverage) const {
110 // By the time we reach this shader, the pixel is in the following state:
111 //
112 // 1. The hull shader has emitted a coverage of 1.
113 // 2. Both edges have subtracted the area on their outside.
114 //
115 // This generally works, but it is a problem for corner pixels. There is a region within
116 // corner pixels that is outside both edges at the same time. This means the region has been
117 // double subtracted (once by each edge). The purpose of this shader is to fix these corner
118 // pixels.
119 //
120 // More specifically, each edge redoes its coverage analysis so that it only subtracts the
121 // outside area that falls on its own side of the bisector line.
122 //
123 // NOTE: unless the edges fall on multiples of 90 deg from one another, they will have
124 // different AA boxes. (For an explanation of AA boxes, see comments in
125 // onEmitGeometryShader.) This means the coverage analysis will only be approximate. It
126 // seems acceptable, but if we want exact coverage we will need to switch to a more
127 // expensive model.
128 f->codeAppendf("for (int i = 0; i < 2; ++i) {"); // Loop through both edges.
129 f->codeAppendf( "half2 corner = %s[i];", fCornerLocationInAABoxes.fsIn());
130 f->codeAppendf( "half2 bisect = %s[i];", fBisectInAABoxes.fsIn());
131
132 // Find the point at which the bisector exits the logical AA box.
133 // (The inequality works because bisect.x is known >= 0 and bisect.y is known <= 0.)
134 f->codeAppendf( "half2 d = half2(1 - corner.x, -corner.y);");
135 f->codeAppendf( "half T = d.y * bisect.x >= d.x * bisect.y ? d.y / bisect.y "
136 ": d.x / bisect.x;");
137 f->codeAppendf( "half2 exit = corner + bisect * T;");
138
139 // These lines combined (and the final multiply by .5) accomplish the following:
140 // 1. Add back the area beyond the corner that was subtracted out previously.
141 // 2. Subtract out the area beyond the corner, but under the bisector.
142 // The other edge will take care of the area on its own side of the bisector.
143 f->codeAppendf( "%s += (2 - corner.x - exit.x) * corner.y;", outputCoverage);
144 f->codeAppendf( "%s += (corner.x - 1) * exit.y;", outputCoverage);
145 f->codeAppendf("}");
146
147 f->codeAppendf("%s *= .5;", outputCoverage);
148}