| /external/llvm/lib/Transforms/Scalar/ |
| LoopSimplifyCFG.cpp | 48 BasicBlock *Succ = cast_or_null<BasicBlock>(Block);
49 if (!Succ)
52 BasicBlock *Pred = Succ->getSinglePredecessor();
58 L.moveToHeader(Succ);
60 MergeBasicBlockIntoOnlyPred(Succ, &DT);
|
| PlaceSafepoints.cpp | 279 for (BasicBlock *Succ : successors(BB)) {
280 if (Seen.insert(Succ).second) {
281 Worklist.push_back(Succ);
543 BasicBlock *Succ = Term->getSuccessor(i);
544 if (DT.dominates(Succ, Term->getParent())) {
545 Headers.insert(Succ);
|
| /external/swiftshader/third_party/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;
|
| /external/llvm/lib/Analysis/ |
| IteratedDominanceFrontier.cpp | 65 // Succ is the successor in the direction we are calculating IDF, so it is
70 BasicBlock *Succ = *SuccIter;
71 DomTreeNode *SuccNode = DT.getNode(Succ);
|
| /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/llvm/lib/CodeGen/ |
| MachineDominators.cpp | 96 MachineBasicBlock *Succ = Edge.ToBB;
97 MachineDomTreeNode *SuccDTNode = DT->getNode(Succ);
99 for (MachineBasicBlock *PredBB : Succ->predecessors()) {
111 // Succ
134 // If all the other predecessors of "Succ" are dominated by "Succ" itself
135 // then the new block is the new immediate dominator of "Succ". Otherwise,
|
| /external/swiftshader/third_party/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/swiftshader/third_party/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;
|
| /external/swiftshader/third_party/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 | 185 const CFGBlock *Succ = *(Entry->succ_begin());
189 BlockEdge StartLoc(Entry, Succ, L);
394 if (const CFGBlock *succ = *it) {
395 generateNode(BlockEdge(B, succ, Pred->getLocationContext()),
586 ExplodedNode *Succ = G.getNode(Loc, N->getState(), false, &IsNew);
587 Succ->addPredecessor(N, G);
590 WList->enqueue(Succ, Block, Idx+1);
681 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred);
682 return Succ;
690 ExplodedNode *Succ
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 141 const MachineBasicBlock *Succ;
158 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;
|
| /external/swiftshader/third_party/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) {
|
| /external/swiftshader/third_party/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/swiftshader/third_party/subzero/src/ |
| IceLoopAnalyzer.cpp | 62 NodeList::const_iterator currentSuccessor() const { return Succ; }
63 void nextSuccessor() { ++Succ; }
88 NodeList::const_iterator Succ;
123 Succ = BB->getOutEdges().begin();
137 for (CfgNode *Succ : BB->getOutEdges()) {
138 if (Succ == BB)
180 if (LoopNode *Succ = processNode(WorkNode))
181 WorkStack.push_back(Succ);
196 // Returning to a node after having recursed into Succ so continue
197 // iterating through successors after using the Succ.LowLink value that wa
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 146 const MachineBasicBlock *Succ = nullptr;
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 146 const MachineBasicBlock *Succ = nullptr;
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 146 const MachineBasicBlock *Succ = nullptr;
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 163 const MachineBasicBlock *Succ = nullptr;
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 163 const MachineBasicBlock *Succ = nullptr;
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 163 const MachineBasicBlock *Succ = nullptr;
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 163 const MachineBasicBlock *Succ = nullptr;
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 146 const MachineBasicBlock *Succ = nullptr;
|
