1 /* Procedure integration for GNU CC.
2 Copyright (C) 1988, 91, 93, 94, 95, 1996 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"
40 #define obstack_chunk_alloc xmalloc
41 #define obstack_chunk_free free
43 extern struct obstack *function_maybepermanent_obstack;
45 extern tree pushdecl ();
46 extern tree poplevel ();
48 /* Similar, but round to the next highest integer that meets the
50 #define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
52 /* Default max number of insns a function can have and still be inline.
53 This is overridden on RISC machines. */
54 #ifndef INTEGRATE_THRESHOLD
55 #define INTEGRATE_THRESHOLD(DECL) \
56 (8 * (8 + list_length (DECL_ARGUMENTS (DECL))))
59 static rtx initialize_for_inline PROTO((tree, int, int, int, int));
60 static void finish_inline PROTO((tree, rtx));
61 static void adjust_copied_decl_tree PROTO((tree));
62 static tree copy_decl_list PROTO((tree));
63 static tree copy_decl_tree PROTO((tree));
64 static void copy_decl_rtls PROTO((tree));
65 static void save_constants PROTO((rtx *));
66 static void note_modified_parmregs PROTO((rtx, rtx));
67 static rtx copy_for_inline PROTO((rtx));
68 static void integrate_parm_decls PROTO((tree, struct inline_remap *, rtvec));
69 static void integrate_decl_tree PROTO((tree, int, struct inline_remap *));
70 static void save_constants_in_decl_trees PROTO ((tree));
71 static void subst_constants PROTO((rtx *, rtx, struct inline_remap *));
72 static void restore_constants PROTO((rtx *));
73 static void set_block_origin_self PROTO((tree));
74 static void set_decl_origin_self PROTO((tree));
75 static void set_block_abstract_flags PROTO((tree, int));
77 void set_decl_abstract_flags PROTO((tree, int));
79 /* Zero if the current function (whose FUNCTION_DECL is FNDECL)
80 is safe and reasonable to integrate into other functions.
81 Nonzero means value is a warning message with a single %s
82 for the function's name. */
85 function_cannot_inline_p (fndecl)
89 tree last = tree_last (TYPE_ARG_TYPES (TREE_TYPE (fndecl)));
90 int max_insns = INTEGRATE_THRESHOLD (fndecl);
91 register int ninsns = 0;
94 /* No inlines with varargs. `grokdeclarator' gives a warning
95 message about that if `inline' is specified. This code
96 it put in to catch the volunteers. */
97 if ((last && TREE_VALUE (last) != void_type_node)
98 || current_function_varargs)
99 return "varargs function cannot be inline";
101 if (current_function_calls_alloca)
102 return "function using alloca cannot be inline";
104 if (current_function_contains_functions)
105 return "function with nested functions cannot be inline";
107 /* If its not even close, don't even look. */
108 if (!DECL_INLINE (fndecl) && get_max_uid () > 3 * max_insns)
109 return "function too large to be inline";
112 /* Don't inline functions which do not specify a function prototype and
113 have BLKmode argument or take the address of a parameter. */
114 for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms))
116 if (TYPE_MODE (TREE_TYPE (parms)) == BLKmode)
117 TREE_ADDRESSABLE (parms) = 1;
118 if (last == NULL_TREE && TREE_ADDRESSABLE (parms))
119 return "no prototype, and parameter address used; cannot be inline";
123 /* We can't inline functions that return structures
124 the old-fashioned PCC way, copying into a static block. */
125 if (current_function_returns_pcc_struct)
126 return "inline functions not supported for this return value type";
128 /* We can't inline functions that return BLKmode structures in registers. */
129 if (TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl))) == BLKmode
130 && ! aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl))))
131 return "inline functions not supported for this return value type";
133 /* We can't inline functions that return structures of varying size. */
134 if (int_size_in_bytes (TREE_TYPE (TREE_TYPE (fndecl))) < 0)
135 return "function with varying-size return value cannot be inline";
137 /* Cannot inline a function with a varying size argument or one that
138 receives a transparent union. */
139 for (parms = DECL_ARGUMENTS (fndecl); parms; parms = TREE_CHAIN (parms))
141 if (int_size_in_bytes (TREE_TYPE (parms)) < 0)
142 return "function with varying-size parameter cannot be inline";
143 else if (TYPE_TRANSPARENT_UNION (TREE_TYPE (parms)))
144 return "function with transparent unit parameter cannot be inline";
147 if (!DECL_INLINE (fndecl) && get_max_uid () > max_insns)
149 for (ninsns = 0, insn = get_first_nonparm_insn ();
150 insn && ninsns < max_insns;
151 insn = NEXT_INSN (insn))
152 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
155 if (ninsns >= max_insns)
156 return "function too large to be inline";
159 /* We cannot inline this function if forced_labels is non-zero. This
160 implies that a label in this function was used as an initializer.
161 Because labels can not be duplicated, all labels in the function
162 will be renamed when it is inlined. However, there is no way to find
163 and fix all variables initialized with addresses of labels in this
164 function, hence inlining is impossible. */
167 return "function with label addresses used in initializers cannot inline";
169 /* We cannot inline a nested function that jumps to a nonlocal label. */
170 if (current_function_has_nonlocal_goto)
171 return "function with nonlocal goto cannot be inline";
176 /* Variables used within save_for_inline. */
178 /* Mapping from old pseudo-register to new pseudo-registers.
179 The first element of this map is reg_map[FIRST_PSEUDO_REGISTER].
180 It is allocated in `save_for_inline' and `expand_inline_function',
181 and deallocated on exit from each of those routines. */
184 /* Mapping from old code-labels to new code-labels.
185 The first element of this map is label_map[min_labelno].
186 It is allocated in `save_for_inline' and `expand_inline_function',
187 and deallocated on exit from each of those routines. */
188 static rtx *label_map;
190 /* Mapping from old insn uid's to copied insns.
191 It is allocated in `save_for_inline' and `expand_inline_function',
192 and deallocated on exit from each of those routines. */
193 static rtx *insn_map;
195 /* Map pseudo reg number into the PARM_DECL for the parm living in the reg.
196 Zero for a reg that isn't a parm's home.
197 Only reg numbers less than max_parm_reg are mapped here. */
198 static tree *parmdecl_map;
200 /* Keep track of first pseudo-register beyond those that are parms. */
201 static int max_parm_reg;
203 /* When an insn is being copied by copy_for_inline,
204 this is nonzero if we have copied an ASM_OPERANDS.
205 In that case, it is the original input-operand vector. */
206 static rtvec orig_asm_operands_vector;
208 /* When an insn is being copied by copy_for_inline,
209 this is nonzero if we have copied an ASM_OPERANDS.
210 In that case, it is the copied input-operand vector. */
211 static rtvec copy_asm_operands_vector;
213 /* Likewise, this is the copied constraints vector. */
214 static rtvec copy_asm_constraints_vector;
216 /* In save_for_inline, nonzero if past the parm-initialization insns. */
217 static int in_nonparm_insns;
219 /* Subroutine for `save_for_inline{copying,nocopy}'. Performs initialization
220 needed to save FNDECL's insns and info for future inline expansion. */
223 initialize_for_inline (fndecl, min_labelno, max_labelno, max_reg, copy)
230 int function_flags, i;
234 /* Compute the values of any flags we must restore when inlining this. */
237 = (current_function_calls_alloca * FUNCTION_FLAGS_CALLS_ALLOCA
238 + current_function_calls_setjmp * FUNCTION_FLAGS_CALLS_SETJMP
239 + current_function_calls_longjmp * FUNCTION_FLAGS_CALLS_LONGJMP
240 + current_function_returns_struct * FUNCTION_FLAGS_RETURNS_STRUCT
241 + current_function_returns_pcc_struct * FUNCTION_FLAGS_RETURNS_PCC_STRUCT
242 + current_function_needs_context * FUNCTION_FLAGS_NEEDS_CONTEXT
243 + current_function_has_nonlocal_label * FUNCTION_FLAGS_HAS_NONLOCAL_LABEL
244 + current_function_returns_pointer * FUNCTION_FLAGS_RETURNS_POINTER
245 + current_function_uses_const_pool * FUNCTION_FLAGS_USES_CONST_POOL
246 + current_function_uses_pic_offset_table * FUNCTION_FLAGS_USES_PIC_OFFSET_TABLE);
248 /* Clear out PARMDECL_MAP. It was allocated in the caller's frame. */
249 bzero ((char *) parmdecl_map, max_parm_reg * sizeof (tree));
250 arg_vector = rtvec_alloc (list_length (DECL_ARGUMENTS (fndecl)));
252 for (parms = DECL_ARGUMENTS (fndecl), i = 0;
254 parms = TREE_CHAIN (parms), i++)
256 rtx p = DECL_RTL (parms);
258 if (GET_CODE (p) == MEM && copy)
260 /* Copy the rtl so that modifications of the addresses
261 later in compilation won't affect this arg_vector.
262 Virtual register instantiation can screw the address
264 rtx new = copy_rtx (p);
266 /* Don't leave the old copy anywhere in this decl. */
267 if (DECL_RTL (parms) == DECL_INCOMING_RTL (parms)
268 || (GET_CODE (DECL_RTL (parms)) == MEM
269 && GET_CODE (DECL_INCOMING_RTL (parms)) == MEM
270 && (XEXP (DECL_RTL (parms), 0)
271 == XEXP (DECL_INCOMING_RTL (parms), 0))))
272 DECL_INCOMING_RTL (parms) = new;
273 DECL_RTL (parms) = new;
276 RTVEC_ELT (arg_vector, i) = p;
278 if (GET_CODE (p) == REG)
279 parmdecl_map[REGNO (p)] = parms;
280 else if (GET_CODE (p) == CONCAT)
282 rtx preal = gen_realpart (GET_MODE (XEXP (p, 0)), p);
283 rtx pimag = gen_imagpart (GET_MODE (preal), p);
285 if (GET_CODE (preal) == REG)
286 parmdecl_map[REGNO (preal)] = parms;
287 if (GET_CODE (pimag) == REG)
288 parmdecl_map[REGNO (pimag)] = parms;
291 /* This flag is cleared later
292 if the function ever modifies the value of the parm. */
293 TREE_READONLY (parms) = 1;
296 /* Assume we start out in the insns that set up the parameters. */
297 in_nonparm_insns = 0;
299 /* The list of DECL_SAVED_INSNS, starts off with a header which
300 contains the following information:
302 the first insn of the function (not including the insns that copy
303 parameters into registers).
304 the first parameter insn of the function,
305 the first label used by that function,
306 the last label used by that function,
307 the highest register number used for parameters,
308 the total number of registers used,
309 the size of the incoming stack area for parameters,
310 the number of bytes popped on return,
312 some flags that are used to restore compiler globals,
313 the value of current_function_outgoing_args_size,
314 the original argument vector,
315 the original DECL_INITIAL,
316 and pointers to the table of psuedo regs, pointer flags, and alignment. */
318 return gen_inline_header_rtx (NULL_RTX, NULL_RTX, min_labelno, max_labelno,
319 max_parm_reg, max_reg,
320 current_function_args_size,
321 current_function_pops_args,
322 stack_slot_list, forced_labels, function_flags,
323 current_function_outgoing_args_size,
324 arg_vector, (rtx) DECL_INITIAL (fndecl),
325 (rtvec) regno_reg_rtx, regno_pointer_flag,
326 regno_pointer_align);
329 /* Subroutine for `save_for_inline{copying,nocopy}'. Finishes up the
330 things that must be done to make FNDECL expandable as an inline function.
331 HEAD contains the chain of insns to which FNDECL will expand. */
334 finish_inline (fndecl, head)
338 NEXT_INSN (head) = get_first_nonparm_insn ();
339 FIRST_PARM_INSN (head) = get_insns ();
340 DECL_SAVED_INSNS (fndecl) = head;
341 DECL_FRAME_SIZE (fndecl) = get_frame_size ();
344 /* Adjust the BLOCK_END_NOTE pointers in a given copied DECL tree so that
345 they all point to the new (copied) rtxs. */
348 adjust_copied_decl_tree (block)
351 register tree subblock;
352 register rtx original_end;
354 original_end = BLOCK_END_NOTE (block);
357 BLOCK_END_NOTE (block) = (rtx) NOTE_SOURCE_FILE (original_end);
358 NOTE_SOURCE_FILE (original_end) = 0;
361 /* Process all subblocks. */
362 for (subblock = BLOCK_SUBBLOCKS (block);
364 subblock = TREE_CHAIN (subblock))
365 adjust_copied_decl_tree (subblock);
368 /* Make the insns and PARM_DECLs of the current function permanent
369 and record other information in DECL_SAVED_INSNS to allow inlining
370 of this function in subsequent calls.
372 This function is called when we are going to immediately compile
373 the insns for FNDECL. The insns in maybepermanent_obstack cannot be
374 modified by the compilation process, so we copy all of them to
375 new storage and consider the new insns to be the insn chain to be
376 compiled. Our caller (rest_of_compilation) saves the original
377 DECL_INITIAL and DECL_ARGUMENTS; here we copy them. */
379 /* ??? The nonlocal_label list should be adjusted also. However, since
380 a function that contains a nested function never gets inlined currently,
381 the nonlocal_label list will always be empty, so we don't worry about
385 save_for_inline_copying (fndecl)
388 rtx first_insn, last_insn, insn;
390 int max_labelno, min_labelno, i, len;
393 rtx first_nonparm_insn;
396 /* Make and emit a return-label if we have not already done so.
397 Do this before recording the bounds on label numbers. */
399 if (return_label == 0)
401 return_label = gen_label_rtx ();
402 emit_label (return_label);
405 /* Get some bounds on the labels and registers used. */
407 max_labelno = max_label_num ();
408 min_labelno = get_first_label_num ();
409 max_reg = max_reg_num ();
411 /* Set up PARMDECL_MAP which maps pseudo-reg number to its PARM_DECL.
412 Later we set TREE_READONLY to 0 if the parm is modified inside the fn.
413 Also set up ARG_VECTOR, which holds the unmodified DECL_RTX values
414 for the parms, prior to elimination of virtual registers.
415 These values are needed for substituting parms properly. */
417 max_parm_reg = max_parm_reg_num ();
418 parmdecl_map = (tree *) alloca (max_parm_reg * sizeof (tree));
420 head = initialize_for_inline (fndecl, min_labelno, max_labelno, max_reg, 1);
422 if (current_function_uses_const_pool)
424 /* Replace any constant pool references with the actual constant. We
425 will put the constants back in the copy made below. */
426 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
427 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
429 save_constants (&PATTERN (insn));
430 if (REG_NOTES (insn))
431 save_constants (®_NOTES (insn));
434 /* Also scan all decls, and replace any constant pool references with the
436 save_constants_in_decl_trees (DECL_INITIAL (fndecl));
438 /* Clear out the constant pool so that we can recreate it with the
439 copied constants below. */
440 init_const_rtx_hash_table ();
441 clear_const_double_mem ();
444 max_uid = INSN_UID (head);
446 /* We have now allocated all that needs to be allocated permanently
447 on the rtx obstack. Set our high-water mark, so that we
448 can free the rest of this when the time comes. */
452 /* Copy the chain insns of this function.
453 Install the copied chain as the insns of this function,
454 for continued compilation;
455 the original chain is recorded as the DECL_SAVED_INSNS
456 for inlining future calls. */
458 /* If there are insns that copy parms from the stack into pseudo registers,
459 those insns are not copied. `expand_inline_function' must
460 emit the correct code to handle such things. */
463 if (GET_CODE (insn) != NOTE)
465 first_insn = rtx_alloc (NOTE);
466 NOTE_SOURCE_FILE (first_insn) = NOTE_SOURCE_FILE (insn);
467 NOTE_LINE_NUMBER (first_insn) = NOTE_LINE_NUMBER (insn);
468 INSN_UID (first_insn) = INSN_UID (insn);
469 PREV_INSN (first_insn) = NULL;
470 NEXT_INSN (first_insn) = NULL;
471 last_insn = first_insn;
473 /* Each pseudo-reg in the old insn chain must have a unique rtx in the copy.
474 Make these new rtx's now, and install them in regno_reg_rtx, so they
475 will be the official pseudo-reg rtx's for the rest of compilation. */
477 reg_map = (rtx *) savealloc (regno_pointer_flag_length * sizeof (rtx));
479 len = sizeof (struct rtx_def) + (GET_RTX_LENGTH (REG) - 1) * sizeof (rtunion);
480 for (i = max_reg - 1; i > LAST_VIRTUAL_REGISTER; i--)
481 reg_map[i] = (rtx)obstack_copy (function_maybepermanent_obstack,
482 regno_reg_rtx[i], len);
484 regno_reg_rtx = reg_map;
486 /* Put copies of all the virtual register rtx into the new regno_reg_rtx. */
487 regno_reg_rtx[VIRTUAL_INCOMING_ARGS_REGNUM] = virtual_incoming_args_rtx;
488 regno_reg_rtx[VIRTUAL_STACK_VARS_REGNUM] = virtual_stack_vars_rtx;
489 regno_reg_rtx[VIRTUAL_STACK_DYNAMIC_REGNUM] = virtual_stack_dynamic_rtx;
490 regno_reg_rtx[VIRTUAL_OUTGOING_ARGS_REGNUM] = virtual_outgoing_args_rtx;
492 /* Likewise each label rtx must have a unique rtx as its copy. */
494 label_map = (rtx *)alloca ((max_labelno - min_labelno) * sizeof (rtx));
495 label_map -= min_labelno;
497 for (i = min_labelno; i < max_labelno; i++)
498 label_map[i] = gen_label_rtx ();
500 /* Record the mapping of old insns to copied insns. */
502 insn_map = (rtx *) alloca (max_uid * sizeof (rtx));
503 bzero ((char *) insn_map, max_uid * sizeof (rtx));
505 /* Get the insn which signals the end of parameter setup code. */
506 first_nonparm_insn = get_first_nonparm_insn ();
508 /* Copy any entries in regno_reg_rtx or DECL_RTLs that reference MEM
509 (the former occurs when a variable has its address taken)
510 since these may be shared and can be changed by virtual
511 register instantiation. DECL_RTL values for our arguments
512 have already been copied by initialize_for_inline. */
513 for (i = LAST_VIRTUAL_REGISTER + 1; i < max_reg; i++)
514 if (GET_CODE (regno_reg_rtx[i]) == MEM)
515 XEXP (regno_reg_rtx[i], 0)
516 = copy_for_inline (XEXP (regno_reg_rtx[i], 0));
518 /* Copy the tree of subblocks of the function, and the decls in them.
519 We will use the copy for compiling this function, then restore the original
520 subblocks and decls for use when inlining this function.
522 Several parts of the compiler modify BLOCK trees. In particular,
523 instantiate_virtual_regs will instantiate any virtual regs
524 mentioned in the DECL_RTLs of the decls, and loop
525 unrolling will replicate any BLOCK trees inside an unrolled loop.
527 The modified subblocks or DECL_RTLs would be incorrect for the original rtl
528 which we will use for inlining. The rtl might even contain pseudoregs
529 whose space has been freed. */
531 DECL_INITIAL (fndecl) = copy_decl_tree (DECL_INITIAL (fndecl));
532 DECL_ARGUMENTS (fndecl) = copy_decl_list (DECL_ARGUMENTS (fndecl));
534 /* Now copy each DECL_RTL which is a MEM,
535 so it is safe to modify their addresses. */
536 copy_decl_rtls (DECL_INITIAL (fndecl));
538 /* The fndecl node acts as its own progenitor, so mark it as such. */
539 DECL_ABSTRACT_ORIGIN (fndecl) = fndecl;
541 /* Now copy the chain of insns. Do this twice. The first copy the insn
542 itself and its body. The second time copy of REG_NOTES. This is because
543 a REG_NOTE may have a forward pointer to another insn. */
545 for (insn = NEXT_INSN (insn); insn; insn = NEXT_INSN (insn))
547 orig_asm_operands_vector = 0;
549 if (insn == first_nonparm_insn)
550 in_nonparm_insns = 1;
552 switch (GET_CODE (insn))
555 /* No need to keep these. */
556 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED)
559 copy = rtx_alloc (NOTE);
560 NOTE_LINE_NUMBER (copy) = NOTE_LINE_NUMBER (insn);
561 if (NOTE_LINE_NUMBER (insn) != NOTE_INSN_BLOCK_END)
562 NOTE_SOURCE_FILE (copy) = NOTE_SOURCE_FILE (insn);
565 NOTE_SOURCE_FILE (insn) = (char *) copy;
566 NOTE_SOURCE_FILE (copy) = 0;
568 RTX_INTEGRATED_P (copy) = RTX_INTEGRATED_P (insn);
574 copy = rtx_alloc (GET_CODE (insn));
576 if (GET_CODE (insn) == CALL_INSN)
577 CALL_INSN_FUNCTION_USAGE (copy) =
578 copy_for_inline (CALL_INSN_FUNCTION_USAGE (insn));
580 PATTERN (copy) = copy_for_inline (PATTERN (insn));
581 INSN_CODE (copy) = -1;
582 LOG_LINKS (copy) = NULL_RTX;
583 RTX_INTEGRATED_P (copy) = RTX_INTEGRATED_P (insn);
587 copy = label_map[CODE_LABEL_NUMBER (insn)];
588 LABEL_NAME (copy) = LABEL_NAME (insn);
592 copy = rtx_alloc (BARRIER);
598 INSN_UID (copy) = INSN_UID (insn);
599 insn_map[INSN_UID (insn)] = copy;
600 NEXT_INSN (last_insn) = copy;
601 PREV_INSN (copy) = last_insn;
605 adjust_copied_decl_tree (DECL_INITIAL (fndecl));
607 /* Now copy the REG_NOTES. */
608 for (insn = NEXT_INSN (get_insns ()); insn; insn = NEXT_INSN (insn))
609 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i'
610 && insn_map[INSN_UID(insn)])
611 REG_NOTES (insn_map[INSN_UID (insn)])
612 = copy_for_inline (REG_NOTES (insn));
614 NEXT_INSN (last_insn) = NULL;
616 finish_inline (fndecl, head);
618 /* Make new versions of the register tables. */
619 new = (char *) savealloc (regno_pointer_flag_length);
620 bcopy (regno_pointer_flag, new, regno_pointer_flag_length);
621 new1 = (char *) savealloc (regno_pointer_flag_length);
622 bcopy (regno_pointer_align, new1, regno_pointer_flag_length);
624 regno_pointer_flag = new;
625 regno_pointer_align = new1;
627 set_new_first_and_last_insn (first_insn, last_insn);
630 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
631 For example, this can copy a list made of TREE_LIST nodes. While copying,
632 for each node copied which doesn't already have is DECL_ABSTRACT_ORIGIN
633 set to some non-zero value, set the DECL_ABSTRACT_ORIGIN of the copy to
634 point to the corresponding (abstract) original node. */
637 copy_decl_list (list)
641 register tree prev, next;
646 head = prev = copy_node (list);
647 if (DECL_ABSTRACT_ORIGIN (head) == NULL_TREE)
648 DECL_ABSTRACT_ORIGIN (head) = list;
649 next = TREE_CHAIN (list);
654 copy = copy_node (next);
655 if (DECL_ABSTRACT_ORIGIN (copy) == NULL_TREE)
656 DECL_ABSTRACT_ORIGIN (copy) = next;
657 TREE_CHAIN (prev) = copy;
659 next = TREE_CHAIN (next);
664 /* Make a copy of the entire tree of blocks BLOCK, and return it. */
667 copy_decl_tree (block)
670 tree t, vars, subblocks;
672 vars = copy_decl_list (BLOCK_VARS (block));
675 /* Process all subblocks. */
676 for (t = BLOCK_SUBBLOCKS (block); t; t = TREE_CHAIN (t))
678 tree copy = copy_decl_tree (t);
679 TREE_CHAIN (copy) = subblocks;
683 t = copy_node (block);
684 BLOCK_VARS (t) = vars;
685 BLOCK_SUBBLOCKS (t) = nreverse (subblocks);
686 /* If the BLOCK being cloned is already marked as having been instantiated
687 from something else, then leave that `origin' marking alone. Otherwise,
688 mark the clone as having originated from the BLOCK we are cloning. */
689 if (BLOCK_ABSTRACT_ORIGIN (t) == NULL_TREE)
690 BLOCK_ABSTRACT_ORIGIN (t) = block;
694 /* Copy DECL_RTLs in all decls in the given BLOCK node. */
697 copy_decl_rtls (block)
702 for (t = BLOCK_VARS (block); t; t = TREE_CHAIN (t))
703 if (DECL_RTL (t) && GET_CODE (DECL_RTL (t)) == MEM)
704 DECL_RTL (t) = copy_for_inline (DECL_RTL (t));
706 /* Process all subblocks. */
707 for (t = BLOCK_SUBBLOCKS (block); t; t = TREE_CHAIN (t))
711 /* Make the insns and PARM_DECLs of the current function permanent
712 and record other information in DECL_SAVED_INSNS to allow inlining
713 of this function in subsequent calls.
715 This routine need not copy any insns because we are not going
716 to immediately compile the insns in the insn chain. There
717 are two cases when we would compile the insns for FNDECL:
718 (1) when FNDECL is expanded inline, and (2) when FNDECL needs to
719 be output at the end of other compilation, because somebody took
720 its address. In the first case, the insns of FNDECL are copied
721 as it is expanded inline, so FNDECL's saved insns are not
722 modified. In the second case, FNDECL is used for the last time,
723 so modifying the rtl is not a problem.
725 We don't have to worry about FNDECL being inline expanded by
726 other functions which are written at the end of compilation
727 because flag_no_inline is turned on when we begin writing
728 functions at the end of compilation. */
731 save_for_inline_nocopy (fndecl)
736 rtx first_nonparm_insn;
738 /* Set up PARMDECL_MAP which maps pseudo-reg number to its PARM_DECL.
739 Later we set TREE_READONLY to 0 if the parm is modified inside the fn.
740 Also set up ARG_VECTOR, which holds the unmodified DECL_RTX values
741 for the parms, prior to elimination of virtual registers.
742 These values are needed for substituting parms properly. */
744 max_parm_reg = max_parm_reg_num ();
745 parmdecl_map = (tree *) alloca (max_parm_reg * sizeof (tree));
747 /* Make and emit a return-label if we have not already done so. */
749 if (return_label == 0)
751 return_label = gen_label_rtx ();
752 emit_label (return_label);
755 head = initialize_for_inline (fndecl, get_first_label_num (),
756 max_label_num (), max_reg_num (), 0);
758 /* If there are insns that copy parms from the stack into pseudo registers,
759 those insns are not copied. `expand_inline_function' must
760 emit the correct code to handle such things. */
763 if (GET_CODE (insn) != NOTE)
766 /* Get the insn which signals the end of parameter setup code. */
767 first_nonparm_insn = get_first_nonparm_insn ();
769 /* Now just scan the chain of insns to see what happens to our
770 PARM_DECLs. If a PARM_DECL is used but never modified, we
771 can substitute its rtl directly when expanding inline (and
772 perform constant folding when its incoming value is constant).
773 Otherwise, we have to copy its value into a new register and track
774 the new register's life. */
776 for (insn = NEXT_INSN (insn); insn; insn = NEXT_INSN (insn))
778 if (insn == first_nonparm_insn)
779 in_nonparm_insns = 1;
781 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
783 if (current_function_uses_const_pool)
785 /* Replace any constant pool references with the actual constant.
786 We will put the constant back if we need to write the
787 function out after all. */
788 save_constants (&PATTERN (insn));
789 if (REG_NOTES (insn))
790 save_constants (®_NOTES (insn));
793 /* Record what interesting things happen to our parameters. */
794 note_stores (PATTERN (insn), note_modified_parmregs);
798 /* Also scan all decls, and replace any constant pool references with the
800 save_constants_in_decl_trees (DECL_INITIAL (fndecl));
802 /* We have now allocated all that needs to be allocated permanently
803 on the rtx obstack. Set our high-water mark, so that we
804 can free the rest of this when the time comes. */
808 finish_inline (fndecl, head);
811 /* Given PX, a pointer into an insn, search for references to the constant
812 pool. Replace each with a CONST that has the mode of the original
813 constant, contains the constant, and has RTX_INTEGRATED_P set.
814 Similarly, constant pool addresses not enclosed in a MEM are replaced
815 with an ADDRESS rtx which also gives the constant, mode, and has
816 RTX_INTEGRATED_P set. */
828 /* If this is a CONST_DOUBLE, don't try to fix things up in
829 CONST_DOUBLE_MEM, because this is an infinite recursion. */
830 if (GET_CODE (x) == CONST_DOUBLE)
832 else if (GET_CODE (x) == MEM && GET_CODE (XEXP (x, 0)) == SYMBOL_REF
833 && CONSTANT_POOL_ADDRESS_P (XEXP (x,0)))
835 enum machine_mode const_mode = get_pool_mode (XEXP (x, 0));
836 rtx new = gen_rtx (CONST, const_mode, get_pool_constant (XEXP (x, 0)));
837 RTX_INTEGRATED_P (new) = 1;
839 /* If the MEM was in a different mode than the constant (perhaps we
840 were only looking at the low-order part), surround it with a
841 SUBREG so we can save both modes. */
843 if (GET_MODE (x) != const_mode)
845 new = gen_rtx (SUBREG, GET_MODE (x), new, 0);
846 RTX_INTEGRATED_P (new) = 1;
850 save_constants (&XEXP (*px, 0));
852 else if (GET_CODE (x) == SYMBOL_REF
853 && CONSTANT_POOL_ADDRESS_P (x))
855 *px = gen_rtx (ADDRESS, get_pool_mode (x), get_pool_constant (x));
856 save_constants (&XEXP (*px, 0));
857 RTX_INTEGRATED_P (*px) = 1;
862 char *fmt = GET_RTX_FORMAT (GET_CODE (x));
863 int len = GET_RTX_LENGTH (GET_CODE (x));
865 for (i = len-1; i >= 0; i--)
870 for (j = 0; j < XVECLEN (x, i); j++)
871 save_constants (&XVECEXP (x, i, j));
875 if (XEXP (x, i) == 0)
879 /* Hack tail-recursion here. */
883 save_constants (&XEXP (x, i));
890 /* Note whether a parameter is modified or not. */
893 note_modified_parmregs (reg, x)
897 if (GET_CODE (reg) == REG && in_nonparm_insns
898 && REGNO (reg) < max_parm_reg
899 && REGNO (reg) >= FIRST_PSEUDO_REGISTER
900 && parmdecl_map[REGNO (reg)] != 0)
901 TREE_READONLY (parmdecl_map[REGNO (reg)]) = 0;
904 /* Copy the rtx ORIG recursively, replacing pseudo-regs and labels
905 according to `reg_map' and `label_map'. The original rtl insns
906 will be saved for inlining; this is used to make a copy
907 which is used to finish compiling the inline function itself.
909 If we find a "saved" constant pool entry, one which was replaced with
910 the value of the constant, convert it back to a constant pool entry.
911 Since the pool wasn't touched, this should simply restore the old
914 All other kinds of rtx are copied except those that can never be
915 changed during compilation. */
918 copy_for_inline (orig)
921 register rtx x = orig;
923 register enum rtx_code code;
924 register char *format_ptr;
931 /* These types may be freely shared. */
943 /* We have to make a new CONST_DOUBLE to ensure that we account for
944 it correctly. Using the old CONST_DOUBLE_MEM data is wrong. */
945 if (GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT)
949 REAL_VALUE_FROM_CONST_DOUBLE (d, x);
950 return CONST_DOUBLE_FROM_REAL_VALUE (d, GET_MODE (x));
953 return immed_double_const (CONST_DOUBLE_LOW (x), CONST_DOUBLE_HIGH (x),
957 /* Get constant pool entry for constant in the pool. */
958 if (RTX_INTEGRATED_P (x))
959 return validize_mem (force_const_mem (GET_MODE (x),
960 copy_for_inline (XEXP (x, 0))));
964 /* Get constant pool entry, but access in different mode. */
965 if (RTX_INTEGRATED_P (x))
968 = force_const_mem (GET_MODE (SUBREG_REG (x)),
969 copy_for_inline (XEXP (SUBREG_REG (x), 0)));
971 PUT_MODE (new, GET_MODE (x));
972 return validize_mem (new);
977 /* If not special for constant pool error. Else get constant pool
979 if (! RTX_INTEGRATED_P (x))
982 return XEXP (force_const_mem (GET_MODE (x),
983 copy_for_inline (XEXP (x, 0))), 0);
986 /* If a single asm insn contains multiple output operands
987 then it contains multiple ASM_OPERANDS rtx's that share operand 3.
988 We must make sure that the copied insn continues to share it. */
989 if (orig_asm_operands_vector == XVEC (orig, 3))
991 x = rtx_alloc (ASM_OPERANDS);
992 x->volatil = orig->volatil;
993 XSTR (x, 0) = XSTR (orig, 0);
994 XSTR (x, 1) = XSTR (orig, 1);
995 XINT (x, 2) = XINT (orig, 2);
996 XVEC (x, 3) = copy_asm_operands_vector;
997 XVEC (x, 4) = copy_asm_constraints_vector;
998 XSTR (x, 5) = XSTR (orig, 5);
999 XINT (x, 6) = XINT (orig, 6);
1005 /* A MEM is usually allowed to be shared if its address is constant
1006 or is a constant plus one of the special registers.
1008 We do not allow sharing of addresses that are either a special
1009 register or the sum of a constant and a special register because
1010 it is possible for unshare_all_rtl to copy the address, into memory
1011 that won't be saved. Although the MEM can safely be shared, and
1012 won't be copied there, the address itself cannot be shared, and may
1015 There are also two exceptions with constants: The first is if the
1016 constant is a LABEL_REF or the sum of the LABEL_REF
1017 and an integer. This case can happen if we have an inline
1018 function that supplies a constant operand to the call of another
1019 inline function that uses it in a switch statement. In this case,
1020 we will be replacing the LABEL_REF, so we have to replace this MEM
1023 The second case is if we have a (const (plus (address ..) ...)).
1024 In that case we need to put back the address of the constant pool
1027 if (CONSTANT_ADDRESS_P (XEXP (x, 0))
1028 && GET_CODE (XEXP (x, 0)) != LABEL_REF
1029 && ! (GET_CODE (XEXP (x, 0)) == CONST
1030 && (GET_CODE (XEXP (XEXP (x, 0), 0)) == PLUS
1031 && ((GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 0))
1033 || (GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 0))
1039 /* If this is a non-local label, just make a new LABEL_REF.
1040 Otherwise, use the new label as well. */
1041 x = gen_rtx (LABEL_REF, GET_MODE (orig),
1042 LABEL_REF_NONLOCAL_P (orig) ? XEXP (orig, 0)
1043 : label_map[CODE_LABEL_NUMBER (XEXP (orig, 0))]);
1044 LABEL_REF_NONLOCAL_P (x) = LABEL_REF_NONLOCAL_P (orig);
1045 LABEL_OUTSIDE_LOOP_P (x) = LABEL_OUTSIDE_LOOP_P (orig);
1049 if (REGNO (x) > LAST_VIRTUAL_REGISTER)
1050 return reg_map [REGNO (x)];
1055 /* If a parm that gets modified lives in a pseudo-reg,
1056 clear its TREE_READONLY to prevent certain optimizations. */
1058 rtx dest = SET_DEST (x);
1060 while (GET_CODE (dest) == STRICT_LOW_PART
1061 || GET_CODE (dest) == ZERO_EXTRACT
1062 || GET_CODE (dest) == SUBREG)
1063 dest = XEXP (dest, 0);
1065 if (GET_CODE (dest) == REG
1066 && REGNO (dest) < max_parm_reg
1067 && REGNO (dest) >= FIRST_PSEUDO_REGISTER
1068 && parmdecl_map[REGNO (dest)] != 0
1069 /* The insn to load an arg pseudo from a stack slot
1070 does not count as modifying it. */
1071 && in_nonparm_insns)
1072 TREE_READONLY (parmdecl_map[REGNO (dest)]) = 0;
1076 #if 0 /* This is a good idea, but here is the wrong place for it. */
1077 /* Arrange that CONST_INTs always appear as the second operand
1078 if they appear, and that `frame_pointer_rtx' or `arg_pointer_rtx'
1079 always appear as the first. */
1081 if (GET_CODE (XEXP (x, 0)) == CONST_INT
1082 || (XEXP (x, 1) == frame_pointer_rtx
1083 || (ARG_POINTER_REGNUM != FRAME_POINTER_REGNUM
1084 && XEXP (x, 1) == arg_pointer_rtx)))
1086 rtx t = XEXP (x, 0);
1087 XEXP (x, 0) = XEXP (x, 1);
1094 /* Replace this rtx with a copy of itself. */
1096 x = rtx_alloc (code);
1097 bcopy ((char *) orig, (char *) x,
1098 (sizeof (*x) - sizeof (x->fld)
1099 + sizeof (x->fld[0]) * GET_RTX_LENGTH (code)));
1101 /* Now scan the subexpressions recursively.
1102 We can store any replaced subexpressions directly into X
1103 since we know X is not shared! Any vectors in X
1104 must be copied if X was copied. */
1106 format_ptr = GET_RTX_FORMAT (code);
1108 for (i = 0; i < GET_RTX_LENGTH (code); i++)
1110 switch (*format_ptr++)
1113 XEXP (x, i) = copy_for_inline (XEXP (x, i));
1117 /* Change any references to old-insns to point to the
1118 corresponding copied insns. */
1119 XEXP (x, i) = insn_map[INSN_UID (XEXP (x, i))];
1123 if (XVEC (x, i) != NULL && XVECLEN (x, i) != 0)
1127 XVEC (x, i) = gen_rtvec_v (XVECLEN (x, i), &XVECEXP (x, i, 0));
1128 for (j = 0; j < XVECLEN (x, i); j++)
1130 = copy_for_inline (XVECEXP (x, i, j));
1136 if (code == ASM_OPERANDS && orig_asm_operands_vector == 0)
1138 orig_asm_operands_vector = XVEC (orig, 3);
1139 copy_asm_operands_vector = XVEC (x, 3);
1140 copy_asm_constraints_vector = XVEC (x, 4);
1146 /* Unfortunately, we need a global copy of const_equiv map for communication
1147 with a function called from note_stores. Be *very* careful that this
1148 is used properly in the presence of recursion. */
1150 rtx *global_const_equiv_map;
1151 int global_const_equiv_map_size;
1153 #define FIXED_BASE_PLUS_P(X) \
1154 (GET_CODE (X) == PLUS && GET_CODE (XEXP (X, 1)) == CONST_INT \
1155 && GET_CODE (XEXP (X, 0)) == REG \
1156 && REGNO (XEXP (X, 0)) >= FIRST_VIRTUAL_REGISTER \
1157 && REGNO (XEXP (X, 0)) <= LAST_VIRTUAL_REGISTER)
1159 /* Integrate the procedure defined by FNDECL. Note that this function
1160 may wind up calling itself. Since the static variables are not
1161 reentrant, we do not assign them until after the possibility
1162 of recursion is eliminated.
1164 If IGNORE is nonzero, do not produce a value.
1165 Otherwise store the value in TARGET if it is nonzero and that is convenient.
1168 (rtx)-1 if we could not substitute the function
1169 0 if we substituted it and it does not produce a value
1170 else an rtx for where the value is stored. */
1173 expand_inline_function (fndecl, parms, target, ignore, type,
1174 structure_value_addr)
1179 rtx structure_value_addr;
1181 tree formal, actual, block;
1182 rtx header = DECL_SAVED_INSNS (fndecl);
1183 rtx insns = FIRST_FUNCTION_INSN (header);
1184 rtx parm_insns = FIRST_PARM_INSN (header);
1190 int min_labelno = FIRST_LABELNO (header);
1191 int max_labelno = LAST_LABELNO (header);
1193 rtx local_return_label = 0;
1197 struct inline_remap *map;
1199 rtvec arg_vector = ORIGINAL_ARG_VECTOR (header);
1200 rtx static_chain_value = 0;
1202 /* Allow for equivalences of the pseudos we make for virtual fp and ap. */
1203 max_regno = MAX_REGNUM (header) + 3;
1204 if (max_regno < FIRST_PSEUDO_REGISTER)
1207 nargs = list_length (DECL_ARGUMENTS (fndecl));
1209 /* Check that the parms type match and that sufficient arguments were
1210 passed. Since the appropriate conversions or default promotions have
1211 already been applied, the machine modes should match exactly. */
1213 for (formal = DECL_ARGUMENTS (fndecl), actual = parms;
1215 formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual))
1218 enum machine_mode mode;
1221 return (rtx) (HOST_WIDE_INT) -1;
1223 arg = TREE_VALUE (actual);
1224 mode = TYPE_MODE (DECL_ARG_TYPE (formal));
1226 if (mode != TYPE_MODE (TREE_TYPE (arg))
1227 /* If they are block mode, the types should match exactly.
1228 They don't match exactly if TREE_TYPE (FORMAL) == ERROR_MARK_NODE,
1229 which could happen if the parameter has incomplete type. */
1231 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg))
1232 != TYPE_MAIN_VARIANT (TREE_TYPE (formal)))))
1233 return (rtx) (HOST_WIDE_INT) -1;
1236 /* Extra arguments are valid, but will be ignored below, so we must
1237 evaluate them here for side-effects. */
1238 for (; actual; actual = TREE_CHAIN (actual))
1239 expand_expr (TREE_VALUE (actual), const0_rtx,
1240 TYPE_MODE (TREE_TYPE (TREE_VALUE (actual))), 0);
1242 /* Make a binding contour to keep inline cleanups called at
1243 outer function-scope level from looking like they are shadowing
1244 parameter declarations. */
1247 /* Make a fresh binding contour that we can easily remove. */
1249 expand_start_bindings (0);
1251 /* Expand the function arguments. Do this first so that any
1252 new registers get created before we allocate the maps. */
1254 arg_vals = (rtx *) alloca (nargs * sizeof (rtx));
1255 arg_trees = (tree *) alloca (nargs * sizeof (tree));
1257 for (formal = DECL_ARGUMENTS (fndecl), actual = parms, i = 0;
1259 formal = TREE_CHAIN (formal), actual = TREE_CHAIN (actual), i++)
1261 /* Actual parameter, converted to the type of the argument within the
1263 tree arg = convert (TREE_TYPE (formal), TREE_VALUE (actual));
1264 /* Mode of the variable used within the function. */
1265 enum machine_mode mode = TYPE_MODE (TREE_TYPE (formal));
1269 loc = RTVEC_ELT (arg_vector, i);
1271 /* If this is an object passed by invisible reference, we copy the
1272 object into a stack slot and save its address. If this will go
1273 into memory, we do nothing now. Otherwise, we just expand the
1275 if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG
1276 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)
1279 = assign_stack_temp (TYPE_MODE (TREE_TYPE (arg)),
1280 int_size_in_bytes (TREE_TYPE (arg)), 1);
1281 MEM_IN_STRUCT_P (stack_slot) = AGGREGATE_TYPE_P (TREE_TYPE (arg));
1283 store_expr (arg, stack_slot, 0);
1285 arg_vals[i] = XEXP (stack_slot, 0);
1288 else if (GET_CODE (loc) != MEM)
1290 if (GET_MODE (loc) != TYPE_MODE (TREE_TYPE (arg)))
1291 /* The mode if LOC and ARG can differ if LOC was a variable
1292 that had its mode promoted via PROMOTED_MODE. */
1293 arg_vals[i] = convert_modes (GET_MODE (loc),
1294 TYPE_MODE (TREE_TYPE (arg)),
1295 expand_expr (arg, NULL_RTX, mode,
1297 TREE_UNSIGNED (TREE_TYPE (formal)));
1299 arg_vals[i] = expand_expr (arg, NULL_RTX, mode, EXPAND_SUM);
1304 if (arg_vals[i] != 0
1305 && (! TREE_READONLY (formal)
1306 /* If the parameter is not read-only, copy our argument through
1307 a register. Also, we cannot use ARG_VALS[I] if it overlaps
1308 TARGET in any way. In the inline function, they will likely
1309 be two different pseudos, and `safe_from_p' will make all
1310 sorts of smart assumptions about their not conflicting.
1311 But if ARG_VALS[I] overlaps TARGET, these assumptions are
1312 wrong, so put ARG_VALS[I] into a fresh register.
1313 Don't worry about invisible references, since their stack
1314 temps will never overlap the target. */
1317 && (GET_CODE (arg_vals[i]) == REG
1318 || GET_CODE (arg_vals[i]) == SUBREG
1319 || GET_CODE (arg_vals[i]) == MEM)
1320 && reg_overlap_mentioned_p (arg_vals[i], target))
1321 /* ??? We must always copy a SUBREG into a REG, because it might
1322 get substituted into an address, and not all ports correctly
1323 handle SUBREGs in addresses. */
1324 || (GET_CODE (arg_vals[i]) == SUBREG)))
1325 arg_vals[i] = copy_to_mode_reg (GET_MODE (loc), arg_vals[i]);
1327 if (arg_vals[i] != 0 && GET_CODE (arg_vals[i]) == REG
1328 && TREE_CODE (TREE_TYPE (formal)) == POINTER_TYPE)
1329 mark_reg_pointer (arg_vals[i],
1330 (TYPE_ALIGN (TREE_TYPE (TREE_TYPE (formal)))
1334 /* Allocate the structures we use to remap things. */
1336 map = (struct inline_remap *) alloca (sizeof (struct inline_remap));
1337 map->fndecl = fndecl;
1339 map->reg_map = (rtx *) alloca (max_regno * sizeof (rtx));
1340 bzero ((char *) map->reg_map, max_regno * sizeof (rtx));
1342 map->label_map = (rtx *)alloca ((max_labelno - min_labelno) * sizeof (rtx));
1343 map->label_map -= min_labelno;
1345 map->insn_map = (rtx *) alloca (INSN_UID (header) * sizeof (rtx));
1346 bzero ((char *) map->insn_map, INSN_UID (header) * sizeof (rtx));
1347 map->min_insnno = 0;
1348 map->max_insnno = INSN_UID (header);
1350 map->integrating = 1;
1352 /* const_equiv_map maps pseudos in our routine to constants, so it needs to
1353 be large enough for all our pseudos. This is the number we are currently
1354 using plus the number in the called routine, plus 15 for each arg,
1355 five to compute the virtual frame pointer, and five for the return value.
1356 This should be enough for most cases. We do not reference entries
1357 outside the range of the map.
1359 ??? These numbers are quite arbitrary and were obtained by
1360 experimentation. At some point, we should try to allocate the
1361 table after all the parameters are set up so we an more accurately
1362 estimate the number of pseudos we will need. */
1364 map->const_equiv_map_size
1365 = max_reg_num () + (max_regno - FIRST_PSEUDO_REGISTER) + 15 * nargs + 10;
1367 map->const_equiv_map
1368 = (rtx *)alloca (map->const_equiv_map_size * sizeof (rtx));
1369 bzero ((char *) map->const_equiv_map,
1370 map->const_equiv_map_size * sizeof (rtx));
1373 = (unsigned *)alloca (map->const_equiv_map_size * sizeof (unsigned));
1374 bzero ((char *) map->const_age_map,
1375 map->const_equiv_map_size * sizeof (unsigned));
1378 /* Record the current insn in case we have to set up pointers to frame
1379 and argument memory blocks. */
1380 map->insns_at_start = get_last_insn ();
1382 map->regno_pointer_flag = INLINE_REGNO_POINTER_FLAG (header);
1383 map->regno_pointer_align = INLINE_REGNO_POINTER_ALIGN (header);
1385 /* Update the outgoing argument size to allow for those in the inlined
1387 if (OUTGOING_ARGS_SIZE (header) > current_function_outgoing_args_size)
1388 current_function_outgoing_args_size = OUTGOING_ARGS_SIZE (header);
1390 /* If the inline function needs to make PIC references, that means
1391 that this function's PIC offset table must be used. */
1392 if (FUNCTION_FLAGS (header) & FUNCTION_FLAGS_USES_PIC_OFFSET_TABLE)
1393 current_function_uses_pic_offset_table = 1;
1395 /* If this function needs a context, set it up. */
1396 if (FUNCTION_FLAGS (header) & FUNCTION_FLAGS_NEEDS_CONTEXT)
1397 static_chain_value = lookup_static_chain (fndecl);
1399 if (GET_CODE (parm_insns) == NOTE
1400 && NOTE_LINE_NUMBER (parm_insns) > 0)
1402 rtx note = emit_note (NOTE_SOURCE_FILE (parm_insns),
1403 NOTE_LINE_NUMBER (parm_insns));
1405 RTX_INTEGRATED_P (note) = 1;
1408 /* Process each argument. For each, set up things so that the function's
1409 reference to the argument will refer to the argument being passed.
1410 We only replace REG with REG here. Any simplifications are done
1411 via const_equiv_map.
1413 We make two passes: In the first, we deal with parameters that will
1414 be placed into registers, since we need to ensure that the allocated
1415 register number fits in const_equiv_map. Then we store all non-register
1416 parameters into their memory location. */
1418 /* Don't try to free temp stack slots here, because we may put one of the
1419 parameters into a temp stack slot. */
1421 for (i = 0; i < nargs; i++)
1423 rtx copy = arg_vals[i];
1425 loc = RTVEC_ELT (arg_vector, i);
1427 /* There are three cases, each handled separately. */
1428 if (GET_CODE (loc) == MEM && GET_CODE (XEXP (loc, 0)) == REG
1429 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER)
1431 /* This must be an object passed by invisible reference (it could
1432 also be a variable-sized object, but we forbid inlining functions
1433 with variable-sized arguments). COPY is the address of the
1434 actual value (this computation will cause it to be copied). We
1435 map that address for the register, noting the actual address as
1436 an equivalent in case it can be substituted into the insns. */
1438 if (GET_CODE (copy) != REG)
1440 temp = copy_addr_to_reg (copy);
1441 if ((CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy))
1442 && REGNO (temp) < map->const_equiv_map_size)
1444 map->const_equiv_map[REGNO (temp)] = copy;
1445 map->const_age_map[REGNO (temp)] = CONST_AGE_PARM;
1449 map->reg_map[REGNO (XEXP (loc, 0))] = copy;
1451 else if (GET_CODE (loc) == MEM)
1453 /* This is the case of a parameter that lives in memory.
1454 It will live in the block we allocate in the called routine's
1455 frame that simulates the incoming argument area. Do nothing
1456 now; we will call store_expr later. */
1459 else if (GET_CODE (loc) == REG)
1461 /* This is the good case where the parameter is in a register.
1462 If it is read-only and our argument is a constant, set up the
1463 constant equivalence.
1465 If LOC is REG_USERVAR_P, the usual case, COPY must also have
1466 that flag set if it is a register.
1468 Also, don't allow hard registers here; they might not be valid
1469 when substituted into insns. */
1471 if ((GET_CODE (copy) != REG && GET_CODE (copy) != SUBREG)
1472 || (GET_CODE (copy) == REG && REG_USERVAR_P (loc)
1473 && ! REG_USERVAR_P (copy))
1474 || (GET_CODE (copy) == REG
1475 && REGNO (copy) < FIRST_PSEUDO_REGISTER))
1477 temp = copy_to_mode_reg (GET_MODE (loc), copy);
1478 REG_USERVAR_P (temp) = REG_USERVAR_P (loc);
1479 if ((CONSTANT_P (copy) || FIXED_BASE_PLUS_P (copy))
1480 && REGNO (temp) < map->const_equiv_map_size)
1482 map->const_equiv_map[REGNO (temp)] = copy;
1483 map->const_age_map[REGNO (temp)] = CONST_AGE_PARM;
1487 map->reg_map[REGNO (loc)] = copy;
1489 else if (GET_CODE (loc) == CONCAT)
1491 /* This is the good case where the parameter is in a
1492 pair of separate pseudos.
1493 If it is read-only and our argument is a constant, set up the
1494 constant equivalence.
1496 If LOC is REG_USERVAR_P, the usual case, COPY must also have
1497 that flag set if it is a register.
1499 Also, don't allow hard registers here; they might not be valid
1500 when substituted into insns. */
1501 rtx locreal = gen_realpart (GET_MODE (XEXP (loc, 0)), loc);
1502 rtx locimag = gen_imagpart (GET_MODE (XEXP (loc, 0)), loc);
1503 rtx copyreal = gen_realpart (GET_MODE (locreal), copy);
1504 rtx copyimag = gen_imagpart (GET_MODE (locimag), copy);
1506 if ((GET_CODE (copyreal) != REG && GET_CODE (copyreal) != SUBREG)
1507 || (GET_CODE (copyreal) == REG && REG_USERVAR_P (locreal)
1508 && ! REG_USERVAR_P (copyreal))
1509 || (GET_CODE (copyreal) == REG
1510 && REGNO (copyreal) < FIRST_PSEUDO_REGISTER))
1512 temp = copy_to_mode_reg (GET_MODE (locreal), copyreal);
1513 REG_USERVAR_P (temp) = REG_USERVAR_P (locreal);
1514 if ((CONSTANT_P (copyreal) || FIXED_BASE_PLUS_P (copyreal))
1515 && REGNO (temp) < map->const_equiv_map_size)
1517 map->const_equiv_map[REGNO (temp)] = copyreal;
1518 map->const_age_map[REGNO (temp)] = CONST_AGE_PARM;
1522 map->reg_map[REGNO (locreal)] = copyreal;
1524 if ((GET_CODE (copyimag) != REG && GET_CODE (copyimag) != SUBREG)
1525 || (GET_CODE (copyimag) == REG && REG_USERVAR_P (locimag)
1526 && ! REG_USERVAR_P (copyimag))
1527 || (GET_CODE (copyimag) == REG
1528 && REGNO (copyimag) < FIRST_PSEUDO_REGISTER))
1530 temp = copy_to_mode_reg (GET_MODE (locimag), copyimag);
1531 REG_USERVAR_P (temp) = REG_USERVAR_P (locimag);
1532 if ((CONSTANT_P (copyimag) || FIXED_BASE_PLUS_P (copyimag))
1533 && REGNO (temp) < map->const_equiv_map_size)
1535 map->const_equiv_map[REGNO (temp)] = copyimag;
1536 map->const_age_map[REGNO (temp)] = CONST_AGE_PARM;
1540 map->reg_map[REGNO (locimag)] = copyimag;
1546 /* Now do the parameters that will be placed in memory. */
1548 for (formal = DECL_ARGUMENTS (fndecl), i = 0;
1549 formal; formal = TREE_CHAIN (formal), i++)
1551 loc = RTVEC_ELT (arg_vector, i);
1553 if (GET_CODE (loc) == MEM
1554 /* Exclude case handled above. */
1555 && ! (GET_CODE (XEXP (loc, 0)) == REG
1556 && REGNO (XEXP (loc, 0)) > LAST_VIRTUAL_REGISTER))
1558 rtx note = emit_note (DECL_SOURCE_FILE (formal),
1559 DECL_SOURCE_LINE (formal));
1561 RTX_INTEGRATED_P (note) = 1;
1563 /* Compute the address in the area we reserved and store the
1565 temp = copy_rtx_and_substitute (loc, map);
1566 subst_constants (&temp, NULL_RTX, map);
1567 apply_change_group ();
1568 if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0)))
1569 temp = change_address (temp, VOIDmode, XEXP (temp, 0));
1570 store_expr (arg_trees[i], temp, 0);
1574 /* Deal with the places that the function puts its result.
1575 We are driven by what is placed into DECL_RESULT.
1577 Initially, we assume that we don't have anything special handling for
1578 REG_FUNCTION_RETURN_VALUE_P. */
1580 map->inline_target = 0;
1581 loc = DECL_RTL (DECL_RESULT (fndecl));
1582 if (TYPE_MODE (type) == VOIDmode)
1583 /* There is no return value to worry about. */
1585 else if (GET_CODE (loc) == MEM)
1587 if (! structure_value_addr || ! aggregate_value_p (DECL_RESULT (fndecl)))
1590 /* Pass the function the address in which to return a structure value.
1591 Note that a constructor can cause someone to call us with
1592 STRUCTURE_VALUE_ADDR, but the initialization takes place
1593 via the first parameter, rather than the struct return address.
1595 We have two cases: If the address is a simple register indirect,
1596 use the mapping mechanism to point that register to our structure
1597 return address. Otherwise, store the structure return value into
1598 the place that it will be referenced from. */
1600 if (GET_CODE (XEXP (loc, 0)) == REG)
1602 temp = force_reg (Pmode, structure_value_addr);
1603 map->reg_map[REGNO (XEXP (loc, 0))] = temp;
1604 if ((CONSTANT_P (structure_value_addr)
1605 || (GET_CODE (structure_value_addr) == PLUS
1606 && XEXP (structure_value_addr, 0) == virtual_stack_vars_rtx
1607 && GET_CODE (XEXP (structure_value_addr, 1)) == CONST_INT))
1608 && REGNO (temp) < map->const_equiv_map_size)
1610 map->const_equiv_map[REGNO (temp)] = structure_value_addr;
1611 map->const_age_map[REGNO (temp)] = CONST_AGE_PARM;
1616 temp = copy_rtx_and_substitute (loc, map);
1617 subst_constants (&temp, NULL_RTX, map);
1618 apply_change_group ();
1619 emit_move_insn (temp, structure_value_addr);
1623 /* We will ignore the result value, so don't look at its structure.
1624 Note that preparations for an aggregate return value
1625 do need to be made (above) even if it will be ignored. */
1627 else if (GET_CODE (loc) == REG)
1629 /* The function returns an object in a register and we use the return
1630 value. Set up our target for remapping. */
1632 /* Machine mode function was declared to return. */
1633 enum machine_mode departing_mode = TYPE_MODE (type);
1634 /* (Possibly wider) machine mode it actually computes
1635 (for the sake of callers that fail to declare it right). */
1636 enum machine_mode arriving_mode
1637 = TYPE_MODE (TREE_TYPE (DECL_RESULT (fndecl)));
1640 /* Don't use MEMs as direct targets because on some machines
1641 substituting a MEM for a REG makes invalid insns.
1642 Let the combiner substitute the MEM if that is valid. */
1643 if (target == 0 || GET_CODE (target) != REG
1644 || GET_MODE (target) != departing_mode)
1645 target = gen_reg_rtx (departing_mode);
1647 /* If function's value was promoted before return,
1648 avoid machine mode mismatch when we substitute INLINE_TARGET.
1649 But TARGET is what we will return to the caller. */
1650 if (arriving_mode != departing_mode)
1651 reg_to_map = gen_rtx (SUBREG, arriving_mode, target, 0);
1653 reg_to_map = target;
1655 /* Usually, the result value is the machine's return register.
1656 Sometimes it may be a pseudo. Handle both cases. */
1657 if (REG_FUNCTION_VALUE_P (loc))
1658 map->inline_target = reg_to_map;
1660 map->reg_map[REGNO (loc)] = reg_to_map;
1663 /* Make new label equivalences for the labels in the called function. */
1664 for (i = min_labelno; i < max_labelno; i++)
1665 map->label_map[i] = gen_label_rtx ();
1667 /* Perform postincrements before actually calling the function. */
1670 /* Clean up stack so that variables might have smaller offsets. */
1671 do_pending_stack_adjust ();
1673 /* Save a copy of the location of const_equiv_map for mark_stores, called
1675 global_const_equiv_map = map->const_equiv_map;
1676 global_const_equiv_map_size = map->const_equiv_map_size;
1678 /* If the called function does an alloca, save and restore the
1679 stack pointer around the call. This saves stack space, but
1680 also is required if this inline is being done between two
1682 if (FUNCTION_FLAGS (header) & FUNCTION_FLAGS_CALLS_ALLOCA)
1683 emit_stack_save (SAVE_BLOCK, &stack_save, NULL_RTX);
1685 /* Now copy the insns one by one. Do this in two passes, first the insns and
1686 then their REG_NOTES, just like save_for_inline. */
1688 /* This loop is very similar to the loop in copy_loop_body in unroll.c. */
1690 for (insn = insns; insn; insn = NEXT_INSN (insn))
1692 rtx copy, pattern, set;
1694 map->orig_asm_operands_vector = 0;
1696 switch (GET_CODE (insn))
1699 pattern = PATTERN (insn);
1700 set = single_set (insn);
1702 if (GET_CODE (pattern) == USE
1703 && GET_CODE (XEXP (pattern, 0)) == REG
1704 && REG_FUNCTION_VALUE_P (XEXP (pattern, 0)))
1705 /* The (USE (REG n)) at return from the function should
1706 be ignored since we are changing (REG n) into
1710 /* Ignore setting a function value that we don't want to use. */
1711 if (map->inline_target == 0
1713 && GET_CODE (SET_DEST (set)) == REG
1714 && REG_FUNCTION_VALUE_P (SET_DEST (set)))
1716 if (volatile_refs_p (SET_SRC (set)))
1720 /* If we must not delete the source,
1721 load it into a new temporary. */
1722 copy = emit_insn (copy_rtx_and_substitute (pattern, map));
1724 new_set = single_set (copy);
1729 = gen_reg_rtx (GET_MODE (SET_DEST (new_set)));
1731 /* If the source and destination are the same and it
1732 has a note on it, keep the insn. */
1733 else if (rtx_equal_p (SET_DEST (set), SET_SRC (set))
1734 && REG_NOTES (insn) != 0)
1735 copy = emit_insn (copy_rtx_and_substitute (pattern, map));
1740 /* If this is setting the static chain rtx, omit it. */
1741 else if (static_chain_value != 0
1743 && GET_CODE (SET_DEST (set)) == REG
1744 && rtx_equal_p (SET_DEST (set),
1745 static_chain_incoming_rtx))
1748 /* If this is setting the static chain pseudo, set it from
1749 the value we want to give it instead. */
1750 else if (static_chain_value != 0
1752 && rtx_equal_p (SET_SRC (set),
1753 static_chain_incoming_rtx))
1755 rtx newdest = copy_rtx_and_substitute (SET_DEST (set), map);
1757 copy = emit_move_insn (newdest, static_chain_value);
1758 static_chain_value = 0;
1761 copy = emit_insn (copy_rtx_and_substitute (pattern, map));
1762 /* REG_NOTES will be copied later. */
1765 /* If this insn is setting CC0, it may need to look at
1766 the insn that uses CC0 to see what type of insn it is.
1767 In that case, the call to recog via validate_change will
1768 fail. So don't substitute constants here. Instead,
1769 do it when we emit the following insn.
1771 For example, see the pyr.md file. That machine has signed and
1772 unsigned compares. The compare patterns must check the
1773 following branch insn to see which what kind of compare to
1776 If the previous insn set CC0, substitute constants on it as
1778 if (sets_cc0_p (PATTERN (copy)) != 0)
1783 try_constants (cc0_insn, map);
1785 try_constants (copy, map);
1788 try_constants (copy, map);
1793 if (GET_CODE (PATTERN (insn)) == RETURN)
1795 if (local_return_label == 0)
1796 local_return_label = gen_label_rtx ();
1797 pattern = gen_jump (local_return_label);
1800 pattern = copy_rtx_and_substitute (PATTERN (insn), map);
1802 copy = emit_jump_insn (pattern);
1806 try_constants (cc0_insn, map);
1809 try_constants (copy, map);
1811 /* If this used to be a conditional jump insn but whose branch
1812 direction is now know, we must do something special. */
1813 if (condjump_p (insn) && ! simplejump_p (insn) && map->last_pc_value)
1816 /* The previous insn set cc0 for us. So delete it. */
1817 delete_insn (PREV_INSN (copy));
1820 /* If this is now a no-op, delete it. */
1821 if (map->last_pc_value == pc_rtx)
1827 /* Otherwise, this is unconditional jump so we must put a
1828 BARRIER after it. We could do some dead code elimination
1829 here, but jump.c will do it just as well. */
1835 pattern = copy_rtx_and_substitute (PATTERN (insn), map);
1836 copy = emit_call_insn (pattern);
1838 /* Because the USAGE information potentially contains objects other
1839 than hard registers, we need to copy it. */
1840 CALL_INSN_FUNCTION_USAGE (copy) =
1841 copy_rtx_and_substitute (CALL_INSN_FUNCTION_USAGE (insn), map);
1845 try_constants (cc0_insn, map);
1848 try_constants (copy, map);
1850 /* Be lazy and assume CALL_INSNs clobber all hard registers. */
1851 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1852 map->const_equiv_map[i] = 0;
1856 copy = emit_label (map->label_map[CODE_LABEL_NUMBER (insn)]);
1857 LABEL_NAME (copy) = LABEL_NAME (insn);
1862 copy = emit_barrier ();
1866 /* It is important to discard function-end and function-beg notes,
1867 so we have only one of each in the current function.
1868 Also, NOTE_INSN_DELETED notes aren't useful (save_for_inline
1869 deleted these in the copy used for continuing compilation,
1870 not the copy used for inlining). */
1871 if (NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_END
1872 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_FUNCTION_BEG
1873 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_DELETED)
1874 copy = emit_note (NOTE_SOURCE_FILE (insn), NOTE_LINE_NUMBER (insn));
1885 RTX_INTEGRATED_P (copy) = 1;
1887 map->insn_map[INSN_UID (insn)] = copy;
1890 /* Now copy the REG_NOTES. Increment const_age, so that only constants
1891 from parameters can be substituted in. These are the only ones that
1892 are valid across the entire function. */
1894 for (insn = insns; insn; insn = NEXT_INSN (insn))
1895 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i'
1896 && map->insn_map[INSN_UID (insn)]
1897 && REG_NOTES (insn))
1899 rtx tem = copy_rtx_and_substitute (REG_NOTES (insn), map);
1900 /* We must also do subst_constants, in case one of our parameters
1901 has const type and constant value. */
1902 subst_constants (&tem, NULL_RTX, map);
1903 apply_change_group ();
1904 REG_NOTES (map->insn_map[INSN_UID (insn)]) = tem;
1907 if (local_return_label)
1908 emit_label (local_return_label);
1910 /* Restore the stack pointer if we saved it above. */
1911 if (FUNCTION_FLAGS (header) & FUNCTION_FLAGS_CALLS_ALLOCA)
1912 emit_stack_restore (SAVE_BLOCK, stack_save, NULL_RTX);
1914 /* Make copies of the decls of the symbols in the inline function, so that
1915 the copies of the variables get declared in the current function. Set
1916 up things so that lookup_static_chain knows that to interpret registers
1917 in SAVE_EXPRs for TYPE_SIZEs as local. */
1919 inline_function_decl = fndecl;
1920 integrate_parm_decls (DECL_ARGUMENTS (fndecl), map, arg_vector);
1921 integrate_decl_tree ((tree) ORIGINAL_DECL_INITIAL (header), 0, map);
1922 inline_function_decl = 0;
1924 /* End the scope containing the copied formal parameter variables
1925 and copied LABEL_DECLs. */
1927 expand_end_bindings (getdecls (), 1, 1);
1928 block = poplevel (1, 1, 0);
1929 BLOCK_ABSTRACT_ORIGIN (block) = (DECL_ABSTRACT_ORIGIN (fndecl) == NULL
1930 ? fndecl : DECL_ABSTRACT_ORIGIN (fndecl));
1932 emit_line_note (input_filename, lineno);
1934 if (structure_value_addr)
1936 target = gen_rtx (MEM, TYPE_MODE (type),
1937 memory_address (TYPE_MODE (type), structure_value_addr));
1938 MEM_IN_STRUCT_P (target) = 1;
1943 /* Given a chain of PARM_DECLs, ARGS, copy each decl into a VAR_DECL,
1944 push all of those decls and give each one the corresponding home. */
1947 integrate_parm_decls (args, map, arg_vector)
1949 struct inline_remap *map;
1955 for (tail = args, i = 0; tail; tail = TREE_CHAIN (tail), i++)
1957 register tree decl = build_decl (VAR_DECL, DECL_NAME (tail),
1960 = copy_rtx_and_substitute (RTVEC_ELT (arg_vector, i), map);
1962 DECL_ARG_TYPE (decl) = DECL_ARG_TYPE (tail);
1963 /* We really should be setting DECL_INCOMING_RTL to something reasonable
1964 here, but that's going to require some more work. */
1965 /* DECL_INCOMING_RTL (decl) = ?; */
1966 /* These args would always appear unused, if not for this. */
1967 TREE_USED (decl) = 1;
1968 /* Prevent warning for shadowing with these. */
1969 DECL_ABSTRACT_ORIGIN (decl) = tail;
1971 /* Fully instantiate the address with the equivalent form so that the
1972 debugging information contains the actual register, instead of the
1973 virtual register. Do this by not passing an insn to
1975 subst_constants (&new_decl_rtl, NULL_RTX, map);
1976 apply_change_group ();
1977 DECL_RTL (decl) = new_decl_rtl;
1981 /* Given a BLOCK node LET, push decls and levels so as to construct in the
1982 current function a tree of contexts isomorphic to the one that is given.
1984 LEVEL indicates how far down into the BLOCK tree is the node we are
1985 currently traversing. It is always zero except for recursive calls.
1987 MAP, if nonzero, is a pointer to an inline_remap map which indicates how
1988 registers used in the DECL_RTL field should be remapped. If it is zero,
1989 no mapping is necessary. */
1992 integrate_decl_tree (let, level, map)
1995 struct inline_remap *map;
2002 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
2006 push_obstacks_nochange ();
2007 saveable_allocation ();
2011 if (DECL_RTL (t) != 0)
2013 DECL_RTL (d) = copy_rtx_and_substitute (DECL_RTL (t), map);
2014 /* Fully instantiate the address with the equivalent form so that the
2015 debugging information contains the actual register, instead of the
2016 virtual register. Do this by not passing an insn to
2018 subst_constants (&DECL_RTL (d), NULL_RTX, map);
2019 apply_change_group ();
2021 /* These args would always appear unused, if not for this. */
2023 /* Prevent warning for shadowing with these. */
2024 DECL_ABSTRACT_ORIGIN (d) = t;
2026 if (DECL_LANG_SPECIFIC (d))
2032 for (t = BLOCK_SUBBLOCKS (let); t; t = TREE_CHAIN (t))
2033 integrate_decl_tree (t, level + 1, map);
2037 node = poplevel (1, 0, 0);
2040 TREE_USED (node) = TREE_USED (let);
2041 BLOCK_ABSTRACT_ORIGIN (node) = let;
2046 /* Given a BLOCK node LET, search for all DECL_RTL fields, and pass them
2047 through save_constants. */
2050 save_constants_in_decl_trees (let)
2055 for (t = BLOCK_VARS (let); t; t = TREE_CHAIN (t))
2056 if (DECL_RTL (t) != 0)
2057 save_constants (&DECL_RTL (t));
2059 for (t = BLOCK_SUBBLOCKS (let); t; t = TREE_CHAIN (t))
2060 save_constants_in_decl_trees (t);
2063 /* Create a new copy of an rtx.
2064 Recursively copies the operands of the rtx,
2065 except for those few rtx codes that are sharable.
2067 We always return an rtx that is similar to that incoming rtx, with the
2068 exception of possibly changing a REG to a SUBREG or vice versa. No
2069 rtl is ever emitted.
2071 Handle constants that need to be placed in the constant pool by
2072 calling `force_const_mem'. */
2075 copy_rtx_and_substitute (orig, map)
2077 struct inline_remap *map;
2079 register rtx copy, temp;
2081 register RTX_CODE code;
2082 register enum machine_mode mode;
2083 register char *format_ptr;
2089 code = GET_CODE (orig);
2090 mode = GET_MODE (orig);
2095 /* If the stack pointer register shows up, it must be part of
2096 stack-adjustments (*not* because we eliminated the frame pointer!).
2097 Small hard registers are returned as-is. Pseudo-registers
2098 go through their `reg_map'. */
2099 regno = REGNO (orig);
2100 if (regno <= LAST_VIRTUAL_REGISTER)
2102 /* Some hard registers are also mapped,
2103 but others are not translated. */
2104 if (map->reg_map[regno] != 0)
2105 return map->reg_map[regno];
2107 /* If this is the virtual frame pointer, make space in current
2108 function's stack frame for the stack frame of the inline function.
2110 Copy the address of this area into a pseudo. Map
2111 virtual_stack_vars_rtx to this pseudo and set up a constant
2112 equivalence for it to be the address. This will substitute the
2113 address into insns where it can be substituted and use the new
2114 pseudo where it can't. */
2115 if (regno == VIRTUAL_STACK_VARS_REGNUM)
2118 int size = DECL_FRAME_SIZE (map->fndecl);
2122 loc = assign_stack_temp (BLKmode, size, 1);
2123 loc = XEXP (loc, 0);
2124 #ifdef FRAME_GROWS_DOWNWARD
2125 /* In this case, virtual_stack_vars_rtx points to one byte
2126 higher than the top of the frame area. So compute the offset
2127 to one byte higher than our substitute frame.
2128 Keep the fake frame pointer aligned like a real one. */
2129 rounded = CEIL_ROUND (size, BIGGEST_ALIGNMENT / BITS_PER_UNIT);
2130 loc = plus_constant (loc, rounded);
2132 map->reg_map[regno] = temp
2133 = force_reg (Pmode, force_operand (loc, NULL_RTX));
2135 #ifdef STACK_BOUNDARY
2136 mark_reg_pointer (map->reg_map[regno],
2137 STACK_BOUNDARY / BITS_PER_UNIT);
2140 if (REGNO (temp) < map->const_equiv_map_size)
2142 map->const_equiv_map[REGNO (temp)] = loc;
2143 map->const_age_map[REGNO (temp)] = CONST_AGE_PARM;
2146 seq = gen_sequence ();
2148 emit_insn_after (seq, map->insns_at_start);
2151 else if (regno == VIRTUAL_INCOMING_ARGS_REGNUM)
2153 /* Do the same for a block to contain any arguments referenced
2156 int size = FUNCTION_ARGS_SIZE (DECL_SAVED_INSNS (map->fndecl));
2159 loc = assign_stack_temp (BLKmode, size, 1);
2160 loc = XEXP (loc, 0);
2161 /* When arguments grow downward, the virtual incoming
2162 args pointer points to the top of the argument block,
2163 so the remapped location better do the same. */
2164 #ifdef ARGS_GROW_DOWNWARD
2165 loc = plus_constant (loc, size);
2167 map->reg_map[regno] = temp
2168 = force_reg (Pmode, force_operand (loc, NULL_RTX));
2170 #ifdef STACK_BOUNDARY
2171 mark_reg_pointer (map->reg_map[regno],
2172 STACK_BOUNDARY / BITS_PER_UNIT);
2175 if (REGNO (temp) < map->const_equiv_map_size)
2177 map->const_equiv_map[REGNO (temp)] = loc;
2178 map->const_age_map[REGNO (temp)] = CONST_AGE_PARM;
2181 seq = gen_sequence ();
2183 emit_insn_after (seq, map->insns_at_start);
2186 else if (REG_FUNCTION_VALUE_P (orig))
2188 /* This is a reference to the function return value. If
2189 the function doesn't have a return value, error. If the
2190 mode doesn't agree, make a SUBREG. */
2191 if (map->inline_target == 0)
2192 /* Must be unrolling loops or replicating code if we
2193 reach here, so return the register unchanged. */
2195 else if (mode != GET_MODE (map->inline_target))
2196 return gen_lowpart (mode, map->inline_target);
2198 return map->inline_target;
2202 if (map->reg_map[regno] == NULL)
2204 map->reg_map[regno] = gen_reg_rtx (mode);
2205 REG_USERVAR_P (map->reg_map[regno]) = REG_USERVAR_P (orig);
2206 REG_LOOP_TEST_P (map->reg_map[regno]) = REG_LOOP_TEST_P (orig);
2207 RTX_UNCHANGING_P (map->reg_map[regno]) = RTX_UNCHANGING_P (orig);
2208 /* A reg with REG_FUNCTION_VALUE_P true will never reach here. */
2210 if (map->regno_pointer_flag[regno])
2211 mark_reg_pointer (map->reg_map[regno],
2212 map->regno_pointer_align[regno]);
2214 return map->reg_map[regno];
2217 copy = copy_rtx_and_substitute (SUBREG_REG (orig), map);
2218 /* SUBREG is ordinary, but don't make nested SUBREGs. */
2219 if (GET_CODE (copy) == SUBREG)
2220 return gen_rtx (SUBREG, GET_MODE (orig), SUBREG_REG (copy),
2221 SUBREG_WORD (orig) + SUBREG_WORD (copy));
2222 else if (GET_CODE (copy) == CONCAT)
2223 return (subreg_realpart_p (orig) ? XEXP (copy, 0) : XEXP (copy, 1));
2225 return gen_rtx (SUBREG, GET_MODE (orig), copy,
2226 SUBREG_WORD (orig));
2230 /* USE and CLOBBER are ordinary, but we convert (use (subreg foo))
2231 to (use foo) if the original insn didn't have a subreg.
2232 Removing the subreg distorts the VAX movstrhi pattern
2233 by changing the mode of an operand. */
2234 copy = copy_rtx_and_substitute (XEXP (orig, 0), map);
2235 if (GET_CODE (copy) == SUBREG && GET_CODE (XEXP (orig, 0)) != SUBREG)
2236 copy = SUBREG_REG (copy);
2237 return gen_rtx (code, VOIDmode, copy);
2240 LABEL_PRESERVE_P (map->label_map[CODE_LABEL_NUMBER (orig)])
2241 = LABEL_PRESERVE_P (orig);
2242 return map->label_map[CODE_LABEL_NUMBER (orig)];
2245 copy = gen_rtx (LABEL_REF, mode,
2246 LABEL_REF_NONLOCAL_P (orig) ? XEXP (orig, 0)
2247 : map->label_map[CODE_LABEL_NUMBER (XEXP (orig, 0))]);
2248 LABEL_OUTSIDE_LOOP_P (copy) = LABEL_OUTSIDE_LOOP_P (orig);
2250 /* The fact that this label was previously nonlocal does not mean
2251 it still is, so we must check if it is within the range of
2252 this function's labels. */
2253 LABEL_REF_NONLOCAL_P (copy)
2254 = (LABEL_REF_NONLOCAL_P (orig)
2255 && ! (CODE_LABEL_NUMBER (XEXP (copy, 0)) >= get_first_label_num ()
2256 && CODE_LABEL_NUMBER (XEXP (copy, 0)) < max_label_num ()));
2258 /* If we have made a nonlocal label local, it means that this
2259 inlined call will be referring to our nonlocal goto handler.
2260 So make sure we create one for this block; we normally would
2261 not since this is not otherwise considered a "call". */
2262 if (LABEL_REF_NONLOCAL_P (orig) && ! LABEL_REF_NONLOCAL_P (copy))
2263 function_call_count++;
2273 /* Symbols which represent the address of a label stored in the constant
2274 pool must be modified to point to a constant pool entry for the
2275 remapped label. Otherwise, symbols are returned unchanged. */
2276 if (CONSTANT_POOL_ADDRESS_P (orig))
2278 rtx constant = get_pool_constant (orig);
2279 if (GET_CODE (constant) == LABEL_REF)
2280 return XEXP (force_const_mem (Pmode,
2281 copy_rtx_and_substitute (constant,
2289 /* We have to make a new copy of this CONST_DOUBLE because don't want
2290 to use the old value of CONST_DOUBLE_MEM. Also, this may be a
2291 duplicate of a CONST_DOUBLE we have already seen. */
2292 if (GET_MODE_CLASS (GET_MODE (orig)) == MODE_FLOAT)
2296 REAL_VALUE_FROM_CONST_DOUBLE (d, orig);
2297 return CONST_DOUBLE_FROM_REAL_VALUE (d, GET_MODE (orig));
2300 return immed_double_const (CONST_DOUBLE_LOW (orig),
2301 CONST_DOUBLE_HIGH (orig), VOIDmode);
2304 /* Make new constant pool entry for a constant
2305 that was in the pool of the inline function. */
2306 if (RTX_INTEGRATED_P (orig))
2308 /* If this was an address of a constant pool entry that itself
2309 had to be placed in the constant pool, it might not be a
2310 valid address. So the recursive call below might turn it
2311 into a register. In that case, it isn't a constant any
2312 more, so return it. This has the potential of changing a
2313 MEM into a REG, but we'll assume that it safe. */
2314 temp = copy_rtx_and_substitute (XEXP (orig, 0), map);
2315 if (! CONSTANT_P (temp))
2317 return validize_mem (force_const_mem (GET_MODE (orig), temp));
2322 /* If from constant pool address, make new constant pool entry and
2323 return its address. */
2324 if (! RTX_INTEGRATED_P (orig))
2327 temp = force_const_mem (GET_MODE (orig),
2328 copy_rtx_and_substitute (XEXP (orig, 0), map));
2331 /* Legitimizing the address here is incorrect.
2333 The only ADDRESS rtx's that can reach here are ones created by
2334 save_constants. Hence the operand of the ADDRESS is always valid
2335 in this position of the instruction, since the original rtx without
2336 the ADDRESS was valid.
2338 The reason we don't legitimize the address here is that on the
2339 Sparc, the caller may have a (high ...) surrounding this ADDRESS.
2340 This code forces the operand of the address to a register, which
2341 fails because we can not take the HIGH part of a register.
2343 Also, change_address may create new registers. These registers
2344 will not have valid reg_map entries. This can cause try_constants()
2345 to fail because assumes that all registers in the rtx have valid
2346 reg_map entries, and it may end up replacing one of these new
2347 registers with junk. */
2349 if (! memory_address_p (GET_MODE (temp), XEXP (temp, 0)))
2350 temp = change_address (temp, GET_MODE (temp), XEXP (temp, 0));
2353 return XEXP (temp, 0);
2356 /* If a single asm insn contains multiple output operands
2357 then it contains multiple ASM_OPERANDS rtx's that share operand 3.
2358 We must make sure that the copied insn continues to share it. */
2359 if (map->orig_asm_operands_vector == XVEC (orig, 3))
2361 copy = rtx_alloc (ASM_OPERANDS);
2362 copy->volatil = orig->volatil;
2363 XSTR (copy, 0) = XSTR (orig, 0);
2364 XSTR (copy, 1) = XSTR (orig, 1);
2365 XINT (copy, 2) = XINT (orig, 2);
2366 XVEC (copy, 3) = map->copy_asm_operands_vector;
2367 XVEC (copy, 4) = map->copy_asm_constraints_vector;
2368 XSTR (copy, 5) = XSTR (orig, 5);
2369 XINT (copy, 6) = XINT (orig, 6);
2375 /* This is given special treatment because the first
2376 operand of a CALL is a (MEM ...) which may get
2377 forced into a register for cse. This is undesirable
2378 if function-address cse isn't wanted or if we won't do cse. */
2379 #ifndef NO_FUNCTION_CSE
2380 if (! (optimize && ! flag_no_function_cse))
2382 return gen_rtx (CALL, GET_MODE (orig),
2383 gen_rtx (MEM, GET_MODE (XEXP (orig, 0)),
2384 copy_rtx_and_substitute (XEXP (XEXP (orig, 0), 0), map)),
2385 copy_rtx_and_substitute (XEXP (orig, 1), map));
2389 /* Must be ifdefed out for loop unrolling to work. */
2395 /* If this is setting fp or ap, it means that we have a nonlocal goto.
2397 If the nonlocal goto is into the current function,
2398 this will result in unnecessarily bad code, but should work. */
2399 if (SET_DEST (orig) == virtual_stack_vars_rtx
2400 || SET_DEST (orig) == virtual_incoming_args_rtx)
2401 return gen_rtx (SET, VOIDmode, SET_DEST (orig),
2402 copy_rtx_and_substitute (SET_SRC (orig), map));
2406 copy = rtx_alloc (MEM);
2407 PUT_MODE (copy, mode);
2408 XEXP (copy, 0) = copy_rtx_and_substitute (XEXP (orig, 0), map);
2409 MEM_IN_STRUCT_P (copy) = MEM_IN_STRUCT_P (orig);
2410 MEM_VOLATILE_P (copy) = MEM_VOLATILE_P (orig);
2412 /* If doing function inlining, this MEM might not be const in the
2413 function that it is being inlined into, and thus may not be
2414 unchanging after function inlining. Constant pool references are
2415 handled elsewhere, so this doesn't lose RTX_UNCHANGING_P bits
2417 if (! map->integrating)
2418 RTX_UNCHANGING_P (copy) = RTX_UNCHANGING_P (orig);
2423 copy = rtx_alloc (code);
2424 PUT_MODE (copy, mode);
2425 copy->in_struct = orig->in_struct;
2426 copy->volatil = orig->volatil;
2427 copy->unchanging = orig->unchanging;
2429 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
2431 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
2433 switch (*format_ptr++)
2439 XEXP (copy, i) = copy_rtx_and_substitute (XEXP (orig, i), map);
2443 /* Change any references to old-insns to point to the
2444 corresponding copied insns. */
2445 XEXP (copy, i) = map->insn_map[INSN_UID (XEXP (orig, i))];
2449 XVEC (copy, i) = XVEC (orig, i);
2450 if (XVEC (orig, i) != NULL && XVECLEN (orig, i) != 0)
2452 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
2453 for (j = 0; j < XVECLEN (copy, i); j++)
2454 XVECEXP (copy, i, j)
2455 = copy_rtx_and_substitute (XVECEXP (orig, i, j), map);
2460 XWINT (copy, i) = XWINT (orig, i);
2464 XINT (copy, i) = XINT (orig, i);
2468 XSTR (copy, i) = XSTR (orig, i);
2476 if (code == ASM_OPERANDS && map->orig_asm_operands_vector == 0)
2478 map->orig_asm_operands_vector = XVEC (orig, 3);
2479 map->copy_asm_operands_vector = XVEC (copy, 3);
2480 map->copy_asm_constraints_vector = XVEC (copy, 4);
2486 /* Substitute known constant values into INSN, if that is valid. */
2489 try_constants (insn, map)
2491 struct inline_remap *map;
2496 subst_constants (&PATTERN (insn), insn, map);
2498 /* Apply the changes if they are valid; otherwise discard them. */
2499 apply_change_group ();
2501 /* Show we don't know the value of anything stored or clobbered. */
2502 note_stores (PATTERN (insn), mark_stores);
2503 map->last_pc_value = 0;
2505 map->last_cc0_value = 0;
2508 /* Set up any constant equivalences made in this insn. */
2509 for (i = 0; i < map->num_sets; i++)
2511 if (GET_CODE (map->equiv_sets[i].dest) == REG)
2513 int regno = REGNO (map->equiv_sets[i].dest);
2515 if (regno < map->const_equiv_map_size
2516 && (map->const_equiv_map[regno] == 0
2517 /* Following clause is a hack to make case work where GNU C++
2518 reassigns a variable to make cse work right. */
2519 || ! rtx_equal_p (map->const_equiv_map[regno],
2520 map->equiv_sets[i].equiv)))
2522 map->const_equiv_map[regno] = map->equiv_sets[i].equiv;
2523 map->const_age_map[regno] = map->const_age;
2526 else if (map->equiv_sets[i].dest == pc_rtx)
2527 map->last_pc_value = map->equiv_sets[i].equiv;
2529 else if (map->equiv_sets[i].dest == cc0_rtx)
2530 map->last_cc0_value = map->equiv_sets[i].equiv;
2535 /* Substitute known constants for pseudo regs in the contents of LOC,
2536 which are part of INSN.
2537 If INSN is zero, the substitution should always be done (this is used to
2539 These changes are taken out by try_constants if the result is not valid.
2541 Note that we are more concerned with determining when the result of a SET
2542 is a constant, for further propagation, than actually inserting constants
2543 into insns; cse will do the latter task better.
2545 This function is also used to adjust address of items previously addressed
2546 via the virtual stack variable or virtual incoming arguments registers. */
2549 subst_constants (loc, insn, map)
2552 struct inline_remap *map;
2556 register enum rtx_code code;
2557 register char *format_ptr;
2558 int num_changes = num_validated_changes ();
2560 enum machine_mode op0_mode;
2562 code = GET_CODE (x);
2577 validate_change (insn, loc, map->last_cc0_value, 1);
2583 /* The only thing we can do with a USE or CLOBBER is possibly do
2584 some substitutions in a MEM within it. */
2585 if (GET_CODE (XEXP (x, 0)) == MEM)
2586 subst_constants (&XEXP (XEXP (x, 0), 0), insn, map);
2590 /* Substitute for parms and known constants. Don't replace
2591 hard regs used as user variables with constants. */
2593 int regno = REGNO (x);
2595 if (! (regno < FIRST_PSEUDO_REGISTER && REG_USERVAR_P (x))
2596 && regno < map->const_equiv_map_size
2597 && map->const_equiv_map[regno] != 0
2598 && map->const_age_map[regno] >= map->const_age)
2599 validate_change (insn, loc, map->const_equiv_map[regno], 1);
2604 /* SUBREG applied to something other than a reg
2605 should be treated as ordinary, since that must
2606 be a special hack and we don't know how to treat it specially.
2607 Consider for example mulsidi3 in m68k.md.
2608 Ordinary SUBREG of a REG needs this special treatment. */
2609 if (GET_CODE (SUBREG_REG (x)) == REG)
2611 rtx inner = SUBREG_REG (x);
2614 /* We can't call subst_constants on &SUBREG_REG (x) because any
2615 constant or SUBREG wouldn't be valid inside our SUBEG. Instead,
2616 see what is inside, try to form the new SUBREG and see if that is
2617 valid. We handle two cases: extracting a full word in an
2618 integral mode and extracting the low part. */
2619 subst_constants (&inner, NULL_RTX, map);
2621 if (GET_MODE_CLASS (GET_MODE (x)) == MODE_INT
2622 && GET_MODE_SIZE (GET_MODE (x)) == UNITS_PER_WORD
2623 && GET_MODE (SUBREG_REG (x)) != VOIDmode)
2624 new = operand_subword (inner, SUBREG_WORD (x), 0,
2625 GET_MODE (SUBREG_REG (x)));
2627 if (new == 0 && subreg_lowpart_p (x))
2628 new = gen_lowpart_common (GET_MODE (x), inner);
2631 validate_change (insn, loc, new, 1);
2638 subst_constants (&XEXP (x, 0), insn, map);
2640 /* If a memory address got spoiled, change it back. */
2641 if (insn != 0 && num_validated_changes () != num_changes
2642 && !memory_address_p (GET_MODE (x), XEXP (x, 0)))
2643 cancel_changes (num_changes);
2648 /* Substitute constants in our source, and in any arguments to a
2649 complex (e..g, ZERO_EXTRACT) destination, but not in the destination
2651 rtx *dest_loc = &SET_DEST (x);
2652 rtx dest = *dest_loc;
2655 subst_constants (&SET_SRC (x), insn, map);
2658 while (GET_CODE (*dest_loc) == ZERO_EXTRACT
2659 || GET_CODE (*dest_loc) == SUBREG
2660 || GET_CODE (*dest_loc) == STRICT_LOW_PART)
2662 if (GET_CODE (*dest_loc) == ZERO_EXTRACT)
2664 subst_constants (&XEXP (*dest_loc, 1), insn, map);
2665 subst_constants (&XEXP (*dest_loc, 2), insn, map);
2667 dest_loc = &XEXP (*dest_loc, 0);
2670 /* Do substitute in the address of a destination in memory. */
2671 if (GET_CODE (*dest_loc) == MEM)
2672 subst_constants (&XEXP (*dest_loc, 0), insn, map);
2674 /* Check for the case of DEST a SUBREG, both it and the underlying
2675 register are less than one word, and the SUBREG has the wider mode.
2676 In the case, we are really setting the underlying register to the
2677 source converted to the mode of DEST. So indicate that. */
2678 if (GET_CODE (dest) == SUBREG
2679 && GET_MODE_SIZE (GET_MODE (dest)) <= UNITS_PER_WORD
2680 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest))) <= UNITS_PER_WORD
2681 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest)))
2682 <= GET_MODE_SIZE (GET_MODE (dest)))
2683 && (tem = gen_lowpart_if_possible (GET_MODE (SUBREG_REG (dest)),
2685 src = tem, dest = SUBREG_REG (dest);
2687 /* If storing a recognizable value save it for later recording. */
2688 if ((map->num_sets < MAX_RECOG_OPERANDS)
2689 && (CONSTANT_P (src)
2690 || (GET_CODE (src) == REG
2691 && (REGNO (src) == VIRTUAL_INCOMING_ARGS_REGNUM
2692 || REGNO (src) == VIRTUAL_STACK_VARS_REGNUM))
2693 || (GET_CODE (src) == PLUS
2694 && GET_CODE (XEXP (src, 0)) == REG
2695 && (REGNO (XEXP (src, 0)) == VIRTUAL_INCOMING_ARGS_REGNUM
2696 || REGNO (XEXP (src, 0)) == VIRTUAL_STACK_VARS_REGNUM)
2697 && CONSTANT_P (XEXP (src, 1)))
2698 || GET_CODE (src) == COMPARE
2703 && (src == pc_rtx || GET_CODE (src) == RETURN
2704 || GET_CODE (src) == LABEL_REF))))
2706 /* Normally, this copy won't do anything. But, if SRC is a COMPARE
2707 it will cause us to save the COMPARE with any constants
2708 substituted, which is what we want for later. */
2709 map->equiv_sets[map->num_sets].equiv = copy_rtx (src);
2710 map->equiv_sets[map->num_sets++].dest = dest;
2717 format_ptr = GET_RTX_FORMAT (code);
2719 /* If the first operand is an expression, save its mode for later. */
2720 if (*format_ptr == 'e')
2721 op0_mode = GET_MODE (XEXP (x, 0));
2723 for (i = 0; i < GET_RTX_LENGTH (code); i++)
2725 switch (*format_ptr++)
2732 subst_constants (&XEXP (x, i), insn, map);
2742 if (XVEC (x, i) != NULL && XVECLEN (x, i) != 0)
2745 for (j = 0; j < XVECLEN (x, i); j++)
2746 subst_constants (&XVECEXP (x, i, j), insn, map);
2755 /* If this is a commutative operation, move a constant to the second
2756 operand unless the second operand is already a CONST_INT. */
2757 if ((GET_RTX_CLASS (code) == 'c' || code == NE || code == EQ)
2758 && CONSTANT_P (XEXP (x, 0)) && GET_CODE (XEXP (x, 1)) != CONST_INT)
2760 rtx tem = XEXP (x, 0);
2761 validate_change (insn, &XEXP (x, 0), XEXP (x, 1), 1);
2762 validate_change (insn, &XEXP (x, 1), tem, 1);
2765 /* Simplify the expression in case we put in some constants. */
2766 switch (GET_RTX_CLASS (code))
2769 new = simplify_unary_operation (code, GET_MODE (x),
2770 XEXP (x, 0), op0_mode);
2775 enum machine_mode op_mode = GET_MODE (XEXP (x, 0));
2776 if (op_mode == VOIDmode)
2777 op_mode = GET_MODE (XEXP (x, 1));
2778 new = simplify_relational_operation (code, op_mode,
2779 XEXP (x, 0), XEXP (x, 1));
2780 #ifdef FLOAT_STORE_FLAG_VALUE
2781 if (new != 0 && GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT)
2782 new = ((new == const0_rtx) ? CONST0_RTX (GET_MODE (x))
2783 : CONST_DOUBLE_FROM_REAL_VALUE (FLOAT_STORE_FLAG_VALUE,
2791 new = simplify_binary_operation (code, GET_MODE (x),
2792 XEXP (x, 0), XEXP (x, 1));
2797 new = simplify_ternary_operation (code, GET_MODE (x), op0_mode,
2798 XEXP (x, 0), XEXP (x, 1), XEXP (x, 2));
2803 validate_change (insn, loc, new, 1);
2806 /* Show that register modified no longer contain known constants. We are
2807 called from note_stores with parts of the new insn. */
2810 mark_stores (dest, x)
2815 enum machine_mode mode;
2817 /* DEST is always the innermost thing set, except in the case of
2818 SUBREGs of hard registers. */
2820 if (GET_CODE (dest) == REG)
2821 regno = REGNO (dest), mode = GET_MODE (dest);
2822 else if (GET_CODE (dest) == SUBREG && GET_CODE (SUBREG_REG (dest)) == REG)
2824 regno = REGNO (SUBREG_REG (dest)) + SUBREG_WORD (dest);
2825 mode = GET_MODE (SUBREG_REG (dest));
2830 int last_reg = (regno >= FIRST_PSEUDO_REGISTER ? regno
2831 : regno + HARD_REGNO_NREGS (regno, mode) - 1);
2834 for (i = regno; i <= last_reg; i++)
2835 if (i < global_const_equiv_map_size)
2836 global_const_equiv_map[i] = 0;
2840 /* If any CONST expressions with RTX_INTEGRATED_P are present in the rtx
2841 pointed to by PX, they represent constants in the constant pool.
2842 Replace these with a new memory reference obtained from force_const_mem.
2843 Similarly, ADDRESS expressions with RTX_INTEGRATED_P represent the
2844 address of a constant pool entry. Replace them with the address of
2845 a new constant pool entry obtained from force_const_mem. */
2848 restore_constants (px)
2858 if (GET_CODE (x) == CONST_DOUBLE)
2860 /* We have to make a new CONST_DOUBLE to ensure that we account for
2861 it correctly. Using the old CONST_DOUBLE_MEM data is wrong. */
2862 if (GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT)
2866 REAL_VALUE_FROM_CONST_DOUBLE (d, x);
2867 *px = CONST_DOUBLE_FROM_REAL_VALUE (d, GET_MODE (x));
2870 *px = immed_double_const (CONST_DOUBLE_LOW (x), CONST_DOUBLE_HIGH (x),
2874 else if (RTX_INTEGRATED_P (x) && GET_CODE (x) == CONST)
2876 restore_constants (&XEXP (x, 0));
2877 *px = validize_mem (force_const_mem (GET_MODE (x), XEXP (x, 0)));
2879 else if (RTX_INTEGRATED_P (x) && GET_CODE (x) == SUBREG)
2881 /* This must be (subreg/i:M1 (const/i:M2 ...) 0). */
2882 rtx new = XEXP (SUBREG_REG (x), 0);
2884 restore_constants (&new);
2885 new = force_const_mem (GET_MODE (SUBREG_REG (x)), new);
2886 PUT_MODE (new, GET_MODE (x));
2887 *px = validize_mem (new);
2889 else if (RTX_INTEGRATED_P (x) && GET_CODE (x) == ADDRESS)
2891 restore_constants (&XEXP (x, 0));
2892 *px = XEXP (force_const_mem (GET_MODE (x), XEXP (x, 0)), 0);
2896 fmt = GET_RTX_FORMAT (GET_CODE (x));
2897 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (x)); i++)
2902 for (j = 0; j < XVECLEN (x, i); j++)
2903 restore_constants (&XVECEXP (x, i, j));
2907 restore_constants (&XEXP (x, i));
2914 /* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the
2915 given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so
2916 that it points to the node itself, thus indicating that the node is its
2917 own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for
2918 the given node is NULL, recursively descend the decl/block tree which
2919 it is the root of, and for each other ..._DECL or BLOCK node contained
2920 therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also
2921 still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN
2922 values to point to themselves. */
2925 set_block_origin_self (stmt)
2928 if (BLOCK_ABSTRACT_ORIGIN (stmt) == NULL_TREE)
2930 BLOCK_ABSTRACT_ORIGIN (stmt) = stmt;
2933 register tree local_decl;
2935 for (local_decl = BLOCK_VARS (stmt);
2936 local_decl != NULL_TREE;
2937 local_decl = TREE_CHAIN (local_decl))
2938 set_decl_origin_self (local_decl); /* Potential recursion. */
2942 register tree subblock;
2944 for (subblock = BLOCK_SUBBLOCKS (stmt);
2945 subblock != NULL_TREE;
2946 subblock = BLOCK_CHAIN (subblock))
2947 set_block_origin_self (subblock); /* Recurse. */
2952 /* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for
2953 the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the
2954 node to so that it points to the node itself, thus indicating that the
2955 node represents its own (abstract) origin. Additionally, if the
2956 DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend
2957 the decl/block tree of which the given node is the root of, and for
2958 each other ..._DECL or BLOCK node contained therein whose
2959 DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL,
2960 set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to
2961 point to themselves. */
2964 set_decl_origin_self (decl)
2967 if (DECL_ABSTRACT_ORIGIN (decl) == NULL_TREE)
2969 DECL_ABSTRACT_ORIGIN (decl) = decl;
2970 if (TREE_CODE (decl) == FUNCTION_DECL)
2974 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2975 DECL_ABSTRACT_ORIGIN (arg) = arg;
2976 if (DECL_INITIAL (decl) != NULL_TREE
2977 && DECL_INITIAL (decl) != error_mark_node)
2978 set_block_origin_self (DECL_INITIAL (decl));
2983 /* Given a pointer to some BLOCK node, and a boolean value to set the
2984 "abstract" flags to, set that value into the BLOCK_ABSTRACT flag for
2985 the given block, and for all local decls and all local sub-blocks
2986 (recursively) which are contained therein. */
2989 set_block_abstract_flags (stmt, setting)
2991 register int setting;
2993 register tree local_decl;
2994 register tree subblock;
2996 BLOCK_ABSTRACT (stmt) = setting;
2998 for (local_decl = BLOCK_VARS (stmt);
2999 local_decl != NULL_TREE;
3000 local_decl = TREE_CHAIN (local_decl))
3001 set_decl_abstract_flags (local_decl, setting);
3003 for (subblock = BLOCK_SUBBLOCKS (stmt);
3004 subblock != NULL_TREE;
3005 subblock = BLOCK_CHAIN (subblock))
3006 set_block_abstract_flags (subblock, setting);
3009 /* Given a pointer to some ..._DECL node, and a boolean value to set the
3010 "abstract" flags to, set that value into the DECL_ABSTRACT flag for the
3011 given decl, and (in the case where the decl is a FUNCTION_DECL) also
3012 set the abstract flags for all of the parameters, local vars, local
3013 blocks and sub-blocks (recursively) to the same setting. */
3016 set_decl_abstract_flags (decl, setting)
3018 register int setting;
3020 DECL_ABSTRACT (decl) = setting;
3021 if (TREE_CODE (decl) == FUNCTION_DECL)
3025 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
3026 DECL_ABSTRACT (arg) = setting;
3027 if (DECL_INITIAL (decl) != NULL_TREE
3028 && DECL_INITIAL (decl) != error_mark_node)
3029 set_block_abstract_flags (DECL_INITIAL (decl), setting);
3033 /* Output the assembly language code for the function FNDECL
3034 from its DECL_SAVED_INSNS. Used for inline functions that are output
3035 at end of compilation instead of where they came in the source. */
3038 output_inline_function (fndecl)
3043 int save_flag_no_inline = flag_no_inline;
3045 if (output_bytecode)
3047 warning ("`inline' ignored for bytecode output");
3051 /* Things we allocate from here on are part of this function, not
3053 temporary_allocation ();
3055 head = DECL_SAVED_INSNS (fndecl);
3056 current_function_decl = fndecl;
3058 /* This call is only used to initialize global variables. */
3059 init_function_start (fndecl, "lossage", 1);
3061 /* Redo parameter determinations in case the FUNCTION_...
3062 macros took machine-specific actions that need to be redone. */
3063 assign_parms (fndecl, 1);
3065 /* Set stack frame size. */
3066 assign_stack_local (BLKmode, DECL_FRAME_SIZE (fndecl), 0);
3068 /* The first is a bit of a lie (the array may be larger), but doesn't
3069 matter too much and it isn't worth saving the actual bound. */
3070 reg_rtx_no = regno_pointer_flag_length = MAX_REGNUM (head);
3071 regno_reg_rtx = (rtx *) INLINE_REGNO_REG_RTX (head);
3072 regno_pointer_flag = INLINE_REGNO_POINTER_FLAG (head);
3073 regno_pointer_align = INLINE_REGNO_POINTER_ALIGN (head);
3075 stack_slot_list = STACK_SLOT_LIST (head);
3076 forced_labels = FORCED_LABELS (head);
3078 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_CALLS_ALLOCA)
3079 current_function_calls_alloca = 1;
3081 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_CALLS_SETJMP)
3082 current_function_calls_setjmp = 1;
3084 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_CALLS_LONGJMP)
3085 current_function_calls_longjmp = 1;
3087 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_RETURNS_STRUCT)
3088 current_function_returns_struct = 1;
3090 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_RETURNS_PCC_STRUCT)
3091 current_function_returns_pcc_struct = 1;
3093 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_NEEDS_CONTEXT)
3094 current_function_needs_context = 1;
3096 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_HAS_NONLOCAL_LABEL)
3097 current_function_has_nonlocal_label = 1;
3099 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_RETURNS_POINTER)
3100 current_function_returns_pointer = 1;
3102 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_USES_CONST_POOL)
3103 current_function_uses_const_pool = 1;
3105 if (FUNCTION_FLAGS (head) & FUNCTION_FLAGS_USES_PIC_OFFSET_TABLE)
3106 current_function_uses_pic_offset_table = 1;
3108 current_function_outgoing_args_size = OUTGOING_ARGS_SIZE (head);
3109 current_function_pops_args = POPS_ARGS (head);
3111 /* This is the only thing the expand_function_end call that uses to be here
3112 actually does and that call can cause problems. */
3113 immediate_size_expand--;
3115 /* Find last insn and rebuild the constant pool. */
3116 for (last = FIRST_PARM_INSN (head);
3117 NEXT_INSN (last); last = NEXT_INSN (last))
3119 if (GET_RTX_CLASS (GET_CODE (last)) == 'i')
3121 restore_constants (&PATTERN (last));
3122 restore_constants (®_NOTES (last));
3126 set_new_first_and_last_insn (FIRST_PARM_INSN (head), last);
3127 set_new_first_and_last_label_num (FIRST_LABELNO (head), LAST_LABELNO (head));
3129 /* We must have already output DWARF debugging information for the
3130 original (abstract) inline function declaration/definition, so
3131 we want to make sure that the debugging information we generate
3132 for this special instance of the inline function refers back to
3133 the information we already generated. To make sure that happens,
3134 we simply have to set the DECL_ABSTRACT_ORIGIN for the function
3135 node (and for all of the local ..._DECL nodes which are its children)
3136 so that they all point to themselves. */
3138 set_decl_origin_self (fndecl);
3140 /* We're not deferring this any longer. */
3141 DECL_DEFER_OUTPUT (fndecl) = 0;
3143 /* Integrating function calls isn't safe anymore, so turn on
3147 /* Compile this function all the way down to assembly code. */
3148 rest_of_compilation (fndecl);
3150 /* Reset flag_no_inline to its original value. */
3151 flag_no_inline = save_flag_no_inline;
3153 current_function_decl = 0;