| /external/llvm/lib/CodeGen/ |
| MachineBranchProbabilityInfo.cpp | 35 MachineBasicBlock *Succ = *I;
36 uint32_t Weight = getEdgeWeight(MBB, Succ);
74 MachineBasicBlock *Succ = *I;
75 uint32_t Weight = getEdgeWeight(MBB, Succ);
83 MaxSucc = Succ;
|
| MachineBasicBlock.cpp | 341 void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ, uint32_t weight) {
351 Successors.push_back(succ);
352 succ->addPredecessor(this);
355 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *succ) {
356 succ->removePredecessor(this);
357 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ);
414 MachineBasicBlock *Succ = *fromMBB->succ_begin();
422 addSuccessor(Succ, weight);
423 fromMBB->removeSuccessor(Succ);
433 MachineBasicBlock *Succ = *fromMBB->succ_begin()
[all...] |
| SjLjEHPrepare.cpp | 169 BasicBlock *Succ = *succ_begin(LPad);
171 LPad->getParent(), Succ);
174 BranchInst::Create(Succ, JumpTo);
177 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
[all...] |
| IfConversion.cpp | [all...] |
| /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 | 327 BlockT *Succ = *SI;
328 OS << " " << getBlockName(BB) << " -> " << getBlockName(Succ)
329 << " = " << 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 | 532 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]].
548 BasicBlock *Succ = TI->getSuccessor(i);
549 IRBuilder<> builder(Succ);
552 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 | 169 const CFGBlock *Succ = *(Entry->succ_begin());
173 BlockEdge StartLoc(Entry, Succ, L);
550 ExplodedNode *Succ = C.Eng.G->getNode(Loc, N->State, &IsNew);
551 Succ->addPredecessor(N, *C.Eng.G);
554 C.Eng.WList->enqueue(Succ, C.Block, Idx+1);
578 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred);
579 return Succ;
588 ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, I.getBlock(),
591 Succ->addPredecessor(Pred, *Eng.G);
596 Succ->markAsSink()
[all...] |
| BugReporter.cpp | [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);
475 /// almost-empty BB ending in an unconditional branch to Succ, into succ.
477 /// Assumption: Succ is the single successor for BB.
479 static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) {
480 assert(*succ_begin(BB) == Succ && "Succ is not successor of BB!");
483 << Succ->getName() << "\n")
[all...] |
| SimplifyCFG.cpp | 107 /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will
110 /// ExistPred, an existing predecessor of Succ.
111 static void AddPredecessorToBlock(BasicBlock *Succ, BasicBlock *NewPred,
113 if (!isa<PHINode>(Succ->begin())) return; // Quick exit if nothing to do
116 for (BasicBlock::iterator I = Succ->begin();
626 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/Analysis/ |
| BranchProbabilityInfo.cpp | 189 BasicBlock *Succ = *I;
190 if (isReturningBlock(Succ))
191 ReturningEdges.insert(Succ);
193 StayEdges.insert(Succ);
270 BasicBlock *Succ = *I;
271 Loop *SuccL = LI->getLoopFor(Succ);
273 ExitingEdges.insert(Succ);
274 else if (Succ == L->getHeader())
275 BackEdges.insert(Succ);
277 InEdges.insert(Succ);
[all...] |
| 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/Scalar/ |
| LoopUnswitch.cpp | [all...] |
| JumpThreading.cpp | 188 BasicBlock *Succ = BI->getSuccessor(0);
199 BB = Succ;
[all...] |
| SCCP.cpp | [all...] |
| ObjCARC.cpp | [all...] |
| /external/llvm/lib/Target/ARM/ |
| ARMConstantIslandPass.cpp | 751 MachineBasicBlock *Succ = *OrigBB->succ_begin();
752 OrigBB->removeSuccessor(Succ);
753 NewBB->addSuccessor(Succ);
757 assert((Succ->empty() || !Succ->begin()->isPHI())
[all...] |
| /external/llvm/lib/Target/CBackend/ |
| CBackend.cpp | [all...] |
| /external/v8/src/ |
| log.cc | 95 if (Succ(head_) == tail_) {
99 head_ = Succ(head_);
109 tail_ = Succ(tail_);
123 int Succ(int index) { return (index + 1) % kBufferSize; }
[all...] |
| /external/clang/lib/Analysis/ |
| CFG.cpp | 256 CFGBlock *Succ;
293 Block(NULL), Succ(NULL),
517 Succ = createBlock();
518 assert(Succ == &cfg->getExit());
542 Succ = B;
588 if (add_successor && Succ)
589 addSuccessor(B, Succ);
[all...] |
