Home | History | Annotate | Download | only in gcc

Lines Matching refs:alt_states

773   alt_state_t alt_states;
3370   auto_vec<alt_state_t, 150> alt_states;
3374     alt_states.safe_push (curr_alt_state);
3376   alt_states.qsort (alt_state_cmp);
3379   for (i = 1; i < alt_states.length (); i++)
3380     if (alt_states[prev_unique_state_ind]->state != alt_states[i]->state)
3383 	alt_states[prev_unique_state_ind] = alt_states[i];
3385   alt_states.truncate (prev_unique_state_ind + 1);
3387   for (i = 1; i < alt_states.length (); i++)
3388     alt_states[i-1]->next_sorted_alt_state
3389       = alt_states[i];
3390   alt_states.last ()->next_sorted_alt_state = 0;
3392   result = alt_states[0];
5361 /* The page contains code for building alt_states (see comments for
5372    REGEXP for forming alt_states of AUTOMATON.  It is believed that
5446    forming alt_states of AUTOMATON.  List of the alt states should
5462       alt_state_being_formed->next_alt_state = curr_ainsn->alt_states;
5463       curr_ainsn->alt_states = alt_state_being_formed;
5492           curr_ainsn->alt_states = NULL;
5496 	    = uniq_sort_alt_states (curr_ainsn->alt_states);
5607 		/* We process alt_states in the same order as they are
5609                 for (alt_state = ainsn->alt_states;
5901 /* The function clears equivalence numbers and alt_states in all insns
6168   alt_state_t alt_states;
6184 	  alt_states = NULL;
6195 		  new_alt_state->next_alt_state = alt_states;
6196 		  alt_states = new_alt_state;
6205 		    new_alt_state->next_alt_state = alt_states;
6206 		    alt_states = new_alt_state;
6211 	  new_state->component_states = uniq_sort_alt_states (alt_states);