blob: af34b64605b46c77e74a00d40b53a51c383dd298 [file] [log] [blame]
Dejan Mircevskib6fe02f2016-01-07 13:44:22 -05001// Copyright (c) 2015-2016 The Khronos Group Inc.
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +01002//
David Neto9fc86582016-09-01 15:33:59 -04003// Licensed under the Apache License, Version 2.0 (the "License");
4// you may not use this file except in compliance with the License.
5// You may obtain a copy of the License at
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +01006//
David Neto9fc86582016-09-01 15:33:59 -04007// http://www.apache.org/licenses/LICENSE-2.0
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +01008//
David Neto9fc86582016-09-01 15:33:59 -04009// Unless required by applicable law or agreed to in writing, software
10// distributed under the License is distributed on an "AS IS" BASIS,
11// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12// See the License for the specific language governing permissions and
13// limitations under the License.
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +010014
dan sinclaireda2cfb2018-08-03 15:06:09 -040015#include "source/opcode.h"
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +010016
17#include <assert.h>
18#include <string.h>
19
David Neto5a0b5ca2016-12-09 14:01:43 -050020#include <algorithm>
Lei Zhang972788b2015-11-12 13:48:30 -050021#include <cstdlib>
22
dan sinclaireda2cfb2018-08-03 15:06:09 -040023#include "source/instruction.h"
24#include "source/macro.h"
25#include "source/spirv_constant.h"
26#include "source/spirv_endian.h"
27#include "source/spirv_target_env.h"
David Neto5a703352016-02-17 14:44:00 -050028#include "spirv-tools/libspirv.h"
Lei Zhang923f6c12015-11-11 12:45:23 -050029
David Neto78c3b432015-08-27 13:03:52 -040030namespace {
Lei Zhang16981f82017-09-21 17:24:57 -040031struct OpcodeDescPtrLen {
32 const spv_opcode_desc_t* ptr;
33 uint32_t len;
34};
David Neto78c3b432015-08-27 13:03:52 -040035
dan sinclaireda2cfb2018-08-03 15:06:09 -040036#include "core.insts-unified1.inc"
Lei Zhang16981f82017-09-21 17:24:57 -040037
Lei Zhang1ef6b192018-03-14 13:06:18 -040038static const spv_opcode_table_t kOpcodeTable = {ARRAY_SIZE(kOpcodeTableEntries),
39 kOpcodeTableEntries};
David Neto78c3b432015-08-27 13:03:52 -040040
David Neto5a0b5ca2016-12-09 14:01:43 -050041// Represents a vendor tool entry in the SPIR-V XML Regsitry.
42struct VendorTool {
43 uint32_t value;
44 const char* vendor;
Lei Zhang16981f82017-09-21 17:24:57 -040045 const char* tool; // Might be empty string.
46 const char* vendor_tool; // Combiantion of vendor and tool.
David Neto5a0b5ca2016-12-09 14:01:43 -050047};
48
49const VendorTool vendor_tools[] = {
50#include "generators.inc"
51};
52
Lei Zhanga94701d2015-09-14 10:05:37 -040053} // anonymous namespace
David Neto78c3b432015-08-27 13:03:52 -040054
David Neto5a0b5ca2016-12-09 14:01:43 -050055// TODO(dneto): Move this to another file. It doesn't belong with opcode
56// processing.
Lei Zhang1a0334e2015-11-02 09:41:20 -050057const char* spvGeneratorStr(uint32_t generator) {
David Neto5a0b5ca2016-12-09 14:01:43 -050058 auto where = std::find_if(
59 std::begin(vendor_tools), std::end(vendor_tools),
60 [generator](const VendorTool& vt) { return generator == vt.value; });
61 if (where != std::end(vendor_tools)) return where->vendor_tool;
62 return "Unknown";
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +010063}
64
Lei Zhangb36e7042015-10-28 13:40:52 -040065uint32_t spvOpcodeMake(uint16_t wordCount, SpvOp opcode) {
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +010066 return ((uint32_t)opcode) | (((uint32_t)wordCount) << 16);
67}
68
Lei Zhang6fa3f8a2016-03-31 17:26:31 -040069void spvOpcodeSplit(const uint32_t word, uint16_t* pWordCount,
70 uint16_t* pOpcode) {
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +010071 if (pWordCount) {
72 *pWordCount = (uint16_t)((0xffff0000 & word) >> 16);
73 }
74 if (pOpcode) {
Lei Zhang6fa3f8a2016-03-31 17:26:31 -040075 *pOpcode = 0x0000ffff & word;
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +010076 }
77}
78
Lei Zhang1ef6b192018-03-14 13:06:18 -040079spv_result_t spvOpcodeTableGet(spv_opcode_table* pInstTable, spv_target_env) {
Lei Zhang40056702015-09-11 14:31:27 -040080 if (!pInstTable) return SPV_ERROR_INVALID_POINTER;
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +010081
Lei Zhang16981f82017-09-21 17:24:57 -040082 // Descriptions of each opcode. Each entry describes the format of the
83 // instruction that follows a particular opcode.
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +010084
Lei Zhang1ef6b192018-03-14 13:06:18 -040085 *pInstTable = &kOpcodeTable;
86 return SPV_SUCCESS;
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +010087}
88
Lei Zhang1ef6b192018-03-14 13:06:18 -040089spv_result_t spvOpcodeTableNameLookup(spv_target_env env,
90 const spv_opcode_table table,
Lei Zhang1a0334e2015-11-02 09:41:20 -050091 const char* name,
92 spv_opcode_desc* pEntry) {
Lei Zhang40056702015-09-11 14:31:27 -040093 if (!name || !pEntry) return SPV_ERROR_INVALID_POINTER;
94 if (!table) return SPV_ERROR_INVALID_TABLE;
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +010095
96 // TODO: This lookup of the Opcode table is suboptimal! Binary sort would be
97 // preferable but the table requires sorting on the Opcode name, but it's
Lei Zhang1ef6b192018-03-14 13:06:18 -040098 // static const initialized and matches the order of the spec.
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +010099 const size_t nameLength = strlen(name);
100 for (uint64_t opcodeIndex = 0; opcodeIndex < table->count; ++opcodeIndex) {
Lei Zhang1ef6b192018-03-14 13:06:18 -0400101 const spv_opcode_desc_t& entry = table->entries[opcodeIndex];
102 // We considers the current opcode as available as long as
103 // 1. The target environment satisfies the minimal requirement of the
104 // opcode; or
105 // 2. There is at least one extension enabling this opcode.
106 //
107 // Note that the second rule assumes the extension enabling this instruction
108 // is indeed requested in the SPIR-V code; checking that should be
109 // validator's work.
Lei Zhangddbaf322018-03-28 16:42:44 -0400110 if ((spvVersionForTargetEnv(env) >= entry.minVersion ||
David Neto8d65c892018-06-19 09:54:33 -0400111 entry.numExtensions > 0u || entry.numCapabilities > 0u) &&
Lei Zhang1ef6b192018-03-14 13:06:18 -0400112 nameLength == strlen(entry.name) &&
113 !strncmp(name, entry.name, nameLength)) {
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100114 // NOTE: Found out Opcode!
Lei Zhang1ef6b192018-03-14 13:06:18 -0400115 *pEntry = &entry;
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100116 return SPV_SUCCESS;
117 }
118 }
119
120 return SPV_ERROR_INVALID_LOOKUP;
121}
122
Lei Zhang1ef6b192018-03-14 13:06:18 -0400123spv_result_t spvOpcodeTableValueLookup(spv_target_env env,
124 const spv_opcode_table table,
Lei Zhangb36e7042015-10-28 13:40:52 -0400125 const SpvOp opcode,
Lei Zhang1a0334e2015-11-02 09:41:20 -0500126 spv_opcode_desc* pEntry) {
Lei Zhang40056702015-09-11 14:31:27 -0400127 if (!table) return SPV_ERROR_INVALID_TABLE;
128 if (!pEntry) return SPV_ERROR_INVALID_POINTER;
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100129
Jesus Carabanof063f912017-10-27 15:28:50 +0300130 const auto beg = table->entries;
131 const auto end = table->entries + table->count;
Lei Zhang1ef6b192018-03-14 13:06:18 -0400132
133 spv_opcode_desc_t needle = {"", opcode, 0, nullptr, 0, {},
134 false, false, 0, nullptr, ~0u};
135
Jesus Carabanof063f912017-10-27 15:28:50 +0300136 auto comp = [](const spv_opcode_desc_t& lhs, const spv_opcode_desc_t& rhs) {
137 return lhs.opcode < rhs.opcode;
138 };
Lei Zhang1ef6b192018-03-14 13:06:18 -0400139
140 // We need to loop here because there can exist multiple symbols for the same
141 // opcode value, and they can be introduced in different target environments,
142 // which means they can have different minimal version requirements.
143 // Assumes the underlying table is already sorted ascendingly according to
144 // opcode value.
145 for (auto it = std::lower_bound(beg, end, needle, comp);
146 it != end && it->opcode == opcode; ++it) {
147 // We considers the current opcode as available as long as
148 // 1. The target environment satisfies the minimal requirement of the
149 // opcode; or
150 // 2. There is at least one extension enabling this opcode.
151 //
152 // Note that the second rule assumes the extension enabling this instruction
153 // is indeed requested in the SPIR-V code; checking that should be
154 // validator's work.
Lei Zhangddbaf322018-03-28 16:42:44 -0400155 if (spvVersionForTargetEnv(env) >= it->minVersion ||
David Neto8d65c892018-06-19 09:54:33 -0400156 it->numExtensions > 0u || it->numCapabilities > 0u) {
Lei Zhang1ef6b192018-03-14 13:06:18 -0400157 *pEntry = it;
158 return SPV_SUCCESS;
159 }
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100160 }
161
162 return SPV_ERROR_INVALID_LOOKUP;
163}
164
Lei Zhang1a0334e2015-11-02 09:41:20 -0500165void spvInstructionCopy(const uint32_t* words, const SpvOp opcode,
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100166 const uint16_t wordCount, const spv_endianness_t endian,
Lei Zhang1a0334e2015-11-02 09:41:20 -0500167 spv_instruction_t* pInst) {
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100168 pInst->opcode = opcode;
David Netob5dc8fc2015-10-06 16:22:00 -0400169 pInst->words.resize(wordCount);
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100170 for (uint16_t wordIndex = 0; wordIndex < wordCount; ++wordIndex) {
171 pInst->words[wordIndex] = spvFixWord(words[wordIndex], endian);
172 if (!wordIndex) {
173 uint16_t thisWordCount;
Lei Zhang6fa3f8a2016-03-31 17:26:31 -0400174 uint16_t thisOpcode;
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100175 spvOpcodeSplit(pInst->words[wordIndex], &thisWordCount, &thisOpcode);
Lei Zhang6fa3f8a2016-03-31 17:26:31 -0400176 assert(opcode == static_cast<SpvOp>(thisOpcode) &&
177 wordCount == thisWordCount && "Endianness failed!");
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100178 }
179 }
180}
181
Lei Zhang1a0334e2015-11-02 09:41:20 -0500182const char* spvOpcodeString(const SpvOp opcode) {
Lei Zhang1ef6b192018-03-14 13:06:18 -0400183 const auto beg = kOpcodeTableEntries;
184 const auto end = kOpcodeTableEntries + ARRAY_SIZE(kOpcodeTableEntries);
185 spv_opcode_desc_t needle = {"", opcode, 0, nullptr, 0, {},
186 false, false, 0, nullptr, ~0u};
Jesus Carabanof063f912017-10-27 15:28:50 +0300187 auto comp = [](const spv_opcode_desc_t& lhs, const spv_opcode_desc_t& rhs) {
188 return lhs.opcode < rhs.opcode;
189 };
Lei Zhang1ef6b192018-03-14 13:06:18 -0400190 auto it = std::lower_bound(beg, end, needle, comp);
Diego Novillod2938e42017-11-08 12:40:02 -0500191 if (it != end && it->opcode == opcode) {
Jesus Carabanof063f912017-10-27 15:28:50 +0300192 return it->name;
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100193 }
Lei Zhang16981f82017-09-21 17:24:57 -0400194
Lei Zhang4f293b72016-03-21 16:36:14 -0400195 assert(0 && "Unreachable!");
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100196 return "unknown";
197}
198
Lei Zhangb36e7042015-10-28 13:40:52 -0400199int32_t spvOpcodeIsScalarType(const SpvOp opcode) {
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100200 switch (opcode) {
Lei Zhangb36e7042015-10-28 13:40:52 -0400201 case SpvOpTypeInt:
202 case SpvOpTypeFloat:
Dejan Mircevski276a7242016-01-21 15:55:43 -0500203 case SpvOpTypeBool:
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100204 return true;
205 default:
206 return false;
207 }
208}
209
Alan Baker0a2ee652018-03-23 14:18:54 -0400210int32_t spvOpcodeIsSpecConstant(const SpvOp opcode) {
211 switch (opcode) {
212 case SpvOpSpecConstantTrue:
213 case SpvOpSpecConstantFalse:
214 case SpvOpSpecConstant:
215 case SpvOpSpecConstantComposite:
216 case SpvOpSpecConstantOp:
217 return true;
218 default:
219 return false;
220 }
221}
222
Lei Zhangb36e7042015-10-28 13:40:52 -0400223int32_t spvOpcodeIsConstant(const SpvOp opcode) {
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100224 switch (opcode) {
Lei Zhangb36e7042015-10-28 13:40:52 -0400225 case SpvOpConstantTrue:
226 case SpvOpConstantFalse:
227 case SpvOpConstant:
228 case SpvOpConstantComposite:
229 case SpvOpConstantSampler:
Lei Zhangb36e7042015-10-28 13:40:52 -0400230 case SpvOpConstantNull:
231 case SpvOpSpecConstantTrue:
232 case SpvOpSpecConstantFalse:
233 case SpvOpSpecConstant:
234 case SpvOpSpecConstantComposite:
Dejan Mircevski3fb26762016-04-04 15:55:05 -0400235 case SpvOpSpecConstantOp:
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100236 return true;
237 default:
238 return false;
239 }
240}
241
David Neto1f3fb502016-09-14 11:57:20 -0400242bool spvOpcodeIsConstantOrUndef(const SpvOp opcode) {
243 return opcode == SpvOpUndef || spvOpcodeIsConstant(opcode);
244}
245
Aliya Pazylbekovaedb52642017-02-24 20:43:28 -0500246bool spvOpcodeIsScalarSpecConstant(const SpvOp opcode) {
247 switch (opcode) {
248 case SpvOpSpecConstantTrue:
249 case SpvOpSpecConstantFalse:
250 case SpvOpSpecConstant:
251 return true;
252 default:
253 return false;
254 }
255}
256
Lei Zhangb36e7042015-10-28 13:40:52 -0400257int32_t spvOpcodeIsComposite(const SpvOp opcode) {
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100258 switch (opcode) {
Lei Zhangb36e7042015-10-28 13:40:52 -0400259 case SpvOpTypeVector:
260 case SpvOpTypeMatrix:
261 case SpvOpTypeArray:
262 case SpvOpTypeStruct:
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100263 return true;
264 default:
265 return false;
266 }
267}
268
Ehsan Nasiri23af06c2017-02-01 15:37:39 -0500269bool spvOpcodeReturnsLogicalVariablePointer(const SpvOp opcode) {
270 switch (opcode) {
271 case SpvOpVariable:
272 case SpvOpAccessChain:
273 case SpvOpInBoundsAccessChain:
274 case SpvOpFunctionParameter:
275 case SpvOpImageTexelPointer:
276 case SpvOpCopyObject:
277 case SpvOpSelect:
278 case SpvOpPhi:
279 case SpvOpFunctionCall:
280 case SpvOpPtrAccessChain:
281 case SpvOpLoad:
282 case SpvOpConstantNull:
283 return true;
284 default:
285 return false;
286 }
287}
288
Florian Ziesche66fcb452016-03-02 22:17:54 +0100289int32_t spvOpcodeReturnsLogicalPointer(const SpvOp opcode) {
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100290 switch (opcode) {
Lei Zhangb36e7042015-10-28 13:40:52 -0400291 case SpvOpVariable:
292 case SpvOpAccessChain:
293 case SpvOpInBoundsAccessChain:
294 case SpvOpFunctionParameter:
Florian Ziesche66fcb452016-03-02 22:17:54 +0100295 case SpvOpImageTexelPointer:
296 case SpvOpCopyObject:
Kenneth Benzie (Benie)83e5a292015-05-22 18:26:19 +0100297 return true;
298 default:
299 return false;
300 }
301}
302
Lei Zhangb36e7042015-10-28 13:40:52 -0400303int32_t spvOpcodeGeneratesType(SpvOp op) {
Lei Zhang1a0334e2015-11-02 09:41:20 -0500304 switch (op) {
Lei Zhangb36e7042015-10-28 13:40:52 -0400305 case SpvOpTypeVoid:
306 case SpvOpTypeBool:
307 case SpvOpTypeInt:
308 case SpvOpTypeFloat:
309 case SpvOpTypeVector:
310 case SpvOpTypeMatrix:
311 case SpvOpTypeImage:
312 case SpvOpTypeSampler:
313 case SpvOpTypeSampledImage:
314 case SpvOpTypeArray:
315 case SpvOpTypeRuntimeArray:
316 case SpvOpTypeStruct:
317 case SpvOpTypeOpaque:
318 case SpvOpTypePointer:
319 case SpvOpTypeFunction:
320 case SpvOpTypeEvent:
321 case SpvOpTypeDeviceEvent:
322 case SpvOpTypeReserveId:
323 case SpvOpTypeQueue:
324 case SpvOpTypePipe:
Andrey Tuganov4ef3b3e2017-02-28 11:53:47 -0500325 case SpvOpTypePipeStorage:
326 case SpvOpTypeNamedBarrier:
Andrew Woloszyn537e7762015-09-29 11:28:34 -0400327 return true;
David Netoaef608c2015-11-02 14:59:02 -0500328 default:
329 // In particular, OpTypeForwardPointer does not generate a type,
330 // but declares a storage class for a pointer type generated
331 // by a different instruction.
332 break;
Andrew Woloszyn537e7762015-09-29 11:28:34 -0400333 }
334 return 0;
335}
Steven Perroneb4653a2017-11-13 15:31:43 -0500336
337bool spvOpcodeIsDecoration(const SpvOp opcode) {
Steven Perron28c41552017-11-10 20:26:55 -0500338 switch (opcode) {
Steven Perroneb4653a2017-11-13 15:31:43 -0500339 case SpvOpDecorate:
340 case SpvOpDecorateId:
341 case SpvOpMemberDecorate:
342 case SpvOpGroupDecorate:
343 case SpvOpGroupMemberDecorate:
David Neto5f69f752018-03-05 13:34:13 -0500344 case SpvOpDecorateStringGOOGLE:
345 case SpvOpMemberDecorateStringGOOGLE:
Steven Perroneb4653a2017-11-13 15:31:43 -0500346 return true;
347 default:
348 break;
349 }
350 return false;
351}
Steven Perron28c41552017-11-10 20:26:55 -0500352
353bool spvOpcodeIsLoad(const SpvOp opcode) {
354 switch (opcode) {
355 case SpvOpLoad:
356 case SpvOpImageSampleExplicitLod:
357 case SpvOpImageSampleImplicitLod:
358 case SpvOpImageSampleDrefImplicitLod:
359 case SpvOpImageSampleDrefExplicitLod:
360 case SpvOpImageSampleProjImplicitLod:
361 case SpvOpImageSampleProjExplicitLod:
362 case SpvOpImageSampleProjDrefImplicitLod:
363 case SpvOpImageSampleProjDrefExplicitLod:
364 case SpvOpImageFetch:
365 case SpvOpImageGather:
366 case SpvOpImageDrefGather:
367 case SpvOpImageRead:
368 case SpvOpImageSparseSampleImplicitLod:
369 case SpvOpImageSparseSampleExplicitLod:
370 case SpvOpImageSparseSampleDrefExplicitLod:
371 case SpvOpImageSparseSampleDrefImplicitLod:
372 case SpvOpImageSparseFetch:
373 case SpvOpImageSparseGather:
374 case SpvOpImageSparseDrefGather:
375 case SpvOpImageSparseRead:
376 return true;
377 default:
378 return false;
379 }
380}
381
Diego Novillo74327842017-11-17 08:59:25 -0500382bool spvOpcodeIsBranch(SpvOp opcode) {
383 switch (opcode) {
384 case SpvOpBranch:
385 case SpvOpBranchConditional:
386 case SpvOpSwitch:
387 return true;
388 default:
389 return false;
390 }
391}
392
Steven Perron28c41552017-11-10 20:26:55 -0500393bool spvOpcodeIsAtomicOp(const SpvOp opcode) {
394 switch (opcode) {
395 case SpvOpAtomicLoad:
396 case SpvOpAtomicStore:
397 case SpvOpAtomicExchange:
398 case SpvOpAtomicCompareExchange:
399 case SpvOpAtomicCompareExchangeWeak:
400 case SpvOpAtomicIIncrement:
401 case SpvOpAtomicIDecrement:
402 case SpvOpAtomicIAdd:
403 case SpvOpAtomicISub:
404 case SpvOpAtomicSMin:
405 case SpvOpAtomicUMin:
406 case SpvOpAtomicSMax:
407 case SpvOpAtomicUMax:
408 case SpvOpAtomicAnd:
409 case SpvOpAtomicOr:
410 case SpvOpAtomicXor:
411 case SpvOpAtomicFlagTestAndSet:
412 case SpvOpAtomicFlagClear:
413 return true;
414 default:
415 return false;
416 }
417}
Diego Novillo74327842017-11-17 08:59:25 -0500418
419bool spvOpcodeIsReturn(SpvOp opcode) {
420 switch (opcode) {
421 case SpvOpReturn:
422 case SpvOpReturnValue:
423 return true;
424 default:
425 return false;
426 }
427}
428
Diego Novillo5f100782018-01-03 15:25:03 -0500429bool spvOpcodeIsReturnOrAbort(SpvOp opcode) {
430 return spvOpcodeIsReturn(opcode) || opcode == SpvOpKill ||
431 opcode == SpvOpUnreachable;
432}
433
Diego Novillo74327842017-11-17 08:59:25 -0500434bool spvOpcodeIsBlockTerminator(SpvOp opcode) {
Diego Novillo5f100782018-01-03 15:25:03 -0500435 return spvOpcodeIsBranch(opcode) || spvOpcodeIsReturnOrAbort(opcode);
Diego Novillo74327842017-11-17 08:59:25 -0500436}
Steven Perron79a00642017-12-11 13:10:24 -0500437
438bool spvOpcodeIsBaseOpaqueType(SpvOp opcode) {
439 switch (opcode) {
440 case SpvOpTypeImage:
441 case SpvOpTypeSampler:
442 case SpvOpTypeSampledImage:
443 case SpvOpTypeOpaque:
444 case SpvOpTypeEvent:
445 case SpvOpTypeDeviceEvent:
446 case SpvOpTypeReserveId:
447 case SpvOpTypeQueue:
448 case SpvOpTypePipe:
449 case SpvOpTypeForwardPointer:
450 case SpvOpTypePipeStorage:
451 case SpvOpTypeNamedBarrier:
452 return true;
453 default:
454 return false;
455 }
456}
Alan Baker09c206b2018-04-17 10:18:59 -0400457
458bool spvOpcodeIsNonUniformGroupOperation(SpvOp opcode) {
459 switch (opcode) {
460 case SpvOpGroupNonUniformElect:
461 case SpvOpGroupNonUniformAll:
462 case SpvOpGroupNonUniformAny:
463 case SpvOpGroupNonUniformAllEqual:
464 case SpvOpGroupNonUniformBroadcast:
465 case SpvOpGroupNonUniformBroadcastFirst:
466 case SpvOpGroupNonUniformBallot:
467 case SpvOpGroupNonUniformInverseBallot:
468 case SpvOpGroupNonUniformBallotBitExtract:
469 case SpvOpGroupNonUniformBallotBitCount:
470 case SpvOpGroupNonUniformBallotFindLSB:
471 case SpvOpGroupNonUniformBallotFindMSB:
472 case SpvOpGroupNonUniformShuffle:
473 case SpvOpGroupNonUniformShuffleXor:
474 case SpvOpGroupNonUniformShuffleUp:
475 case SpvOpGroupNonUniformShuffleDown:
476 case SpvOpGroupNonUniformIAdd:
477 case SpvOpGroupNonUniformFAdd:
478 case SpvOpGroupNonUniformIMul:
479 case SpvOpGroupNonUniformFMul:
480 case SpvOpGroupNonUniformSMin:
481 case SpvOpGroupNonUniformUMin:
482 case SpvOpGroupNonUniformFMin:
483 case SpvOpGroupNonUniformSMax:
484 case SpvOpGroupNonUniformUMax:
485 case SpvOpGroupNonUniformFMax:
486 case SpvOpGroupNonUniformBitwiseAnd:
487 case SpvOpGroupNonUniformBitwiseOr:
488 case SpvOpGroupNonUniformBitwiseXor:
489 case SpvOpGroupNonUniformLogicalAnd:
490 case SpvOpGroupNonUniformLogicalOr:
491 case SpvOpGroupNonUniformLogicalXor:
492 case SpvOpGroupNonUniformQuadBroadcast:
493 case SpvOpGroupNonUniformQuadSwap:
494 return true;
495 default:
496 return false;
497 }
498}
Steven Perron2c0ce872018-04-23 11:13:07 -0400499
500bool spvOpcodeIsScalarizable(SpvOp opcode) {
501 switch (opcode) {
502 case SpvOpPhi:
503 case SpvOpCopyObject:
504 case SpvOpConvertFToU:
505 case SpvOpConvertFToS:
506 case SpvOpConvertSToF:
507 case SpvOpConvertUToF:
508 case SpvOpUConvert:
509 case SpvOpSConvert:
510 case SpvOpFConvert:
511 case SpvOpQuantizeToF16:
512 case SpvOpVectorInsertDynamic:
513 case SpvOpSNegate:
514 case SpvOpFNegate:
515 case SpvOpIAdd:
516 case SpvOpFAdd:
517 case SpvOpISub:
518 case SpvOpFSub:
519 case SpvOpIMul:
520 case SpvOpFMul:
521 case SpvOpUDiv:
522 case SpvOpSDiv:
523 case SpvOpFDiv:
524 case SpvOpUMod:
525 case SpvOpSRem:
526 case SpvOpSMod:
527 case SpvOpFRem:
528 case SpvOpFMod:
529 case SpvOpVectorTimesScalar:
530 case SpvOpIAddCarry:
531 case SpvOpISubBorrow:
532 case SpvOpUMulExtended:
533 case SpvOpSMulExtended:
534 case SpvOpShiftRightLogical:
535 case SpvOpShiftRightArithmetic:
536 case SpvOpShiftLeftLogical:
537 case SpvOpBitwiseOr:
538 case SpvOpBitwiseAnd:
539 case SpvOpNot:
540 case SpvOpBitFieldInsert:
541 case SpvOpBitFieldSExtract:
542 case SpvOpBitFieldUExtract:
543 case SpvOpBitReverse:
544 case SpvOpBitCount:
545 case SpvOpIsNan:
546 case SpvOpIsInf:
547 case SpvOpIsFinite:
548 case SpvOpIsNormal:
549 case SpvOpSignBitSet:
550 case SpvOpLessOrGreater:
551 case SpvOpOrdered:
552 case SpvOpUnordered:
553 case SpvOpLogicalEqual:
554 case SpvOpLogicalNotEqual:
555 case SpvOpLogicalOr:
556 case SpvOpLogicalAnd:
557 case SpvOpLogicalNot:
558 case SpvOpSelect:
559 case SpvOpIEqual:
560 case SpvOpINotEqual:
561 case SpvOpUGreaterThan:
562 case SpvOpSGreaterThan:
563 case SpvOpUGreaterThanEqual:
564 case SpvOpSGreaterThanEqual:
565 case SpvOpULessThan:
566 case SpvOpSLessThan:
567 case SpvOpULessThanEqual:
568 case SpvOpSLessThanEqual:
569 case SpvOpFOrdEqual:
570 case SpvOpFUnordEqual:
571 case SpvOpFOrdNotEqual:
572 case SpvOpFUnordNotEqual:
573 case SpvOpFOrdLessThan:
574 case SpvOpFUnordLessThan:
575 case SpvOpFOrdGreaterThan:
576 case SpvOpFUnordGreaterThan:
577 case SpvOpFOrdLessThanEqual:
578 case SpvOpFUnordLessThanEqual:
579 case SpvOpFOrdGreaterThanEqual:
580 case SpvOpFUnordGreaterThanEqual:
581 return true;
582 default:
583 return false;
584 }
585}