Home
last modified time | relevance | path

Searched refs:NumPreds (Results 1 – 14 of 14) sorted by relevance

/external/llvm/include/llvm/Transforms/Utils/
DSSAUpdaterImpl.h52 unsigned NumPreds; // Number of predecessor blocks. variable
58 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {} in BBInfo()
118 Info->NumPreds = Preds.size(); in BuildBlockList()
119 if (Info->NumPreds == 0) in BuildBlockList()
123 (Allocator.Allocate(Info->NumPreds * sizeof(BBInfo*), in BuildBlockList()
126 for (unsigned p = 0; p != Info->NumPreds; ++p) { in BuildBlockList()
239 for (unsigned p = 0; p != Info->NumPreds; ++p) { in FindDominators()
297 for (unsigned p = 0; p != Info->NumPreds; ++p) { in FindPHIPlacement()
335 ValT PHI = Traits::CreateEmptyPHI(Info->BB, Info->NumPreds, Updater); in FindAvailableVals()
349 if (Info->NumPreds > 1) in FindAvailableVals()
[all …]
/external/llvm/lib/CodeGen/
DScheduleDAG.cpp98 assert(NumPreds < UINT_MAX && "NumPreds will overflow!"); in addPred()
100 ++NumPreds; in addPred()
149 assert(NumPreds > 0 && "NumPreds will underflow!"); in removePred()
151 --NumPreds; in removePred()
299 if (NumPreds < 2) in biasCriticalPath()
388 if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) { in VerifyScheduledDAG()
DScheduleDAGPrinter.cpp43 return (Node->NumPreds > 10 || Node->NumSuccs > 10); in isNodeHidden()
DMachineSSAUpdater.cpp297 static unsigned CreateEmptyPHI(MachineBasicBlock *BB, unsigned NumPreds, in CreateEmptyPHI() argument
DIfConversion.cpp1477 unsigned NumPreds = TailBB->pred_size(); in IfConvertDiamond() local
1478 if (NumPreds > 1) in IfConvertDiamond()
1480 else if (NumPreds == 1 && CanMergeTail) { in IfConvertDiamond()
/external/clang/lib/Analysis/
DThreadSafetyTIL.cpp70 void BasicBlock::reservePredecessors(unsigned NumPreds) { in reservePredecessors() argument
71 Predecessors.reserve(NumPreds, Arena); in reservePredecessors()
74 Ph->values().reserve(NumPreds, Arena); in reservePredecessors()
/external/llvm/include/llvm/CodeGen/
DScheduleDAG.h285 unsigned NumPreds; // # of SDep::Data preds.
327 NodeNum(nodenum), NodeQueueId(0), NumPreds(0), NumSuccs(0),
343 NodeNum(nodenum), NodeQueueId(0), NumPreds(0), NumSuccs(0),
358 NodeNum(BoundaryID), NodeQueueId(0), NumPreds(0), NumSuccs(0),
/external/llvm/lib/Transforms/Utils/
DCloneFunction.cpp552 unsigned NumPreds = OPN->getNumIncomingValues(); in CloneAndPruneIntoFromInst() local
562 for (unsigned pred = 0, e = NumPreds; pred != e; ++pred) { in CloneAndPruneIntoFromInst()
584 NumPreds = std::distance(pred_begin(NewBB), pred_end(NewBB)); in CloneAndPruneIntoFromInst()
585 if (NumPreds != PN->getNumIncomingValues()) { in CloneAndPruneIntoFromInst()
586 assert(NumPreds < PN->getNumIncomingValues()); in CloneAndPruneIntoFromInst()
DSSAUpdater.cpp265 static Value *CreateEmptyPHI(BasicBlock *BB, unsigned NumPreds, in CreateEmptyPHI() argument
267 PHINode *PHI = PHINode::Create(Updater->ProtoType, NumPreds, in CreateEmptyPHI()
/external/llvm/lib/CodeGen/SelectionDAG/
DResourcePriorityQueue.cpp533 if (ParallelLiveRanges >= SU->NumPreds) in scheduledNode()
534 ParallelLiveRanges -= SU->NumPreds; in scheduledNode()
DScheduleDAGRRList.cpp1904 if (SU->NumSuccs == 0 && SU->NumPreds != 0) in getNodePriority()
1911 if (SU->NumPreds == 0 && SU->NumSuccs != 0) in getNodePriority()
2597 if (SU->NumPreds == 0 && SU->NumSuccs != 0) in canEnableCoalescing()
2825 if (SU->NumPreds != 1) in PrescheduleNodesWithMultipleUses()
/external/llvm/lib/Transforms/Scalar/
DJumpThreading.cpp638 unsigned NumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB)); in GetBestDestForJumpOnUndef() local
639 if (NumPreds < MinNumPreds) { in GetBestDestForJumpOnUndef()
641 MinNumPreds = NumPreds; in GetBestDestForJumpOnUndef()
DIndVarSimplify.cpp500 unsigned NumPreds = PN->getNumIncomingValues(); in RewriteLoopExitValues() local
514 NumPreds == 1 && in RewriteLoopExitValues()
535 for (unsigned i = 0; i != NumPreds; ++i) { in RewriteLoopExitValues()
/external/clang/include/clang/Analysis/Analyses/
DThreadSafetyTIL.h1619 void reservePredecessors(unsigned NumPreds);