gcc/tree-optimize.c

   1 /* Top-level control of tree optimizations.
   2    Copyright 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
   3    Contributed by Diego Novillo <dnovillo@redhat.com>
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify
   8 it under the terms of the GNU General Public License as published by
   9 the Free Software Foundation; either version 2, or (at your option)
  10 any later version.
  11
  12 GCC is distributed in the hope that it will be useful,
  13 but WITHOUT ANY WARRANTY; without even the implied warranty of
  14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15 GNU General Public License 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
  19 the Free Software Foundation, 59 Temple Place - Suite 330,
  20 Boston, MA 02111-1307, USA.  */
  21
  22 #include "config.h"
  23 #include "system.h"
  24 #include "coretypes.h"
  25 #include "tm.h"
  26 #include "tree.h"
  27 #include "rtl.h"
  28 #include "tm_p.h"
  29 #include "hard-reg-set.h"
  30 #include "basic-block.h"
  31 #include "output.h"
  32 #include "expr.h"
  33 #include "diagnostic.h"
  34 #include "basic-block.h"
  35 #include "flags.h"
  36 #include "tree-flow.h"
  37 #include "tree-dump.h"
  38 #include "timevar.h"
  39 #include "function.h"
  40 #include "langhooks.h"
  41 #include "toplev.h"
  42 #include "flags.h"
  43 #include "cgraph.h"
  44 #include "tree-inline.h"
  45 #include "tree-mudflap.h"
  46 #include "tree-pass.h"
  47 #include "ggc.h"
  48 #include "cgraph.h"
  49 #include "graph.h"
  50
  51
  52 /* Global variables used to communicate with passes.  */
  53 int dump_flags;
  54 bitmap vars_to_rename;
  55 bool in_gimple_form;
  56
  57 /* The root of the compilation pass tree, once constructed.  */
  58 static struct tree_opt_pass *all_passes;
  59
  60 /* Pass: dump the gimplified, inlined, functions.  */
  61
  62 static struct tree_opt_pass pass_gimple =
  63 {
  64   "gimple",                             /* name */
  65   NULL,                                 /* gate */
  66   NULL,                                 /* execute */
  67   NULL,                                 /* sub */
  68   NULL,                                 /* next */
  69   0,                                    /* static_pass_number */
  70   0,                                    /* tv_id */
  71   0,                                    /* properties_required */
  72   PROP_gimple_any,                      /* properties_provided */
  73   0,                                    /* properties_destroyed */
  74   0,                                    /* todo_flags_start */
  75   TODO_dump_func,                       /* todo_flags_finish */
  76   0                                     /* letter */
  77 };
  78
  79 /* Gate: execute, or not, all of the non-trivial optimizations.  */
  80
  81 static bool
  82 gate_all_optimizations (void)
  83 {
  84   return (optimize >= 1
  85           /* Don't bother doing anything if the program has errors.  */
  86           && !(errorcount || sorrycount));
  87 }
  88
  89 static struct tree_opt_pass pass_all_optimizations =
  90 {
  91   NULL,                                 /* name */
  92   gate_all_optimizations,               /* gate */
  93   NULL,                                 /* execute */
  94   NULL,                                 /* sub */
  95   NULL,                                 /* next */
  96   0,                                    /* static_pass_number */
  97   0,                                    /* tv_id */
  98   0,                                    /* properties_required */
  99   0,                                    /* properties_provided */
 100   0,                                    /* properties_destroyed */
 101   0,                                    /* todo_flags_start */
 102   0,                                    /* todo_flags_finish */
 103   0                                     /* letter */
 104 };
 105
 106 /* Pass: cleanup the CFG just before expanding trees to RTL.
 107    This is just a round of label cleanups and case node grouping
 108    because after the tree optimizers have run such cleanups may
 109    be necessary.  */
 110
 111 static void
 112 execute_cleanup_cfg_post_optimizing (void)
 113 {
 114   cleanup_tree_cfg ();
 115   cleanup_dead_labels ();
 116   group_case_labels ();
 117 }
 118
 119 static struct tree_opt_pass pass_cleanup_cfg_post_optimizing =
 120 {
 121   "final_cleanup",                      /* name */
 122   NULL,                                 /* gate */
 123   execute_cleanup_cfg_post_optimizing,  /* execute */
 124   NULL,                                 /* sub */
 125   NULL,                                 /* next */
 126   0,                                    /* static_pass_number */
 127   0,                                    /* tv_id */
 128   PROP_cfg,                             /* properties_required */
 129   0,                                    /* properties_provided */
 130   0,                                    /* properties_destroyed */
 131   0,                                    /* todo_flags_start */
 132   TODO_dump_func,                                       /* todo_flags_finish */
 133   0                                     /* letter */
 134 };
 135
 136 /* Pass: do the actions required to finish with tree-ssa optimization
 137    passes.  */
 138
 139 static void
 140 execute_free_datastructures (void)
 141 {
 142   tree *chain;
 143
 144   /* ??? This isn't the right place for this.  Worse, it got computed
 145      more or less at random in various passes.  */
 146   free_dominance_info (CDI_DOMINATORS);
 147
 148   /* Emit gotos for implicit jumps.  */
 149   disband_implicit_edges ();
 150
 151   /* Remove the ssa structures.  Do it here since this includes statement
 152      annotations that need to be intact during disband_implicit_edges.  */
 153   delete_tree_ssa ();
 154
 155   /* Re-chain the statements from the blocks.  */
 156   chain = &DECL_SAVED_TREE (current_function_decl);
 157   *chain = alloc_stmt_list ();
 158
 159   /* And get rid of annotations we no longer need.  */
 160   delete_tree_cfg_annotations ();
 161 }
 162
 163 static struct tree_opt_pass pass_free_datastructures =
 164 {
 165   NULL,                                 /* name */
 166   NULL,                                 /* gate */
 167   execute_free_datastructures,                  /* execute */
 168   NULL,                                 /* sub */
 169   NULL,                                 /* next */
 170   0,                                    /* static_pass_number */
 171   0,                                    /* tv_id */
 172   PROP_cfg,                             /* properties_required */
 173   0,                                    /* properties_provided */
 174   0,                                    /* properties_destroyed */
 175   0,                                    /* todo_flags_start */
 176   0,                                    /* todo_flags_finish */
 177   0                                     /* letter */
 178 };
 179
 180
 181 /* Do the actions required to initialize internal data structures used
 182    in tree-ssa optimization passes.  */
 183
 184 static void
 185 execute_init_datastructures (void)
 186 {
 187   /* Allocate hash tables, arrays and other structures.  */
 188   init_tree_ssa ();
 189 }
 190
 191 static struct tree_opt_pass pass_init_datastructures =
 192 {
 193   NULL,                                 /* name */
 194   NULL,                                 /* gate */
 195   execute_init_datastructures,          /* execute */
 196   NULL,                                 /* sub */
 197   NULL,                                 /* next */
 198   0,                                    /* static_pass_number */
 199   0,                                    /* tv_id */
 200   PROP_cfg,                             /* properties_required */
 201   0,                                    /* properties_provided */
 202   0,                                    /* properties_destroyed */
 203   0,                                    /* todo_flags_start */
 204   0,                                    /* todo_flags_finish */
 205   0                                     /* letter */
 206 };
 207
 208 /* Iterate over the pass tree allocating dump file numbers.  We want
 209    to do this depth first, and independent of whether the pass is
 210    enabled or not.  */
 211
 212 static void
 213 register_one_dump_file (struct tree_opt_pass *pass, int n)
 214 {
 215   char *dot_name, *flag_name;
 216   char num[10];
 217
 218   /* See below in next_pass_1.  */
 219   num[0] = '\0';
 220   if (pass->static_pass_number != -1)
 221     sprintf (num, "%d", ((int) pass->static_pass_number < 0
 222                          ? 1 : pass->static_pass_number));
 223
 224   dot_name = concat (".", pass->name, num, NULL);
 225   if (pass->properties_provided & PROP_trees)
 226     {
 227       flag_name = concat ("tree-", pass->name, num, NULL);
 228       pass->static_pass_number = dump_register (dot_name, flag_name,
 229                                                 TDF_TREE, n + TDI_tree_all, 0);
 230     }
 231   else
 232     {
 233       flag_name = concat ("rtl-", pass->name, num, NULL);
 234       pass->static_pass_number = dump_register (dot_name, flag_name,
 235                                                 TDF_RTL, n, pass->letter);
 236     }
 237 }
 238
 239 static int
 240 register_dump_files (struct tree_opt_pass *pass, int properties)
 241 {
 242   static int n = 0;
 243   do
 244     {
 245       int new_properties;
 246       int pass_number;
 247
 248       pass->properties_required = properties;
 249       new_properties =
 250         (properties | pass->properties_provided) & ~pass->properties_destroyed;
 251
 252       /* Reset the counter when we reach RTL-based passes.  */
 253       if ((pass->properties_provided ^ pass->properties_required) & PROP_rtl)
 254         n = 0;
 255
 256       pass_number = n;
 257       if (pass->name)
 258         n++;
 259
 260       if (pass->sub)
 261         new_properties = register_dump_files (pass->sub, new_properties);
 262
 263       /* If we have a gate, combine the properties that we could have with
 264          and without the pass being examined.  */
 265       if (pass->gate)
 266         properties &= new_properties;
 267       else
 268         properties = new_properties;
 269
 270       pass->properties_provided = properties;
 271       if (pass->name)
 272         register_one_dump_file (pass, pass_number);
 273
 274       pass = pass->next;
 275     }
 276   while (pass);
 277
 278   return properties;
 279 }
 280
 281 /* Add a pass to the pass list. Duplicate the pass if it's already
 282    in the list.  */
 283
 284 static struct tree_opt_pass **
 285 next_pass_1 (struct tree_opt_pass **list, struct tree_opt_pass *pass)
 286 {
 287
 288   /* A nonzero static_pass_number indicates that the
 289      pass is already in the list.  */
 290   if (pass->static_pass_number)
 291     {
 292       struct tree_opt_pass *new;
 293
 294       new = xmalloc (sizeof (*new));
 295       memcpy (new, pass, sizeof (*new));
 296
 297       /* Indicate to register_dump_files that this pass has duplicates,
 298          and so it should rename the dump file.  The first instance will
 299          be -1, and be number of duplicates = -static_pass_number - 1.
 300          Subsequent instances will be > 0 and just the duplicate number.  */
 301       if (pass->name)
 302         {
 303           pass->static_pass_number -= 1;
 304           new->static_pass_number = -pass->static_pass_number;
 305         }
 306
 307       *list = new;
 308     }
 309   else
 310     {
 311       pass->static_pass_number = -1;
 312       *list = pass;
 313     }
 314
 315   return &(*list)->next;
 316
 317 }
 318
 319 /* Construct the pass tree.  */
 320
 321 void
 322 init_tree_optimization_passes (void)
 323 {
 324   struct tree_opt_pass **p;
 325
 326 #define NEXT_PASS(PASS)  (p = next_pass_1 (p, &PASS))
 327
 328   p = &all_passes;
 329   NEXT_PASS (pass_gimple);
 330   NEXT_PASS (pass_remove_useless_stmts);
 331   NEXT_PASS (pass_mudflap_1);
 332   NEXT_PASS (pass_lower_cf);
 333   NEXT_PASS (pass_lower_eh);
 334   NEXT_PASS (pass_build_cfg);
 335   NEXT_PASS (pass_pre_expand);
 336   NEXT_PASS (pass_tree_profile);
 337   NEXT_PASS (pass_init_datastructures);
 338   NEXT_PASS (pass_all_optimizations);
 339   NEXT_PASS (pass_warn_function_return);
 340   NEXT_PASS (pass_mudflap_2);
 341   NEXT_PASS (pass_free_datastructures);
 342   NEXT_PASS (pass_expand);
 343   NEXT_PASS (pass_rest_of_compilation);
 344   *p = NULL;
 345
 346   p = &pass_all_optimizations.sub;
 347   NEXT_PASS (pass_referenced_vars);
 348   NEXT_PASS (pass_build_ssa);
 349   NEXT_PASS (pass_may_alias);
 350   NEXT_PASS (pass_rename_ssa_copies);
 351   NEXT_PASS (pass_early_warn_uninitialized);
 352   NEXT_PASS (pass_dce);
 353   NEXT_PASS (pass_dominator);
 354   NEXT_PASS (pass_redundant_phi);
 355   NEXT_PASS (pass_dce);
 356   NEXT_PASS (pass_forwprop);
 357   NEXT_PASS (pass_phiopt);
 358   NEXT_PASS (pass_may_alias);
 359   NEXT_PASS (pass_tail_recursion);
 360   NEXT_PASS (pass_ch);
 361   NEXT_PASS (pass_profile);
 362   NEXT_PASS (pass_sra);
 363   NEXT_PASS (pass_rename_ssa_copies);
 364   NEXT_PASS (pass_dominator);
 365   NEXT_PASS (pass_redundant_phi);
 366   NEXT_PASS (pass_dce);
 367   NEXT_PASS (pass_dse);
 368   NEXT_PASS (pass_may_alias);
 369   NEXT_PASS (pass_forwprop);
 370   NEXT_PASS (pass_phiopt);
 371   NEXT_PASS (pass_ccp);
 372   NEXT_PASS (pass_redundant_phi);
 373   NEXT_PASS (pass_fold_builtins);
 374   NEXT_PASS (pass_split_crit_edges);
 375   NEXT_PASS (pass_pre);
 376   NEXT_PASS (pass_loop);
 377   NEXT_PASS (pass_dominator);
 378   NEXT_PASS (pass_redundant_phi);
 379   NEXT_PASS (pass_cd_dce);
 380   NEXT_PASS (pass_dse);
 381   NEXT_PASS (pass_forwprop);
 382   NEXT_PASS (pass_phiopt);
 383   NEXT_PASS (pass_tail_calls);
 384   NEXT_PASS (pass_late_warn_uninitialized);
 385   NEXT_PASS (pass_del_ssa);
 386   NEXT_PASS (pass_nrv);
 387   NEXT_PASS (pass_remove_useless_vars);
 388   NEXT_PASS (pass_cleanup_cfg_post_optimizing);
 389   *p = NULL;
 390
 391   p = &pass_loop.sub;
 392   NEXT_PASS (pass_loop_init);
 393   NEXT_PASS (pass_lim);
 394   NEXT_PASS (pass_unswitch);
 395   NEXT_PASS (pass_record_bounds);
 396   NEXT_PASS (pass_linear_transform);
 397   NEXT_PASS (pass_iv_canon);
 398   NEXT_PASS (pass_if_conversion);
 399   NEXT_PASS (pass_vectorize);
 400   NEXT_PASS (pass_complete_unroll);
 401   NEXT_PASS (pass_iv_optimize);
 402   NEXT_PASS (pass_loop_done);
 403   *p = NULL;
 404
 405 #undef NEXT_PASS
 406
 407   /* Register the passes with the tree dump code.  */
 408   register_dump_files (all_passes, 0);
 409 }
 410
 411 static void execute_pass_list (struct tree_opt_pass *);
 412
 413 static unsigned int last_verified;
 414
 415 static void
 416 execute_todo (int properties, unsigned int flags)
 417 {
 418   if (flags & TODO_rename_vars)
 419     {
 420       rewrite_into_ssa (false);
 421       bitmap_clear (vars_to_rename);
 422     }
 423   if (flags & TODO_fix_def_def_chains)
 424     {
 425       rewrite_def_def_chains ();
 426       bitmap_clear (vars_to_rename);
 427     }
 428
 429   if (flags & TODO_cleanup_cfg)
 430     cleanup_tree_cfg ();
 431
 432   if ((flags & TODO_dump_func) && dump_file)
 433     {
 434       if (properties & PROP_trees)
 435         dump_function_to_file (current_function_decl,
 436                                dump_file, dump_flags);
 437       else if (properties & PROP_cfg)
 438         print_rtl_with_bb (dump_file, get_insns ());
 439       else
 440         print_rtl (dump_file, get_insns ());
 441
 442       /* Flush the file.  If verification fails, we won't be able to
 443          close the file before aborting.  */
 444       fflush (dump_file);
 445     }
 446
 447   if (flags & TODO_ggc_collect)
 448     ggc_collect ();
 449
 450 #ifdef ENABLE_CHECKING
 451   if (flags & TODO_verify_ssa)
 452     verify_ssa ();
 453   if (flags & TODO_verify_flow)
 454     verify_flow_info ();
 455   if (flags & TODO_verify_stmts)
 456     verify_stmts ();
 457 #endif
 458 }
 459
 460 static bool
 461 execute_one_pass (struct tree_opt_pass *pass)
 462 {
 463   unsigned int todo;
 464
 465   /* See if we're supposed to run this pass.  */
 466   if (pass->gate && !pass->gate ())
 467     return false;
 468
 469   /* Note that the folders should only create gimple expressions.
 470      This is a hack until the new folder is ready.  */
 471   in_gimple_form = (pass->properties_provided & PROP_trees) != 0;
 472
 473   /* Run pre-pass verification.  */
 474   todo = pass->todo_flags_start & ~last_verified;
 475   if (todo)
 476     execute_todo (pass->properties_required, todo);
 477
 478   /* If a dump file name is present, open it if enabled.  */
 479   if (pass->static_pass_number != -1)
 480     {
 481       bool initializing_dump = !dump_initialized_p (pass->static_pass_number);
 482       dump_file_name = get_dump_file_name (pass->static_pass_number);
 483       dump_file = dump_begin (pass->static_pass_number, &dump_flags);
 484       if (dump_file)
 485         {
 486           const char *dname, *aname;
 487           dname = lang_hooks.decl_printable_name (current_function_decl, 2);
 488           aname = (IDENTIFIER_POINTER
 489                    (DECL_ASSEMBLER_NAME (current_function_decl)));
 490           fprintf (dump_file, "\n;; Function %s (%s)%s\n\n", dname, aname,
 491              cfun->function_frequency == FUNCTION_FREQUENCY_HOT
 492              ? " (hot)"
 493              : cfun->function_frequency == FUNCTION_FREQUENCY_UNLIKELY_EXECUTED
 494              ? " (unlikely executed)"
 495              : "");
 496         }
 497
 498       if (initializing_dump
 499           && graph_dump_format != no_graph
 500           && (pass->properties_provided & (PROP_cfg | PROP_rtl))
 501               == (PROP_cfg | PROP_rtl))
 502         clean_graph_dump_file (dump_file_name);
 503     }
 504
 505   /* If a timevar is present, start it.  */
 506   if (pass->tv_id)
 507     timevar_push (pass->tv_id);
 508
 509   /* Do it!  */
 510   if (pass->execute)
 511     pass->execute ();
 512
 513   /* Stop timevar.  */
 514   if (pass->tv_id)
 515     timevar_pop (pass->tv_id);
 516
 517   if (dump_file
 518       && (pass->properties_provided & (PROP_cfg | PROP_rtl))
 519           == (PROP_cfg | PROP_rtl))
 520     print_rtl_with_bb (dump_file, get_insns ());
 521
 522   /* Run post-pass cleanup and verification.  */
 523   todo = pass->todo_flags_finish;
 524   last_verified = todo & TODO_verify_all;
 525   if (todo)
 526     execute_todo (pass->properties_provided, todo);
 527
 528   /* Flush and close dump file.  */
 529   if (dump_file_name)
 530     {
 531       free ((char *) dump_file_name);
 532       dump_file_name = NULL;
 533     }
 534   if (dump_file)
 535     {
 536       dump_end (pass->static_pass_number, dump_file);
 537       dump_file = NULL;
 538     }
 539
 540   return true;
 541 }
 542
 543 static void
 544 execute_pass_list (struct tree_opt_pass *pass)
 545 {
 546   do
 547     {
 548       if (execute_one_pass (pass) && pass->sub)
 549         execute_pass_list (pass->sub);
 550       pass = pass->next;
 551     }
 552   while (pass);
 553 }
 554 \f
 555
 556 /* Update recursively all inlined_to pointers of functions
 557    inlined into NODE to INLINED_TO.  */
 558 static void
 559 update_inlined_to_pointers (struct cgraph_node *node,
 560                             struct cgraph_node *inlined_to)
 561 {
 562   struct cgraph_edge *e;
 563   for (e = node->callees; e; e = e->next_callee)
 564     {
 565       if (e->callee->global.inlined_to)
 566         {
 567           e->callee->global.inlined_to = inlined_to;
 568           update_inlined_to_pointers (e->callee, inlined_to);
 569         }
 570     }
 571 }
 572
 573 \f
 574 /* For functions-as-trees languages, this performs all optimization and
 575    compilation for FNDECL.  */
 576
 577 void
 578 tree_rest_of_compilation (tree fndecl)
 579 {
 580   location_t saved_loc;
 581   struct cgraph_node *saved_node = NULL, *node;
 582
 583   timevar_push (TV_EXPAND);
 584
 585   gcc_assert (!flag_unit_at_a_time || cgraph_global_info_ready);
 586
 587   /* Initialize the RTL code for the function.  */
 588   current_function_decl = fndecl;
 589   saved_loc = input_location;
 590   input_location = DECL_SOURCE_LOCATION (fndecl);
 591   init_function_start (fndecl);
 592
 593   /* Even though we're inside a function body, we still don't want to
 594      call expand_expr to calculate the size of a variable-sized array.
 595      We haven't necessarily assigned RTL to all variables yet, so it's
 596      not safe to try to expand expressions involving them.  */
 597   cfun->x_dont_save_pending_sizes_p = 1;
 598
 599   node = cgraph_node (fndecl);
 600
 601   /* We might need the body of this function so that we can expand
 602      it inline somewhere else.  This means not lowering some constructs
 603      such as exception handling.  */
 604   if (cgraph_preserve_function_body_p (fndecl))
 605     {
 606       if (!flag_unit_at_a_time)
 607         {
 608           struct cgraph_edge *e;
 609
 610           saved_node = cgraph_clone_node (node);
 611           for (e = saved_node->callees; e; e = e->next_callee)
 612             if (!e->inline_failed)
 613               cgraph_clone_inlined_nodes (e, true);
 614         }
 615       cfun->saved_static_chain_decl = cfun->static_chain_decl;
 616       cfun->saved_tree = save_body (fndecl, &cfun->saved_args,
 617                                     &cfun->saved_static_chain_decl);
 618     }
 619
 620   if (flag_inline_trees)
 621     {
 622       struct cgraph_edge *e;
 623       for (e = node->callees; e; e = e->next_callee)
 624         if (!e->inline_failed || warn_inline)
 625           break;
 626       if (e)
 627         {
 628           timevar_push (TV_INTEGRATION);
 629           optimize_inline_calls (fndecl);
 630           timevar_pop (TV_INTEGRATION);
 631         }
 632     }
 633
 634   /* We are not going to maintain the cgraph edges up to date.
 635      Kill it so it won't confuse us.  */
 636   while (node->callees)
 637     cgraph_remove_edge (node->callees);
 638
 639   if (!vars_to_rename)
 640     vars_to_rename = BITMAP_XMALLOC ();
 641
 642   /* Perform all tree transforms and optimizations.  */
 643   execute_pass_list (all_passes);
 644
 645   /* Restore original body if still needed.  */
 646   if (cfun->saved_tree)
 647     {
 648       DECL_SAVED_TREE (fndecl) = cfun->saved_tree;
 649       DECL_ARGUMENTS (fndecl) = cfun->saved_args;
 650       cfun->static_chain_decl = cfun->saved_static_chain_decl;
 651
 652       /* When not in unit-at-a-time mode, we must preserve out of line copy
 653          representing node before inlining.  Restore original outgoing edges
 654          using clone we created earlier.  */
 655       if (!flag_unit_at_a_time)
 656         {
 657           struct cgraph_edge *e;
 658
 659           while (node->callees)
 660             cgraph_remove_edge (node->callees);
 661           node->callees = saved_node->callees;
 662           saved_node->callees = NULL;
 663           update_inlined_to_pointers (node, node);
 664           for (e = node->callees; e; e = e->next_callee)
 665             e->caller = node;
 666           cgraph_remove_node (saved_node);
 667         }
 668     }
 669   else
 670     DECL_SAVED_TREE (fndecl) = NULL;
 671   cfun = 0;
 672
 673   /* If requested, warn about function definitions where the function will
 674      return a value (usually of some struct or union type) which itself will
 675      take up a lot of stack space.  */
 676   if (warn_larger_than && !DECL_EXTERNAL (fndecl) && TREE_TYPE (fndecl))
 677     {
 678       tree ret_type = TREE_TYPE (TREE_TYPE (fndecl));
 679
 680       if (ret_type && TYPE_SIZE_UNIT (ret_type)
 681           && TREE_CODE (TYPE_SIZE_UNIT (ret_type)) == INTEGER_CST
 682           && 0 < compare_tree_int (TYPE_SIZE_UNIT (ret_type),
 683                                    larger_than_size))
 684         {
 685           unsigned int size_as_int
 686             = TREE_INT_CST_LOW (TYPE_SIZE_UNIT (ret_type));
 687
 688           if (compare_tree_int (TYPE_SIZE_UNIT (ret_type), size_as_int) == 0)
 689             warning ("%Jsize of return value of %qD is %u bytes",
 690                      fndecl, fndecl, size_as_int);
 691           else
 692             warning ("%Jsize of return value of %qD is larger than %wd bytes",
 693                      fndecl, fndecl, larger_than_size);
 694         }
 695     }
 696
 697   if (!flag_inline_trees)
 698     {
 699       DECL_SAVED_TREE (fndecl) = NULL;
 700       if (DECL_STRUCT_FUNCTION (fndecl) == 0
 701           && !cgraph_node (fndecl)->origin)
 702         {
 703           /* Stop pointing to the local nodes about to be freed.
 704              But DECL_INITIAL must remain nonzero so we know this
 705              was an actual function definition.
 706              For a nested function, this is done in c_pop_function_context.
 707              If rest_of_compilation set this to 0, leave it 0.  */
 708           if (DECL_INITIAL (fndecl) != 0)
 709             DECL_INITIAL (fndecl) = error_mark_node;
 710         }
 711     }
 712
 713   input_location = saved_loc;
 714
 715   ggc_collect ();
 716   timevar_pop (TV_EXPAND);
 717 }