nds are born. */ extern int ira_max_point; /* Arrays of size IRA_MAX_POINT mapping a program point to the allocno live ranges with given start/finish point. */ extern live_range_t *ira_start_point_ranges, *ira_finish_point_ranges; /* A structure representing conflict information for an allocno (or one of its subwords). */ struct ira_object { /* The allocno associated with this record. */ ira_allocno_t allocno; /* Vector of accumulated conflicting conflict_redords with NULL end marker (if OBJECT_CONFLICT_VEC_P is true) or conflict bit vector otherwise. */ void *conflicts_array; /* Pointer to structures describing at what program point the object lives. We always maintain the list in such way that *the ranges in the list are not intersected and ordered by decreasing their program points*. */ live_range_t live_ranges; /* The subword within ALLOCNO which is represented by this object. Zero means the lowest-order subword (or the entire allocno in case it is not being tracked in subwords). */ int subword; /* Allocated size of the conflicts array. */ unsigned int conflicts_array_size; /* A unique number for every instance of this structure, which is used to represent it in conflict bit vectors. */ int id; /* Before building conflicts, MIN and MAX are initialized to correspondingly minimal and maximal points of the accumulated live ranges. Afterwards, they hold the minimal and maximal ids of other ira_objects that this one can conflict with. */ int min, max; /* Initial and accumulated hard registers conflicting with this object and as a consequences can not be assigned to the allocno. All non-allocatable hard regs and hard regs of register classes different from given allocno one are included in the sets. */ HARD_REG_SET conflict_hard_regs, total_conflict_hard_regs; /* Number of accumulated conflicts in the vector of conflicting objects. */ int num_accumulated_conflicts; /* TRUE if conflicts are represented by a vector of pointers to ira_object structures. Otherwise, we use a bit vector indexed by conflict ID numbers. */ unsigned int conflict_vec_p : 1; }; /* A structure representing an allocno (allocation entity). Allocno represents a pseudo-register in an allocation region. If pseudo-register does not live in a region but it lives in the nested regions, it is represented in the region by special allocno called *cap*. There may be more one cap representing the same pseudo-register in region. It means that the corresponding pseudo-register lives in more one non-intersected subregion. */ struct ira_allocno { /* The allocno order number starting with 0. Each allocno has an unique number and the number is never changed for the allocno. */ int num; /* Regno for allocno or cap. */ int regno; /* Mode of the allocno which is the mode of the corresponding pseudo-register. */ ENUM_BITFIELD (machine_mode) mode : 8; /* Widest mode of the allocno which in at least one case could be for paradoxical subregs where wmode > mode. */ ENUM_BITFIELD (machine_mode) wmode : 8; /* Register class which should be used for allocation for given allocno. NO_REGS means that we should use memory. */ ENUM_BITFIELD (reg_class) aclass : 16; /* During the reload, value TRUE means that we should not reassign a hard register to the allocno got memory earlier. It is set up when we removed memory-memory move insn before each iteration of the reload. */ unsigned int dont_reassign_p : 1; #ifdef STACK_REGS /* Set to TRUE if allocno can't be assigned to the stack hard register correspondingly in this region and area including the region and all its subregions recursively. */ unsigned int no_stack_reg_p : 1, total_no_stack_reg_p : 1; #endif /* TRUE value means that there is no sense to spill the allocno during coloring because the spill will result in additional reloads in reload pass. */ unsigned int bad_spill_p : 1; /* TRUE if a hard register or memory has been assigned to the allocno. */ unsigned int assigned_p : 1; /* TRUE if conflicts for given allocno are represented by vector of pointers to the conflicting allocnos. Otherwise, we use a bit vector where a bit with given index represents allocno with the same number. */ unsigned int conflict_vec_p : 1; /* Hard register assigned to given allocno. Negative value means that memory was allocated to the allocno. During the reload, spilled allocno has value equal to the corresponding stack slot number (0, ...) - 2. Value -1 is used for allocnos spilled by the reload (at this point pseudo-register has only one allocno) which did not get stack slot yet. */ signed int hard_regno : 16; /* Allocnos with the same regno are linked by the following member. Allocnos corresponding to inner loops are first in the list (it corresponds to depth-first traverse of the loops). */ ira_allocno_t next_regno_allocno; /* There may be different allocnos with the same regno in different regions. Allocnos are bound to the corresponding loop tree node. Pseudo-register may have only one regular allocno with given loop tree node but more than one cap (see comments above). */ ira_loop_tree_node_t loop_tree_node; /* Accumulated usage references of the allocno. Here and below, word 'accumulated' means info for given region and all nested subregions. In this case, 'accumulated' means sum of references of the corresponding pseudo-register in this region and in all nested subregions recursively. */ int nrefs; /* Accumulated frequency of usage of the allocno. */ int freq; /* Minimal accumulated and updated costs of usage register of the allocno class. */ int class_cost, updated_class_cost; /* Minimal accumulated, and updated costs of memory for the allocno. At the allocation start, the original and updated costs are equal. The updated cost may be changed after finishing allocation in a region and starting allocation in a subregion. The change reflects the cost of spill/restore code on the subregion border if we assign memory to the pseudo in the subregion. */ int memory_cost, updated_memory_cost; /* Accumulated number of points where the allocno lives and there is excess pressure for its class. Excess pressure for a register class at some point means that there are more allocnos of given register class living at the point than number of hard-registers of the class available for the allocation. */ int excess_pressure_points_num; /* Allocno hard reg preferences. */ ira_pref_t allocno_prefs; /* Copies to other non-conflicting allocnos. The copies can represent move insn or potential move insn usually because of two operand insn constraints. */ ira_copy_t allocno_copies; /* It is a allocno (cap) representing given allocno on upper loop tree level. */ ira_allocno_t cap; /* It is a link to allocno (cap) on lower loop level represented by given cap. Null if given allocno is not a cap. */ ira_allocno_t cap_member; /* The number of objects tracked in the following array. */ int num_objects; /* An array of structures describing conflict information and live ranges for each object associated with the allocno. There may be more than one such object in cases where the allocno represents a multi-word register. */ ira_object_t objects[2]; /* Accumulated frequency of calls which given allocno intersects. */ int call_freq; /* Accumulated number of the intersected calls. */ int calls_crossed_num; /* The number of calls across which it is live, but which should not affect register preferences. */ int cheap_calls_crossed_num; /* Registers clobbered by intersected calls. */ HARD_REG_SET crossed_calls_clobbered_regs; /* Array of usage costs (accumulated and the one updated during coloring) for each hard register of the allocno class. The member value can be NULL if all costs are the same and equal to CLASS_COST. For example, the costs of two different hard registers can be different if one hard register is callee-saved and another one is callee-used and the allocno lives through calls. Another example can be case when for some insn the corresponding pseudo-register value should be put in specific register class (e.g. AREG for x86) which is a strict subset of the allocno class (GENERAL_REGS for x86). We have updated costs to reflect the situation when the usage cost of a hard register is decreased because the allocno is connected to another allocno by a copy and the another allocno has been assigned to the hard register. */ int *hard_reg_costs, *updated_hard_reg_costs; /* Array of decreasing costs (accumulated and the one updated during coloring) for allocnos conflicting with given allocno for hard regno of the allocno class. The member value can be NULL if all costs are the same. These costs are used to reflect preferences of other allocnos not assigned yet during assigning to given allocno. */ int *conflict_hard_reg_costs, *updated_conflict_hard_reg_costs; /* Different additional data. It is used to decrease size of allocno data footprint. */ void *add_data; }; /* All members of the allocno structures should be accessed only through the following macros. */ #define ALLOCNO_NUM(A) ((A)->num) #define ALLOCNO_REGNO(A) ((A)->regno) #define ALLOCNO_REG(A) ((A)->reg) #define ALLOCNO_NEXT_REGNO_ALLOCNO(A) ((A)->next_regno_allocno) #define ALLOCNO_LOOP_TREE_NODE(A) ((A)->loop_tree_node) #define ALLOCNO_CAP(A) ((A)->cap) #define ALLOCNO_CAP_MEMBER(A) ((A)->cap_member) #define ALLOCNO_NREFS(A) ((A)->nrefs) #define ALLOCNO_FREQ(A) ((A)->freq) #define ALLOCNO_HARD_REGNO(A) ((A)->hard_regno) #define ALLOCNO_CALL_FREQ(A) ((A)->call_freq) #define ALLOCNO_CALLS_CROSSED_NUM(A) ((A)->calls_crossed_num) #define ALLOCNO_CHEAP_CALLS_CROSSED_NUM(A) ((A)->cheap_calls_crossed_num) #define ALLOCNO_CROSSED_CALLS_CLOBBERED_REGS(A) \ ((A)->crossed_calls_clobbered_regs) #define ALLOCNO_MEM_OPTIMIZED_DEST(A) ((A)->mem_optimized_dest) #define ALLOCNO_MEM_OPTIMIZED_DEST_P(A) ((A)->mem_optimized_dest_p) #define ALLOCNO_SOMEWHERE_RENAMED_P(A) ((A)->somewhere_renamed_p) #define ALLOCNO_CHILD_RENAMED_P(A) ((A)->child_renamed_p) #define ALLOCNO_DONT_REASSIGN_P(A) ((A)->dont_reassign_p) #ifdef STACK_REGS #define ALLOCNO_NO_STACK_REG_P(A) ((A)->no_stack_reg_p) #define ALLOCNO_TOTAL_NO_STACK_REG_P(A) ((A)->total_no_stack_reg_p) #endif #define ALLOCNO_BAD_SPILL_P(A) ((A)->bad_spill_p) #define ALLOCNO_ASSIGNED_P(A) ((A)->assigned_p) #define ALLOCNO_MODE(A) ((A)->mode) #define ALLOCNO_WMODE(A) ((A)->wmode) #define ALLOCNO_PREFS(A) ((A)->allocno_prefs) #define ALLOCNO_COPIES(A) ((A)->allocno_copies) #define ALLOCNO_HARD_REG_COSTS(A) ((A)->hard_reg_costs) #define ALLOCNO_UPDATED_HARD_REG_COSTS(A) ((A)->updated_hard_reg_costs) #define ALLOCNO_CONFLICT_HARD_REG_COSTS(A) \ ((A)->conflict_hard_reg_costs) #define ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS(A) \ ((A)->updated_conflict_hard_reg_costs) #define ALLOCNO_CLASS(A) ((A)->aclass) #define ALLOCNO_CLASS_COST(A) ((A)->class_cost) #define ALLOCNO_UPDATED_CLASS_COST(A) ((A)->updated_class_cost) #define ALLOCNO_MEMORY_COST(A) ((A)->memory_cost) #define ALLOCNO_UPDATED_MEMORY_COST(A) ((A)->updated_memory_cost) #define ALLOCNO_EXCESS_PRESSURE_POINTS_NUM(A) \ ((A)->excess_pressure_points_num) #define ALLOCNO_OBJECT(A,N) ((A)->objects[N]) #define ALLOCNO_NUM_OBJECTS(A) ((A)->num_objects) #define ALLOCNO_ADD_DATA(A) ((A)->add_data) /* Typedef for pointer to the subsequent structure. */ typedef struct ira_emit_data *ira_emit_data_t; /* Allocno bound data used for emit pseudo live range split insns and to flattening IR. */ struct ira_emit_data { /* TRUE if the allocno assigned to memory was a destination of removed move (see ira-emit.c) at loop exit because the value of the corresponding pseudo-register is not changed inside the loop. */ unsigned int mem_optimized_dest_p : 1; /* TRUE if the corresponding pseudo-register has disjoint live ranges and the other allocnos of the pseudo-register except this one changed REG. */ unsigned int somewhere_renamed_p : 1; /* TRUE if allocno with the same REGNO in a subregion has been renamed, in other words, got a new pseudo-register. */ unsigned int child_renamed_p : 1; /* Final rtx representation of the allocno. */ rtx reg; /* Non NULL if we remove restoring value from given allocno to MEM_OPTIMIZED_DEST at loop exit (see ira-emit.c) because the allocno value is not changed inside the loop. */ ira_allocno_t mem_optimized_dest; }; #define ALLOCNO_EMIT_DATA(a) ((ira_emit_data_t) ALLOCNO_ADD_DATA (a)) /* Data used to emit live range split insns and to flattening IR. */ extern ira_emit_data_t ira_allocno_emit_data; /* Abbreviation for frequent emit data access. */ static inline rtx allocno_emit_reg (ira_allocno_t a) { return ALLOCNO_EMIT_DATA (a)->reg; } #define OBJECT_ALLOCNO(O) ((O)->allocno) #define OBJECT_SUBWORD(O) ((O)->subword) #define OBJECT_CONFLICT_ARRAY(O) ((O)->conflicts_array) #define OBJECT_CONFLICT_VEC(O) ((ira_object_t *)(O)->conflicts_array) #define OBJECT_CONFLICT_BITVEC(O) ((IRA_INT_TYPE *)(O)->conflicts_array) #define OBJECT_CONFLICT_ARRAY_SIZE(O) ((O)->conflicts_array_size) #define OBJECT_CONFLICT_VEC_P(O) ((O)->conflict_vec_p) #define OBJECT_NUM_CONFLICTS(O) ((O)->num_accumulated_conflicts) #define OBJECT_CONFLICT_HARD_REGS(O) ((O)->conflict_hard_regs) #define OBJECT_TOTAL_CONFLICT_HARD_REGS(O) ((O)->total_conflict_hard_regs) #define OBJECT_MIN(O) ((O)->min) #define OBJECT_MAX(O) ((O)->max) #define OBJECT_CONFLICT_ID(O) ((O)->id) #define OBJECT_LIVE_RANGES(O) ((O)->live_ranges) /* Map regno -> allocnos with given regno (see comments for allocno member `next_regno_allocno'). */ extern ira_allocno_t *ira_regno_allocno_map; /* Array of references to all allocnos. The order number of the allocno corresponds to the index in the array. Removed allocnos have NULL element value. */ extern ira_allocno_t *ira_allocnos; /* The size of the previous array. */ extern int ira_allocnos_num; /* Map a conflict id to its corresponding ira_object structure. */ extern ira_object_t *ira_object_id_map; /* The size of the previous array. */ extern int ira_objects_num; /* The following structure represents a hard register preference of allocno. The preference represent move insns or potential move insns usually because of two operand insn constraints. One move operand is a hard register. */ struct ira_allocno_pref { /* The unique order number of the preference node starting with 0. */ int num; /* Preferred hard register. */ int hard_regno; /* Accumulated execution frequency of insns from which the preference created. */ int freq; /* Given allocno. */ ira_allocno_t allocno; /* All preferences with the same allocno are linked by the following member. */ ira_pref_t next_pref; }; /* Array of references to all allocno preferences. The order number of the preference corresponds to the index in the array. */ extern ira_pref_t *ira_prefs; /* Size of the previous array. */ extern int ira_prefs_num; /* 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. */ struct ira_allocno_copy { /* The unique order number of the copy node starting with 0. */ int num; /* Allocnos connected by the copy. The first allocno should have smaller order number than the second one. */ ira_allocno_t first, second; /* Execution frequency of the copy. */ int freq; bool constraint_p; /* It is a move insn which is an origin of the copy. The member value for the copy representing two operand insn constraints or for the copy created to remove register shuffle is NULL. In last case the copy frequency is smaller than the corresponding insn execution frequency. */ rtx_insn *insn; /* All copies with the same allocno as FIRST are linked by the two following members. */ ira_copy_t prev_first_allocno_copy, next_first_allocno_copy; /* All copies with the same allocno as SECOND are linked by the two following members. */ ira_copy_t prev_second_allocno_copy, next_second_allocno_copy; /* Region from which given copy is originated. */ ira_loop_tree_node_t loop_tree_node; }; /* Array of references to all copies. The order number of the copy corresponds to the index in the array. Removed copies have NULL element value. */ extern ira_copy_t *ira_copies; /* Size of the previous array. */ extern int ira_copies_num; /* The following structure describes a stack slot used for spilled pseudo-registers. */ struct ira_spilled_reg_stack_slot { /* pseudo-registers assigned to the stack slot. */ bitmap_head spilled_regs; /* RTL representation of the stack slot. */ rtx mem; /* Size of the stack slot. */ unsigned int width; }; /* The number of elements in the following array. */ extern int ira_spilled_reg_stack_slots_num; /* The following array contains info about spilled pseudo-registers stack slots used in current function so far. */ extern struct ira_spilled_reg_stack_slot *ira_spilled_reg_stack_slots; /* Correspondingly overall cost of the allocation, cost of the allocnos assigned to hard-registers, cost of the allocnos assigned to memory, cost of loads, stores and register move insns generated for pseudo-register live range splitting (see ira-emit.c). */ extern int64_t ira_overall_cost; extern int64_t ira_reg_cost, ira_mem_cost; extern int64_t ira_load_cost, ira_store_cost, ira_shuffle_cost; extern int ira_move_loops_num, ira_additional_jumps_num;