Lines Matching defs:AcquireAtCycle
1051 return LHS.AcquireAtCycle < RHS.AcquireAtCycle ||
1052 (LHS.AcquireAtCycle == RHS.AcquireAtCycle &&
1060 for (; C < SU->TopReadyCycle + PI.AcquireAtCycle; ++C) {
1063 for (unsigned I = 0, E = PI.ReleaseAtCycle - PI.AcquireAtCycle; I != E;
1132 return LHS.AcquireAtCycle < RHS.AcquireAtCycle ||
1133 (LHS.AcquireAtCycle == RHS.AcquireAtCycle &&
1141 for (; C > ((int)SU->BotReadyCycle - (int)PI.AcquireAtCycle); --C) {
1144 for (unsigned I = 0, E = PI.ReleaseAtCycle - PI.AcquireAtCycle; I != E;
2293 assert(PI->ReleaseAtCycle >= PI->AcquireAtCycle);
2295 (Factor * (PI->ReleaseAtCycle - PI->AcquireAtCycle));
2349 unsigned AcquireAtCycle) {
2353 CurrCycle, AcquireAtCycle, ReleaseAtCycle);
2356 CurrCycle, AcquireAtCycle, ReleaseAtCycle);
2375 unsigned AcquireAtCycle) {
2405 StartIndex, ReleaseAtCycle, AcquireAtCycle),
2412 getNextResourceCycle(SC, SubUnits[I], ReleaseAtCycle, AcquireAtCycle);
2424 getNextResourceCycleByInstance(I, ReleaseAtCycle, AcquireAtCycle);
2482 unsigned AcquireAtCycle = PE.AcquireAtCycle;
2485 getNextResourceCycle(SC, ResIdx, ReleaseAtCycle, AcquireAtCycle);
2633 /// \param AcquireAtCycle indicates the number of consecutive (non-pipelined)
2641 unsigned AcquireAtCycle) {
2643 unsigned Count = Factor * (ReleaseAtCycle- AcquireAtCycle);
2664 getNextResourceCycle(SC, PIdx, ReleaseAtCycle, AcquireAtCycle);
2745 PI->AcquireAtCycle);
2763 SC, PIdx, PI->ReleaseAtCycle, PI->AcquireAtCycle);
2767 NextCycle, PI->AcquireAtCycle, PI->ReleaseAtCycle),
2772 NextCycle, PI->AcquireAtCycle, PI->ReleaseAtCycle),
2779 SC, PIdx, PI->ReleaseAtCycle, PI->AcquireAtCycle);
4476 unsigned CurrCycle, unsigned AcquireAtCycle, unsigned ReleaseAtCycle,
4485 if (AcquireAtCycle == ReleaseAtCycle)
4490 IntervalBuilder(RetCycle, AcquireAtCycle, ReleaseAtCycle);
4500 NewInterval = IntervalBuilder(RetCycle, AcquireAtCycle, ReleaseAtCycle);