ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright 2016 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 | */ |
Mike Klein | 6ad9909 | 2016-10-26 10:35:22 -0400 | [diff] [blame] | 7 | |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 8 | #include "SkSLCompiler.h" |
| 9 | |
ethannicholas | 5961bc9 | 2016-10-12 06:39:56 -0700 | [diff] [blame] | 10 | #include "ast/SkSLASTPrecision.h" |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 11 | #include "SkSLCFGGenerator.h" |
Ethan Nicholas | 941e7e2 | 2016-12-12 15:33:30 -0500 | [diff] [blame] | 12 | #include "SkSLGLSLCodeGenerator.h" |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 13 | #include "SkSLIRGenerator.h" |
| 14 | #include "SkSLParser.h" |
| 15 | #include "SkSLSPIRVCodeGenerator.h" |
| 16 | #include "ir/SkSLExpression.h" |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 17 | #include "ir/SkSLExpressionStatement.h" |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 18 | #include "ir/SkSLIntLiteral.h" |
ethannicholas | 5961bc9 | 2016-10-12 06:39:56 -0700 | [diff] [blame] | 19 | #include "ir/SkSLModifiersDeclaration.h" |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 20 | #include "ir/SkSLNop.h" |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 21 | #include "ir/SkSLSymbolTable.h" |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 22 | #include "ir/SkSLTernaryExpression.h" |
ethannicholas | ddb37d6 | 2016-10-20 09:54:00 -0700 | [diff] [blame] | 23 | #include "ir/SkSLUnresolvedFunction.h" |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 24 | #include "ir/SkSLVarDeclarations.h" |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 25 | |
Ethan Nicholas | a6ae1f7 | 2017-03-16 09:56:54 -0400 | [diff] [blame] | 26 | #ifdef SK_ENABLE_SPIRV_VALIDATION |
| 27 | #include "spirv-tools/libspirv.hpp" |
| 28 | #endif |
| 29 | |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 30 | #define STRINGIFY(x) #x |
| 31 | |
| 32 | // include the built-in shader symbols as static strings |
| 33 | |
ethannicholas | 5961bc9 | 2016-10-12 06:39:56 -0700 | [diff] [blame] | 34 | static const char* SKSL_INCLUDE = |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 35 | #include "sksl.include" |
| 36 | ; |
| 37 | |
ethannicholas | 5961bc9 | 2016-10-12 06:39:56 -0700 | [diff] [blame] | 38 | static const char* SKSL_VERT_INCLUDE = |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 39 | #include "sksl_vert.include" |
| 40 | ; |
| 41 | |
ethannicholas | 5961bc9 | 2016-10-12 06:39:56 -0700 | [diff] [blame] | 42 | static const char* SKSL_FRAG_INCLUDE = |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 43 | #include "sksl_frag.include" |
| 44 | ; |
| 45 | |
Ethan Nicholas | 52cad15 | 2017-02-16 16:37:32 -0500 | [diff] [blame] | 46 | static const char* SKSL_GEOM_INCLUDE = |
| 47 | #include "sksl_geom.include" |
| 48 | ; |
| 49 | |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 50 | namespace SkSL { |
| 51 | |
Mike Klein | 6ad9909 | 2016-10-26 10:35:22 -0400 | [diff] [blame] | 52 | Compiler::Compiler() |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 53 | : fErrorCount(0) { |
Ethan Nicholas | 8feeff9 | 2017-03-30 14:11:58 -0400 | [diff] [blame] | 54 | auto types = std::shared_ptr<SymbolTable>(new SymbolTable(this)); |
| 55 | auto symbols = std::shared_ptr<SymbolTable>(new SymbolTable(types, this)); |
ethannicholas | d598f79 | 2016-07-25 10:08:54 -0700 | [diff] [blame] | 56 | fIRGenerator = new IRGenerator(&fContext, symbols, *this); |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 57 | fTypes = types; |
ethannicholas | d598f79 | 2016-07-25 10:08:54 -0700 | [diff] [blame] | 58 | #define ADD_TYPE(t) types->addWithoutOwnership(fContext.f ## t ## _Type->fName, \ |
| 59 | fContext.f ## t ## _Type.get()) |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 60 | ADD_TYPE(Void); |
| 61 | ADD_TYPE(Float); |
| 62 | ADD_TYPE(Vec2); |
| 63 | ADD_TYPE(Vec3); |
| 64 | ADD_TYPE(Vec4); |
| 65 | ADD_TYPE(Double); |
| 66 | ADD_TYPE(DVec2); |
| 67 | ADD_TYPE(DVec3); |
| 68 | ADD_TYPE(DVec4); |
| 69 | ADD_TYPE(Int); |
| 70 | ADD_TYPE(IVec2); |
| 71 | ADD_TYPE(IVec3); |
| 72 | ADD_TYPE(IVec4); |
| 73 | ADD_TYPE(UInt); |
| 74 | ADD_TYPE(UVec2); |
| 75 | ADD_TYPE(UVec3); |
| 76 | ADD_TYPE(UVec4); |
| 77 | ADD_TYPE(Bool); |
| 78 | ADD_TYPE(BVec2); |
| 79 | ADD_TYPE(BVec3); |
| 80 | ADD_TYPE(BVec4); |
| 81 | ADD_TYPE(Mat2x2); |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 82 | types->addWithoutOwnership(String("mat2x2"), fContext.fMat2x2_Type.get()); |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 83 | ADD_TYPE(Mat2x3); |
| 84 | ADD_TYPE(Mat2x4); |
| 85 | ADD_TYPE(Mat3x2); |
| 86 | ADD_TYPE(Mat3x3); |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 87 | types->addWithoutOwnership(String("mat3x3"), fContext.fMat3x3_Type.get()); |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 88 | ADD_TYPE(Mat3x4); |
| 89 | ADD_TYPE(Mat4x2); |
| 90 | ADD_TYPE(Mat4x3); |
| 91 | ADD_TYPE(Mat4x4); |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 92 | types->addWithoutOwnership(String("mat4x4"), fContext.fMat4x4_Type.get()); |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 93 | ADD_TYPE(GenType); |
| 94 | ADD_TYPE(GenDType); |
| 95 | ADD_TYPE(GenIType); |
| 96 | ADD_TYPE(GenUType); |
| 97 | ADD_TYPE(GenBType); |
| 98 | ADD_TYPE(Mat); |
| 99 | ADD_TYPE(Vec); |
| 100 | ADD_TYPE(GVec); |
| 101 | ADD_TYPE(GVec2); |
| 102 | ADD_TYPE(GVec3); |
| 103 | ADD_TYPE(GVec4); |
| 104 | ADD_TYPE(DVec); |
| 105 | ADD_TYPE(IVec); |
| 106 | ADD_TYPE(UVec); |
| 107 | ADD_TYPE(BVec); |
| 108 | |
| 109 | ADD_TYPE(Sampler1D); |
| 110 | ADD_TYPE(Sampler2D); |
| 111 | ADD_TYPE(Sampler3D); |
ethannicholas | 5961bc9 | 2016-10-12 06:39:56 -0700 | [diff] [blame] | 112 | ADD_TYPE(SamplerExternalOES); |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 113 | ADD_TYPE(SamplerCube); |
| 114 | ADD_TYPE(Sampler2DRect); |
| 115 | ADD_TYPE(Sampler1DArray); |
| 116 | ADD_TYPE(Sampler2DArray); |
| 117 | ADD_TYPE(SamplerCubeArray); |
| 118 | ADD_TYPE(SamplerBuffer); |
| 119 | ADD_TYPE(Sampler2DMS); |
| 120 | ADD_TYPE(Sampler2DMSArray); |
| 121 | |
Brian Salomon | bf7b620 | 2016-11-11 16:08:03 -0500 | [diff] [blame] | 122 | ADD_TYPE(ISampler2D); |
| 123 | |
Brian Salomon | 2a51de8 | 2016-11-16 12:06:01 -0500 | [diff] [blame] | 124 | ADD_TYPE(Image2D); |
| 125 | ADD_TYPE(IImage2D); |
| 126 | |
Greg Daniel | 64773e6 | 2016-11-22 09:44:03 -0500 | [diff] [blame] | 127 | ADD_TYPE(SubpassInput); |
| 128 | ADD_TYPE(SubpassInputMS); |
| 129 | |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 130 | ADD_TYPE(GSampler1D); |
| 131 | ADD_TYPE(GSampler2D); |
| 132 | ADD_TYPE(GSampler3D); |
| 133 | ADD_TYPE(GSamplerCube); |
| 134 | ADD_TYPE(GSampler2DRect); |
| 135 | ADD_TYPE(GSampler1DArray); |
| 136 | ADD_TYPE(GSampler2DArray); |
| 137 | ADD_TYPE(GSamplerCubeArray); |
| 138 | ADD_TYPE(GSamplerBuffer); |
| 139 | ADD_TYPE(GSampler2DMS); |
| 140 | ADD_TYPE(GSampler2DMSArray); |
| 141 | |
| 142 | ADD_TYPE(Sampler1DShadow); |
| 143 | ADD_TYPE(Sampler2DShadow); |
| 144 | ADD_TYPE(SamplerCubeShadow); |
| 145 | ADD_TYPE(Sampler2DRectShadow); |
| 146 | ADD_TYPE(Sampler1DArrayShadow); |
| 147 | ADD_TYPE(Sampler2DArrayShadow); |
| 148 | ADD_TYPE(SamplerCubeArrayShadow); |
| 149 | ADD_TYPE(GSampler2DArrayShadow); |
| 150 | ADD_TYPE(GSamplerCubeArrayShadow); |
| 151 | |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 152 | String skCapsName("sk_Caps"); |
| 153 | Variable* skCaps = new Variable(Position(), Modifiers(), skCapsName, |
Ethan Nicholas | 3605ace | 2016-11-21 15:59:48 -0500 | [diff] [blame] | 154 | *fContext.fSkCaps_Type, Variable::kGlobal_Storage); |
| 155 | fIRGenerator->fSymbolTable->add(skCapsName, std::unique_ptr<Symbol>(skCaps)); |
| 156 | |
ethannicholas | 5961bc9 | 2016-10-12 06:39:56 -0700 | [diff] [blame] | 157 | Modifiers::Flag ignored1; |
| 158 | std::vector<std::unique_ptr<ProgramElement>> ignored2; |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 159 | this->internalConvertProgram(String(SKSL_INCLUDE), &ignored1, &ignored2); |
ethannicholas | ddb37d6 | 2016-10-20 09:54:00 -0700 | [diff] [blame] | 160 | fIRGenerator->fSymbolTable->markAllFunctionsBuiltin(); |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 161 | ASSERT(!fErrorCount); |
| 162 | } |
| 163 | |
| 164 | Compiler::~Compiler() { |
| 165 | delete fIRGenerator; |
| 166 | } |
| 167 | |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 168 | // add the definition created by assigning to the lvalue to the definition set |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 169 | void Compiler::addDefinition(const Expression* lvalue, std::unique_ptr<Expression>* expr, |
| 170 | DefinitionMap* definitions) { |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 171 | switch (lvalue->fKind) { |
| 172 | case Expression::kVariableReference_Kind: { |
| 173 | const Variable& var = ((VariableReference*) lvalue)->fVariable; |
| 174 | if (var.fStorage == Variable::kLocal_Storage) { |
| 175 | (*definitions)[&var] = expr; |
| 176 | } |
| 177 | break; |
| 178 | } |
| 179 | case Expression::kSwizzle_Kind: |
| 180 | // We consider the variable written to as long as at least some of its components have |
| 181 | // been written to. This will lead to some false negatives (we won't catch it if you |
| 182 | // write to foo.x and then read foo.y), but being stricter could lead to false positives |
Mike Klein | 6ad9909 | 2016-10-26 10:35:22 -0400 | [diff] [blame] | 183 | // (we write to foo.x, and then pass foo to a function which happens to only read foo.x, |
| 184 | // but since we pass foo as a whole it is flagged as an error) unless we perform a much |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 185 | // more complicated whole-program analysis. This is probably good enough. |
Mike Klein | 6ad9909 | 2016-10-26 10:35:22 -0400 | [diff] [blame] | 186 | this->addDefinition(((Swizzle*) lvalue)->fBase.get(), |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 187 | (std::unique_ptr<Expression>*) &fContext.fDefined_Expression, |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 188 | definitions); |
| 189 | break; |
| 190 | case Expression::kIndex_Kind: |
| 191 | // see comments in Swizzle |
Mike Klein | 6ad9909 | 2016-10-26 10:35:22 -0400 | [diff] [blame] | 192 | this->addDefinition(((IndexExpression*) lvalue)->fBase.get(), |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 193 | (std::unique_ptr<Expression>*) &fContext.fDefined_Expression, |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 194 | definitions); |
| 195 | break; |
| 196 | case Expression::kFieldAccess_Kind: |
| 197 | // see comments in Swizzle |
Mike Klein | 6ad9909 | 2016-10-26 10:35:22 -0400 | [diff] [blame] | 198 | this->addDefinition(((FieldAccess*) lvalue)->fBase.get(), |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 199 | (std::unique_ptr<Expression>*) &fContext.fDefined_Expression, |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 200 | definitions); |
| 201 | break; |
| 202 | default: |
| 203 | // not an lvalue, can't happen |
| 204 | ASSERT(false); |
| 205 | } |
| 206 | } |
| 207 | |
| 208 | // add local variables defined by this node to the set |
Mike Klein | 6ad9909 | 2016-10-26 10:35:22 -0400 | [diff] [blame] | 209 | void Compiler::addDefinitions(const BasicBlock::Node& node, |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 210 | DefinitionMap* definitions) { |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 211 | switch (node.fKind) { |
| 212 | case BasicBlock::Node::kExpression_Kind: { |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 213 | ASSERT(node.expression()); |
| 214 | const Expression* expr = (Expression*) node.expression()->get(); |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 215 | switch (expr->fKind) { |
| 216 | case Expression::kBinary_Kind: { |
| 217 | BinaryExpression* b = (BinaryExpression*) expr; |
| 218 | if (b->fOperator == Token::EQ) { |
| 219 | this->addDefinition(b->fLeft.get(), &b->fRight, definitions); |
| 220 | } else if (Token::IsAssignment(b->fOperator)) { |
| 221 | this->addDefinition( |
| 222 | b->fLeft.get(), |
| 223 | (std::unique_ptr<Expression>*) &fContext.fDefined_Expression, |
| 224 | definitions); |
| 225 | |
| 226 | } |
| 227 | break; |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 228 | } |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 229 | case Expression::kPrefix_Kind: { |
| 230 | const PrefixExpression* p = (PrefixExpression*) expr; |
| 231 | if (p->fOperator == Token::MINUSMINUS || p->fOperator == Token::PLUSPLUS) { |
| 232 | this->addDefinition( |
| 233 | p->fOperand.get(), |
| 234 | (std::unique_ptr<Expression>*) &fContext.fDefined_Expression, |
| 235 | definitions); |
| 236 | } |
| 237 | break; |
| 238 | } |
| 239 | case Expression::kPostfix_Kind: { |
| 240 | const PostfixExpression* p = (PostfixExpression*) expr; |
| 241 | if (p->fOperator == Token::MINUSMINUS || p->fOperator == Token::PLUSPLUS) { |
| 242 | this->addDefinition( |
| 243 | p->fOperand.get(), |
| 244 | (std::unique_ptr<Expression>*) &fContext.fDefined_Expression, |
| 245 | definitions); |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 246 | } |
| 247 | break; |
| 248 | } |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 249 | case Expression::kVariableReference_Kind: { |
| 250 | const VariableReference* v = (VariableReference*) expr; |
| 251 | if (v->fRefKind != VariableReference::kRead_RefKind) { |
| 252 | this->addDefinition( |
| 253 | v, |
| 254 | (std::unique_ptr<Expression>*) &fContext.fDefined_Expression, |
| 255 | definitions); |
| 256 | } |
| 257 | } |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 258 | default: |
| 259 | break; |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 260 | } |
| 261 | break; |
| 262 | } |
| 263 | case BasicBlock::Node::kStatement_Kind: { |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 264 | const Statement* stmt = (Statement*) node.statement()->get(); |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 265 | if (stmt->fKind == Statement::kVarDeclarations_Kind) { |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 266 | VarDeclarationsStatement* vd = (VarDeclarationsStatement*) stmt; |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 267 | for (const auto& decl : vd->fDeclaration->fVars) { |
| 268 | if (decl->fValue) { |
| 269 | (*definitions)[decl->fVar] = &decl->fValue; |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 270 | } |
| 271 | } |
| 272 | } |
| 273 | break; |
| 274 | } |
| 275 | } |
| 276 | } |
| 277 | |
| 278 | void Compiler::scanCFG(CFG* cfg, BlockId blockId, std::set<BlockId>* workList) { |
| 279 | BasicBlock& block = cfg->fBlocks[blockId]; |
| 280 | |
| 281 | // compute definitions after this block |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 282 | DefinitionMap after = block.fBefore; |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 283 | for (const BasicBlock::Node& n : block.fNodes) { |
| 284 | this->addDefinitions(n, &after); |
| 285 | } |
| 286 | |
| 287 | // propagate definitions to exits |
| 288 | for (BlockId exitId : block.fExits) { |
| 289 | BasicBlock& exit = cfg->fBlocks[exitId]; |
| 290 | for (const auto& pair : after) { |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 291 | std::unique_ptr<Expression>* e1 = pair.second; |
| 292 | auto found = exit.fBefore.find(pair.first); |
| 293 | if (found == exit.fBefore.end()) { |
| 294 | // exit has no definition for it, just copy it |
| 295 | workList->insert(exitId); |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 296 | exit.fBefore[pair.first] = e1; |
| 297 | } else { |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 298 | // exit has a (possibly different) value already defined |
| 299 | std::unique_ptr<Expression>* e2 = exit.fBefore[pair.first]; |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 300 | if (e1 != e2) { |
| 301 | // definition has changed, merge and add exit block to worklist |
| 302 | workList->insert(exitId); |
Ethan Nicholas | af19769 | 2017-02-27 13:26:45 -0500 | [diff] [blame] | 303 | if (e1 && e2) { |
| 304 | exit.fBefore[pair.first] = |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 305 | (std::unique_ptr<Expression>*) &fContext.fDefined_Expression; |
Ethan Nicholas | af19769 | 2017-02-27 13:26:45 -0500 | [diff] [blame] | 306 | } else { |
| 307 | exit.fBefore[pair.first] = nullptr; |
| 308 | } |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 309 | } |
| 310 | } |
| 311 | } |
| 312 | } |
| 313 | } |
| 314 | |
| 315 | // returns a map which maps all local variables in the function to null, indicating that their value |
| 316 | // is initially unknown |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 317 | static DefinitionMap compute_start_state(const CFG& cfg) { |
| 318 | DefinitionMap result; |
Mike Klein | 6ad9909 | 2016-10-26 10:35:22 -0400 | [diff] [blame] | 319 | for (const auto& block : cfg.fBlocks) { |
| 320 | for (const auto& node : block.fNodes) { |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 321 | if (node.fKind == BasicBlock::Node::kStatement_Kind) { |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 322 | ASSERT(node.statement()); |
| 323 | const Statement* s = node.statement()->get(); |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 324 | if (s->fKind == Statement::kVarDeclarations_Kind) { |
| 325 | const VarDeclarationsStatement* vd = (const VarDeclarationsStatement*) s; |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 326 | for (const auto& decl : vd->fDeclaration->fVars) { |
| 327 | result[decl->fVar] = nullptr; |
Mike Klein | 6ad9909 | 2016-10-26 10:35:22 -0400 | [diff] [blame] | 328 | } |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 329 | } |
| 330 | } |
| 331 | } |
| 332 | } |
| 333 | return result; |
| 334 | } |
| 335 | |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 336 | /** |
| 337 | * Returns true if assigning to this lvalue has no effect. |
| 338 | */ |
| 339 | static bool is_dead(const Expression& lvalue) { |
| 340 | switch (lvalue.fKind) { |
| 341 | case Expression::kVariableReference_Kind: |
| 342 | return ((VariableReference&) lvalue).fVariable.dead(); |
| 343 | case Expression::kSwizzle_Kind: |
| 344 | return is_dead(*((Swizzle&) lvalue).fBase); |
| 345 | case Expression::kFieldAccess_Kind: |
| 346 | return is_dead(*((FieldAccess&) lvalue).fBase); |
| 347 | case Expression::kIndex_Kind: { |
| 348 | const IndexExpression& idx = (IndexExpression&) lvalue; |
| 349 | return is_dead(*idx.fBase) && !idx.fIndex->hasSideEffects(); |
| 350 | } |
| 351 | default: |
| 352 | ABORT("invalid lvalue: %s\n", lvalue.description().c_str()); |
| 353 | } |
| 354 | } |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 355 | |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 356 | /** |
| 357 | * Returns true if this is an assignment which can be collapsed down to just the right hand side due |
| 358 | * to a dead target and lack of side effects on the left hand side. |
| 359 | */ |
| 360 | static bool dead_assignment(const BinaryExpression& b) { |
| 361 | if (!Token::IsAssignment(b.fOperator)) { |
| 362 | return false; |
| 363 | } |
| 364 | return is_dead(*b.fLeft); |
| 365 | } |
| 366 | |
| 367 | void Compiler::computeDataFlow(CFG* cfg) { |
| 368 | cfg->fBlocks[cfg->fStart].fBefore = compute_start_state(*cfg); |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 369 | std::set<BlockId> workList; |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 370 | for (BlockId i = 0; i < cfg->fBlocks.size(); i++) { |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 371 | workList.insert(i); |
| 372 | } |
| 373 | while (workList.size()) { |
| 374 | BlockId next = *workList.begin(); |
| 375 | workList.erase(workList.begin()); |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 376 | this->scanCFG(cfg, next, &workList); |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 377 | } |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 378 | } |
| 379 | |
| 380 | /** |
| 381 | * Attempts to replace the expression pointed to by iter with a new one (in both the CFG and the |
| 382 | * IR). If the expression can be cleanly removed, returns true and updates the iterator to point to |
| 383 | * the newly-inserted element. Otherwise updates only the IR and returns false (and the CFG will |
| 384 | * need to be regenerated). |
| 385 | */ |
| 386 | bool try_replace_expression(BasicBlock* b, |
| 387 | std::vector<BasicBlock::Node>::iterator* iter, |
| 388 | std::unique_ptr<Expression>* newExpression) { |
| 389 | std::unique_ptr<Expression>* target = (*iter)->expression(); |
| 390 | if (!b->tryRemoveExpression(iter)) { |
| 391 | *target = std::move(*newExpression); |
| 392 | return false; |
| 393 | } |
| 394 | *target = std::move(*newExpression); |
| 395 | return b->tryInsertExpression(iter, target); |
| 396 | } |
| 397 | |
| 398 | /** |
| 399 | * Returns true if the expression is a constant numeric literal with the specified value. |
| 400 | */ |
| 401 | bool is_constant(Expression& expr, double value) { |
| 402 | switch (expr.fKind) { |
| 403 | case Expression::kIntLiteral_Kind: |
| 404 | return ((IntLiteral&) expr).fValue == value; |
| 405 | case Expression::kFloatLiteral_Kind: |
| 406 | return ((FloatLiteral&) expr).fValue == value; |
| 407 | default: |
| 408 | return false; |
| 409 | } |
| 410 | } |
| 411 | |
| 412 | /** |
| 413 | * Collapses the binary expression pointed to by iter down to just the right side (in both the IR |
| 414 | * and CFG structures). |
| 415 | */ |
| 416 | void delete_left(BasicBlock* b, |
| 417 | std::vector<BasicBlock::Node>::iterator* iter, |
| 418 | bool* outUpdated, |
| 419 | bool* outNeedsRescan) { |
| 420 | *outUpdated = true; |
| 421 | if (!try_replace_expression(b, iter, &((BinaryExpression&) **(*iter)->expression()).fRight)) { |
| 422 | *outNeedsRescan = true; |
| 423 | } |
| 424 | } |
| 425 | |
| 426 | /** |
| 427 | * Collapses the binary expression pointed to by iter down to just the left side (in both the IR and |
| 428 | * CFG structures). |
| 429 | */ |
| 430 | void delete_right(BasicBlock* b, |
| 431 | std::vector<BasicBlock::Node>::iterator* iter, |
| 432 | bool* outUpdated, |
| 433 | bool* outNeedsRescan) { |
| 434 | *outUpdated = true; |
| 435 | if (!try_replace_expression(b, iter, &((BinaryExpression&) **(*iter)->expression()).fLeft)) { |
| 436 | *outNeedsRescan = true; |
| 437 | } |
| 438 | } |
| 439 | |
| 440 | void Compiler::simplifyExpression(DefinitionMap& definitions, |
| 441 | BasicBlock& b, |
| 442 | std::vector<BasicBlock::Node>::iterator* iter, |
| 443 | std::unordered_set<const Variable*>* undefinedVariables, |
| 444 | bool* outUpdated, |
| 445 | bool* outNeedsRescan) { |
| 446 | Expression* expr = (*iter)->expression()->get(); |
| 447 | ASSERT(expr); |
| 448 | if ((*iter)->fConstantPropagation) { |
| 449 | std::unique_ptr<Expression> optimized = expr->constantPropagate(*fIRGenerator, definitions); |
| 450 | if (optimized) { |
| 451 | if (!try_replace_expression(&b, iter, &optimized)) { |
| 452 | *outNeedsRescan = true; |
| 453 | } |
| 454 | ASSERT((*iter)->fKind == BasicBlock::Node::kExpression_Kind); |
| 455 | expr = (*iter)->expression()->get(); |
| 456 | *outUpdated = true; |
| 457 | } |
| 458 | } |
| 459 | switch (expr->fKind) { |
| 460 | case Expression::kVariableReference_Kind: { |
| 461 | const Variable& var = ((VariableReference*) expr)->fVariable; |
| 462 | if (var.fStorage == Variable::kLocal_Storage && !definitions[&var] && |
| 463 | (*undefinedVariables).find(&var) == (*undefinedVariables).end()) { |
| 464 | (*undefinedVariables).insert(&var); |
| 465 | this->error(expr->fPosition, |
| 466 | "'" + var.fName + "' has not been assigned"); |
| 467 | } |
| 468 | break; |
| 469 | } |
| 470 | case Expression::kTernary_Kind: { |
| 471 | TernaryExpression* t = (TernaryExpression*) expr; |
| 472 | if (t->fTest->fKind == Expression::kBoolLiteral_Kind) { |
| 473 | // ternary has a constant test, replace it with either the true or |
| 474 | // false branch |
| 475 | if (((BoolLiteral&) *t->fTest).fValue) { |
| 476 | (*iter)->setExpression(std::move(t->fIfTrue)); |
| 477 | } else { |
| 478 | (*iter)->setExpression(std::move(t->fIfFalse)); |
| 479 | } |
| 480 | *outUpdated = true; |
| 481 | *outNeedsRescan = true; |
| 482 | } |
| 483 | break; |
| 484 | } |
| 485 | case Expression::kBinary_Kind: { |
| 486 | // collapse useless expressions like x * 1 or x + 0 |
| 487 | BinaryExpression* bin = (BinaryExpression*) expr; |
| 488 | switch (bin->fOperator) { |
| 489 | case Token::STAR: |
| 490 | if (is_constant(*bin->fLeft, 1)) { |
| 491 | delete_left(&b, iter, outUpdated, outNeedsRescan); |
| 492 | } |
| 493 | else if (is_constant(*bin->fRight, 1)) { |
| 494 | delete_right(&b, iter, outUpdated, outNeedsRescan); |
| 495 | } |
| 496 | break; |
| 497 | case Token::PLUS: // fall through |
| 498 | case Token::MINUS: |
| 499 | if (is_constant(*bin->fLeft, 0)) { |
| 500 | delete_left(&b, iter, outUpdated, outNeedsRescan); |
| 501 | } |
| 502 | else if (is_constant(*bin->fRight, 0)) { |
| 503 | delete_right(&b, iter, outUpdated, outNeedsRescan); |
| 504 | } |
| 505 | break; |
| 506 | case Token::SLASH: |
| 507 | if (is_constant(*bin->fRight, 1)) { |
| 508 | delete_right(&b, iter, outUpdated, outNeedsRescan); |
| 509 | } |
| 510 | break; |
| 511 | default: |
| 512 | break; |
| 513 | } |
| 514 | } |
| 515 | default: |
| 516 | break; |
| 517 | } |
| 518 | } |
| 519 | |
| 520 | void Compiler::simplifyStatement(DefinitionMap& definitions, |
| 521 | BasicBlock& b, |
| 522 | std::vector<BasicBlock::Node>::iterator* iter, |
| 523 | std::unordered_set<const Variable*>* undefinedVariables, |
| 524 | bool* outUpdated, |
| 525 | bool* outNeedsRescan) { |
| 526 | Statement* stmt = (*iter)->statement()->get(); |
| 527 | switch (stmt->fKind) { |
| 528 | case Statement::kVarDeclarations_Kind: { |
| 529 | VarDeclarations& vd = *((VarDeclarationsStatement&) *stmt).fDeclaration; |
| 530 | for (auto varIter = vd.fVars.begin(); varIter != vd.fVars.end(); ) { |
| 531 | const auto& varDecl = **varIter; |
| 532 | if (varDecl.fVar->dead() && |
| 533 | (!varDecl.fValue || |
| 534 | !varDecl.fValue->hasSideEffects())) { |
| 535 | if (varDecl.fValue) { |
| 536 | ASSERT((*iter)->statement()->get() == stmt); |
| 537 | if (!b.tryRemoveExpressionBefore(iter, varDecl.fValue.get())) { |
| 538 | *outNeedsRescan = true; |
| 539 | } |
| 540 | } |
| 541 | varIter = vd.fVars.erase(varIter); |
| 542 | *outUpdated = true; |
| 543 | } else { |
| 544 | ++varIter; |
| 545 | } |
| 546 | } |
| 547 | if (vd.fVars.size() == 0) { |
| 548 | (*iter)->setStatement(std::unique_ptr<Statement>(new Nop())); |
| 549 | } |
| 550 | break; |
| 551 | } |
| 552 | case Statement::kIf_Kind: { |
| 553 | IfStatement& i = (IfStatement&) *stmt; |
| 554 | if (i.fIfFalse && i.fIfFalse->isEmpty()) { |
| 555 | // else block doesn't do anything, remove it |
| 556 | i.fIfFalse.reset(); |
| 557 | *outUpdated = true; |
| 558 | *outNeedsRescan = true; |
| 559 | } |
| 560 | if (!i.fIfFalse && i.fIfTrue->isEmpty()) { |
| 561 | // if block doesn't do anything, no else block |
| 562 | if (i.fTest->hasSideEffects()) { |
| 563 | // test has side effects, keep it |
| 564 | (*iter)->setStatement(std::unique_ptr<Statement>( |
| 565 | new ExpressionStatement(std::move(i.fTest)))); |
| 566 | } else { |
| 567 | // no if, no else, no test side effects, kill the whole if |
| 568 | // statement |
| 569 | (*iter)->setStatement(std::unique_ptr<Statement>(new Nop())); |
| 570 | } |
| 571 | *outUpdated = true; |
| 572 | *outNeedsRescan = true; |
| 573 | } |
| 574 | break; |
| 575 | } |
| 576 | case Statement::kExpression_Kind: { |
| 577 | ExpressionStatement& e = (ExpressionStatement&) *stmt; |
| 578 | ASSERT((*iter)->statement()->get() == &e); |
| 579 | if (e.fExpression->fKind == Expression::kBinary_Kind) { |
| 580 | BinaryExpression& bin = (BinaryExpression&) *e.fExpression; |
| 581 | if (dead_assignment(bin)) { |
| 582 | if (!b.tryRemoveExpressionBefore(iter, &bin)) { |
| 583 | *outNeedsRescan = true; |
| 584 | } |
| 585 | if (bin.fRight->hasSideEffects()) { |
| 586 | // still have to evaluate the right due to side effects, |
| 587 | // replace the binary expression with just the right side |
| 588 | e.fExpression = std::move(bin.fRight); |
| 589 | if (!b.tryInsertExpression(iter, &e.fExpression)) { |
| 590 | *outNeedsRescan = true; |
| 591 | } |
| 592 | } else { |
| 593 | // no side effects, kill the whole statement |
| 594 | ASSERT((*iter)->statement()->get() == stmt); |
| 595 | (*iter)->setStatement(std::unique_ptr<Statement>(new Nop())); |
| 596 | } |
| 597 | *outUpdated = true; |
| 598 | break; |
| 599 | } |
| 600 | } |
| 601 | if (!e.fExpression->hasSideEffects()) { |
| 602 | // Expression statement with no side effects, kill it |
| 603 | if (!b.tryRemoveExpressionBefore(iter, e.fExpression.get())) { |
| 604 | *outNeedsRescan = true; |
| 605 | } |
| 606 | ASSERT((*iter)->statement()->get() == stmt); |
| 607 | (*iter)->setStatement(std::unique_ptr<Statement>(new Nop())); |
| 608 | *outUpdated = true; |
| 609 | } |
| 610 | break; |
| 611 | } |
| 612 | default: |
| 613 | break; |
| 614 | } |
| 615 | } |
| 616 | |
| 617 | void Compiler::scanCFG(FunctionDefinition& f) { |
| 618 | CFG cfg = CFGGenerator().getCFG(f); |
| 619 | this->computeDataFlow(&cfg); |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 620 | |
| 621 | // check for unreachable code |
| 622 | for (size_t i = 0; i < cfg.fBlocks.size(); i++) { |
Mike Klein | 6ad9909 | 2016-10-26 10:35:22 -0400 | [diff] [blame] | 623 | if (i != cfg.fStart && !cfg.fBlocks[i].fEntrances.size() && |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 624 | cfg.fBlocks[i].fNodes.size()) { |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 625 | Position p; |
| 626 | switch (cfg.fBlocks[i].fNodes[0].fKind) { |
| 627 | case BasicBlock::Node::kStatement_Kind: |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 628 | p = (*cfg.fBlocks[i].fNodes[0].statement())->fPosition; |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 629 | break; |
| 630 | case BasicBlock::Node::kExpression_Kind: |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 631 | p = (*cfg.fBlocks[i].fNodes[0].expression())->fPosition; |
Ethan Nicholas | 86a4340 | 2017-01-19 13:32:00 -0500 | [diff] [blame] | 632 | break; |
| 633 | } |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 634 | this->error(p, String("unreachable")); |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 635 | } |
| 636 | } |
| 637 | if (fErrorCount) { |
| 638 | return; |
| 639 | } |
| 640 | |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 641 | // check for dead code & undefined variables, perform constant propagation |
| 642 | std::unordered_set<const Variable*> undefinedVariables; |
| 643 | bool updated; |
| 644 | bool needsRescan = false; |
| 645 | do { |
| 646 | if (needsRescan) { |
| 647 | cfg = CFGGenerator().getCFG(f); |
| 648 | this->computeDataFlow(&cfg); |
| 649 | needsRescan = false; |
Ethan Nicholas | 113628d | 2017-02-02 16:11:39 -0500 | [diff] [blame] | 650 | } |
Ethan Nicholas | cb67096 | 2017-04-20 19:31:52 -0400 | [diff] [blame^] | 651 | |
| 652 | updated = false; |
| 653 | for (BasicBlock& b : cfg.fBlocks) { |
| 654 | DefinitionMap definitions = b.fBefore; |
| 655 | |
| 656 | for (auto iter = b.fNodes.begin(); iter != b.fNodes.end() && !needsRescan; ++iter) { |
| 657 | if (iter->fKind == BasicBlock::Node::kExpression_Kind) { |
| 658 | this->simplifyExpression(definitions, b, &iter, &undefinedVariables, &updated, |
| 659 | &needsRescan); |
| 660 | } else { |
| 661 | this->simplifyStatement(definitions, b, &iter, &undefinedVariables, &updated, |
| 662 | &needsRescan); |
| 663 | } |
| 664 | this->addDefinitions(*iter, &definitions); |
| 665 | } |
| 666 | } |
| 667 | } while (updated); |
| 668 | ASSERT(!needsRescan); |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 669 | |
| 670 | // check for missing return |
| 671 | if (f.fDeclaration.fReturnType != *fContext.fVoid_Type) { |
| 672 | if (cfg.fBlocks[cfg.fExit].fEntrances.size()) { |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 673 | this->error(f.fPosition, String("function can exit without returning a value")); |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 674 | } |
| 675 | } |
| 676 | } |
| 677 | |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 678 | void Compiler::internalConvertProgram(String text, |
ethannicholas | 5961bc9 | 2016-10-12 06:39:56 -0700 | [diff] [blame] | 679 | Modifiers::Flag* defaultPrecision, |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 680 | std::vector<std::unique_ptr<ProgramElement>>* result) { |
| 681 | Parser parser(text, *fTypes, *this); |
| 682 | std::vector<std::unique_ptr<ASTDeclaration>> parsed = parser.file(); |
| 683 | if (fErrorCount) { |
| 684 | return; |
| 685 | } |
ethannicholas | 5961bc9 | 2016-10-12 06:39:56 -0700 | [diff] [blame] | 686 | *defaultPrecision = Modifiers::kHighp_Flag; |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 687 | for (size_t i = 0; i < parsed.size(); i++) { |
| 688 | ASTDeclaration& decl = *parsed[i]; |
| 689 | switch (decl.fKind) { |
| 690 | case ASTDeclaration::kVar_Kind: { |
ethannicholas | 14fe8cc | 2016-09-07 13:37:16 -0700 | [diff] [blame] | 691 | std::unique_ptr<VarDeclarations> s = fIRGenerator->convertVarDeclarations( |
Mike Klein | 6ad9909 | 2016-10-26 10:35:22 -0400 | [diff] [blame] | 692 | (ASTVarDeclarations&) decl, |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 693 | Variable::kGlobal_Storage); |
| 694 | if (s) { |
| 695 | result->push_back(std::move(s)); |
| 696 | } |
| 697 | break; |
| 698 | } |
| 699 | case ASTDeclaration::kFunction_Kind: { |
| 700 | std::unique_ptr<FunctionDefinition> f = fIRGenerator->convertFunction( |
| 701 | (ASTFunction&) decl); |
ethannicholas | 22f939e | 2016-10-13 13:25:34 -0700 | [diff] [blame] | 702 | if (!fErrorCount && f) { |
| 703 | this->scanCFG(*f); |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 704 | result->push_back(std::move(f)); |
| 705 | } |
| 706 | break; |
| 707 | } |
ethannicholas | 5961bc9 | 2016-10-12 06:39:56 -0700 | [diff] [blame] | 708 | case ASTDeclaration::kModifiers_Kind: { |
| 709 | std::unique_ptr<ModifiersDeclaration> f = fIRGenerator->convertModifiersDeclaration( |
| 710 | (ASTModifiersDeclaration&) decl); |
| 711 | if (f) { |
| 712 | result->push_back(std::move(f)); |
| 713 | } |
| 714 | break; |
| 715 | } |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 716 | case ASTDeclaration::kInterfaceBlock_Kind: { |
| 717 | std::unique_ptr<InterfaceBlock> i = fIRGenerator->convertInterfaceBlock( |
| 718 | (ASTInterfaceBlock&) decl); |
| 719 | if (i) { |
| 720 | result->push_back(std::move(i)); |
| 721 | } |
| 722 | break; |
| 723 | } |
| 724 | case ASTDeclaration::kExtension_Kind: { |
| 725 | std::unique_ptr<Extension> e = fIRGenerator->convertExtension((ASTExtension&) decl); |
| 726 | if (e) { |
| 727 | result->push_back(std::move(e)); |
| 728 | } |
| 729 | break; |
| 730 | } |
ethannicholas | 5961bc9 | 2016-10-12 06:39:56 -0700 | [diff] [blame] | 731 | case ASTDeclaration::kPrecision_Kind: { |
| 732 | *defaultPrecision = ((ASTPrecision&) decl).fPrecision; |
| 733 | break; |
| 734 | } |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 735 | default: |
| 736 | ABORT("unsupported declaration: %s\n", decl.description().c_str()); |
| 737 | } |
| 738 | } |
| 739 | } |
| 740 | |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 741 | std::unique_ptr<Program> Compiler::convertProgram(Program::Kind kind, String text, |
Ethan Nicholas | 941e7e2 | 2016-12-12 15:33:30 -0500 | [diff] [blame] | 742 | const Program::Settings& settings) { |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 743 | fErrorText = ""; |
| 744 | fErrorCount = 0; |
Ethan Nicholas | 941e7e2 | 2016-12-12 15:33:30 -0500 | [diff] [blame] | 745 | fIRGenerator->start(&settings); |
ethannicholas | d598f79 | 2016-07-25 10:08:54 -0700 | [diff] [blame] | 746 | std::vector<std::unique_ptr<ProgramElement>> elements; |
ethannicholas | 5961bc9 | 2016-10-12 06:39:56 -0700 | [diff] [blame] | 747 | Modifiers::Flag ignored; |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 748 | switch (kind) { |
| 749 | case Program::kVertex_Kind: |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 750 | this->internalConvertProgram(String(SKSL_VERT_INCLUDE), &ignored, &elements); |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 751 | break; |
| 752 | case Program::kFragment_Kind: |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 753 | this->internalConvertProgram(String(SKSL_FRAG_INCLUDE), &ignored, &elements); |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 754 | break; |
Ethan Nicholas | 52cad15 | 2017-02-16 16:37:32 -0500 | [diff] [blame] | 755 | case Program::kGeometry_Kind: |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 756 | this->internalConvertProgram(String(SKSL_GEOM_INCLUDE), &ignored, &elements); |
Ethan Nicholas | 52cad15 | 2017-02-16 16:37:32 -0500 | [diff] [blame] | 757 | break; |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 758 | } |
ethannicholas | ddb37d6 | 2016-10-20 09:54:00 -0700 | [diff] [blame] | 759 | fIRGenerator->fSymbolTable->markAllFunctionsBuiltin(); |
ethannicholas | 5961bc9 | 2016-10-12 06:39:56 -0700 | [diff] [blame] | 760 | Modifiers::Flag defaultPrecision; |
| 761 | this->internalConvertProgram(text, &defaultPrecision, &elements); |
Ethan Nicholas | 941e7e2 | 2016-12-12 15:33:30 -0500 | [diff] [blame] | 762 | auto result = std::unique_ptr<Program>(new Program(kind, settings, defaultPrecision, &fContext, |
| 763 | std::move(elements), |
| 764 | fIRGenerator->fSymbolTable, |
| 765 | fIRGenerator->fInputs)); |
Ethan Nicholas | 3605ace | 2016-11-21 15:59:48 -0500 | [diff] [blame] | 766 | fIRGenerator->finish(); |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 767 | this->writeErrorCount(); |
Ethan Nicholas | 941e7e2 | 2016-12-12 15:33:30 -0500 | [diff] [blame] | 768 | if (fErrorCount) { |
| 769 | return nullptr; |
| 770 | } |
| 771 | return result; |
| 772 | } |
| 773 | |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 774 | bool Compiler::toSPIRV(const Program& program, OutputStream& out) { |
Ethan Nicholas | a6ae1f7 | 2017-03-16 09:56:54 -0400 | [diff] [blame] | 775 | #ifdef SK_ENABLE_SPIRV_VALIDATION |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 776 | StringStream buffer; |
Ethan Nicholas | a6ae1f7 | 2017-03-16 09:56:54 -0400 | [diff] [blame] | 777 | SPIRVCodeGenerator cg(&fContext, &program, this, &buffer); |
| 778 | bool result = cg.generateCode(); |
| 779 | if (result) { |
Ethan Nicholas | a6ae1f7 | 2017-03-16 09:56:54 -0400 | [diff] [blame] | 780 | spvtools::SpirvTools tools(SPV_ENV_VULKAN_1_0); |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 781 | ASSERT(0 == buffer.size() % 4); |
Ethan Nicholas | a6ae1f7 | 2017-03-16 09:56:54 -0400 | [diff] [blame] | 782 | auto dumpmsg = [](spv_message_level_t, const char*, const spv_position_t&, const char* m) { |
| 783 | SkDebugf("SPIR-V validation error: %s\n", m); |
| 784 | }; |
| 785 | tools.SetMessageConsumer(dumpmsg); |
| 786 | // Verify that the SPIR-V we produced is valid. If this assert fails, check the logs prior |
| 787 | // to the failure to see the validation errors. |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 788 | ASSERT_RESULT(tools.Validate((const uint32_t*) buffer.data(), buffer.size() / 4)); |
| 789 | out.write(buffer.data(), buffer.size()); |
Ethan Nicholas | a6ae1f7 | 2017-03-16 09:56:54 -0400 | [diff] [blame] | 790 | } |
| 791 | #else |
Ethan Nicholas | 941e7e2 | 2016-12-12 15:33:30 -0500 | [diff] [blame] | 792 | SPIRVCodeGenerator cg(&fContext, &program, this, &out); |
| 793 | bool result = cg.generateCode(); |
Ethan Nicholas | a6ae1f7 | 2017-03-16 09:56:54 -0400 | [diff] [blame] | 794 | #endif |
Ethan Nicholas | 941e7e2 | 2016-12-12 15:33:30 -0500 | [diff] [blame] | 795 | this->writeErrorCount(); |
Ethan Nicholas | ce33f10 | 2016-12-09 17:22:59 -0500 | [diff] [blame] | 796 | return result; |
| 797 | } |
| 798 | |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 799 | bool Compiler::toSPIRV(const Program& program, String* out) { |
| 800 | StringStream buffer; |
Ethan Nicholas | 941e7e2 | 2016-12-12 15:33:30 -0500 | [diff] [blame] | 801 | bool result = this->toSPIRV(program, buffer); |
| 802 | if (result) { |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 803 | *out = String(buffer.data(), buffer.size()); |
Ethan Nicholas | 941e7e2 | 2016-12-12 15:33:30 -0500 | [diff] [blame] | 804 | } |
| 805 | return result; |
| 806 | } |
| 807 | |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 808 | bool Compiler::toGLSL(const Program& program, OutputStream& out) { |
Ethan Nicholas | 941e7e2 | 2016-12-12 15:33:30 -0500 | [diff] [blame] | 809 | GLSLCodeGenerator cg(&fContext, &program, this, &out); |
| 810 | bool result = cg.generateCode(); |
| 811 | this->writeErrorCount(); |
| 812 | return result; |
| 813 | } |
| 814 | |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 815 | bool Compiler::toGLSL(const Program& program, String* out) { |
| 816 | StringStream buffer; |
Ethan Nicholas | 941e7e2 | 2016-12-12 15:33:30 -0500 | [diff] [blame] | 817 | bool result = this->toGLSL(program, buffer); |
| 818 | if (result) { |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 819 | *out = String(buffer.data(), buffer.size()); |
Ethan Nicholas | 941e7e2 | 2016-12-12 15:33:30 -0500 | [diff] [blame] | 820 | } |
| 821 | return result; |
| 822 | } |
| 823 | |
| 824 | |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 825 | void Compiler::error(Position position, String msg) { |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 826 | fErrorCount++; |
| 827 | fErrorText += "error: " + position.description() + ": " + msg.c_str() + "\n"; |
| 828 | } |
| 829 | |
Ethan Nicholas | 0df1b04 | 2017-03-31 13:56:23 -0400 | [diff] [blame] | 830 | String Compiler::errorText() { |
| 831 | String result = fErrorText; |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 832 | return result; |
| 833 | } |
| 834 | |
| 835 | void Compiler::writeErrorCount() { |
| 836 | if (fErrorCount) { |
| 837 | fErrorText += to_string(fErrorCount) + " error"; |
| 838 | if (fErrorCount > 1) { |
| 839 | fErrorText += "s"; |
| 840 | } |
| 841 | fErrorText += "\n"; |
| 842 | } |
| 843 | } |
| 844 | |
ethannicholas | b3058bd | 2016-07-01 08:22:01 -0700 | [diff] [blame] | 845 | } // namespace |