contrib/gcc/genautomata.c

342   /* The following field value is maximal cycle number (1, ...) on
346   /* The following field value is minimal cycle number (0, ...) on
364   /* The following is the last cycle on which the unit was checked for
448   /* The following field is used to check up cycle in expression
477      insn `cycle advancing'.  */
621      special insn "cycle advancing" which is added by the automaton
670      cycle advancing.  */
673      each cycle.  */
721      from given state no containing arcs marked by special insn `cycle
736   /* The following field describes that the insn issue (with cycle
737      advancing for special insn `cycle advancing' and without cycle
776      is special insn `cycle advancing'.  */
780      NULL only if it is special insn `cycle advancing'.  */
2835 /* The following function fixes errors "cycle in definition ...".  The
2860 		error ("cycle in definition of reservation `%s'",
2868    max and min cycle for reservation of unit.  */
3119 /* Pseudo insn decl which denotes advancing cycle.  */
3322    representation of one cycle reservation.  It is depended on units
3454    i.e. there is a unit reservation on a cycle in both reservation
3497    cpu cycle.  The remaining bits of OPERAND (representing the last
3498    cycle unit reservations) are not changed.  */
3542    cycle START_CYCLE in the reservation set.  The function uses repeat
3586   int cycle;
3590   for (cycle = 0; cycle < max_cycles_num; cycle++)
3594         start_cycle = cycle;
3599               (char *) reservs + cycle * els_in_cycle_reserv
3609         start_cycle = cycle;
3743 /* Add reservation of unit with UNIT_NUM on cycle CYCLE_NUM to
3752    reservation of the same cpu unit on the same cpu cycle.  */
3784    by advancing cpu cycle and masking by RESERVS.  */
4917   /* The following forms a list of units used on the same cycle in the
4931    (alternative number, cycle).  Unit usages on given cycle in
4933    index equals to the cycle * number of all alternatives in the regexp
4941 store_alt_unit_usage (regexp_t regexp, regexp_t unit, int cycle,
4953   length = (cycle + 1) * REGEXP_ONEOF (regexp)->regexps_num;
4961   index = cycle * REGEXP_ONEOF (regexp)->regexps_num + alt_num;
4973   int i, j, k, cycle;
5051       cycle = i / REGEXP_ONEOF (regexp)->regexps_num;
5055 	if (cycle != unit_usage_ptr->unit_decl->last_distribution_check_cycle)
5057 	    unit_usage_ptr->unit_decl->last_distribution_check_cycle = cycle;
5058 	    for (k = cycle * REGEXP_ONEOF (regexp)->regexps_num;
5060 		   && k == cycle * REGEXP_ONEOF (regexp)->regexps_num;
5076 		&& k == cycle * REGEXP_ONEOF (regexp)->regexps_num)
5085 		error ("Unit %s, reserv. %s, cycle %d",
5087 		       cycle);
5133    CURR_CYCLE is start cycle of all reservation REGEXP.  */
5162 	int cycle;
5166 	    cycle = process_seq_for_forming_states (REGEXP_ALLOF (regexp)
5169 	    if (finish_cycle < cycle)
5170 	      finish_cycle = cycle;
5320   int cycle, unit;
5323   for (cycle = 0; cycle < max_cycles_num; cycle++)
5327 	  && (cycle >= units_array [unit]->min_occ_cycle_num
5335 	set_unit_reserv (reservs_matter, cycle, unit);
5409       /* Add transition to advance cycle.  */
5673    UNIT_NUM on the first cycle.  */
6347    cycle in reservations.  */
6717    `cycle advance' arcs.  */
6727       /* We don't expect the path cycle here.  Our graph may contain
6728       	 only cycles with one state on the path not containing `cycle
6738     /* Ignore cycles containing one state and `cycle advance' arcs.  */
6803    representing advancing cpu cycle.  Its value is used as internal
8760 	   state->new_cycle_p ? " (new cycle)\n" : "\n");
9141 			     /* One entry for cycle advancing insn.  */