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 92 /// RemovePred - removes a predecessor edge from SUnit SU.
94 void RemovePred(SUnit *SU, const SDep &D) {
95 SU->removePred(D);
305 RemovePred(SU, ChainPred);
311 RemovePred(SU, Pred);
318 RemovePred(SU, Pred);
325 RemovePred(SuccDep, D);
333 RemovePred(SuccDep, D);
380 RemovePred(DelDeps[i].first, DelDeps[i].second);
416 RemovePred(DelDeps[i].first, DelDeps[i].second)
    [all...]
ScheduleDAGRRList.cpp 205 /// RemovePred - removes a predecessor edge from SUnit SU.
208 void RemovePred(SUnit *SU, const SDep &D) {
209 Topo.RemovePred(SU, D.getSUnit());
210 SU->removePred(D);
    [all...]
  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 410 /// removePred - This removes the specified edge as a pred of the current
413 void removePred(const SDep &D);
732 /// RemovePred - Updates the topological ordering to accommodate an
735 void RemovePred(SUnit *M, SUnit *N);
  /external/llvm/lib/CodeGen/
ScheduleDAG.cpp 75 // Extend the latency if needed. Equivalent to removePred(I) + addPred(D).
131 /// removePred - This removes the specified edge as a pred of the current
134 void SUnit::removePred(const SDep &D) {
536 /// RemovePred - Updates the topological ordering to accommodate an
539 void ScheduleDAGTopologicalSort::RemovePred(SUnit *M, SUnit *N) {

Completed in 105 milliseconds