Dan Gohman ee2e403545 Add a new "fast" scheduler. This is currently basically just a ... copy of the BURRList scheduler, but with several parts ripped out, such as backtracking, online topological sort maintenance (needed by backtracking), the priority queue, and Sethi-Ullman number computation and maintenance (needed by the priority queue). As a result of all this, it generates somewhat lower quality code, but that's its tradeoff for running about 30% faster than list-burr in -fast mode in many cases. This is somewhat experimental. Moving forward, major pieces of this can be refactored with pieces in common with ScheduleDAGRRList.cpp. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@56307 91177308-0d34-0410-b5e6-96231b3b80d8		2008-09-18 16:26:26 +00:00
..
CallingConvLower.cpp
DAGCombiner.cpp
FastISel.cpp
LegalizeDAG.cpp
LegalizeFloatTypes.cpp
LegalizeIntegerTypes.cpp
LegalizeTypes.cpp
LegalizeTypes.h
LegalizeTypesGeneric.cpp
LegalizeVectorTypes.cpp
Makefile
ScheduleDAG.cpp
ScheduleDAGEmit.cpp	Add a bit to mark operands of asm's that conflict	2008-09-17 21:13:11 +00:00
ScheduleDAGFast.cpp	Add a new "fast" scheduler. This is currently basically just a	2008-09-18 16:26:26 +00:00
ScheduleDAGList.cpp
ScheduleDAGRRList.cpp	Don't worry about clobbering physical register defs that aren't used.	2008-09-17 15:25:49 +00:00
SelectionDAG.cpp
SelectionDAGBuild.cpp	Add a bit to mark operands of asm's that conflict	2008-09-17 21:13:11 +00:00
SelectionDAGBuild.h
SelectionDAGISel.cpp	Add a bit to mark operands of asm's that conflict	2008-09-17 21:13:11 +00:00
SelectionDAGPrinter.cpp
TargetLowering.cpp