Update version
[official-gcc.git] / gcc / integrate.h
blob52c300424fa0b3aa3ce1ecb1fd5b332fd2ba243c
1 /* Function integration definitions for GNU C-Compiler
2 Copyright (C) 1990, 1995, 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
9 any later version.
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
21 #include "varray.h"
23 /* This structure is used to remap objects in the function being inlined to
24 those belonging to the calling function. It is passed by
25 expand_inline_function to its children.
27 This structure is also used when unrolling loops and otherwise
28 replicating code, although not all fields are needed in this case;
29 only those fields needed by copy_rtx_and_substitute() and its children
30 are used.
32 This structure is used instead of static variables because
33 expand_inline_function may be called recursively via expand_expr. */
35 struct inline_remap
37 /* True if we are doing function integration, false otherwise.
38 Used to control whether RTX_UNCHANGING bits are copied by
39 copy_rtx_and_substitute. */
40 int integrating;
41 /* Definition of function be inlined. */
42 union tree_node *fndecl;
43 /* Place to put insns needed at start of function. */
44 rtx insns_at_start;
45 /* Mapping from old BLOCKs to new BLOCKs. */
46 varray_type block_map;
47 /* Mapping from old registers to new registers.
48 It is allocated and deallocated in `expand_inline_function' */
49 rtx *reg_map;
50 #if defined (LEAF_REGISTERS) && defined (LEAF_REG_REMAP)
51 /* Mapping from old leaf registers to new leaf registers. */
52 rtx leaf_reg_map[FIRST_PSEUDO_REGISTER][NUM_MACHINE_MODES];
53 #endif
54 /* Mapping from old code-labels to new code-labels.
55 The first element of this map is label_map[min_labelno]. */
56 rtx *label_map;
57 /* Mapping from old insn uid's to copied insns. The first element
58 of this map is insn_map[min_insnno]; the last element is
59 insn_map[max_insnno]. We keep the bounds here for when the map
60 only covers a partial range of insns (such as loop unrolling or
61 code replication). */
62 rtx *insn_map;
63 int min_insnno, max_insnno;
65 /* Map pseudo reg number in calling function to equivalent constant. We
66 cannot in general substitute constants into parameter pseudo registers,
67 since some machine descriptions (many RISCs) won't always handle
68 the resulting insns. So if an incoming parameter has a constant
69 equivalent, we record it here, and if the resulting insn is
70 recognizable, we go with it.
72 We also use this mechanism to convert references to incoming arguments
73 and stacked variables. copy_rtx_and_substitute will replace the virtual
74 incoming argument and virtual stacked variables registers with new
75 pseudos that contain pointers into the replacement area allocated for
76 this inline instance. These pseudos are then marked as being equivalent
77 to the appropriate address and substituted if valid. */
78 varray_type const_equiv_varray;
79 /* This is incremented for each new basic block.
80 It is used to store in the age field to record the domain of validity
81 of each entry in const_equiv_varray.
82 A value of -1 indicates an entry for a reg which is a parm.
83 All other values are "positive". */
84 #define CONST_AGE_PARM (-1)
85 unsigned int const_age;
87 /* Target of the inline function being expanded, or NULL if none. */
88 rtx inline_target;
89 /* When an insn is being copied by copy_rtx_and_substitute,
90 this is nonzero if we have copied an ASM_OPERANDS.
91 In that case, it is the original input-operand vector. */
92 rtvec orig_asm_operands_vector;
93 /* When an insn is being copied by copy_rtx_and_substitute,
94 this is nonzero if we have copied an ASM_OPERANDS.
95 In that case, it is the copied input-operand vector. */
96 rtvec copy_asm_operands_vector;
97 /* Likewise, this is the copied constraints vector. */
98 rtvec copy_asm_constraints_vector;
100 /* Target of a return insn, if needed and inlining. */
101 rtx local_return_label;
103 /* Indications for regs being pointers and their alignment. */
104 unsigned char *regno_pointer_align;
105 rtx *x_regno_reg_rtx;
107 /* The next few fields are used for subst_constants to record the SETs
108 that it saw. */
109 int num_sets;
110 struct equiv_table
112 rtx dest;
113 rtx equiv;
114 } equiv_sets[MAX_RECOG_OPERANDS];
115 /* Record the last thing assigned to pc. This is used for folded
116 conditional branch insns. */
117 rtx last_pc_value;
118 #ifdef HAVE_cc0
119 /* Record the last thing assigned to cc0. */
120 rtx last_cc0_value;
121 #endif
122 /* Note mode of COMPARE if the mode would be otherwise lost (comparing of
123 two VOIDmode constants. */
124 rtx compare_src;
125 enum machine_mode compare_mode;
128 /* Return a copy of an rtx (as needed), substituting pseudo-register,
129 labels, and frame-pointer offsets as necessary. */
130 extern rtx copy_rtx_and_substitute PARAMS ((rtx, struct inline_remap *, int));
132 /* Copy a declaration when one function is substituted inline into
133 another. */
134 extern union tree_node *copy_decl_for_inlining PARAMS ((union tree_node *,
135 union tree_node *,
136 union tree_node *));
138 extern void try_constants PARAMS ((rtx, struct inline_remap *));
140 /* Return the label indicated. */
141 extern rtx get_label_from_map PARAMS ((struct inline_remap *, int));
143 /* Set the label indicated. */
144 #define set_label_in_map(MAP, I, X) ((MAP)->label_map[I] = (X))
146 /* Unfortunately, we need a global copy of const_equiv varray for
147 communication with a function called from note_stores. Be *very*
148 careful that this is used properly in the presence of recursion. */
150 extern varray_type global_const_equiv_varray;
152 #define MAYBE_EXTEND_CONST_EQUIV_VARRAY(MAP,MAX) \
154 if ((size_t)(MAX) >= VARRAY_SIZE ((MAP)->const_equiv_varray)) \
156 int is_global = (global_const_equiv_varray \
157 == (MAP)->const_equiv_varray); \
158 VARRAY_GROW ((MAP)->const_equiv_varray, (MAX)+1); \
159 if (is_global) \
160 global_const_equiv_varray = (MAP)->const_equiv_varray; \
164 #define SET_CONST_EQUIV_DATA(MAP,REG,RTX,AGE) \
166 struct const_equiv_data *p; \
167 MAYBE_EXTEND_CONST_EQUIV_VARRAY ((MAP), REGNO (REG)); \
168 p = &VARRAY_CONST_EQUIV ((MAP)->const_equiv_varray, REGNO (REG)); \
169 p->rtx = (RTX); \
170 p->age = (AGE); \