AddPred(SUnit *Y, SUnit *X) | llvm::ScheduleDAGTopologicalSort | |
AddPredQueued(SUnit *Y, SUnit *X) | llvm::ScheduleDAGTopologicalSort | |
AddSUnitWithoutPredecessors(const SUnit *SU) | llvm::ScheduleDAGTopologicalSort | |
begin() | llvm::ScheduleDAGTopologicalSort | inline |
begin() const | llvm::ScheduleDAGTopologicalSort | inline |
const_iterator typedef | llvm::ScheduleDAGTopologicalSort | |
const_reverse_iterator typedef | llvm::ScheduleDAGTopologicalSort | |
end() | llvm::ScheduleDAGTopologicalSort | inline |
end() const | llvm::ScheduleDAGTopologicalSort | inline |
GetSubGraph(const SUnit &StartSU, const SUnit &TargetSU, bool &Success) | llvm::ScheduleDAGTopologicalSort | |
InitDAGTopologicalSorting() | llvm::ScheduleDAGTopologicalSort | |
IsReachable(const SUnit *SU, const SUnit *TargetSU) | llvm::ScheduleDAGTopologicalSort | |
iterator typedef | llvm::ScheduleDAGTopologicalSort | |
MarkDirty() | llvm::ScheduleDAGTopologicalSort | inline |
rbegin() | llvm::ScheduleDAGTopologicalSort | inline |
rbegin() const | llvm::ScheduleDAGTopologicalSort | inline |
RemovePred(SUnit *M, SUnit *N) | llvm::ScheduleDAGTopologicalSort | |
rend() | llvm::ScheduleDAGTopologicalSort | inline |
rend() const | llvm::ScheduleDAGTopologicalSort | inline |
reverse_iterator typedef | llvm::ScheduleDAGTopologicalSort | |
ScheduleDAGTopologicalSort(std::vector< SUnit > &SUnits, SUnit *ExitSU) | llvm::ScheduleDAGTopologicalSort | |
WillCreateCycle(SUnit *TargetSU, SUnit *SU) | llvm::ScheduleDAGTopologicalSort | |