1 /* Procedure integration for GNU CC.
2 Copyright (C) 1988, 1991, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
32 #include "insn-config.h"
33 #include "insn-flags.h"
37 #include "integrate.h"
46 #define obstack_chunk_alloc xmalloc
47 #define obstack_chunk_free free
49 extern struct obstack *function_maybepermanent_obstack;
51 /* Similar, but round to the next highest integer that meets the
53 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
55 /* Default max number of insns a function can have and still be inline.
56 This is overridden on RISC machines. */
57 #ifndef INTEGRATE_THRESHOLD
58 /* Inlining small functions might save more space then not inlining at
59 all. Assume 1 instruction for the call and 1.5 insns per argument. */
60 #define INTEGRATE_THRESHOLD(DECL) \
62 ? (1 + (3 * list_length (DECL_ARGUMENTS (DECL))) / 2) \
63 : (8 * (8 + list_length (DECL_ARGUMENTS (DECL)))))
66 static rtvec initialize_for_inline PARAMS ((tree));
67 static void note_modified_parmregs PARAMS ((rtx, rtx, void *));
68 static void integrate_parm_decls PARAMS ((tree, struct inline_remap *,
70 static tree integrate_decl_tree PARAMS ((tree,
71 struct inline_remap *));
72 static void subst_constants PARAMS ((rtx *, rtx,
73 struct inline_remap *, int));
74 static void set_block_origin_self PARAMS ((tree));
75 static void set_decl_origin_self PARAMS ((tree));
76 static void set_block_abstract_flags PARAMS ((tree, int));
77 static void process_reg_param PARAMS ((struct inline_remap *, rtx,
79 void set_decl_abstract_flags PARAMS ((tree, int));
80 static rtx expand_inline_function_eh_labelmap PARAMS ((rtx));
81 static void mark_stores PARAMS ((rtx, rtx, void *));
82 static void save_parm_insns PARAMS ((rtx, rtx));
83 static void copy_insn_list PARAMS ((rtx, struct inline_remap *,
85 static int compare_blocks PARAMS ((const PTR, const PTR));
86 static int find_block PARAMS ((const PTR, const PTR));
88 /* The maximum number of instructions accepted for inlining a
89 function. Increasing values mean more agressive inlining.
90 This affects currently only functions explicitly marked as
91 inline (or methods defined within the class definition for C++).
92 The default value of 10000 is arbitrary but high to match the
93 previously unlimited gcc capabilities. */
95 int inline_max_insns = 10000;
97 /* Used by copy_rtx_and_substitute; this indicates whether the function is
98 called for the purpose of inlining or some other purpose (i.e. loop
99 unrolling). This affects how constant pool references are handled.
100 This variable contains the FUNCTION_DECL for the inlined function. */
101 static struct function *inlining = 0;
103 /* Returns the Ith entry in the label_map contained in MAP. If the
104 Ith entry has not yet been set, return a fresh label. This function
105 performs a lazy initialization of label_map, thereby avoiding huge memory
106 explosions when the label_map gets very large. */
109 get_label_from_map (map, i)
110 struct inline_remap *map;
113 rtx x = map->label_map[i];
116 x = map->label_map[i] = gen_label_rtx();
121 /* Zero if the current function (whose FUNCTION_DECL is FNDECL)
122 is safe and reasonable to integrate into other functions.
123 Nonzero means value is a warning msgid with a single %s
124 for the function's name. */
127 function_cannot_inline_p (fndecl)
128 register tree fndecl;
131 tree last = tree_last (TYPE_ARG_TYPES (TREE_TYPE (fndecl)));
133 /* For functions marked as inline increase the maximum size to
134 inline_max_insns (-finline-limit-<n>). For regular functions
135 use the limit given by INTEGRATE_THRESHOLD. */
137 int max_insns = (DECL_INLINE (fndecl))
139 + 8 * list_length (DECL_ARGUMENTS (fndecl)))
140 : INTEGRATE_THRESHOLD (fndecl);
142 register int ninsns = 0;
146 /* No inlines with varargs. */
147 if ((last && TREE_VALUE (last) != void_type_node)
148 || current_function_varargs)
149 return N_("varargs function cannot be inline");
151 if (current_function_calls_alloca)
152 return N_("function using alloca cannot be inline");
154 if (current_function_calls_setjmp)
155 return N_("function using setjmp cannot be inline");
157 if (current_function_contains_functions)
158 return N_("function with nested functions cannot be inline");
162 N_("function with label addresses used in initializers cannot inline");
164 if (current_function_cannot_inline)
165 return current_function_cannot_inline;
167 /* If its not even close, don't even look. */
168 if (get_max_uid () > 3 * max_insns)
169 return N_("function too large to be inline");
172 /* Don't inline functions which do not specify a function prototype and
173 have BLKmode argument or take the address of a parameter. */
174 for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms))
176 if (TYPE_MODE (TREE_TYPE (parms)) == BLKmode)
177 TREE_ADDRESSABLE (parms) = 1;
178 if (last == NULL_TREE && TREE_ADDRESSABLE (parms))
179 return N_("no prototype, and parameter address used; cannot be inline");
183 /* We can't inline functions that return structures
184 the old-fashioned PCC way, copying into a static block. */
185 if (current_function_returns_pcc_struct)
186 return N_("inline functions not supported for this return value type");
188 /* We can't inline functions that return structures of varying size. */
189 if (TREE_CODE (TREE_TYPE (TREE_TYPE (fndecl))) != VOID_TYPE
190 && int_size_in_bytes (TREE_TYPE (TREE_TYPE (fndecl))) < 0)
191 return N_("function with varying-size return value cannot be inline");
193 /* Cannot inline a function with a varying size argument or one that
194 receives a transparent union. */
195 for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms))
197 if (int_size_in_bytes (TREE_TYPE (parms)) < 0)
198 return N_("function with varying-size parameter cannot be inline");
199 else if (TYPE_TRANSPARENT_UNION (TREE_TYPE (parms)))
200 return N_("function with transparent unit parameter cannot be inline");
203 if (get_max_uid () > max_insns)
205 for (ninsns = 0, insn = get_first_nonparm_insn ();
206 insn && ninsns < max_insns;
207 insn = NEXT_INSN (insn))
208 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
211 if (ninsns >= max_insns)
212 return N_("function too large to be inline");
215 /* We will not inline a function which uses computed goto. The addresses of
216 its local labels, which may be tucked into global storage, are of course
217 not constant across instantiations, which causes unexpected behaviour. */
218 if (current_function_has_computed_jump)
219 return N_("function with computed jump cannot inline");
221 /* We cannot inline a nested function that jumps to a nonlocal label. */
222 if (current_function_has_nonlocal_goto)
223 return N_("function with nonlocal goto cannot be inline");
225 /* This is a hack, until the inliner is taught about eh regions at
226 the start of the function. */
227 for (insn = get_insns ();
229 && ! (GET_CODE (insn) == NOTE
230 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG);
231 insn = NEXT_INSN (insn))
233 if (insn && GET_CODE (insn) == NOTE
234 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG)
235 return N_("function with complex parameters cannot be inline");
238 /* We can't inline functions that return a PARALLEL rtx. */
239 result = DECL_RTL (DECL_RESULT (fndecl));
240 if (result && GET_CODE (result) == PARALLEL)
241 return N_("inline functions not supported for this return value type");
246 /* Map pseudo reg number into the PARM_DECL for the parm living in the reg.
247 Zero for a reg that isn't a parm's home.
248 Only reg numbers less than max_parm_reg are mapped here. */
249 static tree *parmdecl_map;
251 /* In save_for_inline, nonzero if past the parm-initialization insns. */
252 static int in_nonparm_insns;
254 /* Subroutine for `save_for_inline_nocopy'. Performs initialization
255 needed to save FNDECL's insns and info for future inline expansion. */
258 initialize_for_inline (fndecl)
265 /* Clear out PARMDECL_MAP. It was allocated in the caller's frame. */
266 bzero ((char *) parmdecl_map, max_parm_reg * sizeof (tree));
267 arg_vector = rtvec_alloc (list_length (DECL_ARGUMENTS (fndecl)));
269 for (parms = DECL_ARGUMENTS (fndecl), i = 0;
271 parms = TREE_CHAIN (parms), i++)
273 rtx p = DECL_RTL (parms);
275 /* If we have (mem (addressof (mem ...))), use the inner MEM since
276 otherwise the copy_rtx call below will not unshare the MEM since
277 it shares ADDRESSOF. */
278 if (GET_CODE (p) == MEM && GET_CODE (XEXP (p, 0)) == ADDRESSOF
279 && GET_CODE (XEXP (XEXP (p, 0), 0)) == MEM)
280 p = XEXP (XEXP (p, 0), 0);
282 RTVEC_ELT (arg_vector, i) = p;
284 if (GET_CODE (p) == REG)
285 parmdecl_map[REGNO (p)] = parms;
286 else if (GET_CODE (p) == CONCAT)
288 rtx preal = gen_realpart (GET_MODE (XEXP (p, 0)), p);
289 rtx pimag = gen_imagpart (GET_MODE (preal), p);
291 if (GET_CODE (preal) == REG)
292 parmdecl_map[REGNO (preal)] = parms;
293 if (GET_CODE (pimag) == REG)
294 parmdecl_map[REGNO (pimag)] = parms;
297 /* This flag is cleared later
298 if the function ever modifies the value of the parm. */
299 TREE_READONLY (parms) = 1;
305 /* Copy NODE (which must be a DECL, but not a PARM_DECL). The DECL
306 originally was in the FROM_FN, but now it will be in the
310 copy_decl_for_inlining (decl, from_fn, to_fn)
317 /* Copy the declaration. */
318 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
320 /* For a parameter, we must make an equivalent VAR_DECL, not a
322 copy = build_decl (VAR_DECL, DECL_NAME (decl), TREE_TYPE (decl));
323 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
327 copy = copy_node (decl);
328 if (DECL_LANG_SPECIFIC (copy))
329 copy_lang_decl (copy);
331 /* TREE_ADDRESSABLE isn't used to indicate that a label's
332 address has been taken; it's for internal bookkeeping in
333 expand_goto_internal. */
334 if (TREE_CODE (copy) == LABEL_DECL)
335 TREE_ADDRESSABLE (copy) = 0;
338 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
339 declaration inspired this copy. */
340 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
342 /* The new variable/label has no RTL, yet. */
343 DECL_RTL (copy) = NULL_RTX;
345 /* These args would always appear unused, if not for this. */
346 TREE_USED (copy) = 1;
348 /* Set the context for the new declaration. */
349 if (!DECL_CONTEXT (decl))
350 /* Globals stay global. */
352 else if (DECL_CONTEXT (decl) != from_fn)
353 /* Things that weren't in the scope of the function we're inlining
354 from aren't in the scope we're inlining too, either. */
356 else if (TREE_STATIC (decl))
357 /* Function-scoped static variables should say in the original
361 /* Ordinary automatic local variables are now in the scope of the
363 DECL_CONTEXT (copy) = to_fn;
368 /* Make the insns and PARM_DECLs of the current function permanent
369 and record other information in DECL_SAVED_INSNS to allow inlining
370 of this function in subsequent calls.
372 This routine need not copy any insns because we are not going
373 to immediately compile the insns in the insn chain. There
374 are two cases when we would compile the insns for FNDECL:
375 (1) when FNDECL is expanded inline, and (2) when FNDECL needs to
376 be output at the end of other compilation, because somebody took
377 its address. In the first case, the insns of FNDECL are copied
378 as it is expanded inline, so FNDECL's saved insns are not
379 modified. In the second case, FNDECL is used for the last time,
380 so modifying the rtl is not a problem.
382 We don't have to worry about FNDECL being inline expanded by
383 other functions which are written at the end of compilation
384 because flag_no_inline is turned on when we begin writing
385 functions at the end of compilation. */
388 save_for_inline_nocopy (fndecl)
393 rtx first_nonparm_insn;
395 /* Set up PARMDECL_MAP which maps pseudo-reg number to its PARM_DECL.
396 Later we set TREE_READONLY to 0 if the parm is modified inside the fn.
397 Also set up ARG_VECTOR, which holds the unmodified DECL_RTX values
398 for the parms, prior to elimination of virtual registers.
399 These values are needed for substituting parms properly. */
401 parmdecl_map = (tree *) xmalloc (max_parm_reg * sizeof (tree));
403 /* Make and emit a return-label if we have not already done so. */
405 if (return_label == 0)
407 return_label = gen_label_rtx ();
408 emit_label (return_label);
411 argvec = initialize_for_inline (fndecl);
413 /* If there are insns that copy parms from the stack into pseudo registers,
414 those insns are not copied. `expand_inline_function' must
415 emit the correct code to handle such things. */
418 if (GET_CODE (insn) != NOTE)
421 /* Get the insn which signals the end of parameter setup code. */
422 first_nonparm_insn = get_first_nonparm_insn ();
424 /* Now just scan the chain of insns to see what happens to our
425 PARM_DECLs. If a PARM_DECL is used but never modified, we
426 can substitute its rtl directly when expanding inline (and
427 perform constant folding when its incoming value is constant).
428 Otherwise, we have to copy its value into a new register and track
429 the new register's life. */
430 in_nonparm_insns = 0;
431 save_parm_insns (insn, first_nonparm_insn);
433 /* We have now allocated all that needs to be allocated permanently
434 on the rtx obstack. Set our high-water mark, so that we
435 can free the rest of this when the time comes. */
439 cfun->inl_max_label_num = max_label_num ();
440 cfun->inl_last_parm_insn = cfun->x_last_parm_insn;
441 cfun->original_arg_vector = argvec;
442 cfun->original_decl_initial = DECL_INITIAL (fndecl);
443 DECL_SAVED_INSNS (fndecl) = cfun;
449 /* Scan the chain of insns to see what happens to our PARM_DECLs. If a
450 PARM_DECL is used but never modified, we can substitute its rtl directly
451 when expanding inline (and perform constant folding when its incoming
452 value is constant). Otherwise, we have to copy its value into a new
453 register and track the new register's life. */
456 save_parm_insns (insn, first_nonparm_insn)
458 rtx first_nonparm_insn;
460 if (insn == NULL_RTX)
463 for (insn = NEXT_INSN (insn); insn; insn = NEXT_INSN (insn))
465 if (insn == first_nonparm_insn)
466 in_nonparm_insns = 1;
468 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
470 /* Record what interesting things happen to our parameters. */
471 note_stores (PATTERN (insn), note_modified_parmregs, NULL);
473 /* If this is a CALL_PLACEHOLDER insn then we need to look into the
474 three attached sequences: normal call, sibling call and tail
476 if (GET_CODE (insn) == CALL_INSN
477 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
481 for (i = 0; i < 3; i++)
482 save_parm_insns (XEXP (PATTERN (insn), i),
489 /* Note whether a parameter is modified or not. */
492 note_modified_parmregs (reg, x, data)
494 rtx x ATTRIBUTE_UNUSED;
495 void *data ATTRIBUTE_UNUSED;
497 if (GET_CODE (reg) == REG && in_nonparm_insns
498 && REGNO (reg) < max_parm_reg
499 && REGNO (reg) >= FIRST_PSEUDO_REGISTER
500 && parmdecl_map[REGNO (reg)] != 0)
501 TREE_READONLY (parmdecl_map[REGNO (reg)]) = 0;
504 /* Unfortunately, we need a global copy of const_equiv map for communication
505 with a function called from note_stores. Be *very* careful that this
506 is used properly in the presence of recursion. */
508 varray_type global_const_equiv_varray;
510 #define FIXED_BASE_PLUS_P(X) \
511 (GET_CODE (X) == PLUS && GET_CODE (XEXP (X, 1)) == CONST_INT \
512 && GET_CODE (XEXP (X, 0)) == REG \
513 && REGNO (XEXP (X, 0)) >= FIRST_VIRTUAL_REGISTER \
514 && REGNO (XEXP (X, 0)) <= LAST_VIRTUAL_REGISTER)
516 /* Called to set up a mapping for the case where a parameter is in a
517 register. If it is read-only and our argument is a constant, set up the
518 constant equivalence.
520 If LOC is REG_USERVAR_P, the usual case, COPY must also have that flag set
523 Also, don't allow hard registers here; they might not be valid when
524 substituted into insns. */
526 process_reg_param (map, loc, copy)
527 struct inline_remap *map;
530 if ((GET_CODE (copy) != REG && GET_CODE (copy) != SUBREG)
531 || (GET_CODE (copy) == REG && REG_USERVAR_P (loc)
532 && ! REG_USERVAR_P (copy))
533 || (GET_CODE (copy) == REG
534 && REGNO (copy) < FIRST_PSEUDO_REGISTER))
536 rtx temp = copy_to_mode_reg (GET_MODE (loc), copy);
537 REG_USERVAR_P (temp) = REG_USERVAR_P (loc);
538 if (CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy))
539 SET_CONST_EQUIV_DATA (map, temp, copy, CONST_AGE_PARM);
542 map->reg_map[REGNO (loc)] = copy;
545 /* Used by duplicate_eh_handlers to map labels for the exception table */
546 static struct inline_remap *eif_eh_map;
549 expand_inline_function_eh_labelmap (label)
552 int index = CODE_LABEL_NUMBER (label);
553 return get_label_from_map (eif_eh_map, index);
556 /* Compare two BLOCKs for qsort. The key we sort on is the
557 BLOCK_ABSTRACT_ORIGIN of the blocks. */
560 compare_blocks (v1, v2)
564 tree b1 = *((const tree *) v1);
565 tree b2 = *((const tree *) v2);
567 return ((char *) BLOCK_ABSTRACT_ORIGIN (b1)
568 - (char *) BLOCK_ABSTRACT_ORIGIN (b2));
571 /* Compare two BLOCKs for bsearch. The first pointer corresponds to
572 an original block; the second to a remapped equivalent. */
579 const union tree_node *b1 = (const union tree_node *) v1;
580 tree b2 = *((const tree *) v2);
582 return ((const char *) b1 - (char *) BLOCK_ABSTRACT_ORIGIN (b2));
585 /* Integrate the procedure defined by FNDECL. Note that this function
586 may wind up calling itself. Since the static variables are not
587 reentrant, we do not assign them until after the possibility
588 of recursion is eliminated.
590 If IGNORE is nonzero, do not produce a value.
591 Otherwise store the value in TARGET if it is nonzero and that is convenient.
594 (rtx)-1 if we could not substitute the function
595 0 if we substituted it and it does not produce a value
596 else an rtx for where the value is stored. */
599 expand_inline_function (fndecl, parms, target, ignore, type,
600 structure_value_addr)
605 rtx structure_value_addr;
607 struct function *inlining_previous;
608 struct function *inl_f = DECL_SAVED_INSNS (fndecl);
609 tree formal, actual, block;
610 rtx parm_insns = inl_f->emit->x_first_insn;
611 rtx insns = (inl_f->inl_last_parm_insn
612 ? NEXT_INSN (inl_f->inl_last_parm_insn)
618 int min_labelno = inl_f->emit->x_first_label_num;
619 int max_labelno = inl_f->inl_max_label_num;
624 struct inline_remap *map = 0;
628 rtvec arg_vector = (rtvec) inl_f->original_arg_vector;
629 rtx static_chain_value = 0;
632 /* The pointer used to track the true location of the memory used
633 for MAP->LABEL_MAP. */
634 rtx *real_label_map = 0;
636 /* Allow for equivalences of the pseudos we make for virtual fp and ap. */
637 max_regno = inl_f->emit->x_reg_rtx_no + 3;
638 if (max_regno < FIRST_PSEUDO_REGISTER)
641 nargs = list_length (DECL_ARGUMENTS (fndecl));
643 if (cfun->preferred_stack_boundary < inl_f->preferred_stack_boundary)
644 cfun->preferred_stack_boundary = inl_f->preferred_stack_boundary;
646 /* Check that the parms type match and that sufficient arguments were
647 passed. Since the appropriate conversions or default promotions have
648 already been applied, the machine modes should match exactly. */
650 for (formal = DECL_ARGUMENTS (fndecl), actual = parms;
652 formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual))
655 enum machine_mode mode;
658 return (rtx) (HOST_WIDE_INT) -1;
660 arg = TREE_VALUE (actual);
661 mode = TYPE_MODE (DECL_ARG_TYPE (formal));
663 if (mode != TYPE_MODE (TREE_TYPE (arg))
664 /* If they are block mode, the types should match exactly.
665 They don't match exactly if TREE_TYPE (FORMAL) == ERROR_MARK_NODE,
666 which could happen if the parameter has incomplete type. */
668 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg))
669 != TYPE_MAIN_VARIANT (TREE_TYPE (formal)))))
670 return (rtx) (HOST_WIDE_INT) -1;
673 /* Extra arguments are valid, but will be ignored below, so we must
674 evaluate them here for side-effects. */
675 for (; actual; actual = TREE_CHAIN (actual))
676 expand_expr (TREE_VALUE (actual), const0_rtx,
677 TYPE_MODE (TREE_TYPE (TREE_VALUE (actual))), 0);
679 /* Expand the function arguments. Do this first so that any
680 new registers get created before we allocate the maps. */
682 arg_vals = (rtx *) xmalloc (nargs * sizeof (rtx));
683 arg_trees = (tree *) xmalloc (nargs * sizeof (tree));
685 for (formal = DECL_ARGUMENTS (fndecl), actual = parms, i = 0;
687 formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual), i++)
689 /* Actual parameter, converted to the type of the argument within the
691 tree arg = convert (TREE_TYPE (formal), TREE_VALUE (actual));
692 /* Mode of the variable used within the function. */
693 enum machine_mode mode = TYPE_MODE (TREE_TYPE (formal));
697 loc = RTVEC_ELT (arg_vector, i);
699 /* If this is an object passed by invisible reference, we copy the
700 object into a stack slot and save its address. If this will go
701 into memory, we do nothing now. Otherwise, we just expand the
703 if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG
704 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)
707 = assign_stack_temp (TYPE_MODE (TREE_TYPE (arg)),
708 int_size_in_bytes (TREE_TYPE (arg)), 1);
709 MEM_SET_IN_STRUCT_P (stack_slot,
710 AGGREGATE_TYPE_P (TREE_TYPE (arg)));
712 store_expr (arg, stack_slot, 0);
714 arg_vals[i] = XEXP (stack_slot, 0);
717 else if (GET_CODE (loc) != MEM)
719 if (GET_MODE (loc) != TYPE_MODE (TREE_TYPE (arg)))
720 /* The mode if LOC and ARG can differ if LOC was a variable
721 that had its mode promoted via PROMOTED_MODE. */
722 arg_vals[i] = convert_modes (GET_MODE (loc),
723 TYPE_MODE (TREE_TYPE (arg)),
724 expand_expr (arg, NULL_RTX, mode,
726 TREE_UNSIGNED (TREE_TYPE (formal)));
728 arg_vals[i] = expand_expr (arg, NULL_RTX, mode, EXPAND_SUM);
734 && (! TREE_READONLY (formal)
735 /* If the parameter is not read-only, copy our argument through
736 a register. Also, we cannot use ARG_VALS[I] if it overlaps
737 TARGET in any way. In the inline function, they will likely
738 be two different pseudos, and `safe_from_p' will make all
739 sorts of smart assumptions about their not conflicting.
740 But if ARG_VALS[I] overlaps TARGET, these assumptions are
741 wrong, so put ARG_VALS[I] into a fresh register.
742 Don't worry about invisible references, since their stack
743 temps will never overlap the target. */
746 && (GET_CODE (arg_vals[i]) == REG
747 || GET_CODE (arg_vals[i]) == SUBREG
748 || GET_CODE (arg_vals[i]) == MEM)
749 && reg_overlap_mentioned_p (arg_vals[i], target))
750 /* ??? We must always copy a SUBREG into a REG, because it might
751 get substituted into an address, and not all ports correctly
752 handle SUBREGs in addresses. */
753 || (GET_CODE (arg_vals[i]) == SUBREG)))
754 arg_vals[i] = copy_to_mode_reg (GET_MODE (loc), arg_vals[i]);
756 if (arg_vals[i] != 0 && GET_CODE (arg_vals[i]) == REG
757 && POINTER_TYPE_P (TREE_TYPE (formal)))
758 mark_reg_pointer (arg_vals[i],
759 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (formal))));
762 /* Allocate the structures we use to remap things. */
764 map = (struct inline_remap *) xmalloc (sizeof (struct inline_remap));
765 map->fndecl = fndecl;
767 VARRAY_TREE_INIT (map->block_map, 10, "block_map");
768 map->reg_map = (rtx *) xcalloc (max_regno, sizeof (rtx));
770 /* We used to use alloca here, but the size of what it would try to
771 allocate would occasionally cause it to exceed the stack limit and
772 cause unpredictable core dumps. */
774 = (rtx *) xmalloc ((max_labelno) * sizeof (rtx));
775 map->label_map = real_label_map;
777 inl_max_uid = (inl_f->emit->x_cur_insn_uid + 1);
778 map->insn_map = (rtx *) xcalloc (inl_max_uid, sizeof (rtx));
780 map->max_insnno = inl_max_uid;
782 map->integrating = 1;
784 /* const_equiv_varray maps pseudos in our routine to constants, so
785 it needs to be large enough for all our pseudos. This is the
786 number we are currently using plus the number in the called
787 routine, plus 15 for each arg, five to compute the virtual frame
788 pointer, and five for the return value. This should be enough
789 for most cases. We do not reference entries outside the range of
792 ??? These numbers are quite arbitrary and were obtained by
793 experimentation. At some point, we should try to allocate the
794 table after all the parameters are set up so we an more accurately
795 estimate the number of pseudos we will need. */
797 VARRAY_CONST_EQUIV_INIT (map->const_equiv_varray,
799 + (max_regno - FIRST_PSEUDO_REGISTER)
802 "expand_inline_function");
805 /* Record the current insn in case we have to set up pointers to frame
806 and argument memory blocks. If there are no insns yet, add a dummy
807 insn that can be used as an insertion point. */
808 map->insns_at_start = get_last_insn ();
809 if (map->insns_at_start == 0)
810 map->insns_at_start = emit_note (NULL_PTR, NOTE_INSN_DELETED);
812 map->regno_pointer_flag = inl_f->emit->regno_pointer_flag;
813 map->regno_pointer_align = inl_f->emit->regno_pointer_align;
815 /* Update the outgoing argument size to allow for those in the inlined
817 if (inl_f->outgoing_args_size > current_function_outgoing_args_size)
818 current_function_outgoing_args_size = inl_f->outgoing_args_size;
820 /* If the inline function needs to make PIC references, that means
821 that this function's PIC offset table must be used. */
822 if (inl_f->uses_pic_offset_table)
823 current_function_uses_pic_offset_table = 1;
825 /* If this function needs a context, set it up. */
826 if (inl_f->needs_context)
827 static_chain_value = lookup_static_chain (fndecl);
829 if (GET_CODE (parm_insns) == NOTE
830 && NOTE_LINE_NUMBER (parm_insns) > 0)
832 rtx note = emit_note (NOTE_SOURCE_FILE (parm_insns),
833 NOTE_LINE_NUMBER (parm_insns));
835 RTX_INTEGRATED_P (note) = 1;
838 /* Process each argument. For each, set up things so that the function's
839 reference to the argument will refer to the argument being passed.
840 We only replace REG with REG here. Any simplifications are done
843 We make two passes: In the first, we deal with parameters that will
844 be placed into registers, since we need to ensure that the allocated
845 register number fits in const_equiv_map. Then we store all non-register
846 parameters into their memory location. */
848 /* Don't try to free temp stack slots here, because we may put one of the
849 parameters into a temp stack slot. */
851 for (i = 0; i < nargs; i++)
853 rtx copy = arg_vals[i];
855 loc = RTVEC_ELT (arg_vector, i);
857 /* There are three cases, each handled separately. */
858 if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG
859 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)
861 /* This must be an object passed by invisible reference (it could
862 also be a variable-sized object, but we forbid inlining functions
863 with variable-sized arguments). COPY is the address of the
864 actual value (this computation will cause it to be copied). We
865 map that address for the register, noting the actual address as
866 an equivalent in case it can be substituted into the insns. */
868 if (GET_CODE (copy) != REG)
870 temp = copy_addr_to_reg (copy);
871 if (CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy))
872 SET_CONST_EQUIV_DATA (map, temp, copy, CONST_AGE_PARM);
875 map->reg_map[REGNO (XEXP (loc, 0))] = copy;
877 else if (GET_CODE (loc) == MEM)
879 /* This is the case of a parameter that lives in memory. It
880 will live in the block we allocate in the called routine's
881 frame that simulates the incoming argument area. Do nothing
882 with the parameter now; we will call store_expr later. In
883 this case, however, we must ensure that the virtual stack and
884 incoming arg rtx values are expanded now so that we can be
885 sure we have enough slots in the const equiv map since the
886 store_expr call can easily blow the size estimate. */
887 if (DECL_FRAME_SIZE (fndecl) != 0)
888 copy_rtx_and_substitute (virtual_stack_vars_rtx, map, 0);
890 if (DECL_SAVED_INSNS (fndecl)->args_size != 0)
891 copy_rtx_and_substitute (virtual_incoming_args_rtx, map, 0);
893 else if (GET_CODE (loc) == REG)
894 process_reg_param (map, loc, copy);
895 else if (GET_CODE (loc) == CONCAT)
897 rtx locreal = gen_realpart (GET_MODE (XEXP (loc, 0)), loc);
898 rtx locimag = gen_imagpart (GET_MODE (XEXP (loc, 0)), loc);
899 rtx copyreal = gen_realpart (GET_MODE (locreal), copy);
900 rtx copyimag = gen_imagpart (GET_MODE (locimag), copy);
902 process_reg_param (map, locreal, copyreal);
903 process_reg_param (map, locimag, copyimag);
909 /* Tell copy_rtx_and_substitute to handle constant pool SYMBOL_REFs
910 specially. This function can be called recursively, so we need to
911 save the previous value. */
912 inlining_previous = inlining;
915 /* Now do the parameters that will be placed in memory. */
917 for (formal = DECL_ARGUMENTS (fndecl), i = 0;
918 formal; formal = TREE_CHAIN (formal), i++)
920 loc = RTVEC_ELT (arg_vector, i);
922 if (GET_CODE (loc) == MEM
923 /* Exclude case handled above. */
924 && ! (GET_CODE (XEXP (loc, 0)) == REG
925 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER))
927 rtx note = emit_note (DECL_SOURCE_FILE (formal),
928 DECL_SOURCE_LINE (formal));
930 RTX_INTEGRATED_P (note) = 1;
932 /* Compute the address in the area we reserved and store the
934 temp = copy_rtx_and_substitute (loc, map, 1);
935 subst_constants (&temp, NULL_RTX, map, 1);
936 apply_change_group ();
937 if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0)))
938 temp = change_address (temp, VOIDmode, XEXP (temp, 0));
939 store_expr (arg_trees[i], temp, 0);
943 /* Deal with the places that the function puts its result.
944 We are driven by what is placed into DECL_RESULT.
946 Initially, we assume that we don't have anything special handling for
947 REG_FUNCTION_RETURN_VALUE_P. */
949 map->inline_target = 0;
950 loc = DECL_RTL (DECL_RESULT (fndecl));
952 if (TYPE_MODE (type) == VOIDmode)
953 /* There is no return value to worry about. */
955 else if (GET_CODE (loc) == MEM)
957 if (GET_CODE (XEXP (loc, 0)) == ADDRESSOF)
959 temp = copy_rtx_and_substitute (loc, map, 1);
960 subst_constants (&temp, NULL_RTX, map, 1);
961 apply_change_group ();
966 if (! structure_value_addr
967 || ! aggregate_value_p (DECL_RESULT (fndecl)))
970 /* Pass the function the address in which to return a structure
971 value. Note that a constructor can cause someone to call us
972 with STRUCTURE_VALUE_ADDR, but the initialization takes place
973 via the first parameter, rather than the struct return address.
975 We have two cases: If the address is a simple register
976 indirect, use the mapping mechanism to point that register to
977 our structure return address. Otherwise, store the structure
978 return value into the place that it will be referenced from. */
980 if (GET_CODE (XEXP (loc, 0)) == REG)
982 temp = force_operand (structure_value_addr, NULL_RTX);
983 temp = force_reg (Pmode, temp);
984 map->reg_map[REGNO (XEXP (loc, 0))] = temp;
986 if (CONSTANT_P (structure_value_addr)
987 || GET_CODE (structure_value_addr) == ADDRESSOF
988 || (GET_CODE (structure_value_addr) == PLUS
989 && (XEXP (structure_value_addr, 0)
990 == virtual_stack_vars_rtx)
991 && (GET_CODE (XEXP (structure_value_addr, 1))
994 SET_CONST_EQUIV_DATA (map, temp, structure_value_addr,
1000 temp = copy_rtx_and_substitute (loc, map, 1);
1001 subst_constants (&temp, NULL_RTX, map, 0);
1002 apply_change_group ();
1003 emit_move_insn (temp, structure_value_addr);
1008 /* We will ignore the result value, so don't look at its structure.
1009 Note that preparations for an aggregate return value
1010 do need to be made (above) even if it will be ignored. */
1012 else if (GET_CODE (loc) == REG)
1014 /* The function returns an object in a register and we use the return
1015 value. Set up our target for remapping. */
1017 /* Machine mode function was declared to return. */
1018 enum machine_mode departing_mode = TYPE_MODE (type);
1019 /* (Possibly wider) machine mode it actually computes
1020 (for the sake of callers that fail to declare it right).
1021 We have to use the mode of the result's RTL, rather than
1022 its type, since expand_function_start may have promoted it. */
1023 enum machine_mode arriving_mode
1024 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl)));
1027 /* Don't use MEMs as direct targets because on some machines
1028 substituting a MEM for a REG makes invalid insns.
1029 Let the combiner substitute the MEM if that is valid. */
1030 if (target == 0 || GET_CODE (target) != REG
1031 || GET_MODE (target) != departing_mode)
1033 /* Don't make BLKmode registers. If this looks like
1034 a BLKmode object being returned in a register, get
1035 the mode from that, otherwise abort. */
1036 if (departing_mode == BLKmode)
1038 if (REG == GET_CODE (DECL_RTL (DECL_RESULT (fndecl))))
1040 departing_mode = GET_MODE (DECL_RTL (DECL_RESULT (fndecl)));
1041 arriving_mode = departing_mode;
1047 target = gen_reg_rtx (departing_mode);
1050 /* If function's value was promoted before return,
1051 avoid machine mode mismatch when we substitute INLINE_TARGET.
1052 But TARGET is what we will return to the caller. */
1053 if (arriving_mode != departing_mode)
1055 /* Avoid creating a paradoxical subreg wider than
1056 BITS_PER_WORD, since that is illegal. */
1057 if (GET_MODE_BITSIZE (arriving_mode) > BITS_PER_WORD)
1059 if (!TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (departing_mode),
1060 GET_MODE_BITSIZE (arriving_mode)))
1061 /* Maybe could be handled by using convert_move () ? */
1063 reg_to_map = gen_reg_rtx (arriving_mode);
1064 target = gen_lowpart (departing_mode, reg_to_map);
1067 reg_to_map = gen_rtx_SUBREG (arriving_mode, target, 0);
1070 reg_to_map = target;
1072 /* Usually, the result value is the machine's return register.
1073 Sometimes it may be a pseudo. Handle both cases. */
1074 if (REG_FUNCTION_VALUE_P (loc))
1075 map->inline_target = reg_to_map;
1077 map->reg_map[REGNO (loc)] = reg_to_map;
1082 /* Initialize label_map. get_label_from_map will actually make
1084 bzero ((char *) &map->label_map [min_labelno],
1085 (max_labelno - min_labelno) * sizeof (rtx));
1087 /* Make copies of the decls of the symbols in the inline function, so that
1088 the copies of the variables get declared in the current function. Set
1089 up things so that lookup_static_chain knows that to interpret registers
1090 in SAVE_EXPRs for TYPE_SIZEs as local. */
1091 inline_function_decl = fndecl;
1092 integrate_parm_decls (DECL_ARGUMENTS (fndecl), map, arg_vector);
1093 block = integrate_decl_tree (inl_f->original_decl_initial, map);
1094 BLOCK_ABSTRACT_ORIGIN (block) = DECL_ORIGIN (fndecl);
1095 inline_function_decl = 0;
1097 /* Make a fresh binding contour that we can easily remove. Do this after
1098 expanding our arguments so cleanups are properly scoped. */
1099 expand_start_bindings_and_block (0, block);
1101 /* Sort the block-map so that it will be easy to find remapped
1103 qsort (&VARRAY_TREE (map->block_map, 0),
1104 map->block_map->elements_used,
1108 /* Perform postincrements before actually calling the function. */
1111 /* Clean up stack so that variables might have smaller offsets. */
1112 do_pending_stack_adjust ();
1114 /* Save a copy of the location of const_equiv_varray for
1115 mark_stores, called via note_stores. */
1116 global_const_equiv_varray = map->const_equiv_varray;
1118 /* If the called function does an alloca, save and restore the
1119 stack pointer around the call. This saves stack space, but
1120 also is required if this inline is being done between two
1122 if (inl_f->calls_alloca)
1123 emit_stack_save (SAVE_BLOCK, &stack_save, NULL_RTX);
1125 /* Now copy the insns one by one. */
1126 copy_insn_list (insns, map, static_chain_value);
1128 /* Restore the stack pointer if we saved it above. */
1129 if (inl_f->calls_alloca)
1130 emit_stack_restore (SAVE_BLOCK, stack_save, NULL_RTX);
1132 if (! cfun->x_whole_function_mode_p)
1133 /* In statement-at-a-time mode, we just tell the front-end to add
1134 this block to the list of blocks at this binding level. We
1135 can't do it the way it's done for function-at-a-time mode the
1136 superblocks have not been created yet. */
1137 insert_block (block);
1141 = BLOCK_CHAIN (DECL_INITIAL (current_function_decl));
1142 BLOCK_CHAIN (DECL_INITIAL (current_function_decl)) = block;
1145 /* End the scope containing the copied formal parameter variables
1146 and copied LABEL_DECLs. We pass NULL_TREE for the variables list
1147 here so that expand_end_bindings will not check for unused
1148 variables. That's already been checked for when the inlined
1149 function was defined. */
1150 expand_end_bindings (NULL_TREE, 1, 1);
1152 /* Must mark the line number note after inlined functions as a repeat, so
1153 that the test coverage code can avoid counting the call twice. This
1154 just tells the code to ignore the immediately following line note, since
1155 there already exists a copy of this note before the expanded inline call.
1156 This line number note is still needed for debugging though, so we can't
1158 if (flag_test_coverage)
1159 emit_note (0, NOTE_REPEATED_LINE_NUMBER);
1161 emit_line_note (input_filename, lineno);
1163 /* If the function returns a BLKmode object in a register, copy it
1164 out of the temp register into a BLKmode memory object. */
1166 && TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl))) == BLKmode
1167 && ! aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl))))
1168 target = copy_blkmode_from_reg (0, target, TREE_TYPE (TREE_TYPE (fndecl)));
1170 if (structure_value_addr)
1172 target = gen_rtx_MEM (TYPE_MODE (type),
1173 memory_address (TYPE_MODE (type),
1174 structure_value_addr));
1175 MEM_SET_IN_STRUCT_P (target, 1);
1178 /* Make sure we free the things we explicitly allocated with xmalloc. */
1180 free (real_label_map);
1181 VARRAY_FREE (map->const_equiv_varray);
1182 free (map->reg_map);
1183 VARRAY_FREE (map->block_map);
1184 free (map->insn_map);
1189 inlining = inlining_previous;
1194 /* Make copies of each insn in the given list using the mapping
1195 computed in expand_inline_function. This function may call itself for
1196 insns containing sequences.
1198 Copying is done in two passes, first the insns and then their REG_NOTES,
1199 just like save_for_inline.
1201 If static_chain_value is non-zero, it represents the context-pointer
1202 register for the function. */
1205 copy_insn_list (insns, map, static_chain_value)
1207 struct inline_remap *map;
1208 rtx static_chain_value;
1213 rtx local_return_label = NULL_RTX;
1218 /* Copy the insns one by one. Do this in two passes, first the insns and
1219 then their REG_NOTES, just like save_for_inline. */
1221 /* This loop is very similar to the loop in copy_loop_body in unroll.c. */
1223 for (insn = insns; insn; insn = NEXT_INSN (insn))
1225 rtx copy, pattern, set;
1227 map->orig_asm_operands_vector = 0;
1229 switch (GET_CODE (insn))
1232 pattern = PATTERN (insn);
1233 set = single_set (insn);
1235 if (GET_CODE (pattern) == USE
1236 && GET_CODE (XEXP (pattern, 0)) == REG
1237 && REG_FUNCTION_VALUE_P (XEXP (pattern, 0)))
1238 /* The (USE (REG n)) at return from the function should
1239 be ignored since we are changing (REG n) into
1243 /* If the inline fn needs eh context, make sure that
1244 the current fn has one. */
1245 if (GET_CODE (pattern) == USE
1246 && find_reg_note (insn, REG_EH_CONTEXT, 0) != 0)
1249 /* Ignore setting a function value that we don't want to use. */
1250 if (map->inline_target == 0
1252 && GET_CODE (SET_DEST (set)) == REG
1253 && REG_FUNCTION_VALUE_P (SET_DEST (set)))
1255 if (volatile_refs_p (SET_SRC (set)))
1259 /* If we must not delete the source,
1260 load it into a new temporary. */
1261 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1263 new_set = single_set (copy);
1268 = gen_reg_rtx (GET_MODE (SET_DEST (new_set)));
1270 /* If the source and destination are the same and it
1271 has a note on it, keep the insn. */
1272 else if (rtx_equal_p (SET_DEST (set), SET_SRC (set))
1273 && REG_NOTES (insn) != 0)
1274 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1279 /* If this is setting the static chain rtx, omit it. */
1280 else if (static_chain_value != 0
1282 && GET_CODE (SET_DEST (set)) == REG
1283 && rtx_equal_p (SET_DEST (set),
1284 static_chain_incoming_rtx))
1287 /* If this is setting the static chain pseudo, set it from
1288 the value we want to give it instead. */
1289 else if (static_chain_value != 0
1291 && rtx_equal_p (SET_SRC (set),
1292 static_chain_incoming_rtx))
1294 rtx newdest = copy_rtx_and_substitute (SET_DEST (set), map, 1);
1296 copy = emit_move_insn (newdest, static_chain_value);
1297 static_chain_value = 0;
1300 /* If this is setting the virtual stack vars register, this must
1301 be the code at the handler for a builtin longjmp. The value
1302 saved in the setjmp buffer will be the address of the frame
1303 we've made for this inlined instance within our frame. But we
1304 know the offset of that value so we can use it to reconstruct
1305 our virtual stack vars register from that value. If we are
1306 copying it from the stack pointer, leave it unchanged. */
1308 && rtx_equal_p (SET_DEST (set), virtual_stack_vars_rtx))
1310 HOST_WIDE_INT offset;
1311 temp = map->reg_map[REGNO (SET_DEST (set))];
1312 temp = VARRAY_CONST_EQUIV (map->const_equiv_varray,
1315 if (rtx_equal_p (temp, virtual_stack_vars_rtx))
1317 else if (GET_CODE (temp) == PLUS
1318 && rtx_equal_p (XEXP (temp, 0), virtual_stack_vars_rtx)
1319 && GET_CODE (XEXP (temp, 1)) == CONST_INT)
1320 offset = INTVAL (XEXP (temp, 1));
1324 if (rtx_equal_p (SET_SRC (set), stack_pointer_rtx))
1325 temp = SET_SRC (set);
1327 temp = force_operand (plus_constant (SET_SRC (set),
1331 copy = emit_move_insn (virtual_stack_vars_rtx, temp);
1335 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1336 /* REG_NOTES will be copied later. */
1339 /* If this insn is setting CC0, it may need to look at
1340 the insn that uses CC0 to see what type of insn it is.
1341 In that case, the call to recog via validate_change will
1342 fail. So don't substitute constants here. Instead,
1343 do it when we emit the following insn.
1345 For example, see the pyr.md file. That machine has signed and
1346 unsigned compares. The compare patterns must check the
1347 following branch insn to see which what kind of compare to
1350 If the previous insn set CC0, substitute constants on it as
1352 if (sets_cc0_p (PATTERN (copy)) != 0)
1357 try_constants (cc0_insn, map);
1359 try_constants (copy, map);
1362 try_constants (copy, map);
1367 if (GET_CODE (PATTERN (insn)) == RETURN
1368 || (GET_CODE (PATTERN (insn)) == PARALLEL
1369 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == RETURN))
1371 if (local_return_label == 0)
1372 local_return_label = gen_label_rtx ();
1373 pattern = gen_jump (local_return_label);
1376 pattern = copy_rtx_and_substitute (PATTERN (insn), map, 0);
1378 copy = emit_jump_insn (pattern);
1382 try_constants (cc0_insn, map);
1385 try_constants (copy, map);
1387 /* If this used to be a conditional jump insn but whose branch
1388 direction is now know, we must do something special. */
1389 if (condjump_p (insn) && ! simplejump_p (insn) && map->last_pc_value)
1392 /* If the previous insn set cc0 for us, delete it. */
1393 if (sets_cc0_p (PREV_INSN (copy)))
1394 delete_insn (PREV_INSN (copy));
1397 /* If this is now a no-op, delete it. */
1398 if (map->last_pc_value == pc_rtx)
1404 /* Otherwise, this is unconditional jump so we must put a
1405 BARRIER after it. We could do some dead code elimination
1406 here, but jump.c will do it just as well. */
1412 /* If this is a CALL_PLACEHOLDER insn then we need to copy the
1413 three attached sequences: normal call, sibling call and tail
1415 if (GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
1420 for (i = 0; i < 3; i++)
1424 sequence[i] = NULL_RTX;
1425 seq = XEXP (PATTERN (insn), i);
1429 copy_insn_list (seq, map, static_chain_value);
1430 sequence[i] = get_insns ();
1435 /* Find the new tail recursion label.
1436 It will already be substituted into sequence[2]. */
1437 tail_label = copy_rtx_and_substitute (XEXP (PATTERN (insn), 3),
1440 copy = emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode,
1448 pattern = copy_rtx_and_substitute (PATTERN (insn), map, 0);
1449 copy = emit_call_insn (pattern);
1451 SIBLING_CALL_P (copy) = SIBLING_CALL_P (insn);
1453 /* Because the USAGE information potentially contains objects other
1454 than hard registers, we need to copy it. */
1456 CALL_INSN_FUNCTION_USAGE (copy)
1457 = copy_rtx_and_substitute (CALL_INSN_FUNCTION_USAGE (insn),
1462 try_constants (cc0_insn, map);
1465 try_constants (copy, map);
1467 /* Be lazy and assume CALL_INSNs clobber all hard registers. */
1468 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1469 VARRAY_CONST_EQUIV (map->const_equiv_varray, i).rtx = 0;
1473 copy = emit_label (get_label_from_map (map,
1474 CODE_LABEL_NUMBER (insn)));
1475 LABEL_NAME (copy) = LABEL_NAME (insn);
1480 copy = emit_barrier ();
1484 /* NOTE_INSN_FUNCTION_END and NOTE_INSN_FUNCTION_BEG are
1485 discarded because it is important to have only one of
1486 each in the current function.
1488 NOTE_INSN_DELETED notes aren't useful (save_for_inline
1489 deleted these in the copy used for continuing compilation,
1490 not the copy used for inlining).
1492 NOTE_INSN_BASIC_BLOCK is discarded because the saved bb
1493 pointer (which will soon be dangling) confuses flow's
1494 attempts to preserve bb structures during the compilation
1497 if (NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_END
1498 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_BEG
1499 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_DELETED
1500 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_BASIC_BLOCK)
1502 copy = emit_note (NOTE_SOURCE_FILE (insn),
1503 NOTE_LINE_NUMBER (insn));
1505 && (NOTE_LINE_NUMBER (copy) == NOTE_INSN_EH_REGION_BEG
1506 || NOTE_LINE_NUMBER (copy) == NOTE_INSN_EH_REGION_END))
1509 = get_label_from_map (map, NOTE_EH_HANDLER (copy));
1511 /* we have to duplicate the handlers for the original */
1512 if (NOTE_LINE_NUMBER (copy) == NOTE_INSN_EH_REGION_BEG)
1514 /* We need to duplicate the handlers for the EH region
1515 and we need to indicate where the label map is */
1517 duplicate_eh_handlers (NOTE_EH_HANDLER (copy),
1518 CODE_LABEL_NUMBER (label),
1519 expand_inline_function_eh_labelmap);
1522 /* We have to forward these both to match the new exception
1524 NOTE_EH_HANDLER (copy) = CODE_LABEL_NUMBER (label);
1527 && (NOTE_LINE_NUMBER (copy) == NOTE_INSN_BLOCK_BEG
1528 || NOTE_LINE_NUMBER (copy) == NOTE_INSN_BLOCK_END)
1529 && NOTE_BLOCK (insn))
1531 tree *mapped_block_p;
1534 = (tree *) bsearch (NOTE_BLOCK (insn),
1535 &VARRAY_TREE (map->block_map, 0),
1536 map->block_map->elements_used,
1540 if (!mapped_block_p)
1543 NOTE_BLOCK (copy) = *mapped_block_p;
1555 RTX_INTEGRATED_P (copy) = 1;
1557 map->insn_map[INSN_UID (insn)] = copy;
1560 /* Now copy the REG_NOTES. Increment const_age, so that only constants
1561 from parameters can be substituted in. These are the only ones that
1562 are valid across the entire function. */
1564 for (insn = insns; insn; insn = NEXT_INSN (insn))
1565 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i'
1566 && map->insn_map[INSN_UID (insn)]
1567 && REG_NOTES (insn))
1569 rtx tem = copy_rtx_and_substitute (REG_NOTES (insn), map, 0);
1571 /* We must also do subst_constants, in case one of our parameters
1572 has const type and constant value. */
1573 subst_constants (&tem, NULL_RTX, map, 0);
1574 apply_change_group ();
1575 REG_NOTES (map->insn_map[INSN_UID (insn)]) = tem;
1578 if (local_return_label)
1579 emit_label (local_return_label);
1582 /* Given a chain of PARM_DECLs, ARGS, copy each decl into a VAR_DECL,
1583 push all of those decls and give each one the corresponding home. */
1586 integrate_parm_decls (args, map, arg_vector)
1588 struct inline_remap *map;
1594 for (tail = args, i = 0; tail; tail = TREE_CHAIN (tail), i++)
1596 tree decl = copy_decl_for_inlining (tail, map->fndecl,
1597 current_function_decl);
1599 = copy_rtx_and_substitute (RTVEC_ELT (arg_vector, i), map, 1);
1601 /* We really should be setting DECL_INCOMING_RTL to something reasonable
1602 here, but that's going to require some more work. */
1603 /* DECL_INCOMING_RTL (decl) = ?; */
1604 /* Fully instantiate the address with the equivalent form so that the
1605 debugging information contains the actual register, instead of the
1606 virtual register. Do this by not passing an insn to
1608 subst_constants (&new_decl_rtl, NULL_RTX, map, 1);
1609 apply_change_group ();
1610 DECL_RTL (decl) = new_decl_rtl;
1614 /* Given a BLOCK node LET, push decls and levels so as to construct in the
1615 current function a tree of contexts isomorphic to the one that is given.
1617 MAP, if nonzero, is a pointer to an inline_remap map which indicates how
1618 registers used in the DECL_RTL field should be remapped. If it is zero,
1619 no mapping is necessary. */
1622 integrate_decl_tree (let, map)
1624 struct inline_remap *map;
1630 new_block = make_node (BLOCK);
1631 VARRAY_PUSH_TREE (map->block_map, new_block);
1632 next = &BLOCK_VARS (new_block);
1634 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
1638 push_obstacks_nochange ();
1639 saveable_allocation ();
1640 d = copy_decl_for_inlining (t, map->fndecl, current_function_decl);
1643 if (DECL_RTL (t) != 0)
1645 DECL_RTL (d) = copy_rtx_and_substitute (DECL_RTL (t), map, 1);
1647 /* Fully instantiate the address with the equivalent form so that the
1648 debugging information contains the actual register, instead of the
1649 virtual register. Do this by not passing an insn to
1651 subst_constants (&DECL_RTL (d), NULL_RTX, map, 1);
1652 apply_change_group ();
1655 /* Add this declaration to the list of variables in the new
1658 next = &TREE_CHAIN (d);
1661 next = &BLOCK_SUBBLOCKS (new_block);
1662 for (t = BLOCK_SUBBLOCKS (let); t; t = BLOCK_CHAIN (t))
1664 *next = integrate_decl_tree (t, map);
1665 BLOCK_SUPERCONTEXT (*next) = new_block;
1666 next = &BLOCK_CHAIN (*next);
1669 TREE_USED (new_block) = TREE_USED (let);
1670 BLOCK_ABSTRACT_ORIGIN (new_block) = let;
1675 /* Create a new copy of an rtx. Recursively copies the operands of the rtx,
1676 except for those few rtx codes that are sharable.
1678 We always return an rtx that is similar to that incoming rtx, with the
1679 exception of possibly changing a REG to a SUBREG or vice versa. No
1680 rtl is ever emitted.
1682 If FOR_LHS is nonzero, if means we are processing something that will
1683 be the LHS of a SET. In that case, we copy RTX_UNCHANGING_P even if
1684 inlining since we need to be conservative in how it is set for
1687 Handle constants that need to be placed in the constant pool by
1688 calling `force_const_mem'. */
1691 copy_rtx_and_substitute (orig, map, for_lhs)
1693 struct inline_remap *map;
1696 register rtx copy, temp;
1698 register RTX_CODE code;
1699 register enum machine_mode mode;
1700 register const char *format_ptr;
1706 code = GET_CODE (orig);
1707 mode = GET_MODE (orig);
1712 /* If the stack pointer register shows up, it must be part of
1713 stack-adjustments (*not* because we eliminated the frame pointer!).
1714 Small hard registers are returned as-is. Pseudo-registers
1715 go through their `reg_map'. */
1716 regno = REGNO (orig);
1717 if (regno <= LAST_VIRTUAL_REGISTER
1718 || (map->integrating
1719 && DECL_SAVED_INSNS (map->fndecl)->internal_arg_pointer == orig))
1721 /* Some hard registers are also mapped,
1722 but others are not translated. */
1723 if (map->reg_map[regno] != 0)
1724 return map->reg_map[regno];
1726 /* If this is the virtual frame pointer, make space in current
1727 function's stack frame for the stack frame of the inline function.
1729 Copy the address of this area into a pseudo. Map
1730 virtual_stack_vars_rtx to this pseudo and set up a constant
1731 equivalence for it to be the address. This will substitute the
1732 address into insns where it can be substituted and use the new
1733 pseudo where it can't. */
1734 if (regno == VIRTUAL_STACK_VARS_REGNUM)
1737 int size = get_func_frame_size (DECL_SAVED_INSNS (map->fndecl));
1738 #ifdef FRAME_GROWS_DOWNWARD
1740 = (DECL_SAVED_INSNS (map->fndecl)->stack_alignment_needed
1743 /* In this case, virtual_stack_vars_rtx points to one byte
1744 higher than the top of the frame area. So make sure we
1745 allocate a big enough chunk to keep the frame pointer
1746 aligned like a real one. */
1748 size = CEIL_ROUND (size, alignment);
1751 loc = assign_stack_temp (BLKmode, size, 1);
1752 loc = XEXP (loc, 0);
1753 #ifdef FRAME_GROWS_DOWNWARD
1754 /* In this case, virtual_stack_vars_rtx points to one byte
1755 higher than the top of the frame area. So compute the offset
1756 to one byte higher than our substitute frame. */
1757 loc = plus_constant (loc, size);
1759 map->reg_map[regno] = temp
1760 = force_reg (Pmode, force_operand (loc, NULL_RTX));
1762 #ifdef STACK_BOUNDARY
1763 mark_reg_pointer (map->reg_map[regno], STACK_BOUNDARY);
1766 SET_CONST_EQUIV_DATA (map, temp, loc, CONST_AGE_PARM);
1768 seq = gen_sequence ();
1770 emit_insn_after (seq, map->insns_at_start);
1773 else if (regno == VIRTUAL_INCOMING_ARGS_REGNUM
1774 || (map->integrating
1775 && (DECL_SAVED_INSNS (map->fndecl)->internal_arg_pointer
1778 /* Do the same for a block to contain any arguments referenced
1781 int size = DECL_SAVED_INSNS (map->fndecl)->args_size;
1784 loc = assign_stack_temp (BLKmode, size, 1);
1785 loc = XEXP (loc, 0);
1786 /* When arguments grow downward, the virtual incoming
1787 args pointer points to the top of the argument block,
1788 so the remapped location better do the same. */
1789 #ifdef ARGS_GROW_DOWNWARD
1790 loc = plus_constant (loc, size);
1792 map->reg_map[regno] = temp
1793 = force_reg (Pmode, force_operand (loc, NULL_RTX));
1795 #ifdef STACK_BOUNDARY
1796 mark_reg_pointer (map->reg_map[regno], STACK_BOUNDARY);
1799 SET_CONST_EQUIV_DATA (map, temp, loc, CONST_AGE_PARM);
1801 seq = gen_sequence ();
1803 emit_insn_after (seq, map->insns_at_start);
1806 else if (REG_FUNCTION_VALUE_P (orig))
1808 /* This is a reference to the function return value. If
1809 the function doesn't have a return value, error. If the
1810 mode doesn't agree, and it ain't BLKmode, make a SUBREG. */
1811 if (map->inline_target == 0)
1812 /* Must be unrolling loops or replicating code if we
1813 reach here, so return the register unchanged. */
1815 else if (GET_MODE (map->inline_target) != BLKmode
1816 && mode != GET_MODE (map->inline_target))
1817 return gen_lowpart (mode, map->inline_target);
1819 return map->inline_target;
1823 if (map->reg_map[regno] == NULL)
1825 map->reg_map[regno] = gen_reg_rtx (mode);
1826 REG_USERVAR_P (map->reg_map[regno]) = REG_USERVAR_P (orig);
1827 REG_LOOP_TEST_P (map->reg_map[regno]) = REG_LOOP_TEST_P (orig);
1828 RTX_UNCHANGING_P (map->reg_map[regno]) = RTX_UNCHANGING_P (orig);
1829 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
1831 if (map->regno_pointer_flag[regno])
1832 mark_reg_pointer (map->reg_map[regno],
1833 map->regno_pointer_align[regno]);
1835 return map->reg_map[regno];
1838 copy = copy_rtx_and_substitute (SUBREG_REG (orig), map, for_lhs);
1839 /* SUBREG is ordinary, but don't make nested SUBREGs. */
1840 if (GET_CODE (copy) == SUBREG)
1841 return gen_rtx_SUBREG (GET_MODE (orig), SUBREG_REG (copy),
1842 SUBREG_WORD (orig) + SUBREG_WORD (copy));
1843 else if (GET_CODE (copy) == CONCAT)
1845 rtx retval = subreg_realpart_p (orig) ? XEXP (copy, 0) : XEXP (copy, 1);
1847 if (GET_MODE (retval) == GET_MODE (orig))
1850 return gen_rtx_SUBREG (GET_MODE (orig), retval,
1851 (SUBREG_WORD (orig) %
1852 (GET_MODE_UNIT_SIZE (GET_MODE (SUBREG_REG (orig)))
1853 / (unsigned) UNITS_PER_WORD)));
1856 return gen_rtx_SUBREG (GET_MODE (orig), copy,
1857 SUBREG_WORD (orig));
1860 copy = gen_rtx_ADDRESSOF (mode,
1861 copy_rtx_and_substitute (XEXP (orig, 0),
1863 0, ADDRESSOF_DECL(orig));
1864 regno = ADDRESSOF_REGNO (orig);
1865 if (map->reg_map[regno])
1866 regno = REGNO (map->reg_map[regno]);
1867 else if (regno > LAST_VIRTUAL_REGISTER)
1869 temp = XEXP (orig, 0);
1870 map->reg_map[regno] = gen_reg_rtx (GET_MODE (temp));
1871 REG_USERVAR_P (map->reg_map[regno]) = REG_USERVAR_P (temp);
1872 REG_LOOP_TEST_P (map->reg_map[regno]) = REG_LOOP_TEST_P (temp);
1873 RTX_UNCHANGING_P (map->reg_map[regno]) = RTX_UNCHANGING_P (temp);
1874 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
1876 if (map->regno_pointer_flag[regno])
1877 mark_reg_pointer (map->reg_map[regno],
1878 map->regno_pointer_align[regno]);
1879 regno = REGNO (map->reg_map[regno]);
1881 ADDRESSOF_REGNO (copy) = regno;
1886 /* USE and CLOBBER are ordinary, but we convert (use (subreg foo))
1887 to (use foo) if the original insn didn't have a subreg.
1888 Removing the subreg distorts the VAX movstrhi pattern
1889 by changing the mode of an operand. */
1890 copy = copy_rtx_and_substitute (XEXP (orig, 0), map, code == CLOBBER);
1891 if (GET_CODE (copy) == SUBREG && GET_CODE (XEXP (orig, 0)) != SUBREG)
1892 copy = SUBREG_REG (copy);
1893 return gen_rtx_fmt_e (code, VOIDmode, copy);
1896 LABEL_PRESERVE_P (get_label_from_map (map, CODE_LABEL_NUMBER (orig)))
1897 = LABEL_PRESERVE_P (orig);
1898 return get_label_from_map (map, CODE_LABEL_NUMBER (orig));
1900 /* We need to handle "deleted" labels that appear in the DECL_RTL
1903 if (NOTE_LINE_NUMBER (orig) == NOTE_INSN_DELETED_LABEL)
1904 return map->insn_map[INSN_UID (orig)];
1911 LABEL_REF_NONLOCAL_P (orig) ? XEXP (orig, 0)
1912 : get_label_from_map (map, CODE_LABEL_NUMBER (XEXP (orig, 0))));
1914 LABEL_OUTSIDE_LOOP_P (copy) = LABEL_OUTSIDE_LOOP_P (orig);
1916 /* The fact that this label was previously nonlocal does not mean
1917 it still is, so we must check if it is within the range of
1918 this function's labels. */
1919 LABEL_REF_NONLOCAL_P (copy)
1920 = (LABEL_REF_NONLOCAL_P (orig)
1921 && ! (CODE_LABEL_NUMBER (XEXP (copy, 0)) >= get_first_label_num ()
1922 && CODE_LABEL_NUMBER (XEXP (copy, 0)) < max_label_num ()));
1924 /* If we have made a nonlocal label local, it means that this
1925 inlined call will be referring to our nonlocal goto handler.
1926 So make sure we create one for this block; we normally would
1927 not since this is not otherwise considered a "call". */
1928 if (LABEL_REF_NONLOCAL_P (orig) && ! LABEL_REF_NONLOCAL_P (copy))
1929 function_call_count++;
1939 /* Symbols which represent the address of a label stored in the constant
1940 pool must be modified to point to a constant pool entry for the
1941 remapped label. Otherwise, symbols are returned unchanged. */
1942 if (CONSTANT_POOL_ADDRESS_P (orig))
1944 struct function *f = inlining ? inlining : cfun;
1945 rtx constant = get_pool_constant_for_function (f, orig);
1946 enum machine_mode const_mode = get_pool_mode_for_function (f, orig);
1949 rtx temp = force_const_mem (const_mode,
1950 copy_rtx_and_substitute (constant,
1954 /* Legitimizing the address here is incorrect.
1956 Since we had a SYMBOL_REF before, we can assume it is valid
1957 to have one in this position in the insn.
1959 Also, change_address may create new registers. These
1960 registers will not have valid reg_map entries. This can
1961 cause try_constants() to fail because assumes that all
1962 registers in the rtx have valid reg_map entries, and it may
1963 end up replacing one of these new registers with junk. */
1965 if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0)))
1966 temp = change_address (temp, GET_MODE (temp), XEXP (temp, 0));
1969 temp = XEXP (temp, 0);
1971 #ifdef POINTERS_EXTEND_UNSIGNED
1972 if (GET_MODE (temp) != GET_MODE (orig))
1973 temp = convert_memory_address (GET_MODE (orig), temp);
1977 else if (GET_CODE (constant) == LABEL_REF)
1978 return XEXP (force_const_mem
1980 copy_rtx_and_substitute (constant, map, for_lhs)),
1984 if (SYMBOL_REF_NEED_ADJUST (orig))
1987 return rethrow_symbol_map (orig,
1988 expand_inline_function_eh_labelmap);
1994 /* We have to make a new copy of this CONST_DOUBLE because don't want
1995 to use the old value of CONST_DOUBLE_MEM. Also, this may be a
1996 duplicate of a CONST_DOUBLE we have already seen. */
1997 if (GET_MODE_CLASS (GET_MODE (orig)) == MODE_FLOAT)
2001 REAL_VALUE_FROM_CONST_DOUBLE (d, orig);
2002 return CONST_DOUBLE_FROM_REAL_VALUE (d, GET_MODE (orig));
2005 return immed_double_const (CONST_DOUBLE_LOW (orig),
2006 CONST_DOUBLE_HIGH (orig), VOIDmode);
2009 /* Make new constant pool entry for a constant
2010 that was in the pool of the inline function. */
2011 if (RTX_INTEGRATED_P (orig))
2016 /* If a single asm insn contains multiple output operands
2017 then it contains multiple ASM_OPERANDS rtx's that share operand 3.
2018 We must make sure that the copied insn continues to share it. */
2019 if (map->orig_asm_operands_vector == XVEC (orig, 3))
2021 copy = rtx_alloc (ASM_OPERANDS);
2022 copy->volatil = orig->volatil;
2023 XSTR (copy, 0) = XSTR (orig, 0);
2024 XSTR (copy, 1) = XSTR (orig, 1);
2025 XINT (copy, 2) = XINT (orig, 2);
2026 XVEC (copy, 3) = map->copy_asm_operands_vector;
2027 XVEC (copy, 4) = map->copy_asm_constraints_vector;
2028 XSTR (copy, 5) = XSTR (orig, 5);
2029 XINT (copy, 6) = XINT (orig, 6);
2035 /* This is given special treatment because the first
2036 operand of a CALL is a (MEM ...) which may get
2037 forced into a register for cse. This is undesirable
2038 if function-address cse isn't wanted or if we won't do cse. */
2039 #ifndef NO_FUNCTION_CSE
2040 if (! (optimize && ! flag_no_function_cse))
2045 gen_rtx_MEM (GET_MODE (XEXP (orig, 0)),
2046 copy_rtx_and_substitute (XEXP (XEXP (orig, 0), 0),
2048 copy_rtx_and_substitute (XEXP (orig, 1), map, 0));
2052 /* Must be ifdefed out for loop unrolling to work. */
2058 /* If this is setting fp or ap, it means that we have a nonlocal goto.
2059 Adjust the setting by the offset of the area we made.
2060 If the nonlocal goto is into the current function,
2061 this will result in unnecessarily bad code, but should work. */
2062 if (SET_DEST (orig) == virtual_stack_vars_rtx
2063 || SET_DEST (orig) == virtual_incoming_args_rtx)
2065 /* In case a translation hasn't occurred already, make one now. */
2068 HOST_WIDE_INT loc_offset;
2070 copy_rtx_and_substitute (SET_DEST (orig), map, for_lhs);
2071 equiv_reg = map->reg_map[REGNO (SET_DEST (orig))];
2072 equiv_loc = VARRAY_CONST_EQUIV (map->const_equiv_varray,
2073 REGNO (equiv_reg)).rtx;
2075 = GET_CODE (equiv_loc) == REG ? 0 : INTVAL (XEXP (equiv_loc, 1));
2077 return gen_rtx_SET (VOIDmode, SET_DEST (orig),
2080 (copy_rtx_and_substitute (SET_SRC (orig),
2086 return gen_rtx_SET (VOIDmode,
2087 copy_rtx_and_substitute (SET_DEST (orig), map, 1),
2088 copy_rtx_and_substitute (SET_SRC (orig), map, 0));
2093 && GET_CODE (XEXP (orig, 0)) == SYMBOL_REF
2094 && CONSTANT_POOL_ADDRESS_P (XEXP (orig, 0)))
2096 enum machine_mode const_mode
2097 = get_pool_mode_for_function (inlining, XEXP (orig, 0));
2099 = get_pool_constant_for_function (inlining, XEXP (orig, 0));
2101 constant = copy_rtx_and_substitute (constant, map, 0);
2103 /* If this was an address of a constant pool entry that itself
2104 had to be placed in the constant pool, it might not be a
2105 valid address. So the recursive call might have turned it
2106 into a register. In that case, it isn't a constant any
2107 more, so return it. This has the potential of changing a
2108 MEM into a REG, but we'll assume that it safe. */
2109 if (! CONSTANT_P (constant))
2112 return validize_mem (force_const_mem (const_mode, constant));
2115 copy = rtx_alloc (MEM);
2116 PUT_MODE (copy, mode);
2117 XEXP (copy, 0) = copy_rtx_and_substitute (XEXP (orig, 0), map, 0);
2118 MEM_COPY_ATTRIBUTES (copy, orig);
2119 MEM_ALIAS_SET (copy) = MEM_ALIAS_SET (orig);
2120 RTX_UNCHANGING_P (copy) = RTX_UNCHANGING_P (orig);
2127 copy = rtx_alloc (code);
2128 PUT_MODE (copy, mode);
2129 copy->in_struct = orig->in_struct;
2130 copy->volatil = orig->volatil;
2131 copy->unchanging = orig->unchanging;
2133 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
2135 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
2137 switch (*format_ptr++)
2140 /* Copy this through the wide int field; that's safest. */
2141 X0WINT (copy, i) = X0WINT (orig, i);
2146 = copy_rtx_and_substitute (XEXP (orig, i), map, for_lhs);
2150 /* Change any references to old-insns to point to the
2151 corresponding copied insns. */
2152 XEXP (copy, i) = map->insn_map[INSN_UID (XEXP (orig, i))];
2156 XVEC (copy, i) = XVEC (orig, i);
2157 if (XVEC (orig, i) != NULL && XVECLEN (orig, i) != 0)
2159 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
2160 for (j = 0; j < XVECLEN (copy, i); j++)
2161 XVECEXP (copy, i, j)
2162 = copy_rtx_and_substitute (XVECEXP (orig, i, j),
2168 XWINT (copy, i) = XWINT (orig, i);
2172 XINT (copy, i) = XINT (orig, i);
2176 XSTR (copy, i) = XSTR (orig, i);
2180 XTREE (copy, i) = XTREE (orig, i);
2188 if (code == ASM_OPERANDS && map->orig_asm_operands_vector == 0)
2190 map->orig_asm_operands_vector = XVEC (orig, 3);
2191 map->copy_asm_operands_vector = XVEC (copy, 3);
2192 map->copy_asm_constraints_vector = XVEC (copy, 4);
2198 /* Substitute known constant values into INSN, if that is valid. */
2201 try_constants (insn, map)
2203 struct inline_remap *map;
2209 /* First try just updating addresses, then other things. This is
2210 important when we have something like the store of a constant
2211 into memory and we can update the memory address but the machine
2212 does not support a constant source. */
2213 subst_constants (&PATTERN (insn), insn, map, 1);
2214 apply_change_group ();
2215 subst_constants (&PATTERN (insn), insn, map, 0);
2216 apply_change_group ();
2218 /* Show we don't know the value of anything stored or clobbered. */
2219 note_stores (PATTERN (insn), mark_stores, NULL);
2220 map->last_pc_value = 0;
2222 map->last_cc0_value = 0;
2225 /* Set up any constant equivalences made in this insn. */
2226 for (i = 0; i < map->num_sets; i++)
2228 if (GET_CODE (map->equiv_sets[i].dest) == REG)
2230 int regno = REGNO (map->equiv_sets[i].dest);
2232 MAYBE_EXTEND_CONST_EQUIV_VARRAY (map, regno);
2233 if (VARRAY_CONST_EQUIV (map->const_equiv_varray, regno).rtx == 0
2234 /* Following clause is a hack to make case work where GNU C++
2235 reassigns a variable to make cse work right. */
2236 || ! rtx_equal_p (VARRAY_CONST_EQUIV (map->const_equiv_varray,
2238 map->equiv_sets[i].equiv))
2239 SET_CONST_EQUIV_DATA (map, map->equiv_sets[i].dest,
2240 map->equiv_sets[i].equiv, map->const_age);
2242 else if (map->equiv_sets[i].dest == pc_rtx)
2243 map->last_pc_value = map->equiv_sets[i].equiv;
2245 else if (map->equiv_sets[i].dest == cc0_rtx)
2246 map->last_cc0_value = map->equiv_sets[i].equiv;
2251 /* Substitute known constants for pseudo regs in the contents of LOC,
2252 which are part of INSN.
2253 If INSN is zero, the substitution should always be done (this is used to
2255 These changes are taken out by try_constants if the result is not valid.
2257 Note that we are more concerned with determining when the result of a SET
2258 is a constant, for further propagation, than actually inserting constants
2259 into insns; cse will do the latter task better.
2261 This function is also used to adjust address of items previously addressed
2262 via the virtual stack variable or virtual incoming arguments registers.
2264 If MEMONLY is nonzero, only make changes inside a MEM. */
2267 subst_constants (loc, insn, map, memonly)
2270 struct inline_remap *map;
2275 register enum rtx_code code;
2276 register const char *format_ptr;
2277 int num_changes = num_validated_changes ();
2279 enum machine_mode op0_mode = MAX_MACHINE_MODE;
2281 code = GET_CODE (x);
2297 validate_change (insn, loc, map->last_cc0_value, 1);
2303 /* The only thing we can do with a USE or CLOBBER is possibly do
2304 some substitutions in a MEM within it. */
2305 if (GET_CODE (XEXP (x, 0)) == MEM)
2306 subst_constants (&XEXP (XEXP (x, 0), 0), insn, map, 0);
2310 /* Substitute for parms and known constants. Don't replace
2311 hard regs used as user variables with constants. */
2314 int regno = REGNO (x);
2315 struct const_equiv_data *p;
2317 if (! (regno < FIRST_PSEUDO_REGISTER && REG_USERVAR_P (x))
2318 && (size_t) regno < VARRAY_SIZE (map->const_equiv_varray)
2319 && (p = &VARRAY_CONST_EQUIV (map->const_equiv_varray, regno),
2321 && p->age >= map->const_age)
2322 validate_change (insn, loc, p->rtx, 1);
2327 /* SUBREG applied to something other than a reg
2328 should be treated as ordinary, since that must
2329 be a special hack and we don't know how to treat it specially.
2330 Consider for example mulsidi3 in m68k.md.
2331 Ordinary SUBREG of a REG needs this special treatment. */
2332 if (! memonly && GET_CODE (SUBREG_REG (x)) == REG)
2334 rtx inner = SUBREG_REG (x);
2337 /* We can't call subst_constants on &SUBREG_REG (x) because any
2338 constant or SUBREG wouldn't be valid inside our SUBEG. Instead,
2339 see what is inside, try to form the new SUBREG and see if that is
2340 valid. We handle two cases: extracting a full word in an
2341 integral mode and extracting the low part. */
2342 subst_constants (&inner, NULL_RTX, map, 0);
2344 if (GET_MODE_CLASS (GET_MODE (x)) == MODE_INT
2345 && GET_MODE_SIZE (GET_MODE (x)) == UNITS_PER_WORD
2346 && GET_MODE (SUBREG_REG (x)) != VOIDmode)
2347 new = operand_subword (inner, SUBREG_WORD (x), 0,
2348 GET_MODE (SUBREG_REG (x)));
2350 cancel_changes (num_changes);
2351 if (new == 0 && subreg_lowpart_p (x))
2352 new = gen_lowpart_common (GET_MODE (x), inner);
2355 validate_change (insn, loc, new, 1);
2362 subst_constants (&XEXP (x, 0), insn, map, 0);
2364 /* If a memory address got spoiled, change it back. */
2365 if (! memonly && insn != 0 && num_validated_changes () != num_changes
2366 && ! memory_address_p (GET_MODE (x), XEXP (x, 0)))
2367 cancel_changes (num_changes);
2372 /* Substitute constants in our source, and in any arguments to a
2373 complex (e..g, ZERO_EXTRACT) destination, but not in the destination
2375 rtx *dest_loc = &SET_DEST (x);
2376 rtx dest = *dest_loc;
2379 subst_constants (&SET_SRC (x), insn, map, memonly);
2382 while (GET_CODE (*dest_loc) == ZERO_EXTRACT
2383 || GET_CODE (*dest_loc) == SUBREG
2384 || GET_CODE (*dest_loc) == STRICT_LOW_PART)
2386 if (GET_CODE (*dest_loc) == ZERO_EXTRACT)
2388 subst_constants (&XEXP (*dest_loc, 1), insn, map, memonly);
2389 subst_constants (&XEXP (*dest_loc, 2), insn, map, memonly);
2391 dest_loc = &XEXP (*dest_loc, 0);
2394 /* Do substitute in the address of a destination in memory. */
2395 if (GET_CODE (*dest_loc) == MEM)
2396 subst_constants (&XEXP (*dest_loc, 0), insn, map, 0);
2398 /* Check for the case of DEST a SUBREG, both it and the underlying
2399 register are less than one word, and the SUBREG has the wider mode.
2400 In the case, we are really setting the underlying register to the
2401 source converted to the mode of DEST. So indicate that. */
2402 if (GET_CODE (dest) == SUBREG
2403 && GET_MODE_SIZE (GET_MODE (dest)) <= UNITS_PER_WORD
2404 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest))) <= UNITS_PER_WORD
2405 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest)))
2406 <= GET_MODE_SIZE (GET_MODE (dest)))
2407 && (tem = gen_lowpart_if_possible (GET_MODE (SUBREG_REG (dest)),
2409 src = tem, dest = SUBREG_REG (dest);
2411 /* If storing a recognizable value save it for later recording. */
2412 if ((map->num_sets < MAX_RECOG_OPERANDS)
2413 && (CONSTANT_P (src)
2414 || (GET_CODE (src) == REG
2415 && (REGNO (src) == VIRTUAL_INCOMING_ARGS_REGNUM
2416 || REGNO (src) == VIRTUAL_STACK_VARS_REGNUM))
2417 || (GET_CODE (src) == PLUS
2418 && GET_CODE (XEXP (src, 0)) == REG
2419 && (REGNO (XEXP (src, 0)) == VIRTUAL_INCOMING_ARGS_REGNUM
2420 || REGNO (XEXP (src, 0)) == VIRTUAL_STACK_VARS_REGNUM)
2421 && CONSTANT_P (XEXP (src, 1)))
2422 || GET_CODE (src) == COMPARE
2427 && (src == pc_rtx || GET_CODE (src) == RETURN
2428 || GET_CODE (src) == LABEL_REF))))
2430 /* Normally, this copy won't do anything. But, if SRC is a COMPARE
2431 it will cause us to save the COMPARE with any constants
2432 substituted, which is what we want for later. */
2433 map->equiv_sets[map->num_sets].equiv = copy_rtx (src);
2434 map->equiv_sets[map->num_sets++].dest = dest;
2443 format_ptr = GET_RTX_FORMAT (code);
2445 /* If the first operand is an expression, save its mode for later. */
2446 if (*format_ptr == 'e')
2447 op0_mode = GET_MODE (XEXP (x, 0));
2449 for (i = 0; i < GET_RTX_LENGTH (code); i++)
2451 switch (*format_ptr++)
2458 subst_constants (&XEXP (x, i), insn, map, memonly);
2470 if (XVEC (x, i) != NULL && XVECLEN (x, i) != 0)
2471 for (j = 0; j < XVECLEN (x, i); j++)
2472 subst_constants (&XVECEXP (x, i, j), insn, map, memonly);
2481 /* If this is a commutative operation, move a constant to the second
2482 operand unless the second operand is already a CONST_INT. */
2484 && (GET_RTX_CLASS (code) == 'c' || code == NE || code == EQ)
2485 && CONSTANT_P (XEXP (x, 0)) && GET_CODE (XEXP (x, 1)) != CONST_INT)
2487 rtx tem = XEXP (x, 0);
2488 validate_change (insn, &XEXP (x, 0), XEXP (x, 1), 1);
2489 validate_change (insn, &XEXP (x, 1), tem, 1);
2492 /* Simplify the expression in case we put in some constants. */
2494 switch (GET_RTX_CLASS (code))
2497 if (op0_mode == MAX_MACHINE_MODE)
2499 new = simplify_unary_operation (code, GET_MODE (x),
2500 XEXP (x, 0), op0_mode);
2505 enum machine_mode op_mode = GET_MODE (XEXP (x, 0));
2507 if (op_mode == VOIDmode)
2508 op_mode = GET_MODE (XEXP (x, 1));
2509 new = simplify_relational_operation (code, op_mode,
2510 XEXP (x, 0), XEXP (x, 1));
2511 #ifdef FLOAT_STORE_FLAG_VALUE
2512 if (new != 0 && GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT)
2514 enum machine_mode mode = GET_MODE (x);
2515 if (new == const0_rtx)
2516 new = CONST0_RTX (mode);
2519 REAL_VALUE_TYPE val = FLOAT_STORE_FLAG_VALUE (mode);
2520 new = CONST_DOUBLE_FROM_REAL_VALUE (val, mode);
2529 new = simplify_binary_operation (code, GET_MODE (x),
2530 XEXP (x, 0), XEXP (x, 1));
2535 if (op0_mode == MAX_MACHINE_MODE)
2538 new = simplify_ternary_operation (code, GET_MODE (x), op0_mode,
2539 XEXP (x, 0), XEXP (x, 1),
2545 validate_change (insn, loc, new, 1);
2548 /* Show that register modified no longer contain known constants. We are
2549 called from note_stores with parts of the new insn. */
2552 mark_stores (dest, x, data)
2554 rtx x ATTRIBUTE_UNUSED;
2555 void *data ATTRIBUTE_UNUSED;
2558 enum machine_mode mode = VOIDmode;
2560 /* DEST is always the innermost thing set, except in the case of
2561 SUBREGs of hard registers. */
2563 if (GET_CODE (dest) == REG)
2564 regno = REGNO (dest), mode = GET_MODE (dest);
2565 else if (GET_CODE (dest) == SUBREG && GET_CODE (SUBREG_REG (dest)) == REG)
2567 regno = REGNO (SUBREG_REG (dest)) + SUBREG_WORD (dest);
2568 mode = GET_MODE (SUBREG_REG (dest));
2573 unsigned int uregno = regno;
2574 unsigned int last_reg = (uregno >= FIRST_PSEUDO_REGISTER ? uregno
2575 : uregno + HARD_REGNO_NREGS (uregno, mode) - 1);
2578 /* Ignore virtual stack var or virtual arg register since those
2579 are handled separately. */
2580 if (uregno != VIRTUAL_INCOMING_ARGS_REGNUM
2581 && uregno != VIRTUAL_STACK_VARS_REGNUM)
2582 for (i = uregno; i <= last_reg; i++)
2583 if ((size_t) i < VARRAY_SIZE (global_const_equiv_varray))
2584 VARRAY_CONST_EQUIV (global_const_equiv_varray, i).rtx = 0;
2588 /* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the
2589 given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so
2590 that it points to the node itself, thus indicating that the node is its
2591 own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for
2592 the given node is NULL, recursively descend the decl/block tree which
2593 it is the root of, and for each other ..._DECL or BLOCK node contained
2594 therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also
2595 still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN
2596 values to point to themselves. */
2599 set_block_origin_self (stmt)
2602 if (BLOCK_ABSTRACT_ORIGIN (stmt) == NULL_TREE)
2604 BLOCK_ABSTRACT_ORIGIN (stmt) = stmt;
2607 register tree local_decl;
2609 for (local_decl = BLOCK_VARS (stmt);
2610 local_decl != NULL_TREE;
2611 local_decl = TREE_CHAIN (local_decl))
2612 set_decl_origin_self (local_decl); /* Potential recursion. */
2616 register tree subblock;
2618 for (subblock = BLOCK_SUBBLOCKS (stmt);
2619 subblock != NULL_TREE;
2620 subblock = BLOCK_CHAIN (subblock))
2621 set_block_origin_self (subblock); /* Recurse. */
2626 /* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for
2627 the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the
2628 node to so that it points to the node itself, thus indicating that the
2629 node represents its own (abstract) origin. Additionally, if the
2630 DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend
2631 the decl/block tree of which the given node is the root of, and for
2632 each other ..._DECL or BLOCK node contained therein whose
2633 DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL,
2634 set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to
2635 point to themselves. */
2638 set_decl_origin_self (decl)
2641 if (DECL_ABSTRACT_ORIGIN (decl) == NULL_TREE)
2643 DECL_ABSTRACT_ORIGIN (decl) = decl;
2644 if (TREE_CODE (decl) == FUNCTION_DECL)
2648 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2649 DECL_ABSTRACT_ORIGIN (arg) = arg;
2650 if (DECL_INITIAL (decl) != NULL_TREE
2651 && DECL_INITIAL (decl) != error_mark_node)
2652 set_block_origin_self (DECL_INITIAL (decl));
2657 /* Given a pointer to some BLOCK node, and a boolean value to set the
2658 "abstract" flags to, set that value into the BLOCK_ABSTRACT flag for
2659 the given block, and for all local decls and all local sub-blocks
2660 (recursively) which are contained therein. */
2663 set_block_abstract_flags (stmt, setting)
2665 register int setting;
2667 register tree local_decl;
2668 register tree subblock;
2670 BLOCK_ABSTRACT (stmt) = setting;
2672 for (local_decl = BLOCK_VARS (stmt);
2673 local_decl != NULL_TREE;
2674 local_decl = TREE_CHAIN (local_decl))
2675 set_decl_abstract_flags (local_decl, setting);
2677 for (subblock = BLOCK_SUBBLOCKS (stmt);
2678 subblock != NULL_TREE;
2679 subblock = BLOCK_CHAIN (subblock))
2680 set_block_abstract_flags (subblock, setting);
2683 /* Given a pointer to some ..._DECL node, and a boolean value to set the
2684 "abstract" flags to, set that value into the DECL_ABSTRACT flag for the
2685 given decl, and (in the case where the decl is a FUNCTION_DECL) also
2686 set the abstract flags for all of the parameters, local vars, local
2687 blocks and sub-blocks (recursively) to the same setting. */
2690 set_decl_abstract_flags (decl, setting)
2692 register int setting;
2694 DECL_ABSTRACT (decl) = setting;
2695 if (TREE_CODE (decl) == FUNCTION_DECL)
2699 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2700 DECL_ABSTRACT (arg) = setting;
2701 if (DECL_INITIAL (decl) != NULL_TREE
2702 && DECL_INITIAL (decl) != error_mark_node)
2703 set_block_abstract_flags (DECL_INITIAL (decl), setting);
2707 /* Output the assembly language code for the function FNDECL
2708 from its DECL_SAVED_INSNS. Used for inline functions that are output
2709 at end of compilation instead of where they came in the source. */
2712 output_inline_function (fndecl)
2715 struct function *old_cfun = cfun;
2716 struct function *f = DECL_SAVED_INSNS (fndecl);
2719 current_function_decl = fndecl;
2720 clear_emit_caches ();
2722 /* Things we allocate from here on are part of this function, not
2724 temporary_allocation ();
2726 set_new_last_label_num (f->inl_max_label_num);
2728 /* We must have already output DWARF debugging information for the
2729 original (abstract) inline function declaration/definition, so
2730 we want to make sure that the debugging information we generate
2731 for this special instance of the inline function refers back to
2732 the information we already generated. To make sure that happens,
2733 we simply have to set the DECL_ABSTRACT_ORIGIN for the function
2734 node (and for all of the local ..._DECL nodes which are its children)
2735 so that they all point to themselves. */
2737 set_decl_origin_self (fndecl);
2739 /* We're not deferring this any longer. */
2740 DECL_DEFER_OUTPUT (fndecl) = 0;
2742 /* We can't inline this anymore. */
2744 DECL_INLINE (fndecl) = 0;
2746 /* Compile this function all the way down to assembly code. */
2747 rest_of_compilation (fndecl);
2750 current_function_decl = old_cfun ? old_cfun->decl : 0;