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

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
Interval.cpp 38 for (const BasicBlock *Successor : Successors)
39 OS << *Successor << "\n";
  /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...]
  /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/lib/Target/AMDGPU/
SIMachineScheduler.h 33 Successor,
  /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/Transforms/Utils/
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...]

Completed in 27 milliseconds