| /third_party/skia/third_party/externals/spirv-tools/test/fuzz/ |
| D | equivalence_relation_test.cpp | 69 ASSERT_TRUE(relation.IsEquivalent(0, element)); in TEST()
70 ASSERT_TRUE(relation.IsEquivalent(element, element + 2)); in TEST()
84 ASSERT_TRUE(relation.IsEquivalent(1, element)); in TEST()
85 ASSERT_TRUE(relation.IsEquivalent(element, element + 2)); in TEST()
98 ASSERT_TRUE(relation.IsEquivalent(81, element)); in TEST()
99 ASSERT_TRUE(relation.IsEquivalent(element, element + 2)); in TEST()
|
| /third_party/spirv-tools/test/fuzz/ |
| D | equivalence_relation_test.cpp | 69 ASSERT_TRUE(relation.IsEquivalent(0, element)); in TEST()
70 ASSERT_TRUE(relation.IsEquivalent(element, element + 2)); in TEST()
84 ASSERT_TRUE(relation.IsEquivalent(1, element)); in TEST()
85 ASSERT_TRUE(relation.IsEquivalent(element, element + 2)); in TEST()
98 ASSERT_TRUE(relation.IsEquivalent(81, element)); in TEST()
99 ASSERT_TRUE(relation.IsEquivalent(element, element + 2)); in TEST()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/fuzz/ |
| D | equivalence_relation_test.cpp | 69 ASSERT_TRUE(relation.IsEquivalent(0, element)); in TEST()
70 ASSERT_TRUE(relation.IsEquivalent(element, element + 2)); in TEST()
84 ASSERT_TRUE(relation.IsEquivalent(1, element)); in TEST()
85 ASSERT_TRUE(relation.IsEquivalent(element, element + 2)); in TEST()
98 ASSERT_TRUE(relation.IsEquivalent(81, element)); in TEST()
99 ASSERT_TRUE(relation.IsEquivalent(element, element + 2)); in TEST()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/fact_manager/ |
| D | data_synonym_and_id_equation_facts.cpp | 165 if (!synonymous_.IsEquivalent(lhs_dd, *rhs_dds[0])) { in AddEquationFactRecursive()
174 if (synonymous_.IsEquivalent(*equation.operands[1], *rhs_dds[1])) { in AddEquationFactRecursive()
184 if (synonymous_.IsEquivalent(*equation.operands[1], *rhs_dds[0])) { in AddEquationFactRecursive()
198 if (synonymous_.IsEquivalent(*equation.operands[0], *rhs_dds[1])) { in AddEquationFactRecursive()
203 if (synonymous_.IsEquivalent(*equation.operands[1], *rhs_dds[1])) { in AddEquationFactRecursive()
212 if (synonymous_.IsEquivalent(*equation.operands[0], *rhs_dds[1])) { in AddEquationFactRecursive()
224 if (synonymous_.IsEquivalent(*equation.operands[0], *rhs_dds[0])) { in AddEquationFactRecursive()
230 if (synonymous_.IsEquivalent(*equation.operands[1], *rhs_dds[0])) { in AddEquationFactRecursive()
239 if (synonymous_.IsEquivalent(*equation.operands[0], *rhs_dds[0])) { in AddEquationFactRecursive()
323 if (synonymous_.IsEquivalent(*equation.operands[0], dd)) { in ComputeConversionDataSynonymFacts()
[all …]
|
| /third_party/skia/third_party/externals/spirv-tools/source/fuzz/fact_manager/ |
| D | data_synonym_and_id_equation_facts.cpp | 165 if (!synonymous_.IsEquivalent(lhs_dd, *rhs_dds[0])) { in AddEquationFactRecursive()
174 if (synonymous_.IsEquivalent(*equation.operands[1], *rhs_dds[1])) { in AddEquationFactRecursive()
184 if (synonymous_.IsEquivalent(*equation.operands[1], *rhs_dds[0])) { in AddEquationFactRecursive()
198 if (synonymous_.IsEquivalent(*equation.operands[0], *rhs_dds[1])) { in AddEquationFactRecursive()
203 if (synonymous_.IsEquivalent(*equation.operands[1], *rhs_dds[1])) { in AddEquationFactRecursive()
212 if (synonymous_.IsEquivalent(*equation.operands[0], *rhs_dds[1])) { in AddEquationFactRecursive()
224 if (synonymous_.IsEquivalent(*equation.operands[0], *rhs_dds[0])) { in AddEquationFactRecursive()
230 if (synonymous_.IsEquivalent(*equation.operands[1], *rhs_dds[0])) { in AddEquationFactRecursive()
239 if (synonymous_.IsEquivalent(*equation.operands[0], *rhs_dds[0])) { in AddEquationFactRecursive()
323 if (synonymous_.IsEquivalent(*equation.operands[0], dd)) { in ComputeConversionDataSynonymFacts()
[all …]
|
| /third_party/spirv-tools/source/fuzz/fact_manager/ |
| D | data_synonym_and_id_equation_facts.cpp | 165 if (!synonymous_.IsEquivalent(lhs_dd, *rhs_dds[0])) { in AddEquationFactRecursive()
174 if (synonymous_.IsEquivalent(*equation.operands[1], *rhs_dds[1])) { in AddEquationFactRecursive()
184 if (synonymous_.IsEquivalent(*equation.operands[1], *rhs_dds[0])) { in AddEquationFactRecursive()
198 if (synonymous_.IsEquivalent(*equation.operands[0], *rhs_dds[1])) { in AddEquationFactRecursive()
203 if (synonymous_.IsEquivalent(*equation.operands[1], *rhs_dds[1])) { in AddEquationFactRecursive()
212 if (synonymous_.IsEquivalent(*equation.operands[0], *rhs_dds[1])) { in AddEquationFactRecursive()
224 if (synonymous_.IsEquivalent(*equation.operands[0], *rhs_dds[0])) { in AddEquationFactRecursive()
230 if (synonymous_.IsEquivalent(*equation.operands[1], *rhs_dds[0])) { in AddEquationFactRecursive()
239 if (synonymous_.IsEquivalent(*equation.operands[0], *rhs_dds[0])) { in AddEquationFactRecursive()
323 if (synonymous_.IsEquivalent(*equation.operands[0], dd)) { in ComputeConversionDataSynonymFacts()
[all …]
|
| /third_party/skia/third_party/externals/spirv-tools/source/fuzz/ |
| D | equivalence_relation.h | 162 bool IsEquivalent(const T& value1, const T& value2) const { in IsEquivalent() function
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/ |
| D | equivalence_relation.h | 162 bool IsEquivalent(const T& value1, const T& value2) const { in IsEquivalent() function
|
| /third_party/spirv-tools/source/fuzz/ |
| D | equivalence_relation.h | 162 bool IsEquivalent(const T& value1, const T& value2) const { in IsEquivalent() function
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | CommandLine.cpp | 1163 auto IsEquivalent = [FName, &FS](const ResponseFileRecord &RFile) { in ExpandResponseFiles() local
1180 if (std::any_of(FileStack.begin() + 1, FileStack.end(), IsEquivalent)) { in ExpandResponseFiles()
|
| /third_party/cef/libcef/common/ |
| D | request_impl.cc | 370 if (!new_site.IsEquivalent(site_for_cookies_)) { in SetFirstPartyForCookies()
|