HomeSort by: relevance | last modified time | path
    Searched refs:Successor (Results 1 - 23 of 23) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
Interval.cpp 38 for (const BasicBlock *Successor : Successors)
39 OS << *Successor << "\n";
IntervalPartition.cpp 63 // updatePredecessors - Interval generation only sets the successor fields of
65 // run through all of the intervals and propagate successor info as
69 for (BasicBlock *Successor : Int->Successors)
70 getBlockInterval(Successor)->Predecessors.push_back(Header);
88 // Now that we know all of the successor information, propagate this to the
114 // Now that we know all of the successor information, propagate this to the
MemorySSAUpdater.cpp 357 // single successor, and only used a straight line of single pred blocks
1418 for (const BasicBlock *Successor : successors(BB)) {
1419 removeDuplicatePhiEdgesBetween(BB, Successor);
1420 if (MemoryPhi *MPhi = MSSA->getMemoryAccess(Successor)) {
  /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/
PPCExpandISEL.cpp 335 MachineBasicBlock *Successor = nullptr;
347 ++It; // Point to the successor block of MBB.
350 // non-debug instruction in this block. Find the fall-through successor
355 Successor = Succ;
360 Successor = NewSuccessor;
363 // its successor.
364 // Note this need to be done *after* the above setting the Successor code.
378 // Transfer the rest of this block into the new successor block.
389 // Remove successor from MBB.
390 MBB->removeSuccessor(Successor);
    [all...]
PPCReduceCRLogicals.cpp 52 /// Given a basic block \p Successor that potentially contains PHIs, this
56 static void updatePHIs(MachineBasicBlock *Successor, MachineBasicBlock *OrigMBB,
58 for (auto &MI : Successor->instrs()) {
70 !OrigMBB->isSuccessor(Successor)) {
80 /// Given a basic block \p Successor that potentially contains PHIs, this
85 static void addIncomingValuesToPHIs(MachineBasicBlock *Successor,
90 "NewMBB must be a successor of OrigMBB");
91 for (auto &MI : Successor->instrs()) {
133 /// as the target of the original branch or the fallthrough successor of the
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
Interval.h 75 /// isSuccessor - find out if a basic block is a successor of this Interval
77 for (BasicBlock *Successor : Successors)
78 if (Successor == BB)
LoopInfoImpl.h 58 /// getExitBlocks - Return all of the successor blocks of this loop. These
115 for (BlockT *Successor : children<BlockT *>(BB))
116 if (!L->contains(Successor))
117 if (Visited.insert(Successor).second)
118 ExitBlocks.push_back(Successor);
185 // The predecessor has exactly one successor, so it is a preheader.
192 /// the predecessor to have exactly one successor.
BlockFrequencyInfoImpl.h 225 ExitMap Exits; ///< Successor edges (and weights).
349 /// successor/target node).
374 /// This class collates the successor edge weights for later processing.
381 WeightList Weights; ///< Individual successor weights.
436 /// successor edge.
596 /// latter only has successor information.
764 /// - Each successor is categorized as \a Weight::Local, a local edge
766 /// loop header, or \a Weight::Exit, any successor outside the loop.
767 /// The weight, the successor, and its category are stored in \a
768 /// Distribution. There can be multiple edges to each successor
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
AMDGPUUnifyDivergentExitNodes.cpp 313 // and TransitionBB becomes a single successor of BB.
315 for (BasicBlock *Successor : Successors) {
316 Updates.push_back({DominatorTree::Insert, TransitionBB, Successor});
317 Updates.push_back({DominatorTree::Delete, BB, Successor});
SIMachineScheduler.h 33 Successor,
SIMachineScheduler.cpp 129 case Successor: return "SUCCESSOR";
1562 TryCand, Cand, Successor))
1579 TryCand, Cand, Successor))
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
BypassSlowDivision.cpp 85 QuotRemWithBB createSlowBB(BasicBlock *Successor);
86 QuotRemWithBB createFastBB(BasicBlock *Successor);
SimplifyCFG.cpp 302 // successor, and if that successor has a PHI node, and if *that* PHI node has
894 << "Through successor TI: " << *TI << "Leaving: " << *NI
913 << "Through successor TI: " << *TI);
918 auto *Successor = i->getCaseSuccessor();
920 ++NumPerSuccessorCases[Successor];
922 Successor->removePredecessor(PredDef);
925 --NumPerSuccessorCases[Successor];
954 // BB. Find out which successor will unconditionally be branched to.
983 << "Through successor TI: " << *TI << "Leaving: " << *N
    [all...]
Local.cpp 259 // successor.
369 // If we didn't find our destination in the IBI successor list, then we
752 // This predecessor of PredBB may already have DestBB as a successor.
787 "The successor list of PredBB isn't empty before "
815 /// Assumption: Succ is the single successor for BB.
817 assert(*succ_begin(BB) == Succ && "Succ is not successor of BB!");
985 // predecessor and successor blocks both share some predecessors,
1069 // successor because that creates duplicate successors.
1089 // This predecessor of BB may already have Succ as a successor.
1099 // the successor, then we need to add incoming edges for the PHI node
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
VPlan.h 396 /// List of successor blocks.
399 /// Successor selector managed by a VPUser. For blocks with zero or one
413 /// Add \p Successor as the last successor to this block.
414 void appendSuccessor(VPBlockBase *Successor) {
415 assert(Successor && "Cannot add nullptr successor!");
416 Successors.push_back(Successor);
432 /// Remove \p Successor from the successors of this block.
433 void removeSuccessor(VPBlockBase *Successor) {
    [all...]
VPlan.cpp 277 assert(PredBB && "Predecessor basic-block not found building successor.");
282 "Predecessor ending w/o branch must have single successor.");
290 "Trying to reset an existing successor block.");
307 // is PrevVPBB and the latter has a single (hierarchical) successor; and
345 // successors. The successors are fixed later when the successor blocks are
420 O << Indent << "Successor(s): ";
696 assert(VectorHeaderBB && "Loop preheader does not have a single successor.");
788 assert(LoopHeaderBB && "Loop preheader does not have a single successor.");
801 "PostDom successor has more than one predecessor.");
811 "One successor of a basic block does not lead to the other.")
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
Analysis.cpp 772 const MachineBasicBlock *Successor = MBBI->getOperand(0).getMBB();
775 {Successor, IsSEH ? EntryBBNumber : SuccessorColor->getNumber()});
MachinePipeliner.cpp 1226 // Add any successor to the adjacency matrix and exclude duplicates.
1768 // Create a new node set with the connected nodes of any successor of a node
1805 SUnit *Successor = SI.getSUnit();
1806 if (!SI.isArtificial() && NodesAdded.count(Successor) == 0)
1807 addConnectedNodes(Successor, NewSet, NodesAdded);
2475 /// depends on any predecessor or successor nodes scheduled already.
2481 // is a predecessor or successor of the specified instruction.
2737 /// none of them is scheduled after both a successor and a
2764 // it appears after both a successor and a predecessor
2809 // after both a successor and predecessor
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/bugpoint/
CrashDebugger.cpp 418 for (BasicBlock *Successor : successors(&*BB))
419 if (Visited.count(Successor))
420 Successor->removePredecessor(&*BB);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/
GCOVProfiling.cpp 330 void addEdge(GCOVBlock &Successor, uint32_t Flags) {
331 OutEdges.emplace_back(&Successor, Flags);
777 // Instrument the SrcBB if it has a single successor,
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
GVN.cpp 798 "Found a speculatively available successor leftover?");
1304 // If any of these blocks has more than one successor (i.e. if the edge we
1428 // If all preds have a single successor, then we know it is safe to insert
1569 // TODO: Support critical edge splitting if blocker has more than 1 successor.
1799 for (BasicBlock *Successor : successors(IntrinsicI->getParent())) {
1800 BasicBlockEdge Edge(IntrinsicI->getParent(), Successor);
2374 // Remember how many outgoing edges there are to every successor.
2653 // a value is computed in the successor and one predecessor,
2655 // where the successor is its own predecessor, because they're
  /src/external/apache2/llvm/dist/clang/lib/Analysis/
CFG.cpp 463 /// the AST in reverse order so that the successor of a basic block is
634 /// successor block when inserting the decision point).
652 /// branches to the stored successor.
668 /// Remember the successor S of a temporary destructor decision branch for
890 /// Add a reachable successor to a block, with the alternate variant that is
1552 // incomplete AST. Handle this by not registering a successor.
1566 CFGBlock *Successor = (I+1)->block;
1570 // incomplete AST. Handle this by not registering a successor.
1574 // Successor has been added, so skip it.
1575 if (JT.block == Successor)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
X86InstrInfo.cpp 2972 // Return a nullptr if we found more than one fallthrough successor.
4379 for (MachineBasicBlock *Successor : MBB->successors())
4380 if (Successor->isLiveIn(X86::EFLAGS))

Completed in 94 milliseconds