/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | CFG.h | 43 unsigned GetSuccessorNumber(const BasicBlock *BB, const BasicBlock *Succ); 51 bool isCriticalEdge(const Instruction *TI, const BasicBlock *Succ, 162 for (NodeT Succ : make_range(GT::child_begin(Node), GT::child_end(Node))) { 163 // Succ hasn't been visited yet 164 if (!Visited.count(Succ)) 166 // We already visited Succ, thus Node->Succ must be a backedge. Check that 169 if (!isProperBackedge(Node, Succ))
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | 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);
|
H A D | MachineBlockPlacement.cpp | 428 const MachineBasicBlock *BB, const MachineBasicBlock *Succ, 447 const MachineBasicBlock *BB, const MachineBasicBlock *Succ, 506 const MachineBasicBlock *BB, const MachineBasicBlock *Succ, 530 const MachineBasicBlock *BB, MachineBasicBlock *Succ, 622 for (MachineBasicBlock *Succ : MBB->successors()) { 623 if (BlockFilter && !BlockFilter->count(Succ)) 625 BlockChain &SuccChain = *BlockToChain[Succ]; 627 if (&Chain == &SuccChain || Succ == LoopHeaderBB) 669 for (MachineBasicBlock *Succ : BB->successors()) { 671 if (Succ 755 isProfitableToTailDup( const MachineBasicBlock *BB, const MachineBasicBlock *Succ, BranchProbability QProb, const BlockChain &Chain, const BlockFilterSet *BlockFilter) argument 1089 canTailDuplicateUnplacedPreds( const MachineBasicBlock *BB, MachineBasicBlock *Succ, const BlockChain &Chain, const BlockFilterSet *BlockFilter) argument 1356 hasBetterLayoutPredecessor( const MachineBasicBlock *BB, const MachineBasicBlock *Succ, const BlockChain &SuccChain, BranchProbability SuccProb, BranchProbability RealSuccProb, const BlockChain &Chain, const BlockFilterSet *BlockFilter) argument 1556 MachineBasicBlock *Succ = FoundEdge->second.BB; local 1618 MachineBasicBlock *Succ; local [all...] |
H A D | CFIInstrInserter.cpp | 130 void reportCFAError(const MBBCFAInfo &Pred, const MBBCFAInfo &Succ); 131 void reportCSRError(const MBBCFAInfo &Pred, const MBBCFAInfo &Succ); 281 for (auto *Succ : CurrentInfo.MBB->successors()) { 282 MBBCFAInfo &SuccInfo = MBBVector[Succ->getNumber()]; 287 Stack.push_back(Succ); 386 const MBBCFAInfo &Succ) { 395 errs() << "Succ: " << Succ.MBB->getName() << " #" << Succ.MBB->getNumber() 396 << " incoming CFA Reg:" << Succ 385 reportCFAError(const MBBCFAInfo &Pred, const MBBCFAInfo &Succ) argument 401 reportCSRError(const MBBCFAInfo &Pred, const MBBCFAInfo &Succ) argument [all...] |
H A D | MachineDominators.cpp | 103 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 D | MachineBasicBlock.cpp | 281 for (const MachineBasicBlock *Succ : successors()) { 282 if (Succ->isInlineAsmBrIndirectTarget()) 675 void MachineBasicBlock::addSuccessor(MachineBasicBlock *Succ, 681 Successors.push_back(Succ); 682 Succ->addPredecessor(this); 685 void MachineBasicBlock::addSuccessorWithoutProb(MachineBasicBlock *Succ) { 690 Successors.push_back(Succ); 691 Succ->addPredecessor(this); 713 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *Succ, 715 succ_iterator I = find(Successors, Succ); [all...] |
H A D | 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; 509 TBI.Succ = pickTraceSucc(I); 511 if (TBI.Succ) 512 dbgs() << printMBBReference(*TBI.Succ) << '\ [all...] |
H A D | LiveRegUnits.cpp | 125 for (const MachineBasicBlock *Succ : MBB.successors()) 126 addBlockLiveIns(*this, *Succ);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopSimplifyCFG.cpp | 201 for (auto *Succ : successors(BB)) 202 if (L.contains(Succ) && !LI.isLoopHeader(Succ) && RPO[BB] > RPO[Succ]) 251 for (BasicBlock *Succ : successors(BB)) 252 if (!TakeFoldCandidate || TheOnlySucc == Succ) { 253 if (L.contains(Succ)) 254 LiveLoopBlocks.insert(Succ); 256 LiveExitBlocks.insert(Succ); 299 return any_of(successors(BB), [&](BasicBlock *Succ) { 656 BasicBlock *Succ = cast_or_null<BasicBlock>(Block); local [all...] |
H A D | ADCE.cpp | 285 for (auto *Succ : successors(BB)) 286 if (State.onStack(Succ)) { 591 for (auto *Succ : successors(BB)) { 592 auto *Info = &BlockInfo[Succ]; 602 for (auto *Succ : successors(BB)) { 603 if (!First || Succ != PreferredSucc->BB) { 604 Succ->removePredecessor(BB); 605 RemovedSuccessors.insert(Succ); 613 for (auto *Succ : RemovedSuccessors) { 616 if (Succ ! [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | 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; local 153 std::tie(MBB, Succ) = WorkList.pop_back_val(); 154 assert(inRegion(MBB) && Succ != Entry && inRegion(Succ)); 156 // We recently added MBB => Succ, an [all...] |
H A D | WebAssemblyFixBrTableDefaults.cpp | 102 for (auto &Succ : MBB->successors()) 103 if (HeaderMBB->isSuccessor(Succ)) 104 HeaderMBB->removeSuccessor(Succ);
|
H A D | WebAssemblyExceptionInfo.cpp | 136 for (auto *Succ : MBB->successors()) 137 if (MDT.dominates(EHPad, Succ)) 138 WL.push_back(Succ);
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | CFGDiff.h | 81 UpdateMapType Succ; member in struct:llvm::GraphDiff::EdgesInsertedDeleted 123 Edges[IsInsert].Succ[U.getFrom()].push_back(U.getTo()); 140 auto &SuccList = Edges[IsInsert].Succ[U.getFrom()]; 144 Edges[IsInsert].Succ.erase(U.getFrom()); 159 (InverseEdge != InverseGraph) ? Edges[0].Pred : Edges[0].Succ; 170 (InverseEdge != InverseGraph) ? Edges[1].Pred : Edges[1].Succ; 182 printMap(OS, Edges[1].Succ); 184 printMap(OS, Edges[0].Succ);
|
H A D | 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);
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | CoreEngine.cpp | 96 const CFGBlock *Succ = *(Entry->succ_begin()); local 100 BlockEdge StartLoc(Entry, Succ, L); 555 ExplodedNode *Succ = G.getNode(Loc, N->getState(), false, &IsNew); local 556 Succ->addPredecessor(N, G); 559 WList->enqueue(Succ, Block, Idx+1); 642 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred); local 643 return Succ; 651 ExplodedNode *Succ = local 654 Succ->addPredecessor(Pred, Eng.G); 660 Eng.WList->enqueue(Succ); 669 ExplodedNode *Succ = local 693 ExplodedNode *Succ = local [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SIMachineScheduler.cpp | 443 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 864 SUnit *Succ = SuccDep.getSUnit(); local 948 SUnit *Succ = SuccDep.getSUnit(); local 1018 SUnit *Succ = SuccDep.getSUnit(); local 1039 SUnit *Succ = SuccDep.getSUnit(); local 1060 SUnit *Succ = SuccDep.getSUnit(); local 1092 SUnit *Succ = SuccDep.getSUnit(); local 1121 SUnit *Succ = SuccDep.getSUnit(); local 1238 SUnit *Succ = SuccDep.getSUnit(); local 1867 SUnit *Succ = SuccDep.getSUnit(); local [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VPlanVerifier.cpp | 65 for (const VPBlockBase *Succ : Successors) { 67 const auto &SuccPreds = Succ->getPredecessors();
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
H A D | ObjCSuperDeallocChecker.cpp | 72 PathDiagnosticPieceRef VisitNode(const ExplodedNode *Succ, 247 SuperDeallocBRVisitor::VisitNode(const ExplodedNode *Succ, argument 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();
|
H A D | TestAfterDivZeroChecker.cpp | 72 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-13-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | 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 [all...] |
H A D | 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...] |
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | EHPersonalities.cpp | 131 for (BasicBlock *Succ : successors(Visiting)) 132 Worklist.push_back({Succ, SuccColor});
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/Analysis/ |
H A D | ThreadSafetyTIL.cpp | 238 for (auto *Succ : successors()) { 240 if (Succ->BlockID <= BlockID) continue; 243 Candidate = Succ; 247 auto *Alternate = Succ;
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/MSP430/ |
H A D | MSP430BranchSelector.cpp | 160 for (MachineBasicBlock *Succ : MBB->successors()) { 161 if (Succ == DestBB) { 164 MBB->replaceSuccessor(Succ, NewBB); 165 NewBB->addSuccessor(Succ);
|