opcode.cpp 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781
  1. // Copyright (c) 2015-2022 The Khronos Group Inc.
  2. // Modifications Copyright (C) 2020 Advanced Micro Devices, Inc. All rights
  3. // reserved.
  4. //
  5. // Licensed under the Apache License, Version 2.0 (the "License");
  6. // you may not use this file except in compliance with the License.
  7. // You may obtain a copy of the License at
  8. //
  9. // http://www.apache.org/licenses/LICENSE-2.0
  10. //
  11. // Unless required by applicable law or agreed to in writing, software
  12. // distributed under the License is distributed on an "AS IS" BASIS,
  13. // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  14. // See the License for the specific language governing permissions and
  15. // limitations under the License.
  16. #include "source/opcode.h"
  17. #include <assert.h>
  18. #include <string.h>
  19. #include <algorithm>
  20. #include <cstdlib>
  21. #include "source/instruction.h"
  22. #include "source/macro.h"
  23. #include "source/spirv_constant.h"
  24. #include "source/spirv_endian.h"
  25. #include "source/spirv_target_env.h"
  26. #include "spirv-tools/libspirv.h"
  27. namespace {
  28. struct OpcodeDescPtrLen {
  29. const spv_opcode_desc_t* ptr;
  30. uint32_t len;
  31. };
  32. #include "core.insts-unified1.inc"
  33. static const spv_opcode_table_t kOpcodeTable = {ARRAY_SIZE(kOpcodeTableEntries),
  34. kOpcodeTableEntries};
  35. // Represents a vendor tool entry in the SPIR-V XML Registry.
  36. struct VendorTool {
  37. uint32_t value;
  38. const char* vendor;
  39. const char* tool; // Might be empty string.
  40. const char* vendor_tool; // Combination of vendor and tool.
  41. };
  42. const VendorTool vendor_tools[] = {
  43. #include "generators.inc"
  44. };
  45. } // anonymous namespace
  46. // TODO(dneto): Move this to another file. It doesn't belong with opcode
  47. // processing.
  48. const char* spvGeneratorStr(uint32_t generator) {
  49. auto where = std::find_if(
  50. std::begin(vendor_tools), std::end(vendor_tools),
  51. [generator](const VendorTool& vt) { return generator == vt.value; });
  52. if (where != std::end(vendor_tools)) return where->vendor_tool;
  53. return "Unknown";
  54. }
  55. uint32_t spvOpcodeMake(uint16_t wordCount, spv::Op opcode) {
  56. return ((uint32_t)opcode) | (((uint32_t)wordCount) << 16);
  57. }
  58. void spvOpcodeSplit(const uint32_t word, uint16_t* pWordCount,
  59. uint16_t* pOpcode) {
  60. if (pWordCount) {
  61. *pWordCount = (uint16_t)((0xffff0000 & word) >> 16);
  62. }
  63. if (pOpcode) {
  64. *pOpcode = 0x0000ffff & word;
  65. }
  66. }
  67. spv_result_t spvOpcodeTableGet(spv_opcode_table* pInstTable, spv_target_env) {
  68. if (!pInstTable) return SPV_ERROR_INVALID_POINTER;
  69. // Descriptions of each opcode. Each entry describes the format of the
  70. // instruction that follows a particular opcode.
  71. *pInstTable = &kOpcodeTable;
  72. return SPV_SUCCESS;
  73. }
  74. spv_result_t spvOpcodeTableNameLookup(spv_target_env env,
  75. const spv_opcode_table table,
  76. const char* name,
  77. spv_opcode_desc* pEntry) {
  78. if (!name || !pEntry) return SPV_ERROR_INVALID_POINTER;
  79. if (!table) return SPV_ERROR_INVALID_TABLE;
  80. // TODO: This lookup of the Opcode table is suboptimal! Binary sort would be
  81. // preferable but the table requires sorting on the Opcode name, but it's
  82. // static const initialized and matches the order of the spec.
  83. const size_t nameLength = strlen(name);
  84. const auto version = spvVersionForTargetEnv(env);
  85. for (uint64_t opcodeIndex = 0; opcodeIndex < table->count; ++opcodeIndex) {
  86. const spv_opcode_desc_t& entry = table->entries[opcodeIndex];
  87. // We considers the current opcode as available as long as
  88. // 1. The target environment satisfies the minimal requirement of the
  89. // opcode; or
  90. // 2. There is at least one extension enabling this opcode.
  91. //
  92. // Note that the second rule assumes the extension enabling this instruction
  93. // is indeed requested in the SPIR-V code; checking that should be
  94. // validator's work.
  95. if (((version >= entry.minVersion && version <= entry.lastVersion) ||
  96. entry.numExtensions > 0u || entry.numCapabilities > 0u) &&
  97. nameLength == strlen(entry.name) &&
  98. !strncmp(name, entry.name, nameLength)) {
  99. // NOTE: Found out Opcode!
  100. *pEntry = &entry;
  101. return SPV_SUCCESS;
  102. }
  103. }
  104. return SPV_ERROR_INVALID_LOOKUP;
  105. }
  106. spv_result_t spvOpcodeTableValueLookup(spv_target_env env,
  107. const spv_opcode_table table,
  108. const spv::Op opcode,
  109. spv_opcode_desc* pEntry) {
  110. if (!table) return SPV_ERROR_INVALID_TABLE;
  111. if (!pEntry) return SPV_ERROR_INVALID_POINTER;
  112. const auto beg = table->entries;
  113. const auto end = table->entries + table->count;
  114. spv_opcode_desc_t needle = {"", opcode, 0, nullptr, 0, {},
  115. false, false, 0, nullptr, ~0u, ~0u};
  116. auto comp = [](const spv_opcode_desc_t& lhs, const spv_opcode_desc_t& rhs) {
  117. return lhs.opcode < rhs.opcode;
  118. };
  119. // We need to loop here because there can exist multiple symbols for the same
  120. // opcode value, and they can be introduced in different target environments,
  121. // which means they can have different minimal version requirements.
  122. // Assumes the underlying table is already sorted ascendingly according to
  123. // opcode value.
  124. const auto version = spvVersionForTargetEnv(env);
  125. for (auto it = std::lower_bound(beg, end, needle, comp);
  126. it != end && it->opcode == opcode; ++it) {
  127. // We considers the current opcode as available as long as
  128. // 1. The target environment satisfies the minimal requirement of the
  129. // opcode; or
  130. // 2. There is at least one extension enabling this opcode.
  131. //
  132. // Note that the second rule assumes the extension enabling this instruction
  133. // is indeed requested in the SPIR-V code; checking that should be
  134. // validator's work.
  135. if ((version >= it->minVersion && version <= it->lastVersion) ||
  136. it->numExtensions > 0u || it->numCapabilities > 0u) {
  137. *pEntry = it;
  138. return SPV_SUCCESS;
  139. }
  140. }
  141. return SPV_ERROR_INVALID_LOOKUP;
  142. }
  143. void spvInstructionCopy(const uint32_t* words, const spv::Op opcode,
  144. const uint16_t wordCount, const spv_endianness_t endian,
  145. spv_instruction_t* pInst) {
  146. pInst->opcode = opcode;
  147. pInst->words.resize(wordCount);
  148. for (uint16_t wordIndex = 0; wordIndex < wordCount; ++wordIndex) {
  149. pInst->words[wordIndex] = spvFixWord(words[wordIndex], endian);
  150. if (!wordIndex) {
  151. uint16_t thisWordCount;
  152. uint16_t thisOpcode;
  153. spvOpcodeSplit(pInst->words[wordIndex], &thisWordCount, &thisOpcode);
  154. assert(opcode == static_cast<spv::Op>(thisOpcode) &&
  155. wordCount == thisWordCount && "Endianness failed!");
  156. }
  157. }
  158. }
  159. const char* spvOpcodeString(const uint32_t opcode) {
  160. const auto beg = kOpcodeTableEntries;
  161. const auto end = kOpcodeTableEntries + ARRAY_SIZE(kOpcodeTableEntries);
  162. spv_opcode_desc_t needle = {"", static_cast<spv::Op>(opcode),
  163. 0, nullptr,
  164. 0, {},
  165. false, false,
  166. 0, nullptr,
  167. ~0u, ~0u};
  168. auto comp = [](const spv_opcode_desc_t& lhs, const spv_opcode_desc_t& rhs) {
  169. return lhs.opcode < rhs.opcode;
  170. };
  171. auto it = std::lower_bound(beg, end, needle, comp);
  172. if (it != end && it->opcode == spv::Op(opcode)) {
  173. return it->name;
  174. }
  175. assert(0 && "Unreachable!");
  176. return "unknown";
  177. }
  178. const char* spvOpcodeString(const spv::Op opcode) {
  179. return spvOpcodeString(static_cast<uint32_t>(opcode));
  180. }
  181. int32_t spvOpcodeIsScalarType(const spv::Op opcode) {
  182. switch (opcode) {
  183. case spv::Op::OpTypeInt:
  184. case spv::Op::OpTypeFloat:
  185. case spv::Op::OpTypeBool:
  186. return true;
  187. default:
  188. return false;
  189. }
  190. }
  191. int32_t spvOpcodeIsSpecConstant(const spv::Op opcode) {
  192. switch (opcode) {
  193. case spv::Op::OpSpecConstantTrue:
  194. case spv::Op::OpSpecConstantFalse:
  195. case spv::Op::OpSpecConstant:
  196. case spv::Op::OpSpecConstantComposite:
  197. case spv::Op::OpSpecConstantOp:
  198. return true;
  199. default:
  200. return false;
  201. }
  202. }
  203. int32_t spvOpcodeIsConstant(const spv::Op opcode) {
  204. switch (opcode) {
  205. case spv::Op::OpConstantTrue:
  206. case spv::Op::OpConstantFalse:
  207. case spv::Op::OpConstant:
  208. case spv::Op::OpConstantComposite:
  209. case spv::Op::OpConstantSampler:
  210. case spv::Op::OpConstantNull:
  211. case spv::Op::OpConstantFunctionPointerINTEL:
  212. case spv::Op::OpSpecConstantTrue:
  213. case spv::Op::OpSpecConstantFalse:
  214. case spv::Op::OpSpecConstant:
  215. case spv::Op::OpSpecConstantComposite:
  216. case spv::Op::OpSpecConstantOp:
  217. return true;
  218. default:
  219. return false;
  220. }
  221. }
  222. bool spvOpcodeIsConstantOrUndef(const spv::Op opcode) {
  223. return opcode == spv::Op::OpUndef || spvOpcodeIsConstant(opcode);
  224. }
  225. bool spvOpcodeIsScalarSpecConstant(const spv::Op opcode) {
  226. switch (opcode) {
  227. case spv::Op::OpSpecConstantTrue:
  228. case spv::Op::OpSpecConstantFalse:
  229. case spv::Op::OpSpecConstant:
  230. return true;
  231. default:
  232. return false;
  233. }
  234. }
  235. int32_t spvOpcodeIsComposite(const spv::Op opcode) {
  236. switch (opcode) {
  237. case spv::Op::OpTypeVector:
  238. case spv::Op::OpTypeMatrix:
  239. case spv::Op::OpTypeArray:
  240. case spv::Op::OpTypeStruct:
  241. case spv::Op::OpTypeCooperativeMatrixNV:
  242. case spv::Op::OpTypeCooperativeMatrixKHR:
  243. return true;
  244. default:
  245. return false;
  246. }
  247. }
  248. bool spvOpcodeReturnsLogicalVariablePointer(const spv::Op opcode) {
  249. switch (opcode) {
  250. case spv::Op::OpVariable:
  251. case spv::Op::OpAccessChain:
  252. case spv::Op::OpInBoundsAccessChain:
  253. case spv::Op::OpFunctionParameter:
  254. case spv::Op::OpImageTexelPointer:
  255. case spv::Op::OpCopyObject:
  256. case spv::Op::OpSelect:
  257. case spv::Op::OpPhi:
  258. case spv::Op::OpFunctionCall:
  259. case spv::Op::OpPtrAccessChain:
  260. case spv::Op::OpLoad:
  261. case spv::Op::OpConstantNull:
  262. case spv::Op::OpRawAccessChainNV:
  263. return true;
  264. default:
  265. return false;
  266. }
  267. }
  268. int32_t spvOpcodeReturnsLogicalPointer(const spv::Op opcode) {
  269. switch (opcode) {
  270. case spv::Op::OpVariable:
  271. case spv::Op::OpAccessChain:
  272. case spv::Op::OpInBoundsAccessChain:
  273. case spv::Op::OpFunctionParameter:
  274. case spv::Op::OpImageTexelPointer:
  275. case spv::Op::OpCopyObject:
  276. case spv::Op::OpRawAccessChainNV:
  277. return true;
  278. default:
  279. return false;
  280. }
  281. }
  282. int32_t spvOpcodeGeneratesType(spv::Op op) {
  283. switch (op) {
  284. case spv::Op::OpTypeVoid:
  285. case spv::Op::OpTypeBool:
  286. case spv::Op::OpTypeInt:
  287. case spv::Op::OpTypeFloat:
  288. case spv::Op::OpTypeVector:
  289. case spv::Op::OpTypeMatrix:
  290. case spv::Op::OpTypeImage:
  291. case spv::Op::OpTypeSampler:
  292. case spv::Op::OpTypeSampledImage:
  293. case spv::Op::OpTypeArray:
  294. case spv::Op::OpTypeRuntimeArray:
  295. case spv::Op::OpTypeStruct:
  296. case spv::Op::OpTypeOpaque:
  297. case spv::Op::OpTypePointer:
  298. case spv::Op::OpTypeFunction:
  299. case spv::Op::OpTypeEvent:
  300. case spv::Op::OpTypeDeviceEvent:
  301. case spv::Op::OpTypeReserveId:
  302. case spv::Op::OpTypeQueue:
  303. case spv::Op::OpTypePipe:
  304. case spv::Op::OpTypePipeStorage:
  305. case spv::Op::OpTypeNamedBarrier:
  306. case spv::Op::OpTypeAccelerationStructureNV:
  307. case spv::Op::OpTypeCooperativeMatrixNV:
  308. case spv::Op::OpTypeCooperativeMatrixKHR:
  309. // case spv::Op::OpTypeAccelerationStructureKHR: covered by
  310. // spv::Op::OpTypeAccelerationStructureNV
  311. case spv::Op::OpTypeRayQueryKHR:
  312. case spv::Op::OpTypeHitObjectNV:
  313. return true;
  314. default:
  315. // In particular, OpTypeForwardPointer does not generate a type,
  316. // but declares a storage class for a pointer type generated
  317. // by a different instruction.
  318. break;
  319. }
  320. return 0;
  321. }
  322. bool spvOpcodeIsDecoration(const spv::Op opcode) {
  323. switch (opcode) {
  324. case spv::Op::OpDecorate:
  325. case spv::Op::OpDecorateId:
  326. case spv::Op::OpMemberDecorate:
  327. case spv::Op::OpGroupDecorate:
  328. case spv::Op::OpGroupMemberDecorate:
  329. case spv::Op::OpDecorateStringGOOGLE:
  330. case spv::Op::OpMemberDecorateStringGOOGLE:
  331. return true;
  332. default:
  333. break;
  334. }
  335. return false;
  336. }
  337. bool spvOpcodeIsLoad(const spv::Op opcode) {
  338. switch (opcode) {
  339. case spv::Op::OpLoad:
  340. case spv::Op::OpImageSampleExplicitLod:
  341. case spv::Op::OpImageSampleImplicitLod:
  342. case spv::Op::OpImageSampleDrefImplicitLod:
  343. case spv::Op::OpImageSampleDrefExplicitLod:
  344. case spv::Op::OpImageSampleProjImplicitLod:
  345. case spv::Op::OpImageSampleProjExplicitLod:
  346. case spv::Op::OpImageSampleProjDrefImplicitLod:
  347. case spv::Op::OpImageSampleProjDrefExplicitLod:
  348. case spv::Op::OpImageFetch:
  349. case spv::Op::OpImageGather:
  350. case spv::Op::OpImageDrefGather:
  351. case spv::Op::OpImageRead:
  352. case spv::Op::OpImageSparseSampleImplicitLod:
  353. case spv::Op::OpImageSparseSampleExplicitLod:
  354. case spv::Op::OpImageSparseSampleDrefExplicitLod:
  355. case spv::Op::OpImageSparseSampleDrefImplicitLod:
  356. case spv::Op::OpImageSparseFetch:
  357. case spv::Op::OpImageSparseGather:
  358. case spv::Op::OpImageSparseDrefGather:
  359. case spv::Op::OpImageSparseRead:
  360. return true;
  361. default:
  362. return false;
  363. }
  364. }
  365. bool spvOpcodeIsBranch(spv::Op opcode) {
  366. switch (opcode) {
  367. case spv::Op::OpBranch:
  368. case spv::Op::OpBranchConditional:
  369. case spv::Op::OpSwitch:
  370. return true;
  371. default:
  372. return false;
  373. }
  374. }
  375. bool spvOpcodeIsAtomicWithLoad(const spv::Op opcode) {
  376. switch (opcode) {
  377. case spv::Op::OpAtomicLoad:
  378. case spv::Op::OpAtomicExchange:
  379. case spv::Op::OpAtomicCompareExchange:
  380. case spv::Op::OpAtomicCompareExchangeWeak:
  381. case spv::Op::OpAtomicIIncrement:
  382. case spv::Op::OpAtomicIDecrement:
  383. case spv::Op::OpAtomicIAdd:
  384. case spv::Op::OpAtomicFAddEXT:
  385. case spv::Op::OpAtomicISub:
  386. case spv::Op::OpAtomicSMin:
  387. case spv::Op::OpAtomicUMin:
  388. case spv::Op::OpAtomicFMinEXT:
  389. case spv::Op::OpAtomicSMax:
  390. case spv::Op::OpAtomicUMax:
  391. case spv::Op::OpAtomicFMaxEXT:
  392. case spv::Op::OpAtomicAnd:
  393. case spv::Op::OpAtomicOr:
  394. case spv::Op::OpAtomicXor:
  395. case spv::Op::OpAtomicFlagTestAndSet:
  396. return true;
  397. default:
  398. return false;
  399. }
  400. }
  401. bool spvOpcodeIsAtomicOp(const spv::Op opcode) {
  402. return (spvOpcodeIsAtomicWithLoad(opcode) ||
  403. opcode == spv::Op::OpAtomicStore ||
  404. opcode == spv::Op::OpAtomicFlagClear);
  405. }
  406. bool spvOpcodeIsReturn(spv::Op opcode) {
  407. switch (opcode) {
  408. case spv::Op::OpReturn:
  409. case spv::Op::OpReturnValue:
  410. return true;
  411. default:
  412. return false;
  413. }
  414. }
  415. bool spvOpcodeIsAbort(spv::Op opcode) {
  416. switch (opcode) {
  417. case spv::Op::OpKill:
  418. case spv::Op::OpUnreachable:
  419. case spv::Op::OpTerminateInvocation:
  420. case spv::Op::OpTerminateRayKHR:
  421. case spv::Op::OpIgnoreIntersectionKHR:
  422. case spv::Op::OpEmitMeshTasksEXT:
  423. return true;
  424. default:
  425. return false;
  426. }
  427. }
  428. bool spvOpcodeIsReturnOrAbort(spv::Op opcode) {
  429. return spvOpcodeIsReturn(opcode) || spvOpcodeIsAbort(opcode);
  430. }
  431. bool spvOpcodeIsBlockTerminator(spv::Op opcode) {
  432. return spvOpcodeIsBranch(opcode) || spvOpcodeIsReturnOrAbort(opcode);
  433. }
  434. bool spvOpcodeIsBaseOpaqueType(spv::Op opcode) {
  435. switch (opcode) {
  436. case spv::Op::OpTypeImage:
  437. case spv::Op::OpTypeSampler:
  438. case spv::Op::OpTypeSampledImage:
  439. case spv::Op::OpTypeOpaque:
  440. case spv::Op::OpTypeEvent:
  441. case spv::Op::OpTypeDeviceEvent:
  442. case spv::Op::OpTypeReserveId:
  443. case spv::Op::OpTypeQueue:
  444. case spv::Op::OpTypePipe:
  445. case spv::Op::OpTypeForwardPointer:
  446. case spv::Op::OpTypePipeStorage:
  447. case spv::Op::OpTypeNamedBarrier:
  448. return true;
  449. default:
  450. return false;
  451. }
  452. }
  453. bool spvOpcodeIsNonUniformGroupOperation(spv::Op opcode) {
  454. switch (opcode) {
  455. case spv::Op::OpGroupNonUniformElect:
  456. case spv::Op::OpGroupNonUniformAll:
  457. case spv::Op::OpGroupNonUniformAny:
  458. case spv::Op::OpGroupNonUniformAllEqual:
  459. case spv::Op::OpGroupNonUniformBroadcast:
  460. case spv::Op::OpGroupNonUniformBroadcastFirst:
  461. case spv::Op::OpGroupNonUniformBallot:
  462. case spv::Op::OpGroupNonUniformInverseBallot:
  463. case spv::Op::OpGroupNonUniformBallotBitExtract:
  464. case spv::Op::OpGroupNonUniformBallotBitCount:
  465. case spv::Op::OpGroupNonUniformBallotFindLSB:
  466. case spv::Op::OpGroupNonUniformBallotFindMSB:
  467. case spv::Op::OpGroupNonUniformShuffle:
  468. case spv::Op::OpGroupNonUniformShuffleXor:
  469. case spv::Op::OpGroupNonUniformShuffleUp:
  470. case spv::Op::OpGroupNonUniformShuffleDown:
  471. case spv::Op::OpGroupNonUniformIAdd:
  472. case spv::Op::OpGroupNonUniformFAdd:
  473. case spv::Op::OpGroupNonUniformIMul:
  474. case spv::Op::OpGroupNonUniformFMul:
  475. case spv::Op::OpGroupNonUniformSMin:
  476. case spv::Op::OpGroupNonUniformUMin:
  477. case spv::Op::OpGroupNonUniformFMin:
  478. case spv::Op::OpGroupNonUniformSMax:
  479. case spv::Op::OpGroupNonUniformUMax:
  480. case spv::Op::OpGroupNonUniformFMax:
  481. case spv::Op::OpGroupNonUniformBitwiseAnd:
  482. case spv::Op::OpGroupNonUniformBitwiseOr:
  483. case spv::Op::OpGroupNonUniformBitwiseXor:
  484. case spv::Op::OpGroupNonUniformLogicalAnd:
  485. case spv::Op::OpGroupNonUniformLogicalOr:
  486. case spv::Op::OpGroupNonUniformLogicalXor:
  487. case spv::Op::OpGroupNonUniformQuadBroadcast:
  488. case spv::Op::OpGroupNonUniformQuadSwap:
  489. case spv::Op::OpGroupNonUniformRotateKHR:
  490. case spv::Op::OpGroupNonUniformQuadAllKHR:
  491. case spv::Op::OpGroupNonUniformQuadAnyKHR:
  492. return true;
  493. default:
  494. return false;
  495. }
  496. }
  497. bool spvOpcodeIsScalarizable(spv::Op opcode) {
  498. switch (opcode) {
  499. case spv::Op::OpPhi:
  500. case spv::Op::OpCopyObject:
  501. case spv::Op::OpConvertFToU:
  502. case spv::Op::OpConvertFToS:
  503. case spv::Op::OpConvertSToF:
  504. case spv::Op::OpConvertUToF:
  505. case spv::Op::OpUConvert:
  506. case spv::Op::OpSConvert:
  507. case spv::Op::OpFConvert:
  508. case spv::Op::OpQuantizeToF16:
  509. case spv::Op::OpVectorInsertDynamic:
  510. case spv::Op::OpSNegate:
  511. case spv::Op::OpFNegate:
  512. case spv::Op::OpIAdd:
  513. case spv::Op::OpFAdd:
  514. case spv::Op::OpISub:
  515. case spv::Op::OpFSub:
  516. case spv::Op::OpIMul:
  517. case spv::Op::OpFMul:
  518. case spv::Op::OpUDiv:
  519. case spv::Op::OpSDiv:
  520. case spv::Op::OpFDiv:
  521. case spv::Op::OpUMod:
  522. case spv::Op::OpSRem:
  523. case spv::Op::OpSMod:
  524. case spv::Op::OpFRem:
  525. case spv::Op::OpFMod:
  526. case spv::Op::OpVectorTimesScalar:
  527. case spv::Op::OpIAddCarry:
  528. case spv::Op::OpISubBorrow:
  529. case spv::Op::OpUMulExtended:
  530. case spv::Op::OpSMulExtended:
  531. case spv::Op::OpShiftRightLogical:
  532. case spv::Op::OpShiftRightArithmetic:
  533. case spv::Op::OpShiftLeftLogical:
  534. case spv::Op::OpBitwiseOr:
  535. case spv::Op::OpBitwiseAnd:
  536. case spv::Op::OpNot:
  537. case spv::Op::OpBitFieldInsert:
  538. case spv::Op::OpBitFieldSExtract:
  539. case spv::Op::OpBitFieldUExtract:
  540. case spv::Op::OpBitReverse:
  541. case spv::Op::OpBitCount:
  542. case spv::Op::OpIsNan:
  543. case spv::Op::OpIsInf:
  544. case spv::Op::OpIsFinite:
  545. case spv::Op::OpIsNormal:
  546. case spv::Op::OpSignBitSet:
  547. case spv::Op::OpLessOrGreater:
  548. case spv::Op::OpOrdered:
  549. case spv::Op::OpUnordered:
  550. case spv::Op::OpLogicalEqual:
  551. case spv::Op::OpLogicalNotEqual:
  552. case spv::Op::OpLogicalOr:
  553. case spv::Op::OpLogicalAnd:
  554. case spv::Op::OpLogicalNot:
  555. case spv::Op::OpSelect:
  556. case spv::Op::OpIEqual:
  557. case spv::Op::OpINotEqual:
  558. case spv::Op::OpUGreaterThan:
  559. case spv::Op::OpSGreaterThan:
  560. case spv::Op::OpUGreaterThanEqual:
  561. case spv::Op::OpSGreaterThanEqual:
  562. case spv::Op::OpULessThan:
  563. case spv::Op::OpSLessThan:
  564. case spv::Op::OpULessThanEqual:
  565. case spv::Op::OpSLessThanEqual:
  566. case spv::Op::OpFOrdEqual:
  567. case spv::Op::OpFUnordEqual:
  568. case spv::Op::OpFOrdNotEqual:
  569. case spv::Op::OpFUnordNotEqual:
  570. case spv::Op::OpFOrdLessThan:
  571. case spv::Op::OpFUnordLessThan:
  572. case spv::Op::OpFOrdGreaterThan:
  573. case spv::Op::OpFUnordGreaterThan:
  574. case spv::Op::OpFOrdLessThanEqual:
  575. case spv::Op::OpFUnordLessThanEqual:
  576. case spv::Op::OpFOrdGreaterThanEqual:
  577. case spv::Op::OpFUnordGreaterThanEqual:
  578. return true;
  579. default:
  580. return false;
  581. }
  582. }
  583. bool spvOpcodeIsDebug(spv::Op opcode) {
  584. switch (opcode) {
  585. case spv::Op::OpName:
  586. case spv::Op::OpMemberName:
  587. case spv::Op::OpSource:
  588. case spv::Op::OpSourceContinued:
  589. case spv::Op::OpSourceExtension:
  590. case spv::Op::OpString:
  591. case spv::Op::OpLine:
  592. case spv::Op::OpNoLine:
  593. case spv::Op::OpModuleProcessed:
  594. return true;
  595. default:
  596. return false;
  597. }
  598. }
  599. bool spvOpcodeIsCommutativeBinaryOperator(spv::Op opcode) {
  600. switch (opcode) {
  601. case spv::Op::OpPtrEqual:
  602. case spv::Op::OpPtrNotEqual:
  603. case spv::Op::OpIAdd:
  604. case spv::Op::OpFAdd:
  605. case spv::Op::OpIMul:
  606. case spv::Op::OpFMul:
  607. case spv::Op::OpDot:
  608. case spv::Op::OpIAddCarry:
  609. case spv::Op::OpUMulExtended:
  610. case spv::Op::OpSMulExtended:
  611. case spv::Op::OpBitwiseOr:
  612. case spv::Op::OpBitwiseXor:
  613. case spv::Op::OpBitwiseAnd:
  614. case spv::Op::OpOrdered:
  615. case spv::Op::OpUnordered:
  616. case spv::Op::OpLogicalEqual:
  617. case spv::Op::OpLogicalNotEqual:
  618. case spv::Op::OpLogicalOr:
  619. case spv::Op::OpLogicalAnd:
  620. case spv::Op::OpIEqual:
  621. case spv::Op::OpINotEqual:
  622. case spv::Op::OpFOrdEqual:
  623. case spv::Op::OpFUnordEqual:
  624. case spv::Op::OpFOrdNotEqual:
  625. case spv::Op::OpFUnordNotEqual:
  626. return true;
  627. default:
  628. return false;
  629. }
  630. }
  631. bool spvOpcodeIsLinearAlgebra(spv::Op opcode) {
  632. switch (opcode) {
  633. case spv::Op::OpTranspose:
  634. case spv::Op::OpVectorTimesScalar:
  635. case spv::Op::OpMatrixTimesScalar:
  636. case spv::Op::OpVectorTimesMatrix:
  637. case spv::Op::OpMatrixTimesVector:
  638. case spv::Op::OpMatrixTimesMatrix:
  639. case spv::Op::OpOuterProduct:
  640. case spv::Op::OpDot:
  641. return true;
  642. default:
  643. return false;
  644. }
  645. }
  646. bool spvOpcodeIsImageSample(const spv::Op opcode) {
  647. switch (opcode) {
  648. case spv::Op::OpImageSampleImplicitLod:
  649. case spv::Op::OpImageSampleExplicitLod:
  650. case spv::Op::OpImageSampleDrefImplicitLod:
  651. case spv::Op::OpImageSampleDrefExplicitLod:
  652. case spv::Op::OpImageSampleProjImplicitLod:
  653. case spv::Op::OpImageSampleProjExplicitLod:
  654. case spv::Op::OpImageSampleProjDrefImplicitLod:
  655. case spv::Op::OpImageSampleProjDrefExplicitLod:
  656. case spv::Op::OpImageSparseSampleImplicitLod:
  657. case spv::Op::OpImageSparseSampleExplicitLod:
  658. case spv::Op::OpImageSparseSampleDrefImplicitLod:
  659. case spv::Op::OpImageSparseSampleDrefExplicitLod:
  660. return true;
  661. default:
  662. return false;
  663. }
  664. }
  665. std::vector<uint32_t> spvOpcodeMemorySemanticsOperandIndices(spv::Op opcode) {
  666. switch (opcode) {
  667. case spv::Op::OpMemoryBarrier:
  668. return {1};
  669. case spv::Op::OpAtomicStore:
  670. case spv::Op::OpControlBarrier:
  671. case spv::Op::OpAtomicFlagClear:
  672. case spv::Op::OpMemoryNamedBarrier:
  673. return {2};
  674. case spv::Op::OpAtomicLoad:
  675. case spv::Op::OpAtomicExchange:
  676. case spv::Op::OpAtomicIIncrement:
  677. case spv::Op::OpAtomicIDecrement:
  678. case spv::Op::OpAtomicIAdd:
  679. case spv::Op::OpAtomicFAddEXT:
  680. case spv::Op::OpAtomicISub:
  681. case spv::Op::OpAtomicSMin:
  682. case spv::Op::OpAtomicUMin:
  683. case spv::Op::OpAtomicSMax:
  684. case spv::Op::OpAtomicUMax:
  685. case spv::Op::OpAtomicAnd:
  686. case spv::Op::OpAtomicOr:
  687. case spv::Op::OpAtomicXor:
  688. case spv::Op::OpAtomicFlagTestAndSet:
  689. return {4};
  690. case spv::Op::OpAtomicCompareExchange:
  691. case spv::Op::OpAtomicCompareExchangeWeak:
  692. return {4, 5};
  693. default:
  694. return {};
  695. }
  696. }
  697. bool spvOpcodeIsAccessChain(spv::Op opcode) {
  698. switch (opcode) {
  699. case spv::Op::OpAccessChain:
  700. case spv::Op::OpInBoundsAccessChain:
  701. case spv::Op::OpPtrAccessChain:
  702. case spv::Op::OpInBoundsPtrAccessChain:
  703. case spv::Op::OpRawAccessChainNV:
  704. return true;
  705. default:
  706. return false;
  707. }
  708. }
  709. bool spvOpcodeIsBit(spv::Op opcode) {
  710. switch (opcode) {
  711. case spv::Op::OpShiftRightLogical:
  712. case spv::Op::OpShiftRightArithmetic:
  713. case spv::Op::OpShiftLeftLogical:
  714. case spv::Op::OpBitwiseOr:
  715. case spv::Op::OpBitwiseXor:
  716. case spv::Op::OpBitwiseAnd:
  717. case spv::Op::OpNot:
  718. case spv::Op::OpBitReverse:
  719. case spv::Op::OpBitCount:
  720. return true;
  721. default:
  722. return false;
  723. }
  724. }