@@ -9362,7 +9362,8 @@ void BoUpSLP::reorderGatherNode(TreeEntry &TE) {
93629362
93639363 auto GenerateLoadsSubkey = [&](size_t Key, LoadInst *LI) {
93649364 Key = hash_combine(hash_value(LI->getParent()), Key);
9365- Value *Ptr = getUnderlyingObject(LI->getPointerOperand(), RecursionMaxDepth);
9365+ Value *Ptr =
9366+ getUnderlyingObject(LI->getPointerOperand(), RecursionMaxDepth);
93669367 if (LoadKeyUsed.contains(Key)) {
93679368 auto LIt = LoadsMap.find(std::make_pair(Key, Ptr));
93689369 if (LIt != LoadsMap.end()) {
@@ -10408,7 +10409,8 @@ class BoUpSLP::ShuffleCostEstimator : public BaseShuffleAnalysis {
1040810409 for (unsigned Part : seq<unsigned>(NumParts)) {
1040910410 unsigned Limit = getNumElems(VL.size(), SliceSize, Part);
1041010411 ArrayRef<int> SubMask = Mask.slice(Part * SliceSize, Limit);
10411- for (auto [I, V] : enumerate(ArrayRef(VL).slice(Part * SliceSize, Limit))) {
10412+ for (auto [I, V] :
10413+ enumerate(ArrayRef(VL).slice(Part * SliceSize, Limit))) {
1041210414 // Ignore non-extractelement scalars.
1041310415 if (isa<UndefValue>(V) ||
1041410416 (!SubMask.empty() && SubMask[I] == PoisonMaskElem))
@@ -14305,7 +14307,7 @@ ResTy BoUpSLP::processBuildVector(const TreeEntry *E, Type *ScalarTy,
1430514307 // Transform non-clustered elements in the mask to poison (-1).
1430614308 // "Clustered" operations will be reordered using this mask later.
1430714309 if (!SubVectors.empty() && !SubVectorsMask.empty()) {
14308- for (unsigned I: seq<unsigned>(GatheredScalars.size()))
14310+ for (unsigned I : seq<unsigned>(GatheredScalars.size()))
1430914311 if (E->Scalars[I] == GatheredScalars[ReorderMask[I]])
1431014312 SubVectorsMask[ReorderMask[I]] = PoisonMaskElem;
1431114313 } else {
0 commit comments