gcc/cgraphbuild.c

   1 /* Callgraph construction.
   2    Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
   3    Free Software Foundation, Inc.
   4    Contributed by Jan Hubicka
   5
   6 This file is part of GCC.
   7
   8 GCC is free software; you can redistribute it and/or modify it under
   9 the terms of the GNU General Public License as published by the Free
  10 Software Foundation; either version 3, or (at your option) any later
  11 version.
  12
  13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  15 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  16 for more details.
  17
  18 You should have received a copy of the GNU General Public License
  19 along with GCC; see the file COPYING3.  If not see
  20 <http://www.gnu.org/licenses/>.  */
  21
  22 #include "config.h"
  23 #include "system.h"
  24 #include "coretypes.h"
  25 #include "tm.h"
  26 #include "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 "gimple.h"
  33 #include "tree-pass.h"
  34 #include "ipa-utils.h"
  35 #include "except.h"
  36 #include "ipa-inline.h"
  37
  38 /* Context of record_reference.  */
  39 struct record_reference_ctx
  40 {
  41   bool only_vars;
  42   struct varpool_node *varpool_node;
  43 };
  44
  45 /* Walk tree and record all calls and references to functions/variables.
  46    Called via walk_tree: TP is pointer to tree to be examined.
  47    When DATA is non-null, record references to callgraph.
  48    */
  49
  50 static tree
  51 record_reference (tree *tp, int *walk_subtrees, void *data)
  52 {
  53   tree t = *tp;
  54   tree decl;
  55   struct record_reference_ctx *ctx = (struct record_reference_ctx *)data;
  56
  57   t = canonicalize_constructor_val (t);
  58   if (!t)
  59     t = *tp;
  60   else if (t != *tp)
  61     *tp = t;
  62
  63   switch (TREE_CODE (t))
  64     {
  65     case VAR_DECL:
  66     case FUNCTION_DECL:
  67       gcc_unreachable ();
  68       break;
  69
  70     case FDESC_EXPR:
  71     case ADDR_EXPR:
  72       /* Record dereferences to the functions.  This makes the
  73          functions reachable unconditionally.  */
  74       decl = get_base_var (*tp);
  75       if (TREE_CODE (decl) == FUNCTION_DECL)
  76         {
  77           struct cgraph_node *node = cgraph_get_create_node (decl);
  78           if (!ctx->only_vars)
  79             cgraph_mark_address_taken_node (node);
  80           ipa_record_reference (NULL, ctx->varpool_node, node, NULL,
  81                                 IPA_REF_ADDR, NULL);
  82         }
  83
  84       if (TREE_CODE (decl) == VAR_DECL)
  85         {
  86           struct varpool_node *vnode = varpool_node (decl);
  87           if (lang_hooks.callgraph.analyze_expr)
  88             lang_hooks.callgraph.analyze_expr (&decl, walk_subtrees);
  89           varpool_mark_needed_node (vnode);
  90           if (vnode->alias && vnode->extra_name)
  91             vnode = vnode->extra_name;
  92           ipa_record_reference (NULL, ctx->varpool_node,
  93                                 NULL, vnode,
  94                                 IPA_REF_ADDR, NULL);
  95         }
  96       *walk_subtrees = 0;
  97       break;
  98
  99     default:
 100       /* Save some cycles by not walking types and declaration as we
 101          won't find anything useful there anyway.  */
 102       if (IS_TYPE_OR_DECL_P (*tp))
 103         {
 104           *walk_subtrees = 0;
 105           break;
 106         }
 107
 108       if ((unsigned int) TREE_CODE (t) >= LAST_AND_UNUSED_TREE_CODE)
 109         return lang_hooks.callgraph.analyze_expr (tp, walk_subtrees);
 110       break;
 111     }
 112
 113   return NULL_TREE;
 114 }
 115
 116 /* Record references to typeinfos in the type list LIST.  */
 117
 118 static void
 119 record_type_list (struct cgraph_node *node, tree list)
 120 {
 121   for (; list; list = TREE_CHAIN (list))
 122     {
 123       tree type = TREE_VALUE (list);
 124
 125       if (TYPE_P (type))
 126         type = lookup_type_for_runtime (type);
 127       STRIP_NOPS (type);
 128       if (TREE_CODE (type) == ADDR_EXPR)
 129         {
 130           type = TREE_OPERAND (type, 0);
 131           if (TREE_CODE (type) == VAR_DECL)
 132             {
 133               struct varpool_node *vnode = varpool_node (type);
 134               varpool_mark_needed_node (vnode);
 135               ipa_record_reference (node, NULL,
 136                                     NULL, vnode,
 137                                     IPA_REF_ADDR, NULL);
 138             }
 139         }
 140     }
 141 }
 142
 143 /* Record all references we will introduce by producing EH tables
 144    for NODE.  */
 145
 146 static void
 147 record_eh_tables (struct cgraph_node *node, struct function *fun)
 148 {
 149   eh_region i;
 150
 151   if (DECL_FUNCTION_PERSONALITY (node->decl))
 152     ipa_record_reference (node, NULL,
 153                cgraph_get_create_node (DECL_FUNCTION_PERSONALITY (node->decl)),
 154                NULL, IPA_REF_ADDR, NULL);
 155
 156   i = fun->eh->region_tree;
 157   if (!i)
 158     return;
 159
 160   while (1)
 161     {
 162       switch (i->type)
 163         {
 164         case ERT_CLEANUP:
 165         case ERT_MUST_NOT_THROW:
 166           break;
 167
 168         case ERT_TRY:
 169           {
 170             eh_catch c;
 171             for (c = i->u.eh_try.first_catch; c; c = c->next_catch)
 172               record_type_list (node, c->type_list);
 173           }
 174           break;
 175
 176         case ERT_ALLOWED_EXCEPTIONS:
 177           record_type_list (node, i->u.allowed.type_list);
 178           break;
 179         }
 180       /* If there are sub-regions, process them.  */
 181       if (i->inner)
 182         i = i->inner;
 183       /* If there are peers, process them.  */
 184       else if (i->next_peer)
 185         i = i->next_peer;
 186       /* Otherwise, step back up the tree to the next peer.  */
 187       else
 188         {
 189           do
 190             {
 191               i = i->outer;
 192               if (i == NULL)
 193                 return;
 194             }
 195           while (i->next_peer == NULL);
 196           i = i->next_peer;
 197         }
 198     }
 199 }
 200
 201 /* Reset inlining information of all incoming call edges of NODE.  */
 202
 203 void
 204 reset_inline_failed (struct cgraph_node *node)
 205 {
 206   struct cgraph_edge *e;
 207
 208   for (e = node->callers; e; e = e->next_caller)
 209     {
 210       e->callee->global.inlined_to = NULL;
 211       initialize_inline_failed (e);
 212     }
 213 }
 214
 215 /* Computes the frequency of the call statement so that it can be stored in
 216    cgraph_edge.  BB is the basic block of the call statement.  */
 217 int
 218 compute_call_stmt_bb_frequency (tree decl, basic_block bb)
 219 {
 220   int entry_freq = ENTRY_BLOCK_PTR_FOR_FUNCTION
 221                      (DECL_STRUCT_FUNCTION (decl))->frequency;
 222   int freq = bb->frequency;
 223
 224   if (profile_status_for_function (DECL_STRUCT_FUNCTION (decl)) == PROFILE_ABSENT)
 225     return CGRAPH_FREQ_BASE;
 226
 227   if (!entry_freq)
 228     entry_freq = 1, freq++;
 229
 230   freq = freq * CGRAPH_FREQ_BASE / entry_freq;
 231   if (freq > CGRAPH_FREQ_MAX)
 232     freq = CGRAPH_FREQ_MAX;
 233
 234   return freq;
 235 }
 236
 237 /* Mark address taken in STMT.  */
 238
 239 static bool
 240 mark_address (gimple stmt, tree addr, void *data)
 241 {
 242   addr = get_base_address (addr);
 243   if (TREE_CODE (addr) == FUNCTION_DECL)
 244     {
 245       struct cgraph_node *node = cgraph_get_create_node (addr);
 246       cgraph_mark_address_taken_node (node);
 247       ipa_record_reference ((struct cgraph_node *)data, NULL,
 248                             node, NULL,
 249                             IPA_REF_ADDR, stmt);
 250     }
 251   else if (addr && TREE_CODE (addr) == VAR_DECL
 252            && (TREE_STATIC (addr) || DECL_EXTERNAL (addr)))
 253     {
 254       struct varpool_node *vnode = varpool_node (addr);
 255       int walk_subtrees;
 256
 257       if (lang_hooks.callgraph.analyze_expr)
 258         lang_hooks.callgraph.analyze_expr (&addr, &walk_subtrees);
 259       varpool_mark_needed_node (vnode);
 260       if (vnode->alias && vnode->extra_name)
 261         vnode = vnode->extra_name;
 262       ipa_record_reference ((struct cgraph_node *)data, NULL,
 263                             NULL, vnode,
 264                             IPA_REF_ADDR, stmt);
 265     }
 266
 267   return false;
 268 }
 269
 270 /* Mark load of T.  */
 271
 272 static bool
 273 mark_load (gimple stmt, tree t, void *data)
 274 {
 275   t = get_base_address (t);
 276   if (t && TREE_CODE (t) == FUNCTION_DECL)
 277     {
 278       /* ??? This can happen on platforms with descriptors when these are
 279          directly manipulated in the code.  Pretend that it's an address.  */
 280       struct cgraph_node *node = cgraph_get_create_node (t);
 281       cgraph_mark_address_taken_node (node);
 282       ipa_record_reference ((struct cgraph_node *)data, NULL,
 283                             node, NULL,
 284                             IPA_REF_ADDR, stmt);
 285     }
 286   else if (t && TREE_CODE (t) == VAR_DECL
 287            && (TREE_STATIC (t) || DECL_EXTERNAL (t)))
 288     {
 289       struct varpool_node *vnode = varpool_node (t);
 290       int walk_subtrees;
 291
 292       if (lang_hooks.callgraph.analyze_expr)
 293         lang_hooks.callgraph.analyze_expr (&t, &walk_subtrees);
 294       varpool_mark_needed_node (vnode);
 295       if (vnode->alias && vnode->extra_name)
 296         vnode = vnode->extra_name;
 297       ipa_record_reference ((struct cgraph_node *)data, NULL,
 298                             NULL, vnode,
 299                             IPA_REF_LOAD, stmt);
 300     }
 301   return false;
 302 }
 303
 304 /* Mark store of T.  */
 305
 306 static bool
 307 mark_store (gimple stmt, tree t, void *data)
 308 {
 309   t = get_base_address (t);
 310   if (t && TREE_CODE (t) == VAR_DECL
 311       && (TREE_STATIC (t) || DECL_EXTERNAL (t)))
 312     {
 313       struct varpool_node *vnode = varpool_node (t);
 314       int walk_subtrees;
 315
 316       if (lang_hooks.callgraph.analyze_expr)
 317         lang_hooks.callgraph.analyze_expr (&t, &walk_subtrees);
 318       varpool_mark_needed_node (vnode);
 319       if (vnode->alias && vnode->extra_name)
 320         vnode = vnode->extra_name;
 321       ipa_record_reference ((struct cgraph_node *)data, NULL,
 322                             NULL, vnode,
 323                             IPA_REF_STORE, stmt);
 324      }
 325   return false;
 326 }
 327
 328 /* Create cgraph edges for function calls.
 329    Also look for functions and variables having addresses taken.  */
 330
 331 static unsigned int
 332 build_cgraph_edges (void)
 333 {
 334   basic_block bb;
 335   struct cgraph_node *node = cgraph_get_node (current_function_decl);
 336   struct pointer_set_t *visited_nodes = pointer_set_create ();
 337   gimple_stmt_iterator gsi;
 338   tree decl;
 339   unsigned ix;
 340
 341   /* Create the callgraph edges and record the nodes referenced by the function.
 342      body.  */
 343   FOR_EACH_BB (bb)
 344     {
 345       for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
 346         {
 347           gimple stmt = gsi_stmt (gsi);
 348           tree decl;
 349
 350           if (is_gimple_call (stmt))
 351             {
 352               int freq = compute_call_stmt_bb_frequency (current_function_decl,
 353                                                          bb);
 354               decl = gimple_call_fndecl (stmt);
 355               if (decl)
 356                 cgraph_create_edge (node, cgraph_get_create_node (decl),
 357                                     stmt, bb->count, freq, bb->loop_depth);
 358               else
 359                 cgraph_create_indirect_edge (node, stmt,
 360                                              gimple_call_flags (stmt),
 361                                              bb->count, freq,
 362                                              bb->loop_depth);
 363             }
 364           walk_stmt_load_store_addr_ops (stmt, node, mark_load,
 365                                          mark_store, mark_address);
 366           if (gimple_code (stmt) == GIMPLE_OMP_PARALLEL
 367               && gimple_omp_parallel_child_fn (stmt))
 368             {
 369               tree fn = gimple_omp_parallel_child_fn (stmt);
 370               ipa_record_reference (node, NULL, cgraph_get_create_node (fn),
 371                                     NULL, IPA_REF_ADDR, stmt);
 372             }
 373           if (gimple_code (stmt) == GIMPLE_OMP_TASK)
 374             {
 375               tree fn = gimple_omp_task_child_fn (stmt);
 376               if (fn)
 377                 ipa_record_reference (node, NULL, cgraph_get_create_node (fn),
 378                                       NULL, IPA_REF_ADDR, stmt);
 379               fn = gimple_omp_task_copy_fn (stmt);
 380               if (fn)
 381                 ipa_record_reference (node, NULL, cgraph_get_create_node (fn),
 382                                       NULL, IPA_REF_ADDR, stmt);
 383             }
 384         }
 385       for (gsi = gsi_start (phi_nodes (bb)); !gsi_end_p (gsi); gsi_next (&gsi))
 386         walk_stmt_load_store_addr_ops (gsi_stmt (gsi), node,
 387                                        mark_load, mark_store, mark_address);
 388    }
 389
 390   /* Look for initializers of constant variables and private statics.  */
 391   FOR_EACH_LOCAL_DECL (cfun, ix, decl)
 392     if (TREE_CODE (decl) == VAR_DECL
 393         && (TREE_STATIC (decl) && !DECL_EXTERNAL (decl)))
 394       varpool_finalize_decl (decl);
 395   record_eh_tables (node, cfun);
 396
 397   pointer_set_destroy (visited_nodes);
 398   return 0;
 399 }
 400
 401 struct gimple_opt_pass pass_build_cgraph_edges =
 402 {
 403  {
 404   GIMPLE_PASS,
 405   "*build_cgraph_edges",                        /* name */
 406   NULL,                                 /* gate */
 407   build_cgraph_edges,                   /* execute */
 408   NULL,                                 /* sub */
 409   NULL,                                 /* next */
 410   0,                                    /* static_pass_number */
 411   TV_NONE,                              /* tv_id */
 412   PROP_cfg,                             /* properties_required */
 413   0,                                    /* properties_provided */
 414   0,                                    /* properties_destroyed */
 415   0,                                    /* todo_flags_start */
 416   0                                     /* todo_flags_finish */
 417  }
 418 };
 419
 420 /* Record references to functions and other variables present in the
 421    initial value of DECL, a variable.
 422    When ONLY_VARS is true, we mark needed only variables, not functions.  */
 423
 424 void
 425 record_references_in_initializer (tree decl, bool only_vars)
 426 {
 427   struct pointer_set_t *visited_nodes = pointer_set_create ();
 428   struct varpool_node *node = varpool_node (decl);
 429   struct record_reference_ctx ctx = {false, NULL};
 430
 431   ctx.varpool_node = node;
 432   ctx.only_vars = only_vars;
 433   walk_tree (&DECL_INITIAL (decl), record_reference,
 434              &ctx, visited_nodes);
 435   pointer_set_destroy (visited_nodes);
 436 }
 437
 438 /* Rebuild cgraph edges for current function node.  This needs to be run after
 439    passes that don't update the cgraph.  */
 440
 441 unsigned int
 442 rebuild_cgraph_edges (void)
 443 {
 444   basic_block bb;
 445   struct cgraph_node *node = cgraph_get_node (current_function_decl);
 446   gimple_stmt_iterator gsi;
 447
 448   cgraph_node_remove_callees (node);
 449   ipa_remove_all_references (&node->ref_list);
 450
 451   node->count = ENTRY_BLOCK_PTR->count;
 452
 453   FOR_EACH_BB (bb)
 454     {
 455       for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
 456         {
 457           gimple stmt = gsi_stmt (gsi);
 458           tree decl;
 459
 460           if (is_gimple_call (stmt))
 461             {
 462               int freq = compute_call_stmt_bb_frequency (current_function_decl,
 463                                                          bb);
 464               decl = gimple_call_fndecl (stmt);
 465               if (decl)
 466                 cgraph_create_edge (node, cgraph_get_create_node (decl), stmt,
 467                                     bb->count, freq, bb->loop_depth);
 468               else
 469                 cgraph_create_indirect_edge (node, stmt,
 470                                              gimple_call_flags (stmt),
 471                                              bb->count, freq,
 472                                              bb->loop_depth);
 473             }
 474           walk_stmt_load_store_addr_ops (stmt, node, mark_load,
 475                                          mark_store, mark_address);
 476
 477         }
 478       for (gsi = gsi_start (phi_nodes (bb)); !gsi_end_p (gsi); gsi_next (&gsi))
 479         walk_stmt_load_store_addr_ops (gsi_stmt (gsi), node,
 480                                        mark_load, mark_store, mark_address);
 481     }
 482   record_eh_tables (node, cfun);
 483   gcc_assert (!node->global.inlined_to);
 484
 485   return 0;
 486 }
 487
 488 /* Rebuild cgraph edges for current function node.  This needs to be run after
 489    passes that don't update the cgraph.  */
 490
 491 void
 492 cgraph_rebuild_references (void)
 493 {
 494   basic_block bb;
 495   struct cgraph_node *node = cgraph_get_node (current_function_decl);
 496   gimple_stmt_iterator gsi;
 497
 498   ipa_remove_all_references (&node->ref_list);
 499
 500   node->count = ENTRY_BLOCK_PTR->count;
 501
 502   FOR_EACH_BB (bb)
 503     {
 504       for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
 505         {
 506           gimple stmt = gsi_stmt (gsi);
 507
 508           walk_stmt_load_store_addr_ops (stmt, node, mark_load,
 509                                          mark_store, mark_address);
 510
 511         }
 512       for (gsi = gsi_start (phi_nodes (bb)); !gsi_end_p (gsi); gsi_next (&gsi))
 513         walk_stmt_load_store_addr_ops (gsi_stmt (gsi), node,
 514                                        mark_load, mark_store, mark_address);
 515     }
 516   record_eh_tables (node, cfun);
 517 }
 518
 519 struct gimple_opt_pass pass_rebuild_cgraph_edges =
 520 {
 521  {
 522   GIMPLE_PASS,
 523   "*rebuild_cgraph_edges",              /* name */
 524   NULL,                                 /* gate */
 525   rebuild_cgraph_edges,                 /* execute */
 526   NULL,                                 /* sub */
 527   NULL,                                 /* next */
 528   0,                                    /* static_pass_number */
 529   TV_CGRAPH,                            /* tv_id */
 530   PROP_cfg,                             /* properties_required */
 531   0,                                    /* properties_provided */
 532   0,                                    /* properties_destroyed */
 533   0,                                    /* todo_flags_start */
 534   0,                                    /* todo_flags_finish */
 535  }
 536 };
 537
 538
 539 static unsigned int
 540 remove_cgraph_callee_edges (void)
 541 {
 542   cgraph_node_remove_callees (cgraph_get_node (current_function_decl));
 543   return 0;
 544 }
 545
 546 struct gimple_opt_pass pass_remove_cgraph_callee_edges =
 547 {
 548  {
 549   GIMPLE_PASS,
 550   "*remove_cgraph_callee_edges",                /* name */
 551   NULL,                                 /* gate */
 552   remove_cgraph_callee_edges,           /* execute */
 553   NULL,                                 /* sub */
 554   NULL,                                 /* next */
 555   0,                                    /* static_pass_number */
 556   TV_NONE,                              /* tv_id */
 557   0,                                    /* properties_required */
 558   0,                                    /* properties_provided */
 559   0,                                    /* properties_destroyed */
 560   0,                                    /* todo_flags_start */
 561   0,                                    /* todo_flags_finish */
 562  }
 563 };