|
LLVM
3.7.0
|
#include "llvm/ADT/BitVector.h"#include "llvm/ADT/GraphTraits.h"#include "llvm/ADT/PointerIntPair.h"#include "llvm/ADT/SmallVector.h"#include "llvm/CodeGen/MachineInstr.h"#include "llvm/Target/TargetLowering.h"Go to the source code of this file.
Classes | |
| class | llvm::GraphWriter< Graph > |
| class | llvm::SDep |
| SDep - Scheduling dependency. More... | |
| struct | llvm::isPodLike< SDep > |
| class | llvm::SUnit |
| SUnit - Scheduling unit. This is a node in the scheduling DAG. More... | |
| class | llvm::SchedulingPriorityQueue |
| SchedulingPriorityQueue - This interface is used to plug different priorities computation algorithms into the list scheduler. More... | |
| class | llvm::ScheduleDAG |
| class | llvm::SUnitIterator |
| struct | llvm::GraphTraits< SUnit * > |
| struct | llvm::GraphTraits< ScheduleDAG * > |
| class | llvm::ScheduleDAGTopologicalSort |
| ScheduleDAGTopologicalSort is a class that computes a topological ordering for SUnits and provides methods for dynamically updating the ordering as new edges are added. More... | |
Namespaces | |
| llvm | |
| Compute iterated dominance frontiers using a linear time algorithm. | |
1.8.6