Searched refs:isSame (Results 1 – 8 of 8) sorted by relevance
27 template <typename, typename> struct isSame {30 template <typename T> struct isSame<T, T> {33 static_assert(isSame<L, R>::value, "Type mismatches");
322 bool isSame; in RemoveDuplicates() local324 isSame = SearchEntry.getDir() == CurEntry.getDir(); in RemoveDuplicates()326 isSame = SearchEntry.getFrameworkDir() == CurEntry.getFrameworkDir(); in RemoveDuplicates()329 isSame = SearchEntry.getHeaderMap() == CurEntry.getHeaderMap(); in RemoveDuplicates()332 if (isSame) in RemoveDuplicates()
106 return N1.getType().isSame(N2.getType()); in isMatchingAllowed()
60 IsExactMatch = Matcher.getSupportedKind().isSame(NodeKind); in canConstructFrom()
606 if (Kind.isSame(DerivedKind) || !Kind.isBaseOf(DerivedKind)) {1024 if (!NK.getCladeKind().isSame(CladeNodeKind))
356 if (From.isSame(TypeKind) && To.isSame(QualKind)) return true; in canConvertTo()
582 assert(Implementation.getSupportedKind().isSame(668 assert(this->Implementation.getSupportedKind().isSame(840 if (SourceKind.isSame(ASTNodeKind::getFromNodeKind<Type>())) {
3671 bool isSame(ArrayRef<Value *> VL) const { in isSame() function in llvm::slpvectorizer::BoUpSLP::TreeEntry4242 if ((!SameVF || TE->getVectorFactor() == VL.size()) && TE->isSame(VL)) in getSameValuesTreeEntry()5390 Entries.front().front()->isSame(TE.Scalars)) { in findReusedOrderedScalars()7614 ((TE->ReorderIndices.empty() && OpTE->isSame(TE->Scalars)) || in reorderBottomToTop()7615 (OpTE->ReorderIndices.empty() && TE->isSame(OpTE->Scalars)))) in reorderBottomToTop()7622 ((TE->ReorderIndices.empty() && OpTE->isSame(TE->Scalars)) || in reorderBottomToTop()7623 (OpTE->ReorderIndices.empty() && TE->isSame(OpTE->Scalars)))) in reorderBottomToTop()9648 if (E->isSame(VL)) { in canBuildSplitNode()9964 if (E->isSame(VL)) { in getScalarsVectorizationLegality()11412 return VectorizableTree[Idx]->isSame(TE.Scalars); in reorderGatherNode()[all …]