/* Callgraph construction.
   Copyright (C) 2003-2014 Free Software Foundation, Inc.
   Contributed by Jan Hubicka

This file is part of GCC.

GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 3, or (at your option) any later
version.

GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
for more details.

You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3.  If not see
<http://www.gnu.org/licenses/>.  */

#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "tree.h"
#include "tree-eh.h"
#include "pointer-set.h"
#include "basic-block.h"
#include "tree-ssa-alias.h"
#include "tree-ssa-operands.h"
#include "tree-into-ssa.h"
#include "internal-fn.h"
#include "gimple-fold.h"
#include "gimple-expr.h"
#include "is-a.h"
#include "gimple.h"
#include "gimple-iterator.h"
#include "gimple-walk.h"
#include "gimple-ssa.h"
#include "langhooks.h"
#include "intl.h"
#include "toplev.h"
#include "gcov-io.h"
#include "coverage.h"
#include "tree-pass.h"
#include "ipa-utils.h"
#include "except.h"
#include "l-ipo.h"
#include "ipa-inline.h"

/* Context of record_reference.  */
struct record_reference_ctx
{
  bool only_vars;
  class varpool_node *varpool_node;
};

/* Walk tree and record all calls and references to functions/variables.
   Called via walk_tree: TP is pointer to tree to be examined.
   When DATA is non-null, record references to callgraph.
   */

static tree
record_reference (tree *tp, int *walk_subtrees, void *data)
{
  tree t = *tp;
  tree decl;
  struct record_reference_ctx *ctx = (struct record_reference_ctx *)data;

  t = canonicalize_constructor_val (t, NULL);
  if (!t)
    t = *tp;
  else if (t != *tp)
    *tp = t;

  switch (TREE_CODE (t))
    {
    case VAR_DECL:
    case FUNCTION_DECL:
      gcc_unreachable ();
      break;

    case FDESC_EXPR:
    case ADDR_EXPR:
      /* Record dereferences to the functions.  This makes the
	 functions reachable unconditionally.  */
      decl = get_base_var (*tp);
      if (TREE_CODE (decl) == FUNCTION_DECL)
	{
	  struct cgraph_node *node = cgraph_get_create_node (decl);
	  if (!ctx->only_vars)
	    cgraph_mark_address_taken_node (node);
	  ipa_record_reference (ctx->varpool_node,
				node,
			        IPA_REF_ADDR, NULL);
	}

      if (TREE_CODE (decl) == VAR_DECL)
	{
	  varpool_node *vnode = varpool_node_for_decl (decl);
	  ipa_record_reference (ctx->varpool_node,
				vnode,
				IPA_REF_ADDR, NULL);
	}
      *walk_subtrees = 0;
      break;

    default:
      /* Save some cycles by not walking types and declaration as we
	 won't find anything useful there anyway.  */
      if (IS_TYPE_OR_DECL_P (*tp))
	{
	  *walk_subtrees = 0;
	  break;
	}
      break;
    }

  return NULL_TREE;
}

/* Record references to typeinfos in the type list LIST.  */

static void
record_type_list (struct cgraph_node *node, tree list)
{
  for (; list; list = TREE_CHAIN (list))
    {
      tree type = TREE_VALUE (list);
      
      if (TYPE_P (type))
	type = lookup_type_for_runtime (type);
      STRIP_NOPS (type);
      if (TREE_CODE (type) == ADDR_EXPR)
	{
	  type = TREE_OPERAND (type, 0);
	  if (TREE_CODE (type) == VAR_DECL)
	    {
	      varpool_node *vnode = varpool_node_for_decl (type);
	      ipa_record_reference (node,
				    vnode,
				    IPA_REF_ADDR, NULL);
	    }
	}
    }
}

/* Record all references we will introduce by producing EH tables
   for NODE.  */

