Line data Source code
1 : /* Convert RTL to assembler code and output it, for GNU compiler.
2 : Copyright (C) 1987-2026 Free Software Foundation, Inc.
3 :
4 : This file is part of GCC.
5 :
6 : GCC is free software; you can redistribute it and/or modify it under
7 : the terms of the GNU General Public License as published by the Free
8 : Software Foundation; either version 3, or (at your option) any later
9 : version.
10 :
11 : GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 : WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 : FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 : for more details.
15 :
16 : You should have received a copy of the GNU General Public License
17 : along with GCC; see the file COPYING3. If not see
18 : <http://www.gnu.org/licenses/>. */
19 :
20 : /* This is the final pass of the compiler.
21 : It looks at the rtl code for a function and outputs assembler code.
22 :
23 : Call `final_start_function' to output the assembler code for function entry,
24 : `final' to output assembler code for some RTL code,
25 : `final_end_function' to output assembler code for function exit.
26 : If a function is compiled in several pieces, each piece is
27 : output separately with `final'.
28 :
29 : Some optimizations are also done at this level.
30 : Move instructions that were made unnecessary by good register allocation
31 : are detected and omitted from the output. (Though most of these
32 : are removed by the last jump pass.)
33 :
34 : Instructions to set the condition codes are omitted when it can be
35 : seen that the condition codes already had the desired values.
36 :
37 : In some cases it is sufficient if the inherited condition codes
38 : have related values, but this may require the following insn
39 : (the one that tests the condition codes) to be modified.
40 :
41 : The code for the function prologue and epilogue are generated
42 : directly in assembler by the target functions function_prologue and
43 : function_epilogue. Those instructions never exist as rtl. */
44 :
45 : #include "config.h"
46 : #define INCLUDE_ALGORITHM /* reverse */
47 : #include "system.h"
48 : #include "coretypes.h"
49 : #include "backend.h"
50 : #include "target.h"
51 : #include "rtl.h"
52 : #include "tree.h"
53 : #include "cfghooks.h"
54 : #include "df.h"
55 : #include "memmodel.h"
56 : #include "tm_p.h"
57 : #include "insn-config.h"
58 : #include "regs.h"
59 : #include "emit-rtl.h"
60 : #include "recog.h"
61 : #include "cgraph.h"
62 : #include "tree-pretty-print.h" /* for dump_function_header */
63 : #include "varasm.h"
64 : #include "insn-attr.h"
65 : #include "conditions.h"
66 : #include "flags.h"
67 : #include "output.h"
68 : #include "except.h"
69 : #include "rtl-error.h"
70 : #include "toplev.h" /* exact_log2, floor_log2 */
71 : #include "reload.h"
72 : #include "intl.h"
73 : #include "cfgrtl.h"
74 : #include "debug.h"
75 : #include "tree-pass.h"
76 : #include "tree-ssa.h"
77 : #include "cfgloop.h"
78 : #include "stringpool.h"
79 : #include "attribs.h"
80 : #include "asan.h"
81 : #include "rtl-iter.h"
82 : #include "print-rtl.h"
83 : #include "function-abi.h"
84 : #include "common/common-target.h"
85 : #include "diagnostic.h"
86 : #include "diagnostics/file-cache.h"
87 :
88 : #include "dwarf2out.h"
89 :
90 : /* Most ports don't need to define CC_STATUS_INIT.
91 : So define a null default for it to save conditionalization later. */
92 : #ifndef CC_STATUS_INIT
93 : #define CC_STATUS_INIT
94 : #endif
95 :
96 : /* Is the given character a logical line separator for the assembler? */
97 : #ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
98 : #define IS_ASM_LOGICAL_LINE_SEPARATOR(C, STR) ((C) == ';')
99 : #endif
100 :
101 : #ifndef JUMP_TABLES_IN_TEXT_SECTION
102 : #define JUMP_TABLES_IN_TEXT_SECTION 0
103 : #endif
104 :
105 : /* Bitflags used by final_scan_insn. */
106 : #define SEEN_NOTE 1
107 : #define SEEN_EMITTED 2
108 : #define SEEN_NEXT_VIEW 4
109 :
110 : /* Last insn processed by final_scan_insn. */
111 : static rtx_insn *debug_insn;
112 : rtx_insn *current_output_insn;
113 :
114 : /* Line number of last NOTE. */
115 : static int last_linenum;
116 :
117 : /* Column number of last NOTE. */
118 : static int last_columnnum;
119 :
120 : /* Discriminator written to assembly. */
121 : static int last_discriminator;
122 :
123 : /* Compute discriminator to be written to assembly for current instruction.
124 : Note: actual usage depends on loc_discriminator_kind setting. */
125 : static inline int compute_discriminator (location_t loc);
126 :
127 : /* Highest line number in current block. */
128 : static int high_block_linenum;
129 :
130 : /* Likewise for function. */
131 : static int high_function_linenum;
132 :
133 : /* Filename of last NOTE. */
134 : static const char *last_filename;
135 :
136 : /* Whether to force emission of a line note before the next insn. */
137 : static bool force_source_line = false;
138 :
139 : extern const int length_unit_log; /* This is defined in insn-attrtab.cc. */
140 :
141 : /* Nonzero while outputting an `asm' with operands.
142 : This means that inconsistencies are the user's fault, so don't die.
143 : The precise value is the insn being output, to pass to error_for_asm. */
144 : const rtx_insn *this_is_asm_operands;
145 :
146 : /* Number of operands of this insn, for an `asm' with operands. */
147 : unsigned int insn_noperands;
148 :
149 : /* Compare optimization flag. */
150 :
151 : static rtx last_ignored_compare = 0;
152 :
153 : /* Assign a unique number to each insn that is output.
154 : This can be used to generate unique local labels. */
155 :
156 : static int insn_counter = 0;
157 :
158 : /* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
159 :
160 : static int block_depth;
161 :
162 : /* True if have enabled APP processing of our assembler output. */
163 :
164 : static bool app_on;
165 :
166 : /* If we are outputting an insn sequence, this contains the sequence rtx.
167 : Zero otherwise. */
168 :
169 : rtx_sequence *final_sequence;
170 :
171 : #ifdef ASSEMBLER_DIALECT
172 :
173 : /* Number of the assembler dialect to use, starting at 0. */
174 : static int dialect_number;
175 : #endif
176 :
177 : /* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
178 : rtx current_insn_predicate;
179 :
180 : /* True if printing into -fdump-final-insns= dump. */
181 : bool final_insns_dump_p;
182 :
183 : /* True if profile_function should be called, but hasn't been called yet. */
184 : static bool need_profile_function;
185 :
186 : static int asm_insn_count (rtx);
187 : static void profile_function (FILE *);
188 : static void profile_after_prologue (FILE *);
189 : static bool notice_source_line (rtx_insn *, bool *);
190 : static rtx walk_alter_subreg (rtx *, bool *);
191 : static void output_asm_name (void);
192 : static void output_alternate_entry_point (FILE *, rtx_insn *);
193 : static tree get_mem_expr_from_op (rtx, int *);
194 : static void output_asm_operand_names (rtx *, int *, int);
195 : #ifdef LEAF_REGISTERS
196 : static void leaf_renumber_regs (rtx_insn *);
197 : #endif
198 : static int align_fuzz (rtx, rtx, int, unsigned);
199 : static void collect_fn_hard_reg_usage (void);
200 :
201 : /* Initialize data in final at the beginning of a compilation. */
202 :
203 : void
204 286590 : init_final (const char *filename ATTRIBUTE_UNUSED)
205 : {
206 286590 : app_on = 0;
207 286590 : final_sequence = 0;
208 :
209 : #ifdef ASSEMBLER_DIALECT
210 286590 : dialect_number = ASSEMBLER_DIALECT;
211 : #endif
212 286590 : }
213 :
214 : /* Default target function prologue and epilogue assembler output.
215 :
216 : If not overridden for epilogue code, then the function body itself
217 : contains return instructions wherever needed. */
218 : void
219 1520620 : default_function_pro_epilogue (FILE *)
220 : {
221 1520620 : }
222 :
223 : void
224 65794 : default_function_switched_text_sections (FILE *file ATTRIBUTE_UNUSED,
225 : tree decl ATTRIBUTE_UNUSED,
226 : bool new_is_cold ATTRIBUTE_UNUSED)
227 : {
228 65794 : }
229 :
230 : /* Default target hook that outputs nothing to a stream. */
231 : void
232 3133463 : no_asm_to_stream (FILE *file ATTRIBUTE_UNUSED)
233 : {
234 3133463 : }
235 :
236 : /* Enable APP processing of subsequent output.
237 : Used before the output from an `asm' statement. */
238 :
239 : void
240 33694 : app_enable (void)
241 : {
242 33694 : if (! app_on)
243 : {
244 30443 : fputs (ASM_APP_ON, asm_out_file);
245 30443 : app_on = 1;
246 : }
247 33694 : }
248 :
249 : /* Disable APP processing of subsequent output.
250 : Called from varasm.cc before most kinds of output. */
251 :
252 : void
253 158737315 : app_disable (void)
254 : {
255 158737315 : if (app_on)
256 : {
257 29350 : fputs (ASM_APP_OFF, asm_out_file);
258 29350 : app_on = 0;
259 : }
260 158737315 : }
261 :
262 : /* Return the number of slots filled in the current
263 : delayed branch sequence (we don't count the insn needing the
264 : delay slot). Zero if not in a delayed branch sequence. */
265 :
266 : int
267 0 : dbr_sequence_length (void)
268 : {
269 0 : if (final_sequence != 0)
270 0 : return XVECLEN (final_sequence, 0) - 1;
271 : else
272 : return 0;
273 : }
274 :
275 : /* The next two pages contain routines used to compute the length of an insn
276 : and to shorten branches. */
277 :
278 : /* Arrays for insn lengths, and addresses. The latter is referenced by
279 : `insn_current_length'. */
280 :
281 : static int *insn_lengths;
282 :
283 : vec<int> insn_addresses_;
284 :
285 : /* Max uid for which the above arrays are valid. */
286 : static int insn_lengths_max_uid;
287 :
288 : /* Address of insn being processed. Used by `insn_current_length'. */
289 : int insn_current_address;
290 :
291 : /* Address of insn being processed in previous iteration. */
292 : int insn_last_address;
293 :
294 : /* known invariant alignment of insn being processed. */
295 : int insn_current_align;
296 :
297 : /* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
298 : gives the next following alignment insn that increases the known
299 : alignment, or NULL_RTX if there is no such insn.
300 : For any alignment obtained this way, we can again index uid_align with
301 : its uid to obtain the next following align that in turn increases the
302 : alignment, till we reach NULL_RTX; the sequence obtained this way
303 : for each insn we'll call the alignment chain of this insn in the following
304 : comments. */
305 :
306 : static rtx *uid_align;
307 : static int *uid_shuid;
308 : static vec<align_flags> label_align;
309 :
310 : /* Indicate that branch shortening hasn't yet been done. */
311 :
312 : void
313 1521432 : init_insn_lengths (void)
314 : {
315 1521432 : if (uid_shuid)
316 : {
317 1517018 : free (uid_shuid);
318 1517018 : uid_shuid = 0;
319 : }
320 1521432 : if (insn_lengths)
321 : {
322 1517018 : free (insn_lengths);
323 1517018 : insn_lengths = 0;
324 1517018 : insn_lengths_max_uid = 0;
325 : }
326 1521432 : if (HAVE_ATTR_length)
327 1521432 : INSN_ADDRESSES_FREE ();
328 1521432 : if (uid_align)
329 : {
330 1517018 : free (uid_align);
331 1517018 : uid_align = 0;
332 : }
333 1521432 : }
334 :
335 : /* Obtain the current length of an insn. If branch shortening has been done,
336 : get its actual length. Otherwise, use FALLBACK_FN to calculate the
337 : length. */
338 : static int
339 405215326 : get_attr_length_1 (rtx_insn *insn, int (*fallback_fn) (rtx_insn *))
340 : {
341 405215326 : rtx body;
342 405215326 : int i;
343 405215326 : int length = 0;
344 :
345 405215326 : if (!HAVE_ATTR_length)
346 : return 0;
347 :
348 405215326 : if (insn_lengths_max_uid > INSN_UID (insn))
349 3402 : return insn_lengths[INSN_UID (insn)];
350 : else
351 405211924 : switch (GET_CODE (insn))
352 : {
353 : case NOTE:
354 : case BARRIER:
355 : case CODE_LABEL:
356 : case DEBUG_INSN:
357 : return 0;
358 :
359 9809275 : case CALL_INSN:
360 9809275 : case JUMP_INSN:
361 9809275 : body = PATTERN (insn);
362 9809275 : if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
363 165 : length = asm_insn_count (body) * fallback_fn (insn);
364 : else
365 9809110 : length = fallback_fn (insn);
366 : break;
367 :
368 383416589 : case INSN:
369 383416589 : body = PATTERN (insn);
370 383416589 : if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
371 : return 0;
372 :
373 383073938 : else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
374 7829 : length = asm_insn_count (body) * fallback_fn (insn);
375 383066109 : else if (rtx_sequence *seq = dyn_cast <rtx_sequence *> (body))
376 0 : for (i = 0; i < seq->len (); i++)
377 0 : length += get_attr_length_1 (seq->insn (i), fallback_fn);
378 : else
379 383066109 : length = fallback_fn (insn);
380 : break;
381 :
382 : default:
383 : break;
384 : }
385 :
386 : #ifdef ADJUST_INSN_LENGTH
387 : ADJUST_INSN_LENGTH (insn, length);
388 : #endif
389 : return length;
390 : }
391 :
392 : /* Obtain the current length of an insn. If branch shortening has been done,
393 : get its actual length. Otherwise, get its maximum length. */
394 : int
395 385562586 : get_attr_length (rtx_insn *insn)
396 : {
397 385562586 : return get_attr_length_1 (insn, insn_default_length);
398 : }
399 :
400 : /* Obtain the current length of an insn. If branch shortening has been done,
401 : get its actual length. Otherwise, get its minimum length. */
402 : int
403 19652740 : get_attr_min_length (rtx_insn *insn)
404 : {
405 19652740 : return get_attr_length_1 (insn, insn_min_length);
406 : }
407 :
408 : /* Code to handle alignment inside shorten_branches. */
409 :
410 : /* Here is an explanation how the algorithm in align_fuzz can give
411 : proper results:
412 :
413 : Call a sequence of instructions beginning with alignment point X
414 : and continuing until the next alignment point `block X'. When `X'
415 : is used in an expression, it means the alignment value of the
416 : alignment point.
417 :
418 : Call the distance between the start of the first insn of block X, and
419 : the end of the last insn of block X `IX', for the `inner size of X'.
420 : This is clearly the sum of the instruction lengths.
421 :
422 : Likewise with the next alignment-delimited block following X, which we
423 : shall call block Y.
424 :
425 : Call the distance between the start of the first insn of block X, and
426 : the start of the first insn of block Y `OX', for the `outer size of X'.
427 :
428 : The estimated padding is then OX - IX.
429 :
430 : OX can be safely estimated as
431 :
432 : if (X >= Y)
433 : OX = round_up(IX, Y)
434 : else
435 : OX = round_up(IX, X) + Y - X
436 :
437 : Clearly est(IX) >= real(IX), because that only depends on the
438 : instruction lengths, and those being overestimated is a given.
439 :
440 : Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
441 : we needn't worry about that when thinking about OX.
442 :
443 : When X >= Y, the alignment provided by Y adds no uncertainty factor
444 : for branch ranges starting before X, so we can just round what we have.
445 : But when X < Y, we don't know anything about the, so to speak,
446 : `middle bits', so we have to assume the worst when aligning up from an
447 : address mod X to one mod Y, which is Y - X. */
448 :
449 : #ifndef LABEL_ALIGN
450 : #define LABEL_ALIGN(LABEL) align_labels
451 : #endif
452 :
453 : #ifndef LOOP_ALIGN
454 : #define LOOP_ALIGN(LABEL) align_loops
455 : #endif
456 :
457 : #ifndef LABEL_ALIGN_AFTER_BARRIER
458 : #define LABEL_ALIGN_AFTER_BARRIER(LABEL) 0
459 : #endif
460 :
461 : #ifndef JUMP_ALIGN
462 : #define JUMP_ALIGN(LABEL) align_jumps
463 : #endif
464 :
465 : #ifndef ADDR_VEC_ALIGN
466 : static int
467 6892 : final_addr_vec_align (rtx_jump_table_data *addr_vec)
468 : {
469 6892 : int align = GET_MODE_SIZE (addr_vec->get_data_mode ());
470 :
471 13689 : if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
472 0 : align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
473 6892 : return exact_log2 (align);
474 :
475 : }
476 :
477 : #define ADDR_VEC_ALIGN(ADDR_VEC) final_addr_vec_align (ADDR_VEC)
478 : #endif
479 :
480 : #ifndef INSN_LENGTH_ALIGNMENT
481 : #define INSN_LENGTH_ALIGNMENT(INSN) length_unit_log
482 : #endif
483 :
484 : #define INSN_SHUID(INSN) (uid_shuid[INSN_UID (INSN)])
485 :
486 : static int min_labelno, max_labelno;
487 :
488 : #define LABEL_TO_ALIGNMENT(LABEL) \
489 : (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno])
490 :
491 : /* For the benefit of port specific code do this also as a function. */
492 :
493 : align_flags
494 954 : label_to_alignment (rtx label)
495 : {
496 954 : if (CODE_LABEL_NUMBER (label) <= max_labelno)
497 954 : return LABEL_TO_ALIGNMENT (label);
498 0 : return align_flags ();
499 : }
500 :
501 : /* The differences in addresses
502 : between a branch and its target might grow or shrink depending on
503 : the alignment the start insn of the range (the branch for a forward
504 : branch or the label for a backward branch) starts out on; if these
505 : differences are used naively, they can even oscillate infinitely.
506 : We therefore want to compute a 'worst case' address difference that
507 : is independent of the alignment the start insn of the range end
508 : up on, and that is at least as large as the actual difference.
509 : The function align_fuzz calculates the amount we have to add to the
510 : naively computed difference, by traversing the part of the alignment
511 : chain of the start insn of the range that is in front of the end insn
512 : of the range, and considering for each alignment the maximum amount
513 : that it might contribute to a size increase.
514 :
515 : For casesi tables, we also want to know worst case minimum amounts of
516 : address difference, in case a machine description wants to introduce
517 : some common offset that is added to all offsets in a table.
518 : For this purpose, align_fuzz with a growth argument of 0 computes the
519 : appropriate adjustment. */
520 :
521 : /* Compute the maximum delta by which the difference of the addresses of
522 : START and END might grow / shrink due to a different address for start
523 : which changes the size of alignment insns between START and END.
524 : KNOWN_ALIGN_LOG is the alignment known for START.
525 : GROWTH should be ~0 if the objective is to compute potential code size
526 : increase, and 0 if the objective is to compute potential shrink.
527 : The return value is undefined for any other value of GROWTH. */
528 :
529 : static int
530 28744898 : align_fuzz (rtx start, rtx end, int known_align_log, unsigned int growth)
531 : {
532 28744898 : int uid = INSN_UID (start);
533 28744898 : rtx align_label;
534 28744898 : int known_align = 1 << known_align_log;
535 28744898 : int end_shuid = INSN_SHUID (end);
536 28744898 : int fuzz = 0;
537 :
538 42278624 : for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
539 : {
540 16381611 : int align_addr, new_align;
541 :
542 16381611 : uid = INSN_UID (align_label);
543 16381611 : align_addr = INSN_ADDRESSES (uid) - insn_lengths[uid];
544 16381611 : if (uid_shuid[uid] > end_shuid)
545 : break;
546 13533726 : align_flags alignment = LABEL_TO_ALIGNMENT (align_label);
547 13533726 : new_align = 1 << alignment.levels[0].log;
548 13533726 : if (new_align < known_align)
549 0 : continue;
550 13533726 : fuzz += (-align_addr ^ growth) & (new_align - known_align);
551 13533726 : known_align = new_align;
552 : }
553 28744898 : return fuzz;
554 : }
555 :
556 : /* Compute a worst-case reference address of a branch so that it
557 : can be safely used in the presence of aligned labels. Since the
558 : size of the branch itself is unknown, the size of the branch is
559 : not included in the range. I.e. for a forward branch, the reference
560 : address is the end address of the branch as known from the previous
561 : branch shortening pass, minus a value to account for possible size
562 : increase due to alignment. For a backward branch, it is the start
563 : address of the branch as known from the current pass, plus a value
564 : to account for possible size increase due to alignment.
565 : NB.: Therefore, the maximum offset allowed for backward branches needs
566 : to exclude the branch size. */
567 :
568 : int
569 28744898 : insn_current_reference_address (rtx_insn *branch)
570 : {
571 28744898 : rtx dest;
572 28744898 : int seq_uid;
573 :
574 28744898 : if (! INSN_ADDRESSES_SET_P ())
575 : return 0;
576 :
577 28744898 : rtx_insn *seq = NEXT_INSN (PREV_INSN (branch));
578 28744898 : seq_uid = INSN_UID (seq);
579 28744898 : if (!jump_to_label_p (branch))
580 : /* This can happen for example on the PA; the objective is to know the
581 : offset to address something in front of the start of the function.
582 : Thus, we can treat it like a backward branch.
583 : We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
584 : any alignment we'd encounter, so we skip the call to align_fuzz. */
585 0 : return insn_current_address;
586 28744898 : dest = JUMP_LABEL (branch);
587 :
588 : /* BRANCH has no proper alignment chain set, so use SEQ.
589 : BRANCH also has no INSN_SHUID. */
590 28744898 : if (INSN_SHUID (seq) < INSN_SHUID (dest))
591 : {
592 : /* Forward branch. */
593 20751944 : return (insn_last_address + insn_lengths[seq_uid]
594 20751944 : - align_fuzz (seq, dest, length_unit_log, ~0));
595 : }
596 : else
597 : {
598 : /* Backward branch. */
599 7992954 : return (insn_current_address
600 7992954 : + align_fuzz (dest, seq, length_unit_log, ~0));
601 : }
602 : }
603 :
604 : /* Compute branch alignments based on CFG profile. */
605 :
606 : void
607 1515122 : compute_alignments (void)
608 : {
609 1515122 : basic_block bb;
610 1515122 : align_flags max_alignment;
611 :
612 1515122 : label_align.truncate (0);
613 :
614 1515122 : max_labelno = max_label_num ();
615 1515122 : min_labelno = get_first_label_num ();
616 1515122 : label_align.safe_grow_cleared (max_labelno - min_labelno + 1, true);
617 :
618 : /* If not optimizing or optimizing for size, don't assign any alignments. */
619 1515122 : if (! optimize || optimize_function_for_size_p (cfun))
620 518321 : return;
621 :
622 996801 : if (dump_file)
623 : {
624 33 : dump_reg_info (dump_file);
625 33 : dump_flow_info (dump_file, TDF_DETAILS);
626 33 : flow_loops_dump (dump_file, NULL, 1);
627 : }
628 996801 : loop_optimizer_init (AVOID_CFG_MODIFICATIONS);
629 996801 : profile_count count_threshold = cfun->cfg->count_max / param_align_threshold;
630 :
631 996801 : if (dump_file)
632 : {
633 33 : fprintf (dump_file, "count_max: ");
634 33 : cfun->cfg->count_max.dump (dump_file);
635 33 : fprintf (dump_file, "\n");
636 : }
637 11774544 : FOR_EACH_BB_FN (bb, cfun)
638 : {
639 10777743 : rtx_insn *label = BB_HEAD (bb);
640 10777743 : bool has_fallthru = 0;
641 10777743 : edge e;
642 10777743 : edge_iterator ei;
643 :
644 17714648 : if (!LABEL_P (label)
645 10777743 : || optimize_bb_for_size_p (bb))
646 : {
647 6936905 : if (dump_file)
648 130 : fprintf (dump_file,
649 : "BB %4i loop %2i loop_depth %2i skipped.\n",
650 : bb->index,
651 130 : bb->loop_father->num,
652 : bb_loop_depth (bb));
653 6938383 : continue;
654 : }
655 3840838 : max_alignment = LABEL_ALIGN (label);
656 3840838 : profile_count fallthru_count = profile_count::zero ();
657 3840838 : profile_count branch_count = profile_count::zero ();
658 :
659 11203196 : FOR_EACH_EDGE (e, ei, bb->preds)
660 : {
661 7362358 : if (e->flags & EDGE_FALLTHRU)
662 2345324 : has_fallthru = 1, fallthru_count += e->count ();
663 : else
664 5017034 : branch_count += e->count ();
665 : }
666 3840838 : if (dump_file)
667 : {
668 119 : fprintf (dump_file, "BB %4i loop %2i loop_depth"
669 : " %2i fall ",
670 119 : bb->index, bb->loop_father->num,
671 : bb_loop_depth (bb));
672 119 : fallthru_count.dump (dump_file);
673 119 : fprintf (dump_file, " branch ");
674 119 : branch_count.dump (dump_file);
675 119 : if (!bb->loop_father->inner && bb->loop_father->num)
676 20 : fprintf (dump_file, " inner_loop");
677 119 : if (bb->loop_father->header == bb)
678 18 : fprintf (dump_file, " loop_header");
679 119 : fprintf (dump_file, "\n");
680 : }
681 3840838 : if (!fallthru_count.initialized_p () || !branch_count.initialized_p ())
682 1478 : continue;
683 :
684 : /* There are two purposes to align block with no fallthru incoming edge:
685 : 1) to avoid fetch stalls when branch destination is near cache boundary
686 : 2) to improve cache efficiency in case the previous block is not executed
687 : (so it does not need to be in the cache).
688 :
689 : We to catch first case, we align frequently executed blocks.
690 : To catch the second, we align blocks that are executed more frequently
691 : than the predecessor and the predecessor is likely to not be executed
692 : when function is called. */
693 :
694 3839360 : if (!has_fallthru
695 3839360 : && (branch_count > count_threshold
696 419498 : || (bb->count > bb->prev_bb->count * 10
697 27174 : && (bb->prev_bb->count
698 3866534 : <= ENTRY_BLOCK_PTR_FOR_FN (cfun)->count / 2))))
699 : {
700 1102301 : align_flags alignment = JUMP_ALIGN (label);
701 1102301 : if (dump_file)
702 38 : fprintf (dump_file, " jump alignment added.\n");
703 1102301 : max_alignment = align_flags::max (max_alignment, alignment);
704 : }
705 : /* In case block is frequent and reached mostly by non-fallthru edge,
706 : align it. It is most likely a first block of loop. */
707 3839360 : if (has_fallthru
708 2344261 : && !(single_succ_p (bb)
709 806971 : && single_succ (bb) == EXIT_BLOCK_PTR_FOR_FN (cfun))
710 1998232 : && optimize_bb_for_speed_p (bb)
711 1998232 : && branch_count + fallthru_count > count_threshold
712 6183623 : && (branch_count > fallthru_count * param_align_loop_iterations))
713 : {
714 304294 : align_flags alignment = LOOP_ALIGN (label);
715 304294 : if (dump_file)
716 11 : fprintf (dump_file, " internal loop alignment added.\n");
717 304294 : max_alignment = align_flags::max (max_alignment, alignment);
718 : }
719 3839360 : LABEL_TO_ALIGNMENT (label) = max_alignment;
720 : }
721 :
722 996801 : loop_optimizer_finalize ();
723 996801 : free_dominance_info (CDI_DOMINATORS);
724 : }
725 :
726 : /* Grow the LABEL_ALIGN array after new labels are created. */
727 :
728 : static void
729 3 : grow_label_align (void)
730 : {
731 3 : int old = max_labelno;
732 3 : int n_labels;
733 3 : int n_old_labels;
734 :
735 3 : max_labelno = max_label_num ();
736 :
737 3 : n_labels = max_labelno - min_labelno + 1;
738 3 : n_old_labels = old - min_labelno + 1;
739 :
740 3 : label_align.safe_grow_cleared (n_labels, true);
741 :
742 : /* Range of labels grows monotonically in the function. Failing here
743 : means that the initialization of array got lost. */
744 3 : gcc_assert (n_old_labels <= n_labels);
745 3 : }
746 :
747 : /* Update the already computed alignment information. LABEL_PAIRS is a vector
748 : made up of pairs of labels for which the alignment information of the first
749 : element will be copied from that of the second element. */
750 :
751 : void
752 0 : update_alignments (vec<rtx> &label_pairs)
753 : {
754 0 : unsigned int i = 0;
755 0 : rtx iter, label = NULL_RTX;
756 :
757 0 : if (max_labelno != max_label_num ())
758 0 : grow_label_align ();
759 :
760 0 : FOR_EACH_VEC_ELT (label_pairs, i, iter)
761 0 : if (i & 1)
762 0 : LABEL_TO_ALIGNMENT (label) = LABEL_TO_ALIGNMENT (iter);
763 : else
764 : label = iter;
765 0 : }
766 :
767 : namespace {
768 :
769 : const pass_data pass_data_compute_alignments =
770 : {
771 : RTL_PASS, /* type */
772 : "alignments", /* name */
773 : OPTGROUP_NONE, /* optinfo_flags */
774 : TV_NONE, /* tv_id */
775 : 0, /* properties_required */
776 : 0, /* properties_provided */
777 : 0, /* properties_destroyed */
778 : 0, /* todo_flags_start */
779 : 0, /* todo_flags_finish */
780 : };
781 :
782 : class pass_compute_alignments : public rtl_opt_pass
783 : {
784 : public:
785 294196 : pass_compute_alignments (gcc::context *ctxt)
786 588392 : : rtl_opt_pass (pass_data_compute_alignments, ctxt)
787 : {}
788 :
789 : /* opt_pass methods: */
790 1515122 : unsigned int execute (function *) final override
791 : {
792 1515122 : compute_alignments ();
793 1515122 : return 0;
794 : }
795 :
796 : }; // class pass_compute_alignments
797 :
798 : } // anon namespace
799 :
800 : rtl_opt_pass *
801 294196 : make_pass_compute_alignments (gcc::context *ctxt)
802 : {
803 294196 : return new pass_compute_alignments (ctxt);
804 : }
805 :
806 :
807 : /* Make a pass over all insns and compute their actual lengths by shortening
808 : any branches of variable length if possible. */
809 :
810 : /* shorten_branches might be called multiple times: for example, the SH
811 : port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
812 : In order to do this, it needs proper length information, which it obtains
813 : by calling shorten_branches. This cannot be collapsed with
814 : shorten_branches itself into a single pass unless we also want to integrate
815 : reorg.cc, since the branch splitting exposes new instructions with delay
816 : slots. */
817 :
818 : void
819 1517018 : shorten_branches (rtx_insn *first)
820 : {
821 1517018 : rtx_insn *insn;
822 1517018 : int max_uid;
823 1517018 : int i;
824 1517018 : rtx_insn *seq;
825 1517018 : bool something_changed = true;
826 1517018 : char *varying_length;
827 1517018 : rtx body;
828 1517018 : int uid;
829 1517018 : rtx align_tab[MAX_CODE_ALIGN + 1];
830 :
831 : /* Compute maximum UID and allocate label_align / uid_shuid. */
832 1517018 : max_uid = get_max_uid ();
833 :
834 : /* Free uid_shuid before reallocating it. */
835 1517018 : free (uid_shuid);
836 :
837 1517018 : uid_shuid = XNEWVEC (int, max_uid);
838 :
839 1517018 : if (max_labelno != max_label_num ())
840 3 : grow_label_align ();
841 :
842 : /* Initialize label_align and set up uid_shuid to be strictly
843 : monotonically rising with insn order. */
844 : /* We use alignment here to keep track of the maximum alignment we want to
845 : impose on the next CODE_LABEL (or the current one if we are processing
846 : the CODE_LABEL itself). */
847 :
848 1517018 : align_flags max_alignment;
849 :
850 217700346 : for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
851 : {
852 216183328 : INSN_SHUID (insn) = i++;
853 216183328 : if (INSN_P (insn))
854 95733348 : continue;
855 :
856 120449980 : if (rtx_code_label *label = dyn_cast <rtx_code_label *> (insn))
857 : {
858 : /* Merge in alignments computed by compute_alignments. */
859 7017261 : align_flags alignment = LABEL_TO_ALIGNMENT (label);
860 7017261 : max_alignment = align_flags::max (max_alignment, alignment);
861 :
862 7017261 : rtx_jump_table_data *table = jump_table_for_label (label);
863 7017261 : if (!table)
864 : {
865 7010369 : align_flags alignment = LABEL_ALIGN (label);
866 7010369 : max_alignment = align_flags::max (max_alignment, alignment);
867 : }
868 : /* ADDR_VECs only take room if read-only data goes into the text
869 : section. */
870 7017261 : if ((JUMP_TABLES_IN_TEXT_SECTION
871 7017261 : || readonly_data_section == text_section)
872 0 : && table)
873 : {
874 0 : align_flags alignment = align_flags (ADDR_VEC_ALIGN (table));
875 0 : max_alignment = align_flags::max (max_alignment, alignment);
876 : }
877 7017261 : LABEL_TO_ALIGNMENT (label) = max_alignment;
878 7017261 : max_alignment = align_flags ();
879 : }
880 113432719 : else if (BARRIER_P (insn))
881 : {
882 : rtx_insn *label;
883 :
884 29201226 : for (label = insn; label && ! INSN_P (label);
885 24328597 : label = NEXT_INSN (label))
886 27632119 : if (LABEL_P (label))
887 : {
888 3303522 : align_flags alignment
889 3303522 : = align_flags (LABEL_ALIGN_AFTER_BARRIER (insn));
890 3303522 : max_alignment = align_flags::max (max_alignment, alignment);
891 3303522 : break;
892 : }
893 : }
894 : }
895 1517018 : if (!HAVE_ATTR_length)
896 : return;
897 :
898 : /* Allocate the rest of the arrays. */
899 1517018 : insn_lengths = XNEWVEC (int, max_uid);
900 1517018 : insn_lengths_max_uid = max_uid;
901 : /* Syntax errors can lead to labels being outside of the main insn stream.
902 : Initialize insn_addresses, so that we get reproducible results. */
903 1517018 : INSN_ADDRESSES_ALLOC (max_uid);
904 :
905 1517018 : varying_length = XCNEWVEC (char, max_uid);
906 :
907 : /* Initialize uid_align. We scan instructions
908 : from end to start, and keep in align_tab[n] the last seen insn
909 : that does an alignment of at least n+1, i.e. the successor
910 : in the alignment chain for an insn that does / has a known
911 : alignment of n. */
912 1517018 : uid_align = XCNEWVEC (rtx, max_uid);
913 :
914 27306324 : for (i = MAX_CODE_ALIGN + 1; --i >= 0;)
915 25789306 : align_tab[i] = NULL_RTX;
916 1517018 : seq = get_last_insn ();
917 217700346 : for (; seq; seq = PREV_INSN (seq))
918 : {
919 216183328 : int uid = INSN_UID (seq);
920 216183328 : int log;
921 216183328 : log = (LABEL_P (seq) ? LABEL_TO_ALIGNMENT (seq).levels[0].log : 0);
922 216183328 : uid_align[uid] = align_tab[0];
923 216183328 : if (log)
924 : {
925 : /* Found an alignment label. */
926 1345872 : gcc_checking_assert (log < MAX_CODE_ALIGN + 1);
927 1345872 : uid_align[uid] = align_tab[log];
928 6729450 : for (i = log - 1; i >= 0; i--)
929 5383578 : align_tab[i] = seq;
930 : }
931 : }
932 :
933 : /* When optimizing, we start assuming minimum length, and keep increasing
934 : lengths as we find the need for this, till nothing changes.
935 : When not optimizing, we start assuming maximum lengths, and
936 : do a single pass to update the lengths. */
937 1517018 : bool increasing = optimize != 0;
938 :
939 : #ifdef CASE_VECTOR_SHORTEN_MODE
940 : if (optimize)
941 : {
942 : /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
943 : label fields. */
944 :
945 : int min_shuid = INSN_SHUID (get_insns ()) - 1;
946 : int max_shuid = INSN_SHUID (get_last_insn ()) + 1;
947 : int rel;
948 :
949 : for (insn = first; insn != 0; insn = NEXT_INSN (insn))
950 : {
951 : rtx min_lab = NULL_RTX, max_lab = NULL_RTX, pat;
952 : int len, i, min, max, insn_shuid;
953 : int min_align;
954 : addr_diff_vec_flags flags;
955 :
956 : if (! JUMP_TABLE_DATA_P (insn)
957 : || GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)
958 : continue;
959 : pat = PATTERN (insn);
960 : len = XVECLEN (pat, 1);
961 : gcc_assert (len > 0);
962 : min_align = MAX_CODE_ALIGN;
963 : for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
964 : {
965 : rtx lab = XEXP (XVECEXP (pat, 1, i), 0);
966 : int shuid = INSN_SHUID (lab);
967 : if (shuid < min)
968 : {
969 : min = shuid;
970 : min_lab = lab;
971 : }
972 : if (shuid > max)
973 : {
974 : max = shuid;
975 : max_lab = lab;
976 : }
977 :
978 : int label_alignment = LABEL_TO_ALIGNMENT (lab).levels[0].log;
979 : if (min_align > label_alignment)
980 : min_align = label_alignment;
981 : }
982 : XEXP (pat, 2) = gen_rtx_LABEL_REF (Pmode, min_lab);
983 : XEXP (pat, 3) = gen_rtx_LABEL_REF (Pmode, max_lab);
984 : insn_shuid = INSN_SHUID (insn);
985 : rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0));
986 : memset (&flags, 0, sizeof (flags));
987 : flags.min_align = min_align;
988 : flags.base_after_vec = rel > insn_shuid;
989 : flags.min_after_vec = min > insn_shuid;
990 : flags.max_after_vec = max > insn_shuid;
991 : flags.min_after_base = min > rel;
992 : flags.max_after_base = max > rel;
993 : ADDR_DIFF_VEC_FLAGS (pat) = flags;
994 :
995 : if (increasing)
996 : PUT_MODE (pat, CASE_VECTOR_SHORTEN_MODE (0, 0, pat));
997 : }
998 : }
999 : #endif /* CASE_VECTOR_SHORTEN_MODE */
1000 :
1001 : /* Compute initial lengths, addresses, and varying flags for each insn. */
1002 1517018 : int (*length_fun) (rtx_insn *) = increasing ? insn_min_length : insn_default_length;
1003 :
1004 1517018 : for (insn_current_address = 0, insn = first;
1005 217700346 : insn != 0;
1006 216183328 : insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1007 : {
1008 216183328 : uid = INSN_UID (insn);
1009 :
1010 216183328 : insn_lengths[uid] = 0;
1011 :
1012 216183328 : if (LABEL_P (insn))
1013 : {
1014 7017261 : int log = LABEL_TO_ALIGNMENT (insn).levels[0].log;
1015 7017261 : if (log)
1016 : {
1017 1345872 : int align = 1 << log;
1018 1345872 : int new_address = (insn_current_address + align - 1) & -align;
1019 1345872 : insn_lengths[uid] = new_address - insn_current_address;
1020 : }
1021 : }
1022 :
1023 216183328 : INSN_ADDRESSES (uid) = insn_current_address + insn_lengths[uid];
1024 :
1025 216183328 : if (NOTE_P (insn) || BARRIER_P (insn)
1026 102757501 : || LABEL_P (insn) || DEBUG_INSN_P (insn))
1027 120443092 : continue;
1028 95740236 : if (insn->deleted ())
1029 0 : continue;
1030 :
1031 95740236 : body = PATTERN (insn);
1032 95740236 : if (rtx_jump_table_data *table = dyn_cast <rtx_jump_table_data *> (insn))
1033 : {
1034 : /* This only takes room if read-only data goes into the text
1035 : section. */
1036 6892 : if (JUMP_TABLES_IN_TEXT_SECTION
1037 6892 : || readonly_data_section == text_section)
1038 0 : insn_lengths[uid] = (XVECLEN (body,
1039 : GET_CODE (body) == ADDR_DIFF_VEC)
1040 0 : * GET_MODE_SIZE (table->get_data_mode ()));
1041 : /* Alignment is handled by ADDR_VEC_ALIGN. */
1042 : }
1043 95733344 : else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
1044 96123 : insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1045 95637221 : else if (rtx_sequence *body_seq = dyn_cast <rtx_sequence *> (body))
1046 : {
1047 : int i;
1048 : int const_delay_slots;
1049 : if (DELAY_SLOTS)
1050 : const_delay_slots = const_num_delay_slots (body_seq->insn (0));
1051 : else
1052 : const_delay_slots = 0;
1053 :
1054 : int (*inner_length_fun) (rtx_insn *)
1055 : = const_delay_slots ? length_fun : insn_default_length;
1056 : /* Inside a delay slot sequence, we do not do any branch shortening
1057 : if the shortening could change the number of delay slots
1058 : of the branch. */
1059 0 : for (i = 0; i < body_seq->len (); i++)
1060 : {
1061 0 : rtx_insn *inner_insn = body_seq->insn (i);
1062 0 : int inner_uid = INSN_UID (inner_insn);
1063 0 : int inner_length;
1064 :
1065 0 : if (GET_CODE (PATTERN (inner_insn)) == ASM_INPUT
1066 0 : || asm_noperands (PATTERN (inner_insn)) >= 0)
1067 0 : inner_length = (asm_insn_count (PATTERN (inner_insn))
1068 0 : * insn_default_length (inner_insn));
1069 : else
1070 0 : inner_length = inner_length_fun (inner_insn);
1071 :
1072 0 : insn_lengths[inner_uid] = inner_length;
1073 0 : if (const_delay_slots)
1074 : {
1075 : if ((varying_length[inner_uid]
1076 : = insn_variable_length_p (inner_insn)) != 0)
1077 : varying_length[uid] = 1;
1078 : INSN_ADDRESSES (inner_uid) = (insn_current_address
1079 : + insn_lengths[uid]);
1080 : }
1081 : else
1082 0 : varying_length[inner_uid] = 0;
1083 0 : insn_lengths[uid] += inner_length;
1084 : }
1085 : }
1086 95637221 : else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1087 : {
1088 94574672 : insn_lengths[uid] = length_fun (insn);
1089 94574672 : varying_length[uid] = insn_variable_length_p (insn);
1090 : }
1091 :
1092 : /* If needed, do any adjustment. */
1093 : #ifdef ADJUST_INSN_LENGTH
1094 : ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
1095 : if (insn_lengths[uid] < 0)
1096 : fatal_insn ("negative insn length", insn);
1097 : #endif
1098 : }
1099 :
1100 : /* Now loop over all the insns finding varying length insns. For each,
1101 : get the current insn length. If it has changed, reflect the change.
1102 : When nothing changes for a full pass, we are done. */
1103 :
1104 2840013 : while (something_changed)
1105 : {
1106 1777551 : something_changed = false;
1107 1777551 : insn_current_align = MAX_CODE_ALIGN - 1;
1108 397484077 : for (insn_current_address = 0, insn = first;
1109 397484077 : insn != 0;
1110 395706526 : insn = NEXT_INSN (insn))
1111 : {
1112 395706526 : int new_length;
1113 : #ifdef ADJUST_INSN_LENGTH
1114 : int tmp_length;
1115 : #endif
1116 395706526 : int length_align;
1117 :
1118 395706526 : uid = INSN_UID (insn);
1119 :
1120 395706526 : if (rtx_code_label *label = dyn_cast <rtx_code_label *> (insn))
1121 : {
1122 12546762 : int log = LABEL_TO_ALIGNMENT (label).levels[0].log;
1123 :
1124 : #ifdef CASE_VECTOR_SHORTEN_MODE
1125 : /* If the mode of a following jump table was changed, we
1126 : may need to update the alignment of this label. */
1127 :
1128 : if (JUMP_TABLES_IN_TEXT_SECTION
1129 : || readonly_data_section == text_section)
1130 : {
1131 : rtx_jump_table_data *table = jump_table_for_label (label);
1132 : if (table)
1133 : {
1134 : int newlog = ADDR_VEC_ALIGN (table);
1135 : if (newlog != log)
1136 : {
1137 : log = newlog;
1138 : LABEL_TO_ALIGNMENT (insn) = log;
1139 : something_changed = true;
1140 : }
1141 : }
1142 : }
1143 : #endif
1144 :
1145 12546762 : if (log > insn_current_align)
1146 : {
1147 2718391 : int align = 1 << log;
1148 2718391 : int new_address= (insn_current_address + align - 1) & -align;
1149 2718391 : insn_lengths[uid] = new_address - insn_current_address;
1150 2718391 : insn_current_align = log;
1151 2718391 : insn_current_address = new_address;
1152 : }
1153 : else
1154 9828371 : insn_lengths[uid] = 0;
1155 12546762 : INSN_ADDRESSES (uid) = insn_current_address;
1156 12546762 : continue;
1157 12546762 : }
1158 :
1159 383159764 : length_align = INSN_LENGTH_ALIGNMENT (insn);
1160 383159764 : if (length_align < insn_current_align)
1161 4495942 : insn_current_align = length_align;
1162 :
1163 383159764 : insn_last_address = INSN_ADDRESSES (uid);
1164 383159764 : INSN_ADDRESSES (uid) = insn_current_address;
1165 :
1166 : #ifdef CASE_VECTOR_SHORTEN_MODE
1167 : if (optimize
1168 : && JUMP_TABLE_DATA_P (insn)
1169 : && GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC)
1170 : {
1171 : rtx_jump_table_data *table = as_a <rtx_jump_table_data *> (insn);
1172 : rtx body = PATTERN (insn);
1173 : int old_length = insn_lengths[uid];
1174 : rtx_insn *rel_lab =
1175 : safe_as_a <rtx_insn *> (XEXP (XEXP (body, 0), 0));
1176 : rtx min_lab = XEXP (XEXP (body, 2), 0);
1177 : rtx max_lab = XEXP (XEXP (body, 3), 0);
1178 : int rel_addr = INSN_ADDRESSES (INSN_UID (rel_lab));
1179 : int min_addr = INSN_ADDRESSES (INSN_UID (min_lab));
1180 : int max_addr = INSN_ADDRESSES (INSN_UID (max_lab));
1181 : rtx_insn *prev;
1182 : int rel_align = 0;
1183 : addr_diff_vec_flags flags;
1184 : scalar_int_mode vec_mode;
1185 :
1186 : /* Avoid automatic aggregate initialization. */
1187 : flags = ADDR_DIFF_VEC_FLAGS (body);
1188 :
1189 : /* Try to find a known alignment for rel_lab. */
1190 : for (prev = rel_lab;
1191 : prev
1192 : && ! insn_lengths[INSN_UID (prev)]
1193 : && ! (varying_length[INSN_UID (prev)] & 1);
1194 : prev = PREV_INSN (prev))
1195 : if (varying_length[INSN_UID (prev)] & 2)
1196 : {
1197 : rel_align = LABEL_TO_ALIGNMENT (prev).levels[0].log;
1198 : break;
1199 : }
1200 :
1201 : /* See the comment on addr_diff_vec_flags in rtl.h for the
1202 : meaning of the flags values. base: REL_LAB vec: INSN */
1203 : /* Anything after INSN has still addresses from the last
1204 : pass; adjust these so that they reflect our current
1205 : estimate for this pass. */
1206 : if (flags.base_after_vec)
1207 : rel_addr += insn_current_address - insn_last_address;
1208 : if (flags.min_after_vec)
1209 : min_addr += insn_current_address - insn_last_address;
1210 : if (flags.max_after_vec)
1211 : max_addr += insn_current_address - insn_last_address;
1212 : /* We want to know the worst case, i.e. lowest possible value
1213 : for the offset of MIN_LAB. If MIN_LAB is after REL_LAB,
1214 : its offset is positive, and we have to be wary of code shrink;
1215 : otherwise, it is negative, and we have to be vary of code
1216 : size increase. */
1217 : if (flags.min_after_base)
1218 : {
1219 : /* If INSN is between REL_LAB and MIN_LAB, the size
1220 : changes we are about to make can change the alignment
1221 : within the observed offset, therefore we have to break
1222 : it up into two parts that are independent. */
1223 : if (! flags.base_after_vec && flags.min_after_vec)
1224 : {
1225 : min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
1226 : min_addr -= align_fuzz (insn, min_lab, 0, 0);
1227 : }
1228 : else
1229 : min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
1230 : }
1231 : else
1232 : {
1233 : if (flags.base_after_vec && ! flags.min_after_vec)
1234 : {
1235 : min_addr -= align_fuzz (min_lab, insn, 0, ~0);
1236 : min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
1237 : }
1238 : else
1239 : min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
1240 : }
1241 : /* Likewise, determine the highest lowest possible value
1242 : for the offset of MAX_LAB. */
1243 : if (flags.max_after_base)
1244 : {
1245 : if (! flags.base_after_vec && flags.max_after_vec)
1246 : {
1247 : max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
1248 : max_addr += align_fuzz (insn, max_lab, 0, ~0);
1249 : }
1250 : else
1251 : max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
1252 : }
1253 : else
1254 : {
1255 : if (flags.base_after_vec && ! flags.max_after_vec)
1256 : {
1257 : max_addr += align_fuzz (max_lab, insn, 0, 0);
1258 : max_addr += align_fuzz (insn, rel_lab, 0, 0);
1259 : }
1260 : else
1261 : max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
1262 : }
1263 : vec_mode = CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
1264 : max_addr - rel_addr, body);
1265 : if (!increasing
1266 : || (GET_MODE_SIZE (vec_mode)
1267 : >= GET_MODE_SIZE (table->get_data_mode ())))
1268 : PUT_MODE (body, vec_mode);
1269 : if (JUMP_TABLES_IN_TEXT_SECTION
1270 : || readonly_data_section == text_section)
1271 : {
1272 : insn_lengths[uid]
1273 : = (XVECLEN (body, 1)
1274 : * GET_MODE_SIZE (table->get_data_mode ()));
1275 : insn_current_address += insn_lengths[uid];
1276 : if (insn_lengths[uid] != old_length)
1277 : something_changed = true;
1278 : }
1279 :
1280 : continue;
1281 : }
1282 : #endif /* CASE_VECTOR_SHORTEN_MODE */
1283 :
1284 383159764 : if (! (varying_length[uid]))
1285 : {
1286 366846822 : if (NONJUMP_INSN_P (insn)
1287 366846822 : && GET_CODE (PATTERN (insn)) == SEQUENCE)
1288 : {
1289 : int i;
1290 :
1291 0 : body = PATTERN (insn);
1292 0 : for (i = 0; i < XVECLEN (body, 0); i++)
1293 : {
1294 0 : rtx inner_insn = XVECEXP (body, 0, i);
1295 0 : int inner_uid = INSN_UID (inner_insn);
1296 :
1297 0 : INSN_ADDRESSES (inner_uid) = insn_current_address;
1298 :
1299 0 : insn_current_address += insn_lengths[inner_uid];
1300 : }
1301 : }
1302 : else
1303 366846822 : insn_current_address += insn_lengths[uid];
1304 :
1305 366846822 : continue;
1306 366846822 : }
1307 :
1308 16312942 : if (NONJUMP_INSN_P (insn) && GET_CODE (PATTERN (insn)) == SEQUENCE)
1309 : {
1310 0 : rtx_sequence *seqn = as_a <rtx_sequence *> (PATTERN (insn));
1311 0 : int i;
1312 :
1313 0 : body = PATTERN (insn);
1314 0 : new_length = 0;
1315 0 : for (i = 0; i < seqn->len (); i++)
1316 : {
1317 0 : rtx_insn *inner_insn = seqn->insn (i);
1318 0 : int inner_uid = INSN_UID (inner_insn);
1319 0 : int inner_length;
1320 :
1321 0 : INSN_ADDRESSES (inner_uid) = insn_current_address;
1322 :
1323 : /* insn_current_length returns 0 for insns with a
1324 : non-varying length. */
1325 0 : if (! varying_length[inner_uid])
1326 0 : inner_length = insn_lengths[inner_uid];
1327 : else
1328 0 : inner_length = insn_current_length (inner_insn);
1329 :
1330 0 : if (inner_length != insn_lengths[inner_uid])
1331 : {
1332 0 : if (!increasing || inner_length > insn_lengths[inner_uid])
1333 : {
1334 0 : insn_lengths[inner_uid] = inner_length;
1335 0 : something_changed = true;
1336 : }
1337 : else
1338 : inner_length = insn_lengths[inner_uid];
1339 : }
1340 0 : insn_current_address += inner_length;
1341 0 : new_length += inner_length;
1342 : }
1343 : }
1344 : else
1345 : {
1346 16312942 : new_length = insn_current_length (insn);
1347 16312942 : insn_current_address += new_length;
1348 : }
1349 :
1350 : #ifdef ADJUST_INSN_LENGTH
1351 : /* If needed, do any adjustment. */
1352 : tmp_length = new_length;
1353 : ADJUST_INSN_LENGTH (insn, new_length);
1354 : insn_current_address += (new_length - tmp_length);
1355 : #endif
1356 :
1357 16312942 : if (new_length != insn_lengths[uid]
1358 5474422 : && (!increasing || new_length > insn_lengths[uid]))
1359 : {
1360 5474422 : insn_lengths[uid] = new_length;
1361 5474422 : something_changed = true;
1362 : }
1363 : else
1364 10838520 : insn_current_address += insn_lengths[uid] - new_length;
1365 : }
1366 : /* For a non-optimizing compile, do only a single pass. */
1367 1777551 : if (!increasing)
1368 : break;
1369 : }
1370 1517018 : crtl->max_insn_address = insn_current_address;
1371 1517018 : free (varying_length);
1372 : }
1373 :
1374 : /* Given the body of an INSN known to be generated by an ASM statement, return
1375 : the number of machine instructions likely to be generated for this insn.
1376 : This is used to compute its length. */
1377 :
1378 : static int
1379 104117 : asm_insn_count (rtx body)
1380 : {
1381 104117 : const char *templ;
1382 :
1383 104117 : if (GET_CODE (body) == ASM_INPUT)
1384 3579 : templ = XSTR (body, 0);
1385 : else
1386 100538 : templ = decode_asm_operands (body, NULL, NULL, NULL, NULL, NULL);
1387 :
1388 104117 : return asm_str_count (templ);
1389 : }
1390 :
1391 : /* Return the number of machine instructions likely to be generated for the
1392 : inline-asm template. */
1393 : int
1394 791662 : asm_str_count (const char *templ)
1395 : {
1396 791662 : int count = 1;
1397 :
1398 791662 : if (!*templ)
1399 : return 0;
1400 :
1401 4114670 : for (; *templ; templ++)
1402 3901433 : if (IS_ASM_LOGICAL_LINE_SEPARATOR (*templ, templ)
1403 3893942 : || *templ == '\n')
1404 234685 : count++;
1405 :
1406 : return count;
1407 : }
1408 :
1409 : /* Return true if DWARF2 debug info can be emitted for DECL. */
1410 :
1411 : static bool
1412 3107032 : dwarf2_debug_info_emitted_p (tree decl)
1413 : {
1414 : /* When DWARF2 debug info is not generated internally. */
1415 3107032 : if (!dwarf_debuginfo_p () && !dwarf_based_debuginfo_p ())
1416 : return false;
1417 :
1418 1194602 : if (DECL_IGNORED_P (decl))
1419 16098 : return false;
1420 :
1421 : return true;
1422 : }
1423 :
1424 : /* Return scope resulting from combination of S1 and S2. */
1425 : static tree
1426 0 : choose_inner_scope (tree s1, tree s2)
1427 : {
1428 0 : if (!s1)
1429 : return s2;
1430 0 : if (!s2)
1431 : return s1;
1432 0 : if (BLOCK_NUMBER (s1) > BLOCK_NUMBER (s2))
1433 0 : return s1;
1434 : return s2;
1435 : }
1436 :
1437 : /* Emit lexical block notes needed to change scope from S1 to S2. */
1438 :
1439 : static void
1440 18178068 : change_scope (rtx_insn *orig_insn, tree s1, tree s2)
1441 : {
1442 18178068 : rtx_insn *insn = orig_insn;
1443 18178068 : tree com = NULL_TREE;
1444 18178068 : tree ts1 = s1, ts2 = s2;
1445 18178068 : tree s;
1446 :
1447 59738257 : while (ts1 != ts2)
1448 : {
1449 41560189 : gcc_assert (ts1 && ts2);
1450 41560189 : if (BLOCK_NUMBER (ts1) > BLOCK_NUMBER (ts2))
1451 16759296 : ts1 = BLOCK_SUPERCONTEXT (ts1);
1452 24800893 : else if (BLOCK_NUMBER (ts1) < BLOCK_NUMBER (ts2))
1453 16759296 : ts2 = BLOCK_SUPERCONTEXT (ts2);
1454 : else
1455 : {
1456 8041597 : ts1 = BLOCK_SUPERCONTEXT (ts1);
1457 8041597 : ts2 = BLOCK_SUPERCONTEXT (ts2);
1458 : }
1459 : }
1460 42978961 : com = ts1;
1461 :
1462 : /* Close scopes. */
1463 : s = s1;
1464 42978961 : while (s != com)
1465 : {
1466 24800893 : rtx_note *note = emit_note_before (NOTE_INSN_BLOCK_END, insn);
1467 24800893 : NOTE_BLOCK (note) = s;
1468 24800893 : s = BLOCK_SUPERCONTEXT (s);
1469 : }
1470 :
1471 : /* Open scopes. */
1472 : s = s2;
1473 42978961 : while (s != com)
1474 : {
1475 24800893 : insn = emit_note_before (NOTE_INSN_BLOCK_BEG, insn);
1476 24800893 : NOTE_BLOCK (insn) = s;
1477 24800893 : s = BLOCK_SUPERCONTEXT (s);
1478 : }
1479 18178068 : }
1480 :
1481 : /* Rebuild all the NOTE_INSN_BLOCK_BEG and NOTE_INSN_BLOCK_END notes based
1482 : on the scope tree and the newly reordered instructions. */
1483 :
1484 : static void
1485 585961 : reemit_insn_block_notes (void)
1486 : {
1487 585961 : tree cur_block = DECL_INITIAL (cfun->decl);
1488 585961 : rtx_insn *insn;
1489 :
1490 585961 : insn = get_insns ();
1491 157031669 : for (; insn; insn = NEXT_INSN (insn))
1492 : {
1493 156445708 : tree this_block;
1494 :
1495 : /* Prevent lexical blocks from straddling section boundaries. */
1496 156445708 : if (NOTE_P (insn))
1497 102190089 : switch (NOTE_KIND (insn))
1498 : {
1499 : case NOTE_INSN_SWITCH_TEXT_SECTIONS:
1500 : {
1501 88708 : for (tree s = cur_block; s != DECL_INITIAL (cfun->decl);
1502 66028 : s = BLOCK_SUPERCONTEXT (s))
1503 : {
1504 66028 : rtx_note *note = emit_note_before (NOTE_INSN_BLOCK_END, insn);
1505 66028 : NOTE_BLOCK (note) = s;
1506 66028 : note = emit_note_after (NOTE_INSN_BLOCK_BEG, insn);
1507 66028 : NOTE_BLOCK (note) = s;
1508 : }
1509 : }
1510 : break;
1511 :
1512 11753678 : case NOTE_INSN_BEGIN_STMT:
1513 11753678 : case NOTE_INSN_INLINE_ENTRY:
1514 11753678 : this_block = LOCATION_BLOCK (NOTE_MARKER_LOCATION (insn));
1515 11744523 : if (!this_block)
1516 14527 : continue;
1517 11739151 : goto set_cur_block_to_this_block;
1518 :
1519 90413731 : default:
1520 90413731 : continue;
1521 90413731 : }
1522 :
1523 54278299 : if (!active_insn_p (insn))
1524 7404856 : continue;
1525 :
1526 : /* Avoid putting scope notes between jump table and its label. */
1527 46873443 : if (JUMP_TABLE_DATA_P (insn))
1528 5902 : continue;
1529 :
1530 46867541 : this_block = insn_scope (insn);
1531 : /* For sequences compute scope resulting from merging all scopes
1532 : of instructions nested inside. */
1533 46867541 : if (rtx_sequence *body = dyn_cast <rtx_sequence *> (PATTERN (insn)))
1534 : {
1535 : int i;
1536 :
1537 : this_block = NULL;
1538 0 : for (i = 0; i < body->len (); i++)
1539 0 : this_block = choose_inner_scope (this_block,
1540 0 : insn_scope (body->insn (i)));
1541 : }
1542 46867541 : if (! this_block)
1543 : {
1544 10532242 : if (INSN_LOCATION (insn) == UNKNOWN_LOCATION)
1545 5157104 : continue;
1546 : else
1547 5375138 : this_block = DECL_INITIAL (cfun->decl);
1548 : }
1549 :
1550 36335299 : set_cur_block_to_this_block:
1551 53449588 : if (this_block != cur_block)
1552 : {
1553 17592107 : change_scope (insn, cur_block, this_block);
1554 17592107 : cur_block = this_block;
1555 : }
1556 : }
1557 :
1558 : /* change_scope emits before the insn, not after. */
1559 585961 : rtx_note *note = emit_note (NOTE_INSN_DELETED);
1560 585961 : change_scope (note, cur_block, DECL_INITIAL (cfun->decl));
1561 585961 : delete_insn (note);
1562 :
1563 585961 : reorder_blocks ();
1564 585961 : }
1565 :
1566 : static const char *some_local_dynamic_name;
1567 :
1568 : /* Locate some local-dynamic symbol still in use by this function
1569 : so that we can print its name in local-dynamic base patterns.
1570 : Return null if there are no local-dynamic references. */
1571 :
1572 : const char *
1573 206 : get_some_local_dynamic_name ()
1574 : {
1575 206 : subrtx_iterator::array_type array;
1576 206 : rtx_insn *insn;
1577 :
1578 206 : if (some_local_dynamic_name)
1579 : return some_local_dynamic_name;
1580 :
1581 8634 : for (insn = get_insns (); insn ; insn = NEXT_INSN (insn))
1582 8633 : if (NONDEBUG_INSN_P (insn))
1583 17592 : FOR_EACH_SUBRTX (iter, array, PATTERN (insn), ALL)
1584 : {
1585 15267 : const_rtx x = *iter;
1586 15267 : if (GET_CODE (x) == SYMBOL_REF)
1587 : {
1588 530 : if (SYMBOL_REF_TLS_MODEL (x) == TLS_MODEL_LOCAL_DYNAMIC)
1589 184 : return some_local_dynamic_name = XSTR (x, 0);
1590 346 : if (CONSTANT_POOL_ADDRESS_P (x))
1591 0 : iter.substitute (get_pool_constant (x));
1592 : }
1593 : }
1594 :
1595 : return 0;
1596 206 : }
1597 :
1598 : /* Arrange for us to emit a source location note before any further
1599 : real insns or section changes, by setting the SEEN_NEXT_VIEW bit in
1600 : *SEEN, as long as we are keeping track of location views. The bit
1601 : indicates we have referenced the next view at the current PC, so we
1602 : have to emit it. This should be called next to the var_location
1603 : debug hook. */
1604 :
1605 : static inline void
1606 67618757 : set_next_view_needed (int *seen)
1607 : {
1608 67618757 : if (debug_variable_location_views)
1609 67618757 : *seen |= SEEN_NEXT_VIEW;
1610 : }
1611 :
1612 : /* Clear the flag in *SEEN indicating we need to emit the next view.
1613 : This should be called next to the source_line debug hook. */
1614 :
1615 : static inline void
1616 48755373 : clear_next_view_needed (int *seen)
1617 : {
1618 48755373 : *seen &= ~SEEN_NEXT_VIEW;
1619 : }
1620 :
1621 : /* Test whether we have a pending request to emit the next view in
1622 : *SEEN, and emit it if needed, clearing the request bit. */
1623 :
1624 : static inline void
1625 93206687 : maybe_output_next_view (int *seen)
1626 : {
1627 93206687 : if ((*seen & SEEN_NEXT_VIEW) != 0)
1628 : {
1629 9087853 : clear_next_view_needed (seen);
1630 9087853 : (*debug_hooks->source_line) (last_linenum, last_columnnum,
1631 : last_filename, last_discriminator,
1632 : false);
1633 : }
1634 93206687 : }
1635 :
1636 : /* We want to emit param bindings (before the first begin_stmt) in the
1637 : initial view, if we are emitting views. To that end, we may
1638 : consume initial notes in the function, processing them in
1639 : final_start_function, before signaling the beginning of the
1640 : prologue, rather than in final.
1641 :
1642 : We don't test whether the DECLs are PARM_DECLs: the assumption is
1643 : that there will be a NOTE_INSN_BEGIN_STMT marker before any
1644 : non-parameter NOTE_INSN_VAR_LOCATION. It's ok if the marker is not
1645 : there, we'll just have more variable locations bound in the initial
1646 : view, which is consistent with their being bound without any code
1647 : that would give them a value. */
1648 :
1649 : static inline bool
1650 2990744 : in_initial_view_p (rtx_insn *insn)
1651 : {
1652 2990744 : return (!DECL_IGNORED_P (current_function_decl)
1653 2980462 : && debug_variable_location_views
1654 1974646 : && insn && GET_CODE (insn) == NOTE
1655 4796877 : && (NOTE_KIND (insn) == NOTE_INSN_VAR_LOCATION
1656 844299 : || NOTE_KIND (insn) == NOTE_INSN_DELETED));
1657 : }
1658 :
1659 : /* Output assembler code for the start of a function,
1660 : and initialize some of the variables in this file
1661 : for the new function. The label for the function and associated
1662 : assembler pseudo-ops have already been output in `assemble_start_function'.
1663 :
1664 : FIRST is the first insn of the rtl for the function being compiled.
1665 : FILE is the file to write assembler code to.
1666 : SEEN should be initially set to zero, and it may be updated to
1667 : indicate we have references to the next location view, that would
1668 : require us to emit it at the current PC.
1669 : OPTIMIZE_P is nonzero if we should eliminate redundant
1670 : test and compare insns. */
1671 :
1672 : static void
1673 1520620 : final_start_function_1 (rtx_insn **firstp, FILE *file, int *seen,
1674 : int optimize_p ATTRIBUTE_UNUSED)
1675 : {
1676 1520620 : block_depth = 0;
1677 :
1678 1520620 : this_is_asm_operands = 0;
1679 :
1680 1520620 : need_profile_function = false;
1681 :
1682 1520620 : last_filename = LOCATION_FILE (prologue_location);
1683 1520620 : last_linenum = LOCATION_LINE (prologue_location);
1684 1520620 : last_columnnum = LOCATION_COLUMN (prologue_location);
1685 1520620 : last_discriminator = 0;
1686 1520620 : force_source_line = false;
1687 :
1688 1520620 : high_block_linenum = high_function_linenum = last_linenum;
1689 :
1690 1520620 : rtx_insn *first = *firstp;
1691 1520620 : if (in_initial_view_p (first))
1692 : {
1693 1468228 : do
1694 : {
1695 1468228 : final_scan_insn (first, file, 0, 0, seen);
1696 1468228 : first = NEXT_INSN (first);
1697 : }
1698 1468228 : while (in_initial_view_p (first));
1699 506394 : *firstp = first;
1700 : }
1701 :
1702 1520620 : if (!DECL_IGNORED_P (current_function_decl))
1703 1510338 : debug_hooks->begin_prologue (last_linenum, last_columnnum,
1704 : last_filename);
1705 :
1706 1520620 : if (!dwarf2_debug_info_emitted_p (current_function_decl))
1707 942701 : dwarf2out_begin_prologue (0, 0, NULL);
1708 :
1709 1520620 : if (DECL_IGNORED_P (current_function_decl) && last_linenum && last_filename)
1710 6088 : debug_hooks->set_ignored_loc (last_linenum, last_columnnum, last_filename);
1711 :
1712 : #ifdef LEAF_REG_REMAP
1713 : if (crtl->uses_only_leaf_regs)
1714 : leaf_renumber_regs (first);
1715 : #endif
1716 :
1717 : /* The Sun386i and perhaps other machines don't work right
1718 : if the profiling code comes after the prologue. */
1719 1520620 : if (targetm.profile_before_prologue () && crtl->profile)
1720 : {
1721 296 : if (targetm.asm_out.function_prologue == default_function_pro_epilogue
1722 296 : && targetm.have_prologue ())
1723 : {
1724 : rtx_insn *insn;
1725 592 : for (insn = first; insn; insn = NEXT_INSN (insn))
1726 592 : if (!NOTE_P (insn))
1727 : {
1728 : insn = NULL;
1729 : break;
1730 : }
1731 592 : else if (NOTE_KIND (insn) == NOTE_INSN_BASIC_BLOCK
1732 296 : || NOTE_KIND (insn) == NOTE_INSN_FUNCTION_BEG)
1733 : break;
1734 296 : else if (NOTE_KIND (insn) == NOTE_INSN_DELETED
1735 0 : || NOTE_KIND (insn) == NOTE_INSN_VAR_LOCATION)
1736 296 : continue;
1737 : else
1738 : {
1739 : insn = NULL;
1740 : break;
1741 : }
1742 :
1743 296 : if (insn)
1744 296 : need_profile_function = true;
1745 : else
1746 0 : profile_function (file);
1747 : }
1748 : else
1749 0 : profile_function (file);
1750 : }
1751 :
1752 : /* If debugging, assign block numbers to all of the blocks in this
1753 : function. */
1754 1520620 : if (write_symbols)
1755 : {
1756 585961 : reemit_insn_block_notes ();
1757 585961 : number_blocks (current_function_decl);
1758 : /* We never actually put out begin/end notes for the top-level
1759 : block in the function. But, conceptually, that block is
1760 : always needed. */
1761 585961 : TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl)) = 1;
1762 : }
1763 :
1764 1520620 : unsigned HOST_WIDE_INT min_frame_size
1765 1520620 : = constant_lower_bound (get_frame_size ());
1766 1520620 : if (min_frame_size > (unsigned HOST_WIDE_INT) warn_frame_larger_than_size)
1767 : {
1768 : /* Issue a warning */
1769 6 : warning (OPT_Wframe_larger_than_,
1770 : "the frame size of %wu bytes is larger than %wu bytes",
1771 : min_frame_size, warn_frame_larger_than_size);
1772 : }
1773 :
1774 : /* First output the function prologue: code to set up the stack frame. */
1775 1520620 : targetm.asm_out.function_prologue (file);
1776 :
1777 : /* If the machine represents the prologue as RTL, the profiling code must
1778 : be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1779 1520620 : if (! targetm.have_prologue ())
1780 0 : profile_after_prologue (file);
1781 1520620 : }
1782 :
1783 : /* This is an exported final_start_function_1, callable without SEEN. */
1784 :
1785 : void
1786 5497 : final_start_function (rtx_insn *first, FILE *file,
1787 : int optimize_p ATTRIBUTE_UNUSED)
1788 : {
1789 5497 : int seen = 0;
1790 5497 : final_start_function_1 (&first, file, &seen, optimize_p);
1791 5497 : gcc_assert (seen == 0);
1792 5497 : }
1793 :
1794 : static void
1795 1517019 : profile_after_prologue (FILE *file ATTRIBUTE_UNUSED)
1796 : {
1797 1517019 : if (!targetm.profile_before_prologue () && crtl->profile)
1798 12 : profile_function (file);
1799 1517019 : }
1800 :
1801 : static void
1802 308 : profile_function (FILE *file ATTRIBUTE_UNUSED)
1803 : {
1804 : #ifndef NO_PROFILE_COUNTERS
1805 : # define NO_PROFILE_COUNTERS 0
1806 : #endif
1807 : #ifdef ASM_OUTPUT_REG_PUSH
1808 308 : rtx sval = NULL, chain = NULL;
1809 :
1810 308 : if (cfun->returns_struct)
1811 0 : sval = targetm.calls.struct_value_rtx (TREE_TYPE (current_function_decl),
1812 : true);
1813 308 : if (cfun->static_chain_decl)
1814 1 : chain = targetm.calls.static_chain (current_function_decl, true);
1815 : #endif /* ASM_OUTPUT_REG_PUSH */
1816 :
1817 308 : if (! NO_PROFILE_COUNTERS)
1818 : {
1819 : int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1820 : switch_to_section (data_section);
1821 : ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1822 : targetm.asm_out.internal_label (file, "LP", current_function_funcdef_no);
1823 : assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, align, 1);
1824 : }
1825 :
1826 308 : switch_to_section (current_function_section ());
1827 :
1828 : #ifdef ASM_OUTPUT_REG_PUSH
1829 308 : if (sval && REG_P (sval))
1830 0 : ASM_OUTPUT_REG_PUSH (file, REGNO (sval));
1831 308 : if (chain && REG_P (chain))
1832 1 : ASM_OUTPUT_REG_PUSH (file, REGNO (chain));
1833 : #endif
1834 :
1835 308 : FUNCTION_PROFILER (file, current_function_funcdef_no);
1836 :
1837 : #ifdef ASM_OUTPUT_REG_PUSH
1838 308 : if (chain && REG_P (chain))
1839 1 : ASM_OUTPUT_REG_POP (file, REGNO (chain));
1840 308 : if (sval && REG_P (sval))
1841 0 : ASM_OUTPUT_REG_POP (file, REGNO (sval));
1842 : #endif
1843 308 : }
1844 :
1845 : /* Output assembler code for the end of a function.
1846 : For clarity, args are same as those of `final_start_function'
1847 : even though not all of them are needed. */
1848 :
1849 : void
1850 1520620 : final_end_function (void)
1851 : {
1852 1520620 : app_disable ();
1853 :
1854 1520620 : if (!DECL_IGNORED_P (current_function_decl))
1855 1510338 : debug_hooks->end_function (high_function_linenum);
1856 :
1857 : /* Finally, output the function epilogue:
1858 : code to restore the stack frame and return to the caller. */
1859 1520620 : targetm.asm_out.function_epilogue (asm_out_file);
1860 :
1861 : /* And debug output. */
1862 1520620 : if (!DECL_IGNORED_P (current_function_decl))
1863 1510338 : debug_hooks->end_epilogue (last_linenum, last_filename);
1864 :
1865 1520620 : if (!dwarf2_debug_info_emitted_p (current_function_decl)
1866 1520620 : && dwarf2out_do_frame ())
1867 942645 : dwarf2out_end_epilogue (last_linenum, last_filename);
1868 :
1869 1520620 : some_local_dynamic_name = 0;
1870 1520620 : }
1871 :
1872 :
1873 : /* Dumper helper for basic block information. FILE is the assembly
1874 : output file, and INSN is the instruction being emitted. */
1875 :
1876 : static void
1877 276570468 : dump_basic_block_info (FILE *file, rtx_insn *insn, basic_block *start_to_bb,
1878 : basic_block *end_to_bb, int bb_map_size, int *bb_seqn)
1879 : {
1880 276570468 : basic_block bb;
1881 :
1882 276570468 : if (!flag_debug_asm)
1883 : return;
1884 :
1885 34287 : if (INSN_UID (insn) < bb_map_size
1886 34287 : && (bb = start_to_bb[INSN_UID (insn)]) != NULL)
1887 : {
1888 2100 : edge e;
1889 2100 : edge_iterator ei;
1890 :
1891 2100 : fprintf (file, "%s BLOCK %d", ASM_COMMENT_START, bb->index);
1892 2100 : if (bb->count.initialized_p ())
1893 : {
1894 164 : fprintf (file, ", count:");
1895 164 : bb->count.dump (file);
1896 : }
1897 2100 : fprintf (file, " seq:%d", (*bb_seqn)++);
1898 2100 : fprintf (file, "\n%s PRED:", ASM_COMMENT_START);
1899 4490 : FOR_EACH_EDGE (e, ei, bb->preds)
1900 : {
1901 2390 : dump_edge_info (file, e, TDF_DETAILS, 0);
1902 : }
1903 2100 : fprintf (file, "\n");
1904 : }
1905 34287 : if (INSN_UID (insn) < bb_map_size
1906 34287 : && (bb = end_to_bb[INSN_UID (insn)]) != NULL)
1907 : {
1908 2100 : edge e;
1909 2100 : edge_iterator ei;
1910 :
1911 2100 : fprintf (asm_out_file, "%s SUCC:", ASM_COMMENT_START);
1912 4488 : FOR_EACH_EDGE (e, ei, bb->succs)
1913 : {
1914 2388 : dump_edge_info (asm_out_file, e, TDF_DETAILS, 1);
1915 : }
1916 2100 : fprintf (file, "\n");
1917 : }
1918 : }
1919 :
1920 : /* Output assembler code for some insns: all or part of a function.
1921 : For description of args, see `final_start_function', above. */
1922 :
1923 : static void
1924 1517019 : final_1 (rtx_insn *first, FILE *file, int seen, int optimize_p)
1925 : {
1926 1517019 : rtx_insn *insn, *next;
1927 :
1928 : /* Used for -dA dump. */
1929 1517019 : basic_block *start_to_bb = NULL;
1930 1517019 : basic_block *end_to_bb = NULL;
1931 1517019 : int bb_map_size = 0;
1932 1517019 : int bb_seqn = 0;
1933 :
1934 1517019 : last_ignored_compare = 0;
1935 :
1936 1517019 : init_recog ();
1937 :
1938 1517019 : CC_STATUS_INIT;
1939 :
1940 1517019 : if (flag_debug_asm)
1941 : {
1942 1210 : basic_block bb;
1943 :
1944 1210 : bb_map_size = get_max_uid () + 1;
1945 1210 : start_to_bb = XCNEWVEC (basic_block, bb_map_size);
1946 1210 : end_to_bb = XCNEWVEC (basic_block, bb_map_size);
1947 :
1948 : /* There is no cfg for a thunk. */
1949 1210 : if (!cfun->is_thunk)
1950 3304 : FOR_EACH_BB_REVERSE_FN (bb, cfun)
1951 : {
1952 2100 : start_to_bb[INSN_UID (BB_HEAD (bb))] = bb;
1953 2100 : end_to_bb[INSN_UID (BB_END (bb))] = bb;
1954 : }
1955 : }
1956 :
1957 : /* Output the insns. */
1958 278087487 : for (insn = first; insn;)
1959 : {
1960 276570468 : if (HAVE_ATTR_length)
1961 : {
1962 276570468 : if ((unsigned) INSN_UID (insn) >= INSN_ADDRESSES_SIZE ())
1963 : {
1964 : /* This can be triggered by bugs elsewhere in the compiler if
1965 : new insns are created after init_insn_lengths is called. */
1966 61855341 : gcc_assert (NOTE_P (insn));
1967 61855341 : insn_current_address = -1;
1968 : }
1969 : else
1970 214715127 : insn_current_address = INSN_ADDRESSES (INSN_UID (insn));
1971 : /* final can be seen as an iteration of shorten_branches that
1972 : does nothing (since a fixed point has already been reached). */
1973 276570468 : insn_last_address = insn_current_address;
1974 : }
1975 :
1976 276570468 : dump_basic_block_info (file, insn, start_to_bb, end_to_bb,
1977 : bb_map_size, &bb_seqn);
1978 276570468 : insn = final_scan_insn (insn, file, optimize_p, 0, &seen);
1979 : }
1980 :
1981 1517019 : maybe_output_next_view (&seen);
1982 :
1983 1517019 : if (flag_debug_asm)
1984 : {
1985 1210 : free (start_to_bb);
1986 1210 : free (end_to_bb);
1987 : }
1988 :
1989 : /* Remove CFI notes, to avoid compare-debug failures. */
1990 278087487 : for (insn = first; insn; insn = next)
1991 : {
1992 276570468 : next = NEXT_INSN (insn);
1993 276570468 : if (NOTE_P (insn)
1994 168940320 : && (NOTE_KIND (insn) == NOTE_INSN_CFI
1995 168940320 : || NOTE_KIND (insn) == NOTE_INSN_CFI_LABEL))
1996 12121495 : delete_insn (insn);
1997 : }
1998 1517019 : }
1999 :
2000 : /* This is an exported final_1, callable without SEEN. */
2001 :
2002 : void
2003 1896 : final (rtx_insn *first, FILE *file, int optimize_p)
2004 : {
2005 : /* Those that use the internal final_start_function_1/final_1 API
2006 : skip initial debug bind notes in final_start_function_1, and pass
2007 : the modified FIRST to final_1. But those that use the public
2008 : final_start_function/final APIs, final_start_function can't move
2009 : FIRST because it's not passed by reference, so if they were
2010 : skipped there, skip them again here. */
2011 1896 : while (in_initial_view_p (first))
2012 0 : first = NEXT_INSN (first);
2013 :
2014 1896 : final_1 (first, file, 0, optimize_p);
2015 1896 : }
2016 :
2017 : const char *
2018 94574748 : get_insn_template (int code, rtx_insn *insn)
2019 : {
2020 94574748 : switch (insn_data[code].output_format)
2021 : {
2022 17975265 : case INSN_OUTPUT_FORMAT_SINGLE:
2023 17975265 : return insn_data[code].output.single;
2024 10265086 : case INSN_OUTPUT_FORMAT_MULTI:
2025 10265086 : return insn_data[code].output.multi[which_alternative];
2026 66334397 : case INSN_OUTPUT_FORMAT_FUNCTION:
2027 66334397 : gcc_assert (insn);
2028 66334397 : return (*insn_data[code].output.function) (recog_data.operand, insn);
2029 :
2030 0 : default:
2031 0 : gcc_unreachable ();
2032 : }
2033 : }
2034 :
2035 : /* Emit the appropriate declaration for an alternate-entry-point
2036 : symbol represented by INSN, to FILE. INSN is a CODE_LABEL with
2037 : LABEL_KIND != LABEL_NORMAL.
2038 :
2039 : The case fall-through in this function is intentional. */
2040 : static void
2041 0 : output_alternate_entry_point (FILE *file, rtx_insn *insn)
2042 : {
2043 0 : const char *name = LABEL_NAME (insn);
2044 :
2045 0 : switch (LABEL_KIND (insn))
2046 : {
2047 0 : case LABEL_WEAK_ENTRY:
2048 : #ifdef ASM_WEAKEN_LABEL
2049 0 : ASM_WEAKEN_LABEL (file, name);
2050 0 : gcc_fallthrough ();
2051 : #endif
2052 0 : case LABEL_GLOBAL_ENTRY:
2053 0 : targetm.asm_out.globalize_label (file, name);
2054 0 : gcc_fallthrough ();
2055 0 : case LABEL_STATIC_ENTRY:
2056 : #ifdef ASM_OUTPUT_TYPE_DIRECTIVE
2057 0 : ASM_OUTPUT_TYPE_DIRECTIVE (file, name, "function");
2058 : #endif
2059 0 : ASM_OUTPUT_LABEL (file, name);
2060 0 : break;
2061 :
2062 0 : case LABEL_NORMAL:
2063 0 : default:
2064 0 : gcc_unreachable ();
2065 : }
2066 0 : }
2067 :
2068 : /* Given a CALL_INSN, find and return the nested CALL. */
2069 : static rtx
2070 39332891 : call_from_call_insn (const rtx_call_insn *insn)
2071 : {
2072 39332891 : rtx x;
2073 39332891 : gcc_assert (CALL_P (insn));
2074 39332891 : x = PATTERN (insn);
2075 :
2076 56208328 : while (GET_CODE (x) != CALL)
2077 : {
2078 16875437 : switch (GET_CODE (x))
2079 : {
2080 0 : default:
2081 0 : gcc_unreachable ();
2082 0 : case COND_EXEC:
2083 0 : x = COND_EXEC_CODE (x);
2084 0 : break;
2085 1698361 : case PARALLEL:
2086 1698361 : x = XVECEXP (x, 0, 0);
2087 1698361 : break;
2088 15177076 : case SET:
2089 15177076 : x = XEXP (x, 1);
2090 15177076 : break;
2091 : }
2092 : }
2093 39332891 : return x;
2094 : }
2095 :
2096 : /* Return the CALL in X if there is one. */
2097 :
2098 : rtx
2099 33052912 : get_call_rtx_from (const rtx_insn *insn)
2100 : {
2101 33052912 : const rtx_call_insn *call_insn = as_a<const rtx_call_insn *> (insn);
2102 33052912 : return call_from_call_insn (call_insn);
2103 : }
2104 :
2105 : /* Print a comment into the asm showing FILENAME, LINENUM, and the
2106 : corresponding source line, if available. */
2107 :
2108 : static void
2109 32 : asm_show_source (const char *filename, int linenum)
2110 : {
2111 32 : if (!filename)
2112 0 : return;
2113 :
2114 32 : diagnostics::char_span line
2115 32 : = global_dc->get_file_cache ().get_source_line (filename, linenum);
2116 32 : if (!line)
2117 : return;
2118 :
2119 32 : fprintf (asm_out_file, "%s %s:%i: ", ASM_COMMENT_START, filename, linenum);
2120 : /* "line" is not 0-terminated, so we must use its length. */
2121 32 : fwrite (line.get_buffer (), 1, line.length (), asm_out_file);
2122 32 : fputc ('\n', asm_out_file);
2123 : }
2124 :
2125 : /* Judge if an absolute jump table is relocatable. */
2126 :
2127 : bool
2128 13784 : jumptable_relocatable (void)
2129 : {
2130 13784 : bool relocatable = false;
2131 :
2132 13784 : if (!CASE_VECTOR_PC_RELATIVE
2133 13784 : && !targetm.asm_out.generate_pic_addr_diff_vec ()
2134 13784 : && targetm_common.have_named_sections)
2135 11432 : relocatable = targetm.asm_out.reloc_rw_mask ();
2136 :
2137 13784 : return relocatable;
2138 : }
2139 :
2140 : /* The final scan for one insn, INSN.
2141 : Args are same as in `final', except that INSN
2142 : is the insn being scanned.
2143 : Value returned is the next insn to be scanned.
2144 :
2145 : NOPEEPHOLES is the flag to disallow peephole processing (currently
2146 : used for within delayed branch sequence output).
2147 :
2148 : SEEN is used to track the end of the prologue, for emitting
2149 : debug information. We force the emission of a line note after
2150 : both NOTE_INSN_PROLOGUE_END and NOTE_INSN_FUNCTION_BEG. */
2151 :
2152 : static rtx_insn *
2153 278038696 : final_scan_insn_1 (rtx_insn *insn, FILE *file, int optimize_p ATTRIBUTE_UNUSED,
2154 : int nopeepholes ATTRIBUTE_UNUSED, int *seen)
2155 : {
2156 278038696 : rtx_insn *next;
2157 278038696 : rtx_jump_table_data *table;
2158 :
2159 278038696 : insn_counter++;
2160 :
2161 : /* Ignore deleted insns. These can occur when we split insns (due to a
2162 : template of "#") while not optimizing. */
2163 278038696 : if (insn->deleted ())
2164 0 : return NEXT_INSN (insn);
2165 :
2166 278038696 : switch (GET_CODE (insn))
2167 : {
2168 170408548 : case NOTE:
2169 170408548 : switch (NOTE_KIND (insn))
2170 : {
2171 : case NOTE_INSN_DELETED:
2172 : case NOTE_INSN_UPDATE_SJLJ_CONTEXT:
2173 : break;
2174 :
2175 65794 : case NOTE_INSN_SWITCH_TEXT_SECTIONS:
2176 65794 : maybe_output_next_view (seen);
2177 :
2178 65794 : output_function_exception_table (0);
2179 :
2180 65794 : if (targetm.asm_out.unwind_emit)
2181 0 : targetm.asm_out.unwind_emit (asm_out_file, insn);
2182 :
2183 65794 : in_cold_section_p = !in_cold_section_p;
2184 :
2185 65794 : gcc_checking_assert (in_cold_section_p);
2186 65794 : if (in_cold_section_p)
2187 65794 : cold_function_name
2188 65794 : = clone_function_name (current_function_decl, "cold");
2189 :
2190 65794 : if (dwarf2out_do_frame ())
2191 : {
2192 65792 : dwarf2out_switch_text_section ();
2193 65792 : if (!dwarf2_debug_info_emitted_p (current_function_decl)
2194 65792 : && !DECL_IGNORED_P (current_function_decl))
2195 43095 : debug_hooks->switch_text_section ();
2196 : }
2197 2 : else if (!DECL_IGNORED_P (current_function_decl))
2198 1 : debug_hooks->switch_text_section ();
2199 65826 : if (DECL_IGNORED_P (current_function_decl) && last_linenum
2200 65826 : && last_filename)
2201 32 : debug_hooks->set_ignored_loc (last_linenum, last_columnnum,
2202 : last_filename);
2203 :
2204 65794 : switch_to_section (current_function_section ());
2205 65794 : targetm.asm_out.function_switched_text_sections (asm_out_file,
2206 : current_function_decl,
2207 : in_cold_section_p);
2208 : /* Emit a label for the split cold section. Form label name by
2209 : suffixing "cold" to the original function's name. */
2210 65794 : if (in_cold_section_p)
2211 : {
2212 : #ifdef ASM_DECLARE_COLD_FUNCTION_NAME
2213 65794 : ASM_DECLARE_COLD_FUNCTION_NAME (asm_out_file,
2214 : IDENTIFIER_POINTER
2215 : (cold_function_name),
2216 : current_function_decl);
2217 : #else
2218 : ASM_OUTPUT_LABEL (asm_out_file,
2219 : IDENTIFIER_POINTER (cold_function_name));
2220 : #endif
2221 65794 : if (dwarf2out_do_frame ()
2222 65794 : && cfun->fde->dw_fde_second_begin != NULL)
2223 65792 : ASM_OUTPUT_LABEL (asm_out_file, cfun->fde->dw_fde_second_begin);
2224 : }
2225 : break;
2226 :
2227 14552020 : case NOTE_INSN_BASIC_BLOCK:
2228 14552020 : if (need_profile_function)
2229 : {
2230 296 : profile_function (asm_out_file);
2231 296 : need_profile_function = false;
2232 : }
2233 :
2234 14552020 : if (targetm.asm_out.unwind_emit)
2235 0 : targetm.asm_out.unwind_emit (asm_out_file, insn);
2236 :
2237 : break;
2238 :
2239 426288 : case NOTE_INSN_EH_REGION_BEG:
2240 426288 : ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHB",
2241 : NOTE_EH_HANDLER (insn));
2242 426288 : break;
2243 :
2244 426288 : case NOTE_INSN_EH_REGION_END:
2245 426288 : ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHE",
2246 : NOTE_EH_HANDLER (insn));
2247 426288 : break;
2248 :
2249 1517019 : case NOTE_INSN_PROLOGUE_END:
2250 1517019 : targetm.asm_out.function_end_prologue (file);
2251 1517019 : profile_after_prologue (file);
2252 :
2253 1517019 : if ((*seen & (SEEN_EMITTED | SEEN_NOTE)) == SEEN_NOTE)
2254 : {
2255 637053 : *seen |= SEEN_EMITTED;
2256 637053 : force_source_line = true;
2257 : }
2258 : else
2259 879966 : *seen |= SEEN_NOTE;
2260 :
2261 : break;
2262 :
2263 1616444 : case NOTE_INSN_EPILOGUE_BEG:
2264 1616444 : if (!DECL_IGNORED_P (current_function_decl))
2265 1611364 : (*debug_hooks->begin_epilogue) (last_linenum, last_filename);
2266 1616444 : targetm.asm_out.function_begin_epilogue (file);
2267 1616444 : break;
2268 :
2269 12115787 : case NOTE_INSN_CFI:
2270 12115787 : dwarf2out_emit_cfi (NOTE_CFI (insn));
2271 12115787 : break;
2272 :
2273 5708 : case NOTE_INSN_CFI_LABEL:
2274 5708 : ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LCFI",
2275 : NOTE_LABEL_NUMBER (insn));
2276 5708 : break;
2277 :
2278 1515123 : case NOTE_INSN_FUNCTION_BEG:
2279 1515123 : if (need_profile_function)
2280 : {
2281 0 : profile_function (asm_out_file);
2282 0 : need_profile_function = false;
2283 : }
2284 :
2285 1515123 : app_disable ();
2286 1515123 : if (!DECL_IGNORED_P (current_function_decl))
2287 1508442 : debug_hooks->end_prologue (last_linenum, last_filename);
2288 :
2289 1515123 : if ((*seen & (SEEN_EMITTED | SEEN_NOTE)) == SEEN_NOTE)
2290 : {
2291 878070 : *seen |= SEEN_EMITTED;
2292 878070 : force_source_line = true;
2293 : }
2294 : else
2295 637053 : *seen |= SEEN_NOTE;
2296 :
2297 : break;
2298 :
2299 24866921 : case NOTE_INSN_BLOCK_BEG:
2300 24866921 : if (debug_info_level >= DINFO_LEVEL_NORMAL
2301 31426 : || dwarf_debuginfo_p ()
2302 24866921 : || write_symbols == VMS_DEBUG)
2303 : {
2304 24866921 : int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
2305 :
2306 24866921 : app_disable ();
2307 24866921 : ++block_depth;
2308 24866921 : high_block_linenum = last_linenum;
2309 :
2310 : /* Output debugging info about the symbol-block beginning. */
2311 24866921 : if (!DECL_IGNORED_P (current_function_decl))
2312 24866921 : debug_hooks->begin_block (last_linenum, n, NOTE_BLOCK (insn));
2313 :
2314 : /* Mark this block as output. */
2315 24866921 : TREE_ASM_WRITTEN (NOTE_BLOCK (insn)) = 1;
2316 24866921 : BLOCK_IN_COLD_SECTION_P (NOTE_BLOCK (insn)) = in_cold_section_p;
2317 : }
2318 : break;
2319 :
2320 24866921 : case NOTE_INSN_BLOCK_END:
2321 24866921 : maybe_output_next_view (seen);
2322 :
2323 24866921 : if (debug_info_level >= DINFO_LEVEL_NORMAL
2324 31426 : || dwarf_debuginfo_p ()
2325 24866921 : || write_symbols == VMS_DEBUG)
2326 : {
2327 24866921 : int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
2328 :
2329 24866921 : app_disable ();
2330 :
2331 : /* End of a symbol-block. */
2332 24866921 : --block_depth;
2333 24866921 : gcc_assert (block_depth >= 0);
2334 :
2335 24866921 : if (!DECL_IGNORED_P (current_function_decl))
2336 24866921 : debug_hooks->end_block (high_block_linenum, n);
2337 24866921 : gcc_assert (BLOCK_IN_COLD_SECTION_P (NOTE_BLOCK (insn))
2338 : == in_cold_section_p);
2339 : }
2340 : break;
2341 :
2342 58582 : case NOTE_INSN_DELETED_LABEL:
2343 : /* Emit the label. We may have deleted the CODE_LABEL because
2344 : the label could be proved to be unreachable, though still
2345 : referenced (in the form of having its address taken. */
2346 58582 : ASM_OUTPUT_DEBUG_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2347 58582 : break;
2348 :
2349 8745 : case NOTE_INSN_DELETED_DEBUG_LABEL:
2350 : /* Similarly, but need to use different namespace for it. */
2351 8745 : if (CODE_LABEL_NUMBER (insn) != -1)
2352 8745 : ASM_OUTPUT_DEBUG_LABEL (file, "LDL", CODE_LABEL_NUMBER (insn));
2353 : break;
2354 :
2355 67634955 : case NOTE_INSN_VAR_LOCATION:
2356 67634955 : if (!DECL_IGNORED_P (current_function_decl))
2357 : {
2358 67618757 : debug_hooks->var_location (insn);
2359 67618757 : set_next_view_needed (seen);
2360 : }
2361 : break;
2362 :
2363 4187742 : case NOTE_INSN_BEGIN_STMT:
2364 4187742 : gcc_checking_assert (cfun->debug_nonbind_markers);
2365 4187742 : if (!DECL_IGNORED_P (current_function_decl)
2366 4187742 : && notice_source_line (insn, NULL))
2367 : {
2368 11753661 : output_source_line:
2369 11753661 : (*debug_hooks->source_line) (last_linenum, last_columnnum,
2370 : last_filename, last_discriminator,
2371 : true);
2372 11753661 : clear_next_view_needed (seen);
2373 : }
2374 : break;
2375 :
2376 7565936 : case NOTE_INSN_INLINE_ENTRY:
2377 7565936 : gcc_checking_assert (cfun->debug_nonbind_markers);
2378 7565936 : if (!DECL_IGNORED_P (current_function_decl)
2379 7565936 : && notice_source_line (insn, NULL))
2380 : {
2381 7565919 : (*debug_hooks->inline_entry) (LOCATION_BLOCK
2382 : (NOTE_MARKER_LOCATION (insn)));
2383 7565919 : goto output_source_line;
2384 : }
2385 : break;
2386 :
2387 0 : default:
2388 0 : gcc_unreachable ();
2389 : break;
2390 : }
2391 : break;
2392 :
2393 : case BARRIER:
2394 : break;
2395 :
2396 7017263 : case CODE_LABEL:
2397 : /* The target port might emit labels in the output function for
2398 : some insn, e.g. sh.cc output_branchy_insn. */
2399 7017263 : if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2400 : {
2401 7017261 : align_flags alignment = LABEL_TO_ALIGNMENT (insn);
2402 8363133 : if (alignment.levels[0].log && NEXT_INSN (insn))
2403 : {
2404 : #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2405 : /* Output both primary and secondary alignment. */
2406 1345872 : ASM_OUTPUT_MAX_SKIP_ALIGN (file, alignment.levels[0].log,
2407 : alignment.levels[0].maxskip);
2408 1345872 : ASM_OUTPUT_MAX_SKIP_ALIGN (file, alignment.levels[1].log,
2409 : alignment.levels[1].maxskip);
2410 : #else
2411 : #ifdef ASM_OUTPUT_ALIGN_WITH_NOP
2412 : ASM_OUTPUT_ALIGN_WITH_NOP (file, alignment.levels[0].log);
2413 : #else
2414 : ASM_OUTPUT_ALIGN (file, alignment.levels[0].log);
2415 : #endif
2416 : #endif
2417 : }
2418 : }
2419 7017263 : CC_STATUS_INIT;
2420 :
2421 7017263 : if (!DECL_IGNORED_P (current_function_decl) && LABEL_NAME (insn))
2422 68638 : debug_hooks->label (as_a <rtx_code_label *> (insn));
2423 :
2424 7017263 : app_disable ();
2425 :
2426 : /* If this label is followed by a jump-table, make sure we put
2427 : the label in the read-only section. Also possibly write the
2428 : label and jump table together. */
2429 7017263 : table = jump_table_for_label (as_a <rtx_code_label *> (insn));
2430 7017263 : if (table)
2431 : {
2432 : #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2433 : /* In this case, the case vector is being moved by the
2434 : target, so don't output the label at all. Leave that
2435 : to the back end macros. */
2436 : #else
2437 6892 : if (! JUMP_TABLES_IN_TEXT_SECTION)
2438 : {
2439 6892 : int log_align;
2440 :
2441 6892 : switch_to_section (targetm.asm_out.function_rodata_section
2442 : (current_function_decl,
2443 : jumptable_relocatable ()));
2444 :
2445 : #ifdef ADDR_VEC_ALIGN
2446 6892 : log_align = ADDR_VEC_ALIGN (table);
2447 : #else
2448 : log_align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
2449 : #endif
2450 6892 : ASM_OUTPUT_ALIGN (file, log_align);
2451 : }
2452 : else
2453 : switch_to_section (current_function_section ());
2454 :
2455 : #ifdef ASM_OUTPUT_CASE_LABEL
2456 6892 : ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn), table);
2457 : #else
2458 : targetm.asm_out.internal_label (file, "L", CODE_LABEL_NUMBER (insn));
2459 : #endif
2460 : #endif
2461 6892 : break;
2462 : }
2463 7010371 : if (LABEL_ALT_ENTRY_P (insn))
2464 0 : output_alternate_entry_point (file, insn);
2465 : else
2466 7010371 : targetm.asm_out.internal_label (file, "L", CODE_LABEL_NUMBER (insn));
2467 : break;
2468 :
2469 95740254 : default:
2470 95740254 : {
2471 95740254 : rtx body = PATTERN (insn);
2472 95740254 : int insn_code_number;
2473 95740254 : const char *templ;
2474 95740254 : bool is_stmt, *is_stmt_p;
2475 :
2476 95740254 : if (MAY_HAVE_DEBUG_MARKER_INSNS && cfun->debug_nonbind_markers)
2477 : {
2478 22074830 : is_stmt = false;
2479 22074830 : is_stmt_p = NULL;
2480 : }
2481 : else
2482 : is_stmt_p = &is_stmt;
2483 :
2484 : /* Reset this early so it is correct for ASM statements. */
2485 95740254 : current_insn_predicate = NULL_RTX;
2486 :
2487 : /* An INSN, JUMP_INSN or CALL_INSN.
2488 : First check for special kinds that recog doesn't recognize. */
2489 :
2490 95740254 : if (GET_CODE (body) == USE /* These are just declarations. */
2491 95740254 : || GET_CODE (body) == CLOBBER)
2492 : break;
2493 :
2494 : /* Detect insns that are really jump-tables
2495 : and output them as such. */
2496 :
2497 94677704 : if (JUMP_TABLE_DATA_P (insn))
2498 : {
2499 : #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2500 6892 : int vlen, idx;
2501 : #endif
2502 :
2503 6892 : if (! JUMP_TABLES_IN_TEXT_SECTION)
2504 6892 : switch_to_section (targetm.asm_out.function_rodata_section
2505 : (current_function_decl,
2506 : jumptable_relocatable ()));
2507 : else
2508 : switch_to_section (current_function_section ());
2509 :
2510 6892 : app_disable ();
2511 :
2512 : #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2513 : if (GET_CODE (body) == ADDR_VEC)
2514 : {
2515 : #ifdef ASM_OUTPUT_ADDR_VEC
2516 : ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2517 : #else
2518 : gcc_unreachable ();
2519 : #endif
2520 : }
2521 : else
2522 : {
2523 : #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2524 : ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2525 : #else
2526 : gcc_unreachable ();
2527 : #endif
2528 : }
2529 : #else
2530 6892 : vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2531 168432 : for (idx = 0; idx < vlen; idx++)
2532 : {
2533 161540 : if (GET_CODE (body) == ADDR_VEC)
2534 : {
2535 : #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2536 134382 : ASM_OUTPUT_ADDR_VEC_ELT
2537 : (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2538 : #else
2539 : gcc_unreachable ();
2540 : #endif
2541 : }
2542 : else
2543 : {
2544 : #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2545 27158 : ASM_OUTPUT_ADDR_DIFF_ELT
2546 : (file,
2547 : body,
2548 : CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2549 : CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2550 : #else
2551 : gcc_unreachable ();
2552 : #endif
2553 : }
2554 : }
2555 : #ifdef ASM_OUTPUT_CASE_END
2556 : ASM_OUTPUT_CASE_END (file,
2557 : CODE_LABEL_NUMBER (PREV_INSN (insn)),
2558 : insn);
2559 : #endif
2560 : #endif
2561 :
2562 6892 : switch_to_section (current_function_section ());
2563 :
2564 6892 : if (debug_variable_location_views
2565 6892 : && !DECL_IGNORED_P (current_function_decl))
2566 5898 : debug_hooks->var_location (insn);
2567 :
2568 : break;
2569 : }
2570 : /* Output this line note if it is the first or the last line
2571 : note in a row. */
2572 94670812 : if (!DECL_IGNORED_P (current_function_decl)
2573 94670812 : && notice_source_line (insn, is_stmt_p))
2574 : {
2575 27913859 : if (flag_verbose_asm)
2576 32 : asm_show_source (last_filename, last_linenum);
2577 27913859 : (*debug_hooks->source_line) (last_linenum, last_columnnum,
2578 : last_filename, last_discriminator,
2579 : is_stmt);
2580 27913859 : clear_next_view_needed (seen);
2581 : }
2582 : else
2583 66756953 : maybe_output_next_view (seen);
2584 :
2585 94670812 : gcc_checking_assert (!DEBUG_INSN_P (insn));
2586 :
2587 94670812 : if (GET_CODE (body) == PARALLEL
2588 11815599 : && GET_CODE (XVECEXP (body, 0, 0)) == ASM_INPUT)
2589 94670812 : body = XVECEXP (body, 0, 0);
2590 :
2591 94670812 : if (GET_CODE (body) == ASM_INPUT)
2592 : {
2593 3112 : const char *string = XSTR (body, 0);
2594 :
2595 : /* There's no telling what that did to the condition codes. */
2596 3112 : CC_STATUS_INIT;
2597 :
2598 3112 : if (string[0])
2599 : {
2600 836 : expanded_location loc;
2601 :
2602 836 : app_enable ();
2603 836 : loc = expand_location (ASM_INPUT_SOURCE_LOCATION (body));
2604 836 : if (*loc.file && loc.line)
2605 836 : fprintf (asm_out_file, "%s %i \"%s\" 1\n",
2606 : ASM_COMMENT_START, loc.line, loc.file);
2607 836 : fprintf (asm_out_file, "\t%s\n", string);
2608 : #if HAVE_AS_LINE_ZERO
2609 836 : if (*loc.file && loc.line)
2610 836 : fprintf (asm_out_file, "%s 0 \"\" 2\n", ASM_COMMENT_START);
2611 : #endif
2612 : }
2613 : break;
2614 : }
2615 :
2616 : /* Detect `asm' construct with operands. */
2617 94667700 : if (asm_noperands (body) >= 0)
2618 : {
2619 93011 : unsigned int noperands = asm_noperands (body);
2620 93011 : rtx *ops = XALLOCAVEC (rtx, noperands);
2621 93011 : const char *string;
2622 93011 : location_t loc;
2623 93011 : expanded_location expanded;
2624 :
2625 : /* There's no telling what that did to the condition codes. */
2626 93011 : CC_STATUS_INIT;
2627 :
2628 : /* Get out the operand values. */
2629 93011 : string = decode_asm_operands (body, ops, NULL, NULL, NULL, &loc);
2630 : /* Inhibit dying on what would otherwise be compiler bugs. */
2631 93011 : insn_noperands = noperands;
2632 93011 : this_is_asm_operands = insn;
2633 93011 : expanded = expand_location (loc);
2634 :
2635 : #ifdef FINAL_PRESCAN_INSN
2636 : FINAL_PRESCAN_INSN (insn, ops, insn_noperands);
2637 : #endif
2638 :
2639 : /* Output the insn using them. */
2640 93011 : if (string[0])
2641 : {
2642 20106 : app_enable ();
2643 20106 : if (expanded.file && expanded.line)
2644 20046 : fprintf (asm_out_file, "%s %i \"%s\" 1\n",
2645 : ASM_COMMENT_START, expanded.line, expanded.file);
2646 20106 : output_asm_insn (string, ops);
2647 : #if HAVE_AS_LINE_ZERO
2648 20106 : if (expanded.file && expanded.line)
2649 20046 : fprintf (asm_out_file, "%s 0 \"\" 2\n", ASM_COMMENT_START);
2650 : #endif
2651 : }
2652 :
2653 93011 : if (targetm.asm_out.final_postscan_insn)
2654 0 : targetm.asm_out.final_postscan_insn (file, insn, ops,
2655 : insn_noperands);
2656 :
2657 93011 : this_is_asm_operands = 0;
2658 93011 : break;
2659 : }
2660 :
2661 94574689 : app_disable ();
2662 :
2663 94574689 : if (rtx_sequence *seq = dyn_cast <rtx_sequence *> (body))
2664 : {
2665 : /* A delayed-branch sequence */
2666 0 : int i;
2667 :
2668 0 : final_sequence = seq;
2669 :
2670 : /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2671 : force the restoration of a comparison that was previously
2672 : thought unnecessary. If that happens, cancel this sequence
2673 : and cause that insn to be restored. */
2674 :
2675 0 : next = final_scan_insn (seq->insn (0), file, 0, 1, seen);
2676 0 : if (next != seq->insn (1))
2677 : {
2678 0 : final_sequence = 0;
2679 0 : return next;
2680 : }
2681 :
2682 0 : for (i = 1; i < seq->len (); i++)
2683 : {
2684 0 : rtx_insn *insn = seq->insn (i);
2685 0 : rtx_insn *next = NEXT_INSN (insn);
2686 : /* We loop in case any instruction in a delay slot gets
2687 : split. */
2688 0 : do
2689 0 : insn = final_scan_insn (insn, file, 0, 1, seen);
2690 0 : while (insn != next);
2691 : }
2692 : #ifdef DBR_OUTPUT_SEQEND
2693 : DBR_OUTPUT_SEQEND (file);
2694 : #endif
2695 0 : final_sequence = 0;
2696 :
2697 : /* If the insn requiring the delay slot was a CALL_INSN, the
2698 : insns in the delay slot are actually executed before the
2699 : called function. Hence we don't preserve any CC-setting
2700 : actions in these insns and the CC must be marked as being
2701 : clobbered by the function. */
2702 0 : if (CALL_P (seq->insn (0)))
2703 : {
2704 0 : CC_STATUS_INIT;
2705 : }
2706 0 : break;
2707 : }
2708 :
2709 : /* We have a real machine instruction as rtl. */
2710 :
2711 94574689 : body = PATTERN (insn);
2712 :
2713 : /* Do machine-specific peephole optimizations if desired. */
2714 :
2715 94574689 : if (HAVE_peephole && optimize_p && !flag_no_peephole && !nopeepholes)
2716 : {
2717 : rtx_insn *next = peephole (insn);
2718 : /* When peepholing, if there were notes within the peephole,
2719 : emit them before the peephole. */
2720 : if (next != 0 && next != NEXT_INSN (insn))
2721 : {
2722 : rtx_insn *note, *prev = PREV_INSN (insn);
2723 :
2724 : for (note = NEXT_INSN (insn); note != next;
2725 : note = NEXT_INSN (note))
2726 : final_scan_insn (note, file, optimize_p, nopeepholes, seen);
2727 :
2728 : /* Put the notes in the proper position for a later
2729 : rescan. For example, the SH target can do this
2730 : when generating a far jump in a delayed branch
2731 : sequence. */
2732 : note = NEXT_INSN (insn);
2733 : SET_PREV_INSN (note) = prev;
2734 : SET_NEXT_INSN (prev) = note;
2735 : SET_NEXT_INSN (PREV_INSN (next)) = insn;
2736 : SET_PREV_INSN (insn) = PREV_INSN (next);
2737 : SET_NEXT_INSN (insn) = next;
2738 : SET_PREV_INSN (next) = insn;
2739 : }
2740 :
2741 : /* PEEPHOLE might have changed this. */
2742 : body = PATTERN (insn);
2743 : }
2744 :
2745 : /* Try to recognize the instruction.
2746 : If successful, verify that the operands satisfy the
2747 : constraints for the instruction. Crash if they don't,
2748 : since `reload' should have changed them so that they do. */
2749 :
2750 94574689 : insn_code_number = recog_memoized (insn);
2751 94574689 : cleanup_subreg_operands (insn);
2752 :
2753 : /* Dump the insn in the assembly for debugging (-dAP).
2754 : If the final dump is requested as slim RTL, dump slim
2755 : RTL to the assembly file also. */
2756 94574689 : if (flag_dump_rtl_in_asm)
2757 : {
2758 29 : print_rtx_head = ASM_COMMENT_START;
2759 29 : if (! (dump_flags & TDF_SLIM))
2760 29 : print_rtl_single (asm_out_file, insn);
2761 : else
2762 0 : dump_insn_slim (asm_out_file, insn);
2763 29 : print_rtx_head = "";
2764 : }
2765 :
2766 94574689 : if (! constrain_operands_cached (insn, 1))
2767 0 : fatal_insn_not_found (insn);
2768 :
2769 : /* Some target machines need to prescan each insn before
2770 : it is output. */
2771 :
2772 : #ifdef FINAL_PRESCAN_INSN
2773 : FINAL_PRESCAN_INSN (insn, recog_data.operand, recog_data.n_operands);
2774 : #endif
2775 :
2776 94574689 : if (targetm.have_conditional_execution ()
2777 94574689 : && GET_CODE (PATTERN (insn)) == COND_EXEC)
2778 0 : current_insn_predicate = COND_EXEC_TEST (PATTERN (insn));
2779 :
2780 94574689 : current_output_insn = debug_insn = insn;
2781 :
2782 : /* Find the proper template for this insn. */
2783 94574689 : templ = get_insn_template (insn_code_number, insn);
2784 :
2785 : /* If the C code returns 0, it means that it is a jump insn
2786 : which follows a deleted test insn, and that test insn
2787 : needs to be reinserted. */
2788 94574689 : if (templ == 0)
2789 : {
2790 0 : rtx_insn *prev;
2791 :
2792 0 : gcc_assert (prev_nonnote_insn (insn) == last_ignored_compare);
2793 :
2794 : /* We have already processed the notes between the setter and
2795 : the user. Make sure we don't process them again, this is
2796 : particularly important if one of the notes is a block
2797 : scope note or an EH note. */
2798 0 : for (prev = insn;
2799 0 : prev != last_ignored_compare;
2800 0 : prev = PREV_INSN (prev))
2801 : {
2802 0 : if (NOTE_P (prev))
2803 0 : delete_insn (prev); /* Use delete_note. */
2804 : }
2805 :
2806 : return prev;
2807 : }
2808 :
2809 : /* If the template is the string "#", it means that this insn must
2810 : be split. */
2811 94574689 : if (templ[0] == '#' && templ[1] == '\0')
2812 : {
2813 0 : rtx_insn *new_rtx = try_split (body, insn, 0);
2814 :
2815 : /* If we didn't split the insn, go away. */
2816 0 : if (new_rtx == insn && PATTERN (new_rtx) == body)
2817 0 : fatal_insn ("could not split insn", insn);
2818 :
2819 : /* If we have a length attribute, this instruction should have
2820 : been split in shorten_branches, to ensure that we would have
2821 : valid length info for the splitees. */
2822 0 : gcc_assert (!HAVE_ATTR_length);
2823 :
2824 : return new_rtx;
2825 : }
2826 :
2827 : /* ??? This will put the directives in the wrong place if
2828 : get_insn_template outputs assembly directly. However calling it
2829 : before get_insn_template breaks if the insns is split. */
2830 94574689 : if (targetm.asm_out.unwind_emit_before_insn
2831 94574689 : && targetm.asm_out.unwind_emit)
2832 0 : targetm.asm_out.unwind_emit (asm_out_file, insn);
2833 :
2834 94574689 : rtx_call_insn *call_insn = dyn_cast <rtx_call_insn *> (insn);
2835 6279979 : if (call_insn != NULL)
2836 : {
2837 6279979 : rtx x = call_from_call_insn (call_insn);
2838 6279979 : x = XEXP (x, 0);
2839 6279979 : if (x && MEM_P (x) && GET_CODE (XEXP (x, 0)) == SYMBOL_REF)
2840 : {
2841 6073296 : tree t;
2842 6073296 : x = XEXP (x, 0);
2843 6073296 : t = SYMBOL_REF_DECL (x);
2844 6073296 : if (t)
2845 5811560 : assemble_external (t);
2846 : }
2847 : }
2848 :
2849 : /* Output assembler code from the template. */
2850 94574689 : output_asm_insn (templ, recog_data.operand);
2851 :
2852 : /* Some target machines need to postscan each insn after
2853 : it is output. */
2854 94574689 : if (targetm.asm_out.final_postscan_insn)
2855 0 : targetm.asm_out.final_postscan_insn (file, insn, recog_data.operand,
2856 0 : recog_data.n_operands);
2857 :
2858 94574689 : if (!targetm.asm_out.unwind_emit_before_insn
2859 0 : && targetm.asm_out.unwind_emit)
2860 0 : targetm.asm_out.unwind_emit (asm_out_file, insn);
2861 :
2862 : /* Let the debug info back-end know about this call. We do this only
2863 : after the instruction has been emitted because labels that may be
2864 : created to reference the call instruction must appear after it. */
2865 51811283 : if ((debug_variable_location_views || call_insn != NULL)
2866 97566393 : && !DECL_IGNORED_P (current_function_decl))
2867 45724103 : debug_hooks->var_location (insn);
2868 :
2869 94574689 : current_output_insn = debug_insn = 0;
2870 : }
2871 : }
2872 278038696 : return NEXT_INSN (insn);
2873 : }
2874 :
2875 : /* This is a wrapper around final_scan_insn_1 that allows ports to
2876 : call it recursively without a known value for SEEN. The value is
2877 : saved at the outermost call, and recovered for recursive calls.
2878 : Recursive calls MUST pass NULL, or the same pointer if they can
2879 : otherwise get to it. */
2880 :
2881 : rtx_insn *
2882 278038696 : final_scan_insn (rtx_insn *insn, FILE *file, int optimize_p,
2883 : int nopeepholes, int *seen)
2884 : {
2885 278038696 : static int *enclosing_seen;
2886 278038696 : static int recursion_counter;
2887 :
2888 278038696 : gcc_assert (seen || recursion_counter);
2889 278038696 : gcc_assert (!recursion_counter || !seen || seen == enclosing_seen);
2890 :
2891 278038696 : if (!recursion_counter++)
2892 278038696 : enclosing_seen = seen;
2893 0 : else if (!seen)
2894 0 : seen = enclosing_seen;
2895 :
2896 278038696 : rtx_insn *ret = final_scan_insn_1 (insn, file, optimize_p, nopeepholes, seen);
2897 :
2898 278038696 : if (!--recursion_counter)
2899 278038696 : enclosing_seen = NULL;
2900 :
2901 278038696 : return ret;
2902 : }
2903 :
2904 :
2905 :
2906 : /* Map DECLs to instance discriminators. This is allocated and
2907 : defined in ada/gcc-interfaces/trans.cc, when compiling with -gnateS.
2908 : Mappings from this table are saved and restored for LTO, so
2909 : link-time compilation will have this map set, at least in
2910 : partitions containing at least one DECL with an associated instance
2911 : discriminator. */
2912 :
2913 : decl_to_instance_map_t *decl_to_instance_map;
2914 :
2915 : /* Return the instance number assigned to DECL. */
2916 :
2917 : static inline int
2918 0 : map_decl_to_instance (const_tree decl)
2919 : {
2920 0 : int *inst;
2921 :
2922 0 : if (!decl_to_instance_map || !decl || !DECL_P (decl))
2923 : return 0;
2924 :
2925 0 : inst = decl_to_instance_map->get (decl);
2926 :
2927 0 : if (!inst)
2928 : return 0;
2929 :
2930 0 : return *inst;
2931 : }
2932 :
2933 : /* Set DISCRIMINATOR to the appropriate value, possibly derived from LOC. */
2934 :
2935 : static inline int
2936 97422632 : compute_discriminator (location_t loc)
2937 : {
2938 97422632 : int discriminator;
2939 :
2940 97422632 : if (!decl_to_instance_map)
2941 97422632 : discriminator = get_discriminator_from_loc (loc);
2942 : else
2943 : {
2944 0 : tree block = LOCATION_BLOCK (loc);
2945 :
2946 0 : while (block && TREE_CODE (block) == BLOCK
2947 0 : && !inlined_function_outer_scope_p (block))
2948 0 : block = BLOCK_SUPERCONTEXT (block);
2949 :
2950 0 : tree decl;
2951 :
2952 0 : if (!block)
2953 0 : decl = current_function_decl;
2954 0 : else if (DECL_P (block))
2955 : decl = block;
2956 : else
2957 0 : decl = block_ultimate_origin (block);
2958 :
2959 0 : discriminator = map_decl_to_instance (decl);
2960 : }
2961 :
2962 97422632 : return discriminator;
2963 : }
2964 :
2965 : /* Return discriminator of the statement that produced this insn. */
2966 : int
2967 85668971 : insn_discriminator (const rtx_insn *insn)
2968 : {
2969 85668971 : return compute_discriminator (INSN_LOCATION (insn));
2970 : }
2971 :
2972 : /* Return whether a source line note needs to be emitted before INSN.
2973 : Sets IS_STMT to TRUE if the line should be marked as a possible
2974 : breakpoint location. */
2975 :
2976 : static bool
2977 106374971 : notice_source_line (rtx_insn *insn, bool *is_stmt)
2978 : {
2979 106374971 : const char *filename;
2980 106374971 : int linenum, columnnum;
2981 106374971 : int discriminator;
2982 :
2983 106374971 : if (NOTE_MARKER_P (insn))
2984 : {
2985 11753678 : location_t loc = NOTE_MARKER_LOCATION (insn);
2986 11753678 : expanded_location xloc = expand_location (loc);
2987 11753678 : if (xloc.line == 0
2988 11753678 : && (LOCATION_LOCUS (loc) == UNKNOWN_LOCATION
2989 27 : || LOCATION_LOCUS (loc) == BUILTINS_LOCATION))
2990 17 : return false;
2991 :
2992 11753661 : filename = xloc.file;
2993 11753661 : linenum = xloc.line;
2994 11753661 : columnnum = xloc.column;
2995 11753661 : discriminator = compute_discriminator (loc);
2996 11753661 : force_source_line = true;
2997 11753661 : }
2998 94621293 : else if (INSN_HAS_LOCATION (insn))
2999 : {
3000 85583277 : expanded_location xloc = insn_location (insn);
3001 85583277 : filename = xloc.file;
3002 85583277 : linenum = xloc.line;
3003 85583277 : columnnum = xloc.column;
3004 85583277 : discriminator = insn_discriminator (insn);
3005 : }
3006 : else
3007 : {
3008 : filename = NULL;
3009 : linenum = 0;
3010 : columnnum = 0;
3011 : discriminator = 0;
3012 : }
3013 :
3014 97336938 : if (filename == NULL)
3015 : return false;
3016 :
3017 97336938 : if (force_source_line
3018 84332164 : || filename != last_filename
3019 81234093 : || last_linenum != linenum
3020 68996375 : || (debug_column_info && last_columnnum != columnnum))
3021 : {
3022 32920366 : force_source_line = false;
3023 32920366 : last_filename = filename;
3024 32920366 : last_linenum = linenum;
3025 32920366 : last_columnnum = columnnum;
3026 32920366 : last_discriminator = discriminator;
3027 32920366 : if (is_stmt)
3028 12383016 : *is_stmt = true;
3029 32920366 : high_block_linenum = MAX (last_linenum, high_block_linenum);
3030 32920366 : high_function_linenum = MAX (last_linenum, high_function_linenum);
3031 32920366 : return true;
3032 : }
3033 :
3034 64416572 : if (SUPPORTS_DISCRIMINATOR && last_discriminator != discriminator)
3035 : {
3036 : /* If the discriminator changed, but the line number did not,
3037 : output the line table entry with is_stmt false so the
3038 : debugger does not treat this as a breakpoint location. */
3039 6747154 : last_discriminator = discriminator;
3040 6747154 : if (is_stmt)
3041 6316693 : *is_stmt = false;
3042 : return true;
3043 : }
3044 :
3045 : return false;
3046 : }
3047 :
3048 : /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3049 : directly to the desired hard register. */
3050 :
3051 : void
3052 103191986 : cleanup_subreg_operands (rtx_insn *insn)
3053 : {
3054 103191986 : int i;
3055 103191986 : bool changed = false;
3056 103191986 : extract_insn_cached (insn);
3057 422085928 : for (i = 0; i < recog_data.n_operands; i++)
3058 : {
3059 : /* The following test cannot use recog_data.operand when testing
3060 : for a SUBREG: the underlying object might have been changed
3061 : already if we are inside a match_operator expression that
3062 : matches the else clause. Instead we test the underlying
3063 : expression directly. */
3064 215701956 : if (GET_CODE (*recog_data.operand_loc[i]) == SUBREG)
3065 : {
3066 217 : recog_data.operand[i] = alter_subreg (recog_data.operand_loc[i], true);
3067 217 : changed = true;
3068 : }
3069 215701739 : else if (GET_CODE (recog_data.operand[i]) == PLUS
3070 : || GET_CODE (recog_data.operand[i]) == MULT
3071 : || MEM_P (recog_data.operand[i]))
3072 50514475 : recog_data.operand[i] = walk_alter_subreg (recog_data.operand_loc[i], &changed);
3073 : }
3074 :
3075 105297560 : for (i = 0; i < recog_data.n_dups; i++)
3076 : {
3077 2105574 : if (GET_CODE (*recog_data.dup_loc[i]) == SUBREG)
3078 : {
3079 0 : *recog_data.dup_loc[i] = alter_subreg (recog_data.dup_loc[i], true);
3080 0 : changed = true;
3081 : }
3082 : else if (GET_CODE (*recog_data.dup_loc[i]) == PLUS
3083 : || GET_CODE (*recog_data.dup_loc[i]) == MULT
3084 : || MEM_P (*recog_data.dup_loc[i]))
3085 576305 : *recog_data.dup_loc[i] = walk_alter_subreg (recog_data.dup_loc[i], &changed);
3086 : }
3087 103191986 : if (changed)
3088 217 : df_insn_rescan (insn);
3089 103191986 : }
3090 :
3091 : /* If X is a SUBREG, try to replace it with a REG or a MEM, based on
3092 : the thing it is a subreg of. Do it anyway if FINAL_P. */
3093 :
3094 : rtx
3095 3341341 : alter_subreg (rtx *xp, bool final_p)
3096 : {
3097 3341341 : rtx x = *xp;
3098 3341341 : rtx y = SUBREG_REG (x);
3099 :
3100 : /* simplify_subreg does not remove subreg from volatile references.
3101 : We are required to. */
3102 3341341 : if (MEM_P (y))
3103 : {
3104 238576 : poly_int64 offset = SUBREG_BYTE (x);
3105 :
3106 : /* For paradoxical subregs on big-endian machines, SUBREG_BYTE
3107 : contains 0 instead of the proper offset. See simplify_subreg. */
3108 238576 : if (paradoxical_subreg_p (x))
3109 37671 : offset = byte_lowpart_offset (GET_MODE (x), GET_MODE (y));
3110 :
3111 238576 : if (final_p)
3112 104 : *xp = adjust_address (y, GET_MODE (x), offset);
3113 : else
3114 238472 : *xp = adjust_address_nv (y, GET_MODE (x), offset);
3115 : }
3116 3102765 : else if (REG_P (y) && HARD_REGISTER_P (y))
3117 : {
3118 6205528 : rtx new_rtx = simplify_subreg (GET_MODE (x), y, GET_MODE (y),
3119 3102764 : SUBREG_BYTE (x));
3120 :
3121 3102764 : if (new_rtx != 0)
3122 3096789 : *xp = new_rtx;
3123 5975 : else if (final_p && REG_P (y))
3124 : {
3125 : /* Simplify_subreg can't handle some REG cases, but we have to. */
3126 2149 : unsigned int regno;
3127 2149 : poly_int64 offset;
3128 :
3129 2149 : regno = subreg_regno (x);
3130 2149 : if (subreg_lowpart_p (x))
3131 2149 : offset = byte_lowpart_offset (GET_MODE (x), GET_MODE (y));
3132 : else
3133 0 : offset = SUBREG_BYTE (x);
3134 2149 : *xp = gen_rtx_REG_offset (y, GET_MODE (x), regno, offset);
3135 : }
3136 : }
3137 :
3138 3341341 : return *xp;
3139 : }
3140 :
3141 : /* Do alter_subreg on all the SUBREGs contained in X. */
3142 :
3143 : static rtx
3144 171656214 : walk_alter_subreg (rtx *xp, bool *changed)
3145 : {
3146 171656214 : rtx x = *xp;
3147 171656214 : switch (GET_CODE (x))
3148 : {
3149 35826351 : case PLUS:
3150 35826351 : case MULT:
3151 35826351 : case AND:
3152 35826351 : case ASHIFT:
3153 35826351 : XEXP (x, 0) = walk_alter_subreg (&XEXP (x, 0), changed);
3154 35826351 : XEXP (x, 1) = walk_alter_subreg (&XEXP (x, 1), changed);
3155 35826351 : break;
3156 :
3157 44921352 : case MEM:
3158 44921352 : case ZERO_EXTEND:
3159 44921352 : XEXP (x, 0) = walk_alter_subreg (&XEXP (x, 0), changed);
3160 44921352 : break;
3161 :
3162 1 : case SUBREG:
3163 1 : *changed = true;
3164 1 : return alter_subreg (xp, true);
3165 :
3166 : default:
3167 : break;
3168 : }
3169 :
3170 171656213 : return *xp;
3171 : }
3172 :
3173 : /* Report inconsistency between the assembler template and the operands.
3174 : In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3175 :
3176 : void
3177 23 : output_operand_lossage (const char *cmsgid, ...)
3178 : {
3179 23 : char *fmt_string;
3180 23 : char *new_message;
3181 23 : const char *pfx_str;
3182 23 : va_list ap;
3183 :
3184 23 : va_start (ap, cmsgid);
3185 :
3186 23 : pfx_str = this_is_asm_operands ? _("invalid 'asm': ") : "output_operand: ";
3187 23 : fmt_string = xasprintf ("%s%s", pfx_str, _(cmsgid));
3188 23 : new_message = xvasprintf (fmt_string, ap);
3189 :
3190 23 : if (this_is_asm_operands)
3191 23 : error_for_asm (this_is_asm_operands, "%s", new_message);
3192 : else
3193 0 : internal_error ("%s", new_message);
3194 :
3195 23 : free (fmt_string);
3196 23 : free (new_message);
3197 23 : va_end (ap);
3198 23 : }
3199 :
3200 : /* Output of assembler code from a template, and its subroutines. */
3201 :
3202 : /* Annotate the assembly with a comment describing the pattern and
3203 : alternative used. */
3204 :
3205 : static void
3206 3556 : output_asm_name (void)
3207 : {
3208 3556 : if (debug_insn)
3209 : {
3210 3402 : fprintf (asm_out_file, "\t%s %d\t",
3211 3402 : ASM_COMMENT_START, INSN_UID (debug_insn));
3212 :
3213 3402 : fprintf (asm_out_file, "[c=%d",
3214 : insn_cost (debug_insn, optimize_insn_for_speed_p ()));
3215 3402 : if (HAVE_ATTR_length)
3216 3402 : fprintf (asm_out_file, " l=%d",
3217 : get_attr_length (debug_insn));
3218 3402 : fprintf (asm_out_file, "] ");
3219 :
3220 3402 : int num = INSN_CODE (debug_insn);
3221 3402 : fprintf (asm_out_file, "%s", insn_data[num].name);
3222 3402 : if (insn_data[num].n_alternatives > 1)
3223 1979 : fprintf (asm_out_file, "/%d", which_alternative);
3224 :
3225 : /* Clear this so only the first assembler insn
3226 : of any rtl insn will get the special comment for -dp. */
3227 3402 : debug_insn = 0;
3228 : }
3229 3556 : }
3230 :
3231 : /* If OP is a REG or MEM and we can find a MEM_EXPR corresponding to it
3232 : or its address, return that expr . Set *PADDRESSP to 1 if the expr
3233 : corresponds to the address of the object and 0 if to the object. */
3234 :
3235 : static tree
3236 391 : get_mem_expr_from_op (rtx op, int *paddressp)
3237 : {
3238 391 : tree expr;
3239 391 : int inner_addressp;
3240 :
3241 391 : *paddressp = 0;
3242 :
3243 391 : if (REG_P (op))
3244 254 : return REG_EXPR (op);
3245 137 : else if (!MEM_P (op))
3246 : return 0;
3247 :
3248 51 : if (MEM_EXPR (op) != 0)
3249 : return MEM_EXPR (op);
3250 :
3251 : /* Otherwise we have an address, so indicate it and look at the address. */
3252 0 : *paddressp = 1;
3253 0 : op = XEXP (op, 0);
3254 :
3255 : /* First check if we have a decl for the address, then look at the right side
3256 : if it is a PLUS. Otherwise, strip off arithmetic and keep looking.
3257 : But don't allow the address to itself be indirect. */
3258 0 : if ((expr = get_mem_expr_from_op (op, &inner_addressp)) && ! inner_addressp)
3259 : return expr;
3260 0 : else if (GET_CODE (op) == PLUS
3261 0 : && (expr = get_mem_expr_from_op (XEXP (op, 1), &inner_addressp)))
3262 : return expr;
3263 :
3264 0 : while (UNARY_P (op)
3265 0 : || GET_RTX_CLASS (GET_CODE (op)) == RTX_BIN_ARITH)
3266 0 : op = XEXP (op, 0);
3267 :
3268 0 : expr = get_mem_expr_from_op (op, &inner_addressp);
3269 0 : return inner_addressp ? 0 : expr;
3270 : }
3271 :
3272 : /* Output operand names for assembler instructions. OPERANDS is the
3273 : operand vector, OPORDER is the order to write the operands, and NOPS
3274 : is the number of operands to write. */
3275 :
3276 : static void
3277 243 : output_asm_operand_names (rtx *operands, int *oporder, int nops)
3278 : {
3279 243 : int wrote = 0;
3280 243 : int i;
3281 :
3282 634 : for (i = 0; i < nops; i++)
3283 : {
3284 391 : int addressp;
3285 391 : int opnum = oporder[i];
3286 : /* Skip invalid ops. */
3287 391 : if (opnum == MAX_RECOG_OPERANDS)
3288 0 : continue;
3289 391 : rtx op = operands[opnum];
3290 391 : tree expr = get_mem_expr_from_op (op, &addressp);
3291 :
3292 614 : fprintf (asm_out_file, "%c%s",
3293 : wrote ? ',' : '\t', wrote ? "" : ASM_COMMENT_START);
3294 391 : wrote = 1;
3295 391 : if (expr)
3296 : {
3297 226 : fprintf (asm_out_file, "%s",
3298 226 : addressp ? "*" : "");
3299 226 : print_mem_expr (asm_out_file, expr);
3300 226 : wrote = 1;
3301 : }
3302 79 : else if (REG_P (op) && ORIGINAL_REGNO (op)
3303 243 : && ORIGINAL_REGNO (op) != REGNO (op))
3304 41 : fprintf (asm_out_file, " tmp%i", ORIGINAL_REGNO (op));
3305 : }
3306 243 : }
3307 :
3308 : #ifdef ASSEMBLER_DIALECT
3309 : /* Helper function to parse assembler dialects in the asm string.
3310 : This is called from output_asm_insn and asm_fprintf. */
3311 : static const char *
3312 257864052 : do_assembler_dialects (const char *p, int *dialect)
3313 : {
3314 257864052 : char c = *(p - 1);
3315 :
3316 257864052 : switch (c)
3317 : {
3318 128932025 : case '{':
3319 128932025 : {
3320 128932025 : int i;
3321 :
3322 128932025 : if (*dialect)
3323 0 : output_operand_lossage ("nested assembly dialect alternatives");
3324 : else
3325 128932025 : *dialect = 1;
3326 :
3327 : /* If we want the first dialect, do nothing. Otherwise, skip
3328 : DIALECT_NUMBER of strings ending with '|'. */
3329 128933126 : for (i = 0; i < dialect_number; i++)
3330 : {
3331 9310 : while (*p && *p != '}')
3332 : {
3333 8732 : if (*p == '|')
3334 : {
3335 1102 : p++;
3336 1102 : break;
3337 : }
3338 :
3339 : /* Skip over any character after a percent sign. */
3340 7630 : if (*p == '%')
3341 2722 : p++;
3342 7630 : if (*p)
3343 7630 : p++;
3344 : }
3345 :
3346 1680 : if (*p == '}')
3347 : break;
3348 : }
3349 :
3350 128932025 : if (*p == '\0')
3351 0 : output_operand_lossage ("unterminated assembly dialect alternative");
3352 : }
3353 : break;
3354 :
3355 66194231 : case '|':
3356 66194231 : if (*dialect)
3357 : {
3358 : /* Skip to close brace. */
3359 351754862 : do
3360 : {
3361 351754862 : if (*p == '\0')
3362 : {
3363 0 : output_operand_lossage ("unterminated assembly dialect alternative");
3364 0 : break;
3365 : }
3366 :
3367 : /* Skip over any character after a percent sign. */
3368 351754862 : if (*p == '%' && p[1])
3369 : {
3370 129727314 : p += 2;
3371 129727314 : continue;
3372 : }
3373 :
3374 222027548 : if (*p++ == '}')
3375 : break;
3376 : }
3377 : while (1);
3378 :
3379 66194230 : *dialect = 0;
3380 : }
3381 : else
3382 1 : putc (c, asm_out_file);
3383 : break;
3384 :
3385 62737796 : case '}':
3386 62737796 : if (! *dialect)
3387 1 : putc (c, asm_out_file);
3388 62737796 : *dialect = 0;
3389 62737796 : break;
3390 0 : default:
3391 0 : gcc_unreachable ();
3392 : }
3393 :
3394 257864052 : return p;
3395 : }
3396 : #endif
3397 :
3398 : /* Output text from TEMPLATE to the assembler output file,
3399 : obeying %-directions to substitute operands taken from
3400 : the vector OPERANDS.
3401 :
3402 : %N (for N a digit) means print operand N in usual manner.
3403 : %lN means require operand N to be a CODE_LABEL or LABEL_REF
3404 : and print the label name with no punctuation.
3405 : %cN means require operand N to be a constant
3406 : and print the constant expression with no punctuation.
3407 : %aN means expect operand N to be a memory address
3408 : (not a memory reference!) and print a reference
3409 : to that address.
3410 : %nN means expect operand N to be a constant
3411 : and print a constant expression for minus the value
3412 : of the operand, with no other punctuation. */
3413 :
3414 : void
3415 106926240 : output_asm_insn (const char *templ, rtx *operands)
3416 : {
3417 106926240 : const char *p;
3418 106926240 : int c;
3419 : #ifdef ASSEMBLER_DIALECT
3420 106926240 : int dialect = 0;
3421 : #endif
3422 106926240 : int oporder[MAX_RECOG_OPERANDS+1];
3423 106926240 : char opoutput[MAX_RECOG_OPERANDS+1];
3424 106926240 : int ops = 0;
3425 :
3426 : /* An insn may return a null string template
3427 : in a case where no assembler code is needed. */
3428 106926240 : if (*templ == 0)
3429 13174281 : return;
3430 :
3431 93751959 : memset (opoutput, 0, sizeof opoutput);
3432 93751959 : p = templ;
3433 93751959 : putc ('\t', asm_out_file);
3434 :
3435 : #ifdef ASM_OUTPUT_OPCODE
3436 101477777 : ASM_OUTPUT_OPCODE (asm_out_file, p);
3437 : #endif
3438 :
3439 1150174330 : while ((c = *p++))
3440 1056422371 : switch (c)
3441 : {
3442 39471 : case '\n':
3443 39471 : if (flag_verbose_asm)
3444 0 : output_asm_operand_names (operands, oporder, ops);
3445 39471 : if (flag_print_asm_name)
3446 74 : output_asm_name ();
3447 :
3448 39471 : ops = 0;
3449 39471 : memset (opoutput, 0, sizeof opoutput);
3450 :
3451 39471 : putc (c, asm_out_file);
3452 : #ifdef ASM_OUTPUT_OPCODE
3453 114905 : while ((c = *p) == '\t')
3454 : {
3455 35963 : putc (c, asm_out_file);
3456 35963 : p++;
3457 : }
3458 39471 : ASM_OUTPUT_OPCODE (asm_out_file, p);
3459 : #endif
3460 : break;
3461 :
3462 : #ifdef ASSEMBLER_DIALECT
3463 257864052 : case '{':
3464 257864052 : case '}':
3465 257864052 : case '|':
3466 257864052 : p = do_assembler_dialects (p, &dialect);
3467 257864052 : break;
3468 : #endif
3469 :
3470 190108234 : case '%':
3471 : /* %% outputs a single %. %{, %} and %| print {, } and | respectively
3472 : if ASSEMBLER_DIALECT defined and these characters have a special
3473 : meaning as dialect delimiters.*/
3474 190108234 : if (*p == '%'
3475 : #ifdef ASSEMBLER_DIALECT
3476 190093169 : || *p == '{' || *p == '}' || *p == '|'
3477 : #endif
3478 : )
3479 : {
3480 134657 : putc (*p, asm_out_file);
3481 134657 : p++;
3482 : }
3483 : /* %= outputs a number which is unique to each insn in the entire
3484 : compilation. This is useful for making local labels that are
3485 : referred to more than once in a given insn. */
3486 189973577 : else if (*p == '=')
3487 : {
3488 19 : p++;
3489 19 : fprintf (asm_out_file, "%d", insn_counter);
3490 : }
3491 : /* % followed by a letter and some digits
3492 : outputs an operand in a special way depending on the letter.
3493 : Letters `acln' are implemented directly.
3494 : Other letters are passed to `output_operand' so that
3495 : the TARGET_PRINT_OPERAND hook can define them. */
3496 189973558 : else if (ISALPHA (*p))
3497 : {
3498 50146599 : int letter = *p++;
3499 50146599 : unsigned long opnum;
3500 50146599 : char *endptr;
3501 50146599 : int letter2 = 0;
3502 :
3503 50146599 : if (letter == 'c' && *p == 'c')
3504 98 : letter2 = *p++;
3505 50146599 : opnum = strtoul (p, &endptr, 10);
3506 :
3507 50146599 : if (endptr == p)
3508 0 : output_operand_lossage ("operand number missing "
3509 : "after %%-letter");
3510 50146599 : else if (this_is_asm_operands && opnum >= insn_noperands)
3511 : {
3512 : /* Force the opnum in bounds to a bogus location. */
3513 4 : opnum = MAX_RECOG_OPERANDS;
3514 4 : output_operand_lossage ("operand number out of range");
3515 : }
3516 50146595 : else if (letter == 'l')
3517 8910127 : output_asm_label (operands[opnum]);
3518 41236468 : else if (letter == 'a')
3519 2272 : output_address (VOIDmode, operands[opnum]);
3520 41234196 : else if (letter == 'c')
3521 : {
3522 227596 : if (letter2 == 'c' || CONSTANT_ADDRESS_P (operands[opnum]))
3523 1369 : output_addr_const (asm_out_file, operands[opnum]);
3524 : else
3525 226227 : output_operand (operands[opnum], 'c');
3526 : }
3527 41006600 : else if (letter == 'n')
3528 : {
3529 0 : if (CONST_INT_P (operands[opnum]))
3530 0 : fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3531 0 : - INTVAL (operands[opnum]));
3532 : else
3533 : {
3534 0 : putc ('-', asm_out_file);
3535 0 : output_addr_const (asm_out_file, operands[opnum]);
3536 : }
3537 : }
3538 : else
3539 41006600 : output_operand (operands[opnum], letter);
3540 :
3541 50146599 : if (!opoutput[opnum])
3542 47815127 : oporder[ops++] = opnum;
3543 50146599 : opoutput[opnum] = 1;
3544 :
3545 50146599 : p = endptr;
3546 50146599 : c = *p;
3547 : }
3548 : /* % followed by a digit outputs an operand the default way. */
3549 139826959 : else if (ISDIGIT (*p))
3550 : {
3551 117887616 : unsigned long opnum;
3552 117887616 : char *endptr;
3553 :
3554 117887616 : opnum = strtoul (p, &endptr, 10);
3555 117887616 : if (this_is_asm_operands && opnum >= insn_noperands)
3556 : {
3557 : /* Force the opnum in bounds to a bogus location. */
3558 3 : opnum = MAX_RECOG_OPERANDS;
3559 3 : output_operand_lossage ("operand number out of range");
3560 : }
3561 : else
3562 117887613 : output_operand (operands[opnum], 0);
3563 :
3564 117887616 : if (!opoutput[opnum])
3565 115533875 : oporder[ops++] = opnum;
3566 117887616 : opoutput[opnum] = 1;
3567 :
3568 117887616 : p = endptr;
3569 117887616 : c = *p;
3570 : }
3571 : /* % followed by punctuation: output something for that
3572 : punctuation character alone, with no operand. The
3573 : TARGET_PRINT_OPERAND hook decides what is actually done. */
3574 21939343 : else if (targetm.asm_out.print_operand_punct_valid_p ((unsigned char) *p))
3575 21939343 : output_operand (NULL_RTX, *p++);
3576 : else
3577 0 : output_operand_lossage ("invalid %%-code");
3578 : break;
3579 :
3580 608410614 : default:
3581 608410614 : putc (c, asm_out_file);
3582 : }
3583 :
3584 : /* Try to keep the asm a bit more readable. */
3585 93751959 : if ((flag_verbose_asm || flag_print_asm_name) && strlen (templ) < 9)
3586 415 : putc ('\t', asm_out_file);
3587 :
3588 : /* Write out the variable names for operands, if we know them. */
3589 93751959 : if (flag_verbose_asm)
3590 243 : output_asm_operand_names (operands, oporder, ops);
3591 93751959 : if (flag_print_asm_name)
3592 3482 : output_asm_name ();
3593 :
3594 93751959 : putc ('\n', asm_out_file);
3595 : }
3596 :
3597 : /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3598 :
3599 : void
3600 8915837 : output_asm_label (rtx x)
3601 : {
3602 8915837 : char buf[256];
3603 :
3604 8915837 : if (GET_CODE (x) == LABEL_REF)
3605 5869 : x = label_ref_label (x);
3606 8915837 : if (LABEL_P (x)
3607 104 : || (NOTE_P (x)
3608 104 : && NOTE_KIND (x) == NOTE_INSN_DELETED_LABEL))
3609 8915837 : ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3610 : else
3611 0 : output_operand_lossage ("'%%l' operand isn't a label");
3612 :
3613 8915837 : assemble_name (asm_out_file, buf);
3614 8915837 : }
3615 :
3616 : /* Marks SYMBOL_REFs in x as referenced through use of assemble_external. */
3617 :
3618 : void
3619 159120440 : mark_symbol_refs_as_used (rtx x)
3620 : {
3621 159120440 : subrtx_iterator::array_type array;
3622 434551291 : FOR_EACH_SUBRTX (iter, array, x, ALL)
3623 : {
3624 275430851 : const_rtx x = *iter;
3625 275430851 : if (GET_CODE (x) == SYMBOL_REF)
3626 16222136 : if (tree t = SYMBOL_REF_DECL (x))
3627 15030275 : assemble_external (t);
3628 : }
3629 159120440 : }
3630 :
3631 : /* Print operand X using machine-dependent assembler syntax.
3632 : CODE is a non-digit that preceded the operand-number in the % spec,
3633 : such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3634 : between the % and the digits.
3635 : When CODE is a non-letter, X is 0.
3636 :
3637 : The meanings of the letters are machine-dependent and controlled
3638 : by TARGET_PRINT_OPERAND. */
3639 :
3640 : void
3641 181059783 : output_operand (rtx x, int code ATTRIBUTE_UNUSED)
3642 : {
3643 181059783 : if (x && GET_CODE (x) == SUBREG)
3644 0 : x = alter_subreg (&x, true);
3645 :
3646 : /* X must not be a pseudo reg. */
3647 181059783 : if (!targetm.no_register_allocation)
3648 181059783 : gcc_assert (!x || !REG_P (x) || REGNO (x) < FIRST_PSEUDO_REGISTER);
3649 :
3650 181059783 : targetm.asm_out.print_operand (asm_out_file, x, code);
3651 :
3652 181059783 : if (x == NULL_RTX)
3653 : return;
3654 :
3655 159120440 : mark_symbol_refs_as_used (x);
3656 : }
3657 :
3658 : /* Print a memory reference operand for address X using
3659 : machine-dependent assembler syntax. */
3660 :
3661 : void
3662 3991380 : output_address (machine_mode mode, rtx x)
3663 : {
3664 3991380 : bool changed = false;
3665 3991380 : walk_alter_subreg (&x, &changed);
3666 3991380 : targetm.asm_out.print_operand_address (asm_out_file, mode, x);
3667 3991380 : }
3668 :
3669 : /* Print an integer constant expression in assembler syntax.
3670 : Addition and subtraction are the only arithmetic
3671 : that may appear in these expressions. */
3672 :
3673 : void
3674 170084495 : output_addr_const (FILE *file, rtx x)
3675 : {
3676 180709397 : char buf[256];
3677 :
3678 180709397 : restart:
3679 180709397 : switch (GET_CODE (x))
3680 : {
3681 665 : case PC:
3682 665 : putc ('.', file);
3683 665 : break;
3684 :
3685 131005881 : case SYMBOL_REF:
3686 131005881 : if (SYMBOL_REF_DECL (x))
3687 20899628 : assemble_external (SYMBOL_REF_DECL (x));
3688 : #ifdef ASM_OUTPUT_SYMBOL_REF
3689 131005881 : ASM_OUTPUT_SYMBOL_REF (file, x);
3690 : #else
3691 : assemble_name (file, XSTR (x, 0));
3692 : #endif
3693 : break;
3694 :
3695 14984 : case LABEL_REF:
3696 14984 : x = label_ref_label (x);
3697 : /* Fall through. */
3698 14984 : case CODE_LABEL:
3699 14984 : ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3700 : #ifdef ASM_OUTPUT_LABEL_REF
3701 : ASM_OUTPUT_LABEL_REF (file, buf);
3702 : #else
3703 14984 : assemble_name (file, buf);
3704 : #endif
3705 14984 : break;
3706 :
3707 39048084 : case CONST_INT:
3708 39048084 : fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3709 39048084 : break;
3710 :
3711 2694123 : case CONST:
3712 : /* This used to output parentheses around the expression,
3713 : but that does not work on the 386 (either ATT or BSD assembler). */
3714 2694123 : output_addr_const (file, XEXP (x, 0));
3715 2694123 : break;
3716 :
3717 2 : case CONST_WIDE_INT:
3718 : /* We do not know the mode here so we have to use a round about
3719 : way to build a wide-int to get it printed properly. */
3720 2 : {
3721 2 : wide_int w = wide_int::from_array (&CONST_WIDE_INT_ELT (x, 0),
3722 2 : CONST_WIDE_INT_NUNITS (x),
3723 2 : CONST_WIDE_INT_NUNITS (x)
3724 2 : * HOST_BITS_PER_WIDE_INT,
3725 2 : false);
3726 2 : print_decs (w, file);
3727 2 : }
3728 2 : break;
3729 :
3730 0 : case CONST_DOUBLE:
3731 0 : if (CONST_DOUBLE_AS_INT_P (x))
3732 : {
3733 : /* We can use %d if the number is one word and positive. */
3734 0 : if (CONST_DOUBLE_HIGH (x))
3735 0 : fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3736 : (unsigned HOST_WIDE_INT) CONST_DOUBLE_HIGH (x),
3737 0 : (unsigned HOST_WIDE_INT) CONST_DOUBLE_LOW (x));
3738 0 : else if (CONST_DOUBLE_LOW (x) < 0)
3739 0 : fprintf (file, HOST_WIDE_INT_PRINT_HEX,
3740 : (unsigned HOST_WIDE_INT) CONST_DOUBLE_LOW (x));
3741 : else
3742 0 : fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3743 : }
3744 : else
3745 : /* We can't handle floating point constants;
3746 : PRINT_OPERAND must handle them. */
3747 0 : output_operand_lossage ("floating constant misused");
3748 : break;
3749 :
3750 0 : case CONST_FIXED:
3751 0 : fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_FIXED_VALUE_LOW (x));
3752 0 : break;
3753 :
3754 2714095 : case PLUS:
3755 : /* Some assemblers need integer constants to appear last (eg masm). */
3756 2714095 : if (CONST_INT_P (XEXP (x, 0)))
3757 : {
3758 0 : output_addr_const (file, XEXP (x, 1));
3759 0 : if (INTVAL (XEXP (x, 0)) >= 0)
3760 0 : fprintf (file, "+");
3761 0 : output_addr_const (file, XEXP (x, 0));
3762 : }
3763 : else
3764 : {
3765 2714095 : output_addr_const (file, XEXP (x, 0));
3766 2714095 : if (!CONST_INT_P (XEXP (x, 1))
3767 2714095 : || INTVAL (XEXP (x, 1)) >= 0)
3768 2687864 : fprintf (file, "+");
3769 2714095 : output_addr_const (file, XEXP (x, 1));
3770 : }
3771 : break;
3772 :
3773 5216748 : case MINUS:
3774 : /* Avoid outputting things like x-x or x+5-x,
3775 : since some assemblers can't handle that. */
3776 5216748 : x = simplify_subtraction (x);
3777 5216748 : if (GET_CODE (x) != MINUS)
3778 0 : goto restart;
3779 :
3780 5216748 : output_addr_const (file, XEXP (x, 0));
3781 5216748 : fprintf (file, "-");
3782 5216748 : if ((CONST_INT_P (XEXP (x, 1)) && INTVAL (XEXP (x, 1)) >= 0)
3783 5216748 : || GET_CODE (XEXP (x, 1)) == PC
3784 5216083 : || GET_CODE (XEXP (x, 1)) == SYMBOL_REF)
3785 : output_addr_const (file, XEXP (x, 1));
3786 : else
3787 : {
3788 64 : fputs (targetm.asm_out.open_paren, file);
3789 64 : output_addr_const (file, XEXP (x, 1));
3790 64 : fputs (targetm.asm_out.close_paren, file);
3791 : }
3792 : break;
3793 :
3794 0 : case ZERO_EXTEND:
3795 0 : case SIGN_EXTEND:
3796 0 : case SUBREG:
3797 0 : case TRUNCATE:
3798 0 : output_addr_const (file, XEXP (x, 0));
3799 0 : break;
3800 :
3801 14815 : default:
3802 14815 : if (targetm.asm_out.output_addr_const_extra (file, x))
3803 : break;
3804 :
3805 0 : output_operand_lossage ("invalid expression as operand");
3806 : }
3807 170084495 : }
3808 :
3809 : /* Output a quoted string. */
3810 :
3811 : void
3812 1620139 : output_quoted_string (FILE *asm_file, const char *string)
3813 : {
3814 : #ifdef OUTPUT_QUOTED_STRING
3815 : OUTPUT_QUOTED_STRING (asm_file, string);
3816 : #else
3817 1620139 : char c;
3818 :
3819 1620139 : putc ('\"', asm_file);
3820 96694810 : while ((c = *string++) != 0)
3821 : {
3822 93454532 : if (ISPRINT (c))
3823 : {
3824 93454520 : if (c == '\"' || c == '\\')
3825 15 : putc ('\\', asm_file);
3826 93454520 : putc (c, asm_file);
3827 : }
3828 : else
3829 12 : fprintf (asm_file, "\\%03o", (unsigned char) c);
3830 : }
3831 1620139 : putc ('\"', asm_file);
3832 : #endif
3833 1620139 : }
3834 :
3835 : /* Write a HOST_WIDE_INT number in hex form 0x1234, fast. */
3836 :
3837 : void
3838 532818785 : fprint_whex (FILE *f, unsigned HOST_WIDE_INT value)
3839 : {
3840 532818785 : char buf[2 + CHAR_BIT * sizeof (value) / 4];
3841 532818785 : if (value == 0)
3842 50578098 : putc ('0', f);
3843 : else
3844 : {
3845 : char *p = buf + sizeof (buf);
3846 1006669693 : do
3847 1006669693 : *--p = "0123456789abcdef"[value % 16];
3848 1006669693 : while ((value /= 16) != 0);
3849 482240687 : *--p = 'x';
3850 482240687 : *--p = '0';
3851 482240687 : fwrite (p, 1, buf + sizeof (buf) - p, f);
3852 : }
3853 532818785 : }
3854 :
3855 : /* Internal function that prints an unsigned long in decimal in reverse.
3856 : The output string IS NOT null-terminated. */
3857 :
3858 : static int
3859 453590619 : sprint_ul_rev (char *s, unsigned long value)
3860 : {
3861 0 : int i = 0;
3862 1406522045 : do
3863 : {
3864 1406522045 : s[i] = "0123456789"[value % 10];
3865 1406522045 : value /= 10;
3866 1406522045 : i++;
3867 : /* alternate version, without modulo */
3868 : /* oldval = value; */
3869 : /* value /= 10; */
3870 : /* s[i] = "0123456789" [oldval - 10*value]; */
3871 : /* i++ */
3872 : }
3873 1406522045 : while (value != 0);
3874 333182484 : return i;
3875 : }
3876 :
3877 : /* Write an unsigned long as decimal to a file, fast. */
3878 :
3879 : void
3880 120408135 : fprint_ul (FILE *f, unsigned long value)
3881 : {
3882 : /* python says: len(str(2**64)) == 20 */
3883 120408135 : char s[20];
3884 120408135 : int i;
3885 :
3886 120408135 : i = sprint_ul_rev (s, value);
3887 :
3888 : /* It's probably too small to bother with string reversal and fputs. */
3889 225180301 : do
3890 : {
3891 225180301 : i--;
3892 225180301 : putc (s[i], f);
3893 : }
3894 225180301 : while (i != 0);
3895 120408135 : }
3896 :
3897 : /* Write an unsigned long as decimal to a string, fast.
3898 : s must be wide enough to not overflow, at least 21 chars.
3899 : Returns the length of the string (without terminating '\0'). */
3900 :
3901 : int
3902 333182484 : sprint_ul (char *s, unsigned long value)
3903 : {
3904 333182484 : int len = sprint_ul_rev (s, value);
3905 333182484 : s[len] = '\0';
3906 :
3907 333182484 : std::reverse (s, s + len);
3908 333182484 : return len;
3909 : }
3910 :
3911 : /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3912 : %R prints the value of REGISTER_PREFIX.
3913 : %L prints the value of LOCAL_LABEL_PREFIX.
3914 : %U prints the value of USER_LABEL_PREFIX.
3915 : %I prints the value of IMMEDIATE_PREFIX.
3916 : %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3917 : Also supported are %d, %i, %u, %x, %X, %o, %c, %s and %%.
3918 :
3919 : We handle alternate assembler dialects here, just like output_asm_insn. */
3920 :
3921 : void
3922 2 : asm_fprintf (FILE *file, const char *p, ...)
3923 : {
3924 2 : char buf[10];
3925 2 : char *q, c;
3926 : #ifdef ASSEMBLER_DIALECT
3927 2 : int dialect = 0;
3928 : #endif
3929 2 : va_list argptr;
3930 :
3931 2 : va_start (argptr, p);
3932 :
3933 2 : buf[0] = '%';
3934 :
3935 21 : while ((c = *p++))
3936 19 : switch (c)
3937 : {
3938 : #ifdef ASSEMBLER_DIALECT
3939 0 : case '{':
3940 0 : case '}':
3941 0 : case '|':
3942 0 : p = do_assembler_dialects (p, &dialect);
3943 0 : break;
3944 : #endif
3945 :
3946 6 : case '%':
3947 6 : c = *p++;
3948 6 : q = &buf[1];
3949 6 : while (strchr ("-+ #0", c))
3950 : {
3951 0 : *q++ = c;
3952 0 : c = *p++;
3953 : }
3954 6 : while (ISDIGIT (c) || c == '.')
3955 : {
3956 0 : *q++ = c;
3957 0 : c = *p++;
3958 : }
3959 6 : switch (c)
3960 : {
3961 2 : case '%':
3962 2 : putc ('%', file);
3963 2 : break;
3964 :
3965 0 : case 'd': case 'i': case 'u':
3966 0 : case 'x': case 'X': case 'o':
3967 0 : case 'c':
3968 0 : *q++ = c;
3969 0 : *q = 0;
3970 0 : fprintf (file, buf, va_arg (argptr, int));
3971 0 : break;
3972 :
3973 0 : case 'w':
3974 : /* This is a prefix to the 'd', 'i', 'u', 'x', 'X', and
3975 : 'o' cases, but we do not check for those cases. It
3976 : means that the value is a HOST_WIDE_INT, which may be
3977 : either `long' or `long long'. */
3978 0 : memcpy (q, HOST_WIDE_INT_PRINT, strlen (HOST_WIDE_INT_PRINT));
3979 0 : q += strlen (HOST_WIDE_INT_PRINT);
3980 0 : *q++ = *p++;
3981 0 : *q = 0;
3982 0 : fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3983 0 : break;
3984 :
3985 0 : case 'l':
3986 0 : *q++ = c;
3987 : #ifdef HAVE_LONG_LONG
3988 0 : if (*p == 'l')
3989 : {
3990 0 : *q++ = *p++;
3991 0 : *q++ = *p++;
3992 0 : *q = 0;
3993 0 : fprintf (file, buf, va_arg (argptr, long long));
3994 : }
3995 : else
3996 : #endif
3997 : {
3998 0 : *q++ = *p++;
3999 0 : *q = 0;
4000 0 : fprintf (file, buf, va_arg (argptr, long));
4001 : }
4002 :
4003 : break;
4004 :
4005 0 : case 's':
4006 0 : *q++ = c;
4007 0 : *q = 0;
4008 0 : fprintf (file, buf, va_arg (argptr, char *));
4009 0 : break;
4010 :
4011 0 : case 'O':
4012 : #ifdef ASM_OUTPUT_OPCODE
4013 0 : ASM_OUTPUT_OPCODE (asm_out_file, p);
4014 : #endif
4015 : break;
4016 :
4017 : case 'R':
4018 : #ifdef REGISTER_PREFIX
4019 : fprintf (file, "%s", REGISTER_PREFIX);
4020 : #endif
4021 : break;
4022 :
4023 : case 'I':
4024 : #ifdef IMMEDIATE_PREFIX
4025 : fprintf (file, "%s", IMMEDIATE_PREFIX);
4026 : #endif
4027 : break;
4028 :
4029 0 : case 'L':
4030 : #ifdef LOCAL_LABEL_PREFIX
4031 0 : fprintf (file, "%s", LOCAL_LABEL_PREFIX);
4032 : #endif
4033 0 : break;
4034 :
4035 0 : case 'U':
4036 0 : fputs (user_label_prefix, file);
4037 0 : break;
4038 :
4039 : #ifdef ASM_FPRINTF_EXTENSIONS
4040 : /* Uppercase letters are reserved for general use by asm_fprintf
4041 : and so are not available to target specific code. In order to
4042 : prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
4043 : they are defined here. As they get turned into real extensions
4044 : to asm_fprintf they should be removed from this list. */
4045 : case 'A': case 'B': case 'C': case 'D': case 'E':
4046 : case 'F': case 'G': case 'H': case 'J': case 'K':
4047 : case 'M': case 'N': case 'P': case 'Q': case 'S':
4048 : case 'T': case 'V': case 'W': case 'Y': case 'Z':
4049 : break;
4050 :
4051 4 : ASM_FPRINTF_EXTENSIONS (file, argptr, p)
4052 : #endif
4053 0 : default:
4054 0 : gcc_unreachable ();
4055 : }
4056 : break;
4057 :
4058 13 : default:
4059 13 : putc (c, file);
4060 : }
4061 2 : va_end (argptr);
4062 2 : }
4063 :
4064 : /* Return true if this function has no function calls. */
4065 :
4066 : bool
4067 3060220 : leaf_function_p (void)
4068 : {
4069 3060220 : rtx_insn *insn;
4070 :
4071 : /* Ensure we walk the entire function body. */
4072 3060220 : gcc_assert (!in_sequence_p ());
4073 :
4074 : /* Some back-ends (e.g. s390) want leaf functions to stay leaf
4075 : functions even if they call mcount. */
4076 3060220 : if (crtl->profile && !targetm.keep_leaf_when_profiled ())
4077 : return false;
4078 :
4079 81277862 : for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4080 : {
4081 80162160 : if (CALL_P (insn)
4082 2088699 : && ! SIBLING_CALL_P (insn)
4083 82106162 : && ! FAKE_CALL_P (insn))
4084 : return false;
4085 78218258 : if (NONJUMP_INSN_P (insn)
4086 37762771 : && GET_CODE (PATTERN (insn)) == SEQUENCE
4087 0 : && CALL_P (XVECEXP (PATTERN (insn), 0, 0))
4088 78218258 : && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0)))
4089 : return false;
4090 : }
4091 :
4092 : return true;
4093 : }
4094 :
4095 : /* Return true if branch is a forward branch.
4096 : Uses insn_shuid array, so it works only in the final pass. May be used by
4097 : output templates to customary add branch prediction hints.
4098 : */
4099 : bool
4100 0 : final_forward_branch_p (rtx_insn *insn)
4101 : {
4102 0 : int insn_id, label_id;
4103 :
4104 0 : gcc_assert (uid_shuid);
4105 0 : insn_id = INSN_SHUID (insn);
4106 0 : label_id = INSN_SHUID (JUMP_LABEL (insn));
4107 : /* We've hit some insns that does not have id information available. */
4108 0 : gcc_assert (insn_id && label_id);
4109 0 : return insn_id < label_id;
4110 : }
4111 :
4112 : /* On some machines, a function with no call insns
4113 : can run faster if it doesn't create its own register window.
4114 : When output, the leaf function should use only the "output"
4115 : registers. Ordinarily, the function would be compiled to use
4116 : the "input" registers to find its arguments; it is a candidate
4117 : for leaf treatment if it uses only the "input" registers.
4118 : Leaf function treatment means renumbering so the function
4119 : uses the "output" registers instead. */
4120 :
4121 : #ifdef LEAF_REGISTERS
4122 :
4123 : /* Return bool if this function uses only the registers that can be
4124 : safely renumbered. */
4125 :
4126 : bool
4127 : only_leaf_regs_used (void)
4128 : {
4129 : int i;
4130 : const char *const permitted_reg_in_leaf_functions = LEAF_REGISTERS;
4131 :
4132 : for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4133 : if ((df_regs_ever_live_p (i) || global_regs[i])
4134 : && ! permitted_reg_in_leaf_functions[i])
4135 : return false;
4136 :
4137 : if (crtl->uses_pic_offset_table
4138 : && pic_offset_table_rtx != 0
4139 : && REG_P (pic_offset_table_rtx)
4140 : && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4141 : return false;
4142 :
4143 : return true;
4144 : }
4145 :
4146 : /* Scan all instructions and renumber all registers into those
4147 : available in leaf functions. */
4148 :
4149 : static void
4150 : leaf_renumber_regs (rtx_insn *first)
4151 : {
4152 : rtx_insn *insn;
4153 :
4154 : /* Renumber only the actual patterns.
4155 : The reg-notes can contain frame pointer refs,
4156 : and renumbering them could crash, and should not be needed. */
4157 : for (insn = first; insn; insn = NEXT_INSN (insn))
4158 : if (INSN_P (insn))
4159 : leaf_renumber_regs_insn (PATTERN (insn));
4160 : }
4161 :
4162 : /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4163 : available in leaf functions. */
4164 :
4165 : void
4166 : leaf_renumber_regs_insn (rtx in_rtx)
4167 : {
4168 : int i, j;
4169 : const char *format_ptr;
4170 :
4171 : if (in_rtx == 0)
4172 : return;
4173 :
4174 : /* Renumber all input-registers into output-registers.
4175 : renumbered_regs would be 1 for an output-register;
4176 : they */
4177 :
4178 : if (REG_P (in_rtx))
4179 : {
4180 : int newreg;
4181 :
4182 : /* Don't renumber the same reg twice. */
4183 : if (in_rtx->used)
4184 : return;
4185 :
4186 : newreg = REGNO (in_rtx);
4187 : /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4188 : to reach here as part of a REG_NOTE. */
4189 : if (newreg >= FIRST_PSEUDO_REGISTER)
4190 : {
4191 : in_rtx->used = 1;
4192 : return;
4193 : }
4194 : newreg = LEAF_REG_REMAP (newreg);
4195 : gcc_assert (newreg >= 0);
4196 : df_set_regs_ever_live (REGNO (in_rtx), false);
4197 : df_set_regs_ever_live (newreg, true);
4198 : SET_REGNO (in_rtx, newreg);
4199 : in_rtx->used = 1;
4200 : return;
4201 : }
4202 :
4203 : if (INSN_P (in_rtx))
4204 : {
4205 : /* Inside a SEQUENCE, we find insns.
4206 : Renumber just the patterns of these insns,
4207 : just as we do for the top-level insns. */
4208 : leaf_renumber_regs_insn (PATTERN (in_rtx));
4209 : return;
4210 : }
4211 :
4212 : format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4213 :
4214 : for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4215 : switch (*format_ptr++)
4216 : {
4217 : case 'e':
4218 : leaf_renumber_regs_insn (XEXP (in_rtx, i));
4219 : break;
4220 :
4221 : case 'E':
4222 : if (XVEC (in_rtx, i) != NULL)
4223 : for (j = 0; j < XVECLEN (in_rtx, i); j++)
4224 : leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));
4225 : break;
4226 :
4227 : case 'S':
4228 : case 's':
4229 : case '0':
4230 : case 'i':
4231 : case 'L':
4232 : case 'w':
4233 : case 'p':
4234 : case 'n':
4235 : case 'u':
4236 : break;
4237 :
4238 : default:
4239 : gcc_unreachable ();
4240 : }
4241 : }
4242 : #endif
4243 :
4244 : /* Turn the RTL into assembly. */
4245 : static unsigned int
4246 1515123 : rest_of_handle_final (void)
4247 : {
4248 1515123 : const char *fnname = get_fnname_from_decl (current_function_decl);
4249 :
4250 : /* Turn debug markers into notes if the var-tracking pass has not
4251 : been invoked. */
4252 1515123 : if (!flag_var_tracking && MAY_HAVE_DEBUG_MARKER_INSNS)
4253 1 : delete_vta_debug_insns (false);
4254 :
4255 1515123 : assemble_start_function (current_function_decl, fnname);
4256 1515123 : rtx_insn *first = get_insns ();
4257 1515123 : int seen = 0;
4258 1515123 : final_start_function_1 (&first, asm_out_file, &seen, optimize);
4259 1515123 : final_1 (first, asm_out_file, seen, optimize);
4260 1515123 : if (flag_ipa_ra
4261 976595 : && !lookup_attribute ("noipa", DECL_ATTRIBUTES (current_function_decl))
4262 : /* Functions with naked attributes are supported only with basic asm
4263 : statements in the body, thus for supported use cases the information
4264 : on clobbered registers is not available. */
4265 2472568 : && !lookup_attribute ("naked", DECL_ATTRIBUTES (current_function_decl)))
4266 957445 : collect_fn_hard_reg_usage ();
4267 1515123 : final_end_function ();
4268 :
4269 : /* The IA-64 ".handlerdata" directive must be issued before the ".endp"
4270 : directive that closes the procedure descriptor. Similarly, for x64 SEH.
4271 : Otherwise it's not strictly necessary, but it doesn't hurt either. */
4272 2964452 : output_function_exception_table (crtl->has_bb_partition ? 1 : 0);
4273 :
4274 1515123 : assemble_end_function (current_function_decl, fnname);
4275 :
4276 : /* Free up reg info memory. */
4277 1515123 : free_reg_info ();
4278 :
4279 1515123 : if (! quiet_flag)
4280 0 : fflush (asm_out_file);
4281 :
4282 : /* Note that for those inline functions where we don't initially
4283 : know for certain that we will be generating an out-of-line copy,
4284 : the first invocation of this routine (rest_of_compilation) will
4285 : skip over this code by doing a `goto exit_rest_of_compilation;'.
4286 : Later on, wrapup_global_declarations will (indirectly) call
4287 : rest_of_compilation again for those inline functions that need
4288 : to have out-of-line copies generated. During that call, we
4289 : *will* be routed past here. */
4290 :
4291 1515123 : timevar_push (TV_SYMOUT);
4292 1515123 : if (!DECL_IGNORED_P (current_function_decl))
4293 1508442 : debug_hooks->function_decl (current_function_decl);
4294 1515123 : timevar_pop (TV_SYMOUT);
4295 :
4296 : /* Release the blocks that are linked to DECL_INITIAL() to free the memory. */
4297 1515123 : DECL_INITIAL (current_function_decl) = error_mark_node;
4298 :
4299 1515123 : if (DECL_STATIC_CONSTRUCTOR (current_function_decl)
4300 1515123 : && targetm.have_ctors_dtors)
4301 24100 : targetm.asm_out.constructor (XEXP (DECL_RTL (current_function_decl), 0),
4302 : decl_init_priority_lookup
4303 24100 : (current_function_decl));
4304 1515123 : if (DECL_STATIC_DESTRUCTOR (current_function_decl)
4305 1515123 : && targetm.have_ctors_dtors)
4306 1646 : targetm.asm_out.destructor (XEXP (DECL_RTL (current_function_decl), 0),
4307 : decl_fini_priority_lookup
4308 1646 : (current_function_decl));
4309 1515123 : return 0;
4310 : }
4311 :
4312 : namespace {
4313 :
4314 : const pass_data pass_data_final =
4315 : {
4316 : RTL_PASS, /* type */
4317 : "final", /* name */
4318 : OPTGROUP_NONE, /* optinfo_flags */
4319 : TV_FINAL, /* tv_id */
4320 : 0, /* properties_required */
4321 : 0, /* properties_provided */
4322 : 0, /* properties_destroyed */
4323 : 0, /* todo_flags_start */
4324 : 0, /* todo_flags_finish */
4325 : };
4326 :
4327 : class pass_final : public rtl_opt_pass
4328 : {
4329 : public:
4330 294196 : pass_final (gcc::context *ctxt)
4331 588392 : : rtl_opt_pass (pass_data_final, ctxt)
4332 : {}
4333 :
4334 : /* opt_pass methods: */
4335 1515123 : unsigned int execute (function *) final override
4336 : {
4337 1515123 : return rest_of_handle_final ();
4338 : }
4339 :
4340 : }; // class pass_final
4341 :
4342 : } // anon namespace
4343 :
4344 : rtl_opt_pass *
4345 294196 : make_pass_final (gcc::context *ctxt)
4346 : {
4347 294196 : return new pass_final (ctxt);
4348 : }
4349 :
4350 :
4351 : static unsigned int
4352 1515122 : rest_of_handle_shorten_branches (void)
4353 : {
4354 : /* Shorten branches. */
4355 0 : shorten_branches (get_insns ());
4356 1515122 : return 0;
4357 : }
4358 :
4359 : namespace {
4360 :
4361 : const pass_data pass_data_shorten_branches =
4362 : {
4363 : RTL_PASS, /* type */
4364 : "shorten", /* name */
4365 : OPTGROUP_NONE, /* optinfo_flags */
4366 : TV_SHORTEN_BRANCH, /* tv_id */
4367 : 0, /* properties_required */
4368 : 0, /* properties_provided */
4369 : 0, /* properties_destroyed */
4370 : 0, /* todo_flags_start */
4371 : 0, /* todo_flags_finish */
4372 : };
4373 :
4374 : class pass_shorten_branches : public rtl_opt_pass
4375 : {
4376 : public:
4377 294196 : pass_shorten_branches (gcc::context *ctxt)
4378 588392 : : rtl_opt_pass (pass_data_shorten_branches, ctxt)
4379 : {}
4380 :
4381 : /* opt_pass methods: */
4382 1515122 : unsigned int execute (function *) final override
4383 : {
4384 1515122 : return rest_of_handle_shorten_branches ();
4385 : }
4386 :
4387 : }; // class pass_shorten_branches
4388 :
4389 : } // anon namespace
4390 :
4391 : rtl_opt_pass *
4392 294196 : make_pass_shorten_branches (gcc::context *ctxt)
4393 : {
4394 294196 : return new pass_shorten_branches (ctxt);
4395 : }
4396 :
4397 :
4398 : static unsigned int
4399 1515935 : rest_of_clean_state (void)
4400 : {
4401 1515935 : rtx_insn *insn, *next;
4402 1515935 : FILE *final_output = NULL;
4403 1515935 : int save_unnumbered = flag_dump_unnumbered;
4404 1515935 : int save_noaddr = flag_dump_noaddr;
4405 :
4406 1515935 : if (flag_dump_final_insns)
4407 : {
4408 3994 : final_output = fopen (flag_dump_final_insns, "a");
4409 3994 : if (!final_output)
4410 : {
4411 0 : error ("could not open final insn dump file %qs: %m",
4412 : flag_dump_final_insns);
4413 0 : flag_dump_final_insns = NULL;
4414 : }
4415 : else
4416 : {
4417 3994 : flag_dump_noaddr = flag_dump_unnumbered = 1;
4418 3994 : if (flag_compare_debug_opt || flag_compare_debug)
4419 3922 : dump_flags |= TDF_NOUID | TDF_COMPARE_DEBUG;
4420 3994 : dump_function_header (final_output, current_function_decl,
4421 : dump_flags);
4422 3994 : final_insns_dump_p = true;
4423 :
4424 150919 : for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4425 146925 : if (LABEL_P (insn))
4426 5031 : INSN_UID (insn) = CODE_LABEL_NUMBER (insn);
4427 : else
4428 : {
4429 141894 : if (NOTE_P (insn))
4430 67402 : set_block_for_insn (insn, NULL);
4431 141894 : INSN_UID (insn) = 0;
4432 : }
4433 : }
4434 : }
4435 :
4436 : /* It is very important to decompose the RTL instruction chain here:
4437 : debug information keeps pointing into CODE_LABEL insns inside the function
4438 : body. If these remain pointing to the other insns, we end up preserving
4439 : whole RTL chain and attached detailed debug info in memory. */
4440 267470615 : for (insn = get_insns (); insn; insn = next)
4441 : {
4442 265954680 : next = NEXT_INSN (insn);
4443 265954680 : SET_NEXT_INSN (insn) = NULL;
4444 265954680 : SET_PREV_INSN (insn) = NULL;
4445 :
4446 265954680 : rtx_insn *call_insn = insn;
4447 265954680 : if (NONJUMP_INSN_P (call_insn)
4448 265954680 : && GET_CODE (PATTERN (call_insn)) == SEQUENCE)
4449 : {
4450 0 : rtx_sequence *seq = as_a <rtx_sequence *> (PATTERN (call_insn));
4451 0 : call_insn = seq->insn (0);
4452 : }
4453 265954680 : if (CALL_P (call_insn))
4454 : {
4455 6279098 : rtx note
4456 6279098 : = find_reg_note (call_insn, REG_CALL_ARG_LOCATION, NULL_RTX);
4457 6279098 : if (note)
4458 3287089 : remove_note (call_insn, note);
4459 : }
4460 :
4461 265954680 : if (final_output
4462 146925 : && (!NOTE_P (insn)
4463 67402 : || (NOTE_KIND (insn) != NOTE_INSN_VAR_LOCATION
4464 : && NOTE_KIND (insn) != NOTE_INSN_BEGIN_STMT
4465 67402 : && NOTE_KIND (insn) != NOTE_INSN_INLINE_ENTRY
4466 : && NOTE_KIND (insn) != NOTE_INSN_BLOCK_BEG
4467 : && NOTE_KIND (insn) != NOTE_INSN_BLOCK_END
4468 : && NOTE_KIND (insn) != NOTE_INSN_DELETED_DEBUG_LABEL)))
4469 118785 : print_rtl_single (final_output, insn);
4470 : }
4471 :
4472 1515935 : if (final_output)
4473 : {
4474 3994 : flag_dump_noaddr = save_noaddr;
4475 3994 : flag_dump_unnumbered = save_unnumbered;
4476 3994 : final_insns_dump_p = false;
4477 :
4478 3994 : if (fclose (final_output))
4479 : {
4480 0 : error ("could not close final insn dump file %qs: %m",
4481 : flag_dump_final_insns);
4482 0 : flag_dump_final_insns = NULL;
4483 : }
4484 : }
4485 :
4486 1515935 : flag_rerun_cse_after_global_opts = 0;
4487 1515935 : reload_completed = 0;
4488 1515935 : post_ra_split_completed = false;
4489 1515935 : epilogue_completed = 0;
4490 : #ifdef STACK_REGS
4491 1515935 : regstack_completed = 0;
4492 : #endif
4493 :
4494 : /* Clear out the insn_length contents now that they are no
4495 : longer valid. */
4496 1515935 : init_insn_lengths ();
4497 :
4498 : /* Show no temporary slots allocated. */
4499 1515935 : init_temp_slots ();
4500 :
4501 1515935 : free_bb_for_insn ();
4502 :
4503 1515935 : if (cfun->gimple_df)
4504 1515893 : delete_tree_ssa (cfun);
4505 :
4506 : /* We can reduce stack alignment on call site only when we are sure that
4507 : the function body just produced will be actually used in the final
4508 : executable. */
4509 1515935 : if (flag_ipa_stack_alignment
4510 1515935 : && decl_binds_to_current_def_p (current_function_decl))
4511 : {
4512 1259888 : unsigned int pref = crtl->preferred_stack_boundary;
4513 1259888 : if (crtl->stack_alignment_needed > crtl->preferred_stack_boundary)
4514 : pref = crtl->stack_alignment_needed;
4515 1259888 : cgraph_node::rtl_info (current_function_decl)
4516 1259888 : ->preferred_incoming_stack_boundary = pref;
4517 : }
4518 :
4519 : /* Make sure volatile mem refs aren't considered valid operands for
4520 : arithmetic insns. We must call this here if this is a nested inline
4521 : function, since the above code leaves us in the init_recog state,
4522 : and the function context push/pop code does not save/restore volatile_ok.
4523 :
4524 : ??? Maybe it isn't necessary for expand_start_function to call this
4525 : anymore if we do it here? */
4526 :
4527 1515935 : init_recog_no_volatile ();
4528 :
4529 : /* We're done with this function. Free up memory if we can. */
4530 1515935 : free_after_parsing (cfun);
4531 1515935 : free_after_compilation (cfun);
4532 1515935 : return 0;
4533 : }
4534 :
4535 : namespace {
4536 :
4537 : const pass_data pass_data_clean_state =
4538 : {
4539 : RTL_PASS, /* type */
4540 : "*clean_state", /* name */
4541 : OPTGROUP_NONE, /* optinfo_flags */
4542 : TV_FINAL, /* tv_id */
4543 : 0, /* properties_required */
4544 : 0, /* properties_provided */
4545 : PROP_rtl, /* properties_destroyed */
4546 : 0, /* todo_flags_start */
4547 : 0, /* todo_flags_finish */
4548 : };
4549 :
4550 : class pass_clean_state : public rtl_opt_pass
4551 : {
4552 : public:
4553 294196 : pass_clean_state (gcc::context *ctxt)
4554 588392 : : rtl_opt_pass (pass_data_clean_state, ctxt)
4555 : {}
4556 :
4557 : /* opt_pass methods: */
4558 1515935 : unsigned int execute (function *) final override
4559 : {
4560 1515935 : return rest_of_clean_state ();
4561 : }
4562 :
4563 : }; // class pass_clean_state
4564 :
4565 : } // anon namespace
4566 :
4567 : rtl_opt_pass *
4568 294196 : make_pass_clean_state (gcc::context *ctxt)
4569 : {
4570 294196 : return new pass_clean_state (ctxt);
4571 : }
4572 :
4573 : /* Return true if INSN is a call to the current function. */
4574 :
4575 : static bool
4576 826188 : self_recursive_call_p (rtx_insn *insn)
4577 : {
4578 826188 : tree fndecl = get_call_fndecl (insn);
4579 826188 : return (fndecl == current_function_decl
4580 826188 : && decl_binds_to_current_def_p (fndecl));
4581 : }
4582 :
4583 : /* Collect hard register usage for the current function. */
4584 :
4585 : static void
4586 957445 : collect_fn_hard_reg_usage (void)
4587 : {
4588 957445 : rtx_insn *insn;
4589 : #ifdef STACK_REGS
4590 957445 : int i;
4591 : #endif
4592 957445 : struct cgraph_rtl_info *node;
4593 957445 : HARD_REG_SET function_used_regs;
4594 :
4595 : /* ??? To be removed when all the ports have been fixed. */
4596 957445 : if (!targetm.call_fusage_contains_non_callee_clobbers)
4597 648861 : return;
4598 :
4599 : /* Be conservative - mark fixed and global registers as used. */
4600 957445 : function_used_regs = fixed_reg_set;
4601 :
4602 : #ifdef STACK_REGS
4603 : /* Handle STACK_REGS conservatively, since the df-framework does not
4604 : provide accurate information for them. */
4605 :
4606 8617005 : for (i = FIRST_STACK_REG; i <= LAST_STACK_REG; i++)
4607 7659560 : SET_HARD_REG_BIT (function_used_regs, i);
4608 : #endif
4609 :
4610 52869409 : for (insn = get_insns (); insn != NULL_RTX; insn = next_insn (insn))
4611 : {
4612 52560825 : HARD_REG_SET insn_used_regs;
4613 :
4614 52560825 : if (!NONDEBUG_INSN_P (insn))
4615 35146405 : continue;
4616 :
4617 17414420 : if (CALL_P (insn)
4618 17414420 : && !self_recursive_call_p (insn))
4619 823030 : function_used_regs
4620 1646060 : |= insn_callee_abi (insn).full_and_partial_reg_clobbers ();
4621 :
4622 17414420 : find_all_hard_reg_sets (insn, &insn_used_regs, false);
4623 17414420 : function_used_regs |= insn_used_regs;
4624 :
4625 34828840 : if (hard_reg_set_subset_p (crtl->abi->full_and_partial_reg_clobbers (),
4626 : function_used_regs))
4627 648861 : return;
4628 : }
4629 :
4630 : /* Mask out fully-saved registers, so that they don't affect equality
4631 : comparisons between function_abis. */
4632 308584 : function_used_regs &= crtl->abi->full_and_partial_reg_clobbers ();
4633 :
4634 308584 : node = cgraph_node::rtl_info (current_function_decl);
4635 308584 : gcc_assert (node != NULL);
4636 :
4637 308584 : node->function_used_regs = function_used_regs;
4638 : }
|
