Lines Matching defs:Cycle

705   for (int Cycle = Schedule.getFirstCycle(); Cycle <= Schedule.getFinalCycle();
706        ++Cycle) {
707     for (SUnit *SU : Schedule.getInstructions(Cycle)) {
709       Cycles[SU->getInstr()] = Cycle;
1088   for (int Cycle = Schedule.getFirstCycle(); Cycle <= Schedule.getFinalCycle();
1089        ++Cycle) {
1093                Cycle + Stage * Schedule.getInitiationInterval()))) {
1094         Instrs[Cycle].push_front(SU);
1099   for (int Cycle = Schedule.getFirstCycle(); Cycle <= Schedule.getFinalCycle();
1100        ++Cycle) {
1101     std::deque<SUnit *> &CycleInstrs = Instrs[Cycle];
3408   for (int Cycle = getFirstCycle(), E = getFinalCycle(); Cycle <= E; ++Cycle) {
3409     std::deque<SUnit *> &cycleInstrs = ScheduledInstrs[Cycle];
3509 bool ResourceManager::canReserveResources(SUnit &SU, int Cycle) {
3515     return DFAResources[positiveModulo(Cycle, InitiationInterval)]
3527   reserveResources(SCDesc, Cycle);
3529   unreserveResources(SCDesc, Cycle);
3535 void ResourceManager::reserveResources(SUnit &SU, int Cycle) {
3541     return DFAResources[positiveModulo(Cycle, InitiationInterval)]
3553   reserveResources(SCDesc, Cycle);
3564                                        int Cycle) {
3568     for (int C = Cycle; C < Cycle + PRE.ReleaseAtCycle; ++C)
3571   for (int C = Cycle; C < Cycle + SCDesc->NumMicroOps; ++C)
3576                                          int Cycle) {
3580     for (int C = Cycle; C < Cycle + PRE.ReleaseAtCycle; ++C)
3583   for (int C = Cycle; C < Cycle + SCDesc->NumMicroOps; ++C)