GCC Middle and Back End API Reference
state Class Reference
Inheritance diagram for state:
Collaboration diagram for state:

Public Member Functions

void set_parent (list_head< state > *)
range release ()
void push_back (range)
range remove (range)
void replace (range, range)
decisionsingleton () const

Data Fields

int new_cycle_p
reserv_sets_t reservs
int unique_num
automaton_t automaton
arc_t first_out_arc
unsigned int num_out_arcs
char it_was_placed_in_stack_for_NDFA_forming
char it_was_placed_in_stack_for_DFA_forming
alt_state_t component_states
int pass_num
state_t next_equiv_class_state
int equiv_class_num_1
int equiv_class_num_2
state_t equiv_class_state
unsigned int * presence_signature
int order_state_num
int state_pass_num
int min_insn_issue_delay

Detailed Description

The following node type describes state automaton.  The state may
be deterministic or non-deterministic.  Non-deterministic state has
several component states which represent alternative cpu units
reservations.  The state also is used for describing a
deterministic reservation of automaton insn.   
Represents one machine state.  For each state the machine tries a list
of decisions, in order, and acts on the first match.  It fails without
further backtracking if no decisions match.   

Member Function Documentation

◆ push_back()

void list_head< decision >::push_back ( range r)
Add R to the end of the list.   

◆ release()

list_head< decision >::range list_head< decision >::release ( )
Empty the list and return the previous contents as a range that can
be inserted into other lists.   

◆ remove()

list_head< decision >::range list_head< decision >::remove ( range r)
Remove R from the list.  R remains valid and can be inserted into
other lists.   

◆ replace()

void list_head< decision >::replace ( range oldr,
range newr )
Replace OLDR with NEWR.  OLDR remains valid and can be inserted into
other lists.   

◆ set_parent()

void state::set_parent ( list_head< state > * )

◆ singleton()

decision * list_head< decision >::singleton ( ) const
If the list contains a single item, return that item, otherwise return

Field Documentation

◆ automaton

automaton_t state::automaton

◆ component_states

◆ equiv_class_num_1

int state::equiv_class_num_1

◆ equiv_class_num_2

int state::equiv_class_num_2

◆ equiv_class_state

state_t state::equiv_class_state

◆ first

decision * list_head< decision >::first

◆ first_out_arc

arc_t state::first_out_arc

◆ it_was_placed_in_stack_for_DFA_forming

char state::it_was_placed_in_stack_for_DFA_forming

◆ it_was_placed_in_stack_for_NDFA_forming

char state::it_was_placed_in_stack_for_NDFA_forming

Referenced by get_free_state(), and make_automaton().

◆ last

decision * list_head< decision >::last

◆ min_insn_issue_delay

int state::min_insn_issue_delay

◆ new_cycle_p

int state::new_cycle_p

◆ next_equiv_class_state

state_t state::next_equiv_class_state

◆ num_out_arcs

unsigned int state::num_out_arcs

◆ order_state_num

◆ pass_num

int state::pass_num

Referenced by pass_state_graph().

◆ presence_signature

unsigned int* state::presence_signature

◆ reservs

◆ state_pass_num

int state::state_pass_num

◆ unique_num

int state::unique_num

The documentation for this class was generated from the following files: