Lines Matching defs:Schedule
11 // The basic approach uses a priority queue of available nodes to schedule.
13 // order), checked for legality to schedule, and emitted if legal.
15 // Nodes may not be legal to schedule either due to structural hazards (e.g.
83 void Schedule();
93 /// Schedule - Schedule the DAG using list scheduling.
94 void ScheduleDAGVLIW::Schedule() {
150 /// scheduleNodeTopDown - Add the node to the schedule. Decrement the pending
184 // priority. If it is not ready put it back. Schedule the node.
237 // If we found a node to schedule, do it now.
