/openbsd-current/gnu/llvm/llvm/lib/CodeGen/ |
H A D | LoopTraversal.cpp | 45 for (MachineBasicBlock *Succ : ActiveMBB->successors()) { 46 unsigned SuccNumber = Succ->getNumber(); 49 if (!isBlockDone(Succ)) { 54 if (isBlockDone(Succ)) 55 Workqueue.push_back(Succ);
|
H A D | 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";
|
H A D | MachineBlockPlacement.cpp | 493 const MachineBasicBlock *BB, const MachineBasicBlock *Succ, 552 const MachineBasicBlock *BB, const MachineBasicBlock *Succ, 576 const MachineBasicBlock *BB, MachineBasicBlock *Succ, 677 for (MachineBasicBlock *Succ : MBB->successors()) { 678 if (BlockFilter && !BlockFilter->count(Succ)) 680 BlockChain &SuccChain = *BlockToChain[Succ]; 682 if (&Chain == &SuccChain || Succ == LoopHeaderBB) 724 for (MachineBasicBlock *Succ : BB->successors()) { 726 if (Succ->isEHPad() || (BlockFilter && !BlockFilter->count(Succ))) { 810 isProfitableToTailDup( const MachineBasicBlock *BB, const MachineBasicBlock *Succ, BranchProbability QProb, const BlockChain &Chain, const BlockFilterSet *BlockFilter) argument 1144 canTailDuplicateUnplacedPreds( const MachineBasicBlock *BB, MachineBasicBlock *Succ, const BlockChain &Chain, const BlockFilterSet *BlockFilter) argument 1411 hasBetterLayoutPredecessor( const MachineBasicBlock *BB, const MachineBasicBlock *Succ, const BlockChain &SuccChain, BranchProbability SuccProb, BranchProbability RealSuccProb, const BlockChain &Chain, const BlockFilterSet *BlockFilter) argument 1611 MachineBasicBlock *Succ = FoundEdge->second.BB; local 1673 MachineBasicBlock *Succ; local [all...] |
H A D | CFIInstrInserter.cpp | 127 void reportCFAError(const MBBCFAInfo &Pred, const MBBCFAInfo &Succ); 128 void reportCSRError(const MBBCFAInfo &Pred, const MBBCFAInfo &Succ); 285 for (auto *Succ : CurrentInfo.MBB->successors()) { 286 MBBCFAInfo &SuccInfo = MBBVector[Succ->getNumber()]; 291 Stack.push_back(Succ); 391 const MBBCFAInfo &Succ) { 400 errs() << "Succ: " << Succ.MBB->getName() << " #" << Succ.MBB->getNumber() 401 << " incoming CFA Reg:" << Succ 390 reportCFAError(const MBBCFAInfo &Pred, const MBBCFAInfo &Succ) argument 406 reportCSRError(const MBBCFAInfo &Pred, const MBBCFAInfo &Succ) argument [all...] |
H A D | MachineDominators.cpp | 105 MachineBasicBlock *Succ = Edge.ToBB; local 106 MachineDomTreeNode *SuccDTNode = DT->getNode(Succ); 108 for (MachineBasicBlock *PredBB : Succ->predecessors()) { 120 // Succ 143 // If all the other predecessors of "Succ" are dominated by "Succ" itself 144 // then the new block is the new immediate dominator of "Succ". Otherwise,
|
H A D | LatencyPriorityQueue.cpp | 76 for (const SDep &Succ : SU->Succs) 77 if (getSingleUnscheduledPred(Succ.getSUnit()) == SU) 90 for (const SDep &Succ : SU->Succs) 91 AdjustPriorityOfUnscheduledPreds(Succ.getSUnit());
|
H A D | MachineTraceMetrics.cpp | 218 if (!TBI->Succ) { 226 unsigned SuccNum = TBI->Succ->getNumber(); 359 for (const MachineBasicBlock *Succ : MBB->successors()) { 361 if (CurLoop && Succ == CurLoop->getHeader()) 364 if (isExitingLoop(CurLoop, getLoopFor(Succ))) 367 getHeightResources(Succ); 374 Best = Succ; 508 TBI.Succ = pickTraceSucc(I); 510 if (TBI.Succ) 511 dbgs() << printMBBReference(*TBI.Succ) << '\ [all...] |
H A D | MachineBasicBlock.cpp | 286 for (const MachineBasicBlock *Succ : successors()) 287 if (Succ->isEHPad()) 303 for (const MachineBasicBlock *Succ : successors()) { 304 if (Succ->isInlineAsmBrIndirectTarget()) 772 void MachineBasicBlock::addSuccessor(MachineBasicBlock *Succ, 778 Successors.push_back(Succ); 779 Succ->addPredecessor(this); 782 void MachineBasicBlock::addSuccessorWithoutProb(MachineBasicBlock *Succ) { 787 Successors.push_back(Succ); 788 Succ [all...] |
/openbsd-current/gnu/llvm/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, 151 for (NodeT Succ : make_range(GT::child_begin(Node), GT::child_end(Node))) { 152 // Succ hasn't been visited yet 153 if (!Visited.count(Succ)) 155 // We already visited Succ, thus Node->Succ must be a backedge. Check that 158 if (!isProperBackedge(Node, Succ))
|
/openbsd-current/gnu/llvm/llvm/include/llvm/Support/ |
H A D | 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);
|
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);
|
/openbsd-current/gnu/llvm/llvm/lib/Transforms/Scalar/ |
H A D | LoopSimplifyCFG.cpp | 194 for (auto *Succ : successors(BB)) 195 if (L.contains(Succ) && !LI.isLoopHeader(Succ) && RPO[BB] > RPO[Succ]) 244 for (BasicBlock *Succ : successors(BB)) 245 if (!TakeFoldCandidate || TheOnlySucc == Succ) { 246 if (L.contains(Succ)) 247 LiveLoopBlocks.insert(Succ); 249 LiveExitBlocks.insert(Succ); 296 return any_of(successors(BB), [&](BasicBlock *Succ) { 675 BasicBlock *Succ = cast_or_null<BasicBlock>(Block); local [all...] |
/openbsd-current/gnu/llvm/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyFixIrreducibleControlFlow.cpp | 144 for (auto *Succ : MBB->successors()) { 145 if (Succ != Entry && inRegion(Succ)) { 146 Reachable[MBB].insert(Succ); 147 WorkList.emplace_back(MBB, Succ); 153 MachineBasicBlock *MBB, *Succ; local 154 std::tie(MBB, Succ) = WorkList.pop_back_val(); 155 assert(inRegion(MBB) && Succ != Entry && inRegion(Succ)); 157 // We recently added MBB => Succ, an [all...] |
H A D | 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);
|
H A D | WebAssemblyExceptionInfo.cpp | 71 for (auto *Succ : MBB->successors()) 72 if (!Visited.count(Succ) && MDT.dominates(Header, Succ)) 73 WL.push_back(Succ); 317 for (auto *Succ : MBB->successors()) 318 if (MDT.dominates(EHPad, Succ)) 319 WL.push_back(Succ);
|
H A D | WebAssemblyLateEHPrepare.cpp | 105 for (auto *Succ : Succs) 106 MBB->removeSuccessor(Succ); 279 for (auto *Succ : Succs) 280 if (!Succ->isEHPad()) 281 MBB.removeSuccessor(Succ);
|
/openbsd-current/gnu/llvm/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUSetWavePriority.cpp | 89 for (const MachineBasicBlock *Succ : Pred->successors()) { 90 if (MBBInfos[Succ].MayReachVMEMLoad) 150 for (const MachineBasicBlock *Succ : MBB->successors()) { 151 SuccsMayReachVMEMLoad |= MBBInfos[Succ].MayReachVMEMLoad; 153 std::max(NumFollowingVALUInsts, MBBInfos[Succ].NumVALUInstsAtStart);
|
H A D | 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, argument 538 unsigned SuccID = Succ 844 SUnit *Succ = SuccDep.getSUnit(); local 926 SUnit *Succ = SuccDep.getSUnit(); local 996 SUnit *Succ = SuccDep.getSUnit(); local 1017 SUnit *Succ = SuccDep.getSUnit(); local 1038 SUnit *Succ = SuccDep.getSUnit(); local 1070 SUnit *Succ = SuccDep.getSUnit(); local 1099 SUnit *Succ = SuccDep.getSUnit(); local 1206 SUnit *Succ = SuccDep.getSUnit(); local 1827 SUnit *Succ = SuccDep.getSUnit(); local [all...] |
/openbsd-current/gnu/llvm/clang/lib/StaticAnalyzer/Core/ |
H A D | CoreEngine.cpp | 105 const CFGBlock *Succ = *(Entry->succ_begin()); local 109 BlockEdge StartLoc(Entry, Succ, L); 585 ExplodedNode *Succ = G.getNode(Loc, N->getState(), false, &IsNew); local 586 Succ->addPredecessor(N, G); 589 WList->enqueue(Succ, Block, Idx+1); 672 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred); local 673 return Succ; 681 ExplodedNode *Succ = local 684 Succ->addPredecessor(Pred, Eng.G); 690 Eng.WList->enqueue(Succ); 699 ExplodedNode *Succ = local 723 ExplodedNode *Succ = local [all...] |
/openbsd-current/gnu/llvm/llvm/lib/Analysis/ |
H A D | FunctionPropertiesAnalysis.cpp | 213 for (const auto *Succ : Successors) 214 if (DT.isReachableFromEntry(Succ)) 215 Reinclude.insert(Succ); 217 Unreachable.insert(Succ); 243 for (const auto *Succ : successors(U)) 244 if (!DT.isReachableFromEntry(Succ)) 245 Unreachable.insert(Succ);
|
H A D | LoopNestAnalysis.cpp | 376 for (const BasicBlock *Succ : BI->successors()) { 377 const BasicBlock *PotentialInnerPreHeader = Succ; 378 const BasicBlock *PotentialOuterLatch = Succ; 382 if (Succ->size() == 1) { 384 &LoopNest::skipEmptyBlockUntil(Succ, InnerLoopPreHeader); 386 &LoopNest::skipEmptyBlockUntil(Succ, OuterLoopLatch); 398 if (InnerLoopExitContainsLCSSA && IsExtraPhiBlock(*Succ) && 399 Succ->getSingleSuccessor() == OuterLoopLatch) { 404 ExtraPhiBlock = Succ; 409 dbgs() << "Inner loop guard successor " << Succ [all...] |
/openbsd-current/gnu/llvm/llvm/examples/IRTransforms/ |
H A D | SimplifyCFG.cpp | 75 for (BasicBlock *Succ : successors(&BB)) 76 Succ->removePredecessor(&BB); 79 // for (PHINode &PN : make_early_inc_range(Succ->phis())) 116 for (BasicBlock *Succ : successors(&BB)) { 117 Succ->removePredecessor(&BB); 120 DTUpdates.push_back({DominatorTree::Delete, &BB, Succ}); 323 for (BasicBlock *Succ : successors(&BB)) { 324 DTUpdates.push_back({DominatorTree::Delete, &BB, Succ}); 325 DTUpdates.push_back({DominatorTree::Insert, Pred, Succ});
|
/openbsd-current/gnu/llvm/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();
|
/openbsd-current/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ResourcePriorityQueue.cpp | 107 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()) 228 for (const SDep &Succ : SU->Succs) 229 if (getSingleUnscheduledPred(Succ.getSUnit()) == SU) 267 for (const SDep &Succ : S->Succs) { 270 if (Succ.isCtrl()) 273 if (Succ [all...] |
H A D | ScheduleDAGFast.cpp | 188 for (SDep &Succ : SU->Succs) { 189 if (Succ.isAssignedRegDep()) { 190 if (LiveRegCycles[Succ.getReg()] == Succ.getSUnit()->getHeight()) { 192 assert(LiveRegDefs[Succ.getReg()] == SU && 195 LiveRegDefs[Succ.getReg()] = nullptr; 196 LiveRegCycles[Succ.getReg()] = 0; 287 for (SDep &Succ : SU->Succs) { 288 if (Succ.isCtrl()) 289 ChainSuccs.push_back(Succ); [all...] |