gcc/tree-inline.c

   1 /* Tree inlining.
   2    Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
   3    Free Software Foundation, Inc.
   4    Contributed by Alexandre Oliva <aoliva@redhat.com>
   5
   6 This file is part of GCC.
   7
   8 GCC is free software; you can redistribute it and/or modify
   9 it under the terms of the GNU General Public License as published by
  10 the Free Software Foundation; either version 3, or (at your option)
  11 any later version.
  12
  13 GCC is distributed in the hope that it will be useful,
  14 but WITHOUT ANY WARRANTY; without even the implied warranty of
  15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16 GNU General Public License for more details.
  17
  18 You should have received a copy of the GNU General Public License
  19 along with GCC; see the file COPYING3.  If not see
  20 <http://www.gnu.org/licenses/>.  */
  21
  22 #include "config.h"
  23 #include "system.h"
  24 #include "coretypes.h"
  25 #include "tm.h"
  26 #include "toplev.h"
  27 #include "tree.h"
  28 #include "tree-inline.h"
  29 #include "rtl.h"
  30 #include "expr.h"
  31 #include "flags.h"
  32 #include "params.h"
  33 #include "input.h"
  34 #include "insn-config.h"
  35 #include "hashtab.h"
  36 #include "langhooks.h"
  37 #include "basic-block.h"
  38 #include "tree-iterator.h"
  39 #include "cgraph.h"
  40 #include "intl.h"
  41 #include "tree-mudflap.h"
  42 #include "tree-flow.h"
  43 #include "function.h"
  44 #include "ggc.h"
  45 #include "tree-flow.h"
  46 #include "diagnostic.h"
  47 #include "except.h"
  48 #include "debug.h"
  49 #include "pointer-set.h"
  50 #include "ipa-prop.h"
  51 #include "value-prof.h"
  52 #include "tree-pass.h"
  53 #include "target.h"
  54 #include "integrate.h"
  55
  56 /* I'm not real happy about this, but we need to handle gimple and
  57    non-gimple trees.  */
  58 #include "gimple.h"
  59
  60 /* Inlining, Cloning, Versioning, Parallelization
  61
  62    Inlining: a function body is duplicated, but the PARM_DECLs are
  63    remapped into VAR_DECLs, and non-void RETURN_EXPRs become
  64    MODIFY_EXPRs that store to a dedicated returned-value variable.
  65    The duplicated eh_region info of the copy will later be appended
  66    to the info for the caller; the eh_region info in copied throwing
  67    statements and RESX_EXPRs is adjusted accordingly.
  68
  69    Cloning: (only in C++) We have one body for a con/de/structor, and
  70    multiple function decls, each with a unique parameter list.
  71    Duplicate the body, using the given splay tree; some parameters
  72    will become constants (like 0 or 1).
  73
  74    Versioning: a function body is duplicated and the result is a new
  75    function rather than into blocks of an existing function as with
  76    inlining.  Some parameters will become constants.
  77
  78    Parallelization: a region of a function is duplicated resulting in
  79    a new function.  Variables may be replaced with complex expressions
  80    to enable shared variable semantics.
  81
  82    All of these will simultaneously lookup any callgraph edges.  If
  83    we're going to inline the duplicated function body, and the given
  84    function has some cloned callgraph nodes (one for each place this
  85    function will be inlined) those callgraph edges will be duplicated.
  86    If we're cloning the body, those callgraph edges will be
  87    updated to point into the new body.  (Note that the original
  88    callgraph node and edge list will not be altered.)
  89
  90    See the CALL_EXPR handling case in copy_tree_body_r ().  */
  91
  92 /* To Do:
  93
  94    o In order to make inlining-on-trees work, we pessimized
  95      function-local static constants.  In particular, they are now
  96      always output, even when not addressed.  Fix this by treating
  97      function-local static constants just like global static
  98      constants; the back-end already knows not to output them if they
  99      are not needed.
 100
 101    o Provide heuristics to clamp inlining of recursive template
 102      calls?  */
 103
 104
 105 /* Weights that estimate_num_insns uses for heuristics in inlining.  */
 106
 107 eni_weights eni_inlining_weights;
 108
 109 /* Weights that estimate_num_insns uses to estimate the size of the
 110    produced code.  */
 111
 112 eni_weights eni_size_weights;
 113
 114 /* Weights that estimate_num_insns uses to estimate the time necessary
 115    to execute the produced code.  */
 116
 117 eni_weights eni_time_weights;
 118
 119 /* Prototypes.  */
 120
 121 static tree declare_return_variable (copy_body_data *, tree, tree, tree *);
 122 static void remap_block (tree *, copy_body_data *);
 123 static void copy_bind_expr (tree *, int *, copy_body_data *);
 124 static tree mark_local_for_remap_r (tree *, int *, void *);
 125 static void unsave_expr_1 (tree);
 126 static tree unsave_r (tree *, int *, void *);
 127 static void declare_inline_vars (tree, tree);
 128 static void remap_save_expr (tree *, void *, int *);
 129 static void prepend_lexical_block (tree current_block, tree new_block);
 130 static tree copy_decl_to_var (tree, copy_body_data *);
 131 static tree copy_result_decl_to_var (tree, copy_body_data *);
 132 static tree copy_decl_maybe_to_var (tree, copy_body_data *);
 133 static gimple remap_gimple_stmt (gimple, copy_body_data *);
 134 static bool delete_unreachable_blocks_update_callgraph (copy_body_data *id);
 135
 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.  */
 138
 139 void
 140 insert_decl_map (copy_body_data *id, tree key, tree value)
 141 {
 142   *pointer_map_insert (id->decl_map, key) = value;
 143
 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     *pointer_map_insert (id->decl_map, value) = value;
 148 }
 149
 150 /* Construct new SSA name for old NAME. ID is the inline context.  */
 151
 152 static tree
 153 remap_ssa_name (tree name, copy_body_data *id)
 154 {
 155   tree new_tree;
 156   tree *n;
 157
 158   gcc_assert (TREE_CODE (name) == SSA_NAME);
 159
 160   n = (tree *) pointer_map_contains (id->decl_map, name);
 161   if (n)
 162     return unshare_expr (*n);
 163
 164   /* Do not set DEF_STMT yet as statement is not copied yet. We do that
 165      in copy_bb.  */
 166   new_tree = remap_decl (SSA_NAME_VAR (name), id);
 167
 168   /* We might've substituted constant or another SSA_NAME for
 169      the variable.
 170
 171      Replace the SSA name representing RESULT_DECL by variable during
 172      inlining:  this saves us from need to introduce PHI node in a case
 173      return value is just partly initialized.  */
 174   if ((TREE_CODE (new_tree) == VAR_DECL || TREE_CODE (new_tree) == PARM_DECL)
 175       && (TREE_CODE (SSA_NAME_VAR (name)) != RESULT_DECL
 176           || !id->transform_return_to_modify))
 177     {
 178       new_tree = make_ssa_name (new_tree, NULL);
 179       insert_decl_map (id, name, new_tree);
 180       SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_tree)
 181         = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name);
 182       TREE_TYPE (new_tree) = TREE_TYPE (SSA_NAME_VAR (new_tree));
 183       if (gimple_nop_p (SSA_NAME_DEF_STMT (name)))
 184         {
 185           /* By inlining function having uninitialized variable, we might
 186              extend the lifetime (variable might get reused).  This cause
 187              ICE in the case we end up extending lifetime of SSA name across
 188              abnormal edge, but also increase register pressure.
 189
 190              We simply initialize all uninitialized vars by 0 except
 191              for case we are inlining to very first BB.  We can avoid
 192              this for all BBs that are not inside strongly connected
 193              regions of the CFG, but this is expensive to test.  */
 194           if (id->entry_bb
 195               && is_gimple_reg (SSA_NAME_VAR (name))
 196               && TREE_CODE (SSA_NAME_VAR (name)) != PARM_DECL
 197               && (id->entry_bb != EDGE_SUCC (ENTRY_BLOCK_PTR, 0)->dest
 198                   || EDGE_COUNT (id->entry_bb->preds) != 1))
 199             {
 200               gimple_stmt_iterator gsi = gsi_last_bb (id->entry_bb);
 201               gimple init_stmt;
 202
 203               init_stmt = gimple_build_assign (new_tree,
 204                                                fold_convert (TREE_TYPE (new_tree),
 205                                                             integer_zero_node));
 206               gsi_insert_after (&gsi, init_stmt, GSI_NEW_STMT);
 207               SSA_NAME_IS_DEFAULT_DEF (new_tree) = 0;
 208             }
 209           else
 210             {
 211               SSA_NAME_DEF_STMT (new_tree) = gimple_build_nop ();
 212               if (gimple_default_def (id->src_cfun, SSA_NAME_VAR (name))
 213                   == name)
 214                 set_default_def (SSA_NAME_VAR (new_tree), new_tree);
 215             }
 216         }
 217     }
 218   else
 219     insert_decl_map (id, name, new_tree);
 220   return new_tree;
 221 }
 222
 223 /* Remap DECL during the copying of the BLOCK tree for the function.  */
 224
 225 tree
 226 remap_decl (tree decl, copy_body_data *id)
 227 {
 228   tree *n;
 229   tree fn;
 230
 231   /* We only remap local variables in the current function.  */
 232   fn = id->src_fn;
 233
 234   /* See if we have remapped this declaration.  */
 235
 236   n = (tree *) pointer_map_contains (id->decl_map, decl);
 237
 238   /* If we didn't already have an equivalent for this declaration,
 239      create one now.  */
 240   if (!n)
 241     {
 242       /* Make a copy of the variable or label.  */
 243       tree t = id->copy_decl (decl, id);
 244
 245       /* Remember it, so that if we encounter this local entity again
 246          we can reuse this copy.  Do this early because remap_type may
 247          need this decl for TYPE_STUB_DECL.  */
 248       insert_decl_map (id, decl, t);
 249
 250       if (!DECL_P (t))
 251         return t;
 252
 253       /* Remap types, if necessary.  */
 254       TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
 255       if (TREE_CODE (t) == TYPE_DECL)
 256         DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
 257
 258       /* Remap sizes as necessary.  */
 259       walk_tree (&DECL_SIZE (t), copy_tree_body_r, id, NULL);
 260       walk_tree (&DECL_SIZE_UNIT (t), copy_tree_body_r, id, NULL);
 261
 262       /* If fields, do likewise for offset and qualifier.  */
 263       if (TREE_CODE (t) == FIELD_DECL)
 264         {
 265           walk_tree (&DECL_FIELD_OFFSET (t), copy_tree_body_r, id, NULL);
 266           if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
 267             walk_tree (&DECL_QUALIFIER (t), copy_tree_body_r, id, NULL);
 268         }
 269
 270       if (cfun && gimple_in_ssa_p (cfun)
 271           && (TREE_CODE (t) == VAR_DECL
 272               || TREE_CODE (t) == RESULT_DECL || TREE_CODE (t) == PARM_DECL))
 273         {
 274           tree def = gimple_default_def (id->src_cfun, decl);
 275           get_var_ann (t);
 276           if (TREE_CODE (decl) != PARM_DECL && def)
 277             {
 278               tree map = remap_ssa_name (def, id);
 279               /* Watch out RESULT_DECLs whose SSA names map directly
 280                  to them.  */
 281               if (TREE_CODE (map) == SSA_NAME
 282                   && gimple_nop_p (SSA_NAME_DEF_STMT (map)))
 283                 set_default_def (t, map);
 284             }
 285           add_referenced_var (t);
 286         }
 287       return t;
 288     }
 289
 290   if (id->do_not_unshare)
 291     return *n;
 292   else
 293     return unshare_expr (*n);
 294 }
 295
 296 static tree
 297 remap_type_1 (tree type, copy_body_data *id)
 298 {
 299   tree new_tree, t;
 300
 301   /* We do need a copy.  build and register it now.  If this is a pointer or
 302      reference type, remap the designated type and make a new pointer or
 303      reference type.  */
 304   if (TREE_CODE (type) == POINTER_TYPE)
 305     {
 306       new_tree = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
 307                                          TYPE_MODE (type),
 308                                          TYPE_REF_CAN_ALIAS_ALL (type));
 309       insert_decl_map (id, type, new_tree);
 310       return new_tree;
 311     }
 312   else if (TREE_CODE (type) == REFERENCE_TYPE)
 313     {
 314       new_tree = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
 315                                             TYPE_MODE (type),
 316                                             TYPE_REF_CAN_ALIAS_ALL (type));
 317       insert_decl_map (id, type, new_tree);
 318       return new_tree;
 319     }
 320   else
 321     new_tree = copy_node (type);
 322
 323   insert_decl_map (id, type, new_tree);
 324
 325   /* This is a new type, not a copy of an old type.  Need to reassociate
 326      variants.  We can handle everything except the main variant lazily.  */
 327   t = TYPE_MAIN_VARIANT (type);
 328   if (type != t)
 329     {
 330       t = remap_type (t, id);
 331       TYPE_MAIN_VARIANT (new_tree) = t;
 332       TYPE_NEXT_VARIANT (new_tree) = TYPE_NEXT_VARIANT (t);
 333       TYPE_NEXT_VARIANT (t) = new_tree;
 334     }
 335   else
 336     {
 337       TYPE_MAIN_VARIANT (new_tree) = new_tree;
 338       TYPE_NEXT_VARIANT (new_tree) = NULL;
 339     }
 340
 341   if (TYPE_STUB_DECL (type))
 342     TYPE_STUB_DECL (new_tree) = remap_decl (TYPE_STUB_DECL (type), id);
 343
 344   /* Lazily create pointer and reference types.  */
 345   TYPE_POINTER_TO (new_tree) = NULL;
 346   TYPE_REFERENCE_TO (new_tree) = NULL;
 347
 348   switch (TREE_CODE (new_tree))
 349     {
 350     case INTEGER_TYPE:
 351     case REAL_TYPE:
 352     case FIXED_POINT_TYPE:
 353     case ENUMERAL_TYPE:
 354     case BOOLEAN_TYPE:
 355       t = TYPE_MIN_VALUE (new_tree);
 356       if (t && TREE_CODE (t) != INTEGER_CST)
 357         walk_tree (&TYPE_MIN_VALUE (new_tree), copy_tree_body_r, id, NULL);
 358
 359       t = TYPE_MAX_VALUE (new_tree);
 360       if (t && TREE_CODE (t) != INTEGER_CST)
 361         walk_tree (&TYPE_MAX_VALUE (new_tree), copy_tree_body_r, id, NULL);
 362       return new_tree;
 363
 364     case FUNCTION_TYPE:
 365       TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
 366       walk_tree (&TYPE_ARG_TYPES (new_tree), copy_tree_body_r, id, NULL);
 367       return new_tree;
 368
 369     case ARRAY_TYPE:
 370       TREE_TYPE (new_tree) = remap_type (TREE_TYPE (new_tree), id);
 371       TYPE_DOMAIN (new_tree) = remap_type (TYPE_DOMAIN (new_tree), id);
 372       break;
 373
 374     case RECORD_TYPE:
 375     case UNION_TYPE:
 376     case QUAL_UNION_TYPE:
 377       {
 378         tree f, nf = NULL;
 379
 380         for (f = TYPE_FIELDS (new_tree); f ; f = TREE_CHAIN (f))
 381           {
 382             t = remap_decl (f, id);
 383             DECL_CONTEXT (t) = new_tree;
 384             TREE_CHAIN (t) = nf;
 385             nf = t;
 386           }
 387         TYPE_FIELDS (new_tree) = nreverse (nf);
 388       }
 389       break;
 390
 391     case OFFSET_TYPE:
 392     default:
 393       /* Shouldn't have been thought variable sized.  */
 394       gcc_unreachable ();
 395     }
 396
 397   walk_tree (&TYPE_SIZE (new_tree), copy_tree_body_r, id, NULL);
 398   walk_tree (&TYPE_SIZE_UNIT (new_tree), copy_tree_body_r, id, NULL);
 399
 400   return new_tree;
 401 }
 402
 403 tree
 404 remap_type (tree type, copy_body_data *id)
 405 {
 406   tree *node;
 407   tree tmp;
 408
 409   if (type == NULL)
 410     return type;
 411
 412   /* See if we have remapped this type.  */
 413   node = (tree *) pointer_map_contains (id->decl_map, type);
 414   if (node)
 415     return *node;
 416
 417   /* The type only needs remapping if it's variably modified.  */
 418   if (! variably_modified_type_p (type, id->src_fn))
 419     {
 420       insert_decl_map (id, type, type);
 421       return type;
 422     }
 423
 424   id->remapping_type_depth++;
 425   tmp = remap_type_1 (type, id);
 426   id->remapping_type_depth--;
 427
 428   return tmp;
 429 }
 430
 431 /* Return previously remapped type of TYPE in ID.  Return NULL if TYPE
 432    is NULL or TYPE has not been remapped before.  */
 433
 434 static tree
 435 remapped_type (tree type, copy_body_data *id)
 436 {
 437   tree *node;
 438
 439   if (type == NULL)
 440     return type;
 441
 442   /* See if we have remapped this type.  */
 443   node = (tree *) pointer_map_contains (id->decl_map, type);
 444   if (node)
 445     return *node;
 446   else
 447     return NULL;
 448 }
 449
 450   /* The type only needs remapping if it's variably modified.  */
 451 /* Decide if DECL can be put into BLOCK_NONLOCAL_VARs.  */
 452
 453 static bool
 454 can_be_nonlocal (tree decl, copy_body_data *id)
 455 {
 456   /* We can not duplicate function decls.  */
 457   if (TREE_CODE (decl) == FUNCTION_DECL)
 458     return true;
 459
 460   /* Local static vars must be non-local or we get multiple declaration
 461      problems.  */
 462   if (TREE_CODE (decl) == VAR_DECL
 463       && !auto_var_in_fn_p (decl, id->src_fn))
 464     return true;
 465
 466   /* At the moment dwarf2out can handle only these types of nodes.  We
 467      can support more later.  */
 468   if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != PARM_DECL)
 469     return false;
 470
 471   /* We must use global type.  We call remapped_type instead of
 472      remap_type since we don't want to remap this type here if it
 473      hasn't been remapped before.  */
 474   if (TREE_TYPE (decl) != remapped_type (TREE_TYPE (decl), id))
 475     return false;
 476
 477   /* Wihtout SSA we can't tell if variable is used.  */
 478   if (!gimple_in_ssa_p (cfun))
 479     return false;
 480
 481   /* Live variables must be copied so we can attach DECL_RTL.  */
 482   if (var_ann (decl))
 483     return false;
 484
 485   return true;
 486 }
 487
 488 static tree
 489 remap_decls (tree decls, VEC(tree,gc) **nonlocalized_list, copy_body_data *id)
 490 {
 491   tree old_var;
 492   tree new_decls = NULL_TREE;
 493
 494   /* Remap its variables.  */
 495   for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
 496     {
 497       tree new_var;
 498       tree origin_var = DECL_ORIGIN (old_var);
 499
 500       if (can_be_nonlocal (old_var, id))
 501         {
 502           if (TREE_CODE (old_var) == VAR_DECL
 503               && (var_ann (old_var) || !gimple_in_ssa_p (cfun)))
 504             cfun->local_decls = tree_cons (NULL_TREE, old_var,
 505                                                    cfun->local_decls);
 506           if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
 507               && !DECL_IGNORED_P (old_var)
 508               && nonlocalized_list)
 509             VEC_safe_push (tree, gc, *nonlocalized_list, origin_var);
 510           continue;
 511         }
 512
 513       /* Remap the variable.  */
 514       new_var = remap_decl (old_var, id);
 515
 516       /* If we didn't remap this variable, we can't mess with its
 517          TREE_CHAIN.  If we remapped this variable to the return slot, it's
 518          already declared somewhere else, so don't declare it here.  */
 519
 520       if (new_var == id->retvar)
 521         ;
 522       else if (!new_var)
 523         {
 524           if ((!optimize || debug_info_level > DINFO_LEVEL_TERSE)
 525               && !DECL_IGNORED_P (old_var)
 526               && nonlocalized_list)
 527             VEC_safe_push (tree, gc, *nonlocalized_list, origin_var);
 528         }
 529       else
 530         {
 531           gcc_assert (DECL_P (new_var));
 532           TREE_CHAIN (new_var) = new_decls;
 533           new_decls = new_var;
 534         }
 535     }
 536
 537   return nreverse (new_decls);
 538 }
 539
 540 /* Copy the BLOCK to contain remapped versions of the variables
 541    therein.  And hook the new block into the block-tree.  */
 542
 543 static void
 544 remap_block (tree *block, copy_body_data *id)
 545 {
 546   tree old_block;
 547   tree new_block;
 548   tree fn;
 549
 550   /* Make the new block.  */
 551   old_block = *block;
 552   new_block = make_node (BLOCK);
 553   TREE_USED (new_block) = TREE_USED (old_block);
 554   BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
 555   BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
 556   BLOCK_NONLOCALIZED_VARS (new_block)
 557     = VEC_copy (tree, gc, BLOCK_NONLOCALIZED_VARS (old_block));
 558   *block = new_block;
 559
 560   /* Remap its variables.  */
 561   BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block),
 562                                         &BLOCK_NONLOCALIZED_VARS (new_block),
 563                                         id);
 564
 565   fn = id->dst_fn;
 566
 567   if (id->transform_lang_insert_block)
 568     id->transform_lang_insert_block (new_block);
 569
 570   /* Remember the remapped block.  */
 571   insert_decl_map (id, old_block, new_block);
 572 }
 573
 574 /* Copy the whole block tree and root it in id->block.  */
 575 static tree
 576 remap_blocks (tree block, copy_body_data *id)
 577 {
 578   tree t;
 579   tree new_tree = block;
 580
 581   if (!block)
 582     return NULL;
 583
 584   remap_block (&new_tree, id);
 585   gcc_assert (new_tree != block);
 586   for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
 587     prepend_lexical_block (new_tree, remap_blocks (t, id));
 588   /* Blocks are in arbitrary order, but make things slightly prettier and do
 589      not swap order when producing a copy.  */
 590   BLOCK_SUBBLOCKS (new_tree) = blocks_nreverse (BLOCK_SUBBLOCKS (new_tree));
 591   return new_tree;
 592 }
 593
 594 static void
 595 copy_statement_list (tree *tp)
 596 {
 597   tree_stmt_iterator oi, ni;
 598   tree new_tree;
 599
 600   new_tree = alloc_stmt_list ();
 601   ni = tsi_start (new_tree);
 602   oi = tsi_start (*tp);
 603   *tp = new_tree;
 604
 605   for (; !tsi_end_p (oi); tsi_next (&oi))
 606     {
 607       tree stmt = tsi_stmt (oi);
 608       if (TREE_CODE (stmt) == STATEMENT_LIST)
 609         copy_statement_list (&stmt);
 610       tsi_link_after (&ni, stmt, TSI_CONTINUE_LINKING);
 611     }
 612 }
 613
 614 static void
 615 copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
 616 {
 617   tree block = BIND_EXPR_BLOCK (*tp);
 618   /* Copy (and replace) the statement.  */
 619   copy_tree_r (tp, walk_subtrees, NULL);
 620   if (block)
 621     {
 622       remap_block (&block, id);
 623       BIND_EXPR_BLOCK (*tp) = block;
 624     }
 625
 626   if (BIND_EXPR_VARS (*tp))
 627     /* This will remap a lot of the same decls again, but this should be
 628        harmless.  */
 629     BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), NULL, id);
 630 }
 631
 632
 633 /* Create a new gimple_seq by remapping all the statements in BODY
 634    using the inlining information in ID.  */
 635
 636 gimple_seq
 637 remap_gimple_seq (gimple_seq body, copy_body_data *id)
 638 {
 639   gimple_stmt_iterator si;
 640   gimple_seq new_body = NULL;
 641
 642   for (si = gsi_start (body); !gsi_end_p (si); gsi_next (&si))
 643     {
 644       gimple new_stmt = remap_gimple_stmt (gsi_stmt (si), id);
 645       gimple_seq_add_stmt (&new_body, new_stmt);
 646     }
 647
 648   return new_body;
 649 }
 650
 651
 652 /* Copy a GIMPLE_BIND statement STMT, remapping all the symbols in its
 653    block using the mapping information in ID.  */
 654
 655 static gimple
 656 copy_gimple_bind (gimple stmt, copy_body_data *id)
 657 {
 658   gimple new_bind;
 659   tree new_block, new_vars;
 660   gimple_seq body, new_body;
 661
 662   /* Copy the statement.  Note that we purposely don't use copy_stmt
 663      here because we need to remap statements as we copy.  */
 664   body = gimple_bind_body (stmt);
 665   new_body = remap_gimple_seq (body, id);
 666
 667   new_block = gimple_bind_block (stmt);
 668   if (new_block)
 669     remap_block (&new_block, id);
 670
 671   /* This will remap a lot of the same decls again, but this should be
 672      harmless.  */
 673   new_vars = gimple_bind_vars (stmt);
 674   if (new_vars)
 675     new_vars = remap_decls (new_vars, NULL, id);
 676
 677   new_bind = gimple_build_bind (new_vars, new_body, new_block);
 678
 679   return new_bind;
 680 }
 681
 682
 683 /* Remap the GIMPLE operand pointed to by *TP.  DATA is really a
 684    'struct walk_stmt_info *'.  DATA->INFO is a 'copy_body_data *'.
 685    WALK_SUBTREES is used to indicate walk_gimple_op whether to keep
 686    recursing into the children nodes of *TP.  */
 687
 688 static tree
 689 remap_gimple_op_r (tree *tp, int *walk_subtrees, void *data)
 690 {
 691   struct walk_stmt_info *wi_p = (struct walk_stmt_info *) data;
 692   copy_body_data *id = (copy_body_data *) wi_p->info;
 693   tree fn = id->src_fn;
 694
 695   if (TREE_CODE (*tp) == SSA_NAME)
 696     {
 697       *tp = remap_ssa_name (*tp, id);
 698       *walk_subtrees = 0;
 699       return NULL;
 700     }
 701   else if (auto_var_in_fn_p (*tp, fn))
 702     {
 703       /* Local variables and labels need to be replaced by equivalent
 704          variables.  We don't want to copy static variables; there's
 705          only one of those, no matter how many times we inline the
 706          containing function.  Similarly for globals from an outer
 707          function.  */
 708       tree new_decl;
 709
 710       /* Remap the declaration.  */
 711       new_decl = remap_decl (*tp, id);
 712       gcc_assert (new_decl);
 713       /* Replace this variable with the copy.  */
 714       STRIP_TYPE_NOPS (new_decl);
 715       /* ???  The C++ frontend uses void * pointer zero to initialize
 716          any other type.  This confuses the middle-end type verification.
 717          As cloned bodies do not go through gimplification again the fixup
 718          there doesn't trigger.  */
 719       if (TREE_CODE (new_decl) == INTEGER_CST
 720           && !useless_type_conversion_p (TREE_TYPE (*tp), TREE_TYPE (new_decl)))
 721         new_decl = fold_convert (TREE_TYPE (*tp), new_decl);
 722       *tp = new_decl;
 723       *walk_subtrees = 0;
 724     }
 725   else if (TREE_CODE (*tp) == STATEMENT_LIST)
 726     gcc_unreachable ();
 727   else if (TREE_CODE (*tp) == SAVE_EXPR)
 728     gcc_unreachable ();
 729   else if (TREE_CODE (*tp) == LABEL_DECL
 730            && (!DECL_CONTEXT (*tp)
 731                || decl_function_context (*tp) == id->src_fn))
 732     /* These may need to be remapped for EH handling.  */
 733     *tp = remap_decl (*tp, id);
 734   else if (TYPE_P (*tp))
 735     /* Types may need remapping as well.  */
 736     *tp = remap_type (*tp, id);
 737   else if (CONSTANT_CLASS_P (*tp))
 738     {
 739       /* If this is a constant, we have to copy the node iff the type
 740          will be remapped.  copy_tree_r will not copy a constant.  */
 741       tree new_type = remap_type (TREE_TYPE (*tp), id);
 742
 743       if (new_type == TREE_TYPE (*tp))
 744         *walk_subtrees = 0;
 745
 746       else if (TREE_CODE (*tp) == INTEGER_CST)
 747         *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
 748                                   TREE_INT_CST_HIGH (*tp));
 749       else
 750         {
 751           *tp = copy_node (*tp);
 752           TREE_TYPE (*tp) = new_type;
 753         }
 754     }
 755   else
 756     {
 757       /* Otherwise, just copy the node.  Note that copy_tree_r already
 758          knows not to copy VAR_DECLs, etc., so this is safe.  */
 759       if (TREE_CODE (*tp) == INDIRECT_REF)
 760         {
 761           /* Get rid of *& from inline substitutions that can happen when a
 762              pointer argument is an ADDR_EXPR.  */
 763           tree decl = TREE_OPERAND (*tp, 0);
 764           tree *n;
 765
 766           n = (tree *) pointer_map_contains (id->decl_map, decl);
 767           if (n)
 768             {
 769               tree type, new_tree, old;
 770
 771               /* If we happen to get an ADDR_EXPR in n->value, strip
 772                  it manually here as we'll eventually get ADDR_EXPRs
 773                  which lie about their types pointed to.  In this case
 774                  build_fold_indirect_ref wouldn't strip the
 775                  INDIRECT_REF, but we absolutely rely on that.  As
 776                  fold_indirect_ref does other useful transformations,
 777                  try that first, though.  */
 778               type = TREE_TYPE (TREE_TYPE (*n));
 779               new_tree = unshare_expr (*n);
 780               old = *tp;
 781               *tp = gimple_fold_indirect_ref (new_tree);
 782               if (!*tp)
 783                 {
 784                   if (TREE_CODE (new_tree) == ADDR_EXPR)
 785                     {
 786                       *tp = fold_indirect_ref_1 (EXPR_LOCATION (new_tree),
 787                                                  type, new_tree);
 788                       /* ???  We should either assert here or build
 789                          a VIEW_CONVERT_EXPR instead of blindly leaking
 790                          incompatible types to our IL.  */
 791                       if (! *tp)
 792                         *tp = TREE_OPERAND (new_tree, 0);
 793                     }
 794                   else
 795                     {
 796                       *tp = build1 (INDIRECT_REF, type, new_tree);
 797                       TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
 798                       TREE_NO_WARNING (*tp) = TREE_NO_WARNING (old);
 799                     }
 800                 }
 801               *walk_subtrees = 0;
 802               return NULL;
 803             }
 804         }
 805
 806       /* Here is the "usual case".  Copy this tree node, and then
 807          tweak some special cases.  */
 808       copy_tree_r (tp, walk_subtrees, NULL);
 809
 810       /* Global variables we haven't seen yet need to go into referenced
 811          vars.  If not referenced from types only.  */
 812       if (gimple_in_ssa_p (cfun)
 813           && TREE_CODE (*tp) == VAR_DECL
 814           && id->remapping_type_depth == 0)
 815         add_referenced_var (*tp);
 816
 817       /* We should never have TREE_BLOCK set on non-statements.  */
 818       if (EXPR_P (*tp))
 819         gcc_assert (!TREE_BLOCK (*tp));
 820
 821       if (TREE_CODE (*tp) != OMP_CLAUSE)
 822         TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
 823
 824       if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
 825         {
 826           /* The copied TARGET_EXPR has never been expanded, even if the
 827              original node was expanded already.  */
 828           TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
 829           TREE_OPERAND (*tp, 3) = NULL_TREE;
 830         }
 831       else if (TREE_CODE (*tp) == ADDR_EXPR)
 832         {
 833           /* Variable substitution need not be simple.  In particular,
 834              the INDIRECT_REF substitution above.  Make sure that
 835              TREE_CONSTANT and friends are up-to-date.  But make sure
 836              to not improperly set TREE_BLOCK on some sub-expressions.  */
 837           int invariant = is_gimple_min_invariant (*tp);
 838           tree block = id->block;
 839           id->block = NULL_TREE;
 840           walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
 841           id->block = block;
 842
 843           /* Handle the case where we substituted an INDIRECT_REF
 844              into the operand of the ADDR_EXPR.  */
 845           if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
 846             *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
 847           else
 848             recompute_tree_invariant_for_addr_expr (*tp);
 849
 850           /* If this used to be invariant, but is not any longer,
 851              then regimplification is probably needed.  */
 852           if (invariant && !is_gimple_min_invariant (*tp))
 853             id->regimplify = true;
 854
 855           *walk_subtrees = 0;
 856         }
 857     }
 858
 859   /* Keep iterating.  */
 860   return NULL_TREE;
 861 }
 862
 863
 864 /* Called from copy_body_id via walk_tree.  DATA is really a
 865    `copy_body_data *'.  */
 866
 867 tree
 868 copy_tree_body_r (tree *tp, int *walk_subtrees, void *data)
 869 {
 870   copy_body_data *id = (copy_body_data *) data;
 871   tree fn = id->src_fn;
 872   tree new_block;
 873
 874   /* Begin by recognizing trees that we'll completely rewrite for the
 875      inlining context.  Our output for these trees is completely
 876      different from out input (e.g. RETURN_EXPR is deleted, and morphs
 877      into an edge).  Further down, we'll handle trees that get
 878      duplicated and/or tweaked.  */
 879
 880   /* When requested, RETURN_EXPRs should be transformed to just the
 881      contained MODIFY_EXPR.  The branch semantics of the return will
 882      be handled elsewhere by manipulating the CFG rather than a statement.  */
 883   if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
 884     {
 885       tree assignment = TREE_OPERAND (*tp, 0);
 886
 887       /* If we're returning something, just turn that into an
 888          assignment into the equivalent of the original RESULT_DECL.
 889          If the "assignment" is just the result decl, the result
 890          decl has already been set (e.g. a recent "foo (&result_decl,
 891          ...)"); just toss the entire RETURN_EXPR.  */
 892       if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
 893         {
 894           /* Replace the RETURN_EXPR with (a copy of) the
 895              MODIFY_EXPR hanging underneath.  */
 896           *tp = copy_node (assignment);
 897         }
 898       else /* Else the RETURN_EXPR returns no value.  */
 899         {
 900           *tp = NULL;
 901           return (tree) (void *)1;
 902         }
 903     }
 904   else if (TREE_CODE (*tp) == SSA_NAME)
 905     {
 906       *tp = remap_ssa_name (*tp, id);
 907       *walk_subtrees = 0;
 908       return NULL;
 909     }
 910
 911   /* Local variables and labels need to be replaced by equivalent
 912      variables.  We don't want to copy static variables; there's only
 913      one of those, no matter how many times we inline the containing
 914      function.  Similarly for globals from an outer function.  */
 915   else if (auto_var_in_fn_p (*tp, fn))
 916     {
 917       tree new_decl;
 918
 919       /* Remap the declaration.  */
 920       new_decl = remap_decl (*tp, id);
 921       gcc_assert (new_decl);
 922       /* Replace this variable with the copy.  */
 923       STRIP_TYPE_NOPS (new_decl);
 924       *tp = new_decl;
 925       *walk_subtrees = 0;
 926     }
 927   else if (TREE_CODE (*tp) == STATEMENT_LIST)
 928     copy_statement_list (tp);
 929   else if (TREE_CODE (*tp) == SAVE_EXPR
 930            || TREE_CODE (*tp) == TARGET_EXPR)
 931     remap_save_expr (tp, id->decl_map, walk_subtrees);
 932   else if (TREE_CODE (*tp) == LABEL_DECL
 933            && (! DECL_CONTEXT (*tp)
 934                || decl_function_context (*tp) == id->src_fn))
 935     /* These may need to be remapped for EH handling.  */
 936     *tp = remap_decl (*tp, id);
 937   else if (TREE_CODE (*tp) == BIND_EXPR)
 938     copy_bind_expr (tp, walk_subtrees, id);
 939   /* Types may need remapping as well.  */
 940   else if (TYPE_P (*tp))
 941     *tp = remap_type (*tp, id);
 942
 943   /* If this is a constant, we have to copy the node iff the type will be
 944      remapped.  copy_tree_r will not copy a constant.  */
 945   else if (CONSTANT_CLASS_P (*tp))
 946     {
 947       tree new_type = remap_type (TREE_TYPE (*tp), id);
 948
 949       if (new_type == TREE_TYPE (*tp))
 950         *walk_subtrees = 0;
 951
 952       else if (TREE_CODE (*tp) == INTEGER_CST)
 953         *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
 954                                   TREE_INT_CST_HIGH (*tp));
 955       else
 956         {
 957           *tp = copy_node (*tp);
 958           TREE_TYPE (*tp) = new_type;
 959         }
 960     }
 961
 962   /* Otherwise, just copy the node.  Note that copy_tree_r already
 963      knows not to copy VAR_DECLs, etc., so this is safe.  */
 964   else
 965     {
 966       /* Here we handle trees that are not completely rewritten.
 967          First we detect some inlining-induced bogosities for
 968          discarding.  */
 969       if (TREE_CODE (*tp) == MODIFY_EXPR
 970           && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1)
 971           && (auto_var_in_fn_p (TREE_OPERAND (*tp, 0), fn)))
 972         {
 973           /* Some assignments VAR = VAR; don't generate any rtl code
 974              and thus don't count as variable modification.  Avoid
 975              keeping bogosities like 0 = 0.  */
 976           tree decl = TREE_OPERAND (*tp, 0), value;
 977           tree *n;
 978
 979           n = (tree *) pointer_map_contains (id->decl_map, decl);
 980           if (n)
 981             {
 982               value = *n;
 983               STRIP_TYPE_NOPS (value);
 984               if (TREE_CONSTANT (value) || TREE_READONLY (value))
 985                 {
 986                   *tp = build_empty_stmt (EXPR_LOCATION (*tp));
 987                   return copy_tree_body_r (tp, walk_subtrees, data);
 988                 }
 989             }
 990         }
 991       else if (TREE_CODE (*tp) == INDIRECT_REF)
 992         {
 993           /* Get rid of *& from inline substitutions that can happen when a
 994              pointer argument is an ADDR_EXPR.  */
 995           tree decl = TREE_OPERAND (*tp, 0);
 996           tree *n;
 997
 998           n = (tree *) pointer_map_contains (id->decl_map, decl);
 999           if (n)
1000             {
1001               tree new_tree;
1002               tree old;
1003               /* If we happen to get an ADDR_EXPR in n->value, strip
1004                  it manually here as we'll eventually get ADDR_EXPRs
1005                  which lie about their types pointed to.  In this case
1006                  build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
1007                  but we absolutely rely on that.  As fold_indirect_ref
1008                  does other useful transformations, try that first, though.  */
1009               tree type = TREE_TYPE (TREE_TYPE (*n));
1010               if (id->do_not_unshare)
1011                 new_tree = *n;
1012               else
1013                 new_tree = unshare_expr (*n);
1014               old = *tp;
1015               *tp = gimple_fold_indirect_ref (new_tree);
1016               if (! *tp)
1017                 {
1018                   if (TREE_CODE (new_tree) == ADDR_EXPR)
1019                     {
1020                       *tp = fold_indirect_ref_1 (EXPR_LOCATION (new_tree),
1021                                                  type, new_tree);
1022                       /* ???  We should either assert here or build
1023                          a VIEW_CONVERT_EXPR instead of blindly leaking
1024                          incompatible types to our IL.  */
1025                       if (! *tp)
1026                         *tp = TREE_OPERAND (new_tree, 0);
1027                     }
1028                   else
1029                     {
1030                       *tp = build1 (INDIRECT_REF, type, new_tree);
1031                       TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
1032                       TREE_SIDE_EFFECTS (*tp) = TREE_SIDE_EFFECTS (old);
1033                     }
1034                 }
1035               *walk_subtrees = 0;
1036               return NULL;
1037             }
1038         }
1039
1040       /* Here is the "usual case".  Copy this tree node, and then
1041          tweak some special cases.  */
1042       copy_tree_r (tp, walk_subtrees, NULL);
1043
1044       /* Global variables we haven't seen yet needs to go into referenced
1045          vars.  If not referenced from types only.  */
1046       if (gimple_in_ssa_p (cfun)
1047           && TREE_CODE (*tp) == VAR_DECL
1048           && id->remapping_type_depth == 0)
1049         add_referenced_var (*tp);
1050
1051       /* If EXPR has block defined, map it to newly constructed block.
1052          When inlining we want EXPRs without block appear in the block
1053          of function call.  */
1054       if (EXPR_P (*tp))
1055         {
1056           new_block = id->block;
1057           if (TREE_BLOCK (*tp))
1058             {
1059               tree *n;
1060               n = (tree *) pointer_map_contains (id->decl_map,
1061                                                  TREE_BLOCK (*tp));
1062               gcc_assert (n);
1063               new_block = *n;
1064             }
1065           TREE_BLOCK (*tp) = new_block;
1066         }
1067
1068       if (TREE_CODE (*tp) == RESX_EXPR && id->eh_region_offset)
1069         TREE_OPERAND (*tp, 0) =
1070           build_int_cst (NULL_TREE,
1071                          id->eh_region_offset
1072                          + TREE_INT_CST_LOW (TREE_OPERAND (*tp, 0)));
1073
1074       if (TREE_CODE (*tp) != OMP_CLAUSE)
1075         TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
1076
1077       /* The copied TARGET_EXPR has never been expanded, even if the
1078          original node was expanded already.  */
1079       if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
1080         {
1081           TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
1082           TREE_OPERAND (*tp, 3) = NULL_TREE;
1083         }
1084
1085       /* Variable substitution need not be simple.  In particular, the
1086          INDIRECT_REF substitution above.  Make sure that TREE_CONSTANT
1087          and friends are up-to-date.  */
1088       else if (TREE_CODE (*tp) == ADDR_EXPR)
1089         {
1090           int invariant = is_gimple_min_invariant (*tp);
1091           walk_tree (&TREE_OPERAND (*tp, 0), copy_tree_body_r, id, NULL);
1092
1093           /* Handle the case where we substituted an INDIRECT_REF
1094              into the operand of the ADDR_EXPR.  */
1095           if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
1096             *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
1097           else
1098             recompute_tree_invariant_for_addr_expr (*tp);
1099
1100           /* If this used to be invariant, but is not any longer,
1101              then regimplification is probably needed.  */
1102           if (invariant && !is_gimple_min_invariant (*tp))
1103             id->regimplify = true;
1104
1105           *walk_subtrees = 0;
1106         }
1107     }
1108
1109   /* Keep iterating.  */
1110   return NULL_TREE;
1111 }
1112
1113
1114 /* Helper for copy_bb.  Remap statement STMT using the inlining
1115    information in ID.  Return the new statement copy.  */
1116
1117 static gimple
1118 remap_gimple_stmt (gimple stmt, copy_body_data *id)
1119 {
1120   gimple copy = NULL;
1121   struct walk_stmt_info wi;
1122   tree new_block;
1123   bool skip_first = false;
1124
1125   /* Begin by recognizing trees that we'll completely rewrite for the
1126      inlining context.  Our output for these trees is completely
1127      different from out input (e.g. RETURN_EXPR is deleted, and morphs
1128      into an edge).  Further down, we'll handle trees that get
1129      duplicated and/or tweaked.  */
1130
1131   /* When requested, GIMPLE_RETURNs should be transformed to just the
1132      contained GIMPLE_ASSIGN.  The branch semantics of the return will
1133      be handled elsewhere by manipulating the CFG rather than the
1134      statement.  */
1135   if (gimple_code (stmt) == GIMPLE_RETURN && id->transform_return_to_modify)
1136     {
1137       tree retval = gimple_return_retval (stmt);
1138
1139       /* If we're returning something, just turn that into an
1140          assignment into the equivalent of the original RESULT_DECL.
1141          If RETVAL is just the result decl, the result decl has
1142          already been set (e.g. a recent "foo (&result_decl, ...)");
1143          just toss the entire GIMPLE_RETURN.  */
1144       if (retval && TREE_CODE (retval) != RESULT_DECL)
1145         {
1146           copy = gimple_build_assign (id->retvar, retval);
1147           /* id->retvar is already substituted.  Skip it on later remapping.  */
1148           skip_first = true;
1149         }
1150       else
1151         return gimple_build_nop ();
1152     }
1153   else if (gimple_has_substatements (stmt))
1154     {
1155       gimple_seq s1, s2;
1156
1157       /* When cloning bodies from the C++ front end, we will be handed bodies
1158          in High GIMPLE form.  Handle here all the High GIMPLE statements that
1159          have embedded statements.  */
1160       switch (gimple_code (stmt))
1161         {
1162         case GIMPLE_BIND:
1163           copy = copy_gimple_bind (stmt, id);
1164           break;
1165
1166         case GIMPLE_CATCH:
1167           s1 = remap_gimple_seq (gimple_catch_handler (stmt), id);
1168           copy = gimple_build_catch (gimple_catch_types (stmt), s1);
1169           break;
1170
1171         case GIMPLE_EH_FILTER:
1172           s1 = remap_gimple_seq (gimple_eh_filter_failure (stmt), id);
1173           copy = gimple_build_eh_filter (gimple_eh_filter_types (stmt), s1);
1174           break;
1175
1176         case GIMPLE_TRY:
1177           s1 = remap_gimple_seq (gimple_try_eval (stmt), id);
1178           s2 = remap_gimple_seq (gimple_try_cleanup (stmt), id);
1179           copy = gimple_build_try (s1, s2, gimple_try_kind (stmt));
1180           break;
1181
1182         case GIMPLE_WITH_CLEANUP_EXPR:
1183           s1 = remap_gimple_seq (gimple_wce_cleanup (stmt), id);
1184           copy = gimple_build_wce (s1);
1185           break;
1186
1187         case GIMPLE_OMP_PARALLEL:
1188           s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1189           copy = gimple_build_omp_parallel
1190                    (s1,
1191                     gimple_omp_parallel_clauses (stmt),
1192                     gimple_omp_parallel_child_fn (stmt),
1193                     gimple_omp_parallel_data_arg (stmt));
1194           break;
1195
1196         case GIMPLE_OMP_TASK:
1197           s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1198           copy = gimple_build_omp_task
1199                    (s1,
1200                     gimple_omp_task_clauses (stmt),
1201                     gimple_omp_task_child_fn (stmt),
1202                     gimple_omp_task_data_arg (stmt),
1203                     gimple_omp_task_copy_fn (stmt),
1204                     gimple_omp_task_arg_size (stmt),
1205                     gimple_omp_task_arg_align (stmt));
1206           break;
1207
1208         case GIMPLE_OMP_FOR:
1209           s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1210           s2 = remap_gimple_seq (gimple_omp_for_pre_body (stmt), id);
1211           copy = gimple_build_omp_for (s1, gimple_omp_for_clauses (stmt),
1212                                        gimple_omp_for_collapse (stmt), s2);
1213           {
1214             size_t i;
1215             for (i = 0; i < gimple_omp_for_collapse (stmt); i++)
1216               {
1217                 gimple_omp_for_set_index (copy, i,
1218                                           gimple_omp_for_index (stmt, i));
1219                 gimple_omp_for_set_initial (copy, i,
1220                                             gimple_omp_for_initial (stmt, i));
1221                 gimple_omp_for_set_final (copy, i,
1222                                           gimple_omp_for_final (stmt, i));
1223                 gimple_omp_for_set_incr (copy, i,
1224                                          gimple_omp_for_incr (stmt, i));
1225                 gimple_omp_for_set_cond (copy, i,
1226                                          gimple_omp_for_cond (stmt, i));
1227               }
1228           }
1229           break;
1230
1231         case GIMPLE_OMP_MASTER:
1232           s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1233           copy = gimple_build_omp_master (s1);
1234           break;
1235
1236         case GIMPLE_OMP_ORDERED:
1237           s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1238           copy = gimple_build_omp_ordered (s1);
1239           break;
1240
1241         case GIMPLE_OMP_SECTION:
1242           s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1243           copy = gimple_build_omp_section (s1);
1244           break;
1245
1246         case GIMPLE_OMP_SECTIONS:
1247           s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1248           copy = gimple_build_omp_sections
1249                    (s1, gimple_omp_sections_clauses (stmt));
1250           break;
1251
1252         case GIMPLE_OMP_SINGLE:
1253           s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1254           copy = gimple_build_omp_single
1255                    (s1, gimple_omp_single_clauses (stmt));
1256           break;
1257
1258         case GIMPLE_OMP_CRITICAL:
1259           s1 = remap_gimple_seq (gimple_omp_body (stmt), id);
1260           copy
1261             = gimple_build_omp_critical (s1, gimple_omp_critical_name (stmt));
1262           break;
1263
1264         default:
1265           gcc_unreachable ();
1266         }
1267     }
1268   else
1269     {
1270       if (gimple_assign_copy_p (stmt)
1271           && gimple_assign_lhs (stmt) == gimple_assign_rhs1 (stmt)
1272           && auto_var_in_fn_p (gimple_assign_lhs (stmt), id->src_fn))
1273         {
1274           /* Here we handle statements that are not completely rewritten.
1275              First we detect some inlining-induced bogosities for
1276              discarding.  */
1277
1278           /* Some assignments VAR = VAR; don't generate any rtl code
1279              and thus don't count as variable modification.  Avoid
1280              keeping bogosities like 0 = 0.  */
1281           tree decl = gimple_assign_lhs (stmt), value;
1282           tree *n;
1283
1284           n = (tree *) pointer_map_contains (id->decl_map, decl);
1285           if (n)
1286             {
1287               value = *n;
1288               STRIP_TYPE_NOPS (value);
1289               if (TREE_CONSTANT (value) || TREE_READONLY (value))
1290                 return gimple_build_nop ();
1291             }
1292         }
1293
1294       /* Create a new deep copy of the statement.  */
1295       copy = gimple_copy (stmt);
1296     }
1297
1298   /* If STMT has a block defined, map it to the newly constructed
1299      block.  When inlining we want statements without a block to
1300      appear in the block of the function call.  */
1301   new_block = id->block;
1302   if (gimple_block (copy))
1303     {
1304       tree *n;
1305       n = (tree *) pointer_map_contains (id->decl_map, gimple_block (copy));
1306       gcc_assert (n);
1307       new_block = *n;
1308     }
1309
1310   gimple_set_block (copy, new_block);
1311
1312   /* Remap all the operands in COPY.  */
1313   memset (&wi, 0, sizeof (wi));
1314   wi.info = id;
1315   if (skip_first)
1316     walk_tree (gimple_op_ptr (copy, 1), remap_gimple_op_r, &wi, NULL);
1317   else
1318     walk_gimple_op (copy, remap_gimple_op_r, &wi);
1319
1320   /* Clear the copied virtual operands.  We are not remapping them here
1321      but are going to recreate them from scratch.  */
1322   if (gimple_has_mem_ops (copy))
1323     {
1324       gimple_set_vdef (copy, NULL_TREE);
1325       gimple_set_vuse (copy, NULL_TREE);
1326     }
1327
1328   /* We have to handle EH region remapping of GIMPLE_RESX specially because
1329      the region number is not an operand.  */
1330   if (gimple_code (stmt) == GIMPLE_RESX && id->eh_region_offset)
1331     {
1332       gimple_resx_set_region (copy, gimple_resx_region (stmt) + id->eh_region_offset);
1333     }
1334   return copy;
1335 }
1336
1337
1338 /* Copy basic block, scale profile accordingly.  Edges will be taken care of
1339    later  */
1340
1341 static basic_block
1342 copy_bb (copy_body_data *id, basic_block bb, int frequency_scale,
1343          gcov_type count_scale)
1344 {
1345   gimple_stmt_iterator gsi, copy_gsi, seq_gsi;
1346   basic_block copy_basic_block;
1347   tree decl;
1348
1349   /* create_basic_block() will append every new block to
1350      basic_block_info automatically.  */
1351   copy_basic_block = create_basic_block (NULL, (void *) 0,
1352                                          (basic_block) bb->prev_bb->aux);
1353   copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
1354
1355   /* We are going to rebuild frequencies from scratch.  These values
1356      have just small importance to drive canonicalize_loop_headers.  */
1357   copy_basic_block->frequency = ((gcov_type)bb->frequency
1358                                  * frequency_scale / REG_BR_PROB_BASE);
1359
1360   if (copy_basic_block->frequency > BB_FREQ_MAX)
1361     copy_basic_block->frequency = BB_FREQ_MAX;
1362
1363   copy_gsi = gsi_start_bb (copy_basic_block);
1364
1365   for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
1366     {
1367       gimple stmt = gsi_stmt (gsi);
1368       gimple orig_stmt = stmt;
1369
1370       id->regimplify = false;
1371       stmt = remap_gimple_stmt (stmt, id);
1372       if (gimple_nop_p (stmt))
1373         continue;
1374
1375       gimple_duplicate_stmt_histograms (cfun, stmt, id->src_cfun, orig_stmt);
1376       seq_gsi = copy_gsi;
1377
1378       /* With return slot optimization we can end up with
1379          non-gimple (foo *)&this->m, fix that here.  */
1380       if (is_gimple_assign (stmt)
1381           && gimple_assign_rhs_code (stmt) == NOP_EXPR
1382           && !is_gimple_val (gimple_assign_rhs1 (stmt)))
1383         {
1384           tree new_rhs;
1385           new_rhs = force_gimple_operand_gsi (&seq_gsi,
1386                                               gimple_assign_rhs1 (stmt),
1387                                               true, NULL, false, GSI_NEW_STMT);
1388           gimple_assign_set_rhs1 (stmt, new_rhs);
1389           id->regimplify = false;
1390         }
1391
1392       gsi_insert_after (&seq_gsi, stmt, GSI_NEW_STMT);
1393
1394       if (id->regimplify)
1395         gimple_regimplify_operands (stmt, &seq_gsi);
1396
1397       /* If copy_basic_block has been empty at the start of this iteration,
1398          call gsi_start_bb again to get at the newly added statements.  */
1399       if (gsi_end_p (copy_gsi))
1400         copy_gsi = gsi_start_bb (copy_basic_block);
1401       else
1402         gsi_next (&copy_gsi);
1403
1404       /* Process the new statement.  The call to gimple_regimplify_operands
1405          possibly turned the statement into multiple statements, we
1406          need to process all of them.  */
1407       do
1408         {
1409           tree fn;
1410
1411           stmt = gsi_stmt (copy_gsi);
1412           if (is_gimple_call (stmt)
1413               && gimple_call_va_arg_pack_p (stmt)
1414               && id->gimple_call)
1415             {
1416               /* __builtin_va_arg_pack () should be replaced by
1417                  all arguments corresponding to ... in the caller.  */
1418               tree p;
1419               gimple new_call;
1420               VEC(tree, heap) *argarray;
1421               size_t nargs = gimple_call_num_args (id->gimple_call);
1422               size_t n;
1423
1424               for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
1425                 nargs--;
1426
1427               /* Create the new array of arguments.  */
1428               n = nargs + gimple_call_num_args (stmt);
1429               argarray = VEC_alloc (tree, heap, n);
1430               VEC_safe_grow (tree, heap, argarray, n);
1431
1432               /* Copy all the arguments before '...'  */
1433               memcpy (VEC_address (tree, argarray),
1434                       gimple_call_arg_ptr (stmt, 0),
1435                       gimple_call_num_args (stmt) * sizeof (tree));
1436
1437               /* Append the arguments passed in '...'  */
1438               memcpy (VEC_address(tree, argarray) + gimple_call_num_args (stmt),
1439                       gimple_call_arg_ptr (id->gimple_call, 0)
1440                         + (gimple_call_num_args (id->gimple_call) - nargs),
1441                       nargs * sizeof (tree));
1442
1443               new_call = gimple_build_call_vec (gimple_call_fn (stmt),
1444                                                 argarray);
1445
1446               VEC_free (tree, heap, argarray);
1447
1448               /* Copy all GIMPLE_CALL flags, location and block, except
1449                  GF_CALL_VA_ARG_PACK.  */
1450               gimple_call_copy_flags (new_call, stmt);
1451               gimple_call_set_va_arg_pack (new_call, false);
1452               gimple_set_location (new_call, gimple_location (stmt));
1453               gimple_set_block (new_call, gimple_block (stmt));
1454               gimple_call_set_lhs (new_call, gimple_call_lhs (stmt));
1455
1456               gsi_replace (&copy_gsi, new_call, false);
1457               gimple_set_bb (stmt, NULL);
1458               stmt = new_call;
1459             }
1460           else if (is_gimple_call (stmt)
1461                    && id->gimple_call
1462                    && (decl = gimple_call_fndecl (stmt))
1463                    && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
1464                    && DECL_FUNCTION_CODE (decl) == BUILT_IN_VA_ARG_PACK_LEN)
1465             {
1466               /* __builtin_va_arg_pack_len () should be replaced by
1467                  the number of anonymous arguments.  */
1468               size_t nargs = gimple_call_num_args (id->gimple_call);
1469               tree count, p;
1470               gimple new_stmt;
1471
1472               for (p = DECL_ARGUMENTS (id->src_fn); p; p = TREE_CHAIN (p))
1473                 nargs--;
1474
1475               count = build_int_cst (integer_type_node, nargs);
1476               new_stmt = gimple_build_assign (gimple_call_lhs (stmt), count);
1477               gsi_replace (&copy_gsi, new_stmt, false);
1478               stmt = new_stmt;
1479             }
1480
1481           /* Statements produced by inlining can be unfolded, especially
1482              when we constant propagated some operands.  We can't fold
1483              them right now for two reasons:
1484              1) folding require SSA_NAME_DEF_STMTs to be correct
1485              2) we can't change function calls to builtins.
1486              So we just mark statement for later folding.  We mark
1487              all new statements, instead just statements that has changed
1488              by some nontrivial substitution so even statements made
1489              foldable indirectly are updated.  If this turns out to be
1490              expensive, copy_body can be told to watch for nontrivial
1491              changes.  */
1492           if (id->statements_to_fold)
1493             pointer_set_insert (id->statements_to_fold, stmt);
1494
1495           /* We're duplicating a CALL_EXPR.  Find any corresponding
1496              callgraph edges and update or duplicate them.  */
1497           if (is_gimple_call (stmt))
1498             {
1499               struct cgraph_edge *edge = cgraph_edge (id->src_node, orig_stmt);
1500               int flags;
1501
1502               switch (id->transform_call_graph_edges)
1503                 {
1504               case CB_CGE_DUPLICATE:
1505                 if (edge)
1506                   cgraph_clone_edge (edge, id->dst_node, stmt,
1507                                            REG_BR_PROB_BASE, 1,
1508                                            edge->frequency, true);
1509                 break;
1510
1511               case CB_CGE_MOVE_CLONES:
1512                 cgraph_set_call_stmt_including_clones (id->dst_node, orig_stmt, stmt);
1513                 break;
1514
1515               case CB_CGE_MOVE:
1516                 if (edge)
1517                   cgraph_set_call_stmt (edge, stmt);
1518                 break;
1519
1520               default:
1521                 gcc_unreachable ();
1522                 }
1523
1524             edge = cgraph_edge (id->src_node, orig_stmt);
1525             /* Constant propagation on argument done during inlining
1526                may create new direct call.  Produce an edge for it.  */
1527             if ((!edge
1528                  || (edge->indirect_call
1529                      && id->transform_call_graph_edges == CB_CGE_MOVE_CLONES))
1530                 && is_gimple_call (stmt)
1531                 && (fn = gimple_call_fndecl (stmt)) != NULL)
1532               {
1533                 struct cgraph_node *dest = cgraph_node (fn);
1534
1535                 /* We have missing edge in the callgraph.  This can happen in one case
1536                    where previous inlining turned indirect call into direct call by
1537                    constant propagating arguments.  In all other cases we hit a bug
1538                    (incorrect node sharing is most common reason for missing edges.  */
1539                 gcc_assert (dest->needed || !dest->analyzed);
1540                 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES)
1541                   cgraph_create_edge_including_clones (id->dst_node, dest, stmt,
1542                                                        bb->count,
1543                                                        compute_call_stmt_bb_frequency (id->dst_node->decl, bb),
1544                                                        bb->loop_depth,
1545                                                        CIF_ORIGINALLY_INDIRECT_CALL);
1546                 else
1547                   cgraph_create_edge (id->dst_node, dest, stmt,
1548                                       bb->count, CGRAPH_FREQ_BASE,
1549                                       bb->loop_depth)->inline_failed
1550                     = CIF_ORIGINALLY_INDIRECT_CALL;
1551                 if (dump_file)
1552                   {
1553                      fprintf (dump_file, "Created new direct edge to %s",
1554                               cgraph_node_name (dest));
1555                   }
1556               }
1557
1558               flags = gimple_call_flags (stmt);
1559
1560               if (flags & ECF_MAY_BE_ALLOCA)
1561                 cfun->calls_alloca = true;
1562               if (flags & ECF_RETURNS_TWICE)
1563                 cfun->calls_setjmp = true;
1564             }
1565
1566           /* If you think we can abort here, you are wrong.
1567              There is no region 0 in gimple.  */
1568           gcc_assert (lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt) != 0);
1569
1570           if (stmt_could_throw_p (stmt)
1571               /* When we are cloning for inlining, we are supposed to
1572                  construct a clone that calls precisely the same functions
1573                  as original.  However IPA optimizers might've proved
1574                  earlier some function calls as non-trapping that might
1575                  render some basic blocks dead that might become
1576                  unreachable.
1577
1578                  We can't update SSA with unreachable blocks in CFG and thus
1579                  we prevent the scenario by preserving even the "dead" eh
1580                  edges until the point they are later removed by
1581                  fixup_cfg pass.  */
1582               || (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
1583                   && lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt) > 0))
1584             {
1585               int region = lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt);
1586
1587               /* Add an entry for the copied tree in the EH hashtable.
1588                  When cloning or versioning, use the hashtable in
1589                  cfun, and just copy the EH number.  When inlining, use the
1590                  hashtable in the caller, and adjust the region number.  */
1591               if (region > 0)
1592                 add_stmt_to_eh_region (stmt, region + id->eh_region_offset);
1593
1594               /* If this tree doesn't have a region associated with it,
1595                  and there is a "current region,"
1596                  then associate this tree with the current region
1597                  and add edges associated with this region.  */
1598               if (lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt) <= 0
1599                   && id->eh_region > 0
1600                   && stmt_could_throw_p (stmt))
1601                 add_stmt_to_eh_region (stmt, id->eh_region);
1602             }
1603
1604           if (gimple_in_ssa_p (cfun))
1605             {
1606               ssa_op_iter i;
1607               tree def;
1608
1609               find_new_referenced_vars (gsi_stmt (copy_gsi));
1610               FOR_EACH_SSA_TREE_OPERAND (def, stmt, i, SSA_OP_DEF)
1611                 if (TREE_CODE (def) == SSA_NAME)
1612                   SSA_NAME_DEF_STMT (def) = stmt;
1613             }
1614
1615           gsi_next (&copy_gsi);
1616         }
1617       while (!gsi_end_p (copy_gsi));
1618
1619       copy_gsi = gsi_last_bb (copy_basic_block);
1620     }
1621
1622   return copy_basic_block;
1623 }
1624
1625 /* Inserting Single Entry Multiple Exit region in SSA form into code in SSA
1626    form is quite easy, since dominator relationship for old basic blocks does
1627    not change.
1628
1629    There is however exception where inlining might change dominator relation
1630    across EH edges from basic block within inlined functions destinating
1631    to landing pads in function we inline into.
1632
1633    The function fills in PHI_RESULTs of such PHI nodes if they refer
1634    to gimple regs.  Otherwise, the function mark PHI_RESULT of such
1635    PHI nodes for renaming.  For non-gimple regs, renaming is safe: the
1636    EH edges are abnormal and SSA_NAME_OCCURS_IN_ABNORMAL_PHI must be
1637    set, and this means that there will be no overlapping live ranges
1638    for the underlying symbol.
1639
1640    This might change in future if we allow redirecting of EH edges and
1641    we might want to change way build CFG pre-inlining to include
1642    all the possible edges then.  */
1643 static void
1644 update_ssa_across_abnormal_edges (basic_block bb, basic_block ret_bb,
1645                                   bool can_throw, bool nonlocal_goto)
1646 {
1647   edge e;
1648   edge_iterator ei;
1649
1650   FOR_EACH_EDGE (e, ei, bb->succs)
1651     if (!e->dest->aux
1652         || ((basic_block)e->dest->aux)->index == ENTRY_BLOCK)
1653       {
1654         gimple phi;
1655         gimple_stmt_iterator si;
1656
1657         if (!nonlocal_goto)
1658           gcc_assert (e->flags & EDGE_EH);
1659
1660         if (!can_throw)
1661           gcc_assert (!(e->flags & EDGE_EH));
1662
1663         for (si = gsi_start_phis (e->dest); !gsi_end_p (si); gsi_next (&si))
1664           {
1665             edge re;
1666
1667             phi = gsi_stmt (si);
1668
1669             /* There shouldn't be any PHI nodes in the ENTRY_BLOCK.  */
1670             gcc_assert (!e->dest->aux);
1671
1672             gcc_assert ((e->flags & EDGE_EH)
1673                         || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi)));
1674
1675             if (!is_gimple_reg (PHI_RESULT (phi)))
1676               {
1677                 mark_sym_for_renaming (SSA_NAME_VAR (PHI_RESULT (phi)));
1678                 continue;
1679               }
1680
1681             re = find_edge (ret_bb, e->dest);
1682             gcc_assert (re);
1683             gcc_assert ((re->flags & (EDGE_EH | EDGE_ABNORMAL))
1684                         == (e->flags & (EDGE_EH | EDGE_ABNORMAL)));
1685
1686             SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e),
1687                      USE_FROM_PTR (PHI_ARG_DEF_PTR_FROM_EDGE (phi, re)));
1688           }
1689       }
1690 }
1691
1692
1693 /* Copy edges from BB into its copy constructed earlier, scale profile
1694    accordingly.  Edges will be taken care of later.  Assume aux
1695    pointers to point to the copies of each BB.  */
1696
1697 static void
1698 copy_edges_for_bb (basic_block bb, gcov_type count_scale, basic_block ret_bb)
1699 {
1700   basic_block new_bb = (basic_block) bb->aux;
1701   edge_iterator ei;
1702   edge old_edge;
1703   gimple_stmt_iterator si;
1704   int flags;
1705
1706   /* Use the indices from the original blocks to create edges for the
1707      new ones.  */
1708   FOR_EACH_EDGE (old_edge, ei, bb->succs)
1709     if (!(old_edge->flags & EDGE_EH))
1710       {
1711         edge new_edge;
1712
1713         flags = old_edge->flags;
1714
1715         /* Return edges do get a FALLTHRU flag when the get inlined.  */
1716         if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
1717             && old_edge->dest->aux != EXIT_BLOCK_PTR)
1718           flags |= EDGE_FALLTHRU;
1719         new_edge = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
1720         new_edge->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
1721         new_edge->probability = old_edge->probability;
1722       }
1723
1724   if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
1725     return;
1726
1727   for (si = gsi_start_bb (new_bb); !gsi_end_p (si);)
1728     {
1729       gimple copy_stmt;
1730       bool can_throw, nonlocal_goto;
1731
1732       copy_stmt = gsi_stmt (si);
1733       update_stmt (copy_stmt);
1734       if (gimple_in_ssa_p (cfun))
1735         mark_symbols_for_renaming (copy_stmt);
1736
1737       /* Do this before the possible split_block.  */
1738       gsi_next (&si);
1739
1740       /* If this tree could throw an exception, there are two
1741          cases where we need to add abnormal edge(s): the
1742          tree wasn't in a region and there is a "current
1743          region" in the caller; or the original tree had
1744          EH edges.  In both cases split the block after the tree,
1745          and add abnormal edge(s) as needed; we need both
1746          those from the callee and the caller.
1747          We check whether the copy can throw, because the const
1748          propagation can change an INDIRECT_REF which throws
1749          into a COMPONENT_REF which doesn't.  If the copy
1750          can throw, the original could also throw.  */
1751       can_throw = stmt_can_throw_internal (copy_stmt);
1752       nonlocal_goto = stmt_can_make_abnormal_goto (copy_stmt);
1753
1754       if (can_throw || nonlocal_goto)
1755         {
1756           if (!gsi_end_p (si))
1757             /* Note that bb's predecessor edges aren't necessarily
1758                right at this point; split_block doesn't care.  */
1759             {
1760               edge e = split_block (new_bb, copy_stmt);
1761
1762               new_bb = e->dest;
1763               new_bb->aux = e->src->aux;
1764               si = gsi_start_bb (new_bb);
1765             }
1766         }
1767
1768       if (can_throw)
1769         make_eh_edges (copy_stmt);
1770
1771       if (nonlocal_goto)
1772         make_abnormal_goto_edges (gimple_bb (copy_stmt), true);
1773
1774       if ((can_throw || nonlocal_goto)
1775           && gimple_in_ssa_p (cfun))
1776         update_ssa_across_abnormal_edges (gimple_bb (copy_stmt), ret_bb,
1777                                           can_throw, nonlocal_goto);
1778     }
1779 }
1780
1781 /* Copy the PHIs.  All blocks and edges are copied, some blocks
1782    was possibly split and new outgoing EH edges inserted.
1783    BB points to the block of original function and AUX pointers links
1784    the original and newly copied blocks.  */
1785
1786 static void
1787 copy_phis_for_bb (basic_block bb, copy_body_data *id)
1788 {
1789   basic_block const new_bb = (basic_block) bb->aux;
1790   edge_iterator ei;
1791   gimple phi;
1792   gimple_stmt_iterator si;
1793
1794   for (si = gsi_start (phi_nodes (bb)); !gsi_end_p (si); gsi_next (&si))
1795     {
1796       tree res, new_res;
1797       gimple new_phi;
1798       edge new_edge;
1799
1800       phi = gsi_stmt (si);
1801       res = PHI_RESULT (phi);
1802       new_res = res;
1803       if (is_gimple_reg (res))
1804         {
1805           walk_tree (&new_res, copy_tree_body_r, id, NULL);
1806           SSA_NAME_DEF_STMT (new_res)
1807             = new_phi = create_phi_node (new_res, new_bb);
1808           FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
1809             {
1810               edge const old_edge
1811                 = find_edge ((basic_block) new_edge->src->aux, bb);
1812               tree arg = PHI_ARG_DEF_FROM_EDGE (phi, old_edge);
1813               tree new_arg = arg;
1814               tree block = id->block;
1815               id->block = NULL_TREE;
1816               walk_tree (&new_arg, copy_tree_body_r, id, NULL);
1817               id->block = block;
1818               gcc_assert (new_arg);
1819               /* With return slot optimization we can end up with
1820                  non-gimple (foo *)&this->m, fix that here.  */
1821               if (TREE_CODE (new_arg) != SSA_NAME
1822                   && TREE_CODE (new_arg) != FUNCTION_DECL
1823                   && !is_gimple_val (new_arg))
1824                 {
1825                   gimple_seq stmts = NULL;
1826                   new_arg = force_gimple_operand (new_arg, &stmts, true, NULL);
1827                   gsi_insert_seq_on_edge_immediate (new_edge, stmts);
1828                 }
1829               add_phi_arg (new_phi, new_arg, new_edge);
1830             }
1831         }
1832     }
1833 }
1834
1835
1836 /* Wrapper for remap_decl so it can be used as a callback.  */
1837
1838 static tree
1839 remap_decl_1 (tree decl, void *data)
1840 {
1841   return remap_decl (decl, (copy_body_data *) data);
1842 }
1843
1844 /* Build struct function and associated datastructures for the new clone
1845    NEW_FNDECL to be build.  CALLEE_FNDECL is the original */
1846
1847 static void
1848 initialize_cfun (tree new_fndecl, tree callee_fndecl, gcov_type count,
1849                  int frequency)
1850 {
1851   struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1852   gcov_type count_scale, frequency_scale;
1853
1854   if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1855     count_scale = (REG_BR_PROB_BASE * count
1856                    / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1857   else
1858     count_scale = 1;
1859
1860   if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1861     frequency_scale = (REG_BR_PROB_BASE * frequency
1862                        /
1863                        ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1864   else
1865     frequency_scale = count_scale;
1866
1867   /* Register specific tree functions.  */
1868   gimple_register_cfg_hooks ();
1869
1870   /* Get clean struct function.  */
1871   push_struct_function (new_fndecl);
1872
1873   /* We will rebuild these, so just sanity check that they are empty.  */
1874   gcc_assert (VALUE_HISTOGRAMS (cfun) == NULL);
1875   gcc_assert (cfun->local_decls == NULL);
1876   gcc_assert (cfun->cfg == NULL);
1877   gcc_assert (cfun->decl == new_fndecl);
1878
1879   /* Copy items we preserve during clonning.  */
1880   cfun->static_chain_decl = src_cfun->static_chain_decl;
1881   cfun->nonlocal_goto_save_area = src_cfun->nonlocal_goto_save_area;
1882   cfun->function_end_locus = src_cfun->function_end_locus;
1883   cfun->curr_properties = src_cfun->curr_properties;
1884   cfun->last_verified = src_cfun->last_verified;
1885   if (src_cfun->ipa_transforms_to_apply)
1886     cfun->ipa_transforms_to_apply = VEC_copy (ipa_opt_pass, heap,
1887                                               src_cfun->ipa_transforms_to_apply);
1888   cfun->va_list_gpr_size = src_cfun->va_list_gpr_size;
1889   cfun->va_list_fpr_size = src_cfun->va_list_fpr_size;
1890   cfun->function_frequency = src_cfun->function_frequency;
1891   cfun->has_nonlocal_label = src_cfun->has_nonlocal_label;
1892   cfun->stdarg = src_cfun->stdarg;
1893   cfun->dont_save_pending_sizes_p = src_cfun->dont_save_pending_sizes_p;
1894   cfun->after_inlining = src_cfun->after_inlining;
1895   cfun->returns_struct = src_cfun->returns_struct;
1896   cfun->returns_pcc_struct = src_cfun->returns_pcc_struct;
1897   cfun->after_tree_profile = src_cfun->after_tree_profile;
1898
1899   init_empty_tree_cfg ();
1900
1901   ENTRY_BLOCK_PTR->count =
1902     (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1903      REG_BR_PROB_BASE);
1904   ENTRY_BLOCK_PTR->frequency =
1905     (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1906      frequency_scale / REG_BR_PROB_BASE);
1907   EXIT_BLOCK_PTR->count =
1908     (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
1909      REG_BR_PROB_BASE);
1910   EXIT_BLOCK_PTR->frequency =
1911     (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
1912      frequency_scale / REG_BR_PROB_BASE);
1913   if (src_cfun->eh)
1914     init_eh_for_function ();
1915
1916   if (src_cfun->gimple_df)
1917     {
1918       init_tree_ssa (cfun);
1919       cfun->gimple_df->in_ssa_p = true;
1920       init_ssa_operands ();
1921     }
1922   pop_cfun ();
1923 }
1924
1925 /* Make a copy of the body of FN so that it can be inserted inline in
1926    another function.  Walks FN via CFG, returns new fndecl.  */
1927
1928 static tree
1929 copy_cfg_body (copy_body_data * id, gcov_type count, int frequency,
1930                basic_block entry_block_map, basic_block exit_block_map)
1931 {
1932   tree callee_fndecl = id->src_fn;
1933   /* Original cfun for the callee, doesn't change.  */
1934   struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1935   struct function *cfun_to_copy;
1936   basic_block bb;
1937   tree new_fndecl = NULL;
1938   gcov_type count_scale, frequency_scale;
1939   int last;
1940
1941   if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
1942     count_scale = (REG_BR_PROB_BASE * count
1943                    / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
1944   else
1945     count_scale = 1;
1946
1947   if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
1948     frequency_scale = (REG_BR_PROB_BASE * frequency
1949                        /
1950                        ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
1951   else
1952     frequency_scale = count_scale;
1953
1954   /* Register specific tree functions.  */
1955   gimple_register_cfg_hooks ();
1956
1957   /* Must have a CFG here at this point.  */
1958   gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
1959               (DECL_STRUCT_FUNCTION (callee_fndecl)));
1960
1961   cfun_to_copy = id->src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
1962
1963   ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
1964   EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
1965   entry_block_map->aux = ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1966   exit_block_map->aux = EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy);
1967
1968   /* Duplicate any exception-handling regions.  */
1969   if (cfun->eh)
1970     {
1971       id->eh_region_offset
1972         = duplicate_eh_regions (cfun_to_copy, remap_decl_1, id,
1973                                 0, id->eh_region);
1974     }
1975
1976   /* Use aux pointers to map the original blocks to copy.  */
1977   FOR_EACH_BB_FN (bb, cfun_to_copy)
1978     {
1979       basic_block new_bb = copy_bb (id, bb, frequency_scale, count_scale);
1980       bb->aux = new_bb;
1981       new_bb->aux = bb;
1982     }
1983
1984   last = last_basic_block;
1985
1986   /* Now that we've duplicated the blocks, duplicate their edges.  */
1987   FOR_ALL_BB_FN (bb, cfun_to_copy)
1988     copy_edges_for_bb (bb, count_scale, exit_block_map);
1989
1990   if (gimple_in_ssa_p (cfun))
1991     FOR_ALL_BB_FN (bb, cfun_to_copy)
1992       copy_phis_for_bb (bb, id);
1993
1994   FOR_ALL_BB_FN (bb, cfun_to_copy)
1995     {
1996       ((basic_block)bb->aux)->aux = NULL;
1997       bb->aux = NULL;
1998     }
1999
2000   /* Zero out AUX fields of newly created block during EH edge
2001      insertion. */
2002   for (; last < last_basic_block; last++)
2003     BASIC_BLOCK (last)->aux = NULL;
2004   entry_block_map->aux = NULL;
2005   exit_block_map->aux = NULL;
2006
2007   return new_fndecl;
2008 }
2009
2010 /* Make a copy of the body of SRC_FN so that it can be inserted inline in
2011    another function.  */
2012
2013 static tree
2014 copy_tree_body (copy_body_data *id)
2015 {
2016   tree fndecl = id->src_fn;
2017   tree body = DECL_SAVED_TREE (fndecl);
2018
2019   walk_tree (&body, copy_tree_body_r, id, NULL);
2020
2021   return body;
2022 }
2023
2024 static tree
2025 copy_body (copy_body_data *id, gcov_type count, int frequency,
2026            basic_block entry_block_map, basic_block exit_block_map)
2027 {
2028   tree fndecl = id->src_fn;
2029   tree body;
2030
2031   /* If this body has a CFG, walk CFG and copy.  */
2032   gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
2033   body = copy_cfg_body (id, count, frequency, entry_block_map, exit_block_map);
2034
2035   return body;
2036 }
2037
2038 /* Return true if VALUE is an ADDR_EXPR of an automatic variable
2039    defined in function FN, or of a data member thereof.  */
2040
2041 static bool
2042 self_inlining_addr_expr (tree value, tree fn)
2043 {
2044   tree var;
2045
2046   if (TREE_CODE (value) != ADDR_EXPR)
2047     return false;
2048
2049   var = get_base_address (TREE_OPERAND (value, 0));
2050
2051   return var && auto_var_in_fn_p (var, fn);
2052 }
2053
2054 static void
2055 insert_init_stmt (basic_block bb, gimple init_stmt)
2056 {
2057   /* If VAR represents a zero-sized variable, it's possible that the
2058      assignment statement may result in no gimple statements.  */
2059   if (init_stmt)
2060     {
2061       gimple_stmt_iterator si = gsi_last_bb (bb);
2062
2063       /* We can end up with init statements that store to a non-register
2064          from a rhs with a conversion.  Handle that here by forcing the
2065          rhs into a temporary.  gimple_regimplify_operands is not
2066          prepared to do this for us.  */
2067       if (!is_gimple_reg (gimple_assign_lhs (init_stmt))
2068           && is_gimple_reg_type (TREE_TYPE (gimple_assign_lhs (init_stmt)))
2069           && gimple_assign_rhs_class (init_stmt) == GIMPLE_UNARY_RHS)
2070         {
2071           tree rhs = build1 (gimple_assign_rhs_code (init_stmt),
2072                              gimple_expr_type (init_stmt),
2073                              gimple_assign_rhs1 (init_stmt));
2074           rhs = force_gimple_operand_gsi (&si, rhs, true, NULL_TREE, false,
2075                                           GSI_NEW_STMT);
2076           gimple_assign_set_rhs_code (init_stmt, TREE_CODE (rhs));
2077           gimple_assign_set_rhs1 (init_stmt, rhs);
2078         }
2079       gsi_insert_after (&si, init_stmt, GSI_NEW_STMT);
2080       gimple_regimplify_operands (init_stmt, &si);
2081       mark_symbols_for_renaming (init_stmt);
2082     }
2083 }
2084
2085 /* Initialize parameter P with VALUE.  If needed, produce init statement
2086    at the end of BB.  When BB is NULL, we return init statement to be
2087    output later.  */
2088 static gimple
2089 setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
2090                      basic_block bb, tree *vars)
2091 {
2092   gimple init_stmt = NULL;
2093   tree var;
2094   tree rhs = value;
2095   tree def = (gimple_in_ssa_p (cfun)
2096               ? gimple_default_def (id->src_cfun, p) : NULL);
2097
2098   if (value
2099       && value != error_mark_node
2100       && !useless_type_conversion_p (TREE_TYPE (p), TREE_TYPE (value)))
2101     {
2102       if (fold_convertible_p (TREE_TYPE (p), value))
2103         rhs = fold_build1 (NOP_EXPR, TREE_TYPE (p), value);
2104       else
2105         /* ???  For valid (GIMPLE) programs we should not end up here.
2106            Still if something has gone wrong and we end up with truly
2107            mismatched types here, fall back to using a VIEW_CONVERT_EXPR
2108            to not leak invalid GIMPLE to the following passes.  */
2109         rhs = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (p), value);
2110     }
2111
2112   /* If the parameter is never assigned to, has no SSA_NAMEs created,
2113      we may not need to create a new variable here at all.  Instead, we may
2114      be able to just use the argument value.  */
2115   if (TREE_READONLY (p)
2116       && !TREE_ADDRESSABLE (p)
2117       && value && !TREE_SIDE_EFFECTS (value)
2118       && !def)
2119     {
2120       /* We may produce non-gimple trees by adding NOPs or introduce
2121          invalid sharing when operand is not really constant.
2122          It is not big deal to prohibit constant propagation here as
2123          we will constant propagate in DOM1 pass anyway.  */
2124       if (is_gimple_min_invariant (value)
2125           && useless_type_conversion_p (TREE_TYPE (p),
2126                                                  TREE_TYPE (value))
2127           /* We have to be very careful about ADDR_EXPR.  Make sure
2128              the base variable isn't a local variable of the inlined
2129              function, e.g., when doing recursive inlining, direct or
2130              mutually-recursive or whatever, which is why we don't
2131              just test whether fn == current_function_decl.  */
2132           && ! self_inlining_addr_expr (value, fn))
2133         {
2134           insert_decl_map (id, p, value);
2135           return NULL;
2136         }
2137     }
2138
2139   /* Make an equivalent VAR_DECL.  Note that we must NOT remap the type
2140      here since the type of this decl must be visible to the calling
2141      function.  */
2142   var = copy_decl_to_var (p, id);
2143   if (gimple_in_ssa_p (cfun) && TREE_CODE (var) == VAR_DECL)
2144     {
2145       get_var_ann (var);
2146       add_referenced_var (var);
2147     }
2148
2149   /* Register the VAR_DECL as the equivalent for the PARM_DECL;
2150      that way, when the PARM_DECL is encountered, it will be
2151      automatically replaced by the VAR_DECL.  */
2152   insert_decl_map (id, p, var);
2153
2154   /* Declare this new variable.  */
2155   TREE_CHAIN (var) = *vars;
2156   *vars = var;
2157
2158   /* Make gimplifier happy about this variable.  */
2159   DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2160
2161   /* Even if P was TREE_READONLY, the new VAR should not be.
2162      In the original code, we would have constructed a
2163      temporary, and then the function body would have never
2164      changed the value of P.  However, now, we will be
2165      constructing VAR directly.  The constructor body may
2166      change its value multiple times as it is being
2167      constructed.  Therefore, it must not be TREE_READONLY;
2168      the back-end assumes that TREE_READONLY variable is
2169      assigned to only once.  */
2170   if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
2171     TREE_READONLY (var) = 0;
2172
2173   /* If there is no setup required and we are in SSA, take the easy route
2174      replacing all SSA names representing the function parameter by the
2175      SSA name passed to function.
2176
2177      We need to construct map for the variable anyway as it might be used
2178      in different SSA names when parameter is set in function.
2179
2180      Do replacement at -O0 for const arguments replaced by constant.
2181      This is important for builtin_constant_p and other construct requiring
2182      constant argument to be visible in inlined function body.
2183
2184      FIXME: This usually kills the last connection in between inlined
2185      function parameter and the actual value in debug info.  Can we do
2186      better here?  If we just inserted the statement, copy propagation
2187      would kill it anyway as it always did in older versions of GCC.
2188
2189      We might want to introduce a notion that single SSA_NAME might
2190      represent multiple variables for purposes of debugging. */
2191   if (gimple_in_ssa_p (cfun) && rhs && def && is_gimple_reg (p)
2192       && (optimize
2193           || (TREE_READONLY (p)
2194               && is_gimple_min_invariant (rhs)))
2195       && (TREE_CODE (rhs) == SSA_NAME
2196           || is_gimple_min_invariant (rhs))
2197       && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
2198     {
2199       insert_decl_map (id, def, rhs);
2200       return NULL;
2201     }
2202
2203   /* If the value of argument is never used, don't care about initializing
2204      it.  */
2205   if (optimize && gimple_in_ssa_p (cfun) && !def && is_gimple_reg (p))
2206     {
2207       gcc_assert (!value || !TREE_SIDE_EFFECTS (value));
2208       return NULL;
2209     }
2210
2211   /* Initialize this VAR_DECL from the equivalent argument.  Convert
2212      the argument to the proper type in case it was promoted.  */
2213   if (value)
2214     {
2215       if (rhs == error_mark_node)
2216         {
2217           insert_decl_map (id, p, var);
2218           return NULL;
2219         }
2220
2221       STRIP_USELESS_TYPE_CONVERSION (rhs);
2222
2223       /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
2224          keep our trees in gimple form.  */
2225       if (def && gimple_in_ssa_p (cfun) && is_gimple_reg (p))
2226         {
2227           def = remap_ssa_name (def, id);
2228           init_stmt = gimple_build_assign (def, rhs);
2229           SSA_NAME_IS_DEFAULT_DEF (def) = 0;
2230           set_default_def (var, NULL);
2231         }
2232       else
2233         init_stmt = gimple_build_assign (var, rhs);
2234
2235       if (bb && init_stmt)
2236         insert_init_stmt (bb, init_stmt);
2237     }
2238   return init_stmt;
2239 }
2240
2241 /* Generate code to initialize the parameters of the function at the
2242    top of the stack in ID from the GIMPLE_CALL STMT.  */
2243
2244 static void
2245 initialize_inlined_parameters (copy_body_data *id, gimple stmt,
2246                                tree fn, basic_block bb)
2247 {
2248   tree parms;
2249   size_t i;
2250   tree p;
2251   tree vars = NULL_TREE;
2252   tree static_chain = gimple_call_chain (stmt);
2253
2254   /* Figure out what the parameters are.  */
2255   parms = DECL_ARGUMENTS (fn);
2256
2257   /* Loop through the parameter declarations, replacing each with an
2258      equivalent VAR_DECL, appropriately initialized.  */
2259   for (p = parms, i = 0; p; p = TREE_CHAIN (p), i++)
2260     {
2261       tree val;
2262       val = i < gimple_call_num_args (stmt) ? gimple_call_arg (stmt, i) : NULL;
2263       setup_one_parameter (id, p, val, fn, bb, &vars);
2264     }
2265
2266   /* Initialize the static chain.  */
2267   p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
2268   gcc_assert (fn != current_function_decl);
2269   if (p)
2270     {
2271       /* No static chain?  Seems like a bug in tree-nested.c.  */
2272       gcc_assert (static_chain);
2273
2274       setup_one_parameter (id, p, static_chain, fn, bb, &vars);
2275     }
2276
2277   declare_inline_vars (id->block, vars);
2278 }
2279
2280
2281 /* Declare a return variable to replace the RESULT_DECL for the
2282    function we are calling.  An appropriate DECL_STMT is returned.
2283    The USE_STMT is filled to contain a use of the declaration to
2284    indicate the return value of the function.
2285
2286    RETURN_SLOT, if non-null is place where to store the result.  It
2287    is set only for CALL_EXPR_RETURN_SLOT_OPT.  MODIFY_DEST, if non-null,
2288    was the LHS of the MODIFY_EXPR to which this call is the RHS.
2289
2290    The return value is a (possibly null) value that is the result of the
2291    function as seen by the callee.  *USE_P is a (possibly null) value that
2292    holds the result as seen by the caller.  */
2293
2294 static tree
2295 declare_return_variable (copy_body_data *id, tree return_slot, tree modify_dest,
2296                          tree *use_p)
2297 {
2298   tree callee = id->src_fn;
2299   tree caller = id->dst_fn;
2300   tree result = DECL_RESULT (callee);
2301   tree callee_type = TREE_TYPE (result);
2302   tree caller_type = TREE_TYPE (TREE_TYPE (callee));
2303   tree var, use;
2304
2305   /* We don't need to do anything for functions that don't return
2306      anything.  */
2307   if (!result || VOID_TYPE_P (callee_type))
2308     {
2309       *use_p = NULL_TREE;
2310       return NULL_TREE;
2311     }
2312
2313   /* If there was a return slot, then the return value is the
2314      dereferenced address of that object.  */
2315   if (return_slot)
2316     {
2317       /* The front end shouldn't have used both return_slot and
2318          a modify expression.  */
2319       gcc_assert (!modify_dest);
2320       if (DECL_BY_REFERENCE (result))
2321         {
2322           tree return_slot_addr = build_fold_addr_expr (return_slot);
2323           STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
2324
2325           /* We are going to construct *&return_slot and we can't do that
2326              for variables believed to be not addressable.
2327
2328              FIXME: This check possibly can match, because values returned
2329              via return slot optimization are not believed to have address
2330              taken by alias analysis.  */
2331           gcc_assert (TREE_CODE (return_slot) != SSA_NAME);
2332           if (gimple_in_ssa_p (cfun))
2333             {
2334               HOST_WIDE_INT bitsize;
2335               HOST_WIDE_INT bitpos;
2336               tree offset;
2337               enum machine_mode mode;
2338               int unsignedp;
2339               int volatilep;
2340               tree base;
2341               base = get_inner_reference (return_slot, &bitsize, &bitpos,
2342                                           &offset,
2343                                           &mode, &unsignedp, &volatilep,
2344                                           false);
2345               if (TREE_CODE (base) == INDIRECT_REF)
2346                 base = TREE_OPERAND (base, 0);
2347               if (TREE_CODE (base) == SSA_NAME)
2348                 base = SSA_NAME_VAR (base);
2349               mark_sym_for_renaming (base);
2350             }
2351           var = return_slot_addr;
2352         }
2353       else
2354         {
2355           var = return_slot;
2356           gcc_assert (TREE_CODE (var) != SSA_NAME);
2357           TREE_ADDRESSABLE (var) |= TREE_ADDRESSABLE (result);
2358         }
2359       if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2360            || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2361           && !DECL_GIMPLE_REG_P (result)
2362           && DECL_P (var))
2363         DECL_GIMPLE_REG_P (var) = 0;
2364       use = NULL;
2365       goto done;
2366     }
2367
2368   /* All types requiring non-trivial constructors should have been handled.  */
2369   gcc_assert (!TREE_ADDRESSABLE (callee_type));
2370
2371   /* Attempt to avoid creating a new temporary variable.  */
2372   if (modify_dest
2373       && TREE_CODE (modify_dest) != SSA_NAME)
2374     {
2375       bool use_it = false;
2376
2377       /* We can't use MODIFY_DEST if there's type promotion involved.  */
2378       if (!useless_type_conversion_p (callee_type, caller_type))
2379         use_it = false;
2380
2381       /* ??? If we're assigning to a variable sized type, then we must
2382          reuse the destination variable, because we've no good way to
2383          create variable sized temporaries at this point.  */
2384       else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
2385         use_it = true;
2386
2387       /* If the callee cannot possibly modify MODIFY_DEST, then we can
2388          reuse it as the result of the call directly.  Don't do this if
2389          it would promote MODIFY_DEST to addressable.  */
2390       else if (TREE_ADDRESSABLE (result))
2391         use_it = false;
2392       else
2393         {
2394           tree base_m = get_base_address (modify_dest);
2395
2396           /* If the base isn't a decl, then it's a pointer, and we don't
2397              know where that's going to go.  */
2398           if (!DECL_P (base_m))
2399             use_it = false;
2400           else if (is_global_var (base_m))
2401             use_it = false;
2402           else if ((TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
2403                     || TREE_CODE (TREE_TYPE (result)) == VECTOR_TYPE)
2404                    && !DECL_GIMPLE_REG_P (result)
2405                    && DECL_GIMPLE_REG_P (base_m))
2406             use_it = false;
2407           else if (!TREE_ADDRESSABLE (base_m))
2408             use_it = true;
2409         }
2410
2411       if (use_it)
2412         {
2413           var = modify_dest;
2414           use = NULL;
2415           goto done;
2416         }
2417     }
2418
2419   gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
2420
2421   var = copy_result_decl_to_var (result, id);
2422   if (gimple_in_ssa_p (cfun))
2423     {
2424       get_var_ann (var);
2425       add_referenced_var (var);
2426     }
2427
2428   DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
2429   DECL_STRUCT_FUNCTION (caller)->local_decls
2430     = tree_cons (NULL_TREE, var,
2431                  DECL_STRUCT_FUNCTION (caller)->local_decls);
2432
2433   /* Do not have the rest of GCC warn about this variable as it should
2434      not be visible to the user.  */
2435   TREE_NO_WARNING (var) = 1;
2436
2437   declare_inline_vars (id->block, var);
2438
2439   /* Build the use expr.  If the return type of the function was
2440      promoted, convert it back to the expected type.  */
2441   use = var;
2442   if (!useless_type_conversion_p (caller_type, TREE_TYPE (var)))
2443     use = fold_convert (caller_type, var);
2444
2445   STRIP_USELESS_TYPE_CONVERSION (use);
2446
2447   if (DECL_BY_REFERENCE (result))
2448     {
2449       TREE_ADDRESSABLE (var) = 1;
2450       var = build_fold_addr_expr (var);
2451     }
2452
2453  done:
2454   /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
2455      way, when the RESULT_DECL is encountered, it will be
2456      automatically replaced by the VAR_DECL.  */
2457   insert_decl_map (id, result, var);
2458
2459   /* Remember this so we can ignore it in remap_decls.  */
2460   id->retvar = var;
2461
2462   *use_p = use;
2463   return var;
2464 }
2465
2466 /* Callback through walk_tree.  Determine if a DECL_INITIAL makes reference
2467    to a local label.  */
2468
2469 static tree
2470 has_label_address_in_static_1 (tree *nodep, int *walk_subtrees, void *fnp)
2471 {
2472   tree node = *nodep;
2473   tree fn = (tree) fnp;
2474
2475   if (TREE_CODE (node) == LABEL_DECL && DECL_CONTEXT (node) == fn)
2476     return node;
2477
2478   if (TYPE_P (node))
2479     *walk_subtrees = 0;
2480
2481   return NULL_TREE;
2482 }
2483
2484 /* Callback through walk_tree.  Determine if we've got an aggregate
2485    type that we can't support; return non-null if so.  */
2486
2487 static tree
2488 cannot_copy_type_1 (tree *nodep, int *walk_subtrees ATTRIBUTE_UNUSED,
2489                     void *data ATTRIBUTE_UNUSED)
2490 {
2491   tree t, node = *nodep;
2492
2493   if (TREE_CODE (node) == RECORD_TYPE || TREE_CODE (node) == UNION_TYPE)
2494     {
2495       /* We cannot inline a function of the form
2496
2497            void F (int i) { struct S { int ar[i]; } s; }
2498
2499          Attempting to do so produces a catch-22.
2500          If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
2501          UNION_TYPE nodes, then it goes into infinite recursion on a
2502          structure containing a pointer to its own type.  If it doesn't,
2503          then the type node for S doesn't get adjusted properly when
2504          F is inlined.
2505
2506          ??? This is likely no longer true, but it's too late in the 4.0
2507          cycle to try to find out.  This should be checked for 4.1.  */
2508       for (t = TYPE_FIELDS (node); t; t = TREE_CHAIN (t))
2509         if (variably_modified_type_p (TREE_TYPE (t), NULL))
2510           return node;
2511     }
2512
2513   return NULL_TREE;
2514 }
2515
2516
2517 /* Determine if the function can be copied.  If so return NULL.  If
2518    not return a string describng the reason for failure.  */
2519
2520 static const char *
2521 copy_forbidden (struct function *fun, tree fndecl)
2522 {
2523   const char *reason = fun->cannot_be_copied_reason;
2524   tree step;
2525
2526   /* Only examine the function once.  */
2527   if (fun->cannot_be_copied_set)
2528     return reason;
2529
2530   /* We cannot copy a function that receives a non-local goto
2531      because we cannot remap the destination label used in the
2532      function that is performing the non-local goto.  */
2533   /* ??? Actually, this should be possible, if we work at it.
2534      No doubt there's just a handful of places that simply
2535      assume it doesn't happen and don't substitute properly.  */
2536   if (fun->has_nonlocal_label)
2537     {
2538       reason = G_("function %q+F can never be copied "
2539                   "because it receives a non-local goto");
2540       goto fail;
2541     }
2542
2543   for (step = fun->local_decls; step; step = TREE_CHAIN (step))
2544     {
2545       tree decl = TREE_VALUE (step);
2546
2547       if (TREE_CODE (decl) == VAR_DECL
2548           && TREE_STATIC (decl)
2549           && !DECL_EXTERNAL (decl)
2550           && DECL_INITIAL (decl)
2551           && walk_tree_without_duplicates (&DECL_INITIAL (decl),
2552                                            has_label_address_in_static_1,
2553                                            fndecl))
2554         {
2555           reason = G_("function %q+F can never be copied because it saves "
2556                       "address of local label in a static variable");
2557           goto fail;
2558         }
2559
2560       if (!TREE_STATIC (decl) && !DECL_EXTERNAL (decl)
2561           && variably_modified_type_p (TREE_TYPE (decl), NULL)
2562           && walk_tree_without_duplicates (&TREE_TYPE (decl),
2563                                            cannot_copy_type_1, NULL))
2564         {
2565           reason = G_("function %q+F can never be copied "
2566                       "because it uses variable sized variables");
2567           goto fail;
2568         }
2569     }
2570
2571  fail:
2572   fun->cannot_be_copied_reason = reason;
2573   fun->cannot_be_copied_set = true;
2574   return reason;
2575 }
2576
2577
2578 static const char *inline_forbidden_reason;
2579
2580 /* A callback for walk_gimple_seq to handle statements.  Returns non-null
2581    iff a function can not be inlined.  Also sets the reason why. */
2582
2583 static tree
2584 inline_forbidden_p_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p,
2585                          struct walk_stmt_info *wip)
2586 {
2587   tree fn = (tree) wip->info;
2588   tree t;
2589   gimple stmt = gsi_stmt (*gsi);
2590
2591   switch (gimple_code (stmt))
2592     {
2593     case GIMPLE_CALL:
2594       /* Refuse to inline alloca call unless user explicitly forced so as
2595          this may change program's memory overhead drastically when the
2596          function using alloca is called in loop.  In GCC present in
2597          SPEC2000 inlining into schedule_block cause it to require 2GB of
2598          RAM instead of 256MB.  */
2599       if (gimple_alloca_call_p (stmt)
2600           && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
2601         {
2602           inline_forbidden_reason
2603             = G_("function %q+F can never be inlined because it uses "
2604                  "alloca (override using the always_inline attribute)");
2605           *handled_ops_p = true;
2606           return fn;
2607         }
2608
2609       t = gimple_call_fndecl (stmt);
2610       if (t == NULL_TREE)
2611         break;
2612
2613       /* We cannot inline functions that call setjmp.  */
2614       if (setjmp_call_p (t))
2615         {
2616           inline_forbidden_reason
2617             = G_("function %q+F can never be inlined because it uses setjmp");
2618           *handled_ops_p = true;
2619           return t;
2620         }
2621
2622       if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
2623         switch (DECL_FUNCTION_CODE (t))
2624           {
2625             /* We cannot inline functions that take a variable number of
2626                arguments.  */
2627           case BUILT_IN_VA_START:
2628           case BUILT_IN_NEXT_ARG:
2629           case BUILT_IN_VA_END:
2630             inline_forbidden_reason
2631               = G_("function %q+F can never be inlined because it "
2632                    "uses variable argument lists");
2633             *handled_ops_p = true;
2634             return t;
2635
2636           case BUILT_IN_LONGJMP:
2637             /* We can't inline functions that call __builtin_longjmp at
2638                all.  The non-local goto machinery really requires the
2639                destination be in a different function.  If we allow the
2640                function calling __builtin_longjmp to be inlined into the
2641                function calling __builtin_setjmp, Things will Go Awry.  */
2642             inline_forbidden_reason
2643               = G_("function %q+F can never be inlined because "
2644                    "it uses setjmp-longjmp exception handling");
2645             *handled_ops_p = true;
2646             return t;
2647
2648           case BUILT_IN_NONLOCAL_GOTO:
2649             /* Similarly.  */
2650             inline_forbidden_reason
2651               = G_("function %q+F can never be inlined because "
2652                    "it uses non-local goto");
2653             *handled_ops_p = true;
2654             return t;
2655
2656           case BUILT_IN_RETURN:
2657           case BUILT_IN_APPLY_ARGS:
2658             /* If a __builtin_apply_args caller would be inlined,
2659                it would be saving arguments of the function it has
2660                been inlined into.  Similarly __builtin_return would
2661                return from the function the inline has been inlined into.  */
2662             inline_forbidden_reason
2663               = G_("function %q+F can never be inlined because "
2664                    "it uses __builtin_return or __builtin_apply_args");
2665             *handled_ops_p = true;
2666             return t;
2667
2668           default:
2669             break;
2670           }
2671       break;
2672
2673     case GIMPLE_GOTO:
2674       t = gimple_goto_dest (stmt);
2675
2676       /* We will not inline a function which uses computed goto.  The
2677          addresses of its local labels, which may be tucked into
2678          global storage, are of course not constant across
2679          instantiations, which causes unexpected behavior.  */
2680       if (TREE_CODE (t) != LABEL_DECL)
2681         {
2682           inline_forbidden_reason
2683             = G_("function %q+F can never be inlined "
2684                  "because it contains a computed goto");
2685           *handled_ops_p = true;
2686           return t;
2687         }
2688       break;
2689
2690     default:
2691       break;
2692     }
2693
2694   *handled_ops_p = false;
2695   return NULL_TREE;
2696 }
2697
2698 /* Return true if FNDECL is a function that cannot be inlined into
2699    another one.  */
2700
2701 static bool
2702 inline_forbidden_p (tree fndecl)
2703 {
2704   struct function *fun = DECL_STRUCT_FUNCTION (fndecl);
2705   struct walk_stmt_info wi;
2706   struct pointer_set_t *visited_nodes;
2707   basic_block bb;
2708   bool forbidden_p = false;
2709
2710   /* First check for shared reasons not to copy the code.  */
2711   inline_forbidden_reason = copy_forbidden (fun, fndecl);
2712   if (inline_forbidden_reason != NULL)
2713     return true;
2714
2715   /* Next, walk the statements of the function looking for
2716      constraucts we can't handle, or are non-optimal for inlining.  */
2717   visited_nodes = pointer_set_create ();
2718   memset (&wi, 0, sizeof (wi));
2719   wi.info = (void *) fndecl;
2720   wi.pset = visited_nodes;
2721
2722   FOR_EACH_BB_FN (bb, fun)
2723     {
2724       gimple ret;
2725       gimple_seq seq = bb_seq (bb);
2726       ret = walk_gimple_seq (seq, inline_forbidden_p_stmt, NULL, &wi);
2727       forbidden_p = (ret != NULL);
2728       if (forbidden_p)
2729         break;
2730     }
2731
2732   pointer_set_destroy (visited_nodes);
2733   return forbidden_p;
2734 }
2735
2736 /* Returns nonzero if FN is a function that does not have any
2737    fundamental inline blocking properties.  */
2738
2739 bool
2740 tree_inlinable_function_p (tree fn)
2741 {
2742   bool inlinable = true;
2743   bool do_warning;
2744   tree always_inline;
2745
2746   /* If we've already decided this function shouldn't be inlined,
2747      there's no need to check again.  */
2748   if (DECL_UNINLINABLE (fn))
2749     return false;
2750
2751   /* We only warn for functions declared `inline' by the user.  */
2752   do_warning = (warn_inline
2753                 && DECL_DECLARED_INLINE_P (fn)
2754                 && !DECL_NO_INLINE_WARNING_P (fn)
2755                 && !DECL_IN_SYSTEM_HEADER (fn));
2756
2757   always_inline = lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn));
2758
2759   if (flag_no_inline
2760       && always_inline == NULL)
2761     {
2762       if (do_warning)
2763         warning (OPT_Winline, "function %q+F can never be inlined because it "
2764                  "is suppressed using -fno-inline", fn);
2765       inlinable = false;
2766     }
2767
2768   /* Don't auto-inline anything that might not be bound within
2769      this unit of translation.  */
2770   else if (!DECL_DECLARED_INLINE_P (fn)
2771            && DECL_REPLACEABLE_P (fn))
2772     inlinable = false;
2773
2774   else if (!function_attribute_inlinable_p (fn))
2775     {
2776       if (do_warning)
2777         warning (OPT_Winline, "function %q+F can never be inlined because it "
2778                  "uses attributes conflicting with inlining", fn);
2779       inlinable = false;
2780     }
2781
2782   else if (inline_forbidden_p (fn))
2783     {
2784       /* See if we should warn about uninlinable functions.  Previously,
2785          some of these warnings would be issued while trying to expand
2786          the function inline, but that would cause multiple warnings
2787          about functions that would for example call alloca.  But since
2788          this a property of the function, just one warning is enough.
2789          As a bonus we can now give more details about the reason why a
2790          function is not inlinable.  */
2791       if (always_inline)
2792         sorry (inline_forbidden_reason, fn);
2793       else if (do_warning)
2794         warning (OPT_Winline, inline_forbidden_reason, fn);
2795
2796       inlinable = false;
2797     }
2798
2799   /* Squirrel away the result so that we don't have to check again.  */
2800   DECL_UNINLINABLE (fn) = !inlinable;
2801
2802   return inlinable;
2803 }
2804
2805 /* Estimate the cost of a memory move.  Use machine dependent
2806    word size and take possible memcpy call into account.  */
2807
2808 int
2809 estimate_move_cost (tree type)
2810 {
2811   HOST_WIDE_INT size;
2812
2813   gcc_assert (!VOID_TYPE_P (type));
2814
2815   size = int_size_in_bytes (type);
2816
2817   if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO (!optimize_size))
2818     /* Cost of a memcpy call, 3 arguments and the call.  */
2819     return 4;
2820   else
2821     return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
2822 }
2823
2824 /* Returns cost of operation CODE, according to WEIGHTS  */
2825
2826 static int
2827 estimate_operator_cost (enum tree_code code, eni_weights *weights,
2828                         tree op1 ATTRIBUTE_UNUSED, tree op2)
2829 {
2830   switch (code)
2831     {
2832     /* These are "free" conversions, or their presumed cost
2833        is folded into other operations.  */
2834     case RANGE_EXPR:
2835     CASE_CONVERT:
2836     case COMPLEX_EXPR:
2837     case PAREN_EXPR:
2838       return 0;
2839
2840     /* Assign cost of 1 to usual operations.
2841        ??? We may consider mapping RTL costs to this.  */
2842     case COND_EXPR:
2843     case VEC_COND_EXPR:
2844
2845     case PLUS_EXPR:
2846     case POINTER_PLUS_EXPR:
2847     case MINUS_EXPR:
2848     case MULT_EXPR:
2849
2850     case FIXED_CONVERT_EXPR:
2851     case FIX_TRUNC_EXPR:
2852
2853     case NEGATE_EXPR:
2854     case FLOAT_EXPR:
2855     case MIN_EXPR:
2856     case MAX_EXPR:
2857     case ABS_EXPR:
2858
2859     case LSHIFT_EXPR:
2860     case RSHIFT_EXPR:
2861     case LROTATE_EXPR:
2862     case RROTATE_EXPR:
2863     case VEC_LSHIFT_EXPR:
2864     case VEC_RSHIFT_EXPR:
2865
2866     case BIT_IOR_EXPR:
2867     case BIT_XOR_EXPR:
2868     case BIT_AND_EXPR:
2869     case BIT_NOT_EXPR:
2870
2871     case TRUTH_ANDIF_EXPR:
2872     case TRUTH_ORIF_EXPR:
2873     case TRUTH_AND_EXPR:
2874     case TRUTH_OR_EXPR:
2875     case TRUTH_XOR_EXPR:
2876     case TRUTH_NOT_EXPR:
2877
2878     case LT_EXPR:
2879     case LE_EXPR:
2880     case GT_EXPR:
2881     case GE_EXPR:
2882     case EQ_EXPR:
2883     case NE_EXPR:
2884     case ORDERED_EXPR:
2885     case UNORDERED_EXPR:
2886
2887     case UNLT_EXPR:
2888     case UNLE_EXPR:
2889     case UNGT_EXPR:
2890     case UNGE_EXPR:
2891     case UNEQ_EXPR:
2892     case LTGT_EXPR:
2893
2894     case CONJ_EXPR:
2895
2896     case PREDECREMENT_EXPR:
2897     case PREINCREMENT_EXPR:
2898     case POSTDECREMENT_EXPR:
2899     case POSTINCREMENT_EXPR:
2900
2901     case REALIGN_LOAD_EXPR:
2902
2903     case REDUC_MAX_EXPR:
2904     case REDUC_MIN_EXPR:
2905     case REDUC_PLUS_EXPR:
2906     case WIDEN_SUM_EXPR:
2907     case WIDEN_MULT_EXPR:
2908     case DOT_PROD_EXPR:
2909
2910     case VEC_WIDEN_MULT_HI_EXPR:
2911     case VEC_WIDEN_MULT_LO_EXPR:
2912     case VEC_UNPACK_HI_EXPR:
2913     case VEC_UNPACK_LO_EXPR:
2914     case VEC_UNPACK_FLOAT_HI_EXPR:
2915     case VEC_UNPACK_FLOAT_LO_EXPR:
2916     case VEC_PACK_TRUNC_EXPR:
2917     case VEC_PACK_SAT_EXPR:
2918     case VEC_PACK_FIX_TRUNC_EXPR:
2919     case VEC_EXTRACT_EVEN_EXPR:
2920     case VEC_EXTRACT_ODD_EXPR:
2921     case VEC_INTERLEAVE_HIGH_EXPR:
2922     case VEC_INTERLEAVE_LOW_EXPR:
2923
2924       return 1;
2925
2926     /* Few special cases of expensive operations.  This is useful
2927        to avoid inlining on functions having too many of these.  */
2928     case TRUNC_DIV_EXPR:
2929     case CEIL_DIV_EXPR:
2930     case FLOOR_DIV_EXPR:
2931     case ROUND_DIV_EXPR:
2932     case EXACT_DIV_EXPR:
2933     case TRUNC_MOD_EXPR:
2934     case CEIL_MOD_EXPR:
2935     case FLOOR_MOD_EXPR:
2936     case ROUND_MOD_EXPR:
2937     case RDIV_EXPR:
2938       if (TREE_CODE (op2) != INTEGER_CST)
2939         return weights->div_mod_cost;
2940       return 1;
2941
2942     default:
2943       /* We expect a copy assignment with no operator.  */
2944       gcc_assert (get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS);
2945       return 0;
2946     }
2947 }
2948
2949
2950 /* Estimate number of instructions that will be created by expanding
2951    the statements in the statement sequence STMTS.
2952    WEIGHTS contains weights attributed to various constructs.  */
2953
2954 static
2955 int estimate_num_insns_seq (gimple_seq stmts, eni_weights *weights)
2956 {
2957   int cost;
2958   gimple_stmt_iterator gsi;
2959
2960   cost = 0;
2961   for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi))
2962     cost += estimate_num_insns (gsi_stmt (gsi), weights);
2963
2964   return cost;
2965 }
2966
2967
2968 /* Estimate number of instructions that will be created by expanding STMT.
2969    WEIGHTS contains weights attributed to various constructs.  */
2970
2971 int
2972 estimate_num_insns (gimple stmt, eni_weights *weights)
2973 {
2974   unsigned cost, i;
2975   enum gimple_code code = gimple_code (stmt);
2976   tree lhs;
2977   tree rhs;
2978
2979   switch (code)
2980     {
2981     case GIMPLE_ASSIGN:
2982       /* Try to estimate the cost of assignments.  We have three cases to
2983          deal with:
2984          1) Simple assignments to registers;
2985          2) Stores to things that must live in memory.  This includes
2986             "normal" stores to scalars, but also assignments of large
2987             structures, or constructors of big arrays;
2988
2989          Let us look at the first two cases, assuming we have "a = b + C":
2990          <GIMPLE_ASSIGN <var_decl "a">
2991                 <plus_expr <var_decl "b"> <constant C>>
2992          If "a" is a GIMPLE register, the assignment to it is free on almost
2993          any target, because "a" usually ends up in a real register.  Hence
2994          the only cost of this expression comes from the PLUS_EXPR, and we
2995          can ignore the GIMPLE_ASSIGN.
2996          If "a" is not a GIMPLE register, the assignment to "a" will most
2997          likely be a real store, so the cost of the GIMPLE_ASSIGN is the cost
2998          of moving something into "a", which we compute using the function
2999          estimate_move_cost.  */
3000       lhs = gimple_assign_lhs (stmt);
3001       rhs = gimple_assign_rhs1 (stmt);
3002
3003       /* EH magic stuff is most probably going to be optimized out.
3004          We rarely really need to save EH info for unwinding
3005          nested exceptions.  */
3006       if (TREE_CODE (lhs) == FILTER_EXPR
3007           || TREE_CODE (lhs) == EXC_PTR_EXPR
3008           || TREE_CODE (rhs) == FILTER_EXPR
3009           || TREE_CODE (rhs) == EXC_PTR_EXPR)
3010         return 0;
3011       if (is_gimple_reg (lhs))
3012         cost = 0;
3013       else
3014         cost = estimate_move_cost (TREE_TYPE (lhs));
3015
3016       if (!is_gimple_reg (rhs) && !is_gimple_min_invariant (rhs))
3017         cost += estimate_move_cost (TREE_TYPE (rhs));
3018
3019       cost += estimate_operator_cost (gimple_assign_rhs_code (stmt), weights,
3020                                       gimple_assign_rhs1 (stmt),
3021                                       get_gimple_rhs_class (gimple_assign_rhs_code (stmt))
3022                                       == GIMPLE_BINARY_RHS
3023                                       ? gimple_assign_rhs2 (stmt) : NULL);
3024       break;
3025
3026     case GIMPLE_COND:
3027       cost = 1 + estimate_operator_cost (gimple_cond_code (stmt), weights,
3028                                          gimple_op (stmt, 0),
3029                                          gimple_op (stmt, 1));
3030       break;
3031
3032     case GIMPLE_SWITCH:
3033       /* Take into account cost of the switch + guess 2 conditional jumps for
3034          each case label.
3035
3036          TODO: once the switch expansion logic is sufficiently separated, we can
3037          do better job on estimating cost of the switch.  */
3038       if (weights->time_based)
3039         cost = floor_log2 (gimple_switch_num_labels (stmt)) * 2;
3040       else
3041         cost = gimple_switch_num_labels (stmt) * 2;
3042       break;
3043
3044     case GIMPLE_CALL:
3045       {
3046         tree decl = gimple_call_fndecl (stmt);
3047         tree addr = gimple_call_fn (stmt);
3048         tree funtype = TREE_TYPE (addr);
3049
3050         if (POINTER_TYPE_P (funtype))
3051           funtype = TREE_TYPE (funtype);
3052
3053         if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
3054           cost = weights->target_builtin_call_cost;
3055         else
3056           cost = weights->call_cost;
3057
3058         if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
3059           switch (DECL_FUNCTION_CODE (decl))
3060             {
3061             case BUILT_IN_CONSTANT_P:
3062               return 0;
3063             case BUILT_IN_EXPECT:
3064               return 0;
3065
3066             /* Prefetch instruction is not expensive.  */
3067             case BUILT_IN_PREFETCH:
3068               cost = weights->target_builtin_call_cost;
3069               break;
3070
3071             default:
3072               break;
3073             }
3074
3075         if (decl)
3076           funtype = TREE_TYPE (decl);
3077
3078         if (!VOID_TYPE_P (TREE_TYPE (funtype)))
3079           cost += estimate_move_cost (TREE_TYPE (funtype));
3080         /* Our cost must be kept in sync with
3081            cgraph_estimate_size_after_inlining that does use function
3082            declaration to figure out the arguments.  */
3083         if (decl && DECL_ARGUMENTS (decl))
3084           {
3085             tree arg;
3086             for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
3087               if (!VOID_TYPE_P (TREE_TYPE (arg)))
3088                 cost += estimate_move_cost (TREE_TYPE (arg));
3089           }
3090         else if (funtype && prototype_p (funtype))
3091           {
3092             tree t;
3093             for (t = TYPE_ARG_TYPES (funtype); t && t != void_list_node;
3094                  t = TREE_CHAIN (t))
3095               if (!VOID_TYPE_P (TREE_VALUE (t)))
3096                 cost += estimate_move_cost (TREE_VALUE (t));
3097           }
3098         else
3099           {
3100             for (i = 0; i < gimple_call_num_args (stmt); i++)
3101               {
3102                 tree arg = gimple_call_arg (stmt, i);
3103                 if (!VOID_TYPE_P (TREE_TYPE (arg)))
3104                   cost += estimate_move_cost (TREE_TYPE (arg));
3105               }
3106           }
3107
3108         break;
3109       }
3110
3111     case GIMPLE_GOTO:
3112     case GIMPLE_LABEL:
3113     case GIMPLE_NOP:
3114     case GIMPLE_PHI:
3115     case GIMPLE_RETURN:
3116     case GIMPLE_PREDICT:
3117       return 0;
3118
3119     case GIMPLE_ASM:
3120     case GIMPLE_RESX:
3121       return 1;
3122
3123     case GIMPLE_BIND:
3124       return estimate_num_insns_seq (gimple_bind_body (stmt), weights);
3125
3126     case GIMPLE_EH_FILTER:
3127       return estimate_num_insns_seq (gimple_eh_filter_failure (stmt), weights);
3128
3129     case GIMPLE_CATCH:
3130       return estimate_num_insns_seq (gimple_catch_handler (stmt), weights);
3131
3132     case GIMPLE_TRY:
3133       return (estimate_num_insns_seq (gimple_try_eval (stmt), weights)
3134               + estimate_num_insns_seq (gimple_try_cleanup (stmt), weights));
3135
3136     /* OpenMP directives are generally very expensive.  */
3137
3138     case GIMPLE_OMP_RETURN:
3139     case GIMPLE_OMP_SECTIONS_SWITCH:
3140     case GIMPLE_OMP_ATOMIC_STORE:
3141     case GIMPLE_OMP_CONTINUE:
3142       /* ...except these, which are cheap.  */
3143       return 0;
3144
3145     case GIMPLE_OMP_ATOMIC_LOAD:
3146       return weights->omp_cost;
3147
3148     case GIMPLE_OMP_FOR:
3149       return (weights->omp_cost
3150               + estimate_num_insns_seq (gimple_omp_body (stmt), weights)
3151               + estimate_num_insns_seq (gimple_omp_for_pre_body (stmt), weights));
3152
3153     case GIMPLE_OMP_PARALLEL:
3154     case GIMPLE_OMP_TASK:
3155     case GIMPLE_OMP_CRITICAL:
3156     case GIMPLE_OMP_MASTER:
3157     case GIMPLE_OMP_ORDERED:
3158     case GIMPLE_OMP_SECTION:
3159     case GIMPLE_OMP_SECTIONS:
3160     case GIMPLE_OMP_SINGLE:
3161       return (weights->omp_cost
3162               + estimate_num_insns_seq (gimple_omp_body (stmt), weights));
3163
3164     default:
3165       gcc_unreachable ();
3166     }
3167
3168   return cost;
3169 }
3170
3171 /* Estimate number of instructions that will be created by expanding
3172    function FNDECL.  WEIGHTS contains weights attributed to various
3173    constructs.  */
3174
3175 int
3176 estimate_num_insns_fn (tree fndecl, eni_weights *weights)
3177 {
3178   struct function *my_function = DECL_STRUCT_FUNCTION (fndecl);
3179   gimple_stmt_iterator bsi;
3180   basic_block bb;
3181   int n = 0;
3182
3183   gcc_assert (my_function && my_function->cfg);
3184   FOR_EACH_BB_FN (bb, my_function)
3185     {
3186       for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
3187         n += estimate_num_insns (gsi_stmt (bsi), weights);
3188     }
3189
3190   return n;
3191 }
3192
3193
3194 /* Initializes weights used by estimate_num_insns.  */
3195
3196 void
3197 init_inline_once (void)
3198 {
3199   eni_size_weights.call_cost = 1;
3200   eni_size_weights.target_builtin_call_cost = 1;
3201   eni_size_weights.div_mod_cost = 1;
3202   eni_size_weights.omp_cost = 40;
3203   eni_size_weights.time_based = false;
3204
3205   /* Estimating time for call is difficult, since we have no idea what the
3206      called function does.  In the current uses of eni_time_weights,
3207      underestimating the cost does less harm than overestimating it, so
3208      we choose a rather small value here.  */
3209   eni_time_weights.call_cost = 10;
3210   eni_time_weights.target_builtin_call_cost = 10;
3211   eni_time_weights.div_mod_cost = 10;
3212   eni_time_weights.omp_cost = 40;
3213   eni_time_weights.time_based = true;
3214 }
3215
3216 /* Estimate the number of instructions in a gimple_seq. */
3217
3218 int
3219 count_insns_seq (gimple_seq seq, eni_weights *weights)
3220 {
3221   gimple_stmt_iterator gsi;
3222   int n = 0;
3223   for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi))
3224     n += estimate_num_insns (gsi_stmt (gsi), weights);
3225
3226   return n;
3227 }
3228
3229
3230 /* Install new lexical TREE_BLOCK underneath 'current_block'.  */
3231
3232 static void
3233 prepend_lexical_block (tree current_block, tree new_block)
3234 {
3235   BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (current_block);
3236   BLOCK_SUBBLOCKS (current_block) = new_block;
3237   BLOCK_SUPERCONTEXT (new_block) = current_block;
3238 }
3239
3240 /* Fetch callee declaration from the call graph edge going from NODE and
3241    associated with STMR call statement.  Return NULL_TREE if not found.  */
3242 static tree
3243 get_indirect_callee_fndecl (struct cgraph_node *node, gimple stmt)
3244 {
3245   struct cgraph_edge *cs;
3246
3247   cs = cgraph_edge (node, stmt);
3248   if (cs)
3249     return cs->callee->decl;
3250
3251   return NULL_TREE;
3252 }
3253
3254 /* If STMT is a GIMPLE_CALL, replace it with its inline expansion.  */
3255
3256 static bool
3257 expand_call_inline (basic_block bb, gimple stmt, copy_body_data *id)
3258 {
3259   tree retvar, use_retvar;
3260   tree fn;
3261   struct pointer_map_t *st;
3262   tree return_slot;
3263   tree modify_dest;
3264   location_t saved_location;
3265   struct cgraph_edge *cg_edge;
3266   cgraph_inline_failed_t reason;
3267   basic_block return_block;
3268   edge e;
3269   gimple_stmt_iterator gsi, stmt_gsi;
3270   bool successfully_inlined = FALSE;
3271   bool purge_dead_abnormal_edges;
3272   tree t_step;
3273   tree var;
3274
3275   /* Set input_location here so we get the right instantiation context
3276      if we call instantiate_decl from inlinable_function_p.  */
3277   saved_location = input_location;
3278   if (gimple_has_location (stmt))
3279     input_location = gimple_location (stmt);
3280
3281   /* From here on, we're only interested in CALL_EXPRs.  */
3282   if (gimple_code (stmt) != GIMPLE_CALL)
3283     goto egress;
3284
3285   /* First, see if we can figure out what function is being called.
3286      If we cannot, then there is no hope of inlining the function.  */
3287   fn = gimple_call_fndecl (stmt);
3288   if (!fn)
3289     {
3290       fn = get_indirect_callee_fndecl (id->dst_node, stmt);
3291       if (!fn)
3292         goto egress;
3293     }
3294
3295   /* Turn forward declarations into real ones.  */
3296   fn = cgraph_node (fn)->decl;
3297
3298   /* If FN is a declaration of a function in a nested scope that was
3299      globally declared inline, we don't set its DECL_INITIAL.
3300      However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
3301      C++ front-end uses it for cdtors to refer to their internal
3302      declarations, that are not real functions.  Fortunately those
3303      don't have trees to be saved, so we can tell by checking their
3304      gimple_body.  */
3305   if (!DECL_INITIAL (fn)
3306       && DECL_ABSTRACT_ORIGIN (fn)
3307       && gimple_has_body_p (DECL_ABSTRACT_ORIGIN (fn)))
3308     fn = DECL_ABSTRACT_ORIGIN (fn);
3309
3310   /* Objective C and fortran still calls tree_rest_of_compilation directly.
3311      Kill this check once this is fixed.  */
3312   if (!id->dst_node->analyzed)
3313     goto egress;
3314
3315   cg_edge = cgraph_edge (id->dst_node, stmt);
3316
3317   /* Don't try to inline functions that are not well-suited to
3318      inlining.  */
3319   if (!cgraph_inline_p (cg_edge, &reason))
3320     {
3321       /* If this call was originally indirect, we do not want to emit any
3322          inlining related warnings or sorry messages because there are no
3323          guarantees regarding those.  */
3324       if (cg_edge->indirect_call)
3325         goto egress;
3326
3327       if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
3328           /* Avoid warnings during early inline pass. */
3329           && cgraph_global_info_ready)
3330         {
3331           sorry ("inlining failed in call to %q+F: %s", fn,
3332                  cgraph_inline_failed_string (reason));
3333           sorry ("called from here");
3334         }
3335       else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
3336                && !DECL_IN_SYSTEM_HEADER (fn)
3337                && reason != CIF_UNSPECIFIED
3338                && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
3339                /* Avoid warnings during early inline pass. */
3340                && cgraph_global_info_ready)
3341         {
3342           warning (OPT_Winline, "inlining failed in call to %q+F: %s",
3343                    fn, cgraph_inline_failed_string (reason));
3344           warning (OPT_Winline, "called from here");
3345         }
3346       goto egress;
3347     }
3348   fn = cg_edge->callee->decl;
3349
3350 #ifdef ENABLE_CHECKING
3351   if (cg_edge->callee->decl != id->dst_node->decl)
3352     verify_cgraph_node (cg_edge->callee);
3353 #endif
3354
3355   /* We will be inlining this callee.  */
3356   id->eh_region = lookup_stmt_eh_region (stmt);
3357
3358   /* Split the block holding the GIMPLE_CALL.  */
3359   e = split_block (bb, stmt);
3360   bb = e->src;
3361   return_block = e->dest;
3362   remove_edge (e);
3363
3364   /* split_block splits after the statement; work around this by
3365      moving the call into the second block manually.  Not pretty,
3366      but seems easier than doing the CFG manipulation by hand
3367      when the GIMPLE_CALL is in the last statement of BB.  */
3368   stmt_gsi = gsi_last_bb (bb);
3369   gsi_remove (&stmt_gsi, false);
3370
3371   /* If the GIMPLE_CALL was in the last statement of BB, it may have
3372      been the source of abnormal edges.  In this case, schedule
3373      the removal of dead abnormal edges.  */
3374   gsi = gsi_start_bb (return_block);
3375   if (gsi_end_p (gsi))
3376     {
3377       gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
3378       purge_dead_abnormal_edges = true;
3379     }
3380   else
3381     {
3382       gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
3383       purge_dead_abnormal_edges = false;
3384     }
3385
3386   stmt_gsi = gsi_start_bb (return_block);
3387
3388   /* Build a block containing code to initialize the arguments, the
3389      actual inline expansion of the body, and a label for the return
3390      statements within the function to jump to.  The type of the
3391      statement expression is the return type of the function call.  */
3392   id->block = make_node (BLOCK);
3393   BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
3394   BLOCK_SOURCE_LOCATION (id->block) = input_location;
3395   prepend_lexical_block (gimple_block (stmt), id->block);
3396
3397   /* Local declarations will be replaced by their equivalents in this
3398      map.  */
3399   st = id->decl_map;
3400   id->decl_map = pointer_map_create ();
3401
3402   /* Record the function we are about to inline.  */
3403   id->src_fn = fn;
3404   id->src_node = cg_edge->callee;
3405   id->src_cfun = DECL_STRUCT_FUNCTION (fn);
3406   id->gimple_call = stmt;
3407
3408   gcc_assert (!id->src_cfun->after_inlining);
3409
3410   id->entry_bb = bb;
3411   if (lookup_attribute ("cold", DECL_ATTRIBUTES (fn)))
3412     {
3413       gimple_stmt_iterator si = gsi_last_bb (bb);
3414       gsi_insert_after (&si, gimple_build_predict (PRED_COLD_FUNCTION,
3415                                                    NOT_TAKEN),
3416                         GSI_NEW_STMT);
3417     }
3418   initialize_inlined_parameters (id, stmt, fn, bb);
3419
3420   if (DECL_INITIAL (fn))
3421     prepend_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
3422
3423   /* Return statements in the function body will be replaced by jumps
3424      to the RET_LABEL.  */
3425   gcc_assert (DECL_INITIAL (fn));
3426   gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
3427
3428   /* Find the LHS to which the result of this call is assigned.  */
3429   return_slot = NULL;
3430   if (gimple_call_lhs (stmt))
3431     {
3432       modify_dest = gimple_call_lhs (stmt);
3433
3434       /* The function which we are inlining might not return a value,
3435          in which case we should issue a warning that the function
3436          does not return a value.  In that case the optimizers will
3437          see that the variable to which the value is assigned was not
3438          initialized.  We do not want to issue a warning about that
3439          uninitialized variable.  */
3440       if (DECL_P (modify_dest))
3441         TREE_NO_WARNING (modify_dest) = 1;
3442
3443       if (gimple_call_return_slot_opt_p (stmt))
3444         {
3445           return_slot = modify_dest;
3446           modify_dest = NULL;
3447         }
3448     }
3449   else
3450     modify_dest = NULL;
3451
3452   /* If we are inlining a call to the C++ operator new, we don't want
3453      to use type based alias analysis on the return value.  Otherwise
3454      we may get confused if the compiler sees that the inlined new
3455      function returns a pointer which was just deleted.  See bug
3456      33407.  */
3457   if (DECL_IS_OPERATOR_NEW (fn))
3458     {
3459       return_slot = NULL;
3460       modify_dest = NULL;
3461     }
3462
3463   /* Declare the return variable for the function.  */
3464   retvar = declare_return_variable (id, return_slot, modify_dest, &use_retvar);
3465
3466   /* Add local vars in this inlined callee to caller.  */
3467   t_step = id->src_cfun->local_decls;
3468   for (; t_step; t_step = TREE_CHAIN (t_step))
3469     {
3470       var = TREE_VALUE (t_step);
3471       if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
3472         {
3473           if (var_ann (var) && add_referenced_var (var))
3474             cfun->local_decls = tree_cons (NULL_TREE, var,
3475                                            cfun->local_decls);
3476         }
3477       else if (!can_be_nonlocal (var, id))
3478         cfun->local_decls = tree_cons (NULL_TREE, remap_decl (var, id),
3479                                        cfun->local_decls);
3480     }
3481
3482   /* This is it.  Duplicate the callee body.  Assume callee is
3483      pre-gimplified.  Note that we must not alter the caller
3484      function in any way before this point, as this CALL_EXPR may be
3485      a self-referential call; if we're calling ourselves, we need to
3486      duplicate our body before altering anything.  */
3487   copy_body (id, bb->count, bb->frequency, bb, return_block);
3488
3489   /* Reset the escaped and callused solutions.  */
3490   if (cfun->gimple_df)
3491     {
3492       pt_solution_reset (&cfun->gimple_df->escaped);
3493       pt_solution_reset (&cfun->gimple_df->callused);
3494     }
3495
3496   /* Clean up.  */
3497   pointer_map_destroy (id->decl_map);
3498   id->decl_map = st;
3499
3500   /* Unlink the calls virtual operands before replacing it.  */
3501   unlink_stmt_vdef (stmt);
3502
3503   /* If the inlined function returns a result that we care about,
3504      substitute the GIMPLE_CALL with an assignment of the return
3505      variable to the LHS of the call.  That is, if STMT was
3506      'a = foo (...)', substitute the call with 'a = USE_RETVAR'.  */
3507   if (use_retvar && gimple_call_lhs (stmt))
3508     {
3509       gimple old_stmt = stmt;
3510       stmt = gimple_build_assign (gimple_call_lhs (stmt), use_retvar);
3511       gsi_replace (&stmt_gsi, stmt, false);
3512       if (gimple_in_ssa_p (cfun))
3513         mark_symbols_for_renaming (stmt);
3514       maybe_clean_or_replace_eh_stmt (old_stmt, stmt);
3515     }
3516   else
3517     {
3518       /* Handle the case of inlining a function with no return
3519          statement, which causes the return value to become undefined.  */
3520       if (gimple_call_lhs (stmt)
3521           && TREE_CODE (gimple_call_lhs (stmt)) == SSA_NAME)
3522         {
3523           tree name = gimple_call_lhs (stmt);
3524           tree var = SSA_NAME_VAR (name);
3525           tree def = gimple_default_def (cfun, var);
3526
3527           if (def)
3528             {
3529               /* If the variable is used undefined, make this name
3530                  undefined via a move.  */
3531               stmt = gimple_build_assign (gimple_call_lhs (stmt), def);
3532               gsi_replace (&stmt_gsi, stmt, true);
3533             }
3534           else
3535             {
3536               /* Otherwise make this variable undefined.  */
3537               gsi_remove (&stmt_gsi, true);
3538               set_default_def (var, name);
3539               SSA_NAME_DEF_STMT (name) = gimple_build_nop ();
3540             }
3541         }
3542       else
3543         gsi_remove (&stmt_gsi, true);
3544     }
3545
3546   if (purge_dead_abnormal_edges)
3547     gimple_purge_dead_abnormal_call_edges (return_block);
3548
3549   /* If the value of the new expression is ignored, that's OK.  We
3550      don't warn about this for CALL_EXPRs, so we shouldn't warn about
3551      the equivalent inlined version either.  */
3552   if (is_gimple_assign (stmt))
3553     {
3554       gcc_assert (gimple_assign_single_p (stmt)
3555                   || CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt)));
3556       TREE_USED (gimple_assign_rhs1 (stmt)) = 1;
3557     }
3558
3559   /* Output the inlining info for this abstract function, since it has been
3560      inlined.  If we don't do this now, we can lose the information about the
3561      variables in the function when the blocks get blown away as soon as we
3562      remove the cgraph node.  */
3563   (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
3564
3565   /* Update callgraph if needed.  */
3566   cgraph_remove_node (cg_edge->callee);
3567
3568   id->block = NULL_TREE;
3569   successfully_inlined = TRUE;
3570
3571  egress:
3572   input_location = saved_location;
3573   return successfully_inlined;
3574 }
3575
3576 /* Expand call statements reachable from STMT_P.
3577    We can only have CALL_EXPRs as the "toplevel" tree code or nested
3578    in a MODIFY_EXPR.  See tree-gimple.c:get_call_expr_in().  We can
3579    unfortunately not use that function here because we need a pointer
3580    to the CALL_EXPR, not the tree itself.  */
3581
3582 static bool
3583 gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
3584 {
3585   gimple_stmt_iterator gsi;
3586
3587   for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
3588     {
3589       gimple stmt = gsi_stmt (gsi);
3590
3591       if (is_gimple_call (stmt)
3592           && expand_call_inline (bb, stmt, id))
3593         return true;
3594     }
3595
3596   return false;
3597 }
3598
3599
3600 /* Walk all basic blocks created after FIRST and try to fold every statement
3601    in the STATEMENTS pointer set.  */
3602
3603 static void
3604 fold_marked_statements (int first, struct pointer_set_t *statements)
3605 {
3606   for (; first < n_basic_blocks; first++)
3607     if (BASIC_BLOCK (first))
3608       {
3609         gimple_stmt_iterator gsi;
3610
3611         for (gsi = gsi_start_bb (BASIC_BLOCK (first));
3612              !gsi_end_p (gsi);
3613              gsi_next (&gsi))
3614           if (pointer_set_contains (statements, gsi_stmt (gsi)))
3615             {
3616               gimple old_stmt = gsi_stmt (gsi);
3617               tree old_decl = is_gimple_call (old_stmt) ? gimple_call_fndecl (old_stmt) : 0;
3618
3619               if (fold_stmt (&gsi))
3620                 {
3621                   /* Re-read the statement from GSI as fold_stmt() may
3622                      have changed it.  */
3623                   gimple new_stmt = gsi_stmt (gsi);
3624                   update_stmt (new_stmt);
3625
3626                   if (is_gimple_call (old_stmt)
3627                       || is_gimple_call (new_stmt))
3628                     cgraph_update_edges_for_call_stmt (old_stmt, old_decl, new_stmt);
3629
3630                   if (maybe_clean_or_replace_eh_stmt (old_stmt, new_stmt))
3631                     gimple_purge_dead_eh_edges (BASIC_BLOCK (first));
3632                 }
3633             }
3634       }
3635 }
3636
3637 /* Return true if BB has at least one abnormal outgoing edge.  */
3638
3639 static inline bool
3640 has_abnormal_outgoing_edge_p (basic_block bb)
3641 {
3642   edge e;
3643   edge_iterator ei;
3644
3645   FOR_EACH_EDGE (e, ei, bb->succs)
3646     if (e->flags & EDGE_ABNORMAL)
3647       return true;
3648
3649   return false;
3650 }
3651
3652 /* Expand calls to inline functions in the body of FN.  */
3653
3654 unsigned int
3655 optimize_inline_calls (tree fn)
3656 {
3657   copy_body_data id;
3658   tree prev_fn;
3659   basic_block bb;
3660   int last = n_basic_blocks;
3661   struct gimplify_ctx gctx;
3662
3663   /* There is no point in performing inlining if errors have already
3664      occurred -- and we might crash if we try to inline invalid
3665      code.  */
3666   if (errorcount || sorrycount)
3667     return 0;
3668
3669   /* Clear out ID.  */
3670   memset (&id, 0, sizeof (id));
3671
3672   id.src_node = id.dst_node = cgraph_node (fn);
3673   id.dst_fn = fn;
3674   /* Or any functions that aren't finished yet.  */
3675   prev_fn = NULL_TREE;
3676   if (current_function_decl)
3677     {
3678       id.dst_fn = current_function_decl;
3679       prev_fn = current_function_decl;
3680     }
3681
3682   id.copy_decl = copy_decl_maybe_to_var;
3683   id.transform_call_graph_edges = CB_CGE_DUPLICATE;
3684   id.transform_new_cfg = false;
3685   id.transform_return_to_modify = true;
3686   id.transform_lang_insert_block = NULL;
3687   id.statements_to_fold = pointer_set_create ();
3688
3689   push_gimplify_context (&gctx);
3690
3691   /* We make no attempts to keep dominance info up-to-date.  */
3692   free_dominance_info (CDI_DOMINATORS);
3693   free_dominance_info (CDI_POST_DOMINATORS);
3694
3695   /* Register specific gimple functions.  */
3696   gimple_register_cfg_hooks ();
3697
3698   /* Reach the trees by walking over the CFG, and note the
3699      enclosing basic-blocks in the call edges.  */
3700   /* We walk the blocks going forward, because inlined function bodies
3701      will split id->current_basic_block, and the new blocks will
3702      follow it; we'll trudge through them, processing their CALL_EXPRs
3703      along the way.  */
3704   FOR_EACH_BB (bb)
3705     gimple_expand_calls_inline (bb, &id);
3706
3707   pop_gimplify_context (NULL);
3708
3709 #ifdef ENABLE_CHECKING
3710     {
3711       struct cgraph_edge *e;
3712
3713       verify_cgraph_node (id.dst_node);
3714
3715       /* Double check that we inlined everything we are supposed to inline.  */
3716       for (e = id.dst_node->callees; e; e = e->next_callee)
3717         gcc_assert (e->inline_failed);
3718     }
3719 #endif
3720
3721   /* Fold the statements before compacting/renumbering the basic blocks.  */
3722   fold_marked_statements (last, id.statements_to_fold);
3723   pointer_set_destroy (id.statements_to_fold);
3724
3725   /* Renumber the (code) basic_blocks consecutively.  */
3726   compact_blocks ();
3727   /* Renumber the lexical scoping (non-code) blocks consecutively.  */
3728   number_blocks (fn);
3729
3730   fold_cond_expr_cond ();
3731   delete_unreachable_blocks_update_callgraph (&id);
3732 #ifdef ENABLE_CHECKING
3733   verify_cgraph_node (id.dst_node);
3734 #endif
3735
3736   /* It would be nice to check SSA/CFG/statement consistency here, but it is
3737      not possible yet - the IPA passes might make various functions to not
3738      throw and they don't care to proactively update local EH info.  This is
3739      done later in fixup_cfg pass that also execute the verification.  */
3740   return (TODO_update_ssa
3741           | TODO_cleanup_cfg
3742           | (gimple_in_ssa_p (cfun) ? TODO_remove_unused_locals : 0)
3743           | (profile_status != PROFILE_ABSENT ? TODO_rebuild_frequencies : 0));
3744 }
3745
3746 /* Passed to walk_tree.  Copies the node pointed to, if appropriate.  */
3747
3748 tree
3749 copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
3750 {
3751   enum tree_code code = TREE_CODE (*tp);
3752   enum tree_code_class cl = TREE_CODE_CLASS (code);
3753
3754   /* We make copies of most nodes.  */
3755   if (IS_EXPR_CODE_CLASS (cl)
3756       || code == TREE_LIST
3757       || code == TREE_VEC
3758       || code == TYPE_DECL
3759       || code == OMP_CLAUSE)
3760     {
3761       /* Because the chain gets clobbered when we make a copy, we save it
3762          here.  */
3763       tree chain = NULL_TREE, new_tree;
3764
3765       chain = TREE_CHAIN (*tp);
3766
3767       /* Copy the node.  */
3768       new_tree = copy_node (*tp);
3769
3770       /* Propagate mudflap marked-ness.  */
3771       if (flag_mudflap && mf_marked_p (*tp))
3772         mf_mark (new_tree);
3773
3774       *tp = new_tree;
3775
3776       /* Now, restore the chain, if appropriate.  That will cause
3777          walk_tree to walk into the chain as well.  */
3778       if (code == PARM_DECL
3779           || code == TREE_LIST
3780           || code == OMP_CLAUSE)
3781         TREE_CHAIN (*tp) = chain;
3782
3783       /* For now, we don't update BLOCKs when we make copies.  So, we
3784          have to nullify all BIND_EXPRs.  */
3785       if (TREE_CODE (*tp) == BIND_EXPR)
3786         BIND_EXPR_BLOCK (*tp) = NULL_TREE;
3787     }
3788   else if (code == CONSTRUCTOR)
3789     {
3790       /* CONSTRUCTOR nodes need special handling because
3791          we need to duplicate the vector of elements.  */
3792       tree new_tree;
3793
3794       new_tree = copy_node (*tp);
3795
3796       /* Propagate mudflap marked-ness.  */
3797       if (flag_mudflap && mf_marked_p (*tp))
3798         mf_mark (new_tree);
3799
3800       CONSTRUCTOR_ELTS (new_tree) = VEC_copy (constructor_elt, gc,
3801                                          CONSTRUCTOR_ELTS (*tp));
3802       *tp = new_tree;
3803     }
3804   else if (TREE_CODE_CLASS (code) == tcc_type)
3805     *walk_subtrees = 0;
3806   else if (TREE_CODE_CLASS (code) == tcc_declaration)
3807     *walk_subtrees = 0;
3808   else if (TREE_CODE_CLASS (code) == tcc_constant)
3809     *walk_subtrees = 0;
3810   else
3811     gcc_assert (code != STATEMENT_LIST);
3812   return NULL_TREE;
3813 }
3814
3815 /* The SAVE_EXPR pointed to by TP is being copied.  If ST contains
3816    information indicating to what new SAVE_EXPR this one should be mapped,
3817    use that one.  Otherwise, create a new node and enter it in ST.  FN is
3818    the function into which the copy will be placed.  */
3819
3820 static void
3821 remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
3822 {
3823   struct pointer_map_t *st = (struct pointer_map_t *) st_;
3824   tree *n;
3825   tree t;
3826
3827   /* See if we already encountered this SAVE_EXPR.  */
3828   n = (tree *) pointer_map_contains (st, *tp);
3829
3830   /* If we didn't already remap this SAVE_EXPR, do so now.  */
3831   if (!n)
3832     {
3833       t = copy_node (*tp);
3834
3835       /* Remember this SAVE_EXPR.  */
3836       *pointer_map_insert (st, *tp) = t;
3837       /* Make sure we don't remap an already-remapped SAVE_EXPR.  */
3838       *pointer_map_insert (st, t) = t;
3839     }
3840   else
3841     {
3842       /* We've already walked into this SAVE_EXPR; don't do it again.  */
3843       *walk_subtrees = 0;
3844       t = *n;
3845     }
3846
3847   /* Replace this SAVE_EXPR with the copy.  */
3848   *tp = t;
3849 }
3850
3851 /* Called via walk_tree.  If *TP points to a DECL_STMT for a local label,
3852    copies the declaration and enters it in the splay_tree in DATA (which is
3853    really an `copy_body_data *').  */
3854
3855 static tree
3856 mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
3857                         void *data)
3858 {
3859   copy_body_data *id = (copy_body_data *) data;
3860
3861   /* Don't walk into types.  */
3862   if (TYPE_P (*tp))
3863     *walk_subtrees = 0;
3864
3865   else if (TREE_CODE (*tp) == LABEL_EXPR)
3866     {
3867       tree decl = TREE_OPERAND (*tp, 0);
3868
3869       /* Copy the decl and remember the copy.  */
3870       insert_decl_map (id, decl, id->copy_decl (decl, id));
3871     }
3872
3873   return NULL_TREE;
3874 }
3875
3876 /* Perform any modifications to EXPR required when it is unsaved.  Does
3877    not recurse into EXPR's subtrees.  */
3878
3879 static void
3880 unsave_expr_1 (tree expr)
3881 {
3882   switch (TREE_CODE (expr))
3883     {
3884     case TARGET_EXPR:
3885       /* Don't mess with a TARGET_EXPR that hasn't been expanded.
3886          It's OK for this to happen if it was part of a subtree that
3887          isn't immediately expanded, such as operand 2 of another
3888          TARGET_EXPR.  */
3889       if (TREE_OPERAND (expr, 1))
3890         break;
3891
3892       TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
3893       TREE_OPERAND (expr, 3) = NULL_TREE;
3894       break;
3895
3896     default:
3897       break;
3898     }
3899 }
3900
3901 /* Called via walk_tree when an expression is unsaved.  Using the
3902    splay_tree pointed to by ST (which is really a `splay_tree'),
3903    remaps all local declarations to appropriate replacements.  */
3904
3905 static tree
3906 unsave_r (tree *tp, int *walk_subtrees, void *data)
3907 {
3908   copy_body_data *id = (copy_body_data *) data;
3909   struct pointer_map_t *st = id->decl_map;
3910   tree *n;
3911
3912   /* Only a local declaration (variable or label).  */
3913   if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
3914       || TREE_CODE (*tp) == LABEL_DECL)
3915     {
3916       /* Lookup the declaration.  */
3917       n = (tree *) pointer_map_contains (st, *tp);
3918
3919       /* If it's there, remap it.  */
3920       if (n)
3921         *tp = *n;
3922     }
3923
3924   else if (TREE_CODE (*tp) == STATEMENT_LIST)
3925     gcc_unreachable ();
3926   else if (TREE_CODE (*tp) == BIND_EXPR)
3927     copy_bind_expr (tp, walk_subtrees, id);
3928   else if (TREE_CODE (*tp) == SAVE_EXPR
3929            || TREE_CODE (*tp) == TARGET_EXPR)
3930     remap_save_expr (tp, st, walk_subtrees);
3931   else
3932     {
3933       copy_tree_r (tp, walk_subtrees, NULL);
3934
3935       /* Do whatever unsaving is required.  */
3936       unsave_expr_1 (*tp);
3937     }
3938
3939   /* Keep iterating.  */
3940   return NULL_TREE;
3941 }
3942
3943 /* Copies everything in EXPR and replaces variables, labels
3944    and SAVE_EXPRs local to EXPR.  */
3945
3946 tree
3947 unsave_expr_now (tree expr)
3948 {
3949   copy_body_data id;
3950
3951   /* There's nothing to do for NULL_TREE.  */
3952   if (expr == 0)
3953     return expr;
3954
3955   /* Set up ID.  */
3956   memset (&id, 0, sizeof (id));
3957   id.src_fn = current_function_decl;
3958   id.dst_fn = current_function_decl;
3959   id.decl_map = pointer_map_create ();
3960
3961   id.copy_decl = copy_decl_no_change;
3962   id.transform_call_graph_edges = CB_CGE_DUPLICATE;
3963   id.transform_new_cfg = false;
3964   id.transform_return_to_modify = false;
3965   id.transform_lang_insert_block = NULL;
3966
3967   /* Walk the tree once to find local labels.  */
3968   walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
3969
3970   /* Walk the tree again, copying, remapping, and unsaving.  */
3971   walk_tree (&expr, unsave_r, &id, NULL);
3972
3973   /* Clean up.  */
3974   pointer_map_destroy (id.decl_map);
3975
3976   return expr;
3977 }
3978
3979 /* Called via walk_gimple_seq.  If *GSIP points to a GIMPLE_LABEL for a local
3980    label, copies the declaration and enters it in the splay_tree in DATA (which
3981    is really a 'copy_body_data *'.  */
3982
3983 static tree
3984 mark_local_labels_stmt (gimple_stmt_iterator *gsip,
3985                         bool *handled_ops_p ATTRIBUTE_UNUSED,
3986                         struct walk_stmt_info *wi)
3987 {
3988   copy_body_data *id = (copy_body_data *) wi->info;
3989   gimple stmt = gsi_stmt (*gsip);
3990
3991   if (gimple_code (stmt) == GIMPLE_LABEL)
3992     {
3993       tree decl = gimple_label_label (stmt);
3994
3995       /* Copy the decl and remember the copy.  */
3996       insert_decl_map (id, decl, id->copy_decl (decl, id));
3997     }
3998
3999   return NULL_TREE;
4000 }
4001
4002
4003 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4004    Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4005    remaps all local declarations to appropriate replacements in gimple
4006    operands. */
4007
4008 static tree
4009 replace_locals_op (tree *tp, int *walk_subtrees, void *data)
4010 {
4011   struct walk_stmt_info *wi = (struct walk_stmt_info*) data;
4012   copy_body_data *id = (copy_body_data *) wi->info;
4013   struct pointer_map_t *st = id->decl_map;
4014   tree *n;
4015   tree expr = *tp;
4016
4017   /* Only a local declaration (variable or label).  */
4018   if ((TREE_CODE (expr) == VAR_DECL
4019        && !TREE_STATIC (expr))
4020       || TREE_CODE (expr) == LABEL_DECL)
4021     {
4022       /* Lookup the declaration.  */
4023       n = (tree *) pointer_map_contains (st, expr);
4024
4025       /* If it's there, remap it.  */
4026       if (n)
4027         *tp = *n;
4028       *walk_subtrees = 0;
4029     }
4030   else if (TREE_CODE (expr) == STATEMENT_LIST
4031            || TREE_CODE (expr) == BIND_EXPR
4032            || TREE_CODE (expr) == SAVE_EXPR)
4033     gcc_unreachable ();
4034   else if (TREE_CODE (expr) == TARGET_EXPR)
4035     {
4036       /* Don't mess with a TARGET_EXPR that hasn't been expanded.
4037          It's OK for this to happen if it was part of a subtree that
4038          isn't immediately expanded, such as operand 2 of another
4039          TARGET_EXPR.  */
4040       if (!TREE_OPERAND (expr, 1))
4041         {
4042           TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
4043           TREE_OPERAND (expr, 3) = NULL_TREE;
4044         }
4045     }
4046
4047   /* Keep iterating.  */
4048   return NULL_TREE;
4049 }
4050
4051
4052 /* Called via walk_gimple_seq by copy_gimple_seq_and_replace_local.
4053    Using the splay_tree pointed to by ST (which is really a `splay_tree'),
4054    remaps all local declarations to appropriate replacements in gimple
4055    statements. */
4056
4057 static tree
4058 replace_locals_stmt (gimple_stmt_iterator *gsip,
4059                      bool *handled_ops_p ATTRIBUTE_UNUSED,
4060                      struct walk_stmt_info *wi)
4061 {
4062   copy_body_data *id = (copy_body_data *) wi->info;
4063   gimple stmt = gsi_stmt (*gsip);
4064
4065   if (gimple_code (stmt) == GIMPLE_BIND)
4066     {
4067       tree block = gimple_bind_block (stmt);
4068
4069       if (block)
4070         {
4071           remap_block (&block, id);
4072           gimple_bind_set_block (stmt, block);
4073         }
4074
4075       /* This will remap a lot of the same decls again, but this should be
4076          harmless.  */
4077       if (gimple_bind_vars (stmt))
4078         gimple_bind_set_vars (stmt, remap_decls (gimple_bind_vars (stmt), NULL, id));
4079     }
4080
4081   /* Keep iterating.  */
4082   return NULL_TREE;
4083 }
4084
4085
4086 /* Copies everything in SEQ and replaces variables and labels local to
4087    current_function_decl.  */
4088
4089 gimple_seq
4090 copy_gimple_seq_and_replace_locals (gimple_seq seq)
4091 {
4092   copy_body_data id;
4093   struct walk_stmt_info wi;
4094   struct pointer_set_t *visited;
4095   gimple_seq copy;
4096
4097   /* There's nothing to do for NULL_TREE.  */
4098   if (seq == NULL)
4099     return seq;
4100
4101   /* Set up ID.  */
4102   memset (&id, 0, sizeof (id));
4103   id.src_fn = current_function_decl;
4104   id.dst_fn = current_function_decl;
4105   id.decl_map = pointer_map_create ();
4106
4107   id.copy_decl = copy_decl_no_change;
4108   id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4109   id.transform_new_cfg = false;
4110   id.transform_return_to_modify = false;
4111   id.transform_lang_insert_block = NULL;
4112
4113   /* Walk the tree once to find local labels.  */
4114   memset (&wi, 0, sizeof (wi));
4115   visited = pointer_set_create ();
4116   wi.info = &id;
4117   wi.pset = visited;
4118   walk_gimple_seq (seq, mark_local_labels_stmt, NULL, &wi);
4119   pointer_set_destroy (visited);
4120
4121   copy = gimple_seq_copy (seq);
4122
4123   /* Walk the copy, remapping decls.  */
4124   memset (&wi, 0, sizeof (wi));
4125   wi.info = &id;
4126   walk_gimple_seq (copy, replace_locals_stmt, replace_locals_op, &wi);
4127
4128   /* Clean up.  */
4129   pointer_map_destroy (id.decl_map);
4130
4131   return copy;
4132 }
4133
4134
4135 /* Allow someone to determine if SEARCH is a child of TOP from gdb.  */
4136
4137 static tree
4138 debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
4139 {
4140   if (*tp == data)
4141     return (tree) data;
4142   else
4143     return NULL;
4144 }
4145
4146 bool
4147 debug_find_tree (tree top, tree search)
4148 {
4149   return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
4150 }
4151
4152
4153 /* Declare the variables created by the inliner.  Add all the variables in
4154    VARS to BIND_EXPR.  */
4155
4156 static void
4157 declare_inline_vars (tree block, tree vars)
4158 {
4159   tree t;
4160   for (t = vars; t; t = TREE_CHAIN (t))
4161     {
4162       DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
4163       gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
4164       cfun->local_decls = tree_cons (NULL_TREE, t, cfun->local_decls);
4165     }
4166
4167   if (block)
4168     BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
4169 }
4170
4171 /* Copy NODE (which must be a DECL).  The DECL originally was in the FROM_FN,
4172    but now it will be in the TO_FN.  PARM_TO_VAR means enable PARM_DECL to
4173    VAR_DECL translation.  */
4174
4175 static tree
4176 copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
4177 {
4178   /* Don't generate debug information for the copy if we wouldn't have
4179      generated it for the copy either.  */
4180   DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
4181   DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
4182
4183   /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
4184      declaration inspired this copy.  */
4185   DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
4186
4187   /* The new variable/label has no RTL, yet.  */
4188   if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
4189       && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
4190     SET_DECL_RTL (copy, NULL_RTX);
4191
4192   /* These args would always appear unused, if not for this.  */
4193   TREE_USED (copy) = 1;
4194
4195   /* Set the context for the new declaration.  */
4196   if (!DECL_CONTEXT (decl))
4197     /* Globals stay global.  */
4198     ;
4199   else if (DECL_CONTEXT (decl) != id->src_fn)
4200     /* Things that weren't in the scope of the function we're inlining
4201        from aren't in the scope we're inlining to, either.  */
4202     ;
4203   else if (TREE_STATIC (decl))
4204     /* Function-scoped static variables should stay in the original
4205        function.  */
4206     ;
4207   else
4208     /* Ordinary automatic local variables are now in the scope of the
4209        new function.  */
4210     DECL_CONTEXT (copy) = id->dst_fn;
4211
4212   return copy;
4213 }
4214
4215 static tree
4216 copy_decl_to_var (tree decl, copy_body_data *id)
4217 {
4218   tree copy, type;
4219
4220   gcc_assert (TREE_CODE (decl) == PARM_DECL
4221               || TREE_CODE (decl) == RESULT_DECL);
4222
4223   type = TREE_TYPE (decl);
4224
4225   copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4226                      VAR_DECL, DECL_NAME (decl), type);
4227   TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4228   TREE_READONLY (copy) = TREE_READONLY (decl);
4229   TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4230   DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4231
4232   return copy_decl_for_dup_finish (id, decl, copy);
4233 }
4234
4235 /* Like copy_decl_to_var, but create a return slot object instead of a
4236    pointer variable for return by invisible reference.  */
4237
4238 static tree
4239 copy_result_decl_to_var (tree decl, copy_body_data *id)
4240 {
4241   tree copy, type;
4242
4243   gcc_assert (TREE_CODE (decl) == PARM_DECL
4244               || TREE_CODE (decl) == RESULT_DECL);
4245
4246   type = TREE_TYPE (decl);
4247   if (DECL_BY_REFERENCE (decl))
4248     type = TREE_TYPE (type);
4249
4250   copy = build_decl (DECL_SOURCE_LOCATION (id->dst_fn),
4251                      VAR_DECL, DECL_NAME (decl), type);
4252   TREE_READONLY (copy) = TREE_READONLY (decl);
4253   TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
4254   if (!DECL_BY_REFERENCE (decl))
4255     {
4256       TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
4257       DECL_GIMPLE_REG_P (copy) = DECL_GIMPLE_REG_P (decl);
4258     }
4259
4260   return copy_decl_for_dup_finish (id, decl, copy);
4261 }
4262
4263 tree
4264 copy_decl_no_change (tree decl, copy_body_data *id)
4265 {
4266   tree copy;
4267
4268   copy = copy_node (decl);
4269
4270   /* The COPY is not abstract; it will be generated in DST_FN.  */
4271   DECL_ABSTRACT (copy) = 0;
4272   lang_hooks.dup_lang_specific_decl (copy);
4273
4274   /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
4275      been taken; it's for internal bookkeeping in expand_goto_internal.  */
4276   if (TREE_CODE (copy) == LABEL_DECL)
4277     {
4278       TREE_ADDRESSABLE (copy) = 0;
4279       LABEL_DECL_UID (copy) = -1;
4280     }
4281
4282   return copy_decl_for_dup_finish (id, decl, copy);
4283 }
4284
4285 static tree
4286 copy_decl_maybe_to_var (tree decl, copy_body_data *id)
4287 {
4288   if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
4289     return copy_decl_to_var (decl, id);
4290   else
4291     return copy_decl_no_change (decl, id);
4292 }
4293
4294 /* Return a copy of the function's argument tree.  */
4295 static tree
4296 copy_arguments_for_versioning (tree orig_parm, copy_body_data * id,
4297                                bitmap args_to_skip, tree *vars)
4298 {
4299   tree arg, *parg;
4300   tree new_parm = NULL;
4301   int i = 0;
4302
4303   parg = &new_parm;
4304
4305   for (arg = orig_parm; arg; arg = TREE_CHAIN (arg), i++)
4306     if (!args_to_skip || !bitmap_bit_p (args_to_skip, i))
4307       {
4308         tree new_tree = remap_decl (arg, id);
4309         lang_hooks.dup_lang_specific_decl (new_tree);
4310         *parg = new_tree;
4311         parg = &TREE_CHAIN (new_tree);
4312       }
4313     else if (!pointer_map_contains (id->decl_map, arg))
4314       {
4315         /* Make an equivalent VAR_DECL.  If the argument was used
4316            as temporary variable later in function, the uses will be
4317            replaced by local variable.  */
4318         tree var = copy_decl_to_var (arg, id);
4319         get_var_ann (var);
4320         add_referenced_var (var);
4321         insert_decl_map (id, arg, var);
4322         /* Declare this new variable.  */
4323         TREE_CHAIN (var) = *vars;
4324         *vars = var;
4325       }
4326   return new_parm;
4327 }
4328
4329 /* Return a copy of the function's static chain.  */
4330 static tree
4331 copy_static_chain (tree static_chain, copy_body_data * id)
4332 {
4333   tree *chain_copy, *pvar;
4334
4335   chain_copy = &static_chain;
4336   for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
4337     {
4338       tree new_tree = remap_decl (*pvar, id);
4339       lang_hooks.dup_lang_specific_decl (new_tree);
4340       TREE_CHAIN (new_tree) = TREE_CHAIN (*pvar);
4341       *pvar = new_tree;
4342     }
4343   return static_chain;
4344 }
4345
4346 /* Return true if the function is allowed to be versioned.
4347    This is a guard for the versioning functionality.  */
4348
4349 bool
4350 tree_versionable_function_p (tree fndecl)
4351 {
4352   return copy_forbidden (DECL_STRUCT_FUNCTION (fndecl), fndecl) == NULL;
4353 }
4354
4355 /* Delete all unreachable basic blocks and update callgraph.
4356    Doing so is somewhat nontrivial because we need to update all clones and
4357    remove inline function that become unreachable.  */
4358
4359 static bool
4360 delete_unreachable_blocks_update_callgraph (copy_body_data *id)
4361 {
4362   bool changed = false;
4363   basic_block b, next_bb;
4364
4365   find_unreachable_blocks ();
4366
4367   /* Delete all unreachable basic blocks.  */
4368
4369   for (b = ENTRY_BLOCK_PTR->next_bb; b != EXIT_BLOCK_PTR; b = next_bb)
4370     {
4371       next_bb = b->next_bb;
4372
4373       if (!(b->flags & BB_REACHABLE))
4374         {
4375           gimple_stmt_iterator bsi;
4376
4377           for (bsi = gsi_start_bb (b); !gsi_end_p (bsi); gsi_next (&bsi))
4378             if (gimple_code (gsi_stmt (bsi)) == GIMPLE_CALL)
4379               {
4380                 struct cgraph_edge *e;
4381                 struct cgraph_node *node;
4382
4383                 if ((e = cgraph_edge (id->dst_node, gsi_stmt (bsi))) != NULL)
4384                   {
4385                     if (!e->inline_failed)
4386                       cgraph_remove_node_and_inline_clones (e->callee);
4387                     else
4388                       cgraph_remove_edge (e);
4389                   }
4390                 if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
4391                     && id->dst_node->clones)
4392                   for (node = id->dst_node->clones; node != id->dst_node;)
4393                     {
4394                       if ((e = cgraph_edge (node, gsi_stmt (bsi))) != NULL)
4395                         {
4396                           if (!e->inline_failed)
4397                             cgraph_remove_node_and_inline_clones (e->callee);
4398                           else
4399                             cgraph_remove_edge (e);
4400                         }
4401
4402                       if (node->clones)
4403                         node = node->clones;
4404                       else if (node->next_sibling_clone)
4405                         node = node->next_sibling_clone;
4406                       else
4407                         {
4408                           while (node != id->dst_node && !node->next_sibling_clone)
4409                             node = node->clone_of;
4410                           if (node != id->dst_node)
4411                             node = node->next_sibling_clone;
4412                         }
4413                     }
4414               }
4415           delete_basic_block (b);
4416           changed = true;
4417         }
4418     }
4419
4420   if (changed)
4421     tidy_fallthru_edges ();
4422 #ifdef ENABLE_CHECKING0
4423   verify_cgraph_node (id->dst_node);
4424   if (id->transform_call_graph_edges == CB_CGE_MOVE_CLONES
4425       && id->dst_node->clones)
4426     {
4427       struct cgraph_node *node;
4428       for (node = id->dst_node->clones; node != id->dst_node;)
4429         {
4430           verify_cgraph_node (node);
4431
4432           if (node->clones)
4433             node = node->clones;
4434           else if (node->next_sibling_clone)
4435             node = node->next_sibling_clone;
4436           else
4437             {
4438               while (node != id->dst_node && !node->next_sibling_clone)
4439                 node = node->clone_of;
4440               if (node != id->dst_node)
4441                 node = node->next_sibling_clone;
4442             }
4443         }
4444      }
4445 #endif
4446   return changed;
4447 }
4448
4449 /* Update clone info after duplication.  */
4450
4451 static void
4452 update_clone_info (copy_body_data * id)
4453 {
4454   struct cgraph_node *node;
4455   if (!id->dst_node->clones)
4456     return;
4457   for (node = id->dst_node->clones; node != id->dst_node;)
4458     {
4459       /* First update replace maps to match the new body.  */
4460       if (node->clone.tree_map)
4461         {
4462           unsigned int i;
4463           for (i = 0; i < VEC_length (ipa_replace_map_p, node->clone.tree_map); i++)
4464             {
4465               struct ipa_replace_map *replace_info;
4466               replace_info = VEC_index (ipa_replace_map_p, node->clone.tree_map, i);
4467               walk_tree (&replace_info->old_tree, copy_tree_body_r, id, NULL);
4468               walk_tree (&replace_info->new_tree, copy_tree_body_r, id, NULL);
4469             }
4470         }
4471       if (node->clones)
4472         node = node->clones;
4473       else if (node->next_sibling_clone)
4474         node = node->next_sibling_clone;
4475       else
4476         {
4477           while (node != id->dst_node && !node->next_sibling_clone)
4478             node = node->clone_of;
4479           if (node != id->dst_node)
4480             node = node->next_sibling_clone;
4481         }
4482     }
4483 }
4484
4485 /* Create a copy of a function's tree.
4486    OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
4487    of the original function and the new copied function
4488    respectively.  In case we want to replace a DECL
4489    tree with another tree while duplicating the function's
4490    body, TREE_MAP represents the mapping between these
4491    trees. If UPDATE_CLONES is set, the call_stmt fields
4492    of edges of clones of the function will be updated.  */
4493 void
4494 tree_function_versioning (tree old_decl, tree new_decl,
4495                           VEC(ipa_replace_map_p,gc)* tree_map,
4496                           bool update_clones, bitmap args_to_skip)
4497 {
4498   struct cgraph_node *old_version_node;
4499   struct cgraph_node *new_version_node;
4500   copy_body_data id;
4501   tree p;
4502   unsigned i;
4503   struct ipa_replace_map *replace_info;
4504   basic_block old_entry_block;
4505   VEC (gimple, heap) *init_stmts = VEC_alloc (gimple, heap, 10);
4506
4507   tree t_step;
4508   tree old_current_function_decl = current_function_decl;
4509   tree vars = NULL_TREE;
4510
4511   gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
4512               && TREE_CODE (new_decl) == FUNCTION_DECL);
4513   DECL_POSSIBLY_INLINED (old_decl) = 1;
4514
4515   old_version_node = cgraph_node (old_decl);
4516   new_version_node = cgraph_node (new_decl);
4517
4518   /* Output the inlining info for this abstract function, since it has been
4519      inlined.  If we don't do this now, we can lose the information about the
4520      variables in the function when the blocks get blown away as soon as we
4521      remove the cgraph node.  */
4522   (*debug_hooks->outlining_inline_function) (old_decl);
4523
4524   DECL_ARTIFICIAL (new_decl) = 1;
4525   DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
4526
4527   /* Prepare the data structures for the tree copy.  */
4528   memset (&id, 0, sizeof (id));
4529
4530   /* Generate a new name for the new version. */
4531   id.statements_to_fold = pointer_set_create ();
4532
4533   id.decl_map = pointer_map_create ();
4534   id.src_fn = old_decl;
4535   id.dst_fn = new_decl;
4536   id.src_node = old_version_node;
4537   id.dst_node = new_version_node;
4538   id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
4539
4540   id.copy_decl = copy_decl_no_change;
4541   id.transform_call_graph_edges
4542     = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
4543   id.transform_new_cfg = true;
4544   id.transform_return_to_modify = false;
4545   id.transform_lang_insert_block = NULL;
4546
4547   current_function_decl = new_decl;
4548   old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
4549     (DECL_STRUCT_FUNCTION (old_decl));
4550   initialize_cfun (new_decl, old_decl,
4551                    old_entry_block->count,
4552                    old_entry_block->frequency);
4553   push_cfun (DECL_STRUCT_FUNCTION (new_decl));
4554
4555   /* Copy the function's static chain.  */
4556   p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
4557   if (p)
4558     DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
4559       copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
4560                          &id);
4561
4562   /* If there's a tree_map, prepare for substitution.  */
4563   if (tree_map)
4564     for (i = 0; i < VEC_length (ipa_replace_map_p, tree_map); i++)
4565       {
4566         gimple init;
4567         replace_info = VEC_index (ipa_replace_map_p, tree_map, i);
4568         if (replace_info->replace_p)
4569           {
4570             tree op = replace_info->new_tree;
4571
4572             STRIP_NOPS (op);
4573
4574             if (TREE_CODE (op) == VIEW_CONVERT_EXPR)
4575               op = TREE_OPERAND (op, 0);
4576
4577             if (TREE_CODE (op) == ADDR_EXPR)
4578               {
4579                 op = TREE_OPERAND (op, 0);
4580                 while (handled_component_p (op))
4581                   op = TREE_OPERAND (op, 0);
4582                 if (TREE_CODE (op) == VAR_DECL)
4583                   add_referenced_var (op);
4584               }
4585             gcc_assert (TREE_CODE (replace_info->old_tree) == PARM_DECL);
4586             init = setup_one_parameter (&id, replace_info->old_tree,
4587                                         replace_info->new_tree, id.src_fn,
4588                                         NULL,
4589                                         &vars);
4590             if (init)
4591               VEC_safe_push (gimple, heap, init_stmts, init);
4592           }
4593       }
4594   /* Copy the function's arguments.  */
4595   if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
4596     DECL_ARGUMENTS (new_decl) =
4597       copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id,
4598                                      args_to_skip, &vars);
4599
4600   DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
4601
4602   /* Renumber the lexical scoping (non-code) blocks consecutively.  */
4603   number_blocks (id.dst_fn);
4604
4605   declare_inline_vars (DECL_INITIAL (new_decl), vars);
4606
4607   if (DECL_STRUCT_FUNCTION (old_decl)->local_decls != NULL_TREE)
4608     /* Add local vars.  */
4609     for (t_step = DECL_STRUCT_FUNCTION (old_decl)->local_decls;
4610          t_step; t_step = TREE_CHAIN (t_step))
4611       {
4612         tree var = TREE_VALUE (t_step);
4613         if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
4614           cfun->local_decls = tree_cons (NULL_TREE, var, cfun->local_decls);
4615         else if (!can_be_nonlocal (var, &id))
4616           cfun->local_decls =
4617             tree_cons (NULL_TREE, remap_decl (var, &id),
4618                        cfun->local_decls);
4619       }
4620
4621   /* Copy the Function's body.  */
4622   copy_body (&id, old_entry_block->count, old_entry_block->frequency,
4623              ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR);
4624
4625   if (DECL_RESULT (old_decl) != NULL_TREE)
4626     {
4627       tree *res_decl = &DECL_RESULT (old_decl);
4628       DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
4629       lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
4630     }
4631
4632   /* Renumber the lexical scoping (non-code) blocks consecutively.  */
4633   number_blocks (new_decl);
4634
4635   if (VEC_length (gimple, init_stmts))
4636     {
4637       basic_block bb = split_edge (single_succ_edge (ENTRY_BLOCK_PTR));
4638       while (VEC_length (gimple, init_stmts))
4639         insert_init_stmt (bb, VEC_pop (gimple, init_stmts));
4640     }
4641   update_clone_info (&id);
4642
4643   /* Remap the nonlocal_goto_save_area, if any.  */
4644   if (cfun->nonlocal_goto_save_area)
4645     {
4646       struct walk_stmt_info wi;
4647
4648       memset (&wi, 0, sizeof (wi));
4649       wi.info = &id;
4650       walk_tree (&cfun->nonlocal_goto_save_area, remap_gimple_op_r, &wi, NULL);
4651     }
4652
4653   /* Clean up.  */
4654   pointer_map_destroy (id.decl_map);
4655   free_dominance_info (CDI_DOMINATORS);
4656   free_dominance_info (CDI_POST_DOMINATORS);
4657
4658   fold_marked_statements (0, id.statements_to_fold);
4659   pointer_set_destroy (id.statements_to_fold);
4660   fold_cond_expr_cond ();
4661   delete_unreachable_blocks_update_callgraph (&id);
4662   update_ssa (TODO_update_ssa);
4663   free_dominance_info (CDI_DOMINATORS);
4664   free_dominance_info (CDI_POST_DOMINATORS);
4665
4666   VEC_free (gimple, heap, init_stmts);
4667   pop_cfun ();
4668   current_function_decl = old_current_function_decl;
4669   gcc_assert (!current_function_decl
4670               || DECL_STRUCT_FUNCTION (current_function_decl) == cfun);
4671   return;
4672 }
4673
4674 /* EXP is CALL_EXPR present in a GENERIC expression tree.  Try to integrate
4675    the callee and return the inlined body on success.  */
4676
4677 tree
4678 maybe_inline_call_in_expr (tree exp)
4679 {
4680   tree fn = get_callee_fndecl (exp);
4681
4682   /* We can only try to inline "const" functions.  */
4683   if (fn && TREE_READONLY (fn) && DECL_SAVED_TREE (fn))
4684     {
4685       struct pointer_map_t *decl_map = pointer_map_create ();
4686       call_expr_arg_iterator iter;
4687       copy_body_data id;
4688       tree param, arg, t;
4689
4690       /* Remap the parameters.  */
4691       for (param = DECL_ARGUMENTS (fn), arg = first_call_expr_arg (exp, &iter);
4692            param;
4693            param = TREE_CHAIN (param), arg = next_call_expr_arg (&iter))
4694         *pointer_map_insert (decl_map, param) = arg;
4695
4696       memset (&id, 0, sizeof (id));
4697       id.src_fn = fn;
4698       id.dst_fn = current_function_decl;
4699       id.src_cfun = DECL_STRUCT_FUNCTION (fn);
4700       id.decl_map = decl_map;
4701
4702       id.copy_decl = copy_decl_no_change;
4703       id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4704       id.transform_new_cfg = false;
4705       id.transform_return_to_modify = true;
4706       id.transform_lang_insert_block = false;
4707
4708       /* Make sure not to unshare trees behind the front-end's back
4709          since front-end specific mechanisms may rely on sharing.  */
4710       id.regimplify = false;
4711       id.do_not_unshare = true;
4712
4713       /* We're not inside any EH region.  */
4714       id.eh_region = -1;
4715
4716       t = copy_tree_body (&id);
4717       pointer_map_destroy (decl_map);
4718
4719       /* We can only return something suitable for use in a GENERIC
4720          expression tree.  */
4721       if (TREE_CODE (t) == MODIFY_EXPR)
4722         return TREE_OPERAND (t, 1);
4723     }
4724
4725    return NULL_TREE;
4726 }
4727
4728 /* Duplicate a type, fields and all.  */
4729
4730 tree
4731 build_duplicate_type (tree type)
4732 {
4733   struct copy_body_data id;
4734
4735   memset (&id, 0, sizeof (id));
4736   id.src_fn = current_function_decl;
4737   id.dst_fn = current_function_decl;
4738   id.src_cfun = cfun;
4739   id.decl_map = pointer_map_create ();
4740   id.copy_decl = copy_decl_no_change;
4741
4742   type = remap_type_1 (type, &id);
4743
4744   pointer_map_destroy (id.decl_map);
4745
4746   TYPE_CANONICAL (type) = type;
4747
4748   return type;
4749 }
4750
4751 /* Return whether it is safe to inline a function because it used different
4752    target specific options or different optimization options.  */
4753 bool
4754 tree_can_inline_p (tree caller, tree callee)
4755 {
4756 #if 0
4757   /* This causes a regression in SPEC in that it prevents a cold function from
4758      inlining a hot function.  Perhaps this should only apply to functions
4759      that the user declares hot/cold/optimize explicitly.  */
4760
4761   /* Don't inline a function with a higher optimization level than the
4762      caller, or with different space constraints (hot/cold functions).  */
4763   tree caller_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (caller);
4764   tree callee_tree = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (callee);
4765
4766   if (caller_tree != callee_tree)
4767     {
4768       struct cl_optimization *caller_opt
4769         = TREE_OPTIMIZATION ((caller_tree)
4770                              ? caller_tree
4771                              : optimization_default_node);
4772
4773       struct cl_optimization *callee_opt
4774         = TREE_OPTIMIZATION ((callee_tree)
4775                              ? callee_tree
4776                              : optimization_default_node);
4777
4778       if ((caller_opt->optimize > callee_opt->optimize)
4779           || (caller_opt->optimize_size != callee_opt->optimize_size))
4780         return false;
4781     }
4782 #endif
4783
4784   /* Allow the backend to decide if inlining is ok.  */
4785   return targetm.target_option.can_inline_p (caller, callee);
4786 }