Lines Matching defs:cycles
69 3. Compute MII: a lower bound on the number of cycles to schedule the loop.
71 1. Set II = MII. We will try to schedule the loop within II cycles.
73 For each insn compute an interval of cycles by considering already-
75 the insn in the cycles of this window checking for potential
82 5. If we succeeded in scheduling the loop within II cycles, we now
85 II cycles (i.e. use register copies to prevent a def from overwriting
402 requires more cycles than this bound. Currently set to the sum of the
1202 /* Generate the kernel just to be able to measure its cycles. */
1206 /* Get the number of cycles the new kernel expect to execute in. */
1347 /* A limit on the number of cycles that resource conflicts can span. ??? Should
1353 cycles in which we can schedule the node with the given index I.
1763 /* MII is needed if we consider backarcs (that do not close recursive cycles). */
2301 the number of cycles according to DFA that the kernel fits in,
2305 when it gives less cycles after register moves are added. */
2309 int cycles = 0;
2325 cycles ++;
2334 cycles ++;
2349 return cycles;