optimizer.cpp 31 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829
  1. // Copyright (c) 2016 Google Inc.
  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. #include "spirv-tools/optimizer.hpp"
  15. #include <memory>
  16. #include <string>
  17. #include <unordered_map>
  18. #include <utility>
  19. #include <vector>
  20. #include <source/spirv_optimizer_options.h>
  21. #include "code_sink.h"
  22. #include "source/opt/build_module.h"
  23. #include "source/opt/log.h"
  24. #include "source/opt/pass_manager.h"
  25. #include "source/opt/passes.h"
  26. #include "source/util/make_unique.h"
  27. #include "source/util/string_utils.h"
  28. namespace spvtools {
  29. struct Optimizer::PassToken::Impl {
  30. Impl(std::unique_ptr<opt::Pass> p) : pass(std::move(p)) {}
  31. std::unique_ptr<opt::Pass> pass; // Internal implementation pass.
  32. };
  33. Optimizer::PassToken::PassToken(
  34. std::unique_ptr<Optimizer::PassToken::Impl> impl)
  35. : impl_(std::move(impl)) {}
  36. Optimizer::PassToken::PassToken(std::unique_ptr<opt::Pass>&& pass)
  37. : impl_(MakeUnique<Optimizer::PassToken::Impl>(std::move(pass))) {}
  38. Optimizer::PassToken::PassToken(PassToken&& that)
  39. : impl_(std::move(that.impl_)) {}
  40. Optimizer::PassToken& Optimizer::PassToken::operator=(PassToken&& that) {
  41. impl_ = std::move(that.impl_);
  42. return *this;
  43. }
  44. Optimizer::PassToken::~PassToken() {}
  45. struct Optimizer::Impl {
  46. explicit Impl(spv_target_env env) : target_env(env), pass_manager() {}
  47. spv_target_env target_env; // Target environment.
  48. opt::PassManager pass_manager; // Internal implementation pass manager.
  49. };
  50. Optimizer::Optimizer(spv_target_env env) : impl_(new Impl(env)) {}
  51. Optimizer::~Optimizer() {}
  52. void Optimizer::SetMessageConsumer(MessageConsumer c) {
  53. // All passes' message consumer needs to be updated.
  54. for (uint32_t i = 0; i < impl_->pass_manager.NumPasses(); ++i) {
  55. impl_->pass_manager.GetPass(i)->SetMessageConsumer(c);
  56. }
  57. impl_->pass_manager.SetMessageConsumer(std::move(c));
  58. }
  59. const MessageConsumer& Optimizer::consumer() const {
  60. return impl_->pass_manager.consumer();
  61. }
  62. Optimizer& Optimizer::RegisterPass(PassToken&& p) {
  63. // Change to use the pass manager's consumer.
  64. p.impl_->pass->SetMessageConsumer(consumer());
  65. impl_->pass_manager.AddPass(std::move(p.impl_->pass));
  66. return *this;
  67. }
  68. // The legalization passes take a spir-v shader generated by an HLSL front-end
  69. // and turn it into a valid vulkan spir-v shader. There are two ways in which
  70. // the code will be invalid at the start:
  71. //
  72. // 1) There will be opaque objects, like images, which will be passed around
  73. // in intermediate objects. Valid spir-v will have to replace the use of
  74. // the opaque object with an intermediate object that is the result of the
  75. // load of the global opaque object.
  76. //
  77. // 2) There will be variables that contain pointers to structured or uniform
  78. // buffers. It be legal, the variables must be eliminated, and the
  79. // references to the structured buffers must use the result of OpVariable
  80. // in the Uniform storage class.
  81. //
  82. // Optimization in this list must accept shaders with these relaxation of the
  83. // rules. There is not guarantee that this list of optimizations is able to
  84. // legalize all inputs, but it is on a best effort basis.
  85. //
  86. // The legalization problem is essentially a very general copy propagation
  87. // problem. The optimization we use are all used to either do copy propagation
  88. // or enable more copy propagation.
  89. Optimizer& Optimizer::RegisterLegalizationPasses() {
  90. return
  91. // Remove unreachable block so that merge return works.
  92. RegisterPass(CreateDeadBranchElimPass())
  93. // Merge the returns so we can inline.
  94. .RegisterPass(CreateMergeReturnPass())
  95. // Make sure uses and definitions are in the same function.
  96. .RegisterPass(CreateInlineExhaustivePass())
  97. // Make private variable function scope
  98. .RegisterPass(CreateEliminateDeadFunctionsPass())
  99. .RegisterPass(CreatePrivateToLocalPass())
  100. // Propagate the value stored to the loads in very simple cases.
  101. .RegisterPass(CreateLocalSingleBlockLoadStoreElimPass())
  102. .RegisterPass(CreateLocalSingleStoreElimPass())
  103. .RegisterPass(CreateAggressiveDCEPass())
  104. // Split up aggregates so they are easier to deal with.
  105. .RegisterPass(CreateScalarReplacementPass(0))
  106. // Remove loads and stores so everything is in intermediate values.
  107. // Takes care of copy propagation of non-members.
  108. .RegisterPass(CreateLocalSingleBlockLoadStoreElimPass())
  109. .RegisterPass(CreateLocalSingleStoreElimPass())
  110. .RegisterPass(CreateAggressiveDCEPass())
  111. .RegisterPass(CreateLocalMultiStoreElimPass())
  112. .RegisterPass(CreateAggressiveDCEPass())
  113. // Propagate constants to get as many constant conditions on branches
  114. // as possible.
  115. .RegisterPass(CreateCCPPass())
  116. .RegisterPass(CreateLoopUnrollPass(true))
  117. .RegisterPass(CreateDeadBranchElimPass())
  118. // Copy propagate members. Cleans up code sequences generated by
  119. // scalar replacement. Also important for removing OpPhi nodes.
  120. .RegisterPass(CreateSimplificationPass())
  121. .RegisterPass(CreateAggressiveDCEPass())
  122. .RegisterPass(CreateCopyPropagateArraysPass())
  123. // May need loop unrolling here see
  124. // https://github.com/Microsoft/DirectXShaderCompiler/pull/930
  125. // Get rid of unused code that contain traces of illegal code
  126. // or unused references to unbound external objects
  127. .RegisterPass(CreateVectorDCEPass())
  128. .RegisterPass(CreateDeadInsertElimPass())
  129. .RegisterPass(CreateReduceLoadSizePass())
  130. .RegisterPass(CreateAggressiveDCEPass());
  131. }
  132. Optimizer& Optimizer::RegisterPerformancePasses() {
  133. return RegisterPass(CreateDeadBranchElimPass())
  134. .RegisterPass(CreateMergeReturnPass())
  135. .RegisterPass(CreateInlineExhaustivePass())
  136. .RegisterPass(CreateAggressiveDCEPass())
  137. .RegisterPass(CreatePrivateToLocalPass())
  138. .RegisterPass(CreateLocalSingleBlockLoadStoreElimPass())
  139. .RegisterPass(CreateLocalSingleStoreElimPass())
  140. .RegisterPass(CreateAggressiveDCEPass())
  141. .RegisterPass(CreateScalarReplacementPass())
  142. .RegisterPass(CreateLocalAccessChainConvertPass())
  143. .RegisterPass(CreateLocalSingleBlockLoadStoreElimPass())
  144. .RegisterPass(CreateLocalSingleStoreElimPass())
  145. .RegisterPass(CreateAggressiveDCEPass())
  146. .RegisterPass(CreateLocalMultiStoreElimPass())
  147. .RegisterPass(CreateAggressiveDCEPass())
  148. .RegisterPass(CreateCCPPass())
  149. .RegisterPass(CreateAggressiveDCEPass())
  150. .RegisterPass(CreateRedundancyEliminationPass())
  151. .RegisterPass(CreateCombineAccessChainsPass())
  152. .RegisterPass(CreateSimplificationPass())
  153. .RegisterPass(CreateVectorDCEPass())
  154. .RegisterPass(CreateDeadInsertElimPass())
  155. .RegisterPass(CreateDeadBranchElimPass())
  156. .RegisterPass(CreateSimplificationPass())
  157. .RegisterPass(CreateIfConversionPass())
  158. .RegisterPass(CreateCopyPropagateArraysPass())
  159. .RegisterPass(CreateReduceLoadSizePass())
  160. .RegisterPass(CreateAggressiveDCEPass())
  161. .RegisterPass(CreateBlockMergePass())
  162. .RegisterPass(CreateRedundancyEliminationPass())
  163. .RegisterPass(CreateDeadBranchElimPass())
  164. .RegisterPass(CreateBlockMergePass())
  165. .RegisterPass(CreateSimplificationPass());
  166. // Currently exposing driver bugs resulting in crashes (#946)
  167. // .RegisterPass(CreateCommonUniformElimPass())
  168. }
  169. Optimizer& Optimizer::RegisterSizePasses() {
  170. return RegisterPass(CreateDeadBranchElimPass())
  171. .RegisterPass(CreateMergeReturnPass())
  172. .RegisterPass(CreateInlineExhaustivePass())
  173. .RegisterPass(CreateAggressiveDCEPass())
  174. .RegisterPass(CreatePrivateToLocalPass())
  175. .RegisterPass(CreateScalarReplacementPass())
  176. .RegisterPass(CreateLocalAccessChainConvertPass())
  177. .RegisterPass(CreateLocalSingleBlockLoadStoreElimPass())
  178. .RegisterPass(CreateLocalSingleStoreElimPass())
  179. .RegisterPass(CreateAggressiveDCEPass())
  180. .RegisterPass(CreateSimplificationPass())
  181. .RegisterPass(CreateDeadInsertElimPass())
  182. .RegisterPass(CreateLocalMultiStoreElimPass())
  183. .RegisterPass(CreateAggressiveDCEPass())
  184. .RegisterPass(CreateCCPPass())
  185. .RegisterPass(CreateAggressiveDCEPass())
  186. .RegisterPass(CreateDeadBranchElimPass())
  187. .RegisterPass(CreateIfConversionPass())
  188. .RegisterPass(CreateAggressiveDCEPass())
  189. .RegisterPass(CreateBlockMergePass())
  190. .RegisterPass(CreateSimplificationPass())
  191. .RegisterPass(CreateDeadInsertElimPass())
  192. .RegisterPass(CreateRedundancyEliminationPass())
  193. .RegisterPass(CreateCFGCleanupPass())
  194. // Currently exposing driver bugs resulting in crashes (#946)
  195. // .RegisterPass(CreateCommonUniformElimPass())
  196. .RegisterPass(CreateAggressiveDCEPass());
  197. }
  198. Optimizer& Optimizer::RegisterWebGPUPasses() {
  199. return RegisterPass(CreateStripDebugInfoPass())
  200. .RegisterPass(CreateStripAtomicCounterMemoryPass())
  201. .RegisterPass(CreateEliminateDeadConstantPass())
  202. .RegisterPass(CreateFlattenDecorationPass())
  203. .RegisterPass(CreateAggressiveDCEPass())
  204. .RegisterPass(CreateDeadBranchElimPass());
  205. }
  206. bool Optimizer::RegisterPassesFromFlags(const std::vector<std::string>& flags) {
  207. for (const auto& flag : flags) {
  208. if (!RegisterPassFromFlag(flag)) {
  209. return false;
  210. }
  211. }
  212. return true;
  213. }
  214. bool Optimizer::FlagHasValidForm(const std::string& flag) const {
  215. if (flag == "-O" || flag == "-Os") {
  216. return true;
  217. } else if (flag.size() > 2 && flag.substr(0, 2) == "--") {
  218. return true;
  219. }
  220. Errorf(consumer(), nullptr, {},
  221. "%s is not a valid flag. Flag passes should have the form "
  222. "'--pass_name[=pass_args]'. Special flag names also accepted: -O "
  223. "and -Os.",
  224. flag.c_str());
  225. return false;
  226. }
  227. bool Optimizer::RegisterPassFromFlag(const std::string& flag) {
  228. if (!FlagHasValidForm(flag)) {
  229. return false;
  230. }
  231. // Split flags of the form --pass_name=pass_args.
  232. auto p = utils::SplitFlagArgs(flag);
  233. std::string pass_name = p.first;
  234. std::string pass_args = p.second;
  235. // FIXME(dnovillo): This should be re-factored so that pass names can be
  236. // automatically checked against Pass::name() and PassToken instances created
  237. // via a template function. Additionally, class Pass should have a desc()
  238. // method that describes the pass (so it can be used in --help).
  239. //
  240. // Both Pass::name() and Pass::desc() should be static class members so they
  241. // can be invoked without creating a pass instance.
  242. if (pass_name == "strip-atomic-counter-memory") {
  243. RegisterPass(CreateStripAtomicCounterMemoryPass());
  244. } else if (pass_name == "strip-debug") {
  245. RegisterPass(CreateStripDebugInfoPass());
  246. } else if (pass_name == "strip-reflect") {
  247. RegisterPass(CreateStripReflectInfoPass());
  248. } else if (pass_name == "set-spec-const-default-value") {
  249. if (pass_args.size() > 0) {
  250. auto spec_ids_vals =
  251. opt::SetSpecConstantDefaultValuePass::ParseDefaultValuesString(
  252. pass_args.c_str());
  253. if (!spec_ids_vals) {
  254. Errorf(consumer(), nullptr, {},
  255. "Invalid argument for --set-spec-const-default-value: %s",
  256. pass_args.c_str());
  257. return false;
  258. }
  259. RegisterPass(
  260. CreateSetSpecConstantDefaultValuePass(std::move(*spec_ids_vals)));
  261. } else {
  262. Errorf(consumer(), nullptr, {},
  263. "Invalid spec constant value string '%s'. Expected a string of "
  264. "<spec id>:<default value> pairs.",
  265. pass_args.c_str());
  266. return false;
  267. }
  268. } else if (pass_name == "if-conversion") {
  269. RegisterPass(CreateIfConversionPass());
  270. } else if (pass_name == "freeze-spec-const") {
  271. RegisterPass(CreateFreezeSpecConstantValuePass());
  272. } else if (pass_name == "inline-entry-points-exhaustive") {
  273. RegisterPass(CreateInlineExhaustivePass());
  274. } else if (pass_name == "inline-entry-points-opaque") {
  275. RegisterPass(CreateInlineOpaquePass());
  276. } else if (pass_name == "combine-access-chains") {
  277. RegisterPass(CreateCombineAccessChainsPass());
  278. } else if (pass_name == "convert-local-access-chains") {
  279. RegisterPass(CreateLocalAccessChainConvertPass());
  280. } else if (pass_name == "eliminate-dead-code-aggressive") {
  281. RegisterPass(CreateAggressiveDCEPass());
  282. } else if (pass_name == "propagate-line-info") {
  283. RegisterPass(CreatePropagateLineInfoPass());
  284. } else if (pass_name == "eliminate-redundant-line-info") {
  285. RegisterPass(CreateRedundantLineInfoElimPass());
  286. } else if (pass_name == "eliminate-insert-extract") {
  287. RegisterPass(CreateInsertExtractElimPass());
  288. } else if (pass_name == "eliminate-local-single-block") {
  289. RegisterPass(CreateLocalSingleBlockLoadStoreElimPass());
  290. } else if (pass_name == "eliminate-local-single-store") {
  291. RegisterPass(CreateLocalSingleStoreElimPass());
  292. } else if (pass_name == "merge-blocks") {
  293. RegisterPass(CreateBlockMergePass());
  294. } else if (pass_name == "merge-return") {
  295. RegisterPass(CreateMergeReturnPass());
  296. } else if (pass_name == "eliminate-dead-branches") {
  297. RegisterPass(CreateDeadBranchElimPass());
  298. } else if (pass_name == "eliminate-dead-functions") {
  299. RegisterPass(CreateEliminateDeadFunctionsPass());
  300. } else if (pass_name == "eliminate-local-multi-store") {
  301. RegisterPass(CreateLocalMultiStoreElimPass());
  302. } else if (pass_name == "eliminate-common-uniform") {
  303. RegisterPass(CreateCommonUniformElimPass());
  304. } else if (pass_name == "eliminate-dead-const") {
  305. RegisterPass(CreateEliminateDeadConstantPass());
  306. } else if (pass_name == "eliminate-dead-inserts") {
  307. RegisterPass(CreateDeadInsertElimPass());
  308. } else if (pass_name == "eliminate-dead-variables") {
  309. RegisterPass(CreateDeadVariableEliminationPass());
  310. } else if (pass_name == "eliminate-dead-members") {
  311. RegisterPass(CreateEliminateDeadMembersPass());
  312. } else if (pass_name == "fold-spec-const-op-composite") {
  313. RegisterPass(CreateFoldSpecConstantOpAndCompositePass());
  314. } else if (pass_name == "loop-unswitch") {
  315. RegisterPass(CreateLoopUnswitchPass());
  316. } else if (pass_name == "scalar-replacement") {
  317. if (pass_args.size() == 0) {
  318. RegisterPass(CreateScalarReplacementPass());
  319. } else {
  320. int limit = -1;
  321. if (pass_args.find_first_not_of("0123456789") == std::string::npos) {
  322. limit = atoi(pass_args.c_str());
  323. }
  324. if (limit >= 0) {
  325. RegisterPass(CreateScalarReplacementPass(limit));
  326. } else {
  327. Error(consumer(), nullptr, {},
  328. "--scalar-replacement must have no arguments or a non-negative "
  329. "integer argument");
  330. return false;
  331. }
  332. }
  333. } else if (pass_name == "strength-reduction") {
  334. RegisterPass(CreateStrengthReductionPass());
  335. } else if (pass_name == "unify-const") {
  336. RegisterPass(CreateUnifyConstantPass());
  337. } else if (pass_name == "flatten-decorations") {
  338. RegisterPass(CreateFlattenDecorationPass());
  339. } else if (pass_name == "compact-ids") {
  340. RegisterPass(CreateCompactIdsPass());
  341. } else if (pass_name == "cfg-cleanup") {
  342. RegisterPass(CreateCFGCleanupPass());
  343. } else if (pass_name == "local-redundancy-elimination") {
  344. RegisterPass(CreateLocalRedundancyEliminationPass());
  345. } else if (pass_name == "loop-invariant-code-motion") {
  346. RegisterPass(CreateLoopInvariantCodeMotionPass());
  347. } else if (pass_name == "reduce-load-size") {
  348. RegisterPass(CreateReduceLoadSizePass());
  349. } else if (pass_name == "redundancy-elimination") {
  350. RegisterPass(CreateRedundancyEliminationPass());
  351. } else if (pass_name == "private-to-local") {
  352. RegisterPass(CreatePrivateToLocalPass());
  353. } else if (pass_name == "remove-duplicates") {
  354. RegisterPass(CreateRemoveDuplicatesPass());
  355. } else if (pass_name == "workaround-1209") {
  356. RegisterPass(CreateWorkaround1209Pass());
  357. } else if (pass_name == "replace-invalid-opcode") {
  358. RegisterPass(CreateReplaceInvalidOpcodePass());
  359. } else if (pass_name == "inst-bindless-check") {
  360. RegisterPass(CreateInstBindlessCheckPass(7, 23, true, true));
  361. RegisterPass(CreateSimplificationPass());
  362. RegisterPass(CreateDeadBranchElimPass());
  363. RegisterPass(CreateBlockMergePass());
  364. RegisterPass(CreateAggressiveDCEPass());
  365. } else if (pass_name == "simplify-instructions") {
  366. RegisterPass(CreateSimplificationPass());
  367. } else if (pass_name == "ssa-rewrite") {
  368. RegisterPass(CreateSSARewritePass());
  369. } else if (pass_name == "copy-propagate-arrays") {
  370. RegisterPass(CreateCopyPropagateArraysPass());
  371. } else if (pass_name == "loop-fission") {
  372. int register_threshold_to_split =
  373. (pass_args.size() > 0) ? atoi(pass_args.c_str()) : -1;
  374. if (register_threshold_to_split > 0) {
  375. RegisterPass(CreateLoopFissionPass(
  376. static_cast<size_t>(register_threshold_to_split)));
  377. } else {
  378. Error(consumer(), nullptr, {},
  379. "--loop-fission must have a positive integer argument");
  380. return false;
  381. }
  382. } else if (pass_name == "loop-fusion") {
  383. int max_registers_per_loop =
  384. (pass_args.size() > 0) ? atoi(pass_args.c_str()) : -1;
  385. if (max_registers_per_loop > 0) {
  386. RegisterPass(
  387. CreateLoopFusionPass(static_cast<size_t>(max_registers_per_loop)));
  388. } else {
  389. Error(consumer(), nullptr, {},
  390. "--loop-fusion must have a positive integer argument");
  391. return false;
  392. }
  393. } else if (pass_name == "loop-unroll") {
  394. RegisterPass(CreateLoopUnrollPass(true));
  395. } else if (pass_name == "upgrade-memory-model") {
  396. RegisterPass(CreateUpgradeMemoryModelPass());
  397. } else if (pass_name == "vector-dce") {
  398. RegisterPass(CreateVectorDCEPass());
  399. } else if (pass_name == "loop-unroll-partial") {
  400. int factor = (pass_args.size() > 0) ? atoi(pass_args.c_str()) : 0;
  401. if (factor > 0) {
  402. RegisterPass(CreateLoopUnrollPass(false, factor));
  403. } else {
  404. Error(consumer(), nullptr, {},
  405. "--loop-unroll-partial must have a positive integer argument");
  406. return false;
  407. }
  408. } else if (pass_name == "loop-peeling") {
  409. RegisterPass(CreateLoopPeelingPass());
  410. } else if (pass_name == "loop-peeling-threshold") {
  411. int factor = (pass_args.size() > 0) ? atoi(pass_args.c_str()) : 0;
  412. if (factor > 0) {
  413. opt::LoopPeelingPass::SetLoopPeelingThreshold(factor);
  414. } else {
  415. Error(consumer(), nullptr, {},
  416. "--loop-peeling-threshold must have a positive integer argument");
  417. return false;
  418. }
  419. } else if (pass_name == "ccp") {
  420. RegisterPass(CreateCCPPass());
  421. } else if (pass_name == "code-sink") {
  422. RegisterPass(CreateCodeSinkingPass());
  423. } else if (pass_name == "O") {
  424. RegisterPerformancePasses();
  425. } else if (pass_name == "Os") {
  426. RegisterSizePasses();
  427. } else if (pass_name == "legalize-hlsl") {
  428. RegisterLegalizationPasses();
  429. } else {
  430. Errorf(consumer(), nullptr, {},
  431. "Unknown flag '--%s'. Use --help for a list of valid flags",
  432. pass_name.c_str());
  433. return false;
  434. }
  435. return true;
  436. }
  437. void Optimizer::SetTargetEnv(const spv_target_env env) {
  438. impl_->target_env = env;
  439. }
  440. bool Optimizer::Run(const uint32_t* original_binary,
  441. const size_t original_binary_size,
  442. std::vector<uint32_t>* optimized_binary) const {
  443. return Run(original_binary, original_binary_size, optimized_binary,
  444. OptimizerOptions());
  445. }
  446. bool Optimizer::Run(const uint32_t* original_binary,
  447. const size_t original_binary_size,
  448. std::vector<uint32_t>* optimized_binary,
  449. const ValidatorOptions& validator_options,
  450. bool skip_validation) const {
  451. OptimizerOptions opt_options;
  452. opt_options.set_run_validator(!skip_validation);
  453. opt_options.set_validator_options(validator_options);
  454. return Run(original_binary, original_binary_size, optimized_binary,
  455. opt_options);
  456. }
  457. bool Optimizer::Run(const uint32_t* original_binary,
  458. const size_t original_binary_size,
  459. std::vector<uint32_t>* optimized_binary,
  460. const spv_optimizer_options opt_options) const {
  461. spvtools::SpirvTools tools(impl_->target_env);
  462. tools.SetMessageConsumer(impl_->pass_manager.consumer());
  463. if (opt_options->run_validator_ &&
  464. !tools.Validate(original_binary, original_binary_size,
  465. &opt_options->val_options_)) {
  466. return false;
  467. }
  468. std::unique_ptr<opt::IRContext> context = BuildModule(
  469. impl_->target_env, consumer(), original_binary, original_binary_size);
  470. if (context == nullptr) return false;
  471. context->set_max_id_bound(opt_options->max_id_bound_);
  472. impl_->pass_manager.SetValidatorOptions(&opt_options->val_options_);
  473. impl_->pass_manager.SetTargetEnv(impl_->target_env);
  474. auto status = impl_->pass_manager.Run(context.get());
  475. if (status == opt::Pass::Status::SuccessWithChange ||
  476. (status == opt::Pass::Status::SuccessWithoutChange &&
  477. (optimized_binary->data() != original_binary ||
  478. optimized_binary->size() != original_binary_size))) {
  479. optimized_binary->clear();
  480. context->module()->ToBinary(optimized_binary, /* skip_nop = */ true);
  481. }
  482. return status != opt::Pass::Status::Failure;
  483. }
  484. Optimizer& Optimizer::SetPrintAll(std::ostream* out) {
  485. impl_->pass_manager.SetPrintAll(out);
  486. return *this;
  487. }
  488. Optimizer& Optimizer::SetTimeReport(std::ostream* out) {
  489. impl_->pass_manager.SetTimeReport(out);
  490. return *this;
  491. }
  492. Optimizer& Optimizer::SetValidateAfterAll(bool validate) {
  493. impl_->pass_manager.SetValidateAfterAll(validate);
  494. return *this;
  495. }
  496. Optimizer::PassToken CreateNullPass() {
  497. return MakeUnique<Optimizer::PassToken::Impl>(MakeUnique<opt::NullPass>());
  498. }
  499. Optimizer::PassToken CreateStripAtomicCounterMemoryPass() {
  500. return MakeUnique<Optimizer::PassToken::Impl>(
  501. MakeUnique<opt::StripAtomicCounterMemoryPass>());
  502. }
  503. Optimizer::PassToken CreateStripDebugInfoPass() {
  504. return MakeUnique<Optimizer::PassToken::Impl>(
  505. MakeUnique<opt::StripDebugInfoPass>());
  506. }
  507. Optimizer::PassToken CreateStripReflectInfoPass() {
  508. return MakeUnique<Optimizer::PassToken::Impl>(
  509. MakeUnique<opt::StripReflectInfoPass>());
  510. }
  511. Optimizer::PassToken CreateEliminateDeadFunctionsPass() {
  512. return MakeUnique<Optimizer::PassToken::Impl>(
  513. MakeUnique<opt::EliminateDeadFunctionsPass>());
  514. }
  515. Optimizer::PassToken CreateEliminateDeadMembersPass() {
  516. return MakeUnique<Optimizer::PassToken::Impl>(
  517. MakeUnique<opt::EliminateDeadMembersPass>());
  518. }
  519. Optimizer::PassToken CreateSetSpecConstantDefaultValuePass(
  520. const std::unordered_map<uint32_t, std::string>& id_value_map) {
  521. return MakeUnique<Optimizer::PassToken::Impl>(
  522. MakeUnique<opt::SetSpecConstantDefaultValuePass>(id_value_map));
  523. }
  524. Optimizer::PassToken CreateSetSpecConstantDefaultValuePass(
  525. const std::unordered_map<uint32_t, std::vector<uint32_t>>& id_value_map) {
  526. return MakeUnique<Optimizer::PassToken::Impl>(
  527. MakeUnique<opt::SetSpecConstantDefaultValuePass>(id_value_map));
  528. }
  529. Optimizer::PassToken CreateFlattenDecorationPass() {
  530. return MakeUnique<Optimizer::PassToken::Impl>(
  531. MakeUnique<opt::FlattenDecorationPass>());
  532. }
  533. Optimizer::PassToken CreateFreezeSpecConstantValuePass() {
  534. return MakeUnique<Optimizer::PassToken::Impl>(
  535. MakeUnique<opt::FreezeSpecConstantValuePass>());
  536. }
  537. Optimizer::PassToken CreateFoldSpecConstantOpAndCompositePass() {
  538. return MakeUnique<Optimizer::PassToken::Impl>(
  539. MakeUnique<opt::FoldSpecConstantOpAndCompositePass>());
  540. }
  541. Optimizer::PassToken CreateUnifyConstantPass() {
  542. return MakeUnique<Optimizer::PassToken::Impl>(
  543. MakeUnique<opt::UnifyConstantPass>());
  544. }
  545. Optimizer::PassToken CreateEliminateDeadConstantPass() {
  546. return MakeUnique<Optimizer::PassToken::Impl>(
  547. MakeUnique<opt::EliminateDeadConstantPass>());
  548. }
  549. Optimizer::PassToken CreateDeadVariableEliminationPass() {
  550. return MakeUnique<Optimizer::PassToken::Impl>(
  551. MakeUnique<opt::DeadVariableElimination>());
  552. }
  553. Optimizer::PassToken CreateStrengthReductionPass() {
  554. return MakeUnique<Optimizer::PassToken::Impl>(
  555. MakeUnique<opt::StrengthReductionPass>());
  556. }
  557. Optimizer::PassToken CreateBlockMergePass() {
  558. return MakeUnique<Optimizer::PassToken::Impl>(
  559. MakeUnique<opt::BlockMergePass>());
  560. }
  561. Optimizer::PassToken CreateInlineExhaustivePass() {
  562. return MakeUnique<Optimizer::PassToken::Impl>(
  563. MakeUnique<opt::InlineExhaustivePass>());
  564. }
  565. Optimizer::PassToken CreateInlineOpaquePass() {
  566. return MakeUnique<Optimizer::PassToken::Impl>(
  567. MakeUnique<opt::InlineOpaquePass>());
  568. }
  569. Optimizer::PassToken CreateLocalAccessChainConvertPass() {
  570. return MakeUnique<Optimizer::PassToken::Impl>(
  571. MakeUnique<opt::LocalAccessChainConvertPass>());
  572. }
  573. Optimizer::PassToken CreateLocalSingleBlockLoadStoreElimPass() {
  574. return MakeUnique<Optimizer::PassToken::Impl>(
  575. MakeUnique<opt::LocalSingleBlockLoadStoreElimPass>());
  576. }
  577. Optimizer::PassToken CreateLocalSingleStoreElimPass() {
  578. return MakeUnique<Optimizer::PassToken::Impl>(
  579. MakeUnique<opt::LocalSingleStoreElimPass>());
  580. }
  581. Optimizer::PassToken CreateInsertExtractElimPass() {
  582. return MakeUnique<Optimizer::PassToken::Impl>(
  583. MakeUnique<opt::SimplificationPass>());
  584. }
  585. Optimizer::PassToken CreateDeadInsertElimPass() {
  586. return MakeUnique<Optimizer::PassToken::Impl>(
  587. MakeUnique<opt::DeadInsertElimPass>());
  588. }
  589. Optimizer::PassToken CreateDeadBranchElimPass() {
  590. return MakeUnique<Optimizer::PassToken::Impl>(
  591. MakeUnique<opt::DeadBranchElimPass>());
  592. }
  593. Optimizer::PassToken CreateLocalMultiStoreElimPass() {
  594. return MakeUnique<Optimizer::PassToken::Impl>(
  595. MakeUnique<opt::LocalMultiStoreElimPass>());
  596. }
  597. Optimizer::PassToken CreateAggressiveDCEPass() {
  598. return MakeUnique<Optimizer::PassToken::Impl>(
  599. MakeUnique<opt::AggressiveDCEPass>());
  600. }
  601. Optimizer::PassToken CreatePropagateLineInfoPass() {
  602. return MakeUnique<Optimizer::PassToken::Impl>(
  603. MakeUnique<opt::ProcessLinesPass>(opt::kLinesPropagateLines));
  604. }
  605. Optimizer::PassToken CreateRedundantLineInfoElimPass() {
  606. return MakeUnique<Optimizer::PassToken::Impl>(
  607. MakeUnique<opt::ProcessLinesPass>(opt::kLinesEliminateDeadLines));
  608. }
  609. Optimizer::PassToken CreateCommonUniformElimPass() {
  610. return MakeUnique<Optimizer::PassToken::Impl>(
  611. MakeUnique<opt::CommonUniformElimPass>());
  612. }
  613. Optimizer::PassToken CreateCompactIdsPass() {
  614. return MakeUnique<Optimizer::PassToken::Impl>(
  615. MakeUnique<opt::CompactIdsPass>());
  616. }
  617. Optimizer::PassToken CreateMergeReturnPass() {
  618. return MakeUnique<Optimizer::PassToken::Impl>(
  619. MakeUnique<opt::MergeReturnPass>());
  620. }
  621. std::vector<const char*> Optimizer::GetPassNames() const {
  622. std::vector<const char*> v;
  623. for (uint32_t i = 0; i < impl_->pass_manager.NumPasses(); i++) {
  624. v.push_back(impl_->pass_manager.GetPass(i)->name());
  625. }
  626. return v;
  627. }
  628. Optimizer::PassToken CreateCFGCleanupPass() {
  629. return MakeUnique<Optimizer::PassToken::Impl>(
  630. MakeUnique<opt::CFGCleanupPass>());
  631. }
  632. Optimizer::PassToken CreateLocalRedundancyEliminationPass() {
  633. return MakeUnique<Optimizer::PassToken::Impl>(
  634. MakeUnique<opt::LocalRedundancyEliminationPass>());
  635. }
  636. Optimizer::PassToken CreateLoopFissionPass(size_t threshold) {
  637. return MakeUnique<Optimizer::PassToken::Impl>(
  638. MakeUnique<opt::LoopFissionPass>(threshold));
  639. }
  640. Optimizer::PassToken CreateLoopFusionPass(size_t max_registers_per_loop) {
  641. return MakeUnique<Optimizer::PassToken::Impl>(
  642. MakeUnique<opt::LoopFusionPass>(max_registers_per_loop));
  643. }
  644. Optimizer::PassToken CreateLoopInvariantCodeMotionPass() {
  645. return MakeUnique<Optimizer::PassToken::Impl>(MakeUnique<opt::LICMPass>());
  646. }
  647. Optimizer::PassToken CreateLoopPeelingPass() {
  648. return MakeUnique<Optimizer::PassToken::Impl>(
  649. MakeUnique<opt::LoopPeelingPass>());
  650. }
  651. Optimizer::PassToken CreateLoopUnswitchPass() {
  652. return MakeUnique<Optimizer::PassToken::Impl>(
  653. MakeUnique<opt::LoopUnswitchPass>());
  654. }
  655. Optimizer::PassToken CreateRedundancyEliminationPass() {
  656. return MakeUnique<Optimizer::PassToken::Impl>(
  657. MakeUnique<opt::RedundancyEliminationPass>());
  658. }
  659. Optimizer::PassToken CreateRemoveDuplicatesPass() {
  660. return MakeUnique<Optimizer::PassToken::Impl>(
  661. MakeUnique<opt::RemoveDuplicatesPass>());
  662. }
  663. Optimizer::PassToken CreateScalarReplacementPass(uint32_t size_limit) {
  664. return MakeUnique<Optimizer::PassToken::Impl>(
  665. MakeUnique<opt::ScalarReplacementPass>(size_limit));
  666. }
  667. Optimizer::PassToken CreatePrivateToLocalPass() {
  668. return MakeUnique<Optimizer::PassToken::Impl>(
  669. MakeUnique<opt::PrivateToLocalPass>());
  670. }
  671. Optimizer::PassToken CreateCCPPass() {
  672. return MakeUnique<Optimizer::PassToken::Impl>(MakeUnique<opt::CCPPass>());
  673. }
  674. Optimizer::PassToken CreateWorkaround1209Pass() {
  675. return MakeUnique<Optimizer::PassToken::Impl>(
  676. MakeUnique<opt::Workaround1209>());
  677. }
  678. Optimizer::PassToken CreateIfConversionPass() {
  679. return MakeUnique<Optimizer::PassToken::Impl>(
  680. MakeUnique<opt::IfConversion>());
  681. }
  682. Optimizer::PassToken CreateReplaceInvalidOpcodePass() {
  683. return MakeUnique<Optimizer::PassToken::Impl>(
  684. MakeUnique<opt::ReplaceInvalidOpcodePass>());
  685. }
  686. Optimizer::PassToken CreateSimplificationPass() {
  687. return MakeUnique<Optimizer::PassToken::Impl>(
  688. MakeUnique<opt::SimplificationPass>());
  689. }
  690. Optimizer::PassToken CreateLoopUnrollPass(bool fully_unroll, int factor) {
  691. return MakeUnique<Optimizer::PassToken::Impl>(
  692. MakeUnique<opt::LoopUnroller>(fully_unroll, factor));
  693. }
  694. Optimizer::PassToken CreateSSARewritePass() {
  695. return MakeUnique<Optimizer::PassToken::Impl>(
  696. MakeUnique<opt::SSARewritePass>());
  697. }
  698. Optimizer::PassToken CreateCopyPropagateArraysPass() {
  699. return MakeUnique<Optimizer::PassToken::Impl>(
  700. MakeUnique<opt::CopyPropagateArrays>());
  701. }
  702. Optimizer::PassToken CreateVectorDCEPass() {
  703. return MakeUnique<Optimizer::PassToken::Impl>(MakeUnique<opt::VectorDCE>());
  704. }
  705. Optimizer::PassToken CreateReduceLoadSizePass() {
  706. return MakeUnique<Optimizer::PassToken::Impl>(
  707. MakeUnique<opt::ReduceLoadSize>());
  708. }
  709. Optimizer::PassToken CreateCombineAccessChainsPass() {
  710. return MakeUnique<Optimizer::PassToken::Impl>(
  711. MakeUnique<opt::CombineAccessChains>());
  712. }
  713. Optimizer::PassToken CreateUpgradeMemoryModelPass() {
  714. return MakeUnique<Optimizer::PassToken::Impl>(
  715. MakeUnique<opt::UpgradeMemoryModel>());
  716. }
  717. Optimizer::PassToken CreateInstBindlessCheckPass(uint32_t desc_set,
  718. uint32_t shader_id,
  719. bool input_length_enable,
  720. bool input_init_enable) {
  721. return MakeUnique<Optimizer::PassToken::Impl>(
  722. MakeUnique<opt::InstBindlessCheckPass>(
  723. desc_set, shader_id, input_length_enable, input_init_enable));
  724. }
  725. Optimizer::PassToken CreateCodeSinkingPass() {
  726. return MakeUnique<Optimizer::PassToken::Impl>(
  727. MakeUnique<opt::CodeSinkingPass>());
  728. }
  729. } // namespace spvtools