Index: llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp =================================================================== --- llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp +++ llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp @@ -2487,6 +2487,7 @@ // Make a new scheduling region, i.e. all existing ScheduleData is not // in the new region yet. ++SchedulingRegionID; + NoCalls = true; } ScheduleData *getScheduleData(Value *V) { @@ -2704,6 +2705,10 @@ // Make sure that the initial SchedulingRegionID is greater than the // initial SchedulingRegionID in ScheduleData (which is 0). int SchedulingRegionID = 1; + + /// Indicates that no CallInst found in the tree and we don't need to + /// calculate spill cost. + bool NoCalls = true; }; /// Attaches the BlockScheduling structures to basic blocks. @@ -5542,8 +5547,9 @@ } // Debug information does not impact spill cost. - if ((isa(&*PrevInstIt) && - !isa(&*PrevInstIt)) && + auto *CI = dyn_cast(&*PrevInstIt); + if ((CI && (!isa(CI) || !isa(CI) || + !CI->isLifetimeStartOrEnd())) && &*PrevInstIt != PrevInst) NumCalls++; @@ -5709,7 +5715,13 @@ } } - InstructionCost SpillCost = getSpillCost(); + bool NoCallInst = all_of(BlocksSchedules, + [](const decltype(BlocksSchedules)::value_type &BS) { + return BS.second->NoCalls; + }); + + InstructionCost SpillCost = NoCallInst ? 0 : getSpillCost(); + assert((!NoCallInst || getSpillCost() == 0) && "Incorrect spill cost"); Cost += SpillCost + ExtractCost; if (FirstUsers.size() == 1) { int Limit = ShuffleMask.front().size() * 2; @@ -7445,6 +7457,10 @@ } CurrentLoadStore = SD; } + auto *CI = dyn_cast(I); + if (CI && (!isa(I) || !isa(I) || + !CI->isLifetimeStartOrEnd())) + NoCalls = false; } if (NextLoadStore) { if (CurrentLoadStore)