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; /* Defined in generated attribute code. */
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_insn *, rtx_insn *, 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 286914 : init_final (const char *filename ATTRIBUTE_UNUSED)
205 : {
206 286914 : app_on = 0;
207 286914 : final_sequence = 0;
208 :
209 : #ifdef ASSEMBLER_DIALECT
210 286914 : dialect_number = ASSEMBLER_DIALECT;
211 : #endif
212 286914 : }
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 1521491 : default_function_pro_epilogue (FILE *)
220 : {
221 1521491 : }
222 :
223 : void
224 66541 : default_function_switched_text_sections (FILE *file ATTRIBUTE_UNUSED,
225 : tree decl ATTRIBUTE_UNUSED,
226 : bool new_is_cold ATTRIBUTE_UNUSED)
227 : {
228 66541 : }
229 :
230 : /* Default target hook that outputs nothing to a stream. */
231 : void
232 3134701 : no_asm_to_stream (FILE *file ATTRIBUTE_UNUSED)
233 : {
234 3134701 : }
235 :
236 : /* Enable APP processing of subsequent output.
237 : Used before the output from an `asm' statement. */
238 :
239 : void
240 33876 : app_enable (void)
241 : {
242 33876 : if (! app_on)
243 : {
244 30642 : fputs (ASM_APP_ON, asm_out_file);
245 30642 : app_on = 1;
246 : }
247 33876 : }
248 :
249 : /* Disable APP processing of subsequent output.
250 : Called from varasm.cc before most kinds of output. */
251 :
252 : void
253 160138487 : app_disable (void)
254 : {
255 160138487 : if (app_on)
256 : {
257 29542 : fputs (ASM_APP_OFF, asm_out_file);
258 29542 : app_on = 0;
259 : }
260 160138487 : }
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_insn **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 1522306 : init_insn_lengths (void)
314 : {
315 1522306 : if (uid_shuid)
316 : {
317 1517826 : free (uid_shuid);
318 1517826 : uid_shuid = 0;
319 : }
320 1522306 : if (insn_lengths)
321 : {
322 1517826 : free (insn_lengths);
323 1517826 : insn_lengths = 0;
324 1517826 : insn_lengths_max_uid = 0;
325 : }
326 1522306 : if (HAVE_ATTR_length)
327 1522306 : INSN_ADDRESSES_FREE ();
328 1522306 : if (uid_align)
329 : {
330 1517826 : free (uid_align);
331 1517826 : uid_align = 0;
332 : }
333 1522306 : }
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 410244123 : get_attr_length_1 (rtx_insn *insn, int (*fallback_fn) (rtx_insn *))
340 : {
341 410244123 : rtx body;
342 410244123 : int i;
343 410244123 : int length = 0;
344 :
345 410244123 : if (!HAVE_ATTR_length)
346 : return 0;
347 :
348 410244123 : if (insn_lengths_max_uid > INSN_UID (insn))
349 3382 : return insn_lengths[INSN_UID (insn)];
350 : else
351 410240741 : switch (GET_CODE (insn))
352 : {
353 : case NOTE:
354 : case BARRIER:
355 : case CODE_LABEL:
356 : case DEBUG_INSN:
357 : return 0;
358 :
359 9879579 : case CALL_INSN:
360 9879579 : case JUMP_INSN:
361 9879579 : body = PATTERN (insn);
362 9879579 : if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
363 165 : length = asm_insn_count (body) * fallback_fn (insn);
364 : else
365 9879414 : length = fallback_fn (insn);
366 : break;
367 :
368 388185143 : case INSN:
369 388185143 : body = PATTERN (insn);
370 388185143 : if (GET_CODE (body) == USE || GET_CODE (body) == CLOBBER)
371 : return 0;
372 :
373 387840651 : else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
374 7872 : length = asm_insn_count (body) * fallback_fn (insn);
375 387832779 : 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 387832779 : 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 390389968 : get_attr_length (rtx_insn *insn)
396 : {
397 390389968 : 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 19854155 : get_attr_min_length (rtx_insn *insn)
404 : {
405 19854155 : 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 7269 : final_addr_vec_align (rtx_jump_table_data *addr_vec)
468 : {
469 7269 : int align = GET_MODE_SIZE (addr_vec->get_data_mode ());
470 :
471 14443 : if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
472 0 : align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
473 7269 : 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 942 : label_to_alignment (rtx label)
495 : {
496 942 : if (CODE_LABEL_NUMBER (label) <= max_labelno)
497 942 : 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 28939942 : align_fuzz (rtx_insn *start, rtx_insn *end, int known_align_log,
531 : unsigned int growth)
532 : {
533 28939942 : int uid = INSN_UID (start);
534 28939942 : rtx_insn *align_label;
535 28939942 : int known_align = 1 << known_align_log;
536 28939942 : int end_shuid = INSN_SHUID (end);
537 28939942 : int fuzz = 0;
538 :
539 42565303 : for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
540 : {
541 16530058 : int align_addr, new_align;
542 :
543 16530058 : uid = INSN_UID (align_label);
544 16530058 : align_addr = INSN_ADDRESSES (uid) - insn_lengths[uid];
545 16530058 : if (uid_shuid[uid] > end_shuid)
546 : break;
547 13625361 : align_flags alignment = LABEL_TO_ALIGNMENT (align_label);
548 13625361 : new_align = 1 << alignment.levels[0].log;
549 13625361 : if (new_align < known_align)
550 0 : continue;
551 13625361 : fuzz += (-align_addr ^ growth) & (new_align - known_align);
552 13625361 : known_align = new_align;
553 : }
554 28939942 : return fuzz;
555 : }
556 :
557 : /* Compute a worst-case reference address of a branch so that it
558 : can be safely used in the presence of aligned labels. Since the
559 : size of the branch itself is unknown, the size of the branch is
560 : not included in the range. I.e. for a forward branch, the reference
561 : address is the end address of the branch as known from the previous
562 : branch shortening pass, minus a value to account for possible size
563 : increase due to alignment. For a backward branch, it is the start
564 : address of the branch as known from the current pass, plus a value
565 : to account for possible size increase due to alignment.
566 : NB.: Therefore, the maximum offset allowed for backward branches needs
567 : to exclude the branch size. */
568 :
569 : int
570 28939942 : insn_current_reference_address (rtx_insn *branch)
571 : {
572 28939942 : int seq_uid;
573 :
574 28939942 : if (! INSN_ADDRESSES_SET_P ())
575 : return 0;
576 :
577 28939942 : rtx_insn *seq = NEXT_INSN (PREV_INSN (branch));
578 28939942 : seq_uid = INSN_UID (seq);
579 28939942 : 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 28939942 : rtx_insn *dest = as_a<rtx_insn *> (JUMP_LABEL (branch));
587 :
588 : /* BRANCH has no proper alignment chain set, so use SEQ.
589 : BRANCH also has no INSN_SHUID. */
590 28939942 : if (INSN_SHUID (seq) < INSN_SHUID (dest))
591 : {
592 : /* Forward branch. */
593 20890612 : return (insn_last_address + insn_lengths[seq_uid]
594 20890612 : - align_fuzz (seq, dest, length_unit_log, ~0));
595 : }
596 : else
597 : {
598 : /* Backward branch. */
599 8049330 : return (insn_current_address
600 8049330 : + align_fuzz (dest, seq, length_unit_log, ~0));
601 : }
602 : }
603 :
604 : /* Compute branch alignments based on CFG profile. */
605 :
606 : void
607 1515922 : compute_alignments (void)
608 : {
609 1515922 : basic_block bb;
610 1515922 : align_flags max_alignment;
611 :
612 1515922 : label_align.truncate (0);
613 :
614 1515922 : max_labelno = max_label_num ();
615 1515922 : min_labelno = get_first_label_num ();
616 1515922 : 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 1515922 : if (! optimize || optimize_function_for_size_p (cfun))
620 511732 : return;
621 :
622 1004190 : 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 1004190 : loop_optimizer_init (AVOID_CFG_MODIFICATIONS);
629 1004190 : profile_count count_threshold = cfun->cfg->count_max / param_align_threshold;
630 :
631 1004190 : 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 11883333 : FOR_EACH_BB_FN (bb, cfun)
638 : {
639 10879143 : rtx_insn *label = BB_HEAD (bb);
640 10879143 : bool has_fallthru = 0;
641 10879143 : edge e;
642 10879143 : edge_iterator ei;
643 :
644 17890750 : if (!LABEL_P (label)
645 10879143 : || optimize_bb_for_size_p (bb))
646 : {
647 7011607 : 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 7013111 : continue;
654 : }
655 3867536 : max_alignment = LABEL_ALIGN (label);
656 3867536 : profile_count fallthru_count = profile_count::zero ();
657 3867536 : profile_count branch_count = profile_count::zero ();
658 :
659 11276280 : FOR_EACH_EDGE (e, ei, bb->preds)
660 : {
661 7408744 : if (e->flags & EDGE_FALLTHRU)
662 2363220 : has_fallthru = 1, fallthru_count += e->count ();
663 : else
664 5045524 : branch_count += e->count ();
665 : }
666 3867536 : 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 3867536 : if (!fallthru_count.initialized_p () || !branch_count.initialized_p ())
682 1504 : 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 3866032 : if (!has_fallthru
695 3866032 : && (branch_count > count_threshold
696 420787 : || (bb->count > bb->prev_bb->count * 10
697 27251 : && (bb->prev_bb->count
698 3893283 : <= ENTRY_BLOCK_PTR_FOR_FN (cfun)->count / 2))))
699 : {
700 1109918 : align_flags alignment = JUMP_ALIGN (label);
701 1109918 : if (dump_file)
702 38 : fprintf (dump_file, " jump alignment added.\n");
703 1109918 : 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 3866032 : if (has_fallthru
708 2362141 : && !(single_succ_p (bb)
709 811043 : && single_succ (bb) == EXIT_BLOCK_PTR_FOR_FN (cfun))
710 2013403 : && optimize_bb_for_speed_p (bb)
711 2013403 : && branch_count + fallthru_count > count_threshold
712 6228175 : && (branch_count > fallthru_count * param_align_loop_iterations))
713 : {
714 305791 : align_flags alignment = LOOP_ALIGN (label);
715 305791 : if (dump_file)
716 11 : fprintf (dump_file, " internal loop alignment added.\n");
717 305791 : max_alignment = align_flags::max (max_alignment, alignment);
718 : }
719 3866032 : LABEL_TO_ALIGNMENT (label) = max_alignment;
720 : }
721 :
722 1004190 : loop_optimizer_finalize ();
723 1004190 : 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 294536 : pass_compute_alignments (gcc::context *ctxt)
786 589072 : : rtl_opt_pass (pass_data_compute_alignments, ctxt)
787 : {}
788 :
789 : /* opt_pass methods: */
790 1515922 : unsigned int execute (function *) final override
791 : {
792 1515922 : compute_alignments ();
793 1515922 : return 0;
794 : }
795 :
796 : }; // class pass_compute_alignments
797 :
798 : } // anon namespace
799 :
800 : rtl_opt_pass *
801 294536 : make_pass_compute_alignments (gcc::context *ctxt)
802 : {
803 294536 : 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 1517826 : shorten_branches (rtx_insn *first)
820 : {
821 1517826 : rtx_insn *insn;
822 1517826 : int max_uid;
823 1517826 : int i;
824 1517826 : rtx_insn *seq;
825 1517826 : bool something_changed = true;
826 1517826 : char *varying_length;
827 1517826 : rtx body;
828 1517826 : int uid;
829 1517826 : rtx_insn *align_tab[MAX_CODE_ALIGN + 1];
830 :
831 : /* Compute maximum UID and allocate label_align / uid_shuid. */
832 1517826 : max_uid = get_max_uid ();
833 :
834 : /* Free uid_shuid before reallocating it. */
835 1517826 : free (uid_shuid);
836 :
837 1517826 : uid_shuid = XNEWVEC (int, max_uid);
838 :
839 1517826 : 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 1517826 : align_flags max_alignment;
849 :
850 219458725 : for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
851 : {
852 217940899 : INSN_SHUID (insn) = i++;
853 217940899 : if (INSN_P (insn))
854 96032512 : continue;
855 :
856 121908387 : if (rtx_code_label *label = dyn_cast <rtx_code_label *> (insn))
857 : {
858 : /* Merge in alignments computed by compute_alignments. */
859 7056037 : align_flags alignment = LABEL_TO_ALIGNMENT (label);
860 7056037 : max_alignment = align_flags::max (max_alignment, alignment);
861 :
862 7056037 : rtx_jump_table_data *table = jump_table_for_label (label);
863 7056037 : if (!table)
864 : {
865 7048768 : align_flags alignment = LABEL_ALIGN (label);
866 7048768 : 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 7056037 : if ((JUMP_TABLES_IN_TEXT_SECTION
871 7056037 : || 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 7056037 : LABEL_TO_ALIGNMENT (label) = max_alignment;
878 7056037 : max_alignment = align_flags ();
879 : }
880 114852350 : else if (BARRIER_P (insn))
881 : {
882 : rtx_insn *label;
883 :
884 29347317 : for (label = insn; label && ! INSN_P (label);
885 24458348 : label = NEXT_INSN (label))
886 27775531 : if (LABEL_P (label))
887 : {
888 3317183 : align_flags alignment
889 3317183 : = align_flags (LABEL_ALIGN_AFTER_BARRIER (insn));
890 3317183 : max_alignment = align_flags::max (max_alignment, alignment);
891 3317183 : break;
892 : }
893 : }
894 : }
895 1517826 : if (!HAVE_ATTR_length)
896 : return;
897 :
898 : /* Allocate the rest of the arrays. */
899 1517826 : insn_lengths = XNEWVEC (int, max_uid);
900 1517826 : 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 1517826 : INSN_ADDRESSES_ALLOC (max_uid);
904 :
905 1517826 : 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 1517826 : uid_align = XCNEWVEC (rtx_insn *, max_uid);
913 :
914 27320868 : for (i = MAX_CODE_ALIGN + 1; --i >= 0;)
915 25803042 : align_tab[i] = nullptr;
916 1517826 : seq = get_last_insn ();
917 219458725 : for (; seq; seq = PREV_INSN (seq))
918 : {
919 217940899 : int uid = INSN_UID (seq);
920 217940899 : int log;
921 217940899 : log = (LABEL_P (seq) ? LABEL_TO_ALIGNMENT (seq).levels[0].log : 0);
922 217940899 : uid_align[uid] = align_tab[0];
923 217940899 : if (log)
924 : {
925 : /* Found an alignment label. */
926 1355120 : gcc_checking_assert (log < MAX_CODE_ALIGN + 1);
927 1355120 : uid_align[uid] = align_tab[log];
928 6775690 : for (i = log - 1; i >= 0; i--)
929 5420570 : 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 1517826 : 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 1517826 : int (*length_fun) (rtx_insn *) = increasing ? insn_min_length : insn_default_length;
1003 :
1004 1517826 : for (insn_current_address = 0, insn = first;
1005 219458725 : insn != 0;
1006 217940899 : insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1007 : {
1008 217940899 : uid = INSN_UID (insn);
1009 :
1010 217940899 : insn_lengths[uid] = 0;
1011 :
1012 217940899 : if (LABEL_P (insn))
1013 : {
1014 7056037 : int log = LABEL_TO_ALIGNMENT (insn).levels[0].log;
1015 7056037 : if (log)
1016 : {
1017 1355120 : int align = 1 << log;
1018 1355120 : int new_address = (insn_current_address + align - 1) & -align;
1019 1355120 : insn_lengths[uid] = new_address - insn_current_address;
1020 : }
1021 : }
1022 :
1023 217940899 : INSN_ADDRESSES (uid) = insn_current_address + insn_lengths[uid];
1024 :
1025 217940899 : if (NOTE_P (insn) || BARRIER_P (insn)
1026 103095818 : || LABEL_P (insn) || DEBUG_INSN_P (insn))
1027 121901122 : continue;
1028 96039777 : if (insn->deleted ())
1029 0 : continue;
1030 :
1031 96039777 : body = PATTERN (insn);
1032 96039777 : 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 7269 : if (JUMP_TABLES_IN_TEXT_SECTION
1037 7269 : || 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 96032508 : else if (GET_CODE (body) == ASM_INPUT || asm_noperands (body) >= 0)
1044 95964 : insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
1045 95936544 : 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 95936544 : else if (GET_CODE (body) != USE && GET_CODE (body) != CLOBBER)
1087 : {
1088 94870272 : insn_lengths[uid] = length_fun (insn);
1089 94870272 : 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 2851883 : while (something_changed)
1105 : {
1106 1781568 : something_changed = false;
1107 1781568 : insn_current_align = MAX_CODE_ALIGN - 1;
1108 403881997 : for (insn_current_address = 0, insn = first;
1109 403881997 : insn != 0;
1110 402100429 : insn = NEXT_INSN (insn))
1111 : {
1112 402100429 : int new_length;
1113 : #ifdef ADJUST_INSN_LENGTH
1114 : int tmp_length;
1115 : #endif
1116 402100429 : int length_align;
1117 :
1118 402100429 : uid = INSN_UID (insn);
1119 :
1120 402100429 : if (rtx_code_label *label = dyn_cast <rtx_code_label *> (insn))
1121 : {
1122 12670404 : 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 12670404 : if (log > insn_current_align)
1146 : {
1147 2742263 : int align = 1 << log;
1148 2742263 : int new_address= (insn_current_address + align - 1) & -align;
1149 2742263 : insn_lengths[uid] = new_address - insn_current_address;
1150 2742263 : insn_current_align = log;
1151 2742263 : insn_current_address = new_address;
1152 : }
1153 : else
1154 9928141 : insn_lengths[uid] = 0;
1155 12670404 : INSN_ADDRESSES (uid) = insn_current_address;
1156 12670404 : continue;
1157 12670404 : }
1158 :
1159 389430025 : length_align = INSN_LENGTH_ALIGNMENT (insn);
1160 389430025 : if (length_align < insn_current_align)
1161 4523831 : insn_current_align = length_align;
1162 :
1163 389430025 : insn_last_address = INSN_ADDRESSES (uid);
1164 389430025 : 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_insn *min_lab = label_ref_label (XEXP (body, 2));
1177 : rtx_insn *max_lab = label_ref_label (XEXP (body, 3));
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 389430025 : if (! (varying_length[uid]))
1285 : {
1286 373011534 : rtx_sequence *seq;
1287 373011534 : if (NONJUMP_INSN_P (insn)
1288 373011534 : && (seq = dyn_cast<rtx_sequence *> (PATTERN (insn))))
1289 : {
1290 0 : for (int i = 0; i < seq->len (); i++)
1291 : {
1292 0 : rtx_insn *inner_insn = seq->insn (i);
1293 0 : int inner_uid = INSN_UID (inner_insn);
1294 :
1295 0 : INSN_ADDRESSES (inner_uid) = insn_current_address;
1296 :
1297 0 : insn_current_address += insn_lengths[inner_uid];
1298 : }
1299 : }
1300 : else
1301 373011534 : insn_current_address += insn_lengths[uid];
1302 :
1303 373011534 : continue;
1304 373011534 : }
1305 :
1306 16418491 : if (NONJUMP_INSN_P (insn) && GET_CODE (PATTERN (insn)) == SEQUENCE)
1307 : {
1308 0 : rtx_sequence *seqn = as_a <rtx_sequence *> (PATTERN (insn));
1309 0 : int i;
1310 :
1311 0 : body = PATTERN (insn);
1312 0 : new_length = 0;
1313 0 : for (i = 0; i < seqn->len (); i++)
1314 : {
1315 0 : rtx_insn *inner_insn = seqn->insn (i);
1316 0 : int inner_uid = INSN_UID (inner_insn);
1317 0 : int inner_length;
1318 :
1319 0 : INSN_ADDRESSES (inner_uid) = insn_current_address;
1320 :
1321 : /* insn_current_length returns 0 for insns with a
1322 : non-varying length. */
1323 0 : if (! varying_length[inner_uid])
1324 0 : inner_length = insn_lengths[inner_uid];
1325 : else
1326 0 : inner_length = insn_current_length (inner_insn);
1327 :
1328 0 : if (inner_length != insn_lengths[inner_uid])
1329 : {
1330 0 : if (!increasing || inner_length > insn_lengths[inner_uid])
1331 : {
1332 0 : insn_lengths[inner_uid] = inner_length;
1333 0 : something_changed = true;
1334 : }
1335 : else
1336 : inner_length = insn_lengths[inner_uid];
1337 : }
1338 0 : insn_current_address += inner_length;
1339 0 : new_length += inner_length;
1340 : }
1341 : }
1342 : else
1343 : {
1344 16418491 : new_length = insn_current_length (insn);
1345 16418491 : insn_current_address += new_length;
1346 : }
1347 :
1348 : #ifdef ADJUST_INSN_LENGTH
1349 : /* If needed, do any adjustment. */
1350 : tmp_length = new_length;
1351 : ADJUST_INSN_LENGTH (insn, new_length);
1352 : insn_current_address += (new_length - tmp_length);
1353 : #endif
1354 :
1355 16418491 : if (new_length != insn_lengths[uid]
1356 5475474 : && (!increasing || new_length > insn_lengths[uid]))
1357 : {
1358 5475474 : insn_lengths[uid] = new_length;
1359 5475474 : something_changed = true;
1360 : }
1361 : else
1362 10943017 : insn_current_address += insn_lengths[uid] - new_length;
1363 : }
1364 : /* For a non-optimizing compile, do only a single pass. */
1365 1781568 : if (!increasing)
1366 : break;
1367 : }
1368 1517826 : crtl->max_insn_address = insn_current_address;
1369 1517826 : free (varying_length);
1370 : }
1371 :
1372 : /* Given the body of an INSN known to be generated by an ASM statement, return
1373 : the number of machine instructions likely to be generated for this insn.
1374 : This is used to compute its length. */
1375 :
1376 : static int
1377 104001 : asm_insn_count (rtx body)
1378 : {
1379 104001 : const char *templ;
1380 :
1381 104001 : if (GET_CODE (body) == ASM_INPUT)
1382 3585 : templ = XSTR (body, 0);
1383 : else
1384 100416 : templ = decode_asm_operands (body, NULL, NULL, NULL, NULL, NULL);
1385 :
1386 104001 : return asm_str_count (templ);
1387 : }
1388 :
1389 : /* Return the number of machine instructions likely to be generated for the
1390 : inline-asm template. */
1391 : int
1392 767440 : asm_str_count (const char *templ)
1393 : {
1394 767440 : int count = 1;
1395 :
1396 767440 : if (!*templ)
1397 : return 0;
1398 :
1399 3865802 : for (; *templ; templ++)
1400 3663269 : if (IS_ASM_LOGICAL_LINE_SEPARATOR (*templ, templ)
1401 3655815 : || *templ == '\n')
1402 223025 : count++;
1403 :
1404 : return count;
1405 : }
1406 :
1407 : /* Return true if DWARF2 debug info can be emitted for DECL. */
1408 :
1409 : static bool
1410 3109521 : dwarf2_debug_info_emitted_p (tree decl)
1411 : {
1412 : /* When DWARF2 debug info is not generated internally. */
1413 3109521 : if (!dwarf_debuginfo_p () && !dwarf_based_debuginfo_p ())
1414 : return false;
1415 :
1416 1198254 : if (DECL_IGNORED_P (decl))
1417 16288 : return false;
1418 :
1419 : return true;
1420 : }
1421 :
1422 : /* Return scope resulting from combination of S1 and S2. */
1423 : static tree
1424 0 : choose_inner_scope (tree s1, tree s2)
1425 : {
1426 0 : if (!s1)
1427 : return s2;
1428 0 : if (!s2)
1429 : return s1;
1430 0 : if (BLOCK_NUMBER (s1) > BLOCK_NUMBER (s2))
1431 0 : return s1;
1432 : return s2;
1433 : }
1434 :
1435 : /* Emit lexical block notes needed to change scope from S1 to S2. */
1436 :
1437 : static void
1438 18584515 : change_scope (rtx_insn *orig_insn, tree s1, tree s2)
1439 : {
1440 18584515 : rtx_insn *insn = orig_insn;
1441 18584515 : tree com = NULL_TREE;
1442 18584515 : tree ts1 = s1, ts2 = s2;
1443 18584515 : tree s;
1444 :
1445 61049161 : while (ts1 != ts2)
1446 : {
1447 42464646 : gcc_assert (ts1 && ts2);
1448 42464646 : if (BLOCK_NUMBER (ts1) > BLOCK_NUMBER (ts2))
1449 17134367 : ts1 = BLOCK_SUPERCONTEXT (ts1);
1450 25330279 : else if (BLOCK_NUMBER (ts1) < BLOCK_NUMBER (ts2))
1451 17134367 : ts2 = BLOCK_SUPERCONTEXT (ts2);
1452 : else
1453 : {
1454 8195912 : ts1 = BLOCK_SUPERCONTEXT (ts1);
1455 8195912 : ts2 = BLOCK_SUPERCONTEXT (ts2);
1456 : }
1457 : }
1458 43914794 : com = ts1;
1459 :
1460 : /* Close scopes. */
1461 : s = s1;
1462 43914794 : while (s != com)
1463 : {
1464 25330279 : rtx_note *note = emit_note_before (NOTE_INSN_BLOCK_END, insn);
1465 25330279 : NOTE_BLOCK (note) = s;
1466 25330279 : s = BLOCK_SUPERCONTEXT (s);
1467 : }
1468 :
1469 : /* Open scopes. */
1470 : s = s2;
1471 43914794 : while (s != com)
1472 : {
1473 25330279 : insn = emit_note_before (NOTE_INSN_BLOCK_BEG, insn);
1474 25330279 : NOTE_BLOCK (insn) = s;
1475 25330279 : s = BLOCK_SUPERCONTEXT (s);
1476 : }
1477 18584515 : }
1478 :
1479 : /* Rebuild all the NOTE_INSN_BLOCK_BEG and NOTE_INSN_BLOCK_END notes based
1480 : on the scope tree and the newly reordered instructions. */
1481 :
1482 : static void
1483 587573 : reemit_insn_block_notes (void)
1484 : {
1485 587573 : tree cur_block = DECL_INITIAL (cfun->decl);
1486 587573 : rtx_insn *insn;
1487 :
1488 587573 : insn = get_insns ();
1489 158862415 : for (; insn; insn = NEXT_INSN (insn))
1490 : {
1491 158274842 : tree this_block;
1492 :
1493 : /* Prevent lexical blocks from straddling section boundaries. */
1494 158274842 : if (NOTE_P (insn))
1495 103631969 : switch (NOTE_KIND (insn))
1496 : {
1497 : case NOTE_INSN_SWITCH_TEXT_SECTIONS:
1498 : {
1499 89217 : for (tree s = cur_block; s != DECL_INITIAL (cfun->decl);
1500 66109 : s = BLOCK_SUPERCONTEXT (s))
1501 : {
1502 66109 : rtx_note *note = emit_note_before (NOTE_INSN_BLOCK_END, insn);
1503 66109 : NOTE_BLOCK (note) = s;
1504 66109 : note = emit_note_after (NOTE_INSN_BLOCK_BEG, insn);
1505 66109 : NOTE_BLOCK (note) = s;
1506 : }
1507 : }
1508 : break;
1509 :
1510 12023449 : case NOTE_INSN_BEGIN_STMT:
1511 12023449 : case NOTE_INSN_INLINE_ENTRY:
1512 12023449 : this_block = LOCATION_BLOCK (NOTE_MARKER_LOCATION (insn));
1513 12014338 : if (!this_block)
1514 14589 : continue;
1515 12008860 : goto set_cur_block_to_this_block;
1516 :
1517 91585412 : default:
1518 91585412 : continue;
1519 91585412 : }
1520 :
1521 54665981 : if (!active_insn_p (insn))
1522 7470134 : continue;
1523 :
1524 : /* Avoid putting scope notes between jump table and its label. */
1525 47195847 : if (JUMP_TABLE_DATA_P (insn))
1526 6272 : continue;
1527 :
1528 47189575 : this_block = insn_scope (insn);
1529 : /* For sequences compute scope resulting from merging all scopes
1530 : of instructions nested inside. */
1531 47189575 : if (rtx_sequence *body = dyn_cast <rtx_sequence *> (PATTERN (insn)))
1532 : {
1533 : int i;
1534 :
1535 : this_block = NULL;
1536 0 : for (i = 0; i < body->len (); i++)
1537 0 : this_block = choose_inner_scope (this_block,
1538 0 : insn_scope (body->insn (i)));
1539 : }
1540 47189575 : if (! this_block)
1541 : {
1542 10559341 : if (INSN_LOCATION (insn) == UNKNOWN_LOCATION)
1543 5173644 : continue;
1544 : else
1545 5385697 : this_block = DECL_INITIAL (cfun->decl);
1546 : }
1547 :
1548 36630234 : set_cur_block_to_this_block:
1549 54024791 : if (this_block != cur_block)
1550 : {
1551 17996942 : change_scope (insn, cur_block, this_block);
1552 17996942 : cur_block = this_block;
1553 : }
1554 : }
1555 :
1556 : /* change_scope emits before the insn, not after. */
1557 587573 : rtx_note *note = emit_note (NOTE_INSN_DELETED);
1558 587573 : change_scope (note, cur_block, DECL_INITIAL (cfun->decl));
1559 587573 : delete_insn (note);
1560 :
1561 587573 : reorder_blocks ();
1562 587573 : }
1563 :
1564 : static const char *some_local_dynamic_name;
1565 :
1566 : /* Locate some local-dynamic symbol still in use by this function
1567 : so that we can print its name in local-dynamic base patterns.
1568 : Return null if there are no local-dynamic references. */
1569 :
1570 : const char *
1571 206 : get_some_local_dynamic_name ()
1572 : {
1573 206 : subrtx_iterator::array_type array;
1574 206 : rtx_insn *insn;
1575 :
1576 206 : if (some_local_dynamic_name)
1577 : return some_local_dynamic_name;
1578 :
1579 8618 : for (insn = get_insns (); insn ; insn = NEXT_INSN (insn))
1580 8617 : if (NONDEBUG_INSN_P (insn))
1581 17548 : FOR_EACH_SUBRTX (iter, array, PATTERN (insn), ALL)
1582 : {
1583 15231 : const_rtx x = *iter;
1584 15231 : if (GET_CODE (x) == SYMBOL_REF)
1585 : {
1586 530 : if (SYMBOL_REF_TLS_MODEL (x) == TLS_MODEL_LOCAL_DYNAMIC)
1587 184 : return some_local_dynamic_name = XSTR (x, 0);
1588 346 : if (CONSTANT_POOL_ADDRESS_P (x))
1589 0 : iter.substitute (get_pool_constant (x));
1590 : }
1591 : }
1592 :
1593 : return 0;
1594 206 : }
1595 :
1596 : /* Arrange for us to emit a source location note before any further
1597 : real insns or section changes, by setting the SEEN_NEXT_VIEW bit in
1598 : *SEEN, as long as we are keeping track of location views. The bit
1599 : indicates we have referenced the next view at the current PC, so we
1600 : have to emit it. This should be called next to the var_location
1601 : debug hook. */
1602 :
1603 : static inline void
1604 68637020 : set_next_view_needed (int *seen)
1605 : {
1606 68637020 : if (debug_variable_location_views)
1607 68637020 : *seen |= SEEN_NEXT_VIEW;
1608 : }
1609 :
1610 : /* Clear the flag in *SEEN indicating we need to emit the next view.
1611 : This should be called next to the source_line debug hook. */
1612 :
1613 : static inline void
1614 49617352 : clear_next_view_needed (int *seen)
1615 : {
1616 49617352 : *seen &= ~SEEN_NEXT_VIEW;
1617 : }
1618 :
1619 : /* Test whether we have a pending request to emit the next view in
1620 : *SEEN, and emit it if needed, clearing the request bit. */
1621 :
1622 : static inline void
1623 93581821 : maybe_output_next_view (int *seen)
1624 : {
1625 93581821 : if ((*seen & SEEN_NEXT_VIEW) != 0)
1626 : {
1627 9228732 : clear_next_view_needed (seen);
1628 9228732 : (*debug_hooks->source_line) (last_linenum, last_columnnum,
1629 : last_filename, last_discriminator,
1630 : false);
1631 : }
1632 93581821 : }
1633 :
1634 : /* We want to emit param bindings (before the first begin_stmt) in the
1635 : initial view, if we are emitting views. To that end, we may
1636 : consume initial notes in the function, processing them in
1637 : final_start_function, before signaling the beginning of the
1638 : prologue, rather than in final.
1639 :
1640 : We don't test whether the DECLs are PARM_DECLs: the assumption is
1641 : that there will be a NOTE_INSN_BEGIN_STMT marker before any
1642 : non-parameter NOTE_INSN_VAR_LOCATION. It's ok if the marker is not
1643 : there, we'll just have more variable locations bound in the initial
1644 : view, which is consistent with their being bound without any code
1645 : that would give them a value. */
1646 :
1647 : static inline bool
1648 3002049 : in_initial_view_p (rtx_insn *insn)
1649 : {
1650 3002049 : return (!DECL_IGNORED_P (current_function_decl)
1651 2991633 : && debug_variable_location_views
1652 1988800 : && insn && GET_CODE (insn) == NOTE
1653 4819583 : && (NOTE_KIND (insn) == NOTE_INSN_VAR_LOCATION
1654 849002 : || NOTE_KIND (insn) == NOTE_INSN_DELETED));
1655 : }
1656 :
1657 : /* Output assembler code for the start of a function,
1658 : and initialize some of the variables in this file
1659 : for the new function. The label for the function and associated
1660 : assembler pseudo-ops have already been output in `assemble_start_function'.
1661 :
1662 : FIRST is the first insn of the rtl for the function being compiled.
1663 : FILE is the file to write assembler code to.
1664 : SEEN should be initially set to zero, and it may be updated to
1665 : indicate we have references to the next location view, that would
1666 : require us to emit it at the current PC.
1667 : OPTIMIZE_P is nonzero if we should eliminate redundant
1668 : test and compare insns. */
1669 :
1670 : static void
1671 1521491 : final_start_function_1 (rtx_insn **firstp, FILE *file, int *seen,
1672 : int optimize_p ATTRIBUTE_UNUSED)
1673 : {
1674 1521491 : block_depth = 0;
1675 :
1676 1521491 : this_is_asm_operands = 0;
1677 :
1678 1521491 : need_profile_function = false;
1679 :
1680 1521491 : last_filename = LOCATION_FILE (prologue_location);
1681 1521491 : last_linenum = LOCATION_LINE (prologue_location);
1682 1521491 : last_columnnum = LOCATION_COLUMN (prologue_location);
1683 1521491 : last_discriminator = 0;
1684 1521491 : force_source_line = false;
1685 :
1686 1521491 : high_block_linenum = high_function_linenum = last_linenum;
1687 :
1688 1521491 : rtx_insn *first = *firstp;
1689 1521491 : if (in_initial_view_p (first))
1690 : {
1691 1478654 : do
1692 : {
1693 1478654 : final_scan_insn (first, file, 0, 0, seen);
1694 1478654 : first = NEXT_INSN (first);
1695 : }
1696 1478654 : while (in_initial_view_p (first));
1697 510122 : *firstp = first;
1698 : }
1699 :
1700 1521491 : if (!DECL_IGNORED_P (current_function_decl))
1701 1511075 : debug_hooks->begin_prologue (last_linenum, last_columnnum,
1702 : last_filename);
1703 :
1704 1521491 : if (!dwarf2_debug_info_emitted_p (current_function_decl))
1705 942055 : dwarf2out_begin_prologue (0, 0, NULL);
1706 :
1707 1521491 : if (DECL_IGNORED_P (current_function_decl) && last_linenum && last_filename)
1708 6152 : debug_hooks->set_ignored_loc (last_linenum, last_columnnum, last_filename);
1709 :
1710 : #ifdef LEAF_REG_REMAP
1711 : if (crtl->uses_only_leaf_regs)
1712 : leaf_renumber_regs (first);
1713 : #endif
1714 :
1715 : /* The Sun386i and perhaps other machines don't work right
1716 : if the profiling code comes after the prologue. */
1717 1521491 : if (targetm.profile_before_prologue () && crtl->profile)
1718 : {
1719 303 : if (targetm.asm_out.function_prologue == default_function_pro_epilogue
1720 303 : && targetm.have_prologue ())
1721 : {
1722 : rtx_insn *insn;
1723 606 : for (insn = first; insn; insn = NEXT_INSN (insn))
1724 606 : if (!NOTE_P (insn))
1725 : {
1726 : insn = NULL;
1727 : break;
1728 : }
1729 606 : else if (NOTE_KIND (insn) == NOTE_INSN_BASIC_BLOCK
1730 303 : || NOTE_KIND (insn) == NOTE_INSN_FUNCTION_BEG)
1731 : break;
1732 303 : else if (NOTE_KIND (insn) == NOTE_INSN_DELETED
1733 0 : || NOTE_KIND (insn) == NOTE_INSN_VAR_LOCATION)
1734 303 : continue;
1735 : else
1736 : {
1737 : insn = NULL;
1738 : break;
1739 : }
1740 :
1741 303 : if (insn)
1742 303 : need_profile_function = true;
1743 : else
1744 0 : profile_function (file);
1745 : }
1746 : else
1747 0 : profile_function (file);
1748 : }
1749 :
1750 : /* If debugging, assign block numbers to all of the blocks in this
1751 : function. */
1752 1521491 : if (write_symbols)
1753 : {
1754 587573 : reemit_insn_block_notes ();
1755 587573 : number_blocks (current_function_decl);
1756 : /* We never actually put out begin/end notes for the top-level
1757 : block in the function. But, conceptually, that block is
1758 : always needed. */
1759 587573 : TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl)) = 1;
1760 : }
1761 :
1762 1521491 : unsigned HOST_WIDE_INT min_frame_size
1763 1521491 : = constant_lower_bound (get_frame_size ());
1764 1521491 : if (min_frame_size > (unsigned HOST_WIDE_INT) warn_frame_larger_than_size)
1765 : {
1766 : /* Issue a warning */
1767 6 : warning (OPT_Wframe_larger_than_,
1768 : "the frame size of %wu bytes is larger than %wu bytes",
1769 : min_frame_size, warn_frame_larger_than_size);
1770 : }
1771 :
1772 : /* First output the function prologue: code to set up the stack frame. */
1773 1521491 : targetm.asm_out.function_prologue (file);
1774 :
1775 : /* If the machine represents the prologue as RTL, the profiling code must
1776 : be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1777 1521491 : if (! targetm.have_prologue ())
1778 0 : profile_after_prologue (file);
1779 1521491 : }
1780 :
1781 : /* This is an exported final_start_function_1, callable without SEEN. */
1782 :
1783 : void
1784 5568 : final_start_function (rtx_insn *first, FILE *file,
1785 : int optimize_p ATTRIBUTE_UNUSED)
1786 : {
1787 5568 : int seen = 0;
1788 5568 : final_start_function_1 (&first, file, &seen, optimize_p);
1789 5568 : gcc_assert (seen == 0);
1790 5568 : }
1791 :
1792 : static void
1793 1517827 : profile_after_prologue (FILE *file ATTRIBUTE_UNUSED)
1794 : {
1795 1517827 : if (!targetm.profile_before_prologue () && crtl->profile)
1796 12 : profile_function (file);
1797 1517827 : }
1798 :
1799 : static void
1800 315 : profile_function (FILE *file ATTRIBUTE_UNUSED)
1801 : {
1802 : #ifndef NO_PROFILE_COUNTERS
1803 : # define NO_PROFILE_COUNTERS 0
1804 : #endif
1805 : #ifdef ASM_OUTPUT_REG_PUSH
1806 315 : rtx sval = NULL, chain = NULL;
1807 :
1808 315 : if (cfun->returns_struct)
1809 0 : sval = targetm.calls.struct_value_rtx (TREE_TYPE (current_function_decl),
1810 : true);
1811 315 : if (cfun->static_chain_decl)
1812 1 : chain = targetm.calls.static_chain (current_function_decl, true);
1813 : #endif /* ASM_OUTPUT_REG_PUSH */
1814 :
1815 315 : if (! NO_PROFILE_COUNTERS)
1816 : {
1817 : int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1818 : switch_to_section (data_section);
1819 : ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1820 : targetm.asm_out.internal_label (file, "LP", current_function_funcdef_no);
1821 : assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, align, 1);
1822 : }
1823 :
1824 315 : switch_to_section (current_function_section ());
1825 :
1826 : #ifdef ASM_OUTPUT_REG_PUSH
1827 315 : if (sval && REG_P (sval))
1828 0 : ASM_OUTPUT_REG_PUSH (file, REGNO (sval));
1829 315 : if (chain && REG_P (chain))
1830 1 : ASM_OUTPUT_REG_PUSH (file, REGNO (chain));
1831 : #endif
1832 :
1833 315 : FUNCTION_PROFILER (file, current_function_funcdef_no);
1834 :
1835 : #ifdef ASM_OUTPUT_REG_PUSH
1836 315 : if (chain && REG_P (chain))
1837 1 : ASM_OUTPUT_REG_POP (file, REGNO (chain));
1838 315 : if (sval && REG_P (sval))
1839 0 : ASM_OUTPUT_REG_POP (file, REGNO (sval));
1840 : #endif
1841 315 : }
1842 :
1843 : /* Output assembler code for the end of a function.
1844 : For clarity, args are same as those of `final_start_function'
1845 : even though not all of them are needed. */
1846 :
1847 : void
1848 1521491 : final_end_function (void)
1849 : {
1850 1521491 : app_disable ();
1851 :
1852 1521491 : if (!DECL_IGNORED_P (current_function_decl))
1853 1511075 : debug_hooks->end_function (high_function_linenum);
1854 :
1855 : /* Finally, output the function epilogue:
1856 : code to restore the stack frame and return to the caller. */
1857 1521491 : targetm.asm_out.function_epilogue (asm_out_file);
1858 :
1859 : /* And debug output. */
1860 1521491 : if (!DECL_IGNORED_P (current_function_decl))
1861 1511075 : debug_hooks->end_epilogue (last_linenum, last_filename);
1862 :
1863 1521491 : if (!dwarf2_debug_info_emitted_p (current_function_decl)
1864 1521491 : && dwarf2out_do_frame ())
1865 941997 : dwarf2out_end_epilogue (last_linenum, last_filename);
1866 :
1867 1521491 : some_local_dynamic_name = 0;
1868 1521491 : }
1869 :
1870 :
1871 : /* Dumper helper for basic block information. FILE is the assembly
1872 : output file, and INSN is the instruction being emitted. */
1873 :
1874 : static void
1875 279340356 : dump_basic_block_info (FILE *file, rtx_insn *insn, basic_block *start_to_bb,
1876 : basic_block *end_to_bb, int bb_map_size, int *bb_seqn)
1877 : {
1878 279340356 : basic_block bb;
1879 :
1880 279340356 : if (!flag_debug_asm)
1881 : return;
1882 :
1883 34287 : if (INSN_UID (insn) < bb_map_size
1884 34287 : && (bb = start_to_bb[INSN_UID (insn)]) != NULL)
1885 : {
1886 2100 : edge e;
1887 2100 : edge_iterator ei;
1888 :
1889 2100 : fprintf (file, "%s BLOCK %d", ASM_COMMENT_START, bb->index);
1890 2100 : if (bb->count.initialized_p ())
1891 : {
1892 164 : fprintf (file, ", count:");
1893 164 : bb->count.dump (file);
1894 : }
1895 2100 : fprintf (file, " seq:%d", (*bb_seqn)++);
1896 2100 : fprintf (file, "\n%s PRED:", ASM_COMMENT_START);
1897 4490 : FOR_EACH_EDGE (e, ei, bb->preds)
1898 : {
1899 2390 : dump_edge_info (file, e, TDF_DETAILS, 0);
1900 : }
1901 2100 : fprintf (file, "\n");
1902 : }
1903 34287 : if (INSN_UID (insn) < bb_map_size
1904 34287 : && (bb = end_to_bb[INSN_UID (insn)]) != NULL)
1905 : {
1906 2100 : edge e;
1907 2100 : edge_iterator ei;
1908 :
1909 2100 : fprintf (asm_out_file, "%s SUCC:", ASM_COMMENT_START);
1910 4488 : FOR_EACH_EDGE (e, ei, bb->succs)
1911 : {
1912 2388 : dump_edge_info (asm_out_file, e, TDF_DETAILS, 1);
1913 : }
1914 2100 : fprintf (file, "\n");
1915 : }
1916 : }
1917 :
1918 : /* Output assembler code for some insns: all or part of a function.
1919 : For description of args, see `final_start_function', above. */
1920 :
1921 : static void
1922 1517827 : final_1 (rtx_insn *first, FILE *file, int seen, int optimize_p)
1923 : {
1924 1517827 : rtx_insn *insn, *next;
1925 :
1926 : /* Used for -dA dump. */
1927 1517827 : basic_block *start_to_bb = NULL;
1928 1517827 : basic_block *end_to_bb = NULL;
1929 1517827 : int bb_map_size = 0;
1930 1517827 : int bb_seqn = 0;
1931 :
1932 1517827 : last_ignored_compare = 0;
1933 :
1934 1517827 : init_recog ();
1935 :
1936 1517827 : CC_STATUS_INIT;
1937 :
1938 1517827 : if (flag_debug_asm)
1939 : {
1940 1210 : basic_block bb;
1941 :
1942 1210 : bb_map_size = get_max_uid () + 1;
1943 1210 : start_to_bb = XCNEWVEC (basic_block, bb_map_size);
1944 1210 : end_to_bb = XCNEWVEC (basic_block, bb_map_size);
1945 :
1946 : /* There is no cfg for a thunk. */
1947 1210 : if (!cfun->is_thunk)
1948 3304 : FOR_EACH_BB_REVERSE_FN (bb, cfun)
1949 : {
1950 2100 : start_to_bb[INSN_UID (BB_HEAD (bb))] = bb;
1951 2100 : end_to_bb[INSN_UID (BB_END (bb))] = bb;
1952 : }
1953 : }
1954 :
1955 : /* Output the insns. */
1956 280858183 : for (insn = first; insn;)
1957 : {
1958 279340356 : if (HAVE_ATTR_length)
1959 : {
1960 279340356 : if ((unsigned) INSN_UID (insn) >= INSN_ADDRESSES_SIZE ())
1961 : {
1962 : /* This can be triggered by bugs elsewhere in the compiler if
1963 : new insns are created after init_insn_lengths is called. */
1964 62878084 : gcc_assert (NOTE_P (insn));
1965 62878084 : insn_current_address = -1;
1966 : }
1967 : else
1968 216462272 : insn_current_address = INSN_ADDRESSES (INSN_UID (insn));
1969 : /* final can be seen as an iteration of shorten_branches that
1970 : does nothing (since a fixed point has already been reached). */
1971 279340356 : insn_last_address = insn_current_address;
1972 : }
1973 :
1974 279340356 : dump_basic_block_info (file, insn, start_to_bb, end_to_bb,
1975 : bb_map_size, &bb_seqn);
1976 279340356 : insn = final_scan_insn (insn, file, optimize_p, 0, &seen);
1977 : }
1978 :
1979 1517827 : maybe_output_next_view (&seen);
1980 :
1981 1517827 : if (flag_debug_asm)
1982 : {
1983 1210 : free (start_to_bb);
1984 1210 : free (end_to_bb);
1985 : }
1986 :
1987 : /* Remove CFI notes, to avoid compare-debug failures. */
1988 280858183 : for (insn = first; insn; insn = next)
1989 : {
1990 279340356 : next = NEXT_INSN (insn);
1991 279340356 : if (NOTE_P (insn)
1992 171355551 : && (NOTE_KIND (insn) == NOTE_INSN_CFI
1993 171355551 : || NOTE_KIND (insn) == NOTE_INSN_CFI_LABEL))
1994 12085304 : delete_insn (insn);
1995 : }
1996 1517827 : }
1997 :
1998 : /* This is an exported final_1, callable without SEEN. */
1999 :
2000 : void
2001 1904 : final (rtx_insn *first, FILE *file, int optimize_p)
2002 : {
2003 : /* Those that use the internal final_start_function_1/final_1 API
2004 : skip initial debug bind notes in final_start_function_1, and pass
2005 : the modified FIRST to final_1. But those that use the public
2006 : final_start_function/final APIs, final_start_function can't move
2007 : FIRST because it's not passed by reference, so if they were
2008 : skipped there, skip them again here. */
2009 1904 : while (in_initial_view_p (first))
2010 0 : first = NEXT_INSN (first);
2011 :
2012 1904 : final_1 (first, file, 0, optimize_p);
2013 1904 : }
2014 :
2015 : const char *
2016 94870348 : get_insn_template (int code, rtx_insn *insn)
2017 : {
2018 94870348 : switch (insn_data[code].output_format)
2019 : {
2020 17991425 : case INSN_OUTPUT_FORMAT_SINGLE:
2021 17991425 : return insn_data[code].output.single;
2022 10183903 : case INSN_OUTPUT_FORMAT_MULTI:
2023 10183903 : return insn_data[code].output.multi[which_alternative];
2024 66695020 : case INSN_OUTPUT_FORMAT_FUNCTION:
2025 66695020 : gcc_assert (insn);
2026 66695020 : return (*insn_data[code].output.function) (recog_data.operand, insn);
2027 :
2028 0 : default:
2029 0 : gcc_unreachable ();
2030 : }
2031 : }
2032 :
2033 : /* Emit the appropriate declaration for an alternate-entry-point
2034 : symbol represented by INSN, to FILE. INSN is a CODE_LABEL with
2035 : LABEL_KIND != LABEL_NORMAL.
2036 :
2037 : The case fall-through in this function is intentional. */
2038 : static void
2039 0 : output_alternate_entry_point (FILE *file, rtx_insn *insn)
2040 : {
2041 0 : const char *name = LABEL_NAME (insn);
2042 :
2043 0 : switch (LABEL_KIND (insn))
2044 : {
2045 0 : case LABEL_WEAK_ENTRY:
2046 : #ifdef ASM_WEAKEN_LABEL
2047 0 : ASM_WEAKEN_LABEL (file, name);
2048 0 : gcc_fallthrough ();
2049 : #endif
2050 0 : case LABEL_GLOBAL_ENTRY:
2051 0 : targetm.asm_out.globalize_label (file, name);
2052 0 : gcc_fallthrough ();
2053 0 : case LABEL_STATIC_ENTRY:
2054 : #ifdef ASM_OUTPUT_TYPE_DIRECTIVE
2055 0 : ASM_OUTPUT_TYPE_DIRECTIVE (file, name, "function");
2056 : #endif
2057 0 : ASM_OUTPUT_LABEL (file, name);
2058 0 : break;
2059 :
2060 0 : case LABEL_NORMAL:
2061 0 : default:
2062 0 : gcc_unreachable ();
2063 : }
2064 0 : }
2065 :
2066 : /* Given a CALL_INSN, find and return the nested CALL. */
2067 : static rtx
2068 40051222 : call_from_call_insn (const rtx_call_insn *insn)
2069 : {
2070 40051222 : rtx x;
2071 40051222 : gcc_assert (CALL_P (insn));
2072 40051222 : x = PATTERN (insn);
2073 :
2074 57262560 : while (GET_CODE (x) != CALL)
2075 : {
2076 17211338 : switch (GET_CODE (x))
2077 : {
2078 0 : default:
2079 0 : gcc_unreachable ();
2080 0 : case COND_EXEC:
2081 0 : x = COND_EXEC_CODE (x);
2082 0 : break;
2083 1694239 : case PARALLEL:
2084 1694239 : x = XVECEXP (x, 0, 0);
2085 1694239 : break;
2086 15517099 : case SET:
2087 15517099 : x = XEXP (x, 1);
2088 15517099 : break;
2089 : }
2090 : }
2091 40051222 : return x;
2092 : }
2093 :
2094 : /* Return the CALL in X if there is one. */
2095 :
2096 : rtx
2097 33707186 : get_call_rtx_from (const rtx_insn *insn)
2098 : {
2099 33707186 : const rtx_call_insn *call_insn = as_a<const rtx_call_insn *> (insn);
2100 33707186 : return call_from_call_insn (call_insn);
2101 : }
2102 :
2103 : /* Print a comment into the asm showing FILENAME, LINENUM, and the
2104 : corresponding source line, if available. */
2105 :
2106 : static void
2107 32 : asm_show_source (const char *filename, int linenum)
2108 : {
2109 32 : if (!filename)
2110 0 : return;
2111 :
2112 32 : diagnostics::char_span line
2113 32 : = global_dc->get_file_cache ().get_source_line (filename, linenum);
2114 32 : if (!line)
2115 : return;
2116 :
2117 32 : fprintf (asm_out_file, "%s %s:%i: ", ASM_COMMENT_START, filename, linenum);
2118 : /* "line" is not 0-terminated, so we must use its length. */
2119 32 : fwrite (line.get_buffer (), 1, line.length (), asm_out_file);
2120 32 : fputc ('\n', asm_out_file);
2121 : }
2122 :
2123 : /* Judge if an absolute jump table is relocatable. */
2124 :
2125 : bool
2126 14538 : jumptable_relocatable (void)
2127 : {
2128 14538 : bool relocatable = false;
2129 :
2130 14538 : if (!CASE_VECTOR_PC_RELATIVE
2131 14538 : && !targetm.asm_out.generate_pic_addr_diff_vec ()
2132 14538 : && targetm_common.have_named_sections)
2133 12184 : relocatable = targetm.asm_out.reloc_rw_mask ();
2134 :
2135 14538 : return relocatable;
2136 : }
2137 :
2138 : /* The final scan for one insn, INSN.
2139 : Args are same as in `final', except that INSN
2140 : is the insn being scanned.
2141 : Value returned is the next insn to be scanned.
2142 :
2143 : NOPEEPHOLES is the flag to disallow peephole processing (currently
2144 : used for within delayed branch sequence output).
2145 :
2146 : SEEN is used to track the end of the prologue, for emitting
2147 : debug information. We force the emission of a line note after
2148 : both NOTE_INSN_PROLOGUE_END and NOTE_INSN_FUNCTION_BEG. */
2149 :
2150 : static rtx_insn *
2151 280819010 : final_scan_insn_1 (rtx_insn *insn, FILE *file, int optimize_p ATTRIBUTE_UNUSED,
2152 : int nopeepholes ATTRIBUTE_UNUSED, int *seen)
2153 : {
2154 280819010 : rtx_insn *next;
2155 280819010 : rtx_jump_table_data *table;
2156 :
2157 280819010 : insn_counter++;
2158 :
2159 : /* Ignore deleted insns. These can occur when we split insns (due to a
2160 : template of "#") while not optimizing. */
2161 280819010 : if (insn->deleted ())
2162 0 : return NEXT_INSN (insn);
2163 :
2164 280819010 : switch (GET_CODE (insn))
2165 : {
2166 172834205 : case NOTE:
2167 172834205 : switch (NOTE_KIND (insn))
2168 : {
2169 : case NOTE_INSN_DELETED:
2170 : case NOTE_INSN_UPDATE_SJLJ_CONTEXT:
2171 : break;
2172 :
2173 66541 : case NOTE_INSN_SWITCH_TEXT_SECTIONS:
2174 66541 : maybe_output_next_view (seen);
2175 :
2176 66541 : output_function_exception_table (0);
2177 :
2178 66541 : if (targetm.asm_out.unwind_emit)
2179 0 : targetm.asm_out.unwind_emit (asm_out_file, insn);
2180 :
2181 66541 : in_cold_section_p = !in_cold_section_p;
2182 :
2183 66541 : gcc_checking_assert (in_cold_section_p);
2184 66541 : if (in_cold_section_p)
2185 66541 : cold_function_name
2186 66541 : = clone_function_name (current_function_decl, "cold");
2187 :
2188 66541 : if (dwarf2out_do_frame ())
2189 : {
2190 66539 : dwarf2out_switch_text_section ();
2191 66539 : if (!dwarf2_debug_info_emitted_p (current_function_decl)
2192 66539 : && !DECL_IGNORED_P (current_function_decl))
2193 43414 : debug_hooks->switch_text_section ();
2194 : }
2195 2 : else if (!DECL_IGNORED_P (current_function_decl))
2196 1 : debug_hooks->switch_text_section ();
2197 66573 : if (DECL_IGNORED_P (current_function_decl) && last_linenum
2198 66573 : && last_filename)
2199 32 : debug_hooks->set_ignored_loc (last_linenum, last_columnnum,
2200 : last_filename);
2201 :
2202 66541 : switch_to_section (current_function_section ());
2203 66541 : targetm.asm_out.function_switched_text_sections (asm_out_file,
2204 : current_function_decl,
2205 : in_cold_section_p);
2206 : /* Emit a label for the split cold section. Form label name by
2207 : suffixing "cold" to the original function's name. */
2208 66541 : if (in_cold_section_p)
2209 : {
2210 : #ifdef ASM_DECLARE_COLD_FUNCTION_NAME
2211 66541 : ASM_DECLARE_COLD_FUNCTION_NAME (asm_out_file,
2212 : IDENTIFIER_POINTER
2213 : (cold_function_name),
2214 : current_function_decl);
2215 : #else
2216 : ASM_OUTPUT_LABEL (asm_out_file,
2217 : IDENTIFIER_POINTER (cold_function_name));
2218 : #endif
2219 66541 : if (dwarf2out_do_frame ()
2220 66541 : && cfun->fde->dw_fde_second_begin != NULL)
2221 66539 : ASM_OUTPUT_LABEL (asm_out_file, cfun->fde->dw_fde_second_begin);
2222 : }
2223 : break;
2224 :
2225 14631886 : case NOTE_INSN_BASIC_BLOCK:
2226 14631886 : if (need_profile_function)
2227 : {
2228 303 : profile_function (asm_out_file);
2229 303 : need_profile_function = false;
2230 : }
2231 :
2232 14631886 : if (targetm.asm_out.unwind_emit)
2233 0 : targetm.asm_out.unwind_emit (asm_out_file, insn);
2234 :
2235 : break;
2236 :
2237 443213 : case NOTE_INSN_EH_REGION_BEG:
2238 443213 : ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHB",
2239 : NOTE_EH_HANDLER (insn));
2240 443213 : break;
2241 :
2242 443213 : case NOTE_INSN_EH_REGION_END:
2243 443213 : ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHE",
2244 : NOTE_EH_HANDLER (insn));
2245 443213 : break;
2246 :
2247 1517827 : case NOTE_INSN_PROLOGUE_END:
2248 1517827 : targetm.asm_out.function_end_prologue (file);
2249 1517827 : profile_after_prologue (file);
2250 :
2251 1517827 : if ((*seen & (SEEN_EMITTED | SEEN_NOTE)) == SEEN_NOTE)
2252 : {
2253 641318 : *seen |= SEEN_EMITTED;
2254 641318 : force_source_line = true;
2255 : }
2256 : else
2257 876509 : *seen |= SEEN_NOTE;
2258 :
2259 : break;
2260 :
2261 1616874 : case NOTE_INSN_EPILOGUE_BEG:
2262 1616874 : if (!DECL_IGNORED_P (current_function_decl))
2263 1611741 : (*debug_hooks->begin_epilogue) (last_linenum, last_filename);
2264 1616874 : targetm.asm_out.function_begin_epilogue (file);
2265 1616874 : break;
2266 :
2267 12079560 : case NOTE_INSN_CFI:
2268 12079560 : dwarf2out_emit_cfi (NOTE_CFI (insn));
2269 12079560 : break;
2270 :
2271 5744 : case NOTE_INSN_CFI_LABEL:
2272 5744 : ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LCFI",
2273 : NOTE_LABEL_NUMBER (insn));
2274 5744 : break;
2275 :
2276 1515923 : case NOTE_INSN_FUNCTION_BEG:
2277 1515923 : if (need_profile_function)
2278 : {
2279 0 : profile_function (asm_out_file);
2280 0 : need_profile_function = false;
2281 : }
2282 :
2283 1515923 : app_disable ();
2284 1515923 : if (!DECL_IGNORED_P (current_function_decl))
2285 1509171 : debug_hooks->end_prologue (last_linenum, last_filename);
2286 :
2287 1515923 : if ((*seen & (SEEN_EMITTED | SEEN_NOTE)) == SEEN_NOTE)
2288 : {
2289 874605 : *seen |= SEEN_EMITTED;
2290 874605 : force_source_line = true;
2291 : }
2292 : else
2293 641318 : *seen |= SEEN_NOTE;
2294 :
2295 : break;
2296 :
2297 25396388 : case NOTE_INSN_BLOCK_BEG:
2298 25396388 : if (debug_info_level >= DINFO_LEVEL_NORMAL
2299 30779 : || dwarf_debuginfo_p ()
2300 25396388 : || write_symbols == VMS_DEBUG)
2301 : {
2302 25396388 : int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
2303 :
2304 25396388 : app_disable ();
2305 25396388 : ++block_depth;
2306 25396388 : high_block_linenum = last_linenum;
2307 :
2308 : /* Output debugging info about the symbol-block beginning. */
2309 25396388 : if (!DECL_IGNORED_P (current_function_decl))
2310 25396388 : debug_hooks->begin_block (last_linenum, n, NOTE_BLOCK (insn));
2311 :
2312 : /* Mark this block as output. */
2313 25396388 : TREE_ASM_WRITTEN (NOTE_BLOCK (insn)) = 1;
2314 25396388 : BLOCK_IN_COLD_SECTION_P (NOTE_BLOCK (insn)) = in_cold_section_p;
2315 : }
2316 : break;
2317 :
2318 25396388 : case NOTE_INSN_BLOCK_END:
2319 25396388 : maybe_output_next_view (seen);
2320 :
2321 25396388 : if (debug_info_level >= DINFO_LEVEL_NORMAL
2322 30779 : || dwarf_debuginfo_p ()
2323 25396388 : || write_symbols == VMS_DEBUG)
2324 : {
2325 25396388 : int n = BLOCK_NUMBER (NOTE_BLOCK (insn));
2326 :
2327 25396388 : app_disable ();
2328 :
2329 : /* End of a symbol-block. */
2330 25396388 : --block_depth;
2331 25396388 : gcc_assert (block_depth >= 0);
2332 :
2333 25396388 : if (!DECL_IGNORED_P (current_function_decl))
2334 25396388 : debug_hooks->end_block (high_block_linenum, n);
2335 25396388 : gcc_assert (BLOCK_IN_COLD_SECTION_P (NOTE_BLOCK (insn))
2336 : == in_cold_section_p);
2337 : }
2338 : break;
2339 :
2340 55092 : case NOTE_INSN_DELETED_LABEL:
2341 : /* Emit the label. We may have deleted the CODE_LABEL because
2342 : the label could be proved to be unreachable, though still
2343 : referenced (in the form of having its address taken. */
2344 55092 : ASM_OUTPUT_DEBUG_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2345 55092 : break;
2346 :
2347 8761 : case NOTE_INSN_DELETED_DEBUG_LABEL:
2348 : /* Similarly, but need to use different namespace for it. */
2349 8761 : if (CODE_LABEL_NUMBER (insn) != -1)
2350 8761 : ASM_OUTPUT_DEBUG_LABEL (file, "LDL", CODE_LABEL_NUMBER (insn));
2351 : break;
2352 :
2353 68653366 : case NOTE_INSN_VAR_LOCATION:
2354 68653366 : if (!DECL_IGNORED_P (current_function_decl))
2355 : {
2356 68637020 : debug_hooks->var_location (insn);
2357 68637020 : set_next_view_needed (seen);
2358 : }
2359 : break;
2360 :
2361 4236445 : case NOTE_INSN_BEGIN_STMT:
2362 4236445 : gcc_checking_assert (cfun->debug_nonbind_markers);
2363 4236445 : if (!DECL_IGNORED_P (current_function_decl)
2364 4236445 : && notice_source_line (insn, NULL))
2365 : {
2366 12023432 : output_source_line:
2367 12023432 : (*debug_hooks->source_line) (last_linenum, last_columnnum,
2368 : last_filename, last_discriminator,
2369 : true);
2370 12023432 : clear_next_view_needed (seen);
2371 : }
2372 : break;
2373 :
2374 7787004 : case NOTE_INSN_INLINE_ENTRY:
2375 7787004 : gcc_checking_assert (cfun->debug_nonbind_markers);
2376 7787004 : if (!DECL_IGNORED_P (current_function_decl)
2377 7787004 : && notice_source_line (insn, NULL))
2378 : {
2379 7786987 : (*debug_hooks->inline_entry) (LOCATION_BLOCK
2380 : (NOTE_MARKER_LOCATION (insn)));
2381 7786987 : goto output_source_line;
2382 : }
2383 : break;
2384 :
2385 0 : default:
2386 0 : gcc_unreachable ();
2387 : break;
2388 : }
2389 : break;
2390 :
2391 : case BARRIER:
2392 : break;
2393 :
2394 7056039 : case CODE_LABEL:
2395 : /* The target port might emit labels in the output function for
2396 : some insn, e.g. sh.cc output_branchy_insn. */
2397 7056039 : if (CODE_LABEL_NUMBER (insn) <= max_labelno)
2398 : {
2399 7056037 : align_flags alignment = LABEL_TO_ALIGNMENT (insn);
2400 8411157 : if (alignment.levels[0].log && NEXT_INSN (insn))
2401 : {
2402 : #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
2403 : /* Output both primary and secondary alignment. */
2404 1355120 : ASM_OUTPUT_MAX_SKIP_ALIGN (file, alignment.levels[0].log,
2405 : alignment.levels[0].maxskip);
2406 1355120 : ASM_OUTPUT_MAX_SKIP_ALIGN (file, alignment.levels[1].log,
2407 : alignment.levels[1].maxskip);
2408 : #else
2409 : #ifdef ASM_OUTPUT_ALIGN_WITH_NOP
2410 : ASM_OUTPUT_ALIGN_WITH_NOP (file, alignment.levels[0].log);
2411 : #else
2412 : ASM_OUTPUT_ALIGN (file, alignment.levels[0].log);
2413 : #endif
2414 : #endif
2415 : }
2416 : }
2417 7056039 : CC_STATUS_INIT;
2418 :
2419 7056039 : if (!DECL_IGNORED_P (current_function_decl) && LABEL_NAME (insn))
2420 63948 : debug_hooks->label (as_a <rtx_code_label *> (insn));
2421 :
2422 7056039 : app_disable ();
2423 :
2424 : /* If this label is followed by a jump-table, make sure we put
2425 : the label in the read-only section. Also possibly write the
2426 : label and jump table together. */
2427 7056039 : table = jump_table_for_label (as_a <rtx_code_label *> (insn));
2428 7056039 : if (table)
2429 : {
2430 : #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2431 : /* In this case, the case vector is being moved by the
2432 : target, so don't output the label at all. Leave that
2433 : to the back end macros. */
2434 : #else
2435 7269 : if (! JUMP_TABLES_IN_TEXT_SECTION)
2436 : {
2437 7269 : int log_align;
2438 :
2439 7269 : switch_to_section (targetm.asm_out.function_rodata_section
2440 : (current_function_decl,
2441 : jumptable_relocatable ()));
2442 :
2443 : #ifdef ADDR_VEC_ALIGN
2444 7269 : log_align = ADDR_VEC_ALIGN (table);
2445 : #else
2446 : log_align = exact_log2 (BIGGEST_ALIGNMENT / BITS_PER_UNIT);
2447 : #endif
2448 7269 : ASM_OUTPUT_ALIGN (file, log_align);
2449 : }
2450 : else
2451 : switch_to_section (current_function_section ());
2452 :
2453 : #ifdef ASM_OUTPUT_CASE_LABEL
2454 7269 : ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn), table);
2455 : #else
2456 : targetm.asm_out.internal_label (file, "L", CODE_LABEL_NUMBER (insn));
2457 : #endif
2458 : #endif
2459 7269 : break;
2460 : }
2461 7048770 : if (LABEL_ALT_ENTRY_P (insn))
2462 0 : output_alternate_entry_point (file, insn);
2463 : else
2464 7048770 : targetm.asm_out.internal_label (file, "L", CODE_LABEL_NUMBER (insn));
2465 : break;
2466 :
2467 96039795 : default:
2468 96039795 : {
2469 96039795 : rtx body = PATTERN (insn);
2470 96039795 : int insn_code_number;
2471 96039795 : const char *templ;
2472 96039795 : bool is_stmt, *is_stmt_p;
2473 :
2474 96039795 : if (MAY_HAVE_DEBUG_MARKER_INSNS && cfun->debug_nonbind_markers)
2475 : {
2476 22581619 : is_stmt = false;
2477 22581619 : is_stmt_p = NULL;
2478 : }
2479 : else
2480 : is_stmt_p = &is_stmt;
2481 :
2482 : /* Reset this early so it is correct for ASM statements. */
2483 96039795 : current_insn_predicate = NULL_RTX;
2484 :
2485 : /* An INSN, JUMP_INSN or CALL_INSN.
2486 : First check for special kinds that recog doesn't recognize. */
2487 :
2488 96039795 : if (GET_CODE (body) == USE /* These are just declarations. */
2489 96039795 : || GET_CODE (body) == CLOBBER)
2490 : break;
2491 :
2492 : /* Detect insns that are really jump-tables
2493 : and output them as such. */
2494 :
2495 94973522 : if (JUMP_TABLE_DATA_P (insn))
2496 : {
2497 : #if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
2498 7269 : int vlen, idx;
2499 : #endif
2500 :
2501 7269 : if (! JUMP_TABLES_IN_TEXT_SECTION)
2502 7269 : switch_to_section (targetm.asm_out.function_rodata_section
2503 : (current_function_decl,
2504 : jumptable_relocatable ()));
2505 : else
2506 : switch_to_section (current_function_section ());
2507 :
2508 7269 : app_disable ();
2509 :
2510 : #if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
2511 : if (GET_CODE (body) == ADDR_VEC)
2512 : {
2513 : #ifdef ASM_OUTPUT_ADDR_VEC
2514 : ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2515 : #else
2516 : gcc_unreachable ();
2517 : #endif
2518 : }
2519 : else
2520 : {
2521 : #ifdef ASM_OUTPUT_ADDR_DIFF_VEC
2522 : ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2523 : #else
2524 : gcc_unreachable ();
2525 : #endif
2526 : }
2527 : #else
2528 7269 : vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC);
2529 174959 : for (idx = 0; idx < vlen; idx++)
2530 : {
2531 167690 : if (GET_CODE (body) == ADDR_VEC)
2532 : {
2533 : #ifdef ASM_OUTPUT_ADDR_VEC_ELT
2534 140219 : ASM_OUTPUT_ADDR_VEC_ELT
2535 : (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)));
2536 : #else
2537 : gcc_unreachable ();
2538 : #endif
2539 : }
2540 : else
2541 : {
2542 : #ifdef ASM_OUTPUT_ADDR_DIFF_ELT
2543 27471 : ASM_OUTPUT_ADDR_DIFF_ELT
2544 : (file,
2545 : body,
2546 : CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),
2547 : CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)));
2548 : #else
2549 : gcc_unreachable ();
2550 : #endif
2551 : }
2552 : }
2553 : #ifdef ASM_OUTPUT_CASE_END
2554 : ASM_OUTPUT_CASE_END (file,
2555 : CODE_LABEL_NUMBER (PREV_INSN (insn)),
2556 : insn);
2557 : #endif
2558 : #endif
2559 :
2560 7269 : switch_to_section (current_function_section ());
2561 :
2562 7269 : if (debug_variable_location_views
2563 7269 : && !DECL_IGNORED_P (current_function_decl))
2564 6268 : debug_hooks->var_location (insn);
2565 :
2566 : break;
2567 : }
2568 : /* Output this line note if it is the first or the last line
2569 : note in a row. */
2570 94966253 : if (!DECL_IGNORED_P (current_function_decl)
2571 94966253 : && notice_source_line (insn, is_stmt_p))
2572 : {
2573 28365188 : if (flag_verbose_asm)
2574 32 : asm_show_source (last_filename, last_linenum);
2575 28365188 : (*debug_hooks->source_line) (last_linenum, last_columnnum,
2576 : last_filename, last_discriminator,
2577 : is_stmt);
2578 28365188 : clear_next_view_needed (seen);
2579 : }
2580 : else
2581 66601065 : maybe_output_next_view (seen);
2582 :
2583 94966253 : gcc_checking_assert (!DEBUG_INSN_P (insn));
2584 :
2585 94966253 : if (GET_CODE (body) == PARALLEL
2586 11809376 : && GET_CODE (XVECEXP (body, 0, 0)) == ASM_INPUT)
2587 94966253 : body = XVECEXP (body, 0, 0);
2588 :
2589 94966253 : if (GET_CODE (body) == ASM_INPUT)
2590 : {
2591 3082 : const char *string = XSTR (body, 0);
2592 :
2593 : /* There's no telling what that did to the condition codes. */
2594 3082 : CC_STATUS_INIT;
2595 :
2596 3082 : if (string[0])
2597 : {
2598 805 : expanded_location loc;
2599 :
2600 805 : app_enable ();
2601 805 : loc = expand_location (ASM_INPUT_SOURCE_LOCATION (body));
2602 805 : if (*loc.file && loc.line)
2603 805 : fprintf (asm_out_file, "%s %i \"%s\" 1\n",
2604 : ASM_COMMENT_START, loc.line, loc.file);
2605 805 : fprintf (asm_out_file, "\t%s\n", string);
2606 : #if HAVE_AS_LINE_ZERO
2607 805 : if (*loc.file && loc.line)
2608 805 : fprintf (asm_out_file, "%s 0 \"\" 2\n", ASM_COMMENT_START);
2609 : #endif
2610 : }
2611 : break;
2612 : }
2613 :
2614 : /* Detect `asm' construct with operands. */
2615 94963171 : if (asm_noperands (body) >= 0)
2616 : {
2617 92882 : unsigned int noperands = asm_noperands (body);
2618 92882 : rtx *ops = XALLOCAVEC (rtx, noperands);
2619 92882 : const char *string;
2620 92882 : location_t loc;
2621 92882 : expanded_location expanded;
2622 :
2623 : /* There's no telling what that did to the condition codes. */
2624 92882 : CC_STATUS_INIT;
2625 :
2626 : /* Get out the operand values. */
2627 92882 : string = decode_asm_operands (body, ops, NULL, NULL, NULL, &loc);
2628 : /* Inhibit dying on what would otherwise be compiler bugs. */
2629 92882 : insn_noperands = noperands;
2630 92882 : this_is_asm_operands = insn;
2631 92882 : expanded = expand_location (loc);
2632 :
2633 : #ifdef FINAL_PRESCAN_INSN
2634 : FINAL_PRESCAN_INSN (insn, ops, insn_noperands);
2635 : #endif
2636 :
2637 : /* Output the insn using them. */
2638 92882 : if (string[0])
2639 : {
2640 20285 : app_enable ();
2641 20285 : if (expanded.file && expanded.line)
2642 20225 : fprintf (asm_out_file, "%s %i \"%s\" 1\n",
2643 : ASM_COMMENT_START, expanded.line, expanded.file);
2644 20285 : output_asm_insn (string, ops);
2645 : #if HAVE_AS_LINE_ZERO
2646 20285 : if (expanded.file && expanded.line)
2647 20225 : fprintf (asm_out_file, "%s 0 \"\" 2\n", ASM_COMMENT_START);
2648 : #endif
2649 : }
2650 :
2651 92882 : if (targetm.asm_out.final_postscan_insn)
2652 0 : targetm.asm_out.final_postscan_insn (file, insn, ops,
2653 : insn_noperands);
2654 :
2655 92882 : this_is_asm_operands = 0;
2656 92882 : break;
2657 : }
2658 :
2659 94870289 : app_disable ();
2660 :
2661 94870289 : if (rtx_sequence *seq = dyn_cast <rtx_sequence *> (body))
2662 : {
2663 : /* A delayed-branch sequence */
2664 0 : int i;
2665 :
2666 0 : final_sequence = seq;
2667 :
2668 : /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2669 : force the restoration of a comparison that was previously
2670 : thought unnecessary. If that happens, cancel this sequence
2671 : and cause that insn to be restored. */
2672 :
2673 0 : next = final_scan_insn (seq->insn (0), file, 0, 1, seen);
2674 0 : if (next != seq->insn (1))
2675 : {
2676 0 : final_sequence = 0;
2677 0 : return next;
2678 : }
2679 :
2680 0 : for (i = 1; i < seq->len (); i++)
2681 : {
2682 0 : rtx_insn *insn = seq->insn (i);
2683 0 : rtx_insn *next = NEXT_INSN (insn);
2684 : /* We loop in case any instruction in a delay slot gets
2685 : split. */
2686 0 : do
2687 0 : insn = final_scan_insn (insn, file, 0, 1, seen);
2688 0 : while (insn != next);
2689 : }
2690 : #ifdef DBR_OUTPUT_SEQEND
2691 : DBR_OUTPUT_SEQEND (file);
2692 : #endif
2693 0 : final_sequence = 0;
2694 :
2695 : /* If the insn requiring the delay slot was a CALL_INSN, the
2696 : insns in the delay slot are actually executed before the
2697 : called function. Hence we don't preserve any CC-setting
2698 : actions in these insns and the CC must be marked as being
2699 : clobbered by the function. */
2700 0 : if (CALL_P (seq->insn (0)))
2701 : {
2702 0 : CC_STATUS_INIT;
2703 : }
2704 0 : break;
2705 : }
2706 :
2707 : /* We have a real machine instruction as rtl. */
2708 :
2709 94870289 : body = PATTERN (insn);
2710 :
2711 : /* Do machine-specific peephole optimizations if desired. */
2712 :
2713 94870289 : if (HAVE_peephole && optimize_p && !flag_no_peephole && !nopeepholes)
2714 : {
2715 : rtx_insn *next = peephole (insn);
2716 : /* When peepholing, if there were notes within the peephole,
2717 : emit them before the peephole. */
2718 : if (next != 0 && next != NEXT_INSN (insn))
2719 : {
2720 : rtx_insn *note, *prev = PREV_INSN (insn);
2721 :
2722 : for (note = NEXT_INSN (insn); note != next;
2723 : note = NEXT_INSN (note))
2724 : final_scan_insn (note, file, optimize_p, nopeepholes, seen);
2725 :
2726 : /* Put the notes in the proper position for a later
2727 : rescan. For example, the SH target can do this
2728 : when generating a far jump in a delayed branch
2729 : sequence. */
2730 : note = NEXT_INSN (insn);
2731 : SET_PREV_INSN (note) = prev;
2732 : SET_NEXT_INSN (prev) = note;
2733 : SET_NEXT_INSN (PREV_INSN (next)) = insn;
2734 : SET_PREV_INSN (insn) = PREV_INSN (next);
2735 : SET_NEXT_INSN (insn) = next;
2736 : SET_PREV_INSN (next) = insn;
2737 : }
2738 :
2739 : /* PEEPHOLE might have changed this. */
2740 : body = PATTERN (insn);
2741 : }
2742 :
2743 : /* Try to recognize the instruction.
2744 : If successful, verify that the operands satisfy the
2745 : constraints for the instruction. Crash if they don't,
2746 : since `reload' should have changed them so that they do. */
2747 :
2748 94870289 : insn_code_number = recog_memoized (insn);
2749 94870289 : cleanup_subreg_operands (insn);
2750 :
2751 : /* Dump the insn in the assembly for debugging (-dAP).
2752 : If the final dump is requested as slim RTL, dump slim
2753 : RTL to the assembly file also. */
2754 94870289 : if (flag_dump_rtl_in_asm)
2755 : {
2756 29 : print_rtx_head = ASM_COMMENT_START;
2757 29 : if (! (dump_flags & TDF_SLIM))
2758 29 : print_rtl_single (asm_out_file, insn);
2759 : else
2760 0 : dump_insn_slim (asm_out_file, insn);
2761 29 : print_rtx_head = "";
2762 : }
2763 :
2764 94870289 : if (! constrain_operands_cached (insn, 1))
2765 0 : fatal_insn_not_found (insn);
2766 :
2767 : /* Some target machines need to prescan each insn before
2768 : it is output. */
2769 :
2770 : #ifdef FINAL_PRESCAN_INSN
2771 : FINAL_PRESCAN_INSN (insn, recog_data.operand, recog_data.n_operands);
2772 : #endif
2773 :
2774 94870289 : if (targetm.have_conditional_execution ()
2775 94870289 : && GET_CODE (PATTERN (insn)) == COND_EXEC)
2776 0 : current_insn_predicate = COND_EXEC_TEST (PATTERN (insn));
2777 :
2778 94870289 : current_output_insn = debug_insn = insn;
2779 :
2780 : /* Find the proper template for this insn. */
2781 94870289 : templ = get_insn_template (insn_code_number, insn);
2782 :
2783 : /* If the C code returns 0, it means that it is a jump insn
2784 : which follows a deleted test insn, and that test insn
2785 : needs to be reinserted. */
2786 94870289 : if (templ == 0)
2787 : {
2788 0 : rtx_insn *prev;
2789 :
2790 0 : gcc_assert (prev_nonnote_insn (insn) == last_ignored_compare);
2791 :
2792 : /* We have already processed the notes between the setter and
2793 : the user. Make sure we don't process them again, this is
2794 : particularly important if one of the notes is a block
2795 : scope note or an EH note. */
2796 0 : for (prev = insn;
2797 0 : prev != last_ignored_compare;
2798 0 : prev = PREV_INSN (prev))
2799 : {
2800 0 : if (NOTE_P (prev))
2801 0 : delete_insn (prev); /* Use delete_note. */
2802 : }
2803 :
2804 : return prev;
2805 : }
2806 :
2807 : /* If the template is the string "#", it means that this insn must
2808 : be split. */
2809 94870289 : if (templ[0] == '#' && templ[1] == '\0')
2810 : {
2811 0 : rtx_insn *new_rtx = try_split (body, insn, 0);
2812 :
2813 : /* If we didn't split the insn, go away. */
2814 0 : if (new_rtx == insn && PATTERN (new_rtx) == body)
2815 0 : fatal_insn ("could not split insn", insn);
2816 :
2817 : /* If we have a length attribute, this instruction should have
2818 : been split in shorten_branches, to ensure that we would have
2819 : valid length info for the splitees. */
2820 0 : gcc_assert (!HAVE_ATTR_length);
2821 :
2822 : return new_rtx;
2823 : }
2824 :
2825 : /* ??? This will put the directives in the wrong place if
2826 : get_insn_template outputs assembly directly. However calling it
2827 : before get_insn_template breaks if the insns is split. */
2828 94870289 : if (targetm.asm_out.unwind_emit_before_insn
2829 94870289 : && targetm.asm_out.unwind_emit)
2830 0 : targetm.asm_out.unwind_emit (asm_out_file, insn);
2831 :
2832 94870289 : rtx_call_insn *call_insn = dyn_cast <rtx_call_insn *> (insn);
2833 6344036 : if (call_insn != NULL)
2834 : {
2835 6344036 : rtx x = call_from_call_insn (call_insn);
2836 6344036 : x = XEXP (x, 0);
2837 6344036 : if (x && MEM_P (x) && GET_CODE (XEXP (x, 0)) == SYMBOL_REF)
2838 : {
2839 6137261 : tree t;
2840 6137261 : x = XEXP (x, 0);
2841 6137261 : t = SYMBOL_REF_DECL (x);
2842 6137261 : if (t)
2843 5875514 : assemble_external (t);
2844 : }
2845 : }
2846 :
2847 : /* Output assembler code from the template. */
2848 94870289 : output_asm_insn (templ, recog_data.operand);
2849 :
2850 : /* Some target machines need to postscan each insn after
2851 : it is output. */
2852 94870289 : if (targetm.asm_out.final_postscan_insn)
2853 0 : targetm.asm_out.final_postscan_insn (file, insn, recog_data.operand,
2854 0 : recog_data.n_operands);
2855 :
2856 94870289 : if (!targetm.asm_out.unwind_emit_before_insn
2857 0 : && targetm.asm_out.unwind_emit)
2858 0 : targetm.asm_out.unwind_emit (asm_out_file, insn);
2859 :
2860 : /* Let the debug info back-end know about this call. We do this only
2861 : after the instruction has been emitted because labels that may be
2862 : created to reference the call instruction must appear after it. */
2863 51610865 : if ((debug_variable_location_views || call_insn != NULL)
2864 97854070 : && !DECL_IGNORED_P (current_function_decl))
2865 46212006 : debug_hooks->var_location (insn);
2866 :
2867 94870289 : current_output_insn = debug_insn = 0;
2868 : }
2869 : }
2870 280819010 : return NEXT_INSN (insn);
2871 : }
2872 :
2873 : /* This is a wrapper around final_scan_insn_1 that allows ports to
2874 : call it recursively without a known value for SEEN. The value is
2875 : saved at the outermost call, and recovered for recursive calls.
2876 : Recursive calls MUST pass NULL, or the same pointer if they can
2877 : otherwise get to it. */
2878 :
2879 : rtx_insn *
2880 280819010 : final_scan_insn (rtx_insn *insn, FILE *file, int optimize_p,
2881 : int nopeepholes, int *seen)
2882 : {
2883 280819010 : static int *enclosing_seen;
2884 280819010 : static int recursion_counter;
2885 :
2886 280819010 : gcc_assert (seen || recursion_counter);
2887 280819010 : gcc_assert (!recursion_counter || !seen || seen == enclosing_seen);
2888 :
2889 280819010 : if (!recursion_counter++)
2890 280819010 : enclosing_seen = seen;
2891 0 : else if (!seen)
2892 0 : seen = enclosing_seen;
2893 :
2894 280819010 : rtx_insn *ret = final_scan_insn_1 (insn, file, optimize_p, nopeepholes, seen);
2895 :
2896 280819010 : if (!--recursion_counter)
2897 280819010 : enclosing_seen = NULL;
2898 :
2899 280819010 : return ret;
2900 : }
2901 :
2902 :
2903 :
2904 : /* Map DECLs to instance discriminators. This is allocated and
2905 : defined in ada/gcc-interfaces/trans.cc, when compiling with -gnateS.
2906 : Mappings from this table are saved and restored for LTO, so
2907 : link-time compilation will have this map set, at least in
2908 : partitions containing at least one DECL with an associated instance
2909 : discriminator. */
2910 :
2911 : decl_to_instance_map_t *decl_to_instance_map;
2912 :
2913 : /* Return the instance number assigned to DECL. */
2914 :
2915 : static inline int
2916 0 : map_decl_to_instance (const_tree decl)
2917 : {
2918 0 : int *inst;
2919 :
2920 0 : if (!decl_to_instance_map || !decl || !DECL_P (decl))
2921 : return 0;
2922 :
2923 0 : inst = decl_to_instance_map->get (decl);
2924 :
2925 0 : if (!inst)
2926 : return 0;
2927 :
2928 0 : return *inst;
2929 : }
2930 :
2931 : /* Set DISCRIMINATOR to the appropriate value, possibly derived from LOC. */
2932 :
2933 : static inline int
2934 97982074 : compute_discriminator (location_t loc)
2935 : {
2936 97982074 : int discriminator;
2937 :
2938 97982074 : if (!decl_to_instance_map)
2939 97982074 : discriminator = get_discriminator_from_loc (loc);
2940 : else
2941 : {
2942 0 : tree block = LOCATION_BLOCK (loc);
2943 :
2944 0 : while (block && TREE_CODE (block) == BLOCK
2945 0 : && !inlined_function_outer_scope_p (block))
2946 0 : block = BLOCK_SUPERCONTEXT (block);
2947 :
2948 0 : tree decl;
2949 :
2950 0 : if (!block)
2951 0 : decl = current_function_decl;
2952 0 : else if (DECL_P (block))
2953 : decl = block;
2954 : else
2955 0 : decl = block_ultimate_origin (block);
2956 :
2957 0 : discriminator = map_decl_to_instance (decl);
2958 : }
2959 :
2960 97982074 : return discriminator;
2961 : }
2962 :
2963 : /* Return discriminator of the statement that produced this insn. */
2964 : int
2965 85958642 : insn_discriminator (const rtx_insn *insn)
2966 : {
2967 85958642 : return compute_discriminator (INSN_LOCATION (insn));
2968 : }
2969 :
2970 : /* Return whether a source line note needs to be emitted before INSN.
2971 : Sets IS_STMT to TRUE if the line should be marked as a possible
2972 : breakpoint location. */
2973 :
2974 : static bool
2975 106939736 : notice_source_line (rtx_insn *insn, bool *is_stmt)
2976 : {
2977 106939736 : const char *filename;
2978 106939736 : int linenum, columnnum;
2979 106939736 : int discriminator;
2980 :
2981 106939736 : if (NOTE_MARKER_P (insn))
2982 : {
2983 12023449 : location_t loc = NOTE_MARKER_LOCATION (insn);
2984 12023449 : expanded_location xloc = expand_location (loc);
2985 12023449 : if (xloc.line == 0
2986 12023449 : && (LOCATION_LOCUS (loc) == UNKNOWN_LOCATION
2987 27 : || LOCATION_LOCUS (loc) == BUILTINS_LOCATION))
2988 17 : return false;
2989 :
2990 12023432 : filename = xloc.file;
2991 12023432 : linenum = xloc.line;
2992 12023432 : columnnum = xloc.column;
2993 12023432 : discriminator = compute_discriminator (loc);
2994 12023432 : force_source_line = true;
2995 12023432 : }
2996 94916287 : else if (INSN_HAS_LOCATION (insn))
2997 : {
2998 85872037 : expanded_location xloc = insn_location (insn);
2999 85872037 : filename = xloc.file;
3000 85872037 : linenum = xloc.line;
3001 85872037 : columnnum = xloc.column;
3002 85872037 : discriminator = insn_discriminator (insn);
3003 : }
3004 : else
3005 : {
3006 : filename = NULL;
3007 : linenum = 0;
3008 : columnnum = 0;
3009 : discriminator = 0;
3010 : }
3011 :
3012 97895469 : if (filename == NULL)
3013 : return false;
3014 :
3015 97895469 : if (force_source_line
3016 84621187 : || filename != last_filename
3017 81438929 : || last_linenum != linenum
3018 69127660 : || (debug_column_info && last_columnnum != columnnum))
3019 : {
3020 33375902 : force_source_line = false;
3021 33375902 : last_filename = filename;
3022 33375902 : last_linenum = linenum;
3023 33375902 : last_columnnum = columnnum;
3024 33375902 : last_discriminator = discriminator;
3025 33375902 : if (is_stmt)
3026 12353429 : *is_stmt = true;
3027 33375902 : high_block_linenum = MAX (last_linenum, high_block_linenum);
3028 33375902 : high_function_linenum = MAX (last_linenum, high_function_linenum);
3029 33375902 : return true;
3030 : }
3031 :
3032 64519567 : if (SUPPORTS_DISCRIMINATOR && last_discriminator != discriminator)
3033 : {
3034 : /* If the discriminator changed, but the line number did not,
3035 : output the line table entry with is_stmt false so the
3036 : debugger does not treat this as a breakpoint location. */
3037 7012718 : last_discriminator = discriminator;
3038 7012718 : if (is_stmt)
3039 6437932 : *is_stmt = false;
3040 : return true;
3041 : }
3042 :
3043 : return false;
3044 : }
3045 :
3046 : /* For each operand in INSN, simplify (subreg (reg)) so that it refers
3047 : directly to the desired hard register. */
3048 :
3049 : void
3050 103480632 : cleanup_subreg_operands (rtx_insn *insn)
3051 : {
3052 103480632 : int i;
3053 103480632 : bool changed = false;
3054 103480632 : extract_insn_cached (insn);
3055 423325436 : for (i = 0; i < recog_data.n_operands; i++)
3056 : {
3057 : /* The following test cannot use recog_data.operand when testing
3058 : for a SUBREG: the underlying object might have been changed
3059 : already if we are inside a match_operator expression that
3060 : matches the else clause. Instead we test the underlying
3061 : expression directly. */
3062 216364172 : if (GET_CODE (*recog_data.operand_loc[i]) == SUBREG)
3063 : {
3064 215 : recog_data.operand[i] = alter_subreg (recog_data.operand_loc[i], true);
3065 215 : changed = true;
3066 : }
3067 216363957 : else if (GET_CODE (recog_data.operand[i]) == PLUS
3068 : || GET_CODE (recog_data.operand[i]) == MULT
3069 : || MEM_P (recog_data.operand[i]))
3070 50616055 : recog_data.operand[i] = walk_alter_subreg (recog_data.operand_loc[i], &changed);
3071 : }
3072 :
3073 105600207 : for (i = 0; i < recog_data.n_dups; i++)
3074 : {
3075 2119575 : if (GET_CODE (*recog_data.dup_loc[i]) == SUBREG)
3076 : {
3077 0 : *recog_data.dup_loc[i] = alter_subreg (recog_data.dup_loc[i], true);
3078 0 : changed = true;
3079 : }
3080 : else if (GET_CODE (*recog_data.dup_loc[i]) == PLUS
3081 : || GET_CODE (*recog_data.dup_loc[i]) == MULT
3082 : || MEM_P (*recog_data.dup_loc[i]))
3083 572414 : *recog_data.dup_loc[i] = walk_alter_subreg (recog_data.dup_loc[i], &changed);
3084 : }
3085 103480632 : if (changed)
3086 215 : df_insn_rescan (insn);
3087 103480632 : }
3088 :
3089 : /* If X is a SUBREG, try to replace it with a REG or a MEM, based on
3090 : the thing it is a subreg of. Do it anyway if FINAL_P. */
3091 :
3092 : rtx
3093 3330282 : alter_subreg (rtx *xp, bool final_p)
3094 : {
3095 3330282 : rtx x = *xp;
3096 3330282 : rtx y = SUBREG_REG (x);
3097 :
3098 : /* simplify_subreg does not remove subreg from volatile references.
3099 : We are required to. */
3100 3330282 : if (MEM_P (y))
3101 : {
3102 228107 : poly_int64 offset = SUBREG_BYTE (x);
3103 :
3104 : /* For paradoxical subregs on big-endian machines, SUBREG_BYTE
3105 : contains 0 instead of the proper offset. See simplify_subreg. */
3106 228107 : if (paradoxical_subreg_p (x))
3107 32839 : offset = byte_lowpart_offset (GET_MODE (x), GET_MODE (y));
3108 :
3109 228107 : if (final_p)
3110 102 : *xp = adjust_address (y, GET_MODE (x), offset);
3111 : else
3112 228005 : *xp = adjust_address_nv (y, GET_MODE (x), offset);
3113 : }
3114 3102175 : else if (REG_P (y) && HARD_REGISTER_P (y))
3115 : {
3116 6204350 : rtx new_rtx = simplify_subreg (GET_MODE (x), y, GET_MODE (y),
3117 3102175 : SUBREG_BYTE (x));
3118 :
3119 3102175 : if (new_rtx != 0)
3120 3096549 : *xp = new_rtx;
3121 5626 : else if (final_p && REG_P (y))
3122 : {
3123 : /* Simplify_subreg can't handle some REG cases, but we have to. */
3124 2148 : unsigned int regno;
3125 2148 : poly_int64 offset;
3126 :
3127 2148 : regno = subreg_regno (x);
3128 2148 : if (subreg_lowpart_p (x))
3129 2148 : offset = byte_lowpart_offset (GET_MODE (x), GET_MODE (y));
3130 : else
3131 0 : offset = SUBREG_BYTE (x);
3132 2148 : *xp = gen_rtx_REG_offset (y, GET_MODE (x), regno, offset);
3133 : }
3134 : }
3135 :
3136 3330282 : return *xp;
3137 : }
3138 :
3139 : /* Do alter_subreg on all the SUBREGs contained in X. */
3140 :
3141 : static rtx
3142 171980746 : walk_alter_subreg (rtx *xp, bool *changed)
3143 : {
3144 171980746 : rtx x = *xp;
3145 171980746 : switch (GET_CODE (x))
3146 : {
3147 35909960 : case PLUS:
3148 35909960 : case MULT:
3149 35909960 : case AND:
3150 35909960 : case ASHIFT:
3151 35909960 : XEXP (x, 0) = walk_alter_subreg (&XEXP (x, 0), changed);
3152 35909960 : XEXP (x, 1) = walk_alter_subreg (&XEXP (x, 1), changed);
3153 35909960 : break;
3154 :
3155 44964129 : case MEM:
3156 44964129 : case ZERO_EXTEND:
3157 44964129 : XEXP (x, 0) = walk_alter_subreg (&XEXP (x, 0), changed);
3158 44964129 : break;
3159 :
3160 0 : case SUBREG:
3161 0 : *changed = true;
3162 0 : return alter_subreg (xp, true);
3163 :
3164 : default:
3165 : break;
3166 : }
3167 :
3168 171980746 : return *xp;
3169 : }
3170 :
3171 : /* Report inconsistency between the assembler template and the operands.
3172 : In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3173 :
3174 : void
3175 23 : output_operand_lossage (const char *cmsgid, ...)
3176 : {
3177 23 : char *fmt_string;
3178 23 : char *new_message;
3179 23 : const char *pfx_str;
3180 23 : va_list ap;
3181 :
3182 23 : va_start (ap, cmsgid);
3183 :
3184 23 : pfx_str = this_is_asm_operands ? _("invalid 'asm': ") : "output_operand: ";
3185 23 : fmt_string = xasprintf ("%s%s", pfx_str, _(cmsgid));
3186 23 : new_message = xvasprintf (fmt_string, ap);
3187 :
3188 23 : if (this_is_asm_operands)
3189 23 : error_for_asm (this_is_asm_operands, "%s", new_message);
3190 : else
3191 0 : internal_error ("%s", new_message);
3192 :
3193 23 : free (fmt_string);
3194 23 : free (new_message);
3195 23 : va_end (ap);
3196 23 : }
3197 :
3198 : /* Output of assembler code from a template, and its subroutines. */
3199 :
3200 : /* Annotate the assembly with a comment describing the pattern and
3201 : alternative used. */
3202 :
3203 : static void
3204 3536 : output_asm_name (void)
3205 : {
3206 3536 : if (debug_insn)
3207 : {
3208 3382 : fprintf (asm_out_file, "\t%s %d\t",
3209 3382 : ASM_COMMENT_START, INSN_UID (debug_insn));
3210 :
3211 3382 : fprintf (asm_out_file, "[c=%d",
3212 : insn_cost (debug_insn, optimize_insn_for_speed_p ()));
3213 3382 : if (HAVE_ATTR_length)
3214 3382 : fprintf (asm_out_file, " l=%d",
3215 : get_attr_length (debug_insn));
3216 3382 : fprintf (asm_out_file, "] ");
3217 :
3218 3382 : int num = INSN_CODE (debug_insn);
3219 3382 : fprintf (asm_out_file, "%s", insn_data[num].name);
3220 3382 : if (insn_data[num].n_alternatives > 1)
3221 1967 : fprintf (asm_out_file, "/%d", which_alternative);
3222 :
3223 : /* Clear this so only the first assembler insn
3224 : of any rtl insn will get the special comment for -dp. */
3225 3382 : debug_insn = 0;
3226 : }
3227 3536 : }
3228 :
3229 : /* If OP is a REG or MEM and we can find a MEM_EXPR corresponding to it
3230 : or its address, return that expr . Set *PADDRESSP to 1 if the expr
3231 : corresponds to the address of the object and 0 if to the object. */
3232 :
3233 : static tree
3234 406 : get_mem_expr_from_op (rtx op, int *paddressp)
3235 : {
3236 406 : tree expr;
3237 406 : int inner_addressp;
3238 :
3239 406 : *paddressp = 0;
3240 :
3241 406 : if (REG_P (op))
3242 259 : return REG_EXPR (op);
3243 147 : else if (!MEM_P (op))
3244 : return 0;
3245 :
3246 51 : if (MEM_EXPR (op) != 0)
3247 : return MEM_EXPR (op);
3248 :
3249 : /* Otherwise we have an address, so indicate it and look at the address. */
3250 0 : *paddressp = 1;
3251 0 : op = XEXP (op, 0);
3252 :
3253 : /* First check if we have a decl for the address, then look at the right side
3254 : if it is a PLUS. Otherwise, strip off arithmetic and keep looking.
3255 : But don't allow the address to itself be indirect. */
3256 0 : if ((expr = get_mem_expr_from_op (op, &inner_addressp)) && ! inner_addressp)
3257 : return expr;
3258 0 : else if (GET_CODE (op) == PLUS
3259 0 : && (expr = get_mem_expr_from_op (XEXP (op, 1), &inner_addressp)))
3260 : return expr;
3261 :
3262 0 : while (UNARY_P (op)
3263 0 : || GET_RTX_CLASS (GET_CODE (op)) == RTX_BIN_ARITH)
3264 0 : op = XEXP (op, 0);
3265 :
3266 0 : expr = get_mem_expr_from_op (op, &inner_addressp);
3267 0 : return inner_addressp ? 0 : expr;
3268 : }
3269 :
3270 : /* Output operand names for assembler instructions. OPERANDS is the
3271 : operand vector, OPORDER is the order to write the operands, and NOPS
3272 : is the number of operands to write. */
3273 :
3274 : static void
3275 248 : output_asm_operand_names (rtx *operands, int *oporder, int nops)
3276 : {
3277 248 : int wrote = 0;
3278 248 : int i;
3279 :
3280 654 : for (i = 0; i < nops; i++)
3281 : {
3282 406 : int addressp;
3283 406 : int opnum = oporder[i];
3284 : /* Skip invalid ops. */
3285 406 : if (opnum == MAX_RECOG_OPERANDS)
3286 0 : continue;
3287 406 : rtx op = operands[opnum];
3288 406 : tree expr = get_mem_expr_from_op (op, &addressp);
3289 :
3290 634 : fprintf (asm_out_file, "%c%s",
3291 : wrote ? ',' : '\t', wrote ? "" : ASM_COMMENT_START);
3292 406 : wrote = 1;
3293 406 : if (expr)
3294 : {
3295 231 : fprintf (asm_out_file, "%s",
3296 231 : addressp ? "*" : "");
3297 231 : print_mem_expr (asm_out_file, expr);
3298 231 : wrote = 1;
3299 : }
3300 79 : else if (REG_P (op) && ORIGINAL_REGNO (op)
3301 243 : && ORIGINAL_REGNO (op) != REGNO (op))
3302 41 : fprintf (asm_out_file, " tmp%i", ORIGINAL_REGNO (op));
3303 : }
3304 248 : }
3305 :
3306 : #ifdef ASSEMBLER_DIALECT
3307 : /* Helper function to parse assembler dialects in the asm string.
3308 : This is called from output_asm_insn and asm_fprintf. */
3309 : static const char *
3310 258730558 : do_assembler_dialects (const char *p, int *dialect)
3311 : {
3312 258730558 : char c = *(p - 1);
3313 :
3314 258730558 : switch (c)
3315 : {
3316 129365278 : case '{':
3317 129365278 : {
3318 129365278 : int i;
3319 :
3320 129365278 : if (*dialect)
3321 0 : output_operand_lossage ("nested assembly dialect alternatives");
3322 : else
3323 129365278 : *dialect = 1;
3324 :
3325 : /* If we want the first dialect, do nothing. Otherwise, skip
3326 : DIALECT_NUMBER of strings ending with '|'. */
3327 129366379 : for (i = 0; i < dialect_number; i++)
3328 : {
3329 9310 : while (*p && *p != '}')
3330 : {
3331 8732 : if (*p == '|')
3332 : {
3333 1102 : p++;
3334 1102 : break;
3335 : }
3336 :
3337 : /* Skip over any character after a percent sign. */
3338 7630 : if (*p == '%')
3339 2722 : p++;
3340 7630 : if (*p)
3341 7630 : p++;
3342 : }
3343 :
3344 1680 : if (*p == '}')
3345 : break;
3346 : }
3347 :
3348 129365278 : if (*p == '\0')
3349 0 : output_operand_lossage ("unterminated assembly dialect alternative");
3350 : }
3351 : break;
3352 :
3353 66396407 : case '|':
3354 66396407 : if (*dialect)
3355 : {
3356 : /* Skip to close brace. */
3357 352838225 : do
3358 : {
3359 352838225 : if (*p == '\0')
3360 : {
3361 0 : output_operand_lossage ("unterminated assembly dialect alternative");
3362 0 : break;
3363 : }
3364 :
3365 : /* Skip over any character after a percent sign. */
3366 352838225 : if (*p == '%' && p[1])
3367 : {
3368 130145278 : p += 2;
3369 130145278 : continue;
3370 : }
3371 :
3372 222692947 : if (*p++ == '}')
3373 : break;
3374 : }
3375 : while (1);
3376 :
3377 66396406 : *dialect = 0;
3378 : }
3379 : else
3380 1 : putc (c, asm_out_file);
3381 : break;
3382 :
3383 62968873 : case '}':
3384 62968873 : if (! *dialect)
3385 1 : putc (c, asm_out_file);
3386 62968873 : *dialect = 0;
3387 62968873 : break;
3388 0 : default:
3389 0 : gcc_unreachable ();
3390 : }
3391 :
3392 258730558 : return p;
3393 : }
3394 : #endif
3395 :
3396 : /* Output text from TEMPLATE to the assembler output file,
3397 : obeying %-directions to substitute operands taken from
3398 : the vector OPERANDS.
3399 :
3400 : %N (for N a digit) means print operand N in usual manner.
3401 : %lN means require operand N to be a CODE_LABEL or LABEL_REF
3402 : and print the label name with no punctuation.
3403 : %cN means require operand N to be a constant
3404 : and print the constant expression with no punctuation.
3405 : %aN means expect operand N to be a memory address
3406 : (not a memory reference!) and print a reference
3407 : to that address.
3408 : %nN means expect operand N to be a constant
3409 : and print a constant expression for minus the value
3410 : of the operand, with no other punctuation. */
3411 :
3412 : void
3413 107271590 : output_asm_insn (const char *templ, rtx *operands)
3414 : {
3415 107271590 : const char *p;
3416 107271590 : int c;
3417 : #ifdef ASSEMBLER_DIALECT
3418 107271590 : int dialect = 0;
3419 : #endif
3420 107271590 : int oporder[MAX_RECOG_OPERANDS+1];
3421 107271590 : char opoutput[MAX_RECOG_OPERANDS+1];
3422 107271590 : int ops = 0;
3423 :
3424 : /* An insn may return a null string template
3425 : in a case where no assembler code is needed. */
3426 107271590 : if (*templ == 0)
3427 13221600 : return;
3428 :
3429 94049990 : memset (opoutput, 0, sizeof opoutput);
3430 94049990 : p = templ;
3431 94049990 : putc ('\t', asm_out_file);
3432 :
3433 : #ifdef ASM_OUTPUT_OPCODE
3434 101746388 : ASM_OUTPUT_OPCODE (asm_out_file, p);
3435 : #endif
3436 :
3437 1154021435 : while ((c = *p++))
3438 1059971445 : switch (c)
3439 : {
3440 39022 : case '\n':
3441 39022 : if (flag_verbose_asm)
3442 0 : output_asm_operand_names (operands, oporder, ops);
3443 39022 : if (flag_print_asm_name)
3444 74 : output_asm_name ();
3445 :
3446 39022 : ops = 0;
3447 39022 : memset (opoutput, 0, sizeof opoutput);
3448 :
3449 39022 : putc (c, asm_out_file);
3450 : #ifdef ASM_OUTPUT_OPCODE
3451 113560 : while ((c = *p) == '\t')
3452 : {
3453 35516 : putc (c, asm_out_file);
3454 35516 : p++;
3455 : }
3456 39022 : ASM_OUTPUT_OPCODE (asm_out_file, p);
3457 : #endif
3458 : break;
3459 :
3460 : #ifdef ASSEMBLER_DIALECT
3461 258730558 : case '{':
3462 258730558 : case '}':
3463 258730558 : case '|':
3464 258730558 : p = do_assembler_dialects (p, &dialect);
3465 258730558 : break;
3466 : #endif
3467 :
3468 190792199 : case '%':
3469 : /* %% outputs a single %. %{, %} and %| print {, } and | respectively
3470 : if ASSEMBLER_DIALECT defined and these characters have a special
3471 : meaning as dialect delimiters.*/
3472 190792199 : if (*p == '%'
3473 : #ifdef ASSEMBLER_DIALECT
3474 190776939 : || *p == '{' || *p == '}' || *p == '|'
3475 : #endif
3476 : )
3477 : {
3478 134854 : putc (*p, asm_out_file);
3479 134854 : p++;
3480 : }
3481 : /* %= outputs a number which is unique to each insn in the entire
3482 : compilation. This is useful for making local labels that are
3483 : referred to more than once in a given insn. */
3484 190657345 : else if (*p == '=')
3485 : {
3486 19 : p++;
3487 19 : fprintf (asm_out_file, "%d", insn_counter);
3488 : }
3489 : /* % followed by a letter and some digits
3490 : outputs an operand in a special way depending on the letter.
3491 : Letters `acln' are implemented directly.
3492 : Other letters are passed to `output_operand' so that
3493 : the TARGET_PRINT_OPERAND hook can define them. */
3494 190657326 : else if (ISALPHA (*p))
3495 : {
3496 50356792 : int letter = *p++;
3497 50356792 : unsigned long opnum;
3498 50356792 : char *endptr;
3499 50356792 : int letter2 = 0;
3500 :
3501 50356792 : if (letter == 'c' && *p == 'c')
3502 98 : letter2 = *p++;
3503 50356792 : opnum = strtoul (p, &endptr, 10);
3504 :
3505 50356792 : if (endptr == p)
3506 0 : output_operand_lossage ("operand number missing "
3507 : "after %%-letter");
3508 50356792 : else if (this_is_asm_operands && opnum >= insn_noperands)
3509 : {
3510 : /* Force the opnum in bounds to a bogus location. */
3511 4 : opnum = MAX_RECOG_OPERANDS;
3512 4 : output_operand_lossage ("operand number out of range");
3513 : }
3514 50356788 : else if (letter == 'l')
3515 8938897 : output_asm_label (operands[opnum]);
3516 41417891 : else if (letter == 'a')
3517 2280 : output_address (VOIDmode, operands[opnum]);
3518 41415611 : else if (letter == 'c')
3519 : {
3520 242599 : if (letter2 == 'c' || CONSTANT_ADDRESS_P (operands[opnum]))
3521 1559 : output_addr_const (asm_out_file, operands[opnum]);
3522 : else
3523 241040 : output_operand (operands[opnum], 'c');
3524 : }
3525 41173012 : else if (letter == 'n')
3526 : {
3527 0 : if (CONST_INT_P (operands[opnum]))
3528 0 : fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC,
3529 0 : - INTVAL (operands[opnum]));
3530 : else
3531 : {
3532 0 : putc ('-', asm_out_file);
3533 0 : output_addr_const (asm_out_file, operands[opnum]);
3534 : }
3535 : }
3536 : else
3537 41173012 : output_operand (operands[opnum], letter);
3538 :
3539 50356792 : if (!opoutput[opnum])
3540 48016627 : oporder[ops++] = opnum;
3541 50356792 : opoutput[opnum] = 1;
3542 :
3543 50356792 : p = endptr;
3544 50356792 : c = *p;
3545 : }
3546 : /* % followed by a digit outputs an operand the default way. */
3547 140300534 : else if (ISDIGIT (*p))
3548 : {
3549 118247993 : unsigned long opnum;
3550 118247993 : char *endptr;
3551 :
3552 118247993 : opnum = strtoul (p, &endptr, 10);
3553 118247993 : if (this_is_asm_operands && opnum >= insn_noperands)
3554 : {
3555 : /* Force the opnum in bounds to a bogus location. */
3556 3 : opnum = MAX_RECOG_OPERANDS;
3557 3 : output_operand_lossage ("operand number out of range");
3558 : }
3559 : else
3560 118247990 : output_operand (operands[opnum], 0);
3561 :
3562 118247993 : if (!opoutput[opnum])
3563 115885470 : oporder[ops++] = opnum;
3564 118247993 : opoutput[opnum] = 1;
3565 :
3566 118247993 : p = endptr;
3567 118247993 : c = *p;
3568 : }
3569 : /* % followed by punctuation: output something for that
3570 : punctuation character alone, with no operand. The
3571 : TARGET_PRINT_OPERAND hook decides what is actually done. */
3572 22052541 : else if (targetm.asm_out.print_operand_punct_valid_p ((unsigned char) *p))
3573 22052541 : output_operand (NULL_RTX, *p++);
3574 : else
3575 0 : output_operand_lossage ("invalid %%-code");
3576 : break;
3577 :
3578 610409666 : default:
3579 610409666 : putc (c, asm_out_file);
3580 : }
3581 :
3582 : /* Try to keep the asm a bit more readable. */
3583 94049990 : if ((flag_verbose_asm || flag_print_asm_name) && strlen (templ) < 9)
3584 415 : putc ('\t', asm_out_file);
3585 :
3586 : /* Write out the variable names for operands, if we know them. */
3587 94049990 : if (flag_verbose_asm)
3588 248 : output_asm_operand_names (operands, oporder, ops);
3589 94049990 : if (flag_print_asm_name)
3590 3462 : output_asm_name ();
3591 :
3592 94049990 : putc ('\n', asm_out_file);
3593 : }
3594 :
3595 : /* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3596 :
3597 : void
3598 8944977 : output_asm_label (rtx x)
3599 : {
3600 8944977 : char buf[256];
3601 :
3602 8944977 : if (GET_CODE (x) == LABEL_REF)
3603 6239 : x = label_ref_label (x);
3604 8944977 : if (LABEL_P (x)
3605 104 : || (NOTE_P (x)
3606 104 : && NOTE_KIND (x) == NOTE_INSN_DELETED_LABEL))
3607 8944977 : ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3608 : else
3609 0 : output_operand_lossage ("'%%l' operand isn't a label");
3610 :
3611 8944977 : assemble_name (asm_out_file, buf);
3612 8944977 : }
3613 :
3614 : /* Marks SYMBOL_REFs in x as referenced through use of assemble_external. */
3615 :
3616 : void
3617 159662042 : mark_symbol_refs_as_used (rtx x)
3618 : {
3619 159662042 : subrtx_iterator::array_type array;
3620 435946558 : FOR_EACH_SUBRTX (iter, array, x, ALL)
3621 : {
3622 276284516 : const_rtx x = *iter;
3623 276284516 : if (GET_CODE (x) == SYMBOL_REF)
3624 16317728 : if (tree t = SYMBOL_REF_DECL (x))
3625 15119158 : assemble_external (t);
3626 : }
3627 159662042 : }
3628 :
3629 : /* Print operand X using machine-dependent assembler syntax.
3630 : CODE is a non-digit that preceded the operand-number in the % spec,
3631 : such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3632 : between the % and the digits.
3633 : When CODE is a non-letter, X is 0.
3634 :
3635 : The meanings of the letters are machine-dependent and controlled
3636 : by TARGET_PRINT_OPERAND. */
3637 :
3638 : void
3639 181714583 : output_operand (rtx x, int code ATTRIBUTE_UNUSED)
3640 : {
3641 181714583 : if (x && GET_CODE (x) == SUBREG)
3642 0 : x = alter_subreg (&x, true);
3643 :
3644 : /* X must not be a pseudo reg. */
3645 181714583 : if (!targetm.no_register_allocation)
3646 181714583 : gcc_assert (!x || !REG_P (x) || REGNO (x) < FIRST_PSEUDO_REGISTER);
3647 :
3648 181714583 : targetm.asm_out.print_operand (asm_out_file, x, code);
3649 :
3650 181714583 : if (x == NULL_RTX)
3651 : return;
3652 :
3653 159662042 : mark_symbol_refs_as_used (x);
3654 : }
3655 :
3656 : /* Print a memory reference operand for address X using
3657 : machine-dependent assembler syntax. */
3658 :
3659 : void
3660 4008228 : output_address (machine_mode mode, rtx x)
3661 : {
3662 4008228 : bool changed = false;
3663 4008228 : walk_alter_subreg (&x, &changed);
3664 4008228 : targetm.asm_out.print_operand_address (asm_out_file, mode, x);
3665 4008228 : }
3666 :
3667 : /* Print an integer constant expression in assembler syntax.
3668 : Addition and subtraction are the only arithmetic
3669 : that may appear in these expressions. */
3670 :
3671 : void
3672 172574845 : output_addr_const (FILE *file, rtx x)
3673 : {
3674 183382271 : char buf[256];
3675 :
3676 183382271 : restart:
3677 183382271 : switch (GET_CODE (x))
3678 : {
3679 660 : case PC:
3680 660 : putc ('.', file);
3681 660 : break;
3682 :
3683 133399728 : case SYMBOL_REF:
3684 133399728 : if (SYMBOL_REF_DECL (x))
3685 21021052 : assemble_external (SYMBOL_REF_DECL (x));
3686 : #ifdef ASM_OUTPUT_SYMBOL_REF
3687 133399728 : ASM_OUTPUT_SYMBOL_REF (file, x);
3688 : #else
3689 : assemble_name (file, XSTR (x, 0));
3690 : #endif
3691 : break;
3692 :
3693 15052 : case LABEL_REF:
3694 15052 : x = label_ref_label (x);
3695 : /* Fall through. */
3696 15052 : case CODE_LABEL:
3697 15052 : ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x));
3698 : #ifdef ASM_OUTPUT_LABEL_REF
3699 : ASM_OUTPUT_LABEL_REF (file, buf);
3700 : #else
3701 15052 : assemble_name (file, buf);
3702 : #endif
3703 15052 : break;
3704 :
3705 39144614 : case CONST_INT:
3706 39144614 : fprintf (file, HOST_WIDE_INT_PRINT_DEC, INTVAL (x));
3707 39144614 : break;
3708 :
3709 2704895 : case CONST:
3710 : /* This used to output parentheses around the expression,
3711 : but that does not work on the 386 (either ATT or BSD assembler). */
3712 2704895 : output_addr_const (file, XEXP (x, 0));
3713 2704895 : break;
3714 :
3715 2 : case CONST_WIDE_INT:
3716 : /* We do not know the mode here so we have to use a round about
3717 : way to build a wide-int to get it printed properly. */
3718 2 : {
3719 2 : wide_int w = wide_int::from_array (&CONST_WIDE_INT_ELT (x, 0),
3720 2 : CONST_WIDE_INT_NUNITS (x),
3721 2 : CONST_WIDE_INT_NUNITS (x)
3722 2 : * HOST_BITS_PER_WIDE_INT,
3723 2 : false);
3724 2 : print_decs (w, file);
3725 2 : }
3726 2 : break;
3727 :
3728 0 : case CONST_DOUBLE:
3729 0 : if (CONST_DOUBLE_AS_INT_P (x))
3730 : {
3731 : /* We can use %d if the number is one word and positive. */
3732 0 : if (CONST_DOUBLE_HIGH (x))
3733 0 : fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3734 : (unsigned HOST_WIDE_INT) CONST_DOUBLE_HIGH (x),
3735 0 : (unsigned HOST_WIDE_INT) CONST_DOUBLE_LOW (x));
3736 0 : else if (CONST_DOUBLE_LOW (x) < 0)
3737 0 : fprintf (file, HOST_WIDE_INT_PRINT_HEX,
3738 : (unsigned HOST_WIDE_INT) CONST_DOUBLE_LOW (x));
3739 : else
3740 0 : fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_DOUBLE_LOW (x));
3741 : }
3742 : else
3743 : /* We can't handle floating point constants;
3744 : PRINT_OPERAND must handle them. */
3745 0 : output_operand_lossage ("floating constant misused");
3746 : break;
3747 :
3748 0 : case CONST_FIXED:
3749 0 : fprintf (file, HOST_WIDE_INT_PRINT_DEC, CONST_FIXED_VALUE_LOW (x));
3750 0 : break;
3751 :
3752 2724914 : case PLUS:
3753 : /* Some assemblers need integer constants to appear last (eg masm). */
3754 2724914 : if (CONST_INT_P (XEXP (x, 0)))
3755 : {
3756 0 : output_addr_const (file, XEXP (x, 1));
3757 0 : if (INTVAL (XEXP (x, 0)) >= 0)
3758 0 : fprintf (file, "+");
3759 0 : output_addr_const (file, XEXP (x, 0));
3760 : }
3761 : else
3762 : {
3763 2724914 : output_addr_const (file, XEXP (x, 0));
3764 2724914 : if (!CONST_INT_P (XEXP (x, 1))
3765 2724914 : || INTVAL (XEXP (x, 1)) >= 0)
3766 2698697 : fprintf (file, "+");
3767 2724914 : output_addr_const (file, XEXP (x, 1));
3768 : }
3769 : break;
3770 :
3771 5377681 : case MINUS:
3772 : /* Avoid outputting things like x-x or x+5-x,
3773 : since some assemblers can't handle that. */
3774 5377681 : x = simplify_subtraction (x);
3775 5377681 : if (GET_CODE (x) != MINUS)
3776 0 : goto restart;
3777 :
3778 5377681 : output_addr_const (file, XEXP (x, 0));
3779 5377681 : fprintf (file, "-");
3780 5377681 : if ((CONST_INT_P (XEXP (x, 1)) && INTVAL (XEXP (x, 1)) >= 0)
3781 5377681 : || GET_CODE (XEXP (x, 1)) == PC
3782 5377021 : || GET_CODE (XEXP (x, 1)) == SYMBOL_REF)
3783 : output_addr_const (file, XEXP (x, 1));
3784 : else
3785 : {
3786 64 : fputs (targetm.asm_out.open_paren, file);
3787 64 : output_addr_const (file, XEXP (x, 1));
3788 64 : fputs (targetm.asm_out.close_paren, file);
3789 : }
3790 : break;
3791 :
3792 0 : case ZERO_EXTEND:
3793 0 : case SIGN_EXTEND:
3794 0 : case SUBREG:
3795 0 : case TRUNCATE:
3796 0 : output_addr_const (file, XEXP (x, 0));
3797 0 : break;
3798 :
3799 14725 : default:
3800 14725 : if (targetm.asm_out.output_addr_const_extra (file, x))
3801 : break;
3802 :
3803 0 : output_operand_lossage ("invalid expression as operand");
3804 : }
3805 172574845 : }
3806 :
3807 : /* Output a quoted string. */
3808 :
3809 : void
3810 1641390 : output_quoted_string (FILE *asm_file, const char *string)
3811 : {
3812 : #ifdef OUTPUT_QUOTED_STRING
3813 : OUTPUT_QUOTED_STRING (asm_file, string);
3814 : #else
3815 1641390 : char c;
3816 :
3817 1641390 : putc ('\"', asm_file);
3818 98524952 : while ((c = *string++) != 0)
3819 : {
3820 95242172 : if (ISPRINT (c))
3821 : {
3822 95242160 : if (c == '\"' || c == '\\')
3823 15 : putc ('\\', asm_file);
3824 95242160 : putc (c, asm_file);
3825 : }
3826 : else
3827 12 : fprintf (asm_file, "\\%03o", (unsigned char) c);
3828 : }
3829 1641390 : putc ('\"', asm_file);
3830 : #endif
3831 1641390 : }
3832 :
3833 : /* Write a HOST_WIDE_INT number in hex form 0x1234, fast. */
3834 :
3835 : void
3836 537147628 : fprint_whex (FILE *f, unsigned HOST_WIDE_INT value)
3837 : {
3838 537147628 : char buf[2 + CHAR_BIT * sizeof (value) / 4];
3839 537147628 : if (value == 0)
3840 51433572 : putc ('0', f);
3841 : else
3842 : {
3843 : char *p = buf + sizeof (buf);
3844 1013813318 : do
3845 1013813318 : *--p = "0123456789abcdef"[value % 16];
3846 1013813318 : while ((value /= 16) != 0);
3847 485714056 : *--p = 'x';
3848 485714056 : *--p = '0';
3849 485714056 : fwrite (p, 1, buf + sizeof (buf) - p, f);
3850 : }
3851 537147628 : }
3852 :
3853 : /* Internal function that prints an unsigned long in decimal in reverse.
3854 : The output string IS NOT null-terminated. */
3855 :
3856 : static int
3857 462921724 : sprint_ul_rev (char *s, unsigned long value)
3858 : {
3859 0 : int i = 0;
3860 1448849412 : do
3861 : {
3862 1448849412 : s[i] = "0123456789"[value % 10];
3863 1448849412 : value /= 10;
3864 1448849412 : i++;
3865 : /* alternate version, without modulo */
3866 : /* oldval = value; */
3867 : /* value /= 10; */
3868 : /* s[i] = "0123456789" [oldval - 10*value]; */
3869 : /* i++ */
3870 : }
3871 1448849412 : while (value != 0);
3872 338775648 : return i;
3873 : }
3874 :
3875 : /* Write an unsigned long as decimal to a file, fast. */
3876 :
3877 : void
3878 124146076 : fprint_ul (FILE *f, unsigned long value)
3879 : {
3880 : /* python says: len(str(2**64)) == 20 */
3881 124146076 : char s[20];
3882 124146076 : int i;
3883 :
3884 124146076 : i = sprint_ul_rev (s, value);
3885 :
3886 : /* It's probably too small to bother with string reversal and fputs. */
3887 240999106 : do
3888 : {
3889 240999106 : i--;
3890 240999106 : putc (s[i], f);
3891 : }
3892 240999106 : while (i != 0);
3893 124146076 : }
3894 :
3895 : /* Write an unsigned long as decimal to a string, fast.
3896 : s must be wide enough to not overflow, at least 21 chars.
3897 : Returns the length of the string (without terminating '\0'). */
3898 :
3899 : int
3900 338775648 : sprint_ul (char *s, unsigned long value)
3901 : {
3902 338775648 : int len = sprint_ul_rev (s, value);
3903 338775648 : s[len] = '\0';
3904 :
3905 338775648 : std::reverse (s, s + len);
3906 338775648 : return len;
3907 : }
3908 :
3909 : /* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3910 : %R prints the value of REGISTER_PREFIX.
3911 : %L prints the value of LOCAL_LABEL_PREFIX.
3912 : %U prints the value of USER_LABEL_PREFIX.
3913 : %I prints the value of IMMEDIATE_PREFIX.
3914 : %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3915 : Also supported are %d, %i, %u, %x, %X, %o, %c, %s and %%.
3916 :
3917 : We handle alternate assembler dialects here, just like output_asm_insn. */
3918 :
3919 : void
3920 2 : asm_fprintf (FILE *file, const char *p, ...)
3921 : {
3922 2 : char buf[10];
3923 2 : char *q, c;
3924 : #ifdef ASSEMBLER_DIALECT
3925 2 : int dialect = 0;
3926 : #endif
3927 2 : va_list argptr;
3928 :
3929 2 : va_start (argptr, p);
3930 :
3931 2 : buf[0] = '%';
3932 :
3933 21 : while ((c = *p++))
3934 19 : switch (c)
3935 : {
3936 : #ifdef ASSEMBLER_DIALECT
3937 0 : case '{':
3938 0 : case '}':
3939 0 : case '|':
3940 0 : p = do_assembler_dialects (p, &dialect);
3941 0 : break;
3942 : #endif
3943 :
3944 6 : case '%':
3945 6 : c = *p++;
3946 6 : q = &buf[1];
3947 6 : while (strchr ("-+ #0", c))
3948 : {
3949 0 : *q++ = c;
3950 0 : c = *p++;
3951 : }
3952 6 : while (ISDIGIT (c) || c == '.')
3953 : {
3954 0 : *q++ = c;
3955 0 : c = *p++;
3956 : }
3957 6 : switch (c)
3958 : {
3959 2 : case '%':
3960 2 : putc ('%', file);
3961 2 : break;
3962 :
3963 0 : case 'd': case 'i': case 'u':
3964 0 : case 'x': case 'X': case 'o':
3965 0 : case 'c':
3966 0 : *q++ = c;
3967 0 : *q = 0;
3968 0 : fprintf (file, buf, va_arg (argptr, int));
3969 0 : break;
3970 :
3971 0 : case 'w':
3972 : /* This is a prefix to the 'd', 'i', 'u', 'x', 'X', and
3973 : 'o' cases, but we do not check for those cases. It
3974 : means that the value is a HOST_WIDE_INT, which may be
3975 : either `long' or `long long'. */
3976 0 : memcpy (q, HOST_WIDE_INT_PRINT, strlen (HOST_WIDE_INT_PRINT));
3977 0 : q += strlen (HOST_WIDE_INT_PRINT);
3978 0 : *q++ = *p++;
3979 0 : *q = 0;
3980 0 : fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3981 0 : break;
3982 :
3983 0 : case 'l':
3984 0 : *q++ = c;
3985 : #ifdef HAVE_LONG_LONG
3986 0 : if (*p == 'l')
3987 : {
3988 0 : *q++ = *p++;
3989 0 : *q++ = *p++;
3990 0 : *q = 0;
3991 0 : fprintf (file, buf, va_arg (argptr, long long));
3992 : }
3993 : else
3994 : #endif
3995 : {
3996 0 : *q++ = *p++;
3997 0 : *q = 0;
3998 0 : fprintf (file, buf, va_arg (argptr, long));
3999 : }
4000 :
4001 : break;
4002 :
4003 0 : case 's':
4004 0 : *q++ = c;
4005 0 : *q = 0;
4006 0 : fprintf (file, buf, va_arg (argptr, char *));
4007 0 : break;
4008 :
4009 0 : case 'O':
4010 : #ifdef ASM_OUTPUT_OPCODE
4011 0 : ASM_OUTPUT_OPCODE (asm_out_file, p);
4012 : #endif
4013 : break;
4014 :
4015 : case 'R':
4016 : #ifdef REGISTER_PREFIX
4017 : fprintf (file, "%s", REGISTER_PREFIX);
4018 : #endif
4019 : break;
4020 :
4021 : case 'I':
4022 : #ifdef IMMEDIATE_PREFIX
4023 : fprintf (file, "%s", IMMEDIATE_PREFIX);
4024 : #endif
4025 : break;
4026 :
4027 0 : case 'L':
4028 : #ifdef LOCAL_LABEL_PREFIX
4029 0 : fprintf (file, "%s", LOCAL_LABEL_PREFIX);
4030 : #endif
4031 0 : break;
4032 :
4033 0 : case 'U':
4034 0 : fputs (user_label_prefix, file);
4035 0 : break;
4036 :
4037 : #ifdef ASM_FPRINTF_EXTENSIONS
4038 : /* Uppercase letters are reserved for general use by asm_fprintf
4039 : and so are not available to target specific code. In order to
4040 : prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
4041 : they are defined here. As they get turned into real extensions
4042 : to asm_fprintf they should be removed from this list. */
4043 : case 'A': case 'B': case 'C': case 'D': case 'E':
4044 : case 'F': case 'G': case 'H': case 'J': case 'K':
4045 : case 'M': case 'N': case 'P': case 'Q': case 'S':
4046 : case 'T': case 'V': case 'W': case 'Y': case 'Z':
4047 : break;
4048 :
4049 4 : ASM_FPRINTF_EXTENSIONS (file, argptr, p)
4050 : #endif
4051 0 : default:
4052 0 : gcc_unreachable ();
4053 : }
4054 : break;
4055 :
4056 13 : default:
4057 13 : putc (c, file);
4058 : }
4059 2 : va_end (argptr);
4060 2 : }
4061 :
4062 : /* Return true if this function has no function calls. */
4063 :
4064 : bool
4065 3062063 : leaf_function_p (void)
4066 : {
4067 3062063 : rtx_insn *insn;
4068 :
4069 : /* Ensure we walk the entire function body. */
4070 3062063 : gcc_assert (!in_sequence_p ());
4071 :
4072 : /* Some back-ends (e.g. s390) want leaf functions to stay leaf
4073 : functions even if they call mcount. */
4074 3062063 : if (crtl->profile && !targetm.keep_leaf_when_profiled ())
4075 : return false;
4076 :
4077 81502050 : for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4078 : {
4079 80384779 : if (CALL_P (insn)
4080 2089758 : && ! SIBLING_CALL_P (insn)
4081 82329041 : && ! FAKE_CALL_P (insn))
4082 : return false;
4083 78440617 : if (NONJUMP_INSN_P (insn)
4084 37756452 : && GET_CODE (PATTERN (insn)) == SEQUENCE
4085 0 : && CALL_P (XVECEXP (PATTERN (insn), 0, 0))
4086 78440617 : && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0)))
4087 : return false;
4088 : }
4089 :
4090 : return true;
4091 : }
4092 :
4093 : /* Return true if branch is a forward branch.
4094 : Uses insn_shuid array, so it works only in the final pass. May be used by
4095 : output templates to customary add branch prediction hints.
4096 : */
4097 : bool
4098 0 : final_forward_branch_p (rtx_insn *insn)
4099 : {
4100 0 : int insn_id, label_id;
4101 :
4102 0 : gcc_assert (uid_shuid);
4103 0 : insn_id = INSN_SHUID (insn);
4104 0 : label_id = INSN_SHUID (JUMP_LABEL (insn));
4105 : /* We've hit some insns that does not have id information available. */
4106 0 : gcc_assert (insn_id && label_id);
4107 0 : return insn_id < label_id;
4108 : }
4109 :
4110 : /* On some machines, a function with no call insns
4111 : can run faster if it doesn't create its own register window.
4112 : When output, the leaf function should use only the "output"
4113 : registers. Ordinarily, the function would be compiled to use
4114 : the "input" registers to find its arguments; it is a candidate
4115 : for leaf treatment if it uses only the "input" registers.
4116 : Leaf function treatment means renumbering so the function
4117 : uses the "output" registers instead. */
4118 :
4119 : #ifdef LEAF_REGISTERS
4120 :
4121 : /* Return bool if this function uses only the registers that can be
4122 : safely renumbered. */
4123 :
4124 : bool
4125 : only_leaf_regs_used (void)
4126 : {
4127 : int i;
4128 : const char *const permitted_reg_in_leaf_functions = LEAF_REGISTERS;
4129 :
4130 : for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4131 : if ((df_regs_ever_live_p (i) || global_regs[i])
4132 : && ! permitted_reg_in_leaf_functions[i])
4133 : return false;
4134 :
4135 : if (crtl->uses_pic_offset_table
4136 : && pic_offset_table_rtx != 0
4137 : && REG_P (pic_offset_table_rtx)
4138 : && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4139 : return false;
4140 :
4141 : return true;
4142 : }
4143 :
4144 : /* Scan all instructions and renumber all registers into those
4145 : available in leaf functions. */
4146 :
4147 : static void
4148 : leaf_renumber_regs (rtx_insn *first)
4149 : {
4150 : rtx_insn *insn;
4151 :
4152 : /* Renumber only the actual patterns.
4153 : The reg-notes can contain frame pointer refs,
4154 : and renumbering them could crash, and should not be needed. */
4155 : for (insn = first; insn; insn = NEXT_INSN (insn))
4156 : if (INSN_P (insn))
4157 : leaf_renumber_regs_insn (PATTERN (insn));
4158 : }
4159 :
4160 : /* Scan IN_RTX and its subexpressions, and renumber all regs into those
4161 : available in leaf functions. */
4162 :
4163 : void
4164 : leaf_renumber_regs_insn (rtx in_rtx)
4165 : {
4166 : int i, j;
4167 : const char *format_ptr;
4168 :
4169 : if (in_rtx == 0)
4170 : return;
4171 :
4172 : /* Renumber all input-registers into output-registers.
4173 : renumbered_regs would be 1 for an output-register;
4174 : they */
4175 :
4176 : if (REG_P (in_rtx))
4177 : {
4178 : int newreg;
4179 :
4180 : /* Don't renumber the same reg twice. */
4181 : if (in_rtx->used)
4182 : return;
4183 :
4184 : newreg = REGNO (in_rtx);
4185 : /* Don't try to renumber pseudo regs. It is possible for a pseudo reg
4186 : to reach here as part of a REG_NOTE. */
4187 : if (newreg >= FIRST_PSEUDO_REGISTER)
4188 : {
4189 : in_rtx->used = 1;
4190 : return;
4191 : }
4192 : newreg = LEAF_REG_REMAP (newreg);
4193 : gcc_assert (newreg >= 0);
4194 : df_set_regs_ever_live (REGNO (in_rtx), false);
4195 : df_set_regs_ever_live (newreg, true);
4196 : SET_REGNO (in_rtx, newreg);
4197 : in_rtx->used = 1;
4198 : return;
4199 : }
4200 :
4201 : if (INSN_P (in_rtx))
4202 : {
4203 : /* Inside a SEQUENCE, we find insns.
4204 : Renumber just the patterns of these insns,
4205 : just as we do for the top-level insns. */
4206 : leaf_renumber_regs_insn (PATTERN (in_rtx));
4207 : return;
4208 : }
4209 :
4210 : format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx));
4211 :
4212 : for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
4213 : switch (*format_ptr++)
4214 : {
4215 : case 'e':
4216 : leaf_renumber_regs_insn (XEXP (in_rtx, i));
4217 : break;
4218 :
4219 : case 'E':
4220 : if (XVEC (in_rtx, i) != NULL)
4221 : for (j = 0; j < XVECLEN (in_rtx, i); j++)
4222 : leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j));
4223 : break;
4224 :
4225 : case 'S':
4226 : case 's':
4227 : case '0':
4228 : case 'i':
4229 : case 'L':
4230 : case 'w':
4231 : case 'p':
4232 : case 'n':
4233 : case 'u':
4234 : break;
4235 :
4236 : default:
4237 : gcc_unreachable ();
4238 : }
4239 : }
4240 : #endif
4241 :
4242 : /* Turn the RTL into assembly. */
4243 : static unsigned int
4244 1515923 : rest_of_handle_final (void)
4245 : {
4246 1515923 : const char *fnname = get_fnname_from_decl (current_function_decl);
4247 :
4248 : /* Turn debug markers into notes if the var-tracking pass has not
4249 : been invoked. */
4250 1515923 : if (!flag_var_tracking && MAY_HAVE_DEBUG_MARKER_INSNS)
4251 1 : delete_vta_debug_insns (false);
4252 :
4253 1515923 : assemble_start_function (current_function_decl, fnname);
4254 1515923 : rtx_insn *first = get_insns ();
4255 1515923 : int seen = 0;
4256 1515923 : final_start_function_1 (&first, asm_out_file, &seen, optimize);
4257 1515923 : final_1 (first, asm_out_file, seen, optimize);
4258 1515923 : if (flag_ipa_ra
4259 983810 : && !lookup_attribute ("noipa", DECL_ATTRIBUTES (current_function_decl))
4260 : /* Functions with naked attributes are supported only with basic asm
4261 : statements in the body, thus for supported use cases the information
4262 : on clobbered registers is not available. */
4263 2479655 : && !lookup_attribute ("naked", DECL_ATTRIBUTES (current_function_decl)))
4264 963732 : collect_fn_hard_reg_usage ();
4265 1515923 : final_end_function ();
4266 :
4267 : /* The IA-64 ".handlerdata" directive must be issued before the ".endp"
4268 : directive that closes the procedure descriptor. Similarly, for x64 SEH.
4269 : Otherwise it's not strictly necessary, but it doesn't hurt either. */
4270 2965305 : output_function_exception_table (crtl->has_bb_partition ? 1 : 0);
4271 :
4272 1515923 : assemble_end_function (current_function_decl, fnname);
4273 :
4274 : /* Free up reg info memory. */
4275 1515923 : free_reg_info ();
4276 :
4277 1515923 : if (! quiet_flag)
4278 0 : fflush (asm_out_file);
4279 :
4280 : /* Note that for those inline functions where we don't initially
4281 : know for certain that we will be generating an out-of-line copy,
4282 : the first invocation of this routine (rest_of_compilation) will
4283 : skip over this code by doing a `goto exit_rest_of_compilation;'.
4284 : Later on, wrapup_global_declarations will (indirectly) call
4285 : rest_of_compilation again for those inline functions that need
4286 : to have out-of-line copies generated. During that call, we
4287 : *will* be routed past here. */
4288 :
4289 1515923 : timevar_push (TV_SYMOUT);
4290 1515923 : if (!DECL_IGNORED_P (current_function_decl))
4291 1509171 : debug_hooks->function_decl (current_function_decl);
4292 1515923 : timevar_pop (TV_SYMOUT);
4293 :
4294 : /* Release the blocks that are linked to DECL_INITIAL() to free the memory. */
4295 1515923 : DECL_INITIAL (current_function_decl) = error_mark_node;
4296 :
4297 1515923 : if (DECL_STATIC_CONSTRUCTOR (current_function_decl)
4298 1515923 : && targetm.have_ctors_dtors)
4299 22736 : targetm.asm_out.constructor (XEXP (DECL_RTL (current_function_decl), 0),
4300 : decl_init_priority_lookup
4301 22736 : (current_function_decl));
4302 1515923 : if (DECL_STATIC_DESTRUCTOR (current_function_decl)
4303 1515923 : && targetm.have_ctors_dtors)
4304 1646 : targetm.asm_out.destructor (XEXP (DECL_RTL (current_function_decl), 0),
4305 : decl_fini_priority_lookup
4306 1646 : (current_function_decl));
4307 1515923 : return 0;
4308 : }
4309 :
4310 : namespace {
4311 :
4312 : const pass_data pass_data_final =
4313 : {
4314 : RTL_PASS, /* type */
4315 : "final", /* name */
4316 : OPTGROUP_NONE, /* optinfo_flags */
4317 : TV_FINAL, /* tv_id */
4318 : 0, /* properties_required */
4319 : 0, /* properties_provided */
4320 : 0, /* properties_destroyed */
4321 : 0, /* todo_flags_start */
4322 : 0, /* todo_flags_finish */
4323 : };
4324 :
4325 : class pass_final : public rtl_opt_pass
4326 : {
4327 : public:
4328 294536 : pass_final (gcc::context *ctxt)
4329 589072 : : rtl_opt_pass (pass_data_final, ctxt)
4330 : {}
4331 :
4332 : /* opt_pass methods: */
4333 1515923 : unsigned int execute (function *) final override
4334 : {
4335 1515923 : return rest_of_handle_final ();
4336 : }
4337 :
4338 : }; // class pass_final
4339 :
4340 : } // anon namespace
4341 :
4342 : rtl_opt_pass *
4343 294536 : make_pass_final (gcc::context *ctxt)
4344 : {
4345 294536 : return new pass_final (ctxt);
4346 : }
4347 :
4348 :
4349 : static unsigned int
4350 1515922 : rest_of_handle_shorten_branches (void)
4351 : {
4352 : /* Shorten branches. */
4353 0 : shorten_branches (get_insns ());
4354 1515922 : return 0;
4355 : }
4356 :
4357 : namespace {
4358 :
4359 : const pass_data pass_data_shorten_branches =
4360 : {
4361 : RTL_PASS, /* type */
4362 : "shorten", /* name */
4363 : OPTGROUP_NONE, /* optinfo_flags */
4364 : TV_SHORTEN_BRANCH, /* tv_id */
4365 : 0, /* properties_required */
4366 : 0, /* properties_provided */
4367 : 0, /* properties_destroyed */
4368 : 0, /* todo_flags_start */
4369 : 0, /* todo_flags_finish */
4370 : };
4371 :
4372 : class pass_shorten_branches : public rtl_opt_pass
4373 : {
4374 : public:
4375 294536 : pass_shorten_branches (gcc::context *ctxt)
4376 589072 : : rtl_opt_pass (pass_data_shorten_branches, ctxt)
4377 : {}
4378 :
4379 : /* opt_pass methods: */
4380 1515922 : unsigned int execute (function *) final override
4381 : {
4382 1515922 : return rest_of_handle_shorten_branches ();
4383 : }
4384 :
4385 : }; // class pass_shorten_branches
4386 :
4387 : } // anon namespace
4388 :
4389 : rtl_opt_pass *
4390 294536 : make_pass_shorten_branches (gcc::context *ctxt)
4391 : {
4392 294536 : return new pass_shorten_branches (ctxt);
4393 : }
4394 :
4395 :
4396 : static unsigned int
4397 1516738 : rest_of_clean_state (void)
4398 : {
4399 1516738 : rtx_insn *insn, *next;
4400 1516738 : FILE *final_output = NULL;
4401 1516738 : int save_unnumbered = flag_dump_unnumbered;
4402 1516738 : int save_noaddr = flag_dump_noaddr;
4403 :
4404 1516738 : if (flag_dump_final_insns)
4405 : {
4406 4000 : final_output = fopen (flag_dump_final_insns, "a");
4407 4000 : if (!final_output)
4408 : {
4409 0 : error ("could not open final insn dump file %qs: %m",
4410 : flag_dump_final_insns);
4411 0 : flag_dump_final_insns = NULL;
4412 : }
4413 : else
4414 : {
4415 4000 : flag_dump_noaddr = flag_dump_unnumbered = 1;
4416 4000 : if (flag_compare_debug_opt || flag_compare_debug)
4417 3928 : dump_flags |= TDF_NOUID | TDF_COMPARE_DEBUG;
4418 4000 : dump_function_header (final_output, current_function_decl,
4419 : dump_flags);
4420 4000 : final_insns_dump_p = true;
4421 :
4422 158456 : for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
4423 154456 : if (LABEL_P (insn))
4424 5033 : INSN_UID (insn) = CODE_LABEL_NUMBER (insn);
4425 : else
4426 : {
4427 149423 : if (NOTE_P (insn))
4428 74299 : set_block_for_insn (insn, NULL);
4429 149423 : INSN_UID (insn) = 0;
4430 : }
4431 : }
4432 : }
4433 :
4434 : /* It is very important to decompose the RTL instruction chain here:
4435 : debug information keeps pointing into CODE_LABEL insns inside the function
4436 : body. If these remain pointing to the other insns, we end up preserving
4437 : whole RTL chain and attached detailed debug info in memory. */
4438 270287895 : for (insn = get_insns (); insn; insn = next)
4439 : {
4440 268771157 : next = NEXT_INSN (insn);
4441 268771157 : SET_NEXT_INSN (insn) = NULL;
4442 268771157 : SET_PREV_INSN (insn) = NULL;
4443 :
4444 268771157 : rtx_insn *call_insn = insn;
4445 268771157 : if (NONJUMP_INSN_P (call_insn)
4446 268771157 : && GET_CODE (PATTERN (call_insn)) == SEQUENCE)
4447 : {
4448 0 : rtx_sequence *seq = as_a <rtx_sequence *> (PATTERN (call_insn));
4449 0 : call_insn = seq->insn (0);
4450 : }
4451 268771157 : if (CALL_P (call_insn))
4452 : {
4453 6343147 : rtx note
4454 6343147 : = find_reg_note (call_insn, REG_CALL_ARG_LOCATION, NULL_RTX);
4455 6343147 : if (note)
4456 3359056 : remove_note (call_insn, note);
4457 : }
4458 :
4459 268771157 : if (final_output
4460 154456 : && (!NOTE_P (insn)
4461 74299 : || (NOTE_KIND (insn) != NOTE_INSN_VAR_LOCATION
4462 : && NOTE_KIND (insn) != NOTE_INSN_BEGIN_STMT
4463 74299 : && NOTE_KIND (insn) != NOTE_INSN_INLINE_ENTRY
4464 : && NOTE_KIND (insn) != NOTE_INSN_BLOCK_BEG
4465 : && NOTE_KIND (insn) != NOTE_INSN_BLOCK_END
4466 : && NOTE_KIND (insn) != NOTE_INSN_DELETED_DEBUG_LABEL)))
4467 119579 : print_rtl_single (final_output, insn);
4468 : }
4469 :
4470 1516738 : if (final_output)
4471 : {
4472 4000 : flag_dump_noaddr = save_noaddr;
4473 4000 : flag_dump_unnumbered = save_unnumbered;
4474 4000 : final_insns_dump_p = false;
4475 :
4476 4000 : if (fclose (final_output))
4477 : {
4478 0 : error ("could not close final insn dump file %qs: %m",
4479 : flag_dump_final_insns);
4480 0 : flag_dump_final_insns = NULL;
4481 : }
4482 : }
4483 :
4484 1516738 : flag_rerun_cse_after_global_opts = 0;
4485 1516738 : reload_completed = 0;
4486 1516738 : post_ra_split_completed = false;
4487 1516738 : epilogue_completed = 0;
4488 : #ifdef STACK_REGS
4489 1516738 : regstack_completed = 0;
4490 : #endif
4491 :
4492 : /* Clear out the insn_length contents now that they are no
4493 : longer valid. */
4494 1516738 : init_insn_lengths ();
4495 :
4496 : /* Show no temporary slots allocated. */
4497 1516738 : init_temp_slots ();
4498 :
4499 1516738 : free_bb_for_insn ();
4500 :
4501 1516738 : if (cfun->gimple_df)
4502 1516696 : delete_tree_ssa (cfun);
4503 :
4504 : /* We can reduce stack alignment on call site only when we are sure that
4505 : the function body just produced will be actually used in the final
4506 : executable. */
4507 1516738 : if (flag_ipa_stack_alignment
4508 1516738 : && decl_binds_to_current_def_p (current_function_decl))
4509 : {
4510 1257292 : unsigned int pref = crtl->preferred_stack_boundary;
4511 1257292 : if (crtl->stack_alignment_needed > crtl->preferred_stack_boundary)
4512 : pref = crtl->stack_alignment_needed;
4513 1257292 : cgraph_node::rtl_info (current_function_decl)
4514 1257292 : ->preferred_incoming_stack_boundary = pref;
4515 : }
4516 :
4517 : /* Make sure volatile mem refs aren't considered valid operands for
4518 : arithmetic insns. We must call this here if this is a nested inline
4519 : function, since the above code leaves us in the init_recog state,
4520 : and the function context push/pop code does not save/restore volatile_ok.
4521 :
4522 : ??? Maybe it isn't necessary for expand_start_function to call this
4523 : anymore if we do it here? */
4524 :
4525 1516738 : init_recog_no_volatile ();
4526 :
4527 : /* We're done with this function. Free up memory if we can. */
4528 1516738 : free_after_parsing (cfun);
4529 1516738 : free_after_compilation (cfun);
4530 1516738 : return 0;
4531 : }
4532 :
4533 : namespace {
4534 :
4535 : const pass_data pass_data_clean_state =
4536 : {
4537 : RTL_PASS, /* type */
4538 : "*clean_state", /* name */
4539 : OPTGROUP_NONE, /* optinfo_flags */
4540 : TV_FINAL, /* tv_id */
4541 : 0, /* properties_required */
4542 : 0, /* properties_provided */
4543 : PROP_rtl, /* properties_destroyed */
4544 : 0, /* todo_flags_start */
4545 : 0, /* todo_flags_finish */
4546 : };
4547 :
4548 : class pass_clean_state : public rtl_opt_pass
4549 : {
4550 : public:
4551 294536 : pass_clean_state (gcc::context *ctxt)
4552 589072 : : rtl_opt_pass (pass_data_clean_state, ctxt)
4553 : {}
4554 :
4555 : /* opt_pass methods: */
4556 1516738 : unsigned int execute (function *) final override
4557 : {
4558 1516738 : return rest_of_clean_state ();
4559 : }
4560 :
4561 : }; // class pass_clean_state
4562 :
4563 : } // anon namespace
4564 :
4565 : rtl_opt_pass *
4566 294536 : make_pass_clean_state (gcc::context *ctxt)
4567 : {
4568 294536 : return new pass_clean_state (ctxt);
4569 : }
4570 :
4571 : /* Return true if INSN is a call to the current function. */
4572 :
4573 : static bool
4574 829747 : self_recursive_call_p (rtx_insn *insn)
4575 : {
4576 829747 : tree fndecl = get_call_fndecl (insn);
4577 829747 : return (fndecl == current_function_decl
4578 829747 : && decl_binds_to_current_def_p (fndecl));
4579 : }
4580 :
4581 : /* Collect hard register usage for the current function. */
4582 :
4583 : static void
4584 963732 : collect_fn_hard_reg_usage (void)
4585 : {
4586 963732 : rtx_insn *insn;
4587 : #ifdef STACK_REGS
4588 963732 : int i;
4589 : #endif
4590 963732 : struct cgraph_rtl_info *node;
4591 963732 : HARD_REG_SET function_used_regs;
4592 :
4593 : /* ??? To be removed when all the ports have been fixed. */
4594 963732 : if (!targetm.call_fusage_contains_non_callee_clobbers)
4595 653178 : return;
4596 :
4597 : /* Be conservative - mark fixed and global registers as used. */
4598 963732 : function_used_regs = fixed_reg_set;
4599 :
4600 : #ifdef STACK_REGS
4601 : /* Handle STACK_REGS conservatively, since the df-framework does not
4602 : provide accurate information for them. */
4603 :
4604 8673588 : for (i = FIRST_STACK_REG; i <= LAST_STACK_REG; i++)
4605 7709856 : SET_HARD_REG_BIT (function_used_regs, i);
4606 : #endif
4607 :
4608 52812224 : for (insn = get_insns (); insn != NULL_RTX; insn = next_insn (insn))
4609 : {
4610 52501670 : HARD_REG_SET insn_used_regs;
4611 :
4612 52501670 : if (!NONDEBUG_INSN_P (insn))
4613 35092626 : continue;
4614 :
4615 17409044 : if (CALL_P (insn)
4616 17409044 : && !self_recursive_call_p (insn))
4617 826508 : function_used_regs
4618 1653016 : |= insn_callee_abi (insn).full_and_partial_reg_clobbers ();
4619 :
4620 17409044 : find_all_hard_reg_sets (insn, &insn_used_regs, false);
4621 17409044 : function_used_regs |= insn_used_regs;
4622 :
4623 34818088 : if (hard_reg_set_subset_p (crtl->abi->full_and_partial_reg_clobbers (),
4624 : function_used_regs))
4625 653178 : return;
4626 : }
4627 :
4628 : /* Mask out fully-saved registers, so that they don't affect equality
4629 : comparisons between function_abis. */
4630 310554 : function_used_regs &= crtl->abi->full_and_partial_reg_clobbers ();
4631 :
4632 310554 : node = cgraph_node::rtl_info (current_function_decl);
4633 310554 : gcc_assert (node != NULL);
4634 :
4635 310554 : node->function_used_regs = function_used_regs;
4636 : }
|
