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

Make a few more DataLayout variables const.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@202155 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Rafael Espindola
2014-02-25 14:24:11 +00:00
parent a2ff58121a
commit 37ecf69cbf
2 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
lib/Transforms/IPO/MergeFunctions.cpp
View File

@@ -606,7 +606,7 @@ private:
FnSetType FnSet; FnSetType FnSet;
/// DataLayout for more accurate GEP comparisons. May be NULL. /// DataLayout for more accurate GEP comparisons. May be NULL.
DataLayout *DL; const DataLayout *DL;
/// Whether or not the target supports global aliases. /// Whether or not the target supports global aliases.
bool HasGlobalAliases; bool HasGlobalAliases;

8
lib/Transforms/Vectorize/SLPVectorizer.cpp
View File

@@ -344,7 +344,7 @@ public:
typedef SmallPtrSet<Value *, 16> ValueSet; typedef SmallPtrSet<Value *, 16> ValueSet;
typedef SmallVector<StoreInst *, 8> StoreList; typedef SmallVector<StoreInst *, 8> StoreList;
BoUpSLP(Function *Func, ScalarEvolution *Se, DataLayout *Dl, BoUpSLP(Function *Func, ScalarEvolution *Se, const DataLayout *Dl,
TargetTransformInfo *Tti, AliasAnalysis *Aa, LoopInfo *Li, TargetTransformInfo *Tti, AliasAnalysis *Aa, LoopInfo *Li,
DominatorTree *Dt) : DominatorTree *Dt) :
F(Func), SE(Se), DL(Dl), TTI(Tti), AA(Aa), LI(Li), DT(Dt), F(Func), SE(Se), DL(Dl), TTI(Tti), AA(Aa), LI(Li), DT(Dt),
@@ -533,7 +533,7 @@ private:
// Analysis and block reference. // Analysis and block reference.
Function *F; Function *F;
ScalarEvolution *SE; ScalarEvolution *SE;
DataLayout *DL; const DataLayout *DL;
TargetTransformInfo *TTI; TargetTransformInfo *TTI;
AliasAnalysis *AA; AliasAnalysis *AA;
LoopInfo *LI; LoopInfo *LI;
@@ -1784,7 +1784,7 @@ struct SLPVectorizer : public FunctionPass {
} }
ScalarEvolution *SE; ScalarEvolution *SE;
DataLayout *DL; const DataLayout *DL;
TargetTransformInfo *TTI; TargetTransformInfo *TTI;
AliasAnalysis *AA; AliasAnalysis *AA;
LoopInfo *LI; LoopInfo *LI;
@@ -2234,7 +2234,7 @@ public:
/// \brief Try to find a reduction tree. /// \brief Try to find a reduction tree.
bool matchAssociativeReduction(PHINode *Phi, BinaryOperator *B, bool matchAssociativeReduction(PHINode *Phi, BinaryOperator *B,
DataLayout *DL) { const DataLayout *DL) {
assert((!Phi || assert((!Phi ||
std::find(Phi->op_begin(), Phi->op_end(), B) != Phi->op_end()) && std::find(Phi->op_begin(), Phi->op_end(), B) != Phi->op_end()) &&
"Thi phi needs to use the binary operator"); "Thi phi needs to use the binary operator");