| /openbsd/src/gnu/llvm/llvm/lib/Target/PowerPC/ |
| D | PPCExpandISEL.cpp | 335 MachineBasicBlock *Successor = nullptr; in reorganizeBlockLayout() local
355 Successor = Succ; in reorganizeBlockLayout()
360 Successor = NewSuccessor; in reorganizeBlockLayout()
390 MBB->removeSuccessor(Successor); in reorganizeBlockLayout()
396 MBB->addSuccessor(IsTrueBlockRequired ? TrueBlock : Successor); in reorganizeBlockLayout()
397 MBB->addSuccessor(IsFalseBlockRequired ? FalseBlock : Successor); in reorganizeBlockLayout()
401 TrueBlock->addSuccessor(Successor); in reorganizeBlockLayout()
406 FalseBlock->addSuccessor(Successor); in reorganizeBlockLayout()
412 .addMBB(IsTrueBlockRequired ? TrueBlock : Successor); in reorganizeBlockLayout()
418 .addMBB(Successor); in reorganizeBlockLayout()
|
| D | PPCReduceCRLogicals.cpp | 56 static void updatePHIs(MachineBasicBlock *Successor, MachineBasicBlock *OrigMBB, in updatePHIs() argument
58 for (auto &MI : Successor->instrs()) { in updatePHIs()
70 !OrigMBB->isSuccessor(Successor)) { in updatePHIs()
85 static void addIncomingValuesToPHIs(MachineBasicBlock *Successor, in addIncomingValuesToPHIs() argument
91 for (auto &MI : Successor->instrs()) { in addIncomingValuesToPHIs()
|
| /openbsd/src/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.robertl/ |
| D | eb109.C | 25 typedef std::map<int, EdgeType > Successor; typedef
26 typedef std::pair<VertexType, Successor> vertex;
49 typename Graph<VertexType, EdgeType>::Successor::iterator
|
| /openbsd/src/gnu/llvm/llvm/lib/Analysis/ |
| D | Interval.cpp | 37 for (const BasicBlock *Successor : Successors) in print() local
38 OS << *Successor << "\n"; in print()
|
| D | IntervalPartition.cpp | 69 for (BasicBlock *Successor : Int->Successors) in updatePredecessors()
70 getBlockInterval(Successor)->Predecessors.push_back(Header); in updatePredecessors()
|
| D | MemorySSAUpdater.cpp | 1418 for (const BasicBlock *Successor : successors(BB)) { in changeToUnreachable() local
1419 removeDuplicatePhiEdgesBetween(BB, Successor); in changeToUnreachable()
1420 if (MemoryPhi *MPhi = MSSA->getMemoryAccess(Successor)) { in changeToUnreachable()
|
| D | IRSimilarityIdentifier.cpp | 100 for (BasicBlock *Successor : BI->successors()) { in setBranchSuccessors()
101 BBNumIt = BasicBlockToInteger.find(Successor); in setBranchSuccessors()
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/Analysis/ |
| D | Interval.h | 77 for (BasicBlock *Successor : Successors) in isSuccessor()
78 if (Successor == BB) in isSuccessor()
|
| D | LoopInfoImpl.h | 135 for (BlockT *Successor : children<BlockT *>(BB)) in getUniqueExitBlocksHelper()
136 if (!L->contains(Successor)) in getUniqueExitBlocksHelper()
137 if (Visited.insert(Successor).second) in getUniqueExitBlocksHelper()
138 ExitBlocks.push_back(Successor); in getUniqueExitBlocksHelper()
|
| D | BlockFrequencyInfoImpl.h | 859 using Successor = GraphTraits<const BlockT *>;
1648 using Successor = GraphTraits<const BlockT *>;
|
| /openbsd/src/gnu/llvm/llvm/lib/Target/AMDGPU/ |
| D | AMDGPUUnifyDivergentExitNodes.cpp | 254 for (BasicBlock *Successor : Successors) { in runOnFunction()
255 Updates.push_back({DominatorTree::Insert, TransitionBB, Successor}); in runOnFunction()
256 Updates.push_back({DominatorTree::Delete, BB, Successor}); in runOnFunction()
|
| D | SIMachineScheduler.h | 35 Successor, enumerator
|
| D | SIMachineScheduler.cpp | 129 case Successor: return "SUCCESSOR"; in getReasonStr()
1546 TryCand, Cand, Successor)) in tryCandidateLatency()
1563 TryCand, Cand, Successor)) in tryCandidateRegUsage()
|
| /openbsd/src/gnu/llvm/llvm/lib/Transforms/Utils/ |
| D | BypassSlowDivision.cpp | 83 QuotRemWithBB createSlowBB(BasicBlock *Successor);
84 QuotRemWithBB createFastBB(BasicBlock *Successor);
|
| D | SimplifyCFG.cpp | 961 auto *Successor = i->getCaseSuccessor(); in SimplifyEqualityComparisonWithOnlyPredecessor() local
963 ++NumPerSuccessorCases[Successor]; in SimplifyEqualityComparisonWithOnlyPredecessor()
965 Successor->removePredecessor(PredDef); in SimplifyEqualityComparisonWithOnlyPredecessor()
968 --NumPerSuccessorCases[Successor]; in SimplifyEqualityComparisonWithOnlyPredecessor()
3483 for (auto *Successor : successors(DomBlock)) in FoldTwoEntryPHINode() local
3484 Updates.push_back({DominatorTree::Delete, DomBlock, Successor}); in FoldTwoEntryPHINode()
5148 [BB](auto *Successor) { return Successor == BB; })) { in simplifyUnreachable() argument
5452 auto *Successor = Case.getCaseSuccessor(); in eliminateDeadSwitchCases() local
5454 if (!NumPerSuccessorCases.count(Successor)) in eliminateDeadSwitchCases()
5455 UniqueSuccessors.push_back(Successor); in eliminateDeadSwitchCases()
[all …]
|
| D | Local.cpp | 2241 for (BasicBlock *Successor : successors(BB)) { in changeToUnreachable()
2242 Successor->removePredecessor(BB, PreserveLCSSA); in changeToUnreachable()
2244 UniqueSuccessors.insert(Successor); in changeToUnreachable()
2548 for (BasicBlock *Successor : successors(BB)) in markAliveBlocks()
2549 if (Reachable.insert(Successor).second) in markAliveBlocks()
2550 Worklist.push_back(Successor); in markAliveBlocks()
|
| /openbsd/src/gnu/llvm/llvm/lib/Transforms/Vectorize/ |
| D | VPlan.h | 413 void appendSuccessor(VPBlockBase *Successor) { in appendSuccessor() argument
414 assert(Successor && "Cannot add nullptr successor!"); in appendSuccessor()
415 Successors.push_back(Successor); in appendSuccessor()
432 void removeSuccessor(VPBlockBase *Successor) { in removeSuccessor() argument
433 auto Pos = find(Successors, Successor); in removeSuccessor()
556 void setOneSuccessor(VPBlockBase *Successor) { in setOneSuccessor() argument
558 appendSuccessor(Successor); in setOneSuccessor()
|
| D | VPlan.cpp | 926 for (auto *Successor : Successors) in dumpEdges() local
927 drawEdge(Block, Successor, false, Twine(SuccessorNumber++)); in dumpEdges()
|
| /openbsd/src/gnu/llvm/llvm/lib/Transforms/Scalar/ |
| D | ConstraintElimination.cpp | 708 BasicBlock *Successor = Br->getSuccessor(IsOr ? 1 : 0); in addInfoFor() local
709 if (canAddSuccessor(BB, Successor)) { in addInfoFor()
722 FactOrCheck::getFact(DT.getNode(Successor), Cmp, IsOr)); in addInfoFor()
|
| D | GVN.cpp | 1923 for (BasicBlock *Successor : successors(IntrinsicI->getParent())) { in processAssumeIntrinsic()
1924 BasicBlockEdge Edge(IntrinsicI->getParent(), Successor); in processAssumeIntrinsic()
|
| /openbsd/src/gnu/llvm/llvm/lib/CodeGen/ |
| D | Analysis.cpp | 792 const MachineBasicBlock *Successor = MBBI->getOperand(0).getMBB(); in getEHScopeMembership() local
795 {Successor, IsSEH ? EntryBBNumber : SuccessorColor->getNumber()}); in getEHScopeMembership()
|
| D | MachinePipeliner.cpp | 1751 SUnit *Successor = SI.getSUnit(); in addConnectedNodes() local
1752 if (!SI.isArtificial() && !Successor->isBoundaryNode() && in addConnectedNodes()
1753 NodesAdded.count(Successor) == 0) in addConnectedNodes()
1754 addConnectedNodes(Successor, NewSet, NodesAdded); in addConnectedNodes()
|
| /openbsd/src/gnu/llvm/llvm/tools/bugpoint/ |
| D | CrashDebugger.cpp | 417 for (BasicBlock *Successor : successors(&*BB)) in simpleSimplifyCfg()
418 if (Visited.count(Successor)) in simpleSimplifyCfg()
419 Successor->removePredecessor(&*BB); in simpleSimplifyCfg()
|
| /openbsd/src/gnu/llvm/llvm/lib/Transforms/Instrumentation/ |
| D | GCOVProfiling.cpp | 277 void addEdge(GCOVBlock &Successor, uint32_t Flags) { in addEdge() argument
278 OutEdges.emplace_back(&Successor, Flags); in addEdge()
|
| /openbsd/src/gnu/llvm/clang/lib/Analysis/ |
| D | CFG.cpp | 1635 CFGBlock *Successor = (I+1)->block; in buildCFG() local
1644 if (JT.block == Successor) in buildCFG()
|