1 /* Procedure integration for GCC.
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 GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
32 #include "insn-config.h"
36 #include "integrate.h"
48 #define obstack_chunk_alloc xmalloc
49 #define obstack_chunk_free free
51 extern struct obstack *function_maybepermanent_obstack;
53 /* Similar, but round to the next highest integer that meets the
55 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
57 /* Default max number of insns a function can have and still be inline.
58 This is overridden on RISC machines. */
59 #ifndef INTEGRATE_THRESHOLD
60 /* Inlining small functions might save more space then not inlining at
61 all. Assume 1 instruction for the call and 1.5 insns per argument. */
62 #define INTEGRATE_THRESHOLD(DECL) \
64 ? (1 + (3 * list_length (DECL_ARGUMENTS (DECL))) / 2) \
65 : (8 * (8 + list_length (DECL_ARGUMENTS (DECL)))))
69 /* Private type used by {get/has}_func_hard_reg_initial_val. */
70 typedef struct initial_value_pair {
74 typedef struct initial_value_struct {
77 initial_value_pair *entries;
78 } initial_value_struct;
80 static void setup_initial_hard_reg_value_integration PARAMS ((struct function *, struct inline_remap *));
82 static rtvec initialize_for_inline PARAMS ((tree));
83 static void note_modified_parmregs PARAMS ((rtx, rtx, void *));
84 static void integrate_parm_decls PARAMS ((tree, struct inline_remap *,
86 static tree integrate_decl_tree PARAMS ((tree,
87 struct inline_remap *));
88 static void subst_constants PARAMS ((rtx *, rtx,
89 struct inline_remap *, int));
90 static void set_block_origin_self PARAMS ((tree));
91 static void set_block_abstract_flags PARAMS ((tree, int));
92 static void process_reg_param PARAMS ((struct inline_remap *, rtx,
94 void set_decl_abstract_flags PARAMS ((tree, int));
95 static void mark_stores PARAMS ((rtx, rtx, void *));
96 static void save_parm_insns PARAMS ((rtx, rtx));
97 static void copy_insn_list PARAMS ((rtx, struct inline_remap *,
99 static void copy_insn_notes PARAMS ((rtx, struct inline_remap *,
101 static int compare_blocks PARAMS ((const PTR, const PTR));
102 static int find_block PARAMS ((const PTR, const PTR));
104 /* Used by copy_rtx_and_substitute; this indicates whether the function is
105 called for the purpose of inlining or some other purpose (i.e. loop
106 unrolling). This affects how constant pool references are handled.
107 This variable contains the FUNCTION_DECL for the inlined function. */
108 static struct function *inlining = 0;
110 /* Returns the Ith entry in the label_map contained in MAP. If the
111 Ith entry has not yet been set, return a fresh label. This function
112 performs a lazy initialization of label_map, thereby avoiding huge memory
113 explosions when the label_map gets very large. */
116 get_label_from_map (map, i)
117 struct inline_remap *map;
120 rtx x = map->label_map[i];
123 x = map->label_map[i] = gen_label_rtx ();
128 /* Return false if the function FNDECL cannot be inlined on account of its
129 attributes, true otherwise. */
131 function_attribute_inlinable_p (fndecl)
134 bool has_machine_attr = false;
137 for (a = DECL_ATTRIBUTES (fndecl); a; a = TREE_CHAIN (a))
139 tree name = TREE_PURPOSE (a);
142 for (i = 0; targetm.attribute_table[i].name != NULL; i++)
144 if (is_attribute_p (targetm.attribute_table[i].name, name))
146 has_machine_attr = true;
150 if (has_machine_attr)
154 if (has_machine_attr)
155 return (*targetm.function_attribute_inlinable_p) (fndecl);
160 /* Zero if the current function (whose FUNCTION_DECL is FNDECL)
161 is safe and reasonable to integrate into other functions.
162 Nonzero means value is a warning msgid with a single %s
163 for the function's name. */
166 function_cannot_inline_p (fndecl)
170 tree last = tree_last (TYPE_ARG_TYPES (TREE_TYPE (fndecl)));
172 /* For functions marked as inline increase the maximum size to
173 MAX_INLINE_INSNS (-finline-limit-<n>). For regular functions
174 use the limit given by INTEGRATE_THRESHOLD. */
176 int max_insns = (DECL_INLINE (fndecl))
178 + 8 * list_length (DECL_ARGUMENTS (fndecl)))
179 : INTEGRATE_THRESHOLD (fndecl);
184 if (DECL_UNINLINABLE (fndecl))
185 return N_("function cannot be inline");
187 /* No inlines with varargs. */
188 if ((last && TREE_VALUE (last) != void_type_node)
189 || current_function_varargs)
190 return N_("varargs function cannot be inline");
192 if (current_function_calls_alloca)
193 return N_("function using alloca cannot be inline");
195 if (current_function_calls_setjmp)
196 return N_("function using setjmp cannot be inline");
198 if (current_function_calls_eh_return)
199 return N_("function uses __builtin_eh_return");
201 if (current_function_contains_functions)
202 return N_("function with nested functions cannot be inline");
206 N_("function with label addresses used in initializers cannot inline");
208 if (current_function_cannot_inline)
209 return current_function_cannot_inline;
211 /* If its not even close, don't even look. */
212 if (get_max_uid () > 3 * max_insns)
213 return N_("function too large to be inline");
216 /* Don't inline functions which do not specify a function prototype and
217 have BLKmode argument or take the address of a parameter. */
218 for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms))
220 if (TYPE_MODE (TREE_TYPE (parms)) == BLKmode)
221 TREE_ADDRESSABLE (parms) = 1;
222 if (last == NULL_TREE && TREE_ADDRESSABLE (parms))
223 return N_("no prototype, and parameter address used; cannot be inline");
227 /* We can't inline functions that return structures
228 the old-fashioned PCC way, copying into a static block. */
229 if (current_function_returns_pcc_struct)
230 return N_("inline functions not supported for this return value type");
232 /* We can't inline functions that return structures of varying size. */
233 if (TREE_CODE (TREE_TYPE (TREE_TYPE (fndecl))) != VOID_TYPE
234 && int_size_in_bytes (TREE_TYPE (TREE_TYPE (fndecl))) < 0)
235 return N_("function with varying-size return value cannot be inline");
237 /* Cannot inline a function with a varying size argument or one that
238 receives a transparent union. */
239 for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms))
241 if (int_size_in_bytes (TREE_TYPE (parms)) < 0)
242 return N_("function with varying-size parameter cannot be inline");
243 else if (TREE_CODE (TREE_TYPE (parms)) == UNION_TYPE
244 && TYPE_TRANSPARENT_UNION (TREE_TYPE (parms)))
245 return N_("function with transparent unit parameter cannot be inline");
248 if (get_max_uid () > max_insns)
250 for (ninsns = 0, insn = get_first_nonparm_insn ();
251 insn && ninsns < max_insns;
252 insn = NEXT_INSN (insn))
256 if (ninsns >= max_insns)
257 return N_("function too large to be inline");
260 /* We will not inline a function which uses computed goto. The addresses of
261 its local labels, which may be tucked into global storage, are of course
262 not constant across instantiations, which causes unexpected behaviour. */
263 if (current_function_has_computed_jump)
264 return N_("function with computed jump cannot inline");
266 /* We cannot inline a nested function that jumps to a nonlocal label. */
267 if (current_function_has_nonlocal_goto)
268 return N_("function with nonlocal goto cannot be inline");
270 /* We can't inline functions that return a PARALLEL rtx. */
271 if (DECL_RTL_SET_P (DECL_RESULT (fndecl)))
273 rtx result = DECL_RTL (DECL_RESULT (fndecl));
274 if (GET_CODE (result) == PARALLEL)
275 return N_("inline functions not supported for this return value type");
278 /* If the function has a target specific attribute attached to it,
279 then we assume that we should not inline it. This can be overriden
280 by the target if it defines TARGET_FUNCTION_ATTRIBUTE_INLINABLE_P. */
281 if (!function_attribute_inlinable_p (fndecl))
282 return N_("function with target specific attribute(s) cannot be inlined");
287 /* Map pseudo reg number into the PARM_DECL for the parm living in the reg.
288 Zero for a reg that isn't a parm's home.
289 Only reg numbers less than max_parm_reg are mapped here. */
290 static tree *parmdecl_map;
292 /* In save_for_inline, nonzero if past the parm-initialization insns. */
293 static int in_nonparm_insns;
295 /* Subroutine for `save_for_inline'. Performs initialization
296 needed to save FNDECL's insns and info for future inline expansion. */
299 initialize_for_inline (fndecl)
306 /* Clear out PARMDECL_MAP. It was allocated in the caller's frame. */
307 memset ((char *) parmdecl_map, 0, max_parm_reg * sizeof (tree));
308 arg_vector = rtvec_alloc (list_length (DECL_ARGUMENTS (fndecl)));
310 for (parms = DECL_ARGUMENTS (fndecl), i = 0;
312 parms = TREE_CHAIN (parms), i++)
314 rtx p = DECL_RTL (parms);
316 /* If we have (mem (addressof (mem ...))), use the inner MEM since
317 otherwise the copy_rtx call below will not unshare the MEM since
318 it shares ADDRESSOF. */
319 if (GET_CODE (p) == MEM && GET_CODE (XEXP (p, 0)) == ADDRESSOF
320 && GET_CODE (XEXP (XEXP (p, 0), 0)) == MEM)
321 p = XEXP (XEXP (p, 0), 0);
323 RTVEC_ELT (arg_vector, i) = p;
325 if (GET_CODE (p) == REG)
326 parmdecl_map[REGNO (p)] = parms;
327 else if (GET_CODE (p) == CONCAT)
329 rtx preal = gen_realpart (GET_MODE (XEXP (p, 0)), p);
330 rtx pimag = gen_imagpart (GET_MODE (preal), p);
332 if (GET_CODE (preal) == REG)
333 parmdecl_map[REGNO (preal)] = parms;
334 if (GET_CODE (pimag) == REG)
335 parmdecl_map[REGNO (pimag)] = parms;
338 /* This flag is cleared later
339 if the function ever modifies the value of the parm. */
340 TREE_READONLY (parms) = 1;
346 /* Copy NODE (which must be a DECL, but not a PARM_DECL). The DECL
347 originally was in the FROM_FN, but now it will be in the
351 copy_decl_for_inlining (decl, from_fn, to_fn)
358 /* Copy the declaration. */
359 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
361 /* For a parameter, we must make an equivalent VAR_DECL, not a
363 copy = build_decl (VAR_DECL, DECL_NAME (decl), TREE_TYPE (decl));
364 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
365 TREE_READONLY (copy) = TREE_READONLY (decl);
366 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
370 copy = copy_node (decl);
371 if (DECL_LANG_SPECIFIC (copy))
372 copy_lang_decl (copy);
374 /* TREE_ADDRESSABLE isn't used to indicate that a label's
375 address has been taken; it's for internal bookkeeping in
376 expand_goto_internal. */
377 if (TREE_CODE (copy) == LABEL_DECL)
378 TREE_ADDRESSABLE (copy) = 0;
381 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
382 declaration inspired this copy. */
383 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
385 /* The new variable/label has no RTL, yet. */
386 SET_DECL_RTL (copy, NULL_RTX);
388 /* These args would always appear unused, if not for this. */
389 TREE_USED (copy) = 1;
391 /* Set the context for the new declaration. */
392 if (!DECL_CONTEXT (decl))
393 /* Globals stay global. */
395 else if (DECL_CONTEXT (decl) != from_fn)
396 /* Things that weren't in the scope of the function we're inlining
397 from aren't in the scope we're inlining too, either. */
399 else if (TREE_STATIC (decl))
400 /* Function-scoped static variables should say in the original
404 /* Ordinary automatic local variables are now in the scope of the
406 DECL_CONTEXT (copy) = to_fn;
411 /* Make the insns and PARM_DECLs of the current function permanent
412 and record other information in DECL_SAVED_INSNS to allow inlining
413 of this function in subsequent calls.
415 This routine need not copy any insns because we are not going
416 to immediately compile the insns in the insn chain. There
417 are two cases when we would compile the insns for FNDECL:
418 (1) when FNDECL is expanded inline, and (2) when FNDECL needs to
419 be output at the end of other compilation, because somebody took
420 its address. In the first case, the insns of FNDECL are copied
421 as it is expanded inline, so FNDECL's saved insns are not
422 modified. In the second case, FNDECL is used for the last time,
423 so modifying the rtl is not a problem.
425 We don't have to worry about FNDECL being inline expanded by
426 other functions which are written at the end of compilation
427 because flag_no_inline is turned on when we begin writing
428 functions at the end of compilation. */
431 save_for_inline (fndecl)
436 rtx first_nonparm_insn;
438 /* Set up PARMDECL_MAP which maps pseudo-reg number to its PARM_DECL.
439 Later we set TREE_READONLY to 0 if the parm is modified inside the fn.
440 Also set up ARG_VECTOR, which holds the unmodified DECL_RTX values
441 for the parms, prior to elimination of virtual registers.
442 These values are needed for substituting parms properly. */
443 if (! flag_no_inline)
444 parmdecl_map = (tree *) xmalloc (max_parm_reg * sizeof (tree));
446 /* Make and emit a return-label if we have not already done so. */
448 if (return_label == 0)
450 return_label = gen_label_rtx ();
451 emit_label (return_label);
454 if (! flag_no_inline)
455 argvec = initialize_for_inline (fndecl);
459 /* Delete basic block notes created by early run of find_basic_block.
460 The notes would be later used by find_basic_blocks to reuse the memory
461 for basic_block structures on already freed obstack. */
462 for (insn = get_insns (); insn ; insn = NEXT_INSN (insn))
463 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) == NOTE_INSN_BASIC_BLOCK)
464 delete_related_insns (insn);
466 /* If there are insns that copy parms from the stack into pseudo registers,
467 those insns are not copied. `expand_inline_function' must
468 emit the correct code to handle such things. */
471 if (GET_CODE (insn) != NOTE)
474 if (! flag_no_inline)
476 /* Get the insn which signals the end of parameter setup code. */
477 first_nonparm_insn = get_first_nonparm_insn ();
479 /* Now just scan the chain of insns to see what happens to our
480 PARM_DECLs. If a PARM_DECL is used but never modified, we
481 can substitute its rtl directly when expanding inline (and
482 perform constant folding when its incoming value is
483 constant). Otherwise, we have to copy its value into a new
484 register and track the new register's life. */
485 in_nonparm_insns = 0;
486 save_parm_insns (insn, first_nonparm_insn);
488 cfun->inl_max_label_num = max_label_num ();
489 cfun->inl_last_parm_insn = cfun->x_last_parm_insn;
490 cfun->original_arg_vector = argvec;
492 cfun->original_decl_initial = DECL_INITIAL (fndecl);
493 cfun->no_debugging_symbols = (write_symbols == NO_DEBUG);
494 DECL_SAVED_INSNS (fndecl) = cfun;
497 if (! flag_no_inline)
501 /* Scan the chain of insns to see what happens to our PARM_DECLs. If a
502 PARM_DECL is used but never modified, we can substitute its rtl directly
503 when expanding inline (and perform constant folding when its incoming
504 value is constant). Otherwise, we have to copy its value into a new
505 register and track the new register's life. */
508 save_parm_insns (insn, first_nonparm_insn)
510 rtx first_nonparm_insn;
512 if (insn == NULL_RTX)
515 for (insn = NEXT_INSN (insn); insn; insn = NEXT_INSN (insn))
517 if (insn == first_nonparm_insn)
518 in_nonparm_insns = 1;
522 /* Record what interesting things happen to our parameters. */
523 note_stores (PATTERN (insn), note_modified_parmregs, NULL);
525 /* If this is a CALL_PLACEHOLDER insn then we need to look into the
526 three attached sequences: normal call, sibling call and tail
528 if (GET_CODE (insn) == CALL_INSN
529 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
533 for (i = 0; i < 3; i++)
534 save_parm_insns (XEXP (PATTERN (insn), i),
541 /* Note whether a parameter is modified or not. */
544 note_modified_parmregs (reg, x, data)
546 rtx x ATTRIBUTE_UNUSED;
547 void *data ATTRIBUTE_UNUSED;
549 if (GET_CODE (reg) == REG && in_nonparm_insns
550 && REGNO (reg) < max_parm_reg
551 && REGNO (reg) >= FIRST_PSEUDO_REGISTER
552 && parmdecl_map[REGNO (reg)] != 0)
553 TREE_READONLY (parmdecl_map[REGNO (reg)]) = 0;
556 /* Unfortunately, we need a global copy of const_equiv map for communication
557 with a function called from note_stores. Be *very* careful that this
558 is used properly in the presence of recursion. */
560 varray_type global_const_equiv_varray;
562 #define FIXED_BASE_PLUS_P(X) \
563 (GET_CODE (X) == PLUS && GET_CODE (XEXP (X, 1)) == CONST_INT \
564 && GET_CODE (XEXP (X, 0)) == REG \
565 && REGNO (XEXP (X, 0)) >= FIRST_VIRTUAL_REGISTER \
566 && REGNO (XEXP (X, 0)) <= LAST_VIRTUAL_REGISTER)
568 /* Called to set up a mapping for the case where a parameter is in a
569 register. If it is read-only and our argument is a constant, set up the
570 constant equivalence.
572 If LOC is REG_USERVAR_P, the usual case, COPY must also have that flag set
575 Also, don't allow hard registers here; they might not be valid when
576 substituted into insns. */
578 process_reg_param (map, loc, copy)
579 struct inline_remap *map;
582 if ((GET_CODE (copy) != REG && GET_CODE (copy) != SUBREG)
583 || (GET_CODE (copy) == REG && REG_USERVAR_P (loc)
584 && ! REG_USERVAR_P (copy))
585 || (GET_CODE (copy) == REG
586 && REGNO (copy) < FIRST_PSEUDO_REGISTER))
588 rtx temp = copy_to_mode_reg (GET_MODE (loc), copy);
589 REG_USERVAR_P (temp) = REG_USERVAR_P (loc);
590 if (CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy))
591 SET_CONST_EQUIV_DATA (map, temp, copy, CONST_AGE_PARM);
594 map->reg_map[REGNO (loc)] = copy;
597 /* Compare two BLOCKs for qsort. The key we sort on is the
598 BLOCK_ABSTRACT_ORIGIN of the blocks. */
601 compare_blocks (v1, v2)
605 tree b1 = *((const tree *) v1);
606 tree b2 = *((const tree *) v2);
608 return ((char *) BLOCK_ABSTRACT_ORIGIN (b1)
609 - (char *) BLOCK_ABSTRACT_ORIGIN (b2));
612 /* Compare two BLOCKs for bsearch. The first pointer corresponds to
613 an original block; the second to a remapped equivalent. */
620 const union tree_node *b1 = (const union tree_node *) v1;
621 tree b2 = *((const tree *) v2);
623 return ((const char *) b1 - (char *) BLOCK_ABSTRACT_ORIGIN (b2));
626 /* Integrate the procedure defined by FNDECL. Note that this function
627 may wind up calling itself. Since the static variables are not
628 reentrant, we do not assign them until after the possibility
629 of recursion is eliminated.
631 If IGNORE is nonzero, do not produce a value.
632 Otherwise store the value in TARGET if it is nonzero and that is convenient.
635 (rtx)-1 if we could not substitute the function
636 0 if we substituted it and it does not produce a value
637 else an rtx for where the value is stored. */
640 expand_inline_function (fndecl, parms, target, ignore, type,
641 structure_value_addr)
646 rtx structure_value_addr;
648 struct function *inlining_previous;
649 struct function *inl_f = DECL_SAVED_INSNS (fndecl);
650 tree formal, actual, block;
651 rtx parm_insns = inl_f->emit->x_first_insn;
652 rtx insns = (inl_f->inl_last_parm_insn
653 ? NEXT_INSN (inl_f->inl_last_parm_insn)
659 int min_labelno = inl_f->emit->x_first_label_num;
660 int max_labelno = inl_f->inl_max_label_num;
665 struct inline_remap *map = 0;
669 rtvec arg_vector = (rtvec) inl_f->original_arg_vector;
670 rtx static_chain_value = 0;
672 int eh_region_offset;
674 /* The pointer used to track the true location of the memory used
675 for MAP->LABEL_MAP. */
676 rtx *real_label_map = 0;
678 /* Allow for equivalences of the pseudos we make for virtual fp and ap. */
679 max_regno = inl_f->emit->x_reg_rtx_no + 3;
680 if (max_regno < FIRST_PSEUDO_REGISTER)
683 /* Pull out the decl for the function definition; fndecl may be a
684 local declaration, which would break DECL_ABSTRACT_ORIGIN. */
685 fndecl = inl_f->decl;
687 nargs = list_length (DECL_ARGUMENTS (fndecl));
689 if (cfun->preferred_stack_boundary < inl_f->preferred_stack_boundary)
690 cfun->preferred_stack_boundary = inl_f->preferred_stack_boundary;
692 /* Check that the parms type match and that sufficient arguments were
693 passed. Since the appropriate conversions or default promotions have
694 already been applied, the machine modes should match exactly. */
696 for (formal = DECL_ARGUMENTS (fndecl), actual = parms;
698 formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual))
701 enum machine_mode mode;
704 return (rtx) (HOST_WIDE_INT) -1;
706 arg = TREE_VALUE (actual);
707 mode = TYPE_MODE (DECL_ARG_TYPE (formal));
709 if (arg == error_mark_node
710 || mode != TYPE_MODE (TREE_TYPE (arg))
711 /* If they are block mode, the types should match exactly.
712 They don't match exactly if TREE_TYPE (FORMAL) == ERROR_MARK_NODE,
713 which could happen if the parameter has incomplete type. */
715 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg))
716 != TYPE_MAIN_VARIANT (TREE_TYPE (formal)))))
717 return (rtx) (HOST_WIDE_INT) -1;
720 /* Extra arguments are valid, but will be ignored below, so we must
721 evaluate them here for side-effects. */
722 for (; actual; actual = TREE_CHAIN (actual))
723 expand_expr (TREE_VALUE (actual), const0_rtx,
724 TYPE_MODE (TREE_TYPE (TREE_VALUE (actual))), 0);
726 /* Expand the function arguments. Do this first so that any
727 new registers get created before we allocate the maps. */
729 arg_vals = (rtx *) xmalloc (nargs * sizeof (rtx));
730 arg_trees = (tree *) xmalloc (nargs * sizeof (tree));
732 for (formal = DECL_ARGUMENTS (fndecl), actual = parms, i = 0;
734 formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual), i++)
736 /* Actual parameter, converted to the type of the argument within the
738 tree arg = convert (TREE_TYPE (formal), TREE_VALUE (actual));
739 /* Mode of the variable used within the function. */
740 enum machine_mode mode = TYPE_MODE (TREE_TYPE (formal));
744 loc = RTVEC_ELT (arg_vector, i);
746 /* If this is an object passed by invisible reference, we copy the
747 object into a stack slot and save its address. If this will go
748 into memory, we do nothing now. Otherwise, we just expand the
750 if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG
751 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)
753 rtx stack_slot = assign_temp (TREE_TYPE (arg), 1, 1, 1);
755 store_expr (arg, stack_slot, 0);
756 arg_vals[i] = XEXP (stack_slot, 0);
759 else if (GET_CODE (loc) != MEM)
761 if (GET_MODE (loc) != TYPE_MODE (TREE_TYPE (arg)))
763 int unsignedp = TREE_UNSIGNED (TREE_TYPE (formal));
764 enum machine_mode pmode = TYPE_MODE (TREE_TYPE (formal));
766 pmode = promote_mode (TREE_TYPE (formal), pmode,
769 if (GET_MODE (loc) != pmode)
772 /* The mode if LOC and ARG can differ if LOC was a variable
773 that had its mode promoted via PROMOTED_MODE. */
774 arg_vals[i] = convert_modes (pmode,
775 TYPE_MODE (TREE_TYPE (arg)),
776 expand_expr (arg, NULL_RTX, mode,
781 arg_vals[i] = expand_expr (arg, NULL_RTX, mode, EXPAND_SUM);
787 && (! TREE_READONLY (formal)
788 /* If the parameter is not read-only, copy our argument through
789 a register. Also, we cannot use ARG_VALS[I] if it overlaps
790 TARGET in any way. In the inline function, they will likely
791 be two different pseudos, and `safe_from_p' will make all
792 sorts of smart assumptions about their not conflicting.
793 But if ARG_VALS[I] overlaps TARGET, these assumptions are
794 wrong, so put ARG_VALS[I] into a fresh register.
795 Don't worry about invisible references, since their stack
796 temps will never overlap the target. */
799 && (GET_CODE (arg_vals[i]) == REG
800 || GET_CODE (arg_vals[i]) == SUBREG
801 || GET_CODE (arg_vals[i]) == MEM)
802 && reg_overlap_mentioned_p (arg_vals[i], target))
803 /* ??? We must always copy a SUBREG into a REG, because it might
804 get substituted into an address, and not all ports correctly
805 handle SUBREGs in addresses. */
806 || (GET_CODE (arg_vals[i]) == SUBREG)))
807 arg_vals[i] = copy_to_mode_reg (GET_MODE (loc), arg_vals[i]);
809 if (arg_vals[i] != 0 && GET_CODE (arg_vals[i]) == REG
810 && POINTER_TYPE_P (TREE_TYPE (formal)))
811 mark_reg_pointer (arg_vals[i],
812 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (formal))));
815 /* Allocate the structures we use to remap things. */
817 map = (struct inline_remap *) xcalloc (1, sizeof (struct inline_remap));
818 map->fndecl = fndecl;
820 VARRAY_TREE_INIT (map->block_map, 10, "block_map");
821 map->reg_map = (rtx *) xcalloc (max_regno, sizeof (rtx));
823 /* We used to use alloca here, but the size of what it would try to
824 allocate would occasionally cause it to exceed the stack limit and
825 cause unpredictable core dumps. */
827 = (rtx *) xmalloc ((max_labelno) * sizeof (rtx));
828 map->label_map = real_label_map;
829 map->local_return_label = NULL_RTX;
831 inl_max_uid = (inl_f->emit->x_cur_insn_uid + 1);
832 map->insn_map = (rtx *) xcalloc (inl_max_uid, sizeof (rtx));
834 map->max_insnno = inl_max_uid;
836 map->integrating = 1;
837 map->compare_src = NULL_RTX;
838 map->compare_mode = VOIDmode;
840 /* const_equiv_varray maps pseudos in our routine to constants, so
841 it needs to be large enough for all our pseudos. This is the
842 number we are currently using plus the number in the called
843 routine, plus 15 for each arg, five to compute the virtual frame
844 pointer, and five for the return value. This should be enough
845 for most cases. We do not reference entries outside the range of
848 ??? These numbers are quite arbitrary and were obtained by
849 experimentation. At some point, we should try to allocate the
850 table after all the parameters are set up so we an more accurately
851 estimate the number of pseudos we will need. */
853 VARRAY_CONST_EQUIV_INIT (map->const_equiv_varray,
855 + (max_regno - FIRST_PSEUDO_REGISTER)
858 "expand_inline_function");
861 /* Record the current insn in case we have to set up pointers to frame
862 and argument memory blocks. If there are no insns yet, add a dummy
863 insn that can be used as an insertion point. */
864 map->insns_at_start = get_last_insn ();
865 if (map->insns_at_start == 0)
866 map->insns_at_start = emit_note (NULL, NOTE_INSN_DELETED);
868 map->regno_pointer_align = inl_f->emit->regno_pointer_align;
869 map->x_regno_reg_rtx = inl_f->emit->x_regno_reg_rtx;
871 /* Update the outgoing argument size to allow for those in the inlined
873 if (inl_f->outgoing_args_size > current_function_outgoing_args_size)
874 current_function_outgoing_args_size = inl_f->outgoing_args_size;
876 /* If the inline function needs to make PIC references, that means
877 that this function's PIC offset table must be used. */
878 if (inl_f->uses_pic_offset_table)
879 current_function_uses_pic_offset_table = 1;
881 /* If this function needs a context, set it up. */
882 if (inl_f->needs_context)
883 static_chain_value = lookup_static_chain (fndecl);
885 if (GET_CODE (parm_insns) == NOTE
886 && NOTE_LINE_NUMBER (parm_insns) > 0)
888 rtx note = emit_note (NOTE_SOURCE_FILE (parm_insns),
889 NOTE_LINE_NUMBER (parm_insns));
891 RTX_INTEGRATED_P (note) = 1;
894 /* Process each argument. For each, set up things so that the function's
895 reference to the argument will refer to the argument being passed.
896 We only replace REG with REG here. Any simplifications are done
899 We make two passes: In the first, we deal with parameters that will
900 be placed into registers, since we need to ensure that the allocated
901 register number fits in const_equiv_map. Then we store all non-register
902 parameters into their memory location. */
904 /* Don't try to free temp stack slots here, because we may put one of the
905 parameters into a temp stack slot. */
907 for (i = 0; i < nargs; i++)
909 rtx copy = arg_vals[i];
911 loc = RTVEC_ELT (arg_vector, i);
913 /* There are three cases, each handled separately. */
914 if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG
915 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)
917 /* This must be an object passed by invisible reference (it could
918 also be a variable-sized object, but we forbid inlining functions
919 with variable-sized arguments). COPY is the address of the
920 actual value (this computation will cause it to be copied). We
921 map that address for the register, noting the actual address as
922 an equivalent in case it can be substituted into the insns. */
924 if (GET_CODE (copy) != REG)
926 temp = copy_addr_to_reg (copy);
927 if (CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy))
928 SET_CONST_EQUIV_DATA (map, temp, copy, CONST_AGE_PARM);
931 map->reg_map[REGNO (XEXP (loc, 0))] = copy;
933 else if (GET_CODE (loc) == MEM)
935 /* This is the case of a parameter that lives in memory. It
936 will live in the block we allocate in the called routine's
937 frame that simulates the incoming argument area. Do nothing
938 with the parameter now; we will call store_expr later. In
939 this case, however, we must ensure that the virtual stack and
940 incoming arg rtx values are expanded now so that we can be
941 sure we have enough slots in the const equiv map since the
942 store_expr call can easily blow the size estimate. */
943 if (DECL_SAVED_INSNS (fndecl)->args_size != 0)
944 copy_rtx_and_substitute (virtual_incoming_args_rtx, map, 0);
946 else if (GET_CODE (loc) == REG)
947 process_reg_param (map, loc, copy);
948 else if (GET_CODE (loc) == CONCAT)
950 rtx locreal = gen_realpart (GET_MODE (XEXP (loc, 0)), loc);
951 rtx locimag = gen_imagpart (GET_MODE (XEXP (loc, 0)), loc);
952 rtx copyreal = gen_realpart (GET_MODE (locreal), copy);
953 rtx copyimag = gen_imagpart (GET_MODE (locimag), copy);
955 process_reg_param (map, locreal, copyreal);
956 process_reg_param (map, locimag, copyimag);
962 /* Tell copy_rtx_and_substitute to handle constant pool SYMBOL_REFs
963 specially. This function can be called recursively, so we need to
964 save the previous value. */
965 inlining_previous = inlining;
968 /* Now do the parameters that will be placed in memory. */
970 for (formal = DECL_ARGUMENTS (fndecl), i = 0;
971 formal; formal = TREE_CHAIN (formal), i++)
973 loc = RTVEC_ELT (arg_vector, i);
975 if (GET_CODE (loc) == MEM
976 /* Exclude case handled above. */
977 && ! (GET_CODE (XEXP (loc, 0)) == REG
978 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER))
980 rtx note = emit_note (DECL_SOURCE_FILE (formal),
981 DECL_SOURCE_LINE (formal));
983 RTX_INTEGRATED_P (note) = 1;
985 /* Compute the address in the area we reserved and store the
987 temp = copy_rtx_and_substitute (loc, map, 1);
988 subst_constants (&temp, NULL_RTX, map, 1);
989 apply_change_group ();
990 if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0)))
991 temp = change_address (temp, VOIDmode, XEXP (temp, 0));
992 store_expr (arg_trees[i], temp, 0);
996 /* Deal with the places that the function puts its result.
997 We are driven by what is placed into DECL_RESULT.
999 Initially, we assume that we don't have anything special handling for
1000 REG_FUNCTION_RETURN_VALUE_P. */
1002 map->inline_target = 0;
1003 loc = (DECL_RTL_SET_P (DECL_RESULT (fndecl))
1004 ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX);
1006 if (TYPE_MODE (type) == VOIDmode)
1007 /* There is no return value to worry about. */
1009 else if (GET_CODE (loc) == MEM)
1011 if (GET_CODE (XEXP (loc, 0)) == ADDRESSOF)
1013 temp = copy_rtx_and_substitute (loc, map, 1);
1014 subst_constants (&temp, NULL_RTX, map, 1);
1015 apply_change_group ();
1020 if (! structure_value_addr
1021 || ! aggregate_value_p (DECL_RESULT (fndecl)))
1024 /* Pass the function the address in which to return a structure
1025 value. Note that a constructor can cause someone to call us
1026 with STRUCTURE_VALUE_ADDR, but the initialization takes place
1027 via the first parameter, rather than the struct return address.
1029 We have two cases: If the address is a simple register
1030 indirect, use the mapping mechanism to point that register to
1031 our structure return address. Otherwise, store the structure
1032 return value into the place that it will be referenced from. */
1034 if (GET_CODE (XEXP (loc, 0)) == REG)
1036 temp = force_operand (structure_value_addr, NULL_RTX);
1037 temp = force_reg (Pmode, temp);
1038 /* A virtual register might be invalid in an insn, because
1039 it can cause trouble in reload. Since we don't have access
1040 to the expanders at map translation time, make sure we have
1041 a proper register now.
1042 If a virtual register is actually valid, cse or combine
1043 can put it into the mapped insns. */
1044 if (REGNO (temp) >= FIRST_VIRTUAL_REGISTER
1045 && REGNO (temp) <= LAST_VIRTUAL_REGISTER)
1046 temp = copy_to_mode_reg (Pmode, temp);
1047 map->reg_map[REGNO (XEXP (loc, 0))] = temp;
1049 if (CONSTANT_P (structure_value_addr)
1050 || GET_CODE (structure_value_addr) == ADDRESSOF
1051 || (GET_CODE (structure_value_addr) == PLUS
1052 && (XEXP (structure_value_addr, 0)
1053 == virtual_stack_vars_rtx)
1054 && (GET_CODE (XEXP (structure_value_addr, 1))
1057 SET_CONST_EQUIV_DATA (map, temp, structure_value_addr,
1063 temp = copy_rtx_and_substitute (loc, map, 1);
1064 subst_constants (&temp, NULL_RTX, map, 0);
1065 apply_change_group ();
1066 emit_move_insn (temp, structure_value_addr);
1071 /* We will ignore the result value, so don't look at its structure.
1072 Note that preparations for an aggregate return value
1073 do need to be made (above) even if it will be ignored. */
1075 else if (GET_CODE (loc) == REG)
1077 /* The function returns an object in a register and we use the return
1078 value. Set up our target for remapping. */
1080 /* Machine mode function was declared to return. */
1081 enum machine_mode departing_mode = TYPE_MODE (type);
1082 /* (Possibly wider) machine mode it actually computes
1083 (for the sake of callers that fail to declare it right).
1084 We have to use the mode of the result's RTL, rather than
1085 its type, since expand_function_start may have promoted it. */
1086 enum machine_mode arriving_mode
1087 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl)));
1090 /* Don't use MEMs as direct targets because on some machines
1091 substituting a MEM for a REG makes invalid insns.
1092 Let the combiner substitute the MEM if that is valid. */
1093 if (target == 0 || GET_CODE (target) != REG
1094 || GET_MODE (target) != departing_mode)
1096 /* Don't make BLKmode registers. If this looks like
1097 a BLKmode object being returned in a register, get
1098 the mode from that, otherwise abort. */
1099 if (departing_mode == BLKmode)
1101 if (REG == GET_CODE (DECL_RTL (DECL_RESULT (fndecl))))
1103 departing_mode = GET_MODE (DECL_RTL (DECL_RESULT (fndecl)));
1104 arriving_mode = departing_mode;
1110 target = gen_reg_rtx (departing_mode);
1113 /* If function's value was promoted before return,
1114 avoid machine mode mismatch when we substitute INLINE_TARGET.
1115 But TARGET is what we will return to the caller. */
1116 if (arriving_mode != departing_mode)
1118 /* Avoid creating a paradoxical subreg wider than
1119 BITS_PER_WORD, since that is illegal. */
1120 if (GET_MODE_BITSIZE (arriving_mode) > BITS_PER_WORD)
1122 if (!TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (departing_mode),
1123 GET_MODE_BITSIZE (arriving_mode)))
1124 /* Maybe could be handled by using convert_move () ? */
1126 reg_to_map = gen_reg_rtx (arriving_mode);
1127 target = gen_lowpart (departing_mode, reg_to_map);
1130 reg_to_map = gen_rtx_SUBREG (arriving_mode, target, 0);
1133 reg_to_map = target;
1135 /* Usually, the result value is the machine's return register.
1136 Sometimes it may be a pseudo. Handle both cases. */
1137 if (REG_FUNCTION_VALUE_P (loc))
1138 map->inline_target = reg_to_map;
1140 map->reg_map[REGNO (loc)] = reg_to_map;
1142 else if (GET_CODE (loc) == CONCAT)
1144 enum machine_mode departing_mode = TYPE_MODE (type);
1145 enum machine_mode arriving_mode
1146 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl)));
1148 if (departing_mode != arriving_mode)
1150 if (GET_CODE (XEXP (loc, 0)) != REG
1151 || GET_CODE (XEXP (loc, 1)) != REG)
1154 /* Don't use MEMs as direct targets because on some machines
1155 substituting a MEM for a REG makes invalid insns.
1156 Let the combiner substitute the MEM if that is valid. */
1157 if (target == 0 || GET_CODE (target) != REG
1158 || GET_MODE (target) != departing_mode)
1159 target = gen_reg_rtx (departing_mode);
1161 if (GET_CODE (target) != CONCAT)
1164 map->reg_map[REGNO (XEXP (loc, 0))] = XEXP (target, 0);
1165 map->reg_map[REGNO (XEXP (loc, 1))] = XEXP (target, 1);
1170 /* Remap the exception handler data pointer from one to the other. */
1171 temp = get_exception_pointer (inl_f);
1173 map->reg_map[REGNO (temp)] = get_exception_pointer (cfun);
1175 /* Initialize label_map. get_label_from_map will actually make
1177 memset ((char *) &map->label_map[min_labelno], 0,
1178 (max_labelno - min_labelno) * sizeof (rtx));
1180 /* Make copies of the decls of the symbols in the inline function, so that
1181 the copies of the variables get declared in the current function. Set
1182 up things so that lookup_static_chain knows that to interpret registers
1183 in SAVE_EXPRs for TYPE_SIZEs as local. */
1184 inline_function_decl = fndecl;
1185 integrate_parm_decls (DECL_ARGUMENTS (fndecl), map, arg_vector);
1186 block = integrate_decl_tree (inl_f->original_decl_initial, map);
1187 BLOCK_ABSTRACT_ORIGIN (block) = DECL_ORIGIN (fndecl);
1188 inline_function_decl = 0;
1190 /* Make a fresh binding contour that we can easily remove. Do this after
1191 expanding our arguments so cleanups are properly scoped. */
1192 expand_start_bindings_and_block (0, block);
1194 /* Sort the block-map so that it will be easy to find remapped
1196 qsort (&VARRAY_TREE (map->block_map, 0),
1197 map->block_map->elements_used,
1201 /* Perform postincrements before actually calling the function. */
1204 /* Clean up stack so that variables might have smaller offsets. */
1205 do_pending_stack_adjust ();
1207 /* Save a copy of the location of const_equiv_varray for
1208 mark_stores, called via note_stores. */
1209 global_const_equiv_varray = map->const_equiv_varray;
1211 /* If the called function does an alloca, save and restore the
1212 stack pointer around the call. This saves stack space, but
1213 also is required if this inline is being done between two
1215 if (inl_f->calls_alloca)
1216 emit_stack_save (SAVE_BLOCK, &stack_save, NULL_RTX);
1218 /* Map pseudos used for initial hard reg values. */
1219 setup_initial_hard_reg_value_integration (inl_f, map);
1221 /* Now copy the insns one by one. */
1222 copy_insn_list (insns, map, static_chain_value);
1224 /* Duplicate the EH regions. This will create an offset from the
1225 region numbers in the function we're inlining to the region
1226 numbers in the calling function. This must wait until after
1227 copy_insn_list, as we need the insn map to be complete. */
1228 eh_region_offset = duplicate_eh_regions (inl_f, map);
1230 /* Now copy the REG_NOTES for those insns. */
1231 copy_insn_notes (insns, map, eh_region_offset);
1233 /* If the insn sequence required one, emit the return label. */
1234 if (map->local_return_label)
1235 emit_label (map->local_return_label);
1237 /* Restore the stack pointer if we saved it above. */
1238 if (inl_f->calls_alloca)
1239 emit_stack_restore (SAVE_BLOCK, stack_save, NULL_RTX);
1241 if (! cfun->x_whole_function_mode_p)
1242 /* In statement-at-a-time mode, we just tell the front-end to add
1243 this block to the list of blocks at this binding level. We
1244 can't do it the way it's done for function-at-a-time mode the
1245 superblocks have not been created yet. */
1246 insert_block (block);
1250 = BLOCK_CHAIN (DECL_INITIAL (current_function_decl));
1251 BLOCK_CHAIN (DECL_INITIAL (current_function_decl)) = block;
1254 /* End the scope containing the copied formal parameter variables
1255 and copied LABEL_DECLs. We pass NULL_TREE for the variables list
1256 here so that expand_end_bindings will not check for unused
1257 variables. That's already been checked for when the inlined
1258 function was defined. */
1259 expand_end_bindings (NULL_TREE, 1, 1);
1261 /* Must mark the line number note after inlined functions as a repeat, so
1262 that the test coverage code can avoid counting the call twice. This
1263 just tells the code to ignore the immediately following line note, since
1264 there already exists a copy of this note before the expanded inline call.
1265 This line number note is still needed for debugging though, so we can't
1267 if (flag_test_coverage)
1268 emit_note (0, NOTE_INSN_REPEATED_LINE_NUMBER);
1270 emit_line_note (input_filename, lineno);
1272 /* If the function returns a BLKmode object in a register, copy it
1273 out of the temp register into a BLKmode memory object. */
1275 && TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl))) == BLKmode
1276 && ! aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl))))
1277 target = copy_blkmode_from_reg (0, target, TREE_TYPE (TREE_TYPE (fndecl)));
1279 if (structure_value_addr)
1281 target = gen_rtx_MEM (TYPE_MODE (type),
1282 memory_address (TYPE_MODE (type),
1283 structure_value_addr));
1284 set_mem_attributes (target, type, 1);
1287 /* Make sure we free the things we explicitly allocated with xmalloc. */
1289 free (real_label_map);
1290 VARRAY_FREE (map->const_equiv_varray);
1291 free (map->reg_map);
1292 VARRAY_FREE (map->block_map);
1293 free (map->insn_map);
1298 inlining = inlining_previous;
1303 /* Make copies of each insn in the given list using the mapping
1304 computed in expand_inline_function. This function may call itself for
1305 insns containing sequences.
1307 Copying is done in two passes, first the insns and then their REG_NOTES.
1309 If static_chain_value is non-zero, it represents the context-pointer
1310 register for the function. */
1313 copy_insn_list (insns, map, static_chain_value)
1315 struct inline_remap *map;
1316 rtx static_chain_value;
1325 /* Copy the insns one by one. Do this in two passes, first the insns and
1326 then their REG_NOTES. */
1328 /* This loop is very similar to the loop in copy_loop_body in unroll.c. */
1330 for (insn = insns; insn; insn = NEXT_INSN (insn))
1332 rtx copy, pattern, set;
1334 map->orig_asm_operands_vector = 0;
1336 switch (GET_CODE (insn))
1339 pattern = PATTERN (insn);
1340 set = single_set (insn);
1342 if (GET_CODE (pattern) == USE
1343 && GET_CODE (XEXP (pattern, 0)) == REG
1344 && REG_FUNCTION_VALUE_P (XEXP (pattern, 0)))
1345 /* The (USE (REG n)) at return from the function should
1346 be ignored since we are changing (REG n) into
1350 /* Ignore setting a function value that we don't want to use. */
1351 if (map->inline_target == 0
1353 && GET_CODE (SET_DEST (set)) == REG
1354 && REG_FUNCTION_VALUE_P (SET_DEST (set)))
1356 if (volatile_refs_p (SET_SRC (set)))
1360 /* If we must not delete the source,
1361 load it into a new temporary. */
1362 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1364 new_set = single_set (copy);
1369 = gen_reg_rtx (GET_MODE (SET_DEST (new_set)));
1371 /* If the source and destination are the same and it
1372 has a note on it, keep the insn. */
1373 else if (rtx_equal_p (SET_DEST (set), SET_SRC (set))
1374 && REG_NOTES (insn) != 0)
1375 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1380 /* Similarly if an ignored return value is clobbered. */
1381 else if (map->inline_target == 0
1382 && GET_CODE (pattern) == CLOBBER
1383 && GET_CODE (XEXP (pattern, 0)) == REG
1384 && REG_FUNCTION_VALUE_P (XEXP (pattern, 0)))
1387 /* If this is setting the static chain rtx, omit it. */
1388 else if (static_chain_value != 0
1390 && GET_CODE (SET_DEST (set)) == REG
1391 && rtx_equal_p (SET_DEST (set),
1392 static_chain_incoming_rtx))
1395 /* If this is setting the static chain pseudo, set it from
1396 the value we want to give it instead. */
1397 else if (static_chain_value != 0
1399 && rtx_equal_p (SET_SRC (set),
1400 static_chain_incoming_rtx))
1402 rtx newdest = copy_rtx_and_substitute (SET_DEST (set), map, 1);
1404 copy = emit_move_insn (newdest, static_chain_value);
1405 static_chain_value = 0;
1408 /* If this is setting the virtual stack vars register, this must
1409 be the code at the handler for a builtin longjmp. The value
1410 saved in the setjmp buffer will be the address of the frame
1411 we've made for this inlined instance within our frame. But we
1412 know the offset of that value so we can use it to reconstruct
1413 our virtual stack vars register from that value. If we are
1414 copying it from the stack pointer, leave it unchanged. */
1416 && rtx_equal_p (SET_DEST (set), virtual_stack_vars_rtx))
1418 HOST_WIDE_INT offset;
1419 temp = map->reg_map[REGNO (SET_DEST (set))];
1420 temp = VARRAY_CONST_EQUIV (map->const_equiv_varray,
1423 if (rtx_equal_p (temp, virtual_stack_vars_rtx))
1425 else if (GET_CODE (temp) == PLUS
1426 && rtx_equal_p (XEXP (temp, 0), virtual_stack_vars_rtx)
1427 && GET_CODE (XEXP (temp, 1)) == CONST_INT)
1428 offset = INTVAL (XEXP (temp, 1));
1432 if (rtx_equal_p (SET_SRC (set), stack_pointer_rtx))
1433 temp = SET_SRC (set);
1435 temp = force_operand (plus_constant (SET_SRC (set),
1439 copy = emit_move_insn (virtual_stack_vars_rtx, temp);
1443 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1444 /* REG_NOTES will be copied later. */
1447 /* If this insn is setting CC0, it may need to look at
1448 the insn that uses CC0 to see what type of insn it is.
1449 In that case, the call to recog via validate_change will
1450 fail. So don't substitute constants here. Instead,
1451 do it when we emit the following insn.
1453 For example, see the pyr.md file. That machine has signed and
1454 unsigned compares. The compare patterns must check the
1455 following branch insn to see which what kind of compare to
1458 If the previous insn set CC0, substitute constants on it as
1460 if (sets_cc0_p (PATTERN (copy)) != 0)
1465 try_constants (cc0_insn, map);
1467 try_constants (copy, map);
1470 try_constants (copy, map);
1475 if (map->integrating && returnjump_p (insn))
1477 if (map->local_return_label == 0)
1478 map->local_return_label = gen_label_rtx ();
1479 pattern = gen_jump (map->local_return_label);
1482 pattern = copy_rtx_and_substitute (PATTERN (insn), map, 0);
1484 copy = emit_jump_insn (pattern);
1488 try_constants (cc0_insn, map);
1491 try_constants (copy, map);
1493 /* If this used to be a conditional jump insn but whose branch
1494 direction is now know, we must do something special. */
1495 if (any_condjump_p (insn) && onlyjump_p (insn) && map->last_pc_value)
1498 /* If the previous insn set cc0 for us, delete it. */
1499 if (only_sets_cc0_p (PREV_INSN (copy)))
1500 delete_related_insns (PREV_INSN (copy));
1503 /* If this is now a no-op, delete it. */
1504 if (map->last_pc_value == pc_rtx)
1506 delete_related_insns (copy);
1510 /* Otherwise, this is unconditional jump so we must put a
1511 BARRIER after it. We could do some dead code elimination
1512 here, but jump.c will do it just as well. */
1518 /* If this is a CALL_PLACEHOLDER insn then we need to copy the
1519 three attached sequences: normal call, sibling call and tail
1521 if (GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
1526 for (i = 0; i < 3; i++)
1530 sequence[i] = NULL_RTX;
1531 seq = XEXP (PATTERN (insn), i);
1535 copy_insn_list (seq, map, static_chain_value);
1536 sequence[i] = get_insns ();
1541 /* Find the new tail recursion label.
1542 It will already be substituted into sequence[2]. */
1543 tail_label = copy_rtx_and_substitute (XEXP (PATTERN (insn), 3),
1546 copy = emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode,
1554 pattern = copy_rtx_and_substitute (PATTERN (insn), map, 0);
1555 copy = emit_call_insn (pattern);
1557 SIBLING_CALL_P (copy) = SIBLING_CALL_P (insn);
1558 CONST_OR_PURE_CALL_P (copy) = CONST_OR_PURE_CALL_P (insn);
1560 /* Because the USAGE information potentially contains objects other
1561 than hard registers, we need to copy it. */
1563 CALL_INSN_FUNCTION_USAGE (copy)
1564 = copy_rtx_and_substitute (CALL_INSN_FUNCTION_USAGE (insn),
1569 try_constants (cc0_insn, map);
1572 try_constants (copy, map);
1574 /* Be lazy and assume CALL_INSNs clobber all hard registers. */
1575 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1576 VARRAY_CONST_EQUIV (map->const_equiv_varray, i).rtx = 0;
1580 copy = emit_label (get_label_from_map (map,
1581 CODE_LABEL_NUMBER (insn)));
1582 LABEL_NAME (copy) = LABEL_NAME (insn);
1587 copy = emit_barrier ();
1591 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL)
1593 copy = emit_label (get_label_from_map (map,
1594 CODE_LABEL_NUMBER (insn)));
1595 LABEL_NAME (copy) = NOTE_SOURCE_FILE (insn);
1600 /* NOTE_INSN_FUNCTION_END and NOTE_INSN_FUNCTION_BEG are
1601 discarded because it is important to have only one of
1602 each in the current function.
1604 NOTE_INSN_DELETED notes aren't useful. */
1606 if (NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_END
1607 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_BEG
1608 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_DELETED)
1610 copy = emit_note (NOTE_SOURCE_FILE (insn),
1611 NOTE_LINE_NUMBER (insn));
1613 && (NOTE_LINE_NUMBER (copy) == NOTE_INSN_BLOCK_BEG
1614 || NOTE_LINE_NUMBER (copy) == NOTE_INSN_BLOCK_END)
1615 && NOTE_BLOCK (insn))
1617 tree *mapped_block_p;
1620 = (tree *) bsearch (NOTE_BLOCK (insn),
1621 &VARRAY_TREE (map->block_map, 0),
1622 map->block_map->elements_used,
1626 if (!mapped_block_p)
1629 NOTE_BLOCK (copy) = *mapped_block_p;
1632 && NOTE_LINE_NUMBER (copy) == NOTE_INSN_EXPECTED_VALUE)
1633 NOTE_EXPECTED_VALUE (copy)
1634 = copy_rtx_and_substitute (NOTE_EXPECTED_VALUE (insn),
1646 RTX_INTEGRATED_P (copy) = 1;
1648 map->insn_map[INSN_UID (insn)] = copy;
1652 /* Copy the REG_NOTES. Increment const_age, so that only constants
1653 from parameters can be substituted in. These are the only ones
1654 that are valid across the entire function. */
1657 copy_insn_notes (insns, map, eh_region_offset)
1659 struct inline_remap *map;
1660 int eh_region_offset;
1665 for (insn = insns; insn; insn = NEXT_INSN (insn))
1667 if (! INSN_P (insn))
1670 new_insn = map->insn_map[INSN_UID (insn)];
1674 if (REG_NOTES (insn))
1676 rtx next, note = copy_rtx_and_substitute (REG_NOTES (insn), map, 0);
1678 /* We must also do subst_constants, in case one of our parameters
1679 has const type and constant value. */
1680 subst_constants (¬e, NULL_RTX, map, 0);
1681 apply_change_group ();
1682 REG_NOTES (new_insn) = note;
1684 /* Delete any REG_LABEL notes from the chain. Remap any
1685 REG_EH_REGION notes. */
1686 for (; note; note = next)
1688 next = XEXP (note, 1);
1689 if (REG_NOTE_KIND (note) == REG_LABEL)
1690 remove_note (new_insn, note);
1691 else if (REG_NOTE_KIND (note) == REG_EH_REGION)
1692 XEXP (note, 0) = GEN_INT (INTVAL (XEXP (note, 0))
1693 + eh_region_offset);
1697 if (GET_CODE (insn) == CALL_INSN
1698 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
1701 for (i = 0; i < 3; i++)
1702 copy_insn_notes (XEXP (PATTERN (insn), i), map, eh_region_offset);
1705 if (GET_CODE (insn) == JUMP_INSN
1706 && GET_CODE (PATTERN (insn)) == RESX)
1707 XINT (PATTERN (new_insn), 0) += eh_region_offset;
1711 /* Given a chain of PARM_DECLs, ARGS, copy each decl into a VAR_DECL,
1712 push all of those decls and give each one the corresponding home. */
1715 integrate_parm_decls (args, map, arg_vector)
1717 struct inline_remap *map;
1723 for (tail = args, i = 0; tail; tail = TREE_CHAIN (tail), i++)
1725 tree decl = copy_decl_for_inlining (tail, map->fndecl,
1726 current_function_decl);
1728 = copy_rtx_and_substitute (RTVEC_ELT (arg_vector, i), map, 1);
1730 /* We really should be setting DECL_INCOMING_RTL to something reasonable
1731 here, but that's going to require some more work. */
1732 /* DECL_INCOMING_RTL (decl) = ?; */
1733 /* Fully instantiate the address with the equivalent form so that the
1734 debugging information contains the actual register, instead of the
1735 virtual register. Do this by not passing an insn to
1737 subst_constants (&new_decl_rtl, NULL_RTX, map, 1);
1738 apply_change_group ();
1739 SET_DECL_RTL (decl, new_decl_rtl);
1743 /* Given a BLOCK node LET, push decls and levels so as to construct in the
1744 current function a tree of contexts isomorphic to the one that is given.
1746 MAP, if nonzero, is a pointer to an inline_remap map which indicates how
1747 registers used in the DECL_RTL field should be remapped. If it is zero,
1748 no mapping is necessary. */
1751 integrate_decl_tree (let, map)
1753 struct inline_remap *map;
1759 new_block = make_node (BLOCK);
1760 VARRAY_PUSH_TREE (map->block_map, new_block);
1761 next = &BLOCK_VARS (new_block);
1763 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
1767 d = copy_decl_for_inlining (t, map->fndecl, current_function_decl);
1769 if (DECL_RTL_SET_P (t))
1773 SET_DECL_RTL (d, copy_rtx_and_substitute (DECL_RTL (t), map, 1));
1775 /* Fully instantiate the address with the equivalent form so that the
1776 debugging information contains the actual register, instead of the
1777 virtual register. Do this by not passing an insn to
1780 subst_constants (&r, NULL_RTX, map, 1);
1781 SET_DECL_RTL (d, r);
1783 if (GET_CODE (r) == REG)
1784 REGNO_DECL (REGNO (r)) = d;
1785 else if (GET_CODE (r) == CONCAT)
1787 REGNO_DECL (REGNO (XEXP (r, 0))) = d;
1788 REGNO_DECL (REGNO (XEPX (r, 1))) = d;
1791 apply_change_group ();
1794 /* Add this declaration to the list of variables in the new
1797 next = &TREE_CHAIN (d);
1800 next = &BLOCK_SUBBLOCKS (new_block);
1801 for (t = BLOCK_SUBBLOCKS (let); t; t = BLOCK_CHAIN (t))
1803 *next = integrate_decl_tree (t, map);
1804 BLOCK_SUPERCONTEXT (*next) = new_block;
1805 next = &BLOCK_CHAIN (*next);
1808 TREE_USED (new_block) = TREE_USED (let);
1809 BLOCK_ABSTRACT_ORIGIN (new_block) = let;
1814 /* Create a new copy of an rtx. Recursively copies the operands of the rtx,
1815 except for those few rtx codes that are sharable.
1817 We always return an rtx that is similar to that incoming rtx, with the
1818 exception of possibly changing a REG to a SUBREG or vice versa. No
1819 rtl is ever emitted.
1821 If FOR_LHS is nonzero, if means we are processing something that will
1822 be the LHS of a SET. In that case, we copy RTX_UNCHANGING_P even if
1823 inlining since we need to be conservative in how it is set for
1826 Handle constants that need to be placed in the constant pool by
1827 calling `force_const_mem'. */
1830 copy_rtx_and_substitute (orig, map, for_lhs)
1832 struct inline_remap *map;
1838 enum machine_mode mode;
1839 const char *format_ptr;
1845 code = GET_CODE (orig);
1846 mode = GET_MODE (orig);
1851 /* If the stack pointer register shows up, it must be part of
1852 stack-adjustments (*not* because we eliminated the frame pointer!).
1853 Small hard registers are returned as-is. Pseudo-registers
1854 go through their `reg_map'. */
1855 regno = REGNO (orig);
1856 if (regno <= LAST_VIRTUAL_REGISTER
1857 || (map->integrating
1858 && DECL_SAVED_INSNS (map->fndecl)->internal_arg_pointer == orig))
1860 /* Some hard registers are also mapped,
1861 but others are not translated. */
1862 if (map->reg_map[regno] != 0)
1863 return map->reg_map[regno];
1865 /* If this is the virtual frame pointer, make space in current
1866 function's stack frame for the stack frame of the inline function.
1868 Copy the address of this area into a pseudo. Map
1869 virtual_stack_vars_rtx to this pseudo and set up a constant
1870 equivalence for it to be the address. This will substitute the
1871 address into insns where it can be substituted and use the new
1872 pseudo where it can't. */
1873 else if (regno == VIRTUAL_STACK_VARS_REGNUM)
1876 int size = get_func_frame_size (DECL_SAVED_INSNS (map->fndecl));
1877 #ifdef FRAME_GROWS_DOWNWARD
1879 = (DECL_SAVED_INSNS (map->fndecl)->stack_alignment_needed
1882 /* In this case, virtual_stack_vars_rtx points to one byte
1883 higher than the top of the frame area. So make sure we
1884 allocate a big enough chunk to keep the frame pointer
1885 aligned like a real one. */
1887 size = CEIL_ROUND (size, alignment);
1890 loc = assign_stack_temp (BLKmode, size, 1);
1891 loc = XEXP (loc, 0);
1892 #ifdef FRAME_GROWS_DOWNWARD
1893 /* In this case, virtual_stack_vars_rtx points to one byte
1894 higher than the top of the frame area. So compute the offset
1895 to one byte higher than our substitute frame. */
1896 loc = plus_constant (loc, size);
1898 map->reg_map[regno] = temp
1899 = force_reg (Pmode, force_operand (loc, NULL_RTX));
1901 #ifdef STACK_BOUNDARY
1902 mark_reg_pointer (map->reg_map[regno], STACK_BOUNDARY);
1905 SET_CONST_EQUIV_DATA (map, temp, loc, CONST_AGE_PARM);
1907 seq = gen_sequence ();
1909 emit_insn_after (seq, map->insns_at_start);
1912 else if (regno == VIRTUAL_INCOMING_ARGS_REGNUM
1913 || (map->integrating
1914 && (DECL_SAVED_INSNS (map->fndecl)->internal_arg_pointer
1917 /* Do the same for a block to contain any arguments referenced
1920 int size = DECL_SAVED_INSNS (map->fndecl)->args_size;
1923 loc = assign_stack_temp (BLKmode, size, 1);
1924 loc = XEXP (loc, 0);
1925 /* When arguments grow downward, the virtual incoming
1926 args pointer points to the top of the argument block,
1927 so the remapped location better do the same. */
1928 #ifdef ARGS_GROW_DOWNWARD
1929 loc = plus_constant (loc, size);
1931 map->reg_map[regno] = temp
1932 = force_reg (Pmode, force_operand (loc, NULL_RTX));
1934 #ifdef STACK_BOUNDARY
1935 mark_reg_pointer (map->reg_map[regno], STACK_BOUNDARY);
1938 SET_CONST_EQUIV_DATA (map, temp, loc, CONST_AGE_PARM);
1940 seq = gen_sequence ();
1942 emit_insn_after (seq, map->insns_at_start);
1945 else if (REG_FUNCTION_VALUE_P (orig))
1947 /* This is a reference to the function return value. If
1948 the function doesn't have a return value, error. If the
1949 mode doesn't agree, and it ain't BLKmode, make a SUBREG. */
1950 if (map->inline_target == 0)
1952 if (rtx_equal_function_value_matters)
1953 /* This is an ignored return value. We must not
1954 leave it in with REG_FUNCTION_VALUE_P set, since
1955 that would confuse subsequent inlining of the
1956 current function into a later function. */
1957 return gen_rtx_REG (GET_MODE (orig), regno);
1959 /* Must be unrolling loops or replicating code if we
1960 reach here, so return the register unchanged. */
1963 else if (GET_MODE (map->inline_target) != BLKmode
1964 && mode != GET_MODE (map->inline_target))
1965 return gen_lowpart (mode, map->inline_target);
1967 return map->inline_target;
1969 #if defined (LEAF_REGISTERS) && defined (LEAF_REG_REMAP)
1970 /* If leaf_renumber_regs_insn() might remap this register to
1971 some other number, make sure we don't share it with the
1972 inlined function, otherwise delayed optimization of the
1973 inlined function may change it in place, breaking our
1974 reference to it. We may still shared it within the
1975 function, so create an entry for this register in the
1977 if (map->integrating && regno < FIRST_PSEUDO_REGISTER
1978 && LEAF_REGISTERS[regno] && LEAF_REG_REMAP (regno) != regno)
1980 if (!map->leaf_reg_map[regno][mode])
1981 map->leaf_reg_map[regno][mode] = gen_rtx_REG (mode, regno);
1982 return map->leaf_reg_map[regno][mode];
1990 if (map->reg_map[regno] == NULL)
1992 map->reg_map[regno] = gen_reg_rtx (mode);
1993 REG_USERVAR_P (map->reg_map[regno]) = REG_USERVAR_P (orig);
1994 REG_LOOP_TEST_P (map->reg_map[regno]) = REG_LOOP_TEST_P (orig);
1995 RTX_UNCHANGING_P (map->reg_map[regno]) = RTX_UNCHANGING_P (orig);
1996 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
1998 if (REG_POINTER (map->x_regno_reg_rtx[regno]))
1999 mark_reg_pointer (map->reg_map[regno],
2000 map->regno_pointer_align[regno]);
2002 return map->reg_map[regno];
2005 copy = copy_rtx_and_substitute (SUBREG_REG (orig), map, for_lhs);
2006 return simplify_gen_subreg (GET_MODE (orig), copy,
2007 GET_MODE (SUBREG_REG (orig)),
2008 SUBREG_BYTE (orig));
2011 copy = gen_rtx_ADDRESSOF (mode,
2012 copy_rtx_and_substitute (XEXP (orig, 0),
2014 0, ADDRESSOF_DECL (orig));
2015 regno = ADDRESSOF_REGNO (orig);
2016 if (map->reg_map[regno])
2017 regno = REGNO (map->reg_map[regno]);
2018 else if (regno > LAST_VIRTUAL_REGISTER)
2020 temp = XEXP (orig, 0);
2021 map->reg_map[regno] = gen_reg_rtx (GET_MODE (temp));
2022 REG_USERVAR_P (map->reg_map[regno]) = REG_USERVAR_P (temp);
2023 REG_LOOP_TEST_P (map->reg_map[regno]) = REG_LOOP_TEST_P (temp);
2024 RTX_UNCHANGING_P (map->reg_map[regno]) = RTX_UNCHANGING_P (temp);
2025 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
2027 if (REG_POINTER (map->x_regno_reg_rtx[regno]))
2028 mark_reg_pointer (map->reg_map[regno],
2029 map->regno_pointer_align[regno]);
2030 regno = REGNO (map->reg_map[regno]);
2032 ADDRESSOF_REGNO (copy) = regno;
2037 /* USE and CLOBBER are ordinary, but we convert (use (subreg foo))
2038 to (use foo) if the original insn didn't have a subreg.
2039 Removing the subreg distorts the VAX movstrhi pattern
2040 by changing the mode of an operand. */
2041 copy = copy_rtx_and_substitute (XEXP (orig, 0), map, code == CLOBBER);
2042 if (GET_CODE (copy) == SUBREG && GET_CODE (XEXP (orig, 0)) != SUBREG)
2043 copy = SUBREG_REG (copy);
2044 return gen_rtx_fmt_e (code, VOIDmode, copy);
2046 /* We need to handle "deleted" labels that appear in the DECL_RTL
2049 if (NOTE_LINE_NUMBER (orig) != NOTE_INSN_DELETED_LABEL)
2052 /* ... FALLTHRU ... */
2054 LABEL_PRESERVE_P (get_label_from_map (map, CODE_LABEL_NUMBER (orig)))
2055 = LABEL_PRESERVE_P (orig);
2056 return get_label_from_map (map, CODE_LABEL_NUMBER (orig));
2062 LABEL_REF_NONLOCAL_P (orig) ? XEXP (orig, 0)
2063 : get_label_from_map (map, CODE_LABEL_NUMBER (XEXP (orig, 0))));
2065 LABEL_OUTSIDE_LOOP_P (copy) = LABEL_OUTSIDE_LOOP_P (orig);
2067 /* The fact that this label was previously nonlocal does not mean
2068 it still is, so we must check if it is within the range of
2069 this function's labels. */
2070 LABEL_REF_NONLOCAL_P (copy)
2071 = (LABEL_REF_NONLOCAL_P (orig)
2072 && ! (CODE_LABEL_NUMBER (XEXP (copy, 0)) >= get_first_label_num ()
2073 && CODE_LABEL_NUMBER (XEXP (copy, 0)) < max_label_num ()));
2075 /* If we have made a nonlocal label local, it means that this
2076 inlined call will be referring to our nonlocal goto handler.
2077 So make sure we create one for this block; we normally would
2078 not since this is not otherwise considered a "call". */
2079 if (LABEL_REF_NONLOCAL_P (orig) && ! LABEL_REF_NONLOCAL_P (copy))
2080 function_call_count++;
2090 /* Symbols which represent the address of a label stored in the constant
2091 pool must be modified to point to a constant pool entry for the
2092 remapped label. Otherwise, symbols are returned unchanged. */
2093 if (CONSTANT_POOL_ADDRESS_P (orig))
2095 struct function *f = inlining ? inlining : cfun;
2096 rtx constant = get_pool_constant_for_function (f, orig);
2097 enum machine_mode const_mode = get_pool_mode_for_function (f, orig);
2100 rtx temp = force_const_mem (const_mode,
2101 copy_rtx_and_substitute (constant,
2105 /* Legitimizing the address here is incorrect.
2107 Since we had a SYMBOL_REF before, we can assume it is valid
2108 to have one in this position in the insn.
2110 Also, change_address may create new registers. These
2111 registers will not have valid reg_map entries. This can
2112 cause try_constants() to fail because assumes that all
2113 registers in the rtx have valid reg_map entries, and it may
2114 end up replacing one of these new registers with junk. */
2116 if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0)))
2117 temp = change_address (temp, GET_MODE (temp), XEXP (temp, 0));
2120 temp = XEXP (temp, 0);
2122 #ifdef POINTERS_EXTEND_UNSIGNED
2123 if (GET_MODE (temp) != GET_MODE (orig))
2124 temp = convert_memory_address (GET_MODE (orig), temp);
2128 else if (GET_CODE (constant) == LABEL_REF)
2129 return XEXP (force_const_mem
2131 copy_rtx_and_substitute (constant, map, for_lhs)),
2138 /* We have to make a new copy of this CONST_DOUBLE because don't want
2139 to use the old value of CONST_DOUBLE_MEM. Also, this may be a
2140 duplicate of a CONST_DOUBLE we have already seen. */
2141 if (GET_MODE_CLASS (GET_MODE (orig)) == MODE_FLOAT)
2145 REAL_VALUE_FROM_CONST_DOUBLE (d, orig);
2146 return CONST_DOUBLE_FROM_REAL_VALUE (d, GET_MODE (orig));
2149 return immed_double_const (CONST_DOUBLE_LOW (orig),
2150 CONST_DOUBLE_HIGH (orig), VOIDmode);
2153 /* Make new constant pool entry for a constant
2154 that was in the pool of the inline function. */
2155 if (RTX_INTEGRATED_P (orig))
2160 /* If a single asm insn contains multiple output operands then
2161 it contains multiple ASM_OPERANDS rtx's that share the input
2162 and constraint vecs. We must make sure that the copied insn
2163 continues to share it. */
2164 if (map->orig_asm_operands_vector == ASM_OPERANDS_INPUT_VEC (orig))
2166 copy = rtx_alloc (ASM_OPERANDS);
2167 copy->volatil = orig->volatil;
2168 PUT_MODE (copy, GET_MODE (orig));
2169 ASM_OPERANDS_TEMPLATE (copy) = ASM_OPERANDS_TEMPLATE (orig);
2170 ASM_OPERANDS_OUTPUT_CONSTRAINT (copy)
2171 = ASM_OPERANDS_OUTPUT_CONSTRAINT (orig);
2172 ASM_OPERANDS_OUTPUT_IDX (copy) = ASM_OPERANDS_OUTPUT_IDX (orig);
2173 ASM_OPERANDS_INPUT_VEC (copy) = map->copy_asm_operands_vector;
2174 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy)
2175 = map->copy_asm_constraints_vector;
2176 ASM_OPERANDS_SOURCE_FILE (copy) = ASM_OPERANDS_SOURCE_FILE (orig);
2177 ASM_OPERANDS_SOURCE_LINE (copy) = ASM_OPERANDS_SOURCE_LINE (orig);
2183 /* This is given special treatment because the first
2184 operand of a CALL is a (MEM ...) which may get
2185 forced into a register for cse. This is undesirable
2186 if function-address cse isn't wanted or if we won't do cse. */
2187 #ifndef NO_FUNCTION_CSE
2188 if (! (optimize && ! flag_no_function_cse))
2193 gen_rtx_MEM (GET_MODE (XEXP (orig, 0)),
2194 copy_rtx_and_substitute (XEXP (XEXP (orig, 0), 0),
2196 copy_rtx_and_substitute (XEXP (orig, 1), map, 0));
2200 /* Must be ifdefed out for loop unrolling to work. */
2206 /* If this is setting fp or ap, it means that we have a nonlocal goto.
2207 Adjust the setting by the offset of the area we made.
2208 If the nonlocal goto is into the current function,
2209 this will result in unnecessarily bad code, but should work. */
2210 if (SET_DEST (orig) == virtual_stack_vars_rtx
2211 || SET_DEST (orig) == virtual_incoming_args_rtx)
2213 /* In case a translation hasn't occurred already, make one now. */
2216 HOST_WIDE_INT loc_offset;
2218 copy_rtx_and_substitute (SET_DEST (orig), map, for_lhs);
2219 equiv_reg = map->reg_map[REGNO (SET_DEST (orig))];
2220 equiv_loc = VARRAY_CONST_EQUIV (map->const_equiv_varray,
2221 REGNO (equiv_reg)).rtx;
2223 = GET_CODE (equiv_loc) == REG ? 0 : INTVAL (XEXP (equiv_loc, 1));
2225 return gen_rtx_SET (VOIDmode, SET_DEST (orig),
2228 (copy_rtx_and_substitute (SET_SRC (orig),
2234 return gen_rtx_SET (VOIDmode,
2235 copy_rtx_and_substitute (SET_DEST (orig), map, 1),
2236 copy_rtx_and_substitute (SET_SRC (orig), map, 0));
2241 && GET_CODE (XEXP (orig, 0)) == SYMBOL_REF
2242 && CONSTANT_POOL_ADDRESS_P (XEXP (orig, 0)))
2244 enum machine_mode const_mode
2245 = get_pool_mode_for_function (inlining, XEXP (orig, 0));
2247 = get_pool_constant_for_function (inlining, XEXP (orig, 0));
2249 constant = copy_rtx_and_substitute (constant, map, 0);
2251 /* If this was an address of a constant pool entry that itself
2252 had to be placed in the constant pool, it might not be a
2253 valid address. So the recursive call might have turned it
2254 into a register. In that case, it isn't a constant any
2255 more, so return it. This has the potential of changing a
2256 MEM into a REG, but we'll assume that it safe. */
2257 if (! CONSTANT_P (constant))
2260 return validize_mem (force_const_mem (const_mode, constant));
2263 copy = rtx_alloc (MEM);
2264 PUT_MODE (copy, mode);
2265 XEXP (copy, 0) = copy_rtx_and_substitute (XEXP (orig, 0), map, 0);
2266 MEM_COPY_ATTRIBUTES (copy, orig);
2273 copy = rtx_alloc (code);
2274 PUT_MODE (copy, mode);
2275 copy->in_struct = orig->in_struct;
2276 copy->volatil = orig->volatil;
2277 copy->unchanging = orig->unchanging;
2279 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
2281 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
2283 switch (*format_ptr++)
2286 /* Copy this through the wide int field; that's safest. */
2287 X0WINT (copy, i) = X0WINT (orig, i);
2292 = copy_rtx_and_substitute (XEXP (orig, i), map, for_lhs);
2296 /* Change any references to old-insns to point to the
2297 corresponding copied insns. */
2298 XEXP (copy, i) = map->insn_map[INSN_UID (XEXP (orig, i))];
2302 XVEC (copy, i) = XVEC (orig, i);
2303 if (XVEC (orig, i) != NULL && XVECLEN (orig, i) != 0)
2305 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
2306 for (j = 0; j < XVECLEN (copy, i); j++)
2307 XVECEXP (copy, i, j)
2308 = copy_rtx_and_substitute (XVECEXP (orig, i, j),
2314 XWINT (copy, i) = XWINT (orig, i);
2318 XINT (copy, i) = XINT (orig, i);
2322 XSTR (copy, i) = XSTR (orig, i);
2326 XTREE (copy, i) = XTREE (orig, i);
2334 if (code == ASM_OPERANDS && map->orig_asm_operands_vector == 0)
2336 map->orig_asm_operands_vector = ASM_OPERANDS_INPUT_VEC (orig);
2337 map->copy_asm_operands_vector = ASM_OPERANDS_INPUT_VEC (copy);
2338 map->copy_asm_constraints_vector
2339 = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy);
2345 /* Substitute known constant values into INSN, if that is valid. */
2348 try_constants (insn, map)
2350 struct inline_remap *map;
2356 /* First try just updating addresses, then other things. This is
2357 important when we have something like the store of a constant
2358 into memory and we can update the memory address but the machine
2359 does not support a constant source. */
2360 subst_constants (&PATTERN (insn), insn, map, 1);
2361 apply_change_group ();
2362 subst_constants (&PATTERN (insn), insn, map, 0);
2363 apply_change_group ();
2365 /* Show we don't know the value of anything stored or clobbered. */
2366 note_stores (PATTERN (insn), mark_stores, NULL);
2367 map->last_pc_value = 0;
2369 map->last_cc0_value = 0;
2372 /* Set up any constant equivalences made in this insn. */
2373 for (i = 0; i < map->num_sets; i++)
2375 if (GET_CODE (map->equiv_sets[i].dest) == REG)
2377 int regno = REGNO (map->equiv_sets[i].dest);
2379 MAYBE_EXTEND_CONST_EQUIV_VARRAY (map, regno);
2380 if (VARRAY_CONST_EQUIV (map->const_equiv_varray, regno).rtx == 0
2381 /* Following clause is a hack to make case work where GNU C++
2382 reassigns a variable to make cse work right. */
2383 || ! rtx_equal_p (VARRAY_CONST_EQUIV (map->const_equiv_varray,
2385 map->equiv_sets[i].equiv))
2386 SET_CONST_EQUIV_DATA (map, map->equiv_sets[i].dest,
2387 map->equiv_sets[i].equiv, map->const_age);
2389 else if (map->equiv_sets[i].dest == pc_rtx)
2390 map->last_pc_value = map->equiv_sets[i].equiv;
2392 else if (map->equiv_sets[i].dest == cc0_rtx)
2393 map->last_cc0_value = map->equiv_sets[i].equiv;
2398 /* Substitute known constants for pseudo regs in the contents of LOC,
2399 which are part of INSN.
2400 If INSN is zero, the substitution should always be done (this is used to
2402 These changes are taken out by try_constants if the result is not valid.
2404 Note that we are more concerned with determining when the result of a SET
2405 is a constant, for further propagation, than actually inserting constants
2406 into insns; cse will do the latter task better.
2408 This function is also used to adjust address of items previously addressed
2409 via the virtual stack variable or virtual incoming arguments registers.
2411 If MEMONLY is nonzero, only make changes inside a MEM. */
2414 subst_constants (loc, insn, map, memonly)
2417 struct inline_remap *map;
2423 const char *format_ptr;
2424 int num_changes = num_validated_changes ();
2426 enum machine_mode op0_mode = MAX_MACHINE_MODE;
2428 code = GET_CODE (x);
2444 validate_change (insn, loc, map->last_cc0_value, 1);
2450 /* The only thing we can do with a USE or CLOBBER is possibly do
2451 some substitutions in a MEM within it. */
2452 if (GET_CODE (XEXP (x, 0)) == MEM)
2453 subst_constants (&XEXP (XEXP (x, 0), 0), insn, map, 0);
2457 /* Substitute for parms and known constants. Don't replace
2458 hard regs used as user variables with constants. */
2461 int regno = REGNO (x);
2462 struct const_equiv_data *p;
2464 if (! (regno < FIRST_PSEUDO_REGISTER && REG_USERVAR_P (x))
2465 && (size_t) regno < VARRAY_SIZE (map->const_equiv_varray)
2466 && (p = &VARRAY_CONST_EQUIV (map->const_equiv_varray, regno),
2468 && p->age >= map->const_age)
2469 validate_change (insn, loc, p->rtx, 1);
2474 /* SUBREG applied to something other than a reg
2475 should be treated as ordinary, since that must
2476 be a special hack and we don't know how to treat it specially.
2477 Consider for example mulsidi3 in m68k.md.
2478 Ordinary SUBREG of a REG needs this special treatment. */
2479 if (! memonly && GET_CODE (SUBREG_REG (x)) == REG)
2481 rtx inner = SUBREG_REG (x);
2484 /* We can't call subst_constants on &SUBREG_REG (x) because any
2485 constant or SUBREG wouldn't be valid inside our SUBEG. Instead,
2486 see what is inside, try to form the new SUBREG and see if that is
2487 valid. We handle two cases: extracting a full word in an
2488 integral mode and extracting the low part. */
2489 subst_constants (&inner, NULL_RTX, map, 0);
2490 new = simplify_gen_subreg (GET_MODE (x), inner,
2491 GET_MODE (SUBREG_REG (x)),
2495 validate_change (insn, loc, new, 1);
2497 cancel_changes (num_changes);
2504 subst_constants (&XEXP (x, 0), insn, map, 0);
2506 /* If a memory address got spoiled, change it back. */
2507 if (! memonly && insn != 0 && num_validated_changes () != num_changes
2508 && ! memory_address_p (GET_MODE (x), XEXP (x, 0)))
2509 cancel_changes (num_changes);
2514 /* Substitute constants in our source, and in any arguments to a
2515 complex (e..g, ZERO_EXTRACT) destination, but not in the destination
2517 rtx *dest_loc = &SET_DEST (x);
2518 rtx dest = *dest_loc;
2520 enum machine_mode compare_mode = VOIDmode;
2522 /* If SET_SRC is a COMPARE which subst_constants would turn into
2523 COMPARE of 2 VOIDmode constants, note the mode in which comparison
2525 if (GET_CODE (SET_SRC (x)) == COMPARE)
2528 if (GET_MODE_CLASS (GET_MODE (src)) == MODE_CC
2534 compare_mode = GET_MODE (XEXP (src, 0));
2535 if (compare_mode == VOIDmode)
2536 compare_mode = GET_MODE (XEXP (src, 1));
2540 subst_constants (&SET_SRC (x), insn, map, memonly);
2543 while (GET_CODE (*dest_loc) == ZERO_EXTRACT
2544 || GET_CODE (*dest_loc) == SUBREG
2545 || GET_CODE (*dest_loc) == STRICT_LOW_PART)
2547 if (GET_CODE (*dest_loc) == ZERO_EXTRACT)
2549 subst_constants (&XEXP (*dest_loc, 1), insn, map, memonly);
2550 subst_constants (&XEXP (*dest_loc, 2), insn, map, memonly);
2552 dest_loc = &XEXP (*dest_loc, 0);
2555 /* Do substitute in the address of a destination in memory. */
2556 if (GET_CODE (*dest_loc) == MEM)
2557 subst_constants (&XEXP (*dest_loc, 0), insn, map, 0);
2559 /* Check for the case of DEST a SUBREG, both it and the underlying
2560 register are less than one word, and the SUBREG has the wider mode.
2561 In the case, we are really setting the underlying register to the
2562 source converted to the mode of DEST. So indicate that. */
2563 if (GET_CODE (dest) == SUBREG
2564 && GET_MODE_SIZE (GET_MODE (dest)) <= UNITS_PER_WORD
2565 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest))) <= UNITS_PER_WORD
2566 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest)))
2567 <= GET_MODE_SIZE (GET_MODE (dest)))
2568 && (tem = gen_lowpart_if_possible (GET_MODE (SUBREG_REG (dest)),
2570 src = tem, dest = SUBREG_REG (dest);
2572 /* If storing a recognizable value save it for later recording. */
2573 if ((map->num_sets < MAX_RECOG_OPERANDS)
2574 && (CONSTANT_P (src)
2575 || (GET_CODE (src) == REG
2576 && (REGNO (src) == VIRTUAL_INCOMING_ARGS_REGNUM
2577 || REGNO (src) == VIRTUAL_STACK_VARS_REGNUM))
2578 || (GET_CODE (src) == PLUS
2579 && GET_CODE (XEXP (src, 0)) == REG
2580 && (REGNO (XEXP (src, 0)) == VIRTUAL_INCOMING_ARGS_REGNUM
2581 || REGNO (XEXP (src, 0)) == VIRTUAL_STACK_VARS_REGNUM)
2582 && CONSTANT_P (XEXP (src, 1)))
2583 || GET_CODE (src) == COMPARE
2588 && (src == pc_rtx || GET_CODE (src) == RETURN
2589 || GET_CODE (src) == LABEL_REF))))
2591 /* Normally, this copy won't do anything. But, if SRC is a COMPARE
2592 it will cause us to save the COMPARE with any constants
2593 substituted, which is what we want for later. */
2594 rtx src_copy = copy_rtx (src);
2595 map->equiv_sets[map->num_sets].equiv = src_copy;
2596 map->equiv_sets[map->num_sets++].dest = dest;
2597 if (compare_mode != VOIDmode
2598 && GET_CODE (src) == COMPARE
2599 && (GET_MODE_CLASS (GET_MODE (src)) == MODE_CC
2604 && GET_MODE (XEXP (src, 0)) == VOIDmode
2605 && GET_MODE (XEXP (src, 1)) == VOIDmode)
2607 map->compare_src = src_copy;
2608 map->compare_mode = compare_mode;
2618 format_ptr = GET_RTX_FORMAT (code);
2620 /* If the first operand is an expression, save its mode for later. */
2621 if (*format_ptr == 'e')
2622 op0_mode = GET_MODE (XEXP (x, 0));
2624 for (i = 0; i < GET_RTX_LENGTH (code); i++)
2626 switch (*format_ptr++)
2633 subst_constants (&XEXP (x, i), insn, map, memonly);
2645 if (XVEC (x, i) != NULL && XVECLEN (x, i) != 0)
2646 for (j = 0; j < XVECLEN (x, i); j++)
2647 subst_constants (&XVECEXP (x, i, j), insn, map, memonly);
2656 /* If this is a commutative operation, move a constant to the second
2657 operand unless the second operand is already a CONST_INT. */
2659 && (GET_RTX_CLASS (code) == 'c' || code == NE || code == EQ)
2660 && CONSTANT_P (XEXP (x, 0)) && GET_CODE (XEXP (x, 1)) != CONST_INT)
2662 rtx tem = XEXP (x, 0);
2663 validate_change (insn, &XEXP (x, 0), XEXP (x, 1), 1);
2664 validate_change (insn, &XEXP (x, 1), tem, 1);
2667 /* Simplify the expression in case we put in some constants. */
2669 switch (GET_RTX_CLASS (code))
2672 if (op0_mode == MAX_MACHINE_MODE)
2674 new = simplify_unary_operation (code, GET_MODE (x),
2675 XEXP (x, 0), op0_mode);
2680 enum machine_mode op_mode = GET_MODE (XEXP (x, 0));
2682 if (op_mode == VOIDmode)
2683 op_mode = GET_MODE (XEXP (x, 1));
2684 new = simplify_relational_operation (code, op_mode,
2685 XEXP (x, 0), XEXP (x, 1));
2686 #ifdef FLOAT_STORE_FLAG_VALUE
2687 if (new != 0 && GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT)
2689 enum machine_mode mode = GET_MODE (x);
2690 if (new == const0_rtx)
2691 new = CONST0_RTX (mode);
2694 REAL_VALUE_TYPE val = FLOAT_STORE_FLAG_VALUE (mode);
2695 new = CONST_DOUBLE_FROM_REAL_VALUE (val, mode);
2704 new = simplify_binary_operation (code, GET_MODE (x),
2705 XEXP (x, 0), XEXP (x, 1));
2710 if (op0_mode == MAX_MACHINE_MODE)
2713 if (code == IF_THEN_ELSE)
2715 rtx op0 = XEXP (x, 0);
2717 if (GET_RTX_CLASS (GET_CODE (op0)) == '<'
2718 && GET_MODE (op0) == VOIDmode
2719 && ! side_effects_p (op0)
2720 && XEXP (op0, 0) == map->compare_src
2721 && GET_MODE (XEXP (op0, 1)) == VOIDmode)
2723 /* We have compare of two VOIDmode constants for which
2724 we recorded the comparison mode. */
2726 simplify_relational_operation (GET_CODE (op0),
2731 if (temp == const0_rtx)
2733 else if (temp == const1_rtx)
2738 new = simplify_ternary_operation (code, GET_MODE (x), op0_mode,
2739 XEXP (x, 0), XEXP (x, 1),
2745 validate_change (insn, loc, new, 1);
2748 /* Show that register modified no longer contain known constants. We are
2749 called from note_stores with parts of the new insn. */
2752 mark_stores (dest, x, data)
2754 rtx x ATTRIBUTE_UNUSED;
2755 void *data ATTRIBUTE_UNUSED;
2758 enum machine_mode mode = VOIDmode;
2760 /* DEST is always the innermost thing set, except in the case of
2761 SUBREGs of hard registers. */
2763 if (GET_CODE (dest) == REG)
2764 regno = REGNO (dest), mode = GET_MODE (dest);
2765 else if (GET_CODE (dest) == SUBREG && GET_CODE (SUBREG_REG (dest)) == REG)
2767 regno = REGNO (SUBREG_REG (dest));
2768 if (regno < FIRST_PSEUDO_REGISTER)
2769 regno += subreg_regno_offset (REGNO (SUBREG_REG (dest)),
2770 GET_MODE (SUBREG_REG (dest)),
2773 mode = GET_MODE (SUBREG_REG (dest));
2778 unsigned int uregno = regno;
2779 unsigned int last_reg = (uregno >= FIRST_PSEUDO_REGISTER ? uregno
2780 : uregno + HARD_REGNO_NREGS (uregno, mode) - 1);
2783 /* Ignore virtual stack var or virtual arg register since those
2784 are handled separately. */
2785 if (uregno != VIRTUAL_INCOMING_ARGS_REGNUM
2786 && uregno != VIRTUAL_STACK_VARS_REGNUM)
2787 for (i = uregno; i <= last_reg; i++)
2788 if ((size_t) i < VARRAY_SIZE (global_const_equiv_varray))
2789 VARRAY_CONST_EQUIV (global_const_equiv_varray, i).rtx = 0;
2793 /* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the
2794 given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so
2795 that it points to the node itself, thus indicating that the node is its
2796 own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for
2797 the given node is NULL, recursively descend the decl/block tree which
2798 it is the root of, and for each other ..._DECL or BLOCK node contained
2799 therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also
2800 still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN
2801 values to point to themselves. */
2804 set_block_origin_self (stmt)
2807 if (BLOCK_ABSTRACT_ORIGIN (stmt) == NULL_TREE)
2809 BLOCK_ABSTRACT_ORIGIN (stmt) = stmt;
2814 for (local_decl = BLOCK_VARS (stmt);
2815 local_decl != NULL_TREE;
2816 local_decl = TREE_CHAIN (local_decl))
2817 set_decl_origin_self (local_decl); /* Potential recursion. */
2823 for (subblock = BLOCK_SUBBLOCKS (stmt);
2824 subblock != NULL_TREE;
2825 subblock = BLOCK_CHAIN (subblock))
2826 set_block_origin_self (subblock); /* Recurse. */
2831 /* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for
2832 the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the
2833 node to so that it points to the node itself, thus indicating that the
2834 node represents its own (abstract) origin. Additionally, if the
2835 DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend
2836 the decl/block tree of which the given node is the root of, and for
2837 each other ..._DECL or BLOCK node contained therein whose
2838 DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL,
2839 set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to
2840 point to themselves. */
2843 set_decl_origin_self (decl)
2846 if (DECL_ABSTRACT_ORIGIN (decl) == NULL_TREE)
2848 DECL_ABSTRACT_ORIGIN (decl) = decl;
2849 if (TREE_CODE (decl) == FUNCTION_DECL)
2853 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2854 DECL_ABSTRACT_ORIGIN (arg) = arg;
2855 if (DECL_INITIAL (decl) != NULL_TREE
2856 && DECL_INITIAL (decl) != error_mark_node)
2857 set_block_origin_self (DECL_INITIAL (decl));
2862 /* Given a pointer to some BLOCK node, and a boolean value to set the
2863 "abstract" flags to, set that value into the BLOCK_ABSTRACT flag for
2864 the given block, and for all local decls and all local sub-blocks
2865 (recursively) which are contained therein. */
2868 set_block_abstract_flags (stmt, setting)
2875 BLOCK_ABSTRACT (stmt) = setting;
2877 for (local_decl = BLOCK_VARS (stmt);
2878 local_decl != NULL_TREE;
2879 local_decl = TREE_CHAIN (local_decl))
2880 set_decl_abstract_flags (local_decl, setting);
2882 for (subblock = BLOCK_SUBBLOCKS (stmt);
2883 subblock != NULL_TREE;
2884 subblock = BLOCK_CHAIN (subblock))
2885 set_block_abstract_flags (subblock, setting);
2888 /* Given a pointer to some ..._DECL node, and a boolean value to set the
2889 "abstract" flags to, set that value into the DECL_ABSTRACT flag for the
2890 given decl, and (in the case where the decl is a FUNCTION_DECL) also
2891 set the abstract flags for all of the parameters, local vars, local
2892 blocks and sub-blocks (recursively) to the same setting. */
2895 set_decl_abstract_flags (decl, setting)
2899 DECL_ABSTRACT (decl) = setting;
2900 if (TREE_CODE (decl) == FUNCTION_DECL)
2904 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2905 DECL_ABSTRACT (arg) = setting;
2906 if (DECL_INITIAL (decl) != NULL_TREE
2907 && DECL_INITIAL (decl) != error_mark_node)
2908 set_block_abstract_flags (DECL_INITIAL (decl), setting);
2912 /* Output the assembly language code for the function FNDECL
2913 from its DECL_SAVED_INSNS. Used for inline functions that are output
2914 at end of compilation instead of where they came in the source. */
2917 output_inline_function (fndecl)
2920 struct function *old_cfun = cfun;
2921 enum debug_info_type old_write_symbols = write_symbols;
2922 struct gcc_debug_hooks *old_debug_hooks = debug_hooks;
2923 struct function *f = DECL_SAVED_INSNS (fndecl);
2926 current_function_decl = fndecl;
2927 clear_emit_caches ();
2929 set_new_last_label_num (f->inl_max_label_num);
2931 /* We're not deferring this any longer. */
2932 DECL_DEFER_OUTPUT (fndecl) = 0;
2934 /* If requested, suppress debugging information. */
2935 if (f->no_debugging_symbols)
2937 write_symbols = NO_DEBUG;
2938 debug_hooks = &do_nothing_debug_hooks;
2941 /* Do any preparation, such as emitting abstract debug info for the inline
2942 before it gets mangled by optimization. */
2943 (*debug_hooks->outlining_inline_function) (fndecl);
2945 /* Compile this function all the way down to assembly code. As a
2946 side effect this destroys the saved RTL representation, but
2947 that's okay, because we don't need to inline this anymore. */
2948 rest_of_compilation (fndecl);
2949 DECL_INLINE (fndecl) = 0;
2952 current_function_decl = old_cfun ? old_cfun->decl : 0;
2953 write_symbols = old_write_symbols;
2954 debug_hooks = old_debug_hooks;
2958 /* Functions to keep track of the values hard regs had at the start of
2962 has_func_hard_reg_initial_val (fun, reg)
2963 struct function *fun;
2966 struct initial_value_struct *ivs = fun->hard_reg_initial_vals;
2972 for (i = 0; i < ivs->num_entries; i++)
2973 if (rtx_equal_p (ivs->entries[i].hard_reg, reg))
2974 return ivs->entries[i].pseudo;
2980 get_func_hard_reg_initial_val (fun, reg)
2981 struct function *fun;
2984 struct initial_value_struct *ivs = fun->hard_reg_initial_vals;
2985 rtx rv = has_func_hard_reg_initial_val (fun, reg);
2992 fun->hard_reg_initial_vals = (void *) xmalloc (sizeof (initial_value_struct));
2993 ivs = fun->hard_reg_initial_vals;
2994 ivs->num_entries = 0;
2995 ivs->max_entries = 5;
2996 ivs->entries = (initial_value_pair *) xmalloc (5 * sizeof (initial_value_pair));
2999 if (ivs->num_entries >= ivs->max_entries)
3001 ivs->max_entries += 5;
3003 (initial_value_pair *) xrealloc (ivs->entries,
3005 * sizeof (initial_value_pair));
3008 ivs->entries[ivs->num_entries].hard_reg = reg;
3009 ivs->entries[ivs->num_entries].pseudo = gen_reg_rtx (GET_MODE (reg));
3011 return ivs->entries[ivs->num_entries++].pseudo;
3015 get_hard_reg_initial_val (mode, regno)
3016 enum machine_mode mode;
3019 return get_func_hard_reg_initial_val (cfun, gen_rtx_REG (mode, regno));
3023 has_hard_reg_initial_val (mode, regno)
3024 enum machine_mode mode;
3027 return has_func_hard_reg_initial_val (cfun, gen_rtx_REG (mode, regno));
3031 mark_hard_reg_initial_vals (fun)
3032 struct function *fun;
3034 struct initial_value_struct *ivs = fun->hard_reg_initial_vals;
3040 for (i = 0; i < ivs->num_entries; i ++)
3042 ggc_mark_rtx (ivs->entries[i].hard_reg);
3043 ggc_mark_rtx (ivs->entries[i].pseudo);
3048 setup_initial_hard_reg_value_integration (inl_f, remap)
3049 struct function *inl_f;
3050 struct inline_remap *remap;
3052 struct initial_value_struct *ivs = inl_f->hard_reg_initial_vals;
3058 for (i = 0; i < ivs->num_entries; i ++)
3059 remap->reg_map[REGNO (ivs->entries[i].pseudo)]
3060 = get_func_hard_reg_initial_val (cfun, ivs->entries[i].hard_reg);
3065 emit_initial_value_sets ()
3067 struct initial_value_struct *ivs = cfun->hard_reg_initial_vals;
3075 for (i = 0; i < ivs->num_entries; i++)
3076 emit_move_insn (ivs->entries[i].pseudo, ivs->entries[i].hard_reg);
3080 emit_insns_after (seq, get_insns ());
3083 /* If the backend knows where to allocate pseudos for hard
3084 register initial values, register these allocations now. */
3086 allocate_initial_values (reg_equiv_memory_loc)
3087 rtx *reg_equiv_memory_loc ATTRIBUTE_UNUSED;
3089 #ifdef ALLOCATE_INITIAL_VALUE
3090 struct initial_value_struct *ivs = cfun->hard_reg_initial_vals;
3096 for (i = 0; i < ivs->num_entries; i++)
3098 int regno = REGNO (ivs->entries[i].pseudo);
3099 rtx x = ALLOCATE_INITIAL_VALUE (ivs->entries[i].hard_reg);
3101 if (x == NULL_RTX || REG_N_SETS (REGNO (ivs->entries[i].pseudo)) > 1)
3103 else if (GET_CODE (x) == MEM)
3104 reg_equiv_memory_loc[regno] = x;
3105 else if (GET_CODE (x) == REG)
3107 reg_renumber[regno] = REGNO (x);
3108 /* Poke the regno right into regno_reg_rtx
3109 so that even fixed regs are accepted. */
3110 REGNO (ivs->entries[i].pseudo) = REGNO (x);