contrib/gcc/genautomata.c

191 typedef struct state *state_t;
212 DEF_VEC_P(state_t);
213 DEF_VEC_ALLOC_P(state_t,heap);
233 static arc_t first_out_arc             (state_t);
700   state_t next_equiv_class_state;
707   state_t equiv_class_state;
735   state_t to_state;
756   state_t state;
824   state_t start_state;
3343 static state_t first_free_state;
3622 static state_t
3625   state_t result;
3665 free_state (state_t state)
3682   if (((state_t) state)->component_states == NULL)
3683     hash_value = reserv_sets_hash_value (((state_t) state)->reservs);
3687       for (alt_state = ((state_t) state)->component_states;
3696                 + ((state_t) state)->automaton->automaton_order_num);
3707   if (((state_t) state_1)->automaton != ((state_t) state_2)->automaton)
3709   else if (((state_t) state_1)->component_states == NULL
3710            && ((state_t) state_2)->component_states == NULL)
3711     return reserv_sets_eq (((state_t) state_1)->reservs,
3712 			   ((state_t) state_2)->reservs);
3713   else if (((state_t) state_1)->component_states != NULL
3714            && ((state_t) state_2)->component_states != NULL)
3716       for (alt_state_1 = ((state_t) state_1)->component_states,
3717            alt_state_2 = ((state_t) state_2)->component_states;
3732 static state_t
3733 insert_state (state_t state)
3740   return (state_t) *entry_ptr;
3746 set_state_reserv (state_t state, int cycle_num, int unit_num)
3754 intersected_state_reservs_p (state_t state1, state_t state2)
3763 static state_t
3764 states_union (state_t state1, state_t state2, reserv_sets_t reservs)
3766   state_t result;
3767   state_t state_in_table;
3785 static state_t
3786 state_shift (state_t state, reserv_sets_t reservs)
3788   state_t result;
3789   state_t state_in_table;
3867 remove_arc (state_t from_state, arc_t arc)
3890 find_arc (state_t from_state, state_t to_state, ainsn_t insn)
3903 add_arc (state_t from_state, state_t to_state, ainsn_t ainsn)
3937 first_out_arc (state_t state)
5126 static state_t state_being_formed;
5189   state_t state_in_table;
5190   state_t corresponding_state;
5346   state_t state;
5347   state_t start_state;
5348   state_t state2;
5351   VEC(state_t,heap) *state_stack = VEC_alloc(state_t,heap, 150);
5359   VEC_safe_push (state_t,heap, state_stack, start_state);
5361   while (VEC_length (state_t, state_stack) != 0)
5363       state = VEC_pop (state_t, state_stack);
5388                             VEC_safe_push (state_t,heap, state_stack, state2);
5414           VEC_safe_push (state_t,heap, state_stack, state2);
5422   VEC_free (state_t,heap, state_stack);
5427 form_arcs_marked_by_insn (state_t state)
5454 create_composed_state (state_t original_state, arc_t arcs_marked_by_insn,
5455 		       VEC(state_t,heap) **state_stack)
5457   state_t state;
5462   state_t state_in_table;
5463   state_t temp_state;
5545       VEC_safe_push (state_t,heap, *state_stack, state);
5556   state_t start_state;
5557   state_t state;
5559   VEC(state_t,heap) *state_stack;
5563   state_stack = VEC_alloc (state_t,heap, 0);
5568   VEC_safe_push (state_t,heap, state_stack, start_state);
5570   while (VEC_length (state_t, state_stack) != 0)
5572       state = VEC_pop (state_t, state_stack);
5588   VEC_free (state_t,heap, state_stack);
5598 pass_state_graph (state_t start_state, void (*applied_func) (state_t state))
5615 pass_states (automaton_t automaton, void (*applied_func) (state_t state))
5630 static VEC(state_t,heap) *all_achieved_states;
5635 add_achieved_state (state_t state)
5637   VEC_safe_push (state_t,heap, all_achieved_states, state);
5645 set_out_arc_insns_equiv_num (state_t state, int odd_iteration_flag)
5663 clear_arc_insns_equiv_num (state_t state)
5675 first_cycle_unit_presence (state_t state, int unit_num)
5694 cache_presence (state_t state)
5718 state_is_differed (state_t state, state_t another_state,
5753   state_t s1 = *(state_t *)state_ptr_1;
5754   state_t s2 = *(state_t *)state_ptr_2;
5776 init_equiv_class (VEC(state_t,heap) *states, VEC (state_t,heap) **classes)
5779   state_t prev = 0;
5782   *classes = VEC_alloc (state_t,heap, 150);
5783   for (i = 0; i < VEC_length (state_t, states); i++)
5785       state_t state = VEC_index (state_t, states, i);
5790 	      VEC_safe_push (state_t,heap, *classes, prev);
5800     VEC_safe_push (state_t,heap, *classes, prev);
5807 copy_equiv_class (VEC(state_t,heap) **to, VEC(state_t,heap) *from)
5809   VEC_free (state_t,heap, *to);
5810   *to = VEC_copy (state_t,heap, from);
5821 partition_equiv_class (state_t first_state, int odd_iteration_flag,
5822 		       VEC(state_t,heap) **next_iteration_classes,
5825   state_t new_equiv_class;
5827   state_t curr_state;
5828   state_t prev_state;
5829   state_t next_state;
5868 	VEC_safe_push (state_t,heap, *next_iteration_classes, new_equiv_class);
5877 			VEC(state_t,heap) **equiv_classes)
5882   VEC (state_t,heap) *next_iteration_classes;
5885   all_achieved_states = VEC_alloc (state_t,heap, 1500);
5888   qsort (VEC_address (state_t, all_achieved_states),
5889 	 VEC_length (state_t, all_achieved_states),
5890          sizeof (state_t), compare_states_for_equiv);
5903       for (i = 0; i < VEC_length (state_t, all_achieved_states); i++)
5905 	  VEC_index (state_t, all_achieved_states, i)->equiv_class_num_2
5906 	    = VEC_index (state_t, all_achieved_states, i)->equiv_class_num_1;
5908 	  VEC_index (state_t, all_achieved_states, i)->equiv_class_num_1
5909 	    = VEC_index (state_t, all_achieved_states, i)->equiv_class_num_2;
5911       for (i = 0; i < VEC_length (state_t, *equiv_classes); i++)
5912 	if (partition_equiv_class (VEC_index (state_t, *equiv_classes, i),
5919   VEC_free (state_t,heap, next_iteration_classes);
5920   VEC_free (state_t,heap, all_achieved_states);
5925 merge_states (automaton_t automaton, VEC(state_t,heap) *equiv_classes)
5927   state_t curr_state;
5928   state_t new_state;
5929   state_t first_class_state;
5938   for (i = 0; i < VEC_length (state_t, equiv_classes); i++)
5940       curr_state = VEC_index (state_t, equiv_classes, i);
5979   for (i = 0; i < VEC_length (state_t, equiv_classes); i++)
5981       curr_state = VEC_index (state_t, equiv_classes, i);
6025 set_new_cycle_flags (state_t state)
6040   VEC(state_t,heap) *equiv_classes = 0;
6046   VEC_free (state_t,heap, equiv_classes);
6057 incr_states_and_arcs_nums (state_t state)
6154 set_order_state_num (state_t state)
6244 process_state_for_insn_equiv_partition (state_t state)
6720 longest_path_length (state_t state)
6901 #define STATE_TYPE_NAME "state_t"
7309 out_state_arcs_num (state_t state)
7332   transition_els_num_1 = out_state_arcs_num (*(state_t *) state_ptr_1);
7333   transition_els_num_2 = out_state_arcs_num (*(state_t *) state_ptr_2);
7360 static VEC(state_t,heap) *output_states_vect;
7365 add_states_vect_el (state_t state)
7367   VEC_safe_push (state_t,heap, output_states_vect, state);
7385   qsort (VEC_address (state_t, output_states_vect),
7386 	 VEC_length (state_t, output_states_vect),
7387          sizeof (state_t), compare_transition_els_num);
7389   for (i = 0; i < VEC_length (state_t, output_states_vect); i++)
7392       for (arc = first_out_arc (VEC_index (state_t, output_states_vect, i));
7402 		VEC_index (state_t, output_states_vect, i)->order_state_num,
7410   VEC_free (state_t,heap, output_states_vect);
7423 min_issue_delay_pass_states (state_t state, ainsn_t ainsn)
7465 min_issue_delay (state_t state, ainsn_t ainsn)
7499   min_issue_delay_len = (VEC_length (state_t, output_states_vect)
7509 	for (i = 0; i < VEC_length (state_t, output_states_vect); i++)
7510 	  VEC_index (state_t, output_states_vect, i)->min_insn_issue_delay = -1;
7511 	for (i = 0; i < VEC_length (state_t, output_states_vect); i++)
7513 	    state_t s = VEC_index (state_t, output_states_vect, i);
7559   VEC_free (state_t,heap, output_states_vect);
7581 		 VEC_length (state_t, output_states_vect));
7582   for (i = 0; i < VEC_length (state_t, output_states_vect); i++)
7584       state_t s = VEC_index (state_t, output_states_vect, i);
7608   VEC_free (state_t,heap, output_states_vect);
7631   reserved_units_size = (VEC_length (state_t, output_states_vect)
7638   for (n = 0; n < VEC_length (state_t, output_states_vect); n++)
7640       state_t s = VEC_index (state_t, output_states_vect, n);
7664   VEC_free (state_t,heap, output_states_vect);
8658 add_state_reservs (state_t state)
8674 output_state_arcs (state_t state)
8752 output_state (state_t state)
9059 static VEC(state_t,heap) *automaton_states;
9064 add_automaton_state (state_t state)
9066   VEC_safe_push (state_t,heap, automaton_states, state);
9087       VEC_truncate (state_t, automaton_states, 0);
9089       for (n = 0; n < VEC_length (state_t, automaton_states); n++)
9091 	  state_t s = VEC_index (state_t, automaton_states, n);
9105   VEC_free (state_t,heap, automaton_states);