1 /* Procedure integration for GCC.
2 Copyright (C) 1988, 1991, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002 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"
46 #include "langhooks.h"
49 #define obstack_chunk_alloc xmalloc
50 #define obstack_chunk_free free
52 extern struct obstack *function_maybepermanent_obstack;
54 /* Similar, but round to the next highest integer that meets the
56 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
58 /* Default max number of insns a function can have and still be inline.
59 This is overridden on RISC machines. */
60 #ifndef INTEGRATE_THRESHOLD
61 /* Inlining small functions might save more space then not inlining at
62 all. Assume 1 instruction for the call and 1.5 insns per argument. */
63 #define INTEGRATE_THRESHOLD(DECL) \
65 ? (1 + (3 * list_length (DECL_ARGUMENTS (DECL))) / 2) \
66 : (8 * (8 + list_length (DECL_ARGUMENTS (DECL)))))
70 /* Private type used by {get/has}_func_hard_reg_initial_val. */
71 typedef struct initial_value_pair GTY(()) {
75 typedef struct initial_value_struct GTY(()) {
78 initial_value_pair * GTY ((length ("%h.num_entries"))) entries;
79 } initial_value_struct;
81 static void setup_initial_hard_reg_value_integration PARAMS ((struct function *, struct inline_remap *));
83 static rtvec initialize_for_inline PARAMS ((tree));
84 static void note_modified_parmregs PARAMS ((rtx, rtx, void *));
85 static void integrate_parm_decls PARAMS ((tree, struct inline_remap *,
87 static tree integrate_decl_tree PARAMS ((tree,
88 struct inline_remap *));
89 static void subst_constants PARAMS ((rtx *, rtx,
90 struct inline_remap *, int));
91 static void set_block_origin_self PARAMS ((tree));
92 static void set_block_abstract_flags PARAMS ((tree, int));
93 static void process_reg_param PARAMS ((struct inline_remap *, rtx,
95 void set_decl_abstract_flags PARAMS ((tree, int));
96 static void mark_stores PARAMS ((rtx, rtx, void *));
97 static void save_parm_insns PARAMS ((rtx, rtx));
98 static void copy_insn_list PARAMS ((rtx, struct inline_remap *,
100 static void copy_insn_notes PARAMS ((rtx, struct inline_remap *,
102 static int compare_blocks PARAMS ((const PTR, const PTR));
103 static int find_block PARAMS ((const PTR, const PTR));
105 /* Used by copy_rtx_and_substitute; this indicates whether the function is
106 called for the purpose of inlining or some other purpose (i.e. loop
107 unrolling). This affects how constant pool references are handled.
108 This variable contains the FUNCTION_DECL for the inlined function. */
109 static struct function *inlining = 0;
111 /* Returns the Ith entry in the label_map contained in MAP. If the
112 Ith entry has not yet been set, return a fresh label. This function
113 performs a lazy initialization of label_map, thereby avoiding huge memory
114 explosions when the label_map gets very large. */
117 get_label_from_map (map, i)
118 struct inline_remap *map;
121 rtx x = map->label_map[i];
124 x = map->label_map[i] = gen_label_rtx ();
129 /* Return false if the function FNDECL cannot be inlined on account of its
130 attributes, true otherwise. */
132 function_attribute_inlinable_p (fndecl)
135 if (targetm.attribute_table)
139 for (a = DECL_ATTRIBUTES (fndecl); a; a = TREE_CHAIN (a))
141 tree name = TREE_PURPOSE (a);
144 for (i = 0; targetm.attribute_table[i].name != NULL; i++)
145 if (is_attribute_p (targetm.attribute_table[i].name, name))
146 return (*targetm.function_attribute_inlinable_p) (fndecl);
153 /* Zero if the current function (whose FUNCTION_DECL is FNDECL)
154 is safe and reasonable to integrate into other functions.
155 Nonzero means value is a warning msgid with a single %s
156 for the function's name. */
159 function_cannot_inline_p (fndecl)
163 tree last = tree_last (TYPE_ARG_TYPES (TREE_TYPE (fndecl)));
165 /* For functions marked as inline increase the maximum size to
166 MAX_INLINE_INSNS (-finline-limit-<n>). For regular functions
167 use the limit given by INTEGRATE_THRESHOLD. */
169 int max_insns = (DECL_INLINE (fndecl))
171 + 8 * list_length (DECL_ARGUMENTS (fndecl)))
172 : INTEGRATE_THRESHOLD (fndecl);
177 if (DECL_UNINLINABLE (fndecl))
178 return N_("function cannot be inline");
180 /* No inlines with varargs. */
181 if ((last && TREE_VALUE (last) != void_type_node)
182 || current_function_varargs)
183 return N_("varargs function cannot be inline");
185 if (current_function_calls_alloca)
186 return N_("function using alloca cannot be inline");
188 if (current_function_calls_setjmp)
189 return N_("function using setjmp cannot be inline");
191 if (current_function_calls_eh_return)
192 return N_("function uses __builtin_eh_return");
194 if (current_function_contains_functions)
195 return N_("function with nested functions cannot be inline");
199 N_("function with label addresses used in initializers cannot inline");
201 if (current_function_cannot_inline)
202 return current_function_cannot_inline;
204 /* If its not even close, don't even look. */
205 if (get_max_uid () > 3 * max_insns)
206 return N_("function too large to be inline");
209 /* Don't inline functions which do not specify a function prototype and
210 have BLKmode argument or take the address of a parameter. */
211 for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms))
213 if (TYPE_MODE (TREE_TYPE (parms)) == BLKmode)
214 TREE_ADDRESSABLE (parms) = 1;
215 if (last == NULL_TREE && TREE_ADDRESSABLE (parms))
216 return N_("no prototype, and parameter address used; cannot be inline");
220 /* We can't inline functions that return structures
221 the old-fashioned PCC way, copying into a static block. */
222 if (current_function_returns_pcc_struct)
223 return N_("inline functions not supported for this return value type");
225 /* We can't inline functions that return structures of varying size. */
226 if (TREE_CODE (TREE_TYPE (TREE_TYPE (fndecl))) != VOID_TYPE
227 && int_size_in_bytes (TREE_TYPE (TREE_TYPE (fndecl))) < 0)
228 return N_("function with varying-size return value cannot be inline");
230 /* Cannot inline a function with a varying size argument or one that
231 receives a transparent union. */
232 for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms))
234 if (int_size_in_bytes (TREE_TYPE (parms)) < 0)
235 return N_("function with varying-size parameter cannot be inline");
236 else if (TREE_CODE (TREE_TYPE (parms)) == UNION_TYPE
237 && TYPE_TRANSPARENT_UNION (TREE_TYPE (parms)))
238 return N_("function with transparent unit parameter cannot be inline");
241 if (get_max_uid () > max_insns)
243 for (ninsns = 0, insn = get_first_nonparm_insn ();
244 insn && ninsns < max_insns;
245 insn = NEXT_INSN (insn))
249 if (ninsns >= max_insns)
250 return N_("function too large to be inline");
253 /* We will not inline a function which uses computed goto. The addresses of
254 its local labels, which may be tucked into global storage, are of course
255 not constant across instantiations, which causes unexpected behaviour. */
256 if (current_function_has_computed_jump)
257 return N_("function with computed jump cannot inline");
259 /* We cannot inline a nested function that jumps to a nonlocal label. */
260 if (current_function_has_nonlocal_goto)
261 return N_("function with nonlocal goto cannot be inline");
263 /* We can't inline functions that return a PARALLEL rtx. */
264 if (DECL_RTL_SET_P (DECL_RESULT (fndecl)))
266 rtx result = DECL_RTL (DECL_RESULT (fndecl));
267 if (GET_CODE (result) == PARALLEL)
268 return N_("inline functions not supported for this return value type");
271 /* If the function has a target specific attribute attached to it,
272 then we assume that we should not inline it. This can be overriden
273 by the target if it defines TARGET_FUNCTION_ATTRIBUTE_INLINABLE_P. */
274 if (!function_attribute_inlinable_p (fndecl))
275 return N_("function with target specific attribute(s) cannot be inlined");
280 /* Map pseudo reg number into the PARM_DECL for the parm living in the reg.
281 Zero for a reg that isn't a parm's home.
282 Only reg numbers less than max_parm_reg are mapped here. */
283 static tree *parmdecl_map;
285 /* In save_for_inline, nonzero if past the parm-initialization insns. */
286 static int in_nonparm_insns;
288 /* Subroutine for `save_for_inline'. Performs initialization
289 needed to save FNDECL's insns and info for future inline expansion. */
292 initialize_for_inline (fndecl)
299 /* Clear out PARMDECL_MAP. It was allocated in the caller's frame. */
300 memset ((char *) parmdecl_map, 0, max_parm_reg * sizeof (tree));
301 arg_vector = rtvec_alloc (list_length (DECL_ARGUMENTS (fndecl)));
303 for (parms = DECL_ARGUMENTS (fndecl), i = 0;
305 parms = TREE_CHAIN (parms), i++)
307 rtx p = DECL_RTL (parms);
309 /* If we have (mem (addressof (mem ...))), use the inner MEM since
310 otherwise the copy_rtx call below will not unshare the MEM since
311 it shares ADDRESSOF. */
312 if (GET_CODE (p) == MEM && GET_CODE (XEXP (p, 0)) == ADDRESSOF
313 && GET_CODE (XEXP (XEXP (p, 0), 0)) == MEM)
314 p = XEXP (XEXP (p, 0), 0);
316 RTVEC_ELT (arg_vector, i) = p;
318 if (GET_CODE (p) == REG)
319 parmdecl_map[REGNO (p)] = parms;
320 else if (GET_CODE (p) == CONCAT)
322 rtx preal = gen_realpart (GET_MODE (XEXP (p, 0)), p);
323 rtx pimag = gen_imagpart (GET_MODE (preal), p);
325 if (GET_CODE (preal) == REG)
326 parmdecl_map[REGNO (preal)] = parms;
327 if (GET_CODE (pimag) == REG)
328 parmdecl_map[REGNO (pimag)] = parms;
331 /* This flag is cleared later
332 if the function ever modifies the value of the parm. */
333 TREE_READONLY (parms) = 1;
339 /* Copy NODE (which must be a DECL, but not a PARM_DECL). The DECL
340 originally was in the FROM_FN, but now it will be in the
344 copy_decl_for_inlining (decl, from_fn, to_fn)
351 /* Copy the declaration. */
352 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
354 /* For a parameter, we must make an equivalent VAR_DECL, not a
356 copy = build_decl (VAR_DECL, DECL_NAME (decl), TREE_TYPE (decl));
357 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
358 TREE_READONLY (copy) = TREE_READONLY (decl);
359 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
363 copy = copy_node (decl);
364 (*lang_hooks.dup_lang_specific_decl) (copy);
366 /* TREE_ADDRESSABLE isn't used to indicate that a label's
367 address has been taken; it's for internal bookkeeping in
368 expand_goto_internal. */
369 if (TREE_CODE (copy) == LABEL_DECL)
370 TREE_ADDRESSABLE (copy) = 0;
373 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
374 declaration inspired this copy. */
375 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
377 /* The new variable/label has no RTL, yet. */
378 SET_DECL_RTL (copy, NULL_RTX);
380 /* These args would always appear unused, if not for this. */
381 TREE_USED (copy) = 1;
383 /* Set the context for the new declaration. */
384 if (!DECL_CONTEXT (decl))
385 /* Globals stay global. */
387 else if (DECL_CONTEXT (decl) != from_fn)
388 /* Things that weren't in the scope of the function we're inlining
389 from aren't in the scope we're inlining too, either. */
391 else if (TREE_STATIC (decl))
392 /* Function-scoped static variables should say in the original
396 /* Ordinary automatic local variables are now in the scope of the
398 DECL_CONTEXT (copy) = to_fn;
403 /* Make the insns and PARM_DECLs of the current function permanent
404 and record other information in DECL_SAVED_INSNS to allow inlining
405 of this function in subsequent calls.
407 This routine need not copy any insns because we are not going
408 to immediately compile the insns in the insn chain. There
409 are two cases when we would compile the insns for FNDECL:
410 (1) when FNDECL is expanded inline, and (2) when FNDECL needs to
411 be output at the end of other compilation, because somebody took
412 its address. In the first case, the insns of FNDECL are copied
413 as it is expanded inline, so FNDECL's saved insns are not
414 modified. In the second case, FNDECL is used for the last time,
415 so modifying the rtl is not a problem.
417 We don't have to worry about FNDECL being inline expanded by
418 other functions which are written at the end of compilation
419 because flag_no_inline is turned on when we begin writing
420 functions at the end of compilation. */
423 save_for_inline (fndecl)
428 rtx first_nonparm_insn;
430 /* Set up PARMDECL_MAP which maps pseudo-reg number to its PARM_DECL.
431 Later we set TREE_READONLY to 0 if the parm is modified inside the fn.
432 Also set up ARG_VECTOR, which holds the unmodified DECL_RTX values
433 for the parms, prior to elimination of virtual registers.
434 These values are needed for substituting parms properly. */
435 if (! flag_no_inline)
436 parmdecl_map = (tree *) xmalloc (max_parm_reg * sizeof (tree));
438 /* Make and emit a return-label if we have not already done so. */
440 if (return_label == 0)
442 return_label = gen_label_rtx ();
443 emit_label (return_label);
446 if (! flag_no_inline)
447 argvec = initialize_for_inline (fndecl);
451 /* Delete basic block notes created by early run of find_basic_block.
452 The notes would be later used by find_basic_blocks to reuse the memory
453 for basic_block structures on already freed obstack. */
454 for (insn = get_insns (); insn ; insn = NEXT_INSN (insn))
455 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) == NOTE_INSN_BASIC_BLOCK)
456 delete_related_insns (insn);
458 /* If there are insns that copy parms from the stack into pseudo registers,
459 those insns are not copied. `expand_inline_function' must
460 emit the correct code to handle such things. */
463 if (GET_CODE (insn) != NOTE)
466 if (! flag_no_inline)
468 /* Get the insn which signals the end of parameter setup code. */
469 first_nonparm_insn = get_first_nonparm_insn ();
471 /* Now just scan the chain of insns to see what happens to our
472 PARM_DECLs. If a PARM_DECL is used but never modified, we
473 can substitute its rtl directly when expanding inline (and
474 perform constant folding when its incoming value is
475 constant). Otherwise, we have to copy its value into a new
476 register and track the new register's life. */
477 in_nonparm_insns = 0;
478 save_parm_insns (insn, first_nonparm_insn);
480 cfun->inl_max_label_num = max_label_num ();
481 cfun->inl_last_parm_insn = cfun->x_last_parm_insn;
482 cfun->original_arg_vector = argvec;
484 cfun->original_decl_initial = DECL_INITIAL (fndecl);
485 cfun->no_debugging_symbols = (write_symbols == NO_DEBUG);
486 DECL_SAVED_INSNS (fndecl) = cfun;
489 if (! flag_no_inline)
493 /* Scan the chain of insns to see what happens to our PARM_DECLs. If a
494 PARM_DECL is used but never modified, we can substitute its rtl directly
495 when expanding inline (and perform constant folding when its incoming
496 value is constant). Otherwise, we have to copy its value into a new
497 register and track the new register's life. */
500 save_parm_insns (insn, first_nonparm_insn)
502 rtx first_nonparm_insn;
504 if (insn == NULL_RTX)
507 for (insn = NEXT_INSN (insn); insn; insn = NEXT_INSN (insn))
509 if (insn == first_nonparm_insn)
510 in_nonparm_insns = 1;
514 /* Record what interesting things happen to our parameters. */
515 note_stores (PATTERN (insn), note_modified_parmregs, NULL);
517 /* If this is a CALL_PLACEHOLDER insn then we need to look into the
518 three attached sequences: normal call, sibling call and tail
520 if (GET_CODE (insn) == CALL_INSN
521 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
525 for (i = 0; i < 3; i++)
526 save_parm_insns (XEXP (PATTERN (insn), i),
533 /* Note whether a parameter is modified or not. */
536 note_modified_parmregs (reg, x, data)
538 rtx x ATTRIBUTE_UNUSED;
539 void *data ATTRIBUTE_UNUSED;
541 if (GET_CODE (reg) == REG && in_nonparm_insns
542 && REGNO (reg) < max_parm_reg
543 && REGNO (reg) >= FIRST_PSEUDO_REGISTER
544 && parmdecl_map[REGNO (reg)] != 0)
545 TREE_READONLY (parmdecl_map[REGNO (reg)]) = 0;
548 /* Unfortunately, we need a global copy of const_equiv map for communication
549 with a function called from note_stores. Be *very* careful that this
550 is used properly in the presence of recursion. */
552 varray_type global_const_equiv_varray;
554 #define FIXED_BASE_PLUS_P(X) \
555 (GET_CODE (X) == PLUS && GET_CODE (XEXP (X, 1)) == CONST_INT \
556 && GET_CODE (XEXP (X, 0)) == REG \
557 && REGNO (XEXP (X, 0)) >= FIRST_VIRTUAL_REGISTER \
558 && REGNO (XEXP (X, 0)) <= LAST_VIRTUAL_REGISTER)
560 /* Called to set up a mapping for the case where a parameter is in a
561 register. If it is read-only and our argument is a constant, set up the
562 constant equivalence.
564 If LOC is REG_USERVAR_P, the usual case, COPY must also have that flag set
567 Also, don't allow hard registers here; they might not be valid when
568 substituted into insns. */
570 process_reg_param (map, loc, copy)
571 struct inline_remap *map;
574 if ((GET_CODE (copy) != REG && GET_CODE (copy) != SUBREG)
575 || (GET_CODE (copy) == REG && REG_USERVAR_P (loc)
576 && ! REG_USERVAR_P (copy))
577 || (GET_CODE (copy) == REG
578 && REGNO (copy) < FIRST_PSEUDO_REGISTER))
580 rtx temp = copy_to_mode_reg (GET_MODE (loc), copy);
581 REG_USERVAR_P (temp) = REG_USERVAR_P (loc);
582 if (CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy))
583 SET_CONST_EQUIV_DATA (map, temp, copy, CONST_AGE_PARM);
586 map->reg_map[REGNO (loc)] = copy;
589 /* Compare two BLOCKs for qsort. The key we sort on is the
590 BLOCK_ABSTRACT_ORIGIN of the blocks. We cannot just subtract the
591 two pointers, because it may overflow sizeof(int). */
594 compare_blocks (v1, v2)
598 tree b1 = *((const tree *) v1);
599 tree b2 = *((const tree *) v2);
600 char *p1 = (char *) BLOCK_ABSTRACT_ORIGIN (b1);
601 char *p2 = (char *) BLOCK_ABSTRACT_ORIGIN (b2);
605 return p1 < p2 ? -1 : 1;
608 /* Compare two BLOCKs for bsearch. The first pointer corresponds to
609 an original block; the second to a remapped equivalent. */
616 const union tree_node *b1 = (const union tree_node *) v1;
617 tree b2 = *((const tree *) v2);
618 char *p1 = (char *) b1;
619 char *p2 = (char *) BLOCK_ABSTRACT_ORIGIN (b2);
623 return p1 < p2 ? -1 : 1;
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;
666 rtvec arg_vector = inl_f->original_arg_vector;
667 rtx static_chain_value = 0;
669 int eh_region_offset;
671 /* The pointer used to track the true location of the memory used
672 for MAP->LABEL_MAP. */
673 rtx *real_label_map = 0;
675 /* Allow for equivalences of the pseudos we make for virtual fp and ap. */
676 max_regno = inl_f->emit->x_reg_rtx_no + 3;
677 if (max_regno < FIRST_PSEUDO_REGISTER)
680 /* Pull out the decl for the function definition; fndecl may be a
681 local declaration, which would break DECL_ABSTRACT_ORIGIN. */
682 fndecl = inl_f->decl;
684 nargs = list_length (DECL_ARGUMENTS (fndecl));
686 if (cfun->preferred_stack_boundary < inl_f->preferred_stack_boundary)
687 cfun->preferred_stack_boundary = inl_f->preferred_stack_boundary;
689 /* Check that the parms type match and that sufficient arguments were
690 passed. Since the appropriate conversions or default promotions have
691 already been applied, the machine modes should match exactly. */
693 for (formal = DECL_ARGUMENTS (fndecl), actual = parms;
695 formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual))
698 enum machine_mode mode;
701 return (rtx) (size_t) -1;
703 arg = TREE_VALUE (actual);
704 mode = TYPE_MODE (DECL_ARG_TYPE (formal));
706 if (arg == error_mark_node
707 || mode != TYPE_MODE (TREE_TYPE (arg))
708 /* If they are block mode, the types should match exactly.
709 They don't match exactly if TREE_TYPE (FORMAL) == ERROR_MARK_NODE,
710 which could happen if the parameter has incomplete type. */
712 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg))
713 != TYPE_MAIN_VARIANT (TREE_TYPE (formal)))))
714 return (rtx) (size_t) -1;
717 /* Extra arguments are valid, but will be ignored below, so we must
718 evaluate them here for side-effects. */
719 for (; actual; actual = TREE_CHAIN (actual))
720 expand_expr (TREE_VALUE (actual), const0_rtx,
721 TYPE_MODE (TREE_TYPE (TREE_VALUE (actual))), 0);
723 /* Expand the function arguments. Do this first so that any
724 new registers get created before we allocate the maps. */
726 arg_vals = (rtx *) xmalloc (nargs * sizeof (rtx));
727 arg_trees = (tree *) xmalloc (nargs * sizeof (tree));
729 for (formal = DECL_ARGUMENTS (fndecl), actual = parms, i = 0;
731 formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual), i++)
733 /* Actual parameter, converted to the type of the argument within the
735 tree arg = convert (TREE_TYPE (formal), TREE_VALUE (actual));
736 /* Mode of the variable used within the function. */
737 enum machine_mode mode = TYPE_MODE (TREE_TYPE (formal));
741 loc = RTVEC_ELT (arg_vector, i);
743 /* If this is an object passed by invisible reference, we copy the
744 object into a stack slot and save its address. If this will go
745 into memory, we do nothing now. Otherwise, we just expand the
747 if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG
748 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)
750 rtx stack_slot = assign_temp (TREE_TYPE (arg), 1, 1, 1);
752 store_expr (arg, stack_slot, 0);
753 arg_vals[i] = XEXP (stack_slot, 0);
756 else if (GET_CODE (loc) != MEM)
758 if (GET_MODE (loc) != TYPE_MODE (TREE_TYPE (arg)))
760 int unsignedp = TREE_UNSIGNED (TREE_TYPE (formal));
761 enum machine_mode pmode = TYPE_MODE (TREE_TYPE (formal));
763 pmode = promote_mode (TREE_TYPE (formal), pmode,
766 if (GET_MODE (loc) != pmode)
769 /* The mode if LOC and ARG can differ if LOC was a variable
770 that had its mode promoted via PROMOTED_MODE. */
771 arg_vals[i] = convert_modes (pmode,
772 TYPE_MODE (TREE_TYPE (arg)),
773 expand_expr (arg, NULL_RTX, mode,
778 arg_vals[i] = expand_expr (arg, NULL_RTX, mode, EXPAND_SUM);
784 && (! TREE_READONLY (formal)
785 /* If the parameter is not read-only, copy our argument through
786 a register. Also, we cannot use ARG_VALS[I] if it overlaps
787 TARGET in any way. In the inline function, they will likely
788 be two different pseudos, and `safe_from_p' will make all
789 sorts of smart assumptions about their not conflicting.
790 But if ARG_VALS[I] overlaps TARGET, these assumptions are
791 wrong, so put ARG_VALS[I] into a fresh register.
792 Don't worry about invisible references, since their stack
793 temps will never overlap the target. */
796 && (GET_CODE (arg_vals[i]) == REG
797 || GET_CODE (arg_vals[i]) == SUBREG
798 || GET_CODE (arg_vals[i]) == MEM)
799 && reg_overlap_mentioned_p (arg_vals[i], target))
800 /* ??? We must always copy a SUBREG into a REG, because it might
801 get substituted into an address, and not all ports correctly
802 handle SUBREGs in addresses. */
803 || (GET_CODE (arg_vals[i]) == SUBREG)))
804 arg_vals[i] = copy_to_mode_reg (GET_MODE (loc), arg_vals[i]);
806 if (arg_vals[i] != 0 && GET_CODE (arg_vals[i]) == REG
807 && POINTER_TYPE_P (TREE_TYPE (formal)))
808 mark_reg_pointer (arg_vals[i],
809 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (formal))));
812 /* Allocate the structures we use to remap things. */
814 map = (struct inline_remap *) xcalloc (1, sizeof (struct inline_remap));
815 map->fndecl = fndecl;
817 VARRAY_TREE_INIT (map->block_map, 10, "block_map");
818 map->reg_map = (rtx *) xcalloc (max_regno, sizeof (rtx));
820 /* We used to use alloca here, but the size of what it would try to
821 allocate would occasionally cause it to exceed the stack limit and
822 cause unpredictable core dumps. */
824 = (rtx *) xmalloc ((max_labelno) * sizeof (rtx));
825 map->label_map = real_label_map;
826 map->local_return_label = NULL_RTX;
828 inl_max_uid = (inl_f->emit->x_cur_insn_uid + 1);
829 map->insn_map = (rtx *) xcalloc (inl_max_uid, sizeof (rtx));
831 map->max_insnno = inl_max_uid;
833 map->integrating = 1;
834 map->compare_src = NULL_RTX;
835 map->compare_mode = VOIDmode;
837 /* const_equiv_varray maps pseudos in our routine to constants, so
838 it needs to be large enough for all our pseudos. This is the
839 number we are currently using plus the number in the called
840 routine, plus 15 for each arg, five to compute the virtual frame
841 pointer, and five for the return value. This should be enough
842 for most cases. We do not reference entries outside the range of
845 ??? These numbers are quite arbitrary and were obtained by
846 experimentation. At some point, we should try to allocate the
847 table after all the parameters are set up so we an more accurately
848 estimate the number of pseudos we will need. */
850 VARRAY_CONST_EQUIV_INIT (map->const_equiv_varray,
852 + (max_regno - FIRST_PSEUDO_REGISTER)
855 "expand_inline_function");
858 /* Record the current insn in case we have to set up pointers to frame
859 and argument memory blocks. If there are no insns yet, add a dummy
860 insn that can be used as an insertion point. */
861 map->insns_at_start = get_last_insn ();
862 if (map->insns_at_start == 0)
863 map->insns_at_start = emit_note (NULL, NOTE_INSN_DELETED);
865 map->regno_pointer_align = inl_f->emit->regno_pointer_align;
866 map->x_regno_reg_rtx = inl_f->emit->x_regno_reg_rtx;
868 /* Update the outgoing argument size to allow for those in the inlined
870 if (inl_f->outgoing_args_size > current_function_outgoing_args_size)
871 current_function_outgoing_args_size = inl_f->outgoing_args_size;
873 /* If the inline function needs to make PIC references, that means
874 that this function's PIC offset table must be used. */
875 if (inl_f->uses_pic_offset_table)
876 current_function_uses_pic_offset_table = 1;
878 /* If this function needs a context, set it up. */
879 if (inl_f->needs_context)
880 static_chain_value = lookup_static_chain (fndecl);
882 if (GET_CODE (parm_insns) == NOTE
883 && NOTE_LINE_NUMBER (parm_insns) > 0)
885 rtx note = emit_note (NOTE_SOURCE_FILE (parm_insns),
886 NOTE_LINE_NUMBER (parm_insns));
888 RTX_INTEGRATED_P (note) = 1;
891 /* Process each argument. For each, set up things so that the function's
892 reference to the argument will refer to the argument being passed.
893 We only replace REG with REG here. Any simplifications are done
896 We make two passes: In the first, we deal with parameters that will
897 be placed into registers, since we need to ensure that the allocated
898 register number fits in const_equiv_map. Then we store all non-register
899 parameters into their memory location. */
901 /* Don't try to free temp stack slots here, because we may put one of the
902 parameters into a temp stack slot. */
904 for (i = 0; i < nargs; i++)
906 rtx copy = arg_vals[i];
908 loc = RTVEC_ELT (arg_vector, i);
910 /* There are three cases, each handled separately. */
911 if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG
912 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)
914 /* This must be an object passed by invisible reference (it could
915 also be a variable-sized object, but we forbid inlining functions
916 with variable-sized arguments). COPY is the address of the
917 actual value (this computation will cause it to be copied). We
918 map that address for the register, noting the actual address as
919 an equivalent in case it can be substituted into the insns. */
921 if (GET_CODE (copy) != REG)
923 temp = copy_addr_to_reg (copy);
924 if (CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy))
925 SET_CONST_EQUIV_DATA (map, temp, copy, CONST_AGE_PARM);
928 map->reg_map[REGNO (XEXP (loc, 0))] = copy;
930 else if (GET_CODE (loc) == MEM)
932 /* This is the case of a parameter that lives in memory. It
933 will live in the block we allocate in the called routine's
934 frame that simulates the incoming argument area. Do nothing
935 with the parameter now; we will call store_expr later. In
936 this case, however, we must ensure that the virtual stack and
937 incoming arg rtx values are expanded now so that we can be
938 sure we have enough slots in the const equiv map since the
939 store_expr call can easily blow the size estimate. */
940 if (DECL_SAVED_INSNS (fndecl)->args_size != 0)
941 copy_rtx_and_substitute (virtual_incoming_args_rtx, map, 0);
943 else if (GET_CODE (loc) == REG)
944 process_reg_param (map, loc, copy);
945 else if (GET_CODE (loc) == CONCAT)
947 rtx locreal = gen_realpart (GET_MODE (XEXP (loc, 0)), loc);
948 rtx locimag = gen_imagpart (GET_MODE (XEXP (loc, 0)), loc);
949 rtx copyreal = gen_realpart (GET_MODE (locreal), copy);
950 rtx copyimag = gen_imagpart (GET_MODE (locimag), copy);
952 process_reg_param (map, locreal, copyreal);
953 process_reg_param (map, locimag, copyimag);
959 /* Tell copy_rtx_and_substitute to handle constant pool SYMBOL_REFs
960 specially. This function can be called recursively, so we need to
961 save the previous value. */
962 inlining_previous = inlining;
965 /* Now do the parameters that will be placed in memory. */
967 for (formal = DECL_ARGUMENTS (fndecl), i = 0;
968 formal; formal = TREE_CHAIN (formal), i++)
970 loc = RTVEC_ELT (arg_vector, i);
972 if (GET_CODE (loc) == MEM
973 /* Exclude case handled above. */
974 && ! (GET_CODE (XEXP (loc, 0)) == REG
975 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER))
977 rtx note = emit_note (DECL_SOURCE_FILE (formal),
978 DECL_SOURCE_LINE (formal));
980 RTX_INTEGRATED_P (note) = 1;
982 /* Compute the address in the area we reserved and store the
984 temp = copy_rtx_and_substitute (loc, map, 1);
985 subst_constants (&temp, NULL_RTX, map, 1);
986 apply_change_group ();
987 if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0)))
988 temp = change_address (temp, VOIDmode, XEXP (temp, 0));
989 store_expr (arg_trees[i], temp, 0);
993 /* Deal with the places that the function puts its result.
994 We are driven by what is placed into DECL_RESULT.
996 Initially, we assume that we don't have anything special handling for
997 REG_FUNCTION_RETURN_VALUE_P. */
999 map->inline_target = 0;
1000 loc = (DECL_RTL_SET_P (DECL_RESULT (fndecl))
1001 ? DECL_RTL (DECL_RESULT (fndecl)) : NULL_RTX);
1003 if (TYPE_MODE (type) == VOIDmode)
1004 /* There is no return value to worry about. */
1006 else if (GET_CODE (loc) == MEM)
1008 if (GET_CODE (XEXP (loc, 0)) == ADDRESSOF)
1010 temp = copy_rtx_and_substitute (loc, map, 1);
1011 subst_constants (&temp, NULL_RTX, map, 1);
1012 apply_change_group ();
1017 if (! structure_value_addr
1018 || ! aggregate_value_p (DECL_RESULT (fndecl)))
1021 /* Pass the function the address in which to return a structure
1022 value. Note that a constructor can cause someone to call us
1023 with STRUCTURE_VALUE_ADDR, but the initialization takes place
1024 via the first parameter, rather than the struct return address.
1026 We have two cases: If the address is a simple register
1027 indirect, use the mapping mechanism to point that register to
1028 our structure return address. Otherwise, store the structure
1029 return value into the place that it will be referenced from. */
1031 if (GET_CODE (XEXP (loc, 0)) == REG)
1033 temp = force_operand (structure_value_addr, NULL_RTX);
1034 temp = force_reg (Pmode, temp);
1035 /* A virtual register might be invalid in an insn, because
1036 it can cause trouble in reload. Since we don't have access
1037 to the expanders at map translation time, make sure we have
1038 a proper register now.
1039 If a virtual register is actually valid, cse or combine
1040 can put it into the mapped insns. */
1041 if (REGNO (temp) >= FIRST_VIRTUAL_REGISTER
1042 && REGNO (temp) <= LAST_VIRTUAL_REGISTER)
1043 temp = copy_to_mode_reg (Pmode, temp);
1044 map->reg_map[REGNO (XEXP (loc, 0))] = temp;
1046 if (CONSTANT_P (structure_value_addr)
1047 || GET_CODE (structure_value_addr) == ADDRESSOF
1048 || (GET_CODE (structure_value_addr) == PLUS
1049 && (XEXP (structure_value_addr, 0)
1050 == virtual_stack_vars_rtx)
1051 && (GET_CODE (XEXP (structure_value_addr, 1))
1054 SET_CONST_EQUIV_DATA (map, temp, structure_value_addr,
1060 temp = copy_rtx_and_substitute (loc, map, 1);
1061 subst_constants (&temp, NULL_RTX, map, 0);
1062 apply_change_group ();
1063 emit_move_insn (temp, structure_value_addr);
1068 /* We will ignore the result value, so don't look at its structure.
1069 Note that preparations for an aggregate return value
1070 do need to be made (above) even if it will be ignored. */
1072 else if (GET_CODE (loc) == REG)
1074 /* The function returns an object in a register and we use the return
1075 value. Set up our target for remapping. */
1077 /* Machine mode function was declared to return. */
1078 enum machine_mode departing_mode = TYPE_MODE (type);
1079 /* (Possibly wider) machine mode it actually computes
1080 (for the sake of callers that fail to declare it right).
1081 We have to use the mode of the result's RTL, rather than
1082 its type, since expand_function_start may have promoted it. */
1083 enum machine_mode arriving_mode
1084 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl)));
1087 /* Don't use MEMs as direct targets because on some machines
1088 substituting a MEM for a REG makes invalid insns.
1089 Let the combiner substitute the MEM if that is valid. */
1090 if (target == 0 || GET_CODE (target) != REG
1091 || GET_MODE (target) != departing_mode)
1093 /* Don't make BLKmode registers. If this looks like
1094 a BLKmode object being returned in a register, get
1095 the mode from that, otherwise abort. */
1096 if (departing_mode == BLKmode)
1098 if (REG == GET_CODE (DECL_RTL (DECL_RESULT (fndecl))))
1100 departing_mode = GET_MODE (DECL_RTL (DECL_RESULT (fndecl)));
1101 arriving_mode = departing_mode;
1107 target = gen_reg_rtx (departing_mode);
1110 /* If function's value was promoted before return,
1111 avoid machine mode mismatch when we substitute INLINE_TARGET.
1112 But TARGET is what we will return to the caller. */
1113 if (arriving_mode != departing_mode)
1115 /* Avoid creating a paradoxical subreg wider than
1116 BITS_PER_WORD, since that is illegal. */
1117 if (GET_MODE_BITSIZE (arriving_mode) > BITS_PER_WORD)
1119 if (!TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (departing_mode),
1120 GET_MODE_BITSIZE (arriving_mode)))
1121 /* Maybe could be handled by using convert_move () ? */
1123 reg_to_map = gen_reg_rtx (arriving_mode);
1124 target = gen_lowpart (departing_mode, reg_to_map);
1127 reg_to_map = gen_rtx_SUBREG (arriving_mode, target, 0);
1130 reg_to_map = target;
1132 /* Usually, the result value is the machine's return register.
1133 Sometimes it may be a pseudo. Handle both cases. */
1134 if (REG_FUNCTION_VALUE_P (loc))
1135 map->inline_target = reg_to_map;
1137 map->reg_map[REGNO (loc)] = reg_to_map;
1139 else if (GET_CODE (loc) == CONCAT)
1141 enum machine_mode departing_mode = TYPE_MODE (type);
1142 enum machine_mode arriving_mode
1143 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl)));
1145 if (departing_mode != arriving_mode)
1147 if (GET_CODE (XEXP (loc, 0)) != REG
1148 || GET_CODE (XEXP (loc, 1)) != REG)
1151 /* Don't use MEMs as direct targets because on some machines
1152 substituting a MEM for a REG makes invalid insns.
1153 Let the combiner substitute the MEM if that is valid. */
1154 if (target == 0 || GET_CODE (target) != REG
1155 || GET_MODE (target) != departing_mode)
1156 target = gen_reg_rtx (departing_mode);
1158 if (GET_CODE (target) != CONCAT)
1161 map->reg_map[REGNO (XEXP (loc, 0))] = XEXP (target, 0);
1162 map->reg_map[REGNO (XEXP (loc, 1))] = XEXP (target, 1);
1167 /* Remap the exception handler data pointer from one to the other. */
1168 temp = get_exception_pointer (inl_f);
1170 map->reg_map[REGNO (temp)] = get_exception_pointer (cfun);
1172 /* Initialize label_map. get_label_from_map will actually make
1174 memset ((char *) &map->label_map[min_labelno], 0,
1175 (max_labelno - min_labelno) * sizeof (rtx));
1177 /* Make copies of the decls of the symbols in the inline function, so that
1178 the copies of the variables get declared in the current function. Set
1179 up things so that lookup_static_chain knows that to interpret registers
1180 in SAVE_EXPRs for TYPE_SIZEs as local. */
1181 inline_function_decl = fndecl;
1182 integrate_parm_decls (DECL_ARGUMENTS (fndecl), map, arg_vector);
1183 block = integrate_decl_tree (inl_f->original_decl_initial, map);
1184 BLOCK_ABSTRACT_ORIGIN (block) = DECL_ORIGIN (fndecl);
1185 inline_function_decl = 0;
1187 /* Make a fresh binding contour that we can easily remove. Do this after
1188 expanding our arguments so cleanups are properly scoped. */
1189 expand_start_bindings_and_block (0, block);
1191 /* Sort the block-map so that it will be easy to find remapped
1193 qsort (&VARRAY_TREE (map->block_map, 0),
1194 map->block_map->elements_used,
1198 /* Perform postincrements before actually calling the function. */
1201 /* Clean up stack so that variables might have smaller offsets. */
1202 do_pending_stack_adjust ();
1204 /* Save a copy of the location of const_equiv_varray for
1205 mark_stores, called via note_stores. */
1206 global_const_equiv_varray = map->const_equiv_varray;
1208 /* If the called function does an alloca, save and restore the
1209 stack pointer around the call. This saves stack space, but
1210 also is required if this inline is being done between two
1212 if (inl_f->calls_alloca)
1213 emit_stack_save (SAVE_BLOCK, &stack_save, NULL_RTX);
1215 /* Map pseudos used for initial hard reg values. */
1216 setup_initial_hard_reg_value_integration (inl_f, map);
1218 /* Now copy the insns one by one. */
1219 copy_insn_list (insns, map, static_chain_value);
1221 /* Duplicate the EH regions. This will create an offset from the
1222 region numbers in the function we're inlining to the region
1223 numbers in the calling function. This must wait until after
1224 copy_insn_list, as we need the insn map to be complete. */
1225 eh_region_offset = duplicate_eh_regions (inl_f, map);
1227 /* Now copy the REG_NOTES for those insns. */
1228 copy_insn_notes (insns, map, eh_region_offset);
1230 /* If the insn sequence required one, emit the return label. */
1231 if (map->local_return_label)
1232 emit_label (map->local_return_label);
1234 /* Restore the stack pointer if we saved it above. */
1235 if (inl_f->calls_alloca)
1236 emit_stack_restore (SAVE_BLOCK, stack_save, NULL_RTX);
1238 if (! cfun->x_whole_function_mode_p)
1239 /* In statement-at-a-time mode, we just tell the front-end to add
1240 this block to the list of blocks at this binding level. We
1241 can't do it the way it's done for function-at-a-time mode the
1242 superblocks have not been created yet. */
1243 (*lang_hooks.decls.insert_block) (block);
1247 = BLOCK_CHAIN (DECL_INITIAL (current_function_decl));
1248 BLOCK_CHAIN (DECL_INITIAL (current_function_decl)) = block;
1251 /* End the scope containing the copied formal parameter variables
1252 and copied LABEL_DECLs. We pass NULL_TREE for the variables list
1253 here so that expand_end_bindings will not check for unused
1254 variables. That's already been checked for when the inlined
1255 function was defined. */
1256 expand_end_bindings (NULL_TREE, 1, 1);
1258 /* Must mark the line number note after inlined functions as a repeat, so
1259 that the test coverage code can avoid counting the call twice. This
1260 just tells the code to ignore the immediately following line note, since
1261 there already exists a copy of this note before the expanded inline call.
1262 This line number note is still needed for debugging though, so we can't
1264 if (flag_test_coverage)
1265 emit_note (0, NOTE_INSN_REPEATED_LINE_NUMBER);
1267 emit_line_note (input_filename, lineno);
1269 /* If the function returns a BLKmode object in a register, copy it
1270 out of the temp register into a BLKmode memory object. */
1272 && TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl))) == BLKmode
1273 && ! aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl))))
1274 target = copy_blkmode_from_reg (0, target, TREE_TYPE (TREE_TYPE (fndecl)));
1276 if (structure_value_addr)
1278 target = gen_rtx_MEM (TYPE_MODE (type),
1279 memory_address (TYPE_MODE (type),
1280 structure_value_addr));
1281 set_mem_attributes (target, type, 1);
1284 /* Make sure we free the things we explicitly allocated with xmalloc. */
1286 free (real_label_map);
1287 VARRAY_FREE (map->const_equiv_varray);
1288 free (map->reg_map);
1289 free (map->insn_map);
1294 inlining = inlining_previous;
1299 /* Make copies of each insn in the given list using the mapping
1300 computed in expand_inline_function. This function may call itself for
1301 insns containing sequences.
1303 Copying is done in two passes, first the insns and then their REG_NOTES.
1305 If static_chain_value is non-zero, it represents the context-pointer
1306 register for the function. */
1309 copy_insn_list (insns, map, static_chain_value)
1311 struct inline_remap *map;
1312 rtx static_chain_value;
1320 rtx static_chain_mem = 0;
1322 /* Copy the insns one by one. Do this in two passes, first the insns and
1323 then their REG_NOTES. */
1325 /* This loop is very similar to the loop in copy_loop_body in unroll.c. */
1327 for (insn = insns; insn; insn = NEXT_INSN (insn))
1329 rtx copy, pattern, set;
1331 map->orig_asm_operands_vector = 0;
1333 switch (GET_CODE (insn))
1336 pattern = PATTERN (insn);
1337 set = single_set (insn);
1339 if (GET_CODE (pattern) == USE
1340 && GET_CODE (XEXP (pattern, 0)) == REG
1341 && REG_FUNCTION_VALUE_P (XEXP (pattern, 0)))
1342 /* The (USE (REG n)) at return from the function should
1343 be ignored since we are changing (REG n) into
1347 /* Ignore setting a function value that we don't want to use. */
1348 if (map->inline_target == 0
1350 && GET_CODE (SET_DEST (set)) == REG
1351 && REG_FUNCTION_VALUE_P (SET_DEST (set)))
1353 if (volatile_refs_p (SET_SRC (set)))
1357 /* If we must not delete the source,
1358 load it into a new temporary. */
1359 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1361 new_set = single_set (copy);
1366 = gen_reg_rtx (GET_MODE (SET_DEST (new_set)));
1368 /* If the source and destination are the same and it
1369 has a note on it, keep the insn. */
1370 else if (rtx_equal_p (SET_DEST (set), SET_SRC (set))
1371 && REG_NOTES (insn) != 0)
1372 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1377 /* Similarly if an ignored return value is clobbered. */
1378 else if (map->inline_target == 0
1379 && GET_CODE (pattern) == CLOBBER
1380 && GET_CODE (XEXP (pattern, 0)) == REG
1381 && REG_FUNCTION_VALUE_P (XEXP (pattern, 0)))
1384 /* Look for the address of the static chain slot. The
1385 rtx_equal_p comparisons against the
1386 static_chain_incoming_rtx below may fail if the static
1387 chain is in memory and the address specified is not
1388 "legitimate". This happens on Xtensa where the static
1389 chain is at a negative offset from argp and where only
1390 positive offsets are legitimate. When the RTL is
1391 generated, the address is "legitimized" by copying it
1392 into a register, causing the rtx_equal_p comparisons to
1393 fail. This workaround looks for code that sets a
1394 register to the address of the static chain. Subsequent
1395 memory references via that register can then be
1396 identified as static chain references. We assume that
1397 the register is only assigned once, and that the static
1398 chain address is only live in one register at a time. */
1400 else if (static_chain_value != 0
1402 && GET_CODE (static_chain_incoming_rtx) == MEM
1403 && GET_CODE (SET_DEST (set)) == REG
1404 && rtx_equal_p (SET_SRC (set),
1405 XEXP (static_chain_incoming_rtx, 0)))
1408 gen_rtx_MEM (GET_MODE (static_chain_incoming_rtx),
1411 /* emit the instruction in case it is used for something
1412 other than setting the static chain; if it's not used,
1413 it can always be removed as dead code */
1414 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1417 /* If this is setting the static chain rtx, omit it. */
1418 else if (static_chain_value != 0
1420 && (rtx_equal_p (SET_DEST (set),
1421 static_chain_incoming_rtx)
1422 || (static_chain_mem
1423 && rtx_equal_p (SET_DEST (set), static_chain_mem))))
1426 /* If this is setting the static chain pseudo, set it from
1427 the value we want to give it instead. */
1428 else if (static_chain_value != 0
1430 && (rtx_equal_p (SET_SRC (set),
1431 static_chain_incoming_rtx)
1432 || (static_chain_mem
1433 && rtx_equal_p (SET_SRC (set), static_chain_mem))))
1435 rtx newdest = copy_rtx_and_substitute (SET_DEST (set), map, 1);
1437 copy = emit_move_insn (newdest, static_chain_value);
1438 if (GET_CODE (static_chain_incoming_rtx) != MEM)
1439 static_chain_value = 0;
1442 /* If this is setting the virtual stack vars register, this must
1443 be the code at the handler for a builtin longjmp. The value
1444 saved in the setjmp buffer will be the address of the frame
1445 we've made for this inlined instance within our frame. But we
1446 know the offset of that value so we can use it to reconstruct
1447 our virtual stack vars register from that value. If we are
1448 copying it from the stack pointer, leave it unchanged. */
1450 && rtx_equal_p (SET_DEST (set), virtual_stack_vars_rtx))
1452 HOST_WIDE_INT offset;
1453 temp = map->reg_map[REGNO (SET_DEST (set))];
1454 temp = VARRAY_CONST_EQUIV (map->const_equiv_varray,
1457 if (rtx_equal_p (temp, virtual_stack_vars_rtx))
1459 else if (GET_CODE (temp) == PLUS
1460 && rtx_equal_p (XEXP (temp, 0), virtual_stack_vars_rtx)
1461 && GET_CODE (XEXP (temp, 1)) == CONST_INT)
1462 offset = INTVAL (XEXP (temp, 1));
1466 if (rtx_equal_p (SET_SRC (set), stack_pointer_rtx))
1467 temp = SET_SRC (set);
1469 temp = force_operand (plus_constant (SET_SRC (set),
1473 copy = emit_move_insn (virtual_stack_vars_rtx, temp);
1477 copy = emit_insn (copy_rtx_and_substitute (pattern, map, 0));
1478 /* REG_NOTES will be copied later. */
1481 /* If this insn is setting CC0, it may need to look at
1482 the insn that uses CC0 to see what type of insn it is.
1483 In that case, the call to recog via validate_change will
1484 fail. So don't substitute constants here. Instead,
1485 do it when we emit the following insn.
1487 For example, see the pyr.md file. That machine has signed and
1488 unsigned compares. The compare patterns must check the
1489 following branch insn to see which what kind of compare to
1492 If the previous insn set CC0, substitute constants on it as
1494 if (sets_cc0_p (PATTERN (copy)) != 0)
1499 try_constants (cc0_insn, map);
1501 try_constants (copy, map);
1504 try_constants (copy, map);
1506 INSN_SCOPE (copy) = INSN_SCOPE (insn);
1510 if (map->integrating && returnjump_p (insn))
1512 if (map->local_return_label == 0)
1513 map->local_return_label = gen_label_rtx ();
1514 pattern = gen_jump (map->local_return_label);
1517 pattern = copy_rtx_and_substitute (PATTERN (insn), map, 0);
1519 copy = emit_jump_insn (pattern);
1523 try_constants (cc0_insn, map);
1526 try_constants (copy, map);
1527 INSN_SCOPE (copy) = INSN_SCOPE (insn);
1529 /* If this used to be a conditional jump insn but whose branch
1530 direction is now know, we must do something special. */
1531 if (any_condjump_p (insn) && onlyjump_p (insn) && map->last_pc_value)
1534 /* If the previous insn set cc0 for us, delete it. */
1535 if (only_sets_cc0_p (PREV_INSN (copy)))
1536 delete_related_insns (PREV_INSN (copy));
1539 /* If this is now a no-op, delete it. */
1540 if (map->last_pc_value == pc_rtx)
1542 delete_related_insns (copy);
1546 /* Otherwise, this is unconditional jump so we must put a
1547 BARRIER after it. We could do some dead code elimination
1548 here, but jump.c will do it just as well. */
1554 /* If this is a CALL_PLACEHOLDER insn then we need to copy the
1555 three attached sequences: normal call, sibling call and tail
1557 if (GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
1562 for (i = 0; i < 3; i++)
1566 sequence[i] = NULL_RTX;
1567 seq = XEXP (PATTERN (insn), i);
1571 copy_insn_list (seq, map, static_chain_value);
1572 sequence[i] = get_insns ();
1577 /* Find the new tail recursion label.
1578 It will already be substituted into sequence[2]. */
1579 tail_label = copy_rtx_and_substitute (XEXP (PATTERN (insn), 3),
1582 copy = emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode,
1590 pattern = copy_rtx_and_substitute (PATTERN (insn), map, 0);
1591 copy = emit_call_insn (pattern);
1593 SIBLING_CALL_P (copy) = SIBLING_CALL_P (insn);
1594 CONST_OR_PURE_CALL_P (copy) = CONST_OR_PURE_CALL_P (insn);
1595 INSN_SCOPE (copy) = INSN_SCOPE (insn);
1597 /* Because the USAGE information potentially contains objects other
1598 than hard registers, we need to copy it. */
1600 CALL_INSN_FUNCTION_USAGE (copy)
1601 = copy_rtx_and_substitute (CALL_INSN_FUNCTION_USAGE (insn),
1606 try_constants (cc0_insn, map);
1609 try_constants (copy, map);
1611 /* Be lazy and assume CALL_INSNs clobber all hard registers. */
1612 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1613 VARRAY_CONST_EQUIV (map->const_equiv_varray, i).rtx = 0;
1617 copy = emit_label (get_label_from_map (map,
1618 CODE_LABEL_NUMBER (insn)));
1619 LABEL_NAME (copy) = LABEL_NAME (insn);
1624 copy = emit_barrier ();
1628 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL)
1630 copy = emit_label (get_label_from_map (map,
1631 CODE_LABEL_NUMBER (insn)));
1632 LABEL_NAME (copy) = NOTE_SOURCE_FILE (insn);
1637 /* NOTE_INSN_FUNCTION_END and NOTE_INSN_FUNCTION_BEG are
1638 discarded because it is important to have only one of
1639 each in the current function.
1641 NOTE_INSN_DELETED notes aren't useful. */
1643 if (NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_END
1644 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_BEG
1645 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_DELETED)
1647 copy = emit_note (NOTE_SOURCE_FILE (insn),
1648 NOTE_LINE_NUMBER (insn));
1650 && (NOTE_LINE_NUMBER (copy) == NOTE_INSN_BLOCK_BEG
1651 || NOTE_LINE_NUMBER (copy) == NOTE_INSN_BLOCK_END)
1652 && NOTE_BLOCK (insn))
1654 tree *mapped_block_p;
1657 = (tree *) bsearch (NOTE_BLOCK (insn),
1658 &VARRAY_TREE (map->block_map, 0),
1659 map->block_map->elements_used,
1663 if (!mapped_block_p)
1666 NOTE_BLOCK (copy) = *mapped_block_p;
1669 && NOTE_LINE_NUMBER (copy) == NOTE_INSN_EXPECTED_VALUE)
1670 NOTE_EXPECTED_VALUE (copy)
1671 = copy_rtx_and_substitute (NOTE_EXPECTED_VALUE (insn),
1683 RTX_INTEGRATED_P (copy) = 1;
1685 map->insn_map[INSN_UID (insn)] = copy;
1689 /* Copy the REG_NOTES. Increment const_age, so that only constants
1690 from parameters can be substituted in. These are the only ones
1691 that are valid across the entire function. */
1694 copy_insn_notes (insns, map, eh_region_offset)
1696 struct inline_remap *map;
1697 int eh_region_offset;
1702 for (insn = insns; insn; insn = NEXT_INSN (insn))
1704 if (! INSN_P (insn))
1707 new_insn = map->insn_map[INSN_UID (insn)];
1711 if (REG_NOTES (insn))
1713 rtx next, note = copy_rtx_and_substitute (REG_NOTES (insn), map, 0);
1715 /* We must also do subst_constants, in case one of our parameters
1716 has const type and constant value. */
1717 subst_constants (¬e, NULL_RTX, map, 0);
1718 apply_change_group ();
1719 REG_NOTES (new_insn) = note;
1721 /* Delete any REG_LABEL notes from the chain. Remap any
1722 REG_EH_REGION notes. */
1723 for (; note; note = next)
1725 next = XEXP (note, 1);
1726 if (REG_NOTE_KIND (note) == REG_LABEL)
1727 remove_note (new_insn, note);
1728 else if (REG_NOTE_KIND (note) == REG_EH_REGION
1729 && INTVAL (XEXP (note, 0)) > 0)
1730 XEXP (note, 0) = GEN_INT (INTVAL (XEXP (note, 0))
1731 + eh_region_offset);
1735 if (GET_CODE (insn) == CALL_INSN
1736 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
1739 for (i = 0; i < 3; i++)
1740 copy_insn_notes (XEXP (PATTERN (insn), i), map, eh_region_offset);
1743 if (GET_CODE (insn) == JUMP_INSN
1744 && GET_CODE (PATTERN (insn)) == RESX)
1745 XINT (PATTERN (new_insn), 0) += eh_region_offset;
1749 /* Given a chain of PARM_DECLs, ARGS, copy each decl into a VAR_DECL,
1750 push all of those decls and give each one the corresponding home. */
1753 integrate_parm_decls (args, map, arg_vector)
1755 struct inline_remap *map;
1761 for (tail = args, i = 0; tail; tail = TREE_CHAIN (tail), i++)
1763 tree decl = copy_decl_for_inlining (tail, map->fndecl,
1764 current_function_decl);
1766 = copy_rtx_and_substitute (RTVEC_ELT (arg_vector, i), map, 1);
1768 /* We really should be setting DECL_INCOMING_RTL to something reasonable
1769 here, but that's going to require some more work. */
1770 /* DECL_INCOMING_RTL (decl) = ?; */
1771 /* Fully instantiate the address with the equivalent form so that the
1772 debugging information contains the actual register, instead of the
1773 virtual register. Do this by not passing an insn to
1775 subst_constants (&new_decl_rtl, NULL_RTX, map, 1);
1776 apply_change_group ();
1777 SET_DECL_RTL (decl, new_decl_rtl);
1781 /* Given a BLOCK node LET, push decls and levels so as to construct in the
1782 current function a tree of contexts isomorphic to the one that is given.
1784 MAP, if nonzero, is a pointer to an inline_remap map which indicates how
1785 registers used in the DECL_RTL field should be remapped. If it is zero,
1786 no mapping is necessary. */
1789 integrate_decl_tree (let, map)
1791 struct inline_remap *map;
1797 new_block = make_node (BLOCK);
1798 VARRAY_PUSH_TREE (map->block_map, new_block);
1799 next = &BLOCK_VARS (new_block);
1801 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
1805 d = copy_decl_for_inlining (t, map->fndecl, current_function_decl);
1807 if (DECL_RTL_SET_P (t))
1811 SET_DECL_RTL (d, copy_rtx_and_substitute (DECL_RTL (t), map, 1));
1813 /* Fully instantiate the address with the equivalent form so that the
1814 debugging information contains the actual register, instead of the
1815 virtual register. Do this by not passing an insn to
1818 subst_constants (&r, NULL_RTX, map, 1);
1819 SET_DECL_RTL (d, r);
1821 if (GET_CODE (r) == REG)
1822 REGNO_DECL (REGNO (r)) = d;
1823 else if (GET_CODE (r) == CONCAT)
1825 REGNO_DECL (REGNO (XEXP (r, 0))) = d;
1826 REGNO_DECL (REGNO (XEXP (r, 1))) = d;
1829 apply_change_group ();
1832 /* Add this declaration to the list of variables in the new
1835 next = &TREE_CHAIN (d);
1838 next = &BLOCK_SUBBLOCKS (new_block);
1839 for (t = BLOCK_SUBBLOCKS (let); t; t = BLOCK_CHAIN (t))
1841 *next = integrate_decl_tree (t, map);
1842 BLOCK_SUPERCONTEXT (*next) = new_block;
1843 next = &BLOCK_CHAIN (*next);
1846 TREE_USED (new_block) = TREE_USED (let);
1847 BLOCK_ABSTRACT_ORIGIN (new_block) = let;
1852 /* Create a new copy of an rtx. Recursively copies the operands of the rtx,
1853 except for those few rtx codes that are sharable.
1855 We always return an rtx that is similar to that incoming rtx, with the
1856 exception of possibly changing a REG to a SUBREG or vice versa. No
1857 rtl is ever emitted.
1859 If FOR_LHS is nonzero, if means we are processing something that will
1860 be the LHS of a SET. In that case, we copy RTX_UNCHANGING_P even if
1861 inlining since we need to be conservative in how it is set for
1864 Handle constants that need to be placed in the constant pool by
1865 calling `force_const_mem'. */
1868 copy_rtx_and_substitute (orig, map, for_lhs)
1870 struct inline_remap *map;
1876 enum machine_mode mode;
1877 const char *format_ptr;
1883 code = GET_CODE (orig);
1884 mode = GET_MODE (orig);
1889 /* If the stack pointer register shows up, it must be part of
1890 stack-adjustments (*not* because we eliminated the frame pointer!).
1891 Small hard registers are returned as-is. Pseudo-registers
1892 go through their `reg_map'. */
1893 regno = REGNO (orig);
1894 if (regno <= LAST_VIRTUAL_REGISTER
1895 || (map->integrating
1896 && DECL_SAVED_INSNS (map->fndecl)->internal_arg_pointer == orig))
1898 /* Some hard registers are also mapped,
1899 but others are not translated. */
1900 if (map->reg_map[regno] != 0)
1901 return map->reg_map[regno];
1903 /* If this is the virtual frame pointer, make space in current
1904 function's stack frame for the stack frame of the inline function.
1906 Copy the address of this area into a pseudo. Map
1907 virtual_stack_vars_rtx to this pseudo and set up a constant
1908 equivalence for it to be the address. This will substitute the
1909 address into insns where it can be substituted and use the new
1910 pseudo where it can't. */
1911 else if (regno == VIRTUAL_STACK_VARS_REGNUM)
1914 int size = get_func_frame_size (DECL_SAVED_INSNS (map->fndecl));
1915 #ifdef FRAME_GROWS_DOWNWARD
1917 = (DECL_SAVED_INSNS (map->fndecl)->stack_alignment_needed
1920 /* In this case, virtual_stack_vars_rtx points to one byte
1921 higher than the top of the frame area. So make sure we
1922 allocate a big enough chunk to keep the frame pointer
1923 aligned like a real one. */
1925 size = CEIL_ROUND (size, alignment);
1928 loc = assign_stack_temp (BLKmode, size, 1);
1929 loc = XEXP (loc, 0);
1930 #ifdef FRAME_GROWS_DOWNWARD
1931 /* In this case, virtual_stack_vars_rtx points to one byte
1932 higher than the top of the frame area. So compute the offset
1933 to one byte higher than our substitute frame. */
1934 loc = plus_constant (loc, size);
1936 map->reg_map[regno] = temp
1937 = force_reg (Pmode, force_operand (loc, NULL_RTX));
1939 #ifdef STACK_BOUNDARY
1940 mark_reg_pointer (map->reg_map[regno], STACK_BOUNDARY);
1943 SET_CONST_EQUIV_DATA (map, temp, loc, CONST_AGE_PARM);
1947 emit_insn_after (seq, map->insns_at_start);
1950 else if (regno == VIRTUAL_INCOMING_ARGS_REGNUM
1951 || (map->integrating
1952 && (DECL_SAVED_INSNS (map->fndecl)->internal_arg_pointer
1955 /* Do the same for a block to contain any arguments referenced
1958 int size = DECL_SAVED_INSNS (map->fndecl)->args_size;
1961 loc = assign_stack_temp (BLKmode, size, 1);
1962 loc = XEXP (loc, 0);
1963 /* When arguments grow downward, the virtual incoming
1964 args pointer points to the top of the argument block,
1965 so the remapped location better do the same. */
1966 #ifdef ARGS_GROW_DOWNWARD
1967 loc = plus_constant (loc, size);
1969 map->reg_map[regno] = temp
1970 = force_reg (Pmode, force_operand (loc, NULL_RTX));
1972 #ifdef STACK_BOUNDARY
1973 mark_reg_pointer (map->reg_map[regno], STACK_BOUNDARY);
1976 SET_CONST_EQUIV_DATA (map, temp, loc, CONST_AGE_PARM);
1980 emit_insn_after (seq, map->insns_at_start);
1983 else if (REG_FUNCTION_VALUE_P (orig))
1985 /* This is a reference to the function return value. If
1986 the function doesn't have a return value, error. If the
1987 mode doesn't agree, and it ain't BLKmode, make a SUBREG. */
1988 if (map->inline_target == 0)
1990 if (rtx_equal_function_value_matters)
1991 /* This is an ignored return value. We must not
1992 leave it in with REG_FUNCTION_VALUE_P set, since
1993 that would confuse subsequent inlining of the
1994 current function into a later function. */
1995 return gen_rtx_REG (GET_MODE (orig), regno);
1997 /* Must be unrolling loops or replicating code if we
1998 reach here, so return the register unchanged. */
2001 else if (GET_MODE (map->inline_target) != BLKmode
2002 && mode != GET_MODE (map->inline_target))
2003 return gen_lowpart (mode, map->inline_target);
2005 return map->inline_target;
2007 #if defined (LEAF_REGISTERS) && defined (LEAF_REG_REMAP)
2008 /* If leaf_renumber_regs_insn() might remap this register to
2009 some other number, make sure we don't share it with the
2010 inlined function, otherwise delayed optimization of the
2011 inlined function may change it in place, breaking our
2012 reference to it. We may still shared it within the
2013 function, so create an entry for this register in the
2015 if (map->integrating && regno < FIRST_PSEUDO_REGISTER
2016 && LEAF_REGISTERS[regno] && LEAF_REG_REMAP (regno) != regno)
2018 if (!map->leaf_reg_map[regno][mode])
2019 map->leaf_reg_map[regno][mode] = gen_rtx_REG (mode, regno);
2020 return map->leaf_reg_map[regno][mode];
2028 if (map->reg_map[regno] == NULL)
2030 map->reg_map[regno] = gen_reg_rtx (mode);
2031 REG_USERVAR_P (map->reg_map[regno]) = REG_USERVAR_P (orig);
2032 REG_LOOP_TEST_P (map->reg_map[regno]) = REG_LOOP_TEST_P (orig);
2033 RTX_UNCHANGING_P (map->reg_map[regno]) = RTX_UNCHANGING_P (orig);
2034 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
2036 if (REG_POINTER (map->x_regno_reg_rtx[regno]))
2037 mark_reg_pointer (map->reg_map[regno],
2038 map->regno_pointer_align[regno]);
2040 return map->reg_map[regno];
2043 copy = copy_rtx_and_substitute (SUBREG_REG (orig), map, for_lhs);
2044 return simplify_gen_subreg (GET_MODE (orig), copy,
2045 GET_MODE (SUBREG_REG (orig)),
2046 SUBREG_BYTE (orig));
2049 copy = gen_rtx_ADDRESSOF (mode,
2050 copy_rtx_and_substitute (XEXP (orig, 0),
2052 0, ADDRESSOF_DECL (orig));
2053 regno = ADDRESSOF_REGNO (orig);
2054 if (map->reg_map[regno])
2055 regno = REGNO (map->reg_map[regno]);
2056 else if (regno > LAST_VIRTUAL_REGISTER)
2058 temp = XEXP (orig, 0);
2059 map->reg_map[regno] = gen_reg_rtx (GET_MODE (temp));
2060 REG_USERVAR_P (map->reg_map[regno]) = REG_USERVAR_P (temp);
2061 REG_LOOP_TEST_P (map->reg_map[regno]) = REG_LOOP_TEST_P (temp);
2062 RTX_UNCHANGING_P (map->reg_map[regno]) = RTX_UNCHANGING_P (temp);
2063 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
2065 /* Objects may initially be represented as registers, but
2066 but turned into a MEM if their address is taken by
2067 put_var_into_stack. Therefore, the register table may have
2068 entries which are MEMs.
2070 We briefly tried to clear such entries, but that ended up
2071 cascading into many changes due to the optimizers not being
2072 prepared for empty entries in the register table. So we've
2073 decided to allow the MEMs in the register table for now. */
2074 if (REG_P (map->x_regno_reg_rtx[regno])
2075 && REG_POINTER (map->x_regno_reg_rtx[regno]))
2076 mark_reg_pointer (map->reg_map[regno],
2077 map->regno_pointer_align[regno]);
2078 regno = REGNO (map->reg_map[regno]);
2080 ADDRESSOF_REGNO (copy) = regno;
2085 /* USE and CLOBBER are ordinary, but we convert (use (subreg foo))
2086 to (use foo) if the original insn didn't have a subreg.
2087 Removing the subreg distorts the VAX movstrhi pattern
2088 by changing the mode of an operand. */
2089 copy = copy_rtx_and_substitute (XEXP (orig, 0), map, code == CLOBBER);
2090 if (GET_CODE (copy) == SUBREG && GET_CODE (XEXP (orig, 0)) != SUBREG)
2091 copy = SUBREG_REG (copy);
2092 return gen_rtx_fmt_e (code, VOIDmode, copy);
2094 /* We need to handle "deleted" labels that appear in the DECL_RTL
2097 if (NOTE_LINE_NUMBER (orig) != NOTE_INSN_DELETED_LABEL)
2100 /* ... FALLTHRU ... */
2102 LABEL_PRESERVE_P (get_label_from_map (map, CODE_LABEL_NUMBER (orig)))
2103 = LABEL_PRESERVE_P (orig);
2104 return get_label_from_map (map, CODE_LABEL_NUMBER (orig));
2110 LABEL_REF_NONLOCAL_P (orig) ? XEXP (orig, 0)
2111 : get_label_from_map (map, CODE_LABEL_NUMBER (XEXP (orig, 0))));
2113 LABEL_OUTSIDE_LOOP_P (copy) = LABEL_OUTSIDE_LOOP_P (orig);
2115 /* The fact that this label was previously nonlocal does not mean
2116 it still is, so we must check if it is within the range of
2117 this function's labels. */
2118 LABEL_REF_NONLOCAL_P (copy)
2119 = (LABEL_REF_NONLOCAL_P (orig)
2120 && ! (CODE_LABEL_NUMBER (XEXP (copy, 0)) >= get_first_label_num ()
2121 && CODE_LABEL_NUMBER (XEXP (copy, 0)) < max_label_num ()));
2123 /* If we have made a nonlocal label local, it means that this
2124 inlined call will be referring to our nonlocal goto handler.
2125 So make sure we create one for this block; we normally would
2126 not since this is not otherwise considered a "call". */
2127 if (LABEL_REF_NONLOCAL_P (orig) && ! LABEL_REF_NONLOCAL_P (copy))
2128 function_call_count++;
2139 /* Symbols which represent the address of a label stored in the constant
2140 pool must be modified to point to a constant pool entry for the
2141 remapped label. Otherwise, symbols are returned unchanged. */
2142 if (CONSTANT_POOL_ADDRESS_P (orig))
2144 struct function *f = inlining ? inlining : cfun;
2145 rtx constant = get_pool_constant_for_function (f, orig);
2146 enum machine_mode const_mode = get_pool_mode_for_function (f, orig);
2149 rtx temp = force_const_mem (const_mode,
2150 copy_rtx_and_substitute (constant,
2154 /* Legitimizing the address here is incorrect.
2156 Since we had a SYMBOL_REF before, we can assume it is valid
2157 to have one in this position in the insn.
2159 Also, change_address may create new registers. These
2160 registers will not have valid reg_map entries. This can
2161 cause try_constants() to fail because assumes that all
2162 registers in the rtx have valid reg_map entries, and it may
2163 end up replacing one of these new registers with junk. */
2165 if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0)))
2166 temp = change_address (temp, GET_MODE (temp), XEXP (temp, 0));
2169 temp = XEXP (temp, 0);
2171 #ifdef POINTERS_EXTEND_UNSIGNED
2172 if (GET_MODE (temp) != GET_MODE (orig))
2173 temp = convert_memory_address (GET_MODE (orig), temp);
2177 else if (GET_CODE (constant) == LABEL_REF)
2178 return XEXP (force_const_mem
2180 copy_rtx_and_substitute (constant, map, for_lhs)),
2187 /* We have to make a new copy of this CONST_DOUBLE because don't want
2188 to use the old value of CONST_DOUBLE_MEM. Also, this may be a
2189 duplicate of a CONST_DOUBLE we have already seen. */
2190 if (GET_MODE_CLASS (GET_MODE (orig)) == MODE_FLOAT)
2194 REAL_VALUE_FROM_CONST_DOUBLE (d, orig);
2195 return CONST_DOUBLE_FROM_REAL_VALUE (d, GET_MODE (orig));
2198 return immed_double_const (CONST_DOUBLE_LOW (orig),
2199 CONST_DOUBLE_HIGH (orig), VOIDmode);
2202 /* Make new constant pool entry for a constant
2203 that was in the pool of the inline function. */
2204 if (RTX_INTEGRATED_P (orig))
2209 /* If a single asm insn contains multiple output operands then
2210 it contains multiple ASM_OPERANDS rtx's that share the input
2211 and constraint vecs. We must make sure that the copied insn
2212 continues to share it. */
2213 if (map->orig_asm_operands_vector == ASM_OPERANDS_INPUT_VEC (orig))
2215 copy = rtx_alloc (ASM_OPERANDS);
2216 RTX_FLAG (copy, volatil) = RTX_FLAG (orig, volatil);
2217 PUT_MODE (copy, GET_MODE (orig));
2218 ASM_OPERANDS_TEMPLATE (copy) = ASM_OPERANDS_TEMPLATE (orig);
2219 ASM_OPERANDS_OUTPUT_CONSTRAINT (copy)
2220 = ASM_OPERANDS_OUTPUT_CONSTRAINT (orig);
2221 ASM_OPERANDS_OUTPUT_IDX (copy) = ASM_OPERANDS_OUTPUT_IDX (orig);
2222 ASM_OPERANDS_INPUT_VEC (copy) = map->copy_asm_operands_vector;
2223 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy)
2224 = map->copy_asm_constraints_vector;
2225 ASM_OPERANDS_SOURCE_FILE (copy) = ASM_OPERANDS_SOURCE_FILE (orig);
2226 ASM_OPERANDS_SOURCE_LINE (copy) = ASM_OPERANDS_SOURCE_LINE (orig);
2232 /* This is given special treatment because the first
2233 operand of a CALL is a (MEM ...) which may get
2234 forced into a register for cse. This is undesirable
2235 if function-address cse isn't wanted or if we won't do cse. */
2236 #ifndef NO_FUNCTION_CSE
2237 if (! (optimize && ! flag_no_function_cse))
2241 = gen_rtx_MEM (GET_MODE (XEXP (orig, 0)),
2242 copy_rtx_and_substitute (XEXP (XEXP (orig, 0), 0),
2245 MEM_COPY_ATTRIBUTES (copy, XEXP (orig, 0));
2248 gen_rtx_CALL (GET_MODE (orig), copy,
2249 copy_rtx_and_substitute (XEXP (orig, 1), map, 0));
2254 /* Must be ifdefed out for loop unrolling to work. */
2260 /* If this is setting fp or ap, it means that we have a nonlocal goto.
2261 Adjust the setting by the offset of the area we made.
2262 If the nonlocal goto is into the current function,
2263 this will result in unnecessarily bad code, but should work. */
2264 if (SET_DEST (orig) == virtual_stack_vars_rtx
2265 || SET_DEST (orig) == virtual_incoming_args_rtx)
2267 /* In case a translation hasn't occurred already, make one now. */
2270 HOST_WIDE_INT loc_offset;
2272 copy_rtx_and_substitute (SET_DEST (orig), map, for_lhs);
2273 equiv_reg = map->reg_map[REGNO (SET_DEST (orig))];
2274 equiv_loc = VARRAY_CONST_EQUIV (map->const_equiv_varray,
2275 REGNO (equiv_reg)).rtx;
2277 = GET_CODE (equiv_loc) == REG ? 0 : INTVAL (XEXP (equiv_loc, 1));
2279 return gen_rtx_SET (VOIDmode, SET_DEST (orig),
2282 (copy_rtx_and_substitute (SET_SRC (orig),
2288 return gen_rtx_SET (VOIDmode,
2289 copy_rtx_and_substitute (SET_DEST (orig), map, 1),
2290 copy_rtx_and_substitute (SET_SRC (orig), map, 0));
2295 && GET_CODE (XEXP (orig, 0)) == SYMBOL_REF
2296 && CONSTANT_POOL_ADDRESS_P (XEXP (orig, 0)))
2298 enum machine_mode const_mode
2299 = get_pool_mode_for_function (inlining, XEXP (orig, 0));
2301 = get_pool_constant_for_function (inlining, XEXP (orig, 0));
2303 constant = copy_rtx_and_substitute (constant, map, 0);
2305 /* If this was an address of a constant pool entry that itself
2306 had to be placed in the constant pool, it might not be a
2307 valid address. So the recursive call might have turned it
2308 into a register. In that case, it isn't a constant any
2309 more, so return it. This has the potential of changing a
2310 MEM into a REG, but we'll assume that it safe. */
2311 if (! CONSTANT_P (constant))
2314 return validize_mem (force_const_mem (const_mode, constant));
2317 copy = gen_rtx_MEM (mode, copy_rtx_and_substitute (XEXP (orig, 0),
2319 MEM_COPY_ATTRIBUTES (copy, orig);
2321 /* If inlining and this is not for the LHS, turn off RTX_UNCHANGING_P
2322 since this may be an indirect reference to a parameter and the
2323 actual may not be readonly. */
2324 if (inlining && !for_lhs)
2325 RTX_UNCHANGING_P (copy) = 0;
2333 copy = rtx_alloc (code);
2334 PUT_MODE (copy, mode);
2335 RTX_FLAG (copy, in_struct) = RTX_FLAG (orig, in_struct);
2336 RTX_FLAG (copy, volatil) = RTX_FLAG (orig, volatil);
2337 RTX_FLAG (copy, unchanging) = RTX_FLAG (orig, unchanging);
2339 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
2341 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
2343 switch (*format_ptr++)
2346 /* Copy this through the wide int field; that's safest. */
2347 X0WINT (copy, i) = X0WINT (orig, i);
2352 = copy_rtx_and_substitute (XEXP (orig, i), map, for_lhs);
2356 /* Change any references to old-insns to point to the
2357 corresponding copied insns. */
2358 XEXP (copy, i) = map->insn_map[INSN_UID (XEXP (orig, i))];
2362 XVEC (copy, i) = XVEC (orig, i);
2363 if (XVEC (orig, i) != NULL && XVECLEN (orig, i) != 0)
2365 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
2366 for (j = 0; j < XVECLEN (copy, i); j++)
2367 XVECEXP (copy, i, j)
2368 = copy_rtx_and_substitute (XVECEXP (orig, i, j),
2374 XWINT (copy, i) = XWINT (orig, i);
2378 XINT (copy, i) = XINT (orig, i);
2382 XSTR (copy, i) = XSTR (orig, i);
2386 XTREE (copy, i) = XTREE (orig, i);
2394 if (code == ASM_OPERANDS && map->orig_asm_operands_vector == 0)
2396 map->orig_asm_operands_vector = ASM_OPERANDS_INPUT_VEC (orig);
2397 map->copy_asm_operands_vector = ASM_OPERANDS_INPUT_VEC (copy);
2398 map->copy_asm_constraints_vector
2399 = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy);
2405 /* Substitute known constant values into INSN, if that is valid. */
2408 try_constants (insn, map)
2410 struct inline_remap *map;
2416 /* First try just updating addresses, then other things. This is
2417 important when we have something like the store of a constant
2418 into memory and we can update the memory address but the machine
2419 does not support a constant source. */
2420 subst_constants (&PATTERN (insn), insn, map, 1);
2421 apply_change_group ();
2422 subst_constants (&PATTERN (insn), insn, map, 0);
2423 apply_change_group ();
2425 /* Show we don't know the value of anything stored or clobbered. */
2426 note_stores (PATTERN (insn), mark_stores, NULL);
2427 map->last_pc_value = 0;
2429 map->last_cc0_value = 0;
2432 /* Set up any constant equivalences made in this insn. */
2433 for (i = 0; i < map->num_sets; i++)
2435 if (GET_CODE (map->equiv_sets[i].dest) == REG)
2437 int regno = REGNO (map->equiv_sets[i].dest);
2439 MAYBE_EXTEND_CONST_EQUIV_VARRAY (map, regno);
2440 if (VARRAY_CONST_EQUIV (map->const_equiv_varray, regno).rtx == 0
2441 /* Following clause is a hack to make case work where GNU C++
2442 reassigns a variable to make cse work right. */
2443 || ! rtx_equal_p (VARRAY_CONST_EQUIV (map->const_equiv_varray,
2445 map->equiv_sets[i].equiv))
2446 SET_CONST_EQUIV_DATA (map, map->equiv_sets[i].dest,
2447 map->equiv_sets[i].equiv, map->const_age);
2449 else if (map->equiv_sets[i].dest == pc_rtx)
2450 map->last_pc_value = map->equiv_sets[i].equiv;
2452 else if (map->equiv_sets[i].dest == cc0_rtx)
2453 map->last_cc0_value = map->equiv_sets[i].equiv;
2458 /* Substitute known constants for pseudo regs in the contents of LOC,
2459 which are part of INSN.
2460 If INSN is zero, the substitution should always be done (this is used to
2462 These changes are taken out by try_constants if the result is not valid.
2464 Note that we are more concerned with determining when the result of a SET
2465 is a constant, for further propagation, than actually inserting constants
2466 into insns; cse will do the latter task better.
2468 This function is also used to adjust address of items previously addressed
2469 via the virtual stack variable or virtual incoming arguments registers.
2471 If MEMONLY is nonzero, only make changes inside a MEM. */
2474 subst_constants (loc, insn, map, memonly)
2477 struct inline_remap *map;
2483 const char *format_ptr;
2484 int num_changes = num_validated_changes ();
2486 enum machine_mode op0_mode = MAX_MACHINE_MODE;
2488 code = GET_CODE (x);
2505 validate_change (insn, loc, map->last_cc0_value, 1);
2511 /* The only thing we can do with a USE or CLOBBER is possibly do
2512 some substitutions in a MEM within it. */
2513 if (GET_CODE (XEXP (x, 0)) == MEM)
2514 subst_constants (&XEXP (XEXP (x, 0), 0), insn, map, 0);
2518 /* Substitute for parms and known constants. Don't replace
2519 hard regs used as user variables with constants. */
2522 int regno = REGNO (x);
2523 struct const_equiv_data *p;
2525 if (! (regno < FIRST_PSEUDO_REGISTER && REG_USERVAR_P (x))
2526 && (size_t) regno < VARRAY_SIZE (map->const_equiv_varray)
2527 && (p = &VARRAY_CONST_EQUIV (map->const_equiv_varray, regno),
2529 && p->age >= map->const_age)
2530 validate_change (insn, loc, p->rtx, 1);
2535 /* SUBREG applied to something other than a reg
2536 should be treated as ordinary, since that must
2537 be a special hack and we don't know how to treat it specially.
2538 Consider for example mulsidi3 in m68k.md.
2539 Ordinary SUBREG of a REG needs this special treatment. */
2540 if (! memonly && GET_CODE (SUBREG_REG (x)) == REG)
2542 rtx inner = SUBREG_REG (x);
2545 /* We can't call subst_constants on &SUBREG_REG (x) because any
2546 constant or SUBREG wouldn't be valid inside our SUBEG. Instead,
2547 see what is inside, try to form the new SUBREG and see if that is
2548 valid. We handle two cases: extracting a full word in an
2549 integral mode and extracting the low part. */
2550 subst_constants (&inner, NULL_RTX, map, 0);
2551 new = simplify_gen_subreg (GET_MODE (x), inner,
2552 GET_MODE (SUBREG_REG (x)),
2556 validate_change (insn, loc, new, 1);
2558 cancel_changes (num_changes);
2565 subst_constants (&XEXP (x, 0), insn, map, 0);
2567 /* If a memory address got spoiled, change it back. */
2568 if (! memonly && insn != 0 && num_validated_changes () != num_changes
2569 && ! memory_address_p (GET_MODE (x), XEXP (x, 0)))
2570 cancel_changes (num_changes);
2575 /* Substitute constants in our source, and in any arguments to a
2576 complex (e..g, ZERO_EXTRACT) destination, but not in the destination
2578 rtx *dest_loc = &SET_DEST (x);
2579 rtx dest = *dest_loc;
2581 enum machine_mode compare_mode = VOIDmode;
2583 /* If SET_SRC is a COMPARE which subst_constants would turn into
2584 COMPARE of 2 VOIDmode constants, note the mode in which comparison
2586 if (GET_CODE (SET_SRC (x)) == COMPARE)
2589 if (GET_MODE_CLASS (GET_MODE (src)) == MODE_CC
2595 compare_mode = GET_MODE (XEXP (src, 0));
2596 if (compare_mode == VOIDmode)
2597 compare_mode = GET_MODE (XEXP (src, 1));
2601 subst_constants (&SET_SRC (x), insn, map, memonly);
2604 while (GET_CODE (*dest_loc) == ZERO_EXTRACT
2605 || GET_CODE (*dest_loc) == SUBREG
2606 || GET_CODE (*dest_loc) == STRICT_LOW_PART)
2608 if (GET_CODE (*dest_loc) == ZERO_EXTRACT)
2610 subst_constants (&XEXP (*dest_loc, 1), insn, map, memonly);
2611 subst_constants (&XEXP (*dest_loc, 2), insn, map, memonly);
2613 dest_loc = &XEXP (*dest_loc, 0);
2616 /* Do substitute in the address of a destination in memory. */
2617 if (GET_CODE (*dest_loc) == MEM)
2618 subst_constants (&XEXP (*dest_loc, 0), insn, map, 0);
2620 /* Check for the case of DEST a SUBREG, both it and the underlying
2621 register are less than one word, and the SUBREG has the wider mode.
2622 In the case, we are really setting the underlying register to the
2623 source converted to the mode of DEST. So indicate that. */
2624 if (GET_CODE (dest) == SUBREG
2625 && GET_MODE_SIZE (GET_MODE (dest)) <= UNITS_PER_WORD
2626 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest))) <= UNITS_PER_WORD
2627 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest)))
2628 <= GET_MODE_SIZE (GET_MODE (dest)))
2629 && (tem = gen_lowpart_if_possible (GET_MODE (SUBREG_REG (dest)),
2631 src = tem, dest = SUBREG_REG (dest);
2633 /* If storing a recognizable value save it for later recording. */
2634 if ((map->num_sets < MAX_RECOG_OPERANDS)
2635 && (CONSTANT_P (src)
2636 || (GET_CODE (src) == REG
2637 && (REGNO (src) == VIRTUAL_INCOMING_ARGS_REGNUM
2638 || REGNO (src) == VIRTUAL_STACK_VARS_REGNUM))
2639 || (GET_CODE (src) == PLUS
2640 && GET_CODE (XEXP (src, 0)) == REG
2641 && (REGNO (XEXP (src, 0)) == VIRTUAL_INCOMING_ARGS_REGNUM
2642 || REGNO (XEXP (src, 0)) == VIRTUAL_STACK_VARS_REGNUM)
2643 && CONSTANT_P (XEXP (src, 1)))
2644 || GET_CODE (src) == COMPARE
2649 && (src == pc_rtx || GET_CODE (src) == RETURN
2650 || GET_CODE (src) == LABEL_REF))))
2652 /* Normally, this copy won't do anything. But, if SRC is a COMPARE
2653 it will cause us to save the COMPARE with any constants
2654 substituted, which is what we want for later. */
2655 rtx src_copy = copy_rtx (src);
2656 map->equiv_sets[map->num_sets].equiv = src_copy;
2657 map->equiv_sets[map->num_sets++].dest = dest;
2658 if (compare_mode != VOIDmode
2659 && GET_CODE (src) == COMPARE
2660 && (GET_MODE_CLASS (GET_MODE (src)) == MODE_CC
2665 && GET_MODE (XEXP (src, 0)) == VOIDmode
2666 && GET_MODE (XEXP (src, 1)) == VOIDmode)
2668 map->compare_src = src_copy;
2669 map->compare_mode = compare_mode;
2679 format_ptr = GET_RTX_FORMAT (code);
2681 /* If the first operand is an expression, save its mode for later. */
2682 if (*format_ptr == 'e')
2683 op0_mode = GET_MODE (XEXP (x, 0));
2685 for (i = 0; i < GET_RTX_LENGTH (code); i++)
2687 switch (*format_ptr++)
2694 subst_constants (&XEXP (x, i), insn, map, memonly);
2707 if (XVEC (x, i) != NULL && XVECLEN (x, i) != 0)
2708 for (j = 0; j < XVECLEN (x, i); j++)
2709 subst_constants (&XVECEXP (x, i, j), insn, map, memonly);
2718 /* If this is a commutative operation, move a constant to the second
2719 operand unless the second operand is already a CONST_INT. */
2721 && (GET_RTX_CLASS (code) == 'c' || code == NE || code == EQ)
2722 && CONSTANT_P (XEXP (x, 0)) && GET_CODE (XEXP (x, 1)) != CONST_INT)
2724 rtx tem = XEXP (x, 0);
2725 validate_change (insn, &XEXP (x, 0), XEXP (x, 1), 1);
2726 validate_change (insn, &XEXP (x, 1), tem, 1);
2729 /* Simplify the expression in case we put in some constants. */
2731 switch (GET_RTX_CLASS (code))
2734 if (op0_mode == MAX_MACHINE_MODE)
2736 new = simplify_unary_operation (code, GET_MODE (x),
2737 XEXP (x, 0), op0_mode);
2742 enum machine_mode op_mode = GET_MODE (XEXP (x, 0));
2744 if (op_mode == VOIDmode)
2745 op_mode = GET_MODE (XEXP (x, 1));
2746 new = simplify_relational_operation (code, op_mode,
2747 XEXP (x, 0), XEXP (x, 1));
2748 #ifdef FLOAT_STORE_FLAG_VALUE
2749 if (new != 0 && GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT)
2751 enum machine_mode mode = GET_MODE (x);
2752 if (new == const0_rtx)
2753 new = CONST0_RTX (mode);
2756 REAL_VALUE_TYPE val;
2758 /* Avoid automatic aggregate initialization. */
2759 val = FLOAT_STORE_FLAG_VALUE (mode);
2760 new = CONST_DOUBLE_FROM_REAL_VALUE (val, mode);
2769 new = simplify_binary_operation (code, GET_MODE (x),
2770 XEXP (x, 0), XEXP (x, 1));
2775 if (op0_mode == MAX_MACHINE_MODE)
2778 if (code == IF_THEN_ELSE)
2780 rtx op0 = XEXP (x, 0);
2782 if (GET_RTX_CLASS (GET_CODE (op0)) == '<'
2783 && GET_MODE (op0) == VOIDmode
2784 && ! side_effects_p (op0)
2785 && XEXP (op0, 0) == map->compare_src
2786 && GET_MODE (XEXP (op0, 1)) == VOIDmode)
2788 /* We have compare of two VOIDmode constants for which
2789 we recorded the comparison mode. */
2791 simplify_relational_operation (GET_CODE (op0),
2796 if (temp == const0_rtx)
2798 else if (temp == const1_rtx)
2803 new = simplify_ternary_operation (code, GET_MODE (x), op0_mode,
2804 XEXP (x, 0), XEXP (x, 1),
2810 validate_change (insn, loc, new, 1);
2813 /* Show that register modified no longer contain known constants. We are
2814 called from note_stores with parts of the new insn. */
2817 mark_stores (dest, x, data)
2819 rtx x ATTRIBUTE_UNUSED;
2820 void *data ATTRIBUTE_UNUSED;
2823 enum machine_mode mode = VOIDmode;
2825 /* DEST is always the innermost thing set, except in the case of
2826 SUBREGs of hard registers. */
2828 if (GET_CODE (dest) == REG)
2829 regno = REGNO (dest), mode = GET_MODE (dest);
2830 else if (GET_CODE (dest) == SUBREG && GET_CODE (SUBREG_REG (dest)) == REG)
2832 regno = REGNO (SUBREG_REG (dest));
2833 if (regno < FIRST_PSEUDO_REGISTER)
2834 regno += subreg_regno_offset (REGNO (SUBREG_REG (dest)),
2835 GET_MODE (SUBREG_REG (dest)),
2838 mode = GET_MODE (SUBREG_REG (dest));
2843 unsigned int uregno = regno;
2844 unsigned int last_reg = (uregno >= FIRST_PSEUDO_REGISTER ? uregno
2845 : uregno + HARD_REGNO_NREGS (uregno, mode) - 1);
2848 /* Ignore virtual stack var or virtual arg register since those
2849 are handled separately. */
2850 if (uregno != VIRTUAL_INCOMING_ARGS_REGNUM
2851 && uregno != VIRTUAL_STACK_VARS_REGNUM)
2852 for (i = uregno; i <= last_reg; i++)
2853 if ((size_t) i < VARRAY_SIZE (global_const_equiv_varray))
2854 VARRAY_CONST_EQUIV (global_const_equiv_varray, i).rtx = 0;
2858 /* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the
2859 given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so
2860 that it points to the node itself, thus indicating that the node is its
2861 own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for
2862 the given node is NULL, recursively descend the decl/block tree which
2863 it is the root of, and for each other ..._DECL or BLOCK node contained
2864 therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also
2865 still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN
2866 values to point to themselves. */
2869 set_block_origin_self (stmt)
2872 if (BLOCK_ABSTRACT_ORIGIN (stmt) == NULL_TREE)
2874 BLOCK_ABSTRACT_ORIGIN (stmt) = stmt;
2879 for (local_decl = BLOCK_VARS (stmt);
2880 local_decl != NULL_TREE;
2881 local_decl = TREE_CHAIN (local_decl))
2882 set_decl_origin_self (local_decl); /* Potential recursion. */
2888 for (subblock = BLOCK_SUBBLOCKS (stmt);
2889 subblock != NULL_TREE;
2890 subblock = BLOCK_CHAIN (subblock))
2891 set_block_origin_self (subblock); /* Recurse. */
2896 /* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for
2897 the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the
2898 node to so that it points to the node itself, thus indicating that the
2899 node represents its own (abstract) origin. Additionally, if the
2900 DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend
2901 the decl/block tree of which the given node is the root of, and for
2902 each other ..._DECL or BLOCK node contained therein whose
2903 DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL,
2904 set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to
2905 point to themselves. */
2908 set_decl_origin_self (decl)
2911 if (DECL_ABSTRACT_ORIGIN (decl) == NULL_TREE)
2913 DECL_ABSTRACT_ORIGIN (decl) = decl;
2914 if (TREE_CODE (decl) == FUNCTION_DECL)
2918 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2919 DECL_ABSTRACT_ORIGIN (arg) = arg;
2920 if (DECL_INITIAL (decl) != NULL_TREE
2921 && DECL_INITIAL (decl) != error_mark_node)
2922 set_block_origin_self (DECL_INITIAL (decl));
2927 /* Given a pointer to some BLOCK node, and a boolean value to set the
2928 "abstract" flags to, set that value into the BLOCK_ABSTRACT flag for
2929 the given block, and for all local decls and all local sub-blocks
2930 (recursively) which are contained therein. */
2933 set_block_abstract_flags (stmt, setting)
2940 BLOCK_ABSTRACT (stmt) = setting;
2942 for (local_decl = BLOCK_VARS (stmt);
2943 local_decl != NULL_TREE;
2944 local_decl = TREE_CHAIN (local_decl))
2945 set_decl_abstract_flags (local_decl, setting);
2947 for (subblock = BLOCK_SUBBLOCKS (stmt);
2948 subblock != NULL_TREE;
2949 subblock = BLOCK_CHAIN (subblock))
2950 set_block_abstract_flags (subblock, setting);
2953 /* Given a pointer to some ..._DECL node, and a boolean value to set the
2954 "abstract" flags to, set that value into the DECL_ABSTRACT flag for the
2955 given decl, and (in the case where the decl is a FUNCTION_DECL) also
2956 set the abstract flags for all of the parameters, local vars, local
2957 blocks and sub-blocks (recursively) to the same setting. */
2960 set_decl_abstract_flags (decl, setting)
2964 DECL_ABSTRACT (decl) = setting;
2965 if (TREE_CODE (decl) == FUNCTION_DECL)
2969 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2970 DECL_ABSTRACT (arg) = setting;
2971 if (DECL_INITIAL (decl) != NULL_TREE
2972 && DECL_INITIAL (decl) != error_mark_node)
2973 set_block_abstract_flags (DECL_INITIAL (decl), setting);
2977 /* Output the assembly language code for the function FNDECL
2978 from its DECL_SAVED_INSNS. Used for inline functions that are output
2979 at end of compilation instead of where they came in the source. */
2982 output_inline_function (fndecl)
2985 struct function *old_cfun = cfun;
2986 enum debug_info_type old_write_symbols = write_symbols;
2987 const struct gcc_debug_hooks *const old_debug_hooks = debug_hooks;
2988 struct function *f = DECL_SAVED_INSNS (fndecl);
2991 current_function_decl = fndecl;
2993 set_new_last_label_num (f->inl_max_label_num);
2995 /* We're not deferring this any longer. */
2996 DECL_DEFER_OUTPUT (fndecl) = 0;
2998 /* If requested, suppress debugging information. */
2999 if (f->no_debugging_symbols)
3001 write_symbols = NO_DEBUG;
3002 debug_hooks = &do_nothing_debug_hooks;
3005 /* Compile this function all the way down to assembly code. As a
3006 side effect this destroys the saved RTL representation, but
3007 that's okay, because we don't need to inline this anymore. */
3008 rest_of_compilation (fndecl);
3009 DECL_INLINE (fndecl) = 0;
3012 current_function_decl = old_cfun ? old_cfun->decl : 0;
3013 write_symbols = old_write_symbols;
3014 debug_hooks = old_debug_hooks;
3018 /* Functions to keep track of the values hard regs had at the start of
3022 get_hard_reg_initial_reg (fun, reg)
3023 struct function *fun;
3026 struct initial_value_struct *ivs = fun->hard_reg_initial_vals;
3032 for (i = 0; i < ivs->num_entries; i++)
3033 if (rtx_equal_p (ivs->entries[i].pseudo, reg))
3034 return ivs->entries[i].hard_reg;
3040 has_func_hard_reg_initial_val (fun, reg)
3041 struct function *fun;
3044 struct initial_value_struct *ivs = fun->hard_reg_initial_vals;
3050 for (i = 0; i < ivs->num_entries; i++)
3051 if (rtx_equal_p (ivs->entries[i].hard_reg, reg))
3052 return ivs->entries[i].pseudo;
3058 get_func_hard_reg_initial_val (fun, reg)
3059 struct function *fun;
3062 struct initial_value_struct *ivs = fun->hard_reg_initial_vals;
3063 rtx rv = has_func_hard_reg_initial_val (fun, reg);
3070 fun->hard_reg_initial_vals = (void *) ggc_alloc (sizeof (initial_value_struct));
3071 ivs = fun->hard_reg_initial_vals;
3072 ivs->num_entries = 0;
3073 ivs->max_entries = 5;
3074 ivs->entries = (initial_value_pair *) ggc_alloc (5 * sizeof (initial_value_pair));
3077 if (ivs->num_entries >= ivs->max_entries)
3079 ivs->max_entries += 5;
3081 (initial_value_pair *) ggc_realloc (ivs->entries,
3083 * sizeof (initial_value_pair));
3086 ivs->entries[ivs->num_entries].hard_reg = reg;
3087 ivs->entries[ivs->num_entries].pseudo = gen_reg_rtx (GET_MODE (reg));
3089 return ivs->entries[ivs->num_entries++].pseudo;
3093 get_hard_reg_initial_val (mode, regno)
3094 enum machine_mode mode;
3097 return get_func_hard_reg_initial_val (cfun, gen_rtx_REG (mode, regno));
3101 has_hard_reg_initial_val (mode, regno)
3102 enum machine_mode mode;
3105 return has_func_hard_reg_initial_val (cfun, gen_rtx_REG (mode, regno));
3109 setup_initial_hard_reg_value_integration (inl_f, remap)
3110 struct function *inl_f;
3111 struct inline_remap *remap;
3113 struct initial_value_struct *ivs = inl_f->hard_reg_initial_vals;
3119 for (i = 0; i < ivs->num_entries; i ++)
3120 remap->reg_map[REGNO (ivs->entries[i].pseudo)]
3121 = get_func_hard_reg_initial_val (cfun, ivs->entries[i].hard_reg);
3126 emit_initial_value_sets ()
3128 struct initial_value_struct *ivs = cfun->hard_reg_initial_vals;
3136 for (i = 0; i < ivs->num_entries; i++)
3137 emit_move_insn (ivs->entries[i].pseudo, ivs->entries[i].hard_reg);
3141 emit_insn_after (seq, get_insns ());
3144 /* If the backend knows where to allocate pseudos for hard
3145 register initial values, register these allocations now. */
3147 allocate_initial_values (reg_equiv_memory_loc)
3148 rtx *reg_equiv_memory_loc ATTRIBUTE_UNUSED;
3150 #ifdef ALLOCATE_INITIAL_VALUE
3151 struct initial_value_struct *ivs = cfun->hard_reg_initial_vals;
3157 for (i = 0; i < ivs->num_entries; i++)
3159 int regno = REGNO (ivs->entries[i].pseudo);
3160 rtx x = ALLOCATE_INITIAL_VALUE (ivs->entries[i].hard_reg);
3162 if (x == NULL_RTX || REG_N_SETS (REGNO (ivs->entries[i].pseudo)) > 1)
3164 else if (GET_CODE (x) == MEM)
3165 reg_equiv_memory_loc[regno] = x;
3166 else if (GET_CODE (x) == REG)
3168 reg_renumber[regno] = REGNO (x);
3169 /* Poke the regno right into regno_reg_rtx
3170 so that even fixed regs are accepted. */
3171 REGNO (ivs->entries[i].pseudo) = REGNO (x);
3178 #include "gt-integrate.h"