1 /* Procedure integration for GNU CC.
2 Copyright (C) 1988, 1991, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
32 #include "insn-config.h"
33 #include "insn-flags.h"
37 #include "integrate.h"
46 #define obstack_chunk_alloc xmalloc
47 #define obstack_chunk_free free
49 extern struct obstack
*function_maybepermanent_obstack
;
51 /* Similar, but round to the next highest integer that meets the
53 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
55 /* Default max number of insns a function can have and still be inline.
56 This is overridden on RISC machines. */
57 #ifndef INTEGRATE_THRESHOLD
58 /* Inlining small functions might save more space then not inlining at
59 all. Assume 1 instruction for the call and 1.5 insns per argument. */
60 #define INTEGRATE_THRESHOLD(DECL) \
62 ? (1 + (3 * list_length (DECL_ARGUMENTS (DECL))) / 2) \
63 : (8 * (8 + list_length (DECL_ARGUMENTS (DECL)))))
66 /* Decide whether a function with a target specific attribute
67 attached can be inlined. By default we disallow this. */
68 #ifndef FUNCTION_ATTRIBUTE_INLINABLE_P
69 #define FUNCTION_ATTRIBUTE_INLINABLE_P(FNDECL) 0
72 static rtvec initialize_for_inline
PARAMS ((tree
));
73 static void note_modified_parmregs
PARAMS ((rtx
, rtx
, void *));
74 static void integrate_parm_decls
PARAMS ((tree
, struct inline_remap
*,
76 static tree integrate_decl_tree
PARAMS ((tree
,
77 struct inline_remap
*));
78 static void subst_constants
PARAMS ((rtx
*, rtx
,
79 struct inline_remap
*, int));
80 static void set_block_origin_self
PARAMS ((tree
));
81 static void set_block_abstract_flags
PARAMS ((tree
, int));
82 static void process_reg_param
PARAMS ((struct inline_remap
*, rtx
,
84 void set_decl_abstract_flags
PARAMS ((tree
, int));
85 static rtx expand_inline_function_eh_labelmap
PARAMS ((rtx
));
86 static void mark_stores
PARAMS ((rtx
, rtx
, void *));
87 static void save_parm_insns
PARAMS ((rtx
, rtx
));
88 static void copy_insn_list
PARAMS ((rtx
, struct inline_remap
*,
90 static int compare_blocks
PARAMS ((const PTR
, const PTR
));
91 static int find_block
PARAMS ((const PTR
, const PTR
));
93 /* The maximum number of instructions accepted for inlining a
94 function. Increasing values mean more agressive inlining.
95 This affects currently only functions explicitly marked as
96 inline (or methods defined within the class definition for C++).
97 The default value of 10000 is arbitrary but high to match the
98 previously unlimited gcc capabilities. */
100 int inline_max_insns
= 10000;
102 /* Used by copy_rtx_and_substitute; this indicates whether the function is
103 called for the purpose of inlining or some other purpose (i.e. loop
104 unrolling). This affects how constant pool references are handled.
105 This variable contains the FUNCTION_DECL for the inlined function. */
106 static struct function
*inlining
= 0;
108 /* Returns the Ith entry in the label_map contained in MAP. If the
109 Ith entry has not yet been set, return a fresh label. This function
110 performs a lazy initialization of label_map, thereby avoiding huge memory
111 explosions when the label_map gets very large. */
114 get_label_from_map (map
, i
)
115 struct inline_remap
*map
;
118 rtx x
= map
->label_map
[i
];
121 x
= map
->label_map
[i
] = gen_label_rtx();
126 /* Zero if the current function (whose FUNCTION_DECL is FNDECL)
127 is safe and reasonable to integrate into other functions.
128 Nonzero means value is a warning msgid with a single %s
129 for the function's name. */
132 function_cannot_inline_p (fndecl
)
133 register tree fndecl
;
136 tree last
= tree_last (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
138 /* For functions marked as inline increase the maximum size to
139 inline_max_insns (-finline-limit-<n>). For regular functions
140 use the limit given by INTEGRATE_THRESHOLD. */
142 int max_insns
= (DECL_INLINE (fndecl
))
144 + 8 * list_length (DECL_ARGUMENTS (fndecl
)))
145 : INTEGRATE_THRESHOLD (fndecl
);
147 register int ninsns
= 0;
151 /* No inlines with varargs. */
152 if ((last
&& TREE_VALUE (last
) != void_type_node
)
153 || current_function_varargs
)
154 return N_("varargs function cannot be inline");
156 if (current_function_calls_alloca
)
157 return N_("function using alloca cannot be inline");
159 if (current_function_calls_setjmp
)
160 return N_("function using setjmp cannot be inline");
162 if (current_function_contains_functions
)
163 return N_("function with nested functions cannot be inline");
167 N_("function with label addresses used in initializers cannot inline");
169 if (current_function_cannot_inline
)
170 return current_function_cannot_inline
;
172 /* If its not even close, don't even look. */
173 if (get_max_uid () > 3 * max_insns
)
174 return N_("function too large to be inline");
177 /* Don't inline functions which do not specify a function prototype and
178 have BLKmode argument or take the address of a parameter. */
179 for (parms
= DECL_ARGUMENTS (fndecl
); parms
; parms
= TREE_CHAIN (parms
))
181 if (TYPE_MODE (TREE_TYPE (parms
)) == BLKmode
)
182 TREE_ADDRESSABLE (parms
) = 1;
183 if (last
== NULL_TREE
&& TREE_ADDRESSABLE (parms
))
184 return N_("no prototype, and parameter address used; cannot be inline");
188 /* We can't inline functions that return structures
189 the old-fashioned PCC way, copying into a static block. */
190 if (current_function_returns_pcc_struct
)
191 return N_("inline functions not supported for this return value type");
193 /* We can't inline functions that return structures of varying size. */
194 if (TREE_CODE (TREE_TYPE (TREE_TYPE (fndecl
))) != VOID_TYPE
195 && int_size_in_bytes (TREE_TYPE (TREE_TYPE (fndecl
))) < 0)
196 return N_("function with varying-size return value cannot be inline");
198 /* Cannot inline a function with a varying size argument or one that
199 receives a transparent union. */
200 for (parms
= DECL_ARGUMENTS (fndecl
); parms
; parms
= TREE_CHAIN (parms
))
202 if (int_size_in_bytes (TREE_TYPE (parms
)) < 0)
203 return N_("function with varying-size parameter cannot be inline");
204 else if (TYPE_TRANSPARENT_UNION (TREE_TYPE (parms
)))
205 return N_("function with transparent unit parameter cannot be inline");
208 if (get_max_uid () > max_insns
)
210 for (ninsns
= 0, insn
= get_first_nonparm_insn ();
211 insn
&& ninsns
< max_insns
;
212 insn
= NEXT_INSN (insn
))
213 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
216 if (ninsns
>= max_insns
)
217 return N_("function too large to be inline");
220 /* We will not inline a function which uses computed goto. The addresses of
221 its local labels, which may be tucked into global storage, are of course
222 not constant across instantiations, which causes unexpected behaviour. */
223 if (current_function_has_computed_jump
)
224 return N_("function with computed jump cannot inline");
226 /* We cannot inline a nested function that jumps to a nonlocal label. */
227 if (current_function_has_nonlocal_goto
)
228 return N_("function with nonlocal goto cannot be inline");
230 /* This is a hack, until the inliner is taught about eh regions at
231 the start of the function. */
232 for (insn
= get_insns ();
234 && ! (GET_CODE (insn
) == NOTE
235 && NOTE_LINE_NUMBER (insn
) == NOTE_INSN_FUNCTION_BEG
);
236 insn
= NEXT_INSN (insn
))
238 if (insn
&& GET_CODE (insn
) == NOTE
239 && NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EH_REGION_BEG
)
240 return N_("function with complex parameters cannot be inline");
243 /* We can't inline functions that return a PARALLEL rtx. */
244 result
= DECL_RTL (DECL_RESULT (fndecl
));
245 if (result
&& GET_CODE (result
) == PARALLEL
)
246 return N_("inline functions not supported for this return value type");
248 /* If the function has a target specific attribute attached to it,
249 then we assume that we should not inline it. This can be overriden
250 by the target if it defines FUNCTION_ATTRIBUTE_INLINABLE_P. */
251 if (DECL_MACHINE_ATTRIBUTES (fndecl
)
252 && ! FUNCTION_ATTRIBUTE_INLINABLE_P (fndecl
))
253 return N_("function with target specific attribute(s) cannot be inlined");
258 /* Map pseudo reg number into the PARM_DECL for the parm living in the reg.
259 Zero for a reg that isn't a parm's home.
260 Only reg numbers less than max_parm_reg are mapped here. */
261 static tree
*parmdecl_map
;
263 /* In save_for_inline, nonzero if past the parm-initialization insns. */
264 static int in_nonparm_insns
;
266 /* Subroutine for `save_for_inline_nocopy'. Performs initialization
267 needed to save FNDECL's insns and info for future inline expansion. */
270 initialize_for_inline (fndecl
)
277 /* Clear out PARMDECL_MAP. It was allocated in the caller's frame. */
278 bzero ((char *) parmdecl_map
, max_parm_reg
* sizeof (tree
));
279 arg_vector
= rtvec_alloc (list_length (DECL_ARGUMENTS (fndecl
)));
281 for (parms
= DECL_ARGUMENTS (fndecl
), i
= 0;
283 parms
= TREE_CHAIN (parms
), i
++)
285 rtx p
= DECL_RTL (parms
);
287 /* If we have (mem (addressof (mem ...))), use the inner MEM since
288 otherwise the copy_rtx call below will not unshare the MEM since
289 it shares ADDRESSOF. */
290 if (GET_CODE (p
) == MEM
&& GET_CODE (XEXP (p
, 0)) == ADDRESSOF
291 && GET_CODE (XEXP (XEXP (p
, 0), 0)) == MEM
)
292 p
= XEXP (XEXP (p
, 0), 0);
294 RTVEC_ELT (arg_vector
, i
) = p
;
296 if (GET_CODE (p
) == REG
)
297 parmdecl_map
[REGNO (p
)] = parms
;
298 else if (GET_CODE (p
) == CONCAT
)
300 rtx preal
= gen_realpart (GET_MODE (XEXP (p
, 0)), p
);
301 rtx pimag
= gen_imagpart (GET_MODE (preal
), p
);
303 if (GET_CODE (preal
) == REG
)
304 parmdecl_map
[REGNO (preal
)] = parms
;
305 if (GET_CODE (pimag
) == REG
)
306 parmdecl_map
[REGNO (pimag
)] = parms
;
309 /* This flag is cleared later
310 if the function ever modifies the value of the parm. */
311 TREE_READONLY (parms
) = 1;
317 /* Copy NODE (which must be a DECL, but not a PARM_DECL). The DECL
318 originally was in the FROM_FN, but now it will be in the
322 copy_decl_for_inlining (decl
, from_fn
, to_fn
)
329 /* Copy the declaration. */
330 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
332 /* For a parameter, we must make an equivalent VAR_DECL, not a
334 copy
= build_decl (VAR_DECL
, DECL_NAME (decl
), TREE_TYPE (decl
));
335 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
336 TREE_READONLY (copy
) = TREE_READONLY (decl
);
337 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
341 copy
= copy_node (decl
);
342 if (DECL_LANG_SPECIFIC (copy
))
343 copy_lang_decl (copy
);
345 /* TREE_ADDRESSABLE isn't used to indicate that a label's
346 address has been taken; it's for internal bookkeeping in
347 expand_goto_internal. */
348 if (TREE_CODE (copy
) == LABEL_DECL
)
349 TREE_ADDRESSABLE (copy
) = 0;
352 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
353 declaration inspired this copy. */
354 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
356 /* The new variable/label has no RTL, yet. */
357 DECL_RTL (copy
) = NULL_RTX
;
359 /* These args would always appear unused, if not for this. */
360 TREE_USED (copy
) = 1;
362 /* Set the context for the new declaration. */
363 if (!DECL_CONTEXT (decl
))
364 /* Globals stay global. */
366 else if (DECL_CONTEXT (decl
) != from_fn
)
367 /* Things that weren't in the scope of the function we're inlining
368 from aren't in the scope we're inlining too, either. */
370 else if (TREE_STATIC (decl
))
371 /* Function-scoped static variables should say in the original
375 /* Ordinary automatic local variables are now in the scope of the
377 DECL_CONTEXT (copy
) = to_fn
;
382 /* Make the insns and PARM_DECLs of the current function permanent
383 and record other information in DECL_SAVED_INSNS to allow inlining
384 of this function in subsequent calls.
386 This routine need not copy any insns because we are not going
387 to immediately compile the insns in the insn chain. There
388 are two cases when we would compile the insns for FNDECL:
389 (1) when FNDECL is expanded inline, and (2) when FNDECL needs to
390 be output at the end of other compilation, because somebody took
391 its address. In the first case, the insns of FNDECL are copied
392 as it is expanded inline, so FNDECL's saved insns are not
393 modified. In the second case, FNDECL is used for the last time,
394 so modifying the rtl is not a problem.
396 We don't have to worry about FNDECL being inline expanded by
397 other functions which are written at the end of compilation
398 because flag_no_inline is turned on when we begin writing
399 functions at the end of compilation. */
402 save_for_inline_nocopy (fndecl
)
407 rtx first_nonparm_insn
;
409 /* Set up PARMDECL_MAP which maps pseudo-reg number to its PARM_DECL.
410 Later we set TREE_READONLY to 0 if the parm is modified inside the fn.
411 Also set up ARG_VECTOR, which holds the unmodified DECL_RTX values
412 for the parms, prior to elimination of virtual registers.
413 These values are needed for substituting parms properly. */
415 parmdecl_map
= (tree
*) xmalloc (max_parm_reg
* sizeof (tree
));
417 /* Make and emit a return-label if we have not already done so. */
419 if (return_label
== 0)
421 return_label
= gen_label_rtx ();
422 emit_label (return_label
);
425 argvec
= initialize_for_inline (fndecl
);
427 /* If there are insns that copy parms from the stack into pseudo registers,
428 those insns are not copied. `expand_inline_function' must
429 emit the correct code to handle such things. */
432 if (GET_CODE (insn
) != NOTE
)
435 /* Get the insn which signals the end of parameter setup code. */
436 first_nonparm_insn
= get_first_nonparm_insn ();
438 /* Now just scan the chain of insns to see what happens to our
439 PARM_DECLs. If a PARM_DECL is used but never modified, we
440 can substitute its rtl directly when expanding inline (and
441 perform constant folding when its incoming value is constant).
442 Otherwise, we have to copy its value into a new register and track
443 the new register's life. */
444 in_nonparm_insns
= 0;
445 save_parm_insns (insn
, first_nonparm_insn
);
447 /* We have now allocated all that needs to be allocated permanently
448 on the rtx obstack. Set our high-water mark, so that we
449 can free the rest of this when the time comes. */
453 cfun
->inl_max_label_num
= max_label_num ();
454 cfun
->inl_last_parm_insn
= cfun
->x_last_parm_insn
;
455 cfun
->original_arg_vector
= argvec
;
456 cfun
->original_decl_initial
= DECL_INITIAL (fndecl
);
457 DECL_SAVED_INSNS (fndecl
) = cfun
;
463 /* Scan the chain of insns to see what happens to our PARM_DECLs. If a
464 PARM_DECL is used but never modified, we can substitute its rtl directly
465 when expanding inline (and perform constant folding when its incoming
466 value is constant). Otherwise, we have to copy its value into a new
467 register and track the new register's life. */
470 save_parm_insns (insn
, first_nonparm_insn
)
472 rtx first_nonparm_insn
;
474 if (insn
== NULL_RTX
)
477 for (insn
= NEXT_INSN (insn
); insn
; insn
= NEXT_INSN (insn
))
479 if (insn
== first_nonparm_insn
)
480 in_nonparm_insns
= 1;
482 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i')
484 /* Record what interesting things happen to our parameters. */
485 note_stores (PATTERN (insn
), note_modified_parmregs
, NULL
);
487 /* If this is a CALL_PLACEHOLDER insn then we need to look into the
488 three attached sequences: normal call, sibling call and tail
490 if (GET_CODE (insn
) == CALL_INSN
491 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
495 for (i
= 0; i
< 3; i
++)
496 save_parm_insns (XEXP (PATTERN (insn
), i
),
503 /* Note whether a parameter is modified or not. */
506 note_modified_parmregs (reg
, x
, data
)
508 rtx x ATTRIBUTE_UNUSED
;
509 void *data ATTRIBUTE_UNUSED
;
511 if (GET_CODE (reg
) == REG
&& in_nonparm_insns
512 && REGNO (reg
) < max_parm_reg
513 && REGNO (reg
) >= FIRST_PSEUDO_REGISTER
514 && parmdecl_map
[REGNO (reg
)] != 0)
515 TREE_READONLY (parmdecl_map
[REGNO (reg
)]) = 0;
518 /* Unfortunately, we need a global copy of const_equiv map for communication
519 with a function called from note_stores. Be *very* careful that this
520 is used properly in the presence of recursion. */
522 varray_type global_const_equiv_varray
;
524 #define FIXED_BASE_PLUS_P(X) \
525 (GET_CODE (X) == PLUS && GET_CODE (XEXP (X, 1)) == CONST_INT \
526 && GET_CODE (XEXP (X, 0)) == REG \
527 && REGNO (XEXP (X, 0)) >= FIRST_VIRTUAL_REGISTER \
528 && REGNO (XEXP (X, 0)) <= LAST_VIRTUAL_REGISTER)
530 /* Called to set up a mapping for the case where a parameter is in a
531 register. If it is read-only and our argument is a constant, set up the
532 constant equivalence.
534 If LOC is REG_USERVAR_P, the usual case, COPY must also have that flag set
537 Also, don't allow hard registers here; they might not be valid when
538 substituted into insns. */
540 process_reg_param (map
, loc
, copy
)
541 struct inline_remap
*map
;
544 if ((GET_CODE (copy
) != REG
&& GET_CODE (copy
) != SUBREG
)
545 || (GET_CODE (copy
) == REG
&& REG_USERVAR_P (loc
)
546 && ! REG_USERVAR_P (copy
))
547 || (GET_CODE (copy
) == REG
548 && REGNO (copy
) < FIRST_PSEUDO_REGISTER
))
550 rtx temp
= copy_to_mode_reg (GET_MODE (loc
), copy
);
551 REG_USERVAR_P (temp
) = REG_USERVAR_P (loc
);
552 if (CONSTANT_P (copy
) || FIXED_BASE_PLUS_P (copy
))
553 SET_CONST_EQUIV_DATA (map
, temp
, copy
, CONST_AGE_PARM
);
556 map
->reg_map
[REGNO (loc
)] = copy
;
559 /* Used by duplicate_eh_handlers to map labels for the exception table */
560 static struct inline_remap
*eif_eh_map
;
563 expand_inline_function_eh_labelmap (label
)
566 int index
= CODE_LABEL_NUMBER (label
);
567 return get_label_from_map (eif_eh_map
, index
);
570 /* Compare two BLOCKs for qsort. The key we sort on is the
571 BLOCK_ABSTRACT_ORIGIN of the blocks. */
574 compare_blocks (v1
, v2
)
578 tree b1
= *((const tree
*) v1
);
579 tree b2
= *((const tree
*) v2
);
581 return ((char *) BLOCK_ABSTRACT_ORIGIN (b1
)
582 - (char *) BLOCK_ABSTRACT_ORIGIN (b2
));
585 /* Compare two BLOCKs for bsearch. The first pointer corresponds to
586 an original block; the second to a remapped equivalent. */
593 const union tree_node
*b1
= (const union tree_node
*) v1
;
594 tree b2
= *((const tree
*) v2
);
596 return ((const char *) b1
- (char *) BLOCK_ABSTRACT_ORIGIN (b2
));
599 /* Integrate the procedure defined by FNDECL. Note that this function
600 may wind up calling itself. Since the static variables are not
601 reentrant, we do not assign them until after the possibility
602 of recursion is eliminated.
604 If IGNORE is nonzero, do not produce a value.
605 Otherwise store the value in TARGET if it is nonzero and that is convenient.
608 (rtx)-1 if we could not substitute the function
609 0 if we substituted it and it does not produce a value
610 else an rtx for where the value is stored. */
613 expand_inline_function (fndecl
, parms
, target
, ignore
, type
,
614 structure_value_addr
)
619 rtx structure_value_addr
;
621 struct function
*inlining_previous
;
622 struct function
*inl_f
= DECL_SAVED_INSNS (fndecl
);
623 tree formal
, actual
, block
;
624 rtx parm_insns
= inl_f
->emit
->x_first_insn
;
625 rtx insns
= (inl_f
->inl_last_parm_insn
626 ? NEXT_INSN (inl_f
->inl_last_parm_insn
)
632 int min_labelno
= inl_f
->emit
->x_first_label_num
;
633 int max_labelno
= inl_f
->inl_max_label_num
;
638 struct inline_remap
*map
= 0;
642 rtvec arg_vector
= (rtvec
) inl_f
->original_arg_vector
;
643 rtx static_chain_value
= 0;
646 /* The pointer used to track the true location of the memory used
647 for MAP->LABEL_MAP. */
648 rtx
*real_label_map
= 0;
650 /* Allow for equivalences of the pseudos we make for virtual fp and ap. */
651 max_regno
= inl_f
->emit
->x_reg_rtx_no
+ 3;
652 if (max_regno
< FIRST_PSEUDO_REGISTER
)
655 nargs
= list_length (DECL_ARGUMENTS (fndecl
));
657 if (cfun
->preferred_stack_boundary
< inl_f
->preferred_stack_boundary
)
658 cfun
->preferred_stack_boundary
= inl_f
->preferred_stack_boundary
;
660 /* Check that the parms type match and that sufficient arguments were
661 passed. Since the appropriate conversions or default promotions have
662 already been applied, the machine modes should match exactly. */
664 for (formal
= DECL_ARGUMENTS (fndecl
), actual
= parms
;
666 formal
= TREE_CHAIN (formal
), actual
= TREE_CHAIN (actual
))
669 enum machine_mode mode
;
672 return (rtx
) (HOST_WIDE_INT
) -1;
674 arg
= TREE_VALUE (actual
);
675 mode
= TYPE_MODE (DECL_ARG_TYPE (formal
));
677 if (mode
!= TYPE_MODE (TREE_TYPE (arg
))
678 /* If they are block mode, the types should match exactly.
679 They don't match exactly if TREE_TYPE (FORMAL) == ERROR_MARK_NODE,
680 which could happen if the parameter has incomplete type. */
682 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg
))
683 != TYPE_MAIN_VARIANT (TREE_TYPE (formal
)))))
684 return (rtx
) (HOST_WIDE_INT
) -1;
687 /* Extra arguments are valid, but will be ignored below, so we must
688 evaluate them here for side-effects. */
689 for (; actual
; actual
= TREE_CHAIN (actual
))
690 expand_expr (TREE_VALUE (actual
), const0_rtx
,
691 TYPE_MODE (TREE_TYPE (TREE_VALUE (actual
))), 0);
693 /* Expand the function arguments. Do this first so that any
694 new registers get created before we allocate the maps. */
696 arg_vals
= (rtx
*) xmalloc (nargs
* sizeof (rtx
));
697 arg_trees
= (tree
*) xmalloc (nargs
* sizeof (tree
));
699 for (formal
= DECL_ARGUMENTS (fndecl
), actual
= parms
, i
= 0;
701 formal
= TREE_CHAIN (formal
), actual
= TREE_CHAIN (actual
), i
++)
703 /* Actual parameter, converted to the type of the argument within the
705 tree arg
= convert (TREE_TYPE (formal
), TREE_VALUE (actual
));
706 /* Mode of the variable used within the function. */
707 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (formal
));
711 loc
= RTVEC_ELT (arg_vector
, i
);
713 /* If this is an object passed by invisible reference, we copy the
714 object into a stack slot and save its address. If this will go
715 into memory, we do nothing now. Otherwise, we just expand the
717 if (GET_CODE (loc
) == MEM
&& GET_CODE (XEXP (loc
, 0)) == REG
718 && REGNO (XEXP (loc
, 0)) > LAST_VIRTUAL_REGISTER
)
721 = assign_stack_temp (TYPE_MODE (TREE_TYPE (arg
)),
722 int_size_in_bytes (TREE_TYPE (arg
)), 1);
723 MEM_SET_IN_STRUCT_P (stack_slot
,
724 AGGREGATE_TYPE_P (TREE_TYPE (arg
)));
726 store_expr (arg
, stack_slot
, 0);
728 arg_vals
[i
] = XEXP (stack_slot
, 0);
731 else if (GET_CODE (loc
) != MEM
)
733 if (GET_MODE (loc
) != TYPE_MODE (TREE_TYPE (arg
)))
734 /* The mode if LOC and ARG can differ if LOC was a variable
735 that had its mode promoted via PROMOTED_MODE. */
736 arg_vals
[i
] = convert_modes (GET_MODE (loc
),
737 TYPE_MODE (TREE_TYPE (arg
)),
738 expand_expr (arg
, NULL_RTX
, mode
,
740 TREE_UNSIGNED (TREE_TYPE (formal
)));
742 arg_vals
[i
] = expand_expr (arg
, NULL_RTX
, mode
, EXPAND_SUM
);
748 && (! TREE_READONLY (formal
)
749 /* If the parameter is not read-only, copy our argument through
750 a register. Also, we cannot use ARG_VALS[I] if it overlaps
751 TARGET in any way. In the inline function, they will likely
752 be two different pseudos, and `safe_from_p' will make all
753 sorts of smart assumptions about their not conflicting.
754 But if ARG_VALS[I] overlaps TARGET, these assumptions are
755 wrong, so put ARG_VALS[I] into a fresh register.
756 Don't worry about invisible references, since their stack
757 temps will never overlap the target. */
760 && (GET_CODE (arg_vals
[i
]) == REG
761 || GET_CODE (arg_vals
[i
]) == SUBREG
762 || GET_CODE (arg_vals
[i
]) == MEM
)
763 && reg_overlap_mentioned_p (arg_vals
[i
], target
))
764 /* ??? We must always copy a SUBREG into a REG, because it might
765 get substituted into an address, and not all ports correctly
766 handle SUBREGs in addresses. */
767 || (GET_CODE (arg_vals
[i
]) == SUBREG
)))
768 arg_vals
[i
] = copy_to_mode_reg (GET_MODE (loc
), arg_vals
[i
]);
770 if (arg_vals
[i
] != 0 && GET_CODE (arg_vals
[i
]) == REG
771 && POINTER_TYPE_P (TREE_TYPE (formal
)))
772 mark_reg_pointer (arg_vals
[i
],
773 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (formal
))));
776 /* Allocate the structures we use to remap things. */
778 map
= (struct inline_remap
*) xmalloc (sizeof (struct inline_remap
));
779 map
->fndecl
= fndecl
;
781 VARRAY_TREE_INIT (map
->block_map
, 10, "block_map");
782 map
->reg_map
= (rtx
*) xcalloc (max_regno
, sizeof (rtx
));
784 /* We used to use alloca here, but the size of what it would try to
785 allocate would occasionally cause it to exceed the stack limit and
786 cause unpredictable core dumps. */
788 = (rtx
*) xmalloc ((max_labelno
) * sizeof (rtx
));
789 map
->label_map
= real_label_map
;
791 inl_max_uid
= (inl_f
->emit
->x_cur_insn_uid
+ 1);
792 map
->insn_map
= (rtx
*) xcalloc (inl_max_uid
, sizeof (rtx
));
794 map
->max_insnno
= inl_max_uid
;
796 map
->integrating
= 1;
798 /* const_equiv_varray maps pseudos in our routine to constants, so
799 it needs to be large enough for all our pseudos. This is the
800 number we are currently using plus the number in the called
801 routine, plus 15 for each arg, five to compute the virtual frame
802 pointer, and five for the return value. This should be enough
803 for most cases. We do not reference entries outside the range of
806 ??? These numbers are quite arbitrary and were obtained by
807 experimentation. At some point, we should try to allocate the
808 table after all the parameters are set up so we an more accurately
809 estimate the number of pseudos we will need. */
811 VARRAY_CONST_EQUIV_INIT (map
->const_equiv_varray
,
813 + (max_regno
- FIRST_PSEUDO_REGISTER
)
816 "expand_inline_function");
819 /* Record the current insn in case we have to set up pointers to frame
820 and argument memory blocks. If there are no insns yet, add a dummy
821 insn that can be used as an insertion point. */
822 map
->insns_at_start
= get_last_insn ();
823 if (map
->insns_at_start
== 0)
824 map
->insns_at_start
= emit_note (NULL_PTR
, NOTE_INSN_DELETED
);
826 map
->regno_pointer_flag
= inl_f
->emit
->regno_pointer_flag
;
827 map
->regno_pointer_align
= inl_f
->emit
->regno_pointer_align
;
829 /* Update the outgoing argument size to allow for those in the inlined
831 if (inl_f
->outgoing_args_size
> current_function_outgoing_args_size
)
832 current_function_outgoing_args_size
= inl_f
->outgoing_args_size
;
834 /* If the inline function needs to make PIC references, that means
835 that this function's PIC offset table must be used. */
836 if (inl_f
->uses_pic_offset_table
)
837 current_function_uses_pic_offset_table
= 1;
839 /* If this function needs a context, set it up. */
840 if (inl_f
->needs_context
)
841 static_chain_value
= lookup_static_chain (fndecl
);
843 if (GET_CODE (parm_insns
) == NOTE
844 && NOTE_LINE_NUMBER (parm_insns
) > 0)
846 rtx note
= emit_note (NOTE_SOURCE_FILE (parm_insns
),
847 NOTE_LINE_NUMBER (parm_insns
));
849 RTX_INTEGRATED_P (note
) = 1;
852 /* Process each argument. For each, set up things so that the function's
853 reference to the argument will refer to the argument being passed.
854 We only replace REG with REG here. Any simplifications are done
857 We make two passes: In the first, we deal with parameters that will
858 be placed into registers, since we need to ensure that the allocated
859 register number fits in const_equiv_map. Then we store all non-register
860 parameters into their memory location. */
862 /* Don't try to free temp stack slots here, because we may put one of the
863 parameters into a temp stack slot. */
865 for (i
= 0; i
< nargs
; i
++)
867 rtx copy
= arg_vals
[i
];
869 loc
= RTVEC_ELT (arg_vector
, i
);
871 /* There are three cases, each handled separately. */
872 if (GET_CODE (loc
) == MEM
&& GET_CODE (XEXP (loc
, 0)) == REG
873 && REGNO (XEXP (loc
, 0)) > LAST_VIRTUAL_REGISTER
)
875 /* This must be an object passed by invisible reference (it could
876 also be a variable-sized object, but we forbid inlining functions
877 with variable-sized arguments). COPY is the address of the
878 actual value (this computation will cause it to be copied). We
879 map that address for the register, noting the actual address as
880 an equivalent in case it can be substituted into the insns. */
882 if (GET_CODE (copy
) != REG
)
884 temp
= copy_addr_to_reg (copy
);
885 if (CONSTANT_P (copy
) || FIXED_BASE_PLUS_P (copy
))
886 SET_CONST_EQUIV_DATA (map
, temp
, copy
, CONST_AGE_PARM
);
889 map
->reg_map
[REGNO (XEXP (loc
, 0))] = copy
;
891 else if (GET_CODE (loc
) == MEM
)
893 /* This is the case of a parameter that lives in memory. It
894 will live in the block we allocate in the called routine's
895 frame that simulates the incoming argument area. Do nothing
896 with the parameter now; we will call store_expr later. In
897 this case, however, we must ensure that the virtual stack and
898 incoming arg rtx values are expanded now so that we can be
899 sure we have enough slots in the const equiv map since the
900 store_expr call can easily blow the size estimate. */
901 if (DECL_FRAME_SIZE (fndecl
) != 0)
902 copy_rtx_and_substitute (virtual_stack_vars_rtx
, map
, 0);
904 if (DECL_SAVED_INSNS (fndecl
)->args_size
!= 0)
905 copy_rtx_and_substitute (virtual_incoming_args_rtx
, map
, 0);
907 else if (GET_CODE (loc
) == REG
)
908 process_reg_param (map
, loc
, copy
);
909 else if (GET_CODE (loc
) == CONCAT
)
911 rtx locreal
= gen_realpart (GET_MODE (XEXP (loc
, 0)), loc
);
912 rtx locimag
= gen_imagpart (GET_MODE (XEXP (loc
, 0)), loc
);
913 rtx copyreal
= gen_realpart (GET_MODE (locreal
), copy
);
914 rtx copyimag
= gen_imagpart (GET_MODE (locimag
), copy
);
916 process_reg_param (map
, locreal
, copyreal
);
917 process_reg_param (map
, locimag
, copyimag
);
923 /* Tell copy_rtx_and_substitute to handle constant pool SYMBOL_REFs
924 specially. This function can be called recursively, so we need to
925 save the previous value. */
926 inlining_previous
= inlining
;
929 /* Now do the parameters that will be placed in memory. */
931 for (formal
= DECL_ARGUMENTS (fndecl
), i
= 0;
932 formal
; formal
= TREE_CHAIN (formal
), i
++)
934 loc
= RTVEC_ELT (arg_vector
, i
);
936 if (GET_CODE (loc
) == MEM
937 /* Exclude case handled above. */
938 && ! (GET_CODE (XEXP (loc
, 0)) == REG
939 && REGNO (XEXP (loc
, 0)) > LAST_VIRTUAL_REGISTER
))
941 rtx note
= emit_note (DECL_SOURCE_FILE (formal
),
942 DECL_SOURCE_LINE (formal
));
944 RTX_INTEGRATED_P (note
) = 1;
946 /* Compute the address in the area we reserved and store the
948 temp
= copy_rtx_and_substitute (loc
, map
, 1);
949 subst_constants (&temp
, NULL_RTX
, map
, 1);
950 apply_change_group ();
951 if (! memory_address_p (GET_MODE (temp
), XEXP (temp
, 0)))
952 temp
= change_address (temp
, VOIDmode
, XEXP (temp
, 0));
953 store_expr (arg_trees
[i
], temp
, 0);
957 /* Deal with the places that the function puts its result.
958 We are driven by what is placed into DECL_RESULT.
960 Initially, we assume that we don't have anything special handling for
961 REG_FUNCTION_RETURN_VALUE_P. */
963 map
->inline_target
= 0;
964 loc
= DECL_RTL (DECL_RESULT (fndecl
));
966 if (TYPE_MODE (type
) == VOIDmode
)
967 /* There is no return value to worry about. */
969 else if (GET_CODE (loc
) == MEM
)
971 if (GET_CODE (XEXP (loc
, 0)) == ADDRESSOF
)
973 temp
= copy_rtx_and_substitute (loc
, map
, 1);
974 subst_constants (&temp
, NULL_RTX
, map
, 1);
975 apply_change_group ();
980 if (! structure_value_addr
981 || ! aggregate_value_p (DECL_RESULT (fndecl
)))
984 /* Pass the function the address in which to return a structure
985 value. Note that a constructor can cause someone to call us
986 with STRUCTURE_VALUE_ADDR, but the initialization takes place
987 via the first parameter, rather than the struct return address.
989 We have two cases: If the address is a simple register
990 indirect, use the mapping mechanism to point that register to
991 our structure return address. Otherwise, store the structure
992 return value into the place that it will be referenced from. */
994 if (GET_CODE (XEXP (loc
, 0)) == REG
)
996 temp
= force_operand (structure_value_addr
, NULL_RTX
);
997 temp
= force_reg (Pmode
, temp
);
998 map
->reg_map
[REGNO (XEXP (loc
, 0))] = temp
;
1000 if (CONSTANT_P (structure_value_addr
)
1001 || GET_CODE (structure_value_addr
) == ADDRESSOF
1002 || (GET_CODE (structure_value_addr
) == PLUS
1003 && (XEXP (structure_value_addr
, 0)
1004 == virtual_stack_vars_rtx
)
1005 && (GET_CODE (XEXP (structure_value_addr
, 1))
1008 SET_CONST_EQUIV_DATA (map
, temp
, structure_value_addr
,
1014 temp
= copy_rtx_and_substitute (loc
, map
, 1);
1015 subst_constants (&temp
, NULL_RTX
, map
, 0);
1016 apply_change_group ();
1017 emit_move_insn (temp
, structure_value_addr
);
1022 /* We will ignore the result value, so don't look at its structure.
1023 Note that preparations for an aggregate return value
1024 do need to be made (above) even if it will be ignored. */
1026 else if (GET_CODE (loc
) == REG
)
1028 /* The function returns an object in a register and we use the return
1029 value. Set up our target for remapping. */
1031 /* Machine mode function was declared to return. */
1032 enum machine_mode departing_mode
= TYPE_MODE (type
);
1033 /* (Possibly wider) machine mode it actually computes
1034 (for the sake of callers that fail to declare it right).
1035 We have to use the mode of the result's RTL, rather than
1036 its type, since expand_function_start may have promoted it. */
1037 enum machine_mode arriving_mode
1038 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl
)));
1041 /* Don't use MEMs as direct targets because on some machines
1042 substituting a MEM for a REG makes invalid insns.
1043 Let the combiner substitute the MEM if that is valid. */
1044 if (target
== 0 || GET_CODE (target
) != REG
1045 || GET_MODE (target
) != departing_mode
)
1047 /* Don't make BLKmode registers. If this looks like
1048 a BLKmode object being returned in a register, get
1049 the mode from that, otherwise abort. */
1050 if (departing_mode
== BLKmode
)
1052 if (REG
== GET_CODE (DECL_RTL (DECL_RESULT (fndecl
))))
1054 departing_mode
= GET_MODE (DECL_RTL (DECL_RESULT (fndecl
)));
1055 arriving_mode
= departing_mode
;
1061 target
= gen_reg_rtx (departing_mode
);
1064 /* If function's value was promoted before return,
1065 avoid machine mode mismatch when we substitute INLINE_TARGET.
1066 But TARGET is what we will return to the caller. */
1067 if (arriving_mode
!= departing_mode
)
1069 /* Avoid creating a paradoxical subreg wider than
1070 BITS_PER_WORD, since that is illegal. */
1071 if (GET_MODE_BITSIZE (arriving_mode
) > BITS_PER_WORD
)
1073 if (!TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (departing_mode
),
1074 GET_MODE_BITSIZE (arriving_mode
)))
1075 /* Maybe could be handled by using convert_move () ? */
1077 reg_to_map
= gen_reg_rtx (arriving_mode
);
1078 target
= gen_lowpart (departing_mode
, reg_to_map
);
1081 reg_to_map
= gen_rtx_SUBREG (arriving_mode
, target
, 0);
1084 reg_to_map
= target
;
1086 /* Usually, the result value is the machine's return register.
1087 Sometimes it may be a pseudo. Handle both cases. */
1088 if (REG_FUNCTION_VALUE_P (loc
))
1089 map
->inline_target
= reg_to_map
;
1091 map
->reg_map
[REGNO (loc
)] = reg_to_map
;
1096 /* Initialize label_map. get_label_from_map will actually make
1098 bzero ((char *) &map
->label_map
[min_labelno
],
1099 (max_labelno
- min_labelno
) * sizeof (rtx
));
1101 /* Make copies of the decls of the symbols in the inline function, so that
1102 the copies of the variables get declared in the current function. Set
1103 up things so that lookup_static_chain knows that to interpret registers
1104 in SAVE_EXPRs for TYPE_SIZEs as local. */
1105 inline_function_decl
= fndecl
;
1106 integrate_parm_decls (DECL_ARGUMENTS (fndecl
), map
, arg_vector
);
1107 block
= integrate_decl_tree (inl_f
->original_decl_initial
, map
);
1108 BLOCK_ABSTRACT_ORIGIN (block
) = DECL_ORIGIN (fndecl
);
1109 inline_function_decl
= 0;
1111 /* Make a fresh binding contour that we can easily remove. Do this after
1112 expanding our arguments so cleanups are properly scoped. */
1113 expand_start_bindings_and_block (0, block
);
1115 /* Sort the block-map so that it will be easy to find remapped
1117 qsort (&VARRAY_TREE (map
->block_map
, 0),
1118 map
->block_map
->elements_used
,
1122 /* Perform postincrements before actually calling the function. */
1125 /* Clean up stack so that variables might have smaller offsets. */
1126 do_pending_stack_adjust ();
1128 /* Save a copy of the location of const_equiv_varray for
1129 mark_stores, called via note_stores. */
1130 global_const_equiv_varray
= map
->const_equiv_varray
;
1132 /* If the called function does an alloca, save and restore the
1133 stack pointer around the call. This saves stack space, but
1134 also is required if this inline is being done between two
1136 if (inl_f
->calls_alloca
)
1137 emit_stack_save (SAVE_BLOCK
, &stack_save
, NULL_RTX
);
1139 /* Now copy the insns one by one. */
1140 copy_insn_list (insns
, map
, static_chain_value
);
1142 /* Restore the stack pointer if we saved it above. */
1143 if (inl_f
->calls_alloca
)
1144 emit_stack_restore (SAVE_BLOCK
, stack_save
, NULL_RTX
);
1146 if (! cfun
->x_whole_function_mode_p
)
1147 /* In statement-at-a-time mode, we just tell the front-end to add
1148 this block to the list of blocks at this binding level. We
1149 can't do it the way it's done for function-at-a-time mode the
1150 superblocks have not been created yet. */
1151 insert_block (block
);
1155 = BLOCK_CHAIN (DECL_INITIAL (current_function_decl
));
1156 BLOCK_CHAIN (DECL_INITIAL (current_function_decl
)) = block
;
1159 /* End the scope containing the copied formal parameter variables
1160 and copied LABEL_DECLs. We pass NULL_TREE for the variables list
1161 here so that expand_end_bindings will not check for unused
1162 variables. That's already been checked for when the inlined
1163 function was defined. */
1164 expand_end_bindings (NULL_TREE
, 1, 1);
1166 /* Must mark the line number note after inlined functions as a repeat, so
1167 that the test coverage code can avoid counting the call twice. This
1168 just tells the code to ignore the immediately following line note, since
1169 there already exists a copy of this note before the expanded inline call.
1170 This line number note is still needed for debugging though, so we can't
1172 if (flag_test_coverage
)
1173 emit_note (0, NOTE_INSN_REPEATED_LINE_NUMBER
);
1175 emit_line_note (input_filename
, lineno
);
1177 /* If the function returns a BLKmode object in a register, copy it
1178 out of the temp register into a BLKmode memory object. */
1180 && TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl
))) == BLKmode
1181 && ! aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl
))))
1182 target
= copy_blkmode_from_reg (0, target
, TREE_TYPE (TREE_TYPE (fndecl
)));
1184 if (structure_value_addr
)
1186 target
= gen_rtx_MEM (TYPE_MODE (type
),
1187 memory_address (TYPE_MODE (type
),
1188 structure_value_addr
));
1189 MEM_SET_IN_STRUCT_P (target
, 1);
1192 /* Make sure we free the things we explicitly allocated with xmalloc. */
1194 free (real_label_map
);
1195 VARRAY_FREE (map
->const_equiv_varray
);
1196 free (map
->reg_map
);
1197 VARRAY_FREE (map
->block_map
);
1198 free (map
->insn_map
);
1203 inlining
= inlining_previous
;
1208 /* Make copies of each insn in the given list using the mapping
1209 computed in expand_inline_function. This function may call itself for
1210 insns containing sequences.
1212 Copying is done in two passes, first the insns and then their REG_NOTES,
1213 just like save_for_inline.
1215 If static_chain_value is non-zero, it represents the context-pointer
1216 register for the function. */
1219 copy_insn_list (insns
, map
, static_chain_value
)
1221 struct inline_remap
*map
;
1222 rtx static_chain_value
;
1227 rtx local_return_label
= NULL_RTX
;
1232 /* Copy the insns one by one. Do this in two passes, first the insns and
1233 then their REG_NOTES, just like save_for_inline. */
1235 /* This loop is very similar to the loop in copy_loop_body in unroll.c. */
1237 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
1239 rtx copy
, pattern
, set
;
1241 map
->orig_asm_operands_vector
= 0;
1243 switch (GET_CODE (insn
))
1246 pattern
= PATTERN (insn
);
1247 set
= single_set (insn
);
1249 if (GET_CODE (pattern
) == USE
1250 && GET_CODE (XEXP (pattern
, 0)) == REG
1251 && REG_FUNCTION_VALUE_P (XEXP (pattern
, 0)))
1252 /* The (USE (REG n)) at return from the function should
1253 be ignored since we are changing (REG n) into
1257 /* If the inline fn needs eh context, make sure that
1258 the current fn has one. */
1259 if (GET_CODE (pattern
) == USE
1260 && find_reg_note (insn
, REG_EH_CONTEXT
, 0) != 0)
1263 /* Ignore setting a function value that we don't want to use. */
1264 if (map
->inline_target
== 0
1266 && GET_CODE (SET_DEST (set
)) == REG
1267 && REG_FUNCTION_VALUE_P (SET_DEST (set
)))
1269 if (volatile_refs_p (SET_SRC (set
)))
1273 /* If we must not delete the source,
1274 load it into a new temporary. */
1275 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1277 new_set
= single_set (copy
);
1282 = gen_reg_rtx (GET_MODE (SET_DEST (new_set
)));
1284 /* If the source and destination are the same and it
1285 has a note on it, keep the insn. */
1286 else if (rtx_equal_p (SET_DEST (set
), SET_SRC (set
))
1287 && REG_NOTES (insn
) != 0)
1288 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1293 /* If this is setting the static chain rtx, omit it. */
1294 else if (static_chain_value
!= 0
1296 && GET_CODE (SET_DEST (set
)) == REG
1297 && rtx_equal_p (SET_DEST (set
),
1298 static_chain_incoming_rtx
))
1301 /* If this is setting the static chain pseudo, set it from
1302 the value we want to give it instead. */
1303 else if (static_chain_value
!= 0
1305 && rtx_equal_p (SET_SRC (set
),
1306 static_chain_incoming_rtx
))
1308 rtx newdest
= copy_rtx_and_substitute (SET_DEST (set
), map
, 1);
1310 copy
= emit_move_insn (newdest
, static_chain_value
);
1311 static_chain_value
= 0;
1314 /* If this is setting the virtual stack vars register, this must
1315 be the code at the handler for a builtin longjmp. The value
1316 saved in the setjmp buffer will be the address of the frame
1317 we've made for this inlined instance within our frame. But we
1318 know the offset of that value so we can use it to reconstruct
1319 our virtual stack vars register from that value. If we are
1320 copying it from the stack pointer, leave it unchanged. */
1322 && rtx_equal_p (SET_DEST (set
), virtual_stack_vars_rtx
))
1324 HOST_WIDE_INT offset
;
1325 temp
= map
->reg_map
[REGNO (SET_DEST (set
))];
1326 temp
= VARRAY_CONST_EQUIV (map
->const_equiv_varray
,
1329 if (rtx_equal_p (temp
, virtual_stack_vars_rtx
))
1331 else if (GET_CODE (temp
) == PLUS
1332 && rtx_equal_p (XEXP (temp
, 0), virtual_stack_vars_rtx
)
1333 && GET_CODE (XEXP (temp
, 1)) == CONST_INT
)
1334 offset
= INTVAL (XEXP (temp
, 1));
1338 if (rtx_equal_p (SET_SRC (set
), stack_pointer_rtx
))
1339 temp
= SET_SRC (set
);
1341 temp
= force_operand (plus_constant (SET_SRC (set
),
1345 copy
= emit_move_insn (virtual_stack_vars_rtx
, temp
);
1349 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1350 /* REG_NOTES will be copied later. */
1353 /* If this insn is setting CC0, it may need to look at
1354 the insn that uses CC0 to see what type of insn it is.
1355 In that case, the call to recog via validate_change will
1356 fail. So don't substitute constants here. Instead,
1357 do it when we emit the following insn.
1359 For example, see the pyr.md file. That machine has signed and
1360 unsigned compares. The compare patterns must check the
1361 following branch insn to see which what kind of compare to
1364 If the previous insn set CC0, substitute constants on it as
1366 if (sets_cc0_p (PATTERN (copy
)) != 0)
1371 try_constants (cc0_insn
, map
);
1373 try_constants (copy
, map
);
1376 try_constants (copy
, map
);
1381 if (GET_CODE (PATTERN (insn
)) == RETURN
1382 || (GET_CODE (PATTERN (insn
)) == PARALLEL
1383 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == RETURN
))
1385 if (local_return_label
== 0)
1386 local_return_label
= gen_label_rtx ();
1387 pattern
= gen_jump (local_return_label
);
1390 pattern
= copy_rtx_and_substitute (PATTERN (insn
), map
, 0);
1392 copy
= emit_jump_insn (pattern
);
1396 try_constants (cc0_insn
, map
);
1399 try_constants (copy
, map
);
1401 /* If this used to be a conditional jump insn but whose branch
1402 direction is now know, we must do something special. */
1403 if (any_condjump_p (insn
) && onlyjump_p (insn
) && map
->last_pc_value
)
1406 /* If the previous insn set cc0 for us, delete it. */
1407 if (sets_cc0_p (PREV_INSN (copy
)))
1408 delete_insn (PREV_INSN (copy
));
1411 /* If this is now a no-op, delete it. */
1412 if (map
->last_pc_value
== pc_rtx
)
1418 /* Otherwise, this is unconditional jump so we must put a
1419 BARRIER after it. We could do some dead code elimination
1420 here, but jump.c will do it just as well. */
1426 /* If this is a CALL_PLACEHOLDER insn then we need to copy the
1427 three attached sequences: normal call, sibling call and tail
1429 if (GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
1434 for (i
= 0; i
< 3; i
++)
1438 sequence
[i
] = NULL_RTX
;
1439 seq
= XEXP (PATTERN (insn
), i
);
1443 copy_insn_list (seq
, map
, static_chain_value
);
1444 sequence
[i
] = get_insns ();
1449 /* Find the new tail recursion label.
1450 It will already be substituted into sequence[2]. */
1451 tail_label
= copy_rtx_and_substitute (XEXP (PATTERN (insn
), 3),
1454 copy
= emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode
,
1462 pattern
= copy_rtx_and_substitute (PATTERN (insn
), map
, 0);
1463 copy
= emit_call_insn (pattern
);
1465 SIBLING_CALL_P (copy
) = SIBLING_CALL_P (insn
);
1467 /* Because the USAGE information potentially contains objects other
1468 than hard registers, we need to copy it. */
1470 CALL_INSN_FUNCTION_USAGE (copy
)
1471 = copy_rtx_and_substitute (CALL_INSN_FUNCTION_USAGE (insn
),
1476 try_constants (cc0_insn
, map
);
1479 try_constants (copy
, map
);
1481 /* Be lazy and assume CALL_INSNs clobber all hard registers. */
1482 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
1483 VARRAY_CONST_EQUIV (map
->const_equiv_varray
, i
).rtx
= 0;
1487 copy
= emit_label (get_label_from_map (map
,
1488 CODE_LABEL_NUMBER (insn
)));
1489 LABEL_NAME (copy
) = LABEL_NAME (insn
);
1494 copy
= emit_barrier ();
1498 /* NOTE_INSN_FUNCTION_END and NOTE_INSN_FUNCTION_BEG are
1499 discarded because it is important to have only one of
1500 each in the current function.
1502 NOTE_INSN_DELETED notes aren't useful (save_for_inline
1503 deleted these in the copy used for continuing compilation,
1504 not the copy used for inlining).
1506 NOTE_INSN_BASIC_BLOCK is discarded because the saved bb
1507 pointer (which will soon be dangling) confuses flow's
1508 attempts to preserve bb structures during the compilation
1511 if (NOTE_LINE_NUMBER (insn
) != NOTE_INSN_FUNCTION_END
1512 && NOTE_LINE_NUMBER (insn
) != NOTE_INSN_FUNCTION_BEG
1513 && NOTE_LINE_NUMBER (insn
) != NOTE_INSN_DELETED
1514 && NOTE_LINE_NUMBER (insn
) != NOTE_INSN_BASIC_BLOCK
)
1516 copy
= emit_note (NOTE_SOURCE_FILE (insn
),
1517 NOTE_LINE_NUMBER (insn
));
1519 && (NOTE_LINE_NUMBER (copy
) == NOTE_INSN_EH_REGION_BEG
1520 || NOTE_LINE_NUMBER (copy
) == NOTE_INSN_EH_REGION_END
))
1523 = get_label_from_map (map
, NOTE_EH_HANDLER (copy
));
1525 /* we have to duplicate the handlers for the original */
1526 if (NOTE_LINE_NUMBER (copy
) == NOTE_INSN_EH_REGION_BEG
)
1528 /* We need to duplicate the handlers for the EH region
1529 and we need to indicate where the label map is */
1531 duplicate_eh_handlers (NOTE_EH_HANDLER (copy
),
1532 CODE_LABEL_NUMBER (label
),
1533 expand_inline_function_eh_labelmap
);
1536 /* We have to forward these both to match the new exception
1538 NOTE_EH_HANDLER (copy
) = CODE_LABEL_NUMBER (label
);
1541 && (NOTE_LINE_NUMBER (copy
) == NOTE_INSN_BLOCK_BEG
1542 || NOTE_LINE_NUMBER (copy
) == NOTE_INSN_BLOCK_END
)
1543 && NOTE_BLOCK (insn
))
1545 tree
*mapped_block_p
;
1548 = (tree
*) bsearch (NOTE_BLOCK (insn
),
1549 &VARRAY_TREE (map
->block_map
, 0),
1550 map
->block_map
->elements_used
,
1554 if (!mapped_block_p
)
1557 NOTE_BLOCK (copy
) = *mapped_block_p
;
1569 RTX_INTEGRATED_P (copy
) = 1;
1571 map
->insn_map
[INSN_UID (insn
)] = copy
;
1574 /* Now copy the REG_NOTES. Increment const_age, so that only constants
1575 from parameters can be substituted in. These are the only ones that
1576 are valid across the entire function. */
1578 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
1579 if (GET_RTX_CLASS (GET_CODE (insn
)) == 'i'
1580 && map
->insn_map
[INSN_UID (insn
)]
1581 && REG_NOTES (insn
))
1583 rtx tem
= copy_rtx_and_substitute (REG_NOTES (insn
), map
, 0);
1585 /* We must also do subst_constants, in case one of our parameters
1586 has const type and constant value. */
1587 subst_constants (&tem
, NULL_RTX
, map
, 0);
1588 apply_change_group ();
1589 REG_NOTES (map
->insn_map
[INSN_UID (insn
)]) = tem
;
1592 if (local_return_label
)
1593 emit_label (local_return_label
);
1596 /* Given a chain of PARM_DECLs, ARGS, copy each decl into a VAR_DECL,
1597 push all of those decls and give each one the corresponding home. */
1600 integrate_parm_decls (args
, map
, arg_vector
)
1602 struct inline_remap
*map
;
1608 for (tail
= args
, i
= 0; tail
; tail
= TREE_CHAIN (tail
), i
++)
1610 tree decl
= copy_decl_for_inlining (tail
, map
->fndecl
,
1611 current_function_decl
);
1613 = copy_rtx_and_substitute (RTVEC_ELT (arg_vector
, i
), map
, 1);
1615 /* We really should be setting DECL_INCOMING_RTL to something reasonable
1616 here, but that's going to require some more work. */
1617 /* DECL_INCOMING_RTL (decl) = ?; */
1618 /* Fully instantiate the address with the equivalent form so that the
1619 debugging information contains the actual register, instead of the
1620 virtual register. Do this by not passing an insn to
1622 subst_constants (&new_decl_rtl
, NULL_RTX
, map
, 1);
1623 apply_change_group ();
1624 DECL_RTL (decl
) = new_decl_rtl
;
1628 /* Given a BLOCK node LET, push decls and levels so as to construct in the
1629 current function a tree of contexts isomorphic to the one that is given.
1631 MAP, if nonzero, is a pointer to an inline_remap map which indicates how
1632 registers used in the DECL_RTL field should be remapped. If it is zero,
1633 no mapping is necessary. */
1636 integrate_decl_tree (let
, map
)
1638 struct inline_remap
*map
;
1644 new_block
= make_node (BLOCK
);
1645 VARRAY_PUSH_TREE (map
->block_map
, new_block
);
1646 next
= &BLOCK_VARS (new_block
);
1648 for (t
= BLOCK_VARS (let
); t
; t
= TREE_CHAIN (t
))
1652 push_obstacks_nochange ();
1653 saveable_allocation ();
1654 d
= copy_decl_for_inlining (t
, map
->fndecl
, current_function_decl
);
1657 if (DECL_RTL (t
) != 0)
1659 DECL_RTL (d
) = copy_rtx_and_substitute (DECL_RTL (t
), map
, 1);
1661 /* Fully instantiate the address with the equivalent form so that the
1662 debugging information contains the actual register, instead of the
1663 virtual register. Do this by not passing an insn to
1665 subst_constants (&DECL_RTL (d
), NULL_RTX
, map
, 1);
1666 apply_change_group ();
1669 /* Add this declaration to the list of variables in the new
1672 next
= &TREE_CHAIN (d
);
1675 next
= &BLOCK_SUBBLOCKS (new_block
);
1676 for (t
= BLOCK_SUBBLOCKS (let
); t
; t
= BLOCK_CHAIN (t
))
1678 *next
= integrate_decl_tree (t
, map
);
1679 BLOCK_SUPERCONTEXT (*next
) = new_block
;
1680 next
= &BLOCK_CHAIN (*next
);
1683 TREE_USED (new_block
) = TREE_USED (let
);
1684 BLOCK_ABSTRACT_ORIGIN (new_block
) = let
;
1689 /* Create a new copy of an rtx. Recursively copies the operands of the rtx,
1690 except for those few rtx codes that are sharable.
1692 We always return an rtx that is similar to that incoming rtx, with the
1693 exception of possibly changing a REG to a SUBREG or vice versa. No
1694 rtl is ever emitted.
1696 If FOR_LHS is nonzero, if means we are processing something that will
1697 be the LHS of a SET. In that case, we copy RTX_UNCHANGING_P even if
1698 inlining since we need to be conservative in how it is set for
1701 Handle constants that need to be placed in the constant pool by
1702 calling `force_const_mem'. */
1705 copy_rtx_and_substitute (orig
, map
, for_lhs
)
1707 struct inline_remap
*map
;
1710 register rtx copy
, temp
;
1712 register RTX_CODE code
;
1713 register enum machine_mode mode
;
1714 register const char *format_ptr
;
1720 code
= GET_CODE (orig
);
1721 mode
= GET_MODE (orig
);
1726 /* If the stack pointer register shows up, it must be part of
1727 stack-adjustments (*not* because we eliminated the frame pointer!).
1728 Small hard registers are returned as-is. Pseudo-registers
1729 go through their `reg_map'. */
1730 regno
= REGNO (orig
);
1731 if (regno
<= LAST_VIRTUAL_REGISTER
1732 || (map
->integrating
1733 && DECL_SAVED_INSNS (map
->fndecl
)->internal_arg_pointer
== orig
))
1735 /* Some hard registers are also mapped,
1736 but others are not translated. */
1737 if (map
->reg_map
[regno
] != 0)
1738 return map
->reg_map
[regno
];
1740 /* If this is the virtual frame pointer, make space in current
1741 function's stack frame for the stack frame of the inline function.
1743 Copy the address of this area into a pseudo. Map
1744 virtual_stack_vars_rtx to this pseudo and set up a constant
1745 equivalence for it to be the address. This will substitute the
1746 address into insns where it can be substituted and use the new
1747 pseudo where it can't. */
1748 if (regno
== VIRTUAL_STACK_VARS_REGNUM
)
1751 int size
= get_func_frame_size (DECL_SAVED_INSNS (map
->fndecl
));
1752 #ifdef FRAME_GROWS_DOWNWARD
1754 = (DECL_SAVED_INSNS (map
->fndecl
)->stack_alignment_needed
1757 /* In this case, virtual_stack_vars_rtx points to one byte
1758 higher than the top of the frame area. So make sure we
1759 allocate a big enough chunk to keep the frame pointer
1760 aligned like a real one. */
1762 size
= CEIL_ROUND (size
, alignment
);
1765 loc
= assign_stack_temp (BLKmode
, size
, 1);
1766 loc
= XEXP (loc
, 0);
1767 #ifdef FRAME_GROWS_DOWNWARD
1768 /* In this case, virtual_stack_vars_rtx points to one byte
1769 higher than the top of the frame area. So compute the offset
1770 to one byte higher than our substitute frame. */
1771 loc
= plus_constant (loc
, size
);
1773 map
->reg_map
[regno
] = temp
1774 = force_reg (Pmode
, force_operand (loc
, NULL_RTX
));
1776 #ifdef STACK_BOUNDARY
1777 mark_reg_pointer (map
->reg_map
[regno
], STACK_BOUNDARY
);
1780 SET_CONST_EQUIV_DATA (map
, temp
, loc
, CONST_AGE_PARM
);
1782 seq
= gen_sequence ();
1784 emit_insn_after (seq
, map
->insns_at_start
);
1787 else if (regno
== VIRTUAL_INCOMING_ARGS_REGNUM
1788 || (map
->integrating
1789 && (DECL_SAVED_INSNS (map
->fndecl
)->internal_arg_pointer
1792 /* Do the same for a block to contain any arguments referenced
1795 int size
= DECL_SAVED_INSNS (map
->fndecl
)->args_size
;
1798 loc
= assign_stack_temp (BLKmode
, size
, 1);
1799 loc
= XEXP (loc
, 0);
1800 /* When arguments grow downward, the virtual incoming
1801 args pointer points to the top of the argument block,
1802 so the remapped location better do the same. */
1803 #ifdef ARGS_GROW_DOWNWARD
1804 loc
= plus_constant (loc
, size
);
1806 map
->reg_map
[regno
] = temp
1807 = force_reg (Pmode
, force_operand (loc
, NULL_RTX
));
1809 #ifdef STACK_BOUNDARY
1810 mark_reg_pointer (map
->reg_map
[regno
], STACK_BOUNDARY
);
1813 SET_CONST_EQUIV_DATA (map
, temp
, loc
, CONST_AGE_PARM
);
1815 seq
= gen_sequence ();
1817 emit_insn_after (seq
, map
->insns_at_start
);
1820 else if (REG_FUNCTION_VALUE_P (orig
))
1822 /* This is a reference to the function return value. If
1823 the function doesn't have a return value, error. If the
1824 mode doesn't agree, and it ain't BLKmode, make a SUBREG. */
1825 if (map
->inline_target
== 0)
1826 /* Must be unrolling loops or replicating code if we
1827 reach here, so return the register unchanged. */
1829 else if (GET_MODE (map
->inline_target
) != BLKmode
1830 && mode
!= GET_MODE (map
->inline_target
))
1831 return gen_lowpart (mode
, map
->inline_target
);
1833 return map
->inline_target
;
1837 if (map
->reg_map
[regno
] == NULL
)
1839 map
->reg_map
[regno
] = gen_reg_rtx (mode
);
1840 REG_USERVAR_P (map
->reg_map
[regno
]) = REG_USERVAR_P (orig
);
1841 REG_LOOP_TEST_P (map
->reg_map
[regno
]) = REG_LOOP_TEST_P (orig
);
1842 RTX_UNCHANGING_P (map
->reg_map
[regno
]) = RTX_UNCHANGING_P (orig
);
1843 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
1845 if (map
->regno_pointer_flag
[regno
])
1846 mark_reg_pointer (map
->reg_map
[regno
],
1847 map
->regno_pointer_align
[regno
]);
1849 return map
->reg_map
[regno
];
1852 copy
= copy_rtx_and_substitute (SUBREG_REG (orig
), map
, for_lhs
);
1853 /* SUBREG is ordinary, but don't make nested SUBREGs. */
1854 if (GET_CODE (copy
) == SUBREG
)
1855 return gen_rtx_SUBREG (GET_MODE (orig
), SUBREG_REG (copy
),
1856 SUBREG_WORD (orig
) + SUBREG_WORD (copy
));
1857 else if (GET_CODE (copy
) == CONCAT
)
1859 rtx retval
= subreg_realpart_p (orig
) ? XEXP (copy
, 0) : XEXP (copy
, 1);
1861 if (GET_MODE (retval
) == GET_MODE (orig
))
1864 return gen_rtx_SUBREG (GET_MODE (orig
), retval
,
1865 (SUBREG_WORD (orig
) %
1866 (GET_MODE_UNIT_SIZE (GET_MODE (SUBREG_REG (orig
)))
1867 / (unsigned) UNITS_PER_WORD
)));
1870 return gen_rtx_SUBREG (GET_MODE (orig
), copy
,
1871 SUBREG_WORD (orig
));
1874 copy
= gen_rtx_ADDRESSOF (mode
,
1875 copy_rtx_and_substitute (XEXP (orig
, 0),
1877 0, ADDRESSOF_DECL(orig
));
1878 regno
= ADDRESSOF_REGNO (orig
);
1879 if (map
->reg_map
[regno
])
1880 regno
= REGNO (map
->reg_map
[regno
]);
1881 else if (regno
> LAST_VIRTUAL_REGISTER
)
1883 temp
= XEXP (orig
, 0);
1884 map
->reg_map
[regno
] = gen_reg_rtx (GET_MODE (temp
));
1885 REG_USERVAR_P (map
->reg_map
[regno
]) = REG_USERVAR_P (temp
);
1886 REG_LOOP_TEST_P (map
->reg_map
[regno
]) = REG_LOOP_TEST_P (temp
);
1887 RTX_UNCHANGING_P (map
->reg_map
[regno
]) = RTX_UNCHANGING_P (temp
);
1888 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
1890 if (map
->regno_pointer_flag
[regno
])
1891 mark_reg_pointer (map
->reg_map
[regno
],
1892 map
->regno_pointer_align
[regno
]);
1893 regno
= REGNO (map
->reg_map
[regno
]);
1895 ADDRESSOF_REGNO (copy
) = regno
;
1900 /* USE and CLOBBER are ordinary, but we convert (use (subreg foo))
1901 to (use foo) if the original insn didn't have a subreg.
1902 Removing the subreg distorts the VAX movstrhi pattern
1903 by changing the mode of an operand. */
1904 copy
= copy_rtx_and_substitute (XEXP (orig
, 0), map
, code
== CLOBBER
);
1905 if (GET_CODE (copy
) == SUBREG
&& GET_CODE (XEXP (orig
, 0)) != SUBREG
)
1906 copy
= SUBREG_REG (copy
);
1907 return gen_rtx_fmt_e (code
, VOIDmode
, copy
);
1910 LABEL_PRESERVE_P (get_label_from_map (map
, CODE_LABEL_NUMBER (orig
)))
1911 = LABEL_PRESERVE_P (orig
);
1912 return get_label_from_map (map
, CODE_LABEL_NUMBER (orig
));
1914 /* We need to handle "deleted" labels that appear in the DECL_RTL
1917 if (NOTE_LINE_NUMBER (orig
) == NOTE_INSN_DELETED_LABEL
)
1918 return map
->insn_map
[INSN_UID (orig
)];
1925 LABEL_REF_NONLOCAL_P (orig
) ? XEXP (orig
, 0)
1926 : get_label_from_map (map
, CODE_LABEL_NUMBER (XEXP (orig
, 0))));
1928 LABEL_OUTSIDE_LOOP_P (copy
) = LABEL_OUTSIDE_LOOP_P (orig
);
1930 /* The fact that this label was previously nonlocal does not mean
1931 it still is, so we must check if it is within the range of
1932 this function's labels. */
1933 LABEL_REF_NONLOCAL_P (copy
)
1934 = (LABEL_REF_NONLOCAL_P (orig
)
1935 && ! (CODE_LABEL_NUMBER (XEXP (copy
, 0)) >= get_first_label_num ()
1936 && CODE_LABEL_NUMBER (XEXP (copy
, 0)) < max_label_num ()));
1938 /* If we have made a nonlocal label local, it means that this
1939 inlined call will be referring to our nonlocal goto handler.
1940 So make sure we create one for this block; we normally would
1941 not since this is not otherwise considered a "call". */
1942 if (LABEL_REF_NONLOCAL_P (orig
) && ! LABEL_REF_NONLOCAL_P (copy
))
1943 function_call_count
++;
1953 /* Symbols which represent the address of a label stored in the constant
1954 pool must be modified to point to a constant pool entry for the
1955 remapped label. Otherwise, symbols are returned unchanged. */
1956 if (CONSTANT_POOL_ADDRESS_P (orig
))
1958 struct function
*f
= inlining
? inlining
: cfun
;
1959 rtx constant
= get_pool_constant_for_function (f
, orig
);
1960 enum machine_mode const_mode
= get_pool_mode_for_function (f
, orig
);
1963 rtx temp
= force_const_mem (const_mode
,
1964 copy_rtx_and_substitute (constant
,
1968 /* Legitimizing the address here is incorrect.
1970 Since we had a SYMBOL_REF before, we can assume it is valid
1971 to have one in this position in the insn.
1973 Also, change_address may create new registers. These
1974 registers will not have valid reg_map entries. This can
1975 cause try_constants() to fail because assumes that all
1976 registers in the rtx have valid reg_map entries, and it may
1977 end up replacing one of these new registers with junk. */
1979 if (! memory_address_p (GET_MODE (temp
), XEXP (temp
, 0)))
1980 temp
= change_address (temp
, GET_MODE (temp
), XEXP (temp
, 0));
1983 temp
= XEXP (temp
, 0);
1985 #ifdef POINTERS_EXTEND_UNSIGNED
1986 if (GET_MODE (temp
) != GET_MODE (orig
))
1987 temp
= convert_memory_address (GET_MODE (orig
), temp
);
1991 else if (GET_CODE (constant
) == LABEL_REF
)
1992 return XEXP (force_const_mem
1994 copy_rtx_and_substitute (constant
, map
, for_lhs
)),
1998 if (SYMBOL_REF_NEED_ADJUST (orig
))
2001 return rethrow_symbol_map (orig
,
2002 expand_inline_function_eh_labelmap
);
2008 /* We have to make a new copy of this CONST_DOUBLE because don't want
2009 to use the old value of CONST_DOUBLE_MEM. Also, this may be a
2010 duplicate of a CONST_DOUBLE we have already seen. */
2011 if (GET_MODE_CLASS (GET_MODE (orig
)) == MODE_FLOAT
)
2015 REAL_VALUE_FROM_CONST_DOUBLE (d
, orig
);
2016 return CONST_DOUBLE_FROM_REAL_VALUE (d
, GET_MODE (orig
));
2019 return immed_double_const (CONST_DOUBLE_LOW (orig
),
2020 CONST_DOUBLE_HIGH (orig
), VOIDmode
);
2023 /* Make new constant pool entry for a constant
2024 that was in the pool of the inline function. */
2025 if (RTX_INTEGRATED_P (orig
))
2030 /* If a single asm insn contains multiple output operands
2031 then it contains multiple ASM_OPERANDS rtx's that share operand 3.
2032 We must make sure that the copied insn continues to share it. */
2033 if (map
->orig_asm_operands_vector
== XVEC (orig
, 3))
2035 copy
= rtx_alloc (ASM_OPERANDS
);
2036 copy
->volatil
= orig
->volatil
;
2037 XSTR (copy
, 0) = XSTR (orig
, 0);
2038 XSTR (copy
, 1) = XSTR (orig
, 1);
2039 XINT (copy
, 2) = XINT (orig
, 2);
2040 XVEC (copy
, 3) = map
->copy_asm_operands_vector
;
2041 XVEC (copy
, 4) = map
->copy_asm_constraints_vector
;
2042 XSTR (copy
, 5) = XSTR (orig
, 5);
2043 XINT (copy
, 6) = XINT (orig
, 6);
2049 /* This is given special treatment because the first
2050 operand of a CALL is a (MEM ...) which may get
2051 forced into a register for cse. This is undesirable
2052 if function-address cse isn't wanted or if we won't do cse. */
2053 #ifndef NO_FUNCTION_CSE
2054 if (! (optimize
&& ! flag_no_function_cse
))
2059 gen_rtx_MEM (GET_MODE (XEXP (orig
, 0)),
2060 copy_rtx_and_substitute (XEXP (XEXP (orig
, 0), 0),
2062 copy_rtx_and_substitute (XEXP (orig
, 1), map
, 0));
2066 /* Must be ifdefed out for loop unrolling to work. */
2072 /* If this is setting fp or ap, it means that we have a nonlocal goto.
2073 Adjust the setting by the offset of the area we made.
2074 If the nonlocal goto is into the current function,
2075 this will result in unnecessarily bad code, but should work. */
2076 if (SET_DEST (orig
) == virtual_stack_vars_rtx
2077 || SET_DEST (orig
) == virtual_incoming_args_rtx
)
2079 /* In case a translation hasn't occurred already, make one now. */
2082 HOST_WIDE_INT loc_offset
;
2084 copy_rtx_and_substitute (SET_DEST (orig
), map
, for_lhs
);
2085 equiv_reg
= map
->reg_map
[REGNO (SET_DEST (orig
))];
2086 equiv_loc
= VARRAY_CONST_EQUIV (map
->const_equiv_varray
,
2087 REGNO (equiv_reg
)).rtx
;
2089 = GET_CODE (equiv_loc
) == REG
? 0 : INTVAL (XEXP (equiv_loc
, 1));
2091 return gen_rtx_SET (VOIDmode
, SET_DEST (orig
),
2094 (copy_rtx_and_substitute (SET_SRC (orig
),
2100 return gen_rtx_SET (VOIDmode
,
2101 copy_rtx_and_substitute (SET_DEST (orig
), map
, 1),
2102 copy_rtx_and_substitute (SET_SRC (orig
), map
, 0));
2107 && GET_CODE (XEXP (orig
, 0)) == SYMBOL_REF
2108 && CONSTANT_POOL_ADDRESS_P (XEXP (orig
, 0)))
2110 enum machine_mode const_mode
2111 = get_pool_mode_for_function (inlining
, XEXP (orig
, 0));
2113 = get_pool_constant_for_function (inlining
, XEXP (orig
, 0));
2115 constant
= copy_rtx_and_substitute (constant
, map
, 0);
2117 /* If this was an address of a constant pool entry that itself
2118 had to be placed in the constant pool, it might not be a
2119 valid address. So the recursive call might have turned it
2120 into a register. In that case, it isn't a constant any
2121 more, so return it. This has the potential of changing a
2122 MEM into a REG, but we'll assume that it safe. */
2123 if (! CONSTANT_P (constant
))
2126 return validize_mem (force_const_mem (const_mode
, constant
));
2129 copy
= rtx_alloc (MEM
);
2130 PUT_MODE (copy
, mode
);
2131 XEXP (copy
, 0) = copy_rtx_and_substitute (XEXP (orig
, 0), map
, 0);
2132 MEM_COPY_ATTRIBUTES (copy
, orig
);
2139 copy
= rtx_alloc (code
);
2140 PUT_MODE (copy
, mode
);
2141 copy
->in_struct
= orig
->in_struct
;
2142 copy
->volatil
= orig
->volatil
;
2143 copy
->unchanging
= orig
->unchanging
;
2145 format_ptr
= GET_RTX_FORMAT (GET_CODE (copy
));
2147 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (copy
)); i
++)
2149 switch (*format_ptr
++)
2152 /* Copy this through the wide int field; that's safest. */
2153 X0WINT (copy
, i
) = X0WINT (orig
, i
);
2158 = copy_rtx_and_substitute (XEXP (orig
, i
), map
, for_lhs
);
2162 /* Change any references to old-insns to point to the
2163 corresponding copied insns. */
2164 XEXP (copy
, i
) = map
->insn_map
[INSN_UID (XEXP (orig
, i
))];
2168 XVEC (copy
, i
) = XVEC (orig
, i
);
2169 if (XVEC (orig
, i
) != NULL
&& XVECLEN (orig
, i
) != 0)
2171 XVEC (copy
, i
) = rtvec_alloc (XVECLEN (orig
, i
));
2172 for (j
= 0; j
< XVECLEN (copy
, i
); j
++)
2173 XVECEXP (copy
, i
, j
)
2174 = copy_rtx_and_substitute (XVECEXP (orig
, i
, j
),
2180 XWINT (copy
, i
) = XWINT (orig
, i
);
2184 XINT (copy
, i
) = XINT (orig
, i
);
2188 XSTR (copy
, i
) = XSTR (orig
, i
);
2192 XTREE (copy
, i
) = XTREE (orig
, i
);
2200 if (code
== ASM_OPERANDS
&& map
->orig_asm_operands_vector
== 0)
2202 map
->orig_asm_operands_vector
= XVEC (orig
, 3);
2203 map
->copy_asm_operands_vector
= XVEC (copy
, 3);
2204 map
->copy_asm_constraints_vector
= XVEC (copy
, 4);
2210 /* Substitute known constant values into INSN, if that is valid. */
2213 try_constants (insn
, map
)
2215 struct inline_remap
*map
;
2221 /* First try just updating addresses, then other things. This is
2222 important when we have something like the store of a constant
2223 into memory and we can update the memory address but the machine
2224 does not support a constant source. */
2225 subst_constants (&PATTERN (insn
), insn
, map
, 1);
2226 apply_change_group ();
2227 subst_constants (&PATTERN (insn
), insn
, map
, 0);
2228 apply_change_group ();
2230 /* Show we don't know the value of anything stored or clobbered. */
2231 note_stores (PATTERN (insn
), mark_stores
, NULL
);
2232 map
->last_pc_value
= 0;
2234 map
->last_cc0_value
= 0;
2237 /* Set up any constant equivalences made in this insn. */
2238 for (i
= 0; i
< map
->num_sets
; i
++)
2240 if (GET_CODE (map
->equiv_sets
[i
].dest
) == REG
)
2242 int regno
= REGNO (map
->equiv_sets
[i
].dest
);
2244 MAYBE_EXTEND_CONST_EQUIV_VARRAY (map
, regno
);
2245 if (VARRAY_CONST_EQUIV (map
->const_equiv_varray
, regno
).rtx
== 0
2246 /* Following clause is a hack to make case work where GNU C++
2247 reassigns a variable to make cse work right. */
2248 || ! rtx_equal_p (VARRAY_CONST_EQUIV (map
->const_equiv_varray
,
2250 map
->equiv_sets
[i
].equiv
))
2251 SET_CONST_EQUIV_DATA (map
, map
->equiv_sets
[i
].dest
,
2252 map
->equiv_sets
[i
].equiv
, map
->const_age
);
2254 else if (map
->equiv_sets
[i
].dest
== pc_rtx
)
2255 map
->last_pc_value
= map
->equiv_sets
[i
].equiv
;
2257 else if (map
->equiv_sets
[i
].dest
== cc0_rtx
)
2258 map
->last_cc0_value
= map
->equiv_sets
[i
].equiv
;
2263 /* Substitute known constants for pseudo regs in the contents of LOC,
2264 which are part of INSN.
2265 If INSN is zero, the substitution should always be done (this is used to
2267 These changes are taken out by try_constants if the result is not valid.
2269 Note that we are more concerned with determining when the result of a SET
2270 is a constant, for further propagation, than actually inserting constants
2271 into insns; cse will do the latter task better.
2273 This function is also used to adjust address of items previously addressed
2274 via the virtual stack variable or virtual incoming arguments registers.
2276 If MEMONLY is nonzero, only make changes inside a MEM. */
2279 subst_constants (loc
, insn
, map
, memonly
)
2282 struct inline_remap
*map
;
2287 register enum rtx_code code
;
2288 register const char *format_ptr
;
2289 int num_changes
= num_validated_changes ();
2291 enum machine_mode op0_mode
= MAX_MACHINE_MODE
;
2293 code
= GET_CODE (x
);
2309 validate_change (insn
, loc
, map
->last_cc0_value
, 1);
2315 /* The only thing we can do with a USE or CLOBBER is possibly do
2316 some substitutions in a MEM within it. */
2317 if (GET_CODE (XEXP (x
, 0)) == MEM
)
2318 subst_constants (&XEXP (XEXP (x
, 0), 0), insn
, map
, 0);
2322 /* Substitute for parms and known constants. Don't replace
2323 hard regs used as user variables with constants. */
2326 int regno
= REGNO (x
);
2327 struct const_equiv_data
*p
;
2329 if (! (regno
< FIRST_PSEUDO_REGISTER
&& REG_USERVAR_P (x
))
2330 && (size_t) regno
< VARRAY_SIZE (map
->const_equiv_varray
)
2331 && (p
= &VARRAY_CONST_EQUIV (map
->const_equiv_varray
, regno
),
2333 && p
->age
>= map
->const_age
)
2334 validate_change (insn
, loc
, p
->rtx
, 1);
2339 /* SUBREG applied to something other than a reg
2340 should be treated as ordinary, since that must
2341 be a special hack and we don't know how to treat it specially.
2342 Consider for example mulsidi3 in m68k.md.
2343 Ordinary SUBREG of a REG needs this special treatment. */
2344 if (! memonly
&& GET_CODE (SUBREG_REG (x
)) == REG
)
2346 rtx inner
= SUBREG_REG (x
);
2349 /* We can't call subst_constants on &SUBREG_REG (x) because any
2350 constant or SUBREG wouldn't be valid inside our SUBEG. Instead,
2351 see what is inside, try to form the new SUBREG and see if that is
2352 valid. We handle two cases: extracting a full word in an
2353 integral mode and extracting the low part. */
2354 subst_constants (&inner
, NULL_RTX
, map
, 0);
2356 if (GET_MODE_CLASS (GET_MODE (x
)) == MODE_INT
2357 && GET_MODE_SIZE (GET_MODE (x
)) == UNITS_PER_WORD
2358 && GET_MODE (SUBREG_REG (x
)) != VOIDmode
)
2359 new = operand_subword (inner
, SUBREG_WORD (x
), 0,
2360 GET_MODE (SUBREG_REG (x
)));
2362 cancel_changes (num_changes
);
2363 if (new == 0 && subreg_lowpart_p (x
))
2364 new = gen_lowpart_common (GET_MODE (x
), inner
);
2367 validate_change (insn
, loc
, new, 1);
2374 subst_constants (&XEXP (x
, 0), insn
, map
, 0);
2376 /* If a memory address got spoiled, change it back. */
2377 if (! memonly
&& insn
!= 0 && num_validated_changes () != num_changes
2378 && ! memory_address_p (GET_MODE (x
), XEXP (x
, 0)))
2379 cancel_changes (num_changes
);
2384 /* Substitute constants in our source, and in any arguments to a
2385 complex (e..g, ZERO_EXTRACT) destination, but not in the destination
2387 rtx
*dest_loc
= &SET_DEST (x
);
2388 rtx dest
= *dest_loc
;
2391 subst_constants (&SET_SRC (x
), insn
, map
, memonly
);
2394 while (GET_CODE (*dest_loc
) == ZERO_EXTRACT
2395 || GET_CODE (*dest_loc
) == SUBREG
2396 || GET_CODE (*dest_loc
) == STRICT_LOW_PART
)
2398 if (GET_CODE (*dest_loc
) == ZERO_EXTRACT
)
2400 subst_constants (&XEXP (*dest_loc
, 1), insn
, map
, memonly
);
2401 subst_constants (&XEXP (*dest_loc
, 2), insn
, map
, memonly
);
2403 dest_loc
= &XEXP (*dest_loc
, 0);
2406 /* Do substitute in the address of a destination in memory. */
2407 if (GET_CODE (*dest_loc
) == MEM
)
2408 subst_constants (&XEXP (*dest_loc
, 0), insn
, map
, 0);
2410 /* Check for the case of DEST a SUBREG, both it and the underlying
2411 register are less than one word, and the SUBREG has the wider mode.
2412 In the case, we are really setting the underlying register to the
2413 source converted to the mode of DEST. So indicate that. */
2414 if (GET_CODE (dest
) == SUBREG
2415 && GET_MODE_SIZE (GET_MODE (dest
)) <= UNITS_PER_WORD
2416 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest
))) <= UNITS_PER_WORD
2417 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest
)))
2418 <= GET_MODE_SIZE (GET_MODE (dest
)))
2419 && (tem
= gen_lowpart_if_possible (GET_MODE (SUBREG_REG (dest
)),
2421 src
= tem
, dest
= SUBREG_REG (dest
);
2423 /* If storing a recognizable value save it for later recording. */
2424 if ((map
->num_sets
< MAX_RECOG_OPERANDS
)
2425 && (CONSTANT_P (src
)
2426 || (GET_CODE (src
) == REG
2427 && (REGNO (src
) == VIRTUAL_INCOMING_ARGS_REGNUM
2428 || REGNO (src
) == VIRTUAL_STACK_VARS_REGNUM
))
2429 || (GET_CODE (src
) == PLUS
2430 && GET_CODE (XEXP (src
, 0)) == REG
2431 && (REGNO (XEXP (src
, 0)) == VIRTUAL_INCOMING_ARGS_REGNUM
2432 || REGNO (XEXP (src
, 0)) == VIRTUAL_STACK_VARS_REGNUM
)
2433 && CONSTANT_P (XEXP (src
, 1)))
2434 || GET_CODE (src
) == COMPARE
2439 && (src
== pc_rtx
|| GET_CODE (src
) == RETURN
2440 || GET_CODE (src
) == LABEL_REF
))))
2442 /* Normally, this copy won't do anything. But, if SRC is a COMPARE
2443 it will cause us to save the COMPARE with any constants
2444 substituted, which is what we want for later. */
2445 map
->equiv_sets
[map
->num_sets
].equiv
= copy_rtx (src
);
2446 map
->equiv_sets
[map
->num_sets
++].dest
= dest
;
2455 format_ptr
= GET_RTX_FORMAT (code
);
2457 /* If the first operand is an expression, save its mode for later. */
2458 if (*format_ptr
== 'e')
2459 op0_mode
= GET_MODE (XEXP (x
, 0));
2461 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++)
2463 switch (*format_ptr
++)
2470 subst_constants (&XEXP (x
, i
), insn
, map
, memonly
);
2482 if (XVEC (x
, i
) != NULL
&& XVECLEN (x
, i
) != 0)
2483 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2484 subst_constants (&XVECEXP (x
, i
, j
), insn
, map
, memonly
);
2493 /* If this is a commutative operation, move a constant to the second
2494 operand unless the second operand is already a CONST_INT. */
2496 && (GET_RTX_CLASS (code
) == 'c' || code
== NE
|| code
== EQ
)
2497 && CONSTANT_P (XEXP (x
, 0)) && GET_CODE (XEXP (x
, 1)) != CONST_INT
)
2499 rtx tem
= XEXP (x
, 0);
2500 validate_change (insn
, &XEXP (x
, 0), XEXP (x
, 1), 1);
2501 validate_change (insn
, &XEXP (x
, 1), tem
, 1);
2504 /* Simplify the expression in case we put in some constants. */
2506 switch (GET_RTX_CLASS (code
))
2509 if (op0_mode
== MAX_MACHINE_MODE
)
2511 new = simplify_unary_operation (code
, GET_MODE (x
),
2512 XEXP (x
, 0), op0_mode
);
2517 enum machine_mode op_mode
= GET_MODE (XEXP (x
, 0));
2519 if (op_mode
== VOIDmode
)
2520 op_mode
= GET_MODE (XEXP (x
, 1));
2521 new = simplify_relational_operation (code
, op_mode
,
2522 XEXP (x
, 0), XEXP (x
, 1));
2523 #ifdef FLOAT_STORE_FLAG_VALUE
2524 if (new != 0 && GET_MODE_CLASS (GET_MODE (x
)) == MODE_FLOAT
)
2526 enum machine_mode mode
= GET_MODE (x
);
2527 if (new == const0_rtx
)
2528 new = CONST0_RTX (mode
);
2531 REAL_VALUE_TYPE val
= FLOAT_STORE_FLAG_VALUE (mode
);
2532 new = CONST_DOUBLE_FROM_REAL_VALUE (val
, mode
);
2541 new = simplify_binary_operation (code
, GET_MODE (x
),
2542 XEXP (x
, 0), XEXP (x
, 1));
2547 if (op0_mode
== MAX_MACHINE_MODE
)
2550 new = simplify_ternary_operation (code
, GET_MODE (x
), op0_mode
,
2551 XEXP (x
, 0), XEXP (x
, 1),
2557 validate_change (insn
, loc
, new, 1);
2560 /* Show that register modified no longer contain known constants. We are
2561 called from note_stores with parts of the new insn. */
2564 mark_stores (dest
, x
, data
)
2566 rtx x ATTRIBUTE_UNUSED
;
2567 void *data ATTRIBUTE_UNUSED
;
2570 enum machine_mode mode
= VOIDmode
;
2572 /* DEST is always the innermost thing set, except in the case of
2573 SUBREGs of hard registers. */
2575 if (GET_CODE (dest
) == REG
)
2576 regno
= REGNO (dest
), mode
= GET_MODE (dest
);
2577 else if (GET_CODE (dest
) == SUBREG
&& GET_CODE (SUBREG_REG (dest
)) == REG
)
2579 regno
= REGNO (SUBREG_REG (dest
)) + SUBREG_WORD (dest
);
2580 mode
= GET_MODE (SUBREG_REG (dest
));
2585 unsigned int uregno
= regno
;
2586 unsigned int last_reg
= (uregno
>= FIRST_PSEUDO_REGISTER
? uregno
2587 : uregno
+ HARD_REGNO_NREGS (uregno
, mode
) - 1);
2590 /* Ignore virtual stack var or virtual arg register since those
2591 are handled separately. */
2592 if (uregno
!= VIRTUAL_INCOMING_ARGS_REGNUM
2593 && uregno
!= VIRTUAL_STACK_VARS_REGNUM
)
2594 for (i
= uregno
; i
<= last_reg
; i
++)
2595 if ((size_t) i
< VARRAY_SIZE (global_const_equiv_varray
))
2596 VARRAY_CONST_EQUIV (global_const_equiv_varray
, i
).rtx
= 0;
2600 /* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the
2601 given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so
2602 that it points to the node itself, thus indicating that the node is its
2603 own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for
2604 the given node is NULL, recursively descend the decl/block tree which
2605 it is the root of, and for each other ..._DECL or BLOCK node contained
2606 therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also
2607 still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN
2608 values to point to themselves. */
2611 set_block_origin_self (stmt
)
2614 if (BLOCK_ABSTRACT_ORIGIN (stmt
) == NULL_TREE
)
2616 BLOCK_ABSTRACT_ORIGIN (stmt
) = stmt
;
2619 register tree local_decl
;
2621 for (local_decl
= BLOCK_VARS (stmt
);
2622 local_decl
!= NULL_TREE
;
2623 local_decl
= TREE_CHAIN (local_decl
))
2624 set_decl_origin_self (local_decl
); /* Potential recursion. */
2628 register tree subblock
;
2630 for (subblock
= BLOCK_SUBBLOCKS (stmt
);
2631 subblock
!= NULL_TREE
;
2632 subblock
= BLOCK_CHAIN (subblock
))
2633 set_block_origin_self (subblock
); /* Recurse. */
2638 /* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for
2639 the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the
2640 node to so that it points to the node itself, thus indicating that the
2641 node represents its own (abstract) origin. Additionally, if the
2642 DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend
2643 the decl/block tree of which the given node is the root of, and for
2644 each other ..._DECL or BLOCK node contained therein whose
2645 DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL,
2646 set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to
2647 point to themselves. */
2650 set_decl_origin_self (decl
)
2653 if (DECL_ABSTRACT_ORIGIN (decl
) == NULL_TREE
)
2655 DECL_ABSTRACT_ORIGIN (decl
) = decl
;
2656 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2660 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= TREE_CHAIN (arg
))
2661 DECL_ABSTRACT_ORIGIN (arg
) = arg
;
2662 if (DECL_INITIAL (decl
) != NULL_TREE
2663 && DECL_INITIAL (decl
) != error_mark_node
)
2664 set_block_origin_self (DECL_INITIAL (decl
));
2669 /* Given a pointer to some BLOCK node, and a boolean value to set the
2670 "abstract" flags to, set that value into the BLOCK_ABSTRACT flag for
2671 the given block, and for all local decls and all local sub-blocks
2672 (recursively) which are contained therein. */
2675 set_block_abstract_flags (stmt
, setting
)
2677 register int setting
;
2679 register tree local_decl
;
2680 register tree subblock
;
2682 BLOCK_ABSTRACT (stmt
) = setting
;
2684 for (local_decl
= BLOCK_VARS (stmt
);
2685 local_decl
!= NULL_TREE
;
2686 local_decl
= TREE_CHAIN (local_decl
))
2687 set_decl_abstract_flags (local_decl
, setting
);
2689 for (subblock
= BLOCK_SUBBLOCKS (stmt
);
2690 subblock
!= NULL_TREE
;
2691 subblock
= BLOCK_CHAIN (subblock
))
2692 set_block_abstract_flags (subblock
, setting
);
2695 /* Given a pointer to some ..._DECL node, and a boolean value to set the
2696 "abstract" flags to, set that value into the DECL_ABSTRACT flag for the
2697 given decl, and (in the case where the decl is a FUNCTION_DECL) also
2698 set the abstract flags for all of the parameters, local vars, local
2699 blocks and sub-blocks (recursively) to the same setting. */
2702 set_decl_abstract_flags (decl
, setting
)
2704 register int setting
;
2706 DECL_ABSTRACT (decl
) = setting
;
2707 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2711 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= TREE_CHAIN (arg
))
2712 DECL_ABSTRACT (arg
) = setting
;
2713 if (DECL_INITIAL (decl
) != NULL_TREE
2714 && DECL_INITIAL (decl
) != error_mark_node
)
2715 set_block_abstract_flags (DECL_INITIAL (decl
), setting
);
2719 /* Output the assembly language code for the function FNDECL
2720 from its DECL_SAVED_INSNS. Used for inline functions that are output
2721 at end of compilation instead of where they came in the source. */
2724 output_inline_function (fndecl
)
2727 struct function
*old_cfun
= cfun
;
2728 struct function
*f
= DECL_SAVED_INSNS (fndecl
);
2731 current_function_decl
= fndecl
;
2732 clear_emit_caches ();
2734 /* Things we allocate from here on are part of this function, not
2736 temporary_allocation ();
2738 set_new_last_label_num (f
->inl_max_label_num
);
2740 /* We're not deferring this any longer. */
2741 DECL_DEFER_OUTPUT (fndecl
) = 0;
2743 /* Compile this function all the way down to assembly code. */
2744 rest_of_compilation (fndecl
);
2746 /* We can't inline this anymore. */
2748 DECL_INLINE (fndecl
) = 0;
2751 current_function_decl
= old_cfun
? old_cfun
->decl
: 0;