]>
Commit | Line | Data |
---|---|---|
1322177d | 1 | /* Procedure integration for GCC. |
3c71940f | 2 | Copyright (C) 1988, 1991, 1993, 1994, 1995, 1996, 1997, 1998, |
c28abdf0 | 3 | 1999, 2000, 2001, 2002 Free Software Foundation, Inc. |
175160e7 MT |
4 | Contributed by Michael Tiemann (tiemann@cygnus.com) |
5 | ||
1322177d | 6 | This file is part of GCC. |
175160e7 | 7 | |
1322177d LB |
8 | GCC is free software; you can redistribute it and/or modify it under |
9 | the terms of the GNU General Public License as published by the Free | |
10 | Software Foundation; either version 2, or (at your option) any later | |
11 | version. | |
175160e7 | 12 | |
1322177d LB |
13 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
14 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 | for more details. | |
175160e7 MT |
17 | |
18 | You should have received a copy of the GNU General Public License | |
1322177d LB |
19 | along with GCC; see the file COPYING. If not, write to the Free |
20 | Software Foundation, 59 Temple Place - Suite 330, Boston, MA | |
21 | 02111-1307, USA. */ | |
175160e7 | 22 | |
175160e7 | 23 | #include "config.h" |
670ee920 | 24 | #include "system.h" |
ccd043a9 | 25 | |
175160e7 MT |
26 | #include "rtl.h" |
27 | #include "tree.h" | |
6baf1cc8 | 28 | #include "tm_p.h" |
12307ca2 | 29 | #include "regs.h" |
175160e7 | 30 | #include "flags.h" |
135d50f1 | 31 | #include "debug.h" |
175160e7 | 32 | #include "insn-config.h" |
175160e7 MT |
33 | #include "expr.h" |
34 | #include "output.h" | |
e9a25f70 | 35 | #include "recog.h" |
175160e7 MT |
36 | #include "integrate.h" |
37 | #include "real.h" | |
6adb4e3a | 38 | #include "except.h" |
175160e7 | 39 | #include "function.h" |
d6f4ec51 | 40 | #include "toplev.h" |
ab87f8c8 | 41 | #include "intl.h" |
e6fd097e | 42 | #include "loop.h" |
c6d9a88c | 43 | #include "params.h" |
c0e7830f | 44 | #include "ggc.h" |
91d231cb | 45 | #include "target.h" |
63e1b1c4 | 46 | #include "langhooks.h" |
175160e7 MT |
47 | |
48 | #include "obstack.h" | |
49 | #define obstack_chunk_alloc xmalloc | |
50 | #define obstack_chunk_free free | |
175160e7 MT |
51 | |
52 | extern struct obstack *function_maybepermanent_obstack; | |
53 | ||
175160e7 MT |
54 | /* Similar, but round to the next highest integer that meets the |
55 | alignment. */ | |
56 | #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1)) | |
57 | ||
58 | /* Default max number of insns a function can have and still be inline. | |
59 | This is overridden on RISC machines. */ | |
60 | #ifndef INTEGRATE_THRESHOLD | |
aec98e42 ML |
61 | /* Inlining small functions might save more space then not inlining at |
62 | all. Assume 1 instruction for the call and 1.5 insns per argument. */ | |
175160e7 | 63 | #define INTEGRATE_THRESHOLD(DECL) \ |
aec98e42 | 64 | (optimize_size \ |
c51262cf | 65 | ? (1 + (3 * list_length (DECL_ARGUMENTS (DECL))) / 2) \ |
aec98e42 | 66 | : (8 * (8 + list_length (DECL_ARGUMENTS (DECL))))) |
175160e7 MT |
67 | #endif |
68 | \f | |
c0e7830f | 69 | |
dc297297 | 70 | /* Private type used by {get/has}_func_hard_reg_initial_val. */ |
e2500fed | 71 | typedef struct initial_value_pair GTY(()) { |
c0e7830f DD |
72 | rtx hard_reg; |
73 | rtx pseudo; | |
74 | } initial_value_pair; | |
e2500fed | 75 | typedef struct initial_value_struct GTY(()) { |
c0e7830f DD |
76 | int num_entries; |
77 | int max_entries; | |
e2500fed | 78 | initial_value_pair * GTY ((length ("%h.num_entries"))) entries; |
c0e7830f DD |
79 | } initial_value_struct; |
80 | ||
81 | static void setup_initial_hard_reg_value_integration PARAMS ((struct function *, struct inline_remap *)); | |
82 | ||
3fe41456 KG |
83 | static rtvec initialize_for_inline PARAMS ((tree)); |
84 | static void note_modified_parmregs PARAMS ((rtx, rtx, void *)); | |
85 | static void integrate_parm_decls PARAMS ((tree, struct inline_remap *, | |
0a1c58a2 | 86 | rtvec)); |
3fe41456 | 87 | static tree integrate_decl_tree PARAMS ((tree, |
0a1c58a2 | 88 | struct inline_remap *)); |
3fe41456 | 89 | static void subst_constants PARAMS ((rtx *, rtx, |
0a1c58a2 | 90 | struct inline_remap *, int)); |
3fe41456 | 91 | static void set_block_origin_self PARAMS ((tree)); |
3fe41456 KG |
92 | static void set_block_abstract_flags PARAMS ((tree, int)); |
93 | static void process_reg_param PARAMS ((struct inline_remap *, rtx, | |
0a1c58a2 | 94 | rtx)); |
3fe41456 | 95 | void set_decl_abstract_flags PARAMS ((tree, int)); |
3fe41456 | 96 | static void mark_stores PARAMS ((rtx, rtx, void *)); |
0a1c58a2 JL |
97 | static void save_parm_insns PARAMS ((rtx, rtx)); |
98 | static void copy_insn_list PARAMS ((rtx, struct inline_remap *, | |
99 | rtx)); | |
52a11cbf RH |
100 | static void copy_insn_notes PARAMS ((rtx, struct inline_remap *, |
101 | int)); | |
3fe41456 KG |
102 | static int compare_blocks PARAMS ((const PTR, const PTR)); |
103 | static int find_block PARAMS ((const PTR, const PTR)); | |
f9e814f1 | 104 | |
36edd3cc BS |
105 | /* Used by copy_rtx_and_substitute; this indicates whether the function is |
106 | called for the purpose of inlining or some other purpose (i.e. loop | |
107 | unrolling). This affects how constant pool references are handled. | |
108 | This variable contains the FUNCTION_DECL for the inlined function. */ | |
109 | static struct function *inlining = 0; | |
175160e7 | 110 | \f |
1f3d3a31 | 111 | /* Returns the Ith entry in the label_map contained in MAP. If the |
e5e809f4 JL |
112 | Ith entry has not yet been set, return a fresh label. This function |
113 | performs a lazy initialization of label_map, thereby avoiding huge memory | |
114 | explosions when the label_map gets very large. */ | |
115 | ||
1f3d3a31 JL |
116 | rtx |
117 | get_label_from_map (map, i) | |
e5e809f4 | 118 | struct inline_remap *map; |
1f3d3a31 JL |
119 | int i; |
120 | { | |
121 | rtx x = map->label_map[i]; | |
122 | ||
123 | if (x == NULL_RTX) | |
00174bdf | 124 | x = map->label_map[i] = gen_label_rtx (); |
1f3d3a31 JL |
125 | |
126 | return x; | |
127 | } | |
128 | ||
91d231cb JM |
129 | /* Return false if the function FNDECL cannot be inlined on account of its |
130 | attributes, true otherwise. */ | |
588d3ade | 131 | bool |
91d231cb JM |
132 | function_attribute_inlinable_p (fndecl) |
133 | tree fndecl; | |
134 | { | |
b9a26d09 | 135 | if (targetm.attribute_table) |
91d231cb | 136 | { |
b9a26d09 | 137 | tree a; |
91d231cb | 138 | |
b9a26d09 | 139 | for (a = DECL_ATTRIBUTES (fndecl); a; a = TREE_CHAIN (a)) |
91d231cb | 140 | { |
b9a26d09 NB |
141 | tree name = TREE_PURPOSE (a); |
142 | int i; | |
143 | ||
144 | for (i = 0; targetm.attribute_table[i].name != NULL; i++) | |
145 | if (is_attribute_p (targetm.attribute_table[i].name, name)) | |
146 | return (*targetm.function_attribute_inlinable_p) (fndecl); | |
91d231cb | 147 | } |
91d231cb JM |
148 | } |
149 | ||
b9a26d09 | 150 | return true; |
91d231cb JM |
151 | } |
152 | ||
175160e7 MT |
153 | /* Zero if the current function (whose FUNCTION_DECL is FNDECL) |
154 | is safe and reasonable to integrate into other functions. | |
ab87f8c8 | 155 | Nonzero means value is a warning msgid with a single %s |
175160e7 MT |
156 | for the function's name. */ |
157 | ||
dff01034 | 158 | const char * |
175160e7 | 159 | function_cannot_inline_p (fndecl) |
b3694847 | 160 | tree fndecl; |
175160e7 | 161 | { |
b3694847 | 162 | rtx insn; |
175160e7 | 163 | tree last = tree_last (TYPE_ARG_TYPES (TREE_TYPE (fndecl))); |
f9e814f1 TP |
164 | |
165 | /* For functions marked as inline increase the maximum size to | |
c6d9a88c | 166 | MAX_INLINE_INSNS (-finline-limit-<n>). For regular functions |
f9e814f1 TP |
167 | use the limit given by INTEGRATE_THRESHOLD. */ |
168 | ||
169 | int max_insns = (DECL_INLINE (fndecl)) | |
c6d9a88c | 170 | ? (MAX_INLINE_INSNS |
f9e814f1 TP |
171 | + 8 * list_length (DECL_ARGUMENTS (fndecl))) |
172 | : INTEGRATE_THRESHOLD (fndecl); | |
173 | ||
b3694847 SS |
174 | int ninsns = 0; |
175 | tree parms; | |
175160e7 | 176 | |
5daf7c0a JM |
177 | if (DECL_UNINLINABLE (fndecl)) |
178 | return N_("function cannot be inline"); | |
179 | ||
e5e809f4 | 180 | /* No inlines with varargs. */ |
175160e7 | 181 | if ((last && TREE_VALUE (last) != void_type_node) |
5d3fe1fe | 182 | || current_function_varargs) |
ab87f8c8 | 183 | return N_("varargs function cannot be inline"); |
175160e7 MT |
184 | |
185 | if (current_function_calls_alloca) | |
ab87f8c8 | 186 | return N_("function using alloca cannot be inline"); |
175160e7 | 187 | |
cd8cee7b RH |
188 | if (current_function_calls_setjmp) |
189 | return N_("function using setjmp cannot be inline"); | |
190 | ||
52a11cbf RH |
191 | if (current_function_calls_eh_return) |
192 | return N_("function uses __builtin_eh_return"); | |
193 | ||
175160e7 | 194 | if (current_function_contains_functions) |
ab87f8c8 | 195 | return N_("function with nested functions cannot be inline"); |
175160e7 | 196 | |
b9096844 | 197 | if (forced_labels) |
14a774a9 RK |
198 | return |
199 | N_("function with label addresses used in initializers cannot inline"); | |
b9096844 | 200 | |
aeb302bb JM |
201 | if (current_function_cannot_inline) |
202 | return current_function_cannot_inline; | |
203 | ||
175160e7 | 204 | /* If its not even close, don't even look. */ |
f9e814f1 | 205 | if (get_max_uid () > 3 * max_insns) |
ab87f8c8 | 206 | return N_("function too large to be inline"); |
175160e7 | 207 | |
175160e7 MT |
208 | #if 0 |
209 | /* Don't inline functions which do not specify a function prototype and | |
210 | have BLKmode argument or take the address of a parameter. */ | |
211 | for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms)) | |
212 | { | |
213 | if (TYPE_MODE (TREE_TYPE (parms)) == BLKmode) | |
214 | TREE_ADDRESSABLE (parms) = 1; | |
215 | if (last == NULL_TREE && TREE_ADDRESSABLE (parms)) | |
ab87f8c8 | 216 | return N_("no prototype, and parameter address used; cannot be inline"); |
175160e7 MT |
217 | } |
218 | #endif | |
219 | ||
220 | /* We can't inline functions that return structures | |
221 | the old-fashioned PCC way, copying into a static block. */ | |
222 | if (current_function_returns_pcc_struct) | |
ab87f8c8 | 223 | return N_("inline functions not supported for this return value type"); |
175160e7 MT |
224 | |
225 | /* We can't inline functions that return structures of varying size. */ | |
f8013343 MM |
226 | if (TREE_CODE (TREE_TYPE (TREE_TYPE (fndecl))) != VOID_TYPE |
227 | && int_size_in_bytes (TREE_TYPE (TREE_TYPE (fndecl))) < 0) | |
ab87f8c8 | 228 | return N_("function with varying-size return value cannot be inline"); |
175160e7 | 229 | |
c8ad69c1 RK |
230 | /* Cannot inline a function with a varying size argument or one that |
231 | receives a transparent union. */ | |
175160e7 | 232 | for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms)) |
c8ad69c1 RK |
233 | { |
234 | if (int_size_in_bytes (TREE_TYPE (parms)) < 0) | |
ab87f8c8 | 235 | return N_("function with varying-size parameter cannot be inline"); |
2bf105ab RK |
236 | else if (TREE_CODE (TREE_TYPE (parms)) == UNION_TYPE |
237 | && TYPE_TRANSPARENT_UNION (TREE_TYPE (parms))) | |
ab87f8c8 | 238 | return N_("function with transparent unit parameter cannot be inline"); |
c8ad69c1 | 239 | } |
175160e7 | 240 | |
f9e814f1 | 241 | if (get_max_uid () > max_insns) |
175160e7 | 242 | { |
12307ca2 RK |
243 | for (ninsns = 0, insn = get_first_nonparm_insn (); |
244 | insn && ninsns < max_insns; | |
175160e7 | 245 | insn = NEXT_INSN (insn)) |
2c3c49de | 246 | if (INSN_P (insn)) |
12307ca2 | 247 | ninsns++; |
175160e7 MT |
248 | |
249 | if (ninsns >= max_insns) | |
ab87f8c8 | 250 | return N_("function too large to be inline"); |
175160e7 MT |
251 | } |
252 | ||
acd693d1 RH |
253 | /* We will not inline a function which uses computed goto. The addresses of |
254 | its local labels, which may be tucked into global storage, are of course | |
255 | not constant across instantiations, which causes unexpected behaviour. */ | |
256 | if (current_function_has_computed_jump) | |
257 | return N_("function with computed jump cannot inline"); | |
ead02915 | 258 | |
2edc3b33 JW |
259 | /* We cannot inline a nested function that jumps to a nonlocal label. */ |
260 | if (current_function_has_nonlocal_goto) | |
ab87f8c8 | 261 | return N_("function with nonlocal goto cannot be inline"); |
2edc3b33 | 262 | |
64ed0f40 | 263 | /* We can't inline functions that return a PARALLEL rtx. */ |
19e7881c MM |
264 | if (DECL_RTL_SET_P (DECL_RESULT (fndecl))) |
265 | { | |
266 | rtx result = DECL_RTL (DECL_RESULT (fndecl)); | |
267 | if (GET_CODE (result) == PARALLEL) | |
268 | return N_("inline functions not supported for this return value type"); | |
269 | } | |
64ed0f40 | 270 | |
b36f4ed3 NC |
271 | /* If the function has a target specific attribute attached to it, |
272 | then we assume that we should not inline it. This can be overriden | |
91d231cb JM |
273 | by the target if it defines TARGET_FUNCTION_ATTRIBUTE_INLINABLE_P. */ |
274 | if (!function_attribute_inlinable_p (fndecl)) | |
b36f4ed3 NC |
275 | return N_("function with target specific attribute(s) cannot be inlined"); |
276 | ||
277 | return NULL; | |
175160e7 MT |
278 | } |
279 | \f | |
175160e7 MT |
280 | /* Map pseudo reg number into the PARM_DECL for the parm living in the reg. |
281 | Zero for a reg that isn't a parm's home. | |
282 | Only reg numbers less than max_parm_reg are mapped here. */ | |
283 | static tree *parmdecl_map; | |
284 | ||
175160e7 MT |
285 | /* In save_for_inline, nonzero if past the parm-initialization insns. */ |
286 | static int in_nonparm_insns; | |
287 | \f | |
f93dacbd | 288 | /* Subroutine for `save_for_inline'. Performs initialization |
175160e7 | 289 | needed to save FNDECL's insns and info for future inline expansion. */ |
36edd3cc | 290 | |
49ad7cfa | 291 | static rtvec |
36edd3cc | 292 | initialize_for_inline (fndecl) |
175160e7 | 293 | tree fndecl; |
175160e7 | 294 | { |
49ad7cfa | 295 | int i; |
175160e7 MT |
296 | rtvec arg_vector; |
297 | tree parms; | |
298 | ||
175160e7 | 299 | /* Clear out PARMDECL_MAP. It was allocated in the caller's frame. */ |
961192e1 | 300 | memset ((char *) parmdecl_map, 0, max_parm_reg * sizeof (tree)); |
175160e7 MT |
301 | arg_vector = rtvec_alloc (list_length (DECL_ARGUMENTS (fndecl))); |
302 | ||
303 | for (parms = DECL_ARGUMENTS (fndecl), i = 0; | |
304 | parms; | |
305 | parms = TREE_CHAIN (parms), i++) | |
306 | { | |
307 | rtx p = DECL_RTL (parms); | |
308 | ||
8a173c73 RK |
309 | /* If we have (mem (addressof (mem ...))), use the inner MEM since |
310 | otherwise the copy_rtx call below will not unshare the MEM since | |
311 | it shares ADDRESSOF. */ | |
312 | if (GET_CODE (p) == MEM && GET_CODE (XEXP (p, 0)) == ADDRESSOF | |
313 | && GET_CODE (XEXP (XEXP (p, 0), 0)) == MEM) | |
314 | p = XEXP (XEXP (p, 0), 0); | |
315 | ||
175160e7 MT |
316 | RTVEC_ELT (arg_vector, i) = p; |
317 | ||
318 | if (GET_CODE (p) == REG) | |
319 | parmdecl_map[REGNO (p)] = parms; | |
f231e307 RK |
320 | else if (GET_CODE (p) == CONCAT) |
321 | { | |
322 | rtx preal = gen_realpart (GET_MODE (XEXP (p, 0)), p); | |
323 | rtx pimag = gen_imagpart (GET_MODE (preal), p); | |
324 | ||
325 | if (GET_CODE (preal) == REG) | |
326 | parmdecl_map[REGNO (preal)] = parms; | |
327 | if (GET_CODE (pimag) == REG) | |
328 | parmdecl_map[REGNO (pimag)] = parms; | |
329 | } | |
330 | ||
048dfa64 RS |
331 | /* This flag is cleared later |
332 | if the function ever modifies the value of the parm. */ | |
175160e7 MT |
333 | TREE_READONLY (parms) = 1; |
334 | } | |
335 | ||
49ad7cfa | 336 | return arg_vector; |
175160e7 MT |
337 | } |
338 | ||
94755d92 | 339 | /* Copy NODE (which must be a DECL, but not a PARM_DECL). The DECL |
00174bdf | 340 | originally was in the FROM_FN, but now it will be in the |
94755d92 | 341 | TO_FN. */ |
02e24c7a | 342 | |
94755d92 MM |
343 | tree |
344 | copy_decl_for_inlining (decl, from_fn, to_fn) | |
345 | tree decl; | |
346 | tree from_fn; | |
347 | tree to_fn; | |
02e24c7a | 348 | { |
94755d92 MM |
349 | tree copy; |
350 | ||
351 | /* Copy the declaration. */ | |
352 | if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL) | |
a8f8d1cc MM |
353 | { |
354 | /* For a parameter, we must make an equivalent VAR_DECL, not a | |
355 | new PARM_DECL. */ | |
356 | copy = build_decl (VAR_DECL, DECL_NAME (decl), TREE_TYPE (decl)); | |
357 | TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl); | |
8eec72ec JM |
358 | TREE_READONLY (copy) = TREE_READONLY (decl); |
359 | TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl); | |
a8f8d1cc | 360 | } |
94755d92 MM |
361 | else |
362 | { | |
363 | copy = copy_node (decl); | |
63e1b1c4 | 364 | (*lang_hooks.dup_lang_specific_decl) (copy); |
a71811fe MM |
365 | |
366 | /* TREE_ADDRESSABLE isn't used to indicate that a label's | |
367 | address has been taken; it's for internal bookkeeping in | |
368 | expand_goto_internal. */ | |
369 | if (TREE_CODE (copy) == LABEL_DECL) | |
370 | TREE_ADDRESSABLE (copy) = 0; | |
94755d92 MM |
371 | } |
372 | ||
373 | /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what | |
374 | declaration inspired this copy. */ | |
375 | DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl); | |
376 | ||
377 | /* The new variable/label has no RTL, yet. */ | |
19e7881c | 378 | SET_DECL_RTL (copy, NULL_RTX); |
94755d92 MM |
379 | |
380 | /* These args would always appear unused, if not for this. */ | |
381 | TREE_USED (copy) = 1; | |
382 | ||
383 | /* Set the context for the new declaration. */ | |
384 | if (!DECL_CONTEXT (decl)) | |
385 | /* Globals stay global. */ | |
00174bdf | 386 | ; |
94755d92 MM |
387 | else if (DECL_CONTEXT (decl) != from_fn) |
388 | /* Things that weren't in the scope of the function we're inlining | |
389 | from aren't in the scope we're inlining too, either. */ | |
390 | ; | |
391 | else if (TREE_STATIC (decl)) | |
392 | /* Function-scoped static variables should say in the original | |
393 | function. */ | |
02e24c7a MM |
394 | ; |
395 | else | |
94755d92 MM |
396 | /* Ordinary automatic local variables are now in the scope of the |
397 | new function. */ | |
398 | DECL_CONTEXT (copy) = to_fn; | |
02e24c7a MM |
399 | |
400 | return copy; | |
401 | } | |
402 | ||
175160e7 MT |
403 | /* Make the insns and PARM_DECLs of the current function permanent |
404 | and record other information in DECL_SAVED_INSNS to allow inlining | |
405 | of this function in subsequent calls. | |
406 | ||
407 | This routine need not copy any insns because we are not going | |
408 | to immediately compile the insns in the insn chain. There | |
409 | are two cases when we would compile the insns for FNDECL: | |
410 | (1) when FNDECL is expanded inline, and (2) when FNDECL needs to | |
411 | be output at the end of other compilation, because somebody took | |
412 | its address. In the first case, the insns of FNDECL are copied | |
413 | as it is expanded inline, so FNDECL's saved insns are not | |
414 | modified. In the second case, FNDECL is used for the last time, | |
415 | so modifying the rtl is not a problem. | |
416 | ||
09578c27 RK |
417 | We don't have to worry about FNDECL being inline expanded by |
418 | other functions which are written at the end of compilation | |
419 | because flag_no_inline is turned on when we begin writing | |
420 | functions at the end of compilation. */ | |
175160e7 MT |
421 | |
422 | void | |
f93dacbd | 423 | save_for_inline (fndecl) |
175160e7 MT |
424 | tree fndecl; |
425 | { | |
426 | rtx insn; | |
49ad7cfa | 427 | rtvec argvec; |
175160e7 | 428 | rtx first_nonparm_insn; |
175160e7 MT |
429 | |
430 | /* Set up PARMDECL_MAP which maps pseudo-reg number to its PARM_DECL. | |
431 | Later we set TREE_READONLY to 0 if the parm is modified inside the fn. | |
432 | Also set up ARG_VECTOR, which holds the unmodified DECL_RTX values | |
433 | for the parms, prior to elimination of virtual registers. | |
434 | These values are needed for substituting parms properly. */ | |
4838c5ee AO |
435 | if (! flag_no_inline) |
436 | parmdecl_map = (tree *) xmalloc (max_parm_reg * sizeof (tree)); | |
175160e7 MT |
437 | |
438 | /* Make and emit a return-label if we have not already done so. */ | |
439 | ||
440 | if (return_label == 0) | |
441 | { | |
442 | return_label = gen_label_rtx (); | |
443 | emit_label (return_label); | |
444 | } | |
445 | ||
4838c5ee AO |
446 | if (! flag_no_inline) |
447 | argvec = initialize_for_inline (fndecl); | |
448 | else | |
449 | argvec = NULL; | |
175160e7 | 450 | |
4793dca1 JH |
451 | /* Delete basic block notes created by early run of find_basic_block. |
452 | The notes would be later used by find_basic_blocks to reuse the memory | |
453 | for basic_block structures on already freed obstack. */ | |
454 | for (insn = get_insns (); insn ; insn = NEXT_INSN (insn)) | |
455 | if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) == NOTE_INSN_BASIC_BLOCK) | |
53c17031 | 456 | delete_related_insns (insn); |
4793dca1 | 457 | |
175160e7 MT |
458 | /* If there are insns that copy parms from the stack into pseudo registers, |
459 | those insns are not copied. `expand_inline_function' must | |
460 | emit the correct code to handle such things. */ | |
461 | ||
462 | insn = get_insns (); | |
463 | if (GET_CODE (insn) != NOTE) | |
464 | abort (); | |
465 | ||
4838c5ee AO |
466 | if (! flag_no_inline) |
467 | { | |
468 | /* Get the insn which signals the end of parameter setup code. */ | |
469 | first_nonparm_insn = get_first_nonparm_insn (); | |
470 | ||
471 | /* Now just scan the chain of insns to see what happens to our | |
472 | PARM_DECLs. If a PARM_DECL is used but never modified, we | |
473 | can substitute its rtl directly when expanding inline (and | |
474 | perform constant folding when its incoming value is | |
475 | constant). Otherwise, we have to copy its value into a new | |
476 | register and track the new register's life. */ | |
477 | in_nonparm_insns = 0; | |
478 | save_parm_insns (insn, first_nonparm_insn); | |
479 | ||
480 | cfun->inl_max_label_num = max_label_num (); | |
481 | cfun->inl_last_parm_insn = cfun->x_last_parm_insn; | |
482 | cfun->original_arg_vector = argvec; | |
483 | } | |
01d939e8 | 484 | cfun->original_decl_initial = DECL_INITIAL (fndecl); |
f93dacbd | 485 | cfun->no_debugging_symbols = (write_symbols == NO_DEBUG); |
01d939e8 | 486 | DECL_SAVED_INSNS (fndecl) = cfun; |
67289ea6 MM |
487 | |
488 | /* Clean up. */ | |
4838c5ee AO |
489 | if (! flag_no_inline) |
490 | free (parmdecl_map); | |
175160e7 | 491 | } |
0a1c58a2 JL |
492 | |
493 | /* Scan the chain of insns to see what happens to our PARM_DECLs. If a | |
494 | PARM_DECL is used but never modified, we can substitute its rtl directly | |
495 | when expanding inline (and perform constant folding when its incoming | |
496 | value is constant). Otherwise, we have to copy its value into a new | |
497 | register and track the new register's life. */ | |
498 | ||
499 | static void | |
500 | save_parm_insns (insn, first_nonparm_insn) | |
00174bdf KH |
501 | rtx insn; |
502 | rtx first_nonparm_insn; | |
0a1c58a2 | 503 | { |
0a1c58a2 JL |
504 | if (insn == NULL_RTX) |
505 | return; | |
506 | ||
507 | for (insn = NEXT_INSN (insn); insn; insn = NEXT_INSN (insn)) | |
508 | { | |
509 | if (insn == first_nonparm_insn) | |
510 | in_nonparm_insns = 1; | |
511 | ||
2c3c49de | 512 | if (INSN_P (insn)) |
0a1c58a2 JL |
513 | { |
514 | /* Record what interesting things happen to our parameters. */ | |
515 | note_stores (PATTERN (insn), note_modified_parmregs, NULL); | |
516 | ||
517 | /* If this is a CALL_PLACEHOLDER insn then we need to look into the | |
518 | three attached sequences: normal call, sibling call and tail | |
00174bdf | 519 | recursion. */ |
0a1c58a2 JL |
520 | if (GET_CODE (insn) == CALL_INSN |
521 | && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER) | |
522 | { | |
523 | int i; | |
524 | ||
525 | for (i = 0; i < 3; i++) | |
526 | save_parm_insns (XEXP (PATTERN (insn), i), | |
527 | first_nonparm_insn); | |
528 | } | |
529 | } | |
530 | } | |
531 | } | |
175160e7 | 532 | \f |
175160e7 MT |
533 | /* Note whether a parameter is modified or not. */ |
534 | ||
535 | static void | |
84832317 | 536 | note_modified_parmregs (reg, x, data) |
175160e7 | 537 | rtx reg; |
487a6e06 | 538 | rtx x ATTRIBUTE_UNUSED; |
84832317 | 539 | void *data ATTRIBUTE_UNUSED; |
175160e7 MT |
540 | { |
541 | if (GET_CODE (reg) == REG && in_nonparm_insns | |
542 | && REGNO (reg) < max_parm_reg | |
543 | && REGNO (reg) >= FIRST_PSEUDO_REGISTER | |
544 | && parmdecl_map[REGNO (reg)] != 0) | |
545 | TREE_READONLY (parmdecl_map[REGNO (reg)]) = 0; | |
546 | } | |
547 | ||
175160e7 MT |
548 | /* Unfortunately, we need a global copy of const_equiv map for communication |
549 | with a function called from note_stores. Be *very* careful that this | |
550 | is used properly in the presence of recursion. */ | |
551 | ||
c68da89c | 552 | varray_type global_const_equiv_varray; |
175160e7 MT |
553 | \f |
554 | #define FIXED_BASE_PLUS_P(X) \ | |
555 | (GET_CODE (X) == PLUS && GET_CODE (XEXP (X, 1)) == CONST_INT \ | |
556 | && GET_CODE (XEXP (X, 0)) == REG \ | |
557 | && REGNO (XEXP (X, 0)) >= FIRST_VIRTUAL_REGISTER \ | |
f9b06ea4 | 558 | && REGNO (XEXP (X, 0)) <= LAST_VIRTUAL_REGISTER) |
175160e7 | 559 | |
a4c3ddd8 BS |
560 | /* Called to set up a mapping for the case where a parameter is in a |
561 | register. If it is read-only and our argument is a constant, set up the | |
562 | constant equivalence. | |
563 | ||
564 | If LOC is REG_USERVAR_P, the usual case, COPY must also have that flag set | |
565 | if it is a register. | |
566 | ||
567 | Also, don't allow hard registers here; they might not be valid when | |
568 | substituted into insns. */ | |
569 | static void | |
570 | process_reg_param (map, loc, copy) | |
571 | struct inline_remap *map; | |
572 | rtx loc, copy; | |
573 | { | |
574 | if ((GET_CODE (copy) != REG && GET_CODE (copy) != SUBREG) | |
575 | || (GET_CODE (copy) == REG && REG_USERVAR_P (loc) | |
576 | && ! REG_USERVAR_P (copy)) | |
577 | || (GET_CODE (copy) == REG | |
578 | && REGNO (copy) < FIRST_PSEUDO_REGISTER)) | |
579 | { | |
580 | rtx temp = copy_to_mode_reg (GET_MODE (loc), copy); | |
581 | REG_USERVAR_P (temp) = REG_USERVAR_P (loc); | |
c68da89c KR |
582 | if (CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy)) |
583 | SET_CONST_EQUIV_DATA (map, temp, copy, CONST_AGE_PARM); | |
a4c3ddd8 BS |
584 | copy = temp; |
585 | } | |
586 | map->reg_map[REGNO (loc)] = copy; | |
587 | } | |
e6cfb550 | 588 | |
a97901e6 | 589 | /* Compare two BLOCKs for qsort. The key we sort on is the |
0339d239 DD |
590 | BLOCK_ABSTRACT_ORIGIN of the blocks. We cannot just subtract the |
591 | two pointers, because it may overflow sizeof(int). */ | |
a97901e6 MM |
592 | |
593 | static int | |
594 | compare_blocks (v1, v2) | |
595 | const PTR v1; | |
596 | const PTR v2; | |
597 | { | |
47ee9bcb KG |
598 | tree b1 = *((const tree *) v1); |
599 | tree b2 = *((const tree *) v2); | |
0339d239 DD |
600 | char *p1 = (char *) BLOCK_ABSTRACT_ORIGIN (b1); |
601 | char *p2 = (char *) BLOCK_ABSTRACT_ORIGIN (b2); | |
a97901e6 | 602 | |
0339d239 DD |
603 | if (p1 == p2) |
604 | return 0; | |
605 | return p1 < p2 ? -1 : 1; | |
a97901e6 MM |
606 | } |
607 | ||
608 | /* Compare two BLOCKs for bsearch. The first pointer corresponds to | |
609 | an original block; the second to a remapped equivalent. */ | |
610 | ||
611 | static int | |
612 | find_block (v1, v2) | |
613 | const PTR v1; | |
614 | const PTR v2; | |
615 | { | |
47ee9bcb KG |
616 | const union tree_node *b1 = (const union tree_node *) v1; |
617 | tree b2 = *((const tree *) v2); | |
0339d239 DD |
618 | char *p1 = (char *) b1; |
619 | char *p2 = (char *) BLOCK_ABSTRACT_ORIGIN (b2); | |
a97901e6 | 620 | |
0339d239 DD |
621 | if (p1 == p2) |
622 | return 0; | |
623 | return p1 < p2 ? -1 : 1; | |
a97901e6 MM |
624 | } |
625 | ||
175160e7 MT |
626 | /* Integrate the procedure defined by FNDECL. Note that this function |
627 | may wind up calling itself. Since the static variables are not | |
628 | reentrant, we do not assign them until after the possibility | |
bfa30b22 | 629 | of recursion is eliminated. |
175160e7 MT |
630 | |
631 | If IGNORE is nonzero, do not produce a value. | |
632 | Otherwise store the value in TARGET if it is nonzero and that is convenient. | |
633 | ||
634 | Value is: | |
635 | (rtx)-1 if we could not substitute the function | |
636 | 0 if we substituted it and it does not produce a value | |
637 | else an rtx for where the value is stored. */ | |
638 | ||
639 | rtx | |
12307ca2 RK |
640 | expand_inline_function (fndecl, parms, target, ignore, type, |
641 | structure_value_addr) | |
175160e7 MT |
642 | tree fndecl, parms; |
643 | rtx target; | |
644 | int ignore; | |
645 | tree type; | |
646 | rtx structure_value_addr; | |
647 | { | |
36edd3cc | 648 | struct function *inlining_previous; |
49ad7cfa | 649 | struct function *inl_f = DECL_SAVED_INSNS (fndecl); |
81578142 | 650 | tree formal, actual, block; |
36edd3cc | 651 | rtx parm_insns = inl_f->emit->x_first_insn; |
49ad7cfa BS |
652 | rtx insns = (inl_f->inl_last_parm_insn |
653 | ? NEXT_INSN (inl_f->inl_last_parm_insn) | |
654 | : parm_insns); | |
175160e7 MT |
655 | tree *arg_trees; |
656 | rtx *arg_vals; | |
175160e7 | 657 | int max_regno; |
b3694847 | 658 | int i; |
36edd3cc | 659 | int min_labelno = inl_f->emit->x_first_label_num; |
49ad7cfa | 660 | int max_labelno = inl_f->inl_max_label_num; |
175160e7 | 661 | int nargs; |
175160e7 | 662 | rtx loc; |
2132517d | 663 | rtx stack_save = 0; |
175160e7 | 664 | rtx temp; |
c68da89c | 665 | struct inline_remap *map = 0; |
e2500fed | 666 | rtvec arg_vector = inl_f->original_arg_vector; |
a6dd1cb6 | 667 | rtx static_chain_value = 0; |
49ad7cfa | 668 | int inl_max_uid; |
52a11cbf | 669 | int eh_region_offset; |
175160e7 | 670 | |
253a01b4 JL |
671 | /* The pointer used to track the true location of the memory used |
672 | for MAP->LABEL_MAP. */ | |
673 | rtx *real_label_map = 0; | |
674 | ||
175160e7 | 675 | /* Allow for equivalences of the pseudos we make for virtual fp and ap. */ |
36edd3cc | 676 | max_regno = inl_f->emit->x_reg_rtx_no + 3; |
175160e7 MT |
677 | if (max_regno < FIRST_PSEUDO_REGISTER) |
678 | abort (); | |
679 | ||
ecff20d4 JM |
680 | /* Pull out the decl for the function definition; fndecl may be a |
681 | local declaration, which would break DECL_ABSTRACT_ORIGIN. */ | |
682 | fndecl = inl_f->decl; | |
683 | ||
175160e7 MT |
684 | nargs = list_length (DECL_ARGUMENTS (fndecl)); |
685 | ||
c2f8b491 JH |
686 | if (cfun->preferred_stack_boundary < inl_f->preferred_stack_boundary) |
687 | cfun->preferred_stack_boundary = inl_f->preferred_stack_boundary; | |
688 | ||
2d8d0db8 RK |
689 | /* Check that the parms type match and that sufficient arguments were |
690 | passed. Since the appropriate conversions or default promotions have | |
691 | already been applied, the machine modes should match exactly. */ | |
692 | ||
12307ca2 | 693 | for (formal = DECL_ARGUMENTS (fndecl), actual = parms; |
175160e7 | 694 | formal; |
12307ca2 | 695 | formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual)) |
175160e7 | 696 | { |
2d8d0db8 RK |
697 | tree arg; |
698 | enum machine_mode mode; | |
699 | ||
700 | if (actual == 0) | |
60e8b9f0 | 701 | return (rtx) (size_t) -1; |
2d8d0db8 RK |
702 | |
703 | arg = TREE_VALUE (actual); | |
12307ca2 | 704 | mode = TYPE_MODE (DECL_ARG_TYPE (formal)); |
2d8d0db8 | 705 | |
3b07c79b JJ |
706 | if (arg == error_mark_node |
707 | || mode != TYPE_MODE (TREE_TYPE (arg)) | |
2d8d0db8 RK |
708 | /* If they are block mode, the types should match exactly. |
709 | They don't match exactly if TREE_TYPE (FORMAL) == ERROR_MARK_NODE, | |
710 | which could happen if the parameter has incomplete type. */ | |
d80db03d RK |
711 | || (mode == BLKmode |
712 | && (TYPE_MAIN_VARIANT (TREE_TYPE (arg)) | |
713 | != TYPE_MAIN_VARIANT (TREE_TYPE (formal))))) | |
60e8b9f0 | 714 | return (rtx) (size_t) -1; |
175160e7 MT |
715 | } |
716 | ||
2d8d0db8 RK |
717 | /* Extra arguments are valid, but will be ignored below, so we must |
718 | evaluate them here for side-effects. */ | |
719 | for (; actual; actual = TREE_CHAIN (actual)) | |
720 | expand_expr (TREE_VALUE (actual), const0_rtx, | |
721 | TYPE_MODE (TREE_TYPE (TREE_VALUE (actual))), 0); | |
722 | ||
175160e7 MT |
723 | /* Expand the function arguments. Do this first so that any |
724 | new registers get created before we allocate the maps. */ | |
725 | ||
67289ea6 MM |
726 | arg_vals = (rtx *) xmalloc (nargs * sizeof (rtx)); |
727 | arg_trees = (tree *) xmalloc (nargs * sizeof (tree)); | |
175160e7 MT |
728 | |
729 | for (formal = DECL_ARGUMENTS (fndecl), actual = parms, i = 0; | |
730 | formal; | |
731 | formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual), i++) | |
732 | { | |
733 | /* Actual parameter, converted to the type of the argument within the | |
734 | function. */ | |
735 | tree arg = convert (TREE_TYPE (formal), TREE_VALUE (actual)); | |
736 | /* Mode of the variable used within the function. */ | |
737 | enum machine_mode mode = TYPE_MODE (TREE_TYPE (formal)); | |
9175051c | 738 | int invisiref = 0; |
175160e7 | 739 | |
175160e7 MT |
740 | arg_trees[i] = arg; |
741 | loc = RTVEC_ELT (arg_vector, i); | |
742 | ||
743 | /* If this is an object passed by invisible reference, we copy the | |
744 | object into a stack slot and save its address. If this will go | |
745 | into memory, we do nothing now. Otherwise, we just expand the | |
746 | argument. */ | |
747 | if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG | |
748 | && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER) | |
749 | { | |
1da68f56 | 750 | rtx stack_slot = assign_temp (TREE_TYPE (arg), 1, 1, 1); |
175160e7 MT |
751 | |
752 | store_expr (arg, stack_slot, 0); | |
175160e7 | 753 | arg_vals[i] = XEXP (stack_slot, 0); |
9175051c | 754 | invisiref = 1; |
175160e7 MT |
755 | } |
756 | else if (GET_CODE (loc) != MEM) | |
36aa0bf5 RK |
757 | { |
758 | if (GET_MODE (loc) != TYPE_MODE (TREE_TYPE (arg))) | |
69107307 AO |
759 | { |
760 | int unsignedp = TREE_UNSIGNED (TREE_TYPE (formal)); | |
761 | enum machine_mode pmode = TYPE_MODE (TREE_TYPE (formal)); | |
762 | ||
763 | pmode = promote_mode (TREE_TYPE (formal), pmode, | |
764 | &unsignedp, 0); | |
765 | ||
766 | if (GET_MODE (loc) != pmode) | |
767 | abort (); | |
768 | ||
769 | /* The mode if LOC and ARG can differ if LOC was a variable | |
770 | that had its mode promoted via PROMOTED_MODE. */ | |
771 | arg_vals[i] = convert_modes (pmode, | |
772 | TYPE_MODE (TREE_TYPE (arg)), | |
773 | expand_expr (arg, NULL_RTX, mode, | |
774 | EXPAND_SUM), | |
775 | unsignedp); | |
776 | } | |
36aa0bf5 RK |
777 | else |
778 | arg_vals[i] = expand_expr (arg, NULL_RTX, mode, EXPAND_SUM); | |
779 | } | |
175160e7 MT |
780 | else |
781 | arg_vals[i] = 0; | |
782 | ||
783 | if (arg_vals[i] != 0 | |
784 | && (! TREE_READONLY (formal) | |
785 | /* If the parameter is not read-only, copy our argument through | |
786 | a register. Also, we cannot use ARG_VALS[I] if it overlaps | |
787 | TARGET in any way. In the inline function, they will likely | |
788 | be two different pseudos, and `safe_from_p' will make all | |
789 | sorts of smart assumptions about their not conflicting. | |
790 | But if ARG_VALS[I] overlaps TARGET, these assumptions are | |
9175051c JM |
791 | wrong, so put ARG_VALS[I] into a fresh register. |
792 | Don't worry about invisible references, since their stack | |
793 | temps will never overlap the target. */ | |
175160e7 | 794 | || (target != 0 |
9175051c | 795 | && ! invisiref |
3eda169f RK |
796 | && (GET_CODE (arg_vals[i]) == REG |
797 | || GET_CODE (arg_vals[i]) == SUBREG | |
798 | || GET_CODE (arg_vals[i]) == MEM) | |
30caed6d RS |
799 | && reg_overlap_mentioned_p (arg_vals[i], target)) |
800 | /* ??? We must always copy a SUBREG into a REG, because it might | |
801 | get substituted into an address, and not all ports correctly | |
802 | handle SUBREGs in addresses. */ | |
803 | || (GET_CODE (arg_vals[i]) == SUBREG))) | |
4b7cb39e | 804 | arg_vals[i] = copy_to_mode_reg (GET_MODE (loc), arg_vals[i]); |
12307ca2 RK |
805 | |
806 | if (arg_vals[i] != 0 && GET_CODE (arg_vals[i]) == REG | |
e5e809f4 | 807 | && POINTER_TYPE_P (TREE_TYPE (formal))) |
12307ca2 | 808 | mark_reg_pointer (arg_vals[i], |
bdb429a5 | 809 | TYPE_ALIGN (TREE_TYPE (TREE_TYPE (formal)))); |
175160e7 | 810 | } |
00174bdf | 811 | |
175160e7 MT |
812 | /* Allocate the structures we use to remap things. */ |
813 | ||
c826ae21 | 814 | map = (struct inline_remap *) xcalloc (1, sizeof (struct inline_remap)); |
175160e7 MT |
815 | map->fndecl = fndecl; |
816 | ||
a97901e6 | 817 | VARRAY_TREE_INIT (map->block_map, 10, "block_map"); |
67289ea6 | 818 | map->reg_map = (rtx *) xcalloc (max_regno, sizeof (rtx)); |
175160e7 | 819 | |
3bb1329e BK |
820 | /* We used to use alloca here, but the size of what it would try to |
821 | allocate would occasionally cause it to exceed the stack limit and | |
822 | cause unpredictable core dumps. */ | |
253a01b4 JL |
823 | real_label_map |
824 | = (rtx *) xmalloc ((max_labelno) * sizeof (rtx)); | |
825 | map->label_map = real_label_map; | |
464186fb | 826 | map->local_return_label = NULL_RTX; |
175160e7 | 827 | |
36edd3cc | 828 | inl_max_uid = (inl_f->emit->x_cur_insn_uid + 1); |
67289ea6 | 829 | map->insn_map = (rtx *) xcalloc (inl_max_uid, sizeof (rtx)); |
175160e7 | 830 | map->min_insnno = 0; |
49ad7cfa | 831 | map->max_insnno = inl_max_uid; |
175160e7 | 832 | |
a70f7bb2 | 833 | map->integrating = 1; |
96e60f0c JJ |
834 | map->compare_src = NULL_RTX; |
835 | map->compare_mode = VOIDmode; | |
a70f7bb2 | 836 | |
c68da89c KR |
837 | /* const_equiv_varray maps pseudos in our routine to constants, so |
838 | it needs to be large enough for all our pseudos. This is the | |
839 | number we are currently using plus the number in the called | |
840 | routine, plus 15 for each arg, five to compute the virtual frame | |
841 | pointer, and five for the return value. This should be enough | |
842 | for most cases. We do not reference entries outside the range of | |
843 | the map. | |
c66e0741 RK |
844 | |
845 | ??? These numbers are quite arbitrary and were obtained by | |
846 | experimentation. At some point, we should try to allocate the | |
847 | table after all the parameters are set up so we an more accurately | |
848 | estimate the number of pseudos we will need. */ | |
849 | ||
c68da89c KR |
850 | VARRAY_CONST_EQUIV_INIT (map->const_equiv_varray, |
851 | (max_reg_num () | |
852 | + (max_regno - FIRST_PSEUDO_REGISTER) | |
853 | + 15 * nargs | |
854 | + 10), | |
855 | "expand_inline_function"); | |
175160e7 MT |
856 | map->const_age = 0; |
857 | ||
858 | /* Record the current insn in case we have to set up pointers to frame | |
3ba10494 AS |
859 | and argument memory blocks. If there are no insns yet, add a dummy |
860 | insn that can be used as an insertion point. */ | |
175160e7 | 861 | map->insns_at_start = get_last_insn (); |
e9a25f70 | 862 | if (map->insns_at_start == 0) |
6496a589 | 863 | map->insns_at_start = emit_note (NULL, NOTE_INSN_DELETED); |
175160e7 | 864 | |
36edd3cc | 865 | map->regno_pointer_align = inl_f->emit->regno_pointer_align; |
3502dc9c | 866 | map->x_regno_reg_rtx = inl_f->emit->x_regno_reg_rtx; |
12307ca2 | 867 | |
175160e7 MT |
868 | /* Update the outgoing argument size to allow for those in the inlined |
869 | function. */ | |
49ad7cfa BS |
870 | if (inl_f->outgoing_args_size > current_function_outgoing_args_size) |
871 | current_function_outgoing_args_size = inl_f->outgoing_args_size; | |
175160e7 MT |
872 | |
873 | /* If the inline function needs to make PIC references, that means | |
874 | that this function's PIC offset table must be used. */ | |
49ad7cfa | 875 | if (inl_f->uses_pic_offset_table) |
175160e7 MT |
876 | current_function_uses_pic_offset_table = 1; |
877 | ||
a6dd1cb6 | 878 | /* If this function needs a context, set it up. */ |
49ad7cfa | 879 | if (inl_f->needs_context) |
a6dd1cb6 RK |
880 | static_chain_value = lookup_static_chain (fndecl); |
881 | ||
1c1f2d29 JM |
882 | if (GET_CODE (parm_insns) == NOTE |
883 | && NOTE_LINE_NUMBER (parm_insns) > 0) | |
884 | { | |
885 | rtx note = emit_note (NOTE_SOURCE_FILE (parm_insns), | |
886 | NOTE_LINE_NUMBER (parm_insns)); | |
887 | if (note) | |
888 | RTX_INTEGRATED_P (note) = 1; | |
889 | } | |
890 | ||
175160e7 MT |
891 | /* Process each argument. For each, set up things so that the function's |
892 | reference to the argument will refer to the argument being passed. | |
893 | We only replace REG with REG here. Any simplifications are done | |
894 | via const_equiv_map. | |
895 | ||
896 | We make two passes: In the first, we deal with parameters that will | |
897 | be placed into registers, since we need to ensure that the allocated | |
898 | register number fits in const_equiv_map. Then we store all non-register | |
899 | parameters into their memory location. */ | |
900 | ||
fd28789a RS |
901 | /* Don't try to free temp stack slots here, because we may put one of the |
902 | parameters into a temp stack slot. */ | |
903 | ||
175160e7 MT |
904 | for (i = 0; i < nargs; i++) |
905 | { | |
906 | rtx copy = arg_vals[i]; | |
907 | ||
908 | loc = RTVEC_ELT (arg_vector, i); | |
909 | ||
910 | /* There are three cases, each handled separately. */ | |
911 | if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG | |
912 | && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER) | |
913 | { | |
914 | /* This must be an object passed by invisible reference (it could | |
915 | also be a variable-sized object, but we forbid inlining functions | |
916 | with variable-sized arguments). COPY is the address of the | |
917 | actual value (this computation will cause it to be copied). We | |
918 | map that address for the register, noting the actual address as | |
919 | an equivalent in case it can be substituted into the insns. */ | |
920 | ||
921 | if (GET_CODE (copy) != REG) | |
922 | { | |
923 | temp = copy_addr_to_reg (copy); | |
c68da89c KR |
924 | if (CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy)) |
925 | SET_CONST_EQUIV_DATA (map, temp, copy, CONST_AGE_PARM); | |
175160e7 MT |
926 | copy = temp; |
927 | } | |
928 | map->reg_map[REGNO (XEXP (loc, 0))] = copy; | |
929 | } | |
930 | else if (GET_CODE (loc) == MEM) | |
931 | { | |
14a774a9 RK |
932 | /* This is the case of a parameter that lives in memory. It |
933 | will live in the block we allocate in the called routine's | |
175160e7 | 934 | frame that simulates the incoming argument area. Do nothing |
14a774a9 RK |
935 | with the parameter now; we will call store_expr later. In |
936 | this case, however, we must ensure that the virtual stack and | |
937 | incoming arg rtx values are expanded now so that we can be | |
938 | sure we have enough slots in the const equiv map since the | |
939 | store_expr call can easily blow the size estimate. */ | |
14a774a9 RK |
940 | if (DECL_SAVED_INSNS (fndecl)->args_size != 0) |
941 | copy_rtx_and_substitute (virtual_incoming_args_rtx, map, 0); | |
175160e7 MT |
942 | } |
943 | else if (GET_CODE (loc) == REG) | |
a4c3ddd8 | 944 | process_reg_param (map, loc, copy); |
bc2eeab2 RS |
945 | else if (GET_CODE (loc) == CONCAT) |
946 | { | |
bc2eeab2 RS |
947 | rtx locreal = gen_realpart (GET_MODE (XEXP (loc, 0)), loc); |
948 | rtx locimag = gen_imagpart (GET_MODE (XEXP (loc, 0)), loc); | |
949 | rtx copyreal = gen_realpart (GET_MODE (locreal), copy); | |
950 | rtx copyimag = gen_imagpart (GET_MODE (locimag), copy); | |
951 | ||
a4c3ddd8 BS |
952 | process_reg_param (map, locreal, copyreal); |
953 | process_reg_param (map, locimag, copyimag); | |
bc2eeab2 | 954 | } |
175160e7 MT |
955 | else |
956 | abort (); | |
175160e7 MT |
957 | } |
958 | ||
36edd3cc BS |
959 | /* Tell copy_rtx_and_substitute to handle constant pool SYMBOL_REFs |
960 | specially. This function can be called recursively, so we need to | |
961 | save the previous value. */ | |
962 | inlining_previous = inlining; | |
963 | inlining = inl_f; | |
964 | ||
175160e7 MT |
965 | /* Now do the parameters that will be placed in memory. */ |
966 | ||
967 | for (formal = DECL_ARGUMENTS (fndecl), i = 0; | |
968 | formal; formal = TREE_CHAIN (formal), i++) | |
969 | { | |
175160e7 MT |
970 | loc = RTVEC_ELT (arg_vector, i); |
971 | ||
972 | if (GET_CODE (loc) == MEM | |
973 | /* Exclude case handled above. */ | |
974 | && ! (GET_CODE (XEXP (loc, 0)) == REG | |
975 | && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)) | |
976 | { | |
cdd6e2db TW |
977 | rtx note = emit_note (DECL_SOURCE_FILE (formal), |
978 | DECL_SOURCE_LINE (formal)); | |
979 | if (note) | |
980 | RTX_INTEGRATED_P (note) = 1; | |
175160e7 MT |
981 | |
982 | /* Compute the address in the area we reserved and store the | |
983 | value there. */ | |
14a774a9 RK |
984 | temp = copy_rtx_and_substitute (loc, map, 1); |
985 | subst_constants (&temp, NULL_RTX, map, 1); | |
175160e7 MT |
986 | apply_change_group (); |
987 | if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0))) | |
988 | temp = change_address (temp, VOIDmode, XEXP (temp, 0)); | |
989 | store_expr (arg_trees[i], temp, 0); | |
175160e7 MT |
990 | } |
991 | } | |
992 | ||
993 | /* Deal with the places that the function puts its result. | |
994 | We are driven by what is placed into DECL_RESULT. | |
995 | ||
996 | Initially, we assume that we don't have anything special handling for | |
997 | REG_FUNCTION_RETURN_VALUE_P. */ | |
998 | ||
999 | map->inline_target = 0; | |
19e7881c MM |
1000 | loc = (DECL_RTL_SET_P (DECL_RESULT (fndecl)) |
1001 | ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX); | |
58a2f534 | 1002 | |
175160e7 MT |
1003 | if (TYPE_MODE (type) == VOIDmode) |
1004 | /* There is no return value to worry about. */ | |
1005 | ; | |
1006 | else if (GET_CODE (loc) == MEM) | |
1007 | { | |
58a2f534 RH |
1008 | if (GET_CODE (XEXP (loc, 0)) == ADDRESSOF) |
1009 | { | |
14a774a9 RK |
1010 | temp = copy_rtx_and_substitute (loc, map, 1); |
1011 | subst_constants (&temp, NULL_RTX, map, 1); | |
58a2f534 RH |
1012 | apply_change_group (); |
1013 | target = temp; | |
1014 | } | |
1015 | else | |
1016 | { | |
1017 | if (! structure_value_addr | |
1018 | || ! aggregate_value_p (DECL_RESULT (fndecl))) | |
1019 | abort (); | |
00174bdf | 1020 | |
58a2f534 RH |
1021 | /* Pass the function the address in which to return a structure |
1022 | value. Note that a constructor can cause someone to call us | |
1023 | with STRUCTURE_VALUE_ADDR, but the initialization takes place | |
1024 | via the first parameter, rather than the struct return address. | |
175160e7 | 1025 | |
58a2f534 RH |
1026 | We have two cases: If the address is a simple register |
1027 | indirect, use the mapping mechanism to point that register to | |
1028 | our structure return address. Otherwise, store the structure | |
1029 | return value into the place that it will be referenced from. */ | |
175160e7 | 1030 | |
58a2f534 | 1031 | if (GET_CODE (XEXP (loc, 0)) == REG) |
175160e7 | 1032 | { |
58a2f534 RH |
1033 | temp = force_operand (structure_value_addr, NULL_RTX); |
1034 | temp = force_reg (Pmode, temp); | |
e2a5f96b R |
1035 | /* A virtual register might be invalid in an insn, because |
1036 | it can cause trouble in reload. Since we don't have access | |
1037 | to the expanders at map translation time, make sure we have | |
1038 | a proper register now. | |
1039 | If a virtual register is actually valid, cse or combine | |
1040 | can put it into the mapped insns. */ | |
1041 | if (REGNO (temp) >= FIRST_VIRTUAL_REGISTER | |
1042 | && REGNO (temp) <= LAST_VIRTUAL_REGISTER) | |
1043 | temp = copy_to_mode_reg (Pmode, temp); | |
58a2f534 RH |
1044 | map->reg_map[REGNO (XEXP (loc, 0))] = temp; |
1045 | ||
c68da89c KR |
1046 | if (CONSTANT_P (structure_value_addr) |
1047 | || GET_CODE (structure_value_addr) == ADDRESSOF | |
1048 | || (GET_CODE (structure_value_addr) == PLUS | |
1049 | && (XEXP (structure_value_addr, 0) | |
1050 | == virtual_stack_vars_rtx) | |
1051 | && (GET_CODE (XEXP (structure_value_addr, 1)) | |
1052 | == CONST_INT))) | |
58a2f534 | 1053 | { |
c68da89c KR |
1054 | SET_CONST_EQUIV_DATA (map, temp, structure_value_addr, |
1055 | CONST_AGE_PARM); | |
58a2f534 RH |
1056 | } |
1057 | } | |
1058 | else | |
1059 | { | |
14a774a9 RK |
1060 | temp = copy_rtx_and_substitute (loc, map, 1); |
1061 | subst_constants (&temp, NULL_RTX, map, 0); | |
58a2f534 RH |
1062 | apply_change_group (); |
1063 | emit_move_insn (temp, structure_value_addr); | |
175160e7 | 1064 | } |
175160e7 MT |
1065 | } |
1066 | } | |
1067 | else if (ignore) | |
1068 | /* We will ignore the result value, so don't look at its structure. | |
1069 | Note that preparations for an aggregate return value | |
1070 | do need to be made (above) even if it will be ignored. */ | |
1071 | ; | |
1072 | else if (GET_CODE (loc) == REG) | |
1073 | { | |
1074 | /* The function returns an object in a register and we use the return | |
1075 | value. Set up our target for remapping. */ | |
1076 | ||
6d2f8887 | 1077 | /* Machine mode function was declared to return. */ |
175160e7 MT |
1078 | enum machine_mode departing_mode = TYPE_MODE (type); |
1079 | /* (Possibly wider) machine mode it actually computes | |
3ff2293f BK |
1080 | (for the sake of callers that fail to declare it right). |
1081 | We have to use the mode of the result's RTL, rather than | |
1082 | its type, since expand_function_start may have promoted it. */ | |
60da674b RH |
1083 | enum machine_mode arriving_mode |
1084 | = GET_MODE (DECL_RTL (DECL_RESULT (fndecl))); | |
175160e7 MT |
1085 | rtx reg_to_map; |
1086 | ||
1087 | /* Don't use MEMs as direct targets because on some machines | |
1088 | substituting a MEM for a REG makes invalid insns. | |
1089 | Let the combiner substitute the MEM if that is valid. */ | |
1090 | if (target == 0 || GET_CODE (target) != REG | |
1091 | || GET_MODE (target) != departing_mode) | |
c36fce9a GRK |
1092 | { |
1093 | /* Don't make BLKmode registers. If this looks like | |
1094 | a BLKmode object being returned in a register, get | |
00174bdf | 1095 | the mode from that, otherwise abort. */ |
c36fce9a GRK |
1096 | if (departing_mode == BLKmode) |
1097 | { | |
60da674b RH |
1098 | if (REG == GET_CODE (DECL_RTL (DECL_RESULT (fndecl)))) |
1099 | { | |
1100 | departing_mode = GET_MODE (DECL_RTL (DECL_RESULT (fndecl))); | |
1101 | arriving_mode = departing_mode; | |
1102 | } | |
1103 | else | |
00174bdf | 1104 | abort (); |
c36fce9a | 1105 | } |
00174bdf KH |
1106 | |
1107 | target = gen_reg_rtx (departing_mode); | |
c36fce9a | 1108 | } |
175160e7 MT |
1109 | |
1110 | /* If function's value was promoted before return, | |
1111 | avoid machine mode mismatch when we substitute INLINE_TARGET. | |
1112 | But TARGET is what we will return to the caller. */ | |
1113 | if (arriving_mode != departing_mode) | |
2d0bd5fd RK |
1114 | { |
1115 | /* Avoid creating a paradoxical subreg wider than | |
1116 | BITS_PER_WORD, since that is illegal. */ | |
1117 | if (GET_MODE_BITSIZE (arriving_mode) > BITS_PER_WORD) | |
1118 | { | |
1119 | if (!TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (departing_mode), | |
1120 | GET_MODE_BITSIZE (arriving_mode))) | |
1121 | /* Maybe could be handled by using convert_move () ? */ | |
1122 | abort (); | |
1123 | reg_to_map = gen_reg_rtx (arriving_mode); | |
1124 | target = gen_lowpart (departing_mode, reg_to_map); | |
1125 | } | |
1126 | else | |
38a448ca | 1127 | reg_to_map = gen_rtx_SUBREG (arriving_mode, target, 0); |
2d0bd5fd | 1128 | } |
175160e7 MT |
1129 | else |
1130 | reg_to_map = target; | |
1131 | ||
1132 | /* Usually, the result value is the machine's return register. | |
1133 | Sometimes it may be a pseudo. Handle both cases. */ | |
1134 | if (REG_FUNCTION_VALUE_P (loc)) | |
1135 | map->inline_target = reg_to_map; | |
1136 | else | |
1137 | map->reg_map[REGNO (loc)] = reg_to_map; | |
1138 | } | |
9688f9ad RH |
1139 | else if (GET_CODE (loc) == CONCAT) |
1140 | { | |
1141 | enum machine_mode departing_mode = TYPE_MODE (type); | |
1142 | enum machine_mode arriving_mode | |
1143 | = GET_MODE (DECL_RTL (DECL_RESULT (fndecl))); | |
1144 | ||
1145 | if (departing_mode != arriving_mode) | |
1146 | abort (); | |
1147 | if (GET_CODE (XEXP (loc, 0)) != REG | |
1148 | || GET_CODE (XEXP (loc, 1)) != REG) | |
1149 | abort (); | |
1150 | ||
1151 | /* Don't use MEMs as direct targets because on some machines | |
1152 | substituting a MEM for a REG makes invalid insns. | |
1153 | Let the combiner substitute the MEM if that is valid. */ | |
1154 | if (target == 0 || GET_CODE (target) != REG | |
1155 | || GET_MODE (target) != departing_mode) | |
1156 | target = gen_reg_rtx (departing_mode); | |
1157 | ||
1158 | if (GET_CODE (target) != CONCAT) | |
1159 | abort (); | |
1160 | ||
1161 | map->reg_map[REGNO (XEXP (loc, 0))] = XEXP (target, 0); | |
1162 | map->reg_map[REGNO (XEXP (loc, 1))] = XEXP (target, 1); | |
1163 | } | |
64ed0f40 JW |
1164 | else |
1165 | abort (); | |
175160e7 | 1166 | |
86c99549 RH |
1167 | /* Remap the exception handler data pointer from one to the other. */ |
1168 | temp = get_exception_pointer (inl_f); | |
1169 | if (temp) | |
1170 | map->reg_map[REGNO (temp)] = get_exception_pointer (cfun); | |
1171 | ||
e5e809f4 JL |
1172 | /* Initialize label_map. get_label_from_map will actually make |
1173 | the labels. */ | |
961192e1 | 1174 | memset ((char *) &map->label_map[min_labelno], 0, |
e5e809f4 | 1175 | (max_labelno - min_labelno) * sizeof (rtx)); |
175160e7 | 1176 | |
a97901e6 MM |
1177 | /* Make copies of the decls of the symbols in the inline function, so that |
1178 | the copies of the variables get declared in the current function. Set | |
1179 | up things so that lookup_static_chain knows that to interpret registers | |
1180 | in SAVE_EXPRs for TYPE_SIZEs as local. */ | |
1181 | inline_function_decl = fndecl; | |
1182 | integrate_parm_decls (DECL_ARGUMENTS (fndecl), map, arg_vector); | |
1183 | block = integrate_decl_tree (inl_f->original_decl_initial, map); | |
1184 | BLOCK_ABSTRACT_ORIGIN (block) = DECL_ORIGIN (fndecl); | |
1185 | inline_function_decl = 0; | |
1186 | ||
1187 | /* Make a fresh binding contour that we can easily remove. Do this after | |
1188 | expanding our arguments so cleanups are properly scoped. */ | |
1189 | expand_start_bindings_and_block (0, block); | |
1190 | ||
1191 | /* Sort the block-map so that it will be easy to find remapped | |
1192 | blocks later. */ | |
00174bdf | 1193 | qsort (&VARRAY_TREE (map->block_map, 0), |
a97901e6 MM |
1194 | map->block_map->elements_used, |
1195 | sizeof (tree), | |
1196 | compare_blocks); | |
1197 | ||
175160e7 MT |
1198 | /* Perform postincrements before actually calling the function. */ |
1199 | emit_queue (); | |
1200 | ||
1201 | /* Clean up stack so that variables might have smaller offsets. */ | |
1202 | do_pending_stack_adjust (); | |
1203 | ||
c68da89c KR |
1204 | /* Save a copy of the location of const_equiv_varray for |
1205 | mark_stores, called via note_stores. */ | |
1206 | global_const_equiv_varray = map->const_equiv_varray; | |
175160e7 | 1207 | |
136cf361 RK |
1208 | /* If the called function does an alloca, save and restore the |
1209 | stack pointer around the call. This saves stack space, but | |
2132517d RK |
1210 | also is required if this inline is being done between two |
1211 | pushes. */ | |
49ad7cfa | 1212 | if (inl_f->calls_alloca) |
2132517d RK |
1213 | emit_stack_save (SAVE_BLOCK, &stack_save, NULL_RTX); |
1214 | ||
c0e7830f DD |
1215 | /* Map pseudos used for initial hard reg values. */ |
1216 | setup_initial_hard_reg_value_integration (inl_f, map); | |
1217 | ||
0a1c58a2 JL |
1218 | /* Now copy the insns one by one. */ |
1219 | copy_insn_list (insns, map, static_chain_value); | |
1220 | ||
52a11cbf RH |
1221 | /* Duplicate the EH regions. This will create an offset from the |
1222 | region numbers in the function we're inlining to the region | |
1223 | numbers in the calling function. This must wait until after | |
1224 | copy_insn_list, as we need the insn map to be complete. */ | |
1225 | eh_region_offset = duplicate_eh_regions (inl_f, map); | |
1226 | ||
464186fb | 1227 | /* Now copy the REG_NOTES for those insns. */ |
52a11cbf | 1228 | copy_insn_notes (insns, map, eh_region_offset); |
464186fb RH |
1229 | |
1230 | /* If the insn sequence required one, emit the return label. */ | |
1231 | if (map->local_return_label) | |
1232 | emit_label (map->local_return_label); | |
1233 | ||
0a1c58a2 JL |
1234 | /* Restore the stack pointer if we saved it above. */ |
1235 | if (inl_f->calls_alloca) | |
1236 | emit_stack_restore (SAVE_BLOCK, stack_save, NULL_RTX); | |
1237 | ||
1238 | if (! cfun->x_whole_function_mode_p) | |
1239 | /* In statement-at-a-time mode, we just tell the front-end to add | |
1240 | this block to the list of blocks at this binding level. We | |
1241 | can't do it the way it's done for function-at-a-time mode the | |
1242 | superblocks have not been created yet. */ | |
43577e6b | 1243 | (*lang_hooks.decls.insert_block) (block); |
0a1c58a2 JL |
1244 | else |
1245 | { | |
00174bdf | 1246 | BLOCK_CHAIN (block) |
0a1c58a2 JL |
1247 | = BLOCK_CHAIN (DECL_INITIAL (current_function_decl)); |
1248 | BLOCK_CHAIN (DECL_INITIAL (current_function_decl)) = block; | |
1249 | } | |
1250 | ||
1251 | /* End the scope containing the copied formal parameter variables | |
1252 | and copied LABEL_DECLs. We pass NULL_TREE for the variables list | |
1253 | here so that expand_end_bindings will not check for unused | |
1254 | variables. That's already been checked for when the inlined | |
1255 | function was defined. */ | |
1256 | expand_end_bindings (NULL_TREE, 1, 1); | |
1257 | ||
1258 | /* Must mark the line number note after inlined functions as a repeat, so | |
1259 | that the test coverage code can avoid counting the call twice. This | |
1260 | just tells the code to ignore the immediately following line note, since | |
1261 | there already exists a copy of this note before the expanded inline call. | |
1262 | This line number note is still needed for debugging though, so we can't | |
1263 | delete it. */ | |
1264 | if (flag_test_coverage) | |
b3b42a4d | 1265 | emit_note (0, NOTE_INSN_REPEATED_LINE_NUMBER); |
0a1c58a2 JL |
1266 | |
1267 | emit_line_note (input_filename, lineno); | |
1268 | ||
1269 | /* If the function returns a BLKmode object in a register, copy it | |
00174bdf KH |
1270 | out of the temp register into a BLKmode memory object. */ |
1271 | if (target | |
0a1c58a2 JL |
1272 | && TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl))) == BLKmode |
1273 | && ! aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl)))) | |
1274 | target = copy_blkmode_from_reg (0, target, TREE_TYPE (TREE_TYPE (fndecl))); | |
00174bdf | 1275 | |
0a1c58a2 JL |
1276 | if (structure_value_addr) |
1277 | { | |
1278 | target = gen_rtx_MEM (TYPE_MODE (type), | |
1279 | memory_address (TYPE_MODE (type), | |
1280 | structure_value_addr)); | |
289c5b45 | 1281 | set_mem_attributes (target, type, 1); |
0a1c58a2 JL |
1282 | } |
1283 | ||
1284 | /* Make sure we free the things we explicitly allocated with xmalloc. */ | |
1285 | if (real_label_map) | |
1286 | free (real_label_map); | |
1287 | VARRAY_FREE (map->const_equiv_varray); | |
1288 | free (map->reg_map); | |
0a1c58a2 JL |
1289 | free (map->insn_map); |
1290 | free (map); | |
1291 | free (arg_vals); | |
1292 | free (arg_trees); | |
1293 | ||
1294 | inlining = inlining_previous; | |
1295 | ||
1296 | return target; | |
1297 | } | |
1298 | ||
1299 | /* Make copies of each insn in the given list using the mapping | |
1300 | computed in expand_inline_function. This function may call itself for | |
1301 | insns containing sequences. | |
00174bdf | 1302 | |
f93dacbd | 1303 | Copying is done in two passes, first the insns and then their REG_NOTES. |
0a1c58a2 JL |
1304 | |
1305 | If static_chain_value is non-zero, it represents the context-pointer | |
00174bdf | 1306 | register for the function. */ |
0a1c58a2 JL |
1307 | |
1308 | static void | |
1309 | copy_insn_list (insns, map, static_chain_value) | |
00174bdf KH |
1310 | rtx insns; |
1311 | struct inline_remap *map; | |
1312 | rtx static_chain_value; | |
0a1c58a2 | 1313 | { |
b3694847 | 1314 | int i; |
0a1c58a2 JL |
1315 | rtx insn; |
1316 | rtx temp; | |
0a1c58a2 JL |
1317 | #ifdef HAVE_cc0 |
1318 | rtx cc0_insn = 0; | |
1319 | #endif | |
03984308 | 1320 | rtx static_chain_mem = 0; |
0a1c58a2 JL |
1321 | |
1322 | /* Copy the insns one by one. Do this in two passes, first the insns and | |
f93dacbd | 1323 | then their REG_NOTES. */ |
175160e7 MT |
1324 | |
1325 | /* This loop is very similar to the loop in copy_loop_body in unroll.c. */ | |
1326 | ||
1327 | for (insn = insns; insn; insn = NEXT_INSN (insn)) | |
1328 | { | |
c9734bb9 | 1329 | rtx copy, pattern, set; |
175160e7 MT |
1330 | |
1331 | map->orig_asm_operands_vector = 0; | |
1332 | ||
1333 | switch (GET_CODE (insn)) | |
1334 | { | |
1335 | case INSN: | |
1336 | pattern = PATTERN (insn); | |
c9734bb9 | 1337 | set = single_set (insn); |
175160e7 | 1338 | copy = 0; |
c13fde05 RH |
1339 | if (GET_CODE (pattern) == USE |
1340 | && GET_CODE (XEXP (pattern, 0)) == REG | |
1341 | && REG_FUNCTION_VALUE_P (XEXP (pattern, 0))) | |
1342 | /* The (USE (REG n)) at return from the function should | |
1343 | be ignored since we are changing (REG n) into | |
1344 | inline_target. */ | |
1345 | break; | |
175160e7 MT |
1346 | |
1347 | /* Ignore setting a function value that we don't want to use. */ | |
1348 | if (map->inline_target == 0 | |
c9734bb9 RK |
1349 | && set != 0 |
1350 | && GET_CODE (SET_DEST (set)) == REG | |
1351 | && REG_FUNCTION_VALUE_P (SET_DEST (set))) | |
5cd76fcd | 1352 | { |
c9734bb9 | 1353 | if (volatile_refs_p (SET_SRC (set))) |
5cd76fcd | 1354 | { |
c9734bb9 RK |
1355 | rtx new_set; |
1356 | ||
5cd76fcd RS |
1357 | /* If we must not delete the source, |
1358 | load it into a new temporary. */ | |
14a774a9 | 1359 | copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0)); |
c9734bb9 RK |
1360 | |
1361 | new_set = single_set (copy); | |
1362 | if (new_set == 0) | |
1363 | abort (); | |
1364 | ||
1365 | SET_DEST (new_set) | |
1366 | = gen_reg_rtx (GET_MODE (SET_DEST (new_set))); | |
5cd76fcd | 1367 | } |
d8090d46 RK |
1368 | /* If the source and destination are the same and it |
1369 | has a note on it, keep the insn. */ | |
1370 | else if (rtx_equal_p (SET_DEST (set), SET_SRC (set)) | |
1371 | && REG_NOTES (insn) != 0) | |
14a774a9 | 1372 | copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0)); |
5cd76fcd RS |
1373 | else |
1374 | break; | |
1375 | } | |
c9734bb9 | 1376 | |
e93eff94 DL |
1377 | /* Similarly if an ignored return value is clobbered. */ |
1378 | else if (map->inline_target == 0 | |
1379 | && GET_CODE (pattern) == CLOBBER | |
1380 | && GET_CODE (XEXP (pattern, 0)) == REG | |
1381 | && REG_FUNCTION_VALUE_P (XEXP (pattern, 0))) | |
1382 | break; | |
1383 | ||
03984308 BW |
1384 | /* Look for the address of the static chain slot. The |
1385 | rtx_equal_p comparisons against the | |
1386 | static_chain_incoming_rtx below may fail if the static | |
1387 | chain is in memory and the address specified is not | |
1388 | "legitimate". This happens on Xtensa where the static | |
1389 | chain is at a negative offset from argp and where only | |
1390 | positive offsets are legitimate. When the RTL is | |
1391 | generated, the address is "legitimized" by copying it | |
1392 | into a register, causing the rtx_equal_p comparisons to | |
1393 | fail. This workaround looks for code that sets a | |
1394 | register to the address of the static chain. Subsequent | |
1395 | memory references via that register can then be | |
1396 | identified as static chain references. We assume that | |
1397 | the register is only assigned once, and that the static | |
1eeeb6a4 | 1398 | chain address is only live in one register at a time. */ |
03984308 | 1399 | |
c9734bb9 RK |
1400 | else if (static_chain_value != 0 |
1401 | && set != 0 | |
03984308 | 1402 | && GET_CODE (static_chain_incoming_rtx) == MEM |
c9734bb9 | 1403 | && GET_CODE (SET_DEST (set)) == REG |
03984308 BW |
1404 | && rtx_equal_p (SET_SRC (set), |
1405 | XEXP (static_chain_incoming_rtx, 0))) | |
1406 | { | |
1407 | static_chain_mem = | |
1408 | gen_rtx_MEM (GET_MODE (static_chain_incoming_rtx), | |
1409 | SET_DEST (set)); | |
1410 | ||
1411 | /* emit the instruction in case it is used for something | |
1412 | other than setting the static chain; if it's not used, | |
1413 | it can always be removed as dead code */ | |
1414 | copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0)); | |
1415 | } | |
1416 | ||
1417 | /* If this is setting the static chain rtx, omit it. */ | |
1418 | else if (static_chain_value != 0 | |
1419 | && set != 0 | |
1420 | && (rtx_equal_p (SET_DEST (set), | |
1421 | static_chain_incoming_rtx) | |
1422 | || (static_chain_mem | |
1423 | && rtx_equal_p (SET_DEST (set), static_chain_mem)))) | |
c9734bb9 RK |
1424 | break; |
1425 | ||
a6dd1cb6 RK |
1426 | /* If this is setting the static chain pseudo, set it from |
1427 | the value we want to give it instead. */ | |
1428 | else if (static_chain_value != 0 | |
c9734bb9 | 1429 | && set != 0 |
03984308 BW |
1430 | && (rtx_equal_p (SET_SRC (set), |
1431 | static_chain_incoming_rtx) | |
1432 | || (static_chain_mem | |
1433 | && rtx_equal_p (SET_SRC (set), static_chain_mem)))) | |
a6dd1cb6 | 1434 | { |
14a774a9 | 1435 | rtx newdest = copy_rtx_and_substitute (SET_DEST (set), map, 1); |
a6dd1cb6 | 1436 | |
c9734bb9 | 1437 | copy = emit_move_insn (newdest, static_chain_value); |
03984308 BW |
1438 | if (GET_CODE (static_chain_incoming_rtx) != MEM) |
1439 | static_chain_value = 0; | |
a6dd1cb6 | 1440 | } |
14a774a9 RK |
1441 | |
1442 | /* If this is setting the virtual stack vars register, this must | |
1443 | be the code at the handler for a builtin longjmp. The value | |
1444 | saved in the setjmp buffer will be the address of the frame | |
1445 | we've made for this inlined instance within our frame. But we | |
1446 | know the offset of that value so we can use it to reconstruct | |
1447 | our virtual stack vars register from that value. If we are | |
1448 | copying it from the stack pointer, leave it unchanged. */ | |
1449 | else if (set != 0 | |
1450 | && rtx_equal_p (SET_DEST (set), virtual_stack_vars_rtx)) | |
1451 | { | |
36a1fa96 | 1452 | HOST_WIDE_INT offset; |
14a774a9 RK |
1453 | temp = map->reg_map[REGNO (SET_DEST (set))]; |
1454 | temp = VARRAY_CONST_EQUIV (map->const_equiv_varray, | |
1455 | REGNO (temp)).rtx; | |
1456 | ||
36a1fa96 JL |
1457 | if (rtx_equal_p (temp, virtual_stack_vars_rtx)) |
1458 | offset = 0; | |
1459 | else if (GET_CODE (temp) == PLUS | |
1460 | && rtx_equal_p (XEXP (temp, 0), virtual_stack_vars_rtx) | |
1461 | && GET_CODE (XEXP (temp, 1)) == CONST_INT) | |
1462 | offset = INTVAL (XEXP (temp, 1)); | |
1463 | else | |
14a774a9 RK |
1464 | abort (); |
1465 | ||
1466 | if (rtx_equal_p (SET_SRC (set), stack_pointer_rtx)) | |
1467 | temp = SET_SRC (set); | |
1468 | else | |
36a1fa96 JL |
1469 | temp = force_operand (plus_constant (SET_SRC (set), |
1470 | - offset), | |
1471 | NULL_RTX); | |
14a774a9 | 1472 | |
36a1fa96 | 1473 | copy = emit_move_insn (virtual_stack_vars_rtx, temp); |
14a774a9 RK |
1474 | } |
1475 | ||
5cd76fcd | 1476 | else |
14a774a9 | 1477 | copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0)); |
175160e7 MT |
1478 | /* REG_NOTES will be copied later. */ |
1479 | ||
1480 | #ifdef HAVE_cc0 | |
1481 | /* If this insn is setting CC0, it may need to look at | |
1482 | the insn that uses CC0 to see what type of insn it is. | |
1483 | In that case, the call to recog via validate_change will | |
1484 | fail. So don't substitute constants here. Instead, | |
1485 | do it when we emit the following insn. | |
1486 | ||
1487 | For example, see the pyr.md file. That machine has signed and | |
1488 | unsigned compares. The compare patterns must check the | |
1489 | following branch insn to see which what kind of compare to | |
1490 | emit. | |
1491 | ||
1492 | If the previous insn set CC0, substitute constants on it as | |
1493 | well. */ | |
1494 | if (sets_cc0_p (PATTERN (copy)) != 0) | |
1495 | cc0_insn = copy; | |
1496 | else | |
1497 | { | |
1498 | if (cc0_insn) | |
1499 | try_constants (cc0_insn, map); | |
1500 | cc0_insn = 0; | |
1501 | try_constants (copy, map); | |
1502 | } | |
1503 | #else | |
1504 | try_constants (copy, map); | |
1505 | #endif | |
0478a14c | 1506 | INSN_SCOPE (copy) = INSN_SCOPE (insn); |
175160e7 MT |
1507 | break; |
1508 | ||
1509 | case JUMP_INSN: | |
8cd44271 | 1510 | if (map->integrating && returnjump_p (insn)) |
175160e7 | 1511 | { |
464186fb RH |
1512 | if (map->local_return_label == 0) |
1513 | map->local_return_label = gen_label_rtx (); | |
1514 | pattern = gen_jump (map->local_return_label); | |
175160e7 MT |
1515 | } |
1516 | else | |
14a774a9 | 1517 | pattern = copy_rtx_and_substitute (PATTERN (insn), map, 0); |
175160e7 MT |
1518 | |
1519 | copy = emit_jump_insn (pattern); | |
1520 | ||
1521 | #ifdef HAVE_cc0 | |
1522 | if (cc0_insn) | |
1523 | try_constants (cc0_insn, map); | |
1524 | cc0_insn = 0; | |
1525 | #endif | |
1526 | try_constants (copy, map); | |
0478a14c | 1527 | INSN_SCOPE (copy) = INSN_SCOPE (insn); |
175160e7 MT |
1528 | |
1529 | /* If this used to be a conditional jump insn but whose branch | |
1530 | direction is now know, we must do something special. */ | |
7f1c097d | 1531 | if (any_condjump_p (insn) && onlyjump_p (insn) && map->last_pc_value) |
175160e7 MT |
1532 | { |
1533 | #ifdef HAVE_cc0 | |
b30f05db | 1534 | /* If the previous insn set cc0 for us, delete it. */ |
44ce0063 | 1535 | if (only_sets_cc0_p (PREV_INSN (copy))) |
53c17031 | 1536 | delete_related_insns (PREV_INSN (copy)); |
175160e7 MT |
1537 | #endif |
1538 | ||
1539 | /* If this is now a no-op, delete it. */ | |
1540 | if (map->last_pc_value == pc_rtx) | |
1541 | { | |
53c17031 | 1542 | delete_related_insns (copy); |
175160e7 MT |
1543 | copy = 0; |
1544 | } | |
1545 | else | |
1546 | /* Otherwise, this is unconditional jump so we must put a | |
1547 | BARRIER after it. We could do some dead code elimination | |
1548 | here, but jump.c will do it just as well. */ | |
1549 | emit_barrier (); | |
1550 | } | |
1551 | break; | |
1552 | ||
1553 | case CALL_INSN: | |
0a1c58a2 JL |
1554 | /* If this is a CALL_PLACEHOLDER insn then we need to copy the |
1555 | three attached sequences: normal call, sibling call and tail | |
00174bdf | 1556 | recursion. */ |
0a1c58a2 JL |
1557 | if (GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER) |
1558 | { | |
1559 | rtx sequence[3]; | |
1560 | rtx tail_label; | |
1561 | ||
1562 | for (i = 0; i < 3; i++) | |
1563 | { | |
1564 | rtx seq; | |
00174bdf | 1565 | |
0a1c58a2 JL |
1566 | sequence[i] = NULL_RTX; |
1567 | seq = XEXP (PATTERN (insn), i); | |
1568 | if (seq) | |
1569 | { | |
1570 | start_sequence (); | |
1571 | copy_insn_list (seq, map, static_chain_value); | |
1572 | sequence[i] = get_insns (); | |
1573 | end_sequence (); | |
1574 | } | |
1575 | } | |
1576 | ||
00174bdf | 1577 | /* Find the new tail recursion label. |
0a1c58a2 JL |
1578 | It will already be substituted into sequence[2]. */ |
1579 | tail_label = copy_rtx_and_substitute (XEXP (PATTERN (insn), 3), | |
1580 | map, 0); | |
1581 | ||
00174bdf KH |
1582 | copy = emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode, |
1583 | sequence[0], | |
1584 | sequence[1], | |
1585 | sequence[2], | |
1586 | tail_label)); | |
0a1c58a2 JL |
1587 | break; |
1588 | } | |
1589 | ||
14a774a9 | 1590 | pattern = copy_rtx_and_substitute (PATTERN (insn), map, 0); |
175160e7 MT |
1591 | copy = emit_call_insn (pattern); |
1592 | ||
0a1c58a2 | 1593 | SIBLING_CALL_P (copy) = SIBLING_CALL_P (insn); |
24a28584 | 1594 | CONST_OR_PURE_CALL_P (copy) = CONST_OR_PURE_CALL_P (insn); |
0478a14c | 1595 | INSN_SCOPE (copy) = INSN_SCOPE (insn); |
0a1c58a2 | 1596 | |
d7e09326 RK |
1597 | /* Because the USAGE information potentially contains objects other |
1598 | than hard registers, we need to copy it. */ | |
0a1c58a2 | 1599 | |
db3cf6fb | 1600 | CALL_INSN_FUNCTION_USAGE (copy) |
14a774a9 RK |
1601 | = copy_rtx_and_substitute (CALL_INSN_FUNCTION_USAGE (insn), |
1602 | map, 0); | |
d7e09326 | 1603 | |
175160e7 MT |
1604 | #ifdef HAVE_cc0 |
1605 | if (cc0_insn) | |
1606 | try_constants (cc0_insn, map); | |
1607 | cc0_insn = 0; | |
1608 | #endif | |
1609 | try_constants (copy, map); | |
1610 | ||
00174bdf | 1611 | /* Be lazy and assume CALL_INSNs clobber all hard registers. */ |
175160e7 | 1612 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) |
c68da89c | 1613 | VARRAY_CONST_EQUIV (map->const_equiv_varray, i).rtx = 0; |
175160e7 MT |
1614 | break; |
1615 | ||
1616 | case CODE_LABEL: | |
e5e809f4 JL |
1617 | copy = emit_label (get_label_from_map (map, |
1618 | CODE_LABEL_NUMBER (insn))); | |
bfa30b22 | 1619 | LABEL_NAME (copy) = LABEL_NAME (insn); |
175160e7 MT |
1620 | map->const_age++; |
1621 | break; | |
1622 | ||
1623 | case BARRIER: | |
1624 | copy = emit_barrier (); | |
1625 | break; | |
1626 | ||
1627 | case NOTE: | |
bc8d3f91 JH |
1628 | if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL) |
1629 | { | |
1630 | copy = emit_label (get_label_from_map (map, | |
1631 | CODE_LABEL_NUMBER (insn))); | |
3bab2571 | 1632 | LABEL_NAME (copy) = NOTE_SOURCE_FILE (insn); |
bc8d3f91 JH |
1633 | map->const_age++; |
1634 | break; | |
1635 | } | |
1636 | ||
00174bdf KH |
1637 | /* NOTE_INSN_FUNCTION_END and NOTE_INSN_FUNCTION_BEG are |
1638 | discarded because it is important to have only one of | |
0a1c58a2 JL |
1639 | each in the current function. |
1640 | ||
4793dca1 | 1641 | NOTE_INSN_DELETED notes aren't useful. */ |
0a1c58a2 | 1642 | |
175160e7 MT |
1643 | if (NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_END |
1644 | && NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_BEG | |
4793dca1 | 1645 | && NOTE_LINE_NUMBER (insn) != NOTE_INSN_DELETED) |
6adb4e3a | 1646 | { |
e5e809f4 JL |
1647 | copy = emit_note (NOTE_SOURCE_FILE (insn), |
1648 | NOTE_LINE_NUMBER (insn)); | |
1649 | if (copy | |
52a11cbf RH |
1650 | && (NOTE_LINE_NUMBER (copy) == NOTE_INSN_BLOCK_BEG |
1651 | || NOTE_LINE_NUMBER (copy) == NOTE_INSN_BLOCK_END) | |
1652 | && NOTE_BLOCK (insn)) | |
a97901e6 MM |
1653 | { |
1654 | tree *mapped_block_p; | |
1655 | ||
1656 | mapped_block_p | |
00174bdf | 1657 | = (tree *) bsearch (NOTE_BLOCK (insn), |
a97901e6 MM |
1658 | &VARRAY_TREE (map->block_map, 0), |
1659 | map->block_map->elements_used, | |
1660 | sizeof (tree), | |
1661 | find_block); | |
00174bdf | 1662 | |
a97901e6 MM |
1663 | if (!mapped_block_p) |
1664 | abort (); | |
1665 | else | |
1666 | NOTE_BLOCK (copy) = *mapped_block_p; | |
1667 | } | |
e00c1338 RH |
1668 | else if (copy |
1669 | && NOTE_LINE_NUMBER (copy) == NOTE_INSN_EXPECTED_VALUE) | |
1670 | NOTE_EXPECTED_VALUE (copy) | |
1671 | = copy_rtx_and_substitute (NOTE_EXPECTED_VALUE (insn), | |
1672 | map, 0); | |
6adb4e3a | 1673 | } |
175160e7 MT |
1674 | else |
1675 | copy = 0; | |
1676 | break; | |
1677 | ||
1678 | default: | |
1679 | abort (); | |
175160e7 MT |
1680 | } |
1681 | ||
1682 | if (copy) | |
1683 | RTX_INTEGRATED_P (copy) = 1; | |
1684 | ||
1685 | map->insn_map[INSN_UID (insn)] = copy; | |
1686 | } | |
464186fb RH |
1687 | } |
1688 | ||
1689 | /* Copy the REG_NOTES. Increment const_age, so that only constants | |
1690 | from parameters can be substituted in. These are the only ones | |
1691 | that are valid across the entire function. */ | |
1692 | ||
1693 | static void | |
52a11cbf | 1694 | copy_insn_notes (insns, map, eh_region_offset) |
464186fb RH |
1695 | rtx insns; |
1696 | struct inline_remap *map; | |
52a11cbf | 1697 | int eh_region_offset; |
464186fb | 1698 | { |
8cd44271 | 1699 | rtx insn, new_insn; |
175160e7 | 1700 | |
e62d14be | 1701 | map->const_age++; |
175160e7 | 1702 | for (insn = insns; insn; insn = NEXT_INSN (insn)) |
8cd44271 RH |
1703 | { |
1704 | if (! INSN_P (insn)) | |
1705 | continue; | |
1706 | ||
1707 | new_insn = map->insn_map[INSN_UID (insn)]; | |
1708 | if (! new_insn) | |
1709 | continue; | |
1710 | ||
1711 | if (REG_NOTES (insn)) | |
1712 | { | |
1713 | rtx next, note = copy_rtx_and_substitute (REG_NOTES (insn), map, 0); | |
1714 | ||
1715 | /* We must also do subst_constants, in case one of our parameters | |
1716 | has const type and constant value. */ | |
1717 | subst_constants (¬e, NULL_RTX, map, 0); | |
1718 | apply_change_group (); | |
1719 | REG_NOTES (new_insn) = note; | |
1720 | ||
1721 | /* Delete any REG_LABEL notes from the chain. Remap any | |
1722 | REG_EH_REGION notes. */ | |
1723 | for (; note; note = next) | |
1724 | { | |
1725 | next = XEXP (note, 1); | |
1726 | if (REG_NOTE_KIND (note) == REG_LABEL) | |
1727 | remove_note (new_insn, note); | |
de5b49f2 RK |
1728 | else if (REG_NOTE_KIND (note) == REG_EH_REGION |
1729 | && INTVAL (XEXP (note, 0)) > 0) | |
52a11cbf RH |
1730 | XEXP (note, 0) = GEN_INT (INTVAL (XEXP (note, 0)) |
1731 | + eh_region_offset); | |
8cd44271 RH |
1732 | } |
1733 | } | |
1734 | ||
1735 | if (GET_CODE (insn) == CALL_INSN | |
1736 | && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER) | |
1737 | { | |
1738 | int i; | |
1739 | for (i = 0; i < 3; i++) | |
52a11cbf | 1740 | copy_insn_notes (XEXP (PATTERN (insn), i), map, eh_region_offset); |
8cd44271 | 1741 | } |
52a11cbf RH |
1742 | |
1743 | if (GET_CODE (insn) == JUMP_INSN | |
1744 | && GET_CODE (PATTERN (insn)) == RESX) | |
1745 | XINT (PATTERN (new_insn), 0) += eh_region_offset; | |
8cd44271 | 1746 | } |
175160e7 MT |
1747 | } |
1748 | \f | |
1749 | /* Given a chain of PARM_DECLs, ARGS, copy each decl into a VAR_DECL, | |
1750 | push all of those decls and give each one the corresponding home. */ | |
1751 | ||
1752 | static void | |
1753 | integrate_parm_decls (args, map, arg_vector) | |
1754 | tree args; | |
1755 | struct inline_remap *map; | |
1756 | rtvec arg_vector; | |
1757 | { | |
b3694847 SS |
1758 | tree tail; |
1759 | int i; | |
175160e7 MT |
1760 | |
1761 | for (tail = args, i = 0; tail; tail = TREE_CHAIN (tail), i++) | |
1762 | { | |
94755d92 MM |
1763 | tree decl = copy_decl_for_inlining (tail, map->fndecl, |
1764 | current_function_decl); | |
175160e7 | 1765 | rtx new_decl_rtl |
14a774a9 | 1766 | = copy_rtx_and_substitute (RTVEC_ELT (arg_vector, i), map, 1); |
175160e7 | 1767 | |
a76386d8 RK |
1768 | /* We really should be setting DECL_INCOMING_RTL to something reasonable |
1769 | here, but that's going to require some more work. */ | |
1770 | /* DECL_INCOMING_RTL (decl) = ?; */ | |
175160e7 MT |
1771 | /* Fully instantiate the address with the equivalent form so that the |
1772 | debugging information contains the actual register, instead of the | |
1773 | virtual register. Do this by not passing an insn to | |
1774 | subst_constants. */ | |
14a774a9 | 1775 | subst_constants (&new_decl_rtl, NULL_RTX, map, 1); |
175160e7 | 1776 | apply_change_group (); |
19e7881c | 1777 | SET_DECL_RTL (decl, new_decl_rtl); |
175160e7 MT |
1778 | } |
1779 | } | |
1780 | ||
1781 | /* Given a BLOCK node LET, push decls and levels so as to construct in the | |
1782 | current function a tree of contexts isomorphic to the one that is given. | |
1783 | ||
858a47b1 | 1784 | MAP, if nonzero, is a pointer to an inline_remap map which indicates how |
175160e7 | 1785 | registers used in the DECL_RTL field should be remapped. If it is zero, |
8ef63e62 | 1786 | no mapping is necessary. */ |
175160e7 | 1787 | |
21204d34 MM |
1788 | static tree |
1789 | integrate_decl_tree (let, map) | |
175160e7 | 1790 | tree let; |
175160e7 | 1791 | struct inline_remap *map; |
175160e7 | 1792 | { |
21204d34 MM |
1793 | tree t; |
1794 | tree new_block; | |
1795 | tree *next; | |
1796 | ||
1797 | new_block = make_node (BLOCK); | |
a97901e6 | 1798 | VARRAY_PUSH_TREE (map->block_map, new_block); |
21204d34 | 1799 | next = &BLOCK_VARS (new_block); |
175160e7 | 1800 | |
175160e7 MT |
1801 | for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t)) |
1802 | { | |
f6bad6ff JM |
1803 | tree d; |
1804 | ||
94755d92 | 1805 | d = copy_decl_for_inlining (t, map->fndecl, current_function_decl); |
f6bad6ff | 1806 | |
19e7881c | 1807 | if (DECL_RTL_SET_P (t)) |
175160e7 | 1808 | { |
19e7881c MM |
1809 | rtx r; |
1810 | ||
1811 | SET_DECL_RTL (d, copy_rtx_and_substitute (DECL_RTL (t), map, 1)); | |
14a774a9 | 1812 | |
175160e7 MT |
1813 | /* Fully instantiate the address with the equivalent form so that the |
1814 | debugging information contains the actual register, instead of the | |
1815 | virtual register. Do this by not passing an insn to | |
1816 | subst_constants. */ | |
19e7881c MM |
1817 | r = DECL_RTL (d); |
1818 | subst_constants (&r, NULL_RTX, map, 1); | |
1819 | SET_DECL_RTL (d, r); | |
0d4903b8 RK |
1820 | |
1821 | if (GET_CODE (r) == REG) | |
1822 | REGNO_DECL (REGNO (r)) = d; | |
1823 | else if (GET_CODE (r) == CONCAT) | |
1824 | { | |
1825 | REGNO_DECL (REGNO (XEXP (r, 0))) = d; | |
616051ac | 1826 | REGNO_DECL (REGNO (XEXP (r, 1))) = d; |
0d4903b8 RK |
1827 | } |
1828 | ||
175160e7 MT |
1829 | apply_change_group (); |
1830 | } | |
175160e7 | 1831 | |
21204d34 MM |
1832 | /* Add this declaration to the list of variables in the new |
1833 | block. */ | |
1834 | *next = d; | |
1835 | next = &TREE_CHAIN (d); | |
1836 | } | |
175160e7 | 1837 | |
21204d34 MM |
1838 | next = &BLOCK_SUBBLOCKS (new_block); |
1839 | for (t = BLOCK_SUBBLOCKS (let); t; t = BLOCK_CHAIN (t)) | |
a84efb51 JO |
1840 | { |
1841 | *next = integrate_decl_tree (t, map); | |
1842 | BLOCK_SUPERCONTEXT (*next) = new_block; | |
1843 | next = &BLOCK_CHAIN (*next); | |
1844 | } | |
21204d34 MM |
1845 | |
1846 | TREE_USED (new_block) = TREE_USED (let); | |
1847 | BLOCK_ABSTRACT_ORIGIN (new_block) = let; | |
00174bdf | 1848 | |
21204d34 | 1849 | return new_block; |
175160e7 MT |
1850 | } |
1851 | \f | |
14a774a9 | 1852 | /* Create a new copy of an rtx. Recursively copies the operands of the rtx, |
175160e7 MT |
1853 | except for those few rtx codes that are sharable. |
1854 | ||
1855 | We always return an rtx that is similar to that incoming rtx, with the | |
1856 | exception of possibly changing a REG to a SUBREG or vice versa. No | |
1857 | rtl is ever emitted. | |
1858 | ||
14a774a9 RK |
1859 | If FOR_LHS is nonzero, if means we are processing something that will |
1860 | be the LHS of a SET. In that case, we copy RTX_UNCHANGING_P even if | |
1861 | inlining since we need to be conservative in how it is set for | |
1862 | such cases. | |
1863 | ||
175160e7 MT |
1864 | Handle constants that need to be placed in the constant pool by |
1865 | calling `force_const_mem'. */ | |
1866 | ||
1867 | rtx | |
14a774a9 | 1868 | copy_rtx_and_substitute (orig, map, for_lhs) |
b3694847 | 1869 | rtx orig; |
175160e7 | 1870 | struct inline_remap *map; |
14a774a9 | 1871 | int for_lhs; |
175160e7 | 1872 | { |
b3694847 SS |
1873 | rtx copy, temp; |
1874 | int i, j; | |
1875 | RTX_CODE code; | |
1876 | enum machine_mode mode; | |
1877 | const char *format_ptr; | |
175160e7 MT |
1878 | int regno; |
1879 | ||
1880 | if (orig == 0) | |
1881 | return 0; | |
1882 | ||
1883 | code = GET_CODE (orig); | |
1884 | mode = GET_MODE (orig); | |
1885 | ||
1886 | switch (code) | |
1887 | { | |
1888 | case REG: | |
1889 | /* If the stack pointer register shows up, it must be part of | |
1890 | stack-adjustments (*not* because we eliminated the frame pointer!). | |
1891 | Small hard registers are returned as-is. Pseudo-registers | |
1892 | go through their `reg_map'. */ | |
1893 | regno = REGNO (orig); | |
f83a0992 JL |
1894 | if (regno <= LAST_VIRTUAL_REGISTER |
1895 | || (map->integrating | |
1896 | && DECL_SAVED_INSNS (map->fndecl)->internal_arg_pointer == orig)) | |
175160e7 MT |
1897 | { |
1898 | /* Some hard registers are also mapped, | |
1899 | but others are not translated. */ | |
c826ae21 | 1900 | if (map->reg_map[regno] != 0) |
175160e7 MT |
1901 | return map->reg_map[regno]; |
1902 | ||
1903 | /* If this is the virtual frame pointer, make space in current | |
1904 | function's stack frame for the stack frame of the inline function. | |
1905 | ||
1906 | Copy the address of this area into a pseudo. Map | |
1907 | virtual_stack_vars_rtx to this pseudo and set up a constant | |
1908 | equivalence for it to be the address. This will substitute the | |
1909 | address into insns where it can be substituted and use the new | |
1910 | pseudo where it can't. */ | |
b5d7770c | 1911 | else if (regno == VIRTUAL_STACK_VARS_REGNUM) |
175160e7 MT |
1912 | { |
1913 | rtx loc, seq; | |
49ad7cfa | 1914 | int size = get_func_frame_size (DECL_SAVED_INSNS (map->fndecl)); |
d219c7f1 | 1915 | #ifdef FRAME_GROWS_DOWNWARD |
c2f8b491 JH |
1916 | int alignment |
1917 | = (DECL_SAVED_INSNS (map->fndecl)->stack_alignment_needed | |
1918 | / BITS_PER_UNIT); | |
175160e7 | 1919 | |
3e42d56b DE |
1920 | /* In this case, virtual_stack_vars_rtx points to one byte |
1921 | higher than the top of the frame area. So make sure we | |
1922 | allocate a big enough chunk to keep the frame pointer | |
1923 | aligned like a real one. */ | |
c2f8b491 JH |
1924 | if (alignment) |
1925 | size = CEIL_ROUND (size, alignment); | |
3e42d56b | 1926 | #endif |
175160e7 MT |
1927 | start_sequence (); |
1928 | loc = assign_stack_temp (BLKmode, size, 1); | |
1929 | loc = XEXP (loc, 0); | |
1930 | #ifdef FRAME_GROWS_DOWNWARD | |
1931 | /* In this case, virtual_stack_vars_rtx points to one byte | |
1932 | higher than the top of the frame area. So compute the offset | |
3e42d56b DE |
1933 | to one byte higher than our substitute frame. */ |
1934 | loc = plus_constant (loc, size); | |
175160e7 | 1935 | #endif |
59b2d722 RK |
1936 | map->reg_map[regno] = temp |
1937 | = force_reg (Pmode, force_operand (loc, NULL_RTX)); | |
2b145ea8 | 1938 | |
12307ca2 | 1939 | #ifdef STACK_BOUNDARY |
bdb429a5 | 1940 | mark_reg_pointer (map->reg_map[regno], STACK_BOUNDARY); |
12307ca2 RK |
1941 | #endif |
1942 | ||
c68da89c | 1943 | SET_CONST_EQUIV_DATA (map, temp, loc, CONST_AGE_PARM); |
175160e7 | 1944 | |
2f937369 | 1945 | seq = get_insns (); |
175160e7 MT |
1946 | end_sequence (); |
1947 | emit_insn_after (seq, map->insns_at_start); | |
5c23c401 | 1948 | return temp; |
175160e7 | 1949 | } |
f83a0992 JL |
1950 | else if (regno == VIRTUAL_INCOMING_ARGS_REGNUM |
1951 | || (map->integrating | |
1952 | && (DECL_SAVED_INSNS (map->fndecl)->internal_arg_pointer | |
1953 | == orig))) | |
175160e7 MT |
1954 | { |
1955 | /* Do the same for a block to contain any arguments referenced | |
0f41302f | 1956 | in memory. */ |
175160e7 | 1957 | rtx loc, seq; |
49ad7cfa | 1958 | int size = DECL_SAVED_INSNS (map->fndecl)->args_size; |
175160e7 MT |
1959 | |
1960 | start_sequence (); | |
1961 | loc = assign_stack_temp (BLKmode, size, 1); | |
1962 | loc = XEXP (loc, 0); | |
00174bdf | 1963 | /* When arguments grow downward, the virtual incoming |
931553d8 | 1964 | args pointer points to the top of the argument block, |
0f41302f | 1965 | so the remapped location better do the same. */ |
931553d8 RS |
1966 | #ifdef ARGS_GROW_DOWNWARD |
1967 | loc = plus_constant (loc, size); | |
1968 | #endif | |
59b2d722 RK |
1969 | map->reg_map[regno] = temp |
1970 | = force_reg (Pmode, force_operand (loc, NULL_RTX)); | |
2b145ea8 | 1971 | |
12307ca2 | 1972 | #ifdef STACK_BOUNDARY |
bdb429a5 | 1973 | mark_reg_pointer (map->reg_map[regno], STACK_BOUNDARY); |
12307ca2 RK |
1974 | #endif |
1975 | ||
c68da89c | 1976 | SET_CONST_EQUIV_DATA (map, temp, loc, CONST_AGE_PARM); |
175160e7 | 1977 | |
2f937369 | 1978 | seq = get_insns (); |
175160e7 MT |
1979 | end_sequence (); |
1980 | emit_insn_after (seq, map->insns_at_start); | |
5c23c401 | 1981 | return temp; |
175160e7 MT |
1982 | } |
1983 | else if (REG_FUNCTION_VALUE_P (orig)) | |
1984 | { | |
1985 | /* This is a reference to the function return value. If | |
1986 | the function doesn't have a return value, error. If the | |
c36fce9a | 1987 | mode doesn't agree, and it ain't BLKmode, make a SUBREG. */ |
175160e7 | 1988 | if (map->inline_target == 0) |
ea55fa7a R |
1989 | { |
1990 | if (rtx_equal_function_value_matters) | |
1991 | /* This is an ignored return value. We must not | |
1992 | leave it in with REG_FUNCTION_VALUE_P set, since | |
1993 | that would confuse subsequent inlining of the | |
1994 | current function into a later function. */ | |
1995 | return gen_rtx_REG (GET_MODE (orig), regno); | |
1996 | else | |
1997 | /* Must be unrolling loops or replicating code if we | |
1998 | reach here, so return the register unchanged. */ | |
1999 | return orig; | |
2000 | } | |
60da674b RH |
2001 | else if (GET_MODE (map->inline_target) != BLKmode |
2002 | && mode != GET_MODE (map->inline_target)) | |
293e1467 | 2003 | return gen_lowpart (mode, map->inline_target); |
175160e7 MT |
2004 | else |
2005 | return map->inline_target; | |
2006 | } | |
b5d7770c AO |
2007 | #if defined (LEAF_REGISTERS) && defined (LEAF_REG_REMAP) |
2008 | /* If leaf_renumber_regs_insn() might remap this register to | |
2009 | some other number, make sure we don't share it with the | |
2010 | inlined function, otherwise delayed optimization of the | |
2011 | inlined function may change it in place, breaking our | |
2012 | reference to it. We may still shared it within the | |
2013 | function, so create an entry for this register in the | |
2014 | reg_map. */ | |
2015 | if (map->integrating && regno < FIRST_PSEUDO_REGISTER | |
2016 | && LEAF_REGISTERS[regno] && LEAF_REG_REMAP (regno) != regno) | |
2017 | { | |
c826ae21 MM |
2018 | if (!map->leaf_reg_map[regno][mode]) |
2019 | map->leaf_reg_map[regno][mode] = gen_rtx_REG (mode, regno); | |
2020 | return map->leaf_reg_map[regno][mode]; | |
b5d7770c AO |
2021 | } |
2022 | #endif | |
2023 | else | |
2024 | return orig; | |
2025 | ||
2026 | abort (); | |
175160e7 MT |
2027 | } |
2028 | if (map->reg_map[regno] == NULL) | |
2029 | { | |
2030 | map->reg_map[regno] = gen_reg_rtx (mode); | |
2031 | REG_USERVAR_P (map->reg_map[regno]) = REG_USERVAR_P (orig); | |
2032 | REG_LOOP_TEST_P (map->reg_map[regno]) = REG_LOOP_TEST_P (orig); | |
2033 | RTX_UNCHANGING_P (map->reg_map[regno]) = RTX_UNCHANGING_P (orig); | |
2034 | /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */ | |
12307ca2 | 2035 | |
3502dc9c | 2036 | if (REG_POINTER (map->x_regno_reg_rtx[regno])) |
12307ca2 RK |
2037 | mark_reg_pointer (map->reg_map[regno], |
2038 | map->regno_pointer_align[regno]); | |
175160e7 MT |
2039 | } |
2040 | return map->reg_map[regno]; | |
2041 | ||
2042 | case SUBREG: | |
14a774a9 | 2043 | copy = copy_rtx_and_substitute (SUBREG_REG (orig), map, for_lhs); |
e5c56fd9 JH |
2044 | return simplify_gen_subreg (GET_MODE (orig), copy, |
2045 | GET_MODE (SUBREG_REG (orig)), | |
2046 | SUBREG_BYTE (orig)); | |
175160e7 | 2047 | |
e9a25f70 | 2048 | case ADDRESSOF: |
38a448ca | 2049 | copy = gen_rtx_ADDRESSOF (mode, |
14a774a9 RK |
2050 | copy_rtx_and_substitute (XEXP (orig, 0), |
2051 | map, for_lhs), | |
00174bdf | 2052 | 0, ADDRESSOF_DECL (orig)); |
e9a25f70 JL |
2053 | regno = ADDRESSOF_REGNO (orig); |
2054 | if (map->reg_map[regno]) | |
2055 | regno = REGNO (map->reg_map[regno]); | |
2056 | else if (regno > LAST_VIRTUAL_REGISTER) | |
2057 | { | |
2058 | temp = XEXP (orig, 0); | |
2059 | map->reg_map[regno] = gen_reg_rtx (GET_MODE (temp)); | |
2060 | REG_USERVAR_P (map->reg_map[regno]) = REG_USERVAR_P (temp); | |
2061 | REG_LOOP_TEST_P (map->reg_map[regno]) = REG_LOOP_TEST_P (temp); | |
2062 | RTX_UNCHANGING_P (map->reg_map[regno]) = RTX_UNCHANGING_P (temp); | |
2063 | /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */ | |
2064 | ||
3502dc9c | 2065 | if (REG_POINTER (map->x_regno_reg_rtx[regno])) |
e9a25f70 JL |
2066 | mark_reg_pointer (map->reg_map[regno], |
2067 | map->regno_pointer_align[regno]); | |
2068 | regno = REGNO (map->reg_map[regno]); | |
2069 | } | |
2070 | ADDRESSOF_REGNO (copy) = regno; | |
2071 | return copy; | |
2072 | ||
175160e7 MT |
2073 | case USE: |
2074 | case CLOBBER: | |
2075 | /* USE and CLOBBER are ordinary, but we convert (use (subreg foo)) | |
d632e927 RS |
2076 | to (use foo) if the original insn didn't have a subreg. |
2077 | Removing the subreg distorts the VAX movstrhi pattern | |
2078 | by changing the mode of an operand. */ | |
14a774a9 | 2079 | copy = copy_rtx_and_substitute (XEXP (orig, 0), map, code == CLOBBER); |
d632e927 | 2080 | if (GET_CODE (copy) == SUBREG && GET_CODE (XEXP (orig, 0)) != SUBREG) |
175160e7 | 2081 | copy = SUBREG_REG (copy); |
38a448ca | 2082 | return gen_rtx_fmt_e (code, VOIDmode, copy); |
175160e7 | 2083 | |
bc8d3f91 JH |
2084 | /* We need to handle "deleted" labels that appear in the DECL_RTL |
2085 | of a LABEL_DECL. */ | |
2086 | case NOTE: | |
2087 | if (NOTE_LINE_NUMBER (orig) != NOTE_INSN_DELETED_LABEL) | |
2088 | break; | |
2089 | ||
dc297297 | 2090 | /* ... FALLTHRU ... */ |
175160e7 | 2091 | case CODE_LABEL: |
1f3d3a31 | 2092 | LABEL_PRESERVE_P (get_label_from_map (map, CODE_LABEL_NUMBER (orig))) |
175160e7 | 2093 | = LABEL_PRESERVE_P (orig); |
1f3d3a31 | 2094 | return get_label_from_map (map, CODE_LABEL_NUMBER (orig)); |
175160e7 MT |
2095 | |
2096 | case LABEL_REF: | |
c5c76735 JL |
2097 | copy |
2098 | = gen_rtx_LABEL_REF | |
2099 | (mode, | |
2100 | LABEL_REF_NONLOCAL_P (orig) ? XEXP (orig, 0) | |
2101 | : get_label_from_map (map, CODE_LABEL_NUMBER (XEXP (orig, 0)))); | |
2102 | ||
175160e7 | 2103 | LABEL_OUTSIDE_LOOP_P (copy) = LABEL_OUTSIDE_LOOP_P (orig); |
c1ceaaa6 RK |
2104 | |
2105 | /* The fact that this label was previously nonlocal does not mean | |
2106 | it still is, so we must check if it is within the range of | |
2107 | this function's labels. */ | |
2108 | LABEL_REF_NONLOCAL_P (copy) | |
2109 | = (LABEL_REF_NONLOCAL_P (orig) | |
2110 | && ! (CODE_LABEL_NUMBER (XEXP (copy, 0)) >= get_first_label_num () | |
2111 | && CODE_LABEL_NUMBER (XEXP (copy, 0)) < max_label_num ())); | |
81d57b8e RK |
2112 | |
2113 | /* If we have made a nonlocal label local, it means that this | |
9faa82d8 | 2114 | inlined call will be referring to our nonlocal goto handler. |
81d57b8e RK |
2115 | So make sure we create one for this block; we normally would |
2116 | not since this is not otherwise considered a "call". */ | |
2117 | if (LABEL_REF_NONLOCAL_P (orig) && ! LABEL_REF_NONLOCAL_P (copy)) | |
2118 | function_call_count++; | |
2119 | ||
175160e7 MT |
2120 | return copy; |
2121 | ||
2122 | case PC: | |
2123 | case CC0: | |
2124 | case CONST_INT: | |
69ef87e2 | 2125 | case CONST_VECTOR: |
f543676f JW |
2126 | return orig; |
2127 | ||
175160e7 | 2128 | case SYMBOL_REF: |
f543676f JW |
2129 | /* Symbols which represent the address of a label stored in the constant |
2130 | pool must be modified to point to a constant pool entry for the | |
2131 | remapped label. Otherwise, symbols are returned unchanged. */ | |
2132 | if (CONSTANT_POOL_ADDRESS_P (orig)) | |
2133 | { | |
01d939e8 | 2134 | struct function *f = inlining ? inlining : cfun; |
36edd3cc BS |
2135 | rtx constant = get_pool_constant_for_function (f, orig); |
2136 | enum machine_mode const_mode = get_pool_mode_for_function (f, orig); | |
2137 | if (inlining) | |
2138 | { | |
2139 | rtx temp = force_const_mem (const_mode, | |
14a774a9 RK |
2140 | copy_rtx_and_substitute (constant, |
2141 | map, 0)); | |
2142 | ||
36edd3cc BS |
2143 | #if 0 |
2144 | /* Legitimizing the address here is incorrect. | |
2145 | ||
2146 | Since we had a SYMBOL_REF before, we can assume it is valid | |
2147 | to have one in this position in the insn. | |
2148 | ||
2149 | Also, change_address may create new registers. These | |
2150 | registers will not have valid reg_map entries. This can | |
2151 | cause try_constants() to fail because assumes that all | |
2152 | registers in the rtx have valid reg_map entries, and it may | |
2153 | end up replacing one of these new registers with junk. */ | |
2154 | ||
2155 | if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0))) | |
2156 | temp = change_address (temp, GET_MODE (temp), XEXP (temp, 0)); | |
2157 | #endif | |
2158 | ||
2159 | temp = XEXP (temp, 0); | |
2160 | ||
2161 | #ifdef POINTERS_EXTEND_UNSIGNED | |
2162 | if (GET_MODE (temp) != GET_MODE (orig)) | |
2163 | temp = convert_memory_address (GET_MODE (orig), temp); | |
2164 | #endif | |
2165 | return temp; | |
2166 | } | |
2167 | else if (GET_CODE (constant) == LABEL_REF) | |
14a774a9 RK |
2168 | return XEXP (force_const_mem |
2169 | (GET_MODE (orig), | |
2170 | copy_rtx_and_substitute (constant, map, for_lhs)), | |
c1ceaaa6 | 2171 | 0); |
f543676f | 2172 | } |
c1ceaaa6 | 2173 | |
175160e7 MT |
2174 | return orig; |
2175 | ||
2176 | case CONST_DOUBLE: | |
2177 | /* We have to make a new copy of this CONST_DOUBLE because don't want | |
2178 | to use the old value of CONST_DOUBLE_MEM. Also, this may be a | |
2179 | duplicate of a CONST_DOUBLE we have already seen. */ | |
2180 | if (GET_MODE_CLASS (GET_MODE (orig)) == MODE_FLOAT) | |
2181 | { | |
2182 | REAL_VALUE_TYPE d; | |
2183 | ||
2184 | REAL_VALUE_FROM_CONST_DOUBLE (d, orig); | |
81fbaa41 | 2185 | return CONST_DOUBLE_FROM_REAL_VALUE (d, GET_MODE (orig)); |
175160e7 MT |
2186 | } |
2187 | else | |
2188 | return immed_double_const (CONST_DOUBLE_LOW (orig), | |
2189 | CONST_DOUBLE_HIGH (orig), VOIDmode); | |
2190 | ||
2191 | case CONST: | |
2192 | /* Make new constant pool entry for a constant | |
2193 | that was in the pool of the inline function. */ | |
2194 | if (RTX_INTEGRATED_P (orig)) | |
175160e7 | 2195 | abort (); |
36edd3cc | 2196 | break; |
175160e7 MT |
2197 | |
2198 | case ASM_OPERANDS: | |
6462bb43 AO |
2199 | /* If a single asm insn contains multiple output operands then |
2200 | it contains multiple ASM_OPERANDS rtx's that share the input | |
2201 | and constraint vecs. We must make sure that the copied insn | |
2202 | continues to share it. */ | |
2203 | if (map->orig_asm_operands_vector == ASM_OPERANDS_INPUT_VEC (orig)) | |
175160e7 MT |
2204 | { |
2205 | copy = rtx_alloc (ASM_OPERANDS); | |
2adc7f12 | 2206 | RTX_FLAG (copy, volatil) = RTX_FLAG (orig, volatil); |
dde068d9 | 2207 | PUT_MODE (copy, GET_MODE (orig)); |
6462bb43 AO |
2208 | ASM_OPERANDS_TEMPLATE (copy) = ASM_OPERANDS_TEMPLATE (orig); |
2209 | ASM_OPERANDS_OUTPUT_CONSTRAINT (copy) | |
2210 | = ASM_OPERANDS_OUTPUT_CONSTRAINT (orig); | |
2211 | ASM_OPERANDS_OUTPUT_IDX (copy) = ASM_OPERANDS_OUTPUT_IDX (orig); | |
2212 | ASM_OPERANDS_INPUT_VEC (copy) = map->copy_asm_operands_vector; | |
2213 | ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy) | |
2214 | = map->copy_asm_constraints_vector; | |
2215 | ASM_OPERANDS_SOURCE_FILE (copy) = ASM_OPERANDS_SOURCE_FILE (orig); | |
2216 | ASM_OPERANDS_SOURCE_LINE (copy) = ASM_OPERANDS_SOURCE_LINE (orig); | |
175160e7 MT |
2217 | return copy; |
2218 | } | |
2219 | break; | |
2220 | ||
2221 | case CALL: | |
2222 | /* This is given special treatment because the first | |
2223 | operand of a CALL is a (MEM ...) which may get | |
2224 | forced into a register for cse. This is undesirable | |
2225 | if function-address cse isn't wanted or if we won't do cse. */ | |
2226 | #ifndef NO_FUNCTION_CSE | |
2227 | if (! (optimize && ! flag_no_function_cse)) | |
2228 | #endif | |
8ac61af7 RK |
2229 | { |
2230 | rtx copy | |
2231 | = gen_rtx_MEM (GET_MODE (XEXP (orig, 0)), | |
2232 | copy_rtx_and_substitute (XEXP (XEXP (orig, 0), 0), | |
2233 | map, 0)); | |
2234 | ||
72403582 | 2235 | MEM_COPY_ATTRIBUTES (copy, XEXP (orig, 0)); |
8ac61af7 RK |
2236 | |
2237 | return | |
2238 | gen_rtx_CALL (GET_MODE (orig), copy, | |
2239 | copy_rtx_and_substitute (XEXP (orig, 1), map, 0)); | |
2240 | } | |
175160e7 MT |
2241 | break; |
2242 | ||
2243 | #if 0 | |
2244 | /* Must be ifdefed out for loop unrolling to work. */ | |
2245 | case RETURN: | |
2246 | abort (); | |
2247 | #endif | |
2248 | ||
2249 | case SET: | |
2250 | /* If this is setting fp or ap, it means that we have a nonlocal goto. | |
e9a25f70 | 2251 | Adjust the setting by the offset of the area we made. |
175160e7 MT |
2252 | If the nonlocal goto is into the current function, |
2253 | this will result in unnecessarily bad code, but should work. */ | |
2254 | if (SET_DEST (orig) == virtual_stack_vars_rtx | |
2255 | || SET_DEST (orig) == virtual_incoming_args_rtx) | |
e9a25f70 | 2256 | { |
00174bdf | 2257 | /* In case a translation hasn't occurred already, make one now. */ |
d6e6c585 JL |
2258 | rtx equiv_reg; |
2259 | rtx equiv_loc; | |
2260 | HOST_WIDE_INT loc_offset; | |
2261 | ||
14a774a9 | 2262 | copy_rtx_and_substitute (SET_DEST (orig), map, for_lhs); |
d6e6c585 | 2263 | equiv_reg = map->reg_map[REGNO (SET_DEST (orig))]; |
14a774a9 RK |
2264 | equiv_loc = VARRAY_CONST_EQUIV (map->const_equiv_varray, |
2265 | REGNO (equiv_reg)).rtx; | |
d6e6c585 | 2266 | loc_offset |
e9a25f70 | 2267 | = GET_CODE (equiv_loc) == REG ? 0 : INTVAL (XEXP (equiv_loc, 1)); |
00174bdf | 2268 | |
38a448ca RH |
2269 | return gen_rtx_SET (VOIDmode, SET_DEST (orig), |
2270 | force_operand | |
2271 | (plus_constant | |
14a774a9 RK |
2272 | (copy_rtx_and_substitute (SET_SRC (orig), |
2273 | map, 0), | |
38a448ca RH |
2274 | - loc_offset), |
2275 | NULL_RTX)); | |
e9a25f70 | 2276 | } |
14a774a9 RK |
2277 | else |
2278 | return gen_rtx_SET (VOIDmode, | |
2279 | copy_rtx_and_substitute (SET_DEST (orig), map, 1), | |
2280 | copy_rtx_and_substitute (SET_SRC (orig), map, 0)); | |
175160e7 MT |
2281 | break; |
2282 | ||
2283 | case MEM: | |
36edd3cc BS |
2284 | if (inlining |
2285 | && GET_CODE (XEXP (orig, 0)) == SYMBOL_REF | |
2286 | && CONSTANT_POOL_ADDRESS_P (XEXP (orig, 0))) | |
2287 | { | |
14a774a9 RK |
2288 | enum machine_mode const_mode |
2289 | = get_pool_mode_for_function (inlining, XEXP (orig, 0)); | |
2290 | rtx constant | |
2291 | = get_pool_constant_for_function (inlining, XEXP (orig, 0)); | |
2292 | ||
2293 | constant = copy_rtx_and_substitute (constant, map, 0); | |
2294 | ||
36edd3cc BS |
2295 | /* If this was an address of a constant pool entry that itself |
2296 | had to be placed in the constant pool, it might not be a | |
2297 | valid address. So the recursive call might have turned it | |
2298 | into a register. In that case, it isn't a constant any | |
2299 | more, so return it. This has the potential of changing a | |
2300 | MEM into a REG, but we'll assume that it safe. */ | |
2301 | if (! CONSTANT_P (constant)) | |
2302 | return constant; | |
14a774a9 | 2303 | |
36edd3cc BS |
2304 | return validize_mem (force_const_mem (const_mode, constant)); |
2305 | } | |
14a774a9 | 2306 | |
c81f560b RH |
2307 | copy = gen_rtx_MEM (mode, copy_rtx_and_substitute (XEXP (orig, 0), |
2308 | map, 0)); | |
2309 | MEM_COPY_ATTRIBUTES (copy, orig); | |
9674c842 RK |
2310 | |
2311 | /* If inlining and this is not for the LHS, turn off RTX_UNCHANGING_P | |
2312 | since this may be an indirect reference to a parameter and the | |
2313 | actual may not be readonly. */ | |
2314 | if (inlining && !for_lhs) | |
2315 | RTX_UNCHANGING_P (copy) = 0; | |
2316 | ||
175160e7 | 2317 | return copy; |
00174bdf | 2318 | |
e9a25f70 JL |
2319 | default: |
2320 | break; | |
175160e7 MT |
2321 | } |
2322 | ||
2323 | copy = rtx_alloc (code); | |
2324 | PUT_MODE (copy, mode); | |
2adc7f12 JJ |
2325 | RTX_FLAG (copy, in_struct) = RTX_FLAG (orig, in_struct); |
2326 | RTX_FLAG (copy, volatil) = RTX_FLAG (orig, volatil); | |
2327 | RTX_FLAG (copy, unchanging) = RTX_FLAG (orig, unchanging); | |
175160e7 MT |
2328 | |
2329 | format_ptr = GET_RTX_FORMAT (GET_CODE (copy)); | |
2330 | ||
2331 | for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++) | |
2332 | { | |
2333 | switch (*format_ptr++) | |
2334 | { | |
2335 | case '0': | |
ef178af3 ZW |
2336 | /* Copy this through the wide int field; that's safest. */ |
2337 | X0WINT (copy, i) = X0WINT (orig, i); | |
175160e7 MT |
2338 | break; |
2339 | ||
2340 | case 'e': | |
14a774a9 RK |
2341 | XEXP (copy, i) |
2342 | = copy_rtx_and_substitute (XEXP (orig, i), map, for_lhs); | |
175160e7 MT |
2343 | break; |
2344 | ||
2345 | case 'u': | |
2346 | /* Change any references to old-insns to point to the | |
2347 | corresponding copied insns. */ | |
2348 | XEXP (copy, i) = map->insn_map[INSN_UID (XEXP (orig, i))]; | |
2349 | break; | |
2350 | ||
2351 | case 'E': | |
2352 | XVEC (copy, i) = XVEC (orig, i); | |
2353 | if (XVEC (orig, i) != NULL && XVECLEN (orig, i) != 0) | |
2354 | { | |
2355 | XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i)); | |
2356 | for (j = 0; j < XVECLEN (copy, i); j++) | |
2357 | XVECEXP (copy, i, j) | |
14a774a9 RK |
2358 | = copy_rtx_and_substitute (XVECEXP (orig, i, j), |
2359 | map, for_lhs); | |
175160e7 MT |
2360 | } |
2361 | break; | |
2362 | ||
02bea8a8 RK |
2363 | case 'w': |
2364 | XWINT (copy, i) = XWINT (orig, i); | |
2365 | break; | |
2366 | ||
175160e7 MT |
2367 | case 'i': |
2368 | XINT (copy, i) = XINT (orig, i); | |
2369 | break; | |
2370 | ||
2371 | case 's': | |
2372 | XSTR (copy, i) = XSTR (orig, i); | |
2373 | break; | |
2374 | ||
8f985ec4 ZW |
2375 | case 't': |
2376 | XTREE (copy, i) = XTREE (orig, i); | |
2377 | break; | |
2378 | ||
175160e7 MT |
2379 | default: |
2380 | abort (); | |
2381 | } | |
2382 | } | |
2383 | ||
2384 | if (code == ASM_OPERANDS && map->orig_asm_operands_vector == 0) | |
2385 | { | |
6462bb43 AO |
2386 | map->orig_asm_operands_vector = ASM_OPERANDS_INPUT_VEC (orig); |
2387 | map->copy_asm_operands_vector = ASM_OPERANDS_INPUT_VEC (copy); | |
2388 | map->copy_asm_constraints_vector | |
2389 | = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy); | |
175160e7 MT |
2390 | } |
2391 | ||
2392 | return copy; | |
2393 | } | |
2394 | \f | |
2395 | /* Substitute known constant values into INSN, if that is valid. */ | |
2396 | ||
2397 | void | |
2398 | try_constants (insn, map) | |
2399 | rtx insn; | |
2400 | struct inline_remap *map; | |
2401 | { | |
2402 | int i; | |
2403 | ||
2404 | map->num_sets = 0; | |
175160e7 | 2405 | |
14a774a9 RK |
2406 | /* First try just updating addresses, then other things. This is |
2407 | important when we have something like the store of a constant | |
2408 | into memory and we can update the memory address but the machine | |
2409 | does not support a constant source. */ | |
2410 | subst_constants (&PATTERN (insn), insn, map, 1); | |
2411 | apply_change_group (); | |
2412 | subst_constants (&PATTERN (insn), insn, map, 0); | |
175160e7 MT |
2413 | apply_change_group (); |
2414 | ||
2415 | /* Show we don't know the value of anything stored or clobbered. */ | |
84832317 | 2416 | note_stores (PATTERN (insn), mark_stores, NULL); |
175160e7 MT |
2417 | map->last_pc_value = 0; |
2418 | #ifdef HAVE_cc0 | |
2419 | map->last_cc0_value = 0; | |
2420 | #endif | |
2421 | ||
2422 | /* Set up any constant equivalences made in this insn. */ | |
2423 | for (i = 0; i < map->num_sets; i++) | |
2424 | { | |
2425 | if (GET_CODE (map->equiv_sets[i].dest) == REG) | |
2426 | { | |
2427 | int regno = REGNO (map->equiv_sets[i].dest); | |
2428 | ||
c68da89c KR |
2429 | MAYBE_EXTEND_CONST_EQUIV_VARRAY (map, regno); |
2430 | if (VARRAY_CONST_EQUIV (map->const_equiv_varray, regno).rtx == 0 | |
2431 | /* Following clause is a hack to make case work where GNU C++ | |
2432 | reassigns a variable to make cse work right. */ | |
2433 | || ! rtx_equal_p (VARRAY_CONST_EQUIV (map->const_equiv_varray, | |
2434 | regno).rtx, | |
2435 | map->equiv_sets[i].equiv)) | |
2436 | SET_CONST_EQUIV_DATA (map, map->equiv_sets[i].dest, | |
2437 | map->equiv_sets[i].equiv, map->const_age); | |
175160e7 MT |
2438 | } |
2439 | else if (map->equiv_sets[i].dest == pc_rtx) | |
2440 | map->last_pc_value = map->equiv_sets[i].equiv; | |
2441 | #ifdef HAVE_cc0 | |
2442 | else if (map->equiv_sets[i].dest == cc0_rtx) | |
2443 | map->last_cc0_value = map->equiv_sets[i].equiv; | |
2444 | #endif | |
2445 | } | |
2446 | } | |
2447 | \f | |
2448 | /* Substitute known constants for pseudo regs in the contents of LOC, | |
2449 | which are part of INSN. | |
d45cf215 | 2450 | If INSN is zero, the substitution should always be done (this is used to |
175160e7 MT |
2451 | update DECL_RTL). |
2452 | These changes are taken out by try_constants if the result is not valid. | |
2453 | ||
2454 | Note that we are more concerned with determining when the result of a SET | |
2455 | is a constant, for further propagation, than actually inserting constants | |
2456 | into insns; cse will do the latter task better. | |
2457 | ||
2458 | This function is also used to adjust address of items previously addressed | |
00174bdf | 2459 | via the virtual stack variable or virtual incoming arguments registers. |
14a774a9 RK |
2460 | |
2461 | If MEMONLY is nonzero, only make changes inside a MEM. */ | |
175160e7 MT |
2462 | |
2463 | static void | |
14a774a9 | 2464 | subst_constants (loc, insn, map, memonly) |
175160e7 MT |
2465 | rtx *loc; |
2466 | rtx insn; | |
2467 | struct inline_remap *map; | |
14a774a9 | 2468 | int memonly; |
175160e7 MT |
2469 | { |
2470 | rtx x = *loc; | |
b3694847 SS |
2471 | int i, j; |
2472 | enum rtx_code code; | |
2473 | const char *format_ptr; | |
175160e7 MT |
2474 | int num_changes = num_validated_changes (); |
2475 | rtx new = 0; | |
a30d557c | 2476 | enum machine_mode op0_mode = MAX_MACHINE_MODE; |
175160e7 MT |
2477 | |
2478 | code = GET_CODE (x); | |
2479 | ||
2480 | switch (code) | |
2481 | { | |
2482 | case PC: | |
2483 | case CONST_INT: | |
2484 | case CONST_DOUBLE: | |
69ef87e2 | 2485 | case CONST_VECTOR: |
175160e7 MT |
2486 | case SYMBOL_REF: |
2487 | case CONST: | |
2488 | case LABEL_REF: | |
2489 | case ADDRESS: | |
2490 | return; | |
2491 | ||
2492 | #ifdef HAVE_cc0 | |
2493 | case CC0: | |
14a774a9 RK |
2494 | if (! memonly) |
2495 | validate_change (insn, loc, map->last_cc0_value, 1); | |
175160e7 MT |
2496 | return; |
2497 | #endif | |
2498 | ||
2499 | case USE: | |
2500 | case CLOBBER: | |
2501 | /* The only thing we can do with a USE or CLOBBER is possibly do | |
2502 | some substitutions in a MEM within it. */ | |
2503 | if (GET_CODE (XEXP (x, 0)) == MEM) | |
14a774a9 | 2504 | subst_constants (&XEXP (XEXP (x, 0), 0), insn, map, 0); |
175160e7 MT |
2505 | return; |
2506 | ||
2507 | case REG: | |
2508 | /* Substitute for parms and known constants. Don't replace | |
2509 | hard regs used as user variables with constants. */ | |
14a774a9 RK |
2510 | if (! memonly) |
2511 | { | |
2512 | int regno = REGNO (x); | |
2513 | struct const_equiv_data *p; | |
2514 | ||
2515 | if (! (regno < FIRST_PSEUDO_REGISTER && REG_USERVAR_P (x)) | |
2516 | && (size_t) regno < VARRAY_SIZE (map->const_equiv_varray) | |
2517 | && (p = &VARRAY_CONST_EQUIV (map->const_equiv_varray, regno), | |
2518 | p->rtx != 0) | |
2519 | && p->age >= map->const_age) | |
2520 | validate_change (insn, loc, p->rtx, 1); | |
2521 | } | |
2522 | return; | |
175160e7 MT |
2523 | |
2524 | case SUBREG: | |
637c5064 RS |
2525 | /* SUBREG applied to something other than a reg |
2526 | should be treated as ordinary, since that must | |
2527 | be a special hack and we don't know how to treat it specially. | |
2528 | Consider for example mulsidi3 in m68k.md. | |
2529 | Ordinary SUBREG of a REG needs this special treatment. */ | |
14a774a9 | 2530 | if (! memonly && GET_CODE (SUBREG_REG (x)) == REG) |
637c5064 RS |
2531 | { |
2532 | rtx inner = SUBREG_REG (x); | |
2533 | rtx new = 0; | |
175160e7 | 2534 | |
637c5064 RS |
2535 | /* We can't call subst_constants on &SUBREG_REG (x) because any |
2536 | constant or SUBREG wouldn't be valid inside our SUBEG. Instead, | |
2537 | see what is inside, try to form the new SUBREG and see if that is | |
00174bdf | 2538 | valid. We handle two cases: extracting a full word in an |
637c5064 | 2539 | integral mode and extracting the low part. */ |
14a774a9 | 2540 | subst_constants (&inner, NULL_RTX, map, 0); |
0631e0bf JH |
2541 | new = simplify_gen_subreg (GET_MODE (x), inner, |
2542 | GET_MODE (SUBREG_REG (x)), | |
2543 | SUBREG_BYTE (x)); | |
175160e7 | 2544 | |
637c5064 RS |
2545 | if (new) |
2546 | validate_change (insn, loc, new, 1); | |
0631e0bf JH |
2547 | else |
2548 | cancel_changes (num_changes); | |
175160e7 | 2549 | |
637c5064 RS |
2550 | return; |
2551 | } | |
2552 | break; | |
175160e7 MT |
2553 | |
2554 | case MEM: | |
14a774a9 | 2555 | subst_constants (&XEXP (x, 0), insn, map, 0); |
175160e7 MT |
2556 | |
2557 | /* If a memory address got spoiled, change it back. */ | |
14a774a9 RK |
2558 | if (! memonly && insn != 0 && num_validated_changes () != num_changes |
2559 | && ! memory_address_p (GET_MODE (x), XEXP (x, 0))) | |
175160e7 MT |
2560 | cancel_changes (num_changes); |
2561 | return; | |
2562 | ||
2563 | case SET: | |
2564 | { | |
2565 | /* Substitute constants in our source, and in any arguments to a | |
2566 | complex (e..g, ZERO_EXTRACT) destination, but not in the destination | |
2567 | itself. */ | |
2568 | rtx *dest_loc = &SET_DEST (x); | |
2569 | rtx dest = *dest_loc; | |
2570 | rtx src, tem; | |
96e60f0c JJ |
2571 | enum machine_mode compare_mode = VOIDmode; |
2572 | ||
2573 | /* If SET_SRC is a COMPARE which subst_constants would turn into | |
2574 | COMPARE of 2 VOIDmode constants, note the mode in which comparison | |
2575 | is to be done. */ | |
2576 | if (GET_CODE (SET_SRC (x)) == COMPARE) | |
2577 | { | |
2578 | src = SET_SRC (x); | |
2579 | if (GET_MODE_CLASS (GET_MODE (src)) == MODE_CC | |
2580 | #ifdef HAVE_cc0 | |
2581 | || dest == cc0_rtx | |
2582 | #endif | |
2583 | ) | |
2584 | { | |
2585 | compare_mode = GET_MODE (XEXP (src, 0)); | |
2586 | if (compare_mode == VOIDmode) | |
2587 | compare_mode = GET_MODE (XEXP (src, 1)); | |
2588 | } | |
2589 | } | |
175160e7 | 2590 | |
14a774a9 | 2591 | subst_constants (&SET_SRC (x), insn, map, memonly); |
175160e7 MT |
2592 | src = SET_SRC (x); |
2593 | ||
2594 | while (GET_CODE (*dest_loc) == ZERO_EXTRACT | |
175160e7 MT |
2595 | || GET_CODE (*dest_loc) == SUBREG |
2596 | || GET_CODE (*dest_loc) == STRICT_LOW_PART) | |
2597 | { | |
2598 | if (GET_CODE (*dest_loc) == ZERO_EXTRACT) | |
2599 | { | |
14a774a9 RK |
2600 | subst_constants (&XEXP (*dest_loc, 1), insn, map, memonly); |
2601 | subst_constants (&XEXP (*dest_loc, 2), insn, map, memonly); | |
175160e7 MT |
2602 | } |
2603 | dest_loc = &XEXP (*dest_loc, 0); | |
2604 | } | |
2605 | ||
91594e43 RS |
2606 | /* Do substitute in the address of a destination in memory. */ |
2607 | if (GET_CODE (*dest_loc) == MEM) | |
14a774a9 | 2608 | subst_constants (&XEXP (*dest_loc, 0), insn, map, 0); |
91594e43 | 2609 | |
175160e7 MT |
2610 | /* Check for the case of DEST a SUBREG, both it and the underlying |
2611 | register are less than one word, and the SUBREG has the wider mode. | |
2612 | In the case, we are really setting the underlying register to the | |
2613 | source converted to the mode of DEST. So indicate that. */ | |
2614 | if (GET_CODE (dest) == SUBREG | |
2615 | && GET_MODE_SIZE (GET_MODE (dest)) <= UNITS_PER_WORD | |
2616 | && GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest))) <= UNITS_PER_WORD | |
2617 | && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest))) | |
2618 | <= GET_MODE_SIZE (GET_MODE (dest))) | |
e2eb57b7 RK |
2619 | && (tem = gen_lowpart_if_possible (GET_MODE (SUBREG_REG (dest)), |
2620 | src))) | |
175160e7 MT |
2621 | src = tem, dest = SUBREG_REG (dest); |
2622 | ||
2623 | /* If storing a recognizable value save it for later recording. */ | |
2624 | if ((map->num_sets < MAX_RECOG_OPERANDS) | |
2625 | && (CONSTANT_P (src) | |
c9734bb9 | 2626 | || (GET_CODE (src) == REG |
83b93f40 RK |
2627 | && (REGNO (src) == VIRTUAL_INCOMING_ARGS_REGNUM |
2628 | || REGNO (src) == VIRTUAL_STACK_VARS_REGNUM)) | |
175160e7 MT |
2629 | || (GET_CODE (src) == PLUS |
2630 | && GET_CODE (XEXP (src, 0)) == REG | |
83b93f40 RK |
2631 | && (REGNO (XEXP (src, 0)) == VIRTUAL_INCOMING_ARGS_REGNUM |
2632 | || REGNO (XEXP (src, 0)) == VIRTUAL_STACK_VARS_REGNUM) | |
175160e7 MT |
2633 | && CONSTANT_P (XEXP (src, 1))) |
2634 | || GET_CODE (src) == COMPARE | |
2635 | #ifdef HAVE_cc0 | |
2636 | || dest == cc0_rtx | |
2637 | #endif | |
2638 | || (dest == pc_rtx | |
2639 | && (src == pc_rtx || GET_CODE (src) == RETURN | |
2640 | || GET_CODE (src) == LABEL_REF)))) | |
2641 | { | |
2642 | /* Normally, this copy won't do anything. But, if SRC is a COMPARE | |
2643 | it will cause us to save the COMPARE with any constants | |
2644 | substituted, which is what we want for later. */ | |
96e60f0c JJ |
2645 | rtx src_copy = copy_rtx (src); |
2646 | map->equiv_sets[map->num_sets].equiv = src_copy; | |
175160e7 | 2647 | map->equiv_sets[map->num_sets++].dest = dest; |
96e60f0c JJ |
2648 | if (compare_mode != VOIDmode |
2649 | && GET_CODE (src) == COMPARE | |
2650 | && (GET_MODE_CLASS (GET_MODE (src)) == MODE_CC | |
2651 | #ifdef HAVE_cc0 | |
2652 | || dest == cc0_rtx | |
2653 | #endif | |
2654 | ) | |
2655 | && GET_MODE (XEXP (src, 0)) == VOIDmode | |
2656 | && GET_MODE (XEXP (src, 1)) == VOIDmode) | |
2657 | { | |
2658 | map->compare_src = src_copy; | |
2659 | map->compare_mode = compare_mode; | |
2660 | } | |
175160e7 | 2661 | } |
175160e7 | 2662 | } |
e9a25f70 JL |
2663 | return; |
2664 | ||
2665 | default: | |
2666 | break; | |
175160e7 MT |
2667 | } |
2668 | ||
2669 | format_ptr = GET_RTX_FORMAT (code); | |
00174bdf | 2670 | |
175160e7 MT |
2671 | /* If the first operand is an expression, save its mode for later. */ |
2672 | if (*format_ptr == 'e') | |
2673 | op0_mode = GET_MODE (XEXP (x, 0)); | |
2674 | ||
2675 | for (i = 0; i < GET_RTX_LENGTH (code); i++) | |
2676 | { | |
2677 | switch (*format_ptr++) | |
2678 | { | |
2679 | case '0': | |
2680 | break; | |
2681 | ||
2682 | case 'e': | |
2683 | if (XEXP (x, i)) | |
14a774a9 | 2684 | subst_constants (&XEXP (x, i), insn, map, memonly); |
175160e7 MT |
2685 | break; |
2686 | ||
2687 | case 'u': | |
2688 | case 'i': | |
2689 | case 's': | |
02bea8a8 | 2690 | case 'w': |
00174bdf | 2691 | case 'n': |
8f985ec4 | 2692 | case 't': |
2ff581c3 | 2693 | case 'B': |
175160e7 MT |
2694 | break; |
2695 | ||
2696 | case 'E': | |
2697 | if (XVEC (x, i) != NULL && XVECLEN (x, i) != 0) | |
14a774a9 RK |
2698 | for (j = 0; j < XVECLEN (x, i); j++) |
2699 | subst_constants (&XVECEXP (x, i, j), insn, map, memonly); | |
2700 | ||
175160e7 MT |
2701 | break; |
2702 | ||
2703 | default: | |
2704 | abort (); | |
2705 | } | |
2706 | } | |
2707 | ||
2708 | /* If this is a commutative operation, move a constant to the second | |
2709 | operand unless the second operand is already a CONST_INT. */ | |
14a774a9 RK |
2710 | if (! memonly |
2711 | && (GET_RTX_CLASS (code) == 'c' || code == NE || code == EQ) | |
175160e7 MT |
2712 | && CONSTANT_P (XEXP (x, 0)) && GET_CODE (XEXP (x, 1)) != CONST_INT) |
2713 | { | |
2714 | rtx tem = XEXP (x, 0); | |
2715 | validate_change (insn, &XEXP (x, 0), XEXP (x, 1), 1); | |
2716 | validate_change (insn, &XEXP (x, 1), tem, 1); | |
2717 | } | |
2718 | ||
2719 | /* Simplify the expression in case we put in some constants. */ | |
14a774a9 RK |
2720 | if (! memonly) |
2721 | switch (GET_RTX_CLASS (code)) | |
175160e7 | 2722 | { |
14a774a9 RK |
2723 | case '1': |
2724 | if (op0_mode == MAX_MACHINE_MODE) | |
2725 | abort (); | |
2726 | new = simplify_unary_operation (code, GET_MODE (x), | |
2727 | XEXP (x, 0), op0_mode); | |
2728 | break; | |
2729 | ||
2730 | case '<': | |
2731 | { | |
2732 | enum machine_mode op_mode = GET_MODE (XEXP (x, 0)); | |
2733 | ||
2734 | if (op_mode == VOIDmode) | |
2735 | op_mode = GET_MODE (XEXP (x, 1)); | |
2736 | new = simplify_relational_operation (code, op_mode, | |
2737 | XEXP (x, 0), XEXP (x, 1)); | |
b565a316 | 2738 | #ifdef FLOAT_STORE_FLAG_VALUE |
14a774a9 | 2739 | if (new != 0 && GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT) |
12530dbe RH |
2740 | { |
2741 | enum machine_mode mode = GET_MODE (x); | |
2742 | if (new == const0_rtx) | |
2743 | new = CONST0_RTX (mode); | |
2744 | else | |
2745 | { | |
950a3816 KG |
2746 | REAL_VALUE_TYPE val; |
2747 | ||
2748 | /* Avoid automatic aggregate initialization. */ | |
2749 | val = FLOAT_STORE_FLAG_VALUE (mode); | |
12530dbe RH |
2750 | new = CONST_DOUBLE_FROM_REAL_VALUE (val, mode); |
2751 | } | |
2752 | } | |
b565a316 | 2753 | #endif |
14a774a9 | 2754 | break; |
00174bdf | 2755 | } |
175160e7 | 2756 | |
14a774a9 RK |
2757 | case '2': |
2758 | case 'c': | |
2759 | new = simplify_binary_operation (code, GET_MODE (x), | |
2760 | XEXP (x, 0), XEXP (x, 1)); | |
2761 | break; | |
175160e7 | 2762 | |
14a774a9 RK |
2763 | case 'b': |
2764 | case '3': | |
2765 | if (op0_mode == MAX_MACHINE_MODE) | |
2766 | abort (); | |
2767 | ||
96e60f0c JJ |
2768 | if (code == IF_THEN_ELSE) |
2769 | { | |
2770 | rtx op0 = XEXP (x, 0); | |
2771 | ||
2772 | if (GET_RTX_CLASS (GET_CODE (op0)) == '<' | |
2773 | && GET_MODE (op0) == VOIDmode | |
2774 | && ! side_effects_p (op0) | |
2775 | && XEXP (op0, 0) == map->compare_src | |
2776 | && GET_MODE (XEXP (op0, 1)) == VOIDmode) | |
2777 | { | |
2778 | /* We have compare of two VOIDmode constants for which | |
2779 | we recorded the comparison mode. */ | |
2780 | rtx temp = | |
2781 | simplify_relational_operation (GET_CODE (op0), | |
2782 | map->compare_mode, | |
2783 | XEXP (op0, 0), | |
2784 | XEXP (op0, 1)); | |
2785 | ||
2786 | if (temp == const0_rtx) | |
2787 | new = XEXP (x, 2); | |
2788 | else if (temp == const1_rtx) | |
2789 | new = XEXP (x, 1); | |
2790 | } | |
2791 | } | |
2792 | if (!new) | |
2793 | new = simplify_ternary_operation (code, GET_MODE (x), op0_mode, | |
2794 | XEXP (x, 0), XEXP (x, 1), | |
2795 | XEXP (x, 2)); | |
14a774a9 RK |
2796 | break; |
2797 | } | |
175160e7 MT |
2798 | |
2799 | if (new) | |
2800 | validate_change (insn, loc, new, 1); | |
2801 | } | |
2802 | ||
2803 | /* Show that register modified no longer contain known constants. We are | |
2804 | called from note_stores with parts of the new insn. */ | |
2805 | ||
915b80ed | 2806 | static void |
84832317 | 2807 | mark_stores (dest, x, data) |
175160e7 | 2808 | rtx dest; |
487a6e06 | 2809 | rtx x ATTRIBUTE_UNUSED; |
84832317 | 2810 | void *data ATTRIBUTE_UNUSED; |
175160e7 | 2811 | { |
e2eb57b7 | 2812 | int regno = -1; |
6a651371 | 2813 | enum machine_mode mode = VOIDmode; |
e2eb57b7 RK |
2814 | |
2815 | /* DEST is always the innermost thing set, except in the case of | |
2816 | SUBREGs of hard registers. */ | |
175160e7 MT |
2817 | |
2818 | if (GET_CODE (dest) == REG) | |
e2eb57b7 RK |
2819 | regno = REGNO (dest), mode = GET_MODE (dest); |
2820 | else if (GET_CODE (dest) == SUBREG && GET_CODE (SUBREG_REG (dest)) == REG) | |
2821 | { | |
ddef6bc7 JJ |
2822 | regno = REGNO (SUBREG_REG (dest)); |
2823 | if (regno < FIRST_PSEUDO_REGISTER) | |
2824 | regno += subreg_regno_offset (REGNO (SUBREG_REG (dest)), | |
2825 | GET_MODE (SUBREG_REG (dest)), | |
2826 | SUBREG_BYTE (dest), | |
2827 | GET_MODE (dest)); | |
e2eb57b7 RK |
2828 | mode = GET_MODE (SUBREG_REG (dest)); |
2829 | } | |
2830 | ||
2831 | if (regno >= 0) | |
2832 | { | |
770ae6cc RK |
2833 | unsigned int uregno = regno; |
2834 | unsigned int last_reg = (uregno >= FIRST_PSEUDO_REGISTER ? uregno | |
00174bdf | 2835 | : uregno + HARD_REGNO_NREGS (uregno, mode) - 1); |
770ae6cc | 2836 | unsigned int i; |
e2eb57b7 | 2837 | |
e9a25f70 JL |
2838 | /* Ignore virtual stack var or virtual arg register since those |
2839 | are handled separately. */ | |
770ae6cc RK |
2840 | if (uregno != VIRTUAL_INCOMING_ARGS_REGNUM |
2841 | && uregno != VIRTUAL_STACK_VARS_REGNUM) | |
2842 | for (i = uregno; i <= last_reg; i++) | |
6a651371 | 2843 | if ((size_t) i < VARRAY_SIZE (global_const_equiv_varray)) |
c68da89c | 2844 | VARRAY_CONST_EQUIV (global_const_equiv_varray, i).rtx = 0; |
e2eb57b7 | 2845 | } |
175160e7 MT |
2846 | } |
2847 | \f | |
81578142 RS |
2848 | /* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the |
2849 | given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so | |
2850 | that it points to the node itself, thus indicating that the node is its | |
2851 | own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for | |
2852 | the given node is NULL, recursively descend the decl/block tree which | |
2853 | it is the root of, and for each other ..._DECL or BLOCK node contained | |
2854 | therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also | |
2855 | still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN | |
2856 | values to point to themselves. */ | |
2857 | ||
81578142 RS |
2858 | static void |
2859 | set_block_origin_self (stmt) | |
b3694847 | 2860 | tree stmt; |
81578142 RS |
2861 | { |
2862 | if (BLOCK_ABSTRACT_ORIGIN (stmt) == NULL_TREE) | |
2863 | { | |
2864 | BLOCK_ABSTRACT_ORIGIN (stmt) = stmt; | |
2865 | ||
2866 | { | |
b3694847 | 2867 | tree local_decl; |
81578142 | 2868 | |
00174bdf | 2869 | for (local_decl = BLOCK_VARS (stmt); |
81578142 RS |
2870 | local_decl != NULL_TREE; |
2871 | local_decl = TREE_CHAIN (local_decl)) | |
00174bdf | 2872 | set_decl_origin_self (local_decl); /* Potential recursion. */ |
81578142 RS |
2873 | } |
2874 | ||
2875 | { | |
b3694847 | 2876 | tree subblock; |
81578142 | 2877 | |
00174bdf | 2878 | for (subblock = BLOCK_SUBBLOCKS (stmt); |
81578142 RS |
2879 | subblock != NULL_TREE; |
2880 | subblock = BLOCK_CHAIN (subblock)) | |
00174bdf | 2881 | set_block_origin_self (subblock); /* Recurse. */ |
81578142 RS |
2882 | } |
2883 | } | |
2884 | } | |
2885 | ||
2886 | /* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for | |
2887 | the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the | |
2888 | node to so that it points to the node itself, thus indicating that the | |
2889 | node represents its own (abstract) origin. Additionally, if the | |
2890 | DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend | |
2891 | the decl/block tree of which the given node is the root of, and for | |
2892 | each other ..._DECL or BLOCK node contained therein whose | |
2893 | DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL, | |
2894 | set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to | |
2895 | point to themselves. */ | |
2896 | ||
1cfdcc15 | 2897 | void |
81578142 | 2898 | set_decl_origin_self (decl) |
b3694847 | 2899 | tree decl; |
81578142 RS |
2900 | { |
2901 | if (DECL_ABSTRACT_ORIGIN (decl) == NULL_TREE) | |
2902 | { | |
2903 | DECL_ABSTRACT_ORIGIN (decl) = decl; | |
2904 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
2905 | { | |
b3694847 | 2906 | tree arg; |
81578142 RS |
2907 | |
2908 | for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg)) | |
2909 | DECL_ABSTRACT_ORIGIN (arg) = arg; | |
29d356fb RK |
2910 | if (DECL_INITIAL (decl) != NULL_TREE |
2911 | && DECL_INITIAL (decl) != error_mark_node) | |
81578142 RS |
2912 | set_block_origin_self (DECL_INITIAL (decl)); |
2913 | } | |
2914 | } | |
2915 | } | |
2916 | \f | |
2917 | /* Given a pointer to some BLOCK node, and a boolean value to set the | |
2918 | "abstract" flags to, set that value into the BLOCK_ABSTRACT flag for | |
2919 | the given block, and for all local decls and all local sub-blocks | |
2920 | (recursively) which are contained therein. */ | |
2921 | ||
81578142 RS |
2922 | static void |
2923 | set_block_abstract_flags (stmt, setting) | |
b3694847 SS |
2924 | tree stmt; |
2925 | int setting; | |
81578142 | 2926 | { |
b3694847 SS |
2927 | tree local_decl; |
2928 | tree subblock; | |
81578142 | 2929 | |
12307ca2 | 2930 | BLOCK_ABSTRACT (stmt) = setting; |
81578142 | 2931 | |
12307ca2 RK |
2932 | for (local_decl = BLOCK_VARS (stmt); |
2933 | local_decl != NULL_TREE; | |
2934 | local_decl = TREE_CHAIN (local_decl)) | |
2935 | set_decl_abstract_flags (local_decl, setting); | |
81578142 | 2936 | |
12307ca2 RK |
2937 | for (subblock = BLOCK_SUBBLOCKS (stmt); |
2938 | subblock != NULL_TREE; | |
2939 | subblock = BLOCK_CHAIN (subblock)) | |
2940 | set_block_abstract_flags (subblock, setting); | |
81578142 RS |
2941 | } |
2942 | ||
2943 | /* Given a pointer to some ..._DECL node, and a boolean value to set the | |
2944 | "abstract" flags to, set that value into the DECL_ABSTRACT flag for the | |
2945 | given decl, and (in the case where the decl is a FUNCTION_DECL) also | |
2946 | set the abstract flags for all of the parameters, local vars, local | |
2947 | blocks and sub-blocks (recursively) to the same setting. */ | |
2948 | ||
2949 | void | |
2950 | set_decl_abstract_flags (decl, setting) | |
b3694847 SS |
2951 | tree decl; |
2952 | int setting; | |
81578142 RS |
2953 | { |
2954 | DECL_ABSTRACT (decl) = setting; | |
2955 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
2956 | { | |
b3694847 | 2957 | tree arg; |
81578142 RS |
2958 | |
2959 | for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg)) | |
2960 | DECL_ABSTRACT (arg) = setting; | |
29d356fb RK |
2961 | if (DECL_INITIAL (decl) != NULL_TREE |
2962 | && DECL_INITIAL (decl) != error_mark_node) | |
81578142 RS |
2963 | set_block_abstract_flags (DECL_INITIAL (decl), setting); |
2964 | } | |
2965 | } | |
2966 | \f | |
175160e7 MT |
2967 | /* Output the assembly language code for the function FNDECL |
2968 | from its DECL_SAVED_INSNS. Used for inline functions that are output | |
2969 | at end of compilation instead of where they came in the source. */ | |
2970 | ||
2971 | void | |
2972 | output_inline_function (fndecl) | |
2973 | tree fndecl; | |
2974 | { | |
01d939e8 | 2975 | struct function *old_cfun = cfun; |
f93dacbd | 2976 | enum debug_info_type old_write_symbols = write_symbols; |
54b6670a | 2977 | const struct gcc_debug_hooks *const old_debug_hooks = debug_hooks; |
49ad7cfa | 2978 | struct function *f = DECL_SAVED_INSNS (fndecl); |
175160e7 | 2979 | |
01d939e8 | 2980 | cfun = f; |
175160e7 | 2981 | current_function_decl = fndecl; |
175160e7 | 2982 | |
49ad7cfa | 2983 | set_new_last_label_num (f->inl_max_label_num); |
175160e7 | 2984 | |
51783c14 JM |
2985 | /* We're not deferring this any longer. */ |
2986 | DECL_DEFER_OUTPUT (fndecl) = 0; | |
2987 | ||
f93dacbd RK |
2988 | /* If requested, suppress debugging information. */ |
2989 | if (f->no_debugging_symbols) | |
135d50f1 RK |
2990 | { |
2991 | write_symbols = NO_DEBUG; | |
2992 | debug_hooks = &do_nothing_debug_hooks; | |
2993 | } | |
f93dacbd | 2994 | |
ae6f2a1c ZW |
2995 | /* Compile this function all the way down to assembly code. As a |
2996 | side effect this destroys the saved RTL representation, but | |
2997 | that's okay, because we don't need to inline this anymore. */ | |
7d2e8eff | 2998 | rest_of_compilation (fndecl); |
f4744807 | 2999 | DECL_INLINE (fndecl) = 0; |
09578c27 | 3000 | |
01d939e8 BS |
3001 | cfun = old_cfun; |
3002 | current_function_decl = old_cfun ? old_cfun->decl : 0; | |
f93dacbd | 3003 | write_symbols = old_write_symbols; |
135d50f1 | 3004 | debug_hooks = old_debug_hooks; |
175160e7 | 3005 | } |
c0e7830f DD |
3006 | |
3007 | \f | |
3008 | /* Functions to keep track of the values hard regs had at the start of | |
3009 | the function. */ | |
3010 | ||
902197eb DD |
3011 | rtx |
3012 | get_hard_reg_initial_reg (fun, reg) | |
3013 | struct function *fun; | |
3014 | rtx reg; | |
3015 | { | |
3016 | struct initial_value_struct *ivs = fun->hard_reg_initial_vals; | |
3017 | int i; | |
3018 | ||
3019 | if (ivs == 0) | |
3020 | return NULL_RTX; | |
3021 | ||
3022 | for (i = 0; i < ivs->num_entries; i++) | |
3023 | if (rtx_equal_p (ivs->entries[i].pseudo, reg)) | |
3024 | return ivs->entries[i].hard_reg; | |
3025 | ||
3026 | return NULL_RTX; | |
3027 | } | |
3028 | ||
c0e7830f DD |
3029 | rtx |
3030 | has_func_hard_reg_initial_val (fun, reg) | |
3031 | struct function *fun; | |
3032 | rtx reg; | |
3033 | { | |
3034 | struct initial_value_struct *ivs = fun->hard_reg_initial_vals; | |
3035 | int i; | |
3036 | ||
3037 | if (ivs == 0) | |
3038 | return NULL_RTX; | |
3039 | ||
3040 | for (i = 0; i < ivs->num_entries; i++) | |
3041 | if (rtx_equal_p (ivs->entries[i].hard_reg, reg)) | |
3042 | return ivs->entries[i].pseudo; | |
3043 | ||
3044 | return NULL_RTX; | |
3045 | } | |
3046 | ||
3047 | rtx | |
3048 | get_func_hard_reg_initial_val (fun, reg) | |
3049 | struct function *fun; | |
3050 | rtx reg; | |
3051 | { | |
3052 | struct initial_value_struct *ivs = fun->hard_reg_initial_vals; | |
3053 | rtx rv = has_func_hard_reg_initial_val (fun, reg); | |
3054 | ||
3055 | if (rv) | |
3056 | return rv; | |
3057 | ||
3058 | if (ivs == 0) | |
3059 | { | |
e2500fed | 3060 | fun->hard_reg_initial_vals = (void *) ggc_alloc (sizeof (initial_value_struct)); |
c0e7830f DD |
3061 | ivs = fun->hard_reg_initial_vals; |
3062 | ivs->num_entries = 0; | |
3063 | ivs->max_entries = 5; | |
e2500fed | 3064 | ivs->entries = (initial_value_pair *) ggc_alloc (5 * sizeof (initial_value_pair)); |
c0e7830f DD |
3065 | } |
3066 | ||
3067 | if (ivs->num_entries >= ivs->max_entries) | |
3068 | { | |
3069 | ivs->max_entries += 5; | |
3070 | ivs->entries = | |
e2500fed GK |
3071 | (initial_value_pair *) ggc_realloc (ivs->entries, |
3072 | ivs->max_entries | |
3073 | * sizeof (initial_value_pair)); | |
c0e7830f DD |
3074 | } |
3075 | ||
3076 | ivs->entries[ivs->num_entries].hard_reg = reg; | |
3077 | ivs->entries[ivs->num_entries].pseudo = gen_reg_rtx (GET_MODE (reg)); | |
3078 | ||
3079 | return ivs->entries[ivs->num_entries++].pseudo; | |
3080 | } | |
3081 | ||
3082 | rtx | |
3083 | get_hard_reg_initial_val (mode, regno) | |
3084 | enum machine_mode mode; | |
3085 | int regno; | |
3086 | { | |
3087 | return get_func_hard_reg_initial_val (cfun, gen_rtx_REG (mode, regno)); | |
3088 | } | |
3089 | ||
3090 | rtx | |
3091 | has_hard_reg_initial_val (mode, regno) | |
3092 | enum machine_mode mode; | |
3093 | int regno; | |
3094 | { | |
3095 | return has_func_hard_reg_initial_val (cfun, gen_rtx_REG (mode, regno)); | |
3096 | } | |
3097 | ||
c0e7830f DD |
3098 | static void |
3099 | setup_initial_hard_reg_value_integration (inl_f, remap) | |
3100 | struct function *inl_f; | |
3101 | struct inline_remap *remap; | |
3102 | { | |
3103 | struct initial_value_struct *ivs = inl_f->hard_reg_initial_vals; | |
3104 | int i; | |
3105 | ||
3106 | if (ivs == 0) | |
3107 | return; | |
3108 | ||
3109 | for (i = 0; i < ivs->num_entries; i ++) | |
3110 | remap->reg_map[REGNO (ivs->entries[i].pseudo)] | |
3111 | = get_func_hard_reg_initial_val (cfun, ivs->entries[i].hard_reg); | |
3112 | } | |
3113 | ||
3114 | ||
3115 | void | |
3116 | emit_initial_value_sets () | |
3117 | { | |
3118 | struct initial_value_struct *ivs = cfun->hard_reg_initial_vals; | |
3119 | int i; | |
3120 | rtx seq; | |
3121 | ||
3122 | if (ivs == 0) | |
3123 | return; | |
3124 | ||
3125 | start_sequence (); | |
3126 | for (i = 0; i < ivs->num_entries; i++) | |
3127 | emit_move_insn (ivs->entries[i].pseudo, ivs->entries[i].hard_reg); | |
3128 | seq = get_insns (); | |
3129 | end_sequence (); | |
3130 | ||
2f937369 | 3131 | emit_insn_after (seq, get_insns ()); |
c0e7830f | 3132 | } |
385b6e2d R |
3133 | |
3134 | /* If the backend knows where to allocate pseudos for hard | |
3135 | register initial values, register these allocations now. */ | |
3136 | void | |
3137 | allocate_initial_values (reg_equiv_memory_loc) | |
97a4f671 | 3138 | rtx *reg_equiv_memory_loc ATTRIBUTE_UNUSED; |
385b6e2d R |
3139 | { |
3140 | #ifdef ALLOCATE_INITIAL_VALUE | |
3141 | struct initial_value_struct *ivs = cfun->hard_reg_initial_vals; | |
3142 | int i; | |
3143 | ||
3144 | if (ivs == 0) | |
3145 | return; | |
3146 | ||
3147 | for (i = 0; i < ivs->num_entries; i++) | |
3148 | { | |
3149 | int regno = REGNO (ivs->entries[i].pseudo); | |
3150 | rtx x = ALLOCATE_INITIAL_VALUE (ivs->entries[i].hard_reg); | |
3151 | ||
3152 | if (x == NULL_RTX || REG_N_SETS (REGNO (ivs->entries[i].pseudo)) > 1) | |
3153 | ; /* Do nothing. */ | |
3154 | else if (GET_CODE (x) == MEM) | |
3155 | reg_equiv_memory_loc[regno] = x; | |
3156 | else if (GET_CODE (x) == REG) | |
3157 | { | |
3158 | reg_renumber[regno] = REGNO (x); | |
3159 | /* Poke the regno right into regno_reg_rtx | |
3160 | so that even fixed regs are accepted. */ | |
3161 | REGNO (ivs->entries[i].pseudo) = REGNO (x); | |
3162 | } | |
3163 | else abort (); | |
3164 | } | |
3165 | #endif | |
3166 | } | |
e2500fed GK |
3167 | |
3168 | #include "gt-integrate.h" |