Searched refs:Succ (Results 1 - 25 of 143) sorted by relevance

123456

/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DLoopTraversal.cpp46 for (MachineBasicBlock *Succ : ActiveMBB->successors()) {
47 unsigned SuccNumber = Succ->getNumber();
50 if (!isBlockDone(Succ)) {
55 if (isBlockDone(Succ))
56 Workqueue.push_back(Succ);
H A DCFIInstrInserter.cpp111 void report(const MBBCFAInfo &Pred, const MBBCFAInfo &Succ);
234 for (auto *Succ : CurrentInfo.MBB->successors()) {
235 MBBCFAInfo &SuccInfo = MBBVector[Succ->getNumber()];
239 Stack.push_back(Succ);
295 void CFIInstrInserter::report(const MBBCFAInfo &Pred, const MBBCFAInfo &Succ) { argument
304 errs() << "Succ: " << Succ.MBB->getName() << " #" << Succ.MBB->getNumber()
305 << " incoming CFA Reg:" << Succ.IncomingCFARegister << "\n";
306 errs() << "Succ
[all...]
H A DMachineBlockPlacement.cpp421 const MachineBasicBlock *BB, const MachineBasicBlock *Succ,
435 const MachineBasicBlock *BB, const MachineBasicBlock *Succ,
494 const MachineBasicBlock *BB, const MachineBasicBlock *Succ,
518 const MachineBasicBlock *BB, MachineBasicBlock *Succ,
610 for (MachineBasicBlock *Succ : MBB->successors()) {
611 if (BlockFilter && !BlockFilter->count(Succ))
613 BlockChain &SuccChain = *BlockToChain[Succ];
615 if (&Chain == &SuccChain || Succ == LoopHeaderBB)
657 for (MachineBasicBlock *Succ : BB->successors()) {
659 if (Succ
743 isProfitableToTailDup( const MachineBasicBlock *BB, const MachineBasicBlock *Succ, BranchProbability QProb, const BlockChain &Chain, const BlockFilterSet *BlockFilter) argument
1077 canTailDuplicateUnplacedPreds( const MachineBasicBlock *BB, MachineBasicBlock *Succ, const BlockChain &Chain, const BlockFilterSet *BlockFilter) argument
1342 hasBetterLayoutPredecessor( const MachineBasicBlock *BB, const MachineBasicBlock *Succ, const BlockChain &SuccChain, BranchProbability SuccProb, BranchProbability RealSuccProb, const BlockChain &Chain, const BlockFilterSet *BlockFilter) argument
1542 MachineBasicBlock *Succ = FoundEdge->second.BB; local
1604 MachineBasicBlock *Succ; local
[all...]
H A DMachineDominators.cpp103 MachineBasicBlock *Succ = Edge.ToBB; local
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,
H A DMachineBasicBlock.cpp655 void MachineBasicBlock::addSuccessor(MachineBasicBlock *Succ,
661 Successors.push_back(Succ);
662 Succ->addPredecessor(this);
665 void MachineBasicBlock::addSuccessorWithoutProb(MachineBasicBlock *Succ) {
670 Successors.push_back(Succ);
671 Succ->addPredecessor(this);
693 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *Succ,
695 succ_iterator I = find(Successors, Succ);
779 MachineBasicBlock *Succ = *FromMBB->succ_begin();
785 addSuccessor(Succ, Pro
[all...]
H A DMachineTraceMetrics.cpp219 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;
509 TBI.Succ = pickTraceSucc(I);
511 if (TBI.Succ)
512 dbgs() << printMBBReference(*TBI.Succ) << '\
[all...]
H A DLiveRegUnits.cpp125 for (const MachineBasicBlock *Succ : MBB.successors())
126 addBlockLiveIns(*this, *Succ);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCFG.h41 unsigned GetSuccessorNumber(const BasicBlock *BB, const BasicBlock *Succ);
49 bool isCriticalEdge(const Instruction *TI, const BasicBlock *Succ,
160 for (NodeT Succ : make_range(GT::child_begin(Node), GT::child_end(Node))) {
161 // Succ hasn't been visited yet
162 if (!Visited.count(Succ))
164 // We already visited Succ, thus Node->Succ must be a backedge. Check that
167 if (!isProperBackedge(Node, Succ))
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopSimplifyCFG.cpp199 for (auto *Succ : successors(BB))
200 if (L.contains(Succ) && !LI.isLoopHeader(Succ) && RPO[BB] > RPO[Succ])
249 for (BasicBlock *Succ : successors(BB))
250 if (!TakeFoldCandidate || TheOnlySucc == Succ) {
251 if (L.contains(Succ))
252 LiveLoopBlocks.insert(Succ);
254 LiveExitBlocks.insert(Succ);
297 return any_of(successors(BB), [&](BasicBlock *Succ) {
654 BasicBlock *Succ = cast_or_null<BasicBlock>(Block); local
[all...]
H A DADCE.cpp285 for (auto *Succ : successors(BB))
286 if (State.onStack(Succ)) {
590 for (auto *Succ : successors(BB)) {
591 auto *Info = &BlockInfo[Succ];
601 for (auto *Succ : successors(BB)) {
602 if (!First || Succ != PreferredSucc->BB) {
603 Succ->removePredecessor(BB);
604 RemovedSuccessors.insert(Succ);
612 for (auto *Succ : RemovedSuccessors) {
615 if (Succ !
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixIrreducibleControlFlow.cpp132 for (auto *Succ : MBB->successors()) {
133 if (Succ != Entry && inRegion(Succ)) {
134 Reachable[MBB].insert(Succ);
135 WorkList.emplace_back(MBB, Succ);
141 MachineBasicBlock *MBB, *Succ; local
142 std::tie(MBB, Succ) = WorkList.pop_back_val();
143 assert(inRegion(MBB) && Succ != Entry && inRegion(Succ));
145 // We recently added MBB => Succ, an
[all...]
H A DWebAssemblyExceptionInfo.cpp133 for (auto *Succ : MBB->successors())
134 if (MDT.dominates(EHPad, Succ))
135 WL.push_back(Succ);
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DCoreEngine.cpp97 const CFGBlock *Succ = *(Entry->succ_begin()); local
101 BlockEdge StartLoc(Entry, Succ, L);
556 ExplodedNode *Succ = G.getNode(Loc, N->getState(), false, &IsNew); local
557 Succ->addPredecessor(N, G);
560 WList->enqueue(Succ, Block, Idx+1);
643 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred); local
644 return Succ;
652 ExplodedNode *Succ = local
655 Succ->addPredecessor(Pred, Eng.G);
661 Eng.WList->enqueue(Succ);
670 ExplodedNode *Succ = local
694 ExplodedNode *Succ = local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.cpp443 for (SDep& Succ : SU->Succs) {
444 if (BC->isSUInBlock(Succ.getSUnit(), ID))
445 undoReleaseSucc(SU, &Succ);
484 for (SDep& Succ : SU->Succs) {
485 SUnit *SuccSU = Succ.getSUnit();
493 releaseSucc(SU, &Succ);
516 for (SDep& Succ : SU->Succs) {
518 NodeNum2Index.find(Succ.getSUnit()->NodeNum);
555 void SIScheduleBlock::addSucc(SIScheduleBlock *Succ, argument
557 unsigned SuccID = Succ
862 SUnit *Succ = SuccDep.getSUnit(); local
946 SUnit *Succ = SuccDep.getSUnit(); local
1016 SUnit *Succ = SuccDep.getSUnit(); local
1037 SUnit *Succ = SuccDep.getSUnit(); local
1058 SUnit *Succ = SuccDep.getSUnit(); local
1090 SUnit *Succ = SuccDep.getSUnit(); local
1119 SUnit *Succ = SuccDep.getSUnit(); local
1236 SUnit *Succ = SuccDep.getSUnit(); local
1868 SUnit *Succ = SuccDep.getSUnit(); local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h174 // 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);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanVerifier.cpp64 for (const VPBlockBase *Succ : Successors) {
66 const auto &SuccPreds = Succ->getPredecessors();
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/MCA/HardwareUnits/
H A DLSUnit.h45 SmallVector<MemoryGroup *, 4> Succ; member in class:llvm::mca::MemoryGroup
60 ArrayRef<MemoryGroup *> getSuccessors() const { return Succ; }
61 unsigned getNumSuccessors() const { return Succ.size(); }
85 Succ.emplace_back(Group);
138 for (MemoryGroup *MG : Succ)
151 for (MemoryGroup *MG : Succ)
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DObjCSuperDeallocChecker.cpp72 PathDiagnosticPieceRef VisitNode(const ExplodedNode *Succ,
246 SuperDeallocBRVisitor::VisitNode(const ExplodedNode *Succ, argument
252 ProgramStateRef State = Succ->getState();
255 Succ->getState()->contains<CalledSuperDealloc>(ReceiverSymbol);
257 Succ->getFirstPred()->getState()->contains<CalledSuperDealloc>(
260 // Is Succ the node on which the analyzer noted that [super dealloc] was
265 ProgramPoint P = Succ->getLocation();
H A DTestAfterDivZeroChecker.cpp72 PathDiagnosticPieceRef VisitNode(const ExplodedNode *Succ,
96 DivisionBRVisitor::VisitNode(const ExplodedNode *Succ, BugReporterContext &BRC, argument
103 if (Optional<PostStmt> P = Succ->getLocationAs<PostStmt>())
115 SVal S = Succ->getSVal(E);
116 if (ZeroSymbol == S.getAsSymbol() && SFC == Succ->getStackFrame()) {
120 ProgramPoint P = Succ->getLocation();
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp107 for (const SDep &Succ : SU->Succs) {
108 if (Succ.isCtrl())
111 SUnit *SuccSU = Succ.getSUnit();
144 for (const SDep &Succ : SU->Succs)
145 if (Succ.isCtrl())
229 for (const SDep &Succ : SU->Succs)
230 if (getSingleUnscheduledPred(Succ.getSUnit()) == SU)
268 for (const SDep &Succ : Packet[i]->Succs) {
271 if (Succ.isCtrl())
274 if (Succ
[all...]
H A DScheduleDAGFast.cpp192 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...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DEHPersonalities.cpp131 for (BasicBlock *Succ : successors(Visiting))
132 Worklist.push_back({Succ, SuccColor});
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp238 for (auto *Succ : successors()) {
240 if (Succ->BlockID <= BlockID) continue;
243 Candidate = Succ;
247 auto *Alternate = Succ;
H A DCFG.cpp479 CFGBlock *Succ = nullptr; member in class:__anon298::CFGBuilder
673 Succ = S;
679 CFGBlock *Succ = nullptr; member in struct:__anon298::CFGBuilder::TempDtorContext
1488 Succ = createBlock();
1489 assert(Succ == &cfg->getExit());
1525 VBaseSucc = Succ = B ? B : &cfg->getExit();
1534 Succ = VBaseSucc;
1543 Succ = B;
1613 if (add_successor && Succ)
1614 addSuccessor(B, Succ);
5055 addSuccessor(AdjacentBlock Succ, BumpVectorContext &C) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/MSP430/
H A DMSP430BranchSelector.cpp160 for (MachineBasicBlock *Succ : MBB->successors()) {
161 if (Succ == DestBB) {
164 MBB->replaceSuccessor(Succ, NewBB);
165 NewBB->addSuccessor(Succ);

Completed in 221 milliseconds

123456