forked from OSchip/llvm-project
remove some dead code
lib/Analysis/IPA/InlineCost.cpp | 18 ------------------ lib/Analysis/RegionPass.cpp | 1 - lib/Analysis/TypeBasedAliasAnalysis.cpp | 1 - lib/Transforms/Scalar/LoopUnswitch.cpp | 21 --------------------- lib/Transforms/Utils/LCSSA.cpp | 2 -- lib/Transforms/Utils/LoopSimplify.cpp | 6 ------ utils/TableGen/AsmWriterEmitter.cpp | 13 ------------- utils/TableGen/DFAPacketizerEmitter.cpp | 7 ------- utils/TableGen/IntrinsicEmitter.cpp | 2 -- 9 files changed, 71 deletions(-) llvm-svn: 206506
This commit is contained in:
parent
720c5ca4ea
commit
9ced19abe8
|
@ -97,9 +97,6 @@ class CallAnalyzer : public InstVisitor<CallAnalyzer, bool> {
|
|||
void disableSROA(Value *V);
|
||||
void accumulateSROACost(DenseMap<Value *, int>::iterator CostIt,
|
||||
int InstructionCost);
|
||||
bool handleSROACandidate(bool IsSROAValid,
|
||||
DenseMap<Value *, int>::iterator CostIt,
|
||||
int InstructionCost);
|
||||
bool isGEPOffsetConstant(GetElementPtrInst &GEP);
|
||||
bool accumulateGEPOffset(GEPOperator &GEP, APInt &Offset);
|
||||
bool simplifyCallSite(Function *F, CallSite CS);
|
||||
|
@ -225,21 +222,6 @@ void CallAnalyzer::accumulateSROACost(DenseMap<Value *, int>::iterator CostIt,
|
|||
SROACostSavings += InstructionCost;
|
||||
}
|
||||
|
||||
/// \brief Helper for the common pattern of handling a SROA candidate.
|
||||
/// Either accumulates the cost savings if the SROA remains valid, or disables
|
||||
/// SROA for the candidate.
|
||||
bool CallAnalyzer::handleSROACandidate(bool IsSROAValid,
|
||||
DenseMap<Value *, int>::iterator CostIt,
|
||||
int InstructionCost) {
|
||||
if (IsSROAValid) {
|
||||
accumulateSROACost(CostIt, InstructionCost);
|
||||
return true;
|
||||
}
|
||||
|
||||
disableSROA(CostIt);
|
||||
return false;
|
||||
}
|
||||
|
||||
/// \brief Check whether a GEP's indices are all constant.
|
||||
///
|
||||
/// Respects any simplified values known during the analysis of this callsite.
|
||||
|
|
|
@ -185,7 +185,6 @@ private:
|
|||
|
||||
public:
|
||||
static char ID;
|
||||
PrintRegionPass() : RegionPass(ID), Out(dbgs()) {}
|
||||
PrintRegionPass(const std::string &B, raw_ostream &o)
|
||||
: RegionPass(ID), Banner(B), Out(o) {}
|
||||
|
||||
|
|
|
@ -182,7 +182,6 @@ namespace {
|
|||
const MDNode *Node;
|
||||
|
||||
public:
|
||||
TBAAStructTagNode() : Node(nullptr) {}
|
||||
explicit TBAAStructTagNode(const MDNode *N) : Node(N) {}
|
||||
|
||||
/// Get the MDNode for this TBAAStructTagNode.
|
||||
|
|
|
@ -180,15 +180,6 @@ namespace {
|
|||
BranchesInfo.forgetLoop(currentLoop);
|
||||
}
|
||||
|
||||
/// RemoveLoopFromWorklist - If the specified loop is on the loop worklist,
|
||||
/// remove it.
|
||||
void RemoveLoopFromWorklist(Loop *L) {
|
||||
std::vector<Loop*>::iterator I = std::find(LoopProcessWorklist.begin(),
|
||||
LoopProcessWorklist.end(), L);
|
||||
if (I != LoopProcessWorklist.end())
|
||||
LoopProcessWorklist.erase(I);
|
||||
}
|
||||
|
||||
void initLoopData() {
|
||||
loopHeader = currentLoop->getHeader();
|
||||
loopPreheader = currentLoop->getLoopPreheader();
|
||||
|
@ -212,7 +203,6 @@ namespace {
|
|||
Instruction *InsertPt);
|
||||
|
||||
void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L);
|
||||
void RemoveLoopFromHierarchy(Loop *L);
|
||||
bool IsTrivialUnswitchCondition(Value *Cond, Constant **Val = 0,
|
||||
BasicBlock **LoopExit = 0);
|
||||
|
||||
|
@ -948,17 +938,6 @@ static void ReplaceUsesOfWith(Instruction *I, Value *V,
|
|||
++NumSimplify;
|
||||
}
|
||||
|
||||
/// RemoveLoopFromHierarchy - We have discovered that the specified loop has
|
||||
/// become unwrapped, either because the backedge was deleted, or because the
|
||||
/// edge into the header was removed. If the edge into the header from the
|
||||
/// latch block was removed, the loop is unwrapped but subloops are still alive,
|
||||
/// so they just reparent loops. If the loops are actually dead, they will be
|
||||
/// removed later.
|
||||
void LoopUnswitch::RemoveLoopFromHierarchy(Loop *L) {
|
||||
LPM->deleteLoopFromQueue(L);
|
||||
RemoveLoopFromWorklist(L);
|
||||
}
|
||||
|
||||
// RewriteLoopBodyWithConditionConstant - We know either that the value LIC has
|
||||
// the value specified by Val in the specified loop, or we know it does NOT have
|
||||
// that value. Rewrite any uses of LIC or of properties correlated to it.
|
||||
|
|
|
@ -267,8 +267,6 @@ struct LCSSA : public FunctionPass {
|
|||
}
|
||||
|
||||
private:
|
||||
bool processLoop(Loop &L);
|
||||
|
||||
void verifyAnalysis() const override;
|
||||
};
|
||||
}
|
||||
|
|
|
@ -761,12 +761,6 @@ namespace {
|
|||
|
||||
/// verifyAnalysis() - Verify LoopSimplifyForm's guarantees.
|
||||
void verifyAnalysis() const override;
|
||||
|
||||
private:
|
||||
bool ProcessLoop(Loop *L);
|
||||
BasicBlock *RewriteLoopExitBlock(Loop *L, BasicBlock *Exit);
|
||||
Loop *SeparateNestedLoop(Loop *L, BasicBlock *Preheader);
|
||||
BasicBlock *InsertUniqueBackedgeBlock(Loop *L, BasicBlock *Preheader);
|
||||
};
|
||||
}
|
||||
|
||||
|
|
|
@ -709,19 +709,6 @@ public:
|
|||
|
||||
return true;
|
||||
}
|
||||
|
||||
bool operator()(const IAPrinter &RHS) {
|
||||
if (Conds.size() < RHS.Conds.size())
|
||||
return true;
|
||||
|
||||
unsigned Idx = 0;
|
||||
for (std::vector<std::string>::iterator
|
||||
I = Conds.begin(), E = Conds.end(); I != E; ++I)
|
||||
if (*I != RHS.Conds[Idx++])
|
||||
return *I < RHS.Conds[Idx++];
|
||||
|
||||
return false;
|
||||
}
|
||||
};
|
||||
|
||||
} // end anonymous namespace
|
||||
|
|
|
@ -139,7 +139,6 @@ public:
|
|||
//
|
||||
// Modify the DFA.
|
||||
//
|
||||
void initialize();
|
||||
void addState(State *);
|
||||
|
||||
//
|
||||
|
@ -248,12 +247,6 @@ bool State::canAddInsnClass(unsigned InsnClass) const {
|
|||
}
|
||||
|
||||
|
||||
void DFA::initialize() {
|
||||
assert(currentState && "Missing current state");
|
||||
currentState->isInitial = true;
|
||||
}
|
||||
|
||||
|
||||
void DFA::addState(State *S) {
|
||||
assert(!states.count(S) && "State already exists");
|
||||
states.insert(S);
|
||||
|
|
|
@ -45,8 +45,6 @@ public:
|
|||
raw_ostream &OS);
|
||||
void EmitIntrinsicToOverloadTable(const std::vector<CodeGenIntrinsic> &Ints,
|
||||
raw_ostream &OS);
|
||||
void EmitVerifier(const std::vector<CodeGenIntrinsic> &Ints,
|
||||
raw_ostream &OS);
|
||||
void EmitGenerator(const std::vector<CodeGenIntrinsic> &Ints,
|
||||
raw_ostream &OS);
|
||||
void EmitAttributes(const std::vector<CodeGenIntrinsic> &Ints,
|
||||
|
|
Loading…
Reference in New Issue