Searched refs:predecessors (Results 1 - 25 of 30) sorted by relevance

12

/freebsd-11.0-release/contrib/gcc/
H A Dddg.h44 predecessors bitmaps held in each ddg_node. Do not make changes to
47 #define NODE_PREDECESSORS(x) ((x)->predecessors)
73 sbitmap predecessors; member in struct:ddg_node
H A Dddg.c503 g->nodes[i].predecessors = sbitmap_alloc (num_nodes);
504 sbitmap_zero (g->nodes[i].predecessors);
541 sbitmap_free (g->nodes[i].predecessors);
652 gcc_assert (src->successors && dest->predecessors);
655 SET_BIT (dest->predecessors, src->cuid);
804 /* Given a set OPS of nodes in the DDG, find the set of their predecessors
H A Dmodulo-sched.c68 predecessors _or_ after all its successors.
1284 'PSP' previously scheduled predecessors.
1357 such cases we want to unschedule some of the predecessors/successors
1912 sbitmap predecessors = sbitmap_alloc (num_nodes);
1915 sbitmap_zero (predecessors);
1916 find_predecessors (predecessors, g, nodes_ordered);
1922 if (sbitmap_a_and_b_cg (tmp, predecessors, scc))
1967 sbitmap_zero (predecessors);
1968 find_predecessors (predecessors, g, nodes_ordered);
1969 sbitmap_a_and_b (workset, predecessors, sc
1908 sbitmap predecessors = sbitmap_alloc (num_nodes); local
[all...]
H A Dreg-stack.c218 int predecessors; /* Number of predecessors that need
2858 /* No predecessors. Create an arbitrary input stack. */
2978 is only processed after all its predecessors. The number of predecessors
2995 insn inside the block. Since the number of predecessors of
3009 BLOCK_INFO (e->dest)->predecessors--;
3010 if (!BLOCK_INFO (e->dest)->predecessors)
3123 bi->predecessors++;
217 int predecessors; /* Number of predecessors that need member in struct:block_info_def
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/
H A DMachineDominators.cpp83 for (MachineBasicBlock *PredBB : Succ->predecessors()) {
118 // If all the other predecessors of "Succ" are dominated by "Succ" itself
H A DMachineBlockPlacement.cpp204 /// \brief Count of predecessors within the loop currently being processed.
207 /// in-loop predecessors of this chain.
445 for (MachineBasicBlock *Pred : Succ->predecessors()) {
479 for (MachineBasicBlock *Pred : Succ->predecessors()) {
657 for (MachineBasicBlock *Pred : L.getHeader()->predecessors()) {
679 // Walk backwards through any straight line of predecessors.
700 // header has be pre-merged into a chain due to predecessors not having
816 for (MachineBasicBlock *Pred : Top->predecessors()) {
882 for (auto *Pred : HeaderBB->predecessors()) {
1011 for (auto LoopPred : L.getHeader()->predecessors())
[all...]
H A DShrinkWrap.cpp358 Save = FindIDom<>(*Save, Save->predecessors(), *MDT);
501 Save = FindIDom<>(*Save, Save->predecessors(), *MDT);
H A DWinEHPrepare.cpp244 for (const BasicBlock *PredBlock : predecessors(BB))
288 for (const BasicBlock *PredBlock : predecessors(BB)) {
354 for (const BasicBlock *PredBlock : predecessors(BB))
388 for (const BasicBlock *PredBlock : predecessors(BB))
796 for (BasicBlock *Pred : predecessors(OldBlock))
1128 for (BasicBlock *PredBlock : predecessors(EHBlock)) {
H A DLiveInterval.cpp834 // Continue at predecessors (we could even go to idom with domtree available).
835 for (const MachineBasicBlock *Pred : MBB->predecessors()) {
864 for (const MachineBasicBlock *Pred : MBB->predecessors()) {
1002 for (const MachineBasicBlock *Pred : MBB->predecessors()) {
1385 // Connect to values live out of predecessors.
H A DLiveDebugValues.cpp266 /// source variable in all the predecessors of @MBB reside in the same location.
274 // For all predecessors of this MBB, find the set of VarLocs that can be
276 for (auto p : MBB.predecessors()) {
H A DMachineTraceMetrics.cpp323 for (const MachineBasicBlock *Pred : MBB->predecessors()) {
465 // All the predecessors have been visited, pick the preferred one.
510 // Find any MBB predecessors that have MBB as their preferred successor.
512 for (const MachineBasicBlock *Pred : MBB->predecessors()) {
H A DBranchFolding.cpp55 // Throttle for huge numbers of predecessors (compile speed problems)
58 cl::desc("Max number of predecessors to consider tail merging"),
941 // Look at blocks (IBB) with multiple predecessors (PBB).
953 // With those changes, we see whether the predecessors' tails match,
967 for (MachineBasicBlock *PBB : I->predecessors()) {
1212 // TODO: Is it ever worth rewriting predecessors which don't already
1215 // Rewrite all predecessors of the old block to go to the fallthrough
1258 // this block has no other predecessors, move the contents of this block
1440 // Iterate through all the predecessors, revectoring each in-turn.
1498 // Check all the predecessors o
[all...]
H A DLiveIntervalAnalysis.cpp388 // The PHI is live, make sure the predecessors are live-out.
389 for (auto &Pred : MBB->predecessors()) {
404 // Make sure VNI is live-out from the predecessors.
405 for (auto &Pred : MBB->predecessors()) {
H A DTailDuplication.cpp1 //===-- TailDuplication.cpp - Duplicate blocks into predecessors' tails ---===//
11 // the tails of their predecessors.
229 // TailBB's immediate successors are now successors of those predecessors
230 // which duplicated TailBB. Add the predecessors as sources to the PHI
314 /// through. Tail-duplicate their instructions into their predecessors to
461 /// have gained new predecessors. Update the PHI instructions in them
526 // Live in tail block, must also be live in predecessors.
574 // that rearrange the predecessors of the indirect branch.
668 for (MachineBasicBlock *PredBB : BB.predecessors()) {
761 /// of its predecessors
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Target/WebAssembly/
H A DWebAssemblyCFGStackify.cpp87 for (MachineBasicBlock *Pred : MBB->predecessors()) {
231 // predecessors should be backedges below.
232 for (auto Pred : MBB.predecessors())
235 "Loop header predecessors must be loop predecessors or backedges");
238 // Not a loop header. All predecessors should be sorted above.
239 for (auto Pred : MBB.predecessors())
241 "Non-loop-header predecessors should be topologically sorted");
276 // predecessors so that we minimize the time that the BLOCK is on the stack,
281 for (MachineBasicBlock *Pred : MBB.predecessors())
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/IR/
H A DCFG.h102 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm
105 inline pred_const_range predecessors(const BasicBlock *BB) { function in namespace:llvm
/freebsd-11.0-release/contrib/llvm/lib/Target/AArch64/
H A DAArch64A53Fix835769.cpp135 for (MachineBasicBlock *S : MBB->predecessors())
H A DAArch64CollectLOH.cpp274 /// - its reachable uses (uses that are exposed to BB's predecessors).
388 /// In[bb][color] = U Out[bb.predecessors][color]
411 // In[bb][color] = U Out[bb.predecessors][color]
412 for (const MachineBasicBlock *PredMBB : MBB.predecessors()) {
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DJumpThreading.cpp64 cl::desc("The number of predecessors to search for a stronger "
81 /// multiple predecessors and multiple successors. If one or more of the
82 /// predecessors of the block can be proven to always jump to one of the
393 /// in any of our predecessors. If so, return the known list of value and pred
413 // If V is a constant, then it is known in all predecessors.
415 for (BasicBlock *Pred : predecessors(BB))
427 // of any of our predecessors.
439 for (BasicBlock *P : predecessors(BB)) {
584 // live-in value on any predecessors.
590 for (BasicBlock *P : predecessors(B
[all...]
H A DGVN.cpp799 // Otherwise, see if it is fully available in all predecessors.
802 // If this block has no predecessors, it isn't live-in here.
807 // If the value isn't fully available in one of our predecessors, then it
1509 // is available in some of our (transitive) predecessors. Lets think about
1520 // backwards through predecessors if needed.
1543 // Check to see how many predecessors have the loaded value fully
1553 for (BasicBlock *Pred : predecessors(LoadBB)) {
1583 // Only add the predecessors that will not be split for now.
1593 // If this load is unavailable in multiple predecessors, reject it.
1600 // Split critical edges, and update the unavailable predecessors accordingl
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h327 inline iterator_range<pred_iterator> predecessors() { function in class:llvm::MachineBasicBlock
330 inline iterator_range<const_pred_iterator> predecessors() const { function in class:llvm::MachineBasicBlock
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/
H A DSimplifyCFG.cpp568 // predecessors unless there is only one predecessor.
860 /// See if any of the predecessors of the terminator block are value comparisons
1237 /// check whether BBEnd has only two predecessors and the other predecessor
1239 /// in the two predecessors to BBEnd.
1245 // Check that BBEnd has two predecessors and the other predecessor ends with
1252 if (PI != PE) // More than two predecessors.
1762 // The dest block might have PHI nodes, other predecessors and other
2444 for (BasicBlock *PredBB : predecessors(Succ))
2692 // Otherwise, if there are multiple predecessors, insert a PHI that merges
2746 // predecessors ar
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Transforms/IPO/
H A DArgumentPromotion.cpp591 for (BasicBlock *P : predecessors(BB)) {
/freebsd-11.0-release/contrib/llvm/lib/Target/ARM/
H A DThumb2SizeReduction.cpp191 // When CPSRDef is null, this refers to CPSR defs in predecessors.
942 // Check predecessors for the latest CPSRDef.
943 for (auto *Pred : MBB.predecessors()) {
1040 // predecessors.
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyTIL.h1560 /// Returns the number of predecessors.
1576 /// Returns a list of predecessors.
1577 /// The order of predecessors in the list is important; each phi node has
1579 BlockArray &predecessors() { return Predecessors; } function in class:clang::threadSafety::BasicBlock
1580 const BlockArray &predecessors() const { return Predecessors; } function in class:clang::threadSafety::BasicBlock
1618 // Reserve space for NumPreds predecessors, including space in phi nodes.

Completed in 435 milliseconds

12