Home
last modified time | relevance | path

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

123

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/GlobalISel/
DMIPatternMatch.h72 template <typename... Preds> struct And {
79 template <typename Pred, typename... Preds>
80 struct And<Pred, Preds...> : And<Preds...> {
82 And(Pred &&p, Preds &&... preds)
83 : And<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {
87 return P.match(MRI, src) && And<Preds...>::match(MRI, src);
91 template <typename... Preds> struct Or {
98 template <typename Pred, typename... Preds>
99 struct Or<Pred, Preds...> : Or<Preds...> {
101 Or(Pred &&p, Preds &&... preds)
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
DCallSiteSplitting.cpp182 SmallVector<BasicBlock *, 2> Preds(predecessors((BB))); in getTwoPredecessors() local
183 assert(Preds.size() == 2 && "Expected exactly 2 predecessors!"); in getTwoPredecessors()
184 return Preds; in getTwoPredecessors()
199 SmallVector<BasicBlock *, 2> Preds(predecessors(CallSiteBB)); in canSplitCallSite() local
200 if (Preds.size() != 2 || isa<IndirectBrInst>(Preds[0]->getTerminator()) || in canSplitCallSite()
201 isa<IndirectBrInst>(Preds[1]->getTerminator())) in canSplitCallSite()
308 const SmallVectorImpl<std::pair<BasicBlock *, ConditionsTy>> &Preds, in splitCallSite() argument
320 CallPN = PHINode::Create(Instr->getType(), Preds.size(), "phi.call"); in splitCallSite()
326 assert(Preds.size() == 2 && "The ValueToValueMaps array has size 2."); in splitCallSite()
330 for (unsigned i = 0; i < Preds.size(); i++) { in splitCallSite()
[all …]
DGVNSink.cpp765 SmallVector<BasicBlock *, 4> Preds; in sinkBB() local
769 Preds.push_back(B); in sinkBB()
773 if (Preds.size() < 2) in sinkBB()
775 llvm::sort(Preds); in sinkBB()
777 unsigned NumOrigPreds = Preds.size(); in sinkBB()
779 for (auto I = Preds.begin(); I != Preds.end();) { in sinkBB()
781 I = Preds.erase(I); in sinkBB()
786 LockstepReverseIterator LRI(Preds); in sinkBB()
799 Cand->calculateCost(NumOrigPHIs, Preds.size()); in sinkBB()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DScheduleDAG.cpp109 for (SDep &PredDep : Preds) { in addPred()
166 Preds.push_back(D); in addPred()
177 SmallVectorImpl<SDep>::iterator I = llvm::find(Preds, D); in removePred()
178 if (I == Preds.end()) in removePred()
187 Preds.erase(I); in removePred()
239 for (SDep &PredDep : SU->Preds) { in setHeightDirty()
272 for (const SDep &PredDep : Cur->Preds) { in ComputeDepth()
329 SUnit::pred_iterator BestI = Preds.begin(); in biasCriticalPath()
331 for (SUnit::pred_iterator I = std::next(BestI), E = Preds.end(); I != E; in biasCriticalPath()
336 if (BestI != Preds.begin()) in biasCriticalPath()
[all …]
DMacroFusion.cpp40 for (const SDep &SI : SU.Preds) in getPredClusterSU()
62 for (SDep &SI : SecondSU.Preds) in fuseInstructionPair()
87 for (SDep &SI : SecondSU.Preds) in fuseInstructionPair()
113 for (const SDep &SI : SecondSU.Preds) { in fuseInstructionPair()
178 for (SDep &Dep : AnchorSU.Preds) { in scheduleAdjacentImpl()
DMachinePipeliner.cpp820 for (auto &PI : I.Preds) { in updatePhiDependences()
871 for (SUnit::pred_iterator P = I.Preds.begin(), E = I.Preds.end(); P != E; in changeDependences()
881 for (auto &P : LastSU->Preds) in changeDependences()
1117 for (SUnit::pred_iterator IP = SU->Preds.begin(), EP = SU->Preds.end(); in swapAntiDependences()
1174 for (auto &PI : SUnits[i].Preds) { in createAdjacencyStructure()
1298 for (auto &Dep : SU.Preds) { in apply()
1384 for (SUnit::const_pred_iterator IP = SU->Preds.begin(), in computeNodeFunctions()
1385 EP = SU->Preds.end(); in computeNodeFunctions()
1447 SmallSetVector<SUnit *, 8> &Preds, in pred_L() argument
1449 Preds.clear(); in pred_L()
[all …]
DTailDuplicator.cpp105 SmallSetVector<MachineBasicBlock *, 8> Preds(MBB->pred_begin(), in VerifyPHIs() local
111 for (MachineBasicBlock *PredBB : Preds) { in VerifyPHIs()
131 if (CheckExtra && !Preds.count(PHIBB)) { in VerifyPHIs()
711 SmallVector<MachineBasicBlock *, 8> Preds(TailBB->pred_begin(), in duplicateSimpleBB() local
714 for (MachineBasicBlock *PredBB : Preds) { in duplicateSimpleBB()
821 SmallSetVector<MachineBasicBlock *, 8> Preds(TailBB->pred_begin(), in tailDuplicate() local
823 for (MachineBasicBlock *PredBB : Preds) { in tailDuplicate()
959 for (MachineBasicBlock *PredBB : Preds) { in tailDuplicate()
DAggressiveAntiDepBreaker.cpp267 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in AntiDepEdges()
283 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end(); in CriticalPathStep()
894 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies()
895 PE = PathSU->Preds.end(); P != PE; ++P) { in BreakAntiDependencies()
903 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(), in BreakAntiDependencies()
904 PE = PathSU->Preds.end(); P != PE; ++P) { in BreakAntiDependencies()
DLatencyPriorityQueue.cpp58 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in getSingleUnscheduledPred()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/Utils/
DSSAUpdaterImpl.h63 BBInfo **Preds = nullptr; variable
126 SmallVector<BlkT *, 10> Preds; in BuildBlockList() local
129 Preds.clear(); in BuildBlockList()
130 Traits::FindPredecessorBlocks(Info->BB, &Preds); in BuildBlockList()
131 Info->NumPreds = Preds.size(); in BuildBlockList()
133 Info->Preds = nullptr; in BuildBlockList()
135 Info->Preds = static_cast<BBInfo **>(Allocator.Allocate( in BuildBlockList()
139 BlkT *Pred = Preds[p]; in BuildBlockList()
144 Info->Preds[p] = BBMapBucket.second; in BuildBlockList()
152 Info->Preds[p] = PredInfo; in BuildBlockList()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
DBasicBlockUtils.cpp553 ArrayRef<BasicBlock *> Preds, in UpdateAnalysisInformation() argument
570 MSSAU->wireOldPredecessorsToNewImmediatePredecessor(OldBB, NewBB, Preds); in UpdateAnalysisInformation()
583 for (BasicBlock *Pred : Preds) { in UpdateAnalysisInformation()
617 for (BasicBlock *Pred : Preds) { in UpdateAnalysisInformation()
644 ArrayRef<BasicBlock *> Preds, BranchInst *BI, in UpdatePHINodes() argument
647 SmallPtrSet<BasicBlock *, 16> PredSet(Preds.begin(), Preds.end()); in UpdatePHINodes()
655 InVal = PN->getIncomingValueForBlock(Preds[0]); in UpdatePHINodes()
691 PHINode::Create(PN->getType(), Preds.size(), PN->getName() + ".ph", BI); in UpdatePHINodes()
710 ArrayRef<BasicBlock *> Preds, in SplitBlockPredecessors() argument
724 SplitLandingPadPredecessors(BB, Preds, Suffix, NewName.c_str(), NewBBs, DT, in SplitBlockPredecessors()
[all …]
DFlattenCFG.cpp147 SmallPtrSet<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB)); in FlattenParallelAndOr() local
148 for (SmallPtrSetIterator<BasicBlock *> PI = Preds.begin(), PE = Preds.end(); in FlattenParallelAndOr()
165 if (UnCondBlock || !PP || (Preds.count(PP) == 0) || in FlattenParallelAndOr()
181 if (PP && Preds.count(PP)) { in FlattenParallelAndOr()
218 if (Preds.count(PS) == 0) { in FlattenParallelAndOr()
DBreakCriticalEdges.cpp107 static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds, in createPHIsForSplitLoopExit() argument
127 PN.getType(), Preds.size(), "split", in createPHIsForSplitLoopExit()
129 for (unsigned i = 0, e = Preds.size(); i != e; ++i) in createPHIsForSplitLoopExit()
130 NewPN->addIncoming(V, Preds[i]); in createPHIsForSplitLoopExit()
DLoopUnrollRuntime.cpp161 SmallVector<BasicBlock *, 4> Preds(predecessors(OriginalLoopLatchExit)); in ConnectProlog() local
162 SplitBlockPredecessors(OriginalLoopLatchExit, Preds, ".unr-lcssa", DT, LI, in ConnectProlog()
276 SmallVector<BasicBlock*, 4> Preds(predecessors(Exit)); in ConnectEpilog() local
277 SplitBlockPredecessors(Exit, Preds, ".epilog-lcssa", DT, LI, nullptr, in ConnectEpilog()
674 SmallVector<BasicBlock*, 4> Preds(predecessors(LatchExit)); in UnrollRuntimeLoopRemainder() local
675 NewExit = SplitBlockPredecessors(LatchExit, Preds, ".unr-lcssa", DT, LI, in UnrollRuntimeLoopRemainder()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/PowerPC/
DPPCHazardRecognizers.cpp38 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) { in isLoadAfterStore()
39 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit()); in isLoadAfterStore()
43 if (!SU->Preds[i].isNormalMemory() && !SU->Preds[i].isBarrier()) in isLoadAfterStore()
47 if (SU->Preds[i].getSUnit() == CurGroup[j]) in isLoadAfterStore()
64 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) { in isBCTRAfterSet()
65 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit()); in isBCTRAfterSet()
69 if (SU->Preds[i].isCtrl()) in isBCTRAfterSet()
73 if (SU->Preds[i].getSUnit() == CurGroup[j]) in isBCTRAfterSet()
DPPCCTRLoops.cpp132 SmallVector<MachineBasicBlock *, 8> Preds; in verifyCTRBranch() local
168 if (!CheckPreds && Preds.empty()) in verifyCTRBranch()
183 Preds.push_back(*PI); in verifyCTRBranch()
187 MBB = Preds.pop_back_val(); in verifyCTRBranch()
192 } while (!Preds.empty()); in verifyCTRBranch()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
DHexagonSubtarget.cpp133 for (auto &D : SU.Preds) in apply()
162 for (SDep &PI : SI.getSUnit()->Preds) { in apply()
450 auto F = std::find(Dst->Preds.begin(), Dst->Preds.end(), T); in restoreLatency()
451 assert(F != Dst->Preds.end()); in restoreLatency()
467 auto F = std::find(Dst->Preds.begin(), Dst->Preds.end(), T); in changeLatency()
468 assert(F != Dst->Preds.end()); in changeLatency()
512 SUnit *SrcBest = getZeroLatency(Dst, Dst->Preds); in isBestZeroLatency()
554 for (auto &I : DstBest->Preds) in isBestZeroLatency()
DHexagonMachineScheduler.cpp292 for (const SDep &PI : SU->Preds) { in releaseTopNode()
525 for (auto &Pred : SU->Preds) { in isSingleUnscheduledPred()
652 for (const SDep &PI : SU->Preds) in SchedulingCost()
706 for (const SDep &PI : SU->Preds) { in SchedulingCost()
732 for (const auto &PI : SU->Preds) { in SchedulingCost()
839 CurrSize = (*I)->Preds.size(); in pickNodeFromQueue()
840 CandSize = Candidate.SU->Preds.size(); in pickNodeFromQueue()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/ARM/
DARMInstructionSelector.cpp395 std::pair<ARMCC::CondCodes, ARMCC::CondCodes> Preds = {ARMCC::AL, ARMCC::AL}; in getComparePreds() local
398 Preds = {ARMCC::GT, ARMCC::MI}; in getComparePreds()
401 Preds = {ARMCC::EQ, ARMCC::VS}; in getComparePreds()
405 Preds.first = ARMCC::EQ; in getComparePreds()
409 Preds.first = ARMCC::GT; in getComparePreds()
413 Preds.first = ARMCC::GE; in getComparePreds()
417 Preds.first = ARMCC::HI; in getComparePreds()
420 Preds.first = ARMCC::MI; in getComparePreds()
424 Preds.first = ARMCC::LS; in getComparePreds()
427 Preds.first = ARMCC::VC; in getComparePreds()
[all …]
DARMLowOverheadLoops.cpp68 PredicatedMI(MachineInstr *I, SetVector<MachineInstr*> &Preds) : in PredicatedMI()
70 Predicates.insert(Preds.begin(), Preds.end()); in PredicatedMI()
84 VPTBlock(MachineInstr *MI, SetVector<MachineInstr*> &Preds) { in VPTBlock() argument
85 VPST = std::make_unique<PredicatedMI>(MI, Preds); in VPTBlock()
88 void addInst(MachineInstr *MI, SetVector<MachineInstr*> &Preds) { in addInst() argument
90 if (!Divergent && !set_difference(Preds, VPST->Predicates).empty()) { in addInst()
94 Insts.emplace_back(MI, Preds); in addInst()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/
DResourcePriorityQueue.cpp69 for (SDep &Pred : SU->Preds) { in numberRCValPredInSU()
153 for (SDep &Pred : SU->Preds) in numberCtrlPredInSU()
212 for (const SDep &Pred : SU->Preds) { in getSingleUnscheduledPred()
498 for (SDep &Pred : SU->Preds) { in scheduledNode()
531 HorizontalVerticalBalance -= (SU->Preds.size() - numberCtrlPredInSU(SU)); in scheduledNode()
DScheduleDAGRRList.cpp556 for (SDep &Pred : SU->Preds) { in ReleasePredecessors()
839 for (SDep &Pred : SU->Preds) { in UnscheduleNodeBottomUp()
1062 for (SDep &Pred : SU->Preds) { in TryUnfoldSU()
1187 for (SDep &Pred : SU->Preds) in CopyAndMoveSuccessors()
1355 for (SDep &Pred : SU->Preds) { in DelayForLiveRegsBottomUp()
1960 for (unsigned P = Temp.PredsProcessed; P < TempSU->Preds.size(); ++P) { in CalcNodeSethiUllmanNumber()
1961 auto &Pred = TempSU->Preds[P]; in CalcNodeSethiUllmanNumber()
1984 for (const SDep &Pred : TempSU->Preds) { in CalcNodeSethiUllmanNumber()
2087 for (const SDep &Pred : SU->Preds) { in HighRegPressure()
2136 for (const SDep &Pred : SU->Preds) { in RegPressureDiff()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
DScheduleDAG.h256 SmallVector<SDep, 4> Preds; ///< All sunit predecessors. variable
432 for (const SDep &Pred : Preds) in isPred()
631 return Node->Preds[Operand].getSUnit();
645 return SUnitIterator(N, (unsigned)N->Preds.size()); in end()
659 return Node->Preds[Operand]; in getSDep()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
DGCNMinRegStrategy.cpp96 for (auto PDep : SDep.getSUnit()->Preds) { in getReadySuccessors()
189 for (const auto &P : S.getSUnit()->Preds) { in bumpPredsPriority()
201 for (const auto &P : SU->Preds) { in bumpPredsPriority()
DGCNILPSched.cpp65 for (const SDep &Pred : SU->Preds) { in CalcNodeSethiUllmanNumber()
124 for (const SDep &Pred : SU->Preds) { in calcMaxScratches()
277 for (const auto &PredEdge : SU->Preds) { in releasePredecessors()

123