regs.h 8.5 KB
Newer Older
Richard Kenner committed
1
/* Define per-register tables for data flow info and register allocation.
Jeff Law committed
2
   Copyright (C) 1987, 1993, 1994, 1995, 1996, 1997, 1998,
3
   1999, 2000, 2003, 2004 Free Software Foundation, Inc.
Richard Kenner committed
4

5
This file is part of GCC.
Richard Kenner committed
6

7 8 9 10
GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 2, or (at your option) any later
version.
Richard Kenner committed
11

12 13 14 15
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
for more details.
Richard Kenner committed
16 17

You should have received a copy of the GNU General Public License
18 19 20
along with GCC; see the file COPYING.  If not, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
02111-1307, USA.  */
Richard Kenner committed
21

22 23
#ifndef GCC_REGS_H
#define GCC_REGS_H
Richard Kenner committed
24

25
#include "varray.h"
26 27
#include "hard-reg-set.h"
#include "basic-block.h"
Richard Kenner committed
28 29 30

#define REG_BYTES(R) mode_size[(int) GET_MODE (R)]

31 32
/* When you only have the mode of a pseudo register before it has a hard
   register chosen for it, this reports the size of each hard register
33 34
   a pseudo in such a mode would get allocated to.  A target may
   override this.  */
35 36 37 38

#ifndef REGMODE_NATURAL_SIZE
#define REGMODE_NATURAL_SIZE(MODE)	UNITS_PER_WORD
#endif
Richard Kenner committed
39

Jeff Law committed
40 41 42 43
#ifndef SMALL_REGISTER_CLASSES
#define SMALL_REGISTER_CLASSES 0
#endif

Richard Kenner committed
44 45 46 47
/* Maximum register number used in this function, plus one.  */

extern int max_regno;

48
/* Register information indexed by register number */
49 50
typedef struct reg_info_def
{				/* fields set by reg_scan */
51 52 53 54
  int first_uid;		/* UID of first insn to use (REG n) */
  int last_uid;			/* UID of last insn to use (REG n) */
  int last_note_uid;		/* UID of last note to use (REG n) */

55
				/* fields set by reg_scan & flow_analysis */
56 57 58 59
  int sets;			/* # of times (REG n) is set */

				/* fields set by flow_analysis */
  int refs;			/* # of times (REG n) is used or set */
60
  int freq;			/* # estimated frequency (REG n) is used or set */
61 62 63 64
  int deaths;			/* # of times (REG n) dies */
  int live_length;		/* # of instructions (REG n) is live */
  int calls_crossed;		/* # of calls (REG n) is live across */
  int basic_block;		/* # of basic blocks (REG n) is used in */
65
  char changes_mode;		/* whether (SUBREG (REG n)) exists and
66
				   is illegal.  */
67 68
} reg_info;

69
extern varray_type reg_n_info;
70

71
extern bitmap_head subregs_of_mode;
72

73
/* Indexed by n, gives number of times (REG n) is used or set.  */
Richard Kenner committed
74

75
#define REG_N_REFS(N) (VARRAY_REG (reg_n_info, N)->refs)
Richard Kenner committed
76

77 78 79 80
/* Estimate frequency of references to register N.  */

#define REG_FREQ(N) (VARRAY_REG (reg_n_info, N)->freq)

81
/* The weights for each insn varries from 0 to REG_FREQ_BASE.
82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98
   This constant does not need to be high, as in infrequently executed
   regions we want to count instructions equivalently to optimize for
   size instead of speed.  */
#define REG_FREQ_MAX 1000

/* Compute register frequency from the BB frequency.  When optimizing for size,
   or profile driven feedback is available and the function is never executed,
   frequency is always equivalent.  Otherwise rescale the basic block
   frequency.  */
#define REG_FREQ_FROM_BB(bb) (optimize_size				      \
			      || (flag_branch_probabilities		      \
				  && !ENTRY_BLOCK_PTR->count)		      \
			      ? REG_FREQ_MAX				      \
			      : ((bb)->frequency * REG_FREQ_MAX / BB_FREQ_MAX)\
			      ? ((bb)->frequency * REG_FREQ_MAX / BB_FREQ_MAX)\
			      : 1)

99 100 101
/* Indexed by n, gives number of times (REG n) is set.
   ??? both regscan and flow allocate space for this.  We should settle
   on just copy.  */
Richard Kenner committed
102

103
#define REG_N_SETS(N) (VARRAY_REG (reg_n_info, N)->sets)
Richard Kenner committed
104 105 106 107 108 109 110

/* Indexed by N, gives number of insns in which register N dies.
   Note that if register N is live around loops, it can die
   in transitions between basic blocks, and that is not counted here.
   So this is only a reliable indicator of how many regions of life there are
   for registers that are contained in one basic block.  */

111
#define REG_N_DEATHS(N) (VARRAY_REG (reg_n_info, N)->deaths)
Richard Kenner committed
112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129

/* Get the number of consecutive words required to hold pseudo-reg N.  */

#define PSEUDO_REGNO_SIZE(N) \
  ((GET_MODE_SIZE (PSEUDO_REGNO_MODE (N)) + UNITS_PER_WORD - 1)		\
   / UNITS_PER_WORD)

/* Get the number of bytes required to hold pseudo-reg N.  */

#define PSEUDO_REGNO_BYTES(N) \
  GET_MODE_SIZE (PSEUDO_REGNO_MODE (N))

