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. */
31 #include "insn-config.h"
32 #include "insn-flags.h"
36 #include "integrate.h"
45 #define obstack_chunk_alloc xmalloc
46 #define obstack_chunk_free free
48 extern struct obstack *function_maybepermanent_obstack;
50 /* Similar, but round to the next highest integer that meets the
52 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
54 /* Default max number of insns a function can have and still be inline.
55 This is overridden on RISC machines. */
56 #ifndef INTEGRATE_THRESHOLD
57 /* Inlining small functions might save more space then not inlining at
58 all. Assume 1 instruction for the call and 1.5 insns per argument. */
59 #define INTEGRATE_THRESHOLD(DECL) \
61 ? (1 + (3 * list_length (DECL_ARGUMENTS (DECL))) / 2) \
62 : (8 * (8 + list_length (DECL_ARGUMENTS (DECL)))))
65 /* Decide whether a function with a target specific attribute
66 attached can be inlined. By default we disallow this. */
67 #ifndef FUNCTION_ATTRIBUTE_INLINABLE_P
68 #define FUNCTION_ATTRIBUTE_INLINABLE_P(FNDECL) 0
71 static rtvec initialize_for_inline PARAMS ((tree));
72 static void note_modified_parmregs PARAMS ((rtx, rtx, void *));
73 static void integrate_parm_decls PARAMS ((tree, struct inline_remap *,
75 static tree integrate_decl_tree PARAMS ((tree,
76 struct inline_remap *));
77 static void subst_constants PARAMS ((rtx *, rtx,
78 struct inline_remap *, int));
79 static void set_block_origin_self PARAMS ((tree));
80 static void set_block_abstract_flags PARAMS ((tree, int));
81 static void process_reg_param PARAMS ((struct inline_remap *, rtx,
83 void set_decl_abstract_flags PARAMS ((tree, int));
84 static rtx expand_inline_function_eh_labelmap PARAMS ((rtx));
85 static void mark_stores PARAMS ((rtx, rtx, void *));
86 static void save_parm_insns PARAMS ((rtx, rtx));
87 static void copy_insn_list PARAMS ((rtx, struct inline_remap *,
89 static int compare_blocks PARAMS ((const PTR, const PTR));
90 static int find_block PARAMS ((const PTR, const PTR));
92 /* The maximum number of instructions accepted for inlining a
93 function. Increasing values mean more agressive inlining.
94 This affects currently only functions explicitly marked as
95 inline (or methods defined within the class definition for C++).
96 The default value of 10000 is arbitrary but high to match the
97 previously unlimited gcc capabilities. */
99 int inline_max_insns = 10000;
101 /* Used by copy_rtx_and_substitute; this indicates whether the function is
102 called for the purpose of inlining or some other purpose (i.e. loop
103 unrolling). This affects how constant pool references are handled.
104 This variable contains the FUNCTION_DECL for the inlined function. */
105 static struct function *inlining = 0;
107 /* Returns the Ith entry in the label_map contained in MAP. If the
108 Ith entry has not yet been set, return a fresh label. This function
109 performs a lazy initialization of label_map, thereby avoiding huge memory
110 explosions when the label_map gets very large. */
113 get_label_from_map (map, i)
114 struct inline_remap *map;
117 rtx x = map->label_map[i];
120 x = map->label_map[i] = gen_label_rtx ();
125 /* Zero if the current function (whose FUNCTION_DECL is FNDECL)
126 is safe and reasonable to integrate into other functions.
127 Nonzero means value is a warning msgid with a single %s
128 for the function's name. */
131 function_cannot_inline_p (fndecl)
132 register tree fndecl;
135 tree last = tree_last (TYPE_ARG_TYPES (TREE_TYPE (fndecl)));
137 /* For functions marked as inline increase the maximum size to
138 inline_max_insns (-finline-limit-<n>). For regular functions
139 use the limit given by INTEGRATE_THRESHOLD. */
141 int max_insns = (DECL_INLINE (fndecl))
143 + 8 * list_length (DECL_ARGUMENTS (fndecl)))
144 : INTEGRATE_THRESHOLD (fndecl);
146 register int ninsns = 0;
150 /* No inlines with varargs. */
151 if ((last && TREE_VALUE (last) != void_type_node)
152 || current_function_varargs)
153 return N_("varargs function cannot be inline");
155 if (current_function_calls_alloca)
156 return N_("function using alloca cannot be inline");
158 if (current_function_calls_setjmp)
159 return N_("function using setjmp cannot be inline");
161 if (current_function_contains_functions)
162 return N_("function with nested functions cannot be inline");
166 N_("function with label addresses used in initializers cannot inline");
168 if (current_function_cannot_inline)
169 return current_function_cannot_inline;
171 /* If its not even close, don't even look. */
172 if (get_max_uid () > 3 * max_insns)
173 return N_("function too large to be inline");
176 /* Don't inline functions which do not specify a function prototype and
177 have BLKmode argument or take the address of a parameter. */
178 for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms))
180 if (TYPE_MODE (TREE_TYPE (parms)) == BLKmode)
181 TREE_ADDRESSABLE (parms) = 1;
182 if (last == NULL_TREE && TREE_ADDRESSABLE (parms))
183 return N_("no prototype, and parameter address used; cannot be inline");
187 /* We can't inline functions that return structures
188 the old-fashioned PCC way, copying into a static block. */
189 if (current_function_returns_pcc_struct)
190 return N_("inline functions not supported for this return value type");
192 /* We can't inline functions that return structures of varying size. */
193 if (TREE_CODE (TREE_TYPE (TREE_TYPE (fndecl))) != VOID_TYPE
194 && int_size_in_bytes (TREE_TYPE (TREE_TYPE (fndecl))) < 0)
195 return N_("function with varying-size return value cannot be inline");
197 /* Cannot inline a function with a varying size argument or one that
198 receives a transparent union. */
199 for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms))
201 if (int_size_in_bytes (TREE_TYPE (parms)) < 0)
202 return N_("function with varying-size parameter cannot be inline");
203 else if (TREE_CODE (TREE_TYPE (parms)) == UNION_TYPE
204 && TYPE_TRANSPARENT_UNION (TREE_TYPE (parms)))
205 return N_("function with transparent unit parameter cannot be inline");
208 if (get_max_uid () > max_insns)
210 for (ninsns = 0, insn = get_first_nonparm_insn ();
211 insn && ninsns < max_insns;
212 insn = NEXT_INSN (insn))
216 if (ninsns >= max_insns)
217 return N_("function too large to be inline");
220 /* We will not inline a function which uses computed goto. The addresses of
221 its local labels, which may be tucked into global storage, are of course
222 not constant across instantiations, which causes unexpected behaviour. */
223 if (current_function_has_computed_jump)
224 return N_("function with computed jump cannot inline");
226 /* We cannot inline a nested function that jumps to a nonlocal label. */
227 if (current_function_has_nonlocal_goto)
228 return N_("function with nonlocal goto cannot be inline");
230 /* This is a hack, until the inliner is taught about eh regions at
231 the start of the function. */
232 for (insn = get_insns ();
234 && ! (GET_CODE (insn) == NOTE
235 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG);
236 insn = NEXT_INSN (insn))
238 if (insn && GET_CODE (insn) == NOTE
239 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG)
240 return N_("function with complex parameters cannot be inline");
243 /* We can't inline functions that return a PARALLEL rtx. */
244 result = DECL_RTL (DECL_RESULT (fndecl));
245 if (result && GET_CODE (result) == PARALLEL)
246 return N_("inline functions not supported for this return value type");
248 /* If the function has a target specific attribute attached to it,
249 then we assume that we should not inline it. This can be overriden
250 by the target if it defines FUNCTION_ATTRIBUTE_INLINABLE_P. */
251 if (DECL_MACHINE_ATTRIBUTES (fndecl)
252 && ! FUNCTION_ATTRIBUTE_INLINABLE_P (fndecl))
253 return N_("function with target specific attribute(s) cannot be inlined");
258 /* Map pseudo reg number into the PARM_DECL for the parm living in the reg.
259 Zero for a reg that isn't a parm's home.
260 Only reg numbers less than max_parm_reg are mapped here. */
261 static tree *parmdecl_map;
263 /* In save_for_inline, nonzero if past the parm-initialization insns. */
264 static int in_nonparm_insns;
266 /* Subroutine for `save_for_inline_nocopy'. Performs initialization
267 needed to save FNDECL's insns and info for future inline expansion. */
270 initialize_for_inline (fndecl)
277 /* Clear out PARMDECL_MAP. It was allocated in the caller's frame. */
278 bzero ((char *) parmdecl_map, max_parm_reg * sizeof (tree));
279 arg_vector = rtvec_alloc (list_length (DECL_ARGUMENTS (fndecl)));
281 for (parms = DECL_ARGUMENTS (fndecl), i = 0;
283 parms = TREE_CHAIN (parms), i++)
285 rtx p = DECL_RTL (parms);
287 /* If we have (mem (addressof (mem ...))), use the inner MEM since
288 otherwise the copy_rtx call below will not unshare the MEM since
289 it shares ADDRESSOF. */
290 if (GET_CODE (p) == MEM && GET_CODE (XEXP (p, 0)) == ADDRESSOF
291 && GET_CODE (XEXP (XEXP (p, 0), 0)) == MEM)
292 p = XEXP (XEXP (p, 0), 0);
294 RTVEC_ELT (arg_vector, i) = p;
296 if (GET_CODE (p) == REG)
297 parmdecl_map[REGNO (p)] = parms;
298 else if (GET_CODE (p) == CONCAT)
300 rtx preal = gen_realpart (GET_MODE (XEXP (p, 0)), p);
301 rtx pimag = gen_imagpart (GET_MODE (preal), p);
303 if (GET_CODE (preal) == REG)
304 parmdecl_map[REGNO (preal)] = parms;
305 if (GET_CODE (pimag) == REG)
306 parmdecl_map[REGNO (pimag)] = parms;
309 /* This flag is cleared later
310 if the function ever modifies the value of the parm. */
311 TREE_READONLY (parms) = 1;
317 /* Copy NODE (which must be a DECL, but not a PARM_DECL). The DECL
318 originally was in the FROM_FN, but now it will be in the
322 copy_decl_for_inlining (decl, from_fn, to_fn)
329 /* Copy the declaration. */
330 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
332 /* For a parameter, we must make an equivalent VAR_DECL, not a
334 copy = build_decl (VAR_DECL, DECL_NAME (decl), TREE_TYPE (decl));
335 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
336 TREE_READONLY (copy) = TREE_READONLY (decl);
337 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
341 copy = copy_node (decl);
342 if (DECL_LANG_SPECIFIC (copy))
343 copy_lang_decl (copy);
345 /* TREE_ADDRESSABLE isn't used to indicate that a label's
346 address has been taken; it's for internal bookkeeping in
347 expand_goto_internal. */
348 if (TREE_CODE (copy) == LABEL_DECL)
349 TREE_ADDRESSABLE (copy) = 0;
352 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
353 declaration inspired this copy. */
354 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
356 /* The new variable/label has no RTL, yet. */
357 DECL_RTL (copy) = NULL_RTX;
359 /* These args would always appear unused, if not for this. */
360 TREE_USED (copy) = 1;
362 /* Set the context for the new declaration. */
363 if (!DECL_CONTEXT (decl))
364 /* Globals stay global. */
366 else if (DECL_CONTEXT (decl) != from_fn)
367 /* Things that weren't in the scope of the function we're inlining
368 from aren't in the scope we're inlining too, either. */
370 else if (TREE_STATIC (decl))
371 /* Function-scoped static variables should say in the original
375 /* Ordinary automatic local variables are now in the scope of the
377 DECL_CONTEXT (copy) = to_fn;
382 /* Make the insns and PARM_DECLs of the current function permanent
383 and record other information in DECL_SAVED_INSNS to allow inlining
384 of this function in subsequent calls.
386 This routine need not copy any insns because we are not going
387 to immediately compile the insns in the insn chain. There
388 are two cases when we would compile the insns for FNDECL:
389 (1) when FNDECL is expanded inline, and (2) when FNDECL needs to
390 be output at the end of other compilation, because somebody took
391 its address. In the first case, the insns of FNDECL are copied
392 as it is expanded inline, so FNDECL's saved insns are not
393 modified. In the second case, FNDECL is used for the last time,
394 so modifying the rtl is not a problem.
396 We don't have to worry about FNDECL being inline expanded by
397 other functions which are written at the end of compilation
398 because flag_no_inline is turned on when we begin writing
399 functions at the end of compilation. */
402 save_for_inline_nocopy (fndecl)
407 rtx first_nonparm_insn;
409 /* Set up PARMDECL_MAP which maps pseudo-reg number to its PARM_DECL.
410 Later we set TREE_READONLY to 0 if the parm is modified inside the fn.
411 Also set up ARG_VECTOR, which holds the unmodified DECL_RTX values
412 for the parms, prior to elimination of virtual registers.
413 These values are needed for substituting parms properly. */
415 parmdecl_map = (tree *) xmalloc (max_parm_reg * sizeof (tree));
417 /* Make and emit a return-label if we have not already done so. */
419 if (return_label == 0)
421 return_label = gen_label_rtx ();
422 emit_label (return_label);
425 argvec = initialize_for_inline (fndecl);
427 /* If there are insns that copy parms from the stack into pseudo registers,
428 those insns are not copied. `expand_inline_function' must
429 emit the correct code to handle such things. */
432 if (GET_CODE (insn) != NOTE)
435 /* Get the insn which signals the end of parameter setup code. */
436 first_nonparm_insn = get_first_nonparm_insn ();
438 /* Now just scan the chain of insns to see what happens to our
439 PARM_DECLs. If a PARM_DECL is used but never modified, we
440 can substitute its rtl directly when expanding inline (and
441 perform constant folding when its incoming value is constant).
442 Otherwise, we have to copy its value into a new register and track
443 the new register's life. */
444 in_nonparm_insns = 0;
445 save_parm_insns (insn, first_nonparm_insn);
447 /* We have now allocated all that needs to be allocated permanently
448 on the rtx obstack. Set our high-water mark, so that we
449 can free the rest of this when the time comes. */
453 cfun->inl_max_label_num = max_label_num ();
454 cfun->inl_last_parm_insn = cfun->x_last_parm_insn;
455 cfun->original_arg_vector = argvec;
456 cfun->original_decl_initial = DECL_INITIAL (fndecl);
457 DECL_SAVED_INSNS (fndecl) = cfun;
463 /* Scan the chain of insns to see what happens to our PARM_DECLs. If a
464 PARM_DECL is used but never modified, we can substitute its rtl directly
465 when expanding inline (and perform constant folding when its incoming
466 value is constant). Otherwise, we have to copy its value into a new
467 register and track the new register's life. */
470 save_parm_insns (insn, first_nonparm_insn)
472 rtx first_nonparm_insn;
474 if (insn == NULL_RTX)
477 for (insn = NEXT_INSN (insn); insn; insn = NEXT_INSN (insn))
479 if (insn == first_nonparm_insn)
480 in_nonparm_insns = 1;
484 /* Record what interesting things happen to our parameters. */
485 note_stores (PATTERN (insn), note_modified_parmregs, NULL);
487 /* If this is a CALL_PLACEHOLDER insn then we need to look into the
488 three attached sequences: normal call, sibling call and tail
490 if (GET_CODE (insn) == CALL_INSN
491 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
495 for (i = 0; i < 3; i++)
496 save_parm_insns (XEXP (PATTERN (insn), i),
503 /* Note whether a parameter is modified or not. */
506 note_modified_parmregs (reg, x, data)
508 rtx x ATTRIBUTE_UNUSED;
509 void *data ATTRIBUTE_UNUSED;
511 if (GET_CODE (reg) == REG && in_nonparm_insns
512 && REGNO (reg) < max_parm_reg
513 && REGNO (reg) >= FIRST_PSEUDO_REGISTER
514 && parmdecl_map[REGNO (reg)] != 0)
515 TREE_READONLY (parmdecl_map[REGNO (reg)]) = 0;
518 /* Unfortunately, we need a global copy of const_equiv map for communication
519 with a function called from note_stores. Be *very* careful that this
520 is used properly in the presence of recursion. */
522 varray_type global_const_equiv_varray;
524 #define FIXED_BASE_PLUS_P(X) \
525 (GET_CODE (X) == PLUS && GET_CODE (XEXP (X, 1)) == CONST_INT \
526 && GET_CODE (XEXP (X, 0)) == REG \
527 && REGNO (XEXP (X, 0)) >= FIRST_VIRTUAL_REGISTER \
528 && REGNO (XEXP (X, 0)) <= LAST_VIRTUAL_REGISTER)
530 /* Called to set up a mapping for the case where a parameter is in a
531 register. If it is read-only and our argument is a constant, set up the
532 constant equivalence.
534 If LOC is REG_USERVAR_P, the usual case, COPY must also have that flag set
537 Also, don't allow hard registers here; they might not be valid when
538 substituted into insns. */
540 process_reg_param (map, loc, copy)
541 struct inline_remap *map;
544 if ((GET_CODE (copy) != REG && GET_CODE (copy) != SUBREG)
545 || (GET_CODE (copy) == REG && REG_USERVAR_P (loc)
546 && ! REG_USERVAR_P (copy))
547 || (GET_CODE (copy) == REG
548 && REGNO (copy) < FIRST_PSEUDO_REGISTER))
550 rtx temp = copy_to_mode_reg (GET_MODE (loc), copy);
551 REG_USERVAR_P (temp) = REG_USERVAR_P (loc);
552 if (CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy))
553 SET_CONST_EQUIV_DATA (map, temp, copy, CONST_AGE_PARM);
556 map->reg_map[REGNO (loc)] = copy;
559 /* Used by duplicate_eh_handlers to map labels for the exception table */
560 static struct inline_remap *eif_eh_map;
563 expand_inline_function_eh_labelmap (label)
566 int index = CODE_LABEL_NUMBER (label);
567 return get_label_from_map (eif_eh_map, index);
570 /* Compare two BLOCKs for qsort. The key we sort on is the
571 BLOCK_ABSTRACT_ORIGIN of the blocks. */
574 compare_blocks (v1, v2)
578 tree b1 = *((const tree *) v1);
579 tree b2 = *((const tree *) v2);
581 return ((char *) BLOCK_ABSTRACT_ORIGIN (b1)
582 - (char *) BLOCK_ABSTRACT_ORIGIN (b2));
585 /* Compare two BLOCKs for bsearch. The first pointer corresponds to
586 an original block; the second to a remapped equivalent. */
593 const union tree_node *b1 = (const union tree_node *) v1;
594 tree b2 = *((const tree *) v2);
596 return ((const char *) b1 - (char *) BLOCK_ABSTRACT_ORIGIN (b2));
599 /* Integrate the procedure defined by FNDECL. Note that this function
600 may wind up calling itself. Since the static variables are not
601 reentrant, we do not assign them until after the possibility
602 of recursion is eliminated.
604 If IGNORE is nonzero, do not produce a value.
605 Otherwise store the value in TARGET if it is nonzero and that is convenient.
608 (rtx)-1 if we could not substitute the function
609 0 if we substituted it and it does not produce a value
610 else an rtx for where the value is stored. */
613 expand_inline_function (fndecl, parms, target, ignore, type,
614 structure_value_addr)
619 rtx structure_value_addr;
621 struct function *inlining_previous;
622 struct function *inl_f = DECL_SAVED_INSNS (fndecl);
623 tree formal, actual, block;
624 rtx parm_insns = inl_f->emit->x_first_insn;
625 rtx insns = (inl_f->inl_last_parm_insn
626 ? NEXT_INSN (inl_f->inl_last_parm_insn)
632 int min_labelno = inl_f->emit->x_first_label_num;
633 int max_labelno = inl_f->inl_max_label_num;
638 struct inline_remap *map = 0;
642 rtvec arg_vector = (rtvec) inl_f->original_arg_vector;
643 rtx static_chain_value = 0;
646 /* The pointer used to track the true location of the memory used
647 for MAP->LABEL_MAP. */
648 rtx *real_label_map = 0;
650 /* Allow for equivalences of the pseudos we make for virtual fp and ap. */
651 max_regno = inl_f->emit->x_reg_rtx_no + 3;
652 if (max_regno < FIRST_PSEUDO_REGISTER)
655 /* Pull out the decl for the function definition; fndecl may be a
656 local declaration, which would break DECL_ABSTRACT_ORIGIN. */
657 fndecl = inl_f->decl;
659 nargs = list_length (DECL_ARGUMENTS (fndecl));
661 if (cfun->preferred_stack_boundary < inl_f->preferred_stack_boundary)
662 cfun->preferred_stack_boundary = inl_f->preferred_stack_boundary;
664 /* Check that the parms type match and that sufficient arguments were
665 passed. Since the appropriate conversions or default promotions have
666 already been applied, the machine modes should match exactly. */
668 for (formal = DECL_ARGUMENTS (fndecl), actual = parms;
670 formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual))
673 enum machine_mode mode;
676 return (rtx) (HOST_WIDE_INT) -1;
678 arg = TREE_VALUE (actual);
679 mode = TYPE_MODE (DECL_ARG_TYPE (formal));
681 if (mode != TYPE_MODE (TREE_TYPE (arg))
682 /* If they are block mode, the types should match exactly.
683 They don't match exactly if TREE_TYPE (FORMAL) == ERROR_MARK_NODE,
684 which could happen if the parameter has incomplete type. */
686 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg))
687 != TYPE_MAIN_VARIANT (TREE_TYPE (formal)))))
688 return (rtx) (HOST_WIDE_INT) -1;
691 /* Extra arguments are valid, but will be ignored below, so we must
692 evaluate them here for side-effects. */
693 for (; actual; actual = TREE_CHAIN (actual))
694 expand_expr (TREE_VALUE (actual), const0_rtx,
695 TYPE_MODE (TREE_TYPE (TREE_VALUE (actual))), 0);
697 /* Expand the function arguments. Do this first so that any
698 new registers get created before we allocate the maps. */
700 arg_vals = (rtx *) xmalloc (nargs * sizeof (rtx));
701 arg_trees = (tree *) xmalloc (nargs * sizeof (tree));
703 for (formal = DECL_ARGUMENTS (fndecl), actual = parms, i = 0;
705 formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual), i++)
707 /* Actual parameter, converted to the type of the argument within the
709 tree arg = convert (TREE_TYPE (formal), TREE_VALUE (actual));
710 /* Mode of the variable used within the function. */
711 enum machine_mode mode = TYPE_MODE (TREE_TYPE (formal));
715 loc = RTVEC_ELT (arg_vector, i);
717 /* If this is an object passed by invisible reference, we copy the
718 object into a stack slot and save its address. If this will go
719 into memory, we do nothing now. Otherwise, we just expand the
721 if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG
722 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)
725 = assign_stack_temp (TYPE_MODE (TREE_TYPE (arg)),
726 int_size_in_bytes (TREE_TYPE (arg)), 1);
727 MEM_SET_IN_STRUCT_P (stack_slot,
728 AGGREGATE_TYPE_P (TREE_TYPE (arg)));
730 store_expr (arg, stack_slot, 0);
732 arg_vals[i] = XEXP (stack_slot, 0);
735 else if (GET_CODE (loc) != MEM)
737 if (GET_MODE (loc) != TYPE_MODE (TREE_TYPE (arg)))
738 /* The mode if LOC and ARG can differ if LOC was a variable
739 that had its mode promoted via PROMOTED_MODE. */
740 arg_vals[i] = convert_modes (GET_MODE (loc),
741 TYPE_MODE (TREE_TYPE (arg)),
742 expand_expr (arg, NULL_RTX, mode,
744 TREE_UNSIGNED (TREE_TYPE (formal)));
746 arg_vals[i] = expand_expr (arg, NULL_RTX, mode, EXPAND_SUM);
752 && (! TREE_READONLY (formal)
753 /* If the parameter is not read-only, copy our argument through
754 a register. Also, we cannot use ARG_VALS[I] if it overlaps
755 TARGET in any way. In the inline function, they will likely
756 be two different pseudos, and `safe_from_p' will make all
757 sorts of smart assumptions about their not conflicting.
758 But if ARG_VALS[I] overlaps TARGET, these assumptions are
759 wrong, so put ARG_VALS[I] into a fresh register.
760 Don't worry about invisible references, since their stack
761 temps will never overlap the target. */
764 && (GET_CODE (arg_vals[i]) == REG
765 || GET_CODE (arg_vals[i]) == SUBREG
766 || GET_CODE (arg_vals[i]) == MEM)
767 && reg_overlap_mentioned_p (arg_vals[i], target))
768 /* ??? We must always copy a SUBREG into a REG, because it might
769 get substituted into an address, and not all ports correctly
770 handle SUBREGs in addresses. */
771 || (GET_CODE (arg_vals[i]) == SUBREG)))
772 arg_vals[i] = copy_to_mode_reg (GET_MODE (loc), arg_vals[i]);
774 if (arg_vals[i] != 0 && GET_CODE (arg_vals[i]) == REG
775 && POINTER_TYPE_P (TREE_TYPE (formal)))
776 mark_reg_pointer (arg_vals[i],
777 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (formal))));
780 /* Allocate the structures we use to remap things. */
782 map = (struct inline_remap *) xmalloc (sizeof (struct inline_remap));
783 map->fndecl = fndecl;
785 VARRAY_TREE_INIT (map->block_map, 10, "block_map");
786 map->reg_map = (rtx *) xcalloc (max_regno, sizeof (rtx));
788 /* We used to use alloca here, but the size of what it would try to
789 allocate would occasionally cause it to exceed the stack limit and
790 cause unpredictable core dumps. */
792 = (rtx *) xmalloc ((max_labelno) * sizeof (rtx));
793 map->label_map = real_label_map;
795 inl_max_uid = (inl_f->emit->x_cur_insn_uid + 1);
796 map->insn_map = (rtx *) xcalloc (inl_max_uid, sizeof (rtx));
798 map->max_insnno = inl_max_uid;
800 map->integrating = 1;
802 /* const_equiv_varray maps pseudos in our routine to constants, so
803 it needs to be large enough for all our pseudos. This is the
804 number we are currently using plus the number in the called
805 routine, plus 15 for each arg, five to compute the virtual frame
806 pointer, and five for the return value. This should be enough
807 for most cases. We do not reference entries outside the range of
810 ??? These numbers are quite arbitrary and were obtained by
811 experimentation. At some point, we should try to allocate the
812 table after all the parameters are set up so we an more accurately
813 estimate the number of pseudos we will need. */
815 VARRAY_CONST_EQUIV_INIT (map->const_equiv_varray,
817 + (max_regno - FIRST_PSEUDO_REGISTER)
820 "expand_inline_function");
823 /* Record the current insn in case we have to set up pointers to frame
824 and argument memory blocks. If there are no insns yet, add a dummy
825 insn that can be used as an insertion point. */
826 map->insns_at_start = get_last_insn ();
827 if (map->insns_at_start == 0)
828 map->insns_at_start = emit_note (NULL_PTR, NOTE_INSN_DELETED);
830 map->regno_pointer_flag = inl_f->emit->regno_pointer_flag;
831 map->regno_pointer_align = inl_f->emit->regno_pointer_align;
833 /* Update the outgoing argument size to allow for those in the inlined
835 if (inl_f->outgoing_args_size > current_function_outgoing_args_size)
836 current_function_outgoing_args_size = inl_f->outgoing_args_size;
838 /* If the inline function needs to make PIC references, that means
839 that this function's PIC offset table must be used. */
840 if (inl_f->uses_pic_offset_table)
841 current_function_uses_pic_offset_table = 1;
843 /* If this function needs a context, set it up. */
844 if (inl_f->needs_context)
845 static_chain_value = lookup_static_chain (fndecl);
847 if (GET_CODE (parm_insns) == NOTE
848 && NOTE_LINE_NUMBER (parm_insns) > 0)
850 rtx note = emit_note (NOTE_SOURCE_FILE (parm_insns),
851 NOTE_LINE_NUMBER (parm_insns));
853 RTX_INTEGRATED_P (note) = 1;
856 /* Process each argument. For each, set up things so that the function's
857 reference to the argument will refer to the argument being passed.
858 We only replace REG with REG here. Any simplifications are done
861 We make two passes: In the first, we deal with parameters that will
862 be placed into registers, since we need to ensure that the allocated
863 register number fits in const_equiv_map. Then we store all non-register
864 parameters into their memory location. */
866 /* Don't try to free temp stack slots here, because we may put one of the
867 parameters into a temp stack slot. */
869 for (i = 0; i < nargs; i++)
871 rtx copy = arg_vals[i];
873 loc = RTVEC_ELT (arg_vector, i);
875 /* There are three cases, each handled separately. */
876 if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG
877 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)
879 /* This must be an object passed by invisible reference (it could
880 also be a variable-sized object, but we forbid inlining functions
881 with variable-sized arguments). COPY is the address of the
882 actual value (this computation will cause it to be copied). We
883 map that address for the register, noting the actual address as
884 an equivalent in case it can be substituted into the insns. */
886 if (GET_CODE (copy) != REG)
888 temp = copy_addr_to_reg (copy);
889 if (CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy))
890 SET_CONST_EQUIV_DATA (map, temp, copy, CONST_AGE_PARM);
893 map->reg_map[REGNO (XEXP (loc, 0))] = copy;
895 else if (GET_CODE (loc) == MEM)
897 /* This is the case of a parameter that lives in memory. It
898 will live in the block we allocate in the called routine's
899 frame that simulates the incoming argument area. Do nothing
900 with the parameter now; we will call store_expr later. In
901 this case, however, we must ensure that the virtual stack and
902 incoming arg rtx values are expanded now so that we can be
903 sure we have enough slots in the const equiv map since the
904 store_expr call can easily blow the size estimate. */
905 if (DECL_FRAME_SIZE (fndecl) != 0)
906 copy_rtx_and_substitute (virtual_stack_vars_rtx, map, 0);
908 if (DECL_SAVED_INSNS (fndecl)->args_size != 0)
909 copy_rtx_and_substitute (virtual_incoming_args_rtx, map, 0);
911 else if (GET_CODE (loc) == REG)
912 process_reg_param (map, loc, copy);
913 else if (GET_CODE (loc) == CONCAT)
915 rtx locreal = gen_realpart (GET_MODE (XEXP (loc, 0)), loc);
916 rtx locimag = gen_imagpart (GET_MODE (XEXP (loc, 0)), loc);
917 rtx copyreal = gen_realpart (GET_MODE (locreal), copy);
918 rtx copyimag = gen_imagpart (GET_MODE (locimag), copy);
920 process_reg_param (map, locreal, copyreal);
921 process_reg_param (map, locimag, copyimag);
927 /* Tell copy_rtx_and_substitute to handle constant pool SYMBOL_REFs
928 specially. This function can be called recursively, so we need to
929 save the previous value. */
930 inlining_previous = inlining;
933 /* Now do the parameters that will be placed in memory. */
935 for (formal = DECL_ARGUMENTS (fndecl), i = 0;
936 formal; formal = TREE_CHAIN (formal), i++)
938 loc = RTVEC_ELT (arg_vector, i);
940 if (GET_CODE (loc) == MEM
941 /* Exclude case handled above. */
942 && ! (GET_CODE (XEXP (loc, 0)) == REG
943 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER))
945 rtx note = emit_note (DECL_SOURCE_FILE (formal),
946 DECL_SOURCE_LINE (formal));
948 RTX_INTEGRATED_P (note) = 1;
950 /* Compute the address in the area we reserved and store the
952 temp = copy_rtx_and_substitute (loc, map, 1);
953 subst_constants (&temp, NULL_RTX, map, 1);
954 apply_change_group ();
955 if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0)))
956 temp = change_address (temp, VOIDmode, XEXP (temp, 0));
957 store_expr (arg_trees[i], temp, 0);
961 /* Deal with the places that the function puts its result.
962 We are driven by what is placed into DECL_RESULT.
964 Initially, we assume that we don't have anything special handling for
965 REG_FUNCTION_RETURN_VALUE_P. */
967 map->inline_target = 0;
968 loc = DECL_RTL (DECL_RESULT (fndecl));
970 if (TYPE_MODE (type) == VOIDmode)
971 /* There is no return value to worry about. */
973 else if (GET_CODE (loc) == MEM)
975 if (GET_CODE (XEXP (loc, 0)) == ADDRESSOF)
977 temp = copy_rtx_and_substitute (loc, map, 1);
978 subst_constants (&temp, NULL_RTX, map, 1);
979 apply_change_group ();
984 if (! structure_value_addr
985 || ! aggregate_value_p (DECL_RESULT (fndecl)))
988 /* Pass the function the address in which to return a structure
989 value. Note that a constructor can cause someone to call us
990 with STRUCTURE_VALUE_ADDR, but the initialization takes place
991 via the first parameter, rather than the struct return address.
993 We have two cases: If the address is a simple register
994 indirect, use the mapping mechanism to point that register to
995 our structure return address. Otherwise, store the structure
996 return value into the place that it will be referenced from. */
998 if (GET_CODE (XEXP (loc, 0)) == REG)
1000 temp = force_operand (structure_value_addr, NULL_RTX);
1001 temp = force_reg (Pmode, temp);
1002 map->reg_map[REGNO (XEXP (loc, 0))] = temp;
1004 if (CONSTANT_P (structure_value_addr)
1005 || GET_CODE (structure_value_addr) == ADDRESSOF
1006 || (GET_CODE (structure_value_addr) == PLUS
1007 && (XEXP (structure_value_addr, 0)
1008 == virtual_stack_vars_rtx)
1009 && (GET_CODE (XEXP (structure_value_addr, 1))
1012 SET_CONST_EQUIV_DATA (map, temp, structure_value_addr,
1018 temp = copy_rtx_and_substitute (loc, map, 1);
1019 subst_constants (&temp, NULL_RTX, map, 0);
1020 apply_change_group ();
1021 emit_move_insn (temp, structure_value_addr);
1026 /* We will ignore the result value, so don't look at its structure.
1027 Note that preparations for an aggregate return value
1028 do need to be made (above) even if it will be ignored. */
1030 else if (GET_CODE (loc) == REG)
1032 /* The function returns an object in a register and we use the return
1033 value. Set up our target for remapping. */
1035 /* Machine mode function was declared to return. */
1036 enum machine_mode departing_mode = TYPE_MODE (type);
1037 /* (Possibly wider) machine mode it actually computes
1038 (for the sake of callers that fail to declare it right).
1039 We have to use the mode of the result's RTL, rather than
1040 its type, since expand_function_start may have promoted it. */
1041 enum machine_mode arriving_mode
1042 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl)));
1045 /* Don't use MEMs as direct targets because on some machines
1046 substituting a MEM for a REG makes invalid insns.
1047 Let the combiner substitute the MEM if that is valid. */
1048 if (target == 0 || GET_CODE (target) != REG
1049 || GET_MODE (target) != departing_mode)
1051 /* Don't make BLKmode registers. If this looks like
1052 a BLKmode object being returned in a register, get
1053 the mode from that, otherwise abort. */
1054 if (departing_mode == BLKmode)
1056 if (REG == GET_CODE (DECL_RTL (DECL_RESULT (fndecl))))
1058 departing_mode = GET_MODE (DECL_RTL (DECL_RESULT (fndecl)));
1059 arriving_mode = departing_mode;
1065 target = gen_reg_rtx (departing_mode);
1068 /* If function's value was promoted before return,
1069 avoid machine mode mismatch when we substitute INLINE_TARGET.
1070 But TARGET is what we will return to the caller. */
1071 if (arriving_mode != departing_mode)
1073 /* Avoid creating a paradoxical subreg wider than
1074 BITS_PER_WORD, since that is illegal. */
1075 if (GET_MODE_BITSIZE (arriving_mode) > BITS_PER_WORD)
1077 if (!TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (departing_mode),
1078 GET_MODE_BITSIZE (arriving_mode)))
1079 /* Maybe could be handled by using convert_move () ? */
1081 reg_to_map = gen_reg_rtx (arriving_mode);
1082 target = gen_lowpart (departing_mode, reg_to_map);
1085 reg_to_map = gen_rtx_SUBREG (arriving_mode, target, 0);
1088 reg_to_map = target;
1090 /* Usually, the result value is the machine's return register.
1091 Sometimes it may be a pseudo. Handle both cases. */
1092 if (REG_FUNCTION_VALUE_P (loc))
1093 map->inline_target = reg_to_map;
1095 map->reg_map[REGNO (loc)] = reg_to_map;
1100 /* Initialize label_map. get_label_from_map will actually make
1102 bzero ((char *) &map->label_map[min_labelno],
1103 (max_labelno - min_labelno) * sizeof (rtx));
1105 /* Make copies of the decls of the symbols in the inline function, so that
1106 the copies of the variables get declared in the current function. Set
1107 up things so that lookup_static_chain knows that to interpret registers
1108 in SAVE_EXPRs for TYPE_SIZEs as local. */
1109 inline_function_decl = fndecl;
1110 integrate_parm_decls (DECL_ARGUMENTS (fndecl), map, arg_vector);
1111 block = integrate_decl_tree (inl_f->original_decl_initial, map);
1112 BLOCK_ABSTRACT_ORIGIN (block) = DECL_ORIGIN (fndecl);
1113 inline_function_decl = 0;
1115 /* Make a fresh binding contour that we can easily remove. Do this after
1116 expanding our arguments so cleanups are properly scoped. */
1117 expand_start_bindings_and_block (0, block);
1119 /* Sort the block-map so that it will be easy to find remapped
1121 qsort (&VARRAY_TREE (map->block_map, 0),
1122 map->block_map->elements_used,
1126 /* Perform postincrements before actually calling the function. */
1129 /* Clean up stack so that variables might have smaller offsets. */
1130 do_pending_stack_adjust ();
1132 /* Save a copy of the location of const_equiv_varray for
1133 mark_stores, called via note_stores. */
1134 global_const_equiv_varray = map->const_equiv_varray;
1136 /* If the called function does an alloca, save and restore the
1137 stack pointer around the call. This saves stack space, but
1138 also is required if this inline is being done between two
1140 if (inl_f->calls_alloca)
1141 emit_stack_save (SAVE_BLOCK, &stack_save, NULL_RTX);
1143 /* Now copy the insns one by one. */
1144 copy_insn_list (insns, map, static_chain_value);
1146 /* Restore the stack pointer if we saved it above. */
1147 if (inl_f->calls_alloca)
1148 emit_stack_restore (SAVE_BLOCK, stack_save, NULL_RTX);
1150 if (! cfun->x_whole_function_mode_p)
1151 /* In statement-at-a-time mode, we just tell the front-end to add
1152 this block to the list of blocks at this binding level. We
1153 can't do it the way it's done for function-at-a-time mode the
1154 superblocks have not been created yet. */
1155 insert_block (block);
1159 = BLOCK_CHAIN (DECL_INITIAL (current_function_decl));
1160 BLOCK_CHAIN (DECL_INITIAL (current_function_decl)) = block;
1163 /* End the scope containing the copied formal parameter variables
1164 and copied LABEL_DECLs. We pass NULL_TREE for the variables list
1165 here so that expand_end_bindings will not check for unused
1166 variables. That's already been checked for when the inlined
1167 function was defined. */
1168 expand_end_bindings (NULL_TREE, 1, 1);
1170 /* Must mark the line number note after inlined functions as a repeat, so
1171 that the test coverage code can avoid counting the call twice. This
1172 just tells the code to ignore the immediately following line note, since
1173 there already exists a copy of this note before the expanded inline call.
1174 This line number note is still needed for debugging though, so we can't
1176 if (flag_test_coverage)
1177 emit_note (0, NOTE_INSN_REPEATED_LINE_NUMBER);
1179 emit_line_note (input_filename, lineno);
1181 /* If the function returns a BLKmode object in a register, copy it
1182 out of the temp register into a BLKmode memory object. */
1184 && TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl))) == BLKmode
1185 && ! aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl))))
1186 target = copy_blkmode_from_reg (0, target, TREE_TYPE (TREE_TYPE (fndecl)));
1188 if (structure_value_addr)
1190 target = gen_rtx_MEM (TYPE_MODE (type),
1191 memory_address (TYPE_MODE (type),
1192 structure_value_addr));
1193 set_mem_attributes (target, type, 1);
1196 /* Make sure we free the things we explicitly allocated with xmalloc. */
1198 free (real_label_map);
1199 VARRAY_FREE (map->const_equiv_varray);
1200 free (map->reg_map);
1201 VARRAY_FREE (map->block_map);
1202 free (map->insn_map);
1207 inlining = inlining_previous;
1212 /* Make copies of each insn in the given list using the mapping
1213 computed in expand_inline_function. This function may call itself for
1214 insns containing sequences.
1216 Copying is done in two passes, first the insns and then their REG_NOTES,
1217 just like save_for_inline.
1219 If static_chain_value is non-zero, it represents the context-pointer
1220 register for the function. */
1223 copy_insn_list (insns, map, static_chain_value)
1225 struct inline_remap *map;
1226 rtx static_chain_value;
1231 rtx local_return_label = NULL_RTX;
1236 /* Copy the insns one by one. Do this in two passes, first the insns and
1237 then their REG_NOTES, just like save_for_inline. */
1239 /* This loop is very similar to the loop in copy_loop_body in unroll.c. */
1241 for (insn = insns; insn; insn = NEXT_INSN (insn))
1243 rtx copy, pattern, set;
1245 map->orig_asm_operands_vector = 0;
1247 switch (GET_CODE (insn))
1250 pattern = PATTERN (insn);
1251 set = single_set (insn);
1253 if (GET_CODE (pattern) == USE
1254 && GET_CODE (XEXP (pattern, 0)) == REG
1255 && REG_FUNCTION_VALUE_P (XEXP (pattern, 0)))
1256 /* The (USE (REG n)) at return from the function should
1257 be ignored since we are changing (REG n) into
1261 /* If the inline fn needs eh context, make sure that
1262 the current fn has one. */
1263 if (GET_CODE (pattern) == USE
1264 && find_reg_note (insn, REG_EH_CONTEXT, 0) != 0)
1267 /* Ignore setting a function value that we don't want to use. */
1268 if (map->inline_target == 0
1270 && GET_CODE (SET_DEST (set)) == REG
1271 && REG_FUNCTION_VALUE_P (SET_DEST (set)))
1273 if (volatile_refs_p (SET_SRC (set)))
1277 /* If we must not delete the source,
1278 load it into a new temporary. */
1279 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1281 new_set = single_set (copy);
1286 = gen_reg_rtx (GET_MODE (SET_DEST (new_set)));
1288 /* If the source and destination are the same and it
1289 has a note on it, keep the insn. */
1290 else if (rtx_equal_p (SET_DEST (set), SET_SRC (set))
1291 && REG_NOTES (insn) != 0)
1292 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1297 /* If this is setting the static chain rtx, omit it. */
1298 else if (static_chain_value != 0
1300 && GET_CODE (SET_DEST (set)) == REG
1301 && rtx_equal_p (SET_DEST (set),
1302 static_chain_incoming_rtx))
1305 /* If this is setting the static chain pseudo, set it from
1306 the value we want to give it instead. */
1307 else if (static_chain_value != 0
1309 && rtx_equal_p (SET_SRC (set),
1310 static_chain_incoming_rtx))
1312 rtx newdest = copy_rtx_and_substitute (SET_DEST (set), map, 1);
1314 copy = emit_move_insn (newdest, static_chain_value);
1315 static_chain_value = 0;
1318 /* If this is setting the virtual stack vars register, this must
1319 be the code at the handler for a builtin longjmp. The value
1320 saved in the setjmp buffer will be the address of the frame
1321 we've made for this inlined instance within our frame. But we
1322 know the offset of that value so we can use it to reconstruct
1323 our virtual stack vars register from that value. If we are
1324 copying it from the stack pointer, leave it unchanged. */
1326 && rtx_equal_p (SET_DEST (set), virtual_stack_vars_rtx))
1328 HOST_WIDE_INT offset;
1329 temp = map->reg_map[REGNO (SET_DEST (set))];
1330 temp = VARRAY_CONST_EQUIV (map->const_equiv_varray,
1333 if (rtx_equal_p (temp, virtual_stack_vars_rtx))
1335 else if (GET_CODE (temp) == PLUS
1336 && rtx_equal_p (XEXP (temp, 0), virtual_stack_vars_rtx)
1337 && GET_CODE (XEXP (temp, 1)) == CONST_INT)
1338 offset = INTVAL (XEXP (temp, 1));
1342 if (rtx_equal_p (SET_SRC (set), stack_pointer_rtx))
1343 temp = SET_SRC (set);
1345 temp = force_operand (plus_constant (SET_SRC (set),
1349 copy = emit_move_insn (virtual_stack_vars_rtx, temp);
1353 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1354 /* REG_NOTES will be copied later. */
1357 /* If this insn is setting CC0, it may need to look at
1358 the insn that uses CC0 to see what type of insn it is.
1359 In that case, the call to recog via validate_change will
1360 fail. So don't substitute constants here. Instead,
1361 do it when we emit the following insn.
1363 For example, see the pyr.md file. That machine has signed and
1364 unsigned compares. The compare patterns must check the
1365 following branch insn to see which what kind of compare to
1368 If the previous insn set CC0, substitute constants on it as
1370 if (sets_cc0_p (PATTERN (copy)) != 0)
1375 try_constants (cc0_insn, map);
1377 try_constants (copy, map);
1380 try_constants (copy, map);
1385 if (GET_CODE (PATTERN (insn)) == RETURN
1386 || (GET_CODE (PATTERN (insn)) == PARALLEL
1387 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == RETURN))
1389 if (local_return_label == 0)
1390 local_return_label = gen_label_rtx ();
1391 pattern = gen_jump (local_return_label);
1394 pattern = copy_rtx_and_substitute (PATTERN (insn), map, 0);
1396 copy = emit_jump_insn (pattern);
1400 try_constants (cc0_insn, map);
1403 try_constants (copy, map);
1405 /* If this used to be a conditional jump insn but whose branch
1406 direction is now know, we must do something special. */
1407 if (any_condjump_p (insn) && onlyjump_p (insn) && map->last_pc_value)
1410 /* If the previous insn set cc0 for us, delete it. */
1411 if (sets_cc0_p (PREV_INSN (copy)))
1412 delete_insn (PREV_INSN (copy));
1415 /* If this is now a no-op, delete it. */
1416 if (map->last_pc_value == pc_rtx)
1422 /* Otherwise, this is unconditional jump so we must put a
1423 BARRIER after it. We could do some dead code elimination
1424 here, but jump.c will do it just as well. */
1430 /* If this is a CALL_PLACEHOLDER insn then we need to copy the
1431 three attached sequences: normal call, sibling call and tail
1433 if (GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
1438 for (i = 0; i < 3; i++)
1442 sequence[i] = NULL_RTX;
1443 seq = XEXP (PATTERN (insn), i);
1447 copy_insn_list (seq, map, static_chain_value);
1448 sequence[i] = get_insns ();
1453 /* Find the new tail recursion label.
1454 It will already be substituted into sequence[2]. */
1455 tail_label = copy_rtx_and_substitute (XEXP (PATTERN (insn), 3),
1458 copy = emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode,
1466 pattern = copy_rtx_and_substitute (PATTERN (insn), map, 0);
1467 copy = emit_call_insn (pattern);
1469 SIBLING_CALL_P (copy) = SIBLING_CALL_P (insn);
1471 /* Because the USAGE information potentially contains objects other
1472 than hard registers, we need to copy it. */
1474 CALL_INSN_FUNCTION_USAGE (copy)
1475 = copy_rtx_and_substitute (CALL_INSN_FUNCTION_USAGE (insn),
1480 try_constants (cc0_insn, map);
1483 try_constants (copy, map);
1485 /* Be lazy and assume CALL_INSNs clobber all hard registers. */
1486 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1487 VARRAY_CONST_EQUIV (map->const_equiv_varray, i).rtx = 0;
1491 copy = emit_label (get_label_from_map (map,
1492 CODE_LABEL_NUMBER (insn)));
1493 LABEL_NAME (copy) = LABEL_NAME (insn);
1498 copy = emit_barrier ();
1502 /* NOTE_INSN_FUNCTION_END and NOTE_INSN_FUNCTION_BEG are
1503 discarded because it is important to have only one of
1504 each in the current function.
1506 NOTE_INSN_DELETED notes aren't useful (save_for_inline
1507 deleted these in the copy used for continuing compilation,
1508 not the copy used for inlining).
1510 NOTE_INSN_BASIC_BLOCK is discarded because the saved bb
1511 pointer (which will soon be dangling) confuses flow's
1512 attempts to preserve bb structures during the compilation
1515 if (NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_END
1516 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_BEG
1517 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_DELETED
1518 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_BASIC_BLOCK)
1520 copy = emit_note (NOTE_SOURCE_FILE (insn),
1521 NOTE_LINE_NUMBER (insn));
1523 && (NOTE_LINE_NUMBER (copy) == NOTE_INSN_EH_REGION_BEG
1524 || NOTE_LINE_NUMBER (copy) == NOTE_INSN_EH_REGION_END))
1527 = get_label_from_map (map, NOTE_EH_HANDLER (copy));
1529 /* We have to duplicate the handlers for the original. */
1530 if (NOTE_LINE_NUMBER (copy) == NOTE_INSN_EH_REGION_BEG)
1532 /* We need to duplicate the handlers for the EH region
1533 and we need to indicate where the label map is */
1535 duplicate_eh_handlers (NOTE_EH_HANDLER (copy),
1536 CODE_LABEL_NUMBER (label),
1537 expand_inline_function_eh_labelmap);
1540 /* We have to forward these both to match the new exception
1542 NOTE_EH_HANDLER (copy) = CODE_LABEL_NUMBER (label);
1545 && (NOTE_LINE_NUMBER (copy) == NOTE_INSN_BLOCK_BEG
1546 || NOTE_LINE_NUMBER (copy) == NOTE_INSN_BLOCK_END)
1547 && NOTE_BLOCK (insn))
1549 tree *mapped_block_p;
1552 = (tree *) bsearch (NOTE_BLOCK (insn),
1553 &VARRAY_TREE (map->block_map, 0),
1554 map->block_map->elements_used,
1558 if (!mapped_block_p)
1561 NOTE_BLOCK (copy) = *mapped_block_p;
1573 RTX_INTEGRATED_P (copy) = 1;
1575 map->insn_map[INSN_UID (insn)] = copy;
1578 /* Now copy the REG_NOTES. Increment const_age, so that only constants
1579 from parameters can be substituted in. These are the only ones that
1580 are valid across the entire function. */
1582 for (insn = insns; insn; insn = NEXT_INSN (insn))
1584 && map->insn_map[INSN_UID (insn)]
1585 && REG_NOTES (insn))
1587 rtx next, note = copy_rtx_and_substitute (REG_NOTES (insn), map, 0);
1589 /* We must also do subst_constants, in case one of our parameters
1590 has const type and constant value. */
1591 subst_constants (¬e, NULL_RTX, map, 0);
1592 apply_change_group ();
1593 REG_NOTES (map->insn_map[INSN_UID (insn)]) = note;
1595 /* Finally, delete any REG_LABEL notes from the chain. */
1596 for (; note; note = next)
1598 next = XEXP (note, 1);
1599 if (REG_NOTE_KIND (note) == REG_LABEL)
1600 remove_note (map->insn_map[INSN_UID (insn)], note);
1604 if (local_return_label)
1605 emit_label (local_return_label);
1608 /* Given a chain of PARM_DECLs, ARGS, copy each decl into a VAR_DECL,
1609 push all of those decls and give each one the corresponding home. */
1612 integrate_parm_decls (args, map, arg_vector)
1614 struct inline_remap *map;
1620 for (tail = args, i = 0; tail; tail = TREE_CHAIN (tail), i++)
1622 tree decl = copy_decl_for_inlining (tail, map->fndecl,
1623 current_function_decl);
1625 = copy_rtx_and_substitute (RTVEC_ELT (arg_vector, i), map, 1);
1627 /* We really should be setting DECL_INCOMING_RTL to something reasonable
1628 here, but that's going to require some more work. */
1629 /* DECL_INCOMING_RTL (decl) = ?; */
1630 /* Fully instantiate the address with the equivalent form so that the
1631 debugging information contains the actual register, instead of the
1632 virtual register. Do this by not passing an insn to
1634 subst_constants (&new_decl_rtl, NULL_RTX, map, 1);
1635 apply_change_group ();
1636 DECL_RTL (decl) = new_decl_rtl;
1640 /* Given a BLOCK node LET, push decls and levels so as to construct in the
1641 current function a tree of contexts isomorphic to the one that is given.
1643 MAP, if nonzero, is a pointer to an inline_remap map which indicates how
1644 registers used in the DECL_RTL field should be remapped. If it is zero,
1645 no mapping is necessary. */
1648 integrate_decl_tree (let, map)
1650 struct inline_remap *map;
1656 new_block = make_node (BLOCK);
1657 VARRAY_PUSH_TREE (map->block_map, new_block);
1658 next = &BLOCK_VARS (new_block);
1660 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
1664 push_obstacks_nochange ();
1665 saveable_allocation ();
1666 d = copy_decl_for_inlining (t, map->fndecl, current_function_decl);
1669 if (DECL_RTL (t) != 0)
1671 DECL_RTL (d) = copy_rtx_and_substitute (DECL_RTL (t), map, 1);
1673 /* Fully instantiate the address with the equivalent form so that the
1674 debugging information contains the actual register, instead of the
1675 virtual register. Do this by not passing an insn to
1677 subst_constants (&DECL_RTL (d), NULL_RTX, map, 1);
1678 apply_change_group ();
1681 /* Add this declaration to the list of variables in the new
1684 next = &TREE_CHAIN (d);
1687 next = &BLOCK_SUBBLOCKS (new_block);
1688 for (t = BLOCK_SUBBLOCKS (let); t; t = BLOCK_CHAIN (t))
1690 *next = integrate_decl_tree (t, map);
1691 BLOCK_SUPERCONTEXT (*next) = new_block;
1692 next = &BLOCK_CHAIN (*next);
1695 TREE_USED (new_block) = TREE_USED (let);
1696 BLOCK_ABSTRACT_ORIGIN (new_block) = let;
1701 /* Create a new copy of an rtx. Recursively copies the operands of the rtx,
1702 except for those few rtx codes that are sharable.
1704 We always return an rtx that is similar to that incoming rtx, with the
1705 exception of possibly changing a REG to a SUBREG or vice versa. No
1706 rtl is ever emitted.
1708 If FOR_LHS is nonzero, if means we are processing something that will
1709 be the LHS of a SET. In that case, we copy RTX_UNCHANGING_P even if
1710 inlining since we need to be conservative in how it is set for
1713 Handle constants that need to be placed in the constant pool by
1714 calling `force_const_mem'. */
1717 copy_rtx_and_substitute (orig, map, for_lhs)
1719 struct inline_remap *map;
1722 register rtx copy, temp;
1724 register RTX_CODE code;
1725 register enum machine_mode mode;
1726 register const char *format_ptr;
1732 code = GET_CODE (orig);
1733 mode = GET_MODE (orig);
1738 /* If the stack pointer register shows up, it must be part of
1739 stack-adjustments (*not* because we eliminated the frame pointer!).
1740 Small hard registers are returned as-is. Pseudo-registers
1741 go through their `reg_map'. */
1742 regno = REGNO (orig);
1743 if (regno <= LAST_VIRTUAL_REGISTER
1744 || (map->integrating
1745 && DECL_SAVED_INSNS (map->fndecl)->internal_arg_pointer == orig))
1747 /* Some hard registers are also mapped,
1748 but others are not translated. */
1749 if (map->reg_map[regno] != 0
1750 /* We shouldn't usually have reg_map set for return
1751 register, but it may happen if we have leaf-register
1752 remapping and the return register is used in one of
1753 the calling sequences of a call_placeholer. In this
1754 case, we'll end up with a reg_map set for this
1755 register, but we don't want to use for registers
1756 marked as return values. */
1757 && ! REG_FUNCTION_VALUE_P (orig))
1758 return map->reg_map[regno];
1760 /* If this is the virtual frame pointer, make space in current
1761 function's stack frame for the stack frame of the inline function.
1763 Copy the address of this area into a pseudo. Map
1764 virtual_stack_vars_rtx to this pseudo and set up a constant
1765 equivalence for it to be the address. This will substitute the
1766 address into insns where it can be substituted and use the new
1767 pseudo where it can't. */
1768 else if (regno == VIRTUAL_STACK_VARS_REGNUM)
1771 int size = get_func_frame_size (DECL_SAVED_INSNS (map->fndecl));
1772 #ifdef FRAME_GROWS_DOWNWARD
1774 = (DECL_SAVED_INSNS (map->fndecl)->stack_alignment_needed
1777 /* In this case, virtual_stack_vars_rtx points to one byte
1778 higher than the top of the frame area. So make sure we
1779 allocate a big enough chunk to keep the frame pointer
1780 aligned like a real one. */
1782 size = CEIL_ROUND (size, alignment);
1785 loc = assign_stack_temp (BLKmode, size, 1);
1786 loc = XEXP (loc, 0);
1787 #ifdef FRAME_GROWS_DOWNWARD
1788 /* In this case, virtual_stack_vars_rtx points to one byte
1789 higher than the top of the frame area. So compute the offset
1790 to one byte higher than our substitute frame. */
1791 loc = plus_constant (loc, size);
1793 map->reg_map[regno] = temp
1794 = force_reg (Pmode, force_operand (loc, NULL_RTX));
1796 #ifdef STACK_BOUNDARY
1797 mark_reg_pointer (map->reg_map[regno], STACK_BOUNDARY);
1800 SET_CONST_EQUIV_DATA (map, temp, loc, CONST_AGE_PARM);
1802 seq = gen_sequence ();
1804 emit_insn_after (seq, map->insns_at_start);
1807 else if (regno == VIRTUAL_INCOMING_ARGS_REGNUM
1808 || (map->integrating
1809 && (DECL_SAVED_INSNS (map->fndecl)->internal_arg_pointer
1812 /* Do the same for a block to contain any arguments referenced
1815 int size = DECL_SAVED_INSNS (map->fndecl)->args_size;
1818 loc = assign_stack_temp (BLKmode, size, 1);
1819 loc = XEXP (loc, 0);
1820 /* When arguments grow downward, the virtual incoming
1821 args pointer points to the top of the argument block,
1822 so the remapped location better do the same. */
1823 #ifdef ARGS_GROW_DOWNWARD
1824 loc = plus_constant (loc, size);
1826 map->reg_map[regno] = temp
1827 = force_reg (Pmode, force_operand (loc, NULL_RTX));
1829 #ifdef STACK_BOUNDARY
1830 mark_reg_pointer (map->reg_map[regno], STACK_BOUNDARY);
1833 SET_CONST_EQUIV_DATA (map, temp, loc, CONST_AGE_PARM);
1835 seq = gen_sequence ();
1837 emit_insn_after (seq, map->insns_at_start);
1840 else if (REG_FUNCTION_VALUE_P (orig))
1842 /* This is a reference to the function return value. If
1843 the function doesn't have a return value, error. If the
1844 mode doesn't agree, and it ain't BLKmode, make a SUBREG. */
1845 if (map->inline_target == 0)
1846 /* Must be unrolling loops or replicating code if we
1847 reach here, so return the register unchanged. */
1849 else if (GET_MODE (map->inline_target) != BLKmode
1850 && mode != GET_MODE (map->inline_target))
1851 return gen_lowpart (mode, map->inline_target);
1853 return map->inline_target;
1855 #if defined (LEAF_REGISTERS) && defined (LEAF_REG_REMAP)
1856 /* If leaf_renumber_regs_insn() might remap this register to
1857 some other number, make sure we don't share it with the
1858 inlined function, otherwise delayed optimization of the
1859 inlined function may change it in place, breaking our
1860 reference to it. We may still shared it within the
1861 function, so create an entry for this register in the
1863 if (map->integrating && regno < FIRST_PSEUDO_REGISTER
1864 && LEAF_REGISTERS[regno] && LEAF_REG_REMAP (regno) != regno)
1866 temp = gen_rtx_REG (mode, regno);
1867 map->reg_map[regno] = temp;
1876 if (map->reg_map[regno] == NULL)
1878 map->reg_map[regno] = gen_reg_rtx (mode);
1879 REG_USERVAR_P (map->reg_map[regno]) = REG_USERVAR_P (orig);
1880 REG_LOOP_TEST_P (map->reg_map[regno]) = REG_LOOP_TEST_P (orig);
1881 RTX_UNCHANGING_P (map->reg_map[regno]) = RTX_UNCHANGING_P (orig);
1882 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
1884 if (map->regno_pointer_flag[regno])
1885 mark_reg_pointer (map->reg_map[regno],
1886 map->regno_pointer_align[regno]);
1888 return map->reg_map[regno];
1891 copy = copy_rtx_and_substitute (SUBREG_REG (orig), map, for_lhs);
1892 /* SUBREG is ordinary, but don't make nested SUBREGs. */
1893 if (GET_CODE (copy) == SUBREG)
1894 return gen_rtx_SUBREG (GET_MODE (orig), SUBREG_REG (copy),
1895 SUBREG_WORD (orig) + SUBREG_WORD (copy));
1896 else if (GET_CODE (copy) == CONCAT)
1898 rtx retval = subreg_realpart_p (orig) ? XEXP (copy, 0) : XEXP (copy, 1);
1900 if (GET_MODE (retval) == GET_MODE (orig))
1903 return gen_rtx_SUBREG (GET_MODE (orig), retval,
1904 (SUBREG_WORD (orig) %
1905 (GET_MODE_UNIT_SIZE (GET_MODE (SUBREG_REG (orig)))
1906 / (unsigned) UNITS_PER_WORD)));
1909 return gen_rtx_SUBREG (GET_MODE (orig), copy,
1910 SUBREG_WORD (orig));
1913 copy = gen_rtx_ADDRESSOF (mode,
1914 copy_rtx_and_substitute (XEXP (orig, 0),
1916 0, ADDRESSOF_DECL (orig));
1917 regno = ADDRESSOF_REGNO (orig);
1918 if (map->reg_map[regno])
1919 regno = REGNO (map->reg_map[regno]);
1920 else if (regno > LAST_VIRTUAL_REGISTER)
1922 temp = XEXP (orig, 0);
1923 map->reg_map[regno] = gen_reg_rtx (GET_MODE (temp));
1924 REG_USERVAR_P (map->reg_map[regno]) = REG_USERVAR_P (temp);
1925 REG_LOOP_TEST_P (map->reg_map[regno]) = REG_LOOP_TEST_P (temp);
1926 RTX_UNCHANGING_P (map->reg_map[regno]) = RTX_UNCHANGING_P (temp);
1927 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
1929 if (map->regno_pointer_flag[regno])
1930 mark_reg_pointer (map->reg_map[regno],
1931 map->regno_pointer_align[regno]);
1932 regno = REGNO (map->reg_map[regno]);
1934 ADDRESSOF_REGNO (copy) = regno;
1939 /* USE and CLOBBER are ordinary, but we convert (use (subreg foo))
1940 to (use foo) if the original insn didn't have a subreg.
1941 Removing the subreg distorts the VAX movstrhi pattern
1942 by changing the mode of an operand. */
1943 copy = copy_rtx_and_substitute (XEXP (orig, 0), map, code == CLOBBER);
1944 if (GET_CODE (copy) == SUBREG && GET_CODE (XEXP (orig, 0)) != SUBREG)
1945 copy = SUBREG_REG (copy);
1946 return gen_rtx_fmt_e (code, VOIDmode, copy);
1949 LABEL_PRESERVE_P (get_label_from_map (map, CODE_LABEL_NUMBER (orig)))
1950 = LABEL_PRESERVE_P (orig);
1951 return get_label_from_map (map, CODE_LABEL_NUMBER (orig));
1953 /* We need to handle "deleted" labels that appear in the DECL_RTL
1956 if (NOTE_LINE_NUMBER (orig) == NOTE_INSN_DELETED_LABEL)
1957 return map->insn_map[INSN_UID (orig)];
1964 LABEL_REF_NONLOCAL_P (orig) ? XEXP (orig, 0)
1965 : get_label_from_map (map, CODE_LABEL_NUMBER (XEXP (orig, 0))));
1967 LABEL_OUTSIDE_LOOP_P (copy) = LABEL_OUTSIDE_LOOP_P (orig);
1969 /* The fact that this label was previously nonlocal does not mean
1970 it still is, so we must check if it is within the range of
1971 this function's labels. */
1972 LABEL_REF_NONLOCAL_P (copy)
1973 = (LABEL_REF_NONLOCAL_P (orig)
1974 && ! (CODE_LABEL_NUMBER (XEXP (copy, 0)) >= get_first_label_num ()
1975 && CODE_LABEL_NUMBER (XEXP (copy, 0)) < max_label_num ()));
1977 /* If we have made a nonlocal label local, it means that this
1978 inlined call will be referring to our nonlocal goto handler.
1979 So make sure we create one for this block; we normally would
1980 not since this is not otherwise considered a "call". */
1981 if (LABEL_REF_NONLOCAL_P (orig) && ! LABEL_REF_NONLOCAL_P (copy))
1982 function_call_count++;
1992 /* Symbols which represent the address of a label stored in the constant
1993 pool must be modified to point to a constant pool entry for the
1994 remapped label. Otherwise, symbols are returned unchanged. */
1995 if (CONSTANT_POOL_ADDRESS_P (orig))
1997 struct function *f = inlining ? inlining : cfun;
1998 rtx constant = get_pool_constant_for_function (f, orig);
1999 enum machine_mode const_mode = get_pool_mode_for_function (f, orig);
2002 rtx temp = force_const_mem (const_mode,
2003 copy_rtx_and_substitute (constant,
2007 /* Legitimizing the address here is incorrect.
2009 Since we had a SYMBOL_REF before, we can assume it is valid
2010 to have one in this position in the insn.
2012 Also, change_address may create new registers. These
2013 registers will not have valid reg_map entries. This can
2014 cause try_constants() to fail because assumes that all
2015 registers in the rtx have valid reg_map entries, and it may
2016 end up replacing one of these new registers with junk. */
2018 if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0)))
2019 temp = change_address (temp, GET_MODE (temp), XEXP (temp, 0));
2022 temp = XEXP (temp, 0);
2024 #ifdef POINTERS_EXTEND_UNSIGNED
2025 if (GET_MODE (temp) != GET_MODE (orig))
2026 temp = convert_memory_address (GET_MODE (orig), temp);
2030 else if (GET_CODE (constant) == LABEL_REF)
2031 return XEXP (force_const_mem
2033 copy_rtx_and_substitute (constant, map, for_lhs)),
2036 else if (SYMBOL_REF_NEED_ADJUST (orig))
2039 return rethrow_symbol_map (orig,
2040 expand_inline_function_eh_labelmap);
2046 /* We have to make a new copy of this CONST_DOUBLE because don't want
2047 to use the old value of CONST_DOUBLE_MEM. Also, this may be a
2048 duplicate of a CONST_DOUBLE we have already seen. */
2049 if (GET_MODE_CLASS (GET_MODE (orig)) == MODE_FLOAT)
2053 REAL_VALUE_FROM_CONST_DOUBLE (d, orig);
2054 return CONST_DOUBLE_FROM_REAL_VALUE (d, GET_MODE (orig));
2057 return immed_double_const (CONST_DOUBLE_LOW (orig),
2058 CONST_DOUBLE_HIGH (orig), VOIDmode);
2061 /* Make new constant pool entry for a constant
2062 that was in the pool of the inline function. */
2063 if (RTX_INTEGRATED_P (orig))
2068 /* If a single asm insn contains multiple output operands then
2069 it contains multiple ASM_OPERANDS rtx's that share the input
2070 and constraint vecs. We must make sure that the copied insn
2071 continues to share it. */
2072 if (map->orig_asm_operands_vector == ASM_OPERANDS_INPUT_VEC (orig))
2074 copy = rtx_alloc (ASM_OPERANDS);
2075 copy->volatil = orig->volatil;
2076 ASM_OPERANDS_TEMPLATE (copy) = ASM_OPERANDS_TEMPLATE (orig);
2077 ASM_OPERANDS_OUTPUT_CONSTRAINT (copy)
2078 = ASM_OPERANDS_OUTPUT_CONSTRAINT (orig);
2079 ASM_OPERANDS_OUTPUT_IDX (copy) = ASM_OPERANDS_OUTPUT_IDX (orig);
2080 ASM_OPERANDS_INPUT_VEC (copy) = map->copy_asm_operands_vector;
2081 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy)
2082 = map->copy_asm_constraints_vector;
2083 ASM_OPERANDS_SOURCE_FILE (copy) = ASM_OPERANDS_SOURCE_FILE (orig);
2084 ASM_OPERANDS_SOURCE_LINE (copy) = ASM_OPERANDS_SOURCE_LINE (orig);
2090 /* This is given special treatment because the first
2091 operand of a CALL is a (MEM ...) which may get
2092 forced into a register for cse. This is undesirable
2093 if function-address cse isn't wanted or if we won't do cse. */
2094 #ifndef NO_FUNCTION_CSE
2095 if (! (optimize && ! flag_no_function_cse))
2100 gen_rtx_MEM (GET_MODE (XEXP (orig, 0)),
2101 copy_rtx_and_substitute (XEXP (XEXP (orig, 0), 0),
2103 copy_rtx_and_substitute (XEXP (orig, 1), map, 0));
2107 /* Must be ifdefed out for loop unrolling to work. */
2113 /* If this is setting fp or ap, it means that we have a nonlocal goto.
2114 Adjust the setting by the offset of the area we made.
2115 If the nonlocal goto is into the current function,
2116 this will result in unnecessarily bad code, but should work. */
2117 if (SET_DEST (orig) == virtual_stack_vars_rtx
2118 || SET_DEST (orig) == virtual_incoming_args_rtx)
2120 /* In case a translation hasn't occurred already, make one now. */
2123 HOST_WIDE_INT loc_offset;
2125 copy_rtx_and_substitute (SET_DEST (orig), map, for_lhs);
2126 equiv_reg = map->reg_map[REGNO (SET_DEST (orig))];
2127 equiv_loc = VARRAY_CONST_EQUIV (map->const_equiv_varray,
2128 REGNO (equiv_reg)).rtx;
2130 = GET_CODE (equiv_loc) == REG ? 0 : INTVAL (XEXP (equiv_loc, 1));
2132 return gen_rtx_SET (VOIDmode, SET_DEST (orig),
2135 (copy_rtx_and_substitute (SET_SRC (orig),
2141 return gen_rtx_SET (VOIDmode,
2142 copy_rtx_and_substitute (SET_DEST (orig), map, 1),
2143 copy_rtx_and_substitute (SET_SRC (orig), map, 0));
2148 && GET_CODE (XEXP (orig, 0)) == SYMBOL_REF
2149 && CONSTANT_POOL_ADDRESS_P (XEXP (orig, 0)))
2151 enum machine_mode const_mode
2152 = get_pool_mode_for_function (inlining, XEXP (orig, 0));
2154 = get_pool_constant_for_function (inlining, XEXP (orig, 0));
2156 constant = copy_rtx_and_substitute (constant, map, 0);
2158 /* If this was an address of a constant pool entry that itself
2159 had to be placed in the constant pool, it might not be a
2160 valid address. So the recursive call might have turned it
2161 into a register. In that case, it isn't a constant any
2162 more, so return it. This has the potential of changing a
2163 MEM into a REG, but we'll assume that it safe. */
2164 if (! CONSTANT_P (constant))
2167 return validize_mem (force_const_mem (const_mode, constant));
2170 copy = rtx_alloc (MEM);
2171 PUT_MODE (copy, mode);
2172 XEXP (copy, 0) = copy_rtx_and_substitute (XEXP (orig, 0), map, 0);
2173 MEM_COPY_ATTRIBUTES (copy, orig);
2180 copy = rtx_alloc (code);
2181 PUT_MODE (copy, mode);
2182 copy->in_struct = orig->in_struct;
2183 copy->volatil = orig->volatil;
2184 copy->unchanging = orig->unchanging;
2186 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
2188 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
2190 switch (*format_ptr++)
2193 /* Copy this through the wide int field; that's safest. */
2194 X0WINT (copy, i) = X0WINT (orig, i);
2199 = copy_rtx_and_substitute (XEXP (orig, i), map, for_lhs);
2203 /* Change any references to old-insns to point to the
2204 corresponding copied insns. */
2205 XEXP (copy, i) = map->insn_map[INSN_UID (XEXP (orig, i))];
2209 XVEC (copy, i) = XVEC (orig, i);
2210 if (XVEC (orig, i) != NULL && XVECLEN (orig, i) != 0)
2212 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
2213 for (j = 0; j < XVECLEN (copy, i); j++)
2214 XVECEXP (copy, i, j)
2215 = copy_rtx_and_substitute (XVECEXP (orig, i, j),
2221 XWINT (copy, i) = XWINT (orig, i);
2225 XINT (copy, i) = XINT (orig, i);
2229 XSTR (copy, i) = XSTR (orig, i);
2233 XTREE (copy, i) = XTREE (orig, i);
2241 if (code == ASM_OPERANDS && map->orig_asm_operands_vector == 0)
2243 map->orig_asm_operands_vector = ASM_OPERANDS_INPUT_VEC (orig);
2244 map->copy_asm_operands_vector = ASM_OPERANDS_INPUT_VEC (copy);
2245 map->copy_asm_constraints_vector
2246 = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy);
2252 /* Substitute known constant values into INSN, if that is valid. */
2255 try_constants (insn, map)
2257 struct inline_remap *map;
2263 /* First try just updating addresses, then other things. This is
2264 important when we have something like the store of a constant
2265 into memory and we can update the memory address but the machine
2266 does not support a constant source. */
2267 subst_constants (&PATTERN (insn), insn, map, 1);
2268 apply_change_group ();
2269 subst_constants (&PATTERN (insn), insn, map, 0);
2270 apply_change_group ();
2272 /* Show we don't know the value of anything stored or clobbered. */
2273 note_stores (PATTERN (insn), mark_stores, NULL);
2274 map->last_pc_value = 0;
2276 map->last_cc0_value = 0;
2279 /* Set up any constant equivalences made in this insn. */
2280 for (i = 0; i < map->num_sets; i++)
2282 if (GET_CODE (map->equiv_sets[i].dest) == REG)
2284 int regno = REGNO (map->equiv_sets[i].dest);
2286 MAYBE_EXTEND_CONST_EQUIV_VARRAY (map, regno);
2287 if (VARRAY_CONST_EQUIV (map->const_equiv_varray, regno).rtx == 0
2288 /* Following clause is a hack to make case work where GNU C++
2289 reassigns a variable to make cse work right. */
2290 || ! rtx_equal_p (VARRAY_CONST_EQUIV (map->const_equiv_varray,
2292 map->equiv_sets[i].equiv))
2293 SET_CONST_EQUIV_DATA (map, map->equiv_sets[i].dest,
2294 map->equiv_sets[i].equiv, map->const_age);
2296 else if (map->equiv_sets[i].dest == pc_rtx)
2297 map->last_pc_value = map->equiv_sets[i].equiv;
2299 else if (map->equiv_sets[i].dest == cc0_rtx)
2300 map->last_cc0_value = map->equiv_sets[i].equiv;
2305 /* Substitute known constants for pseudo regs in the contents of LOC,
2306 which are part of INSN.
2307 If INSN is zero, the substitution should always be done (this is used to
2309 These changes are taken out by try_constants if the result is not valid.
2311 Note that we are more concerned with determining when the result of a SET
2312 is a constant, for further propagation, than actually inserting constants
2313 into insns; cse will do the latter task better.
2315 This function is also used to adjust address of items previously addressed
2316 via the virtual stack variable or virtual incoming arguments registers.
2318 If MEMONLY is nonzero, only make changes inside a MEM. */
2321 subst_constants (loc, insn, map, memonly)
2324 struct inline_remap *map;
2329 register enum rtx_code code;
2330 register const char *format_ptr;
2331 int num_changes = num_validated_changes ();
2333 enum machine_mode op0_mode = MAX_MACHINE_MODE;
2335 code = GET_CODE (x);
2351 validate_change (insn, loc, map->last_cc0_value, 1);
2357 /* The only thing we can do with a USE or CLOBBER is possibly do
2358 some substitutions in a MEM within it. */
2359 if (GET_CODE (XEXP (x, 0)) == MEM)
2360 subst_constants (&XEXP (XEXP (x, 0), 0), insn, map, 0);
2364 /* Substitute for parms and known constants. Don't replace
2365 hard regs used as user variables with constants. */
2368 int regno = REGNO (x);
2369 struct const_equiv_data *p;
2371 if (! (regno < FIRST_PSEUDO_REGISTER && REG_USERVAR_P (x))
2372 && (size_t) regno < VARRAY_SIZE (map->const_equiv_varray)
2373 && (p = &VARRAY_CONST_EQUIV (map->const_equiv_varray, regno),
2375 && p->age >= map->const_age)
2376 validate_change (insn, loc, p->rtx, 1);
2381 /* SUBREG applied to something other than a reg
2382 should be treated as ordinary, since that must
2383 be a special hack and we don't know how to treat it specially.
2384 Consider for example mulsidi3 in m68k.md.
2385 Ordinary SUBREG of a REG needs this special treatment. */
2386 if (! memonly && GET_CODE (SUBREG_REG (x)) == REG)
2388 rtx inner = SUBREG_REG (x);
2391 /* We can't call subst_constants on &SUBREG_REG (x) because any
2392 constant or SUBREG wouldn't be valid inside our SUBEG. Instead,
2393 see what is inside, try to form the new SUBREG and see if that is
2394 valid. We handle two cases: extracting a full word in an
2395 integral mode and extracting the low part. */
2396 subst_constants (&inner, NULL_RTX, map, 0);
2398 if (GET_MODE_CLASS (GET_MODE (x)) == MODE_INT
2399 && GET_MODE_SIZE (GET_MODE (x)) == UNITS_PER_WORD
2400 && GET_MODE (SUBREG_REG (x)) != VOIDmode)
2401 new = operand_subword (inner, SUBREG_WORD (x), 0,
2402 GET_MODE (SUBREG_REG (x)));
2404 cancel_changes (num_changes);
2405 if (new == 0 && subreg_lowpart_p (x))
2406 new = gen_lowpart_common (GET_MODE (x), inner);
2409 validate_change (insn, loc, new, 1);
2416 subst_constants (&XEXP (x, 0), insn, map, 0);
2418 /* If a memory address got spoiled, change it back. */
2419 if (! memonly && insn != 0 && num_validated_changes () != num_changes
2420 && ! memory_address_p (GET_MODE (x), XEXP (x, 0)))
2421 cancel_changes (num_changes);
2426 /* Substitute constants in our source, and in any arguments to a
2427 complex (e..g, ZERO_EXTRACT) destination, but not in the destination
2429 rtx *dest_loc = &SET_DEST (x);
2430 rtx dest = *dest_loc;
2433 subst_constants (&SET_SRC (x), insn, map, memonly);
2436 while (GET_CODE (*dest_loc) == ZERO_EXTRACT
2437 || GET_CODE (*dest_loc) == SUBREG
2438 || GET_CODE (*dest_loc) == STRICT_LOW_PART)
2440 if (GET_CODE (*dest_loc) == ZERO_EXTRACT)
2442 subst_constants (&XEXP (*dest_loc, 1), insn, map, memonly);
2443 subst_constants (&XEXP (*dest_loc, 2), insn, map, memonly);
2445 dest_loc = &XEXP (*dest_loc, 0);
2448 /* Do substitute in the address of a destination in memory. */
2449 if (GET_CODE (*dest_loc) == MEM)
2450 subst_constants (&XEXP (*dest_loc, 0), insn, map, 0);
2452 /* Check for the case of DEST a SUBREG, both it and the underlying
2453 register are less than one word, and the SUBREG has the wider mode.
2454 In the case, we are really setting the underlying register to the
2455 source converted to the mode of DEST. So indicate that. */
2456 if (GET_CODE (dest) == SUBREG
2457 && GET_MODE_SIZE (GET_MODE (dest)) <= UNITS_PER_WORD
2458 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest))) <= UNITS_PER_WORD
2459 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest)))
2460 <= GET_MODE_SIZE (GET_MODE (dest)))
2461 && (tem = gen_lowpart_if_possible (GET_MODE (SUBREG_REG (dest)),
2463 src = tem, dest = SUBREG_REG (dest);
2465 /* If storing a recognizable value save it for later recording. */
2466 if ((map->num_sets < MAX_RECOG_OPERANDS)
2467 && (CONSTANT_P (src)
2468 || (GET_CODE (src) == REG
2469 && (REGNO (src) == VIRTUAL_INCOMING_ARGS_REGNUM
2470 || REGNO (src) == VIRTUAL_STACK_VARS_REGNUM))
2471 || (GET_CODE (src) == PLUS
2472 && GET_CODE (XEXP (src, 0)) == REG
2473 && (REGNO (XEXP (src, 0)) == VIRTUAL_INCOMING_ARGS_REGNUM
2474 || REGNO (XEXP (src, 0)) == VIRTUAL_STACK_VARS_REGNUM)
2475 && CONSTANT_P (XEXP (src, 1)))
2476 || GET_CODE (src) == COMPARE
2481 && (src == pc_rtx || GET_CODE (src) == RETURN
2482 || GET_CODE (src) == LABEL_REF))))
2484 /* Normally, this copy won't do anything. But, if SRC is a COMPARE
2485 it will cause us to save the COMPARE with any constants
2486 substituted, which is what we want for later. */
2487 map->equiv_sets[map->num_sets].equiv = copy_rtx (src);
2488 map->equiv_sets[map->num_sets++].dest = dest;
2497 format_ptr = GET_RTX_FORMAT (code);
2499 /* If the first operand is an expression, save its mode for later. */
2500 if (*format_ptr == 'e')
2501 op0_mode = GET_MODE (XEXP (x, 0));
2503 for (i = 0; i < GET_RTX_LENGTH (code); i++)
2505 switch (*format_ptr++)
2512 subst_constants (&XEXP (x, i), insn, map, memonly);
2524 if (XVEC (x, i) != NULL && XVECLEN (x, i) != 0)
2525 for (j = 0; j < XVECLEN (x, i); j++)
2526 subst_constants (&XVECEXP (x, i, j), insn, map, memonly);
2535 /* If this is a commutative operation, move a constant to the second
2536 operand unless the second operand is already a CONST_INT. */
2538 && (GET_RTX_CLASS (code) == 'c' || code == NE || code == EQ)
2539 && CONSTANT_P (XEXP (x, 0)) && GET_CODE (XEXP (x, 1)) != CONST_INT)
2541 rtx tem = XEXP (x, 0);
2542 validate_change (insn, &XEXP (x, 0), XEXP (x, 1), 1);
2543 validate_change (insn, &XEXP (x, 1), tem, 1);
2546 /* Simplify the expression in case we put in some constants. */
2548 switch (GET_RTX_CLASS (code))
2551 if (op0_mode == MAX_MACHINE_MODE)
2553 new = simplify_unary_operation (code, GET_MODE (x),
2554 XEXP (x, 0), op0_mode);
2559 enum machine_mode op_mode = GET_MODE (XEXP (x, 0));
2561 if (op_mode == VOIDmode)
2562 op_mode = GET_MODE (XEXP (x, 1));
2563 new = simplify_relational_operation (code, op_mode,
2564 XEXP (x, 0), XEXP (x, 1));
2565 #ifdef FLOAT_STORE_FLAG_VALUE
2566 if (new != 0 && GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT)
2568 enum machine_mode mode = GET_MODE (x);
2569 if (new == const0_rtx)
2570 new = CONST0_RTX (mode);
2573 REAL_VALUE_TYPE val = FLOAT_STORE_FLAG_VALUE (mode);
2574 new = CONST_DOUBLE_FROM_REAL_VALUE (val, mode);
2583 new = simplify_binary_operation (code, GET_MODE (x),
2584 XEXP (x, 0), XEXP (x, 1));
2589 if (op0_mode == MAX_MACHINE_MODE)
2592 new = simplify_ternary_operation (code, GET_MODE (x), op0_mode,
2593 XEXP (x, 0), XEXP (x, 1),
2599 validate_change (insn, loc, new, 1);
2602 /* Show that register modified no longer contain known constants. We are
2603 called from note_stores with parts of the new insn. */
2606 mark_stores (dest, x, data)
2608 rtx x ATTRIBUTE_UNUSED;
2609 void *data ATTRIBUTE_UNUSED;
2612 enum machine_mode mode = VOIDmode;
2614 /* DEST is always the innermost thing set, except in the case of
2615 SUBREGs of hard registers. */
2617 if (GET_CODE (dest) == REG)
2618 regno = REGNO (dest), mode = GET_MODE (dest);
2619 else if (GET_CODE (dest) == SUBREG && GET_CODE (SUBREG_REG (dest)) == REG)
2621 regno = REGNO (SUBREG_REG (dest)) + SUBREG_WORD (dest);
2622 mode = GET_MODE (SUBREG_REG (dest));
2627 unsigned int uregno = regno;
2628 unsigned int last_reg = (uregno >= FIRST_PSEUDO_REGISTER ? uregno
2629 : uregno + HARD_REGNO_NREGS (uregno, mode) - 1);
2632 /* Ignore virtual stack var or virtual arg register since those
2633 are handled separately. */
2634 if (uregno != VIRTUAL_INCOMING_ARGS_REGNUM
2635 && uregno != VIRTUAL_STACK_VARS_REGNUM)
2636 for (i = uregno; i <= last_reg; i++)
2637 if ((size_t) i < VARRAY_SIZE (global_const_equiv_varray))
2638 VARRAY_CONST_EQUIV (global_const_equiv_varray, i).rtx = 0;
2642 /* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the
2643 given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so
2644 that it points to the node itself, thus indicating that the node is its
2645 own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for
2646 the given node is NULL, recursively descend the decl/block tree which
2647 it is the root of, and for each other ..._DECL or BLOCK node contained
2648 therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also
2649 still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN
2650 values to point to themselves. */
2653 set_block_origin_self (stmt)
2656 if (BLOCK_ABSTRACT_ORIGIN (stmt) == NULL_TREE)
2658 BLOCK_ABSTRACT_ORIGIN (stmt) = stmt;
2661 register tree local_decl;
2663 for (local_decl = BLOCK_VARS (stmt);
2664 local_decl != NULL_TREE;
2665 local_decl = TREE_CHAIN (local_decl))
2666 set_decl_origin_self (local_decl); /* Potential recursion. */
2670 register tree subblock;
2672 for (subblock = BLOCK_SUBBLOCKS (stmt);
2673 subblock != NULL_TREE;
2674 subblock = BLOCK_CHAIN (subblock))
2675 set_block_origin_self (subblock); /* Recurse. */
2680 /* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for
2681 the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the
2682 node to so that it points to the node itself, thus indicating that the
2683 node represents its own (abstract) origin. Additionally, if the
2684 DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend
2685 the decl/block tree of which the given node is the root of, and for
2686 each other ..._DECL or BLOCK node contained therein whose
2687 DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL,
2688 set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to
2689 point to themselves. */
2692 set_decl_origin_self (decl)
2695 if (DECL_ABSTRACT_ORIGIN (decl) == NULL_TREE)
2697 DECL_ABSTRACT_ORIGIN (decl) = decl;
2698 if (TREE_CODE (decl) == FUNCTION_DECL)
2702 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2703 DECL_ABSTRACT_ORIGIN (arg) = arg;
2704 if (DECL_INITIAL (decl) != NULL_TREE
2705 && DECL_INITIAL (decl) != error_mark_node)
2706 set_block_origin_self (DECL_INITIAL (decl));
2711 /* Given a pointer to some BLOCK node, and a boolean value to set the
2712 "abstract" flags to, set that value into the BLOCK_ABSTRACT flag for
2713 the given block, and for all local decls and all local sub-blocks
2714 (recursively) which are contained therein. */
2717 set_block_abstract_flags (stmt, setting)
2719 register int setting;
2721 register tree local_decl;
2722 register tree subblock;
2724 BLOCK_ABSTRACT (stmt) = setting;
2726 for (local_decl = BLOCK_VARS (stmt);
2727 local_decl != NULL_TREE;
2728 local_decl = TREE_CHAIN (local_decl))
2729 set_decl_abstract_flags (local_decl, setting);
2731 for (subblock = BLOCK_SUBBLOCKS (stmt);
2732 subblock != NULL_TREE;
2733 subblock = BLOCK_CHAIN (subblock))
2734 set_block_abstract_flags (subblock, setting);
2737 /* Given a pointer to some ..._DECL node, and a boolean value to set the
2738 "abstract" flags to, set that value into the DECL_ABSTRACT flag for the
2739 given decl, and (in the case where the decl is a FUNCTION_DECL) also
2740 set the abstract flags for all of the parameters, local vars, local
2741 blocks and sub-blocks (recursively) to the same setting. */
2744 set_decl_abstract_flags (decl, setting)
2746 register int setting;
2748 DECL_ABSTRACT (decl) = setting;
2749 if (TREE_CODE (decl) == FUNCTION_DECL)
2753 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2754 DECL_ABSTRACT (arg) = setting;
2755 if (DECL_INITIAL (decl) != NULL_TREE
2756 && DECL_INITIAL (decl) != error_mark_node)
2757 set_block_abstract_flags (DECL_INITIAL (decl), setting);
2761 /* Output the assembly language code for the function FNDECL
2762 from its DECL_SAVED_INSNS. Used for inline functions that are output
2763 at end of compilation instead of where they came in the source. */
2766 output_inline_function (fndecl)
2769 struct function *old_cfun = cfun;
2770 struct function *f = DECL_SAVED_INSNS (fndecl);
2773 current_function_decl = fndecl;
2774 clear_emit_caches ();
2776 /* Things we allocate from here on are part of this function, not
2778 temporary_allocation ();
2780 set_new_last_label_num (f->inl_max_label_num);
2782 /* We're not deferring this any longer. */
2783 DECL_DEFER_OUTPUT (fndecl) = 0;
2785 /* Compile this function all the way down to assembly code. */
2786 rest_of_compilation (fndecl);
2788 /* We can't inline this anymore. */
2790 DECL_INLINE (fndecl) = 0;
2793 current_function_decl = old_cfun ? old_cfun->decl : 0;
OSDN Git Service
