llvm.org GIT mirror llvm / 07f099b
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(-) git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@206506 91177308-0d34-0410-b5e6-96231b3b80d8 Nuno Lopes 6 years ago
9 changed file(s) with 0 addition(s) and 71 deletion(s). Raw diff Collapse all Expand all
9696 void disableSROA(Value *V);
9797 void accumulateSROACost(DenseMap::iterator CostIt,
9898 int InstructionCost);
99 bool handleSROACandidate(bool IsSROAValid,
100 DenseMap::iterator CostIt,
101 int InstructionCost);
10299 bool isGEPOffsetConstant(GetElementPtrInst &GEP);
103100 bool accumulateGEPOffset(GEPOperator &GEP, APInt &Offset);
104101 bool simplifyCallSite(Function *F, CallSite CS);
224221 SROACostSavings += InstructionCost;
225222 }
226223
227 /// \brief Helper for the common pattern of handling a SROA candidate.
228 /// Either accumulates the cost savings if the SROA remains valid, or disables
229 /// SROA for the candidate.
230 bool CallAnalyzer::handleSROACandidate(bool IsSROAValid,
231 DenseMap::iterator CostIt,
232 int InstructionCost) {
233 if (IsSROAValid) {
234 accumulateSROACost(CostIt, InstructionCost);
235 return true;
236 }
237
238 disableSROA(CostIt);
239 return false;
240 }
241
242224 /// \brief Check whether a GEP's indices are all constant.
243225 ///
244226 /// Respects any simplified values known during the analysis of this callsite.
184184
185185 public:
186186 static char ID;
187 PrintRegionPass() : RegionPass(ID), Out(dbgs()) {}
188187 PrintRegionPass(const std::string &B, raw_ostream &o)
189188 : RegionPass(ID), Banner(B), Out(o) {}
190189
181181 const MDNode *Node;
182182
183183 public:
184 TBAAStructTagNode() : Node(nullptr) {}
185184 explicit TBAAStructTagNode(const MDNode *N) : Node(N) {}
186185
187186 /// Get the MDNode for this TBAAStructTagNode.
179179 BranchesInfo.forgetLoop(currentLoop);
180180 }
181181
182 /// RemoveLoopFromWorklist - If the specified loop is on the loop worklist,
183 /// remove it.
184 void RemoveLoopFromWorklist(Loop *L) {
185 std::vector::iterator I = std::find(LoopProcessWorklist.begin(),
186 LoopProcessWorklist.end(), L);
187 if (I != LoopProcessWorklist.end())
188 LoopProcessWorklist.erase(I);
189 }
190
191182 void initLoopData() {
192183 loopHeader = currentLoop->getHeader();
193184 loopPreheader = currentLoop->getLoopPreheader();
211202 Instruction *InsertPt);
212203
213204 void SimplifyCode(std::vector &Worklist, Loop *L);
214 void RemoveLoopFromHierarchy(Loop *L);
215205 bool IsTrivialUnswitchCondition(Value *Cond, Constant **Val = 0,
216206 BasicBlock **LoopExit = 0);
217207
945935 I->replaceAllUsesWith(V);
946936 I->eraseFromParent();
947937 ++NumSimplify;
948 }
949
950 /// RemoveLoopFromHierarchy - We have discovered that the specified loop has
951 /// become unwrapped, either because the backedge was deleted, or because the
952 /// edge into the header was removed. If the edge into the header from the
953 /// latch block was removed, the loop is unwrapped but subloops are still alive,
954 /// so they just reparent loops. If the loops are actually dead, they will be
955 /// removed later.
956 void LoopUnswitch::RemoveLoopFromHierarchy(Loop *L) {
957 LPM->deleteLoopFromQueue(L);
958 RemoveLoopFromWorklist(L);
959938 }
960939
961940 // RewriteLoopBodyWithConditionConstant - We know either that the value LIC has
266266 }
267267
268268 private:
269 bool processLoop(Loop &L);
270
271269 void verifyAnalysis() const override;
272270 };
273271 }
760760
761761 /// verifyAnalysis() - Verify LoopSimplifyForm's guarantees.
762762 void verifyAnalysis() const override;
763
764 private:
765 bool ProcessLoop(Loop *L);
766 BasicBlock *RewriteLoopExitBlock(Loop *L, BasicBlock *Exit);
767 Loop *SeparateNestedLoop(Loop *L, BasicBlock *Preheader);
768 BasicBlock *InsertUniqueBackedgeBlock(Loop *L, BasicBlock *Preheader);
769763 };
770764 }
771765
708708
709709 return true;
710710 }
711
712 bool operator()(const IAPrinter &RHS) {
713 if (Conds.size() < RHS.Conds.size())
714 return true;
715
716 unsigned Idx = 0;
717 for (std::vector::iterator
718 I = Conds.begin(), E = Conds.end(); I != E; ++I)
719 if (*I != RHS.Conds[Idx++])
720 return *I < RHS.Conds[Idx++];
721
722 return false;
723 }
724711 };
725712
726713 } // end anonymous namespace
138138 //
139139 // Modify the DFA.
140140 //
141 void initialize();
142141 void addState(State *);
143142
144143 //
244243 return true;
245244 }
246245 return false;
247 }
248
249
250 void DFA::initialize() {
251 assert(currentState && "Missing current state");
252 currentState->isInitial = true;
253246 }
254247
255248
4444 raw_ostream &OS);
4545 void EmitIntrinsicToOverloadTable(const std::vector &Ints,
4646 raw_ostream &OS);
47 void EmitVerifier(const std::vector &Ints,
48 raw_ostream &OS);
4947 void EmitGenerator(const std::vector &Ints,
5048 raw_ostream &OS);
5149 void EmitAttributes(const std::vector &Ints,