6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-07-17 18:24:34 +00:00
Code Issues Projects Releases Wiki Activity

Generic reformatting and comment fixing. No functionality change.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@94771 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Bill Wendling
2010-01-29 00:52:43 +00:00
parent 9f9113a44b
commit 466f37befb
1 changed files with 20 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
lib/Transforms/Scalar/LoopStrengthReduce.cpp
View File

@@ -1066,10 +1066,10 @@ static bool isNonConstantNegative(const SCEV *Expr) {
/// progressively move information from the Base field to the Imm field, until /// progressively move information from the Base field to the Imm field, until
/// we eventually have the full access expression to rewrite the use. /// we eventually have the full access expression to rewrite the use.
const SCEV *LoopStrengthReduce::CollectIVUsers(const SCEV *Stride, const SCEV *LoopStrengthReduce::CollectIVUsers(const SCEV *Stride,
IVUsersOfOneStride &Uses, IVUsersOfOneStride &Uses,
Loop *L, Loop *L,
bool &AllUsesAreAddresses, bool &AllUsesAreAddresses,
bool &AllUsesAreOutsideLoop, bool &AllUsesAreOutsideLoop,
std::vector<BasedUser> &UsersToProcess) { std::vector<BasedUser> &UsersToProcess) {
// FIXME: Generalize to non-affine IV's. // FIXME: Generalize to non-affine IV's.
if (!Stride->isLoopInvariant(L)) if (!Stride->isLoopInvariant(L))
@@ -1460,10 +1460,10 @@ LoopStrengthReduce::StrengthReduceIVUsersOfStride(const SCEV *Stride,
bool AllUsesAreOutsideLoop = true; bool AllUsesAreOutsideLoop = true;
// Transform our list of users and offsets to a bit more complex table. In // Transform our list of users and offsets to a bit more complex table. In
// this new vector, each 'BasedUser' contains 'Base' the base of the // this new vector, each 'BasedUser' contains 'Base' the base of the strided
// strided accessas well as the old information from Uses. We progressively // access as well as the old information from Uses. We progressively move
// move information from the Base field to the Imm field, until we eventually // information from the Base field to the Imm field until we eventually have
// have the full access expression to rewrite the use. // the full access expression to rewrite the use.
std::vector<BasedUser> UsersToProcess; std::vector<BasedUser> UsersToProcess;
const SCEV *CommonExprs = CollectIVUsers(Stride, Uses, L, AllUsesAreAddresses, const SCEV *CommonExprs = CollectIVUsers(Stride, Uses, L, AllUsesAreAddresses,
AllUsesAreOutsideLoop, AllUsesAreOutsideLoop,
@@ -1521,7 +1521,7 @@ LoopStrengthReduce::StrengthReduceIVUsersOfStride(const SCEV *Stride,
// //
DEBUG(dbgs() << "LSR: Examining IVs of TYPE " << *ReplacedTy << " of STRIDE " DEBUG(dbgs() << "LSR: Examining IVs of TYPE " << *ReplacedTy << " of STRIDE "
<< *Stride << ":\n" << *Stride << ":\n"
<< " Common base: " << *CommonExprs << "\n"); << " Common base: " << *CommonExprs << '\n');
SCEVExpander Rewriter(*SE); SCEVExpander Rewriter(*SE);
SCEVExpander PreheaderRewriter(*SE); SCEVExpander PreheaderRewriter(*SE);
@@ -1808,14 +1808,14 @@ namespace {
/// ///
/// loop: /// loop:
/// ... /// ...
/// v1 = v1 + 3 /// v1 = v1 + 3
/// v2 = v2 + 1 /// v2 = v2 + 1
/// if (v2 < 10) goto loop /// if (v2 < 10) goto loop
/// => /// =>
/// loop: /// loop:
/// ... /// ...
/// v1 = v1 + 3 /// v1 = v1 + 3
/// if (v1 < 30) goto loop /// if (v1 < 30) goto loop
ICmpInst *LoopStrengthReduce::ChangeCompareStride(Loop *L, ICmpInst *Cond, ICmpInst *LoopStrengthReduce::ChangeCompareStride(Loop *L, ICmpInst *Cond,
IVStrideUse* &CondUse, IVStrideUse* &CondUse,
const SCEV* &CondStride, const SCEV* &CondStride,
@@ -1823,13 +1823,14 @@ ICmpInst *LoopStrengthReduce::ChangeCompareStride(Loop *L, ICmpInst *Cond,
// If there's only one stride in the loop, there's nothing to do here. // If there's only one stride in the loop, there's nothing to do here.
if (IU->StrideOrder.size() < 2) if (IU->StrideOrder.size() < 2)
return Cond; return Cond;
// If there are other users of the condition's stride, don't bother
// trying to change the condition because the stride will still // If there are other users of the condition's stride, don't bother trying to
// remain. // change the condition because the stride will still remain.
std::map<const SCEV *, IVUsersOfOneStride *>::iterator I = std::map<const SCEV *, IVUsersOfOneStride *>::iterator I =
IU->IVUsesByStride.find(CondStride); IU->IVUsesByStride.find(CondStride);
if (I == IU->IVUsesByStride.end()) if (I == IU->IVUsesByStride.end())
return Cond; return Cond;
if (I->second->Users.size() > 1) { if (I->second->Users.size() > 1) {
for (ilist<IVStrideUse>::iterator II = I->second->Users.begin(), for (ilist<IVStrideUse>::iterator II = I->second->Users.begin(),
EE = I->second->Users.end(); II != EE; ++II) { EE = I->second->Users.end(); II != EE; ++II) {
@@ -1839,6 +1840,7 @@ ICmpInst *LoopStrengthReduce::ChangeCompareStride(Loop *L, ICmpInst *Cond,
return Cond; return Cond;
} }
} }
// Only handle constant strides for now. // Only handle constant strides for now.
const SCEVConstant *SC = dyn_cast<SCEVConstant>(CondStride); const SCEVConstant *SC = dyn_cast<SCEVConstant>(CondStride);
if (!SC) return Cond; if (!SC) return Cond;
@@ -1860,8 +1862,7 @@ ICmpInst *LoopStrengthReduce::ChangeCompareStride(Loop *L, ICmpInst *Cond,
if (ConstantInt *C = dyn_cast<ConstantInt>(Cond->getOperand(1))) { if (ConstantInt *C = dyn_cast<ConstantInt>(Cond->getOperand(1))) {
int64_t CmpVal = C->getValue().getSExtValue(); int64_t CmpVal = C->getValue().getSExtValue();
// Check the relevant induction variable for conformance to // Check the relevant induction variable for conformance to the pattern.
// the pattern.
const SCEV *IV = SE->getSCEV(Cond->getOperand(0)); const SCEV *IV = SE->getSCEV(Cond->getOperand(0));
const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(IV); const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(IV);
if (!AR || !AR->isAffine()) if (!AR || !AR->isAffine())