/external/llvm/include/llvm/Analysis/ |
Interval.h | 44 typedef std::vector<BasicBlock*>::iterator pred_iterator; typedef in class:llvm::Interval 115 /// just like BasicBlocks can with the pred_* functions, and *::pred_iterator. 117 inline Interval::pred_iterator pred_begin(Interval *I) { 120 inline Interval::pred_iterator pred_end(Interval *I) { 141 typedef Interval::pred_iterator ChildIteratorType;
|
/external/llvm/include/llvm/Support/ |
PredIteratorCache.h | 1 //===- llvm/Support/PredIteratorCache.h - pred_iterator Cache ---*- C++ -*-===// 41 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
|
CFG.h | 25 // BasicBlock pred_iterator definition 56 assert(!It.atEnd() && "pred_iterator out of range!"); 62 assert(!It.atEnd() && "pred_iterator out of range!"); 84 typedef PredIterator<BasicBlock, Value::use_iterator> pred_iterator; typedef in namespace:llvm 88 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } 92 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} 290 typedef pred_iterator ChildIteratorType;
|
/external/llvm/lib/Analysis/ |
RegionInfo.cpp | 173 for (pred_iterator PI = pred_begin(entry), PE = pred_end(entry); PI != PE; 195 for (pred_iterator PI = pred_begin(exit), PE = pred_end(exit); PI != PE; 248 for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB); SI != SE; ++SI) 403 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); 421 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit()); 485 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) { 784 for (pred_iterator PI = pred_begin(Exit), PE = pred_end(Exit); PI != PE;
|
Interval.cpp | 32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode);
|
ProfileEstimatorPass.cpp | 131 for ( pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); 370 for (pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB);
|
LoopInfo.cpp | 146 pred_iterator PI = pred_begin(H); 348 for (pred_iterator PI = pred_begin(ExitBlocks[i]), 382 pred_iterator PI = pred_begin(*I);
|
/external/llvm/lib/Transforms/Scalar/ |
CorrelatedValuePropagation.cpp | 171 pred_iterator PI = pred_begin(C->getParent()), PE = pred_end(C->getParent()); 215 pred_iterator PB = pred_begin(BB), PE = pred_end(BB); 228 for (pred_iterator PI = PB; PI != PE; ++PI) {
|
JumpThreading.cpp | 342 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 366 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { 521 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB);PI != E; ++PI){ 595 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 750 pred_iterator PI = pred_begin(BB), PE = pred_end(BB); [all...] |
SimplifyCFGPass.cpp | 279 pred_iterator PB = pred_begin(RetBlock), PE = pred_end(RetBlock); 284 for (pred_iterator PI = PB; PI != PE; ++PI)
|
TailRecursionElimination.cpp | 568 pred_iterator PB = pred_begin(OldEntry), PE = pred_end(OldEntry); 580 for (pred_iterator PI = PB; PI != PE; ++PI) { 635 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) {
|
/external/llvm/lib/Transforms/Utils/ |
LoopSimplify.cpp | 158 for (pred_iterator PI = pred_begin(*BB), 231 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock); 376 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header); 419 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit); I != E; ++I) { 460 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { 615 for (pred_iterator PI=pred_begin(Header), E = pred_end(Header); PI!=E; ++PI) { 670 for (pred_iterator I = pred_begin(Header), E = pred_end(Header); I != E; ++I){ 774 for (pred_iterator PI = pred_begin(L->getHeader()),
|
SSAUpdater.cpp | 97 // We can get our predecessor info by walking the pred_iterator list, but it 114 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) { 245 // We can get our predecessor info by walking the pred_iterator list, 252 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
|
BreakCriticalEdges.cpp | 236 for (pred_iterator I = pred_begin(DestBB), E = pred_end(DestBB); 326 for (pred_iterator I = pred_begin(Exit), E = pred_end(Exit);
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
ExplodedGraph.h | 206 typedef ExplodedNode* const * pred_iterator; typedef in class:clang::ento::ExplodedNode 209 pred_iterator pred_begin() { return Preds.begin(); } 210 pred_iterator pred_end() { return Preds.end(); }
|
/external/llvm/include/llvm/CodeGen/ |
MachineBasicBlock.h | 247 typedef std::vector<MachineBasicBlock *>::iterator pred_iterator; typedef in class:llvm::MachineBasicBlock 260 pred_iterator pred_begin() { return Predecessors.begin(); } 262 pred_iterator pred_end() { return Predecessors.end(); } 710 typedef MachineBasicBlock::pred_iterator ChildIteratorType;
|
/external/llvm/lib/CodeGen/ |
LiveRangeCalc.cpp | 205 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(), 319 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(),
|
MachineSSAUpdater.cpp | 161 for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(), 286 for (MachineBasicBlock::pred_iterator PI = BB->pred_begin(),
|
ScheduleDAG.cpp | 302 SUnit::pred_iterator BestI = Preds.begin(); 304 for (SUnit::pred_iterator 606 for (SUnit::pred_iterator
|
MachineBlockPlacement.cpp | 372 for (MachineBasicBlock::pred_iterator PI = (*SI)->pred_begin(), 571 for (MachineBasicBlock::pred_iterator PI = L.getHeader()->pred_begin(), 743 for (MachineBasicBlock::pred_iterator PI = Top->pred_begin(), [all...] |
ShrinkWrapping.cpp | 243 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(), 449 MachineBasicBlock::pred_iterator PI = HDR->pred_begin(); 569 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(), 610 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(), 683 for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(), [all...] |
/external/llvm/lib/IR/ |
BasicBlock.cpp | 184 pred_iterator PI = pred_begin(this), E = pred_end(this); 197 pred_iterator PI = pred_begin(this), E = pred_end(this);
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
ScheduleDAGFast.cpp | 162 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 285 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 357 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 476 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
|
ResourcePriorityQueue.cpp | 73 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 158 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); 511 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
|
/external/llvm/include/llvm/Transforms/Utils/ |
BasicBlockUtils.h | 106 inline bool SplitCriticalEdge(BasicBlock *Succ, pred_iterator PI, Pass *P = 0) {
|