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