Alastair Donaldson 67f4838659 spirv-fuzz: Make handling of synonym facts more efficient (#3301) ... The fact manager maintains an equivalence relation on data descriptors that tracks when one data descriptor could be used in place of another. An algorithm to compute the closure of such facts allows deducing new synonym facts from existing facts. E.g., for two 2D vectors u and v it is known that u.x is synonymous with v.x and u.y is synonymous with v.y, it can be deduced that u and v are synonymous. The closure computation algorithm is very expensive if we get large equivalence relations. This change addresses this in three ways: - The size of equivalence relations is reduced by limiting the extent to which the components of a composite are recursively noted as being equivalent, so that when we have large synonymous arrays we do not record all array elements as being pairwise equivalent. - When computing the closure of facts, equivalence classes above a certain size are simply skipped (which can lead to missed facts) - The closure computation is performed less frequently - it is invoked explicitly before fuzzer passes that will benefit from data synonym facts. A new transformation is used to control its invocation, so that fuzzing and replaying do not get out of sync. The change also tidies up the order in which some getters are declared in FuzzerContext.		2020-04-20 19:02:49 +01:00
..
spirvfuzz_protobufs.h	Add library for spirv-fuzz (#2618)	2019-05-27 14:34:55 +01:00
spvtoolsfuzz.proto	spirv-fuzz: Make handling of synonym facts more efficient (#3301)	2020-04-20 19:02:49 +01:00