graphics_robust_access_pass.cpp 41 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967
  1. // Copyright (c) 2019 Google LLC
  2. //
  3. // 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
  6. //
  7. // http://www.apache.org/licenses/LICENSE-2.0
  8. //
  9. // 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.
  14. // This pass injects code in a graphics shader to implement guarantees
  15. // satisfying Vulkan's robustBufferAcces rules. Robust access rules permit
  16. // an out-of-bounds access to be redirected to an access of the same type
  17. // (load, store, etc.) but within the same root object.
  18. //
  19. // We assume baseline functionality in Vulkan, i.e. the module uses
  20. // logical addressing mode, without VK_KHR_variable_pointers.
  21. //
  22. // - Logical addressing mode implies:
  23. // - Each root pointer (a pointer that exists other than by the
  24. // execution of a shader instruction) is the result of an OpVariable.
  25. //
  26. // - Instructions that result in pointers are:
  27. // OpVariable
  28. // OpAccessChain
  29. // OpInBoundsAccessChain
  30. // OpFunctionParameter
  31. // OpImageTexelPointer
  32. // OpCopyObject
  33. //
  34. // - Instructions that use a pointer are:
  35. // OpLoad
  36. // OpStore
  37. // OpAccessChain
  38. // OpInBoundsAccessChain
  39. // OpFunctionCall
  40. // OpImageTexelPointer
  41. // OpCopyMemory
  42. // OpCopyObject
  43. // all OpAtomic* instructions
  44. //
  45. // We classify pointer-users into:
  46. // - Accesses:
  47. // - OpLoad
  48. // - OpStore
  49. // - OpAtomic*
  50. // - OpCopyMemory
  51. //
  52. // - Address calculations:
  53. // - OpAccessChain
  54. // - OpInBoundsAccessChain
  55. //
  56. // - Pass-through:
  57. // - OpFunctionCall
  58. // - OpFunctionParameter
  59. // - OpCopyObject
  60. //
  61. // The strategy is:
  62. //
  63. // - Handle only logical addressing mode. In particular, don't handle a module
  64. // if it uses one of the variable-pointers capabilities.
  65. //
  66. // - Don't handle modules using capability RuntimeDescriptorArrayEXT. So the
  67. // only runtime arrays are those that are the last member in a
  68. // Block-decorated struct. This allows us to feasibly/easily compute the
  69. // length of the runtime array. See below.
  70. //
  71. // - The memory locations accessed by OpLoad, OpStore, OpCopyMemory, and
  72. // OpAtomic* are determined by their pointer parameter or parameters.
  73. // Pointers are always (correctly) typed and so the address and number of
  74. // consecutive locations are fully determined by the pointer.
  75. //
  76. // - A pointer value orginates as one of few cases:
  77. //
  78. // - OpVariable for an interface object or an array of them: image,
  79. // buffer (UBO or SSBO), sampler, sampled-image, push-constant, input
  80. // variable, output variable. The execution environment is responsible for
  81. // allocating the correct amount of storage for these, and for ensuring
  82. // each resource bound to such a variable is big enough to contain the
  83. // SPIR-V pointee type of the variable.
  84. //
  85. // - OpVariable for a non-interface object. These are variables in
  86. // Workgroup, Private, and Function storage classes. The compiler ensures
  87. // the underlying allocation is big enough to store the entire SPIR-V
  88. // pointee type of the variable.
  89. //
  90. // - An OpFunctionParameter. This always maps to a pointer parameter to an
  91. // OpFunctionCall.
  92. //
  93. // - In logical addressing mode, these are severely limited:
  94. // "Any pointer operand to an OpFunctionCall must be:
  95. // - a memory object declaration, or
  96. // - a pointer to an element in an array that is a memory object
  97. // declaration, where the element type is OpTypeSampler or OpTypeImage"
  98. //
  99. // - This has an important simplifying consequence:
  100. //
  101. // - When looking for a pointer to the structure containing a runtime
  102. // array, you begin with a pointer to the runtime array and trace
  103. // backward in the function. You never have to trace back beyond
  104. // your function call boundary. So you can't take a partial access
  105. // chain into an SSBO, then pass that pointer into a function. So
  106. // we don't resort to using fat pointers to compute array length.
  107. // We can trace back to a pointer to the containing structure,
  108. // and use that in an OpArrayLength instruction. (The structure type
  109. // gives us the member index of the runtime array.)
  110. //
  111. // - Otherwise, the pointer type fully encodes the range of valid
  112. // addresses. In particular, the type of a pointer to an aggregate
  113. // value fully encodes the range of indices when indexing into
  114. // that aggregate.
  115. //
  116. // - The pointer is the result of an access chain instruction. We clamp
  117. // indices contributing to address calculations. As noted above, the
  118. // valid ranges are either bound by the length of a runtime array, or
  119. // by the type of the base pointer. The length of a runtime array is
  120. // the result of an OpArrayLength instruction acting on the pointer of
  121. // the containing structure as noted above.
  122. //
  123. // - TODO(dneto): OpImageTexelPointer:
  124. // - Clamp coordinate to the image size returned by OpImageQuerySize
  125. // - If multi-sampled, clamp the sample index to the count returned by
  126. // OpImageQuerySamples.
  127. // - If not multi-sampled, set the sample index to 0.
  128. //
  129. // - Rely on the external validator to check that pointers are only
  130. // used by the instructions as above.
  131. //
  132. // - Handles OpTypeRuntimeArray
  133. // Track pointer back to original resource (pointer to struct), so we can
  134. // query the runtime array size.
  135. //
  136. #include "graphics_robust_access_pass.h"
  137. #include <algorithm>
  138. #include <cstring>
  139. #include <functional>
  140. #include <initializer_list>
  141. #include <utility>
  142. #include "constants.h"
  143. #include "def_use_manager.h"
  144. #include "function.h"
  145. #include "ir_context.h"
  146. #include "module.h"
  147. #include "pass.h"
  148. #include "source/diagnostic.h"
  149. #include "source/util/make_unique.h"
  150. #include "spirv-tools/libspirv.h"
  151. #include "spirv/unified1/GLSL.std.450.h"
  152. #include "spirv/unified1/spirv.h"
  153. #include "type_manager.h"
  154. #include "types.h"
  155. namespace spvtools {
  156. namespace opt {
  157. using opt::Instruction;
  158. using opt::Operand;
  159. using spvtools::MakeUnique;
  160. GraphicsRobustAccessPass::GraphicsRobustAccessPass() : module_status_() {}
  161. Pass::Status GraphicsRobustAccessPass::Process() {
  162. module_status_ = PerModuleState();
  163. ProcessCurrentModule();
  164. auto result = module_status_.failed
  165. ? Status::Failure
  166. : (module_status_.modified ? Status::SuccessWithChange
  167. : Status::SuccessWithoutChange);
  168. return result;
  169. }
  170. spvtools::DiagnosticStream GraphicsRobustAccessPass::Fail() {
  171. module_status_.failed = true;
  172. // We don't really have a position, and we'll ignore the result.
  173. return std::move(
  174. spvtools::DiagnosticStream({}, consumer(), "", SPV_ERROR_INVALID_BINARY)
  175. << name() << ": ");
  176. }
  177. spv_result_t GraphicsRobustAccessPass::IsCompatibleModule() {
  178. auto* feature_mgr = context()->get_feature_mgr();
  179. if (!feature_mgr->HasCapability(SpvCapabilityShader))
  180. return Fail() << "Can only process Shader modules";
  181. if (feature_mgr->HasCapability(SpvCapabilityVariablePointers))
  182. return Fail() << "Can't process modules with VariablePointers capability";
  183. if (feature_mgr->HasCapability(SpvCapabilityVariablePointersStorageBuffer))
  184. return Fail() << "Can't process modules with VariablePointersStorageBuffer "
  185. "capability";
  186. if (feature_mgr->HasCapability(SpvCapabilityRuntimeDescriptorArrayEXT)) {
  187. // These have a RuntimeArray outside of Block-decorated struct. There
  188. // is no way to compute the array length from within SPIR-V.
  189. return Fail() << "Can't process modules with RuntimeDescriptorArrayEXT "
  190. "capability";
  191. }
  192. {
  193. auto* inst = context()->module()->GetMemoryModel();
  194. const auto addressing_model = inst->GetSingleWordOperand(0);
  195. if (addressing_model != SpvAddressingModelLogical)
  196. return Fail() << "Addressing model must be Logical. Found "
  197. << inst->PrettyPrint();
  198. }
  199. return SPV_SUCCESS;
  200. }
  201. spv_result_t GraphicsRobustAccessPass::ProcessCurrentModule() {
  202. auto err = IsCompatibleModule();
  203. if (err != SPV_SUCCESS) return err;
  204. ProcessFunction fn = [this](opt::Function* f) { return ProcessAFunction(f); };
  205. module_status_.modified |= context()->ProcessReachableCallTree(fn);
  206. // Need something here. It's the price we pay for easier failure paths.
  207. return SPV_SUCCESS;
  208. }
  209. bool GraphicsRobustAccessPass::ProcessAFunction(opt::Function* function) {
  210. // Ensure that all pointers computed inside a function are within bounds.
  211. // Find the access chains in this block before trying to modify them.
  212. std::vector<Instruction*> access_chains;
  213. std::vector<Instruction*> image_texel_pointers;
  214. for (auto& block : *function) {
  215. for (auto& inst : block) {
  216. switch (inst.opcode()) {
  217. case SpvOpAccessChain:
  218. case SpvOpInBoundsAccessChain:
  219. access_chains.push_back(&inst);
  220. break;
  221. case SpvOpImageTexelPointer:
  222. image_texel_pointers.push_back(&inst);
  223. break;
  224. default:
  225. break;
  226. }
  227. }
  228. }
  229. for (auto* inst : access_chains) {
  230. ClampIndicesForAccessChain(inst);
  231. }
  232. for (auto* inst : image_texel_pointers) {
  233. if (SPV_SUCCESS != ClampCoordinateForImageTexelPointer(inst)) break;
  234. }
  235. return module_status_.modified;
  236. }
  237. void GraphicsRobustAccessPass::ClampIndicesForAccessChain(
  238. Instruction* access_chain) {
  239. Instruction& inst = *access_chain;
  240. auto* constant_mgr = context()->get_constant_mgr();
  241. auto* def_use_mgr = context()->get_def_use_mgr();
  242. auto* type_mgr = context()->get_type_mgr();
  243. // Replaces one of the OpAccessChain index operands with a new value.
  244. // Updates def-use analysis.
  245. auto replace_index = [&inst, def_use_mgr](uint32_t operand_index,
  246. Instruction* new_value) {
  247. inst.SetOperand(operand_index, {new_value->result_id()});
  248. def_use_mgr->AnalyzeInstUse(&inst);
  249. };
  250. // Replaces one of the OpAccesssChain index operands with a clamped value.
  251. // Replace the operand at |operand_index| with the value computed from
  252. // unsigned_clamp(%old_value, %min_value, %max_value). It also analyzes
  253. // the new instruction and records that them module is modified.
  254. auto clamp_index = [&inst, this, &replace_index](
  255. uint32_t operand_index, Instruction* old_value,
  256. Instruction* min_value, Instruction* max_value) {
  257. auto* clamp_inst = MakeClampInst(old_value, min_value, max_value, &inst);
  258. replace_index(operand_index, clamp_inst);
  259. };
  260. // Ensures the specified index of access chain |inst| has a value that is
  261. // at most |count| - 1. If the index is already a constant value less than
  262. // |count| then no change is made.
  263. auto clamp_to_literal_count = [&inst, this, &constant_mgr, &type_mgr,
  264. &replace_index, &clamp_index](
  265. uint32_t operand_index, uint64_t count) {
  266. Instruction* index_inst =
  267. this->GetDef(inst.GetSingleWordOperand(operand_index));
  268. const auto* index_type =
  269. type_mgr->GetType(index_inst->type_id())->AsInteger();
  270. assert(index_type);
  271. if (count <= 1) {
  272. // Replace the index with 0.
  273. replace_index(operand_index, GetValueForType(0, index_type));
  274. return;
  275. }
  276. const auto index_width = index_type->width();
  277. // If the index is a constant then |index_constant| will not be a null
  278. // pointer. (If index is an |OpConstantNull| then it |index_constant| will
  279. // not be a null pointer.) Since access chain indices must be scalar
  280. // integers, this can't be a spec constant.
  281. if (auto* index_constant = constant_mgr->GetConstantFromInst(index_inst)) {
  282. auto* int_index_constant = index_constant->AsIntConstant();
  283. int64_t value = 0;
  284. // OpAccessChain indices are treated as signed. So get the signed
  285. // constant value here.
  286. if (index_width <= 32) {
  287. value = int64_t(int_index_constant->GetS32BitValue());
  288. } else if (index_width <= 64) {
  289. value = int_index_constant->GetS64BitValue();
  290. } else {
  291. this->Fail() << "Can't handle indices wider than 64 bits, found "
  292. "constant index with "
  293. << index_type->width() << "bits";
  294. return;
  295. }
  296. if (value < 0) {
  297. replace_index(operand_index, GetValueForType(0, index_type));
  298. } else if (uint64_t(value) < count) {
  299. // Nothing to do.
  300. return;
  301. } else {
  302. // Replace with count - 1.
  303. assert(count > 0); // Already took care of this case above.
  304. replace_index(operand_index, GetValueForType(count - 1, index_type));
  305. }
  306. } else {
  307. // Generate a clamp instruction.
  308. // Compute the bit width of a viable type to hold (count-1).
  309. const auto maxval = count - 1;
  310. const auto* maxval_type = index_type;
  311. // Look for a bit width, up to 64 bits wide, to fit maxval.
  312. uint32_t maxval_width = index_width;
  313. while ((maxval_width < 64) && (0 != (maxval >> maxval_width))) {
  314. maxval_width *= 2;
  315. }
  316. // Widen the index value if necessary
  317. if (maxval_width > index_width) {
  318. // Find the wider type. We only need this case if a constant (array)
  319. // bound is too big. This never requires us to *add* a capability
  320. // declaration for Int64 because the existence of the array bound would
  321. // already have required that declaration.
  322. index_inst = WidenInteger(index_type->IsSigned(), maxval_width,
  323. index_inst, &inst);
  324. maxval_type = type_mgr->GetType(index_inst->type_id())->AsInteger();
  325. }
  326. // Finally, clamp the index.
  327. clamp_index(operand_index, index_inst, GetValueForType(0, maxval_type),
  328. GetValueForType(maxval, maxval_type));
  329. }
  330. };
  331. // Ensures the specified index of access chain |inst| has a value that is at
  332. // most the value of |count_inst| minus 1, where |count_inst| is treated as an
  333. // unsigned integer.
  334. auto clamp_to_count = [&inst, this, &constant_mgr, &clamp_to_literal_count,
  335. &clamp_index, &type_mgr](uint32_t operand_index,
  336. Instruction* count_inst) {
  337. Instruction* index_inst =
  338. this->GetDef(inst.GetSingleWordOperand(operand_index));
  339. const auto* index_type =
  340. type_mgr->GetType(index_inst->type_id())->AsInteger();
  341. const auto* count_type =
  342. type_mgr->GetType(count_inst->type_id())->AsInteger();
  343. assert(index_type);
  344. if (const auto* count_constant =
  345. constant_mgr->GetConstantFromInst(count_inst)) {
  346. uint64_t value = 0;
  347. const auto width = count_constant->type()->AsInteger()->width();
  348. if (width <= 32) {
  349. value = count_constant->AsIntConstant()->GetU32BitValue();
  350. } else if (width <= 64) {
  351. value = count_constant->AsIntConstant()->GetU64BitValue();
  352. } else {
  353. this->Fail() << "Can't handle indices wider than 64 bits, found "
  354. "constant index with "
  355. << index_type->width() << "bits";
  356. return;
  357. }
  358. clamp_to_literal_count(operand_index, value);
  359. } else {
  360. // Widen them to the same width.
  361. const auto index_width = index_type->width();
  362. const auto count_width = count_type->width();
  363. const auto target_width = std::max(index_width, count_width);
  364. // UConvert requires the result type to have 0 signedness. So enforce
  365. // that here.
  366. auto* wider_type = index_width < count_width ? count_type : index_type;
  367. if (index_type->width() < target_width) {
  368. // Access chain indices are treated as signed integers.
  369. index_inst = WidenInteger(true, target_width, index_inst, &inst);
  370. } else if (count_type->width() < target_width) {
  371. // Assume type sizes are treated as unsigned.
  372. count_inst = WidenInteger(false, target_width, count_inst, &inst);
  373. }
  374. // Compute count - 1.
  375. // It doesn't matter if 1 is signed or unsigned.
  376. auto* one = GetValueForType(1, wider_type);
  377. auto* count_minus_1 = InsertInst(
  378. &inst, SpvOpISub, type_mgr->GetId(wider_type), TakeNextId(),
  379. {{SPV_OPERAND_TYPE_ID, {count_inst->result_id()}},
  380. {SPV_OPERAND_TYPE_ID, {one->result_id()}}});
  381. clamp_index(operand_index, index_inst, GetValueForType(0, wider_type),
  382. count_minus_1);
  383. }
  384. };
  385. const Instruction* base_inst = GetDef(inst.GetSingleWordInOperand(0));
  386. const Instruction* base_type = GetDef(base_inst->type_id());
  387. Instruction* pointee_type = GetDef(base_type->GetSingleWordInOperand(1));
  388. // Walk the indices from earliest to latest, replacing indices with a
  389. // clamped value, and updating the pointee_type. The order matters for
  390. // the case when we have to compute the length of a runtime array. In
  391. // that the algorithm relies on the fact that that the earlier indices
  392. // have already been clamped.
  393. const uint32_t num_operands = inst.NumOperands();
  394. for (uint32_t idx = 3; !module_status_.failed && idx < num_operands; ++idx) {
  395. const uint32_t index_id = inst.GetSingleWordOperand(idx);
  396. Instruction* index_inst = GetDef(index_id);
  397. switch (pointee_type->opcode()) {
  398. case SpvOpTypeMatrix: // Use column count
  399. case SpvOpTypeVector: // Use component count
  400. {
  401. const uint32_t count = pointee_type->GetSingleWordOperand(2);
  402. clamp_to_literal_count(idx, count);
  403. pointee_type = GetDef(pointee_type->GetSingleWordOperand(1));
  404. } break;
  405. case SpvOpTypeArray: {
  406. // The array length can be a spec constant, so go through the general
  407. // case.
  408. Instruction* array_len = GetDef(pointee_type->GetSingleWordOperand(2));
  409. clamp_to_count(idx, array_len);
  410. pointee_type = GetDef(pointee_type->GetSingleWordOperand(1));
  411. } break;
  412. case SpvOpTypeStruct: {
  413. // SPIR-V requires the index to be an OpConstant.
  414. // We need to know the index literal value so we can compute the next
  415. // pointee type.
  416. if (index_inst->opcode() != SpvOpConstant ||
  417. !constant_mgr->GetConstantFromInst(index_inst)
  418. ->type()
  419. ->AsInteger()) {
  420. Fail() << "Member index into struct is not a constant integer: "
  421. << index_inst->PrettyPrint(
  422. SPV_BINARY_TO_TEXT_OPTION_FRIENDLY_NAMES)
  423. << "\nin access chain: "
  424. << inst.PrettyPrint(SPV_BINARY_TO_TEXT_OPTION_FRIENDLY_NAMES);
  425. return;
  426. }
  427. const auto num_members = pointee_type->NumInOperands();
  428. const auto* index_constant =
  429. constant_mgr->GetConstantFromInst(index_inst);
  430. // Get the sign-extended value, since access index is always treated as
  431. // signed.
  432. const auto index_value = index_constant->GetSignExtendedValue();
  433. if (index_value < 0 || index_value >= num_members) {
  434. Fail() << "Member index " << index_value
  435. << " is out of bounds for struct type: "
  436. << pointee_type->PrettyPrint(
  437. SPV_BINARY_TO_TEXT_OPTION_FRIENDLY_NAMES)
  438. << "\nin access chain: "
  439. << inst.PrettyPrint(SPV_BINARY_TO_TEXT_OPTION_FRIENDLY_NAMES);
  440. return;
  441. }
  442. pointee_type = GetDef(pointee_type->GetSingleWordInOperand(
  443. static_cast<uint32_t>(index_value)));
  444. // No need to clamp this index. We just checked that it's valid.
  445. } break;
  446. case SpvOpTypeRuntimeArray: {
  447. auto* array_len = MakeRuntimeArrayLengthInst(&inst, idx);
  448. if (!array_len) { // We've already signaled an error.
  449. return;
  450. }
  451. clamp_to_count(idx, array_len);
  452. pointee_type = GetDef(pointee_type->GetSingleWordOperand(1));
  453. } break;
  454. default:
  455. Fail() << " Unhandled pointee type for access chain "
  456. << pointee_type->PrettyPrint(
  457. SPV_BINARY_TO_TEXT_OPTION_FRIENDLY_NAMES);
  458. }
  459. }
  460. }
  461. uint32_t GraphicsRobustAccessPass::GetGlslInsts() {
  462. if (module_status_.glsl_insts_id == 0) {
  463. // This string serves double-duty as raw data for a string and for a vector
  464. // of 32-bit words
  465. const char glsl[] = "GLSL.std.450\0\0\0\0";
  466. const size_t glsl_str_byte_len = 16;
  467. // Use an existing import if we can.
  468. for (auto& inst : context()->module()->ext_inst_imports()) {
  469. const auto& name_words = inst.GetInOperand(0).words;
  470. if (0 == std::strncmp(reinterpret_cast<const char*>(name_words.data()),
  471. glsl, glsl_str_byte_len)) {
  472. module_status_.glsl_insts_id = inst.result_id();
  473. }
  474. }
  475. if (module_status_.glsl_insts_id == 0) {
  476. // Make a new import instruction.
  477. module_status_.glsl_insts_id = TakeNextId();
  478. std::vector<uint32_t> words(glsl_str_byte_len / sizeof(uint32_t));
  479. std::memcpy(words.data(), glsl, glsl_str_byte_len);
  480. auto import_inst = MakeUnique<Instruction>(
  481. context(), SpvOpExtInstImport, 0, module_status_.glsl_insts_id,
  482. std::initializer_list<Operand>{
  483. Operand{SPV_OPERAND_TYPE_LITERAL_STRING, std::move(words)}});
  484. Instruction* inst = import_inst.get();
  485. context()->module()->AddExtInstImport(std::move(import_inst));
  486. module_status_.modified = true;
  487. context()->AnalyzeDefUse(inst);
  488. // Reanalyze the feature list, since we added an extended instruction
  489. // set improt.
  490. context()->get_feature_mgr()->Analyze(context()->module());
  491. }
  492. }
  493. return module_status_.glsl_insts_id;
  494. }
  495. opt::Instruction* opt::GraphicsRobustAccessPass::GetValueForType(
  496. uint64_t value, const analysis::Integer* type) {
  497. auto* mgr = context()->get_constant_mgr();
  498. assert(type->width() <= 64);
  499. std::vector<uint32_t> words;
  500. words.push_back(uint32_t(value));
  501. if (type->width() > 32) {
  502. words.push_back(uint32_t(value >> 32u));
  503. }
  504. const auto* constant = mgr->GetConstant(type, words);
  505. return mgr->GetDefiningInstruction(
  506. constant, context()->get_type_mgr()->GetTypeInstruction(type));
  507. }
  508. opt::Instruction* opt::GraphicsRobustAccessPass::WidenInteger(
  509. bool sign_extend, uint32_t bit_width, Instruction* value,
  510. Instruction* before_inst) {
  511. analysis::Integer unsigned_type_for_query(bit_width, false);
  512. auto* type_mgr = context()->get_type_mgr();
  513. auto* unsigned_type = type_mgr->GetRegisteredType(&unsigned_type_for_query);
  514. auto type_id = context()->get_type_mgr()->GetId(unsigned_type);
  515. auto conversion_id = TakeNextId();
  516. auto* conversion = InsertInst(
  517. before_inst, (sign_extend ? SpvOpSConvert : SpvOpUConvert), type_id,
  518. conversion_id, {{SPV_OPERAND_TYPE_ID, {value->result_id()}}});
  519. return conversion;
  520. }
  521. Instruction* GraphicsRobustAccessPass::MakeClampInst(Instruction* x,
  522. Instruction* min,
  523. Instruction* max,
  524. Instruction* where) {
  525. // Get IDs of instructions we'll be referencing. Evaluate them before calling
  526. // the function so we force a deterministic ordering in case both of them need
  527. // to take a new ID.
  528. const uint32_t glsl_insts_id = GetGlslInsts();
  529. uint32_t clamp_id = TakeNextId();
  530. assert(x->type_id() == min->type_id());
  531. assert(x->type_id() == max->type_id());
  532. auto* clamp_inst = InsertInst(
  533. where, SpvOpExtInst, x->type_id(), clamp_id,
  534. {
  535. {SPV_OPERAND_TYPE_ID, {glsl_insts_id}},
  536. {SPV_OPERAND_TYPE_EXTENSION_INSTRUCTION_NUMBER, {GLSLstd450UClamp}},
  537. {SPV_OPERAND_TYPE_ID, {x->result_id()}},
  538. {SPV_OPERAND_TYPE_ID, {min->result_id()}},
  539. {SPV_OPERAND_TYPE_ID, {max->result_id()}},
  540. });
  541. return clamp_inst;
  542. }
  543. Instruction* GraphicsRobustAccessPass::MakeRuntimeArrayLengthInst(
  544. Instruction* access_chain, uint32_t operand_index) {
  545. // The Index parameter to the access chain at |operand_index| is indexing
  546. // *into* the runtime-array. To get the number of elements in the runtime
  547. // array we need a pointer to the Block-decorated struct that contains the
  548. // runtime array. So conceptually we have to go 2 steps backward in the
  549. // access chain. The two steps backward might forces us to traverse backward
  550. // across multiple dominating instructions.
  551. auto* type_mgr = context()->get_type_mgr();
  552. // How many access chain indices do we have to unwind to find the pointer
  553. // to the struct containing the runtime array?
  554. uint32_t steps_remaining = 2;
  555. // Find or create an instruction computing the pointer to the structure
  556. // containing the runtime array.
  557. // Walk backward through pointer address calculations until we either get
  558. // to exactly the right base pointer, or to an access chain instruction
  559. // that we can replicate but truncate to compute the address of the right
  560. // struct.
  561. Instruction* current_access_chain = access_chain;
  562. Instruction* pointer_to_containing_struct = nullptr;
  563. while (steps_remaining > 0) {
  564. switch (current_access_chain->opcode()) {
  565. case SpvOpCopyObject:
  566. // Whoops. Walk right through this one.
  567. current_access_chain =
  568. GetDef(current_access_chain->GetSingleWordInOperand(0));
  569. break;
  570. case SpvOpAccessChain:
  571. case SpvOpInBoundsAccessChain: {
  572. const int first_index_operand = 3;
  573. // How many indices in this access chain contribute to getting us
  574. // to an element in the runtime array?
  575. const auto num_contributing_indices =
  576. current_access_chain == access_chain
  577. ? operand_index - (first_index_operand - 1)
  578. : current_access_chain->NumInOperands() - 1 /* skip the base */;
  579. Instruction* base =
  580. GetDef(current_access_chain->GetSingleWordInOperand(0));
  581. if (num_contributing_indices == steps_remaining) {
  582. // The base pointer points to the structure.
  583. pointer_to_containing_struct = base;
  584. steps_remaining = 0;
  585. break;
  586. } else if (num_contributing_indices < steps_remaining) {
  587. // Peel off the index and keep going backward.
  588. steps_remaining -= num_contributing_indices;
  589. current_access_chain = base;
  590. } else {
  591. // This access chain has more indices than needed. Generate a new
  592. // access chain instruction, but truncating the list of indices.
  593. const int base_operand = 2;
  594. // We'll use the base pointer and the indices up to but not including
  595. // the one indexing into the runtime array.
  596. Instruction::OperandList ops;
  597. // Use the base pointer
  598. ops.push_back(current_access_chain->GetOperand(base_operand));
  599. const uint32_t num_indices_to_keep =
  600. num_contributing_indices - steps_remaining - 1;
  601. for (uint32_t i = 0; i <= num_indices_to_keep; i++) {
  602. ops.push_back(
  603. current_access_chain->GetOperand(first_index_operand + i));
  604. }
  605. // Compute the type of the result of the new access chain. Start at
  606. // the base and walk the indices in a forward direction.
  607. auto* constant_mgr = context()->get_constant_mgr();
  608. std::vector<uint32_t> indices_for_type;
  609. for (uint32_t i = 0; i < ops.size() - 1; i++) {
  610. uint32_t index_for_type_calculation = 0;
  611. Instruction* index =
  612. GetDef(current_access_chain->GetSingleWordOperand(
  613. first_index_operand + i));
  614. if (auto* index_constant =
  615. constant_mgr->GetConstantFromInst(index)) {
  616. // We only need 32 bits. For the type calculation, it's sufficient
  617. // to take the zero-extended value. It only matters for the struct
  618. // case, and struct member indices are unsigned.
  619. index_for_type_calculation =
  620. uint32_t(index_constant->GetZeroExtendedValue());
  621. } else {
  622. // Indexing into a variably-sized thing like an array. Use 0.
  623. index_for_type_calculation = 0;
  624. }
  625. indices_for_type.push_back(index_for_type_calculation);
  626. }
  627. auto* base_ptr_type = type_mgr->GetType(base->type_id())->AsPointer();
  628. auto* base_pointee_type = base_ptr_type->pointee_type();
  629. auto* new_access_chain_result_pointee_type =
  630. type_mgr->GetMemberType(base_pointee_type, indices_for_type);
  631. const uint32_t new_access_chain_type_id = type_mgr->FindPointerToType(
  632. type_mgr->GetId(new_access_chain_result_pointee_type),
  633. base_ptr_type->storage_class());
  634. // Create the instruction and insert it.
  635. const auto new_access_chain_id = TakeNextId();
  636. auto* new_access_chain =
  637. InsertInst(current_access_chain, current_access_chain->opcode(),
  638. new_access_chain_type_id, new_access_chain_id, ops);
  639. pointer_to_containing_struct = new_access_chain;
  640. steps_remaining = 0;
  641. break;
  642. }
  643. } break;
  644. default:
  645. Fail() << "Unhandled access chain in logical addressing mode passes "
  646. "through "
  647. << current_access_chain->PrettyPrint(
  648. SPV_BINARY_TO_TEXT_OPTION_SHOW_BYTE_OFFSET |
  649. SPV_BINARY_TO_TEXT_OPTION_FRIENDLY_NAMES);
  650. return nullptr;
  651. }
  652. }
  653. assert(pointer_to_containing_struct);
  654. auto* pointee_type =
  655. type_mgr->GetType(pointer_to_containing_struct->type_id())
  656. ->AsPointer()
  657. ->pointee_type();
  658. auto* struct_type = pointee_type->AsStruct();
  659. const uint32_t member_index_of_runtime_array =
  660. uint32_t(struct_type->element_types().size() - 1);
  661. // Create the length-of-array instruction before the original access chain,
  662. // but after the generation of the pointer to the struct.
  663. const auto array_len_id = TakeNextId();
  664. analysis::Integer uint_type_for_query(32, false);
  665. auto* uint_type = type_mgr->GetRegisteredType(&uint_type_for_query);
  666. auto* array_len = InsertInst(
  667. access_chain, SpvOpArrayLength, type_mgr->GetId(uint_type), array_len_id,
  668. {{SPV_OPERAND_TYPE_ID, {pointer_to_containing_struct->result_id()}},
  669. {SPV_OPERAND_TYPE_LITERAL_INTEGER, {member_index_of_runtime_array}}});
  670. return array_len;
  671. }
  672. spv_result_t GraphicsRobustAccessPass::ClampCoordinateForImageTexelPointer(
  673. opt::Instruction* image_texel_pointer) {
  674. // TODO(dneto): Write tests for this code.
  675. return SPV_SUCCESS;
  676. // Example:
  677. // %texel_ptr = OpImageTexelPointer %texel_ptr_type %image_ptr %coord
  678. // %sample
  679. //
  680. // We want to clamp %coord components between vector-0 and the result
  681. // of OpImageQuerySize acting on the underlying image. So insert:
  682. // %image = OpLoad %image_type %image_ptr
  683. // %query_size = OpImageQuerySize %query_size_type %image
  684. //
  685. // For a multi-sampled image, %sample is the sample index, and we need
  686. // to clamp it between zero and the number of samples in the image.
  687. // %sample_count = OpImageQuerySamples %uint %image
  688. // %max_sample_index = OpISub %uint %sample_count %uint_1
  689. // For non-multi-sampled images, the sample index must be constant zero.
  690. auto* def_use_mgr = context()->get_def_use_mgr();
  691. auto* type_mgr = context()->get_type_mgr();
  692. auto* constant_mgr = context()->get_constant_mgr();
  693. auto* image_ptr = GetDef(image_texel_pointer->GetSingleWordInOperand(0));
  694. auto* image_ptr_type = GetDef(image_ptr->type_id());
  695. auto image_type_id = image_ptr_type->GetSingleWordInOperand(1);
  696. auto* image_type = GetDef(image_type_id);
  697. auto* coord = GetDef(image_texel_pointer->GetSingleWordInOperand(1));
  698. auto* samples = GetDef(image_texel_pointer->GetSingleWordInOperand(2));
  699. // We will modify the module, at least by adding image query instructions.
  700. module_status_.modified = true;
  701. // Declare the ImageQuery capability if the module doesn't already have it.
  702. auto* feature_mgr = context()->get_feature_mgr();
  703. if (!feature_mgr->HasCapability(SpvCapabilityImageQuery)) {
  704. auto cap = MakeUnique<Instruction>(
  705. context(), SpvOpCapability, 0, 0,
  706. std::initializer_list<Operand>{
  707. {SPV_OPERAND_TYPE_CAPABILITY, {SpvCapabilityImageQuery}}});
  708. def_use_mgr->AnalyzeInstDefUse(cap.get());
  709. context()->AddCapability(std::move(cap));
  710. feature_mgr->Analyze(context()->module());
  711. }
  712. // OpImageTexelPointer is used to translate a coordinate and sample index
  713. // into an address for use with an atomic operation. That is, it may only
  714. // used with what Vulkan calls a "storage image"
  715. // (OpTypeImage parameter Sampled=2).
  716. // Note: A storage image never has a level-of-detail associated with it.
  717. // Constraints on the sample id:
  718. // - Only 2D images can be multi-sampled: OpTypeImage parameter MS=1
  719. // only if Dim=2D.
  720. // - Non-multi-sampled images (OpTypeImage parameter MS=0) must use
  721. // sample ID to a constant 0.
  722. // The coordinate is treated as unsigned, and should be clamped against the
  723. // image "size", returned by OpImageQuerySize. (Note: OpImageQuerySizeLod
  724. // is only usable with a sampled image, i.e. its image type has Sampled=1).
  725. // Determine the result type for the OpImageQuerySize.
  726. // For non-arrayed images:
  727. // non-Cube:
  728. // - Always the same as the coordinate type
  729. // Cube:
  730. // - Use all but the last component of the coordinate (which is the face
  731. // index from 0 to 5).
  732. // For arrayed images (in Vulkan the Dim is 1D, 2D, or Cube):
  733. // non-Cube:
  734. // - A vector with the components in the coordinate, and one more for
  735. // the layer index.
  736. // Cube:
  737. // - The same as the coordinate type: 3-element integer vector.
  738. // - The third component from the size query is the layer count.
  739. // - The third component in the texel pointer calculation is
  740. // 6 * layer + face, where 0 <= face < 6.
  741. // Cube: Use all but the last component of the coordinate (which is the face
  742. // index from 0 to 5).
  743. const auto dim = SpvDim(image_type->GetSingleWordInOperand(1));
  744. const bool arrayed = image_type->GetSingleWordInOperand(3) == 1;
  745. const bool multisampled = image_type->GetSingleWordInOperand(4) != 0;
  746. const auto query_num_components = [dim, arrayed, this]() -> int {
  747. const int arrayness_bonus = arrayed ? 1 : 0;
  748. int num_coords = 0;
  749. switch (dim) {
  750. case SpvDimBuffer:
  751. case SpvDim1D:
  752. num_coords = 1;
  753. break;
  754. case SpvDimCube:
  755. // For cube, we need bounds for x, y, but not face.
  756. case SpvDimRect:
  757. case SpvDim2D:
  758. num_coords = 2;
  759. break;
  760. case SpvDim3D:
  761. num_coords = 3;
  762. break;
  763. case SpvDimSubpassData:
  764. case SpvDimMax:
  765. return Fail() << "Invalid image dimension for OpImageTexelPointer: "
  766. << int(dim);
  767. break;
  768. }
  769. return num_coords + arrayness_bonus;
  770. }();
  771. const auto* coord_component_type = [type_mgr, coord]() {
  772. const analysis::Type* coord_type = type_mgr->GetType(coord->type_id());
  773. if (auto* vector_type = coord_type->AsVector()) {
  774. return vector_type->element_type()->AsInteger();
  775. }
  776. return coord_type->AsInteger();
  777. }();
  778. // For now, only handle 32-bit case for coordinates.
  779. if (!coord_component_type) {
  780. return Fail() << " Coordinates for OpImageTexelPointer are not integral: "
  781. << image_texel_pointer->PrettyPrint(
  782. SPV_BINARY_TO_TEXT_OPTION_FRIENDLY_NAMES);
  783. }
  784. if (coord_component_type->width() != 32) {
  785. return Fail() << " Expected OpImageTexelPointer coordinate components to "
  786. "be 32-bits wide. They are "
  787. << coord_component_type->width() << " bits. "
  788. << image_texel_pointer->PrettyPrint(
  789. SPV_BINARY_TO_TEXT_OPTION_FRIENDLY_NAMES);
  790. }
  791. const auto* query_size_type =
  792. [type_mgr, coord_component_type,
  793. query_num_components]() -> const analysis::Type* {
  794. if (query_num_components == 1) return coord_component_type;
  795. analysis::Vector proposed(coord_component_type, query_num_components);
  796. return type_mgr->GetRegisteredType(&proposed);
  797. }();
  798. const uint32_t image_id = TakeNextId();
  799. auto* image =
  800. InsertInst(image_texel_pointer, SpvOpLoad, image_type_id, image_id,
  801. {{SPV_OPERAND_TYPE_ID, {image_ptr->result_id()}}});
  802. const uint32_t query_size_id = TakeNextId();
  803. auto* query_size =
  804. InsertInst(image_texel_pointer, SpvOpImageQuerySize,
  805. type_mgr->GetTypeInstruction(query_size_type), query_size_id,
  806. {{SPV_OPERAND_TYPE_ID, {image->result_id()}}});
  807. auto* component_1 = constant_mgr->GetConstant(coord_component_type, {1});
  808. const uint32_t component_1_id =
  809. constant_mgr->GetDefiningInstruction(component_1)->result_id();
  810. auto* component_0 = constant_mgr->GetConstant(coord_component_type, {0});
  811. const uint32_t component_0_id =
  812. constant_mgr->GetDefiningInstruction(component_0)->result_id();
  813. // If the image is a cube array, then the last component of the queried
  814. // size is the layer count. In the query, we have to accomodate folding
  815. // in the face index ranging from 0 through 5. The inclusive upper bound
  816. // on the third coordinate therefore is multiplied by 6.
  817. auto* query_size_including_faces = query_size;
  818. if (arrayed && (dim == SpvDimCube)) {
  819. // Multiply the last coordinate by 6.
  820. auto* component_6 = constant_mgr->GetConstant(coord_component_type, {6});
  821. const uint32_t component_6_id =
  822. constant_mgr->GetDefiningInstruction(component_6)->result_id();
  823. assert(query_num_components == 3);
  824. auto* multiplicand = constant_mgr->GetConstant(
  825. query_size_type, {component_1_id, component_1_id, component_6_id});
  826. auto* multiplicand_inst =
  827. constant_mgr->GetDefiningInstruction(multiplicand);
  828. const auto query_size_including_faces_id = TakeNextId();
  829. query_size_including_faces = InsertInst(
  830. image_texel_pointer, SpvOpIMul,
  831. type_mgr->GetTypeInstruction(query_size_type),
  832. query_size_including_faces_id,
  833. {{SPV_OPERAND_TYPE_ID, {query_size_including_faces->result_id()}},
  834. {SPV_OPERAND_TYPE_ID, {multiplicand_inst->result_id()}}});
  835. }
  836. // Make a coordinate-type with all 1 components.
  837. auto* coordinate_1 =
  838. query_num_components == 1
  839. ? component_1
  840. : constant_mgr->GetConstant(
  841. query_size_type,
  842. std::vector<uint32_t>(query_num_components, component_1_id));
  843. // Make a coordinate-type with all 1 components.
  844. auto* coordinate_0 =
  845. query_num_components == 0
  846. ? component_0
  847. : constant_mgr->GetConstant(
  848. query_size_type,
  849. std::vector<uint32_t>(query_num_components, component_0_id));
  850. const uint32_t query_max_including_faces_id = TakeNextId();
  851. auto* query_max_including_faces = InsertInst(
  852. image_texel_pointer, SpvOpISub,
  853. type_mgr->GetTypeInstruction(query_size_type),
  854. query_max_including_faces_id,
  855. {{SPV_OPERAND_TYPE_ID, {query_size_including_faces->result_id()}},
  856. {SPV_OPERAND_TYPE_ID,
  857. {constant_mgr->GetDefiningInstruction(coordinate_1)->result_id()}}});
  858. // Clamp the coordinate
  859. auto* clamp_coord =
  860. MakeClampInst(coord, constant_mgr->GetDefiningInstruction(coordinate_0),
  861. query_max_including_faces, image_texel_pointer);
  862. image_texel_pointer->SetInOperand(1, {clamp_coord->result_id()});
  863. // Clamp the sample index
  864. if (multisampled) {
  865. // Get the sample count via OpImageQuerySamples
  866. const auto query_samples_id = TakeNextId();
  867. auto* query_samples = InsertInst(
  868. image_texel_pointer, SpvOpImageQuerySamples,
  869. constant_mgr->GetDefiningInstruction(component_0)->type_id(),
  870. query_samples_id, {{SPV_OPERAND_TYPE_ID, {image->result_id()}}});
  871. const auto max_samples_id = TakeNextId();
  872. auto* max_samples = InsertInst(image_texel_pointer, SpvOpImageQuerySamples,
  873. query_samples->type_id(), max_samples_id,
  874. {{SPV_OPERAND_TYPE_ID, {query_samples_id}},
  875. {SPV_OPERAND_TYPE_ID, {component_1_id}}});
  876. auto* clamp_samples = MakeClampInst(
  877. samples, constant_mgr->GetDefiningInstruction(coordinate_0),
  878. max_samples, image_texel_pointer);
  879. image_texel_pointer->SetInOperand(2, {clamp_samples->result_id()});
  880. } else {
  881. // Just replace it with 0. Don't even check what was there before.
  882. image_texel_pointer->SetInOperand(2, {component_0_id});
  883. }
  884. def_use_mgr->AnalyzeInstUse(image_texel_pointer);
  885. return SPV_SUCCESS;
  886. }
  887. opt::Instruction* GraphicsRobustAccessPass::InsertInst(
  888. opt::Instruction* where_inst, SpvOp opcode, uint32_t type_id,
  889. uint32_t result_id, const Instruction::OperandList& operands) {
  890. module_status_.modified = true;
  891. auto* result = where_inst->InsertBefore(
  892. MakeUnique<Instruction>(context(), opcode, type_id, result_id, operands));
  893. context()->get_def_use_mgr()->AnalyzeInstDefUse(result);
  894. auto* basic_block = context()->get_instr_block(where_inst);
  895. context()->set_instr_block(result, basic_block);
  896. return result;
  897. }
  898. } // namespace opt
  899. } // namespace spvtools