static void
record_eh_tables (struct cgraph_node *node, struct function *fun)
{
  eh_region i;

  if (DECL_FUNCTION_PERSONALITY (node->decl))
    {
      tree per_decl = DECL_FUNCTION_PERSONALITY (node->decl);
      struct cgraph_node *per_node = cgraph_get_create_node (per_decl);

      ipa_record_reference (node, per_node, IPA_REF_ADDR, NULL);
      cgraph_mark_address_taken_node (per_node);
    }

  i = fun->eh->region_tree;
  if (!i)
    return;

  while (1)
    {
      switch (i->type)
	{
	case ERT_CLEANUP:
	case ERT_MUST_NOT_THROW:
	  break;

	case ERT_TRY:
	  {
	    eh_catch c;
	    for (c = i->u.eh_try.first_catch; c; c = c->next_catch)
	      record_type_list (node, c->type_list);
	  }
	  break;

	case ERT_ALLOWED_EXCEPTIONS:
	  record_type_list (node, i->u.allowed.type_list);
	  break;
	}
      /* If there are sub-regions, process them.  */
      if (i->inner)
	i = i->inner;
      /* If there are peers, process them.  */
      else if (i->next_peer)
	i = i->next_peer;
      /* Otherwise, step back up the tree to the next peer.  */
      else
	{
	  do
	    {
	      i = i->outer;
	      if (i == NULL)
		return;
	    }
	  while (i->next_peer == NULL);
	  i = i->next_peer;
	}
    }
}

/* Computes the frequency of the call statement so that it can be stored in
   cgraph_edge.  BB is the basic block of the call statement.  */
int
compute_call_stmt_bb_frequency (tree decl, basic_block bb)
{
  int entry_freq = ENTRY_BLOCK_PTR_FOR_FN
  		     (DECL_STRUCT_FUNCTION (decl))->frequency;
  int freq = bb->frequency;

  if (profile_status_for_fn (DECL_STRUCT_FUNCTION (decl)) == PROFILE_ABSENT)
    return CGRAPH_FREQ_BASE;

  if (!entry_freq)
    entry_freq = 1, freq++;

  freq = freq * CGRAPH_FREQ_BASE / entry_freq;
  if (freq > CGRAPH_FREQ_MAX)
    freq = CGRAPH_FREQ_MAX;

  return freq;
}


bool cgraph_pre_profiling_inlining_done = false;

/* Return true if E is a fake indirect call edge.  */

bool
cgraph_is_fake_indirect_call_edge (struct cgraph_edge *e)
{
  return !e->call_stmt;
}


/* Add fake cgraph edges from NODE to its indirect call callees
   using profile data.  */

static void
add_fake_indirect_call_edges (struct cgraph_node *node)
{
  unsigned n_counts, i;
  gcov_type *ic_counts;

  /* Enable this only for LIPO for now.  */
  if (!L_IPO_COMP_MODE)
    return;

  ic_counts
      = get_coverage_counts_no_warn (DECL_STRUCT_FUNCTION (node->decl),
                                     GCOV_COUNTER_ICALL_TOPNV, &n_counts);

  if (!ic_counts)
    return;

  gcc_assert ((n_counts % GCOV_ICALL_TOPN_NCOUNTS) == 0);

/* After the early_inline_1 before value profile transformation,
   functions that are indirect call targets may have their bodies
   removed (extern inline functions or functions from aux modules,
   functions in comdat etc) if all direct callsites are inlined. This
   will lead to missing inline opportunities after profile based
   indirect call promotion. The solution is to add fake edges to
   indirect call targets. Note that such edges are not associated
   with actual indirect call sites because it is not possible to
   reliably match pre-early-inline indirect callsites with indirect
   call profile counters which are from post-early inline function body.  */

  for (i = 0; i < n_counts;
       i += GCOV_ICALL_TOPN_NCOUNTS, ic_counts += GCOV_ICALL_TOPN_NCOUNTS)
    {
      gcov_type val1, val2, count1, count2;
      struct cgraph_node *direct_call1 = 0, *direct_call2 = 0;

      val1 = ic_counts[1];
      count1 = ic_counts[2];
      val2 = ic_counts[3];
      count2 = ic_counts[4];

      if (val1 == 0 || count1 == 0)
        continue;

      direct_call1 = find_func_by_global_id (val1, false);
      if (direct_call1)
        {
          tree decl = direct_call1->decl;
          cgraph_create_edge (node,
	                      cgraph_get_create_node (decl),
			      NULL,
                              count1, 0);
        }

      if (val2 == 0 || count2 == 0)
        continue;
      direct_call2 = find_func_by_global_id (val2, false);
      if (direct_call2)
        {
          tree decl = direct_call2->decl;
          cgraph_create_edge (node,
	                      cgraph_get_create_node (decl),
                              NULL,
                              count2, 0);
        }
    }
}


