regs.h 7.52 KB
Newer Older
Richard Kenner committed
1
/* Define per-register tables for data flow info and register allocation.
Jeff Law committed
2 3
   Copyright (C) 1987, 1993, 1994, 1995, 1996, 1997, 1998,
   1999, 2000 Free Software Foundation, Inc.
Richard Kenner committed
4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

This file is part of GNU CC.

GNU CC 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.

GNU CC 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.

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


23
#include "varray.h"
Richard Kenner committed
24 25 26 27 28 29 30 31 32 33

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

/* Get the number of consecutive hard regs required to hold the REG rtx R.
   When something may be an explicit hard reg, REG_SIZE is the only
   valid way to get this value.  You cannot get it from the regno.  */

#define REG_SIZE(R) \
  ((mode_size[(int) GET_MODE (R)] + UNITS_PER_WORD - 1) / UNITS_PER_WORD)

Jeff Law committed
34 35 36 37
#ifndef SMALL_REGISTER_CLASSES
#define SMALL_REGISTER_CLASSES 0
#endif

Richard Kenner committed
38 39 40 41
/* Maximum register number used in this function, plus one.  */

extern int max_regno;

42
/* Register information indexed by register number */
43 44
typedef struct reg_info_def
{				/* fields set by reg_scan */
45 46 47 48
  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) */

49
				/* fields set by reg_scan & flow_analysis */
50 51 52 53 54 55 56 57 58 59 60
  int sets;			/* # of times (REG n) is set */

				/* fields set by flow_analysis */
  int refs;			/* # of times (REG n) is used or set */
  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 */
  char changes_size;		/* whether (SUBREG (REG n)) changes size */
} reg_info;

61
extern varray_type reg_n_info;
62

Richard Kenner committed
63 64 65
/* Indexed by n, gives number of times (REG n) is used or set.
   References within loops may be counted more times.  */

66
#define REG_N_REFS(N) (VARRAY_REG (reg_n_info, N)->refs)
Richard Kenner committed
67

68 69 70
/* 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
71

72
#define REG_N_SETS(N) (VARRAY_REG (reg_n_info, N)->sets)
Richard Kenner committed
73 74 75 76 77 78 79

/* 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.  */

80
#define REG_N_DEATHS(N) (VARRAY_REG (reg_n_info, N)->deaths)
Richard Kenner committed
81

Richard Kenner committed
82
/* Indexed by N; says whether a pseudo register N was ever used
83 84 85
   within a SUBREG that changes the size of the reg.  Some machines prohibit
   such objects to be in certain (usually floating-point) registers.  */

86
#define REG_CHANGES_SIZE(N) (VARRAY_REG (reg_n_info, N)->changes_size)
87

Richard Kenner committed
88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104
/* 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.  */

105
#define REG_N_CALLS_CROSSED(N) (VARRAY_REG (reg_n_info, N)->calls_crossed)
Richard Kenner committed
106 107 108 109 110 111 112 113 114 115 116 117 118

/* 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
119
   is not required.  global.c makes an allocno for this but does
Richard Kenner committed
120 121
   not try to assign a hard register to it.  */

122
#define REG_LIVE_LENGTH(N) (VARRAY_REG (reg_n_info, N)->live_length)
Richard Kenner committed
123 124

/* Vector of substitutions of register numbers,
125 126 127 128
   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
129
   in the machine dependent files access it.  */
Richard Kenner committed
130 131 132 133 134 135 136 137 138 139

extern short *reg_renumber;

/* Vector indexed by hardware reg
   saying whether that reg is ever used.  */

extern char regs_ever_live[FIRST_PSEUDO_REGISTER];

/* Vector indexed by hardware reg giving its name.  */

140
extern const char *reg_names[FIRST_PSEUDO_REGISTER];
Richard Kenner committed
141

Doug Evans committed
142 143 144 145 146 147 148
/* 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
149 150 151 152 153
/* 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.  */

154
#define REGNO_FIRST_UID(N) (VARRAY_REG (reg_n_info, N)->first_uid)
Richard Kenner committed
155 156 157 158 159 160 161

/* 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.  */

162
#define REGNO_LAST_UID(N) (VARRAY_REG (reg_n_info, N)->last_uid)
Richard Kenner committed
163

164 165
/* Similar, but includes insns that mention the reg in their notes.  */

166
#define REGNO_LAST_NOTE_UID(N) (VARRAY_REG (reg_n_info, N)->last_note_uid)
167

Richard Kenner committed
168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183
/* 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
184

185 186 187 188 189 190
/* 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

191 192 193 194 195 196
/* Select a register mode required for caller save of hard regno REGNO.  */
#ifndef HARD_REGNO_CALLER_SAVE_MODE
#define HARD_REGNO_CALLER_SAVE_MODE(REGNO, NREGS) \
  choose_hard_reg_mode (REGNO, NREGS)
#endif

197 198 199 200 201 202
/* Registers that get partially clobbered by a call in a given mode. 
   These must not be call used registers.  */
#ifndef HARD_REGNO_CALL_PART_CLOBBERED
#define HARD_REGNO_CALL_PART_CLOBBERED(REGNO, MODE) 0
#endif

203
/* Allocate reg_n_info tables */
204
extern void allocate_reg_info PARAMS ((size_t, int, int));