* config/riscv/riscv.c: Remove unnecessary includes. Reorder
[official-gcc.git] / gcc / tree-inline.c
blobd4e4ef172479afe981f80543444ddd834510f523
1 /* Tree inlining.
2 Copyright (C) 2001-2017 Free Software Foundation, Inc.
3 Contributed by Alexandre Oliva <aoliva@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 #include "config.h"
22 #include "system.h"
23 #include "coretypes.h"
24 #include "backend.h"
25 #include "target.h"
26 #include "rtl.h"
27 #include "tree.h"
28 #include "gimple.h"
29 #include "cfghooks.h"
30 #include "tree-pass.h"
31 #include "ssa.h"
32 #include "cgraph.h"
33 #include "tree-pretty-print.h"
34 #include "diagnostic-core.h"
35 #include "gimple-predict.h"
36 #include "fold-const.h"
37 #include "stor-layout.h"
38 #include "calls.h"
39 #include "tree-inline.h"
40 #include "langhooks.h"
41 #include "cfganal.h"
42 #include "tree-iterator.h"
43 #include "intl.h"
44 #include "gimple-fold.h"
45 #include "tree-eh.h"
46 #include "gimplify.h"
47 #include "gimple-iterator.h"
48 #include "gimplify-me.h"
49 #include "gimple-walk.h"
50 #include "tree-cfg.h"
51 #include "tree-into-ssa.h"
52 #include "tree-dfa.h"
53 #include "tree-ssa.h"
54 #include "except.h"
55 #include "debug.h"
56 #include "value-prof.h"
57 #include "cfgloop.h"
58 #include "builtins.h"
59 #include "tree-chkp.h"
62 /* I'm not real happy about this, but we need to handle gimple and
63 non-gimple trees. */
65 /* Inlining, Cloning, Versioning, Parallelization
67 Inlining: a function body is duplicated, but the PARM_DECLs are
68 remapped into VAR_DECLs, and non-void RETURN_EXPRs become
69 MODIFY_EXPRs that store to a dedicated returned-value variable.
70 The duplicated eh_region info of the copy will later be appended
71 to the info for the caller; the eh_region info in copied throwing
72 statements and RESX statements are adjusted accordingly.
74 Cloning: (only in C++) We have one body for a con/de/structor, and
75 multiple function decls, each with a unique parameter list.
76 Duplicate the body, using the given splay tree; some parameters
77 will become constants (like 0 or 1).
79 Versioning: a function body is duplicated and the result is a new
80 function rather than into blocks of an existing function as with
81 inlining. Some parameters will become constants.
83 Parallelization: a region of a function is duplicated resulting in
84 a new function. Variables may be replaced with complex expressions
85 to enable shared variable semantics.
87 All of these will simultaneously lookup any callgraph edges. If
88 we're going to inline the duplicated function body, and the given
89 function has some cloned callgraph nodes (one for each place this
90 function will be inlined) those callgraph edges will be duplicated.
91 If we're cloning the body, those callgraph edges will be
92 updated to point into the new body. (Note that the original
93 callgraph node and edge list will not be altered.)
95 See the CALL_EXPR handling case in copy_tree_body_r (). */
97 /* To Do:
99 o In order to make inlining-on-trees work, we pessimized
100 function-local static constants. In particular, they are now
101 always output, even when not addressed. Fix this by treating
102 function-local static constants just like global static
103 constants; the back-end already knows not to output them if they
104 are not needed.
106 o Provide heuristics to clamp inlining of recursive template
107 calls? */
110 /* Weights that estimate_num_insns uses to estimate the size of the
111 produced code. */
113 eni_weights eni_size_weights;
115 /* Weights that estimate_num_insns uses to estimate the time necessary
116 to execute the produced code. */
118 eni_weights eni_time_weights;
120 /* Prototypes. */
122 static tree declare_return_variable (copy_body_data *, tree, tree, tree,
123 basic_block);
124 static void remap_block (tree *, copy_body_data *);
125 static void copy_bind_expr (tree *, int *, copy_body_data *);
126 static void declare_inline_vars (tree, tree);
127 static void remap_save_expr (tree *, hash_map<tree, tree> *, int *);
128 static void prepend_lexical_block (tree current_block, tree new_block);
129 static tree copy_decl_to_var (tree, copy_body_data *);
130 static tree copy_result_decl_to_var (tree, copy_body_data *);
131 static tree copy_decl_maybe_to_var (tree, copy_body_data *);
132 static gimple_seq remap_gimple_stmt (gimple *, copy_body_data *);
133 static bool delete_unreachable_blocks_update_callgraph (copy_body_data *id);
134 static void insert_init_stmt (copy_body_data *, basic_block, gimple *);
136 /* Insert a tree->tree mapping for ID. Despite the name suggests
137 that the trees should be variables, it is used for more than that. */
139 void
140 insert_decl_map (copy_body_data *id, tree key, tree value)
142 id->decl_map->put (key, value);
144 /* Always insert an identity map as well. If we see this same new
145 node again, we won't want to duplicate it a second time. */
146 if (key != value)
147 id->decl_map->put (value, value);
150 /* Insert a tree->tree mapping for ID. This is only used for
151 variables. */
153 static void
154 insert_debug_decl_map (copy_body_data *id, tree key, tree value)
156 if (!gimple_in_ssa_p (id->src_cfun))
157 return;
159 if (!opt_for_fn (id->dst_fn, flag_var_tracking_assignments))
160 return;
162 if (!target_for_debug_bind (key))
163 return;
165 gcc_assert (TREE_CODE (key) == PARM_DECL);
166 gcc_assert (VAR_P (value));
168 if (!id->debug_map)
169 id->debug_map = new hash_map<tree, tree>;
171 id->debug_map->put (key, value);
174 /* If nonzero, we're remapping the contents of inlined debug
175 statements. If negative, an error has occurred, such as a
176 reference to a variable that isn't available in the inlined
177 context. */
178 static int processing_debug_stmt = 0;
180 /* Construct new SSA name for old NAME. ID is the inline context. */
182 static tree
183 remap_ssa_name (tree name, copy_body_data *id)
185 tree new_tree, var;
186 tree *n;
188 gcc_assert (TREE_CODE (name) == SSA_NAME);
190 n = id->decl_map->get (name);
191 if (n)
192 return unshare_expr (*n);
194 if (processing_debug_stmt)
196 if (SSA_NAME_IS_DEFAULT_DEF (name)
197 && TREE_CODE (SSA_NAME_VAR (name)) == PARM_DECL
198 && id->entry_bb == NULL
199 && single_succ_p (ENTRY_BLOCK_PTR_FOR_FN (cfun)))
201 tree vexpr = make_node (DEBUG_EXPR_DECL);
202 gimple *def_temp;
203 gimple_stmt_iterator gsi;
204 tree val = SSA_NAME_VAR (name);
206 n = id->decl_map->get (val);
207 if (n != NULL)
208 val = *n;
209 if (TREE_CODE (val) != PARM_DECL)
211 processing_debug_stmt = -1;
212 return name;
214 def_temp = gimple_build_debug_source_bind (vexpr, val, NULL);
215 DECL_ARTIFICIAL (vexpr) = 1;
216 TREE_TYPE (vexpr) = TREE_TYPE (name);
217 SET_DECL_MODE (vexpr, DECL_MODE (SSA_NAME_VAR (name)));
218 gsi = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun)));
219 gsi_insert_before (&gsi, def_temp, GSI_SAME_STMT);
220 return vexpr;
223 processing_debug_stmt = -1;
224 return name;
227 /* Remap anonymous SSA names or SSA names of anonymous decls. */
228 var = SSA_NAME_VAR (name);
229 if (!var
230 || (!SSA_NAME_IS_DEFAULT_DEF (name)
231 && VAR_P (var)
232 && !VAR_DECL_IS_VIRTUAL_OPERAND (var)
233 && DECL_ARTIFICIAL (var)
234 && DECL_IGNORED_P (var)
235 && !DECL_NAME (var)))
237 struct ptr_info_def *pi;
238 new_tree = make_ssa_name (remap_type (TREE_TYPE (name), id));
239 if (!var && SSA_NAME_IDENTIFIER (name))
240 SET_SSA_NAME_VAR_OR_IDENTIFIER (new_tree, SSA_NAME_IDENTIFIER (name));
241 insert_decl_map (id, name, new_tree);
242 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree)
243 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name);
244 /* At least IPA points-to info can be directly transferred. */
245 if (id->src_cfun->gimple_df
246 && id->src_cfun->gimple_df->ipa_pta
247 && POINTER_TYPE_P (TREE_TYPE (name))
248 && (pi = SSA_NAME_PTR_INFO (name))
249 && !pi->pt.anything)
251 struct ptr_info_def *new_pi = get_ptr_info (new_tree);
252 new_pi->pt = pi->pt;
254 return new_tree;
257 /* Do not set DEF_STMT yet as statement is not copied yet. We do that
258 in copy_bb. */
259 new_tree = remap_decl (var, id);
261 /* We might've substituted constant or another SSA_NAME for
262 the variable.
264 Replace the SSA name representing RESULT_DECL by variable during
265 inlining: this saves us from need to introduce PHI node in a case
266 return value is just partly initialized. */
267 if ((VAR_P (new_tree) || TREE_CODE (new_tree) == PARM_DECL)
268 && (!SSA_NAME_VAR (name)
269 || TREE_CODE (SSA_NAME_VAR (name)) != RESULT_DECL
270 || !id->transform_return_to_modify))
272 struct ptr_info_def *pi;
273 new_tree = make_ssa_name (new_tree);
274 insert_decl_map (id, name, new_tree);
275 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree)
276 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name);
277 /* At least IPA points-to info can be directly transferred. */
278 if (id->src_cfun->gimple_df
279 && id->src_cfun->gimple_df->ipa_pta
280 && POINTER_TYPE_P (TREE_TYPE (name))
281 && (pi = SSA_NAME_PTR_INFO (name))
282 && !pi->pt.anything)
284 struct ptr_info_def *new_pi = get_ptr_info (new_tree);
285 new_pi->pt = pi->pt;
287 if (SSA_NAME_IS_DEFAULT_DEF (name))
289 /* By inlining function having uninitialized variable, we might
290 extend the lifetime (variable might get reused). This cause
291 ICE in the case we end up extending lifetime of SSA name across
292 abnormal edge, but also increase register pressure.
294 We simply initialize all uninitialized vars by 0 except
295 for case we are inlining to very first BB. We can avoid
296 this for all BBs that are not inside strongly connected
297 regions of the CFG, but this is expensive to test. */
298 if (id->entry_bb
299 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name)
300 && (!SSA_NAME_VAR (name)
301 || TREE_CODE (SSA_NAME_VAR (name)) != PARM_DECL)
302 && (id->entry_bb != EDGE_SUCC (ENTRY_BLOCK_PTR_FOR_FN (cfun),
303 0)->dest
304 || EDGE_COUNT (id->entry_bb->preds) != 1))
306 gimple_stmt_iterator gsi = gsi_last_bb (id->entry_bb);
307 gimple *init_stmt;
308 tree zero = build_zero_cst (TREE_TYPE (new_tree));
310 init_stmt = gimple_build_assign (new_tree, zero);
311 gsi_insert_after (&gsi, init_stmt, GSI_NEW_STMT);
312 SSA_NAME_IS_DEFAULT_DEF (new_tree) = 0;
314 else
316 SSA_NAME_DEF_STMT (new_tree) = gimple_build_nop ();
317 set_ssa_default_def (cfun, SSA_NAME_VAR (new_tree), new_tree);
321 else
322 insert_decl_map (id, name, new_tree);
323 return new_tree;
326 /* Remap DECL during the copying of the BLOCK tree for the function. */
328 tree
329 remap_decl (tree decl, copy_body_data *id)
331 tree *n;
333 /* We only remap local variables in the current function. */
335 /* See if we have remapped this declaration. */
337 n = id->decl_map->get (decl);
339 if (!n && processing_debug_stmt)
341 processing_debug_stmt = -1;
342 return decl;
345 /* When remapping a type within copy_gimple_seq_and_replace_locals, all
346 necessary DECLs have already been remapped and we do not want to duplicate
347 a decl coming from outside of the sequence we are copying. */
348 if (!n
349 && id->prevent_decl_creation_for_types
350 && id->remapping_type_depth > 0
351 && (VAR_P (decl) || TREE_CODE (decl) == PARM_DECL))
352 return decl;
354 /* If we didn't already have an equivalent for this declaration, create one
355 now. */
356 if (!n)
358 /* Make a copy of the variable or label. */
359 tree t = id->copy_decl (decl, id);
361 /* Remember it, so that if we encounter this local entity again
362 we can reuse this copy. Do this early because remap_type may
363 need this decl for TYPE_STUB_DECL. */
364 insert_decl_map (id, decl, t);
366 if (!DECL_P (t))
367 return t;
369 /* Remap types, if necessary. */
370 TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
371 if (TREE_CODE (t) == TYPE_DECL)
373 DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
375 /* Preserve the invariant that DECL_ORIGINAL_TYPE != TREE_TYPE,
376 which is enforced in gen_typedef_die when DECL_ABSTRACT_ORIGIN
377 is not set on the TYPE_DECL, for example in LTO mode. */
378 if (DECL_ORIGINAL_TYPE (t) == TREE_TYPE (t))
380 tree x = build_variant_type_copy (TREE_TYPE (t));
381 TYPE_STUB_DECL (x) = TYPE_STUB_DECL (TREE_TYPE (t));
382 TYPE_NAME (x) = TYPE_NAME (TREE_TYPE (t));
383 DECL_ORIGINAL_TYPE (t) = x;
387 /* Remap sizes as necessary. */
388 walk_tree (&DECL_SIZE (t), copy_tree_body_r, id, NULL);
389 walk_tree (&DECL_SIZE_UNIT (t), copy_tree_body_r, id, NULL);
391 /* If fields, do likewise for offset and qualifier. */
392 if (TREE_CODE (t) == FIELD_DECL)
394 walk_tree (&DECL_FIELD_OFFSET (t), copy_tree_body_r, id, NULL);
395 if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
396 walk_tree (&DECL_QUALIFIER (t), copy_tree_body_r, id, NULL);
399 return t;
402 if (id->do_not_unshare)
403 return *n;
404 else
405 return unshare_expr (*n);
408 static tree
409 remap_type_1 (tree type, copy_body_data *id)
411 tree new_tree, t;
413 /* We do need a copy. build and register it now. If this is a pointer or
414 reference type, remap the designated type and make a new pointer or
415 reference type. */
416 if (TREE_CODE (type) == POINTER_TYPE)
418 new_tree = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
419 TYPE_MODE (type),
420 TYPE_REF_CAN_ALIAS_ALL (type));
421 if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type))
422 new_tree = build_type_attribute_qual_variant (new_tree,
423 TYPE_ATTRIBUTES (type),
424 TYPE_QUALS (type));
425 insert_decl_map (id, type, new_tree);
426 return new_tree;
428 else if (TREE_CODE (type) == REFERENCE_TYPE)
430 new_tree = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
431 TYPE_MODE (type),
432 TYPE_REF_CAN_ALIAS_ALL (type));
433 if (TYPE_ATTRIBUTES (type) || TYPE_QUALS (type))
434 new_tree = build_type_attribute_qual_variant (new_tree,
435 TYPE_ATTRIBUTES (type),
436 TYPE_QUALS (type));
437 insert_decl_map (id, type, new_tree);
438 return new_tree;
440 else
441 new_tree = copy_node (type);
443 insert_decl_map (id, type, new_tree);
445 /* This is a new type, not a copy of an old type. Need to reassociate
446 variants. We can handle everything except the main variant lazily. */
447 t = TYPE_MAIN_VARIANT (type);
448 if (type != t)
450 t = remap_type (t, id);
451 TYPE_MAIN_VARIANT (new_tree) = t;
452 TYPE_NEXT_VARIANT (new_tree) = TYPE_NEXT_VARIANT (t);
453 TYPE_NEXT_VARIANT (t) = new_tree;
455 else
457 TYPE_MAIN_VARIANT (new_tree) = new_tree;
458 TYPE_NEXT_VARIANT (new_tree) = NULL;
461 if (TYPE_STUB_DECL (type))
462 TYPE_STUB_DECL (new_tree) = remap_decl (TYPE_STUB_DECL (type), id);
464 /* Lazily create pointer and reference types. */
465 TYPE_POINTER_TO (new_tree) = NULL;
466 TYPE_REFERENCE_TO (new_tree) = NULL;
468 /* Copy all types that may contain references to local variables; be sure to
469 preserve sharing in between type and its main variant when possible. */
470 switch (TREE_CODE (new_tree))
472 case INTEGER_TYPE:
473 case REAL_TYPE:
474 case FIXED_POINT_TYPE:
475 case ENUMERAL_TYPE:
476 case BOOLEAN_TYPE:
477 if (TYPE_MAIN_VARIANT (new_tree) != new_tree)
479 gcc_checking_assert (TYPE_MIN_VALUE (type) == TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (type)));
480 gcc_checking_assert (TYPE_MAX_VALUE (type) == TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (type)));
482 TYPE_MIN_VALUE (new_tree) = TYPE_MIN_VALUE (TYPE_MAIN_VARIANT (new_tree));
483 TYPE_MAX_VALUE (new_tree) = TYPE_MAX_VALUE (TYPE_MAIN_VARIANT (new_tree));
485 else
487 t = TYPE_MIN_VALUE (new_tree);
488 if (t && TREE_CODE (t) != INTEGER_CST)
489 walk_tree (&TYPE_MIN_VALUE (new_tree), copy_tree_body_r, id, NULL);
491 t = TYPE_MAX_VALUE (new_tree);
492 if (t && TREE_CODE (t) != INTEGER_CST)
493 walk_tree (&TYPE_MAX_VALUE (new_tree), copy_tree_body_r, id, NULL);
495 return new_tree;
497 case FUNCTION_TYPE:
498 if (TYPE_MAIN_VARIANT (new_tree) != new_tree
499 && TREE_TYPE (type) == TREE_TYPE (TYPE_MAIN_VARIANT (type)))
500 TREE_TYPE (new_tree) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree));
501 else
502 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
503 if (TYPE_MAIN_VARIANT (new_tree) != new_tree
504 && TYPE_ARG_TYPES (type) == TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (type)))
505 TYPE_ARG_TYPES (new_tree) = TYPE_ARG_TYPES (TYPE_MAIN_VARIANT (new_tree));
506 else
507 walk_tree (&TYPE_ARG_TYPES (new_tree), copy_tree_body_r, id, NULL);
508 return new_tree;
510 case ARRAY_TYPE:
511 if (TYPE_MAIN_VARIANT (new_tree) != new_tree
512 && TREE_TYPE (type) == TREE_TYPE (TYPE_MAIN_VARIANT (type)))
513 TREE_TYPE (new_tree) = TREE_TYPE (TYPE_MAIN_VARIANT (new_tree));
514 else
515 TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
517 if (TYPE_MAIN_VARIANT (new_tree) != new_tree)
519 gcc_checking_assert (TYPE_DOMAIN (type) == TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)));
520 TYPE_DOMAIN (new_tree) = TYPE_DOMAIN (TYPE_MAIN_VARIANT (new_tree));
522 else
523 TYPE_DOMAIN (new_tree) = remap_type (TYPE_DOMAIN (new_tree), id);
524 break;
526 case RECORD_TYPE:
527 case UNION_TYPE:
528 case QUAL_UNION_TYPE:
529 if (TYPE_MAIN_VARIANT (type) != type
530 && TYPE_FIELDS (type) == TYPE_FIELDS (TYPE_MAIN_VARIANT (type)))
531 TYPE_FIELDS (new_tree) = TYPE_FIELDS (TYPE_MAIN_VARIANT (new_tree));
532 else
534 tree f, nf = NULL;
536 for (f = TYPE_FIELDS (new_tree); f ; f = DECL_CHAIN (f))
538 t = remap_decl (f, id);
539 DECL_CONTEXT (t) = new_tree;
540 DECL_CHAIN (t) = nf;
541 nf = t;
543 TYPE_FIELDS (new_tree) = nreverse (nf);
545 break;
547 case OFFSET_TYPE:
548 default:
549 /* Shouldn't have been thought variable sized. */
550 gcc_unreachable ();
553 /* All variants of type share the same size, so use the already remaped data. */
554 if (TYPE_MAIN_VARIANT (new_tree) != new_tree)
556 gcc_checking_assert (TYPE_SIZE (type) == TYPE_SIZE (TYPE_MAIN_VARIANT (type)));
557 gcc_checking_assert (TYPE_SIZE_UNIT (type) == TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (type)));
559 TYPE_SIZE (new_tree) = TYPE_SIZE (TYPE_MAIN_VARIANT (new_tree));
560 TYPE_SIZE_UNIT (new_tree) = TYPE_SIZE_UNIT (TYPE_MAIN_VARIANT (new_tree));
562 else
564 walk_tree (&TYPE_SIZE (new_tree), copy_tree_body_r, id, NULL);
565 walk_tree (&TYPE_SIZE_UNIT (new_tree), copy_tree_body_r, id, NULL);
568 return new_tree;
571 tree
572 remap_type (tree type, copy_body_data *id)
574 tree *node;
575 tree tmp;
577 if (type == NULL)
578 return type;
580 /* See if we have remapped this type. */
581 node = id->decl_map->get (type);
582 if (node)
583 return *node;
585 /* The type only needs remapping if it's variably modified. */
586 if (! variably_modified_type_p (type, id->src_fn))
588 insert_decl_map (id, type, type);
589 return type;
592 id->remapping_type_depth++;
593 tmp = remap_type_1 (type, id);
594 id->remapping_type_depth--;
596 return tmp;
599 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs. */
601 static bool
602 can_be_nonlocal (tree decl, copy_body_data *id)
604 /* We can not duplicate function decls. */
605 if (TREE_CODE (decl) == FUNCTION_DECL)
606 return true;
608 /* Local static vars must be non-local or we get multiple declaration
609 problems. */
610 if (VAR_P (decl) && !auto_var_in_fn_p (decl, id->src_fn))
611 return true;
613 return false;
616 static tree
617 remap_decls (tree decls, vec<tree, va_gc> **nonlocalized_list,
618 copy_body_data *id)
620 tree old_var;
621 tree new_decls = NULL_TREE;
623 /* Remap its variables. */
624 for (old_var = decls; old_var; old_var = DECL_CHAIN (old_var))
626 tree new_var;
628 if (can_be_nonlocal (old_var, id))
630 /* We need to add this variable to the local decls as otherwise
631 nothing else will do so. */
632 if (VAR_P (old_var) && ! DECL_EXTERNAL (old_var) && cfun)
633 add_local_decl (cfun, old_var);
634 if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
635 && !DECL_IGNORED_P (old_var)
636 && nonlocalized_list)
637 vec_safe_push (*nonlocalized_list, old_var);
638 continue;
641 /* Remap the variable. */
642 new_var = remap_decl (old_var, id);
644 /* If we didn't remap this variable, we can't mess with its
645 TREE_CHAIN. If we remapped this variable to the return slot, it's
646 already declared somewhere else, so don't declare it here. */
648 if (new_var == id->retvar)
650 else if (!new_var)
652 if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
653 && !DECL_IGNORED_P (old_var)
654 && nonlocalized_list)
655 vec_safe_push (*nonlocalized_list, old_var);
657 else
659 gcc_assert (DECL_P (new_var));
660 DECL_CHAIN (new_var) = new_decls;
661 new_decls = new_var;
663 /* Also copy value-expressions. */
664 if (VAR_P (new_var) && DECL_HAS_VALUE_EXPR_P (new_var))
666 tree tem = DECL_VALUE_EXPR (new_var);
667 bool old_regimplify = id->regimplify;
668 id->remapping_type_depth++;
669 walk_tree (&tem, copy_tree_body_r, id, NULL);
670 id->remapping_type_depth--;
671 id->regimplify = old_regimplify;
672 SET_DECL_VALUE_EXPR (new_var, tem);
677 return nreverse (new_decls);
680 /* Copy the BLOCK to contain remapped versions of the variables
681 therein. And hook the new block into the block-tree. */
683 static void
684 remap_block (tree *block, copy_body_data *id)
686 tree old_block;
687 tree new_block;
689 /* Make the new block. */
690 old_block = *block;
691 new_block = make_node (BLOCK);
692 TREE_USED (new_block) = TREE_USED (old_block);
693 BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
694 BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
695 BLOCK_NONLOCALIZED_VARS (new_block)
696 = vec_safe_copy (BLOCK_NONLOCALIZED_VARS (old_block));
697 *block = new_block;
699 /* Remap its variables. */
700 BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block),
701 &BLOCK_NONLOCALIZED_VARS (new_block),
702 id);
704 if (id->transform_lang_insert_block)
705 id->transform_lang_insert_block (new_block);
707 /* Remember the remapped block. */
708 insert_decl_map (id, old_block, new_block);
711 /* Copy the whole block tree and root it in id->block. */
712 static tree
713 remap_blocks (tree block, copy_body_data *id)
715 tree t;
716 tree new_tree = block;
718 if (!block)
719 return NULL;
721 remap_block (&new_tree, id);
722 gcc_assert (new_tree != block);
723 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
724 prepend_lexical_block (new_tree, remap_blocks (t, id));
725 /* Blocks are in arbitrary order, but make things slightly prettier and do
726 not swap order when producing a copy. */
727 BLOCK_SUBBLOCKS (new_tree) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree));
728 return new_tree;
731 /* Remap the block tree rooted at BLOCK to nothing. */
732 static void
733 remap_blocks_to_null (tree block, copy_body_data *id)
735 tree t;
736 insert_decl_map (id, block, NULL_TREE);
737 for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
738 remap_blocks_to_null (t, id);
741 static void
742 copy_statement_list (tree *tp)
744 tree_stmt_iterator oi, ni;
745 tree new_tree;
747 new_tree = alloc_stmt_list ();
748 ni = tsi_start (new_tree);
749 oi = tsi_start (*tp);
750 TREE_TYPE (new_tree) = TREE_TYPE (*tp);
751 *tp = new_tree;
753 for (; !tsi_end_p (oi); tsi_next (&oi))
755 tree stmt = tsi_stmt (oi);
756 if (TREE_CODE (stmt) == STATEMENT_LIST)
757 /* This copy is not redundant; tsi_link_after will smash this
758 STATEMENT_LIST into the end of the one we're building, and we
759 don't want to do that with the original. */
760 copy_statement_list (&stmt);
761 tsi_link_after (&ni, stmt, TSI_CONTINUE_LINKING);
765 static void
766 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
768 tree block = BIND_EXPR_BLOCK (*tp);
769 /* Copy (and replace) the statement. */
770 copy_tree_r (tp, walk_subtrees, NULL);
771 if (block)
773 remap_block (&block, id);
774 BIND_EXPR_BLOCK (*tp) = block;
777 if (BIND_EXPR_VARS (*tp))
778 /* This will remap a lot of the same decls again, but this should be
779 harmless. */
780 BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), NULL, id);
784 /* Create a new gimple_seq by remapping all the statements in BODY
785 using the inlining information in ID. */
787 static gimple_seq
788 remap_gimple_seq (gimple_seq body, copy_body_data *id)
790 gimple_stmt_iterator si;
791 gimple_seq new_body = NULL;
793 for (si = gsi_start (body); !gsi_end_p (si); gsi_next (&si))
795 gimple_seq new_stmts = remap_gimple_stmt (gsi_stmt (si), id);
796 gimple_seq_add_seq (&new_body, new_stmts);
799 return new_body;
803 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
804 block using the mapping information in ID. */
806 static gimple *
807 copy_gimple_bind (gbind *stmt, copy_body_data *id)
809 gimple *new_bind;
810 tree new_block, new_vars;
811 gimple_seq body, new_body;
813 /* Copy the statement. Note that we purposely don't use copy_stmt
814 here because we need to remap statements as we copy. */
815 body = gimple_bind_body (stmt);
816 new_body = remap_gimple_seq (body, id);
818 new_block = gimple_bind_block (stmt);
819 if (new_block)
820 remap_block (&new_block, id);
822 /* This will remap a lot of the same decls again, but this should be
823 harmless. */
824 new_vars = gimple_bind_vars (stmt);
825 if (new_vars)
826 new_vars = remap_decls (new_vars, NULL, id);
828 new_bind = gimple_build_bind (new_vars, new_body, new_block);
830 return new_bind;
833 /* Return true if DECL is a parameter or a SSA_NAME for a parameter. */
835 static bool
836 is_parm (tree decl)
838 if (TREE_CODE (decl) == SSA_NAME)
840 decl = SSA_NAME_VAR (decl);
841 if (!decl)
842 return false;
845 return (TREE_CODE (decl) == PARM_DECL);
848 /* Remap the dependence CLIQUE from the source to the destination function
849 as specified in ID. */
851 static unsigned short
852 remap_dependence_clique (copy_body_data *id, unsigned short clique)
854 if (clique == 0 || processing_debug_stmt)
855 return 0;
856 if (!id->dependence_map)
857 id->dependence_map = new hash_map<dependence_hash, unsigned short>;
858 bool existed;
859 unsigned short &newc = id->dependence_map->get_or_insert (clique, &existed);
860 if (!existed)
861 newc = ++cfun->last_clique;
862 return newc;
865 /* Remap the GIMPLE operand pointed to by *TP. DATA is really a
866 'struct walk_stmt_info *'. DATA->INFO is a 'copy_body_data *'.
867 WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
868 recursing into the children nodes of *TP. */
870 static tree
871 remap_gimple_op_r (tree *tp, int *walk_subtrees, void *data)
873 struct walk_stmt_info *wi_p = (struct walk_stmt_info *) data;
874 copy_body_data *id = (copy_body_data *) wi_p->info;
875 tree fn = id->src_fn;
877 /* For recursive invocations this is no longer the LHS itself. */
878 bool is_lhs = wi_p->is_lhs;
879 wi_p->is_lhs = false;
881 if (TREE_CODE (*tp) == SSA_NAME)
883 *tp = remap_ssa_name (*tp, id);
884 *walk_subtrees = 0;
885 if (is_lhs)
886 SSA_NAME_DEF_STMT (*tp) = wi_p->stmt;
887 return NULL;
889 else if (auto_var_in_fn_p (*tp, fn))
891 /* Local variables and labels need to be replaced by equivalent
892 variables. We don't want to copy static variables; there's
893 only one of those, no matter how many times we inline the
894 containing function. Similarly for globals from an outer
895 function. */
896 tree new_decl;
898 /* Remap the declaration. */
899 new_decl = remap_decl (*tp, id);
900 gcc_assert (new_decl);
901 /* Replace this variable with the copy. */
902 STRIP_TYPE_NOPS (new_decl);
903 /* ??? The C++ frontend uses void * pointer zero to initialize
904 any other type. This confuses the middle-end type verification.
905 As cloned bodies do not go through gimplification again the fixup
906 there doesn't trigger. */
907 if (TREE_CODE (new_decl) == INTEGER_CST
908 && !useless_type_conversion_p (TREE_TYPE (*tp), TREE_TYPE (new_decl)))
909 new_decl = fold_convert (TREE_TYPE (*tp), new_decl);
910 *tp = new_decl;
911 *walk_subtrees = 0;
913 else if (TREE_CODE (*tp) == STATEMENT_LIST)
914 gcc_unreachable ();
915 else if (TREE_CODE (*tp) == SAVE_EXPR)
916 gcc_unreachable ();
917 else if (TREE_CODE (*tp) == LABEL_DECL
918 && (!DECL_CONTEXT (*tp)
919 || decl_function_context (*tp) == id->src_fn))
920 /* These may need to be remapped for EH handling. */
921 *tp = remap_decl (*tp, id);
922 else if (TREE_CODE (*tp) == FIELD_DECL)
924 /* If the enclosing record type is variably_modified_type_p, the field
925 has already been remapped. Otherwise, it need not be. */
926 tree *n = id->decl_map->get (*tp);
927 if (n)
928 *tp = *n;
929 *walk_subtrees = 0;
931 else if (TYPE_P (*tp))
932 /* Types may need remapping as well. */
933 *tp = remap_type (*tp, id);
934 else if (CONSTANT_CLASS_P (*tp))
936 /* If this is a constant, we have to copy the node iff the type
937 will be remapped. copy_tree_r will not copy a constant. */
938 tree new_type = remap_type (TREE_TYPE (*tp), id);
940 if (new_type == TREE_TYPE (*tp))
941 *walk_subtrees = 0;
943 else if (TREE_CODE (*tp) == INTEGER_CST)
944 *tp = wide_int_to_tree (new_type, *tp);
945 else
947 *tp = copy_node (*tp);
948 TREE_TYPE (*tp) = new_type;
951 else
953 /* Otherwise, just copy the node. Note that copy_tree_r already
954 knows not to copy VAR_DECLs, etc., so this is safe. */
956 if (TREE_CODE (*tp) == MEM_REF)
958 /* We need to re-canonicalize MEM_REFs from inline substitutions
959 that can happen when a pointer argument is an ADDR_EXPR.
960 Recurse here manually to allow that. */
961 tree ptr = TREE_OPERAND (*tp, 0);
962 tree type = remap_type (TREE_TYPE (*tp), id);
963 tree old = *tp;
964 walk_tree (&ptr, remap_gimple_op_r, data, NULL);
965 *tp = fold_build2 (MEM_REF, type, ptr, TREE_OPERAND (*tp, 1));
966 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
967 TREE_SIDE_EFFECTS (*tp) = TREE_SIDE_EFFECTS (old);
968 TREE_NO_WARNING (*tp) = TREE_NO_WARNING (old);
969 if (MR_DEPENDENCE_CLIQUE (old) != 0)
971 MR_DEPENDENCE_CLIQUE (*tp)
972 = remap_dependence_clique (id, MR_DEPENDENCE_CLIQUE (old));
973 MR_DEPENDENCE_BASE (*tp) = MR_DEPENDENCE_BASE (old);
975 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
976 remapped a parameter as the property might be valid only
977 for the parameter itself. */
978 if (TREE_THIS_NOTRAP (old)
979 && (!is_parm (TREE_OPERAND (old, 0))
980 || (!id->transform_parameter && is_parm (ptr))))
981 TREE_THIS_NOTRAP (*tp) = 1;
982 REF_REVERSE_STORAGE_ORDER (*tp) = REF_REVERSE_STORAGE_ORDER (old);
983 *walk_subtrees = 0;
984 return NULL;
987 /* Here is the "usual case". Copy this tree node, and then
988 tweak some special cases. */
989 copy_tree_r (tp, walk_subtrees, NULL);
991 if (TREE_CODE (*tp) != OMP_CLAUSE)
992 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
994 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
996 /* The copied TARGET_EXPR has never been expanded, even if the
997 original node was expanded already. */
998 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
999 TREE_OPERAND (*tp, 3) = NULL_TREE;
1001 else if (TREE_CODE (*tp) == ADDR_EXPR)
1003 /* Variable substitution need not be simple. In particular,
1004 the MEM_REF substitution above. Make sure that
1005 TREE_CONSTANT and friends are up-to-date. */
1006 int invariant = is_gimple_min_invariant (*tp);
1007 walk_tree (&TREE_OPERAND (*tp, 0), remap_gimple_op_r, data, NULL);
1008 recompute_tree_invariant_for_addr_expr (*tp);
1010 /* If this used to be invariant, but is not any longer,
1011 then regimplification is probably needed. */
1012 if (invariant && !is_gimple_min_invariant (*tp))
1013 id->regimplify = true;
1015 *walk_subtrees = 0;
1019 /* Update the TREE_BLOCK for the cloned expr. */
1020 if (EXPR_P (*tp))
1022 tree new_block = id->remapping_type_depth == 0 ? id->block : NULL;
1023 tree old_block = TREE_BLOCK (*tp);
1024 if (old_block)
1026 tree *n;
1027 n = id->decl_map->get (TREE_BLOCK (*tp));
1028 if (n)
1029 new_block = *n;
1031 TREE_SET_BLOCK (*tp, new_block);
1034 /* Keep iterating. */
1035 return NULL_TREE;
1039 /* Called from copy_body_id via walk_tree. DATA is really a
1040 `copy_body_data *'. */
1042 tree
1043 copy_tree_body_r (tree *tp, int *walk_subtrees, void *data)
1045 copy_body_data *id = (copy_body_data *) data;
1046 tree fn = id->src_fn;
1047 tree new_block;
1049 /* Begin by recognizing trees that we'll completely rewrite for the
1050 inlining context. Our output for these trees is completely
1051 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1052 into an edge). Further down, we'll handle trees that get
1053 duplicated and/or tweaked. */
1055 /* When requested, RETURN_EXPRs should be transformed to just the
1056 contained MODIFY_EXPR. The branch semantics of the return will
1057 be handled elsewhere by manipulating the CFG rather than a statement. */
1058 if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
1060 tree assignment = TREE_OPERAND (*tp, 0);
1062 /* If we're returning something, just turn that into an
1063 assignment into the equivalent of the original RESULT_DECL.
1064 If the "assignment" is just the result decl, the result
1065 decl has already been set (e.g. a recent "foo (&result_decl,
1066 ...)"); just toss the entire RETURN_EXPR. */
1067 if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
1069 /* Replace the RETURN_EXPR with (a copy of) the
1070 MODIFY_EXPR hanging underneath. */
1071 *tp = copy_node (assignment);
1073 else /* Else the RETURN_EXPR returns no value. */
1075 *tp = NULL;
1076 return (tree) (void *)1;
1079 else if (TREE_CODE (*tp) == SSA_NAME)
1081 *tp = remap_ssa_name (*tp, id);
1082 *walk_subtrees = 0;
1083 return NULL;
1086 /* Local variables and labels need to be replaced by equivalent
1087 variables. We don't want to copy static variables; there's only
1088 one of those, no matter how many times we inline the containing
1089 function. Similarly for globals from an outer function. */
1090 else if (auto_var_in_fn_p (*tp, fn))
1092 tree new_decl;
1094 /* Remap the declaration. */
1095 new_decl = remap_decl (*tp, id);
1096 gcc_assert (new_decl);
1097 /* Replace this variable with the copy. */
1098 STRIP_TYPE_NOPS (new_decl);
1099 *tp = new_decl;
1100 *walk_subtrees = 0;
1102 else if (TREE_CODE (*tp) == STATEMENT_LIST)
1103 copy_statement_list (tp);
1104 else if (TREE_CODE (*tp) == SAVE_EXPR
1105 || TREE_CODE (*tp) == TARGET_EXPR)
1106 remap_save_expr (tp, id->decl_map, walk_subtrees);
1107 else if (TREE_CODE (*tp) == LABEL_DECL
1108 && (! DECL_CONTEXT (*tp)
1109 || decl_function_context (*tp) == id->src_fn))
1110 /* These may need to be remapped for EH handling. */
1111 *tp = remap_decl (*tp, id);
1112 else if (TREE_CODE (*tp) == BIND_EXPR)
1113 copy_bind_expr (tp, walk_subtrees, id);
1114 /* Types may need remapping as well. */
1115 else if (TYPE_P (*tp))
1116 *tp = remap_type (*tp, id);
1118 /* If this is a constant, we have to copy the node iff the type will be
1119 remapped. copy_tree_r will not copy a constant. */
1120 else if (CONSTANT_CLASS_P (*tp))
1122 tree new_type = remap_type (TREE_TYPE (*tp), id);
1124 if (new_type == TREE_TYPE (*tp))
1125 *walk_subtrees = 0;
1127 else if (TREE_CODE (*tp) == INTEGER_CST)
1128 *tp = wide_int_to_tree (new_type, *tp);
1129 else
1131 *tp = copy_node (*tp);
1132 TREE_TYPE (*tp) = new_type;
1136 /* Otherwise, just copy the node. Note that copy_tree_r already
1137 knows not to copy VAR_DECLs, etc., so this is safe. */
1138 else
1140 /* Here we handle trees that are not completely rewritten.
1141 First we detect some inlining-induced bogosities for
1142 discarding. */
1143 if (TREE_CODE (*tp) == MODIFY_EXPR
1144 && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1)
1145 && (auto_var_in_fn_p (TREE_OPERAND (*tp, 0), fn)))
1147 /* Some assignments VAR = VAR; don't generate any rtl code
1148 and thus don't count as variable modification. Avoid
1149 keeping bogosities like 0 = 0. */
1150 tree decl = TREE_OPERAND (*tp, 0), value;
1151 tree *n;
1153 n = id->decl_map->get (decl);
1154 if (n)
1156 value = *n;
1157 STRIP_TYPE_NOPS (value);
1158 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1160 *tp = build_empty_stmt (EXPR_LOCATION (*tp));
1161 return copy_tree_body_r (tp, walk_subtrees, data);
1165 else if (TREE_CODE (*tp) == INDIRECT_REF)
1167 /* Get rid of *& from inline substitutions that can happen when a
1168 pointer argument is an ADDR_EXPR. */
1169 tree decl = TREE_OPERAND (*tp, 0);
1170 tree *n = id->decl_map->get (decl);
1171 if (n)
1173 /* If we happen to get an ADDR_EXPR in n->value, strip
1174 it manually here as we'll eventually get ADDR_EXPRs
1175 which lie about their types pointed to. In this case
1176 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1177 but we absolutely rely on that. As fold_indirect_ref
1178 does other useful transformations, try that first, though. */
1179 tree type = TREE_TYPE (*tp);
1180 tree ptr = id->do_not_unshare ? *n : unshare_expr (*n);
1181 tree old = *tp;
1182 *tp = gimple_fold_indirect_ref (ptr);
1183 if (! *tp)
1185 if (TREE_CODE (ptr) == ADDR_EXPR)
1188 = fold_indirect_ref_1 (EXPR_LOCATION (ptr), type, ptr);
1189 /* ??? We should either assert here or build
1190 a VIEW_CONVERT_EXPR instead of blindly leaking
1191 incompatible types to our IL. */
1192 if (! *tp)
1193 *tp = TREE_OPERAND (ptr, 0);
1195 else
1197 *tp = build1 (INDIRECT_REF, type, ptr);
1198 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
1199 TREE_SIDE_EFFECTS (*tp) = TREE_SIDE_EFFECTS (old);
1200 TREE_READONLY (*tp) = TREE_READONLY (old);
1201 /* We cannot propagate the TREE_THIS_NOTRAP flag if we
1202 have remapped a parameter as the property might be
1203 valid only for the parameter itself. */
1204 if (TREE_THIS_NOTRAP (old)
1205 && (!is_parm (TREE_OPERAND (old, 0))
1206 || (!id->transform_parameter && is_parm (ptr))))
1207 TREE_THIS_NOTRAP (*tp) = 1;
1210 *walk_subtrees = 0;
1211 return NULL;
1214 else if (TREE_CODE (*tp) == MEM_REF)
1216 /* We need to re-canonicalize MEM_REFs from inline substitutions
1217 that can happen when a pointer argument is an ADDR_EXPR.
1218 Recurse here manually to allow that. */
1219 tree ptr = TREE_OPERAND (*tp, 0);
1220 tree type = remap_type (TREE_TYPE (*tp), id);
1221 tree old = *tp;
1222 walk_tree (&ptr, copy_tree_body_r, data, NULL);
1223 *tp = fold_build2 (MEM_REF, type, ptr, TREE_OPERAND (*tp, 1));
1224 TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
1225 TREE_SIDE_EFFECTS (*tp) = TREE_SIDE_EFFECTS (old);
1226 TREE_NO_WARNING (*tp) = TREE_NO_WARNING (old);
1227 if (MR_DEPENDENCE_CLIQUE (old) != 0)
1229 MR_DEPENDENCE_CLIQUE (*tp)
1230 = remap_dependence_clique (id, MR_DEPENDENCE_CLIQUE (old));
1231 MR_DEPENDENCE_BASE (*tp) = MR_DEPENDENCE_BASE (old);
1233 /* We cannot propagate the TREE_THIS_NOTRAP flag if we have
1234 remapped a parameter as the property might be valid only
1235 for the parameter itself. */
1236 if (TREE_THIS_NOTRAP (old)
1237 && (!is_parm (TREE_OPERAND (old, 0))
1238 || (!id->transform_parameter && is_parm (ptr))))
1239 TREE_THIS_NOTRAP (*tp) = 1;
1240 REF_REVERSE_STORAGE_ORDER (*tp) = REF_REVERSE_STORAGE_ORDER (old);
1241 *walk_subtrees = 0;
1242 return NULL;
1245 /* Here is the "usual case". Copy this tree node, and then
1246 tweak some special cases. */
1247 copy_tree_r (tp, walk_subtrees, NULL);
1249 /* If EXPR has block defined, map it to newly constructed block.
1250 When inlining we want EXPRs without block appear in the block
1251 of function call if we are not remapping a type. */
1252 if (EXPR_P (*tp))
1254 new_block = id->remapping_type_depth == 0 ? id->block : NULL;
1255 if (TREE_BLOCK (*tp))
1257 tree *n;
1258 n = id->decl_map->get (TREE_BLOCK (*tp));
1259 if (n)
1260 new_block = *n;
1262 TREE_SET_BLOCK (*tp, new_block);
1265 if (TREE_CODE (*tp) != OMP_CLAUSE)
1266 TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
1268 /* The copied TARGET_EXPR has never been expanded, even if the
1269 original node was expanded already. */
1270 if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
1272 TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
1273 TREE_OPERAND (*tp, 3) = NULL_TREE;
1276 /* Variable substitution need not be simple. In particular, the
1277 INDIRECT_REF substitution above. Make sure that TREE_CONSTANT
1278 and friends are up-to-date. */
1279 else if (TREE_CODE (*tp) == ADDR_EXPR)
1281 int invariant = is_gimple_min_invariant (*tp);
1282 walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
1284 /* Handle the case where we substituted an INDIRECT_REF
1285 into the operand of the ADDR_EXPR. */
1286 if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
1288 tree t = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
1289 if (TREE_TYPE (t) != TREE_TYPE (*tp))
1290 t = fold_convert (remap_type (TREE_TYPE (*tp), id), t);
1291 *tp = t;
1293 else
1294 recompute_tree_invariant_for_addr_expr (*tp);
1296 /* If this used to be invariant, but is not any longer,
1297 then regimplification is probably needed. */
1298 if (invariant && !is_gimple_min_invariant (*tp))
1299 id->regimplify = true;
1301 *walk_subtrees = 0;
1305 /* Keep iterating. */
1306 return NULL_TREE;
1309 /* Helper for remap_gimple_stmt. Given an EH region number for the
1310 source function, map that to the duplicate EH region number in
1311 the destination function. */
1313 static int
1314 remap_eh_region_nr (int old_nr, copy_body_data *id)
1316 eh_region old_r, new_r;
1318 old_r = get_eh_region_from_number_fn (id->src_cfun, old_nr);
1319 new_r = static_cast<eh_region> (*id->eh_map->get (old_r));
1321 return new_r->index;
1324 /* Similar, but operate on INTEGER_CSTs. */
1326 static tree
1327 remap_eh_region_tree_nr (tree old_t_nr, copy_body_data *id)
1329 int old_nr, new_nr;
1331 old_nr = tree_to_shwi (old_t_nr);
1332 new_nr = remap_eh_region_nr (old_nr, id);
1334 return build_int_cst (integer_type_node, new_nr);
1337 /* Helper for copy_bb. Remap statement STMT using the inlining
1338 information in ID. Return the new statement copy. */
1340 static gimple_seq
1341 remap_gimple_stmt (gimple *stmt, copy_body_data *id)
1343 gimple *copy = NULL;
1344 struct walk_stmt_info wi;
1345 bool skip_first = false;
1346 gimple_seq stmts = NULL;
1348 if (is_gimple_debug (stmt)
1349 && !opt_for_fn (id->dst_fn, flag_var_tracking_assignments))
1350 return stmts;
1352 /* Begin by recognizing trees that we'll completely rewrite for the
1353 inlining context. Our output for these trees is completely
1354 different from out input (e.g. RETURN_EXPR is deleted, and morphs
1355 into an edge). Further down, we'll handle trees that get
1356 duplicated and/or tweaked. */
1358 /* When requested, GIMPLE_RETURNs should be transformed to just the
1359 contained GIMPLE_ASSIGN. The branch semantics of the return will
1360 be handled elsewhere by manipulating the CFG rather than the
1361 statement. */
1362 if (gimple_code (stmt) == GIMPLE_RETURN && id->transform_return_to_modify)
1364 tree retval = gimple_return_retval (as_a <greturn *> (stmt));
1365 tree retbnd = gimple_return_retbnd (stmt);
1366 tree bndslot = id->retbnd;
1368 if (retbnd && bndslot)
1370 gimple *bndcopy = gimple_build_assign (bndslot, retbnd);
1371 memset (&wi, 0, sizeof (wi));
1372 wi.info = id;
1373 walk_gimple_op (bndcopy, remap_gimple_op_r, &wi);
1374 gimple_seq_add_stmt (&stmts, bndcopy);
1377 /* If we're returning something, just turn that into an
1378 assignment into the equivalent of the original RESULT_DECL.
1379 If RETVAL is just the result decl, the result decl has
1380 already been set (e.g. a recent "foo (&result_decl, ...)");
1381 just toss the entire GIMPLE_RETURN. */
1382 if (retval
1383 && (TREE_CODE (retval) != RESULT_DECL
1384 && (TREE_CODE (retval) != SSA_NAME
1385 || ! SSA_NAME_VAR (retval)
1386 || TREE_CODE (SSA_NAME_VAR (retval)) != RESULT_DECL)))
1388 copy = gimple_build_assign (id->do_not_unshare
1389 ? id->retvar : unshare_expr (id->retvar),
1390 retval);
1391 /* id->retvar is already substituted. Skip it on later remapping. */
1392 skip_first = true;
1394 /* We need to copy bounds if return structure with pointers into
1395 instrumented function. */
1396 if (chkp_function_instrumented_p (id->dst_fn)
1397 && !bndslot
1398 && !BOUNDED_P (id->retvar)
1399 && chkp_type_has_pointer (TREE_TYPE (id->retvar)))
1400 id->assign_stmts.safe_push (copy);
1403 else
1404 return stmts;
1406 else if (gimple_has_substatements (stmt))
1408 gimple_seq s1, s2;
1410 /* When cloning bodies from the C++ front end, we will be handed bodies
1411 in High GIMPLE form. Handle here all the High GIMPLE statements that
1412 have embedded statements. */
1413 switch (gimple_code (stmt))
1415 case GIMPLE_BIND:
1416 copy = copy_gimple_bind (as_a <gbind *> (stmt), id);
1417 break;
1419 case GIMPLE_CATCH:
1421 gcatch *catch_stmt = as_a <gcatch *> (stmt);
1422 s1 = remap_gimple_seq (gimple_catch_handler (catch_stmt), id);
1423 copy = gimple_build_catch (gimple_catch_types (catch_stmt), s1);
1425 break;
1427 case GIMPLE_EH_FILTER:
1428 s1 = remap_gimple_seq (gimple_eh_filter_failure (stmt), id);
1429 copy = gimple_build_eh_filter (gimple_eh_filter_types (stmt), s1);
1430 break;
1432 case GIMPLE_TRY:
1433 s1 = remap_gimple_seq (gimple_try_eval (stmt), id);
1434 s2 = remap_gimple_seq (gimple_try_cleanup (stmt), id);
1435 copy = gimple_build_try (s1, s2, gimple_try_kind (stmt));
1436 break;
1438 case GIMPLE_WITH_CLEANUP_EXPR:
1439 s1 = remap_gimple_seq (gimple_wce_cleanup (stmt), id);
1440 copy = gimple_build_wce (s1);
1441 break;
1443 case GIMPLE_OMP_PARALLEL:
1445 gomp_parallel *omp_par_stmt = as_a <gomp_parallel *> (stmt);
1446 s1 = remap_gimple_seq (gimple_omp_body (omp_par_stmt), id);
1447 copy = gimple_build_omp_parallel
1448 (s1,
1449 gimple_omp_parallel_clauses (omp_par_stmt),
1450 gimple_omp_parallel_child_fn (omp_par_stmt),
1451 gimple_omp_parallel_data_arg (omp_par_stmt));
1453 break;
1455 case GIMPLE_OMP_TASK:
1456 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1457 copy = gimple_build_omp_task
1458 (s1,
1459 gimple_omp_task_clauses (stmt),
1460 gimple_omp_task_child_fn (stmt),
1461 gimple_omp_task_data_arg (stmt),
1462 gimple_omp_task_copy_fn (stmt),
1463 gimple_omp_task_arg_size (stmt),
1464 gimple_omp_task_arg_align (stmt));
1465 break;
1467 case GIMPLE_OMP_FOR:
1468 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1469 s2 = remap_gimple_seq (gimple_omp_for_pre_body (stmt), id);
1470 copy = gimple_build_omp_for (s1, gimple_omp_for_kind (stmt),
1471 gimple_omp_for_clauses (stmt),
1472 gimple_omp_for_collapse (stmt), s2);
1474 size_t i;
1475 for (i = 0; i < gimple_omp_for_collapse (stmt); i++)
1477 gimple_omp_for_set_index (copy, i,
1478 gimple_omp_for_index (stmt, i));
1479 gimple_omp_for_set_initial (copy, i,
1480 gimple_omp_for_initial (stmt, i));
1481 gimple_omp_for_set_final (copy, i,
1482 gimple_omp_for_final (stmt, i));
1483 gimple_omp_for_set_incr (copy, i,
1484 gimple_omp_for_incr (stmt, i));
1485 gimple_omp_for_set_cond (copy, i,
1486 gimple_omp_for_cond (stmt, i));
1489 break;
1491 case GIMPLE_OMP_MASTER:
1492 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1493 copy = gimple_build_omp_master (s1);
1494 break;
1496 case GIMPLE_OMP_TASKGROUP:
1497 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1498 copy = gimple_build_omp_taskgroup (s1);
1499 break;
1501 case GIMPLE_OMP_ORDERED:
1502 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1503 copy = gimple_build_omp_ordered
1504 (s1,
1505 gimple_omp_ordered_clauses (as_a <gomp_ordered *> (stmt)));
1506 break;
1508 case GIMPLE_OMP_SECTION:
1509 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1510 copy = gimple_build_omp_section (s1);
1511 break;
1513 case GIMPLE_OMP_SECTIONS:
1514 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1515 copy = gimple_build_omp_sections
1516 (s1, gimple_omp_sections_clauses (stmt));
1517 break;
1519 case GIMPLE_OMP_SINGLE:
1520 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1521 copy = gimple_build_omp_single
1522 (s1, gimple_omp_single_clauses (stmt));
1523 break;
1525 case GIMPLE_OMP_TARGET:
1526 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1527 copy = gimple_build_omp_target
1528 (s1, gimple_omp_target_kind (stmt),
1529 gimple_omp_target_clauses (stmt));
1530 break;
1532 case GIMPLE_OMP_TEAMS:
1533 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1534 copy = gimple_build_omp_teams
1535 (s1, gimple_omp_teams_clauses (stmt));
1536 break;
1538 case GIMPLE_OMP_CRITICAL:
1539 s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1540 copy = gimple_build_omp_critical (s1,
1541 gimple_omp_critical_name
1542 (as_a <gomp_critical *> (stmt)),
1543 gimple_omp_critical_clauses
1544 (as_a <gomp_critical *> (stmt)));
1545 break;
1547 case GIMPLE_TRANSACTION:
1549 gtransaction *old_trans_stmt = as_a <gtransaction *> (stmt);
1550 gtransaction *new_trans_stmt;
1551 s1 = remap_gimple_seq (gimple_transaction_body (old_trans_stmt),
1552 id);
1553 copy = new_trans_stmt = gimple_build_transaction (s1);
1554 gimple_transaction_set_subcode (new_trans_stmt,
1555 gimple_transaction_subcode (old_trans_stmt));
1556 gimple_transaction_set_label_norm (new_trans_stmt,
1557 gimple_transaction_label_norm (old_trans_stmt));
1558 gimple_transaction_set_label_uninst (new_trans_stmt,
1559 gimple_transaction_label_uninst (old_trans_stmt));
1560 gimple_transaction_set_label_over (new_trans_stmt,
1561 gimple_transaction_label_over (old_trans_stmt));
1563 break;
1565 default:
1566 gcc_unreachable ();
1569 else
1571 if (gimple_assign_copy_p (stmt)
1572 && gimple_assign_lhs (stmt) == gimple_assign_rhs1 (stmt)
1573 && auto_var_in_fn_p (gimple_assign_lhs (stmt), id->src_fn))
1575 /* Here we handle statements that are not completely rewritten.
1576 First we detect some inlining-induced bogosities for
1577 discarding. */
1579 /* Some assignments VAR = VAR; don't generate any rtl code
1580 and thus don't count as variable modification. Avoid
1581 keeping bogosities like 0 = 0. */
1582 tree decl = gimple_assign_lhs (stmt), value;
1583 tree *n;
1585 n = id->decl_map->get (decl);
1586 if (n)
1588 value = *n;
1589 STRIP_TYPE_NOPS (value);
1590 if (TREE_CONSTANT (value) || TREE_READONLY (value))
1591 return NULL;
1595 /* For *ptr_N ={v} {CLOBBER}, if ptr_N is SSA_NAME defined
1596 in a block that we aren't copying during tree_function_versioning,
1597 just drop the clobber stmt. */
1598 if (id->blocks_to_copy && gimple_clobber_p (stmt))
1600 tree lhs = gimple_assign_lhs (stmt);
1601 if (TREE_CODE (lhs) == MEM_REF
1602 && TREE_CODE (TREE_OPERAND (lhs, 0)) == SSA_NAME)
1604 gimple *def_stmt = SSA_NAME_DEF_STMT (TREE_OPERAND (lhs, 0));
1605 if (gimple_bb (def_stmt)
1606 && !bitmap_bit_p (id->blocks_to_copy,
1607 gimple_bb (def_stmt)->index))
1608 return NULL;
1612 if (gimple_debug_bind_p (stmt))
1614 gdebug *copy
1615 = gimple_build_debug_bind (gimple_debug_bind_get_var (stmt),
1616 gimple_debug_bind_get_value (stmt),
1617 stmt);
1618 id->debug_stmts.safe_push (copy);
1619 gimple_seq_add_stmt (&stmts, copy);
1620 return stmts;
1622 if (gimple_debug_source_bind_p (stmt))
1624 gdebug *copy = gimple_build_debug_source_bind
1625 (gimple_debug_source_bind_get_var (stmt),
1626 gimple_debug_source_bind_get_value (stmt),
1627 stmt);
1628 id->debug_stmts.safe_push (copy);
1629 gimple_seq_add_stmt (&stmts, copy);
1630 return stmts;
1633 /* Create a new deep copy of the statement. */
1634 copy = gimple_copy (stmt);
1636 /* Clear flags that need revisiting. */
1637 if (gcall *call_stmt = dyn_cast <gcall *> (copy))
1639 if (gimple_call_tail_p (call_stmt))
1640 gimple_call_set_tail (call_stmt, false);
1641 if (gimple_call_from_thunk_p (call_stmt))
1642 gimple_call_set_from_thunk (call_stmt, false);
1643 if (gimple_call_internal_p (call_stmt))
1644 switch (gimple_call_internal_fn (call_stmt))
1646 case IFN_GOMP_SIMD_LANE:
1647 case IFN_GOMP_SIMD_VF:
1648 case IFN_GOMP_SIMD_LAST_LANE:
1649 case IFN_GOMP_SIMD_ORDERED_START:
1650 case IFN_GOMP_SIMD_ORDERED_END:
1651 DECL_STRUCT_FUNCTION (id->dst_fn)->has_simduid_loops = true;
1652 break;
1653 default:
1654 break;
1658 /* Remap the region numbers for __builtin_eh_{pointer,filter},
1659 RESX and EH_DISPATCH. */
1660 if (id->eh_map)
1661 switch (gimple_code (copy))
1663 case GIMPLE_CALL:
1665 tree r, fndecl = gimple_call_fndecl (copy);
1666 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
1667 switch (DECL_FUNCTION_CODE (fndecl))
1669 case BUILT_IN_EH_COPY_VALUES:
1670 r = gimple_call_arg (copy, 1);
1671 r = remap_eh_region_tree_nr (r, id);
1672 gimple_call_set_arg (copy, 1, r);
1673 /* FALLTHRU */
1675 case BUILT_IN_EH_POINTER:
1676 case BUILT_IN_EH_FILTER:
1677 r = gimple_call_arg (copy, 0);
1678 r = remap_eh_region_tree_nr (r, id);
1679 gimple_call_set_arg (copy, 0, r);
1680 break;
1682 default:
1683 break;
1686 /* Reset alias info if we didn't apply measures to
1687 keep it valid over inlining by setting DECL_PT_UID. */
1688 if (!id->src_cfun->gimple_df
1689 || !id->src_cfun->gimple_df->ipa_pta)
1690 gimple_call_reset_alias_info (as_a <gcall *> (copy));
1692 break;
1694 case GIMPLE_RESX:
1696 gresx *resx_stmt = as_a <gresx *> (copy);
1697 int r = gimple_resx_region (resx_stmt);
1698 r = remap_eh_region_nr (r, id);
1699 gimple_resx_set_region (resx_stmt, r);
1701 break;
1703 case GIMPLE_EH_DISPATCH:
1705 geh_dispatch *eh_dispatch = as_a <geh_dispatch *> (copy);
1706 int r = gimple_eh_dispatch_region (eh_dispatch);
1707 r = remap_eh_region_nr (r, id);
1708 gimple_eh_dispatch_set_region (eh_dispatch, r);
1710 break;
1712 default:
1713 break;
1717 /* If STMT has a block defined, map it to the newly constructed
1718 block. */
1719 if (gimple_block (copy))
1721 tree *n;
1722 n = id->decl_map->get (gimple_block (copy));
1723 gcc_assert (n);
1724 gimple_set_block (copy, *n);
1727 if (gimple_debug_bind_p (copy) || gimple_debug_source_bind_p (copy))
1729 gimple_seq_add_stmt (&stmts, copy);
1730 return stmts;
1733 /* Remap all the operands in COPY. */
1734 memset (&wi, 0, sizeof (wi));
1735 wi.info = id;
1736 if (skip_first)
1737 walk_tree (gimple_op_ptr (copy, 1), remap_gimple_op_r, &wi, NULL);
1738 else
1739 walk_gimple_op (copy, remap_gimple_op_r, &wi);
1741 /* Clear the copied virtual operands. We are not remapping them here
1742 but are going to recreate them from scratch. */
1743 if (gimple_has_mem_ops (copy))
1745 gimple_set_vdef (copy, NULL_TREE);
1746 gimple_set_vuse (copy, NULL_TREE);
1749 gimple_seq_add_stmt (&stmts, copy);
1750 return stmts;
1754 /* Copy basic block, scale profile accordingly. Edges will be taken care of
1755 later */
1757 static basic_block
1758 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale,
1759 profile_count num, profile_count den)
1761 gimple_stmt_iterator gsi, copy_gsi, seq_gsi;
1762 basic_block copy_basic_block;
1763 tree decl;
1764 gcov_type freq;
1765 basic_block prev;
1766 bool scale = num.initialized_p ()
1767 && (den > 0 || num == profile_count::zero ());
1769 /* Search for previous copied basic block. */
1770 prev = bb->prev_bb;
1771 while (!prev->aux)
1772 prev = prev->prev_bb;
1774 /* create_basic_block() will append every new block to
1775 basic_block_info automatically. */
1776 copy_basic_block = create_basic_block (NULL, (basic_block) prev->aux);
1777 if (scale)
1778 copy_basic_block->count = bb->count.apply_scale (num, den);
1780 /* We are going to rebuild frequencies from scratch. These values
1781 have just small importance to drive canonicalize_loop_headers. */
1782 freq = apply_scale ((gcov_type)bb->frequency, frequency_scale);
1784 /* We recompute frequencies after inlining, so this is quite safe. */
1785 if (freq > BB_FREQ_MAX)
1786 freq = BB_FREQ_MAX;
1787 copy_basic_block->frequency = freq;
1789 copy_gsi = gsi_start_bb (copy_basic_block);
1791 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
1793 gimple_seq stmts;
1794 gimple *stmt = gsi_stmt (gsi);
1795 gimple *orig_stmt = stmt;
1796 gimple_stmt_iterator stmts_gsi;
1797 bool stmt_added = false;
1799 id->regimplify = false;
1800 stmts = remap_gimple_stmt (stmt, id);
1802 if (gimple_seq_empty_p (stmts))
1803 continue;
1805 seq_gsi = copy_gsi;
1807 for (stmts_gsi = gsi_start (stmts);
1808 !gsi_end_p (stmts_gsi); )
1810 stmt = gsi_stmt (stmts_gsi);
1812 /* Advance iterator now before stmt is moved to seq_gsi. */
1813 gsi_next (&stmts_gsi);
1815 if (gimple_nop_p (stmt))
1816 continue;
1818 gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun,
1819 orig_stmt);
1821 /* With return slot optimization we can end up with
1822 non-gimple (foo *)&this->m, fix that here. */
1823 if (is_gimple_assign (stmt)
1824 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt))
1825 && !is_gimple_val (gimple_assign_rhs1 (stmt)))
1827 tree new_rhs;
1828 new_rhs = force_gimple_operand_gsi (&seq_gsi,
1829 gimple_assign_rhs1 (stmt),
1830 true, NULL, false,
1831 GSI_CONTINUE_LINKING);
1832 gimple_assign_set_rhs1 (stmt, new_rhs);
1833 id->regimplify = false;
1836 gsi_insert_after (&seq_gsi, stmt, GSI_NEW_STMT);
1838 if (id->regimplify)
1839 gimple_regimplify_operands (stmt, &seq_gsi);
1841 stmt_added = true;
1844 if (!stmt_added)
1845 continue;
1847 /* If copy_basic_block has been empty at the start of this iteration,
1848 call gsi_start_bb again to get at the newly added statements. */
1849 if (gsi_end_p (copy_gsi))
1850 copy_gsi = gsi_start_bb (copy_basic_block);
1851 else
1852 gsi_next (&copy_gsi);
1854 /* Process the new statement. The call to gimple_regimplify_operands
1855 possibly turned the statement into multiple statements, we
1856 need to process all of them. */
1859 tree fn;
1860 gcall *call_stmt;
1862 stmt = gsi_stmt (copy_gsi);
1863 call_stmt = dyn_cast <gcall *> (stmt);
1864 if (call_stmt
1865 && gimple_call_va_arg_pack_p (call_stmt)
1866 && id->call_stmt
1867 && ! gimple_call_va_arg_pack_p (id->call_stmt))
1869 /* __builtin_va_arg_pack () should be replaced by
1870 all arguments corresponding to ... in the caller. */
1871 tree p;
1872 gcall *new_call;
1873 vec<tree> argarray;
1874 size_t nargs = gimple_call_num_args (id->call_stmt);
1875 size_t n, i, nargs_to_copy;
1876 bool remove_bounds = false;
1878 for (p = DECL_ARGUMENTS (id->src_fn); p; p = DECL_CHAIN (p))
1879 nargs--;
1881 /* Bounds should be removed from arg pack in case
1882 we handle not instrumented call in instrumented
1883 function. */
1884 nargs_to_copy = nargs;
1885 if (gimple_call_with_bounds_p (id->call_stmt)
1886 && !gimple_call_with_bounds_p (stmt))
1888 for (i = gimple_call_num_args (id->call_stmt) - nargs;
1889 i < gimple_call_num_args (id->call_stmt);
1890 i++)
1891 if (POINTER_BOUNDS_P (gimple_call_arg (id->call_stmt, i)))
1892 nargs_to_copy--;
1893 remove_bounds = true;
1896 /* Create the new array of arguments. */
1897 n = nargs_to_copy + gimple_call_num_args (call_stmt);
1898 argarray.create (n);
1899 argarray.safe_grow_cleared (n);
1901 /* Copy all the arguments before '...' */
1902 memcpy (argarray.address (),
1903 gimple_call_arg_ptr (call_stmt, 0),
1904 gimple_call_num_args (call_stmt) * sizeof (tree));
1906 if (remove_bounds)
1908 /* Append the rest of arguments removing bounds. */
1909 unsigned cur = gimple_call_num_args (call_stmt);
1910 i = gimple_call_num_args (id->call_stmt) - nargs;
1911 for (i = gimple_call_num_args (id->call_stmt) - nargs;
1912 i < gimple_call_num_args (id->call_stmt);
1913 i++)
1914 if (!POINTER_BOUNDS_P (gimple_call_arg (id->call_stmt, i)))
1915 argarray[cur++] = gimple_call_arg (id->call_stmt, i);
1916 gcc_assert (cur == n);
1918 else
1920 /* Append the arguments passed in '...' */
1921 memcpy (argarray.address () + gimple_call_num_args (call_stmt),
1922 gimple_call_arg_ptr (id->call_stmt, 0)
1923 + (gimple_call_num_args (id->call_stmt) - nargs),
1924 nargs * sizeof (tree));
1927 new_call = gimple_build_call_vec (gimple_call_fn (call_stmt),
1928 argarray);
1930 argarray.release ();
1932 /* Copy all GIMPLE_CALL flags, location and block, except
1933 GF_CALL_VA_ARG_PACK. */
1934 gimple_call_copy_flags (new_call, call_stmt);
1935 gimple_call_set_va_arg_pack (new_call, false);
1936 gimple_set_location (new_call, gimple_location (stmt));
1937 gimple_set_block (new_call, gimple_block (stmt));
1938 gimple_call_set_lhs (new_call, gimple_call_lhs (call_stmt));
1940 gsi_replace (&copy_gsi, new_call, false);
1941 stmt = new_call;
1943 else if (call_stmt
1944 && id->call_stmt
1945 && (decl = gimple_call_fndecl (stmt))
1946 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1947 && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_ARG_PACK_LEN
1948 && ! gimple_call_va_arg_pack_p (id->call_stmt))
1950 /* __builtin_va_arg_pack_len () should be replaced by
1951 the number of anonymous arguments. */
1952 size_t nargs = gimple_call_num_args (id->call_stmt), i;
1953 tree count, p;
1954 gimple *new_stmt;
1956 for (p = DECL_ARGUMENTS (id->src_fn); p; p = DECL_CHAIN (p))
1957 nargs--;
1959 /* For instrumented calls we should ignore bounds. */
1960 for (i = gimple_call_num_args (id->call_stmt) - nargs;
1961 i < gimple_call_num_args (id->call_stmt);
1962 i++)
1963 if (POINTER_BOUNDS_P (gimple_call_arg (id->call_stmt, i)))
1964 nargs--;
1966 count = build_int_cst (integer_type_node, nargs);
1967 new_stmt = gimple_build_assign (gimple_call_lhs (stmt), count);
1968 gsi_replace (&copy_gsi, new_stmt, false);
1969 stmt = new_stmt;
1971 else if (call_stmt
1972 && id->call_stmt
1973 && gimple_call_internal_p (stmt)
1974 && gimple_call_internal_fn (stmt) == IFN_TSAN_FUNC_EXIT)
1976 /* Drop TSAN_FUNC_EXIT () internal calls during inlining. */
1977 gsi_remove (&copy_gsi, false);
1978 continue;
1981 /* Statements produced by inlining can be unfolded, especially
1982 when we constant propagated some operands. We can't fold
1983 them right now for two reasons:
1984 1) folding require SSA_NAME_DEF_STMTs to be correct
1985 2) we can't change function calls to builtins.
1986 So we just mark statement for later folding. We mark
1987 all new statements, instead just statements that has changed
1988 by some nontrivial substitution so even statements made
1989 foldable indirectly are updated. If this turns out to be
1990 expensive, copy_body can be told to watch for nontrivial
1991 changes. */
1992 if (id->statements_to_fold)
1993 id->statements_to_fold->add (stmt);
1995 /* We're duplicating a CALL_EXPR. Find any corresponding
1996 callgraph edges and update or duplicate them. */
1997 if (gcall *call_stmt = dyn_cast <gcall *> (stmt))
1999 struct cgraph_edge *edge;
2001 switch (id->transform_call_graph_edges)
2003 case CB_CGE_DUPLICATE:
2004 edge = id->src_node->get_edge (orig_stmt);
2005 if (edge)
2007 int edge_freq = edge->frequency;
2008 int new_freq;
2009 struct cgraph_edge *old_edge = edge;
2010 edge = edge->clone (id->dst_node, call_stmt,
2011 gimple_uid (stmt),
2012 profile_count::one (),
2013 profile_count::one (),
2014 CGRAPH_FREQ_BASE,
2015 true);
2016 /* We could also just rescale the frequency, but
2017 doing so would introduce roundoff errors and make
2018 verifier unhappy. */
2019 new_freq = compute_call_stmt_bb_frequency (id->dst_node->decl,
2020 copy_basic_block);
2022 /* Speculative calls consist of two edges - direct and indirect.
2023 Duplicate the whole thing and distribute frequencies accordingly. */
2024 if (edge->speculative)
2026 struct cgraph_edge *direct, *indirect;
2027 struct ipa_ref *ref;
2029 gcc_assert (!edge->indirect_unknown_callee);
2030 old_edge->speculative_call_info (direct, indirect, ref);
2031 indirect = indirect->clone (id->dst_node, call_stmt,
2032 gimple_uid (stmt),
2033 profile_count::one (),
2034 profile_count::one (),
2035 CGRAPH_FREQ_BASE,
2036 true);
2037 if (old_edge->frequency + indirect->frequency)
2039 edge->frequency = MIN (RDIV ((gcov_type)new_freq * old_edge->frequency,
2040 (old_edge->frequency + indirect->frequency)),
2041 CGRAPH_FREQ_MAX);
2042 indirect->frequency = MIN (RDIV ((gcov_type)new_freq * indirect->frequency,
2043 (old_edge->frequency + indirect->frequency)),
2044 CGRAPH_FREQ_MAX);
2046 id->dst_node->clone_reference (ref, stmt);
2048 else
2050 edge->frequency = new_freq;
2051 if (dump_file
2052 && profile_status_for_fn (cfun) != PROFILE_ABSENT
2053 && (edge_freq > edge->frequency + 10
2054 || edge_freq < edge->frequency - 10))
2056 fprintf (dump_file, "Edge frequency estimated by "
2057 "cgraph %i diverge from inliner's estimate %i\n",
2058 edge_freq,
2059 edge->frequency);
2060 fprintf (dump_file,
2061 "Orig bb: %i, orig bb freq %i, new bb freq %i\n",
2062 bb->index,
2063 bb->frequency,
2064 copy_basic_block->frequency);
2068 break;
2070 case CB_CGE_MOVE_CLONES:
2071 id->dst_node->set_call_stmt_including_clones (orig_stmt,
2072 call_stmt);
2073 edge = id->dst_node->get_edge (stmt);
2074 break;
2076 case CB_CGE_MOVE:
2077 edge = id->dst_node->get_edge (orig_stmt);
2078 if (edge)
2079 edge->set_call_stmt (call_stmt);
2080 break;
2082 default:
2083 gcc_unreachable ();
2086 /* Constant propagation on argument done during inlining
2087 may create new direct call. Produce an edge for it. */
2088 if ((!edge
2089 || (edge->indirect_inlining_edge
2090 && id->transform_call_graph_edges == CB_CGE_MOVE_CLONES))
2091 && id->dst_node->definition
2092 && (fn = gimple_call_fndecl (stmt)) != NULL)
2094 struct cgraph_node *dest = cgraph_node::get_create (fn);
2096 /* We have missing edge in the callgraph. This can happen
2097 when previous inlining turned an indirect call into a
2098 direct call by constant propagating arguments or we are
2099 producing dead clone (for further cloning). In all
2100 other cases we hit a bug (incorrect node sharing is the
2101 most common reason for missing edges). */
2102 gcc_assert (!dest->definition
2103 || dest->address_taken
2104 || !id->src_node->definition
2105 || !id->dst_node->definition);
2106 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES)
2107 id->dst_node->create_edge_including_clones
2108 (dest, orig_stmt, call_stmt, bb->count,
2109 compute_call_stmt_bb_frequency (id->dst_node->decl,
2110 copy_basic_block),
2111 CIF_ORIGINALLY_INDIRECT_CALL);
2112 else
2113 id->dst_node->create_edge (dest, call_stmt,
2114 bb->count,
2115 compute_call_stmt_bb_frequency
2116 (id->dst_node->decl,
2117 copy_basic_block))->inline_failed
2118 = CIF_ORIGINALLY_INDIRECT_CALL;
2119 if (dump_file)
2121 fprintf (dump_file, "Created new direct edge to %s\n",
2122 dest->name ());
2126 notice_special_calls (as_a <gcall *> (stmt));
2129 maybe_duplicate_eh_stmt_fn (cfun, stmt, id->src_cfun, orig_stmt,
2130 id->eh_map, id->eh_lp_nr);
2132 gsi_next (&copy_gsi);
2134 while (!gsi_end_p (copy_gsi));
2136 copy_gsi = gsi_last_bb (copy_basic_block);
2139 return copy_basic_block;
2142 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
2143 form is quite easy, since dominator relationship for old basic blocks does
2144 not change.
2146 There is however exception where inlining might change dominator relation
2147 across EH edges from basic block within inlined functions destinating
2148 to landing pads in function we inline into.
2150 The function fills in PHI_RESULTs of such PHI nodes if they refer
2151 to gimple regs. Otherwise, the function mark PHI_RESULT of such
2152 PHI nodes for renaming. For non-gimple regs, renaming is safe: the
2153 EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
2154 set, and this means that there will be no overlapping live ranges
2155 for the underlying symbol.
2157 This might change in future if we allow redirecting of EH edges and
2158 we might want to change way build CFG pre-inlining to include
2159 all the possible edges then. */
2160 static void
2161 update_ssa_across_abnormal_edges (basic_block bb, basic_block ret_bb,
2162 bool can_throw, bool nonlocal_goto)
2164 edge e;
2165 edge_iterator ei;
2167 FOR_EACH_EDGE (e, ei, bb->succs)
2168 if (!e->dest->aux
2169 || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
2171 gphi *phi;
2172 gphi_iterator si;
2174 if (!nonlocal_goto)
2175 gcc_assert (e->flags & EDGE_EH);
2177 if (!can_throw)
2178 gcc_assert (!(e->flags & EDGE_EH));
2180 for (si = gsi_start_phis (e->dest); !gsi_end_p (si); gsi_next (&si))
2182 edge re;
2184 phi = si.phi ();
2186 /* For abnormal goto/call edges the receiver can be the
2187 ENTRY_BLOCK. Do not assert this cannot happen. */
2189 gcc_assert ((e->flags & EDGE_EH)
2190 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi)));
2192 re = find_edge (ret_bb, e->dest);
2193 gcc_checking_assert (re);
2194 gcc_assert ((re->flags & (EDGE_EH | EDGE_ABNORMAL))
2195 == (e->flags & (EDGE_EH | EDGE_ABNORMAL)));
2197 SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e),
2198 USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi, re)));
2204 /* Copy edges from BB into its copy constructed earlier, scale profile
2205 accordingly. Edges will be taken care of later. Assume aux
2206 pointers to point to the copies of each BB. Return true if any
2207 debug stmts are left after a statement that must end the basic block. */
2209 static bool
2210 copy_edges_for_bb (basic_block bb, profile_count num, profile_count den,
2211 basic_block ret_bb, basic_block abnormal_goto_dest)
2213 basic_block new_bb = (basic_block) bb->aux;
2214 edge_iterator ei;
2215 edge old_edge;
2216 gimple_stmt_iterator si;
2217 int flags;
2218 bool need_debug_cleanup = false;
2219 bool scale = num.initialized_p ()
2220 && (den > 0 || num == profile_count::zero ());
2222 /* Use the indices from the original blocks to create edges for the
2223 new ones. */
2224 FOR_EACH_EDGE (old_edge, ei, bb->succs)
2225 if (!(old_edge->flags & EDGE_EH))
2227 edge new_edge;
2229 flags = old_edge->flags;
2231 /* Return edges do get a FALLTHRU flag when the get inlined. */
2232 if (old_edge->dest->index == EXIT_BLOCK
2233 && !(old_edge->flags & (EDGE_TRUE_VALUE|EDGE_FALSE_VALUE|EDGE_FAKE))
2234 && old_edge->dest->aux != EXIT_BLOCK_PTR_FOR_FN (cfun))
2235 flags |= EDGE_FALLTHRU;
2236 new_edge = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
2237 if (scale)
2238 new_edge->count = old_edge->count.apply_scale (num, den);
2239 new_edge->probability = old_edge->probability;
2242 if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
2243 return false;
2245 for (si = gsi_start_bb (new_bb); !gsi_end_p (si);)
2247 gimple *copy_stmt;
2248 bool can_throw, nonlocal_goto;
2250 copy_stmt = gsi_stmt (si);
2251 if (!is_gimple_debug (copy_stmt))
2252 update_stmt (copy_stmt);
2254 /* Do this before the possible split_block. */
2255 gsi_next (&si);
2257 /* If this tree could throw an exception, there are two
2258 cases where we need to add abnormal edge(s): the
2259 tree wasn't in a region and there is a "current
2260 region" in the caller; or the original tree had
2261 EH edges. In both cases split the block after the tree,
2262 and add abnormal edge(s) as needed; we need both
2263 those from the callee and the caller.
2264 We check whether the copy can throw, because the const
2265 propagation can change an INDIRECT_REF which throws
2266 into a COMPONENT_REF which doesn't. If the copy
2267 can throw, the original could also throw. */
2268 can_throw = stmt_can_throw_internal (copy_stmt);
2269 nonlocal_goto
2270 = (stmt_can_make_abnormal_goto (copy_stmt)
2271 && !computed_goto_p (copy_stmt));
2273 if (can_throw || nonlocal_goto)
2275 if (!gsi_end_p (si))
2277 while (!gsi_end_p (si) && is_gimple_debug (gsi_stmt (si)))
2278 gsi_next (&si);
2279 if (gsi_end_p (si))
2280 need_debug_cleanup = true;
2282 if (!gsi_end_p (si))
2283 /* Note that bb's predecessor edges aren't necessarily
2284 right at this point; split_block doesn't care. */
2286 edge e = split_block (new_bb, copy_stmt);
2288 new_bb = e->dest;
2289 new_bb->aux = e->src->aux;
2290 si = gsi_start_bb (new_bb);
2294 bool update_probs = false;
2296 if (gimple_code (copy_stmt) == GIMPLE_EH_DISPATCH)
2298 make_eh_dispatch_edges (as_a <geh_dispatch *> (copy_stmt));
2299 update_probs = true;
2301 else if (can_throw)
2303 make_eh_edges (copy_stmt);
2304 update_probs = true;
2307 /* EH edges may not match old edges. Copy as much as possible. */
2308 if (update_probs)
2310 edge e;
2311 edge_iterator ei;
2312 basic_block copy_stmt_bb = gimple_bb (copy_stmt);
2314 FOR_EACH_EDGE (old_edge, ei, bb->succs)
2315 if ((old_edge->flags & EDGE_EH)
2316 && (e = find_edge (copy_stmt_bb,
2317 (basic_block) old_edge->dest->aux))
2318 && (e->flags & EDGE_EH))
2320 e->probability = old_edge->probability;
2321 e->count = old_edge->count;
2324 FOR_EACH_EDGE (e, ei, copy_stmt_bb->succs)
2325 if ((e->flags & EDGE_EH) && !e->probability.initialized_p ())
2327 e->probability = profile_probability::never ();
2328 e->count = profile_count::zero ();
2333 /* If the call we inline cannot make abnormal goto do not add
2334 additional abnormal edges but only retain those already present
2335 in the original function body. */
2336 if (abnormal_goto_dest == NULL)
2337 nonlocal_goto = false;
2338 if (nonlocal_goto)
2340 basic_block copy_stmt_bb = gimple_bb (copy_stmt);
2342 if (get_abnormal_succ_dispatcher (copy_stmt_bb))
2343 nonlocal_goto = false;
2344 /* ABNORMAL_DISPATCHER (1) is for longjmp/setjmp or nonlocal gotos
2345 in OpenMP regions which aren't allowed to be left abnormally.
2346 So, no need to add abnormal edge in that case. */
2347 else if (is_gimple_call (copy_stmt)
2348 && gimple_call_internal_p (copy_stmt)
2349 && (gimple_call_internal_fn (copy_stmt)
2350 == IFN_ABNORMAL_DISPATCHER)
2351 && gimple_call_arg (copy_stmt, 0) == boolean_true_node)
2352 nonlocal_goto = false;
2353 else
2354 make_single_succ_edge (copy_stmt_bb, abnormal_goto_dest,
2355 EDGE_ABNORMAL);
2358 if ((can_throw || nonlocal_goto)
2359 && gimple_in_ssa_p (cfun))
2360 update_ssa_across_abnormal_edges (gimple_bb (copy_stmt), ret_bb,
2361 can_throw, nonlocal_goto);
2363 return need_debug_cleanup;
2366 /* Copy the PHIs. All blocks and edges are copied, some blocks
2367 was possibly split and new outgoing EH edges inserted.
2368 BB points to the block of original function and AUX pointers links
2369 the original and newly copied blocks. */
2371 static void
2372 copy_phis_for_bb (basic_block bb, copy_body_data *id)
2374 basic_block const new_bb = (basic_block) bb->aux;
2375 edge_iterator ei;
2376 gphi *phi;
2377 gphi_iterator si;
2378 edge new_edge;
2379 bool inserted = false;
2381 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
2383 tree res, new_res;
2384 gphi *new_phi;
2386 phi = si.phi ();
2387 res = PHI_RESULT (phi);
2388 new_res = res;
2389 if (!virtual_operand_p (res))
2391 walk_tree (&new_res, copy_tree_body_r, id, NULL);
2392 if (EDGE_COUNT (new_bb->preds) == 0)
2394 /* Technically we'd want a SSA_DEFAULT_DEF here... */
2395 SSA_NAME_DEF_STMT (new_res) = gimple_build_nop ();
2397 else
2399 new_phi = create_phi_node (new_res, new_bb);
2400 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
2402 edge old_edge = find_edge ((basic_block) new_edge->src->aux,
2403 bb);
2404 tree arg;
2405 tree new_arg;
2406 edge_iterator ei2;
2407 location_t locus;
2409 /* When doing partial cloning, we allow PHIs on the entry
2410 block as long as all the arguments are the same.
2411 Find any input edge to see argument to copy. */
2412 if (!old_edge)
2413 FOR_EACH_EDGE (old_edge, ei2, bb->preds)
2414 if (!old_edge->src->aux)
2415 break;
2417 arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
2418 new_arg = arg;
2419 walk_tree (&new_arg, copy_tree_body_r, id, NULL);
2420 gcc_assert (new_arg);
2421 /* With return slot optimization we can end up with
2422 non-gimple (foo *)&this->m, fix that here. */
2423 if (TREE_CODE (new_arg) != SSA_NAME
2424 && TREE_CODE (new_arg) != FUNCTION_DECL
2425 && !is_gimple_val (new_arg))
2427 gimple_seq stmts = NULL;
2428 new_arg = force_gimple_operand (new_arg, &stmts, true,
2429 NULL);
2430 gsi_insert_seq_on_edge (new_edge, stmts);
2431 inserted = true;
2433 locus = gimple_phi_arg_location_from_edge (phi, old_edge);
2434 if (LOCATION_BLOCK (locus))
2436 tree *n;
2437 n = id->decl_map->get (LOCATION_BLOCK (locus));
2438 gcc_assert (n);
2439 locus = set_block (locus, *n);
2441 else
2442 locus = LOCATION_LOCUS (locus);
2444 add_phi_arg (new_phi, new_arg, new_edge, locus);
2450 /* Commit the delayed edge insertions. */
2451 if (inserted)
2452 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
2453 gsi_commit_one_edge_insert (new_edge, NULL);
2457 /* Wrapper for remap_decl so it can be used as a callback. */
2459 static tree
2460 remap_decl_1 (tree decl, void *data)
2462 return remap_decl (decl, (copy_body_data *) data);
2465 /* Build struct function and associated datastructures for the new clone
2466 NEW_FNDECL to be build. CALLEE_FNDECL is the original. Function changes
2467 the cfun to the function of new_fndecl (and current_function_decl too). */
2469 static void
2470 initialize_cfun (tree new_fndecl, tree callee_fndecl, profile_count count)
2472 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2474 if (!DECL_ARGUMENTS (new_fndecl))
2475 DECL_ARGUMENTS (new_fndecl) = DECL_ARGUMENTS (callee_fndecl);
2476 if (!DECL_RESULT (new_fndecl))
2477 DECL_RESULT (new_fndecl) = DECL_RESULT (callee_fndecl);
2479 /* Register specific tree functions. */
2480 gimple_register_cfg_hooks ();
2482 /* Get clean struct function. */
2483 push_struct_function (new_fndecl);
2485 /* We will rebuild these, so just sanity check that they are empty. */
2486 gcc_assert (VALUE_HISTOGRAMS (cfun) == NULL);
2487 gcc_assert (cfun->local_decls == NULL);
2488 gcc_assert (cfun->cfg == NULL);
2489 gcc_assert (cfun->decl == new_fndecl);
2491 /* Copy items we preserve during cloning. */
2492 cfun->static_chain_decl = src_cfun->static_chain_decl;
2493 cfun->nonlocal_goto_save_area = src_cfun->nonlocal_goto_save_area;
2494 cfun->function_end_locus = src_cfun->function_end_locus;
2495 cfun->curr_properties = src_cfun->curr_properties;
2496 cfun->last_verified = src_cfun->last_verified;
2497 cfun->va_list_gpr_size = src_cfun->va_list_gpr_size;
2498 cfun->va_list_fpr_size = src_cfun->va_list_fpr_size;
2499 cfun->has_nonlocal_label = src_cfun->has_nonlocal_label;
2500 cfun->stdarg = src_cfun->stdarg;
2501 cfun->after_inlining = src_cfun->after_inlining;
2502 cfun->can_throw_non_call_exceptions
2503 = src_cfun->can_throw_non_call_exceptions;
2504 cfun->can_delete_dead_exceptions = src_cfun->can_delete_dead_exceptions;
2505 cfun->returns_struct = src_cfun->returns_struct;
2506 cfun->returns_pcc_struct = src_cfun->returns_pcc_struct;
2508 init_empty_tree_cfg ();
2510 profile_status_for_fn (cfun) = profile_status_for_fn (src_cfun);
2512 /* FIXME: When all counts are known to be zero, scaling is also meaningful.
2514 if (ENTRY_BLOCK_PTR_FOR_FN (src_cfun)->count.initialized_p ()
2515 && count.initialized_p ()
2516 && ENTRY_BLOCK_PTR_FOR_FN (src_cfun)->count.initialized_p ())
2518 ENTRY_BLOCK_PTR_FOR_FN (cfun)->count =
2519 ENTRY_BLOCK_PTR_FOR_FN (src_cfun)->count.apply_scale (count,
2520 ENTRY_BLOCK_PTR_FOR_FN (src_cfun)->count);
2521 EXIT_BLOCK_PTR_FOR_FN (cfun)->count =
2522 EXIT_BLOCK_PTR_FOR_FN (src_cfun)->count.apply_scale (count,
2523 ENTRY_BLOCK_PTR_FOR_FN (src_cfun)->count);
2525 ENTRY_BLOCK_PTR_FOR_FN (cfun)->frequency
2526 = ENTRY_BLOCK_PTR_FOR_FN (src_cfun)->frequency;
2527 EXIT_BLOCK_PTR_FOR_FN (cfun)->frequency =
2528 EXIT_BLOCK_PTR_FOR_FN (src_cfun)->frequency;
2529 if (src_cfun->eh)
2530 init_eh_for_function ();
2532 if (src_cfun->gimple_df)
2534 init_tree_ssa (cfun);
2535 cfun->gimple_df->in_ssa_p = src_cfun->gimple_df->in_ssa_p;
2536 if (cfun->gimple_df->in_ssa_p)
2537 init_ssa_operands (cfun);
2541 /* Helper function for copy_cfg_body. Move debug stmts from the end
2542 of NEW_BB to the beginning of successor basic blocks when needed. If the
2543 successor has multiple predecessors, reset them, otherwise keep
2544 their value. */
2546 static void
2547 maybe_move_debug_stmts_to_successors (copy_body_data *id, basic_block new_bb)
2549 edge e;
2550 edge_iterator ei;
2551 gimple_stmt_iterator si = gsi_last_nondebug_bb (new_bb);
2553 if (gsi_end_p (si)
2554 || gsi_one_before_end_p (si)
2555 || !(stmt_can_throw_internal (gsi_stmt (si))
2556 || stmt_can_make_abnormal_goto (gsi_stmt (si))))
2557 return;
2559 FOR_EACH_EDGE (e, ei, new_bb->succs)
2561 gimple_stmt_iterator ssi = gsi_last_bb (new_bb);
2562 gimple_stmt_iterator dsi = gsi_after_labels (e->dest);
2563 while (is_gimple_debug (gsi_stmt (ssi)))
2565 gimple *stmt = gsi_stmt (ssi);
2566 gdebug *new_stmt;
2567 tree var;
2568 tree value;
2570 /* For the last edge move the debug stmts instead of copying
2571 them. */
2572 if (ei_one_before_end_p (ei))
2574 si = ssi;
2575 gsi_prev (&ssi);
2576 if (!single_pred_p (e->dest) && gimple_debug_bind_p (stmt))
2577 gimple_debug_bind_reset_value (stmt);
2578 gsi_remove (&si, false);
2579 gsi_insert_before (&dsi, stmt, GSI_SAME_STMT);
2580 continue;
2583 if (gimple_debug_bind_p (stmt))
2585 var = gimple_debug_bind_get_var (stmt);
2586 if (single_pred_p (e->dest))
2588 value = gimple_debug_bind_get_value (stmt);
2589 value = unshare_expr (value);
2591 else
2592 value = NULL_TREE;
2593 new_stmt = gimple_build_debug_bind (var, value, stmt);
2595 else if (gimple_debug_source_bind_p (stmt))
2597 var = gimple_debug_source_bind_get_var (stmt);
2598 value = gimple_debug_source_bind_get_value (stmt);
2599 new_stmt = gimple_build_debug_source_bind (var, value, stmt);
2601 else
2602 gcc_unreachable ();
2603 gsi_insert_before (&dsi, new_stmt, GSI_SAME_STMT);
2604 id->debug_stmts.safe_push (new_stmt);
2605 gsi_prev (&ssi);
2610 /* Make a copy of the sub-loops of SRC_PARENT and place them
2611 as siblings of DEST_PARENT. */
2613 static void
2614 copy_loops (copy_body_data *id,
2615 struct loop *dest_parent, struct loop *src_parent)
2617 struct loop *src_loop = src_parent->inner;
2618 while (src_loop)
2620 if (!id->blocks_to_copy
2621 || bitmap_bit_p (id->blocks_to_copy, src_loop->header->index))
2623 struct loop *dest_loop = alloc_loop ();
2625 /* Assign the new loop its header and latch and associate
2626 those with the new loop. */
2627 dest_loop->header = (basic_block)src_loop->header->aux;
2628 dest_loop->header->loop_father = dest_loop;
2629 if (src_loop->latch != NULL)
2631 dest_loop->latch = (basic_block)src_loop->latch->aux;
2632 dest_loop->latch->loop_father = dest_loop;
2635 /* Copy loop meta-data. */
2636 copy_loop_info (src_loop, dest_loop);
2638 /* Finally place it into the loop array and the loop tree. */
2639 place_new_loop (cfun, dest_loop);
2640 flow_loop_tree_node_add (dest_parent, dest_loop);
2642 dest_loop->safelen = src_loop->safelen;
2643 dest_loop->dont_vectorize = src_loop->dont_vectorize;
2644 if (src_loop->force_vectorize)
2646 dest_loop->force_vectorize = true;
2647 cfun->has_force_vectorize_loops = true;
2649 if (src_loop->simduid)
2651 dest_loop->simduid = remap_decl (src_loop->simduid, id);
2652 cfun->has_simduid_loops = true;
2655 /* Recurse. */
2656 copy_loops (id, dest_loop, src_loop);
2658 src_loop = src_loop->next;
2662 /* Call cgraph_redirect_edge_call_stmt_to_callee on all calls in BB */
2664 void
2665 redirect_all_calls (copy_body_data * id, basic_block bb)
2667 gimple_stmt_iterator si;
2668 gimple *last = last_stmt (bb);
2669 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
2671 gimple *stmt = gsi_stmt (si);
2672 if (is_gimple_call (stmt))
2674 struct cgraph_edge *edge = id->dst_node->get_edge (stmt);
2675 if (edge)
2677 edge->redirect_call_stmt_to_callee ();
2678 if (stmt == last && id->call_stmt && maybe_clean_eh_stmt (stmt))
2679 gimple_purge_dead_eh_edges (bb);
2685 /* Convert estimated frequencies into counts for NODE, scaling COUNT
2686 with each bb's frequency. Used when NODE has a 0-weight entry
2687 but we are about to inline it into a non-zero count call bb.
2688 See the comments for handle_missing_profiles() in predict.c for
2689 when this can happen for COMDATs. */
2691 void
2692 freqs_to_counts (struct cgraph_node *node, profile_count count)
2694 basic_block bb;
2695 edge_iterator ei;
2696 edge e;
2697 struct function *fn = DECL_STRUCT_FUNCTION (node->decl);
2699 FOR_ALL_BB_FN(bb, fn)
2701 bb->count = count.apply_scale (bb->frequency, BB_FREQ_MAX);
2702 FOR_EACH_EDGE (e, ei, bb->succs)
2703 e->count = e->src->count.apply_probability (e->probability);
2707 /* Make a copy of the body of FN so that it can be inserted inline in
2708 another function. Walks FN via CFG, returns new fndecl. */
2710 static tree
2711 copy_cfg_body (copy_body_data * id, profile_count count, int frequency_scale,
2712 basic_block entry_block_map, basic_block exit_block_map,
2713 basic_block new_entry)
2715 tree callee_fndecl = id->src_fn;
2716 /* Original cfun for the callee, doesn't change. */
2717 struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2718 struct function *cfun_to_copy;
2719 basic_block bb;
2720 tree new_fndecl = NULL;
2721 bool need_debug_cleanup = false;
2722 int last;
2723 int incoming_frequency = 0;
2724 profile_count incoming_count = profile_count::zero ();
2725 profile_count num = count;
2726 profile_count den = ENTRY_BLOCK_PTR_FOR_FN (src_cfun)->count;
2727 bool scale = num.initialized_p ()
2728 && (den > 0 || num == profile_count::zero ());
2730 /* This can happen for COMDAT routines that end up with 0 counts
2731 despite being called (see the comments for handle_missing_profiles()
2732 in predict.c as to why). Apply counts to the blocks in the callee
2733 before inlining, using the guessed edge frequencies, so that we don't
2734 end up with a 0-count inline body which can confuse downstream
2735 optimizations such as function splitting. */
2736 if (!(ENTRY_BLOCK_PTR_FOR_FN (src_cfun)->count > 0) && count > 0)
2738 /* Apply the larger of the call bb count and the total incoming
2739 call edge count to the callee. */
2740 profile_count in_count = profile_count::zero ();
2741 struct cgraph_edge *in_edge;
2742 for (in_edge = id->src_node->callers; in_edge;
2743 in_edge = in_edge->next_caller)
2744 if (in_edge->count.initialized_p ())
2745 in_count += in_edge->count;
2746 freqs_to_counts (id->src_node, count > in_count ? count : in_count);
2749 /* Register specific tree functions. */
2750 gimple_register_cfg_hooks ();
2752 /* If we are inlining just region of the function, make sure to connect
2753 new entry to ENTRY_BLOCK_PTR_FOR_FN (cfun). Since new entry can be
2754 part of loop, we must compute frequency and probability of
2755 ENTRY_BLOCK_PTR_FOR_FN (cfun) based on the frequencies and
2756 probabilities of edges incoming from nonduplicated region. */
2757 if (new_entry)
2759 edge e;
2760 edge_iterator ei;
2762 FOR_EACH_EDGE (e, ei, new_entry->preds)
2763 if (!e->src->aux)
2765 incoming_frequency += EDGE_FREQUENCY (e);
2766 incoming_count += e->count;
2768 if (scale)
2769 incoming_count = incoming_count.apply_scale (num, den);
2770 else
2771 incoming_count = profile_count::uninitialized ();
2772 incoming_frequency
2773 = apply_scale ((gcov_type)incoming_frequency, frequency_scale);
2774 ENTRY_BLOCK_PTR_FOR_FN (cfun)->count = incoming_count;
2775 ENTRY_BLOCK_PTR_FOR_FN (cfun)->frequency = incoming_frequency;
2778 /* Must have a CFG here at this point. */
2779 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN
2780 (DECL_STRUCT_FUNCTION (callee_fndecl)));
2782 cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
2784 ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy)->aux = entry_block_map;
2785 EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy)->aux = exit_block_map;
2786 entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FN (cfun_to_copy);
2787 exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FN (cfun_to_copy);
2789 /* Duplicate any exception-handling regions. */
2790 if (cfun->eh)
2791 id->eh_map = duplicate_eh_regions (cfun_to_copy, NULL, id->eh_lp_nr,
2792 remap_decl_1, id);
2794 /* Use aux pointers to map the original blocks to copy. */
2795 FOR_EACH_BB_FN (bb, cfun_to_copy)
2796 if (!id->blocks_to_copy || bitmap_bit_p (id->blocks_to_copy, bb->index))
2798 basic_block new_bb = copy_bb (id, bb, frequency_scale, num, den);
2799 bb->aux = new_bb;
2800 new_bb->aux = bb;
2801 new_bb->loop_father = entry_block_map->loop_father;
2804 last = last_basic_block_for_fn (cfun);
2806 /* Now that we've duplicated the blocks, duplicate their edges. */
2807 basic_block abnormal_goto_dest = NULL;
2808 if (id->call_stmt
2809 && stmt_can_make_abnormal_goto (id->call_stmt))
2811 gimple_stmt_iterator gsi = gsi_for_stmt (id->call_stmt);
2813 bb = gimple_bb (id->call_stmt);
2814 gsi_next (&gsi);
2815 if (gsi_end_p (gsi))
2816 abnormal_goto_dest = get_abnormal_succ_dispatcher (bb);
2818 FOR_ALL_BB_FN (bb, cfun_to_copy)
2819 if (!id->blocks_to_copy
2820 || (bb->index > 0 && bitmap_bit_p (id->blocks_to_copy, bb->index)))
2821 need_debug_cleanup |= copy_edges_for_bb (bb, num, den, exit_block_map,
2822 abnormal_goto_dest);
2824 if (new_entry)
2826 edge e = make_edge (entry_block_map, (basic_block)new_entry->aux, EDGE_FALLTHRU);
2827 e->probability = profile_probability::always ();
2828 e->count = incoming_count;
2831 /* Duplicate the loop tree, if available and wanted. */
2832 if (loops_for_fn (src_cfun) != NULL
2833 && current_loops != NULL)
2835 copy_loops (id, entry_block_map->loop_father,
2836 get_loop (src_cfun, 0));
2837 /* Defer to cfgcleanup to update loop-father fields of basic-blocks. */
2838 loops_state_set (LOOPS_NEED_FIXUP);
2841 /* If the loop tree in the source function needed fixup, mark the
2842 destination loop tree for fixup, too. */
2843 if (loops_for_fn (src_cfun)->state & LOOPS_NEED_FIXUP)
2844 loops_state_set (LOOPS_NEED_FIXUP);
2846 if (gimple_in_ssa_p (cfun))
2847 FOR_ALL_BB_FN (bb, cfun_to_copy)
2848 if (!id->blocks_to_copy
2849 || (bb->index > 0 && bitmap_bit_p (id->blocks_to_copy, bb->index)))
2850 copy_phis_for_bb (bb, id);
2852 FOR_ALL_BB_FN (bb, cfun_to_copy)
2853 if (bb->aux)
2855 if (need_debug_cleanup
2856 && bb->index != ENTRY_BLOCK
2857 && bb->index != EXIT_BLOCK)
2858 maybe_move_debug_stmts_to_successors (id, (basic_block) bb->aux);
2859 /* Update call edge destinations. This can not be done before loop
2860 info is updated, because we may split basic blocks. */
2861 if (id->transform_call_graph_edges == CB_CGE_DUPLICATE
2862 && bb->index != ENTRY_BLOCK
2863 && bb->index != EXIT_BLOCK)
2864 redirect_all_calls (id, (basic_block)bb->aux);
2865 ((basic_block)bb->aux)->aux = NULL;
2866 bb->aux = NULL;
2869 /* Zero out AUX fields of newly created block during EH edge
2870 insertion. */
2871 for (; last < last_basic_block_for_fn (cfun); last++)
2873 if (need_debug_cleanup)
2874 maybe_move_debug_stmts_to_successors (id,
2875 BASIC_BLOCK_FOR_FN (cfun, last));
2876 BASIC_BLOCK_FOR_FN (cfun, last)->aux = NULL;
2877 /* Update call edge destinations. This can not be done before loop
2878 info is updated, because we may split basic blocks. */
2879 if (id->transform_call_graph_edges == CB_CGE_DUPLICATE)
2880 redirect_all_calls (id, BASIC_BLOCK_FOR_FN (cfun, last));
2882 entry_block_map->aux = NULL;
2883 exit_block_map->aux = NULL;
2885 if (id->eh_map)
2887 delete id->eh_map;
2888 id->eh_map = NULL;
2890 if (id->dependence_map)
2892 delete id->dependence_map;
2893 id->dependence_map = NULL;
2896 return new_fndecl;
2899 /* Copy the debug STMT using ID. We deal with these statements in a
2900 special way: if any variable in their VALUE expression wasn't
2901 remapped yet, we won't remap it, because that would get decl uids
2902 out of sync, causing codegen differences between -g and -g0. If
2903 this arises, we drop the VALUE expression altogether. */
2905 static void
2906 copy_debug_stmt (gdebug *stmt, copy_body_data *id)
2908 tree t, *n;
2909 struct walk_stmt_info wi;
2911 if (gimple_block (stmt))
2913 n = id->decl_map->get (gimple_block (stmt));
2914 gimple_set_block (stmt, n ? *n : id->block);
2917 /* Remap all the operands in COPY. */
2918 memset (&wi, 0, sizeof (wi));
2919 wi.info = id;
2921 processing_debug_stmt = 1;
2923 if (gimple_debug_source_bind_p (stmt))
2924 t = gimple_debug_source_bind_get_var (stmt);
2925 else
2926 t = gimple_debug_bind_get_var (stmt);
2928 if (TREE_CODE (t) == PARM_DECL && id->debug_map
2929 && (n = id->debug_map->get (t)))
2931 gcc_assert (VAR_P (*n));
2932 t = *n;
2934 else if (VAR_P (t) && !is_global_var (t) && !id->decl_map->get (t))
2935 /* T is a non-localized variable. */;
2936 else
2937 walk_tree (&t, remap_gimple_op_r, &wi, NULL);
2939 if (gimple_debug_bind_p (stmt))
2941 gimple_debug_bind_set_var (stmt, t);
2943 if (gimple_debug_bind_has_value_p (stmt))
2944 walk_tree (gimple_debug_bind_get_value_ptr (stmt),
2945 remap_gimple_op_r, &wi, NULL);
2947 /* Punt if any decl couldn't be remapped. */
2948 if (processing_debug_stmt < 0)
2949 gimple_debug_bind_reset_value (stmt);
2951 else if (gimple_debug_source_bind_p (stmt))
2953 gimple_debug_source_bind_set_var (stmt, t);
2954 /* When inlining and source bind refers to one of the optimized
2955 away parameters, change the source bind into normal debug bind
2956 referring to the corresponding DEBUG_EXPR_DECL that should have
2957 been bound before the call stmt. */
2958 t = gimple_debug_source_bind_get_value (stmt);
2959 if (t != NULL_TREE
2960 && TREE_CODE (t) == PARM_DECL
2961 && id->call_stmt)
2963 vec<tree, va_gc> **debug_args = decl_debug_args_lookup (id->src_fn);
2964 unsigned int i;
2965 if (debug_args != NULL)
2967 for (i = 0; i < vec_safe_length (*debug_args); i += 2)
2968 if ((**debug_args)[i] == DECL_ORIGIN (t)
2969 && TREE_CODE ((**debug_args)[i + 1]) == DEBUG_EXPR_DECL)
2971 t = (**debug_args)[i + 1];
2972 stmt->subcode = GIMPLE_DEBUG_BIND;
2973 gimple_debug_bind_set_value (stmt, t);
2974 break;
2978 if (gimple_debug_source_bind_p (stmt))
2979 walk_tree (gimple_debug_source_bind_get_value_ptr (stmt),
2980 remap_gimple_op_r, &wi, NULL);
2983 processing_debug_stmt = 0;
2985 update_stmt (stmt);
2988 /* Process deferred debug stmts. In order to give values better odds
2989 of being successfully remapped, we delay the processing of debug
2990 stmts until all other stmts that might require remapping are
2991 processed. */
2993 static void
2994 copy_debug_stmts (copy_body_data *id)
2996 size_t i;
2997 gdebug *stmt;
2999 if (!id->debug_stmts.exists ())
3000 return;
3002 FOR_EACH_VEC_ELT (id->debug_stmts, i, stmt)
3003 copy_debug_stmt (stmt, id);
3005 id->debug_stmts.release ();
3008 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
3009 another function. */
3011 static tree
3012 copy_tree_body (copy_body_data *id)
3014 tree fndecl = id->src_fn;
3015 tree body = DECL_SAVED_TREE (fndecl);
3017 walk_tree (&body, copy_tree_body_r, id, NULL);
3019 return body;
3022 /* Make a copy of the body of FN so that it can be inserted inline in
3023 another function. */
3025 static tree
3026 copy_body (copy_body_data *id, profile_count count, int frequency_scale,
3027 basic_block entry_block_map, basic_block exit_block_map,
3028 basic_block new_entry)
3030 tree fndecl = id->src_fn;
3031 tree body;
3033 /* If this body has a CFG, walk CFG and copy. */
3034 gcc_assert (ENTRY_BLOCK_PTR_FOR_FN (DECL_STRUCT_FUNCTION (fndecl)));
3035 body = copy_cfg_body (id, count, frequency_scale, entry_block_map, exit_block_map,
3036 new_entry);
3037 copy_debug_stmts (id);
3039 return body;
3042 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
3043 defined in function FN, or of a data member thereof. */
3045 static bool
3046 self_inlining_addr_expr (tree value, tree fn)
3048 tree var;
3050 if (TREE_CODE (value) != ADDR_EXPR)
3051 return false;
3053 var = get_base_address (TREE_OPERAND (value, 0));
3055 return var && auto_var_in_fn_p (var, fn);
3058 /* Append to BB a debug annotation that binds VAR to VALUE, inheriting
3059 lexical block and line number information from base_stmt, if given,
3060 or from the last stmt of the block otherwise. */
3062 static gimple *
3063 insert_init_debug_bind (copy_body_data *id,
3064 basic_block bb, tree var, tree value,
3065 gimple *base_stmt)
3067 gimple *note;
3068 gimple_stmt_iterator gsi;
3069 tree tracked_var;
3071 if (!gimple_in_ssa_p (id->src_cfun))
3072 return NULL;
3074 if (!opt_for_fn (id->dst_fn, flag_var_tracking_assignments))
3075 return NULL;
3077 tracked_var = target_for_debug_bind (var);
3078 if (!tracked_var)
3079 return NULL;
3081 if (bb)
3083 gsi = gsi_last_bb (bb);
3084 if (!base_stmt && !gsi_end_p (gsi))
3085 base_stmt = gsi_stmt (gsi);
3088 note = gimple_build_debug_bind (tracked_var, unshare_expr (value), base_stmt);
3090 if (bb)
3092 if (!gsi_end_p (gsi))
3093 gsi_insert_after (&gsi, note, GSI_SAME_STMT);
3094 else
3095 gsi_insert_before (&gsi, note, GSI_SAME_STMT);
3098 return note;
3101 static void
3102 insert_init_stmt (copy_body_data *id, basic_block bb, gimple *init_stmt)
3104 /* If VAR represents a zero-sized variable, it's possible that the
3105 assignment statement may result in no gimple statements. */
3106 if (init_stmt)
3108 gimple_stmt_iterator si = gsi_last_bb (bb);
3110 /* We can end up with init statements that store to a non-register
3111 from a rhs with a conversion. Handle that here by forcing the
3112 rhs into a temporary. gimple_regimplify_operands is not
3113 prepared to do this for us. */
3114 if (!is_gimple_debug (init_stmt)
3115 && !is_gimple_reg (gimple_assign_lhs (init_stmt))
3116 && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt)))
3117 && gimple_assign_rhs_class (init_stmt) == GIMPLE_UNARY_RHS)
3119 tree rhs = build1 (gimple_assign_rhs_code (init_stmt),
3120 gimple_expr_type (init_stmt),
3121 gimple_assign_rhs1 (init_stmt));
3122 rhs = force_gimple_operand_gsi (&si, rhs, true, NULL_TREE, false,
3123 GSI_NEW_STMT);
3124 gimple_assign_set_rhs_code (init_stmt, TREE_CODE (rhs));
3125 gimple_assign_set_rhs1 (init_stmt, rhs);
3127 gsi_insert_after (&si, init_stmt, GSI_NEW_STMT);
3128 gimple_regimplify_operands (init_stmt, &si);
3130 if (!is_gimple_debug (init_stmt))
3132 tree def = gimple_assign_lhs (init_stmt);
3133 insert_init_debug_bind (id, bb, def, def, init_stmt);
3138 /* Initialize parameter P with VALUE. If needed, produce init statement
3139 at the end of BB. When BB is NULL, we return init statement to be
3140 output later. */
3141 static gimple *
3142 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
3143 basic_block bb, tree *vars)
3145 gimple *init_stmt = NULL;
3146 tree var;
3147 tree rhs = value;
3148 tree def = (gimple_in_ssa_p (cfun)
3149 ? ssa_default_def (id->src_cfun, p) : NULL);
3151 if (value
3152 && value != error_mark_node
3153 && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value)))
3155 /* If we can match up types by promotion/demotion do so. */
3156 if (fold_convertible_p (TREE_TYPE (p), value))
3157 rhs = fold_convert (TREE_TYPE (p), value);
3158 else
3160 /* ??? For valid programs we should not end up here.
3161 Still if we end up with truly mismatched types here, fall back
3162 to using a VIEW_CONVERT_EXPR or a literal zero to not leak invalid
3163 GIMPLE to the following passes. */
3164 if (!is_gimple_reg_type (TREE_TYPE (value))
3165 || TYPE_SIZE (TREE_TYPE (p)) == TYPE_SIZE (TREE_TYPE (value)))
3166 rhs = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (p), value);
3167 else
3168 rhs = build_zero_cst (TREE_TYPE (p));
3172 /* Make an equivalent VAR_DECL. Note that we must NOT remap the type
3173 here since the type of this decl must be visible to the calling
3174 function. */
3175 var = copy_decl_to_var (p, id);
3177 /* Declare this new variable. */
3178 DECL_CHAIN (var) = *vars;
3179 *vars = var;
3181 /* Make gimplifier happy about this variable. */
3182 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
3184 /* If the parameter is never assigned to, has no SSA_NAMEs created,
3185 we would not need to create a new variable here at all, if it
3186 weren't for debug info. Still, we can just use the argument
3187 value. */
3188 if (TREE_READONLY (p)
3189 && !TREE_ADDRESSABLE (p)
3190 && value && !TREE_SIDE_EFFECTS (value)
3191 && !def)
3193 /* We may produce non-gimple trees by adding NOPs or introduce
3194 invalid sharing when operand is not really constant.
3195 It is not big deal to prohibit constant propagation here as
3196 we will constant propagate in DOM1 pass anyway. */
3197 if (is_gimple_min_invariant (value)
3198 && useless_type_conversion_p (TREE_TYPE (p),
3199 TREE_TYPE (value))
3200 /* We have to be very careful about ADDR_EXPR. Make sure
3201 the base variable isn't a local variable of the inlined
3202 function, e.g., when doing recursive inlining, direct or
3203 mutually-recursive or whatever, which is why we don't
3204 just test whether fn == current_function_decl. */
3205 && ! self_inlining_addr_expr (value, fn))
3207 insert_decl_map (id, p, value);
3208 insert_debug_decl_map (id, p, var);
3209 return insert_init_debug_bind (id, bb, var, value, NULL);
3213 /* Register the VAR_DECL as the equivalent for the PARM_DECL;
3214 that way, when the PARM_DECL is encountered, it will be
3215 automatically replaced by the VAR_DECL. */
3216 insert_decl_map (id, p, var);
3218 /* Even if P was TREE_READONLY, the new VAR should not be.
3219 In the original code, we would have constructed a
3220 temporary, and then the function body would have never
3221 changed the value of P. However, now, we will be
3222 constructing VAR directly. The constructor body may
3223 change its value multiple times as it is being
3224 constructed. Therefore, it must not be TREE_READONLY;
3225 the back-end assumes that TREE_READONLY variable is
3226 assigned to only once. */
3227 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
3228 TREE_READONLY (var) = 0;
3230 /* If there is no setup required and we are in SSA, take the easy route
3231 replacing all SSA names representing the function parameter by the
3232 SSA name passed to function.
3234 We need to construct map for the variable anyway as it might be used
3235 in different SSA names when parameter is set in function.
3237 Do replacement at -O0 for const arguments replaced by constant.
3238 This is important for builtin_constant_p and other construct requiring
3239 constant argument to be visible in inlined function body. */
3240 if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
3241 && (optimize
3242 || (TREE_READONLY (p)
3243 && is_gimple_min_invariant (rhs)))
3244 && (TREE_CODE (rhs) == SSA_NAME
3245 || is_gimple_min_invariant (rhs))
3246 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
3248 insert_decl_map (id, def, rhs);
3249 return insert_init_debug_bind (id, bb, var, rhs, NULL);
3252 /* If the value of argument is never used, don't care about initializing
3253 it. */
3254 if (optimize && gimple_in_ssa_p (cfun) && !def && is_gimple_reg (p))
3256 gcc_assert (!value || !TREE_SIDE_EFFECTS (value));
3257 return insert_init_debug_bind (id, bb, var, rhs, NULL);
3260 /* Initialize this VAR_DECL from the equivalent argument. Convert
3261 the argument to the proper type in case it was promoted. */
3262 if (value)
3264 if (rhs == error_mark_node)
3266 insert_decl_map (id, p, var);
3267 return insert_init_debug_bind (id, bb, var, rhs, NULL);
3270 STRIP_USELESS_TYPE_CONVERSION (rhs);
3272 /* If we are in SSA form properly remap the default definition
3273 or assign to a dummy SSA name if the parameter is unused and
3274 we are not optimizing. */
3275 if (gimple_in_ssa_p (cfun) && is_gimple_reg (p))
3277 if (def)
3279 def = remap_ssa_name (def, id);
3280 init_stmt = gimple_build_assign (def, rhs);
3281 SSA_NAME_IS_DEFAULT_DEF (def) = 0;
3282 set_ssa_default_def (cfun, var, NULL);
3284 else if (!optimize)
3286 def = make_ssa_name (var);
3287 init_stmt = gimple_build_assign (def, rhs);
3290 else
3291 init_stmt = gimple_build_assign (var, rhs);
3293 if (bb && init_stmt)
3294 insert_init_stmt (id, bb, init_stmt);
3296 return init_stmt;
3299 /* Generate code to initialize the parameters of the function at the
3300 top of the stack in ID from the GIMPLE_CALL STMT. */
3302 static void
3303 initialize_inlined_parameters (copy_body_data *id, gimple *stmt,
3304 tree fn, basic_block bb)
3306 tree parms;
3307 size_t i;
3308 tree p;
3309 tree vars = NULL_TREE;
3310 tree static_chain = gimple_call_chain (stmt);
3312 /* Figure out what the parameters are. */
3313 parms = DECL_ARGUMENTS (fn);
3315 /* Loop through the parameter declarations, replacing each with an
3316 equivalent VAR_DECL, appropriately initialized. */
3317 for (p = parms, i = 0; p; p = DECL_CHAIN (p), i++)
3319 tree val;
3320 val = i < gimple_call_num_args (stmt) ? gimple_call_arg (stmt, i) : NULL;
3321 setup_one_parameter (id, p, val, fn, bb, &vars);
3323 /* After remapping parameters remap their types. This has to be done
3324 in a second loop over all parameters to appropriately remap
3325 variable sized arrays when the size is specified in a
3326 parameter following the array. */
3327 for (p = parms, i = 0; p; p = DECL_CHAIN (p), i++)
3329 tree *varp = id->decl_map->get (p);
3330 if (varp && VAR_P (*varp))
3332 tree def = (gimple_in_ssa_p (cfun) && is_gimple_reg (p)
3333 ? ssa_default_def (id->src_cfun, p) : NULL);
3334 tree var = *varp;
3335 TREE_TYPE (var) = remap_type (TREE_TYPE (var), id);
3336 /* Also remap the default definition if it was remapped
3337 to the default definition of the parameter replacement
3338 by the parameter setup. */
3339 if (def)
3341 tree *defp = id->decl_map->get (def);
3342 if (defp
3343 && TREE_CODE (*defp) == SSA_NAME
3344 && SSA_NAME_VAR (*defp) == var)
3345 TREE_TYPE (*defp) = TREE_TYPE (var);
3350 /* Initialize the static chain. */
3351 p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
3352 gcc_assert (fn != current_function_decl);
3353 if (p)
3355 /* No static chain? Seems like a bug in tree-nested.c. */
3356 gcc_assert (static_chain);
3358 setup_one_parameter (id, p, static_chain, fn, bb, &vars);
3361 declare_inline_vars (id->block, vars);
3365 /* Declare a return variable to replace the RESULT_DECL for the
3366 function we are calling. An appropriate DECL_STMT is returned.
3367 The USE_STMT is filled to contain a use of the declaration to
3368 indicate the return value of the function.
3370 RETURN_SLOT, if non-null is place where to store the result. It
3371 is set only for CALL_EXPR_RETURN_SLOT_OPT. MODIFY_DEST, if non-null,
3372 was the LHS of the MODIFY_EXPR to which this call is the RHS.
3374 RETURN_BOUNDS holds a destination for returned bounds.
3376 The return value is a (possibly null) value that holds the result
3377 as seen by the caller. */
3379 static tree
3380 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest,
3381 tree return_bounds, basic_block entry_bb)
3383 tree callee = id->src_fn;
3384 tree result = DECL_RESULT (callee);
3385 tree callee_type = TREE_TYPE (result);
3386 tree caller_type;
3387 tree var, use;
3389 /* Handle type-mismatches in the function declaration return type
3390 vs. the call expression. */
3391 if (modify_dest)
3392 caller_type = TREE_TYPE (modify_dest);
3393 else
3394 caller_type = TREE_TYPE (TREE_TYPE (callee));
3396 /* We don't need to do anything for functions that don't return anything. */
3397 if (VOID_TYPE_P (callee_type))
3398 return NULL_TREE;
3400 /* If there was a return slot, then the return value is the
3401 dereferenced address of that object. */
3402 if (return_slot)
3404 /* The front end shouldn't have used both return_slot and
3405 a modify expression. */
3406 gcc_assert (!modify_dest);
3407 if (DECL_BY_REFERENCE (result))
3409 tree return_slot_addr = build_fold_addr_expr (return_slot);
3410 STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
3412 /* We are going to construct *&return_slot and we can't do that
3413 for variables believed to be not addressable.
3415 FIXME: This check possibly can match, because values returned
3416 via return slot optimization are not believed to have address
3417 taken by alias analysis. */
3418 gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
3419 var = return_slot_addr;
3421 else
3423 var = return_slot;
3424 gcc_assert (TREE_CODE (var) != SSA_NAME);
3425 if (TREE_ADDRESSABLE (result))
3426 mark_addressable (var);
3428 if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
3429 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
3430 && !DECL_GIMPLE_REG_P (result)
3431 && DECL_P (var))
3432 DECL_GIMPLE_REG_P (var) = 0;
3433 use = NULL;
3434 goto done;
3437 /* All types requiring non-trivial constructors should have been handled. */
3438 gcc_assert (!TREE_ADDRESSABLE (callee_type));
3440 /* Attempt to avoid creating a new temporary variable. */
3441 if (modify_dest
3442 && TREE_CODE (modify_dest) != SSA_NAME)
3444 bool use_it = false;
3446 /* We can't use MODIFY_DEST if there's type promotion involved. */
3447 if (!useless_type_conversion_p (callee_type, caller_type))
3448 use_it = false;
3450 /* ??? If we're assigning to a variable sized type, then we must
3451 reuse the destination variable, because we've no good way to
3452 create variable sized temporaries at this point. */
3453 else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
3454 use_it = true;
3456 /* If the callee cannot possibly modify MODIFY_DEST, then we can
3457 reuse it as the result of the call directly. Don't do this if
3458 it would promote MODIFY_DEST to addressable. */
3459 else if (TREE_ADDRESSABLE (result))
3460 use_it = false;
3461 else
3463 tree base_m = get_base_address (modify_dest);
3465 /* If the base isn't a decl, then it's a pointer, and we don't
3466 know where that's going to go. */
3467 if (!DECL_P (base_m))
3468 use_it = false;
3469 else if (is_global_var (base_m))
3470 use_it = false;
3471 else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
3472 || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
3473 && !DECL_GIMPLE_REG_P (result)
3474 && DECL_GIMPLE_REG_P (base_m))
3475 use_it = false;
3476 else if (!TREE_ADDRESSABLE (base_m))
3477 use_it = true;
3480 if (use_it)
3482 var = modify_dest;
3483 use = NULL;
3484 goto done;
3488 gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
3490 var = copy_result_decl_to_var (result, id);
3491 DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
3493 /* Do not have the rest of GCC warn about this variable as it should
3494 not be visible to the user. */
3495 TREE_NO_WARNING (var) = 1;
3497 declare_inline_vars (id->block, var);
3499 /* Build the use expr. If the return type of the function was
3500 promoted, convert it back to the expected type. */
3501 use = var;
3502 if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
3504 /* If we can match up types by promotion/demotion do so. */
3505 if (fold_convertible_p (caller_type, var))
3506 use = fold_convert (caller_type, var);
3507 else
3509 /* ??? For valid programs we should not end up here.
3510 Still if we end up with truly mismatched types here, fall back
3511 to using a MEM_REF to not leak invalid GIMPLE to the following
3512 passes. */
3513 /* Prevent var from being written into SSA form. */
3514 if (TREE_CODE (TREE_TYPE (var)) == VECTOR_TYPE
3515 || TREE_CODE (TREE_TYPE (var)) == COMPLEX_TYPE)
3516 DECL_GIMPLE_REG_P (var) = false;
3517 else if (is_gimple_reg_type (TREE_TYPE (var)))
3518 TREE_ADDRESSABLE (var) = true;
3519 use = fold_build2 (MEM_REF, caller_type,
3520 build_fold_addr_expr (var),
3521 build_int_cst (ptr_type_node, 0));
3525 STRIP_USELESS_TYPE_CONVERSION (use);
3527 if (DECL_BY_REFERENCE (result))
3529 TREE_ADDRESSABLE (var) = 1;
3530 var = build_fold_addr_expr (var);
3533 done:
3534 /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
3535 way, when the RESULT_DECL is encountered, it will be
3536 automatically replaced by the VAR_DECL.
3538 When returning by reference, ensure that RESULT_DECL remaps to
3539 gimple_val. */
3540 if (DECL_BY_REFERENCE (result)
3541 && !is_gimple_val (var))
3543 tree temp = create_tmp_var (TREE_TYPE (result), "retvalptr");
3544 insert_decl_map (id, result, temp);
3545 /* When RESULT_DECL is in SSA form, we need to remap and initialize
3546 it's default_def SSA_NAME. */
3547 if (gimple_in_ssa_p (id->src_cfun)
3548 && is_gimple_reg (result))
3550 temp = make_ssa_name (temp);
3551 insert_decl_map (id, ssa_default_def (id->src_cfun, result), temp);
3553 insert_init_stmt (id, entry_bb, gimple_build_assign (temp, var));
3555 else
3556 insert_decl_map (id, result, var);
3558 /* Remember this so we can ignore it in remap_decls. */
3559 id->retvar = var;
3561 /* If returned bounds are used, then make var for them. */
3562 if (return_bounds)
3564 tree bndtemp = create_tmp_var (pointer_bounds_type_node, "retbnd");
3565 DECL_SEEN_IN_BIND_EXPR_P (bndtemp) = 1;
3566 TREE_NO_WARNING (bndtemp) = 1;
3567 declare_inline_vars (id->block, bndtemp);
3569 id->retbnd = bndtemp;
3570 insert_init_stmt (id, entry_bb,
3571 gimple_build_assign (bndtemp, chkp_get_zero_bounds_var ()));
3574 return use;
3577 /* Determine if the function can be copied. If so return NULL. If
3578 not return a string describng the reason for failure. */
3580 const char *
3581 copy_forbidden (struct function *fun)
3583 const char *reason = fun->cannot_be_copied_reason;
3585 /* Only examine the function once. */
3586 if (fun->cannot_be_copied_set)
3587 return reason;
3589 /* We cannot copy a function that receives a non-local goto
3590 because we cannot remap the destination label used in the
3591 function that is performing the non-local goto. */
3592 /* ??? Actually, this should be possible, if we work at it.
3593 No doubt there's just a handful of places that simply
3594 assume it doesn't happen and don't substitute properly. */
3595 if (fun->has_nonlocal_label)
3597 reason = G_("function %q+F can never be copied "
3598 "because it receives a non-local goto");
3599 goto fail;
3602 if (fun->has_forced_label_in_static)
3604 reason = G_("function %q+F can never be copied because it saves "
3605 "address of local label in a static variable");
3606 goto fail;
3609 fail:
3610 fun->cannot_be_copied_reason = reason;
3611 fun->cannot_be_copied_set = true;
3612 return reason;
3616 static const char *inline_forbidden_reason;
3618 /* A callback for walk_gimple_seq to handle statements. Returns non-null
3619 iff a function can not be inlined. Also sets the reason why. */
3621 static tree
3622 inline_forbidden_p_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p,
3623 struct walk_stmt_info *wip)
3625 tree fn = (tree) wip->info;
3626 tree t;
3627 gimple *stmt = gsi_stmt (*gsi);
3629 switch (gimple_code (stmt))
3631 case GIMPLE_CALL:
3632 /* Refuse to inline alloca call unless user explicitly forced so as
3633 this may change program's memory overhead drastically when the
3634 function using alloca is called in loop. In GCC present in
3635 SPEC2000 inlining into schedule_block cause it to require 2GB of
3636 RAM instead of 256MB. Don't do so for alloca calls emitted for
3637 VLA objects as those can't cause unbounded growth (they're always
3638 wrapped inside stack_save/stack_restore regions. */
3639 if (gimple_maybe_alloca_call_p (stmt)
3640 && !gimple_call_alloca_for_var_p (as_a <gcall *> (stmt))
3641 && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
3643 inline_forbidden_reason
3644 = G_("function %q+F can never be inlined because it uses "
3645 "alloca (override using the always_inline attribute)");
3646 *handled_ops_p = true;
3647 return fn;
3650 t = gimple_call_fndecl (stmt);
3651 if (t == NULL_TREE)
3652 break;
3654 /* We cannot inline functions that call setjmp. */
3655 if (setjmp_call_p (t))
3657 inline_forbidden_reason
3658 = G_("function %q+F can never be inlined because it uses setjmp");
3659 *handled_ops_p = true;
3660 return t;
3663 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
3664 switch (DECL_FUNCTION_CODE (t))
3666 /* We cannot inline functions that take a variable number of
3667 arguments. */
3668 case BUILT_IN_VA_START:
3669 case BUILT_IN_NEXT_ARG:
3670 case BUILT_IN_VA_END:
3671 inline_forbidden_reason
3672 = G_("function %q+F can never be inlined because it "
3673 "uses variable argument lists");
3674 *handled_ops_p = true;
3675 return t;
3677 case BUILT_IN_LONGJMP:
3678 /* We can't inline functions that call __builtin_longjmp at
3679 all. The non-local goto machinery really requires the
3680 destination be in a different function. If we allow the
3681 function calling __builtin_longjmp to be inlined into the
3682 function calling __builtin_setjmp, Things will Go Awry. */
3683 inline_forbidden_reason
3684 = G_("function %q+F can never be inlined because "
3685 "it uses setjmp-longjmp exception handling");
3686 *handled_ops_p = true;
3687 return t;
3689 case BUILT_IN_NONLOCAL_GOTO:
3690 /* Similarly. */
3691 inline_forbidden_reason
3692 = G_("function %q+F can never be inlined because "
3693 "it uses non-local goto");
3694 *handled_ops_p = true;
3695 return t;
3697 case BUILT_IN_RETURN:
3698 case BUILT_IN_APPLY_ARGS:
3699 /* If a __builtin_apply_args caller would be inlined,
3700 it would be saving arguments of the function it has
3701 been inlined into. Similarly __builtin_return would
3702 return from the function the inline has been inlined into. */
3703 inline_forbidden_reason
3704 = G_("function %q+F can never be inlined because "
3705 "it uses __builtin_return or __builtin_apply_args");
3706 *handled_ops_p = true;
3707 return t;
3709 default:
3710 break;
3712 break;
3714 case GIMPLE_GOTO:
3715 t = gimple_goto_dest (stmt);
3717 /* We will not inline a function which uses computed goto. The
3718 addresses of its local labels, which may be tucked into
3719 global storage, are of course not constant across
3720 instantiations, which causes unexpected behavior. */
3721 if (TREE_CODE (t) != LABEL_DECL)
3723 inline_forbidden_reason
3724 = G_("function %q+F can never be inlined "
3725 "because it contains a computed goto");
3726 *handled_ops_p = true;
3727 return t;
3729 break;
3731 default:
3732 break;
3735 *handled_ops_p = false;
3736 return NULL_TREE;
3739 /* Return true if FNDECL is a function that cannot be inlined into
3740 another one. */
3742 static bool
3743 inline_forbidden_p (tree fndecl)
3745 struct function *fun = DECL_STRUCT_FUNCTION (fndecl);
3746 struct walk_stmt_info wi;
3747 basic_block bb;
3748 bool forbidden_p = false;
3750 /* First check for shared reasons not to copy the code. */
3751 inline_forbidden_reason = copy_forbidden (fun);
3752 if (inline_forbidden_reason != NULL)
3753 return true;
3755 /* Next, walk the statements of the function looking for
3756 constraucts we can't handle, or are non-optimal for inlining. */
3757 hash_set<tree> visited_nodes;
3758 memset (&wi, 0, sizeof (wi));
3759 wi.info = (void *) fndecl;
3760 wi.pset = &visited_nodes;
3762 FOR_EACH_BB_FN (bb, fun)
3764 gimple *ret;
3765 gimple_seq seq = bb_seq (bb);
3766 ret = walk_gimple_seq (seq, inline_forbidden_p_stmt, NULL, &wi);
3767 forbidden_p = (ret != NULL);
3768 if (forbidden_p)
3769 break;
3772 return forbidden_p;
3775 /* Return false if the function FNDECL cannot be inlined on account of its
3776 attributes, true otherwise. */
3777 static bool
3778 function_attribute_inlinable_p (const_tree fndecl)
3780 if (targetm.attribute_table)
3782 const_tree a;
3784 for (a = DECL_ATTRIBUTES (fndecl); a; a = TREE_CHAIN (a))
3786 const_tree name = TREE_PURPOSE (a);
3787 int i;
3789 for (i = 0; targetm.attribute_table[i].name != NULL; i++)
3790 if (is_attribute_p (targetm.attribute_table[i].name, name))
3791 return targetm.function_attribute_inlinable_p (fndecl);
3795 return true;
3798 /* Returns nonzero if FN is a function that does not have any
3799 fundamental inline blocking properties. */
3801 bool
3802 tree_inlinable_function_p (tree fn)
3804 bool inlinable = true;
3805 bool do_warning;
3806 tree always_inline;
3808 /* If we've already decided this function shouldn't be inlined,
3809 there's no need to check again. */
3810 if (DECL_UNINLINABLE (fn))
3811 return false;
3813 /* We only warn for functions declared `inline' by the user. */
3814 do_warning = (warn_inline
3815 && DECL_DECLARED_INLINE_P (fn)
3816 && !DECL_NO_INLINE_WARNING_P (fn)
3817 && !DECL_IN_SYSTEM_HEADER (fn));
3819 always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn));
3821 if (flag_no_inline
3822 && always_inline == NULL)
3824 if (do_warning)
3825 warning (OPT_Winline, "function %q+F can never be inlined because it "
3826 "is suppressed using -fno-inline", fn);
3827 inlinable = false;
3830 else if (!function_attribute_inlinable_p (fn))
3832 if (do_warning)
3833 warning (OPT_Winline, "function %q+F can never be inlined because it "
3834 "uses attributes conflicting with inlining", fn);
3835 inlinable = false;
3838 else if (inline_forbidden_p (fn))
3840 /* See if we should warn about uninlinable functions. Previously,
3841 some of these warnings would be issued while trying to expand
3842 the function inline, but that would cause multiple warnings
3843 about functions that would for example call alloca. But since
3844 this a property of the function, just one warning is enough.
3845 As a bonus we can now give more details about the reason why a
3846 function is not inlinable. */
3847 if (always_inline)
3848 error (inline_forbidden_reason, fn);
3849 else if (do_warning)
3850 warning (OPT_Winline, inline_forbidden_reason, fn);
3852 inlinable = false;
3855 /* Squirrel away the result so that we don't have to check again. */
3856 DECL_UNINLINABLE (fn) = !inlinable;
3858 return inlinable;
3861 /* Estimate the cost of a memory move of type TYPE. Use machine dependent
3862 word size and take possible memcpy call into account and return
3863 cost based on whether optimizing for size or speed according to SPEED_P. */
3866 estimate_move_cost (tree type, bool ARG_UNUSED (speed_p))
3868 HOST_WIDE_INT size;
3870 gcc_assert (!VOID_TYPE_P (type));
3872 if (TREE_CODE (type) == VECTOR_TYPE)
3874 machine_mode inner = TYPE_MODE (TREE_TYPE (type));
3875 machine_mode simd
3876 = targetm.vectorize.preferred_simd_mode (inner);
3877 int simd_mode_size = GET_MODE_SIZE (simd);
3878 return ((GET_MODE_SIZE (TYPE_MODE (type)) + simd_mode_size - 1)
3879 / simd_mode_size);
3882 size = int_size_in_bytes (type);
3884 if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO (speed_p))
3885 /* Cost of a memcpy call, 3 arguments and the call. */
3886 return 4;
3887 else
3888 return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
3891 /* Returns cost of operation CODE, according to WEIGHTS */
3893 static int
3894 estimate_operator_cost (enum tree_code code, eni_weights *weights,
3895 tree op1 ATTRIBUTE_UNUSED, tree op2)
3897 switch (code)
3899 /* These are "free" conversions, or their presumed cost
3900 is folded into other operations. */
3901 case RANGE_EXPR:
3902 CASE_CONVERT:
3903 case COMPLEX_EXPR:
3904 case PAREN_EXPR:
3905 case VIEW_CONVERT_EXPR:
3906 return 0;
3908 /* Assign cost of 1 to usual operations.
3909 ??? We may consider mapping RTL costs to this. */
3910 case COND_EXPR:
3911 case VEC_COND_EXPR:
3912 case VEC_PERM_EXPR:
3914 case PLUS_EXPR:
3915 case POINTER_PLUS_EXPR:
3916 case MINUS_EXPR:
3917 case MULT_EXPR:
3918 case MULT_HIGHPART_EXPR:
3919 case FMA_EXPR:
3921 case ADDR_SPACE_CONVERT_EXPR:
3922 case FIXED_CONVERT_EXPR:
3923 case FIX_TRUNC_EXPR:
3925 case NEGATE_EXPR:
3926 case FLOAT_EXPR:
3927 case MIN_EXPR:
3928 case MAX_EXPR:
3929 case ABS_EXPR:
3931 case LSHIFT_EXPR:
3932 case RSHIFT_EXPR:
3933 case LROTATE_EXPR:
3934 case RROTATE_EXPR:
3936 case BIT_IOR_EXPR:
3937 case BIT_XOR_EXPR:
3938 case BIT_AND_EXPR:
3939 case BIT_NOT_EXPR:
3941 case TRUTH_ANDIF_EXPR:
3942 case TRUTH_ORIF_EXPR:
3943 case TRUTH_AND_EXPR:
3944 case TRUTH_OR_EXPR:
3945 case TRUTH_XOR_EXPR:
3946 case TRUTH_NOT_EXPR:
3948 case LT_EXPR:
3949 case LE_EXPR:
3950 case GT_EXPR:
3951 case GE_EXPR:
3952 case EQ_EXPR:
3953 case NE_EXPR:
3954 case ORDERED_EXPR:
3955 case UNORDERED_EXPR:
3957 case UNLT_EXPR:
3958 case UNLE_EXPR:
3959 case UNGT_EXPR:
3960 case UNGE_EXPR:
3961 case UNEQ_EXPR:
3962 case LTGT_EXPR:
3964 case CONJ_EXPR:
3966 case PREDECREMENT_EXPR:
3967 case PREINCREMENT_EXPR:
3968 case POSTDECREMENT_EXPR:
3969 case POSTINCREMENT_EXPR:
3971 case REALIGN_LOAD_EXPR:
3973 case REDUC_MAX_EXPR:
3974 case REDUC_MIN_EXPR:
3975 case REDUC_PLUS_EXPR:
3976 case WIDEN_SUM_EXPR:
3977 case WIDEN_MULT_EXPR:
3978 case DOT_PROD_EXPR:
3979 case SAD_EXPR:
3980 case WIDEN_MULT_PLUS_EXPR:
3981 case WIDEN_MULT_MINUS_EXPR:
3982 case WIDEN_LSHIFT_EXPR:
3984 case VEC_WIDEN_MULT_HI_EXPR:
3985 case VEC_WIDEN_MULT_LO_EXPR:
3986 case VEC_WIDEN_MULT_EVEN_EXPR:
3987 case VEC_WIDEN_MULT_ODD_EXPR:
3988 case VEC_UNPACK_HI_EXPR:
3989 case VEC_UNPACK_LO_EXPR:
3990 case VEC_UNPACK_FLOAT_HI_EXPR:
3991 case VEC_UNPACK_FLOAT_LO_EXPR:
3992 case VEC_PACK_TRUNC_EXPR:
3993 case VEC_PACK_SAT_EXPR:
3994 case VEC_PACK_FIX_TRUNC_EXPR:
3995 case VEC_WIDEN_LSHIFT_HI_EXPR:
3996 case VEC_WIDEN_LSHIFT_LO_EXPR:
3998 return 1;
4000 /* Few special cases of expensive operations. This is useful
4001 to avoid inlining on functions having too many of these. */
4002 case TRUNC_DIV_EXPR:
4003 case CEIL_DIV_EXPR:
4004 case FLOOR_DIV_EXPR:
4005 case ROUND_DIV_EXPR:
4006 case EXACT_DIV_EXPR:
4007 case TRUNC_MOD_EXPR:
4008 case CEIL_MOD_EXPR:
4009 case FLOOR_MOD_EXPR:
4010 case ROUND_MOD_EXPR:
4011 case RDIV_EXPR:
4012 if (TREE_CODE (op2) != INTEGER_CST)
4013 return weights->div_mod_cost;
4014 return 1;
4016 /* Bit-field insertion needs several shift and mask operations. */
4017 case BIT_INSERT_EXPR:
4018 return 3;
4020 default:
4021 /* We expect a copy assignment with no operator. */
4022 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS);
4023 return 0;
4028 /* Estimate number of instructions that will be created by expanding
4029 the statements in the statement sequence STMTS.
4030 WEIGHTS contains weights attributed to various constructs. */
4033 estimate_num_insns_seq (gimple_seq stmts, eni_weights *weights)
4035 int cost;
4036 gimple_stmt_iterator gsi;
4038 cost = 0;
4039 for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi))
4040 cost += estimate_num_insns (gsi_stmt (gsi), weights);
4042 return cost;
4046 /* Estimate number of instructions that will be created by expanding STMT.
4047 WEIGHTS contains weights attributed to various constructs. */
4050 estimate_num_insns (gimple *stmt, eni_weights *weights)
4052 unsigned cost, i;
4053 enum gimple_code code = gimple_code (stmt);
4054 tree lhs;
4055 tree rhs;
4057 switch (code)
4059 case GIMPLE_ASSIGN:
4060 /* Try to estimate the cost of assignments. We have three cases to
4061 deal with:
4062 1) Simple assignments to registers;
4063 2) Stores to things that must live in memory. This includes
4064 "normal" stores to scalars, but also assignments of large
4065 structures, or constructors of big arrays;
4067 Let us look at the first two cases, assuming we have "a = b + C":
4068 <GIMPLE_ASSIGN <var_decl "a">
4069 <plus_expr <var_decl "b"> <constant C>>
4070 If "a" is a GIMPLE register, the assignment to it is free on almost
4071 any target, because "a" usually ends up in a real register. Hence
4072 the only cost of this expression comes from the PLUS_EXPR, and we
4073 can ignore the GIMPLE_ASSIGN.
4074 If "a" is not a GIMPLE register, the assignment to "a" will most
4075 likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
4076 of moving something into "a", which we compute using the function
4077 estimate_move_cost. */
4078 if (gimple_clobber_p (stmt))
4079 return 0; /* ={v} {CLOBBER} stmt expands to nothing. */
4081 lhs = gimple_assign_lhs (stmt);
4082 rhs = gimple_assign_rhs1 (stmt);
4084 cost = 0;
4086 /* Account for the cost of moving to / from memory. */
4087 if (gimple_store_p (stmt))
4088 cost += estimate_move_cost (TREE_TYPE (lhs), weights->time_based);
4089 if (gimple_assign_load_p (stmt))
4090 cost += estimate_move_cost (TREE_TYPE (rhs), weights->time_based);
4092 cost += estimate_operator_cost (gimple_assign_rhs_code (stmt), weights,
4093 gimple_assign_rhs1 (stmt),
4094 get_gimple_rhs_class (gimple_assign_rhs_code (stmt))
4095 == GIMPLE_BINARY_RHS
4096 ? gimple_assign_rhs2 (stmt) : NULL);
4097 break;
4099 case GIMPLE_COND:
4100 cost = 1 + estimate_operator_cost (gimple_cond_code (stmt), weights,
4101 gimple_op (stmt, 0),
4102 gimple_op (stmt, 1));
4103 break;
4105 case GIMPLE_SWITCH:
4107 gswitch *switch_stmt = as_a <gswitch *> (stmt);
4108 /* Take into account cost of the switch + guess 2 conditional jumps for
4109 each case label.
4111 TODO: once the switch expansion logic is sufficiently separated, we can
4112 do better job on estimating cost of the switch. */
4113 if (weights->time_based)
4114 cost = floor_log2 (gimple_switch_num_labels (switch_stmt)) * 2;
4115 else
4116 cost = gimple_switch_num_labels (switch_stmt) * 2;
4118 break;
4120 case GIMPLE_CALL:
4122 tree decl;
4124 if (gimple_call_internal_p (stmt))
4125 return 0;
4126 else if ((decl = gimple_call_fndecl (stmt))
4127 && DECL_BUILT_IN (decl))
4129 /* Do not special case builtins where we see the body.
4130 This just confuse inliner. */
4131 struct cgraph_node *node;
4132 if (!(node = cgraph_node::get (decl))
4133 || node->definition)
4135 /* For buitins that are likely expanded to nothing or
4136 inlined do not account operand costs. */
4137 else if (is_simple_builtin (decl))
4138 return 0;
4139 else if (is_inexpensive_builtin (decl))
4140 return weights->target_builtin_call_cost;
4141 else if (gimple_call_builtin_p (stmt, BUILT_IN_NORMAL))
4143 /* We canonicalize x * x to pow (x, 2.0) with -ffast-math, so
4144 specialize the cheap expansion we do here.
4145 ??? This asks for a more general solution. */
4146 switch (DECL_FUNCTION_CODE (decl))
4148 case BUILT_IN_POW:
4149 case BUILT_IN_POWF:
4150 case BUILT_IN_POWL:
4151 if (TREE_CODE (gimple_call_arg (stmt, 1)) == REAL_CST
4152 && (real_equal
4153 (&TREE_REAL_CST (gimple_call_arg (stmt, 1)),
4154 &dconst2)))
4155 return estimate_operator_cost
4156 (MULT_EXPR, weights, gimple_call_arg (stmt, 0),
4157 gimple_call_arg (stmt, 0));
4158 break;
4160 default:
4161 break;
4166 cost = decl ? weights->call_cost : weights->indirect_call_cost;
4167 if (gimple_call_lhs (stmt))
4168 cost += estimate_move_cost (TREE_TYPE (gimple_call_lhs (stmt)),
4169 weights->time_based);
4170 for (i = 0; i < gimple_call_num_args (stmt); i++)
4172 tree arg = gimple_call_arg (stmt, i);
4173 cost += estimate_move_cost (TREE_TYPE (arg),
4174 weights->time_based);
4176 break;
4179 case GIMPLE_RETURN:
4180 return weights->return_cost;
4182 case GIMPLE_GOTO:
4183 case GIMPLE_LABEL:
4184 case GIMPLE_NOP:
4185 case GIMPLE_PHI:
4186 case GIMPLE_PREDICT:
4187 case GIMPLE_DEBUG:
4188 return 0;
4190 case GIMPLE_ASM:
4192 int count = asm_str_count (gimple_asm_string (as_a <gasm *> (stmt)));
4193 /* 1000 means infinity. This avoids overflows later
4194 with very long asm statements. */
4195 if (count > 1000)
4196 count = 1000;
4197 return count;
4200 case GIMPLE_RESX:
4201 /* This is either going to be an external function call with one
4202 argument, or two register copy statements plus a goto. */
4203 return 2;
4205 case GIMPLE_EH_DISPATCH:
4206 /* ??? This is going to turn into a switch statement. Ideally
4207 we'd have a look at the eh region and estimate the number of
4208 edges involved. */
4209 return 10;
4211 case GIMPLE_BIND:
4212 return estimate_num_insns_seq (
4213 gimple_bind_body (as_a <gbind *> (stmt)),
4214 weights);
4216 case GIMPLE_EH_FILTER:
4217 return estimate_num_insns_seq (gimple_eh_filter_failure (stmt), weights);
4219 case GIMPLE_CATCH:
4220 return estimate_num_insns_seq (gimple_catch_handler (
4221 as_a <gcatch *> (stmt)),
4222 weights);
4224 case GIMPLE_TRY:
4225 return (estimate_num_insns_seq (gimple_try_eval (stmt), weights)
4226 + estimate_num_insns_seq (gimple_try_cleanup (stmt), weights));
4228 /* OMP directives are generally very expensive. */
4230 case GIMPLE_OMP_RETURN:
4231 case GIMPLE_OMP_SECTIONS_SWITCH:
4232 case GIMPLE_OMP_ATOMIC_STORE:
4233 case GIMPLE_OMP_CONTINUE:
4234 /* ...except these, which are cheap. */
4235 return 0;
4237 case GIMPLE_OMP_ATOMIC_LOAD:
4238 return weights->omp_cost;
4240 case GIMPLE_OMP_FOR:
4241 return (weights->omp_cost
4242 + estimate_num_insns_seq (gimple_omp_body (stmt), weights)
4243 + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt), weights));
4245 case GIMPLE_OMP_PARALLEL:
4246 case GIMPLE_OMP_TASK:
4247 case GIMPLE_OMP_CRITICAL:
4248 case GIMPLE_OMP_MASTER:
4249 case GIMPLE_OMP_TASKGROUP:
4250 case GIMPLE_OMP_ORDERED:
4251 case GIMPLE_OMP_SECTION:
4252 case GIMPLE_OMP_SECTIONS:
4253 case GIMPLE_OMP_SINGLE:
4254 case GIMPLE_OMP_TARGET:
4255 case GIMPLE_OMP_TEAMS:
4256 return (weights->omp_cost
4257 + estimate_num_insns_seq (gimple_omp_body (stmt), weights));
4259 case GIMPLE_TRANSACTION:
4260 return (weights->tm_cost
4261 + estimate_num_insns_seq (gimple_transaction_body (
4262 as_a <gtransaction *> (stmt)),
4263 weights));
4265 default:
4266 gcc_unreachable ();
4269 return cost;
4272 /* Estimate number of instructions that will be created by expanding
4273 function FNDECL. WEIGHTS contains weights attributed to various
4274 constructs. */
4277 estimate_num_insns_fn (tree fndecl, eni_weights *weights)
4279 struct function *my_function = DECL_STRUCT_FUNCTION (fndecl);
4280 gimple_stmt_iterator bsi;
4281 basic_block bb;
4282 int n = 0;
4284 gcc_assert (my_function && my_function->cfg);
4285 FOR_EACH_BB_FN (bb, my_function)
4287 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
4288 n += estimate_num_insns (gsi_stmt (bsi), weights);
4291 return n;
4295 /* Initializes weights used by estimate_num_insns. */
4297 void
4298 init_inline_once (void)
4300 eni_size_weights.call_cost = 1;
4301 eni_size_weights.indirect_call_cost = 3;
4302 eni_size_weights.target_builtin_call_cost = 1;
4303 eni_size_weights.div_mod_cost = 1;
4304 eni_size_weights.omp_cost = 40;
4305 eni_size_weights.tm_cost = 10;
4306 eni_size_weights.time_based = false;
4307 eni_size_weights.return_cost = 1;
4309 /* Estimating time for call is difficult, since we have no idea what the
4310 called function does. In the current uses of eni_time_weights,
4311 underestimating the cost does less harm than overestimating it, so
4312 we choose a rather small value here. */
4313 eni_time_weights.call_cost = 10;
4314 eni_time_weights.indirect_call_cost = 15;
4315 eni_time_weights.target_builtin_call_cost = 1;
4316 eni_time_weights.div_mod_cost = 10;
4317 eni_time_weights.omp_cost = 40;
4318 eni_time_weights.tm_cost = 40;
4319 eni_time_weights.time_based = true;
4320 eni_time_weights.return_cost = 2;
4324 /* Install new lexical TREE_BLOCK underneath 'current_block'. */
4326 static void
4327 prepend_lexical_block (tree current_block, tree new_block)
4329 BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (current_block);
4330 BLOCK_SUBBLOCKS (current_block) = new_block;
4331 BLOCK_SUPERCONTEXT (new_block) = current_block;
4334 /* Add local variables from CALLEE to CALLER. */
4336 static inline void
4337 add_local_variables (struct function *callee, struct function *caller,
4338 copy_body_data *id)
4340 tree var;
4341 unsigned ix;
4343 FOR_EACH_LOCAL_DECL (callee, ix, var)
4344 if (!can_be_nonlocal (var, id))
4346 tree new_var = remap_decl (var, id);
4348 /* Remap debug-expressions. */
4349 if (VAR_P (new_var)
4350 && DECL_HAS_DEBUG_EXPR_P (var)
4351 && new_var != var)
4353 tree tem = DECL_DEBUG_EXPR (var);
4354 bool old_regimplify = id->regimplify;
4355 id->remapping_type_depth++;
4356 walk_tree (&tem, copy_tree_body_r, id, NULL);
4357 id->remapping_type_depth--;
4358 id->regimplify = old_regimplify;
4359 SET_DECL_DEBUG_EXPR (new_var, tem);
4360 DECL_HAS_DEBUG_EXPR_P (new_var) = 1;
4362 add_local_decl (caller, new_var);
4366 /* Add to BINDINGS a debug stmt resetting SRCVAR if inlining might
4367 have brought in or introduced any debug stmts for SRCVAR. */
4369 static inline void
4370 reset_debug_binding (copy_body_data *id, tree srcvar, gimple_seq *bindings)
4372 tree *remappedvarp = id->decl_map->get (srcvar);
4374 if (!remappedvarp)
4375 return;
4377 if (!VAR_P (*remappedvarp))
4378 return;
4380 if (*remappedvarp == id->retvar || *remappedvarp == id->retbnd)
4381 return;
4383 tree tvar = target_for_debug_bind (*remappedvarp);
4384 if (!tvar)
4385 return;
4387 gdebug *stmt = gimple_build_debug_bind (tvar, NULL_TREE,
4388 id->call_stmt);
4389 gimple_seq_add_stmt (bindings, stmt);
4392 /* For each inlined variable for which we may have debug bind stmts,
4393 add before GSI a final debug stmt resetting it, marking the end of
4394 its life, so that var-tracking knows it doesn't have to compute
4395 further locations for it. */
4397 static inline void
4398 reset_debug_bindings (copy_body_data *id, gimple_stmt_iterator gsi)
4400 tree var;
4401 unsigned ix;
4402 gimple_seq bindings = NULL;
4404 if (!gimple_in_ssa_p (id->src_cfun))
4405 return;
4407 if (!opt_for_fn (id->dst_fn, flag_var_tracking_assignments))
4408 return;
4410 for (var = DECL_ARGUMENTS (id->src_fn);
4411 var; var = DECL_CHAIN (var))
4412 reset_debug_binding (id, var, &bindings);
4414 FOR_EACH_LOCAL_DECL (id->src_cfun, ix, var)
4415 reset_debug_binding (id, var, &bindings);
4417 gsi_insert_seq_before_without_update (&gsi, bindings, GSI_SAME_STMT);
4420 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion. */
4422 static bool
4423 expand_call_inline (basic_block bb, gimple *stmt, copy_body_data *id)
4425 tree use_retvar;
4426 tree fn;
4427 hash_map<tree, tree> *dst;
4428 hash_map<tree, tree> *st = NULL;
4429 tree return_slot;
4430 tree modify_dest;
4431 tree return_bounds = NULL;
4432 struct cgraph_edge *cg_edge;
4433 cgraph_inline_failed_t reason;
4434 basic_block return_block;
4435 edge e;
4436 gimple_stmt_iterator gsi, stmt_gsi;
4437 bool successfully_inlined = false;
4438 bool purge_dead_abnormal_edges;
4439 gcall *call_stmt;
4440 unsigned int i;
4441 unsigned int prop_mask, src_properties;
4442 struct function *dst_cfun;
4443 tree simduid;
4444 use_operand_p use;
4445 gimple *simtenter_stmt = NULL;
4446 vec<tree> *simtvars_save;
4448 /* The gimplifier uses input_location in too many places, such as
4449 internal_get_tmp_var (). */
4450 location_t saved_location = input_location;
4451 input_location = gimple_location (stmt);
4453 /* From here on, we're only interested in CALL_EXPRs. */
4454 call_stmt = dyn_cast <gcall *> (stmt);
4455 if (!call_stmt)
4456 goto egress;
4458 cg_edge = id->dst_node->get_edge (stmt);
4459 gcc_checking_assert (cg_edge);
4460 /* First, see if we can figure out what function is being called.
4461 If we cannot, then there is no hope of inlining the function. */
4462 if (cg_edge->indirect_unknown_callee)
4463 goto egress;
4464 fn = cg_edge->callee->decl;
4465 gcc_checking_assert (fn);
4467 /* If FN is a declaration of a function in a nested scope that was
4468 globally declared inline, we don't set its DECL_INITIAL.
4469 However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
4470 C++ front-end uses it for cdtors to refer to their internal
4471 declarations, that are not real functions. Fortunately those
4472 don't have trees to be saved, so we can tell by checking their
4473 gimple_body. */
4474 if (!DECL_INITIAL (fn)
4475 && DECL_ABSTRACT_ORIGIN (fn)
4476 && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn)))
4477 fn = DECL_ABSTRACT_ORIGIN (fn);
4479 /* Don't try to inline functions that are not well-suited to inlining. */
4480 if (cg_edge->inline_failed)
4482 reason = cg_edge->inline_failed;
4483 /* If this call was originally indirect, we do not want to emit any
4484 inlining related warnings or sorry messages because there are no
4485 guarantees regarding those. */
4486 if (cg_edge->indirect_inlining_edge)
4487 goto egress;
4489 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
4490 /* For extern inline functions that get redefined we always
4491 silently ignored always_inline flag. Better behavior would
4492 be to be able to keep both bodies and use extern inline body
4493 for inlining, but we can't do that because frontends overwrite
4494 the body. */
4495 && !cg_edge->callee->local.redefined_extern_inline
4496 /* During early inline pass, report only when optimization is
4497 not turned on. */
4498 && (symtab->global_info_ready
4499 || !optimize
4500 || cgraph_inline_failed_type (reason) == CIF_FINAL_ERROR)
4501 /* PR 20090218-1_0.c. Body can be provided by another module. */
4502 && (reason != CIF_BODY_NOT_AVAILABLE || !flag_generate_lto))
4504 error ("inlining failed in call to always_inline %q+F: %s", fn,
4505 cgraph_inline_failed_string (reason));
4506 if (gimple_location (stmt) != UNKNOWN_LOCATION)
4507 inform (gimple_location (stmt), "called from here");
4508 else if (DECL_SOURCE_LOCATION (cfun->decl) != UNKNOWN_LOCATION)
4509 inform (DECL_SOURCE_LOCATION (cfun->decl),
4510 "called from this function");
4512 else if (warn_inline
4513 && DECL_DECLARED_INLINE_P (fn)
4514 && !DECL_NO_INLINE_WARNING_P (fn)
4515 && !DECL_IN_SYSTEM_HEADER (fn)
4516 && reason != CIF_UNSPECIFIED
4517 && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
4518 /* Do not warn about not inlined recursive calls. */
4519 && !cg_edge->recursive_p ()
4520 /* Avoid warnings during early inline pass. */
4521 && symtab->global_info_ready)
4523 if (warning (OPT_Winline, "inlining failed in call to %q+F: %s",
4524 fn, _(cgraph_inline_failed_string (reason))))
4526 if (gimple_location (stmt) != UNKNOWN_LOCATION)
4527 inform (gimple_location (stmt), "called from here");
4528 else if (DECL_SOURCE_LOCATION (cfun->decl) != UNKNOWN_LOCATION)
4529 inform (DECL_SOURCE_LOCATION (cfun->decl),
4530 "called from this function");
4533 goto egress;
4535 id->src_node = cg_edge->callee;
4537 /* If callee is thunk, all we need is to adjust the THIS pointer
4538 and redirect to function being thunked. */
4539 if (id->src_node->thunk.thunk_p)
4541 cgraph_edge *edge;
4542 tree virtual_offset = NULL;
4543 int freq = cg_edge->frequency;
4544 profile_count count = cg_edge->count;
4545 tree op;
4546 gimple_stmt_iterator iter = gsi_for_stmt (stmt);
4548 cg_edge->remove ();
4549 edge = id->src_node->callees->clone (id->dst_node, call_stmt,
4550 gimple_uid (stmt),
4551 profile_count::one (),
4552 profile_count::one (),
4553 CGRAPH_FREQ_BASE,
4554 true);
4555 edge->frequency = freq;
4556 edge->count = count;
4557 if (id->src_node->thunk.virtual_offset_p)
4558 virtual_offset = size_int (id->src_node->thunk.virtual_value);
4559 op = create_tmp_reg_fn (cfun, TREE_TYPE (gimple_call_arg (stmt, 0)),
4560 NULL);
4561 gsi_insert_before (&iter, gimple_build_assign (op,
4562 gimple_call_arg (stmt, 0)),
4563 GSI_NEW_STMT);
4564 gcc_assert (id->src_node->thunk.this_adjusting);
4565 op = thunk_adjust (&iter, op, 1, id->src_node->thunk.fixed_offset,
4566 virtual_offset);
4568 gimple_call_set_arg (stmt, 0, op);
4569 gimple_call_set_fndecl (stmt, edge->callee->decl);
4570 update_stmt (stmt);
4571 id->src_node->remove ();
4572 expand_call_inline (bb, stmt, id);
4573 maybe_remove_unused_call_args (cfun, stmt);
4574 return true;
4576 fn = cg_edge->callee->decl;
4577 cg_edge->callee->get_untransformed_body ();
4579 if (flag_checking && cg_edge->callee->decl != id->dst_node->decl)
4580 cg_edge->callee->verify ();
4582 /* We will be inlining this callee. */
4583 id->eh_lp_nr = lookup_stmt_eh_lp (stmt);
4584 id->assign_stmts.create (0);
4586 /* Update the callers EH personality. */
4587 if (DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl))
4588 DECL_FUNCTION_PERSONALITY (cg_edge->caller->decl)
4589 = DECL_FUNCTION_PERSONALITY (cg_edge->callee->decl);
4591 /* Split the block before the GIMPLE_CALL. */
4592 stmt_gsi = gsi_for_stmt (stmt);
4593 gsi_prev (&stmt_gsi);
4594 e = split_block (bb, gsi_end_p (stmt_gsi) ? NULL : gsi_stmt (stmt_gsi));
4595 bb = e->src;
4596 return_block = e->dest;
4597 remove_edge (e);
4599 /* If the GIMPLE_CALL was in the last statement of BB, it may have
4600 been the source of abnormal edges. In this case, schedule
4601 the removal of dead abnormal edges. */
4602 gsi = gsi_start_bb (return_block);
4603 gsi_next (&gsi);
4604 purge_dead_abnormal_edges = gsi_end_p (gsi);
4606 stmt_gsi = gsi_start_bb (return_block);
4608 /* Build a block containing code to initialize the arguments, the
4609 actual inline expansion of the body, and a label for the return
4610 statements within the function to jump to. The type of the
4611 statement expression is the return type of the function call.
4612 ??? If the call does not have an associated block then we will
4613 remap all callee blocks to NULL, effectively dropping most of
4614 its debug information. This should only happen for calls to
4615 artificial decls inserted by the compiler itself. We need to
4616 either link the inlined blocks into the caller block tree or
4617 not refer to them in any way to not break GC for locations. */
4618 if (gimple_block (stmt))
4620 id->block = make_node (BLOCK);
4621 BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
4622 BLOCK_SOURCE_LOCATION (id->block)
4623 = LOCATION_LOCUS (gimple_location (stmt));
4624 prepend_lexical_block (gimple_block (stmt), id->block);
4627 /* Local declarations will be replaced by their equivalents in this
4628 map. */
4629 st = id->decl_map;
4630 id->decl_map = new hash_map<tree, tree>;
4631 dst = id->debug_map;
4632 id->debug_map = NULL;
4634 /* Record the function we are about to inline. */
4635 id->src_fn = fn;
4636 id->src_cfun = DECL_STRUCT_FUNCTION (fn);
4637 id->call_stmt = call_stmt;
4639 /* When inlining into an OpenMP SIMD-on-SIMT loop, arrange for new automatic
4640 variables to be added to IFN_GOMP_SIMT_ENTER argument list. */
4641 dst_cfun = DECL_STRUCT_FUNCTION (id->dst_fn);
4642 simtvars_save = id->dst_simt_vars;
4643 if (!(dst_cfun->curr_properties & PROP_gimple_lomp_dev)
4644 && (simduid = bb->loop_father->simduid) != NULL_TREE
4645 && (simduid = ssa_default_def (dst_cfun, simduid)) != NULL_TREE
4646 && single_imm_use (simduid, &use, &simtenter_stmt)
4647 && is_gimple_call (simtenter_stmt)
4648 && gimple_call_internal_p (simtenter_stmt, IFN_GOMP_SIMT_ENTER))
4649 vec_alloc (id->dst_simt_vars, 0);
4650 else
4651 id->dst_simt_vars = NULL;
4653 if (profile_status_for_fn (id->src_cfun) == PROFILE_ABSENT)
4654 profile_status_for_fn (dst_cfun) = PROFILE_ABSENT;
4656 /* If the src function contains an IFN_VA_ARG, then so will the dst
4657 function after inlining. Likewise for IFN_GOMP_USE_SIMT. */
4658 prop_mask = PROP_gimple_lva | PROP_gimple_lomp_dev;
4659 src_properties = id->src_cfun->curr_properties & prop_mask;
4660 if (src_properties != prop_mask)
4661 dst_cfun->curr_properties &= src_properties | ~prop_mask;
4663 gcc_assert (!id->src_cfun->after_inlining);
4665 id->entry_bb = bb;
4666 if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn)))
4668 gimple_stmt_iterator si = gsi_last_bb (bb);
4669 gsi_insert_after (&si, gimple_build_predict (PRED_COLD_FUNCTION,
4670 NOT_TAKEN),
4671 GSI_NEW_STMT);
4673 initialize_inlined_parameters (id, stmt, fn, bb);
4675 if (DECL_INITIAL (fn))
4677 if (gimple_block (stmt))
4679 tree *var;
4681 prepend_lexical_block (id->block,
4682 remap_blocks (DECL_INITIAL (fn), id));
4683 gcc_checking_assert (BLOCK_SUBBLOCKS (id->block)
4684 && (BLOCK_CHAIN (BLOCK_SUBBLOCKS (id->block))
4685 == NULL_TREE));
4686 /* Move vars for PARM_DECLs from DECL_INITIAL block to id->block,
4687 otherwise for DWARF DW_TAG_formal_parameter will not be children of
4688 DW_TAG_inlined_subroutine, but of a DW_TAG_lexical_block
4689 under it. The parameters can be then evaluated in the debugger,
4690 but don't show in backtraces. */
4691 for (var = &BLOCK_VARS (BLOCK_SUBBLOCKS (id->block)); *var; )
4692 if (TREE_CODE (DECL_ORIGIN (*var)) == PARM_DECL)
4694 tree v = *var;
4695 *var = TREE_CHAIN (v);
4696 TREE_CHAIN (v) = BLOCK_VARS (id->block);
4697 BLOCK_VARS (id->block) = v;
4699 else
4700 var = &TREE_CHAIN (*var);
4702 else
4703 remap_blocks_to_null (DECL_INITIAL (fn), id);
4706 /* Return statements in the function body will be replaced by jumps
4707 to the RET_LABEL. */
4708 gcc_assert (DECL_INITIAL (fn));
4709 gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
4711 /* Find the LHS to which the result of this call is assigned. */
4712 return_slot = NULL;
4713 if (gimple_call_lhs (stmt))
4715 modify_dest = gimple_call_lhs (stmt);
4717 /* Remember where to copy returned bounds. */
4718 if (gimple_call_with_bounds_p (stmt)
4719 && TREE_CODE (modify_dest) == SSA_NAME)
4721 gcall *retbnd = chkp_retbnd_call_by_val (modify_dest);
4722 if (retbnd)
4724 return_bounds = gimple_call_lhs (retbnd);
4725 /* If returned bounds are not used then just
4726 remove unused call. */
4727 if (!return_bounds)
4729 gimple_stmt_iterator iter = gsi_for_stmt (retbnd);
4730 gsi_remove (&iter, true);
4735 /* The function which we are inlining might not return a value,
4736 in which case we should issue a warning that the function
4737 does not return a value. In that case the optimizers will
4738 see that the variable to which the value is assigned was not
4739 initialized. We do not want to issue a warning about that
4740 uninitialized variable. */
4741 if (DECL_P (modify_dest))
4742 TREE_NO_WARNING (modify_dest) = 1;
4744 if (gimple_call_return_slot_opt_p (call_stmt))
4746 return_slot = modify_dest;
4747 modify_dest = NULL;
4750 else
4751 modify_dest = NULL;
4753 /* If we are inlining a call to the C++ operator new, we don't want
4754 to use type based alias analysis on the return value. Otherwise
4755 we may get confused if the compiler sees that the inlined new
4756 function returns a pointer which was just deleted. See bug
4757 33407. */
4758 if (DECL_IS_OPERATOR_NEW (fn))
4760 return_slot = NULL;
4761 modify_dest = NULL;
4764 /* Declare the return variable for the function. */
4765 use_retvar = declare_return_variable (id, return_slot, modify_dest,
4766 return_bounds, bb);
4768 /* Add local vars in this inlined callee to caller. */
4769 add_local_variables (id->src_cfun, cfun, id);
4771 if (dump_file && (dump_flags & TDF_DETAILS))
4773 fprintf (dump_file, "Inlining ");
4774 print_generic_expr (dump_file, id->src_fn);
4775 fprintf (dump_file, " to ");
4776 print_generic_expr (dump_file, id->dst_fn);
4777 fprintf (dump_file, " with frequency %i\n", cg_edge->frequency);
4780 /* This is it. Duplicate the callee body. Assume callee is
4781 pre-gimplified. Note that we must not alter the caller
4782 function in any way before this point, as this CALL_EXPR may be
4783 a self-referential call; if we're calling ourselves, we need to
4784 duplicate our body before altering anything. */
4785 copy_body (id, cg_edge->callee->count,
4786 GCOV_COMPUTE_SCALE (cg_edge->frequency, CGRAPH_FREQ_BASE),
4787 bb, return_block, NULL);
4789 reset_debug_bindings (id, stmt_gsi);
4791 /* Reset the escaped solution. */
4792 if (cfun->gimple_df)
4793 pt_solution_reset (&cfun->gimple_df->escaped);
4795 /* Add new automatic variables to IFN_GOMP_SIMT_ENTER arguments. */
4796 if (id->dst_simt_vars && id->dst_simt_vars->length () > 0)
4798 size_t nargs = gimple_call_num_args (simtenter_stmt);
4799 vec<tree> *vars = id->dst_simt_vars;
4800 auto_vec<tree> newargs (nargs + vars->length ());
4801 for (size_t i = 0; i < nargs; i++)
4802 newargs.quick_push (gimple_call_arg (simtenter_stmt, i));
4803 for (tree *pvar = vars->begin (); pvar != vars->end (); pvar++)
4805 tree ptrtype = build_pointer_type (TREE_TYPE (*pvar));
4806 newargs.quick_push (build1 (ADDR_EXPR, ptrtype, *pvar));
4808 gcall *g = gimple_build_call_internal_vec (IFN_GOMP_SIMT_ENTER, newargs);
4809 gimple_call_set_lhs (g, gimple_call_lhs (simtenter_stmt));
4810 gimple_stmt_iterator gsi = gsi_for_stmt (simtenter_stmt);
4811 gsi_replace (&gsi, g, false);
4813 vec_free (id->dst_simt_vars);
4814 id->dst_simt_vars = simtvars_save;
4816 /* Clean up. */
4817 if (id->debug_map)
4819 delete id->debug_map;
4820 id->debug_map = dst;
4822 delete id->decl_map;
4823 id->decl_map = st;
4825 /* Unlink the calls virtual operands before replacing it. */
4826 unlink_stmt_vdef (stmt);
4827 if (gimple_vdef (stmt)
4828 && TREE_CODE (gimple_vdef (stmt)) == SSA_NAME)
4829 release_ssa_name (gimple_vdef (stmt));
4831 /* If the inlined function returns a result that we care about,
4832 substitute the GIMPLE_CALL with an assignment of the return
4833 variable to the LHS of the call. That is, if STMT was
4834 'a = foo (...)', substitute the call with 'a = USE_RETVAR'. */
4835 if (use_retvar && gimple_call_lhs (stmt))
4837 gimple *old_stmt = stmt;
4838 stmt = gimple_build_assign (gimple_call_lhs (stmt), use_retvar);
4839 gsi_replace (&stmt_gsi, stmt, false);
4840 maybe_clean_or_replace_eh_stmt (old_stmt, stmt);
4842 /* Copy bounds if we copy structure with bounds. */
4843 if (chkp_function_instrumented_p (id->dst_fn)
4844 && !BOUNDED_P (use_retvar)
4845 && chkp_type_has_pointer (TREE_TYPE (use_retvar)))
4846 id->assign_stmts.safe_push (stmt);
4848 else
4850 /* Handle the case of inlining a function with no return
4851 statement, which causes the return value to become undefined. */
4852 if (gimple_call_lhs (stmt)
4853 && TREE_CODE (gimple_call_lhs (stmt)) == SSA_NAME)
4855 tree name = gimple_call_lhs (stmt);
4856 tree var = SSA_NAME_VAR (name);
4857 tree def = var ? ssa_default_def (cfun, var) : NULL;
4859 if (def)
4861 /* If the variable is used undefined, make this name
4862 undefined via a move. */
4863 stmt = gimple_build_assign (gimple_call_lhs (stmt), def);
4864 gsi_replace (&stmt_gsi, stmt, true);
4866 else
4868 if (!var)
4870 var = create_tmp_reg_fn (cfun, TREE_TYPE (name), NULL);
4871 SET_SSA_NAME_VAR_OR_IDENTIFIER (name, var);
4873 /* Otherwise make this variable undefined. */
4874 gsi_remove (&stmt_gsi, true);
4875 set_ssa_default_def (cfun, var, name);
4876 SSA_NAME_DEF_STMT (name) = gimple_build_nop ();
4879 else
4880 gsi_remove (&stmt_gsi, true);
4883 /* Put returned bounds into the correct place if required. */
4884 if (return_bounds)
4886 gimple *old_stmt = SSA_NAME_DEF_STMT (return_bounds);
4887 gimple *new_stmt = gimple_build_assign (return_bounds, id->retbnd);
4888 gimple_stmt_iterator bnd_gsi = gsi_for_stmt (old_stmt);
4889 unlink_stmt_vdef (old_stmt);
4890 gsi_replace (&bnd_gsi, new_stmt, false);
4891 maybe_clean_or_replace_eh_stmt (old_stmt, new_stmt);
4892 cgraph_update_edges_for_call_stmt (old_stmt,
4893 gimple_call_fndecl (old_stmt),
4894 new_stmt);
4897 if (purge_dead_abnormal_edges)
4899 gimple_purge_dead_eh_edges (return_block);
4900 gimple_purge_dead_abnormal_call_edges (return_block);
4903 /* If the value of the new expression is ignored, that's OK. We
4904 don't warn about this for CALL_EXPRs, so we shouldn't warn about
4905 the equivalent inlined version either. */
4906 if (is_gimple_assign (stmt))
4908 gcc_assert (gimple_assign_single_p (stmt)
4909 || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt)));
4910 TREE_USED (gimple_assign_rhs1 (stmt)) = 1;
4913 /* Copy bounds for all generated assigns that need it. */
4914 for (i = 0; i < id->assign_stmts.length (); i++)
4915 chkp_copy_bounds_for_assign (id->assign_stmts[i], cg_edge);
4916 id->assign_stmts.release ();
4918 /* Output the inlining info for this abstract function, since it has been
4919 inlined. If we don't do this now, we can lose the information about the
4920 variables in the function when the blocks get blown away as soon as we
4921 remove the cgraph node. */
4922 if (gimple_block (stmt))
4923 (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
4925 /* Update callgraph if needed. */
4926 cg_edge->callee->remove ();
4928 id->block = NULL_TREE;
4929 successfully_inlined = true;
4931 egress:
4932 input_location = saved_location;
4933 return successfully_inlined;
4936 /* Expand call statements reachable from STMT_P.
4937 We can only have CALL_EXPRs as the "toplevel" tree code or nested
4938 in a MODIFY_EXPR. */
4940 static bool
4941 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
4943 gimple_stmt_iterator gsi;
4944 bool inlined = false;
4946 for (gsi = gsi_last_bb (bb); !gsi_end_p (gsi);)
4948 gimple *stmt = gsi_stmt (gsi);
4949 gsi_prev (&gsi);
4951 if (is_gimple_call (stmt)
4952 && !gimple_call_internal_p (stmt))
4953 inlined |= expand_call_inline (bb, stmt, id);
4956 return inlined;
4960 /* Walk all basic blocks created after FIRST and try to fold every statement
4961 in the STATEMENTS pointer set. */
4963 static void
4964 fold_marked_statements (int first, hash_set<gimple *> *statements)
4966 for (; first < n_basic_blocks_for_fn (cfun); first++)
4967 if (BASIC_BLOCK_FOR_FN (cfun, first))
4969 gimple_stmt_iterator gsi;
4971 for (gsi = gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun, first));
4972 !gsi_end_p (gsi);
4973 gsi_next (&gsi))
4974 if (statements->contains (gsi_stmt (gsi)))
4976 gimple *old_stmt = gsi_stmt (gsi);
4977 tree old_decl = is_gimple_call (old_stmt) ? gimple_call_fndecl (old_stmt) : 0;
4979 if (old_decl && DECL_BUILT_IN (old_decl))
4981 /* Folding builtins can create multiple instructions,
4982 we need to look at all of them. */
4983 gimple_stmt_iterator i2 = gsi;
4984 gsi_prev (&i2);
4985 if (fold_stmt (&gsi))
4987 gimple *new_stmt;
4988 /* If a builtin at the end of a bb folded into nothing,
4989 the following loop won't work. */
4990 if (gsi_end_p (gsi))
4992 cgraph_update_edges_for_call_stmt (old_stmt,
4993 old_decl, NULL);
4994 break;
4996 if (gsi_end_p (i2))
4997 i2 = gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun, first));
4998 else
4999 gsi_next (&i2);
5000 while (1)
5002 new_stmt = gsi_stmt (i2);
5003 update_stmt (new_stmt);
5004 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
5005 new_stmt);
5007 if (new_stmt == gsi_stmt (gsi))
5009 /* It is okay to check only for the very last
5010 of these statements. If it is a throwing
5011 statement nothing will change. If it isn't
5012 this can remove EH edges. If that weren't
5013 correct then because some intermediate stmts
5014 throw, but not the last one. That would mean
5015 we'd have to split the block, which we can't
5016 here and we'd loose anyway. And as builtins
5017 probably never throw, this all
5018 is mood anyway. */
5019 if (maybe_clean_or_replace_eh_stmt (old_stmt,
5020 new_stmt))
5021 gimple_purge_dead_eh_edges (
5022 BASIC_BLOCK_FOR_FN (cfun, first));
5023 break;
5025 gsi_next (&i2);
5029 else if (fold_stmt (&gsi))
5031 /* Re-read the statement from GSI as fold_stmt() may
5032 have changed it. */
5033 gimple *new_stmt = gsi_stmt (gsi);
5034 update_stmt (new_stmt);
5036 if (is_gimple_call (old_stmt)
5037 || is_gimple_call (new_stmt))
5038 cgraph_update_edges_for_call_stmt (old_stmt, old_decl,
5039 new_stmt);
5041 if (maybe_clean_or_replace_eh_stmt (old_stmt, new_stmt))
5042 gimple_purge_dead_eh_edges (BASIC_BLOCK_FOR_FN (cfun,
5043 first));
5049 /* Expand calls to inline functions in the body of FN. */
5051 unsigned int
5052 optimize_inline_calls (tree fn)
5054 copy_body_data id;
5055 basic_block bb;
5056 int last = n_basic_blocks_for_fn (cfun);
5057 bool inlined_p = false;
5059 /* Clear out ID. */
5060 memset (&id, 0, sizeof (id));
5062 id.src_node = id.dst_node = cgraph_node::get (fn);
5063 gcc_assert (id.dst_node->definition);
5064 id.dst_fn = fn;
5065 /* Or any functions that aren't finished yet. */
5066 if (current_function_decl)
5067 id.dst_fn = current_function_decl;
5069 id.copy_decl = copy_decl_maybe_to_var;
5070 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
5071 id.transform_new_cfg = false;
5072 id.transform_return_to_modify = true;
5073 id.transform_parameter = true;
5074 id.transform_lang_insert_block = NULL;
5075 id.statements_to_fold = new hash_set<gimple *>;
5077 push_gimplify_context ();
5079 /* We make no attempts to keep dominance info up-to-date. */
5080 free_dominance_info (CDI_DOMINATORS);
5081 free_dominance_info (CDI_POST_DOMINATORS);
5083 /* Register specific gimple functions. */
5084 gimple_register_cfg_hooks ();
5086 /* Reach the trees by walking over the CFG, and note the
5087 enclosing basic-blocks in the call edges. */
5088 /* We walk the blocks going forward, because inlined function bodies
5089 will split id->current_basic_block, and the new blocks will
5090 follow it; we'll trudge through them, processing their CALL_EXPRs
5091 along the way. */
5092 FOR_EACH_BB_FN (bb, cfun)
5093 inlined_p |= gimple_expand_calls_inline (bb, &id);
5095 pop_gimplify_context (NULL);
5097 if (flag_checking)
5099 struct cgraph_edge *e;
5101 id.dst_node->verify ();
5103 /* Double check that we inlined everything we are supposed to inline. */
5104 for (e = id.dst_node->callees; e; e = e->next_callee)
5105 gcc_assert (e->inline_failed);
5108 /* Fold queued statements. */
5109 fold_marked_statements (last, id.statements_to_fold);
5110 delete id.statements_to_fold;
5112 gcc_assert (!id.debug_stmts.exists ());
5114 /* If we didn't inline into the function there is nothing to do. */
5115 if (!inlined_p)
5116 return 0;
5118 /* Renumber the lexical scoping (non-code) blocks consecutively. */
5119 number_blocks (fn);
5121 delete_unreachable_blocks_update_callgraph (&id);
5122 if (flag_checking)
5123 id.dst_node->verify ();
5125 /* It would be nice to check SSA/CFG/statement consistency here, but it is
5126 not possible yet - the IPA passes might make various functions to not
5127 throw and they don't care to proactively update local EH info. This is
5128 done later in fixup_cfg pass that also execute the verification. */
5129 return (TODO_update_ssa
5130 | TODO_cleanup_cfg
5131 | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
5132 | (gimple_in_ssa_p (cfun) ? TODO_update_address_taken : 0)
5133 | (profile_status_for_fn (cfun) != PROFILE_ABSENT
5134 ? TODO_rebuild_frequencies : 0));
5137 /* Passed to walk_tree. Copies the node pointed to, if appropriate. */
5139 tree
5140 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
5142 enum tree_code code = TREE_CODE (*tp);
5143 enum tree_code_class cl = TREE_CODE_CLASS (code);
5145 /* We make copies of most nodes. */
5146 if (IS_EXPR_CODE_CLASS (cl)
5147 || code == TREE_LIST
5148 || code == TREE_VEC
5149 || code == TYPE_DECL
5150 || code == OMP_CLAUSE)
5152 /* Because the chain gets clobbered when we make a copy, we save it
5153 here. */
5154 tree chain = NULL_TREE, new_tree;
5156 if (CODE_CONTAINS_STRUCT (code, TS_COMMON))
5157 chain = TREE_CHAIN (*tp);
5159 /* Copy the node. */
5160 new_tree = copy_node (*tp);
5162 *tp = new_tree;
5164 /* Now, restore the chain, if appropriate. That will cause
5165 walk_tree to walk into the chain as well. */
5166 if (code == PARM_DECL
5167 || code == TREE_LIST
5168 || code == OMP_CLAUSE)
5169 TREE_CHAIN (*tp) = chain;
5171 /* For now, we don't update BLOCKs when we make copies. So, we
5172 have to nullify all BIND_EXPRs. */
5173 if (TREE_CODE (*tp) == BIND_EXPR)
5174 BIND_EXPR_BLOCK (*tp) = NULL_TREE;
5176 else if (code == CONSTRUCTOR)
5178 /* CONSTRUCTOR nodes need special handling because
5179 we need to duplicate the vector of elements. */
5180 tree new_tree;
5182 new_tree = copy_node (*tp);
5183 CONSTRUCTOR_ELTS (new_tree) = vec_safe_copy (CONSTRUCTOR_ELTS (*tp));
5184 *tp = new_tree;
5186 else if (code == STATEMENT_LIST)
5187 /* We used to just abort on STATEMENT_LIST, but we can run into them
5188 with statement-expressions (c++/40975). */
5189 copy_statement_list (tp);
5190 else if (TREE_CODE_CLASS (code) == tcc_type)
5191 *walk_subtrees = 0;
5192 else if (TREE_CODE_CLASS (code) == tcc_declaration)
5193 *walk_subtrees = 0;
5194 else if (TREE_CODE_CLASS (code) == tcc_constant)
5195 *walk_subtrees = 0;
5196 return NULL_TREE;
5199 /* The SAVE_EXPR pointed to by TP is being copied. If ST contains
5200 information indicating to what new SAVE_EXPR this one should be mapped,
5201 use that one. Otherwise, create a new node and enter it in ST. FN is
5202 the function into which the copy will be placed. */
5204 static void
5205 remap_save_expr (tree *tp, hash_map<tree, tree> *st, int *walk_subtrees)
5207 tree *n;
5208 tree t;
5210 /* See if we already encountered this SAVE_EXPR. */
5211 n = st->get (*tp);
5213 /* If we didn't already remap this SAVE_EXPR, do so now. */
5214 if (!n)
5216 t = copy_node (*tp);
5218 /* Remember this SAVE_EXPR. */
5219 st->put (*tp, t);
5220 /* Make sure we don't remap an already-remapped SAVE_EXPR. */
5221 st->put (t, t);
5223 else
5225 /* We've already walked into this SAVE_EXPR; don't do it again. */
5226 *walk_subtrees = 0;
5227 t = *n;
5230 /* Replace this SAVE_EXPR with the copy. */
5231 *tp = t;
5234 /* Called via walk_gimple_seq. If *GSIP points to a GIMPLE_LABEL for a local
5235 label, copies the declaration and enters it in the splay_tree in DATA (which
5236 is really a 'copy_body_data *'. */
5238 static tree
5239 mark_local_labels_stmt (gimple_stmt_iterator *gsip,
5240 bool *handled_ops_p ATTRIBUTE_UNUSED,
5241 struct walk_stmt_info *wi)
5243 copy_body_data *id = (copy_body_data *) wi->info;
5244 glabel *stmt = dyn_cast <glabel *> (gsi_stmt (*gsip));
5246 if (stmt)
5248 tree decl = gimple_label_label (stmt);
5250 /* Copy the decl and remember the copy. */
5251 insert_decl_map (id, decl, id->copy_decl (decl, id));
5254 return NULL_TREE;
5257 static gimple_seq duplicate_remap_omp_clause_seq (gimple_seq seq,
5258 struct walk_stmt_info *wi);
5260 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5261 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5262 remaps all local declarations to appropriate replacements in gimple
5263 operands. */
5265 static tree
5266 replace_locals_op (tree *tp, int *walk_subtrees, void *data)
5268 struct walk_stmt_info *wi = (struct walk_stmt_info*) data;
5269 copy_body_data *id = (copy_body_data *) wi->info;
5270 hash_map<tree, tree> *st = id->decl_map;
5271 tree *n;
5272 tree expr = *tp;
5274 /* For recursive invocations this is no longer the LHS itself. */
5275 bool is_lhs = wi->is_lhs;
5276 wi->is_lhs = false;
5278 if (TREE_CODE (expr) == SSA_NAME)
5280 *tp = remap_ssa_name (*tp, id);
5281 *walk_subtrees = 0;
5282 if (is_lhs)
5283 SSA_NAME_DEF_STMT (*tp) = gsi_stmt (wi->gsi);
5285 /* Only a local declaration (variable or label). */
5286 else if ((VAR_P (expr) && !TREE_STATIC (expr))
5287 || TREE_CODE (expr) == LABEL_DECL)
5289 /* Lookup the declaration. */
5290 n = st->get (expr);
5292 /* If it's there, remap it. */
5293 if (n)
5294 *tp = *n;
5295 *walk_subtrees = 0;
5297 else if (TREE_CODE (expr) == STATEMENT_LIST
5298 || TREE_CODE (expr) == BIND_EXPR
5299 || TREE_CODE (expr) == SAVE_EXPR)
5300 gcc_unreachable ();
5301 else if (TREE_CODE (expr) == TARGET_EXPR)
5303 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
5304 It's OK for this to happen if it was part of a subtree that
5305 isn't immediately expanded, such as operand 2 of another
5306 TARGET_EXPR. */
5307 if (!TREE_OPERAND (expr, 1))
5309 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
5310 TREE_OPERAND (expr, 3) = NULL_TREE;
5313 else if (TREE_CODE (expr) == OMP_CLAUSE)
5315 /* Before the omplower pass completes, some OMP clauses can contain
5316 sequences that are neither copied by gimple_seq_copy nor walked by
5317 walk_gimple_seq. To make copy_gimple_seq_and_replace_locals work even
5318 in those situations, we have to copy and process them explicitely. */
5320 if (OMP_CLAUSE_CODE (expr) == OMP_CLAUSE_LASTPRIVATE)
5322 gimple_seq seq = OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr);
5323 seq = duplicate_remap_omp_clause_seq (seq, wi);
5324 OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (expr) = seq;
5326 else if (OMP_CLAUSE_CODE (expr) == OMP_CLAUSE_LINEAR)
5328 gimple_seq seq = OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr);
5329 seq = duplicate_remap_omp_clause_seq (seq, wi);
5330 OMP_CLAUSE_LINEAR_GIMPLE_SEQ (expr) = seq;
5332 else if (OMP_CLAUSE_CODE (expr) == OMP_CLAUSE_REDUCTION)
5334 gimple_seq seq = OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr);
5335 seq = duplicate_remap_omp_clause_seq (seq, wi);
5336 OMP_CLAUSE_REDUCTION_GIMPLE_INIT (expr) = seq;
5337 seq = OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr);
5338 seq = duplicate_remap_omp_clause_seq (seq, wi);
5339 OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (expr) = seq;
5343 /* Keep iterating. */
5344 return NULL_TREE;
5348 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
5349 Using the splay_tree pointed to by ST (which is really a `splay_tree'),
5350 remaps all local declarations to appropriate replacements in gimple
5351 statements. */
5353 static tree
5354 replace_locals_stmt (gimple_stmt_iterator *gsip,
5355 bool *handled_ops_p ATTRIBUTE_UNUSED,
5356 struct walk_stmt_info *wi)
5358 copy_body_data *id = (copy_body_data *) wi->info;
5359 gimple *gs = gsi_stmt (*gsip);
5361 if (gbind *stmt = dyn_cast <gbind *> (gs))
5363 tree block = gimple_bind_block (stmt);
5365 if (block)
5367 remap_block (&block, id);
5368 gimple_bind_set_block (stmt, block);
5371 /* This will remap a lot of the same decls again, but this should be
5372 harmless. */
5373 if (gimple_bind_vars (stmt))
5375 tree old_var, decls = gimple_bind_vars (stmt);
5377 for (old_var = decls; old_var; old_var = DECL_CHAIN (old_var))
5378 if (!can_be_nonlocal (old_var, id)
5379 && ! variably_modified_type_p (TREE_TYPE (old_var), id->src_fn))
5380 remap_decl (old_var, id);
5382 gcc_checking_assert (!id->prevent_decl_creation_for_types);
5383 id->prevent_decl_creation_for_types = true;
5384 gimple_bind_set_vars (stmt, remap_decls (decls, NULL, id));
5385 id->prevent_decl_creation_for_types = false;
5389 /* Keep iterating. */
5390 return NULL_TREE;
5393 /* Create a copy of SEQ and remap all decls in it. */
5395 static gimple_seq
5396 duplicate_remap_omp_clause_seq (gimple_seq seq, struct walk_stmt_info *wi)
5398 if (!seq)
5399 return NULL;
5401 /* If there are any labels in OMP sequences, they can be only referred to in
5402 the sequence itself and therefore we can do both here. */
5403 walk_gimple_seq (seq, mark_local_labels_stmt, NULL, wi);
5404 gimple_seq copy = gimple_seq_copy (seq);
5405 walk_gimple_seq (copy, replace_locals_stmt, replace_locals_op, wi);
5406 return copy;
5409 /* Copies everything in SEQ and replaces variables and labels local to
5410 current_function_decl. */
5412 gimple_seq
5413 copy_gimple_seq_and_replace_locals (gimple_seq seq)
5415 copy_body_data id;
5416 struct walk_stmt_info wi;
5417 gimple_seq copy;
5419 /* There's nothing to do for NULL_TREE. */
5420 if (seq == NULL)
5421 return seq;
5423 /* Set up ID. */
5424 memset (&id, 0, sizeof (id));
5425 id.src_fn = current_function_decl;
5426 id.dst_fn = current_function_decl;
5427 id.src_cfun = cfun;
5428 id.decl_map = new hash_map<tree, tree>;
5429 id.debug_map = NULL;
5431 id.copy_decl = copy_decl_no_change;
5432 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
5433 id.transform_new_cfg = false;
5434 id.transform_return_to_modify = false;
5435 id.transform_parameter = false;
5436 id.transform_lang_insert_block = NULL;
5438 /* Walk the tree once to find local labels. */
5439 memset (&wi, 0, sizeof (wi));
5440 hash_set<tree> visited;
5441 wi.info = &id;
5442 wi.pset = &visited;
5443 walk_gimple_seq (seq, mark_local_labels_stmt, NULL, &wi);
5445 copy = gimple_seq_copy (seq);
5447 /* Walk the copy, remapping decls. */
5448 memset (&wi, 0, sizeof (wi));
5449 wi.info = &id;
5450 walk_gimple_seq (copy, replace_locals_stmt, replace_locals_op, &wi);
5452 /* Clean up. */
5453 delete id.decl_map;
5454 if (id.debug_map)
5455 delete id.debug_map;
5456 if (id.dependence_map)
5458 delete id.dependence_map;
5459 id.dependence_map = NULL;
5462 return copy;
5466 /* Allow someone to determine if SEARCH is a child of TOP from gdb. */
5468 static tree
5469 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
5471 if (*tp == data)
5472 return (tree) data;
5473 else
5474 return NULL;
5477 DEBUG_FUNCTION bool
5478 debug_find_tree (tree top, tree search)
5480 return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
5484 /* Declare the variables created by the inliner. Add all the variables in
5485 VARS to BIND_EXPR. */
5487 static void
5488 declare_inline_vars (tree block, tree vars)
5490 tree t;
5491 for (t = vars; t; t = DECL_CHAIN (t))
5493 DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
5494 gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
5495 add_local_decl (cfun, t);
5498 if (block)
5499 BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
5502 /* Copy NODE (which must be a DECL). The DECL originally was in the FROM_FN,
5503 but now it will be in the TO_FN. PARM_TO_VAR means enable PARM_DECL to
5504 VAR_DECL translation. */
5506 tree
5507 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
5509 /* Don't generate debug information for the copy if we wouldn't have
5510 generated it for the copy either. */
5511 DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
5512 DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
5514 /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
5515 declaration inspired this copy. */
5516 DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
5518 /* The new variable/label has no RTL, yet. */
5519 if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
5520 && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
5521 SET_DECL_RTL (copy, 0);
5523 /* These args would always appear unused, if not for this. */
5524 TREE_USED (copy) = 1;
5526 /* Set the context for the new declaration. */
5527 if (!DECL_CONTEXT (decl))
5528 /* Globals stay global. */
5530 else if (DECL_CONTEXT (decl) != id->src_fn)
5531 /* Things that weren't in the scope of the function we're inlining
5532 from aren't in the scope we're inlining to, either. */
5534 else if (TREE_STATIC (decl))
5535 /* Function-scoped static variables should stay in the original
5536 function. */
5538 else
5540 /* Ordinary automatic local variables are now in the scope of the
5541 new function. */
5542 DECL_CONTEXT (copy) = id->dst_fn;
5543 if (VAR_P (copy) && id->dst_simt_vars && !is_gimple_reg (copy))
5545 if (!lookup_attribute ("omp simt private", DECL_ATTRIBUTES (copy)))
5546 DECL_ATTRIBUTES (copy)
5547 = tree_cons (get_identifier ("omp simt private"), NULL,
5548 DECL_ATTRIBUTES (copy));
5549 id->dst_simt_vars->safe_push (copy);
5553 return copy;
5556 static tree
5557 copy_decl_to_var (tree decl, copy_body_data *id)
5559 tree copy, type;
5561 gcc_assert (TREE_CODE (decl) == PARM_DECL
5562 || TREE_CODE (decl) == RESULT_DECL);
5564 type = TREE_TYPE (decl);
5566 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
5567 VAR_DECL, DECL_NAME (decl), type);
5568 if (DECL_PT_UID_SET_P (decl))
5569 SET_DECL_PT_UID (copy, DECL_PT_UID (decl));
5570 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
5571 TREE_READONLY (copy) = TREE_READONLY (decl);
5572 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
5573 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
5575 return copy_decl_for_dup_finish (id, decl, copy);
5578 /* Like copy_decl_to_var, but create a return slot object instead of a
5579 pointer variable for return by invisible reference. */
5581 static tree
5582 copy_result_decl_to_var (tree decl, copy_body_data *id)
5584 tree copy, type;
5586 gcc_assert (TREE_CODE (decl) == PARM_DECL
5587 || TREE_CODE (decl) == RESULT_DECL);
5589 type = TREE_TYPE (decl);
5590 if (DECL_BY_REFERENCE (decl))
5591 type = TREE_TYPE (type);
5593 copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
5594 VAR_DECL, DECL_NAME (decl), type);
5595 if (DECL_PT_UID_SET_P (decl))
5596 SET_DECL_PT_UID (copy, DECL_PT_UID (decl));
5597 TREE_READONLY (copy) = TREE_READONLY (decl);
5598 TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
5599 if (!DECL_BY_REFERENCE (decl))
5601 TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
5602 DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
5605 return copy_decl_for_dup_finish (id, decl, copy);
5608 tree
5609 copy_decl_no_change (tree decl, copy_body_data *id)
5611 tree copy;
5613 copy = copy_node (decl);
5615 /* The COPY is not abstract; it will be generated in DST_FN. */
5616 DECL_ABSTRACT_P (copy) = false;
5617 lang_hooks.dup_lang_specific_decl (copy);
5619 /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
5620 been taken; it's for internal bookkeeping in expand_goto_internal. */
5621 if (TREE_CODE (copy) == LABEL_DECL)
5623 TREE_ADDRESSABLE (copy) = 0;
5624 LABEL_DECL_UID (copy) = -1;
5627 return copy_decl_for_dup_finish (id, decl, copy);
5630 static tree
5631 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
5633 if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
5634 return copy_decl_to_var (decl, id);
5635 else
5636 return copy_decl_no_change (decl, id);
5639 /* Return a copy of the function's argument tree. */
5640 static tree
5641 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id,
5642 bitmap args_to_skip, tree *vars)
5644 tree arg, *parg;
5645 tree new_parm = NULL;
5646 int i = 0;
5648 parg = &new_parm;
5650 for (arg = orig_parm; arg; arg = DECL_CHAIN (arg), i++)
5651 if (!args_to_skip || !bitmap_bit_p (args_to_skip, i))
5653 tree new_tree = remap_decl (arg, id);
5654 if (TREE_CODE (new_tree) != PARM_DECL)
5655 new_tree = id->copy_decl (arg, id);
5656 lang_hooks.dup_lang_specific_decl (new_tree);
5657 *parg = new_tree;
5658 parg = &DECL_CHAIN (new_tree);
5660 else if (!id->decl_map->get (arg))
5662 /* Make an equivalent VAR_DECL. If the argument was used
5663 as temporary variable later in function, the uses will be
5664 replaced by local variable. */
5665 tree var = copy_decl_to_var (arg, id);
5666 insert_decl_map (id, arg, var);
5667 /* Declare this new variable. */
5668 DECL_CHAIN (var) = *vars;
5669 *vars = var;
5671 return new_parm;
5674 /* Return a copy of the function's static chain. */
5675 static tree
5676 copy_static_chain (tree static_chain, copy_body_data * id)
5678 tree *chain_copy, *pvar;
5680 chain_copy = &static_chain;
5681 for (pvar = chain_copy; *pvar; pvar = &DECL_CHAIN (*pvar))
5683 tree new_tree = remap_decl (*pvar, id);
5684 lang_hooks.dup_lang_specific_decl (new_tree);
5685 DECL_CHAIN (new_tree) = DECL_CHAIN (*pvar);
5686 *pvar = new_tree;
5688 return static_chain;
5691 /* Return true if the function is allowed to be versioned.
5692 This is a guard for the versioning functionality. */
5694 bool
5695 tree_versionable_function_p (tree fndecl)
5697 return (!lookup_attribute ("noclone", DECL_ATTRIBUTES (fndecl))
5698 && copy_forbidden (DECL_STRUCT_FUNCTION (fndecl)) == NULL);
5701 /* Delete all unreachable basic blocks and update callgraph.
5702 Doing so is somewhat nontrivial because we need to update all clones and
5703 remove inline function that become unreachable. */
5705 static bool
5706 delete_unreachable_blocks_update_callgraph (copy_body_data *id)
5708 bool changed = false;
5709 basic_block b, next_bb;
5711 find_unreachable_blocks ();
5713 /* Delete all unreachable basic blocks. */
5715 for (b = ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb; b
5716 != EXIT_BLOCK_PTR_FOR_FN (cfun); b = next_bb)
5718 next_bb = b->next_bb;
5720 if (!(b->flags & BB_REACHABLE))
5722 gimple_stmt_iterator bsi;
5724 for (bsi = gsi_start_bb (b); !gsi_end_p (bsi); gsi_next (&bsi))
5726 struct cgraph_edge *e;
5727 struct cgraph_node *node;
5729 id->dst_node->remove_stmt_references (gsi_stmt (bsi));
5731 if (gimple_code (gsi_stmt (bsi)) == GIMPLE_CALL
5732 &&(e = id->dst_node->get_edge (gsi_stmt (bsi))) != NULL)
5734 if (!e->inline_failed)
5735 e->callee->remove_symbol_and_inline_clones (id->dst_node);
5736 else
5737 e->remove ();
5739 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
5740 && id->dst_node->clones)
5741 for (node = id->dst_node->clones; node != id->dst_node;)
5743 node->remove_stmt_references (gsi_stmt (bsi));
5744 if (gimple_code (gsi_stmt (bsi)) == GIMPLE_CALL
5745 && (e = node->get_edge (gsi_stmt (bsi))) != NULL)
5747 if (!e->inline_failed)
5748 e->callee->remove_symbol_and_inline_clones (id->dst_node);
5749 else
5750 e->remove ();
5753 if (node->clones)
5754 node = node->clones;
5755 else if (node->next_sibling_clone)
5756 node = node->next_sibling_clone;
5757 else
5759 while (node != id->dst_node && !node->next_sibling_clone)
5760 node = node->clone_of;
5761 if (node != id->dst_node)
5762 node = node->next_sibling_clone;
5766 delete_basic_block (b);
5767 changed = true;
5771 return changed;
5774 /* Update clone info after duplication. */
5776 static void
5777 update_clone_info (copy_body_data * id)
5779 struct cgraph_node *node;
5780 if (!id->dst_node->clones)
5781 return;
5782 for (node = id->dst_node->clones; node != id->dst_node;)
5784 /* First update replace maps to match the new body. */
5785 if (node->clone.tree_map)
5787 unsigned int i;
5788 for (i = 0; i < vec_safe_length (node->clone.tree_map); i++)
5790 struct ipa_replace_map *replace_info;
5791 replace_info = (*node->clone.tree_map)[i];
5792 walk_tree (&replace_info->old_tree, copy_tree_body_r, id, NULL);
5793 walk_tree (&replace_info->new_tree, copy_tree_body_r, id, NULL);
5796 if (node->clones)
5797 node = node->clones;
5798 else if (node->next_sibling_clone)
5799 node = node->next_sibling_clone;
5800 else
5802 while (node != id->dst_node && !node->next_sibling_clone)
5803 node = node->clone_of;
5804 if (node != id->dst_node)
5805 node = node->next_sibling_clone;
5810 /* Create a copy of a function's tree.
5811 OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
5812 of the original function and the new copied function
5813 respectively. In case we want to replace a DECL
5814 tree with another tree while duplicating the function's
5815 body, TREE_MAP represents the mapping between these
5816 trees. If UPDATE_CLONES is set, the call_stmt fields
5817 of edges of clones of the function will be updated.
5819 If non-NULL ARGS_TO_SKIP determine function parameters to remove
5820 from new version.
5821 If SKIP_RETURN is true, the new version will return void.
5822 If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
5823 If non_NULL NEW_ENTRY determine new entry BB of the clone.
5825 void
5826 tree_function_versioning (tree old_decl, tree new_decl,
5827 vec<ipa_replace_map *, va_gc> *tree_map,
5828 bool update_clones, bitmap args_to_skip,
5829 bool skip_return, bitmap blocks_to_copy,
5830 basic_block new_entry)
5832 struct cgraph_node *old_version_node;
5833 struct cgraph_node *new_version_node;
5834 copy_body_data id;
5835 tree p;
5836 unsigned i;
5837 struct ipa_replace_map *replace_info;
5838 basic_block old_entry_block, bb;
5839 auto_vec<gimple *, 10> init_stmts;
5840 tree vars = NULL_TREE;
5841 bitmap debug_args_to_skip = args_to_skip;
5843 gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
5844 && TREE_CODE (new_decl) == FUNCTION_DECL);
5845 DECL_POSSIBLY_INLINED (old_decl) = 1;
5847 old_version_node = cgraph_node::get (old_decl);
5848 gcc_checking_assert (old_version_node);
5849 new_version_node = cgraph_node::get (new_decl);
5850 gcc_checking_assert (new_version_node);
5852 /* Copy over debug args. */
5853 if (DECL_HAS_DEBUG_ARGS_P (old_decl))
5855 vec<tree, va_gc> **new_debug_args, **old_debug_args;
5856 gcc_checking_assert (decl_debug_args_lookup (new_decl) == NULL);
5857 DECL_HAS_DEBUG_ARGS_P (new_decl) = 0;
5858 old_debug_args = decl_debug_args_lookup (old_decl);
5859 if (old_debug_args)
5861 new_debug_args = decl_debug_args_insert (new_decl);
5862 *new_debug_args = vec_safe_copy (*old_debug_args);
5866 /* Output the inlining info for this abstract function, since it has been
5867 inlined. If we don't do this now, we can lose the information about the
5868 variables in the function when the blocks get blown away as soon as we
5869 remove the cgraph node. */
5870 (*debug_hooks->outlining_inline_function) (old_decl);
5872 DECL_ARTIFICIAL (new_decl) = 1;
5873 DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
5874 if (DECL_ORIGIN (old_decl) == old_decl)
5875 old_version_node->used_as_abstract_origin = true;
5876 DECL_FUNCTION_PERSONALITY (new_decl) = DECL_FUNCTION_PERSONALITY (old_decl);
5878 /* Prepare the data structures for the tree copy. */
5879 memset (&id, 0, sizeof (id));
5881 /* Generate a new name for the new version. */
5882 id.statements_to_fold = new hash_set<gimple *>;
5884 id.decl_map = new hash_map<tree, tree>;
5885 id.debug_map = NULL;
5886 id.src_fn = old_decl;
5887 id.dst_fn = new_decl;
5888 id.src_node = old_version_node;
5889 id.dst_node = new_version_node;
5890 id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
5891 id.blocks_to_copy = blocks_to_copy;
5893 id.copy_decl = copy_decl_no_change;
5894 id.transform_call_graph_edges
5895 = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
5896 id.transform_new_cfg = true;
5897 id.transform_return_to_modify = false;
5898 id.transform_parameter = false;
5899 id.transform_lang_insert_block = NULL;
5901 old_entry_block = ENTRY_BLOCK_PTR_FOR_FN
5902 (DECL_STRUCT_FUNCTION (old_decl));
5903 DECL_RESULT (new_decl) = DECL_RESULT (old_decl);
5904 DECL_ARGUMENTS (new_decl) = DECL_ARGUMENTS (old_decl);
5905 initialize_cfun (new_decl, old_decl,
5906 old_entry_block->count);
5907 if (DECL_STRUCT_FUNCTION (new_decl)->gimple_df)
5908 DECL_STRUCT_FUNCTION (new_decl)->gimple_df->ipa_pta
5909 = id.src_cfun->gimple_df->ipa_pta;
5911 /* Copy the function's static chain. */
5912 p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
5913 if (p)
5914 DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl
5915 = copy_static_chain (p, &id);
5917 /* If there's a tree_map, prepare for substitution. */
5918 if (tree_map)
5919 for (i = 0; i < tree_map->length (); i++)
5921 gimple *init;
5922 replace_info = (*tree_map)[i];
5923 if (replace_info->replace_p)
5925 int parm_num = -1;
5926 if (!replace_info->old_tree)
5928 int p = replace_info->parm_num;
5929 tree parm;
5930 tree req_type, new_type;
5932 for (parm = DECL_ARGUMENTS (old_decl); p;
5933 parm = DECL_CHAIN (parm))
5934 p--;
5935 replace_info->old_tree = parm;
5936 parm_num = replace_info->parm_num;
5937 req_type = TREE_TYPE (parm);
5938 new_type = TREE_TYPE (replace_info->new_tree);
5939 if (!useless_type_conversion_p (req_type, new_type))
5941 if (fold_convertible_p (req_type, replace_info->new_tree))
5942 replace_info->new_tree
5943 = fold_build1 (NOP_EXPR, req_type,
5944 replace_info->new_tree);
5945 else if (TYPE_SIZE (req_type) == TYPE_SIZE (new_type))
5946 replace_info->new_tree
5947 = fold_build1 (VIEW_CONVERT_EXPR, req_type,
5948 replace_info->new_tree);
5949 else
5951 if (dump_file)
5953 fprintf (dump_file, " const ");
5954 print_generic_expr (dump_file,
5955 replace_info->new_tree);
5956 fprintf (dump_file,
5957 " can't be converted to param ");
5958 print_generic_expr (dump_file, parm);
5959 fprintf (dump_file, "\n");
5961 replace_info->old_tree = NULL;
5965 else
5966 gcc_assert (TREE_CODE (replace_info->old_tree) == PARM_DECL);
5967 if (replace_info->old_tree)
5969 init = setup_one_parameter (&id, replace_info->old_tree,
5970 replace_info->new_tree, id.src_fn,
5971 NULL,
5972 &vars);
5973 if (init)
5974 init_stmts.safe_push (init);
5975 if (MAY_HAVE_DEBUG_STMTS && args_to_skip)
5977 if (parm_num == -1)
5979 tree parm;
5980 int p;
5981 for (parm = DECL_ARGUMENTS (old_decl), p = 0; parm;
5982 parm = DECL_CHAIN (parm), p++)
5983 if (parm == replace_info->old_tree)
5985 parm_num = p;
5986 break;
5989 if (parm_num != -1)
5991 if (debug_args_to_skip == args_to_skip)
5993 debug_args_to_skip = BITMAP_ALLOC (NULL);
5994 bitmap_copy (debug_args_to_skip, args_to_skip);
5996 bitmap_clear_bit (debug_args_to_skip, parm_num);
6002 /* Copy the function's arguments. */
6003 if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
6004 DECL_ARGUMENTS (new_decl)
6005 = copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id,
6006 args_to_skip, &vars);
6008 DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
6009 BLOCK_SUPERCONTEXT (DECL_INITIAL (new_decl)) = new_decl;
6011 declare_inline_vars (DECL_INITIAL (new_decl), vars);
6013 if (!vec_safe_is_empty (DECL_STRUCT_FUNCTION (old_decl)->local_decls))
6014 /* Add local vars. */
6015 add_local_variables (DECL_STRUCT_FUNCTION (old_decl), cfun, &id);
6017 if (DECL_RESULT (old_decl) == NULL_TREE)
6019 else if (skip_return && !VOID_TYPE_P (TREE_TYPE (DECL_RESULT (old_decl))))
6021 DECL_RESULT (new_decl)
6022 = build_decl (DECL_SOURCE_LOCATION (DECL_RESULT (old_decl)),
6023 RESULT_DECL, NULL_TREE, void_type_node);
6024 DECL_CONTEXT (DECL_RESULT (new_decl)) = new_decl;
6025 cfun->returns_struct = 0;
6026 cfun->returns_pcc_struct = 0;
6028 else
6030 tree old_name;
6031 DECL_RESULT (new_decl) = remap_decl (DECL_RESULT (old_decl), &id);
6032 lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
6033 if (gimple_in_ssa_p (id.src_cfun)
6034 && DECL_BY_REFERENCE (DECL_RESULT (old_decl))
6035 && (old_name = ssa_default_def (id.src_cfun, DECL_RESULT (old_decl))))
6037 tree new_name = make_ssa_name (DECL_RESULT (new_decl));
6038 insert_decl_map (&id, old_name, new_name);
6039 SSA_NAME_DEF_STMT (new_name) = gimple_build_nop ();
6040 set_ssa_default_def (cfun, DECL_RESULT (new_decl), new_name);
6044 /* Set up the destination functions loop tree. */
6045 if (loops_for_fn (DECL_STRUCT_FUNCTION (old_decl)) != NULL)
6047 cfun->curr_properties &= ~PROP_loops;
6048 loop_optimizer_init (AVOID_CFG_MODIFICATIONS);
6049 cfun->curr_properties |= PROP_loops;
6052 /* Copy the Function's body. */
6053 copy_body (&id, old_entry_block->count, REG_BR_PROB_BASE,
6054 ENTRY_BLOCK_PTR_FOR_FN (cfun), EXIT_BLOCK_PTR_FOR_FN (cfun),
6055 new_entry);
6057 /* Renumber the lexical scoping (non-code) blocks consecutively. */
6058 number_blocks (new_decl);
6060 /* We want to create the BB unconditionally, so that the addition of
6061 debug stmts doesn't affect BB count, which may in the end cause
6062 codegen differences. */
6063 bb = split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun)));
6064 while (init_stmts.length ())
6065 insert_init_stmt (&id, bb, init_stmts.pop ());
6066 update_clone_info (&id);
6068 /* Remap the nonlocal_goto_save_area, if any. */
6069 if (cfun->nonlocal_goto_save_area)
6071 struct walk_stmt_info wi;
6073 memset (&wi, 0, sizeof (wi));
6074 wi.info = &id;
6075 walk_tree (&cfun->nonlocal_goto_save_area, remap_gimple_op_r, &wi, NULL);
6078 /* Clean up. */
6079 delete id.decl_map;
6080 if (id.debug_map)
6081 delete id.debug_map;
6082 free_dominance_info (CDI_DOMINATORS);
6083 free_dominance_info (CDI_POST_DOMINATORS);
6085 fold_marked_statements (0, id.statements_to_fold);
6086 delete id.statements_to_fold;
6087 delete_unreachable_blocks_update_callgraph (&id);
6088 if (id.dst_node->definition)
6089 cgraph_edge::rebuild_references ();
6090 if (loops_state_satisfies_p (LOOPS_NEED_FIXUP))
6092 calculate_dominance_info (CDI_DOMINATORS);
6093 fix_loop_structure (NULL);
6095 update_ssa (TODO_update_ssa);
6097 /* After partial cloning we need to rescale frequencies, so they are
6098 within proper range in the cloned function. */
6099 if (new_entry)
6101 struct cgraph_edge *e;
6102 rebuild_frequencies ();
6104 new_version_node->count = ENTRY_BLOCK_PTR_FOR_FN (cfun)->count;
6105 for (e = new_version_node->callees; e; e = e->next_callee)
6107 basic_block bb = gimple_bb (e->call_stmt);
6108 e->frequency = compute_call_stmt_bb_frequency (current_function_decl,
6109 bb);
6110 e->count = bb->count;
6112 for (e = new_version_node->indirect_calls; e; e = e->next_callee)
6114 basic_block bb = gimple_bb (e->call_stmt);
6115 e->frequency = compute_call_stmt_bb_frequency (current_function_decl,
6116 bb);
6117 e->count = bb->count;
6121 if (debug_args_to_skip && MAY_HAVE_DEBUG_STMTS)
6123 tree parm;
6124 vec<tree, va_gc> **debug_args = NULL;
6125 unsigned int len = 0;
6126 for (parm = DECL_ARGUMENTS (old_decl), i = 0;
6127 parm; parm = DECL_CHAIN (parm), i++)
6128 if (bitmap_bit_p (debug_args_to_skip, i) && is_gimple_reg (parm))
6130 tree ddecl;
6132 if (debug_args == NULL)
6134 debug_args = decl_debug_args_insert (new_decl);
6135 len = vec_safe_length (*debug_args);
6137 ddecl = make_node (DEBUG_EXPR_DECL);
6138 DECL_ARTIFICIAL (ddecl) = 1;
6139 TREE_TYPE (ddecl) = TREE_TYPE (parm);
6140 SET_DECL_MODE (ddecl, DECL_MODE (parm));
6141 vec_safe_push (*debug_args, DECL_ORIGIN (parm));
6142 vec_safe_push (*debug_args, ddecl);
6144 if (debug_args != NULL)
6146 /* On the callee side, add
6147 DEBUG D#Y s=> parm
6148 DEBUG var => D#Y
6149 stmts to the first bb where var is a VAR_DECL created for the
6150 optimized away parameter in DECL_INITIAL block. This hints
6151 in the debug info that var (whole DECL_ORIGIN is the parm
6152 PARM_DECL) is optimized away, but could be looked up at the
6153 call site as value of D#X there. */
6154 tree var = vars, vexpr;
6155 gimple_stmt_iterator cgsi
6156 = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun)));
6157 gimple *def_temp;
6158 var = vars;
6159 i = vec_safe_length (*debug_args);
6162 i -= 2;
6163 while (var != NULL_TREE
6164 && DECL_ABSTRACT_ORIGIN (var) != (**debug_args)[i])
6165 var = TREE_CHAIN (var);
6166 if (var == NULL_TREE)
6167 break;
6168 vexpr = make_node (DEBUG_EXPR_DECL);
6169 parm = (**debug_args)[i];
6170 DECL_ARTIFICIAL (vexpr) = 1;
6171 TREE_TYPE (vexpr) = TREE_TYPE (parm);
6172 SET_DECL_MODE (vexpr, DECL_MODE (parm));
6173 def_temp = gimple_build_debug_bind (var, vexpr, NULL);
6174 gsi_insert_before (&cgsi, def_temp, GSI_NEW_STMT);
6175 def_temp = gimple_build_debug_source_bind (vexpr, parm, NULL);
6176 gsi_insert_before (&cgsi, def_temp, GSI_NEW_STMT);
6178 while (i > len);
6182 if (debug_args_to_skip && debug_args_to_skip != args_to_skip)
6183 BITMAP_FREE (debug_args_to_skip);
6184 free_dominance_info (CDI_DOMINATORS);
6185 free_dominance_info (CDI_POST_DOMINATORS);
6187 gcc_assert (!id.debug_stmts.exists ());
6188 pop_cfun ();
6189 return;
6192 /* EXP is CALL_EXPR present in a GENERIC expression tree. Try to integrate
6193 the callee and return the inlined body on success. */
6195 tree
6196 maybe_inline_call_in_expr (tree exp)
6198 tree fn = get_callee_fndecl (exp);
6200 /* We can only try to inline "const" functions. */
6201 if (fn && TREE_READONLY (fn) && DECL_SAVED_TREE (fn))
6203 call_expr_arg_iterator iter;
6204 copy_body_data id;
6205 tree param, arg, t;
6206 hash_map<tree, tree> decl_map;
6208 /* Remap the parameters. */
6209 for (param = DECL_ARGUMENTS (fn), arg = first_call_expr_arg (exp, &iter);
6210 param;
6211 param = DECL_CHAIN (param), arg = next_call_expr_arg (&iter))
6212 decl_map.put (param, arg);
6214 memset (&id, 0, sizeof (id));
6215 id.src_fn = fn;
6216 id.dst_fn = current_function_decl;
6217 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
6218 id.decl_map = &decl_map;
6220 id.copy_decl = copy_decl_no_change;
6221 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
6222 id.transform_new_cfg = false;
6223 id.transform_return_to_modify = true;
6224 id.transform_parameter = true;
6225 id.transform_lang_insert_block = NULL;
6227 /* Make sure not to unshare trees behind the front-end's back
6228 since front-end specific mechanisms may rely on sharing. */
6229 id.regimplify = false;
6230 id.do_not_unshare = true;
6232 /* We're not inside any EH region. */
6233 id.eh_lp_nr = 0;
6235 t = copy_tree_body (&id);
6237 /* We can only return something suitable for use in a GENERIC
6238 expression tree. */
6239 if (TREE_CODE (t) == MODIFY_EXPR)
6240 return TREE_OPERAND (t, 1);
6243 return NULL_TREE;
6246 /* Duplicate a type, fields and all. */
6248 tree
6249 build_duplicate_type (tree type)
6251 struct copy_body_data id;
6253 memset (&id, 0, sizeof (id));
6254 id.src_fn = current_function_decl;
6255 id.dst_fn = current_function_decl;
6256 id.src_cfun = cfun;
6257 id.decl_map = new hash_map<tree, tree>;
6258 id.debug_map = NULL;
6259 id.copy_decl = copy_decl_no_change;
6261 type = remap_type_1 (type, &id);
6263 delete id.decl_map;
6264 if (id.debug_map)
6265 delete id.debug_map;
6267 TYPE_CANONICAL (type) = type;
6269 return type;
6272 /* Unshare the entire DECL_SAVED_TREE of FN and return the remapped
6273 parameters and RESULT_DECL in PARMS and RESULT. Used by C++ constexpr
6274 evaluation. */
6276 tree
6277 copy_fn (tree fn, tree& parms, tree& result)
6279 copy_body_data id;
6280 tree param;
6281 hash_map<tree, tree> decl_map;
6283 tree *p = &parms;
6284 *p = NULL_TREE;
6286 memset (&id, 0, sizeof (id));
6287 id.src_fn = fn;
6288 id.dst_fn = current_function_decl;
6289 id.src_cfun = DECL_STRUCT_FUNCTION (fn);
6290 id.decl_map = &decl_map;
6292 id.copy_decl = copy_decl_no_change;
6293 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
6294 id.transform_new_cfg = false;
6295 id.transform_return_to_modify = false;
6296 id.transform_parameter = true;
6297 id.transform_lang_insert_block = NULL;
6299 /* Make sure not to unshare trees behind the front-end's back
6300 since front-end specific mechanisms may rely on sharing. */
6301 id.regimplify = false;
6302 id.do_not_unshare = true;
6304 /* We're not inside any EH region. */
6305 id.eh_lp_nr = 0;
6307 /* Remap the parameters and result and return them to the caller. */
6308 for (param = DECL_ARGUMENTS (fn);
6309 param;
6310 param = DECL_CHAIN (param))
6312 *p = remap_decl (param, &id);
6313 p = &DECL_CHAIN (*p);
6316 if (DECL_RESULT (fn))
6317 result = remap_decl (DECL_RESULT (fn), &id);
6318 else
6319 result = NULL_TREE;
6321 return copy_tree_body (&id);