/* Get the machine mode of pseudo-reg N.  */

#define PSEUDO_REGNO_MODE(N) GET_MODE (regno_reg_rtx[N])

/* Indexed by N, gives number of CALL_INSNS across which (REG n) is live.  */

130
#define REG_N_CALLS_CROSSED(N) (VARRAY_REG (reg_n_info, N)->calls_crossed)
Richard Kenner committed
131 132 133 134 135 136 137 138 139 140 141 142 143

/* Total number of instructions at which (REG n) is live.
   The larger this is, the less priority (REG n) gets for
   allocation in a hard register (in global-alloc).
   This is set in flow.c and remains valid for the rest of the compilation
   of the function; it is used to control register allocation.

   local-alloc.c may alter this number to change the priority.

   Negative values are special.
   -1 is used to mark a pseudo reg which has a constant or memory equivalent
   and is used infrequently enough that it should not get a hard register.
   -2 is used to mark a pseudo reg for a parameter, when a frame pointer
144
   is not required.  global.c makes an allocno for this but does
Richard Kenner committed
145 146
   not try to assign a hard register to it.  */

147
#define REG_LIVE_LENGTH(N) (VARRAY_REG (reg_n_info, N)->live_length)
Richard Kenner committed
148 149

/* Vector of substitutions of register numbers,
150 151 152 153
   used to map pseudo regs into hardware regs.

   This can't be folded into reg_n_info without changing all of the
   machine dependent directories, since the reload functions
154
   in the machine dependent files access it.  */
Richard Kenner committed
155 156 157

extern short *reg_renumber;

158
/* Vector indexed by hardware reg saying whether that reg is ever used.  */
Richard Kenner committed
159 160 161

extern char regs_ever_live[FIRST_PSEUDO_REGISTER];

162 163 164 165
/* Like regs_ever_live, but saying whether reg is set by asm statements.  */

extern char regs_asm_clobbered[FIRST_PSEUDO_REGISTER];

Doug Evans committed
166 167 168 169 170 171 172
/* For each hard register, the widest mode object that it can contain.
   This will be a MODE_INT mode if the register can hold integers.  Otherwise
   it will be a MODE_FLOAT or a MODE_CC mode, whichever is valid for the
   register.  */

extern enum machine_mode reg_raw_mode[FIRST_PSEUDO_REGISTER];

Richard Kenner committed
173 174 175 176 177
/* Vector indexed by regno; gives uid of first insn using that reg.
   This is computed by reg_scan for use by cse and loop.
   It is sometimes adjusted for subsequent changes during loop,
   but not adjusted by cse even if cse invalidates it.  */

178
#define REGNO_FIRST_UID(N) (VARRAY_REG (reg_n_info, N)->first_uid)
Richard Kenner committed
179 180 181 182 183 184 185

/* Vector indexed by regno; gives uid of last insn using that reg.
   This is computed by reg_scan for use by cse and loop.
   It is sometimes adjusted for subsequent changes during loop,
   but not adjusted by cse even if cse invalidates it.
   This is harmless since cse won't scan through a loop end.  */

186
#define REGNO_LAST_UID(N) (VARRAY_REG (reg_n_info, N)->last_uid)
Richard Kenner committed
187

188 189
/* Similar, but includes insns that mention the reg in their notes.  */

190
#define REGNO_LAST_NOTE_UID(N) (VARRAY_REG (reg_n_info, N)->last_note_uid)
191

Richard Kenner committed
192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207
/* List made of EXPR_LIST rtx's which gives pairs of pseudo registers
   that have to go in the same hard reg.  */
extern rtx regs_may_share;

/* Flag set by local-alloc or global-alloc if they decide to allocate
   something in a call-clobbered register.  */

extern int caller_save_needed;

/* Predicate to decide whether to give a hard reg to a pseudo which
   is referenced REFS times and would need to be saved and restored
   around a call CALLS times.  */

#ifndef CALLER_SAVE_PROFITABLE
#define CALLER_SAVE_PROFITABLE(REFS, CALLS)  (4 * (CALLS) < (REFS))
#endif
208

209 210 211 212 213 214
/* On most machines a register class is likely to be spilled if it
   only has one register.  */
#ifndef CLASS_LIKELY_SPILLED_P
#define CLASS_LIKELY_SPILLED_P(CLASS) (reg_class_size[(int) (CLASS)] == 1)
#endif

215 216
/* Select a register mode required for caller save of hard regno REGNO.  */
#ifndef HARD_REGNO_CALLER_SAVE_MODE
217
#define HARD_REGNO_CALLER_SAVE_MODE(REGNO, NREGS, MODE) \
218
  choose_hard_reg_mode (REGNO, NREGS, false)
219 220
#endif

221
/* Registers that get partially clobbered by a call in a given mode.
222 223 224 225 226
   These must not be call used registers.  */
#ifndef HARD_REGNO_CALL_PART_CLOBBERED
#define HARD_REGNO_CALL_PART_CLOBBERED(REGNO, MODE) 0
#endif

227
/* Allocate reg_n_info tables */
228
extern void allocate_reg_info (size_t, int, int);
229 230 231

/* Specify number of hard registers given machine mode occupy.  */
extern unsigned char hard_regno_nregs[FIRST_PSEUDO_REGISTER][MAX_MACHINE_MODE];
232 233

#endif /* GCC_REGS_H */