gcc/cgraphbuild.c

   1 /* Callgraph construction.
   2    Copyright (C) 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
   3    Contributed by Jan Hubicka
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify it under
   8 the terms of the GNU General Public License as published by the Free
   9 Software Foundation; either version 2, or (at your option) any later
  10 version.
  11
  12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  14 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  15 for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GCC; see the file COPYING.  If not, write to the Free
  19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
  20 02110-1301, USA.  */
  21
  22 #include "config.h"
  23 #include "system.h"
  24 #include "coretypes.h"
  25 #include "tm.h"
  26 #include "tree.h"
  27 #include "tree-flow.h"
  28 #include "langhooks.h"
  29 #include "pointer-set.h"
  30 #include "cgraph.h"
  31 #include "intl.h"
  32 #include "tree-gimple.h"
  33 #include "tree-pass.h"
  34
  35 /* Walk tree and record all calls and references to functions/variables.
  36    Called via walk_tree: TP is pointer to tree to be examined.  */
  37
  38 static tree
  39 record_reference (tree *tp, int *walk_subtrees, void *data)
  40 {
  41   tree t = *tp;
  42
  43   switch (TREE_CODE (t))
  44     {
  45     case VAR_DECL:
  46       if (TREE_STATIC (t) || DECL_EXTERNAL (t))
  47         {
  48           varpool_mark_needed_node (varpool_node (t));
  49           if (lang_hooks.callgraph.analyze_expr)
  50             return lang_hooks.callgraph.analyze_expr (tp, walk_subtrees,
  51                                                       data);
  52         }
  53       break;
  54
  55     case FDESC_EXPR:
  56     case ADDR_EXPR:
  57       if (flag_unit_at_a_time)
  58         {
  59           /* Record dereferences to the functions.  This makes the
  60              functions reachable unconditionally.  */
  61           tree decl = TREE_OPERAND (*tp, 0);
  62           if (TREE_CODE (decl) == FUNCTION_DECL)
  63             cgraph_mark_needed_node (cgraph_node (decl));
  64         }
  65       break;
  66
  67     default:
  68       /* Save some cycles by not walking types and declaration as we
  69          won't find anything useful there anyway.  */
  70       if (IS_TYPE_OR_DECL_P (*tp))
  71         {
  72           *walk_subtrees = 0;
  73           break;
  74         }
  75
  76       if ((unsigned int) TREE_CODE (t) >= LAST_AND_UNUSED_TREE_CODE)
  77         return lang_hooks.callgraph.analyze_expr (tp, walk_subtrees, data);
  78       break;
  79     }
  80
  81   return NULL_TREE;
  82 }
  83
  84 /* Give initial reasons why inlining would fail on all calls from
  85    NODE.  Those get either nullified or usually overwritten by more precise
  86    reason later.  */
  87
  88 static void
  89 initialize_inline_failed (struct cgraph_node *node)
  90 {
  91   struct cgraph_edge *e;
  92
  93   for (e = node->callers; e; e = e->next_caller)
  94     {
  95       gcc_assert (!e->callee->global.inlined_to);
  96       gcc_assert (e->inline_failed);
  97       if (node->local.redefined_extern_inline)
  98         e->inline_failed = N_("redefined extern inline functions are not "
  99                            "considered for inlining");
 100       else if (!node->local.inlinable)
 101         e->inline_failed = N_("function not inlinable");
 102       else if (CALL_CANNOT_INLINE_P (e->call_stmt))
 103         e->inline_failed = N_("mismatched arguments");
 104       else
 105         e->inline_failed = N_("function not considered for inlining");
 106     }
 107 }
 108
 109 /* Create cgraph edges for function calls.
 110    Also look for functions and variables having addresses taken.  */
 111
 112 static unsigned int
 113 build_cgraph_edges (void)
 114 {
 115   basic_block bb;
 116   struct cgraph_node *node = cgraph_node (current_function_decl);
 117   struct pointer_set_t *visited_nodes = pointer_set_create ();
 118   block_stmt_iterator bsi;
 119   tree step;
 120   int entry_freq = ENTRY_BLOCK_PTR->frequency;
 121
 122   if (!entry_freq)
 123     entry_freq = 1;
 124
 125   /* Create the callgraph edges and record the nodes referenced by the function.
 126      body.  */
 127   FOR_EACH_BB (bb)
 128     for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
 129       {
 130         tree stmt = bsi_stmt (bsi);
 131         tree call = get_call_expr_in (stmt);
 132         tree decl;
 133
 134         if (call && (decl = get_callee_fndecl (call)))
 135           {
 136             int i;
 137             int n = call_expr_nargs (call);
 138             int freq = (!bb->frequency && !entry_freq ? CGRAPH_FREQ_BASE
 139                         : bb->frequency * CGRAPH_FREQ_BASE / entry_freq);
 140             if (freq > CGRAPH_FREQ_MAX)
 141               freq = CGRAPH_FREQ_MAX;
 142             cgraph_create_edge (node, cgraph_node (decl), stmt,
 143                                 bb->count, freq,
 144                                 bb->loop_depth);
 145             for (i = 0; i < n; i++)
 146               walk_tree (&CALL_EXPR_ARG (call, i),
 147                          record_reference, node, visited_nodes);
 148             if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT)
 149               walk_tree (&GIMPLE_STMT_OPERAND (stmt, 0),
 150                          record_reference, node, visited_nodes);
 151           }
 152         else
 153           walk_tree (bsi_stmt_ptr (bsi), record_reference, node, visited_nodes);
 154       }
 155
 156   /* Look for initializers of constant variables and private statics.  */
 157   for (step = cfun->unexpanded_var_list;
 158        step;
 159        step = TREE_CHAIN (step))
 160     {
 161       tree decl = TREE_VALUE (step);
 162       if (TREE_CODE (decl) == VAR_DECL
 163           && (TREE_STATIC (decl) && !DECL_EXTERNAL (decl))
 164           && flag_unit_at_a_time)
 165         varpool_finalize_decl (decl);
 166       else if (TREE_CODE (decl) == VAR_DECL && DECL_INITIAL (decl))
 167         walk_tree (&DECL_INITIAL (decl), record_reference, node, visited_nodes);
 168     }
 169
 170   pointer_set_destroy (visited_nodes);
 171   initialize_inline_failed (node);
 172   return 0;
 173 }
 174
 175 struct tree_opt_pass pass_build_cgraph_edges =
 176 {
 177   NULL,                                 /* name */
 178   NULL,                                 /* gate */
 179   build_cgraph_edges,                   /* execute */
 180   NULL,                                 /* sub */
 181   NULL,                                 /* next */
 182   0,                                    /* static_pass_number */
 183   0,                                    /* tv_id */
 184   PROP_cfg,                             /* properties_required */
 185   0,                                    /* properties_provided */
 186   0,                                    /* properties_destroyed */
 187   0,                                    /* todo_flags_start */
 188   0,                                    /* todo_flags_finish */
 189   0                                     /* letter */
 190 };
 191
 192 /* Record references to functions and other variables present in the
 193    initial value of DECL, a variable.  */
 194
 195 void
 196 record_references_in_initializer (tree decl)
 197 {
 198   struct pointer_set_t *visited_nodes = pointer_set_create ();
 199   walk_tree (&DECL_INITIAL (decl), record_reference, NULL, visited_nodes);
 200   pointer_set_destroy (visited_nodes);
 201 }
 202
 203 /* Rebuild cgraph edges for current function node.  This needs to be run after
 204    passes that don't update the cgraph.  */
 205
 206 static unsigned int
 207 rebuild_cgraph_edges (void)
 208 {
 209   basic_block bb;
 210   struct cgraph_node *node = cgraph_node (current_function_decl);
 211   block_stmt_iterator bsi;
 212   int entry_freq = ENTRY_BLOCK_PTR->frequency;
 213
 214   if (!entry_freq)
 215     entry_freq = 1;
 216
 217   cgraph_node_remove_callees (node);
 218
 219   node->count = ENTRY_BLOCK_PTR->count;
 220
 221   FOR_EACH_BB (bb)
 222     for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
 223       {
 224         tree stmt = bsi_stmt (bsi);
 225         tree call = get_call_expr_in (stmt);
 226         tree decl;
 227
 228         if (call && (decl = get_callee_fndecl (call)))
 229           {
 230             int freq = (!bb->frequency && !entry_freq ? CGRAPH_FREQ_BASE
 231                         : bb->frequency * CGRAPH_FREQ_BASE / entry_freq);
 232             if (freq > CGRAPH_FREQ_MAX)
 233               freq = CGRAPH_FREQ_MAX;
 234             cgraph_create_edge (node, cgraph_node (decl), stmt,
 235                                 bb->count, freq, bb->loop_depth);
 236            }
 237       }
 238   initialize_inline_failed (node);
 239   gcc_assert (!node->global.inlined_to);
 240   return 0;
 241 }
 242
 243 struct tree_opt_pass pass_rebuild_cgraph_edges =
 244 {
 245   NULL,                                 /* name */
 246   NULL,                                 /* gate */
 247   rebuild_cgraph_edges,                 /* execute */
 248   NULL,                                 /* sub */
 249   NULL,                                 /* next */
 250   0,                                    /* static_pass_number */
 251   0,                                    /* tv_id */
 252   PROP_cfg,                             /* properties_required */
 253   0,                                    /* properties_provided */
 254   0,                                    /* properties_destroyed */
 255   0,                                    /* todo_flags_start */
 256   0,                                    /* todo_flags_finish */
 257   0                                     /* letter */
 258 };