HomeSort by relevance Sort by last modified time
    Searched full:succ_end (Results 1 - 25 of 69) sorted by null

1 2 3

  /external/llvm/lib/CodeGen/
MachineBranchProbabilityInfo.cpp 34 E = MBB->succ_end(); I != E; ++I) {
73 E = MBB->succ_end(); I != E; ++I) {
EdgeBundles.cpp 50 SE = MBB.succ_end(); SI != SE; ++SI)
91 SE = I->succ_end(); SI != SE; ++SI)
UnreachableBlockElim.cpp 84 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI)
151 while (BB->succ_begin() != BB->succ_end()) {
TailDuplication.cpp 191 MBB->succ_end());
620 SE = A.succ_end(); SI != SE; ++SI) {
631 SmallPtrSet<MachineBasicBlock*, 8> Succs(BB.succ_begin(), BB.succ_end());
657 TailBB->succ_end());
811 E = TailBB->succ_end(); I != E; ++I)
    [all...]
ShrinkWrapping.cpp 206 SE = MBB->succ_end(); SI != SE; ++SI) {
474 SE = EntryBlock->succ_end(); SI != SE; ++SI) {
561 SE = MBB->succ_end(); SI != SE; ++SI) {
595 SE = MBB->succ_end(); SI != SE; ++SI) {
746 SE = MBB->succ_end(); SI != SE; ++SI) {
893 SE = EntryBlock->succ_end(); SI != SE; ++SI) {
    [all...]
  /external/llvm/include/llvm/Analysis/
Interval.h 104 /// succ_begin/succ_end - define methods so that Intervals may be used
110 inline Interval::succ_iterator succ_end(Interval *I) { function in namespace:llvm
135 return succ_end(N);
RegionIterator.h 99 while (succ_end(node->getEntry()) != BItor && isExit(*BItor))
109 BItor(succ_end(node->getEntry())) {}
135 while (BItor != succ_end(getNode()->getEntry())
188 while (succ_end(Node->getEntry()) != Itor
194 Itor(succ_end(node->getEntry())) {
225 while (Itor != succ_end(Node->getEntry())
254 inline RNSuccIterator<NodeType> succ_end(NodeType* Node) { function in namespace:llvm
  /external/llvm/lib/Analysis/
ProfileInfo.cpp 98 succ_const_iterator SI = succ_begin(BB), SE = succ_end(BB);
250 succ_const_iterator Succ = succ_begin(BB), End = succ_end(BB);
386 for(succ_const_iterator BBI = succ_begin(FirstBB), BBE = succ_end(FirstBB);
528 succ_const_iterator sbbi = succ_begin(BB), sbbe = succ_end(BB);
599 succ_const_iterator sbbi = succ_begin(BB), sbbe = succ_end(BB);
650 // succ_const_iterator NBB = succ_begin(BB), End = succ_end(BB);
681 succ_const_iterator NBB = succ_begin(BB), End = succ_end(BB);
751 for (succ_const_iterator Succ = succ_begin(BB), End = succ_end(BB);
803 for (succ_const_iterator NBB = succ_begin(BB), End = succ_end(BB);
818 for (succ_const_iterator NBB = succ_begin(BB), End = succ_end(BB)
    [all...]
BranchProbabilityInfo.cpp 155 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) {
209 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) {
275 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) {
302 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) {
ProfileVerifierPass.cpp 116 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
138 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
262 succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
341 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
ProfileEstimatorPass.cpp 263 succ_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
312 for (succ_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
413 succ_const_iterator succi = succ_begin(BB), succe = succ_end(BB);
DominanceFrontier.cpp 65 for (succ_iterator SI = succ_begin(currentBB), SE = succ_end(currentBB);
RegionInfo.cpp 213 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI)
230 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI)
548 unsigned num_successors = succ_end(entry) - succ_begin(entry);
757 else if (++succ_begin(BB) == succ_end(BB))
LoopInfo.cpp 336 for (succ_iterator I = succ_begin(*BI), E = succ_end(*BI); I != E; ++I) {
354 if (std::distance(succ_begin(current), succ_end(current)) <= 2) {
  /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h 197 succ_iterator succ_end() { return Succs.end(); } function in class:clang::ento::ExplodedNode
202 const_succ_iterator succ_end() const { function in class:clang::ento::ExplodedNode
203 return const_cast<ExplodedNode*>(this)->succ_end();
429 return N->succ_end();
455 return N->succ_end();
  /external/llvm/lib/Support/
DAGDeltaAlgorithm.cpp 105 succ_iterator_ty succ_end(change_ty Node) { function in class:__anon7973::DAGDeltaAlgorithmImpl
132 ie2 = succ_end(*it); it2 != ie2; ++it2)
204 if (succ_begin(*it) == succ_end(*it))
241 if (succ_begin(*it) != succ_end(*it)) {
244 ie2 = succ_end(*it); it2 != ie2; ++it2) {
  /external/llvm/include/llvm/Support/
CFG.h 226 inline succ_iterator succ_end(BasicBlock *BB) { function in namespace:llvm
229 inline succ_const_iterator succ_end(const BasicBlock *BB) { function in namespace:llvm
251 return succ_end(N);
265 return succ_end(N);
  /external/llvm/lib/Transforms/Scalar/
SimplifyCFGPass.cpp 68 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI)
167 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI)
193 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI)
BasicBlockPlacement.cpp 127 succ_iterator SI = succ_begin(BB), E = succ_end(BB);
LoopInstSimplify.cpp 129 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE;
TailDuplication.cpp 180 for (succ_iterator SI = succ_begin(Dest), SE = succ_end(Dest);
333 for (succ_iterator SI = succ_begin(DestBlock), SE = succ_end(DestBlock);
  /external/llvm/include/llvm/CodeGen/
MachineBasicBlock.h 185 succ_iterator succ_end() { return Successors.end(); } function in class:llvm::MachineBasicBlock
186 const_succ_iterator succ_end() const { return Successors.end(); } function in class:llvm::MachineBasicBlock
478 return N->succ_end();
491 return N->succ_end();
  /external/llvm/lib/Transforms/IPO/
PartialInlining.cpp 60 for (succ_iterator SI = succ_begin(entryBlock), SE = succ_end(entryBlock);
  /external/clang/include/clang/Analysis/
CFG.h 390 succ_iterator succ_end() { return Succs.end(); }
392 const_succ_iterator succ_end() const { return Succs.end(); }
455 return filtered_succ_iterator(succ_begin(), succ_end(), this, f);
729 { return N->succ_end(); }
743 { return N->succ_end(); }
  /external/clang/include/clang/Analysis/FlowSensitive/
DataflowSolver.h 76 static NextBItr NextEnd(const CFGBlock* B) { return B->succ_end(); }
96 static PrevBItr PrevEnd(const CFGBlock* B) { return B->succ_end(); }

Completed in 318 milliseconds

1 2 3