Home
last modified time | relevance | path

Searched refs:Preds (Results 1 – 25 of 41) sorted by relevance

12

/external/llvm/lib/CodeGen/
DScheduleDAG.cpp67 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 …]
DTailDuplication.cpp165 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()
676 SmallVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(), in duplicateSimpleBB() local
679 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), in duplicateSimpleBB()
680 PE = Preds.end(); PI != PE; ++PI) { in duplicateSimpleBB()
766 SmallSetVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(), in TailDuplicate() local
768 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), in TailDuplicate()
769 PE = Preds.end(); PI != PE; ++PI) { in TailDuplicate()
[all …]
DLatencyPriorityQueue.cpp58 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred()
DAggressiveAntiDepBreaker.cpp256 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in AntiDepEdges()
272 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in CriticalPathStep()
865 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies()
866 PE = PathSU->Preds.end(); P != PE; ++P) { in BreakAntiDependencies()
874 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies()
875 PE = PathSU->Preds.end(); P != PE; ++P) { in BreakAntiDependencies()
DCriticalAntiDepBreaker.cpp134 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in CriticalPathStep()
563 for (SUnit::const_pred_iterator P = CriticalPathSU->Preds.begin(), in BreakAntiDependencies()
564 PE = CriticalPathSU->Preds.end(); P != PE; ++P) in BreakAntiDependencies()
DMachineSSAUpdater.cpp277 SmallVectorImpl<MachineBasicBlock*> *Preds){ in FindPredecessorBlocks() argument
280 Preds->push_back(*PI); in FindPredecessorBlocks()
/external/llvm/include/llvm/Transforms/Utils/
DSSAUpdaterImpl.h53 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 …]
DBasicBlockUtils.h221 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
242 ArrayRef<BasicBlock *> Preds,
/external/llvm/lib/Transforms/Utils/
DBasicBlockUtils.cpp313 ArrayRef<BasicBlock *> Preds, in UpdateAnalysisInformation() argument
330 for (ArrayRef<BasicBlock *>::iterator i = Preds.begin(), e = Preds.end(); in UpdateAnalysisInformation()
362 i = Preds.begin(), e = Preds.end(); i != e; ++i) { in UpdateAnalysisInformation()
390 ArrayRef<BasicBlock *> Preds, BranchInst *BI, in UpdatePHINodes() argument
393 SmallPtrSet<BasicBlock *, 16> PredSet(Preds.begin(), Preds.end()); in UpdatePHINodes()
401 InVal = PN->getIncomingValueForBlock(Preds[0]); in UpdatePHINodes()
437 PHINode::Create(PN->getType(), Preds.size(), PN->getName() + ".ph", BI); in UpdatePHINodes()
473 ArrayRef<BasicBlock *> Preds, in SplitBlockPredecessors() argument
483 SplitLandingPadPredecessors(BB, Preds, Suffix, NewName.c_str(), in SplitBlockPredecessors()
496 for (unsigned i = 0, e = Preds.size(); i != e; ++i) { in SplitBlockPredecessors()
[all …]
DFlattenCFG.cpp137 SmallPtrSet<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB)); in FlattenParallelAndOr() local
138 for (SmallPtrSetIterator<BasicBlock *> PI = Preds.begin(), PE = Preds.end(); in FlattenParallelAndOr()
155 if (UnCondBlock || !PP || (Preds.count(PP) == 0) || in FlattenParallelAndOr()
171 if (PP && Preds.count(PP)) { in FlattenParallelAndOr()
207 if (Preds.count(PS) == 0) { in FlattenParallelAndOr()
DBreakCriticalEdges.cpp84 static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds, in createPHIsForSplitLoopExit() argument
105 PHINode::Create(PN->getType(), Preds.size(), "split", in createPHIsForSplitLoopExit()
108 for (unsigned i = 0, e = Preds.size(); i != e; ++i) in createPHIsForSplitLoopExit()
109 NewPN->addIncoming(V, Preds[i]); in createPHIsForSplitLoopExit()
DPromoteMemoryToRegister.cpp734 SmallVector<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB)); in run() local
739 std::sort(Preds.begin(), Preds.end()); in run()
746 Preds.begin(), Preds.end(), SomePHI->getIncomingBlock(i)); in run()
747 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i) && in run()
751 Preds.erase(EntIt); in run()
763 for (unsigned pred = 0, e = Preds.size(); pred != e; ++pred) in run()
764 SomePHI->addIncoming(UndefVal, Preds[pred]); in run()
DSSAUpdater.cpp245 SmallVectorImpl<BasicBlock*> *Preds) { in FindPredecessorBlocks() argument
250 Preds->append(SomePhi->block_begin(), SomePhi->block_end()); in FindPredecessorBlocks()
253 Preds->push_back(*PI); in FindPredecessorBlocks()
/external/llvm/lib/Target/PowerPC/
DPPCHazardRecognizers.cpp40 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()
DPPCCTRLoops.cpp593 SmallVector<MachineBasicBlock *, 8> Preds; in verifyCTRBranch() local
629 if (!CheckPreds && Preds.empty()) in verifyCTRBranch()
644 Preds.push_back(*PI); in verifyCTRBranch()
648 MBB = Preds.pop_back_val(); in verifyCTRBranch()
653 } while (!Preds.empty()); in verifyCTRBranch()
/external/clang/lib/StaticAnalyzer/Core/
DExplodedGraph.cpp220 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/
DExplodedGraph.h118 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/
DResourcePriorityQueue.cpp72 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()
DScheduleDAGRRList.cpp527 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()
1022 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
1103 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
1271 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in DelayForLiveRegsBottomUp()
1848 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CalcNodeSethiUllmanNumber()
1950 for (SUnit::const_pred_iterator I = SU->Preds.begin(),E = SU->Preds.end(); in HighRegPressure()
2000 for (SUnit::const_pred_iterator I = SU->Preds.begin(),E = SU->Preds.end(); in RegPressureDiff()
2044 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in scheduledNode()
2126 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in unscheduledNode()
[all …]
DScheduleDAGFast.cpp163 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in ReleasePredecessors()
286 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
358 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in CopyAndMoveSuccessors()
483 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in DelayForLiveRegsBottomUp()
/external/clang/include/clang/Analysis/
DCFG.h474 AdjacentBlocks Preds; variable
494 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false), in CFGBlock()
532 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
533 pred_iterator pred_end() { return Preds.end(); } in pred_end()
534 const_pred_iterator pred_begin() const { return Preds.begin(); } in pred_begin()
535 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end()
537 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); } in pred_rbegin()
538 pred_reverse_iterator pred_rend() { return Preds.rend(); } in pred_rend()
539 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); } in pred_rbegin()
540 const_pred_reverse_iterator pred_rend() const { return Preds.rend(); } in pred_rend()
[all …]
/external/llvm/include/llvm/CodeGen/
DScheduleDAG.h275 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/
DStructurizeCFG.cpp533 BBPredicates &Preds = Loops ? LoopPreds[SuccFalse] : Predicates[SuccTrue]; in insertConditions() local
539 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end(); in insertConditions()
750 BBPredicates &Preds = Predicates[Node->getEntry()]; in dominatesPredicates() local
751 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end(); in dominatesPredicates()
762 BBPredicates &Preds = Predicates[Node->getEntry()]; in isPredictableTrue() local
769 for (BBPredicates::iterator I = Preds.begin(), E = Preds.end(); in isPredictableTrue()
/external/llvm/lib/Target/Hexagon/
DHexagonMachineScheduler.cpp228 for (SUnit::succ_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in releaseTopNode()
429 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred()
514 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in SchedulingCost()
/external/llvm/lib/Target/R600/
DSIAnnotateControlFlow.cpp302 std::vector<BasicBlock*> Preds; in closeControlFlow() local
305 Preds.push_back(*PI); in closeControlFlow()
307 BB = llvm::SplitBlockPredecessors(BB, Preds, "endcf.split", nullptr, DT, in closeControlFlow()

12