/external/llvm/include/llvm/Analysis/ |
DominatorInternals.h | 93 typename GraphT::NodeType* Succ = *NextSucc; 96 DT.Info[Succ]; 99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
|
BlockFrequencyImpl.h | 328 BlockT *Succ = *SI; 329 OS << " " << getBlockName(BB) << " -> " << getBlockName(Succ) 330 << " = " << getEdgeFreq(BB, Succ) << "\n";
|
/external/llvm/lib/Transforms/Instrumentation/ |
OptimalEdgeProfiling.cpp | 183 BasicBlock *Succ = TI->getSuccessor(s); 184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ); 189 Succ = TI->getSuccessor(s); 191 InsertedBlocks.insert(Succ); 202 printEdgeCounter(edge, Succ, i); 203 IncrementCounterInBlock(Succ, i, Counters); ++NumEdgesInserted;
|
GCOVProfiling.cpp | 533 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]]. 549 BasicBlock *Succ = TI->getSuccessor(i); 550 IRBuilder<> builder(Succ); 553 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
|
/external/llvm/tools/llvm-prof/ |
llvm-prof.cpp | 109 BasicBlock* Succ = TI->getSuccessor(s); 110 double w = ignoreMissing(PI.getEdgeWeight(std::make_pair(BB, Succ))); 112 SuccCounts.push_back(std::make_pair(std::make_pair(BB, Succ), w));
|
/external/clang/lib/StaticAnalyzer/Core/ |
CoreEngine.cpp | 182 const CFGBlock *Succ = *(Entry->succ_begin()); 186 BlockEdge StartLoc(Entry, Succ, L); 370 if (const CFGBlock *succ = *it) { 371 generateNode(BlockEdge(B, succ, Pred->getLocationContext()), 527 ExplodedNode *Succ = G->getNode(Loc, N->getState(), false, &IsNew); 528 Succ->addPredecessor(N, *G); 531 WList->enqueue(Succ, Block, Idx+1); 622 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred); 623 return Succ; 631 ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, I.getBlock() [all...] |
ExprEngineCallAndReturn.cpp | 35 const CFGBlock *Succ = *(Entry->succ_begin()); 38 BlockEdge Loc(Entry, Succ, calleeCtx);
|
BugReporter.cpp | [all...] |
/external/llvm/lib/Analysis/ |
BranchProbabilityInfo.cpp | 425 const BasicBlock *Succ = *I; 426 uint32_t Weight = getEdgeWeight(BB, Succ); 449 BasicBlock *Succ = *I; 450 uint32_t Weight = getEdgeWeight(BB, Succ); 458 MaxSucc = Succ;
|
ProfileInfo.cpp | 250 succ_const_iterator Succ = succ_begin(BB), End = succ_end(BB); 251 if (Succ == End) { 258 for(;Succ != End; ++Succ) { 259 if (P.find(*Succ) != P.end()) continue; 260 Edge e = getEdge(BB,*Succ); 262 P[*Succ] = BB; 263 BFS.push(*Succ); 264 if ((Mode & GetPathToDest) && *Succ == Dest) { 266 BB = *Succ; [all...] |
/external/llvm/lib/Transforms/Utils/ |
LowerSwitch.cpp | 213 BasicBlock* Succ = Leaf.BB; 214 BranchInst::Create(Succ, Default, Comp, NewLeaf); 218 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
|
Local.cpp | 153 BasicBlock *Succ = SI->getSuccessor(i); 154 if (Succ == TheOnlyDest) 157 Succ->removePredecessor(BB); 483 /// almost-empty BB ending in an unconditional branch to Succ, into succ. 485 /// Assumption: Succ is the single successor for BB. 487 static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) { 488 assert(*succ_begin(BB) == Succ && "Succ is not successor of BB!"); 491 << Succ->getName() << "\n") [all...] |
SimplifyCFG.cpp | 110 /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will 113 /// ExistPred, an existing predecessor of Succ. 114 static void AddPredecessorToBlock(BasicBlock *Succ, BasicBlock *NewPred, 116 if (!isa<PHINode>(Succ->begin())) return; // Quick exit if nothing to do 119 for (BasicBlock::iterator I = Succ->begin(); 630 assert(TIV && "No edge from pred to succ?"); [all...] |
/external/llvm/lib/VMCore/ |
BasicBlock.cpp | 344 BasicBlock *Succ = TI->getSuccessor(i); 345 // N.B. Succ might not be a complete BasicBlock, so don't assume 347 for (iterator II = Succ->begin(), IE = Succ->end(); II != IE; ++II) {
|
/external/llvm/lib/CodeGen/ |
MachineBasicBlock.cpp | 438 void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ, uint32_t weight) { 448 Successors.push_back(succ); 449 succ->addPredecessor(this); 452 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *succ) { 453 succ->removePredecessor(this); 454 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ); 511 MachineBasicBlock *Succ = *fromMBB->succ_begin(); 519 addSuccessor(Succ, weight); 520 fromMBB->removeSuccessor(Succ); 530 MachineBasicBlock *Succ = *fromMBB->succ_begin() [all...] |
IfConversion.cpp | [all...] |
/external/llvm/lib/Transforms/Scalar/ |
JumpThreading.cpp | 193 BasicBlock *Succ = BI->getSuccessor(0); 204 BB = Succ; [all...] |
LoopUnswitch.cpp | [all...] |
SCCP.cpp | [all...] |
ObjCARC.cpp | [all...] |
/external/v8/src/ |
log.cc | 94 if (Succ(head_) == tail_) { 98 head_ = Succ(head_); 108 tail_ = Succ(tail_); 122 int Succ(int index) { return (index + 1) % kBufferSize; } [all...] |
/external/clang/lib/Analysis/ |
CFG.cpp | 257 CFGBlock *Succ; 299 Block(NULL), Succ(NULL), 579 Succ = createBlock(); 580 assert(Succ == &cfg->getExit()); 604 Succ = B; 650 if (add_successor && Succ) 651 addSuccessor(B, Succ); [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
SelectionDAGBuilder.cpp | [all...] |