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 3, 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 COPYING3.  If not see
  19 <http://www.gnu.org/licenses/>.  */
  20
  21 #include "config.h"
  22 #include "system.h"
  23 #include "coretypes.h"
  24 #include "tm.h"
  25 #include "tree.h"
  26 #include "tree-flow.h"
  27 #include "langhooks.h"
  28 #include "pointer-set.h"
  29 #include "cgraph.h"
  30 #include "intl.h"
  31 #include "tree-gimple.h"
  32 #include "tree-pass.h"
  33
  34 /* Walk tree and record all calls and references to functions/variables.
  35    Called via walk_tree: TP is pointer to tree to be examined.  */
  36
  37 static tree
  38 record_reference (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
  39 {
  40   tree t = *tp;
  41
  42   switch (TREE_CODE (t))
  43     {
  44     case VAR_DECL:
  45       if (TREE_STATIC (t) || DECL_EXTERNAL (t))
  46         {
  47           varpool_mark_needed_node (varpool_node (t));
  48           if (lang_hooks.callgraph.analyze_expr)
  49             return lang_hooks.callgraph.analyze_expr (tp, walk_subtrees);
  50         }
  51       break;
  52
  53     case FDESC_EXPR:
  54     case ADDR_EXPR:
  55       if (flag_unit_at_a_time)
  56         {
  57           /* Record dereferences to the functions.  This makes the
  58              functions reachable unconditionally.  */
  59           tree decl = TREE_OPERAND (*tp, 0);
  60           if (TREE_CODE (decl) == FUNCTION_DECL)
  61             cgraph_mark_needed_node (cgraph_node (decl));
  62         }
  63       break;
  64
  65     default:
  66       /* Save some cycles by not walking types and declaration as we
  67          won't find anything useful there anyway.  */
  68       if (IS_TYPE_OR_DECL_P (*tp))
  69         {
  70           *walk_subtrees = 0;
  71           break;
  72         }
  73
  74       if ((unsigned int) TREE_CODE (t) >= LAST_AND_UNUSED_TREE_CODE)
  75         return lang_hooks.callgraph.analyze_expr (tp, walk_subtrees);
  76       break;
  77     }
  78
  79   return NULL_TREE;
  80 }
  81
  82 /* Give initial reasons why inlining would fail on all calls from
  83    NODE.  Those get either nullified or usually overwritten by more precise
  84    reason later.  */
  85
  86 static void
  87 initialize_inline_failed (struct cgraph_node *node)
  88 {
  89   struct cgraph_edge *e;
  90
  91   for (e = node->callers; e; e = e->next_caller)
  92     {
  93       gcc_assert (!e->callee->global.inlined_to);
  94       gcc_assert (e->inline_failed);
  95       if (node->local.redefined_extern_inline)
  96         e->inline_failed = N_("redefined extern inline functions are not "
  97                            "considered for inlining");
  98       else if (!node->local.inlinable)
  99         e->inline_failed = N_("function not inlinable");
 100       else if (CALL_STMT_CANNOT_INLINE_P (e->call_stmt))
 101         e->inline_failed = N_("mismatched arguments");
 102       else
 103         e->inline_failed = N_("function not considered for inlining");
 104     }
 105 }
 106
 107 /* Create cgraph edges for function calls.
 108    Also look for functions and variables having addresses taken.  */
 109
 110 static unsigned int
 111 build_cgraph_edges (void)
 112 {
 113   basic_block bb;
 114   struct cgraph_node *node = cgraph_node (current_function_decl);
 115   struct pointer_set_t *visited_nodes = pointer_set_create ();
 116   block_stmt_iterator bsi;
 117   tree step;
 118   int entry_freq = ENTRY_BLOCK_PTR->frequency;
 119
 120   if (!entry_freq)
 121     entry_freq = 1;
 122
 123   /* Create the callgraph edges and record the nodes referenced by the function.
 124      body.  */
 125   FOR_EACH_BB (bb)
 126     for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
 127       {
 128         tree stmt = bsi_stmt (bsi);
 129         tree call = get_call_expr_in (stmt);
 130         tree decl;
 131
 132         if (call && (decl = get_callee_fndecl (call)))
 133           {
 134             int i;
 135             int n = call_expr_nargs (call);
 136             int freq = (!bb->frequency && !entry_freq ? CGRAPH_FREQ_BASE
 137                         : bb->frequency * CGRAPH_FREQ_BASE / entry_freq);
 138             if (freq > CGRAPH_FREQ_MAX)
 139               freq = CGRAPH_FREQ_MAX;
 140             cgraph_create_edge (node, cgraph_node (decl), stmt,
 141                                 bb->count, freq,
 142                                 bb->loop_depth);
 143             for (i = 0; i < n; i++)
 144               walk_tree (&CALL_EXPR_ARG (call, i),
 145                          record_reference, node, visited_nodes);
 146             if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT)
 147               walk_tree (&GIMPLE_STMT_OPERAND (stmt, 0),
 148                          record_reference, node, visited_nodes);
 149           }
 150         else
 151           walk_tree (bsi_stmt_ptr (bsi), record_reference, node, visited_nodes);
 152       }
 153
 154   /* Look for initializers of constant variables and private statics.  */
 155   for (step = cfun->local_decls;
 156        step;
 157        step = TREE_CHAIN (step))
 158     {
 159       tree decl = TREE_VALUE (step);
 160       if (TREE_CODE (decl) == VAR_DECL
 161           && (TREE_STATIC (decl) && !DECL_EXTERNAL (decl))
 162           && flag_unit_at_a_time)
 163         varpool_finalize_decl (decl);
 164       else if (TREE_CODE (decl) == VAR_DECL && DECL_INITIAL (decl))
 165         walk_tree (&DECL_INITIAL (decl), record_reference, node, visited_nodes);
 166     }
 167
 168   pointer_set_destroy (visited_nodes);
 169   initialize_inline_failed (node);
 170   return 0;
 171 }
 172
 173 struct gimple_opt_pass pass_build_cgraph_edges =
 174 {
 175  {
 176   GIMPLE_PASS,
 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  }
 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 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 gimple_opt_pass pass_rebuild_cgraph_edges =
 244 {
 245  {
 246   GIMPLE_PASS,
 247   NULL,                                 /* name */
 248   NULL,                                 /* gate */
 249   rebuild_cgraph_edges,                 /* execute */
 250   NULL,                                 /* sub */
 251   NULL,                                 /* next */
 252   0,                                    /* static_pass_number */
 253   0,                                    /* tv_id */
 254   PROP_cfg,                             /* properties_required */
 255   0,                                    /* properties_provided */
 256   0,                                    /* properties_destroyed */
 257   0,                                    /* todo_flags_start */
 258   0,                                    /* todo_flags_finish */
 259  }
 260 };