mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-21 03:53:04 +02:00
update file comment
llvm-svn: 26573
This commit is contained in:
parent
2fad0ea044
commit
86375c060a
@ -7,9 +7,14 @@
|
|||||||
//
|
//
|
||||||
//===----------------------------------------------------------------------===//
|
//===----------------------------------------------------------------------===//
|
||||||
//
|
//
|
||||||
// This implements a simple two pass scheduler. The first pass attempts to push
|
// This implements bottom-up and top-down list schedulers, using standard
|
||||||
// backward any lengthy instructions and critical paths. The second pass packs
|
// algorithms. The basic approach uses a priority queue of available nodes to
|
||||||
// instructions into semi-optimal time slots.
|
// schedule. One at a time, nodes are taken from the priority queue (thus in
|
||||||
|
// priority order), checked for legality to schedule, and emitted if legal.
|
||||||
|
//
|
||||||
|
// Nodes may not be legal to schedule either due to structural hazards (e.g.
|
||||||
|
// pipeline or resource constraints) or because an input to the instruction has
|
||||||
|
// not completed execution.
|
||||||
//
|
//
|
||||||
//===----------------------------------------------------------------------===//
|
//===----------------------------------------------------------------------===//
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user