1 /* Procedure integration for GNU CC.
2 Copyright (C) 1988, 1991, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
31 #include "insn-config.h"
32 #include "insn-flags.h"
36 #include "integrate.h"
46 #define obstack_chunk_alloc xmalloc
47 #define obstack_chunk_free free
49 extern struct obstack
*function_maybepermanent_obstack
;
51 /* Similar, but round to the next highest integer that meets the
53 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
55 /* Default max number of insns a function can have and still be inline.
56 This is overridden on RISC machines. */
57 #ifndef INTEGRATE_THRESHOLD
58 /* Inlining small functions might save more space then not inlining at
59 all. Assume 1 instruction for the call and 1.5 insns per argument. */
60 #define INTEGRATE_THRESHOLD(DECL) \
62 ? (1 + (3 * list_length (DECL_ARGUMENTS (DECL))) / 2) \
63 : (8 * (8 + list_length (DECL_ARGUMENTS (DECL)))))
66 /* Decide whether a function with a target specific attribute
67 attached can be inlined. By default we disallow this. */
68 #ifndef FUNCTION_ATTRIBUTE_INLINABLE_P
69 #define FUNCTION_ATTRIBUTE_INLINABLE_P(FNDECL) 0
72 static rtvec initialize_for_inline
PARAMS ((tree
));
73 static void note_modified_parmregs
PARAMS ((rtx
, rtx
, void *));
74 static void integrate_parm_decls
PARAMS ((tree
, struct inline_remap
*,
76 static tree integrate_decl_tree
PARAMS ((tree
,
77 struct inline_remap
*));
78 static void subst_constants
PARAMS ((rtx
*, rtx
,
79 struct inline_remap
*, int));
80 static void set_block_origin_self
PARAMS ((tree
));
81 static void set_block_abstract_flags
PARAMS ((tree
, int));
82 static void process_reg_param
PARAMS ((struct inline_remap
*, rtx
,
84 void set_decl_abstract_flags
PARAMS ((tree
, int));
85 static rtx expand_inline_function_eh_labelmap
PARAMS ((rtx
));
86 static void mark_stores
PARAMS ((rtx
, rtx
, void *));
87 static void save_parm_insns
PARAMS ((rtx
, rtx
));
88 static void copy_insn_list
PARAMS ((rtx
, struct inline_remap
*,
90 static int compare_blocks
PARAMS ((const PTR
, const PTR
));
91 static int find_block
PARAMS ((const PTR
, const PTR
));
93 /* Used by copy_rtx_and_substitute; this indicates whether the function is
94 called for the purpose of inlining or some other purpose (i.e. loop
95 unrolling). This affects how constant pool references are handled.
96 This variable contains the FUNCTION_DECL for the inlined function. */
97 static struct function
*inlining
= 0;
99 /* Returns the Ith entry in the label_map contained in MAP. If the
100 Ith entry has not yet been set, return a fresh label. This function
101 performs a lazy initialization of label_map, thereby avoiding huge memory
102 explosions when the label_map gets very large. */
105 get_label_from_map (map
, i
)
106 struct inline_remap
*map
;
109 rtx x
= map
->label_map
[i
];
112 x
= map
->label_map
[i
] = gen_label_rtx ();
117 /* Zero if the current function (whose FUNCTION_DECL is FNDECL)
118 is safe and reasonable to integrate into other functions.
119 Nonzero means value is a warning msgid with a single %s
120 for the function's name. */
123 function_cannot_inline_p (fndecl
)
124 register tree fndecl
;
127 tree last
= tree_last (TYPE_ARG_TYPES (TREE_TYPE (fndecl
)));
129 /* For functions marked as inline increase the maximum size to
130 MAX_INLINE_INSNS (-finline-limit-<n>). For regular functions
131 use the limit given by INTEGRATE_THRESHOLD. */
133 int max_insns
= (DECL_INLINE (fndecl
))
135 + 8 * list_length (DECL_ARGUMENTS (fndecl
)))
136 : INTEGRATE_THRESHOLD (fndecl
);
138 register int ninsns
= 0;
141 if (DECL_UNINLINABLE (fndecl
))
142 return N_("function cannot be inline");
144 /* No inlines with varargs. */
145 if ((last
&& TREE_VALUE (last
) != void_type_node
)
146 || current_function_varargs
)
147 return N_("varargs function cannot be inline");
149 if (current_function_calls_alloca
)
150 return N_("function using alloca cannot be inline");
152 if (current_function_calls_setjmp
)
153 return N_("function using setjmp cannot be inline");
155 if (current_function_contains_functions
)
156 return N_("function with nested functions cannot be inline");
160 N_("function with label addresses used in initializers cannot inline");
162 if (current_function_cannot_inline
)
163 return current_function_cannot_inline
;
165 /* If its not even close, don't even look. */
166 if (get_max_uid () > 3 * max_insns
)
167 return N_("function too large to be inline");
170 /* Don't inline functions which do not specify a function prototype and
171 have BLKmode argument or take the address of a parameter. */
172 for (parms
= DECL_ARGUMENTS (fndecl
); parms
; parms
= TREE_CHAIN (parms
))
174 if (TYPE_MODE (TREE_TYPE (parms
)) == BLKmode
)
175 TREE_ADDRESSABLE (parms
) = 1;
176 if (last
== NULL_TREE
&& TREE_ADDRESSABLE (parms
))
177 return N_("no prototype, and parameter address used; cannot be inline");
181 /* We can't inline functions that return structures
182 the old-fashioned PCC way, copying into a static block. */
183 if (current_function_returns_pcc_struct
)
184 return N_("inline functions not supported for this return value type");
186 /* We can't inline functions that return structures of varying size. */
187 if (TREE_CODE (TREE_TYPE (TREE_TYPE (fndecl
))) != VOID_TYPE
188 && int_size_in_bytes (TREE_TYPE (TREE_TYPE (fndecl
))) < 0)
189 return N_("function with varying-size return value cannot be inline");
191 /* Cannot inline a function with a varying size argument or one that
192 receives a transparent union. */
193 for (parms
= DECL_ARGUMENTS (fndecl
); parms
; parms
= TREE_CHAIN (parms
))
195 if (int_size_in_bytes (TREE_TYPE (parms
)) < 0)
196 return N_("function with varying-size parameter cannot be inline");
197 else if (TREE_CODE (TREE_TYPE (parms
)) == UNION_TYPE
198 && TYPE_TRANSPARENT_UNION (TREE_TYPE (parms
)))
199 return N_("function with transparent unit parameter cannot be inline");
202 if (get_max_uid () > max_insns
)
204 for (ninsns
= 0, insn
= get_first_nonparm_insn ();
205 insn
&& ninsns
< max_insns
;
206 insn
= NEXT_INSN (insn
))
210 if (ninsns
>= max_insns
)
211 return N_("function too large to be inline");
214 /* We will not inline a function which uses computed goto. The addresses of
215 its local labels, which may be tucked into global storage, are of course
216 not constant across instantiations, which causes unexpected behaviour. */
217 if (current_function_has_computed_jump
)
218 return N_("function with computed jump cannot inline");
220 /* We cannot inline a nested function that jumps to a nonlocal label. */
221 if (current_function_has_nonlocal_goto
)
222 return N_("function with nonlocal goto cannot be inline");
224 /* This is a hack, until the inliner is taught about eh regions at
225 the start of the function. */
226 for (insn
= get_insns ();
228 && ! (GET_CODE (insn
) == NOTE
229 && NOTE_LINE_NUMBER (insn
) == NOTE_INSN_FUNCTION_BEG
);
230 insn
= NEXT_INSN (insn
))
232 if (insn
&& GET_CODE (insn
) == NOTE
233 && NOTE_LINE_NUMBER (insn
) == NOTE_INSN_EH_REGION_BEG
)
234 return N_("function with complex parameters cannot be inline");
237 /* We can't inline functions that return a PARALLEL rtx. */
238 if (DECL_RTL_SET_P (DECL_RESULT (fndecl
)))
240 rtx result
= DECL_RTL (DECL_RESULT (fndecl
));
241 if (GET_CODE (result
) == PARALLEL
)
242 return N_("inline functions not supported for this return value type");
245 /* If the function has a target specific attribute attached to it,
246 then we assume that we should not inline it. This can be overriden
247 by the target if it defines FUNCTION_ATTRIBUTE_INLINABLE_P. */
248 if (DECL_MACHINE_ATTRIBUTES (fndecl
)
249 && ! FUNCTION_ATTRIBUTE_INLINABLE_P (fndecl
))
250 return N_("function with target specific attribute(s) cannot be inlined");
255 /* Map pseudo reg number into the PARM_DECL for the parm living in the reg.
256 Zero for a reg that isn't a parm's home.
257 Only reg numbers less than max_parm_reg are mapped here. */
258 static tree
*parmdecl_map
;
260 /* In save_for_inline, nonzero if past the parm-initialization insns. */
261 static int in_nonparm_insns
;
263 /* Subroutine for `save_for_inline'. Performs initialization
264 needed to save FNDECL's insns and info for future inline expansion. */
267 initialize_for_inline (fndecl
)
274 /* Clear out PARMDECL_MAP. It was allocated in the caller's frame. */
275 memset ((char *) parmdecl_map
, 0, max_parm_reg
* sizeof (tree
));
276 arg_vector
= rtvec_alloc (list_length (DECL_ARGUMENTS (fndecl
)));
278 for (parms
= DECL_ARGUMENTS (fndecl
), i
= 0;
280 parms
= TREE_CHAIN (parms
), i
++)
282 rtx p
= DECL_RTL (parms
);
284 /* If we have (mem (addressof (mem ...))), use the inner MEM since
285 otherwise the copy_rtx call below will not unshare the MEM since
286 it shares ADDRESSOF. */
287 if (GET_CODE (p
) == MEM
&& GET_CODE (XEXP (p
, 0)) == ADDRESSOF
288 && GET_CODE (XEXP (XEXP (p
, 0), 0)) == MEM
)
289 p
= XEXP (XEXP (p
, 0), 0);
291 RTVEC_ELT (arg_vector
, i
) = p
;
293 if (GET_CODE (p
) == REG
)
294 parmdecl_map
[REGNO (p
)] = parms
;
295 else if (GET_CODE (p
) == CONCAT
)
297 rtx preal
= gen_realpart (GET_MODE (XEXP (p
, 0)), p
);
298 rtx pimag
= gen_imagpart (GET_MODE (preal
), p
);
300 if (GET_CODE (preal
) == REG
)
301 parmdecl_map
[REGNO (preal
)] = parms
;
302 if (GET_CODE (pimag
) == REG
)
303 parmdecl_map
[REGNO (pimag
)] = parms
;
306 /* This flag is cleared later
307 if the function ever modifies the value of the parm. */
308 TREE_READONLY (parms
) = 1;
314 /* Copy NODE (which must be a DECL, but not a PARM_DECL). The DECL
315 originally was in the FROM_FN, but now it will be in the
319 copy_decl_for_inlining (decl
, from_fn
, to_fn
)
326 /* Copy the declaration. */
327 if (TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
)
329 /* For a parameter, we must make an equivalent VAR_DECL, not a
331 copy
= build_decl (VAR_DECL
, DECL_NAME (decl
), TREE_TYPE (decl
));
332 TREE_ADDRESSABLE (copy
) = TREE_ADDRESSABLE (decl
);
333 TREE_READONLY (copy
) = TREE_READONLY (decl
);
334 TREE_THIS_VOLATILE (copy
) = TREE_THIS_VOLATILE (decl
);
338 copy
= copy_node (decl
);
339 if (DECL_LANG_SPECIFIC (copy
))
340 copy_lang_decl (copy
);
342 /* TREE_ADDRESSABLE isn't used to indicate that a label's
343 address has been taken; it's for internal bookkeeping in
344 expand_goto_internal. */
345 if (TREE_CODE (copy
) == LABEL_DECL
)
346 TREE_ADDRESSABLE (copy
) = 0;
349 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
350 declaration inspired this copy. */
351 DECL_ABSTRACT_ORIGIN (copy
) = DECL_ORIGIN (decl
);
353 /* The new variable/label has no RTL, yet. */
354 SET_DECL_RTL (copy
, NULL_RTX
);
356 /* These args would always appear unused, if not for this. */
357 TREE_USED (copy
) = 1;
359 /* Set the context for the new declaration. */
360 if (!DECL_CONTEXT (decl
))
361 /* Globals stay global. */
363 else if (DECL_CONTEXT (decl
) != from_fn
)
364 /* Things that weren't in the scope of the function we're inlining
365 from aren't in the scope we're inlining too, either. */
367 else if (TREE_STATIC (decl
))
368 /* Function-scoped static variables should say in the original
372 /* Ordinary automatic local variables are now in the scope of the
374 DECL_CONTEXT (copy
) = to_fn
;
379 /* Make the insns and PARM_DECLs of the current function permanent
380 and record other information in DECL_SAVED_INSNS to allow inlining
381 of this function in subsequent calls.
383 This routine need not copy any insns because we are not going
384 to immediately compile the insns in the insn chain. There
385 are two cases when we would compile the insns for FNDECL:
386 (1) when FNDECL is expanded inline, and (2) when FNDECL needs to
387 be output at the end of other compilation, because somebody took
388 its address. In the first case, the insns of FNDECL are copied
389 as it is expanded inline, so FNDECL's saved insns are not
390 modified. In the second case, FNDECL is used for the last time,
391 so modifying the rtl is not a problem.
393 We don't have to worry about FNDECL being inline expanded by
394 other functions which are written at the end of compilation
395 because flag_no_inline is turned on when we begin writing
396 functions at the end of compilation. */
399 save_for_inline (fndecl
)
404 rtx first_nonparm_insn
;
406 /* Set up PARMDECL_MAP which maps pseudo-reg number to its PARM_DECL.
407 Later we set TREE_READONLY to 0 if the parm is modified inside the fn.
408 Also set up ARG_VECTOR, which holds the unmodified DECL_RTX values
409 for the parms, prior to elimination of virtual registers.
410 These values are needed for substituting parms properly. */
412 parmdecl_map
= (tree
*) xmalloc (max_parm_reg
* sizeof (tree
));
414 /* Make and emit a return-label if we have not already done so. */
416 if (return_label
== 0)
418 return_label
= gen_label_rtx ();
419 emit_label (return_label
);
422 argvec
= initialize_for_inline (fndecl
);
424 /* If there are insns that copy parms from the stack into pseudo registers,
425 those insns are not copied. `expand_inline_function' must
426 emit the correct code to handle such things. */
429 if (GET_CODE (insn
) != NOTE
)
432 /* Get the insn which signals the end of parameter setup code. */
433 first_nonparm_insn
= get_first_nonparm_insn ();
435 /* Now just scan the chain of insns to see what happens to our
436 PARM_DECLs. If a PARM_DECL is used but never modified, we
437 can substitute its rtl directly when expanding inline (and
438 perform constant folding when its incoming value is constant).
439 Otherwise, we have to copy its value into a new register and track
440 the new register's life. */
441 in_nonparm_insns
= 0;
442 save_parm_insns (insn
, first_nonparm_insn
);
444 cfun
->inl_max_label_num
= max_label_num ();
445 cfun
->inl_last_parm_insn
= cfun
->x_last_parm_insn
;
446 cfun
->original_arg_vector
= argvec
;
447 cfun
->original_decl_initial
= DECL_INITIAL (fndecl
);
448 cfun
->no_debugging_symbols
= (write_symbols
== NO_DEBUG
);
449 DECL_SAVED_INSNS (fndecl
) = cfun
;
455 /* Scan the chain of insns to see what happens to our PARM_DECLs. If a
456 PARM_DECL is used but never modified, we can substitute its rtl directly
457 when expanding inline (and perform constant folding when its incoming
458 value is constant). Otherwise, we have to copy its value into a new
459 register and track the new register's life. */
462 save_parm_insns (insn
, first_nonparm_insn
)
464 rtx first_nonparm_insn
;
466 if (insn
== NULL_RTX
)
469 for (insn
= NEXT_INSN (insn
); insn
; insn
= NEXT_INSN (insn
))
471 if (insn
== first_nonparm_insn
)
472 in_nonparm_insns
= 1;
476 /* Record what interesting things happen to our parameters. */
477 note_stores (PATTERN (insn
), note_modified_parmregs
, NULL
);
479 /* If this is a CALL_PLACEHOLDER insn then we need to look into the
480 three attached sequences: normal call, sibling call and tail
482 if (GET_CODE (insn
) == CALL_INSN
483 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
487 for (i
= 0; i
< 3; i
++)
488 save_parm_insns (XEXP (PATTERN (insn
), i
),
495 /* Note whether a parameter is modified or not. */
498 note_modified_parmregs (reg
, x
, data
)
500 rtx x ATTRIBUTE_UNUSED
;
501 void *data ATTRIBUTE_UNUSED
;
503 if (GET_CODE (reg
) == REG
&& in_nonparm_insns
504 && REGNO (reg
) < max_parm_reg
505 && REGNO (reg
) >= FIRST_PSEUDO_REGISTER
506 && parmdecl_map
[REGNO (reg
)] != 0)
507 TREE_READONLY (parmdecl_map
[REGNO (reg
)]) = 0;
510 /* Unfortunately, we need a global copy of const_equiv map for communication
511 with a function called from note_stores. Be *very* careful that this
512 is used properly in the presence of recursion. */
514 varray_type global_const_equiv_varray
;
516 #define FIXED_BASE_PLUS_P(X) \
517 (GET_CODE (X) == PLUS && GET_CODE (XEXP (X, 1)) == CONST_INT \
518 && GET_CODE (XEXP (X, 0)) == REG \
519 && REGNO (XEXP (X, 0)) >= FIRST_VIRTUAL_REGISTER \
520 && REGNO (XEXP (X, 0)) <= LAST_VIRTUAL_REGISTER)
522 /* Called to set up a mapping for the case where a parameter is in a
523 register. If it is read-only and our argument is a constant, set up the
524 constant equivalence.
526 If LOC is REG_USERVAR_P, the usual case, COPY must also have that flag set
529 Also, don't allow hard registers here; they might not be valid when
530 substituted into insns. */
532 process_reg_param (map
, loc
, copy
)
533 struct inline_remap
*map
;
536 if ((GET_CODE (copy
) != REG
&& GET_CODE (copy
) != SUBREG
)
537 || (GET_CODE (copy
) == REG
&& REG_USERVAR_P (loc
)
538 && ! REG_USERVAR_P (copy
))
539 || (GET_CODE (copy
) == REG
540 && REGNO (copy
) < FIRST_PSEUDO_REGISTER
))
542 rtx temp
= copy_to_mode_reg (GET_MODE (loc
), copy
);
543 REG_USERVAR_P (temp
) = REG_USERVAR_P (loc
);
544 if (CONSTANT_P (copy
) || FIXED_BASE_PLUS_P (copy
))
545 SET_CONST_EQUIV_DATA (map
, temp
, copy
, CONST_AGE_PARM
);
548 map
->reg_map
[REGNO (loc
)] = copy
;
551 /* Used by duplicate_eh_handlers to map labels for the exception table */
552 static struct inline_remap
*eif_eh_map
;
555 expand_inline_function_eh_labelmap (label
)
558 int index
= CODE_LABEL_NUMBER (label
);
559 return get_label_from_map (eif_eh_map
, index
);
562 /* Compare two BLOCKs for qsort. The key we sort on is the
563 BLOCK_ABSTRACT_ORIGIN of the blocks. */
566 compare_blocks (v1
, v2
)
570 tree b1
= *((const tree
*) v1
);
571 tree b2
= *((const tree
*) v2
);
573 return ((char *) BLOCK_ABSTRACT_ORIGIN (b1
)
574 - (char *) BLOCK_ABSTRACT_ORIGIN (b2
));
577 /* Compare two BLOCKs for bsearch. The first pointer corresponds to
578 an original block; the second to a remapped equivalent. */
585 const union tree_node
*b1
= (const union tree_node
*) v1
;
586 tree b2
= *((const tree
*) v2
);
588 return ((const char *) b1
- (char *) BLOCK_ABSTRACT_ORIGIN (b2
));
591 /* Integrate the procedure defined by FNDECL. Note that this function
592 may wind up calling itself. Since the static variables are not
593 reentrant, we do not assign them until after the possibility
594 of recursion is eliminated.
596 If IGNORE is nonzero, do not produce a value.
597 Otherwise store the value in TARGET if it is nonzero and that is convenient.
600 (rtx)-1 if we could not substitute the function
601 0 if we substituted it and it does not produce a value
602 else an rtx for where the value is stored. */
605 expand_inline_function (fndecl
, parms
, target
, ignore
, type
,
606 structure_value_addr
)
611 rtx structure_value_addr
;
613 struct function
*inlining_previous
;
614 struct function
*inl_f
= DECL_SAVED_INSNS (fndecl
);
615 tree formal
, actual
, block
;
616 rtx parm_insns
= inl_f
->emit
->x_first_insn
;
617 rtx insns
= (inl_f
->inl_last_parm_insn
618 ? NEXT_INSN (inl_f
->inl_last_parm_insn
)
624 int min_labelno
= inl_f
->emit
->x_first_label_num
;
625 int max_labelno
= inl_f
->inl_max_label_num
;
630 struct inline_remap
*map
= 0;
634 rtvec arg_vector
= (rtvec
) inl_f
->original_arg_vector
;
635 rtx static_chain_value
= 0;
638 /* The pointer used to track the true location of the memory used
639 for MAP->LABEL_MAP. */
640 rtx
*real_label_map
= 0;
642 /* Allow for equivalences of the pseudos we make for virtual fp and ap. */
643 max_regno
= inl_f
->emit
->x_reg_rtx_no
+ 3;
644 if (max_regno
< FIRST_PSEUDO_REGISTER
)
647 /* Pull out the decl for the function definition; fndecl may be a
648 local declaration, which would break DECL_ABSTRACT_ORIGIN. */
649 fndecl
= inl_f
->decl
;
651 nargs
= list_length (DECL_ARGUMENTS (fndecl
));
653 if (cfun
->preferred_stack_boundary
< inl_f
->preferred_stack_boundary
)
654 cfun
->preferred_stack_boundary
= inl_f
->preferred_stack_boundary
;
656 /* Check that the parms type match and that sufficient arguments were
657 passed. Since the appropriate conversions or default promotions have
658 already been applied, the machine modes should match exactly. */
660 for (formal
= DECL_ARGUMENTS (fndecl
), actual
= parms
;
662 formal
= TREE_CHAIN (formal
), actual
= TREE_CHAIN (actual
))
665 enum machine_mode mode
;
668 return (rtx
) (HOST_WIDE_INT
) -1;
670 arg
= TREE_VALUE (actual
);
671 mode
= TYPE_MODE (DECL_ARG_TYPE (formal
));
673 if (mode
!= TYPE_MODE (TREE_TYPE (arg
))
674 /* If they are block mode, the types should match exactly.
675 They don't match exactly if TREE_TYPE (FORMAL) == ERROR_MARK_NODE,
676 which could happen if the parameter has incomplete type. */
678 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg
))
679 != TYPE_MAIN_VARIANT (TREE_TYPE (formal
)))))
680 return (rtx
) (HOST_WIDE_INT
) -1;
683 /* Extra arguments are valid, but will be ignored below, so we must
684 evaluate them here for side-effects. */
685 for (; actual
; actual
= TREE_CHAIN (actual
))
686 expand_expr (TREE_VALUE (actual
), const0_rtx
,
687 TYPE_MODE (TREE_TYPE (TREE_VALUE (actual
))), 0);
689 /* Expand the function arguments. Do this first so that any
690 new registers get created before we allocate the maps. */
692 arg_vals
= (rtx
*) xmalloc (nargs
* sizeof (rtx
));
693 arg_trees
= (tree
*) xmalloc (nargs
* sizeof (tree
));
695 for (formal
= DECL_ARGUMENTS (fndecl
), actual
= parms
, i
= 0;
697 formal
= TREE_CHAIN (formal
), actual
= TREE_CHAIN (actual
), i
++)
699 /* Actual parameter, converted to the type of the argument within the
701 tree arg
= convert (TREE_TYPE (formal
), TREE_VALUE (actual
));
702 /* Mode of the variable used within the function. */
703 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (formal
));
707 loc
= RTVEC_ELT (arg_vector
, i
);
709 /* If this is an object passed by invisible reference, we copy the
710 object into a stack slot and save its address. If this will go
711 into memory, we do nothing now. Otherwise, we just expand the
713 if (GET_CODE (loc
) == MEM
&& GET_CODE (XEXP (loc
, 0)) == REG
714 && REGNO (XEXP (loc
, 0)) > LAST_VIRTUAL_REGISTER
)
716 rtx stack_slot
= assign_temp (TREE_TYPE (arg
), 1, 1, 1);
718 store_expr (arg
, stack_slot
, 0);
719 arg_vals
[i
] = XEXP (stack_slot
, 0);
722 else if (GET_CODE (loc
) != MEM
)
724 if (GET_MODE (loc
) != TYPE_MODE (TREE_TYPE (arg
)))
725 /* The mode if LOC and ARG can differ if LOC was a variable
726 that had its mode promoted via PROMOTED_MODE. */
727 arg_vals
[i
] = convert_modes (GET_MODE (loc
),
728 TYPE_MODE (TREE_TYPE (arg
)),
729 expand_expr (arg
, NULL_RTX
, mode
,
731 TREE_UNSIGNED (TREE_TYPE (formal
)));
733 arg_vals
[i
] = expand_expr (arg
, NULL_RTX
, mode
, EXPAND_SUM
);
739 && (! TREE_READONLY (formal
)
740 /* If the parameter is not read-only, copy our argument through
741 a register. Also, we cannot use ARG_VALS[I] if it overlaps
742 TARGET in any way. In the inline function, they will likely
743 be two different pseudos, and `safe_from_p' will make all
744 sorts of smart assumptions about their not conflicting.
745 But if ARG_VALS[I] overlaps TARGET, these assumptions are
746 wrong, so put ARG_VALS[I] into a fresh register.
747 Don't worry about invisible references, since their stack
748 temps will never overlap the target. */
751 && (GET_CODE (arg_vals
[i
]) == REG
752 || GET_CODE (arg_vals
[i
]) == SUBREG
753 || GET_CODE (arg_vals
[i
]) == MEM
)
754 && reg_overlap_mentioned_p (arg_vals
[i
], target
))
755 /* ??? We must always copy a SUBREG into a REG, because it might
756 get substituted into an address, and not all ports correctly
757 handle SUBREGs in addresses. */
758 || (GET_CODE (arg_vals
[i
]) == SUBREG
)))
759 arg_vals
[i
] = copy_to_mode_reg (GET_MODE (loc
), arg_vals
[i
]);
761 if (arg_vals
[i
] != 0 && GET_CODE (arg_vals
[i
]) == REG
762 && POINTER_TYPE_P (TREE_TYPE (formal
)))
763 mark_reg_pointer (arg_vals
[i
],
764 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (formal
))));
767 /* Allocate the structures we use to remap things. */
769 map
= (struct inline_remap
*) xcalloc (1, sizeof (struct inline_remap
));
770 map
->fndecl
= fndecl
;
772 VARRAY_TREE_INIT (map
->block_map
, 10, "block_map");
773 map
->reg_map
= (rtx
*) xcalloc (max_regno
, sizeof (rtx
));
775 /* We used to use alloca here, but the size of what it would try to
776 allocate would occasionally cause it to exceed the stack limit and
777 cause unpredictable core dumps. */
779 = (rtx
*) xmalloc ((max_labelno
) * sizeof (rtx
));
780 map
->label_map
= real_label_map
;
782 inl_max_uid
= (inl_f
->emit
->x_cur_insn_uid
+ 1);
783 map
->insn_map
= (rtx
*) xcalloc (inl_max_uid
, sizeof (rtx
));
785 map
->max_insnno
= inl_max_uid
;
787 map
->integrating
= 1;
788 map
->compare_src
= NULL_RTX
;
789 map
->compare_mode
= VOIDmode
;
791 /* const_equiv_varray maps pseudos in our routine to constants, so
792 it needs to be large enough for all our pseudos. This is the
793 number we are currently using plus the number in the called
794 routine, plus 15 for each arg, five to compute the virtual frame
795 pointer, and five for the return value. This should be enough
796 for most cases. We do not reference entries outside the range of
799 ??? These numbers are quite arbitrary and were obtained by
800 experimentation. At some point, we should try to allocate the
801 table after all the parameters are set up so we an more accurately
802 estimate the number of pseudos we will need. */
804 VARRAY_CONST_EQUIV_INIT (map
->const_equiv_varray
,
806 + (max_regno
- FIRST_PSEUDO_REGISTER
)
809 "expand_inline_function");
812 /* Record the current insn in case we have to set up pointers to frame
813 and argument memory blocks. If there are no insns yet, add a dummy
814 insn that can be used as an insertion point. */
815 map
->insns_at_start
= get_last_insn ();
816 if (map
->insns_at_start
== 0)
817 map
->insns_at_start
= emit_note (NULL_PTR
, NOTE_INSN_DELETED
);
819 map
->regno_pointer_align
= inl_f
->emit
->regno_pointer_align
;
820 map
->x_regno_reg_rtx
= inl_f
->emit
->x_regno_reg_rtx
;
822 /* Update the outgoing argument size to allow for those in the inlined
824 if (inl_f
->outgoing_args_size
> current_function_outgoing_args_size
)
825 current_function_outgoing_args_size
= inl_f
->outgoing_args_size
;
827 /* If the inline function needs to make PIC references, that means
828 that this function's PIC offset table must be used. */
829 if (inl_f
->uses_pic_offset_table
)
830 current_function_uses_pic_offset_table
= 1;
832 /* If this function needs a context, set it up. */
833 if (inl_f
->needs_context
)
834 static_chain_value
= lookup_static_chain (fndecl
);
836 if (GET_CODE (parm_insns
) == NOTE
837 && NOTE_LINE_NUMBER (parm_insns
) > 0)
839 rtx note
= emit_note (NOTE_SOURCE_FILE (parm_insns
),
840 NOTE_LINE_NUMBER (parm_insns
));
842 RTX_INTEGRATED_P (note
) = 1;
845 /* Process each argument. For each, set up things so that the function's
846 reference to the argument will refer to the argument being passed.
847 We only replace REG with REG here. Any simplifications are done
850 We make two passes: In the first, we deal with parameters that will
851 be placed into registers, since we need to ensure that the allocated
852 register number fits in const_equiv_map. Then we store all non-register
853 parameters into their memory location. */
855 /* Don't try to free temp stack slots here, because we may put one of the
856 parameters into a temp stack slot. */
858 for (i
= 0; i
< nargs
; i
++)
860 rtx copy
= arg_vals
[i
];
862 loc
= RTVEC_ELT (arg_vector
, i
);
864 /* There are three cases, each handled separately. */
865 if (GET_CODE (loc
) == MEM
&& GET_CODE (XEXP (loc
, 0)) == REG
866 && REGNO (XEXP (loc
, 0)) > LAST_VIRTUAL_REGISTER
)
868 /* This must be an object passed by invisible reference (it could
869 also be a variable-sized object, but we forbid inlining functions
870 with variable-sized arguments). COPY is the address of the
871 actual value (this computation will cause it to be copied). We
872 map that address for the register, noting the actual address as
873 an equivalent in case it can be substituted into the insns. */
875 if (GET_CODE (copy
) != REG
)
877 temp
= copy_addr_to_reg (copy
);
878 if (CONSTANT_P (copy
) || FIXED_BASE_PLUS_P (copy
))
879 SET_CONST_EQUIV_DATA (map
, temp
, copy
, CONST_AGE_PARM
);
882 map
->reg_map
[REGNO (XEXP (loc
, 0))] = copy
;
884 else if (GET_CODE (loc
) == MEM
)
886 /* This is the case of a parameter that lives in memory. It
887 will live in the block we allocate in the called routine's
888 frame that simulates the incoming argument area. Do nothing
889 with the parameter now; we will call store_expr later. In
890 this case, however, we must ensure that the virtual stack and
891 incoming arg rtx values are expanded now so that we can be
892 sure we have enough slots in the const equiv map since the
893 store_expr call can easily blow the size estimate. */
894 if (DECL_SAVED_INSNS (fndecl
)->args_size
!= 0)
895 copy_rtx_and_substitute (virtual_incoming_args_rtx
, map
, 0);
897 else if (GET_CODE (loc
) == REG
)
898 process_reg_param (map
, loc
, copy
);
899 else if (GET_CODE (loc
) == CONCAT
)
901 rtx locreal
= gen_realpart (GET_MODE (XEXP (loc
, 0)), loc
);
902 rtx locimag
= gen_imagpart (GET_MODE (XEXP (loc
, 0)), loc
);
903 rtx copyreal
= gen_realpart (GET_MODE (locreal
), copy
);
904 rtx copyimag
= gen_imagpart (GET_MODE (locimag
), copy
);
906 process_reg_param (map
, locreal
, copyreal
);
907 process_reg_param (map
, locimag
, copyimag
);
913 /* Tell copy_rtx_and_substitute to handle constant pool SYMBOL_REFs
914 specially. This function can be called recursively, so we need to
915 save the previous value. */
916 inlining_previous
= inlining
;
919 /* Now do the parameters that will be placed in memory. */
921 for (formal
= DECL_ARGUMENTS (fndecl
), i
= 0;
922 formal
; formal
= TREE_CHAIN (formal
), i
++)
924 loc
= RTVEC_ELT (arg_vector
, i
);
926 if (GET_CODE (loc
) == MEM
927 /* Exclude case handled above. */
928 && ! (GET_CODE (XEXP (loc
, 0)) == REG
929 && REGNO (XEXP (loc
, 0)) > LAST_VIRTUAL_REGISTER
))
931 rtx note
= emit_note (DECL_SOURCE_FILE (formal
),
932 DECL_SOURCE_LINE (formal
));
934 RTX_INTEGRATED_P (note
) = 1;
936 /* Compute the address in the area we reserved and store the
938 temp
= copy_rtx_and_substitute (loc
, map
, 1);
939 subst_constants (&temp
, NULL_RTX
, map
, 1);
940 apply_change_group ();
941 if (! memory_address_p (GET_MODE (temp
), XEXP (temp
, 0)))
942 temp
= change_address (temp
, VOIDmode
, XEXP (temp
, 0));
943 store_expr (arg_trees
[i
], temp
, 0);
947 /* Deal with the places that the function puts its result.
948 We are driven by what is placed into DECL_RESULT.
950 Initially, we assume that we don't have anything special handling for
951 REG_FUNCTION_RETURN_VALUE_P. */
953 map
->inline_target
= 0;
954 loc
= (DECL_RTL_SET_P (DECL_RESULT (fndecl
))
955 ? DECL_RTL (DECL_RESULT (fndecl
)) : NULL_RTX
);
957 if (TYPE_MODE (type
) == VOIDmode
)
958 /* There is no return value to worry about. */
960 else if (GET_CODE (loc
) == MEM
)
962 if (GET_CODE (XEXP (loc
, 0)) == ADDRESSOF
)
964 temp
= copy_rtx_and_substitute (loc
, map
, 1);
965 subst_constants (&temp
, NULL_RTX
, map
, 1);
966 apply_change_group ();
971 if (! structure_value_addr
972 || ! aggregate_value_p (DECL_RESULT (fndecl
)))
975 /* Pass the function the address in which to return a structure
976 value. Note that a constructor can cause someone to call us
977 with STRUCTURE_VALUE_ADDR, but the initialization takes place
978 via the first parameter, rather than the struct return address.
980 We have two cases: If the address is a simple register
981 indirect, use the mapping mechanism to point that register to
982 our structure return address. Otherwise, store the structure
983 return value into the place that it will be referenced from. */
985 if (GET_CODE (XEXP (loc
, 0)) == REG
)
987 temp
= force_operand (structure_value_addr
, NULL_RTX
);
988 temp
= force_reg (Pmode
, temp
);
989 /* A virtual register might be invalid in an insn, because
990 it can cause trouble in reload. Since we don't have access
991 to the expanders at map translation time, make sure we have
992 a proper register now.
993 If a virtual register is actually valid, cse or combine
994 can put it into the mapped insns. */
995 if (REGNO (temp
) >= FIRST_VIRTUAL_REGISTER
996 && REGNO (temp
) <= LAST_VIRTUAL_REGISTER
)
997 temp
= copy_to_mode_reg (Pmode
, temp
);
998 map
->reg_map
[REGNO (XEXP (loc
, 0))] = temp
;
1000 if (CONSTANT_P (structure_value_addr
)
1001 || GET_CODE (structure_value_addr
) == ADDRESSOF
1002 || (GET_CODE (structure_value_addr
) == PLUS
1003 && (XEXP (structure_value_addr
, 0)
1004 == virtual_stack_vars_rtx
)
1005 && (GET_CODE (XEXP (structure_value_addr
, 1))
1008 SET_CONST_EQUIV_DATA (map
, temp
, structure_value_addr
,
1014 temp
= copy_rtx_and_substitute (loc
, map
, 1);
1015 subst_constants (&temp
, NULL_RTX
, map
, 0);
1016 apply_change_group ();
1017 emit_move_insn (temp
, structure_value_addr
);
1022 /* We will ignore the result value, so don't look at its structure.
1023 Note that preparations for an aggregate return value
1024 do need to be made (above) even if it will be ignored. */
1026 else if (GET_CODE (loc
) == REG
)
1028 /* The function returns an object in a register and we use the return
1029 value. Set up our target for remapping. */
1031 /* Machine mode function was declared to return. */
1032 enum machine_mode departing_mode
= TYPE_MODE (type
);
1033 /* (Possibly wider) machine mode it actually computes
1034 (for the sake of callers that fail to declare it right).
1035 We have to use the mode of the result's RTL, rather than
1036 its type, since expand_function_start may have promoted it. */
1037 enum machine_mode arriving_mode
1038 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl
)));
1041 /* Don't use MEMs as direct targets because on some machines
1042 substituting a MEM for a REG makes invalid insns.
1043 Let the combiner substitute the MEM if that is valid. */
1044 if (target
== 0 || GET_CODE (target
) != REG
1045 || GET_MODE (target
) != departing_mode
)
1047 /* Don't make BLKmode registers. If this looks like
1048 a BLKmode object being returned in a register, get
1049 the mode from that, otherwise abort. */
1050 if (departing_mode
== BLKmode
)
1052 if (REG
== GET_CODE (DECL_RTL (DECL_RESULT (fndecl
))))
1054 departing_mode
= GET_MODE (DECL_RTL (DECL_RESULT (fndecl
)));
1055 arriving_mode
= departing_mode
;
1061 target
= gen_reg_rtx (departing_mode
);
1064 /* If function's value was promoted before return,
1065 avoid machine mode mismatch when we substitute INLINE_TARGET.
1066 But TARGET is what we will return to the caller. */
1067 if (arriving_mode
!= departing_mode
)
1069 /* Avoid creating a paradoxical subreg wider than
1070 BITS_PER_WORD, since that is illegal. */
1071 if (GET_MODE_BITSIZE (arriving_mode
) > BITS_PER_WORD
)
1073 if (!TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (departing_mode
),
1074 GET_MODE_BITSIZE (arriving_mode
)))
1075 /* Maybe could be handled by using convert_move () ? */
1077 reg_to_map
= gen_reg_rtx (arriving_mode
);
1078 target
= gen_lowpart (departing_mode
, reg_to_map
);
1081 reg_to_map
= gen_rtx_SUBREG (arriving_mode
, target
, 0);
1084 reg_to_map
= target
;
1086 /* Usually, the result value is the machine's return register.
1087 Sometimes it may be a pseudo. Handle both cases. */
1088 if (REG_FUNCTION_VALUE_P (loc
))
1089 map
->inline_target
= reg_to_map
;
1091 map
->reg_map
[REGNO (loc
)] = reg_to_map
;
1096 /* Initialize label_map. get_label_from_map will actually make
1098 memset ((char *) &map
->label_map
[min_labelno
], 0,
1099 (max_labelno
- min_labelno
) * sizeof (rtx
));
1101 /* Make copies of the decls of the symbols in the inline function, so that
1102 the copies of the variables get declared in the current function. Set
1103 up things so that lookup_static_chain knows that to interpret registers
1104 in SAVE_EXPRs for TYPE_SIZEs as local. */
1105 inline_function_decl
= fndecl
;
1106 integrate_parm_decls (DECL_ARGUMENTS (fndecl
), map
, arg_vector
);
1107 block
= integrate_decl_tree (inl_f
->original_decl_initial
, map
);
1108 BLOCK_ABSTRACT_ORIGIN (block
) = DECL_ORIGIN (fndecl
);
1109 inline_function_decl
= 0;
1111 /* Make a fresh binding contour that we can easily remove. Do this after
1112 expanding our arguments so cleanups are properly scoped. */
1113 expand_start_bindings_and_block (0, block
);
1115 /* Sort the block-map so that it will be easy to find remapped
1117 qsort (&VARRAY_TREE (map
->block_map
, 0),
1118 map
->block_map
->elements_used
,
1122 /* Perform postincrements before actually calling the function. */
1125 /* Clean up stack so that variables might have smaller offsets. */
1126 do_pending_stack_adjust ();
1128 /* Save a copy of the location of const_equiv_varray for
1129 mark_stores, called via note_stores. */
1130 global_const_equiv_varray
= map
->const_equiv_varray
;
1132 /* If the called function does an alloca, save and restore the
1133 stack pointer around the call. This saves stack space, but
1134 also is required if this inline is being done between two
1136 if (inl_f
->calls_alloca
)
1137 emit_stack_save (SAVE_BLOCK
, &stack_save
, NULL_RTX
);
1139 /* Now copy the insns one by one. */
1140 copy_insn_list (insns
, map
, static_chain_value
);
1142 /* Restore the stack pointer if we saved it above. */
1143 if (inl_f
->calls_alloca
)
1144 emit_stack_restore (SAVE_BLOCK
, stack_save
, NULL_RTX
);
1146 if (! cfun
->x_whole_function_mode_p
)
1147 /* In statement-at-a-time mode, we just tell the front-end to add
1148 this block to the list of blocks at this binding level. We
1149 can't do it the way it's done for function-at-a-time mode the
1150 superblocks have not been created yet. */
1151 insert_block (block
);
1155 = BLOCK_CHAIN (DECL_INITIAL (current_function_decl
));
1156 BLOCK_CHAIN (DECL_INITIAL (current_function_decl
)) = block
;
1159 /* End the scope containing the copied formal parameter variables
1160 and copied LABEL_DECLs. We pass NULL_TREE for the variables list
1161 here so that expand_end_bindings will not check for unused
1162 variables. That's already been checked for when the inlined
1163 function was defined. */
1164 expand_end_bindings (NULL_TREE
, 1, 1);
1166 /* Must mark the line number note after inlined functions as a repeat, so
1167 that the test coverage code can avoid counting the call twice. This
1168 just tells the code to ignore the immediately following line note, since
1169 there already exists a copy of this note before the expanded inline call.
1170 This line number note is still needed for debugging though, so we can't
1172 if (flag_test_coverage
)
1173 emit_note (0, NOTE_INSN_REPEATED_LINE_NUMBER
);
1175 emit_line_note (input_filename
, lineno
);
1177 /* If the function returns a BLKmode object in a register, copy it
1178 out of the temp register into a BLKmode memory object. */
1180 && TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl
))) == BLKmode
1181 && ! aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl
))))
1182 target
= copy_blkmode_from_reg (0, target
, TREE_TYPE (TREE_TYPE (fndecl
)));
1184 if (structure_value_addr
)
1186 target
= gen_rtx_MEM (TYPE_MODE (type
),
1187 memory_address (TYPE_MODE (type
),
1188 structure_value_addr
));
1189 set_mem_attributes (target
, type
, 1);
1192 /* Make sure we free the things we explicitly allocated with xmalloc. */
1194 free (real_label_map
);
1195 VARRAY_FREE (map
->const_equiv_varray
);
1196 free (map
->reg_map
);
1197 VARRAY_FREE (map
->block_map
);
1198 free (map
->insn_map
);
1203 inlining
= inlining_previous
;
1208 /* Make copies of each insn in the given list using the mapping
1209 computed in expand_inline_function. This function may call itself for
1210 insns containing sequences.
1212 Copying is done in two passes, first the insns and then their REG_NOTES.
1214 If static_chain_value is non-zero, it represents the context-pointer
1215 register for the function. */
1218 copy_insn_list (insns
, map
, static_chain_value
)
1220 struct inline_remap
*map
;
1221 rtx static_chain_value
;
1226 rtx local_return_label
= NULL_RTX
;
1231 /* Copy the insns one by one. Do this in two passes, first the insns and
1232 then their REG_NOTES. */
1234 /* This loop is very similar to the loop in copy_loop_body in unroll.c. */
1236 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
1238 rtx copy
, pattern
, set
;
1240 map
->orig_asm_operands_vector
= 0;
1242 switch (GET_CODE (insn
))
1245 pattern
= PATTERN (insn
);
1246 set
= single_set (insn
);
1248 if (GET_CODE (pattern
) == USE
1249 && GET_CODE (XEXP (pattern
, 0)) == REG
1250 && REG_FUNCTION_VALUE_P (XEXP (pattern
, 0)))
1251 /* The (USE (REG n)) at return from the function should
1252 be ignored since we are changing (REG n) into
1256 /* If the inline fn needs eh context, make sure that
1257 the current fn has one. */
1258 if (GET_CODE (pattern
) == USE
1259 && find_reg_note (insn
, REG_EH_CONTEXT
, 0) != 0)
1262 /* Ignore setting a function value that we don't want to use. */
1263 if (map
->inline_target
== 0
1265 && GET_CODE (SET_DEST (set
)) == REG
1266 && REG_FUNCTION_VALUE_P (SET_DEST (set
)))
1268 if (volatile_refs_p (SET_SRC (set
)))
1272 /* If we must not delete the source,
1273 load it into a new temporary. */
1274 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1276 new_set
= single_set (copy
);
1281 = gen_reg_rtx (GET_MODE (SET_DEST (new_set
)));
1283 /* If the source and destination are the same and it
1284 has a note on it, keep the insn. */
1285 else if (rtx_equal_p (SET_DEST (set
), SET_SRC (set
))
1286 && REG_NOTES (insn
) != 0)
1287 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1292 /* Similarly if an ignored return value is clobbered. */
1293 else if (map
->inline_target
== 0
1294 && GET_CODE (pattern
) == CLOBBER
1295 && GET_CODE (XEXP (pattern
, 0)) == REG
1296 && REG_FUNCTION_VALUE_P (XEXP (pattern
, 0)))
1299 /* If this is setting the static chain rtx, omit it. */
1300 else if (static_chain_value
!= 0
1302 && GET_CODE (SET_DEST (set
)) == REG
1303 && rtx_equal_p (SET_DEST (set
),
1304 static_chain_incoming_rtx
))
1307 /* If this is setting the static chain pseudo, set it from
1308 the value we want to give it instead. */
1309 else if (static_chain_value
!= 0
1311 && rtx_equal_p (SET_SRC (set
),
1312 static_chain_incoming_rtx
))
1314 rtx newdest
= copy_rtx_and_substitute (SET_DEST (set
), map
, 1);
1316 copy
= emit_move_insn (newdest
, static_chain_value
);
1317 static_chain_value
= 0;
1320 /* If this is setting the virtual stack vars register, this must
1321 be the code at the handler for a builtin longjmp. The value
1322 saved in the setjmp buffer will be the address of the frame
1323 we've made for this inlined instance within our frame. But we
1324 know the offset of that value so we can use it to reconstruct
1325 our virtual stack vars register from that value. If we are
1326 copying it from the stack pointer, leave it unchanged. */
1328 && rtx_equal_p (SET_DEST (set
), virtual_stack_vars_rtx
))
1330 HOST_WIDE_INT offset
;
1331 temp
= map
->reg_map
[REGNO (SET_DEST (set
))];
1332 temp
= VARRAY_CONST_EQUIV (map
->const_equiv_varray
,
1335 if (rtx_equal_p (temp
, virtual_stack_vars_rtx
))
1337 else if (GET_CODE (temp
) == PLUS
1338 && rtx_equal_p (XEXP (temp
, 0), virtual_stack_vars_rtx
)
1339 && GET_CODE (XEXP (temp
, 1)) == CONST_INT
)
1340 offset
= INTVAL (XEXP (temp
, 1));
1344 if (rtx_equal_p (SET_SRC (set
), stack_pointer_rtx
))
1345 temp
= SET_SRC (set
);
1347 temp
= force_operand (plus_constant (SET_SRC (set
),
1351 copy
= emit_move_insn (virtual_stack_vars_rtx
, temp
);
1355 copy
= emit_insn (copy_rtx_and_substitute (pattern
, map
, 0));
1356 /* REG_NOTES will be copied later. */
1359 /* If this insn is setting CC0, it may need to look at
1360 the insn that uses CC0 to see what type of insn it is.
1361 In that case, the call to recog via validate_change will
1362 fail. So don't substitute constants here. Instead,
1363 do it when we emit the following insn.
1365 For example, see the pyr.md file. That machine has signed and
1366 unsigned compares. The compare patterns must check the
1367 following branch insn to see which what kind of compare to
1370 If the previous insn set CC0, substitute constants on it as
1372 if (sets_cc0_p (PATTERN (copy
)) != 0)
1377 try_constants (cc0_insn
, map
);
1379 try_constants (copy
, map
);
1382 try_constants (copy
, map
);
1387 if (GET_CODE (PATTERN (insn
)) == RETURN
1388 || (GET_CODE (PATTERN (insn
)) == PARALLEL
1389 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == RETURN
))
1391 if (local_return_label
== 0)
1392 local_return_label
= gen_label_rtx ();
1393 pattern
= gen_jump (local_return_label
);
1396 pattern
= copy_rtx_and_substitute (PATTERN (insn
), map
, 0);
1398 copy
= emit_jump_insn (pattern
);
1402 try_constants (cc0_insn
, map
);
1405 try_constants (copy
, map
);
1407 /* If this used to be a conditional jump insn but whose branch
1408 direction is now know, we must do something special. */
1409 if (any_condjump_p (insn
) && onlyjump_p (insn
) && map
->last_pc_value
)
1412 /* If the previous insn set cc0 for us, delete it. */
1413 if (sets_cc0_p (PREV_INSN (copy
)))
1414 delete_insn (PREV_INSN (copy
));
1417 /* If this is now a no-op, delete it. */
1418 if (map
->last_pc_value
== pc_rtx
)
1424 /* Otherwise, this is unconditional jump so we must put a
1425 BARRIER after it. We could do some dead code elimination
1426 here, but jump.c will do it just as well. */
1432 /* If this is a CALL_PLACEHOLDER insn then we need to copy the
1433 three attached sequences: normal call, sibling call and tail
1435 if (GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
1440 for (i
= 0; i
< 3; i
++)
1444 sequence
[i
] = NULL_RTX
;
1445 seq
= XEXP (PATTERN (insn
), i
);
1449 copy_insn_list (seq
, map
, static_chain_value
);
1450 sequence
[i
] = get_insns ();
1455 /* Find the new tail recursion label.
1456 It will already be substituted into sequence[2]. */
1457 tail_label
= copy_rtx_and_substitute (XEXP (PATTERN (insn
), 3),
1460 copy
= emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode
,
1468 pattern
= copy_rtx_and_substitute (PATTERN (insn
), map
, 0);
1469 copy
= emit_call_insn (pattern
);
1471 SIBLING_CALL_P (copy
) = SIBLING_CALL_P (insn
);
1472 CONST_CALL_P (copy
) = CONST_CALL_P (insn
);
1474 /* Because the USAGE information potentially contains objects other
1475 than hard registers, we need to copy it. */
1477 CALL_INSN_FUNCTION_USAGE (copy
)
1478 = copy_rtx_and_substitute (CALL_INSN_FUNCTION_USAGE (insn
),
1483 try_constants (cc0_insn
, map
);
1486 try_constants (copy
, map
);
1488 /* Be lazy and assume CALL_INSNs clobber all hard registers. */
1489 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
1490 VARRAY_CONST_EQUIV (map
->const_equiv_varray
, i
).rtx
= 0;
1494 copy
= emit_label (get_label_from_map (map
,
1495 CODE_LABEL_NUMBER (insn
)));
1496 LABEL_NAME (copy
) = LABEL_NAME (insn
);
1501 copy
= emit_barrier ();
1505 /* NOTE_INSN_FUNCTION_END and NOTE_INSN_FUNCTION_BEG are
1506 discarded because it is important to have only one of
1507 each in the current function.
1509 NOTE_INSN_DELETED notes aren't useful.
1511 NOTE_INSN_BASIC_BLOCK is discarded because the saved bb
1512 pointer (which will soon be dangling) confuses flow's
1513 attempts to preserve bb structures during the compilation
1516 if (NOTE_LINE_NUMBER (insn
) != NOTE_INSN_FUNCTION_END
1517 && NOTE_LINE_NUMBER (insn
) != NOTE_INSN_FUNCTION_BEG
1518 && NOTE_LINE_NUMBER (insn
) != NOTE_INSN_DELETED
1519 && NOTE_LINE_NUMBER (insn
) != NOTE_INSN_BASIC_BLOCK
)
1521 copy
= emit_note (NOTE_SOURCE_FILE (insn
),
1522 NOTE_LINE_NUMBER (insn
));
1524 && (NOTE_LINE_NUMBER (copy
) == NOTE_INSN_EH_REGION_BEG
1525 || NOTE_LINE_NUMBER (copy
) == NOTE_INSN_EH_REGION_END
))
1528 = get_label_from_map (map
, NOTE_EH_HANDLER (copy
));
1530 /* We have to duplicate the handlers for the original. */
1531 if (NOTE_LINE_NUMBER (copy
) == NOTE_INSN_EH_REGION_BEG
)
1533 /* We need to duplicate the handlers for the EH region
1534 and we need to indicate where the label map is */
1536 duplicate_eh_handlers (NOTE_EH_HANDLER (copy
),
1537 CODE_LABEL_NUMBER (label
),
1538 expand_inline_function_eh_labelmap
);
1541 /* We have to forward these both to match the new exception
1543 NOTE_EH_HANDLER (copy
) = CODE_LABEL_NUMBER (label
);
1546 && (NOTE_LINE_NUMBER (copy
) == NOTE_INSN_BLOCK_BEG
1547 || NOTE_LINE_NUMBER (copy
) == NOTE_INSN_BLOCK_END
)
1548 && NOTE_BLOCK (insn
))
1550 tree
*mapped_block_p
;
1553 = (tree
*) bsearch (NOTE_BLOCK (insn
),
1554 &VARRAY_TREE (map
->block_map
, 0),
1555 map
->block_map
->elements_used
,
1559 if (!mapped_block_p
)
1562 NOTE_BLOCK (copy
) = *mapped_block_p
;
1574 RTX_INTEGRATED_P (copy
) = 1;
1576 map
->insn_map
[INSN_UID (insn
)] = copy
;
1579 /* Now copy the REG_NOTES. Increment const_age, so that only constants
1580 from parameters can be substituted in. These are the only ones that
1581 are valid across the entire function. */
1583 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
1585 && map
->insn_map
[INSN_UID (insn
)]
1586 && REG_NOTES (insn
))
1588 rtx next
, note
= copy_rtx_and_substitute (REG_NOTES (insn
), map
, 0);
1590 /* We must also do subst_constants, in case one of our parameters
1591 has const type and constant value. */
1592 subst_constants (¬e
, NULL_RTX
, map
, 0);
1593 apply_change_group ();
1594 REG_NOTES (map
->insn_map
[INSN_UID (insn
)]) = note
;
1596 /* Finally, delete any REG_LABEL notes from the chain. */
1597 for (; note
; note
= next
)
1599 next
= XEXP (note
, 1);
1600 if (REG_NOTE_KIND (note
) == REG_LABEL
)
1601 remove_note (map
->insn_map
[INSN_UID (insn
)], note
);
1605 if (local_return_label
)
1606 emit_label (local_return_label
);
1609 /* Given a chain of PARM_DECLs, ARGS, copy each decl into a VAR_DECL,
1610 push all of those decls and give each one the corresponding home. */
1613 integrate_parm_decls (args
, map
, arg_vector
)
1615 struct inline_remap
*map
;
1621 for (tail
= args
, i
= 0; tail
; tail
= TREE_CHAIN (tail
), i
++)
1623 tree decl
= copy_decl_for_inlining (tail
, map
->fndecl
,
1624 current_function_decl
);
1626 = copy_rtx_and_substitute (RTVEC_ELT (arg_vector
, i
), map
, 1);
1628 /* We really should be setting DECL_INCOMING_RTL to something reasonable
1629 here, but that's going to require some more work. */
1630 /* DECL_INCOMING_RTL (decl) = ?; */
1631 /* Fully instantiate the address with the equivalent form so that the
1632 debugging information contains the actual register, instead of the
1633 virtual register. Do this by not passing an insn to
1635 subst_constants (&new_decl_rtl
, NULL_RTX
, map
, 1);
1636 apply_change_group ();
1637 SET_DECL_RTL (decl
, new_decl_rtl
);
1641 /* Given a BLOCK node LET, push decls and levels so as to construct in the
1642 current function a tree of contexts isomorphic to the one that is given.
1644 MAP, if nonzero, is a pointer to an inline_remap map which indicates how
1645 registers used in the DECL_RTL field should be remapped. If it is zero,
1646 no mapping is necessary. */
1649 integrate_decl_tree (let
, map
)
1651 struct inline_remap
*map
;
1657 new_block
= make_node (BLOCK
);
1658 VARRAY_PUSH_TREE (map
->block_map
, new_block
);
1659 next
= &BLOCK_VARS (new_block
);
1661 for (t
= BLOCK_VARS (let
); t
; t
= TREE_CHAIN (t
))
1665 d
= copy_decl_for_inlining (t
, map
->fndecl
, current_function_decl
);
1667 if (DECL_RTL_SET_P (t
))
1671 SET_DECL_RTL (d
, copy_rtx_and_substitute (DECL_RTL (t
), map
, 1));
1673 /* Fully instantiate the address with the equivalent form so that the
1674 debugging information contains the actual register, instead of the
1675 virtual register. Do this by not passing an insn to
1678 subst_constants (&r
, NULL_RTX
, map
, 1);
1679 SET_DECL_RTL (d
, r
);
1680 apply_change_group ();
1683 /* Add this declaration to the list of variables in the new
1686 next
= &TREE_CHAIN (d
);
1689 next
= &BLOCK_SUBBLOCKS (new_block
);
1690 for (t
= BLOCK_SUBBLOCKS (let
); t
; t
= BLOCK_CHAIN (t
))
1692 *next
= integrate_decl_tree (t
, map
);
1693 BLOCK_SUPERCONTEXT (*next
) = new_block
;
1694 next
= &BLOCK_CHAIN (*next
);
1697 TREE_USED (new_block
) = TREE_USED (let
);
1698 BLOCK_ABSTRACT_ORIGIN (new_block
) = let
;
1703 /* Create a new copy of an rtx. Recursively copies the operands of the rtx,
1704 except for those few rtx codes that are sharable.
1706 We always return an rtx that is similar to that incoming rtx, with the
1707 exception of possibly changing a REG to a SUBREG or vice versa. No
1708 rtl is ever emitted.
1710 If FOR_LHS is nonzero, if means we are processing something that will
1711 be the LHS of a SET. In that case, we copy RTX_UNCHANGING_P even if
1712 inlining since we need to be conservative in how it is set for
1715 Handle constants that need to be placed in the constant pool by
1716 calling `force_const_mem'. */
1719 copy_rtx_and_substitute (orig
, map
, for_lhs
)
1721 struct inline_remap
*map
;
1724 register rtx copy
, temp
;
1726 register RTX_CODE code
;
1727 register enum machine_mode mode
;
1728 register const char *format_ptr
;
1734 code
= GET_CODE (orig
);
1735 mode
= GET_MODE (orig
);
1740 /* If the stack pointer register shows up, it must be part of
1741 stack-adjustments (*not* because we eliminated the frame pointer!).
1742 Small hard registers are returned as-is. Pseudo-registers
1743 go through their `reg_map'. */
1744 regno
= REGNO (orig
);
1745 if (regno
<= LAST_VIRTUAL_REGISTER
1746 || (map
->integrating
1747 && DECL_SAVED_INSNS (map
->fndecl
)->internal_arg_pointer
== orig
))
1749 /* Some hard registers are also mapped,
1750 but others are not translated. */
1751 if (map
->reg_map
[regno
] != 0)
1752 return map
->reg_map
[regno
];
1754 /* If this is the virtual frame pointer, make space in current
1755 function's stack frame for the stack frame of the inline function.
1757 Copy the address of this area into a pseudo. Map
1758 virtual_stack_vars_rtx to this pseudo and set up a constant
1759 equivalence for it to be the address. This will substitute the
1760 address into insns where it can be substituted and use the new
1761 pseudo where it can't. */
1762 else if (regno
== VIRTUAL_STACK_VARS_REGNUM
)
1765 int size
= get_func_frame_size (DECL_SAVED_INSNS (map
->fndecl
));
1766 #ifdef FRAME_GROWS_DOWNWARD
1768 = (DECL_SAVED_INSNS (map
->fndecl
)->stack_alignment_needed
1771 /* In this case, virtual_stack_vars_rtx points to one byte
1772 higher than the top of the frame area. So make sure we
1773 allocate a big enough chunk to keep the frame pointer
1774 aligned like a real one. */
1776 size
= CEIL_ROUND (size
, alignment
);
1779 loc
= assign_stack_temp (BLKmode
, size
, 1);
1780 loc
= XEXP (loc
, 0);
1781 #ifdef FRAME_GROWS_DOWNWARD
1782 /* In this case, virtual_stack_vars_rtx points to one byte
1783 higher than the top of the frame area. So compute the offset
1784 to one byte higher than our substitute frame. */
1785 loc
= plus_constant (loc
, size
);
1787 map
->reg_map
[regno
] = temp
1788 = force_reg (Pmode
, force_operand (loc
, NULL_RTX
));
1790 #ifdef STACK_BOUNDARY
1791 mark_reg_pointer (map
->reg_map
[regno
], STACK_BOUNDARY
);
1794 SET_CONST_EQUIV_DATA (map
, temp
, loc
, CONST_AGE_PARM
);
1796 seq
= gen_sequence ();
1798 emit_insn_after (seq
, map
->insns_at_start
);
1801 else if (regno
== VIRTUAL_INCOMING_ARGS_REGNUM
1802 || (map
->integrating
1803 && (DECL_SAVED_INSNS (map
->fndecl
)->internal_arg_pointer
1806 /* Do the same for a block to contain any arguments referenced
1809 int size
= DECL_SAVED_INSNS (map
->fndecl
)->args_size
;
1812 loc
= assign_stack_temp (BLKmode
, size
, 1);
1813 loc
= XEXP (loc
, 0);
1814 /* When arguments grow downward, the virtual incoming
1815 args pointer points to the top of the argument block,
1816 so the remapped location better do the same. */
1817 #ifdef ARGS_GROW_DOWNWARD
1818 loc
= plus_constant (loc
, size
);
1820 map
->reg_map
[regno
] = temp
1821 = force_reg (Pmode
, force_operand (loc
, NULL_RTX
));
1823 #ifdef STACK_BOUNDARY
1824 mark_reg_pointer (map
->reg_map
[regno
], STACK_BOUNDARY
);
1827 SET_CONST_EQUIV_DATA (map
, temp
, loc
, CONST_AGE_PARM
);
1829 seq
= gen_sequence ();
1831 emit_insn_after (seq
, map
->insns_at_start
);
1834 else if (REG_FUNCTION_VALUE_P (orig
))
1836 /* This is a reference to the function return value. If
1837 the function doesn't have a return value, error. If the
1838 mode doesn't agree, and it ain't BLKmode, make a SUBREG. */
1839 if (map
->inline_target
== 0)
1841 if (rtx_equal_function_value_matters
)
1842 /* This is an ignored return value. We must not
1843 leave it in with REG_FUNCTION_VALUE_P set, since
1844 that would confuse subsequent inlining of the
1845 current function into a later function. */
1846 return gen_rtx_REG (GET_MODE (orig
), regno
);
1848 /* Must be unrolling loops or replicating code if we
1849 reach here, so return the register unchanged. */
1852 else if (GET_MODE (map
->inline_target
) != BLKmode
1853 && mode
!= GET_MODE (map
->inline_target
))
1854 return gen_lowpart (mode
, map
->inline_target
);
1856 return map
->inline_target
;
1858 #if defined (LEAF_REGISTERS) && defined (LEAF_REG_REMAP)
1859 /* If leaf_renumber_regs_insn() might remap this register to
1860 some other number, make sure we don't share it with the
1861 inlined function, otherwise delayed optimization of the
1862 inlined function may change it in place, breaking our
1863 reference to it. We may still shared it within the
1864 function, so create an entry for this register in the
1866 if (map
->integrating
&& regno
< FIRST_PSEUDO_REGISTER
1867 && LEAF_REGISTERS
[regno
] && LEAF_REG_REMAP (regno
) != regno
)
1869 if (!map
->leaf_reg_map
[regno
][mode
])
1870 map
->leaf_reg_map
[regno
][mode
] = gen_rtx_REG (mode
, regno
);
1871 return map
->leaf_reg_map
[regno
][mode
];
1879 if (map
->reg_map
[regno
] == NULL
)
1881 map
->reg_map
[regno
] = gen_reg_rtx (mode
);
1882 REG_USERVAR_P (map
->reg_map
[regno
]) = REG_USERVAR_P (orig
);
1883 REG_LOOP_TEST_P (map
->reg_map
[regno
]) = REG_LOOP_TEST_P (orig
);
1884 RTX_UNCHANGING_P (map
->reg_map
[regno
]) = RTX_UNCHANGING_P (orig
);
1885 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
1887 if (REG_POINTER (map
->x_regno_reg_rtx
[regno
]))
1888 mark_reg_pointer (map
->reg_map
[regno
],
1889 map
->regno_pointer_align
[regno
]);
1891 return map
->reg_map
[regno
];
1894 copy
= copy_rtx_and_substitute (SUBREG_REG (orig
), map
, for_lhs
);
1895 /* SUBREG is ordinary, but don't make nested SUBREGs. */
1896 if (GET_CODE (copy
) == SUBREG
)
1897 return gen_rtx_SUBREG (GET_MODE (orig
), SUBREG_REG (copy
),
1898 SUBREG_WORD (orig
) + SUBREG_WORD (copy
));
1899 else if (GET_CODE (copy
) == CONCAT
)
1901 rtx retval
= subreg_realpart_p (orig
) ? XEXP (copy
, 0) : XEXP (copy
, 1);
1903 if (GET_MODE (retval
) == GET_MODE (orig
))
1906 return gen_rtx_SUBREG (GET_MODE (orig
), retval
,
1907 (SUBREG_WORD (orig
) %
1908 (GET_MODE_UNIT_SIZE (GET_MODE (SUBREG_REG (orig
)))
1909 / (unsigned) UNITS_PER_WORD
)));
1912 return gen_rtx_SUBREG (GET_MODE (orig
), copy
,
1913 SUBREG_WORD (orig
));
1916 copy
= gen_rtx_ADDRESSOF (mode
,
1917 copy_rtx_and_substitute (XEXP (orig
, 0),
1919 0, ADDRESSOF_DECL (orig
));
1920 regno
= ADDRESSOF_REGNO (orig
);
1921 if (map
->reg_map
[regno
])
1922 regno
= REGNO (map
->reg_map
[regno
]);
1923 else if (regno
> LAST_VIRTUAL_REGISTER
)
1925 temp
= XEXP (orig
, 0);
1926 map
->reg_map
[regno
] = gen_reg_rtx (GET_MODE (temp
));
1927 REG_USERVAR_P (map
->reg_map
[regno
]) = REG_USERVAR_P (temp
);
1928 REG_LOOP_TEST_P (map
->reg_map
[regno
]) = REG_LOOP_TEST_P (temp
);
1929 RTX_UNCHANGING_P (map
->reg_map
[regno
]) = RTX_UNCHANGING_P (temp
);
1930 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
1932 if (REG_POINTER (map
->x_regno_reg_rtx
[regno
]))
1933 mark_reg_pointer (map
->reg_map
[regno
],
1934 map
->regno_pointer_align
[regno
]);
1935 regno
= REGNO (map
->reg_map
[regno
]);
1937 ADDRESSOF_REGNO (copy
) = regno
;
1942 /* USE and CLOBBER are ordinary, but we convert (use (subreg foo))
1943 to (use foo) if the original insn didn't have a subreg.
1944 Removing the subreg distorts the VAX movstrhi pattern
1945 by changing the mode of an operand. */
1946 copy
= copy_rtx_and_substitute (XEXP (orig
, 0), map
, code
== CLOBBER
);
1947 if (GET_CODE (copy
) == SUBREG
&& GET_CODE (XEXP (orig
, 0)) != SUBREG
)
1948 copy
= SUBREG_REG (copy
);
1949 return gen_rtx_fmt_e (code
, VOIDmode
, copy
);
1952 LABEL_PRESERVE_P (get_label_from_map (map
, CODE_LABEL_NUMBER (orig
)))
1953 = LABEL_PRESERVE_P (orig
);
1954 return get_label_from_map (map
, CODE_LABEL_NUMBER (orig
));
1956 /* We need to handle "deleted" labels that appear in the DECL_RTL
1959 if (NOTE_LINE_NUMBER (orig
) == NOTE_INSN_DELETED_LABEL
)
1960 return map
->insn_map
[INSN_UID (orig
)];
1967 LABEL_REF_NONLOCAL_P (orig
) ? XEXP (orig
, 0)
1968 : get_label_from_map (map
, CODE_LABEL_NUMBER (XEXP (orig
, 0))));
1970 LABEL_OUTSIDE_LOOP_P (copy
) = LABEL_OUTSIDE_LOOP_P (orig
);
1972 /* The fact that this label was previously nonlocal does not mean
1973 it still is, so we must check if it is within the range of
1974 this function's labels. */
1975 LABEL_REF_NONLOCAL_P (copy
)
1976 = (LABEL_REF_NONLOCAL_P (orig
)
1977 && ! (CODE_LABEL_NUMBER (XEXP (copy
, 0)) >= get_first_label_num ()
1978 && CODE_LABEL_NUMBER (XEXP (copy
, 0)) < max_label_num ()));
1980 /* If we have made a nonlocal label local, it means that this
1981 inlined call will be referring to our nonlocal goto handler.
1982 So make sure we create one for this block; we normally would
1983 not since this is not otherwise considered a "call". */
1984 if (LABEL_REF_NONLOCAL_P (orig
) && ! LABEL_REF_NONLOCAL_P (copy
))
1985 function_call_count
++;
1995 /* Symbols which represent the address of a label stored in the constant
1996 pool must be modified to point to a constant pool entry for the
1997 remapped label. Otherwise, symbols are returned unchanged. */
1998 if (CONSTANT_POOL_ADDRESS_P (orig
))
2000 struct function
*f
= inlining
? inlining
: cfun
;
2001 rtx constant
= get_pool_constant_for_function (f
, orig
);
2002 enum machine_mode const_mode
= get_pool_mode_for_function (f
, orig
);
2005 rtx temp
= force_const_mem (const_mode
,
2006 copy_rtx_and_substitute (constant
,
2010 /* Legitimizing the address here is incorrect.
2012 Since we had a SYMBOL_REF before, we can assume it is valid
2013 to have one in this position in the insn.
2015 Also, change_address may create new registers. These
2016 registers will not have valid reg_map entries. This can
2017 cause try_constants() to fail because assumes that all
2018 registers in the rtx have valid reg_map entries, and it may
2019 end up replacing one of these new registers with junk. */
2021 if (! memory_address_p (GET_MODE (temp
), XEXP (temp
, 0)))
2022 temp
= change_address (temp
, GET_MODE (temp
), XEXP (temp
, 0));
2025 temp
= XEXP (temp
, 0);
2027 #ifdef POINTERS_EXTEND_UNSIGNED
2028 if (GET_MODE (temp
) != GET_MODE (orig
))
2029 temp
= convert_memory_address (GET_MODE (orig
), temp
);
2033 else if (GET_CODE (constant
) == LABEL_REF
)
2034 return XEXP (force_const_mem
2036 copy_rtx_and_substitute (constant
, map
, for_lhs
)),
2039 else if (SYMBOL_REF_NEED_ADJUST (orig
))
2042 return rethrow_symbol_map (orig
,
2043 expand_inline_function_eh_labelmap
);
2049 /* We have to make a new copy of this CONST_DOUBLE because don't want
2050 to use the old value of CONST_DOUBLE_MEM. Also, this may be a
2051 duplicate of a CONST_DOUBLE we have already seen. */
2052 if (GET_MODE_CLASS (GET_MODE (orig
)) == MODE_FLOAT
)
2056 REAL_VALUE_FROM_CONST_DOUBLE (d
, orig
);
2057 return CONST_DOUBLE_FROM_REAL_VALUE (d
, GET_MODE (orig
));
2060 return immed_double_const (CONST_DOUBLE_LOW (orig
),
2061 CONST_DOUBLE_HIGH (orig
), VOIDmode
);
2064 /* Make new constant pool entry for a constant
2065 that was in the pool of the inline function. */
2066 if (RTX_INTEGRATED_P (orig
))
2071 /* If a single asm insn contains multiple output operands then
2072 it contains multiple ASM_OPERANDS rtx's that share the input
2073 and constraint vecs. We must make sure that the copied insn
2074 continues to share it. */
2075 if (map
->orig_asm_operands_vector
== ASM_OPERANDS_INPUT_VEC (orig
))
2077 copy
= rtx_alloc (ASM_OPERANDS
);
2078 copy
->volatil
= orig
->volatil
;
2079 PUT_MODE (copy
, GET_MODE (orig
));
2080 ASM_OPERANDS_TEMPLATE (copy
) = ASM_OPERANDS_TEMPLATE (orig
);
2081 ASM_OPERANDS_OUTPUT_CONSTRAINT (copy
)
2082 = ASM_OPERANDS_OUTPUT_CONSTRAINT (orig
);
2083 ASM_OPERANDS_OUTPUT_IDX (copy
) = ASM_OPERANDS_OUTPUT_IDX (orig
);
2084 ASM_OPERANDS_INPUT_VEC (copy
) = map
->copy_asm_operands_vector
;
2085 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy
)
2086 = map
->copy_asm_constraints_vector
;
2087 ASM_OPERANDS_SOURCE_FILE (copy
) = ASM_OPERANDS_SOURCE_FILE (orig
);
2088 ASM_OPERANDS_SOURCE_LINE (copy
) = ASM_OPERANDS_SOURCE_LINE (orig
);
2094 /* This is given special treatment because the first
2095 operand of a CALL is a (MEM ...) which may get
2096 forced into a register for cse. This is undesirable
2097 if function-address cse isn't wanted or if we won't do cse. */
2098 #ifndef NO_FUNCTION_CSE
2099 if (! (optimize
&& ! flag_no_function_cse
))
2104 gen_rtx_MEM (GET_MODE (XEXP (orig
, 0)),
2105 copy_rtx_and_substitute (XEXP (XEXP (orig
, 0), 0),
2107 copy_rtx_and_substitute (XEXP (orig
, 1), map
, 0));
2111 /* Must be ifdefed out for loop unrolling to work. */
2117 /* If this is setting fp or ap, it means that we have a nonlocal goto.
2118 Adjust the setting by the offset of the area we made.
2119 If the nonlocal goto is into the current function,
2120 this will result in unnecessarily bad code, but should work. */
2121 if (SET_DEST (orig
) == virtual_stack_vars_rtx
2122 || SET_DEST (orig
) == virtual_incoming_args_rtx
)
2124 /* In case a translation hasn't occurred already, make one now. */
2127 HOST_WIDE_INT loc_offset
;
2129 copy_rtx_and_substitute (SET_DEST (orig
), map
, for_lhs
);
2130 equiv_reg
= map
->reg_map
[REGNO (SET_DEST (orig
))];
2131 equiv_loc
= VARRAY_CONST_EQUIV (map
->const_equiv_varray
,
2132 REGNO (equiv_reg
)).rtx
;
2134 = GET_CODE (equiv_loc
) == REG
? 0 : INTVAL (XEXP (equiv_loc
, 1));
2136 return gen_rtx_SET (VOIDmode
, SET_DEST (orig
),
2139 (copy_rtx_and_substitute (SET_SRC (orig
),
2145 return gen_rtx_SET (VOIDmode
,
2146 copy_rtx_and_substitute (SET_DEST (orig
), map
, 1),
2147 copy_rtx_and_substitute (SET_SRC (orig
), map
, 0));
2152 && GET_CODE (XEXP (orig
, 0)) == SYMBOL_REF
2153 && CONSTANT_POOL_ADDRESS_P (XEXP (orig
, 0)))
2155 enum machine_mode const_mode
2156 = get_pool_mode_for_function (inlining
, XEXP (orig
, 0));
2158 = get_pool_constant_for_function (inlining
, XEXP (orig
, 0));
2160 constant
= copy_rtx_and_substitute (constant
, map
, 0);
2162 /* If this was an address of a constant pool entry that itself
2163 had to be placed in the constant pool, it might not be a
2164 valid address. So the recursive call might have turned it
2165 into a register. In that case, it isn't a constant any
2166 more, so return it. This has the potential of changing a
2167 MEM into a REG, but we'll assume that it safe. */
2168 if (! CONSTANT_P (constant
))
2171 return validize_mem (force_const_mem (const_mode
, constant
));
2174 copy
= rtx_alloc (MEM
);
2175 PUT_MODE (copy
, mode
);
2176 XEXP (copy
, 0) = copy_rtx_and_substitute (XEXP (orig
, 0), map
, 0);
2177 MEM_COPY_ATTRIBUTES (copy
, orig
);
2184 copy
= rtx_alloc (code
);
2185 PUT_MODE (copy
, mode
);
2186 copy
->in_struct
= orig
->in_struct
;
2187 copy
->volatil
= orig
->volatil
;
2188 copy
->unchanging
= orig
->unchanging
;
2190 format_ptr
= GET_RTX_FORMAT (GET_CODE (copy
));
2192 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (copy
)); i
++)
2194 switch (*format_ptr
++)
2197 /* Copy this through the wide int field; that's safest. */
2198 X0WINT (copy
, i
) = X0WINT (orig
, i
);
2203 = copy_rtx_and_substitute (XEXP (orig
, i
), map
, for_lhs
);
2207 /* Change any references to old-insns to point to the
2208 corresponding copied insns. */
2209 XEXP (copy
, i
) = map
->insn_map
[INSN_UID (XEXP (orig
, i
))];
2213 XVEC (copy
, i
) = XVEC (orig
, i
);
2214 if (XVEC (orig
, i
) != NULL
&& XVECLEN (orig
, i
) != 0)
2216 XVEC (copy
, i
) = rtvec_alloc (XVECLEN (orig
, i
));
2217 for (j
= 0; j
< XVECLEN (copy
, i
); j
++)
2218 XVECEXP (copy
, i
, j
)
2219 = copy_rtx_and_substitute (XVECEXP (orig
, i
, j
),
2225 XWINT (copy
, i
) = XWINT (orig
, i
);
2229 XINT (copy
, i
) = XINT (orig
, i
);
2233 XSTR (copy
, i
) = XSTR (orig
, i
);
2237 XTREE (copy
, i
) = XTREE (orig
, i
);
2245 if (code
== ASM_OPERANDS
&& map
->orig_asm_operands_vector
== 0)
2247 map
->orig_asm_operands_vector
= ASM_OPERANDS_INPUT_VEC (orig
);
2248 map
->copy_asm_operands_vector
= ASM_OPERANDS_INPUT_VEC (copy
);
2249 map
->copy_asm_constraints_vector
2250 = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (copy
);
2256 /* Substitute known constant values into INSN, if that is valid. */
2259 try_constants (insn
, map
)
2261 struct inline_remap
*map
;
2267 /* First try just updating addresses, then other things. This is
2268 important when we have something like the store of a constant
2269 into memory and we can update the memory address but the machine
2270 does not support a constant source. */
2271 subst_constants (&PATTERN (insn
), insn
, map
, 1);
2272 apply_change_group ();
2273 subst_constants (&PATTERN (insn
), insn
, map
, 0);
2274 apply_change_group ();
2276 /* Show we don't know the value of anything stored or clobbered. */
2277 note_stores (PATTERN (insn
), mark_stores
, NULL
);
2278 map
->last_pc_value
= 0;
2280 map
->last_cc0_value
= 0;
2283 /* Set up any constant equivalences made in this insn. */
2284 for (i
= 0; i
< map
->num_sets
; i
++)
2286 if (GET_CODE (map
->equiv_sets
[i
].dest
) == REG
)
2288 int regno
= REGNO (map
->equiv_sets
[i
].dest
);
2290 MAYBE_EXTEND_CONST_EQUIV_VARRAY (map
, regno
);
2291 if (VARRAY_CONST_EQUIV (map
->const_equiv_varray
, regno
).rtx
== 0
2292 /* Following clause is a hack to make case work where GNU C++
2293 reassigns a variable to make cse work right. */
2294 || ! rtx_equal_p (VARRAY_CONST_EQUIV (map
->const_equiv_varray
,
2296 map
->equiv_sets
[i
].equiv
))
2297 SET_CONST_EQUIV_DATA (map
, map
->equiv_sets
[i
].dest
,
2298 map
->equiv_sets
[i
].equiv
, map
->const_age
);
2300 else if (map
->equiv_sets
[i
].dest
== pc_rtx
)
2301 map
->last_pc_value
= map
->equiv_sets
[i
].equiv
;
2303 else if (map
->equiv_sets
[i
].dest
== cc0_rtx
)
2304 map
->last_cc0_value
= map
->equiv_sets
[i
].equiv
;
2309 /* Substitute known constants for pseudo regs in the contents of LOC,
2310 which are part of INSN.
2311 If INSN is zero, the substitution should always be done (this is used to
2313 These changes are taken out by try_constants if the result is not valid.
2315 Note that we are more concerned with determining when the result of a SET
2316 is a constant, for further propagation, than actually inserting constants
2317 into insns; cse will do the latter task better.
2319 This function is also used to adjust address of items previously addressed
2320 via the virtual stack variable or virtual incoming arguments registers.
2322 If MEMONLY is nonzero, only make changes inside a MEM. */
2325 subst_constants (loc
, insn
, map
, memonly
)
2328 struct inline_remap
*map
;
2333 register enum rtx_code code
;
2334 register const char *format_ptr
;
2335 int num_changes
= num_validated_changes ();
2337 enum machine_mode op0_mode
= MAX_MACHINE_MODE
;
2339 code
= GET_CODE (x
);
2355 validate_change (insn
, loc
, map
->last_cc0_value
, 1);
2361 /* The only thing we can do with a USE or CLOBBER is possibly do
2362 some substitutions in a MEM within it. */
2363 if (GET_CODE (XEXP (x
, 0)) == MEM
)
2364 subst_constants (&XEXP (XEXP (x
, 0), 0), insn
, map
, 0);
2368 /* Substitute for parms and known constants. Don't replace
2369 hard regs used as user variables with constants. */
2372 int regno
= REGNO (x
);
2373 struct const_equiv_data
*p
;
2375 if (! (regno
< FIRST_PSEUDO_REGISTER
&& REG_USERVAR_P (x
))
2376 && (size_t) regno
< VARRAY_SIZE (map
->const_equiv_varray
)
2377 && (p
= &VARRAY_CONST_EQUIV (map
->const_equiv_varray
, regno
),
2379 && p
->age
>= map
->const_age
)
2380 validate_change (insn
, loc
, p
->rtx
, 1);
2385 /* SUBREG applied to something other than a reg
2386 should be treated as ordinary, since that must
2387 be a special hack and we don't know how to treat it specially.
2388 Consider for example mulsidi3 in m68k.md.
2389 Ordinary SUBREG of a REG needs this special treatment. */
2390 if (! memonly
&& GET_CODE (SUBREG_REG (x
)) == REG
)
2392 rtx inner
= SUBREG_REG (x
);
2395 /* We can't call subst_constants on &SUBREG_REG (x) because any
2396 constant or SUBREG wouldn't be valid inside our SUBEG. Instead,
2397 see what is inside, try to form the new SUBREG and see if that is
2398 valid. We handle two cases: extracting a full word in an
2399 integral mode and extracting the low part. */
2400 subst_constants (&inner
, NULL_RTX
, map
, 0);
2402 if (GET_MODE_CLASS (GET_MODE (x
)) == MODE_INT
2403 && GET_MODE_SIZE (GET_MODE (x
)) == UNITS_PER_WORD
2404 && GET_MODE (SUBREG_REG (x
)) != VOIDmode
)
2405 new = operand_subword (inner
, SUBREG_WORD (x
), 0,
2406 GET_MODE (SUBREG_REG (x
)));
2408 cancel_changes (num_changes
);
2409 if (new == 0 && subreg_lowpart_p (x
))
2410 new = gen_lowpart_common (GET_MODE (x
), inner
);
2413 validate_change (insn
, loc
, new, 1);
2420 subst_constants (&XEXP (x
, 0), insn
, map
, 0);
2422 /* If a memory address got spoiled, change it back. */
2423 if (! memonly
&& insn
!= 0 && num_validated_changes () != num_changes
2424 && ! memory_address_p (GET_MODE (x
), XEXP (x
, 0)))
2425 cancel_changes (num_changes
);
2430 /* Substitute constants in our source, and in any arguments to a
2431 complex (e..g, ZERO_EXTRACT) destination, but not in the destination
2433 rtx
*dest_loc
= &SET_DEST (x
);
2434 rtx dest
= *dest_loc
;
2436 enum machine_mode compare_mode
= VOIDmode
;
2438 /* If SET_SRC is a COMPARE which subst_constants would turn into
2439 COMPARE of 2 VOIDmode constants, note the mode in which comparison
2441 if (GET_CODE (SET_SRC (x
)) == COMPARE
)
2444 if (GET_MODE_CLASS (GET_MODE (src
)) == MODE_CC
2450 compare_mode
= GET_MODE (XEXP (src
, 0));
2451 if (compare_mode
== VOIDmode
)
2452 compare_mode
= GET_MODE (XEXP (src
, 1));
2456 subst_constants (&SET_SRC (x
), insn
, map
, memonly
);
2459 while (GET_CODE (*dest_loc
) == ZERO_EXTRACT
2460 || GET_CODE (*dest_loc
) == SUBREG
2461 || GET_CODE (*dest_loc
) == STRICT_LOW_PART
)
2463 if (GET_CODE (*dest_loc
) == ZERO_EXTRACT
)
2465 subst_constants (&XEXP (*dest_loc
, 1), insn
, map
, memonly
);
2466 subst_constants (&XEXP (*dest_loc
, 2), insn
, map
, memonly
);
2468 dest_loc
= &XEXP (*dest_loc
, 0);
2471 /* Do substitute in the address of a destination in memory. */
2472 if (GET_CODE (*dest_loc
) == MEM
)
2473 subst_constants (&XEXP (*dest_loc
, 0), insn
, map
, 0);
2475 /* Check for the case of DEST a SUBREG, both it and the underlying
2476 register are less than one word, and the SUBREG has the wider mode.
2477 In the case, we are really setting the underlying register to the
2478 source converted to the mode of DEST. So indicate that. */
2479 if (GET_CODE (dest
) == SUBREG
2480 && GET_MODE_SIZE (GET_MODE (dest
)) <= UNITS_PER_WORD
2481 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest
))) <= UNITS_PER_WORD
2482 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest
)))
2483 <= GET_MODE_SIZE (GET_MODE (dest
)))
2484 && (tem
= gen_lowpart_if_possible (GET_MODE (SUBREG_REG (dest
)),
2486 src
= tem
, dest
= SUBREG_REG (dest
);
2488 /* If storing a recognizable value save it for later recording. */
2489 if ((map
->num_sets
< MAX_RECOG_OPERANDS
)
2490 && (CONSTANT_P (src
)
2491 || (GET_CODE (src
) == REG
2492 && (REGNO (src
) == VIRTUAL_INCOMING_ARGS_REGNUM
2493 || REGNO (src
) == VIRTUAL_STACK_VARS_REGNUM
))
2494 || (GET_CODE (src
) == PLUS
2495 && GET_CODE (XEXP (src
, 0)) == REG
2496 && (REGNO (XEXP (src
, 0)) == VIRTUAL_INCOMING_ARGS_REGNUM
2497 || REGNO (XEXP (src
, 0)) == VIRTUAL_STACK_VARS_REGNUM
)
2498 && CONSTANT_P (XEXP (src
, 1)))
2499 || GET_CODE (src
) == COMPARE
2504 && (src
== pc_rtx
|| GET_CODE (src
) == RETURN
2505 || GET_CODE (src
) == LABEL_REF
))))
2507 /* Normally, this copy won't do anything. But, if SRC is a COMPARE
2508 it will cause us to save the COMPARE with any constants
2509 substituted, which is what we want for later. */
2510 rtx src_copy
= copy_rtx (src
);
2511 map
->equiv_sets
[map
->num_sets
].equiv
= src_copy
;
2512 map
->equiv_sets
[map
->num_sets
++].dest
= dest
;
2513 if (compare_mode
!= VOIDmode
2514 && GET_CODE (src
) == COMPARE
2515 && (GET_MODE_CLASS (GET_MODE (src
)) == MODE_CC
2520 && GET_MODE (XEXP (src
, 0)) == VOIDmode
2521 && GET_MODE (XEXP (src
, 1)) == VOIDmode
)
2523 map
->compare_src
= src_copy
;
2524 map
->compare_mode
= compare_mode
;
2534 format_ptr
= GET_RTX_FORMAT (code
);
2536 /* If the first operand is an expression, save its mode for later. */
2537 if (*format_ptr
== 'e')
2538 op0_mode
= GET_MODE (XEXP (x
, 0));
2540 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++)
2542 switch (*format_ptr
++)
2549 subst_constants (&XEXP (x
, i
), insn
, map
, memonly
);
2561 if (XVEC (x
, i
) != NULL
&& XVECLEN (x
, i
) != 0)
2562 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2563 subst_constants (&XVECEXP (x
, i
, j
), insn
, map
, memonly
);
2572 /* If this is a commutative operation, move a constant to the second
2573 operand unless the second operand is already a CONST_INT. */
2575 && (GET_RTX_CLASS (code
) == 'c' || code
== NE
|| code
== EQ
)
2576 && CONSTANT_P (XEXP (x
, 0)) && GET_CODE (XEXP (x
, 1)) != CONST_INT
)
2578 rtx tem
= XEXP (x
, 0);
2579 validate_change (insn
, &XEXP (x
, 0), XEXP (x
, 1), 1);
2580 validate_change (insn
, &XEXP (x
, 1), tem
, 1);
2583 /* Simplify the expression in case we put in some constants. */
2585 switch (GET_RTX_CLASS (code
))
2588 if (op0_mode
== MAX_MACHINE_MODE
)
2590 new = simplify_unary_operation (code
, GET_MODE (x
),
2591 XEXP (x
, 0), op0_mode
);
2596 enum machine_mode op_mode
= GET_MODE (XEXP (x
, 0));
2598 if (op_mode
== VOIDmode
)
2599 op_mode
= GET_MODE (XEXP (x
, 1));
2600 new = simplify_relational_operation (code
, op_mode
,
2601 XEXP (x
, 0), XEXP (x
, 1));
2602 #ifdef FLOAT_STORE_FLAG_VALUE
2603 if (new != 0 && GET_MODE_CLASS (GET_MODE (x
)) == MODE_FLOAT
)
2605 enum machine_mode mode
= GET_MODE (x
);
2606 if (new == const0_rtx
)
2607 new = CONST0_RTX (mode
);
2610 REAL_VALUE_TYPE val
= FLOAT_STORE_FLAG_VALUE (mode
);
2611 new = CONST_DOUBLE_FROM_REAL_VALUE (val
, mode
);
2620 new = simplify_binary_operation (code
, GET_MODE (x
),
2621 XEXP (x
, 0), XEXP (x
, 1));
2626 if (op0_mode
== MAX_MACHINE_MODE
)
2629 if (code
== IF_THEN_ELSE
)
2631 rtx op0
= XEXP (x
, 0);
2633 if (GET_RTX_CLASS (GET_CODE (op0
)) == '<'
2634 && GET_MODE (op0
) == VOIDmode
2635 && ! side_effects_p (op0
)
2636 && XEXP (op0
, 0) == map
->compare_src
2637 && GET_MODE (XEXP (op0
, 1)) == VOIDmode
)
2639 /* We have compare of two VOIDmode constants for which
2640 we recorded the comparison mode. */
2642 simplify_relational_operation (GET_CODE (op0
),
2647 if (temp
== const0_rtx
)
2649 else if (temp
== const1_rtx
)
2654 new = simplify_ternary_operation (code
, GET_MODE (x
), op0_mode
,
2655 XEXP (x
, 0), XEXP (x
, 1),
2661 validate_change (insn
, loc
, new, 1);
2664 /* Show that register modified no longer contain known constants. We are
2665 called from note_stores with parts of the new insn. */
2668 mark_stores (dest
, x
, data
)
2670 rtx x ATTRIBUTE_UNUSED
;
2671 void *data ATTRIBUTE_UNUSED
;
2674 enum machine_mode mode
= VOIDmode
;
2676 /* DEST is always the innermost thing set, except in the case of
2677 SUBREGs of hard registers. */
2679 if (GET_CODE (dest
) == REG
)
2680 regno
= REGNO (dest
), mode
= GET_MODE (dest
);
2681 else if (GET_CODE (dest
) == SUBREG
&& GET_CODE (SUBREG_REG (dest
)) == REG
)
2683 regno
= REGNO (SUBREG_REG (dest
)) + SUBREG_WORD (dest
);
2684 mode
= GET_MODE (SUBREG_REG (dest
));
2689 unsigned int uregno
= regno
;
2690 unsigned int last_reg
= (uregno
>= FIRST_PSEUDO_REGISTER
? uregno
2691 : uregno
+ HARD_REGNO_NREGS (uregno
, mode
) - 1);
2694 /* Ignore virtual stack var or virtual arg register since those
2695 are handled separately. */
2696 if (uregno
!= VIRTUAL_INCOMING_ARGS_REGNUM
2697 && uregno
!= VIRTUAL_STACK_VARS_REGNUM
)
2698 for (i
= uregno
; i
<= last_reg
; i
++)
2699 if ((size_t) i
< VARRAY_SIZE (global_const_equiv_varray
))
2700 VARRAY_CONST_EQUIV (global_const_equiv_varray
, i
).rtx
= 0;
2704 /* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the
2705 given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so
2706 that it points to the node itself, thus indicating that the node is its
2707 own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for
2708 the given node is NULL, recursively descend the decl/block tree which
2709 it is the root of, and for each other ..._DECL or BLOCK node contained
2710 therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also
2711 still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN
2712 values to point to themselves. */
2715 set_block_origin_self (stmt
)
2718 if (BLOCK_ABSTRACT_ORIGIN (stmt
) == NULL_TREE
)
2720 BLOCK_ABSTRACT_ORIGIN (stmt
) = stmt
;
2723 register tree local_decl
;
2725 for (local_decl
= BLOCK_VARS (stmt
);
2726 local_decl
!= NULL_TREE
;
2727 local_decl
= TREE_CHAIN (local_decl
))
2728 set_decl_origin_self (local_decl
); /* Potential recursion. */
2732 register tree subblock
;
2734 for (subblock
= BLOCK_SUBBLOCKS (stmt
);
2735 subblock
!= NULL_TREE
;
2736 subblock
= BLOCK_CHAIN (subblock
))
2737 set_block_origin_self (subblock
); /* Recurse. */
2742 /* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for
2743 the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the
2744 node to so that it points to the node itself, thus indicating that the
2745 node represents its own (abstract) origin. Additionally, if the
2746 DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend
2747 the decl/block tree of which the given node is the root of, and for
2748 each other ..._DECL or BLOCK node contained therein whose
2749 DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL,
2750 set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to
2751 point to themselves. */
2754 set_decl_origin_self (decl
)
2757 if (DECL_ABSTRACT_ORIGIN (decl
) == NULL_TREE
)
2759 DECL_ABSTRACT_ORIGIN (decl
) = decl
;
2760 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2764 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= TREE_CHAIN (arg
))
2765 DECL_ABSTRACT_ORIGIN (arg
) = arg
;
2766 if (DECL_INITIAL (decl
) != NULL_TREE
2767 && DECL_INITIAL (decl
) != error_mark_node
)
2768 set_block_origin_self (DECL_INITIAL (decl
));
2773 /* Given a pointer to some BLOCK node, and a boolean value to set the
2774 "abstract" flags to, set that value into the BLOCK_ABSTRACT flag for
2775 the given block, and for all local decls and all local sub-blocks
2776 (recursively) which are contained therein. */
2779 set_block_abstract_flags (stmt
, setting
)
2781 register int setting
;
2783 register tree local_decl
;
2784 register tree subblock
;
2786 BLOCK_ABSTRACT (stmt
) = setting
;
2788 for (local_decl
= BLOCK_VARS (stmt
);
2789 local_decl
!= NULL_TREE
;
2790 local_decl
= TREE_CHAIN (local_decl
))
2791 set_decl_abstract_flags (local_decl
, setting
);
2793 for (subblock
= BLOCK_SUBBLOCKS (stmt
);
2794 subblock
!= NULL_TREE
;
2795 subblock
= BLOCK_CHAIN (subblock
))
2796 set_block_abstract_flags (subblock
, setting
);
2799 /* Given a pointer to some ..._DECL node, and a boolean value to set the
2800 "abstract" flags to, set that value into the DECL_ABSTRACT flag for the
2801 given decl, and (in the case where the decl is a FUNCTION_DECL) also
2802 set the abstract flags for all of the parameters, local vars, local
2803 blocks and sub-blocks (recursively) to the same setting. */
2806 set_decl_abstract_flags (decl
, setting
)
2808 register int setting
;
2810 DECL_ABSTRACT (decl
) = setting
;
2811 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2815 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= TREE_CHAIN (arg
))
2816 DECL_ABSTRACT (arg
) = setting
;
2817 if (DECL_INITIAL (decl
) != NULL_TREE
2818 && DECL_INITIAL (decl
) != error_mark_node
)
2819 set_block_abstract_flags (DECL_INITIAL (decl
), setting
);
2823 /* Output the assembly language code for the function FNDECL
2824 from its DECL_SAVED_INSNS. Used for inline functions that are output
2825 at end of compilation instead of where they came in the source. */
2828 output_inline_function (fndecl
)
2831 struct function
*old_cfun
= cfun
;
2832 enum debug_info_type old_write_symbols
= write_symbols
;
2833 struct function
*f
= DECL_SAVED_INSNS (fndecl
);
2836 current_function_decl
= fndecl
;
2837 clear_emit_caches ();
2839 set_new_last_label_num (f
->inl_max_label_num
);
2841 /* We're not deferring this any longer. */
2842 DECL_DEFER_OUTPUT (fndecl
) = 0;
2844 /* If requested, suppress debugging information. */
2845 if (f
->no_debugging_symbols
)
2846 write_symbols
= NO_DEBUG
;
2848 /* Do any preparation, such as emitting abstract debug info for the inline
2849 before it gets mangled by optimization. */
2850 note_outlining_of_inline_function (fndecl
);
2852 /* Compile this function all the way down to assembly code. */
2853 rest_of_compilation (fndecl
);
2855 /* We can't inline this anymore. */
2857 DECL_INLINE (fndecl
) = 0;
2860 current_function_decl
= old_cfun
? old_cfun
->decl
: 0;
2861 write_symbols
= old_write_symbols
;