contrib/gcc/genautomata.c

59    6. Union of automaton states are not generated yet.  It is planned
94        equivalent automaton states (major function is `minimize_DFA').
277 /* Flag of output of a progress bar showing how many states were
664    several component states which represent alternative cpu units
676      states.  */
692      is NULL.  All states in the list are in the hash table.  The list
696   /* The following field is used for passing graph of states.  */
698   /* The list of states belonging to one equivalence class is formed
710      The states in final DFA is enumerated with the aid of the
713   /* This member is used for passing states for searching minimal
774   /* The following field is states which characterize automaton unit
778   /* The following field is sorted list of states which characterize
829   /* The following field value is number of states of final DFA.  */
854   /* Total number of locked states in this automaton.  */
3138 /* Abstract data `alternative states' which represents
3142 /* List of free states.  */
3202 /* The function compares unique numbers of alt states.  */
3217    states from the list.  The comparison key is alt state unique
3675    states.  One more key is order number of state automaton.  */
3700 /* Return nonzero value if the states are the same.  */
3751 /* Return nonzero value if the deterministic states contains a
3762    the deterministic states masked by RESERVS.  */
3967 /* List of free states.  */
5202    reservation the alt states are created.  */
5206    forming alt_states of AUTOMATON.  List of the alt states should
5311    states achieved from a given state.  It permits to build smaller
5339 /* The following function creates all states of nondeterministic AUTOMATON.  */
5592    graph of states.  */
5595 /* This recursive function passes all states achieved from START_STATE
5612 /* This recursive function passes all states of AUTOMATON and applies
5621 /* The function initializes code for passing of all states.  */
5629    states.  */
5745 /* Compares two states pointed to by STATE_PTR_1 and STATE_PTR_2
5748    states be filled.  */
5776 init_equiv_class (VEC(state_t,heap) *states, VEC (state_t,heap) **classes)
5783   for (i = 0; i < VEC_length (state_t, states); i++)
5785       state_t state = VEC_index (state_t, states, i);
5804 /* The function copies pointers to equivalent states from vla FROM
5815    are not equivalent states, the function partitions the class
5816    removing nonequivalent states and placing them in
5838 	  /* There are more one states in the class equivalence.  */
5874 /* The function finds equivalent states of AUTOMATON.  */
5923 /* The function merges equivalent states of AUTOMATON.  */
5936   /* Create states corresponding to equivalence classes containing two
5937      or more states.  */
5943 	  /* There are more one states in the class equivalence.  */
5971 	  /* Its is important that alt states were sorted before and
5993 	  /* Delete output arcs from states of given class equivalence.  */
6022 /* The function sets up new_cycle_p for states if there is arc to the
6049 /* Values of two variables are counted number of states and arcs in an
6054 /* The function is called by function `pass_states' to count states
6066 /* The function counts states and arcs of AUTOMATON.  */
6095       fprintf (stderr, " (1 dot is 100 new states):");
6112       fprintf (stderr, " (1 dot is 100 new states):");
6145 /* The page contains code for enumeration  of all states of an automaton.  */
6147 /* Variable used for enumeration of all states of an automaton.  Its
6148    value is current number of automaton states.  */
6152    states.  */
6160 /* The function enumerates all states of AUTOMATON.  */
6983 /* Output C type which is used for representation of codes of states
7324 /* Compare number of possible transitions from the states.  */
7359 /* This is for forming vector of states of an automaton.  */
7381   /* Create vect of pointers to states ordered by num of transitions
7414 /* The current number of passing states to find minimal issue delay
7418 /* This recursive function passes states to find minimal issue delay
7494   /* Create vect of pointers to states ordered by num of transitions
7564 /* Form and output vector representing the locked states of
7573   /* Create vect of pointers to states ordered by num of
7612 /* Form and output vector representing reserved units of the states of
7626   /* Create vect of pointers to states.  */
7654   fprintf (output_file, "/* Vector for reserved units of states.  */\n");
8823       fprintf (f, "\n    %5d NDFA states,          %5d NDFA arcs\n",
8825       fprintf (f, "    %5d DFA states,           %5d DFA arcs\n",
8830 	  fprintf (f, "    %5d minimal DFA states,   %5d minimal DFA arcs\n",
8837       fprintf (f, "    %d locked states\n", automaton->locked_states);
8860   fprintf (f, "\n%5d all allocated states,     %5d all allocated arcs\n",
8862   fprintf (f, "%5d all allocated alternative states\n",
8867   fprintf (f, "%5d all locked states\n", locked_states);
9058    states.  */
9070    states may be changed after the insn issue) for each insn.  */