Home
last modified time | relevance | path

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

12

/minix/external/bsd/llvm/dist/llvm/lib/CodeGen/
H A 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()
309 if (BestI != Preds.begin()) in biasCriticalPath()
310 std::swap(*Preds.begin(), *BestI); in biasCriticalPath()
335 if (Preds.size() != 0) { in dumpAll()
337 for (SUnit::const_succ_iterator I = Preds.begin(), E = Preds.end(); in dumpAll()
492 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in InitDAGTopologicalSorting()
508 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in InitDAGTopologicalSorting()
[all …]
H A DTailDuplication.cpp165 SmallSetVector<MachineBasicBlock*, 8> Preds(MBB->pred_begin(), in VerifyPHIs() local
172 PE = Preds.end(); PI != PE; ++PI) { in VerifyPHIs()
192 if (CheckExtra && !Preds.count(PHIBB)) { in VerifyPHIs()
677 SmallVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(), in duplicateSimpleBB() local
680 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), in duplicateSimpleBB()
681 PE = Preds.end(); PI != PE; ++PI) { in duplicateSimpleBB()
767 SmallSetVector<MachineBasicBlock*, 8> Preds(TailBB->pred_begin(), in TailDuplicate() local
769 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), in TailDuplicate()
770 PE = Preds.end(); PI != PE; ++PI) { in TailDuplicate()
933 for (SmallSetVector<MachineBasicBlock *, 8>::iterator PI = Preds.begin(), in TailDuplicate()
[all …]
H A DLatencyPriorityQueue.cpp58 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred()
H A 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()
855 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies()
856 PE = PathSU->Preds.end(); P != PE; ++P) { in BreakAntiDependencies()
864 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies()
865 PE = PathSU->Preds.end(); P != PE; ++P) { in BreakAntiDependencies()
H A 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()
/minix/external/bsd/llvm/dist/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdaterImpl.h113 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()
140 Info->Preds[p] = PredInfo; in BuildBlockList()
240 BBInfo *Pred = Info->Preds[p]; in FindDominators()
[all …]
H A DBasicBlockUtils.h164 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock*> Preds,
180 void SplitLandingPadPredecessors(BasicBlock *OrigBB,ArrayRef<BasicBlock*> Preds,
/minix/external/bsd/llvm/dist/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp334 i = Preds.begin(), e = Preds.end(); i != e; ++i) { in UpdateAnalysisInformation()
368 i = Preds.begin(), e = Preds.end(); i != e; ++i) { in UpdateAnalysisInformation()
400 SmallPtrSet<BasicBlock *, 16> PredSet(Preds.begin(), Preds.end()); in UpdatePHINodes()
408 InVal = PN->getIncomingValueForBlock(Preds[0]); in UpdatePHINodes()
486 for (unsigned i = 0, e = Preds.size(); i != e; ++i) { in SplitBlockPredecessors()
490 assert(!isa<IndirectBrInst>(Preds[i]->getTerminator()) && in SplitBlockPredecessors()
492 Preds[i]->getTerminator()->replaceUsesOfWith(BB, NewBB); in SplitBlockPredecessors()
499 if (Preds.size() == 0) { in SplitBlockPredecessors()
511 UpdatePHINodes(BB, NewBB, Preds, BI, P, HasLoopExit); in SplitBlockPredecessors()
546 for (unsigned i = 0, e = Preds.size(); i != e; ++i) { in SplitLandingPadPredecessors()
[all …]
H A 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()
H A DBreakCriticalEdges.cpp78 static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds, in createPHIsForSplitLoopExit() argument
99 PHINode::Create(PN->getType(), Preds.size(), "split", in createPHIsForSplitLoopExit()
102 for (unsigned i = 0, e = Preds.size(); i != e; ++i) in createPHIsForSplitLoopExit()
103 NewPN->addIncoming(V, Preds[i]); in createPHIsForSplitLoopExit()
H A DPromoteMemoryToRegister.cpp731 SmallVector<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB)); in run() local
736 std::sort(Preds.begin(), Preds.end()); in run()
743 Preds.begin(), Preds.end(), SomePHI->getIncomingBlock(i)); in run()
744 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i) && in run()
748 Preds.erase(EntIt); in run()
760 for (unsigned pred = 0, e = Preds.size(); pred != e; ++pred) in run()
761 SomePHI->addIncoming(UndefVal, Preds[pred]); in run()
H A DLoopUnrollRuntime.cpp124 SmallVector<BasicBlock*, 4> Preds(pred_begin(Exit), pred_end(Exit)); in ConnectProlog() local
126 SplitBlockPredecessors(Exit, Preds, ".unr-lcssa", P); in ConnectProlog()
129 SplitLandingPadPredecessors(Exit, Preds, ".unr1-lcssa", ".unr2-lcssa", in ConnectProlog()
H A DSSAUpdater.cpp243 SmallVectorImpl<BasicBlock*> *Preds) { in FindPredecessorBlocks() argument
249 Preds->push_back(SomePhi->getIncomingBlock(PI)); in FindPredecessorBlocks()
252 Preds->push_back(*PI); in FindPredecessorBlocks()
/minix/external/bsd/llvm/dist/llvm/lib/Target/PowerPC/
H A 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()
H A DPPCCTRLoops.cpp591 SmallVector<MachineBasicBlock *, 8> Preds; in verifyCTRBranch() local
627 if (!CheckPreds && Preds.empty()) in verifyCTRBranch()
642 Preds.push_back(*PI); in verifyCTRBranch()
646 MBB = Preds.pop_back_val(); in verifyCTRBranch()
651 } while (!Preds.empty()); in verifyCTRBranch()
/minix/external/bsd/llvm/dist/clang/lib/StaticAnalyzer/Core/
H A 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()
/minix/external/bsd/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h118 NodeGroup Preds; variable
181 unsigned pred_size() const { return Preds.size(); } in pred_size()
183 bool pred_empty() const { return Preds.empty(); } in pred_empty()
209 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
210 pred_iterator pred_end() { return Preds.end(); } in pred_end()
243 void replacePredecessor(ExplodedNode *node) { Preds.replaceNode(node); } in replacePredecessor()
/minix/external/bsd/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
H A 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()
H A 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()
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()
2300 for (SUnit::const_pred_iterator I = SU->Preds.begin(),E = SU->Preds.end(); in resetVRegCycle()
[all …]
H A 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()
/minix/external/bsd/llvm/dist/clang/include/clang/Analysis/
H A DCFG.h474 AdjacentBlocks Preds; variable
494 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false), in CFGBlock()
533 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
534 pred_iterator pred_end() { return Preds.end(); } in pred_end()
535 const_pred_iterator pred_begin() const { return Preds.begin(); } in pred_begin()
536 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end()
538 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); } in pred_rbegin()
539 pred_reverse_iterator pred_rend() { return Preds.rend(); } in pred_rend()
540 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); } in pred_rbegin()
541 const_pred_reverse_iterator pred_rend() const { return Preds.rend(); } in pred_rend()
[all …]
/minix/external/bsd/llvm/dist/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp472 BBPredicates &Preds = Loops ? LoopPreds[SuccFalse] : Predicates[SuccTrue]; in insertConditions() local
478 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end(); in insertConditions()
689 BBPredicates &Preds = Predicates[Node->getEntry()]; in dominatesPredicates() local
690 for (BBPredicates::iterator PI = Preds.begin(), PE = Preds.end(); in dominatesPredicates()
701 BBPredicates &Preds = Predicates[Node->getEntry()]; in isPredictableTrue() local
708 for (BBPredicates::iterator I = Preds.begin(), E = Preds.end(); in isPredictableTrue()
/minix/external/bsd/llvm/dist/llvm/include/llvm/CodeGen/
H A 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)
638 return Node->Preds[Operand].getSUnit();
652 return SUnitIterator(N, (unsigned)N->Preds.size());
665 return Node->Preds[Operand];
/minix/external/bsd/llvm/dist/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp231 for (SUnit::succ_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in releaseTopNode()
432 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred()
517 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in SchedulingCost()
/minix/external/bsd/llvm/dist/llvm/lib/Target/R600/
H A DSIAnnotateControlFlow.cpp310 std::vector<BasicBlock*> Preds; in closeControlFlow() local
313 Preds.push_back(*PI); in closeControlFlow()
315 BB = llvm::SplitBlockPredecessors(BB, Preds, "endcf.split", this); in closeControlFlow()

12