/* This can be implemented as an IPA pass that must be first one 
   before any unreachable node elimination. */

void
cgraph_add_fake_indirect_call_edges (void)
{
  struct cgraph_node *node;

  /* Enable this only for LIPO for now.  */
  if (!L_IPO_COMP_MODE)
    return;

  FOR_EACH_DEFINED_FUNCTION (node)
    {
      if (!gimple_has_body_p (node->decl))
	continue;
      add_fake_indirect_call_edges (node);
    }
}

/* Remove zero count fake edges added for the purpose of ensuring
   the right processing order.  This should be called after all
   small ipa passes.  */
void
cgraph_remove_zero_count_fake_edges (void)
{
  struct cgraph_node *node;

  /* Enable this only for LIPO for now.  */
  if (!L_IPO_COMP_MODE)
    return;

  FOR_EACH_DEFINED_FUNCTION (node)
    {
      if (!gimple_has_body_p (node->decl))
	continue;

     struct cgraph_edge *e, *f;
     for (e = node->callees; e; e = f)
       {
         f = e->next_callee;
	 if (!e->call_stmt && !e->count && !e->frequency)
           cgraph_remove_edge (e);
       }
    }
}

static void
record_reference_to_real_target_from_alias (struct cgraph_node *alias)
{
  if (!L_IPO_COMP_MODE || !cgraph_pre_profiling_inlining_done)
    return;

  /* Need to add a reference to the resolved node in LIPO
     mode to avoid the real node from eliminated  */
  if (alias->alias && alias->analyzed)
    {
      struct cgraph_node *target, *real_target;

      target = dyn_cast<cgraph_node> (symtab_alias_target (alias));
      real_target = cgraph_lipo_get_resolved_node (target->decl);
      /* TODO: this make create duplicate entries in the reference list.  */
      if (real_target != target)
        ipa_record_reference (alias, real_target,
                              IPA_REF_ALIAS, NULL);
    }
}

/* Mark address taken in STMT.  */

