1 /* Procedure integration for GNU CC.
2 Copyright (C) 1988, 1991, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of 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. */
31 #include "insn-config.h"
32 #include "insn-flags.h"
36 #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 /* Decide whether a function with a target specific attribute
67 attached can be inlined. By default we disallow this. */
68 #ifndef FUNCTION_ATTRIBUTE_INLINABLE_P
69 #define FUNCTION_ATTRIBUTE_INLINABLE_P(FNDECL) 0
72 static rtvec initialize_for_inline PARAMS ((tree));
73 static void note_modified_parmregs PARAMS ((rtx, rtx, void *));
74 static void integrate_parm_decls PARAMS ((tree, struct inline_remap *,
76 static tree integrate_decl_tree PARAMS ((tree,
77 struct inline_remap *));
78 static void subst_constants PARAMS ((rtx *, rtx,
79 struct inline_remap *, int));
80 static void set_block_origin_self PARAMS ((tree));
81 static void set_block_abstract_flags PARAMS ((tree, int));
82 static void process_reg_param PARAMS ((struct inline_remap *, rtx,
84 void set_decl_abstract_flags PARAMS ((tree, int));
85 static rtx expand_inline_function_eh_labelmap PARAMS ((rtx));
86 static void mark_stores PARAMS ((rtx, rtx, void *));
87 static void save_parm_insns PARAMS ((rtx, rtx));
88 static void copy_insn_list PARAMS ((rtx, struct inline_remap *,
90 static int compare_blocks PARAMS ((const PTR, const PTR));
91 static int find_block PARAMS ((const PTR, const PTR));
93 /* Used by copy_rtx_and_substitute; this indicates whether the function is
94 called for the purpose of inlining or some other purpose (i.e. loop
95 unrolling). This affects how constant pool references are handled.
96 This variable contains the FUNCTION_DECL for the inlined function. */
97 static struct function *inlining = 0;
99 /* Returns the Ith entry in the label_map contained in MAP. If the
100 Ith entry has not yet been set, return a fresh label. This function
101 performs a lazy initialization of label_map, thereby avoiding huge memory
102 explosions when the label_map gets very large. */
105 get_label_from_map (map, i)
106 struct inline_remap *map;
109 rtx x = map->label_map[i];
112 x = map->label_map[i] = gen_label_rtx ();
117 /* Zero if the current function (whose FUNCTION_DECL is FNDECL)
118 is safe and reasonable to integrate into other functions.
119 Nonzero means value is a warning msgid with a single %s
120 for the function's name. */
123 function_cannot_inline_p (fndecl)
124 register tree fndecl;
127 tree last = tree_last (TYPE_ARG_TYPES (TREE_TYPE (fndecl)));
129 /* For functions marked as inline increase the maximum size to
130 MAX_INLINE_INSNS (-finline-limit-<n>). For regular functions
131 use the limit given by INTEGRATE_THRESHOLD. */
133 int max_insns = (DECL_INLINE (fndecl))
135 + 8 * list_length (DECL_ARGUMENTS (fndecl)))
136 : INTEGRATE_THRESHOLD (fndecl);
138 register int ninsns = 0;
141 if (DECL_UNINLINABLE (fndecl))
142 return N_("function cannot be inline");
144 /* No inlines with varargs. */
145 if ((last && TREE_VALUE (last) != void_type_node)
146 || current_function_varargs)
147 return N_("varargs function cannot be inline");
149 if (current_function_calls_alloca)
150 return N_("function using alloca cannot be inline");
152 if (current_function_calls_setjmp)
153 return N_("function using setjmp cannot be inline");
155 if (current_function_contains_functions)
156 return N_("function with nested functions cannot be inline");
160 N_("function with label addresses used in initializers cannot inline");
162 if (current_function_cannot_inline)
163 return current_function_cannot_inline;
165 /* If its not even close, don't even look. */
166 if (get_max_uid () > 3 * max_insns)
167 return N_("function too large to be inline");
170 /* Don't inline functions which do not specify a function prototype and
171 have BLKmode argument or take the address of a parameter. */
172 for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms))
174 if (TYPE_MODE (TREE_TYPE (parms)) == BLKmode)
175 TREE_ADDRESSABLE (parms) = 1;
176 if (last == NULL_TREE && TREE_ADDRESSABLE (parms))
177 return N_("no prototype, and parameter address used; cannot be inline");
181 /* We can't inline functions that return structures
182 the old-fashioned PCC way, copying into a static block. */
183 if (current_function_returns_pcc_struct)
184 return N_("inline functions not supported for this return value type");
186 /* We can't inline functions that return structures of varying size. */
187 if (TREE_CODE (TREE_TYPE (TREE_TYPE (fndecl))) != VOID_TYPE
188 && int_size_in_bytes (TREE_TYPE (TREE_TYPE (fndecl))) < 0)
189 return N_("function with varying-size return value cannot be inline");
191 /* Cannot inline a function with a varying size argument or one that
192 receives a transparent union. */
193 for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms))
195 if (int_size_in_bytes (TREE_TYPE (parms)) < 0)
196 return N_("function with varying-size parameter cannot be inline");
197 else if (TREE_CODE (TREE_TYPE (parms)) == UNION_TYPE
198 && TYPE_TRANSPARENT_UNION (TREE_TYPE (parms)))
199 return N_("function with transparent unit parameter cannot be inline");
202 if (get_max_uid () > max_insns)
204 for (ninsns = 0, insn = get_first_nonparm_insn ();
205 insn && ninsns < max_insns;
206 insn = NEXT_INSN (insn))
210 if (ninsns >= max_insns)
211 return N_("function too large to be inline");
214 /* We will not inline a function which uses computed goto. The addresses of
215 its local labels, which may be tucked into global storage, are of course
216 not constant across instantiations, which causes unexpected behaviour. */
217 if (current_function_has_computed_jump)
218 return N_("function with computed jump cannot inline");
220 /* We cannot inline a nested function that jumps to a nonlocal label. */
221 if (current_function_has_nonlocal_goto)
222 return N_("function with nonlocal goto cannot be inline");
224 /* This is a hack, until the inliner is taught about eh regions at
225 the start of the function. */
226 for (insn = get_insns ();
228 && ! (GET_CODE (insn) == NOTE
229 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG);
230 insn = NEXT_INSN (insn))
232 if (insn && GET_CODE (insn) == NOTE
233 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG)
234 return N_("function with complex parameters cannot be inline");
237 /* We can't inline functions that return a PARALLEL rtx. */
238 if (DECL_RTL_SET_P (DECL_RESULT (fndecl)))
240 rtx result = DECL_RTL (DECL_RESULT (fndecl));
241 if (GET_CODE (result) == PARALLEL)
242 return N_("inline functions not supported for this return value type");
245 /* If the function has a target specific attribute attached to it,
246 then we assume that we should not inline it. This can be overriden
247 by the target if it defines FUNCTION_ATTRIBUTE_INLINABLE_P. */
248 if (DECL_MACHINE_ATTRIBUTES (fndecl)
249 && ! FUNCTION_ATTRIBUTE_INLINABLE_P (fndecl))
250 return N_("function with target specific attribute(s) cannot be inlined");
255 /* Map pseudo reg number into the PARM_DECL for the parm living in the reg.
256 Zero for a reg that isn't a parm's home.
257 Only reg numbers less than max_parm_reg are mapped here. */
258 static tree *parmdecl_map;
260 /* In save_for_inline, nonzero if past the parm-initialization insns. */
261 static int in_nonparm_insns;
263 /* Subroutine for `save_for_inline'. Performs initialization
264 needed to save FNDECL's insns and info for future inline expansion. */
267 initialize_for_inline (fndecl)
274 /* Clear out PARMDECL_MAP. It was allocated in the caller's frame. */
275 memset ((char *) parmdecl_map, 0, max_parm_reg * sizeof (tree));
276 arg_vector = rtvec_alloc (list_length (DECL_ARGUMENTS (fndecl)));
278 for (parms = DECL_ARGUMENTS (fndecl), i = 0;
280 parms = TREE_CHAIN (parms), i++)
282 rtx p = DECL_RTL (parms);
284 /* If we have (mem (addressof (mem ...))), use the inner MEM since
285 otherwise the copy_rtx call below will not unshare the MEM since
286 it shares ADDRESSOF. */
287 if (GET_CODE (p) == MEM && GET_CODE (XEXP (p, 0)) == ADDRESSOF
288 && GET_CODE (XEXP (XEXP (p, 0), 0)) == MEM)
289 p = XEXP (XEXP (p, 0), 0);
291 RTVEC_ELT (arg_vector, i) = p;
293 if (GET_CODE (p) == REG)
294 parmdecl_map[REGNO (p)] = parms;
295 else if (GET_CODE (p) == CONCAT)
297 rtx preal = gen_realpart (GET_MODE (XEXP (p, 0)), p);
298 rtx pimag = gen_imagpart (GET_MODE (preal), p);
300 if (GET_CODE (preal) == REG)
301 parmdecl_map[REGNO (preal)] = parms;
302 if (GET_CODE (pimag) == REG)
303 parmdecl_map[REGNO (pimag)] = parms;
306 /* This flag is cleared later
307 if the function ever modifies the value of the parm. */
308 TREE_READONLY (parms) = 1;
314 /* Copy NODE (which must be a DECL, but not a PARM_DECL). The DECL
315 originally was in the FROM_FN, but now it will be in the
319 copy_decl_for_inlining (decl, from_fn, to_fn)
326 /* Copy the declaration. */
327 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
329 /* For a parameter, we must make an equivalent VAR_DECL, not a
331 copy = build_decl (VAR_DECL, DECL_NAME (decl), TREE_TYPE (decl));
332 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
333 TREE_READONLY (copy) = TREE_READONLY (decl);
334 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
338 copy = copy_node (decl);
339 if (DECL_LANG_SPECIFIC (copy))
340 copy_lang_decl (copy);
342 /* TREE_ADDRESSABLE isn't used to indicate that a label's
343 address has been taken; it's for internal bookkeeping in
344 expand_goto_internal. */
345 if (TREE_CODE (copy) == LABEL_DECL)
346 TREE_ADDRESSABLE (copy) = 0;
349 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
350 declaration inspired this copy. */
351 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
353 /* The new variable/label has no RTL, yet. */
354 SET_DECL_RTL (copy, NULL_RTX);
356 /* These args would always appear unused, if not for this. */
357 TREE_USED (copy) = 1;
359 /* Set the context for the new declaration. */
360 if (!DECL_CONTEXT (decl))
361 /* Globals stay global. */
363 else if (DECL_CONTEXT (decl) != from_fn)
364 /* Things that weren't in the scope of the function we're inlining
365 from aren't in the scope we're inlining too, either. */
367 else if (TREE_STATIC (decl))
368 /* Function-scoped static variables should say in the original
372 /* Ordinary automatic local variables are now in the scope of the
374 DECL_CONTEXT (copy) = to_fn;
379 /* Make the insns and PARM_DECLs of the current function permanent
380 and record other information in DECL_SAVED_INSNS to allow inlining
381 of this function in subsequent calls.
383 This routine need not copy any insns because we are not going
384 to immediately compile the insns in the insn chain. There
385 are two cases when we would compile the insns for FNDECL:
386 (1) when FNDECL is expanded inline, and (2) when FNDECL needs to
387 be output at the end of other compilation, because somebody took
388 its address. In the first case, the insns of FNDECL are copied
389 as it is expanded inline, so FNDECL's saved insns are not
390 modified. In the second case, FNDECL is used for the last time,
391 so modifying the rtl is not a problem.
393 We don't have to worry about FNDECL being inline expanded by
394 other functions which are written at the end of compilation
395 because flag_no_inline is turned on when we begin writing
396 functions at the end of compilation. */
399 save_for_inline (fndecl)
404 rtx first_nonparm_insn;
406 /* Set up PARMDECL_MAP which maps pseudo-reg number to its PARM_DECL.
407 Later we set TREE_READONLY to 0 if the parm is modified inside the fn.
408 Also set up ARG_VECTOR, which holds the unmodified DECL_RTX values
409 for the parms, prior to elimination of virtual registers.
410 These values are needed for substituting parms properly. */
412 parmdecl_map = (tree *) xmalloc (max_parm_reg * sizeof (tree));
414 /* Make and emit a return-label if we have not already done so. */
416 if (return_label == 0)
418 return_label = gen_label_rtx ();
419 emit_label (return_label);
422 argvec = initialize_for_inline (fndecl);
424 /* If there are insns that copy parms from the stack into pseudo registers,
425 those insns are not copied. `expand_inline_function' must
426 emit the correct code to handle such things. */
429 if (GET_CODE (insn) != NOTE)
432 /* Get the insn which signals the end of parameter setup code. */
433 first_nonparm_insn = get_first_nonparm_insn ();
435 /* Now just scan the chain of insns to see what happens to our
436 PARM_DECLs. If a PARM_DECL is used but never modified, we
437 can substitute its rtl directly when expanding inline (and
438 perform constant folding when its incoming value is constant).
439 Otherwise, we have to copy its value into a new register and track
440 the new register's life. */
441 in_nonparm_insns = 0;
442 save_parm_insns (insn, first_nonparm_insn);
444 cfun->inl_max_label_num = max_label_num ();
445 cfun->inl_last_parm_insn = cfun->x_last_parm_insn;
446 cfun->original_arg_vector = argvec;
447 cfun->original_decl_initial = DECL_INITIAL (fndecl);
448 cfun->no_debugging_symbols = (write_symbols == NO_DEBUG);
449 DECL_SAVED_INSNS (fndecl) = cfun;
455 /* Scan the chain of insns to see what happens to our PARM_DECLs. If a
456 PARM_DECL is used but never modified, we can substitute its rtl directly
457 when expanding inline (and perform constant folding when its incoming
458 value is constant). Otherwise, we have to copy its value into a new
459 register and track the new register's life. */
462 save_parm_insns (insn, first_nonparm_insn)
464 rtx first_nonparm_insn;
466 if (insn == NULL_RTX)
469 for (insn = NEXT_INSN (insn); insn; insn = NEXT_INSN (insn))
471 if (insn == first_nonparm_insn)
472 in_nonparm_insns = 1;
476 /* Record what interesting things happen to our parameters. */
477 note_stores (PATTERN (insn), note_modified_parmregs, NULL);
479 /* If this is a CALL_PLACEHOLDER insn then we need to look into the
480 three attached sequences: normal call, sibling call and tail
482 if (GET_CODE (insn) == CALL_INSN
483 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
487 for (i = 0; i < 3; i++)
488 save_parm_insns (XEXP (PATTERN (insn), i),
495 /* Note whether a parameter is modified or not. */
498 note_modified_parmregs (reg, x, data)
500 rtx x ATTRIBUTE_UNUSED;
501 void *data ATTRIBUTE_UNUSED;
503 if (GET_CODE (reg) == REG && in_nonparm_insns
504 && REGNO (reg) < max_parm_reg
505 && REGNO (reg) >= FIRST_PSEUDO_REGISTER
506 && parmdecl_map[REGNO (reg)] != 0)
507 TREE_READONLY (parmdecl_map[REGNO (reg)]) = 0;
510 /* Unfortunately, we need a global copy of const_equiv map for communication
511 with a function called from note_stores. Be *very* careful that this
512 is used properly in the presence of recursion. */
514 varray_type global_const_equiv_varray;
516 #define FIXED_BASE_PLUS_P(X) \
517 (GET_CODE (X) == PLUS && GET_CODE (XEXP (X, 1)) == CONST_INT \
518 && GET_CODE (XEXP (X, 0)) == REG \
519 && REGNO (XEXP (X, 0)) >= FIRST_VIRTUAL_REGISTER \
520 && REGNO (XEXP (X, 0)) <= LAST_VIRTUAL_REGISTER)
522 /* Called to set up a mapping for the case where a parameter is in a
523 register. If it is read-only and our argument is a constant, set up the
524 constant equivalence.
526 If LOC is REG_USERVAR_P, the usual case, COPY must also have that flag set
529 Also, don't allow hard registers here; they might not be valid when
530 substituted into insns. */
532 process_reg_param (map, loc, copy)
533 struct inline_remap *map;
536 if ((GET_CODE (copy) != REG && GET_CODE (copy) != SUBREG)
537 || (GET_CODE (copy) == REG && REG_USERVAR_P (loc)
538 && ! REG_USERVAR_P (copy))
539 || (GET_CODE (copy) == REG
540 && REGNO (copy) < FIRST_PSEUDO_REGISTER))
542 rtx temp = copy_to_mode_reg (GET_MODE (loc), copy);
543 REG_USERVAR_P (temp) = REG_USERVAR_P (loc);
544 if (CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy))
545 SET_CONST_EQUIV_DATA (map, temp, copy, CONST_AGE_PARM);
548 map->reg_map[REGNO (loc)] = copy;
551 /* Used by duplicate_eh_handlers to map labels for the exception table */
552 static struct inline_remap *eif_eh_map;
555 expand_inline_function_eh_labelmap (label)
558 int index = CODE_LABEL_NUMBER (label);
559 return get_label_from_map (eif_eh_map, index);
562 /* Compare two BLOCKs for qsort. The key we sort on is the
563 BLOCK_ABSTRACT_ORIGIN of the blocks. */
566 compare_blocks (v1, v2)
570 tree b1 = *((const tree *) v1);
571 tree b2 = *((const tree *) v2);
573 return ((char *) BLOCK_ABSTRACT_ORIGIN (b1)
574 - (char *) BLOCK_ABSTRACT_ORIGIN (b2));
577 /* Compare two BLOCKs for bsearch. The first pointer corresponds to
578 an original block; the second to a remapped equivalent. */
585 const union tree_node *b1 = (const union tree_node *) v1;
586 tree b2 = *((const tree *) v2);
588 return ((const char *) b1 - (char *) BLOCK_ABSTRACT_ORIGIN (b2));
591 /* Integrate the procedure defined by FNDECL. Note that this function
592 may wind up calling itself. Since the static variables are not
593 reentrant, we do not assign them until after the possibility
594 of recursion is eliminated.
596 If IGNORE is nonzero, do not produce a value.
597 Otherwise store the value in TARGET if it is nonzero and that is convenient.
600 (rtx)-1 if we could not substitute the function
601 0 if we substituted it and it does not produce a value
602 else an rtx for where the value is stored. */
605 expand_inline_function (fndecl, parms, target, ignore, type,
606 structure_value_addr)
611 rtx structure_value_addr;
613 struct function *inlining_previous;
614 struct function *inl_f = DECL_SAVED_INSNS (fndecl);
615 tree formal, actual, block;
616 rtx parm_insns = inl_f->emit->x_first_insn;
617 rtx insns = (inl_f->inl_last_parm_insn
618 ? NEXT_INSN (inl_f->inl_last_parm_insn)
624 int min_labelno = inl_f->emit->x_first_label_num;
625 int max_labelno = inl_f->inl_max_label_num;
630 struct inline_remap *map = 0;
634 rtvec arg_vector = (rtvec) inl_f->original_arg_vector;
635 rtx static_chain_value = 0;
638 /* The pointer used to track the true location of the memory used
639 for MAP->LABEL_MAP. */
640 rtx *real_label_map = 0;
642 /* Allow for equivalences of the pseudos we make for virtual fp and ap. */
643 max_regno = inl_f->emit->x_reg_rtx_no + 3;
644 if (max_regno < FIRST_PSEUDO_REGISTER)
647 /* Pull out the decl for the function definition; fndecl may be a
648 local declaration, which would break DECL_ABSTRACT_ORIGIN. */
649 fndecl = inl_f->decl;
651 nargs = list_length (DECL_ARGUMENTS (fndecl));
653 if (cfun->preferred_stack_boundary < inl_f->preferred_stack_boundary)
654 cfun->preferred_stack_boundary = inl_f->preferred_stack_boundary;
656 /* Check that the parms type match and that sufficient arguments were
657 passed. Since the appropriate conversions or default promotions have
658 already been applied, the machine modes should match exactly. */
660 for (formal = DECL_ARGUMENTS (fndecl), actual = parms;
662 formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual))
665 enum machine_mode mode;
668 return (rtx) (HOST_WIDE_INT) -1;
670 arg = TREE_VALUE (actual);
671 mode = TYPE_MODE (DECL_ARG_TYPE (formal));
673 if (mode != TYPE_MODE (TREE_TYPE (arg))
674 /* If they are block mode, the types should match exactly.
675 They don't match exactly if TREE_TYPE (FORMAL) == ERROR_MARK_NODE,
676 which could happen if the parameter has incomplete type. */
678 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg))
679 != TYPE_MAIN_VARIANT (TREE_TYPE (formal)))))
680 return (rtx) (HOST_WIDE_INT) -1;
683 /* Extra arguments are valid, but will be ignored below, so we must
684 evaluate them here for side-effects. */
685 for (; actual; actual = TREE_CHAIN (actual))
686 expand_expr (TREE_VALUE (actual), const0_rtx,
687 TYPE_MODE (TREE_TYPE (TREE_VALUE (actual))), 0);
689 /* Expand the function arguments. Do this first so that any
690 new registers get created before we allocate the maps. */
692 arg_vals = (rtx *) xmalloc (nargs * sizeof (rtx));
693 arg_trees = (tree *) xmalloc (nargs * sizeof (tree));
695 for (formal = DECL_ARGUMENTS (fndecl), actual = parms, i = 0;
697 formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual), i++)
699 /* Actual parameter, converted to the type of the argument within the
701 tree arg = convert (TREE_TYPE (formal), TREE_VALUE (actual));
702 /* Mode of the variable used within the function. */
703 enum machine_mode mode = TYPE_MODE (TREE_TYPE (formal));
707 loc = RTVEC_ELT (arg_vector, i);
709 /* If this is an object passed by invisible reference, we copy the
710 object into a stack slot and save its address. If this will go
711 into memory, we do nothing now. Otherwise, we just expand the
713 if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG
714 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)
716 rtx stack_slot = assign_temp (TREE_TYPE (arg), 1, 1, 1);
718 store_expr (arg, stack_slot, 0);
719 arg_vals[i] = XEXP (stack_slot, 0);
722 else if (GET_CODE (loc) != MEM)
724 if (GET_MODE (loc) != TYPE_MODE (TREE_TYPE (arg)))
725 /* The mode if LOC and ARG can differ if LOC was a variable
726 that had its mode promoted via PROMOTED_MODE. */
727 arg_vals[i] = convert_modes (GET_MODE (loc),
728 TYPE_MODE (TREE_TYPE (arg)),
729 expand_expr (arg, NULL_RTX, mode,
731 TREE_UNSIGNED (TREE_TYPE (formal)));
733 arg_vals[i] = expand_expr (arg, NULL_RTX, mode, EXPAND_SUM);
739 && (! TREE_READONLY (formal)
740 /* If the parameter is not read-only, copy our argument through
741 a register. Also, we cannot use ARG_VALS[I] if it overlaps
742 TARGET in any way. In the inline function, they will likely
743 be two different pseudos, and `safe_from_p' will make all
744 sorts of smart assumptions about their not conflicting.
745 But if ARG_VALS[I] overlaps TARGET, these assumptions are
746 wrong, so put ARG_VALS[I] into a fresh register.
747 Don't worry about invisible references, since their stack
748 temps will never overlap the target. */
751 && (GET_CODE (arg_vals[i]) == REG
752 || GET_CODE (arg_vals[i]) == SUBREG
753 || GET_CODE (arg_vals[i]) == MEM)
754 && reg_overlap_mentioned_p (arg_vals[i], target))
755 /* ??? We must always copy a SUBREG into a REG, because it might
756 get substituted into an address, and not all ports correctly
757 handle SUBREGs in addresses. */
758 || (GET_CODE (arg_vals[i]) == SUBREG)))
759 arg_vals[i] = copy_to_mode_reg (GET_MODE (loc), arg_vals[i]);
761 if (arg_vals[i] != 0 && GET_CODE (arg_vals[i]) == REG
762 && POINTER_TYPE_P (TREE_TYPE (formal)))
763 mark_reg_pointer (arg_vals[i],
764 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (formal))));
767 /* Allocate the structures we use to remap things. */
769 map = (struct inline_remap *) xmalloc (sizeof (struct inline_remap));
770 map->fndecl = fndecl;
772 VARRAY_TREE_INIT (map->block_map, 10, "block_map");
773 map->reg_map = (rtx *) xcalloc (max_regno, sizeof (rtx));
775 /* We used to use alloca here, but the size of what it would try to
776 allocate would occasionally cause it to exceed the stack limit and
777 cause unpredictable core dumps. */
779 = (rtx *) xmalloc ((max_labelno) * sizeof (rtx));
780 map->label_map = real_label_map;
782 inl_max_uid = (inl_f->emit->x_cur_insn_uid + 1);
783 map->insn_map = (rtx *) xcalloc (inl_max_uid, sizeof (rtx));
785 map->max_insnno = inl_max_uid;
787 map->integrating = 1;
788 map->compare_src = NULL_RTX;
789 map->compare_mode = VOIDmode;
791 /* const_equiv_varray maps pseudos in our routine to constants, so
792 it needs to be large enough for all our pseudos. This is the
793 number we are currently using plus the number in the called
794 routine, plus 15 for each arg, five to compute the virtual frame
795 pointer, and five for the return value. This should be enough
796 for most cases. We do not reference entries outside the range of
799 ??? These numbers are quite arbitrary and were obtained by
800 experimentation. At some point, we should try to allocate the
801 table after all the parameters are set up so we an more accurately
802 estimate the number of pseudos we will need. */
804 VARRAY_CONST_EQUIV_INIT (map->const_equiv_varray,
806 + (max_regno - FIRST_PSEUDO_REGISTER)
809 "expand_inline_function");
812 /* Record the current insn in case we have to set up pointers to frame
813 and argument memory blocks. If there are no insns yet, add a dummy
814 insn that can be used as an insertion point. */
815 map->insns_at_start = get_last_insn ();
816 if (map->insns_at_start == 0)
817 map->insns_at_start = emit_note (NULL_PTR, NOTE_INSN_DELETED);
819 map->regno_pointer_align = inl_f->emit->regno_pointer_align;
820 map->x_regno_reg_rtx = inl_f->emit->x_regno_reg_rtx;
822 /* Update the outgoing argument size to allow for those in the inlined
824 if (inl_f->outgoing_args_size > current_function_outgoing_args_size)
825 current_function_outgoing_args_size = inl_f->outgoing_args_size;
827 /* If the inline function needs to make PIC references, that means
828 that this function's PIC offset table must be used. */
829 if (inl_f->uses_pic_offset_table)
830 current_function_uses_pic_offset_table = 1;
832 /* If this function needs a context, set it up. */
833 if (inl_f->needs_context)
834 static_chain_value = lookup_static_chain (fndecl);
836 if (GET_CODE (parm_insns) == NOTE
837 && NOTE_LINE_NUMBER (parm_insns) > 0)
839 rtx note = emit_note (NOTE_SOURCE_FILE (parm_insns),
840 NOTE_LINE_NUMBER (parm_insns));
842 RTX_INTEGRATED_P (note) = 1;
845 /* Process each argument. For each, set up things so that the function's
846 reference to the argument will refer to the argument being passed.
847 We only replace REG with REG here. Any simplifications are done
850 We make two passes: In the first, we deal with parameters that will
851 be placed into registers, since we need to ensure that the allocated
852 register number fits in const_equiv_map. Then we store all non-register
853 parameters into their memory location. */
855 /* Don't try to free temp stack slots here, because we may put one of the
856 parameters into a temp stack slot. */
858 for (i = 0; i < nargs; i++)
860 rtx copy = arg_vals[i];
862 loc = RTVEC_ELT (arg_vector, i);
864 /* There are three cases, each handled separately. */
865 if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG
866 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)
868 /* This must be an object passed by invisible reference (it could
869 also be a variable-sized object, but we forbid inlining functions
870 with variable-sized arguments). COPY is the address of the
871 actual value (this computation will cause it to be copied). We
872 map that address for the register, noting the actual address as
873 an equivalent in case it can be substituted into the insns. */
875 if (GET_CODE (copy) != REG)
877 temp = copy_addr_to_reg (copy);
878 if (CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy))
879 SET_CONST_EQUIV_DATA (map, temp, copy, CONST_AGE_PARM);
882 map->reg_map[REGNO (XEXP (loc, 0))] = copy;
884 else if (GET_CODE (loc) == MEM)
886 /* This is the case of a parameter that lives in memory. It
887 will live in the block we allocate in the called routine's
888 frame that simulates the incoming argument area. Do nothing
889 with the parameter now; we will call store_expr later. In
890 this case, however, we must ensure that the virtual stack and
891 incoming arg rtx values are expanded now so that we can be
892 sure we have enough slots in the const equiv map since the
893 store_expr call can easily blow the size estimate. */
894 if (DECL_FRAME_SIZE (fndecl) != 0)
895 copy_rtx_and_substitute (virtual_stack_vars_rtx, map, 0);
897 if (DECL_SAVED_INSNS (fndecl)->args_size != 0)
898 copy_rtx_and_substitute (virtual_incoming_args_rtx, map, 0);
900 else if (GET_CODE (loc) == REG)
901 process_reg_param (map, loc, copy);
902 else if (GET_CODE (loc) == CONCAT)
904 rtx locreal = gen_realpart (GET_MODE (XEXP (loc, 0)), loc);
905 rtx locimag = gen_imagpart (GET_MODE (XEXP (loc, 0)), loc);
906 rtx copyreal = gen_realpart (GET_MODE (locreal), copy);
907 rtx copyimag = gen_imagpart (GET_MODE (locimag), copy);
909 process_reg_param (map, locreal, copyreal);
910 process_reg_param (map, locimag, copyimag);
916 /* Tell copy_rtx_and_substitute to handle constant pool SYMBOL_REFs
917 specially. This function can be called recursively, so we need to
918 save the previous value. */
919 inlining_previous = inlining;
922 /* Now do the parameters that will be placed in memory. */
924 for (formal = DECL_ARGUMENTS (fndecl), i = 0;
925 formal; formal = TREE_CHAIN (formal), i++)
927 loc = RTVEC_ELT (arg_vector, i);
929 if (GET_CODE (loc) == MEM
930 /* Exclude case handled above. */
931 && ! (GET_CODE (XEXP (loc, 0)) == REG
932 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER))
934 rtx note = emit_note (DECL_SOURCE_FILE (formal),
935 DECL_SOURCE_LINE (formal));
937 RTX_INTEGRATED_P (note) = 1;
939 /* Compute the address in the area we reserved and store the
941 temp = copy_rtx_and_substitute (loc, map, 1);
942 subst_constants (&temp, NULL_RTX, map, 1);
943 apply_change_group ();
944 if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0)))
945 temp = change_address (temp, VOIDmode, XEXP (temp, 0));
946 store_expr (arg_trees[i], temp, 0);
950 /* Deal with the places that the function puts its result.
951 We are driven by what is placed into DECL_RESULT.
953 Initially, we assume that we don't have anything special handling for
954 REG_FUNCTION_RETURN_VALUE_P. */
956 map->inline_target = 0;
957 loc = (DECL_RTL_SET_P (DECL_RESULT (fndecl))
958 ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX);
960 if (TYPE_MODE (type) == VOIDmode)
961 /* There is no return value to worry about. */
963 else if (GET_CODE (loc) == MEM)
965 if (GET_CODE (XEXP (loc, 0)) == ADDRESSOF)
967 temp = copy_rtx_and_substitute (loc, map, 1);
968 subst_constants (&temp, NULL_RTX, map, 1);
969 apply_change_group ();
974 if (! structure_value_addr
975 || ! aggregate_value_p (DECL_RESULT (fndecl)))
978 /* Pass the function the address in which to return a structure
979 value. Note that a constructor can cause someone to call us
980 with STRUCTURE_VALUE_ADDR, but the initialization takes place
981 via the first parameter, rather than the struct return address.
983 We have two cases: If the address is a simple register
984 indirect, use the mapping mechanism to point that register to
985 our structure return address. Otherwise, store the structure
986 return value into the place that it will be referenced from. */
988 if (GET_CODE (XEXP (loc, 0)) == REG)
990 temp = force_operand (structure_value_addr, NULL_RTX);
991 temp = force_reg (Pmode, temp);
992 /* A virtual register might be invalid in an insn, because
993 it can cause trouble in reload. Since we don't have access
994 to the expanders at map translation time, make sure we have
995 a proper register now.
996 If a virtual register is actually valid, cse or combine
997 can put it into the mapped insns. */
998 if (REGNO (temp) >= FIRST_VIRTUAL_REGISTER
999 && REGNO (temp) <= LAST_VIRTUAL_REGISTER)
1000 temp = copy_to_mode_reg (Pmode, temp);
1001 map->reg_map[REGNO (XEXP (loc, 0))] = temp;
1003 if (CONSTANT_P (structure_value_addr)
1004 || GET_CODE (structure_value_addr) == ADDRESSOF
1005 || (GET_CODE (structure_value_addr) == PLUS
1006 && (XEXP (structure_value_addr, 0)
1007 == virtual_stack_vars_rtx)
1008 && (GET_CODE (XEXP (structure_value_addr, 1))
1011 SET_CONST_EQUIV_DATA (map, temp, structure_value_addr,
1017 temp = copy_rtx_and_substitute (loc, map, 1);
1018 subst_constants (&temp, NULL_RTX, map, 0);
1019 apply_change_group ();
1020 emit_move_insn (temp, structure_value_addr);
1025 /* We will ignore the result value, so don't look at its structure.
1026 Note that preparations for an aggregate return value
1027 do need to be made (above) even if it will be ignored. */
1029 else if (GET_CODE (loc) == REG)
1031 /* The function returns an object in a register and we use the return
1032 value. Set up our target for remapping. */
1034 /* Machine mode function was declared to return. */
1035 enum machine_mode departing_mode = TYPE_MODE (type);
1036 /* (Possibly wider) machine mode it actually computes
1037 (for the sake of callers that fail to declare it right).
1038 We have to use the mode of the result's RTL, rather than
1039 its type, since expand_function_start may have promoted it. */
1040 enum machine_mode arriving_mode
1041 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl)));
1044 /* Don't use MEMs as direct targets because on some machines
1045 substituting a MEM for a REG makes invalid insns.
1046 Let the combiner substitute the MEM if that is valid. */
1047 if (target == 0 || GET_CODE (target) != REG
1048 || GET_MODE (target) != departing_mode)
1050 /* Don't make BLKmode registers. If this looks like
1051 a BLKmode object being returned in a register, get
1052 the mode from that, otherwise abort. */
1053 if (departing_mode == BLKmode)
1055 if (REG == GET_CODE (DECL_RTL (DECL_RESULT (fndecl))))
1057 departing_mode = GET_MODE (DECL_RTL (DECL_RESULT (fndecl)));
1058 arriving_mode = departing_mode;
1064 target = gen_reg_rtx (departing_mode);
1067 /* If function's value was promoted before return,
1068 avoid machine mode mismatch when we substitute INLINE_TARGET.
1069 But TARGET is what we will return to the caller. */
1070 if (arriving_mode != departing_mode)
1072 /* Avoid creating a paradoxical subreg wider than
1073 BITS_PER_WORD, since that is illegal. */
1074 if (GET_MODE_BITSIZE (arriving_mode) > BITS_PER_WORD)
1076 if (!TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (departing_mode),
1077 GET_MODE_BITSIZE (arriving_mode)))
1078 /* Maybe could be handled by using convert_move () ? */
1080 reg_to_map = gen_reg_rtx (arriving_mode);
1081 target = gen_lowpart (departing_mode, reg_to_map);
1084 reg_to_map = gen_rtx_SUBREG (arriving_mode, target, 0);
1087 reg_to_map = target;
1089 /* Usually, the result value is the machine's return register.
1090 Sometimes it may be a pseudo. Handle both cases. */
1091 if (REG_FUNCTION_VALUE_P (loc))
1092 map->inline_target = reg_to_map;
1094 map->reg_map[REGNO (loc)] = reg_to_map;
1099 /* Initialize label_map. get_label_from_map will actually make
1101 memset ((char *) &map->label_map[min_labelno], 0,
1102 (max_labelno - min_labelno) * sizeof (rtx));
1104 /* Make copies of the decls of the symbols in the inline function, so that
1105 the copies of the variables get declared in the current function. Set
1106 up things so that lookup_static_chain knows that to interpret registers
1107 in SAVE_EXPRs for TYPE_SIZEs as local. */
1108 inline_function_decl = fndecl;
1109 integrate_parm_decls (DECL_ARGUMENTS (fndecl), map, arg_vector);
1110 block = integrate_decl_tree (inl_f->original_decl_initial, map);
1111 BLOCK_ABSTRACT_ORIGIN (block) = DECL_ORIGIN (fndecl);
1112 inline_function_decl = 0;
1114 /* Make a fresh binding contour that we can easily remove. Do this after
1115 expanding our arguments so cleanups are properly scoped. */
1116 expand_start_bindings_and_block (0, block);
1118 /* Sort the block-map so that it will be easy to find remapped
1120 qsort (&VARRAY_TREE (map->block_map, 0),
1121 map->block_map->elements_used,
1125 /* Perform postincrements before actually calling the function. */
1128 /* Clean up stack so that variables might have smaller offsets. */
1129 do_pending_stack_adjust ();
1131 /* Save a copy of the location of const_equiv_varray for
1132 mark_stores, called via note_stores. */
1133 global_const_equiv_varray = map->const_equiv_varray;
1135 /* If the called function does an alloca, save and restore the
1136 stack pointer around the call. This saves stack space, but
1137 also is required if this inline is being done between two
1139 if (inl_f->calls_alloca)
1140 emit_stack_save (SAVE_BLOCK, &stack_save, NULL_RTX);
1142 /* Now copy the insns one by one. */
1143 copy_insn_list (insns, map, static_chain_value);
1145 /* Restore the stack pointer if we saved it above. */
1146 if (inl_f->calls_alloca)
1147 emit_stack_restore (SAVE_BLOCK, stack_save, NULL_RTX);
1149 if (! cfun->x_whole_function_mode_p)
1150 /* In statement-at-a-time mode, we just tell the front-end to add
1151 this block to the list of blocks at this binding level. We
1152 can't do it the way it's done for function-at-a-time mode the
1153 superblocks have not been created yet. */
1154 insert_block (block);
1158 = BLOCK_CHAIN (DECL_INITIAL (current_function_decl));
1159 BLOCK_CHAIN (DECL_INITIAL (current_function_decl)) = block;
1162 /* End the scope containing the copied formal parameter variables
1163 and copied LABEL_DECLs. We pass NULL_TREE for the variables list
1164 here so that expand_end_bindings will not check for unused
1165 variables. That's already been checked for when the inlined
1166 function was defined. */
1167 expand_end_bindings (NULL_TREE, 1, 1);
1169 /* Must mark the line number note after inlined functions as a repeat, so
1170 that the test coverage code can avoid counting the call twice. This
1171 just tells the code to ignore the immediately following line note, since
1172 there already exists a copy of this note before the expanded inline call.
1173 This line number note is still needed for debugging though, so we can't
1175 if (flag_test_coverage)
1176 emit_note (0, NOTE_INSN_REPEATED_LINE_NUMBER);
1178 emit_line_note (input_filename, lineno);
1180 /* If the function returns a BLKmode object in a register, copy it
1181 out of the temp register into a BLKmode memory object. */
1183 && TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl))) == BLKmode
1184 && ! aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl))))
1185 target = copy_blkmode_from_reg (0, target, TREE_TYPE (TREE_TYPE (fndecl)));
1187 if (structure_value_addr)
1189 target = gen_rtx_MEM (TYPE_MODE (type),
1190 memory_address (TYPE_MODE (type),
1191 structure_value_addr));
1192 set_mem_attributes (target, type, 1);
1195 /* Make sure we free the things we explicitly allocated with xmalloc. */
1197 free (real_label_map);
1198 VARRAY_FREE (map->const_equiv_varray);
1199 free (map->reg_map);
1200 VARRAY_FREE (map->block_map);
1201 free (map->insn_map);
1206 inlining = inlining_previous;
1211 /* Make copies of each insn in the given list using the mapping
1212 computed in expand_inline_function. This function may call itself for
1213 insns containing sequences.
1215 Copying is done in two passes, first the insns and then their REG_NOTES.
1217 If static_chain_value is non-zero, it represents the context-pointer
1218 register for the function. */
1221 copy_insn_list (insns, map, static_chain_value)
1223 struct inline_remap *map;
1224 rtx static_chain_value;
1229 rtx local_return_label = NULL_RTX;
1234 /* Copy the insns one by one. Do this in two passes, first the insns and
1235 then their REG_NOTES. */
1237 /* This loop is very similar to the loop in copy_loop_body in unroll.c. */
1239 for (insn = insns; insn; insn = NEXT_INSN (insn))
1241 rtx copy, pattern, set;
1243 map->orig_asm_operands_vector = 0;
1245 switch (GET_CODE (insn))
1248 pattern = PATTERN (insn);
1249 set = single_set (insn);
1251 if (GET_CODE (pattern) == USE
1252 && GET_CODE (XEXP (pattern, 0)) == REG
1253 && REG_FUNCTION_VALUE_P (XEXP (pattern, 0)))
1254 /* The (USE (REG n)) at return from the function should
1255 be ignored since we are changing (REG n) into
1259 /* If the inline fn needs eh context, make sure that
1260 the current fn has one. */
1261 if (GET_CODE (pattern) == USE
1262 && find_reg_note (insn, REG_EH_CONTEXT, 0) != 0)
1265 /* Ignore setting a function value that we don't want to use. */
1266 if (map->inline_target == 0
1268 && GET_CODE (SET_DEST (set)) == REG
1269 && REG_FUNCTION_VALUE_P (SET_DEST (set)))
1271 if (volatile_refs_p (SET_SRC (set)))
1275 /* If we must not delete the source,
1276 load it into a new temporary. */
1277 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1279 new_set = single_set (copy);
1284 = gen_reg_rtx (GET_MODE (SET_DEST (new_set)));
1286 /* If the source and destination are the same and it
1287 has a note on it, keep the insn. */
1288 else if (rtx_equal_p (SET_DEST (set), SET_SRC (set))
1289 && REG_NOTES (insn) != 0)
1290 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1295 /* Similarly if an ignored return value is clobbered. */
1296 else if (map->inline_target == 0
1297 && GET_CODE (pattern) == CLOBBER
1298 && GET_CODE (XEXP (pattern, 0)) == REG
1299 && REG_FUNCTION_VALUE_P (XEXP (pattern, 0)))
1302 /* If this is setting the static chain rtx, omit it. */
1303 else if (static_chain_value != 0
1305 && GET_CODE (SET_DEST (set)) == REG
1306 && rtx_equal_p (SET_DEST (set),
1307 static_chain_incoming_rtx))
1310 /* If this is setting the static chain pseudo, set it from
1311 the value we want to give it instead. */
1312 else if (static_chain_value != 0
1314 && rtx_equal_p (SET_SRC (set),
1315 static_chain_incoming_rtx))
1317 rtx newdest = copy_rtx_and_substitute (SET_DEST (set), map, 1);
1319 copy = emit_move_insn (newdest, static_chain_value);
1320 static_chain_value = 0;
1323 /* If this is setting the virtual stack vars register, this must
1324 be the code at the handler for a builtin longjmp. The value
1325 saved in the setjmp buffer will be the address of the frame
1326 we've made for this inlined instance within our frame. But we
1327 know the offset of that value so we can use it to reconstruct
1328 our virtual stack vars register from that value. If we are
1329 copying it from the stack pointer, leave it unchanged. */
1331 && rtx_equal_p (SET_DEST (set), virtual_stack_vars_rtx))
1333 HOST_WIDE_INT offset;
1334 temp = map->reg_map[REGNO (SET_DEST (set))];
1335 temp = VARRAY_CONST_EQUIV (map->const_equiv_varray,
1338 if (rtx_equal_p (temp, virtual_stack_vars_rtx))
1340 else if (GET_CODE (temp) == PLUS
1341 && rtx_equal_p (XEXP (temp, 0), virtual_stack_vars_rtx)
1342 && GET_CODE (XEXP (temp, 1)) == CONST_INT)
1343 offset = INTVAL (XEXP (temp, 1));
1347 if (rtx_equal_p (SET_SRC (set), stack_pointer_rtx))
1348 temp = SET_SRC (set);
1350 temp = force_operand (plus_constant (SET_SRC (set),
1354 copy = emit_move_insn (virtual_stack_vars_rtx, temp);
1358 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1359 /* REG_NOTES will be copied later. */
1362 /* If this insn is setting CC0, it may need to look at
1363 the insn that uses CC0 to see what type of insn it is.
1364 In that case, the call to recog via validate_change will
1365 fail. So don't substitute constants here. Instead,
1366 do it when we emit the following insn.
1368 For example, see the pyr.md file. That machine has signed and
1369 unsigned compares. The compare patterns must check the
1370 following branch insn to see which what kind of compare to
1373 If the previous insn set CC0, substitute constants on it as
1375 if (sets_cc0_p (PATTERN (copy)) != 0)
1380 try_constants (cc0_insn, map);
1382 try_constants (copy, map);
1385 try_constants (copy, map);
1390 if (GET_CODE (PATTERN (insn)) == RETURN
1391 || (GET_CODE (PATTERN (insn)) == PARALLEL
1392 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == RETURN))
1394 if (local_return_label == 0)
1395 local_return_label = gen_label_rtx ();
1396 pattern = gen_jump (local_return_label);
1399 pattern = copy_rtx_and_substitute (PATTERN (insn), map, 0);
1401 copy = emit_jump_insn (pattern);
1405 try_constants (cc0_insn, map);
1408 try_constants (copy, map);
1410 /* If this used to be a conditional jump insn but whose branch
1411 direction is now know, we must do something special. */
1412 if (any_condjump_p (insn) && onlyjump_p (insn) && map->last_pc_value)
1415 /* If the previous insn set cc0 for us, delete it. */
1416 if (sets_cc0_p (PREV_INSN (copy)))
1417 delete_insn (PREV_INSN (copy));
1420 /* If this is now a no-op, delete it. */
1421 if (map->last_pc_value == pc_rtx)
1427 /* Otherwise, this is unconditional jump so we must put a
1428 BARRIER after it. We could do some dead code elimination
1429 here, but jump.c will do it just as well. */
1435 /* If this is a CALL_PLACEHOLDER insn then we need to copy the
1436 three attached sequences: normal call, sibling call and tail
1438 if (GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
1443 for (i = 0; i < 3; i++)
1447 sequence[i] = NULL_RTX;
1448 seq = XEXP (PATTERN (insn), i);
1452 copy_insn_list (seq, map, static_chain_value);
1453 sequence[i] = get_insns ();
1458 /* Find the new tail recursion label.
1459 It will already be substituted into sequence[2]. */
1460 tail_label = copy_rtx_and_substitute (XEXP (PATTERN (insn), 3),
1463 copy = emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode,
1471 pattern = copy_rtx_and_substitute (PATTERN (insn), map, 0);
1472 copy = emit_call_insn (pattern);
1474 SIBLING_CALL_P (copy) = SIBLING_CALL_P (insn);
1475 CONST_CALL_P (copy) = CONST_CALL_P (insn);
1477 /* Because the USAGE information potentially contains objects other
1478 than hard registers, we need to copy it. */
1480 CALL_INSN_FUNCTION_USAGE (copy)
1481 = copy_rtx_and_substitute (CALL_INSN_FUNCTION_USAGE (insn),
1486 try_constants (cc0_insn, map);
1489 try_constants (copy, map);
1491 /* Be lazy and assume CALL_INSNs clobber all hard registers. */
1492 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1493 VARRAY_CONST_EQUIV (map->const_equiv_varray, i).rtx = 0;
1497 copy = emit_label (get_label_from_map (map,
1498 CODE_LABEL_NUMBER (insn)));
1499 LABEL_NAME (copy) = LABEL_NAME (insn);
1504 copy = emit_barrier ();
1508 /* NOTE_INSN_FUNCTION_END and NOTE_INSN_FUNCTION_BEG are
1509 discarded because it is important to have only one of
1510 each in the current function.
1512 NOTE_INSN_DELETED notes aren't useful.
1514 NOTE_INSN_BASIC_BLOCK is discarded because the saved bb
1515 pointer (which will soon be dangling) confuses flow's
1516 attempts to preserve bb structures during the compilation
1519 if (NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_END
1520 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_BEG
1521 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_DELETED
1522 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_BASIC_BLOCK)
1524 copy = emit_note (NOTE_SOURCE_FILE (insn),
1525 NOTE_LINE_NUMBER (insn));
1527 && (NOTE_LINE_NUMBER (copy) == NOTE_INSN_EH_REGION_BEG
1528 || NOTE_LINE_NUMBER (copy) == NOTE_INSN_EH_REGION_END))
1531 = get_label_from_map (map, NOTE_EH_HANDLER (copy));
1533 /* We have to duplicate the handlers for the original. */
1534 if (NOTE_LINE_NUMBER (copy) == NOTE_INSN_EH_REGION_BEG)
1536 /* We need to duplicate the handlers for the EH region
1537 and we need to indicate where the label map is */
1539 duplicate_eh_handlers (NOTE_EH_HANDLER (copy),
1540 CODE_LABEL_NUMBER (label),
1541 expand_inline_function_eh_labelmap);
1544 /* We have to forward these both to match the new exception
1546 NOTE_EH_HANDLER (copy) = CODE_LABEL_NUMBER (label);
1549 && (NOTE_LINE_NUMBER (copy) == NOTE_INSN_BLOCK_BEG
1550 || NOTE_LINE_NUMBER (copy) == NOTE_INSN_BLOCK_END)
1551 && NOTE_BLOCK (insn))
1553 tree *mapped_block_p;
1556 = (tree *) bsearch (NOTE_BLOCK (insn),
1557 &VARRAY_TREE (map->block_map, 0),
1558 map->block_map->elements_used,
1562 if (!mapped_block_p)
1565 NOTE_BLOCK (copy) = *mapped_block_p;
1577 RTX_INTEGRATED_P (copy) = 1;
1579 map->insn_map[INSN_UID (insn)] = copy;
1582 /* Now copy the REG_NOTES. Increment const_age, so that only constants
1583 from parameters can be substituted in. These are the only ones that
1584 are valid across the entire function. */
1586 for (insn = insns; insn; insn = NEXT_INSN (insn))
1588 && map->insn_map[INSN_UID (insn)]
1589 && REG_NOTES (insn))
1591 rtx next, note = copy_rtx_and_substitute (REG_NOTES (insn), map, 0);
1593 /* We must also do subst_constants, in case one of our parameters
1594 has const type and constant value. */
1595 subst_constants (¬e, NULL_RTX, map, 0);
1596 apply_change_group ();
1597 REG_NOTES (map->insn_map[INSN_UID (insn)]) = note;
1599 /* Finally, delete any REG_LABEL notes from the chain. */
1600 for (; note; note = next)
1602 next = XEXP (note, 1);
1603 if (REG_NOTE_KIND (note) == REG_LABEL)
1604 remove_note (map->insn_map[INSN_UID (insn)], note);
1608 if (local_return_label)
1609 emit_label (local_return_label);
1612 /* Given a chain of PARM_DECLs, ARGS, copy each decl into a VAR_DECL,
1613 push all of those decls and give each one the corresponding home. */
1616 integrate_parm_decls (args, map, arg_vector)
1618 struct inline_remap *map;
1624 for (tail = args, i = 0; tail; tail = TREE_CHAIN (tail), i++)
1626 tree decl = copy_decl_for_inlining (tail, map->fndecl,
1627 current_function_decl);
1629 = copy_rtx_and_substitute (RTVEC_ELT (arg_vector, i), map, 1);
1631 /* We really should be setting DECL_INCOMING_RTL to something reasonable
1632 here, but that's going to require some more work. */
1633 /* DECL_INCOMING_RTL (decl) = ?; */
1634 /* Fully instantiate the address with the equivalent form so that the
1635 debugging information contains the actual register, instead of the
1636 virtual register. Do this by not passing an insn to
1638 subst_constants (&new_decl_rtl, NULL_RTX, map, 1);
1639 apply_change_group ();
1640 SET_DECL_RTL (decl, new_decl_rtl);
1644 /* Given a BLOCK node LET, push decls and levels so as to construct in the
1645 current function a tree of contexts isomorphic to the one that is given.
1647 MAP, if nonzero, is a pointer to an inline_remap map which indicates how
1648 registers used in the DECL_RTL field should be remapped. If it is zero,
1649 no mapping is necessary. */
1652 integrate_decl_tree (let, map)
1654 struct inline_remap *map;
1660 new_block = make_node (BLOCK);
1661 VARRAY_PUSH_TREE (map->block_map, new_block);
1662 next = &BLOCK_VARS (new_block);
1664 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
1668 d = copy_decl_for_inlining (t, map->fndecl, current_function_decl);
1670 if (DECL_RTL_SET_P (t))
1674 SET_DECL_RTL (d, copy_rtx_and_substitute (DECL_RTL (t), map, 1));
1676 /* Fully instantiate the address with the equivalent form so that the
1677 debugging information contains the actual register, instead of the
1678 virtual register. Do this by not passing an insn to
1681 subst_constants (&r, NULL_RTX, map, 1);
1682 SET_DECL_RTL (d, r);
1683 apply_change_group ();
1686 /* Add this declaration to the list of variables in the new
1689 next = &TREE_CHAIN (d);
1692 next = &BLOCK_SUBBLOCKS (new_block);
1693 for (t = BLOCK_SUBBLOCKS (let); t; t = BLOCK_CHAIN (t))
1695 *next = integrate_decl_tree (t, map);
1696 BLOCK_SUPERCONTEXT (*next) = new_block;
1697 next = &BLOCK_CHAIN (*next);
1700 TREE_USED (new_block) = TREE_USED (let);
1701 BLOCK_ABSTRACT_ORIGIN (new_block) = let;
1706 /* Create a new copy of an rtx. Recursively copies the operands of the rtx,
1707 except for those few rtx codes that are sharable.
1709 We always return an rtx that is similar to that incoming rtx, with the
1710 exception of possibly changing a REG to a SUBREG or vice versa. No
1711 rtl is ever emitted.
1713 If FOR_LHS is nonzero, if means we are processing something that will
1714 be the LHS of a SET. In that case, we copy RTX_UNCHANGING_P even if
1715 inlining since we need to be conservative in how it is set for
1718 Handle constants that need to be placed in the constant pool by
1719 calling `force_const_mem'. */
1722 copy_rtx_and_substitute (orig, map, for_lhs)
1724 struct inline_remap *map;
1727 register rtx copy, temp;
1729 register RTX_CODE code;
1730 register enum machine_mode mode;
1731 register const char *format_ptr;
1737 code = GET_CODE (orig);
1738 mode = GET_MODE (orig);
1743 /* If the stack pointer register shows up, it must be part of
1744 stack-adjustments (*not* because we eliminated the frame pointer!).
1745 Small hard registers are returned as-is. Pseudo-registers
1746 go through their `reg_map'. */
1747 regno = REGNO (orig);
1748 if (regno <= LAST_VIRTUAL_REGISTER
1749 || (map->integrating
1750 && DECL_SAVED_INSNS (map->fndecl)->internal_arg_pointer == orig))
1752 /* Some hard registers are also mapped,
1753 but others are not translated. */
1754 if (map->reg_map[regno] != 0
1755 /* We shouldn't usually have reg_map set for return
1756 register, but it may happen if we have leaf-register
1757 remapping and the return register is used in one of
1758 the calling sequences of a call_placeholer. In this
1759 case, we'll end up with a reg_map set for this
1760 register, but we don't want to use for registers
1761 marked as return values. */
1762 && ! REG_FUNCTION_VALUE_P (orig))
1763 return map->reg_map[regno];
1765 /* If this is the virtual frame pointer, make space in current
1766 function's stack frame for the stack frame of the inline function.
1768 Copy the address of this area into a pseudo. Map
1769 virtual_stack_vars_rtx to this pseudo and set up a constant
1770 equivalence for it to be the address. This will substitute the
1771 address into insns where it can be substituted and use the new
1772 pseudo where it can't. */
1773 else if (regno == VIRTUAL_STACK_VARS_REGNUM)
1776 int size = get_func_frame_size (DECL_SAVED_INSNS (map->fndecl));
1777 #ifdef FRAME_GROWS_DOWNWARD
1779 = (DECL_SAVED_INSNS (map->fndecl)->stack_alignment_needed
1782 /* In this case, virtual_stack_vars_rtx points to one byte
1783 higher than the top of the frame area. So make sure we
1784 allocate a big enough chunk to keep the frame pointer
1785 aligned like a real one. */
1787 size = CEIL_ROUND (size, alignment);
1790 loc = assign_stack_temp (BLKmode, size, 1);
1791 loc = XEXP (loc, 0);
1792 #ifdef FRAME_GROWS_DOWNWARD
1793 /* In this case, virtual_stack_vars_rtx points to one byte
1794 higher than the top of the frame area. So compute the offset
1795 to one byte higher than our substitute frame. */
1796 loc = plus_constant (loc, size);
1798 map->reg_map[regno] = temp
1799 = force_reg (Pmode, force_operand (loc, NULL_RTX));
1801 #ifdef STACK_BOUNDARY
1802 mark_reg_pointer (map->reg_map[regno], STACK_BOUNDARY);
1805 SET_CONST_EQUIV_DATA (map, temp, loc, CONST_AGE_PARM);
1807 seq = gen_sequence ();
1809 emit_insn_after (seq, map->insns_at_start);
1812 else if (regno == VIRTUAL_INCOMING_ARGS_REGNUM
1813 || (map->integrating
1814 && (DECL_SAVED_INSNS (map->fndecl)->internal_arg_pointer
1817 /* Do the same for a block to contain any arguments referenced
1820 int size = DECL_SAVED_INSNS (map->fndecl)->args_size;
1823 loc = assign_stack_temp (BLKmode, size, 1);
1824 loc = XEXP (loc, 0);
1825 /* When arguments grow downward, the virtual incoming
1826 args pointer points to the top of the argument block,
1827 so the remapped location better do the same. */
1828 #ifdef ARGS_GROW_DOWNWARD
1829 loc = plus_constant (loc, size);
1831 map->reg_map[regno] = temp
1832 = force_reg (Pmode, force_operand (loc, NULL_RTX));
1834 #ifdef STACK_BOUNDARY
1835 mark_reg_pointer (map->reg_map[regno], STACK_BOUNDARY);
1838 SET_CONST_EQUIV_DATA (map, temp, loc, CONST_AGE_PARM);
1840 seq = gen_sequence ();
1842 emit_insn_after (seq, map->insns_at_start);
1845 else if (REG_FUNCTION_VALUE_P (orig))
1847 /* This is a reference to the function return value. If
1848 the function doesn't have a return value, error. If the
1849 mode doesn't agree, and it ain't BLKmode, make a SUBREG. */
1850 if (map->inline_target == 0)
1852 if (rtx_equal_function_value_matters)
1853 /* This is an ignored return value. We must not
1854 leave it in with REG_FUNCTION_VALUE_P set, since
1855 that would confuse subsequent inlining of the
1856 current function into a later function. */
1857 return gen_rtx_REG (GET_MODE (orig), regno);
1859 /* Must be unrolling loops or replicating code if we
1860 reach here, so return the register unchanged. */
1863 else if (GET_MODE (map->inline_target) != BLKmode
1864 && mode != GET_MODE (map->inline_target))
1865 return gen_lowpart (mode, map->inline_target);
1867 return map->inline_target;
1869 #if defined (LEAF_REGISTERS) && defined (LEAF_REG_REMAP)
1870 /* If leaf_renumber_regs_insn() might remap this register to
1871 some other number, make sure we don't share it with the
1872 inlined function, otherwise delayed optimization of the
1873 inlined function may change it in place, breaking our
1874 reference to it. We may still shared it within the
1875 function, so create an entry for this register in the
1877 if (map->integrating && regno < FIRST_PSEUDO_REGISTER
1878 && LEAF_REGISTERS[regno] && LEAF_REG_REMAP (regno) != regno)
1880 temp = gen_rtx_REG (mode, regno);
1881 map->reg_map[regno] = temp;
1890 if (map->reg_map[regno] == NULL)
1892 map->reg_map[regno] = gen_reg_rtx (mode);
1893 REG_USERVAR_P (map->reg_map[regno]) = REG_USERVAR_P (orig);
1894 REG_LOOP_TEST_P (map->reg_map[regno]) = REG_LOOP_TEST_P (orig);
1895 RTX_UNCHANGING_P (map->reg_map[regno]) = RTX_UNCHANGING_P (orig);
1896 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
1898 if (REG_POINTER (map->x_regno_reg_rtx[regno]))
1899 mark_reg_pointer (map->reg_map[regno],
1900 map->regno_pointer_align[regno]);
1902 return map->reg_map[regno];
1905 copy = copy_rtx_and_substitute (SUBREG_REG (orig), map, for_lhs);
1906 /* SUBREG is ordinary, but don't make nested SUBREGs. */
1907 if (GET_CODE (copy) == SUBREG)
1908 return gen_rtx_SUBREG (GET_MODE (orig), SUBREG_REG (copy),
1909 SUBREG_WORD (orig) + SUBREG_WORD (copy));
1910 else if (GET_CODE (copy) == CONCAT)
1912 rtx retval = subreg_realpart_p (orig) ? XEXP (copy, 0) : XEXP (copy, 1);
1914 if (GET_MODE (retval) == GET_MODE (orig))
1917 return gen_rtx_SUBREG (GET_MODE (orig), retval,
1918 (SUBREG_WORD (orig) %
1919 (GET_MODE_UNIT_SIZE (GET_MODE (SUBREG_REG (orig)))
1920 / (unsigned) UNITS_PER_WORD)));
1923 return gen_rtx_SUBREG (GET_MODE (orig), copy,
1924 SUBREG_WORD (orig));
1927 copy = gen_rtx_ADDRESSOF (mode,
1928 copy_rtx_and_substitute (XEXP (orig, 0),
1930 0, ADDRESSOF_DECL (orig));
1931 regno = ADDRESSOF_REGNO (orig);
1932 if (map->reg_map[regno])
1933 regno = REGNO (map->reg_map[regno]);
1934 else if (regno > LAST_VIRTUAL_REGISTER)
1936 temp = XEXP (orig, 0);
1937 map->reg_map[regno] = gen_reg_rtx (GET_MODE (temp));
1938 REG_USERVAR_P (map->reg_map[regno]) = REG_USERVAR_P (temp);
1939 REG_LOOP_TEST_P (map->reg_map[regno]) = REG_LOOP_TEST_P (temp);
1940 RTX_UNCHANGING_P (map->reg_map[regno]) = RTX_UNCHANGING_P (temp);
1941 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
1943 if (REG_POINTER (map->x_regno_reg_rtx[regno]))
1944 mark_reg_pointer (map->reg_map[regno],
1945 map->regno_pointer_align[regno]);
1946 regno = REGNO (map->reg_map[regno]);
1948 ADDRESSOF_REGNO (copy) = regno;
1953 /* USE and CLOBBER are ordinary, but we convert (use (subreg foo))
1954 to (use foo) if the original insn didn't have a subreg.
1955 Removing the subreg distorts the VAX movstrhi pattern
1956 by changing the mode of an operand. */
1957 copy = copy_rtx_and_substitute (XEXP (orig, 0), map, code == CLOBBER);
1958 if (GET_CODE (copy) == SUBREG && GET_CODE (XEXP (orig, 0)) != SUBREG)
1959 copy = SUBREG_REG (copy);
1960 return gen_rtx_fmt_e (code, VOIDmode, copy);
1963 LABEL_PRESERVE_P (get_label_from_map (map, CODE_LABEL_NUMBER (orig)))
1964 = LABEL_PRESERVE_P (orig);
1965 return get_label_from_map (map, CODE_LABEL_NUMBER (orig));
1967 /* We need to handle "deleted" labels that appear in the DECL_RTL
1970 if (NOTE_LINE_NUMBER (orig) == NOTE_INSN_DELETED_LABEL)
1971 return map->insn_map[INSN_UID (orig)];
1978 LABEL_REF_NONLOCAL_P (orig) ? XEXP (orig, 0)
1979 : get_label_from_map (map, CODE_LABEL_NUMBER (XEXP (orig, 0))));
1981 LABEL_OUTSIDE_LOOP_P (copy) = LABEL_OUTSIDE_LOOP_P (orig);
1983 /* The fact that this label was previously nonlocal does not mean
1984 it still is, so we must check if it is within the range of
1985 this function's labels. */
1986 LABEL_REF_NONLOCAL_P (copy)
1987 = (LABEL_REF_NONLOCAL_P (orig)
1988 && ! (CODE_LABEL_NUMBER (XEXP (copy, 0)) >= get_first_label_num ()
1989 && CODE_LABEL_NUMBER (XEXP (copy, 0)) < max_label_num ()));
1991 /* If we have made a nonlocal label local, it means that this
1992 inlined call will be referring to our nonlocal goto handler.
1993 So make sure we create one for this block; we normally would
1994 not since this is not otherwise considered a "call". */
1995 if (LABEL_REF_NONLOCAL_P (orig) && ! LABEL_REF_NONLOCAL_P (copy))
1996 function_call_count++;
2006 /* Symbols which represent the address of a label stored in the constant
2007 pool must be modified to point to a constant pool entry for the
2008 remapped label. Otherwise, symbols are returned unchanged. */
2009 if (CONSTANT_POOL_ADDRESS_P (orig))
2011 struct function *f = inlining ? inlining : cfun;
2012 rtx constant = get_pool_constant_for_function (f, orig);
2013 enum machine_mode const_mode = get_pool_mode_for_function (f, orig);
2016 rtx temp = force_const_mem (const_mode,
2017 copy_rtx_and_substitute (constant,
2021 /* Legitimizing the address here is incorrect.
2023 Since we had a SYMBOL_REF before, we can assume it is valid
2024 to have one in this position in the insn.
2026 Also, change_address may create new registers. These
2027 registers will not have valid reg_map entries. This can
2028 cause try_constants() to fail because assumes that all
2029 registers in the rtx have valid reg_map entries, and it may
2030 end up replacing one of these new registers with junk. */
2032 if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0)))
2033 temp = change_address (temp, GET_MODE (temp), XEXP (temp, 0));
2036 temp = XEXP (temp, 0);
2038 #ifdef POINTERS_EXTEND_UNSIGNED
2039 if (GET_MODE (temp) != GET_MODE (orig))
2040 temp = convert_memory_address (GET_MODE (orig), temp);
2044 else if (GET_CODE (constant) == LABEL_REF)
2045 return XEXP (force_const_mem
2047 copy_rtx_and_substitute (constant, map, for_lhs)),
2050 else if (SYMBOL_REF_NEED_ADJUST (orig))
2053 return rethrow_symbol_map (orig,
2054 expand_inline_function_eh_labelmap);
2060 /* We have to make a new copy of this CONST_DOUBLE because don't want
2061 to use the old value of CONST_DOUBLE_MEM. Also, this may be a
2062 duplicate of a CONST_DOUBLE we have already seen. */
2063 if (GET_MODE_CLASS (GET_MODE (orig)) == MODE_FLOAT)
2067 REAL_VALUE_FROM_CONST_DOUBLE (d, orig);
2068 return CONST_DOUBLE_FROM_REAL_VALUE (d, GET_MODE (orig));
2071 return immed_double_const (CONST_DOUBLE_LOW (orig),
2072 CONST_DOUBLE_HIGH (orig), VOIDmode);
2075 /* Make new constant pool entry for a constant
2076 that was in the pool of the inline function. */
2077 if (RTX_INTEGRATED_P (orig))
2082 /* If a single asm insn contains multiple output operands then
2083 it contains multiple ASM_OPERANDS rtx's that share the input
2084 and constraint vecs. We must make sure that the copied insn
2085 continues to share it. */
2086 if (map->orig_asm_operands_vector == ASM_OPERANDS_INPUT_VEC (orig))
2088 copy = rtx_alloc (ASM_OPERANDS);
2089 copy->volatil = orig->volatil;
2090 PUT_MODE (copy, GET_MODE (orig));
2091 ASM_OPERANDS_TEMPLATE (copy) = ASM_OPERANDS_TEMPLATE (orig);
2092 ASM_OPERANDS_OUTPUT_CONSTRAINT (copy)
2093 = ASM_OPERANDS_OUTPUT_CONSTRAINT (orig);
2094 ASM_OPERANDS_OUTPUT_IDX (copy) = ASM_OPERANDS_OUTPUT_IDX (orig);
2095 ASM_OPERANDS_INPUT_VEC (copy) = map->copy_asm_operands_vector;
2096 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy)
2097 = map->copy_asm_constraints_vector;
2098 ASM_OPERANDS_SOURCE_FILE (copy) = ASM_OPERANDS_SOURCE_FILE (orig);
2099 ASM_OPERANDS_SOURCE_LINE (copy) = ASM_OPERANDS_SOURCE_LINE (orig);
2105 /* This is given special treatment because the first
2106 operand of a CALL is a (MEM ...) which may get
2107 forced into a register for cse. This is undesirable
2108 if function-address cse isn't wanted or if we won't do cse. */
2109 #ifndef NO_FUNCTION_CSE
2110 if (! (optimize && ! flag_no_function_cse))
2115 gen_rtx_MEM (GET_MODE (XEXP (orig, 0)),
2116 copy_rtx_and_substitute (XEXP (XEXP (orig, 0), 0),
2118 copy_rtx_and_substitute (XEXP (orig, 1), map, 0));
2122 /* Must be ifdefed out for loop unrolling to work. */
2128 /* If this is setting fp or ap, it means that we have a nonlocal goto.
2129 Adjust the setting by the offset of the area we made.
2130 If the nonlocal goto is into the current function,
2131 this will result in unnecessarily bad code, but should work. */
2132 if (SET_DEST (orig) == virtual_stack_vars_rtx
2133 || SET_DEST (orig) == virtual_incoming_args_rtx)
2135 /* In case a translation hasn't occurred already, make one now. */
2138 HOST_WIDE_INT loc_offset;
2140 copy_rtx_and_substitute (SET_DEST (orig), map, for_lhs);
2141 equiv_reg = map->reg_map[REGNO (SET_DEST (orig))];
2142 equiv_loc = VARRAY_CONST_EQUIV (map->const_equiv_varray,
2143 REGNO (equiv_reg)).rtx;
2145 = GET_CODE (equiv_loc) == REG ? 0 : INTVAL (XEXP (equiv_loc, 1));
2147 return gen_rtx_SET (VOIDmode, SET_DEST (orig),
2150 (copy_rtx_and_substitute (SET_SRC (orig),
2156 return gen_rtx_SET (VOIDmode,
2157 copy_rtx_and_substitute (SET_DEST (orig), map, 1),
2158 copy_rtx_and_substitute (SET_SRC (orig), map, 0));
2163 && GET_CODE (XEXP (orig, 0)) == SYMBOL_REF
2164 && CONSTANT_POOL_ADDRESS_P (XEXP (orig, 0)))
2166 enum machine_mode const_mode
2167 = get_pool_mode_for_function (inlining, XEXP (orig, 0));
2169 = get_pool_constant_for_function (inlining, XEXP (orig, 0));
2171 constant = copy_rtx_and_substitute (constant, map, 0);
2173 /* If this was an address of a constant pool entry that itself
2174 had to be placed in the constant pool, it might not be a
2175 valid address. So the recursive call might have turned it
2176 into a register. In that case, it isn't a constant any
2177 more, so return it. This has the potential of changing a
2178 MEM into a REG, but we'll assume that it safe. */
2179 if (! CONSTANT_P (constant))
2182 return validize_mem (force_const_mem (const_mode, constant));
2185 copy = rtx_alloc (MEM);
2186 PUT_MODE (copy, mode);
2187 XEXP (copy, 0) = copy_rtx_and_substitute (XEXP (orig, 0), map, 0);
2188 MEM_COPY_ATTRIBUTES (copy, orig);
2195 copy = rtx_alloc (code);
2196 PUT_MODE (copy, mode);
2197 copy->in_struct = orig->in_struct;
2198 copy->volatil = orig->volatil;
2199 copy->unchanging = orig->unchanging;
2201 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
2203 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
2205 switch (*format_ptr++)
2208 /* Copy this through the wide int field; that's safest. */
2209 X0WINT (copy, i) = X0WINT (orig, i);
2214 = copy_rtx_and_substitute (XEXP (orig, i), map, for_lhs);
2218 /* Change any references to old-insns to point to the
2219 corresponding copied insns. */
2220 XEXP (copy, i) = map->insn_map[INSN_UID (XEXP (orig, i))];
2224 XVEC (copy, i) = XVEC (orig, i);
2225 if (XVEC (orig, i) != NULL && XVECLEN (orig, i) != 0)
2227 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
2228 for (j = 0; j < XVECLEN (copy, i); j++)
2229 XVECEXP (copy, i, j)
2230 = copy_rtx_and_substitute (XVECEXP (orig, i, j),
2236 XWINT (copy, i) = XWINT (orig, i);
2240 XINT (copy, i) = XINT (orig, i);
2244 XSTR (copy, i) = XSTR (orig, i);
2248 XTREE (copy, i) = XTREE (orig, i);
2256 if (code == ASM_OPERANDS && map->orig_asm_operands_vector == 0)
2258 map->orig_asm_operands_vector = ASM_OPERANDS_INPUT_VEC (orig);
2259 map->copy_asm_operands_vector = ASM_OPERANDS_INPUT_VEC (copy);
2260 map->copy_asm_constraints_vector
2261 = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy);
2267 /* Substitute known constant values into INSN, if that is valid. */
2270 try_constants (insn, map)
2272 struct inline_remap *map;
2278 /* First try just updating addresses, then other things. This is
2279 important when we have something like the store of a constant
2280 into memory and we can update the memory address but the machine
2281 does not support a constant source. */
2282 subst_constants (&PATTERN (insn), insn, map, 1);
2283 apply_change_group ();
2284 subst_constants (&PATTERN (insn), insn, map, 0);
2285 apply_change_group ();
2287 /* Show we don't know the value of anything stored or clobbered. */
2288 note_stores (PATTERN (insn), mark_stores, NULL);
2289 map->last_pc_value = 0;
2291 map->last_cc0_value = 0;
2294 /* Set up any constant equivalences made in this insn. */
2295 for (i = 0; i < map->num_sets; i++)
2297 if (GET_CODE (map->equiv_sets[i].dest) == REG)
2299 int regno = REGNO (map->equiv_sets[i].dest);
2301 MAYBE_EXTEND_CONST_EQUIV_VARRAY (map, regno);
2302 if (VARRAY_CONST_EQUIV (map->const_equiv_varray, regno).rtx == 0
2303 /* Following clause is a hack to make case work where GNU C++
2304 reassigns a variable to make cse work right. */
2305 || ! rtx_equal_p (VARRAY_CONST_EQUIV (map->const_equiv_varray,
2307 map->equiv_sets[i].equiv))
2308 SET_CONST_EQUIV_DATA (map, map->equiv_sets[i].dest,
2309 map->equiv_sets[i].equiv, map->const_age);
2311 else if (map->equiv_sets[i].dest == pc_rtx)
2312 map->last_pc_value = map->equiv_sets[i].equiv;
2314 else if (map->equiv_sets[i].dest == cc0_rtx)
2315 map->last_cc0_value = map->equiv_sets[i].equiv;
2320 /* Substitute known constants for pseudo regs in the contents of LOC,
2321 which are part of INSN.
2322 If INSN is zero, the substitution should always be done (this is used to
2324 These changes are taken out by try_constants if the result is not valid.
2326 Note that we are more concerned with determining when the result of a SET
2327 is a constant, for further propagation, than actually inserting constants
2328 into insns; cse will do the latter task better.
2330 This function is also used to adjust address of items previously addressed
2331 via the virtual stack variable or virtual incoming arguments registers.
2333 If MEMONLY is nonzero, only make changes inside a MEM. */
2336 subst_constants (loc, insn, map, memonly)
2339 struct inline_remap *map;
2344 register enum rtx_code code;
2345 register const char *format_ptr;
2346 int num_changes = num_validated_changes ();
2348 enum machine_mode op0_mode = MAX_MACHINE_MODE;
2350 code = GET_CODE (x);
2366 validate_change (insn, loc, map->last_cc0_value, 1);
2372 /* The only thing we can do with a USE or CLOBBER is possibly do
2373 some substitutions in a MEM within it. */
2374 if (GET_CODE (XEXP (x, 0)) == MEM)
2375 subst_constants (&XEXP (XEXP (x, 0), 0), insn, map, 0);
2379 /* Substitute for parms and known constants. Don't replace
2380 hard regs used as user variables with constants. */
2383 int regno = REGNO (x);
2384 struct const_equiv_data *p;
2386 if (! (regno < FIRST_PSEUDO_REGISTER && REG_USERVAR_P (x))
2387 && (size_t) regno < VARRAY_SIZE (map->const_equiv_varray)
2388 && (p = &VARRAY_CONST_EQUIV (map->const_equiv_varray, regno),
2390 && p->age >= map->const_age)
2391 validate_change (insn, loc, p->rtx, 1);
2396 /* SUBREG applied to something other than a reg
2397 should be treated as ordinary, since that must
2398 be a special hack and we don't know how to treat it specially.
2399 Consider for example mulsidi3 in m68k.md.
2400 Ordinary SUBREG of a REG needs this special treatment. */
2401 if (! memonly && GET_CODE (SUBREG_REG (x)) == REG)
2403 rtx inner = SUBREG_REG (x);
2406 /* We can't call subst_constants on &SUBREG_REG (x) because any
2407 constant or SUBREG wouldn't be valid inside our SUBEG. Instead,
2408 see what is inside, try to form the new SUBREG and see if that is
2409 valid. We handle two cases: extracting a full word in an
2410 integral mode and extracting the low part. */
2411 subst_constants (&inner, NULL_RTX, map, 0);
2413 if (GET_MODE_CLASS (GET_MODE (x)) == MODE_INT
2414 && GET_MODE_SIZE (GET_MODE (x)) == UNITS_PER_WORD
2415 && GET_MODE (SUBREG_REG (x)) != VOIDmode)
2416 new = operand_subword (inner, SUBREG_WORD (x), 0,
2417 GET_MODE (SUBREG_REG (x)));
2419 cancel_changes (num_changes);
2420 if (new == 0 && subreg_lowpart_p (x))
2421 new = gen_lowpart_common (GET_MODE (x), inner);
2424 validate_change (insn, loc, new, 1);
2431 subst_constants (&XEXP (x, 0), insn, map, 0);
2433 /* If a memory address got spoiled, change it back. */
2434 if (! memonly && insn != 0 && num_validated_changes () != num_changes
2435 && ! memory_address_p (GET_MODE (x), XEXP (x, 0)))
2436 cancel_changes (num_changes);
2441 /* Substitute constants in our source, and in any arguments to a
2442 complex (e..g, ZERO_EXTRACT) destination, but not in the destination
2444 rtx *dest_loc = &SET_DEST (x);
2445 rtx dest = *dest_loc;
2447 enum machine_mode compare_mode = VOIDmode;
2449 /* If SET_SRC is a COMPARE which subst_constants would turn into
2450 COMPARE of 2 VOIDmode constants, note the mode in which comparison
2452 if (GET_CODE (SET_SRC (x)) == COMPARE)
2455 if (GET_MODE_CLASS (GET_MODE (src)) == MODE_CC
2461 compare_mode = GET_MODE (XEXP (src, 0));
2462 if (compare_mode == VOIDmode)
2463 compare_mode = GET_MODE (XEXP (src, 1));
2467 subst_constants (&SET_SRC (x), insn, map, memonly);
2470 while (GET_CODE (*dest_loc) == ZERO_EXTRACT
2471 || GET_CODE (*dest_loc) == SUBREG
2472 || GET_CODE (*dest_loc) == STRICT_LOW_PART)
2474 if (GET_CODE (*dest_loc) == ZERO_EXTRACT)
2476 subst_constants (&XEXP (*dest_loc, 1), insn, map, memonly);
2477 subst_constants (&XEXP (*dest_loc, 2), insn, map, memonly);
2479 dest_loc = &XEXP (*dest_loc, 0);
2482 /* Do substitute in the address of a destination in memory. */
2483 if (GET_CODE (*dest_loc) == MEM)
2484 subst_constants (&XEXP (*dest_loc, 0), insn, map, 0);
2486 /* Check for the case of DEST a SUBREG, both it and the underlying
2487 register are less than one word, and the SUBREG has the wider mode.
2488 In the case, we are really setting the underlying register to the
2489 source converted to the mode of DEST. So indicate that. */
2490 if (GET_CODE (dest) == SUBREG
2491 && GET_MODE_SIZE (GET_MODE (dest)) <= UNITS_PER_WORD
2492 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest))) <= UNITS_PER_WORD
2493 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest)))
2494 <= GET_MODE_SIZE (GET_MODE (dest)))
2495 && (tem = gen_lowpart_if_possible (GET_MODE (SUBREG_REG (dest)),
2497 src = tem, dest = SUBREG_REG (dest);
2499 /* If storing a recognizable value save it for later recording. */
2500 if ((map->num_sets < MAX_RECOG_OPERANDS)
2501 && (CONSTANT_P (src)
2502 || (GET_CODE (src) == REG
2503 && (REGNO (src) == VIRTUAL_INCOMING_ARGS_REGNUM
2504 || REGNO (src) == VIRTUAL_STACK_VARS_REGNUM))
2505 || (GET_CODE (src) == PLUS
2506 && GET_CODE (XEXP (src, 0)) == REG
2507 && (REGNO (XEXP (src, 0)) == VIRTUAL_INCOMING_ARGS_REGNUM
2508 || REGNO (XEXP (src, 0)) == VIRTUAL_STACK_VARS_REGNUM)
2509 && CONSTANT_P (XEXP (src, 1)))
2510 || GET_CODE (src) == COMPARE
2515 && (src == pc_rtx || GET_CODE (src) == RETURN
2516 || GET_CODE (src) == LABEL_REF))))
2518 /* Normally, this copy won't do anything. But, if SRC is a COMPARE
2519 it will cause us to save the COMPARE with any constants
2520 substituted, which is what we want for later. */
2521 rtx src_copy = copy_rtx (src);
2522 map->equiv_sets[map->num_sets].equiv = src_copy;
2523 map->equiv_sets[map->num_sets++].dest = dest;
2524 if (compare_mode != VOIDmode
2525 && GET_CODE (src) == COMPARE
2526 && (GET_MODE_CLASS (GET_MODE (src)) == MODE_CC
2531 && GET_MODE (XEXP (src, 0)) == VOIDmode
2532 && GET_MODE (XEXP (src, 1)) == VOIDmode)
2534 map->compare_src = src_copy;
2535 map->compare_mode = compare_mode;
2545 format_ptr = GET_RTX_FORMAT (code);
2547 /* If the first operand is an expression, save its mode for later. */
2548 if (*format_ptr == 'e')
2549 op0_mode = GET_MODE (XEXP (x, 0));
2551 for (i = 0; i < GET_RTX_LENGTH (code); i++)
2553 switch (*format_ptr++)
2560 subst_constants (&XEXP (x, i), insn, map, memonly);
2572 if (XVEC (x, i) != NULL && XVECLEN (x, i) != 0)
2573 for (j = 0; j < XVECLEN (x, i); j++)
2574 subst_constants (&XVECEXP (x, i, j), insn, map, memonly);
2583 /* If this is a commutative operation, move a constant to the second
2584 operand unless the second operand is already a CONST_INT. */
2586 && (GET_RTX_CLASS (code) == 'c' || code == NE || code == EQ)
2587 && CONSTANT_P (XEXP (x, 0)) && GET_CODE (XEXP (x, 1)) != CONST_INT)
2589 rtx tem = XEXP (x, 0);
2590 validate_change (insn, &XEXP (x, 0), XEXP (x, 1), 1);
2591 validate_change (insn, &XEXP (x, 1), tem, 1);
2594 /* Simplify the expression in case we put in some constants. */
2596 switch (GET_RTX_CLASS (code))
2599 if (op0_mode == MAX_MACHINE_MODE)
2601 new = simplify_unary_operation (code, GET_MODE (x),
2602 XEXP (x, 0), op0_mode);
2607 enum machine_mode op_mode = GET_MODE (XEXP (x, 0));
2609 if (op_mode == VOIDmode)
2610 op_mode = GET_MODE (XEXP (x, 1));
2611 new = simplify_relational_operation (code, op_mode,
2612 XEXP (x, 0), XEXP (x, 1));
2613 #ifdef FLOAT_STORE_FLAG_VALUE
2614 if (new != 0 && GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT)
2616 enum machine_mode mode = GET_MODE (x);
2617 if (new == const0_rtx)
2618 new = CONST0_RTX (mode);
2621 REAL_VALUE_TYPE val = FLOAT_STORE_FLAG_VALUE (mode);
2622 new = CONST_DOUBLE_FROM_REAL_VALUE (val, mode);
2631 new = simplify_binary_operation (code, GET_MODE (x),
2632 XEXP (x, 0), XEXP (x, 1));
2637 if (op0_mode == MAX_MACHINE_MODE)
2640 if (code == IF_THEN_ELSE)
2642 rtx op0 = XEXP (x, 0);
2644 if (GET_RTX_CLASS (GET_CODE (op0)) == '<'
2645 && GET_MODE (op0) == VOIDmode
2646 && ! side_effects_p (op0)
2647 && XEXP (op0, 0) == map->compare_src
2648 && GET_MODE (XEXP (op0, 1)) == VOIDmode)
2650 /* We have compare of two VOIDmode constants for which
2651 we recorded the comparison mode. */
2653 simplify_relational_operation (GET_CODE (op0),
2658 if (temp == const0_rtx)
2660 else if (temp == const1_rtx)
2665 new = simplify_ternary_operation (code, GET_MODE (x), op0_mode,
2666 XEXP (x, 0), XEXP (x, 1),
2672 validate_change (insn, loc, new, 1);
2675 /* Show that register modified no longer contain known constants. We are
2676 called from note_stores with parts of the new insn. */
2679 mark_stores (dest, x, data)
2681 rtx x ATTRIBUTE_UNUSED;
2682 void *data ATTRIBUTE_UNUSED;
2685 enum machine_mode mode = VOIDmode;
2687 /* DEST is always the innermost thing set, except in the case of
2688 SUBREGs of hard registers. */
2690 if (GET_CODE (dest) == REG)
2691 regno = REGNO (dest), mode = GET_MODE (dest);
2692 else if (GET_CODE (dest) == SUBREG && GET_CODE (SUBREG_REG (dest)) == REG)
2694 regno = REGNO (SUBREG_REG (dest)) + SUBREG_WORD (dest);
2695 mode = GET_MODE (SUBREG_REG (dest));
2700 unsigned int uregno = regno;
2701 unsigned int last_reg = (uregno >= FIRST_PSEUDO_REGISTER ? uregno
2702 : uregno + HARD_REGNO_NREGS (uregno, mode) - 1);
2705 /* Ignore virtual stack var or virtual arg register since those
2706 are handled separately. */
2707 if (uregno != VIRTUAL_INCOMING_ARGS_REGNUM
2708 && uregno != VIRTUAL_STACK_VARS_REGNUM)
2709 for (i = uregno; i <= last_reg; i++)
2710 if ((size_t) i < VARRAY_SIZE (global_const_equiv_varray))
2711 VARRAY_CONST_EQUIV (global_const_equiv_varray, i).rtx = 0;
2715 /* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the
2716 given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so
2717 that it points to the node itself, thus indicating that the node is its
2718 own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for
2719 the given node is NULL, recursively descend the decl/block tree which
2720 it is the root of, and for each other ..._DECL or BLOCK node contained
2721 therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also
2722 still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN
2723 values to point to themselves. */
2726 set_block_origin_self (stmt)
2729 if (BLOCK_ABSTRACT_ORIGIN (stmt) == NULL_TREE)
2731 BLOCK_ABSTRACT_ORIGIN (stmt) = stmt;
2734 register tree local_decl;
2736 for (local_decl = BLOCK_VARS (stmt);
2737 local_decl != NULL_TREE;
2738 local_decl = TREE_CHAIN (local_decl))
2739 set_decl_origin_self (local_decl); /* Potential recursion. */
2743 register tree subblock;
2745 for (subblock = BLOCK_SUBBLOCKS (stmt);
2746 subblock != NULL_TREE;
2747 subblock = BLOCK_CHAIN (subblock))
2748 set_block_origin_self (subblock); /* Recurse. */
2753 /* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for
2754 the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the
2755 node to so that it points to the node itself, thus indicating that the
2756 node represents its own (abstract) origin. Additionally, if the
2757 DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend
2758 the decl/block tree of which the given node is the root of, and for
2759 each other ..._DECL or BLOCK node contained therein whose
2760 DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL,
2761 set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to
2762 point to themselves. */
2765 set_decl_origin_self (decl)
2768 if (DECL_ABSTRACT_ORIGIN (decl) == NULL_TREE)
2770 DECL_ABSTRACT_ORIGIN (decl) = decl;
2771 if (TREE_CODE (decl) == FUNCTION_DECL)
2775 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2776 DECL_ABSTRACT_ORIGIN (arg) = arg;
2777 if (DECL_INITIAL (decl) != NULL_TREE
2778 && DECL_INITIAL (decl) != error_mark_node)
2779 set_block_origin_self (DECL_INITIAL (decl));
2784 /* Given a pointer to some BLOCK node, and a boolean value to set the
2785 "abstract" flags to, set that value into the BLOCK_ABSTRACT flag for
2786 the given block, and for all local decls and all local sub-blocks
2787 (recursively) which are contained therein. */
2790 set_block_abstract_flags (stmt, setting)
2792 register int setting;
2794 register tree local_decl;
2795 register tree subblock;
2797 BLOCK_ABSTRACT (stmt) = setting;
2799 for (local_decl = BLOCK_VARS (stmt);
2800 local_decl != NULL_TREE;
2801 local_decl = TREE_CHAIN (local_decl))
2802 set_decl_abstract_flags (local_decl, setting);
2804 for (subblock = BLOCK_SUBBLOCKS (stmt);
2805 subblock != NULL_TREE;
2806 subblock = BLOCK_CHAIN (subblock))
2807 set_block_abstract_flags (subblock, setting);
2810 /* Given a pointer to some ..._DECL node, and a boolean value to set the
2811 "abstract" flags to, set that value into the DECL_ABSTRACT flag for the
2812 given decl, and (in the case where the decl is a FUNCTION_DECL) also
2813 set the abstract flags for all of the parameters, local vars, local
2814 blocks and sub-blocks (recursively) to the same setting. */
2817 set_decl_abstract_flags (decl, setting)
2819 register int setting;
2821 DECL_ABSTRACT (decl) = setting;
2822 if (TREE_CODE (decl) == FUNCTION_DECL)
2826 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2827 DECL_ABSTRACT (arg) = setting;
2828 if (DECL_INITIAL (decl) != NULL_TREE
2829 && DECL_INITIAL (decl) != error_mark_node)
2830 set_block_abstract_flags (DECL_INITIAL (decl), setting);
2834 /* Output the assembly language code for the function FNDECL
2835 from its DECL_SAVED_INSNS. Used for inline functions that are output
2836 at end of compilation instead of where they came in the source. */
2839 output_inline_function (fndecl)
2842 struct function *old_cfun = cfun;
2843 enum debug_info_type old_write_symbols = write_symbols;
2844 struct function *f = DECL_SAVED_INSNS (fndecl);
2847 current_function_decl = fndecl;
2848 clear_emit_caches ();
2850 set_new_last_label_num (f->inl_max_label_num);
2852 /* We're not deferring this any longer. */
2853 DECL_DEFER_OUTPUT (fndecl) = 0;
2855 /* If requested, suppress debugging information. */
2856 if (f->no_debugging_symbols)
2857 write_symbols = NO_DEBUG;
2859 /* Do any preparation, such as emitting abstract debug info for the inline
2860 before it gets mangled by optimization. */
2861 note_outlining_of_inline_function (fndecl);
2863 /* Compile this function all the way down to assembly code. */
2864 rest_of_compilation (fndecl);
2866 /* We can't inline this anymore. */
2868 DECL_INLINE (fndecl) = 0;
2871 current_function_decl = old_cfun ? old_cfun->decl : 0;
2872 write_symbols = old_write_symbols;