@@ -6853,7 +6853,7 @@ class HorizontalReduction {
6853
6853
BoUpSLP::ExtraValueToDebugLocsMap ExternallyUsedValues;
6854
6854
// The same extra argument may be used several times, so log each attempt
6855
6855
// to use it.
6856
- for (std::pair<Instruction *, Value *> &Pair : ExtraArgs) {
6856
+ for (const std::pair<Instruction *, Value *> &Pair : ExtraArgs) {
6857
6857
assert (Pair.first && " DebugLoc must be set." );
6858
6858
ExternallyUsedValues[Pair.second ].push_back (Pair.first );
6859
6859
}
@@ -6908,7 +6908,7 @@ class HorizontalReduction {
6908
6908
Value *VectorizedTree = nullptr ;
6909
6909
unsigned i = 0 ;
6910
6910
while (i < NumReducedVals - ReduxWidth + 1 && ReduxWidth > 2 ) {
6911
- ArrayRef<Value *> VL = makeArrayRef (&ReducedVals[i], ReduxWidth);
6911
+ ArrayRef<Value *> VL (&ReducedVals[i], ReduxWidth);
6912
6912
V.buildTree (VL, ExternallyUsedValues, IgnoreList);
6913
6913
Optional<ArrayRef<unsigned >> Order = V.bestOrder ();
6914
6914
if (Order) {
@@ -7664,7 +7664,7 @@ bool SLPVectorizerPass::vectorizeGEPIndices(BasicBlock *BB, BoUpSLP &R) {
7664
7664
unsigned MaxElts = MaxVecRegSize / EltSize;
7665
7665
for (unsigned BI = 0 , BE = Entry.second .size (); BI < BE; BI += MaxElts) {
7666
7666
auto Len = std::min<unsigned >(BE - BI, MaxElts);
7667
- auto GEPList = makeArrayRef (&Entry.second [BI], Len);
7667
+ ArrayRef<GetElementPtrInst *> GEPList (&Entry.second [BI], Len);
7668
7668
7669
7669
// Initialize a set a candidate getelementptrs. Note that we use a
7670
7670
// SetVector here to preserve program order. If the index computations
0 commit comments