static bool
mark_address (gimple stmt, tree addr, tree, void *data)
{
  addr = get_base_address (addr);
  if (TREE_CODE (addr) == FUNCTION_DECL)
    {
      /* Before possibly creating a new node in cgraph_get_create_node,
         save the current cgraph node for addr.  */
      struct cgraph_node *first_clone = cgraph_get_node (addr);
      struct cgraph_node *node = cgraph_get_create_node (addr);
      /* In LIPO mode we use the resolved node. However, there is
         a possibility that it may not exist at this point. This
         can happen in cases of ipa-cp, where this is a reference
         that will eventually go away during inline_transform when we
         invoke cgraph_redirect_edge_call_stmt_to_callee to rewrite
         the call_stmt and skip some arguments. It is possible
         that earlier during inline_call the references to the original
         non-cloned resolved node were all eliminated, and it was removed.
         However, virtual clones may stick around until inline_transform,
         due to references in other virtual clones, at which point they
         will all be removed. In between inline_call and inline_transform,
         however, we will materialize clones which would rebuild references
         and end up here upon still seeing the reference on the call.
         Handle this by skipping the resolved node lookup when the first
         clone was marked global.inlined_to (i.e. it is a virtual clone,
         the original is gone).

         For example, when this is called after ipa inlining for a call stmt
         in an ipa cp clone, the call will still look like:
            foo.isra.3 (pow, ...);
         while the caller node actually has foo.isra.3.constprop in its
         callee list. And the original, resolved node for pow would have
         been eliminated during ipa inlining/virtual cloning if this was
         the only reference leading to a call.

         Later, during inline_transform, this call statement will be rewritted
         in cgraph_redirect_edge_call_stmt_to_callee to:
            foo.isra.3.constprop (...); // pow argument removed
         */
      if (L_IPO_COMP_MODE && cgraph_pre_profiling_inlining_done
          && first_clone && !first_clone->global.inlined_to)
        {
          /* We now fix up address references to function decls after the LIPO
             link, so any existing node that isn't an inline clone should be
             the resolved node.  */
          struct cgraph_node *resolved = cgraph_lipo_get_resolved_node (addr);
          gcc_assert (resolved == first_clone);
          gcc_assert (resolved == node);
        }

      cgraph_mark_address_taken_node (node);
      ipa_record_reference ((symtab_node *)data,
			    node,
			    IPA_REF_ADDR, stmt);
      record_reference_to_real_target_from_alias (node);
    }
  else if (addr && TREE_CODE (addr) == VAR_DECL
	   && (TREE_STATIC (addr) || DECL_EXTERNAL (addr)))
    {
      varpool_node *vnode = varpool_node_for_decl (addr);

      ipa_record_reference ((symtab_node *)data,
			    vnode,
			    IPA_REF_ADDR, stmt);
      if (L_IPO_COMP_MODE && cgraph_pre_profiling_inlining_done)
        {
          struct varpool_node *rvnode = real_varpool_node (addr);
          if (rvnode != vnode)
            ipa_record_reference ((symtab_node *)data, rvnode,
                                  IPA_REF_ADDR, stmt);
        }
    }

  return false;
}

/* Mark load of T.  */

static bool
mark_load (gimple stmt, tree t, tree, void *data)
{
  t = get_base_address (t);
  if (t && TREE_CODE (t) == FUNCTION_DECL)
    {
      /* ??? This can happen on platforms with descriptors when these are
	 directly manipulated in the code.  Pretend that it's an address.  */
      struct cgraph_node *node = cgraph_get_create_node (t);
      cgraph_mark_address_taken_node (node);
      ipa_record_reference ((symtab_node *)data,
			    node,
			    IPA_REF_ADDR, stmt);
    }
  else if (t && TREE_CODE (t) == VAR_DECL
	   && (TREE_STATIC (t) || DECL_EXTERNAL (t)))
    {
      varpool_node *vnode = varpool_node_for_decl (t);

      ipa_record_reference ((symtab_node *)data,
			    vnode,
			    IPA_REF_LOAD, stmt);

      if (L_IPO_COMP_MODE && cgraph_pre_profiling_inlining_done)
        {
          struct varpool_node *rvnode = real_varpool_node (t);
          if (rvnode != vnode)
            ipa_record_reference ((symtab_node *)data,
                                  rvnode,
                                  IPA_REF_ADDR, stmt);
        }
    }
  return false;
}

/* Mark store of T.  */

static bool
mark_store (gimple stmt, tree t, tree, void *data)
{
  t = get_base_address (t);
  if (t && TREE_CODE (t) == VAR_DECL
      && (TREE_STATIC (t) || DECL_EXTERNAL (t)))
    {
      varpool_node *vnode = varpool_node_for_decl (t);

      ipa_record_reference ((symtab_node *)data,
			    vnode,
			    IPA_REF_STORE, stmt);
      if (L_IPO_COMP_MODE && cgraph_pre_profiling_inlining_done)
        {
          struct varpool_node *rvnode = real_varpool_node (t);
          if (rvnode != vnode)
            ipa_record_reference ((symtab_node *)data,
                                  rvnode,
                                  IPA_REF_ADDR, stmt);
        }
     }
  return false;
}

/* Record all references from NODE that are taken in statement STMT.  */
void
ipa_record_stmt_references (struct cgraph_node *node, gimple stmt)
{
  walk_stmt_load_store_addr_ops (stmt, node, mark_load, mark_store,
				 mark_address);
}

