/external/llvm/lib/CodeGen/ |
D | ScheduleDAG.cpp | 67 for (SmallVectorImpl<SDep>::iterator I = Preds.begin(), E = Preds.end(); in addPred() 121 Preds.push_back(D); in addPred() 135 for (SmallVectorImpl<SDep>::iterator I = Preds.begin(), E = Preds.end(); in removePred() 146 Preds.erase(I); in removePred() 201 for (SUnit::const_pred_iterator I = SU->Preds.begin(), in setHeightDirty() 202 E = SU->Preds.end(); I != E; ++I) { in setHeightDirty() 242 for (SUnit::const_pred_iterator I = Cur->Preds.begin(), in ComputeDepth() 243 E = Cur->Preds.end(); I != E; ++I) { in ComputeDepth() 302 SUnit::pred_iterator BestI = Preds.begin(); in biasCriticalPath() 304 for (SUnit::pred_iterator I = std::next(BestI), E = Preds.end(); I != E; in biasCriticalPath() [all …]
|
D | TailDuplication.cpp | 165 SmallSetVector<MachineBasicBlock*, 8> Preds(MBB->pred_begin(), in VerifyPHIs() local 171 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), in VerifyPHIs() 172 PE = Preds.end(); PI != PE; ++PI) { in VerifyPHIs() 192 if (CheckExtra && !Preds.count(PHIBB)) { in VerifyPHIs() 690 SmallVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(), in duplicateSimpleBB() local 693 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), in duplicateSimpleBB() 694 PE = Preds.end(); PI != PE; ++PI) { in duplicateSimpleBB() 780 SmallSetVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(), in TailDuplicate() local 782 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), in TailDuplicate() 783 PE = Preds.end(); PI != PE; ++PI) { in TailDuplicate() [all …]
|
D | LatencyPriorityQueue.cpp | 58 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred()
|
D | AggressiveAntiDepBreaker.cpp | 255 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in AntiDepEdges() 271 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in CriticalPathStep() 873 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies() 874 PE = PathSU->Preds.end(); P != PE; ++P) { in BreakAntiDependencies() 882 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies() 883 PE = PathSU->Preds.end(); P != PE; ++P) { in BreakAntiDependencies()
|
D | CriticalAntiDepBreaker.cpp | 133 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in CriticalPathStep() 562 for (SUnit::const_pred_iterator P = CriticalPathSU->Preds.begin(), in BreakAntiDependencies() 563 PE = CriticalPathSU->Preds.end(); P != PE; ++P) in BreakAntiDependencies()
|
/external/llvm/include/llvm/Transforms/Utils/ |
D | SSAUpdaterImpl.h | 53 BBInfo **Preds; // Array[NumPreds] of predecessor blocks. variable 58 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {} in BBInfo() 113 SmallVector<BlkT*, 10> Preds; in BuildBlockList() local 116 Preds.clear(); in BuildBlockList() 117 Traits::FindPredecessorBlocks(Info->BB, &Preds); in BuildBlockList() 118 Info->NumPreds = Preds.size(); in BuildBlockList() 120 Info->Preds = nullptr; in BuildBlockList() 122 Info->Preds = static_cast<BBInfo**> in BuildBlockList() 127 BlkT *Pred = Preds[p]; in BuildBlockList() 132 Info->Preds[p] = BBMapBucket.second; in BuildBlockList() [all …]
|
D | BasicBlockUtils.h | 208 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds, 227 ArrayRef<BasicBlock *> Preds,
|
D | LoopVersioning.h | 104 SCEVUnionPredicate Preds; variable
|
/external/llvm/lib/Transforms/Utils/ |
D | BasicBlockUtils.cpp | 317 ArrayRef<BasicBlock *> Preds, in UpdateAnalysisInformation() argument 334 for (ArrayRef<BasicBlock *>::iterator i = Preds.begin(), e = Preds.end(); in UpdateAnalysisInformation() 366 i = Preds.begin(), e = Preds.end(); i != e; ++i) { in UpdateAnalysisInformation() 394 ArrayRef<BasicBlock *> Preds, BranchInst *BI, in UpdatePHINodes() argument 397 SmallPtrSet<BasicBlock *, 16> PredSet(Preds.begin(), Preds.end()); in UpdatePHINodes() 405 InVal = PN->getIncomingValueForBlock(Preds[0]); in UpdatePHINodes() 441 PHINode::Create(PN->getType(), Preds.size(), PN->getName() + ".ph", BI); in UpdatePHINodes() 475 ArrayRef<BasicBlock *> Preds, in SplitBlockPredecessors() argument 488 SplitLandingPadPredecessors(BB, Preds, Suffix, NewName.c_str(), NewBBs, DT, in SplitBlockPredecessors() 502 for (unsigned i = 0, e = Preds.size(); i != e; ++i) { in SplitBlockPredecessors() [all …]
|
D | FlattenCFG.cpp | 135 SmallPtrSet<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB)); in FlattenParallelAndOr() local 136 for (SmallPtrSetIterator<BasicBlock *> PI = Preds.begin(), PE = Preds.end(); in FlattenParallelAndOr() 153 if (UnCondBlock || !PP || (Preds.count(PP) == 0) || in FlattenParallelAndOr() 169 if (PP && Preds.count(PP)) { in FlattenParallelAndOr() 206 if (Preds.count(PS) == 0) { in FlattenParallelAndOr()
|
D | BreakCriticalEdges.cpp | 84 static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds, in createPHIsForSplitLoopExit() argument 105 PN->getType(), Preds.size(), "split", in createPHIsForSplitLoopExit() 107 for (unsigned i = 0, e = Preds.size(); i != e; ++i) in createPHIsForSplitLoopExit() 108 NewPN->addIncoming(V, Preds[i]); in createPHIsForSplitLoopExit()
|
D | PromoteMemoryToRegister.cpp | 733 SmallVector<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB)); in run() local 738 std::sort(Preds.begin(), Preds.end()); in run() 745 Preds.begin(), Preds.end(), SomePHI->getIncomingBlock(i)); in run() 746 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i) && in run() 750 Preds.erase(EntIt); in run() 762 for (unsigned pred = 0, e = Preds.size(); pred != e; ++pred) in run() 763 SomePHI->addIncoming(UndefVal, Preds[pred]); in run()
|
/external/clang/test/Analysis/ |
D | blocks.mm | 21 // CHECK-NEXT: Preds (1): B2 25 // CHECK-NEXT: Preds (1): B1 47 // CHECK-NEXT: Preds (1): B2 51 // CHECK-NEXT: Preds (1): B1 71 // CHECK-NEXT: Preds (1): B2 75 // CHECK-NEXT: Preds (1): B1
|
/external/llvm/lib/Target/PowerPC/ |
D | PPCHazardRecognizers.cpp | 40 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) { in isLoadAfterStore() 41 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit()); in isLoadAfterStore() 45 if (!SU->Preds[i].isNormalMemory() && !SU->Preds[i].isBarrier()) in isLoadAfterStore() 49 if (SU->Preds[i].getSUnit() == CurGroup[j]) in isLoadAfterStore() 66 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) { in isBCTRAfterSet() 67 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit()); in isBCTRAfterSet() 71 if (SU->Preds[i].isCtrl()) in isBCTRAfterSet() 75 if (SU->Preds[i].getSUnit() == CurGroup[j]) in isBCTRAfterSet()
|
D | PPCCTRLoops.cpp | 609 SmallVector<MachineBasicBlock *, 8> Preds; in verifyCTRBranch() local 645 if (!CheckPreds && Preds.empty()) in verifyCTRBranch() 660 Preds.push_back(*PI); in verifyCTRBranch() 664 MBB = Preds.pop_back_val(); in verifyCTRBranch() 669 } while (!Preds.empty()); in verifyCTRBranch()
|
/external/clang/lib/StaticAnalyzer/Core/ |
D | ExplodedGraph.cpp | 220 Preds.addNode(V, G); in addPredecessor() 372 if (N->Preds.empty()) { in trim() 378 WL1.append(N->Preds.begin(), N->Preds.end()); in trim() 406 if (N->Preds.empty()) in trim() 414 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end(); in trim()
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
D | ExplodedGraph.h | 118 NodeGroup Preds; variable 179 unsigned pred_size() const { return Preds.size(); } in pred_size() 181 bool pred_empty() const { return Preds.empty(); } in pred_empty() 207 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin() 208 pred_iterator pred_end() { return Preds.end(); } in pred_end() 241 void replacePredecessor(ExplodedNode *node) { Preds.replaceNode(node); } in replacePredecessor()
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
D | ResourcePriorityQueue.cpp | 72 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in numberRCValPredInSU() 157 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in numberCtrlPredInSU() 217 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred() 509 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in scheduledNode() 544 HorizontalVerticalBalance -= (SU->Preds.size() - numberCtrlPredInSU(SU)); in scheduledNode()
|
D | ScheduleDAGRRList.cpp | 527 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in ReleasePredecessors() 809 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in UnscheduleNodeBottomUp() 1030 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors() 1111 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors() 1278 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in DelayForLiveRegsBottomUp() 1857 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CalcNodeSethiUllmanNumber() 1959 for (SUnit::const_pred_iterator I = SU->Preds.begin(),E = SU->Preds.end(); in HighRegPressure() 2009 for (SUnit::const_pred_iterator I = SU->Preds.begin(),E = SU->Preds.end(); in RegPressureDiff() 2053 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in scheduledNode() 2135 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in unscheduledNode() [all …]
|
D | ScheduleDAGFast.cpp | 163 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in ReleasePredecessors() 285 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors() 357 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors() 482 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in DelayForLiveRegsBottomUp()
|
/external/clang/include/clang/Analysis/ |
D | CFG.h | 473 AdjacentBlocks Preds; variable 493 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false), in CFGBlock() 531 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin() 532 pred_iterator pred_end() { return Preds.end(); } in pred_end() 533 const_pred_iterator pred_begin() const { return Preds.begin(); } in pred_begin() 534 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end() 536 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); } in pred_rbegin() 537 pred_reverse_iterator pred_rend() { return Preds.rend(); } in pred_rend() 538 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); } in pred_rbegin() 539 const_pred_reverse_iterator pred_rend() const { return Preds.rend(); } in pred_rend() [all …]
|
/external/llvm/include/llvm/CodeGen/ |
D | ScheduleDAG.h | 275 SmallVector<SDep, 4> Preds; // All sunit predecessors. 459 for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i) 460 if (Preds[i].getSUnit() == N) 632 return Node->Preds[Operand].getSUnit(); 646 return SUnitIterator(N, (unsigned)N->Preds.size()); 659 return Node->Preds[Operand];
|
/external/llvm/lib/Transforms/Scalar/ |
D | StructurizeCFG.cpp | 529 BBPredicates &Preds = Loops ? LoopPreds[SuccFalse] : Predicates[SuccTrue]; in insertConditions() local 535 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end(); in insertConditions() 746 BBPredicates &Preds = Predicates[Node->getEntry()]; in dominatesPredicates() local 747 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end(); in dominatesPredicates() 758 BBPredicates &Preds = Predicates[Node->getEntry()]; in isPredictableTrue() local 765 for (BBPredicates::iterator I = Preds.begin(), E = Preds.end(); in isPredictableTrue()
|
/external/llvm/lib/Target/Hexagon/ |
D | HexagonMachineScheduler.cpp | 232 for (SUnit::succ_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in releaseTopNode() 433 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred() 518 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in SchedulingCost()
|
/external/llvm/lib/Target/AMDGPU/ |
D | SIAnnotateControlFlow.cpp | 310 std::vector<BasicBlock*> Preds; in closeControlFlow() local 313 Preds.push_back(*PI); in closeControlFlow() 315 BB = llvm::SplitBlockPredecessors(BB, Preds, "endcf.split", DT, LI, false); in closeControlFlow()
|