Searched refs:Succ (Results 76 - 100 of 151) sorted by relevance

1234567

/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DJumpThreading.cpp440 BasicBlock *Succ = BI->getSuccessor(0); local
446 !LoopHeaders.count(&BB) && !LoopHeaders.count(Succ) &&
448 RemoveRedundantDbgInstrs(Succ);
1054 BasicBlock *Succ = BBTerm->getSuccessor(i); local
1055 Succ->removePredecessor(BB, true);
1056 Updates.push_back({DominatorTree::Delete, BB, Succ});
1715 for (BasicBlock *Succ : successors(Pred))
1716 if (Succ == BB)
2435 for (BasicBlock *Succ : successors(BB)) {
2436 auto SuccFreq = (Succ
[all...]
H A DStructurizeCFG.cpp433 for (BasicBlock *Succ : Term->successors())
434 if (Visited.count(Succ))
435 Loops[Succ] = BB;
469 BasicBlock *Succ = Term->getSuccessor(i); local
470 if (Succ != BB)
H A DLoopInterchange.cpp615 for (BasicBlock *Succ : successors(OuterLoopHeaderBI))
616 if (Succ != InnerLoopPreHeader && Succ != InnerLoop->getHeader() &&
617 Succ != OuterLoopLatch)
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopUnrollRuntime.cpp93 for (BasicBlock *Succ : successors(Latch)) {
94 for (PHINode &PN : Succ->phis()) {
107 // Succ is loop header.
111 // Succ is LatchExit.
250 for (BasicBlock *Succ : successors(Latch)) {
252 if (!L->contains(Succ))
254 for (PHINode &PN : Succ->phis()) {
H A DLowerSwitch.cpp368 BasicBlock* Succ = Leaf.BB; local
369 BranchInst::Create(Succ, Default, Comp, NewLeaf);
373 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
H A DCodeMoverUtils.cpp289 for (BasicBlock *Succ : successors(&I))
290 WorkList.insert(&Succ->front());
H A DFlattenCFG.cpp501 for (BasicBlock *Succ : successors(PBI)) {
502 for (PHINode &Phi : Succ->phis()) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsBranchExpansion.cpp206 MachineBasicBlock *Succ = Parent->getNextNode(); local
207 if (Succ != nullptr && Parent->isSuccessor(Succ)) {
208 Position = Succ->begin();
209 Parent = Succ;
H A DMipsDelaySlotFiller.cpp290 bool examinePred(MachineBasicBlock &Pred, const MachineBasicBlock &Succ,
922 const MachineBasicBlock &Succ,
927 getBranch(Pred, Succ);
937 RegDU.addLiveOut(Pred, Succ);
921 examinePred(MachineBasicBlock &Pred, const MachineBasicBlock &Succ, RegDefsUses &RegDU, bool &HasMultipleSuccs, BB2BrMap &BrMap) const argument
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUMachineCFGStructurizer.cpp513 MachineBasicBlock *Succ = nullptr;
559 dbgs() << "Succ: " << getSucc()->getNumber() << "\n";
561 dbgs() << "Succ: none \n";
583 void setSucc(MachineBasicBlock *MBB) { Succ = MBB; }
585 MachineBasicBlock *getSucc() { return Succ; }
843 auto Succ = Region->getSucc();
844 for (auto &II : *Succ) {
1251 MachineBasicBlock *Succ = Region->getSucc();
1264 if (Current == Succ) {
1267 *(Current->succ_begin()) == Succ) {
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachinePipeliner.h338 for (const SDep &Succ : Nodes[i]->Succs) {
339 auto SuccSUnit = Succ.getSUnit();
342 unsigned CurLatency = Succ.getLatency();
H A DMachineTraceMetrics.h162 const MachineBasicBlock *Succ = nullptr; member in struct:llvm::MachineTraceMetrics::TraceBlockInfo
H A DScheduleDAG.h440 for (const SDep &Succ : Succs)
441 if (Succ.getSUnit() == N)
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DIfConversion.cpp2222 for (MachineBasicBlock *Succ : Succs) {
2224 if (Succ == FallThrough)
2226 ToBBI.BB->addSuccessor(Succ);
2281 for (MachineBasicBlock *Succ : FromSuccs) {
2283 if (Succ == FallThrough) {
2284 FromMBB.removeSuccessor(Succ);
2290 // Calculate the edge probability for the edge from ToBBI.BB to Succ,
2291 // which is a portion of the edge probability from FromMBB to Succ. The
2294 NewProb = MBPI->getEdgeProbability(&FromMBB, Succ);
2305 FromMBB.removeSuccessor(Succ);
[all...]
H A DBranchRelaxation.cpp454 for (const MachineBasicBlock *Succ : MBB->successors()) {
455 for (const MachineBasicBlock::RegisterMaskPair &LiveIn : Succ->liveins())
H A DMachineVerifier.cpp541 for (const MachineBasicBlock *Succ : MBB->successors())
542 markReachable(Succ);
2258 for (const MachineBasicBlock *Succ : MBB.successors()) {
2259 unsigned SuccNumber = RPONumbers[Succ];
2262 RPOWorklist.emplace(SuccNumber, Succ);
2272 for (const MachineBasicBlock *Succ : MBB->successors()) {
2273 if (Succ == MBB)
2275 unsigned SuccNumber = RPONumbers[Succ];
2278 RPOWorklist.emplace(SuccNumber, Succ);
2961 for (const MachineBasicBlock *Succ
[all...]
H A DMachineInstr.cpp765 MachineBasicBlock::instr_iterator Succ = getIterator(); local
766 ++Succ;
767 assert(!Succ->isBundledWithPred() && "Inconsistent bundle flags");
768 Succ->setFlag(BundledPred);
783 MachineBasicBlock::instr_iterator Succ = getIterator(); local
784 ++Succ;
785 assert(Succ->isBundledWithPred() && "Inconsistent bundle flags");
786 Succ->clearFlag(BundledPred);
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DPartialInlining.cpp563 // Returns true if Succ is BB's successor
564 auto IsSuccessor = [](BasicBlock *Succ, BasicBlock *BB) {
565 return is_contained(successors(BB), Succ);
656 for (auto Succ : successors(E)) {
657 if (Entries.count(Succ))
659 if (Succ == OutliningInfo->ReturnBlock)
661 else if (Succ != OutliningInfo->NonReturnBlock)
H A DSampleProfile.cpp1309 for (auto *Succ : Successors[BB]) {
1310 Edge E = std::make_pair(BB, Succ);
1392 for (auto *Succ : Successors[BB]) {
1393 Edge E = std::make_pair(BB, Succ);
1579 BasicBlock *Succ = TI->getSuccessor(I); local
1580 Edge E = std::make_pair(BB, Succ);
1596 MaxDestInst = Succ->getFirstNonPHIOrDbgOrLifetime();
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyCFGStackify.cpp982 for (auto *Succ : MBB.successors()) {
983 if (Succ->isEHPad()) {
984 UnwindDest = Succ;
1217 for (auto *Succ : MBB->successors()) {
1218 if (Succ->isEHPad()) {
1219 EHPad = Succ;
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonStoreWidening.cpp545 bool Succ = selectStores(I++, E, OG, CollectedSize, MaxWideSize) && local
548 if (!Succ)
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64CollectLOH.cpp527 for (const MachineBasicBlock *Succ : MBB.successors()) {
528 for (const auto &LI : Succ->liveins()) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DObjCARCOpts.cpp321 void addSucc(BasicBlock *Succ) { Succs.push_back(Succ); } argument
1278 for (const BasicBlock *Succ : successors(BB)) {
1282 BBStates.find(Succ);
1424 const BasicBlock *Succ = *SI; local
1425 DenseMap<const BasicBlock *, BBState>::iterator I = BBStates.find(Succ);
1430 Succ = *SI;
1431 I = BBStates.find(Succ);
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DBlockFrequencyInfoImpl.h445 /// Adds an edge to Succ to Dist. If \c LoopHead.isValid(), then whether the
451 const BlockNode &Pred, const BlockNode &Succ, uint64_t Weight);
658 void addEdge(IrrNode &Irr, const BlockNode &Succ,
1333 for (const auto Succ : children<const BlockT *>(BB))
1334 G.addEdge(Irr, BFI.getNode(Succ), OuterLoop);
/freebsd-13-stable/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafetyCommon.cpp924 void SExprBuilder::handleSuccessor(const CFGBlock *Succ) { argument
928 void SExprBuilder::handleSuccessorBackEdge(const CFGBlock *Succ) { argument
929 mergePhiNodesBackEdge(Succ);
930 ++BBInfo[Succ->getBlockID()].ProcessedPredecessors;

Completed in 168 milliseconds

1234567