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.
180 void Schedule();
318 /// Schedule - Schedule the DAG using list scheduling.
319 void ScheduleDAGRRList::Schedule() {
352 dbgs() << "*** Final schedule ***\n";
702 /// ScheduleNodeBottomUp - Add the node to the schedule. Decrement the pending
802 /// UnscheduleNodeBottomUp - Remove the node from the schedule, update its and
902 /// BTCycle in order to schedule a specific node.
1252 /// If the specific node is the last one that's available to schedule, do
1263 // then we are free to schedule it.
1390 // Try unscheduling up to the point where it's safe to schedule
1494 // priority. If it is not ready put it back. Schedule the node.
1500 // Pick the best node to schedule taking all constraints into
1828 // Return -1 to schedule right above left, 1 for left above right.
1888 // Lower priority means schedule further down. For bottom-up scheduling, lower
1911 // If SU does not have a register def, schedule it close to its uses
2395 // Schedule physical register definitions close to their use. This is
2444 // Try schedule def + use closer when Sethi-Ullman numbers are the same.
2453 // Then schedule t2 = op first.
2550 // Avoid causing spills. If register pressure is high, schedule for
2570 // Schedule as many instructions in each cycle as possible. So don't make an
2597 // If SU does not have a register def, schedule it close to its uses
2902 /// first (lower in the schedule). If both nodes are two-address, favor the
