OpenCores
URL https://opencores.org/ocsvn/openrisc/openrisc/trunk

Subversion Repositories openrisc

[/] [openrisc/] [trunk/] [gnu-old/] [gcc-4.2.2/] [gcc/] [tree-inline.c] - Diff between revs 154 and 816

Go to most recent revision | Only display areas with differences | Details | Blame | View Log

Rev 154 Rev 816
/* Tree inlining.
/* Tree inlining.
   Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007
   Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007
   Free Software Foundation, Inc.
   Free Software Foundation, Inc.
   Contributed by Alexandre Oliva <aoliva@redhat.com>
   Contributed by Alexandre Oliva <aoliva@redhat.com>
 
 
This file is part of GCC.
This file is part of GCC.
 
 
GCC is free software; you can redistribute it and/or modify
GCC is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3, or (at your option)
the Free Software Foundation; either version 3, or (at your option)
any later version.
any later version.
 
 
GCC is distributed in the hope that it will be useful,
GCC is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.
GNU General Public License for more details.
 
 
You should have received a copy of the GNU General Public License
You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3.  If not see
along with GCC; see the file COPYING3.  If not see
<http://www.gnu.org/licenses/>.  */
<http://www.gnu.org/licenses/>.  */
 
 
#include "config.h"
#include "config.h"
#include "system.h"
#include "system.h"
#include "coretypes.h"
#include "coretypes.h"
#include "tm.h"
#include "tm.h"
#include "toplev.h"
#include "toplev.h"
#include "tree.h"
#include "tree.h"
#include "tree-inline.h"
#include "tree-inline.h"
#include "rtl.h"
#include "rtl.h"
#include "expr.h"
#include "expr.h"
#include "flags.h"
#include "flags.h"
#include "params.h"
#include "params.h"
#include "input.h"
#include "input.h"
#include "insn-config.h"
#include "insn-config.h"
#include "varray.h"
#include "varray.h"
#include "hashtab.h"
#include "hashtab.h"
#include "langhooks.h"
#include "langhooks.h"
#include "basic-block.h"
#include "basic-block.h"
#include "tree-iterator.h"
#include "tree-iterator.h"
#include "cgraph.h"
#include "cgraph.h"
#include "intl.h"
#include "intl.h"
#include "tree-mudflap.h"
#include "tree-mudflap.h"
#include "tree-flow.h"
#include "tree-flow.h"
#include "function.h"
#include "function.h"
#include "ggc.h"
#include "ggc.h"
#include "tree-flow.h"
#include "tree-flow.h"
#include "diagnostic.h"
#include "diagnostic.h"
#include "except.h"
#include "except.h"
#include "debug.h"
#include "debug.h"
#include "pointer-set.h"
#include "pointer-set.h"
#include "ipa-prop.h"
#include "ipa-prop.h"
 
 
/* I'm not real happy about this, but we need to handle gimple and
/* I'm not real happy about this, but we need to handle gimple and
   non-gimple trees.  */
   non-gimple trees.  */
#include "tree-gimple.h"
#include "tree-gimple.h"
 
 
/* Inlining, Cloning, Versioning, Parallelization
/* Inlining, Cloning, Versioning, Parallelization
 
 
   Inlining: a function body is duplicated, but the PARM_DECLs are
   Inlining: a function body is duplicated, but the PARM_DECLs are
   remapped into VAR_DECLs, and non-void RETURN_EXPRs become
   remapped into VAR_DECLs, and non-void RETURN_EXPRs become
   MODIFY_EXPRs that store to a dedicated returned-value variable.
   MODIFY_EXPRs that store to a dedicated returned-value variable.
   The duplicated eh_region info of the copy will later be appended
   The duplicated eh_region info of the copy will later be appended
   to the info for the caller; the eh_region info in copied throwing
   to the info for the caller; the eh_region info in copied throwing
   statements and RESX_EXPRs is adjusted accordingly.
   statements and RESX_EXPRs is adjusted accordingly.
 
 
   Cloning: (only in C++) We have one body for a con/de/structor, and
   Cloning: (only in C++) We have one body for a con/de/structor, and
   multiple function decls, each with a unique parameter list.
   multiple function decls, each with a unique parameter list.
   Duplicate the body, using the given splay tree; some parameters
   Duplicate the body, using the given splay tree; some parameters
   will become constants (like 0 or 1).
   will become constants (like 0 or 1).
 
 
   Versioning: a function body is duplicated and the result is a new
   Versioning: a function body is duplicated and the result is a new
   function rather than into blocks of an existing function as with
   function rather than into blocks of an existing function as with
   inlining.  Some parameters will become constants.
   inlining.  Some parameters will become constants.
 
 
   Parallelization: a region of a function is duplicated resulting in
   Parallelization: a region of a function is duplicated resulting in
   a new function.  Variables may be replaced with complex expressions
   a new function.  Variables may be replaced with complex expressions
   to enable shared variable semantics.
   to enable shared variable semantics.
 
 
   All of these will simultaneously lookup any callgraph edges.  If
   All of these will simultaneously lookup any callgraph edges.  If
   we're going to inline the duplicated function body, and the given
   we're going to inline the duplicated function body, and the given
   function has some cloned callgraph nodes (one for each place this
   function has some cloned callgraph nodes (one for each place this
   function will be inlined) those callgraph edges will be duplicated.
   function will be inlined) those callgraph edges will be duplicated.
   If we're cloning the body, those callgraph edges will be
   If we're cloning the body, those callgraph edges will be
   updated to point into the new body.  (Note that the original
   updated to point into the new body.  (Note that the original
   callgraph node and edge list will not be altered.)
   callgraph node and edge list will not be altered.)
 
 
   See the CALL_EXPR handling case in copy_body_r ().  */
   See the CALL_EXPR handling case in copy_body_r ().  */
 
 
/* 0 if we should not perform inlining.
/* 0 if we should not perform inlining.
   1 if we should expand functions calls inline at the tree level.
   1 if we should expand functions calls inline at the tree level.
   2 if we should consider *all* functions to be inline
   2 if we should consider *all* functions to be inline
   candidates.  */
   candidates.  */
 
 
int flag_inline_trees = 0;
int flag_inline_trees = 0;
 
 
/* To Do:
/* To Do:
 
 
   o In order to make inlining-on-trees work, we pessimized
   o In order to make inlining-on-trees work, we pessimized
     function-local static constants.  In particular, they are now
     function-local static constants.  In particular, they are now
     always output, even when not addressed.  Fix this by treating
     always output, even when not addressed.  Fix this by treating
     function-local static constants just like global static
     function-local static constants just like global static
     constants; the back-end already knows not to output them if they
     constants; the back-end already knows not to output them if they
     are not needed.
     are not needed.
 
 
   o Provide heuristics to clamp inlining of recursive template
   o Provide heuristics to clamp inlining of recursive template
     calls?  */
     calls?  */
 
 
/* Prototypes.  */
/* Prototypes.  */
 
 
static tree declare_return_variable (copy_body_data *, tree, tree, tree *);
static tree declare_return_variable (copy_body_data *, tree, tree, tree *);
static tree copy_generic_body (copy_body_data *);
static tree copy_generic_body (copy_body_data *);
static bool inlinable_function_p (tree);
static bool inlinable_function_p (tree);
static void remap_block (tree *, copy_body_data *);
static void remap_block (tree *, copy_body_data *);
static tree remap_decls (tree, copy_body_data *);
static tree remap_decls (tree, copy_body_data *);
static void copy_bind_expr (tree *, int *, copy_body_data *);
static void copy_bind_expr (tree *, int *, copy_body_data *);
static tree mark_local_for_remap_r (tree *, int *, void *);
static tree mark_local_for_remap_r (tree *, int *, void *);
static void unsave_expr_1 (tree);
static void unsave_expr_1 (tree);
static tree unsave_r (tree *, int *, void *);
static tree unsave_r (tree *, int *, void *);
static void declare_inline_vars (tree, tree);
static void declare_inline_vars (tree, tree);
static void remap_save_expr (tree *, void *, int *);
static void remap_save_expr (tree *, void *, int *);
static void add_lexical_block (tree current_block, tree new_block);
static void add_lexical_block (tree current_block, tree new_block);
static tree copy_decl_to_var (tree, copy_body_data *);
static tree copy_decl_to_var (tree, copy_body_data *);
static tree copy_result_decl_to_var (tree, copy_body_data *);
static tree copy_result_decl_to_var (tree, copy_body_data *);
static tree copy_decl_no_change (tree, copy_body_data *);
static tree copy_decl_no_change (tree, copy_body_data *);
static tree copy_decl_maybe_to_var (tree, copy_body_data *);
static tree copy_decl_maybe_to_var (tree, copy_body_data *);
 
 
/* Insert a tree->tree mapping for ID.  Despite the name suggests
/* Insert a tree->tree mapping for ID.  Despite the name suggests
   that the trees should be variables, it is used for more than that.  */
   that the trees should be variables, it is used for more than that.  */
 
 
void
void
insert_decl_map (copy_body_data *id, tree key, tree value)
insert_decl_map (copy_body_data *id, tree key, tree value)
{
{
  splay_tree_insert (id->decl_map, (splay_tree_key) key,
  splay_tree_insert (id->decl_map, (splay_tree_key) key,
                     (splay_tree_value) value);
                     (splay_tree_value) value);
 
 
  /* Always insert an identity map as well.  If we see this same new
  /* Always insert an identity map as well.  If we see this same new
     node again, we won't want to duplicate it a second time.  */
     node again, we won't want to duplicate it a second time.  */
  if (key != value)
  if (key != value)
    splay_tree_insert (id->decl_map, (splay_tree_key) value,
    splay_tree_insert (id->decl_map, (splay_tree_key) value,
                       (splay_tree_value) value);
                       (splay_tree_value) value);
}
}
 
 
/* Remap DECL during the copying of the BLOCK tree for the function.  */
/* Remap DECL during the copying of the BLOCK tree for the function.  */
 
 
tree
tree
remap_decl (tree decl, copy_body_data *id)
remap_decl (tree decl, copy_body_data *id)
{
{
  splay_tree_node n;
  splay_tree_node n;
  tree fn;
  tree fn;
 
 
  /* We only remap local variables in the current function.  */
  /* We only remap local variables in the current function.  */
  fn = id->src_fn;
  fn = id->src_fn;
 
 
  /* See if we have remapped this declaration.  */
  /* See if we have remapped this declaration.  */
 
 
  n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
  n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
 
 
  /* If we didn't already have an equivalent for this declaration,
  /* If we didn't already have an equivalent for this declaration,
     create one now.  */
     create one now.  */
  if (!n)
  if (!n)
    {
    {
      /* Make a copy of the variable or label.  */
      /* Make a copy of the variable or label.  */
      tree t = id->copy_decl (decl, id);
      tree t = id->copy_decl (decl, id);
 
 
      /* Remember it, so that if we encounter this local entity again
      /* Remember it, so that if we encounter this local entity again
         we can reuse this copy.  Do this early because remap_type may
         we can reuse this copy.  Do this early because remap_type may
         need this decl for TYPE_STUB_DECL.  */
         need this decl for TYPE_STUB_DECL.  */
      insert_decl_map (id, decl, t);
      insert_decl_map (id, decl, t);
 
 
      if (!DECL_P (t))
      if (!DECL_P (t))
        return t;
        return t;
 
 
      /* Remap types, if necessary.  */
      /* Remap types, if necessary.  */
      TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
      TREE_TYPE (t) = remap_type (TREE_TYPE (t), id);
      if (TREE_CODE (t) == TYPE_DECL)
      if (TREE_CODE (t) == TYPE_DECL)
        DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
        DECL_ORIGINAL_TYPE (t) = remap_type (DECL_ORIGINAL_TYPE (t), id);
 
 
      /* Remap sizes as necessary.  */
      /* Remap sizes as necessary.  */
      walk_tree (&DECL_SIZE (t), copy_body_r, id, NULL);
      walk_tree (&DECL_SIZE (t), copy_body_r, id, NULL);
      walk_tree (&DECL_SIZE_UNIT (t), copy_body_r, id, NULL);
      walk_tree (&DECL_SIZE_UNIT (t), copy_body_r, id, NULL);
 
 
      /* If fields, do likewise for offset and qualifier.  */
      /* If fields, do likewise for offset and qualifier.  */
      if (TREE_CODE (t) == FIELD_DECL)
      if (TREE_CODE (t) == FIELD_DECL)
        {
        {
          walk_tree (&DECL_FIELD_OFFSET (t), copy_body_r, id, NULL);
          walk_tree (&DECL_FIELD_OFFSET (t), copy_body_r, id, NULL);
          if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
          if (TREE_CODE (DECL_CONTEXT (t)) == QUAL_UNION_TYPE)
            walk_tree (&DECL_QUALIFIER (t), copy_body_r, id, NULL);
            walk_tree (&DECL_QUALIFIER (t), copy_body_r, id, NULL);
        }
        }
 
 
      return t;
      return t;
    }
    }
 
 
  return unshare_expr ((tree) n->value);
  return unshare_expr ((tree) n->value);
}
}
 
 
static tree
static tree
remap_type_1 (tree type, copy_body_data *id)
remap_type_1 (tree type, copy_body_data *id)
{
{
  splay_tree_node node;
  splay_tree_node node;
  tree new, t;
  tree new, t;
 
 
  if (type == NULL)
  if (type == NULL)
    return type;
    return type;
 
 
  /* See if we have remapped this type.  */
  /* See if we have remapped this type.  */
  node = splay_tree_lookup (id->decl_map, (splay_tree_key) type);
  node = splay_tree_lookup (id->decl_map, (splay_tree_key) type);
  if (node)
  if (node)
    return (tree) node->value;
    return (tree) node->value;
 
 
  /* The type only needs remapping if it's variably modified.  */
  /* The type only needs remapping if it's variably modified.  */
  if (! variably_modified_type_p (type, id->src_fn))
  if (! variably_modified_type_p (type, id->src_fn))
    {
    {
      insert_decl_map (id, type, type);
      insert_decl_map (id, type, type);
      return type;
      return type;
    }
    }
 
 
  /* We do need a copy.  build and register it now.  If this is a pointer or
  /* We do need a copy.  build and register it now.  If this is a pointer or
     reference type, remap the designated type and make a new pointer or
     reference type, remap the designated type and make a new pointer or
     reference type.  */
     reference type.  */
  if (TREE_CODE (type) == POINTER_TYPE)
  if (TREE_CODE (type) == POINTER_TYPE)
    {
    {
      new = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
      new = build_pointer_type_for_mode (remap_type (TREE_TYPE (type), id),
                                         TYPE_MODE (type),
                                         TYPE_MODE (type),
                                         TYPE_REF_CAN_ALIAS_ALL (type));
                                         TYPE_REF_CAN_ALIAS_ALL (type));
      insert_decl_map (id, type, new);
      insert_decl_map (id, type, new);
      return new;
      return new;
    }
    }
  else if (TREE_CODE (type) == REFERENCE_TYPE)
  else if (TREE_CODE (type) == REFERENCE_TYPE)
    {
    {
      new = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
      new = build_reference_type_for_mode (remap_type (TREE_TYPE (type), id),
                                            TYPE_MODE (type),
                                            TYPE_MODE (type),
                                            TYPE_REF_CAN_ALIAS_ALL (type));
                                            TYPE_REF_CAN_ALIAS_ALL (type));
      insert_decl_map (id, type, new);
      insert_decl_map (id, type, new);
      return new;
      return new;
    }
    }
  else
  else
    new = copy_node (type);
    new = copy_node (type);
 
 
  insert_decl_map (id, type, new);
  insert_decl_map (id, type, new);
 
 
  /* This is a new type, not a copy of an old type.  Need to reassociate
  /* This is a new type, not a copy of an old type.  Need to reassociate
     variants.  We can handle everything except the main variant lazily.  */
     variants.  We can handle everything except the main variant lazily.  */
  t = TYPE_MAIN_VARIANT (type);
  t = TYPE_MAIN_VARIANT (type);
  if (type != t)
  if (type != t)
    {
    {
      t = remap_type (t, id);
      t = remap_type (t, id);
      TYPE_MAIN_VARIANT (new) = t;
      TYPE_MAIN_VARIANT (new) = t;
      TYPE_NEXT_VARIANT (new) = TYPE_MAIN_VARIANT (t);
      TYPE_NEXT_VARIANT (new) = TYPE_MAIN_VARIANT (t);
      TYPE_NEXT_VARIANT (t) = new;
      TYPE_NEXT_VARIANT (t) = new;
    }
    }
  else
  else
    {
    {
      TYPE_MAIN_VARIANT (new) = new;
      TYPE_MAIN_VARIANT (new) = new;
      TYPE_NEXT_VARIANT (new) = NULL;
      TYPE_NEXT_VARIANT (new) = NULL;
    }
    }
 
 
  if (TYPE_STUB_DECL (type))
  if (TYPE_STUB_DECL (type))
    TYPE_STUB_DECL (new) = remap_decl (TYPE_STUB_DECL (type), id);
    TYPE_STUB_DECL (new) = remap_decl (TYPE_STUB_DECL (type), id);
 
 
  /* Lazily create pointer and reference types.  */
  /* Lazily create pointer and reference types.  */
  TYPE_POINTER_TO (new) = NULL;
  TYPE_POINTER_TO (new) = NULL;
  TYPE_REFERENCE_TO (new) = NULL;
  TYPE_REFERENCE_TO (new) = NULL;
 
 
  switch (TREE_CODE (new))
  switch (TREE_CODE (new))
    {
    {
    case INTEGER_TYPE:
    case INTEGER_TYPE:
    case REAL_TYPE:
    case REAL_TYPE:
    case ENUMERAL_TYPE:
    case ENUMERAL_TYPE:
    case BOOLEAN_TYPE:
    case BOOLEAN_TYPE:
      t = TYPE_MIN_VALUE (new);
      t = TYPE_MIN_VALUE (new);
      if (t && TREE_CODE (t) != INTEGER_CST)
      if (t && TREE_CODE (t) != INTEGER_CST)
        walk_tree (&TYPE_MIN_VALUE (new), copy_body_r, id, NULL);
        walk_tree (&TYPE_MIN_VALUE (new), copy_body_r, id, NULL);
 
 
      t = TYPE_MAX_VALUE (new);
      t = TYPE_MAX_VALUE (new);
      if (t && TREE_CODE (t) != INTEGER_CST)
      if (t && TREE_CODE (t) != INTEGER_CST)
        walk_tree (&TYPE_MAX_VALUE (new), copy_body_r, id, NULL);
        walk_tree (&TYPE_MAX_VALUE (new), copy_body_r, id, NULL);
      return new;
      return new;
 
 
    case FUNCTION_TYPE:
    case FUNCTION_TYPE:
      TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
      TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
      walk_tree (&TYPE_ARG_TYPES (new), copy_body_r, id, NULL);
      walk_tree (&TYPE_ARG_TYPES (new), copy_body_r, id, NULL);
      return new;
      return new;
 
 
    case ARRAY_TYPE:
    case ARRAY_TYPE:
      TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
      TREE_TYPE (new) = remap_type (TREE_TYPE (new), id);
      TYPE_DOMAIN (new) = remap_type (TYPE_DOMAIN (new), id);
      TYPE_DOMAIN (new) = remap_type (TYPE_DOMAIN (new), id);
      break;
      break;
 
 
    case RECORD_TYPE:
    case RECORD_TYPE:
    case UNION_TYPE:
    case UNION_TYPE:
    case QUAL_UNION_TYPE:
    case QUAL_UNION_TYPE:
      {
      {
        tree f, nf = NULL;
        tree f, nf = NULL;
 
 
        for (f = TYPE_FIELDS (new); f ; f = TREE_CHAIN (f))
        for (f = TYPE_FIELDS (new); f ; f = TREE_CHAIN (f))
          {
          {
            t = remap_decl (f, id);
            t = remap_decl (f, id);
            DECL_CONTEXT (t) = new;
            DECL_CONTEXT (t) = new;
            TREE_CHAIN (t) = nf;
            TREE_CHAIN (t) = nf;
            nf = t;
            nf = t;
          }
          }
        TYPE_FIELDS (new) = nreverse (nf);
        TYPE_FIELDS (new) = nreverse (nf);
      }
      }
      break;
      break;
 
 
    case OFFSET_TYPE:
    case OFFSET_TYPE:
    default:
    default:
      /* Shouldn't have been thought variable sized.  */
      /* Shouldn't have been thought variable sized.  */
      gcc_unreachable ();
      gcc_unreachable ();
    }
    }
 
 
  walk_tree (&TYPE_SIZE (new), copy_body_r, id, NULL);
  walk_tree (&TYPE_SIZE (new), copy_body_r, id, NULL);
  walk_tree (&TYPE_SIZE_UNIT (new), copy_body_r, id, NULL);
  walk_tree (&TYPE_SIZE_UNIT (new), copy_body_r, id, NULL);
 
 
  return new;
  return new;
}
}
 
 
tree
tree
remap_type (tree type, copy_body_data *id)
remap_type (tree type, copy_body_data *id)
{
{
  splay_tree_node node;
  splay_tree_node node;
 
 
  if (type == NULL)
  if (type == NULL)
    return type;
    return type;
 
 
  /* See if we have remapped this type.  */
  /* See if we have remapped this type.  */
  node = splay_tree_lookup (id->decl_map, (splay_tree_key) type);
  node = splay_tree_lookup (id->decl_map, (splay_tree_key) type);
  if (node)
  if (node)
    return (tree) node->value;
    return (tree) node->value;
 
 
  /* The type only needs remapping if it's variably modified.  */
  /* The type only needs remapping if it's variably modified.  */
  if (! variably_modified_type_p (type, id->src_fn))
  if (! variably_modified_type_p (type, id->src_fn))
    {
    {
      insert_decl_map (id, type, type);
      insert_decl_map (id, type, type);
      return type;
      return type;
    }
    }
 
 
  return remap_type_1 (type, id);
  return remap_type_1 (type, id);
}
}
 
 
static tree
static tree
remap_decls (tree decls, copy_body_data *id)
remap_decls (tree decls, copy_body_data *id)
{
{
  tree old_var;
  tree old_var;
  tree new_decls = NULL_TREE;
  tree new_decls = NULL_TREE;
 
 
  /* Remap its variables.  */
  /* Remap its variables.  */
  for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
  for (old_var = decls; old_var; old_var = TREE_CHAIN (old_var))
    {
    {
      tree new_var;
      tree new_var;
 
 
      /* We can not chain the local static declarations into the unexpanded_var_list
      /* We can not chain the local static declarations into the unexpanded_var_list
         as we can't duplicate them or break one decl rule.  Go ahead and link
         as we can't duplicate them or break one decl rule.  Go ahead and link
         them into unexpanded_var_list.  */
         them into unexpanded_var_list.  */
      if (!lang_hooks.tree_inlining.auto_var_in_fn_p (old_var, id->src_fn)
      if (!lang_hooks.tree_inlining.auto_var_in_fn_p (old_var, id->src_fn)
          && !DECL_EXTERNAL (old_var))
          && !DECL_EXTERNAL (old_var))
        {
        {
          cfun->unexpanded_var_list = tree_cons (NULL_TREE, old_var,
          cfun->unexpanded_var_list = tree_cons (NULL_TREE, old_var,
                                                 cfun->unexpanded_var_list);
                                                 cfun->unexpanded_var_list);
          continue;
          continue;
        }
        }
 
 
      /* Remap the variable.  */
      /* Remap the variable.  */
      new_var = remap_decl (old_var, id);
      new_var = remap_decl (old_var, id);
 
 
      /* If we didn't remap this variable, so we can't mess with its
      /* If we didn't remap this variable, so we can't mess with its
         TREE_CHAIN.  If we remapped this variable to the return slot, it's
         TREE_CHAIN.  If we remapped this variable to the return slot, it's
         already declared somewhere else, so don't declare it here.  */
         already declared somewhere else, so don't declare it here.  */
      if (!new_var || new_var == id->retvar)
      if (!new_var || new_var == id->retvar)
        ;
        ;
      else
      else
        {
        {
          gcc_assert (DECL_P (new_var));
          gcc_assert (DECL_P (new_var));
          TREE_CHAIN (new_var) = new_decls;
          TREE_CHAIN (new_var) = new_decls;
          new_decls = new_var;
          new_decls = new_var;
        }
        }
    }
    }
 
 
  return nreverse (new_decls);
  return nreverse (new_decls);
}
}
 
 
/* Copy the BLOCK to contain remapped versions of the variables
/* Copy the BLOCK to contain remapped versions of the variables
   therein.  And hook the new block into the block-tree.  */
   therein.  And hook the new block into the block-tree.  */
 
 
