| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| CFG.h | 43 unsigned GetSuccessorNumber(const BasicBlock *BB, const BasicBlock *Succ);
51 bool isCriticalEdge(const Instruction *TI, const BasicBlock *Succ,
163 for (NodeT Succ : make_range(GT::child_begin(Node), GT::child_end(Node))) {
164 // Succ hasn't been visited yet
165 if (!Visited.count(Succ))
167 // We already visited Succ, thus Node->Succ must be a backedge. Check that
170 if (!isProperBackedge(Node, Succ))
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| LoopTraversal.cpp | 46 for (MachineBasicBlock *Succ : ActiveMBB->successors()) {
47 unsigned SuccNumber = Succ->getNumber();
50 if (!isBlockDone(Succ)) {
55 if (isBlockDone(Succ))
56 Workqueue.push_back(Succ);
|
| EdgeBundles.cpp | 49 for (const MachineBasicBlock *Succ : MBB.successors())
50 EC.join(OutE, 2 * Succ->getNumber());
88 for (const MachineBasicBlock *Succ : MBB.successors())
90 << printMBBReference(*Succ) << "\" [ color=lightgray ]\n";
|
| MachineBlockPlacement.cpp | 470 const MachineBasicBlock *BB, const MachineBasicBlock *Succ,
529 const MachineBasicBlock *BB, const MachineBasicBlock *Succ,
553 const MachineBasicBlock *BB, MachineBasicBlock *Succ,
645 for (MachineBasicBlock *Succ : MBB->successors()) {
646 if (BlockFilter && !BlockFilter->count(Succ))
648 BlockChain &SuccChain = *BlockToChain[Succ];
650 if (&Chain == &SuccChain || Succ == LoopHeaderBB)
692 for (MachineBasicBlock *Succ : BB->successors()) {
694 if (Succ->isEHPad() || (BlockFilter && !BlockFilter->count(Succ))) {
[all...] |
| CFIInstrInserter.cpp | 130 void reportCFAError(const MBBCFAInfo &Pred, const MBBCFAInfo &Succ);
131 void reportCSRError(const MBBCFAInfo &Pred, const MBBCFAInfo &Succ);
280 for (auto *Succ : CurrentInfo.MBB->successors()) {
281 MBBCFAInfo &SuccInfo = MBBVector[Succ->getNumber()];
286 Stack.push_back(Succ);
386 const MBBCFAInfo &Succ) {
387 errs() << "*** Inconsistent CFA register and/or offset between pred and succ "
395 errs() << "Succ: " << Succ.MBB->getName() << " #" << Succ.MBB->getNumber(
[all...] |
| MachineDominators.cpp | 103 MachineBasicBlock *Succ = Edge.ToBB;
104 MachineDomTreeNode *SuccDTNode = DT->getNode(Succ);
106 for (MachineBasicBlock *PredBB : Succ->predecessors()) {
118 // Succ
141 // If all the other predecessors of "Succ" are dominated by "Succ" itself
142 // then the new block is the new immediate dominator of "Succ". Otherwise,
|
| MachineTraceMetrics.cpp | 219 if (!TBI->Succ) {
227 unsigned SuccNum = TBI->Succ->getNumber();
360 for (const MachineBasicBlock *Succ : MBB->successors()) {
362 if (CurLoop && Succ == CurLoop->getHeader())
365 if (isExitingLoop(CurLoop, getLoopFor(Succ)))
368 getHeightResources(Succ);
375 Best = Succ;
506 LLVM_DEBUG(dbgs() << " succ for " << printMBBReference(*I) << ": ");
509 TBI.Succ = pickTraceSucc(I);
511 if (TBI.Succ)
[all...] |
| MachineBasicBlock.cpp | 301 for (const MachineBasicBlock *Succ : successors()) {
302 if (Succ->isInlineAsmBrIndirectTarget())
746 void MachineBasicBlock::addSuccessor(MachineBasicBlock *Succ,
752 Successors.push_back(Succ);
753 Succ->addPredecessor(this);
756 void MachineBasicBlock::addSuccessorWithoutProb(MachineBasicBlock *Succ) {
761 Successors.push_back(Succ);
762 Succ->addPredecessor(this);
784 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *Succ,
786 succ_iterator I = find(Successors, Succ);
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| CFGDiff.h | 62 UpdateMapType Succ;
101 Succ[U.getFrom()].DI[IsInsert].push_back(U.getTo());
118 auto &SuccDIList = Succ[U.getFrom()];
123 Succ.erase(U.getFrom());
144 auto &Children = (InverseEdge != InverseGraph) ? Pred : Succ;
165 printMap(OS, Succ);
|
| GenericIteratedDominanceFrontier.h | 174 // Succ is the successor in the direction we are calculating IDF, so it is
176 auto DoWork = [&](NodeTy *Succ) {
177 DomTreeNodeBase<NodeTy> *SuccNode = DT.getNode(Succ);
196 for (auto Succ : ChildrenGetter.get(BB))
197 DoWork(Succ);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| LoopSimplifyCFG.cpp | 200 for (auto *Succ : successors(BB))
201 if (L.contains(Succ) && !LI.isLoopHeader(Succ) && RPO[BB] > RPO[Succ])
250 for (BasicBlock *Succ : successors(BB))
251 if (!TakeFoldCandidate || TheOnlySucc == Succ) {
252 if (L.contains(Succ))
253 LiveLoopBlocks.insert(Succ);
255 LiveExitBlocks.insert(Succ);
298 return any_of(successors(BB), [&](BasicBlock *Succ) {
[all...] |
| ADCE.cpp | 286 for (auto *Succ : successors(BB))
287 if (State.onStack(Succ)) {
597 for (auto *Succ : successors(BB)) {
598 auto *Info = &BlockInfo[Succ];
608 for (auto *Succ : successors(BB)) {
609 if (!First || Succ != PreferredSucc->BB) {
610 Succ->removePredecessor(BB);
611 RemovedSuccessors.insert(Succ);
619 for (auto *Succ : RemovedSuccessors) {
622 if (Succ != PreferredSucc->BB)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyFixIrreducibleControlFlow.cpp | 143 for (auto *Succ : MBB->successors()) {
144 if (Succ != Entry && inRegion(Succ)) {
145 Reachable[MBB].insert(Succ);
146 WorkList.emplace_back(MBB, Succ);
152 MachineBasicBlock *MBB, *Succ;
153 std::tie(MBB, Succ) = WorkList.pop_back_val();
154 assert(inRegion(MBB) && Succ != Entry && inRegion(Succ));
156 // We recently added MBB => Succ, and that means we may have enable
[all...] |
| WebAssemblyCFGSort.cpp | 244 for (MachineBasicBlock *Succ : MBB->successors()) {
246 if (MachineLoop *SuccL = MLI.getLoopFor(Succ))
247 if (SuccL->getHeader() == Succ && SuccL->contains(MBB))
250 if (--NumPredsLeft[Succ->getNumber()] == 0) {
262 if (EHInfo && EHInfo->hasUnwindSrcs(Succ)) {
264 EHInfo->getUnwindSrcs(Succ);
268 E.Deferred.push_back(Succ);
276 Preferred.push(Succ);
|
| WebAssemblyExceptionInfo.cpp | 70 for (auto *Succ : MBB->successors())
71 if (!Visited.count(Succ) && MDT.dominates(Header, Succ))
72 WL.push_back(Succ);
316 for (auto *Succ : MBB->successors())
317 if (MDT.dominates(EHPad, Succ))
318 WL.push_back(Succ);
|
| WebAssemblyLateEHPrepare.cpp | 105 for (auto *Succ : Succs)
106 MBB->removeSuccessor(Succ);
279 for (auto *Succ : Succs)
280 if (!Succ->isEHPad())
281 MBB.removeSuccessor(Succ);
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-reduce/deltas/ |
| ReduceBasicBlocks.cpp | 31 for (auto *Succ : successors(&BB))
32 if (BBsToKeep.count(Succ))
33 ChunkSucessors.push_back(Succ);
107 for (auto *Succ : successors(&BB))
108 Succ->removePredecessor(&BB);
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| LoopNestAnalysis.cpp | 296 for (const BasicBlock *Succ : BI->successors()) {
297 const BasicBlock *PotentialInnerPreHeader = Succ;
298 const BasicBlock *PotentialOuterLatch = Succ;
302 if (Succ->getInstList().size() == 1) {
304 &LoopNest::skipEmptyBlockUntil(Succ, InnerLoopPreHeader);
306 &LoopNest::skipEmptyBlockUntil(Succ, OuterLoopLatch);
318 if (InnerLoopExitContainsLCSSA && IsExtraPhiBlock(*Succ) &&
319 Succ->getSingleSuccessor() == OuterLoopLatch) {
324 ExtraPhiBlock = Succ;
329 dbgs() << "Inner loop guard successor " << Succ->getName(
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| CoreEngine.cpp | 96 const CFGBlock *Succ = *(Entry->succ_begin());
100 BlockEdge StartLoc(Entry, Succ, L);
333 if (const CFGBlock *succ = *it) {
334 generateNode(BlockEdge(B, succ, Pred->getLocationContext()),
556 ExplodedNode *Succ = G.getNode(Loc, N->getState(), false, &IsNew);
557 Succ->addPredecessor(N, G);
560 WList->enqueue(Succ, Block, Idx+1);
643 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred);
644 return Succ;
652 ExplodedNode *Succ
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| SIMachineScheduler.cpp | 424 for (SDep& Succ : SU->Succs) {
425 if (BC->isSUInBlock(Succ.getSUnit(), ID))
426 undoReleaseSucc(SU, &Succ);
465 for (SDep& Succ : SU->Succs) {
466 SUnit *SuccSU = Succ.getSUnit();
474 releaseSucc(SU, &Succ);
497 for (SDep& Succ : SU->Succs) {
499 NodeNum2Index.find(Succ.getSUnit()->NodeNum);
536 void SIScheduleBlock::addSucc(SIScheduleBlock *Succ,
538 unsigned SuccID = Succ->getID()
[all...] |
| /src/external/apache2/llvm/dist/llvm/examples/IRTransforms/ |
| SimplifyCFG.cpp | 77 for (BasicBlock *Succ : successors(&BB))
78 Succ->removePredecessor(&BB);
81 // for (PHINode &PN : make_early_inc_range(Succ->phis()))
118 for (BasicBlock *Succ : successors(&BB)) {
119 Succ->removePredecessor(&BB);
122 DTUpdates.push_back({DominatorTree::Delete, &BB, Succ});
325 for (BasicBlock *Succ : successors(&BB)) {
326 DTUpdates.push_back({DominatorTree::Delete, &BB, Succ});
327 DTUpdates.push_back({DominatorTree::Insert, Pred, Succ});
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| VPlanVerifier.cpp | 65 for (const VPBlockBase *Succ : Successors) {
67 const auto &SuccPreds = Succ->getPredecessors();
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| ObjCSuperDeallocChecker.cpp | 72 PathDiagnosticPieceRef VisitNode(const ExplodedNode *Succ,
247 SuperDeallocBRVisitor::VisitNode(const ExplodedNode *Succ,
253 ProgramStateRef State = Succ->getState();
256 Succ->getState()->contains<CalledSuperDealloc>(ReceiverSymbol);
258 Succ->getFirstPred()->getState()->contains<CalledSuperDealloc>(
261 // Is Succ the node on which the analyzer noted that [super dealloc] was
266 ProgramPoint P = Succ->getLocation();
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| ResourcePriorityQueue.cpp | 111 for (const SDep &Succ : SU->Succs) {
112 if (Succ.isCtrl())
115 SUnit *SuccSU = Succ.getSUnit();
148 for (const SDep &Succ : SU->Succs)
149 if (Succ.isCtrl())
233 for (const SDep &Succ : SU->Succs)
234 if (getSingleUnscheduledPred(Succ.getSUnit()) == SU)
272 for (const SDep &Succ : Packet[i]->Succs) {
275 if (Succ.isCtrl())
278 if (Succ.getSUnit() == SU
[all...] |
| ScheduleDAGFast.cpp | 192 for (SDep &Succ : SU->Succs) {
193 if (Succ.isAssignedRegDep()) {
194 if (LiveRegCycles[Succ.getReg()] == Succ.getSUnit()->getHeight()) {
196 assert(LiveRegDefs[Succ.getReg()] == SU &&
199 LiveRegDefs[Succ.getReg()] = nullptr;
200 LiveRegCycles[Succ.getReg()] = 0;
291 for (SDep &Succ : SU->Succs) {
292 if (Succ.isCtrl())
293 ChainSuccs.push_back(Succ);
[all...] |
