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;
142 if (DECL_UNINLINABLE (fndecl))
143 return N_("function cannot be inline");
145 /* No inlines with varargs. */
146 if ((last && TREE_VALUE (last) != void_type_node)
147 || current_function_varargs)
148 return N_("varargs function cannot be inline");
150 if (current_function_calls_alloca)
151 return N_("function using alloca cannot be inline");
153 if (current_function_calls_setjmp)
154 return N_("function using setjmp cannot be inline");
156 if (current_function_contains_functions)
157 return N_("function with nested functions cannot be inline");
161 N_("function with label addresses used in initializers cannot inline");
163 if (current_function_cannot_inline)
164 return current_function_cannot_inline;
166 /* If its not even close, don't even look. */
167 if (get_max_uid () > 3 * max_insns)
168 return N_("function too large to be inline");
171 /* Don't inline functions which do not specify a function prototype and
172 have BLKmode argument or take the address of a parameter. */
173 for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms))
175 if (TYPE_MODE (TREE_TYPE (parms)) == BLKmode)
176 TREE_ADDRESSABLE (parms) = 1;
177 if (last == NULL_TREE && TREE_ADDRESSABLE (parms))
178 return N_("no prototype, and parameter address used; cannot be inline");
182 /* We can't inline functions that return structures
183 the old-fashioned PCC way, copying into a static block. */
184 if (current_function_returns_pcc_struct)
185 return N_("inline functions not supported for this return value type");
187 /* We can't inline functions that return structures of varying size. */
188 if (TREE_CODE (TREE_TYPE (TREE_TYPE (fndecl))) != VOID_TYPE
189 && int_size_in_bytes (TREE_TYPE (TREE_TYPE (fndecl))) < 0)
190 return N_("function with varying-size return value cannot be inline");
192 /* Cannot inline a function with a varying size argument or one that
193 receives a transparent union. */
194 for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms))
196 if (int_size_in_bytes (TREE_TYPE (parms)) < 0)
197 return N_("function with varying-size parameter cannot be inline");
198 else if (TREE_CODE (TREE_TYPE (parms)) == UNION_TYPE
199 && TYPE_TRANSPARENT_UNION (TREE_TYPE (parms)))
200 return N_("function with transparent unit parameter cannot be inline");
203 if (get_max_uid () > max_insns)
205 for (ninsns = 0, insn = get_first_nonparm_insn ();
206 insn && ninsns < max_insns;
207 insn = NEXT_INSN (insn))
211 if (ninsns >= max_insns)
212 return N_("function too large to be inline");
215 /* We will not inline a function which uses computed goto. The addresses of
216 its local labels, which may be tucked into global storage, are of course
217 not constant across instantiations, which causes unexpected behaviour. */
218 if (current_function_has_computed_jump)
219 return N_("function with computed jump cannot inline");
221 /* We cannot inline a nested function that jumps to a nonlocal label. */
222 if (current_function_has_nonlocal_goto)
223 return N_("function with nonlocal goto cannot be inline");
225 /* This is a hack, until the inliner is taught about eh regions at
226 the start of the function. */
227 for (insn = get_insns ();
229 && ! (GET_CODE (insn) == NOTE
230 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG);
231 insn = NEXT_INSN (insn))
233 if (insn && GET_CODE (insn) == NOTE
234 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG)
235 return N_("function with complex parameters cannot be inline");
238 /* We can't inline functions that return a PARALLEL rtx. */
239 result = DECL_RTL (DECL_RESULT (fndecl));
240 if (result && GET_CODE (result) == PARALLEL)
241 return N_("inline functions not supported for this return value type");
243 /* If the function has a target specific attribute attached to it,
244 then we assume that we should not inline it. This can be overriden
245 by the target if it defines FUNCTION_ATTRIBUTE_INLINABLE_P. */
246 if (DECL_MACHINE_ATTRIBUTES (fndecl)
247 && ! FUNCTION_ATTRIBUTE_INLINABLE_P (fndecl))
248 return N_("function with target specific attribute(s) cannot be inlined");
253 /* Map pseudo reg number into the PARM_DECL for the parm living in the reg.
254 Zero for a reg that isn't a parm's home.
255 Only reg numbers less than max_parm_reg are mapped here. */
256 static tree *parmdecl_map;
258 /* In save_for_inline, nonzero if past the parm-initialization insns. */
259 static int in_nonparm_insns;
261 /* Subroutine for `save_for_inline'. Performs initialization
262 needed to save FNDECL's insns and info for future inline expansion. */
265 initialize_for_inline (fndecl)
272 /* Clear out PARMDECL_MAP. It was allocated in the caller's frame. */
273 memset ((char *) parmdecl_map, 0, max_parm_reg * sizeof (tree));
274 arg_vector = rtvec_alloc (list_length (DECL_ARGUMENTS (fndecl)));
276 for (parms = DECL_ARGUMENTS (fndecl), i = 0;
278 parms = TREE_CHAIN (parms), i++)
280 rtx p = DECL_RTL (parms);
282 /* If we have (mem (addressof (mem ...))), use the inner MEM since
283 otherwise the copy_rtx call below will not unshare the MEM since
284 it shares ADDRESSOF. */
285 if (GET_CODE (p) == MEM && GET_CODE (XEXP (p, 0)) == ADDRESSOF
286 && GET_CODE (XEXP (XEXP (p, 0), 0)) == MEM)
287 p = XEXP (XEXP (p, 0), 0);
289 RTVEC_ELT (arg_vector, i) = p;
291 if (GET_CODE (p) == REG)
292 parmdecl_map[REGNO (p)] = parms;
293 else if (GET_CODE (p) == CONCAT)
295 rtx preal = gen_realpart (GET_MODE (XEXP (p, 0)), p);
296 rtx pimag = gen_imagpart (GET_MODE (preal), p);
298 if (GET_CODE (preal) == REG)
299 parmdecl_map[REGNO (preal)] = parms;
300 if (GET_CODE (pimag) == REG)
301 parmdecl_map[REGNO (pimag)] = parms;
304 /* This flag is cleared later
305 if the function ever modifies the value of the parm. */
306 TREE_READONLY (parms) = 1;
312 /* Copy NODE (which must be a DECL, but not a PARM_DECL). The DECL
313 originally was in the FROM_FN, but now it will be in the
317 copy_decl_for_inlining (decl, from_fn, to_fn)
324 /* Copy the declaration. */
325 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
327 /* For a parameter, we must make an equivalent VAR_DECL, not a
329 copy = build_decl (VAR_DECL, DECL_NAME (decl), TREE_TYPE (decl));
330 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
331 TREE_READONLY (copy) = TREE_READONLY (decl);
332 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
336 copy = copy_node (decl);
337 if (DECL_LANG_SPECIFIC (copy))
338 copy_lang_decl (copy);
340 /* TREE_ADDRESSABLE isn't used to indicate that a label's
341 address has been taken; it's for internal bookkeeping in
342 expand_goto_internal. */
343 if (TREE_CODE (copy) == LABEL_DECL)
344 TREE_ADDRESSABLE (copy) = 0;
347 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
348 declaration inspired this copy. */
349 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
351 /* The new variable/label has no RTL, yet. */
352 DECL_RTL (copy) = NULL_RTX;
354 /* These args would always appear unused, if not for this. */
355 TREE_USED (copy) = 1;
357 /* Set the context for the new declaration. */
358 if (!DECL_CONTEXT (decl))
359 /* Globals stay global. */
361 else if (DECL_CONTEXT (decl) != from_fn)
362 /* Things that weren't in the scope of the function we're inlining
363 from aren't in the scope we're inlining too, either. */
365 else if (TREE_STATIC (decl))
366 /* Function-scoped static variables should say in the original
370 /* Ordinary automatic local variables are now in the scope of the
372 DECL_CONTEXT (copy) = to_fn;
377 /* Make the insns and PARM_DECLs of the current function permanent
378 and record other information in DECL_SAVED_INSNS to allow inlining
379 of this function in subsequent calls.
381 This routine need not copy any insns because we are not going
382 to immediately compile the insns in the insn chain. There
383 are two cases when we would compile the insns for FNDECL:
384 (1) when FNDECL is expanded inline, and (2) when FNDECL needs to
385 be output at the end of other compilation, because somebody took
386 its address. In the first case, the insns of FNDECL are copied
387 as it is expanded inline, so FNDECL's saved insns are not
388 modified. In the second case, FNDECL is used for the last time,
389 so modifying the rtl is not a problem.
391 We don't have to worry about FNDECL being inline expanded by
392 other functions which are written at the end of compilation
393 because flag_no_inline is turned on when we begin writing
394 functions at the end of compilation. */
397 save_for_inline (fndecl)
402 rtx first_nonparm_insn;
404 /* Set up PARMDECL_MAP which maps pseudo-reg number to its PARM_DECL.
405 Later we set TREE_READONLY to 0 if the parm is modified inside the fn.
406 Also set up ARG_VECTOR, which holds the unmodified DECL_RTX values
407 for the parms, prior to elimination of virtual registers.
408 These values are needed for substituting parms properly. */
410 parmdecl_map = (tree *) xmalloc (max_parm_reg * sizeof (tree));
412 /* Make and emit a return-label if we have not already done so. */
414 if (return_label == 0)
416 return_label = gen_label_rtx ();
417 emit_label (return_label);
420 argvec = initialize_for_inline (fndecl);
422 /* If there are insns that copy parms from the stack into pseudo registers,
423 those insns are not copied. `expand_inline_function' must
424 emit the correct code to handle such things. */
427 if (GET_CODE (insn) != NOTE)
430 /* Get the insn which signals the end of parameter setup code. */
431 first_nonparm_insn = get_first_nonparm_insn ();
433 /* Now just scan the chain of insns to see what happens to our
434 PARM_DECLs. If a PARM_DECL is used but never modified, we
435 can substitute its rtl directly when expanding inline (and
436 perform constant folding when its incoming value is constant).
437 Otherwise, we have to copy its value into a new register and track
438 the new register's life. */
439 in_nonparm_insns = 0;
440 save_parm_insns (insn, first_nonparm_insn);
442 cfun->inl_max_label_num = max_label_num ();
443 cfun->inl_last_parm_insn = cfun->x_last_parm_insn;
444 cfun->original_arg_vector = argvec;
445 cfun->original_decl_initial = DECL_INITIAL (fndecl);
446 cfun->no_debugging_symbols = (write_symbols == NO_DEBUG);
447 DECL_SAVED_INSNS (fndecl) = cfun;
453 /* Scan the chain of insns to see what happens to our PARM_DECLs. If a
454 PARM_DECL is used but never modified, we can substitute its rtl directly
455 when expanding inline (and perform constant folding when its incoming
456 value is constant). Otherwise, we have to copy its value into a new
457 register and track the new register's life. */
460 save_parm_insns (insn, first_nonparm_insn)
462 rtx first_nonparm_insn;
464 if (insn == NULL_RTX)
467 for (insn = NEXT_INSN (insn); insn; insn = NEXT_INSN (insn))
469 if (insn == first_nonparm_insn)
470 in_nonparm_insns = 1;
474 /* Record what interesting things happen to our parameters. */
475 note_stores (PATTERN (insn), note_modified_parmregs, NULL);
477 /* If this is a CALL_PLACEHOLDER insn then we need to look into the
478 three attached sequences: normal call, sibling call and tail
480 if (GET_CODE (insn) == CALL_INSN
481 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
485 for (i = 0; i < 3; i++)
486 save_parm_insns (XEXP (PATTERN (insn), i),
493 /* Note whether a parameter is modified or not. */
496 note_modified_parmregs (reg, x, data)
498 rtx x ATTRIBUTE_UNUSED;
499 void *data ATTRIBUTE_UNUSED;
501 if (GET_CODE (reg) == REG && in_nonparm_insns
502 && REGNO (reg) < max_parm_reg
503 && REGNO (reg) >= FIRST_PSEUDO_REGISTER
504 && parmdecl_map[REGNO (reg)] != 0)
505 TREE_READONLY (parmdecl_map[REGNO (reg)]) = 0;
508 /* Unfortunately, we need a global copy of const_equiv map for communication
509 with a function called from note_stores. Be *very* careful that this
510 is used properly in the presence of recursion. */
512 varray_type global_const_equiv_varray;
514 #define FIXED_BASE_PLUS_P(X) \
515 (GET_CODE (X) == PLUS && GET_CODE (XEXP (X, 1)) == CONST_INT \
516 && GET_CODE (XEXP (X, 0)) == REG \
517 && REGNO (XEXP (X, 0)) >= FIRST_VIRTUAL_REGISTER \
518 && REGNO (XEXP (X, 0)) <= LAST_VIRTUAL_REGISTER)
520 /* Called to set up a mapping for the case where a parameter is in a
521 register. If it is read-only and our argument is a constant, set up the
522 constant equivalence.
524 If LOC is REG_USERVAR_P, the usual case, COPY must also have that flag set
527 Also, don't allow hard registers here; they might not be valid when
528 substituted into insns. */
530 process_reg_param (map, loc, copy)
531 struct inline_remap *map;
534 if ((GET_CODE (copy) != REG && GET_CODE (copy) != SUBREG)
535 || (GET_CODE (copy) == REG && REG_USERVAR_P (loc)
536 && ! REG_USERVAR_P (copy))
537 || (GET_CODE (copy) == REG
538 && REGNO (copy) < FIRST_PSEUDO_REGISTER))
540 rtx temp = copy_to_mode_reg (GET_MODE (loc), copy);
541 REG_USERVAR_P (temp) = REG_USERVAR_P (loc);
542 if (CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy))
543 SET_CONST_EQUIV_DATA (map, temp, copy, CONST_AGE_PARM);
546 map->reg_map[REGNO (loc)] = copy;
549 /* Used by duplicate_eh_handlers to map labels for the exception table */
550 static struct inline_remap *eif_eh_map;
553 expand_inline_function_eh_labelmap (label)
556 int index = CODE_LABEL_NUMBER (label);
557 return get_label_from_map (eif_eh_map, index);
560 /* Compare two BLOCKs for qsort. The key we sort on is the
561 BLOCK_ABSTRACT_ORIGIN of the blocks. */
564 compare_blocks (v1, v2)
568 tree b1 = *((const tree *) v1);
569 tree b2 = *((const tree *) v2);
571 return ((char *) BLOCK_ABSTRACT_ORIGIN (b1)
572 - (char *) BLOCK_ABSTRACT_ORIGIN (b2));
575 /* Compare two BLOCKs for bsearch. The first pointer corresponds to
576 an original block; the second to a remapped equivalent. */
583 const union tree_node *b1 = (const union tree_node *) v1;
584 tree b2 = *((const tree *) v2);
586 return ((const char *) b1 - (char *) BLOCK_ABSTRACT_ORIGIN (b2));
589 /* Integrate the procedure defined by FNDECL. Note that this function
590 may wind up calling itself. Since the static variables are not
591 reentrant, we do not assign them until after the possibility
592 of recursion is eliminated.
594 If IGNORE is nonzero, do not produce a value.
595 Otherwise store the value in TARGET if it is nonzero and that is convenient.
598 (rtx)-1 if we could not substitute the function
599 0 if we substituted it and it does not produce a value
600 else an rtx for where the value is stored. */
603 expand_inline_function (fndecl, parms, target, ignore, type,
604 structure_value_addr)
609 rtx structure_value_addr;
611 struct function *inlining_previous;
612 struct function *inl_f = DECL_SAVED_INSNS (fndecl);
613 tree formal, actual, block;
614 rtx parm_insns = inl_f->emit->x_first_insn;
615 rtx insns = (inl_f->inl_last_parm_insn
616 ? NEXT_INSN (inl_f->inl_last_parm_insn)
622 int min_labelno = inl_f->emit->x_first_label_num;
623 int max_labelno = inl_f->inl_max_label_num;
628 struct inline_remap *map = 0;
632 rtvec arg_vector = (rtvec) inl_f->original_arg_vector;
633 rtx static_chain_value = 0;
636 /* The pointer used to track the true location of the memory used
637 for MAP->LABEL_MAP. */
638 rtx *real_label_map = 0;
640 /* Allow for equivalences of the pseudos we make for virtual fp and ap. */
641 max_regno = inl_f->emit->x_reg_rtx_no + 3;
642 if (max_regno < FIRST_PSEUDO_REGISTER)
645 /* Pull out the decl for the function definition; fndecl may be a
646 local declaration, which would break DECL_ABSTRACT_ORIGIN. */
647 fndecl = inl_f->decl;
649 nargs = list_length (DECL_ARGUMENTS (fndecl));
651 if (cfun->preferred_stack_boundary < inl_f->preferred_stack_boundary)
652 cfun->preferred_stack_boundary = inl_f->preferred_stack_boundary;
654 /* Check that the parms type match and that sufficient arguments were
655 passed. Since the appropriate conversions or default promotions have
656 already been applied, the machine modes should match exactly. */
658 for (formal = DECL_ARGUMENTS (fndecl), actual = parms;
660 formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual))
663 enum machine_mode mode;
666 return (rtx) (HOST_WIDE_INT) -1;
668 arg = TREE_VALUE (actual);
669 mode = TYPE_MODE (DECL_ARG_TYPE (formal));
671 if (mode != TYPE_MODE (TREE_TYPE (arg))
672 /* If they are block mode, the types should match exactly.
673 They don't match exactly if TREE_TYPE (FORMAL) == ERROR_MARK_NODE,
674 which could happen if the parameter has incomplete type. */
676 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg))
677 != TYPE_MAIN_VARIANT (TREE_TYPE (formal)))))
678 return (rtx) (HOST_WIDE_INT) -1;
681 /* Extra arguments are valid, but will be ignored below, so we must
682 evaluate them here for side-effects. */
683 for (; actual; actual = TREE_CHAIN (actual))
684 expand_expr (TREE_VALUE (actual), const0_rtx,
685 TYPE_MODE (TREE_TYPE (TREE_VALUE (actual))), 0);
687 /* Expand the function arguments. Do this first so that any
688 new registers get created before we allocate the maps. */
690 arg_vals = (rtx *) xmalloc (nargs * sizeof (rtx));
691 arg_trees = (tree *) xmalloc (nargs * sizeof (tree));
693 for (formal = DECL_ARGUMENTS (fndecl), actual = parms, i = 0;
695 formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual), i++)
697 /* Actual parameter, converted to the type of the argument within the
699 tree arg = convert (TREE_TYPE (formal), TREE_VALUE (actual));
700 /* Mode of the variable used within the function. */
701 enum machine_mode mode = TYPE_MODE (TREE_TYPE (formal));
705 loc = RTVEC_ELT (arg_vector, i);
707 /* If this is an object passed by invisible reference, we copy the
708 object into a stack slot and save its address. If this will go
709 into memory, we do nothing now. Otherwise, we just expand the
711 if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG
712 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)
714 rtx stack_slot = assign_temp (TREE_TYPE (arg), 1, 1, 1);
716 store_expr (arg, stack_slot, 0);
717 arg_vals[i] = XEXP (stack_slot, 0);
720 else if (GET_CODE (loc) != MEM)
722 if (GET_MODE (loc) != TYPE_MODE (TREE_TYPE (arg)))
723 /* The mode if LOC and ARG can differ if LOC was a variable
724 that had its mode promoted via PROMOTED_MODE. */
725 arg_vals[i] = convert_modes (GET_MODE (loc),
726 TYPE_MODE (TREE_TYPE (arg)),
727 expand_expr (arg, NULL_RTX, mode,
729 TREE_UNSIGNED (TREE_TYPE (formal)));
731 arg_vals[i] = expand_expr (arg, NULL_RTX, mode, EXPAND_SUM);
737 && (! TREE_READONLY (formal)
738 /* If the parameter is not read-only, copy our argument through
739 a register. Also, we cannot use ARG_VALS[I] if it overlaps
740 TARGET in any way. In the inline function, they will likely
741 be two different pseudos, and `safe_from_p' will make all
742 sorts of smart assumptions about their not conflicting.
743 But if ARG_VALS[I] overlaps TARGET, these assumptions are
744 wrong, so put ARG_VALS[I] into a fresh register.
745 Don't worry about invisible references, since their stack
746 temps will never overlap the target. */
749 && (GET_CODE (arg_vals[i]) == REG
750 || GET_CODE (arg_vals[i]) == SUBREG
751 || GET_CODE (arg_vals[i]) == MEM)
752 && reg_overlap_mentioned_p (arg_vals[i], target))
753 /* ??? We must always copy a SUBREG into a REG, because it might
754 get substituted into an address, and not all ports correctly
755 handle SUBREGs in addresses. */
756 || (GET_CODE (arg_vals[i]) == SUBREG)))
757 arg_vals[i] = copy_to_mode_reg (GET_MODE (loc), arg_vals[i]);
759 if (arg_vals[i] != 0 && GET_CODE (arg_vals[i]) == REG
760 && POINTER_TYPE_P (TREE_TYPE (formal)))
761 mark_reg_pointer (arg_vals[i],
762 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (formal))));
765 /* Allocate the structures we use to remap things. */
767 map = (struct inline_remap *) xmalloc (sizeof (struct inline_remap));
768 map->fndecl = fndecl;
770 VARRAY_TREE_INIT (map->block_map, 10, "block_map");
771 map->reg_map = (rtx *) xcalloc (max_regno, sizeof (rtx));
773 /* We used to use alloca here, but the size of what it would try to
774 allocate would occasionally cause it to exceed the stack limit and
775 cause unpredictable core dumps. */
777 = (rtx *) xmalloc ((max_labelno) * sizeof (rtx));
778 map->label_map = real_label_map;
780 inl_max_uid = (inl_f->emit->x_cur_insn_uid + 1);
781 map->insn_map = (rtx *) xcalloc (inl_max_uid, sizeof (rtx));
783 map->max_insnno = inl_max_uid;
785 map->integrating = 1;
786 map->compare_src = NULL_RTX;
787 map->compare_mode = VOIDmode;
789 /* const_equiv_varray maps pseudos in our routine to constants, so
790 it needs to be large enough for all our pseudos. This is the
791 number we are currently using plus the number in the called
792 routine, plus 15 for each arg, five to compute the virtual frame
793 pointer, and five for the return value. This should be enough
794 for most cases. We do not reference entries outside the range of
797 ??? These numbers are quite arbitrary and were obtained by
798 experimentation. At some point, we should try to allocate the
799 table after all the parameters are set up so we an more accurately
800 estimate the number of pseudos we will need. */
802 VARRAY_CONST_EQUIV_INIT (map->const_equiv_varray,
804 + (max_regno - FIRST_PSEUDO_REGISTER)
807 "expand_inline_function");
810 /* Record the current insn in case we have to set up pointers to frame
811 and argument memory blocks. If there are no insns yet, add a dummy
812 insn that can be used as an insertion point. */
813 map->insns_at_start = get_last_insn ();
814 if (map->insns_at_start == 0)
815 map->insns_at_start = emit_note (NULL_PTR, NOTE_INSN_DELETED);
817 map->regno_pointer_align = inl_f->emit->regno_pointer_align;
818 map->x_regno_reg_rtx = inl_f->emit->x_regno_reg_rtx;
820 /* Update the outgoing argument size to allow for those in the inlined
822 if (inl_f->outgoing_args_size > current_function_outgoing_args_size)
823 current_function_outgoing_args_size = inl_f->outgoing_args_size;
825 /* If the inline function needs to make PIC references, that means
826 that this function's PIC offset table must be used. */
827 if (inl_f->uses_pic_offset_table)
828 current_function_uses_pic_offset_table = 1;
830 /* If this function needs a context, set it up. */
831 if (inl_f->needs_context)
832 static_chain_value = lookup_static_chain (fndecl);
834 if (GET_CODE (parm_insns) == NOTE
835 && NOTE_LINE_NUMBER (parm_insns) > 0)
837 rtx note = emit_note (NOTE_SOURCE_FILE (parm_insns),
838 NOTE_LINE_NUMBER (parm_insns));
840 RTX_INTEGRATED_P (note) = 1;
843 /* Process each argument. For each, set up things so that the function's
844 reference to the argument will refer to the argument being passed.
845 We only replace REG with REG here. Any simplifications are done
848 We make two passes: In the first, we deal with parameters that will
849 be placed into registers, since we need to ensure that the allocated
850 register number fits in const_equiv_map. Then we store all non-register
851 parameters into their memory location. */
853 /* Don't try to free temp stack slots here, because we may put one of the
854 parameters into a temp stack slot. */
856 for (i = 0; i < nargs; i++)
858 rtx copy = arg_vals[i];
860 loc = RTVEC_ELT (arg_vector, i);
862 /* There are three cases, each handled separately. */
863 if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG
864 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)
866 /* This must be an object passed by invisible reference (it could
867 also be a variable-sized object, but we forbid inlining functions
868 with variable-sized arguments). COPY is the address of the
869 actual value (this computation will cause it to be copied). We
870 map that address for the register, noting the actual address as
871 an equivalent in case it can be substituted into the insns. */
873 if (GET_CODE (copy) != REG)
875 temp = copy_addr_to_reg (copy);
876 if (CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy))
877 SET_CONST_EQUIV_DATA (map, temp, copy, CONST_AGE_PARM);
880 map->reg_map[REGNO (XEXP (loc, 0))] = copy;
882 else if (GET_CODE (loc) == MEM)
884 /* This is the case of a parameter that lives in memory. It
885 will live in the block we allocate in the called routine's
886 frame that simulates the incoming argument area. Do nothing
887 with the parameter now; we will call store_expr later. In
888 this case, however, we must ensure that the virtual stack and
889 incoming arg rtx values are expanded now so that we can be
890 sure we have enough slots in the const equiv map since the
891 store_expr call can easily blow the size estimate. */
892 if (DECL_FRAME_SIZE (fndecl) != 0)
893 copy_rtx_and_substitute (virtual_stack_vars_rtx, map, 0);
895 if (DECL_SAVED_INSNS (fndecl)->args_size != 0)
896 copy_rtx_and_substitute (virtual_incoming_args_rtx, map, 0);
898 else if (GET_CODE (loc) == REG)
899 process_reg_param (map, loc, copy);
900 else if (GET_CODE (loc) == CONCAT)
902 rtx locreal = gen_realpart (GET_MODE (XEXP (loc, 0)), loc);
903 rtx locimag = gen_imagpart (GET_MODE (XEXP (loc, 0)), loc);
904 rtx copyreal = gen_realpart (GET_MODE (locreal), copy);
905 rtx copyimag = gen_imagpart (GET_MODE (locimag), copy);
907 process_reg_param (map, locreal, copyreal);
908 process_reg_param (map, locimag, copyimag);
914 /* Tell copy_rtx_and_substitute to handle constant pool SYMBOL_REFs
915 specially. This function can be called recursively, so we need to
916 save the previous value. */
917 inlining_previous = inlining;
920 /* Now do the parameters that will be placed in memory. */
922 for (formal = DECL_ARGUMENTS (fndecl), i = 0;
923 formal; formal = TREE_CHAIN (formal), i++)
925 loc = RTVEC_ELT (arg_vector, i);
927 if (GET_CODE (loc) == MEM
928 /* Exclude case handled above. */
929 && ! (GET_CODE (XEXP (loc, 0)) == REG
930 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER))
932 rtx note = emit_note (DECL_SOURCE_FILE (formal),
933 DECL_SOURCE_LINE (formal));
935 RTX_INTEGRATED_P (note) = 1;
937 /* Compute the address in the area we reserved and store the
939 temp = copy_rtx_and_substitute (loc, map, 1);
940 subst_constants (&temp, NULL_RTX, map, 1);
941 apply_change_group ();
942 if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0)))
943 temp = change_address (temp, VOIDmode, XEXP (temp, 0));
944 store_expr (arg_trees[i], temp, 0);
948 /* Deal with the places that the function puts its result.
949 We are driven by what is placed into DECL_RESULT.
951 Initially, we assume that we don't have anything special handling for
952 REG_FUNCTION_RETURN_VALUE_P. */
954 map->inline_target = 0;
955 loc = DECL_RTL (DECL_RESULT (fndecl));
957 if (TYPE_MODE (type) == VOIDmode)
958 /* There is no return value to worry about. */
960 else if (GET_CODE (loc) == MEM)
962 if (GET_CODE (XEXP (loc, 0)) == ADDRESSOF)
964 temp = copy_rtx_and_substitute (loc, map, 1);
965 subst_constants (&temp, NULL_RTX, map, 1);
966 apply_change_group ();
971 if (! structure_value_addr
972 || ! aggregate_value_p (DECL_RESULT (fndecl)))
975 /* Pass the function the address in which to return a structure
976 value. Note that a constructor can cause someone to call us
977 with STRUCTURE_VALUE_ADDR, but the initialization takes place
978 via the first parameter, rather than the struct return address.
980 We have two cases: If the address is a simple register
981 indirect, use the mapping mechanism to point that register to
982 our structure return address. Otherwise, store the structure
983 return value into the place that it will be referenced from. */
985 if (GET_CODE (XEXP (loc, 0)) == REG)
987 temp = force_operand (structure_value_addr, NULL_RTX);
988 temp = force_reg (Pmode, temp);
989 /* A virtual register might be invalid in an insn, because
990 it can cause trouble in reload. Since we don't have access
991 to the expanders at map translation time, make sure we have
992 a proper register now.
993 If a virtual register is actually valid, cse or combine
994 can put it into the mapped insns. */
995 if (REGNO (temp) >= FIRST_VIRTUAL_REGISTER
996 && REGNO (temp) <= LAST_VIRTUAL_REGISTER)
997 temp = copy_to_mode_reg (Pmode, temp);
998 map->reg_map[REGNO (XEXP (loc, 0))] = temp;
1000 if (CONSTANT_P (structure_value_addr)
1001 || GET_CODE (structure_value_addr) == ADDRESSOF
1002 || (GET_CODE (structure_value_addr) == PLUS
1003 && (XEXP (structure_value_addr, 0)
1004 == virtual_stack_vars_rtx)
1005 && (GET_CODE (XEXP (structure_value_addr, 1))
1008 SET_CONST_EQUIV_DATA (map, temp, structure_value_addr,
1014 temp = copy_rtx_and_substitute (loc, map, 1);
1015 subst_constants (&temp, NULL_RTX, map, 0);
1016 apply_change_group ();
1017 emit_move_insn (temp, structure_value_addr);
1022 /* We will ignore the result value, so don't look at its structure.
1023 Note that preparations for an aggregate return value
1024 do need to be made (above) even if it will be ignored. */
1026 else if (GET_CODE (loc) == REG)
1028 /* The function returns an object in a register and we use the return
1029 value. Set up our target for remapping. */
1031 /* Machine mode function was declared to return. */
1032 enum machine_mode departing_mode = TYPE_MODE (type);
1033 /* (Possibly wider) machine mode it actually computes
1034 (for the sake of callers that fail to declare it right).
1035 We have to use the mode of the result's RTL, rather than
1036 its type, since expand_function_start may have promoted it. */
1037 enum machine_mode arriving_mode
1038 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl)));
1041 /* Don't use MEMs as direct targets because on some machines
1042 substituting a MEM for a REG makes invalid insns.
1043 Let the combiner substitute the MEM if that is valid. */
1044 if (target == 0 || GET_CODE (target) != REG
1045 || GET_MODE (target) != departing_mode)
1047 /* Don't make BLKmode registers. If this looks like
1048 a BLKmode object being returned in a register, get
1049 the mode from that, otherwise abort. */
1050 if (departing_mode == BLKmode)
1052 if (REG == GET_CODE (DECL_RTL (DECL_RESULT (fndecl))))
1054 departing_mode = GET_MODE (DECL_RTL (DECL_RESULT (fndecl)));
1055 arriving_mode = departing_mode;
1061 target = gen_reg_rtx (departing_mode);
1064 /* If function's value was promoted before return,
1065 avoid machine mode mismatch when we substitute INLINE_TARGET.
1066 But TARGET is what we will return to the caller. */
1067 if (arriving_mode != departing_mode)
1069 /* Avoid creating a paradoxical subreg wider than
1070 BITS_PER_WORD, since that is illegal. */
1071 if (GET_MODE_BITSIZE (arriving_mode) > BITS_PER_WORD)
1073 if (!TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (departing_mode),
1074 GET_MODE_BITSIZE (arriving_mode)))
1075 /* Maybe could be handled by using convert_move () ? */
1077 reg_to_map = gen_reg_rtx (arriving_mode);
1078 target = gen_lowpart (departing_mode, reg_to_map);
1081 reg_to_map = gen_rtx_SUBREG (arriving_mode, target, 0);
1084 reg_to_map = target;
1086 /* Usually, the result value is the machine's return register.
1087 Sometimes it may be a pseudo. Handle both cases. */
1088 if (REG_FUNCTION_VALUE_P (loc))
1089 map->inline_target = reg_to_map;
1091 map->reg_map[REGNO (loc)] = reg_to_map;
1096 /* Initialize label_map. get_label_from_map will actually make
1098 memset ((char *) &map->label_map[min_labelno], 0,
1099 (max_labelno - min_labelno) * sizeof (rtx));
1101 /* Make copies of the decls of the symbols in the inline function, so that
1102 the copies of the variables get declared in the current function. Set
1103 up things so that lookup_static_chain knows that to interpret registers
1104 in SAVE_EXPRs for TYPE_SIZEs as local. */
1105 inline_function_decl = fndecl;
1106 integrate_parm_decls (DECL_ARGUMENTS (fndecl), map, arg_vector);
1107 block = integrate_decl_tree (inl_f->original_decl_initial, map);
1108 BLOCK_ABSTRACT_ORIGIN (block) = DECL_ORIGIN (fndecl);
1109 inline_function_decl = 0;
1111 /* Make a fresh binding contour that we can easily remove. Do this after
1112 expanding our arguments so cleanups are properly scoped. */
1113 expand_start_bindings_and_block (0, block);
1115 /* Sort the block-map so that it will be easy to find remapped
1117 qsort (&VARRAY_TREE (map->block_map, 0),
1118 map->block_map->elements_used,
1122 /* Perform postincrements before actually calling the function. */
1125 /* Clean up stack so that variables might have smaller offsets. */
1126 do_pending_stack_adjust ();
1128 /* Save a copy of the location of const_equiv_varray for
1129 mark_stores, called via note_stores. */
1130 global_const_equiv_varray = map->const_equiv_varray;
1132 /* If the called function does an alloca, save and restore the
1133 stack pointer around the call. This saves stack space, but
1134 also is required if this inline is being done between two
1136 if (inl_f->calls_alloca)
1137 emit_stack_save (SAVE_BLOCK, &stack_save, NULL_RTX);
1139 /* Now copy the insns one by one. */
1140 copy_insn_list (insns, map, static_chain_value);
1142 /* Restore the stack pointer if we saved it above. */
1143 if (inl_f->calls_alloca)
1144 emit_stack_restore (SAVE_BLOCK, stack_save, NULL_RTX);
1146 if (! cfun->x_whole_function_mode_p)
1147 /* In statement-at-a-time mode, we just tell the front-end to add
1148 this block to the list of blocks at this binding level. We
1149 can't do it the way it's done for function-at-a-time mode the
1150 superblocks have not been created yet. */
1151 insert_block (block);
1155 = BLOCK_CHAIN (DECL_INITIAL (current_function_decl));
1156 BLOCK_CHAIN (DECL_INITIAL (current_function_decl)) = block;
1159 /* End the scope containing the copied formal parameter variables
1160 and copied LABEL_DECLs. We pass NULL_TREE for the variables list
1161 here so that expand_end_bindings will not check for unused
1162 variables. That's already been checked for when the inlined
1163 function was defined. */
1164 expand_end_bindings (NULL_TREE, 1, 1);
1166 /* Must mark the line number note after inlined functions as a repeat, so
1167 that the test coverage code can avoid counting the call twice. This
1168 just tells the code to ignore the immediately following line note, since
1169 there already exists a copy of this note before the expanded inline call.
1170 This line number note is still needed for debugging though, so we can't
1172 if (flag_test_coverage)
1173 emit_note (0, NOTE_INSN_REPEATED_LINE_NUMBER);
1175 emit_line_note (input_filename, lineno);
1177 /* If the function returns a BLKmode object in a register, copy it
1178 out of the temp register into a BLKmode memory object. */
1180 && TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl))) == BLKmode
1181 && ! aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl))))
1182 target = copy_blkmode_from_reg (0, target, TREE_TYPE (TREE_TYPE (fndecl)));
1184 if (structure_value_addr)
1186 target = gen_rtx_MEM (TYPE_MODE (type),
1187 memory_address (TYPE_MODE (type),
1188 structure_value_addr));
1189 set_mem_attributes (target, type, 1);
1192 /* Make sure we free the things we explicitly allocated with xmalloc. */
1194 free (real_label_map);
1195 VARRAY_FREE (map->const_equiv_varray);
1196 free (map->reg_map);
1197 VARRAY_FREE (map->block_map);
1198 free (map->insn_map);
1203 inlining = inlining_previous;
1208 /* Make copies of each insn in the given list using the mapping
1209 computed in expand_inline_function. This function may call itself for
1210 insns containing sequences.
1212 Copying is done in two passes, first the insns and then their REG_NOTES.
1214 If static_chain_value is non-zero, it represents the context-pointer
1215 register for the function. */
1218 copy_insn_list (insns, map, static_chain_value)
1220 struct inline_remap *map;
1221 rtx static_chain_value;
1226 rtx local_return_label = NULL_RTX;
1231 /* Copy the insns one by one. Do this in two passes, first the insns and
1232 then their REG_NOTES. */
1234 /* This loop is very similar to the loop in copy_loop_body in unroll.c. */
1236 for (insn = insns; insn; insn = NEXT_INSN (insn))
1238 rtx copy, pattern, set;
1240 map->orig_asm_operands_vector = 0;
1242 switch (GET_CODE (insn))
1245 pattern = PATTERN (insn);
1246 set = single_set (insn);
1248 if (GET_CODE (pattern) == USE
1249 && GET_CODE (XEXP (pattern, 0)) == REG
1250 && REG_FUNCTION_VALUE_P (XEXP (pattern, 0)))
1251 /* The (USE (REG n)) at return from the function should
1252 be ignored since we are changing (REG n) into
1256 /* If the inline fn needs eh context, make sure that
1257 the current fn has one. */
1258 if (GET_CODE (pattern) == USE
1259 && find_reg_note (insn, REG_EH_CONTEXT, 0) != 0)
1262 /* Ignore setting a function value that we don't want to use. */
1263 if (map->inline_target == 0
1265 && GET_CODE (SET_DEST (set)) == REG
1266 && REG_FUNCTION_VALUE_P (SET_DEST (set)))
1268 if (volatile_refs_p (SET_SRC (set)))
1272 /* If we must not delete the source,
1273 load it into a new temporary. */
1274 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1276 new_set = single_set (copy);
1281 = gen_reg_rtx (GET_MODE (SET_DEST (new_set)));
1283 /* If the source and destination are the same and it
1284 has a note on it, keep the insn. */
1285 else if (rtx_equal_p (SET_DEST (set), SET_SRC (set))
1286 && REG_NOTES (insn) != 0)
1287 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1292 /* Similarly if an ignored return value is clobbered. */
1293 else if (map->inline_target == 0
1294 && GET_CODE (pattern) == CLOBBER
1295 && GET_CODE (XEXP (pattern, 0)) == REG
1296 && REG_FUNCTION_VALUE_P (XEXP (pattern, 0)))
1299 /* If this is setting the static chain rtx, omit it. */
1300 else if (static_chain_value != 0
1302 && GET_CODE (SET_DEST (set)) == REG
1303 && rtx_equal_p (SET_DEST (set),
1304 static_chain_incoming_rtx))
1307 /* If this is setting the static chain pseudo, set it from
1308 the value we want to give it instead. */
1309 else if (static_chain_value != 0
1311 && rtx_equal_p (SET_SRC (set),
1312 static_chain_incoming_rtx))
1314 rtx newdest = copy_rtx_and_substitute (SET_DEST (set), map, 1);
1316 copy = emit_move_insn (newdest, static_chain_value);
1317 static_chain_value = 0;
1320 /* If this is setting the virtual stack vars register, this must
1321 be the code at the handler for a builtin longjmp. The value
1322 saved in the setjmp buffer will be the address of the frame
1323 we've made for this inlined instance within our frame. But we
1324 know the offset of that value so we can use it to reconstruct
1325 our virtual stack vars register from that value. If we are
1326 copying it from the stack pointer, leave it unchanged. */
1328 && rtx_equal_p (SET_DEST (set), virtual_stack_vars_rtx))
1330 HOST_WIDE_INT offset;
1331 temp = map->reg_map[REGNO (SET_DEST (set))];
1332 temp = VARRAY_CONST_EQUIV (map->const_equiv_varray,
1335 if (rtx_equal_p (temp, virtual_stack_vars_rtx))
1337 else if (GET_CODE (temp) == PLUS
1338 && rtx_equal_p (XEXP (temp, 0), virtual_stack_vars_rtx)
1339 && GET_CODE (XEXP (temp, 1)) == CONST_INT)
1340 offset = INTVAL (XEXP (temp, 1));
1344 if (rtx_equal_p (SET_SRC (set), stack_pointer_rtx))
1345 temp = SET_SRC (set);
1347 temp = force_operand (plus_constant (SET_SRC (set),
1351 copy = emit_move_insn (virtual_stack_vars_rtx, temp);
1355 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1356 /* REG_NOTES will be copied later. */
1359 /* If this insn is setting CC0, it may need to look at
1360 the insn that uses CC0 to see what type of insn it is.
1361 In that case, the call to recog via validate_change will
1362 fail. So don't substitute constants here. Instead,
1363 do it when we emit the following insn.
1365 For example, see the pyr.md file. That machine has signed and
1366 unsigned compares. The compare patterns must check the
1367 following branch insn to see which what kind of compare to
1370 If the previous insn set CC0, substitute constants on it as
1372 if (sets_cc0_p (PATTERN (copy)) != 0)
1377 try_constants (cc0_insn, map);
1379 try_constants (copy, map);
1382 try_constants (copy, map);
1387 if (GET_CODE (PATTERN (insn)) == RETURN
1388 || (GET_CODE (PATTERN (insn)) == PARALLEL
1389 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == RETURN))
1391 if (local_return_label == 0)
1392 local_return_label = gen_label_rtx ();
1393 pattern = gen_jump (local_return_label);
1396 pattern = copy_rtx_and_substitute (PATTERN (insn), map, 0);
1398 copy = emit_jump_insn (pattern);
1402 try_constants (cc0_insn, map);
1405 try_constants (copy, map);
1407 /* If this used to be a conditional jump insn but whose branch
1408 direction is now know, we must do something special. */
1409 if (any_condjump_p (insn) && onlyjump_p (insn) && map->last_pc_value)
1412 /* If the previous insn set cc0 for us, delete it. */
1413 if (sets_cc0_p (PREV_INSN (copy)))
1414 delete_insn (PREV_INSN (copy));
1417 /* If this is now a no-op, delete it. */
1418 if (map->last_pc_value == pc_rtx)
1424 /* Otherwise, this is unconditional jump so we must put a
1425 BARRIER after it. We could do some dead code elimination
1426 here, but jump.c will do it just as well. */
1432 /* If this is a CALL_PLACEHOLDER insn then we need to copy the
1433 three attached sequences: normal call, sibling call and tail
1435 if (GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
1440 for (i = 0; i < 3; i++)
1444 sequence[i] = NULL_RTX;
1445 seq = XEXP (PATTERN (insn), i);
1449 copy_insn_list (seq, map, static_chain_value);
1450 sequence[i] = get_insns ();
1455 /* Find the new tail recursion label.
1456 It will already be substituted into sequence[2]. */
1457 tail_label = copy_rtx_and_substitute (XEXP (PATTERN (insn), 3),
1460 copy = emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode,
1468 pattern = copy_rtx_and_substitute (PATTERN (insn), map, 0);
1469 copy = emit_call_insn (pattern);
1471 SIBLING_CALL_P (copy) = SIBLING_CALL_P (insn);
1472 CONST_CALL_P (copy) = CONST_CALL_P (insn);
1474 /* Because the USAGE information potentially contains objects other
1475 than hard registers, we need to copy it. */
1477 CALL_INSN_FUNCTION_USAGE (copy)
1478 = copy_rtx_and_substitute (CALL_INSN_FUNCTION_USAGE (insn),
1483 try_constants (cc0_insn, map);
1486 try_constants (copy, map);
1488 /* Be lazy and assume CALL_INSNs clobber all hard registers. */
1489 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1490 VARRAY_CONST_EQUIV (map->const_equiv_varray, i).rtx = 0;
1494 copy = emit_label (get_label_from_map (map,
1495 CODE_LABEL_NUMBER (insn)));
1496 LABEL_NAME (copy) = LABEL_NAME (insn);
1501 copy = emit_barrier ();
1505 /* NOTE_INSN_FUNCTION_END and NOTE_INSN_FUNCTION_BEG are
1506 discarded because it is important to have only one of
1507 each in the current function.
1509 NOTE_INSN_DELETED notes aren't useful.
1511 NOTE_INSN_BASIC_BLOCK is discarded because the saved bb
1512 pointer (which will soon be dangling) confuses flow's
1513 attempts to preserve bb structures during the compilation
1516 if (NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_END
1517 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_BEG
1518 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_DELETED
1519 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_BASIC_BLOCK)
1521 copy = emit_note (NOTE_SOURCE_FILE (insn),
1522 NOTE_LINE_NUMBER (insn));
1524 && (NOTE_LINE_NUMBER (copy) == NOTE_INSN_EH_REGION_BEG
1525 || NOTE_LINE_NUMBER (copy) == NOTE_INSN_EH_REGION_END))
1528 = get_label_from_map (map, NOTE_EH_HANDLER (copy));
1530 /* We have to duplicate the handlers for the original. */
1531 if (NOTE_LINE_NUMBER (copy) == NOTE_INSN_EH_REGION_BEG)
1533 /* We need to duplicate the handlers for the EH region
1534 and we need to indicate where the label map is */
1536 duplicate_eh_handlers (NOTE_EH_HANDLER (copy),
1537 CODE_LABEL_NUMBER (label),
1538 expand_inline_function_eh_labelmap);
1541 /* We have to forward these both to match the new exception
1543 NOTE_EH_HANDLER (copy) = CODE_LABEL_NUMBER (label);
1546 && (NOTE_LINE_NUMBER (copy) == NOTE_INSN_BLOCK_BEG
1547 || NOTE_LINE_NUMBER (copy) == NOTE_INSN_BLOCK_END)
1548 && NOTE_BLOCK (insn))
1550 tree *mapped_block_p;
1553 = (tree *) bsearch (NOTE_BLOCK (insn),
1554 &VARRAY_TREE (map->block_map, 0),
1555 map->block_map->elements_used,
1559 if (!mapped_block_p)
1562 NOTE_BLOCK (copy) = *mapped_block_p;
1574 RTX_INTEGRATED_P (copy) = 1;
1576 map->insn_map[INSN_UID (insn)] = copy;
1579 /* Now copy the REG_NOTES. Increment const_age, so that only constants
1580 from parameters can be substituted in. These are the only ones that
1581 are valid across the entire function. */
1583 for (insn = insns; insn; insn = NEXT_INSN (insn))
1585 && map->insn_map[INSN_UID (insn)]
1586 && REG_NOTES (insn))
1588 rtx next, note = copy_rtx_and_substitute (REG_NOTES (insn), map, 0);
1590 /* We must also do subst_constants, in case one of our parameters
1591 has const type and constant value. */
1592 subst_constants (¬e, NULL_RTX, map, 0);
1593 apply_change_group ();
1594 REG_NOTES (map->insn_map[INSN_UID (insn)]) = note;
1596 /* Finally, delete any REG_LABEL notes from the chain. */
1597 for (; note; note = next)
1599 next = XEXP (note, 1);
1600 if (REG_NOTE_KIND (note) == REG_LABEL)
1601 remove_note (map->insn_map[INSN_UID (insn)], note);
1605 if (local_return_label)
1606 emit_label (local_return_label);
1609 /* Given a chain of PARM_DECLs, ARGS, copy each decl into a VAR_DECL,
1610 push all of those decls and give each one the corresponding home. */
1613 integrate_parm_decls (args, map, arg_vector)
1615 struct inline_remap *map;
1621 for (tail = args, i = 0; tail; tail = TREE_CHAIN (tail), i++)
1623 tree decl = copy_decl_for_inlining (tail, map->fndecl,
1624 current_function_decl);
1626 = copy_rtx_and_substitute (RTVEC_ELT (arg_vector, i), map, 1);
1628 /* We really should be setting DECL_INCOMING_RTL to something reasonable
1629 here, but that's going to require some more work. */
1630 /* DECL_INCOMING_RTL (decl) = ?; */
1631 /* Fully instantiate the address with the equivalent form so that the
1632 debugging information contains the actual register, instead of the
1633 virtual register. Do this by not passing an insn to
1635 subst_constants (&new_decl_rtl, NULL_RTX, map, 1);
1636 apply_change_group ();
1637 DECL_RTL (decl) = new_decl_rtl;
1641 /* Given a BLOCK node LET, push decls and levels so as to construct in the
1642 current function a tree of contexts isomorphic to the one that is given.
1644 MAP, if nonzero, is a pointer to an inline_remap map which indicates how
1645 registers used in the DECL_RTL field should be remapped. If it is zero,
1646 no mapping is necessary. */
1649 integrate_decl_tree (let, map)
1651 struct inline_remap *map;
1657 new_block = make_node (BLOCK);
1658 VARRAY_PUSH_TREE (map->block_map, new_block);
1659 next = &BLOCK_VARS (new_block);
1661 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
1665 d = copy_decl_for_inlining (t, map->fndecl, current_function_decl);
1667 if (DECL_RTL (t) != 0)
1669 DECL_RTL (d) = copy_rtx_and_substitute (DECL_RTL (t), map, 1);
1671 /* Fully instantiate the address with the equivalent form so that the
1672 debugging information contains the actual register, instead of the
1673 virtual register. Do this by not passing an insn to
1675 subst_constants (&DECL_RTL (d), NULL_RTX, map, 1);
1676 apply_change_group ();
1679 /* Add this declaration to the list of variables in the new
1682 next = &TREE_CHAIN (d);
1685 next = &BLOCK_SUBBLOCKS (new_block);
1686 for (t = BLOCK_SUBBLOCKS (let); t; t = BLOCK_CHAIN (t))
1687 if (!BLOCK_DEAD (t))
1689 *next = integrate_decl_tree (t, map);
1690 BLOCK_SUPERCONTEXT (*next) = new_block;
1691 next = &BLOCK_CHAIN (*next);
1694 TREE_USED (new_block) = TREE_USED (let);
1695 BLOCK_ABSTRACT_ORIGIN (new_block) = let;
1700 /* Create a new copy of an rtx. Recursively copies the operands of the rtx,
1701 except for those few rtx codes that are sharable.
1703 We always return an rtx that is similar to that incoming rtx, with the
1704 exception of possibly changing a REG to a SUBREG or vice versa. No
1705 rtl is ever emitted.
1707 If FOR_LHS is nonzero, if means we are processing something that will
1708 be the LHS of a SET. In that case, we copy RTX_UNCHANGING_P even if
1709 inlining since we need to be conservative in how it is set for
1712 Handle constants that need to be placed in the constant pool by
1713 calling `force_const_mem'. */
1716 copy_rtx_and_substitute (orig, map, for_lhs)
1718 struct inline_remap *map;
1721 register rtx copy, temp;
1723 register RTX_CODE code;
1724 register enum machine_mode mode;
1725 register const char *format_ptr;
1731 code = GET_CODE (orig);
1732 mode = GET_MODE (orig);
1737 /* If the stack pointer register shows up, it must be part of
1738 stack-adjustments (*not* because we eliminated the frame pointer!).
1739 Small hard registers are returned as-is. Pseudo-registers
1740 go through their `reg_map'. */
1741 regno = REGNO (orig);
1742 if (regno <= LAST_VIRTUAL_REGISTER
1743 || (map->integrating
1744 && DECL_SAVED_INSNS (map->fndecl)->internal_arg_pointer == orig))
1746 /* Some hard registers are also mapped,
1747 but others are not translated. */
1748 if (map->reg_map[regno] != 0
1749 /* We shouldn't usually have reg_map set for return
1750 register, but it may happen if we have leaf-register
1751 remapping and the return register is used in one of
1752 the calling sequences of a call_placeholer. In this
1753 case, we'll end up with a reg_map set for this
1754 register, but we don't want to use for registers
1755 marked as return values. */
1756 && ! REG_FUNCTION_VALUE_P (orig))
1757 return map->reg_map[regno];
1759 /* If this is the virtual frame pointer, make space in current
1760 function's stack frame for the stack frame of the inline function.
1762 Copy the address of this area into a pseudo. Map
1763 virtual_stack_vars_rtx to this pseudo and set up a constant
1764 equivalence for it to be the address. This will substitute the
1765 address into insns where it can be substituted and use the new
1766 pseudo where it can't. */
1767 else if (regno == VIRTUAL_STACK_VARS_REGNUM)
1770 int size = get_func_frame_size (DECL_SAVED_INSNS (map->fndecl));
1771 #ifdef FRAME_GROWS_DOWNWARD
1773 = (DECL_SAVED_INSNS (map->fndecl)->stack_alignment_needed
1776 /* In this case, virtual_stack_vars_rtx points to one byte
1777 higher than the top of the frame area. So make sure we
1778 allocate a big enough chunk to keep the frame pointer
1779 aligned like a real one. */
1781 size = CEIL_ROUND (size, alignment);
1784 loc = assign_stack_temp (BLKmode, size, 1);
1785 loc = XEXP (loc, 0);
1786 #ifdef FRAME_GROWS_DOWNWARD
1787 /* In this case, virtual_stack_vars_rtx points to one byte
1788 higher than the top of the frame area. So compute the offset
1789 to one byte higher than our substitute frame. */
1790 loc = plus_constant (loc, size);
1792 map->reg_map[regno] = temp
1793 = force_reg (Pmode, force_operand (loc, NULL_RTX));
1795 #ifdef STACK_BOUNDARY
1796 mark_reg_pointer (map->reg_map[regno], STACK_BOUNDARY);
1799 SET_CONST_EQUIV_DATA (map, temp, loc, CONST_AGE_PARM);
1801 seq = gen_sequence ();
1803 emit_insn_after (seq, map->insns_at_start);
1806 else if (regno == VIRTUAL_INCOMING_ARGS_REGNUM
1807 || (map->integrating
1808 && (DECL_SAVED_INSNS (map->fndecl)->internal_arg_pointer
1811 /* Do the same for a block to contain any arguments referenced
1814 int size = DECL_SAVED_INSNS (map->fndecl)->args_size;
1817 loc = assign_stack_temp (BLKmode, size, 1);
1818 loc = XEXP (loc, 0);
1819 /* When arguments grow downward, the virtual incoming
1820 args pointer points to the top of the argument block,
1821 so the remapped location better do the same. */
1822 #ifdef ARGS_GROW_DOWNWARD
1823 loc = plus_constant (loc, size);
1825 map->reg_map[regno] = temp
1826 = force_reg (Pmode, force_operand (loc, NULL_RTX));
1828 #ifdef STACK_BOUNDARY
1829 mark_reg_pointer (map->reg_map[regno], STACK_BOUNDARY);
1832 SET_CONST_EQUIV_DATA (map, temp, loc, CONST_AGE_PARM);
1834 seq = gen_sequence ();
1836 emit_insn_after (seq, map->insns_at_start);
1839 else if (REG_FUNCTION_VALUE_P (orig))
1841 /* This is a reference to the function return value. If
1842 the function doesn't have a return value, error. If the
1843 mode doesn't agree, and it ain't BLKmode, make a SUBREG. */
1844 if (map->inline_target == 0)
1846 if (rtx_equal_function_value_matters)
1847 /* This is an ignored return value. We must not
1848 leave it in with REG_FUNCTION_VALUE_P set, since
1849 that would confuse subsequent inlining of the
1850 current function into a later function. */
1851 return gen_rtx_REG (GET_MODE (orig), regno);
1853 /* Must be unrolling loops or replicating code if we
1854 reach here, so return the register unchanged. */
1857 else if (GET_MODE (map->inline_target) != BLKmode
1858 && mode != GET_MODE (map->inline_target))
1859 return gen_lowpart (mode, map->inline_target);
1861 return map->inline_target;
1863 #if defined (LEAF_REGISTERS) && defined (LEAF_REG_REMAP)
1864 /* If leaf_renumber_regs_insn() might remap this register to
1865 some other number, make sure we don't share it with the
1866 inlined function, otherwise delayed optimization of the
1867 inlined function may change it in place, breaking our
1868 reference to it. We may still shared it within the
1869 function, so create an entry for this register in the
1871 if (map->integrating && regno < FIRST_PSEUDO_REGISTER
1872 && LEAF_REGISTERS[regno] && LEAF_REG_REMAP (regno) != regno)
1874 temp = gen_rtx_REG (mode, regno);
1875 map->reg_map[regno] = temp;
1884 if (map->reg_map[regno] == NULL)
1886 map->reg_map[regno] = gen_reg_rtx (mode);
1887 REG_USERVAR_P (map->reg_map[regno]) = REG_USERVAR_P (orig);
1888 REG_LOOP_TEST_P (map->reg_map[regno]) = REG_LOOP_TEST_P (orig);
1889 RTX_UNCHANGING_P (map->reg_map[regno]) = RTX_UNCHANGING_P (orig);
1890 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
1892 if (REG_POINTER (map->x_regno_reg_rtx[regno]))
1893 mark_reg_pointer (map->reg_map[regno],
1894 map->regno_pointer_align[regno]);
1896 return map->reg_map[regno];
1899 copy = copy_rtx_and_substitute (SUBREG_REG (orig), map, for_lhs);
1900 /* SUBREG is ordinary, but don't make nested SUBREGs. */
1901 if (GET_CODE (copy) == SUBREG)
1902 return gen_rtx_SUBREG (GET_MODE (orig), SUBREG_REG (copy),
1903 SUBREG_WORD (orig) + SUBREG_WORD (copy));
1904 else if (GET_CODE (copy) == CONCAT)
1906 rtx retval = subreg_realpart_p (orig) ? XEXP (copy, 0) : XEXP (copy, 1);
1908 if (GET_MODE (retval) == GET_MODE (orig))
1911 return gen_rtx_SUBREG (GET_MODE (orig), retval,
1912 (SUBREG_WORD (orig) %
1913 (GET_MODE_UNIT_SIZE (GET_MODE (SUBREG_REG (orig)))
1914 / (unsigned) UNITS_PER_WORD)));
1917 return gen_rtx_SUBREG (GET_MODE (orig), copy,
1918 SUBREG_WORD (orig));
1921 copy = gen_rtx_ADDRESSOF (mode,
1922 copy_rtx_and_substitute (XEXP (orig, 0),
1924 0, ADDRESSOF_DECL (orig));
1925 regno = ADDRESSOF_REGNO (orig);
1926 if (map->reg_map[regno])
1927 regno = REGNO (map->reg_map[regno]);
1928 else if (regno > LAST_VIRTUAL_REGISTER)
1930 temp = XEXP (orig, 0);
1931 map->reg_map[regno] = gen_reg_rtx (GET_MODE (temp));
1932 REG_USERVAR_P (map->reg_map[regno]) = REG_USERVAR_P (temp);
1933 REG_LOOP_TEST_P (map->reg_map[regno]) = REG_LOOP_TEST_P (temp);
1934 RTX_UNCHANGING_P (map->reg_map[regno]) = RTX_UNCHANGING_P (temp);
1935 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
1937 if (REG_POINTER (map->x_regno_reg_rtx[regno]))
1938 mark_reg_pointer (map->reg_map[regno],
1939 map->regno_pointer_align[regno]);
1940 regno = REGNO (map->reg_map[regno]);
1942 ADDRESSOF_REGNO (copy) = regno;
1947 /* USE and CLOBBER are ordinary, but we convert (use (subreg foo))
1948 to (use foo) if the original insn didn't have a subreg.
1949 Removing the subreg distorts the VAX movstrhi pattern
1950 by changing the mode of an operand. */
1951 copy = copy_rtx_and_substitute (XEXP (orig, 0), map, code == CLOBBER);
1952 if (GET_CODE (copy) == SUBREG && GET_CODE (XEXP (orig, 0)) != SUBREG)
1953 copy = SUBREG_REG (copy);
1954 return gen_rtx_fmt_e (code, VOIDmode, copy);
1957 LABEL_PRESERVE_P (get_label_from_map (map, CODE_LABEL_NUMBER (orig)))
1958 = LABEL_PRESERVE_P (orig);
1959 return get_label_from_map (map, CODE_LABEL_NUMBER (orig));
1961 /* We need to handle "deleted" labels that appear in the DECL_RTL
1964 if (NOTE_LINE_NUMBER (orig) == NOTE_INSN_DELETED_LABEL)
1965 return map->insn_map[INSN_UID (orig)];
1972 LABEL_REF_NONLOCAL_P (orig) ? XEXP (orig, 0)
1973 : get_label_from_map (map, CODE_LABEL_NUMBER (XEXP (orig, 0))));
1975 LABEL_OUTSIDE_LOOP_P (copy) = LABEL_OUTSIDE_LOOP_P (orig);
1977 /* The fact that this label was previously nonlocal does not mean
1978 it still is, so we must check if it is within the range of
1979 this function's labels. */
1980 LABEL_REF_NONLOCAL_P (copy)
1981 = (LABEL_REF_NONLOCAL_P (orig)
1982 && ! (CODE_LABEL_NUMBER (XEXP (copy, 0)) >= get_first_label_num ()
1983 && CODE_LABEL_NUMBER (XEXP (copy, 0)) < max_label_num ()));
1985 /* If we have made a nonlocal label local, it means that this
1986 inlined call will be referring to our nonlocal goto handler.
1987 So make sure we create one for this block; we normally would
1988 not since this is not otherwise considered a "call". */
1989 if (LABEL_REF_NONLOCAL_P (orig) && ! LABEL_REF_NONLOCAL_P (copy))
1990 function_call_count++;
2000 /* Symbols which represent the address of a label stored in the constant
2001 pool must be modified to point to a constant pool entry for the
2002 remapped label. Otherwise, symbols are returned unchanged. */
2003 if (CONSTANT_POOL_ADDRESS_P (orig))
2005 struct function *f = inlining ? inlining : cfun;
2006 rtx constant = get_pool_constant_for_function (f, orig);
2007 enum machine_mode const_mode = get_pool_mode_for_function (f, orig);
2010 rtx temp = force_const_mem (const_mode,
2011 copy_rtx_and_substitute (constant,
2015 /* Legitimizing the address here is incorrect.
2017 Since we had a SYMBOL_REF before, we can assume it is valid
2018 to have one in this position in the insn.
2020 Also, change_address may create new registers. These
2021 registers will not have valid reg_map entries. This can
2022 cause try_constants() to fail because assumes that all
2023 registers in the rtx have valid reg_map entries, and it may
2024 end up replacing one of these new registers with junk. */
2026 if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0)))
2027 temp = change_address (temp, GET_MODE (temp), XEXP (temp, 0));
2030 temp = XEXP (temp, 0);
2032 #ifdef POINTERS_EXTEND_UNSIGNED
2033 if (GET_MODE (temp) != GET_MODE (orig))
2034 temp = convert_memory_address (GET_MODE (orig), temp);
2038 else if (GET_CODE (constant) == LABEL_REF)
2039 return XEXP (force_const_mem
2041 copy_rtx_and_substitute (constant, map, for_lhs)),
2044 else if (SYMBOL_REF_NEED_ADJUST (orig))
2047 return rethrow_symbol_map (orig,
2048 expand_inline_function_eh_labelmap);
2054 /* We have to make a new copy of this CONST_DOUBLE because don't want
2055 to use the old value of CONST_DOUBLE_MEM. Also, this may be a
2056 duplicate of a CONST_DOUBLE we have already seen. */
2057 if (GET_MODE_CLASS (GET_MODE (orig)) == MODE_FLOAT)
2061 REAL_VALUE_FROM_CONST_DOUBLE (d, orig);
2062 return CONST_DOUBLE_FROM_REAL_VALUE (d, GET_MODE (orig));
2065 return immed_double_const (CONST_DOUBLE_LOW (orig),
2066 CONST_DOUBLE_HIGH (orig), VOIDmode);
2069 /* Make new constant pool entry for a constant
2070 that was in the pool of the inline function. */
2071 if (RTX_INTEGRATED_P (orig))
2076 /* If a single asm insn contains multiple output operands then
2077 it contains multiple ASM_OPERANDS rtx's that share the input
2078 and constraint vecs. We must make sure that the copied insn
2079 continues to share it. */
2080 if (map->orig_asm_operands_vector == ASM_OPERANDS_INPUT_VEC (orig))
2082 copy = rtx_alloc (ASM_OPERANDS);
2083 copy->volatil = orig->volatil;
2084 PUT_MODE (copy, GET_MODE (orig));
2085 ASM_OPERANDS_TEMPLATE (copy) = ASM_OPERANDS_TEMPLATE (orig);
2086 ASM_OPERANDS_OUTPUT_CONSTRAINT (copy)
2087 = ASM_OPERANDS_OUTPUT_CONSTRAINT (orig);
2088 ASM_OPERANDS_OUTPUT_IDX (copy) = ASM_OPERANDS_OUTPUT_IDX (orig);
2089 ASM_OPERANDS_INPUT_VEC (copy) = map->copy_asm_operands_vector;
2090 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy)
2091 = map->copy_asm_constraints_vector;
2092 ASM_OPERANDS_SOURCE_FILE (copy) = ASM_OPERANDS_SOURCE_FILE (orig);
2093 ASM_OPERANDS_SOURCE_LINE (copy) = ASM_OPERANDS_SOURCE_LINE (orig);
2099 /* This is given special treatment because the first
2100 operand of a CALL is a (MEM ...) which may get
2101 forced into a register for cse. This is undesirable
2102 if function-address cse isn't wanted or if we won't do cse. */
2103 #ifndef NO_FUNCTION_CSE
2104 if (! (optimize && ! flag_no_function_cse))
2109 gen_rtx_MEM (GET_MODE (XEXP (orig, 0)),
2110 copy_rtx_and_substitute (XEXP (XEXP (orig, 0), 0),
2112 copy_rtx_and_substitute (XEXP (orig, 1), map, 0));
2116 /* Must be ifdefed out for loop unrolling to work. */
2122 /* If this is setting fp or ap, it means that we have a nonlocal goto.
2123 Adjust the setting by the offset of the area we made.
2124 If the nonlocal goto is into the current function,
2125 this will result in unnecessarily bad code, but should work. */
2126 if (SET_DEST (orig) == virtual_stack_vars_rtx
2127 || SET_DEST (orig) == virtual_incoming_args_rtx)
2129 /* In case a translation hasn't occurred already, make one now. */
2132 HOST_WIDE_INT loc_offset;
2134 copy_rtx_and_substitute (SET_DEST (orig), map, for_lhs);
2135 equiv_reg = map->reg_map[REGNO (SET_DEST (orig))];
2136 equiv_loc = VARRAY_CONST_EQUIV (map->const_equiv_varray,
2137 REGNO (equiv_reg)).rtx;
2139 = GET_CODE (equiv_loc) == REG ? 0 : INTVAL (XEXP (equiv_loc, 1));
2141 return gen_rtx_SET (VOIDmode, SET_DEST (orig),
2144 (copy_rtx_and_substitute (SET_SRC (orig),
2150 return gen_rtx_SET (VOIDmode,
2151 copy_rtx_and_substitute (SET_DEST (orig), map, 1),
2152 copy_rtx_and_substitute (SET_SRC (orig), map, 0));
2157 && GET_CODE (XEXP (orig, 0)) == SYMBOL_REF
2158 && CONSTANT_POOL_ADDRESS_P (XEXP (orig, 0)))
2160 enum machine_mode const_mode
2161 = get_pool_mode_for_function (inlining, XEXP (orig, 0));
2163 = get_pool_constant_for_function (inlining, XEXP (orig, 0));
2165 constant = copy_rtx_and_substitute (constant, map, 0);
2167 /* If this was an address of a constant pool entry that itself
2168 had to be placed in the constant pool, it might not be a
2169 valid address. So the recursive call might have turned it
2170 into a register. In that case, it isn't a constant any
2171 more, so return it. This has the potential of changing a
2172 MEM into a REG, but we'll assume that it safe. */
2173 if (! CONSTANT_P (constant))
2176 return validize_mem (force_const_mem (const_mode, constant));
2179 copy = rtx_alloc (MEM);
2180 PUT_MODE (copy, mode);
2181 XEXP (copy, 0) = copy_rtx_and_substitute (XEXP (orig, 0), map, 0);
2182 MEM_COPY_ATTRIBUTES (copy, orig);
2189 copy = rtx_alloc (code);
2190 PUT_MODE (copy, mode);
2191 copy->in_struct = orig->in_struct;
2192 copy->volatil = orig->volatil;
2193 copy->unchanging = orig->unchanging;
2195 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
2197 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
2199 switch (*format_ptr++)
2202 /* Copy this through the wide int field; that's safest. */
2203 X0WINT (copy, i) = X0WINT (orig, i);
2208 = copy_rtx_and_substitute (XEXP (orig, i), map, for_lhs);
2212 /* Change any references to old-insns to point to the
2213 corresponding copied insns. */
2214 XEXP (copy, i) = map->insn_map[INSN_UID (XEXP (orig, i))];
2218 XVEC (copy, i) = XVEC (orig, i);
2219 if (XVEC (orig, i) != NULL && XVECLEN (orig, i) != 0)
2221 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
2222 for (j = 0; j < XVECLEN (copy, i); j++)
2223 XVECEXP (copy, i, j)
2224 = copy_rtx_and_substitute (XVECEXP (orig, i, j),
2230 XWINT (copy, i) = XWINT (orig, i);
2234 XINT (copy, i) = XINT (orig, i);
2238 XSTR (copy, i) = XSTR (orig, i);
2242 XTREE (copy, i) = XTREE (orig, i);
2250 if (code == ASM_OPERANDS && map->orig_asm_operands_vector == 0)
2252 map->orig_asm_operands_vector = ASM_OPERANDS_INPUT_VEC (orig);
2253 map->copy_asm_operands_vector = ASM_OPERANDS_INPUT_VEC (copy);
2254 map->copy_asm_constraints_vector
2255 = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy);
2261 /* Substitute known constant values into INSN, if that is valid. */
2264 try_constants (insn, map)
2266 struct inline_remap *map;
2272 /* First try just updating addresses, then other things. This is
2273 important when we have something like the store of a constant
2274 into memory and we can update the memory address but the machine
2275 does not support a constant source. */
2276 subst_constants (&PATTERN (insn), insn, map, 1);
2277 apply_change_group ();
2278 subst_constants (&PATTERN (insn), insn, map, 0);
2279 apply_change_group ();
2281 /* Show we don't know the value of anything stored or clobbered. */
2282 note_stores (PATTERN (insn), mark_stores, NULL);
2283 map->last_pc_value = 0;
2285 map->last_cc0_value = 0;
2288 /* Set up any constant equivalences made in this insn. */
2289 for (i = 0; i < map->num_sets; i++)
2291 if (GET_CODE (map->equiv_sets[i].dest) == REG)
2293 int regno = REGNO (map->equiv_sets[i].dest);
2295 MAYBE_EXTEND_CONST_EQUIV_VARRAY (map, regno);
2296 if (VARRAY_CONST_EQUIV (map->const_equiv_varray, regno).rtx == 0
2297 /* Following clause is a hack to make case work where GNU C++
2298 reassigns a variable to make cse work right. */
2299 || ! rtx_equal_p (VARRAY_CONST_EQUIV (map->const_equiv_varray,
2301 map->equiv_sets[i].equiv))
2302 SET_CONST_EQUIV_DATA (map, map->equiv_sets[i].dest,
2303 map->equiv_sets[i].equiv, map->const_age);
2305 else if (map->equiv_sets[i].dest == pc_rtx)
2306 map->last_pc_value = map->equiv_sets[i].equiv;
2308 else if (map->equiv_sets[i].dest == cc0_rtx)
2309 map->last_cc0_value = map->equiv_sets[i].equiv;
2314 /* Substitute known constants for pseudo regs in the contents of LOC,
2315 which are part of INSN.
2316 If INSN is zero, the substitution should always be done (this is used to
2318 These changes are taken out by try_constants if the result is not valid.
2320 Note that we are more concerned with determining when the result of a SET
2321 is a constant, for further propagation, than actually inserting constants
2322 into insns; cse will do the latter task better.
2324 This function is also used to adjust address of items previously addressed
2325 via the virtual stack variable or virtual incoming arguments registers.
2327 If MEMONLY is nonzero, only make changes inside a MEM. */
2330 subst_constants (loc, insn, map, memonly)
2333 struct inline_remap *map;
2338 register enum rtx_code code;
2339 register const char *format_ptr;
2340 int num_changes = num_validated_changes ();
2342 enum machine_mode op0_mode = MAX_MACHINE_MODE;
2344 code = GET_CODE (x);
2360 validate_change (insn, loc, map->last_cc0_value, 1);
2366 /* The only thing we can do with a USE or CLOBBER is possibly do
2367 some substitutions in a MEM within it. */
2368 if (GET_CODE (XEXP (x, 0)) == MEM)
2369 subst_constants (&XEXP (XEXP (x, 0), 0), insn, map, 0);
2373 /* Substitute for parms and known constants. Don't replace
2374 hard regs used as user variables with constants. */
2377 int regno = REGNO (x);
2378 struct const_equiv_data *p;
2380 if (! (regno < FIRST_PSEUDO_REGISTER && REG_USERVAR_P (x))
2381 && (size_t) regno < VARRAY_SIZE (map->const_equiv_varray)
2382 && (p = &VARRAY_CONST_EQUIV (map->const_equiv_varray, regno),
2384 && p->age >= map->const_age)
2385 validate_change (insn, loc, p->rtx, 1);
2390 /* SUBREG applied to something other than a reg
2391 should be treated as ordinary, since that must
2392 be a special hack and we don't know how to treat it specially.
2393 Consider for example mulsidi3 in m68k.md.
2394 Ordinary SUBREG of a REG needs this special treatment. */
2395 if (! memonly && GET_CODE (SUBREG_REG (x)) == REG)
2397 rtx inner = SUBREG_REG (x);
2400 /* We can't call subst_constants on &SUBREG_REG (x) because any
2401 constant or SUBREG wouldn't be valid inside our SUBEG. Instead,
2402 see what is inside, try to form the new SUBREG and see if that is
2403 valid. We handle two cases: extracting a full word in an
2404 integral mode and extracting the low part. */
2405 subst_constants (&inner, NULL_RTX, map, 0);
2407 if (GET_MODE_CLASS (GET_MODE (x)) == MODE_INT
2408 && GET_MODE_SIZE (GET_MODE (x)) == UNITS_PER_WORD
2409 && GET_MODE (SUBREG_REG (x)) != VOIDmode)
2410 new = operand_subword (inner, SUBREG_WORD (x), 0,
2411 GET_MODE (SUBREG_REG (x)));
2413 cancel_changes (num_changes);
2414 if (new == 0 && subreg_lowpart_p (x))
2415 new = gen_lowpart_common (GET_MODE (x), inner);
2418 validate_change (insn, loc, new, 1);
2425 subst_constants (&XEXP (x, 0), insn, map, 0);
2427 /* If a memory address got spoiled, change it back. */
2428 if (! memonly && insn != 0 && num_validated_changes () != num_changes
2429 && ! memory_address_p (GET_MODE (x), XEXP (x, 0)))
2430 cancel_changes (num_changes);
2435 /* Substitute constants in our source, and in any arguments to a
2436 complex (e..g, ZERO_EXTRACT) destination, but not in the destination
2438 rtx *dest_loc = &SET_DEST (x);
2439 rtx dest = *dest_loc;
2441 enum machine_mode compare_mode = VOIDmode;
2443 /* If SET_SRC is a COMPARE which subst_constants would turn into
2444 COMPARE of 2 VOIDmode constants, note the mode in which comparison
2446 if (GET_CODE (SET_SRC (x)) == COMPARE)
2449 if (GET_MODE_CLASS (GET_MODE (src)) == MODE_CC
2455 compare_mode = GET_MODE (XEXP (src, 0));
2456 if (compare_mode == VOIDmode)
2457 compare_mode = GET_MODE (XEXP (src, 1));
2461 subst_constants (&SET_SRC (x), insn, map, memonly);
2464 while (GET_CODE (*dest_loc) == ZERO_EXTRACT
2465 || GET_CODE (*dest_loc) == SUBREG
2466 || GET_CODE (*dest_loc) == STRICT_LOW_PART)
2468 if (GET_CODE (*dest_loc) == ZERO_EXTRACT)
2470 subst_constants (&XEXP (*dest_loc, 1), insn, map, memonly);
2471 subst_constants (&XEXP (*dest_loc, 2), insn, map, memonly);
2473 dest_loc = &XEXP (*dest_loc, 0);
2476 /* Do substitute in the address of a destination in memory. */
2477 if (GET_CODE (*dest_loc) == MEM)
2478 subst_constants (&XEXP (*dest_loc, 0), insn, map, 0);
2480 /* Check for the case of DEST a SUBREG, both it and the underlying
2481 register are less than one word, and the SUBREG has the wider mode.
2482 In the case, we are really setting the underlying register to the
2483 source converted to the mode of DEST. So indicate that. */
2484 if (GET_CODE (dest) == SUBREG
2485 && GET_MODE_SIZE (GET_MODE (dest)) <= UNITS_PER_WORD
2486 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest))) <= UNITS_PER_WORD
2487 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest)))
2488 <= GET_MODE_SIZE (GET_MODE (dest)))
2489 && (tem = gen_lowpart_if_possible (GET_MODE (SUBREG_REG (dest)),
2491 src = tem, dest = SUBREG_REG (dest);
2493 /* If storing a recognizable value save it for later recording. */
2494 if ((map->num_sets < MAX_RECOG_OPERANDS)
2495 && (CONSTANT_P (src)
2496 || (GET_CODE (src) == REG
2497 && (REGNO (src) == VIRTUAL_INCOMING_ARGS_REGNUM
2498 || REGNO (src) == VIRTUAL_STACK_VARS_REGNUM))
2499 || (GET_CODE (src) == PLUS
2500 && GET_CODE (XEXP (src, 0)) == REG
2501 && (REGNO (XEXP (src, 0)) == VIRTUAL_INCOMING_ARGS_REGNUM
2502 || REGNO (XEXP (src, 0)) == VIRTUAL_STACK_VARS_REGNUM)
2503 && CONSTANT_P (XEXP (src, 1)))
2504 || GET_CODE (src) == COMPARE
2509 && (src == pc_rtx || GET_CODE (src) == RETURN
2510 || GET_CODE (src) == LABEL_REF))))
2512 /* Normally, this copy won't do anything. But, if SRC is a COMPARE
2513 it will cause us to save the COMPARE with any constants
2514 substituted, which is what we want for later. */
2515 rtx src_copy = copy_rtx (src);
2516 map->equiv_sets[map->num_sets].equiv = src_copy;
2517 map->equiv_sets[map->num_sets++].dest = dest;
2518 if (compare_mode != VOIDmode
2519 && GET_CODE (src) == COMPARE
2520 && (GET_MODE_CLASS (GET_MODE (src)) == MODE_CC
2525 && GET_MODE (XEXP (src, 0)) == VOIDmode
2526 && GET_MODE (XEXP (src, 1)) == VOIDmode)
2528 map->compare_src = src_copy;
2529 map->compare_mode = compare_mode;
2539 format_ptr = GET_RTX_FORMAT (code);
2541 /* If the first operand is an expression, save its mode for later. */
2542 if (*format_ptr == 'e')
2543 op0_mode = GET_MODE (XEXP (x, 0));
2545 for (i = 0; i < GET_RTX_LENGTH (code); i++)
2547 switch (*format_ptr++)
2554 subst_constants (&XEXP (x, i), insn, map, memonly);
2566 if (XVEC (x, i) != NULL && XVECLEN (x, i) != 0)
2567 for (j = 0; j < XVECLEN (x, i); j++)
2568 subst_constants (&XVECEXP (x, i, j), insn, map, memonly);
2577 /* If this is a commutative operation, move a constant to the second
2578 operand unless the second operand is already a CONST_INT. */
2580 && (GET_RTX_CLASS (code) == 'c' || code == NE || code == EQ)
2581 && CONSTANT_P (XEXP (x, 0)) && GET_CODE (XEXP (x, 1)) != CONST_INT)
2583 rtx tem = XEXP (x, 0);
2584 validate_change (insn, &XEXP (x, 0), XEXP (x, 1), 1);
2585 validate_change (insn, &XEXP (x, 1), tem, 1);
2588 /* Simplify the expression in case we put in some constants. */
2590 switch (GET_RTX_CLASS (code))
2593 if (op0_mode == MAX_MACHINE_MODE)
2595 new = simplify_unary_operation (code, GET_MODE (x),
2596 XEXP (x, 0), op0_mode);
2601 enum machine_mode op_mode = GET_MODE (XEXP (x, 0));
2603 if (op_mode == VOIDmode)
2604 op_mode = GET_MODE (XEXP (x, 1));
2605 new = simplify_relational_operation (code, op_mode,
2606 XEXP (x, 0), XEXP (x, 1));
2607 #ifdef FLOAT_STORE_FLAG_VALUE
2608 if (new != 0 && GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT)
2610 enum machine_mode mode = GET_MODE (x);
2611 if (new == const0_rtx)
2612 new = CONST0_RTX (mode);
2615 REAL_VALUE_TYPE val = FLOAT_STORE_FLAG_VALUE (mode);
2616 new = CONST_DOUBLE_FROM_REAL_VALUE (val, mode);
2625 new = simplify_binary_operation (code, GET_MODE (x),
2626 XEXP (x, 0), XEXP (x, 1));
2631 if (op0_mode == MAX_MACHINE_MODE)
2634 if (code == IF_THEN_ELSE)
2636 rtx op0 = XEXP (x, 0);
2638 if (GET_RTX_CLASS (GET_CODE (op0)) == '<'
2639 && GET_MODE (op0) == VOIDmode
2640 && ! side_effects_p (op0)
2641 && XEXP (op0, 0) == map->compare_src
2642 && GET_MODE (XEXP (op0, 1)) == VOIDmode)
2644 /* We have compare of two VOIDmode constants for which
2645 we recorded the comparison mode. */
2647 simplify_relational_operation (GET_CODE (op0),
2652 if (temp == const0_rtx)
2654 else if (temp == const1_rtx)
2659 new = simplify_ternary_operation (code, GET_MODE (x), op0_mode,
2660 XEXP (x, 0), XEXP (x, 1),
2666 validate_change (insn, loc, new, 1);
2669 /* Show that register modified no longer contain known constants. We are
2670 called from note_stores with parts of the new insn. */
2673 mark_stores (dest, x, data)
2675 rtx x ATTRIBUTE_UNUSED;
2676 void *data ATTRIBUTE_UNUSED;
2679 enum machine_mode mode = VOIDmode;
2681 /* DEST is always the innermost thing set, except in the case of
2682 SUBREGs of hard registers. */
2684 if (GET_CODE (dest) == REG)
2685 regno = REGNO (dest), mode = GET_MODE (dest);
2686 else if (GET_CODE (dest) == SUBREG && GET_CODE (SUBREG_REG (dest)) == REG)
2688 regno = REGNO (SUBREG_REG (dest)) + SUBREG_WORD (dest);
2689 mode = GET_MODE (SUBREG_REG (dest));
2694 unsigned int uregno = regno;
2695 unsigned int last_reg = (uregno >= FIRST_PSEUDO_REGISTER ? uregno
2696 : uregno + HARD_REGNO_NREGS (uregno, mode) - 1);
2699 /* Ignore virtual stack var or virtual arg register since those
2700 are handled separately. */
2701 if (uregno != VIRTUAL_INCOMING_ARGS_REGNUM
2702 && uregno != VIRTUAL_STACK_VARS_REGNUM)
2703 for (i = uregno; i <= last_reg; i++)
2704 if ((size_t) i < VARRAY_SIZE (global_const_equiv_varray))
2705 VARRAY_CONST_EQUIV (global_const_equiv_varray, i).rtx = 0;
2709 /* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the
2710 given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so
2711 that it points to the node itself, thus indicating that the node is its
2712 own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for
2713 the given node is NULL, recursively descend the decl/block tree which
2714 it is the root of, and for each other ..._DECL or BLOCK node contained
2715 therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also
2716 still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN
2717 values to point to themselves. */
2720 set_block_origin_self (stmt)
2723 if (BLOCK_ABSTRACT_ORIGIN (stmt) == NULL_TREE)
2725 BLOCK_ABSTRACT_ORIGIN (stmt) = stmt;
2728 register tree local_decl;
2730 for (local_decl = BLOCK_VARS (stmt);
2731 local_decl != NULL_TREE;
2732 local_decl = TREE_CHAIN (local_decl))
2733 set_decl_origin_self (local_decl); /* Potential recursion. */
2737 register tree subblock;
2739 for (subblock = BLOCK_SUBBLOCKS (stmt);
2740 subblock != NULL_TREE;
2741 subblock = BLOCK_CHAIN (subblock))
2742 set_block_origin_self (subblock); /* Recurse. */
2747 /* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for
2748 the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the
2749 node to so that it points to the node itself, thus indicating that the
2750 node represents its own (abstract) origin. Additionally, if the
2751 DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend
2752 the decl/block tree of which the given node is the root of, and for
2753 each other ..._DECL or BLOCK node contained therein whose
2754 DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL,
2755 set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to
2756 point to themselves. */
2759 set_decl_origin_self (decl)
2762 if (DECL_ABSTRACT_ORIGIN (decl) == NULL_TREE)
2764 DECL_ABSTRACT_ORIGIN (decl) = decl;
2765 if (TREE_CODE (decl) == FUNCTION_DECL)
2769 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2770 DECL_ABSTRACT_ORIGIN (arg) = arg;
2771 if (DECL_INITIAL (decl) != NULL_TREE
2772 && DECL_INITIAL (decl) != error_mark_node)
2773 set_block_origin_self (DECL_INITIAL (decl));
2778 /* Given a pointer to some BLOCK node, and a boolean value to set the
2779 "abstract" flags to, set that value into the BLOCK_ABSTRACT flag for
2780 the given block, and for all local decls and all local sub-blocks
2781 (recursively) which are contained therein. */
2784 set_block_abstract_flags (stmt, setting)
2786 register int setting;
2788 register tree local_decl;
2789 register tree subblock;
2791 BLOCK_ABSTRACT (stmt) = setting;
2793 for (local_decl = BLOCK_VARS (stmt);
2794 local_decl != NULL_TREE;
2795 local_decl = TREE_CHAIN (local_decl))
2796 set_decl_abstract_flags (local_decl, setting);
2798 for (subblock = BLOCK_SUBBLOCKS (stmt);
2799 subblock != NULL_TREE;
2800 subblock = BLOCK_CHAIN (subblock))
2801 set_block_abstract_flags (subblock, setting);
2804 /* Given a pointer to some ..._DECL node, and a boolean value to set the
2805 "abstract" flags to, set that value into the DECL_ABSTRACT flag for the
2806 given decl, and (in the case where the decl is a FUNCTION_DECL) also
2807 set the abstract flags for all of the parameters, local vars, local
2808 blocks and sub-blocks (recursively) to the same setting. */
2811 set_decl_abstract_flags (decl, setting)
2813 register int setting;
2815 DECL_ABSTRACT (decl) = setting;
2816 if (TREE_CODE (decl) == FUNCTION_DECL)
2820 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2821 DECL_ABSTRACT (arg) = setting;
2822 if (DECL_INITIAL (decl) != NULL_TREE
2823 && DECL_INITIAL (decl) != error_mark_node)
2824 set_block_abstract_flags (DECL_INITIAL (decl), setting);
2828 /* Output the assembly language code for the function FNDECL
2829 from its DECL_SAVED_INSNS. Used for inline functions that are output
2830 at end of compilation instead of where they came in the source. */
2833 output_inline_function (fndecl)
2836 struct function *old_cfun = cfun;
2837 enum debug_info_type old_write_symbols = write_symbols;
2838 struct function *f = DECL_SAVED_INSNS (fndecl);
2841 current_function_decl = fndecl;
2842 clear_emit_caches ();
2844 set_new_last_label_num (f->inl_max_label_num);
2846 /* We're not deferring this any longer. */
2847 DECL_DEFER_OUTPUT (fndecl) = 0;
2849 /* If requested, suppress debugging information. */
2850 if (f->no_debugging_symbols)
2851 write_symbols = NO_DEBUG;
2853 /* Do any preparation, such as emitting abstract debug info for the inline
2854 before it gets mangled by optimization. */
2855 note_outlining_of_inline_function (fndecl);
2857 /* Compile this function all the way down to assembly code. */
2858 rest_of_compilation (fndecl);
2860 /* We can't inline this anymore. */
2862 DECL_INLINE (fndecl) = 0;
2865 current_function_decl = old_cfun ? old_cfun->decl : 0;
2866 write_symbols = old_write_symbols;