static void
static void
remap_block (tree *block, copy_body_data *id)
remap_block (tree *block, copy_body_data *id)
{
{
  tree old_block;
  tree old_block;
  tree new_block;
  tree new_block;
  tree fn;
  tree fn;
 
 
  /* Make the new block.  */
  /* Make the new block.  */
  old_block = *block;
  old_block = *block;
  new_block = make_node (BLOCK);
  new_block = make_node (BLOCK);
  TREE_USED (new_block) = TREE_USED (old_block);
  TREE_USED (new_block) = TREE_USED (old_block);
  BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
  BLOCK_ABSTRACT_ORIGIN (new_block) = old_block;
  BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
  BLOCK_SOURCE_LOCATION (new_block) = BLOCK_SOURCE_LOCATION (old_block);
  *block = new_block;
  *block = new_block;
 
 
  /* Remap its variables.  */
  /* Remap its variables.  */
  BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block), id);
  BLOCK_VARS (new_block) = remap_decls (BLOCK_VARS (old_block), id);
 
 
  fn = id->dst_fn;
  fn = id->dst_fn;
 
 
  if (id->transform_lang_insert_block)
  if (id->transform_lang_insert_block)
    lang_hooks.decls.insert_block (new_block);
    lang_hooks.decls.insert_block (new_block);
 
 
  /* Remember the remapped block.  */
  /* Remember the remapped block.  */
  insert_decl_map (id, old_block, new_block);
  insert_decl_map (id, old_block, new_block);
}
}
 
 
/* Copy the whole block tree and root it in id->block.  */
/* Copy the whole block tree and root it in id->block.  */
static tree
static tree
remap_blocks (tree block, copy_body_data *id)
remap_blocks (tree block, copy_body_data *id)
{
{
  tree t;
  tree t;
  tree new = block;
  tree new = block;
 
 
  if (!block)
  if (!block)
    return NULL;
    return NULL;
 
 
  remap_block (&new, id);
  remap_block (&new, id);
  gcc_assert (new != block);
  gcc_assert (new != block);
  for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
  for (t = BLOCK_SUBBLOCKS (block); t ; t = BLOCK_CHAIN (t))
    add_lexical_block (new, remap_blocks (t, id));
    add_lexical_block (new, remap_blocks (t, id));
  return new;
  return new;
}
}
 
 
static void
static void
copy_statement_list (tree *tp)
copy_statement_list (tree *tp)
{
{
  tree_stmt_iterator oi, ni;
  tree_stmt_iterator oi, ni;
  tree new;
  tree new;
 
 
  new = alloc_stmt_list ();
  new = alloc_stmt_list ();
  ni = tsi_start (new);
  ni = tsi_start (new);
  oi = tsi_start (*tp);
  oi = tsi_start (*tp);
  *tp = new;
  *tp = new;
 
 
  for (; !tsi_end_p (oi); tsi_next (&oi))
  for (; !tsi_end_p (oi); tsi_next (&oi))
    tsi_link_after (&ni, tsi_stmt (oi), TSI_NEW_STMT);
    tsi_link_after (&ni, tsi_stmt (oi), TSI_NEW_STMT);
}
}
 
 
static void
static void
copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
copy_bind_expr (tree *tp, int *walk_subtrees, copy_body_data *id)
{
{
  tree block = BIND_EXPR_BLOCK (*tp);
  tree block = BIND_EXPR_BLOCK (*tp);
  /* Copy (and replace) the statement.  */
  /* Copy (and replace) the statement.  */
  copy_tree_r (tp, walk_subtrees, NULL);
  copy_tree_r (tp, walk_subtrees, NULL);
  if (block)
  if (block)
    {
    {
      remap_block (&block, id);
      remap_block (&block, id);
      BIND_EXPR_BLOCK (*tp) = block;
      BIND_EXPR_BLOCK (*tp) = block;
    }
    }
 
 
  if (BIND_EXPR_VARS (*tp))
  if (BIND_EXPR_VARS (*tp))
    /* This will remap a lot of the same decls again, but this should be
    /* This will remap a lot of the same decls again, but this should be
       harmless.  */
       harmless.  */
    BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), id);
    BIND_EXPR_VARS (*tp) = remap_decls (BIND_EXPR_VARS (*tp), id);
}
}
 
 
/* Called from copy_body_id via walk_tree.  DATA is really an
/* Called from copy_body_id via walk_tree.  DATA is really an
   `copy_body_data *'.  */
   `copy_body_data *'.  */
 
 
tree
tree
copy_body_r (tree *tp, int *walk_subtrees, void *data)
copy_body_r (tree *tp, int *walk_subtrees, void *data)
{
{
  copy_body_data *id = (copy_body_data *) data;
  copy_body_data *id = (copy_body_data *) data;
  tree fn = id->src_fn;
  tree fn = id->src_fn;
  tree new_block;
  tree new_block;
 
 
  /* Begin by recognizing trees that we'll completely rewrite for the
  /* Begin by recognizing trees that we'll completely rewrite for the
     inlining context.  Our output for these trees is completely
     inlining context.  Our output for these trees is completely
     different from out input (e.g. RETURN_EXPR is deleted, and morphs
     different from out input (e.g. RETURN_EXPR is deleted, and morphs
     into an edge).  Further down, we'll handle trees that get
     into an edge).  Further down, we'll handle trees that get
     duplicated and/or tweaked.  */
     duplicated and/or tweaked.  */
 
 
  /* When requested, RETURN_EXPRs should be transformed to just the
  /* When requested, RETURN_EXPRs should be transformed to just the
     contained MODIFY_EXPR.  The branch semantics of the return will
     contained MODIFY_EXPR.  The branch semantics of the return will
     be handled elsewhere by manipulating the CFG rather than a statement.  */
     be handled elsewhere by manipulating the CFG rather than a statement.  */
  if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
  if (TREE_CODE (*tp) == RETURN_EXPR && id->transform_return_to_modify)
    {
    {
      tree assignment = TREE_OPERAND (*tp, 0);
      tree assignment = TREE_OPERAND (*tp, 0);
 
 
      /* If we're returning something, just turn that into an
      /* If we're returning something, just turn that into an
         assignment into the equivalent of the original RESULT_DECL.
         assignment into the equivalent of the original RESULT_DECL.
         If the "assignment" is just the result decl, the result
         If the "assignment" is just the result decl, the result
         decl has already been set (e.g. a recent "foo (&result_decl,
         decl has already been set (e.g. a recent "foo (&result_decl,
         ...)"); just toss the entire RETURN_EXPR.  */
         ...)"); just toss the entire RETURN_EXPR.  */
      if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
      if (assignment && TREE_CODE (assignment) == MODIFY_EXPR)
        {
        {
          /* Replace the RETURN_EXPR with (a copy of) the
          /* Replace the RETURN_EXPR with (a copy of) the
             MODIFY_EXPR hanging underneath.  */
             MODIFY_EXPR hanging underneath.  */
          *tp = copy_node (assignment);
          *tp = copy_node (assignment);
        }
        }
      else /* Else the RETURN_EXPR returns no value.  */
      else /* Else the RETURN_EXPR returns no value.  */
        {
        {
          *tp = NULL;
          *tp = NULL;
          return (tree) (void *)1;
          return (tree) (void *)1;
        }
        }
    }
    }
 
 
  /* Local variables and labels need to be replaced by equivalent
  /* Local variables and labels need to be replaced by equivalent
     variables.  We don't want to copy static variables; there's only
     variables.  We don't want to copy static variables; there's only
     one of those, no matter how many times we inline the containing
     one of those, no matter how many times we inline the containing
     function.  Similarly for globals from an outer function.  */
     function.  Similarly for globals from an outer function.  */
  else if (lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
  else if (lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
    {
    {
      tree new_decl;
      tree new_decl;
 
 
      /* Remap the declaration.  */
      /* Remap the declaration.  */
      new_decl = remap_decl (*tp, id);
      new_decl = remap_decl (*tp, id);
      gcc_assert (new_decl);
      gcc_assert (new_decl);
      /* Replace this variable with the copy.  */
      /* Replace this variable with the copy.  */
      STRIP_TYPE_NOPS (new_decl);
      STRIP_TYPE_NOPS (new_decl);
      *tp = new_decl;
      *tp = new_decl;
      *walk_subtrees = 0;
      *walk_subtrees = 0;
    }
    }
  else if (TREE_CODE (*tp) == STATEMENT_LIST)
  else if (TREE_CODE (*tp) == STATEMENT_LIST)
    copy_statement_list (tp);
    copy_statement_list (tp);
  else if (TREE_CODE (*tp) == SAVE_EXPR)
  else if (TREE_CODE (*tp) == SAVE_EXPR)
    remap_save_expr (tp, id->decl_map, walk_subtrees);
    remap_save_expr (tp, id->decl_map, walk_subtrees);
  else if (TREE_CODE (*tp) == LABEL_DECL
  else if (TREE_CODE (*tp) == LABEL_DECL
           && (! DECL_CONTEXT (*tp)
           && (! DECL_CONTEXT (*tp)
               || decl_function_context (*tp) == id->src_fn))
               || decl_function_context (*tp) == id->src_fn))
    /* These may need to be remapped for EH handling.  */
    /* These may need to be remapped for EH handling.  */
    *tp = remap_decl (*tp, id);
    *tp = remap_decl (*tp, id);
  else if (TREE_CODE (*tp) == BIND_EXPR)
  else if (TREE_CODE (*tp) == BIND_EXPR)
    copy_bind_expr (tp, walk_subtrees, id);
    copy_bind_expr (tp, walk_subtrees, id);
  /* Types may need remapping as well.  */
  /* Types may need remapping as well.  */
  else if (TYPE_P (*tp))
  else if (TYPE_P (*tp))
    *tp = remap_type (*tp, id);
    *tp = remap_type (*tp, id);
 
 
  /* If this is a constant, we have to copy the node iff the type will be
  /* If this is a constant, we have to copy the node iff the type will be
     remapped.  copy_tree_r will not copy a constant.  */
     remapped.  copy_tree_r will not copy a constant.  */
  else if (CONSTANT_CLASS_P (*tp))
  else if (CONSTANT_CLASS_P (*tp))
    {
    {
      tree new_type = remap_type (TREE_TYPE (*tp), id);
      tree new_type = remap_type (TREE_TYPE (*tp), id);
 
 
      if (new_type == TREE_TYPE (*tp))
      if (new_type == TREE_TYPE (*tp))
        *walk_subtrees = 0;
        *walk_subtrees = 0;
 
 
      else if (TREE_CODE (*tp) == INTEGER_CST)
      else if (TREE_CODE (*tp) == INTEGER_CST)
        *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
        *tp = build_int_cst_wide (new_type, TREE_INT_CST_LOW (*tp),
                                  TREE_INT_CST_HIGH (*tp));
                                  TREE_INT_CST_HIGH (*tp));
      else
      else
        {
        {
          *tp = copy_node (*tp);
          *tp = copy_node (*tp);
          TREE_TYPE (*tp) = new_type;
          TREE_TYPE (*tp) = new_type;
        }
        }
    }
    }
 
 
  /* Otherwise, just copy the node.  Note that copy_tree_r already
  /* Otherwise, just copy the node.  Note that copy_tree_r already
     knows not to copy VAR_DECLs, etc., so this is safe.  */
     knows not to copy VAR_DECLs, etc., so this is safe.  */
  else
  else
    {
    {
      /* Here we handle trees that are not completely rewritten.
      /* Here we handle trees that are not completely rewritten.
         First we detect some inlining-induced bogosities for
         First we detect some inlining-induced bogosities for
         discarding.  */
         discarding.  */
      if (TREE_CODE (*tp) == MODIFY_EXPR
      if (TREE_CODE (*tp) == MODIFY_EXPR
          && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1)
          && TREE_OPERAND (*tp, 0) == TREE_OPERAND (*tp, 1)
          && (lang_hooks.tree_inlining.auto_var_in_fn_p
          && (lang_hooks.tree_inlining.auto_var_in_fn_p
              (TREE_OPERAND (*tp, 0), fn)))
              (TREE_OPERAND (*tp, 0), fn)))
        {
        {
          /* Some assignments VAR = VAR; don't generate any rtl code
          /* Some assignments VAR = VAR; don't generate any rtl code
             and thus don't count as variable modification.  Avoid
             and thus don't count as variable modification.  Avoid
             keeping bogosities like 0 = 0.  */
             keeping bogosities like 0 = 0.  */
          tree decl = TREE_OPERAND (*tp, 0), value;
          tree decl = TREE_OPERAND (*tp, 0), value;
          splay_tree_node n;
          splay_tree_node n;
 
 
          n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
          n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
          if (n)
          if (n)
            {
            {
              value = (tree) n->value;
              value = (tree) n->value;
              STRIP_TYPE_NOPS (value);
              STRIP_TYPE_NOPS (value);
              if (TREE_CONSTANT (value) || TREE_READONLY_DECL_P (value))
              if (TREE_CONSTANT (value) || TREE_READONLY_DECL_P (value))
                {
                {
                  *tp = build_empty_stmt ();
                  *tp = build_empty_stmt ();
                  return copy_body_r (tp, walk_subtrees, data);
                  return copy_body_r (tp, walk_subtrees, data);
                }
                }
            }
            }
        }
        }
      else if (TREE_CODE (*tp) == INDIRECT_REF)
      else if (TREE_CODE (*tp) == INDIRECT_REF)
        {
        {
          /* Get rid of *& from inline substitutions that can happen when a
          /* Get rid of *& from inline substitutions that can happen when a
             pointer argument is an ADDR_EXPR.  */
             pointer argument is an ADDR_EXPR.  */
          tree decl = TREE_OPERAND (*tp, 0);
          tree decl = TREE_OPERAND (*tp, 0);
          splay_tree_node n;
          splay_tree_node n;
 
 
          n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
          n = splay_tree_lookup (id->decl_map, (splay_tree_key) decl);
          if (n)
          if (n)
            {
            {
              tree new;
              tree new;
              tree old;
              tree old;
              /* If we happen to get an ADDR_EXPR in n->value, strip
              /* If we happen to get an ADDR_EXPR in n->value, strip
                 it manually here as we'll eventually get ADDR_EXPRs
                 it manually here as we'll eventually get ADDR_EXPRs
                 which lie about their types pointed to.  In this case
                 which lie about their types pointed to.  In this case
                 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
                 build_fold_indirect_ref wouldn't strip the INDIRECT_REF,
                 but we absolutely rely on that.  As fold_indirect_ref
                 but we absolutely rely on that.  As fold_indirect_ref
                 does other useful transformations, try that first, though.  */
                 does other useful transformations, try that first, though.  */
              tree type = TREE_TYPE (TREE_TYPE ((tree)n->value));
              tree type = TREE_TYPE (TREE_TYPE ((tree)n->value));
              new = unshare_expr ((tree)n->value);
              new = unshare_expr ((tree)n->value);
              old = *tp;
              old = *tp;
              *tp = fold_indirect_ref_1 (type, new);
              *tp = fold_indirect_ref_1 (type, new);
              if (! *tp)
              if (! *tp)
                {
                {
                  if (TREE_CODE (new) == ADDR_EXPR)
                  if (TREE_CODE (new) == ADDR_EXPR)
                    *tp = TREE_OPERAND (new, 0);
                    *tp = TREE_OPERAND (new, 0);
                  else
                  else
                    {
                    {
                      *tp = build1 (INDIRECT_REF, type, new);
                      *tp = build1 (INDIRECT_REF, type, new);
                      TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
                      TREE_THIS_VOLATILE (*tp) = TREE_THIS_VOLATILE (old);
                    }
                    }
                }
                }
              *walk_subtrees = 0;
              *walk_subtrees = 0;
              return NULL;
              return NULL;
            }
            }
        }
        }
 
 
      /* Here is the "usual case".  Copy this tree node, and then
      /* Here is the "usual case".  Copy this tree node, and then
         tweak some special cases.  */
         tweak some special cases.  */
      copy_tree_r (tp, walk_subtrees, NULL);
      copy_tree_r (tp, walk_subtrees, NULL);
 
 
      /* If EXPR has block defined, map it to newly constructed block.
      /* If EXPR has block defined, map it to newly constructed block.
         When inlining we want EXPRs without block appear in the block
         When inlining we want EXPRs without block appear in the block
         of function call.  */
         of function call.  */
      if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (*tp))))
      if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (*tp))))
        {
        {
          new_block = id->block;
          new_block = id->block;
          if (TREE_BLOCK (*tp))
          if (TREE_BLOCK (*tp))
            {
            {
              splay_tree_node n;
              splay_tree_node n;
              n = splay_tree_lookup (id->decl_map,
              n = splay_tree_lookup (id->decl_map,
                                     (splay_tree_key) TREE_BLOCK (*tp));
                                     (splay_tree_key) TREE_BLOCK (*tp));
              gcc_assert (n);
              gcc_assert (n);
              new_block = (tree) n->value;
              new_block = (tree) n->value;
            }
            }
          TREE_BLOCK (*tp) = new_block;
          TREE_BLOCK (*tp) = new_block;
        }
        }
 
 
      if (TREE_CODE (*tp) == RESX_EXPR && id->eh_region_offset)
      if (TREE_CODE (*tp) == RESX_EXPR && id->eh_region_offset)
        TREE_OPERAND (*tp, 0) =
        TREE_OPERAND (*tp, 0) =
          build_int_cst
          build_int_cst
            (NULL_TREE,
            (NULL_TREE,
             id->eh_region_offset + TREE_INT_CST_LOW (TREE_OPERAND (*tp, 0)));
             id->eh_region_offset + TREE_INT_CST_LOW (TREE_OPERAND (*tp, 0)));
 
 
      if (TREE_CODE (*tp) != OMP_CLAUSE)
      if (TREE_CODE (*tp) != OMP_CLAUSE)
        TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
        TREE_TYPE (*tp) = remap_type (TREE_TYPE (*tp), id);
 
 
      /* The copied TARGET_EXPR has never been expanded, even if the
      /* The copied TARGET_EXPR has never been expanded, even if the
         original node was expanded already.  */
         original node was expanded already.  */
      if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
      if (TREE_CODE (*tp) == TARGET_EXPR && TREE_OPERAND (*tp, 3))
        {
        {
          TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
          TREE_OPERAND (*tp, 1) = TREE_OPERAND (*tp, 3);
          TREE_OPERAND (*tp, 3) = NULL_TREE;
          TREE_OPERAND (*tp, 3) = NULL_TREE;
        }
        }
 
 
      /* Variable substitution need not be simple.  In particular, the
      /* Variable substitution need not be simple.  In particular, the
         INDIRECT_REF substitution above.  Make sure that TREE_CONSTANT
         INDIRECT_REF substitution above.  Make sure that TREE_CONSTANT
         and friends are up-to-date.  */
         and friends are up-to-date.  */
      else if (TREE_CODE (*tp) == ADDR_EXPR)
      else if (TREE_CODE (*tp) == ADDR_EXPR)
        {
        {
          walk_tree (&TREE_OPERAND (*tp, 0), copy_body_r, id, NULL);
          walk_tree (&TREE_OPERAND (*tp, 0), copy_body_r, id, NULL);
          /* Handle the case where we substituted an INDIRECT_REF
          /* Handle the case where we substituted an INDIRECT_REF
             into the operand of the ADDR_EXPR.  */
             into the operand of the ADDR_EXPR.  */
          if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
          if (TREE_CODE (TREE_OPERAND (*tp, 0)) == INDIRECT_REF)
            *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
            *tp = TREE_OPERAND (TREE_OPERAND (*tp, 0), 0);
          else
          else
            recompute_tree_invariant_for_addr_expr (*tp);
            recompute_tree_invariant_for_addr_expr (*tp);
          *walk_subtrees = 0;
          *walk_subtrees = 0;
        }
        }
    }
    }
 
 
  /* Keep iterating.  */
  /* Keep iterating.  */
  return NULL_TREE;
  return NULL_TREE;
}
}
 
 
/* Copy basic block, scale profile accordingly.  Edges will be taken care of
/* Copy basic block, scale profile accordingly.  Edges will be taken care of
   later  */
   later  */
 
 
static basic_block
static basic_block
copy_bb (copy_body_data *id, basic_block bb, int frequency_scale, int count_scale)
copy_bb (copy_body_data *id, basic_block bb, int frequency_scale, int count_scale)
{
{
  block_stmt_iterator bsi, copy_bsi;
  block_stmt_iterator bsi, copy_bsi;
  basic_block copy_basic_block;
  basic_block copy_basic_block;
 
 
  /* create_basic_block() will append every new block to
  /* create_basic_block() will append every new block to
     basic_block_info automatically.  */
     basic_block_info automatically.  */
  copy_basic_block = create_basic_block (NULL, (void *) 0,
  copy_basic_block = create_basic_block (NULL, (void *) 0,
                                         (basic_block) bb->prev_bb->aux);
                                         (basic_block) bb->prev_bb->aux);
  copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
  copy_basic_block->count = bb->count * count_scale / REG_BR_PROB_BASE;
  copy_basic_block->frequency = (bb->frequency
  copy_basic_block->frequency = (bb->frequency
                                     * frequency_scale / REG_BR_PROB_BASE);
                                     * frequency_scale / REG_BR_PROB_BASE);
  copy_bsi = bsi_start (copy_basic_block);
  copy_bsi = bsi_start (copy_basic_block);
 
 
  for (bsi = bsi_start (bb);
  for (bsi = bsi_start (bb);
       !bsi_end_p (bsi); bsi_next (&bsi))
       !bsi_end_p (bsi); bsi_next (&bsi))
    {
    {
      tree stmt = bsi_stmt (bsi);
      tree stmt = bsi_stmt (bsi);
      tree orig_stmt = stmt;
      tree orig_stmt = stmt;
 
 
      walk_tree (&stmt, copy_body_r, id, NULL);
      walk_tree (&stmt, copy_body_r, id, NULL);
 
 
      /* RETURN_EXPR might be removed,
      /* RETURN_EXPR might be removed,
         this is signalled by making stmt pointer NULL.  */
         this is signalled by making stmt pointer NULL.  */
      if (stmt)
      if (stmt)
        {
        {
          tree call, decl;
          tree call, decl;
 
 
          /* With return slot optimization we can end up with
          /* With return slot optimization we can end up with
             non-gimple (foo *)&this->m, fix that here.  */
             non-gimple (foo *)&this->m, fix that here.  */
          if (TREE_CODE (stmt) == MODIFY_EXPR
          if (TREE_CODE (stmt) == MODIFY_EXPR
              && TREE_CODE (TREE_OPERAND (stmt, 1)) == NOP_EXPR
              && TREE_CODE (TREE_OPERAND (stmt, 1)) == NOP_EXPR
              && !is_gimple_val (TREE_OPERAND (TREE_OPERAND (stmt, 1), 0)))
              && !is_gimple_val (TREE_OPERAND (TREE_OPERAND (stmt, 1), 0)))
            gimplify_stmt (&stmt);
            gimplify_stmt (&stmt);
 
 
          bsi_insert_after (&copy_bsi, stmt, BSI_NEW_STMT);
          bsi_insert_after (&copy_bsi, stmt, BSI_NEW_STMT);
          call = get_call_expr_in (stmt);
          call = get_call_expr_in (stmt);
          /* We're duplicating a CALL_EXPR.  Find any corresponding
          /* We're duplicating a CALL_EXPR.  Find any corresponding
             callgraph edges and update or duplicate them.  */
             callgraph edges and update or duplicate them.  */
          if (call && (decl = get_callee_fndecl (call)))
          if (call && (decl = get_callee_fndecl (call)))
            {
            {
              struct cgraph_node *node;
              struct cgraph_node *node;
              struct cgraph_edge *edge;
              struct cgraph_edge *edge;
 
 
              switch (id->transform_call_graph_edges)
              switch (id->transform_call_graph_edges)
                {
                {
                case CB_CGE_DUPLICATE:
                case CB_CGE_DUPLICATE:
                  edge = cgraph_edge (id->src_node, orig_stmt);
                  edge = cgraph_edge (id->src_node, orig_stmt);
                  if (edge)
                  if (edge)
                    cgraph_clone_edge (edge, id->dst_node, stmt,
                    cgraph_clone_edge (edge, id->dst_node, stmt,
                                       REG_BR_PROB_BASE, 1, true);
                                       REG_BR_PROB_BASE, 1, true);
                  break;
                  break;
 
 
                case CB_CGE_MOVE_CLONES:
                case CB_CGE_MOVE_CLONES:
                  for (node = id->dst_node->next_clone;
                  for (node = id->dst_node->next_clone;
                       node;
                       node;
                       node = node->next_clone)
                       node = node->next_clone)
                    {
                    {
                      edge = cgraph_edge (node, orig_stmt);
                      edge = cgraph_edge (node, orig_stmt);
                      gcc_assert (edge);
                      gcc_assert (edge);
                      cgraph_set_call_stmt (edge, stmt);
                      cgraph_set_call_stmt (edge, stmt);
                    }
                    }
                  /* FALLTHRU */
                  /* FALLTHRU */
 
 
                case CB_CGE_MOVE:
                case CB_CGE_MOVE:
                  edge = cgraph_edge (id->dst_node, orig_stmt);
                  edge = cgraph_edge (id->dst_node, orig_stmt);
                  if (edge)
                  if (edge)
                    cgraph_set_call_stmt (edge, stmt);
                    cgraph_set_call_stmt (edge, stmt);
                  break;
                  break;
 
 
                default:
                default:
                  gcc_unreachable ();
                  gcc_unreachable ();
                }
                }
            }
            }
          /* If you think we can abort here, you are wrong.
          /* If you think we can abort here, you are wrong.
             There is no region 0 in tree land.  */
             There is no region 0 in tree land.  */
          gcc_assert (lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt)
          gcc_assert (lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt)
                      != 0);
                      != 0);
 
 
          if (tree_could_throw_p (stmt))
          if (tree_could_throw_p (stmt))
            {
            {
              int region = lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt);
              int region = lookup_stmt_eh_region_fn (id->src_cfun, orig_stmt);
              /* Add an entry for the copied tree in the EH hashtable.
              /* Add an entry for the copied tree in the EH hashtable.
                 When cloning or versioning, use the hashtable in
                 When cloning or versioning, use the hashtable in
                 cfun, and just copy the EH number.  When inlining, use the
                 cfun, and just copy the EH number.  When inlining, use the
                 hashtable in the caller, and adjust the region number.  */
                 hashtable in the caller, and adjust the region number.  */
              if (region > 0)
              if (region > 0)
                add_stmt_to_eh_region (stmt, region + id->eh_region_offset);
                add_stmt_to_eh_region (stmt, region + id->eh_region_offset);
 
 
              /* If this tree doesn't have a region associated with it,
              /* If this tree doesn't have a region associated with it,
                 and there is a "current region,"
                 and there is a "current region,"
                 then associate this tree with the current region
                 then associate this tree with the current region
                 and add edges associated with this region.  */
                 and add edges associated with this region.  */
              if ((lookup_stmt_eh_region_fn (id->src_cfun,
              if ((lookup_stmt_eh_region_fn (id->src_cfun,
                                             orig_stmt) <= 0
                                             orig_stmt) <= 0
                   && id->eh_region > 0)
                   && id->eh_region > 0)
                  && tree_could_throw_p (stmt))
                  && tree_could_throw_p (stmt))
                add_stmt_to_eh_region (stmt, id->eh_region);
                add_stmt_to_eh_region (stmt, id->eh_region);
            }
            }
        }
        }
    }
    }
  return copy_basic_block;
  return copy_basic_block;
}
}
 
 
/* Copy edges from BB into its copy constructed earlier, scale profile
/* Copy edges from BB into its copy constructed earlier, scale profile
   accordingly.  Edges will be taken care of later.  Assume aux
   accordingly.  Edges will be taken care of later.  Assume aux
   pointers to point to the copies of each BB.  */
   pointers to point to the copies of each BB.  */
static void
static void
copy_edges_for_bb (basic_block bb, int count_scale)
copy_edges_for_bb (basic_block bb, int count_scale)
{
{
  basic_block new_bb = (basic_block) bb->aux;
  basic_block new_bb = (basic_block) bb->aux;
  edge_iterator ei;
  edge_iterator ei;
  edge old_edge;
  edge old_edge;
  block_stmt_iterator bsi;
  block_stmt_iterator bsi;
  int flags;
  int flags;
 
 
  /* Use the indices from the original blocks to create edges for the
  /* Use the indices from the original blocks to create edges for the
     new ones.  */
     new ones.  */
  FOR_EACH_EDGE (old_edge, ei, bb->succs)
  FOR_EACH_EDGE (old_edge, ei, bb->succs)
    if (!(old_edge->flags & EDGE_EH))
    if (!(old_edge->flags & EDGE_EH))
      {
      {
        edge new;
        edge new;
 
 
        flags = old_edge->flags;
        flags = old_edge->flags;
 
 
        /* Return edges do get a FALLTHRU flag when the get inlined.  */
        /* Return edges do get a FALLTHRU flag when the get inlined.  */
        if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
        if (old_edge->dest->index == EXIT_BLOCK && !old_edge->flags
            && old_edge->dest->aux != EXIT_BLOCK_PTR)
            && old_edge->dest->aux != EXIT_BLOCK_PTR)
          flags |= EDGE_FALLTHRU;
          flags |= EDGE_FALLTHRU;
        new = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
        new = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
        new->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
        new->count = old_edge->count * count_scale / REG_BR_PROB_BASE;
        new->probability = old_edge->probability;
        new->probability = old_edge->probability;
      }
      }
 
 
  if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
  if (bb->index == ENTRY_BLOCK || bb->index == EXIT_BLOCK)
    return;
    return;
 
 
  for (bsi = bsi_start (new_bb); !bsi_end_p (bsi);)
  for (bsi = bsi_start (new_bb); !bsi_end_p (bsi);)
    {
    {
      tree copy_stmt;
      tree copy_stmt;
 
 
      copy_stmt = bsi_stmt (bsi);
      copy_stmt = bsi_stmt (bsi);
      update_stmt (copy_stmt);
      update_stmt (copy_stmt);
      /* Do this before the possible split_block.  */
      /* Do this before the possible split_block.  */
      bsi_next (&bsi);
      bsi_next (&bsi);
 
 
      /* If this tree could throw an exception, there are two
      /* If this tree could throw an exception, there are two
         cases where we need to add abnormal edge(s): the
         cases where we need to add abnormal edge(s): the
         tree wasn't in a region and there is a "current
         tree wasn't in a region and there is a "current
         region" in the caller; or the original tree had
         region" in the caller; or the original tree had
         EH edges.  In both cases split the block after the tree,
         EH edges.  In both cases split the block after the tree,
         and add abnormal edge(s) as needed; we need both
         and add abnormal edge(s) as needed; we need both
         those from the callee and the caller.
         those from the callee and the caller.
         We check whether the copy can throw, because the const
         We check whether the copy can throw, because the const
         propagation can change an INDIRECT_REF which throws
         propagation can change an INDIRECT_REF which throws
         into a COMPONENT_REF which doesn't.  If the copy
         into a COMPONENT_REF which doesn't.  If the copy
         can throw, the original could also throw.  */
         can throw, the original could also throw.  */
 
 
      if (tree_can_throw_internal (copy_stmt))
      if (tree_can_throw_internal (copy_stmt))
        {
        {
          if (!bsi_end_p (bsi))
          if (!bsi_end_p (bsi))
            /* Note that bb's predecessor edges aren't necessarily
            /* Note that bb's predecessor edges aren't necessarily
               right at this point; split_block doesn't care.  */
               right at this point; split_block doesn't care.  */
            {
            {
              edge e = split_block (new_bb, copy_stmt);
              edge e = split_block (new_bb, copy_stmt);
              new_bb = e->dest;
              new_bb = e->dest;
              bsi = bsi_start (new_bb);
              bsi = bsi_start (new_bb);
            }
            }
 
 
           make_eh_edges (copy_stmt);
           make_eh_edges (copy_stmt);
        }
        }
    }
    }
}
}
 
 
/* Wrapper for remap_decl so it can be used as a callback.  */
/* Wrapper for remap_decl so it can be used as a callback.  */
static tree
static tree
remap_decl_1 (tree decl, void *data)
remap_decl_1 (tree decl, void *data)
{
{
  return remap_decl (decl, (copy_body_data *) data);
  return remap_decl (decl, (copy_body_data *) data);
}
}
 
 
/* Make a copy of the body of FN so that it can be inserted inline in
/* Make a copy of the body of FN so that it can be inserted inline in
   another function.  Walks FN via CFG, returns new fndecl.  */
   another function.  Walks FN via CFG, returns new fndecl.  */
 
 
static tree
static tree
copy_cfg_body (copy_body_data * id, gcov_type count, int frequency,
copy_cfg_body (copy_body_data * id, gcov_type count, int frequency,
               basic_block entry_block_map, basic_block exit_block_map)
               basic_block entry_block_map, basic_block exit_block_map)
{
{
  tree callee_fndecl = id->src_fn;
  tree callee_fndecl = id->src_fn;
  /* Original cfun for the callee, doesn't change.  */
  /* Original cfun for the callee, doesn't change.  */
  struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
  struct function *src_cfun = DECL_STRUCT_FUNCTION (callee_fndecl);
  /* Copy, built by this function.  */
  /* Copy, built by this function.  */
  struct function *new_cfun;
  struct function *new_cfun;
  /* Place to copy from; when a copy of the function was saved off earlier,
  /* Place to copy from; when a copy of the function was saved off earlier,
     use that instead of the main copy.  */
     use that instead of the main copy.  */
  struct function *cfun_to_copy =
  struct function *cfun_to_copy =
    (struct function *) ggc_alloc_cleared (sizeof (struct function));
    (struct function *) ggc_alloc_cleared (sizeof (struct function));
  basic_block bb;
  basic_block bb;
  tree new_fndecl = NULL;
  tree new_fndecl = NULL;
  int count_scale, frequency_scale;
  int count_scale, frequency_scale;
 
 
  if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
  if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count)
    count_scale = (REG_BR_PROB_BASE * count
    count_scale = (REG_BR_PROB_BASE * count
                   / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
                   / ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count);
  else
  else
    count_scale = 1;
    count_scale = 1;
 
 
  if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
  if (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency)
    frequency_scale = (REG_BR_PROB_BASE * frequency
    frequency_scale = (REG_BR_PROB_BASE * frequency
                       /
                       /
                       ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
                       ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency);
  else
  else
    frequency_scale = count_scale;
    frequency_scale = count_scale;
 
 
  /* Register specific tree functions.  */
  /* Register specific tree functions.  */
  tree_register_cfg_hooks ();
  tree_register_cfg_hooks ();
 
 
  /* Must have a CFG here at this point.  */
  /* Must have a CFG here at this point.  */
  gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
  gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION
              (DECL_STRUCT_FUNCTION (callee_fndecl)));
              (DECL_STRUCT_FUNCTION (callee_fndecl)));
 
 
  *cfun_to_copy = *DECL_STRUCT_FUNCTION (callee_fndecl);
  *cfun_to_copy = *DECL_STRUCT_FUNCTION (callee_fndecl);
 
 
  id->src_cfun = cfun_to_copy;
  id->src_cfun = cfun_to_copy;
 
 
  /* If requested, create new basic_block_info and label_to_block_maps.
  /* If requested, create new basic_block_info and label_to_block_maps.
     Otherwise, insert our new blocks and labels into the existing cfg.  */
     Otherwise, insert our new blocks and labels into the existing cfg.  */
  if (id->transform_new_cfg)
  if (id->transform_new_cfg)
    {
    {
      new_cfun =
      new_cfun =
        (struct function *) ggc_alloc_cleared (sizeof (struct function));
        (struct function *) ggc_alloc_cleared (sizeof (struct function));
      *new_cfun = *DECL_STRUCT_FUNCTION (callee_fndecl);
      *new_cfun = *DECL_STRUCT_FUNCTION (callee_fndecl);
      new_cfun->cfg = NULL;
      new_cfun->cfg = NULL;
      new_cfun->decl = new_fndecl = copy_node (callee_fndecl);
      new_cfun->decl = new_fndecl = copy_node (callee_fndecl);
      new_cfun->ib_boundaries_block = NULL;
      new_cfun->ib_boundaries_block = NULL;
      DECL_STRUCT_FUNCTION (new_fndecl) = new_cfun;
      DECL_STRUCT_FUNCTION (new_fndecl) = new_cfun;
      push_cfun (new_cfun);
      push_cfun (new_cfun);
      init_empty_tree_cfg ();
      init_empty_tree_cfg ();
 
 
      ENTRY_BLOCK_PTR->count =
      ENTRY_BLOCK_PTR->count =
        (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
        (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
         REG_BR_PROB_BASE);
         REG_BR_PROB_BASE);
      ENTRY_BLOCK_PTR->frequency =
      ENTRY_BLOCK_PTR->frequency =
        (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
        (ENTRY_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
         frequency_scale / REG_BR_PROB_BASE);
         frequency_scale / REG_BR_PROB_BASE);
      EXIT_BLOCK_PTR->count =
      EXIT_BLOCK_PTR->count =
        (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
        (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->count * count_scale /
         REG_BR_PROB_BASE);
         REG_BR_PROB_BASE);
      EXIT_BLOCK_PTR->frequency =
      EXIT_BLOCK_PTR->frequency =
        (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
        (EXIT_BLOCK_PTR_FOR_FUNCTION (src_cfun)->frequency *
         frequency_scale / REG_BR_PROB_BASE);
         frequency_scale / REG_BR_PROB_BASE);
 
 
      entry_block_map = ENTRY_BLOCK_PTR;
      entry_block_map = ENTRY_BLOCK_PTR;
      exit_block_map = EXIT_BLOCK_PTR;
      exit_block_map = EXIT_BLOCK_PTR;
    }
    }
 
 
  ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
  ENTRY_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = entry_block_map;
  EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
  EXIT_BLOCK_PTR_FOR_FUNCTION (cfun_to_copy)->aux = exit_block_map;
 
 
  /* Duplicate any exception-handling regions.  */
  /* Duplicate any exception-handling regions.  */
  if (cfun->eh)
  if (cfun->eh)
    {
    {
      if (id->transform_new_cfg)
      if (id->transform_new_cfg)
        init_eh_for_function ();
        init_eh_for_function ();
      id->eh_region_offset
      id->eh_region_offset
        = duplicate_eh_regions (cfun_to_copy, remap_decl_1, id,
        = duplicate_eh_regions (cfun_to_copy, remap_decl_1, id,
                                0, id->eh_region);
                                0, id->eh_region);
    }
    }
  /* Use aux pointers to map the original blocks to copy.  */
  /* Use aux pointers to map the original blocks to copy.  */
  FOR_EACH_BB_FN (bb, cfun_to_copy)
  FOR_EACH_BB_FN (bb, cfun_to_copy)
    bb->aux = copy_bb (id, bb, frequency_scale, count_scale);
    bb->aux = copy_bb (id, bb, frequency_scale, count_scale);
  /* Now that we've duplicated the blocks, duplicate their edges.  */
  /* Now that we've duplicated the blocks, duplicate their edges.  */
  FOR_ALL_BB_FN (bb, cfun_to_copy)
  FOR_ALL_BB_FN (bb, cfun_to_copy)
    copy_edges_for_bb (bb, count_scale);
    copy_edges_for_bb (bb, count_scale);
  FOR_ALL_BB_FN (bb, cfun_to_copy)
  FOR_ALL_BB_FN (bb, cfun_to_copy)
    bb->aux = NULL;
    bb->aux = NULL;
 
 
  if (id->transform_new_cfg)
  if (id->transform_new_cfg)
    pop_cfun ();
    pop_cfun ();
 
 
  return new_fndecl;
  return new_fndecl;
}
}
 
 
/* Make a copy of the body of FN so that it can be inserted inline in
/* Make a copy of the body of FN so that it can be inserted inline in
   another function.  */
   another function.  */
 
 
static tree
static tree
copy_generic_body (copy_body_data *id)
copy_generic_body (copy_body_data *id)
{
{
  tree body;
  tree body;
  tree fndecl = id->src_fn;
  tree fndecl = id->src_fn;
 
 
  body = DECL_SAVED_TREE (fndecl);
  body = DECL_SAVED_TREE (fndecl);
  walk_tree (&body, copy_body_r, id, NULL);
  walk_tree (&body, copy_body_r, id, NULL);
 
 
  return body;
  return body;
}
}
 
 
static tree
static tree
copy_body (copy_body_data *id, gcov_type count, int frequency,
copy_body (copy_body_data *id, gcov_type count, int frequency,
           basic_block entry_block_map, basic_block exit_block_map)
           basic_block entry_block_map, basic_block exit_block_map)
{
{
  tree fndecl = id->src_fn;
  tree fndecl = id->src_fn;
  tree body;
  tree body;
 
 
  /* If this body has a CFG, walk CFG and copy.  */
  /* If this body has a CFG, walk CFG and copy.  */
  gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
  gcc_assert (ENTRY_BLOCK_PTR_FOR_FUNCTION (DECL_STRUCT_FUNCTION (fndecl)));
  body = copy_cfg_body (id, count, frequency, entry_block_map, exit_block_map);
  body = copy_cfg_body (id, count, frequency, entry_block_map, exit_block_map);
 
 
  return body;
  return body;
}
}
 
 
/* Return true if VALUE is an ADDR_EXPR of an automatic variable
/* Return true if VALUE is an ADDR_EXPR of an automatic variable
   defined in function FN, or of a data member thereof.  */
   defined in function FN, or of a data member thereof.  */
 
 
static bool
static bool
self_inlining_addr_expr (tree value, tree fn)
self_inlining_addr_expr (tree value, tree fn)
{
{
  tree var;
  tree var;
 
 
  if (TREE_CODE (value) != ADDR_EXPR)
  if (TREE_CODE (value) != ADDR_EXPR)
    return false;
    return false;
 
 
  var = get_base_address (TREE_OPERAND (value, 0));
  var = get_base_address (TREE_OPERAND (value, 0));
 
 
  return var && lang_hooks.tree_inlining.auto_var_in_fn_p (var, fn);
  return var && lang_hooks.tree_inlining.auto_var_in_fn_p (var, fn);
}
}
 
 
static void
static void
setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
setup_one_parameter (copy_body_data *id, tree p, tree value, tree fn,
                     basic_block bb, tree *vars)
                     basic_block bb, tree *vars)
{
{
  tree init_stmt;
  tree init_stmt;
  tree var;
  tree var;
  tree var_sub;
  tree var_sub;
 
 
  /* If the parameter is never assigned to, we may not need to
  /* If the parameter is never assigned to, we may not need to
     create a new variable here at all.  Instead, we may be able
     create a new variable here at all.  Instead, we may be able
     to just use the argument value.  */
     to just use the argument value.  */
  if (TREE_READONLY (p)
  if (TREE_READONLY (p)
      && !TREE_ADDRESSABLE (p)
      && !TREE_ADDRESSABLE (p)
      && value && !TREE_SIDE_EFFECTS (value))
      && value && !TREE_SIDE_EFFECTS (value))
    {
    {
      /* We may produce non-gimple trees by adding NOPs or introduce
      /* We may produce non-gimple trees by adding NOPs or introduce
         invalid sharing when operand is not really constant.
         invalid sharing when operand is not really constant.
         It is not big deal to prohibit constant propagation here as
         It is not big deal to prohibit constant propagation here as
         we will constant propagate in DOM1 pass anyway.  */
         we will constant propagate in DOM1 pass anyway.  */
      if (is_gimple_min_invariant (value)
      if (is_gimple_min_invariant (value)
          && lang_hooks.types_compatible_p (TREE_TYPE (value), TREE_TYPE (p))
          && lang_hooks.types_compatible_p (TREE_TYPE (value), TREE_TYPE (p))
          /* We have to be very careful about ADDR_EXPR.  Make sure
          /* We have to be very careful about ADDR_EXPR.  Make sure
             the base variable isn't a local variable of the inlined
             the base variable isn't a local variable of the inlined
             function, e.g., when doing recursive inlining, direct or
             function, e.g., when doing recursive inlining, direct or
             mutually-recursive or whatever, which is why we don't
             mutually-recursive or whatever, which is why we don't
             just test whether fn == current_function_decl.  */
             just test whether fn == current_function_decl.  */
          && ! self_inlining_addr_expr (value, fn))
          && ! self_inlining_addr_expr (value, fn))
        {
        {
          insert_decl_map (id, p, value);
          insert_decl_map (id, p, value);
          return;
          return;
        }
        }
    }
    }
 
 
  /* Make an equivalent VAR_DECL.  Note that we must NOT remap the type
  /* Make an equivalent VAR_DECL.  Note that we must NOT remap the type
     here since the type of this decl must be visible to the calling
     here since the type of this decl must be visible to the calling
     function.  */
     function.  */
  var = copy_decl_to_var (p, id);
  var = copy_decl_to_var (p, id);
 
 
  /* See if the frontend wants to pass this by invisible reference.  If
  /* See if the frontend wants to pass this by invisible reference.  If
     so, our new VAR_DECL will have REFERENCE_TYPE, and we need to
     so, our new VAR_DECL will have REFERENCE_TYPE, and we need to
     replace uses of the PARM_DECL with dereferences.  */
     replace uses of the PARM_DECL with dereferences.  */
  if (TREE_TYPE (var) != TREE_TYPE (p)
  if (TREE_TYPE (var) != TREE_TYPE (p)
      && POINTER_TYPE_P (TREE_TYPE (var))
      && POINTER_TYPE_P (TREE_TYPE (var))
      && TREE_TYPE (TREE_TYPE (var)) == TREE_TYPE (p))
      && TREE_TYPE (TREE_TYPE (var)) == TREE_TYPE (p))
    {
    {
      insert_decl_map (id, var, var);
      insert_decl_map (id, var, var);
      var_sub = build_fold_indirect_ref (var);
      var_sub = build_fold_indirect_ref (var);
    }
    }
  else
  else
    var_sub = var;
    var_sub = var;
 
 
  /* Register the VAR_DECL as the equivalent for the PARM_DECL;
  /* Register the VAR_DECL as the equivalent for the PARM_DECL;
     that way, when the PARM_DECL is encountered, it will be
     that way, when the PARM_DECL is encountered, it will be
     automatically replaced by the VAR_DECL.  */
     automatically replaced by the VAR_DECL.  */
  insert_decl_map (id, p, var_sub);
  insert_decl_map (id, p, var_sub);
 
 
  /* Declare this new variable.  */
  /* Declare this new variable.  */
  TREE_CHAIN (var) = *vars;
  TREE_CHAIN (var) = *vars;
  *vars = var;
  *vars = var;
 
 
  /* Make gimplifier happy about this variable.  */
  /* Make gimplifier happy about this variable.  */
  DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
  DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
 
 
  /* Even if P was TREE_READONLY, the new VAR should not be.
  /* Even if P was TREE_READONLY, the new VAR should not be.
     In the original code, we would have constructed a
     In the original code, we would have constructed a
     temporary, and then the function body would have never
     temporary, and then the function body would have never
     changed the value of P.  However, now, we will be
     changed the value of P.  However, now, we will be
     constructing VAR directly.  The constructor body may
     constructing VAR directly.  The constructor body may
     change its value multiple times as it is being
     change its value multiple times as it is being
     constructed.  Therefore, it must not be TREE_READONLY;
     constructed.  Therefore, it must not be TREE_READONLY;
     the back-end assumes that TREE_READONLY variable is
     the back-end assumes that TREE_READONLY variable is
     assigned to only once.  */
     assigned to only once.  */
  if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
  if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (p)))
    TREE_READONLY (var) = 0;
    TREE_READONLY (var) = 0;
 
 
  /* Initialize this VAR_DECL from the equivalent argument.  Convert
  /* Initialize this VAR_DECL from the equivalent argument.  Convert
     the argument to the proper type in case it was promoted.  */
     the argument to the proper type in case it was promoted.  */
  if (value)
  if (value)
    {
    {
      tree rhs = fold_convert (TREE_TYPE (var), value);
      tree rhs = fold_convert (TREE_TYPE (var), value);
      block_stmt_iterator bsi = bsi_last (bb);
      block_stmt_iterator bsi = bsi_last (bb);
 
 
      if (rhs == error_mark_node)
      if (rhs == error_mark_node)
        return;
        return;
 
 
      STRIP_USELESS_TYPE_CONVERSION (rhs);
      STRIP_USELESS_TYPE_CONVERSION (rhs);
 
 
      /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
      /* We want to use MODIFY_EXPR, not INIT_EXPR here so that we
         keep our trees in gimple form.  */
         keep our trees in gimple form.  */
      init_stmt = build2 (MODIFY_EXPR, TREE_TYPE (var), var, rhs);
      init_stmt = build2 (MODIFY_EXPR, TREE_TYPE (var), var, rhs);
 
 
      /* If we did not create a gimple value and we did not create a gimple
      /* If we did not create a gimple value and we did not create a gimple
         cast of a gimple value, then we will need to gimplify INIT_STMTS
         cast of a gimple value, then we will need to gimplify INIT_STMTS
         at the end.  Note that is_gimple_cast only checks the outer
         at the end.  Note that is_gimple_cast only checks the outer
         tree code, not its operand.  Thus the explicit check that its
         tree code, not its operand.  Thus the explicit check that its
         operand is a gimple value.  */
         operand is a gimple value.  */
      if (!is_gimple_val (rhs)
      if (!is_gimple_val (rhs)
          && (!is_gimple_cast (rhs)
          && (!is_gimple_cast (rhs)
              || !is_gimple_val (TREE_OPERAND (rhs, 0))))
              || !is_gimple_val (TREE_OPERAND (rhs, 0))))
        gimplify_stmt (&init_stmt);
        gimplify_stmt (&init_stmt);
 
 
      /* If VAR represents a zero-sized variable, it's possible that the
      /* If VAR represents a zero-sized variable, it's possible that the
         assignment statment may result in no gimple statements.  */
         assignment statment may result in no gimple statements.  */
      if (init_stmt)
      if (init_stmt)
        bsi_insert_after (&bsi, init_stmt, BSI_NEW_STMT);
        bsi_insert_after (&bsi, init_stmt, BSI_NEW_STMT);
    }
    }
}
}
 
 
/* Generate code to initialize the parameters of the function at the
/* Generate code to initialize the parameters of the function at the
   top of the stack in ID from the ARGS (presented as a TREE_LIST).  */
   top of the stack in ID from the ARGS (presented as a TREE_LIST).  */
 
 
static void
static void
initialize_inlined_parameters (copy_body_data *id, tree args, tree static_chain,
initialize_inlined_parameters (copy_body_data *id, tree args, tree static_chain,
                               tree fn, basic_block bb)
                               tree fn, basic_block bb)
{
{
  tree parms;
  tree parms;
  tree a;
  tree a;
  tree p;
  tree p;
  tree vars = NULL_TREE;
  tree vars = NULL_TREE;
  int argnum = 0;
  int argnum = 0;
 
 
  /* Figure out what the parameters are.  */
  /* Figure out what the parameters are.  */
  parms = DECL_ARGUMENTS (fn);
  parms = DECL_ARGUMENTS (fn);
 
 
  /* Loop through the parameter declarations, replacing each with an
  /* Loop through the parameter declarations, replacing each with an
     equivalent VAR_DECL, appropriately initialized.  */
     equivalent VAR_DECL, appropriately initialized.  */
  for (p = parms, a = args; p;
  for (p = parms, a = args; p;
       a = a ? TREE_CHAIN (a) : a, p = TREE_CHAIN (p))
       a = a ? TREE_CHAIN (a) : a, p = TREE_CHAIN (p))
    {
    {
      tree value;
      tree value;
 
 
      ++argnum;
      ++argnum;
 
 
      /* Find the initializer.  */
      /* Find the initializer.  */
      value = lang_hooks.tree_inlining.convert_parm_for_inlining
      value = lang_hooks.tree_inlining.convert_parm_for_inlining
              (p, a ? TREE_VALUE (a) : NULL_TREE, fn, argnum);
              (p, a ? TREE_VALUE (a) : NULL_TREE, fn, argnum);
 
 
      setup_one_parameter (id, p, value, fn, bb, &vars);
      setup_one_parameter (id, p, value, fn, bb, &vars);
    }
    }
 
 
  /* Initialize the static chain.  */
  /* Initialize the static chain.  */
  p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
  p = DECL_STRUCT_FUNCTION (fn)->static_chain_decl;
  gcc_assert (fn != current_function_decl);
  gcc_assert (fn != current_function_decl);
  if (p)
  if (p)
    {
    {
      /* No static chain?  Seems like a bug in tree-nested.c.  */
      /* No static chain?  Seems like a bug in tree-nested.c.  */
      gcc_assert (static_chain);
      gcc_assert (static_chain);
 
 
      setup_one_parameter (id, p, static_chain, fn, bb, &vars);
      setup_one_parameter (id, p, static_chain, fn, bb, &vars);
    }
    }
 
 
  declare_inline_vars (id->block, vars);
  declare_inline_vars (id->block, vars);
}
}
 
 
/* Declare a return variable to replace the RESULT_DECL for the
/* Declare a return variable to replace the RESULT_DECL for the
   function we are calling.  An appropriate DECL_STMT is returned.
   function we are calling.  An appropriate DECL_STMT is returned.
   The USE_STMT is filled to contain a use of the declaration to
   The USE_STMT is filled to contain a use of the declaration to
   indicate the return value of the function.
   indicate the return value of the function.
 
 
   RETURN_SLOT_ADDR, if non-null, was a fake parameter that
   RETURN_SLOT_ADDR, if non-null, was a fake parameter that
   took the address of the result.  MODIFY_DEST, if non-null, was the LHS of
   took the address of the result.  MODIFY_DEST, if non-null, was the LHS of
   the MODIFY_EXPR to which this call is the RHS.
   the MODIFY_EXPR to which this call is the RHS.
 
 
   The return value is a (possibly null) value that is the result of the
   The return value is a (possibly null) value that is the result of the
   function as seen by the callee.  *USE_P is a (possibly null) value that
   function as seen by the callee.  *USE_P is a (possibly null) value that
   holds the result as seen by the caller.  */
   holds the result as seen by the caller.  */
 
 
static tree
static tree
declare_return_variable (copy_body_data *id, tree return_slot_addr,
declare_return_variable (copy_body_data *id, tree return_slot_addr,
                         tree modify_dest, tree *use_p)
                         tree modify_dest, tree *use_p)
{
{
  tree callee = id->src_fn;
  tree callee = id->src_fn;
  tree caller = id->dst_fn;
  tree caller = id->dst_fn;
  tree result = DECL_RESULT (callee);
  tree result = DECL_RESULT (callee);
  tree callee_type = TREE_TYPE (result);
  tree callee_type = TREE_TYPE (result);
  tree caller_type = TREE_TYPE (TREE_TYPE (callee));
  tree caller_type = TREE_TYPE (TREE_TYPE (callee));
  tree var, use;
  tree var, use;
 
 
  /* We don't need to do anything for functions that don't return
  /* We don't need to do anything for functions that don't return
     anything.  */
     anything.  */
  if (!result || VOID_TYPE_P (callee_type))
  if (!result || VOID_TYPE_P (callee_type))
    {
    {
      *use_p = NULL_TREE;
      *use_p = NULL_TREE;
      return NULL_TREE;
      return NULL_TREE;
    }
    }
 
 
  /* If there was a return slot, then the return value is the
  /* If there was a return slot, then the return value is the
     dereferenced address of that object.  */
     dereferenced address of that object.  */
  if (return_slot_addr)
  if (return_slot_addr)
    {
    {
      /* The front end shouldn't have used both return_slot_addr and
      /* The front end shouldn't have used both return_slot_addr and
         a modify expression.  */
         a modify expression.  */
      gcc_assert (!modify_dest);
      gcc_assert (!modify_dest);
      if (DECL_BY_REFERENCE (result))
      if (DECL_BY_REFERENCE (result))
        var = return_slot_addr;
        var = return_slot_addr;
      else
      else
        var = build_fold_indirect_ref (return_slot_addr);
        var = build_fold_indirect_ref (return_slot_addr);
      if (TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
      if (TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
          && !DECL_COMPLEX_GIMPLE_REG_P (result)
          && !DECL_COMPLEX_GIMPLE_REG_P (result)
          && DECL_P (var))
          && DECL_P (var))
        DECL_COMPLEX_GIMPLE_REG_P (var) = 0;
        DECL_COMPLEX_GIMPLE_REG_P (var) = 0;
      use = NULL;
      use = NULL;
      goto done;
      goto done;
    }
    }
 
 
  /* All types requiring non-trivial constructors should have been handled.  */
  /* All types requiring non-trivial constructors should have been handled.  */
  gcc_assert (!TREE_ADDRESSABLE (callee_type));
  gcc_assert (!TREE_ADDRESSABLE (callee_type));
 
 
  /* Attempt to avoid creating a new temporary variable.  */
  /* Attempt to avoid creating a new temporary variable.  */
  if (modify_dest)
  if (modify_dest)
    {
    {
      bool use_it = false;
      bool use_it = false;
 
 
      /* We can't use MODIFY_DEST if there's type promotion involved.  */
      /* We can't use MODIFY_DEST if there's type promotion involved.  */
      if (!lang_hooks.types_compatible_p (caller_type, callee_type))
      if (!lang_hooks.types_compatible_p (caller_type, callee_type))
        use_it = false;
        use_it = false;
 
 
      /* ??? If we're assigning to a variable sized type, then we must
      /* ??? If we're assigning to a variable sized type, then we must
         reuse the destination variable, because we've no good way to
         reuse the destination variable, because we've no good way to
         create variable sized temporaries at this point.  */
         create variable sized temporaries at this point.  */
      else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
      else if (TREE_CODE (TYPE_SIZE_UNIT (caller_type)) != INTEGER_CST)
        use_it = true;
        use_it = true;
 
 
      /* If the callee cannot possibly modify MODIFY_DEST, then we can
      /* If the callee cannot possibly modify MODIFY_DEST, then we can
         reuse it as the result of the call directly.  Don't do this if
         reuse it as the result of the call directly.  Don't do this if
         it would promote MODIFY_DEST to addressable.  */
         it would promote MODIFY_DEST to addressable.  */
      else if (TREE_ADDRESSABLE (result))
      else if (TREE_ADDRESSABLE (result))
        use_it = false;
        use_it = false;
      else
      else
        {
        {
          tree base_m = get_base_address (modify_dest);
          tree base_m = get_base_address (modify_dest);
 
 
          /* If the base isn't a decl, then it's a pointer, and we don't
          /* If the base isn't a decl, then it's a pointer, and we don't
             know where that's going to go.  */
             know where that's going to go.  */
          if (!DECL_P (base_m))
          if (!DECL_P (base_m))
            use_it = false;
            use_it = false;
          else if (is_global_var (base_m))
          else if (is_global_var (base_m))
            use_it = false;
            use_it = false;
          else if (TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
          else if (TREE_CODE (TREE_TYPE (result)) == COMPLEX_TYPE
                   && !DECL_COMPLEX_GIMPLE_REG_P (result)
                   && !DECL_COMPLEX_GIMPLE_REG_P (result)
                   && DECL_COMPLEX_GIMPLE_REG_P (base_m))
                   && DECL_COMPLEX_GIMPLE_REG_P (base_m))
            use_it = false;
            use_it = false;
          else if (!TREE_ADDRESSABLE (base_m))
          else if (!TREE_ADDRESSABLE (base_m))
            use_it = true;
            use_it = true;
        }
        }
 
 
      if (use_it)
      if (use_it)
        {
        {
          var = modify_dest;
          var = modify_dest;
          use = NULL;
          use = NULL;
          goto done;
          goto done;
        }
        }
    }
    }
 
 
  gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
  gcc_assert (TREE_CODE (TYPE_SIZE_UNIT (callee_type)) == INTEGER_CST);
 
 
  var = copy_result_decl_to_var (result, id);
  var = copy_result_decl_to_var (result, id);
 
 
  DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
  DECL_SEEN_IN_BIND_EXPR_P (var) = 1;
  DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list
  DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list
    = tree_cons (NULL_TREE, var,
    = tree_cons (NULL_TREE, var,
                 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list);
                 DECL_STRUCT_FUNCTION (caller)->unexpanded_var_list);
 
 
  /* Do not have the rest of GCC warn about this variable as it should
  /* Do not have the rest of GCC warn about this variable as it should
     not be visible to the user.  */
     not be visible to the user.  */
  TREE_NO_WARNING (var) = 1;
  TREE_NO_WARNING (var) = 1;
 
 
  declare_inline_vars (id->block, var);
  declare_inline_vars (id->block, var);
 
 
  /* Build the use expr.  If the return type of the function was
  /* Build the use expr.  If the return type of the function was
     promoted, convert it back to the expected type.  */
     promoted, convert it back to the expected type.  */
  use = var;
  use = var;
  if (!lang_hooks.types_compatible_p (TREE_TYPE (var), caller_type))
  if (!lang_hooks.types_compatible_p (TREE_TYPE (var), caller_type))
    use = fold_convert (caller_type, var);
    use = fold_convert (caller_type, var);
 
 
  STRIP_USELESS_TYPE_CONVERSION (use);
  STRIP_USELESS_TYPE_CONVERSION (use);
 
 
  if (DECL_BY_REFERENCE (result))
  if (DECL_BY_REFERENCE (result))
    var = build_fold_addr_expr (var);
    var = build_fold_addr_expr (var);
 
 
 done:
 done:
  /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
  /* Register the VAR_DECL as the equivalent for the RESULT_DECL; that
     way, when the RESULT_DECL is encountered, it will be
     way, when the RESULT_DECL is encountered, it will be
     automatically replaced by the VAR_DECL.  */
     automatically replaced by the VAR_DECL.  */
  insert_decl_map (id, result, var);
  insert_decl_map (id, result, var);
 
 
  /* Remember this so we can ignore it in remap_decls.  */
  /* Remember this so we can ignore it in remap_decls.  */
  id->retvar = var;
  id->retvar = var;
 
 
  *use_p = use;
  *use_p = use;
  return var;
  return var;
}
}
 
 
/* Returns nonzero if a function can be inlined as a tree.  */
/* Returns nonzero if a function can be inlined as a tree.  */
 
 
bool
bool
tree_inlinable_function_p (tree fn)
tree_inlinable_function_p (tree fn)
{
{
  return inlinable_function_p (fn);
  return inlinable_function_p (fn);
}
}
 
 
static const char *inline_forbidden_reason;
static const char *inline_forbidden_reason;
 
 
static tree
static tree
inline_forbidden_p_1 (tree *nodep, int *walk_subtrees ATTRIBUTE_UNUSED,
inline_forbidden_p_1 (tree *nodep, int *walk_subtrees ATTRIBUTE_UNUSED,
                      void *fnp)
                      void *fnp)
{
{
  tree node = *nodep;
  tree node = *nodep;
  tree fn = (tree) fnp;
  tree fn = (tree) fnp;
  tree t;
  tree t;
 
 
  switch (TREE_CODE (node))
  switch (TREE_CODE (node))
    {
    {
    case CALL_EXPR:
    case CALL_EXPR:
      /* Refuse to inline alloca call unless user explicitly forced so as
      /* Refuse to inline alloca call unless user explicitly forced so as
         this may change program's memory overhead drastically when the
         this may change program's memory overhead drastically when the
         function using alloca is called in loop.  In GCC present in
         function using alloca is called in loop.  In GCC present in
         SPEC2000 inlining into schedule_block cause it to require 2GB of
         SPEC2000 inlining into schedule_block cause it to require 2GB of
         RAM instead of 256MB.  */
         RAM instead of 256MB.  */
      if (alloca_call_p (node)
      if (alloca_call_p (node)
          && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
          && !lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
        {
        {
          inline_forbidden_reason
          inline_forbidden_reason
            = G_("function %q+F can never be inlined because it uses "
            = G_("function %q+F can never be inlined because it uses "
                 "alloca (override using the always_inline attribute)");
                 "alloca (override using the always_inline attribute)");
          return node;
          return node;
        }
        }
      t = get_callee_fndecl (node);
      t = get_callee_fndecl (node);
      if (! t)
      if (! t)
        break;
        break;
 
 
      /* We cannot inline functions that call setjmp.  */
      /* We cannot inline functions that call setjmp.  */
      if (setjmp_call_p (t))
      if (setjmp_call_p (t))
        {
        {
          inline_forbidden_reason
          inline_forbidden_reason
            = G_("function %q+F can never be inlined because it uses setjmp");
            = G_("function %q+F can never be inlined because it uses setjmp");
          return node;
          return node;
        }
        }
 
 
      if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
      if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL)
        switch (DECL_FUNCTION_CODE (t))
        switch (DECL_FUNCTION_CODE (t))
          {
          {
            /* We cannot inline functions that take a variable number of
            /* We cannot inline functions that take a variable number of
               arguments.  */
               arguments.  */
          case BUILT_IN_VA_START:
          case BUILT_IN_VA_START:
          case BUILT_IN_STDARG_START:
          case BUILT_IN_STDARG_START:
          case BUILT_IN_NEXT_ARG:
          case BUILT_IN_NEXT_ARG:
          case BUILT_IN_VA_END:
          case BUILT_IN_VA_END:
            inline_forbidden_reason
            inline_forbidden_reason
              = G_("function %q+F can never be inlined because it "
              = G_("function %q+F can never be inlined because it "
                   "uses variable argument lists");
                   "uses variable argument lists");
            return node;
            return node;
 
 
          case BUILT_IN_LONGJMP:
          case BUILT_IN_LONGJMP:
            /* We can't inline functions that call __builtin_longjmp at
            /* We can't inline functions that call __builtin_longjmp at
               all.  The non-local goto machinery really requires the
               all.  The non-local goto machinery really requires the
               destination be in a different function.  If we allow the
               destination be in a different function.  If we allow the
               function calling __builtin_longjmp to be inlined into the
               function calling __builtin_longjmp to be inlined into the
               function calling __builtin_setjmp, Things will Go Awry.  */
               function calling __builtin_setjmp, Things will Go Awry.  */
            inline_forbidden_reason
            inline_forbidden_reason
              = G_("function %q+F can never be inlined because "
              = G_("function %q+F can never be inlined because "
                   "it uses setjmp-longjmp exception handling");
                   "it uses setjmp-longjmp exception handling");
            return node;
            return node;
 
 
          case BUILT_IN_NONLOCAL_GOTO:
          case BUILT_IN_NONLOCAL_GOTO:
            /* Similarly.  */
            /* Similarly.  */
            inline_forbidden_reason
            inline_forbidden_reason
              = G_("function %q+F can never be inlined because "
              = G_("function %q+F can never be inlined because "
                   "it uses non-local goto");
                   "it uses non-local goto");
            return node;
            return node;
 
 
          case BUILT_IN_RETURN:
          case BUILT_IN_RETURN:
          case BUILT_IN_APPLY_ARGS:
          case BUILT_IN_APPLY_ARGS:
            /* If a __builtin_apply_args caller would be inlined,
            /* If a __builtin_apply_args caller would be inlined,
               it would be saving arguments of the function it has
               it would be saving arguments of the function it has
               been inlined into.  Similarly __builtin_return would
               been inlined into.  Similarly __builtin_return would
               return from the function the inline has been inlined into.  */
               return from the function the inline has been inlined into.  */
            inline_forbidden_reason
            inline_forbidden_reason
              = G_("function %q+F can never be inlined because "
              = G_("function %q+F can never be inlined because "
                   "it uses __builtin_return or __builtin_apply_args");
                   "it uses __builtin_return or __builtin_apply_args");
            return node;
            return node;
 
 
          default:
          default:
            break;
            break;
          }
          }
      break;
      break;
 
 
    case GOTO_EXPR:
    case GOTO_EXPR:
      t = TREE_OPERAND (node, 0);
      t = TREE_OPERAND (node, 0);
 
 
      /* We will not inline a function which uses computed goto.  The
      /* We will not inline a function which uses computed goto.  The
         addresses of its local labels, which may be tucked into
         addresses of its local labels, which may be tucked into
         global storage, are of course not constant across
         global storage, are of course not constant across
         instantiations, which causes unexpected behavior.  */
         instantiations, which causes unexpected behavior.  */
      if (TREE_CODE (t) != LABEL_DECL)
      if (TREE_CODE (t) != LABEL_DECL)
        {
        {
          inline_forbidden_reason
          inline_forbidden_reason
            = G_("function %q+F can never be inlined "
            = G_("function %q+F can never be inlined "
                 "because it contains a computed goto");
                 "because it contains a computed goto");
          return node;
          return node;
        }
        }
      break;
      break;
 
 
    case LABEL_EXPR:
    case LABEL_EXPR:
      t = TREE_OPERAND (node, 0);
      t = TREE_OPERAND (node, 0);
      if (DECL_NONLOCAL (t))
      if (DECL_NONLOCAL (t))
        {
        {
          /* We cannot inline a function that receives a non-local goto
          /* We cannot inline a function that receives a non-local goto
             because we cannot remap the destination label used in the
             because we cannot remap the destination label used in the
             function that is performing the non-local goto.  */
             function that is performing the non-local goto.  */
          inline_forbidden_reason
          inline_forbidden_reason
            = G_("function %q+F can never be inlined "
            = G_("function %q+F can never be inlined "
                 "because it receives a non-local goto");
                 "because it receives a non-local goto");
          return node;
          return node;
        }
        }
      break;
      break;
 
 
    case RECORD_TYPE:
    case RECORD_TYPE:
    case UNION_TYPE:
    case UNION_TYPE:
      /* We cannot inline a function of the form
      /* We cannot inline a function of the form
 
 
           void F (int i) { struct S { int ar[i]; } s; }
           void F (int i) { struct S { int ar[i]; } s; }
 
 
         Attempting to do so produces a catch-22.
         Attempting to do so produces a catch-22.
         If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
         If walk_tree examines the TYPE_FIELDS chain of RECORD_TYPE/
         UNION_TYPE nodes, then it goes into infinite recursion on a
         UNION_TYPE nodes, then it goes into infinite recursion on a
         structure containing a pointer to its own type.  If it doesn't,
         structure containing a pointer to its own type.  If it doesn't,
         then the type node for S doesn't get adjusted properly when
         then the type node for S doesn't get adjusted properly when
         F is inlined.
         F is inlined.
 
 
         ??? This is likely no longer true, but it's too late in the 4.0
         ??? This is likely no longer true, but it's too late in the 4.0
         cycle to try to find out.  This should be checked for 4.1.  */
         cycle to try to find out.  This should be checked for 4.1.  */
      for (t = TYPE_FIELDS (node); t; t = TREE_CHAIN (t))
      for (t = TYPE_FIELDS (node); t; t = TREE_CHAIN (t))
        if (variably_modified_type_p (TREE_TYPE (t), NULL))
        if (variably_modified_type_p (TREE_TYPE (t), NULL))
          {
          {
            inline_forbidden_reason
            inline_forbidden_reason
              = G_("function %q+F can never be inlined "
              = G_("function %q+F can never be inlined "
                   "because it uses variable sized variables");
                   "because it uses variable sized variables");
            return node;
            return node;
          }
          }
 
 
    default:
    default:
      break;
      break;
    }
    }
 
 
  return NULL_TREE;
  return NULL_TREE;
}
}
 
 
/* Return subexpression representing possible alloca call, if any.  */
/* Return subexpression representing possible alloca call, if any.  */
static tree
static tree
inline_forbidden_p (tree fndecl)
inline_forbidden_p (tree fndecl)
{
{
  location_t saved_loc = input_location;
  location_t saved_loc = input_location;
  block_stmt_iterator bsi;
  block_stmt_iterator bsi;
  basic_block bb;
  basic_block bb;
  tree ret = NULL_TREE;
  tree ret = NULL_TREE;
 
 
  FOR_EACH_BB_FN (bb, DECL_STRUCT_FUNCTION (fndecl))
  FOR_EACH_BB_FN (bb, DECL_STRUCT_FUNCTION (fndecl))
    for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
    for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
      {
      {
        ret = walk_tree_without_duplicates (bsi_stmt_ptr (bsi),
        ret = walk_tree_without_duplicates (bsi_stmt_ptr (bsi),
                                    inline_forbidden_p_1, fndecl);
                                    inline_forbidden_p_1, fndecl);
        if (ret)
        if (ret)
          goto egress;
          goto egress;
      }
      }
 
 
egress:
egress:
  input_location = saved_loc;
  input_location = saved_loc;
  return ret;
  return ret;
}
}
 
 
/* Returns nonzero if FN is a function that does not have any
/* Returns nonzero if FN is a function that does not have any
   fundamental inline blocking properties.  */
   fundamental inline blocking properties.  */
 
 
static bool
static bool
inlinable_function_p (tree fn)
inlinable_function_p (tree fn)
{
{
  bool inlinable = true;
  bool inlinable = true;
 
 
  /* If we've already decided this function shouldn't be inlined,
  /* If we've already decided this function shouldn't be inlined,
     there's no need to check again.  */
     there's no need to check again.  */
  if (DECL_UNINLINABLE (fn))
  if (DECL_UNINLINABLE (fn))
    return false;
    return false;
 
 
  /* See if there is any language-specific reason it cannot be
  /* See if there is any language-specific reason it cannot be
     inlined.  (It is important that this hook be called early because
     inlined.  (It is important that this hook be called early because
     in C++ it may result in template instantiation.)
     in C++ it may result in template instantiation.)
     If the function is not inlinable for language-specific reasons,
     If the function is not inlinable for language-specific reasons,
     it is left up to the langhook to explain why.  */
     it is left up to the langhook to explain why.  */
  inlinable = !lang_hooks.tree_inlining.cannot_inline_tree_fn (&fn);
  inlinable = !lang_hooks.tree_inlining.cannot_inline_tree_fn (&fn);
 
 
  /* If we don't have the function body available, we can't inline it.
  /* If we don't have the function body available, we can't inline it.
     However, this should not be recorded since we also get here for
     However, this should not be recorded since we also get here for
     forward declared inline functions.  Therefore, return at once.  */
     forward declared inline functions.  Therefore, return at once.  */
  if (!DECL_SAVED_TREE (fn))
  if (!DECL_SAVED_TREE (fn))
    return false;
    return false;
 
 
  /* If we're not inlining at all, then we cannot inline this function.  */
  /* If we're not inlining at all, then we cannot inline this function.  */
  else if (!flag_inline_trees)
  else if (!flag_inline_trees)
    inlinable = false;
    inlinable = false;
 
 
  /* Only try to inline functions if DECL_INLINE is set.  This should be
  /* Only try to inline functions if DECL_INLINE is set.  This should be
     true for all functions declared `inline', and for all other functions
     true for all functions declared `inline', and for all other functions
     as well with -finline-functions.
     as well with -finline-functions.
 
 
     Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
     Don't think of disregarding DECL_INLINE when flag_inline_trees == 2;
     it's the front-end that must set DECL_INLINE in this case, because
     it's the front-end that must set DECL_INLINE in this case, because
     dwarf2out loses if a function that does not have DECL_INLINE set is
     dwarf2out loses if a function that does not have DECL_INLINE set is
     inlined anyway.  That is why we have both DECL_INLINE and
     inlined anyway.  That is why we have both DECL_INLINE and
     DECL_DECLARED_INLINE_P.  */
     DECL_DECLARED_INLINE_P.  */
  /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
  /* FIXME: When flag_inline_trees dies, the check for flag_unit_at_a_time
            here should be redundant.  */
            here should be redundant.  */
  else if (!DECL_INLINE (fn) && !flag_unit_at_a_time)
  else if (!DECL_INLINE (fn) && !flag_unit_at_a_time)
    inlinable = false;
    inlinable = false;
 
 
  else if (inline_forbidden_p (fn))
  else if (inline_forbidden_p (fn))
    {
    {
      /* See if we should warn about uninlinable functions.  Previously,
      /* See if we should warn about uninlinable functions.  Previously,
         some of these warnings would be issued while trying to expand
         some of these warnings would be issued while trying to expand
         the function inline, but that would cause multiple warnings
         the function inline, but that would cause multiple warnings
         about functions that would for example call alloca.  But since
         about functions that would for example call alloca.  But since
         this a property of the function, just one warning is enough.
         this a property of the function, just one warning is enough.
         As a bonus we can now give more details about the reason why a
         As a bonus we can now give more details about the reason why a
         function is not inlinable.
         function is not inlinable.
         We only warn for functions declared `inline' by the user.  */
         We only warn for functions declared `inline' by the user.  */
      bool do_warning = (warn_inline
      bool do_warning = (warn_inline
                         && DECL_INLINE (fn)
                         && DECL_INLINE (fn)
                         && DECL_DECLARED_INLINE_P (fn)
                         && DECL_DECLARED_INLINE_P (fn)
                         && !DECL_IN_SYSTEM_HEADER (fn));
                         && !DECL_IN_SYSTEM_HEADER (fn));
 
 
      if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
      if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn)))
        sorry (inline_forbidden_reason, fn);
        sorry (inline_forbidden_reason, fn);
      else if (do_warning)
      else if (do_warning)
        warning (OPT_Winline, inline_forbidden_reason, fn);
        warning (OPT_Winline, inline_forbidden_reason, fn);
 
 
      inlinable = false;
      inlinable = false;
    }
    }
 
 
  /* Squirrel away the result so that we don't have to check again.  */
  /* Squirrel away the result so that we don't have to check again.  */
  DECL_UNINLINABLE (fn) = !inlinable;
  DECL_UNINLINABLE (fn) = !inlinable;
 
 
  return inlinable;
  return inlinable;
}
}
 
 
/* Estimate the cost of a memory move.  Use machine dependent
/* Estimate the cost of a memory move.  Use machine dependent
   word size and take possible memcpy call into account.  */
   word size and take possible memcpy call into account.  */
 
 
int
int
estimate_move_cost (tree type)
estimate_move_cost (tree type)
{
{
  HOST_WIDE_INT size;
  HOST_WIDE_INT size;
 
 
  size = int_size_in_bytes (type);
  size = int_size_in_bytes (type);
 
 
  if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO)
  if (size < 0 || size > MOVE_MAX_PIECES * MOVE_RATIO)
    /* Cost of a memcpy call, 3 arguments and the call.  */
    /* Cost of a memcpy call, 3 arguments and the call.  */
    return 4;
    return 4;
  else
  else
    return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
    return ((size + MOVE_MAX_PIECES - 1) / MOVE_MAX_PIECES);
}
}
 
 
/* Used by estimate_num_insns.  Estimate number of instructions seen
/* Used by estimate_num_insns.  Estimate number of instructions seen
   by given statement.  */
   by given statement.  */
 
 
static tree
static tree
estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data)
{
{
  int *count = (int *) data;
  int *count = (int *) data;
  tree x = *tp;
  tree x = *tp;
 
 
  if (IS_TYPE_OR_DECL_P (x))
  if (IS_TYPE_OR_DECL_P (x))
    {
    {
      *walk_subtrees = 0;
      *walk_subtrees = 0;
      return NULL;
      return NULL;
    }
    }
  /* Assume that constants and references counts nothing.  These should
  /* Assume that constants and references counts nothing.  These should
     be majorized by amount of operations among them we count later
     be majorized by amount of operations among them we count later
     and are common target of CSE and similar optimizations.  */
     and are common target of CSE and similar optimizations.  */
  else if (CONSTANT_CLASS_P (x) || REFERENCE_CLASS_P (x))
  else if (CONSTANT_CLASS_P (x) || REFERENCE_CLASS_P (x))
    return NULL;
    return NULL;
 
 
  switch (TREE_CODE (x))
  switch (TREE_CODE (x))
    {
    {
    /* Containers have no cost.  */
    /* Containers have no cost.  */
    case TREE_LIST:
    case TREE_LIST:
    case TREE_VEC:
    case TREE_VEC:
    case BLOCK:
    case BLOCK:
    case COMPONENT_REF:
    case COMPONENT_REF:
    case BIT_FIELD_REF:
    case BIT_FIELD_REF:
    case INDIRECT_REF:
    case INDIRECT_REF:
    case ALIGN_INDIRECT_REF:
    case ALIGN_INDIRECT_REF:
    case MISALIGNED_INDIRECT_REF:
    case MISALIGNED_INDIRECT_REF:
    case ARRAY_REF:
    case ARRAY_REF:
    case ARRAY_RANGE_REF:
    case ARRAY_RANGE_REF:
    case OBJ_TYPE_REF:
    case OBJ_TYPE_REF:
    case EXC_PTR_EXPR: /* ??? */
    case EXC_PTR_EXPR: /* ??? */
    case FILTER_EXPR: /* ??? */
    case FILTER_EXPR: /* ??? */
    case COMPOUND_EXPR:
    case COMPOUND_EXPR:
    case BIND_EXPR:
    case BIND_EXPR:
    case WITH_CLEANUP_EXPR:
    case WITH_CLEANUP_EXPR:
    case NOP_EXPR:
    case NOP_EXPR:
    case VIEW_CONVERT_EXPR:
    case VIEW_CONVERT_EXPR:
    case SAVE_EXPR:
    case SAVE_EXPR:
    case ADDR_EXPR:
    case ADDR_EXPR:
    case COMPLEX_EXPR:
    case COMPLEX_EXPR:
    case RANGE_EXPR:
    case RANGE_EXPR:
    case CASE_LABEL_EXPR:
    case CASE_LABEL_EXPR:
    case SSA_NAME:
    case SSA_NAME:
    case CATCH_EXPR:
    case CATCH_EXPR:
    case EH_FILTER_EXPR:
    case EH_FILTER_EXPR:
    case STATEMENT_LIST:
    case STATEMENT_LIST:
    case ERROR_MARK:
    case ERROR_MARK:
    case NON_LVALUE_EXPR:
    case NON_LVALUE_EXPR:
    case FDESC_EXPR:
    case FDESC_EXPR:
    case VA_ARG_EXPR:
    case VA_ARG_EXPR:
    case TRY_CATCH_EXPR:
    case TRY_CATCH_EXPR:
    case TRY_FINALLY_EXPR:
    case TRY_FINALLY_EXPR:
    case LABEL_EXPR:
    case LABEL_EXPR:
    case GOTO_EXPR:
    case GOTO_EXPR:
    case RETURN_EXPR:
    case RETURN_EXPR:
    case EXIT_EXPR:
    case EXIT_EXPR:
    case LOOP_EXPR:
    case LOOP_EXPR:
    case PHI_NODE:
    case PHI_NODE:
    case WITH_SIZE_EXPR:
    case WITH_SIZE_EXPR:
    case OMP_CLAUSE:
    case OMP_CLAUSE:
    case OMP_RETURN:
    case OMP_RETURN:
    case OMP_CONTINUE:
    case OMP_CONTINUE:
      break;
      break;
 
 
    /* We don't account constants for now.  Assume that the cost is amortized
    /* We don't account constants for now.  Assume that the cost is amortized
       by operations that do use them.  We may re-consider this decision once
       by operations that do use them.  We may re-consider this decision once
       we are able to optimize the tree before estimating its size and break
       we are able to optimize the tree before estimating its size and break
       out static initializers.  */
       out static initializers.  */
    case IDENTIFIER_NODE:
    case IDENTIFIER_NODE:
    case INTEGER_CST:
    case INTEGER_CST:
    case REAL_CST:
    case REAL_CST:
    case COMPLEX_CST:
    case COMPLEX_CST:
    case VECTOR_CST:
    case VECTOR_CST:
    case STRING_CST:
    case STRING_CST:
      *walk_subtrees = 0;
      *walk_subtrees = 0;
      return NULL;
      return NULL;
 
 
    /* Try to estimate the cost of assignments.  We have three cases to
    /* Try to estimate the cost of assignments.  We have three cases to
       deal with:
       deal with:
        1) Simple assignments to registers;
        1) Simple assignments to registers;
        2) Stores to things that must live in memory.  This includes
        2) Stores to things that must live in memory.  This includes
           "normal" stores to scalars, but also assignments of large
           "normal" stores to scalars, but also assignments of large
           structures, or constructors of big arrays;
           structures, or constructors of big arrays;
        3) TARGET_EXPRs.
        3) TARGET_EXPRs.
 
 
       Let us look at the first two cases, assuming we have "a = b + C":
       Let us look at the first two cases, assuming we have "a = b + C":
       <modify_expr <var_decl "a"> <plus_expr <var_decl "b"> <constant C>>
       <modify_expr <var_decl "a"> <plus_expr <var_decl "b"> <constant C>>
       If "a" is a GIMPLE register, the assignment to it is free on almost
       If "a" is a GIMPLE register, the assignment to it is free on almost
       any target, because "a" usually ends up in a real register.  Hence
       any target, because "a" usually ends up in a real register.  Hence
       the only cost of this expression comes from the PLUS_EXPR, and we
       the only cost of this expression comes from the PLUS_EXPR, and we
       can ignore the MODIFY_EXPR.
       can ignore the MODIFY_EXPR.
       If "a" is not a GIMPLE register, the assignment to "a" will most
       If "a" is not a GIMPLE register, the assignment to "a" will most
       likely be a real store, so the cost of the MODIFY_EXPR is the cost
       likely be a real store, so the cost of the MODIFY_EXPR is the cost
       of moving something into "a", which we compute using the function
       of moving something into "a", which we compute using the function
       estimate_move_cost.
       estimate_move_cost.
 
 
       The third case deals with TARGET_EXPRs, for which the semantics are
       The third case deals with TARGET_EXPRs, for which the semantics are
       that a temporary is assigned, unless the TARGET_EXPR itself is being
       that a temporary is assigned, unless the TARGET_EXPR itself is being
       assigned to something else.  In the latter case we do not need the
       assigned to something else.  In the latter case we do not need the
       temporary.  E.g. in <modify_expr <var_decl "a"> <target_expr>>, the
       temporary.  E.g. in <modify_expr <var_decl "a"> <target_expr>>, the
       MODIFY_EXPR is free.  */
       MODIFY_EXPR is free.  */
    case INIT_EXPR:
    case INIT_EXPR:
    case MODIFY_EXPR:
    case MODIFY_EXPR:
      /* Is the right and side a TARGET_EXPR?  */
      /* Is the right and side a TARGET_EXPR?  */
      if (TREE_CODE (TREE_OPERAND (x, 1)) == TARGET_EXPR)
      if (TREE_CODE (TREE_OPERAND (x, 1)) == TARGET_EXPR)
        break;
        break;
      /* ... fall through ...  */
      /* ... fall through ...  */
 
 
    case TARGET_EXPR:
    case TARGET_EXPR:
      x = TREE_OPERAND (x, 0);
      x = TREE_OPERAND (x, 0);
      /* Is this an assignments to a register?  */
      /* Is this an assignments to a register?  */
      if (is_gimple_reg (x))
      if (is_gimple_reg (x))
        break;
        break;
      /* Otherwise it's a store, so fall through to compute the move cost.  */
      /* Otherwise it's a store, so fall through to compute the move cost.  */
 
 
    case CONSTRUCTOR:
    case CONSTRUCTOR:
      *count += estimate_move_cost (TREE_TYPE (x));
      *count += estimate_move_cost (TREE_TYPE (x));
      break;
      break;
 
 
    /* Assign cost of 1 to usual operations.
    /* Assign cost of 1 to usual operations.
       ??? We may consider mapping RTL costs to this.  */
       ??? We may consider mapping RTL costs to this.  */
    case COND_EXPR:
    case COND_EXPR:
    case VEC_COND_EXPR:
    case VEC_COND_EXPR:
 
 
    case PLUS_EXPR:
    case PLUS_EXPR:
    case MINUS_EXPR:
    case MINUS_EXPR:
    case MULT_EXPR:
    case MULT_EXPR:
 
 
    case FIX_TRUNC_EXPR:
    case FIX_TRUNC_EXPR:
    case FIX_CEIL_EXPR:
    case FIX_CEIL_EXPR:
    case FIX_FLOOR_EXPR:
    case FIX_FLOOR_EXPR:
    case FIX_ROUND_EXPR:
    case FIX_ROUND_EXPR:
 
 
    case NEGATE_EXPR:
    case NEGATE_EXPR:
    case FLOAT_EXPR:
    case FLOAT_EXPR:
    case MIN_EXPR:
    case MIN_EXPR:
    case MAX_EXPR:
    case MAX_EXPR:
    case ABS_EXPR:
    case ABS_EXPR:
 
 
    case LSHIFT_EXPR:
    case LSHIFT_EXPR:
    case RSHIFT_EXPR:
    case RSHIFT_EXPR:
    case LROTATE_EXPR:
    case LROTATE_EXPR:
    case RROTATE_EXPR:
    case RROTATE_EXPR:
    case VEC_LSHIFT_EXPR:
    case VEC_LSHIFT_EXPR:
    case VEC_RSHIFT_EXPR:
    case VEC_RSHIFT_EXPR:
 
 
    case BIT_IOR_EXPR:
    case BIT_IOR_EXPR:
    case BIT_XOR_EXPR:
    case BIT_XOR_EXPR:
    case BIT_AND_EXPR:
    case BIT_AND_EXPR:
    case BIT_NOT_EXPR:
    case BIT_NOT_EXPR:
 
 
    case TRUTH_ANDIF_EXPR:
    case TRUTH_ANDIF_EXPR:
    case TRUTH_ORIF_EXPR:
    case TRUTH_ORIF_EXPR:
    case TRUTH_AND_EXPR:
    case TRUTH_AND_EXPR:
    case TRUTH_OR_EXPR:
    case TRUTH_OR_EXPR:
    case TRUTH_XOR_EXPR:
    case TRUTH_XOR_EXPR:
    case TRUTH_NOT_EXPR:
    case TRUTH_NOT_EXPR:
 
 
    case LT_EXPR:
    case LT_EXPR:
    case LE_EXPR:
    case LE_EXPR:
    case GT_EXPR:
    case GT_EXPR:
    case GE_EXPR:
    case GE_EXPR:
    case EQ_EXPR:
    case EQ_EXPR:
    case NE_EXPR:
    case NE_EXPR:
    case ORDERED_EXPR:
    case ORDERED_EXPR:
    case UNORDERED_EXPR:
    case UNORDERED_EXPR:
 
 
    case UNLT_EXPR:
    case UNLT_EXPR:
    case UNLE_EXPR:
    case UNLE_EXPR:
    case UNGT_EXPR:
    case UNGT_EXPR:
    case UNGE_EXPR:
    case UNGE_EXPR:
    case UNEQ_EXPR:
    case UNEQ_EXPR:
    case LTGT_EXPR:
    case LTGT_EXPR:
 
 
    case CONVERT_EXPR:
    case CONVERT_EXPR:
 
 
    case CONJ_EXPR:
    case CONJ_EXPR:
 
 
    case PREDECREMENT_EXPR:
    case PREDECREMENT_EXPR:
    case PREINCREMENT_EXPR:
    case PREINCREMENT_EXPR:
    case POSTDECREMENT_EXPR:
    case POSTDECREMENT_EXPR:
    case POSTINCREMENT_EXPR:
    case POSTINCREMENT_EXPR:
 
 
    case SWITCH_EXPR:
    case SWITCH_EXPR:
 
 
    case ASM_EXPR:
    case ASM_EXPR:
 
 
    case REALIGN_LOAD_EXPR:
    case REALIGN_LOAD_EXPR:
 
 
    case REDUC_MAX_EXPR:
    case REDUC_MAX_EXPR:
    case REDUC_MIN_EXPR:
    case REDUC_MIN_EXPR:
    case REDUC_PLUS_EXPR:
    case REDUC_PLUS_EXPR:
    case WIDEN_SUM_EXPR:
    case WIDEN_SUM_EXPR:
    case DOT_PROD_EXPR:
    case DOT_PROD_EXPR:
 
 
    case WIDEN_MULT_EXPR:
    case WIDEN_MULT_EXPR:
 
 
    case RESX_EXPR:
    case RESX_EXPR:
      *count += 1;
      *count += 1;
      break;
      break;
 
 
    /* Few special cases of expensive operations.  This is useful
    /* Few special cases of expensive operations.  This is useful
       to avoid inlining on functions having too many of these.  */
       to avoid inlining on functions having too many of these.  */
    case TRUNC_DIV_EXPR:
    case TRUNC_DIV_EXPR:
    case CEIL_DIV_EXPR:
    case CEIL_DIV_EXPR:
    case FLOOR_DIV_EXPR:
    case FLOOR_DIV_EXPR:
    case ROUND_DIV_EXPR:
    case ROUND_DIV_EXPR:
    case EXACT_DIV_EXPR:
    case EXACT_DIV_EXPR:
    case TRUNC_MOD_EXPR:
    case TRUNC_MOD_EXPR:
    case CEIL_MOD_EXPR:
    case CEIL_MOD_EXPR:
    case FLOOR_MOD_EXPR:
    case FLOOR_MOD_EXPR:
    case ROUND_MOD_EXPR:
    case ROUND_MOD_EXPR:
    case RDIV_EXPR:
    case RDIV_EXPR:
      *count += 10;
      *count += 10;
      break;
      break;
    case CALL_EXPR:
    case CALL_EXPR:
      {
      {
        tree decl = get_callee_fndecl (x);
        tree decl = get_callee_fndecl (x);
        tree arg;
        tree arg;
 
 
        if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
        if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
          switch (DECL_FUNCTION_CODE (decl))
          switch (DECL_FUNCTION_CODE (decl))
            {
            {
            case BUILT_IN_CONSTANT_P:
            case BUILT_IN_CONSTANT_P:
              *walk_subtrees = 0;
              *walk_subtrees = 0;
              return NULL_TREE;
              return NULL_TREE;
            case BUILT_IN_EXPECT:
            case BUILT_IN_EXPECT:
              return NULL_TREE;
              return NULL_TREE;
            default:
            default:
              break;
              break;
            }
            }
 
 
        /* Our cost must be kept in sync with cgraph_estimate_size_after_inlining
        /* Our cost must be kept in sync with cgraph_estimate_size_after_inlining
           that does use function declaration to figure out the arguments.  */
           that does use function declaration to figure out the arguments.  */
        if (!decl)
        if (!decl)
          {
          {
            for (arg = TREE_OPERAND (x, 1); arg; arg = TREE_CHAIN (arg))
            for (arg = TREE_OPERAND (x, 1); arg; arg = TREE_CHAIN (arg))
              *count += estimate_move_cost (TREE_TYPE (TREE_VALUE (arg)));
              *count += estimate_move_cost (TREE_TYPE (TREE_VALUE (arg)));
          }
          }
        else
        else
          {
          {
            for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
            for (arg = DECL_ARGUMENTS (decl); arg; arg = TREE_CHAIN (arg))
              *count += estimate_move_cost (TREE_TYPE (arg));
              *count += estimate_move_cost (TREE_TYPE (arg));
          }
          }
 
 
        *count += PARAM_VALUE (PARAM_INLINE_CALL_COST);
        *count += PARAM_VALUE (PARAM_INLINE_CALL_COST);
        break;
        break;
      }
      }
 
 
    case OMP_PARALLEL:
    case OMP_PARALLEL:
    case OMP_FOR:
    case OMP_FOR:
    case OMP_SECTIONS:
    case OMP_SECTIONS:
    case OMP_SINGLE:
    case OMP_SINGLE:
    case OMP_SECTION:
    case OMP_SECTION:
    case OMP_MASTER:
    case OMP_MASTER:
    case OMP_ORDERED:
    case OMP_ORDERED:
    case OMP_CRITICAL:
    case OMP_CRITICAL:
    case OMP_ATOMIC:
    case OMP_ATOMIC:
      /* OpenMP directives are generally very expensive.  */
      /* OpenMP directives are generally very expensive.  */
      *count += 40;
      *count += 40;
      break;
      break;
 
 
    default:
    default:
      gcc_unreachable ();
      gcc_unreachable ();
    }
    }
  return NULL;
  return NULL;
}
}
 
 
/* Estimate number of instructions that will be created by expanding EXPR.  */
/* Estimate number of instructions that will be created by expanding EXPR.  */
 
 
int
int
estimate_num_insns (tree expr)
estimate_num_insns (tree expr)
{
{
  int num = 0;
  int num = 0;
  struct pointer_set_t *visited_nodes;
  struct pointer_set_t *visited_nodes;
  basic_block bb;
  basic_block bb;
  block_stmt_iterator bsi;
  block_stmt_iterator bsi;
  struct function *my_function;
  struct function *my_function;
 
 
  /* If we're given an entire function, walk the CFG.  */
  /* If we're given an entire function, walk the CFG.  */
  if (TREE_CODE (expr) == FUNCTION_DECL)
  if (TREE_CODE (expr) == FUNCTION_DECL)
    {
    {
      my_function = DECL_STRUCT_FUNCTION (expr);
      my_function = DECL_STRUCT_FUNCTION (expr);
      gcc_assert (my_function && my_function->cfg);
      gcc_assert (my_function && my_function->cfg);
      visited_nodes = pointer_set_create ();
      visited_nodes = pointer_set_create ();
      FOR_EACH_BB_FN (bb, my_function)
      FOR_EACH_BB_FN (bb, my_function)
        {
        {
          for (bsi = bsi_start (bb);
          for (bsi = bsi_start (bb);
               !bsi_end_p (bsi);
               !bsi_end_p (bsi);
               bsi_next (&bsi))
               bsi_next (&bsi))
            {
            {
              walk_tree (bsi_stmt_ptr (bsi), estimate_num_insns_1,
              walk_tree (bsi_stmt_ptr (bsi), estimate_num_insns_1,
                         &num, visited_nodes);
                         &num, visited_nodes);
            }
            }
        }
        }
      pointer_set_destroy (visited_nodes);
      pointer_set_destroy (visited_nodes);
    }
    }
  else
  else
    walk_tree_without_duplicates (&expr, estimate_num_insns_1, &num);
    walk_tree_without_duplicates (&expr, estimate_num_insns_1, &num);
 
 
  return num;
  return num;
}
}
 
 
typedef struct function *function_p;
typedef struct function *function_p;
 
 
DEF_VEC_P(function_p);
DEF_VEC_P(function_p);
DEF_VEC_ALLOC_P(function_p,heap);
DEF_VEC_ALLOC_P(function_p,heap);
 
 
/* Initialized with NOGC, making this poisonous to the garbage collector.  */
/* Initialized with NOGC, making this poisonous to the garbage collector.  */
static VEC(function_p,heap) *cfun_stack;
static VEC(function_p,heap) *cfun_stack;
 
 
void
void
push_cfun (struct function *new_cfun)
push_cfun (struct function *new_cfun)
{
{
  VEC_safe_push (function_p, heap, cfun_stack, cfun);
  VEC_safe_push (function_p, heap, cfun_stack, cfun);
  cfun = new_cfun;
  cfun = new_cfun;
}
}
 
 
void
void
pop_cfun (void)
pop_cfun (void)
{
{
  cfun = VEC_pop (function_p, cfun_stack);
  cfun = VEC_pop (function_p, cfun_stack);
}
}
 
 
/* Install new lexical TREE_BLOCK underneath 'current_block'.  */
/* Install new lexical TREE_BLOCK underneath 'current_block'.  */
static void
static void
add_lexical_block (tree current_block, tree new_block)
add_lexical_block (tree current_block, tree new_block)
{
{
  tree *blk_p;
  tree *blk_p;
 
 
  /* Walk to the last sub-block.  */
  /* Walk to the last sub-block.  */
  for (blk_p = &BLOCK_SUBBLOCKS (current_block);
  for (blk_p = &BLOCK_SUBBLOCKS (current_block);
       *blk_p;
       *blk_p;
       blk_p = &TREE_CHAIN (*blk_p))
       blk_p = &TREE_CHAIN (*blk_p))
    ;
    ;
  *blk_p = new_block;
  *blk_p = new_block;
  BLOCK_SUPERCONTEXT (new_block) = current_block;
  BLOCK_SUPERCONTEXT (new_block) = current_block;
}
}
 
 
/* If *TP is a CALL_EXPR, replace it with its inline expansion.  */
/* If *TP is a CALL_EXPR, replace it with its inline expansion.  */
 
 
static bool
static bool
expand_call_inline (basic_block bb, tree stmt, tree *tp, void *data)
expand_call_inline (basic_block bb, tree stmt, tree *tp, void *data)
{
{
  copy_body_data *id;
  copy_body_data *id;
  tree t;
  tree t;
  tree use_retvar;
  tree use_retvar;
  tree fn;
  tree fn;
  splay_tree st;
  splay_tree st;
  tree args;
  tree args;
  tree return_slot_addr;
  tree return_slot_addr;
  tree modify_dest;
  tree modify_dest;
  location_t saved_location;
  location_t saved_location;
  struct cgraph_edge *cg_edge;
  struct cgraph_edge *cg_edge;
  const char *reason;
  const char *reason;
  basic_block return_block;
  basic_block return_block;
  edge e;
  edge e;
  block_stmt_iterator bsi, stmt_bsi;
  block_stmt_iterator bsi, stmt_bsi;
  bool successfully_inlined = FALSE;
  bool successfully_inlined = FALSE;
  bool purge_dead_abnormal_edges;
  bool purge_dead_abnormal_edges;
  tree t_step;
  tree t_step;
  tree var;
  tree var;
 
 
  /* See what we've got.  */
  /* See what we've got.  */
  id = (copy_body_data *) data;
  id = (copy_body_data *) data;
  t = *tp;
  t = *tp;
 
 
  /* Set input_location here so we get the right instantiation context
  /* Set input_location here so we get the right instantiation context
     if we call instantiate_decl from inlinable_function_p.  */
     if we call instantiate_decl from inlinable_function_p.  */
  saved_location = input_location;
  saved_location = input_location;
  if (EXPR_HAS_LOCATION (t))
  if (EXPR_HAS_LOCATION (t))
    input_location = EXPR_LOCATION (t);
    input_location = EXPR_LOCATION (t);
 
 
  /* From here on, we're only interested in CALL_EXPRs.  */
  /* From here on, we're only interested in CALL_EXPRs.  */
  if (TREE_CODE (t) != CALL_EXPR)
  if (TREE_CODE (t) != CALL_EXPR)
    goto egress;
    goto egress;
 
 
  /* First, see if we can figure out what function is being called.
  /* First, see if we can figure out what function is being called.
     If we cannot, then there is no hope of inlining the function.  */
     If we cannot, then there is no hope of inlining the function.  */
  fn = get_callee_fndecl (t);
  fn = get_callee_fndecl (t);
  if (!fn)
  if (!fn)
    goto egress;
    goto egress;
 
 
  /* Turn forward declarations into real ones.  */
  /* Turn forward declarations into real ones.  */
  fn = cgraph_node (fn)->decl;
  fn = cgraph_node (fn)->decl;
 
 
  /* If fn is a declaration of a function in a nested scope that was
  /* If fn is a declaration of a function in a nested scope that was
     globally declared inline, we don't set its DECL_INITIAL.
     globally declared inline, we don't set its DECL_INITIAL.
     However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
     However, we can't blindly follow DECL_ABSTRACT_ORIGIN because the
     C++ front-end uses it for cdtors to refer to their internal
     C++ front-end uses it for cdtors to refer to their internal
     declarations, that are not real functions.  Fortunately those
     declarations, that are not real functions.  Fortunately those
     don't have trees to be saved, so we can tell by checking their
     don't have trees to be saved, so we can tell by checking their
     DECL_SAVED_TREE.  */
     DECL_SAVED_TREE.  */
  if (! DECL_INITIAL (fn)
  if (! DECL_INITIAL (fn)
      && DECL_ABSTRACT_ORIGIN (fn)
      && DECL_ABSTRACT_ORIGIN (fn)
      && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn)))
      && DECL_SAVED_TREE (DECL_ABSTRACT_ORIGIN (fn)))
    fn = DECL_ABSTRACT_ORIGIN (fn);
    fn = DECL_ABSTRACT_ORIGIN (fn);
 
 
  /* Objective C and fortran still calls tree_rest_of_compilation directly.
  /* Objective C and fortran still calls tree_rest_of_compilation directly.
     Kill this check once this is fixed.  */
     Kill this check once this is fixed.  */
  if (!id->dst_node->analyzed)
  if (!id->dst_node->analyzed)
    goto egress;
    goto egress;
 
 
  cg_edge = cgraph_edge (id->dst_node, stmt);
  cg_edge = cgraph_edge (id->dst_node, stmt);
 
 
  /* Constant propagation on argument done during previous inlining
  /* Constant propagation on argument done during previous inlining
     may create new direct call.  Produce an edge for it.  */
     may create new direct call.  Produce an edge for it.  */
  if (!cg_edge)
  if (!cg_edge)
    {
    {
      struct cgraph_node *dest = cgraph_node (fn);
      struct cgraph_node *dest = cgraph_node (fn);
 
 
      /* We have missing edge in the callgraph.  This can happen in one case
      /* We have missing edge in the callgraph.  This can happen in one case
         where previous inlining turned indirect call into direct call by
         where previous inlining turned indirect call into direct call by
         constant propagating arguments.  In all other cases we hit a bug
         constant propagating arguments.  In all other cases we hit a bug
         (incorrect node sharing is most common reason for missing edges.  */
         (incorrect node sharing is most common reason for missing edges.  */
      gcc_assert (dest->needed || !flag_unit_at_a_time);
      gcc_assert (dest->needed || !flag_unit_at_a_time);
      cgraph_create_edge (id->dst_node, dest, stmt,
      cgraph_create_edge (id->dst_node, dest, stmt,
                          bb->count, bb->loop_depth)->inline_failed
                          bb->count, bb->loop_depth)->inline_failed
        = N_("originally indirect function call not considered for inlining");
        = N_("originally indirect function call not considered for inlining");
      goto egress;
      goto egress;
    }
    }
 
 
  /* Don't try to inline functions that are not well-suited to
  /* Don't try to inline functions that are not well-suited to
     inlining.  */
     inlining.  */
  if (!cgraph_inline_p (cg_edge, &reason))
  if (!cgraph_inline_p (cg_edge, &reason))
    {
    {
      if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
      if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (fn))
          /* Avoid warnings during early inline pass. */
          /* Avoid warnings during early inline pass. */
          && (!flag_unit_at_a_time || cgraph_global_info_ready))
          && (!flag_unit_at_a_time || cgraph_global_info_ready))
        {
        {
          sorry ("inlining failed in call to %q+F: %s", fn, reason);
          sorry ("inlining failed in call to %q+F: %s", fn, reason);
          sorry ("called from here");
          sorry ("called from here");
        }
        }
      else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
      else if (warn_inline && DECL_DECLARED_INLINE_P (fn)
               && !DECL_IN_SYSTEM_HEADER (fn)
               && !DECL_IN_SYSTEM_HEADER (fn)
               && strlen (reason)
               && strlen (reason)
               && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
               && !lookup_attribute ("noinline", DECL_ATTRIBUTES (fn))
               /* Avoid warnings during early inline pass. */
               /* Avoid warnings during early inline pass. */
               && (!flag_unit_at_a_time || cgraph_global_info_ready))
               && (!flag_unit_at_a_time || cgraph_global_info_ready))
        {
        {
          warning (OPT_Winline, "inlining failed in call to %q+F: %s",
          warning (OPT_Winline, "inlining failed in call to %q+F: %s",
                   fn, reason);
                   fn, reason);
          warning (OPT_Winline, "called from here");
          warning (OPT_Winline, "called from here");
        }
        }
      goto egress;
      goto egress;
    }
    }
  fn = cg_edge->callee->decl;
  fn = cg_edge->callee->decl;
 
 
#ifdef ENABLE_CHECKING
#ifdef ENABLE_CHECKING
  if (cg_edge->callee->decl != id->dst_node->decl)
  if (cg_edge->callee->decl != id->dst_node->decl)
    verify_cgraph_node (cg_edge->callee);
    verify_cgraph_node (cg_edge->callee);
#endif
#endif
 
 
  /* We will be inlining this callee.  */
  /* We will be inlining this callee.  */
  id->eh_region = lookup_stmt_eh_region (stmt);
  id->eh_region = lookup_stmt_eh_region (stmt);
 
 
  /* Split the block holding the CALL_EXPR.  */
  /* Split the block holding the CALL_EXPR.  */
  e = split_block (bb, stmt);
  e = split_block (bb, stmt);
  bb = e->src;
  bb = e->src;
  return_block = e->dest;
  return_block = e->dest;
  remove_edge (e);
  remove_edge (e);
 
 
  /* split_block splits after the statement; work around this by
  /* split_block splits after the statement; work around this by
     moving the call into the second block manually.  Not pretty,
     moving the call into the second block manually.  Not pretty,
     but seems easier than doing the CFG manipulation by hand
     but seems easier than doing the CFG manipulation by hand
     when the CALL_EXPR is in the last statement of BB.  */
     when the CALL_EXPR is in the last statement of BB.  */
  stmt_bsi = bsi_last (bb);
  stmt_bsi = bsi_last (bb);
  bsi_remove (&stmt_bsi, false);
  bsi_remove (&stmt_bsi, false);
 
 
  /* If the CALL_EXPR was in the last statement of BB, it may have
  /* If the CALL_EXPR was in the last statement of BB, it may have
     been the source of abnormal edges.  In this case, schedule
     been the source of abnormal edges.  In this case, schedule
     the removal of dead abnormal edges.  */
     the removal of dead abnormal edges.  */
  bsi = bsi_start (return_block);
  bsi = bsi_start (return_block);
  if (bsi_end_p (bsi))
  if (bsi_end_p (bsi))
    {
    {
      bsi_insert_after (&bsi, stmt, BSI_NEW_STMT);
      bsi_insert_after (&bsi, stmt, BSI_NEW_STMT);
      purge_dead_abnormal_edges = true;
      purge_dead_abnormal_edges = true;
    }
    }
  else
  else
    {
    {
      bsi_insert_before (&bsi, stmt, BSI_NEW_STMT);
      bsi_insert_before (&bsi, stmt, BSI_NEW_STMT);
      purge_dead_abnormal_edges = false;
      purge_dead_abnormal_edges = false;
    }
    }
 
 
  stmt_bsi = bsi_start (return_block);
  stmt_bsi = bsi_start (return_block);
 
 
  /* Build a block containing code to initialize the arguments, the
  /* Build a block containing code to initialize the arguments, the
     actual inline expansion of the body, and a label for the return
     actual inline expansion of the body, and a label for the return
     statements within the function to jump to.  The type of the
     statements within the function to jump to.  The type of the
     statement expression is the return type of the function call.  */
     statement expression is the return type of the function call.  */
  id->block = make_node (BLOCK);
  id->block = make_node (BLOCK);
  BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
  BLOCK_ABSTRACT_ORIGIN (id->block) = fn;
  BLOCK_SOURCE_LOCATION (id->block) = input_location;
  BLOCK_SOURCE_LOCATION (id->block) = input_location;
  add_lexical_block (TREE_BLOCK (stmt), id->block);
  add_lexical_block (TREE_BLOCK (stmt), id->block);
 
 
  /* Local declarations will be replaced by their equivalents in this
  /* Local declarations will be replaced by their equivalents in this
     map.  */
     map.  */
  st = id->decl_map;
  st = id->decl_map;
  id->decl_map = splay_tree_new (splay_tree_compare_pointers,
  id->decl_map = splay_tree_new (splay_tree_compare_pointers,
                                 NULL, NULL);
                                 NULL, NULL);
 
 
  /* Initialize the parameters.  */
  /* Initialize the parameters.  */
  args = TREE_OPERAND (t, 1);
  args = TREE_OPERAND (t, 1);
 
 
  /* Record the function we are about to inline.  */
  /* Record the function we are about to inline.  */
  id->src_fn = fn;
  id->src_fn = fn;
  id->src_node = cg_edge->callee;
  id->src_node = cg_edge->callee;
 
 
  initialize_inlined_parameters (id, args, TREE_OPERAND (t, 2), fn, bb);
  initialize_inlined_parameters (id, args, TREE_OPERAND (t, 2), fn, bb);
 
 
  if (DECL_INITIAL (fn))
  if (DECL_INITIAL (fn))
    add_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
    add_lexical_block (id->block, remap_blocks (DECL_INITIAL (fn), id));
 
 
  /* Return statements in the function body will be replaced by jumps
  /* Return statements in the function body will be replaced by jumps
     to the RET_LABEL.  */
     to the RET_LABEL.  */
 
 
  gcc_assert (DECL_INITIAL (fn));
  gcc_assert (DECL_INITIAL (fn));
  gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
  gcc_assert (TREE_CODE (DECL_INITIAL (fn)) == BLOCK);
 
 
  /* Find the lhs to which the result of this call is assigned.  */
  /* Find the lhs to which the result of this call is assigned.  */
  return_slot_addr = NULL;
  return_slot_addr = NULL;
  if (TREE_CODE (stmt) == MODIFY_EXPR)
  if (TREE_CODE (stmt) == MODIFY_EXPR)
    {
    {
      modify_dest = TREE_OPERAND (stmt, 0);
      modify_dest = TREE_OPERAND (stmt, 0);
 
 
      /* The function which we are inlining might not return a value,
      /* The function which we are inlining might not return a value,
         in which case we should issue a warning that the function
         in which case we should issue a warning that the function
         does not return a value.  In that case the optimizers will
         does not return a value.  In that case the optimizers will
         see that the variable to which the value is assigned was not
         see that the variable to which the value is assigned was not
         initialized.  We do not want to issue a warning about that
         initialized.  We do not want to issue a warning about that
         uninitialized variable.  */
         uninitialized variable.  */
      if (DECL_P (modify_dest))
      if (DECL_P (modify_dest))
        TREE_NO_WARNING (modify_dest) = 1;
        TREE_NO_WARNING (modify_dest) = 1;
      if (CALL_EXPR_RETURN_SLOT_OPT (t))
      if (CALL_EXPR_RETURN_SLOT_OPT (t))
        {
        {
          return_slot_addr = build_fold_addr_expr (modify_dest);
          return_slot_addr = build_fold_addr_expr (modify_dest);
          STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
          STRIP_USELESS_TYPE_CONVERSION (return_slot_addr);
          modify_dest = NULL;
          modify_dest = NULL;
        }
        }
    }
    }
  else
  else
    modify_dest = NULL;
    modify_dest = NULL;
 
 
  /* Declare the return variable for the function.  */
  /* Declare the return variable for the function.  */
  declare_return_variable (id, return_slot_addr,
  declare_return_variable (id, return_slot_addr,
                           modify_dest, &use_retvar);
                           modify_dest, &use_retvar);
 
 
  /* This is it.  Duplicate the callee body.  Assume callee is
  /* This is it.  Duplicate the callee body.  Assume callee is
     pre-gimplified.  Note that we must not alter the caller
     pre-gimplified.  Note that we must not alter the caller
     function in any way before this point, as this CALL_EXPR may be
     function in any way before this point, as this CALL_EXPR may be
     a self-referential call; if we're calling ourselves, we need to
     a self-referential call; if we're calling ourselves, we need to
     duplicate our body before altering anything.  */
     duplicate our body before altering anything.  */
  copy_body (id, bb->count, bb->frequency, bb, return_block);
  copy_body (id, bb->count, bb->frequency, bb, return_block);
 
 
  /* Add local vars in this inlined callee to caller.  */
  /* Add local vars in this inlined callee to caller.  */
  t_step = id->src_cfun->unexpanded_var_list;
  t_step = id->src_cfun->unexpanded_var_list;
  for (; t_step; t_step = TREE_CHAIN (t_step))
  for (; t_step; t_step = TREE_CHAIN (t_step))
    {
    {
      var = TREE_VALUE (t_step);
      var = TREE_VALUE (t_step);
      if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
      if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
        cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
        cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
                                               cfun->unexpanded_var_list);
                                               cfun->unexpanded_var_list);
      else
      else
        cfun->unexpanded_var_list = tree_cons (NULL_TREE, remap_decl (var, id),
        cfun->unexpanded_var_list = tree_cons (NULL_TREE, remap_decl (var, id),
                                               cfun->unexpanded_var_list);
                                               cfun->unexpanded_var_list);
    }
    }
 
 
  /* Clean up.  */
  /* Clean up.  */
  splay_tree_delete (id->decl_map);
  splay_tree_delete (id->decl_map);
  id->decl_map = st;
  id->decl_map = st;
 
 
  /* If the inlined function returns a result that we care about,
  /* If the inlined function returns a result that we care about,
     clobber the CALL_EXPR with a reference to the return variable.  */
     clobber the CALL_EXPR with a reference to the return variable.  */
  if (use_retvar && (TREE_CODE (bsi_stmt (stmt_bsi)) != CALL_EXPR))
  if (use_retvar && (TREE_CODE (bsi_stmt (stmt_bsi)) != CALL_EXPR))
    {
    {
      *tp = use_retvar;
      *tp = use_retvar;
      maybe_clean_or_replace_eh_stmt (stmt, stmt);
      maybe_clean_or_replace_eh_stmt (stmt, stmt);
    }
    }
  else
  else
    /* We're modifying a TSI owned by gimple_expand_calls_inline();
    /* We're modifying a TSI owned by gimple_expand_calls_inline();
       tsi_delink() will leave the iterator in a sane state.  */
       tsi_delink() will leave the iterator in a sane state.  */
    bsi_remove (&stmt_bsi, true);
    bsi_remove (&stmt_bsi, true);
 
 
  if (purge_dead_abnormal_edges)
  if (purge_dead_abnormal_edges)
    tree_purge_dead_abnormal_call_edges (return_block);
    tree_purge_dead_abnormal_call_edges (return_block);
 
 
  /* If the value of the new expression is ignored, that's OK.  We
  /* If the value of the new expression is ignored, that's OK.  We
     don't warn about this for CALL_EXPRs, so we shouldn't warn about
     don't warn about this for CALL_EXPRs, so we shouldn't warn about
     the equivalent inlined version either.  */
     the equivalent inlined version either.  */
  TREE_USED (*tp) = 1;
  TREE_USED (*tp) = 1;
 
 
  /* Output the inlining info for this abstract function, since it has been
  /* Output the inlining info for this abstract function, since it has been
     inlined.  If we don't do this now, we can lose the information about the
     inlined.  If we don't do this now, we can lose the information about the
     variables in the function when the blocks get blown away as soon as we
     variables in the function when the blocks get blown away as soon as we
     remove the cgraph node.  */
     remove the cgraph node.  */
  (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
  (*debug_hooks->outlining_inline_function) (cg_edge->callee->decl);
 
 
  /* Update callgraph if needed.  */
  /* Update callgraph if needed.  */
  cgraph_remove_node (cg_edge->callee);
  cgraph_remove_node (cg_edge->callee);
 
 
  id->block = NULL_TREE;
  id->block = NULL_TREE;
  successfully_inlined = TRUE;
  successfully_inlined = TRUE;
 
 
 egress:
 egress:
  input_location = saved_location;
  input_location = saved_location;
  return successfully_inlined;
  return successfully_inlined;
}
}
 
 
/* Expand call statements reachable from STMT_P.
/* Expand call statements reachable from STMT_P.
   We can only have CALL_EXPRs as the "toplevel" tree code or nested
   We can only have CALL_EXPRs as the "toplevel" tree code or nested
   in a MODIFY_EXPR.  See tree-gimple.c:get_call_expr_in().  We can
   in a MODIFY_EXPR.  See tree-gimple.c:get_call_expr_in().  We can
   unfortunately not use that function here because we need a pointer
   unfortunately not use that function here because we need a pointer
   to the CALL_EXPR, not the tree itself.  */
   to the CALL_EXPR, not the tree itself.  */
 
 
static bool
static bool
gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
gimple_expand_calls_inline (basic_block bb, copy_body_data *id)
{
{
  block_stmt_iterator bsi;
  block_stmt_iterator bsi;
 
 
  /* Register specific tree functions.  */
  /* Register specific tree functions.  */
  tree_register_cfg_hooks ();
  tree_register_cfg_hooks ();
  for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
  for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
    {
    {
      tree *expr_p = bsi_stmt_ptr (bsi);
      tree *expr_p = bsi_stmt_ptr (bsi);
      tree stmt = *expr_p;
      tree stmt = *expr_p;
 
 
      if (TREE_CODE (*expr_p) == MODIFY_EXPR)
      if (TREE_CODE (*expr_p) == MODIFY_EXPR)
        expr_p = &TREE_OPERAND (*expr_p, 1);
        expr_p = &TREE_OPERAND (*expr_p, 1);
      if (TREE_CODE (*expr_p) == WITH_SIZE_EXPR)
      if (TREE_CODE (*expr_p) == WITH_SIZE_EXPR)
        expr_p = &TREE_OPERAND (*expr_p, 0);
        expr_p = &TREE_OPERAND (*expr_p, 0);
      if (TREE_CODE (*expr_p) == CALL_EXPR)
      if (TREE_CODE (*expr_p) == CALL_EXPR)
        if (expand_call_inline (bb, stmt, expr_p, id))
        if (expand_call_inline (bb, stmt, expr_p, id))
          return true;
          return true;
    }
    }
  return false;
  return false;
}
}
 
 
/* Expand calls to inline functions in the body of FN.  */
/* Expand calls to inline functions in the body of FN.  */
 
 
void
void
optimize_inline_calls (tree fn)
optimize_inline_calls (tree fn)
{
{
  copy_body_data id;
  copy_body_data id;
  tree prev_fn;
  tree prev_fn;
  basic_block bb;
  basic_block bb;
  /* There is no point in performing inlining if errors have already
  /* There is no point in performing inlining if errors have already
     occurred -- and we might crash if we try to inline invalid
     occurred -- and we might crash if we try to inline invalid
     code.  */
     code.  */
  if (errorcount || sorrycount)
  if (errorcount || sorrycount)
    return;
    return;
 
 
  /* Clear out ID.  */
  /* Clear out ID.  */
  memset (&id, 0, sizeof (id));
  memset (&id, 0, sizeof (id));
 
 
  id.src_node = id.dst_node = cgraph_node (fn);
  id.src_node = id.dst_node = cgraph_node (fn);
  id.dst_fn = fn;
  id.dst_fn = fn;
  /* Or any functions that aren't finished yet.  */
  /* Or any functions that aren't finished yet.  */
  prev_fn = NULL_TREE;
  prev_fn = NULL_TREE;
  if (current_function_decl)
  if (current_function_decl)
    {
    {
      id.dst_fn = current_function_decl;
      id.dst_fn = current_function_decl;
      prev_fn = current_function_decl;
      prev_fn = current_function_decl;
    }
    }
 
 
  id.copy_decl = copy_decl_maybe_to_var;
  id.copy_decl = copy_decl_maybe_to_var;
  id.transform_call_graph_edges = CB_CGE_DUPLICATE;
  id.transform_call_graph_edges = CB_CGE_DUPLICATE;
  id.transform_new_cfg = false;
  id.transform_new_cfg = false;
  id.transform_return_to_modify = true;
  id.transform_return_to_modify = true;
  id.transform_lang_insert_block = false;
  id.transform_lang_insert_block = false;
 
 
  push_gimplify_context ();
  push_gimplify_context ();
 
 
  /* Reach the trees by walking over the CFG, and note the
  /* Reach the trees by walking over the CFG, and note the
     enclosing basic-blocks in the call edges.  */
     enclosing basic-blocks in the call edges.  */
  /* We walk the blocks going forward, because inlined function bodies
  /* We walk the blocks going forward, because inlined function bodies
     will split id->current_basic_block, and the new blocks will
     will split id->current_basic_block, and the new blocks will
     follow it; we'll trudge through them, processing their CALL_EXPRs
     follow it; we'll trudge through them, processing their CALL_EXPRs
     along the way.  */
     along the way.  */
  FOR_EACH_BB (bb)
  FOR_EACH_BB (bb)
    gimple_expand_calls_inline (bb, &id);
    gimple_expand_calls_inline (bb, &id);
 
 
  pop_gimplify_context (NULL);
  pop_gimplify_context (NULL);
  /* Renumber the (code) basic_blocks consecutively.  */
  /* Renumber the (code) basic_blocks consecutively.  */
  compact_blocks ();
  compact_blocks ();
  /* Renumber the lexical scoping (non-code) blocks consecutively.  */
  /* Renumber the lexical scoping (non-code) blocks consecutively.  */
  number_blocks (fn);
  number_blocks (fn);
 
 
#ifdef ENABLE_CHECKING
#ifdef ENABLE_CHECKING
    {
    {
      struct cgraph_edge *e;
      struct cgraph_edge *e;
 
 
      verify_cgraph_node (id.dst_node);
      verify_cgraph_node (id.dst_node);
 
 
      /* Double check that we inlined everything we are supposed to inline.  */
      /* Double check that we inlined everything we are supposed to inline.  */
      for (e = id.dst_node->callees; e; e = e->next_callee)
      for (e = id.dst_node->callees; e; e = e->next_callee)
        gcc_assert (e->inline_failed);
        gcc_assert (e->inline_failed);
    }
    }
#endif
#endif
  /* We need to rescale frequencies again to peak at REG_BR_PROB_BASE
  /* We need to rescale frequencies again to peak at REG_BR_PROB_BASE
     as inlining loops might increase the maximum.  */
     as inlining loops might increase the maximum.  */
  if (ENTRY_BLOCK_PTR->count)
  if (ENTRY_BLOCK_PTR->count)
    counts_to_freqs ();
    counts_to_freqs ();
  fold_cond_expr_cond ();
  fold_cond_expr_cond ();
}
}
 
 
/* FN is a function that has a complete body, and CLONE is a function whose
/* FN is a function that has a complete body, and CLONE is a function whose
   body is to be set to a copy of FN, mapping argument declarations according
   body is to be set to a copy of FN, mapping argument declarations according
   to the ARG_MAP splay_tree.  */
   to the ARG_MAP splay_tree.  */
 
 
void
void
clone_body (tree clone, tree fn, void *arg_map)
clone_body (tree clone, tree fn, void *arg_map)
{
{
  copy_body_data id;
  copy_body_data id;
 
 
  /* Clone the body, as if we were making an inline call.  But, remap the
  /* Clone the body, as if we were making an inline call.  But, remap the
     parameters in the callee to the parameters of caller.  */
     parameters in the callee to the parameters of caller.  */
  memset (&id, 0, sizeof (id));
  memset (&id, 0, sizeof (id));
  id.src_fn = fn;
  id.src_fn = fn;
  id.dst_fn = clone;
  id.dst_fn = clone;
  id.src_cfun = DECL_STRUCT_FUNCTION (fn);
  id.src_cfun = DECL_STRUCT_FUNCTION (fn);
  id.decl_map = (splay_tree)arg_map;
  id.decl_map = (splay_tree)arg_map;
 
 
  id.copy_decl = copy_decl_no_change;
  id.copy_decl = copy_decl_no_change;
  id.transform_call_graph_edges = CB_CGE_DUPLICATE;
  id.transform_call_graph_edges = CB_CGE_DUPLICATE;
  id.transform_new_cfg = true;
  id.transform_new_cfg = true;
  id.transform_return_to_modify = false;
  id.transform_return_to_modify = false;
  id.transform_lang_insert_block = true;
  id.transform_lang_insert_block = true;
 
 
  /* We're not inside any EH region.  */
  /* We're not inside any EH region.  */
  id.eh_region = -1;
  id.eh_region = -1;
 
 
  /* Actually copy the body.  */
  /* Actually copy the body.  */
  append_to_statement_list_force (copy_generic_body (&id), &DECL_SAVED_TREE (clone));
  append_to_statement_list_force (copy_generic_body (&id), &DECL_SAVED_TREE (clone));
}
}
 
 
/* Passed to walk_tree.  Copies the node pointed to, if appropriate.  */
/* Passed to walk_tree.  Copies the node pointed to, if appropriate.  */
 
 
tree
tree
copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
{
{
  enum tree_code code = TREE_CODE (*tp);
  enum tree_code code = TREE_CODE (*tp);
 
 
  /* We make copies of most nodes.  */
  /* We make copies of most nodes.  */
  if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
  if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
      || code == TREE_LIST
      || code == TREE_LIST
      || code == TREE_VEC
      || code == TREE_VEC
      || code == TYPE_DECL
      || code == TYPE_DECL
      || code == OMP_CLAUSE)
      || code == OMP_CLAUSE)
    {
    {
      /* Because the chain gets clobbered when we make a copy, we save it
      /* Because the chain gets clobbered when we make a copy, we save it
         here.  */
         here.  */
      tree chain = TREE_CHAIN (*tp);
      tree chain = TREE_CHAIN (*tp);
      tree new;
      tree new;
 
 
      /* Copy the node.  */
      /* Copy the node.  */
      new = copy_node (*tp);
      new = copy_node (*tp);
 
 
      /* Propagate mudflap marked-ness.  */
      /* Propagate mudflap marked-ness.  */
      if (flag_mudflap && mf_marked_p (*tp))
      if (flag_mudflap && mf_marked_p (*tp))
        mf_mark (new);
        mf_mark (new);
 
 
      *tp = new;
      *tp = new;
 
 
      /* Now, restore the chain, if appropriate.  That will cause
      /* Now, restore the chain, if appropriate.  That will cause
         walk_tree to walk into the chain as well.  */
         walk_tree to walk into the chain as well.  */
      if (code == PARM_DECL
      if (code == PARM_DECL
          || code == TREE_LIST
          || code == TREE_LIST
          || code == OMP_CLAUSE)
          || code == OMP_CLAUSE)
        TREE_CHAIN (*tp) = chain;
        TREE_CHAIN (*tp) = chain;
 
 
      /* For now, we don't update BLOCKs when we make copies.  So, we
      /* For now, we don't update BLOCKs when we make copies.  So, we
         have to nullify all BIND_EXPRs.  */
         have to nullify all BIND_EXPRs.  */
      if (TREE_CODE (*tp) == BIND_EXPR)
      if (TREE_CODE (*tp) == BIND_EXPR)
        BIND_EXPR_BLOCK (*tp) = NULL_TREE;
        BIND_EXPR_BLOCK (*tp) = NULL_TREE;
    }
    }
  else if (code == CONSTRUCTOR)
  else if (code == CONSTRUCTOR)
    {
    {
      /* CONSTRUCTOR nodes need special handling because
      /* CONSTRUCTOR nodes need special handling because
         we need to duplicate the vector of elements.  */
         we need to duplicate the vector of elements.  */
      tree new;
      tree new;
 
 
      new = copy_node (*tp);
      new = copy_node (*tp);
 
 
      /* Propagate mudflap marked-ness.  */
      /* Propagate mudflap marked-ness.  */
      if (flag_mudflap && mf_marked_p (*tp))
      if (flag_mudflap && mf_marked_p (*tp))
        mf_mark (new);
        mf_mark (new);
 
 
      CONSTRUCTOR_ELTS (new) = VEC_copy (constructor_elt, gc,
      CONSTRUCTOR_ELTS (new) = VEC_copy (constructor_elt, gc,
                                         CONSTRUCTOR_ELTS (*tp));
                                         CONSTRUCTOR_ELTS (*tp));
      *tp = new;
      *tp = new;
    }
    }
  else if (TREE_CODE_CLASS (code) == tcc_type)
  else if (TREE_CODE_CLASS (code) == tcc_type)
    *walk_subtrees = 0;
    *walk_subtrees = 0;
  else if (TREE_CODE_CLASS (code) == tcc_declaration)
  else if (TREE_CODE_CLASS (code) == tcc_declaration)
    *walk_subtrees = 0;
    *walk_subtrees = 0;
  else if (TREE_CODE_CLASS (code) == tcc_constant)
  else if (TREE_CODE_CLASS (code) == tcc_constant)
    *walk_subtrees = 0;
    *walk_subtrees = 0;
  else
  else
    gcc_assert (code != STATEMENT_LIST);
    gcc_assert (code != STATEMENT_LIST);
  return NULL_TREE;
  return NULL_TREE;
}
}
 
 
/* The SAVE_EXPR pointed to by TP is being copied.  If ST contains
/* The SAVE_EXPR pointed to by TP is being copied.  If ST contains
   information indicating to what new SAVE_EXPR this one should be mapped,
   information indicating to what new SAVE_EXPR this one should be mapped,
   use that one.  Otherwise, create a new node and enter it in ST.  FN is
   use that one.  Otherwise, create a new node and enter it in ST.  FN is
   the function into which the copy will be placed.  */
   the function into which the copy will be placed.  */
 
 
static void
static void
remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
remap_save_expr (tree *tp, void *st_, int *walk_subtrees)
{
{
  splay_tree st = (splay_tree) st_;
  splay_tree st = (splay_tree) st_;
  splay_tree_node n;
  splay_tree_node n;
  tree t;
  tree t;
 
 
  /* See if we already encountered this SAVE_EXPR.  */
  /* See if we already encountered this SAVE_EXPR.  */
  n = splay_tree_lookup (st, (splay_tree_key) *tp);
  n = splay_tree_lookup (st, (splay_tree_key) *tp);
 
 
  /* If we didn't already remap this SAVE_EXPR, do so now.  */
  /* If we didn't already remap this SAVE_EXPR, do so now.  */
  if (!n)
  if (!n)
    {
    {
      t = copy_node (*tp);
      t = copy_node (*tp);
 
 
      /* Remember this SAVE_EXPR.  */
      /* Remember this SAVE_EXPR.  */
      splay_tree_insert (st, (splay_tree_key) *tp, (splay_tree_value) t);
      splay_tree_insert (st, (splay_tree_key) *tp, (splay_tree_value) t);
      /* Make sure we don't remap an already-remapped SAVE_EXPR.  */
      /* Make sure we don't remap an already-remapped SAVE_EXPR.  */
      splay_tree_insert (st, (splay_tree_key) t, (splay_tree_value) t);
      splay_tree_insert (st, (splay_tree_key) t, (splay_tree_value) t);
    }
    }
  else
  else
    {
    {
      /* We've already walked into this SAVE_EXPR; don't do it again.  */
      /* We've already walked into this SAVE_EXPR; don't do it again.  */
      *walk_subtrees = 0;
      *walk_subtrees = 0;
      t = (tree) n->value;
      t = (tree) n->value;
    }
    }
 
 
  /* Replace this SAVE_EXPR with the copy.  */
  /* Replace this SAVE_EXPR with the copy.  */
  *tp = t;
  *tp = t;
}
}
 
 
/* Called via walk_tree.  If *TP points to a DECL_STMT for a local label,
/* Called via walk_tree.  If *TP points to a DECL_STMT for a local label,
   copies the declaration and enters it in the splay_tree in DATA (which is
   copies the declaration and enters it in the splay_tree in DATA (which is
   really an `copy_body_data *').  */
   really an `copy_body_data *').  */
 
 
static tree
static tree
mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
mark_local_for_remap_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
                        void *data)
                        void *data)
{
{
  copy_body_data *id = (copy_body_data *) data;
  copy_body_data *id = (copy_body_data *) data;
 
 
  /* Don't walk into types.  */
  /* Don't walk into types.  */
  if (TYPE_P (*tp))
  if (TYPE_P (*tp))
    *walk_subtrees = 0;
    *walk_subtrees = 0;
 
 
  else if (TREE_CODE (*tp) == LABEL_EXPR)
  else if (TREE_CODE (*tp) == LABEL_EXPR)
    {
    {
      tree decl = TREE_OPERAND (*tp, 0);
      tree decl = TREE_OPERAND (*tp, 0);
 
 
      /* Copy the decl and remember the copy.  */
      /* Copy the decl and remember the copy.  */
      insert_decl_map (id, decl, id->copy_decl (decl, id));
      insert_decl_map (id, decl, id->copy_decl (decl, id));
    }
    }
 
 
  return NULL_TREE;
  return NULL_TREE;
}
}
 
 
/* Perform any modifications to EXPR required when it is unsaved.  Does
/* Perform any modifications to EXPR required when it is unsaved.  Does
   not recurse into EXPR's subtrees.  */
   not recurse into EXPR's subtrees.  */
 
 
static void
static void
unsave_expr_1 (tree expr)
unsave_expr_1 (tree expr)
{
{
  switch (TREE_CODE (expr))
  switch (TREE_CODE (expr))
    {
    {
    case TARGET_EXPR:
    case TARGET_EXPR:
      /* Don't mess with a TARGET_EXPR that hasn't been expanded.
      /* Don't mess with a TARGET_EXPR that hasn't been expanded.
         It's OK for this to happen if it was part of a subtree that
         It's OK for this to happen if it was part of a subtree that
         isn't immediately expanded, such as operand 2 of another
         isn't immediately expanded, such as operand 2 of another
         TARGET_EXPR.  */
         TARGET_EXPR.  */
      if (TREE_OPERAND (expr, 1))
      if (TREE_OPERAND (expr, 1))
        break;
        break;
 
 
      TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
      TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
      TREE_OPERAND (expr, 3) = NULL_TREE;
      TREE_OPERAND (expr, 3) = NULL_TREE;
      break;
      break;
 
 
    default:
    default:
      break;
      break;
    }
    }
}
}
 
 
/* Called via walk_tree when an expression is unsaved.  Using the
/* Called via walk_tree when an expression is unsaved.  Using the
   splay_tree pointed to by ST (which is really a `splay_tree'),
   splay_tree pointed to by ST (which is really a `splay_tree'),
   remaps all local declarations to appropriate replacements.  */
   remaps all local declarations to appropriate replacements.  */
 
 
static tree
static tree
unsave_r (tree *tp, int *walk_subtrees, void *data)
unsave_r (tree *tp, int *walk_subtrees, void *data)
{
{
  copy_body_data *id = (copy_body_data *) data;
  copy_body_data *id = (copy_body_data *) data;
  splay_tree st = id->decl_map;
  splay_tree st = id->decl_map;
  splay_tree_node n;
  splay_tree_node n;
 
 
  /* Only a local declaration (variable or label).  */
  /* Only a local declaration (variable or label).  */
  if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
  if ((TREE_CODE (*tp) == VAR_DECL && !TREE_STATIC (*tp))
      || TREE_CODE (*tp) == LABEL_DECL)
      || TREE_CODE (*tp) == LABEL_DECL)
    {
    {
      /* Lookup the declaration.  */
      /* Lookup the declaration.  */
      n = splay_tree_lookup (st, (splay_tree_key) *tp);
      n = splay_tree_lookup (st, (splay_tree_key) *tp);
 
 
      /* If it's there, remap it.  */
      /* If it's there, remap it.  */
      if (n)
      if (n)
        *tp = (tree) n->value;
        *tp = (tree) n->value;
    }
    }
 
 
  else if (TREE_CODE (*tp) == STATEMENT_LIST)
  else if (TREE_CODE (*tp) == STATEMENT_LIST)
    copy_statement_list (tp);
    copy_statement_list (tp);
  else if (TREE_CODE (*tp) == BIND_EXPR)
  else if (TREE_CODE (*tp) == BIND_EXPR)
    copy_bind_expr (tp, walk_subtrees, id);
    copy_bind_expr (tp, walk_subtrees, id);
  else if (TREE_CODE (*tp) == SAVE_EXPR)
  else if (TREE_CODE (*tp) == SAVE_EXPR)
    remap_save_expr (tp, st, walk_subtrees);
    remap_save_expr (tp, st, walk_subtrees);
  else
  else
    {
    {
      copy_tree_r (tp, walk_subtrees, NULL);
      copy_tree_r (tp, walk_subtrees, NULL);
 
 
      /* Do whatever unsaving is required.  */
      /* Do whatever unsaving is required.  */
      unsave_expr_1 (*tp);
      unsave_expr_1 (*tp);
    }
    }
 
 
  /* Keep iterating.  */
  /* Keep iterating.  */
  return NULL_TREE;
  return NULL_TREE;
}
}
 
 
/* Copies everything in EXPR and replaces variables, labels
/* Copies everything in EXPR and replaces variables, labels
   and SAVE_EXPRs local to EXPR.  */
   and SAVE_EXPRs local to EXPR.  */
 
 
tree
tree
unsave_expr_now (tree expr)
unsave_expr_now (tree expr)
{
{
  copy_body_data id;
  copy_body_data id;
 
 
  /* There's nothing to do for NULL_TREE.  */
  /* There's nothing to do for NULL_TREE.  */
  if (expr == 0)
  if (expr == 0)
    return expr;
    return expr;
 
 
  /* Set up ID.  */
  /* Set up ID.  */
  memset (&id, 0, sizeof (id));
  memset (&id, 0, sizeof (id));
  id.src_fn = current_function_decl;
  id.src_fn = current_function_decl;
  id.dst_fn = current_function_decl;
  id.dst_fn = current_function_decl;
  id.decl_map = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
  id.decl_map = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
 
 
  id.copy_decl = copy_decl_no_change;
  id.copy_decl = copy_decl_no_change;
  id.transform_call_graph_edges = CB_CGE_DUPLICATE;
  id.transform_call_graph_edges = CB_CGE_DUPLICATE;
  id.transform_new_cfg = false;
  id.transform_new_cfg = false;
  id.transform_return_to_modify = false;
  id.transform_return_to_modify = false;
  id.transform_lang_insert_block = false;
  id.transform_lang_insert_block = false;
 
 
  /* Walk the tree once to find local labels.  */
  /* Walk the tree once to find local labels.  */
  walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
  walk_tree_without_duplicates (&expr, mark_local_for_remap_r, &id);
 
 
  /* Walk the tree again, copying, remapping, and unsaving.  */
  /* Walk the tree again, copying, remapping, and unsaving.  */
  walk_tree (&expr, unsave_r, &id, NULL);
  walk_tree (&expr, unsave_r, &id, NULL);
 
 
  /* Clean up.  */
  /* Clean up.  */
  splay_tree_delete (id.decl_map);
  splay_tree_delete (id.decl_map);
 
 
  return expr;
  return expr;
}
}
 
 
/* Allow someone to determine if SEARCH is a child of TOP from gdb.  */
/* Allow someone to determine if SEARCH is a child of TOP from gdb.  */
 
 
static tree
static tree
debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
debug_find_tree_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, void *data)
{
{
  if (*tp == data)
  if (*tp == data)
    return (tree) data;
    return (tree) data;
  else
  else
    return NULL;
    return NULL;
}
}
 
 
bool
bool
debug_find_tree (tree top, tree search)
debug_find_tree (tree top, tree search)
{
{
  return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
  return walk_tree_without_duplicates (&top, debug_find_tree_1, search) != 0;
}
}
 
 
 
 
/* Declare the variables created by the inliner.  Add all the variables in
/* Declare the variables created by the inliner.  Add all the variables in
   VARS to BIND_EXPR.  */
   VARS to BIND_EXPR.  */
 
 
static void
static void
declare_inline_vars (tree block, tree vars)
declare_inline_vars (tree block, tree vars)
{
{
  tree t;
  tree t;
  for (t = vars; t; t = TREE_CHAIN (t))
  for (t = vars; t; t = TREE_CHAIN (t))
    {
    {
      DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
      DECL_SEEN_IN_BIND_EXPR_P (t) = 1;
      gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
      gcc_assert (!TREE_STATIC (t) && !TREE_ASM_WRITTEN (t));
      cfun->unexpanded_var_list =
      cfun->unexpanded_var_list =
        tree_cons (NULL_TREE, t,
        tree_cons (NULL_TREE, t,
                   cfun->unexpanded_var_list);
                   cfun->unexpanded_var_list);
    }
    }
 
 
  if (block)
  if (block)
    BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
    BLOCK_VARS (block) = chainon (BLOCK_VARS (block), vars);
}
}
 
 
 
 
/* Copy NODE (which must be a DECL).  The DECL originally was in the FROM_FN,
/* Copy NODE (which must be a DECL).  The DECL originally was in the FROM_FN,
   but now it will be in the TO_FN.  PARM_TO_VAR means enable PARM_DECL to
   but now it will be in the TO_FN.  PARM_TO_VAR means enable PARM_DECL to
   VAR_DECL translation.  */
   VAR_DECL translation.  */
 
 
static tree
static tree
copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
copy_decl_for_dup_finish (copy_body_data *id, tree decl, tree copy)
{
{
  /* Don't generate debug information for the copy if we wouldn't have
  /* Don't generate debug information for the copy if we wouldn't have
     generated it for the copy either.  */
     generated it for the copy either.  */
  DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
  DECL_ARTIFICIAL (copy) = DECL_ARTIFICIAL (decl);
  DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
  DECL_IGNORED_P (copy) = DECL_IGNORED_P (decl);
 
 
  /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
  /* Set the DECL_ABSTRACT_ORIGIN so the debugging routines know what
     declaration inspired this copy.  */
     declaration inspired this copy.  */
  DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
  DECL_ABSTRACT_ORIGIN (copy) = DECL_ORIGIN (decl);
 
 
  /* The new variable/label has no RTL, yet.  */
  /* The new variable/label has no RTL, yet.  */
  if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
  if (CODE_CONTAINS_STRUCT (TREE_CODE (copy), TS_DECL_WRTL)
      && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
      && !TREE_STATIC (copy) && !DECL_EXTERNAL (copy))
    SET_DECL_RTL (copy, NULL_RTX);
    SET_DECL_RTL (copy, NULL_RTX);
 
 
  /* These args would always appear unused, if not for this.  */
  /* These args would always appear unused, if not for this.  */
  TREE_USED (copy) = 1;
  TREE_USED (copy) = 1;
 
 
  /* Set the context for the new declaration.  */
  /* Set the context for the new declaration.  */
  if (!DECL_CONTEXT (decl))
  if (!DECL_CONTEXT (decl))
    /* Globals stay global.  */
    /* Globals stay global.  */
    ;
    ;
  else if (DECL_CONTEXT (decl) != id->src_fn)
  else if (DECL_CONTEXT (decl) != id->src_fn)
    /* Things that weren't in the scope of the function we're inlining
    /* Things that weren't in the scope of the function we're inlining
       from aren't in the scope we're inlining to, either.  */
       from aren't in the scope we're inlining to, either.  */
    ;
    ;
  else if (TREE_STATIC (decl))
  else if (TREE_STATIC (decl))
    /* Function-scoped static variables should stay in the original
    /* Function-scoped static variables should stay in the original
       function.  */
       function.  */
    ;
    ;
  else
  else
    /* Ordinary automatic local variables are now in the scope of the
    /* Ordinary automatic local variables are now in the scope of the
       new function.  */
       new function.  */
    DECL_CONTEXT (copy) = id->dst_fn;
    DECL_CONTEXT (copy) = id->dst_fn;
 
 
  return copy;
  return copy;
}
}
 
 
static tree
static tree
copy_decl_to_var (tree decl, copy_body_data *id)
copy_decl_to_var (tree decl, copy_body_data *id)
{
{
  tree copy, type;
  tree copy, type;
 
 
  gcc_assert (TREE_CODE (decl) == PARM_DECL
  gcc_assert (TREE_CODE (decl) == PARM_DECL
              || TREE_CODE (decl) == RESULT_DECL);
              || TREE_CODE (decl) == RESULT_DECL);
 
 
  type = TREE_TYPE (decl);
  type = TREE_TYPE (decl);
 
 
  copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
  copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
  TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
  TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
  TREE_READONLY (copy) = TREE_READONLY (decl);
  TREE_READONLY (copy) = TREE_READONLY (decl);
  TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
  TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
  DECL_COMPLEX_GIMPLE_REG_P (copy) = DECL_COMPLEX_GIMPLE_REG_P (decl);
  DECL_COMPLEX_GIMPLE_REG_P (copy) = DECL_COMPLEX_GIMPLE_REG_P (decl);
 
 
  return copy_decl_for_dup_finish (id, decl, copy);
  return copy_decl_for_dup_finish (id, decl, copy);
}
}
 
 
/* Like copy_decl_to_var, but create a return slot object instead of a
/* Like copy_decl_to_var, but create a return slot object instead of a
   pointer variable for return by invisible reference.  */
   pointer variable for return by invisible reference.  */
 
 
static tree
static tree
copy_result_decl_to_var (tree decl, copy_body_data *id)
copy_result_decl_to_var (tree decl, copy_body_data *id)
{
{
  tree copy, type;
  tree copy, type;
 
 
  gcc_assert (TREE_CODE (decl) == PARM_DECL
  gcc_assert (TREE_CODE (decl) == PARM_DECL
              || TREE_CODE (decl) == RESULT_DECL);
              || TREE_CODE (decl) == RESULT_DECL);
 
 
  type = TREE_TYPE (decl);
  type = TREE_TYPE (decl);
  if (DECL_BY_REFERENCE (decl))
  if (DECL_BY_REFERENCE (decl))
    type = TREE_TYPE (type);
    type = TREE_TYPE (type);
 
 
  copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
  copy = build_decl (VAR_DECL, DECL_NAME (decl), type);
  TREE_READONLY (copy) = TREE_READONLY (decl);
  TREE_READONLY (copy) = TREE_READONLY (decl);
  TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
  TREE_THIS_VOLATILE (copy) = TREE_THIS_VOLATILE (decl);
  if (!DECL_BY_REFERENCE (decl))
  if (!DECL_BY_REFERENCE (decl))
    {
    {
      TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
      TREE_ADDRESSABLE (copy) = TREE_ADDRESSABLE (decl);
      DECL_COMPLEX_GIMPLE_REG_P (copy) = DECL_COMPLEX_GIMPLE_REG_P (decl);
      DECL_COMPLEX_GIMPLE_REG_P (copy) = DECL_COMPLEX_GIMPLE_REG_P (decl);
    }
    }
 
 
  return copy_decl_for_dup_finish (id, decl, copy);
  return copy_decl_for_dup_finish (id, decl, copy);
}
}
 
 
 
 
static tree
static tree
copy_decl_no_change (tree decl, copy_body_data *id)
copy_decl_no_change (tree decl, copy_body_data *id)
{
{
  tree copy;
  tree copy;
 
 
  copy = copy_node (decl);
  copy = copy_node (decl);
 
 
  /* The COPY is not abstract; it will be generated in DST_FN.  */
  /* The COPY is not abstract; it will be generated in DST_FN.  */
  DECL_ABSTRACT (copy) = 0;
  DECL_ABSTRACT (copy) = 0;
  lang_hooks.dup_lang_specific_decl (copy);
  lang_hooks.dup_lang_specific_decl (copy);
 
 
  /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
  /* TREE_ADDRESSABLE isn't used to indicate that a label's address has
     been taken; it's for internal bookkeeping in expand_goto_internal.  */
     been taken; it's for internal bookkeeping in expand_goto_internal.  */
  if (TREE_CODE (copy) == LABEL_DECL)
  if (TREE_CODE (copy) == LABEL_DECL)
    {
    {
      TREE_ADDRESSABLE (copy) = 0;
      TREE_ADDRESSABLE (copy) = 0;
      LABEL_DECL_UID (copy) = -1;
      LABEL_DECL_UID (copy) = -1;
    }
    }
 
 
  return copy_decl_for_dup_finish (id, decl, copy);
  return copy_decl_for_dup_finish (id, decl, copy);
}
}
 
 
static tree
static tree
copy_decl_maybe_to_var (tree decl, copy_body_data *id)
copy_decl_maybe_to_var (tree decl, copy_body_data *id)
{
{
  if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
  if (TREE_CODE (decl) == PARM_DECL || TREE_CODE (decl) == RESULT_DECL)
    return copy_decl_to_var (decl, id);
    return copy_decl_to_var (decl, id);
  else
  else
    return copy_decl_no_change (decl, id);
    return copy_decl_no_change (decl, id);
}
}
 
 
/* Return a copy of the function's argument tree.  */
/* Return a copy of the function's argument tree.  */
static tree
static tree
copy_arguments_for_versioning (tree orig_parm, copy_body_data * id)
copy_arguments_for_versioning (tree orig_parm, copy_body_data * id)
{
{
  tree *arg_copy, *parg;
  tree *arg_copy, *parg;
 
 
  arg_copy = &orig_parm;
  arg_copy = &orig_parm;
  for (parg = arg_copy; *parg; parg = &TREE_CHAIN (*parg))
  for (parg = arg_copy; *parg; parg = &TREE_CHAIN (*parg))
    {
    {
      tree new = remap_decl (*parg, id);
      tree new = remap_decl (*parg, id);
      lang_hooks.dup_lang_specific_decl (new);
      lang_hooks.dup_lang_specific_decl (new);
      TREE_CHAIN (new) = TREE_CHAIN (*parg);
      TREE_CHAIN (new) = TREE_CHAIN (*parg);
      *parg = new;
      *parg = new;
    }
    }
  return orig_parm;
  return orig_parm;
}
}
 
 
/* Return a copy of the function's static chain.  */
/* Return a copy of the function's static chain.  */
static tree
static tree
copy_static_chain (tree static_chain, copy_body_data * id)
copy_static_chain (tree static_chain, copy_body_data * id)
{
{
  tree *chain_copy, *pvar;
  tree *chain_copy, *pvar;
 
 
  chain_copy = &static_chain;
  chain_copy = &static_chain;
  for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
  for (pvar = chain_copy; *pvar; pvar = &TREE_CHAIN (*pvar))
    {
    {
      tree new = remap_decl (*pvar, id);
      tree new = remap_decl (*pvar, id);
      lang_hooks.dup_lang_specific_decl (new);
      lang_hooks.dup_lang_specific_decl (new);
      TREE_CHAIN (new) = TREE_CHAIN (*pvar);
      TREE_CHAIN (new) = TREE_CHAIN (*pvar);
      *pvar = new;
      *pvar = new;
    }
    }
  return static_chain;
  return static_chain;
}
}
 
 
/* Return true if the function is allowed to be versioned.
/* Return true if the function is allowed to be versioned.
   This is a guard for the versioning functionality.  */
   This is a guard for the versioning functionality.  */
bool
bool
tree_versionable_function_p (tree fndecl)
tree_versionable_function_p (tree fndecl)
{
{
  if (fndecl == NULL_TREE)
  if (fndecl == NULL_TREE)
    return false;
    return false;
  /* ??? There are cases where a function is
  /* ??? There are cases where a function is
     uninlinable but can be versioned.  */
     uninlinable but can be versioned.  */
  if (!tree_inlinable_function_p (fndecl))
  if (!tree_inlinable_function_p (fndecl))
    return false;
    return false;
 
 
  return true;
  return true;
}
}
 
 
/* Create a copy of a function's tree.
/* Create a copy of a function's tree.
   OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
   OLD_DECL and NEW_DECL are FUNCTION_DECL tree nodes
   of the original function and the new copied function
   of the original function and the new copied function
   respectively.  In case we want to replace a DECL
   respectively.  In case we want to replace a DECL
   tree with another tree while duplicating the function's
   tree with another tree while duplicating the function's
   body, TREE_MAP represents the mapping between these
   body, TREE_MAP represents the mapping between these
   trees. If UPDATE_CLONES is set, the call_stmt fields
   trees. If UPDATE_CLONES is set, the call_stmt fields
   of edges of clones of the function will be updated.  */
   of edges of clones of the function will be updated.  */
void
void
tree_function_versioning (tree old_decl, tree new_decl, varray_type tree_map,
tree_function_versioning (tree old_decl, tree new_decl, varray_type tree_map,
                          bool update_clones)
                          bool update_clones)
{
{
  struct cgraph_node *old_version_node;
  struct cgraph_node *old_version_node;
  struct cgraph_node *new_version_node;
  struct cgraph_node *new_version_node;
  copy_body_data id;
  copy_body_data id;
  tree p, new_fndecl;
  tree p, new_fndecl;
  unsigned i;
  unsigned i;
  struct ipa_replace_map *replace_info;
  struct ipa_replace_map *replace_info;
  basic_block old_entry_block;
  basic_block old_entry_block;
  tree t_step;
  tree t_step;
 
 
  gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
  gcc_assert (TREE_CODE (old_decl) == FUNCTION_DECL
              && TREE_CODE (new_decl) == FUNCTION_DECL);
              && TREE_CODE (new_decl) == FUNCTION_DECL);
  DECL_POSSIBLY_INLINED (old_decl) = 1;
  DECL_POSSIBLY_INLINED (old_decl) = 1;
 
 
  old_version_node = cgraph_node (old_decl);
  old_version_node = cgraph_node (old_decl);
  new_version_node = cgraph_node (new_decl);
  new_version_node = cgraph_node (new_decl);
 
 
  allocate_struct_function (new_decl);
  allocate_struct_function (new_decl);
  /* Cfun points to the new allocated function struct at this point.  */
  /* Cfun points to the new allocated function struct at this point.  */
  cfun->function_end_locus = DECL_SOURCE_LOCATION (new_decl);
  cfun->function_end_locus = DECL_SOURCE_LOCATION (new_decl);
 
 
  DECL_ARTIFICIAL (new_decl) = 1;
  DECL_ARTIFICIAL (new_decl) = 1;
  DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
  DECL_ABSTRACT_ORIGIN (new_decl) = DECL_ORIGIN (old_decl);
 
 
  /* Generate a new name for the new version. */
  /* Generate a new name for the new version. */
  if (!update_clones)
  if (!update_clones)
    DECL_NAME (new_decl) = create_tmp_var_name (NULL);
    DECL_NAME (new_decl) = create_tmp_var_name (NULL);
  /* Create a new SYMBOL_REF rtx for the new name. */
  /* Create a new SYMBOL_REF rtx for the new name. */
  if (DECL_RTL (old_decl) != NULL)
  if (DECL_RTL (old_decl) != NULL)
    {
    {
      SET_DECL_RTL (new_decl, copy_rtx (DECL_RTL (old_decl)));
      SET_DECL_RTL (new_decl, copy_rtx (DECL_RTL (old_decl)));
      XEXP (DECL_RTL (new_decl), 0) =
      XEXP (DECL_RTL (new_decl), 0) =
        gen_rtx_SYMBOL_REF (GET_MODE (XEXP (DECL_RTL (old_decl), 0)),
        gen_rtx_SYMBOL_REF (GET_MODE (XEXP (DECL_RTL (old_decl), 0)),
                            IDENTIFIER_POINTER (DECL_NAME (new_decl)));
                            IDENTIFIER_POINTER (DECL_NAME (new_decl)));
    }
    }
 
 
  /* Prepare the data structures for the tree copy.  */
  /* Prepare the data structures for the tree copy.  */
  memset (&id, 0, sizeof (id));
  memset (&id, 0, sizeof (id));
 
 
  id.decl_map = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
  id.decl_map = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
  id.src_fn = old_decl;
  id.src_fn = old_decl;
  id.dst_fn = new_decl;
  id.dst_fn = new_decl;
  id.src_node = old_version_node;
  id.src_node = old_version_node;
  id.dst_node = new_version_node;
  id.dst_node = new_version_node;
  id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
  id.src_cfun = DECL_STRUCT_FUNCTION (old_decl);
 
 
  id.copy_decl = copy_decl_no_change;
  id.copy_decl = copy_decl_no_change;
  id.transform_call_graph_edges
  id.transform_call_graph_edges
    = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
    = update_clones ? CB_CGE_MOVE_CLONES : CB_CGE_MOVE;
  id.transform_new_cfg = true;
  id.transform_new_cfg = true;
  id.transform_return_to_modify = false;
  id.transform_return_to_modify = false;
  id.transform_lang_insert_block = false;
  id.transform_lang_insert_block = false;
 
 
  current_function_decl = new_decl;
  current_function_decl = new_decl;
 
 
  /* Copy the function's static chain.  */
  /* Copy the function's static chain.  */
  p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
  p = DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl;
  if (p)
  if (p)
    DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
    DECL_STRUCT_FUNCTION (new_decl)->static_chain_decl =
      copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
      copy_static_chain (DECL_STRUCT_FUNCTION (old_decl)->static_chain_decl,
                         &id);
                         &id);
  /* Copy the function's arguments.  */
  /* Copy the function's arguments.  */
  if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
  if (DECL_ARGUMENTS (old_decl) != NULL_TREE)
    DECL_ARGUMENTS (new_decl) =
    DECL_ARGUMENTS (new_decl) =
      copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id);
      copy_arguments_for_versioning (DECL_ARGUMENTS (old_decl), &id);
 
 
  /* If there's a tree_map, prepare for substitution.  */
  /* If there's a tree_map, prepare for substitution.  */
  if (tree_map)
  if (tree_map)
    for (i = 0; i < VARRAY_ACTIVE_SIZE (tree_map); i++)
    for (i = 0; i < VARRAY_ACTIVE_SIZE (tree_map); i++)
      {
      {
        replace_info = VARRAY_GENERIC_PTR (tree_map, i);
        replace_info = VARRAY_GENERIC_PTR (tree_map, i);
        if (replace_info->replace_p)
        if (replace_info->replace_p)
          insert_decl_map (&id, replace_info->old_tree,
          insert_decl_map (&id, replace_info->old_tree,
                           replace_info->new_tree);
                           replace_info->new_tree);
      }
      }
 
 
  DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
  DECL_INITIAL (new_decl) = remap_blocks (DECL_INITIAL (id.src_fn), &id);
 
 
  /* Renumber the lexical scoping (non-code) blocks consecutively.  */
  /* Renumber the lexical scoping (non-code) blocks consecutively.  */
  number_blocks (id.dst_fn);
  number_blocks (id.dst_fn);
 
 
  if (DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list != NULL_TREE)
  if (DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list != NULL_TREE)
    /* Add local vars.  */
    /* Add local vars.  */
    for (t_step = DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list;
    for (t_step = DECL_STRUCT_FUNCTION (old_decl)->unexpanded_var_list;
         t_step; t_step = TREE_CHAIN (t_step))
         t_step; t_step = TREE_CHAIN (t_step))
      {
      {
        tree var = TREE_VALUE (t_step);
        tree var = TREE_VALUE (t_step);
        if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
        if (TREE_STATIC (var) && !TREE_ASM_WRITTEN (var))
          cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
          cfun->unexpanded_var_list = tree_cons (NULL_TREE, var,
                                                 cfun->unexpanded_var_list);
                                                 cfun->unexpanded_var_list);
        else
        else
          cfun->unexpanded_var_list =
          cfun->unexpanded_var_list =
            tree_cons (NULL_TREE, remap_decl (var, &id),
            tree_cons (NULL_TREE, remap_decl (var, &id),
                       cfun->unexpanded_var_list);
                       cfun->unexpanded_var_list);
      }
      }
 
 
  /* Copy the Function's body.  */
  /* Copy the Function's body.  */
  old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
  old_entry_block = ENTRY_BLOCK_PTR_FOR_FUNCTION
    (DECL_STRUCT_FUNCTION (old_decl));
    (DECL_STRUCT_FUNCTION (old_decl));
  new_fndecl = copy_body (&id,
  new_fndecl = copy_body (&id,
                          old_entry_block->count,
                          old_entry_block->count,
                          old_entry_block->frequency, NULL, NULL);
                          old_entry_block->frequency, NULL, NULL);
 
 
  DECL_SAVED_TREE (new_decl) = DECL_SAVED_TREE (new_fndecl);
  DECL_SAVED_TREE (new_decl) = DECL_SAVED_TREE (new_fndecl);
 
 
  DECL_STRUCT_FUNCTION (new_decl)->cfg =
  DECL_STRUCT_FUNCTION (new_decl)->cfg =
    DECL_STRUCT_FUNCTION (new_fndecl)->cfg;
    DECL_STRUCT_FUNCTION (new_fndecl)->cfg;
  DECL_STRUCT_FUNCTION (new_decl)->eh = DECL_STRUCT_FUNCTION (new_fndecl)->eh;
  DECL_STRUCT_FUNCTION (new_decl)->eh = DECL_STRUCT_FUNCTION (new_fndecl)->eh;
  DECL_STRUCT_FUNCTION (new_decl)->ib_boundaries_block =
  DECL_STRUCT_FUNCTION (new_decl)->ib_boundaries_block =
    DECL_STRUCT_FUNCTION (new_fndecl)->ib_boundaries_block;
    DECL_STRUCT_FUNCTION (new_fndecl)->ib_boundaries_block;
  DECL_STRUCT_FUNCTION (new_decl)->last_label_uid =
  DECL_STRUCT_FUNCTION (new_decl)->last_label_uid =
    DECL_STRUCT_FUNCTION (new_fndecl)->last_label_uid;
    DECL_STRUCT_FUNCTION (new_fndecl)->last_label_uid;
 
 
  if (DECL_RESULT (old_decl) != NULL_TREE)
  if (DECL_RESULT (old_decl) != NULL_TREE)
    {
    {
      tree *res_decl = &DECL_RESULT (old_decl);
      tree *res_decl = &DECL_RESULT (old_decl);
      DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
      DECL_RESULT (new_decl) = remap_decl (*res_decl, &id);
      lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
      lang_hooks.dup_lang_specific_decl (DECL_RESULT (new_decl));
    }
    }
 
 
  current_function_decl = NULL;
  current_function_decl = NULL;
  /* Renumber the lexical scoping (non-code) blocks consecutively.  */
  /* Renumber the lexical scoping (non-code) blocks consecutively.  */
  number_blocks (new_decl);
  number_blocks (new_decl);
 
 
  /* Clean up.  */
  /* Clean up.  */
  splay_tree_delete (id.decl_map);
  splay_tree_delete (id.decl_map);
  fold_cond_expr_cond ();
  fold_cond_expr_cond ();
  return;
  return;
}
}
 
 
/* Duplicate a type, fields and all.  */
/* Duplicate a type, fields and all.  */
 
 
tree
tree
build_duplicate_type (tree type)
build_duplicate_type (tree type)
{
{
  struct copy_body_data id;
  struct copy_body_data id;
 
 
  memset (&id, 0, sizeof (id));
  memset (&id, 0, sizeof (id));
  id.src_fn = current_function_decl;
  id.src_fn = current_function_decl;
  id.dst_fn = current_function_decl;
  id.dst_fn = current_function_decl;
  id.src_cfun = cfun;
  id.src_cfun = cfun;
  id.decl_map = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
  id.decl_map = splay_tree_new (splay_tree_compare_pointers, NULL, NULL);
 
 
  type = remap_type_1 (type, &id);
  type = remap_type_1 (type, &id);
 
 
  splay_tree_delete (id.decl_map);
  splay_tree_delete (id.decl_map);
 
 
  return type;
  return type;
}
}
 
 

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.