Home
last modified time | relevance | path

Searched refs:Dep (Results 1 – 25 of 59) sorted by relevance

123

/llvm-project-15.0.7/llvm/tools/llvm-mca/Views/
H A DBottleneckAnalysis.cpp151 const DependencyEdge::Dependency &DE = DepEdge.Dep; in dumpDependencyEdge()
241 uint64_t Cost = N.Cost + DepEdge.Dep.Cost; in propagateThroughEdges()
359 const DependencyEdge::Dependency &Dep = DE->Dep; in printCriticalSequence() local
363 if (Dep.Type == DependencyEdge::DT_REGISTER) { in printCriticalSequence()
368 } else if (Dep.Type == DependencyEdge::DT_MEMORY) { in printCriticalSequence()
404 if (DE.Dep.Type == DependencyEdge::DT_REGISTER) in dump()
410 if (DE.Dep.Type == DependencyEdge::DT_MEMORY) in dump()
416 if (DE.Dep.Type == DependencyEdge::DT_RESOURCE) in dump()
428 return DE.ToIID == To && DE.Dep.ResourceOrRegID == Dep.ResourceOrRegID; in addDependency()
432 It->Dep.Cost += Dep.Cost; in addDependency()
[all …]
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DMachinePipeliner.cpp887 I.addPred(Dep); in updatePhiDependences()
973 LastSU->addPred(Dep); in changeDependences()
1208 Dep.setLatency(Lat); in swapAntiDependences()
2274 if ((Dep.getKind() != SDep::Order && Dep.getKind() != SDep::Output) || in isLoopCarriedDep()
2275 Dep.isArtificial() || Dep.getSUnit()->isBoundaryNode()) in isLoopCarriedDep()
2414 Worklist.push_back(Dep); in earliestCycleInChain()
2437 Worklist.push_back(Dep); in latestCycleInChain()
2487 DAG->getDistance(Dep.getSUnit(), SU, Dep) * II; in computeStart()
2495 DAG->getDistance(SU, Dep.getSUnit(), Dep) * II; in computeStart()
2511 DAG->getDistance(SU, Dep.getSUnit(), Dep) * II; in computeStart()
[all …]
H A DMacroFusion.cpp34 static bool isHazard(const SDep &Dep) { in isHazard() argument
35 return Dep.getKind() == SDep::Anti || Dep.getKind() == SDep::Output; in isHazard()
177 for (SDep &Dep : AnchorSU.Preds) { in scheduleAdjacentImpl()
179 if (Dep.isWeak() || isHazard(Dep)) in scheduleAdjacentImpl()
182 SUnit &DepSU = *Dep.getSUnit(); in scheduleAdjacentImpl()
H A DScheduleDAGInstrs.cpp252 SDep Dep; in addPhysRegDataDeps() local
271 Dep.setLatency(0); in addPhysRegDataDeps()
274 UseSU->addPred(Dep); in addPhysRegDataDeps()
311 Dep.setLatency( in addPhysRegDeps()
314 DefSU->addPred(Dep); in addPhysRegDeps()
440 UseSU->addPred(Dep); in addVRegDefDeps()
480 Dep.setLatency( in addVRegDefDeps()
482 DefSU->addPred(Dep); in addVRegDefDeps()
542 Dep.setLatency(Latency); in addChainDependency()
543 SUb->addPred(Dep); in addChainDependency()
[all …]
H A DMachineTraceMetrics.cpp793 for (const DataDep &Dep : Deps) { in updateDepth() local
795 BlockInfo[Dep.DefMI->getParent()->getNumber()]; in updateDepth()
802 if (!Dep.DefMI->isTransient()) in updateDepth()
804 .computeOperandLatency(Dep.DefMI, Dep.DefOp, &UseMI, Dep.UseOp); in updateDepth()
958 if (!Dep.DefMI->isTransient()) in pushDepHeight()
959 UseHeight += SchedModel.computeOperandLatency(Dep.DefMI, Dep.DefOp, &UseMI, in pushDepHeight()
1116 for (const DataDep &Dep : Deps) in computeInstrHeights() local
1118 addLiveIns(Dep.DefMI, Dep.DefOp, Stack); in computeInstrHeights()
1186 DataDep &Dep = Deps.front(); in getPHIDepth() local
1189 if (!Dep.DefMI->isTransient()) in getPHIDepth()
[all …]
H A DScheduleDAG.cpp368 for (const SDep &Dep : SU.Preds) { in dumpNodeAll() local
370 dumpNodeName(*Dep.getSUnit()); in dumpNodeAll()
372 Dep.dump(TRI); in dumpNodeAll()
378 for (const SDep &Dep : SU.Succs) { in dumpNodeAll() local
380 dumpNodeName(*Dep.getSUnit()); in dumpNodeAll()
382 Dep.dump(TRI); in dumpNodeAll()
H A DImplicitNullChecks.cpp258 Optional<ArrayRef<MachineInstr *>::iterator> Dep; in computeDependence() local
264 if (Dep == None) { in computeDependence()
266 Dep = I; in computeDependence()
273 return {true, Dep}; in computeDependence()
/llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/modernize/
H A Dloop-convert-extra.cpp242 dependent<int> Dep, Other; in refs_and_vals() local
243 for (dependent<int>::iterator It = Dep.begin(), E = Dep.end(); It != E; ++It) { in refs_and_vals()
983 dependent<int> Dep; in iterators() local
985 for (dependent<int>::iterator I = Dep.begin(), E = Dep.end(); I != E; ++I) in iterators()
991 for (dependent<int>::iterator I = Dep.begin(), E = Dep.end(); I != E; ++I) in iterators()
997 for (dependent<int>::const_iterator I = Dep.begin(), E = Dep.end(); in iterators()
1004 for (dependent<int>::const_iterator I = Dep.begin(), E = Dep.end(); in iterators()
1011 for (dependent<int>::const_iterator I = Dep.begin(), E = Dep.end(); in iterators()
1026 dependent<int> Dep; in captureByValue() local
1035 for (unsigned I = 0; I < Dep.size(); ++I) { in captureByValue()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h80 PointerIntPair<SUnit *, 2, Kind> Dep;
101 SDep() : Dep(nullptr, Data) {} in SDep()
105 : Dep(S, kind), Contents() { in SDep()
124 : Dep(S, Order), Contents(), Latency(0) { in SDep()
385 SDep Dep(SU, SDep::Barrier); in addPredBarrier()
388 Dep.setLatency(TrueMemOrderLatency); in addPredBarrier()
389 return addPred(Dep); in addPredBarrier()
466 if (Dep != Other.Dep) in overlaps()
468 switch (Dep.getInt()) { in overlaps()
483 inline void SDep::setSUnit(SUnit *SU) { Dep.setPointer(SU); } in setSUnit()
[all …]
H A DMachinePipeliner.h249 bool isBackedge(SUnit *Source, const SDep &Dep) { in isBackedge() argument
250 if (Dep.getKind() != SDep::Anti) in isBackedge()
252 return Source->getInstr()->isPHI() || Dep.getSUnit()->getInstr()->isPHI(); in isBackedge()
255 bool isLoopCarriedDep(SUnit *Source, const SDep &Dep, bool isSucc = true);
259 unsigned getDistance(SUnit *U, SUnit *V, const SDep &Dep) { in getDistance() argument
262 if (V->getInstr()->isPHI() && Dep.getKind() == SDep::Anti) in getDistance()
550 int earliestCycleInChain(const SDep &Dep);
554 int latestCycleInChain(const SDep &Dep);
/llvm-project-15.0.7/llvm/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp98 for (auto &Dep : enumerate(MatchDag.predicate_edges())) { in GIMatchTreeBuilderLeafInfo() local
99 PredicateDepIDs.insert(std::make_pair(Dep.value(), Dep.index())); in GIMatchTreeBuilderLeafInfo()
103 for (auto &Dep : enumerate(MatchDag.predicate_edges())) { in GIMatchTreeBuilderLeafInfo() local
105 UnsatisfiedPredDepsForPred[ID].set(Dep.index()); in GIMatchTreeBuilderLeafInfo()
137 for (auto &Dep : enumerate(MatchDag.predicate_edges())) { in declareInstr() local
138 if (Dep.value()->getRequiredMI() == Instr && in declareInstr()
139 Dep.value()->getRequiredMO() == nullptr) { in declareInstr()
141 DepsFor.value().reset(Dep.index()); in declareInstr()
172 if (Dep.value()->getRequiredMI() == Instr && Dep.value()->getRequiredMO() && in declareOperand()
173 Dep.value()->getRequiredMO()->getIdx() == OpIdx) { in declareOperand()
[all …]
/llvm-project-15.0.7/polly/lib/Transform/
H A DDeadCodeElimination.cpp115 isl::union_map Dep = in runDeadCodeElimination() local
117 Dep = Dep.reverse(); in runDeadCodeElimination()
127 isl::union_set Extra = Live.apply(Dep); in runDeadCodeElimination()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DMemoryDependenceAnalysis.cpp796 MemDepResult Dep; in getNonLocalCallDependency() local
803 Dep = MemDepResult::getNonLocal(); in getNonLocalCallDependency()
811 ExistingResult->setResult(Dep); in getNonLocalCallDependency()
817 if (!Dep.isNonLocal()) { in getNonLocalCallDependency()
954 return Dep; in getNonLocalInfoForBlock()
959 ExistingResult->setResult(Dep); in getNonLocalInfoForBlock()
966 if (!Dep.isDef() && !Dep.isClobber()) in getNonLocalInfoForBlock()
967 return Dep; in getNonLocalInfoForBlock()
971 Instruction *Inst = Dep.getInst(); in getNonLocalInfoForBlock()
975 return Dep; in getNonLocalInfoForBlock()
[all …]
H A DMemDepPrinter.cpp38 typedef std::pair<InstTypePair, const BasicBlock *> Dep; typedef
39 typedef SmallSetVector<Dep, 4> DepSet;
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DAMDGPUSubtarget.cpp799 int UseOpIdx, SDep &Dep) const { in adjustSchedDependency()
800 if (Dep.getKind() != SDep::Kind::Data || !Dep.getReg() || in adjustSchedDependency()
809 auto Reg = Dep.getReg(); in adjustSchedDependency()
819 Dep.setLatency(Lat); in adjustSchedDependency()
822 auto Reg = Dep.getReg(); in adjustSchedDependency()
831 Dep.setLatency(Lat); in adjustSchedDependency()
832 } else if (Dep.getLatency() == 0 && Dep.getReg() == AMDGPU::VCC_LO) { in adjustSchedDependency()
837 Dep.setLatency(InstrInfo.getSchedModel().computeOperandLatency( in adjustSchedDependency()
H A DR600Packetizer.cpp190 const SDep &Dep = SUJ->Succs[i]; in isLegalToPacketizeTogether() local
191 if (Dep.getSUnit() != SUI) in isLegalToPacketizeTogether()
193 if (Dep.getKind() == SDep::Anti) in isLegalToPacketizeTogether()
195 if (Dep.getKind() == SDep::Output) in isLegalToPacketizeTogether()
/llvm-project-15.0.7/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp186 for (const edge_ty &Dep : Dependencies) { in DAGDeltaAlgorithmImpl() local
187 Predecessors[Dep.second].push_back(Dep.first); in DAGDeltaAlgorithmImpl()
188 Successors[Dep.first].push_back(Dep.second); in DAGDeltaAlgorithmImpl()
/llvm-project-15.0.7/clang/lib/Basic/
H A DOpenCLOptions.cpp129 auto Dep = FeaturePair.second; in diagnoseUnsupportedFeatureDependencies() local
131 !TI.hasFeatureEnabled(OpenCLFeaturesMap, Dep)) { in diagnoseUnsupportedFeatureDependencies()
133 Diags.Report(diag::err_opencl_feature_requires) << Feature << Dep; in diagnoseUnsupportedFeatureDependencies()
/llvm-project-15.0.7/llvm/lib/Target/Hexagon/
H A DHexagonSubtarget.cpp454 SDep &Dep) const { in adjustSchedDependency()
467 Dep.setLatency(0); in adjustSchedDependency()
474 Dep.setLatency(0); in adjustSchedDependency()
512 Dep.setLatency((unsigned)DLatency); in adjustSchedDependency()
520 Dep.setLatency(0); in adjustSchedDependency()
523 int Latency = Dep.getLatency(); in adjustSchedDependency()
524 bool IsArtificial = Dep.isArtificial(); in adjustSchedDependency()
526 Dep.setLatency(Latency); in adjustSchedDependency()
H A DHexagonVLIWPacketizer.cpp936 auto &Dep = PacketSU->Succs[i]; in restrictingDepExistInPacket() local
937 if (Dep.getSUnit() == PacketSUDep && Dep.getKind() == SDep::Anti && in restrictingDepExistInPacket()
938 Dep.getReg() == DepReg) in restrictingDepExistInPacket()
1000 auto Dep = PacketSU->Succs[i]; in arePredicatesComplements() local
1005 if (Dep.getSUnit() == SU && Dep.getKind() == SDep::Data && in arePredicatesComplements()
1006 Hexagon::PredRegsRegClass.contains(Dep.getReg())) { in arePredicatesComplements()
1012 if (restrictingDepExistInPacket(*I, Dep.getReg())) in arePredicatesComplements()
/llvm-project-15.0.7/clang/test/PCH/
H A Dcxx-templates.cpp42 Dep<A>::Ty ty; in test()
43 Dep<A> a; in test()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DLoopLoadElimination.cpp187 for (const auto &Dep : *Deps) { in findStoreToLoadDependences()
188 Instruction *Source = Dep.getSource(LAI); in findStoreToLoadDependences()
189 Instruction *Destination = Dep.getDestination(LAI); in findStoreToLoadDependences()
191 if (Dep.Type == MemoryDepChecker::Dependence::Unknown) { in findStoreToLoadDependences()
199 if (Dep.isBackward()) in findStoreToLoadDependences()
205 assert(Dep.isForward() && "Needs to be a forward dependence"); in findStoreToLoadDependences()
H A DLoopDistribute.cpp638 for (auto &Dep : Dependences) in MemoryInstructionDependences() local
639 if (Dep.isPossiblyBackward()) { in MemoryInstructionDependences()
643 ++Accesses[Dep.Source].NumUnsafeDependencesStartOrEnd; in MemoryInstructionDependences()
644 --Accesses[Dep.Destination].NumUnsafeDependencesStartOrEnd; in MemoryInstructionDependences()
646 LLVM_DEBUG(Dep.print(dbgs(), 2, Instructions)); in MemoryInstructionDependences()
/llvm-project-15.0.7/llvm/lib/TableGen/
H A DMain.cpp80 for (const auto &Dep : Parser.getDependencies()) { in createDependencyFile() local
81 DepOut.os() << ' ' << Dep; in createDependencyFile()
/llvm-project-15.0.7/clang/lib/Tooling/DependencyScanning/
H A DDependencyScanningTool.cpp92 for (const auto &Dep : Dependencies) in getDependencyFile() local
93 addDependency(Dep); in getDependencyFile()

123