optimizer.cpp 30 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802
  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. .RegisterPass(CreateCodeSinkingPass());
  167. // Currently exposing driver bugs resulting in crashes (#946)
  168. // .RegisterPass(CreateCommonUniformElimPass())
  169. }
  170. Optimizer& Optimizer::RegisterSizePasses() {
  171. return RegisterPass(CreateDeadBranchElimPass())
  172. .RegisterPass(CreateMergeReturnPass())
  173. .RegisterPass(CreateInlineExhaustivePass())
  174. .RegisterPass(CreateAggressiveDCEPass())
  175. .RegisterPass(CreatePrivateToLocalPass())
  176. .RegisterPass(CreateScalarReplacementPass())
  177. .RegisterPass(CreateLocalAccessChainConvertPass())
  178. .RegisterPass(CreateLocalSingleBlockLoadStoreElimPass())
  179. .RegisterPass(CreateLocalSingleStoreElimPass())
  180. .RegisterPass(CreateAggressiveDCEPass())
  181. .RegisterPass(CreateSimplificationPass())
  182. .RegisterPass(CreateDeadInsertElimPass())
  183. .RegisterPass(CreateLocalMultiStoreElimPass())
  184. .RegisterPass(CreateAggressiveDCEPass())
  185. .RegisterPass(CreateCCPPass())
  186. .RegisterPass(CreateAggressiveDCEPass())
  187. .RegisterPass(CreateDeadBranchElimPass())
  188. .RegisterPass(CreateIfConversionPass())
  189. .RegisterPass(CreateAggressiveDCEPass())
  190. .RegisterPass(CreateBlockMergePass())
  191. .RegisterPass(CreateSimplificationPass())
  192. .RegisterPass(CreateDeadInsertElimPass())
  193. .RegisterPass(CreateRedundancyEliminationPass())
  194. .RegisterPass(CreateCFGCleanupPass())
  195. // Currently exposing driver bugs resulting in crashes (#946)
  196. // .RegisterPass(CreateCommonUniformElimPass())
  197. .RegisterPass(CreateAggressiveDCEPass());
  198. }
  199. Optimizer& Optimizer::RegisterWebGPUPasses() {
  200. return RegisterPass(CreateAggressiveDCEPass())
  201. .RegisterPass(CreateDeadBranchElimPass());
  202. }
  203. bool Optimizer::RegisterPassesFromFlags(const std::vector<std::string>& flags) {
  204. for (const auto& flag : flags) {
  205. if (!RegisterPassFromFlag(flag)) {
  206. return false;
  207. }
  208. }
  209. return true;
  210. }
  211. bool Optimizer::FlagHasValidForm(const std::string& flag) const {
  212. if (flag == "-O" || flag == "-Os") {
  213. return true;
  214. } else if (flag.size() > 2 && flag.substr(0, 2) == "--") {
  215. return true;
  216. }
  217. Errorf(consumer(), nullptr, {},
  218. "%s is not a valid flag. Flag passes should have the form "
  219. "'--pass_name[=pass_args]'. Special flag names also accepted: -O "
  220. "and -Os.",
  221. flag.c_str());
  222. return false;
  223. }
  224. bool Optimizer::RegisterPassFromFlag(const std::string& flag) {
  225. if (!FlagHasValidForm(flag)) {
  226. return false;
  227. }
  228. // Split flags of the form --pass_name=pass_args.
  229. auto p = utils::SplitFlagArgs(flag);
  230. std::string pass_name = p.first;
  231. std::string pass_args = p.second;
  232. // FIXME(dnovillo): This should be re-factored so that pass names can be
  233. // automatically checked against Pass::name() and PassToken instances created
  234. // via a template function. Additionally, class Pass should have a desc()
  235. // method that describes the pass (so it can be used in --help).
  236. //
  237. // Both Pass::name() and Pass::desc() should be static class members so they
  238. // can be invoked without creating a pass instance.
  239. if (pass_name == "strip-debug") {
  240. RegisterPass(CreateStripDebugInfoPass());
  241. } else if (pass_name == "strip-reflect") {
  242. RegisterPass(CreateStripReflectInfoPass());
  243. } else if (pass_name == "set-spec-const-default-value") {
  244. if (pass_args.size() > 0) {
  245. auto spec_ids_vals =
  246. opt::SetSpecConstantDefaultValuePass::ParseDefaultValuesString(
  247. pass_args.c_str());
  248. if (!spec_ids_vals) {
  249. Errorf(consumer(), nullptr, {},
  250. "Invalid argument for --set-spec-const-default-value: %s",
  251. pass_args.c_str());
  252. return false;
  253. }
  254. RegisterPass(
  255. CreateSetSpecConstantDefaultValuePass(std::move(*spec_ids_vals)));
  256. } else {
  257. Errorf(consumer(), nullptr, {},
  258. "Invalid spec constant value string '%s'. Expected a string of "
  259. "<spec id>:<default value> pairs.",
  260. pass_args.c_str());
  261. return false;
  262. }
  263. } else if (pass_name == "if-conversion") {
  264. RegisterPass(CreateIfConversionPass());
  265. } else if (pass_name == "freeze-spec-const") {
  266. RegisterPass(CreateFreezeSpecConstantValuePass());
  267. } else if (pass_name == "inline-entry-points-exhaustive") {
  268. RegisterPass(CreateInlineExhaustivePass());
  269. } else if (pass_name == "inline-entry-points-opaque") {
  270. RegisterPass(CreateInlineOpaquePass());
  271. } else if (pass_name == "combine-access-chains") {
  272. RegisterPass(CreateCombineAccessChainsPass());
  273. } else if (pass_name == "convert-local-access-chains") {
  274. RegisterPass(CreateLocalAccessChainConvertPass());
  275. } else if (pass_name == "eliminate-dead-code-aggressive") {
  276. RegisterPass(CreateAggressiveDCEPass());
  277. } else if (pass_name == "propagate-line-info") {
  278. RegisterPass(CreatePropagateLineInfoPass());
  279. } else if (pass_name == "eliminate-redundant-line-info") {
  280. RegisterPass(CreateRedundantLineInfoElimPass());
  281. } else if (pass_name == "eliminate-insert-extract") {
  282. RegisterPass(CreateInsertExtractElimPass());
  283. } else if (pass_name == "eliminate-local-single-block") {
  284. RegisterPass(CreateLocalSingleBlockLoadStoreElimPass());
  285. } else if (pass_name == "eliminate-local-single-store") {
  286. RegisterPass(CreateLocalSingleStoreElimPass());
  287. } else if (pass_name == "merge-blocks") {
  288. RegisterPass(CreateBlockMergePass());
  289. } else if (pass_name == "merge-return") {
  290. RegisterPass(CreateMergeReturnPass());
  291. } else if (pass_name == "eliminate-dead-branches") {
  292. RegisterPass(CreateDeadBranchElimPass());
  293. } else if (pass_name == "eliminate-dead-functions") {
  294. RegisterPass(CreateEliminateDeadFunctionsPass());
  295. } else if (pass_name == "eliminate-local-multi-store") {
  296. RegisterPass(CreateLocalMultiStoreElimPass());
  297. } else if (pass_name == "eliminate-common-uniform") {
  298. RegisterPass(CreateCommonUniformElimPass());
  299. } else if (pass_name == "eliminate-dead-const") {
  300. RegisterPass(CreateEliminateDeadConstantPass());
  301. } else if (pass_name == "eliminate-dead-inserts") {
  302. RegisterPass(CreateDeadInsertElimPass());
  303. } else if (pass_name == "eliminate-dead-variables") {
  304. RegisterPass(CreateDeadVariableEliminationPass());
  305. } else if (pass_name == "fold-spec-const-op-composite") {
  306. RegisterPass(CreateFoldSpecConstantOpAndCompositePass());
  307. } else if (pass_name == "loop-unswitch") {
  308. RegisterPass(CreateLoopUnswitchPass());
  309. } else if (pass_name == "scalar-replacement") {
  310. if (pass_args.size() == 0) {
  311. RegisterPass(CreateScalarReplacementPass());
  312. } else {
  313. int limit = -1;
  314. if (pass_args.find_first_not_of("0123456789") == std::string::npos) {
  315. limit = atoi(pass_args.c_str());
  316. }
  317. if (limit >= 0) {
  318. RegisterPass(CreateScalarReplacementPass(limit));
  319. } else {
  320. Error(consumer(), nullptr, {},
  321. "--scalar-replacement must have no arguments or a non-negative "
  322. "integer argument");
  323. return false;
  324. }
  325. }
  326. } else if (pass_name == "strength-reduction") {
  327. RegisterPass(CreateStrengthReductionPass());
  328. } else if (pass_name == "unify-const") {
  329. RegisterPass(CreateUnifyConstantPass());
  330. } else if (pass_name == "flatten-decorations") {
  331. RegisterPass(CreateFlattenDecorationPass());
  332. } else if (pass_name == "compact-ids") {
  333. RegisterPass(CreateCompactIdsPass());
  334. } else if (pass_name == "cfg-cleanup") {
  335. RegisterPass(CreateCFGCleanupPass());
  336. } else if (pass_name == "local-redundancy-elimination") {
  337. RegisterPass(CreateLocalRedundancyEliminationPass());
  338. } else if (pass_name == "loop-invariant-code-motion") {
  339. RegisterPass(CreateLoopInvariantCodeMotionPass());
  340. } else if (pass_name == "reduce-load-size") {
  341. RegisterPass(CreateReduceLoadSizePass());
  342. } else if (pass_name == "redundancy-elimination") {
  343. RegisterPass(CreateRedundancyEliminationPass());
  344. } else if (pass_name == "private-to-local") {
  345. RegisterPass(CreatePrivateToLocalPass());
  346. } else if (pass_name == "remove-duplicates") {
  347. RegisterPass(CreateRemoveDuplicatesPass());
  348. } else if (pass_name == "workaround-1209") {
  349. RegisterPass(CreateWorkaround1209Pass());
  350. } else if (pass_name == "replace-invalid-opcode") {
  351. RegisterPass(CreateReplaceInvalidOpcodePass());
  352. } else if (pass_name == "inst-bindless-check") {
  353. RegisterPass(CreateInstBindlessCheckPass(7, 23));
  354. RegisterPass(CreateSimplificationPass());
  355. RegisterPass(CreateDeadBranchElimPass());
  356. RegisterPass(CreateBlockMergePass());
  357. RegisterPass(CreateAggressiveDCEPass());
  358. } else if (pass_name == "simplify-instructions") {
  359. RegisterPass(CreateSimplificationPass());
  360. } else if (pass_name == "ssa-rewrite") {
  361. RegisterPass(CreateSSARewritePass());
  362. } else if (pass_name == "copy-propagate-arrays") {
  363. RegisterPass(CreateCopyPropagateArraysPass());
  364. } else if (pass_name == "loop-fission") {
  365. int register_threshold_to_split =
  366. (pass_args.size() > 0) ? atoi(pass_args.c_str()) : -1;
  367. if (register_threshold_to_split > 0) {
  368. RegisterPass(CreateLoopFissionPass(
  369. static_cast<size_t>(register_threshold_to_split)));
  370. } else {
  371. Error(consumer(), nullptr, {},
  372. "--loop-fission must have a positive integer argument");
  373. return false;
  374. }
  375. } else if (pass_name == "loop-fusion") {
  376. int max_registers_per_loop =
  377. (pass_args.size() > 0) ? atoi(pass_args.c_str()) : -1;
  378. if (max_registers_per_loop > 0) {
  379. RegisterPass(
  380. CreateLoopFusionPass(static_cast<size_t>(max_registers_per_loop)));
  381. } else {
  382. Error(consumer(), nullptr, {},
  383. "--loop-fusion must have a positive integer argument");
  384. return false;
  385. }
  386. } else if (pass_name == "loop-unroll") {
  387. RegisterPass(CreateLoopUnrollPass(true));
  388. } else if (pass_name == "upgrade-memory-model") {
  389. RegisterPass(CreateUpgradeMemoryModelPass());
  390. } else if (pass_name == "vector-dce") {
  391. RegisterPass(CreateVectorDCEPass());
  392. } else if (pass_name == "loop-unroll-partial") {
  393. int factor = (pass_args.size() > 0) ? atoi(pass_args.c_str()) : 0;
  394. if (factor > 0) {
  395. RegisterPass(CreateLoopUnrollPass(false, factor));
  396. } else {
  397. Error(consumer(), nullptr, {},
  398. "--loop-unroll-partial must have a positive integer argument");
  399. return false;
  400. }
  401. } else if (pass_name == "loop-peeling") {
  402. RegisterPass(CreateLoopPeelingPass());
  403. } else if (pass_name == "loop-peeling-threshold") {
  404. int factor = (pass_args.size() > 0) ? atoi(pass_args.c_str()) : 0;
  405. if (factor > 0) {
  406. opt::LoopPeelingPass::SetLoopPeelingThreshold(factor);
  407. } else {
  408. Error(consumer(), nullptr, {},
  409. "--loop-peeling-threshold must have a positive integer argument");
  410. return false;
  411. }
  412. } else if (pass_name == "ccp") {
  413. RegisterPass(CreateCCPPass());
  414. } else if (pass_name == "code-sink") {
  415. RegisterPass(CreateCodeSinkingPass());
  416. } else if (pass_name == "O") {
  417. RegisterPerformancePasses();
  418. } else if (pass_name == "Os") {
  419. RegisterSizePasses();
  420. } else if (pass_name == "legalize-hlsl") {
  421. RegisterLegalizationPasses();
  422. } else {
  423. Errorf(consumer(), nullptr, {},
  424. "Unknown flag '--%s'. Use --help for a list of valid flags",
  425. pass_name.c_str());
  426. return false;
  427. }
  428. return true;
  429. }
  430. void Optimizer::SetTargetEnv(const spv_target_env env) {
  431. impl_->target_env = env;
  432. }
  433. bool Optimizer::Run(const uint32_t* original_binary,
  434. const size_t original_binary_size,
  435. std::vector<uint32_t>* optimized_binary) const {
  436. return Run(original_binary, original_binary_size, optimized_binary,
  437. OptimizerOptions());
  438. }
  439. bool Optimizer::Run(const uint32_t* original_binary,
  440. const size_t original_binary_size,
  441. std::vector<uint32_t>* optimized_binary,
  442. const ValidatorOptions& validator_options,
  443. bool skip_validation) const {
  444. OptimizerOptions opt_options;
  445. opt_options.set_run_validator(!skip_validation);
  446. opt_options.set_validator_options(validator_options);
  447. return Run(original_binary, original_binary_size, optimized_binary,
  448. opt_options);
  449. }
  450. bool Optimizer::Run(const uint32_t* original_binary,
  451. const size_t original_binary_size,
  452. std::vector<uint32_t>* optimized_binary,
  453. const spv_optimizer_options opt_options) const {
  454. spvtools::SpirvTools tools(impl_->target_env);
  455. tools.SetMessageConsumer(impl_->pass_manager.consumer());
  456. if (opt_options->run_validator_ &&
  457. !tools.Validate(original_binary, original_binary_size,
  458. &opt_options->val_options_)) {
  459. return false;
  460. }
  461. std::unique_ptr<opt::IRContext> context = BuildModule(
  462. impl_->target_env, consumer(), original_binary, original_binary_size);
  463. if (context == nullptr) return false;
  464. context->set_max_id_bound(opt_options->max_id_bound_);
  465. auto status = impl_->pass_manager.Run(context.get());
  466. if (status == opt::Pass::Status::SuccessWithChange ||
  467. (status == opt::Pass::Status::SuccessWithoutChange &&
  468. (optimized_binary->data() != original_binary ||
  469. optimized_binary->size() != original_binary_size))) {
  470. optimized_binary->clear();
  471. context->module()->ToBinary(optimized_binary, /* skip_nop = */ true);
  472. }
  473. return status != opt::Pass::Status::Failure;
  474. }
  475. Optimizer& Optimizer::SetPrintAll(std::ostream* out) {
  476. impl_->pass_manager.SetPrintAll(out);
  477. return *this;
  478. }
  479. Optimizer& Optimizer::SetTimeReport(std::ostream* out) {
  480. impl_->pass_manager.SetTimeReport(out);
  481. return *this;
  482. }
  483. Optimizer::PassToken CreateNullPass() {
  484. return MakeUnique<Optimizer::PassToken::Impl>(MakeUnique<opt::NullPass>());
  485. }
  486. Optimizer::PassToken CreateStripDebugInfoPass() {
  487. return MakeUnique<Optimizer::PassToken::Impl>(
  488. MakeUnique<opt::StripDebugInfoPass>());
  489. }
  490. Optimizer::PassToken CreateStripReflectInfoPass() {
  491. return MakeUnique<Optimizer::PassToken::Impl>(
  492. MakeUnique<opt::StripReflectInfoPass>());
  493. }
  494. Optimizer::PassToken CreateEliminateDeadFunctionsPass() {
  495. return MakeUnique<Optimizer::PassToken::Impl>(
  496. MakeUnique<opt::EliminateDeadFunctionsPass>());
  497. }
  498. Optimizer::PassToken CreateSetSpecConstantDefaultValuePass(
  499. const std::unordered_map<uint32_t, std::string>& id_value_map) {
  500. return MakeUnique<Optimizer::PassToken::Impl>(
  501. MakeUnique<opt::SetSpecConstantDefaultValuePass>(id_value_map));
  502. }
  503. Optimizer::PassToken CreateSetSpecConstantDefaultValuePass(
  504. const std::unordered_map<uint32_t, std::vector<uint32_t>>& id_value_map) {
  505. return MakeUnique<Optimizer::PassToken::Impl>(
  506. MakeUnique<opt::SetSpecConstantDefaultValuePass>(id_value_map));
  507. }
  508. Optimizer::PassToken CreateFlattenDecorationPass() {
  509. return MakeUnique<Optimizer::PassToken::Impl>(
  510. MakeUnique<opt::FlattenDecorationPass>());
  511. }
  512. Optimizer::PassToken CreateFreezeSpecConstantValuePass() {
  513. return MakeUnique<Optimizer::PassToken::Impl>(
  514. MakeUnique<opt::FreezeSpecConstantValuePass>());
  515. }
  516. Optimizer::PassToken CreateFoldSpecConstantOpAndCompositePass() {
  517. return MakeUnique<Optimizer::PassToken::Impl>(
  518. MakeUnique<opt::FoldSpecConstantOpAndCompositePass>());
  519. }
  520. Optimizer::PassToken CreateUnifyConstantPass() {
  521. return MakeUnique<Optimizer::PassToken::Impl>(
  522. MakeUnique<opt::UnifyConstantPass>());
  523. }
  524. Optimizer::PassToken CreateEliminateDeadConstantPass() {
  525. return MakeUnique<Optimizer::PassToken::Impl>(
  526. MakeUnique<opt::EliminateDeadConstantPass>());
  527. }
  528. Optimizer::PassToken CreateDeadVariableEliminationPass() {
  529. return MakeUnique<Optimizer::PassToken::Impl>(
  530. MakeUnique<opt::DeadVariableElimination>());
  531. }
  532. Optimizer::PassToken CreateStrengthReductionPass() {
  533. return MakeUnique<Optimizer::PassToken::Impl>(
  534. MakeUnique<opt::StrengthReductionPass>());
  535. }
  536. Optimizer::PassToken CreateBlockMergePass() {
  537. return MakeUnique<Optimizer::PassToken::Impl>(
  538. MakeUnique<opt::BlockMergePass>());
  539. }
  540. Optimizer::PassToken CreateInlineExhaustivePass() {
  541. return MakeUnique<Optimizer::PassToken::Impl>(
  542. MakeUnique<opt::InlineExhaustivePass>());
  543. }
  544. Optimizer::PassToken CreateInlineOpaquePass() {
  545. return MakeUnique<Optimizer::PassToken::Impl>(
  546. MakeUnique<opt::InlineOpaquePass>());
  547. }
  548. Optimizer::PassToken CreateLocalAccessChainConvertPass() {
  549. return MakeUnique<Optimizer::PassToken::Impl>(
  550. MakeUnique<opt::LocalAccessChainConvertPass>());
  551. }
  552. Optimizer::PassToken CreateLocalSingleBlockLoadStoreElimPass() {
  553. return MakeUnique<Optimizer::PassToken::Impl>(
  554. MakeUnique<opt::LocalSingleBlockLoadStoreElimPass>());
  555. }
  556. Optimizer::PassToken CreateLocalSingleStoreElimPass() {
  557. return MakeUnique<Optimizer::PassToken::Impl>(
  558. MakeUnique<opt::LocalSingleStoreElimPass>());
  559. }
  560. Optimizer::PassToken CreateInsertExtractElimPass() {
  561. return MakeUnique<Optimizer::PassToken::Impl>(
  562. MakeUnique<opt::SimplificationPass>());
  563. }
  564. Optimizer::PassToken CreateDeadInsertElimPass() {
  565. return MakeUnique<Optimizer::PassToken::Impl>(
  566. MakeUnique<opt::DeadInsertElimPass>());
  567. }
  568. Optimizer::PassToken CreateDeadBranchElimPass() {
  569. return MakeUnique<Optimizer::PassToken::Impl>(
  570. MakeUnique<opt::DeadBranchElimPass>());
  571. }
  572. Optimizer::PassToken CreateLocalMultiStoreElimPass() {
  573. return MakeUnique<Optimizer::PassToken::Impl>(
  574. MakeUnique<opt::LocalMultiStoreElimPass>());
  575. }
  576. Optimizer::PassToken CreateAggressiveDCEPass() {
  577. return MakeUnique<Optimizer::PassToken::Impl>(
  578. MakeUnique<opt::AggressiveDCEPass>());
  579. }
  580. Optimizer::PassToken CreatePropagateLineInfoPass() {
  581. return MakeUnique<Optimizer::PassToken::Impl>(
  582. MakeUnique<opt::ProcessLinesPass>(opt::kLinesPropagateLines));
  583. }
  584. Optimizer::PassToken CreateRedundantLineInfoElimPass() {
  585. return MakeUnique<Optimizer::PassToken::Impl>(
  586. MakeUnique<opt::ProcessLinesPass>(opt::kLinesEliminateDeadLines));
  587. }
  588. Optimizer::PassToken CreateCommonUniformElimPass() {
  589. return MakeUnique<Optimizer::PassToken::Impl>(
  590. MakeUnique<opt::CommonUniformElimPass>());
  591. }
  592. Optimizer::PassToken CreateCompactIdsPass() {
  593. return MakeUnique<Optimizer::PassToken::Impl>(
  594. MakeUnique<opt::CompactIdsPass>());
  595. }
  596. Optimizer::PassToken CreateMergeReturnPass() {
  597. return MakeUnique<Optimizer::PassToken::Impl>(
  598. MakeUnique<opt::MergeReturnPass>());
  599. }
  600. std::vector<const char*> Optimizer::GetPassNames() const {
  601. std::vector<const char*> v;
  602. for (uint32_t i = 0; i < impl_->pass_manager.NumPasses(); i++) {
  603. v.push_back(impl_->pass_manager.GetPass(i)->name());
  604. }
  605. return v;
  606. }
  607. Optimizer::PassToken CreateCFGCleanupPass() {
  608. return MakeUnique<Optimizer::PassToken::Impl>(
  609. MakeUnique<opt::CFGCleanupPass>());
  610. }
  611. Optimizer::PassToken CreateLocalRedundancyEliminationPass() {
  612. return MakeUnique<Optimizer::PassToken::Impl>(
  613. MakeUnique<opt::LocalRedundancyEliminationPass>());
  614. }
  615. Optimizer::PassToken CreateLoopFissionPass(size_t threshold) {
  616. return MakeUnique<Optimizer::PassToken::Impl>(
  617. MakeUnique<opt::LoopFissionPass>(threshold));
  618. }
  619. Optimizer::PassToken CreateLoopFusionPass(size_t max_registers_per_loop) {
  620. return MakeUnique<Optimizer::PassToken::Impl>(
  621. MakeUnique<opt::LoopFusionPass>(max_registers_per_loop));
  622. }
  623. Optimizer::PassToken CreateLoopInvariantCodeMotionPass() {
  624. return MakeUnique<Optimizer::PassToken::Impl>(MakeUnique<opt::LICMPass>());
  625. }
  626. Optimizer::PassToken CreateLoopPeelingPass() {
  627. return MakeUnique<Optimizer::PassToken::Impl>(
  628. MakeUnique<opt::LoopPeelingPass>());
  629. }
  630. Optimizer::PassToken CreateLoopUnswitchPass() {
  631. return MakeUnique<Optimizer::PassToken::Impl>(
  632. MakeUnique<opt::LoopUnswitchPass>());
  633. }
  634. Optimizer::PassToken CreateRedundancyEliminationPass() {
  635. return MakeUnique<Optimizer::PassToken::Impl>(
  636. MakeUnique<opt::RedundancyEliminationPass>());
  637. }
  638. Optimizer::PassToken CreateRemoveDuplicatesPass() {
  639. return MakeUnique<Optimizer::PassToken::Impl>(
  640. MakeUnique<opt::RemoveDuplicatesPass>());
  641. }
  642. Optimizer::PassToken CreateScalarReplacementPass(uint32_t size_limit) {
  643. return MakeUnique<Optimizer::PassToken::Impl>(
  644. MakeUnique<opt::ScalarReplacementPass>(size_limit));
  645. }
  646. Optimizer::PassToken CreatePrivateToLocalPass() {
  647. return MakeUnique<Optimizer::PassToken::Impl>(
  648. MakeUnique<opt::PrivateToLocalPass>());
  649. }
  650. Optimizer::PassToken CreateCCPPass() {
  651. return MakeUnique<Optimizer::PassToken::Impl>(MakeUnique<opt::CCPPass>());
  652. }
  653. Optimizer::PassToken CreateWorkaround1209Pass() {
  654. return MakeUnique<Optimizer::PassToken::Impl>(
  655. MakeUnique<opt::Workaround1209>());
  656. }
  657. Optimizer::PassToken CreateIfConversionPass() {
  658. return MakeUnique<Optimizer::PassToken::Impl>(
  659. MakeUnique<opt::IfConversion>());
  660. }
  661. Optimizer::PassToken CreateReplaceInvalidOpcodePass() {
  662. return MakeUnique<Optimizer::PassToken::Impl>(
  663. MakeUnique<opt::ReplaceInvalidOpcodePass>());
  664. }
  665. Optimizer::PassToken CreateSimplificationPass() {
  666. return MakeUnique<Optimizer::PassToken::Impl>(
  667. MakeUnique<opt::SimplificationPass>());
  668. }
  669. Optimizer::PassToken CreateLoopUnrollPass(bool fully_unroll, int factor) {
  670. return MakeUnique<Optimizer::PassToken::Impl>(
  671. MakeUnique<opt::LoopUnroller>(fully_unroll, factor));
  672. }
  673. Optimizer::PassToken CreateSSARewritePass() {
  674. return MakeUnique<Optimizer::PassToken::Impl>(
  675. MakeUnique<opt::SSARewritePass>());
  676. }
  677. Optimizer::PassToken CreateCopyPropagateArraysPass() {
  678. return MakeUnique<Optimizer::PassToken::Impl>(
  679. MakeUnique<opt::CopyPropagateArrays>());
  680. }
  681. Optimizer::PassToken CreateVectorDCEPass() {
  682. return MakeUnique<Optimizer::PassToken::Impl>(MakeUnique<opt::VectorDCE>());
  683. }
  684. Optimizer::PassToken CreateReduceLoadSizePass() {
  685. return MakeUnique<Optimizer::PassToken::Impl>(
  686. MakeUnique<opt::ReduceLoadSize>());
  687. }
  688. Optimizer::PassToken CreateCombineAccessChainsPass() {
  689. return MakeUnique<Optimizer::PassToken::Impl>(
  690. MakeUnique<opt::CombineAccessChains>());
  691. }
  692. Optimizer::PassToken CreateUpgradeMemoryModelPass() {
  693. return MakeUnique<Optimizer::PassToken::Impl>(
  694. MakeUnique<opt::UpgradeMemoryModel>());
  695. }
  696. Optimizer::PassToken CreateInstBindlessCheckPass(uint32_t desc_set,
  697. uint32_t shader_id) {
  698. return MakeUnique<Optimizer::PassToken::Impl>(
  699. MakeUnique<opt::InstBindlessCheckPass>(desc_set, shader_id));
  700. }
  701. Optimizer::PassToken CreateCodeSinkingPass() {
  702. return MakeUnique<Optimizer::PassToken::Impl>(
  703. MakeUnique<opt::CodeSinkingPass>());
  704. }
  705. } // namespace spvtools