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
25 #include "coretypes.h"
34 #include "insn-config.h"
38 #include "integrate.h"
48 #include "langhooks.h"
50 /* Similar, but round to the next highest integer that meets the
52 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
54 /* Default max number of insns a function can have and still be inline.
55 This is overridden on RISC machines. */
56 #ifndef INTEGRATE_THRESHOLD
57 /* Inlining small functions might save more space then not inlining at
58 all. Assume 1 instruction for the call and 1.5 insns per argument. */
59 #define INTEGRATE_THRESHOLD(DECL) \
61 ? (1 + (3 * list_length (DECL_ARGUMENTS (DECL))) / 2) \
62 : (8 * (8 + list_length (DECL_ARGUMENTS (DECL)))))
66 /* Private type used by {get/has}_func_hard_reg_initial_val. */
67 typedef struct initial_value_pair
GTY(()) {
71 typedef struct initial_value_struct
GTY(()) {
74 initial_value_pair
* GTY ((length ("%h.num_entries"))) entries
;
75 } initial_value_struct
;
77 static void setup_initial_hard_reg_value_integration
PARAMS ((struct function
*, struct inline_remap
*));
79 static rtvec initialize_for_inline
PARAMS ((tree
));
80 static void note_modified_parmregs
PARAMS ((rtx
, rtx
, void *));
81 static void integrate_parm_decls
PARAMS ((tree
, struct inline_remap
*,
83 static tree integrate_decl_tree
PARAMS ((tree
,
84 struct inline_remap
*));
85 static void subst_constants
PARAMS ((rtx
*, rtx
,
86 struct inline_remap
*, int));
87 static void set_block_origin_self
PARAMS ((tree
));
88 static void set_block_abstract_flags
PARAMS ((tree
, int));
89 static void process_reg_param
PARAMS ((struct inline_remap
*, rtx
,
91 void set_decl_abstract_flags
PARAMS ((tree
, int));
92 static void mark_stores
PARAMS ((rtx
, rtx
, void *));
93 static void save_parm_insns
PARAMS ((rtx
, rtx
));
94 static void copy_insn_list
PARAMS ((rtx
, struct inline_remap
*,
96 static void copy_insn_notes
PARAMS ((rtx
, struct inline_remap
*,
98 static int compare_blocks
PARAMS ((const PTR
, const PTR
));
99 static int find_block
PARAMS ((const PTR
, const PTR
));
101 /* Used by copy_rtx_and_substitute; this indicates whether the function is
102 called for the purpose of inlining or some other purpose (i.e. loop
103 unrolling). This affects how constant pool references are handled.
104 This variable contains the FUNCTION_DECL for the inlined function. */
105 static struct function
*inlining
= 0;
107 /* Returns the Ith entry in the label_map contained in MAP. If the
108 Ith entry has not yet been set, return a fresh label. This function
109 performs a lazy initialization of label_map, thereby avoiding huge memory
110 explosions when the label_map gets very large. */
113 get_label_from_map (map
, i
)
114 struct inline_remap
*map
;
117 rtx x
= map
->label_map
[i
];
120 x
= map
->label_map
[i
] = gen_label_rtx ();
125 /* Return false if the function FNDECL cannot be inlined on account of its
126 attributes, true otherwise. */
128 function_attribute_inlinable_p (fndecl
)
131 if (targetm
.attribute_table
)
135 for (a
= DECL_ATTRIBUTES (fndecl
); a
; a
= TREE_CHAIN (a
))
137 tree name
= TREE_PURPOSE (a
);
140 for (i
= 0; targetm
.attribute_table
[i
].name
!= NULL
; i
++)
141 if (is_attribute_p (targetm
.attribute_table
[i
].name
, name
))
142 return (*targetm
.function_attribute_inlinable_p
) (fndecl
);
149 /* Zero if the current function (whose FUNCTION_DECL is FNDECL)
150 is safe and reasonable to integrate into other functions.
151 Nonzero means value is a warning msgid with a single %s
152 for the function's name. */
155 function_cannot_inline_p (fndecl
)
159 tree last
= tree_last (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
161 /* For functions marked as inline increase the maximum size to
162 MAX_INLINE_INSNS (-finline-limit-<n>). For regular functions
163 use the limit given by INTEGRATE_THRESHOLD. */
165 int max_insns
= (DECL_INLINE (fndecl
))
167 + 8 * list_length (DECL_ARGUMENTS (fndecl
)))
168 : INTEGRATE_THRESHOLD (fndecl
);
173 if (DECL_UNINLINABLE (fndecl
))
174 return N_("function cannot be inline");
176 /* No inlines with varargs. */
177 if (last
&& TREE_VALUE (last
) != void_type_node
)
178 return N_("varargs function cannot be inline");
180 if (current_function_calls_alloca
)
181 return N_("function using alloca cannot be inline");
183 if (current_function_calls_setjmp
)
184 return N_("function using setjmp cannot be inline");
186 if (current_function_calls_eh_return
)
187 return N_("function uses __builtin_eh_return");
189 if (current_function_contains_functions
)
190 return N_("function with nested functions cannot be inline");
194 N_("function with label addresses used in initializers cannot inline");
196 if (current_function_cannot_inline
)
197 return current_function_cannot_inline
;
199 /* If its not even close, don't even look. */
200 if (get_max_uid () > 3 * max_insns
)
201 return N_("function too large to be inline");
204 /* Don't inline functions which do not specify a function prototype and
205 have BLKmode argument or take the address of a parameter. */
206 for (parms
= DECL_ARGUMENTS (fndecl
); parms
; parms
= TREE_CHAIN (parms
))
208 if (TYPE_MODE (TREE_TYPE (parms
)) == BLKmode
)
209 TREE_ADDRESSABLE (parms
) = 1;
210 if (last
== NULL_TREE
&& TREE_ADDRESSABLE (parms
))
211 return N_("no prototype, and parameter address used; cannot be inline");
215 /* We can't inline functions that return structures
216 the old-fashioned PCC way, copying into a static block. */
217 if (current_function_returns_pcc_struct
)
218 return N_("inline functions not supported for this return value type");
220 /* We can't inline functions that return structures of varying size. */
221 if (TREE_CODE (TREE_TYPE (TREE_TYPE (fndecl
))) != VOID_TYPE
222 && int_size_in_bytes (TREE_TYPE (TREE_TYPE (fndecl
))) < 0)
223 return N_("function with varying-size return value cannot be inline");
225 /* Cannot inline a function with a varying size argument or one that
226 receives a transparent union. */
227 for (parms
= DECL_ARGUMENTS (fndecl
); parms
; parms
= TREE_CHAIN (parms
))
229 if (int_size_in_bytes (TREE_TYPE (parms
)) < 0)
230 return N_("function with varying-size parameter cannot be inline");
231 else if (TREE_CODE (TREE_TYPE (parms
)) == UNION_TYPE
232 && TYPE_TRANSPARENT_UNION (TREE_TYPE (parms
)))
233 return N_("function with transparent unit parameter cannot be inline");
236 if (get_max_uid () > max_insns
)
238 for (ninsns
= 0, insn
= get_first_nonparm_insn ();
239 insn
&& ninsns
< max_insns
;
240 insn
= NEXT_INSN (insn
))
244 if (ninsns
>= max_insns
)
245 return N_("function too large to be inline");
248 /* We will not inline a function which uses computed goto. The addresses of
249 its local labels, which may be tucked into global storage, are of course
250 not constant across instantiations, which causes unexpected behavior. */
251 if (current_function_has_computed_jump
)
252 return N_("function with computed jump cannot inline");
254 /* We cannot inline a nested function that jumps to a nonlocal label. */
255 if (current_function_has_nonlocal_goto
)
256 return N_("function with nonlocal goto cannot be inline");
258 /* We can't inline functions that return a PARALLEL rtx. */
259 if (DECL_RTL_SET_P (DECL_RESULT (fndecl
)))
261 rtx result
= DECL_RTL (DECL_RESULT (fndecl
));
262 if (GET_CODE (result
) == PARALLEL
)
263 return N_("inline functions not supported for this return value type");
266 /* If the function has a target specific attribute attached to it,
267 then we assume that we should not inline it. This can be overriden
268 by the target if it defines TARGET_FUNCTION_ATTRIBUTE_INLINABLE_P. */
269 if (!function_attribute_inlinable_p (fndecl
))
270 return N_("function with target specific attribute(s) cannot be inlined");
275 /* Map pseudo reg number into the PARM_DECL for the parm living in the reg.
276 Zero for a reg that isn't a parm's home.
277 Only reg numbers less than max_parm_reg are mapped here. */
278 static tree
*parmdecl_map
;
280 /* In save_for_inline, nonzero if past the parm-initialization insns. */
281 static int in_nonparm_insns
;
283 /* Subroutine for `save_for_inline'. Performs initialization
284 needed to save FNDECL's insns and info for future inline expansion. */
287 initialize_for_inline (fndecl
)
294 /* Clear out PARMDECL_MAP. It was allocated in the caller's frame. */
295 memset ((char *) parmdecl_map
, 0, max_parm_reg
* sizeof (tree
));
296 arg_vector
= rtvec_alloc (list_length (DECL_ARGUMENTS (fndecl
)));
298 for (parms
= DECL_ARGUMENTS (fndecl
), i
= 0;
300 parms
= TREE_CHAIN (parms
), i
++)
302 rtx p
= DECL_RTL (parms
);
304 /* If we have (mem (addressof (mem ...))), use the inner MEM since
305 otherwise the copy_rtx call below will not unshare the MEM since
306 it shares ADDRESSOF. */
307 if (GET_CODE (p
) == MEM
&& GET_CODE (XEXP (p
, 0)) == ADDRESSOF
308 && GET_CODE (XEXP (XEXP (p
, 0), 0)) == MEM
)
309 p
= XEXP (XEXP (p
, 0), 0);
311 RTVEC_ELT (arg_vector
, i
) = p
;
313 if (GET_CODE (p
) == REG
)
314 parmdecl_map
[REGNO (p
)] = parms
;
315 else if (GET_CODE (p
) == CONCAT
)
317 rtx preal
= gen_realpart (GET_MODE (XEXP (p
, 0)), p
);
318 rtx pimag
= gen_imagpart (GET_MODE (preal
), p
);
320 if (GET_CODE (preal
) == REG
)
321 parmdecl_map
[REGNO (preal
)] = parms
;
322 if (GET_CODE (pimag
) == REG
)
323 parmdecl_map
[REGNO (pimag
)] = parms
;
326 /* This flag is cleared later
327 if the function ever modifies the value of the parm. */
328 TREE_READONLY (parms
) = 1;
334 /* Copy NODE (which must be a DECL, but not a PARM_DECL). The DECL
335 originally was in the FROM_FN, but now it will be in the
339 copy_decl_for_inlining (decl
, from_fn
, to_fn
)
346 /* Copy the declaration. */
347 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
352 /* See if the frontend wants to pass this by invisible reference. */
353 if (TREE_CODE (decl
) == PARM_DECL
354 && DECL_ARG_TYPE (decl
) != TREE_TYPE (decl
)
355 && POINTER_TYPE_P (DECL_ARG_TYPE (decl
))
356 && TREE_TYPE (DECL_ARG_TYPE (decl
)) == TREE_TYPE (decl
))
359 type
= DECL_ARG_TYPE (decl
);
362 type
= TREE_TYPE (decl
);
364 /* For a parameter, we must make an equivalent VAR_DECL, not a
366 copy
= build_decl (VAR_DECL
, DECL_NAME (decl
), type
);
369 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
370 TREE_READONLY (copy
) = TREE_READONLY (decl
);
371 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
375 TREE_ADDRESSABLE (copy
) = 0;
376 TREE_READONLY (copy
) = 1;
377 TREE_THIS_VOLATILE (copy
) = 0;
382 copy
= copy_node (decl
);
383 (*lang_hooks
.dup_lang_specific_decl
) (copy
);
385 /* TREE_ADDRESSABLE isn't used to indicate that a label's
386 address has been taken; it's for internal bookkeeping in
387 expand_goto_internal. */
388 if (TREE_CODE (copy
) == LABEL_DECL
)
389 TREE_ADDRESSABLE (copy
) = 0;
392 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
393 declaration inspired this copy. */
394 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
396 /* The new variable/label has no RTL, yet. */
397 SET_DECL_RTL (copy
, NULL_RTX
);
399 /* These args would always appear unused, if not for this. */
400 TREE_USED (copy
) = 1;
402 /* Set the context for the new declaration. */
403 if (!DECL_CONTEXT (decl
))
404 /* Globals stay global. */
406 else if (DECL_CONTEXT (decl
) != from_fn
)
407 /* Things that weren't in the scope of the function we're inlining
408 from aren't in the scope we're inlining too, either. */
410 else if (TREE_STATIC (decl
))
411 /* Function-scoped static variables should say in the original
415 /* Ordinary automatic local variables are now in the scope of the
417 DECL_CONTEXT (copy
) = to_fn
;
422 /* Make the insns and PARM_DECLs of the current function permanent
423 and record other information in DECL_SAVED_INSNS to allow inlining
424 of this function in subsequent calls.
426 This routine need not copy any insns because we are not going
427 to immediately compile the insns in the insn chain. There
428 are two cases when we would compile the insns for FNDECL:
429 (1) when FNDECL is expanded inline, and (2) when FNDECL needs to
430 be output at the end of other compilation, because somebody took
431 its address. In the first case, the insns of FNDECL are copied
432 as it is expanded inline, so FNDECL's saved insns are not
433 modified. In the second case, FNDECL is used for the last time,
434 so modifying the rtl is not a problem.
436 We don't have to worry about FNDECL being inline expanded by
437 other functions which are written at the end of compilation
438 because flag_no_inline is turned on when we begin writing
439 functions at the end of compilation. */
442 save_for_inline (fndecl
)
447 rtx first_nonparm_insn
;
449 /* Set up PARMDECL_MAP which maps pseudo-reg number to its PARM_DECL.
450 Later we set TREE_READONLY to 0 if the parm is modified inside the fn.
451 Also set up ARG_VECTOR, which holds the unmodified DECL_RTX values
452 for the parms, prior to elimination of virtual registers.
453 These values are needed for substituting parms properly. */
454 if (! flag_no_inline
)
455 parmdecl_map
= (tree
*) xmalloc (max_parm_reg
* sizeof (tree
));
457 /* Make and emit a return-label if we have not already done so. */
459 if (return_label
== 0)
461 return_label
= gen_label_rtx ();
462 emit_label (return_label
);
465 if (! flag_no_inline
)
466 argvec
= initialize_for_inline (fndecl
);
470 /* Delete basic block notes created by early run of find_basic_block.
471 The notes would be later used by find_basic_blocks to reuse the memory
472 for basic_block structures on already freed obstack. */
473 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
474 if (GET_CODE (insn
) == NOTE
&& NOTE_LINE_NUMBER (insn
) == NOTE_INSN_BASIC_BLOCK
)
475 delete_related_insns (insn
);
477 /* If there are insns that copy parms from the stack into pseudo registers,
478 those insns are not copied. `expand_inline_function' must
479 emit the correct code to handle such things. */
482 if (GET_CODE (insn
) != NOTE
)
485 if (! flag_no_inline
)
487 /* Get the insn which signals the end of parameter setup code. */
488 first_nonparm_insn
= get_first_nonparm_insn ();
490 /* Now just scan the chain of insns to see what happens to our
491 PARM_DECLs. If a PARM_DECL is used but never modified, we
492 can substitute its rtl directly when expanding inline (and
493 perform constant folding when its incoming value is
494 constant). Otherwise, we have to copy its value into a new
495 register and track the new register's life. */
496 in_nonparm_insns
= 0;
497 save_parm_insns (insn
, first_nonparm_insn
);
499 cfun
->inl_max_label_num
= max_label_num ();
500 cfun
->inl_last_parm_insn
= cfun
->x_last_parm_insn
;
501 cfun
->original_arg_vector
= argvec
;
503 cfun
->original_decl_initial
= DECL_INITIAL (fndecl
);
504 cfun
->no_debugging_symbols
= (write_symbols
== NO_DEBUG
);
505 DECL_SAVED_INSNS (fndecl
) = cfun
;
508 if (! flag_no_inline
)
512 /* Scan the chain of insns to see what happens to our PARM_DECLs. If a
513 PARM_DECL is used but never modified, we can substitute its rtl directly
514 when expanding inline (and perform constant folding when its incoming
515 value is constant). Otherwise, we have to copy its value into a new
516 register and track the new register's life. */
519 save_parm_insns (insn
, first_nonparm_insn
)
521 rtx first_nonparm_insn
;
523 if (insn
== NULL_RTX
)
526 for (insn
= NEXT_INSN (insn
); insn
; insn
= NEXT_INSN (insn
))
528 if (insn
== first_nonparm_insn
)
529 in_nonparm_insns
= 1;
533 /* Record what interesting things happen to our parameters. */
534 note_stores (PATTERN (insn
), note_modified_parmregs
, NULL
);
536 /* If this is a CALL_PLACEHOLDER insn then we need to look into the
537 three attached sequences: normal call, sibling call and tail
539 if (GET_CODE (insn
) == CALL_INSN
540 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
544 for (i
= 0; i
< 3; i
++)
545 save_parm_insns (XEXP (PATTERN (insn
), i
),
552 /* Note whether a parameter is modified or not. */
555 note_modified_parmregs (reg
, x
, data
)
557 rtx x ATTRIBUTE_UNUSED
;
558 void *data ATTRIBUTE_UNUSED
;
560 if (GET_CODE (reg
) == REG
&& in_nonparm_insns
561 && REGNO (reg
) < max_parm_reg
562 && REGNO (reg
) >= FIRST_PSEUDO_REGISTER
563 && parmdecl_map
[REGNO (reg
)] != 0)
564 TREE_READONLY (parmdecl_map
[REGNO (reg
)]) = 0;
567 /* Unfortunately, we need a global copy of const_equiv map for communication
568 with a function called from note_stores. Be *very* careful that this
569 is used properly in the presence of recursion. */
571 varray_type global_const_equiv_varray
;
573 #define FIXED_BASE_PLUS_P(X) \
574 (GET_CODE (X) == PLUS && GET_CODE (XEXP (X, 1)) == CONST_INT \
575 && GET_CODE (XEXP (X, 0)) == REG \
576 && REGNO (XEXP (X, 0)) >= FIRST_VIRTUAL_REGISTER \
577 && REGNO (XEXP (X, 0)) <= LAST_VIRTUAL_REGISTER)
579 /* Called to set up a mapping for the case where a parameter is in a
580 register. If it is read-only and our argument is a constant, set up the
581 constant equivalence.
583 If LOC is REG_USERVAR_P, the usual case, COPY must also have that flag set
586 Also, don't allow hard registers here; they might not be valid when
587 substituted into insns. */
589 process_reg_param (map
, loc
, copy
)
590 struct inline_remap
*map
;
593 if ((GET_CODE (copy
) != REG
&& GET_CODE (copy
) != SUBREG
)
594 || (GET_CODE (copy
) == REG
&& REG_USERVAR_P (loc
)
595 && ! REG_USERVAR_P (copy
))
596 || (GET_CODE (copy
) == REG
597 && REGNO (copy
) < FIRST_PSEUDO_REGISTER
))
599 rtx temp
= copy_to_mode_reg (GET_MODE (loc
), copy
);
600 REG_USERVAR_P (temp
) = REG_USERVAR_P (loc
);
601 if (CONSTANT_P (copy
) || FIXED_BASE_PLUS_P (copy
))
602 SET_CONST_EQUIV_DATA (map
, temp
, copy
, CONST_AGE_PARM
);
605 map
->reg_map
[REGNO (loc
)] = copy
;
608 /* Compare two BLOCKs for qsort. The key we sort on is the
609 BLOCK_ABSTRACT_ORIGIN of the blocks. We cannot just subtract the
610 two pointers, because it may overflow sizeof(int). */
613 compare_blocks (v1
, v2
)
617 tree b1
= *((const tree
*) v1
);
618 tree b2
= *((const tree
*) v2
);
619 char *p1
= (char *) BLOCK_ABSTRACT_ORIGIN (b1
);
620 char *p2
= (char *) BLOCK_ABSTRACT_ORIGIN (b2
);
624 return p1
< p2
? -1 : 1;
627 /* Compare two BLOCKs for bsearch. The first pointer corresponds to
628 an original block; the second to a remapped equivalent. */
635 const union tree_node
*b1
= (const union tree_node
*) v1
;
636 tree b2
= *((const tree
*) v2
);
637 char *p1
= (char *) b1
;
638 char *p2
= (char *) BLOCK_ABSTRACT_ORIGIN (b2
);
642 return p1
< p2
? -1 : 1;
645 /* Integrate the procedure defined by FNDECL. Note that this function
646 may wind up calling itself. Since the static variables are not
647 reentrant, we do not assign them until after the possibility
648 of recursion is eliminated.
650 If IGNORE is nonzero, do not produce a value.
651 Otherwise store the value in TARGET if it is nonzero and that is convenient.
654 (rtx)-1 if we could not substitute the function
655 0 if we substituted it and it does not produce a value
656 else an rtx for where the value is stored. */
659 expand_inline_function (fndecl
, parms
, target
, ignore
, type
,
660 structure_value_addr
)
665 rtx structure_value_addr
;
667 struct function
*inlining_previous
;
668 struct function
*inl_f
= DECL_SAVED_INSNS (fndecl
);
669 tree formal
, actual
, block
;
670 rtx parm_insns
= inl_f
->emit
->x_first_insn
;
671 rtx insns
= (inl_f
->inl_last_parm_insn
672 ? NEXT_INSN (inl_f
->inl_last_parm_insn
)
678 int min_labelno
= inl_f
->emit
->x_first_label_num
;
679 int max_labelno
= inl_f
->inl_max_label_num
;
684 struct inline_remap
*map
= 0;
685 rtvec arg_vector
= inl_f
->original_arg_vector
;
686 rtx static_chain_value
= 0;
688 int eh_region_offset
;
690 /* The pointer used to track the true location of the memory used
691 for MAP->LABEL_MAP. */
692 rtx
*real_label_map
= 0;
694 /* Allow for equivalences of the pseudos we make for virtual fp and ap. */
695 max_regno
= inl_f
->emit
->x_reg_rtx_no
+ 3;
696 if (max_regno
< FIRST_PSEUDO_REGISTER
)
699 /* Pull out the decl for the function definition; fndecl may be a
700 local declaration, which would break DECL_ABSTRACT_ORIGIN. */
701 fndecl
= inl_f
->decl
;
703 nargs
= list_length (DECL_ARGUMENTS (fndecl
));
705 if (cfun
->preferred_stack_boundary
< inl_f
->preferred_stack_boundary
)
706 cfun
->preferred_stack_boundary
= inl_f
->preferred_stack_boundary
;
708 /* Check that the parms type match and that sufficient arguments were
709 passed. Since the appropriate conversions or default promotions have
710 already been applied, the machine modes should match exactly. */
712 for (formal
= DECL_ARGUMENTS (fndecl
), actual
= parms
;
714 formal
= TREE_CHAIN (formal
), actual
= TREE_CHAIN (actual
))
717 enum machine_mode mode
;
720 return (rtx
) (size_t) -1;
722 arg
= TREE_VALUE (actual
);
723 mode
= TYPE_MODE (DECL_ARG_TYPE (formal
));
725 if (arg
== error_mark_node
726 || mode
!= TYPE_MODE (TREE_TYPE (arg
))
727 /* If they are block mode, the types should match exactly.
728 They don't match exactly if TREE_TYPE (FORMAL) == ERROR_MARK_NODE,
729 which could happen if the parameter has incomplete type. */
731 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg
))
732 != TYPE_MAIN_VARIANT (TREE_TYPE (formal
)))))
733 return (rtx
) (size_t) -1;
736 /* Extra arguments are valid, but will be ignored below, so we must
737 evaluate them here for side-effects. */
738 for (; actual
; actual
= TREE_CHAIN (actual
))
739 expand_expr (TREE_VALUE (actual
), const0_rtx
,
740 TYPE_MODE (TREE_TYPE (TREE_VALUE (actual
))), 0);
742 /* Expand the function arguments. Do this first so that any
743 new registers get created before we allocate the maps. */
745 arg_vals
= (rtx
*) xmalloc (nargs
* sizeof (rtx
));
746 arg_trees
= (tree
*) xmalloc (nargs
* sizeof (tree
));
748 for (formal
= DECL_ARGUMENTS (fndecl
), actual
= parms
, i
= 0;
750 formal
= TREE_CHAIN (formal
), actual
= TREE_CHAIN (actual
), i
++)
752 /* Actual parameter, converted to the type of the argument within the
754 tree arg
= convert (TREE_TYPE (formal
), TREE_VALUE (actual
));
755 /* Mode of the variable used within the function. */
756 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (formal
));
760 loc
= RTVEC_ELT (arg_vector
, i
);
762 /* If this is an object passed by invisible reference, we copy the
763 object into a stack slot and save its address. If this will go
764 into memory, we do nothing now. Otherwise, we just expand the
766 if (GET_CODE (loc
) == MEM
&& GET_CODE (XEXP (loc
, 0)) == REG
767 && REGNO (XEXP (loc
, 0)) > LAST_VIRTUAL_REGISTER
)
769 rtx stack_slot
= assign_temp (TREE_TYPE (arg
), 1, 1, 1);
771 store_expr (arg
, stack_slot
, 0);
772 arg_vals
[i
] = XEXP (stack_slot
, 0);
775 else if (GET_CODE (loc
) != MEM
)
777 if (GET_MODE (loc
) != TYPE_MODE (TREE_TYPE (arg
)))
779 int unsignedp
= TREE_UNSIGNED (TREE_TYPE (formal
));
780 enum machine_mode pmode
= TYPE_MODE (TREE_TYPE (formal
));
782 pmode
= promote_mode (TREE_TYPE (formal
), pmode
,
785 if (GET_MODE (loc
) != pmode
)
788 /* The mode if LOC and ARG can differ if LOC was a variable
789 that had its mode promoted via PROMOTED_MODE. */
790 arg_vals
[i
] = convert_modes (pmode
,
791 TYPE_MODE (TREE_TYPE (arg
)),
792 expand_expr (arg
, NULL_RTX
, mode
,
797 arg_vals
[i
] = expand_expr (arg
, NULL_RTX
, mode
, EXPAND_SUM
);
803 && (! TREE_READONLY (formal
)
804 /* If the parameter is not read-only, copy our argument through
805 a register. Also, we cannot use ARG_VALS[I] if it overlaps
806 TARGET in any way. In the inline function, they will likely
807 be two different pseudos, and `safe_from_p' will make all
808 sorts of smart assumptions about their not conflicting.
809 But if ARG_VALS[I] overlaps TARGET, these assumptions are
810 wrong, so put ARG_VALS[I] into a fresh register.
811 Don't worry about invisible references, since their stack
812 temps will never overlap the target. */
815 && (GET_CODE (arg_vals
[i
]) == REG
816 || GET_CODE (arg_vals
[i
]) == SUBREG
817 || GET_CODE (arg_vals
[i
]) == MEM
)
818 && reg_overlap_mentioned_p (arg_vals
[i
], target
))
819 /* ??? We must always copy a SUBREG into a REG, because it might
820 get substituted into an address, and not all ports correctly
821 handle SUBREGs in addresses. */
822 || (GET_CODE (arg_vals
[i
]) == SUBREG
)))
823 arg_vals
[i
] = copy_to_mode_reg (GET_MODE (loc
), arg_vals
[i
]);
825 if (arg_vals
[i
] != 0 && GET_CODE (arg_vals
[i
]) == REG
826 && POINTER_TYPE_P (TREE_TYPE (formal
)))
827 mark_reg_pointer (arg_vals
[i
],
828 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (formal
))));
831 /* Allocate the structures we use to remap things. */
833 map
= (struct inline_remap
*) xcalloc (1, sizeof (struct inline_remap
));
834 map
->fndecl
= fndecl
;
836 VARRAY_TREE_INIT (map
->block_map
, 10, "block_map");
837 map
->reg_map
= (rtx
*) xcalloc (max_regno
, sizeof (rtx
));
839 /* We used to use alloca here, but the size of what it would try to
840 allocate would occasionally cause it to exceed the stack limit and
841 cause unpredictable core dumps. */
843 = (rtx
*) xmalloc ((max_labelno
) * sizeof (rtx
));
844 map
->label_map
= real_label_map
;
845 map
->local_return_label
= NULL_RTX
;
847 inl_max_uid
= (inl_f
->emit
->x_cur_insn_uid
+ 1);
848 map
->insn_map
= (rtx
*) xcalloc (inl_max_uid
, sizeof (rtx
));
850 map
->max_insnno
= inl_max_uid
;
852 map
->integrating
= 1;
853 map
->compare_src
= NULL_RTX
;
854 map
->compare_mode
= VOIDmode
;
856 /* const_equiv_varray maps pseudos in our routine to constants, so
857 it needs to be large enough for all our pseudos. This is the
858 number we are currently using plus the number in the called
859 routine, plus 15 for each arg, five to compute the virtual frame
860 pointer, and five for the return value. This should be enough
861 for most cases. We do not reference entries outside the range of
864 ??? These numbers are quite arbitrary and were obtained by
865 experimentation. At some point, we should try to allocate the
866 table after all the parameters are set up so we can more accurately
867 estimate the number of pseudos we will need. */
869 VARRAY_CONST_EQUIV_INIT (map
->const_equiv_varray
,
871 + (max_regno
- FIRST_PSEUDO_REGISTER
)
874 "expand_inline_function");
877 /* Record the current insn in case we have to set up pointers to frame
878 and argument memory blocks. If there are no insns yet, add a dummy
879 insn that can be used as an insertion point. */
880 map
->insns_at_start
= get_last_insn ();
881 if (map
->insns_at_start
== 0)
882 map
->insns_at_start
= emit_note (NULL
, NOTE_INSN_DELETED
);
884 map
->regno_pointer_align
= inl_f
->emit
->regno_pointer_align
;
885 map
->x_regno_reg_rtx
= inl_f
->emit
->x_regno_reg_rtx
;
887 /* Update the outgoing argument size to allow for those in the inlined
889 if (inl_f
->outgoing_args_size
> current_function_outgoing_args_size
)
890 current_function_outgoing_args_size
= inl_f
->outgoing_args_size
;
892 /* If the inline function needs to make PIC references, that means
893 that this function's PIC offset table must be used. */
894 if (inl_f
->uses_pic_offset_table
)
895 current_function_uses_pic_offset_table
= 1;
897 /* If this function needs a context, set it up. */
898 if (inl_f
->needs_context
)
899 static_chain_value
= lookup_static_chain (fndecl
);
901 if (GET_CODE (parm_insns
) == NOTE
902 && NOTE_LINE_NUMBER (parm_insns
) > 0)
904 rtx note
= emit_note (NOTE_SOURCE_FILE (parm_insns
),
905 NOTE_LINE_NUMBER (parm_insns
));
907 RTX_INTEGRATED_P (note
) = 1;
910 /* Process each argument. For each, set up things so that the function's
911 reference to the argument will refer to the argument being passed.
912 We only replace REG with REG here. Any simplifications are done
915 We make two passes: In the first, we deal with parameters that will
916 be placed into registers, since we need to ensure that the allocated
917 register number fits in const_equiv_map. Then we store all non-register
918 parameters into their memory location. */
920 /* Don't try to free temp stack slots here, because we may put one of the
921 parameters into a temp stack slot. */
923 for (i
= 0; i
< nargs
; i
++)
925 rtx copy
= arg_vals
[i
];
927 loc
= RTVEC_ELT (arg_vector
, i
);
929 /* There are three cases, each handled separately. */
930 if (GET_CODE (loc
) == MEM
&& GET_CODE (XEXP (loc
, 0)) == REG
931 && REGNO (XEXP (loc
, 0)) > LAST_VIRTUAL_REGISTER
)
933 /* This must be an object passed by invisible reference (it could
934 also be a variable-sized object, but we forbid inlining functions
935 with variable-sized arguments). COPY is the address of the
936 actual value (this computation will cause it to be copied). We
937 map that address for the register, noting the actual address as
938 an equivalent in case it can be substituted into the insns. */
940 if (GET_CODE (copy
) != REG
)
942 temp
= copy_addr_to_reg (copy
);
943 if (CONSTANT_P (copy
) || FIXED_BASE_PLUS_P (copy
))
944 SET_CONST_EQUIV_DATA (map
, temp
, copy
, CONST_AGE_PARM
);
947 map
->reg_map
[REGNO (XEXP (loc
, 0))] = copy
;
949 else if (GET_CODE (loc
) == MEM
)
951 /* This is the case of a parameter that lives in memory. It
952 will live in the block we allocate in the called routine's
953 frame that simulates the incoming argument area. Do nothing
954 with the parameter now; we will call store_expr later. In
955 this case, however, we must ensure that the virtual stack and
956 incoming arg rtx values are expanded now so that we can be
957 sure we have enough slots in the const equiv map since the
958 store_expr call can easily blow the size estimate. */
959 if (DECL_SAVED_INSNS (fndecl
)->args_size
!= 0)
960 copy_rtx_and_substitute (virtual_incoming_args_rtx
, map
, 0);
962 else if (GET_CODE (loc
) == REG
)
963 process_reg_param (map
, loc
, copy
);
964 else if (GET_CODE (loc
) == CONCAT
)
966 rtx locreal
= gen_realpart (GET_MODE (XEXP (loc
, 0)), loc
);
967 rtx locimag
= gen_imagpart (GET_MODE (XEXP (loc
, 0)), loc
);
968 rtx copyreal
= gen_realpart (GET_MODE (locreal
), copy
);
969 rtx copyimag
= gen_imagpart (GET_MODE (locimag
), copy
);
971 process_reg_param (map
, locreal
, copyreal
);
972 process_reg_param (map
, locimag
, copyimag
);
978 /* Tell copy_rtx_and_substitute to handle constant pool SYMBOL_REFs
979 specially. This function can be called recursively, so we need to
980 save the previous value. */
981 inlining_previous
= inlining
;
984 /* Now do the parameters that will be placed in memory. */
986 for (formal
= DECL_ARGUMENTS (fndecl
), i
= 0;
987 formal
; formal
= TREE_CHAIN (formal
), i
++)
989 loc
= RTVEC_ELT (arg_vector
, i
);
991 if (GET_CODE (loc
) == MEM
992 /* Exclude case handled above. */
993 && ! (GET_CODE (XEXP (loc
, 0)) == REG
994 && REGNO (XEXP (loc
, 0)) > LAST_VIRTUAL_REGISTER
))
996 rtx note
= emit_note (DECL_SOURCE_FILE (formal
),
997 DECL_SOURCE_LINE (formal
));
999 RTX_INTEGRATED_P (note
) = 1;
1001 /* Compute the address in the area we reserved and store the
1003 temp
= copy_rtx_and_substitute (loc
, map
, 1);
1004 subst_constants (&temp
, NULL_RTX
, map
, 1);
1005 apply_change_group ();
1006 if (! memory_address_p (GET_MODE (temp
), XEXP (temp
, 0)))
1007 temp
= change_address (temp
, VOIDmode
, XEXP (temp
, 0));
1008 store_expr (arg_trees
[i
], temp
, 0);
1012 /* Deal with the places that the function puts its result.
1013 We are driven by what is placed into DECL_RESULT.
1015 Initially, we assume that we don't have anything special handling for
1016 REG_FUNCTION_RETURN_VALUE_P. */
1018 map
->inline_target
= 0;
1019 loc
= (DECL_RTL_SET_P (DECL_RESULT (fndecl
))
1020 ? DECL_RTL (DECL_RESULT (fndecl
)) : NULL_RTX
);
1022 if (TYPE_MODE (type
) == VOIDmode
)
1023 /* There is no return value to worry about. */
1025 else if (GET_CODE (loc
) == MEM
)
1027 if (GET_CODE (XEXP (loc
, 0)) == ADDRESSOF
)
1029 temp
= copy_rtx_and_substitute (loc
, map
, 1);
1030 subst_constants (&temp
, NULL_RTX
, map
, 1);
1031 apply_change_group ();
1036 if (! structure_value_addr
1037 || ! aggregate_value_p (DECL_RESULT (fndecl
)))
1040 /* Pass the function the address in which to return a structure
1041 value. Note that a constructor can cause someone to call us
1042 with STRUCTURE_VALUE_ADDR, but the initialization takes place
1043 via the first parameter, rather than the struct return address.
1045 We have two cases: If the address is a simple register
1046 indirect, use the mapping mechanism to point that register to
1047 our structure return address. Otherwise, store the structure
1048 return value into the place that it will be referenced from. */
1050 if (GET_CODE (XEXP (loc
, 0)) == REG
)
1052 temp
= force_operand (structure_value_addr
, NULL_RTX
);
1053 temp
= force_reg (Pmode
, temp
);
1054 /* A virtual register might be invalid in an insn, because
1055 it can cause trouble in reload. Since we don't have access
1056 to the expanders at map translation time, make sure we have
1057 a proper register now.
1058 If a virtual register is actually valid, cse or combine
1059 can put it into the mapped insns. */
1060 if (REGNO (temp
) >= FIRST_VIRTUAL_REGISTER
1061 && REGNO (temp
) <= LAST_VIRTUAL_REGISTER
)
1062 temp
= copy_to_mode_reg (Pmode
, temp
);
1063 map
->reg_map
[REGNO (XEXP (loc
, 0))] = temp
;
1065 if (CONSTANT_P (structure_value_addr
)
1066 || GET_CODE (structure_value_addr
) == ADDRESSOF
1067 || (GET_CODE (structure_value_addr
) == PLUS
1068 && (XEXP (structure_value_addr
, 0)
1069 == virtual_stack_vars_rtx
)
1070 && (GET_CODE (XEXP (structure_value_addr
, 1))
1073 SET_CONST_EQUIV_DATA (map
, temp
, structure_value_addr
,
1079 temp
= copy_rtx_and_substitute (loc
, map
, 1);
1080 subst_constants (&temp
, NULL_RTX
, map
, 0);
1081 apply_change_group ();
1082 emit_move_insn (temp
, structure_value_addr
);
1087 /* We will ignore the result value, so don't look at its structure.
1088 Note that preparations for an aggregate return value
1089 do need to be made (above) even if it will be ignored. */
1091 else if (GET_CODE (loc
) == REG
)
1093 /* The function returns an object in a register and we use the return
1094 value. Set up our target for remapping. */
1096 /* Machine mode function was declared to return. */
1097 enum machine_mode departing_mode
= TYPE_MODE (type
);
1098 /* (Possibly wider) machine mode it actually computes
1099 (for the sake of callers that fail to declare it right).
1100 We have to use the mode of the result's RTL, rather than
1101 its type, since expand_function_start may have promoted it. */
1102 enum machine_mode arriving_mode
1103 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl
)));
1106 /* Don't use MEMs as direct targets because on some machines
1107 substituting a MEM for a REG makes invalid insns.
1108 Let the combiner substitute the MEM if that is valid. */
1109 if (target
== 0 || GET_CODE (target
) != REG
1110 || GET_MODE (target
) != departing_mode
)
1112 /* Don't make BLKmode registers. If this looks like
1113 a BLKmode object being returned in a register, get
1114 the mode from that, otherwise abort. */
1115 if (departing_mode
== BLKmode
)
1117 if (REG
== GET_CODE (DECL_RTL (DECL_RESULT (fndecl
))))
1119 departing_mode
= GET_MODE (DECL_RTL (DECL_RESULT (fndecl
)));
1120 arriving_mode
= departing_mode
;
1126 target
= gen_reg_rtx (departing_mode
);
1129 /* If function's value was promoted before return,
1130 avoid machine mode mismatch when we substitute INLINE_TARGET.
1131 But TARGET is what we will return to the caller. */
1132 if (arriving_mode
!= departing_mode
)
1134 /* Avoid creating a paradoxical subreg wider than
1135 BITS_PER_WORD, since that is illegal. */
1136 if (GET_MODE_BITSIZE (arriving_mode
) > BITS_PER_WORD
)
1138 if (!TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (departing_mode
),
1139 GET_MODE_BITSIZE (arriving_mode
)))
1140 /* Maybe could be handled by using convert_move () ? */
1142 reg_to_map
= gen_reg_rtx (arriving_mode
);
1143 target
= gen_lowpart (departing_mode
, reg_to_map
);
1146 reg_to_map
= gen_rtx_SUBREG (arriving_mode
, target
, 0);
1149 reg_to_map
= target
;
1151 /* Usually, the result value is the machine's return register.
1152 Sometimes it may be a pseudo. Handle both cases. */
1153 if (REG_FUNCTION_VALUE_P (loc
))
1154 map
->inline_target
= reg_to_map
;
1156 map
->reg_map
[REGNO (loc
)] = reg_to_map
;
1158 else if (GET_CODE (loc
) == CONCAT
)
1160 enum machine_mode departing_mode
= TYPE_MODE (type
);
1161 enum machine_mode arriving_mode
1162 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl
)));
1164 if (departing_mode
!= arriving_mode
)
1166 if (GET_CODE (XEXP (loc
, 0)) != REG
1167 || GET_CODE (XEXP (loc
, 1)) != REG
)
1170 /* Don't use MEMs as direct targets because on some machines
1171 substituting a MEM for a REG makes invalid insns.
1172 Let the combiner substitute the MEM if that is valid. */
1173 if (target
== 0 || GET_CODE (target
) != REG
1174 || GET_MODE (target
) != departing_mode
)
1175 target
= gen_reg_rtx (departing_mode
);
1177 if (GET_CODE (target
) != CONCAT
)
1180 map
->reg_map
[REGNO (XEXP (loc
, 0))] = XEXP (target
, 0);
1181 map
->reg_map
[REGNO (XEXP (loc
, 1))] = XEXP (target
, 1);
1186 /* Remap the exception handler data pointer from one to the other. */
1187 temp
= get_exception_pointer (inl_f
);
1189 map
->reg_map
[REGNO (temp
)] = get_exception_pointer (cfun
);
1191 /* Initialize label_map. get_label_from_map will actually make
1193 memset ((char *) &map
->label_map
[min_labelno
], 0,
1194 (max_labelno
- min_labelno
) * sizeof (rtx
));
1196 /* Make copies of the decls of the symbols in the inline function, so that
1197 the copies of the variables get declared in the current function. Set
1198 up things so that lookup_static_chain knows that to interpret registers
1199 in SAVE_EXPRs for TYPE_SIZEs as local. */
1200 inline_function_decl
= fndecl
;
1201 integrate_parm_decls (DECL_ARGUMENTS (fndecl
), map
, arg_vector
);
1202 block
= integrate_decl_tree (inl_f
->original_decl_initial
, map
);
1203 BLOCK_ABSTRACT_ORIGIN (block
) = DECL_ORIGIN (fndecl
);
1204 inline_function_decl
= 0;
1206 /* Make a fresh binding contour that we can easily remove. Do this after
1207 expanding our arguments so cleanups are properly scoped. */
1208 expand_start_bindings_and_block (0, block
);
1210 /* Sort the block-map so that it will be easy to find remapped
1212 qsort (&VARRAY_TREE (map
->block_map
, 0),
1213 map
->block_map
->elements_used
,
1217 /* Perform postincrements before actually calling the function. */
1220 /* Clean up stack so that variables might have smaller offsets. */
1221 do_pending_stack_adjust ();
1223 /* Save a copy of the location of const_equiv_varray for
1224 mark_stores, called via note_stores. */
1225 global_const_equiv_varray
= map
->const_equiv_varray
;
1227 /* If the called function does an alloca, save and restore the
1228 stack pointer around the call. This saves stack space, but
1229 also is required if this inline is being done between two
1231 if (inl_f
->calls_alloca
)
1232 emit_stack_save (SAVE_BLOCK
, &stack_save
, NULL_RTX
);
1234 /* Map pseudos used for initial hard reg values. */
1235 setup_initial_hard_reg_value_integration (inl_f
, map
);
1237 /* Now copy the insns one by one. */
1238 copy_insn_list (insns
, map
, static_chain_value
);
1240 /* Duplicate the EH regions. This will create an offset from the
1241 region numbers in the function we're inlining to the region
1242 numbers in the calling function. This must wait until after
1243 copy_insn_list, as we need the insn map to be complete. */
1244 eh_region_offset
= duplicate_eh_regions (inl_f
, map
);
1246 /* Now copy the REG_NOTES for those insns. */
1247 copy_insn_notes (insns
, map
, eh_region_offset
);
1249 /* If the insn sequence required one, emit the return label. */
1250 if (map
->local_return_label
)
1251 emit_label (map
->local_return_label
);
1253 /* Restore the stack pointer if we saved it above. */
1254 if (inl_f
->calls_alloca
)
1255 emit_stack_restore (SAVE_BLOCK
, stack_save
, NULL_RTX
);
1257 if (! cfun
->x_whole_function_mode_p
)
1258 /* In statement-at-a-time mode, we just tell the front-end to add
1259 this block to the list of blocks at this binding level. We
1260 can't do it the way it's done for function-at-a-time mode the
1261 superblocks have not been created yet. */
1262 (*lang_hooks
.decls
.insert_block
) (block
);
1266 = BLOCK_CHAIN (DECL_INITIAL (current_function_decl
));
1267 BLOCK_CHAIN (DECL_INITIAL (current_function_decl
)) = block
;
1270 /* End the scope containing the copied formal parameter variables
1271 and copied LABEL_DECLs. We pass NULL_TREE for the variables list
1272 here so that expand_end_bindings will not check for unused
1273 variables. That's already been checked for when the inlined
1274 function was defined. */
1275 expand_end_bindings (NULL_TREE
, 1, 1);
1277 /* Must mark the line number note after inlined functions as a repeat, so
1278 that the test coverage code can avoid counting the call twice. This
1279 just tells the code to ignore the immediately following line note, since
1280 there already exists a copy of this note before the expanded inline call.
1281 This line number note is still needed for debugging though, so we can't
1283 if (flag_test_coverage
)
1284 emit_note (0, NOTE_INSN_REPEATED_LINE_NUMBER
);
1286 emit_line_note (input_filename
, lineno
);
1288 /* If the function returns a BLKmode object in a register, copy it
1289 out of the temp register into a BLKmode memory object. */
1291 && TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl
))) == BLKmode
1292 && ! aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl
))))
1293 target
= copy_blkmode_from_reg (0, target
, TREE_TYPE (TREE_TYPE (fndecl
)));
1295 if (structure_value_addr
)
1297 target
= gen_rtx_MEM (TYPE_MODE (type
),
1298 memory_address (TYPE_MODE (type
),
1299 structure_value_addr
));
1300 set_mem_attributes (target
, type
, 1);
1303 /* Make sure we free the things we explicitly allocated with xmalloc. */
1305 free (real_label_map
);
1306 VARRAY_FREE (map
->const_equiv_varray
);
1307 free (map
->reg_map
);
1308 free (map
->insn_map
);
1313 inlining
= inlining_previous
;
1318 /* Make copies of each insn in the given list using the mapping
1319 computed in expand_inline_function. This function may call itself for
1320 insns containing sequences.
1322 Copying is done in two passes, first the insns and then their REG_NOTES.
1324 If static_chain_value is nonzero, it represents the context-pointer
1325 register for the function. */
1328 copy_insn_list (insns
, map
, static_chain_value
)
1330 struct inline_remap
*map
;
1331 rtx static_chain_value
;
1339 rtx static_chain_mem
= 0;
1341 /* Copy the insns one by one. Do this in two passes, first the insns and
1342 then their REG_NOTES. */
1344 /* This loop is very similar to the loop in copy_loop_body in unroll.c. */
1346 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
1348 rtx copy
, pattern
, set
;
1350 map
->orig_asm_operands_vector
= 0;
1352 switch (GET_CODE (insn
))
1355 pattern
= PATTERN (insn
);
1356 set
= single_set (insn
);
1358 if (GET_CODE (pattern
) == USE
1359 && GET_CODE (XEXP (pattern
, 0)) == REG
1360 && REG_FUNCTION_VALUE_P (XEXP (pattern
, 0)))
1361 /* The (USE (REG n)) at return from the function should
1362 be ignored since we are changing (REG n) into
1366 /* Ignore setting a function value that we don't want to use. */
1367 if (map
->inline_target
== 0
1369 && GET_CODE (SET_DEST (set
)) == REG
1370 && REG_FUNCTION_VALUE_P (SET_DEST (set
)))
1372 if (volatile_refs_p (SET_SRC (set
)))
1376 /* If we must not delete the source,
1377 load it into a new temporary. */
1378 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1380 new_set
= single_set (copy
);
1385 = gen_reg_rtx (GET_MODE (SET_DEST (new_set
)));
1387 /* If the source and destination are the same and it
1388 has a note on it, keep the insn. */
1389 else if (rtx_equal_p (SET_DEST (set
), SET_SRC (set
))
1390 && REG_NOTES (insn
) != 0)
1391 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1396 /* Similarly if an ignored return value is clobbered. */
1397 else if (map
->inline_target
== 0
1398 && GET_CODE (pattern
) == CLOBBER
1399 && GET_CODE (XEXP (pattern
, 0)) == REG
1400 && REG_FUNCTION_VALUE_P (XEXP (pattern
, 0)))
1403 /* Look for the address of the static chain slot. The
1404 rtx_equal_p comparisons against the
1405 static_chain_incoming_rtx below may fail if the static
1406 chain is in memory and the address specified is not
1407 "legitimate". This happens on Xtensa where the static
1408 chain is at a negative offset from argp and where only
1409 positive offsets are legitimate. When the RTL is
1410 generated, the address is "legitimized" by copying it
1411 into a register, causing the rtx_equal_p comparisons to
1412 fail. This workaround looks for code that sets a
1413 register to the address of the static chain. Subsequent
1414 memory references via that register can then be
1415 identified as static chain references. We assume that
1416 the register is only assigned once, and that the static
1417 chain address is only live in one register at a time. */
1419 else if (static_chain_value
!= 0
1421 && GET_CODE (static_chain_incoming_rtx
) == MEM
1422 && GET_CODE (SET_DEST (set
)) == REG
1423 && rtx_equal_p (SET_SRC (set
),
1424 XEXP (static_chain_incoming_rtx
, 0)))
1427 gen_rtx_MEM (GET_MODE (static_chain_incoming_rtx
),
1430 /* emit the instruction in case it is used for something
1431 other than setting the static chain; if it's not used,
1432 it can always be removed as dead code */
1433 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1436 /* If this is setting the static chain rtx, omit it. */
1437 else if (static_chain_value
!= 0
1439 && (rtx_equal_p (SET_DEST (set
),
1440 static_chain_incoming_rtx
)
1441 || (static_chain_mem
1442 && rtx_equal_p (SET_DEST (set
), static_chain_mem
))))
1445 /* If this is setting the static chain pseudo, set it from
1446 the value we want to give it instead. */
1447 else if (static_chain_value
!= 0
1449 && (rtx_equal_p (SET_SRC (set
),
1450 static_chain_incoming_rtx
)
1451 || (static_chain_mem
1452 && rtx_equal_p (SET_SRC (set
), static_chain_mem
))))
1454 rtx newdest
= copy_rtx_and_substitute (SET_DEST (set
), map
, 1);
1456 copy
= emit_move_insn (newdest
, static_chain_value
);
1457 if (GET_CODE (static_chain_incoming_rtx
) != MEM
)
1458 static_chain_value
= 0;
1461 /* If this is setting the virtual stack vars register, this must
1462 be the code at the handler for a builtin longjmp. The value
1463 saved in the setjmp buffer will be the address of the frame
1464 we've made for this inlined instance within our frame. But we
1465 know the offset of that value so we can use it to reconstruct
1466 our virtual stack vars register from that value. If we are
1467 copying it from the stack pointer, leave it unchanged. */
1469 && rtx_equal_p (SET_DEST (set
), virtual_stack_vars_rtx
))
1471 HOST_WIDE_INT offset
;
1472 temp
= map
->reg_map
[REGNO (SET_DEST (set
))];
1473 temp
= VARRAY_CONST_EQUIV (map
->const_equiv_varray
,
1476 if (rtx_equal_p (temp
, virtual_stack_vars_rtx
))
1478 else if (GET_CODE (temp
) == PLUS
1479 && rtx_equal_p (XEXP (temp
, 0), virtual_stack_vars_rtx
)
1480 && GET_CODE (XEXP (temp
, 1)) == CONST_INT
)
1481 offset
= INTVAL (XEXP (temp
, 1));
1485 if (rtx_equal_p (SET_SRC (set
), stack_pointer_rtx
))
1486 temp
= SET_SRC (set
);
1488 temp
= force_operand (plus_constant (SET_SRC (set
),
1492 copy
= emit_move_insn (virtual_stack_vars_rtx
, temp
);
1496 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1497 /* REG_NOTES will be copied later. */
1500 /* If this insn is setting CC0, it may need to look at
1501 the insn that uses CC0 to see what type of insn it is.
1502 In that case, the call to recog via validate_change will
1503 fail. So don't substitute constants here. Instead,
1504 do it when we emit the following insn.
1506 For example, see the pyr.md file. That machine has signed and
1507 unsigned compares. The compare patterns must check the
1508 following branch insn to see which what kind of compare to
1511 If the previous insn set CC0, substitute constants on it as
1513 if (sets_cc0_p (PATTERN (copy
)) != 0)
1518 try_constants (cc0_insn
, map
);
1520 try_constants (copy
, map
);
1523 try_constants (copy
, map
);
1525 INSN_SCOPE (copy
) = INSN_SCOPE (insn
);
1529 if (map
->integrating
&& returnjump_p (insn
))
1531 if (map
->local_return_label
== 0)
1532 map
->local_return_label
= gen_label_rtx ();
1533 pattern
= gen_jump (map
->local_return_label
);
1536 pattern
= copy_rtx_and_substitute (PATTERN (insn
), map
, 0);
1538 copy
= emit_jump_insn (pattern
);
1542 try_constants (cc0_insn
, map
);
1545 try_constants (copy
, map
);
1546 INSN_SCOPE (copy
) = INSN_SCOPE (insn
);
1548 /* If this used to be a conditional jump insn but whose branch
1549 direction is now know, we must do something special. */
1550 if (any_condjump_p (insn
) && onlyjump_p (insn
) && map
->last_pc_value
)
1553 /* If the previous insn set cc0 for us, delete it. */
1554 if (only_sets_cc0_p (PREV_INSN (copy
)))
1555 delete_related_insns (PREV_INSN (copy
));
1558 /* If this is now a no-op, delete it. */
1559 if (map
->last_pc_value
== pc_rtx
)
1561 delete_related_insns (copy
);
1565 /* Otherwise, this is unconditional jump so we must put a
1566 BARRIER after it. We could do some dead code elimination
1567 here, but jump.c will do it just as well. */
1573 /* If this is a CALL_PLACEHOLDER insn then we need to copy the
1574 three attached sequences: normal call, sibling call and tail
1576 if (GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
1581 for (i
= 0; i
< 3; i
++)
1585 sequence
[i
] = NULL_RTX
;
1586 seq
= XEXP (PATTERN (insn
), i
);
1590 copy_insn_list (seq
, map
, static_chain_value
);
1591 sequence
[i
] = get_insns ();
1596 /* Find the new tail recursion label.
1597 It will already be substituted into sequence[2]. */
1598 tail_label
= copy_rtx_and_substitute (XEXP (PATTERN (insn
), 3),
1601 copy
= emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode
,
1609 pattern
= copy_rtx_and_substitute (PATTERN (insn
), map
, 0);
1610 copy
= emit_call_insn (pattern
);
1612 SIBLING_CALL_P (copy
) = SIBLING_CALL_P (insn
);
1613 CONST_OR_PURE_CALL_P (copy
) = CONST_OR_PURE_CALL_P (insn
);
1614 INSN_SCOPE (copy
) = INSN_SCOPE (insn
);
1616 /* Because the USAGE information potentially contains objects other
1617 than hard registers, we need to copy it. */
1619 CALL_INSN_FUNCTION_USAGE (copy
)
1620 = copy_rtx_and_substitute (CALL_INSN_FUNCTION_USAGE (insn
),
1625 try_constants (cc0_insn
, map
);
1628 try_constants (copy
, map
);
1630 /* Be lazy and assume CALL_INSNs clobber all hard registers. */
1631 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
1632 VARRAY_CONST_EQUIV (map
->const_equiv_varray
, i
).rtx
= 0;
1636 copy
= emit_label (get_label_from_map (map
,
1637 CODE_LABEL_NUMBER (insn
)));
1638 LABEL_NAME (copy
) = LABEL_NAME (insn
);
1643 copy
= emit_barrier ();
1647 if (NOTE_LINE_NUMBER (insn
) == NOTE_INSN_DELETED_LABEL
)
1649 copy
= emit_label (get_label_from_map (map
,
1650 CODE_LABEL_NUMBER (insn
)));
1651 LABEL_NAME (copy
) = NOTE_SOURCE_FILE (insn
);
1656 /* NOTE_INSN_FUNCTION_END and NOTE_INSN_FUNCTION_BEG are
1657 discarded because it is important to have only one of
1658 each in the current function.
1660 NOTE_INSN_DELETED notes aren't useful. */
1662 if (NOTE_LINE_NUMBER (insn
) != NOTE_INSN_FUNCTION_END
1663 && NOTE_LINE_NUMBER (insn
) != NOTE_INSN_FUNCTION_BEG
1664 && NOTE_LINE_NUMBER (insn
) != NOTE_INSN_DELETED
)
1666 copy
= emit_note (NOTE_SOURCE_FILE (insn
),
1667 NOTE_LINE_NUMBER (insn
));
1669 && (NOTE_LINE_NUMBER (copy
) == NOTE_INSN_BLOCK_BEG
1670 || NOTE_LINE_NUMBER (copy
) == NOTE_INSN_BLOCK_END
)
1671 && NOTE_BLOCK (insn
))
1673 tree
*mapped_block_p
;
1676 = (tree
*) bsearch (NOTE_BLOCK (insn
),
1677 &VARRAY_TREE (map
->block_map
, 0),
1678 map
->block_map
->elements_used
,
1682 if (!mapped_block_p
)
1685 NOTE_BLOCK (copy
) = *mapped_block_p
;
1688 && NOTE_LINE_NUMBER (copy
) == NOTE_INSN_EXPECTED_VALUE
)
1689 NOTE_EXPECTED_VALUE (copy
)
1690 = copy_rtx_and_substitute (NOTE_EXPECTED_VALUE (insn
),
1702 RTX_INTEGRATED_P (copy
) = 1;
1704 map
->insn_map
[INSN_UID (insn
)] = copy
;
1708 /* Copy the REG_NOTES. Increment const_age, so that only constants
1709 from parameters can be substituted in. These are the only ones
1710 that are valid across the entire function. */
1713 copy_insn_notes (insns
, map
, eh_region_offset
)
1715 struct inline_remap
*map
;
1716 int eh_region_offset
;
1721 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
1723 if (! INSN_P (insn
))
1726 new_insn
= map
->insn_map
[INSN_UID (insn
)];
1730 if (REG_NOTES (insn
))
1732 rtx next
, note
= copy_rtx_and_substitute (REG_NOTES (insn
), map
, 0);
1734 /* We must also do subst_constants, in case one of our parameters
1735 has const type and constant value. */
1736 subst_constants (¬e
, NULL_RTX
, map
, 0);
1737 apply_change_group ();
1738 REG_NOTES (new_insn
) = note
;
1740 /* Delete any REG_LABEL notes from the chain. Remap any
1741 REG_EH_REGION notes. */
1742 for (; note
; note
= next
)
1744 next
= XEXP (note
, 1);
1745 if (REG_NOTE_KIND (note
) == REG_LABEL
)
1746 remove_note (new_insn
, note
);
1747 else if (REG_NOTE_KIND (note
) == REG_EH_REGION
1748 && INTVAL (XEXP (note
, 0)) > 0)
1749 XEXP (note
, 0) = GEN_INT (INTVAL (XEXP (note
, 0))
1750 + eh_region_offset
);
1754 if (GET_CODE (insn
) == CALL_INSN
1755 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
1758 for (i
= 0; i
< 3; i
++)
1759 copy_insn_notes (XEXP (PATTERN (insn
), i
), map
, eh_region_offset
);
1762 if (GET_CODE (insn
) == JUMP_INSN
1763 && GET_CODE (PATTERN (insn
)) == RESX
)
1764 XINT (PATTERN (new_insn
), 0) += eh_region_offset
;
1768 /* Given a chain of PARM_DECLs, ARGS, copy each decl into a VAR_DECL,
1769 push all of those decls and give each one the corresponding home. */
1772 integrate_parm_decls (args
, map
, arg_vector
)
1774 struct inline_remap
*map
;
1780 for (tail
= args
, i
= 0; tail
; tail
= TREE_CHAIN (tail
), i
++)
1782 tree decl
= copy_decl_for_inlining (tail
, map
->fndecl
,
1783 current_function_decl
);
1785 = copy_rtx_and_substitute (RTVEC_ELT (arg_vector
, i
), map
, 1);
1787 /* We really should be setting DECL_INCOMING_RTL to something reasonable
1788 here, but that's going to require some more work. */
1789 /* DECL_INCOMING_RTL (decl) = ?; */
1790 /* Fully instantiate the address with the equivalent form so that the
1791 debugging information contains the actual register, instead of the
1792 virtual register. Do this by not passing an insn to
1794 subst_constants (&new_decl_rtl
, NULL_RTX
, map
, 1);
1795 apply_change_group ();
1796 SET_DECL_RTL (decl
, new_decl_rtl
);
1800 /* Given a BLOCK node LET, push decls and levels so as to construct in the
1801 current function a tree of contexts isomorphic to the one that is given.
1803 MAP, if nonzero, is a pointer to an inline_remap map which indicates how
1804 registers used in the DECL_RTL field should be remapped. If it is zero,
1805 no mapping is necessary. */
1808 integrate_decl_tree (let
, map
)
1810 struct inline_remap
*map
;
1816 new_block
= make_node (BLOCK
);
1817 VARRAY_PUSH_TREE (map
->block_map
, new_block
);
1818 next
= &BLOCK_VARS (new_block
);
1820 for (t
= BLOCK_VARS (let
); t
; t
= TREE_CHAIN (t
))
1824 d
= copy_decl_for_inlining (t
, map
->fndecl
, current_function_decl
);
1826 if (DECL_RTL_SET_P (t
))
1830 SET_DECL_RTL (d
, copy_rtx_and_substitute (DECL_RTL (t
), map
, 1));
1832 /* Fully instantiate the address with the equivalent form so that the
1833 debugging information contains the actual register, instead of the
1834 virtual register. Do this by not passing an insn to
1837 subst_constants (&r
, NULL_RTX
, map
, 1);
1838 SET_DECL_RTL (d
, r
);
1840 if (GET_CODE (r
) == REG
)
1841 REGNO_DECL (REGNO (r
)) = d
;
1842 else if (GET_CODE (r
) == CONCAT
)
1844 REGNO_DECL (REGNO (XEXP (r
, 0))) = d
;
1845 REGNO_DECL (REGNO (XEXP (r
, 1))) = d
;
1848 apply_change_group ();
1851 /* Add this declaration to the list of variables in the new
1854 next
= &TREE_CHAIN (d
);
1857 next
= &BLOCK_SUBBLOCKS (new_block
);
1858 for (t
= BLOCK_SUBBLOCKS (let
); t
; t
= BLOCK_CHAIN (t
))
1860 *next
= integrate_decl_tree (t
, map
);
1861 BLOCK_SUPERCONTEXT (*next
) = new_block
;
1862 next
= &BLOCK_CHAIN (*next
);
1865 TREE_USED (new_block
) = TREE_USED (let
);
1866 BLOCK_ABSTRACT_ORIGIN (new_block
) = let
;
1871 /* Create a new copy of an rtx. Recursively copies the operands of the rtx,
1872 except for those few rtx codes that are sharable.
1874 We always return an rtx that is similar to that incoming rtx, with the
1875 exception of possibly changing a REG to a SUBREG or vice versa. No
1876 rtl is ever emitted.
1878 If FOR_LHS is nonzero, if means we are processing something that will
1879 be the LHS of a SET. In that case, we copy RTX_UNCHANGING_P even if
1880 inlining since we need to be conservative in how it is set for
1883 Handle constants that need to be placed in the constant pool by
1884 calling `force_const_mem'. */
1887 copy_rtx_and_substitute (orig
, map
, for_lhs
)
1889 struct inline_remap
*map
;
1895 enum machine_mode mode
;
1896 const char *format_ptr
;
1902 code
= GET_CODE (orig
);
1903 mode
= GET_MODE (orig
);
1908 /* If the stack pointer register shows up, it must be part of
1909 stack-adjustments (*not* because we eliminated the frame pointer!).
1910 Small hard registers are returned as-is. Pseudo-registers
1911 go through their `reg_map'. */
1912 regno
= REGNO (orig
);
1913 if (regno
<= LAST_VIRTUAL_REGISTER
1914 || (map
->integrating
1915 && DECL_SAVED_INSNS (map
->fndecl
)->internal_arg_pointer
== orig
))
1917 /* Some hard registers are also mapped,
1918 but others are not translated. */
1919 if (map
->reg_map
[regno
] != 0)
1920 return map
->reg_map
[regno
];
1922 /* If this is the virtual frame pointer, make space in current
1923 function's stack frame for the stack frame of the inline function.
1925 Copy the address of this area into a pseudo. Map
1926 virtual_stack_vars_rtx to this pseudo and set up a constant
1927 equivalence for it to be the address. This will substitute the
1928 address into insns where it can be substituted and use the new
1929 pseudo where it can't. */
1930 else if (regno
== VIRTUAL_STACK_VARS_REGNUM
)
1933 int size
= get_func_frame_size (DECL_SAVED_INSNS (map
->fndecl
));
1934 #ifdef FRAME_GROWS_DOWNWARD
1936 = (DECL_SAVED_INSNS (map
->fndecl
)->stack_alignment_needed
1939 /* In this case, virtual_stack_vars_rtx points to one byte
1940 higher than the top of the frame area. So make sure we
1941 allocate a big enough chunk to keep the frame pointer
1942 aligned like a real one. */
1944 size
= CEIL_ROUND (size
, alignment
);
1947 loc
= assign_stack_temp (BLKmode
, size
, 1);
1948 loc
= XEXP (loc
, 0);
1949 #ifdef FRAME_GROWS_DOWNWARD
1950 /* In this case, virtual_stack_vars_rtx points to one byte
1951 higher than the top of the frame area. So compute the offset
1952 to one byte higher than our substitute frame. */
1953 loc
= plus_constant (loc
, size
);
1955 map
->reg_map
[regno
] = temp
1956 = force_reg (Pmode
, force_operand (loc
, NULL_RTX
));
1958 #ifdef STACK_BOUNDARY
1959 mark_reg_pointer (map
->reg_map
[regno
], STACK_BOUNDARY
);
1962 SET_CONST_EQUIV_DATA (map
, temp
, loc
, CONST_AGE_PARM
);
1966 emit_insn_after (seq
, map
->insns_at_start
);
1969 else if (regno
== VIRTUAL_INCOMING_ARGS_REGNUM
1970 || (map
->integrating
1971 && (DECL_SAVED_INSNS (map
->fndecl
)->internal_arg_pointer
1974 /* Do the same for a block to contain any arguments referenced
1977 int size
= DECL_SAVED_INSNS (map
->fndecl
)->args_size
;
1980 loc
= assign_stack_temp (BLKmode
, size
, 1);
1981 loc
= XEXP (loc
, 0);
1982 /* When arguments grow downward, the virtual incoming
1983 args pointer points to the top of the argument block,
1984 so the remapped location better do the same. */
1985 #ifdef ARGS_GROW_DOWNWARD
1986 loc
= plus_constant (loc
, size
);
1988 map
->reg_map
[regno
] = temp
1989 = force_reg (Pmode
, force_operand (loc
, NULL_RTX
));
1991 #ifdef STACK_BOUNDARY
1992 mark_reg_pointer (map
->reg_map
[regno
], STACK_BOUNDARY
);
1995 SET_CONST_EQUIV_DATA (map
, temp
, loc
, CONST_AGE_PARM
);
1999 emit_insn_after (seq
, map
->insns_at_start
);
2002 else if (REG_FUNCTION_VALUE_P (orig
))
2004 /* This is a reference to the function return value. If
2005 the function doesn't have a return value, error. If the
2006 mode doesn't agree, and it ain't BLKmode, make a SUBREG. */
2007 if (map
->inline_target
== 0)
2009 if (rtx_equal_function_value_matters
)
2010 /* This is an ignored return value. We must not
2011 leave it in with REG_FUNCTION_VALUE_P set, since
2012 that would confuse subsequent inlining of the
2013 current function into a later function. */
2014 return gen_rtx_REG (GET_MODE (orig
), regno
);
2016 /* Must be unrolling loops or replicating code if we
2017 reach here, so return the register unchanged. */
2020 else if (GET_MODE (map
->inline_target
) != BLKmode
2021 && mode
!= GET_MODE (map
->inline_target
))
2022 return gen_lowpart (mode
, map
->inline_target
);
2024 return map
->inline_target
;
2026 #if defined (LEAF_REGISTERS) && defined (LEAF_REG_REMAP)
2027 /* If leaf_renumber_regs_insn() might remap this register to
2028 some other number, make sure we don't share it with the
2029 inlined function, otherwise delayed optimization of the
2030 inlined function may change it in place, breaking our
2031 reference to it. We may still shared it within the
2032 function, so create an entry for this register in the
2034 if (map
->integrating
&& regno
< FIRST_PSEUDO_REGISTER
2035 && LEAF_REGISTERS
[regno
] && LEAF_REG_REMAP (regno
) != regno
)
2037 if (!map
->leaf_reg_map
[regno
][mode
])
2038 map
->leaf_reg_map
[regno
][mode
] = gen_rtx_REG (mode
, regno
);
2039 return map
->leaf_reg_map
[regno
][mode
];
2047 if (map
->reg_map
[regno
] == NULL
)
2049 map
->reg_map
[regno
] = gen_reg_rtx (mode
);
2050 REG_USERVAR_P (map
->reg_map
[regno
]) = REG_USERVAR_P (orig
);
2051 REG_LOOP_TEST_P (map
->reg_map
[regno
]) = REG_LOOP_TEST_P (orig
);
2052 RTX_UNCHANGING_P (map
->reg_map
[regno
]) = RTX_UNCHANGING_P (orig
);
2053 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
2055 if (REG_POINTER (map
->x_regno_reg_rtx
[regno
]))
2056 mark_reg_pointer (map
->reg_map
[regno
],
2057 map
->regno_pointer_align
[regno
]);
2059 return map
->reg_map
[regno
];
2062 copy
= copy_rtx_and_substitute (SUBREG_REG (orig
), map
, for_lhs
);
2063 return simplify_gen_subreg (GET_MODE (orig
), copy
,
2064 GET_MODE (SUBREG_REG (orig
)),
2065 SUBREG_BYTE (orig
));
2068 copy
= gen_rtx_ADDRESSOF (mode
,
2069 copy_rtx_and_substitute (XEXP (orig
, 0),
2071 0, ADDRESSOF_DECL (orig
));
2072 regno
= ADDRESSOF_REGNO (orig
);
2073 if (map
->reg_map
[regno
])
2074 regno
= REGNO (map
->reg_map
[regno
]);
2075 else if (regno
> LAST_VIRTUAL_REGISTER
)
2077 temp
= XEXP (orig
, 0);
2078 map
->reg_map
[regno
] = gen_reg_rtx (GET_MODE (temp
));
2079 REG_USERVAR_P (map
->reg_map
[regno
]) = REG_USERVAR_P (temp
);
2080 REG_LOOP_TEST_P (map
->reg_map
[regno
]) = REG_LOOP_TEST_P (temp
);
2081 RTX_UNCHANGING_P (map
->reg_map
[regno
]) = RTX_UNCHANGING_P (temp
);
2082 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
2084 /* Objects may initially be represented as registers, but
2085 but turned into a MEM if their address is taken by
2086 put_var_into_stack. Therefore, the register table may have
2087 entries which are MEMs.
2089 We briefly tried to clear such entries, but that ended up
2090 cascading into many changes due to the optimizers not being
2091 prepared for empty entries in the register table. So we've
2092 decided to allow the MEMs in the register table for now. */
2093 if (REG_P (map
->x_regno_reg_rtx
[regno
])
2094 && REG_POINTER (map
->x_regno_reg_rtx
[regno
]))
2095 mark_reg_pointer (map
->reg_map
[regno
],
2096 map
->regno_pointer_align
[regno
]);
2097 regno
= REGNO (map
->reg_map
[regno
]);
2099 ADDRESSOF_REGNO (copy
) = regno
;
2104 /* USE and CLOBBER are ordinary, but we convert (use (subreg foo))
2105 to (use foo) if the original insn didn't have a subreg.
2106 Removing the subreg distorts the VAX movstrhi pattern
2107 by changing the mode of an operand. */
2108 copy
= copy_rtx_and_substitute (XEXP (orig
, 0), map
, code
== CLOBBER
);
2109 if (GET_CODE (copy
) == SUBREG
&& GET_CODE (XEXP (orig
, 0)) != SUBREG
)
2110 copy
= SUBREG_REG (copy
);
2111 return gen_rtx_fmt_e (code
, VOIDmode
, copy
);
2113 /* We need to handle "deleted" labels that appear in the DECL_RTL
2116 if (NOTE_LINE_NUMBER (orig
) != NOTE_INSN_DELETED_LABEL
)
2119 /* ... FALLTHRU ... */
2121 LABEL_PRESERVE_P (get_label_from_map (map
, CODE_LABEL_NUMBER (orig
)))
2122 = LABEL_PRESERVE_P (orig
);
2123 return get_label_from_map (map
, CODE_LABEL_NUMBER (orig
));
2129 LABEL_REF_NONLOCAL_P (orig
) ? XEXP (orig
, 0)
2130 : get_label_from_map (map
, CODE_LABEL_NUMBER (XEXP (orig
, 0))));
2132 LABEL_OUTSIDE_LOOP_P (copy
) = LABEL_OUTSIDE_LOOP_P (orig
);
2134 /* The fact that this label was previously nonlocal does not mean
2135 it still is, so we must check if it is within the range of
2136 this function's labels. */
2137 LABEL_REF_NONLOCAL_P (copy
)
2138 = (LABEL_REF_NONLOCAL_P (orig
)
2139 && ! (CODE_LABEL_NUMBER (XEXP (copy
, 0)) >= get_first_label_num ()
2140 && CODE_LABEL_NUMBER (XEXP (copy
, 0)) < max_label_num ()));
2142 /* If we have made a nonlocal label local, it means that this
2143 inlined call will be referring to our nonlocal goto handler.
2144 So make sure we create one for this block; we normally would
2145 not since this is not otherwise considered a "call". */
2146 if (LABEL_REF_NONLOCAL_P (orig
) && ! LABEL_REF_NONLOCAL_P (copy
))
2147 function_call_count
++;
2158 /* Symbols which represent the address of a label stored in the constant
2159 pool must be modified to point to a constant pool entry for the
2160 remapped label. Otherwise, symbols are returned unchanged. */
2161 if (CONSTANT_POOL_ADDRESS_P (orig
))
2163 struct function
*f
= inlining
? inlining
: cfun
;
2164 rtx constant
= get_pool_constant_for_function (f
, orig
);
2165 enum machine_mode const_mode
= get_pool_mode_for_function (f
, orig
);
2168 rtx temp
= force_const_mem (const_mode
,
2169 copy_rtx_and_substitute (constant
,
2173 /* Legitimizing the address here is incorrect.
2175 Since we had a SYMBOL_REF before, we can assume it is valid
2176 to have one in this position in the insn.
2178 Also, change_address may create new registers. These
2179 registers will not have valid reg_map entries. This can
2180 cause try_constants() to fail because assumes that all
2181 registers in the rtx have valid reg_map entries, and it may
2182 end up replacing one of these new registers with junk. */
2184 if (! memory_address_p (GET_MODE (temp
), XEXP (temp
, 0)))
2185 temp
= change_address (temp
, GET_MODE (temp
), XEXP (temp
, 0));
2188 temp
= XEXP (temp
, 0);
2190 #ifdef POINTERS_EXTEND_UNSIGNED
2191 if (GET_MODE (temp
) != GET_MODE (orig
))
2192 temp
= convert_memory_address (GET_MODE (orig
), temp
);
2196 else if (GET_CODE (constant
) == LABEL_REF
)
2197 return XEXP (force_const_mem
2199 copy_rtx_and_substitute (constant
, map
, for_lhs
)),
2206 /* We have to make a new copy of this CONST_DOUBLE because don't want
2207 to use the old value of CONST_DOUBLE_MEM. Also, this may be a
2208 duplicate of a CONST_DOUBLE we have already seen. */
2209 if (GET_MODE_CLASS (GET_MODE (orig
)) == MODE_FLOAT
)
2213 REAL_VALUE_FROM_CONST_DOUBLE (d
, orig
);
2214 return CONST_DOUBLE_FROM_REAL_VALUE (d
, GET_MODE (orig
));
2217 return immed_double_const (CONST_DOUBLE_LOW (orig
),
2218 CONST_DOUBLE_HIGH (orig
), VOIDmode
);
2221 /* Make new constant pool entry for a constant
2222 that was in the pool of the inline function. */
2223 if (RTX_INTEGRATED_P (orig
))
2228 /* If a single asm insn contains multiple output operands then
2229 it contains multiple ASM_OPERANDS rtx's that share the input
2230 and constraint vecs. We must make sure that the copied insn
2231 continues to share it. */
2232 if (map
->orig_asm_operands_vector
== ASM_OPERANDS_INPUT_VEC (orig
))
2234 copy
= rtx_alloc (ASM_OPERANDS
);
2235 RTX_FLAG (copy
, volatil
) = RTX_FLAG (orig
, volatil
);
2236 PUT_MODE (copy
, GET_MODE (orig
));
2237 ASM_OPERANDS_TEMPLATE (copy
) = ASM_OPERANDS_TEMPLATE (orig
);
2238 ASM_OPERANDS_OUTPUT_CONSTRAINT (copy
)
2239 = ASM_OPERANDS_OUTPUT_CONSTRAINT (orig
);
2240 ASM_OPERANDS_OUTPUT_IDX (copy
) = ASM_OPERANDS_OUTPUT_IDX (orig
);
2241 ASM_OPERANDS_INPUT_VEC (copy
) = map
->copy_asm_operands_vector
;
2242 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy
)
2243 = map
->copy_asm_constraints_vector
;
2244 ASM_OPERANDS_SOURCE_FILE (copy
) = ASM_OPERANDS_SOURCE_FILE (orig
);
2245 ASM_OPERANDS_SOURCE_LINE (copy
) = ASM_OPERANDS_SOURCE_LINE (orig
);
2251 /* This is given special treatment because the first
2252 operand of a CALL is a (MEM ...) which may get
2253 forced into a register for cse. This is undesirable
2254 if function-address cse isn't wanted or if we won't do cse. */
2255 #ifndef NO_FUNCTION_CSE
2256 if (! (optimize
&& ! flag_no_function_cse
))
2260 = gen_rtx_MEM (GET_MODE (XEXP (orig
, 0)),
2261 copy_rtx_and_substitute (XEXP (XEXP (orig
, 0), 0),
2264 MEM_COPY_ATTRIBUTES (copy
, XEXP (orig
, 0));
2267 gen_rtx_CALL (GET_MODE (orig
), copy
,
2268 copy_rtx_and_substitute (XEXP (orig
, 1), map
, 0));
2273 /* Must be ifdefed out for loop unrolling to work. */
2279 /* If this is setting fp or ap, it means that we have a nonlocal goto.
2280 Adjust the setting by the offset of the area we made.
2281 If the nonlocal goto is into the current function,
2282 this will result in unnecessarily bad code, but should work. */
2283 if (SET_DEST (orig
) == virtual_stack_vars_rtx
2284 || SET_DEST (orig
) == virtual_incoming_args_rtx
)
2286 /* In case a translation hasn't occurred already, make one now. */
2289 HOST_WIDE_INT loc_offset
;
2291 copy_rtx_and_substitute (SET_DEST (orig
), map
, for_lhs
);
2292 equiv_reg
= map
->reg_map
[REGNO (SET_DEST (orig
))];
2293 equiv_loc
= VARRAY_CONST_EQUIV (map
->const_equiv_varray
,
2294 REGNO (equiv_reg
)).rtx
;
2296 = GET_CODE (equiv_loc
) == REG
? 0 : INTVAL (XEXP (equiv_loc
, 1));
2298 return gen_rtx_SET (VOIDmode
, SET_DEST (orig
),
2301 (copy_rtx_and_substitute (SET_SRC (orig
),
2307 return gen_rtx_SET (VOIDmode
,
2308 copy_rtx_and_substitute (SET_DEST (orig
), map
, 1),
2309 copy_rtx_and_substitute (SET_SRC (orig
), map
, 0));
2314 && GET_CODE (XEXP (orig
, 0)) == SYMBOL_REF
2315 && CONSTANT_POOL_ADDRESS_P (XEXP (orig
, 0)))
2317 enum machine_mode const_mode
2318 = get_pool_mode_for_function (inlining
, XEXP (orig
, 0));
2320 = get_pool_constant_for_function (inlining
, XEXP (orig
, 0));
2322 constant
= copy_rtx_and_substitute (constant
, map
, 0);
2324 /* If this was an address of a constant pool entry that itself
2325 had to be placed in the constant pool, it might not be a
2326 valid address. So the recursive call might have turned it
2327 into a register. In that case, it isn't a constant any
2328 more, so return it. This has the potential of changing a
2329 MEM into a REG, but we'll assume that it safe. */
2330 if (! CONSTANT_P (constant
))
2333 return validize_mem (force_const_mem (const_mode
, constant
));
2336 copy
= gen_rtx_MEM (mode
, copy_rtx_and_substitute (XEXP (orig
, 0),
2338 MEM_COPY_ATTRIBUTES (copy
, orig
);
2340 /* If inlining and this is not for the LHS, turn off RTX_UNCHANGING_P
2341 since this may be an indirect reference to a parameter and the
2342 actual may not be readonly. */
2343 if (inlining
&& !for_lhs
)
2344 RTX_UNCHANGING_P (copy
) = 0;
2346 /* If inlining, squish aliasing data that references the subroutine's
2347 parameter list, since that's no longer applicable. */
2348 if (inlining
&& MEM_EXPR (copy
)
2349 && TREE_CODE (MEM_EXPR (copy
)) == INDIRECT_REF
2350 && TREE_CODE (TREE_OPERAND (MEM_EXPR (copy
), 0)) == PARM_DECL
)
2351 set_mem_expr (copy
, NULL_TREE
);
2359 copy
= rtx_alloc (code
);
2360 PUT_MODE (copy
, mode
);
2361 RTX_FLAG (copy
, in_struct
) = RTX_FLAG (orig
, in_struct
);
2362 RTX_FLAG (copy
, volatil
) = RTX_FLAG (orig
, volatil
);
2363 RTX_FLAG (copy
, unchanging
) = RTX_FLAG (orig
, unchanging
);
2365 format_ptr
= GET_RTX_FORMAT (GET_CODE (copy
));
2367 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (copy
)); i
++)
2369 switch (*format_ptr
++)
2372 /* Copy this through the wide int field; that's safest. */
2373 X0WINT (copy
, i
) = X0WINT (orig
, i
);
2378 = copy_rtx_and_substitute (XEXP (orig
, i
), map
, for_lhs
);
2382 /* Change any references to old-insns to point to the
2383 corresponding copied insns. */
2384 XEXP (copy
, i
) = map
->insn_map
[INSN_UID (XEXP (orig
, i
))];
2388 XVEC (copy
, i
) = XVEC (orig
, i
);
2389 if (XVEC (orig
, i
) != NULL
&& XVECLEN (orig
, i
) != 0)
2391 XVEC (copy
, i
) = rtvec_alloc (XVECLEN (orig
, i
));
2392 for (j
= 0; j
< XVECLEN (copy
, i
); j
++)
2393 XVECEXP (copy
, i
, j
)
2394 = copy_rtx_and_substitute (XVECEXP (orig
, i
, j
),
2400 XWINT (copy
, i
) = XWINT (orig
, i
);
2404 XINT (copy
, i
) = XINT (orig
, i
);
2408 XSTR (copy
, i
) = XSTR (orig
, i
);
2412 XTREE (copy
, i
) = XTREE (orig
, i
);
2420 if (code
== ASM_OPERANDS
&& map
->orig_asm_operands_vector
== 0)
2422 map
->orig_asm_operands_vector
= ASM_OPERANDS_INPUT_VEC (orig
);
2423 map
->copy_asm_operands_vector
= ASM_OPERANDS_INPUT_VEC (copy
);
2424 map
->copy_asm_constraints_vector
2425 = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy
);
2431 /* Substitute known constant values into INSN, if that is valid. */
2434 try_constants (insn
, map
)
2436 struct inline_remap
*map
;
2442 /* First try just updating addresses, then other things. This is
2443 important when we have something like the store of a constant
2444 into memory and we can update the memory address but the machine
2445 does not support a constant source. */
2446 subst_constants (&PATTERN (insn
), insn
, map
, 1);
2447 apply_change_group ();
2448 subst_constants (&PATTERN (insn
), insn
, map
, 0);
2449 apply_change_group ();
2451 /* Show we don't know the value of anything stored or clobbered. */
2452 note_stores (PATTERN (insn
), mark_stores
, NULL
);
2453 map
->last_pc_value
= 0;
2455 map
->last_cc0_value
= 0;
2458 /* Set up any constant equivalences made in this insn. */
2459 for (i
= 0; i
< map
->num_sets
; i
++)
2461 if (GET_CODE (map
->equiv_sets
[i
].dest
) == REG
)
2463 int regno
= REGNO (map
->equiv_sets
[i
].dest
);
2465 MAYBE_EXTEND_CONST_EQUIV_VARRAY (map
, regno
);
2466 if (VARRAY_CONST_EQUIV (map
->const_equiv_varray
, regno
).rtx
== 0
2467 /* Following clause is a hack to make case work where GNU C++
2468 reassigns a variable to make cse work right. */
2469 || ! rtx_equal_p (VARRAY_CONST_EQUIV (map
->const_equiv_varray
,
2471 map
->equiv_sets
[i
].equiv
))
2472 SET_CONST_EQUIV_DATA (map
, map
->equiv_sets
[i
].dest
,
2473 map
->equiv_sets
[i
].equiv
, map
->const_age
);
2475 else if (map
->equiv_sets
[i
].dest
== pc_rtx
)
2476 map
->last_pc_value
= map
->equiv_sets
[i
].equiv
;
2478 else if (map
->equiv_sets
[i
].dest
== cc0_rtx
)
2479 map
->last_cc0_value
= map
->equiv_sets
[i
].equiv
;
2484 /* Substitute known constants for pseudo regs in the contents of LOC,
2485 which are part of INSN.
2486 If INSN is zero, the substitution should always be done (this is used to
2488 These changes are taken out by try_constants if the result is not valid.
2490 Note that we are more concerned with determining when the result of a SET
2491 is a constant, for further propagation, than actually inserting constants
2492 into insns; cse will do the latter task better.
2494 This function is also used to adjust address of items previously addressed
2495 via the virtual stack variable or virtual incoming arguments registers.
2497 If MEMONLY is nonzero, only make changes inside a MEM. */
2500 subst_constants (loc
, insn
, map
, memonly
)
2503 struct inline_remap
*map
;
2509 const char *format_ptr
;
2510 int num_changes
= num_validated_changes ();
2512 enum machine_mode op0_mode
= MAX_MACHINE_MODE
;
2514 code
= GET_CODE (x
);
2531 validate_change (insn
, loc
, map
->last_cc0_value
, 1);
2537 /* The only thing we can do with a USE or CLOBBER is possibly do
2538 some substitutions in a MEM within it. */
2539 if (GET_CODE (XEXP (x
, 0)) == MEM
)
2540 subst_constants (&XEXP (XEXP (x
, 0), 0), insn
, map
, 0);
2544 /* Substitute for parms and known constants. Don't replace
2545 hard regs used as user variables with constants. */
2548 int regno
= REGNO (x
);
2549 struct const_equiv_data
*p
;
2551 if (! (regno
< FIRST_PSEUDO_REGISTER
&& REG_USERVAR_P (x
))
2552 && (size_t) regno
< VARRAY_SIZE (map
->const_equiv_varray
)
2553 && (p
= &VARRAY_CONST_EQUIV (map
->const_equiv_varray
, regno
),
2555 && p
->age
>= map
->const_age
)
2556 validate_change (insn
, loc
, p
->rtx
, 1);
2561 /* SUBREG applied to something other than a reg
2562 should be treated as ordinary, since that must
2563 be a special hack and we don't know how to treat it specially.
2564 Consider for example mulsidi3 in m68k.md.
2565 Ordinary SUBREG of a REG needs this special treatment. */
2566 if (! memonly
&& GET_CODE (SUBREG_REG (x
)) == REG
)
2568 rtx inner
= SUBREG_REG (x
);
2571 /* We can't call subst_constants on &SUBREG_REG (x) because any
2572 constant or SUBREG wouldn't be valid inside our SUBEG. Instead,
2573 see what is inside, try to form the new SUBREG and see if that is
2574 valid. We handle two cases: extracting a full word in an
2575 integral mode and extracting the low part. */
2576 subst_constants (&inner
, NULL_RTX
, map
, 0);
2577 new = simplify_gen_subreg (GET_MODE (x
), inner
,
2578 GET_MODE (SUBREG_REG (x
)),
2582 validate_change (insn
, loc
, new, 1);
2584 cancel_changes (num_changes
);
2591 subst_constants (&XEXP (x
, 0), insn
, map
, 0);
2593 /* If a memory address got spoiled, change it back. */
2594 if (! memonly
&& insn
!= 0 && num_validated_changes () != num_changes
2595 && ! memory_address_p (GET_MODE (x
), XEXP (x
, 0)))
2596 cancel_changes (num_changes
);
2601 /* Substitute constants in our source, and in any arguments to a
2602 complex (e..g, ZERO_EXTRACT) destination, but not in the destination
2604 rtx
*dest_loc
= &SET_DEST (x
);
2605 rtx dest
= *dest_loc
;
2607 enum machine_mode compare_mode
= VOIDmode
;
2609 /* If SET_SRC is a COMPARE which subst_constants would turn into
2610 COMPARE of 2 VOIDmode constants, note the mode in which comparison
2612 if (GET_CODE (SET_SRC (x
)) == COMPARE
)
2615 if (GET_MODE_CLASS (GET_MODE (src
)) == MODE_CC
2621 compare_mode
= GET_MODE (XEXP (src
, 0));
2622 if (compare_mode
== VOIDmode
)
2623 compare_mode
= GET_MODE (XEXP (src
, 1));
2627 subst_constants (&SET_SRC (x
), insn
, map
, memonly
);
2630 while (GET_CODE (*dest_loc
) == ZERO_EXTRACT
2631 || GET_CODE (*dest_loc
) == SUBREG
2632 || GET_CODE (*dest_loc
) == STRICT_LOW_PART
)
2634 if (GET_CODE (*dest_loc
) == ZERO_EXTRACT
)
2636 subst_constants (&XEXP (*dest_loc
, 1), insn
, map
, memonly
);
2637 subst_constants (&XEXP (*dest_loc
, 2), insn
, map
, memonly
);
2639 dest_loc
= &XEXP (*dest_loc
, 0);
2642 /* Do substitute in the address of a destination in memory. */
2643 if (GET_CODE (*dest_loc
) == MEM
)
2644 subst_constants (&XEXP (*dest_loc
, 0), insn
, map
, 0);
2646 /* Check for the case of DEST a SUBREG, both it and the underlying
2647 register are less than one word, and the SUBREG has the wider mode.
2648 In the case, we are really setting the underlying register to the
2649 source converted to the mode of DEST. So indicate that. */
2650 if (GET_CODE (dest
) == SUBREG
2651 && GET_MODE_SIZE (GET_MODE (dest
)) <= UNITS_PER_WORD
2652 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest
))) <= UNITS_PER_WORD
2653 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest
)))
2654 <= GET_MODE_SIZE (GET_MODE (dest
)))
2655 && (tem
= gen_lowpart_if_possible (GET_MODE (SUBREG_REG (dest
)),
2657 src
= tem
, dest
= SUBREG_REG (dest
);
2659 /* If storing a recognizable value save it for later recording. */
2660 if ((map
->num_sets
< MAX_RECOG_OPERANDS
)
2661 && (CONSTANT_P (src
)
2662 || (GET_CODE (src
) == REG
2663 && (REGNO (src
) == VIRTUAL_INCOMING_ARGS_REGNUM
2664 || REGNO (src
) == VIRTUAL_STACK_VARS_REGNUM
))
2665 || (GET_CODE (src
) == PLUS
2666 && GET_CODE (XEXP (src
, 0)) == REG
2667 && (REGNO (XEXP (src
, 0)) == VIRTUAL_INCOMING_ARGS_REGNUM
2668 || REGNO (XEXP (src
, 0)) == VIRTUAL_STACK_VARS_REGNUM
)
2669 && CONSTANT_P (XEXP (src
, 1)))
2670 || GET_CODE (src
) == COMPARE
2675 && (src
== pc_rtx
|| GET_CODE (src
) == RETURN
2676 || GET_CODE (src
) == LABEL_REF
))))
2678 /* Normally, this copy won't do anything. But, if SRC is a COMPARE
2679 it will cause us to save the COMPARE with any constants
2680 substituted, which is what we want for later. */
2681 rtx src_copy
= copy_rtx (src
);
2682 map
->equiv_sets
[map
->num_sets
].equiv
= src_copy
;
2683 map
->equiv_sets
[map
->num_sets
++].dest
= dest
;
2684 if (compare_mode
!= VOIDmode
2685 && GET_CODE (src
) == COMPARE
2686 && (GET_MODE_CLASS (GET_MODE (src
)) == MODE_CC
2691 && GET_MODE (XEXP (src
, 0)) == VOIDmode
2692 && GET_MODE (XEXP (src
, 1)) == VOIDmode
)
2694 map
->compare_src
= src_copy
;
2695 map
->compare_mode
= compare_mode
;
2705 format_ptr
= GET_RTX_FORMAT (code
);
2707 /* If the first operand is an expression, save its mode for later. */
2708 if (*format_ptr
== 'e')
2709 op0_mode
= GET_MODE (XEXP (x
, 0));
2711 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++)
2713 switch (*format_ptr
++)
2720 subst_constants (&XEXP (x
, i
), insn
, map
, memonly
);
2733 if (XVEC (x
, i
) != NULL
&& XVECLEN (x
, i
) != 0)
2734 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2735 subst_constants (&XVECEXP (x
, i
, j
), insn
, map
, memonly
);
2744 /* If this is a commutative operation, move a constant to the second
2745 operand unless the second operand is already a CONST_INT. */
2747 && (GET_RTX_CLASS (code
) == 'c' || code
== NE
|| code
== EQ
)
2748 && CONSTANT_P (XEXP (x
, 0)) && GET_CODE (XEXP (x
, 1)) != CONST_INT
)
2750 rtx tem
= XEXP (x
, 0);
2751 validate_change (insn
, &XEXP (x
, 0), XEXP (x
, 1), 1);
2752 validate_change (insn
, &XEXP (x
, 1), tem
, 1);
2755 /* Simplify the expression in case we put in some constants. */
2757 switch (GET_RTX_CLASS (code
))
2760 if (op0_mode
== MAX_MACHINE_MODE
)
2762 new = simplify_unary_operation (code
, GET_MODE (x
),
2763 XEXP (x
, 0), op0_mode
);
2768 enum machine_mode op_mode
= GET_MODE (XEXP (x
, 0));
2770 if (op_mode
== VOIDmode
)
2771 op_mode
= GET_MODE (XEXP (x
, 1));
2772 new = simplify_relational_operation (code
, op_mode
,
2773 XEXP (x
, 0), XEXP (x
, 1));
2774 #ifdef FLOAT_STORE_FLAG_VALUE
2775 if (new != 0 && GET_MODE_CLASS (GET_MODE (x
)) == MODE_FLOAT
)
2777 enum machine_mode mode
= GET_MODE (x
);
2778 if (new == const0_rtx
)
2779 new = CONST0_RTX (mode
);
2782 REAL_VALUE_TYPE val
;
2784 /* Avoid automatic aggregate initialization. */
2785 val
= FLOAT_STORE_FLAG_VALUE (mode
);
2786 new = CONST_DOUBLE_FROM_REAL_VALUE (val
, mode
);
2795 new = simplify_binary_operation (code
, GET_MODE (x
),
2796 XEXP (x
, 0), XEXP (x
, 1));
2801 if (op0_mode
== MAX_MACHINE_MODE
)
2804 if (code
== IF_THEN_ELSE
)
2806 rtx op0
= XEXP (x
, 0);
2808 if (GET_RTX_CLASS (GET_CODE (op0
)) == '<'
2809 && GET_MODE (op0
) == VOIDmode
2810 && ! side_effects_p (op0
)
2811 && XEXP (op0
, 0) == map
->compare_src
2812 && GET_MODE (XEXP (op0
, 1)) == VOIDmode
)
2814 /* We have compare of two VOIDmode constants for which
2815 we recorded the comparison mode. */
2817 simplify_relational_operation (GET_CODE (op0
),
2822 if (temp
== const0_rtx
)
2824 else if (temp
== const1_rtx
)
2829 new = simplify_ternary_operation (code
, GET_MODE (x
), op0_mode
,
2830 XEXP (x
, 0), XEXP (x
, 1),
2836 validate_change (insn
, loc
, new, 1);
2839 /* Show that register modified no longer contain known constants. We are
2840 called from note_stores with parts of the new insn. */
2843 mark_stores (dest
, x
, data
)
2845 rtx x ATTRIBUTE_UNUSED
;
2846 void *data ATTRIBUTE_UNUSED
;
2849 enum machine_mode mode
= VOIDmode
;
2851 /* DEST is always the innermost thing set, except in the case of
2852 SUBREGs of hard registers. */
2854 if (GET_CODE (dest
) == REG
)
2855 regno
= REGNO (dest
), mode
= GET_MODE (dest
);
2856 else if (GET_CODE (dest
) == SUBREG
&& GET_CODE (SUBREG_REG (dest
)) == REG
)
2858 regno
= REGNO (SUBREG_REG (dest
));
2859 if (regno
< FIRST_PSEUDO_REGISTER
)
2860 regno
+= subreg_regno_offset (REGNO (SUBREG_REG (dest
)),
2861 GET_MODE (SUBREG_REG (dest
)),
2864 mode
= GET_MODE (SUBREG_REG (dest
));
2869 unsigned int uregno
= regno
;
2870 unsigned int last_reg
= (uregno
>= FIRST_PSEUDO_REGISTER
? uregno
2871 : uregno
+ HARD_REGNO_NREGS (uregno
, mode
) - 1);
2874 /* Ignore virtual stack var or virtual arg register since those
2875 are handled separately. */
2876 if (uregno
!= VIRTUAL_INCOMING_ARGS_REGNUM
2877 && uregno
!= VIRTUAL_STACK_VARS_REGNUM
)
2878 for (i
= uregno
; i
<= last_reg
; i
++)
2879 if ((size_t) i
< VARRAY_SIZE (global_const_equiv_varray
))
2880 VARRAY_CONST_EQUIV (global_const_equiv_varray
, i
).rtx
= 0;
2884 /* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the
2885 given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so
2886 that it points to the node itself, thus indicating that the node is its
2887 own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for
2888 the given node is NULL, recursively descend the decl/block tree which
2889 it is the root of, and for each other ..._DECL or BLOCK node contained
2890 therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also
2891 still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN
2892 values to point to themselves. */
2895 set_block_origin_self (stmt
)
2898 if (BLOCK_ABSTRACT_ORIGIN (stmt
) == NULL_TREE
)
2900 BLOCK_ABSTRACT_ORIGIN (stmt
) = stmt
;
2905 for (local_decl
= BLOCK_VARS (stmt
);
2906 local_decl
!= NULL_TREE
;
2907 local_decl
= TREE_CHAIN (local_decl
))
2908 set_decl_origin_self (local_decl
); /* Potential recursion. */
2914 for (subblock
= BLOCK_SUBBLOCKS (stmt
);
2915 subblock
!= NULL_TREE
;
2916 subblock
= BLOCK_CHAIN (subblock
))
2917 set_block_origin_self (subblock
); /* Recurse. */
2922 /* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for
2923 the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the
2924 node to so that it points to the node itself, thus indicating that the
2925 node represents its own (abstract) origin. Additionally, if the
2926 DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend
2927 the decl/block tree of which the given node is the root of, and for
2928 each other ..._DECL or BLOCK node contained therein whose
2929 DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL,
2930 set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to
2931 point to themselves. */
2934 set_decl_origin_self (decl
)
2937 if (DECL_ABSTRACT_ORIGIN (decl
) == NULL_TREE
)
2939 DECL_ABSTRACT_ORIGIN (decl
) = decl
;
2940 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2944 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= TREE_CHAIN (arg
))
2945 DECL_ABSTRACT_ORIGIN (arg
) = arg
;
2946 if (DECL_INITIAL (decl
) != NULL_TREE
2947 && DECL_INITIAL (decl
) != error_mark_node
)
2948 set_block_origin_self (DECL_INITIAL (decl
));
2953 /* Given a pointer to some BLOCK node, and a boolean value to set the
2954 "abstract" flags to, set that value into the BLOCK_ABSTRACT flag for
2955 the given block, and for all local decls and all local sub-blocks
2956 (recursively) which are contained therein. */
2959 set_block_abstract_flags (stmt
, setting
)
2966 BLOCK_ABSTRACT (stmt
) = setting
;
2968 for (local_decl
= BLOCK_VARS (stmt
);
2969 local_decl
!= NULL_TREE
;
2970 local_decl
= TREE_CHAIN (local_decl
))
2971 set_decl_abstract_flags (local_decl
, setting
);
2973 for (subblock
= BLOCK_SUBBLOCKS (stmt
);
2974 subblock
!= NULL_TREE
;
2975 subblock
= BLOCK_CHAIN (subblock
))
2976 set_block_abstract_flags (subblock
, setting
);
2979 /* Given a pointer to some ..._DECL node, and a boolean value to set the
2980 "abstract" flags to, set that value into the DECL_ABSTRACT flag for the
2981 given decl, and (in the case where the decl is a FUNCTION_DECL) also
2982 set the abstract flags for all of the parameters, local vars, local
2983 blocks and sub-blocks (recursively) to the same setting. */
2986 set_decl_abstract_flags (decl
, setting
)
2990 DECL_ABSTRACT (decl
) = setting
;
2991 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2995 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= TREE_CHAIN (arg
))
2996 DECL_ABSTRACT (arg
) = setting
;
2997 if (DECL_INITIAL (decl
) != NULL_TREE
2998 && DECL_INITIAL (decl
) != error_mark_node
)
2999 set_block_abstract_flags (DECL_INITIAL (decl
), setting
);
3003 /* Output the assembly language code for the function FNDECL
3004 from its DECL_SAVED_INSNS. Used for inline functions that are output
3005 at end of compilation instead of where they came in the source. */
3008 output_inline_function (fndecl
)
3011 struct function
*old_cfun
= cfun
;
3012 enum debug_info_type old_write_symbols
= write_symbols
;
3013 const struct gcc_debug_hooks
*const old_debug_hooks
= debug_hooks
;
3014 struct function
*f
= DECL_SAVED_INSNS (fndecl
);
3017 current_function_decl
= fndecl
;
3019 set_new_last_label_num (f
->inl_max_label_num
);
3021 /* We're not deferring this any longer. */
3022 DECL_DEFER_OUTPUT (fndecl
) = 0;
3024 /* If requested, suppress debugging information. */
3025 if (f
->no_debugging_symbols
)
3027 write_symbols
= NO_DEBUG
;
3028 debug_hooks
= &do_nothing_debug_hooks
;
3031 /* Compile this function all the way down to assembly code. As a
3032 side effect this destroys the saved RTL representation, but
3033 that's okay, because we don't need to inline this anymore. */
3034 rest_of_compilation (fndecl
);
3035 DECL_INLINE (fndecl
) = 0;
3038 current_function_decl
= old_cfun
? old_cfun
->decl
: 0;
3039 write_symbols
= old_write_symbols
;
3040 debug_hooks
= old_debug_hooks
;
3044 /* Functions to keep track of the values hard regs had at the start of
3048 get_hard_reg_initial_reg (fun
, reg
)
3049 struct function
*fun
;
3052 struct initial_value_struct
*ivs
= fun
->hard_reg_initial_vals
;
3058 for (i
= 0; i
< ivs
->num_entries
; i
++)
3059 if (rtx_equal_p (ivs
->entries
[i
].pseudo
, reg
))
3060 return ivs
->entries
[i
].hard_reg
;
3066 has_func_hard_reg_initial_val (fun
, reg
)
3067 struct function
*fun
;
3070 struct initial_value_struct
*ivs
= fun
->hard_reg_initial_vals
;
3076 for (i
= 0; i
< ivs
->num_entries
; i
++)
3077 if (rtx_equal_p (ivs
->entries
[i
].hard_reg
, reg
))
3078 return ivs
->entries
[i
].pseudo
;
3084 get_func_hard_reg_initial_val (fun
, reg
)
3085 struct function
*fun
;
3088 struct initial_value_struct
*ivs
= fun
->hard_reg_initial_vals
;
3089 rtx rv
= has_func_hard_reg_initial_val (fun
, reg
);
3096 fun
->hard_reg_initial_vals
= (void *) ggc_alloc (sizeof (initial_value_struct
));
3097 ivs
= fun
->hard_reg_initial_vals
;
3098 ivs
->num_entries
= 0;
3099 ivs
->max_entries
= 5;
3100 ivs
->entries
= (initial_value_pair
*) ggc_alloc (5 * sizeof (initial_value_pair
));
3103 if (ivs
->num_entries
>= ivs
->max_entries
)
3105 ivs
->max_entries
+= 5;
3107 (initial_value_pair
*) ggc_realloc (ivs
->entries
,
3109 * sizeof (initial_value_pair
));
3112 ivs
->entries
[ivs
->num_entries
].hard_reg
= reg
;
3113 ivs
->entries
[ivs
->num_entries
].pseudo
= gen_reg_rtx (GET_MODE (reg
));
3115 return ivs
->entries
[ivs
->num_entries
++].pseudo
;
3119 get_hard_reg_initial_val (mode
, regno
)
3120 enum machine_mode mode
;
3123 return get_func_hard_reg_initial_val (cfun
, gen_rtx_REG (mode
, regno
));
3127 has_hard_reg_initial_val (mode
, regno
)
3128 enum machine_mode mode
;
3131 return has_func_hard_reg_initial_val (cfun
, gen_rtx_REG (mode
, regno
));
3135 setup_initial_hard_reg_value_integration (inl_f
, remap
)
3136 struct function
*inl_f
;
3137 struct inline_remap
*remap
;
3139 struct initial_value_struct
*ivs
= inl_f
->hard_reg_initial_vals
;
3145 for (i
= 0; i
< ivs
->num_entries
; i
++)
3146 remap
->reg_map
[REGNO (ivs
->entries
[i
].pseudo
)]
3147 = get_func_hard_reg_initial_val (cfun
, ivs
->entries
[i
].hard_reg
);
3152 emit_initial_value_sets ()
3154 struct initial_value_struct
*ivs
= cfun
->hard_reg_initial_vals
;
3162 for (i
= 0; i
< ivs
->num_entries
; i
++)
3163 emit_move_insn (ivs
->entries
[i
].pseudo
, ivs
->entries
[i
].hard_reg
);
3167 emit_insn_after (seq
, get_insns ());
3170 /* If the backend knows where to allocate pseudos for hard
3171 register initial values, register these allocations now. */
3173 allocate_initial_values (reg_equiv_memory_loc
)
3174 rtx
*reg_equiv_memory_loc ATTRIBUTE_UNUSED
;
3176 #ifdef ALLOCATE_INITIAL_VALUE
3177 struct initial_value_struct
*ivs
= cfun
->hard_reg_initial_vals
;
3183 for (i
= 0; i
< ivs
->num_entries
; i
++)
3185 int regno
= REGNO (ivs
->entries
[i
].pseudo
);
3186 rtx x
= ALLOCATE_INITIAL_VALUE (ivs
->entries
[i
].hard_reg
);
3188 if (x
== NULL_RTX
|| REG_N_SETS (REGNO (ivs
->entries
[i
].pseudo
)) > 1)
3190 else if (GET_CODE (x
) == MEM
)
3191 reg_equiv_memory_loc
[regno
] = x
;
3192 else if (GET_CODE (x
) == REG
)
3194 reg_renumber
[regno
] = REGNO (x
);
3195 /* Poke the regno right into regno_reg_rtx
3196 so that even fixed regs are accepted. */
3197 REGNO (ivs
->entries
[i
].pseudo
) = REGNO (x
);
3204 #include "gt-integrate.h"