/openbsd-current/gnu/llvm/llvm/tools/llvm-mca/Views/ |
H A D | BottleneckAnalysis.cpp | 151 const DependencyEdge::Dependency &DE = DepEdge.Dep; 241 uint64_t Cost = N.Cost + DepEdge.Dep.Cost; 359 const DependencyEdge::Dependency &Dep = DE->Dep; 363 if (Dep.Type == DependencyEdge::DT_REGISTER) { 367 getInstPrinter().printRegName(FOS, Dep.ResourceOrRegID); 368 } else if (Dep.Type == DependencyEdge::DT_MEMORY) { 371 assert(Dep.Type == DependencyEdge::DT_RESOURCE && 376 FOS << Tracker.resolveResourceName(Dep.ResourceOrRegID); 404 if (DE.Dep [all...] |
/openbsd-current/gnu/llvm/llvm/lib/CodeGen/ |
H A D | MacroFusion.cpp | 34 static bool isHazard(const SDep &Dep) { argument 35 return Dep.getKind() == SDep::Anti || Dep.getKind() == SDep::Output; 177 for (SDep &Dep : AnchorSU.Preds) { 179 if (Dep.isWeak() || isHazard(Dep)) 182 SUnit &DepSU = *Dep.getSUnit();
|
H A D | MachinePipeliner.cpp | 806 SDep Dep(Load, SDep::Barrier); 807 Dep.setLatency(1); 808 SU.addPred(Dep); 816 SDep Dep(Load, SDep::Barrier); 817 Dep.setLatency(1); 818 SU.addPred(Dep); 824 SDep Dep(Load, SDep::Barrier); 825 Dep.setLatency(1); 826 SU.addPred(Dep); 831 SDep Dep(Loa 1184 auto Dep = OutputDeps.find(BackEdge); local 2235 isLoopCarriedDep(SUnit *Source, const SDep &Dep, bool isSucc) argument 2369 earliestCycleInChain(const SDep &Dep) argument 2392 latestCycleInChain(const SDep &Dep) argument 2441 const SDep &Dep = SU->Preds[i]; local 2466 const SDep &Dep = SU->Succs[i]; local [all...] |
H A D | ScheduleDAGInstrs.cpp | 258 SDep Dep; local 260 Dep = SDep(SU, SDep::Artificial); 265 Dep = SDep(SU, SDep::Data, *Alias); 274 Dep.setLatency(SchedModel.computeOperandLatency(SU->getInstr(), OperIdx, 277 Dep.setLatency(0); 279 ST.adjustSchedDependency(SU, OperIdx, UseSU, UseOp, Dep); 280 UseSU->addPred(Dep); 315 SDep Dep(SU, Kind, /*Reg=*/*Alias); 317 Dep.setLatency( 319 ST.adjustSchedDependency(SU, OperIdx, DefSU, I->OpIdx, Dep); [all...] |
H A D | MachineTraceMetrics.cpp | 792 for (const DataDep &Dep : Deps) { 794 BlockInfo[Dep.DefMI->getParent()->getNumber()]; 799 unsigned DepCycle = Cycles.lookup(Dep.DefMI).Depth; 801 if (!Dep.DefMI->isTransient()) 803 .computeOperandLatency(Dep.DefMI, Dep.DefOp, &UseMI, Dep.UseOp); 952 static bool pushDepHeight(const DataDep &Dep, const MachineInstr &UseMI, 956 // Adjust height by Dep.DefMI latency. 957 if (!Dep [all...] |
H A D | ScheduleDAG.cpp | 368 for (const SDep &Dep : SU.Preds) { 370 dumpNodeName(*Dep.getSUnit()); 372 Dep.dump(TRI); 378 for (const SDep &Dep : SU.Succs) { 380 dumpNodeName(*Dep.getSUnit()); 382 Dep.dump(TRI);
|
H A D | ImplicitNullChecks.cpp | 256 std::optional<ArrayRef<MachineInstr *>::iterator> Dep; local 262 if (Dep == std::nullopt) { 264 Dep = I; 271 return {true, Dep};
|
/openbsd-current/gnu/llvm/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAG.h | 80 PointerIntPair<SUnit *, 2, Kind> Dep; member in class:llvm::SDep 101 SDep() : Dep(nullptr, Data) {} 105 : Dep(S, kind), Contents() { 124 : Dep(S, Order), Contents(), Latency(0) { 385 SDep Dep(SU, SDep::Barrier); 388 Dep.setLatency(TrueMemOrderLatency); 389 return addPred(Dep); 466 if (Dep != Other.Dep) 468 switch (Dep [all...] |
H A D | MachinePipeliner.h | 251 bool isBackedge(SUnit *Source, const SDep &Dep) { argument 252 if (Dep.getKind() != SDep::Anti) 254 return Source->getInstr()->isPHI() || Dep.getSUnit()->getInstr()->isPHI(); 257 bool isLoopCarriedDep(SUnit *Source, const SDep &Dep, bool isSucc = true); 261 unsigned getDistance(SUnit *U, SUnit *V, const SDep &Dep) { argument 264 if (V->getInstr()->isPHI() && Dep.getKind() == SDep::Anti) 590 int earliestCycleInChain(const SDep &Dep); 594 int latestCycleInChain(const SDep &Dep);
|
H A D | TargetSubtargetInfo.h | 237 int UseOpIdx, SDep &Dep) const {}
|
/openbsd-current/gnu/llvm/clang/lib/Basic/ |
H A D | OpenCLOptions.cpp | 129 auto Dep = FeaturePair.second; local 131 !TI.hasFeatureEnabled(OpenCLFeaturesMap, Dep)) { 133 Diags.Report(diag::err_opencl_feature_requires) << Feature << Dep; local
|
/openbsd-current/gnu/llvm/llvm/lib/Support/ |
H A D | DAGDeltaAlgorithm.cpp | 186 for (const edge_ty &Dep : Dependencies) { 187 Predecessors[Dep.second].push_back(Dep.first); 188 Successors[Dep.first].push_back(Dep.second);
|
/openbsd-current/gnu/llvm/llvm/utils/TableGen/GlobalISel/ |
H A D | GIMatchTree.cpp | 98 for (auto &Dep : enumerate(MatchDag.predicate_edges())) { 99 PredicateDepIDs.insert(std::make_pair(Dep.value(), Dep.index())); 103 for (auto &Dep : enumerate(MatchDag.predicate_edges())) { 104 unsigned ID = PredicateIDs.lookup(Dep.value()->getPredicate()); 105 UnsatisfiedPredDepsForPred[ID].set(Dep.index()); 137 for (auto &Dep : enumerate(MatchDag.predicate_edges())) { 138 if (Dep.value()->getRequiredMI() == Instr && 139 Dep.value()->getRequiredMO() == nullptr) { 141 DepsFor.value().reset(Dep [all...] |
/openbsd-current/gnu/llvm/llvm/lib/Analysis/ |
H A D | MemoryDependenceAnalysis.cpp | 800 MemDepResult Dep; local 803 Dep = getCallDependencyFrom(QueryCall, isReadonlyCall, ScanPos, DirtyBB); 807 Dep = MemDepResult::getNonLocal(); 809 Dep = MemDepResult::getNonFuncLocal(); 815 ExistingResult->setResult(Dep); 817 Cache.push_back(NonLocalDepEntry(DirtyBB, Dep)); 821 if (!Dep.isNonLocal()) { 824 if (Instruction *Inst = Dep.getInst()) 953 MemDepResult Dep = getPointerDependencyFrom(Loc, isLoad, ScanPos, BB, local 958 return Dep; 1225 MemDepResult Dep = getNonLocalInfoForBlock( local [all...] |
H A D | MemDepPrinter.cpp | 38 typedef std::pair<InstTypePair, const BasicBlock *> Dep; typedef in struct:__anon1977::MemDepPrinter 39 typedef SmallSetVector<Dep, 4> DepSet;
|
/openbsd-current/gnu/llvm/llvm/lib/TableGen/ |
H A D | Main.cpp | 80 for (const auto &Dep : Parser.getDependencies()) { 81 DepOut.os() << ' ' << Dep;
|
/openbsd-current/gnu/llvm/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUSubtarget.cpp | 819 int UseOpIdx, SDep &Dep) const { 820 if (Dep.getKind() != SDep::Kind::Data || !Dep.getReg() || 829 auto Reg = Dep.getReg(); 839 Dep.setLatency(Lat); 842 auto Reg = Dep.getReg(); 851 Dep.setLatency(Lat); 852 } else if (Dep.getLatency() == 0 && Dep.getReg() == AMDGPU::VCC_LO) { 857 Dep [all...] |
H A D | R600Packetizer.cpp | 190 const SDep &Dep = SUJ->Succs[i]; variable 191 if (Dep.getSUnit() != SUI) 193 if (Dep.getKind() == SDep::Anti) 195 if (Dep.getKind() == SDep::Output)
|
/openbsd-current/gnu/llvm/llvm/lib/Transforms/Scalar/ |
H A D | LoopLoadElimination.cpp | 188 for (const auto &Dep : *Deps) { 189 Instruction *Source = Dep.getSource(LAI); 190 Instruction *Destination = Dep.getDestination(LAI); 192 if (Dep.Type == MemoryDepChecker::Dependence::Unknown) { 200 if (Dep.isBackward()) 206 assert(Dep.isForward() && "Needs to be a forward dependence");
|
/openbsd-current/gnu/llvm/llvm/lib/Target/Hexagon/ |
H A D | HexagonSubtarget.cpp | 441 SDep &Dep) const { 454 Dep.setLatency(0); 461 Dep.setLatency(0); 499 Dep.setLatency((unsigned)DLatency); 507 Dep.setLatency(0); 510 int Latency = Dep.getLatency(); 511 bool IsArtificial = Dep.isArtificial(); 513 Dep.setLatency(Latency);
|
H A D | HexagonVLIWPacketizer.cpp | 936 auto &Dep = PacketSU->Succs[i]; local 937 if (Dep.getSUnit() == PacketSUDep && Dep.getKind() == SDep::Anti && 938 Dep.getReg() == DepReg) 1000 auto Dep = PacketSU->Succs[i]; local 1005 if (Dep.getSUnit() == SU && Dep.getKind() == SDep::Data && 1006 Hexagon::PredRegsRegClass.contains(Dep.getReg())) { 1012 if (restrictingDepExistInPacket(*I, Dep.getReg()))
|
/openbsd-current/gnu/llvm/clang/lib/AST/ |
H A D | TemplateName.cpp | 116 TemplateName::TemplateName(DependentTemplateName *Dep) : Storage(Dep) {} argument
|
/openbsd-current/gnu/llvm/clang/lib/Driver/ |
H A D | XRayArgs.cpp | 260 for (const auto &Dep : ExtraDeps) { 262 ExtraDepOpt += Dep;
|
/openbsd-current/gnu/llvm/clang/lib/Tooling/DependencyScanning/ |
H A D | DependencyScanningTool.cpp | 83 for (const auto &Dep : Dependencies) 84 addDependency(Dep);
|
/openbsd-current/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGSDNodes.cpp | 510 SDep Dep = isChain ? SDep(OpSU, SDep::Barrier) 512 Dep.setLatency(OpLatency); 514 computeOperandLatency(OpN, N, i, Dep); 515 ST.adjustSchedDependency(OpSU, DefIdx, &SU, i, Dep); 518 if (!SU.addPred(Dep) && !Dep.isCtrl() && OpSU->NumRegDefsLeft > 1) {
|