Lines Matching defs:cycle

1593 /// for each cycle that is required. When adding a new instruction, we attempt
1847 // Add the artificial dependencies if it does not form a cycle.
2494 // When scheduling a Phi it is better to start at the late cycle and
2835 dbgs() << "\tinsert at cycle " << curCycle << " ";
2850 dbgs() << "\tfailed to insert at cycle " << curCycle << " ";
2857 // Return the cycle of the earliest scheduled instruction in the chain.
2880 // Return the cycle of the latest scheduled instruction in the chain.
2922 for (int cycle = getFirstCycle(); cycle <= LastCycle; ++cycle) {
2924 // Iterate over each instruction in the current cycle.
2925 for (SUnit *I : getInstructions(cycle)) {
2932 int EarlyStart = cycle + Dep.getLatency() -
2940 int LateStart = cycle - Dep.getLatency() +
2950 *MinLateStart = std::min(*MinLateStart, cycle);
2956 int LateStart = cycle - Dep.getLatency() +
2964 int EarlyStart = cycle + Dep.getLatency() -
2974 /// Order the instructions within a cycle so that the definitions occur
3053 // so may have nodes in same cycle with Anti denpendent on HW regs.
3220 << ") is not pipelined; moving from cycle " << OldCycle
3234 // cycle, orderDependence does not guarantee def/use ordering, so that
3236 // earlier and same-cycle use to be more robust.)
3366 // same cycle but occurs later in the serialized order.
3426 for (int cycle = getFirstCycle(); cycle <= getFinalCycle(); ++cycle) {
3430 ScheduledInstrs[cycle + (stage * InitiationInterval)];
3432 ScheduledInstrs[cycle].push_front(SU);
3438 for (int cycle = getFinalCycle() + 1; cycle <= LastCycle; ++cycle)
3439 ScheduledInstrs.erase(cycle);
3446 // Reorder the instructions in each cycle to fix and improve the
3468 // Iterate over each cycle.
3469 for (int cycle = getFirstCycle(); cycle <= getFinalCycle(); ++cycle) {
3470 // Iterate over each instruction in the cycle.
3471 const_sched_iterator cycleInstrs = ScheduledInstrs.find(cycle);
3473 os << "cycle " << cycle << " (" << stageScheduled(CI) << ") ";
3666 // DFA is needed for each cycle.