Detailed Description

The following structure represents a copy of two allocnos.  The
copies represent move insns or potential move insns usually because
of two operand insn constraints.  To remove register shuffle, we
also create copies between allocno which is output of an insn and
allocno becoming dead in the insn.

Field Documentation

◆ constraint_p

bool ira_allocno_copy::constraint_p

◆ first

ira_allocno_t ira_allocno_copy::first

◆ freq

int ira_allocno_copy::freq

◆ insn

rtx_insn* ira_allocno_copy::insn

◆ loop_tree_node

ira_loop_tree_node_t ira_allocno_copy::loop_tree_node

◆ next_first_allocno_copy

ira_copy_t ira_allocno_copy::next_first_allocno_copy

◆ next_second_allocno_copy

ira_copy_t ira_allocno_copy::next_second_allocno_copy

◆ num

int ira_allocno_copy::num

◆ prev_first_allocno_copy

ira_copy_t ira_allocno_copy::prev_first_allocno_copy

◆ prev_second_allocno_copy

ira_copy_t ira_allocno_copy::prev_second_allocno_copy

◆ second

ira_allocno_t ira_allocno_copy::second

The documentation for this struct was generated from the following file:

ira-int.h

Data Fields
int	num

ira_allocno_t	first

ira_allocno_t	second

int	freq

bool	constraint_p

rtx_insn *	insn

ira_copy_t	prev_first_allocno_copy

ira_copy_t	next_first_allocno_copy

ira_copy_t	prev_second_allocno_copy

ira_copy_t	next_second_allocno_copy

ira_loop_tree_node_t	loop_tree_node

Data Fields