HomeSort by relevance Sort by last modified time
    Searched defs:NumPreds (Results 1 - 6 of 6) sorted by null

  /external/llvm/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 52 unsigned NumPreds; // Number of predecessor blocks.
53 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
58 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
118 Info->NumPreds = Preds.size();
119 if (Info->NumPreds == 0)
123 (Allocator.Allocate(Info->NumPreds * sizeof(BBInfo*),
126 for (unsigned p = 0; p != Info->NumPreds; ++p) {
239 for (unsigned p = 0; p != Info->NumPreds; ++p) {
297 for (unsigned p = 0; p != Info->NumPreds; ++p) {
335 ValT PHI = Traits::CreateEmptyPHI(Info->BB, Info->NumPreds, Updater)
    [all...]
  /external/llvm/lib/Transforms/Utils/
CloneFunction.cpp 480 unsigned NumPreds = OPN->getNumIncomingValues();
490 for (unsigned pred = 0, e = NumPreds; pred != e; ++pred) {
512 NumPreds = std::distance(pred_begin(NewBB), pred_end(NewBB));
513 if (NumPreds != PN->getNumIncomingValues()) {
514 assert(NumPreds < PN->getNumIncomingValues());
  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 279 unsigned NumPreds; // # of SDep::Data preds.
321 NodeNum(nodenum), NodeQueueId(0), NumPreds(0), NumSuccs(0),
337 NodeNum(nodenum), NodeQueueId(0), NumPreds(0), NumSuccs(0),
352 NodeNum(BoundaryID), NodeQueueId(0), NumPreds(0), NumSuccs(0),
  /external/llvm/lib/Transforms/Scalar/
JumpThreading.cpp 632 unsigned NumPreds = std::distance(pred_begin(TestBB), pred_end(TestBB));
633 if (NumPreds < MinNumPreds) {
635 MinNumPreds = NumPreds;
    [all...]
IndVarSimplify.cpp 499 unsigned NumPreds = PN->getNumIncomingValues();
513 NumPreds == 1 &&
534 for (unsigned i = 0; i != NumPreds; ++i) {
    [all...]
  /external/llvm/lib/CodeGen/
IfConversion.cpp     [all...]

Completed in 777 milliseconds