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.
78 void Schedule();
88 /// Schedule - Schedule the DAG using list scheduling.
89 void ScheduleDAGList::Schedule() {
140 /// ScheduleNodeTopDown - Add the node to the schedule. Decrement the pending
174 // priority. If it is not ready put it back. Schedule the node.
224 // If we found a node to schedule, do it now.
