Searched refs:PredDep (Results 1 – 3 of 3) sorted by relevance
| /external/llvm/lib/CodeGen/ |
| D | ScheduleDAGInstrs.cpp | 1330 void visitPostorderEdge(const SDep &PredDep, const SUnit *Succ) { in visitPostorderEdge() argument
1332 += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount; in visitPostorderEdge()
1333 joinPredSubtree(PredDep, Succ); in visitPostorderEdge()
1337 void visitCrossEdge(const SDep &PredDep, const SUnit *Succ) { in visitCrossEdge() argument
1338 ConnectionPairs.push_back(std::make_pair(PredDep.getSUnit(), Succ)); in visitCrossEdge()
1383 bool joinPredSubtree(const SDep &PredDep, const SUnit *Succ, in joinPredSubtree() argument
1385 assert(PredDep.getKind() == SDep::Data && "Subtrees are for data edges"); in joinPredSubtree()
1388 const SUnit *PredSU = PredDep.getSUnit(); in joinPredSubtree()
1487 const SDep &PredDep = *DFS.getPred(); in compute() local
1490 if (PredDep.getKind() != SDep::Data in compute()
[all …]
|
| D | MachineScheduler.cpp | 522 bool ScheduleDAGMI::addEdge(SUnit *SuccSU, const SDep &PredDep) { in addEdge() argument
526 if (Topo.IsReachable(PredDep.getSUnit(), SuccSU)) in addEdge()
528 Topo.AddPred(SuccSU, PredDep.getSUnit()); in addEdge()
530 SuccSU->addPred(PredDep, /*Required=*/!PredDep.isArtificial()); in addEdge()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineScheduler.h | 285 bool addEdge(SUnit *SuccSU, const SDep &PredDep);
|