Lines Matching defs:cycle
250 /// Since the DAG doesn't contain cycles, we represent a cycle in the graph
456 /// Modulo Reservation Table. When a resource with ID R is consumed in cycle
460 /// are assumed to be scheduled one per cycle, starting with the cycle in
469 /// The number of micro operations that can be scheduled at a cycle.
481 /// The slot on MRT to reserve a resource for the cycle C is positiveModulo(C,
527 /// map from scheduled cycle to instructions. During scheduling, the
532 /// The SMS algorithm allows negative values for cycles, so the first cycle
533 /// in the schedule is the smallest cycle value.
536 /// Map from execution cycle to instructions.
539 /// Map from instruction to execution cycle.
542 /// Keep track of the first cycle value in the schedule. It starts
546 /// Keep track of the last cycle value in the schedule.
582 /// Return the first cycle in the completed schedule. This
586 /// Return the last cycle in the finalized schedule.
589 /// Return the cycle of the earliest scheduled instruction in the dependence
593 /// Return the cycle of the latest scheduled instruction in the dependence
601 /// Iterators for the cycle to instruction map.
620 /// Return the cycle for a scheduled instruction. This function normalizes
621 /// the first cycle to be 0.
633 /// Return the instructions that are scheduled at the specified cycle.
634 std::deque<SUnit *> &getInstructions(int cycle) {
635 return ScheduledInstrs[cycle];