Home
last modified time | relevance | path

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

123

/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/GlobalISel/
H A DMIPatternMatch.h82 struct And<Pred, Preds...> : And<Preds...> {
84 And(Pred &&p, Preds &&... preds)
85 : And<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {
93 template <typename... Preds> struct Or {
101 struct Or<Pred, Preds...> : Or<Preds...> {
103 Or(Pred &&p, Preds &&... preds)
104 : Or<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {}
111 template <typename... Preds> And<Preds...> m_all_of(Preds &&... preds) {
112 return And<Preds...>(std::forward<Preds>(preds)...);
115 template <typename... Preds> Or<Preds...> m_any_of(Preds &&... preds) {
[all …]
/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DCallSiteSplitting.cpp181 SmallVector<BasicBlock *, 2> Preds(predecessors((BB))); in getTwoPredecessors() local
183 return Preds; in getTwoPredecessors()
195 SmallVector<BasicBlock *, 2> Preds(predecessors(CallSiteBB)); in canSplitCallSite() local
196 if (Preds.size() != 2 || isa<IndirectBrInst>(Preds[0]->getTerminator()) || in canSplitCallSite()
197 isa<IndirectBrInst>(Preds[1]->getTerminator())) in canSplitCallSite()
326 for (unsigned i = 0; i < Preds.size(); i++) { in splitCallSite()
327 BasicBlock *PredBB = Preds[i].first; in splitCallSite()
336 addConditions(NewCS, Preds[i].second); in splitCallSite()
452 return {{Preds[0], {}}, {Preds[1], {}}}; in shouldSplitOnPHIPredicatedArgument()
461 if (Preds[0] == Preds[1]) in shouldSplitOnPredicatedArgument()
[all …]
H A DGVNSink.cpp755 SmallVector<BasicBlock *, 4> Preds; in sinkBB() local
759 Preds.push_back(B); in sinkBB()
763 if (Preds.size() < 2) in sinkBB()
765 llvm::sort(Preds); in sinkBB()
767 unsigned NumOrigPreds = Preds.size(); in sinkBB()
769 for (auto I = Preds.begin(); I != Preds.end();) { in sinkBB()
771 I = Preds.erase(I); in sinkBB()
776 LockstepReverseIterator LRI(Preds); in sinkBB()
789 Cand->calculateCost(NumOrigPHIs, Preds.size()); in sinkBB()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DScheduleDAG.cpp105 for (SDep &PredDep : Preds) { in addPred()
162 Preds.push_back(D); in addPred()
174 if (I == Preds.end()) in removePred()
183 Preds.erase(I); in removePred()
235 for (SDep &PredDep : SU->Preds) { in setHeightDirty()
268 for (const SDep &PredDep : Cur->Preds) { in ComputeDepth()
332 if (BestI != Preds.begin()) in biasCriticalPath()
333 std::swap(*Preds.begin(), *BestI); in biasCriticalPath()
362 if (SU.Preds.size() > 0) { in dumpNodeAll()
364 for (const SDep &Dep : SU.Preds) { in dumpNodeAll()
[all …]
H A DMacroFusion.cpp48 for (SDep &SI : SecondSU.Preds) in fuseInstructionPair()
65 for (SDep &SI : SecondSU.Preds) in fuseInstructionPair()
91 for (const SDep &SI : SecondSU.Preds) { in fuseInstructionPair()
158 for (SDep &Dep : AnchorSU.Preds) { in scheduleAdjacentImpl()
H A DTailDuplicator.cpp99 SmallSetVector<MachineBasicBlock *, 8> Preds(MBB->pred_begin(), in VerifyPHIs() local
105 for (MachineBasicBlock *PredBB : Preds) { in VerifyPHIs()
125 if (CheckExtra && !Preds.count(PHIBB)) { in VerifyPHIs()
705 SmallVector<MachineBasicBlock *, 8> Preds(TailBB->pred_begin(), in duplicateSimpleBB() local
708 for (MachineBasicBlock *PredBB : Preds) { in duplicateSimpleBB()
815 SmallSetVector<MachineBasicBlock *, 8> Preds(TailBB->pred_begin(), in tailDuplicate() local
817 for (MachineBasicBlock *PredBB : Preds) { in tailDuplicate()
958 for (MachineBasicBlock *PredBB : Preds) { in tailDuplicate()
H A DAggressiveAntiDepBreaker.cpp268 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in AntiDepEdges()
284 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in CriticalPathStep()
895 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies()
896 PE = PathSU->Preds.end(); P != PE; ++P) { in BreakAntiDependencies()
904 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies()
905 PE = PathSU->Preds.end(); P != PE; ++P) { in BreakAntiDependencies()
H A DLatencyPriorityQueue.cpp59 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred()
H A DMachinePipeliner.cpp660 for (auto &PI : I.Preds) { in updatePhiDependences()
711 for (SUnit::pred_iterator P = I.Preds.begin(), E = I.Preds.end(); P != E; in changeDependences()
900 for (SUnit::pred_iterator IP = SU->Preds.begin(), EP = SU->Preds.end(); in swapAntiDependences()
1081 for (auto &Dep : SU.Preds) { in apply()
1231 Preds.clear(); in pred_L()
1234 for (SUnit::pred_iterator PI = (*I)->Preds.begin(), PE = (*I)->Preds.end(); in pred_L()
1255 return !Preds.empty(); in pred_L()
1307 for (auto &PI : Cur->Preds) in computePath()
1530 for (auto &PI : SU->Preds) { in addConnectedNodes()
3217 for (auto &P : SU->Preds) in multipleIterations()
[all …]
/freebsd-12.1/contrib/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp385 for (BasicBlock *Pred : Preds) { in UpdateAnalysisInformation()
419 for (BasicBlock *Pred : Preds) { in UpdateAnalysisInformation()
449 SmallPtrSet<BasicBlock *, 16> PredSet(Preds.begin(), Preds.end()); in UpdatePHINodes()
457 InVal = PN->getIncomingValueForBlock(Preds[0]); in UpdatePHINodes()
540 for (unsigned i = 0, e = Preds.size(); i != e; ++i) { in SplitBlockPredecessors()
546 Preds[i]->getTerminator()->replaceUsesOfWith(BB, NewBB); in SplitBlockPredecessors()
553 if (Preds.empty()) { in SplitBlockPredecessors()
564 if (!Preds.empty()) { in SplitBlockPredecessors()
566 UpdatePHINodes(BB, NewBB, Preds, BI, HasLoopExit); in SplitBlockPredecessors()
593 for (unsigned i = 0, e = Preds.size(); i != e; ++i) { in SplitLandingPadPredecessors()
[all …]
H A DFlattenCFG.cpp148 SmallPtrSet<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB)); in FlattenParallelAndOr() local
149 for (SmallPtrSetIterator<BasicBlock *> PI = Preds.begin(), PE = Preds.end(); in FlattenParallelAndOr()
166 if (UnCondBlock || !PP || (Preds.count(PP) == 0) || in FlattenParallelAndOr()
182 if (PP && Preds.count(PP)) { in FlattenParallelAndOr()
219 if (Preds.count(PS) == 0) { in FlattenParallelAndOr()
H A DBreakCriticalEdges.cpp102 static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds, in createPHIsForSplitLoopExit() argument
122 PN.getType(), Preds.size(), "split", in createPHIsForSplitLoopExit()
124 for (unsigned i = 0, e = Preds.size(); i != e; ++i) in createPHIsForSplitLoopExit()
125 NewPN->addIncoming(V, Preds[i]); in createPHIsForSplitLoopExit()
H A DPromoteMemoryToRegister.cpp748 SmallVector<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB)); in run() local
756 llvm::sort(Preds, CompareBBNumbers); in run()
763 Preds.begin(), Preds.end(), SomePHI->getIncomingBlock(i), in run()
765 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i) && in run()
769 Preds.erase(EntIt); in run()
781 for (BasicBlock *Pred : Preds) in run()
/freebsd-12.1/contrib/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdaterImpl.h64 BBInfo **Preds = nullptr; variable
127 SmallVector<BlkT *, 10> Preds; in BuildBlockList() local
130 Preds.clear(); in BuildBlockList()
131 Traits::FindPredecessorBlocks(Info->BB, &Preds); in BuildBlockList()
132 Info->NumPreds = Preds.size(); in BuildBlockList()
134 Info->Preds = nullptr; in BuildBlockList()
140 BlkT *Pred = Preds[p]; in BuildBlockList()
145 Info->Preds[p] = BBMapBucket.second; in BuildBlockList()
153 Info->Preds[p] = PredInfo; in BuildBlockList()
253 BBInfo *Pred = Info->Preds[p]; in FindDominators()
[all …]
/freebsd-12.1/contrib/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()
/freebsd-12.1/contrib/llvm/lib/Target/ARM/
H A DARMInstructionSelector.cpp355 Preds.first = ARMCC::EQ; in getComparePreds()
359 Preds.first = ARMCC::GT; in getComparePreds()
363 Preds.first = ARMCC::GE; in getComparePreds()
367 Preds.first = ARMCC::HI; in getComparePreds()
370 Preds.first = ARMCC::MI; in getComparePreds()
374 Preds.first = ARMCC::LS; in getComparePreds()
377 Preds.first = ARMCC::VC; in getComparePreds()
380 Preds.first = ARMCC::VS; in getComparePreds()
383 Preds.first = ARMCC::PL; in getComparePreds()
387 Preds.first = ARMCC::LT; in getComparePreds()
[all …]
/freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp208 Preds.addNode(V, G); in addPredecessor()
372 if (N->Preds.empty()) { in trim()
378 WL1.append(N->Preds.begin(), N->Preds.end()); in trim()
405 if (N->Preds.empty()) in trim()
413 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end(); in trim()
/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DHexagonSubtarget.cpp134 for (auto &D : SU.Preds) in apply()
163 for (SDep &PI : SI.getSUnit()->Preds) { in apply()
452 auto F = std::find(Dst->Preds.begin(), Dst->Preds.end(), T); in restoreLatency()
453 assert(F != Dst->Preds.end()); in restoreLatency()
469 auto F = std::find(Dst->Preds.begin(), Dst->Preds.end(), T); in changeLatency()
470 assert(F != Dst->Preds.end()); in changeLatency()
514 SUnit *SrcBest = getZeroLatency(Dst, Dst->Preds); in isBestZeroLatency()
556 for (auto &I : DstBest->Preds) in isBestZeroLatency()
H A DHexagonMachineScheduler.cpp291 for (const SDep &PI : SU->Preds) { in releaseTopNode()
524 for (auto &Pred : SU->Preds) { in isSingleUnscheduledPred()
651 for (const SDep &PI : SU->Preds) in SchedulingCost()
705 for (const SDep &PI : SU->Preds) { in SchedulingCost()
731 for (const auto &PI : SU->Preds) { in SchedulingCost()
838 CurrSize = (*I)->Preds.size(); in pickNodeFromQueue()
839 CandSize = Candidate.SU->Preds.size(); in pickNodeFromQueue()
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h130 NodeGroup Preds; variable
195 unsigned pred_size() const { return Preds.size(); } in pred_size()
197 bool pred_empty() const { return Preds.empty(); } in pred_empty()
227 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
228 pred_iterator pred_end() { return Preds.end(); } in pred_end()
258 void replacePredecessor(ExplodedNode *node) { Preds.replaceNode(node); } in replacePredecessor()
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/
H A DCFG.h672 AdjacentBlocks Preds; variable
691 : Elements(C), Terminator(nullptr), BlockID(blockid), Preds(C, 1), in CFGBlock()
733 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
734 pred_iterator pred_end() { return Preds.end(); } in pred_end()
735 const_pred_iterator pred_begin() const { return Preds.begin(); } in pred_begin()
736 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end()
738 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); } in pred_rbegin()
739 pred_reverse_iterator pred_rend() { return Preds.rend(); } in pred_rend()
740 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); } in pred_rbegin()
741 const_pred_reverse_iterator pred_rend() const { return Preds.rend(); } in pred_rend()
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h260 SmallVector<SDep, 4> Preds; ///< All sunit predecessors.
436 for (const SDep &Pred : Preds)
635 return Node->Preds[Operand].getSUnit();
649 return SUnitIterator(N, (unsigned)N->Preds.size());
663 return Node->Preds[Operand];
/freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp70 for (SDep &Pred : SU->Preds) { in numberRCValPredInSU()
152 for (SDep &Pred : SU->Preds) in numberCtrlPredInSU()
211 for (const SDep &Pred : SU->Preds) { in getSingleUnscheduledPred()
496 for (SDep &Pred : SU->Preds) { in scheduledNode()
529 HorizontalVerticalBalance -= (SU->Preds.size() - numberCtrlPredInSU(SU)); in scheduledNode()
H A DScheduleDAGRRList.cpp551 for (SDep &Pred : SU->Preds) { in ReleasePredecessors()
833 for (SDep &Pred : SU->Preds) { in UnscheduleNodeBottomUp()
1055 for (SDep &Pred : SU->Preds) { in TryUnfoldSU()
1180 for (SDep &Pred : SU->Preds) in CopyAndMoveSuccessors()
1344 for (SDep &Pred : SU->Preds) { in DelayForLiveRegsBottomUp()
1944 auto &Pred = TempSU->Preds[P]; in CalcNodeSethiUllmanNumber()
2070 for (const SDep &Pred : SU->Preds) { in HighRegPressure()
2119 for (const SDep &Pred : SU->Preds) { in RegPressureDiff()
2162 for (const SDep &Pred : SU->Preds) { in scheduledNode()
2244 for (const SDep &Pred : SU->Preds) { in unscheduledNode()
[all …]
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DTypeMetadataUtils.cpp101 SmallVectorImpl<Instruction *> &Preds, bool &HasNonCallUses, in findDevirtualizableCallsForTypeCheckedLoad() argument
120 Preds.push_back(EVI); in findDevirtualizableCallsForTypeCheckedLoad()

123