Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 1 | /* |
| 2 | * Copyright 2019 Google LLC |
| 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 | #ifndef SKSL_BYTECODEGENERATOR |
| 9 | #define SKSL_BYTECODEGENERATOR |
| 10 | |
Brian Osman | 4a47da7 | 2019-07-12 11:30:32 -0400 | [diff] [blame] | 11 | #include <algorithm> |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 12 | #include <stack> |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 13 | #include <unordered_map> |
| 14 | |
Mike Klein | c0bd9f9 | 2019-04-23 12:05:21 -0500 | [diff] [blame] | 15 | #include "src/sksl/SkSLByteCode.h" |
| 16 | #include "src/sksl/SkSLCodeGenerator.h" |
| 17 | #include "src/sksl/SkSLMemoryLayout.h" |
| 18 | #include "src/sksl/ir/SkSLBinaryExpression.h" |
| 19 | #include "src/sksl/ir/SkSLBlock.h" |
| 20 | #include "src/sksl/ir/SkSLBoolLiteral.h" |
| 21 | #include "src/sksl/ir/SkSLBreakStatement.h" |
| 22 | #include "src/sksl/ir/SkSLConstructor.h" |
| 23 | #include "src/sksl/ir/SkSLContinueStatement.h" |
| 24 | #include "src/sksl/ir/SkSLDoStatement.h" |
Mike Klein | fe0aeb3 | 2019-05-20 10:55:11 -0500 | [diff] [blame] | 25 | #include "src/sksl/ir/SkSLExpressionStatement.h" |
Ethan Nicholas | 9e6a393 | 2019-05-17 16:31:21 -0400 | [diff] [blame] | 26 | #include "src/sksl/ir/SkSLExternalFunctionCall.h" |
Ethan Nicholas | 91164d1 | 2019-05-15 15:29:54 -0400 | [diff] [blame] | 27 | #include "src/sksl/ir/SkSLExternalValueReference.h" |
Mike Klein | c0bd9f9 | 2019-04-23 12:05:21 -0500 | [diff] [blame] | 28 | #include "src/sksl/ir/SkSLFieldAccess.h" |
| 29 | #include "src/sksl/ir/SkSLFloatLiteral.h" |
| 30 | #include "src/sksl/ir/SkSLForStatement.h" |
| 31 | #include "src/sksl/ir/SkSLFunctionCall.h" |
| 32 | #include "src/sksl/ir/SkSLFunctionDeclaration.h" |
| 33 | #include "src/sksl/ir/SkSLFunctionDefinition.h" |
| 34 | #include "src/sksl/ir/SkSLIfStatement.h" |
| 35 | #include "src/sksl/ir/SkSLIndexExpression.h" |
| 36 | #include "src/sksl/ir/SkSLIntLiteral.h" |
| 37 | #include "src/sksl/ir/SkSLInterfaceBlock.h" |
| 38 | #include "src/sksl/ir/SkSLNullLiteral.h" |
| 39 | #include "src/sksl/ir/SkSLPostfixExpression.h" |
| 40 | #include "src/sksl/ir/SkSLPrefixExpression.h" |
| 41 | #include "src/sksl/ir/SkSLProgramElement.h" |
| 42 | #include "src/sksl/ir/SkSLReturnStatement.h" |
| 43 | #include "src/sksl/ir/SkSLStatement.h" |
| 44 | #include "src/sksl/ir/SkSLSwitchStatement.h" |
| 45 | #include "src/sksl/ir/SkSLSwizzle.h" |
| 46 | #include "src/sksl/ir/SkSLTernaryExpression.h" |
| 47 | #include "src/sksl/ir/SkSLVarDeclarations.h" |
| 48 | #include "src/sksl/ir/SkSLVarDeclarationsStatement.h" |
| 49 | #include "src/sksl/ir/SkSLVariableReference.h" |
| 50 | #include "src/sksl/ir/SkSLWhileStatement.h" |
| 51 | #include "src/sksl/spirv.h" |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 52 | |
| 53 | namespace SkSL { |
| 54 | |
| 55 | class ByteCodeGenerator : public CodeGenerator { |
| 56 | public: |
| 57 | class LValue { |
| 58 | public: |
| 59 | LValue(ByteCodeGenerator& generator) |
| 60 | : fGenerator(generator) {} |
| 61 | |
| 62 | virtual ~LValue() {} |
| 63 | |
| 64 | /** |
| 65 | * Stack before call: ... lvalue |
| 66 | * Stack after call: ... lvalue load |
| 67 | */ |
| 68 | virtual void load() = 0; |
| 69 | |
| 70 | /** |
| 71 | * Stack before call: ... lvalue value |
| 72 | * Stack after call: ... |
| 73 | */ |
Brian Osman | 3e29f1d | 2019-05-28 09:35:05 -0400 | [diff] [blame] | 74 | virtual void store(bool discard) = 0; |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 75 | |
| 76 | protected: |
| 77 | ByteCodeGenerator& fGenerator; |
| 78 | }; |
| 79 | |
| 80 | ByteCodeGenerator(const Context* context, const Program* program, ErrorReporter* errors, |
Ethan Nicholas | 82162ee | 2019-05-21 16:05:08 -0400 | [diff] [blame] | 81 | ByteCode* output); |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 82 | |
| 83 | bool generateCode() override; |
| 84 | |
| 85 | void write8(uint8_t b); |
| 86 | |
| 87 | void write16(uint16_t b); |
| 88 | |
| 89 | void write32(uint32_t b); |
| 90 | |
| 91 | void write(ByteCodeInstruction inst); |
| 92 | |
| 93 | /** |
| 94 | * Based on 'type', writes the s (signed), u (unsigned), or f (float) instruction. |
| 95 | */ |
| 96 | void writeTypedInstruction(const Type& type, ByteCodeInstruction s, ByteCodeInstruction u, |
Ethan Nicholas | 48a75aa | 2019-05-16 17:15:56 -0400 | [diff] [blame] | 97 | ByteCodeInstruction f, int count); |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 98 | |
Brian Osman | 07c117b | 2019-05-23 12:51:06 -0700 | [diff] [blame] | 99 | static int SlotCount(const Type& type); |
| 100 | |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 101 | private: |
| 102 | // reserves 16 bits in the output code, to be filled in later with an address once we determine |
| 103 | // it |
| 104 | class DeferredLocation { |
| 105 | public: |
| 106 | DeferredLocation(ByteCodeGenerator* generator) |
| 107 | : fGenerator(*generator) |
| 108 | , fOffset(generator->fCode->size()) { |
| 109 | generator->write16(0); |
| 110 | } |
| 111 | |
| 112 | #ifdef SK_DEBUG |
| 113 | ~DeferredLocation() { |
| 114 | SkASSERT(fSet); |
| 115 | } |
| 116 | #endif |
| 117 | |
| 118 | void set() { |
| 119 | int target = fGenerator.fCode->size(); |
| 120 | SkASSERT(target <= 65535); |
Ethan Nicholas | 9764ebd | 2019-05-01 14:43:54 -0400 | [diff] [blame] | 121 | (*fGenerator.fCode)[fOffset] = target; |
| 122 | (*fGenerator.fCode)[fOffset + 1] = target >> 8; |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 123 | #ifdef SK_DEBUG |
| 124 | fSet = true; |
| 125 | #endif |
| 126 | } |
| 127 | |
| 128 | private: |
| 129 | ByteCodeGenerator& fGenerator; |
| 130 | size_t fOffset; |
| 131 | #ifdef SK_DEBUG |
| 132 | bool fSet = false; |
| 133 | #endif |
| 134 | }; |
| 135 | |
Ethan Nicholas | ae9633b | 2019-05-24 12:46:34 -0400 | [diff] [blame] | 136 | // Intrinsics which do not simply map to a single opcode |
| 137 | enum class SpecialIntrinsic { |
| 138 | kDot, |
| 139 | }; |
| 140 | |
| 141 | struct Intrinsic { |
| 142 | Intrinsic(ByteCodeInstruction instruction) |
| 143 | : fIsSpecial(false) |
| 144 | , fValue(instruction) {} |
| 145 | |
| 146 | Intrinsic(SpecialIntrinsic special) |
| 147 | : fIsSpecial(true) |
| 148 | , fValue(special) {} |
| 149 | |
| 150 | bool fIsSpecial; |
| 151 | |
| 152 | union Value { |
| 153 | Value(ByteCodeInstruction instruction) |
| 154 | : fInstruction(instruction) {} |
| 155 | |
| 156 | Value(SpecialIntrinsic special) |
| 157 | : fSpecial(special) {} |
| 158 | |
| 159 | ByteCodeInstruction fInstruction; |
| 160 | SpecialIntrinsic fSpecial; |
| 161 | } fValue; |
| 162 | }; |
| 163 | |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 164 | /** |
| 165 | * Returns the local slot into which var should be stored, allocating a new slot if it has not |
| 166 | * already been assigned one. Compound variables (e.g. vectors) will consume more than one local |
| 167 | * slot, with the getLocation return value indicating where the first element should be stored. |
| 168 | */ |
| 169 | int getLocation(const Variable& var); |
| 170 | |
Brian Osman | 07c117b | 2019-05-23 12:51:06 -0700 | [diff] [blame] | 171 | /** |
| 172 | * As above, but computes the (possibly dynamic) address of an expression involving indexing & |
| 173 | * field access. If the address is known, it's returned. If not, -1 is returned, and the |
| 174 | * location will be left on the top of the stack. |
| 175 | */ |
| 176 | int getLocation(const Expression& expr, Variable::Storage* storage); |
| 177 | |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 178 | std::unique_ptr<ByteCodeFunction> writeFunction(const FunctionDefinition& f); |
| 179 | |
| 180 | void writeVarDeclarations(const VarDeclarations& decl); |
| 181 | |
Brian Osman | 07c117b | 2019-05-23 12:51:06 -0700 | [diff] [blame] | 182 | void writeVariableExpression(const Expression& expr); |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 183 | |
Brian Osman | 3e29f1d | 2019-05-28 09:35:05 -0400 | [diff] [blame] | 184 | void writeExpression(const Expression& expr, bool discard = false); |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 185 | |
| 186 | /** |
| 187 | * Pushes whatever values are required by the lvalue onto the stack, and returns an LValue |
| 188 | * permitting loads and stores to it. |
| 189 | */ |
| 190 | std::unique_ptr<LValue> getLValue(const Expression& expr); |
| 191 | |
Ethan Nicholas | 82162ee | 2019-05-21 16:05:08 -0400 | [diff] [blame] | 192 | void writeIntrinsicCall(const FunctionCall& c); |
| 193 | |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 194 | void writeFunctionCall(const FunctionCall& c); |
| 195 | |
| 196 | void writeConstructor(const Constructor& c); |
| 197 | |
Ethan Nicholas | 9e6a393 | 2019-05-17 16:31:21 -0400 | [diff] [blame] | 198 | void writeExternalFunctionCall(const ExternalFunctionCall& c); |
| 199 | |
Ethan Nicholas | 91164d1 | 2019-05-15 15:29:54 -0400 | [diff] [blame] | 200 | void writeExternalValue(const ExternalValueReference& r); |
| 201 | |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 202 | void writeSwizzle(const Swizzle& swizzle); |
| 203 | |
Brian Osman | 3e29f1d | 2019-05-28 09:35:05 -0400 | [diff] [blame] | 204 | bool writeBinaryExpression(const BinaryExpression& b, bool discard); |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 205 | |
| 206 | void writeTernaryExpression(const TernaryExpression& t); |
| 207 | |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 208 | void writeLogicalAnd(const BinaryExpression& b); |
| 209 | |
| 210 | void writeLogicalOr(const BinaryExpression& o); |
| 211 | |
| 212 | void writeNullLiteral(const NullLiteral& n); |
| 213 | |
Brian Osman | 3e29f1d | 2019-05-28 09:35:05 -0400 | [diff] [blame] | 214 | bool writePrefixExpression(const PrefixExpression& p, bool discard); |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 215 | |
Brian Osman | 3e29f1d | 2019-05-28 09:35:05 -0400 | [diff] [blame] | 216 | bool writePostfixExpression(const PostfixExpression& p, bool discard); |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 217 | |
| 218 | void writeBoolLiteral(const BoolLiteral& b); |
| 219 | |
| 220 | void writeIntLiteral(const IntLiteral& i); |
| 221 | |
| 222 | void writeFloatLiteral(const FloatLiteral& f); |
| 223 | |
| 224 | void writeStatement(const Statement& s); |
| 225 | |
| 226 | void writeBlock(const Block& b); |
| 227 | |
| 228 | void writeBreakStatement(const BreakStatement& b); |
| 229 | |
| 230 | void writeContinueStatement(const ContinueStatement& c); |
| 231 | |
| 232 | void writeIfStatement(const IfStatement& stmt); |
| 233 | |
| 234 | void writeForStatement(const ForStatement& f); |
| 235 | |
| 236 | void writeWhileStatement(const WhileStatement& w); |
| 237 | |
| 238 | void writeDoStatement(const DoStatement& d); |
| 239 | |
| 240 | void writeSwitchStatement(const SwitchStatement& s); |
| 241 | |
| 242 | void writeReturnStatement(const ReturnStatement& r); |
| 243 | |
| 244 | // updates the current set of breaks to branch to the current location |
| 245 | void setBreakTargets(); |
| 246 | |
| 247 | // updates the current set of continues to branch to the current location |
| 248 | void setContinueTargets(); |
| 249 | |
Brian Osman | 4a47da7 | 2019-07-12 11:30:32 -0400 | [diff] [blame] | 250 | void enterLoop() { |
| 251 | fLoopCount++; |
| 252 | fMaxLoopCount = std::max(fMaxLoopCount, fLoopCount); |
| 253 | } |
| 254 | |
| 255 | void exitLoop() { |
| 256 | SkASSERT(fLoopCount > 0); |
| 257 | fLoopCount--; |
| 258 | } |
| 259 | |
| 260 | void enterCondition() { |
| 261 | fConditionCount++; |
| 262 | fMaxConditionCount = std::max(fMaxConditionCount, fConditionCount); |
| 263 | } |
| 264 | |
| 265 | void exitCondition() { |
| 266 | SkASSERT(fConditionCount > 0); |
| 267 | fConditionCount--; |
| 268 | } |
| 269 | |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 270 | const Context& fContext; |
| 271 | |
| 272 | ByteCode* fOutput; |
| 273 | |
| 274 | const FunctionDefinition* fFunction; |
| 275 | |
| 276 | std::vector<uint8_t>* fCode; |
| 277 | |
| 278 | std::vector<const Variable*> fLocals; |
| 279 | |
| 280 | std::stack<std::vector<DeferredLocation>> fContinueTargets; |
| 281 | |
| 282 | std::stack<std::vector<DeferredLocation>> fBreakTargets; |
| 283 | |
Brian Osman | 8016441 | 2019-06-07 13:00:23 -0400 | [diff] [blame] | 284 | std::vector<const FunctionDefinition*> fFunctions; |
Brian Osman | 226668a | 2019-05-14 16:47:30 -0400 | [diff] [blame] | 285 | |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 286 | int fParameterCount; |
| 287 | |
Brian Osman | 4a47da7 | 2019-07-12 11:30:32 -0400 | [diff] [blame] | 288 | int fLoopCount; |
| 289 | int fMaxLoopCount; |
| 290 | int fConditionCount; |
| 291 | int fMaxConditionCount; |
| 292 | |
Ethan Nicholas | ae9633b | 2019-05-24 12:46:34 -0400 | [diff] [blame] | 293 | const std::unordered_map<String, Intrinsic> fIntrinsics; |
Ethan Nicholas | 82162ee | 2019-05-21 16:05:08 -0400 | [diff] [blame] | 294 | |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 295 | friend class DeferredLocation; |
Brian Osman | 07c117b | 2019-05-23 12:51:06 -0700 | [diff] [blame] | 296 | friend class ByteCodeExpressionLValue; |
Brian Osman | 1091f02 | 2019-05-16 09:42:16 -0400 | [diff] [blame] | 297 | friend class ByteCodeSwizzleLValue; |
Ethan Nicholas | 0e9401d | 2019-03-21 11:05:37 -0400 | [diff] [blame] | 298 | |
| 299 | typedef CodeGenerator INHERITED; |
| 300 | }; |
| 301 | |
| 302 | } |
| 303 | |
| 304 | #endif |