Home
last modified time | relevance | path

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

1234

/openbsd/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DCallSiteSplitting.cpp183 return Preds; in getTwoPredecessors()
198 if (Preds.size() != 2 || isa<IndirectBrInst>(Preds[0]->getTerminator()) || in canSplitCallSite()
199 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()
335 addConditions(*NewCI, Preds[i].second); in splitCallSite()
447 auto Preds = getTwoPredecessors(CB.getParent()); in shouldSplitOnPHIPredicatedArgument() local
448 return {{Preds[0], {}}, {Preds[1], {}}}; in shouldSplitOnPHIPredicatedArgument()
456 auto Preds = getTwoPredecessors(CB.getParent()); in shouldSplitOnPredicatedArgument() local
457 if (Preds[0] == Preds[1]) in shouldSplitOnPredicatedArgument()
[all …]
H A DGVNSink.cpp771 SmallVector<BasicBlock *, 4> Preds; in sinkBB() local
775 Preds.push_back(B); in sinkBB()
779 if (Preds.size() < 2) in sinkBB()
781 llvm::sort(Preds); in sinkBB()
783 unsigned NumOrigPreds = Preds.size(); in sinkBB()
785 llvm::erase_if(Preds, [](BasicBlock *BB) { in sinkBB()
789 LockstepReverseIterator LRI(Preds); in sinkBB()
802 Cand->calculateCost(NumOrigPHIs, Preds.size()); in sinkBB()
/openbsd/gnu/llvm/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdaterImpl.h63 BBInfo **Preds = nullptr; variable
126 SmallVector<BlkT *, 10> Preds; in BuildBlockList() local
129 Preds.clear(); in BuildBlockList()
131 Info->NumPreds = Preds.size(); in BuildBlockList()
133 Info->Preds = nullptr; in BuildBlockList()
139 BlkT *Pred = Preds[p]; in BuildBlockList()
144 Info->Preds[p] = BBMapBucket.second; in BuildBlockList()
152 Info->Preds[p] = PredInfo; in BuildBlockList()
252 BBInfo *Pred = Info->Preds[p]; in FindDominators()
344 Info->DefBB = Info->Preds[0]->DefBB; in FindSingularVal()
[all …]
H A DBasicBlockUtils.h194 void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds,
325 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
345 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
366 ArrayRef<BasicBlock *> Preds,
385 BasicBlock *OrigBB, ArrayRef<BasicBlock *> Preds, const char *Suffix,
/openbsd/gnu/llvm/llvm/lib/CodeGen/
H A DScheduleDAG.cpp109 for (SDep &PredDep : Preds) { in addPred()
166 Preds.push_back(D); in addPred()
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()
336 if (BestI != Preds.begin()) in biasCriticalPath()
337 std::swap(*Preds.begin(), *BestI); in biasCriticalPath()
366 if (SU.Preds.size() > 0) { in dumpNodeAll()
368 for (const SDep &Dep : SU.Preds) { in dumpNodeAll()
[all …]
H A DMacroFusion.cpp39 for (const SDep &SI : SU.Preds) in getPredClusterSU()
61 for (SDep &SI : SecondSU.Preds) in fuseInstructionPair()
86 for (SDep &SI : SecondSU.Preds) in fuseInstructionPair()
112 for (const SDep &SI : SecondSU.Preds) { in fuseInstructionPair()
177 for (SDep &Dep : AnchorSU.Preds) { in scheduleAdjacentImpl()
H A DTailDuplicator.cpp102 SmallSetVector<MachineBasicBlock *, 8> Preds(MBB.pred_begin(), in VerifyPHIs() local
108 for (MachineBasicBlock *PredBB : Preds) { in VerifyPHIs()
128 if (CheckExtra && !Preds.count(PHIBB)) { in VerifyPHIs()
724 SmallVector<MachineBasicBlock *, 8> Preds(TailBB->predecessors()); in duplicateSimpleBB() local
726 for (MachineBasicBlock *PredBB : Preds) { in duplicateSimpleBB()
845 SmallSetVector<MachineBasicBlock *, 8> Preds; in tailDuplicate() local
847 Preds.insert(CandidatePtr->begin(), CandidatePtr->end()); in tailDuplicate()
849 Preds.insert(TailBB->pred_begin(), TailBB->pred_end()); in tailDuplicate()
851 for (MachineBasicBlock *PredBB : Preds) { in tailDuplicate()
1009 for (MachineBasicBlock *PredBB : Preds) { in tailDuplicate()
H A DMachinePipeliner.cpp921 for (auto &PI : I.Preds) { in updatePhiDependences()
1152 for (SDep &Pred : SU.Preds) in swapAntiDependences()
1327 for (auto &Dep : SU.Preds) { in apply()
1470 Preds.clear(); in pred_L()
1490 return !Preds.empty(); in pred_L()
1540 for (auto &PI : Cur->Preds) in computePath()
1756 for (auto &PI : SU->Preds) { in addConnectedNodes()
2418 for (auto &P : SU->Preds) in multipleIterations()
2572 for (auto &P : SU->Preds) { in orderDependence()
2683 for (auto &Dep : SU->Preds) in computeUnpipelineableNodes()
[all …]
H A DVLIWMachineScheduler.cpp311 for (const SDep &PI : SU->Preds) { in releaseTopNode()
552 for (auto &Pred : SU->Preds) { in isSingleUnscheduledPred()
672 for (const SDep &PI : SU->Preds) in SchedulingCost()
710 for (const SDep &PI : SU->Preds) { in SchedulingCost()
736 for (const auto &PI : SU->Preds) { in SchedulingCost()
844 CurrSize = (*I)->Preds.size(); in pickNodeFromQueue()
845 CandSize = Candidate.SU->Preds.size(); in pickNodeFromQueue()
/openbsd/gnu/llvm/llvm/include/llvm/CodeGen/GlobalISel/
H A DMIPatternMatch.h281 struct And<Pred, Preds...> : And<Preds...> {
283 And(Pred &&p, Preds &&... preds)
284 : And<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {
292 template <typename... Preds> struct Or {
300 struct Or<Pred, Preds...> : Or<Preds...> {
302 Or(Pred &&p, Preds &&... preds)
303 : Or<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {}
310 template <typename... Preds> And<Preds...> m_all_of(Preds &&... preds) {
311 return And<Preds...>(std::forward<Preds>(preds)...);
314 template <typename... Preds> Or<Preds...> m_any_of(Preds &&... preds) {
[all …]
/openbsd/gnu/llvm/llvm/lib/Target/PowerPC/
H A DPPCCTRLoopsVerify.cpp101 SmallVector<MachineBasicBlock *, 8> Preds; in verifyCTRBranch() local
137 if (!CheckPreds && Preds.empty()) in verifyCTRBranch()
150 append_range(Preds, MBB->predecessors()); in verifyCTRBranch()
154 MBB = Preds.pop_back_val(); in verifyCTRBranch()
159 } while (!Preds.empty()); in verifyCTRBranch()
H A 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()
/openbsd/gnu/llvm/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h129 NodeGroup Preds; variable
198 unsigned pred_size() const { return Preds.size(); } in pred_size()
200 bool pred_empty() const { return Preds.empty(); } in pred_empty()
237 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
238 pred_iterator pred_end() { return Preds.end(); } in pred_end()
239 pred_range preds() { return {Preds.begin(), Preds.end()}; } in preds()
247 const_pred_range preds() const { return {Preds.begin(), Preds.end()}; } in preds()
296 void replacePredecessor(ExplodedNode *node) { Preds.replaceNode(node); } in replacePredecessor()
/openbsd/gnu/llvm/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp855 PN.getType(), Preds.size(), "split", in createPHIsForSplitLoopExit()
857 for (BasicBlock *BB : Preds) in createPHIsForSplitLoopExit()
1016 for (auto *Pred : Preds) in UpdateAnalysisInformation()
1050 for (BasicBlock *Pred : Preds) { in UpdateAnalysisInformation()
1084 for (BasicBlock *Pred : Preds) { in UpdateAnalysisInformation()
1114 SmallPtrSet<BasicBlock *, 16> PredSet(Preds.begin(), Preds.end()); in UpdatePHINodes()
1227 for (BasicBlock *Pred : Preds) { in SplitBlockPredecessorsImpl()
1240 if (Preds.empty()) { in SplitBlockPredecessorsImpl()
1251 if (!Preds.empty()) { in SplitBlockPredecessorsImpl()
1309 for (BasicBlock *Pred : Preds) { in SplitLandingPadPredecessorsImpl()
[all …]
H A DFlattenCFG.cpp147 SmallPtrSet<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB)); in FlattenParallelAndOr() local
148 for (BasicBlock *Pred : Preds) { in FlattenParallelAndOr()
163 if (UnCondBlock || !PP || !Preds.contains(PP) || in FlattenParallelAndOr()
179 if (PP && Preds.count(PP)) { in FlattenParallelAndOr()
216 if (!Preds.contains(PS)) { in FlattenParallelAndOr()
/openbsd/gnu/llvm/llvm/lib/Target/ARM/
H A DARMInstructionSelector.cpp403 Preds.first = ARMCC::EQ; in getComparePreds()
407 Preds.first = ARMCC::GT; in getComparePreds()
411 Preds.first = ARMCC::GE; in getComparePreds()
415 Preds.first = ARMCC::HI; in getComparePreds()
418 Preds.first = ARMCC::MI; in getComparePreds()
422 Preds.first = ARMCC::LS; in getComparePreds()
425 Preds.first = ARMCC::VC; in getComparePreds()
428 Preds.first = ARMCC::VS; in getComparePreds()
431 Preds.first = ARMCC::PL; in getComparePreds()
435 Preds.first = ARMCC::LT; in getComparePreds()
[all …]
/openbsd/gnu/llvm/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp206 Preds.addNode(V, G); in addPredecessor()
470 if (N->Preds.empty()) { in trim()
476 WL1.append(N->Preds.begin(), N->Preds.end()); in trim()
504 if (N->Preds.empty()) in trim()
512 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end(); in trim()
/openbsd/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DAMDGPUExportClustering.cpp69 for (const SDep &Pred : SUb->Preds) { in buildCluster()
85 for (const SDep &Pred : SU.Preds) { in removeExportDependencies()
94 for (const SDep &ExportPred : PredSU->Preds) { in removeExportDependencies()
H A DGCNMinRegStrategy.cpp90 for (auto PDep : SDep.getSUnit()->Preds) { in getReadySuccessors()
183 for (const auto &P : S.getSUnit()->Preds) { in bumpPredsPriority()
195 for (const auto &P : SU->Preds) { in bumpPredsPriority()
H A DGCNILPSched.cpp64 for (const SDep &Pred : SU->Preds) { in CalcNodeSethiUllmanNumber()
123 for (const SDep &Pred : SU->Preds) { in calcMaxScratches()
276 for (const auto &PredEdge : SU->Preds) { in releasePredecessors()
/openbsd/gnu/llvm/llvm/lib/Target/Hexagon/
H A DHexagonSubtarget.cpp255 for (auto &D : SU.Preds) in apply()
284 for (SDep &PI : SI.getSUnit()->Preds) { in apply()
598 auto F = find(Dst->Preds, T); in restoreLatency()
599 assert(F != Dst->Preds.end()); in restoreLatency()
615 auto F = find(Dst->Preds, T); in changeLatency()
616 assert(F != Dst->Preds.end()); in changeLatency()
660 SUnit *SrcBest = getZeroLatency(Dst, Dst->Preds); in isBestZeroLatency()
702 for (auto &I : DstBest->Preds) in isBestZeroLatency()
/openbsd/gnu/llvm/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h256 SmallVector<SDep, 4> Preds; ///< All sunit predecessors. variable
432 for (const SDep &Pred : Preds) in isPred()
635 return Node->Preds[Operand].getSUnit();
649 return SUnitIterator(N, (unsigned)N->Preds.size()); in end()
663 return Node->Preds[Operand]; in getSDep()
/openbsd/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp69 for (SDep &Pred : SU->Preds) { in numberRCValPredInSU()
153 for (SDep &Pred : SU->Preds) in numberCtrlPredInSU()
211 for (const SDep &Pred : SU->Preds) { in getSingleUnscheduledPred()
497 for (SDep &Pred : SU->Preds) { in scheduledNode()
530 HorizontalVerticalBalance -= (SU->Preds.size() - numberCtrlPredInSU(SU)); in scheduledNode()
/openbsd/gnu/llvm/clang/include/clang/Analysis/
H A DCFG.h842 AdjacentBlocks Preds; variable
861 : Elements(C), Terminator(nullptr), BlockID(blockid), Preds(C, 1), in CFGBlock()
937 pred_iterator pred_begin() { return Preds.begin(); } in pred_begin()
938 pred_iterator pred_end() { return Preds.end(); } in pred_end()
939 const_pred_iterator pred_begin() const { return Preds.begin(); } in pred_begin()
940 const_pred_iterator pred_end() const { return Preds.end(); } in pred_end()
942 pred_reverse_iterator pred_rbegin() { return Preds.rbegin(); } in pred_rbegin()
943 pred_reverse_iterator pred_rend() { return Preds.rend(); } in pred_rend()
944 const_pred_reverse_iterator pred_rbegin() const { return Preds.rbegin(); } in pred_rbegin()
945 const_pred_reverse_iterator pred_rend() const { return Preds.rend(); } in pred_rend()
[all …]
/openbsd/gnu/llvm/clang/lib/Analysis/FlowSensitive/
H A DTypeErasedDataflowAnalysis.cpp215 llvm::DenseSet<const CFGBlock *> Preds; in computeBlockInputState() local
216 Preds.insert(Block.pred_begin(), Block.pred_end()); in computeBlockInputState()
244 Preds.erase(StmtBlock->getSecond()); in computeBlockInputState()
251 for (const CFGBlock *Pred : Preds) { in computeBlockInputState()

1234