/* Create cgraph edges for function calls.
   Also look for functions and variables having addresses taken.  */

static unsigned int
build_cgraph_edges (void)
{
  basic_block bb;
  struct cgraph_node *node = cgraph_get_node (current_function_decl);
  struct pointer_set_t *visited_nodes = pointer_set_create ();
  gimple_stmt_iterator gsi;
  tree decl;
  unsigned ix;

  /* Create the callgraph edges and record the nodes referenced by the function.
     body.  */
  FOR_EACH_BB_FN (bb, cfun)
    {
      for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
	{
	  gimple stmt = gsi_stmt (gsi);
	  tree decl;

	  if (is_gimple_debug (stmt))
	    continue;

	  if (is_gimple_call (stmt))
	    {
	      int freq = compute_call_stmt_bb_frequency (current_function_decl,
							 bb);
	      decl = gimple_call_fndecl (stmt);
	      if (decl)
		cgraph_create_edge (node, cgraph_get_create_node (decl),
				    stmt, bb->count, freq);
	      else if (gimple_call_internal_p (stmt))
		;
	      else
		cgraph_create_indirect_edge (node, stmt,
					     gimple_call_flags (stmt),
					     bb->count, freq);
	    }
	  ipa_record_stmt_references (node, stmt);
	  if (gimple_code (stmt) == GIMPLE_OMP_PARALLEL
	      && gimple_omp_parallel_child_fn (stmt))
	    {
	      tree fn = gimple_omp_parallel_child_fn (stmt);
	      ipa_record_reference (node,
				    cgraph_get_create_node (fn),
				    IPA_REF_ADDR, stmt);
	    }
	  if (gimple_code (stmt) == GIMPLE_OMP_TASK)
	    {
	      tree fn = gimple_omp_task_child_fn (stmt);
	      if (fn)
		ipa_record_reference (node,
				      cgraph_get_create_node (fn),
				      IPA_REF_ADDR, stmt);
	      fn = gimple_omp_task_copy_fn (stmt);
	      if (fn)
		ipa_record_reference (node,
				      cgraph_get_create_node (fn),
				      IPA_REF_ADDR, stmt);
	    }
	}
      for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
	ipa_record_stmt_references (node, gsi_stmt (gsi));
   }


  /* Look for initializers of constant variables and private statics.  */
  FOR_EACH_LOCAL_DECL (cfun, ix, decl)
    if (TREE_CODE (decl) == VAR_DECL
	&& (TREE_STATIC (decl) && !DECL_EXTERNAL (decl))
	&& !DECL_HAS_VALUE_EXPR_P (decl))
      varpool_finalize_decl (decl);
  record_eh_tables (node, cfun);

  pointer_set_destroy (visited_nodes);
  return 0;
}

namespace {

const pass_data pass_data_build_cgraph_edges =
{
  GIMPLE_PASS, /* type */
  "*build_cgraph_edges", /* name */
  OPTGROUP_NONE, /* optinfo_flags */
  false, /* has_gate */
  true, /* has_execute */
  TV_NONE, /* tv_id */
  PROP_cfg, /* properties_required */
  0, /* properties_provided */
  0, /* properties_destroyed */
  0, /* todo_flags_start */
  0, /* todo_flags_finish */
};

class pass_build_cgraph_edges : public gimple_opt_pass
{
public:
  pass_build_cgraph_edges (gcc::context *ctxt)
    : gimple_opt_pass (pass_data_build_cgraph_edges, ctxt)
  {}

  /* opt_pass methods: */
  unsigned int execute () { return build_cgraph_edges (); }

}; // class pass_build_cgraph_edges

} // anon namespace

gimple_opt_pass *
make_pass_build_cgraph_edges (gcc::context *ctxt)
{
  return new pass_build_cgraph_edges (ctxt);
}

/* Record references to functions and other variables present in the
   initial value of DECL, a variable.
   When ONLY_VARS is true, we mark needed only variables, not functions.  */

