1 /* Procedure integration for GCC.
2 Copyright (C) 1988, 1991, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001 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"
48 #define obstack_chunk_alloc xmalloc
49 #define obstack_chunk_free free
51 extern struct obstack
*function_maybepermanent_obstack
;
53 /* Similar, but round to the next highest integer that meets the
55 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
57 /* Default max number of insns a function can have and still be inline.
58 This is overridden on RISC machines. */
59 #ifndef INTEGRATE_THRESHOLD
60 /* Inlining small functions might save more space then not inlining at
61 all. Assume 1 instruction for the call and 1.5 insns per argument. */
62 #define INTEGRATE_THRESHOLD(DECL) \
64 ? (1 + (3 * list_length (DECL_ARGUMENTS (DECL))) / 2) \
65 : (8 * (8 + list_length (DECL_ARGUMENTS (DECL)))))
69 /* Private type used by {get/has}_func_hard_reg_initial_val. */
70 typedef struct initial_value_pair
{
74 typedef struct initial_value_struct
{
77 initial_value_pair
*entries
;
78 } initial_value_struct
;
80 static void setup_initial_hard_reg_value_integration
PARAMS ((struct function
*, struct inline_remap
*));
82 static rtvec initialize_for_inline
PARAMS ((tree
));
83 static void note_modified_parmregs
PARAMS ((rtx
, rtx
, void *));
84 static void integrate_parm_decls
PARAMS ((tree
, struct inline_remap
*,
86 static tree integrate_decl_tree
PARAMS ((tree
,
87 struct inline_remap
*));
88 static void subst_constants
PARAMS ((rtx
*, rtx
,
89 struct inline_remap
*, int));
90 static void set_block_origin_self
PARAMS ((tree
));
91 static void set_block_abstract_flags
PARAMS ((tree
, int));
92 static void process_reg_param
PARAMS ((struct inline_remap
*, rtx
,
94 void set_decl_abstract_flags
PARAMS ((tree
, int));
95 static void mark_stores
PARAMS ((rtx
, rtx
, void *));
96 static void save_parm_insns
PARAMS ((rtx
, rtx
));
97 static void copy_insn_list
PARAMS ((rtx
, struct inline_remap
*,
99 static void copy_insn_notes
PARAMS ((rtx
, struct inline_remap
*,
101 static int compare_blocks
PARAMS ((const PTR
, const PTR
));
102 static int find_block
PARAMS ((const PTR
, const PTR
));
104 /* Used by copy_rtx_and_substitute; this indicates whether the function is
105 called for the purpose of inlining or some other purpose (i.e. loop
106 unrolling). This affects how constant pool references are handled.
107 This variable contains the FUNCTION_DECL for the inlined function. */
108 static struct function
*inlining
= 0;
110 /* Returns the Ith entry in the label_map contained in MAP. If the
111 Ith entry has not yet been set, return a fresh label. This function
112 performs a lazy initialization of label_map, thereby avoiding huge memory
113 explosions when the label_map gets very large. */
116 get_label_from_map (map
, i
)
117 struct inline_remap
*map
;
120 rtx x
= map
->label_map
[i
];
123 x
= map
->label_map
[i
] = gen_label_rtx ();
128 /* Return false if the function FNDECL cannot be inlined on account of its
129 attributes, true otherwise. */
131 function_attribute_inlinable_p (fndecl
)
134 bool has_machine_attr
= false;
137 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
139 tree name
= TREE_PURPOSE (a
);
142 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
144 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
146 has_machine_attr
= true;
150 if (has_machine_attr
)
154 if (has_machine_attr
)
155 return (*targetm
.function_attribute_inlinable_p
) (fndecl
);
160 /* Zero if the current function (whose FUNCTION_DECL is FNDECL)
161 is safe and reasonable to integrate into other functions.
162 Nonzero means value is a warning msgid with a single %s
163 for the function's name. */
166 function_cannot_inline_p (fndecl
)
170 tree last
= tree_last (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
172 /* For functions marked as inline increase the maximum size to
173 MAX_INLINE_INSNS (-finline-limit-<n>). For regular functions
174 use the limit given by INTEGRATE_THRESHOLD. */
176 int max_insns
= (DECL_INLINE (fndecl
))
178 + 8 * list_length (DECL_ARGUMENTS (fndecl
)))
179 : INTEGRATE_THRESHOLD (fndecl
);
184 if (DECL_UNINLINABLE (fndecl
))
185 return N_("function cannot be inline");
187 /* No inlines with varargs. */
188 if ((last
&& TREE_VALUE (last
) != void_type_node
)
189 || current_function_varargs
)
190 return N_("varargs function cannot be inline");
192 if (current_function_calls_alloca
)
193 return N_("function using alloca cannot be inline");
195 if (current_function_calls_setjmp
)
196 return N_("function using setjmp cannot be inline");
198 if (current_function_calls_eh_return
)
199 return N_("function uses __builtin_eh_return");
201 if (current_function_contains_functions
)
202 return N_("function with nested functions cannot be inline");
206 N_("function with label addresses used in initializers cannot inline");
208 if (current_function_cannot_inline
)
209 return current_function_cannot_inline
;
211 /* If its not even close, don't even look. */
212 if (get_max_uid () > 3 * max_insns
)
213 return N_("function too large to be inline");
216 /* Don't inline functions which do not specify a function prototype and
217 have BLKmode argument or take the address of a parameter. */
218 for (parms
= DECL_ARGUMENTS (fndecl
); parms
; parms
= TREE_CHAIN (parms
))
220 if (TYPE_MODE (TREE_TYPE (parms
)) == BLKmode
)
221 TREE_ADDRESSABLE (parms
) = 1;
222 if (last
== NULL_TREE
&& TREE_ADDRESSABLE (parms
))
223 return N_("no prototype, and parameter address used; cannot be inline");
227 /* We can't inline functions that return structures
228 the old-fashioned PCC way, copying into a static block. */
229 if (current_function_returns_pcc_struct
)
230 return N_("inline functions not supported for this return value type");
232 /* We can't inline functions that return structures of varying size. */
233 if (TREE_CODE (TREE_TYPE (TREE_TYPE (fndecl
))) != VOID_TYPE
234 && int_size_in_bytes (TREE_TYPE (TREE_TYPE (fndecl
))) < 0)
235 return N_("function with varying-size return value cannot be inline");
237 /* Cannot inline a function with a varying size argument or one that
238 receives a transparent union. */
239 for (parms
= DECL_ARGUMENTS (fndecl
); parms
; parms
= TREE_CHAIN (parms
))
241 if (int_size_in_bytes (TREE_TYPE (parms
)) < 0)
242 return N_("function with varying-size parameter cannot be inline");
243 else if (TREE_CODE (TREE_TYPE (parms
)) == UNION_TYPE
244 && TYPE_TRANSPARENT_UNION (TREE_TYPE (parms
)))
245 return N_("function with transparent unit parameter cannot be inline");
248 if (get_max_uid () > max_insns
)
250 for (ninsns
= 0, insn
= get_first_nonparm_insn ();
251 insn
&& ninsns
< max_insns
;
252 insn
= NEXT_INSN (insn
))
256 if (ninsns
>= max_insns
)
257 return N_("function too large to be inline");
260 /* We will not inline a function which uses computed goto. The addresses of
261 its local labels, which may be tucked into global storage, are of course
262 not constant across instantiations, which causes unexpected behaviour. */
263 if (current_function_has_computed_jump
)
264 return N_("function with computed jump cannot inline");
266 /* We cannot inline a nested function that jumps to a nonlocal label. */
267 if (current_function_has_nonlocal_goto
)
268 return N_("function with nonlocal goto cannot be inline");
270 /* We can't inline functions that return a PARALLEL rtx. */
271 if (DECL_RTL_SET_P (DECL_RESULT (fndecl
)))
273 rtx result
= DECL_RTL (DECL_RESULT (fndecl
));
274 if (GET_CODE (result
) == PARALLEL
)
275 return N_("inline functions not supported for this return value type");
278 /* If the function has a target specific attribute attached to it,
279 then we assume that we should not inline it. This can be overriden
280 by the target if it defines TARGET_FUNCTION_ATTRIBUTE_INLINABLE_P. */
281 if (!function_attribute_inlinable_p (fndecl
))
282 return N_("function with target specific attribute(s) cannot be inlined");
287 /* Map pseudo reg number into the PARM_DECL for the parm living in the reg.
288 Zero for a reg that isn't a parm's home.
289 Only reg numbers less than max_parm_reg are mapped here. */
290 static tree
*parmdecl_map
;
292 /* In save_for_inline, nonzero if past the parm-initialization insns. */
293 static int in_nonparm_insns
;
295 /* Subroutine for `save_for_inline'. Performs initialization
296 needed to save FNDECL's insns and info for future inline expansion. */
299 initialize_for_inline (fndecl
)
306 /* Clear out PARMDECL_MAP. It was allocated in the caller's frame. */
307 memset ((char *) parmdecl_map
, 0, max_parm_reg
* sizeof (tree
));
308 arg_vector
= rtvec_alloc (list_length (DECL_ARGUMENTS (fndecl
)));
310 for (parms
= DECL_ARGUMENTS (fndecl
), i
= 0;
312 parms
= TREE_CHAIN (parms
), i
++)
314 rtx p
= DECL_RTL (parms
);
316 /* If we have (mem (addressof (mem ...))), use the inner MEM since
317 otherwise the copy_rtx call below will not unshare the MEM since
318 it shares ADDRESSOF. */
319 if (GET_CODE (p
) == MEM
&& GET_CODE (XEXP (p
, 0)) == ADDRESSOF
320 && GET_CODE (XEXP (XEXP (p
, 0), 0)) == MEM
)
321 p
= XEXP (XEXP (p
, 0), 0);
323 RTVEC_ELT (arg_vector
, i
) = p
;
325 if (GET_CODE (p
) == REG
)
326 parmdecl_map
[REGNO (p
)] = parms
;
327 else if (GET_CODE (p
) == CONCAT
)
329 rtx preal
= gen_realpart (GET_MODE (XEXP (p
, 0)), p
);
330 rtx pimag
= gen_imagpart (GET_MODE (preal
), p
);
332 if (GET_CODE (preal
) == REG
)
333 parmdecl_map
[REGNO (preal
)] = parms
;
334 if (GET_CODE (pimag
) == REG
)
335 parmdecl_map
[REGNO (pimag
)] = parms
;
338 /* This flag is cleared later
339 if the function ever modifies the value of the parm. */
340 TREE_READONLY (parms
) = 1;
346 /* Copy NODE (which must be a DECL, but not a PARM_DECL). The DECL
347 originally was in the FROM_FN, but now it will be in the
351 copy_decl_for_inlining (decl
, from_fn
, to_fn
)
358 /* Copy the declaration. */
359 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
361 /* For a parameter, we must make an equivalent VAR_DECL, not a
363 copy
= build_decl (VAR_DECL
, DECL_NAME (decl
), TREE_TYPE (decl
));
364 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
365 TREE_READONLY (copy
) = TREE_READONLY (decl
);
366 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
370 copy
= copy_node (decl
);
371 if (DECL_LANG_SPECIFIC (copy
))
372 copy_lang_decl (copy
);
374 /* TREE_ADDRESSABLE isn't used to indicate that a label's
375 address has been taken; it's for internal bookkeeping in
376 expand_goto_internal. */
377 if (TREE_CODE (copy
) == LABEL_DECL
)
378 TREE_ADDRESSABLE (copy
) = 0;
381 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
382 declaration inspired this copy. */
383 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
385 /* The new variable/label has no RTL, yet. */
386 SET_DECL_RTL (copy
, NULL_RTX
);
388 /* These args would always appear unused, if not for this. */
389 TREE_USED (copy
) = 1;
391 /* Set the context for the new declaration. */
392 if (!DECL_CONTEXT (decl
))
393 /* Globals stay global. */
395 else if (DECL_CONTEXT (decl
) != from_fn
)
396 /* Things that weren't in the scope of the function we're inlining
397 from aren't in the scope we're inlining too, either. */
399 else if (TREE_STATIC (decl
))
400 /* Function-scoped static variables should say in the original
404 /* Ordinary automatic local variables are now in the scope of the
406 DECL_CONTEXT (copy
) = to_fn
;
411 /* Make the insns and PARM_DECLs of the current function permanent
412 and record other information in DECL_SAVED_INSNS to allow inlining
413 of this function in subsequent calls.
415 This routine need not copy any insns because we are not going
416 to immediately compile the insns in the insn chain. There
417 are two cases when we would compile the insns for FNDECL:
418 (1) when FNDECL is expanded inline, and (2) when FNDECL needs to
419 be output at the end of other compilation, because somebody took
420 its address. In the first case, the insns of FNDECL are copied
421 as it is expanded inline, so FNDECL's saved insns are not
422 modified. In the second case, FNDECL is used for the last time,
423 so modifying the rtl is not a problem.
425 We don't have to worry about FNDECL being inline expanded by
426 other functions which are written at the end of compilation
427 because flag_no_inline is turned on when we begin writing
428 functions at the end of compilation. */
431 save_for_inline (fndecl
)
436 rtx first_nonparm_insn
;
438 /* Set up PARMDECL_MAP which maps pseudo-reg number to its PARM_DECL.
439 Later we set TREE_READONLY to 0 if the parm is modified inside the fn.
440 Also set up ARG_VECTOR, which holds the unmodified DECL_RTX values
441 for the parms, prior to elimination of virtual registers.
442 These values are needed for substituting parms properly. */
443 if (! flag_no_inline
)
444 parmdecl_map
= (tree
*) xmalloc (max_parm_reg
* sizeof (tree
));
446 /* Make and emit a return-label if we have not already done so. */
448 if (return_label
== 0)
450 return_label
= gen_label_rtx ();
451 emit_label (return_label
);
454 if (! flag_no_inline
)
455 argvec
= initialize_for_inline (fndecl
);
459 /* Delete basic block notes created by early run of find_basic_block.
460 The notes would be later used by find_basic_blocks to reuse the memory
461 for basic_block structures on already freed obstack. */
462 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
463 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BASIC_BLOCK
)
464 delete_related_insns (insn
);
466 /* If there are insns that copy parms from the stack into pseudo registers,
467 those insns are not copied. `expand_inline_function' must
468 emit the correct code to handle such things. */
471 if (GET_CODE (insn
) != NOTE
)
474 if (! flag_no_inline
)
476 /* Get the insn which signals the end of parameter setup code. */
477 first_nonparm_insn
= get_first_nonparm_insn ();
479 /* Now just scan the chain of insns to see what happens to our
480 PARM_DECLs. If a PARM_DECL is used but never modified, we
481 can substitute its rtl directly when expanding inline (and
482 perform constant folding when its incoming value is
483 constant). Otherwise, we have to copy its value into a new
484 register and track the new register's life. */
485 in_nonparm_insns
= 0;
486 save_parm_insns (insn
, first_nonparm_insn
);
488 cfun
->inl_max_label_num
= max_label_num ();
489 cfun
->inl_last_parm_insn
= cfun
->x_last_parm_insn
;
490 cfun
->original_arg_vector
= argvec
;
492 cfun
->original_decl_initial
= DECL_INITIAL (fndecl
);
493 cfun
->no_debugging_symbols
= (write_symbols
== NO_DEBUG
);
494 DECL_SAVED_INSNS (fndecl
) = cfun
;
497 if (! flag_no_inline
)
501 /* Scan the chain of insns to see what happens to our PARM_DECLs. If a
502 PARM_DECL is used but never modified, we can substitute its rtl directly
503 when expanding inline (and perform constant folding when its incoming
504 value is constant). Otherwise, we have to copy its value into a new
505 register and track the new register's life. */
508 save_parm_insns (insn
, first_nonparm_insn
)
510 rtx first_nonparm_insn
;
512 if (insn
== NULL_RTX
)
515 for (insn
= NEXT_INSN (insn
); insn
; insn
= NEXT_INSN (insn
))
517 if (insn
== first_nonparm_insn
)
518 in_nonparm_insns
= 1;
522 /* Record what interesting things happen to our parameters. */
523 note_stores (PATTERN (insn
), note_modified_parmregs
, NULL
);
525 /* If this is a CALL_PLACEHOLDER insn then we need to look into the
526 three attached sequences: normal call, sibling call and tail
528 if (GET_CODE (insn
) == CALL_INSN
529 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
533 for (i
= 0; i
< 3; i
++)
534 save_parm_insns (XEXP (PATTERN (insn
), i
),
541 /* Note whether a parameter is modified or not. */
544 note_modified_parmregs (reg
, x
, data
)
546 rtx x ATTRIBUTE_UNUSED
;
547 void *data ATTRIBUTE_UNUSED
;
549 if (GET_CODE (reg
) == REG
&& in_nonparm_insns
550 && REGNO (reg
) < max_parm_reg
551 && REGNO (reg
) >= FIRST_PSEUDO_REGISTER
552 && parmdecl_map
[REGNO (reg
)] != 0)
553 TREE_READONLY (parmdecl_map
[REGNO (reg
)]) = 0;
556 /* Unfortunately, we need a global copy of const_equiv map for communication
557 with a function called from note_stores. Be *very* careful that this
558 is used properly in the presence of recursion. */
560 varray_type global_const_equiv_varray
;
562 #define FIXED_BASE_PLUS_P(X) \
563 (GET_CODE (X) == PLUS && GET_CODE (XEXP (X, 1)) == CONST_INT \
564 && GET_CODE (XEXP (X, 0)) == REG \
565 && REGNO (XEXP (X, 0)) >= FIRST_VIRTUAL_REGISTER \
566 && REGNO (XEXP (X, 0)) <= LAST_VIRTUAL_REGISTER)
568 /* Called to set up a mapping for the case where a parameter is in a
569 register. If it is read-only and our argument is a constant, set up the
570 constant equivalence.
572 If LOC is REG_USERVAR_P, the usual case, COPY must also have that flag set
575 Also, don't allow hard registers here; they might not be valid when
576 substituted into insns. */
578 process_reg_param (map
, loc
, copy
)
579 struct inline_remap
*map
;
582 if ((GET_CODE (copy
) != REG
&& GET_CODE (copy
) != SUBREG
)
583 || (GET_CODE (copy
) == REG
&& REG_USERVAR_P (loc
)
584 && ! REG_USERVAR_P (copy
))
585 || (GET_CODE (copy
) == REG
586 && REGNO (copy
) < FIRST_PSEUDO_REGISTER
))
588 rtx temp
= copy_to_mode_reg (GET_MODE (loc
), copy
);
589 REG_USERVAR_P (temp
) = REG_USERVAR_P (loc
);
590 if (CONSTANT_P (copy
) || FIXED_BASE_PLUS_P (copy
))
591 SET_CONST_EQUIV_DATA (map
, temp
, copy
, CONST_AGE_PARM
);
594 map
->reg_map
[REGNO (loc
)] = copy
;
597 /* Compare two BLOCKs for qsort. The key we sort on is the
598 BLOCK_ABSTRACT_ORIGIN of the blocks. */
601 compare_blocks (v1
, v2
)
605 tree b1
= *((const tree
*) v1
);
606 tree b2
= *((const tree
*) v2
);
608 return ((char *) BLOCK_ABSTRACT_ORIGIN (b1
)
609 - (char *) BLOCK_ABSTRACT_ORIGIN (b2
));
612 /* Compare two BLOCKs for bsearch. The first pointer corresponds to
613 an original block; the second to a remapped equivalent. */
620 const union tree_node
*b1
= (const union tree_node
*) v1
;
621 tree b2
= *((const tree
*) v2
);
623 return ((const char *) b1
- (char *) BLOCK_ABSTRACT_ORIGIN (b2
));
626 /* Integrate the procedure defined by FNDECL. Note that this function
627 may wind up calling itself. Since the static variables are not
628 reentrant, we do not assign them until after the possibility
629 of recursion is eliminated.
631 If IGNORE is nonzero, do not produce a value.
632 Otherwise store the value in TARGET if it is nonzero and that is convenient.
635 (rtx)-1 if we could not substitute the function
636 0 if we substituted it and it does not produce a value
637 else an rtx for where the value is stored. */
640 expand_inline_function (fndecl
, parms
, target
, ignore
, type
,
641 structure_value_addr
)
646 rtx structure_value_addr
;
648 struct function
*inlining_previous
;
649 struct function
*inl_f
= DECL_SAVED_INSNS (fndecl
);
650 tree formal
, actual
, block
;
651 rtx parm_insns
= inl_f
->emit
->x_first_insn
;
652 rtx insns
= (inl_f
->inl_last_parm_insn
653 ? NEXT_INSN (inl_f
->inl_last_parm_insn
)
659 int min_labelno
= inl_f
->emit
->x_first_label_num
;
660 int max_labelno
= inl_f
->inl_max_label_num
;
665 struct inline_remap
*map
= 0;
666 rtvec arg_vector
= (rtvec
) inl_f
->original_arg_vector
;
667 rtx static_chain_value
= 0;
669 int eh_region_offset
;
671 /* The pointer used to track the true location of the memory used
672 for MAP->LABEL_MAP. */
673 rtx
*real_label_map
= 0;
675 /* Allow for equivalences of the pseudos we make for virtual fp and ap. */
676 max_regno
= inl_f
->emit
->x_reg_rtx_no
+ 3;
677 if (max_regno
< FIRST_PSEUDO_REGISTER
)
680 /* Pull out the decl for the function definition; fndecl may be a
681 local declaration, which would break DECL_ABSTRACT_ORIGIN. */
682 fndecl
= inl_f
->decl
;
684 nargs
= list_length (DECL_ARGUMENTS (fndecl
));
686 if (cfun
->preferred_stack_boundary
< inl_f
->preferred_stack_boundary
)
687 cfun
->preferred_stack_boundary
= inl_f
->preferred_stack_boundary
;
689 /* Check that the parms type match and that sufficient arguments were
690 passed. Since the appropriate conversions or default promotions have
691 already been applied, the machine modes should match exactly. */
693 for (formal
= DECL_ARGUMENTS (fndecl
), actual
= parms
;
695 formal
= TREE_CHAIN (formal
), actual
= TREE_CHAIN (actual
))
698 enum machine_mode mode
;
701 return (rtx
) (HOST_WIDE_INT
) -1;
703 arg
= TREE_VALUE (actual
);
704 mode
= TYPE_MODE (DECL_ARG_TYPE (formal
));
706 if (arg
== error_mark_node
707 || mode
!= TYPE_MODE (TREE_TYPE (arg
))
708 /* If they are block mode, the types should match exactly.
709 They don't match exactly if TREE_TYPE (FORMAL) == ERROR_MARK_NODE,
710 which could happen if the parameter has incomplete type. */
712 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg
))
713 != TYPE_MAIN_VARIANT (TREE_TYPE (formal
)))))
714 return (rtx
) (HOST_WIDE_INT
) -1;
717 /* Extra arguments are valid, but will be ignored below, so we must
718 evaluate them here for side-effects. */
719 for (; actual
; actual
= TREE_CHAIN (actual
))
720 expand_expr (TREE_VALUE (actual
), const0_rtx
,
721 TYPE_MODE (TREE_TYPE (TREE_VALUE (actual
))), 0);
723 /* Expand the function arguments. Do this first so that any
724 new registers get created before we allocate the maps. */
726 arg_vals
= (rtx
*) xmalloc (nargs
* sizeof (rtx
));
727 arg_trees
= (tree
*) xmalloc (nargs
* sizeof (tree
));
729 for (formal
= DECL_ARGUMENTS (fndecl
), actual
= parms
, i
= 0;
731 formal
= TREE_CHAIN (formal
), actual
= TREE_CHAIN (actual
), i
++)
733 /* Actual parameter, converted to the type of the argument within the
735 tree arg
= convert (TREE_TYPE (formal
), TREE_VALUE (actual
));
736 /* Mode of the variable used within the function. */
737 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (formal
));
741 loc
= RTVEC_ELT (arg_vector
, i
);
743 /* If this is an object passed by invisible reference, we copy the
744 object into a stack slot and save its address. If this will go
745 into memory, we do nothing now. Otherwise, we just expand the
747 if (GET_CODE (loc
) == MEM
&& GET_CODE (XEXP (loc
, 0)) == REG
748 && REGNO (XEXP (loc
, 0)) > LAST_VIRTUAL_REGISTER
)
750 rtx stack_slot
= assign_temp (TREE_TYPE (arg
), 1, 1, 1);
752 store_expr (arg
, stack_slot
, 0);
753 arg_vals
[i
] = XEXP (stack_slot
, 0);
756 else if (GET_CODE (loc
) != MEM
)
758 if (GET_MODE (loc
) != TYPE_MODE (TREE_TYPE (arg
)))
760 int unsignedp
= TREE_UNSIGNED (TREE_TYPE (formal
));
761 enum machine_mode pmode
= TYPE_MODE (TREE_TYPE (formal
));
763 pmode
= promote_mode (TREE_TYPE (formal
), pmode
,
766 if (GET_MODE (loc
) != pmode
)
769 /* The mode if LOC and ARG can differ if LOC was a variable
770 that had its mode promoted via PROMOTED_MODE. */
771 arg_vals
[i
] = convert_modes (pmode
,
772 TYPE_MODE (TREE_TYPE (arg
)),
773 expand_expr (arg
, NULL_RTX
, mode
,
778 arg_vals
[i
] = expand_expr (arg
, NULL_RTX
, mode
, EXPAND_SUM
);
784 && (! TREE_READONLY (formal
)
785 /* If the parameter is not read-only, copy our argument through
786 a register. Also, we cannot use ARG_VALS[I] if it overlaps
787 TARGET in any way. In the inline function, they will likely
788 be two different pseudos, and `safe_from_p' will make all
789 sorts of smart assumptions about their not conflicting.
790 But if ARG_VALS[I] overlaps TARGET, these assumptions are
791 wrong, so put ARG_VALS[I] into a fresh register.
792 Don't worry about invisible references, since their stack
793 temps will never overlap the target. */
796 && (GET_CODE (arg_vals
[i
]) == REG
797 || GET_CODE (arg_vals
[i
]) == SUBREG
798 || GET_CODE (arg_vals
[i
]) == MEM
)
799 && reg_overlap_mentioned_p (arg_vals
[i
], target
))
800 /* ??? We must always copy a SUBREG into a REG, because it might
801 get substituted into an address, and not all ports correctly
802 handle SUBREGs in addresses. */
803 || (GET_CODE (arg_vals
[i
]) == SUBREG
)))
804 arg_vals
[i
] = copy_to_mode_reg (GET_MODE (loc
), arg_vals
[i
]);
806 if (arg_vals
[i
] != 0 && GET_CODE (arg_vals
[i
]) == REG
807 && POINTER_TYPE_P (TREE_TYPE (formal
)))
808 mark_reg_pointer (arg_vals
[i
],
809 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (formal
))));
812 /* Allocate the structures we use to remap things. */
814 map
= (struct inline_remap
*) xcalloc (1, sizeof (struct inline_remap
));
815 map
->fndecl
= fndecl
;
817 VARRAY_TREE_INIT (map
->block_map
, 10, "block_map");
818 map
->reg_map
= (rtx
*) xcalloc (max_regno
, sizeof (rtx
));
820 /* We used to use alloca here, but the size of what it would try to
821 allocate would occasionally cause it to exceed the stack limit and
822 cause unpredictable core dumps. */
824 = (rtx
*) xmalloc ((max_labelno
) * sizeof (rtx
));
825 map
->label_map
= real_label_map
;
826 map
->local_return_label
= NULL_RTX
;
828 inl_max_uid
= (inl_f
->emit
->x_cur_insn_uid
+ 1);
829 map
->insn_map
= (rtx
*) xcalloc (inl_max_uid
, sizeof (rtx
));
831 map
->max_insnno
= inl_max_uid
;
833 map
->integrating
= 1;
834 map
->compare_src
= NULL_RTX
;
835 map
->compare_mode
= VOIDmode
;
837 /* const_equiv_varray maps pseudos in our routine to constants, so
838 it needs to be large enough for all our pseudos. This is the
839 number we are currently using plus the number in the called
840 routine, plus 15 for each arg, five to compute the virtual frame
841 pointer, and five for the return value. This should be enough
842 for most cases. We do not reference entries outside the range of
845 ??? These numbers are quite arbitrary and were obtained by
846 experimentation. At some point, we should try to allocate the
847 table after all the parameters are set up so we an more accurately
848 estimate the number of pseudos we will need. */
850 VARRAY_CONST_EQUIV_INIT (map
->const_equiv_varray
,
852 + (max_regno
- FIRST_PSEUDO_REGISTER
)
855 "expand_inline_function");
858 /* Record the current insn in case we have to set up pointers to frame
859 and argument memory blocks. If there are no insns yet, add a dummy
860 insn that can be used as an insertion point. */
861 map
->insns_at_start
= get_last_insn ();
862 if (map
->insns_at_start
== 0)
863 map
->insns_at_start
= emit_note (NULL
, NOTE_INSN_DELETED
);
865 map
->regno_pointer_align
= inl_f
->emit
->regno_pointer_align
;
866 map
->x_regno_reg_rtx
= inl_f
->emit
->x_regno_reg_rtx
;
868 /* Update the outgoing argument size to allow for those in the inlined
870 if (inl_f
->outgoing_args_size
> current_function_outgoing_args_size
)
871 current_function_outgoing_args_size
= inl_f
->outgoing_args_size
;
873 /* If the inline function needs to make PIC references, that means
874 that this function's PIC offset table must be used. */
875 if (inl_f
->uses_pic_offset_table
)
876 current_function_uses_pic_offset_table
= 1;
878 /* If this function needs a context, set it up. */
879 if (inl_f
->needs_context
)
880 static_chain_value
= lookup_static_chain (fndecl
);
882 if (GET_CODE (parm_insns
) == NOTE
883 && NOTE_LINE_NUMBER (parm_insns
) > 0)
885 rtx note
= emit_note (NOTE_SOURCE_FILE (parm_insns
),
886 NOTE_LINE_NUMBER (parm_insns
));
888 RTX_INTEGRATED_P (note
) = 1;
891 /* Process each argument. For each, set up things so that the function's
892 reference to the argument will refer to the argument being passed.
893 We only replace REG with REG here. Any simplifications are done
896 We make two passes: In the first, we deal with parameters that will
897 be placed into registers, since we need to ensure that the allocated
898 register number fits in const_equiv_map. Then we store all non-register
899 parameters into their memory location. */
901 /* Don't try to free temp stack slots here, because we may put one of the
902 parameters into a temp stack slot. */
904 for (i
= 0; i
< nargs
; i
++)
906 rtx copy
= arg_vals
[i
];
908 loc
= RTVEC_ELT (arg_vector
, i
);
910 /* There are three cases, each handled separately. */
911 if (GET_CODE (loc
) == MEM
&& GET_CODE (XEXP (loc
, 0)) == REG
912 && REGNO (XEXP (loc
, 0)) > LAST_VIRTUAL_REGISTER
)
914 /* This must be an object passed by invisible reference (it could
915 also be a variable-sized object, but we forbid inlining functions
916 with variable-sized arguments). COPY is the address of the
917 actual value (this computation will cause it to be copied). We
918 map that address for the register, noting the actual address as
919 an equivalent in case it can be substituted into the insns. */
921 if (GET_CODE (copy
) != REG
)
923 temp
= copy_addr_to_reg (copy
);
924 if (CONSTANT_P (copy
) || FIXED_BASE_PLUS_P (copy
))
925 SET_CONST_EQUIV_DATA (map
, temp
, copy
, CONST_AGE_PARM
);
928 map
->reg_map
[REGNO (XEXP (loc
, 0))] = copy
;
930 else if (GET_CODE (loc
) == MEM
)
932 /* This is the case of a parameter that lives in memory. It
933 will live in the block we allocate in the called routine's
934 frame that simulates the incoming argument area. Do nothing
935 with the parameter now; we will call store_expr later. In
936 this case, however, we must ensure that the virtual stack and
937 incoming arg rtx values are expanded now so that we can be
938 sure we have enough slots in the const equiv map since the
939 store_expr call can easily blow the size estimate. */
940 if (DECL_SAVED_INSNS (fndecl
)->args_size
!= 0)
941 copy_rtx_and_substitute (virtual_incoming_args_rtx
, map
, 0);
943 else if (GET_CODE (loc
) == REG
)
944 process_reg_param (map
, loc
, copy
);
945 else if (GET_CODE (loc
) == CONCAT
)
947 rtx locreal
= gen_realpart (GET_MODE (XEXP (loc
, 0)), loc
);
948 rtx locimag
= gen_imagpart (GET_MODE (XEXP (loc
, 0)), loc
);
949 rtx copyreal
= gen_realpart (GET_MODE (locreal
), copy
);
950 rtx copyimag
= gen_imagpart (GET_MODE (locimag
), copy
);
952 process_reg_param (map
, locreal
, copyreal
);
953 process_reg_param (map
, locimag
, copyimag
);
959 /* Tell copy_rtx_and_substitute to handle constant pool SYMBOL_REFs
960 specially. This function can be called recursively, so we need to
961 save the previous value. */
962 inlining_previous
= inlining
;
965 /* Now do the parameters that will be placed in memory. */
967 for (formal
= DECL_ARGUMENTS (fndecl
), i
= 0;
968 formal
; formal
= TREE_CHAIN (formal
), i
++)
970 loc
= RTVEC_ELT (arg_vector
, i
);
972 if (GET_CODE (loc
) == MEM
973 /* Exclude case handled above. */
974 && ! (GET_CODE (XEXP (loc
, 0)) == REG
975 && REGNO (XEXP (loc
, 0)) > LAST_VIRTUAL_REGISTER
))
977 rtx note
= emit_note (DECL_SOURCE_FILE (formal
),
978 DECL_SOURCE_LINE (formal
));
980 RTX_INTEGRATED_P (note
) = 1;
982 /* Compute the address in the area we reserved and store the
984 temp
= copy_rtx_and_substitute (loc
, map
, 1);
985 subst_constants (&temp
, NULL_RTX
, map
, 1);
986 apply_change_group ();
987 if (! memory_address_p (GET_MODE (temp
), XEXP (temp
, 0)))
988 temp
= change_address (temp
, VOIDmode
, XEXP (temp
, 0));
989 store_expr (arg_trees
[i
], temp
, 0);
993 /* Deal with the places that the function puts its result.
994 We are driven by what is placed into DECL_RESULT.
996 Initially, we assume that we don't have anything special handling for
997 REG_FUNCTION_RETURN_VALUE_P. */
999 map
->inline_target
= 0;
1000 loc
= (DECL_RTL_SET_P (DECL_RESULT (fndecl
))
1001 ? DECL_RTL (DECL_RESULT (fndecl
)) : NULL_RTX
);
1003 if (TYPE_MODE (type
) == VOIDmode
)
1004 /* There is no return value to worry about. */
1006 else if (GET_CODE (loc
) == MEM
)
1008 if (GET_CODE (XEXP (loc
, 0)) == ADDRESSOF
)
1010 temp
= copy_rtx_and_substitute (loc
, map
, 1);
1011 subst_constants (&temp
, NULL_RTX
, map
, 1);
1012 apply_change_group ();
1017 if (! structure_value_addr
1018 || ! aggregate_value_p (DECL_RESULT (fndecl
)))
1021 /* Pass the function the address in which to return a structure
1022 value. Note that a constructor can cause someone to call us
1023 with STRUCTURE_VALUE_ADDR, but the initialization takes place
1024 via the first parameter, rather than the struct return address.
1026 We have two cases: If the address is a simple register
1027 indirect, use the mapping mechanism to point that register to
1028 our structure return address. Otherwise, store the structure
1029 return value into the place that it will be referenced from. */
1031 if (GET_CODE (XEXP (loc
, 0)) == REG
)
1033 temp
= force_operand (structure_value_addr
, NULL_RTX
);
1034 temp
= force_reg (Pmode
, temp
);
1035 /* A virtual register might be invalid in an insn, because
1036 it can cause trouble in reload. Since we don't have access
1037 to the expanders at map translation time, make sure we have
1038 a proper register now.
1039 If a virtual register is actually valid, cse or combine
1040 can put it into the mapped insns. */
1041 if (REGNO (temp
) >= FIRST_VIRTUAL_REGISTER
1042 && REGNO (temp
) <= LAST_VIRTUAL_REGISTER
)
1043 temp
= copy_to_mode_reg (Pmode
, temp
);
1044 map
->reg_map
[REGNO (XEXP (loc
, 0))] = temp
;
1046 if (CONSTANT_P (structure_value_addr
)
1047 || GET_CODE (structure_value_addr
) == ADDRESSOF
1048 || (GET_CODE (structure_value_addr
) == PLUS
1049 && (XEXP (structure_value_addr
, 0)
1050 == virtual_stack_vars_rtx
)
1051 && (GET_CODE (XEXP (structure_value_addr
, 1))
1054 SET_CONST_EQUIV_DATA (map
, temp
, structure_value_addr
,
1060 temp
= copy_rtx_and_substitute (loc
, map
, 1);
1061 subst_constants (&temp
, NULL_RTX
, map
, 0);
1062 apply_change_group ();
1063 emit_move_insn (temp
, structure_value_addr
);
1068 /* We will ignore the result value, so don't look at its structure.
1069 Note that preparations for an aggregate return value
1070 do need to be made (above) even if it will be ignored. */
1072 else if (GET_CODE (loc
) == REG
)
1074 /* The function returns an object in a register and we use the return
1075 value. Set up our target for remapping. */
1077 /* Machine mode function was declared to return. */
1078 enum machine_mode departing_mode
= TYPE_MODE (type
);
1079 /* (Possibly wider) machine mode it actually computes
1080 (for the sake of callers that fail to declare it right).
1081 We have to use the mode of the result's RTL, rather than
1082 its type, since expand_function_start may have promoted it. */
1083 enum machine_mode arriving_mode
1084 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl
)));
1087 /* Don't use MEMs as direct targets because on some machines
1088 substituting a MEM for a REG makes invalid insns.
1089 Let the combiner substitute the MEM if that is valid. */
1090 if (target
== 0 || GET_CODE (target
) != REG
1091 || GET_MODE (target
) != departing_mode
)
1093 /* Don't make BLKmode registers. If this looks like
1094 a BLKmode object being returned in a register, get
1095 the mode from that, otherwise abort. */
1096 if (departing_mode
== BLKmode
)
1098 if (REG
== GET_CODE (DECL_RTL (DECL_RESULT (fndecl
))))
1100 departing_mode
= GET_MODE (DECL_RTL (DECL_RESULT (fndecl
)));
1101 arriving_mode
= departing_mode
;
1107 target
= gen_reg_rtx (departing_mode
);
1110 /* If function's value was promoted before return,
1111 avoid machine mode mismatch when we substitute INLINE_TARGET.
1112 But TARGET is what we will return to the caller. */
1113 if (arriving_mode
!= departing_mode
)
1115 /* Avoid creating a paradoxical subreg wider than
1116 BITS_PER_WORD, since that is illegal. */
1117 if (GET_MODE_BITSIZE (arriving_mode
) > BITS_PER_WORD
)
1119 if (!TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (departing_mode
),
1120 GET_MODE_BITSIZE (arriving_mode
)))
1121 /* Maybe could be handled by using convert_move () ? */
1123 reg_to_map
= gen_reg_rtx (arriving_mode
);
1124 target
= gen_lowpart (departing_mode
, reg_to_map
);
1127 reg_to_map
= gen_rtx_SUBREG (arriving_mode
, target
, 0);
1130 reg_to_map
= target
;
1132 /* Usually, the result value is the machine's return register.
1133 Sometimes it may be a pseudo. Handle both cases. */
1134 if (REG_FUNCTION_VALUE_P (loc
))
1135 map
->inline_target
= reg_to_map
;
1137 map
->reg_map
[REGNO (loc
)] = reg_to_map
;
1139 else if (GET_CODE (loc
) == CONCAT
)
1141 enum machine_mode departing_mode
= TYPE_MODE (type
);
1142 enum machine_mode arriving_mode
1143 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl
)));
1145 if (departing_mode
!= arriving_mode
)
1147 if (GET_CODE (XEXP (loc
, 0)) != REG
1148 || GET_CODE (XEXP (loc
, 1)) != REG
)
1151 /* Don't use MEMs as direct targets because on some machines
1152 substituting a MEM for a REG makes invalid insns.
1153 Let the combiner substitute the MEM if that is valid. */
1154 if (target
== 0 || GET_CODE (target
) != REG
1155 || GET_MODE (target
) != departing_mode
)
1156 target
= gen_reg_rtx (departing_mode
);
1158 if (GET_CODE (target
) != CONCAT
)
1161 map
->reg_map
[REGNO (XEXP (loc
, 0))] = XEXP (target
, 0);
1162 map
->reg_map
[REGNO (XEXP (loc
, 1))] = XEXP (target
, 1);
1167 /* Remap the exception handler data pointer from one to the other. */
1168 temp
= get_exception_pointer (inl_f
);
1170 map
->reg_map
[REGNO (temp
)] = get_exception_pointer (cfun
);
1172 /* Initialize label_map. get_label_from_map will actually make
1174 memset ((char *) &map
->label_map
[min_labelno
], 0,
1175 (max_labelno
- min_labelno
) * sizeof (rtx
));
1177 /* Make copies of the decls of the symbols in the inline function, so that
1178 the copies of the variables get declared in the current function. Set
1179 up things so that lookup_static_chain knows that to interpret registers
1180 in SAVE_EXPRs for TYPE_SIZEs as local. */
1181 inline_function_decl
= fndecl
;
1182 integrate_parm_decls (DECL_ARGUMENTS (fndecl
), map
, arg_vector
);
1183 block
= integrate_decl_tree (inl_f
->original_decl_initial
, map
);
1184 BLOCK_ABSTRACT_ORIGIN (block
) = DECL_ORIGIN (fndecl
);
1185 inline_function_decl
= 0;
1187 /* Make a fresh binding contour that we can easily remove. Do this after
1188 expanding our arguments so cleanups are properly scoped. */
1189 expand_start_bindings_and_block (0, block
);
1191 /* Sort the block-map so that it will be easy to find remapped
1193 qsort (&VARRAY_TREE (map
->block_map
, 0),
1194 map
->block_map
->elements_used
,
1198 /* Perform postincrements before actually calling the function. */
1201 /* Clean up stack so that variables might have smaller offsets. */
1202 do_pending_stack_adjust ();
1204 /* Save a copy of the location of const_equiv_varray for
1205 mark_stores, called via note_stores. */
1206 global_const_equiv_varray
= map
->const_equiv_varray
;
1208 /* If the called function does an alloca, save and restore the
1209 stack pointer around the call. This saves stack space, but
1210 also is required if this inline is being done between two
1212 if (inl_f
->calls_alloca
)
1213 emit_stack_save (SAVE_BLOCK
, &stack_save
, NULL_RTX
);
1215 /* Map pseudos used for initial hard reg values. */
1216 setup_initial_hard_reg_value_integration (inl_f
, map
);
1218 /* Now copy the insns one by one. */
1219 copy_insn_list (insns
, map
, static_chain_value
);
1221 /* Duplicate the EH regions. This will create an offset from the
1222 region numbers in the function we're inlining to the region
1223 numbers in the calling function. This must wait until after
1224 copy_insn_list, as we need the insn map to be complete. */
1225 eh_region_offset
= duplicate_eh_regions (inl_f
, map
);
1227 /* Now copy the REG_NOTES for those insns. */
1228 copy_insn_notes (insns
, map
, eh_region_offset
);
1230 /* If the insn sequence required one, emit the return label. */
1231 if (map
->local_return_label
)
1232 emit_label (map
->local_return_label
);
1234 /* Restore the stack pointer if we saved it above. */
1235 if (inl_f
->calls_alloca
)
1236 emit_stack_restore (SAVE_BLOCK
, stack_save
, NULL_RTX
);
1238 if (! cfun
->x_whole_function_mode_p
)
1239 /* In statement-at-a-time mode, we just tell the front-end to add
1240 this block to the list of blocks at this binding level. We
1241 can't do it the way it's done for function-at-a-time mode the
1242 superblocks have not been created yet. */
1243 insert_block (block
);
1247 = BLOCK_CHAIN (DECL_INITIAL (current_function_decl
));
1248 BLOCK_CHAIN (DECL_INITIAL (current_function_decl
)) = block
;
1251 /* End the scope containing the copied formal parameter variables
1252 and copied LABEL_DECLs. We pass NULL_TREE for the variables list
1253 here so that expand_end_bindings will not check for unused
1254 variables. That's already been checked for when the inlined
1255 function was defined. */
1256 expand_end_bindings (NULL_TREE
, 1, 1);
1258 /* Must mark the line number note after inlined functions as a repeat, so
1259 that the test coverage code can avoid counting the call twice. This
1260 just tells the code to ignore the immediately following line note, since
1261 there already exists a copy of this note before the expanded inline call.
1262 This line number note is still needed for debugging though, so we can't
1264 if (flag_test_coverage
)
1265 emit_note (0, NOTE_INSN_REPEATED_LINE_NUMBER
);
1267 emit_line_note (input_filename
, lineno
);
1269 /* If the function returns a BLKmode object in a register, copy it
1270 out of the temp register into a BLKmode memory object. */
1272 && TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl
))) == BLKmode
1273 && ! aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl
))))
1274 target
= copy_blkmode_from_reg (0, target
, TREE_TYPE (TREE_TYPE (fndecl
)));
1276 if (structure_value_addr
)
1278 target
= gen_rtx_MEM (TYPE_MODE (type
),
1279 memory_address (TYPE_MODE (type
),
1280 structure_value_addr
));
1281 set_mem_attributes (target
, type
, 1);
1284 /* Make sure we free the things we explicitly allocated with xmalloc. */
1286 free (real_label_map
);
1287 VARRAY_FREE (map
->const_equiv_varray
);
1288 free (map
->reg_map
);
1289 VARRAY_FREE (map
->block_map
);
1290 free (map
->insn_map
);
1295 inlining
= inlining_previous
;
1300 /* Make copies of each insn in the given list using the mapping
1301 computed in expand_inline_function. This function may call itself for
1302 insns containing sequences.
1304 Copying is done in two passes, first the insns and then their REG_NOTES.
1306 If static_chain_value is non-zero, it represents the context-pointer
1307 register for the function. */
1310 copy_insn_list (insns
, map
, static_chain_value
)
1312 struct inline_remap
*map
;
1313 rtx static_chain_value
;
1322 /* Copy the insns one by one. Do this in two passes, first the insns and
1323 then their REG_NOTES. */
1325 /* This loop is very similar to the loop in copy_loop_body in unroll.c. */
1327 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
1329 rtx copy
, pattern
, set
;
1331 map
->orig_asm_operands_vector
= 0;
1333 switch (GET_CODE (insn
))
1336 pattern
= PATTERN (insn
);
1337 set
= single_set (insn
);
1339 if (GET_CODE (pattern
) == USE
1340 && GET_CODE (XEXP (pattern
, 0)) == REG
1341 && REG_FUNCTION_VALUE_P (XEXP (pattern
, 0)))
1342 /* The (USE (REG n)) at return from the function should
1343 be ignored since we are changing (REG n) into
1347 /* Ignore setting a function value that we don't want to use. */
1348 if (map
->inline_target
== 0
1350 && GET_CODE (SET_DEST (set
)) == REG
1351 && REG_FUNCTION_VALUE_P (SET_DEST (set
)))
1353 if (volatile_refs_p (SET_SRC (set
)))
1357 /* If we must not delete the source,
1358 load it into a new temporary. */
1359 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1361 new_set
= single_set (copy
);
1366 = gen_reg_rtx (GET_MODE (SET_DEST (new_set
)));
1368 /* If the source and destination are the same and it
1369 has a note on it, keep the insn. */
1370 else if (rtx_equal_p (SET_DEST (set
), SET_SRC (set
))
1371 && REG_NOTES (insn
) != 0)
1372 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1377 /* Similarly if an ignored return value is clobbered. */
1378 else if (map
->inline_target
== 0
1379 && GET_CODE (pattern
) == CLOBBER
1380 && GET_CODE (XEXP (pattern
, 0)) == REG
1381 && REG_FUNCTION_VALUE_P (XEXP (pattern
, 0)))
1384 /* If this is setting the static chain rtx, omit it. */
1385 else if (static_chain_value
!= 0
1387 && GET_CODE (SET_DEST (set
)) == REG
1388 && rtx_equal_p (SET_DEST (set
),
1389 static_chain_incoming_rtx
))
1392 /* If this is setting the static chain pseudo, set it from
1393 the value we want to give it instead. */
1394 else if (static_chain_value
!= 0
1396 && rtx_equal_p (SET_SRC (set
),
1397 static_chain_incoming_rtx
))
1399 rtx newdest
= copy_rtx_and_substitute (SET_DEST (set
), map
, 1);
1401 copy
= emit_move_insn (newdest
, static_chain_value
);
1402 static_chain_value
= 0;
1405 /* If this is setting the virtual stack vars register, this must
1406 be the code at the handler for a builtin longjmp. The value
1407 saved in the setjmp buffer will be the address of the frame
1408 we've made for this inlined instance within our frame. But we
1409 know the offset of that value so we can use it to reconstruct
1410 our virtual stack vars register from that value. If we are
1411 copying it from the stack pointer, leave it unchanged. */
1413 && rtx_equal_p (SET_DEST (set
), virtual_stack_vars_rtx
))
1415 HOST_WIDE_INT offset
;
1416 temp
= map
->reg_map
[REGNO (SET_DEST (set
))];
1417 temp
= VARRAY_CONST_EQUIV (map
->const_equiv_varray
,
1420 if (rtx_equal_p (temp
, virtual_stack_vars_rtx
))
1422 else if (GET_CODE (temp
) == PLUS
1423 && rtx_equal_p (XEXP (temp
, 0), virtual_stack_vars_rtx
)
1424 && GET_CODE (XEXP (temp
, 1)) == CONST_INT
)
1425 offset
= INTVAL (XEXP (temp
, 1));
1429 if (rtx_equal_p (SET_SRC (set
), stack_pointer_rtx
))
1430 temp
= SET_SRC (set
);
1432 temp
= force_operand (plus_constant (SET_SRC (set
),
1436 copy
= emit_move_insn (virtual_stack_vars_rtx
, temp
);
1440 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1441 /* REG_NOTES will be copied later. */
1444 /* If this insn is setting CC0, it may need to look at
1445 the insn that uses CC0 to see what type of insn it is.
1446 In that case, the call to recog via validate_change will
1447 fail. So don't substitute constants here. Instead,
1448 do it when we emit the following insn.
1450 For example, see the pyr.md file. That machine has signed and
1451 unsigned compares. The compare patterns must check the
1452 following branch insn to see which what kind of compare to
1455 If the previous insn set CC0, substitute constants on it as
1457 if (sets_cc0_p (PATTERN (copy
)) != 0)
1462 try_constants (cc0_insn
, map
);
1464 try_constants (copy
, map
);
1467 try_constants (copy
, map
);
1472 if (map
->integrating
&& returnjump_p (insn
))
1474 if (map
->local_return_label
== 0)
1475 map
->local_return_label
= gen_label_rtx ();
1476 pattern
= gen_jump (map
->local_return_label
);
1479 pattern
= copy_rtx_and_substitute (PATTERN (insn
), map
, 0);
1481 copy
= emit_jump_insn (pattern
);
1485 try_constants (cc0_insn
, map
);
1488 try_constants (copy
, map
);
1490 /* If this used to be a conditional jump insn but whose branch
1491 direction is now know, we must do something special. */
1492 if (any_condjump_p (insn
) && onlyjump_p (insn
) && map
->last_pc_value
)
1495 /* If the previous insn set cc0 for us, delete it. */
1496 if (only_sets_cc0_p (PREV_INSN (copy
)))
1497 delete_related_insns (PREV_INSN (copy
));
1500 /* If this is now a no-op, delete it. */
1501 if (map
->last_pc_value
== pc_rtx
)
1503 delete_related_insns (copy
);
1507 /* Otherwise, this is unconditional jump so we must put a
1508 BARRIER after it. We could do some dead code elimination
1509 here, but jump.c will do it just as well. */
1515 /* If this is a CALL_PLACEHOLDER insn then we need to copy the
1516 three attached sequences: normal call, sibling call and tail
1518 if (GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
1523 for (i
= 0; i
< 3; i
++)
1527 sequence
[i
] = NULL_RTX
;
1528 seq
= XEXP (PATTERN (insn
), i
);
1532 copy_insn_list (seq
, map
, static_chain_value
);
1533 sequence
[i
] = get_insns ();
1538 /* Find the new tail recursion label.
1539 It will already be substituted into sequence[2]. */
1540 tail_label
= copy_rtx_and_substitute (XEXP (PATTERN (insn
), 3),
1543 copy
= emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode
,
1551 pattern
= copy_rtx_and_substitute (PATTERN (insn
), map
, 0);
1552 copy
= emit_call_insn (pattern
);
1554 SIBLING_CALL_P (copy
) = SIBLING_CALL_P (insn
);
1555 CONST_OR_PURE_CALL_P (copy
) = CONST_OR_PURE_CALL_P (insn
);
1557 /* Because the USAGE information potentially contains objects other
1558 than hard registers, we need to copy it. */
1560 CALL_INSN_FUNCTION_USAGE (copy
)
1561 = copy_rtx_and_substitute (CALL_INSN_FUNCTION_USAGE (insn
),
1566 try_constants (cc0_insn
, map
);
1569 try_constants (copy
, map
);
1571 /* Be lazy and assume CALL_INSNs clobber all hard registers. */
1572 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
1573 VARRAY_CONST_EQUIV (map
->const_equiv_varray
, i
).rtx
= 0;
1577 copy
= emit_label (get_label_from_map (map
,
1578 CODE_LABEL_NUMBER (insn
)));
1579 LABEL_NAME (copy
) = LABEL_NAME (insn
);
1584 copy
= emit_barrier ();
1588 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_DELETED_LABEL
)
1590 copy
= emit_label (get_label_from_map (map
,
1591 CODE_LABEL_NUMBER (insn
)));
1592 LABEL_NAME (copy
) = NOTE_SOURCE_FILE (insn
);
1597 /* NOTE_INSN_FUNCTION_END and NOTE_INSN_FUNCTION_BEG are
1598 discarded because it is important to have only one of
1599 each in the current function.
1601 NOTE_INSN_DELETED notes aren't useful. */
1603 if (NOTE_LINE_NUMBER (insn
) != NOTE_INSN_FUNCTION_END
1604 && NOTE_LINE_NUMBER (insn
) != NOTE_INSN_FUNCTION_BEG
1605 && NOTE_LINE_NUMBER (insn
) != NOTE_INSN_DELETED
)
1607 copy
= emit_note (NOTE_SOURCE_FILE (insn
),
1608 NOTE_LINE_NUMBER (insn
));
1610 && (NOTE_LINE_NUMBER (copy
) == NOTE_INSN_BLOCK_BEG
1611 || NOTE_LINE_NUMBER (copy
) == NOTE_INSN_BLOCK_END
)
1612 && NOTE_BLOCK (insn
))
1614 tree
*mapped_block_p
;
1617 = (tree
*) bsearch (NOTE_BLOCK (insn
),
1618 &VARRAY_TREE (map
->block_map
, 0),
1619 map
->block_map
->elements_used
,
1623 if (!mapped_block_p
)
1626 NOTE_BLOCK (copy
) = *mapped_block_p
;
1629 && NOTE_LINE_NUMBER (copy
) == NOTE_INSN_EXPECTED_VALUE
)
1630 NOTE_EXPECTED_VALUE (copy
)
1631 = copy_rtx_and_substitute (NOTE_EXPECTED_VALUE (insn
),
1643 RTX_INTEGRATED_P (copy
) = 1;
1645 map
->insn_map
[INSN_UID (insn
)] = copy
;
1649 /* Copy the REG_NOTES. Increment const_age, so that only constants
1650 from parameters can be substituted in. These are the only ones
1651 that are valid across the entire function. */
1654 copy_insn_notes (insns
, map
, eh_region_offset
)
1656 struct inline_remap
*map
;
1657 int eh_region_offset
;
1662 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
1664 if (! INSN_P (insn
))
1667 new_insn
= map
->insn_map
[INSN_UID (insn
)];
1671 if (REG_NOTES (insn
))
1673 rtx next
, note
= copy_rtx_and_substitute (REG_NOTES (insn
), map
, 0);
1675 /* We must also do subst_constants, in case one of our parameters
1676 has const type and constant value. */
1677 subst_constants (¬e
, NULL_RTX
, map
, 0);
1678 apply_change_group ();
1679 REG_NOTES (new_insn
) = note
;
1681 /* Delete any REG_LABEL notes from the chain. Remap any
1682 REG_EH_REGION notes. */
1683 for (; note
; note
= next
)
1685 next
= XEXP (note
, 1);
1686 if (REG_NOTE_KIND (note
) == REG_LABEL
)
1687 remove_note (new_insn
, note
);
1688 else if (REG_NOTE_KIND (note
) == REG_EH_REGION
)
1689 XEXP (note
, 0) = GEN_INT (INTVAL (XEXP (note
, 0))
1690 + eh_region_offset
);
1694 if (GET_CODE (insn
) == CALL_INSN
1695 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
1698 for (i
= 0; i
< 3; i
++)
1699 copy_insn_notes (XEXP (PATTERN (insn
), i
), map
, eh_region_offset
);
1702 if (GET_CODE (insn
) == JUMP_INSN
1703 && GET_CODE (PATTERN (insn
)) == RESX
)
1704 XINT (PATTERN (new_insn
), 0) += eh_region_offset
;
1708 /* Given a chain of PARM_DECLs, ARGS, copy each decl into a VAR_DECL,
1709 push all of those decls and give each one the corresponding home. */
1712 integrate_parm_decls (args
, map
, arg_vector
)
1714 struct inline_remap
*map
;
1720 for (tail
= args
, i
= 0; tail
; tail
= TREE_CHAIN (tail
), i
++)
1722 tree decl
= copy_decl_for_inlining (tail
, map
->fndecl
,
1723 current_function_decl
);
1725 = copy_rtx_and_substitute (RTVEC_ELT (arg_vector
, i
), map
, 1);
1727 /* We really should be setting DECL_INCOMING_RTL to something reasonable
1728 here, but that's going to require some more work. */
1729 /* DECL_INCOMING_RTL (decl) = ?; */
1730 /* Fully instantiate the address with the equivalent form so that the
1731 debugging information contains the actual register, instead of the
1732 virtual register. Do this by not passing an insn to
1734 subst_constants (&new_decl_rtl
, NULL_RTX
, map
, 1);
1735 apply_change_group ();
1736 SET_DECL_RTL (decl
, new_decl_rtl
);
1740 /* Given a BLOCK node LET, push decls and levels so as to construct in the
1741 current function a tree of contexts isomorphic to the one that is given.
1743 MAP, if nonzero, is a pointer to an inline_remap map which indicates how
1744 registers used in the DECL_RTL field should be remapped. If it is zero,
1745 no mapping is necessary. */
1748 integrate_decl_tree (let
, map
)
1750 struct inline_remap
*map
;
1756 new_block
= make_node (BLOCK
);
1757 VARRAY_PUSH_TREE (map
->block_map
, new_block
);
1758 next
= &BLOCK_VARS (new_block
);
1760 for (t
= BLOCK_VARS (let
); t
; t
= TREE_CHAIN (t
))
1764 d
= copy_decl_for_inlining (t
, map
->fndecl
, current_function_decl
);
1766 if (DECL_RTL_SET_P (t
))
1770 SET_DECL_RTL (d
, copy_rtx_and_substitute (DECL_RTL (t
), map
, 1));
1772 /* Fully instantiate the address with the equivalent form so that the
1773 debugging information contains the actual register, instead of the
1774 virtual register. Do this by not passing an insn to
1777 subst_constants (&r
, NULL_RTX
, map
, 1);
1778 SET_DECL_RTL (d
, r
);
1780 if (GET_CODE (r
) == REG
)
1781 REGNO_DECL (REGNO (r
)) = d
;
1782 else if (GET_CODE (r
) == CONCAT
)
1784 REGNO_DECL (REGNO (XEXP (r
, 0))) = d
;
1785 REGNO_DECL (REGNO (XEXP (r
, 1))) = d
;
1788 apply_change_group ();
1791 /* Add this declaration to the list of variables in the new
1794 next
= &TREE_CHAIN (d
);
1797 next
= &BLOCK_SUBBLOCKS (new_block
);
1798 for (t
= BLOCK_SUBBLOCKS (let
); t
; t
= BLOCK_CHAIN (t
))
1800 *next
= integrate_decl_tree (t
, map
);
1801 BLOCK_SUPERCONTEXT (*next
) = new_block
;
1802 next
= &BLOCK_CHAIN (*next
);
1805 TREE_USED (new_block
) = TREE_USED (let
);
1806 BLOCK_ABSTRACT_ORIGIN (new_block
) = let
;
1811 /* Create a new copy of an rtx. Recursively copies the operands of the rtx,
1812 except for those few rtx codes that are sharable.
1814 We always return an rtx that is similar to that incoming rtx, with the
1815 exception of possibly changing a REG to a SUBREG or vice versa. No
1816 rtl is ever emitted.
1818 If FOR_LHS is nonzero, if means we are processing something that will
1819 be the LHS of a SET. In that case, we copy RTX_UNCHANGING_P even if
1820 inlining since we need to be conservative in how it is set for
1823 Handle constants that need to be placed in the constant pool by
1824 calling `force_const_mem'. */
1827 copy_rtx_and_substitute (orig
, map
, for_lhs
)
1829 struct inline_remap
*map
;
1835 enum machine_mode mode
;
1836 const char *format_ptr
;
1842 code
= GET_CODE (orig
);
1843 mode
= GET_MODE (orig
);
1848 /* If the stack pointer register shows up, it must be part of
1849 stack-adjustments (*not* because we eliminated the frame pointer!).
1850 Small hard registers are returned as-is. Pseudo-registers
1851 go through their `reg_map'. */
1852 regno
= REGNO (orig
);
1853 if (regno
<= LAST_VIRTUAL_REGISTER
1854 || (map
->integrating
1855 && DECL_SAVED_INSNS (map
->fndecl
)->internal_arg_pointer
== orig
))
1857 /* Some hard registers are also mapped,
1858 but others are not translated. */
1859 if (map
->reg_map
[regno
] != 0)
1860 return map
->reg_map
[regno
];
1862 /* If this is the virtual frame pointer, make space in current
1863 function's stack frame for the stack frame of the inline function.
1865 Copy the address of this area into a pseudo. Map
1866 virtual_stack_vars_rtx to this pseudo and set up a constant
1867 equivalence for it to be the address. This will substitute the
1868 address into insns where it can be substituted and use the new
1869 pseudo where it can't. */
1870 else if (regno
== VIRTUAL_STACK_VARS_REGNUM
)
1873 int size
= get_func_frame_size (DECL_SAVED_INSNS (map
->fndecl
));
1874 #ifdef FRAME_GROWS_DOWNWARD
1876 = (DECL_SAVED_INSNS (map
->fndecl
)->stack_alignment_needed
1879 /* In this case, virtual_stack_vars_rtx points to one byte
1880 higher than the top of the frame area. So make sure we
1881 allocate a big enough chunk to keep the frame pointer
1882 aligned like a real one. */
1884 size
= CEIL_ROUND (size
, alignment
);
1887 loc
= assign_stack_temp (BLKmode
, size
, 1);
1888 loc
= XEXP (loc
, 0);
1889 #ifdef FRAME_GROWS_DOWNWARD
1890 /* In this case, virtual_stack_vars_rtx points to one byte
1891 higher than the top of the frame area. So compute the offset
1892 to one byte higher than our substitute frame. */
1893 loc
= plus_constant (loc
, size
);
1895 map
->reg_map
[regno
] = temp
1896 = force_reg (Pmode
, force_operand (loc
, NULL_RTX
));
1898 #ifdef STACK_BOUNDARY
1899 mark_reg_pointer (map
->reg_map
[regno
], STACK_BOUNDARY
);
1902 SET_CONST_EQUIV_DATA (map
, temp
, loc
, CONST_AGE_PARM
);
1904 seq
= gen_sequence ();
1906 emit_insn_after (seq
, map
->insns_at_start
);
1909 else if (regno
== VIRTUAL_INCOMING_ARGS_REGNUM
1910 || (map
->integrating
1911 && (DECL_SAVED_INSNS (map
->fndecl
)->internal_arg_pointer
1914 /* Do the same for a block to contain any arguments referenced
1917 int size
= DECL_SAVED_INSNS (map
->fndecl
)->args_size
;
1920 loc
= assign_stack_temp (BLKmode
, size
, 1);
1921 loc
= XEXP (loc
, 0);
1922 /* When arguments grow downward, the virtual incoming
1923 args pointer points to the top of the argument block,
1924 so the remapped location better do the same. */
1925 #ifdef ARGS_GROW_DOWNWARD
1926 loc
= plus_constant (loc
, size
);
1928 map
->reg_map
[regno
] = temp
1929 = force_reg (Pmode
, force_operand (loc
, NULL_RTX
));
1931 #ifdef STACK_BOUNDARY
1932 mark_reg_pointer (map
->reg_map
[regno
], STACK_BOUNDARY
);
1935 SET_CONST_EQUIV_DATA (map
, temp
, loc
, CONST_AGE_PARM
);
1937 seq
= gen_sequence ();
1939 emit_insn_after (seq
, map
->insns_at_start
);
1942 else if (REG_FUNCTION_VALUE_P (orig
))
1944 /* This is a reference to the function return value. If
1945 the function doesn't have a return value, error. If the
1946 mode doesn't agree, and it ain't BLKmode, make a SUBREG. */
1947 if (map
->inline_target
== 0)
1949 if (rtx_equal_function_value_matters
)
1950 /* This is an ignored return value. We must not
1951 leave it in with REG_FUNCTION_VALUE_P set, since
1952 that would confuse subsequent inlining of the
1953 current function into a later function. */
1954 return gen_rtx_REG (GET_MODE (orig
), regno
);
1956 /* Must be unrolling loops or replicating code if we
1957 reach here, so return the register unchanged. */
1960 else if (GET_MODE (map
->inline_target
) != BLKmode
1961 && mode
!= GET_MODE (map
->inline_target
))
1962 return gen_lowpart (mode
, map
->inline_target
);
1964 return map
->inline_target
;
1966 #if defined (LEAF_REGISTERS) && defined (LEAF_REG_REMAP)
1967 /* If leaf_renumber_regs_insn() might remap this register to
1968 some other number, make sure we don't share it with the
1969 inlined function, otherwise delayed optimization of the
1970 inlined function may change it in place, breaking our
1971 reference to it. We may still shared it within the
1972 function, so create an entry for this register in the
1974 if (map
->integrating
&& regno
< FIRST_PSEUDO_REGISTER
1975 && LEAF_REGISTERS
[regno
] && LEAF_REG_REMAP (regno
) != regno
)
1977 if (!map
->leaf_reg_map
[regno
][mode
])
1978 map
->leaf_reg_map
[regno
][mode
] = gen_rtx_REG (mode
, regno
);
1979 return map
->leaf_reg_map
[regno
][mode
];
1987 if (map
->reg_map
[regno
] == NULL
)
1989 map
->reg_map
[regno
] = gen_reg_rtx (mode
);
1990 REG_USERVAR_P (map
->reg_map
[regno
]) = REG_USERVAR_P (orig
);
1991 REG_LOOP_TEST_P (map
->reg_map
[regno
]) = REG_LOOP_TEST_P (orig
);
1992 RTX_UNCHANGING_P (map
->reg_map
[regno
]) = RTX_UNCHANGING_P (orig
);
1993 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
1995 if (REG_POINTER (map
->x_regno_reg_rtx
[regno
]))
1996 mark_reg_pointer (map
->reg_map
[regno
],
1997 map
->regno_pointer_align
[regno
]);
1999 return map
->reg_map
[regno
];
2002 copy
= copy_rtx_and_substitute (SUBREG_REG (orig
), map
, for_lhs
);
2003 return simplify_gen_subreg (GET_MODE (orig
), copy
,
2004 GET_MODE (SUBREG_REG (orig
)),
2005 SUBREG_BYTE (orig
));
2008 copy
= gen_rtx_ADDRESSOF (mode
,
2009 copy_rtx_and_substitute (XEXP (orig
, 0),
2011 0, ADDRESSOF_DECL (orig
));
2012 regno
= ADDRESSOF_REGNO (orig
);
2013 if (map
->reg_map
[regno
])
2014 regno
= REGNO (map
->reg_map
[regno
]);
2015 else if (regno
> LAST_VIRTUAL_REGISTER
)
2017 temp
= XEXP (orig
, 0);
2018 map
->reg_map
[regno
] = gen_reg_rtx (GET_MODE (temp
));
2019 REG_USERVAR_P (map
->reg_map
[regno
]) = REG_USERVAR_P (temp
);
2020 REG_LOOP_TEST_P (map
->reg_map
[regno
]) = REG_LOOP_TEST_P (temp
);
2021 RTX_UNCHANGING_P (map
->reg_map
[regno
]) = RTX_UNCHANGING_P (temp
);
2022 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
2024 if (REG_POINTER (map
->x_regno_reg_rtx
[regno
]))
2025 mark_reg_pointer (map
->reg_map
[regno
],
2026 map
->regno_pointer_align
[regno
]);
2027 regno
= REGNO (map
->reg_map
[regno
]);
2029 ADDRESSOF_REGNO (copy
) = regno
;
2034 /* USE and CLOBBER are ordinary, but we convert (use (subreg foo))
2035 to (use foo) if the original insn didn't have a subreg.
2036 Removing the subreg distorts the VAX movstrhi pattern
2037 by changing the mode of an operand. */
2038 copy
= copy_rtx_and_substitute (XEXP (orig
, 0), map
, code
== CLOBBER
);
2039 if (GET_CODE (copy
) == SUBREG
&& GET_CODE (XEXP (orig
, 0)) != SUBREG
)
2040 copy
= SUBREG_REG (copy
);
2041 return gen_rtx_fmt_e (code
, VOIDmode
, copy
);
2043 /* We need to handle "deleted" labels that appear in the DECL_RTL
2046 if (NOTE_LINE_NUMBER (orig
) != NOTE_INSN_DELETED_LABEL
)
2049 /* ... FALLTHRU ... */
2051 LABEL_PRESERVE_P (get_label_from_map (map
, CODE_LABEL_NUMBER (orig
)))
2052 = LABEL_PRESERVE_P (orig
);
2053 return get_label_from_map (map
, CODE_LABEL_NUMBER (orig
));
2059 LABEL_REF_NONLOCAL_P (orig
) ? XEXP (orig
, 0)
2060 : get_label_from_map (map
, CODE_LABEL_NUMBER (XEXP (orig
, 0))));
2062 LABEL_OUTSIDE_LOOP_P (copy
) = LABEL_OUTSIDE_LOOP_P (orig
);
2064 /* The fact that this label was previously nonlocal does not mean
2065 it still is, so we must check if it is within the range of
2066 this function's labels. */
2067 LABEL_REF_NONLOCAL_P (copy
)
2068 = (LABEL_REF_NONLOCAL_P (orig
)
2069 && ! (CODE_LABEL_NUMBER (XEXP (copy
, 0)) >= get_first_label_num ()
2070 && CODE_LABEL_NUMBER (XEXP (copy
, 0)) < max_label_num ()));
2072 /* If we have made a nonlocal label local, it means that this
2073 inlined call will be referring to our nonlocal goto handler.
2074 So make sure we create one for this block; we normally would
2075 not since this is not otherwise considered a "call". */
2076 if (LABEL_REF_NONLOCAL_P (orig
) && ! LABEL_REF_NONLOCAL_P (copy
))
2077 function_call_count
++;
2087 /* Symbols which represent the address of a label stored in the constant
2088 pool must be modified to point to a constant pool entry for the
2089 remapped label. Otherwise, symbols are returned unchanged. */
2090 if (CONSTANT_POOL_ADDRESS_P (orig
))
2092 struct function
*f
= inlining
? inlining
: cfun
;
2093 rtx constant
= get_pool_constant_for_function (f
, orig
);
2094 enum machine_mode const_mode
= get_pool_mode_for_function (f
, orig
);
2097 rtx temp
= force_const_mem (const_mode
,
2098 copy_rtx_and_substitute (constant
,
2102 /* Legitimizing the address here is incorrect.
2104 Since we had a SYMBOL_REF before, we can assume it is valid
2105 to have one in this position in the insn.
2107 Also, change_address may create new registers. These
2108 registers will not have valid reg_map entries. This can
2109 cause try_constants() to fail because assumes that all
2110 registers in the rtx have valid reg_map entries, and it may
2111 end up replacing one of these new registers with junk. */
2113 if (! memory_address_p (GET_MODE (temp
), XEXP (temp
, 0)))
2114 temp
= change_address (temp
, GET_MODE (temp
), XEXP (temp
, 0));
2117 temp
= XEXP (temp
, 0);
2119 #ifdef POINTERS_EXTEND_UNSIGNED
2120 if (GET_MODE (temp
) != GET_MODE (orig
))
2121 temp
= convert_memory_address (GET_MODE (orig
), temp
);
2125 else if (GET_CODE (constant
) == LABEL_REF
)
2126 return XEXP (force_const_mem
2128 copy_rtx_and_substitute (constant
, map
, for_lhs
)),
2135 /* We have to make a new copy of this CONST_DOUBLE because don't want
2136 to use the old value of CONST_DOUBLE_MEM. Also, this may be a
2137 duplicate of a CONST_DOUBLE we have already seen. */
2138 if (GET_MODE_CLASS (GET_MODE (orig
)) == MODE_FLOAT
)
2142 REAL_VALUE_FROM_CONST_DOUBLE (d
, orig
);
2143 return CONST_DOUBLE_FROM_REAL_VALUE (d
, GET_MODE (orig
));
2146 return immed_double_const (CONST_DOUBLE_LOW (orig
),
2147 CONST_DOUBLE_HIGH (orig
), VOIDmode
);
2150 /* Make new constant pool entry for a constant
2151 that was in the pool of the inline function. */
2152 if (RTX_INTEGRATED_P (orig
))
2157 /* If a single asm insn contains multiple output operands then
2158 it contains multiple ASM_OPERANDS rtx's that share the input
2159 and constraint vecs. We must make sure that the copied insn
2160 continues to share it. */
2161 if (map
->orig_asm_operands_vector
== ASM_OPERANDS_INPUT_VEC (orig
))
2163 copy
= rtx_alloc (ASM_OPERANDS
);
2164 copy
->volatil
= orig
->volatil
;
2165 PUT_MODE (copy
, GET_MODE (orig
));
2166 ASM_OPERANDS_TEMPLATE (copy
) = ASM_OPERANDS_TEMPLATE (orig
);
2167 ASM_OPERANDS_OUTPUT_CONSTRAINT (copy
)
2168 = ASM_OPERANDS_OUTPUT_CONSTRAINT (orig
);
2169 ASM_OPERANDS_OUTPUT_IDX (copy
) = ASM_OPERANDS_OUTPUT_IDX (orig
);
2170 ASM_OPERANDS_INPUT_VEC (copy
) = map
->copy_asm_operands_vector
;
2171 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy
)
2172 = map
->copy_asm_constraints_vector
;
2173 ASM_OPERANDS_SOURCE_FILE (copy
) = ASM_OPERANDS_SOURCE_FILE (orig
);
2174 ASM_OPERANDS_SOURCE_LINE (copy
) = ASM_OPERANDS_SOURCE_LINE (orig
);
2180 /* This is given special treatment because the first
2181 operand of a CALL is a (MEM ...) which may get
2182 forced into a register for cse. This is undesirable
2183 if function-address cse isn't wanted or if we won't do cse. */
2184 #ifndef NO_FUNCTION_CSE
2185 if (! (optimize
&& ! flag_no_function_cse
))
2189 = gen_rtx_MEM (GET_MODE (XEXP (orig
, 0)),
2190 copy_rtx_and_substitute (XEXP (XEXP (orig
, 0), 0),
2193 MEM_COPY_ATTRIBUTES (copy
, orig
);
2196 gen_rtx_CALL (GET_MODE (orig
), copy
,
2197 copy_rtx_and_substitute (XEXP (orig
, 1), map
, 0));
2202 /* Must be ifdefed out for loop unrolling to work. */
2208 /* If this is setting fp or ap, it means that we have a nonlocal goto.
2209 Adjust the setting by the offset of the area we made.
2210 If the nonlocal goto is into the current function,
2211 this will result in unnecessarily bad code, but should work. */
2212 if (SET_DEST (orig
) == virtual_stack_vars_rtx
2213 || SET_DEST (orig
) == virtual_incoming_args_rtx
)
2215 /* In case a translation hasn't occurred already, make one now. */
2218 HOST_WIDE_INT loc_offset
;
2220 copy_rtx_and_substitute (SET_DEST (orig
), map
, for_lhs
);
2221 equiv_reg
= map
->reg_map
[REGNO (SET_DEST (orig
))];
2222 equiv_loc
= VARRAY_CONST_EQUIV (map
->const_equiv_varray
,
2223 REGNO (equiv_reg
)).rtx
;
2225 = GET_CODE (equiv_loc
) == REG
? 0 : INTVAL (XEXP (equiv_loc
, 1));
2227 return gen_rtx_SET (VOIDmode
, SET_DEST (orig
),
2230 (copy_rtx_and_substitute (SET_SRC (orig
),
2236 return gen_rtx_SET (VOIDmode
,
2237 copy_rtx_and_substitute (SET_DEST (orig
), map
, 1),
2238 copy_rtx_and_substitute (SET_SRC (orig
), map
, 0));
2243 && GET_CODE (XEXP (orig
, 0)) == SYMBOL_REF
2244 && CONSTANT_POOL_ADDRESS_P (XEXP (orig
, 0)))
2246 enum machine_mode const_mode
2247 = get_pool_mode_for_function (inlining
, XEXP (orig
, 0));
2249 = get_pool_constant_for_function (inlining
, XEXP (orig
, 0));
2251 constant
= copy_rtx_and_substitute (constant
, map
, 0);
2253 /* If this was an address of a constant pool entry that itself
2254 had to be placed in the constant pool, it might not be a
2255 valid address. So the recursive call might have turned it
2256 into a register. In that case, it isn't a constant any
2257 more, so return it. This has the potential of changing a
2258 MEM into a REG, but we'll assume that it safe. */
2259 if (! CONSTANT_P (constant
))
2262 return validize_mem (force_const_mem (const_mode
, constant
));
2265 copy
= rtx_alloc (MEM
);
2266 PUT_MODE (copy
, mode
);
2267 XEXP (copy
, 0) = copy_rtx_and_substitute (XEXP (orig
, 0), map
, 0);
2268 MEM_COPY_ATTRIBUTES (copy
, orig
);
2275 copy
= rtx_alloc (code
);
2276 PUT_MODE (copy
, mode
);
2277 copy
->in_struct
= orig
->in_struct
;
2278 copy
->volatil
= orig
->volatil
;
2279 copy
->unchanging
= orig
->unchanging
;
2281 format_ptr
= GET_RTX_FORMAT (GET_CODE (copy
));
2283 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (copy
)); i
++)
2285 switch (*format_ptr
++)
2288 /* Copy this through the wide int field; that's safest. */
2289 X0WINT (copy
, i
) = X0WINT (orig
, i
);
2294 = copy_rtx_and_substitute (XEXP (orig
, i
), map
, for_lhs
);
2298 /* Change any references to old-insns to point to the
2299 corresponding copied insns. */
2300 XEXP (copy
, i
) = map
->insn_map
[INSN_UID (XEXP (orig
, i
))];
2304 XVEC (copy
, i
) = XVEC (orig
, i
);
2305 if (XVEC (orig
, i
) != NULL
&& XVECLEN (orig
, i
) != 0)
2307 XVEC (copy
, i
) = rtvec_alloc (XVECLEN (orig
, i
));
2308 for (j
= 0; j
< XVECLEN (copy
, i
); j
++)
2309 XVECEXP (copy
, i
, j
)
2310 = copy_rtx_and_substitute (XVECEXP (orig
, i
, j
),
2316 XWINT (copy
, i
) = XWINT (orig
, i
);
2320 XINT (copy
, i
) = XINT (orig
, i
);
2324 XSTR (copy
, i
) = XSTR (orig
, i
);
2328 XTREE (copy
, i
) = XTREE (orig
, i
);
2336 if (code
== ASM_OPERANDS
&& map
->orig_asm_operands_vector
== 0)
2338 map
->orig_asm_operands_vector
= ASM_OPERANDS_INPUT_VEC (orig
);
2339 map
->copy_asm_operands_vector
= ASM_OPERANDS_INPUT_VEC (copy
);
2340 map
->copy_asm_constraints_vector
2341 = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy
);
2347 /* Substitute known constant values into INSN, if that is valid. */
2350 try_constants (insn
, map
)
2352 struct inline_remap
*map
;
2358 /* First try just updating addresses, then other things. This is
2359 important when we have something like the store of a constant
2360 into memory and we can update the memory address but the machine
2361 does not support a constant source. */
2362 subst_constants (&PATTERN (insn
), insn
, map
, 1);
2363 apply_change_group ();
2364 subst_constants (&PATTERN (insn
), insn
, map
, 0);
2365 apply_change_group ();
2367 /* Show we don't know the value of anything stored or clobbered. */
2368 note_stores (PATTERN (insn
), mark_stores
, NULL
);
2369 map
->last_pc_value
= 0;
2371 map
->last_cc0_value
= 0;
2374 /* Set up any constant equivalences made in this insn. */
2375 for (i
= 0; i
< map
->num_sets
; i
++)
2377 if (GET_CODE (map
->equiv_sets
[i
].dest
) == REG
)
2379 int regno
= REGNO (map
->equiv_sets
[i
].dest
);
2381 MAYBE_EXTEND_CONST_EQUIV_VARRAY (map
, regno
);
2382 if (VARRAY_CONST_EQUIV (map
->const_equiv_varray
, regno
).rtx
== 0
2383 /* Following clause is a hack to make case work where GNU C++
2384 reassigns a variable to make cse work right. */
2385 || ! rtx_equal_p (VARRAY_CONST_EQUIV (map
->const_equiv_varray
,
2387 map
->equiv_sets
[i
].equiv
))
2388 SET_CONST_EQUIV_DATA (map
, map
->equiv_sets
[i
].dest
,
2389 map
->equiv_sets
[i
].equiv
, map
->const_age
);
2391 else if (map
->equiv_sets
[i
].dest
== pc_rtx
)
2392 map
->last_pc_value
= map
->equiv_sets
[i
].equiv
;
2394 else if (map
->equiv_sets
[i
].dest
== cc0_rtx
)
2395 map
->last_cc0_value
= map
->equiv_sets
[i
].equiv
;
2400 /* Substitute known constants for pseudo regs in the contents of LOC,
2401 which are part of INSN.
2402 If INSN is zero, the substitution should always be done (this is used to
2404 These changes are taken out by try_constants if the result is not valid.
2406 Note that we are more concerned with determining when the result of a SET
2407 is a constant, for further propagation, than actually inserting constants
2408 into insns; cse will do the latter task better.
2410 This function is also used to adjust address of items previously addressed
2411 via the virtual stack variable or virtual incoming arguments registers.
2413 If MEMONLY is nonzero, only make changes inside a MEM. */
2416 subst_constants (loc
, insn
, map
, memonly
)
2419 struct inline_remap
*map
;
2425 const char *format_ptr
;
2426 int num_changes
= num_validated_changes ();
2428 enum machine_mode op0_mode
= MAX_MACHINE_MODE
;
2430 code
= GET_CODE (x
);
2446 validate_change (insn
, loc
, map
->last_cc0_value
, 1);
2452 /* The only thing we can do with a USE or CLOBBER is possibly do
2453 some substitutions in a MEM within it. */
2454 if (GET_CODE (XEXP (x
, 0)) == MEM
)
2455 subst_constants (&XEXP (XEXP (x
, 0), 0), insn
, map
, 0);
2459 /* Substitute for parms and known constants. Don't replace
2460 hard regs used as user variables with constants. */
2463 int regno
= REGNO (x
);
2464 struct const_equiv_data
*p
;
2466 if (! (regno
< FIRST_PSEUDO_REGISTER
&& REG_USERVAR_P (x
))
2467 && (size_t) regno
< VARRAY_SIZE (map
->const_equiv_varray
)
2468 && (p
= &VARRAY_CONST_EQUIV (map
->const_equiv_varray
, regno
),
2470 && p
->age
>= map
->const_age
)
2471 validate_change (insn
, loc
, p
->rtx
, 1);
2476 /* SUBREG applied to something other than a reg
2477 should be treated as ordinary, since that must
2478 be a special hack and we don't know how to treat it specially.
2479 Consider for example mulsidi3 in m68k.md.
2480 Ordinary SUBREG of a REG needs this special treatment. */
2481 if (! memonly
&& GET_CODE (SUBREG_REG (x
)) == REG
)
2483 rtx inner
= SUBREG_REG (x
);
2486 /* We can't call subst_constants on &SUBREG_REG (x) because any
2487 constant or SUBREG wouldn't be valid inside our SUBEG. Instead,
2488 see what is inside, try to form the new SUBREG and see if that is
2489 valid. We handle two cases: extracting a full word in an
2490 integral mode and extracting the low part. */
2491 subst_constants (&inner
, NULL_RTX
, map
, 0);
2492 new = simplify_gen_subreg (GET_MODE (x
), inner
,
2493 GET_MODE (SUBREG_REG (x
)),
2497 validate_change (insn
, loc
, new, 1);
2499 cancel_changes (num_changes
);
2506 subst_constants (&XEXP (x
, 0), insn
, map
, 0);
2508 /* If a memory address got spoiled, change it back. */
2509 if (! memonly
&& insn
!= 0 && num_validated_changes () != num_changes
2510 && ! memory_address_p (GET_MODE (x
), XEXP (x
, 0)))
2511 cancel_changes (num_changes
);
2516 /* Substitute constants in our source, and in any arguments to a
2517 complex (e..g, ZERO_EXTRACT) destination, but not in the destination
2519 rtx
*dest_loc
= &SET_DEST (x
);
2520 rtx dest
= *dest_loc
;
2522 enum machine_mode compare_mode
= VOIDmode
;
2524 /* If SET_SRC is a COMPARE which subst_constants would turn into
2525 COMPARE of 2 VOIDmode constants, note the mode in which comparison
2527 if (GET_CODE (SET_SRC (x
)) == COMPARE
)
2530 if (GET_MODE_CLASS (GET_MODE (src
)) == MODE_CC
2536 compare_mode
= GET_MODE (XEXP (src
, 0));
2537 if (compare_mode
== VOIDmode
)
2538 compare_mode
= GET_MODE (XEXP (src
, 1));
2542 subst_constants (&SET_SRC (x
), insn
, map
, memonly
);
2545 while (GET_CODE (*dest_loc
) == ZERO_EXTRACT
2546 || GET_CODE (*dest_loc
) == SUBREG
2547 || GET_CODE (*dest_loc
) == STRICT_LOW_PART
)
2549 if (GET_CODE (*dest_loc
) == ZERO_EXTRACT
)
2551 subst_constants (&XEXP (*dest_loc
, 1), insn
, map
, memonly
);
2552 subst_constants (&XEXP (*dest_loc
, 2), insn
, map
, memonly
);
2554 dest_loc
= &XEXP (*dest_loc
, 0);
2557 /* Do substitute in the address of a destination in memory. */
2558 if (GET_CODE (*dest_loc
) == MEM
)
2559 subst_constants (&XEXP (*dest_loc
, 0), insn
, map
, 0);
2561 /* Check for the case of DEST a SUBREG, both it and the underlying
2562 register are less than one word, and the SUBREG has the wider mode.
2563 In the case, we are really setting the underlying register to the
2564 source converted to the mode of DEST. So indicate that. */
2565 if (GET_CODE (dest
) == SUBREG
2566 && GET_MODE_SIZE (GET_MODE (dest
)) <= UNITS_PER_WORD
2567 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest
))) <= UNITS_PER_WORD
2568 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest
)))
2569 <= GET_MODE_SIZE (GET_MODE (dest
)))
2570 && (tem
= gen_lowpart_if_possible (GET_MODE (SUBREG_REG (dest
)),
2572 src
= tem
, dest
= SUBREG_REG (dest
);
2574 /* If storing a recognizable value save it for later recording. */
2575 if ((map
->num_sets
< MAX_RECOG_OPERANDS
)
2576 && (CONSTANT_P (src
)
2577 || (GET_CODE (src
) == REG
2578 && (REGNO (src
) == VIRTUAL_INCOMING_ARGS_REGNUM
2579 || REGNO (src
) == VIRTUAL_STACK_VARS_REGNUM
))
2580 || (GET_CODE (src
) == PLUS
2581 && GET_CODE (XEXP (src
, 0)) == REG
2582 && (REGNO (XEXP (src
, 0)) == VIRTUAL_INCOMING_ARGS_REGNUM
2583 || REGNO (XEXP (src
, 0)) == VIRTUAL_STACK_VARS_REGNUM
)
2584 && CONSTANT_P (XEXP (src
, 1)))
2585 || GET_CODE (src
) == COMPARE
2590 && (src
== pc_rtx
|| GET_CODE (src
) == RETURN
2591 || GET_CODE (src
) == LABEL_REF
))))
2593 /* Normally, this copy won't do anything. But, if SRC is a COMPARE
2594 it will cause us to save the COMPARE with any constants
2595 substituted, which is what we want for later. */
2596 rtx src_copy
= copy_rtx (src
);
2597 map
->equiv_sets
[map
->num_sets
].equiv
= src_copy
;
2598 map
->equiv_sets
[map
->num_sets
++].dest
= dest
;
2599 if (compare_mode
!= VOIDmode
2600 && GET_CODE (src
) == COMPARE
2601 && (GET_MODE_CLASS (GET_MODE (src
)) == MODE_CC
2606 && GET_MODE (XEXP (src
, 0)) == VOIDmode
2607 && GET_MODE (XEXP (src
, 1)) == VOIDmode
)
2609 map
->compare_src
= src_copy
;
2610 map
->compare_mode
= compare_mode
;
2620 format_ptr
= GET_RTX_FORMAT (code
);
2622 /* If the first operand is an expression, save its mode for later. */
2623 if (*format_ptr
== 'e')
2624 op0_mode
= GET_MODE (XEXP (x
, 0));
2626 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++)
2628 switch (*format_ptr
++)
2635 subst_constants (&XEXP (x
, i
), insn
, map
, memonly
);
2647 if (XVEC (x
, i
) != NULL
&& XVECLEN (x
, i
) != 0)
2648 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2649 subst_constants (&XVECEXP (x
, i
, j
), insn
, map
, memonly
);
2658 /* If this is a commutative operation, move a constant to the second
2659 operand unless the second operand is already a CONST_INT. */
2661 && (GET_RTX_CLASS (code
) == 'c' || code
== NE
|| code
== EQ
)
2662 && CONSTANT_P (XEXP (x
, 0)) && GET_CODE (XEXP (x
, 1)) != CONST_INT
)
2664 rtx tem
= XEXP (x
, 0);
2665 validate_change (insn
, &XEXP (x
, 0), XEXP (x
, 1), 1);
2666 validate_change (insn
, &XEXP (x
, 1), tem
, 1);
2669 /* Simplify the expression in case we put in some constants. */
2671 switch (GET_RTX_CLASS (code
))
2674 if (op0_mode
== MAX_MACHINE_MODE
)
2676 new = simplify_unary_operation (code
, GET_MODE (x
),
2677 XEXP (x
, 0), op0_mode
);
2682 enum machine_mode op_mode
= GET_MODE (XEXP (x
, 0));
2684 if (op_mode
== VOIDmode
)
2685 op_mode
= GET_MODE (XEXP (x
, 1));
2686 new = simplify_relational_operation (code
, op_mode
,
2687 XEXP (x
, 0), XEXP (x
, 1));
2688 #ifdef FLOAT_STORE_FLAG_VALUE
2689 if (new != 0 && GET_MODE_CLASS (GET_MODE (x
)) == MODE_FLOAT
)
2691 enum machine_mode mode
= GET_MODE (x
);
2692 if (new == const0_rtx
)
2693 new = CONST0_RTX (mode
);
2696 REAL_VALUE_TYPE val
= FLOAT_STORE_FLAG_VALUE (mode
);
2697 new = CONST_DOUBLE_FROM_REAL_VALUE (val
, mode
);
2706 new = simplify_binary_operation (code
, GET_MODE (x
),
2707 XEXP (x
, 0), XEXP (x
, 1));
2712 if (op0_mode
== MAX_MACHINE_MODE
)
2715 if (code
== IF_THEN_ELSE
)
2717 rtx op0
= XEXP (x
, 0);
2719 if (GET_RTX_CLASS (GET_CODE (op0
)) == '<'
2720 && GET_MODE (op0
) == VOIDmode
2721 && ! side_effects_p (op0
)
2722 && XEXP (op0
, 0) == map
->compare_src
2723 && GET_MODE (XEXP (op0
, 1)) == VOIDmode
)
2725 /* We have compare of two VOIDmode constants for which
2726 we recorded the comparison mode. */
2728 simplify_relational_operation (GET_CODE (op0
),
2733 if (temp
== const0_rtx
)
2735 else if (temp
== const1_rtx
)
2740 new = simplify_ternary_operation (code
, GET_MODE (x
), op0_mode
,
2741 XEXP (x
, 0), XEXP (x
, 1),
2747 validate_change (insn
, loc
, new, 1);
2750 /* Show that register modified no longer contain known constants. We are
2751 called from note_stores with parts of the new insn. */
2754 mark_stores (dest
, x
, data
)
2756 rtx x ATTRIBUTE_UNUSED
;
2757 void *data ATTRIBUTE_UNUSED
;
2760 enum machine_mode mode
= VOIDmode
;
2762 /* DEST is always the innermost thing set, except in the case of
2763 SUBREGs of hard registers. */
2765 if (GET_CODE (dest
) == REG
)
2766 regno
= REGNO (dest
), mode
= GET_MODE (dest
);
2767 else if (GET_CODE (dest
) == SUBREG
&& GET_CODE (SUBREG_REG (dest
)) == REG
)
2769 regno
= REGNO (SUBREG_REG (dest
));
2770 if (regno
< FIRST_PSEUDO_REGISTER
)
2771 regno
+= subreg_regno_offset (REGNO (SUBREG_REG (dest
)),
2772 GET_MODE (SUBREG_REG (dest
)),
2775 mode
= GET_MODE (SUBREG_REG (dest
));
2780 unsigned int uregno
= regno
;
2781 unsigned int last_reg
= (uregno
>= FIRST_PSEUDO_REGISTER
? uregno
2782 : uregno
+ HARD_REGNO_NREGS (uregno
, mode
) - 1);
2785 /* Ignore virtual stack var or virtual arg register since those
2786 are handled separately. */
2787 if (uregno
!= VIRTUAL_INCOMING_ARGS_REGNUM
2788 && uregno
!= VIRTUAL_STACK_VARS_REGNUM
)
2789 for (i
= uregno
; i
<= last_reg
; i
++)
2790 if ((size_t) i
< VARRAY_SIZE (global_const_equiv_varray
))
2791 VARRAY_CONST_EQUIV (global_const_equiv_varray
, i
).rtx
= 0;
2795 /* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the
2796 given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so
2797 that it points to the node itself, thus indicating that the node is its
2798 own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for
2799 the given node is NULL, recursively descend the decl/block tree which
2800 it is the root of, and for each other ..._DECL or BLOCK node contained
2801 therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also
2802 still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN
2803 values to point to themselves. */
2806 set_block_origin_self (stmt
)
2809 if (BLOCK_ABSTRACT_ORIGIN (stmt
) == NULL_TREE
)
2811 BLOCK_ABSTRACT_ORIGIN (stmt
) = stmt
;
2816 for (local_decl
= BLOCK_VARS (stmt
);
2817 local_decl
!= NULL_TREE
;
2818 local_decl
= TREE_CHAIN (local_decl
))
2819 set_decl_origin_self (local_decl
); /* Potential recursion. */
2825 for (subblock
= BLOCK_SUBBLOCKS (stmt
);
2826 subblock
!= NULL_TREE
;
2827 subblock
= BLOCK_CHAIN (subblock
))
2828 set_block_origin_self (subblock
); /* Recurse. */
2833 /* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for
2834 the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the
2835 node to so that it points to the node itself, thus indicating that the
2836 node represents its own (abstract) origin. Additionally, if the
2837 DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend
2838 the decl/block tree of which the given node is the root of, and for
2839 each other ..._DECL or BLOCK node contained therein whose
2840 DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL,
2841 set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to
2842 point to themselves. */
2845 set_decl_origin_self (decl
)
2848 if (DECL_ABSTRACT_ORIGIN (decl
) == NULL_TREE
)
2850 DECL_ABSTRACT_ORIGIN (decl
) = decl
;
2851 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2855 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= TREE_CHAIN (arg
))
2856 DECL_ABSTRACT_ORIGIN (arg
) = arg
;
2857 if (DECL_INITIAL (decl
) != NULL_TREE
2858 && DECL_INITIAL (decl
) != error_mark_node
)
2859 set_block_origin_self (DECL_INITIAL (decl
));
2864 /* Given a pointer to some BLOCK node, and a boolean value to set the
2865 "abstract" flags to, set that value into the BLOCK_ABSTRACT flag for
2866 the given block, and for all local decls and all local sub-blocks
2867 (recursively) which are contained therein. */
2870 set_block_abstract_flags (stmt
, setting
)
2877 BLOCK_ABSTRACT (stmt
) = setting
;
2879 for (local_decl
= BLOCK_VARS (stmt
);
2880 local_decl
!= NULL_TREE
;
2881 local_decl
= TREE_CHAIN (local_decl
))
2882 set_decl_abstract_flags (local_decl
, setting
);
2884 for (subblock
= BLOCK_SUBBLOCKS (stmt
);
2885 subblock
!= NULL_TREE
;
2886 subblock
= BLOCK_CHAIN (subblock
))
2887 set_block_abstract_flags (subblock
, setting
);
2890 /* Given a pointer to some ..._DECL node, and a boolean value to set the
2891 "abstract" flags to, set that value into the DECL_ABSTRACT flag for the
2892 given decl, and (in the case where the decl is a FUNCTION_DECL) also
2893 set the abstract flags for all of the parameters, local vars, local
2894 blocks and sub-blocks (recursively) to the same setting. */
2897 set_decl_abstract_flags (decl
, setting
)
2901 DECL_ABSTRACT (decl
) = setting
;
2902 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2906 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= TREE_CHAIN (arg
))
2907 DECL_ABSTRACT (arg
) = setting
;
2908 if (DECL_INITIAL (decl
) != NULL_TREE
2909 && DECL_INITIAL (decl
) != error_mark_node
)
2910 set_block_abstract_flags (DECL_INITIAL (decl
), setting
);
2914 /* Output the assembly language code for the function FNDECL
2915 from its DECL_SAVED_INSNS. Used for inline functions that are output
2916 at end of compilation instead of where they came in the source. */
2919 output_inline_function (fndecl
)
2922 struct function
*old_cfun
= cfun
;
2923 enum debug_info_type old_write_symbols
= write_symbols
;
2924 struct gcc_debug_hooks
*old_debug_hooks
= debug_hooks
;
2925 struct function
*f
= DECL_SAVED_INSNS (fndecl
);
2928 current_function_decl
= fndecl
;
2929 clear_emit_caches ();
2931 set_new_last_label_num (f
->inl_max_label_num
);
2933 /* We're not deferring this any longer. */
2934 DECL_DEFER_OUTPUT (fndecl
) = 0;
2936 /* If requested, suppress debugging information. */
2937 if (f
->no_debugging_symbols
)
2939 write_symbols
= NO_DEBUG
;
2940 debug_hooks
= &do_nothing_debug_hooks
;
2943 /* Do any preparation, such as emitting abstract debug info for the inline
2944 before it gets mangled by optimization. */
2945 (*debug_hooks
->outlining_inline_function
) (fndecl
);
2947 /* Compile this function all the way down to assembly code. As a
2948 side effect this destroys the saved RTL representation, but
2949 that's okay, because we don't need to inline this anymore. */
2950 rest_of_compilation (fndecl
);
2951 DECL_INLINE (fndecl
) = 0;
2954 current_function_decl
= old_cfun
? old_cfun
->decl
: 0;
2955 write_symbols
= old_write_symbols
;
2956 debug_hooks
= old_debug_hooks
;
2960 /* Functions to keep track of the values hard regs had at the start of
2964 has_func_hard_reg_initial_val (fun
, reg
)
2965 struct function
*fun
;
2968 struct initial_value_struct
*ivs
= fun
->hard_reg_initial_vals
;
2974 for (i
= 0; i
< ivs
->num_entries
; i
++)
2975 if (rtx_equal_p (ivs
->entries
[i
].hard_reg
, reg
))
2976 return ivs
->entries
[i
].pseudo
;
2982 get_func_hard_reg_initial_val (fun
, reg
)
2983 struct function
*fun
;
2986 struct initial_value_struct
*ivs
= fun
->hard_reg_initial_vals
;
2987 rtx rv
= has_func_hard_reg_initial_val (fun
, reg
);
2994 fun
->hard_reg_initial_vals
= (void *) xmalloc (sizeof (initial_value_struct
));
2995 ivs
= fun
->hard_reg_initial_vals
;
2996 ivs
->num_entries
= 0;
2997 ivs
->max_entries
= 5;
2998 ivs
->entries
= (initial_value_pair
*) xmalloc (5 * sizeof (initial_value_pair
));
3001 if (ivs
->num_entries
>= ivs
->max_entries
)
3003 ivs
->max_entries
+= 5;
3005 (initial_value_pair
*) xrealloc (ivs
->entries
,
3007 * sizeof (initial_value_pair
));
3010 ivs
->entries
[ivs
->num_entries
].hard_reg
= reg
;
3011 ivs
->entries
[ivs
->num_entries
].pseudo
= gen_reg_rtx (GET_MODE (reg
));
3013 return ivs
->entries
[ivs
->num_entries
++].pseudo
;
3017 get_hard_reg_initial_val (mode
, regno
)
3018 enum machine_mode mode
;
3021 return get_func_hard_reg_initial_val (cfun
, gen_rtx_REG (mode
, regno
));
3025 has_hard_reg_initial_val (mode
, regno
)
3026 enum machine_mode mode
;
3029 return has_func_hard_reg_initial_val (cfun
, gen_rtx_REG (mode
, regno
));
3033 mark_hard_reg_initial_vals (fun
)
3034 struct function
*fun
;
3036 struct initial_value_struct
*ivs
= fun
->hard_reg_initial_vals
;
3042 for (i
= 0; i
< ivs
->num_entries
; i
++)
3044 ggc_mark_rtx (ivs
->entries
[i
].hard_reg
);
3045 ggc_mark_rtx (ivs
->entries
[i
].pseudo
);
3050 setup_initial_hard_reg_value_integration (inl_f
, remap
)
3051 struct function
*inl_f
;
3052 struct inline_remap
*remap
;
3054 struct initial_value_struct
*ivs
= inl_f
->hard_reg_initial_vals
;
3060 for (i
= 0; i
< ivs
->num_entries
; i
++)
3061 remap
->reg_map
[REGNO (ivs
->entries
[i
].pseudo
)]
3062 = get_func_hard_reg_initial_val (cfun
, ivs
->entries
[i
].hard_reg
);
3067 emit_initial_value_sets ()
3069 struct initial_value_struct
*ivs
= cfun
->hard_reg_initial_vals
;
3077 for (i
= 0; i
< ivs
->num_entries
; i
++)
3078 emit_move_insn (ivs
->entries
[i
].pseudo
, ivs
->entries
[i
].hard_reg
);
3082 emit_insns_after (seq
, get_insns ());
3085 /* If the backend knows where to allocate pseudos for hard
3086 register initial values, register these allocations now. */
3088 allocate_initial_values (reg_equiv_memory_loc
)
3089 rtx
*reg_equiv_memory_loc ATTRIBUTE_UNUSED
;
3091 #ifdef ALLOCATE_INITIAL_VALUE
3092 struct initial_value_struct
*ivs
= cfun
->hard_reg_initial_vals
;
3098 for (i
= 0; i
< ivs
->num_entries
; i
++)
3100 int regno
= REGNO (ivs
->entries
[i
].pseudo
);
3101 rtx x
= ALLOCATE_INITIAL_VALUE (ivs
->entries
[i
].hard_reg
);
3103 if (x
== NULL_RTX
|| REG_N_SETS (REGNO (ivs
->entries
[i
].pseudo
)) > 1)
3105 else if (GET_CODE (x
) == MEM
)
3106 reg_equiv_memory_loc
[regno
] = x
;
3107 else if (GET_CODE (x
) == REG
)
3109 reg_renumber
[regno
] = REGNO (x
);
3110 /* Poke the regno right into regno_reg_rtx
3111 so that even fixed regs are accepted. */
3112 REGNO (ivs
->entries
[i
].pseudo
) = REGNO (x
);