Lines Matching defs:InVectors

10121   SmallVector<PointerUnion<Value *, const TreeEntry *>, 2> InVectors;
10332       if ((InVectors.size() == 2 &&
10333            cast<const TreeEntry *>(InVectors.front()) == &E1 &&
10334            cast<const TreeEntry *>(InVectors.back()) == E2) ||
10335           (!E2 && cast<const TreeEntry *>(InVectors.front()) == &E1)) {
10346       Cost += createShuffle(InVectors.front(),
10347                             InVectors.size() == 1 ? nullptr : InVectors.back(),
10350     } else if (InVectors.size() == 2) {
10351       Cost += createShuffle(InVectors.front(), InVectors.back(), CommonMask);
10355     if (!E2 && InVectors.size() == 1) {
10357       if (Value *V1 = InVectors.front().dyn_cast<Value *>()) {
10361         const auto *E = cast<const TreeEntry *>(InVectors.front());
10367       Cost += createShuffle(InVectors.front(), &E1, CommonMask);
10370       auto P = InVectors.front();
10382           CommonMask[Idx] = Idx + (InVectors.empty() ? 0 : VF);
10383       Cost += createShuffle(P, InVectors.front(), CommonMask);
10638     InVectors.front() =
10640     if (InVectors.size() == 2)
10641       InVectors.pop_back();
10745     InVectors.assign(1, E);
10774     if (InVectors.empty()) {
10776       InVectors.assign({&E1, &E2});
10789     if (InVectors.empty()) {
10791       InVectors.assign(1, &E1);
10802     if (!SameNodesEstimated && InVectors.size() == 1)
10803       InVectors.emplace_back(&E1);
10809     assert(InVectors.size() == 1 &&
10815                         cast<const TreeEntry *>(InVectors.front())
10824     if (InVectors.empty()) {
10828       InVectors.assign(1, V1);
10833       assert(InVectors.size() == 1 && isa<const TreeEntry *>(InVectors[0]) &&
10837                       Value *Scalar = cast<const TreeEntry *>(InVectors[0])
10850     assert(!InVectors.empty() && !CommonMask.empty() &&
10853     if (InVectors.size() == 2) {
10854       Cost += createShuffle(InVectors.front(), InVectors.back(), CommonMask);
10858                    InVectors.front().dyn_cast<const TreeEntry *>()) {
10862           VF, cast<FixedVectorType>(cast<Value *>(InVectors.front())->getType())
10865     InVectors.push_back(V1);
10922       const PointerUnion<Value *, const TreeEntry *> &Vec = InVectors.front();
10923       if (InVectors.size() == 2)
10924         Cost += createShuffle(Vec, InVectors.back(), CommonMask);
10932       InVectors.front() = V;
10935       const PointerUnion<Value *, const TreeEntry *> &Vec = InVectors.front();
10936       if (InVectors.size() == 2)
10937         Cost += createShuffle(Vec, InVectors.back(), CommonMask);
11002       assert(InVectors.size() == 1 && "Expected only one vector with no mask");
11006            createShuffle(InVectors.front(),
11007                          InVectors.size() == 2 ? InVectors.back() : nullptr,
14086   SmallVector<Value *, 2> InVectors;
14403     if (InVectors.empty()) {
14404       InVectors.push_back(V1);
14405       InVectors.push_back(V2);
14409     Value *Vec = InVectors.front();
14410     if (InVectors.size() == 2) {
14411       Vec = createShuffle(Vec, InVectors.back(), CommonMask);
14423     InVectors.front() = Vec;
14424     if (InVectors.size() == 2)
14425       InVectors.back() = V1;
14427       InVectors.push_back(V1);
14434     if (InVectors.empty()) {
14435       InVectors.push_back(V1);
14439     const auto *It = find(InVectors, V1);
14440     if (It == InVectors.end()) {
14441       if (InVectors.size() == 2 ||
14442           InVectors.front()->getType() != V1->getType()) {
14443         Value *V = InVectors.front();
14444         if (InVectors.size() == 2) {
14445           V = createShuffle(InVectors.front(), InVectors.back(), CommonMask);
14449           V = createShuffle(InVectors.front(), nullptr, CommonMask);
14462         InVectors.front() = V;
14463         if (InVectors.size() == 2)
14464           InVectors.back() = V1;
14466           InVectors.push_back(V1);
14473           InVectors.push_back(V1);
14478     for (Value *V : InVectors)
14482         CommonMask[Idx] = Mask[Idx] + (It == InVectors.begin() ? 0 : VF);
14508       Value *Vec = InVectors.front();
14509       if (InVectors.size() == 2) {
14510         Vec = createShuffle(Vec, InVectors.back(), CommonMask);
14511         InVectors.pop_back();
14525       InVectors.front() = Vec;
14528       Value *Vec = InVectors.front();
14529       if (InVectors.size() == 2) {
14530         Vec = createShuffle(Vec, InVectors.back(), CommonMask);
14531         InVectors.pop_back();
14576       InVectors.front() = Vec;
14593       assert(InVectors.size() == 1 && "Expected only one vector with no mask");
14594       return InVectors.front();
14596     if (InVectors.size() == 2)
14597       return createShuffle(InVectors.front(), InVectors.back(), CommonMask);
14598     return createShuffle(InVectors.front(), nullptr, CommonMask);