2 // Copyright (C) 2014 LunarG, Inc.
4 // All rights reserved.
6 // Redistribution and use in source and binary forms, with or without
7 // modification, are permitted provided that the following conditions
10 // Redistributions of source code must retain the above copyright
11 // notice, this list of conditions and the following disclaimer.
13 // Redistributions in binary form must reproduce the above
14 // copyright notice, this list of conditions and the following
15 // disclaimer in the documentation and/or other materials provided
16 // with the distribution.
18 // Neither the name of 3Dlabs Inc. Ltd. nor the names of its
19 // contributors may be used to endorse or promote products derived
20 // from this software without specific prior written permission.
22 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
23 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
24 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
25 // FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
26 // COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
27 // INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
28 // BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
29 // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
30 // CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
32 // ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
33 // POSSIBILITY OF SUCH DAMAGE.
37 // Simple in-memory representation (IR) of SPIRV. Just for holding
38 // Each function's CFG of blocks. Has this hierarchy:
39 // - Module, which is a list of
40 // - Function, which is a list of
41 // - Block, which is a list of
64 const Id NoResult = 0;
67 const Decoration NoPrecision = DecorationMax;
70 # define POTENTIALLY_UNUSED __attribute__((unused))
72 # define POTENTIALLY_UNUSED
76 const MemorySemanticsMask MemorySemanticsAllMemory =
77 (MemorySemanticsMask)(MemorySemanticsSequentiallyConsistentMask |
78 MemorySemanticsUniformMemoryMask |
79 MemorySemanticsSubgroupMemoryMask |
80 MemorySemanticsWorkgroupMemoryMask |
81 MemorySemanticsCrossWorkgroupMemoryMask |
82 MemorySemanticsAtomicCounterMemoryMask |
83 MemorySemanticsImageMemoryMask);
86 // SPIR-V IR instruction.
91 Instruction(Id resultId, Id typeId, Op opCode) : resultId(resultId), typeId(typeId), opCode(opCode), block(nullptr) { }
92 explicit Instruction(Op opCode) : resultId(NoResult), typeId(NoType), opCode(opCode), block(nullptr) { }
93 virtual ~Instruction() {}
94 void addIdOperand(Id id) { operands.push_back(id); }
95 void addImmediateOperand(unsigned int immediate) { operands.push_back(immediate); }
96 void addStringOperand(const char* str)
99 char* wordString = (char*)&word;
100 char* wordPtr = wordString;
107 if (charCount == 4) {
108 addImmediateOperand(word);
109 wordPtr = wordString;
114 // deal with partial last word
117 for (; charCount < 4; ++charCount)
119 addImmediateOperand(word);
122 void setBlock(Block* b) { block = b; }
123 Block* getBlock() const { return block; }
124 Op getOpCode() const { return opCode; }
125 int getNumOperands() const { return (int)operands.size(); }
126 Id getResultId() const { return resultId; }
127 Id getTypeId() const { return typeId; }
128 Id getIdOperand(int op) const { return operands[op]; }
129 unsigned int getImmediateOperand(int op) const { return operands[op]; }
131 // Write out the binary form.
132 void dump(std::vector<unsigned int>& out) const
134 // Compute the wordCount
135 unsigned int wordCount = 1;
140 wordCount += (unsigned int)operands.size();
142 // Write out the beginning of the instruction
143 out.push_back(((wordCount) << WordCountShift) | opCode);
145 out.push_back(typeId);
147 out.push_back(resultId);
149 // Write out the operands
150 for (int op = 0; op < (int)operands.size(); ++op)
151 out.push_back(operands[op]);
155 Instruction(const Instruction&);
159 std::vector<Id> operands;
169 Block(Id id, Function& parent);
174 Id getId() { return instructions.front()->getResultId(); }
176 Function& getParent() const { return parent; }
177 void addInstruction(std::unique_ptr<Instruction> inst);
178 void addPredecessor(Block* pred) { predecessors.push_back(pred); pred->successors.push_back(this);}
179 void addLocalVariable(std::unique_ptr<Instruction> inst) { localVariables.push_back(std::move(inst)); }
180 const std::vector<Block*>& getPredecessors() const { return predecessors; }
181 const std::vector<Block*>& getSuccessors() const { return successors; }
182 const std::vector<std::unique_ptr<Instruction> >& getInstructions() const {
185 void setUnreachable() { unreachable = true; }
186 bool isUnreachable() const { return unreachable; }
187 // Returns the block's merge instruction, if one exists (otherwise null).
188 const Instruction* getMergeInstruction() const {
189 if (instructions.size() < 2) return nullptr;
190 const Instruction* nextToLast = (instructions.cend() - 2)->get();
191 switch (nextToLast->getOpCode()) {
192 case OpSelectionMerge:
201 bool isTerminated() const
203 switch (instructions.back()->getOpCode()) {
205 case OpBranchConditional:
216 void dump(std::vector<unsigned int>& out) const
218 instructions[0]->dump(out);
219 for (int i = 0; i < (int)localVariables.size(); ++i)
220 localVariables[i]->dump(out);
221 for (int i = 1; i < (int)instructions.size(); ++i)
222 instructions[i]->dump(out);
227 Block& operator=(Block&);
229 // To enforce keeping parent and ownership in sync:
232 std::vector<std::unique_ptr<Instruction> > instructions;
233 std::vector<Block*> predecessors, successors;
234 std::vector<std::unique_ptr<Instruction> > localVariables;
237 // track whether this block is known to be uncreachable (not necessarily
238 // true for all unreachable blocks, but should be set at least
239 // for the extraneous ones introduced by the builder).
243 // Traverses the control-flow graph rooted at root in an order suited for
244 // readable code generation. Invokes callback at every node in the traversal
246 void inReadableOrder(Block* root, std::function<void(Block*)> callback);
249 // SPIR-V IR Function.
254 Function(Id id, Id resultType, Id functionType, Id firstParam, Module& parent);
257 for (int i = 0; i < (int)parameterInstructions.size(); ++i)
258 delete parameterInstructions[i];
260 for (int i = 0; i < (int)blocks.size(); ++i)
263 Id getId() const { return functionInstruction.getResultId(); }
264 Id getParamId(int p) { return parameterInstructions[p]->getResultId(); }
266 void addBlock(Block* block) { blocks.push_back(block); }
267 void removeBlock(Block* block)
269 auto found = find(blocks.begin(), blocks.end(), block);
270 assert(found != blocks.end());
275 Module& getParent() const { return parent; }
276 Block* getEntryBlock() const { return blocks.front(); }
277 Block* getLastBlock() const { return blocks.back(); }
278 const std::vector<Block*>& getBlocks() const { return blocks; }
279 void addLocalVariable(std::unique_ptr<Instruction> inst);
280 Id getReturnType() const { return functionInstruction.getTypeId(); }
282 void setImplicitThis() { implicitThis = true; }
283 bool hasImplicitThis() const { return implicitThis; }
285 void dump(std::vector<unsigned int>& out) const
288 functionInstruction.dump(out);
290 // OpFunctionParameter
291 for (int p = 0; p < (int)parameterInstructions.size(); ++p)
292 parameterInstructions[p]->dump(out);
295 inReadableOrder(blocks[0], [&out](const Block* b) { b->dump(out); });
296 Instruction end(0, 0, OpFunctionEnd);
301 Function(const Function&);
302 Function& operator=(Function&);
305 Instruction functionInstruction;
306 std::vector<Instruction*> parameterInstructions;
307 std::vector<Block*> blocks;
308 bool implicitThis; // true if this is a member function expecting to be passed a 'this' as the first argument
320 // TODO delete things
323 void addFunction(Function *fun) { functions.push_back(fun); }
325 void mapInstruction(Instruction *instruction)
327 spv::Id resultId = instruction->getResultId();
328 // map the instruction's result id
329 if (resultId >= idToInstruction.size())
330 idToInstruction.resize(resultId + 16);
331 idToInstruction[resultId] = instruction;
334 Instruction* getInstruction(Id id) const { return idToInstruction[id]; }
335 const std::vector<Function*>& getFunctions() const { return functions; }
336 spv::Id getTypeId(Id resultId) const { return idToInstruction[resultId]->getTypeId(); }
337 StorageClass getStorageClass(Id typeId) const
339 assert(idToInstruction[typeId]->getOpCode() == spv::OpTypePointer);
340 return (StorageClass)idToInstruction[typeId]->getImmediateOperand(0);
343 void dump(std::vector<unsigned int>& out) const
345 for (int f = 0; f < (int)functions.size(); ++f)
346 functions[f]->dump(out);
350 Module(const Module&);
351 std::vector<Function*> functions;
353 // map from result id to instruction having that result id
354 std::vector<Instruction*> idToInstruction;
356 // map from a result id to its type id
360 // Implementation (it's here due to circular type definitions).
364 // - the OpFunction instruction
365 // - all the OpFunctionParameter instructions
366 __inline Function::Function(Id id, Id resultType, Id functionType, Id firstParamId, Module& parent)
367 : parent(parent), functionInstruction(id, resultType, OpFunction), implicitThis(false)
370 functionInstruction.addImmediateOperand(FunctionControlMaskNone);
371 functionInstruction.addIdOperand(functionType);
372 parent.mapInstruction(&functionInstruction);
373 parent.addFunction(this);
375 // OpFunctionParameter
376 Instruction* typeInst = parent.getInstruction(functionType);
377 int numParams = typeInst->getNumOperands() - 1;
378 for (int p = 0; p < numParams; ++p) {
379 Instruction* param = new Instruction(firstParamId + p, typeInst->getIdOperand(p + 1), OpFunctionParameter);
380 parent.mapInstruction(param);
381 parameterInstructions.push_back(param);
385 __inline void Function::addLocalVariable(std::unique_ptr<Instruction> inst)
387 Instruction* raw_instruction = inst.get();
388 blocks[0]->addLocalVariable(std::move(inst));
389 parent.mapInstruction(raw_instruction);
392 __inline Block::Block(Id id, Function& parent) : parent(parent), unreachable(false)
394 instructions.push_back(std::unique_ptr<Instruction>(new Instruction(id, NoType, OpLabel)));
395 instructions.back()->setBlock(this);
396 parent.getParent().mapInstruction(instructions.back().get());
399 __inline void Block::addInstruction(std::unique_ptr<Instruction> inst)
401 Instruction* raw_instruction = inst.get();
402 instructions.push_back(std::move(inst));
403 raw_instruction->setBlock(this);
404 if (raw_instruction->getResultId())
405 parent.getParent().mapInstruction(raw_instruction);
408 }; // end spv namespace