Lines Matching defs:Schedule
12 // queue of available nodes to schedule. One at a time, nodes are taken from
14 // schedule, and emitted if legal.
173 void Schedule();
300 /// Schedule - Schedule the DAG using list scheduling.
301 void ScheduleDAGRRList::Schedule() {
333 dbgs() << "*** Final schedule ***\n";
683 /// ScheduleNodeBottomUp - Add the node to the schedule. Decrement the pending
781 /// UnscheduleNodeBottomUp - Remove the node from the schedule, update its and
879 /// BTCycle in order to schedule a specific node.
1229 /// If the specific node is the last one that's available to schedule, do
1240 // then we are free to schedule it.
1341 // Try unscheduling up to the point where it's safe to schedule
1367 // node is no longer avaialable. Schedule a successor that's now
1462 // priority. If it is not ready put it back. Schedule the node.
1468 // Pick the best node to schedule taking all constraints into
1796 // Return -1 to schedule right above left, 1 for left above right.
1856 // Lower priority means schedule further down. For bottom-up scheduling, lower
1879 schedule it close to its uses
2363 // Schedule physical register definitions close to their use. This is
2411 // Try schedule def + use closer when Sethi-Ullman numbers are the same.
2420 // Then schedule t2 = op first.
2517 // Avoid causing spills. If register pressure is high, schedule for
2537 // Schedule as many instructions in each cycle as possible. So don't make an
2564 // If SU does not have a register def, schedule it close to its uses
2869 /// first (lower in the schedule). If both nodes are two-address, favor the
