fact_manager.cpp 9.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279
  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. #include "fact_manager.h"
  15. #include <sstream>
  16. #include <unordered_map>
  17. #include "source/fuzz/uniform_buffer_element_descriptor.h"
  18. #include "source/opt/ir_context.h"
  19. namespace spvtools {
  20. namespace fuzz {
  21. namespace {
  22. std::string ToString(const protobufs::FactConstantUniform& fact) {
  23. std::stringstream stream;
  24. stream << "(" << fact.uniform_buffer_element_descriptor().descriptor_set()
  25. << ", " << fact.uniform_buffer_element_descriptor().binding() << ")[";
  26. bool first = true;
  27. for (auto index : fact.uniform_buffer_element_descriptor().index()) {
  28. if (first) {
  29. first = false;
  30. } else {
  31. stream << ", ";
  32. }
  33. stream << index;
  34. }
  35. stream << "] == [";
  36. first = true;
  37. for (auto constant_word : fact.constant_word()) {
  38. if (first) {
  39. first = false;
  40. } else {
  41. stream << ", ";
  42. }
  43. stream << constant_word;
  44. }
  45. stream << "]";
  46. return stream.str();
  47. }
  48. std::string ToString(const protobufs::FactDataSynonym& fact) {
  49. std::stringstream stream;
  50. stream << fact.data1() << " = " << fact.data2();
  51. return stream.str();
  52. }
  53. std::string ToString(const protobufs::FactIdEquation& fact) {
  54. std::stringstream stream;
  55. stream << fact.lhs_id();
  56. stream << " " << fact.opcode();
  57. for (auto rhs_id : fact.rhs_id()) {
  58. stream << " " << rhs_id;
  59. }
  60. return stream.str();
  61. }
  62. std::string ToString(const protobufs::Fact& fact) {
  63. switch (fact.fact_case()) {
  64. case protobufs::Fact::kConstantUniformFact:
  65. return ToString(fact.constant_uniform_fact());
  66. case protobufs::Fact::kDataSynonymFact:
  67. return ToString(fact.data_synonym_fact());
  68. case protobufs::Fact::kIdEquationFact:
  69. return ToString(fact.id_equation_fact());
  70. default:
  71. assert(false && "Stringification not supported for this fact.");
  72. return "";
  73. }
  74. }
  75. } // namespace
  76. FactManager::FactManager(opt::IRContext* ir_context)
  77. : constant_uniform_facts_(ir_context),
  78. data_synonym_and_id_equation_facts_(ir_context),
  79. dead_block_facts_(ir_context),
  80. livesafe_function_facts_(ir_context),
  81. irrelevant_value_facts_(ir_context) {}
  82. void FactManager::AddInitialFacts(const MessageConsumer& message_consumer,
  83. const protobufs::FactSequence& facts) {
  84. for (auto& fact : facts.fact()) {
  85. if (!MaybeAddFact(fact)) {
  86. auto message = "Invalid fact " + ToString(fact) + " ignored.";
  87. message_consumer(SPV_MSG_WARNING, nullptr, {}, message.c_str());
  88. }
  89. }
  90. }
  91. bool FactManager::MaybeAddFact(const fuzz::protobufs::Fact& fact) {
  92. switch (fact.fact_case()) {
  93. case protobufs::Fact::kBlockIsDeadFact:
  94. return dead_block_facts_.MaybeAddFact(fact.block_is_dead_fact());
  95. case protobufs::Fact::kConstantUniformFact:
  96. return constant_uniform_facts_.MaybeAddFact(fact.constant_uniform_fact());
  97. case protobufs::Fact::kDataSynonymFact:
  98. return data_synonym_and_id_equation_facts_.MaybeAddFact(
  99. fact.data_synonym_fact(), dead_block_facts_, irrelevant_value_facts_);
  100. case protobufs::Fact::kFunctionIsLivesafeFact:
  101. return livesafe_function_facts_.MaybeAddFact(
  102. fact.function_is_livesafe_fact());
  103. case protobufs::Fact::kIdEquationFact:
  104. return data_synonym_and_id_equation_facts_.MaybeAddFact(
  105. fact.id_equation_fact(), dead_block_facts_, irrelevant_value_facts_);
  106. case protobufs::Fact::kIdIsIrrelevant:
  107. return irrelevant_value_facts_.MaybeAddFact(
  108. fact.id_is_irrelevant(), data_synonym_and_id_equation_facts_);
  109. case protobufs::Fact::kPointeeValueIsIrrelevantFact:
  110. return irrelevant_value_facts_.MaybeAddFact(
  111. fact.pointee_value_is_irrelevant_fact(),
  112. data_synonym_and_id_equation_facts_);
  113. case protobufs::Fact::FACT_NOT_SET:
  114. assert(false && "The fact must be set");
  115. return false;
  116. }
  117. assert(false && "Unreachable");
  118. return false;
  119. }
  120. void FactManager::AddFactDataSynonym(const protobufs::DataDescriptor& data1,
  121. const protobufs::DataDescriptor& data2) {
  122. protobufs::FactDataSynonym fact;
  123. *fact.mutable_data1() = data1;
  124. *fact.mutable_data2() = data2;
  125. auto success = data_synonym_and_id_equation_facts_.MaybeAddFact(
  126. fact, dead_block_facts_, irrelevant_value_facts_);
  127. (void)success; // Keep compilers happy in release mode.
  128. assert(success && "Unable to create DataSynonym fact");
  129. }
  130. std::vector<uint32_t> FactManager::GetConstantsAvailableFromUniformsForType(
  131. uint32_t type_id) const {
  132. return constant_uniform_facts_.GetConstantsAvailableFromUniformsForType(
  133. type_id);
  134. }
  135. std::vector<protobufs::UniformBufferElementDescriptor>
  136. FactManager::GetUniformDescriptorsForConstant(uint32_t constant_id) const {
  137. return constant_uniform_facts_.GetUniformDescriptorsForConstant(constant_id);
  138. }
  139. uint32_t FactManager::GetConstantFromUniformDescriptor(
  140. const protobufs::UniformBufferElementDescriptor& uniform_descriptor) const {
  141. return constant_uniform_facts_.GetConstantFromUniformDescriptor(
  142. uniform_descriptor);
  143. }
  144. std::vector<uint32_t> FactManager::GetTypesForWhichUniformValuesAreKnown()
  145. const {
  146. return constant_uniform_facts_.GetTypesForWhichUniformValuesAreKnown();
  147. }
  148. const std::vector<std::pair<protobufs::FactConstantUniform, uint32_t>>&
  149. FactManager::GetConstantUniformFactsAndTypes() const {
  150. return constant_uniform_facts_.GetConstantUniformFactsAndTypes();
  151. }
  152. std::vector<uint32_t> FactManager::GetIdsForWhichSynonymsAreKnown() const {
  153. return data_synonym_and_id_equation_facts_.GetIdsForWhichSynonymsAreKnown();
  154. }
  155. std::vector<const protobufs::DataDescriptor*> FactManager::GetAllSynonyms()
  156. const {
  157. return data_synonym_and_id_equation_facts_.GetAllKnownSynonyms();
  158. }
  159. std::vector<const protobufs::DataDescriptor*>
  160. FactManager::GetSynonymsForDataDescriptor(
  161. const protobufs::DataDescriptor& data_descriptor) const {
  162. return data_synonym_and_id_equation_facts_.GetSynonymsForDataDescriptor(
  163. data_descriptor);
  164. }
  165. std::vector<const protobufs::DataDescriptor*> FactManager::GetSynonymsForId(
  166. uint32_t id) const {
  167. return data_synonym_and_id_equation_facts_.GetSynonymsForId(id);
  168. }
  169. bool FactManager::IsSynonymous(
  170. const protobufs::DataDescriptor& data_descriptor1,
  171. const protobufs::DataDescriptor& data_descriptor2) const {
  172. return data_synonym_and_id_equation_facts_.IsSynonymous(data_descriptor1,
  173. data_descriptor2);
  174. }
  175. bool FactManager::BlockIsDead(uint32_t block_id) const {
  176. return dead_block_facts_.BlockIsDead(block_id);
  177. }
  178. void FactManager::AddFactBlockIsDead(uint32_t block_id) {
  179. protobufs::FactBlockIsDead fact;
  180. fact.set_block_id(block_id);
  181. auto success = dead_block_facts_.MaybeAddFact(fact);
  182. (void)success; // Keep compilers happy in release mode.
  183. assert(success && "|block_id| is invalid");
  184. }
  185. bool FactManager::FunctionIsLivesafe(uint32_t function_id) const {
  186. return livesafe_function_facts_.FunctionIsLivesafe(function_id);
  187. }
  188. void FactManager::AddFactFunctionIsLivesafe(uint32_t function_id) {
  189. protobufs::FactFunctionIsLivesafe fact;
  190. fact.set_function_id(function_id);
  191. auto success = livesafe_function_facts_.MaybeAddFact(fact);
  192. (void)success; // Keep compilers happy in release mode.
  193. assert(success && "|function_id| is invalid");
  194. }
  195. bool FactManager::PointeeValueIsIrrelevant(uint32_t pointer_id) const {
  196. return irrelevant_value_facts_.PointeeValueIsIrrelevant(pointer_id);
  197. }
  198. bool FactManager::IdIsIrrelevant(uint32_t result_id) const {
  199. return irrelevant_value_facts_.IdIsIrrelevant(result_id, dead_block_facts_);
  200. }
  201. std::unordered_set<uint32_t> FactManager::GetIrrelevantIds() const {
  202. return irrelevant_value_facts_.GetIrrelevantIds(dead_block_facts_);
  203. }
  204. void FactManager::AddFactValueOfPointeeIsIrrelevant(uint32_t pointer_id) {
  205. protobufs::FactPointeeValueIsIrrelevant fact;
  206. fact.set_pointer_id(pointer_id);
  207. auto success = irrelevant_value_facts_.MaybeAddFact(
  208. fact, data_synonym_and_id_equation_facts_);
  209. (void)success; // Keep compilers happy in release mode.
  210. assert(success && "|pointer_id| is invalid");
  211. }
  212. void FactManager::AddFactIdIsIrrelevant(uint32_t result_id) {
  213. protobufs::FactIdIsIrrelevant fact;
  214. fact.set_result_id(result_id);
  215. auto success = irrelevant_value_facts_.MaybeAddFact(
  216. fact, data_synonym_and_id_equation_facts_);
  217. (void)success; // Keep compilers happy in release mode.
  218. assert(success && "|result_id| is invalid");
  219. }
  220. void FactManager::AddFactIdEquation(uint32_t lhs_id, spv::Op opcode,
  221. const std::vector<uint32_t>& rhs_id) {
  222. protobufs::FactIdEquation fact;
  223. fact.set_lhs_id(lhs_id);
  224. fact.set_opcode(uint32_t(opcode));
  225. for (auto an_rhs_id : rhs_id) {
  226. fact.add_rhs_id(an_rhs_id);
  227. }
  228. auto success = data_synonym_and_id_equation_facts_.MaybeAddFact(
  229. fact, dead_block_facts_, irrelevant_value_facts_);
  230. (void)success; // Keep compilers happy in release mode.
  231. assert(success && "Can't create IdIsIrrelevant fact");
  232. }
  233. void FactManager::ComputeClosureOfFacts(
  234. uint32_t maximum_equivalence_class_size) {
  235. data_synonym_and_id_equation_facts_.ComputeClosureOfFacts(
  236. maximum_equivalence_class_size);
  237. }
  238. } // namespace fuzz
  239. } // namespace spvtools