Searched refs:AddPred (Results 1 - 5 of 5) sorted by relevance
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGFast.cpp | 86 /// AddPred - adds a predecessor edge to SUnit SU. 88 void AddPred(SUnit *SU, const SDep &D) { function in class:__anon25807::ScheduleDAGFast 307 AddPred(LoadSU, ChainPred); 313 AddPred(LoadSU, Pred); 319 AddPred(NewSU, Pred); 327 AddPred(SuccDep, D); 336 AddPred(SuccDep, D); 342 AddPred(NewSU, D); 361 AddPred(NewSU, *I); 374 AddPred(SuccS [all...] |
H A D | ScheduleDAGRRList.cpp | 197 /// AddPred - adds a predecessor edge to SUnit SU. 200 void AddPred(SUnit *SU, const SDep &D) { function in class:__anon25810::ScheduleDAGRRList 201 Topo.AddPred(SU, D.getSUnit()); 1045 AddPred(LoadSU, Pred); 1051 AddPred(LoadSU, Pred); 1056 AddPred(NewSU, Pred); 1064 AddPred(SuccDep, D); 1077 AddPred(SuccDep, D); 1085 AddPred(NewSU, D); 1107 AddPred(NewS [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAG.h | 728 /// AddPred - Updates the topological ordering to accommodate an edge 730 void AddPred(SUnit *Y, SUnit *X);
|
/external/llvm/lib/CodeGen/ |
H A D | ScheduleDAG.cpp | 518 /// AddPred - Updates the topological ordering to accommodate an edge 520 void ScheduleDAGTopologicalSort::AddPred(SUnit *Y, SUnit *X) { 602 /// create a cycle. If so, it is not safe to call AddPred(TargetSU, SU).
|
H A D | MachineScheduler.cpp | 509 Topo.AddPred(SuccSU, PredDep.getSUnit());
|
Completed in 309 milliseconds