Lines Matching defs:getVectorFactor
1458 VectorizableTree.front()->getVectorFactor());
1463 VectorizableTree.front()->getVectorFactor());
3282 unsigned getVectorFactor() const {
3448 unsigned FoundLane = getVectorFactor();
3466 assert(FoundLane < getVectorFactor() && "Unable to find given value.");
3742 if ((!SameVF || TE->getVectorFactor() == VL.size()) && TE->isSame(VL))
4756 unsigned Sz = getNumElems(TE.getVectorFactor(), PartSz, I);
4788 return std::max(Entries[I].front()->getVectorFactor(),
4789 Entries[I].back()->getVectorFactor());
5585 OrdersType Res(TE.getVectorFactor(), TE.getVectorFactor());
5587 for (int K = 0, E = TE.getVectorFactor() / Sz; K < E; ++K) {
5595 if (Sz == 2 && TE.getVectorFactor() == 4 &&
5597 2 * TE.getVectorFactor())) == 1)
5635 unsigned VF = TE.getVectorFactor();
5972 VFToOrderedEntries[TE->getVectorFactor()].insert(TE.get());
5988 VFToOrderedEntries[TE->getVectorFactor()].insert(TE.get());
6016 VFToOrderedEntries[TE->getVectorFactor()].insert(TE.get());
6028 for (unsigned VF = VectorizableTree.front()->getVectorFactor();
6079 if (OpTE->getVectorFactor() != OpTE->Scalars.size()) {
6443 unsigned VF = Data.second.front().second->getVectorFactor();
10356 unsigned VF = E1.getVectorFactor();
10362 VF = std::max(VF, E->getVectorFactor());
10378 VF = std::max(VF, E->getVectorFactor());
10484 unsigned VF = E->getVectorFactor();
10486 CommonVF = std::max(VF, E2->getVectorFactor());
10510 ExtraCost += GetNodeMinBWAffectedCost(*E, E->getVectorFactor()) +
10511 GetNodeMinBWAffectedCost(*E2, E2->getVectorFactor());
10518 unsigned VF = E->getVectorFactor();
10567 CommonVF = std::max(VF, E2->getVectorFactor());
10587 *E2, std::min(CommonVF, E2->getVectorFactor()));
10593 CommonVF = std::max(VF, E1->getVectorFactor());
10613 *E1, std::min(CommonVF, E1->getVectorFactor()));
10768 return Idx < static_cast<int>(E1.getVectorFactor());
10859 VF = std::max(VF, InTE->getVectorFactor());
10972 CastOpcode, getWidenedType(ScalarTy, E->getVectorFactor()),
10973 getWidenedType(EScalarTy, E->getVectorFactor()),
10979 getWidenedType(ScalarTy, E->getVectorFactor()));
10982 std::next(CommonMask.begin(), Idx + E->getVectorFactor()),
11093 unsigned EntryVF = E->getVectorFactor();
11962 VectorizableTree[0]->getVectorFactor() > 2)))
12066 (VectorizableTree[1]->getVectorFactor() <= 2 ||
12119 VectorizableTree.back()->getVectorFactor() > 2 &&
12124 VectorizableTree.back()->getVectorFactor()),
12125 APInt::getAllOnes(VectorizableTree.back()->getVectorFactor()),
12465 E && E->getVectorFactor() == TE.getVectorFactor()) {
12788 unsigned VecVF = TE->getVectorFactor();
12818 VF = TEs.front()->getVectorFactor();
12838 TEs.front()->getVectorFactor() == TEs.back()->getVectorFactor())
12839 VF = TEs.front()->getVectorFactor();
12858 [](const TreeEntry *E) { return E->getVectorFactor(); }, ResizeToVF,
12895 getWidenedType(Builder.getIntNTy(SrcSize), E.getVectorFactor());
12897 getWidenedType(Builder.getIntNTy(DstSize), E.getVectorFactor());
13253 ((*It)->getVectorFactor() == VL.size() ||
13254 ((*It)->getVectorFactor() == TE->Scalars.size() &&
13258 if ((*It)->getVectorFactor() == VL.size()) {
13274 VF = FirstEntries.front()->getVectorFactor();
13281 unsigned VF = TE->getVectorFactor();
13297 auto It = VFToTE.find(TE->getVectorFactor());
13313 VF = std::max(Entries.front()->getVectorFactor(),
13314 Entries.back()->getVectorFactor());
13316 VF = Entries.front()->getVectorFactor();
13633 SubEntries.front()->getVectorFactor() == VL.size() &&
14355 auto *ResVecTy = getWidenedType(ScalarTy, E->getVectorFactor());
14554 std::next(CommonMask.begin(), Idx + E->getVectorFactor()),
14738 unsigned VF = E->getVectorFactor();
14747 .slice(Idx, VectorizableTree[EIdx]->getVectorFactor()),
14936 return TE->getVectorFactor() == VF;
15113 FindReusedSplat(VecMask, TEs.front()->getVectorFactor(), I,
18205 unsigned VF = E.getVectorFactor();