| /external/llvm/lib/CodeGen/ |
| MachineDominators.cpp | 80 MachineBasicBlock *Succ = Edge.ToBB;
81 MachineDomTreeNode *SuccDTNode = DT->getNode(Succ);
83 for (MachineBasicBlock *PredBB : Succ->predecessors()) {
95 // Succ
118 // If all the other predecessors of "Succ" are dominated by "Succ" itself
119 // then the new block is the new immediate dominator of "Succ". Otherwise,
|
| MachineBasicBlock.cpp | 524 void MachineBasicBlock::addSuccessor(MachineBasicBlock *Succ,
530 Successors.push_back(Succ);
531 Succ->addPredecessor(this);
534 void MachineBasicBlock::addSuccessorWithoutProb(MachineBasicBlock *Succ) {
539 Successors.push_back(Succ);
540 Succ->addPredecessor(this);
543 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *Succ,
545 succ_iterator I = std::find(Successors.begin(), Successors.end(), Succ);
621 MachineBasicBlock *Succ = *FromMBB->succ_begin();
626 addSuccessor(Succ, Prob)
[all...] |
| MachineInstr.cpp | [all...] |
| IfConversion.cpp | [all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| DependencyAnalysis.cpp | 271 const BasicBlock *Succ = *SI;
272 if (Succ != StartBB && !Visited.count(Succ)) {
|
| /external/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 92 typename GraphT::NodeType* Succ = *NextSucc;
95 DT.Info[Succ];
98 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| CoreEngine.cpp | 185 const CFGBlock *Succ = *(Entry->succ_begin());
189 BlockEdge StartLoc(Entry, Succ, L);
382 if (const CFGBlock *succ = *it) {
383 generateNode(BlockEdge(B, succ, Pred->getLocationContext()),
569 ExplodedNode *Succ = G.getNode(Loc, N->getState(), false, &IsNew);
570 Succ->addPredecessor(N, G);
573 WList->enqueue(Succ, Block, Idx+1);
664 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred);
665 return Succ;
673 ExplodedNode *Succ
[all...] |
| ExprEngineCallAndReturn.cpp | 53 const CFGBlock *Succ = *(Entry->succ_begin());
56 BlockEdge Loc(Entry, Succ, calleeCtx);
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 140 const MachineBasicBlock *Succ;
157 Pred(nullptr), Succ(nullptr),
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 453 SUnit &Succ = *I->getSUnit();
454 if (!Succ.isScheduled) {
457 if (OnlyAvailableSucc && OnlyAvailableSucc != &Succ)
459 OnlyAvailableSucc = &Succ;
|
| HexagonStoreWidening.cpp | 553 bool Succ = selectStores(I++, E, OG, CollectedSize, MaxWideSize) &&
556 if (!Succ)
|
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyCFGStackify.cpp | 189 MachineBasicBlock *Succ = Succs.pop_back_val();
190 if (Visited.insert(Succ).second)
191 Stack.push_back(POStackEntry(Succ, MF, MLI));
|
| /external/llvm/lib/Analysis/ |
| BranchProbabilityInfo.cpp | 562 BasicBlock *Succ = *I;
563 uint32_t Weight = getEdgeWeight(BB, Succ);
571 MaxSucc = Succ;
|
| /external/llvm/lib/Transforms/Utils/ |
| LowerSwitch.cpp | 338 BasicBlock* Succ = Leaf.BB;
339 BranchInst::Create(Succ, Default, Comp, NewLeaf);
343 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
|
| Local.cpp | 192 for (BasicBlock *Succ : SI->successors()) {
194 if (Succ == TheOnlyDest)
197 Succ->removePredecessor(BB);
606 /// almost-empty BB ending in an unconditional branch to Succ, into Succ.
608 /// Assumption: Succ is the single successor for BB.
610 static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) {
611 assert(*succ_begin(BB) == Succ && "Succ is not successor of BB!");
614 << Succ->getName() << "\n")
[all...] |
| /external/clang/lib/Analysis/ |
| UninitializedValues.cpp | 645 const CFGBlock *Succ = *I;
646 if (Succ && SuccsVisited[Succ->getBlockID()] >= Succ->succ_size() &&
647 vals.getValue(Block, Succ, vd) == Uninitialized) {
653 const Stmt *Label = Succ->getLabel();
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| PGOInstrumentation.cpp | 262 BasicBlock *Succ = TI->getSuccessor(I);
263 uint32_t Index = getBBInfo(Succ).Index;
|
| GCOVProfiling.cpp | 719 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]].
735 BasicBlock *Succ = TI->getSuccessor(i);
736 IRBuilder<> Builder(Succ);
739 EdgeTable[((Succs.idFor(Succ) - 1) * Preds.size()) +
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| PlaceSafepoints.cpp | 298 for (BasicBlock *Succ : successors(BB)) {
299 if (seen.count(Succ) == 0) {
300 worklist.push_back(Succ);
301 seen.insert(Succ);
621 BasicBlock *Succ = Term->getSuccessor(i);
622 if (DT.dominates(Succ, Term->getParent())) {
623 Headers.insert(Succ);
[all...] |
| JumpThreading.cpp | 254 BasicBlock *Succ = BI->getSuccessor(0);
265 BB = Succ;
[all...] |
| LoopUnrollPass.cpp | 639 BasicBlock *Succ = nullptr;
642 Succ = BI->getSuccessor(0);
644 Succ = BI->getSuccessor(
646 if (L->contains(Succ))
647 BBWorklist.insert(Succ);
654 BasicBlock *Succ = nullptr;
657 Succ = SI->getSuccessor(0);
659 Succ = SI->findCaseValue(cast<ConstantInt>(SimpleCond))
661 if (L->contains(Succ))
662 BBWorklist.insert(Succ);
[all...] |
| LoopUnswitch.cpp | [all...] |
| StructurizeCFG.cpp | 361 for (BasicBlock *Succ : Term->successors())
362 if (Visited.count(Succ))
363 Loops[Succ] = BB;
438 BasicBlock *Succ = Term->getSuccessor(i);
439 if (Succ != BB)
|
| /external/llvm/lib/Transforms/IPO/ |
| SampleProfile.cpp | [all...] |
| /external/llvm/include/llvm/IR/ |
| PatternMatch.h | 909 BasicBlock *&Succ;
910 br_match(BasicBlock *&Succ) : Succ(Succ) {}
915 Succ = BI->getSuccessor(0);
922 inline br_match m_UnconditionalBr(BasicBlock *&Succ) { return br_match(Succ); }
[all...] |
