1 /* Procedure integration for GNU CC.
2 Copyright (C) 1988, 91, 93, 94, 95, 96, 1997 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
30 #include "insn-config.h"
31 #include "insn-flags.h"
34 #include "integrate.h"
41 #define obstack_chunk_alloc xmalloc
42 #define obstack_chunk_free free
44 extern struct obstack *function_maybepermanent_obstack;
46 extern tree pushdecl ();
47 extern tree poplevel ();
49 /* Similar, but round to the next highest integer that meets the
51 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
53 /* Default max number of insns a function can have and still be inline.
54 This is overridden on RISC machines. */
55 #ifndef INTEGRATE_THRESHOLD
56 #define INTEGRATE_THRESHOLD(DECL) \
57 (8 * (8 + list_length (DECL_ARGUMENTS (DECL))))
60 static rtx initialize_for_inline PROTO((tree, int, int, int, int));
61 static void finish_inline PROTO((tree, rtx));
62 static void adjust_copied_decl_tree PROTO((tree));
63 static tree copy_decl_list PROTO((tree));
64 static tree copy_decl_tree PROTO((tree));
65 static void copy_decl_rtls PROTO((tree));
66 static void save_constants PROTO((rtx *));
67 static void note_modified_parmregs PROTO((rtx, rtx));
68 static rtx copy_for_inline PROTO((rtx));
69 static void integrate_parm_decls PROTO((tree, struct inline_remap *, rtvec));
70 static void integrate_decl_tree PROTO((tree, int, struct inline_remap *));
71 static void save_constants_in_decl_trees PROTO ((tree));
72 static void subst_constants PROTO((rtx *, rtx, struct inline_remap *));
73 static void restore_constants PROTO((rtx *));
74 static void set_block_origin_self PROTO((tree));
75 static void set_decl_origin_self PROTO((tree));
76 static void set_block_abstract_flags PROTO((tree, int));
78 void set_decl_abstract_flags PROTO((tree, int));
80 /* Zero if the current function (whose FUNCTION_DECL is FNDECL)
81 is safe and reasonable to integrate into other functions.
82 Nonzero means value is a warning message with a single %s
83 for the function's name. */
86 function_cannot_inline_p (fndecl)
90 tree last = tree_last (TYPE_ARG_TYPES (TREE_TYPE (fndecl)));
91 int max_insns = INTEGRATE_THRESHOLD (fndecl);
92 register int ninsns = 0;
96 /* No inlines with varargs. `grokdeclarator' gives a warning
97 message about that if `inline' is specified. This code
98 it put in to catch the volunteers. */
99 if ((last && TREE_VALUE (last) != void_type_node)
100 || current_function_varargs)
101 return "varargs function cannot be inline";
103 if (current_function_calls_alloca)
104 return "function using alloca cannot be inline";
106 if (current_function_contains_functions)
107 return "function with nested functions cannot be inline";
109 /* If its not even close, don't even look. */
110 if (!DECL_INLINE (fndecl) && get_max_uid () > 3 * max_insns)
111 return "function too large to be inline";
114 /* Don't inline functions which do not specify a function prototype and
115 have BLKmode argument or take the address of a parameter. */
116 for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms))
118 if (TYPE_MODE (TREE_TYPE (parms)) == BLKmode)
119 TREE_ADDRESSABLE (parms) = 1;
120 if (last == NULL_TREE && TREE_ADDRESSABLE (parms))
121 return "no prototype, and parameter address used; cannot be inline";
125 /* We can't inline functions that return structures
126 the old-fashioned PCC way, copying into a static block. */
127 if (current_function_returns_pcc_struct)
128 return "inline functions not supported for this return value type";
130 /* We can't inline functions that return BLKmode structures in registers. */
131 if (TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl))) == BLKmode
132 && ! aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl))))
133 return "inline functions not supported for this return value type";
135 /* We can't inline functions that return structures of varying size. */
136 if (int_size_in_bytes (TREE_TYPE (TREE_TYPE (fndecl))) < 0)
137 return "function with varying-size return value cannot be inline";
139 /* Cannot inline a function with a varying size argument or one that
140 receives a transparent union. */
141 for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms))
143 if (int_size_in_bytes (TREE_TYPE (parms)) < 0)
144 return "function with varying-size parameter cannot be inline";
145 else if (TYPE_TRANSPARENT_UNION (TREE_TYPE (parms)))
146 return "function with transparent unit parameter cannot be inline";
149 if (!DECL_INLINE (fndecl) && get_max_uid () > max_insns)
151 for (ninsns = 0, insn = get_first_nonparm_insn ();
152 insn && ninsns < max_insns;
153 insn = NEXT_INSN (insn))
154 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
157 if (ninsns >= max_insns)
158 return "function too large to be inline";
161 /* We cannot inline this function if forced_labels is non-zero. This
162 implies that a label in this function was used as an initializer.
163 Because labels can not be duplicated, all labels in the function
164 will be renamed when it is inlined. However, there is no way to find
165 and fix all variables initialized with addresses of labels in this
166 function, hence inlining is impossible. */
169 return "function with label addresses used in initializers cannot inline";
171 /* We cannot inline a nested function that jumps to a nonlocal label. */
172 if (current_function_has_nonlocal_goto)
173 return "function with nonlocal goto cannot be inline";
175 /* This is a hack, until the inliner is taught about eh regions at
176 the start of the function. */
177 for (insn = get_insns ();
179 && ! (GET_CODE (insn) == NOTE
180 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG);
181 insn = NEXT_INSN (insn))
183 if (insn && GET_CODE (insn) == NOTE
184 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG)
185 return "function with complex parameters cannot be inline";
188 /* We can't inline functions that return a PARALLEL rtx. */
189 result = DECL_RTL (DECL_RESULT (fndecl));
190 if (result && GET_CODE (result) == PARALLEL)
191 return "inline functions not supported for this return value type";
196 /* Variables used within save_for_inline. */
198 /* Mapping from old pseudo-register to new pseudo-registers.
199 The first element of this map is reg_map[FIRST_PSEUDO_REGISTER].
200 It is allocated in `save_for_inline' and `expand_inline_function',
201 and deallocated on exit from each of those routines. */
204 /* Mapping from old code-labels to new code-labels.
205 The first element of this map is label_map[min_labelno].
206 It is allocated in `save_for_inline' and `expand_inline_function',
207 and deallocated on exit from each of those routines. */
208 static rtx *label_map;
210 /* Mapping from old insn uid's to copied insns.
211 It is allocated in `save_for_inline' and `expand_inline_function',
212 and deallocated on exit from each of those routines. */
213 static rtx *insn_map;
215 /* Map pseudo reg number into the PARM_DECL for the parm living in the reg.
216 Zero for a reg that isn't a parm's home.
217 Only reg numbers less than max_parm_reg are mapped here. */
218 static tree *parmdecl_map;
220 /* Keep track of first pseudo-register beyond those that are parms. */
221 static int max_parm_reg;
223 /* When an insn is being copied by copy_for_inline,
224 this is nonzero if we have copied an ASM_OPERANDS.
225 In that case, it is the original input-operand vector. */
226 static rtvec orig_asm_operands_vector;
228 /* When an insn is being copied by copy_for_inline,
229 this is nonzero if we have copied an ASM_OPERANDS.
230 In that case, it is the copied input-operand vector. */
231 static rtvec copy_asm_operands_vector;
233 /* Likewise, this is the copied constraints vector. */
234 static rtvec copy_asm_constraints_vector;
236 /* In save_for_inline, nonzero if past the parm-initialization insns. */
237 static int in_nonparm_insns;
239 /* Subroutine for `save_for_inline{copying,nocopy}'. Performs initialization
240 needed to save FNDECL's insns and info for future inline expansion. */
243 initialize_for_inline (fndecl, min_labelno, max_labelno, max_reg, copy)
250 int function_flags, i;
254 /* Compute the values of any flags we must restore when inlining this. */
257 = (current_function_calls_alloca * FUNCTION_FLAGS_CALLS_ALLOCA
258 + current_function_calls_setjmp * FUNCTION_FLAGS_CALLS_SETJMP
259 + current_function_calls_longjmp * FUNCTION_FLAGS_CALLS_LONGJMP
260 + current_function_returns_struct * FUNCTION_FLAGS_RETURNS_STRUCT
261 + current_function_returns_pcc_struct * FUNCTION_FLAGS_RETURNS_PCC_STRUCT
262 + current_function_needs_context * FUNCTION_FLAGS_NEEDS_CONTEXT
263 + current_function_has_nonlocal_label * FUNCTION_FLAGS_HAS_NONLOCAL_LABEL
264 + current_function_returns_pointer * FUNCTION_FLAGS_RETURNS_POINTER
265 + current_function_uses_const_pool * FUNCTION_FLAGS_USES_CONST_POOL
266 + current_function_uses_pic_offset_table * FUNCTION_FLAGS_USES_PIC_OFFSET_TABLE);
268 /* Clear out PARMDECL_MAP. It was allocated in the caller's frame. */
269 bzero ((char *) parmdecl_map, max_parm_reg * sizeof (tree));
270 arg_vector = rtvec_alloc (list_length (DECL_ARGUMENTS (fndecl)));
272 for (parms = DECL_ARGUMENTS (fndecl), i = 0;
274 parms = TREE_CHAIN (parms), i++)
276 rtx p = DECL_RTL (parms);
278 if (GET_CODE (p) == MEM && copy)
280 /* Copy the rtl so that modifications of the addresses
281 later in compilation won't affect this arg_vector.
282 Virtual register instantiation can screw the address
284 rtx new = copy_rtx (p);
286 /* Don't leave the old copy anywhere in this decl. */
287 if (DECL_RTL (parms) == DECL_INCOMING_RTL (parms)
288 || (GET_CODE (DECL_RTL (parms)) == MEM
289 && GET_CODE (DECL_INCOMING_RTL (parms)) == MEM
290 && (XEXP (DECL_RTL (parms), 0)
291 == XEXP (DECL_INCOMING_RTL (parms), 0))))
292 DECL_INCOMING_RTL (parms) = new;
293 DECL_RTL (parms) = new;
296 RTVEC_ELT (arg_vector, i) = p;
298 if (GET_CODE (p) == REG)
299 parmdecl_map[REGNO (p)] = parms;
300 else if (GET_CODE (p) == CONCAT)
302 rtx preal = gen_realpart (GET_MODE (XEXP (p, 0)), p);
303 rtx pimag = gen_imagpart (GET_MODE (preal), p);
305 if (GET_CODE (preal) == REG)
306 parmdecl_map[REGNO (preal)] = parms;
307 if (GET_CODE (pimag) == REG)
308 parmdecl_map[REGNO (pimag)] = parms;
311 /* This flag is cleared later
312 if the function ever modifies the value of the parm. */
313 TREE_READONLY (parms) = 1;
316 /* Assume we start out in the insns that set up the parameters. */
317 in_nonparm_insns = 0;
319 /* The list of DECL_SAVED_INSNS, starts off with a header which
320 contains the following information:
322 the first insn of the function (not including the insns that copy
323 parameters into registers).
324 the first parameter insn of the function,
325 the first label used by that function,
326 the last label used by that function,
327 the highest register number used for parameters,
328 the total number of registers used,
329 the size of the incoming stack area for parameters,
330 the number of bytes popped on return,
332 the labels that are forced to exist,
333 some flags that are used to restore compiler globals,
334 the value of current_function_outgoing_args_size,
335 the original argument vector,
336 the original DECL_INITIAL,
337 and pointers to the table of psuedo regs, pointer flags, and alignment. */
339 return gen_inline_header_rtx (NULL_RTX, NULL_RTX, min_labelno, max_labelno,
340 max_parm_reg, max_reg,
341 current_function_args_size,
342 current_function_pops_args,
343 stack_slot_list, forced_labels, function_flags,
344 current_function_outgoing_args_size,
345 arg_vector, (rtx) DECL_INITIAL (fndecl),
346 (rtvec) regno_reg_rtx, regno_pointer_flag,
347 regno_pointer_align);
350 /* Subroutine for `save_for_inline{copying,nocopy}'. Finishes up the
351 things that must be done to make FNDECL expandable as an inline function.
352 HEAD contains the chain of insns to which FNDECL will expand. */
355 finish_inline (fndecl, head)
359 FIRST_FUNCTION_INSN (head) = get_first_nonparm_insn ();
360 FIRST_PARM_INSN (head) = get_insns ();
361 DECL_SAVED_INSNS (fndecl) = head;
362 DECL_FRAME_SIZE (fndecl) = get_frame_size ();
365 /* Adjust the BLOCK_END_NOTE pointers in a given copied DECL tree so that
366 they all point to the new (copied) rtxs. */
369 adjust_copied_decl_tree (block)
372 register tree subblock;
373 register rtx original_end;
375 original_end = BLOCK_END_NOTE (block);
378 BLOCK_END_NOTE (block) = (rtx) NOTE_SOURCE_FILE (original_end);
379 NOTE_SOURCE_FILE (original_end) = 0;
382 /* Process all subblocks. */
383 for (subblock = BLOCK_SUBBLOCKS (block);
385 subblock = TREE_CHAIN (subblock))
386 adjust_copied_decl_tree (subblock);
389 /* Make the insns and PARM_DECLs of the current function permanent
390 and record other information in DECL_SAVED_INSNS to allow inlining
391 of this function in subsequent calls.
393 This function is called when we are going to immediately compile
394 the insns for FNDECL. The insns in maybepermanent_obstack cannot be
395 modified by the compilation process, so we copy all of them to
396 new storage and consider the new insns to be the insn chain to be
397 compiled. Our caller (rest_of_compilation) saves the original
398 DECL_INITIAL and DECL_ARGUMENTS; here we copy them. */
400 /* ??? The nonlocal_label list should be adjusted also. However, since
401 a function that contains a nested function never gets inlined currently,
402 the nonlocal_label list will always be empty, so we don't worry about
406 save_for_inline_copying (fndecl)
409 rtx first_insn, last_insn, insn;
411 int max_labelno, min_labelno, i, len;
414 rtx first_nonparm_insn;
417 /* The pointer used to track the true location of the memory used
419 rtx *real_label_map = 0;
421 /* Make and emit a return-label if we have not already done so.
422 Do this before recording the bounds on label numbers. */
424 if (return_label == 0)
426 return_label = gen_label_rtx ();
427 emit_label (return_label);
430 /* Get some bounds on the labels and registers used. */
432 max_labelno = max_label_num ();
433 min_labelno = get_first_label_num ();
434 max_reg = max_reg_num ();
436 /* Set up PARMDECL_MAP which maps pseudo-reg number to its PARM_DECL.
437 Later we set TREE_READONLY to 0 if the parm is modified inside the fn.
438 Also set up ARG_VECTOR, which holds the unmodified DECL_RTX values
439 for the parms, prior to elimination of virtual registers.
440 These values are needed for substituting parms properly. */
442 max_parm_reg = max_parm_reg_num ();
443 parmdecl_map = (tree *) alloca (max_parm_reg * sizeof (tree));
445 head = initialize_for_inline (fndecl, min_labelno, max_labelno, max_reg, 1);
447 if (current_function_uses_const_pool)
449 /* Replace any constant pool references with the actual constant. We
450 will put the constants back in the copy made below. */
451 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
452 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
454 save_constants (&PATTERN (insn));
455 if (REG_NOTES (insn))
456 save_constants (®_NOTES (insn));
459 /* Also scan all decls, and replace any constant pool references with the
461 save_constants_in_decl_trees (DECL_INITIAL (fndecl));
463 /* Clear out the constant pool so that we can recreate it with the
464 copied constants below. */
465 init_const_rtx_hash_table ();
466 clear_const_double_mem ();
469 max_uid = INSN_UID (head);
471 /* We have now allocated all that needs to be allocated permanently
472 on the rtx obstack. Set our high-water mark, so that we
473 can free the rest of this when the time comes. */
477 /* Copy the chain insns of this function.
478 Install the copied chain as the insns of this function,
479 for continued compilation;
480 the original chain is recorded as the DECL_SAVED_INSNS
481 for inlining future calls. */
483 /* If there are insns that copy parms from the stack into pseudo registers,
484 those insns are not copied. `expand_inline_function' must
485 emit the correct code to handle such things. */
488 if (GET_CODE (insn) != NOTE)
490 first_insn = rtx_alloc (NOTE);
491 NOTE_SOURCE_FILE (first_insn) = NOTE_SOURCE_FILE (insn);
492 NOTE_LINE_NUMBER (first_insn) = NOTE_LINE_NUMBER (insn);
493 INSN_UID (first_insn) = INSN_UID (insn);
494 PREV_INSN (first_insn) = NULL;
495 NEXT_INSN (first_insn) = NULL;
496 last_insn = first_insn;
498 /* Each pseudo-reg in the old insn chain must have a unique rtx in the copy.
499 Make these new rtx's now, and install them in regno_reg_rtx, so they
500 will be the official pseudo-reg rtx's for the rest of compilation. */
502 reg_map = (rtx *) savealloc (regno_pointer_flag_length * sizeof (rtx));
504 len = sizeof (struct rtx_def) + (GET_RTX_LENGTH (REG) - 1) * sizeof (rtunion);
505 for (i = max_reg - 1; i > LAST_VIRTUAL_REGISTER; i--)
506 reg_map[i] = (rtx)obstack_copy (function_maybepermanent_obstack,
507 regno_reg_rtx[i], len);
509 regno_reg_rtx = reg_map;
511 /* Put copies of all the virtual register rtx into the new regno_reg_rtx. */
512 regno_reg_rtx[VIRTUAL_INCOMING_ARGS_REGNUM] = virtual_incoming_args_rtx;
513 regno_reg_rtx[VIRTUAL_STACK_VARS_REGNUM] = virtual_stack_vars_rtx;
514 regno_reg_rtx[VIRTUAL_STACK_DYNAMIC_REGNUM] = virtual_stack_dynamic_rtx;
515 regno_reg_rtx[VIRTUAL_OUTGOING_ARGS_REGNUM] = virtual_outgoing_args_rtx;
517 /* Likewise each label rtx must have a unique rtx as its copy. */
519 /* We used to use alloca here, but the size of what it would try to
520 allocate would occasionally cause it to exceed the stack limit and
521 cause unpredictable core dumps. Some examples were > 2Mb in size. */
523 = (rtx *) xmalloc ((max_labelno - min_labelno) * sizeof (rtx));
524 label_map = real_label_map - min_labelno;
526 for (i = min_labelno; i < max_labelno; i++)
527 label_map[i] = gen_label_rtx ();
529 /* Record the mapping of old insns to copied insns. */
531 insn_map = (rtx *) alloca (max_uid * sizeof (rtx));
532 bzero ((char *) insn_map, max_uid * sizeof (rtx));
534 /* Get the insn which signals the end of parameter setup code. */
535 first_nonparm_insn = get_first_nonparm_insn ();
537 /* Copy any entries in regno_reg_rtx or DECL_RTLs that reference MEM
538 (the former occurs when a variable has its address taken)
539 since these may be shared and can be changed by virtual
540 register instantiation. DECL_RTL values for our arguments
541 have already been copied by initialize_for_inline. */
542 for (i = LAST_VIRTUAL_REGISTER + 1; i < max_reg; i++)
543 if (GET_CODE (regno_reg_rtx[i]) == MEM)
544 XEXP (regno_reg_rtx[i], 0)
545 = copy_for_inline (XEXP (regno_reg_rtx[i], 0));
547 /* Copy the tree of subblocks of the function, and the decls in them.
548 We will use the copy for compiling this function, then restore the original
549 subblocks and decls for use when inlining this function.
551 Several parts of the compiler modify BLOCK trees. In particular,
552 instantiate_virtual_regs will instantiate any virtual regs
553 mentioned in the DECL_RTLs of the decls, and loop
554 unrolling will replicate any BLOCK trees inside an unrolled loop.
556 The modified subblocks or DECL_RTLs would be incorrect for the original rtl
557 which we will use for inlining. The rtl might even contain pseudoregs
558 whose space has been freed. */
560 DECL_INITIAL (fndecl) = copy_decl_tree (DECL_INITIAL (fndecl));
561 DECL_ARGUMENTS (fndecl) = copy_decl_list (DECL_ARGUMENTS (fndecl));
563 /* Now copy each DECL_RTL which is a MEM,
564 so it is safe to modify their addresses. */
565 copy_decl_rtls (DECL_INITIAL (fndecl));
567 /* The fndecl node acts as its own progenitor, so mark it as such. */
568 DECL_ABSTRACT_ORIGIN (fndecl) = fndecl;
570 /* Now copy the chain of insns. Do this twice. The first copy the insn
571 itself and its body. The second time copy of REG_NOTES. This is because
572 a REG_NOTE may have a forward pointer to another insn. */
574 for (insn = NEXT_INSN (insn); insn; insn = NEXT_INSN (insn))
576 orig_asm_operands_vector = 0;
578 if (insn == first_nonparm_insn)
579 in_nonparm_insns = 1;
581 switch (GET_CODE (insn))
584 /* No need to keep these. */
585 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
588 copy = rtx_alloc (NOTE);
589 NOTE_LINE_NUMBER (copy) = NOTE_LINE_NUMBER (insn);
590 if (NOTE_LINE_NUMBER (insn) != NOTE_INSN_BLOCK_END)
591 NOTE_SOURCE_FILE (copy) = NOTE_SOURCE_FILE (insn);
594 NOTE_SOURCE_FILE (insn) = (char *) copy;
595 NOTE_SOURCE_FILE (copy) = 0;
597 if (NOTE_LINE_NUMBER (copy) == NOTE_INSN_EH_REGION_BEG
598 || NOTE_LINE_NUMBER (copy) == NOTE_INSN_EH_REGION_END)
600 /* We have to forward these both to match the new exception
602 NOTE_BLOCK_NUMBER (copy)
603 = CODE_LABEL_NUMBER (label_map[NOTE_BLOCK_NUMBER (copy)]);
606 RTX_INTEGRATED_P (copy) = RTX_INTEGRATED_P (insn);
612 copy = rtx_alloc (GET_CODE (insn));
614 if (GET_CODE (insn) == CALL_INSN)
615 CALL_INSN_FUNCTION_USAGE (copy)
616 = copy_for_inline (CALL_INSN_FUNCTION_USAGE (insn));
618 PATTERN (copy) = copy_for_inline (PATTERN (insn));
619 INSN_CODE (copy) = -1;
620 LOG_LINKS (copy) = NULL_RTX;
621 RTX_INTEGRATED_P (copy) = RTX_INTEGRATED_P (insn);
625 copy = label_map[CODE_LABEL_NUMBER (insn)];
626 LABEL_NAME (copy) = LABEL_NAME (insn);
630 copy = rtx_alloc (BARRIER);
636 INSN_UID (copy) = INSN_UID (insn);
637 insn_map[INSN_UID (insn)] = copy;
638 NEXT_INSN (last_insn) = copy;
639 PREV_INSN (copy) = last_insn;
643 adjust_copied_decl_tree (DECL_INITIAL (fndecl));
645 /* Now copy the REG_NOTES. */
646 for (insn = NEXT_INSN (get_insns ()); insn; insn = NEXT_INSN (insn))
647 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i'
648 && insn_map[INSN_UID(insn)])
649 REG_NOTES (insn_map[INSN_UID (insn)])
650 = copy_for_inline (REG_NOTES (insn));
652 NEXT_INSN (last_insn) = NULL;
654 finish_inline (fndecl, head);
656 /* Make new versions of the register tables. */
657 new = (char *) savealloc (regno_pointer_flag_length);
658 bcopy (regno_pointer_flag, new, regno_pointer_flag_length);
659 new1 = (char *) savealloc (regno_pointer_flag_length);
660 bcopy (regno_pointer_align, new1, regno_pointer_flag_length);
662 regno_pointer_flag = new;
663 regno_pointer_align = new1;
665 set_new_first_and_last_insn (first_insn, last_insn);
668 free (real_label_map);
671 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
672 For example, this can copy a list made of TREE_LIST nodes. While copying,
673 for each node copied which doesn't already have is DECL_ABSTRACT_ORIGIN
674 set to some non-zero value, set the DECL_ABSTRACT_ORIGIN of the copy to
675 point to the corresponding (abstract) original node. */
678 copy_decl_list (list)
682 register tree prev, next;
687 head = prev = copy_node (list);
688 if (DECL_ABSTRACT_ORIGIN (head) == NULL_TREE)
689 DECL_ABSTRACT_ORIGIN (head) = list;
690 next = TREE_CHAIN (list);
695 copy = copy_node (next);
696 if (DECL_ABSTRACT_ORIGIN (copy) == NULL_TREE)
697 DECL_ABSTRACT_ORIGIN (copy) = next;
698 TREE_CHAIN (prev) = copy;
700 next = TREE_CHAIN (next);
705 /* Make a copy of the entire tree of blocks BLOCK, and return it. */
708 copy_decl_tree (block)
711 tree t, vars, subblocks;
713 vars = copy_decl_list (BLOCK_VARS (block));
716 /* Process all subblocks. */
717 for (t = BLOCK_SUBBLOCKS (block); t; t = TREE_CHAIN (t))
719 tree copy = copy_decl_tree (t);
720 TREE_CHAIN (copy) = subblocks;
724 t = copy_node (block);
725 BLOCK_VARS (t) = vars;
726 BLOCK_SUBBLOCKS (t) = nreverse (subblocks);
727 /* If the BLOCK being cloned is already marked as having been instantiated
728 from something else, then leave that `origin' marking alone. Otherwise,
729 mark the clone as having originated from the BLOCK we are cloning. */
730 if (BLOCK_ABSTRACT_ORIGIN (t) == NULL_TREE)
731 BLOCK_ABSTRACT_ORIGIN (t) = block;
735 /* Copy DECL_RTLs in all decls in the given BLOCK node. */
738 copy_decl_rtls (block)
743 for (t = BLOCK_VARS (block); t; t = TREE_CHAIN (t))
744 if (DECL_RTL (t) && GET_CODE (DECL_RTL (t)) == MEM)
745 DECL_RTL (t) = copy_for_inline (DECL_RTL (t));
747 /* Process all subblocks. */
748 for (t = BLOCK_SUBBLOCKS (block); t; t = TREE_CHAIN (t))
752 /* Make the insns and PARM_DECLs of the current function permanent
753 and record other information in DECL_SAVED_INSNS to allow inlining
754 of this function in subsequent calls.
756 This routine need not copy any insns because we are not going
757 to immediately compile the insns in the insn chain. There
758 are two cases when we would compile the insns for FNDECL:
759 (1) when FNDECL is expanded inline, and (2) when FNDECL needs to
760 be output at the end of other compilation, because somebody took
761 its address. In the first case, the insns of FNDECL are copied
762 as it is expanded inline, so FNDECL's saved insns are not
763 modified. In the second case, FNDECL is used for the last time,
764 so modifying the rtl is not a problem.
766 We don't have to worry about FNDECL being inline expanded by
767 other functions which are written at the end of compilation
768 because flag_no_inline is turned on when we begin writing
769 functions at the end of compilation. */
772 save_for_inline_nocopy (fndecl)
777 rtx first_nonparm_insn;
779 /* Set up PARMDECL_MAP which maps pseudo-reg number to its PARM_DECL.
780 Later we set TREE_READONLY to 0 if the parm is modified inside the fn.
781 Also set up ARG_VECTOR, which holds the unmodified DECL_RTX values
782 for the parms, prior to elimination of virtual registers.
783 These values are needed for substituting parms properly. */
785 max_parm_reg = max_parm_reg_num ();
786 parmdecl_map = (tree *) alloca (max_parm_reg * sizeof (tree));
788 /* Make and emit a return-label if we have not already done so. */
790 if (return_label == 0)
792 return_label = gen_label_rtx ();
793 emit_label (return_label);
796 head = initialize_for_inline (fndecl, get_first_label_num (),
797 max_label_num (), max_reg_num (), 0);
799 /* If there are insns that copy parms from the stack into pseudo registers,
800 those insns are not copied. `expand_inline_function' must
801 emit the correct code to handle such things. */
804 if (GET_CODE (insn) != NOTE)
807 /* Get the insn which signals the end of parameter setup code. */
808 first_nonparm_insn = get_first_nonparm_insn ();
810 /* Now just scan the chain of insns to see what happens to our
811 PARM_DECLs. If a PARM_DECL is used but never modified, we
812 can substitute its rtl directly when expanding inline (and
813 perform constant folding when its incoming value is constant).
814 Otherwise, we have to copy its value into a new register and track
815 the new register's life. */
817 for (insn = NEXT_INSN (insn); insn; insn = NEXT_INSN (insn))
819 if (insn == first_nonparm_insn)
820 in_nonparm_insns = 1;
822 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
824 if (current_function_uses_const_pool)
826 /* Replace any constant pool references with the actual constant.
827 We will put the constant back if we need to write the
828 function out after all. */
829 save_constants (&PATTERN (insn));
830 if (REG_NOTES (insn))
831 save_constants (®_NOTES (insn));
834 /* Record what interesting things happen to our parameters. */
835 note_stores (PATTERN (insn), note_modified_parmregs);
839 /* Also scan all decls, and replace any constant pool references with the
841 save_constants_in_decl_trees (DECL_INITIAL (fndecl));
843 /* We have now allocated all that needs to be allocated permanently
844 on the rtx obstack. Set our high-water mark, so that we
845 can free the rest of this when the time comes. */
849 finish_inline (fndecl, head);
852 /* Given PX, a pointer into an insn, search for references to the constant
853 pool. Replace each with a CONST that has the mode of the original
854 constant, contains the constant, and has RTX_INTEGRATED_P set.
855 Similarly, constant pool addresses not enclosed in a MEM are replaced
856 with an ADDRESS and CONST rtx which also gives the constant, its
857 mode, the mode of the address, and has RTX_INTEGRATED_P set. */
869 /* If this is a CONST_DOUBLE, don't try to fix things up in
870 CONST_DOUBLE_MEM, because this is an infinite recursion. */
871 if (GET_CODE (x) == CONST_DOUBLE)
873 else if (GET_CODE (x) == MEM && GET_CODE (XEXP (x, 0)) == SYMBOL_REF
874 && CONSTANT_POOL_ADDRESS_P (XEXP (x,0)))
876 enum machine_mode const_mode = get_pool_mode (XEXP (x, 0));
877 rtx new = gen_rtx (CONST, const_mode, get_pool_constant (XEXP (x, 0)));
878 RTX_INTEGRATED_P (new) = 1;
880 /* If the MEM was in a different mode than the constant (perhaps we
881 were only looking at the low-order part), surround it with a
882 SUBREG so we can save both modes. */
884 if (GET_MODE (x) != const_mode)
886 new = gen_rtx (SUBREG, GET_MODE (x), new, 0);
887 RTX_INTEGRATED_P (new) = 1;
891 save_constants (&XEXP (*px, 0));
893 else if (GET_CODE (x) == SYMBOL_REF
894 && CONSTANT_POOL_ADDRESS_P (x))
896 *px = gen_rtx (ADDRESS, GET_MODE (x),
897 gen_rtx (CONST, get_pool_mode (x),
898 get_pool_constant (x)));
899 save_constants (&XEXP (*px, 0));
900 RTX_INTEGRATED_P (*px) = 1;
905 char *fmt = GET_RTX_FORMAT (GET_CODE (x));
906 int len = GET_RTX_LENGTH (GET_CODE (x));
908 for (i = len-1; i >= 0; i--)
913 for (j = 0; j < XVECLEN (x, i); j++)
914 save_constants (&XVECEXP (x, i, j));
918 if (XEXP (x, i) == 0)
922 /* Hack tail-recursion here. */
926 save_constants (&XEXP (x, i));
933 /* Note whether a parameter is modified or not. */
936 note_modified_parmregs (reg, x)
940 if (GET_CODE (reg) == REG && in_nonparm_insns
941 && REGNO (reg) < max_parm_reg
942 && REGNO (reg) >= FIRST_PSEUDO_REGISTER
943 && parmdecl_map[REGNO (reg)] != 0)
944 TREE_READONLY (parmdecl_map[REGNO (reg)]) = 0;
947 /* Copy the rtx ORIG recursively, replacing pseudo-regs and labels
948 according to `reg_map' and `label_map'. The original rtl insns
949 will be saved for inlining; this is used to make a copy
950 which is used to finish compiling the inline function itself.
952 If we find a "saved" constant pool entry, one which was replaced with
953 the value of the constant, convert it back to a constant pool entry.
954 Since the pool wasn't touched, this should simply restore the old
957 All other kinds of rtx are copied except those that can never be
958 changed during compilation. */
961 copy_for_inline (orig)
964 register rtx x = orig;
967 register enum rtx_code code;
968 register char *format_ptr;
975 /* These types may be freely shared. */
987 /* We have to make a new CONST_DOUBLE to ensure that we account for
988 it correctly. Using the old CONST_DOUBLE_MEM data is wrong. */
989 if (GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT)
993 REAL_VALUE_FROM_CONST_DOUBLE (d, x);
994 return CONST_DOUBLE_FROM_REAL_VALUE (d, GET_MODE (x));
997 return immed_double_const (CONST_DOUBLE_LOW (x), CONST_DOUBLE_HIGH (x),
1001 /* Get constant pool entry for constant in the pool. */
1002 if (RTX_INTEGRATED_P (x))
1003 return validize_mem (force_const_mem (GET_MODE (x),
1004 copy_for_inline (XEXP (x, 0))));
1008 /* Get constant pool entry, but access in different mode. */
1009 if (RTX_INTEGRATED_P (x))
1011 new = force_const_mem (GET_MODE (SUBREG_REG (x)),
1012 copy_for_inline (XEXP (SUBREG_REG (x), 0)));
1014 PUT_MODE (new, GET_MODE (x));
1015 return validize_mem (new);
1020 /* If not special for constant pool error. Else get constant pool
1022 if (! RTX_INTEGRATED_P (x))
1025 new = force_const_mem (GET_MODE (XEXP (x, 0)),
1026 copy_for_inline (XEXP (XEXP (x, 0), 0)));
1027 new = XEXP (new, 0);
1029 #ifdef POINTERS_EXTEND_UNSIGNED
1030 if (GET_MODE (new) != GET_MODE (x))
1031 new = convert_memory_address (GET_MODE (x), new);
1037 /* If a single asm insn contains multiple output operands
1038 then it contains multiple ASM_OPERANDS rtx's that share operand 3.
1039 We must make sure that the copied insn continues to share it. */
1040 if (orig_asm_operands_vector == XVEC (orig, 3))
1042 x = rtx_alloc (ASM_OPERANDS);
1043 x->volatil = orig->volatil;
1044 XSTR (x, 0) = XSTR (orig, 0);
1045 XSTR (x, 1) = XSTR (orig, 1);
1046 XINT (x, 2) = XINT (orig, 2);
1047 XVEC (x, 3) = copy_asm_operands_vector;
1048 XVEC (x, 4) = copy_asm_constraints_vector;
1049 XSTR (x, 5) = XSTR (orig, 5);
1050 XINT (x, 6) = XINT (orig, 6);
1056 /* A MEM is usually allowed to be shared if its address is constant
1057 or is a constant plus one of the special registers.
1059 We do not allow sharing of addresses that are either a special
1060 register or the sum of a constant and a special register because
1061 it is possible for unshare_all_rtl to copy the address, into memory
1062 that won't be saved. Although the MEM can safely be shared, and
1063 won't be copied there, the address itself cannot be shared, and may
1066 There are also two exceptions with constants: The first is if the
1067 constant is a LABEL_REF or the sum of the LABEL_REF
1068 and an integer. This case can happen if we have an inline
1069 function that supplies a constant operand to the call of another
1070 inline function that uses it in a switch statement. In this case,
1071 we will be replacing the LABEL_REF, so we have to replace this MEM
1074 The second case is if we have a (const (plus (address ..) ...)).
1075 In that case we need to put back the address of the constant pool
1078 if (CONSTANT_ADDRESS_P (XEXP (x, 0))
1079 && GET_CODE (XEXP (x, 0)) != LABEL_REF
1080 && ! (GET_CODE (XEXP (x, 0)) == CONST
1081 && (GET_CODE (XEXP (XEXP (x, 0), 0)) == PLUS
1082 && ((GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 0))
1084 || (GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 0))
1090 /* If this is a non-local label, just make a new LABEL_REF.
1091 Otherwise, use the new label as well. */
1092 x = gen_rtx (LABEL_REF, GET_MODE (orig),
1093 LABEL_REF_NONLOCAL_P (orig) ? XEXP (orig, 0)
1094 : label_map[CODE_LABEL_NUMBER (XEXP (orig, 0))]);
1095 LABEL_REF_NONLOCAL_P (x) = LABEL_REF_NONLOCAL_P (orig);
1096 LABEL_OUTSIDE_LOOP_P (x) = LABEL_OUTSIDE_LOOP_P (orig);
1100 if (REGNO (x) > LAST_VIRTUAL_REGISTER)
1101 return reg_map [REGNO (x)];
1106 /* If a parm that gets modified lives in a pseudo-reg,
1107 clear its TREE_READONLY to prevent certain optimizations. */
1109 rtx dest = SET_DEST (x);
1111 while (GET_CODE (dest) == STRICT_LOW_PART
1112 || GET_CODE (dest) == ZERO_EXTRACT
1113 || GET_CODE (dest) == SUBREG)
1114 dest = XEXP (dest, 0);
1116 if (GET_CODE (dest) == REG
1117 && REGNO (dest) < max_parm_reg
1118 && REGNO (dest) >= FIRST_PSEUDO_REGISTER
1119 && parmdecl_map[REGNO (dest)] != 0
1120 /* The insn to load an arg pseudo from a stack slot
1121 does not count as modifying it. */
1122 && in_nonparm_insns)
1123 TREE_READONLY (parmdecl_map[REGNO (dest)]) = 0;
1127 #if 0 /* This is a good idea, but here is the wrong place for it. */
1128 /* Arrange that CONST_INTs always appear as the second operand
1129 if they appear, and that `frame_pointer_rtx' or `arg_pointer_rtx'
1130 always appear as the first. */
1132 if (GET_CODE (XEXP (x, 0)) == CONST_INT
1133 || (XEXP (x, 1) == frame_pointer_rtx
1134 || (ARG_POINTER_REGNUM != FRAME_POINTER_REGNUM
1135 && XEXP (x, 1) == arg_pointer_rtx)))
1137 rtx t = XEXP (x, 0);
1138 XEXP (x, 0) = XEXP (x, 1);
1145 /* Replace this rtx with a copy of itself. */
1147 x = rtx_alloc (code);
1148 bcopy ((char *) orig, (char *) x,
1149 (sizeof (*x) - sizeof (x->fld)
1150 + sizeof (x->fld[0]) * GET_RTX_LENGTH (code)));
1152 /* Now scan the subexpressions recursively.
1153 We can store any replaced subexpressions directly into X
1154 since we know X is not shared! Any vectors in X
1155 must be copied if X was copied. */
1157 format_ptr = GET_RTX_FORMAT (code);
1159 for (i = 0; i < GET_RTX_LENGTH (code); i++)
1161 switch (*format_ptr++)
1164 XEXP (x, i) = copy_for_inline (XEXP (x, i));
1168 /* Change any references to old-insns to point to the
1169 corresponding copied insns. */
1170 XEXP (x, i) = insn_map[INSN_UID (XEXP (x, i))];
1174 if (XVEC (x, i) != NULL && XVECLEN (x, i) != 0)
1178 XVEC (x, i) = gen_rtvec_vv (XVECLEN (x, i), XVEC (x, i)->elem);
1179 for (j = 0; j < XVECLEN (x, i); j++)
1181 = copy_for_inline (XVECEXP (x, i, j));
1187 if (code == ASM_OPERANDS && orig_asm_operands_vector == 0)
1189 orig_asm_operands_vector = XVEC (orig, 3);
1190 copy_asm_operands_vector = XVEC (x, 3);
1191 copy_asm_constraints_vector = XVEC (x, 4);
1197 /* Unfortunately, we need a global copy of const_equiv map for communication
1198 with a function called from note_stores. Be *very* careful that this
1199 is used properly in the presence of recursion. */
1201 rtx *global_const_equiv_map;
1202 int global_const_equiv_map_size;
1204 #define FIXED_BASE_PLUS_P(X) \
1205 (GET_CODE (X) == PLUS && GET_CODE (XEXP (X, 1)) == CONST_INT \
1206 && GET_CODE (XEXP (X, 0)) == REG \
1207 && REGNO (XEXP (X, 0)) >= FIRST_VIRTUAL_REGISTER \
1208 && REGNO (XEXP (X, 0)) <= LAST_VIRTUAL_REGISTER)
1210 /* Integrate the procedure defined by FNDECL. Note that this function
1211 may wind up calling itself. Since the static variables are not
1212 reentrant, we do not assign them until after the possibility
1213 of recursion is eliminated.
1215 If IGNORE is nonzero, do not produce a value.
1216 Otherwise store the value in TARGET if it is nonzero and that is convenient.
1219 (rtx)-1 if we could not substitute the function
1220 0 if we substituted it and it does not produce a value
1221 else an rtx for where the value is stored. */
1224 expand_inline_function (fndecl, parms, target, ignore, type,
1225 structure_value_addr)
1230 rtx structure_value_addr;
1232 tree formal, actual, block;
1233 rtx header = DECL_SAVED_INSNS (fndecl);
1234 rtx insns = FIRST_FUNCTION_INSN (header);
1235 rtx parm_insns = FIRST_PARM_INSN (header);
1241 int min_labelno = FIRST_LABELNO (header);
1242 int max_labelno = LAST_LABELNO (header);
1244 rtx local_return_label = 0;
1248 struct inline_remap *map;
1250 rtvec arg_vector = ORIGINAL_ARG_VECTOR (header);
1251 rtx static_chain_value = 0;
1253 /* The pointer used to track the true location of the memory used
1254 for MAP->LABEL_MAP. */
1255 rtx *real_label_map = 0;
1257 /* Allow for equivalences of the pseudos we make for virtual fp and ap. */
1258 max_regno = MAX_REGNUM (header) + 3;
1259 if (max_regno < FIRST_PSEUDO_REGISTER)
1262 nargs = list_length (DECL_ARGUMENTS (fndecl));
1264 /* Check that the parms type match and that sufficient arguments were
1265 passed. Since the appropriate conversions or default promotions have
1266 already been applied, the machine modes should match exactly. */
1268 for (formal = DECL_ARGUMENTS (fndecl), actual = parms;
1270 formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual))
1273 enum machine_mode mode;
1276 return (rtx) (HOST_WIDE_INT) -1;
1278 arg = TREE_VALUE (actual);
1279 mode = TYPE_MODE (DECL_ARG_TYPE (formal));
1281 if (mode != TYPE_MODE (TREE_TYPE (arg))
1282 /* If they are block mode, the types should match exactly.
1283 They don't match exactly if TREE_TYPE (FORMAL) == ERROR_MARK_NODE,
1284 which could happen if the parameter has incomplete type. */
1286 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg))
1287 != TYPE_MAIN_VARIANT (TREE_TYPE (formal)))))
1288 return (rtx) (HOST_WIDE_INT) -1;
1291 /* Extra arguments are valid, but will be ignored below, so we must
1292 evaluate them here for side-effects. */
1293 for (; actual; actual = TREE_CHAIN (actual))
1294 expand_expr (TREE_VALUE (actual), const0_rtx,
1295 TYPE_MODE (TREE_TYPE (TREE_VALUE (actual))), 0);
1297 /* Make a binding contour to keep inline cleanups called at
1298 outer function-scope level from looking like they are shadowing
1299 parameter declarations. */
1302 /* Expand the function arguments. Do this first so that any
1303 new registers get created before we allocate the maps. */
1305 arg_vals = (rtx *) alloca (nargs * sizeof (rtx));
1306 arg_trees = (tree *) alloca (nargs * sizeof (tree));
1308 for (formal = DECL_ARGUMENTS (fndecl), actual = parms, i = 0;
1310 formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual), i++)
1312 /* Actual parameter, converted to the type of the argument within the
1314 tree arg = convert (TREE_TYPE (formal), TREE_VALUE (actual));
1315 /* Mode of the variable used within the function. */
1316 enum machine_mode mode = TYPE_MODE (TREE_TYPE (formal));
1320 loc = RTVEC_ELT (arg_vector, i);
1322 /* If this is an object passed by invisible reference, we copy the
1323 object into a stack slot and save its address. If this will go
1324 into memory, we do nothing now. Otherwise, we just expand the
1326 if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG
1327 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)
1330 = assign_stack_temp (TYPE_MODE (TREE_TYPE (arg)),
1331 int_size_in_bytes (TREE_TYPE (arg)), 1);
1332 MEM_IN_STRUCT_P (stack_slot) = AGGREGATE_TYPE_P (TREE_TYPE (arg));
1334 store_expr (arg, stack_slot, 0);
1336 arg_vals[i] = XEXP (stack_slot, 0);
1339 else if (GET_CODE (loc) != MEM)
1341 if (GET_MODE (loc) != TYPE_MODE (TREE_TYPE (arg)))
1342 /* The mode if LOC and ARG can differ if LOC was a variable
1343 that had its mode promoted via PROMOTED_MODE. */
1344 arg_vals[i] = convert_modes (GET_MODE (loc),
1345 TYPE_MODE (TREE_TYPE (arg)),
1346 expand_expr (arg, NULL_RTX, mode,
1348 TREE_UNSIGNED (TREE_TYPE (formal)));
1350 arg_vals[i] = expand_expr (arg, NULL_RTX, mode, EXPAND_SUM);
1355 if (arg_vals[i] != 0
1356 && (! TREE_READONLY (formal)
1357 /* If the parameter is not read-only, copy our argument through
1358 a register. Also, we cannot use ARG_VALS[I] if it overlaps
1359 TARGET in any way. In the inline function, they will likely
1360 be two different pseudos, and `safe_from_p' will make all
1361 sorts of smart assumptions about their not conflicting.
1362 But if ARG_VALS[I] overlaps TARGET, these assumptions are
1363 wrong, so put ARG_VALS[I] into a fresh register.
1364 Don't worry about invisible references, since their stack
1365 temps will never overlap the target. */
1368 && (GET_CODE (arg_vals[i]) == REG
1369 || GET_CODE (arg_vals[i]) == SUBREG
1370 || GET_CODE (arg_vals[i]) == MEM)
1371 && reg_overlap_mentioned_p (arg_vals[i], target))
1372 /* ??? We must always copy a SUBREG into a REG, because it might
1373 get substituted into an address, and not all ports correctly
1374 handle SUBREGs in addresses. */
1375 || (GET_CODE (arg_vals[i]) == SUBREG)))
1376 arg_vals[i] = copy_to_mode_reg (GET_MODE (loc), arg_vals[i]);
1378 if (arg_vals[i] != 0 && GET_CODE (arg_vals[i]) == REG
1379 && TREE_CODE (TREE_TYPE (formal)) == POINTER_TYPE)
1380 mark_reg_pointer (arg_vals[i],
1381 (TYPE_ALIGN (TREE_TYPE (TREE_TYPE (formal)))
1385 /* Allocate the structures we use to remap things. */
1387 map = (struct inline_remap *) alloca (sizeof (struct inline_remap));
1388 map->fndecl = fndecl;
1390 map->reg_map = (rtx *) alloca (max_regno * sizeof (rtx));
1391 bzero ((char *) map->reg_map, max_regno * sizeof (rtx));
1393 /* We used to use alloca here, but the size of what it would try to
1394 allocate would occasionally cause it to exceed the stack limit and
1395 cause unpredictable core dumps. */
1397 = (rtx *) xmalloc ((max_labelno - min_labelno) * sizeof (rtx));
1398 map->label_map = real_label_map - min_labelno;
1400 map->insn_map = (rtx *) alloca (INSN_UID (header) * sizeof (rtx));
1401 bzero ((char *) map->insn_map, INSN_UID (header) * sizeof (rtx));
1402 map->min_insnno = 0;
1403 map->max_insnno = INSN_UID (header);
1405 map->integrating = 1;
1407 /* const_equiv_map maps pseudos in our routine to constants, so it needs to
1408 be large enough for all our pseudos. This is the number we are currently
1409 using plus the number in the called routine, plus 15 for each arg,
1410 five to compute the virtual frame pointer, and five for the return value.
1411 This should be enough for most cases. We do not reference entries
1412 outside the range of the map.
1414 ??? These numbers are quite arbitrary and were obtained by
1415 experimentation. At some point, we should try to allocate the
1416 table after all the parameters are set up so we an more accurately
1417 estimate the number of pseudos we will need. */
1419 map->const_equiv_map_size
1420 = max_reg_num () + (max_regno - FIRST_PSEUDO_REGISTER) + 15 * nargs + 10;
1422 map->const_equiv_map
1423 = (rtx *)alloca (map->const_equiv_map_size * sizeof (rtx));
1424 bzero ((char *) map->const_equiv_map,
1425 map->const_equiv_map_size * sizeof (rtx));
1428 = (unsigned *)alloca (map->const_equiv_map_size * sizeof (unsigned));
1429 bzero ((char *) map->const_age_map,
1430 map->const_equiv_map_size * sizeof (unsigned));
1433 /* Record the current insn in case we have to set up pointers to frame
1434 and argument memory blocks. If there are no insns yet, add a dummy
1435 insn that can be used as an insertion point. */
1436 map->insns_at_start = get_last_insn ();
1437 if (!map->insns_at_start)
1438 map->insns_at_start = emit_note (NULL_PTR, NOTE_INSN_DELETED);
1440 map->regno_pointer_flag = INLINE_REGNO_POINTER_FLAG (header);
1441 map->regno_pointer_align = INLINE_REGNO_POINTER_ALIGN (header);
1443 /* Update the outgoing argument size to allow for those in the inlined
1445 if (OUTGOING_ARGS_SIZE (header) > current_function_outgoing_args_size)
1446 current_function_outgoing_args_size = OUTGOING_ARGS_SIZE (header);
1448 /* If the inline function needs to make PIC references, that means
1449 that this function's PIC offset table must be used. */
1450 if (FUNCTION_FLAGS (header) & FUNCTION_FLAGS_USES_PIC_OFFSET_TABLE)
1451 current_function_uses_pic_offset_table = 1;
1453 /* If this function needs a context, set it up. */
1454 if (FUNCTION_FLAGS (header) & FUNCTION_FLAGS_NEEDS_CONTEXT)
1455 static_chain_value = lookup_static_chain (fndecl);
1457 if (GET_CODE (parm_insns) == NOTE
1458 && NOTE_LINE_NUMBER (parm_insns) > 0)
1460 rtx note = emit_note (NOTE_SOURCE_FILE (parm_insns),
1461 NOTE_LINE_NUMBER (parm_insns));
1463 RTX_INTEGRATED_P (note) = 1;
1466 /* Process each argument. For each, set up things so that the function's
1467 reference to the argument will refer to the argument being passed.
1468 We only replace REG with REG here. Any simplifications are done
1469 via const_equiv_map.
1471 We make two passes: In the first, we deal with parameters that will
1472 be placed into registers, since we need to ensure that the allocated
1473 register number fits in const_equiv_map. Then we store all non-register
1474 parameters into their memory location. */
1476 /* Don't try to free temp stack slots here, because we may put one of the
1477 parameters into a temp stack slot. */
1479 for (i = 0; i < nargs; i++)
1481 rtx copy = arg_vals[i];
1483 loc = RTVEC_ELT (arg_vector, i);
1485 /* There are three cases, each handled separately. */
1486 if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG
1487 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)
1489 /* This must be an object passed by invisible reference (it could
1490 also be a variable-sized object, but we forbid inlining functions
1491 with variable-sized arguments). COPY is the address of the
1492 actual value (this computation will cause it to be copied). We
1493 map that address for the register, noting the actual address as
1494 an equivalent in case it can be substituted into the insns. */
1496 if (GET_CODE (copy) != REG)
1498 temp = copy_addr_to_reg (copy);
1499 if ((CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy))
1500 && REGNO (temp) < map->const_equiv_map_size)
1502 map->const_equiv_map[REGNO (temp)] = copy;
1503 map->const_age_map[REGNO (temp)] = CONST_AGE_PARM;
1507 map->reg_map[REGNO (XEXP (loc, 0))] = copy;
1509 else if (GET_CODE (loc) == MEM)
1511 /* This is the case of a parameter that lives in memory.
1512 It will live in the block we allocate in the called routine's
1513 frame that simulates the incoming argument area. Do nothing
1514 now; we will call store_expr later. */
1517 else if (GET_CODE (loc) == REG)
1519 /* This is the good case where the parameter is in a register.
1520 If it is read-only and our argument is a constant, set up the
1521 constant equivalence.
1523 If LOC is REG_USERVAR_P, the usual case, COPY must also have
1524 that flag set if it is a register.
1526 Also, don't allow hard registers here; they might not be valid
1527 when substituted into insns. */
1529 if ((GET_CODE (copy) != REG && GET_CODE (copy) != SUBREG)
1530 || (GET_CODE (copy) == REG && REG_USERVAR_P (loc)
1531 && ! REG_USERVAR_P (copy))
1532 || (GET_CODE (copy) == REG
1533 && REGNO (copy) < FIRST_PSEUDO_REGISTER))
1535 temp = copy_to_mode_reg (GET_MODE (loc), copy);
1536 REG_USERVAR_P (temp) = REG_USERVAR_P (loc);
1537 if ((CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy))
1538 && REGNO (temp) < map->const_equiv_map_size)
1540 map->const_equiv_map[REGNO (temp)] = copy;
1541 map->const_age_map[REGNO (temp)] = CONST_AGE_PARM;
1545 map->reg_map[REGNO (loc)] = copy;
1547 else if (GET_CODE (loc) == CONCAT)
1549 /* This is the good case where the parameter is in a
1550 pair of separate pseudos.
1551 If it is read-only and our argument is a constant, set up the
1552 constant equivalence.
1554 If LOC is REG_USERVAR_P, the usual case, COPY must also have
1555 that flag set if it is a register.
1557 Also, don't allow hard registers here; they might not be valid
1558 when substituted into insns. */
1559 rtx locreal = gen_realpart (GET_MODE (XEXP (loc, 0)), loc);
1560 rtx locimag = gen_imagpart (GET_MODE (XEXP (loc, 0)), loc);
1561 rtx copyreal = gen_realpart (GET_MODE (locreal), copy);
1562 rtx copyimag = gen_imagpart (GET_MODE (locimag), copy);
1564 if ((GET_CODE (copyreal) != REG && GET_CODE (copyreal) != SUBREG)
1565 || (GET_CODE (copyreal) == REG && REG_USERVAR_P (locreal)
1566 && ! REG_USERVAR_P (copyreal))
1567 || (GET_CODE (copyreal) == REG
1568 && REGNO (copyreal) < FIRST_PSEUDO_REGISTER))
1570 temp = copy_to_mode_reg (GET_MODE (locreal), copyreal);
1571 REG_USERVAR_P (temp) = REG_USERVAR_P (locreal);
1572 if ((CONSTANT_P (copyreal) || FIXED_BASE_PLUS_P (copyreal))
1573 && REGNO (temp) < map->const_equiv_map_size)
1575 map->const_equiv_map[REGNO (temp)] = copyreal;
1576 map->const_age_map[REGNO (temp)] = CONST_AGE_PARM;
1580 map->reg_map[REGNO (locreal)] = copyreal;
1582 if ((GET_CODE (copyimag) != REG && GET_CODE (copyimag) != SUBREG)
1583 || (GET_CODE (copyimag) == REG && REG_USERVAR_P (locimag)
1584 && ! REG_USERVAR_P (copyimag))
1585 || (GET_CODE (copyimag) == REG
1586 && REGNO (copyimag) < FIRST_PSEUDO_REGISTER))
1588 temp = copy_to_mode_reg (GET_MODE (locimag), copyimag);
1589 REG_USERVAR_P (temp) = REG_USERVAR_P (locimag);
1590 if ((CONSTANT_P (copyimag) || FIXED_BASE_PLUS_P (copyimag))
1591 && REGNO (temp) < map->const_equiv_map_size)
1593 map->const_equiv_map[REGNO (temp)] = copyimag;
1594 map->const_age_map[REGNO (temp)] = CONST_AGE_PARM;
1598 map->reg_map[REGNO (locimag)] = copyimag;
1604 /* Now do the parameters that will be placed in memory. */
1606 for (formal = DECL_ARGUMENTS (fndecl), i = 0;
1607 formal; formal = TREE_CHAIN (formal), i++)
1609 loc = RTVEC_ELT (arg_vector, i);
1611 if (GET_CODE (loc) == MEM
1612 /* Exclude case handled above. */
1613 && ! (GET_CODE (XEXP (loc, 0)) == REG
1614 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER))
1616 rtx note = emit_note (DECL_SOURCE_FILE (formal),
1617 DECL_SOURCE_LINE (formal));
1619 RTX_INTEGRATED_P (note) = 1;
1621 /* Compute the address in the area we reserved and store the
1623 temp = copy_rtx_and_substitute (loc, map);
1624 subst_constants (&temp, NULL_RTX, map);
1625 apply_change_group ();
1626 if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0)))
1627 temp = change_address (temp, VOIDmode, XEXP (temp, 0));
1628 store_expr (arg_trees[i], temp, 0);
1632 /* Deal with the places that the function puts its result.
1633 We are driven by what is placed into DECL_RESULT.
1635 Initially, we assume that we don't have anything special handling for
1636 REG_FUNCTION_RETURN_VALUE_P. */
1638 map->inline_target = 0;
1639 loc = DECL_RTL (DECL_RESULT (fndecl));
1640 if (TYPE_MODE (type) == VOIDmode)
1641 /* There is no return value to worry about. */
1643 else if (GET_CODE (loc) == MEM)
1645 if (! structure_value_addr || ! aggregate_value_p (DECL_RESULT (fndecl)))
1648 /* Pass the function the address in which to return a structure value.
1649 Note that a constructor can cause someone to call us with
1650 STRUCTURE_VALUE_ADDR, but the initialization takes place
1651 via the first parameter, rather than the struct return address.
1653 We have two cases: If the address is a simple register indirect,
1654 use the mapping mechanism to point that register to our structure
1655 return address. Otherwise, store the structure return value into
1656 the place that it will be referenced from. */
1658 if (GET_CODE (XEXP (loc, 0)) == REG)
1660 temp = force_reg (Pmode,
1661 force_operand (structure_value_addr, NULL_RTX));
1662 map->reg_map[REGNO (XEXP (loc, 0))] = temp;
1663 if ((CONSTANT_P (structure_value_addr)
1664 || (GET_CODE (structure_value_addr) == PLUS
1665 && XEXP (structure_value_addr, 0) == virtual_stack_vars_rtx
1666 && GET_CODE (XEXP (structure_value_addr, 1)) == CONST_INT))
1667 && REGNO (temp) < map->const_equiv_map_size)
1669 map->const_equiv_map[REGNO (temp)] = structure_value_addr;
1670 map->const_age_map[REGNO (temp)] = CONST_AGE_PARM;
1675 temp = copy_rtx_and_substitute (loc, map);
1676 subst_constants (&temp, NULL_RTX, map);
1677 apply_change_group ();
1678 emit_move_insn (temp, structure_value_addr);
1682 /* We will ignore the result value, so don't look at its structure.
1683 Note that preparations for an aggregate return value
1684 do need to be made (above) even if it will be ignored. */
1686 else if (GET_CODE (loc) == REG)
1688 /* The function returns an object in a register and we use the return
1689 value. Set up our target for remapping. */
1691 /* Machine mode function was declared to return. */
1692 enum machine_mode departing_mode = TYPE_MODE (type);
1693 /* (Possibly wider) machine mode it actually computes
1694 (for the sake of callers that fail to declare it right).
1695 We have to use the mode of the result's RTL, rather than
1696 its type, since expand_function_start may have promoted it. */
1697 enum machine_mode arriving_mode
1698 = GET_MODE (DECL_RTL (DECL_RESULT (fndecl)));
1701 /* Don't use MEMs as direct targets because on some machines
1702 substituting a MEM for a REG makes invalid insns.
1703 Let the combiner substitute the MEM if that is valid. */
1704 if (target == 0 || GET_CODE (target) != REG
1705 || GET_MODE (target) != departing_mode)
1706 target = gen_reg_rtx (departing_mode);
1708 /* If function's value was promoted before return,
1709 avoid machine mode mismatch when we substitute INLINE_TARGET.
1710 But TARGET is what we will return to the caller. */
1711 if (arriving_mode != departing_mode)
1713 /* Avoid creating a paradoxical subreg wider than
1714 BITS_PER_WORD, since that is illegal. */
1715 if (GET_MODE_BITSIZE (arriving_mode) > BITS_PER_WORD)
1717 if (!TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (departing_mode),
1718 GET_MODE_BITSIZE (arriving_mode)))
1719 /* Maybe could be handled by using convert_move () ? */
1721 reg_to_map = gen_reg_rtx (arriving_mode);
1722 target = gen_lowpart (departing_mode, reg_to_map);
1725 reg_to_map = gen_rtx (SUBREG, arriving_mode, target, 0);
1728 reg_to_map = target;
1730 /* Usually, the result value is the machine's return register.
1731 Sometimes it may be a pseudo. Handle both cases. */
1732 if (REG_FUNCTION_VALUE_P (loc))
1733 map->inline_target = reg_to_map;
1735 map->reg_map[REGNO (loc)] = reg_to_map;
1740 /* Make a fresh binding contour that we can easily remove. Do this after
1741 expanding our arguments so cleanups are properly scoped. */
1743 expand_start_bindings (0);
1745 /* Make new label equivalences for the labels in the called function. */
1746 for (i = min_labelno; i < max_labelno; i++)
1747 map->label_map[i] = gen_label_rtx ();
1749 /* Perform postincrements before actually calling the function. */
1752 /* Clean up stack so that variables might have smaller offsets. */
1753 do_pending_stack_adjust ();
1755 /* Save a copy of the location of const_equiv_map for mark_stores, called
1757 global_const_equiv_map = map->const_equiv_map;
1758 global_const_equiv_map_size = map->const_equiv_map_size;
1760 /* If the called function does an alloca, save and restore the
1761 stack pointer around the call. This saves stack space, but
1762 also is required if this inline is being done between two
1764 if (FUNCTION_FLAGS (header) & FUNCTION_FLAGS_CALLS_ALLOCA)
1765 emit_stack_save (SAVE_BLOCK, &stack_save, NULL_RTX);
1767 /* Now copy the insns one by one. Do this in two passes, first the insns and
1768 then their REG_NOTES, just like save_for_inline. */
1770 /* This loop is very similar to the loop in copy_loop_body in unroll.c. */
1772 for (insn = insns; insn; insn = NEXT_INSN (insn))
1774 rtx copy, pattern, set;
1776 map->orig_asm_operands_vector = 0;
1778 switch (GET_CODE (insn))
1781 pattern = PATTERN (insn);
1782 set = single_set (insn);
1784 if (GET_CODE (pattern) == USE
1785 && GET_CODE (XEXP (pattern, 0)) == REG
1786 && REG_FUNCTION_VALUE_P (XEXP (pattern, 0)))
1787 /* The (USE (REG n)) at return from the function should
1788 be ignored since we are changing (REG n) into
1792 /* Ignore setting a function value that we don't want to use. */
1793 if (map->inline_target == 0
1795 && GET_CODE (SET_DEST (set)) == REG
1796 && REG_FUNCTION_VALUE_P (SET_DEST (set)))
1798 if (volatile_refs_p (SET_SRC (set)))
1802 /* If we must not delete the source,
1803 load it into a new temporary. */
1804 copy = emit_insn (copy_rtx_and_substitute (pattern, map));
1806 new_set = single_set (copy);
1811 = gen_reg_rtx (GET_MODE (SET_DEST (new_set)));
1813 /* If the source and destination are the same and it
1814 has a note on it, keep the insn. */
1815 else if (rtx_equal_p (SET_DEST (set), SET_SRC (set))
1816 && REG_NOTES (insn) != 0)
1817 copy = emit_insn (copy_rtx_and_substitute (pattern, map));
1822 /* If this is setting the static chain rtx, omit it. */
1823 else if (static_chain_value != 0
1825 && GET_CODE (SET_DEST (set)) == REG
1826 && rtx_equal_p (SET_DEST (set),
1827 static_chain_incoming_rtx))
1830 /* If this is setting the static chain pseudo, set it from
1831 the value we want to give it instead. */
1832 else if (static_chain_value != 0
1834 && rtx_equal_p (SET_SRC (set),
1835 static_chain_incoming_rtx))
1837 rtx newdest = copy_rtx_and_substitute (SET_DEST (set), map);
1839 copy = emit_move_insn (newdest, static_chain_value);
1840 static_chain_value = 0;
1843 copy = emit_insn (copy_rtx_and_substitute (pattern, map));
1844 /* REG_NOTES will be copied later. */
1847 /* If this insn is setting CC0, it may need to look at
1848 the insn that uses CC0 to see what type of insn it is.
1849 In that case, the call to recog via validate_change will
1850 fail. So don't substitute constants here. Instead,
1851 do it when we emit the following insn.
1853 For example, see the pyr.md file. That machine has signed and
1854 unsigned compares. The compare patterns must check the
1855 following branch insn to see which what kind of compare to
1858 If the previous insn set CC0, substitute constants on it as
1860 if (sets_cc0_p (PATTERN (copy)) != 0)
1865 try_constants (cc0_insn, map);
1867 try_constants (copy, map);
1870 try_constants (copy, map);
1875 if (GET_CODE (PATTERN (insn)) == RETURN
1876 || (GET_CODE (PATTERN (insn)) == PARALLEL
1877 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == RETURN))
1879 if (local_return_label == 0)
1880 local_return_label = gen_label_rtx ();
1881 pattern = gen_jump (local_return_label);
1884 pattern = copy_rtx_and_substitute (PATTERN (insn), map);
1886 copy = emit_jump_insn (pattern);
1890 try_constants (cc0_insn, map);
1893 try_constants (copy, map);
1895 /* If this used to be a conditional jump insn but whose branch
1896 direction is now know, we must do something special. */
1897 if (condjump_p (insn) && ! simplejump_p (insn) && map->last_pc_value)
1900 /* The previous insn set cc0 for us. So delete it. */
1901 delete_insn (PREV_INSN (copy));
1904 /* If this is now a no-op, delete it. */
1905 if (map->last_pc_value == pc_rtx)
1911 /* Otherwise, this is unconditional jump so we must put a
1912 BARRIER after it. We could do some dead code elimination
1913 here, but jump.c will do it just as well. */
1919 pattern = copy_rtx_and_substitute (PATTERN (insn), map);
1920 copy = emit_call_insn (pattern);
1922 /* Because the USAGE information potentially contains objects other
1923 than hard registers, we need to copy it. */
1924 CALL_INSN_FUNCTION_USAGE (copy)
1925 = copy_rtx_and_substitute (CALL_INSN_FUNCTION_USAGE (insn), map);
1929 try_constants (cc0_insn, map);
1932 try_constants (copy, map);
1934 /* Be lazy and assume CALL_INSNs clobber all hard registers. */
1935 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1936 map->const_equiv_map[i] = 0;
1940 copy = emit_label (map->label_map[CODE_LABEL_NUMBER (insn)]);
1941 LABEL_NAME (copy) = LABEL_NAME (insn);
1946 copy = emit_barrier ();
1950 /* It is important to discard function-end and function-beg notes,
1951 so we have only one of each in the current function.
1952 Also, NOTE_INSN_DELETED notes aren't useful (save_for_inline
1953 deleted these in the copy used for continuing compilation,
1954 not the copy used for inlining). */
1955 if (NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_END
1956 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_BEG
1957 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_DELETED)
1959 copy = emit_note (NOTE_SOURCE_FILE (insn), NOTE_LINE_NUMBER (insn));
1960 if (copy && (NOTE_LINE_NUMBER (copy) == NOTE_INSN_EH_REGION_BEG
1961 || NOTE_LINE_NUMBER (copy) == NOTE_INSN_EH_REGION_END))
1963 rtx label = map->label_map[NOTE_BLOCK_NUMBER (copy)];
1965 /* We have to forward these both to match the new exception
1967 NOTE_BLOCK_NUMBER (copy) = CODE_LABEL_NUMBER (label);
1980 RTX_INTEGRATED_P (copy) = 1;
1982 map->insn_map[INSN_UID (insn)] = copy;
1985 /* Now copy the REG_NOTES. Increment const_age, so that only constants
1986 from parameters can be substituted in. These are the only ones that
1987 are valid across the entire function. */
1989 for (insn = insns; insn; insn = NEXT_INSN (insn))
1990 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i'
1991 && map->insn_map[INSN_UID (insn)]
1992 && REG_NOTES (insn))
1994 rtx tem = copy_rtx_and_substitute (REG_NOTES (insn), map);
1995 /* We must also do subst_constants, in case one of our parameters
1996 has const type and constant value. */
1997 subst_constants (&tem, NULL_RTX, map);
1998 apply_change_group ();
1999 REG_NOTES (map->insn_map[INSN_UID (insn)]) = tem;
2002 if (local_return_label)
2003 emit_label (local_return_label);
2005 /* Restore the stack pointer if we saved it above. */
2006 if (FUNCTION_FLAGS (header) & FUNCTION_FLAGS_CALLS_ALLOCA)
2007 emit_stack_restore (SAVE_BLOCK, stack_save, NULL_RTX);
2009 /* Make copies of the decls of the symbols in the inline function, so that
2010 the copies of the variables get declared in the current function. Set
2011 up things so that lookup_static_chain knows that to interpret registers
2012 in SAVE_EXPRs for TYPE_SIZEs as local. */
2014 inline_function_decl = fndecl;
2015 integrate_parm_decls (DECL_ARGUMENTS (fndecl), map, arg_vector);
2016 integrate_decl_tree ((tree) ORIGINAL_DECL_INITIAL (header), 0, map);
2017 inline_function_decl = 0;
2019 /* End the scope containing the copied formal parameter variables
2020 and copied LABEL_DECLs. */
2022 expand_end_bindings (getdecls (), 1, 1);
2023 block = poplevel (1, 1, 0);
2024 BLOCK_ABSTRACT_ORIGIN (block) = (DECL_ABSTRACT_ORIGIN (fndecl) == NULL
2025 ? fndecl : DECL_ABSTRACT_ORIGIN (fndecl));
2028 /* Must mark the line number note after inlined functions as a repeat, so
2029 that the test coverage code can avoid counting the call twice. This
2030 just tells the code to ignore the immediately following line note, since
2031 there already exists a copy of this note before the expanded inline call.
2032 This line number note is still needed for debugging though, so we can't
2034 if (flag_test_coverage)
2035 emit_note (0, NOTE_REPEATED_LINE_NUMBER);
2037 emit_line_note (input_filename, lineno);
2039 if (structure_value_addr)
2041 target = gen_rtx (MEM, TYPE_MODE (type),
2042 memory_address (TYPE_MODE (type), structure_value_addr));
2043 MEM_IN_STRUCT_P (target) = 1;
2046 /* Make sure we free the things we explicitly allocated with xmalloc. */
2048 free (real_label_map);
2053 /* Given a chain of PARM_DECLs, ARGS, copy each decl into a VAR_DECL,
2054 push all of those decls and give each one the corresponding home. */
2057 integrate_parm_decls (args, map, arg_vector)
2059 struct inline_remap *map;
2065 for (tail = args, i = 0; tail; tail = TREE_CHAIN (tail), i++)
2067 register tree decl = build_decl (VAR_DECL, DECL_NAME (tail),
2070 = copy_rtx_and_substitute (RTVEC_ELT (arg_vector, i), map);
2072 DECL_ARG_TYPE (decl) = DECL_ARG_TYPE (tail);
2073 /* We really should be setting DECL_INCOMING_RTL to something reasonable
2074 here, but that's going to require some more work. */
2075 /* DECL_INCOMING_RTL (decl) = ?; */
2076 /* These args would always appear unused, if not for this. */
2077 TREE_USED (decl) = 1;
2078 /* Prevent warning for shadowing with these. */
2079 DECL_ABSTRACT_ORIGIN (decl) = tail;
2081 /* Fully instantiate the address with the equivalent form so that the
2082 debugging information contains the actual register, instead of the
2083 virtual register. Do this by not passing an insn to
2085 subst_constants (&new_decl_rtl, NULL_RTX, map);
2086 apply_change_group ();
2087 DECL_RTL (decl) = new_decl_rtl;
2091 /* Given a BLOCK node LET, push decls and levels so as to construct in the
2092 current function a tree of contexts isomorphic to the one that is given.
2094 LEVEL indicates how far down into the BLOCK tree is the node we are
2095 currently traversing. It is always zero except for recursive calls.
2097 MAP, if nonzero, is a pointer to an inline_remap map which indicates how
2098 registers used in the DECL_RTL field should be remapped. If it is zero,
2099 no mapping is necessary. */
2102 integrate_decl_tree (let, level, map)
2105 struct inline_remap *map;
2112 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
2116 push_obstacks_nochange ();
2117 saveable_allocation ();
2121 if (DECL_RTL (t) != 0)
2123 DECL_RTL (d) = copy_rtx_and_substitute (DECL_RTL (t), map);
2124 /* Fully instantiate the address with the equivalent form so that the
2125 debugging information contains the actual register, instead of the
2126 virtual register. Do this by not passing an insn to
2128 subst_constants (&DECL_RTL (d), NULL_RTX, map);
2129 apply_change_group ();
2131 /* These args would always appear unused, if not for this. */
2133 /* Prevent warning for shadowing with these. */
2134 DECL_ABSTRACT_ORIGIN (d) = t;
2136 if (DECL_LANG_SPECIFIC (d))
2142 for (t = BLOCK_SUBBLOCKS (let); t; t = TREE_CHAIN (t))
2143 integrate_decl_tree (t, level + 1, map);
2147 node = poplevel (1, 0, 0);
2150 TREE_USED (node) = TREE_USED (let);
2151 BLOCK_ABSTRACT_ORIGIN (node) = let;
2156 /* Given a BLOCK node LET, search for all DECL_RTL fields, and pass them
2157 through save_constants. */
2160 save_constants_in_decl_trees (let)
2165 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
2166 if (DECL_RTL (t) != 0)
2167 save_constants (&DECL_RTL (t));
2169 for (t = BLOCK_SUBBLOCKS (let); t; t = TREE_CHAIN (t))
2170 save_constants_in_decl_trees (t);
2173 /* Create a new copy of an rtx.
2174 Recursively copies the operands of the rtx,
2175 except for those few rtx codes that are sharable.
2177 We always return an rtx that is similar to that incoming rtx, with the
2178 exception of possibly changing a REG to a SUBREG or vice versa. No
2179 rtl is ever emitted.
2181 Handle constants that need to be placed in the constant pool by
2182 calling `force_const_mem'. */
2185 copy_rtx_and_substitute (orig, map)
2187 struct inline_remap *map;
2189 register rtx copy, temp;
2191 register RTX_CODE code;
2192 register enum machine_mode mode;
2193 register char *format_ptr;
2199 code = GET_CODE (orig);
2200 mode = GET_MODE (orig);
2205 /* If the stack pointer register shows up, it must be part of
2206 stack-adjustments (*not* because we eliminated the frame pointer!).
2207 Small hard registers are returned as-is. Pseudo-registers
2208 go through their `reg_map'. */
2209 regno = REGNO (orig);
2210 if (regno <= LAST_VIRTUAL_REGISTER)
2212 /* Some hard registers are also mapped,
2213 but others are not translated. */
2214 if (map->reg_map[regno] != 0)
2215 return map->reg_map[regno];
2217 /* If this is the virtual frame pointer, make space in current
2218 function's stack frame for the stack frame of the inline function.
2220 Copy the address of this area into a pseudo. Map
2221 virtual_stack_vars_rtx to this pseudo and set up a constant
2222 equivalence for it to be the address. This will substitute the
2223 address into insns where it can be substituted and use the new
2224 pseudo where it can't. */
2225 if (regno == VIRTUAL_STACK_VARS_REGNUM)
2228 int size = DECL_FRAME_SIZE (map->fndecl);
2230 #ifdef FRAME_GROWS_DOWNWARD
2231 /* In this case, virtual_stack_vars_rtx points to one byte
2232 higher than the top of the frame area. So make sure we
2233 allocate a big enough chunk to keep the frame pointer
2234 aligned like a real one. */
2235 size = CEIL_ROUND (size, BIGGEST_ALIGNMENT / BITS_PER_UNIT);
2238 loc = assign_stack_temp (BLKmode, size, 1);
2239 loc = XEXP (loc, 0);
2240 #ifdef FRAME_GROWS_DOWNWARD
2241 /* In this case, virtual_stack_vars_rtx points to one byte
2242 higher than the top of the frame area. So compute the offset
2243 to one byte higher than our substitute frame. */
2244 loc = plus_constant (loc, size);
2246 map->reg_map[regno] = temp
2247 = force_reg (Pmode, force_operand (loc, NULL_RTX));
2249 #ifdef STACK_BOUNDARY
2250 mark_reg_pointer (map->reg_map[regno],
2251 STACK_BOUNDARY / BITS_PER_UNIT);
2254 if (REGNO (temp) < map->const_equiv_map_size)
2256 map->const_equiv_map[REGNO (temp)] = loc;
2257 map->const_age_map[REGNO (temp)] = CONST_AGE_PARM;
2260 seq = gen_sequence ();
2262 emit_insn_after (seq, map->insns_at_start);
2265 else if (regno == VIRTUAL_INCOMING_ARGS_REGNUM)
2267 /* Do the same for a block to contain any arguments referenced
2270 int size = FUNCTION_ARGS_SIZE (DECL_SAVED_INSNS (map->fndecl));
2273 loc = assign_stack_temp (BLKmode, size, 1);
2274 loc = XEXP (loc, 0);
2275 /* When arguments grow downward, the virtual incoming
2276 args pointer points to the top of the argument block,
2277 so the remapped location better do the same. */
2278 #ifdef ARGS_GROW_DOWNWARD
2279 loc = plus_constant (loc, size);
2281 map->reg_map[regno] = temp
2282 = force_reg (Pmode, force_operand (loc, NULL_RTX));
2284 #ifdef STACK_BOUNDARY
2285 mark_reg_pointer (map->reg_map[regno],
2286 STACK_BOUNDARY / BITS_PER_UNIT);
2289 if (REGNO (temp) < map->const_equiv_map_size)
2291 map->const_equiv_map[REGNO (temp)] = loc;
2292 map->const_age_map[REGNO (temp)] = CONST_AGE_PARM;
2295 seq = gen_sequence ();
2297 emit_insn_after (seq, map->insns_at_start);
2300 else if (REG_FUNCTION_VALUE_P (orig))
2302 /* This is a reference to the function return value. If
2303 the function doesn't have a return value, error. If the
2304 mode doesn't agree, make a SUBREG. */
2305 if (map->inline_target == 0)
2306 /* Must be unrolling loops or replicating code if we
2307 reach here, so return the register unchanged. */
2309 else if (mode != GET_MODE (map->inline_target))
2310 return gen_lowpart (mode, map->inline_target);
2312 return map->inline_target;
2316 if (map->reg_map[regno] == NULL)
2318 map->reg_map[regno] = gen_reg_rtx (mode);
2319 REG_USERVAR_P (map->reg_map[regno]) = REG_USERVAR_P (orig);
2320 REG_LOOP_TEST_P (map->reg_map[regno]) = REG_LOOP_TEST_P (orig);
2321 RTX_UNCHANGING_P (map->reg_map[regno]) = RTX_UNCHANGING_P (orig);
2322 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
2324 if (map->regno_pointer_flag[regno])
2325 mark_reg_pointer (map->reg_map[regno],
2326 map->regno_pointer_align[regno]);
2328 return map->reg_map[regno];
2331 copy = copy_rtx_and_substitute (SUBREG_REG (orig), map);
2332 /* SUBREG is ordinary, but don't make nested SUBREGs. */
2333 if (GET_CODE (copy) == SUBREG)
2334 return gen_rtx (SUBREG, GET_MODE (orig), SUBREG_REG (copy),
2335 SUBREG_WORD (orig) + SUBREG_WORD (copy));
2336 else if (GET_CODE (copy) == CONCAT)
2337 return (subreg_realpart_p (orig) ? XEXP (copy, 0) : XEXP (copy, 1));
2339 return gen_rtx (SUBREG, GET_MODE (orig), copy,
2340 SUBREG_WORD (orig));
2344 /* USE and CLOBBER are ordinary, but we convert (use (subreg foo))
2345 to (use foo) if the original insn didn't have a subreg.
2346 Removing the subreg distorts the VAX movstrhi pattern
2347 by changing the mode of an operand. */
2348 copy = copy_rtx_and_substitute (XEXP (orig, 0), map);
2349 if (GET_CODE (copy) == SUBREG && GET_CODE (XEXP (orig, 0)) != SUBREG)
2350 copy = SUBREG_REG (copy);
2351 return gen_rtx (code, VOIDmode, copy);
2354 LABEL_PRESERVE_P (map->label_map[CODE_LABEL_NUMBER (orig)])
2355 = LABEL_PRESERVE_P (orig);
2356 return map->label_map[CODE_LABEL_NUMBER (orig)];
2359 copy = gen_rtx (LABEL_REF, mode,
2360 LABEL_REF_NONLOCAL_P (orig) ? XEXP (orig, 0)
2361 : map->label_map[CODE_LABEL_NUMBER (XEXP (orig, 0))]);
2362 LABEL_OUTSIDE_LOOP_P (copy) = LABEL_OUTSIDE_LOOP_P (orig);
2364 /* The fact that this label was previously nonlocal does not mean
2365 it still is, so we must check if it is within the range of
2366 this function's labels. */
2367 LABEL_REF_NONLOCAL_P (copy)
2368 = (LABEL_REF_NONLOCAL_P (orig)
2369 && ! (CODE_LABEL_NUMBER (XEXP (copy, 0)) >= get_first_label_num ()
2370 && CODE_LABEL_NUMBER (XEXP (copy, 0)) < max_label_num ()));
2372 /* If we have made a nonlocal label local, it means that this
2373 inlined call will be referring to our nonlocal goto handler.
2374 So make sure we create one for this block; we normally would
2375 not since this is not otherwise considered a "call". */
2376 if (LABEL_REF_NONLOCAL_P (orig) && ! LABEL_REF_NONLOCAL_P (copy))
2377 function_call_count++;
2387 /* Symbols which represent the address of a label stored in the constant
2388 pool must be modified to point to a constant pool entry for the
2389 remapped label. Otherwise, symbols are returned unchanged. */
2390 if (CONSTANT_POOL_ADDRESS_P (orig))
2392 rtx constant = get_pool_constant (orig);
2393 if (GET_CODE (constant) == LABEL_REF)
2394 return XEXP (force_const_mem (GET_MODE (orig),
2395 copy_rtx_and_substitute (constant,
2403 /* We have to make a new copy of this CONST_DOUBLE because don't want
2404 to use the old value of CONST_DOUBLE_MEM. Also, this may be a
2405 duplicate of a CONST_DOUBLE we have already seen. */
2406 if (GET_MODE_CLASS (GET_MODE (orig)) == MODE_FLOAT)
2410 REAL_VALUE_FROM_CONST_DOUBLE (d, orig);
2411 return CONST_DOUBLE_FROM_REAL_VALUE (d, GET_MODE (orig));
2414 return immed_double_const (CONST_DOUBLE_LOW (orig),
2415 CONST_DOUBLE_HIGH (orig), VOIDmode);
2418 /* Make new constant pool entry for a constant
2419 that was in the pool of the inline function. */
2420 if (RTX_INTEGRATED_P (orig))
2422 /* If this was an address of a constant pool entry that itself
2423 had to be placed in the constant pool, it might not be a
2424 valid address. So the recursive call below might turn it
2425 into a register. In that case, it isn't a constant any
2426 more, so return it. This has the potential of changing a
2427 MEM into a REG, but we'll assume that it safe. */
2428 temp = copy_rtx_and_substitute (XEXP (orig, 0), map);
2429 if (! CONSTANT_P (temp))
2431 return validize_mem (force_const_mem (GET_MODE (orig), temp));
2436 /* If from constant pool address, make new constant pool entry and
2437 return its address. */
2438 if (! RTX_INTEGRATED_P (orig))
2442 = force_const_mem (GET_MODE (XEXP (orig, 0)),
2443 copy_rtx_and_substitute (XEXP (XEXP (orig, 0), 0),
2447 /* Legitimizing the address here is incorrect.
2449 The only ADDRESS rtx's that can reach here are ones created by
2450 save_constants. Hence the operand of the ADDRESS is always valid
2451 in this position of the instruction, since the original rtx without
2452 the ADDRESS was valid.
2454 The reason we don't legitimize the address here is that on the
2455 Sparc, the caller may have a (high ...) surrounding this ADDRESS.
2456 This code forces the operand of the address to a register, which
2457 fails because we can not take the HIGH part of a register.
2459 Also, change_address may create new registers. These registers
2460 will not have valid reg_map entries. This can cause try_constants()
2461 to fail because assumes that all registers in the rtx have valid
2462 reg_map entries, and it may end up replacing one of these new
2463 registers with junk. */
2465 if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0)))
2466 temp = change_address (temp, GET_MODE (temp), XEXP (temp, 0));
2469 temp = XEXP (temp, 0);
2471 #ifdef POINTERS_EXTEND_UNSIGNED
2472 if (GET_MODE (temp) != GET_MODE (orig))
2473 temp = convert_memory_address (GET_MODE (orig), temp);
2479 /* If a single asm insn contains multiple output operands
2480 then it contains multiple ASM_OPERANDS rtx's that share operand 3.
2481 We must make sure that the copied insn continues to share it. */
2482 if (map->orig_asm_operands_vector == XVEC (orig, 3))
2484 copy = rtx_alloc (ASM_OPERANDS);
2485 copy->volatil = orig->volatil;
2486 XSTR (copy, 0) = XSTR (orig, 0);
2487 XSTR (copy, 1) = XSTR (orig, 1);
2488 XINT (copy, 2) = XINT (orig, 2);
2489 XVEC (copy, 3) = map->copy_asm_operands_vector;
2490 XVEC (copy, 4) = map->copy_asm_constraints_vector;
2491 XSTR (copy, 5) = XSTR (orig, 5);
2492 XINT (copy, 6) = XINT (orig, 6);
2498 /* This is given special treatment because the first
2499 operand of a CALL is a (MEM ...) which may get
2500 forced into a register for cse. This is undesirable
2501 if function-address cse isn't wanted or if we won't do cse. */
2502 #ifndef NO_FUNCTION_CSE
2503 if (! (optimize && ! flag_no_function_cse))
2505 return gen_rtx (CALL, GET_MODE (orig),
2506 gen_rtx (MEM, GET_MODE (XEXP (orig, 0)),
2507 copy_rtx_and_substitute (XEXP (XEXP (orig, 0), 0), map)),
2508 copy_rtx_and_substitute (XEXP (orig, 1), map));
2512 /* Must be ifdefed out for loop unrolling to work. */
2518 /* If this is setting fp or ap, it means that we have a nonlocal goto.
2520 If the nonlocal goto is into the current function,
2521 this will result in unnecessarily bad code, but should work. */
2522 if (SET_DEST (orig) == virtual_stack_vars_rtx
2523 || SET_DEST (orig) == virtual_incoming_args_rtx)
2524 return gen_rtx (SET, VOIDmode, SET_DEST (orig),
2525 copy_rtx_and_substitute (SET_SRC (orig), map));
2529 copy = rtx_alloc (MEM);
2530 PUT_MODE (copy, mode);
2531 XEXP (copy, 0) = copy_rtx_and_substitute (XEXP (orig, 0), map);
2532 MEM_IN_STRUCT_P (copy) = MEM_IN_STRUCT_P (orig);
2533 MEM_VOLATILE_P (copy) = MEM_VOLATILE_P (orig);
2535 /* If doing function inlining, this MEM might not be const in the
2536 function that it is being inlined into, and thus may not be
2537 unchanging after function inlining. Constant pool references are
2538 handled elsewhere, so this doesn't lose RTX_UNCHANGING_P bits
2540 if (! map->integrating)
2541 RTX_UNCHANGING_P (copy) = RTX_UNCHANGING_P (orig);
2546 copy = rtx_alloc (code);
2547 PUT_MODE (copy, mode);
2548 copy->in_struct = orig->in_struct;
2549 copy->volatil = orig->volatil;
2550 copy->unchanging = orig->unchanging;
2552 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
2554 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
2556 switch (*format_ptr++)
2562 XEXP (copy, i) = copy_rtx_and_substitute (XEXP (orig, i), map);
2566 /* Change any references to old-insns to point to the
2567 corresponding copied insns. */
2568 XEXP (copy, i) = map->insn_map[INSN_UID (XEXP (orig, i))];
2572 XVEC (copy, i) = XVEC (orig, i);
2573 if (XVEC (orig, i) != NULL && XVECLEN (orig, i) != 0)
2575 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
2576 for (j = 0; j < XVECLEN (copy, i); j++)
2577 XVECEXP (copy, i, j)
2578 = copy_rtx_and_substitute (XVECEXP (orig, i, j), map);
2583 XWINT (copy, i) = XWINT (orig, i);
2587 XINT (copy, i) = XINT (orig, i);
2591 XSTR (copy, i) = XSTR (orig, i);
2599 if (code == ASM_OPERANDS && map->orig_asm_operands_vector == 0)
2601 map->orig_asm_operands_vector = XVEC (orig, 3);
2602 map->copy_asm_operands_vector = XVEC (copy, 3);
2603 map->copy_asm_constraints_vector = XVEC (copy, 4);
2609 /* Substitute known constant values into INSN, if that is valid. */
2612 try_constants (insn, map)
2614 struct inline_remap *map;
2619 subst_constants (&PATTERN (insn), insn, map);
2621 /* Apply the changes if they are valid; otherwise discard them. */
2622 apply_change_group ();
2624 /* Show we don't know the value of anything stored or clobbered. */
2625 note_stores (PATTERN (insn), mark_stores);
2626 map->last_pc_value = 0;
2628 map->last_cc0_value = 0;
2631 /* Set up any constant equivalences made in this insn. */
2632 for (i = 0; i < map->num_sets; i++)
2634 if (GET_CODE (map->equiv_sets[i].dest) == REG)
2636 int regno = REGNO (map->equiv_sets[i].dest);
2638 if (regno < map->const_equiv_map_size
2639 && (map->const_equiv_map[regno] == 0
2640 /* Following clause is a hack to make case work where GNU C++
2641 reassigns a variable to make cse work right. */
2642 || ! rtx_equal_p (map->const_equiv_map[regno],
2643 map->equiv_sets[i].equiv)))
2645 map->const_equiv_map[regno] = map->equiv_sets[i].equiv;
2646 map->const_age_map[regno] = map->const_age;
2649 else if (map->equiv_sets[i].dest == pc_rtx)
2650 map->last_pc_value = map->equiv_sets[i].equiv;
2652 else if (map->equiv_sets[i].dest == cc0_rtx)
2653 map->last_cc0_value = map->equiv_sets[i].equiv;
2658 /* Substitute known constants for pseudo regs in the contents of LOC,
2659 which are part of INSN.
2660 If INSN is zero, the substitution should always be done (this is used to
2662 These changes are taken out by try_constants if the result is not valid.
2664 Note that we are more concerned with determining when the result of a SET
2665 is a constant, for further propagation, than actually inserting constants
2666 into insns; cse will do the latter task better.
2668 This function is also used to adjust address of items previously addressed
2669 via the virtual stack variable or virtual incoming arguments registers. */
2672 subst_constants (loc, insn, map)
2675 struct inline_remap *map;
2679 register enum rtx_code code;
2680 register char *format_ptr;
2681 int num_changes = num_validated_changes ();
2683 enum machine_mode op0_mode;
2685 code = GET_CODE (x);
2700 validate_change (insn, loc, map->last_cc0_value, 1);
2706 /* The only thing we can do with a USE or CLOBBER is possibly do
2707 some substitutions in a MEM within it. */
2708 if (GET_CODE (XEXP (x, 0)) == MEM)
2709 subst_constants (&XEXP (XEXP (x, 0), 0), insn, map);
2713 /* Substitute for parms and known constants. Don't replace
2714 hard regs used as user variables with constants. */
2716 int regno = REGNO (x);
2718 if (! (regno < FIRST_PSEUDO_REGISTER && REG_USERVAR_P (x))
2719 && regno < map->const_equiv_map_size
2720 && map->const_equiv_map[regno] != 0
2721 && map->const_age_map[regno] >= map->const_age)
2722 validate_change (insn, loc, map->const_equiv_map[regno], 1);
2727 /* SUBREG applied to something other than a reg
2728 should be treated as ordinary, since that must
2729 be a special hack and we don't know how to treat it specially.
2730 Consider for example mulsidi3 in m68k.md.
2731 Ordinary SUBREG of a REG needs this special treatment. */
2732 if (GET_CODE (SUBREG_REG (x)) == REG)
2734 rtx inner = SUBREG_REG (x);
2737 /* We can't call subst_constants on &SUBREG_REG (x) because any
2738 constant or SUBREG wouldn't be valid inside our SUBEG. Instead,
2739 see what is inside, try to form the new SUBREG and see if that is
2740 valid. We handle two cases: extracting a full word in an
2741 integral mode and extracting the low part. */
2742 subst_constants (&inner, NULL_RTX, map);
2744 if (GET_MODE_CLASS (GET_MODE (x)) == MODE_INT
2745 && GET_MODE_SIZE (GET_MODE (x)) == UNITS_PER_WORD
2746 && GET_MODE (SUBREG_REG (x)) != VOIDmode)
2747 new = operand_subword (inner, SUBREG_WORD (x), 0,
2748 GET_MODE (SUBREG_REG (x)));
2750 cancel_changes (num_changes);
2751 if (new == 0 && subreg_lowpart_p (x))
2752 new = gen_lowpart_common (GET_MODE (x), inner);
2755 validate_change (insn, loc, new, 1);
2762 subst_constants (&XEXP (x, 0), insn, map);
2764 /* If a memory address got spoiled, change it back. */
2765 if (insn != 0 && num_validated_changes () != num_changes
2766 && !memory_address_p (GET_MODE (x), XEXP (x, 0)))
2767 cancel_changes (num_changes);
2772 /* Substitute constants in our source, and in any arguments to a
2773 complex (e..g, ZERO_EXTRACT) destination, but not in the destination
2775 rtx *dest_loc = &SET_DEST (x);
2776 rtx dest = *dest_loc;
2779 subst_constants (&SET_SRC (x), insn, map);
2782 while (GET_CODE (*dest_loc) == ZERO_EXTRACT
2783 || GET_CODE (*dest_loc) == SUBREG
2784 || GET_CODE (*dest_loc) == STRICT_LOW_PART)
2786 if (GET_CODE (*dest_loc) == ZERO_EXTRACT)
2788 subst_constants (&XEXP (*dest_loc, 1), insn, map);
2789 subst_constants (&XEXP (*dest_loc, 2), insn, map);
2791 dest_loc = &XEXP (*dest_loc, 0);
2794 /* Do substitute in the address of a destination in memory. */
2795 if (GET_CODE (*dest_loc) == MEM)
2796 subst_constants (&XEXP (*dest_loc, 0), insn, map);
2798 /* Check for the case of DEST a SUBREG, both it and the underlying
2799 register are less than one word, and the SUBREG has the wider mode.
2800 In the case, we are really setting the underlying register to the
2801 source converted to the mode of DEST. So indicate that. */
2802 if (GET_CODE (dest) == SUBREG
2803 && GET_MODE_SIZE (GET_MODE (dest)) <= UNITS_PER_WORD
2804 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest))) <= UNITS_PER_WORD
2805 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest)))
2806 <= GET_MODE_SIZE (GET_MODE (dest)))
2807 && (tem = gen_lowpart_if_possible (GET_MODE (SUBREG_REG (dest)),
2809 src = tem, dest = SUBREG_REG (dest);
2811 /* If storing a recognizable value save it for later recording. */
2812 if ((map->num_sets < MAX_RECOG_OPERANDS)
2813 && (CONSTANT_P (src)
2814 || (GET_CODE (src) == REG
2815 && (REGNO (src) == VIRTUAL_INCOMING_ARGS_REGNUM
2816 || REGNO (src) == VIRTUAL_STACK_VARS_REGNUM))
2817 || (GET_CODE (src) == PLUS
2818 && GET_CODE (XEXP (src, 0)) == REG
2819 && (REGNO (XEXP (src, 0)) == VIRTUAL_INCOMING_ARGS_REGNUM
2820 || REGNO (XEXP (src, 0)) == VIRTUAL_STACK_VARS_REGNUM)
2821 && CONSTANT_P (XEXP (src, 1)))
2822 || GET_CODE (src) == COMPARE
2827 && (src == pc_rtx || GET_CODE (src) == RETURN
2828 || GET_CODE (src) == LABEL_REF))))
2830 /* Normally, this copy won't do anything. But, if SRC is a COMPARE
2831 it will cause us to save the COMPARE with any constants
2832 substituted, which is what we want for later. */
2833 map->equiv_sets[map->num_sets].equiv = copy_rtx (src);
2834 map->equiv_sets[map->num_sets++].dest = dest;
2841 format_ptr = GET_RTX_FORMAT (code);
2843 /* If the first operand is an expression, save its mode for later. */
2844 if (*format_ptr == 'e')
2845 op0_mode = GET_MODE (XEXP (x, 0));
2847 for (i = 0; i < GET_RTX_LENGTH (code); i++)
2849 switch (*format_ptr++)
2856 subst_constants (&XEXP (x, i), insn, map);
2866 if (XVEC (x, i) != NULL && XVECLEN (x, i) != 0)
2869 for (j = 0; j < XVECLEN (x, i); j++)
2870 subst_constants (&XVECEXP (x, i, j), insn, map);
2879 /* If this is a commutative operation, move a constant to the second
2880 operand unless the second operand is already a CONST_INT. */
2881 if ((GET_RTX_CLASS (code) == 'c' || code == NE || code == EQ)
2882 && CONSTANT_P (XEXP (x, 0)) && GET_CODE (XEXP (x, 1)) != CONST_INT)
2884 rtx tem = XEXP (x, 0);
2885 validate_change (insn, &XEXP (x, 0), XEXP (x, 1), 1);
2886 validate_change (insn, &XEXP (x, 1), tem, 1);
2889 /* Simplify the expression in case we put in some constants. */
2890 switch (GET_RTX_CLASS (code))
2893 new = simplify_unary_operation (code, GET_MODE (x),
2894 XEXP (x, 0), op0_mode);
2899 enum machine_mode op_mode = GET_MODE (XEXP (x, 0));
2900 if (op_mode == VOIDmode)
2901 op_mode = GET_MODE (XEXP (x, 1));
2902 new = simplify_relational_operation (code, op_mode,
2903 XEXP (x, 0), XEXP (x, 1));
2904 #ifdef FLOAT_STORE_FLAG_VALUE
2905 if (new != 0 && GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT)
2906 new = ((new == const0_rtx) ? CONST0_RTX (GET_MODE (x))
2907 : CONST_DOUBLE_FROM_REAL_VALUE (FLOAT_STORE_FLAG_VALUE,
2915 new = simplify_binary_operation (code, GET_MODE (x),
2916 XEXP (x, 0), XEXP (x, 1));
2921 new = simplify_ternary_operation (code, GET_MODE (x), op0_mode,
2922 XEXP (x, 0), XEXP (x, 1), XEXP (x, 2));
2927 validate_change (insn, loc, new, 1);
2930 /* Show that register modified no longer contain known constants. We are
2931 called from note_stores with parts of the new insn. */
2934 mark_stores (dest, x)
2939 enum machine_mode mode;
2941 /* DEST is always the innermost thing set, except in the case of
2942 SUBREGs of hard registers. */
2944 if (GET_CODE (dest) == REG)
2945 regno = REGNO (dest), mode = GET_MODE (dest);
2946 else if (GET_CODE (dest) == SUBREG && GET_CODE (SUBREG_REG (dest)) == REG)
2948 regno = REGNO (SUBREG_REG (dest)) + SUBREG_WORD (dest);
2949 mode = GET_MODE (SUBREG_REG (dest));
2954 int last_reg = (regno >= FIRST_PSEUDO_REGISTER ? regno
2955 : regno + HARD_REGNO_NREGS (regno, mode) - 1);
2958 for (i = regno; i <= last_reg; i++)
2959 if (i < global_const_equiv_map_size)
2960 global_const_equiv_map[i] = 0;
2964 /* If any CONST expressions with RTX_INTEGRATED_P are present in the rtx
2965 pointed to by PX, they represent constants in the constant pool.
2966 Replace these with a new memory reference obtained from force_const_mem.
2967 Similarly, ADDRESS expressions with RTX_INTEGRATED_P represent the
2968 address of a constant pool entry. Replace them with the address of
2969 a new constant pool entry obtained from force_const_mem. */
2972 restore_constants (px)
2982 if (GET_CODE (x) == CONST_DOUBLE)
2984 /* We have to make a new CONST_DOUBLE to ensure that we account for
2985 it correctly. Using the old CONST_DOUBLE_MEM data is wrong. */
2986 if (GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT)
2990 REAL_VALUE_FROM_CONST_DOUBLE (d, x);
2991 *px = CONST_DOUBLE_FROM_REAL_VALUE (d, GET_MODE (x));
2994 *px = immed_double_const (CONST_DOUBLE_LOW (x), CONST_DOUBLE_HIGH (x),
2998 else if (RTX_INTEGRATED_P (x) && GET_CODE (x) == CONST)
3000 restore_constants (&XEXP (x, 0));
3001 *px = validize_mem (force_const_mem (GET_MODE (x), XEXP (x, 0)));
3003 else if (RTX_INTEGRATED_P (x) && GET_CODE (x) == SUBREG)
3005 /* This must be (subreg/i:M1 (const/i:M2 ...) 0). */
3006 rtx new = XEXP (SUBREG_REG (x), 0);
3008 restore_constants (&new);
3009 new = force_const_mem (GET_MODE (SUBREG_REG (x)), new);
3010 PUT_MODE (new, GET_MODE (x));
3011 *px = validize_mem (new);
3013 else if (RTX_INTEGRATED_P (x) && GET_CODE (x) == ADDRESS)
3015 rtx new = XEXP (force_const_mem (GET_MODE (XEXP (x, 0)),
3016 XEXP (XEXP (x, 0), 0)),
3019 #ifdef POINTERS_EXTEND_UNSIGNED
3020 if (GET_MODE (new) != GET_MODE (x))
3021 new = convert_memory_address (GET_MODE (x), new);
3028 fmt = GET_RTX_FORMAT (GET_CODE (x));
3029 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (x)); i++)
3034 for (j = 0; j < XVECLEN (x, i); j++)
3035 restore_constants (&XVECEXP (x, i, j));
3039 restore_constants (&XEXP (x, i));
3046 /* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the
3047 given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so
3048 that it points to the node itself, thus indicating that the node is its
3049 own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for
3050 the given node is NULL, recursively descend the decl/block tree which
3051 it is the root of, and for each other ..._DECL or BLOCK node contained
3052 therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also
3053 still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN
3054 values to point to themselves. */
3057 set_block_origin_self (stmt)
3060 if (BLOCK_ABSTRACT_ORIGIN (stmt) == NULL_TREE)
3062 BLOCK_ABSTRACT_ORIGIN (stmt) = stmt;
3065 register tree local_decl;
3067 for (local_decl = BLOCK_VARS (stmt);
3068 local_decl != NULL_TREE;
3069 local_decl = TREE_CHAIN (local_decl))
3070 set_decl_origin_self (local_decl); /* Potential recursion. */
3074 register tree subblock;
3076 for (subblock = BLOCK_SUBBLOCKS (stmt);
3077 subblock != NULL_TREE;
3078 subblock = BLOCK_CHAIN (subblock))
3079 set_block_origin_self (subblock); /* Recurse. */
3084 /* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for
3085 the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the
3086 node to so that it points to the node itself, thus indicating that the
3087 node represents its own (abstract) origin. Additionally, if the
3088 DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend
3089 the decl/block tree of which the given node is the root of, and for
3090 each other ..._DECL or BLOCK node contained therein whose
3091 DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL,
3092 set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to
3093 point to themselves. */
3096 set_decl_origin_self (decl)
3099 if (DECL_ABSTRACT_ORIGIN (decl) == NULL_TREE)
3101 DECL_ABSTRACT_ORIGIN (decl) = decl;
3102 if (TREE_CODE (decl) == FUNCTION_DECL)
3106 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
3107 DECL_ABSTRACT_ORIGIN (arg) = arg;
3108 if (DECL_INITIAL (decl) != NULL_TREE
3109 && DECL_INITIAL (decl) != error_mark_node)
3110 set_block_origin_self (DECL_INITIAL (decl));
3115 /* Given a pointer to some BLOCK node, and a boolean value to set the
3116 "abstract" flags to, set that value into the BLOCK_ABSTRACT flag for
3117 the given block, and for all local decls and all local sub-blocks
3118 (recursively) which are contained therein. */
3121 set_block_abstract_flags (stmt, setting)
3123 register int setting;
3125 register tree local_decl;
3126 register tree subblock;
3128 BLOCK_ABSTRACT (stmt) = setting;
3130 for (local_decl = BLOCK_VARS (stmt);
3131 local_decl != NULL_TREE;
3132 local_decl = TREE_CHAIN (local_decl))
3133 set_decl_abstract_flags (local_decl, setting);
3135 for (subblock = BLOCK_SUBBLOCKS (stmt);
3136 subblock != NULL_TREE;
3137 subblock = BLOCK_CHAIN (subblock))
3138 set_block_abstract_flags (subblock, setting);
3141 /* Given a pointer to some ..._DECL node, and a boolean value to set the
3142 "abstract" flags to, set that value into the DECL_ABSTRACT flag for the
3143 given decl, and (in the case where the decl is a FUNCTION_DECL) also
3144 set the abstract flags for all of the parameters, local vars, local
3145 blocks and sub-blocks (recursively) to the same setting. */
3148 set_decl_abstract_flags (decl, setting)
3150 register int setting;
3152 DECL_ABSTRACT (decl) = setting;
3153 if (TREE_CODE (decl) == FUNCTION_DECL)
3157 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
3158 DECL_ABSTRACT (arg) = setting;
3159 if (DECL_INITIAL (decl) != NULL_TREE
3160 && DECL_INITIAL (decl) != error_mark_node)
3161 set_block_abstract_flags (DECL_INITIAL (decl), setting);
3165 /* Output the assembly language code for the function FNDECL
3166 from its DECL_SAVED_INSNS. Used for inline functions that are output
3167 at end of compilation instead of where they came in the source. */
3170 output_inline_function (fndecl)
3175 int save_flag_no_inline = flag_no_inline;
3177 if (output_bytecode)
3179 warning ("`inline' ignored for bytecode output");
3183 /* Things we allocate from here on are part of this function, not
3185 temporary_allocation ();
3187 head = DECL_SAVED_INSNS (fndecl);
3188 current_function_decl = fndecl;
3190 /* This call is only used to initialize global variables. */
3191 init_function_start (fndecl, "lossage", 1);
3193 /* Redo parameter determinations in case the FUNCTION_...
3194 macros took machine-specific actions that need to be redone. */
3195 assign_parms (fndecl, 1);
3197 /* Set stack frame size. */
3198 assign_stack_local (BLKmode, DECL_FRAME_SIZE (fndecl), 0);
3200 /* The first is a bit of a lie (the array may be larger), but doesn't
3201 matter too much and it isn't worth saving the actual bound. */
3202 reg_rtx_no = regno_pointer_flag_length = MAX_REGNUM (head);
3203 regno_reg_rtx = (rtx *) INLINE_REGNO_REG_RTX (head);
3204 regno_pointer_flag = INLINE_REGNO_POINTER_FLAG (head);
3205 regno_pointer_align = INLINE_REGNO_POINTER_ALIGN (head);
3207 stack_slot_list = STACK_SLOT_LIST (head);
3208 forced_labels = FORCED_LABELS (head);
3210 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_CALLS_ALLOCA)
3211 current_function_calls_alloca = 1;
3213 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_CALLS_SETJMP)
3214 current_function_calls_setjmp = 1;
3216 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_CALLS_LONGJMP)
3217 current_function_calls_longjmp = 1;
3219 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_RETURNS_STRUCT)
3220 current_function_returns_struct = 1;
3222 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_RETURNS_PCC_STRUCT)
3223 current_function_returns_pcc_struct = 1;
3225 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_NEEDS_CONTEXT)
3226 current_function_needs_context = 1;
3228 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_HAS_NONLOCAL_LABEL)
3229 current_function_has_nonlocal_label = 1;
3231 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_RETURNS_POINTER)
3232 current_function_returns_pointer = 1;
3234 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_USES_CONST_POOL)
3235 current_function_uses_const_pool = 1;
3237 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_USES_PIC_OFFSET_TABLE)
3238 current_function_uses_pic_offset_table = 1;
3240 current_function_outgoing_args_size = OUTGOING_ARGS_SIZE (head);
3241 current_function_pops_args = POPS_ARGS (head);
3243 /* This is the only thing the expand_function_end call that uses to be here
3244 actually does and that call can cause problems. */
3245 immediate_size_expand--;
3247 /* Find last insn and rebuild the constant pool. */
3248 for (last = FIRST_PARM_INSN (head);
3249 NEXT_INSN (last); last = NEXT_INSN (last))
3251 if (GET_RTX_CLASS (GET_CODE (last)) == 'i')
3253 restore_constants (&PATTERN (last));
3254 restore_constants (®_NOTES (last));
3258 set_new_first_and_last_insn (FIRST_PARM_INSN (head), last);
3259 set_new_first_and_last_label_num (FIRST_LABELNO (head), LAST_LABELNO (head));
3261 /* We must have already output DWARF debugging information for the
3262 original (abstract) inline function declaration/definition, so
3263 we want to make sure that the debugging information we generate
3264 for this special instance of the inline function refers back to
3265 the information we already generated. To make sure that happens,
3266 we simply have to set the DECL_ABSTRACT_ORIGIN for the function
3267 node (and for all of the local ..._DECL nodes which are its children)
3268 so that they all point to themselves. */
3270 set_decl_origin_self (fndecl);
3272 /* We're not deferring this any longer. */
3273 DECL_DEFER_OUTPUT (fndecl) = 0;
3275 /* Integrating function calls isn't safe anymore, so turn on
3279 /* Compile this function all the way down to assembly code. */
3280 rest_of_compilation (fndecl);
3282 /* Reset flag_no_inline to its original value. */
3283 flag_no_inline = save_flag_no_inline;
3285 current_function_decl = 0;