maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

[LV] Clean up trailing whitespace (NFC). 

Clean up some stray whitespace that sneaked in recently.
This commit is contained in:
Florian Hahn 2021-01-02 12:19:52 +00:00
parent d8af310063
commit c50f9b2351
No known key found for this signature in database
GPG Key ID: 61D7554B5CECDC0D
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
View File

@ -3012,7 +3012,7 @@ Value *InnerLoopVectorizer::getOrCreateVectorTripCount(Loop *L) {
// does not evenly divide the trip count, no adjustment is necessary since // does not evenly divide the trip count, no adjustment is necessary since
// there will already be scalar iterations. Note that the minimum iterations // there will already be scalar iterations. Note that the minimum iterations
// check ensures that N >= Step. The cases are: // check ensures that N >= Step. The cases are:
// 1) If there is a non-reversed interleaved group that may speculatively // 1) If there is a non-reversed interleaved group that may speculatively
// access memory out-of-bounds. // access memory out-of-bounds.
// 2) If any instruction may follow a conditionally taken exit. That is, if // 2) If any instruction may follow a conditionally taken exit. That is, if
// the loop contains multiple exiting blocks, or a single exiting block // the loop contains multiple exiting blocks, or a single exiting block
@ -5304,11 +5304,11 @@ void LoopVectorizationCostModel::collectLoopUniforms(ElementCount VF) {
auto isVectorizedMemAccessUse = [&](Instruction *I, Value *Ptr) -> bool { auto isVectorizedMemAccessUse = [&](Instruction *I, Value *Ptr) -> bool {
return getLoadStorePointerOperand(I) == Ptr && isUniformDecision(I, VF); return getLoadStorePointerOperand(I) == Ptr && isUniformDecision(I, VF);
}; };
// Holds a list of values which are known to have at least one uniform use. // Holds a list of values which are known to have at least one uniform use.
// Note that there may be other uses which aren't uniform. A "uniform use" // Note that there may be other uses which aren't uniform. A "uniform use"
// here is something which only demands lane 0 of the unrolled iterations; // here is something which only demands lane 0 of the unrolled iterations;
// it does not imply that all lanes produce the same value (e.g. this is not // it does not imply that all lanes produce the same value (e.g. this is not
// the usual meaning of uniform) // the usual meaning of uniform)
SmallPtrSet<Value *, 8> HasUniformUse; SmallPtrSet<Value *, 8> HasUniformUse;
@ -5515,7 +5515,7 @@ LoopVectorizationCostModel::computeMaxVF(ElementCount UserVF, unsigned UserIC) {
} }
// Now try the tail folding // Now try the tail folding
// Invalidate interleave groups that require an epilogue if we can't mask // Invalidate interleave groups that require an epilogue if we can't mask
// the interleave-group. // the interleave-group.
if (!useMaskedInterleavedAccesses(TTI)) { if (!useMaskedInterleavedAccesses(TTI)) {
@ -5568,7 +5568,7 @@ LoopVectorizationCostModel::computeMaxVF(ElementCount UserVF, unsigned UserIC) {
LLVM_DEBUG(dbgs() << "LV: Can't fold tail by masking: don't vectorize\n"); LLVM_DEBUG(dbgs() << "LV: Can't fold tail by masking: don't vectorize\n");
return None; return None;
} }
if (TC == 0) { if (TC == 0) {
reportVectorizationFailure( reportVectorizationFailure(
"Unable to calculate the loop count due to complex control flow", "Unable to calculate the loop count due to complex control flow",
@ -6276,7 +6276,7 @@ LoopVectorizationCostModel::calculateRegisterUsage(ArrayRef<ElementCount> VFs) {
} }
} }
} }
for (auto& pair : RegUsage) { for (auto& pair : RegUsage) {
if (MaxUsages[j].find(pair.first) != MaxUsages[j].end()) if (MaxUsages[j].find(pair.first) != MaxUsages[j].end())
MaxUsages[j][pair.first] = std::max(MaxUsages[j][pair.first], pair.second); MaxUsages[j][pair.first] = std::max(MaxUsages[j][pair.first], pair.second);
@ -6294,7 +6294,7 @@ LoopVectorizationCostModel::calculateRegisterUsage(ArrayRef<ElementCount> VFs) {
for (unsigned i = 0, e = VFs.size(); i < e; ++i) { for (unsigned i = 0, e = VFs.size(); i < e; ++i) {
SmallMapVector<unsigned, unsigned, 4> Invariant; SmallMapVector<unsigned, unsigned, 4> Invariant;
for (auto Inst : LoopInvariants) { for (auto Inst : LoopInvariants) {
unsigned Usage = unsigned Usage =
VFs[i].isScalar() ? 1 : GetRegUsage(Inst->getType(), VFs[i]); VFs[i].isScalar() ? 1 : GetRegUsage(Inst->getType(), VFs[i]);