HomeSort by relevance Sort by last modified time
    Searched refs:NumPreds (Results 1 - 25 of 49) sorted by null

1 2

  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AMDGPU/
GCNMinRegStrategy.cpp 43 std::vector<unsigned> NumPreds;
47 return NumPreds[SU->NodeNum] == std::numeric_limits<unsigned>::max();
52 NumPreds[SU->NodeNum] = std::numeric_limits<unsigned>::max();
57 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max());
58 return NumPreds[SU->NodeNum];
63 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max());
64 return --NumPreds[SU->NodeNum];
88 NumPreds.resize(SUnits.size());
90 NumPreds[I] = SUnits[I].NumPredsLeft;
GCNILPSched.cpp 89 if (SU->NumSuccs == 0 && SU->NumPreds != 0)
97 if (SU->NumPreds == 0 && SU->NumSuccs != 0)
  /external/llvm/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 53 unsigned NumPreds; // Number of predecessor blocks.
54 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
119 Info->NumPreds = Preds.size();
120 if (Info->NumPreds == 0)
124 (Allocator.Allocate(Info->NumPreds * sizeof(BBInfo*),
127 for (unsigned p = 0; p != Info->NumPreds; ++p) {
240 for (unsigned p = 0; p != Info->NumPreds; ++p) {
298 for (unsigned p = 0; p != Info->NumPreds; ++p) {
336 ValT PHI = Traits::CreateEmptyPHI(Info->BB, Info->NumPreds, Updater)
    [all...]
MemorySSA.h 363 MemoryPhi(LLVMContext &C, BasicBlock *BB, unsigned Ver, unsigned NumPreds = 0)
364 : MemoryAccess(C, MemoryPhiVal, BB, 0), ID(Ver), ReservedSpace(NumPreds) {
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 42 unsigned NumPreds; // Number of predecessor blocks.
43 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
48 NumPreds(0), Preds(0), PHITag(0) { }
108 Info->NumPreds = Preds.size();
109 if (Info->NumPreds == 0)
113 (Allocator.Allocate(Info->NumPreds * sizeof(BBInfo*),
116 for (unsigned p = 0; p != Info->NumPreds; ++p) {
229 for (unsigned p = 0; p != Info->NumPreds; ++p) {
287 for (unsigned p = 0; p != Info->NumPreds; ++p) {
325 ValT PHI = Traits::CreateEmptyPHI(Info->BB, Info->NumPreds, Updater)
    [all...]
BasicBlockUtils.h 167 /// Preds array, which has NumPreds elements in it. The new block is given a
177 unsigned NumPreds, const char *Suffix,
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 61 unsigned NumPreds = 0;
63 // Array[NumPreds] of predecessor blocks.
132 Info->NumPreds = Preds.size();
133 if (Info->NumPreds == 0)
137 Info->NumPreds * sizeof(BBInfo *), alignof(BBInfo *)));
139 for (unsigned p = 0; p != Info->NumPreds; ++p) {
252 for (unsigned p = 0; p != Info->NumPreds; ++p) {
310 for (unsigned p = 0; p != Info->NumPreds; ++p) {
348 ValT PHI = Traits::CreateEmptyPHI(Info->BB, Info->NumPreds, Updater);
372 for (unsigned p = 0; p != Info->NumPreds; ++p)
    [all...]
  /external/llvm/lib/CodeGen/
ScheduleDAGPrinter.cpp 42 return (Node->NumPreds > 10 || Node->NumSuccs > 10);
ScheduleDAG.cpp 98 assert(NumPreds < UINT_MAX && "NumPreds will overflow!");
100 ++NumPreds;
149 assert(NumPreds > 0 && "NumPreds will underflow!");
151 --NumPreds;
299 if (NumPreds < 2)
387 if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) {
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
ScheduleDAGPrinter.cpp 40 return (Node->NumPreds > 10 || Node->NumSuccs > 10);
ScheduleDAG.cpp 138 assert(NumPreds < std::numeric_limits<unsigned>::max() &&
139 "NumPreds will overflow!");
142 ++NumPreds;
189 assert(NumPreds > 0 && "NumPreds will underflow!");
191 --NumPreds;
325 if (NumPreds < 2)
403 if (SUnit.NumPreds == 0 && SUnit.NumSuccs == 0) {
  /external/clang/lib/Analysis/
ThreadSafetyTIL.cpp 70 void BasicBlock::reservePredecessors(unsigned NumPreds) {
71 Predecessors.reserve(NumPreds, Arena);
74 Ph->values().reserve(NumPreds, Arena);
  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/
ScheduleDAG.h 247 unsigned NumPreds; // # of SDep::Data preds.
281 NodeQueueId(0), NumPreds(0), NumSuccs(0), NumPredsLeft(0),
295 NodeQueueId(0), NumPreds(0), NumSuccs(0), NumPredsLeft(0),
308 NodeQueueId(0), NumPreds(0), NumSuccs(0), NumPredsLeft(0),
  /external/llvm/lib/Transforms/Utils/
CloneFunction.cpp 471 unsigned NumPreds = OPN->getNumIncomingValues();
481 for (unsigned pred = 0, e = NumPreds; pred != e; ++pred) {
504 NumPreds = std::distance(pred_begin(NewBB), pred_end(NewBB));
505 if (NumPreds != PN->getNumIncomingValues()) {
506 assert(NumPreds < PN->getNumIncomingValues());
SSAUpdater.cpp 243 /// vector, set Info->NumPreds, and allocate space in Info->Preds.
265 static Value *CreateEmptyPHI(BasicBlock *BB, unsigned NumPreds,
267 PHINode *PHI = PHINode::Create(Updater->ProtoType, NumPreds,
  /external/swiftshader/third_party/LLVM/lib/CodeGen/
ScheduleDAG.cpp 100 assert(NumPreds < UINT_MAX && "NumPreds will overflow!");
102 ++NumPreds;
147 assert(NumPreds > 0 && "NumPreds will underflow!");
149 --NumPreds;
358 if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) {
  /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/
BasicBlockUtils.cpp 447 /// Preds array, which has NumPreds elements in it. The new block is given a
457 unsigned NumPreds, const char *Suffix,
467 for (unsigned i = 0; i != NumPreds; ++i) {
480 if (NumPreds == 0) {
489 UpdateAnalysisInformation(BB, NewBB, ArrayRef<BasicBlock*>(Preds, NumPreds),
493 UpdatePHINodes(BB, NewBB, ArrayRef<BasicBlock*>(Preds, NumPreds), BI,
CloneFunction.cpp 418 unsigned NumPreds = OPN->getNumIncomingValues();
428 for (unsigned pred = 0, e = NumPreds; pred != e; ++pred) {
450 NumPreds = std::distance(pred_begin(NewBB), pred_end(NewBB));
451 if (NumPreds != PN->getNumIncomingValues()) {
452 assert(NumPreds < PN->getNumIncomingValues());
SSAUpdater.cpp 276 /// vector, set Info->NumPreds, and allocate space in Info->Preds.
299 static Value *CreateEmptyPHI(BasicBlock *BB, unsigned NumPreds,
301 PHINode *PHI = PHINode::Create(Updater->ProtoType, NumPreds,
  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 268 unsigned NumPreds; // # of SDep::Data preds.
310 NodeNum(nodenum), NodeQueueId(0), NumPreds(0), NumSuccs(0),
326 NodeNum(nodenum), NodeQueueId(0), NumPreds(0), NumSuccs(0),
341 NodeNum(BoundaryID), NodeQueueId(0), NumPreds(0), NumSuccs(0),
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Utils/
CloneFunction.cpp 508 unsigned NumPreds = OPN->getNumIncomingValues();
518 for (unsigned pred = 0, e = NumPreds; pred != e; ++pred) {
541 NumPreds = pred_size(NewBB);
542 if (NumPreds != PN->getNumIncomingValues()) {
543 assert(NumPreds < PN->getNumIncomingValues());
    [all...]
SSAUpdater.cpp 257 /// vector, set Info->NumPreds, and allocate space in Info->Preds.
279 static Value *CreateEmptyPHI(BasicBlock *BB, unsigned NumPreds,
281 PHINode *PHI = PHINode::Create(Updater->ProtoType, NumPreds,
  /external/swiftshader/third_party/LLVM/include/llvm/Analysis/
ProfileInfo.h 164 BType *const *Preds, unsigned NumPreds);
  /external/llvm/lib/CodeGen/SelectionDAG/
ResourcePriorityQueue.cpp 533 if (ParallelLiveRanges >= SU->NumPreds)
534 ParallelLiveRanges -= SU->NumPreds;
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/
ResourcePriorityQueue.cpp 518 if (ParallelLiveRanges >= SU->NumPreds)
519 ParallelLiveRanges -= SU->NumPreds;

Completed in 998 milliseconds

1 2