| /external/llvm/include/llvm/IR/ |
| D | CFG.h | 87 Value::const_user_iterator> const_pred_iterator; typedef
89 typedef llvm::iterator_range<const_pred_iterator> pred_const_range;
92 inline const_pred_iterator pred_begin(const BasicBlock *BB) { in pred_begin()
93 return const_pred_iterator(BB); in pred_begin()
96 inline const_pred_iterator pred_end(const BasicBlock *BB) { in pred_end()
97 return const_pred_iterator(BB, true); in pred_end()
202 typedef const_pred_iterator ChildIteratorType;
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| D | ExplodedGraph.h | 205 typedef const ExplodedNode* const * const_pred_iterator; typedef
210 const_pred_iterator pred_begin() const { in pred_begin()
213 const_pred_iterator pred_end() const { in pred_end()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineBasicBlock.h | 283 typedef std::vector<MachineBasicBlock *>::const_iterator const_pred_iterator;
295 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
297 const_pred_iterator pred_end() const { return Predecessors.end(); }
330 inline iterator_range<const_pred_iterator> predecessors() const {
844 typedef MachineBasicBlock::const_pred_iterator ChildIteratorType;
|
| D | ScheduleDAG.h | 280 typedef SmallVectorImpl<SDep>::const_iterator const_pred_iterator;
|
| /external/llvm/lib/CodeGen/ |
| D | ScheduleDAG.cpp | 201 for (SUnit::const_pred_iterator I = SU->Preds.begin(), in setHeightDirty()
242 for (SUnit::const_pred_iterator I = Cur->Preds.begin(), in ComputeDepth()
491 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in InitDAGTopologicalSorting()
507 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in InitDAGTopologicalSorting()
|
| D | LatencyPriorityQueue.cpp | 58 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred()
|
| D | AggressiveAntiDepBreaker.cpp | 255 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in AntiDepEdges()
271 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in CriticalPathStep()
873 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies()
882 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies()
|
| D | MachineVerifier.cpp | 546 for (MachineBasicBlock::const_pred_iterator I = MBB->pred_begin(), in visitMachineBasicBlockBefore()
1272 for (MachineBasicBlock::const_pred_iterator PrI = MBB.pred_begin(), in calcRegsRequired()
1286 for (MachineBasicBlock::const_pred_iterator PrI = MBB->pred_begin(), in calcRegsRequired()
1319 for (MachineBasicBlock::const_pred_iterator PrI = MBB->pred_begin(), in checkPHIOps()
1668 for (MachineBasicBlock::const_pred_iterator PI = MFI->pred_begin(), in verifyLiveRangeSegment()
1840 for (MachineBasicBlock::const_pred_iterator I = MBB->pred_begin(), in verifyStackFrame()
|
| D | CriticalAntiDepBreaker.cpp | 133 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in CriticalPathStep()
562 for (SUnit::const_pred_iterator P = CriticalPathSU->Preds.begin(), in BreakAntiDependencies()
|
| D | ScheduleDAGInstrs.cpp | 1435 for (SUnit::const_pred_iterator in visitPostorderNode()
1570 std::vector<std::pair<const SUnit*, SUnit::const_pred_iterator> > DFSStack;
1586 SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; } in getPred()
1588 SUnit::const_pred_iterator getPredEnd() const { in getPredEnd()
|
| D | StackColoring.cpp | 312 for (MachineBasicBlock::const_pred_iterator PI = BB->pred_begin(), in calculateLocalLiveness()
|
| D | ExecutionDepsFix.cpp | 391 for (MachineBasicBlock::const_pred_iterator pi = MBB->pred_begin(), in enterBasicBlock()
|
| /external/clang/lib/Analysis/ |
| D | CFGReachabilityAnalysis.cpp | 70 for (CFGBlock::const_pred_iterator i = block->pred_begin(), in mapReachability()
|
| D | ReachableCode.cpp | 386 for (CFGBlock::const_pred_iterator I = Block->pred_begin(), in isDeadCodeRoot()
461 for (CFGBlock::const_pred_iterator I = Block->pred_begin(), in scanBackwards()
609 CFGBlock::const_pred_iterator PI = B->pred_begin(); in reportDeadCode()
|
| D | UninitializedValues.cpp | 593 for (CFGBlock::const_pred_iterator I = B->pred_begin(), E = B->pred_end(); in getUninitUse()
810 for (CFGBlock::const_pred_iterator I = block->pred_begin(), in runOnBlock()
|
| D | Consumed.cpp | 1033 for (CFGBlock::const_pred_iterator PI = TargetBlock->pred_begin(), in allBackEdgesVisited()
1107 for (CFGBlock::const_pred_iterator PI = Block->pred_begin(), in isBackEdgeTarget()
|
| D | LiveVariables.cpp | 58 for (CFGBlock::const_pred_iterator I = block->pred_begin(), in enqueuePredecessors()
|
| /external/clang/include/clang/Analysis/ |
| D | CFG.h | 522 typedef AdjacentBlocks::const_iterator const_pred_iterator; typedef
533 const_pred_iterator pred_begin() const { return Preds.begin(); } in pred_begin()
534 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end()
601 typedef FilteredCFGBlockIterator<const_pred_iterator, true>
1030 typedef ::clang::CFGBlock::const_pred_iterator ChildIteratorType;
1044 typedef ::clang::CFGBlock::const_pred_iterator ChildIteratorType;
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGRRList.cpp | 1857 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CalcNodeSethiUllmanNumber()
1959 for (SUnit::const_pred_iterator I = SU->Preds.begin(),E = SU->Preds.end(); in HighRegPressure()
2009 for (SUnit::const_pred_iterator I = SU->Preds.begin(),E = SU->Preds.end(); in RegPressureDiff()
2223 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in calcMaxScratches()
2235 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in hasOnlyLiveInOpers()
2296 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in initVRegCycle()
2309 for (SUnit::const_pred_iterator I = SU->Preds.begin(),E = SU->Preds.end(); in resetVRegCycle()
2328 for (SUnit::const_pred_iterator I = SU->Preds.begin(),E = SU->Preds.end(); in hasVRegCycleUse()
2732 for (SUnit::const_pred_iterator PI = SuccSU->Preds.begin(), in canClobberReachingPhysRegUse()
2846 for (SUnit::const_pred_iterator II = SU->Preds.begin(), in PrescheduleNodesWithMultipleUses()
|
| D | ResourcePriorityQueue.cpp | 217 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred()
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| D | UnreachableCodeChecker.cpp | 179 for (CFGBlock::const_pred_iterator I = CB->pred_begin(), E = CB->pred_end(); in FindUnreachableEntryPoints()
|
| /external/llvm/lib/Analysis/ |
| D | CFG.cpp | 94 const_pred_iterator I = pred_begin(Dest), E = pred_end(Dest); in isCriticalEdge()
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.cpp | 433 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred()
518 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in SchedulingCost()
|
| /external/llvm/lib/IR/ |
| D | Dominators.cpp | 180 for (const_pred_iterator PI = pred_begin(End), E = pred_end(End); in dominates()
|
| /external/clang/include/clang/Analysis/Analyses/ |
| D | ThreadSafetyCommon.h | 167 for (CFGBlock::const_pred_iterator SI = CurrBlock->pred_begin(), in walk()
|