Searched refs:successors (Results 26 - 50 of 55) sorted by relevance

123

/freebsd-11.0-release/contrib/llvm/include/llvm/IR/
H A DInstrTypes.h59 /// Return the number of successors that this terminator has.
152 // successors.
266 inline succ_range successors() { function in class:llvm::TerminatorInst
269 inline succ_const_range successors() const { function in class:llvm::TerminatorInst
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/
H A DMachineTraceMetrics.cpp345 for (const MachineBasicBlock *Succ : MBB->successors()) {
349 // Don't consider successors exiting CurLoop.
483 // All the successors have been visited, pick the preferred one.
535 // Find any MBB successors that have MBB as their preferred predecessor.
537 for (const MachineBasicBlock *Succ : MBB->successors()) {
H A DBranchFolding.cpp128 // drop all successors.
439 // Move all the successors of this block to the specified block.
922 // First find blocks with no successors.
1073 // successors.
1328 // If this block has no successors (e.g. it is a return block or ends with
1342 // blocks. If neither have successors and if PredBB is the second from
1531 // Check all successors to see if we can move this block before it.
1532 for (MachineBasicBlock *SuccBB : MBB->successors()) {
1595 for (MachineBasicBlock *SuccBB : BB->successors())
1613 /// in successors t
[all...]
H A DLiveVariables.cpp746 // Loop over all of the successors of the basic block, checking to see if
748 for (const MachineBasicBlock *SuccMBB : MBB.successors()) {
H A DPrologEpilogInserter.cpp407 // Enqueue all the successors not already visited.
409 for (MachineBasicBlock *SuccBB : CurBB->successors())
H A DWinEHPrepare.cpp856 for (BasicBlock *SuccBB : successors(NewBlock)) {
1191 // successors.
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Instrumentation/
H A DGCOVProfiling.cpp528 if (int successors = TI->getNumSuccessors()) {
529 for (int i = 0; i != successors; ++i) {
713 // All edges with successors that aren't branches are "complex", because it
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DJumpThreading.cpp81 /// multiple predecessors and multiple successors. If one or more of the
83 /// successors, we forward the edge from the predecessor to the successor by
751 // Can't thread indirect branch with no successors.
772 // successors to branch to. Let GetBestDestForJumpOnUndef decide.
1263 for (BasicBlock *Succ : successors(Pred))
1638 for (BasicBlock *Succ : successors(BB)) {
H A DLoopUnrollPass.cpp546 // Add in the live successors by first checking whether we have terminator
580 // Add BB's successors to the worklist.
581 for (BasicBlock *Succ : successors(BB))
H A DStructurizeCFG.cpp361 for (BasicBlock *Succ : Term->successors())
632 /// \brief Remove phi values from all successors and then remove the terminator.
H A DGVN.cpp617 // propagate to any successors. Entries added mid-block are applied
828 // incorrect. Walk the (transitive) successors of this block and mark them as
1812 for (BasicBlock *Successor : successors(IntrinsicI->getParent())) {
1815 // This property is only true in dominated successors, propagateEquality
2812 /// live successors, update their phi nodes by replacing the operands
2831 for (BasicBlock *S : successors(B)) {
2856 // For the dead blocks' live successors, update their phi nodes by replacing
2900 // If a branch has two identical successors, we cannot declare either dead.
H A DRewriteStatepointsForGC.cpp1988 // Insert insert element sequences in both successors
2723 for (BasicBlock *Succ : successors(BB)) {
2816 for (BasicBlock *Succ : successors(BB)) {
2823 // when unioning our successors LiveIn Thus, the LiveIn of this block
H A DSCCP.cpp261 /// that branches on undef values cannot reach any of their successors.
443 // successors are reachable from a given terminator instruction.
524 // successors are reachable from a given terminator instruction.
550 // Unwinding instructions successors are always executable.
616 // Unwinding instructions successors are always executable.
660 // successors executable.
750 // Mark all feasible successors executable.
1260 /// that branches on undef values cannot reach any of their successors.
1830 for (BasicBlock *Succ : TI->successors()) {
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp42 // Loop through all of our successors and make sure they know that one
44 for (BasicBlock *Succ : BBTerm->successors())
128 OnlySucc = nullptr; // There are multiple distinct successors!
132 // Can't merge if there are multiple successors.
874 assert(BI->isConditional() && "Two successors but not conditional?");
H A DCloneFunction.cpp417 for (const BasicBlock *Succ : TI->successors())
H A DLocal.cpp61 /// destination. This is a nontrivial operation because the successors of this
193 for (BasicBlock *Succ : SI->successors()) {
1224 // Loop over all of the successors, removing BB's entry from any PHI
/freebsd-11.0-release/contrib/llvm/lib/Target/Hexagon/
H A DRDFLiveness.cpp594 for (auto SI : B->successors())
H A DRDFGraph.cpp257 for (auto I : BB->successors())
1579 for (auto SB : MBB->successors()) {
/freebsd-11.0-release/contrib/llvm/lib/Target/WebAssembly/
H A DRelooper.cpp127 for (const BasicBlock *Successor : successors(BB))
H A DWebAssemblyPEI.cpp423 // Enqueue all the successors not already visited.
425 for (MachineBasicBlock *SuccBB : CurBB->successors())
/freebsd-11.0-release/contrib/llvm/lib/Target/PowerPC/
H A DPPCFastISel.cpp1758 for (const BasicBlock *SuccBB : IB->successors())
/freebsd-11.0-release/contrib/llvm/lib/Target/X86/
H A DX86FrameLowering.cpp239 for (const MachineBasicBlock *Succ : MBB.successors())
H A DX86InstrInfo.cpp2427 for (MachineBasicBlock *S : MBB.successors())
4094 for (auto *Succ : MBB.successors())
4156 assert(!FBB && "Unconditional branch with multiple successors!");
5163 for (MachineBasicBlock *Successor : MBB->successors())
/freebsd-11.0-release/contrib/llvm/lib/Target/AArch64/
H A DAArch64InstrInfo.cpp970 for (auto *MBB : ParentBlock->successors())
/freebsd-11.0-release/contrib/llvm/lib/Target/ARM/
H A DARMFastISel.cpp1352 for (const BasicBlock *SuccBB : IB->successors())

Completed in 576 milliseconds

123