@@ -15334,9 +15334,8 @@ BoUpSLP::isGatherShuffledSingleRegisterEntry(
1533415334 // tree.
1533515335 Entries.push_back(FirstEntries.front());
1533615336 // Update mapping between values and corresponding tree entries.
15337- for (auto &P : UsedValuesEntry) {
15337+ for (auto &P : UsedValuesEntry)
1533815338 P.second = 0;
15339- }
1534015339 VF = FirstEntries.front()->getVectorFactor();
1534115340 } else {
1534215341 // Try to find nodes with the same vector factor.
@@ -19309,9 +19308,8 @@ BoUpSLP::BlockScheduling::tryScheduleBundle(ArrayRef<Value *> VL, BoUpSLP *SLP,
1930919308 ReadyInsts.remove(BundleMember);
1931019309 if (ArrayRef<ScheduleBundle *> Bundles = getScheduleBundles(V);
1931119310 !Bundles.empty()) {
19312- for (ScheduleBundle *B : Bundles) {
19311+ for (ScheduleBundle *B : Bundles)
1931319312 ReadyInsts.remove(B);
19314- }
1931519313 }
1931619314
1931719315 if (!BundleMember->isScheduled())
@@ -20037,9 +20035,8 @@ bool BoUpSLP::collectValuesToDemote(
2003720035 if (Operands.empty()) {
2003820036 if (!IsTruncRoot)
2003920037 MaxDepthLevel = 1;
20040- for (Value *V : E.Scalars) {
20038+ for (Value *V : E.Scalars)
2004120039 (void)IsPotentiallyTruncated(V, BitWidth);
20042- }
2004320040 } else {
2004420041 // Several vectorized uses? Check if we can truncate it, otherwise -
2004520042 // exit.
@@ -21048,9 +21045,8 @@ bool SLPVectorizerPass::vectorizeStores(
2104821045 unsigned Repeat = 0;
2104921046 constexpr unsigned MaxAttempts = 4;
2105021047 OwningArrayRef<std::pair<unsigned, unsigned>> RangeSizes(Operands.size());
21051- for (std::pair<unsigned, unsigned> &P : RangeSizes) {
21048+ for (std::pair<unsigned, unsigned> &P : RangeSizes)
2105221049 P.first = P.second = 1;
21053- }
2105421050 DenseMap<Value *, std::pair<unsigned, unsigned>> NonSchedulable;
2105521051 auto IsNotVectorized = [](bool First,
2105621052 const std::pair<unsigned, unsigned> &P) {
@@ -21127,21 +21123,18 @@ bool SLPVectorizerPass::vectorizeStores(
2112721123 // If we vectorized initial block, no need to try to vectorize
2112821124 // it again.
2112921125 for (std::pair<unsigned, unsigned> &P :
21130- RangeSizes.slice(Cnt, Size)) {
21126+ RangeSizes.slice(Cnt, Size))
2113121127 P.first = P.second = 0;
21132- }
2113321128 if (Cnt < StartIdx + MinVF) {
2113421129 for (std::pair<unsigned, unsigned> &P :
21135- RangeSizes.slice(StartIdx, Cnt - StartIdx)) {
21130+ RangeSizes.slice(StartIdx, Cnt - StartIdx))
2113621131 P.first = P.second = 0;
21137- }
2113821132 StartIdx = Cnt + Size;
2113921133 }
2114021134 if (Cnt > Sz - Size - MinVF) {
2114121135 for (std::pair<unsigned, unsigned> &P :
21142- RangeSizes.slice(Cnt + Size, Sz - (Cnt + Size))) {
21136+ RangeSizes.slice(Cnt + Size, Sz - (Cnt + Size)))
2114321137 P.first = P.second = 0;
21144- }
2114521138 if (Sz == End)
2114621139 End = Cnt;
2114721140 Sz = Cnt;
0 commit comments