void
record_references_in_initializer (tree decl, bool only_vars)
{
  struct pointer_set_t *visited_nodes = pointer_set_create ();
  varpool_node *node = varpool_node_for_decl (decl);
  struct record_reference_ctx ctx = {false, NULL};

  ctx.varpool_node = node;
  ctx.only_vars = only_vars;
  walk_tree (&DECL_INITIAL (decl), record_reference,
             &ctx, visited_nodes);
  pointer_set_destroy (visited_nodes);
}

typedef struct _fixup_decl_info {
  tree orig_decl;
  tree new_decl;
} fixup_decl_info;

/* Check the tree at TP to see if it contains the original decl stored in
   DATA and if so replace it with the new decl. If original decl is
   found set WALK_SUBTREES to 0 so the subtree under TP is not traversed.
   Returns the updated parent tree T or NULL if no update performed.  */

static tree
fixup_all_refs_1 (tree *tp, int *walk_subtrees, void *data)
{
  tree t = *tp;
  fixup_decl_info *info = (fixup_decl_info *) data;

  /* The original function decl is always the first tree operand.  */
  if (TREE_OPERAND (t,0) == info->orig_decl)
    {
      TREE_OPERAND (t,0) = info->new_decl;
      *walk_subtrees = 0;
      return t;
    }
  return NULL_TREE;
}

/* Walk the whole tree rooted at TP and invoke fixup_all_refs_1 to
   replace any references to the original decl with the new decl
   stored in INFO.  */

static inline void
fixup_all_refs (tree *tp, fixup_decl_info *info)
{
  tree t = walk_tree (tp, fixup_all_refs_1, info, NULL);
  /* This is invoked when we found the original decl, so we expect
     to have replaced a reference.  */
  gcc_assert (t != NULL_TREE);
}

/* Update any function decl references in base ADDR of operand OP to refer to
   the resolved node.  */

static bool
fixup_ref (gimple, tree addr, tree op)
{
  addr = get_base_address (addr);
  if (addr && TREE_CODE (addr) == FUNCTION_DECL)
    {
      struct cgraph_node *real_callee;
      real_callee = cgraph_lipo_get_resolved_node (addr);
      if (addr == real_callee->decl)
        return false;
      /* We need to locate and update the tree operand within OP
         that contains ADDR and update it to the real callee's decl.  */
      fixup_decl_info info;
      info.orig_decl = addr;
      info.new_decl = real_callee->decl;
      fixup_all_refs (&op, &info);
    }
  return false;
}

/* Update any function decl references in base ADDR of operand OP from address
   STMT operand OP to refer to the resolved node.  */

static bool
fixup_address (gimple stmt, tree addr, tree op, void *)
{
  return fixup_ref (stmt, addr, op);
}

/* Update any function decl references in base ADDR of operand OP from load
   STMT operand OP to refer to the resolved node.  See comments in mark_load
   on when a load may have a function decl reference.  */

static bool
fixup_load (gimple stmt, tree addr, tree op, void *)
{
  return fixup_ref (stmt, addr, op);
}

/* After the LIPO link, references to function decls should be updated
   to the resolved node, so that the correct references are added to the
   cgraph.  Update all references in STMT.  */

void
lipo_fixup_load_addr_ops (gimple stmt)
{
  walk_stmt_load_store_addr_ops (stmt, NULL, fixup_load, NULL,
				 fixup_address);
}

/* In LIPO mode, before tree_profiling, the call graph edge
   needs to be built with the original target node to make
   sure consistent early inline decisions between profile
   generate and profile use. After tree-profiling, the target
   needs to be set to the resolved node so that ipa-inline
   sees the definitions.  */
