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 86 /// RemovePred - removes a predecessor edge from SUnit SU.
88 void RemovePred(SUnit *SU, const SDep &D) {
89 SU->removePred(D);
299 RemovePred(SU, ChainPred);
305 RemovePred(SU, Pred);
312 RemovePred(SU, Pred);
319 RemovePred(SuccDep, D);
327 RemovePred(SuccDep, D);
372 RemovePred(DelDeps[i].first, DelDeps[i].second);
408 RemovePred(DelDeps[i].first, DelDeps[i].second)
    [all...]
ScheduleDAGRRList.cpp 196 /// RemovePred - removes a predecessor edge from SUnit SU.
199 void RemovePred(SUnit *SU, const SDep &D) {
200 Topo.RemovePred(SU, D.getSUnit());
201 SU->removePred(D);
    [all...]
  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 379 /// removePred - This removes the specified edge as a pred of the current
382 void removePred(const SDep &D);
707 /// RemovePred - Updates the topological ordering to accommodate an
710 void RemovePred(SUnit *M, SUnit *N);
  /external/llvm/lib/CodeGen/
ScheduleDAG.cpp 70 // Extend the latency if needed. Equivalent to removePred(I) + addPred(D).
116 /// removePred - This removes the specified edge as a pred of the current
119 void SUnit::removePred(const SDep &D) {
495 /// RemovePred - Updates the topological ordering to accommodate an
498 void ScheduleDAGTopologicalSort::RemovePred(SUnit *M, SUnit *N) {

Completed in 6512 milliseconds