g-expect-vms.adb:
[gcc.git] / gcc / tree-inline.c
1 /* Tree inlining.
2 Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007
3 Free Software Foundation, Inc.
4 Contributed by Alexandre Oliva <aoliva@redhat.com>
5
6 This file is part of GCC.
7
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
11 any later version.
12
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
17
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
21 Boston, MA 02110-1301, USA. */
22
23 #include "config.h"
24 #include "system.h"
25 #include "coretypes.h"
26 #include "tm.h"
27 #include "toplev.h"
28 #include "tree.h"
29 #include "tree-inline.h"
30 #include "rtl.h"
31 #include "expr.h"
32 #include "flags.h"
33 #include "params.h"
34 #include "input.h"
35 #include "insn-config.h"
36 #include "varray.h"
37 #include "hashtab.h"
38 #include "langhooks.h"
39 #include "basic-block.h"
40 #include "tree-iterator.h"
41 #include "cgraph.h"
42 #include "intl.h"
43 #include "tree-mudflap.h"
44 #include "tree-flow.h"
45 #include "function.h"
46 #include "ggc.h"
47 #include "tree-flow.h"
48 #include "diagnostic.h"
49 #include "except.h"
50 #include "debug.h"
51 #include "pointer-set.h"
52 #include "ipa-prop.h"
53 #include "value-prof.h"
54 #include "tree-pass.h"
55
56 /* I'm not real happy about this, but we need to handle gimple and
57 non-gimple trees. */
58 #include "tree-gimple.h"
59
60 /* Inlining, Cloning, Versioning, Parallelization
61
62 Inlining: a function body is duplicated, but the PARM_DECLs are
63 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
64 GIMPLE_MODIFY_STMTs that store to a dedicated returned-value variable.
65 The duplicated eh_region info of the copy will later be appended
66 to the info for the caller; the eh_region info in copied throwing
67 statements and RESX_EXPRs is adjusted accordingly.
68
69 Cloning: (only in C++) We have one body for a con/de/structor, and
70 multiple function decls, each with a unique parameter list.
71 Duplicate the body, using the given splay tree; some parameters
72 will become constants (like 0 or 1).
73
74 Versioning: a function body is duplicated and the result is a new
75 function rather than into blocks of an existing function as with
76 inlining. Some parameters will become constants.
77
78 Parallelization: a region of a function is duplicated resulting in
79 a new function. Variables may be replaced with complex expressions
80 to enable shared variable semantics.
81
82 All of these will simultaneously lookup any callgraph edges. If
83 we're going to inline the duplicated function body, and the given
84 function has some cloned callgraph nodes (one for each place this
85 function will be inlined) those callgraph edges will be duplicated.
86 If we're cloning the body, those callgraph edges will be
87 updated to point into the new body. (Note that the original
88 callgraph node and edge list will not be altered.)
89
90 See the CALL_EXPR handling case in copy_body_r (). */
91
92 /* 0 if we should not perform inlining.
93 1 if we should expand functions calls inline at the tree level.
94 2 if we should consider *all* functions to be inline
95 candidates. */
96
97 int flag_inline_trees = 0;
98
99 /* To Do:
100
101 o In order to make inlining-on-trees work, we pessimized
102 function-local static constants. In particular, they are now
103 always output, even when not addressed. Fix this by treating
104 function-local static constants just like global static
105 constants; the back-end already knows not to output them if they
106 are not needed.
107
108 o Provide heuristics to clamp inlining of recursive template
109 calls? */
110
111
112 /* Weights that estimate_num_insns uses for heuristics in inlining. */
113
114 eni_weights eni_inlining_weights;
115
116 /* Weights that estimate_num_insns uses to estimate the size of the
117 produced code. */
118
119 eni_weights eni_size_weights;
120
121 /* Weights that estimate_num_insns uses to estimate the time necessary
122 to execute the produced code. */
123
124 eni_weights eni_time_weights;
125
126 /* Prototypes. */
127
128 static tree declare_return_variable (copy_body_data *, tree, tree, tree *);
129 static tree copy_generic_body (copy_body_data *);
130 static bool inlinable_function_p (tree);
131 static void remap_block (tree *, copy_body_data *);
132 static tree remap_decls (tree, copy_body_data *);
133 static void copy_bind_expr (tree *, int *, copy_body_data *);
134 static tree mark_local_for_remap_r (tree *, int *, void *);
135 static void unsave_expr_1 (tree);
136 static tree unsave_r (tree *, int *, void *);
137 static void declare_inline_vars (tree, tree);
138 static void remap_save_expr (tree *, void *, int *);
139 static void add_lexical_block (tree current_block, tree new_block);
140 static tree copy_decl_to_var (tree, copy_body_data *);
141 static tree copy_result_decl_to_var (tree, copy_body_data *);
142 static tree copy_decl_no_change (tree, copy_body_data *);
143 static tree copy_decl_maybe_to_var (tree, copy_body_data *);
144
145 /* Insert a tree->tree mapping for ID. Despite the name suggests
146 that the trees should be variables, it is used for more than that. */
147
148 void
149 insert_decl_map (copy_body_data *id, tree key, tree value)
150 {
151 *pointer_map_insert (id->decl_map, key) = value;
152
153 /* Always insert an identity map as well. If we see this same new
154 node again, we won't want to duplicate it a second time. */
155 if (key != value)
156 *pointer_map_insert (id->decl_map, value) = value;
157 }
158
159 /* Construct new SSA name for old NAME. ID is the inline context. */
160
161 static tree
162 remap_ssa_name (tree name, copy_body_data *id)
163 {
164 tree new;
165 tree *n;
166
167 gcc_assert (TREE_CODE (name) == SSA_NAME);
168
169 n = (tree *) pointer_map_contains (id->decl_map, name);
170 if (n)
171 return *n;
172
173 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
174 in copy_bb. */
175 new = remap_decl (SSA_NAME_VAR (name), id);
176 /* We might've substituted constant or another SSA_NAME for
177 the variable.
178
179 Replace the SSA name representing RESULT_DECL by variable during
180 inlining: this saves us from need to introduce PHI node in a case
181 return value is just partly initialized. */
182 if ((TREE_CODE (new) == VAR_DECL || TREE_CODE (new) == PARM_DECL)
183 && (TREE_CODE (SSA_NAME_VAR (name)) != RESULT_DECL
184 || !id->transform_return_to_modify))
185 {
186 new = make_ssa_name (new, NULL);
187 insert_decl_map (id, name, new);
188 if (IS_EMPTY_STMT (SSA_NAME_DEF_STMT (name)))
189 {
190 SSA_NAME_DEF_STMT (new) = build_empty_stmt ();
191 if (gimple_default_def (id->src_cfun, SSA_NAME_VAR (name)) == name)
192 set_default_def (SSA_NAME_VAR (new), new);
193 }
194 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new)
195 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name);
196 TREE_TYPE (new) = TREE_TYPE (SSA_NAME_VAR (new));
197 }
198 else
199 insert_decl_map (id, name, new);
200 return new;
201 }
202
203 /* Remap DECL during the copying of the BLOCK tree for the function. */
204
205 tree
206 remap_decl (tree decl, copy_body_data *id)
207 {
208 tree *n;
209 tree fn;
210
211 /* We only remap local variables in the current function. */
212 fn = id->src_fn;
213
214 /* See if we have remapped this declaration. */
215
216 n = (tree *) pointer_map_contains (id->decl_map, decl);
217
218 /* If we didn't already have an equivalent for this declaration,
219 create one now. */
220 if (!n)
221 {
222 /* Make a copy of the variable or label. */
223 tree t = id->copy_decl (decl, id);
224
225 /* Remember it, so that if we encounter this local entity again
226 we can reuse this copy. Do this early because remap_type may
227 need this decl for TYPE_STUB_DECL. */
228 insert_decl_map (id, decl, t);
229
230 if (!DECL_P (t))
231 return t;
232
233 /* Remap types, if necessary. */
234 TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
235 if (TREE_CODE (t) == TYPE_DECL)
236 DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
237
238 /* Remap sizes as necessary. */
239 walk_tree (&DECL_SIZE (t), copy_body_r, id, NULL);
240 walk_tree (&DECL_SIZE_UNIT (t), copy_body_r, id, NULL);
241
242 /* If fields, do likewise for offset and qualifier. */
243 if (TREE_CODE (t) == FIELD_DECL)
244 {
245 walk_tree (&DECL_FIELD_OFFSET (t), copy_body_r, id, NULL);
246 if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
247 walk_tree (&DECL_QUALIFIER (t), copy_body_r, id, NULL);
248 }
249
250 if (cfun && gimple_in_ssa_p (cfun)
251 && (TREE_CODE (t) == VAR_DECL
252 || TREE_CODE (t) == RESULT_DECL || TREE_CODE (t) == PARM_DECL))
253 {
254 tree def = gimple_default_def (id->src_cfun, decl);
255 get_var_ann (t);
256 if (TREE_CODE (decl) != PARM_DECL && def)
257 {
258 tree map = remap_ssa_name (def, id);
259 /* Watch out RESULT_DECLs whose SSA names map directly
260 to them. */
261 if (TREE_CODE (map) == SSA_NAME)
262 set_default_def (t, map);
263 }
264 add_referenced_var (t);
265 }
266 return t;
267 }
268
269 return unshare_expr (*n);
270 }
271
272 static tree
273 remap_type_1 (tree type, copy_body_data *id)
274 {
275 tree *node;
276 tree new, t;
277
278 if (type == NULL)
279 return type;
280
281 /* See if we have remapped this type. */
282 node = (tree *) pointer_map_contains (id->decl_map, type);
283 if (node)
284 return *node;
285
286 /* The type only needs remapping if it's variably modified. */
287 if (! variably_modified_type_p (type, id->src_fn))
288 {
289 insert_decl_map (id, type, type);
290 return type;
291 }
292
293 /* We do need a copy. build and register it now. If this is a pointer or
294 reference type, remap the designated type and make a new pointer or
295 reference type. */
296 if (TREE_CODE (type) == POINTER_TYPE)
297 {
298 new = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
299 TYPE_MODE (type),
300 TYPE_REF_CAN_ALIAS_ALL (type));
301 insert_decl_map (id, type, new);
302 return new;
303 }
304 else if (TREE_CODE (type) == REFERENCE_TYPE)
305 {
306 new = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
307 TYPE_MODE (type),
308 TYPE_REF_CAN_ALIAS_ALL (type));
309 insert_decl_map (id, type, new);
310 return new;
311 }
312 else
313 new = copy_node (type);
314
315 insert_decl_map (id, type, new);
316
317 /* This is a new type, not a copy of an old type. Need to reassociate
318 variants. We can handle everything except the main variant lazily. */
319 t = TYPE_MAIN_VARIANT (type);
320 if (type != t)
321 {
322 t = remap_type (t, id);
323 TYPE_MAIN_VARIANT (new) = t;
324 TYPE_NEXT_VARIANT (new) = TYPE_MAIN_VARIANT (t);
325 TYPE_NEXT_VARIANT (t) = new;
326 }
327 else
328 {
329 TYPE_MAIN_VARIANT (new) = new;
330 TYPE_NEXT_VARIANT (new) = NULL;
331 }
332
333 if (TYPE_STUB_DECL (type))
334 TYPE_STUB_DECL (new) = remap_decl (TYPE_STUB_DECL (type), id);
335
336 /* Lazily create pointer and reference types. */
337 TYPE_POINTER_TO (new) = NULL;
338 TYPE_REFERENCE_TO (new) = NULL;
339
340 switch (TREE_CODE (new))
341 {
342 case INTEGER_TYPE:
343 case REAL_TYPE:
344 case ENUMERAL_TYPE:
345 case BOOLEAN_TYPE:
346 t = TYPE_MIN_VALUE (new);
347 if (t && TREE_CODE (t) != INTEGER_CST)
348 walk_tree (&TYPE_MIN_VALUE (new), copy_body_r, id, NULL);
349
350 t = TYPE_MAX_VALUE (new);
351 if (t && TREE_CODE (t) != INTEGER_CST)
352 walk_tree (&TYPE_MAX_VALUE (new), copy_body_r, id, NULL);
353 return new;
354
355 case FUNCTION_TYPE:
356 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
357 walk_tree (&TYPE_ARG_TYPES (new), copy_body_r, id, NULL);
358 return new;
359
360 case ARRAY_TYPE:
361 TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
362 TYPE_DOMAIN (new) = remap_type (TYPE_DOMAIN (new), id);
363 break;
364
365 case RECORD_TYPE:
366 case UNION_TYPE:
367 case QUAL_UNION_TYPE:
368 {
369 tree f, nf = NULL;
370
371 for (f = TYPE_FIELDS (new); f ; f = TREE_CHAIN (f))
372 {
373 t = remap_decl (f, id);
374 DECL_CONTEXT (t) = new;
375 TREE_CHAIN (t) = nf;
376 nf = t;
377 }
378 TYPE_FIELDS (new) = nreverse (nf);
379 }
380 break;
381
382 case OFFSET_TYPE:
383 default:
384 /* Shouldn't have been thought variable sized. */
385 gcc_unreachable ();
386 }
387
388 walk_tree (&TYPE_SIZE (new), copy_body_r, id, NULL);
389 walk_tree (&TYPE_SIZE_UNIT (new), copy_body_r, id, NULL);
390
391 return new;
392 }
393
394 tree
395 remap_type (tree type, copy_body_data *id)
396 {
397 tree *node;
398
399 if (type == NULL)
400 return type;
401
402 /* See if we have remapped this type. */
403 node = (tree *) pointer_map_contains (id->decl_map, type);
404 if (node)
405 return *node;
406
407 /* The type only needs remapping if it's variably modified. */
408 if (! variably_modified_type_p (type, id->src_fn))
409 {
410 insert_decl_map (id, type, type);
411 return type;
412 }
413
414 return remap_type_1 (type, id);
415 }
416
417 static tree
418 remap_decls (tree decls, copy_body_data *id)
419 {
420 tree old_var;
421 tree new_decls = NULL_TREE;
422
423 /* Remap its variables. */
424 for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
425 {
426 tree new_var;
427
428 /* We can not chain the local static declarations into the unexpanded_var_list
429 as we can't duplicate them or break one decl rule. Go ahead and link
430 them into unexpanded_var_list. */
431 if (!lang_hooks.tree_inlining.auto_var_in_fn_p (old_var, id->src_fn)
432 && !DECL_EXTERNAL (old_var))
433 {
434 cfun->unexpanded_var_list = tree_cons (NULL_TREE, old_var,
435 cfun->unexpanded_var_list);
436 continue;
437 }
438
439 /* Remap the variable. */
440 new_var = remap_decl (old_var, id);
441
442 /* If we didn't remap this variable, so we can't mess with its
443 TREE_CHAIN. If we remapped this variable to the return slot, it's
444 already declared somewhere else, so don't declare it here. */
445 if (!new_var || new_var == id->retvar)
446 ;
447 else
448 {
449 gcc_assert (DECL_P (new_var));
450 TREE_CHAIN (new_var) = new_decls;
451 new_decls = new_var;
452 }
453 }
454
455 return nreverse (new_decls);
456 }
457
458 /* Copy the BLOCK to contain remapped versions of the variables
459 therein. And hook the new block into the block-tree. */
460
461 static void
462 remap_block (tree *block, copy_body_data *id)
463 {
464 tree old_block;
465 tree new_block;
466 tree fn;
467
468 /* Make the new block. */
469 old_block = *block;
470 new_block = make_node (BLOCK);
471 TREE_USED (new_block) = TREE_USED (old_block);
472 BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
473 BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
474 *block = new_block;
475
476 /* Remap its variables. */
477 BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block), id);
478
479 fn = id->dst_fn;
480
481 if (id->transform_lang_insert_block)
482 lang_hooks.decls.insert_block (new_block);
483
484 /* Remember the remapped block. */
485 insert_decl_map (id, old_block, new_block);
486 }
487
488 /* Copy the whole block tree and root it in id->block. */
489 static tree
490 remap_blocks (tree block, copy_body_data *id)
491 {
492 tree t;
493 tree new = block;
494
495 if (!block)
496 return NULL;
497
498 remap_block (&new, id);
499 gcc_assert (new != block);
500 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
501 add_lexical_block (new, remap_blocks (t, id));
502 return new;
503 }
504
505 static void
506 copy_statement_list (tree *tp)
507 {
508 tree_stmt_iterator oi, ni;
509 tree new;
510
511 new = alloc_stmt_list ();
512 ni = tsi_start (new);
513 oi = tsi_start (*tp);
514 *tp = new;
515
516 for (; !tsi_end_p (oi); tsi_next (&oi))
517 tsi_link_after (&ni, tsi_stmt (oi), TSI_NEW_STMT);
518 }
519
520 static void
521 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
522 {
523 tree block = BIND_EXPR_BLOCK (*tp);
524 /* Copy (and replace) the statement. */
525 copy_tree_r (tp, walk_subtrees, NULL);
526 if (block)
527 {
528 remap_block (&block, id);
529 BIND_EXPR_BLOCK (*tp) = block;
530 }
531
532 if (BIND_EXPR_VARS (*tp))
533 /* This will remap a lot of the same decls again, but this should be
534 harmless. */
535 BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), id);
536 }
537
538 /* Called from copy_body_id via walk_tree. DATA is really an
539 `copy_body_data *'. */
540
541 tree
542 copy_body_r (tree *tp, int *walk_subtrees, void *data)
543 {
544 copy_body_data *id = (copy_body_data *) data;
545 tree fn = id->src_fn;
546 tree new_block;
547
548 /* Begin by recognizing trees that we'll completely rewrite for the
549 inlining context. Our output for these trees is completely
550 different from out input (e.g. RETURN_EXPR is deleted, and morphs
551 into an edge). Further down, we'll handle trees that get
552 duplicated and/or tweaked. */
553
554 /* When requested, RETURN_EXPRs should be transformed to just the
555 contained GIMPLE_MODIFY_STMT. The branch semantics of the return will
556 be handled elsewhere by manipulating the CFG rather than a statement. */
557 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
558 {
559 tree assignment = TREE_OPERAND (*tp, 0);
560
561 /* If we're returning something, just turn that into an
562 assignment into the equivalent of the original RESULT_DECL.
563 If the "assignment" is just the result decl, the result
564 decl has already been set (e.g. a recent "foo (&result_decl,
565 ...)"); just toss the entire RETURN_EXPR. */
566 if (assignment && TREE_CODE (assignment) == GIMPLE_MODIFY_STMT)
567 {
568 /* Replace the RETURN_EXPR with (a copy of) the
569 GIMPLE_MODIFY_STMT hanging underneath. */
570 *tp = copy_node (assignment);
571 }
572 else /* Else the RETURN_EXPR returns no value. */
573 {
574 *tp = NULL;
575 return (tree) (void *)1;
576 }
577 }
578 else if (TREE_CODE (*tp) == SSA_NAME)
579 {
580 *tp = remap_ssa_name (*tp, id);
581 *walk_subtrees = 0;
582 return NULL;
583 }
584
585 /* Local variables and labels need to be replaced by equivalent
586 variables. We don't want to copy static variables; there's only
587 one of those, no matter how many times we inline the containing
588 function. Similarly for globals from an outer function. */
589 else if (lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
590 {
591 tree new_decl;
592
593 /* Remap the declaration. */
594 new_decl = remap_decl (*tp, id);
595 gcc_assert (new_decl);
596 /* Replace this variable with the copy. */
597 STRIP_TYPE_NOPS (new_decl);
598 *tp = new_decl;
599 *walk_subtrees = 0;
600 }
601 else if (TREE_CODE (*tp) == STATEMENT_LIST)
602 copy_statement_list (tp);
603 else if (TREE_CODE (*tp) == SAVE_EXPR)
604 remap_save_expr (tp, id->decl_map, walk_subtrees);
605 else if (TREE_CODE (*tp) == LABEL_DECL
606 && (! DECL_CONTEXT (*tp)
607 || decl_function_context (*tp) == id->src_fn))
608 /* These may need to be remapped for EH handling. */
609 *tp = remap_decl (*tp, id);
610 else if (TREE_CODE (*tp) == BIND_EXPR)
611 copy_bind_expr (tp, walk_subtrees, id);
612 /* Types may need remapping as well. */
613 else if (TYPE_P (*tp))
614 *tp = remap_type (*tp, id);
615
616 /* If this is a constant, we have to copy the node iff the type will be
617 remapped. copy_tree_r will not copy a constant. */
618 else if (CONSTANT_CLASS_P (*tp))
619 {
620 tree new_type = remap_type (TREE_TYPE (*tp), id);
621
622 if (new_type == TREE_TYPE (*tp))
623 *walk_subtrees = 0;
624
625 else if (TREE_CODE (*tp) == INTEGER_CST)
626 *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
627 TREE_INT_CST_HIGH (*tp));
628 else
629 {
630 *tp = copy_node (*tp);
631 TREE_TYPE (*tp) = new_type;
632 }
633 }
634
635 /* Otherwise, just copy the node. Note that copy_tree_r already
636 knows not to copy VAR_DECLs, etc., so this is safe. */
637 else
638 {
639 /* Here we handle trees that are not completely rewritten.
640 First we detect some inlining-induced bogosities for
641 discarding. */
642 if (TREE_CODE (*tp) == GIMPLE_MODIFY_STMT
643 && GIMPLE_STMT_OPERAND (*tp, 0) == GIMPLE_STMT_OPERAND (*tp, 1)
644 && (lang_hooks.tree_inlining.auto_var_in_fn_p
645 (GIMPLE_STMT_OPERAND (*tp, 0), fn)))
646 {
647 /* Some assignments VAR = VAR; don't generate any rtl code
648 and thus don't count as variable modification. Avoid
649 keeping bogosities like 0 = 0. */
650 tree decl = GIMPLE_STMT_OPERAND (*tp, 0), value;
651 tree *n;
652
653 n = (tree *) pointer_map_contains (id->decl_map, decl);
654 if (n)
655 {
656 value = *n;
657 STRIP_TYPE_NOPS (value);
658 if (TREE_CONSTANT (value) || TREE_READONLY_DECL_P (value))
659 {
660 *tp = build_empty_stmt ();
661 return copy_body_r (tp, walk_subtrees, data);
662 }
663 }
664 }
665 else if (TREE_CODE (*tp) == INDIRECT_REF)
666 {
667 /* Get rid of *& from inline substitutions that can happen when a
668 pointer argument is an ADDR_EXPR. */
669 tree decl = TREE_OPERAND (*tp, 0);
670 tree *n;
671
672 n = (tree *) pointer_map_contains (id->decl_map, decl);
673 if (n)
674 {
675 tree new;
676 tree old;
677 /* If we happen to get an ADDR_EXPR in n->value, strip
678 it manually here as we'll eventually get ADDR_EXPRs
679 which lie about their types pointed to. In this case
680 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
681 but we absolutely rely on that. As fold_indirect_ref
682 does other useful transformations, try that first, though. */
683 tree type = TREE_TYPE (TREE_TYPE (*n));
684 new = unshare_expr (*n);
685 old = *tp;
686 *tp = fold_indirect_ref_1 (type, new);
687 if (! *tp)
688 {
689 if (TREE_CODE (new) == ADDR_EXPR)
690 *tp = TREE_OPERAND (new, 0);
691 else
692 {
693 *tp = build1 (INDIRECT_REF, type, new);
694 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
695 }
696 }
697 *walk_subtrees = 0;
698 return NULL;
699 }
700 }
701
702 /* Here is the "usual case". Copy this tree node, and then
703 tweak some special cases. */
704 copy_tree_r (tp, walk_subtrees, NULL);
705
706 /* Global variables we didn't seen yet needs to go into referenced
707 vars. */
708 if (gimple_in_ssa_p (cfun) && TREE_CODE (*tp) == VAR_DECL)
709 add_referenced_var (*tp);
710
711 /* If EXPR has block defined, map it to newly constructed block.
712 When inlining we want EXPRs without block appear in the block
713 of function call. */
714 if (EXPR_P (*tp) || GIMPLE_STMT_P (*tp))
715 {
716 new_block = id->block;
717 if (TREE_BLOCK (*tp))
718 {
719 tree *n;
720 n = (tree *) pointer_map_contains (id->decl_map,
721 TREE_BLOCK (*tp));
722 gcc_assert (n);
723 new_block = *n;
724 }
725 TREE_BLOCK (*tp) = new_block;
726 }
727
728 if (TREE_CODE (*tp) == RESX_EXPR && id->eh_region_offset)
729 TREE_OPERAND (*tp, 0) =
730 build_int_cst
731 (NULL_TREE,
732 id->eh_region_offset + TREE_INT_CST_LOW (TREE_OPERAND (*tp, 0)));
733
734 if (!GIMPLE_TUPLE_P (*tp) && TREE_CODE (*tp) != OMP_CLAUSE)
735 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
736
737 /* The copied TARGET_EXPR has never been expanded, even if the
738 original node was expanded already. */
739 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
740 {
741 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
742 TREE_OPERAND (*tp, 3) = NULL_TREE;
743 }
744
745 /* Variable substitution need not be simple. In particular, the
746 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
747 and friends are up-to-date. */
748 else if (TREE_CODE (*tp) == ADDR_EXPR)
749 {
750 walk_tree (&TREE_OPERAND (*tp, 0), copy_body_r, id, NULL);
751 /* Handle the case where we substituted an INDIRECT_REF
752 into the operand of the ADDR_EXPR. */
753 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
754 *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
755 else
756 recompute_tree_invariant_for_addr_expr (*tp);
757 *walk_subtrees = 0;
758 }
759 }
760
761 /* Keep iterating. */
762 return NULL_TREE;
763 }
764
765 /* Copy basic block, scale profile accordingly. Edges will be taken care of
766 later */
767
768 static basic_block
769 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale, int count_scale)
770 {
771 block_stmt_iterator bsi, copy_bsi;
772 basic_block copy_basic_block;
773
774 /* create_basic_block() will append every new block to
775 basic_block_info automatically. */
776 copy_basic_block = create_basic_block (NULL, (void *) 0,
777 (basic_block) bb->prev_bb->aux);
778 copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
779
780 /* We are going to rebuild frequencies from scratch. These values have just
781 small importance to drive canonicalize_loop_headers. */
782 copy_basic_block->frequency = ((gcov_type)bb->frequency
783 * frequency_scale / REG_BR_PROB_BASE);
784 if (copy_basic_block->frequency > BB_FREQ_MAX)
785 copy_basic_block->frequency = BB_FREQ_MAX;
786 copy_bsi = bsi_start (copy_basic_block);
787
788 for (bsi = bsi_start (bb);
789 !bsi_end_p (bsi); bsi_next (&bsi))
790 {
791 tree stmt = bsi_stmt (bsi);
792 tree orig_stmt = stmt;
793
794 walk_tree (&stmt, copy_body_r, id, NULL);
795
796 /* RETURN_EXPR might be removed,
797 this is signalled by making stmt pointer NULL. */
798 if (stmt)
799 {
800 tree call, decl;
801
802 gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun, orig_stmt);
803
804 /* With return slot optimization we can end up with
805 non-gimple (foo *)&this->m, fix that here. */
806 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT
807 && TREE_CODE (GIMPLE_STMT_OPERAND (stmt, 1)) == NOP_EXPR
808 && !is_gimple_val (TREE_OPERAND (GIMPLE_STMT_OPERAND (stmt, 1), 0)))
809 gimplify_stmt (&stmt);
810
811 bsi_insert_after (&copy_bsi, stmt, BSI_NEW_STMT);
812
813 /* Process new statement. gimplify_stmt possibly turned statement
814 into multiple statements, we need to process all of them. */
815 while (!bsi_end_p (copy_bsi))
816 {
817 stmt = bsi_stmt (copy_bsi);
818 call = get_call_expr_in (stmt);
819
820 /* Statements produced by inlining can be unfolded, especially
821 when we constant propagated some operands. We can't fold
822 them right now for two reasons:
823 1) folding require SSA_NAME_DEF_STMTs to be correct
824 2) we can't change function calls to builtins.
825 So we just mark statement for later folding. We mark
826 all new statements, instead just statements that has changed
827 by some nontrivial substitution so even statements made
828 foldable indirectly are updated. If this turns out to be
829 expensive, copy_body can be told to watch for nontrivial
830 changes. */
831 if (id->statements_to_fold)
832 pointer_set_insert (id->statements_to_fold, stmt);
833 /* We're duplicating a CALL_EXPR. Find any corresponding
834 callgraph edges and update or duplicate them. */
835 if (call && (decl = get_callee_fndecl (call)))
836 {
837 struct cgraph_node *node;
838 struct cgraph_edge *edge;
839
840 switch (id->transform_call_graph_edges)
841 {
842 case CB_CGE_DUPLICATE:
843 edge = cgraph_edge (id->src_node, orig_stmt);
844 if (edge)
845 cgraph_clone_edge (edge, id->dst_node, stmt,
846 REG_BR_PROB_BASE, 1, edge->frequency, true);
847 break;
848
849 case CB_CGE_MOVE_CLONES:
850 for (node = id->dst_node->next_clone;
851 node;
852 node = node->next_clone)
853 {
854 edge = cgraph_edge (node, orig_stmt);
855 gcc_assert (edge);
856 cgraph_set_call_stmt (edge, stmt);
857 }
858 /* FALLTHRU */
859
860 case CB_CGE_MOVE:
861 edge = cgraph_edge (id->dst_node, orig_stmt);
862 if (edge)
863 cgraph_set_call_stmt (edge, stmt);
864 break;
865
866 default:
867 gcc_unreachable ();
868 }
869 }
870 /* If you think we can abort here, you are wrong.
871 There is no region 0 in tree land. */
872 gcc_assert (lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt)
873 != 0);
874
875 if (tree_could_throw_p (stmt)
876 /* When we are cloning for inlining, we are supposed to
877 construct a clone that calls precisely the same functions
878 as original. However IPA optimizers might've proved
879 earlier some function calls as non-trapping that might
880 render some basic blocks dead that might become
881 unreachable.
882
883 We can't update SSA with unreachable blocks in CFG and thus
884 we prevent the scenario by preserving even the "dead" eh
885 edges until the point they are later removed by
886 fixup_cfg pass. */
887 || (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
888 && lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt) > 0))
889 {
890 int region = lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt);
891 /* Add an entry for the copied tree in the EH hashtable.
892 When cloning or versioning, use the hashtable in
893 cfun, and just copy the EH number. When inlining, use the
894 hashtable in the caller, and adjust the region number. */
895 if (region > 0)
896 add_stmt_to_eh_region (stmt, region + id->eh_region_offset);
897
898 /* If this tree doesn't have a region associated with it,
899 and there is a "current region,"
900 then associate this tree with the current region
901 and add edges associated with this region. */
902 if ((lookup_stmt_eh_region_fn (id->src_cfun,
903 orig_stmt) <= 0
904 && id->eh_region > 0)
905 && tree_could_throw_p (stmt))
906 add_stmt_to_eh_region (stmt, id->eh_region);
907 }
908 if (gimple_in_ssa_p (cfun))
909 {
910 ssa_op_iter i;
911 tree def;
912
913 find_new_referenced_vars (bsi_stmt_ptr (copy_bsi));
914 FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
915 if (TREE_CODE (def) == SSA_NAME)
916 SSA_NAME_DEF_STMT (def) = stmt;
917 }
918 bsi_next (&copy_bsi);
919 }
920 copy_bsi = bsi_last (copy_basic_block);
921 }
922 }
923 return copy_basic_block;
924 }
925
926 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
927 form is quite easy, since dominator relationship for old basic blocks does
928 not change.
929
930 There is however exception where inlining might change dominator relation
931 across EH edges from basic block within inlined functions destinating
932 to landing pads in function we inline into.
933
934 The function mark PHI_RESULT of such PHI nodes for renaming; it is
935 safe the EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI
936 must be set. This means, that there will be no overlapping live ranges
937 for the underlying symbol.
938
939 This might change in future if we allow redirecting of EH edges and
940 we might want to change way build CFG pre-inlining to include
941 all the possible edges then. */
942 static void
943 update_ssa_across_eh_edges (basic_block bb)
944 {
945 edge e;
946 edge_iterator ei;
947
948 FOR_EACH_EDGE (e, ei, bb->succs)
949 if (!e->dest->aux
950 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
951 {
952 tree phi;
953
954 gcc_assert (e->flags & EDGE_EH);
955 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi))
956 {
957 gcc_assert (SSA_NAME_OCCURS_IN_ABNORMAL_PHI
958 (PHI_RESULT (phi)));
959 mark_sym_for_renaming
960 (SSA_NAME_VAR (PHI_RESULT (phi)));
961 }
962 }
963 }
964
965 /* Copy edges from BB into its copy constructed earlier, scale profile
966 accordingly. Edges will be taken care of later. Assume aux
967 pointers to point to the copies of each BB. */
968 static void
969 copy_edges_for_bb (basic_block bb, int count_scale)
970 {
971 basic_block new_bb = (basic_block) bb->aux;
972 edge_iterator ei;
973 edge old_edge;
974 block_stmt_iterator bsi;
975 int flags;
976
977 /* Use the indices from the original blocks to create edges for the
978 new ones. */
979 FOR_EACH_EDGE (old_edge, ei, bb->succs)
980 if (!(old_edge->flags & EDGE_EH))
981 {
982 edge new;
983
984 flags = old_edge->flags;
985
986 /* Return edges do get a FALLTHRU flag when the get inlined. */
987 if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
988 && old_edge->dest->aux != EXIT_BLOCK_PTR)
989 flags |= EDGE_FALLTHRU;
990 new = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
991 new->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
992 new->probability = old_edge->probability;
993 }
994
995 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
996 return;
997
998 for (bsi = bsi_start (new_bb); !bsi_end_p (bsi);)
999 {
1000 tree copy_stmt;
1001
1002 copy_stmt = bsi_stmt (bsi);
1003 update_stmt (copy_stmt);
1004 if (gimple_in_ssa_p (cfun))
1005 mark_symbols_for_renaming (copy_stmt);
1006 /* Do this before the possible split_block. */
1007 bsi_next (&bsi);
1008
1009 /* If this tree could throw an exception, there are two
1010 cases where we need to add abnormal edge(s): the
1011 tree wasn't in a region and there is a "current
1012 region" in the caller; or the original tree had
1013 EH edges. In both cases split the block after the tree,
1014 and add abnormal edge(s) as needed; we need both
1015 those from the callee and the caller.
1016 We check whether the copy can throw, because the const
1017 propagation can change an INDIRECT_REF which throws
1018 into a COMPONENT_REF which doesn't. If the copy
1019 can throw, the original could also throw. */
1020
1021 if (tree_can_throw_internal (copy_stmt))
1022 {
1023 if (!bsi_end_p (bsi))
1024 /* Note that bb's predecessor edges aren't necessarily
1025 right at this point; split_block doesn't care. */
1026 {
1027 edge e = split_block (new_bb, copy_stmt);
1028
1029 new_bb = e->dest;
1030 new_bb->aux = e->src->aux;
1031 bsi = bsi_start (new_bb);
1032 }
1033
1034 make_eh_edges (copy_stmt);
1035
1036 if (gimple_in_ssa_p (cfun))
1037 update_ssa_across_eh_edges (bb_for_stmt (copy_stmt));
1038 }
1039 }
1040 }
1041
1042 /* Copy the PHIs. All blocks and edges are copied, some blocks
1043 was possibly split and new outgoing EH edges inserted.
1044 BB points to the block of original function and AUX pointers links
1045 the original and newly copied blocks. */
1046
1047 static void
1048 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1049 {
1050 basic_block new_bb = bb->aux;
1051 edge_iterator ei;
1052 tree phi;
1053
1054 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
1055 {
1056 tree res = PHI_RESULT (phi);
1057 tree new_res = res;
1058 tree new_phi;
1059 edge new_edge;
1060
1061 if (is_gimple_reg (res))
1062 {
1063 walk_tree (&new_res, copy_body_r, id, NULL);
1064 SSA_NAME_DEF_STMT (new_res)
1065 = new_phi = create_phi_node (new_res, new_bb);
1066 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
1067 {
1068 edge old_edge = find_edge (new_edge->src->aux, bb);
1069 tree arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
1070 tree new_arg = arg;
1071
1072 walk_tree (&new_arg, copy_body_r, id, NULL);
1073 gcc_assert (new_arg);
1074 add_phi_arg (new_phi, new_arg, new_edge);
1075 }
1076 }
1077 }
1078 }
1079
1080 /* Wrapper for remap_decl so it can be used as a callback. */
1081 static tree
1082 remap_decl_1 (tree decl, void *data)
1083 {
1084 return remap_decl (decl, (copy_body_data *) data);
1085 }
1086
1087 /* Build struct function and associated datastructures for the new clone
1088 NEW_FNDECL to be build. CALLEE_FNDECL is the original */
1089
1090 static void
1091 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count,
1092 int frequency)
1093 {
1094 struct function *new_cfun
1095 = (struct function *) ggc_alloc_cleared (sizeof (struct function));
1096 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1097 int count_scale, frequency_scale;
1098
1099 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1100 count_scale = (REG_BR_PROB_BASE * count
1101 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1102 else
1103 count_scale = 1;
1104
1105 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1106 frequency_scale = (REG_BR_PROB_BASE * frequency
1107 /
1108 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1109 else
1110 frequency_scale = count_scale;
1111
1112 /* Register specific tree functions. */
1113 tree_register_cfg_hooks ();
1114 *new_cfun = *DECL_STRUCT_FUNCTION (callee_fndecl);
1115 new_cfun->funcdef_no = get_next_funcdef_no ();
1116 VALUE_HISTOGRAMS (new_cfun) = NULL;
1117 new_cfun->unexpanded_var_list = NULL;
1118 new_cfun->cfg = NULL;
1119 new_cfun->decl = new_fndecl /*= copy_node (callee_fndecl)*/;
1120 DECL_STRUCT_FUNCTION (new_fndecl) = new_cfun;
1121 push_cfun (new_cfun);
1122 init_empty_tree_cfg ();
1123
1124 ENTRY_BLOCK_PTR->count =
1125 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1126 REG_BR_PROB_BASE);
1127 ENTRY_BLOCK_PTR->frequency =
1128 (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1129 frequency_scale / REG_BR_PROB_BASE);
1130 EXIT_BLOCK_PTR->count =
1131 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1132 REG_BR_PROB_BASE);
1133 EXIT_BLOCK_PTR->frequency =
1134 (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1135 frequency_scale / REG_BR_PROB_BASE);
1136 if (src_cfun->eh)
1137 init_eh_for_function ();
1138
1139 if (src_cfun->gimple_df)
1140 {
1141 init_tree_ssa ();
1142 cfun->gimple_df->in_ssa_p = true;
1143 init_ssa_operands ();
1144 }
1145 pop_cfun ();
1146 }
1147
1148 /* Make a copy of the body of FN so that it can be inserted inline in
1149 another function. Walks FN via CFG, returns new fndecl. */
1150
1151 static tree
1152 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency,
1153 basic_block entry_block_map, basic_block exit_block_map)
1154 {
1155 tree callee_fndecl = id->src_fn;
1156 /* Original cfun for the callee, doesn't change. */
1157 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1158 struct function *cfun_to_copy;
1159 basic_block bb;
1160 tree new_fndecl = NULL;
1161 int count_scale, frequency_scale;
1162 int last;
1163
1164 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1165 count_scale = (REG_BR_PROB_BASE * count
1166 / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1167 else
1168 count_scale = 1;
1169
1170 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1171 frequency_scale = (REG_BR_PROB_BASE * frequency
1172 /
1173 ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1174 else
1175 frequency_scale = count_scale;
1176
1177 /* Register specific tree functions. */
1178 tree_register_cfg_hooks ();
1179
1180 /* Must have a CFG here at this point. */
1181 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
1182 (DECL_STRUCT_FUNCTION (callee_fndecl)));
1183
1184 cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1185
1186
1187 ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
1188 EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
1189 entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1190 exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1191
1192 /* Duplicate any exception-handling regions. */
1193 if (cfun->eh)
1194 {
1195 id->eh_region_offset
1196 = duplicate_eh_regions (cfun_to_copy, remap_decl_1, id,
1197 0, id->eh_region);
1198 }
1199 /* Use aux pointers to map the original blocks to copy. */
1200 FOR_EACH_BB_FN (bb, cfun_to_copy)
1201 {
1202 basic_block new = copy_bb (id, bb, frequency_scale, count_scale);
1203 bb->aux = new;
1204 new->aux = bb;
1205 }
1206
1207 last = last_basic_block;
1208 /* Now that we've duplicated the blocks, duplicate their edges. */
1209 FOR_ALL_BB_FN (bb, cfun_to_copy)
1210 copy_edges_for_bb (bb, count_scale);
1211 if (gimple_in_ssa_p (cfun))
1212 FOR_ALL_BB_FN (bb, cfun_to_copy)
1213 copy_phis_for_bb (bb, id);
1214 FOR_ALL_BB_FN (bb, cfun_to_copy)
1215 {
1216 ((basic_block)bb->aux)->aux = NULL;
1217 bb->aux = NULL;
1218 }
1219 /* Zero out AUX fields of newly created block during EH edge
1220 insertion. */
1221 for (; last < last_basic_block; last++)
1222 BASIC_BLOCK (last)->aux = NULL;
1223 entry_block_map->aux = NULL;
1224 exit_block_map->aux = NULL;
1225
1226 return new_fndecl;
1227 }
1228
1229 /* Make a copy of the body of FN so that it can be inserted inline in
1230 another function. */
1231
1232 static tree
1233 copy_generic_body (copy_body_data *id)
1234 {
1235 tree body;
1236 tree fndecl = id->src_fn;
1237
1238 body = DECL_SAVED_TREE (fndecl);
1239 walk_tree (&body, copy_body_r, id, NULL);
1240
1241 return body;
1242 }
1243
1244 static tree
1245 copy_body (copy_body_data *id, gcov_type count, int frequency,
1246 basic_block entry_block_map, basic_block exit_block_map)
1247 {
1248 tree fndecl = id->src_fn;
1249 tree body;
1250
1251 /* If this body has a CFG, walk CFG and copy. */
1252 gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
1253 body = copy_cfg_body (id, count, frequency, entry_block_map, exit_block_map);
1254
1255 return body;
1256 }
1257
1258 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
1259 defined in function FN, or of a data member thereof. */
1260
1261 static bool
1262 self_inlining_addr_expr (tree value, tree fn)
1263 {
1264 tree var;
1265
1266 if (TREE_CODE (value) != ADDR_EXPR)
1267 return false;
1268
1269 var = get_base_address (TREE_OPERAND (value, 0));
1270
1271 return var && lang_hooks.tree_inlining.auto_var_in_fn_p (var, fn);
1272 }
1273
1274 static void
1275 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
1276 basic_block bb, tree *vars)
1277 {
1278 tree init_stmt;
1279 tree var;
1280 tree var_sub;
1281 tree rhs = value ? fold_convert (TREE_TYPE (p), value) : NULL;
1282 tree def = (gimple_in_ssa_p (cfun)
1283 ? gimple_default_def (id->src_cfun, p) : NULL);
1284
1285 /* If the parameter is never assigned to, has no SSA_NAMEs created,
1286 we may not need to create a new variable here at all. Instead, we may
1287 be able to just use the argument value. */
1288 if (TREE_READONLY (p)
1289 && !TREE_ADDRESSABLE (p)
1290 && value && !TREE_SIDE_EFFECTS (value)
1291 && !def)
1292 {
1293 /* We may produce non-gimple trees by adding NOPs or introduce
1294 invalid sharing when operand is not really constant.
1295 It is not big deal to prohibit constant propagation here as
1296 we will constant propagate in DOM1 pass anyway. */
1297 if (is_gimple_min_invariant (value)
1298 && lang_hooks.types_compatible_p (TREE_TYPE (value), TREE_TYPE (p))
1299 /* We have to be very careful about ADDR_EXPR. Make sure
1300 the base variable isn't a local variable of the inlined
1301 function, e.g., when doing recursive inlining, direct or
1302 mutually-recursive or whatever, which is why we don't
1303 just test whether fn == current_function_decl. */
1304 && ! self_inlining_addr_expr (value, fn))
1305 {
1306 insert_decl_map (id, p, value);
1307 return;
1308 }
1309 }
1310
1311 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
1312 here since the type of this decl must be visible to the calling
1313 function. */
1314 var = copy_decl_to_var (p, id);
1315 if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL)
1316 {
1317 get_var_ann (var);
1318 add_referenced_var (var);
1319 }
1320
1321 /* See if the frontend wants to pass this by invisible reference. If
1322 so, our new VAR_DECL will have REFERENCE_TYPE, and we need to
1323 replace uses of the PARM_DECL with dereferences. */
1324 if (TREE_TYPE (var) != TREE_TYPE (p)
1325 && POINTER_TYPE_P (TREE_TYPE (var))
1326 && TREE_TYPE (TREE_TYPE (var)) == TREE_TYPE (p))
1327 {
1328 insert_decl_map (id, var, var);
1329 var_sub = build_fold_indirect_ref (var);
1330 }
1331 else
1332 var_sub = var;
1333
1334 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
1335 that way, when the PARM_DECL is encountered, it will be
1336 automatically replaced by the VAR_DECL. */
1337 insert_decl_map (id, p, var_sub);
1338
1339 /* Declare this new variable. */
1340 TREE_CHAIN (var) = *vars;
1341 *vars = var;
1342
1343 /* Make gimplifier happy about this variable. */
1344 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
1345
1346 /* Even if P was TREE_READONLY, the new VAR should not be.
1347 In the original code, we would have constructed a
1348 temporary, and then the function body would have never
1349 changed the value of P. However, now, we will be
1350 constructing VAR directly. The constructor body may
1351 change its value multiple times as it is being
1352 constructed. Therefore, it must not be TREE_READONLY;
1353 the back-end assumes that TREE_READONLY variable is
1354 assigned to only once. */
1355 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
1356 TREE_READONLY (var) = 0;
1357
1358 /* If there is no setup required and we are in SSA, take the easy route
1359 replacing all SSA names representing the function parameter by the
1360 SSA name passed to function.
1361
1362 We need to construct map for the variable anyway as it might be used
1363 in different SSA names when parameter is set in function.
1364
1365 FIXME: This usually kills the last connection in between inlined
1366 function parameter and the actual value in debug info. Can we do
1367 better here? If we just inserted the statement, copy propagation
1368 would kill it anyway as it always did in older versions of GCC.
1369
1370 We might want to introduce a notion that single SSA_NAME might
1371 represent multiple variables for purposes of debugging. */
1372 if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
1373 && (TREE_CODE (rhs) == SSA_NAME
1374 || is_gimple_min_invariant (rhs))
1375 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
1376 {
1377 insert_decl_map (id, def, rhs);
1378 return;
1379 }
1380
1381 /* Initialize this VAR_DECL from the equivalent argument. Convert
1382 the argument to the proper type in case it was promoted. */
1383 if (value)
1384 {
1385 block_stmt_iterator bsi = bsi_last (bb);
1386
1387 if (rhs == error_mark_node)
1388 {
1389 insert_decl_map (id, p, var_sub);
1390 return;
1391 }
1392
1393 STRIP_USELESS_TYPE_CONVERSION (rhs);
1394
1395 /* We want to use GIMPLE_MODIFY_STMT, not INIT_EXPR here so that we
1396 keep our trees in gimple form. */
1397 if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p))
1398 {
1399 def = remap_ssa_name (def, id);
1400 init_stmt = build_gimple_modify_stmt (def, rhs);
1401 SSA_NAME_DEF_STMT (def) = init_stmt;
1402 SSA_NAME_IS_DEFAULT_DEF (def) = 0;
1403 set_default_def (var, NULL);
1404 }
1405 else
1406 init_stmt = build_gimple_modify_stmt (var, rhs);
1407
1408 /* If we did not create a gimple value and we did not create a gimple
1409 cast of a gimple value, then we will need to gimplify INIT_STMTS
1410 at the end. Note that is_gimple_cast only checks the outer
1411 tree code, not its operand. Thus the explicit check that its
1412 operand is a gimple value. */
1413 if ((!is_gimple_val (rhs)
1414 && (!is_gimple_cast (rhs)
1415 || !is_gimple_val (TREE_OPERAND (rhs, 0))))
1416 || !is_gimple_reg (var))
1417 {
1418 tree_stmt_iterator i;
1419
1420 push_gimplify_context ();
1421 gimplify_stmt (&init_stmt);
1422 if (gimple_in_ssa_p (cfun)
1423 && init_stmt && TREE_CODE (init_stmt) == STATEMENT_LIST)
1424 {
1425 /* The replacement can expose previously unreferenced
1426 variables. */
1427 for (i = tsi_start (init_stmt); !tsi_end_p (i); tsi_next (&i))
1428 find_new_referenced_vars (tsi_stmt_ptr (i));
1429 }
1430 pop_gimplify_context (NULL);
1431 }
1432
1433 /* If VAR represents a zero-sized variable, it's possible that the
1434 assignment statment may result in no gimple statements. */
1435 if (init_stmt)
1436 bsi_insert_after (&bsi, init_stmt, BSI_NEW_STMT);
1437 if (gimple_in_ssa_p (cfun))
1438 for (;!bsi_end_p (bsi); bsi_next (&bsi))
1439 mark_symbols_for_renaming (bsi_stmt (bsi));
1440 }
1441 }
1442
1443 /* Generate code to initialize the parameters of the function at the
1444 top of the stack in ID from the CALL_EXPR EXP. */
1445
1446 static void
1447 initialize_inlined_parameters (copy_body_data *id, tree exp,
1448 tree fn, basic_block bb)
1449 {
1450 tree parms;
1451 tree a;
1452 tree p;
1453 tree vars = NULL_TREE;
1454 int argnum = 0;
1455 call_expr_arg_iterator iter;
1456 tree static_chain = CALL_EXPR_STATIC_CHAIN (exp);
1457
1458 /* Figure out what the parameters are. */
1459 parms = DECL_ARGUMENTS (fn);
1460
1461 /* Loop through the parameter declarations, replacing each with an
1462 equivalent VAR_DECL, appropriately initialized. */
1463 for (p = parms, a = first_call_expr_arg (exp, &iter); p;
1464 a = next_call_expr_arg (&iter), p = TREE_CHAIN (p))
1465 {
1466 tree value;
1467
1468 ++argnum;
1469
1470 /* Find the initializer. */
1471 value = lang_hooks.tree_inlining.convert_parm_for_inlining
1472 (p, a, fn, argnum);
1473
1474 setup_one_parameter (id, p, value, fn, bb, &vars);
1475 }
1476
1477 /* Initialize the static chain. */
1478 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
1479 gcc_assert (fn != current_function_decl);
1480 if (p)
1481 {
1482 /* No static chain? Seems like a bug in tree-nested.c. */
1483 gcc_assert (static_chain);
1484
1485 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
1486 }
1487
1488 declare_inline_vars (id->block, vars);
1489 }
1490
1491 /* Declare a return variable to replace the RESULT_DECL for the
1492 function we are calling. An appropriate DECL_STMT is returned.
1493 The USE_STMT is filled to contain a use of the declaration to
1494 indicate the return value of the function.
1495
1496 RETURN_SLOT, if non-null is place where to store the result. It
1497 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
1498 was the LHS of the GIMPLE_MODIFY_STMT to which this call is the RHS.
1499
1500 The return value is a (possibly null) value that is the result of the
1501 function as seen by the callee. *USE_P is a (possibly null) value that
1502 holds the result as seen by the caller. */
1503
1504 static tree
1505 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest,
1506 tree *use_p)
1507 {
1508 tree callee = id->src_fn;
1509 tree caller = id->dst_fn;
1510 tree result = DECL_RESULT (callee);
1511 tree callee_type = TREE_TYPE (result);
1512 tree caller_type = TREE_TYPE (TREE_TYPE (callee));
1513 tree var, use;
1514
1515 /* We don't need to do anything for functions that don't return
1516 anything. */
1517 if (!result || VOID_TYPE_P (callee_type))
1518 {
1519 *use_p = NULL_TREE;
1520 return NULL_TREE;
1521 }
1522
1523 /* If there was a return slot, then the return value is the
1524 dereferenced address of that object. */
1525 if (return_slot)
1526 {
1527 /* The front end shouldn't have used both return_slot and
1528 a modify expression. */
1529 gcc_assert (!modify_dest);
1530 if (DECL_BY_REFERENCE (result))
1531 {
1532 tree return_slot_addr = build_fold_addr_expr (return_slot);
1533 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
1534
1535 /* We are going to construct *&return_slot and we can't do that
1536 for variables believed to be not addressable.
1537
1538 FIXME: This check possibly can match, because values returned
1539 via return slot optimization are not believed to have address
1540 taken by alias analysis. */
1541 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
1542 if (gimple_in_ssa_p (cfun))
1543 {
1544 HOST_WIDE_INT bitsize;
1545 HOST_WIDE_INT bitpos;
1546 tree offset;
1547 enum machine_mode mode;
1548 int unsignedp;
1549 int volatilep;
1550 tree base;
1551 base = get_inner_reference (return_slot, &bitsize, &bitpos,
1552 &offset,
1553 &mode, &unsignedp, &volatilep,
1554 false);
1555 if (TREE_CODE (base) == INDIRECT_REF)
1556 base = TREE_OPERAND (base, 0);
1557 if (TREE_CODE (base) == SSA_NAME)
1558 base = SSA_NAME_VAR (base);
1559 mark_sym_for_renaming (base);
1560 }
1561 var = return_slot_addr;
1562 }
1563 else
1564 {
1565 var = return_slot;
1566 gcc_assert (TREE_CODE (var) != SSA_NAME);
1567 }
1568 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1569 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1570 && !DECL_GIMPLE_REG_P (result)
1571 && DECL_P (var))
1572 DECL_GIMPLE_REG_P (var) = 0;
1573 use = NULL;
1574 goto done;
1575 }
1576
1577 /* All types requiring non-trivial constructors should have been handled. */
1578 gcc_assert (!TREE_ADDRESSABLE (callee_type));
1579
1580 /* Attempt to avoid creating a new temporary variable. */
1581 if (modify_dest
1582 && TREE_CODE (modify_dest) != SSA_NAME)
1583 {
1584 bool use_it = false;
1585
1586 /* We can't use MODIFY_DEST if there's type promotion involved. */
1587 if (!lang_hooks.types_compatible_p (caller_type, callee_type))
1588 use_it = false;
1589
1590 /* ??? If we're assigning to a variable sized type, then we must
1591 reuse the destination variable, because we've no good way to
1592 create variable sized temporaries at this point. */
1593 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
1594 use_it = true;
1595
1596 /* If the callee cannot possibly modify MODIFY_DEST, then we can
1597 reuse it as the result of the call directly. Don't do this if
1598 it would promote MODIFY_DEST to addressable. */
1599 else if (TREE_ADDRESSABLE (result))
1600 use_it = false;
1601 else
1602 {
1603 tree base_m = get_base_address (modify_dest);
1604
1605 /* If the base isn't a decl, then it's a pointer, and we don't
1606 know where that's going to go. */
1607 if (!DECL_P (base_m))
1608 use_it = false;
1609 else if (is_global_var (base_m))
1610 use_it = false;
1611 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
1612 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
1613 && !DECL_GIMPLE_REG_P (result)
1614 && DECL_GIMPLE_REG_P (base_m))
1615 use_it = false;
1616 else if (!TREE_ADDRESSABLE (base_m))
1617 use_it = true;
1618 }
1619
1620 if (use_it)
1621 {
1622 var = modify_dest;
1623 use = NULL;
1624 goto done;
1625 }
1626 }
1627
1628 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
1629
1630 var = copy_result_decl_to_var (result, id);
1631 if (gimple_in_ssa_p (cfun))
1632 {
1633 get_var_ann (var);
1634 add_referenced_var (var);
1635 }
1636
1637 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
1638 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list
1639 = tree_cons (NULL_TREE, var,
1640 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list);
1641
1642 /* Do not have the rest of GCC warn about this variable as it should
1643 not be visible to the user. */
1644 TREE_NO_WARNING (var) = 1;
1645
1646 declare_inline_vars (id->block, var);
1647
1648 /* Build the use expr. If the return type of the function was
1649 promoted, convert it back to the expected type. */
1650 use = var;
1651 if (!lang_hooks.types_compatible_p (TREE_TYPE (var), caller_type))
1652 use = fold_convert (caller_type, var);
1653
1654 STRIP_USELESS_TYPE_CONVERSION (use);
1655
1656 if (DECL_BY_REFERENCE (result))
1657 var = build_fold_addr_expr (var);
1658
1659 done:
1660 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
1661 way, when the RESULT_DECL is encountered, it will be
1662 automatically replaced by the VAR_DECL. */
1663 insert_decl_map (id, result, var);
1664
1665 /* Remember this so we can ignore it in remap_decls. */
1666 id->retvar = var;
1667
1668 *use_p = use;
1669 return var;
1670 }
1671
1672 /* Returns nonzero if a function can be inlined as a tree. */
1673
1674 bool
1675 tree_inlinable_function_p (tree fn)
1676 {
1677 return inlinable_function_p (fn);
1678 }
1679
1680 static const char *inline_forbidden_reason;
1681
1682 static tree
1683 inline_forbidden_p_1 (tree *nodep, int *walk_subtrees ATTRIBUTE_UNUSED,
1684 void *fnp)
1685 {
1686 tree node = *nodep;
1687 tree fn = (tree) fnp;
1688 tree t;
1689
1690 switch (TREE_CODE (node))
1691 {
1692 case CALL_EXPR:
1693 /* Refuse to inline alloca call unless user explicitly forced so as
1694 this may change program's memory overhead drastically when the
1695 function using alloca is called in loop. In GCC present in
1696 SPEC2000 inlining into schedule_block cause it to require 2GB of
1697 RAM instead of 256MB. */
1698 if (alloca_call_p (node)
1699 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
1700 {
1701 inline_forbidden_reason
1702 = G_("function %q+F can never be inlined because it uses "
1703 "alloca (override using the always_inline attribute)");
1704 return node;
1705 }
1706 t = get_callee_fndecl (node);
1707 if (! t)
1708 break;
1709
1710 /* We cannot inline functions that call setjmp. */
1711 if (setjmp_call_p (t))
1712 {
1713 inline_forbidden_reason
1714 = G_("function %q+F can never be inlined because it uses setjmp");
1715 return node;
1716 }
1717
1718 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
1719 switch (DECL_FUNCTION_CODE (t))
1720 {
1721 /* We cannot inline functions that take a variable number of
1722 arguments. */
1723 case BUILT_IN_VA_START:
1724 case BUILT_IN_STDARG_START:
1725 case BUILT_IN_NEXT_ARG:
1726 case BUILT_IN_VA_END:
1727 inline_forbidden_reason
1728 = G_("function %q+F can never be inlined because it "
1729 "uses variable argument lists");
1730 return node;
1731
1732 case BUILT_IN_LONGJMP:
1733 /* We can't inline functions that call __builtin_longjmp at
1734 all. The non-local goto machinery really requires the
1735 destination be in a different function. If we allow the
1736 function calling __builtin_longjmp to be inlined into the
1737 function calling __builtin_setjmp, Things will Go Awry. */
1738 inline_forbidden_reason
1739 = G_("function %q+F can never be inlined because "
1740 "it uses setjmp-longjmp exception handling");
1741 return node;
1742
1743 case BUILT_IN_NONLOCAL_GOTO:
1744 /* Similarly. */
1745 inline_forbidden_reason
1746 = G_("function %q+F can never be inlined because "
1747 "it uses non-local goto");
1748 return node;
1749
1750 case BUILT_IN_RETURN:
1751 case BUILT_IN_APPLY_ARGS:
1752 /* If a __builtin_apply_args caller would be inlined,
1753 it would be saving arguments of the function it has
1754 been inlined into. Similarly __builtin_return would
1755 return from the function the inline has been inlined into. */
1756 inline_forbidden_reason
1757 = G_("function %q+F can never be inlined because "
1758 "it uses __builtin_return or __builtin_apply_args");
1759 return node;
1760
1761 default:
1762 break;
1763 }
1764 break;
1765
1766 case GOTO_EXPR:
1767 t = TREE_OPERAND (node, 0);
1768
1769 /* We will not inline a function which uses computed goto. The
1770 addresses of its local labels, which may be tucked into
1771 global storage, are of course not constant across
1772 instantiations, which causes unexpected behavior. */
1773 if (TREE_CODE (t) != LABEL_DECL)
1774 {
1775 inline_forbidden_reason
1776 = G_("function %q+F can never be inlined "
1777 "because it contains a computed goto");
1778 return node;
1779 }
1780 break;
1781
1782 case LABEL_EXPR:
1783 t = TREE_OPERAND (node, 0);
1784 if (DECL_NONLOCAL (t))
1785 {
1786 /* We cannot inline a function that receives a non-local goto
1787 because we cannot remap the destination label used in the
1788 function that is performing the non-local goto. */
1789 inline_forbidden_reason
1790 = G_("function %q+F can never be inlined "
1791 "because it receives a non-local goto");
1792 return node;
1793 }
1794 break;
1795
1796 case RECORD_TYPE:
1797 case UNION_TYPE:
1798 /* We cannot inline a function of the form
1799
1800 void F (int i) { struct S { int ar[i]; } s; }
1801
1802 Attempting to do so produces a catch-22.
1803 If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
1804 UNION_TYPE nodes, then it goes into infinite recursion on a
1805 structure containing a pointer to its own type. If it doesn't,
1806 then the type node for S doesn't get adjusted properly when
1807 F is inlined.
1808
1809 ??? This is likely no longer true, but it's too late in the 4.0
1810 cycle to try to find out. This should be checked for 4.1. */
1811 for (t = TYPE_FIELDS (node); t; t = TREE_CHAIN (t))
1812 if (variably_modified_type_p (TREE_TYPE (t), NULL))
1813 {
1814 inline_forbidden_reason
1815 = G_("function %q+F can never be inlined "
1816 "because it uses variable sized variables");
1817 return node;
1818 }
1819
1820 default:
1821 break;
1822 }
1823
1824 return NULL_TREE;
1825 }
1826
1827 /* Return subexpression representing possible alloca call, if any. */
1828 static tree
1829 inline_forbidden_p (tree fndecl)
1830 {
1831 location_t saved_loc = input_location;
1832 block_stmt_iterator bsi;
1833 basic_block bb;
1834 tree ret = NULL_TREE;
1835
1836 FOR_EACH_BB_FN (bb, DECL_STRUCT_FUNCTION (fndecl))
1837 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
1838 {
1839 ret = walk_tree_without_duplicates (bsi_stmt_ptr (bsi),
1840 inline_forbidden_p_1, fndecl);
1841 if (ret)
1842 goto egress;
1843 }
1844
1845 egress:
1846 input_location = saved_loc;
1847 return ret;
1848 }
1849
1850 /* Returns nonzero if FN is a function that does not have any
1851 fundamental inline blocking properties. */
1852
1853 static bool
1854 inlinable_function_p (tree fn)
1855 {
1856 bool inlinable = true;
1857
1858 /* If we've already decided this function shouldn't be inlined,
1859 there's no need to check again. */
1860 if (DECL_UNINLINABLE (fn))
1861 return false;
1862
1863 /* See if there is any language-specific reason it cannot be
1864 inlined. (It is important that this hook be called early because
1865 in C++ it may result in template instantiation.)
1866 If the function is not inlinable for language-specific reasons,
1867 it is left up to the langhook to explain why. */
1868 inlinable = !lang_hooks.tree_inlining.cannot_inline_tree_fn (&fn);
1869
1870 /* If we don't have the function body available, we can't inline it.
1871 However, this should not be recorded since we also get here for
1872 forward declared inline functions. Therefore, return at once. */
1873 if (!DECL_SAVED_TREE (fn))
1874 return false;
1875
1876 /* If we're not inlining at all, then we cannot inline this function. */
1877 else if (!flag_inline_trees)
1878 inlinable = false;
1879
1880 /* Only try to inline functions if DECL_INLINE is set. This should be
1881 true for all functions declared `inline', and for all other functions
1882 as well with -finline-functions.
1883
1884 Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
1885 it's the front-end that must set DECL_INLINE in this case, because
1886 dwarf2out loses if a function that does not have DECL_INLINE set is
1887 inlined anyway. That is why we have both DECL_INLINE and
1888 DECL_DECLARED_INLINE_P. */
1889 /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
1890 here should be redundant. */
1891 else if (!DECL_INLINE (fn) && !flag_unit_at_a_time)
1892 inlinable = false;
1893
1894 else if (inline_forbidden_p (fn))
1895 {
1896 /* See if we should warn about uninlinable functions. Previously,
1897 some of these warnings would be issued while trying to expand
1898 the function inline, but that would cause multiple warnings
1899 about functions that would for example call alloca. But since
1900 this a property of the function, just one warning is enough.
1901 As a bonus we can now give more details about the reason why a
1902 function is not inlinable.
1903 We only warn for functions declared `inline' by the user. */
1904 bool do_warning = (warn_inline
1905 && DECL_INLINE (fn)
1906 && DECL_DECLARED_INLINE_P (fn)
1907 && !DECL_IN_SYSTEM_HEADER (fn));
1908
1909 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
1910 sorry (inline_forbidden_reason, fn);
1911 else if (do_warning)
1912 warning (OPT_Winline, inline_forbidden_reason, fn);
1913
1914 inlinable = false;
1915 }
1916
1917 /* Squirrel away the result so that we don't have to check again. */
1918 DECL_UNINLINABLE (fn) = !inlinable;
1919
1920 return inlinable;
1921 }
1922
1923 /* Estimate the cost of a memory move. Use machine dependent
1924 word size and take possible memcpy call into account. */
1925
1926 int
1927 estimate_move_cost (tree type)
1928 {
1929 HOST_WIDE_INT size;
1930
1931 size = int_size_in_bytes (type);
1932
1933 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO)
1934 /* Cost of a memcpy call, 3 arguments and the call. */
1935 return 4;
1936 else
1937 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
1938 }
1939
1940 /* Arguments for estimate_num_insns_1. */
1941
1942 struct eni_data
1943 {
1944 /* Used to return the number of insns. */
1945 int count;
1946
1947 /* Weights of various constructs. */
1948 eni_weights *weights;
1949 };
1950
1951 /* Used by estimate_num_insns. Estimate number of instructions seen
1952 by given statement. */
1953
1954 static tree
1955 estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
1956 {
1957 struct eni_data *d = data;
1958 tree x = *tp;
1959 unsigned cost;
1960
1961 if (IS_TYPE_OR_DECL_P (x))
1962 {
1963 *walk_subtrees = 0;
1964 return NULL;
1965 }
1966 /* Assume that constants and references counts nothing. These should
1967 be majorized by amount of operations among them we count later
1968 and are common target of CSE and similar optimizations. */
1969 else if (CONSTANT_CLASS_P (x) || REFERENCE_CLASS_P (x))
1970 return NULL;
1971
1972 switch (TREE_CODE (x))
1973 {
1974 /* Containers have no cost. */
1975 case TREE_LIST:
1976 case TREE_VEC:
1977 case BLOCK:
1978 case COMPONENT_REF:
1979 case BIT_FIELD_REF:
1980 case INDIRECT_REF:
1981 case ALIGN_INDIRECT_REF:
1982 case MISALIGNED_INDIRECT_REF:
1983 case ARRAY_REF:
1984 case ARRAY_RANGE_REF:
1985 case OBJ_TYPE_REF:
1986 case EXC_PTR_EXPR: /* ??? */
1987 case FILTER_EXPR: /* ??? */
1988 case COMPOUND_EXPR:
1989 case BIND_EXPR:
1990 case WITH_CLEANUP_EXPR:
1991 case NOP_EXPR:
1992 case VIEW_CONVERT_EXPR:
1993 case SAVE_EXPR:
1994 case ADDR_EXPR:
1995 case COMPLEX_EXPR:
1996 case RANGE_EXPR:
1997 case CASE_LABEL_EXPR:
1998 case SSA_NAME:
1999 case CATCH_EXPR:
2000 case EH_FILTER_EXPR:
2001 case STATEMENT_LIST:
2002 case ERROR_MARK:
2003 case NON_LVALUE_EXPR:
2004 case FDESC_EXPR:
2005 case VA_ARG_EXPR:
2006 case TRY_CATCH_EXPR:
2007 case TRY_FINALLY_EXPR:
2008 case LABEL_EXPR:
2009 case GOTO_EXPR:
2010 case RETURN_EXPR:
2011 case EXIT_EXPR:
2012 case LOOP_EXPR:
2013 case PHI_NODE:
2014 case WITH_SIZE_EXPR:
2015 case OMP_CLAUSE:
2016 case OMP_RETURN:
2017 case OMP_CONTINUE:
2018 break;
2019
2020 /* We don't account constants for now. Assume that the cost is amortized
2021 by operations that do use them. We may re-consider this decision once
2022 we are able to optimize the tree before estimating its size and break
2023 out static initializers. */
2024 case IDENTIFIER_NODE:
2025 case INTEGER_CST:
2026 case REAL_CST:
2027 case COMPLEX_CST:
2028 case VECTOR_CST:
2029 case STRING_CST:
2030 *walk_subtrees = 0;
2031 return NULL;
2032
2033 /* Try to estimate the cost of assignments. We have three cases to
2034 deal with:
2035 1) Simple assignments to registers;
2036 2) Stores to things that must live in memory. This includes
2037 "normal" stores to scalars, but also assignments of large
2038 structures, or constructors of big arrays;
2039 3) TARGET_EXPRs.
2040
2041 Let us look at the first two cases, assuming we have "a = b + C":
2042 <GIMPLE_MODIFY_STMT <var_decl "a">
2043 <plus_expr <var_decl "b"> <constant C>>
2044 If "a" is a GIMPLE register, the assignment to it is free on almost
2045 any target, because "a" usually ends up in a real register. Hence
2046 the only cost of this expression comes from the PLUS_EXPR, and we
2047 can ignore the GIMPLE_MODIFY_STMT.
2048 If "a" is not a GIMPLE register, the assignment to "a" will most
2049 likely be a real store, so the cost of the GIMPLE_MODIFY_STMT is the cost
2050 of moving something into "a", which we compute using the function
2051 estimate_move_cost.
2052
2053 The third case deals with TARGET_EXPRs, for which the semantics are
2054 that a temporary is assigned, unless the TARGET_EXPR itself is being
2055 assigned to something else. In the latter case we do not need the
2056 temporary. E.g. in:
2057 <GIMPLE_MODIFY_STMT <var_decl "a"> <target_expr>>, the
2058 GIMPLE_MODIFY_STMT is free. */
2059 case INIT_EXPR:
2060 case GIMPLE_MODIFY_STMT:
2061 /* Is the right and side a TARGET_EXPR? */
2062 if (TREE_CODE (GENERIC_TREE_OPERAND (x, 1)) == TARGET_EXPR)
2063 break;
2064 /* ... fall through ... */
2065
2066 case TARGET_EXPR:
2067 x = GENERIC_TREE_OPERAND (x, 0);
2068 /* Is this an assignments to a register? */
2069 if (is_gimple_reg (x))
2070 break;
2071 /* Otherwise it's a store, so fall through to compute the move cost. */
2072
2073 case CONSTRUCTOR:
2074 d->count += estimate_move_cost (TREE_TYPE (x));
2075 break;
2076
2077 /* Assign cost of 1 to usual operations.
2078 ??? We may consider mapping RTL costs to this. */
2079 case COND_EXPR:
2080 case VEC_COND_EXPR:
2081
2082 case PLUS_EXPR:
2083 case MINUS_EXPR:
2084 case MULT_EXPR:
2085
2086 case FIX_TRUNC_EXPR:
2087
2088 case NEGATE_EXPR:
2089 case FLOAT_EXPR:
2090 case MIN_EXPR:
2091 case MAX_EXPR:
2092 case ABS_EXPR:
2093
2094 case LSHIFT_EXPR:
2095 case RSHIFT_EXPR:
2096 case LROTATE_EXPR:
2097 case RROTATE_EXPR:
2098 case VEC_LSHIFT_EXPR:
2099 case VEC_RSHIFT_EXPR:
2100
2101 case BIT_IOR_EXPR:
2102 case BIT_XOR_EXPR:
2103 case BIT_AND_EXPR:
2104 case BIT_NOT_EXPR:
2105
2106 case TRUTH_ANDIF_EXPR:
2107 case TRUTH_ORIF_EXPR:
2108 case TRUTH_AND_EXPR:
2109 case TRUTH_OR_EXPR:
2110 case TRUTH_XOR_EXPR:
2111 case TRUTH_NOT_EXPR:
2112
2113 case LT_EXPR:
2114 case LE_EXPR:
2115 case GT_EXPR:
2116 case GE_EXPR:
2117 case EQ_EXPR:
2118 case NE_EXPR:
2119 case ORDERED_EXPR:
2120 case UNORDERED_EXPR:
2121
2122 case UNLT_EXPR:
2123 case UNLE_EXPR:
2124 case UNGT_EXPR:
2125 case UNGE_EXPR:
2126 case UNEQ_EXPR:
2127 case LTGT_EXPR:
2128
2129 case CONVERT_EXPR:
2130
2131 case CONJ_EXPR:
2132
2133 case PREDECREMENT_EXPR:
2134 case PREINCREMENT_EXPR:
2135 case POSTDECREMENT_EXPR:
2136 case POSTINCREMENT_EXPR:
2137
2138 case ASM_EXPR:
2139
2140 case REALIGN_LOAD_EXPR:
2141
2142 case REDUC_MAX_EXPR:
2143 case REDUC_MIN_EXPR:
2144 case REDUC_PLUS_EXPR:
2145 case WIDEN_SUM_EXPR:
2146 case DOT_PROD_EXPR:
2147 case VEC_WIDEN_MULT_HI_EXPR:
2148 case VEC_WIDEN_MULT_LO_EXPR:
2149 case VEC_UNPACK_HI_EXPR:
2150 case VEC_UNPACK_LO_EXPR:
2151 case VEC_UNPACK_FLOAT_HI_EXPR:
2152 case VEC_UNPACK_FLOAT_LO_EXPR:
2153 case VEC_PACK_TRUNC_EXPR:
2154 case VEC_PACK_SAT_EXPR:
2155 case VEC_PACK_FIX_TRUNC_EXPR:
2156
2157 case WIDEN_MULT_EXPR:
2158
2159 case VEC_EXTRACT_EVEN_EXPR:
2160 case VEC_EXTRACT_ODD_EXPR:
2161 case VEC_INTERLEAVE_HIGH_EXPR:
2162 case VEC_INTERLEAVE_LOW_EXPR:
2163
2164 case RESX_EXPR:
2165 d->count += 1;
2166 break;
2167
2168 case SWITCH_EXPR:
2169 /* TODO: Cost of a switch should be derived from the number of
2170 branches. */
2171 d->count += d->weights->switch_cost;
2172 break;
2173
2174 /* Few special cases of expensive operations. This is useful
2175 to avoid inlining on functions having too many of these. */
2176 case TRUNC_DIV_EXPR:
2177 case CEIL_DIV_EXPR:
2178 case FLOOR_DIV_EXPR:
2179 case ROUND_DIV_EXPR:
2180 case EXACT_DIV_EXPR:
2181 case TRUNC_MOD_EXPR:
2182 case CEIL_MOD_EXPR:
2183 case FLOOR_MOD_EXPR:
2184 case ROUND_MOD_EXPR:
2185 case RDIV_EXPR:
2186 d->count += d->weights->div_mod_cost;
2187 break;
2188 case CALL_EXPR:
2189 {
2190 tree decl = get_callee_fndecl (x);
2191
2192 cost = d->weights->call_cost;
2193 if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
2194 switch (DECL_FUNCTION_CODE (decl))
2195 {
2196 case BUILT_IN_CONSTANT_P:
2197 *walk_subtrees = 0;
2198 return NULL_TREE;
2199 case BUILT_IN_EXPECT:
2200 return NULL_TREE;
2201 /* Prefetch instruction is not expensive. */
2202 case BUILT_IN_PREFETCH:
2203 cost = 1;
2204 break;
2205 default:
2206 break;
2207 }
2208
2209 /* Our cost must be kept in sync with cgraph_estimate_size_after_inlining
2210 that does use function declaration to figure out the arguments. */
2211 if (!decl)
2212 {
2213 tree a;
2214 call_expr_arg_iterator iter;
2215 FOR_EACH_CALL_EXPR_ARG (a, iter, x)
2216 d->count += estimate_move_cost (TREE_TYPE (a));
2217 }
2218 else
2219 {
2220 tree arg;
2221 for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
2222 d->count += estimate_move_cost (TREE_TYPE (arg));
2223 }
2224
2225 d->count += cost;
2226 break;
2227 }
2228
2229 case OMP_PARALLEL:
2230 case OMP_FOR:
2231 case OMP_SECTIONS:
2232 case OMP_SINGLE:
2233 case OMP_SECTION:
2234 case OMP_MASTER:
2235 case OMP_ORDERED:
2236 case OMP_CRITICAL:
2237 case OMP_ATOMIC:
2238 /* OpenMP directives are generally very expensive. */
2239 d->count += d->weights->omp_cost;
2240 break;
2241
2242 default:
2243 gcc_unreachable ();
2244 }
2245 return NULL;
2246 }
2247
2248 /* Estimate number of instructions that will be created by expanding EXPR.
2249 WEIGHTS contains weights attributed to various constructs. */
2250
2251 int
2252 estimate_num_insns (tree expr, eni_weights *weights)
2253 {
2254 struct pointer_set_t *visited_nodes;
2255 basic_block bb;
2256 block_stmt_iterator bsi;
2257 struct function *my_function;
2258 struct eni_data data;
2259
2260 data.count = 0;
2261 data.weights = weights;
2262
2263 /* If we're given an entire function, walk the CFG. */
2264 if (TREE_CODE (expr) == FUNCTION_DECL)
2265 {
2266 my_function = DECL_STRUCT_FUNCTION (expr);
2267 gcc_assert (my_function && my_function->cfg);
2268 visited_nodes = pointer_set_create ();
2269 FOR_EACH_BB_FN (bb, my_function)
2270 {
2271 for (bsi = bsi_start (bb);
2272 !bsi_end_p (bsi);
2273 bsi_next (&bsi))
2274 {
2275 walk_tree (bsi_stmt_ptr (bsi), estimate_num_insns_1,
2276 &data, visited_nodes);
2277 }
2278 }
2279 pointer_set_destroy (visited_nodes);
2280 }
2281 else
2282 walk_tree_without_duplicates (&expr, estimate_num_insns_1, &data);
2283
2284 return data.count;
2285 }
2286
2287 /* Initializes weights used by estimate_num_insns. */
2288
2289 void
2290 init_inline_once (void)
2291 {
2292 eni_inlining_weights.call_cost = PARAM_VALUE (PARAM_INLINE_CALL_COST);
2293 eni_inlining_weights.div_mod_cost = 10;
2294 eni_inlining_weights.switch_cost = 1;
2295 eni_inlining_weights.omp_cost = 40;
2296
2297 eni_size_weights.call_cost = 1;
2298 eni_size_weights.div_mod_cost = 1;
2299 eni_size_weights.switch_cost = 10;
2300 eni_size_weights.omp_cost = 40;
2301
2302 /* Estimating time for call is difficult, since we have no idea what the
2303 called function does. In the current uses of eni_time_weights,
2304 underestimating the cost does less harm than overestimating it, so
2305 we choose a rather small value here. */
2306 eni_time_weights.call_cost = 10;
2307 eni_time_weights.div_mod_cost = 10;
2308 eni_time_weights.switch_cost = 4;
2309 eni_time_weights.omp_cost = 40;
2310 }
2311
2312 typedef struct function *function_p;
2313
2314 DEF_VEC_P(function_p);
2315 DEF_VEC_ALLOC_P(function_p,heap);
2316
2317 /* Initialized with NOGC, making this poisonous to the garbage collector. */
2318 static VEC(function_p,heap) *cfun_stack;
2319
2320 void
2321 push_cfun (struct function *new_cfun)
2322 {
2323 VEC_safe_push (function_p, heap, cfun_stack, cfun);
2324 cfun = new_cfun;
2325 }
2326
2327 void
2328 pop_cfun (void)
2329 {
2330 cfun = VEC_pop (function_p, cfun_stack);
2331 }
2332
2333 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
2334 static void
2335 add_lexical_block (tree current_block, tree new_block)
2336 {
2337 tree *blk_p;
2338
2339 /* Walk to the last sub-block. */
2340 for (blk_p = &BLOCK_SUBBLOCKS (current_block);
2341 *blk_p;
2342 blk_p = &TREE_CHAIN (*blk_p))
2343 ;
2344 *blk_p = new_block;
2345 BLOCK_SUPERCONTEXT (new_block) = current_block;
2346 }
2347
2348 /* If *TP is a CALL_EXPR, replace it with its inline expansion. */
2349
2350 static bool
2351 expand_call_inline (basic_block bb, tree stmt, tree *tp, void *data)
2352 {
2353 copy_body_data *id;
2354 tree t;
2355 tree use_retvar;
2356 tree fn;
2357 struct pointer_map_t *st;
2358 tree return_slot;
2359 tree modify_dest;
2360 location_t saved_location;
2361 struct cgraph_edge *cg_edge;
2362 const char *reason;
2363 basic_block return_block;
2364 edge e;
2365 block_stmt_iterator bsi, stmt_bsi;
2366 bool successfully_inlined = FALSE;
2367 bool purge_dead_abnormal_edges;
2368 tree t_step;
2369 tree var;
2370
2371 /* See what we've got. */
2372 id = (copy_body_data *) data;
2373 t = *tp;
2374
2375 /* Set input_location here so we get the right instantiation context
2376 if we call instantiate_decl from inlinable_function_p. */
2377 saved_location = input_location;
2378 if (EXPR_HAS_LOCATION (t))
2379 input_location = EXPR_LOCATION (t);
2380
2381 /* From here on, we're only interested in CALL_EXPRs. */
2382 if (TREE_CODE (t) != CALL_EXPR)
2383 goto egress;
2384
2385 /* First, see if we can figure out what function is being called.
2386 If we cannot, then there is no hope of inlining the function. */
2387 fn = get_callee_fndecl (t);
2388 if (!fn)
2389 goto egress;
2390
2391 /* Turn forward declarations into real ones. */
2392 fn = cgraph_node (fn)->decl;
2393
2394 /* If fn is a declaration of a function in a nested scope that was
2395 globally declared inline, we don't set its DECL_INITIAL.
2396 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
2397 C++ front-end uses it for cdtors to refer to their internal
2398 declarations, that are not real functions. Fortunately those
2399 don't have trees to be saved, so we can tell by checking their
2400 DECL_SAVED_TREE. */
2401 if (! DECL_INITIAL (fn)
2402 && DECL_ABSTRACT_ORIGIN (fn)
2403 && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn)))
2404 fn = DECL_ABSTRACT_ORIGIN (fn);
2405
2406 /* Objective C and fortran still calls tree_rest_of_compilation directly.
2407 Kill this check once this is fixed. */
2408 if (!id->dst_node->analyzed)
2409 goto egress;
2410
2411 cg_edge = cgraph_edge (id->dst_node, stmt);
2412
2413 /* Constant propagation on argument done during previous inlining
2414 may create new direct call. Produce an edge for it. */
2415 if (!cg_edge)
2416 {
2417 struct cgraph_node *dest = cgraph_node (fn);
2418
2419 /* We have missing edge in the callgraph. This can happen in one case
2420 where previous inlining turned indirect call into direct call by
2421 constant propagating arguments. In all other cases we hit a bug
2422 (incorrect node sharing is most common reason for missing edges. */
2423 gcc_assert (dest->needed || !flag_unit_at_a_time);
2424 cgraph_create_edge (id->dst_node, dest, stmt,
2425 bb->count, CGRAPH_FREQ_BASE,
2426 bb->loop_depth)->inline_failed
2427 = N_("originally indirect function call not considered for inlining");
2428 if (dump_file)
2429 {
2430 fprintf (dump_file, "Created new direct edge to %s",
2431 cgraph_node_name (dest));
2432 }
2433 goto egress;
2434 }
2435
2436 /* Don't try to inline functions that are not well-suited to
2437 inlining. */
2438 if (!cgraph_inline_p (cg_edge, &reason))
2439 {
2440 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
2441 /* Avoid warnings during early inline pass. */
2442 && (!flag_unit_at_a_time || cgraph_global_info_ready))
2443 {
2444 sorry ("inlining failed in call to %q+F: %s", fn, reason);
2445 sorry ("called from here");
2446 }
2447 else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
2448 && !DECL_IN_SYSTEM_HEADER (fn)
2449 && strlen (reason)
2450 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
2451 /* Avoid warnings during early inline pass. */
2452 && (!flag_unit_at_a_time || cgraph_global_info_ready))
2453 {
2454 warning (OPT_Winline, "inlining failed in call to %q+F: %s",
2455 fn, reason);
2456 warning (OPT_Winline, "called from here");
2457 }
2458 goto egress;
2459 }
2460 fn = cg_edge->callee->decl;
2461
2462 #ifdef ENABLE_CHECKING
2463 if (cg_edge->callee->decl != id->dst_node->decl)
2464 verify_cgraph_node (cg_edge->callee);
2465 #endif
2466
2467 /* We will be inlining this callee. */
2468 id->eh_region = lookup_stmt_eh_region (stmt);
2469
2470 /* Split the block holding the CALL_EXPR. */
2471 e = split_block (bb, stmt);
2472 bb = e->src;
2473 return_block = e->dest;
2474 remove_edge (e);
2475
2476 /* split_block splits after the statement; work around this by
2477 moving the call into the second block manually. Not pretty,
2478 but seems easier than doing the CFG manipulation by hand
2479 when the CALL_EXPR is in the last statement of BB. */
2480 stmt_bsi = bsi_last (bb);
2481 bsi_remove (&stmt_bsi, false);
2482
2483 /* If the CALL_EXPR was in the last statement of BB, it may have
2484 been the source of abnormal edges. In this case, schedule
2485 the removal of dead abnormal edges. */
2486 bsi = bsi_start (return_block);
2487 if (bsi_end_p (bsi))
2488 {
2489 bsi_insert_after (&bsi, stmt, BSI_NEW_STMT);
2490 purge_dead_abnormal_edges = true;
2491 }
2492 else
2493 {
2494 bsi_insert_before (&bsi, stmt, BSI_NEW_STMT);
2495 purge_dead_abnormal_edges = false;
2496 }
2497
2498 stmt_bsi = bsi_start (return_block);
2499
2500 /* Build a block containing code to initialize the arguments, the
2501 actual inline expansion of the body, and a label for the return
2502 statements within the function to jump to. The type of the
2503 statement expression is the return type of the function call. */
2504 id->block = make_node (BLOCK);
2505 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
2506 BLOCK_SOURCE_LOCATION (id->block) = input_location;
2507 add_lexical_block (TREE_BLOCK (stmt), id->block);
2508
2509 /* Local declarations will be replaced by their equivalents in this
2510 map. */
2511 st = id->decl_map;
2512 id->decl_map = pointer_map_create ();
2513
2514 /* Record the function we are about to inline. */
2515 id->src_fn = fn;
2516 id->src_node = cg_edge->callee;
2517 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
2518
2519 initialize_inlined_parameters (id, t, fn, bb);
2520
2521 if (DECL_INITIAL (fn))
2522 add_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
2523
2524 /* Return statements in the function body will be replaced by jumps
2525 to the RET_LABEL. */
2526
2527 gcc_assert (DECL_INITIAL (fn));
2528 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
2529
2530 /* Find the lhs to which the result of this call is assigned. */
2531 return_slot = NULL;
2532 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT)
2533 {
2534 modify_dest = GIMPLE_STMT_OPERAND (stmt, 0);
2535
2536 /* The function which we are inlining might not return a value,
2537 in which case we should issue a warning that the function
2538 does not return a value. In that case the optimizers will
2539 see that the variable to which the value is assigned was not
2540 initialized. We do not want to issue a warning about that
2541 uninitialized variable. */
2542 if (DECL_P (modify_dest))
2543 TREE_NO_WARNING (modify_dest) = 1;
2544 if (CALL_EXPR_RETURN_SLOT_OPT (t))
2545 {
2546 return_slot = modify_dest;
2547 modify_dest = NULL;
2548 }
2549 }
2550 else
2551 modify_dest = NULL;
2552
2553 /* Declare the return variable for the function. */
2554 declare_return_variable (id, return_slot,
2555 modify_dest, &use_retvar);
2556
2557 /* This is it. Duplicate the callee body. Assume callee is
2558 pre-gimplified. Note that we must not alter the caller
2559 function in any way before this point, as this CALL_EXPR may be
2560 a self-referential call; if we're calling ourselves, we need to
2561 duplicate our body before altering anything. */
2562 copy_body (id, bb->count, bb->frequency, bb, return_block);
2563
2564 /* Add local vars in this inlined callee to caller. */
2565 t_step = id->src_cfun->unexpanded_var_list;
2566 for (; t_step; t_step = TREE_CHAIN (t_step))
2567 {
2568 var = TREE_VALUE (t_step);
2569 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
2570 cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
2571 cfun->unexpanded_var_list);
2572 else
2573 cfun->unexpanded_var_list = tree_cons (NULL_TREE, remap_decl (var, id),
2574 cfun->unexpanded_var_list);
2575 }
2576
2577 /* Clean up. */
2578 pointer_map_destroy (id->decl_map);
2579 id->decl_map = st;
2580
2581 /* If the inlined function returns a result that we care about,
2582 clobber the CALL_EXPR with a reference to the return variable. */
2583 if (use_retvar && (TREE_CODE (bsi_stmt (stmt_bsi)) != CALL_EXPR))
2584 {
2585 *tp = use_retvar;
2586 if (gimple_in_ssa_p (cfun))
2587 {
2588 update_stmt (stmt);
2589 mark_symbols_for_renaming (stmt);
2590 }
2591 maybe_clean_or_replace_eh_stmt (stmt, stmt);
2592 }
2593 else
2594 /* We're modifying a TSI owned by gimple_expand_calls_inline();
2595 tsi_delink() will leave the iterator in a sane state. */
2596 {
2597 /* Handle case of inlining function that miss return statement so
2598 return value becomes undefined. */
2599 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT
2600 && TREE_CODE (GIMPLE_STMT_OPERAND (stmt, 0)) == SSA_NAME)
2601 {
2602 tree name = TREE_OPERAND (stmt, 0);
2603 tree var = SSA_NAME_VAR (TREE_OPERAND (stmt, 0));
2604 tree def = gimple_default_def (cfun, var);
2605
2606 /* If the variable is used undefined, make this name undefined via
2607 move. */
2608 if (def)
2609 {
2610 TREE_OPERAND (stmt, 1) = def;
2611 update_stmt (stmt);
2612 }
2613 /* Otherwise make this variable undefined. */
2614 else
2615 {
2616 bsi_remove (&stmt_bsi, true);
2617 set_default_def (var, name);
2618 SSA_NAME_DEF_STMT (name) = build_empty_stmt ();
2619 }
2620 }
2621 else
2622 bsi_remove (&stmt_bsi, true);
2623 }
2624
2625 if (purge_dead_abnormal_edges)
2626 tree_purge_dead_abnormal_call_edges (return_block);
2627
2628 /* If the value of the new expression is ignored, that's OK. We
2629 don't warn about this for CALL_EXPRs, so we shouldn't warn about
2630 the equivalent inlined version either. */
2631 TREE_USED (*tp) = 1;
2632
2633 /* Output the inlining info for this abstract function, since it has been
2634 inlined. If we don't do this now, we can lose the information about the
2635 variables in the function when the blocks get blown away as soon as we
2636 remove the cgraph node. */
2637 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
2638
2639 /* Update callgraph if needed. */
2640 cgraph_remove_node (cg_edge->callee);
2641
2642 id->block = NULL_TREE;
2643 successfully_inlined = TRUE;
2644
2645 egress:
2646 input_location = saved_location;
2647 return successfully_inlined;
2648 }
2649
2650 /* Expand call statements reachable from STMT_P.
2651 We can only have CALL_EXPRs as the "toplevel" tree code or nested
2652 in a GIMPLE_MODIFY_STMT. See tree-gimple.c:get_call_expr_in(). We can
2653 unfortunately not use that function here because we need a pointer
2654 to the CALL_EXPR, not the tree itself. */
2655
2656 static bool
2657 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
2658 {
2659 block_stmt_iterator bsi;
2660
2661 /* Register specific tree functions. */
2662 tree_register_cfg_hooks ();
2663 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
2664 {
2665 tree *expr_p = bsi_stmt_ptr (bsi);
2666 tree stmt = *expr_p;
2667
2668 if (TREE_CODE (*expr_p) == GIMPLE_MODIFY_STMT)
2669 expr_p = &GIMPLE_STMT_OPERAND (*expr_p, 1);
2670 if (TREE_CODE (*expr_p) == WITH_SIZE_EXPR)
2671 expr_p = &TREE_OPERAND (*expr_p, 0);
2672 if (TREE_CODE (*expr_p) == CALL_EXPR)
2673 if (expand_call_inline (bb, stmt, expr_p, id))
2674 return true;
2675 }
2676 return false;
2677 }
2678
2679 /* Walk all basic blocks created after FIRST and try to fold every statement
2680 in the STATEMENTS pointer set. */
2681 static void
2682 fold_marked_statements (int first, struct pointer_set_t *statements)
2683 {
2684 for (;first < n_basic_blocks;first++)
2685 if (BASIC_BLOCK (first))
2686 {
2687 block_stmt_iterator bsi;
2688 for (bsi = bsi_start (BASIC_BLOCK (first));
2689 !bsi_end_p (bsi); bsi_next (&bsi))
2690 if (pointer_set_contains (statements, bsi_stmt (bsi)))
2691 {
2692 tree old_stmt = bsi_stmt (bsi);
2693 if (fold_stmt (bsi_stmt_ptr (bsi)))
2694 {
2695 update_stmt (bsi_stmt (bsi));
2696 if (maybe_clean_or_replace_eh_stmt (old_stmt, bsi_stmt (bsi)))
2697 tree_purge_dead_eh_edges (BASIC_BLOCK (first));
2698 }
2699 }
2700 }
2701 }
2702
2703 /* Return true if BB has at least one abnormal outgoing edge. */
2704
2705 static inline bool
2706 has_abnormal_outgoing_edge_p (basic_block bb)
2707 {
2708 edge e;
2709 edge_iterator ei;
2710
2711 FOR_EACH_EDGE (e, ei, bb->succs)
2712 if (e->flags & EDGE_ABNORMAL)
2713 return true;
2714
2715 return false;
2716 }
2717
2718 /* When a block from the inlined function contains a call with side-effects
2719 in the middle gets inlined in a function with non-locals labels, the call
2720 becomes a potential non-local goto so we need to add appropriate edge. */
2721
2722 static void
2723 make_nonlocal_label_edges (void)
2724 {
2725 block_stmt_iterator bsi;
2726 basic_block bb;
2727
2728 FOR_EACH_BB (bb)
2729 {
2730 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
2731 {
2732 tree stmt = bsi_stmt (bsi);
2733 if (tree_can_make_abnormal_goto (stmt))
2734 {
2735 if (stmt == bsi_stmt (bsi_last (bb)))
2736 {
2737 if (!has_abnormal_outgoing_edge_p (bb))
2738 make_abnormal_goto_edges (bb, true);
2739 }
2740 else
2741 {
2742 edge e = split_block (bb, stmt);
2743 bb = e->src;
2744 make_abnormal_goto_edges (bb, true);
2745 }
2746 break;
2747 }
2748
2749 /* Update PHIs on nonlocal goto receivers we (possibly)
2750 just created new edges into. */
2751 if (TREE_CODE (stmt) == LABEL_EXPR
2752 && gimple_in_ssa_p (cfun))
2753 {
2754 tree target = LABEL_EXPR_LABEL (stmt);
2755 if (DECL_NONLOCAL (target))
2756 {
2757 tree phi;
2758
2759 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
2760 {
2761 gcc_assert (SSA_NAME_OCCURS_IN_ABNORMAL_PHI
2762 (PHI_RESULT (phi)));
2763 mark_sym_for_renaming
2764 (SSA_NAME_VAR (PHI_RESULT (phi)));
2765 }
2766 }
2767 }
2768 }
2769 }
2770 }
2771
2772 /* Expand calls to inline functions in the body of FN. */
2773
2774 unsigned int
2775 optimize_inline_calls (tree fn)
2776 {
2777 copy_body_data id;
2778 tree prev_fn;
2779 basic_block bb;
2780 int last = n_basic_blocks;
2781 /* There is no point in performing inlining if errors have already
2782 occurred -- and we might crash if we try to inline invalid
2783 code. */
2784 if (errorcount || sorrycount)
2785 return 0;
2786
2787 /* Clear out ID. */
2788 memset (&id, 0, sizeof (id));
2789
2790 id.src_node = id.dst_node = cgraph_node (fn);
2791 id.dst_fn = fn;
2792 /* Or any functions that aren't finished yet. */
2793 prev_fn = NULL_TREE;
2794 if (current_function_decl)
2795 {
2796 id.dst_fn = current_function_decl;
2797 prev_fn = current_function_decl;
2798 }
2799
2800 id.copy_decl = copy_decl_maybe_to_var;
2801 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2802 id.transform_new_cfg = false;
2803 id.transform_return_to_modify = true;
2804 id.transform_lang_insert_block = false;
2805 id.statements_to_fold = pointer_set_create ();
2806
2807 push_gimplify_context ();
2808
2809 /* We make no attempts to keep dominance info up-to-date. */
2810 free_dominance_info (CDI_DOMINATORS);
2811 free_dominance_info (CDI_POST_DOMINATORS);
2812
2813 /* Reach the trees by walking over the CFG, and note the
2814 enclosing basic-blocks in the call edges. */
2815 /* We walk the blocks going forward, because inlined function bodies
2816 will split id->current_basic_block, and the new blocks will
2817 follow it; we'll trudge through them, processing their CALL_EXPRs
2818 along the way. */
2819 FOR_EACH_BB (bb)
2820 gimple_expand_calls_inline (bb, &id);
2821
2822 pop_gimplify_context (NULL);
2823 /* Renumber the (code) basic_blocks consecutively. */
2824 compact_blocks ();
2825 /* Renumber the lexical scoping (non-code) blocks consecutively. */
2826 number_blocks (fn);
2827
2828 #ifdef ENABLE_CHECKING
2829 {
2830 struct cgraph_edge *e;
2831
2832 verify_cgraph_node (id.dst_node);
2833
2834 /* Double check that we inlined everything we are supposed to inline. */
2835 for (e = id.dst_node->callees; e; e = e->next_callee)
2836 gcc_assert (e->inline_failed);
2837 }
2838 #endif
2839
2840 /* We are not going to maintain the cgraph edges up to date.
2841 Kill it so it won't confuse us. */
2842 cgraph_node_remove_callees (id.dst_node);
2843
2844 fold_marked_statements (last, id.statements_to_fold);
2845 pointer_set_destroy (id.statements_to_fold);
2846 fold_cond_expr_cond ();
2847 if (current_function_has_nonlocal_label)
2848 make_nonlocal_label_edges ();
2849 /* It would be nice to check SSA/CFG/statement consistency here, but it is
2850 not possible yet - the IPA passes might make various functions to not
2851 throw and they don't care to proactively update local EH info. This is
2852 done later in fixup_cfg pass that also execute the verification. */
2853 return (TODO_update_ssa | TODO_cleanup_cfg
2854 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
2855 | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
2856 }
2857
2858 /* FN is a function that has a complete body, and CLONE is a function whose
2859 body is to be set to a copy of FN, mapping argument declarations according
2860 to the ARG_MAP splay_tree. */
2861
2862 void
2863 clone_body (tree clone, tree fn, void *arg_map)
2864 {
2865 copy_body_data id;
2866
2867 /* Clone the body, as if we were making an inline call. But, remap the
2868 parameters in the callee to the parameters of caller. */
2869 memset (&id, 0, sizeof (id));
2870 id.src_fn = fn;
2871 id.dst_fn = clone;
2872 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
2873 id.decl_map = (struct pointer_map_t *)arg_map;
2874
2875 id.copy_decl = copy_decl_no_change;
2876 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
2877 id.transform_new_cfg = true;
2878 id.transform_return_to_modify = false;
2879 id.transform_lang_insert_block = true;
2880
2881 /* We're not inside any EH region. */
2882 id.eh_region = -1;
2883
2884 /* Actually copy the body. */
2885 append_to_statement_list_force (copy_generic_body (&id), &DECL_SAVED_TREE (clone));
2886 }
2887
2888 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
2889
2890 tree
2891 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2892 {
2893 enum tree_code code = TREE_CODE (*tp);
2894 enum tree_code_class cl = TREE_CODE_CLASS (code);
2895
2896 /* We make copies of most nodes. */
2897 if (IS_EXPR_CODE_CLASS (cl)
2898 || IS_GIMPLE_STMT_CODE_CLASS (cl)
2899 || code == TREE_LIST
2900 || code == TREE_VEC
2901 || code == TYPE_DECL
2902 || code == OMP_CLAUSE)
2903 {
2904 /* Because the chain gets clobbered when we make a copy, we save it
2905 here. */
2906 tree chain = NULL_TREE, new;
2907
2908 if (!GIMPLE_TUPLE_P (*tp))
2909 chain = TREE_CHAIN (*tp);
2910
2911 /* Copy the node. */
2912 new = copy_node (*tp);
2913
2914 /* Propagate mudflap marked-ness. */
2915 if (flag_mudflap && mf_marked_p (*tp))
2916 mf_mark (new);
2917
2918 *tp = new;
2919
2920 /* Now, restore the chain, if appropriate. That will cause
2921 walk_tree to walk into the chain as well. */
2922 if (code == PARM_DECL
2923 || code == TREE_LIST
2924 || code == OMP_CLAUSE)
2925 TREE_CHAIN (*tp) = chain;
2926
2927 /* For now, we don't update BLOCKs when we make copies. So, we
2928 have to nullify all BIND_EXPRs. */
2929 if (TREE_CODE (*tp) == BIND_EXPR)
2930 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
2931 }
2932 else if (code == CONSTRUCTOR)
2933 {
2934 /* CONSTRUCTOR nodes need special handling because
2935 we need to duplicate the vector of elements. */
2936 tree new;
2937
2938 new = copy_node (*tp);
2939
2940 /* Propagate mudflap marked-ness. */
2941 if (flag_mudflap && mf_marked_p (*tp))
2942 mf_mark (new);
2943
2944 CONSTRUCTOR_ELTS (new) = VEC_copy (constructor_elt, gc,
2945 CONSTRUCTOR_ELTS (*tp));
2946 *tp = new;
2947 }
2948 else if (TREE_CODE_CLASS (code) == tcc_type)
2949 *walk_subtrees = 0;
2950 else if (TREE_CODE_CLASS (code) == tcc_declaration)
2951 *walk_subtrees = 0;
2952 else if (TREE_CODE_CLASS (code) == tcc_constant)
2953 *walk_subtrees = 0;
2954 else
2955 gcc_assert (code != STATEMENT_LIST);
2956 return NULL_TREE;
2957 }
2958
2959 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
2960 information indicating to what new SAVE_EXPR this one should be mapped,
2961 use that one. Otherwise, create a new node and enter it in ST. FN is
2962 the function into which the copy will be placed. */
2963
2964 static void
2965 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
2966 {
2967 struct pointer_map_t *st = (struct pointer_map_t *) st_;
2968 tree *n;
2969 tree t;
2970
2971 /* See if we already encountered this SAVE_EXPR. */
2972 n = (tree *) pointer_map_contains (st, *tp);
2973
2974 /* If we didn't already remap this SAVE_EXPR, do so now. */
2975 if (!n)
2976 {
2977 t = copy_node (*tp);
2978
2979 /* Remember this SAVE_EXPR. */
2980 *pointer_map_insert (st, *tp) = t;
2981 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
2982 *pointer_map_insert (st, t) = t;
2983 }
2984 else
2985 {
2986 /* We've already walked into this SAVE_EXPR; don't do it again. */
2987 *walk_subtrees = 0;
2988 t = *n;
2989 }
2990
2991 /* Replace this SAVE_EXPR with the copy. */
2992 *tp = t;
2993 }
2994
2995 /* Called via walk_tree. If *TP points to a DECL_STMT for a local label,
2996 copies the declaration and enters it in the splay_tree in DATA (which is
2997 really an `copy_body_data *'). */
2998
2999 static tree
3000 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
3001 void *data)
3002 {
3003 copy_body_data *id = (copy_body_data *) data;
3004
3005 /* Don't walk into types. */
3006 if (TYPE_P (*tp))
3007 *walk_subtrees = 0;
3008
3009 else if (TREE_CODE (*tp) == LABEL_EXPR)
3010 {
3011 tree decl = TREE_OPERAND (*tp, 0);
3012
3013 /* Copy the decl and remember the copy. */
3014 insert_decl_map (id, decl, id->copy_decl (decl, id));
3015 }
3016
3017 return NULL_TREE;
3018 }
3019
3020 /* Perform any modifications to EXPR required when it is unsaved. Does
3021 not recurse into EXPR's subtrees. */
3022
3023 static void
3024 unsave_expr_1 (tree expr)
3025 {
3026 switch (TREE_CODE (expr))
3027 {
3028 case TARGET_EXPR:
3029 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
3030 It's OK for this to happen if it was part of a subtree that
3031 isn't immediately expanded, such as operand 2 of another
3032 TARGET_EXPR. */
3033 if (TREE_OPERAND (expr, 1))
3034 break;
3035
3036 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
3037 TREE_OPERAND (expr, 3) = NULL_TREE;
3038 break;
3039
3040 default:
3041 break;
3042 }
3043 }
3044
3045 /* Called via walk_tree when an expression is unsaved. Using the
3046 splay_tree pointed to by ST (which is really a `splay_tree'),
3047 remaps all local declarations to appropriate replacements. */
3048
3049 static tree
3050 unsave_r (tree *tp, int *walk_subtrees, void *data)
3051 {
3052 copy_body_data *id = (copy_body_data *) data;
3053 struct pointer_map_t *st = id->decl_map;
3054 tree *n;
3055
3056 /* Only a local declaration (variable or label). */
3057 if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
3058 || TREE_CODE (*tp) == LABEL_DECL)
3059 {
3060 /* Lookup the declaration. */
3061 n = (tree *) pointer_map_contains (st, *tp);
3062
3063 /* If it's there, remap it. */
3064 if (n)
3065 *tp = *n;
3066 }
3067
3068 else if (TREE_CODE (*tp) == STATEMENT_LIST)
3069 copy_statement_list (tp);
3070 else if (TREE_CODE (*tp) == BIND_EXPR)
3071 copy_bind_expr (tp, walk_subtrees, id);
3072 else if (TREE_CODE (*tp) == SAVE_EXPR)
3073 remap_save_expr (tp, st, walk_subtrees);
3074 else
3075 {
3076 copy_tree_r (tp, walk_subtrees, NULL);
3077
3078 /* Do whatever unsaving is required. */
3079 unsave_expr_1 (*tp);
3080 }
3081
3082 /* Keep iterating. */
3083 return NULL_TREE;
3084 }
3085
3086 /* Copies everything in EXPR and replaces variables, labels
3087 and SAVE_EXPRs local to EXPR. */
3088
3089 tree
3090 unsave_expr_now (tree expr)
3091 {
3092 copy_body_data id;
3093
3094 /* There's nothing to do for NULL_TREE. */
3095 if (expr == 0)
3096 return expr;
3097
3098 /* Set up ID. */
3099 memset (&id, 0, sizeof (id));
3100 id.src_fn = current_function_decl;
3101 id.dst_fn = current_function_decl;
3102 id.decl_map = pointer_map_create ();
3103
3104 id.copy_decl = copy_decl_no_change;
3105 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
3106 id.transform_new_cfg = false;
3107 id.transform_return_to_modify = false;
3108 id.transform_lang_insert_block = false;
3109
3110 /* Walk the tree once to find local labels. */
3111 walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
3112
3113 /* Walk the tree again, copying, remapping, and unsaving. */
3114 walk_tree (&expr, unsave_r, &id, NULL);
3115
3116 /* Clean up. */
3117 pointer_map_destroy (id.decl_map);
3118
3119 return expr;
3120 }
3121
3122 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
3123
3124 static tree
3125 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
3126 {
3127 if (*tp == data)
3128 return (tree) data;
3129 else
3130 return NULL;
3131 }
3132
3133 bool
3134 debug_find_tree (tree top, tree search)
3135 {
3136 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
3137 }
3138
3139
3140 /* Declare the variables created by the inliner. Add all the variables in
3141 VARS to BIND_EXPR. */
3142
3143 static void
3144 declare_inline_vars (tree block, tree vars)
3145 {
3146 tree t;
3147 for (t = vars; t; t = TREE_CHAIN (t))
3148 {
3149 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
3150 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
3151 cfun->unexpanded_var_list =
3152 tree_cons (NULL_TREE, t,
3153 cfun->unexpanded_var_list);
3154 }
3155
3156 if (block)
3157 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
3158 }
3159
3160
3161 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
3162 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
3163 VAR_DECL translation. */
3164
3165 static tree
3166 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
3167 {
3168 /* Don't generate debug information for the copy if we wouldn't have
3169 generated it for the copy either. */
3170 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
3171 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
3172
3173 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
3174 declaration inspired this copy. */
3175 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
3176
3177 /* The new variable/label has no RTL, yet. */
3178 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
3179 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
3180 SET_DECL_RTL (copy, NULL_RTX);
3181
3182 /* These args would always appear unused, if not for this. */
3183 TREE_USED (copy) = 1;
3184
3185 /* Set the context for the new declaration. */
3186 if (!DECL_CONTEXT (decl))
3187 /* Globals stay global. */
3188 ;
3189 else if (DECL_CONTEXT (decl) != id->src_fn)
3190 /* Things that weren't in the scope of the function we're inlining
3191 from aren't in the scope we're inlining to, either. */
3192 ;
3193 else if (TREE_STATIC (decl))
3194 /* Function-scoped static variables should stay in the original
3195 function. */
3196 ;
3197 else
3198 /* Ordinary automatic local variables are now in the scope of the
3199 new function. */
3200 DECL_CONTEXT (copy) = id->dst_fn;
3201
3202 return copy;
3203 }
3204
3205 static tree
3206 copy_decl_to_var (tree decl, copy_body_data *id)
3207 {
3208 tree copy, type;
3209
3210 gcc_assert (TREE_CODE (decl) == PARM_DECL
3211 || TREE_CODE (decl) == RESULT_DECL);
3212
3213 type = TREE_TYPE (decl);
3214
3215 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
3216 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
3217 TREE_READONLY (copy) = TREE_READONLY (decl);
3218 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
3219 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
3220
3221 return copy_decl_for_dup_finish (id, decl, copy);
3222 }
3223
3224 /* Like copy_decl_to_var, but create a return slot object instead of a
3225 pointer variable for return by invisible reference. */
3226
3227 static tree
3228 copy_result_decl_to_var (tree decl, copy_body_data *id)
3229 {
3230 tree copy, type;
3231
3232 gcc_assert (TREE_CODE (decl) == PARM_DECL
3233 || TREE_CODE (decl) == RESULT_DECL);
3234
3235 type = TREE_TYPE (decl);
3236 if (DECL_BY_REFERENCE (decl))
3237 type = TREE_TYPE (type);
3238
3239 copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
3240 TREE_READONLY (copy) = TREE_READONLY (decl);
3241 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
3242 if (!DECL_BY_REFERENCE (decl))
3243 {
3244 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
3245 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
3246 }
3247
3248 return copy_decl_for_dup_finish (id, decl, copy);
3249 }
3250
3251
3252 static tree
3253 copy_decl_no_change (tree decl, copy_body_data *id)
3254 {
3255 tree copy;
3256
3257 copy = copy_node (decl);
3258
3259 /* The COPY is not abstract; it will be generated in DST_FN. */
3260 DECL_ABSTRACT (copy) = 0;
3261 lang_hooks.dup_lang_specific_decl (copy);
3262
3263 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
3264 been taken; it's for internal bookkeeping in expand_goto_internal. */
3265 if (TREE_CODE (copy) == LABEL_DECL)
3266 {
3267 TREE_ADDRESSABLE (copy) = 0;
3268 LABEL_DECL_UID (copy) = -1;
3269 }
3270
3271 return copy_decl_for_dup_finish (id, decl, copy);
3272 }
3273
3274 static tree
3275 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
3276 {
3277 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
3278 return copy_decl_to_var (decl, id);
3279 else
3280 return copy_decl_no_change (decl, id);
3281 }
3282
3283 /* Return a copy of the function's argument tree. */
3284 static tree
3285 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id)
3286 {
3287 tree *arg_copy, *parg;
3288
3289 arg_copy = &orig_parm;
3290 for (parg = arg_copy; *parg; parg = &TREE_CHAIN (*parg))
3291 {
3292 tree new = remap_decl (*parg, id);
3293 lang_hooks.dup_lang_specific_decl (new);
3294 TREE_CHAIN (new) = TREE_CHAIN (*parg);
3295 *parg = new;
3296 }
3297 return orig_parm;
3298 }
3299
3300 /* Return a copy of the function's static chain. */
3301 static tree
3302 copy_static_chain (tree static_chain, copy_body_data * id)
3303 {
3304 tree *chain_copy, *pvar;
3305
3306 chain_copy = &static_chain;
3307 for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
3308 {
3309 tree new = remap_decl (*pvar, id);
3310 lang_hooks.dup_lang_specific_decl (new);
3311 TREE_CHAIN (new) = TREE_CHAIN (*pvar);
3312 *pvar = new;
3313 }
3314 return static_chain;
3315 }
3316
3317 /* Return true if the function is allowed to be versioned.
3318 This is a guard for the versioning functionality. */
3319 bool
3320 tree_versionable_function_p (tree fndecl)
3321 {
3322 if (fndecl == NULL_TREE)
3323 return false;
3324 /* ??? There are cases where a function is
3325 uninlinable but can be versioned. */
3326 if (!tree_inlinable_function_p (fndecl))
3327 return false;
3328
3329 return true;
3330 }
3331
3332 /* Create a copy of a function's tree.
3333 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
3334 of the original function and the new copied function
3335 respectively. In case we want to replace a DECL
3336 tree with another tree while duplicating the function's
3337 body, TREE_MAP represents the mapping between these
3338 trees. If UPDATE_CLONES is set, the call_stmt fields
3339 of edges of clones of the function will be updated. */
3340 void
3341 tree_function_versioning (tree old_decl, tree new_decl, varray_type tree_map,
3342 bool update_clones)
3343 {
3344 struct cgraph_node *old_version_node;
3345 struct cgraph_node *new_version_node;
3346 copy_body_data id;
3347 tree p;
3348 unsigned i;
3349 struct ipa_replace_map *replace_info;
3350 basic_block old_entry_block;
3351 tree t_step;
3352 tree old_current_function_decl = current_function_decl;
3353
3354 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
3355 && TREE_CODE (new_decl) == FUNCTION_DECL);
3356 DECL_POSSIBLY_INLINED (old_decl) = 1;
3357
3358 old_version_node = cgraph_node (old_decl);
3359 new_version_node = cgraph_node (new_decl);
3360
3361 DECL_ARTIFICIAL (new_decl) = 1;
3362 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
3363
3364 /* Prepare the data structures for the tree copy. */
3365 memset (&id, 0, sizeof (id));
3366
3367 /* Generate a new name for the new version. */
3368 if (!update_clones)
3369 {
3370 DECL_NAME (new_decl) = create_tmp_var_name (NULL);
3371 SET_DECL_ASSEMBLER_NAME (new_decl, DECL_NAME (new_decl));
3372 SET_DECL_RTL (new_decl, NULL_RTX);
3373 id.statements_to_fold = pointer_set_create ();
3374 }
3375
3376 id.decl_map = pointer_map_create ();
3377 id.src_fn = old_decl;
3378 id.dst_fn = new_decl;
3379 id.src_node = old_version_node;
3380 id.dst_node = new_version_node;
3381 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
3382
3383 id.copy_decl = copy_decl_no_change;
3384 id.transform_call_graph_edges
3385 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
3386 id.transform_new_cfg = true;
3387 id.transform_return_to_modify = false;
3388 id.transform_lang_insert_block = false;
3389
3390 current_function_decl = new_decl;
3391 old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
3392 (DECL_STRUCT_FUNCTION (old_decl));
3393 initialize_cfun (new_decl, old_decl,
3394 old_entry_block->count,
3395 old_entry_block->frequency);
3396 push_cfun (DECL_STRUCT_FUNCTION (new_decl));
3397
3398 /* Copy the function's static chain. */
3399 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
3400 if (p)
3401 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
3402 copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
3403 &id);
3404 /* Copy the function's arguments. */
3405 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
3406 DECL_ARGUMENTS (new_decl) =
3407 copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id);
3408
3409 /* If there's a tree_map, prepare for substitution. */
3410 if (tree_map)
3411 for (i = 0; i < VARRAY_ACTIVE_SIZE (tree_map); i++)
3412 {
3413 replace_info = VARRAY_GENERIC_PTR (tree_map, i);
3414 if (replace_info->replace_p)
3415 insert_decl_map (&id, replace_info->old_tree,
3416 replace_info->new_tree);
3417 }
3418
3419 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
3420
3421 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3422 number_blocks (id.dst_fn);
3423
3424 if (DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list != NULL_TREE)
3425 /* Add local vars. */
3426 for (t_step = DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list;
3427 t_step; t_step = TREE_CHAIN (t_step))
3428 {
3429 tree var = TREE_VALUE (t_step);
3430 if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3431 cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
3432 cfun->unexpanded_var_list);
3433 else
3434 cfun->unexpanded_var_list =
3435 tree_cons (NULL_TREE, remap_decl (var, &id),
3436 cfun->unexpanded_var_list);
3437 }
3438
3439 /* Copy the Function's body. */
3440 copy_body (&id, old_entry_block->count, old_entry_block->frequency, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR);
3441
3442 if (DECL_RESULT (old_decl) != NULL_TREE)
3443 {
3444 tree *res_decl = &DECL_RESULT (old_decl);
3445 DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
3446 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
3447 }
3448
3449 /* Renumber the lexical scoping (non-code) blocks consecutively. */
3450 number_blocks (new_decl);
3451
3452 /* Clean up. */
3453 pointer_map_destroy (id.decl_map);
3454 if (!update_clones)
3455 {
3456 fold_marked_statements (0, id.statements_to_fold);
3457 pointer_set_destroy (id.statements_to_fold);
3458 fold_cond_expr_cond ();
3459 }
3460 if (gimple_in_ssa_p (cfun))
3461 {
3462 free_dominance_info (CDI_DOMINATORS);
3463 free_dominance_info (CDI_POST_DOMINATORS);
3464 if (!update_clones)
3465 delete_unreachable_blocks ();
3466 update_ssa (TODO_update_ssa);
3467 if (!update_clones)
3468 {
3469 fold_cond_expr_cond ();
3470 if (need_ssa_update_p ())
3471 update_ssa (TODO_update_ssa);
3472 }
3473 }
3474 free_dominance_info (CDI_DOMINATORS);
3475 free_dominance_info (CDI_POST_DOMINATORS);
3476 pop_cfun ();
3477 current_function_decl = old_current_function_decl;
3478 gcc_assert (!current_function_decl
3479 || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
3480 return;
3481 }
3482
3483 /* Duplicate a type, fields and all. */
3484
3485 tree
3486 build_duplicate_type (tree type)
3487 {
3488 struct copy_body_data id;
3489
3490 memset (&id, 0, sizeof (id));
3491 id.src_fn = current_function_decl;
3492 id.dst_fn = current_function_decl;
3493 id.src_cfun = cfun;
3494 id.decl_map = pointer_map_create ();
3495
3496 type = remap_type_1 (type, &id);
3497
3498 pointer_map_destroy (id.decl_map);
3499
3500 return type;
3501 }