#include "gimple-pretty-print.h"
static void
lipo_fixup_cgraph_edge_call_target (gimple stmt)
{
  tree decl;
  gcc_assert (is_gimple_call (stmt));

  decl = gimple_call_fndecl (stmt);
  if (decl)
    {
      struct cgraph_node *real_callee;
      real_callee = cgraph_lipo_get_resolved_node (decl);

      if (decl != real_callee->decl)
        {
          int lp_nr;

          gcc_assert (!real_callee->clone.combined_args_to_skip);
          gimple_call_set_fndecl (stmt, real_callee->decl);
          update_stmt (stmt);
          lp_nr = lookup_stmt_eh_lp (stmt);
          if (lp_nr != 0 && !stmt_could_throw_p (stmt))
            remove_stmt_from_eh_lp (stmt);
        }
    }
}

/* Link the cgraph nodes, varpool nodes and fixup the call target to
   the correct decl. Remove dead functions.  */


void
lipo_link_and_fixup ()
{
  struct cgraph_node *node;

  cgraph_pre_profiling_inlining_done = true;
  cgraph_process_module_scope_statics ();
  /* Now perform link to allow cross module inlining.  */
  cgraph_do_link ();
  varpool_do_link ();
  cgraph_unify_type_alias_sets ();
  cgraph_init_gid_map ();
 
  FOR_EACH_DEFINED_FUNCTION (node)
    {
      if (!gimple_has_body_p (node->decl))
	continue;

      /* Don't profile functions produced for builtin stuff.  */
      if (DECL_SOURCE_LOCATION (node->decl) == BUILTINS_LOCATION)
	continue;

      push_cfun (DECL_STRUCT_FUNCTION (node->decl));

      if (L_IPO_COMP_MODE)
	{
	  basic_block bb;
	  FOR_EACH_BB_FN (bb, cfun)
	    {
	      gimple_stmt_iterator gsi;
	      for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
		{
		  gimple stmt = gsi_stmt (gsi);
		  if (is_gimple_call (stmt))
		    lipo_fixup_cgraph_edge_call_target (stmt);
		  lipo_fixup_load_addr_ops (stmt);
		}
	      for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
	        lipo_fixup_load_addr_ops (gsi_stmt (gsi));
	    }
	  update_ssa (TODO_update_ssa);
	}
      rebuild_cgraph_edges ();
      pop_cfun ();
    }

  cgraph_add_fake_indirect_call_edges ();
  symtab_remove_unreachable_nodes (true, dump_file);
}


/* Rebuild cgraph edges for current function node.  This needs to be run after
   passes that don't update the cgraph.  */

unsigned int
rebuild_cgraph_edges (void)
{
  basic_block bb;
  struct cgraph_node *node = cgraph_get_node (current_function_decl);
  gimple_stmt_iterator gsi;

  cgraph_node_remove_callees (node);
  ipa_remove_all_references (&node->ref_list);

  node->count = ENTRY_BLOCK_PTR_FOR_FN (cfun)->count;
  node->max_bb_count = 0;

  FOR_EACH_BB_FN (bb, cfun)
    {
      if (bb->count > node->max_bb_count)
	node->max_bb_count = bb->count;
      for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
	{
	  gimple stmt = gsi_stmt (gsi);
	  tree decl;

	  if (is_gimple_call (stmt))
	    {
	      int freq = compute_call_stmt_bb_frequency (current_function_decl,
							 bb);
	      decl = gimple_call_fndecl (stmt);
	      if (decl)
                {
                  struct cgraph_node *callee = cgraph_get_create_node (decl);
                  if (L_IPO_COMP_MODE)
                    record_reference_to_real_target_from_alias (callee);
                  cgraph_create_edge (node, callee, stmt,
                                      bb->count, freq);
                }
	      else if (gimple_call_internal_p (stmt))
		;
	      else
		cgraph_create_indirect_edge (node, stmt,
					     gimple_call_flags (stmt),
					     bb->count, freq);
	    }
	  ipa_record_stmt_references (node, stmt);
	}
      for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
	ipa_record_stmt_references (node, gsi_stmt (gsi));
    }

  if (!cgraph_pre_profiling_inlining_done)
    add_fake_indirect_call_edges (node);
  record_eh_tables (node, cfun);
  gcc_assert (!node->global.inlined_to);

  return 0;
}

