/freebsd-10.0-release/contrib/llvm/include/llvm/Target/ |
H A D | TargetSubtargetInfo.h | 24 class SDep; 76 SDep& dep) const { }
|
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/ |
H A D | ScheduleDAGInstrs.cpp | 261 SDep Dep; 263 Dep = SDep(SU, SDep::Artificial); 268 Dep = SDep(SU, SDep::Data, *Alias); 297 SDep::Kind Kind = MO.isUse() ? SDep::Anti : SDep::Output; 307 (Kind != SDep::Output || !MO.isDead() || 309 if (Kind == SDep [all...] |
H A D | ScheduleDAG.cpp | 65 bool SUnit::addPred(const SDep &D, bool Required) { 67 for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end(); 78 SDep ForwardD = *I; 80 for (SmallVector<SDep, 4>::iterator II = PredSU->Succs.begin(), 93 SDep P = D; 97 if (D.getKind() == SDep::Data) { 133 void SUnit::removePred(const SDep &D) { 135 for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end(); 139 SDep P = D; 142 SmallVectorImpl<SDep> [all...] |
H A D | AggressiveAntiDepBreaker.cpp | 259 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep*>& Edges) { 263 if ((P->getKind() == SDep::Anti) || (P->getKind() == SDep::Output)) { 276 const SDep *Next = 0; 288 (NextDepth == PredTotalLatency && P->getKind() == SDep::Anti)) { 775 std::vector<const SDep *> Edges; 794 const SDep *Edge = Edges[i]; 797 if ((Edge->getKind() != SDep::Anti) && 798 (Edge->getKind() != SDep::Output)) continue; 841 (P->getKind() != SDep [all...] |
H A D | CriticalAntiDepBreaker.cpp | 126 static const SDep *CriticalPathStep(const SUnit *SU) { 127 const SDep *Next = 0; 138 (NextDepth == PredTotalLatency && P->getKind() == SDep::Anti)) { 517 if (const SDep *Edge = CriticalPathStep(CriticalPathSU)) { 521 if (Edge->getKind() == SDep::Anti) { 543 (P->getKind() != SDep::Anti || P->getReg() != AntiDepReg) : 544 (P->getKind() == SDep::Data && P->getReg() == AntiDepReg)) {
|
H A D | MachineScheduler.cpp | 334 bool ScheduleDAGMI::addEdge(SUnit *SuccSU, const SDep &PredDep) { 351 void ScheduleDAGMI::releaseSucc(SUnit *SU, SDep *SuccEdge) { 385 void ScheduleDAGMI::releasePred(SUnit *SU, SDep *PredEdge) { 827 && DAG->addEdge(SUb, SDep(SUa, SDep::Cluster))) { 840 DAG->addEdge(SI->getSUnit(), SDep(SUb, SDep::Artificial)); 916 bool Success = DAG->addEdge(&DAG->ExitSU, SDep(SU, SDep::Cluster)); 1044 if (I->getKind() != SDep [all...] |
H A D | PostRASchedulerList.cpp | 174 void ReleaseSucc(SUnit *SU, SDep *SuccEdge); 565 void SchedulePostRATDList::ReleaseSucc(SUnit *SU, SDep *SuccEdge) {
|
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGFast.cpp | 87 void AddPred(SUnit *SU, const SDep &D) { 93 void RemovePred(SUnit *SU, const SDep &D) { 98 void ReleasePred(SUnit *SU, SDep *PredEdge); 139 void ScheduleDAGFast::ReleasePred(SUnit *SU, SDep *PredEdge) { 280 SDep ChainPred; 281 SmallVector<SDep, 4> ChainSuccs; 282 SmallVector<SDep, 4> LoadPreds; 283 SmallVector<SDep, 4> NodePreds; 284 SmallVector<SDep, 4> NodeSuccs; 309 const SDep [all...] |
H A D | ScheduleDAGVLIW.cpp | 86 void releaseSucc(SUnit *SU, const SDep &D); 115 void ScheduleDAGVLIW::releaseSucc(SUnit *SU, const SDep &D) {
|
H A D | ScheduleDAGRRList.cpp | 198 void AddPred(SUnit *SU, const SDep &D) { 206 void RemovePred(SUnit *SU, const SDep &D) { 217 void ReleasePred(SUnit *SU, const SDep *PredEdge); 224 void CapturePred(SDep *PredEdge); 364 void ScheduleDAGRRList::ReleasePred(SUnit *SU, const SDep *PredEdge) { 790 void ScheduleDAGRRList::CapturePred(SDep *PredEdge) { 1016 SmallVector<SDep, 4> ChainPreds; 1017 SmallVector<SDep, 4> ChainSuccs; 1018 SmallVector<SDep, 4> LoadPreds; 1019 SmallVector<SDep, [all...] |
H A D | ScheduleDAGSDNodes.h | 32 /// SDNode-based scheduling graphs do not use SDep::Anti or SDep::Output 103 unsigned OpIdx, SDep& dep) const;
|
H A D | ScheduleDAGSDNodes.cpp | 488 SDep Dep = isChain ? SDep(OpSU, SDep::Barrier) 489 : SDep(OpSU, SDep::Data, PhysReg); 620 unsigned OpIdx, SDep& dep) const{ 625 if (dep.getKind() != SDep::Data)
|
/freebsd-10.0-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAG.h | 43 /// SDep - Scheduling dependency. This represents one direction of an 45 class SDep { class in namespace:llvm 100 /// SDep - Construct a null SDep. This is only for use by container 102 /// have null SDep edges. 103 SDep() : Dep(0, Data) {} function in class:llvm::SDep 105 /// SDep - Construct an SDep with the specified values. 106 SDep(SUnit *S, Kind kind, unsigned Reg) function in class:llvm::SDep 114 "SDep 125 SDep(SUnit *S, OrderKind kind) function in class:llvm::SDep [all...] |
H A D | MachineScheduler.h | 286 bool addEdge(SUnit *SuccSU, const SDep &PredDep); 378 void releaseSucc(SUnit *SU, SDep *SuccEdge); 380 void releasePred(SUnit *SU, SDep *PredEdge);
|
/freebsd-10.0-release/contrib/llvm/lib/Target/Hexagon/ |
H A D | HexagonVLIWPacketizer.cpp | 144 bool IsCallDependent(MachineInstr* MI, SDep::Kind DepType, unsigned DepReg); 145 bool PromoteToDotNew(MachineInstr* MI, SDep::Kind DepType, 323 SDep::Kind DepType, 355 if (IsIndirectCall(MI) && (DepType == SDep::Data)) { 365 static bool IsRegDependence(const SDep::Kind DepType) { 366 return (DepType == SDep::Data || DepType == SDep::Anti || 367 DepType == SDep::Output); 1289 SDep::Kind DepType, MachineBasicBlock::iterator &MII, 1292 assert (DepType == SDep [all...] |
H A D | HexagonMachineScheduler.cpp | 34 SUnits[su].addPred(SDep(LastSequentialCall, SDep::Barrier));
|
/freebsd-10.0-release/contrib/llvm/lib/Target/R600/ |
H A D | R600Packetizer.cpp | 186 const SDep &Dep = SUJ->Succs[i]; 189 if (Dep.getKind() == SDep::Anti) 191 if (Dep.getKind() == SDep::Output)
|