toplev.c revision 132734
1/* Top level of GCC compilers (cc1, cc1plus, etc.) 2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 3 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc. 4 5This file is part of GCC. 6 7GCC is free software; you can redistribute it and/or modify it under 8the terms of the GNU General Public License as published by the Free 9Software Foundation; either version 2, or (at your option) any later 10version. 11 12GCC is distributed in the hope that it will be useful, but WITHOUT ANY 13WARRANTY; without even the implied warranty of MERCHANTABILITY or 14FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 15for more details. 16 17You should have received a copy of the GNU General Public License 18along with GCC; see the file COPYING. If not, write to the Free 19Software Foundation, 59 Temple Place - Suite 330, Boston, MA 2002111-1307, USA. */ 21 22/* $FreeBSD: head/contrib/gcc/toplev.c 132734 2004-07-28 04:20:36Z kan $ */ 23 24/* This is the top level of cc1/c++. 25 It parses command args, opens files, invokes the various passes 26 in the proper order, and counts the time used by each. 27 Error messages and low-level interface to malloc also handled here. */ 28 29#include "config.h" 30#undef FLOAT /* This is for hpux. They should change hpux. */ 31#undef FFS /* Some systems define this in param.h. */ 32#include "system.h" 33#include "coretypes.h" 34#include "tm.h" 35#include <signal.h> 36 37#ifdef HAVE_SYS_RESOURCE_H 38# include <sys/resource.h> 39#endif 40 41#ifdef HAVE_SYS_TIMES_H 42# include <sys/times.h> 43#endif 44 45#include "input.h" 46#include "tree.h" 47#include "rtl.h" 48#include "tm_p.h" 49#include "flags.h" 50#include "insn-attr.h" 51#include "insn-config.h" 52#include "insn-flags.h" 53#include "hard-reg-set.h" 54#include "recog.h" 55#include "output.h" 56#include "except.h" 57#include "function.h" 58#include "toplev.h" 59#include "expr.h" 60#include "basic-block.h" 61#include "intl.h" 62#include "ggc.h" 63#include "graph.h" 64#include "loop.h" 65#include "regs.h" 66#include "timevar.h" 67#include "diagnostic.h" 68#include "params.h" 69#include "reload.h" 70#include "dwarf2asm.h" 71#include "integrate.h" 72#include "real.h" 73#include "debug.h" 74#include "target.h" 75#include "langhooks.h" 76#include "cfglayout.h" 77#include "cfgloop.h" 78#include "hosthooks.h" 79#include "cgraph.h" 80#include "opts.h" 81#include "coverage.h" 82#include "value-prof.h" 83#include "alloc-pool.h" 84 85#if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO) 86#include "dwarf2out.h" 87#endif 88 89#if defined(DBX_DEBUGGING_INFO) || defined(XCOFF_DEBUGGING_INFO) 90#include "dbxout.h" 91#endif 92 93#ifdef SDB_DEBUGGING_INFO 94#include "sdbout.h" 95#endif 96 97#ifdef XCOFF_DEBUGGING_INFO 98#include "xcoffout.h" /* Needed for external data 99 declarations for e.g. AIX 4.x. */ 100#endif 101 102#ifndef HAVE_conditional_execution 103#define HAVE_conditional_execution 0 104#endif 105 106/* Carry information from ASM_DECLARE_OBJECT_NAME 107 to ASM_FINISH_DECLARE_OBJECT. */ 108 109extern int size_directive_output; 110extern tree last_assemble_variable_decl; 111 112extern void reg_alloc (void); 113 114static void general_init (const char *); 115static void do_compile (void); 116static void process_options (void); 117static void backend_init (void); 118static int lang_dependent_init (const char *); 119static void init_asm_output (const char *); 120static void finalize (void); 121 122static void crash_signal (int) ATTRIBUTE_NORETURN; 123static void setup_core_dumping (void); 124static void compile_file (void); 125 126static int print_single_switch (FILE *, int, int, const char *, 127 const char *, const char *, 128 const char *, const char *); 129static void print_switch_values (FILE *, int, int, const char *, 130 const char *, const char *); 131 132/* Rest of compilation helper functions. */ 133static bool rest_of_handle_inlining (tree); 134static void rest_of_handle_cse (tree, rtx); 135static void rest_of_handle_cse2 (tree, rtx); 136static void rest_of_handle_gcse (tree, rtx); 137static void rest_of_handle_life (tree, rtx); 138static void rest_of_handle_loop_optimize (tree, rtx); 139static void rest_of_handle_loop2 (tree, rtx); 140static void rest_of_handle_jump_bypass (tree, rtx); 141static void rest_of_handle_sibling_calls (rtx); 142static void rest_of_handle_null_pointer (tree, rtx); 143static void rest_of_handle_addressof (tree, rtx); 144static void rest_of_handle_cfg (tree, rtx); 145static void rest_of_handle_branch_prob (tree, rtx); 146static void rest_of_handle_value_profile_transformations (tree, rtx); 147static void rest_of_handle_if_conversion (tree, rtx); 148static void rest_of_handle_if_after_combine (tree, rtx); 149static void rest_of_handle_tracer (tree, rtx); 150static void rest_of_handle_combine (tree, rtx); 151static void rest_of_handle_regmove (tree, rtx); 152#ifdef INSN_SCHEDULING 153static void rest_of_handle_sched (tree, rtx); 154static void rest_of_handle_sched2 (tree, rtx); 155#endif 156static bool rest_of_handle_new_regalloc (tree, rtx); 157static bool rest_of_handle_old_regalloc (tree, rtx); 158static void rest_of_handle_regrename (tree, rtx); 159static void rest_of_handle_reorder_blocks (tree, rtx); 160#ifdef STACK_REGS 161static void rest_of_handle_stack_regs (tree, rtx); 162#endif 163static void rest_of_handle_machine_reorg (tree, rtx); 164#ifdef DELAY_SLOTS 165static void rest_of_handle_delay_slots (tree, rtx); 166#endif 167static void rest_of_handle_final (tree, rtx); 168 169/* Nonzero to dump debug info whilst parsing (-dy option). */ 170static int set_yydebug; 171 172/* True if we don't need a backend (e.g. preprocessing only). */ 173static bool no_backend; 174 175/* Length of line when printing switch values. */ 176#define MAX_LINE 75 177 178/* Name of program invoked, sans directories. */ 179 180const char *progname; 181 182/* Copy of argument vector to toplev_main. */ 183static const char **save_argv; 184 185/* Name of top-level original source file (what was input to cpp). 186 This comes from the #-command at the beginning of the actual input. 187 If there isn't any there, then this is the cc1 input file name. */ 188 189const char *main_input_filename; 190 191/* Current position in real source file. */ 192 193location_t input_location; 194 195/* Nonzero if it is unsafe to create any new pseudo registers. */ 196int no_new_pseudos; 197 198/* Stack of currently pending input files. */ 199 200struct file_stack *input_file_stack; 201 202/* Incremented on each change to input_file_stack. */ 203int input_file_stack_tick; 204 205/* Name to use as base of names for dump output files. */ 206 207const char *dump_base_name; 208 209/* Name to use as a base for auxiliary output files. */ 210 211const char *aux_base_name; 212 213/* Format to use to print dumpfile index value */ 214#ifndef DUMPFILE_FORMAT 215#define DUMPFILE_FORMAT ".%02d." 216#endif 217 218/* Bit flags that specify the machine subtype we are compiling for. 219 Bits are tested using macros TARGET_... defined in the tm.h file 220 and set by `-m...' switches. Must be defined in rtlanal.c. */ 221 222extern int target_flags; 223 224/* A mask of target_flags that includes bit X if X was set or cleared 225 on the command line. */ 226 227int target_flags_explicit; 228 229/* Debug hooks - dependent upon command line options. */ 230 231const struct gcc_debug_hooks *debug_hooks; 232 233/* Describes a dump file. */ 234 235struct dump_file_info 236{ 237 /* The unique extension to apply, e.g. ".jump". */ 238 const char *const extension; 239 240 /* The -d<c> character that enables this dump file. */ 241 char const debug_switch; 242 243 /* True if there is a corresponding graph dump file. */ 244 char const graph_dump_p; 245 246 /* True if the user selected this dump. */ 247 char enabled; 248 249 /* True if the files have been initialized (ie truncated). */ 250 char initialized; 251}; 252 253/* Enumerate the extant dump files. */ 254 255enum dump_file_index 256{ 257 DFI_cgraph, 258 DFI_rtl, 259 DFI_sibling, 260 DFI_eh, 261 DFI_jump, 262 DFI_null, 263 DFI_cse, 264 DFI_addressof, 265 DFI_gcse, 266 DFI_loop, 267 DFI_bypass, 268 DFI_cfg, 269 DFI_bp, 270 DFI_vpt, 271 DFI_ce1, 272 DFI_tracer, 273 DFI_loop2, 274 DFI_web, 275 DFI_cse2, 276 DFI_life, 277 DFI_combine, 278 DFI_ce2, 279 DFI_regmove, 280 DFI_sched, 281 DFI_lreg, 282 DFI_greg, 283 DFI_postreload, 284 DFI_flow2, 285 DFI_peephole2, 286 DFI_ce3, 287 DFI_rnreg, 288 DFI_bbro, 289 DFI_branch_target_load, 290 DFI_sched2, 291 DFI_stack, 292 DFI_mach, 293 DFI_dbr, 294 DFI_MAX 295}; 296 297/* Describes all the dump files. Should be kept in order of the 298 pass and in sync with dump_file_index above. 299 300 Remaining -d letters: 301 302 " e m q " 303 " JK O Q WXY " 304*/ 305 306static struct dump_file_info dump_file[DFI_MAX] = 307{ 308 { "cgraph", 'U', 0, 0, 0 }, 309 { "rtl", 'r', 0, 0, 0 }, 310 { "sibling", 'i', 0, 0, 0 }, 311 { "eh", 'h', 0, 0, 0 }, 312 { "jump", 'j', 0, 0, 0 }, 313 { "null", 'u', 0, 0, 0 }, 314 { "cse", 's', 0, 0, 0 }, 315 { "addressof", 'F', 0, 0, 0 }, 316 { "gcse", 'G', 1, 0, 0 }, 317 { "loop", 'L', 1, 0, 0 }, 318 { "bypass", 'G', 1, 0, 0 }, /* Yes, duplicate enable switch. */ 319 { "cfg", 'f', 1, 0, 0 }, 320 { "bp", 'b', 1, 0, 0 }, 321 { "vpt", 'V', 1, 0, 0 }, 322 { "ce1", 'C', 1, 0, 0 }, 323 { "tracer", 'T', 1, 0, 0 }, 324 { "loop2", 'L', 1, 0, 0 }, 325 { "web", 'Z', 0, 0, 0 }, 326 { "cse2", 't', 1, 0, 0 }, 327 { "life", 'f', 1, 0, 0 }, /* Yes, duplicate enable switch. */ 328 { "combine", 'c', 1, 0, 0 }, 329 { "ce2", 'C', 1, 0, 0 }, 330 { "regmove", 'N', 1, 0, 0 }, 331 { "sched", 'S', 1, 0, 0 }, 332 { "lreg", 'l', 1, 0, 0 }, 333 { "greg", 'g', 1, 0, 0 }, 334 { "postreload", 'o', 1, 0, 0 }, 335 { "flow2", 'w', 1, 0, 0 }, 336 { "peephole2", 'z', 1, 0, 0 }, 337 { "ce3", 'E', 1, 0, 0 }, 338 { "rnreg", 'n', 1, 0, 0 }, 339 { "bbro", 'B', 1, 0, 0 }, 340 { "btl", 'd', 1, 0, 0 }, /* Yes, duplicate enable switch. */ 341 { "sched2", 'R', 1, 0, 0 }, 342 { "stack", 'k', 1, 0, 0 }, 343 { "mach", 'M', 1, 0, 0 }, 344 { "dbr", 'd', 0, 0, 0 }, 345}; 346 347static int open_dump_file (enum dump_file_index, tree); 348static void close_dump_file (enum dump_file_index, 349 void (*) (FILE *, rtx), rtx); 350 351/* Other flags saying which kinds of debugging dump have been requested. */ 352 353int rtl_dump_and_exit; 354int flag_print_asm_name; 355enum graph_dump_types graph_dump_format; 356 357/* Name for output file of assembly code, specified with -o. */ 358 359const char *asm_file_name; 360 361/* Nonzero means do optimizations. -O. 362 Particular numeric values stand for particular amounts of optimization; 363 thus, -O2 stores 2 here. However, the optimizations beyond the basic 364 ones are not controlled directly by this variable. Instead, they are 365 controlled by individual `flag_...' variables that are defaulted 366 based on this variable. */ 367 368int optimize = 0; 369 370/* Nonzero means optimize for size. -Os. 371 The only valid values are zero and nonzero. When optimize_size is 372 nonzero, optimize defaults to 2, but certain individual code 373 bloating optimizations are disabled. */ 374 375int optimize_size = 0; 376 377/* The FUNCTION_DECL for the function currently being compiled, 378 or 0 if between functions. */ 379tree current_function_decl; 380 381/* Set to the FUNC_BEGIN label of the current function, or NULL_TREE 382 if none. */ 383tree current_function_func_begin_label; 384 385/* Nonzero if doing dwarf2 duplicate elimination. */ 386 387int flag_eliminate_dwarf2_dups = 0; 388 389/* Nonzero if doing unused type elimination. */ 390 391int flag_eliminate_unused_debug_types = 1; 392 393/* Nonzero means emit debugging information only for symbols which are used. */ 394int flag_debug_only_used_symbols = 0; 395 396/* Nonzero if generating code to do profiling. */ 397 398int profile_flag = 0; 399 400/* Nonzero if generating code to profile program flow graph arcs. */ 401 402int profile_arc_flag = 0; 403 404/* Nonzero if value histograms should be measured. */ 405 406int flag_profile_values = 0; 407 408/* Nonzero if value histograms should be used to optimize code. */ 409int flag_value_profile_transformations = 0; 410 411/* Nonzero if generating info for gcov to calculate line test coverage. */ 412 413int flag_test_coverage = 0; 414 415/* Nonzero indicates that branch taken probabilities should be calculated. */ 416 417int flag_branch_probabilities = 0; 418 419/* Nonzero if basic blocks should be reordered. */ 420 421int flag_reorder_blocks = 0; 422 423/* Nonzero if functions should be reordered. */ 424 425int flag_reorder_functions = 0; 426 427/* Nonzero if registers should be renamed. */ 428 429int flag_rename_registers = 0; 430int flag_cprop_registers = 0; 431 432/* Nonzero for -pedantic switch: warn about anything 433 that standard spec forbids. */ 434 435int pedantic = 0; 436 437/* Temporarily suppress certain warnings. 438 This is set while reading code from a system header file. */ 439 440int in_system_header = 0; 441 442/* Don't print functions as they are compiled. -quiet. */ 443 444int quiet_flag = 0; 445 446/* Print times taken by the various passes. -ftime-report. */ 447 448int time_report = 0; 449 450/* Print memory still in use at end of compilation (which may have little 451 to do with peak memory consumption). -fmem-report. */ 452 453int mem_report = 0; 454 455/* Nonzero means to collect statistics which might be expensive 456 and to print them when we are done. */ 457int flag_detailed_statistics = 0; 458 459/* A random sequence of characters, unless overridden by user. */ 460const char *flag_random_seed; 461 462/* A local time stamp derived from the time of compilation. It will be 463 zero if the system cannot provide a time. It will be -1u, if the 464 user has specified a particular random seed. */ 465unsigned local_tick; 466 467/* -f flags. */ 468 469/* Nonzero means `char' should be signed. */ 470 471int flag_signed_char; 472 473/* Nonzero means give an enum type only as many bytes as it needs. */ 474 475int flag_short_enums; 476 477/* Nonzero for -fcaller-saves: allocate values in regs that need to 478 be saved across function calls, if that produces overall better code. 479 Optional now, so people can test it. */ 480 481int flag_caller_saves = 0; 482 483/* Nonzero if structures and unions should be returned in memory. 484 485 This should only be defined if compatibility with another compiler or 486 with an ABI is needed, because it results in slower code. */ 487 488#ifndef DEFAULT_PCC_STRUCT_RETURN 489#define DEFAULT_PCC_STRUCT_RETURN 1 490#endif 491 492/* Nonzero for -fpcc-struct-return: return values the same way PCC does. */ 493 494int flag_pcc_struct_return = DEFAULT_PCC_STRUCT_RETURN; 495 496/* Nonzero for -fforce-mem: load memory value into a register 497 before arithmetic on it. This makes better cse but slower compilation. */ 498 499int flag_force_mem = 0; 500 501/* Nonzero for -fforce-addr: load memory address into a register before 502 reference to memory. This makes better cse but slower compilation. */ 503 504int flag_force_addr = 0; 505 506/* Nonzero for -fdefer-pop: don't pop args after each function call; 507 instead save them up to pop many calls' args with one insns. */ 508 509int flag_defer_pop = 0; 510 511/* Nonzero for -ffloat-store: don't allocate floats and doubles 512 in extended-precision registers. */ 513 514int flag_float_store = 0; 515 516/* Nonzero for -fcse-follow-jumps: 517 have cse follow jumps to do a more extensive job. */ 518 519int flag_cse_follow_jumps; 520 521/* Nonzero for -fcse-skip-blocks: 522 have cse follow a branch around a block. */ 523int flag_cse_skip_blocks; 524 525/* Nonzero for -fexpensive-optimizations: 526 perform miscellaneous relatively-expensive optimizations. */ 527int flag_expensive_optimizations; 528 529/* Nonzero for -fthread-jumps: 530 have jump optimize output of loop. */ 531 532int flag_thread_jumps; 533 534/* Nonzero enables strength-reduction in loop.c. */ 535 536int flag_strength_reduce = 0; 537 538/* Nonzero enables loop unrolling in unroll.c. Only loops for which the 539 number of iterations can be calculated at compile-time (UNROLL_COMPLETELY, 540 UNROLL_MODULO) or at run-time (preconditioned to be UNROLL_MODULO) are 541 unrolled. */ 542 543int flag_old_unroll_loops; 544 545/* Nonzero enables loop unrolling in unroll.c. All loops are unrolled. 546 This is generally not a win. */ 547 548int flag_old_unroll_all_loops; 549 550/* Enables unrolling of simple loops in loop-unroll.c. */ 551int flag_unroll_loops; 552 553/* Enables unrolling of all loops in loop-unroll.c. */ 554int flag_unroll_all_loops; 555 556/* Nonzero enables loop peeling. */ 557int flag_peel_loops; 558 559/* Nonzero enables loop unswitching. */ 560int flag_unswitch_loops; 561 562/* Nonzero enables prefetch optimizations for arrays in loops. */ 563 564int flag_prefetch_loop_arrays; 565 566/* Nonzero forces all invariant computations in loops to be moved 567 outside the loop. */ 568 569int flag_move_all_movables = 0; 570 571/* Nonzero forces all general induction variables in loops to be 572 strength reduced. */ 573 574int flag_reduce_all_givs = 0; 575 576/* Nonzero to perform full register move optimization passes. This is the 577 default for -O2. */ 578 579int flag_regmove = 0; 580 581/* Nonzero for -fwritable-strings: 582 store string constants in data segment and don't uniquize them. */ 583 584int flag_writable_strings = 0; 585 586/* Nonzero means don't put addresses of constant functions in registers. 587 Used for compiling the Unix kernel, where strange substitutions are 588 done on the assembly output. */ 589 590int flag_no_function_cse = 0; 591 592/* Nonzero for -fomit-frame-pointer: 593 don't make a frame pointer in simple functions that don't require one. */ 594 595int flag_omit_frame_pointer = 0; 596 597/* Nonzero means place each function into its own section on those platforms 598 which support arbitrary section names and unlimited numbers of sections. */ 599 600int flag_function_sections = 0; 601 602/* ... and similar for data. */ 603 604int flag_data_sections = 0; 605 606/* Nonzero to inhibit use of define_optimization peephole opts. */ 607 608int flag_no_peephole = 0; 609 610/* Nonzero allows GCC to optimize sibling and tail recursive calls. */ 611 612int flag_optimize_sibling_calls = 0; 613 614/* Nonzero means the front end generally wants `errno' maintained by math 615 operations, like built-in SQRT. */ 616 617int flag_errno_math = 1; 618 619/* Nonzero means that unsafe floating-point math optimizations are allowed 620 for the sake of speed. IEEE compliance is not guaranteed, and operations 621 are allowed to assume that their arguments and results are "normal" 622 (e.g., nonnegative for SQRT). */ 623 624int flag_unsafe_math_optimizations = 0; 625 626/* Nonzero means that no NaNs or +-Infs are expected. */ 627 628int flag_finite_math_only = 0; 629 630/* Zero means that floating-point math operations cannot generate a 631 (user-visible) trap. This is the case, for example, in nonstop 632 IEEE 754 arithmetic. Trapping conditions include division by zero, 633 overflow, underflow, invalid and inexact, but does not include 634 operations on signaling NaNs (see below). */ 635 636int flag_trapping_math = 1; 637 638/* Nonzero means disable transformations that assume default floating 639 point rounding behavior. */ 640 641int flag_rounding_math = 0; 642 643/* Nonzero means disable transformations observable by signaling NaNs. 644 This option implies that any operation on an IEEE signaling NaN can 645 generate a (user-visible) trap. */ 646 647int flag_signaling_nans = 0; 648 649/* 0 means straightforward implementation of complex divide acceptable. 650 1 means wide ranges of inputs must work for complex divide. 651 2 means C99-like requirements for complex divide (not yet implemented). */ 652 653int flag_complex_divide_method = 0; 654 655/* Nonzero means just do syntax checking; don't output anything. */ 656 657int flag_syntax_only = 0; 658 659/* Nonzero means performs web construction pass. */ 660 661int flag_web; 662 663/* Nonzero means perform loop optimizer. */ 664 665int flag_loop_optimize; 666 667/* Nonzero means perform crossjumping. */ 668 669int flag_crossjumping; 670 671/* Nonzero means perform if conversion. */ 672 673int flag_if_conversion; 674 675/* Nonzero means perform if conversion after reload. */ 676 677int flag_if_conversion2; 678 679/* Nonzero means to use global dataflow analysis to eliminate 680 useless null pointer tests. */ 681 682int flag_delete_null_pointer_checks; 683 684/* Nonzero means perform global CSE. */ 685 686int flag_gcse = 0; 687 688/* Nonzero means to do the enhanced load motion during gcse, which trys 689 to hoist loads by not killing them when a store to the same location 690 is seen. */ 691 692int flag_gcse_lm = 1; 693 694/* Nonzero means to perform store motion after gcse, which will try to 695 move stores closer to the exit block. Its not very effective without 696 flag_gcse_lm. */ 697 698int flag_gcse_sm = 1; 699 700/* Nonzero if we want to perfrom redundant load after store elimination 701 in gcse. */ 702 703int flag_gcse_las = 1; 704 705/* Perform target register optimization before prologue / epilogue 706 threading. */ 707 708int flag_branch_target_load_optimize = 0; 709 710/* Perform target register optimization after prologue / epilogue 711 threading and jump2. */ 712 713int flag_branch_target_load_optimize2 = 0; 714 715/* Nonzero means to rerun cse after loop optimization. This increases 716 compilation time about 20% and picks up a few more common expressions. */ 717 718int flag_rerun_cse_after_loop; 719 720/* Nonzero means to run loop optimizations twice. */ 721 722int flag_rerun_loop_opt; 723 724/* Nonzero for -finline-functions: ok to inline functions that look like 725 good inline candidates. */ 726 727int flag_inline_functions; 728 729/* Nonzero for -fkeep-inline-functions: even if we make a function 730 go inline everywhere, keep its definition around for debugging 731 purposes. */ 732 733int flag_keep_inline_functions; 734 735/* Nonzero means that functions will not be inlined. */ 736 737int flag_no_inline = 2; 738 739/* Nonzero means that we don't want inlining by virtue of -fno-inline, 740 not just because the tree inliner turned us off. */ 741 742int flag_really_no_inline = 2; 743 744/* Nonzero means that we should emit static const variables 745 regardless of whether or not optimization is turned on. */ 746 747int flag_keep_static_consts = 1; 748 749/* Nonzero means we should be saving declaration info into a .X file. */ 750 751int flag_gen_aux_info = 0; 752 753/* Specified name of aux-info file. */ 754 755const char *aux_info_file_name; 756 757/* Nonzero means make the text shared if supported. */ 758 759int flag_shared_data; 760 761/* Nonzero means schedule into delayed branch slots if supported. */ 762 763int flag_delayed_branch; 764 765/* Nonzero if we are compiling pure (sharable) code. 766 Value is 1 if we are doing "small" pic; value is 2 if we're doing 767 "large" pic. */ 768 769int flag_pic; 770 771/* Nonzero if we are compiling position independent code for executable. 772 The value is 1 if we are doing "small" pic; value is 2 if we're doing 773 "large" pic. */ 774 775int flag_pie; 776 777/* Nonzero if we are compiling code for a shared library, zero for 778 executable. */ 779 780int flag_shlib; 781 782/* Set to the default thread-local storage (tls) model to use. */ 783 784enum tls_model flag_tls_default = TLS_MODEL_GLOBAL_DYNAMIC; 785 786/* Nonzero means generate extra code for exception handling and enable 787 exception handling. */ 788 789int flag_exceptions; 790 791/* Nonzero means generate frame unwind info table when supported. */ 792 793int flag_unwind_tables = 0; 794 795/* Nonzero means generate frame unwind info table exact at each insn 796 boundary. */ 797 798int flag_asynchronous_unwind_tables = 0; 799 800/* Nonzero means don't place uninitialized global data in common storage 801 by default. */ 802 803int flag_no_common; 804 805/* Nonzero means change certain warnings into errors. 806 Usually these are warnings about failure to conform to some standard. */ 807 808int flag_pedantic_errors = 0; 809 810/* flag_schedule_insns means schedule insns within basic blocks (before 811 local_alloc). 812 flag_schedule_insns_after_reload means schedule insns after 813 global_alloc. */ 814 815int flag_schedule_insns = 0; 816int flag_schedule_insns_after_reload = 0; 817 818/* When flag_schedule_insns_after_reload is set, use EBB scheduler. */ 819int flag_sched2_use_superblocks = 0; 820 821/* When flag_schedule_insns_after_reload is set, construct traces and EBB 822 scheduler. */ 823int flag_sched2_use_traces = 0; 824 825/* The following flags have effect only for scheduling before register 826 allocation: 827 828 flag_schedule_interblock means schedule insns across basic blocks. 829 flag_schedule_speculative means allow speculative motion of non-load insns. 830 flag_schedule_speculative_load means allow speculative motion of some 831 load insns. 832 flag_schedule_speculative_load_dangerous allows speculative motion of more 833 load insns. */ 834 835int flag_schedule_interblock = 1; 836int flag_schedule_speculative = 1; 837int flag_schedule_speculative_load = 0; 838int flag_schedule_speculative_load_dangerous = 0; 839 840/* The following flags have an effect during scheduling after register 841 allocation: 842 843 flag_sched_stalled_insns means that insns can be moved prematurely from the queue 844 of stalled insns into the ready list. 845 846 flag_sched_stalled_insns_dep controls how many insn groups will be examined 847 for a dependency on a stalled insn that is candidate for premature removal 848 from the queue of stalled insns into the ready list (has an effect only if 849 the flag 'sched_stalled_insns' is set). */ 850 851int flag_sched_stalled_insns = 0; 852int flag_sched_stalled_insns_dep = 1; 853 854int flag_single_precision_constant; 855 856/* flag_branch_on_count_reg means try to replace add-1,compare,branch tupple 857 by a cheaper branch on a count register. */ 858int flag_branch_on_count_reg = 1; 859 860/* -finhibit-size-directive inhibits output of .size for ELF. 861 This is used only for compiling crtstuff.c, 862 and it may be extended to other effects 863 needed for crtstuff.c on other systems. */ 864int flag_inhibit_size_directive = 0; 865 866/* -fverbose-asm causes extra commentary information to be produced in 867 the generated assembly code (to make it more readable). This option 868 is generally only of use to those who actually need to read the 869 generated assembly code (perhaps while debugging the compiler itself). 870 -fno-verbose-asm, the default, causes the extra information 871 to be omitted and is useful when comparing two assembler files. */ 872 873int flag_verbose_asm = 0; 874 875/* -dA causes debug commentary information to be produced in 876 the generated assembly code (to make it more readable). This option 877 is generally only of use to those who actually need to read the 878 generated assembly code (perhaps while debugging the compiler itself). 879 Currently, this switch is only used by dwarfout.c; however, it is intended 880 to be a catchall for printing debug information in the assembler file. */ 881 882int flag_debug_asm = 0; 883 884/* -dP causes the rtl to be emitted as a comment in assembly. */ 885 886int flag_dump_rtl_in_asm = 0; 887 888/* Nonzero means put zero initialized data in the bss section. */ 889int flag_zero_initialized_in_bss = 1; 890 891/* Tag all structures with __attribute__(packed). */ 892int flag_pack_struct = 0; 893 894/* Nonzero means that -Wformat accepts certain system-dependent formats. */ 895int flag_format_extensions = 0; 896 897/* Emit code to check for stack overflow; also may cause large objects 898 to be allocated dynamically. */ 899int flag_stack_check; 900 901/* When non-NULL, indicates that whenever space is allocated on the 902 stack, the resulting stack pointer must not pass this 903 address---that is, for stacks that grow downward, the stack pointer 904 must always be greater than or equal to this address; for stacks 905 that grow upward, the stack pointer must be less than this address. 906 At present, the rtx may be either a REG or a SYMBOL_REF, although 907 the support provided depends on the backend. */ 908rtx stack_limit_rtx; 909 910/* 0 if pointer arguments may alias each other. True in C. 911 1 if pointer arguments may not alias each other but may alias 912 global variables. 913 2 if pointer arguments may not alias each other and may not 914 alias global variables. True in Fortran. 915 This defaults to 0 for C. */ 916int flag_argument_noalias = 0; 917 918/* Nonzero if we should do (language-dependent) alias analysis. 919 Typically, this analysis will assume that expressions of certain 920 types do not alias expressions of certain other types. Only used 921 if alias analysis (in general) is enabled. */ 922int flag_strict_aliasing = 0; 923 924/* Instrument functions with calls at entry and exit, for profiling. */ 925int flag_instrument_function_entry_exit = 0; 926 927/* Nonzero means ignore `#ident' directives. 0 means handle them. 928 On SVR4 targets, it also controls whether or not to emit a 929 string identifying the compiler. */ 930 931int flag_no_ident = 0; 932 933/* This will perform a peephole pass before sched2. */ 934int flag_peephole2 = 0; 935 936/* This will try to guess branch probabilities. */ 937int flag_guess_branch_prob = 0; 938 939/* -fcheck-bounds causes gcc to generate array bounds checks. 940 For C, C++, ObjC: defaults to off. 941 For Java: defaults to on. 942 For Fortran: defaults to off. */ 943int flag_bounds_check = 0; 944 945/* This will attempt to merge constant section constants, if 1 only 946 string constants and constants from constant pool, if 2 also constant 947 variables. */ 948int flag_merge_constants = 1; 949 950/* If one, renumber instruction UIDs to reduce the number of 951 unused UIDs if there are a lot of instructions. If greater than 952 one, unconditionally renumber instruction UIDs. */ 953int flag_renumber_insns = 1; 954 955/* If nonzero, use the graph coloring register allocator. */ 956int flag_new_regalloc = 0; 957 958/* Nonzero if we perform superblock formation. */ 959 960int flag_tracer = 0; 961 962/* Nonzero if we perform whole unit at a time compilation. */ 963 964int flag_unit_at_a_time = 0; 965 966/* Values of the -falign-* flags: how much to align labels in code. 967 0 means `use default', 1 means `don't align'. 968 For each variable, there is an _log variant which is the power 969 of two not less than the variable, for .align output. */ 970 971int align_loops; 972int align_loops_log; 973int align_loops_max_skip; 974int align_jumps; 975int align_jumps_log; 976int align_jumps_max_skip; 977int align_labels; 978int align_labels_log; 979int align_labels_max_skip; 980int align_functions; 981int align_functions_log; 982 983/* Like align_functions_log above, but used by front-ends to force the 984 minimum function alignment. Zero means no alignment is forced. */ 985int force_align_functions_log; 986 987typedef struct 988{ 989 const char *const string; 990 int *const variable; 991 const int on_value; 992} 993lang_independent_options; 994 995/* Nonzero if signed arithmetic overflow should trap. */ 996int flag_trapv = 0; 997 998/* Nonzero if signed arithmetic overflow should wrap around. */ 999int flag_wrapv = 0; 1000 1001/* Nonzero if subexpressions must be evaluated from left-to-right. */ 1002int flag_evaluation_order = 0; 1003 1004/* Add or remove a leading underscore from user symbols. */ 1005int flag_leading_underscore = -1; 1006 1007/* The version of the C++ ABI in use. The following values are 1008 allowed: 1009 1010 0: The version of the ABI believed most conformant with the 1011 C++ ABI specification. This ABI may change as bugs are 1012 discovered and fixed. Therefore, 0 will not necessarily 1013 indicate the same ABI in different versions of G++. 1014 1015 1: The version of the ABI first used in G++ 3.2. 1016 1017 2: The version of the ABI first used in G++ 3.4. 1018 1019 Additional positive integers will be assigned as new versions of 1020 the ABI become the default version of the ABI. */ 1021 1022int flag_abi_version = 2; 1023 1024/* The user symbol prefix after having resolved same. */ 1025const char *user_label_prefix; 1026 1027static const param_info lang_independent_params[] = { 1028#define DEFPARAM(ENUM, OPTION, HELP, DEFAULT) \ 1029 { OPTION, DEFAULT, HELP }, 1030#include "params.def" 1031#undef DEFPARAM 1032 { NULL, 0, NULL } 1033}; 1034 1035/* Table of language-independent -f options. 1036 STRING is the option name. VARIABLE is the address of the variable. 1037 ON_VALUE is the value to store in VARIABLE 1038 if `-fSTRING' is seen as an option. 1039 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */ 1040 1041static const lang_independent_options f_options[] = 1042{ 1043 {"format-extensions", &flag_format_extensions, 1}, 1044 {"eliminate-dwarf2-dups", &flag_eliminate_dwarf2_dups, 1 }, 1045 {"eliminate-unused-debug-symbols", &flag_debug_only_used_symbols, 1 }, 1046 {"eliminate-unused-debug-types", &flag_eliminate_unused_debug_types, 1 }, 1047 {"float-store", &flag_float_store, 1 }, 1048 {"defer-pop", &flag_defer_pop, 1 }, 1049 {"omit-frame-pointer", &flag_omit_frame_pointer, 1 }, 1050 {"optimize-sibling-calls", &flag_optimize_sibling_calls, 1 }, 1051 {"tracer", &flag_tracer, 1 }, 1052 {"unit-at-a-time", &flag_unit_at_a_time, 1 }, 1053 {"cse-follow-jumps", &flag_cse_follow_jumps, 1 }, 1054 {"cse-skip-blocks", &flag_cse_skip_blocks, 1 }, 1055 {"expensive-optimizations", &flag_expensive_optimizations, 1 }, 1056 {"thread-jumps", &flag_thread_jumps, 1 }, 1057 {"strength-reduce", &flag_strength_reduce, 1 }, 1058 {"unroll-loops", &flag_unroll_loops, 1 }, 1059 {"unroll-all-loops", &flag_unroll_all_loops, 1 }, 1060 {"old-unroll-loops", &flag_old_unroll_loops, 1 }, 1061 {"old-unroll-all-loops", &flag_old_unroll_all_loops, 1 }, 1062 {"peel-loops", &flag_peel_loops, 1 }, 1063 {"unswitch-loops", &flag_unswitch_loops, 1 }, 1064 {"prefetch-loop-arrays", &flag_prefetch_loop_arrays, 1 }, 1065 {"move-all-movables", &flag_move_all_movables, 1 }, 1066 {"reduce-all-givs", &flag_reduce_all_givs, 1 }, 1067 {"writable-strings", &flag_writable_strings, 1 }, 1068 {"peephole", &flag_no_peephole, 0 }, 1069 {"force-mem", &flag_force_mem, 1 }, 1070 {"force-addr", &flag_force_addr, 1 }, 1071 {"function-cse", &flag_no_function_cse, 0 }, 1072 {"inline-functions", &flag_inline_functions, 1 }, 1073 {"keep-inline-functions", &flag_keep_inline_functions, 1 }, 1074 {"inline", &flag_no_inline, 0 }, 1075 {"keep-static-consts", &flag_keep_static_consts, 1 }, 1076 {"syntax-only", &flag_syntax_only, 1 }, 1077 {"shared-data", &flag_shared_data, 1 }, 1078 {"caller-saves", &flag_caller_saves, 1 }, 1079 {"pcc-struct-return", &flag_pcc_struct_return, 1 }, 1080 {"reg-struct-return", &flag_pcc_struct_return, 0 }, 1081 {"delayed-branch", &flag_delayed_branch, 1 }, 1082 {"web", &flag_web, 1}, 1083 {"gcse", &flag_gcse, 1 }, 1084 {"gcse-lm", &flag_gcse_lm, 1 }, 1085 {"gcse-sm", &flag_gcse_sm, 1 }, 1086 {"gcse-las", &flag_gcse_las, 1 }, 1087 {"branch-target-load-optimize", &flag_branch_target_load_optimize, 1 }, 1088 {"branch-target-load-optimize2", &flag_branch_target_load_optimize2, 1 }, 1089 {"loop-optimize", &flag_loop_optimize, 1 }, 1090 {"crossjumping", &flag_crossjumping, 1 }, 1091 {"if-conversion", &flag_if_conversion, 1 }, 1092 {"if-conversion2", &flag_if_conversion2, 1 }, 1093 {"rerun-cse-after-loop", &flag_rerun_cse_after_loop, 1 }, 1094 {"rerun-loop-opt", &flag_rerun_loop_opt, 1 }, 1095 {"delete-null-pointer-checks", &flag_delete_null_pointer_checks, 1 }, 1096 {"schedule-insns", &flag_schedule_insns, 1 }, 1097 {"schedule-insns2", &flag_schedule_insns_after_reload, 1 }, 1098 {"sched-interblock",&flag_schedule_interblock, 1 }, 1099 {"sched-spec",&flag_schedule_speculative, 1 }, 1100 {"sched-spec-load",&flag_schedule_speculative_load, 1 }, 1101 {"sched-spec-load-dangerous",&flag_schedule_speculative_load_dangerous, 1 }, 1102 {"sched-stalled-insns", &flag_sched_stalled_insns, 0 }, 1103 {"sched-stalled-insns-dep", &flag_sched_stalled_insns_dep, 1 }, 1104 {"sched2-use-superblocks", &flag_sched2_use_superblocks, 1 }, 1105 {"sched2-use-traces", &flag_sched2_use_traces, 1 }, 1106 {"branch-count-reg",&flag_branch_on_count_reg, 1 }, 1107 {"pic", &flag_pic, 1 }, 1108 {"PIC", &flag_pic, 2 }, 1109 {"pie", &flag_pie, 1 }, 1110 {"PIE", &flag_pie, 2 }, 1111 {"exceptions", &flag_exceptions, 1 }, 1112 {"unwind-tables", &flag_unwind_tables, 1 }, 1113 {"asynchronous-unwind-tables", &flag_asynchronous_unwind_tables, 1 }, 1114 {"non-call-exceptions", &flag_non_call_exceptions, 1 }, 1115 {"profile-arcs", &profile_arc_flag, 1 }, 1116 {"profile-values", &flag_profile_values, 1 }, 1117 {"vpt", &flag_value_profile_transformations, 1 }, 1118 {"test-coverage", &flag_test_coverage, 1 }, 1119 {"branch-probabilities", &flag_branch_probabilities, 1 }, 1120 {"profile", &profile_flag, 1 }, 1121 {"reorder-blocks", &flag_reorder_blocks, 1 }, 1122 {"reorder-functions", &flag_reorder_functions, 1 }, 1123 {"rename-registers", &flag_rename_registers, 1 }, 1124 {"cprop-registers", &flag_cprop_registers, 1 }, 1125 {"common", &flag_no_common, 0 }, 1126 {"inhibit-size-directive", &flag_inhibit_size_directive, 1 }, 1127 {"function-sections", &flag_function_sections, 1 }, 1128 {"data-sections", &flag_data_sections, 1 }, 1129 {"verbose-asm", &flag_verbose_asm, 1 }, 1130 {"regmove", &flag_regmove, 1 }, 1131 {"optimize-register-move", &flag_regmove, 1 }, 1132 {"pack-struct", &flag_pack_struct, 1 }, 1133 {"stack-check", &flag_stack_check, 1 }, 1134 {"argument-alias", &flag_argument_noalias, 0 }, 1135 {"argument-noalias", &flag_argument_noalias, 1 }, 1136 {"argument-noalias-global", &flag_argument_noalias, 2 }, 1137 {"strict-aliasing", &flag_strict_aliasing, 1 }, 1138 {"align-loops", &align_loops, 0 }, 1139 {"align-jumps", &align_jumps, 0 }, 1140 {"align-labels", &align_labels, 0 }, 1141 {"align-functions", &align_functions, 0 }, 1142 {"merge-constants", &flag_merge_constants, 1 }, 1143 {"merge-all-constants", &flag_merge_constants, 2 }, 1144 {"dump-unnumbered", &flag_dump_unnumbered, 1 }, 1145 {"instrument-functions", &flag_instrument_function_entry_exit, 1 }, 1146 {"zero-initialized-in-bss", &flag_zero_initialized_in_bss, 1 }, 1147 {"leading-underscore", &flag_leading_underscore, 1 }, 1148 {"ident", &flag_no_ident, 0 }, 1149 { "peephole2", &flag_peephole2, 1 }, 1150 {"finite-math-only", &flag_finite_math_only, 1 }, 1151 { "guess-branch-probability", &flag_guess_branch_prob, 1 }, 1152 {"math-errno", &flag_errno_math, 1 }, 1153 {"trapping-math", &flag_trapping_math, 1 }, 1154 {"rounding-math", &flag_rounding_math, 1 }, 1155 {"unsafe-math-optimizations", &flag_unsafe_math_optimizations, 1 }, 1156 {"signaling-nans", &flag_signaling_nans, 1 }, 1157 {"bounds-check", &flag_bounds_check, 1 }, 1158 {"single-precision-constant", &flag_single_precision_constant, 1 }, 1159 {"time-report", &time_report, 1 }, 1160 {"mem-report", &mem_report, 1 }, 1161 { "trapv", &flag_trapv, 1 }, 1162 { "wrapv", &flag_wrapv, 1 }, 1163 { "new-ra", &flag_new_regalloc, 1 } 1164}; 1165 1166/* Here is a table, controlled by the tm.h file, listing each -m switch 1167 and which bits in `target_switches' it should set or clear. 1168 If VALUE is positive, it is bits to set. 1169 If VALUE is negative, -VALUE is bits to clear. 1170 (The sign bit is not used so there is no confusion.) */ 1171 1172static const struct 1173{ 1174 const char *const name; 1175 const int value; 1176 const char *const description; 1177} 1178target_switches[] = TARGET_SWITCHES; 1179 1180/* This table is similar, but allows the switch to have a value. */ 1181 1182#ifdef TARGET_OPTIONS 1183static const struct 1184{ 1185 const char *const prefix; 1186 const char **const variable; 1187 const char *const description; 1188 const char *const value; 1189} 1190target_options[] = TARGET_OPTIONS; 1191#endif 1192 1193/* Nonzero means warn about function definitions that default the return type 1194 or that use a null return and have a return-type other than void. */ 1195 1196int warn_return_type; 1197 1198/* Output files for assembler code (real compiler output) 1199 and debugging dumps. */ 1200 1201FILE *asm_out_file; 1202FILE *aux_info_file; 1203FILE *rtl_dump_file = NULL; 1204FILE *cgraph_dump_file = NULL; 1205 1206/* The current working directory of a translation. It's generally the 1207 directory from which compilation was initiated, but a preprocessed 1208 file may specify the original directory in which it was 1209 created. */ 1210 1211static const char *src_pwd; 1212 1213/* Initialize src_pwd with the given string, and return true. If it 1214 was already initialized, return false. As a special case, it may 1215 be called with a NULL argument to test whether src_pwd has NOT been 1216 initialized yet. */ 1217 1218bool 1219set_src_pwd (const char *pwd) 1220{ 1221 if (src_pwd) 1222 return false; 1223 1224 src_pwd = xstrdup (pwd); 1225 return true; 1226} 1227 1228/* Return the directory from which the translation unit was initiated, 1229 in case set_src_pwd() was not called before to assign it a 1230 different value. */ 1231 1232const char * 1233get_src_pwd (void) 1234{ 1235 if (! src_pwd) 1236 src_pwd = getpwd (); 1237 1238 return src_pwd; 1239} 1240 1241/* Called when the start of a function definition is parsed, 1242 this function prints on stderr the name of the function. */ 1243void 1244announce_function (tree decl) 1245{ 1246 if (!quiet_flag) 1247 { 1248 if (rtl_dump_and_exit) 1249 verbatim ("%s ", IDENTIFIER_POINTER (DECL_NAME (decl))); 1250 else 1251 verbatim (" %s", (*lang_hooks.decl_printable_name) (decl, 2)); 1252 fflush (stderr); 1253 pp_needs_newline (global_dc->printer) = true; 1254 diagnostic_set_last_function (global_dc); 1255 } 1256} 1257 1258/* Set up a default flag_random_seed and local_tick, unless the user 1259 already specified one. */ 1260 1261static void 1262randomize (void) 1263{ 1264 if (!flag_random_seed) 1265 { 1266 unsigned HOST_WIDE_INT value; 1267 static char random_seed[HOST_BITS_PER_WIDE_INT / 4 + 3]; 1268 1269 /* Get some more or less random data. */ 1270#ifdef HAVE_GETTIMEOFDAY 1271 { 1272 struct timeval tv; 1273 1274 gettimeofday (&tv, NULL); 1275 local_tick = tv.tv_sec * 1000 + tv.tv_usec / 1000; 1276 } 1277#else 1278 { 1279 time_t now = time (NULL); 1280 1281 if (now != (time_t)-1) 1282 local_tick = (unsigned) now; 1283 } 1284#endif 1285 value = local_tick ^ getpid (); 1286 1287 sprintf (random_seed, HOST_WIDE_INT_PRINT_HEX, value); 1288 flag_random_seed = random_seed; 1289 } 1290 else if (!local_tick) 1291 local_tick = -1; 1292} 1293 1294 1295/* Decode the string P as an integral parameter. 1296 If the string is indeed an integer return its numeric value else 1297 issue an Invalid Option error for the option PNAME and return DEFVAL. 1298 If PNAME is zero just return DEFVAL, do not call error. */ 1299 1300int 1301read_integral_parameter (const char *p, const char *pname, const int defval) 1302{ 1303 const char *endp = p; 1304 1305 while (*endp) 1306 { 1307 if (ISDIGIT (*endp)) 1308 endp++; 1309 else 1310 break; 1311 } 1312 1313 if (*endp != 0) 1314 { 1315 if (pname != 0) 1316 error ("invalid option argument `%s'", pname); 1317 return defval; 1318 } 1319 1320 return atoi (p); 1321} 1322 1323/* Return the logarithm of X, base 2, considering X unsigned, 1324 if X is a power of 2. Otherwise, returns -1. 1325 1326 This should be used via the `exact_log2' macro. */ 1327 1328int 1329exact_log2_wide (unsigned HOST_WIDE_INT x) 1330{ 1331 int log = 0; 1332 /* Test for 0 or a power of 2. */ 1333 if (x == 0 || x != (x & -x)) 1334 return -1; 1335 while ((x >>= 1) != 0) 1336 log++; 1337 return log; 1338} 1339 1340/* Given X, an unsigned number, return the largest int Y such that 2**Y <= X. 1341 If X is 0, return -1. 1342 1343 This should be used via the floor_log2 macro. */ 1344 1345int 1346floor_log2_wide (unsigned HOST_WIDE_INT x) 1347{ 1348 int log = -1; 1349 while (x != 0) 1350 log++, 1351 x >>= 1; 1352 return log; 1353} 1354 1355/* Handler for fatal signals, such as SIGSEGV. These are transformed 1356 into ICE messages, which is much more user friendly. In case the 1357 error printer crashes, reset the signal to prevent infinite recursion. */ 1358 1359static void 1360crash_signal (int signo) 1361{ 1362 signal (signo, SIG_DFL); 1363 internal_error ("%s", strsignal (signo)); 1364} 1365 1366/* Arrange to dump core on error. (The regular error message is still 1367 printed first, except in the case of abort().) */ 1368 1369static void 1370setup_core_dumping (void) 1371{ 1372#ifdef SIGABRT 1373 signal (SIGABRT, SIG_DFL); 1374#endif 1375#if defined(HAVE_SETRLIMIT) 1376 { 1377 struct rlimit rlim; 1378 if (getrlimit (RLIMIT_CORE, &rlim) != 0) 1379 fatal_error ("getting core file size maximum limit: %m"); 1380 rlim.rlim_cur = rlim.rlim_max; 1381 if (setrlimit (RLIMIT_CORE, &rlim) != 0) 1382 fatal_error ("setting core file size limit to maximum: %m"); 1383 } 1384#endif 1385 diagnostic_abort_on_error (global_dc); 1386} 1387 1388 1389/* Strip off a legitimate source ending from the input string NAME of 1390 length LEN. Rather than having to know the names used by all of 1391 our front ends, we strip off an ending of a period followed by 1392 up to five characters. (Java uses ".class".) */ 1393 1394void 1395strip_off_ending (char *name, int len) 1396{ 1397 int i; 1398 for (i = 2; i < 6 && len > i; i++) 1399 { 1400 if (name[len - i] == '.') 1401 { 1402 name[len - i] = '\0'; 1403 break; 1404 } 1405 } 1406} 1407 1408/* Output a quoted string. */ 1409 1410void 1411output_quoted_string (FILE *asm_file, const char *string) 1412{ 1413#ifdef OUTPUT_QUOTED_STRING 1414 OUTPUT_QUOTED_STRING (asm_file, string); 1415#else 1416 char c; 1417 1418 putc ('\"', asm_file); 1419 while ((c = *string++) != 0) 1420 { 1421 if (ISPRINT (c)) 1422 { 1423 if (c == '\"' || c == '\\') 1424 putc ('\\', asm_file); 1425 putc (c, asm_file); 1426 } 1427 else 1428 fprintf (asm_file, "\\%03o", (unsigned char) c); 1429 } 1430 putc ('\"', asm_file); 1431#endif 1432} 1433 1434/* Output a file name in the form wanted by System V. */ 1435 1436void 1437output_file_directive (FILE *asm_file, const char *input_name) 1438{ 1439 int len; 1440 const char *na; 1441 1442 if (input_name == NULL) 1443 input_name = "<stdin>"; 1444 1445 len = strlen (input_name); 1446 na = input_name + len; 1447 1448 /* NA gets INPUT_NAME sans directory names. */ 1449 while (na > input_name) 1450 { 1451 if (IS_DIR_SEPARATOR (na[-1])) 1452 break; 1453 na--; 1454 } 1455 1456#ifdef ASM_OUTPUT_SOURCE_FILENAME 1457 ASM_OUTPUT_SOURCE_FILENAME (asm_file, na); 1458#else 1459 fprintf (asm_file, "\t.file\t"); 1460 output_quoted_string (asm_file, na); 1461 fputc ('\n', asm_file); 1462#endif 1463} 1464 1465/* Routine to open a dump file. Return true if the dump file is enabled. */ 1466 1467static int 1468open_dump_file (enum dump_file_index index, tree decl) 1469{ 1470 char *dump_name; 1471 const char *open_arg; 1472 char seq[16]; 1473 1474 if (! dump_file[index].enabled) 1475 return 0; 1476 1477 timevar_push (TV_DUMP); 1478 if (rtl_dump_file != NULL) 1479 fclose (rtl_dump_file); 1480 1481 sprintf (seq, DUMPFILE_FORMAT, index); 1482 1483 if (! dump_file[index].initialized) 1484 { 1485 /* If we've not initialized the files, do so now. */ 1486 if (graph_dump_format != no_graph 1487 && dump_file[index].graph_dump_p) 1488 { 1489 dump_name = concat (seq, dump_file[index].extension, NULL); 1490 clean_graph_dump_file (dump_base_name, dump_name); 1491 free (dump_name); 1492 } 1493 dump_file[index].initialized = 1; 1494 open_arg = "w"; 1495 } 1496 else 1497 open_arg = "a"; 1498 1499 dump_name = concat (dump_base_name, seq, 1500 dump_file[index].extension, NULL); 1501 1502 rtl_dump_file = fopen (dump_name, open_arg); 1503 if (rtl_dump_file == NULL) 1504 fatal_error ("can't open %s: %m", dump_name); 1505 1506 free (dump_name); 1507 1508 if (decl) 1509 fprintf (rtl_dump_file, "\n;; Function %s%s\n\n", 1510 (*lang_hooks.decl_printable_name) (decl, 2), 1511 cfun->function_frequency == FUNCTION_FREQUENCY_HOT 1512 ? " (hot)" 1513 : cfun->function_frequency == FUNCTION_FREQUENCY_UNLIKELY_EXECUTED 1514 ? " (unlikely executed)" 1515 : ""); 1516 1517 timevar_pop (TV_DUMP); 1518 return 1; 1519} 1520 1521/* Routine to close a dump file. */ 1522 1523static void 1524close_dump_file (enum dump_file_index index, 1525 void (*func) (FILE *, rtx), 1526 rtx insns) 1527{ 1528 if (! rtl_dump_file) 1529 return; 1530 1531 timevar_push (TV_DUMP); 1532 if (insns 1533 && graph_dump_format != no_graph 1534 && dump_file[index].graph_dump_p) 1535 { 1536 char seq[16]; 1537 char *suffix; 1538 1539 sprintf (seq, DUMPFILE_FORMAT, index); 1540 suffix = concat (seq, dump_file[index].extension, NULL); 1541 print_rtl_graph_with_bb (dump_base_name, suffix, insns); 1542 free (suffix); 1543 } 1544 1545 if (func && insns) 1546 func (rtl_dump_file, insns); 1547 1548 fflush (rtl_dump_file); 1549 fclose (rtl_dump_file); 1550 1551 rtl_dump_file = NULL; 1552 timevar_pop (TV_DUMP); 1553} 1554 1555/* Do any final processing required for the declarations in VEC, of 1556 which there are LEN. We write out inline functions and variables 1557 that have been deferred until this point, but which are required. 1558 Returns nonzero if anything was put out. */ 1559 1560int 1561wrapup_global_declarations (tree *vec, int len) 1562{ 1563 tree decl; 1564 int i; 1565 int reconsider; 1566 int output_something = 0; 1567 1568 for (i = 0; i < len; i++) 1569 { 1570 decl = vec[i]; 1571 1572 /* We're not deferring this any longer. Assignment is 1573 conditional to avoid needlessly dirtying PCH pages. */ 1574 if (DECL_DEFER_OUTPUT (decl) != 0) 1575 DECL_DEFER_OUTPUT (decl) = 0; 1576 1577 if (TREE_CODE (decl) == VAR_DECL && DECL_SIZE (decl) == 0) 1578 (*lang_hooks.finish_incomplete_decl) (decl); 1579 } 1580 1581 /* Now emit any global variables or functions that we have been 1582 putting off. We need to loop in case one of the things emitted 1583 here references another one which comes earlier in the list. */ 1584 do 1585 { 1586 reconsider = 0; 1587 for (i = 0; i < len; i++) 1588 { 1589 decl = vec[i]; 1590 1591 if (TREE_ASM_WRITTEN (decl) || DECL_EXTERNAL (decl)) 1592 continue; 1593 1594 /* Don't write out static consts, unless we still need them. 1595 1596 We also keep static consts if not optimizing (for debugging), 1597 unless the user specified -fno-keep-static-consts. 1598 ??? They might be better written into the debug information. 1599 This is possible when using DWARF. 1600 1601 A language processor that wants static constants to be always 1602 written out (even if it is not used) is responsible for 1603 calling rest_of_decl_compilation itself. E.g. the C front-end 1604 calls rest_of_decl_compilation from finish_decl. 1605 One motivation for this is that is conventional in some 1606 environments to write things like: 1607 static const char rcsid[] = "... version string ..."; 1608 intending to force the string to be in the executable. 1609 1610 A language processor that would prefer to have unneeded 1611 static constants "optimized away" would just defer writing 1612 them out until here. E.g. C++ does this, because static 1613 constants are often defined in header files. 1614 1615 ??? A tempting alternative (for both C and C++) would be 1616 to force a constant to be written if and only if it is 1617 defined in a main file, as opposed to an include file. */ 1618 1619 if (TREE_CODE (decl) == VAR_DECL && TREE_STATIC (decl)) 1620 { 1621 bool needed = 1; 1622 1623 if (flag_unit_at_a_time 1624 && cgraph_varpool_node (decl)->finalized) 1625 needed = 0; 1626 else if ((flag_unit_at_a_time && !cgraph_global_info_ready) 1627 && (TREE_USED (decl) 1628 || TREE_USED (DECL_ASSEMBLER_NAME (decl)))) 1629 /* needed */; 1630 else if (TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))) 1631 /* needed */; 1632 else if (DECL_COMDAT (decl)) 1633 needed = 0; 1634 else if (TREE_READONLY (decl) && !TREE_PUBLIC (decl) 1635 && (optimize || !flag_keep_static_consts 1636 || DECL_ARTIFICIAL (decl))) 1637 needed = 0; 1638 1639 if (needed) 1640 { 1641 reconsider = 1; 1642 rest_of_decl_compilation (decl, NULL, 1, 1); 1643 } 1644 } 1645 1646 if (TREE_CODE (decl) == FUNCTION_DECL 1647 && DECL_INITIAL (decl) != 0 1648 && DECL_SAVED_INSNS (decl) != 0 1649 && DECL_SAVED_INSNS (decl)->saved_for_inline 1650 && (flag_keep_inline_functions 1651 || (TREE_PUBLIC (decl) && !DECL_COMDAT (decl)) 1652 || TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl)))) 1653 { 1654 reconsider = 1; 1655 output_inline_function (decl); 1656 } 1657 } 1658 1659 if (reconsider) 1660 output_something = 1; 1661 } 1662 while (reconsider); 1663 1664 return output_something; 1665} 1666 1667/* Issue appropriate warnings for the global declarations in VEC (of 1668 which there are LEN). Output debugging information for them. */ 1669 1670void 1671check_global_declarations (tree *vec, int len) 1672{ 1673 tree decl; 1674 int i; 1675 1676 for (i = 0; i < len; i++) 1677 { 1678 decl = vec[i]; 1679 1680 if (TREE_CODE (decl) == VAR_DECL && TREE_STATIC (decl) 1681 && ! TREE_ASM_WRITTEN (decl)) 1682 /* Cancel the RTL for this decl so that, if debugging info 1683 output for global variables is still to come, 1684 this one will be omitted. */ 1685 SET_DECL_RTL (decl, NULL_RTX); 1686 1687 /* Warn about any function 1688 declared static but not defined. 1689 We don't warn about variables, 1690 because many programs have static variables 1691 that exist only to get some text into the object file. */ 1692 if (TREE_CODE (decl) == FUNCTION_DECL 1693 && (warn_unused_function 1694 || TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))) 1695 && DECL_INITIAL (decl) == 0 1696 && DECL_EXTERNAL (decl) 1697 && ! DECL_ARTIFICIAL (decl) 1698 && ! TREE_PUBLIC (decl)) 1699 { 1700 if (TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))) 1701 pedwarn ("%J'%F' used but never defined", decl, decl); 1702 else 1703 warning ("%J'%F' declared `static' but never defined", decl, decl); 1704 /* This symbol is effectively an "extern" declaration now. */ 1705 TREE_PUBLIC (decl) = 1; 1706 assemble_external (decl); 1707 } 1708 1709 /* Warn about static fns or vars defined but not used. */ 1710 if (((warn_unused_function && TREE_CODE (decl) == FUNCTION_DECL) 1711 /* We don't warn about "static const" variables because the 1712 "rcs_id" idiom uses that construction. */ 1713 || (warn_unused_variable 1714 && TREE_CODE (decl) == VAR_DECL && ! TREE_READONLY (decl))) 1715 && ! DECL_IN_SYSTEM_HEADER (decl) 1716 && ! TREE_USED (decl) 1717 /* The TREE_USED bit for file-scope decls is kept in the identifier, 1718 to handle multiple external decls in different scopes. */ 1719 && ! TREE_USED (DECL_NAME (decl)) 1720 && ! DECL_EXTERNAL (decl) 1721 && ! TREE_PUBLIC (decl) 1722 /* A volatile variable might be used in some non-obvious way. */ 1723 && ! TREE_THIS_VOLATILE (decl) 1724 /* Global register variables must be declared to reserve them. */ 1725 && ! (TREE_CODE (decl) == VAR_DECL && DECL_REGISTER (decl)) 1726 /* Otherwise, ask the language. */ 1727 && (*lang_hooks.decls.warn_unused_global) (decl)) 1728 warning ("%J'%D' defined but not used", decl, decl); 1729 1730 /* Avoid confusing the debug information machinery when there are 1731 errors. */ 1732 if (errorcount == 0 && sorrycount == 0) 1733 { 1734 timevar_push (TV_SYMOUT); 1735 (*debug_hooks->global_decl) (decl); 1736 timevar_pop (TV_SYMOUT); 1737 } 1738 } 1739} 1740 1741/* Warn about a use of an identifier which was marked deprecated. */ 1742void 1743warn_deprecated_use (tree node) 1744{ 1745 if (node == 0 || !warn_deprecated_decl) 1746 return; 1747 1748 if (DECL_P (node)) 1749 warning ("`%s' is deprecated (declared at %s:%d)", 1750 IDENTIFIER_POINTER (DECL_NAME (node)), 1751 DECL_SOURCE_FILE (node), DECL_SOURCE_LINE (node)); 1752 else if (TYPE_P (node)) 1753 { 1754 const char *what = NULL; 1755 tree decl = TYPE_STUB_DECL (node); 1756 1757 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE) 1758 what = IDENTIFIER_POINTER (TYPE_NAME (node)); 1759 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL 1760 && DECL_NAME (TYPE_NAME (node))) 1761 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (node))); 1762 1763 if (what) 1764 { 1765 if (decl) 1766 warning ("`%s' is deprecated (declared at %s:%d)", what, 1767 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl)); 1768 else 1769 warning ("`%s' is deprecated", what); 1770 } 1771 else if (decl) 1772 warning ("type is deprecated (declared at %s:%d)", 1773 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl)); 1774 else 1775 warning ("type is deprecated"); 1776 } 1777} 1778 1779/* Save the current INPUT_LOCATION on the top entry in the 1780 INPUT_FILE_STACK. Push a new entry for FILE and LINE, and set the 1781 INPUT_LOCATION accordingly. */ 1782 1783void 1784push_srcloc (const char *file, int line) 1785{ 1786 struct file_stack *fs; 1787 1788 fs = xmalloc (sizeof (struct file_stack)); 1789 fs->location = input_location; 1790 fs->next = input_file_stack; 1791 input_filename = file; 1792 input_line = line; 1793 input_file_stack = fs; 1794 input_file_stack_tick++; 1795} 1796 1797/* Pop the top entry off the stack of presently open source files. 1798 Restore the INPUT_LOCATION from the new topmost entry on the 1799 stack. */ 1800 1801void 1802pop_srcloc (void) 1803{ 1804 struct file_stack *fs; 1805 1806 fs = input_file_stack; 1807 input_location = fs->location; 1808 input_file_stack = fs->next; 1809 free (fs); 1810 input_file_stack_tick++; 1811} 1812 1813/* Compile an entire translation unit. Write a file of assembly 1814 output and various debugging dumps. */ 1815 1816static void 1817compile_file (void) 1818{ 1819 /* Initialize yet another pass. */ 1820 1821 init_final (main_input_filename); 1822 coverage_init (aux_base_name); 1823 1824 timevar_push (TV_PARSE); 1825 1826 /* Call the parser, which parses the entire file (calling 1827 rest_of_compilation for each function). */ 1828 (*lang_hooks.parse_file) (set_yydebug); 1829 1830 /* In case there were missing block closers, 1831 get us back to the global binding level. */ 1832 (*lang_hooks.clear_binding_stack) (); 1833 1834 /* Compilation is now finished except for writing 1835 what's left of the symbol table output. */ 1836 timevar_pop (TV_PARSE); 1837 1838 if (flag_syntax_only) 1839 return; 1840 1841 (*lang_hooks.decls.final_write_globals)(); 1842 1843 cgraph_varpool_assemble_pending_decls (); 1844 1845 /* This must occur after the loop to output deferred functions. 1846 Else the coverage initializer would not be emitted if all the 1847 functions in this compilation unit were deferred. */ 1848 coverage_finish (); 1849 1850 /* Write out any pending weak symbol declarations. */ 1851 1852 weak_finish (); 1853 1854 /* Do dbx symbols. */ 1855 timevar_push (TV_SYMOUT); 1856 1857#ifdef DWARF2_UNWIND_INFO 1858 if (dwarf2out_do_frame ()) 1859 dwarf2out_frame_finish (); 1860#endif 1861 1862 (*debug_hooks->finish) (main_input_filename); 1863 timevar_pop (TV_SYMOUT); 1864 1865 /* Output some stuff at end of file if nec. */ 1866 1867 dw2_output_indirect_constants (); 1868 1869 if (profile_arc_flag || flag_test_coverage || flag_branch_probabilities) 1870 { 1871 timevar_push (TV_DUMP); 1872 open_dump_file (DFI_bp, NULL); 1873 1874 end_branch_prob (); 1875 1876 close_dump_file (DFI_bp, NULL, NULL_RTX); 1877 timevar_pop (TV_DUMP); 1878 } 1879 1880 targetm.asm_out.file_end (); 1881 1882 /* Attach a special .ident directive to the end of the file to identify 1883 the version of GCC which compiled this code. The format of the .ident 1884 string is patterned after the ones produced by native SVR4 compilers. */ 1885#ifdef IDENT_ASM_OP 1886 if (!flag_no_ident) 1887 fprintf (asm_out_file, "%s\"GCC: (GNU) %s\"\n", 1888 IDENT_ASM_OP, version_string); 1889#endif 1890 1891 if (optimize > 0 && open_dump_file (DFI_combine, NULL)) 1892 { 1893 timevar_push (TV_DUMP); 1894 dump_combine_total_stats (rtl_dump_file); 1895 close_dump_file (DFI_combine, NULL, NULL_RTX); 1896 timevar_pop (TV_DUMP); 1897 } 1898} 1899 1900/* This is called from various places for FUNCTION_DECL, VAR_DECL, 1901 and TYPE_DECL nodes. 1902 1903 This does nothing for local (non-static) variables, unless the 1904 variable is a register variable with an ASMSPEC. In that case, or 1905 if the variable is not an automatic, it sets up the RTL and 1906 outputs any assembler code (label definition, storage allocation 1907 and initialization). 1908 1909 DECL is the declaration. If ASMSPEC is nonzero, it specifies 1910 the assembler symbol name to be used. TOP_LEVEL is nonzero 1911 if this declaration is not within a function. */ 1912 1913void 1914rest_of_decl_compilation (tree decl, 1915 const char *asmspec, 1916 int top_level, 1917 int at_end) 1918{ 1919 /* We deferred calling assemble_alias so that we could collect 1920 other attributes such as visibility. Emit the alias now. */ 1921 { 1922 tree alias; 1923 alias = lookup_attribute ("alias", DECL_ATTRIBUTES (decl)); 1924 if (alias) 1925 { 1926 alias = TREE_VALUE (TREE_VALUE (alias)); 1927 alias = get_identifier (TREE_STRING_POINTER (alias)); 1928 assemble_alias (decl, alias); 1929 } 1930 } 1931 1932 /* Forward declarations for nested functions are not "external", 1933 but we need to treat them as if they were. */ 1934 if (TREE_STATIC (decl) || DECL_EXTERNAL (decl) 1935 || TREE_CODE (decl) == FUNCTION_DECL) 1936 { 1937 timevar_push (TV_VARCONST); 1938 1939 if (asmspec) 1940 make_decl_rtl (decl, asmspec); 1941 1942 /* Don't output anything when a tentative file-scope definition 1943 is seen. But at end of compilation, do output code for them. 1944 1945 We do output all variables when unit-at-a-time is active and rely on 1946 callgraph code to defer them except for forward declarations 1947 (see gcc.c-torture/compile/920624-1.c) */ 1948 if ((at_end 1949 || !DECL_DEFER_OUTPUT (decl) 1950 || (flag_unit_at_a_time && DECL_INITIAL (decl))) 1951 && !DECL_EXTERNAL (decl)) 1952 { 1953 if (flag_unit_at_a_time && !cgraph_global_info_ready 1954 && TREE_CODE (decl) != FUNCTION_DECL && top_level) 1955 cgraph_varpool_finalize_decl (decl); 1956 else 1957 assemble_variable (decl, top_level, at_end, 0); 1958 } 1959 1960#ifdef ASM_FINISH_DECLARE_OBJECT 1961 if (decl == last_assemble_variable_decl) 1962 { 1963 ASM_FINISH_DECLARE_OBJECT (asm_out_file, decl, 1964 top_level, at_end); 1965 } 1966#endif 1967 1968 timevar_pop (TV_VARCONST); 1969 } 1970 else if (DECL_REGISTER (decl) && asmspec != 0) 1971 { 1972 if (decode_reg_name (asmspec) >= 0) 1973 { 1974 SET_DECL_RTL (decl, NULL_RTX); 1975 make_decl_rtl (decl, asmspec); 1976 } 1977 else 1978 { 1979 error ("invalid register name `%s' for register variable", asmspec); 1980 DECL_REGISTER (decl) = 0; 1981 if (!top_level) 1982 expand_decl (decl); 1983 } 1984 } 1985#if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO) 1986 else if ((write_symbols == DBX_DEBUG || write_symbols == XCOFF_DEBUG) 1987 && TREE_CODE (decl) == TYPE_DECL) 1988 { 1989 timevar_push (TV_SYMOUT); 1990 dbxout_symbol (decl, 0); 1991 timevar_pop (TV_SYMOUT); 1992 } 1993#endif 1994#ifdef SDB_DEBUGGING_INFO 1995 else if (write_symbols == SDB_DEBUG && top_level 1996 && TREE_CODE (decl) == TYPE_DECL) 1997 { 1998 timevar_push (TV_SYMOUT); 1999 sdbout_symbol (decl, 0); 2000 timevar_pop (TV_SYMOUT); 2001 } 2002#endif 2003#ifdef DWARF2_DEBUGGING_INFO 2004 else if ((write_symbols == DWARF2_DEBUG 2005 || write_symbols == VMS_AND_DWARF2_DEBUG) 2006 && top_level 2007 && TREE_CODE (decl) == TYPE_DECL) 2008 { 2009 timevar_push (TV_SYMOUT); 2010 dwarf2out_decl (decl); 2011 timevar_pop (TV_SYMOUT); 2012 } 2013#endif 2014} 2015 2016/* Called after finishing a record, union or enumeral type. */ 2017 2018void 2019rest_of_type_compilation ( 2020#if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO) \ 2021 || defined (SDB_DEBUGGING_INFO) || defined (DWARF2_DEBUGGING_INFO) 2022 tree type, 2023 int toplev 2024#else 2025 tree type ATTRIBUTE_UNUSED, 2026 int toplev ATTRIBUTE_UNUSED 2027#endif 2028 ) 2029{ 2030 /* Avoid confusing the debug information machinery when there are 2031 errors. */ 2032 if (errorcount != 0 || sorrycount != 0) 2033 return; 2034 2035 timevar_push (TV_SYMOUT); 2036#if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO) 2037 if (write_symbols == DBX_DEBUG || write_symbols == XCOFF_DEBUG) 2038 dbxout_symbol (TYPE_STUB_DECL (type), !toplev); 2039#endif 2040#ifdef SDB_DEBUGGING_INFO 2041 if (write_symbols == SDB_DEBUG) 2042 sdbout_symbol (TYPE_STUB_DECL (type), !toplev); 2043#endif 2044#ifdef DWARF2_DEBUGGING_INFO 2045 if ((write_symbols == DWARF2_DEBUG 2046 || write_symbols == VMS_AND_DWARF2_DEBUG) 2047 && toplev) 2048 dwarf2out_decl (TYPE_STUB_DECL (type)); 2049#endif 2050 timevar_pop (TV_SYMOUT); 2051} 2052 2053/* Turn the RTL into assembly. */ 2054static void 2055rest_of_handle_final (tree decl, rtx insns) 2056{ 2057 timevar_push (TV_FINAL); 2058 { 2059 rtx x; 2060 const char *fnname; 2061 2062 /* Get the function's name, as described by its RTL. This may be 2063 different from the DECL_NAME name used in the source file. */ 2064 2065 x = DECL_RTL (decl); 2066 if (GET_CODE (x) != MEM) 2067 abort (); 2068 x = XEXP (x, 0); 2069 if (GET_CODE (x) != SYMBOL_REF) 2070 abort (); 2071 fnname = XSTR (x, 0); 2072 2073 assemble_start_function (decl, fnname); 2074 final_start_function (insns, asm_out_file, optimize); 2075 final (insns, asm_out_file, optimize, 0); 2076 final_end_function (); 2077 2078#ifdef IA64_UNWIND_INFO 2079 /* ??? The IA-64 ".handlerdata" directive must be issued before 2080 the ".endp" directive that closes the procedure descriptor. */ 2081 output_function_exception_table (); 2082#endif 2083 2084 assemble_end_function (decl, fnname); 2085 2086#ifndef IA64_UNWIND_INFO 2087 /* Otherwise, it feels unclean to switch sections in the middle. */ 2088 output_function_exception_table (); 2089#endif 2090 2091 if (! quiet_flag) 2092 fflush (asm_out_file); 2093 2094 /* Release all memory allocated by flow. */ 2095 free_basic_block_vars (0); 2096 2097 /* Release all memory held by regsets now. */ 2098 regset_release_memory (); 2099 } 2100 timevar_pop (TV_FINAL); 2101 2102 ggc_collect (); 2103} 2104 2105#ifdef DELAY_SLOTS 2106/* Run delay slot optimization. */ 2107static void 2108rest_of_handle_delay_slots (tree decl, rtx insns) 2109{ 2110 timevar_push (TV_DBR_SCHED); 2111 open_dump_file (DFI_dbr, decl); 2112 2113 dbr_schedule (insns, rtl_dump_file); 2114 2115 close_dump_file (DFI_dbr, print_rtl, insns); 2116 timevar_pop (TV_DBR_SCHED); 2117 2118 ggc_collect (); 2119} 2120#endif 2121 2122#ifdef STACK_REGS 2123/* Convert register usage from flat register file usage to a stack 2124 register file. */ 2125static void 2126rest_of_handle_stack_regs (tree decl, rtx insns) 2127{ 2128#if defined (HAVE_ATTR_length) 2129 /* If flow2 creates new instructions which need splitting 2130 and scheduling after reload is not done, they might not be 2131 split until final which doesn't allow splitting 2132 if HAVE_ATTR_length. */ 2133#ifdef INSN_SCHEDULING 2134 if (optimize && !flag_schedule_insns_after_reload) 2135#else 2136 if (optimize) 2137#endif 2138 { 2139 timevar_push (TV_SHORTEN_BRANCH); 2140 split_all_insns (1); 2141 timevar_pop (TV_SHORTEN_BRANCH); 2142 } 2143#endif 2144 2145 timevar_push (TV_REG_STACK); 2146 open_dump_file (DFI_stack, decl); 2147 2148 if (reg_to_stack (insns, rtl_dump_file) && optimize) 2149 { 2150 if (cleanup_cfg (CLEANUP_EXPENSIVE | CLEANUP_POST_REGSTACK 2151 | (flag_crossjumping ? CLEANUP_CROSSJUMP : 0)) 2152 && flag_reorder_blocks) 2153 { 2154 reorder_basic_blocks (0); 2155 cleanup_cfg (CLEANUP_EXPENSIVE | CLEANUP_POST_REGSTACK); 2156 } 2157 } 2158 2159 close_dump_file (DFI_stack, print_rtl_with_bb, insns); 2160 timevar_pop (TV_REG_STACK); 2161 2162 ggc_collect (); 2163} 2164#endif 2165 2166 2167/* Machine independent reorg pass. */ 2168static void 2169rest_of_handle_machine_reorg (tree decl, rtx insns) 2170{ 2171 timevar_push (TV_MACH_DEP); 2172 open_dump_file (DFI_mach, decl); 2173 2174 (*targetm.machine_dependent_reorg) (); 2175 2176 close_dump_file (DFI_mach, print_rtl, insns); 2177 timevar_pop (TV_MACH_DEP); 2178 2179 ggc_collect (); 2180} 2181 2182 2183/* Run new register allocator. Return TRUE if we must exit 2184 rest_of_compilation upon return. */ 2185static bool 2186rest_of_handle_new_regalloc (tree decl, rtx insns) 2187{ 2188 int failure; 2189 2190 delete_trivially_dead_insns (insns, max_reg_num ()); 2191 reg_alloc (); 2192 2193 timevar_pop (TV_LOCAL_ALLOC); 2194 if (dump_file[DFI_lreg].enabled) 2195 { 2196 timevar_push (TV_DUMP); 2197 2198 close_dump_file (DFI_lreg, NULL, NULL); 2199 timevar_pop (TV_DUMP); 2200 } 2201 2202 /* XXX clean up the whole mess to bring live info in shape again. */ 2203 timevar_push (TV_GLOBAL_ALLOC); 2204 open_dump_file (DFI_greg, decl); 2205 2206 build_insn_chain (insns); 2207 failure = reload (insns, 0); 2208 2209 timevar_pop (TV_GLOBAL_ALLOC); 2210 2211 if (dump_file[DFI_greg].enabled) 2212 { 2213 timevar_push (TV_DUMP); 2214 2215 dump_global_regs (rtl_dump_file); 2216 2217 close_dump_file (DFI_greg, print_rtl_with_bb, insns); 2218 timevar_pop (TV_DUMP); 2219 } 2220 2221 if (failure) 2222 return true; 2223 2224 reload_completed = 1; 2225 2226 return false; 2227} 2228 2229/* Run old register allocator. Return TRUE if we must exit 2230 rest_of_compilation upon return. */ 2231static bool 2232rest_of_handle_old_regalloc (tree decl, rtx insns) 2233{ 2234 int failure; 2235 int rebuild_notes; 2236 2237 /* Allocate the reg_renumber array. */ 2238 allocate_reg_info (max_regno, FALSE, TRUE); 2239 2240 /* And the reg_equiv_memory_loc array. */ 2241 reg_equiv_memory_loc = xcalloc (max_regno, sizeof (rtx)); 2242 2243 allocate_initial_values (reg_equiv_memory_loc); 2244 2245 regclass (insns, max_reg_num (), rtl_dump_file); 2246 rebuild_notes = local_alloc (); 2247 2248 timevar_pop (TV_LOCAL_ALLOC); 2249 2250 /* Local allocation may have turned an indirect jump into a direct 2251 jump. If so, we must rebuild the JUMP_LABEL fields of jumping 2252 instructions. */ 2253 if (rebuild_notes) 2254 { 2255 timevar_push (TV_JUMP); 2256 2257 rebuild_jump_labels (insns); 2258 purge_all_dead_edges (0); 2259 2260 timevar_pop (TV_JUMP); 2261 } 2262 2263 if (dump_file[DFI_lreg].enabled) 2264 { 2265 timevar_push (TV_DUMP); 2266 2267 dump_flow_info (rtl_dump_file); 2268 dump_local_alloc (rtl_dump_file); 2269 2270 close_dump_file (DFI_lreg, print_rtl_with_bb, insns); 2271 timevar_pop (TV_DUMP); 2272 } 2273 2274 ggc_collect (); 2275 2276 timevar_push (TV_GLOBAL_ALLOC); 2277 open_dump_file (DFI_greg, decl); 2278 2279 /* If optimizing, allocate remaining pseudo-regs. Do the reload 2280 pass fixing up any insns that are invalid. */ 2281 2282 if (optimize) 2283 failure = global_alloc (rtl_dump_file); 2284 else 2285 { 2286 build_insn_chain (insns); 2287 failure = reload (insns, 0); 2288 } 2289 2290 timevar_pop (TV_GLOBAL_ALLOC); 2291 2292 if (dump_file[DFI_greg].enabled) 2293 { 2294 timevar_push (TV_DUMP); 2295 2296 dump_global_regs (rtl_dump_file); 2297 2298 close_dump_file (DFI_greg, print_rtl_with_bb, insns); 2299 timevar_pop (TV_DUMP); 2300 } 2301 2302 return failure; 2303} 2304 2305/* Run the regrename and cprop passes. */ 2306static void 2307rest_of_handle_regrename (tree decl, rtx insns) 2308{ 2309 timevar_push (TV_RENAME_REGISTERS); 2310 open_dump_file (DFI_rnreg, decl); 2311 2312 if (flag_rename_registers) 2313 regrename_optimize (); 2314 if (flag_cprop_registers) 2315 copyprop_hardreg_forward (); 2316 2317 close_dump_file (DFI_rnreg, print_rtl_with_bb, insns); 2318 timevar_pop (TV_RENAME_REGISTERS); 2319} 2320 2321/* Reorder basic blocks. */ 2322static void 2323rest_of_handle_reorder_blocks (tree decl, rtx insns) 2324{ 2325 bool changed; 2326 unsigned int liveness_flags; 2327 2328 open_dump_file (DFI_bbro, decl); 2329 2330 /* Last attempt to optimize CFG, as scheduling, peepholing and insn 2331 splitting possibly introduced more crossjumping opportunities. */ 2332 liveness_flags = (!HAVE_conditional_execution ? CLEANUP_UPDATE_LIFE : 0); 2333 changed = cleanup_cfg (CLEANUP_EXPENSIVE | liveness_flags); 2334 2335 if (flag_sched2_use_traces && flag_schedule_insns_after_reload) 2336 tracer (liveness_flags); 2337 if (flag_reorder_blocks) 2338 reorder_basic_blocks (liveness_flags); 2339 if (flag_reorder_blocks 2340 || (flag_sched2_use_traces && flag_schedule_insns_after_reload)) 2341 changed |= cleanup_cfg (CLEANUP_EXPENSIVE | liveness_flags); 2342 2343 /* On conditional execution targets we can not update the life cheaply, so 2344 we deffer the updating to after both cleanups. This may lose some cases 2345 but should not be terribly bad. */ 2346 if (changed && HAVE_conditional_execution) 2347 update_life_info (NULL, UPDATE_LIFE_GLOBAL_RM_NOTES, 2348 PROP_DEATH_NOTES | PROP_REG_INFO); 2349 close_dump_file (DFI_bbro, print_rtl_with_bb, insns); 2350} 2351 2352#ifdef INSN_SCHEDULING 2353/* Run instruction scheduler. */ 2354static void 2355rest_of_handle_sched (tree decl, rtx insns) 2356{ 2357 timevar_push (TV_SCHED); 2358 2359 /* Print function header into sched dump now 2360 because doing the sched analysis makes some of the dump. */ 2361 if (optimize > 0 && flag_schedule_insns) 2362 { 2363 open_dump_file (DFI_sched, decl); 2364 2365 /* Do control and data sched analysis, 2366 and write some of the results to dump file. */ 2367 2368 schedule_insns (rtl_dump_file); 2369 2370 close_dump_file (DFI_sched, print_rtl_with_bb, insns); 2371 } 2372 timevar_pop (TV_SCHED); 2373 2374 ggc_collect (); 2375} 2376 2377/* Run second scheduling pass after reload. */ 2378static void 2379rest_of_handle_sched2 (tree decl, rtx insns) 2380{ 2381 timevar_push (TV_SCHED2); 2382 open_dump_file (DFI_sched2, decl); 2383 2384 /* Do control and data sched analysis again, 2385 and write some more of the results to dump file. */ 2386 2387 split_all_insns (1); 2388 2389 if (flag_sched2_use_superblocks || flag_sched2_use_traces) 2390 { 2391 schedule_ebbs (rtl_dump_file); 2392 /* No liveness updating code yet, but it should be easy to do. 2393 reg-stack recompute the liveness when needed for now. */ 2394 count_or_remove_death_notes (NULL, 1); 2395 cleanup_cfg (CLEANUP_EXPENSIVE); 2396 } 2397 else 2398 schedule_insns (rtl_dump_file); 2399 2400 close_dump_file (DFI_sched2, print_rtl_with_bb, insns); 2401 timevar_pop (TV_SCHED2); 2402 2403 ggc_collect (); 2404} 2405#endif 2406 2407/* Register allocation pre-pass, to reduce number of moves necessary 2408 for two-address machines. */ 2409static void 2410rest_of_handle_regmove (tree decl, rtx insns) 2411{ 2412 timevar_push (TV_REGMOVE); 2413 open_dump_file (DFI_regmove, decl); 2414 2415 regmove_optimize (insns, max_reg_num (), rtl_dump_file); 2416 2417 cleanup_cfg (CLEANUP_EXPENSIVE | CLEANUP_UPDATE_LIFE); 2418 close_dump_file (DFI_regmove, print_rtl_with_bb, insns); 2419 timevar_pop (TV_REGMOVE); 2420 2421 ggc_collect (); 2422} 2423 2424/* Run tracer. */ 2425static void 2426rest_of_handle_tracer (tree decl, rtx insns) 2427{ 2428 open_dump_file (DFI_tracer, decl); 2429 if (rtl_dump_file) 2430 dump_flow_info (rtl_dump_file); 2431 tracer (0); 2432 cleanup_cfg (CLEANUP_EXPENSIVE); 2433 reg_scan (insns, max_reg_num (), 0); 2434 close_dump_file (DFI_tracer, print_rtl_with_bb, get_insns ()); 2435} 2436 2437/* If-conversion and CFG cleanup. */ 2438static void 2439rest_of_handle_if_conversion (tree decl, rtx insns) 2440{ 2441 open_dump_file (DFI_ce1, decl); 2442 if (flag_if_conversion) 2443 { 2444 timevar_push (TV_IFCVT); 2445 if (rtl_dump_file) 2446 dump_flow_info (rtl_dump_file); 2447 cleanup_cfg (CLEANUP_EXPENSIVE); 2448 reg_scan (insns, max_reg_num (), 0); 2449 if_convert (0); 2450 timevar_pop (TV_IFCVT); 2451 } 2452 timevar_push (TV_JUMP); 2453 cleanup_cfg (CLEANUP_EXPENSIVE); 2454 reg_scan (insns, max_reg_num (), 0); 2455 timevar_pop (TV_JUMP); 2456 close_dump_file (DFI_ce1, print_rtl_with_bb, get_insns ()); 2457} 2458 2459/* Rerun if-conversion, as combine may have simplified things enough 2460 to now meet sequence length restrictions. */ 2461static void 2462rest_of_handle_if_after_combine (tree decl, rtx insns) 2463{ 2464 timevar_push (TV_IFCVT); 2465 open_dump_file (DFI_ce2, decl); 2466 2467 no_new_pseudos = 0; 2468 if_convert (1); 2469 no_new_pseudos = 1; 2470 2471 close_dump_file (DFI_ce2, print_rtl_with_bb, insns); 2472 timevar_pop (TV_IFCVT); 2473} 2474 2475static void 2476rest_of_handle_web (tree decl, rtx insns) 2477{ 2478 open_dump_file (DFI_web, decl); 2479 timevar_push (TV_WEB); 2480 web_main (); 2481 delete_trivially_dead_insns (insns, max_reg_num ()); 2482 cleanup_cfg (CLEANUP_EXPENSIVE); 2483 2484 timevar_pop (TV_WEB); 2485 close_dump_file (DFI_web, print_rtl_with_bb, insns); 2486 reg_scan (get_insns (), max_reg_num (), 0); 2487} 2488 2489/* Do branch profiling and static profile estimation passes. */ 2490static void 2491rest_of_handle_branch_prob (tree decl, rtx insns) 2492{ 2493 struct loops loops; 2494 2495 timevar_push (TV_BRANCH_PROB); 2496 open_dump_file (DFI_bp, decl); 2497 2498 if (profile_arc_flag || flag_test_coverage || flag_branch_probabilities) 2499 branch_prob (); 2500 2501 /* Discover and record the loop depth at the head of each basic 2502 block. The loop infrastructure does the real job for us. */ 2503 flow_loops_find (&loops, LOOP_TREE); 2504 2505 if (rtl_dump_file) 2506 flow_loops_dump (&loops, rtl_dump_file, NULL, 0); 2507 2508 /* Estimate using heuristics if no profiling info is available. */ 2509 if (flag_guess_branch_prob) 2510 estimate_probability (&loops); 2511 2512 flow_loops_free (&loops); 2513 free_dominance_info (CDI_DOMINATORS); 2514 close_dump_file (DFI_bp, print_rtl_with_bb, insns); 2515 timevar_pop (TV_BRANCH_PROB); 2516} 2517 2518/* Do optimizations based on expression value profiles. */ 2519static void 2520rest_of_handle_value_profile_transformations (tree decl, rtx insns) 2521{ 2522 open_dump_file (DFI_vpt, decl); 2523 timevar_push (TV_VPT); 2524 2525 if (value_profile_transformations ()) 2526 cleanup_cfg (CLEANUP_EXPENSIVE); 2527 2528 timevar_pop (TV_VPT); 2529 close_dump_file (DFI_vpt, print_rtl_with_bb, insns); 2530} 2531 2532/* Do control and data flow analysis; write some of the results to the 2533 dump file. */ 2534static void 2535rest_of_handle_cfg (tree decl, rtx insns) 2536{ 2537 open_dump_file (DFI_cfg, decl); 2538 if (rtl_dump_file) 2539 dump_flow_info (rtl_dump_file); 2540 if (optimize) 2541 cleanup_cfg (CLEANUP_EXPENSIVE 2542 | (flag_thread_jumps ? CLEANUP_THREADING : 0)); 2543 2544 /* It may make more sense to mark constant functions after dead code is 2545 eliminated by life_analysis, but we need to do it early, as -fprofile-arcs 2546 may insert code making function non-constant, but we still must consider 2547 it as constant, otherwise -fbranch-probabilities will not read data back. 2548 2549 life_analysis rarely eliminates modification of external memory. 2550 */ 2551 if (optimize) 2552 { 2553 /* Alias analysis depends on this information and mark_constant_function 2554 depends on alias analysis. */ 2555 reg_scan (insns, max_reg_num (), 1); 2556 mark_constant_function (); 2557 } 2558 2559 close_dump_file (DFI_cfg, print_rtl_with_bb, insns); 2560} 2561 2562/* Purge addressofs. */ 2563static void 2564rest_of_handle_addressof (tree decl, rtx insns) 2565{ 2566 open_dump_file (DFI_addressof, decl); 2567 2568 purge_addressof (insns); 2569 if (optimize && purge_all_dead_edges (0)) 2570 delete_unreachable_blocks (); 2571 reg_scan (insns, max_reg_num (), 1); 2572 2573 close_dump_file (DFI_addressof, print_rtl, insns); 2574} 2575 2576/* We may have potential sibling or tail recursion sites. Select one 2577 (of possibly multiple) methods of performing the call. */ 2578static void 2579rest_of_handle_sibling_calls (rtx insns) 2580{ 2581 rtx insn; 2582 optimize_sibling_and_tail_recursive_calls (); 2583 2584 /* Recompute the CFG as sibling optimization clobbers it randomly. */ 2585 free_bb_for_insn (); 2586 find_exception_handler_labels (); 2587 rebuild_jump_labels (insns); 2588 find_basic_blocks (insns, max_reg_num (), rtl_dump_file); 2589 2590 /* There is pass ordering problem - we must lower NOTE_INSN_PREDICTION 2591 notes before simplifying cfg and we must do lowering after sibcall 2592 that unhides parts of RTL chain and cleans up the CFG. 2593 2594 Until sibcall is replaced by tree-level optimizer, lets just 2595 sweep away the NOTE_INSN_PREDICTION notes that leaked out. */ 2596 for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) 2597 if (GET_CODE (insn) == NOTE 2598 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_PREDICTION) 2599 delete_insn (insn); 2600 2601 close_dump_file (DFI_sibling, print_rtl, get_insns ()); 2602} 2603 2604/* Perform jump bypassing and control flow optimizations. */ 2605static void 2606rest_of_handle_jump_bypass (tree decl, rtx insns) 2607{ 2608 timevar_push (TV_BYPASS); 2609 open_dump_file (DFI_bypass, decl); 2610 2611 cleanup_cfg (CLEANUP_EXPENSIVE); 2612 reg_scan (insns, max_reg_num (), 1); 2613 2614 if (bypass_jumps (rtl_dump_file)) 2615 { 2616 rebuild_jump_labels (insns); 2617 cleanup_cfg (CLEANUP_EXPENSIVE); 2618 delete_trivially_dead_insns (insns, max_reg_num ()); 2619 } 2620 2621 close_dump_file (DFI_bypass, print_rtl_with_bb, insns); 2622 timevar_pop (TV_BYPASS); 2623 2624 ggc_collect (); 2625 2626#ifdef ENABLE_CHECKING 2627 verify_flow_info (); 2628#endif 2629} 2630 2631/* Handle inlining of functions in rest_of_compilation. Return TRUE 2632 if we must exit rest_of_compilation upon return. */ 2633static bool 2634rest_of_handle_inlining (tree decl) 2635{ 2636 rtx insns; 2637 int inlinable = 0; 2638 tree parent; 2639 const char *lose; 2640 2641 /* If we are reconsidering an inline function at the end of 2642 compilation, skip the stuff for making it inline. */ 2643 if (cfun->rtl_inline_init) 2644 return 0; 2645 cfun->rtl_inline_init = 1; 2646 2647 /* If this is nested inside an inlined external function, pretend 2648 it was only declared. Since we cannot inline such functions, 2649 generating code for this one is not only not necessary but will 2650 confuse some debugging output writers. */ 2651 for (parent = DECL_CONTEXT (current_function_decl); 2652 parent != NULL_TREE; 2653 parent = get_containing_scope (parent)) 2654 if (TREE_CODE (parent) == FUNCTION_DECL 2655 && DECL_INLINE (parent) && DECL_EXTERNAL (parent)) 2656 { 2657 DECL_INITIAL (decl) = 0; 2658 return true; 2659 } 2660 else if (TYPE_P (parent)) 2661 /* A function in a local class should be treated normally. */ 2662 break; 2663 2664 /* If requested, consider whether to make this function inline. */ 2665 if ((DECL_INLINE (decl) && !flag_no_inline) 2666 || flag_inline_functions) 2667 { 2668 timevar_push (TV_INTEGRATION); 2669 lose = function_cannot_inline_p (decl); 2670 timevar_pop (TV_INTEGRATION); 2671 if (lose || ! optimize) 2672 { 2673 if (warn_inline && lose && DECL_INLINE (decl)) 2674 { 2675 char *msg = concat ("%J", lose, NULL); 2676 warning (msg, decl); 2677 free (msg); 2678 } 2679 DECL_ABSTRACT_ORIGIN (decl) = 0; 2680 /* Don't really compile an extern inline function. 2681 If we can't make it inline, pretend 2682 it was only declared. */ 2683 if (DECL_EXTERNAL (decl)) 2684 { 2685 DECL_INITIAL (decl) = 0; 2686 return true; 2687 } 2688 } 2689 else 2690 inlinable = DECL_INLINE (decl) = 1; 2691 } 2692 2693 insns = get_insns (); 2694 2695 /* Dump the rtl code if we are dumping rtl. */ 2696 2697 if (open_dump_file (DFI_rtl, decl)) 2698 { 2699 if (DECL_SAVED_INSNS (decl) && DECL_SAVED_INSNS (decl)->saved_for_inline) 2700 fprintf (rtl_dump_file, ";; (integrable)\n\n"); 2701 close_dump_file (DFI_rtl, print_rtl, insns); 2702 } 2703 2704 /* Convert from NOTE_INSN_EH_REGION style notes, and do other 2705 sorts of eh initialization. Delay this until after the 2706 initial rtl dump so that we can see the original nesting. */ 2707 convert_from_eh_region_ranges (); 2708 2709 /* If function is inline, and we don't yet know whether to 2710 compile it by itself, defer decision till end of compilation. 2711 wrapup_global_declarations will (indirectly) call 2712 rest_of_compilation again for those functions that need to 2713 be output. Also defer those functions that we are supposed 2714 to defer. */ 2715 2716 if (inlinable 2717 || (DECL_INLINE (decl) 2718 /* Egad. This RTL deferral test conflicts with Fortran assumptions 2719 for unreferenced symbols. See g77.f-torture/execute/980520-1.f. 2720 But removing this line from the check breaks all languages that 2721 use the call graph to output symbols. This hard-coded check is 2722 the least invasive work-around. Nested functions need to be 2723 deferred too. */ 2724 && (flag_inline_functions 2725 || strcmp (lang_hooks.name, "GNU F77") == 0 2726 || (cgraph_n_nodes > 0 && cgraph_node (decl)->origin)) 2727 && ((! TREE_PUBLIC (decl) && ! TREE_ADDRESSABLE (decl) 2728 && ! TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl)) 2729 && ! flag_keep_inline_functions) 2730 || DECL_EXTERNAL (decl)))) 2731 DECL_DEFER_OUTPUT (decl) = 1; 2732 2733 if (DECL_INLINE (decl)) 2734 /* DWARF wants separate debugging info for abstract and 2735 concrete instances of all inline functions, including those 2736 declared inline but not inlined, and those inlined even 2737 though they weren't declared inline. Conveniently, that's 2738 what DECL_INLINE means at this point. */ 2739 (*debug_hooks->deferred_inline_function) (decl); 2740 2741 if (DECL_DEFER_OUTPUT (decl)) 2742 { 2743 /* If -Wreturn-type, we have to do a bit of compilation. We just 2744 want to call cleanup the cfg to figure out whether or not we can 2745 fall off the end of the function; we do the minimum amount of 2746 work necessary to make that safe. */ 2747 if (warn_return_type) 2748 { 2749 int saved_optimize = optimize; 2750 2751 optimize = 0; 2752 rebuild_jump_labels (insns); 2753 find_exception_handler_labels (); 2754 find_basic_blocks (insns, max_reg_num (), rtl_dump_file); 2755 cleanup_cfg (CLEANUP_PRE_SIBCALL | CLEANUP_PRE_LOOP); 2756 optimize = saved_optimize; 2757 2758 /* CFG is no longer maintained up-to-date. */ 2759 free_bb_for_insn (); 2760 } 2761 2762 set_nothrow_function_flags (); 2763 if (current_function_nothrow) 2764 /* Now we know that this can't throw; set the flag for the benefit 2765 of other functions later in this translation unit. */ 2766 TREE_NOTHROW (current_function_decl) = 1; 2767 2768 timevar_push (TV_INTEGRATION); 2769 save_for_inline (decl); 2770 timevar_pop (TV_INTEGRATION); 2771 DECL_SAVED_INSNS (decl)->inlinable = inlinable; 2772 return true; 2773 } 2774 2775 /* If specified extern inline but we aren't inlining it, we are 2776 done. This goes for anything that gets here with DECL_EXTERNAL 2777 set, not just things with DECL_INLINE. */ 2778 return (bool) DECL_EXTERNAL (decl); 2779} 2780 2781/* Try to identify useless null pointer tests and delete them. */ 2782static void 2783rest_of_handle_null_pointer (tree decl, rtx insns) 2784{ 2785 open_dump_file (DFI_null, decl); 2786 if (rtl_dump_file) 2787 dump_flow_info (rtl_dump_file); 2788 2789 if (delete_null_pointer_checks (insns)) 2790 cleanup_cfg (CLEANUP_EXPENSIVE | CLEANUP_PRE_LOOP); 2791 2792 close_dump_file (DFI_null, print_rtl_with_bb, insns); 2793} 2794 2795/* Try combining insns through substitution. */ 2796static void 2797rest_of_handle_combine (tree decl, rtx insns) 2798{ 2799 int rebuild_jump_labels_after_combine = 0; 2800 2801 timevar_push (TV_COMBINE); 2802 open_dump_file (DFI_combine, decl); 2803 2804 rebuild_jump_labels_after_combine 2805 = combine_instructions (insns, max_reg_num ()); 2806 2807 /* Combining insns may have turned an indirect jump into a 2808 direct jump. Rebuild the JUMP_LABEL fields of jumping 2809 instructions. */ 2810 if (rebuild_jump_labels_after_combine) 2811 { 2812 timevar_push (TV_JUMP); 2813 rebuild_jump_labels (insns); 2814 timevar_pop (TV_JUMP); 2815 2816 cleanup_cfg (CLEANUP_EXPENSIVE | CLEANUP_UPDATE_LIFE); 2817 } 2818 2819 close_dump_file (DFI_combine, print_rtl_with_bb, insns); 2820 timevar_pop (TV_COMBINE); 2821 2822 ggc_collect (); 2823} 2824 2825/* Perform life analysis. */ 2826static void 2827rest_of_handle_life (tree decl, rtx insns) 2828{ 2829 open_dump_file (DFI_life, decl); 2830 regclass_init (); 2831 2832#ifdef ENABLE_CHECKING 2833 verify_flow_info (); 2834#endif 2835 life_analysis (insns, rtl_dump_file, PROP_FINAL); 2836 if (optimize) 2837 cleanup_cfg ((optimize ? CLEANUP_EXPENSIVE : 0) | CLEANUP_UPDATE_LIFE 2838 | CLEANUP_LOG_LINKS 2839 | (flag_thread_jumps ? CLEANUP_THREADING : 0)); 2840 timevar_pop (TV_FLOW); 2841 2842 if (warn_uninitialized) 2843 { 2844 uninitialized_vars_warning (DECL_INITIAL (decl)); 2845 if (extra_warnings) 2846 setjmp_args_warning (); 2847 } 2848 2849 if (optimize) 2850 { 2851 if (!flag_new_regalloc && initialize_uninitialized_subregs ()) 2852 { 2853 /* Insns were inserted, and possibly pseudos created, so 2854 things might look a bit different. */ 2855 insns = get_insns (); 2856 allocate_reg_life_data (); 2857 update_life_info (NULL, UPDATE_LIFE_GLOBAL_RM_NOTES, 2858 PROP_LOG_LINKS | PROP_REG_INFO | PROP_DEATH_NOTES); 2859 } 2860 } 2861 2862 no_new_pseudos = 1; 2863 2864 close_dump_file (DFI_life, print_rtl_with_bb, insns); 2865 2866 ggc_collect (); 2867} 2868 2869/* Perform common subexpression elimination. Nonzero value from 2870 `cse_main' means that jumps were simplified and some code may now 2871 be unreachable, so do jump optimization again. */ 2872static void 2873rest_of_handle_cse (tree decl, rtx insns) 2874{ 2875 int tem; 2876 2877 open_dump_file (DFI_cse, decl); 2878 if (rtl_dump_file) 2879 dump_flow_info (rtl_dump_file); 2880 timevar_push (TV_CSE); 2881 2882 reg_scan (insns, max_reg_num (), 1); 2883 2884 tem = cse_main (insns, max_reg_num (), 0, rtl_dump_file); 2885 if (tem) 2886 rebuild_jump_labels (insns); 2887 if (purge_all_dead_edges (0)) 2888 delete_unreachable_blocks (); 2889 2890 delete_trivially_dead_insns (insns, max_reg_num ()); 2891 2892 /* If we are not running more CSE passes, then we are no longer 2893 expecting CSE to be run. But always rerun it in a cheap mode. */ 2894 cse_not_expected = !flag_rerun_cse_after_loop && !flag_gcse; 2895 2896 if (tem || optimize > 1) 2897 cleanup_cfg (CLEANUP_EXPENSIVE | CLEANUP_PRE_LOOP); 2898 /* Try to identify useless null pointer tests and delete them. */ 2899 if (flag_delete_null_pointer_checks) 2900 { 2901 timevar_push (TV_JUMP); 2902 2903 if (delete_null_pointer_checks (insns)) 2904 cleanup_cfg (CLEANUP_EXPENSIVE | CLEANUP_PRE_LOOP); 2905 timevar_pop (TV_JUMP); 2906 } 2907 2908 /* The second pass of jump optimization is likely to have 2909 removed a bunch more instructions. */ 2910 renumber_insns (rtl_dump_file); 2911 2912 timevar_pop (TV_CSE); 2913 close_dump_file (DFI_cse, print_rtl_with_bb, insns); 2914} 2915 2916/* Run second CSE pass after loop optimizations. */ 2917static void 2918rest_of_handle_cse2 (tree decl, rtx insns) 2919{ 2920 int tem; 2921 2922 timevar_push (TV_CSE2); 2923 open_dump_file (DFI_cse2, decl); 2924 if (rtl_dump_file) 2925 dump_flow_info (rtl_dump_file); 2926 /* CFG is no longer maintained up-to-date. */ 2927 tem = cse_main (insns, max_reg_num (), 1, rtl_dump_file); 2928 2929 /* Run a pass to eliminate duplicated assignments to condition code 2930 registers. We have to run this after bypass_jumps, because it 2931 makes it harder for that pass to determine whether a jump can be 2932 bypassed safely. */ 2933 cse_condition_code_reg (); 2934 2935 purge_all_dead_edges (0); 2936 delete_trivially_dead_insns (insns, max_reg_num ()); 2937 2938 if (tem) 2939 { 2940 timevar_push (TV_JUMP); 2941 rebuild_jump_labels (insns); 2942 cleanup_cfg (CLEANUP_EXPENSIVE); 2943 timevar_pop (TV_JUMP); 2944 } 2945 reg_scan (insns, max_reg_num (), 0); 2946 close_dump_file (DFI_cse2, print_rtl_with_bb, insns); 2947 ggc_collect (); 2948 timevar_pop (TV_CSE2); 2949} 2950 2951/* Perform global cse. */ 2952static void 2953rest_of_handle_gcse (tree decl, rtx insns) 2954{ 2955 int save_csb, save_cfj; 2956 int tem2 = 0, tem; 2957 2958 timevar_push (TV_GCSE); 2959 open_dump_file (DFI_gcse, decl); 2960 2961 tem = gcse_main (insns, rtl_dump_file); 2962 rebuild_jump_labels (insns); 2963 delete_trivially_dead_insns (insns, max_reg_num ()); 2964 2965 save_csb = flag_cse_skip_blocks; 2966 save_cfj = flag_cse_follow_jumps; 2967 flag_cse_skip_blocks = flag_cse_follow_jumps = 0; 2968 2969 /* Instantiate any remaining CONSTANT_P_RTX nodes. */ 2970 if (current_function_calls_constant_p) 2971 purge_builtin_constant_p (); 2972 2973 /* If -fexpensive-optimizations, re-run CSE to clean up things done 2974 by gcse. */ 2975 if (flag_expensive_optimizations) 2976 { 2977 timevar_push (TV_CSE); 2978 reg_scan (insns, max_reg_num (), 1); 2979 tem2 = cse_main (insns, max_reg_num (), 0, rtl_dump_file); 2980 purge_all_dead_edges (0); 2981 delete_trivially_dead_insns (insns, max_reg_num ()); 2982 timevar_pop (TV_CSE); 2983 cse_not_expected = !flag_rerun_cse_after_loop; 2984 } 2985 2986 /* If gcse or cse altered any jumps, rerun jump optimizations to clean 2987 things up. Then possibly re-run CSE again. */ 2988 while (tem || tem2) 2989 { 2990 tem = tem2 = 0; 2991 timevar_push (TV_JUMP); 2992 rebuild_jump_labels (insns); 2993 cleanup_cfg (CLEANUP_EXPENSIVE | CLEANUP_PRE_LOOP); 2994 timevar_pop (TV_JUMP); 2995 2996 if (flag_expensive_optimizations) 2997 { 2998 timevar_push (TV_CSE); 2999 reg_scan (insns, max_reg_num (), 1); 3000 tem2 = cse_main (insns, max_reg_num (), 0, rtl_dump_file); 3001 purge_all_dead_edges (0); 3002 delete_trivially_dead_insns (insns, max_reg_num ()); 3003 timevar_pop (TV_CSE); 3004 } 3005 } 3006 3007 close_dump_file (DFI_gcse, print_rtl_with_bb, insns); 3008 timevar_pop (TV_GCSE); 3009 3010 ggc_collect (); 3011 flag_cse_skip_blocks = save_csb; 3012 flag_cse_follow_jumps = save_cfj; 3013#ifdef ENABLE_CHECKING 3014 verify_flow_info (); 3015#endif 3016} 3017 3018/* Move constant computations out of loops. */ 3019static void 3020rest_of_handle_loop_optimize (tree decl, rtx insns) 3021{ 3022 int do_unroll, do_prefetch; 3023 3024 timevar_push (TV_LOOP); 3025 delete_dead_jumptables (); 3026 cleanup_cfg (CLEANUP_EXPENSIVE | CLEANUP_PRE_LOOP); 3027 open_dump_file (DFI_loop, decl); 3028 3029 /* CFG is no longer maintained up-to-date. */ 3030 free_bb_for_insn (); 3031 3032 if (flag_unroll_loops) 3033 do_unroll = LOOP_AUTO_UNROLL; /* Having two unrollers is useless. */ 3034 else 3035 do_unroll = flag_old_unroll_loops ? LOOP_UNROLL : LOOP_AUTO_UNROLL; 3036 do_prefetch = flag_prefetch_loop_arrays ? LOOP_PREFETCH : 0; 3037 3038 if (flag_rerun_loop_opt) 3039 { 3040 cleanup_barriers (); 3041 3042 /* We only want to perform unrolling once. */ 3043 loop_optimize (insns, rtl_dump_file, do_unroll); 3044 do_unroll = 0; 3045 3046 /* The first call to loop_optimize makes some instructions 3047 trivially dead. We delete those instructions now in the 3048 hope that doing so will make the heuristics in loop work 3049 better and possibly speed up compilation. */ 3050 delete_trivially_dead_insns (insns, max_reg_num ()); 3051 3052 /* The regscan pass is currently necessary as the alias 3053 analysis code depends on this information. */ 3054 reg_scan (insns, max_reg_num (), 1); 3055 } 3056 cleanup_barriers (); 3057 loop_optimize (insns, rtl_dump_file, do_unroll | LOOP_BCT | do_prefetch); 3058 3059 /* Loop can create trivially dead instructions. */ 3060 delete_trivially_dead_insns (insns, max_reg_num ()); 3061 close_dump_file (DFI_loop, print_rtl, insns); 3062 timevar_pop (TV_LOOP); 3063 find_basic_blocks (insns, max_reg_num (), rtl_dump_file); 3064 3065 ggc_collect (); 3066} 3067 3068/* Perform loop optimizations. It might be better to do them a bit 3069 sooner, but we want the profile feedback to work more 3070 efficiently. */ 3071static void 3072rest_of_handle_loop2 (tree decl, rtx insns) 3073{ 3074 struct loops *loops; 3075 timevar_push (TV_LOOP); 3076 open_dump_file (DFI_loop2, decl); 3077 if (rtl_dump_file) 3078 dump_flow_info (rtl_dump_file); 3079 3080 loops = loop_optimizer_init (rtl_dump_file); 3081 3082 if (loops) 3083 { 3084 /* The optimizations: */ 3085 if (flag_unswitch_loops) 3086 unswitch_loops (loops); 3087 3088 if (flag_peel_loops || flag_unroll_loops) 3089 unroll_and_peel_loops (loops, 3090 (flag_peel_loops ? UAP_PEEL : 0) | 3091 (flag_unroll_loops ? UAP_UNROLL : 0) | 3092 (flag_unroll_all_loops ? UAP_UNROLL_ALL : 0)); 3093 3094 loop_optimizer_finalize (loops, rtl_dump_file); 3095 } 3096 3097 cleanup_cfg (CLEANUP_EXPENSIVE); 3098 delete_trivially_dead_insns (insns, max_reg_num ()); 3099 reg_scan (insns, max_reg_num (), 0); 3100 if (rtl_dump_file) 3101 dump_flow_info (rtl_dump_file); 3102 close_dump_file (DFI_loop2, print_rtl_with_bb, get_insns ()); 3103 timevar_pop (TV_LOOP); 3104 ggc_collect (); 3105} 3106 3107/* This is called from finish_function (within langhooks.parse_file) 3108 after each top-level definition is parsed. 3109 It is supposed to compile that function or variable 3110 and output the assembler code for it. 3111 After we return, the tree storage is freed. */ 3112 3113void 3114rest_of_compilation (tree decl) 3115{ 3116 rtx insns; 3117 3118 timevar_push (TV_REST_OF_COMPILATION); 3119 3120 /* Register rtl specific functions for cfg. */ 3121 rtl_register_cfg_hooks (); 3122 3123 /* Now that we're out of the frontend, we shouldn't have any more 3124 CONCATs anywhere. */ 3125 generating_concat_p = 0; 3126 3127 /* When processing delayed functions, prepare_function_start() won't 3128 have been run to re-initialize it. */ 3129 cse_not_expected = ! optimize; 3130 3131 /* First, make sure that NOTE_BLOCK is set correctly for each 3132 NOTE_INSN_BLOCK_BEG/NOTE_INSN_BLOCK_END note. */ 3133 if (!cfun->x_whole_function_mode_p) 3134 identify_blocks (); 3135 3136 /* In function-at-a-time mode, we do not attempt to keep the BLOCK 3137 tree in sensible shape. So, we just recalculate it here. */ 3138 if (cfun->x_whole_function_mode_p) 3139 reorder_blocks (); 3140 3141 init_flow (); 3142 3143 if (rest_of_handle_inlining (decl)) 3144 goto exit_rest_of_compilation; 3145 3146 /* If we're emitting a nested function, make sure its parent gets 3147 emitted as well. Doing otherwise confuses debug info. */ 3148 { 3149 tree parent; 3150 for (parent = DECL_CONTEXT (current_function_decl); 3151 parent != NULL_TREE; 3152 parent = get_containing_scope (parent)) 3153 if (TREE_CODE (parent) == FUNCTION_DECL) 3154 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (parent)) = 1; 3155 } 3156 3157 /* We are now committed to emitting code for this function. Do any 3158 preparation, such as emitting abstract debug info for the inline 3159 before it gets mangled by optimization. */ 3160 if (cgraph_function_possibly_inlined_p (decl)) 3161 (*debug_hooks->outlining_inline_function) (decl); 3162 3163 /* Remove any notes we don't need. That will make iterating 3164 over the instruction sequence faster, and allow the garbage 3165 collector to reclaim the memory used by the notes. */ 3166 remove_unnecessary_notes (); 3167 reorder_blocks (); 3168 3169 ggc_collect (); 3170 3171 /* Initialize some variables used by the optimizers. */ 3172 init_function_for_compilation (); 3173 3174 if (! DECL_DEFER_OUTPUT (decl)) 3175 TREE_ASM_WRITTEN (decl) = 1; 3176 3177 /* Now that integrate will no longer see our rtl, we need not 3178 distinguish between the return value of this function and the 3179 return value of called functions. Also, we can remove all SETs 3180 of subregs of hard registers; they are only here because of 3181 integrate. Also, we can now initialize pseudos intended to 3182 carry magic hard reg data throughout the function. */ 3183 rtx_equal_function_value_matters = 0; 3184 purge_hard_subreg_sets (get_insns ()); 3185 3186 /* Early return if there were errors. We can run afoul of our 3187 consistency checks, and there's not really much point in fixing them. 3188 Don't return yet if -Wreturn-type; we need to do cleanup_cfg. */ 3189 if (((rtl_dump_and_exit || flag_syntax_only) && !warn_return_type) 3190 || errorcount || sorrycount) 3191 goto exit_rest_of_compilation; 3192 3193 timevar_push (TV_JUMP); 3194 open_dump_file (DFI_sibling, decl); 3195 insns = get_insns (); 3196 rebuild_jump_labels (insns); 3197 find_exception_handler_labels (); 3198 find_basic_blocks (insns, max_reg_num (), rtl_dump_file); 3199 3200 delete_unreachable_blocks (); 3201 3202 /* Turn NOTE_INSN_PREDICTIONs into branch predictions. */ 3203 if (flag_guess_branch_prob) 3204 { 3205 timevar_push (TV_BRANCH_PROB); 3206 note_prediction_to_br_prob (); 3207 timevar_pop (TV_BRANCH_PROB); 3208 } 3209 3210 if (flag_optimize_sibling_calls) 3211 rest_of_handle_sibling_calls (insns); 3212 3213 /* We have to issue these warnings now already, because CFG cleanups 3214 further down may destroy the required information. However, this 3215 must be done after the sibcall optimization pass because the barrier 3216 emitted for noreturn calls that are candidate for the optimization 3217 is folded into the CALL_PLACEHOLDER until after this pass, so the 3218 CFG is inaccurate. */ 3219 check_function_return_warnings (); 3220 3221 timevar_pop (TV_JUMP); 3222 3223 insn_locators_initialize (); 3224 /* Complete generation of exception handling code. */ 3225 if (doing_eh (0)) 3226 { 3227 timevar_push (TV_JUMP); 3228 open_dump_file (DFI_eh, decl); 3229 3230 finish_eh_generation (); 3231 3232 close_dump_file (DFI_eh, print_rtl, get_insns ()); 3233 timevar_pop (TV_JUMP); 3234 } 3235 3236 /* Delay emitting hard_reg_initial_value sets until after EH landing pad 3237 generation, which might create new sets. */ 3238 emit_initial_value_sets (); 3239 3240#ifdef FINALIZE_PIC 3241 /* If we are doing position-independent code generation, now 3242 is the time to output special prologues and epilogues. 3243 We do not want to do this earlier, because it just clutters 3244 up inline functions with meaningless insns. */ 3245 if (flag_pic) 3246 FINALIZE_PIC; 3247#endif 3248 3249 insns = get_insns (); 3250 3251 /* Copy any shared structure that should not be shared. */ 3252 unshare_all_rtl (current_function_decl, insns); 3253 3254#ifdef SETJMP_VIA_SAVE_AREA 3255 /* This must be performed before virtual register instantiation. 3256 Please be aware the everything in the compiler that can look 3257 at the RTL up to this point must understand that REG_SAVE_AREA 3258 is just like a use of the REG contained inside. */ 3259 if (current_function_calls_alloca) 3260 optimize_save_area_alloca (insns); 3261#endif 3262 3263 /* Instantiate all virtual registers. */ 3264 instantiate_virtual_regs (current_function_decl, insns); 3265 3266 open_dump_file (DFI_jump, decl); 3267 3268 /* Always do one jump optimization pass to ensure that JUMP_LABEL fields 3269 are initialized and to compute whether control can drop off the end 3270 of the function. */ 3271 3272 timevar_push (TV_JUMP); 3273 /* Turn NOTE_INSN_EXPECTED_VALUE into REG_BR_PROB. Do this 3274 before jump optimization switches branch directions. */ 3275 if (flag_guess_branch_prob) 3276 expected_value_to_br_prob (); 3277 3278 reg_scan (insns, max_reg_num (), 0); 3279 rebuild_jump_labels (insns); 3280 find_basic_blocks (insns, max_reg_num (), rtl_dump_file); 3281 delete_trivially_dead_insns (insns, max_reg_num ()); 3282 if (rtl_dump_file) 3283 dump_flow_info (rtl_dump_file); 3284 cleanup_cfg ((optimize ? CLEANUP_EXPENSIVE : 0) | CLEANUP_PRE_LOOP 3285 | (flag_thread_jumps ? CLEANUP_THREADING : 0)); 3286 3287 if (optimize) 3288 { 3289 free_bb_for_insn (); 3290 copy_loop_headers (insns); 3291 find_basic_blocks (insns, max_reg_num (), rtl_dump_file); 3292 } 3293 purge_line_number_notes (insns); 3294 3295 timevar_pop (TV_JUMP); 3296 close_dump_file (DFI_jump, print_rtl, insns); 3297 3298 /* Now is when we stop if -fsyntax-only and -Wreturn-type. */ 3299 if (rtl_dump_and_exit || flag_syntax_only || DECL_DEFER_OUTPUT (decl)) 3300 goto exit_rest_of_compilation; 3301 3302 timevar_push (TV_JUMP); 3303 3304 if (optimize) 3305 cleanup_cfg (CLEANUP_EXPENSIVE | CLEANUP_PRE_LOOP); 3306 3307 if (flag_delete_null_pointer_checks) 3308 rest_of_handle_null_pointer (decl, insns); 3309 3310 /* Jump optimization, and the removal of NULL pointer checks, may 3311 have reduced the number of instructions substantially. CSE, and 3312 future passes, allocate arrays whose dimensions involve the 3313 maximum instruction UID, so if we can reduce the maximum UID 3314 we'll save big on memory. */ 3315 renumber_insns (rtl_dump_file); 3316 timevar_pop (TV_JUMP); 3317 3318 close_dump_file (DFI_jump, print_rtl_with_bb, insns); 3319 3320 ggc_collect (); 3321 3322 if (optimize > 0) 3323 rest_of_handle_cse (decl, insns); 3324 3325 rest_of_handle_addressof (decl, insns); 3326 3327 ggc_collect (); 3328 3329 if (optimize > 0) 3330 { 3331 if (flag_gcse) 3332 rest_of_handle_gcse (decl, insns); 3333 3334 if (flag_loop_optimize) 3335 rest_of_handle_loop_optimize (decl, insns); 3336 3337 if (flag_gcse) 3338 rest_of_handle_jump_bypass (decl, insns); 3339 } 3340 3341 timevar_push (TV_FLOW); 3342 3343 rest_of_handle_cfg (decl, insns); 3344 3345 if (optimize > 0 3346 || profile_arc_flag || flag_test_coverage || flag_branch_probabilities) 3347 { 3348 rest_of_handle_branch_prob (decl, insns); 3349 3350 if (flag_branch_probabilities 3351 && flag_profile_values 3352 && flag_value_profile_transformations) 3353 rest_of_handle_value_profile_transformations (decl, insns); 3354 3355 /* Remove the death notes created for vpt. */ 3356 if (flag_profile_values) 3357 count_or_remove_death_notes (NULL, 1); 3358 } 3359 3360 if (optimize > 0) 3361 rest_of_handle_if_conversion (decl, insns); 3362 3363 if (flag_tracer) 3364 rest_of_handle_tracer (decl, insns); 3365 3366 if (optimize > 0 3367 && (flag_unswitch_loops 3368 || flag_peel_loops 3369 || flag_unroll_loops)) 3370 rest_of_handle_loop2 (decl, insns); 3371 3372 if (flag_web) 3373 rest_of_handle_web (decl, insns); 3374 3375 if (flag_rerun_cse_after_loop) 3376 rest_of_handle_cse2 (decl, insns); 3377 3378 cse_not_expected = 1; 3379 3380 rest_of_handle_life (decl, insns); 3381 3382 if (optimize > 0) 3383 rest_of_handle_combine (decl, insns); 3384 3385 if (flag_if_conversion) 3386 rest_of_handle_if_after_combine (decl, insns); 3387 3388 if (optimize > 0 && (flag_regmove || flag_expensive_optimizations)) 3389 rest_of_handle_regmove (decl, insns); 3390 3391 /* Do unconditional splitting before register allocation to allow machine 3392 description to add extra information not needed previously. */ 3393 split_all_insns (1); 3394 3395#ifdef OPTIMIZE_MODE_SWITCHING 3396 timevar_push (TV_MODE_SWITCH); 3397 3398 no_new_pseudos = 0; 3399 optimize_mode_switching (NULL); 3400 no_new_pseudos = 1; 3401 3402 timevar_pop (TV_MODE_SWITCH); 3403#endif 3404 3405 /* Any of the several passes since flow1 will have munged register 3406 lifetime data a bit. We need it to be up to date for scheduling 3407 (see handling of reg_known_equiv in init_alias_analysis). */ 3408 recompute_reg_usage (insns, !optimize_size); 3409 3410#ifdef INSN_SCHEDULING 3411 rest_of_handle_sched (decl, insns); 3412#endif 3413 3414 /* Determine if the current function is a leaf before running reload 3415 since this can impact optimizations done by the prologue and 3416 epilogue thus changing register elimination offsets. */ 3417 current_function_is_leaf = leaf_function_p (); 3418 3419 timevar_push (TV_LOCAL_ALLOC); 3420 open_dump_file (DFI_lreg, decl); 3421 3422 if (flag_new_regalloc) 3423 { 3424 if (rest_of_handle_new_regalloc (decl, insns)) 3425 goto exit_rest_of_compilation; 3426 } 3427 else 3428 { 3429 if (rest_of_handle_old_regalloc (decl, insns)) 3430 goto exit_rest_of_compilation; 3431 } 3432 3433 ggc_collect (); 3434 3435 open_dump_file (DFI_postreload, decl); 3436 3437 /* Do a very simple CSE pass over just the hard registers. */ 3438 if (optimize > 0) 3439 { 3440 timevar_push (TV_RELOAD_CSE_REGS); 3441 reload_cse_regs (insns); 3442 /* reload_cse_regs can eliminate potentially-trapping MEMs. 3443 Remove any EH edges associated with them. */ 3444 if (flag_non_call_exceptions) 3445 purge_all_dead_edges (0); 3446 timevar_pop (TV_RELOAD_CSE_REGS); 3447 } 3448 3449 close_dump_file (DFI_postreload, print_rtl_with_bb, insns); 3450 3451 /* Re-create the death notes which were deleted during reload. */ 3452 timevar_push (TV_FLOW2); 3453 open_dump_file (DFI_flow2, decl); 3454 3455#ifdef ENABLE_CHECKING 3456 verify_flow_info (); 3457#endif 3458 3459 /* If optimizing, then go ahead and split insns now. */ 3460#ifndef STACK_REGS 3461 if (optimize > 0) 3462#endif 3463 split_all_insns (0); 3464 3465 if (flag_branch_target_load_optimize) 3466 { 3467 open_dump_file (DFI_branch_target_load, decl); 3468 3469 branch_target_load_optimize (insns, false); 3470 3471 close_dump_file (DFI_branch_target_load, print_rtl_with_bb, insns); 3472 3473 ggc_collect (); 3474 } 3475 3476 if (optimize) 3477 cleanup_cfg (CLEANUP_EXPENSIVE); 3478 3479 /* On some machines, the prologue and epilogue code, or parts thereof, 3480 can be represented as RTL. Doing so lets us schedule insns between 3481 it and the rest of the code and also allows delayed branch 3482 scheduling to operate in the epilogue. */ 3483 thread_prologue_and_epilogue_insns (insns); 3484 epilogue_completed = 1; 3485 3486 if (optimize) 3487 { 3488 life_analysis (insns, rtl_dump_file, PROP_POSTRELOAD); 3489 cleanup_cfg (CLEANUP_EXPENSIVE | CLEANUP_UPDATE_LIFE 3490 | (flag_crossjumping ? CLEANUP_CROSSJUMP : 0)); 3491 3492 /* This is kind of a heuristic. We need to run combine_stack_adjustments 3493 even for machines with possibly nonzero RETURN_POPS_ARGS 3494 and ACCUMULATE_OUTGOING_ARGS. We expect that only ports having 3495 push instructions will have popping returns. */ 3496#ifndef PUSH_ROUNDING 3497 if (!ACCUMULATE_OUTGOING_ARGS) 3498#endif 3499 combine_stack_adjustments (); 3500 3501 ggc_collect (); 3502 } 3503 3504 flow2_completed = 1; 3505 3506 close_dump_file (DFI_flow2, print_rtl_with_bb, insns); 3507 timevar_pop (TV_FLOW2); 3508 3509#ifdef HAVE_peephole2 3510 if (optimize > 0 && flag_peephole2) 3511 { 3512 timevar_push (TV_PEEPHOLE2); 3513 open_dump_file (DFI_peephole2, decl); 3514 3515 peephole2_optimize (rtl_dump_file); 3516 3517 close_dump_file (DFI_peephole2, print_rtl_with_bb, insns); 3518 timevar_pop (TV_PEEPHOLE2); 3519 } 3520#endif 3521 3522 open_dump_file (DFI_ce3, decl); 3523 if (optimize) 3524 /* Last attempt to optimize CFG, as scheduling, peepholing and insn 3525 splitting possibly introduced more crossjumping opportunities. */ 3526 cleanup_cfg (CLEANUP_EXPENSIVE 3527 | CLEANUP_UPDATE_LIFE 3528 | (flag_crossjumping ? CLEANUP_CROSSJUMP : 0)); 3529 if (flag_if_conversion2) 3530 { 3531 timevar_push (TV_IFCVT2); 3532 3533 if_convert (1); 3534 3535 timevar_pop (TV_IFCVT2); 3536 } 3537 close_dump_file (DFI_ce3, print_rtl_with_bb, insns); 3538 3539 if (optimize > 0) 3540 { 3541 if (flag_rename_registers || flag_cprop_registers) 3542 rest_of_handle_regrename (decl, insns); 3543 3544 rest_of_handle_reorder_blocks (decl, insns); 3545 } 3546 3547 if (flag_branch_target_load_optimize2) 3548 { 3549 /* Leave this a warning for now so that it is possible to experiment 3550 with running this pass twice. In 3.6, we should either make this 3551 an error, or use separate dump files. */ 3552 if (flag_branch_target_load_optimize) 3553 warning ("branch target register load optimization is not intended " 3554 "to be run twice"); 3555 3556 open_dump_file (DFI_branch_target_load, decl); 3557 3558 branch_target_load_optimize (insns, true); 3559 3560 close_dump_file (DFI_branch_target_load, print_rtl_with_bb, insns); 3561 3562 ggc_collect (); 3563 } 3564 3565#ifdef INSN_SCHEDULING 3566 if (optimize > 0 && flag_schedule_insns_after_reload) 3567 rest_of_handle_sched2 (decl, insns); 3568#endif 3569 3570#ifdef LEAF_REGISTERS 3571 current_function_uses_only_leaf_regs 3572 = optimize > 0 && only_leaf_regs_used () && leaf_function_p (); 3573#endif 3574 3575#ifdef STACK_REGS 3576 rest_of_handle_stack_regs (decl, insns); 3577#endif 3578 3579 compute_alignments (); 3580 3581 /* CFG is no longer maintained up-to-date. */ 3582 free_bb_for_insn (); 3583 3584 if (targetm.machine_dependent_reorg != 0) 3585 rest_of_handle_machine_reorg (decl, insns); 3586 3587 purge_line_number_notes (insns); 3588 cleanup_barriers (); 3589 3590#ifdef DELAY_SLOTS 3591 if (optimize > 0 && flag_delayed_branch) 3592 rest_of_handle_delay_slots (decl, insns); 3593#endif 3594 3595#if defined (HAVE_ATTR_length) && !defined (STACK_REGS) 3596 timevar_push (TV_SHORTEN_BRANCH); 3597 split_all_insns_noflow (); 3598 timevar_pop (TV_SHORTEN_BRANCH); 3599#endif 3600 3601 convert_to_eh_region_ranges (); 3602 3603 /* Shorten branches. */ 3604 timevar_push (TV_SHORTEN_BRANCH); 3605 shorten_branches (get_insns ()); 3606 timevar_pop (TV_SHORTEN_BRANCH); 3607 3608 set_nothrow_function_flags (); 3609 if (current_function_nothrow) 3610 /* Now we know that this can't throw; set the flag for the benefit 3611 of other functions later in this translation unit. */ 3612 TREE_NOTHROW (current_function_decl) = 1; 3613 3614 rest_of_handle_final (decl, insns); 3615 3616 /* Write DBX symbols if requested. */ 3617 3618 /* Note that for those inline functions where we don't initially 3619 know for certain that we will be generating an out-of-line copy, 3620 the first invocation of this routine (rest_of_compilation) will 3621 skip over this code by doing a `goto exit_rest_of_compilation;'. 3622 Later on, wrapup_global_declarations will (indirectly) call 3623 rest_of_compilation again for those inline functions that need 3624 to have out-of-line copies generated. During that call, we 3625 *will* be routed past here. */ 3626 3627 timevar_push (TV_SYMOUT); 3628 (*debug_hooks->function_decl) (decl); 3629 timevar_pop (TV_SYMOUT); 3630 3631 exit_rest_of_compilation: 3632 3633 coverage_end_function (); 3634 3635 /* In case the function was not output, 3636 don't leave any temporary anonymous types 3637 queued up for sdb output. */ 3638#ifdef SDB_DEBUGGING_INFO 3639 if (write_symbols == SDB_DEBUG) 3640 sdbout_types (NULL_TREE); 3641#endif 3642 3643 reload_completed = 0; 3644 epilogue_completed = 0; 3645 flow2_completed = 0; 3646 no_new_pseudos = 0; 3647 3648 timevar_push (TV_FINAL); 3649 3650 /* Clear out the insn_length contents now that they are no 3651 longer valid. */ 3652 init_insn_lengths (); 3653 3654 /* Show no temporary slots allocated. */ 3655 init_temp_slots (); 3656 3657 free_basic_block_vars (0); 3658 free_bb_for_insn (); 3659 3660 timevar_pop (TV_FINAL); 3661 3662 if ((*targetm.binds_local_p) (current_function_decl)) 3663 { 3664 int pref = cfun->preferred_stack_boundary; 3665 if (cfun->recursive_call_emit 3666 && cfun->stack_alignment_needed > cfun->preferred_stack_boundary) 3667 pref = cfun->stack_alignment_needed; 3668 cgraph_rtl_info (current_function_decl)->preferred_incoming_stack_boundary 3669 = pref; 3670 } 3671 3672 /* Make sure volatile mem refs aren't considered valid operands for 3673 arithmetic insns. We must call this here if this is a nested inline 3674 function, since the above code leaves us in the init_recog state 3675 (from final.c), and the function context push/pop code does not 3676 save/restore volatile_ok. 3677 3678 ??? Maybe it isn't necessary for expand_start_function to call this 3679 anymore if we do it here? */ 3680 3681 init_recog_no_volatile (); 3682 3683 /* We're done with this function. Free up memory if we can. */ 3684 free_after_parsing (cfun); 3685 if (! DECL_DEFER_OUTPUT (decl)) 3686 { 3687 free_after_compilation (cfun); 3688 DECL_SAVED_INSNS (decl) = 0; 3689 } 3690 cfun = 0; 3691 3692 ggc_collect (); 3693 3694 timevar_pop (TV_REST_OF_COMPILATION); 3695} 3696 3697/* Display help for target options. */ 3698void 3699display_target_options (void) 3700{ 3701 int undoc, i; 3702 static bool displayed = false; 3703 3704 /* Avoid double printing for --help --target-help. */ 3705 if (displayed) 3706 return; 3707 3708 displayed = true; 3709 3710 if (ARRAY_SIZE (target_switches) > 1 3711#ifdef TARGET_OPTIONS 3712 || ARRAY_SIZE (target_options) > 1 3713#endif 3714 ) 3715 { 3716 int doc = 0; 3717 3718 undoc = 0; 3719 3720 printf (_("\nTarget specific options:\n")); 3721 3722 for (i = ARRAY_SIZE (target_switches); i--;) 3723 { 3724 const char *option = target_switches[i].name; 3725 const char *description = target_switches[i].description; 3726 3727 if (option == NULL || *option == 0) 3728 continue; 3729 else if (description == NULL) 3730 { 3731 undoc = 1; 3732 3733 if (extra_warnings) 3734 printf (_(" -m%-23s [undocumented]\n"), option); 3735 } 3736 else if (*description != 0) 3737 doc += printf (" -m%-23s %s\n", option, _(description)); 3738 } 3739 3740#ifdef TARGET_OPTIONS 3741 for (i = ARRAY_SIZE (target_options); i--;) 3742 { 3743 const char *option = target_options[i].prefix; 3744 const char *description = target_options[i].description; 3745 3746 if (option == NULL || *option == 0) 3747 continue; 3748 else if (description == NULL) 3749 { 3750 undoc = 1; 3751 3752 if (extra_warnings) 3753 printf (_(" -m%-23s [undocumented]\n"), option); 3754 } 3755 else if (*description != 0) 3756 doc += printf (" -m%-23s %s\n", option, _(description)); 3757 } 3758#endif 3759 if (undoc) 3760 { 3761 if (doc) 3762 printf (_("\nThere are undocumented target specific options as well.\n")); 3763 else 3764 printf (_(" They exist, but they are not documented.\n")); 3765 } 3766 } 3767} 3768 3769/* Parse a -d... command line switch. */ 3770 3771void 3772decode_d_option (const char *arg) 3773{ 3774 int i, c, matched; 3775 3776 while (*arg) 3777 switch (c = *arg++) 3778 { 3779 case 'a': 3780 for (i = 0; i < (int) DFI_MAX; ++i) 3781 dump_file[i].enabled = 1; 3782 break; 3783 case 'A': 3784 flag_debug_asm = 1; 3785 break; 3786 case 'p': 3787 flag_print_asm_name = 1; 3788 break; 3789 case 'P': 3790 flag_dump_rtl_in_asm = 1; 3791 flag_print_asm_name = 1; 3792 break; 3793 case 'v': 3794 graph_dump_format = vcg; 3795 break; 3796 case 'x': 3797 rtl_dump_and_exit = 1; 3798 break; 3799 case 'y': 3800 set_yydebug = 1; 3801 break; 3802 case 'D': /* These are handled by the preprocessor. */ 3803 case 'I': 3804 break; 3805 case 'H': 3806 setup_core_dumping(); 3807 break; 3808 3809 default: 3810 matched = 0; 3811 for (i = 0; i < (int) DFI_MAX; ++i) 3812 if (c == dump_file[i].debug_switch) 3813 { 3814 dump_file[i].enabled = 1; 3815 matched = 1; 3816 } 3817 3818 if (! matched) 3819 warning ("unrecognized gcc debugging option: %c", c); 3820 break; 3821 } 3822} 3823 3824/* Indexed by enum debug_info_type. */ 3825const char *const debug_type_names[] = 3826{ 3827 "none", "stabs", "coff", "dwarf-1", "dwarf-2", "xcoff", "vms" 3828}; 3829 3830/* Decode -m switches. */ 3831/* Decode the switch -mNAME. */ 3832 3833void 3834set_target_switch (const char *name) 3835{ 3836 size_t j; 3837 int valid_target_option = 0; 3838 3839 for (j = 0; j < ARRAY_SIZE (target_switches); j++) 3840 if (!strcmp (target_switches[j].name, name)) 3841 { 3842 if (target_switches[j].value < 0) 3843 target_flags &= ~-target_switches[j].value; 3844 else 3845 target_flags |= target_switches[j].value; 3846 if (name[0] != 0) 3847 { 3848 if (target_switches[j].value < 0) 3849 target_flags_explicit |= -target_switches[j].value; 3850 else 3851 target_flags_explicit |= target_switches[j].value; 3852 } 3853 valid_target_option = 1; 3854 } 3855 3856#ifdef TARGET_OPTIONS 3857 if (!valid_target_option) 3858 for (j = 0; j < ARRAY_SIZE (target_options); j++) 3859 { 3860 int len = strlen (target_options[j].prefix); 3861 if (target_options[j].value) 3862 { 3863 if (!strcmp (target_options[j].prefix, name)) 3864 { 3865 *target_options[j].variable = target_options[j].value; 3866 valid_target_option = 1; 3867 } 3868 } 3869 else 3870 { 3871 if (!strncmp (target_options[j].prefix, name, len)) 3872 { 3873 *target_options[j].variable = name + len; 3874 valid_target_option = 1; 3875 } 3876 } 3877 } 3878#endif 3879 3880 if (!valid_target_option) 3881 error ("invalid option `%s'", name); 3882} 3883 3884/* Print version information to FILE. 3885 Each line begins with INDENT (for the case where FILE is the 3886 assembler output file). */ 3887 3888void 3889print_version (FILE *file, const char *indent) 3890{ 3891#ifndef __VERSION__ 3892#define __VERSION__ "[?]" 3893#endif 3894 fnotice (file, 3895#ifdef __GNUC__ 3896 "%s%s%s version %s (%s)\n%s\tcompiled by GNU C version %s.\n" 3897#else 3898 "%s%s%s version %s (%s) compiled by CC.\n" 3899#endif 3900 , indent, *indent != 0 ? " " : "", 3901 lang_hooks.name, version_string, TARGET_NAME, 3902 indent, __VERSION__); 3903 fnotice (file, "%s%sGGC heuristics: --param ggc-min-expand=%d --param ggc-min-heapsize=%d\n", 3904 indent, *indent != 0 ? " " : "", 3905 PARAM_VALUE (GGC_MIN_EXPAND), PARAM_VALUE (GGC_MIN_HEAPSIZE)); 3906} 3907 3908/* Print an option value and return the adjusted position in the line. 3909 ??? We don't handle error returns from fprintf (disk full); presumably 3910 other code will catch a disk full though. */ 3911 3912static int 3913print_single_switch (FILE *file, int pos, int max, 3914 const char *indent, const char *sep, const char *term, 3915 const char *type, const char *name) 3916{ 3917 /* The ultrix fprintf returns 0 on success, so compute the result we want 3918 here since we need it for the following test. */ 3919 int len = strlen (sep) + strlen (type) + strlen (name); 3920 3921 if (pos != 0 3922 && pos + len > max) 3923 { 3924 fprintf (file, "%s", term); 3925 pos = 0; 3926 } 3927 if (pos == 0) 3928 { 3929 fprintf (file, "%s", indent); 3930 pos = strlen (indent); 3931 } 3932 fprintf (file, "%s%s%s", sep, type, name); 3933 pos += len; 3934 return pos; 3935} 3936 3937/* Print active target switches to FILE. 3938 POS is the current cursor position and MAX is the size of a "line". 3939 Each line begins with INDENT and ends with TERM. 3940 Each switch is separated from the next by SEP. */ 3941 3942static void 3943print_switch_values (FILE *file, int pos, int max, 3944 const char *indent, const char *sep, const char *term) 3945{ 3946 size_t j; 3947 const char **p; 3948 3949 /* Fill in the -frandom-seed option, if the user didn't pass it, so 3950 that it can be printed below. This helps reproducibility. */ 3951 randomize (); 3952 3953 /* Print the options as passed. */ 3954 pos = print_single_switch (file, pos, max, indent, *indent ? " " : "", term, 3955 _("options passed: "), ""); 3956 3957 for (p = &save_argv[1]; *p != NULL; p++) 3958 if (**p == '-') 3959 { 3960 /* Ignore these. */ 3961 if (strcmp (*p, "-o") == 0) 3962 { 3963 if (p[1] != NULL) 3964 p++; 3965 continue; 3966 } 3967 if (strcmp (*p, "-quiet") == 0) 3968 continue; 3969 if (strcmp (*p, "-version") == 0) 3970 continue; 3971 if ((*p)[1] == 'd') 3972 continue; 3973 3974 pos = print_single_switch (file, pos, max, indent, sep, term, *p, ""); 3975 } 3976 if (pos > 0) 3977 fprintf (file, "%s", term); 3978 3979 /* Print the -f and -m options that have been enabled. 3980 We don't handle language specific options but printing argv 3981 should suffice. */ 3982 3983 pos = print_single_switch (file, 0, max, indent, *indent ? " " : "", term, 3984 _("options enabled: "), ""); 3985 3986 for (j = 0; j < ARRAY_SIZE (f_options); j++) 3987 if (*f_options[j].variable == f_options[j].on_value) 3988 pos = print_single_switch (file, pos, max, indent, sep, term, 3989 "-f", f_options[j].string); 3990 3991 /* Print target specific options. */ 3992 3993 for (j = 0; j < ARRAY_SIZE (target_switches); j++) 3994 if (target_switches[j].name[0] != '\0' 3995 && target_switches[j].value > 0 3996 && ((target_switches[j].value & target_flags) 3997 == target_switches[j].value)) 3998 { 3999 pos = print_single_switch (file, pos, max, indent, sep, term, 4000 "-m", target_switches[j].name); 4001 } 4002 4003#ifdef TARGET_OPTIONS 4004 for (j = 0; j < ARRAY_SIZE (target_options); j++) 4005 if (*target_options[j].variable != NULL) 4006 { 4007 char prefix[256]; 4008 sprintf (prefix, "-m%s", target_options[j].prefix); 4009 pos = print_single_switch (file, pos, max, indent, sep, term, 4010 prefix, *target_options[j].variable); 4011 } 4012#endif 4013 4014 fprintf (file, "%s", term); 4015} 4016 4017/* Open assembly code output file. Do this even if -fsyntax-only is 4018 on, because then the driver will have provided the name of a 4019 temporary file or bit bucket for us. NAME is the file specified on 4020 the command line, possibly NULL. */ 4021static void 4022init_asm_output (const char *name) 4023{ 4024 if (name == NULL && asm_file_name == 0) 4025 asm_out_file = stdout; 4026 else 4027 { 4028 if (asm_file_name == 0) 4029 { 4030 int len = strlen (dump_base_name); 4031 char *dumpname = xmalloc (len + 6); 4032 memcpy (dumpname, dump_base_name, len + 1); 4033 strip_off_ending (dumpname, len); 4034 strcat (dumpname, ".s"); 4035 asm_file_name = dumpname; 4036 } 4037 if (!strcmp (asm_file_name, "-")) 4038 asm_out_file = stdout; 4039 else 4040 asm_out_file = fopen (asm_file_name, "w+"); 4041 if (asm_out_file == 0) 4042 fatal_error ("can't open %s for writing: %m", asm_file_name); 4043 } 4044 4045#ifdef IO_BUFFER_SIZE 4046 setvbuf (asm_out_file, xmalloc (IO_BUFFER_SIZE), 4047 _IOFBF, IO_BUFFER_SIZE); 4048#endif 4049 4050 if (!flag_syntax_only) 4051 { 4052 targetm.asm_out.file_start (); 4053 4054#ifdef ASM_COMMENT_START 4055 if (flag_verbose_asm) 4056 { 4057 /* Print the list of options in effect. */ 4058 print_version (asm_out_file, ASM_COMMENT_START); 4059 print_switch_values (asm_out_file, 0, MAX_LINE, 4060 ASM_COMMENT_START, " ", "\n"); 4061 /* Add a blank line here so it appears in assembler output but not 4062 screen output. */ 4063 fprintf (asm_out_file, "\n"); 4064 } 4065#endif 4066 } 4067} 4068 4069/* Default version of get_pch_validity. 4070 By default, every flag difference is fatal; that will be mostly right for 4071 most targets, but completely right for very few. */ 4072 4073void * 4074default_get_pch_validity (size_t *len) 4075{ 4076#ifdef TARGET_OPTIONS 4077 size_t i; 4078#endif 4079 char *result, *r; 4080 4081 *len = sizeof (target_flags) + 2; 4082#ifdef TARGET_OPTIONS 4083 for (i = 0; i < ARRAY_SIZE (target_options); i++) 4084 { 4085 *len += 1; 4086 if (*target_options[i].variable) 4087 *len += strlen (*target_options[i].variable); 4088 } 4089#endif 4090 4091 result = r = xmalloc (*len); 4092 r[0] = flag_pic; 4093 r[1] = flag_pie; 4094 r += 2; 4095 memcpy (r, &target_flags, sizeof (target_flags)); 4096 r += sizeof (target_flags); 4097 4098#ifdef TARGET_OPTIONS 4099 for (i = 0; i < ARRAY_SIZE (target_options); i++) 4100 { 4101 const char *str = *target_options[i].variable; 4102 size_t l; 4103 if (! str) 4104 str = ""; 4105 l = strlen (str) + 1; 4106 memcpy (r, str, l); 4107 r += l; 4108 } 4109#endif 4110 4111 return result; 4112} 4113 4114/* Default version of pch_valid_p. */ 4115 4116const char * 4117default_pch_valid_p (const void *data_p, size_t len) 4118{ 4119 const char *data = (const char *)data_p; 4120 const char *flag_that_differs = NULL; 4121 size_t i; 4122 4123 /* -fpic and -fpie also usually make a PCH invalid. */ 4124 if (data[0] != flag_pic) 4125 return _("created and used with different settings of -fpic"); 4126 if (data[1] != flag_pie) 4127 return _("created and used with different settings of -fpie"); 4128 data += 2; 4129 4130 /* Check target_flags. */ 4131 if (memcmp (data, &target_flags, sizeof (target_flags)) != 0) 4132 { 4133 for (i = 0; i < ARRAY_SIZE (target_switches); i++) 4134 { 4135 int bits; 4136 int tf; 4137 4138 memcpy (&tf, data, sizeof (target_flags)); 4139 4140 bits = target_switches[i].value; 4141 if (bits < 0) 4142 bits = -bits; 4143 if ((target_flags & bits) != (tf & bits)) 4144 { 4145 flag_that_differs = target_switches[i].name; 4146 goto make_message; 4147 } 4148 } 4149 abort (); 4150 } 4151 data += sizeof (target_flags); 4152 len -= sizeof (target_flags); 4153 4154 /* Check string options. */ 4155#ifdef TARGET_OPTIONS 4156 for (i = 0; i < ARRAY_SIZE (target_options); i++) 4157 { 4158 const char *str = *target_options[i].variable; 4159 size_t l; 4160 if (! str) 4161 str = ""; 4162 l = strlen (str) + 1; 4163 if (len < l || memcmp (data, str, l) != 0) 4164 { 4165 flag_that_differs = target_options[i].prefix; 4166 goto make_message; 4167 } 4168 data += l; 4169 len -= l; 4170 } 4171#endif 4172 4173 return NULL; 4174 4175 make_message: 4176 { 4177 char *r; 4178 asprintf (&r, _("created and used with differing settings of `-m%s'"), 4179 flag_that_differs); 4180 if (r == NULL) 4181 return _("out of memory"); 4182 return r; 4183 } 4184} 4185 4186/* Default tree printer. Handles declarations only. */ 4187static bool 4188default_tree_printer (pretty_printer * pp, text_info *text) 4189{ 4190 switch (*text->format_spec) 4191 { 4192 case 'D': 4193 case 'F': 4194 case 'T': 4195 { 4196 tree t = va_arg (*text->args_ptr, tree); 4197 const char *n = DECL_NAME (t) 4198 ? (*lang_hooks.decl_printable_name) (t, 2) 4199 : "<anonymous>"; 4200 pp_string (pp, n); 4201 } 4202 return true; 4203 4204 default: 4205 return false; 4206 } 4207} 4208 4209/* Initialization of the front end environment, before command line 4210 options are parsed. Signal handlers, internationalization etc. 4211 ARGV0 is main's argv[0]. */ 4212static void 4213general_init (const char *argv0) 4214{ 4215 const char *p; 4216 4217 p = argv0 + strlen (argv0); 4218 while (p != argv0 && !IS_DIR_SEPARATOR (p[-1])) 4219 --p; 4220 progname = p; 4221 4222 xmalloc_set_program_name (progname); 4223 4224 hex_init (); 4225 4226 gcc_init_libintl (); 4227 4228 /* Initialize the diagnostics reporting machinery, so option parsing 4229 can give warnings and errors. */ 4230 diagnostic_initialize (global_dc); 4231 /* Set a default printer. Language specific initializations will 4232 override it later. */ 4233 pp_format_decoder (global_dc->printer) = &default_tree_printer; 4234 4235 /* Trap fatal signals, e.g. SIGSEGV, and convert them to ICE messages. */ 4236#ifdef SIGSEGV 4237 signal (SIGSEGV, crash_signal); 4238#endif 4239#ifdef SIGILL 4240 signal (SIGILL, crash_signal); 4241#endif 4242#ifdef SIGBUS 4243 signal (SIGBUS, crash_signal); 4244#endif 4245#ifdef SIGABRT 4246 signal (SIGABRT, crash_signal); 4247#endif 4248#if defined SIGIOT && (!defined SIGABRT || SIGABRT != SIGIOT) 4249 signal (SIGIOT, crash_signal); 4250#endif 4251#ifdef SIGFPE 4252 signal (SIGFPE, crash_signal); 4253#endif 4254 4255 /* Other host-specific signal setup. */ 4256 (*host_hooks.extra_signals)(); 4257 4258 /* Initialize the garbage-collector, string pools and tree type hash 4259 table. */ 4260 init_ggc (); 4261 init_stringpool (); 4262 init_ttree (); 4263 4264 /* Initialize register usage now so switches may override. */ 4265 init_reg_sets (); 4266 4267 /* Register the language-independent parameters. */ 4268 add_params (lang_independent_params, LAST_PARAM); 4269 4270 /* This must be done after add_params but before argument processing. */ 4271 init_ggc_heuristics(); 4272} 4273 4274/* Process the options that have been parsed. */ 4275static void 4276process_options (void) 4277{ 4278 /* Allow the front end to perform consistency checks and do further 4279 initialization based on the command line options. This hook also 4280 sets the original filename if appropriate (e.g. foo.i -> foo.c) 4281 so we can correctly initialize debug output. */ 4282 no_backend = (*lang_hooks.post_options) (&main_input_filename); 4283 input_filename = main_input_filename; 4284 4285#ifdef OVERRIDE_OPTIONS 4286 /* Some machines may reject certain combinations of options. */ 4287 OVERRIDE_OPTIONS; 4288#endif 4289 4290 /* Set aux_base_name if not already set. */ 4291 if (aux_base_name) 4292 ; 4293 else if (main_input_filename) 4294 { 4295 char *name = xstrdup (lbasename (main_input_filename)); 4296 4297 strip_off_ending (name, strlen (name)); 4298 aux_base_name = name; 4299 } 4300 else 4301 aux_base_name = "gccaux"; 4302 4303 /* Set up the align_*_log variables, defaulting them to 1 if they 4304 were still unset. */ 4305 if (align_loops <= 0) align_loops = 1; 4306 if (align_loops_max_skip > align_loops || !align_loops) 4307 align_loops_max_skip = align_loops - 1; 4308 align_loops_log = floor_log2 (align_loops * 2 - 1); 4309 if (align_jumps <= 0) align_jumps = 1; 4310 if (align_jumps_max_skip > align_jumps || !align_jumps) 4311 align_jumps_max_skip = align_jumps - 1; 4312 align_jumps_log = floor_log2 (align_jumps * 2 - 1); 4313 if (align_labels <= 0) align_labels = 1; 4314 align_labels_log = floor_log2 (align_labels * 2 - 1); 4315 if (align_labels_max_skip > align_labels || !align_labels) 4316 align_labels_max_skip = align_labels - 1; 4317 if (align_functions <= 0) align_functions = 1; 4318 align_functions_log = floor_log2 (align_functions * 2 - 1); 4319 4320 /* Unrolling all loops implies that standard loop unrolling must also 4321 be done. */ 4322 if (flag_unroll_all_loops) 4323 flag_unroll_loops = 1; 4324 4325 if (flag_unroll_loops) 4326 { 4327 flag_old_unroll_loops = 0; 4328 flag_old_unroll_all_loops = 0; 4329 } 4330 4331 if (flag_old_unroll_all_loops) 4332 flag_old_unroll_loops = 1; 4333 4334 /* Old loop unrolling requires that strength_reduction be on also. Silently 4335 turn on strength reduction here if it isn't already on. Also, the loop 4336 unrolling code assumes that cse will be run after loop, so that must 4337 be turned on also. */ 4338 if (flag_old_unroll_loops) 4339 { 4340 flag_strength_reduce = 1; 4341 flag_rerun_cse_after_loop = 1; 4342 } 4343 if (flag_unroll_loops || flag_peel_loops) 4344 flag_rerun_cse_after_loop = 1; 4345 4346 if (flag_non_call_exceptions) 4347 flag_asynchronous_unwind_tables = 1; 4348 if (flag_asynchronous_unwind_tables) 4349 flag_unwind_tables = 1; 4350 4351 /* Disable unit-at-a-time mode for frontends not supporting callgraph 4352 interface. */ 4353 if (flag_unit_at_a_time && ! lang_hooks.callgraph.expand_function) 4354 flag_unit_at_a_time = 0; 4355 4356 if (flag_value_profile_transformations) 4357 flag_profile_values = 1; 4358 4359 /* Warn about options that are not supported on this machine. */ 4360#ifndef INSN_SCHEDULING 4361 if (flag_schedule_insns || flag_schedule_insns_after_reload) 4362 warning ("instruction scheduling not supported on this target machine"); 4363#endif 4364#ifndef DELAY_SLOTS 4365 if (flag_delayed_branch) 4366 warning ("this target machine does not have delayed branches"); 4367#endif 4368 4369 user_label_prefix = USER_LABEL_PREFIX; 4370 if (flag_leading_underscore != -1) 4371 { 4372 /* If the default prefix is more complicated than "" or "_", 4373 issue a warning and ignore this option. */ 4374 if (user_label_prefix[0] == 0 || 4375 (user_label_prefix[0] == '_' && user_label_prefix[1] == 0)) 4376 { 4377 user_label_prefix = flag_leading_underscore ? "_" : ""; 4378 } 4379 else 4380 warning ("-f%sleading-underscore not supported on this target machine", 4381 flag_leading_underscore ? "" : "no-"); 4382 } 4383 4384 /* If we are in verbose mode, write out the version and maybe all the 4385 option flags in use. */ 4386 if (version_flag) 4387 { 4388 print_version (stderr, ""); 4389 if (! quiet_flag) 4390 print_switch_values (stderr, 0, MAX_LINE, "", " ", "\n"); 4391 } 4392 4393 if (flag_syntax_only) 4394 { 4395 write_symbols = NO_DEBUG; 4396 profile_flag = 0; 4397 } 4398 4399 /* A lot of code assumes write_symbols == NO_DEBUG if the debugging 4400 level is 0. */ 4401 if (debug_info_level == DINFO_LEVEL_NONE) 4402 write_symbols = NO_DEBUG; 4403 4404 /* Now we know write_symbols, set up the debug hooks based on it. 4405 By default we do nothing for debug output. */ 4406 if (write_symbols == NO_DEBUG) 4407 debug_hooks = &do_nothing_debug_hooks; 4408#if defined(DBX_DEBUGGING_INFO) 4409 else if (write_symbols == DBX_DEBUG) 4410 debug_hooks = &dbx_debug_hooks; 4411#endif 4412#if defined(XCOFF_DEBUGGING_INFO) 4413 else if (write_symbols == XCOFF_DEBUG) 4414 debug_hooks = &xcoff_debug_hooks; 4415#endif 4416#ifdef SDB_DEBUGGING_INFO 4417 else if (write_symbols == SDB_DEBUG) 4418 debug_hooks = &sdb_debug_hooks; 4419#endif 4420#ifdef DWARF2_DEBUGGING_INFO 4421 else if (write_symbols == DWARF2_DEBUG) 4422 debug_hooks = &dwarf2_debug_hooks; 4423#endif 4424#ifdef VMS_DEBUGGING_INFO 4425 else if (write_symbols == VMS_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG) 4426 debug_hooks = &vmsdbg_debug_hooks; 4427#endif 4428 else 4429 error ("target system does not support the \"%s\" debug format", 4430 debug_type_names[write_symbols]); 4431 4432 /* If auxiliary info generation is desired, open the output file. 4433 This goes in the same directory as the source file--unlike 4434 all the other output files. */ 4435 if (flag_gen_aux_info) 4436 { 4437 aux_info_file = fopen (aux_info_file_name, "w"); 4438 if (aux_info_file == 0) 4439 fatal_error ("can't open %s: %m", aux_info_file_name); 4440 } 4441 4442 if (! targetm.have_named_sections) 4443 { 4444 if (flag_function_sections) 4445 { 4446 warning ("-ffunction-sections not supported for this target"); 4447 flag_function_sections = 0; 4448 } 4449 if (flag_data_sections) 4450 { 4451 warning ("-fdata-sections not supported for this target"); 4452 flag_data_sections = 0; 4453 } 4454 } 4455 4456 if (flag_function_sections && profile_flag) 4457 { 4458 warning ("-ffunction-sections disabled; it makes profiling impossible"); 4459 flag_function_sections = 0; 4460 } 4461 4462#ifndef HAVE_prefetch 4463 if (flag_prefetch_loop_arrays) 4464 { 4465 warning ("-fprefetch-loop-arrays not supported for this target"); 4466 flag_prefetch_loop_arrays = 0; 4467 } 4468#else 4469 if (flag_prefetch_loop_arrays && !HAVE_prefetch) 4470 { 4471 warning ("-fprefetch-loop-arrays not supported for this target (try -march switches)"); 4472 flag_prefetch_loop_arrays = 0; 4473 } 4474#endif 4475 4476 /* This combination of options isn't handled for i386 targets and doesn't 4477 make much sense anyway, so don't allow it. */ 4478 if (flag_prefetch_loop_arrays && optimize_size) 4479 { 4480 warning ("-fprefetch-loop-arrays is not supported with -Os"); 4481 flag_prefetch_loop_arrays = 0; 4482 } 4483 4484#ifndef OBJECT_FORMAT_ELF 4485 if (flag_function_sections && write_symbols != NO_DEBUG) 4486 warning ("-ffunction-sections may affect debugging on some targets"); 4487#endif 4488 4489 /* The presence of IEEE signaling NaNs, implies all math can trap. */ 4490 if (flag_signaling_nans) 4491 flag_trapping_math = 1; 4492} 4493 4494/* Initialize the compiler back end. */ 4495static void 4496backend_init (void) 4497{ 4498 init_adjust_machine_modes (); 4499 4500 init_emit_once (debug_info_level == DINFO_LEVEL_NORMAL 4501 || debug_info_level == DINFO_LEVEL_VERBOSE 4502#ifdef VMS_DEBUGGING_INFO 4503 /* Enable line number info for traceback. */ 4504 || debug_info_level > DINFO_LEVEL_NONE 4505#endif 4506 || flag_test_coverage 4507 || warn_notreached); 4508 4509 init_regs (); 4510 init_fake_stack_mems (); 4511 init_alias_once (); 4512 init_loop (); 4513 init_reload (); 4514 init_function_once (); 4515 init_varasm_once (); 4516 4517 /* The following initialization functions need to generate rtl, so 4518 provide a dummy function context for them. */ 4519 init_dummy_function_start (); 4520 init_expmed (); 4521 if (flag_caller_saves) 4522 init_caller_save (); 4523 expand_dummy_function_end (); 4524} 4525 4526/* Language-dependent initialization. Returns nonzero on success. */ 4527static int 4528lang_dependent_init (const char *name) 4529{ 4530 if (dump_base_name == 0) 4531 dump_base_name = name ? name : "gccdump"; 4532 4533 /* Other front-end initialization. */ 4534 if ((*lang_hooks.init) () == 0) 4535 return 0; 4536 4537 init_asm_output (name); 4538 4539 /* These create various _DECL nodes, so need to be called after the 4540 front end is initialized. */ 4541 init_eh (); 4542 init_optabs (); 4543 4544 /* The following initialization functions need to generate rtl, so 4545 provide a dummy function context for them. */ 4546 init_dummy_function_start (); 4547 init_expr_once (); 4548 expand_dummy_function_end (); 4549 4550 /* If dbx symbol table desired, initialize writing it and output the 4551 predefined types. */ 4552 timevar_push (TV_SYMOUT); 4553 4554#ifdef DWARF2_UNWIND_INFO 4555 if (dwarf2out_do_frame ()) 4556 dwarf2out_frame_init (); 4557#endif 4558 4559 /* Now we have the correct original filename, we can initialize 4560 debug output. */ 4561 (*debug_hooks->init) (name); 4562 4563 timevar_pop (TV_SYMOUT); 4564 4565 return 1; 4566} 4567 4568/* Clean up: close opened files, etc. */ 4569 4570static void 4571finalize (void) 4572{ 4573 /* Close the dump files. */ 4574 if (flag_gen_aux_info) 4575 { 4576 fclose (aux_info_file); 4577 if (errorcount) 4578 unlink (aux_info_file_name); 4579 } 4580 4581 /* Close non-debugging input and output files. Take special care to note 4582 whether fclose returns an error, since the pages might still be on the 4583 buffer chain while the file is open. */ 4584 4585 if (asm_out_file) 4586 { 4587 if (ferror (asm_out_file) != 0) 4588 fatal_error ("error writing to %s: %m", asm_file_name); 4589 if (fclose (asm_out_file) != 0) 4590 fatal_error ("error closing %s: %m", asm_file_name); 4591 } 4592 4593 /* Do whatever is necessary to finish printing the graphs. */ 4594 if (graph_dump_format != no_graph) 4595 { 4596 int i; 4597 4598 for (i = 0; i < (int) DFI_MAX; ++i) 4599 if (dump_file[i].initialized && dump_file[i].graph_dump_p) 4600 { 4601 char seq[16]; 4602 char *suffix; 4603 4604 sprintf (seq, DUMPFILE_FORMAT, i); 4605 suffix = concat (seq, dump_file[i].extension, NULL); 4606 finish_graph_dump_file (dump_base_name, suffix); 4607 free (suffix); 4608 } 4609 } 4610 4611 if (mem_report) 4612 { 4613 ggc_print_statistics (); 4614 stringpool_statistics (); 4615 dump_tree_statistics (); 4616 dump_rtx_statistics (); 4617 dump_varray_statistics (); 4618 dump_alloc_pool_statistics (); 4619 } 4620 4621 /* Free up memory for the benefit of leak detectors. */ 4622 free_reg_info (); 4623 4624 /* Language-specific end of compilation actions. */ 4625 (*lang_hooks.finish) (); 4626} 4627 4628/* Initialize the compiler, and compile the input file. */ 4629static void 4630do_compile (void) 4631{ 4632 /* Initialize timing first. The C front ends read the main file in 4633 the post_options hook, and C++ does file timings. */ 4634 if (time_report || !quiet_flag || flag_detailed_statistics) 4635 timevar_init (); 4636 timevar_start (TV_TOTAL); 4637 4638 process_options (); 4639 4640 /* Don't do any more if an error has already occurred. */ 4641 if (!errorcount) 4642 { 4643 /* Set up the back-end if requested. */ 4644 if (!no_backend) 4645 backend_init (); 4646 4647 /* Language-dependent initialization. Returns true on success. */ 4648 if (lang_dependent_init (main_input_filename)) 4649 { 4650 if (flag_unit_at_a_time) 4651 { 4652 open_dump_file (DFI_cgraph, NULL); 4653 cgraph_dump_file = rtl_dump_file; 4654 rtl_dump_file = NULL; 4655 } 4656 4657 compile_file (); 4658 4659 if (flag_unit_at_a_time) 4660 { 4661 rtl_dump_file = cgraph_dump_file; 4662 cgraph_dump_file = NULL; 4663 close_dump_file (DFI_cgraph, NULL, NULL_RTX); 4664 } 4665 } 4666 4667 finalize (); 4668 } 4669 4670 /* Stop timing and print the times. */ 4671 timevar_stop (TV_TOTAL); 4672 timevar_print (stderr); 4673} 4674 4675/* Entry point of cc1, cc1plus, jc1, f771, etc. 4676 Exit code is FATAL_EXIT_CODE if can't open files or if there were 4677 any errors, or SUCCESS_EXIT_CODE if compilation succeeded. 4678 4679 It is not safe to call this function more than once. */ 4680 4681int 4682toplev_main (unsigned int argc, const char **argv) 4683{ 4684 save_argv = argv; 4685 4686 /* Initialization of GCC's environment, and diagnostics. */ 4687 general_init (argv[0]); 4688 4689 /* Parse the options and do minimal processing; basically just 4690 enough to default flags appropriately. */ 4691 decode_options (argc, argv); 4692 4693 randomize (); 4694 4695 /* Exit early if we can (e.g. -help). */ 4696 if (!exit_after_options) 4697 do_compile (); 4698 4699 if (errorcount || sorrycount) 4700 return (FATAL_EXIT_CODE); 4701 4702 return (SUCCESS_EXIT_CODE); 4703} 4704