/* Rebuild cgraph edges for current function node.  This needs to be run after
   passes that don't update the cgraph.  */

void
cgraph_rebuild_references (void)
{
  basic_block bb;
  struct cgraph_node *node = cgraph_get_node (current_function_decl);
  gimple_stmt_iterator gsi;
  struct ipa_ref *ref;
  int i;

  /* Keep speculative references for further cgraph edge expansion.  */
  for (i = 0; ipa_ref_list_reference_iterate (&node->ref_list, i, ref);)
    if (!ref->speculative)
      ipa_remove_reference (ref);
    else
      i++;

  node->count = ENTRY_BLOCK_PTR_FOR_FN (cfun)->count;

  FOR_EACH_BB_FN (bb, cfun)
    {
      for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
	ipa_record_stmt_references (node, gsi_stmt (gsi));
      for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
	ipa_record_stmt_references (node, gsi_stmt (gsi));
    }
  record_eh_tables (node, cfun);
}

namespace {

const pass_data pass_data_rebuild_cgraph_edges =
{
  GIMPLE_PASS, /* type */
  "*rebuild_cgraph_edges", /* name */
  OPTGROUP_NONE, /* optinfo_flags */
  false, /* has_gate */
  true, /* has_execute */
  TV_CGRAPH, /* tv_id */
  PROP_cfg, /* properties_required */
  0, /* properties_provided */
  0, /* properties_destroyed */
  0, /* todo_flags_start */
  0, /* todo_flags_finish */
};

class pass_rebuild_cgraph_edges : public gimple_opt_pass
{
public:
  pass_rebuild_cgraph_edges (gcc::context *ctxt)
    : gimple_opt_pass (pass_data_rebuild_cgraph_edges, ctxt)
  {}

  /* opt_pass methods: */
  opt_pass * clone () { return new pass_rebuild_cgraph_edges (m_ctxt); }
  unsigned int execute () { return rebuild_cgraph_edges (); }

}; // class pass_rebuild_cgraph_edges

} // anon namespace

/* Defined in passes.c  */
extern bool cgraph_callee_edges_final_cleanup; 

gimple_opt_pass *
make_pass_rebuild_cgraph_edges (gcc::context *ctxt)
{
  return new pass_rebuild_cgraph_edges (ctxt);
}


static unsigned int
remove_cgraph_callee_edges (void)
{
  /* The -freorder-functions=* needs the call-graph preserved till
     pass_final.  */
  if (cgraph_callee_edges_final_cleanup
      && (flag_reorder_functions > 1))
      return 0;

  struct cgraph_node *node = cgraph_get_node (current_function_decl);
  cgraph_node_remove_callees (node);
  ipa_remove_all_references (&node->ref_list);
  return 0;
}

namespace {

const pass_data pass_data_remove_cgraph_callee_edges =
{
  GIMPLE_PASS, /* type */
  "*remove_cgraph_callee_edges", /* name */
  OPTGROUP_NONE, /* optinfo_flags */
  false, /* has_gate */
  true, /* has_execute */
  TV_NONE, /* tv_id */
  0, /* properties_required */
  0, /* properties_provided */
  0, /* properties_destroyed */
  0, /* todo_flags_start */
  0, /* todo_flags_finish */
};

class pass_remove_cgraph_callee_edges : public gimple_opt_pass
{
public:
  pass_remove_cgraph_callee_edges (gcc::context *ctxt)
    : gimple_opt_pass (pass_data_remove_cgraph_callee_edges, ctxt)
  {}

  /* opt_pass methods: */
  opt_pass * clone () {
    return new pass_remove_cgraph_callee_edges (m_ctxt);
  }
  unsigned int execute () { return remove_cgraph_callee_edges (); }

}; // class pass_remove_cgraph_callee_edges

} // anon namespace

gimple_opt_pass *
make_pass_remove_cgraph_callee_edges (gcc::context *ctxt)
{
  return new pass_remove_cgraph_callee_edges (ctxt);
}