1 /* Procedure integration for GCC.
2 Copyright (C) 1988, 1991, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GCC.
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
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
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
32 #include "insn-config.h"
36 #include "integrate.h"
46 #include "langhooks.h"
48 /* Similar, but round to the next highest integer that meets the
50 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
52 /* Default max number of insns a function can have and still be inline.
53 This is overridden on RISC machines. */
54 #ifndef INTEGRATE_THRESHOLD
55 /* Inlining small functions might save more space then not inlining at
56 all. Assume 1 instruction for the call and 1.5 insns per argument. */
57 #define INTEGRATE_THRESHOLD(DECL) \
59 ? (1 + (3 * list_length (DECL_ARGUMENTS (DECL))) / 2) \
60 : (8 * (8 + list_length (DECL_ARGUMENTS (DECL)))))
64 /* Private type used by {get/has}_func_hard_reg_initial_val. */
65 typedef struct initial_value_pair
GTY(()) {
69 typedef struct initial_value_struct
GTY(()) {
72 initial_value_pair
* GTY ((length ("%h.num_entries"))) entries
;
73 } initial_value_struct
;
75 static void setup_initial_hard_reg_value_integration
PARAMS ((struct function
*, struct inline_remap
*));
77 static rtvec initialize_for_inline
PARAMS ((tree
));
78 static void note_modified_parmregs
PARAMS ((rtx
, rtx
, void *));
79 static void integrate_parm_decls
PARAMS ((tree
, struct inline_remap
*,
81 static tree integrate_decl_tree
PARAMS ((tree
,
82 struct inline_remap
*));
83 static void subst_constants
PARAMS ((rtx
*, rtx
,
84 struct inline_remap
*, int));
85 static void set_block_origin_self
PARAMS ((tree
));
86 static void set_block_abstract_flags
PARAMS ((tree
, int));
87 static void process_reg_param
PARAMS ((struct inline_remap
*, rtx
,
89 void set_decl_abstract_flags
PARAMS ((tree
, int));
90 static void mark_stores
PARAMS ((rtx
, rtx
, void *));
91 static void save_parm_insns
PARAMS ((rtx
, rtx
));
92 static void copy_insn_list
PARAMS ((rtx
, struct inline_remap
*,
94 static void copy_insn_notes
PARAMS ((rtx
, struct inline_remap
*,
96 static int compare_blocks
PARAMS ((const PTR
, const PTR
));
97 static int find_block
PARAMS ((const PTR
, const PTR
));
99 /* Used by copy_rtx_and_substitute; this indicates whether the function is
100 called for the purpose of inlining or some other purpose (i.e. loop
101 unrolling). This affects how constant pool references are handled.
102 This variable contains the FUNCTION_DECL for the inlined function. */
103 static struct function
*inlining
= 0;
105 /* Returns the Ith entry in the label_map contained in MAP. If the
106 Ith entry has not yet been set, return a fresh label. This function
107 performs a lazy initialization of label_map, thereby avoiding huge memory
108 explosions when the label_map gets very large. */
111 get_label_from_map (map
, i
)
112 struct inline_remap
*map
;
115 rtx x
= map
->label_map
[i
];
118 x
= map
->label_map
[i
] = gen_label_rtx ();
123 /* Return false if the function FNDECL cannot be inlined on account of its
124 attributes, true otherwise. */
126 function_attribute_inlinable_p (fndecl
)
129 if (targetm
.attribute_table
)
133 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
135 tree name
= TREE_PURPOSE (a
);
138 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
139 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
140 return (*targetm
.function_attribute_inlinable_p
) (fndecl
);
147 /* Zero if the current function (whose FUNCTION_DECL is FNDECL)
148 is safe and reasonable to integrate into other functions.
149 Nonzero means value is a warning msgid with a single %s
150 for the function's name. */
153 function_cannot_inline_p (fndecl
)
157 tree last
= tree_last (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
159 /* For functions marked as inline increase the maximum size to
160 MAX_INLINE_INSNS (-finline-limit-<n>). For regular functions
161 use the limit given by INTEGRATE_THRESHOLD. */
163 int max_insns
= (DECL_INLINE (fndecl
))
165 + 8 * list_length (DECL_ARGUMENTS (fndecl
)))
166 : INTEGRATE_THRESHOLD (fndecl
);
171 if (DECL_UNINLINABLE (fndecl
))
172 return N_("function cannot be inline");
174 /* No inlines with varargs. */
175 if (last
&& TREE_VALUE (last
) != void_type_node
)
176 return N_("varargs function cannot be inline");
178 if (current_function_calls_alloca
)
179 return N_("function using alloca cannot be inline");
181 if (current_function_calls_setjmp
)
182 return N_("function using setjmp cannot be inline");
184 if (current_function_calls_eh_return
)
185 return N_("function uses __builtin_eh_return");
187 if (current_function_contains_functions
)
188 return N_("function with nested functions cannot be inline");
192 N_("function with label addresses used in initializers cannot inline");
194 if (current_function_cannot_inline
)
195 return current_function_cannot_inline
;
197 /* If its not even close, don't even look. */
198 if (get_max_uid () > 3 * max_insns
)
199 return N_("function too large to be inline");
202 /* Don't inline functions which do not specify a function prototype and
203 have BLKmode argument or take the address of a parameter. */
204 for (parms
= DECL_ARGUMENTS (fndecl
); parms
; parms
= TREE_CHAIN (parms
))
206 if (TYPE_MODE (TREE_TYPE (parms
)) == BLKmode
)
207 TREE_ADDRESSABLE (parms
) = 1;
208 if (last
== NULL_TREE
&& TREE_ADDRESSABLE (parms
))
209 return N_("no prototype, and parameter address used; cannot be inline");
213 /* We can't inline functions that return structures
214 the old-fashioned PCC way, copying into a static block. */
215 if (current_function_returns_pcc_struct
)
216 return N_("inline functions not supported for this return value type");
218 /* We can't inline functions that return structures of varying size. */
219 if (TREE_CODE (TREE_TYPE (TREE_TYPE (fndecl
))) != VOID_TYPE
220 && int_size_in_bytes (TREE_TYPE (TREE_TYPE (fndecl
))) < 0)
221 return N_("function with varying-size return value cannot be inline");
223 /* Cannot inline a function with a varying size argument or one that
224 receives a transparent union. */
225 for (parms
= DECL_ARGUMENTS (fndecl
); parms
; parms
= TREE_CHAIN (parms
))
227 if (int_size_in_bytes (TREE_TYPE (parms
)) < 0)
228 return N_("function with varying-size parameter cannot be inline");
229 else if (TREE_CODE (TREE_TYPE (parms
)) == UNION_TYPE
230 && TYPE_TRANSPARENT_UNION (TREE_TYPE (parms
)))
231 return N_("function with transparent unit parameter cannot be inline");
234 if (get_max_uid () > max_insns
)
236 for (ninsns
= 0, insn
= get_first_nonparm_insn ();
237 insn
&& ninsns
< max_insns
;
238 insn
= NEXT_INSN (insn
))
242 if (ninsns
>= max_insns
)
243 return N_("function too large to be inline");
246 /* We will not inline a function which uses computed goto. The addresses of
247 its local labels, which may be tucked into global storage, are of course
248 not constant across instantiations, which causes unexpected behavior. */
249 if (current_function_has_computed_jump
)
250 return N_("function with computed jump cannot inline");
252 /* We cannot inline a nested function that jumps to a nonlocal label. */
253 if (current_function_has_nonlocal_goto
)
254 return N_("function with nonlocal goto cannot be inline");
256 /* We can't inline functions that return a PARALLEL rtx. */
257 if (DECL_RTL_SET_P (DECL_RESULT (fndecl
)))
259 rtx result
= DECL_RTL (DECL_RESULT (fndecl
));
260 if (GET_CODE (result
) == PARALLEL
)
261 return N_("inline functions not supported for this return value type");
264 /* If the function has a target specific attribute attached to it,
265 then we assume that we should not inline it. This can be overriden
266 by the target if it defines TARGET_FUNCTION_ATTRIBUTE_INLINABLE_P. */
267 if (!function_attribute_inlinable_p (fndecl
))
268 return N_("function with target specific attribute(s) cannot be inlined");
273 /* Map pseudo reg number into the PARM_DECL for the parm living in the reg.
274 Zero for a reg that isn't a parm's home.
275 Only reg numbers less than max_parm_reg are mapped here. */
276 static tree
*parmdecl_map
;
278 /* In save_for_inline, nonzero if past the parm-initialization insns. */
279 static int in_nonparm_insns
;
281 /* Subroutine for `save_for_inline'. Performs initialization
282 needed to save FNDECL's insns and info for future inline expansion. */
285 initialize_for_inline (fndecl
)
292 /* Clear out PARMDECL_MAP. It was allocated in the caller's frame. */
293 memset ((char *) parmdecl_map
, 0, max_parm_reg
* sizeof (tree
));
294 arg_vector
= rtvec_alloc (list_length (DECL_ARGUMENTS (fndecl
)));
296 for (parms
= DECL_ARGUMENTS (fndecl
), i
= 0;
298 parms
= TREE_CHAIN (parms
), i
++)
300 rtx p
= DECL_RTL (parms
);
302 /* If we have (mem (addressof (mem ...))), use the inner MEM since
303 otherwise the copy_rtx call below will not unshare the MEM since
304 it shares ADDRESSOF. */
305 if (GET_CODE (p
) == MEM
&& GET_CODE (XEXP (p
, 0)) == ADDRESSOF
306 && GET_CODE (XEXP (XEXP (p
, 0), 0)) == MEM
)
307 p
= XEXP (XEXP (p
, 0), 0);
309 RTVEC_ELT (arg_vector
, i
) = p
;
311 if (GET_CODE (p
) == REG
)
312 parmdecl_map
[REGNO (p
)] = parms
;
313 else if (GET_CODE (p
) == CONCAT
)
315 rtx preal
= gen_realpart (GET_MODE (XEXP (p
, 0)), p
);
316 rtx pimag
= gen_imagpart (GET_MODE (preal
), p
);
318 if (GET_CODE (preal
) == REG
)
319 parmdecl_map
[REGNO (preal
)] = parms
;
320 if (GET_CODE (pimag
) == REG
)
321 parmdecl_map
[REGNO (pimag
)] = parms
;
324 /* This flag is cleared later
325 if the function ever modifies the value of the parm. */
326 TREE_READONLY (parms
) = 1;
332 /* Copy NODE (which must be a DECL, but not a PARM_DECL). The DECL
333 originally was in the FROM_FN, but now it will be in the
337 copy_decl_for_inlining (decl
, from_fn
, to_fn
)
344 /* Copy the declaration. */
345 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
347 /* For a parameter, we must make an equivalent VAR_DECL, not a
349 copy
= build_decl (VAR_DECL
, DECL_NAME (decl
), TREE_TYPE (decl
));
350 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
351 TREE_READONLY (copy
) = TREE_READONLY (decl
);
352 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
356 copy
= copy_node (decl
);
357 (*lang_hooks
.dup_lang_specific_decl
) (copy
);
359 /* TREE_ADDRESSABLE isn't used to indicate that a label's
360 address has been taken; it's for internal bookkeeping in
361 expand_goto_internal. */
362 if (TREE_CODE (copy
) == LABEL_DECL
)
363 TREE_ADDRESSABLE (copy
) = 0;
366 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
367 declaration inspired this copy. */
368 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
370 /* The new variable/label has no RTL, yet. */
371 SET_DECL_RTL (copy
, NULL_RTX
);
373 /* These args would always appear unused, if not for this. */
374 TREE_USED (copy
) = 1;
376 /* Set the context for the new declaration. */
377 if (!DECL_CONTEXT (decl
))
378 /* Globals stay global. */
380 else if (DECL_CONTEXT (decl
) != from_fn
)
381 /* Things that weren't in the scope of the function we're inlining
382 from aren't in the scope we're inlining too, either. */
384 else if (TREE_STATIC (decl
))
385 /* Function-scoped static variables should say in the original
389 /* Ordinary automatic local variables are now in the scope of the
391 DECL_CONTEXT (copy
) = to_fn
;
396 /* Make the insns and PARM_DECLs of the current function permanent
397 and record other information in DECL_SAVED_INSNS to allow inlining
398 of this function in subsequent calls.
400 This routine need not copy any insns because we are not going
401 to immediately compile the insns in the insn chain. There
402 are two cases when we would compile the insns for FNDECL:
403 (1) when FNDECL is expanded inline, and (2) when FNDECL needs to
404 be output at the end of other compilation, because somebody took
405 its address. In the first case, the insns of FNDECL are copied
406 as it is expanded inline, so FNDECL's saved insns are not
407 modified. In the second case, FNDECL is used for the last time,
408 so modifying the rtl is not a problem.
410 We don't have to worry about FNDECL being inline expanded by
411 other functions which are written at the end of compilation
412 because flag_no_inline is turned on when we begin writing
413 functions at the end of compilation. */
416 save_for_inline (fndecl
)
421 rtx first_nonparm_insn
;
423 /* Set up PARMDECL_MAP which maps pseudo-reg number to its PARM_DECL.
424 Later we set TREE_READONLY to 0 if the parm is modified inside the fn.
425 Also set up ARG_VECTOR, which holds the unmodified DECL_RTX values
426 for the parms, prior to elimination of virtual registers.
427 These values are needed for substituting parms properly. */
428 if (! flag_no_inline
)
429 parmdecl_map
= (tree
*) xmalloc (max_parm_reg
* sizeof (tree
));
431 /* Make and emit a return-label if we have not already done so. */
433 if (return_label
== 0)
435 return_label
= gen_label_rtx ();
436 emit_label (return_label
);
439 if (! flag_no_inline
)
440 argvec
= initialize_for_inline (fndecl
);
444 /* Delete basic block notes created by early run of find_basic_block.
445 The notes would be later used by find_basic_blocks to reuse the memory
446 for basic_block structures on already freed obstack. */
447 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
448 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BASIC_BLOCK
)
449 delete_related_insns (insn
);
451 /* If there are insns that copy parms from the stack into pseudo registers,
452 those insns are not copied. `expand_inline_function' must
453 emit the correct code to handle such things. */
456 if (GET_CODE (insn
) != NOTE
)
459 if (! flag_no_inline
)
461 /* Get the insn which signals the end of parameter setup code. */
462 first_nonparm_insn
= get_first_nonparm_insn ();
464 /* Now just scan the chain of insns to see what happens to our
465 PARM_DECLs. If a PARM_DECL is used but never modified, we
466 can substitute its rtl directly when expanding inline (and
467 perform constant folding when its incoming value is
468 constant). Otherwise, we have to copy its value into a new
469 register and track the new register's life. */
470 in_nonparm_insns
= 0;
471 save_parm_insns (insn
, first_nonparm_insn
);
473 cfun
->inl_max_label_num
= max_label_num ();
474 cfun
->inl_last_parm_insn
= cfun
->x_last_parm_insn
;
475 cfun
->original_arg_vector
= argvec
;
477 cfun
->original_decl_initial
= DECL_INITIAL (fndecl
);
478 cfun
->no_debugging_symbols
= (write_symbols
== NO_DEBUG
);
479 DECL_SAVED_INSNS (fndecl
) = cfun
;
482 if (! flag_no_inline
)
486 /* Scan the chain of insns to see what happens to our PARM_DECLs. If a
487 PARM_DECL is used but never modified, we can substitute its rtl directly
488 when expanding inline (and perform constant folding when its incoming
489 value is constant). Otherwise, we have to copy its value into a new
490 register and track the new register's life. */
493 save_parm_insns (insn
, first_nonparm_insn
)
495 rtx first_nonparm_insn
;
497 if (insn
== NULL_RTX
)
500 for (insn
= NEXT_INSN (insn
); insn
; insn
= NEXT_INSN (insn
))
502 if (insn
== first_nonparm_insn
)
503 in_nonparm_insns
= 1;
507 /* Record what interesting things happen to our parameters. */
508 note_stores (PATTERN (insn
), note_modified_parmregs
, NULL
);
510 /* If this is a CALL_PLACEHOLDER insn then we need to look into the
511 three attached sequences: normal call, sibling call and tail
513 if (GET_CODE (insn
) == CALL_INSN
514 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
518 for (i
= 0; i
< 3; i
++)
519 save_parm_insns (XEXP (PATTERN (insn
), i
),
526 /* Note whether a parameter is modified or not. */
529 note_modified_parmregs (reg
, x
, data
)
531 rtx x ATTRIBUTE_UNUSED
;
532 void *data ATTRIBUTE_UNUSED
;
534 if (GET_CODE (reg
) == REG
&& in_nonparm_insns
535 && REGNO (reg
) < max_parm_reg
536 && REGNO (reg
) >= FIRST_PSEUDO_REGISTER
537 && parmdecl_map
[REGNO (reg
)] != 0)
538 TREE_READONLY (parmdecl_map
[REGNO (reg
)]) = 0;
541 /* Unfortunately, we need a global copy of const_equiv map for communication
542 with a function called from note_stores. Be *very* careful that this
543 is used properly in the presence of recursion. */
545 varray_type global_const_equiv_varray
;
547 #define FIXED_BASE_PLUS_P(X) \
548 (GET_CODE (X) == PLUS && GET_CODE (XEXP (X, 1)) == CONST_INT \
549 && GET_CODE (XEXP (X, 0)) == REG \
550 && REGNO (XEXP (X, 0)) >= FIRST_VIRTUAL_REGISTER \
551 && REGNO (XEXP (X, 0)) <= LAST_VIRTUAL_REGISTER)
553 /* Called to set up a mapping for the case where a parameter is in a
554 register. If it is read-only and our argument is a constant, set up the
555 constant equivalence.
557 If LOC is REG_USERVAR_P, the usual case, COPY must also have that flag set
560 Also, don't allow hard registers here; they might not be valid when
561 substituted into insns. */
563 process_reg_param (map
, loc
, copy
)
564 struct inline_remap
*map
;
567 if ((GET_CODE (copy
) != REG
&& GET_CODE (copy
) != SUBREG
)
568 || (GET_CODE (copy
) == REG
&& REG_USERVAR_P (loc
)
569 && ! REG_USERVAR_P (copy
))
570 || (GET_CODE (copy
) == REG
571 && REGNO (copy
) < FIRST_PSEUDO_REGISTER
))
573 rtx temp
= copy_to_mode_reg (GET_MODE (loc
), copy
);
574 REG_USERVAR_P (temp
) = REG_USERVAR_P (loc
);
575 if (CONSTANT_P (copy
) || FIXED_BASE_PLUS_P (copy
))
576 SET_CONST_EQUIV_DATA (map
, temp
, copy
, CONST_AGE_PARM
);
579 map
->reg_map
[REGNO (loc
)] = copy
;
582 /* Compare two BLOCKs for qsort. The key we sort on is the
583 BLOCK_ABSTRACT_ORIGIN of the blocks. We cannot just subtract the
584 two pointers, because it may overflow sizeof(int). */
587 compare_blocks (v1
, v2
)
591 tree b1
= *((const tree
*) v1
);
592 tree b2
= *((const tree
*) v2
);
593 char *p1
= (char *) BLOCK_ABSTRACT_ORIGIN (b1
);
594 char *p2
= (char *) BLOCK_ABSTRACT_ORIGIN (b2
);
598 return p1
< p2
? -1 : 1;
601 /* Compare two BLOCKs for bsearch. The first pointer corresponds to
602 an original block; the second to a remapped equivalent. */
609 const union tree_node
*b1
= (const union tree_node
*) v1
;
610 tree b2
= *((const tree
*) v2
);
611 char *p1
= (char *) b1
;
612 char *p2
= (char *) BLOCK_ABSTRACT_ORIGIN (b2
);
616 return p1
< p2
? -1 : 1;
619 /* Integrate the procedure defined by FNDECL. Note that this function
620 may wind up calling itself. Since the static variables are not
621 reentrant, we do not assign them until after the possibility
622 of recursion is eliminated.
624 If IGNORE is nonzero, do not produce a value.
625 Otherwise store the value in TARGET if it is nonzero and that is convenient.
628 (rtx)-1 if we could not substitute the function
629 0 if we substituted it and it does not produce a value
630 else an rtx for where the value is stored. */
633 expand_inline_function (fndecl
, parms
, target
, ignore
, type
,
634 structure_value_addr
)
639 rtx structure_value_addr
;
641 struct function
*inlining_previous
;
642 struct function
*inl_f
= DECL_SAVED_INSNS (fndecl
);
643 tree formal
, actual
, block
;
644 rtx parm_insns
= inl_f
->emit
->x_first_insn
;
645 rtx insns
= (inl_f
->inl_last_parm_insn
646 ? NEXT_INSN (inl_f
->inl_last_parm_insn
)
652 int min_labelno
= inl_f
->emit
->x_first_label_num
;
653 int max_labelno
= inl_f
->inl_max_label_num
;
658 struct inline_remap
*map
= 0;
659 rtvec arg_vector
= inl_f
->original_arg_vector
;
660 rtx static_chain_value
= 0;
662 int eh_region_offset
;
664 /* The pointer used to track the true location of the memory used
665 for MAP->LABEL_MAP. */
666 rtx
*real_label_map
= 0;
668 /* Allow for equivalences of the pseudos we make for virtual fp and ap. */
669 max_regno
= inl_f
->emit
->x_reg_rtx_no
+ 3;
670 if (max_regno
< FIRST_PSEUDO_REGISTER
)
673 /* Pull out the decl for the function definition; fndecl may be a
674 local declaration, which would break DECL_ABSTRACT_ORIGIN. */
675 fndecl
= inl_f
->decl
;
677 nargs
= list_length (DECL_ARGUMENTS (fndecl
));
679 if (cfun
->preferred_stack_boundary
< inl_f
->preferred_stack_boundary
)
680 cfun
->preferred_stack_boundary
= inl_f
->preferred_stack_boundary
;
682 /* Check that the parms type match and that sufficient arguments were
683 passed. Since the appropriate conversions or default promotions have
684 already been applied, the machine modes should match exactly. */
686 for (formal
= DECL_ARGUMENTS (fndecl
), actual
= parms
;
688 formal
= TREE_CHAIN (formal
), actual
= TREE_CHAIN (actual
))
691 enum machine_mode mode
;
694 return (rtx
) (size_t) -1;
696 arg
= TREE_VALUE (actual
);
697 mode
= TYPE_MODE (DECL_ARG_TYPE (formal
));
699 if (arg
== error_mark_node
700 || mode
!= TYPE_MODE (TREE_TYPE (arg
))
701 /* If they are block mode, the types should match exactly.
702 They don't match exactly if TREE_TYPE (FORMAL) == ERROR_MARK_NODE,
703 which could happen if the parameter has incomplete type. */
705 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg
))
706 != TYPE_MAIN_VARIANT (TREE_TYPE (formal
)))))
707 return (rtx
) (size_t) -1;
710 /* Extra arguments are valid, but will be ignored below, so we must
711 evaluate them here for side-effects. */
712 for (; actual
; actual
= TREE_CHAIN (actual
))
713 expand_expr (TREE_VALUE (actual
), const0_rtx
,
714 TYPE_MODE (TREE_TYPE (TREE_VALUE (actual
))), 0);
716 /* Expand the function arguments. Do this first so that any
717 new registers get created before we allocate the maps. */
719 arg_vals
= (rtx
*) xmalloc (nargs
* sizeof (rtx
));
720 arg_trees
= (tree
*) xmalloc (nargs
* sizeof (tree
));
722 for (formal
= DECL_ARGUMENTS (fndecl
), actual
= parms
, i
= 0;
724 formal
= TREE_CHAIN (formal
), actual
= TREE_CHAIN (actual
), i
++)
726 /* Actual parameter, converted to the type of the argument within the
728 tree arg
= convert (TREE_TYPE (formal
), TREE_VALUE (actual
));
729 /* Mode of the variable used within the function. */
730 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (formal
));
734 loc
= RTVEC_ELT (arg_vector
, i
);
736 /* If this is an object passed by invisible reference, we copy the
737 object into a stack slot and save its address. If this will go
738 into memory, we do nothing now. Otherwise, we just expand the
740 if (GET_CODE (loc
) == MEM
&& GET_CODE (XEXP (loc
, 0)) == REG
741 && REGNO (XEXP (loc
, 0)) > LAST_VIRTUAL_REGISTER
)
743 rtx stack_slot
= assign_temp (TREE_TYPE (arg
), 1, 1, 1);
745 store_expr (arg
, stack_slot
, 0);
746 arg_vals
[i
] = XEXP (stack_slot
, 0);
749 else if (GET_CODE (loc
) != MEM
)
751 if (GET_MODE (loc
) != TYPE_MODE (TREE_TYPE (arg
)))
753 int unsignedp
= TREE_UNSIGNED (TREE_TYPE (formal
));
754 enum machine_mode pmode
= TYPE_MODE (TREE_TYPE (formal
));
756 pmode
= promote_mode (TREE_TYPE (formal
), pmode
,
759 if (GET_MODE (loc
) != pmode
)
762 /* The mode if LOC and ARG can differ if LOC was a variable
763 that had its mode promoted via PROMOTED_MODE. */
764 arg_vals
[i
] = convert_modes (pmode
,
765 TYPE_MODE (TREE_TYPE (arg
)),
766 expand_expr (arg
, NULL_RTX
, mode
,
771 arg_vals
[i
] = expand_expr (arg
, NULL_RTX
, mode
, EXPAND_SUM
);
777 && (! TREE_READONLY (formal
)
778 /* If the parameter is not read-only, copy our argument through
779 a register. Also, we cannot use ARG_VALS[I] if it overlaps
780 TARGET in any way. In the inline function, they will likely
781 be two different pseudos, and `safe_from_p' will make all
782 sorts of smart assumptions about their not conflicting.
783 But if ARG_VALS[I] overlaps TARGET, these assumptions are
784 wrong, so put ARG_VALS[I] into a fresh register.
785 Don't worry about invisible references, since their stack
786 temps will never overlap the target. */
789 && (GET_CODE (arg_vals
[i
]) == REG
790 || GET_CODE (arg_vals
[i
]) == SUBREG
791 || GET_CODE (arg_vals
[i
]) == MEM
)
792 && reg_overlap_mentioned_p (arg_vals
[i
], target
))
793 /* ??? We must always copy a SUBREG into a REG, because it might
794 get substituted into an address, and not all ports correctly
795 handle SUBREGs in addresses. */
796 || (GET_CODE (arg_vals
[i
]) == SUBREG
)))
797 arg_vals
[i
] = copy_to_mode_reg (GET_MODE (loc
), arg_vals
[i
]);
799 if (arg_vals
[i
] != 0 && GET_CODE (arg_vals
[i
]) == REG
800 && POINTER_TYPE_P (TREE_TYPE (formal
)))
801 mark_reg_pointer (arg_vals
[i
],
802 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (formal
))));
805 /* Allocate the structures we use to remap things. */
807 map
= (struct inline_remap
*) xcalloc (1, sizeof (struct inline_remap
));
808 map
->fndecl
= fndecl
;
810 VARRAY_TREE_INIT (map
->block_map
, 10, "block_map");
811 map
->reg_map
= (rtx
*) xcalloc (max_regno
, sizeof (rtx
));
813 /* We used to use alloca here, but the size of what it would try to
814 allocate would occasionally cause it to exceed the stack limit and
815 cause unpredictable core dumps. */
817 = (rtx
*) xmalloc ((max_labelno
) * sizeof (rtx
));
818 map
->label_map
= real_label_map
;
819 map
->local_return_label
= NULL_RTX
;
821 inl_max_uid
= (inl_f
->emit
->x_cur_insn_uid
+ 1);
822 map
->insn_map
= (rtx
*) xcalloc (inl_max_uid
, sizeof (rtx
));
824 map
->max_insnno
= inl_max_uid
;
826 map
->integrating
= 1;
827 map
->compare_src
= NULL_RTX
;
828 map
->compare_mode
= VOIDmode
;
830 /* const_equiv_varray maps pseudos in our routine to constants, so
831 it needs to be large enough for all our pseudos. This is the
832 number we are currently using plus the number in the called
833 routine, plus 15 for each arg, five to compute the virtual frame
834 pointer, and five for the return value. This should be enough
835 for most cases. We do not reference entries outside the range of
838 ??? These numbers are quite arbitrary and were obtained by
839 experimentation. At some point, we should try to allocate the
840 table after all the parameters are set up so we an more accurately
841 estimate the number of pseudos we will need. */
843 VARRAY_CONST_EQUIV_INIT (map
->const_equiv_varray
,
845 + (max_regno
- FIRST_PSEUDO_REGISTER
)
848 "expand_inline_function");
851 /* Record the current insn in case we have to set up pointers to frame
852 and argument memory blocks. If there are no insns yet, add a dummy
853 insn that can be used as an insertion point. */
854 map
->insns_at_start
= get_last_insn ();
855 if (map
->insns_at_start
== 0)
856 map
->insns_at_start
= emit_note (NULL
, NOTE_INSN_DELETED
);
858 map
->regno_pointer_align
= inl_f
->emit
->regno_pointer_align
;
859 map
->x_regno_reg_rtx
= inl_f
->emit
->x_regno_reg_rtx
;
861 /* Update the outgoing argument size to allow for those in the inlined
863 if (inl_f
->outgoing_args_size
> current_function_outgoing_args_size
)
864 current_function_outgoing_args_size
= inl_f
->outgoing_args_size
;
866 /* If the inline function needs to make PIC references, that means
867 that this function's PIC offset table must be used. */
868 if (inl_f
->uses_pic_offset_table
)
869 current_function_uses_pic_offset_table
= 1;
871 /* If this function needs a context, set it up. */
872 if (inl_f
->needs_context
)
873 static_chain_value
= lookup_static_chain (fndecl
);
875 if (GET_CODE (parm_insns
) == NOTE
876 && NOTE_LINE_NUMBER (parm_insns
) > 0)
878 rtx note
= emit_note (NOTE_SOURCE_FILE (parm_insns
),
879 NOTE_LINE_NUMBER (parm_insns
));
881 RTX_INTEGRATED_P (note
) = 1;
884 /* Process each argument. For each, set up things so that the function's
885 reference to the argument will refer to the argument being passed.
886 We only replace REG with REG here. Any simplifications are done
889 We make two passes: In the first, we deal with parameters that will
890 be placed into registers, since we need to ensure that the allocated
891 register number fits in const_equiv_map. Then we store all non-register
892 parameters into their memory location. */
894 /* Don't try to free temp stack slots here, because we may put one of the
895 parameters into a temp stack slot. */
897 for (i
= 0; i
< nargs
; i
++)
899 rtx copy
= arg_vals
[i
];
901 loc
= RTVEC_ELT (arg_vector
, i
);
903 /* There are three cases, each handled separately. */
904 if (GET_CODE (loc
) == MEM
&& GET_CODE (XEXP (loc
, 0)) == REG
905 && REGNO (XEXP (loc
, 0)) > LAST_VIRTUAL_REGISTER
)
907 /* This must be an object passed by invisible reference (it could
908 also be a variable-sized object, but we forbid inlining functions
909 with variable-sized arguments). COPY is the address of the
910 actual value (this computation will cause it to be copied). We
911 map that address for the register, noting the actual address as
912 an equivalent in case it can be substituted into the insns. */
914 if (GET_CODE (copy
) != REG
)
916 temp
= copy_addr_to_reg (copy
);
917 if (CONSTANT_P (copy
) || FIXED_BASE_PLUS_P (copy
))
918 SET_CONST_EQUIV_DATA (map
, temp
, copy
, CONST_AGE_PARM
);
921 map
->reg_map
[REGNO (XEXP (loc
, 0))] = copy
;
923 else if (GET_CODE (loc
) == MEM
)
925 /* This is the case of a parameter that lives in memory. It
926 will live in the block we allocate in the called routine's
927 frame that simulates the incoming argument area. Do nothing
928 with the parameter now; we will call store_expr later. In
929 this case, however, we must ensure that the virtual stack and
930 incoming arg rtx values are expanded now so that we can be
931 sure we have enough slots in the const equiv map since the
932 store_expr call can easily blow the size estimate. */
933 if (DECL_SAVED_INSNS (fndecl
)->args_size
!= 0)
934 copy_rtx_and_substitute (virtual_incoming_args_rtx
, map
, 0);
936 else if (GET_CODE (loc
) == REG
)
937 process_reg_param (map
, loc
, copy
);
938 else if (GET_CODE (loc
) == CONCAT
)
940 rtx locreal
= gen_realpart (GET_MODE (XEXP (loc
, 0)), loc
);
941 rtx locimag
= gen_imagpart (GET_MODE (XEXP (loc
, 0)), loc
);
942 rtx copyreal
= gen_realpart (GET_MODE (locreal
), copy
);
943 rtx copyimag
= gen_imagpart (GET_MODE (locimag
), copy
);
945 process_reg_param (map
, locreal
, copyreal
);
946 process_reg_param (map
, locimag
, copyimag
);
952 /* Tell copy_rtx_and_substitute to handle constant pool SYMBOL_REFs
953 specially. This function can be called recursively, so we need to
954 save the previous value. */
955 inlining_previous
= inlining
;
958 /* Now do the parameters that will be placed in memory. */
960 for (formal
= DECL_ARGUMENTS (fndecl
), i
= 0;
961 formal
; formal
= TREE_CHAIN (formal
), i
++)
963 loc
= RTVEC_ELT (arg_vector
, i
);
965 if (GET_CODE (loc
) == MEM
966 /* Exclude case handled above. */
967 && ! (GET_CODE (XEXP (loc
, 0)) == REG
968 && REGNO (XEXP (loc
, 0)) > LAST_VIRTUAL_REGISTER
))
970 rtx note
= emit_note (DECL_SOURCE_FILE (formal
),
971 DECL_SOURCE_LINE (formal
));
973 RTX_INTEGRATED_P (note
) = 1;
975 /* Compute the address in the area we reserved and store the
977 temp
= copy_rtx_and_substitute (loc
, map
, 1);
978 subst_constants (&temp
, NULL_RTX
, map
, 1);
979 apply_change_group ();
980 if (! memory_address_p (GET_MODE (temp
), XEXP (temp
, 0)))
981 temp
= change_address (temp
, VOIDmode
, XEXP (temp
, 0));
982 store_expr (arg_trees
[i
], temp
, 0);
986 /* Deal with the places that the function puts its result.
987 We are driven by what is placed into DECL_RESULT.
989 Initially, we assume that we don't have anything special handling for
990 REG_FUNCTION_RETURN_VALUE_P. */
992 map
->inline_target
= 0;
993 loc
= (DECL_RTL_SET_P (DECL_RESULT (fndecl
))
994 ? DECL_RTL (DECL_RESULT (fndecl
)) : NULL_RTX
);
996 if (TYPE_MODE (type
) == VOIDmode
)
997 /* There is no return value to worry about. */
999 else if (GET_CODE (loc
) == MEM
)
1001 if (GET_CODE (XEXP (loc
, 0)) == ADDRESSOF
)
1003 temp
= copy_rtx_and_substitute (loc
, map
, 1);
1004 subst_constants (&temp
, NULL_RTX
, map
, 1);
1005 apply_change_group ();
1010 if (! structure_value_addr
1011 || ! aggregate_value_p (DECL_RESULT (fndecl
)))
1014 /* Pass the function the address in which to return a structure
1015 value. Note that a constructor can cause someone to call us
1016 with STRUCTURE_VALUE_ADDR, but the initialization takes place
1017 via the first parameter, rather than the struct return address.
1019 We have two cases: If the address is a simple register
1020 indirect, use the mapping mechanism to point that register to
1021 our structure return address. Otherwise, store the structure
1022 return value into the place that it will be referenced from. */
1024 if (GET_CODE (XEXP (loc
, 0)) == REG
)
1026 temp
= force_operand (structure_value_addr
, NULL_RTX
);
1027 temp
= force_reg (Pmode
, temp
);
1028 /* A virtual register might be invalid in an insn, because
1029 it can cause trouble in reload. Since we don't have access
1030 to the expanders at map translation time, make sure we have
1031 a proper register now.
1032 If a virtual register is actually valid, cse or combine
1033 can put it into the mapped insns. */
1034 if (REGNO (temp
) >= FIRST_VIRTUAL_REGISTER
1035 && REGNO (temp
) <= LAST_VIRTUAL_REGISTER
)
1036 temp
= copy_to_mode_reg (Pmode
, temp
);
1037 map
->reg_map
[REGNO (XEXP (loc
, 0))] = temp
;
1039 if (CONSTANT_P (structure_value_addr
)
1040 || GET_CODE (structure_value_addr
) == ADDRESSOF
1041 || (GET_CODE (structure_value_addr
) == PLUS
1042 && (XEXP (structure_value_addr
, 0)
1043 == virtual_stack_vars_rtx
)
1044 && (GET_CODE (XEXP (structure_value_addr
, 1))
1047 SET_CONST_EQUIV_DATA (map
, temp
, structure_value_addr
,
1053 temp
= copy_rtx_and_substitute (loc
, map
, 1);
1054 subst_constants (&temp
, NULL_RTX
, map
, 0);
1055 apply_change_group ();
1056 emit_move_insn (temp
, structure_value_addr
);
1061 /* We will ignore the result value, so don't look at its structure.
1062 Note that preparations for an aggregate return value
1063 do need to be made (above) even if it will be ignored. */
1065 else if (GET_CODE (loc
) == REG
)
1067 /* The function returns an object in a register and we use the return
1068 value. Set up our target for remapping. */
1070 /* Machine mode function was declared to return. */
1071 enum machine_mode departing_mode
= TYPE_MODE (type
);
1072 /* (Possibly wider) machine mode it actually computes
1073 (for the sake of callers that fail to declare it right).
1074 We have to use the mode of the result's RTL, rather than
1075 its type, since expand_function_start may have promoted it. */
1076 enum machine_mode arriving_mode
1077 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl
)));
1080 /* Don't use MEMs as direct targets because on some machines
1081 substituting a MEM for a REG makes invalid insns.
1082 Let the combiner substitute the MEM if that is valid. */
1083 if (target
== 0 || GET_CODE (target
) != REG
1084 || GET_MODE (target
) != departing_mode
)
1086 /* Don't make BLKmode registers. If this looks like
1087 a BLKmode object being returned in a register, get
1088 the mode from that, otherwise abort. */
1089 if (departing_mode
== BLKmode
)
1091 if (REG
== GET_CODE (DECL_RTL (DECL_RESULT (fndecl
))))
1093 departing_mode
= GET_MODE (DECL_RTL (DECL_RESULT (fndecl
)));
1094 arriving_mode
= departing_mode
;
1100 target
= gen_reg_rtx (departing_mode
);
1103 /* If function's value was promoted before return,
1104 avoid machine mode mismatch when we substitute INLINE_TARGET.
1105 But TARGET is what we will return to the caller. */
1106 if (arriving_mode
!= departing_mode
)
1108 /* Avoid creating a paradoxical subreg wider than
1109 BITS_PER_WORD, since that is illegal. */
1110 if (GET_MODE_BITSIZE (arriving_mode
) > BITS_PER_WORD
)
1112 if (!TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (departing_mode
),
1113 GET_MODE_BITSIZE (arriving_mode
)))
1114 /* Maybe could be handled by using convert_move () ? */
1116 reg_to_map
= gen_reg_rtx (arriving_mode
);
1117 target
= gen_lowpart (departing_mode
, reg_to_map
);
1120 reg_to_map
= gen_rtx_SUBREG (arriving_mode
, target
, 0);
1123 reg_to_map
= target
;
1125 /* Usually, the result value is the machine's return register.
1126 Sometimes it may be a pseudo. Handle both cases. */
1127 if (REG_FUNCTION_VALUE_P (loc
))
1128 map
->inline_target
= reg_to_map
;
1130 map
->reg_map
[REGNO (loc
)] = reg_to_map
;
1132 else if (GET_CODE (loc
) == CONCAT
)
1134 enum machine_mode departing_mode
= TYPE_MODE (type
);
1135 enum machine_mode arriving_mode
1136 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl
)));
1138 if (departing_mode
!= arriving_mode
)
1140 if (GET_CODE (XEXP (loc
, 0)) != REG
1141 || GET_CODE (XEXP (loc
, 1)) != REG
)
1144 /* Don't use MEMs as direct targets because on some machines
1145 substituting a MEM for a REG makes invalid insns.
1146 Let the combiner substitute the MEM if that is valid. */
1147 if (target
== 0 || GET_CODE (target
) != REG
1148 || GET_MODE (target
) != departing_mode
)
1149 target
= gen_reg_rtx (departing_mode
);
1151 if (GET_CODE (target
) != CONCAT
)
1154 map
->reg_map
[REGNO (XEXP (loc
, 0))] = XEXP (target
, 0);
1155 map
->reg_map
[REGNO (XEXP (loc
, 1))] = XEXP (target
, 1);
1160 /* Remap the exception handler data pointer from one to the other. */
1161 temp
= get_exception_pointer (inl_f
);
1163 map
->reg_map
[REGNO (temp
)] = get_exception_pointer (cfun
);
1165 /* Initialize label_map. get_label_from_map will actually make
1167 memset ((char *) &map
->label_map
[min_labelno
], 0,
1168 (max_labelno
- min_labelno
) * sizeof (rtx
));
1170 /* Make copies of the decls of the symbols in the inline function, so that
1171 the copies of the variables get declared in the current function. Set
1172 up things so that lookup_static_chain knows that to interpret registers
1173 in SAVE_EXPRs for TYPE_SIZEs as local. */
1174 inline_function_decl
= fndecl
;
1175 integrate_parm_decls (DECL_ARGUMENTS (fndecl
), map
, arg_vector
);
1176 block
= integrate_decl_tree (inl_f
->original_decl_initial
, map
);
1177 BLOCK_ABSTRACT_ORIGIN (block
) = DECL_ORIGIN (fndecl
);
1178 inline_function_decl
= 0;
1180 /* Make a fresh binding contour that we can easily remove. Do this after
1181 expanding our arguments so cleanups are properly scoped. */
1182 expand_start_bindings_and_block (0, block
);
1184 /* Sort the block-map so that it will be easy to find remapped
1186 qsort (&VARRAY_TREE (map
->block_map
, 0),
1187 map
->block_map
->elements_used
,
1191 /* Perform postincrements before actually calling the function. */
1194 /* Clean up stack so that variables might have smaller offsets. */
1195 do_pending_stack_adjust ();
1197 /* Save a copy of the location of const_equiv_varray for
1198 mark_stores, called via note_stores. */
1199 global_const_equiv_varray
= map
->const_equiv_varray
;
1201 /* If the called function does an alloca, save and restore the
1202 stack pointer around the call. This saves stack space, but
1203 also is required if this inline is being done between two
1205 if (inl_f
->calls_alloca
)
1206 emit_stack_save (SAVE_BLOCK
, &stack_save
, NULL_RTX
);
1208 /* Map pseudos used for initial hard reg values. */
1209 setup_initial_hard_reg_value_integration (inl_f
, map
);
1211 /* Now copy the insns one by one. */
1212 copy_insn_list (insns
, map
, static_chain_value
);
1214 /* Duplicate the EH regions. This will create an offset from the
1215 region numbers in the function we're inlining to the region
1216 numbers in the calling function. This must wait until after
1217 copy_insn_list, as we need the insn map to be complete. */
1218 eh_region_offset
= duplicate_eh_regions (inl_f
, map
);
1220 /* Now copy the REG_NOTES for those insns. */
1221 copy_insn_notes (insns
, map
, eh_region_offset
);
1223 /* If the insn sequence required one, emit the return label. */
1224 if (map
->local_return_label
)
1225 emit_label (map
->local_return_label
);
1227 /* Restore the stack pointer if we saved it above. */
1228 if (inl_f
->calls_alloca
)
1229 emit_stack_restore (SAVE_BLOCK
, stack_save
, NULL_RTX
);
1231 if (! cfun
->x_whole_function_mode_p
)
1232 /* In statement-at-a-time mode, we just tell the front-end to add
1233 this block to the list of blocks at this binding level. We
1234 can't do it the way it's done for function-at-a-time mode the
1235 superblocks have not been created yet. */
1236 (*lang_hooks
.decls
.insert_block
) (block
);
1240 = BLOCK_CHAIN (DECL_INITIAL (current_function_decl
));
1241 BLOCK_CHAIN (DECL_INITIAL (current_function_decl
)) = block
;
1244 /* End the scope containing the copied formal parameter variables
1245 and copied LABEL_DECLs. We pass NULL_TREE for the variables list
1246 here so that expand_end_bindings will not check for unused
1247 variables. That's already been checked for when the inlined
1248 function was defined. */
1249 expand_end_bindings (NULL_TREE
, 1, 1);
1251 /* Must mark the line number note after inlined functions as a repeat, so
1252 that the test coverage code can avoid counting the call twice. This
1253 just tells the code to ignore the immediately following line note, since
1254 there already exists a copy of this note before the expanded inline call.
1255 This line number note is still needed for debugging though, so we can't
1257 if (flag_test_coverage
)
1258 emit_note (0, NOTE_INSN_REPEATED_LINE_NUMBER
);
1260 emit_line_note (input_filename
, lineno
);
1262 /* If the function returns a BLKmode object in a register, copy it
1263 out of the temp register into a BLKmode memory object. */
1265 && TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl
))) == BLKmode
1266 && ! aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl
))))
1267 target
= copy_blkmode_from_reg (0, target
, TREE_TYPE (TREE_TYPE (fndecl
)));
1269 if (structure_value_addr
)
1271 target
= gen_rtx_MEM (TYPE_MODE (type
),
1272 memory_address (TYPE_MODE (type
),
1273 structure_value_addr
));
1274 set_mem_attributes (target
, type
, 1);
1277 /* Make sure we free the things we explicitly allocated with xmalloc. */
1279 free (real_label_map
);
1280 VARRAY_FREE (map
->const_equiv_varray
);
1281 free (map
->reg_map
);
1282 free (map
->insn_map
);
1287 inlining
= inlining_previous
;
1292 /* Make copies of each insn in the given list using the mapping
1293 computed in expand_inline_function. This function may call itself for
1294 insns containing sequences.
1296 Copying is done in two passes, first the insns and then their REG_NOTES.
1298 If static_chain_value is non-zero, it represents the context-pointer
1299 register for the function. */
1302 copy_insn_list (insns
, map
, static_chain_value
)
1304 struct inline_remap
*map
;
1305 rtx static_chain_value
;
1313 rtx static_chain_mem
= 0;
1315 /* Copy the insns one by one. Do this in two passes, first the insns and
1316 then their REG_NOTES. */
1318 /* This loop is very similar to the loop in copy_loop_body in unroll.c. */
1320 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
1322 rtx copy
, pattern
, set
;
1324 map
->orig_asm_operands_vector
= 0;
1326 switch (GET_CODE (insn
))
1329 pattern
= PATTERN (insn
);
1330 set
= single_set (insn
);
1332 if (GET_CODE (pattern
) == USE
1333 && GET_CODE (XEXP (pattern
, 0)) == REG
1334 && REG_FUNCTION_VALUE_P (XEXP (pattern
, 0)))
1335 /* The (USE (REG n)) at return from the function should
1336 be ignored since we are changing (REG n) into
1340 /* Ignore setting a function value that we don't want to use. */
1341 if (map
->inline_target
== 0
1343 && GET_CODE (SET_DEST (set
)) == REG
1344 && REG_FUNCTION_VALUE_P (SET_DEST (set
)))
1346 if (volatile_refs_p (SET_SRC (set
)))
1350 /* If we must not delete the source,
1351 load it into a new temporary. */
1352 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1354 new_set
= single_set (copy
);
1359 = gen_reg_rtx (GET_MODE (SET_DEST (new_set
)));
1361 /* If the source and destination are the same and it
1362 has a note on it, keep the insn. */
1363 else if (rtx_equal_p (SET_DEST (set
), SET_SRC (set
))
1364 && REG_NOTES (insn
) != 0)
1365 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1370 /* Similarly if an ignored return value is clobbered. */
1371 else if (map
->inline_target
== 0
1372 && GET_CODE (pattern
) == CLOBBER
1373 && GET_CODE (XEXP (pattern
, 0)) == REG
1374 && REG_FUNCTION_VALUE_P (XEXP (pattern
, 0)))
1377 /* Look for the address of the static chain slot. The
1378 rtx_equal_p comparisons against the
1379 static_chain_incoming_rtx below may fail if the static
1380 chain is in memory and the address specified is not
1381 "legitimate". This happens on Xtensa where the static
1382 chain is at a negative offset from argp and where only
1383 positive offsets are legitimate. When the RTL is
1384 generated, the address is "legitimized" by copying it
1385 into a register, causing the rtx_equal_p comparisons to
1386 fail. This workaround looks for code that sets a
1387 register to the address of the static chain. Subsequent
1388 memory references via that register can then be
1389 identified as static chain references. We assume that
1390 the register is only assigned once, and that the static
1391 chain address is only live in one register at a time. */
1393 else if (static_chain_value
!= 0
1395 && GET_CODE (static_chain_incoming_rtx
) == MEM
1396 && GET_CODE (SET_DEST (set
)) == REG
1397 && rtx_equal_p (SET_SRC (set
),
1398 XEXP (static_chain_incoming_rtx
, 0)))
1401 gen_rtx_MEM (GET_MODE (static_chain_incoming_rtx
),
1404 /* emit the instruction in case it is used for something
1405 other than setting the static chain; if it's not used,
1406 it can always be removed as dead code */
1407 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1410 /* If this is setting the static chain rtx, omit it. */
1411 else if (static_chain_value
!= 0
1413 && (rtx_equal_p (SET_DEST (set
),
1414 static_chain_incoming_rtx
)
1415 || (static_chain_mem
1416 && rtx_equal_p (SET_DEST (set
), static_chain_mem
))))
1419 /* If this is setting the static chain pseudo, set it from
1420 the value we want to give it instead. */
1421 else if (static_chain_value
!= 0
1423 && (rtx_equal_p (SET_SRC (set
),
1424 static_chain_incoming_rtx
)
1425 || (static_chain_mem
1426 && rtx_equal_p (SET_SRC (set
), static_chain_mem
))))
1428 rtx newdest
= copy_rtx_and_substitute (SET_DEST (set
), map
, 1);
1430 copy
= emit_move_insn (newdest
, static_chain_value
);
1431 if (GET_CODE (static_chain_incoming_rtx
) != MEM
)
1432 static_chain_value
= 0;
1435 /* If this is setting the virtual stack vars register, this must
1436 be the code at the handler for a builtin longjmp. The value
1437 saved in the setjmp buffer will be the address of the frame
1438 we've made for this inlined instance within our frame. But we
1439 know the offset of that value so we can use it to reconstruct
1440 our virtual stack vars register from that value. If we are
1441 copying it from the stack pointer, leave it unchanged. */
1443 && rtx_equal_p (SET_DEST (set
), virtual_stack_vars_rtx
))
1445 HOST_WIDE_INT offset
;
1446 temp
= map
->reg_map
[REGNO (SET_DEST (set
))];
1447 temp
= VARRAY_CONST_EQUIV (map
->const_equiv_varray
,
1450 if (rtx_equal_p (temp
, virtual_stack_vars_rtx
))
1452 else if (GET_CODE (temp
) == PLUS
1453 && rtx_equal_p (XEXP (temp
, 0), virtual_stack_vars_rtx
)
1454 && GET_CODE (XEXP (temp
, 1)) == CONST_INT
)
1455 offset
= INTVAL (XEXP (temp
, 1));
1459 if (rtx_equal_p (SET_SRC (set
), stack_pointer_rtx
))
1460 temp
= SET_SRC (set
);
1462 temp
= force_operand (plus_constant (SET_SRC (set
),
1466 copy
= emit_move_insn (virtual_stack_vars_rtx
, temp
);
1470 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1471 /* REG_NOTES will be copied later. */
1474 /* If this insn is setting CC0, it may need to look at
1475 the insn that uses CC0 to see what type of insn it is.
1476 In that case, the call to recog via validate_change will
1477 fail. So don't substitute constants here. Instead,
1478 do it when we emit the following insn.
1480 For example, see the pyr.md file. That machine has signed and
1481 unsigned compares. The compare patterns must check the
1482 following branch insn to see which what kind of compare to
1485 If the previous insn set CC0, substitute constants on it as
1487 if (sets_cc0_p (PATTERN (copy
)) != 0)
1492 try_constants (cc0_insn
, map
);
1494 try_constants (copy
, map
);
1497 try_constants (copy
, map
);
1499 INSN_SCOPE (copy
) = INSN_SCOPE (insn
);
1503 if (map
->integrating
&& returnjump_p (insn
))
1505 if (map
->local_return_label
== 0)
1506 map
->local_return_label
= gen_label_rtx ();
1507 pattern
= gen_jump (map
->local_return_label
);
1510 pattern
= copy_rtx_and_substitute (PATTERN (insn
), map
, 0);
1512 copy
= emit_jump_insn (pattern
);
1516 try_constants (cc0_insn
, map
);
1519 try_constants (copy
, map
);
1520 INSN_SCOPE (copy
) = INSN_SCOPE (insn
);
1522 /* If this used to be a conditional jump insn but whose branch
1523 direction is now know, we must do something special. */
1524 if (any_condjump_p (insn
) && onlyjump_p (insn
) && map
->last_pc_value
)
1527 /* If the previous insn set cc0 for us, delete it. */
1528 if (only_sets_cc0_p (PREV_INSN (copy
)))
1529 delete_related_insns (PREV_INSN (copy
));
1532 /* If this is now a no-op, delete it. */
1533 if (map
->last_pc_value
== pc_rtx
)
1535 delete_related_insns (copy
);
1539 /* Otherwise, this is unconditional jump so we must put a
1540 BARRIER after it. We could do some dead code elimination
1541 here, but jump.c will do it just as well. */
1547 /* If this is a CALL_PLACEHOLDER insn then we need to copy the
1548 three attached sequences: normal call, sibling call and tail
1550 if (GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
1555 for (i
= 0; i
< 3; i
++)
1559 sequence
[i
] = NULL_RTX
;
1560 seq
= XEXP (PATTERN (insn
), i
);
1564 copy_insn_list (seq
, map
, static_chain_value
);
1565 sequence
[i
] = get_insns ();
1570 /* Find the new tail recursion label.
1571 It will already be substituted into sequence[2]. */
1572 tail_label
= copy_rtx_and_substitute (XEXP (PATTERN (insn
), 3),
1575 copy
= emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode
,
1583 pattern
= copy_rtx_and_substitute (PATTERN (insn
), map
, 0);
1584 copy
= emit_call_insn (pattern
);
1586 SIBLING_CALL_P (copy
) = SIBLING_CALL_P (insn
);
1587 CONST_OR_PURE_CALL_P (copy
) = CONST_OR_PURE_CALL_P (insn
);
1588 INSN_SCOPE (copy
) = INSN_SCOPE (insn
);
1590 /* Because the USAGE information potentially contains objects other
1591 than hard registers, we need to copy it. */
1593 CALL_INSN_FUNCTION_USAGE (copy
)
1594 = copy_rtx_and_substitute (CALL_INSN_FUNCTION_USAGE (insn
),
1599 try_constants (cc0_insn
, map
);
1602 try_constants (copy
, map
);
1604 /* Be lazy and assume CALL_INSNs clobber all hard registers. */
1605 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
1606 VARRAY_CONST_EQUIV (map
->const_equiv_varray
, i
).rtx
= 0;
1610 copy
= emit_label (get_label_from_map (map
,
1611 CODE_LABEL_NUMBER (insn
)));
1612 LABEL_NAME (copy
) = LABEL_NAME (insn
);
1617 copy
= emit_barrier ();
1621 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_DELETED_LABEL
)
1623 copy
= emit_label (get_label_from_map (map
,
1624 CODE_LABEL_NUMBER (insn
)));
1625 LABEL_NAME (copy
) = NOTE_SOURCE_FILE (insn
);
1630 /* NOTE_INSN_FUNCTION_END and NOTE_INSN_FUNCTION_BEG are
1631 discarded because it is important to have only one of
1632 each in the current function.
1634 NOTE_INSN_DELETED notes aren't useful. */
1636 if (NOTE_LINE_NUMBER (insn
) != NOTE_INSN_FUNCTION_END
1637 && NOTE_LINE_NUMBER (insn
) != NOTE_INSN_FUNCTION_BEG
1638 && NOTE_LINE_NUMBER (insn
) != NOTE_INSN_DELETED
)
1640 copy
= emit_note (NOTE_SOURCE_FILE (insn
),
1641 NOTE_LINE_NUMBER (insn
));
1643 && (NOTE_LINE_NUMBER (copy
) == NOTE_INSN_BLOCK_BEG
1644 || NOTE_LINE_NUMBER (copy
) == NOTE_INSN_BLOCK_END
)
1645 && NOTE_BLOCK (insn
))
1647 tree
*mapped_block_p
;
1650 = (tree
*) bsearch (NOTE_BLOCK (insn
),
1651 &VARRAY_TREE (map
->block_map
, 0),
1652 map
->block_map
->elements_used
,
1656 if (!mapped_block_p
)
1659 NOTE_BLOCK (copy
) = *mapped_block_p
;
1662 && NOTE_LINE_NUMBER (copy
) == NOTE_INSN_EXPECTED_VALUE
)
1663 NOTE_EXPECTED_VALUE (copy
)
1664 = copy_rtx_and_substitute (NOTE_EXPECTED_VALUE (insn
),
1676 RTX_INTEGRATED_P (copy
) = 1;
1678 map
->insn_map
[INSN_UID (insn
)] = copy
;
1682 /* Copy the REG_NOTES. Increment const_age, so that only constants
1683 from parameters can be substituted in. These are the only ones
1684 that are valid across the entire function. */
1687 copy_insn_notes (insns
, map
, eh_region_offset
)
1689 struct inline_remap
*map
;
1690 int eh_region_offset
;
1695 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
1697 if (! INSN_P (insn
))
1700 new_insn
= map
->insn_map
[INSN_UID (insn
)];
1704 if (REG_NOTES (insn
))
1706 rtx next
, note
= copy_rtx_and_substitute (REG_NOTES (insn
), map
, 0);
1708 /* We must also do subst_constants, in case one of our parameters
1709 has const type and constant value. */
1710 subst_constants (¬e
, NULL_RTX
, map
, 0);
1711 apply_change_group ();
1712 REG_NOTES (new_insn
) = note
;
1714 /* Delete any REG_LABEL notes from the chain. Remap any
1715 REG_EH_REGION notes. */
1716 for (; note
; note
= next
)
1718 next
= XEXP (note
, 1);
1719 if (REG_NOTE_KIND (note
) == REG_LABEL
)
1720 remove_note (new_insn
, note
);
1721 else if (REG_NOTE_KIND (note
) == REG_EH_REGION
1722 && INTVAL (XEXP (note
, 0)) > 0)
1723 XEXP (note
, 0) = GEN_INT (INTVAL (XEXP (note
, 0))
1724 + eh_region_offset
);
1728 if (GET_CODE (insn
) == CALL_INSN
1729 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
1732 for (i
= 0; i
< 3; i
++)
1733 copy_insn_notes (XEXP (PATTERN (insn
), i
), map
, eh_region_offset
);
1736 if (GET_CODE (insn
) == JUMP_INSN
1737 && GET_CODE (PATTERN (insn
)) == RESX
)
1738 XINT (PATTERN (new_insn
), 0) += eh_region_offset
;
1742 /* Given a chain of PARM_DECLs, ARGS, copy each decl into a VAR_DECL,
1743 push all of those decls and give each one the corresponding home. */
1746 integrate_parm_decls (args
, map
, arg_vector
)
1748 struct inline_remap
*map
;
1754 for (tail
= args
, i
= 0; tail
; tail
= TREE_CHAIN (tail
), i
++)
1756 tree decl
= copy_decl_for_inlining (tail
, map
->fndecl
,
1757 current_function_decl
);
1759 = copy_rtx_and_substitute (RTVEC_ELT (arg_vector
, i
), map
, 1);
1761 /* We really should be setting DECL_INCOMING_RTL to something reasonable
1762 here, but that's going to require some more work. */
1763 /* DECL_INCOMING_RTL (decl) = ?; */
1764 /* Fully instantiate the address with the equivalent form so that the
1765 debugging information contains the actual register, instead of the
1766 virtual register. Do this by not passing an insn to
1768 subst_constants (&new_decl_rtl
, NULL_RTX
, map
, 1);
1769 apply_change_group ();
1770 SET_DECL_RTL (decl
, new_decl_rtl
);
1774 /* Given a BLOCK node LET, push decls and levels so as to construct in the
1775 current function a tree of contexts isomorphic to the one that is given.
1777 MAP, if nonzero, is a pointer to an inline_remap map which indicates how
1778 registers used in the DECL_RTL field should be remapped. If it is zero,
1779 no mapping is necessary. */
1782 integrate_decl_tree (let
, map
)
1784 struct inline_remap
*map
;
1790 new_block
= make_node (BLOCK
);
1791 VARRAY_PUSH_TREE (map
->block_map
, new_block
);
1792 next
= &BLOCK_VARS (new_block
);
1794 for (t
= BLOCK_VARS (let
); t
; t
= TREE_CHAIN (t
))
1798 d
= copy_decl_for_inlining (t
, map
->fndecl
, current_function_decl
);
1800 if (DECL_RTL_SET_P (t
))
1804 SET_DECL_RTL (d
, copy_rtx_and_substitute (DECL_RTL (t
), map
, 1));
1806 /* Fully instantiate the address with the equivalent form so that the
1807 debugging information contains the actual register, instead of the
1808 virtual register. Do this by not passing an insn to
1811 subst_constants (&r
, NULL_RTX
, map
, 1);
1812 SET_DECL_RTL (d
, r
);
1814 if (GET_CODE (r
) == REG
)
1815 REGNO_DECL (REGNO (r
)) = d
;
1816 else if (GET_CODE (r
) == CONCAT
)
1818 REGNO_DECL (REGNO (XEXP (r
, 0))) = d
;
1819 REGNO_DECL (REGNO (XEXP (r
, 1))) = d
;
1822 apply_change_group ();
1825 /* Add this declaration to the list of variables in the new
1828 next
= &TREE_CHAIN (d
);
1831 next
= &BLOCK_SUBBLOCKS (new_block
);
1832 for (t
= BLOCK_SUBBLOCKS (let
); t
; t
= BLOCK_CHAIN (t
))
1834 *next
= integrate_decl_tree (t
, map
);
1835 BLOCK_SUPERCONTEXT (*next
) = new_block
;
1836 next
= &BLOCK_CHAIN (*next
);
1839 TREE_USED (new_block
) = TREE_USED (let
);
1840 BLOCK_ABSTRACT_ORIGIN (new_block
) = let
;
1845 /* Create a new copy of an rtx. Recursively copies the operands of the rtx,
1846 except for those few rtx codes that are sharable.
1848 We always return an rtx that is similar to that incoming rtx, with the
1849 exception of possibly changing a REG to a SUBREG or vice versa. No
1850 rtl is ever emitted.
1852 If FOR_LHS is nonzero, if means we are processing something that will
1853 be the LHS of a SET. In that case, we copy RTX_UNCHANGING_P even if
1854 inlining since we need to be conservative in how it is set for
1857 Handle constants that need to be placed in the constant pool by
1858 calling `force_const_mem'. */
1861 copy_rtx_and_substitute (orig
, map
, for_lhs
)
1863 struct inline_remap
*map
;
1869 enum machine_mode mode
;
1870 const char *format_ptr
;
1876 code
= GET_CODE (orig
);
1877 mode
= GET_MODE (orig
);
1882 /* If the stack pointer register shows up, it must be part of
1883 stack-adjustments (*not* because we eliminated the frame pointer!).
1884 Small hard registers are returned as-is. Pseudo-registers
1885 go through their `reg_map'. */
1886 regno
= REGNO (orig
);
1887 if (regno
<= LAST_VIRTUAL_REGISTER
1888 || (map
->integrating
1889 && DECL_SAVED_INSNS (map
->fndecl
)->internal_arg_pointer
== orig
))
1891 /* Some hard registers are also mapped,
1892 but others are not translated. */
1893 if (map
->reg_map
[regno
] != 0)
1894 return map
->reg_map
[regno
];
1896 /* If this is the virtual frame pointer, make space in current
1897 function's stack frame for the stack frame of the inline function.
1899 Copy the address of this area into a pseudo. Map
1900 virtual_stack_vars_rtx to this pseudo and set up a constant
1901 equivalence for it to be the address. This will substitute the
1902 address into insns where it can be substituted and use the new
1903 pseudo where it can't. */
1904 else if (regno
== VIRTUAL_STACK_VARS_REGNUM
)
1907 int size
= get_func_frame_size (DECL_SAVED_INSNS (map
->fndecl
));
1908 #ifdef FRAME_GROWS_DOWNWARD
1910 = (DECL_SAVED_INSNS (map
->fndecl
)->stack_alignment_needed
1913 /* In this case, virtual_stack_vars_rtx points to one byte
1914 higher than the top of the frame area. So make sure we
1915 allocate a big enough chunk to keep the frame pointer
1916 aligned like a real one. */
1918 size
= CEIL_ROUND (size
, alignment
);
1921 loc
= assign_stack_temp (BLKmode
, size
, 1);
1922 loc
= XEXP (loc
, 0);
1923 #ifdef FRAME_GROWS_DOWNWARD
1924 /* In this case, virtual_stack_vars_rtx points to one byte
1925 higher than the top of the frame area. So compute the offset
1926 to one byte higher than our substitute frame. */
1927 loc
= plus_constant (loc
, size
);
1929 map
->reg_map
[regno
] = temp
1930 = force_reg (Pmode
, force_operand (loc
, NULL_RTX
));
1932 #ifdef STACK_BOUNDARY
1933 mark_reg_pointer (map
->reg_map
[regno
], STACK_BOUNDARY
);
1936 SET_CONST_EQUIV_DATA (map
, temp
, loc
, CONST_AGE_PARM
);
1940 emit_insn_after (seq
, map
->insns_at_start
);
1943 else if (regno
== VIRTUAL_INCOMING_ARGS_REGNUM
1944 || (map
->integrating
1945 && (DECL_SAVED_INSNS (map
->fndecl
)->internal_arg_pointer
1948 /* Do the same for a block to contain any arguments referenced
1951 int size
= DECL_SAVED_INSNS (map
->fndecl
)->args_size
;
1954 loc
= assign_stack_temp (BLKmode
, size
, 1);
1955 loc
= XEXP (loc
, 0);
1956 /* When arguments grow downward, the virtual incoming
1957 args pointer points to the top of the argument block,
1958 so the remapped location better do the same. */
1959 #ifdef ARGS_GROW_DOWNWARD
1960 loc
= plus_constant (loc
, size
);
1962 map
->reg_map
[regno
] = temp
1963 = force_reg (Pmode
, force_operand (loc
, NULL_RTX
));
1965 #ifdef STACK_BOUNDARY
1966 mark_reg_pointer (map
->reg_map
[regno
], STACK_BOUNDARY
);
1969 SET_CONST_EQUIV_DATA (map
, temp
, loc
, CONST_AGE_PARM
);
1973 emit_insn_after (seq
, map
->insns_at_start
);
1976 else if (REG_FUNCTION_VALUE_P (orig
))
1978 /* This is a reference to the function return value. If
1979 the function doesn't have a return value, error. If the
1980 mode doesn't agree, and it ain't BLKmode, make a SUBREG. */
1981 if (map
->inline_target
== 0)
1983 if (rtx_equal_function_value_matters
)
1984 /* This is an ignored return value. We must not
1985 leave it in with REG_FUNCTION_VALUE_P set, since
1986 that would confuse subsequent inlining of the
1987 current function into a later function. */
1988 return gen_rtx_REG (GET_MODE (orig
), regno
);
1990 /* Must be unrolling loops or replicating code if we
1991 reach here, so return the register unchanged. */
1994 else if (GET_MODE (map
->inline_target
) != BLKmode
1995 && mode
!= GET_MODE (map
->inline_target
))
1996 return gen_lowpart (mode
, map
->inline_target
);
1998 return map
->inline_target
;
2000 #if defined (LEAF_REGISTERS) && defined (LEAF_REG_REMAP)
2001 /* If leaf_renumber_regs_insn() might remap this register to
2002 some other number, make sure we don't share it with the
2003 inlined function, otherwise delayed optimization of the
2004 inlined function may change it in place, breaking our
2005 reference to it. We may still shared it within the
2006 function, so create an entry for this register in the
2008 if (map
->integrating
&& regno
< FIRST_PSEUDO_REGISTER
2009 && LEAF_REGISTERS
[regno
] && LEAF_REG_REMAP (regno
) != regno
)
2011 if (!map
->leaf_reg_map
[regno
][mode
])
2012 map
->leaf_reg_map
[regno
][mode
] = gen_rtx_REG (mode
, regno
);
2013 return map
->leaf_reg_map
[regno
][mode
];
2021 if (map
->reg_map
[regno
] == NULL
)
2023 map
->reg_map
[regno
] = gen_reg_rtx (mode
);
2024 REG_USERVAR_P (map
->reg_map
[regno
]) = REG_USERVAR_P (orig
);
2025 REG_LOOP_TEST_P (map
->reg_map
[regno
]) = REG_LOOP_TEST_P (orig
);
2026 RTX_UNCHANGING_P (map
->reg_map
[regno
]) = RTX_UNCHANGING_P (orig
);
2027 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
2029 if (REG_POINTER (map
->x_regno_reg_rtx
[regno
]))
2030 mark_reg_pointer (map
->reg_map
[regno
],
2031 map
->regno_pointer_align
[regno
]);
2033 return map
->reg_map
[regno
];
2036 copy
= copy_rtx_and_substitute (SUBREG_REG (orig
), map
, for_lhs
);
2037 return simplify_gen_subreg (GET_MODE (orig
), copy
,
2038 GET_MODE (SUBREG_REG (orig
)),
2039 SUBREG_BYTE (orig
));
2042 copy
= gen_rtx_ADDRESSOF (mode
,
2043 copy_rtx_and_substitute (XEXP (orig
, 0),
2045 0, ADDRESSOF_DECL (orig
));
2046 regno
= ADDRESSOF_REGNO (orig
);
2047 if (map
->reg_map
[regno
])
2048 regno
= REGNO (map
->reg_map
[regno
]);
2049 else if (regno
> LAST_VIRTUAL_REGISTER
)
2051 temp
= XEXP (orig
, 0);
2052 map
->reg_map
[regno
] = gen_reg_rtx (GET_MODE (temp
));
2053 REG_USERVAR_P (map
->reg_map
[regno
]) = REG_USERVAR_P (temp
);
2054 REG_LOOP_TEST_P (map
->reg_map
[regno
]) = REG_LOOP_TEST_P (temp
);
2055 RTX_UNCHANGING_P (map
->reg_map
[regno
]) = RTX_UNCHANGING_P (temp
);
2056 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
2058 /* Objects may initially be represented as registers, but
2059 but turned into a MEM if their address is taken by
2060 put_var_into_stack. Therefore, the register table may have
2061 entries which are MEMs.
2063 We briefly tried to clear such entries, but that ended up
2064 cascading into many changes due to the optimizers not being
2065 prepared for empty entries in the register table. So we've
2066 decided to allow the MEMs in the register table for now. */
2067 if (REG_P (map
->x_regno_reg_rtx
[regno
])
2068 && REG_POINTER (map
->x_regno_reg_rtx
[regno
]))
2069 mark_reg_pointer (map
->reg_map
[regno
],
2070 map
->regno_pointer_align
[regno
]);
2071 regno
= REGNO (map
->reg_map
[regno
]);
2073 ADDRESSOF_REGNO (copy
) = regno
;
2078 /* USE and CLOBBER are ordinary, but we convert (use (subreg foo))
2079 to (use foo) if the original insn didn't have a subreg.
2080 Removing the subreg distorts the VAX movstrhi pattern
2081 by changing the mode of an operand. */
2082 copy
= copy_rtx_and_substitute (XEXP (orig
, 0), map
, code
== CLOBBER
);
2083 if (GET_CODE (copy
) == SUBREG
&& GET_CODE (XEXP (orig
, 0)) != SUBREG
)
2084 copy
= SUBREG_REG (copy
);
2085 return gen_rtx_fmt_e (code
, VOIDmode
, copy
);
2087 /* We need to handle "deleted" labels that appear in the DECL_RTL
2090 if (NOTE_LINE_NUMBER (orig
) != NOTE_INSN_DELETED_LABEL
)
2093 /* ... FALLTHRU ... */
2095 LABEL_PRESERVE_P (get_label_from_map (map
, CODE_LABEL_NUMBER (orig
)))
2096 = LABEL_PRESERVE_P (orig
);
2097 return get_label_from_map (map
, CODE_LABEL_NUMBER (orig
));
2103 LABEL_REF_NONLOCAL_P (orig
) ? XEXP (orig
, 0)
2104 : get_label_from_map (map
, CODE_LABEL_NUMBER (XEXP (orig
, 0))));
2106 LABEL_OUTSIDE_LOOP_P (copy
) = LABEL_OUTSIDE_LOOP_P (orig
);
2108 /* The fact that this label was previously nonlocal does not mean
2109 it still is, so we must check if it is within the range of
2110 this function's labels. */
2111 LABEL_REF_NONLOCAL_P (copy
)
2112 = (LABEL_REF_NONLOCAL_P (orig
)
2113 && ! (CODE_LABEL_NUMBER (XEXP (copy
, 0)) >= get_first_label_num ()
2114 && CODE_LABEL_NUMBER (XEXP (copy
, 0)) < max_label_num ()));
2116 /* If we have made a nonlocal label local, it means that this
2117 inlined call will be referring to our nonlocal goto handler.
2118 So make sure we create one for this block; we normally would
2119 not since this is not otherwise considered a "call". */
2120 if (LABEL_REF_NONLOCAL_P (orig
) && ! LABEL_REF_NONLOCAL_P (copy
))
2121 function_call_count
++;
2132 /* Symbols which represent the address of a label stored in the constant
2133 pool must be modified to point to a constant pool entry for the
2134 remapped label. Otherwise, symbols are returned unchanged. */
2135 if (CONSTANT_POOL_ADDRESS_P (orig
))
2137 struct function
*f
= inlining
? inlining
: cfun
;
2138 rtx constant
= get_pool_constant_for_function (f
, orig
);
2139 enum machine_mode const_mode
= get_pool_mode_for_function (f
, orig
);
2142 rtx temp
= force_const_mem (const_mode
,
2143 copy_rtx_and_substitute (constant
,
2147 /* Legitimizing the address here is incorrect.
2149 Since we had a SYMBOL_REF before, we can assume it is valid
2150 to have one in this position in the insn.
2152 Also, change_address may create new registers. These
2153 registers will not have valid reg_map entries. This can
2154 cause try_constants() to fail because assumes that all
2155 registers in the rtx have valid reg_map entries, and it may
2156 end up replacing one of these new registers with junk. */
2158 if (! memory_address_p (GET_MODE (temp
), XEXP (temp
, 0)))
2159 temp
= change_address (temp
, GET_MODE (temp
), XEXP (temp
, 0));
2162 temp
= XEXP (temp
, 0);
2164 #ifdef POINTERS_EXTEND_UNSIGNED
2165 if (GET_MODE (temp
) != GET_MODE (orig
))
2166 temp
= convert_memory_address (GET_MODE (orig
), temp
);
2170 else if (GET_CODE (constant
) == LABEL_REF
)
2171 return XEXP (force_const_mem
2173 copy_rtx_and_substitute (constant
, map
, for_lhs
)),
2180 /* We have to make a new copy of this CONST_DOUBLE because don't want
2181 to use the old value of CONST_DOUBLE_MEM. Also, this may be a
2182 duplicate of a CONST_DOUBLE we have already seen. */
2183 if (GET_MODE_CLASS (GET_MODE (orig
)) == MODE_FLOAT
)
2187 REAL_VALUE_FROM_CONST_DOUBLE (d
, orig
);
2188 return CONST_DOUBLE_FROM_REAL_VALUE (d
, GET_MODE (orig
));
2191 return immed_double_const (CONST_DOUBLE_LOW (orig
),
2192 CONST_DOUBLE_HIGH (orig
), VOIDmode
);
2195 /* Make new constant pool entry for a constant
2196 that was in the pool of the inline function. */
2197 if (RTX_INTEGRATED_P (orig
))
2202 /* If a single asm insn contains multiple output operands then
2203 it contains multiple ASM_OPERANDS rtx's that share the input
2204 and constraint vecs. We must make sure that the copied insn
2205 continues to share it. */
2206 if (map
->orig_asm_operands_vector
== ASM_OPERANDS_INPUT_VEC (orig
))
2208 copy
= rtx_alloc (ASM_OPERANDS
);
2209 RTX_FLAG (copy
, volatil
) = RTX_FLAG (orig
, volatil
);
2210 PUT_MODE (copy
, GET_MODE (orig
));
2211 ASM_OPERANDS_TEMPLATE (copy
) = ASM_OPERANDS_TEMPLATE (orig
);
2212 ASM_OPERANDS_OUTPUT_CONSTRAINT (copy
)
2213 = ASM_OPERANDS_OUTPUT_CONSTRAINT (orig
);
2214 ASM_OPERANDS_OUTPUT_IDX (copy
) = ASM_OPERANDS_OUTPUT_IDX (orig
);
2215 ASM_OPERANDS_INPUT_VEC (copy
) = map
->copy_asm_operands_vector
;
2216 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy
)
2217 = map
->copy_asm_constraints_vector
;
2218 ASM_OPERANDS_SOURCE_FILE (copy
) = ASM_OPERANDS_SOURCE_FILE (orig
);
2219 ASM_OPERANDS_SOURCE_LINE (copy
) = ASM_OPERANDS_SOURCE_LINE (orig
);
2225 /* This is given special treatment because the first
2226 operand of a CALL is a (MEM ...) which may get
2227 forced into a register for cse. This is undesirable
2228 if function-address cse isn't wanted or if we won't do cse. */
2229 #ifndef NO_FUNCTION_CSE
2230 if (! (optimize
&& ! flag_no_function_cse
))
2234 = gen_rtx_MEM (GET_MODE (XEXP (orig
, 0)),
2235 copy_rtx_and_substitute (XEXP (XEXP (orig
, 0), 0),
2238 MEM_COPY_ATTRIBUTES (copy
, XEXP (orig
, 0));
2241 gen_rtx_CALL (GET_MODE (orig
), copy
,
2242 copy_rtx_and_substitute (XEXP (orig
, 1), map
, 0));
2247 /* Must be ifdefed out for loop unrolling to work. */
2253 /* If this is setting fp or ap, it means that we have a nonlocal goto.
2254 Adjust the setting by the offset of the area we made.
2255 If the nonlocal goto is into the current function,
2256 this will result in unnecessarily bad code, but should work. */
2257 if (SET_DEST (orig
) == virtual_stack_vars_rtx
2258 || SET_DEST (orig
) == virtual_incoming_args_rtx
)
2260 /* In case a translation hasn't occurred already, make one now. */
2263 HOST_WIDE_INT loc_offset
;
2265 copy_rtx_and_substitute (SET_DEST (orig
), map
, for_lhs
);
2266 equiv_reg
= map
->reg_map
[REGNO (SET_DEST (orig
))];
2267 equiv_loc
= VARRAY_CONST_EQUIV (map
->const_equiv_varray
,
2268 REGNO (equiv_reg
)).rtx
;
2270 = GET_CODE (equiv_loc
) == REG
? 0 : INTVAL (XEXP (equiv_loc
, 1));
2272 return gen_rtx_SET (VOIDmode
, SET_DEST (orig
),
2275 (copy_rtx_and_substitute (SET_SRC (orig
),
2281 return gen_rtx_SET (VOIDmode
,
2282 copy_rtx_and_substitute (SET_DEST (orig
), map
, 1),
2283 copy_rtx_and_substitute (SET_SRC (orig
), map
, 0));
2288 && GET_CODE (XEXP (orig
, 0)) == SYMBOL_REF
2289 && CONSTANT_POOL_ADDRESS_P (XEXP (orig
, 0)))
2291 enum machine_mode const_mode
2292 = get_pool_mode_for_function (inlining
, XEXP (orig
, 0));
2294 = get_pool_constant_for_function (inlining
, XEXP (orig
, 0));
2296 constant
= copy_rtx_and_substitute (constant
, map
, 0);
2298 /* If this was an address of a constant pool entry that itself
2299 had to be placed in the constant pool, it might not be a
2300 valid address. So the recursive call might have turned it
2301 into a register. In that case, it isn't a constant any
2302 more, so return it. This has the potential of changing a
2303 MEM into a REG, but we'll assume that it safe. */
2304 if (! CONSTANT_P (constant
))
2307 return validize_mem (force_const_mem (const_mode
, constant
));
2310 copy
= gen_rtx_MEM (mode
, copy_rtx_and_substitute (XEXP (orig
, 0),
2312 MEM_COPY_ATTRIBUTES (copy
, orig
);
2314 /* If inlining and this is not for the LHS, turn off RTX_UNCHANGING_P
2315 since this may be an indirect reference to a parameter and the
2316 actual may not be readonly. */
2317 if (inlining
&& !for_lhs
)
2318 RTX_UNCHANGING_P (copy
) = 0;
2320 /* If inlining, squish aliasing data that references the subroutine's
2321 parameter list, since that's no longer applicable. */
2322 if (inlining
&& MEM_EXPR (copy
)
2323 && TREE_CODE (MEM_EXPR (copy
)) == INDIRECT_REF
2324 && TREE_CODE (TREE_OPERAND (MEM_EXPR (copy
), 0)) == PARM_DECL
)
2325 set_mem_expr (copy
, NULL_TREE
);
2333 copy
= rtx_alloc (code
);
2334 PUT_MODE (copy
, mode
);
2335 RTX_FLAG (copy
, in_struct
) = RTX_FLAG (orig
, in_struct
);
2336 RTX_FLAG (copy
, volatil
) = RTX_FLAG (orig
, volatil
);
2337 RTX_FLAG (copy
, unchanging
) = RTX_FLAG (orig
, unchanging
);
2339 format_ptr
= GET_RTX_FORMAT (GET_CODE (copy
));
2341 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (copy
)); i
++)
2343 switch (*format_ptr
++)
2346 /* Copy this through the wide int field; that's safest. */
2347 X0WINT (copy
, i
) = X0WINT (orig
, i
);
2352 = copy_rtx_and_substitute (XEXP (orig
, i
), map
, for_lhs
);
2356 /* Change any references to old-insns to point to the
2357 corresponding copied insns. */
2358 XEXP (copy
, i
) = map
->insn_map
[INSN_UID (XEXP (orig
, i
))];
2362 XVEC (copy
, i
) = XVEC (orig
, i
);
2363 if (XVEC (orig
, i
) != NULL
&& XVECLEN (orig
, i
) != 0)
2365 XVEC (copy
, i
) = rtvec_alloc (XVECLEN (orig
, i
));
2366 for (j
= 0; j
< XVECLEN (copy
, i
); j
++)
2367 XVECEXP (copy
, i
, j
)
2368 = copy_rtx_and_substitute (XVECEXP (orig
, i
, j
),
2374 XWINT (copy
, i
) = XWINT (orig
, i
);
2378 XINT (copy
, i
) = XINT (orig
, i
);
2382 XSTR (copy
, i
) = XSTR (orig
, i
);
2386 XTREE (copy
, i
) = XTREE (orig
, i
);
2394 if (code
== ASM_OPERANDS
&& map
->orig_asm_operands_vector
== 0)
2396 map
->orig_asm_operands_vector
= ASM_OPERANDS_INPUT_VEC (orig
);
2397 map
->copy_asm_operands_vector
= ASM_OPERANDS_INPUT_VEC (copy
);
2398 map
->copy_asm_constraints_vector
2399 = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy
);
2405 /* Substitute known constant values into INSN, if that is valid. */
2408 try_constants (insn
, map
)
2410 struct inline_remap
*map
;
2416 /* First try just updating addresses, then other things. This is
2417 important when we have something like the store of a constant
2418 into memory and we can update the memory address but the machine
2419 does not support a constant source. */
2420 subst_constants (&PATTERN (insn
), insn
, map
, 1);
2421 apply_change_group ();
2422 subst_constants (&PATTERN (insn
), insn
, map
, 0);
2423 apply_change_group ();
2425 /* Show we don't know the value of anything stored or clobbered. */
2426 note_stores (PATTERN (insn
), mark_stores
, NULL
);
2427 map
->last_pc_value
= 0;
2429 map
->last_cc0_value
= 0;
2432 /* Set up any constant equivalences made in this insn. */
2433 for (i
= 0; i
< map
->num_sets
; i
++)
2435 if (GET_CODE (map
->equiv_sets
[i
].dest
) == REG
)
2437 int regno
= REGNO (map
->equiv_sets
[i
].dest
);
2439 MAYBE_EXTEND_CONST_EQUIV_VARRAY (map
, regno
);
2440 if (VARRAY_CONST_EQUIV (map
->const_equiv_varray
, regno
).rtx
== 0
2441 /* Following clause is a hack to make case work where GNU C++
2442 reassigns a variable to make cse work right. */
2443 || ! rtx_equal_p (VARRAY_CONST_EQUIV (map
->const_equiv_varray
,
2445 map
->equiv_sets
[i
].equiv
))
2446 SET_CONST_EQUIV_DATA (map
, map
->equiv_sets
[i
].dest
,
2447 map
->equiv_sets
[i
].equiv
, map
->const_age
);
2449 else if (map
->equiv_sets
[i
].dest
== pc_rtx
)
2450 map
->last_pc_value
= map
->equiv_sets
[i
].equiv
;
2452 else if (map
->equiv_sets
[i
].dest
== cc0_rtx
)
2453 map
->last_cc0_value
= map
->equiv_sets
[i
].equiv
;
2458 /* Substitute known constants for pseudo regs in the contents of LOC,
2459 which are part of INSN.
2460 If INSN is zero, the substitution should always be done (this is used to
2462 These changes are taken out by try_constants if the result is not valid.
2464 Note that we are more concerned with determining when the result of a SET
2465 is a constant, for further propagation, than actually inserting constants
2466 into insns; cse will do the latter task better.
2468 This function is also used to adjust address of items previously addressed
2469 via the virtual stack variable or virtual incoming arguments registers.
2471 If MEMONLY is nonzero, only make changes inside a MEM. */
2474 subst_constants (loc
, insn
, map
, memonly
)
2477 struct inline_remap
*map
;
2483 const char *format_ptr
;
2484 int num_changes
= num_validated_changes ();
2486 enum machine_mode op0_mode
= MAX_MACHINE_MODE
;
2488 code
= GET_CODE (x
);
2505 validate_change (insn
, loc
, map
->last_cc0_value
, 1);
2511 /* The only thing we can do with a USE or CLOBBER is possibly do
2512 some substitutions in a MEM within it. */
2513 if (GET_CODE (XEXP (x
, 0)) == MEM
)
2514 subst_constants (&XEXP (XEXP (x
, 0), 0), insn
, map
, 0);
2518 /* Substitute for parms and known constants. Don't replace
2519 hard regs used as user variables with constants. */
2522 int regno
= REGNO (x
);
2523 struct const_equiv_data
*p
;
2525 if (! (regno
< FIRST_PSEUDO_REGISTER
&& REG_USERVAR_P (x
))
2526 && (size_t) regno
< VARRAY_SIZE (map
->const_equiv_varray
)
2527 && (p
= &VARRAY_CONST_EQUIV (map
->const_equiv_varray
, regno
),
2529 && p
->age
>= map
->const_age
)
2530 validate_change (insn
, loc
, p
->rtx
, 1);
2535 /* SUBREG applied to something other than a reg
2536 should be treated as ordinary, since that must
2537 be a special hack and we don't know how to treat it specially.
2538 Consider for example mulsidi3 in m68k.md.
2539 Ordinary SUBREG of a REG needs this special treatment. */
2540 if (! memonly
&& GET_CODE (SUBREG_REG (x
)) == REG
)
2542 rtx inner
= SUBREG_REG (x
);
2545 /* We can't call subst_constants on &SUBREG_REG (x) because any
2546 constant or SUBREG wouldn't be valid inside our SUBEG. Instead,
2547 see what is inside, try to form the new SUBREG and see if that is
2548 valid. We handle two cases: extracting a full word in an
2549 integral mode and extracting the low part. */
2550 subst_constants (&inner
, NULL_RTX
, map
, 0);
2551 new = simplify_gen_subreg (GET_MODE (x
), inner
,
2552 GET_MODE (SUBREG_REG (x
)),
2556 validate_change (insn
, loc
, new, 1);
2558 cancel_changes (num_changes
);
2565 subst_constants (&XEXP (x
, 0), insn
, map
, 0);
2567 /* If a memory address got spoiled, change it back. */
2568 if (! memonly
&& insn
!= 0 && num_validated_changes () != num_changes
2569 && ! memory_address_p (GET_MODE (x
), XEXP (x
, 0)))
2570 cancel_changes (num_changes
);
2575 /* Substitute constants in our source, and in any arguments to a
2576 complex (e..g, ZERO_EXTRACT) destination, but not in the destination
2578 rtx
*dest_loc
= &SET_DEST (x
);
2579 rtx dest
= *dest_loc
;
2581 enum machine_mode compare_mode
= VOIDmode
;
2583 /* If SET_SRC is a COMPARE which subst_constants would turn into
2584 COMPARE of 2 VOIDmode constants, note the mode in which comparison
2586 if (GET_CODE (SET_SRC (x
)) == COMPARE
)
2589 if (GET_MODE_CLASS (GET_MODE (src
)) == MODE_CC
2595 compare_mode
= GET_MODE (XEXP (src
, 0));
2596 if (compare_mode
== VOIDmode
)
2597 compare_mode
= GET_MODE (XEXP (src
, 1));
2601 subst_constants (&SET_SRC (x
), insn
, map
, memonly
);
2604 while (GET_CODE (*dest_loc
) == ZERO_EXTRACT
2605 || GET_CODE (*dest_loc
) == SUBREG
2606 || GET_CODE (*dest_loc
) == STRICT_LOW_PART
)
2608 if (GET_CODE (*dest_loc
) == ZERO_EXTRACT
)
2610 subst_constants (&XEXP (*dest_loc
, 1), insn
, map
, memonly
);
2611 subst_constants (&XEXP (*dest_loc
, 2), insn
, map
, memonly
);
2613 dest_loc
= &XEXP (*dest_loc
, 0);
2616 /* Do substitute in the address of a destination in memory. */
2617 if (GET_CODE (*dest_loc
) == MEM
)
2618 subst_constants (&XEXP (*dest_loc
, 0), insn
, map
, 0);
2620 /* Check for the case of DEST a SUBREG, both it and the underlying
2621 register are less than one word, and the SUBREG has the wider mode.
2622 In the case, we are really setting the underlying register to the
2623 source converted to the mode of DEST. So indicate that. */
2624 if (GET_CODE (dest
) == SUBREG
2625 && GET_MODE_SIZE (GET_MODE (dest
)) <= UNITS_PER_WORD
2626 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest
))) <= UNITS_PER_WORD
2627 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest
)))
2628 <= GET_MODE_SIZE (GET_MODE (dest
)))
2629 && (tem
= gen_lowpart_if_possible (GET_MODE (SUBREG_REG (dest
)),
2631 src
= tem
, dest
= SUBREG_REG (dest
);
2633 /* If storing a recognizable value save it for later recording. */
2634 if ((map
->num_sets
< MAX_RECOG_OPERANDS
)
2635 && (CONSTANT_P (src
)
2636 || (GET_CODE (src
) == REG
2637 && (REGNO (src
) == VIRTUAL_INCOMING_ARGS_REGNUM
2638 || REGNO (src
) == VIRTUAL_STACK_VARS_REGNUM
))
2639 || (GET_CODE (src
) == PLUS
2640 && GET_CODE (XEXP (src
, 0)) == REG
2641 && (REGNO (XEXP (src
, 0)) == VIRTUAL_INCOMING_ARGS_REGNUM
2642 || REGNO (XEXP (src
, 0)) == VIRTUAL_STACK_VARS_REGNUM
)
2643 && CONSTANT_P (XEXP (src
, 1)))
2644 || GET_CODE (src
) == COMPARE
2649 && (src
== pc_rtx
|| GET_CODE (src
) == RETURN
2650 || GET_CODE (src
) == LABEL_REF
))))
2652 /* Normally, this copy won't do anything. But, if SRC is a COMPARE
2653 it will cause us to save the COMPARE with any constants
2654 substituted, which is what we want for later. */
2655 rtx src_copy
= copy_rtx (src
);
2656 map
->equiv_sets
[map
->num_sets
].equiv
= src_copy
;
2657 map
->equiv_sets
[map
->num_sets
++].dest
= dest
;
2658 if (compare_mode
!= VOIDmode
2659 && GET_CODE (src
) == COMPARE
2660 && (GET_MODE_CLASS (GET_MODE (src
)) == MODE_CC
2665 && GET_MODE (XEXP (src
, 0)) == VOIDmode
2666 && GET_MODE (XEXP (src
, 1)) == VOIDmode
)
2668 map
->compare_src
= src_copy
;
2669 map
->compare_mode
= compare_mode
;
2679 format_ptr
= GET_RTX_FORMAT (code
);
2681 /* If the first operand is an expression, save its mode for later. */
2682 if (*format_ptr
== 'e')
2683 op0_mode
= GET_MODE (XEXP (x
, 0));
2685 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++)
2687 switch (*format_ptr
++)
2694 subst_constants (&XEXP (x
, i
), insn
, map
, memonly
);
2707 if (XVEC (x
, i
) != NULL
&& XVECLEN (x
, i
) != 0)
2708 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2709 subst_constants (&XVECEXP (x
, i
, j
), insn
, map
, memonly
);
2718 /* If this is a commutative operation, move a constant to the second
2719 operand unless the second operand is already a CONST_INT. */
2721 && (GET_RTX_CLASS (code
) == 'c' || code
== NE
|| code
== EQ
)
2722 && CONSTANT_P (XEXP (x
, 0)) && GET_CODE (XEXP (x
, 1)) != CONST_INT
)
2724 rtx tem
= XEXP (x
, 0);
2725 validate_change (insn
, &XEXP (x
, 0), XEXP (x
, 1), 1);
2726 validate_change (insn
, &XEXP (x
, 1), tem
, 1);
2729 /* Simplify the expression in case we put in some constants. */
2731 switch (GET_RTX_CLASS (code
))
2734 if (op0_mode
== MAX_MACHINE_MODE
)
2736 new = simplify_unary_operation (code
, GET_MODE (x
),
2737 XEXP (x
, 0), op0_mode
);
2742 enum machine_mode op_mode
= GET_MODE (XEXP (x
, 0));
2744 if (op_mode
== VOIDmode
)
2745 op_mode
= GET_MODE (XEXP (x
, 1));
2746 new = simplify_relational_operation (code
, op_mode
,
2747 XEXP (x
, 0), XEXP (x
, 1));
2748 #ifdef FLOAT_STORE_FLAG_VALUE
2749 if (new != 0 && GET_MODE_CLASS (GET_MODE (x
)) == MODE_FLOAT
)
2751 enum machine_mode mode
= GET_MODE (x
);
2752 if (new == const0_rtx
)
2753 new = CONST0_RTX (mode
);
2756 REAL_VALUE_TYPE val
;
2758 /* Avoid automatic aggregate initialization. */
2759 val
= FLOAT_STORE_FLAG_VALUE (mode
);
2760 new = CONST_DOUBLE_FROM_REAL_VALUE (val
, mode
);
2769 new = simplify_binary_operation (code
, GET_MODE (x
),
2770 XEXP (x
, 0), XEXP (x
, 1));
2775 if (op0_mode
== MAX_MACHINE_MODE
)
2778 if (code
== IF_THEN_ELSE
)
2780 rtx op0
= XEXP (x
, 0);
2782 if (GET_RTX_CLASS (GET_CODE (op0
)) == '<'
2783 && GET_MODE (op0
) == VOIDmode
2784 && ! side_effects_p (op0
)
2785 && XEXP (op0
, 0) == map
->compare_src
2786 && GET_MODE (XEXP (op0
, 1)) == VOIDmode
)
2788 /* We have compare of two VOIDmode constants for which
2789 we recorded the comparison mode. */
2791 simplify_relational_operation (GET_CODE (op0
),
2796 if (temp
== const0_rtx
)
2798 else if (temp
== const1_rtx
)
2803 new = simplify_ternary_operation (code
, GET_MODE (x
), op0_mode
,
2804 XEXP (x
, 0), XEXP (x
, 1),
2810 validate_change (insn
, loc
, new, 1);
2813 /* Show that register modified no longer contain known constants. We are
2814 called from note_stores with parts of the new insn. */
2817 mark_stores (dest
, x
, data
)
2819 rtx x ATTRIBUTE_UNUSED
;
2820 void *data ATTRIBUTE_UNUSED
;
2823 enum machine_mode mode
= VOIDmode
;
2825 /* DEST is always the innermost thing set, except in the case of
2826 SUBREGs of hard registers. */
2828 if (GET_CODE (dest
) == REG
)
2829 regno
= REGNO (dest
), mode
= GET_MODE (dest
);
2830 else if (GET_CODE (dest
) == SUBREG
&& GET_CODE (SUBREG_REG (dest
)) == REG
)
2832 regno
= REGNO (SUBREG_REG (dest
));
2833 if (regno
< FIRST_PSEUDO_REGISTER
)
2834 regno
+= subreg_regno_offset (REGNO (SUBREG_REG (dest
)),
2835 GET_MODE (SUBREG_REG (dest
)),
2838 mode
= GET_MODE (SUBREG_REG (dest
));
2843 unsigned int uregno
= regno
;
2844 unsigned int last_reg
= (uregno
>= FIRST_PSEUDO_REGISTER
? uregno
2845 : uregno
+ HARD_REGNO_NREGS (uregno
, mode
) - 1);
2848 /* Ignore virtual stack var or virtual arg register since those
2849 are handled separately. */
2850 if (uregno
!= VIRTUAL_INCOMING_ARGS_REGNUM
2851 && uregno
!= VIRTUAL_STACK_VARS_REGNUM
)
2852 for (i
= uregno
; i
<= last_reg
; i
++)
2853 if ((size_t) i
< VARRAY_SIZE (global_const_equiv_varray
))
2854 VARRAY_CONST_EQUIV (global_const_equiv_varray
, i
).rtx
= 0;
2858 /* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the
2859 given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so
2860 that it points to the node itself, thus indicating that the node is its
2861 own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for
2862 the given node is NULL, recursively descend the decl/block tree which
2863 it is the root of, and for each other ..._DECL or BLOCK node contained
2864 therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also
2865 still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN
2866 values to point to themselves. */
2869 set_block_origin_self (stmt
)
2872 if (BLOCK_ABSTRACT_ORIGIN (stmt
) == NULL_TREE
)
2874 BLOCK_ABSTRACT_ORIGIN (stmt
) = stmt
;
2879 for (local_decl
= BLOCK_VARS (stmt
);
2880 local_decl
!= NULL_TREE
;
2881 local_decl
= TREE_CHAIN (local_decl
))
2882 set_decl_origin_self (local_decl
); /* Potential recursion. */
2888 for (subblock
= BLOCK_SUBBLOCKS (stmt
);
2889 subblock
!= NULL_TREE
;
2890 subblock
= BLOCK_CHAIN (subblock
))
2891 set_block_origin_self (subblock
); /* Recurse. */
2896 /* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for
2897 the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the
2898 node to so that it points to the node itself, thus indicating that the
2899 node represents its own (abstract) origin. Additionally, if the
2900 DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend
2901 the decl/block tree of which the given node is the root of, and for
2902 each other ..._DECL or BLOCK node contained therein whose
2903 DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL,
2904 set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to
2905 point to themselves. */
2908 set_decl_origin_self (decl
)
2911 if (DECL_ABSTRACT_ORIGIN (decl
) == NULL_TREE
)
2913 DECL_ABSTRACT_ORIGIN (decl
) = decl
;
2914 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2918 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= TREE_CHAIN (arg
))
2919 DECL_ABSTRACT_ORIGIN (arg
) = arg
;
2920 if (DECL_INITIAL (decl
) != NULL_TREE
2921 && DECL_INITIAL (decl
) != error_mark_node
)
2922 set_block_origin_self (DECL_INITIAL (decl
));
2927 /* Given a pointer to some BLOCK node, and a boolean value to set the
2928 "abstract" flags to, set that value into the BLOCK_ABSTRACT flag for
2929 the given block, and for all local decls and all local sub-blocks
2930 (recursively) which are contained therein. */
2933 set_block_abstract_flags (stmt
, setting
)
2940 BLOCK_ABSTRACT (stmt
) = setting
;
2942 for (local_decl
= BLOCK_VARS (stmt
);
2943 local_decl
!= NULL_TREE
;
2944 local_decl
= TREE_CHAIN (local_decl
))
2945 set_decl_abstract_flags (local_decl
, setting
);
2947 for (subblock
= BLOCK_SUBBLOCKS (stmt
);
2948 subblock
!= NULL_TREE
;
2949 subblock
= BLOCK_CHAIN (subblock
))
2950 set_block_abstract_flags (subblock
, setting
);
2953 /* Given a pointer to some ..._DECL node, and a boolean value to set the
2954 "abstract" flags to, set that value into the DECL_ABSTRACT flag for the
2955 given decl, and (in the case where the decl is a FUNCTION_DECL) also
2956 set the abstract flags for all of the parameters, local vars, local
2957 blocks and sub-blocks (recursively) to the same setting. */
2960 set_decl_abstract_flags (decl
, setting
)
2964 DECL_ABSTRACT (decl
) = setting
;
2965 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2969 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= TREE_CHAIN (arg
))
2970 DECL_ABSTRACT (arg
) = setting
;
2971 if (DECL_INITIAL (decl
) != NULL_TREE
2972 && DECL_INITIAL (decl
) != error_mark_node
)
2973 set_block_abstract_flags (DECL_INITIAL (decl
), setting
);
2977 /* Output the assembly language code for the function FNDECL
2978 from its DECL_SAVED_INSNS. Used for inline functions that are output
2979 at end of compilation instead of where they came in the source. */
2982 output_inline_function (fndecl
)
2985 struct function
*old_cfun
= cfun
;
2986 enum debug_info_type old_write_symbols
= write_symbols
;
2987 const struct gcc_debug_hooks
*const old_debug_hooks
= debug_hooks
;
2988 struct function
*f
= DECL_SAVED_INSNS (fndecl
);
2991 current_function_decl
= fndecl
;
2993 set_new_last_label_num (f
->inl_max_label_num
);
2995 /* We're not deferring this any longer. */
2996 DECL_DEFER_OUTPUT (fndecl
) = 0;
2998 /* If requested, suppress debugging information. */
2999 if (f
->no_debugging_symbols
)
3001 write_symbols
= NO_DEBUG
;
3002 debug_hooks
= &do_nothing_debug_hooks
;
3005 /* Compile this function all the way down to assembly code. As a
3006 side effect this destroys the saved RTL representation, but
3007 that's okay, because we don't need to inline this anymore. */
3008 rest_of_compilation (fndecl
);
3009 DECL_INLINE (fndecl
) = 0;
3012 current_function_decl
= old_cfun
? old_cfun
->decl
: 0;
3013 write_symbols
= old_write_symbols
;
3014 debug_hooks
= old_debug_hooks
;
3018 /* Functions to keep track of the values hard regs had at the start of
3022 get_hard_reg_initial_reg (fun
, reg
)
3023 struct function
*fun
;
3026 struct initial_value_struct
*ivs
= fun
->hard_reg_initial_vals
;
3032 for (i
= 0; i
< ivs
->num_entries
; i
++)
3033 if (rtx_equal_p (ivs
->entries
[i
].pseudo
, reg
))
3034 return ivs
->entries
[i
].hard_reg
;
3040 has_func_hard_reg_initial_val (fun
, reg
)
3041 struct function
*fun
;
3044 struct initial_value_struct
*ivs
= fun
->hard_reg_initial_vals
;
3050 for (i
= 0; i
< ivs
->num_entries
; i
++)
3051 if (rtx_equal_p (ivs
->entries
[i
].hard_reg
, reg
))
3052 return ivs
->entries
[i
].pseudo
;
3058 get_func_hard_reg_initial_val (fun
, reg
)
3059 struct function
*fun
;
3062 struct initial_value_struct
*ivs
= fun
->hard_reg_initial_vals
;
3063 rtx rv
= has_func_hard_reg_initial_val (fun
, reg
);
3070 fun
->hard_reg_initial_vals
= (void *) ggc_alloc (sizeof (initial_value_struct
));
3071 ivs
= fun
->hard_reg_initial_vals
;
3072 ivs
->num_entries
= 0;
3073 ivs
->max_entries
= 5;
3074 ivs
->entries
= (initial_value_pair
*) ggc_alloc (5 * sizeof (initial_value_pair
));
3077 if (ivs
->num_entries
>= ivs
->max_entries
)
3079 ivs
->max_entries
+= 5;
3081 (initial_value_pair
*) ggc_realloc (ivs
->entries
,
3083 * sizeof (initial_value_pair
));
3086 ivs
->entries
[ivs
->num_entries
].hard_reg
= reg
;
3087 ivs
->entries
[ivs
->num_entries
].pseudo
= gen_reg_rtx (GET_MODE (reg
));
3089 return ivs
->entries
[ivs
->num_entries
++].pseudo
;
3093 get_hard_reg_initial_val (mode
, regno
)
3094 enum machine_mode mode
;
3097 return get_func_hard_reg_initial_val (cfun
, gen_rtx_REG (mode
, regno
));
3101 has_hard_reg_initial_val (mode
, regno
)
3102 enum machine_mode mode
;
3105 return has_func_hard_reg_initial_val (cfun
, gen_rtx_REG (mode
, regno
));
3109 setup_initial_hard_reg_value_integration (inl_f
, remap
)
3110 struct function
*inl_f
;
3111 struct inline_remap
*remap
;
3113 struct initial_value_struct
*ivs
= inl_f
->hard_reg_initial_vals
;
3119 for (i
= 0; i
< ivs
->num_entries
; i
++)
3120 remap
->reg_map
[REGNO (ivs
->entries
[i
].pseudo
)]
3121 = get_func_hard_reg_initial_val (cfun
, ivs
->entries
[i
].hard_reg
);
3126 emit_initial_value_sets ()
3128 struct initial_value_struct
*ivs
= cfun
->hard_reg_initial_vals
;
3136 for (i
= 0; i
< ivs
->num_entries
; i
++)
3137 emit_move_insn (ivs
->entries
[i
].pseudo
, ivs
->entries
[i
].hard_reg
);
3141 emit_insn_after (seq
, get_insns ());
3144 /* If the backend knows where to allocate pseudos for hard
3145 register initial values, register these allocations now. */
3147 allocate_initial_values (reg_equiv_memory_loc
)
3148 rtx
*reg_equiv_memory_loc ATTRIBUTE_UNUSED
;
3150 #ifdef ALLOCATE_INITIAL_VALUE
3151 struct initial_value_struct
*ivs
= cfun
->hard_reg_initial_vals
;
3157 for (i
= 0; i
< ivs
->num_entries
; i
++)
3159 int regno
= REGNO (ivs
->entries
[i
].pseudo
);
3160 rtx x
= ALLOCATE_INITIAL_VALUE (ivs
->entries
[i
].hard_reg
);
3162 if (x
== NULL_RTX
|| REG_N_SETS (REGNO (ivs
->entries
[i
].pseudo
)) > 1)
3164 else if (GET_CODE (x
) == MEM
)
3165 reg_equiv_memory_loc
[regno
] = x
;
3166 else if (GET_CODE (x
) == REG
)
3168 reg_renumber
[regno
] = REGNO (x
);
3169 /* Poke the regno right into regno_reg_rtx
3170 so that even fixed regs are accepted. */
3171 REGNO (ivs
->entries
[i
].pseudo
) = REGNO (x
);
3178 #include "gt-integrate.h"