HomeSort by relevance Sort by last modified time
    Searched refs:RemovePred (Results 1 - 4 of 4) sorted by null

  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGFast.cpp 91 /// RemovePred - removes a predecessor edge from SUnit SU.
93 void RemovePred(SUnit *SU, const SDep &D) {
94 SU->removePred(D);
304 RemovePred(SU, ChainPred);
310 RemovePred(SU, Pred);
317 RemovePred(SU, Pred);
324 RemovePred(SuccDep, D);
332 RemovePred(SuccDep, D);
379 RemovePred(DelDeps[i].first, DelDeps[i].second);
415 RemovePred(DelDeps[i].first, DelDeps[i].second)
    [all...]
ScheduleDAGRRList.cpp 203 /// RemovePred - removes a predecessor edge from SUnit SU.
206 void RemovePred(SUnit *SU, const SDep &D) {
207 Topo.RemovePred(SU, D.getSUnit());
208 SU->removePred(D);
    [all...]
  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 396 /// removePred - This removes the specified edge as a pred of the current
399 void removePred(const SDep &D);
718 /// RemovePred - Updates the topological ordering to accommodate an
721 void RemovePred(SUnit *M, SUnit *N);
  /external/llvm/lib/CodeGen/
ScheduleDAG.cpp 74 // Extend the latency if needed. Equivalent to removePred(I) + addPred(D).
130 /// removePred - This removes the specified edge as a pred of the current
133 void SUnit::removePred(const SDep &D) {
535 /// RemovePred - Updates the topological ordering to accommodate an
538 void ScheduleDAGTopologicalSort::RemovePred(SUnit *M, SUnit *N) {

Completed in 35 milliseconds