/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/align.h

Bug Summary

File:	build/gcc/align.h
Warning:	line 33, column 16 The result of the left shift is undefined because the right operand is negative

Annotated Source Code

Press '?' to see keyboard shortcuts

Show analyzer invocation

clang -cc1 -cc1 -triple x86_64-suse-linux -analyze -disable-free -clear-ast-before-backend -disable-llvm-verifier -discard-value-names -main-file-name final.cc -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -analyzer-config-compatibility-mode=true -mrelocation-model static -mframe-pointer=none -fmath-errno -ffp-contract=on -fno-rounding-math -mconstructor-aliases -funwind-tables=2 -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -fcoverage-compilation-dir=/buildworker/marxinbox-gcc-clang-static-analyzer/objdir/gcc -resource-dir /usr/lib64/clang/15.0.7 -D IN_GCC -D HAVE_CONFIG_H -I . -I . -I /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc -I /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/. -I /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../include -I /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../libcpp/include -I /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../libcody -I /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../libdecnumber -I /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../libdecnumber/bid -I ../libdecnumber -I /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../libbacktrace -internal-isystem /usr/bin/../lib64/gcc/x86_64-suse-linux/13/../../../../include/c++/13 -internal-isystem /usr/bin/../lib64/gcc/x86_64-suse-linux/13/../../../../include/c++/13/x86_64-suse-linux -internal-isystem /usr/bin/../lib64/gcc/x86_64-suse-linux/13/../../../../include/c++/13/backward -internal-isystem /usr/lib64/clang/15.0.7/include -internal-isystem /usr/local/include -internal-isystem /usr/bin/../lib64/gcc/x86_64-suse-linux/13/../../../../x86_64-suse-linux/include -internal-externc-isystem /include -internal-externc-isystem /usr/include -O2 -Wno-narrowing -Wwrite-strings -Wno-long-long -Wno-variadic-macros -Wno-overlength-strings -fdeprecated-macro -fdebug-compilation-dir=/buildworker/marxinbox-gcc-clang-static-analyzer/objdir/gcc -ferror-limit 19 -fno-rtti -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -analyzer-output=plist-html -analyzer-config silence-checkers=core.NullDereference -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /buildworker/marxinbox-gcc-clang-static-analyzer/objdir/clang-static-analyzer/2023-03-27-141847-20772-1/report-X1seDU.plist -x c++ /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc

/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc

→

1/* Convert RTL to assembler code and output it, for GNU compiler.
 Copyright (C) 1987-2023 Free Software Foundation, Inc.

4This file is part of GCC.

6GCC is free software; you can redistribute it and/or modify it under
7the terms of the GNU General Public License as published by the Free
8Software Foundation; either version 3, or (at your option) any later
9version.

11GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12WARRANTY; without even the implied warranty of MERCHANTABILITY or
13FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
14for more details.

16You should have received a copy of the GNU General Public License
17along with GCC; see the file COPYING3.  If not see
18<http://www.gnu.org/licenses/>.  */

20/* This is the final pass of the compiler.
 It looks at the rtl code for a function and outputs assembler code.

 Call `final_start_function' to output the assembler code for function entry,
 `final' to output assembler code for some RTL code,
 `final_end_function' to output assembler code for function exit.
 If a function is compiled in several pieces, each piece is
 output separately with `final'.

 Some optimizations are also done at this level.
 Move instructions that were made unnecessary by good register allocation
 are detected and omitted from the output.  (Though most of these
 are removed by the last jump pass.)

 Instructions to set the condition codes are omitted when it can be
 seen that the condition codes already had the desired values.

 In some cases it is sufficient if the inherited condition codes
 have related values, but this may require the following insn
 (the one that tests the condition codes) to be modified.

 The code for the function prologue and epilogue are generated
 directly in assembler by the target functions function_prologue and
 function_epilogue.  Those instructions never exist as rtl.  */

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"

86#include "dwarf2out.h"

88/* Most ports don't need to define CC_STATUS_INIT.
 So define a null default for it to save conditionalization later.  */
90#ifndef CC_STATUS_INIT
91#define CC_STATUS_INIT
92#endif

94/* Is the given character a logical line separator for the assembler?  */
95#ifndef IS_ASM_LOGICAL_LINE_SEPARATOR
96#define IS_ASM_LOGICAL_LINE_SEPARATOR(C, STR)((C) == ';') ((C) == ';')
97#endif

99#ifndef JUMP_TABLES_IN_TEXT_SECTION(global_options.x_flag_pic && !(((global_options.x_ix86_isa_flags
 & (1UL << 1)) != 0) || 1))
100#define JUMP_TABLES_IN_TEXT_SECTION(global_options.x_flag_pic && !(((global_options.x_ix86_isa_flags
 & (1UL << 1)) != 0) || 1)) 0
101#endif

103/* Bitflags used by final_scan_insn.  */
104#define SEEN_NOTE1	1
105#define SEEN_EMITTED2	2
106#define SEEN_NEXT_VIEW4	4

108/* Last insn processed by final_scan_insn.  */
109static rtx_insn *debug_insn;
110rtx_insn *current_output_insn;

112/* Line number of last NOTE.  */
113static int last_linenum;

115/* Column number of last NOTE.  */
116static int last_columnnum;

118/* Discriminator written to assembly.  */
119static int last_discriminator;

121/* Compute discriminator to be written to assembly for current instruction.
 Note: actual usage depends on loc_discriminator_kind setting.  */
123static inline int compute_discriminator (location_t loc);

125/* Highest line number in current block.  */
126static int high_block_linenum;

128/* Likewise for function.  */
129static int high_function_linenum;

131/* Filename of last NOTE.  */
132static const char *last_filename;

134/* Override filename, line and column number.  */
135static const char *override_filename;
136static int override_linenum;
137static int override_columnnum;
138static int override_discriminator;

140/* Whether to force emission of a line note before the next insn.  */
141static bool force_source_line = false;

143extern const int length_unit_log; /* This is defined in insn-attrtab.cc.  */

145/* Nonzero while outputting an `asm' with operands.
 This means that inconsistencies are the user's fault, so don't die.
 The precise value is the insn being output, to pass to error_for_asm.  */
148const rtx_insn *this_is_asm_operands;

150/* Number of operands of this insn, for an `asm' with operands.  */
151static unsigned int insn_noperands;

153/* Compare optimization flag.  */

155static rtx last_ignored_compare = 0;

157/* Assign a unique number to each insn that is output.
 This can be used to generate unique local labels.  */

160static int insn_counter = 0;

162/* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen.  */

164static int block_depth;

166/* Nonzero if have enabled APP processing of our assembler output.  */

168static int app_on;

170/* If we are outputting an insn sequence, this contains the sequence rtx.
 Zero otherwise.  */

173rtx_sequence *final_sequence;

175#ifdef ASSEMBLER_DIALECT(global_options.x_ix86_asm_dialect)

177/* Number of the assembler dialect to use, starting at 0.  */
178static int dialect_number;
179#endif

181/* Nonnull if the insn currently being emitted was a COND_EXEC pattern.  */
182rtx current_insn_predicate;

184/* True if printing into -fdump-final-insns= dump.  */
185bool final_insns_dump_p;

187/* True if profile_function should be called, but hasn't been called yet.  */
188static bool need_profile_function;

190static int asm_insn_count (rtx);
191static void profile_function (FILE *);
192static void profile_after_prologue (FILE *);
193static bool notice_source_line (rtx_insn *, bool *);
194static rtx walk_alter_subreg (rtx *, bool *);
195static void output_asm_name (void);
196static void output_alternate_entry_point (FILE *, rtx_insn *);
197static tree get_mem_expr_from_op (rtx, int *);
198static void output_asm_operand_names (rtx *, int *, int);
199#ifdef LEAF_REGISTERS
200static void leaf_renumber_regs (rtx_insn *);
201#endif
202static int align_fuzz (rtx, rtx, int, unsigned);
203static void collect_fn_hard_reg_usage (void);
204
205/* Initialize data in final at the beginning of a compilation.  */

207void
208init_final (const char *filename ATTRIBUTE_UNUSED__attribute__ ((__unused__)))
209{
app_on = 0;
final_sequence = 0;

213#ifdef ASSEMBLER_DIALECT(global_options.x_ix86_asm_dialect)
dialect_number = ASSEMBLER_DIALECT(global_options.x_ix86_asm_dialect);
215#endif
216}

218/* Default target function prologue and epilogue assembler output.

 If not overridden for epilogue code, then the function body itself
 contains return instructions wherever needed.  */
222void
223default_function_pro_epilogue (FILE *)
224{
225}

227void
228default_function_switched_text_sections (FILE *file ATTRIBUTE_UNUSED__attribute__ ((__unused__)),
			 tree decl ATTRIBUTE_UNUSED__attribute__ ((__unused__)),
			 bool new_is_cold ATTRIBUTE_UNUSED__attribute__ ((__unused__)))
231{
232}

234/* Default target hook that outputs nothing to a stream.  */
235void
236no_asm_to_stream (FILE *file ATTRIBUTE_UNUSED__attribute__ ((__unused__)))
237{
238}

240/* Enable APP processing of subsequent output.
 Used before the output from an `asm' statement.  */

243void
244app_enable (void)
245{
if (! app_on)
  {
    fputs (ASM_APP_ON"#APP\n", asm_out_file);
    app_on = 1;
  }
251}

253/* Disable APP processing of subsequent output.
 Called from varasm.cc before most kinds of output.  */

256void
257app_disable (void)
258{
if (app_on)
  {
    fputs (ASM_APP_OFF"#NO_APP\n", asm_out_file);
    app_on = 0;
  }
264}
265
266/* Return the number of slots filled in the current
 delayed branch sequence (we don't count the insn needing the
 delay slot).   Zero if not in a delayed branch sequence.  */

270int
271dbr_sequence_length (void)
272{
if (final_sequence != 0)
  return XVECLEN (final_sequence, 0)(((((final_sequence)->u.fld[0]).rt_rtvec))->num_elem) - 1;
else
  return 0;
277}
278
279/* The next two pages contain routines used to compute the length of an insn
 and to shorten branches.  */

282/* Arrays for insn lengths, and addresses.  The latter is referenced by
 `insn_current_length'.  */

285static int *insn_lengths;

287vec<int> insn_addresses_;

289/* Max uid for which the above arrays are valid.  */
290static int insn_lengths_max_uid;

292/* Address of insn being processed.  Used by `insn_current_length'.  */
293int insn_current_address;

295/* Address of insn being processed in previous iteration.  */
296int insn_last_address;

298/* known invariant alignment of insn being processed.  */
299int insn_current_align;

301/* After shorten_branches, for any insn, uid_align[INSN_UID (insn)]
 gives the next following alignment insn that increases the known
 alignment, or NULL_RTX if there is no such insn.
 For any alignment obtained this way, we can again index uid_align with
 its uid to obtain the next following align that in turn increases the
 alignment, till we reach NULL_RTX; the sequence obtained this way
 for each insn we'll call the alignment chain of this insn in the following
 comments.  */

310static rtx *uid_align;
311static int *uid_shuid;
312static vec<align_flags> label_align;

314/* Indicate that branch shortening hasn't yet been done.  */

316void
317init_insn_lengths (void)
318{
if (uid_shuid)
  {
    free (uid_shuid);
    uid_shuid = 0;
  }
if (insn_lengths)
  {
    free (insn_lengths);
    insn_lengths = 0;
    insn_lengths_max_uid = 0;
  }
if (HAVE_ATTR_length1)
  INSN_ADDRESSES_FREE ()(insn_addresses_.release ());
if (uid_align)
  {
    free (uid_align);
    uid_align = 0;
  }
337}

339/* Obtain the current length of an insn.  If branch shortening has been done,
 get its actual length.  Otherwise, use FALLBACK_FN to calculate the
 length.  */
342static int
343get_attr_length_1 (rtx_insn *insn, int (*fallback_fn) (rtx_insn *))
344{
rtx body;
int i;
int length = 0;

if (!HAVE_ATTR_length1)
  return 0;

if (insn_lengths_max_uid > INSN_UID (insn))
  return insn_lengths[INSN_UID (insn)];
else
  switch (GET_CODE (insn)((enum rtx_code) (insn)->code))
    {
    case NOTE:
    case BARRIER:
    case CODE_LABEL:
    case DEBUG_INSN:
return 0;

    case CALL_INSN:
    case JUMP_INSN:
length = fallback_fn (insn);
break;

    case INSN:
body = PATTERN (insn);
if (GET_CODE (body)((enum rtx_code) (body)->code) == USE || GET_CODE (body)((enum rtx_code) (body)->code) == CLOBBER)
 return 0;

else if (GET_CODE (body)((enum rtx_code) (body)->code) == ASM_INPUT || asm_noperands (body) >= 0)
 length = asm_insn_count (body) * fallback_fn (insn);
else if (rtx_sequence *seq = dyn_cast <rtx_sequence *> (body))
 for (i = 0; i < seq->len (); i++)
   length += get_attr_length_1 (seq->insn (i), fallback_fn);
else
 length = fallback_fn (insn);
break;

    default:
break;
    }

386#ifdef ADJUST_INSN_LENGTH
ADJUST_INSN_LENGTH (insn, length);
388#endif
return length;
390}

392/* Obtain the current length of an insn.  If branch shortening has been done,
 get its actual length.  Otherwise, get its maximum length.  */
394int
395get_attr_length (rtx_insn *insn)
396{
return get_attr_length_1 (insn, insn_default_length);
398}

400/* Obtain the current length of an insn.  If branch shortening has been done,
 get its actual length.  Otherwise, get its minimum length.  */
402int
403get_attr_min_length (rtx_insn *insn)
404{
return get_attr_length_1 (insn, insn_min_length);
406}
407
408/* Code to handle alignment inside shorten_branches.  */

410/* Here is an explanation how the algorithm in align_fuzz can give
 proper results:

 Call a sequence of instructions beginning with alignment point X
 and continuing until the next alignment point `block X'.  When `X'
 is used in an expression, it means the alignment value of the
 alignment point.

 Call the distance between the start of the first insn of block X, and
 the end of the last insn of block X `IX', for the `inner size of X'.
 This is clearly the sum of the instruction lengths.

 Likewise with the next alignment-delimited block following X, which we
 shall call block Y.

 Call the distance between the start of the first insn of block X, and
 the start of the first insn of block Y `OX', for the `outer size of X'.

 The estimated padding is then OX - IX.

 OX can be safely estimated as

         if (X >= Y)
                 OX = round_up(IX, Y)
         else
                 OX = round_up(IX, X) + Y - X

 Clearly est(IX) >= real(IX), because that only depends on the
 instruction lengths, and those being overestimated is a given.

 Clearly round_up(foo, Z) >= round_up(bar, Z) if foo >= bar, so
 we needn't worry about that when thinking about OX.

 When X >= Y, the alignment provided by Y adds no uncertainty factor
 for branch ranges starting before X, so we can just round what we have.
 But when X < Y, we don't know anything about the, so to speak,
 `middle bits', so we have to assume the worst when aligning up from an
 address mod X to one mod Y, which is Y - X.  */

449#ifndef LABEL_ALIGN
450#define LABEL_ALIGN(LABEL)(this_target_flag_state->x_align_labels) align_labels(this_target_flag_state->x_align_labels)
451#endif

453#ifndef LOOP_ALIGN
454#define LOOP_ALIGN(LABEL)(this_target_flag_state->x_align_loops) align_loops(this_target_flag_state->x_align_loops)
455#endif

457#ifndef LABEL_ALIGN_AFTER_BARRIER
458#define LABEL_ALIGN_AFTER_BARRIER(LABEL)0 0
459#endif

461#ifndef JUMP_ALIGN
462#define JUMP_ALIGN(LABEL)(this_target_flag_state->x_align_jumps) align_jumps(this_target_flag_state->x_align_jumps)
463#endif

465#ifndef ADDR_VEC_ALIGN
466static int
467final_addr_vec_align (rtx_jump_table_data *addr_vec)
468{
int align = GET_MODE_SIZE (addr_vec->get_data_mode ());

if (align > BIGGEST_ALIGNMENT(((global_options.x_target_flags & (1U << 12)) != 0
) ? 32 : (((global_options.x_ix86_isa_flags & (1UL <<
 15)) != 0) ? 512 : (((global_options.x_ix86_isa_flags & (
1UL << 8)) != 0) ? 256 : 128))) / BITS_PER_UNIT(8))
38
←
Assuming the condition is true→
39
←
'?' condition is true→
40
←
Assuming the condition is false→
41
←
Taking false branch→
  align = BIGGEST_ALIGNMENT(((global_options.x_target_flags & (1U << 12)) != 0
) ? 32 : (((global_options.x_ix86_isa_flags & (1UL <<
 15)) != 0) ? 512 : (((global_options.x_ix86_isa_flags & (
1UL << 8)) != 0) ? 256 : 128))) / BITS_PER_UNIT(8);
return exact_log2 (align);
42
←
Calling 'exact_log2'→
45
←
Returning from 'exact_log2'→
46
←
Returning the value -1→

475}

477#define ADDR_VEC_ALIGN(ADDR_VEC)final_addr_vec_align (ADDR_VEC) final_addr_vec_align (ADDR_VEC)
478#endif

480#ifndef INSN_LENGTH_ALIGNMENT
481#define INSN_LENGTH_ALIGNMENT(INSN)length_unit_log length_unit_log
482#endif

484#define INSN_SHUID(INSN)(uid_shuid[INSN_UID (INSN)]) (uid_shuid[INSN_UID (INSN)])

486static int min_labelno, max_labelno;

488#define LABEL_TO_ALIGNMENT(LABEL)(label_align[(((LABEL)->u.fld[5]).rt_int) - min_labelno]) \
(label_align[CODE_LABEL_NUMBER (LABEL)(((LABEL)->u.fld[5]).rt_int) - min_labelno])

491/* For the benefit of port specific code do this also as a function.  */

493align_flags
494label_to_alignment (rtx label)
495{
if (CODE_LABEL_NUMBER (label)(((label)->u.fld[5]).rt_int) <= max_labelno)
  return LABEL_TO_ALIGNMENT (label)(label_align[(((label)->u.fld[5]).rt_int) - min_labelno]);
return align_flags ();
499}

501/* The differences in addresses
 between a branch and its target might grow or shrink depending on
 the alignment the start insn of the range (the branch for a forward
 branch or the label for a backward branch) starts out on; if these
 differences are used naively, they can even oscillate infinitely.
 We therefore want to compute a 'worst case' address difference that
 is independent of the alignment the start insn of the range end
 up on, and that is at least as large as the actual difference.
 The function align_fuzz calculates the amount we have to add to the
 naively computed difference, by traversing the part of the alignment
 chain of the start insn of the range that is in front of the end insn
 of the range, and considering for each alignment the maximum amount
 that it might contribute to a size increase.

 For casesi tables, we also want to know worst case minimum amounts of
 address difference, in case a machine description wants to introduce
 some common offset that is added to all offsets in a table.
 For this purpose, align_fuzz with a growth argument of 0 computes the
 appropriate adjustment.  */

521/* Compute the maximum delta by which the difference of the addresses of
 START and END might grow / shrink due to a different address for start
 which changes the size of alignment insns between START and END.
 KNOWN_ALIGN_LOG is the alignment known for START.
 GROWTH should be ~0 if the objective is to compute potential code size
 increase, and 0 if the objective is to compute potential shrink.
 The return value is undefined for any other value of GROWTH.  */

529static int
530align_fuzz (rtx start, rtx end, int known_align_log, unsigned int growth)
531{
int uid = INSN_UID (start);
rtx align_label;
int known_align = 1 << known_align_log;
int end_shuid = INSN_SHUID (end)(uid_shuid[INSN_UID (end)]);
int fuzz = 0;

for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
  {
    int align_addr, new_align;

    uid = INSN_UID (align_label);
    align_addr = INSN_ADDRESSES (uid)(insn_addresses_[uid]) - insn_lengths[uid];
    if (uid_shuid[uid] > end_shuid)
break;
    align_flags alignment = LABEL_TO_ALIGNMENT (align_label)(label_align[(((align_label)->u.fld[5]).rt_int) - min_labelno
]);
    new_align = 1 << alignment.levels[0].log;
    if (new_align < known_align)
continue;
    fuzz += (-align_addr ^ growth) & (new_align - known_align);
    known_align = new_align;
  }
return fuzz;
554}

556/* Compute a worst-case reference address of a branch so that it
 can be safely used in the presence of aligned labels.  Since the
 size of the branch itself is unknown, the size of the branch is
 not included in the range.  I.e. for a forward branch, the reference
 address is the end address of the branch as known from the previous
 branch shortening pass, minus a value to account for possible size
 increase due to alignment.  For a backward branch, it is the start
 address of the branch as known from the current pass, plus a value
 to account for possible size increase due to alignment.
 NB.: Therefore, the maximum offset allowed for backward branches needs
 to exclude the branch size.  */

568int
569insn_current_reference_address (rtx_insn *branch)
570{
rtx dest;
int seq_uid;

if (! INSN_ADDRESSES_SET_P ()(insn_addresses_.exists ()))
  return 0;

rtx_insn *seq = NEXT_INSN (PREV_INSN (branch));
seq_uid = INSN_UID (seq);
if (!jump_to_label_p (branch))
  /* This can happen for example on the PA; the objective is to know the
     offset to address something in front of the start of the function.
     Thus, we can treat it like a backward branch.
     We assume here that FUNCTION_BOUNDARY / BITS_PER_UNIT is larger than
     any alignment we'd encounter, so we skip the call to align_fuzz.  */
  return insn_current_address;
dest = JUMP_LABEL (branch)(((branch)->u.fld[7]).rt_rtx);

/* BRANCH has no proper alignment chain set, so use SEQ.
   BRANCH also has no INSN_SHUID.  */
if (INSN_SHUID (seq)(uid_shuid[INSN_UID (seq)]) < INSN_SHUID (dest)(uid_shuid[INSN_UID (dest)]))
  {
    /* Forward branch.  */
    return (insn_last_address + insn_lengths[seq_uid]
     - align_fuzz (seq, dest, length_unit_log, ~0));
  }
else
  {
    /* Backward branch.  */
    return (insn_current_address
     + align_fuzz (dest, seq, length_unit_log, ~0));
  }
602}
603
604/* Compute branch alignments based on CFG profile.  */

606unsigned int
607compute_alignments (void)
608{
basic_block bb;
align_flags max_alignment;

label_align.truncate (0);

max_labelno = max_label_num ();
min_labelno = get_first_label_num ();
label_align.safe_grow_cleared (max_labelno - min_labelno + 1, true);

/* If not optimizing or optimizing for size, don't assign any alignments.  */
if (! optimizeglobal_options.x_optimize || optimize_function_for_size_p (cfun(cfun + 0)))
  return 0;

if (dump_file)
  {
    dump_reg_info (dump_file);
    dump_flow_info (dump_file, TDF_DETAILS);
    flow_loops_dump (dump_file, NULL__null, 1);
  }
loop_optimizer_init (AVOID_CFG_MODIFICATIONS(LOOPS_MAY_HAVE_MULTIPLE_LATCHES));
profile_count count_threshold = cfun(cfun + 0)->cfg->count_max / param_align_thresholdglobal_options.x_param_align_threshold;

if (dump_file)
  {
    fprintf (dump_file, "count_max: ");
    cfun(cfun + 0)->cfg->count_max.dump (dump_file);
    fprintf (dump_file, "\n");
  }
FOR_EACH_BB_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_entry_block_ptr->next_bb
; bb != ((cfun + 0))->cfg->x_exit_block_ptr; bb = bb->
next_bb)
  {
    rtx_insn *label = BB_HEAD (bb)(bb)->il.x.head_;
    bool has_fallthru = 0;
    edge e;
    edge_iterator ei;

    if (!LABEL_P (label)(((enum rtx_code) (label)->code) == CODE_LABEL)
 || optimize_bb_for_size_p (bb))
{
 if (dump_file)
   fprintf (dump_file,
     "BB %4i loop %2i loop_depth %2i skipped.\n",
     bb->index,
     bb->loop_father->num,
     bb_loop_depth (bb));
 continue;
}
    max_alignment = LABEL_ALIGN (label)(this_target_flag_state->x_align_labels);
    profile_count fallthru_count = profile_count::zero ();
    profile_count branch_count = profile_count::zero ();

    FOR_EACH_EDGE (e, ei, bb->preds)for ((ei) = ei_start_1 (&((bb->preds))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
{
 if (e->flags & EDGE_FALLTHRU)
   has_fallthru = 1, fallthru_count += e->count ();
 else
   branch_count += e->count ();
}
    if (dump_file)
{
 fprintf (dump_file, "BB %4i loop %2i loop_depth"
   " %2i fall ",
   bb->index, bb->loop_father->num,
   bb_loop_depth (bb));
 fallthru_count.dump (dump_file);
 fprintf (dump_file, " branch ");
 branch_count.dump (dump_file);
 if (!bb->loop_father->inner && bb->loop_father->num)
   fprintf (dump_file, " inner_loop");
 if (bb->loop_father->header == bb)
   fprintf (dump_file, " loop_header");
 fprintf (dump_file, "\n");
}
    if (!fallthru_count.initialized_p () || !branch_count.initialized_p ())
continue;

    /* There are two purposes to align block with no fallthru incoming edge:
1) to avoid fetch stalls when branch destination is near cache boundary
2) to improve cache efficiency in case the previous block is not executed
   (so it does not need to be in the cache).

We to catch first case, we align frequently executed blocks.
To catch the second, we align blocks that are executed more frequently
than the predecessor and the predecessor is likely to not be executed
when function is called.  */

    if (!has_fallthru
 && (branch_count > count_threshold
     || (bb->count > bb->prev_bb->count * 10
  && (bb->prev_bb->count
      <= ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr)->count / 2))))
{
 align_flags alignment = JUMP_ALIGN (label)(this_target_flag_state->x_align_jumps);
 if (dump_file)
   fprintf (dump_file, "  jump alignment added.\n");
 max_alignment = align_flags::max (max_alignment, alignment);
}
    /* In case block is frequent and reached mostly by non-fallthru edge,
align it.  It is most likely a first block of loop.  */
    if (has_fallthru
 && !(single_succ_p (bb)
      && single_succ (bb) == EXIT_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_exit_block_ptr))
 && optimize_bb_for_speed_p (bb)
 && branch_count + fallthru_count > count_threshold
 && (branch_count > fallthru_count * param_align_loop_iterationsglobal_options.x_param_align_loop_iterations))
{
 align_flags alignment = LOOP_ALIGN (label)(this_target_flag_state->x_align_loops);
 if (dump_file)
   fprintf (dump_file, "  internal loop alignment added.\n");
 max_alignment = align_flags::max (max_alignment, alignment);
}
    LABEL_TO_ALIGNMENT (label)(label_align[(((label)->u.fld[5]).rt_int) - min_labelno]) = max_alignment;
  }

loop_optimizer_finalize ();
free_dominance_info (CDI_DOMINATORS);
return 0;
725}

727/* Grow the LABEL_ALIGN array after new labels are created.  */

729static void
730grow_label_align (void)
731{
int old = max_labelno;
int n_labels;
int n_old_labels;

max_labelno = max_label_num ();

n_labels = max_labelno - min_labelno + 1;
n_old_labels = old - min_labelno + 1;

label_align.safe_grow_cleared (n_labels, true);

/* Range of labels grows monotonically in the function.  Failing here
   means that the initialization of array got lost.  */
gcc_assert (n_old_labels <= n_labels)((void)(!(n_old_labels <= n_labels) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 745, __FUNCTION__), 0 : 0));
746}

748/* Update the already computed alignment information.  LABEL_PAIRS is a vector
 made up of pairs of labels for which the alignment information of the first
 element will be copied from that of the second element.  */

752void
753update_alignments (vec<rtx> &label_pairs)
754{
unsigned int i = 0;
rtx iter, label = NULL_RTX(rtx) 0;

if (max_labelno != max_label_num ())
  grow_label_align ();

FOR_EACH_VEC_ELT (label_pairs, i, iter)for (i = 0; (label_pairs).iterate ((i), &(iter)); ++(i))
  if (i & 1)
    LABEL_TO_ALIGNMENT (label)(label_align[(((label)->u.fld[5]).rt_int) - min_labelno]) = LABEL_TO_ALIGNMENT (iter)(label_align[(((iter)->u.fld[5]).rt_int) - min_labelno]);
  else
    label = iter;
766}

768namespace {

770const pass_data pass_data_compute_alignments =
771{
RTL_PASS, /* type */
"alignments", /* name */
OPTGROUP_NONE, /* optinfo_flags */
TV_NONE, /* tv_id */
0, /* properties_required */
0, /* properties_provided */
0, /* properties_destroyed */
0, /* todo_flags_start */
0, /* todo_flags_finish */
781};

783class pass_compute_alignments : public rtl_opt_pass
784{
785public:
pass_compute_alignments (gcc::context *ctxt)
  : rtl_opt_pass (pass_data_compute_alignments, ctxt)
{}

/* opt_pass methods: */
unsigned int execute (function *) final override
{
  return compute_alignments ();
}

796}; // class pass_compute_alignments

798} // anon namespace

800rtl_opt_pass *
801make_pass_compute_alignments (gcc::context *ctxt)
802{
return new pass_compute_alignments (ctxt);
804}

806
807/* Make a pass over all insns and compute their actual lengths by shortening
 any branches of variable length if possible.  */

810/* shorten_branches might be called multiple times:  for example, the SH
 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
 In order to do this, it needs proper length information, which it obtains
 by calling shorten_branches.  This cannot be collapsed with
 shorten_branches itself into a single pass unless we also want to integrate
 reorg.cc, since the branch splitting exposes new instructions with delay
 slots.  */

818void
819shorten_branches (rtx_insn *first)
820{
rtx_insn *insn;
int max_uid;
int i;
rtx_insn *seq;
int something_changed = 1;
char *varying_length;
rtx body;
int uid;
rtx align_tab[MAX_CODE_ALIGN16 + 1];

/* Compute maximum UID and allocate label_align / uid_shuid.  */
max_uid = get_max_uid ();

/* Free uid_shuid before reallocating it.  */
free (uid_shuid);

uid_shuid = XNEWVEC (int, max_uid)((int *) xmalloc (sizeof (int) * (max_uid)));

if (max_labelno != max_label_num ())
1
Assuming the condition is false→
2
←
Taking false branch→
  grow_label_align ();

/* Initialize label_align and set up uid_shuid to be strictly
   monotonically rising with insn order.  */
/* We use alignment here to keep track of the maximum alignment we want to
   impose on the next CODE_LABEL (or the current one if we are processing
   the CODE_LABEL itself).  */

align_flags max_alignment;

for (insn = get_insns (), i = 1; insn; insn = NEXT_INSN (insn))
3
←
Loop condition is true.  Entering loop body→
  {
    INSN_SHUID (insn)(uid_shuid[INSN_UID (insn)]) = i++;
    if (INSN_P (insn)(((((enum rtx_code) (insn)->code) == INSN) || (((enum rtx_code
) (insn)->code) == JUMP_INSN) || (((enum rtx_code) (insn)->
code) == CALL_INSN)) || (((enum rtx_code) (insn)->code) ==
 DEBUG_INSN)))
4
←
Assuming field 'code' is not equal to INSN→
5
←
Assuming field 'code' is not equal to JUMP_INSN→
6
←
Assuming field 'code' is not equal to CALL_INSN→
7
←
Assuming field 'code' is not equal to DEBUG_INSN→
8
←
Taking false branch→
continue;

    if (rtx_code_label *label12.1
'label' is non-null
1
'label' is non-null
1
'label' is non-null
1
'label' is non-null
1
'label' is non-null
 = dyn_cast <rtx_code_label *> (insn))
9
←
Calling 'dyn_cast<rtx_code_label *, rtx_insn>'→
12
←
Returning from 'dyn_cast<rtx_code_label *, rtx_insn>'→
13
←
Taking true branch→
{
 /* Merge in alignments computed by compute_alignments.  */
 align_flags alignment = LABEL_TO_ALIGNMENT (label)(label_align[(((label)->u.fld[5]).rt_int) - min_labelno]);
 max_alignment = align_flags::max (max_alignment, alignment);

 rtx_jump_table_data *table = jump_table_for_label (label);
14
←
Calling 'jump_table_for_label'→
33
←
Returning from 'jump_table_for_label'→
 if (!table33.1
'table' is non-null
1
'table' is non-null
1
'table' is non-null
1
'table' is non-null
1
'table' is non-null
)
   {
     align_flags alignment = LABEL_ALIGN (label)(this_target_flag_state->x_align_labels);
     max_alignment = align_flags::max (max_alignment, alignment);
   }
 /* ADDR_VECs only take room if read-only data goes into the text
    section.  */
 if ((JUMP_TABLES_IN_TEXT_SECTION(global_options.x_flag_pic && !(((global_options.x_ix86_isa_flags
 & (1UL << 1)) != 0) || 1))
34
←
Assuming field 'x_flag_pic' is 0→
36
←
Taking true branch→
      || readonly_data_section == text_section)
35
←
Assuming 'readonly_data_section' is equal to 'text_section'→
     && table35.1
'table' is non-null
1
'table' is non-null
1
'table' is non-null
1
'table' is non-null
1
'table' is non-null
)
   {
     align_flags alignment = align_flags (ADDR_VEC_ALIGN (table)final_addr_vec_align (table));
37
←
Calling 'final_addr_vec_align'→
47
←
Returning from 'final_addr_vec_align'→
48
←
Passing the value -1 via 1st parameter 'log0'→
49
←
Calling default constructor for 'align_flags'→
     max_alignment = align_flags::max (max_alignment, alignment);
   }
 LABEL_TO_ALIGNMENT (label)(label_align[(((label)->u.fld[5]).rt_int) - min_labelno]) = max_alignment;
 max_alignment = align_flags ();
}
    else if (BARRIER_P (insn)(((enum rtx_code) (insn)->code) == BARRIER))
{
 rtx_insn *label;

 for (label = insn; label && ! INSN_P (label)(((((enum rtx_code) (label)->code) == INSN) || (((enum rtx_code
) (label)->code) == JUMP_INSN) || (((enum rtx_code) (label
)->code) == CALL_INSN)) || (((enum rtx_code) (label)->code
) == DEBUG_INSN));
      label = NEXT_INSN (label))
   if (LABEL_P (label)(((enum rtx_code) (label)->code) == CODE_LABEL))
     {
align_flags alignment
  = align_flags (LABEL_ALIGN_AFTER_BARRIER (insn)0);
max_alignment = align_flags::max (max_alignment, alignment);
break;
     }
}
  }
if (!HAVE_ATTR_length1)
  return;

/* Allocate the rest of the arrays.  */
insn_lengths = XNEWVEC (int, max_uid)((int *) xmalloc (sizeof (int) * (max_uid)));
insn_lengths_max_uid = max_uid;
/* Syntax errors can lead to labels being outside of the main insn stream.
   Initialize insn_addresses, so that we get reproducible results.  */
INSN_ADDRESSES_ALLOC (max_uid)do { insn_addresses_.create (max_uid); insn_addresses_.safe_grow_cleared
 (max_uid, true); memset (insn_addresses_.address (), 0, sizeof
 (int) * max_uid); } while (0);

varying_length = XCNEWVEC (char, max_uid)((char *) xcalloc ((max_uid), sizeof (char)));

/* Initialize uid_align.  We scan instructions
   from end to start, and keep in align_tab[n] the last seen insn
   that does an alignment of at least n+1, i.e. the successor
   in the alignment chain for an insn that does / has a known
   alignment of n.  */
uid_align = XCNEWVEC (rtx, max_uid)((rtx *) xcalloc ((max_uid), sizeof (rtx)));

for (i = MAX_CODE_ALIGN16 + 1; --i >= 0;)
  align_tab[i] = NULL_RTX(rtx) 0;
seq = get_last_insn ();
for (; seq; seq = PREV_INSN (seq))
  {
    int uid = INSN_UID (seq);
    int log;
    log = (LABEL_P (seq)(((enum rtx_code) (seq)->code) == CODE_LABEL) ? LABEL_TO_ALIGNMENT (seq)(label_align[(((seq)->u.fld[5]).rt_int) - min_labelno]).levels[0].log : 0);
    uid_align[uid] = align_tab[0];
    if (log)
{
 /* Found an alignment label.  */
 gcc_checking_assert (log < MAX_CODE_ALIGN + 1)((void)(!(log < 16 + 1) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 926, __FUNCTION__), 0 : 0));
 uid_align[uid] = align_tab[log];
 for (i = log - 1; i >= 0; i--)
   align_tab[i] = seq;
}
  }

/* When optimizing, we start assuming minimum length, and keep increasing
   lengths as we find the need for this, till nothing changes.
   When not optimizing, we start assuming maximum lengths, and
   do a single pass to update the lengths.  */
bool increasing = optimizeglobal_options.x_optimize != 0;

939#ifdef CASE_VECTOR_SHORTEN_MODE
if (optimizeglobal_options.x_optimize)
  {
    /* Look for ADDR_DIFF_VECs, and initialize their minimum and maximum
       label fields.  */

    int min_shuid = INSN_SHUID (get_insns ())(uid_shuid[INSN_UID (get_insns ())]) - 1;
    int max_shuid = INSN_SHUID (get_last_insn ())(uid_shuid[INSN_UID (get_last_insn ())]) + 1;
    int rel;

    for (insn = first; insn != 0; insn = NEXT_INSN (insn))
{
 rtx min_lab = NULL_RTX(rtx) 0, max_lab = NULL_RTX(rtx) 0, pat;
 int len, i, min, max, insn_shuid;
 int min_align;
 addr_diff_vec_flags flags;

 if (! JUMP_TABLE_DATA_P (insn)(((enum rtx_code) (insn)->code) == JUMP_TABLE_DATA)
     || GET_CODE (PATTERN (insn))((enum rtx_code) (PATTERN (insn))->code) != ADDR_DIFF_VEC)
   continue;
 pat = PATTERN (insn);
 len = XVECLEN (pat, 1)(((((pat)->u.fld[1]).rt_rtvec))->num_elem);
 gcc_assert (len > 0)((void)(!(len > 0) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 961, __FUNCTION__), 0 : 0));
 min_align = MAX_CODE_ALIGN16;
 for (min = max_shuid, max = min_shuid, i = len - 1; i >= 0; i--)
   {
     rtx lab = XEXP (XVECEXP (pat, 1, i), 0)((((((((pat)->u.fld[1]).rt_rtvec))->elem[i]))->u.fld
[0]).rt_rtx);
     int shuid = INSN_SHUID (lab)(uid_shuid[INSN_UID (lab)]);
     if (shuid < min)
{
  min = shuid;
  min_lab = lab;
}
     if (shuid > max)
{
  max = shuid;
  max_lab = lab;
}

     int label_alignment = LABEL_TO_ALIGNMENT (lab)(label_align[(((lab)->u.fld[5]).rt_int) - min_labelno]).levels[0].log;
     if (min_align > label_alignment)
min_align = label_alignment;
   }
 XEXP (pat, 2)(((pat)->u.fld[2]).rt_rtx) = gen_rtx_LABEL_REF (Pmode, min_lab)gen_rtx_fmt_u_stat ((LABEL_REF), (((global_options.x_ix86_pmode
 == PMODE_DI ? (scalar_int_mode ((scalar_int_mode::from_int) E_DImode
)) : (scalar_int_mode ((scalar_int_mode::from_int) E_SImode))
))), ((min_lab)) );
 XEXP (pat, 3)(((pat)->u.fld[3]).rt_rtx) = gen_rtx_LABEL_REF (Pmode, max_lab)gen_rtx_fmt_u_stat ((LABEL_REF), (((global_options.x_ix86_pmode
 == PMODE_DI ? (scalar_int_mode ((scalar_int_mode::from_int) E_DImode
)) : (scalar_int_mode ((scalar_int_mode::from_int) E_SImode))
))), ((max_lab)) );
 insn_shuid = INSN_SHUID (insn)(uid_shuid[INSN_UID (insn)]);
 rel = INSN_SHUID (XEXP (XEXP (pat, 0), 0))(uid_shuid[INSN_UID (((((((pat)->u.fld[0]).rt_rtx))->u.
fld[0]).rt_rtx))]);
 memset (&flags, 0, sizeof (flags));
 flags.min_align = min_align;
 flags.base_after_vec = rel > insn_shuid;
 flags.min_after_vec  = min > insn_shuid;
 flags.max_after_vec  = max > insn_shuid;
 flags.min_after_base = min > rel;
 flags.max_after_base = max > rel;
 ADDR_DIFF_VEC_FLAGS (pat)(((pat)->u.fld[4]).rt_addr_diff_vec_flags) = flags;

 if (increasing)
   PUT_MODE (pat, CASE_VECTOR_SHORTEN_MODE (0, 0, pat));
}
  }
999#endif /* CASE_VECTOR_SHORTEN_MODE */

/* Compute initial lengths, addresses, and varying flags for each insn.  */
int (*length_fun) (rtx_insn *) = increasing ? insn_min_length : insn_default_length;

for (insn_current_address = 0, insn = first;
     insn != 0;
     insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
  {
    uid = INSN_UID (insn);

    insn_lengths[uid] = 0;

    if (LABEL_P (insn)(((enum rtx_code) (insn)->code) == CODE_LABEL))
{
 int log = LABEL_TO_ALIGNMENT (insn)(label_align[(((insn)->u.fld[5]).rt_int) - min_labelno]).levels[0].log;
 if (log)
   {
     int align = 1 << log;
     int new_address = (insn_current_address + align - 1) & -align;
     insn_lengths[uid] = new_address - insn_current_address;
   }
}

    INSN_ADDRESSES (uid)(insn_addresses_[uid]) = insn_current_address + insn_lengths[uid];

    if (NOTE_P (insn)(((enum rtx_code) (insn)->code) == NOTE) || BARRIER_P (insn)(((enum rtx_code) (insn)->code) == BARRIER)
 || LABEL_P (insn)(((enum rtx_code) (insn)->code) == CODE_LABEL) || DEBUG_INSN_P (insn)(((enum rtx_code) (insn)->code) == DEBUG_INSN))
continue;
    if (insn->deleted ())
continue;

    body = PATTERN (insn);
    if (rtx_jump_table_data *table = dyn_cast <rtx_jump_table_data *> (insn))
{
 /* This only takes room if read-only data goes into the text
    section.  */
 if (JUMP_TABLES_IN_TEXT_SECTION(global_options.x_flag_pic && !(((global_options.x_ix86_isa_flags
 & (1UL << 1)) != 0) || 1))
     || readonly_data_section == text_section)
   insn_lengths[uid] = (XVECLEN (body,(((((body)->u.fld[((enum rtx_code) (body)->code) == ADDR_DIFF_VEC
]).rt_rtvec))->num_elem)
			  GET_CODE (body) == ADDR_DIFF_VEC)(((((body)->u.fld[((enum rtx_code) (body)->code) == ADDR_DIFF_VEC
]).rt_rtvec))->num_elem)
		 * GET_MODE_SIZE (table->get_data_mode ()));
 /* Alignment is handled by ADDR_VEC_ALIGN.  */
}
    else if (GET_CODE (body)((enum rtx_code) (body)->code) == ASM_INPUT || asm_noperands (body) >= 0)
insn_lengths[uid] = asm_insn_count (body) * insn_default_length (insn);
    else if (rtx_sequence *body_seq = dyn_cast <rtx_sequence *> (body))
{
 int i;
 int const_delay_slots;
 if (DELAY_SLOTS0)
   const_delay_slots = const_num_delay_slots (body_seq->insn (0));
 else
   const_delay_slots = 0;

 int (*inner_length_fun) (rtx_insn *)
   = const_delay_slots ? length_fun : insn_default_length;
 /* Inside a delay slot sequence, we do not do any branch shortening
    if the shortening could change the number of delay slots
    of the branch.  */
 for (i = 0; i < body_seq->len (); i++)
   {
     rtx_insn *inner_insn = body_seq->insn (i);
     int inner_uid = INSN_UID (inner_insn);
     int inner_length;

     if (GET_CODE (PATTERN (inner_insn))((enum rtx_code) (PATTERN (inner_insn))->code) == ASM_INPUT
  || asm_noperands (PATTERN (inner_insn)) >= 0)
inner_length = (asm_insn_count (PATTERN (inner_insn))
		* insn_default_length (inner_insn));
     else
inner_length = inner_length_fun (inner_insn);

     insn_lengths[inner_uid] = inner_length;
     if (const_delay_slots)
{
  if ((varying_length[inner_uid]
       = insn_variable_length_p (inner_insn)) != 0)
    varying_length[uid] = 1;
  INSN_ADDRESSES (inner_uid)(insn_addresses_[inner_uid]) = (insn_current_address
				+ insn_lengths[uid]);
}
     else
varying_length[inner_uid] = 0;
     insn_lengths[uid] += inner_length;
   }
}
    else if (GET_CODE (body)((enum rtx_code) (body)->code) != USE && GET_CODE (body)((enum rtx_code) (body)->code) != CLOBBER)
{
 insn_lengths[uid] = length_fun (insn);
 varying_length[uid] = insn_variable_length_p (insn);
}

    /* If needed, do any adjustment.  */
1093#ifdef ADJUST_INSN_LENGTH
    ADJUST_INSN_LENGTH (insn, insn_lengths[uid]);
    if (insn_lengths[uid] < 0)
fatal_insn ("negative insn length", insn)_fatal_insn ("negative insn length", insn, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1096, __FUNCTION__);
1097#endif
  }

/* Now loop over all the insns finding varying length insns.  For each,
   get the current insn length.  If it has changed, reflect the change.
   When nothing changes for a full pass, we are done.  */

while (something_changed)
  {
    something_changed = 0;
    insn_current_align = MAX_CODE_ALIGN16 - 1;
    for (insn_current_address = 0, insn = first;
  insn != 0;
  insn = NEXT_INSN (insn))
{
 int new_length;
1113#ifdef ADJUST_INSN_LENGTH
 int tmp_length;
1115#endif
 int length_align;

 uid = INSN_UID (insn);

 if (rtx_code_label *label = dyn_cast <rtx_code_label *> (insn))
   {
     int log = LABEL_TO_ALIGNMENT (label)(label_align[(((label)->u.fld[5]).rt_int) - min_labelno]).levels[0].log;

1124#ifdef CASE_VECTOR_SHORTEN_MODE
     /* If the mode of a following jump table was changed, we
 may need to update the alignment of this label.  */

     if (JUMP_TABLES_IN_TEXT_SECTION(global_options.x_flag_pic && !(((global_options.x_ix86_isa_flags
 & (1UL << 1)) != 0) || 1))
  || readonly_data_section == text_section)
{
  rtx_jump_table_data *table = jump_table_for_label (label);
  if (table)
    {
      int newlog = ADDR_VEC_ALIGN (table)final_addr_vec_align (table);
      if (newlog != log)
	{
	  log = newlog;
	  LABEL_TO_ALIGNMENT (insn)(label_align[(((insn)->u.fld[5]).rt_int) - min_labelno]) = log;
	  something_changed = 1;
	}
    }
}
1143#endif

     if (log > insn_current_align)
{
  int align = 1 << log;
  int new_address= (insn_current_address + align - 1) & -align;
  insn_lengths[uid] = new_address - insn_current_address;
  insn_current_align = log;
  insn_current_address = new_address;
}
     else
insn_lengths[uid] = 0;
     INSN_ADDRESSES (uid)(insn_addresses_[uid]) = insn_current_address;
     continue;
   }

 length_align = INSN_LENGTH_ALIGNMENT (insn)length_unit_log;
 if (length_align < insn_current_align)
   insn_current_align = length_align;

 insn_last_address = INSN_ADDRESSES (uid)(insn_addresses_[uid]);
 INSN_ADDRESSES (uid)(insn_addresses_[uid]) = insn_current_address;

1166#ifdef CASE_VECTOR_SHORTEN_MODE
 if (optimizeglobal_options.x_optimize
     && JUMP_TABLE_DATA_P (insn)(((enum rtx_code) (insn)->code) == JUMP_TABLE_DATA)
     && GET_CODE (PATTERN (insn))((enum rtx_code) (PATTERN (insn))->code) == ADDR_DIFF_VEC)
   {
     rtx_jump_table_data *table = as_a <rtx_jump_table_data *> (insn);
     rtx body = PATTERN (insn);
     int old_length = insn_lengths[uid];
     rtx_insn *rel_lab =
safe_as_a <rtx_insn *> (XEXP (XEXP (body, 0), 0)((((((body)->u.fld[0]).rt_rtx))->u.fld[0]).rt_rtx));
     rtx min_lab = XEXP (XEXP (body, 2), 0)((((((body)->u.fld[2]).rt_rtx))->u.fld[0]).rt_rtx);
     rtx max_lab = XEXP (XEXP (body, 3), 0)((((((body)->u.fld[3]).rt_rtx))->u.fld[0]).rt_rtx);
     int rel_addr = INSN_ADDRESSES (INSN_UID (rel_lab))(insn_addresses_[INSN_UID (rel_lab)]);
     int min_addr = INSN_ADDRESSES (INSN_UID (min_lab))(insn_addresses_[INSN_UID (min_lab)]);
     int max_addr = INSN_ADDRESSES (INSN_UID (max_lab))(insn_addresses_[INSN_UID (max_lab)]);
     rtx_insn *prev;
     int rel_align = 0;
     addr_diff_vec_flags flags;
     scalar_int_mode vec_mode;

     /* Avoid automatic aggregate initialization.  */
     flags = ADDR_DIFF_VEC_FLAGS (body)(((body)->u.fld[4]).rt_addr_diff_vec_flags);

     /* Try to find a known alignment for rel_lab.  */
     for (prev = rel_lab;
   prev
   && ! insn_lengths[INSN_UID (prev)]
   && ! (varying_length[INSN_UID (prev)] & 1);
   prev = PREV_INSN (prev))
if (varying_length[INSN_UID (prev)] & 2)
  {
    rel_align = LABEL_TO_ALIGNMENT (prev)(label_align[(((prev)->u.fld[5]).rt_int) - min_labelno]).levels[0].log;
    break;
  }

     /* See the comment on addr_diff_vec_flags in rtl.h for the
 meaning of the flags values.  base: REL_LAB   vec: INSN  */
     /* Anything after INSN has still addresses from the last
 pass; adjust these so that they reflect our current
 estimate for this pass.  */
     if (flags.base_after_vec)
rel_addr += insn_current_address - insn_last_address;
     if (flags.min_after_vec)
min_addr += insn_current_address - insn_last_address;
     if (flags.max_after_vec)
max_addr += insn_current_address - insn_last_address;
     /* We want to know the worst case, i.e. lowest possible value
 for the offset of MIN_LAB.  If MIN_LAB is after REL_LAB,
 its offset is positive, and we have to be wary of code shrink;
 otherwise, it is negative, and we have to be vary of code
 size increase.  */
     if (flags.min_after_base)
{
  /* If INSN is between REL_LAB and MIN_LAB, the size
     changes we are about to make can change the alignment
     within the observed offset, therefore we have to break
     it up into two parts that are independent.  */
  if (! flags.base_after_vec && flags.min_after_vec)
    {
      min_addr -= align_fuzz (rel_lab, insn, rel_align, 0);
      min_addr -= align_fuzz (insn, min_lab, 0, 0);
    }
  else
    min_addr -= align_fuzz (rel_lab, min_lab, rel_align, 0);
}
     else
{
  if (flags.base_after_vec && ! flags.min_after_vec)
    {
      min_addr -= align_fuzz (min_lab, insn, 0, ~0);
      min_addr -= align_fuzz (insn, rel_lab, 0, ~0);
    }
  else
    min_addr -= align_fuzz (min_lab, rel_lab, 0, ~0);
}
     /* Likewise, determine the highest lowest possible value
 for the offset of MAX_LAB.  */
     if (flags.max_after_base)
{
  if (! flags.base_after_vec && flags.max_after_vec)
    {
      max_addr += align_fuzz (rel_lab, insn, rel_align, ~0);
      max_addr += align_fuzz (insn, max_lab, 0, ~0);
    }
  else
    max_addr += align_fuzz (rel_lab, max_lab, rel_align, ~0);
}
     else
{
  if (flags.base_after_vec && ! flags.max_after_vec)
    {
      max_addr += align_fuzz (max_lab, insn, 0, 0);
      max_addr += align_fuzz (insn, rel_lab, 0, 0);
    }
  else
    max_addr += align_fuzz (max_lab, rel_lab, 0, 0);
}
     vec_mode = CASE_VECTOR_SHORTEN_MODE (min_addr - rel_addr,
				   max_addr - rel_addr, body);
     if (!increasing
  || (GET_MODE_SIZE (vec_mode)
      >= GET_MODE_SIZE (table->get_data_mode ())))
PUT_MODE (body, vec_mode);
     if (JUMP_TABLES_IN_TEXT_SECTION(global_options.x_flag_pic && !(((global_options.x_ix86_isa_flags
 & (1UL << 1)) != 0) || 1))
  || readonly_data_section == text_section)
{
  insn_lengths[uid]
    = (XVECLEN (body, 1)(((((body)->u.fld[1]).rt_rtvec))->num_elem)
       * GET_MODE_SIZE (table->get_data_mode ()));
  insn_current_address += insn_lengths[uid];
  if (insn_lengths[uid] != old_length)
    something_changed = 1;
}

     continue;
   }
1282#endif /* CASE_VECTOR_SHORTEN_MODE */

 if (! (varying_length[uid]))
   {
     if (NONJUMP_INSN_P (insn)(((enum rtx_code) (insn)->code) == INSN)
  && GET_CODE (PATTERN (insn))((enum rtx_code) (PATTERN (insn))->code) == SEQUENCE)
{
  int i;

  body = PATTERN (insn);
  for (i = 0; i < XVECLEN (body, 0)(((((body)->u.fld[0]).rt_rtvec))->num_elem); i++)
    {
      rtx inner_insn = XVECEXP (body, 0, i)(((((body)->u.fld[0]).rt_rtvec))->elem[i]);
      int inner_uid = INSN_UID (inner_insn);

      INSN_ADDRESSES (inner_uid)(insn_addresses_[inner_uid]) = insn_current_address;

      insn_current_address += insn_lengths[inner_uid];
    }
}
     else
insn_current_address += insn_lengths[uid];

     continue;
   }

 if (NONJUMP_INSN_P (insn)(((enum rtx_code) (insn)->code) == INSN) && GET_CODE (PATTERN (insn))((enum rtx_code) (PATTERN (insn))->code) == SEQUENCE)
   {
     rtx_sequence *seqn = as_a <rtx_sequence *> (PATTERN (insn));
     int i;

     body = PATTERN (insn);
     new_length = 0;
     for (i = 0; i < seqn->len (); i++)
{
  rtx_insn *inner_insn = seqn->insn (i);
  int inner_uid = INSN_UID (inner_insn);
  int inner_length;

  INSN_ADDRESSES (inner_uid)(insn_addresses_[inner_uid]) = insn_current_address;

  /* insn_current_length returns 0 for insns with a
     non-varying length.  */
  if (! varying_length[inner_uid])
    inner_length = insn_lengths[inner_uid];
  else
    inner_length = insn_current_length (inner_insn);

  if (inner_length != insn_lengths[inner_uid])
    {
      if (!increasing || inner_length > insn_lengths[inner_uid])
	{
	  insn_lengths[inner_uid] = inner_length;
	  something_changed = 1;
	}
      else
	inner_length = insn_lengths[inner_uid];
    }
  insn_current_address += inner_length;
  new_length += inner_length;
}
   }
 else
   {
     new_length = insn_current_length (insn);
     insn_current_address += new_length;
   }

1350#ifdef ADJUST_INSN_LENGTH
 /* If needed, do any adjustment.  */
 tmp_length = new_length;
 ADJUST_INSN_LENGTH (insn, new_length);
 insn_current_address += (new_length - tmp_length);
1355#endif

 if (new_length != insn_lengths[uid]
     && (!increasing || new_length > insn_lengths[uid]))
   {
     insn_lengths[uid] = new_length;
     something_changed = 1;
   }
 else
   insn_current_address += insn_lengths[uid] - new_length;
}
    /* For a non-optimizing compile, do only a single pass.  */
    if (!increasing)
break;
  }
crtl(&x_rtl)->max_insn_address = insn_current_address;
free (varying_length);
1372}

1374/* Given the body of an INSN known to be generated by an ASM statement, return
 the number of machine instructions likely to be generated for this insn.
 This is used to compute its length.  */

1378static int
1379asm_insn_count (rtx body)
1380{
const char *templ;

if (GET_CODE (body)((enum rtx_code) (body)->code) == ASM_INPUT)
  templ = XSTR (body, 0)(((body)->u.fld[0]).rt_str);
else
  templ = decode_asm_operands (body, NULL__null, NULL__null, NULL__null, NULL__null, NULL__null);

return asm_str_count (templ);
1389}

1391/* Return the number of machine instructions likely to be generated for the
 inline-asm template. */
1393int
1394asm_str_count (const char *templ)
1395{
int count = 1;

if (!*templ)
  return 0;

for (; *templ; templ++)
  if (IS_ASM_LOGICAL_LINE_SEPARATOR (*templ, templ)((*templ) == ';')
|| *templ == '\n')
    count++;

return count;
1407}
1408
1409/* Return true if DWARF2 debug info can be emitted for DECL.  */

1411static bool
1412dwarf2_debug_info_emitted_p (tree decl)
1413{
/* When DWARF2 debug info is not generated internally.  */
if (!dwarf_debuginfo_p () && !dwarf_based_debuginfo_p ())
  return false;

if (DECL_IGNORED_P (decl)((contains_struct_check ((decl), (TS_DECL_COMMON), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1418, __FUNCTION__))->decl_common.ignored_flag))
  return false;

return true;
1422}

1424/* Return scope resulting from combination of S1 and S2.  */
1425static tree
1426choose_inner_scope (tree s1, tree s2)
1427{
 if (!s1)
   return s2;
 if (!s2)
   return s1;
 if (BLOCK_NUMBER (s1)((tree_check ((s1), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1432, __FUNCTION__, (BLOCK)))->block.block_num) > BLOCK_NUMBER (s2)((tree_check ((s2), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1432, __FUNCTION__, (BLOCK)))->block.block_num))
   return s1;
 return s2;
1435}

1437/* Emit lexical block notes needed to change scope from S1 to S2.  */

1439static void
1440change_scope (rtx_insn *orig_insn, tree s1, tree s2)
1441{
rtx_insn *insn = orig_insn;
tree com = NULL_TREE(tree) __null;
tree ts1 = s1, ts2 = s2;
tree s;

while (ts1 != ts2)
  {
    gcc_assert (ts1 && ts2)((void)(!(ts1 && ts2) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1449, __FUNCTION__), 0 : 0));
    if (BLOCK_NUMBER (ts1)((tree_check ((ts1), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1450, __FUNCTION__, (BLOCK)))->block.block_num) > BLOCK_NUMBER (ts2)((tree_check ((ts2), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1450, __FUNCTION__, (BLOCK)))->block.block_num))
ts1 = BLOCK_SUPERCONTEXT (ts1)((tree_check ((ts1), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1451, __FUNCTION__, (BLOCK)))->block.supercontext);
    else if (BLOCK_NUMBER (ts1)((tree_check ((ts1), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1452, __FUNCTION__, (BLOCK)))->block.block_num) < BLOCK_NUMBER (ts2)((tree_check ((ts2), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1452, __FUNCTION__, (BLOCK)))->block.block_num))
ts2 = BLOCK_SUPERCONTEXT (ts2)((tree_check ((ts2), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1453, __FUNCTION__, (BLOCK)))->block.supercontext);
    else
{
 ts1 = BLOCK_SUPERCONTEXT (ts1)((tree_check ((ts1), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1456, __FUNCTION__, (BLOCK)))->block.supercontext);
 ts2 = BLOCK_SUPERCONTEXT (ts2)((tree_check ((ts2), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1457, __FUNCTION__, (BLOCK)))->block.supercontext);
}
  }
com = ts1;

/* Close scopes.  */
s = s1;
while (s != com)
  {
    rtx_note *note = emit_note_before (NOTE_INSN_BLOCK_END, insn);
    NOTE_BLOCK (note)(((note)->u.fld[3]).rt_tree) = s;
    s = BLOCK_SUPERCONTEXT (s)((tree_check ((s), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1468, __FUNCTION__, (BLOCK)))->block.supercontext);
  }

/* Open scopes.  */
s = s2;
while (s != com)
  {
    insn = emit_note_before (NOTE_INSN_BLOCK_BEG, insn);
    NOTE_BLOCK (insn)(((insn)->u.fld[3]).rt_tree) = s;
    s = BLOCK_SUPERCONTEXT (s)((tree_check ((s), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1477, __FUNCTION__, (BLOCK)))->block.supercontext);
  }
1479}

1481/* Rebuild all the NOTE_INSN_BLOCK_BEG and NOTE_INSN_BLOCK_END notes based
 on the scope tree and the newly reordered instructions.  */

1484static void
1485reemit_insn_block_notes (void)
1486{
tree cur_block = DECL_INITIAL (cfun->decl)((contains_struct_check (((cfun + 0)->decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1487, __FUNCTION__))->decl_common.initial);
rtx_insn *insn;

insn = get_insns ();
for (; insn; insn = NEXT_INSN (insn))
  {
    tree this_block;

    /* Prevent lexical blocks from straddling section boundaries.  */
    if (NOTE_P (insn)(((enum rtx_code) (insn)->code) == NOTE))
switch (NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int))
 {
 case NOTE_INSN_SWITCH_TEXT_SECTIONS:
   {
     for (tree s = cur_block; s != DECL_INITIAL (cfun->decl)((contains_struct_check (((cfun + 0)->decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1501, __FUNCTION__))->decl_common.initial);
   s = BLOCK_SUPERCONTEXT (s)((tree_check ((s), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1502, __FUNCTION__, (BLOCK)))->block.supercontext))
{
  rtx_note *note = emit_note_before (NOTE_INSN_BLOCK_END, insn);
  NOTE_BLOCK (note)(((note)->u.fld[3]).rt_tree) = s;
  note = emit_note_after (NOTE_INSN_BLOCK_BEG, insn);
  NOTE_BLOCK (note)(((note)->u.fld[3]).rt_tree) = s;
}
   }
   break;

 case NOTE_INSN_BEGIN_STMT:
 case NOTE_INSN_INLINE_ENTRY:
   this_block = LOCATION_BLOCK (NOTE_MARKER_LOCATION (insn))((tree) ((IS_ADHOC_LOC ((((insn)->u.fld[3]).rt_uint))) ? get_data_from_adhoc_loc
 (line_table, ((((insn)->u.fld[3]).rt_uint))) : __null));
   goto set_cur_block_to_this_block;

 default:
   continue;
}

    if (!active_insn_p (insn))
      continue;

    /* Avoid putting scope notes between jump table and its label.  */
    if (JUMP_TABLE_DATA_P (insn)(((enum rtx_code) (insn)->code) == JUMP_TABLE_DATA))
continue;

    this_block = insn_scope (insn);
    /* For sequences compute scope resulting from merging all scopes
of instructions nested inside.  */
    if (rtx_sequence *body = dyn_cast <rtx_sequence *> (PATTERN (insn)))
{
 int i;

 this_block = NULL__null;
 for (i = 0; i < body->len (); i++)
   this_block = choose_inner_scope (this_block,
			     insn_scope (body->insn (i)));
}
  set_cur_block_to_this_block:
    if (! this_block)
{
 if (INSN_LOCATION (insn) == UNKNOWN_LOCATION((location_t) 0))
   continue;
 else
   this_block = DECL_INITIAL (cfun->decl)((contains_struct_check (((cfun + 0)->decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1546, __FUNCTION__))->decl_common.initial);
}

    if (this_block != cur_block)
{
 change_scope (insn, cur_block, this_block);
 cur_block = this_block;
}
  }

/* change_scope emits before the insn, not after.  */
rtx_note *note = emit_note (NOTE_INSN_DELETED);
change_scope (note, cur_block, DECL_INITIAL (cfun->decl)((contains_struct_check (((cfun + 0)->decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1558, __FUNCTION__))->decl_common.initial));
delete_insn (note);

reorder_blocks ();
1562}

1564static const char *some_local_dynamic_name;

1566/* Locate some local-dynamic symbol still in use by this function
 so that we can print its name in local-dynamic base patterns.
 Return null if there are no local-dynamic references.  */

1570const char *
1571get_some_local_dynamic_name ()
1572{
subrtx_iterator::array_type array;
rtx_insn *insn;

if (some_local_dynamic_name)
  return some_local_dynamic_name;

for (insn = get_insns (); insn ; insn = NEXT_INSN (insn))
  if (NONDEBUG_INSN_P (insn)((((enum rtx_code) (insn)->code) == INSN) || (((enum rtx_code
) (insn)->code) == JUMP_INSN) || (((enum rtx_code) (insn)->
code) == CALL_INSN)))
    FOR_EACH_SUBRTX (iter, array, PATTERN (insn), ALL)for (subrtx_iterator iter (array, PATTERN (insn), rtx_all_subrtx_bounds
); !iter.at_end (); iter.next ())
{
 const_rtx x = *iter;
 if (GET_CODE (x)((enum rtx_code) (x)->code) == SYMBOL_REF)
   {
     if (SYMBOL_REF_TLS_MODEL (x)((enum tls_model) (((__extension__ ({ __typeof ((x)) const _rtx
 = ((x)); if (((enum rtx_code) (_rtx)->code) != SYMBOL_REF
) rtl_check_failed_flag ("SYMBOL_REF_FLAGS", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1586, __FUNCTION__); _rtx; }) ->u2.symbol_ref_flags) >>
 3) & 7)) == TLS_MODEL_LOCAL_DYNAMIC)
return some_local_dynamic_name = XSTR (x, 0)(((x)->u.fld[0]).rt_str);
     if (CONSTANT_POOL_ADDRESS_P (x)(__extension__ ({ __typeof ((x)) const _rtx = ((x)); if (((enum
 rtx_code) (_rtx)->code) != SYMBOL_REF) rtl_check_failed_flag
 ("CONSTANT_POOL_ADDRESS_P", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1588, __FUNCTION__); _rtx; })->unchanging))
iter.substitute (get_pool_constant (x));
   }
}

return 0;
1594}

1596/* Arrange for us to emit a source location note before any further
 real insns or section changes, by setting the SEEN_NEXT_VIEW bit in
 *SEEN, as long as we are keeping track of location views.  The bit
 indicates we have referenced the next view at the current PC, so we
 have to emit it.  This should be called next to the var_location
 debug hook.  */

1603static inline void
1604set_next_view_needed (int *seen)
1605{
if (debug_variable_location_viewsglobal_options.x_debug_variable_location_views)
  *seen |= SEEN_NEXT_VIEW4;
1608}

1610/* Clear the flag in *SEEN indicating we need to emit the next view.
 This should be called next to the source_line debug hook.  */

1613static inline void
1614clear_next_view_needed (int *seen)
1615{
*seen &= ~SEEN_NEXT_VIEW4;
1617}

1619/* Test whether we have a pending request to emit the next view in
 *SEEN, and emit it if needed, clearing the request bit.  */

1622static inline void
1623maybe_output_next_view (int *seen)
1624{
if ((*seen & SEEN_NEXT_VIEW4) != 0)
  {
    clear_next_view_needed (seen);
    (*debug_hooks->source_line) (last_linenum, last_columnnum,
		   last_filename, last_discriminator,
		   false);
  }
1632}

1634/* We want to emit param bindings (before the first begin_stmt) in the
 initial view, if we are emitting views.  To that end, we may
 consume initial notes in the function, processing them in
 final_start_function, before signaling the beginning of the
 prologue, rather than in final.

 We don't test whether the DECLs are PARM_DECLs: the assumption is
 that there will be a NOTE_INSN_BEGIN_STMT marker before any
 non-parameter NOTE_INSN_VAR_LOCATION.  It's ok if the marker is not
 there, we'll just have more variable locations bound in the initial
 view, which is consistent with their being bound without any code
 that would give them a value.  */

1647static inline bool
1648in_initial_view_p (rtx_insn *insn)
1649{
return (!DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1650, __FUNCTION__))->decl_common.ignored_flag)
 && debug_variable_location_viewsglobal_options.x_debug_variable_location_views
 && insn && GET_CODE (insn)((enum rtx_code) (insn)->code) == NOTE
 && (NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int) == NOTE_INSN_VAR_LOCATION
     || NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int) == NOTE_INSN_DELETED));
1655}

1657/* Output assembler code for the start of a function,
 and initialize some of the variables in this file
 for the new function.  The label for the function and associated
 assembler pseudo-ops have already been output in `assemble_start_function'.

 FIRST is the first insn of the rtl for the function being compiled.
 FILE is the file to write assembler code to.
 SEEN should be initially set to zero, and it may be updated to
 indicate we have references to the next location view, that would
 require us to emit it at the current PC.
 OPTIMIZE_P is nonzero if we should eliminate redundant
   test and compare insns.  */

1670static void
1671final_start_function_1 (rtx_insn **firstp, FILE *file, int *seen,
	int optimize_p ATTRIBUTE_UNUSED__attribute__ ((__unused__)))
1673{
block_depth = 0;

this_is_asm_operands = 0;

need_profile_function = false;

last_filename = LOCATION_FILE (prologue_location)((expand_location (prologue_location)).file);
last_linenum = LOCATION_LINE (prologue_location)((expand_location (prologue_location)).line);
last_columnnum = LOCATION_COLUMN (prologue_location)((expand_location (prologue_location)).column);
last_discriminator = 0;
force_source_line = false;

high_block_linenum = high_function_linenum = last_linenum;

if (flag_sanitizeglobal_options.x_flag_sanitize & SANITIZE_ADDRESS)
  asan_function_start ();

rtx_insn *first = *firstp;
if (in_initial_view_p (first))
  {
    do
{
 final_scan_insn (first, file, 0, 0, seen);
 first = NEXT_INSN (first);
}
    while (in_initial_view_p (first));
    *firstp = first;
  }

if (!DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1703, __FUNCTION__))->decl_common.ignored_flag))
  debug_hooks->begin_prologue (last_linenum, last_columnnum,
		 last_filename);

if (!dwarf2_debug_info_emitted_p (current_function_decl))
  dwarf2out_begin_prologue (0, 0, NULL__null);

if (DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1710, __FUNCTION__))->decl_common.ignored_flag) && last_linenum && last_filename)
  debug_hooks->set_ignored_loc (last_linenum, last_columnnum, last_filename);

1713#ifdef LEAF_REG_REMAP
if (crtl(&x_rtl)->uses_only_leaf_regs)
  leaf_renumber_regs (first);
1716#endif

/* The Sun386i and perhaps other machines don't work right
   if the profiling code comes after the prologue.  */
if (targetm.profile_before_prologue () && crtl(&x_rtl)->profile)
  {
    if (targetm.asm_out.function_prologue == default_function_pro_epilogue
 && targetm.have_prologue ())
{
 rtx_insn *insn;
 for (insn = first; insn; insn = NEXT_INSN (insn))
   if (!NOTE_P (insn)(((enum rtx_code) (insn)->code) == NOTE))
     {
insn = NULL__null;
break;
     }
   else if (NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int) == NOTE_INSN_BASIC_BLOCK
     || NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int) == NOTE_INSN_FUNCTION_BEG)
     break;
   else if (NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int) == NOTE_INSN_DELETED
     || NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int) == NOTE_INSN_VAR_LOCATION)
     continue;
   else
     {
insn = NULL__null;
break;
     }

 if (insn)
   need_profile_function = true;
 else
   profile_function (file);
}
    else
profile_function (file);
  }

/* If debugging, assign block numbers to all of the blocks in this
   function.  */
if (write_symbolsglobal_options.x_write_symbols)
  {
    reemit_insn_block_notes ();
    number_blocks (current_function_decl);
    /* We never actually put out begin/end notes for the top-level
block in the function.  But, conceptually, that block is
always needed.  */
    TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl))((((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1762, __FUNCTION__))->decl_common.initial))->base.asm_written_flag
) = 1;
  }

unsigned HOST_WIDE_INTlong min_frame_size
  = constant_lower_bound (get_frame_size ());
if (min_frame_size > (unsigned HOST_WIDE_INTlong) warn_frame_larger_than_sizeglobal_options.x_warn_frame_larger_than_size)
  {
    /* Issue a warning */
    warning (OPT_Wframe_larger_than_,
      "the frame size of %wu bytes is larger than %wu bytes",
      min_frame_size, warn_frame_larger_than_sizeglobal_options.x_warn_frame_larger_than_size);
  }

/* First output the function prologue: code to set up the stack frame.  */
targetm.asm_out.function_prologue (file);

/* If the machine represents the prologue as RTL, the profiling code must
   be emitted when NOTE_INSN_PROLOGUE_END is scanned.  */
if (! targetm.have_prologue ())
  profile_after_prologue (file);
1782}

1784/* This is an exported final_start_function_1, callable without SEEN.  */

1786void
1787final_start_function (rtx_insn *first, FILE *file,
      int optimize_p ATTRIBUTE_UNUSED__attribute__ ((__unused__)))
1789{
int seen = 0;
final_start_function_1 (&first, file, &seen, optimize_p);
gcc_assert (seen == 0)((void)(!(seen == 0) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1792, __FUNCTION__), 0 : 0));
1793}

1795static void
1796profile_after_prologue (FILE *file ATTRIBUTE_UNUSED__attribute__ ((__unused__)))
1797{
if (!targetm.profile_before_prologue () && crtl(&x_rtl)->profile)
  profile_function (file);
1800}

1802static void
1803profile_function (FILE *file ATTRIBUTE_UNUSED__attribute__ ((__unused__)))
1804{
1805#ifndef NO_PROFILE_COUNTERS1
1806# define NO_PROFILE_COUNTERS1	0
1807#endif
1808#ifdef ASM_OUTPUT_REG_PUSH
rtx sval = NULL__null, chain = NULL__null;

if (cfun(cfun + 0)->returns_struct)
  sval = targetm.calls.struct_value_rtx (TREE_TYPE (current_function_decl)((contains_struct_check ((current_function_decl), (TS_TYPED),
 "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1812, __FUNCTION__))->typed.type),
			   true);
if (cfun(cfun + 0)->static_chain_decl)
  chain = targetm.calls.static_chain (current_function_decl, true);
1816#endif /* ASM_OUTPUT_REG_PUSH */

if (! NO_PROFILE_COUNTERS1)
  {
    int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE)(((((global_options.x_target_flags & (1U << 12)) !=
 0) ? 32 : (((global_options.x_ix86_isa_flags & (1UL <<
 15)) != 0) ? 512 : (((global_options.x_ix86_isa_flags & (
1UL << 8)) != 0) ? 256 : 128)))) < ((((global_options
.x_ix86_isa_flags & (1UL << 58)) != 0) ? 32 : ((8) *
 (((global_options.x_ix86_isa_flags & (1UL << 1)) !=
 0) ? 8 : 4)))) ? ((((global_options.x_target_flags & (1U
 << 12)) != 0) ? 32 : (((global_options.x_ix86_isa_flags
 & (1UL << 15)) != 0) ? 512 : (((global_options.x_ix86_isa_flags
 & (1UL << 8)) != 0) ? 256 : 128)))) : ((((global_options
.x_ix86_isa_flags & (1UL << 58)) != 0) ? 32 : ((8) *
 (((global_options.x_ix86_isa_flags & (1UL << 1)) !=
 0) ? 8 : 4)))));
    switch_to_section (data_section);
    ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT))if ((floor_log2 (align / (8))) != 0) fprintf ((file), "\t.align %d\n"
, 1 << (floor_log2 (align / (8))));
    targetm.asm_out.internal_label (file, "LP", current_function_funcdef_no((cfun + 0)->funcdef_no));
    assemble_integer (const0_rtx(const_int_rtx[64]), LONG_TYPE_SIZE(((global_options.x_ix86_isa_flags & (1UL << 58)) !=
 0) ? 32 : ((8) * (((global_options.x_ix86_isa_flags & (1UL
 << 1)) != 0) ? 8 : 4))) / BITS_PER_UNIT(8), align, 1);
  }

switch_to_section (current_function_section ());

1829#ifdef ASM_OUTPUT_REG_PUSH
if (sval && REG_P (sval)(((enum rtx_code) (sval)->code) == REG))
  ASM_OUTPUT_REG_PUSH (file, REGNO (sval))asm_fprintf ((file), "\tpush%z\t%%%r\n", ((rhs_regno(sval))));
if (chain && REG_P (chain)(((enum rtx_code) (chain)->code) == REG))
  ASM_OUTPUT_REG_PUSH (file, REGNO (chain))asm_fprintf ((file), "\tpush%z\t%%%r\n", ((rhs_regno(chain)))
);
1834#endif

FUNCTION_PROFILER (file, current_function_funcdef_no)x86_function_profiler ((file), (((cfun + 0)->funcdef_no)));

1838#ifdef ASM_OUTPUT_REG_PUSH
if (chain && REG_P (chain)(((enum rtx_code) (chain)->code) == REG))
  ASM_OUTPUT_REG_POP (file, REGNO (chain))asm_fprintf ((file), "\tpop%z\t%%%r\n", ((rhs_regno(chain))));
if (sval && REG_P (sval)(((enum rtx_code) (sval)->code) == REG))
  ASM_OUTPUT_REG_POP (file, REGNO (sval))asm_fprintf ((file), "\tpop%z\t%%%r\n", ((rhs_regno(sval))));
1843#endif
1844}

1846/* Output assembler code for the end of a function.
 For clarity, args are same as those of `final_start_function'
 even though not all of them are needed.  */

1850void
1851final_end_function (void)
1852{
app_disable ();

if (!DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1855, __FUNCTION__))->decl_common.ignored_flag))
  debug_hooks->end_function (high_function_linenum);

/* Finally, output the function epilogue:
   code to restore the stack frame and return to the caller.  */
targetm.asm_out.function_epilogue (asm_out_file);

/* And debug output.  */
if (!DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1863, __FUNCTION__))->decl_common.ignored_flag))
  debug_hooks->end_epilogue (last_linenum, last_filename);

if (!dwarf2_debug_info_emitted_p (current_function_decl)
    && dwarf2out_do_frame ())
  dwarf2out_end_epilogue (last_linenum, last_filename);

some_local_dynamic_name = 0;
1871}
1872

1874/* Dumper helper for basic block information. FILE is the assembly
 output file, and INSN is the instruction being emitted.  */

1877static void
1878dump_basic_block_info (FILE *file, rtx_insn *insn, basic_block *start_to_bb,
                     basic_block *end_to_bb, int bb_map_size, int *bb_seqn)
1880{
basic_block bb;

if (!flag_debug_asmglobal_options.x_flag_debug_asm)
  return;

if (INSN_UID (insn) < bb_map_size
    && (bb = start_to_bb[INSN_UID (insn)]) != NULL__null)
  {
    edge e;
    edge_iterator ei;

    fprintf (file, "%s BLOCK %d", ASM_COMMENT_START"#", bb->index);
    if (bb->count.initialized_p ())
{
        fprintf (file, ", count:");
 bb->count.dump (file);
}
    fprintf (file, " seq:%d", (*bb_seqn)++);
    fprintf (file, "\n%s PRED:", ASM_COMMENT_START"#");
    FOR_EACH_EDGE (e, ei, bb->preds)for ((ei) = ei_start_1 (&((bb->preds))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
      {
        dump_edge_info (file, e, TDF_DETAILS, 0);
      }
    fprintf (file, "\n");
  }
if (INSN_UID (insn) < bb_map_size
    && (bb = end_to_bb[INSN_UID (insn)]) != NULL__null)
  {
    edge e;
    edge_iterator ei;

    fprintf (asm_out_file, "%s SUCC:", ASM_COMMENT_START"#");
    FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
     {
       dump_edge_info (asm_out_file, e, TDF_DETAILS, 1);
     }
    fprintf (file, "\n");
  }
1919}

1921/* Output assembler code for some insns: all or part of a function.
 For description of args, see `final_start_function', above.  */

1924static void
1925final_1 (rtx_insn *first, FILE *file, int seen, int optimize_p)
1926{
rtx_insn *insn, *next;

/* Used for -dA dump.  */
basic_block *start_to_bb = NULL__null;
basic_block *end_to_bb = NULL__null;
int bb_map_size = 0;
int bb_seqn = 0;

last_ignored_compare = 0;

init_recog ();

CC_STATUS_INIT;

if (flag_debug_asmglobal_options.x_flag_debug_asm)
  {
    basic_block bb;

    bb_map_size = get_max_uid () + 1;
    start_to_bb = XCNEWVEC (basic_block, bb_map_size)((basic_block *) xcalloc ((bb_map_size), sizeof (basic_block)
));
    end_to_bb = XCNEWVEC (basic_block, bb_map_size)((basic_block *) xcalloc ((bb_map_size), sizeof (basic_block)
));

    /* There is no cfg for a thunk.  */
    if (!cfun(cfun + 0)->is_thunk)
FOR_EACH_BB_REVERSE_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_exit_block_ptr->prev_bb
; bb != ((cfun + 0))->cfg->x_entry_block_ptr; bb = bb->
prev_bb)
 {
   start_to_bb[INSN_UID (BB_HEAD (bb)(bb)->il.x.head_)] = bb;
   end_to_bb[INSN_UID (BB_END (bb)(bb)->il.x.rtl->end_)] = bb;
 }
  }

/* Output the insns.  */
for (insn = first; insn;)
  {
    if (HAVE_ATTR_length1)
{
 if ((unsigned) INSN_UID (insn) >= INSN_ADDRESSES_SIZE ()(insn_addresses_.length ()))
   {
     /* This can be triggered by bugs elsewhere in the compiler if
 new insns are created after init_insn_lengths is called.  */
     gcc_assert (NOTE_P (insn))((void)(!((((enum rtx_code) (insn)->code) == NOTE)) ? fancy_abort
 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 1967, __FUNCTION__), 0 : 0));
     insn_current_address = -1;
   }
 else
   insn_current_address = INSN_ADDRESSES (INSN_UID (insn))(insn_addresses_[INSN_UID (insn)]);
 /* final can be seen as an iteration of shorten_branches that
    does nothing (since a fixed point has already been reached).  */
 insn_last_address = insn_current_address;
}

    dump_basic_block_info (file, insn, start_to_bb, end_to_bb,
                           bb_map_size, &bb_seqn);
    insn = final_scan_insn (insn, file, optimize_p, 0, &seen);
  }

maybe_output_next_view (&seen);

if (flag_debug_asmglobal_options.x_flag_debug_asm)
  {
    free (start_to_bb);
    free (end_to_bb);
  }

/* Remove CFI notes, to avoid compare-debug failures.  */
for (insn = first; insn; insn = next)
  {
    next = NEXT_INSN (insn);
    if (NOTE_P (insn)(((enum rtx_code) (insn)->code) == NOTE)
 && (NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int) == NOTE_INSN_CFI
     || NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int) == NOTE_INSN_CFI_LABEL))
delete_insn (insn);
  }
1999}

2001/* This is an exported final_1, callable without SEEN.  */

2003void
2004final (rtx_insn *first, FILE *file, int optimize_p)
2005{
/* Those that use the internal final_start_function_1/final_1 API
   skip initial debug bind notes in final_start_function_1, and pass
   the modified FIRST to final_1.  But those that use the public
   final_start_function/final APIs, final_start_function can't move
   FIRST because it's not passed by reference, so if they were
   skipped there, skip them again here.  */
while (in_initial_view_p (first))
  first = NEXT_INSN (first);

final_1 (first, file, 0, optimize_p);
2016}
2017
2018const char *
2019get_insn_template (int code, rtx_insn *insn)
2020{
switch (insn_data[code].output_format)
  {
  case INSN_OUTPUT_FORMAT_SINGLE1:
    return insn_data[code].output.single;
  case INSN_OUTPUT_FORMAT_MULTI2:
    return insn_data[code].output.multi[which_alternative];
  case INSN_OUTPUT_FORMAT_FUNCTION3:
    gcc_assert (insn)((void)(!(insn) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2028, __FUNCTION__), 0 : 0));
    return (*insn_data[code].output.function) (recog_data.operand, insn);

  default:
    gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2032, __FUNCTION__));
  }
2034}

2036/* Emit the appropriate declaration for an alternate-entry-point
 symbol represented by INSN, to FILE.  INSN is a CODE_LABEL with
 LABEL_KIND != LABEL_NORMAL.

 The case fall-through in this function is intentional.  */
2041static void
2042output_alternate_entry_point (FILE *file, rtx_insn *insn)
2043{
const char *name = LABEL_NAME (insn)(((insn)->u.fld[6]).rt_str);

switch (LABEL_KIND (insn)__extension__ ({ __typeof (insn) const _label = (insn); if (!
 (((enum rtx_code) (_label)->code) == CODE_LABEL)) rtl_check_failed_flag
 ("LABEL_KIND", _label, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2046, __FUNCTION__); (enum label_kind) ((_label->jump <<
 1) | _label->call); }))
  {
  case LABEL_WEAK_ENTRY:
2049#ifdef ASM_WEAKEN_LABEL
    ASM_WEAKEN_LABEL (file, name)do { fputs ("\t.weak\t", (file)); assemble_name ((file), (name
)); fputc ('\n', (file)); } while (0);
    gcc_fallthrough ();
2052#endif
  case LABEL_GLOBAL_ENTRY:
    targetm.asm_out.globalize_label (file, name);
    gcc_fallthrough ();
  case LABEL_STATIC_ENTRY:
2057#ifdef ASM_OUTPUT_TYPE_DIRECTIVE
    ASM_OUTPUT_TYPE_DIRECTIVE (file, name, "function")do { fputs ("\t.type\t", file); assemble_name (file, name); fputs
 (", ", file); fprintf (file, "@%s", "function"); putc ('\n',
 file); } while (0);
2059#endif
    ASM_OUTPUT_LABEL (file, name)do { assemble_name ((file), (name)); fputs (":\n", (file)); }
 while (0);
    break;

  case LABEL_NORMAL:
  default:
    gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2065, __FUNCTION__));
  }
2067}

2069/* Given a CALL_INSN, find and return the nested CALL. */
2070static rtx
2071call_from_call_insn (rtx_call_insn *insn)
2072{
rtx x;
gcc_assert (CALL_P (insn))((void)(!((((enum rtx_code) (insn)->code) == CALL_INSN)) ?
 fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2074, __FUNCTION__), 0 : 0));
x = PATTERN (insn);

while (GET_CODE (x)((enum rtx_code) (x)->code) != CALL)
  {
    switch (GET_CODE (x)((enum rtx_code) (x)->code))
{
default:
 gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2082, __FUNCTION__));
case COND_EXEC:
 x = COND_EXEC_CODE (x)(((x)->u.fld[1]).rt_rtx);
 break;
case PARALLEL:
 x = XVECEXP (x, 0, 0)(((((x)->u.fld[0]).rt_rtvec))->elem[0]);
 break;
case SET:
 x = XEXP (x, 1)(((x)->u.fld[1]).rt_rtx);
 break;
}
  }
return x;
2095}

2097/* Print a comment into the asm showing FILENAME, LINENUM, and the
 corresponding source line, if available.  */

2100static void
2101asm_show_source (const char *filename, int linenum)
2102{
if (!filename)
  return;

char_span line = location_get_source_line (filename, linenum);
if (!line)
  return;

fprintf (asm_out_file, "%s %s:%i: ", ASM_COMMENT_START"#", filename, linenum);
/* "line" is not 0-terminated, so we must use its length.  */
fwrite (line.get_buffer (), 1, line.length (), asm_out_file);
fputc ('\n', asm_out_file);
2114}

2116/* Judge if an absolute jump table is relocatable.  */

2118bool
2119jumptable_relocatable (void)
2120{
bool relocatable = false;

if (!CASE_VECTOR_PC_RELATIVE0
    && !targetm.asm_out.generate_pic_addr_diff_vec ()
    && targetm_common.have_named_sections)
   relocatable = targetm.asm_out.reloc_rw_mask ();

return relocatable;
2129}

2131/* The final scan for one insn, INSN.
 Args are same as in `final', except that INSN
 is the insn being scanned.
 Value returned is the next insn to be scanned.

 NOPEEPHOLES is the flag to disallow peephole processing (currently
 used for within delayed branch sequence output).

 SEEN is used to track the end of the prologue, for emitting
 debug information.  We force the emission of a line note after
 both NOTE_INSN_PROLOGUE_END and NOTE_INSN_FUNCTION_BEG.  */

2143static rtx_insn *
2144final_scan_insn_1 (rtx_insn *insn, FILE *file, int optimize_p ATTRIBUTE_UNUSED__attribute__ ((__unused__)),
   int nopeepholes ATTRIBUTE_UNUSED__attribute__ ((__unused__)), int *seen)
2146{
rtx_insn *next;
rtx_jump_table_data *table;

insn_counter++;

/* Ignore deleted insns.  These can occur when we split insns (due to a
   template of "#") while not optimizing.  */
if (insn->deleted ())
  return NEXT_INSN (insn);

switch (GET_CODE (insn)((enum rtx_code) (insn)->code))
  {
  case NOTE:
    switch (NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int))
{
case NOTE_INSN_DELETED:
case NOTE_INSN_UPDATE_SJLJ_CONTEXT:
 break;

case NOTE_INSN_SWITCH_TEXT_SECTIONS:
 maybe_output_next_view (seen);

 output_function_exception_table (0);

 if (targetm.asm_out.unwind_emit)
   targetm.asm_out.unwind_emit (asm_out_file, insn);

 in_cold_section_p = !in_cold_section_p;

 gcc_checking_assert (in_cold_section_p)((void)(!(in_cold_section_p) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2176, __FUNCTION__), 0 : 0));
 if (in_cold_section_p)
   cold_function_name
     = clone_function_name (current_function_decl, "cold");

 if (dwarf2out_do_frame ())
   {
     dwarf2out_switch_text_section ();
     if (!dwarf2_debug_info_emitted_p (current_function_decl)
  && !DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2185, __FUNCTION__))->decl_common.ignored_flag))
debug_hooks->switch_text_section ();
   }
 else if (!DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2188, __FUNCTION__))->decl_common.ignored_flag))
   debug_hooks->switch_text_section ();
 if (DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2190, __FUNCTION__))->decl_common.ignored_flag) && last_linenum
     && last_filename)
   debug_hooks->set_ignored_loc (last_linenum, last_columnnum,
			  last_filename);

 switch_to_section (current_function_section ());
 targetm.asm_out.function_switched_text_sections (asm_out_file,
					   current_function_decl,
					   in_cold_section_p);
 /* Emit a label for the split cold section.  Form label name by
    suffixing "cold" to the original function's name.  */
 if (in_cold_section_p)
   {
2203#ifdef ASM_DECLARE_COLD_FUNCTION_NAME
     ASM_DECLARE_COLD_FUNCTION_NAME (asm_out_file,do { do { fputs ("\t.type\t", asm_out_file); assemble_name (asm_out_file
, ((const char *) (tree_check ((cold_function_name), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2206, __FUNCTION__, (IDENTIFIER_NODE)))->identifier.id.str
)); fputs (", ", asm_out_file); fprintf (asm_out_file, "@%s",
 "function"); putc ('\n', asm_out_file); } while (0); ; ix86_asm_output_function_label
 ((asm_out_file), (((const char *) (tree_check ((cold_function_name
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2206, __FUNCTION__, (IDENTIFIER_NODE)))->identifier.id.str
)), (current_function_decl)); } while (0)
			      IDENTIFIER_POINTERdo { do { fputs ("\t.type\t", asm_out_file); assemble_name (asm_out_file
, ((const char *) (tree_check ((cold_function_name), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2206, __FUNCTION__, (IDENTIFIER_NODE)))->identifier.id.str
)); fputs (", ", asm_out_file); fprintf (asm_out_file, "@%s",
 "function"); putc ('\n', asm_out_file); } while (0); ; ix86_asm_output_function_label
 ((asm_out_file), (((const char *) (tree_check ((cold_function_name
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2206, __FUNCTION__, (IDENTIFIER_NODE)))->identifier.id.str
)), (current_function_decl)); } while (0)
			          (cold_function_name),do { do { fputs ("\t.type\t", asm_out_file); assemble_name (asm_out_file
, ((const char *) (tree_check ((cold_function_name), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2206, __FUNCTION__, (IDENTIFIER_NODE)))->identifier.id.str
)); fputs (", ", asm_out_file); fprintf (asm_out_file, "@%s",
 "function"); putc ('\n', asm_out_file); } while (0); ; ix86_asm_output_function_label
 ((asm_out_file), (((const char *) (tree_check ((cold_function_name
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2206, __FUNCTION__, (IDENTIFIER_NODE)))->identifier.id.str
)), (current_function_decl)); } while (0)
			      current_function_decl)do { do { fputs ("\t.type\t", asm_out_file); assemble_name (asm_out_file
, ((const char *) (tree_check ((cold_function_name), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2206, __FUNCTION__, (IDENTIFIER_NODE)))->identifier.id.str
)); fputs (", ", asm_out_file); fprintf (asm_out_file, "@%s",
 "function"); putc ('\n', asm_out_file); } while (0); ; ix86_asm_output_function_label
 ((asm_out_file), (((const char *) (tree_check ((cold_function_name
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2206, __FUNCTION__, (IDENTIFIER_NODE)))->identifier.id.str
)), (current_function_decl)); } while (0);
2208#else
     ASM_OUTPUT_LABEL (asm_out_file,do { assemble_name ((asm_out_file), (((const char *) (tree_check
 ((cold_function_name), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2210, __FUNCTION__, (IDENTIFIER_NODE)))->identifier.id.str
))); fputs (":\n", (asm_out_file)); } while (0)
		IDENTIFIER_POINTER (cold_function_name))do { assemble_name ((asm_out_file), (((const char *) (tree_check
 ((cold_function_name), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2210, __FUNCTION__, (IDENTIFIER_NODE)))->identifier.id.str
))); fputs (":\n", (asm_out_file)); } while (0);
2211#endif
     if (dwarf2out_do_frame ()
         && cfun(cfun + 0)->fde->dw_fde_second_begin != NULL__null)
ASM_OUTPUT_LABEL (asm_out_file, cfun->fde->dw_fde_second_begin)do { assemble_name ((asm_out_file), ((cfun + 0)->fde->dw_fde_second_begin
)); fputs (":\n", (asm_out_file)); } while (0);
   }
 break;

case NOTE_INSN_BASIC_BLOCK:
 if (need_profile_function)
   {
     profile_function (asm_out_file);
     need_profile_function = false;
   }

 if (targetm.asm_out.unwind_emit)
   targetm.asm_out.unwind_emit (asm_out_file, insn);

 break;

case NOTE_INSN_EH_REGION_BEG:
 ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHB",(*targetm.asm_out.internal_label) (asm_out_file, "LEHB", (((insn
)->u.fld[3]).rt_int))
		  NOTE_EH_HANDLER (insn))(*targetm.asm_out.internal_label) (asm_out_file, "LEHB", (((insn
)->u.fld[3]).rt_int));
 break;

case NOTE_INSN_EH_REGION_END:
 ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHE",(*targetm.asm_out.internal_label) (asm_out_file, "LEHE", (((insn
)->u.fld[3]).rt_int))
		  NOTE_EH_HANDLER (insn))(*targetm.asm_out.internal_label) (asm_out_file, "LEHE", (((insn
)->u.fld[3]).rt_int));
 break;

case NOTE_INSN_PROLOGUE_END:
 targetm.asm_out.function_end_prologue (file);
 profile_after_prologue (file);

 if ((*seen & (SEEN_EMITTED2 | SEEN_NOTE1)) == SEEN_NOTE1)
   {
     *seen |= SEEN_EMITTED2;
     force_source_line = true;
   }
 else
   *seen |= SEEN_NOTE1;

 break;

case NOTE_INSN_EPILOGUE_BEG:
        if (!DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2255, __FUNCTION__))->decl_common.ignored_flag))
          (*debug_hooks->begin_epilogue) (last_linenum, last_filename);
 targetm.asm_out.function_begin_epilogue (file);
 break;

case NOTE_INSN_CFI:
 dwarf2out_emit_cfi (NOTE_CFI (insn)(((insn)->u.fld[3]).rt_cfi));
 break;

case NOTE_INSN_CFI_LABEL:
 ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LCFI",(*targetm.asm_out.internal_label) (asm_out_file, "LCFI", (((insn
)->u.fld[3]).rt_int))
		  NOTE_LABEL_NUMBER (insn))(*targetm.asm_out.internal_label) (asm_out_file, "LCFI", (((insn
)->u.fld[3]).rt_int));
 break;

case NOTE_INSN_FUNCTION_BEG:
 if (need_profile_function)
   {
     profile_function (asm_out_file);
     need_profile_function = false;
   }

 app_disable ();
 if (!DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2277, __FUNCTION__))->decl_common.ignored_flag))
   debug_hooks->end_prologue (last_linenum, last_filename);

 if ((*seen & (SEEN_EMITTED2 | SEEN_NOTE1)) == SEEN_NOTE1)
   {
     *seen |= SEEN_EMITTED2;
     force_source_line = true;
   }
 else
   *seen |= SEEN_NOTE1;

 break;

case NOTE_INSN_BLOCK_BEG:
 if (debug_info_levelglobal_options.x_debug_info_level >= DINFO_LEVEL_NORMAL
     || dwarf_debuginfo_p ()
     || write_symbolsglobal_options.x_write_symbols == VMS_DEBUG(1U << DINFO_TYPE_VMS))
   {
     int n = BLOCK_NUMBER (NOTE_BLOCK (insn))((tree_check (((((insn)->u.fld[3]).rt_tree)), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2295, __FUNCTION__, (BLOCK)))->block.block_num);

     app_disable ();
     ++block_depth;
     high_block_linenum = last_linenum;

     /* Output debugging info about the symbol-block beginning.  */
     if (!DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2302, __FUNCTION__))->decl_common.ignored_flag))
debug_hooks->begin_block (last_linenum, n);

     /* Mark this block as output.  */
     TREE_ASM_WRITTEN (NOTE_BLOCK (insn))(((((insn)->u.fld[3]).rt_tree))->base.asm_written_flag) = 1;
     BLOCK_IN_COLD_SECTION_P (NOTE_BLOCK (insn))((tree_check (((((insn)->u.fld[3]).rt_tree)), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2307, __FUNCTION__, (BLOCK)))->base.u.bits.atomic_flag) = in_cold_section_p;
   }
 break;

case NOTE_INSN_BLOCK_END:
 maybe_output_next_view (seen);

 if (debug_info_levelglobal_options.x_debug_info_level >= DINFO_LEVEL_NORMAL
     || dwarf_debuginfo_p ()
     || write_symbolsglobal_options.x_write_symbols == VMS_DEBUG(1U << DINFO_TYPE_VMS))
   {
     int n = BLOCK_NUMBER (NOTE_BLOCK (insn))((tree_check (((((insn)->u.fld[3]).rt_tree)), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2318, __FUNCTION__, (BLOCK)))->block.block_num);

     app_disable ();

     /* End of a symbol-block.  */
     --block_depth;
     gcc_assert (block_depth >= 0)((void)(!(block_depth >= 0) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2324, __FUNCTION__), 0 : 0));

     if (!DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2326, __FUNCTION__))->decl_common.ignored_flag))
debug_hooks->end_block (high_block_linenum, n);
     gcc_assert (BLOCK_IN_COLD_SECTION_P (NOTE_BLOCK (insn))((void)(!(((tree_check (((((insn)->u.fld[3]).rt_tree)), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2328, __FUNCTION__, (BLOCK)))->base.u.bits.atomic_flag) ==
 in_cold_section_p) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2329, __FUNCTION__), 0 : 0))
	  == in_cold_section_p)((void)(!(((tree_check (((((insn)->u.fld[3]).rt_tree)), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2328, __FUNCTION__, (BLOCK)))->base.u.bits.atomic_flag) ==
 in_cold_section_p) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2329, __FUNCTION__), 0 : 0));
   }
 break;

case NOTE_INSN_DELETED_LABEL:
 /* Emit the label.  We may have deleted the CODE_LABEL because
    the label could be proved to be unreachable, though still
    referenced (in the form of having its address taken.  */
 ASM_OUTPUT_DEBUG_LABEL (file, "L", CODE_LABEL_NUMBER (insn))(*targetm.asm_out.internal_label) (file, "L", (((insn)->u.
fld[5]).rt_int));
 break;

case NOTE_INSN_DELETED_DEBUG_LABEL:
 /* Similarly, but need to use different namespace for it.  */
 if (CODE_LABEL_NUMBER (insn)(((insn)->u.fld[5]).rt_int) != -1)
   ASM_OUTPUT_DEBUG_LABEL (file, "LDL", CODE_LABEL_NUMBER (insn))(*targetm.asm_out.internal_label) (file, "LDL", (((insn)->
u.fld[5]).rt_int));
 break;

case NOTE_INSN_VAR_LOCATION:
 if (!DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2347, __FUNCTION__))->decl_common.ignored_flag))
   {
     debug_hooks->var_location (insn);
     set_next_view_needed (seen);
   }
 break;

case NOTE_INSN_BEGIN_STMT:
 gcc_checking_assert (cfun->debug_nonbind_markers)((void)(!((cfun + 0)->debug_nonbind_markers) ? fancy_abort
 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2355, __FUNCTION__), 0 : 0));
 if (!DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2356, __FUNCTION__))->decl_common.ignored_flag)
     && notice_source_line (insn, NULL__null))
   {
   output_source_line:
     (*debug_hooks->source_line) (last_linenum, last_columnnum,
			   last_filename, last_discriminator,
			   true);
     clear_next_view_needed (seen);
   }
 break;

case NOTE_INSN_INLINE_ENTRY:
 gcc_checking_assert (cfun->debug_nonbind_markers)((void)(!((cfun + 0)->debug_nonbind_markers) ? fancy_abort
 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2368, __FUNCTION__), 0 : 0));
 if (!DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2369, __FUNCTION__))->decl_common.ignored_flag)
     && notice_source_line (insn, NULL__null))
   {
     (*debug_hooks->inline_entry) (LOCATION_BLOCK((tree) ((IS_ADHOC_LOC ((((insn)->u.fld[3]).rt_uint))) ? get_data_from_adhoc_loc
 (line_table, ((((insn)->u.fld[3]).rt_uint))) : __null))
			    (NOTE_MARKER_LOCATION (insn))((tree) ((IS_ADHOC_LOC ((((insn)->u.fld[3]).rt_uint))) ? get_data_from_adhoc_loc
 (line_table, ((((insn)->u.fld[3]).rt_uint))) : __null)));
     goto output_source_line;
   }
 break;

default:
 gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2379, __FUNCTION__));
 break;
}
    break;

  case BARRIER:
    break;

  case CODE_LABEL:
    /* The target port might emit labels in the output function for
some insn, e.g. sh.cc output_branchy_insn.  */
    if (CODE_LABEL_NUMBER (insn)(((insn)->u.fld[5]).rt_int) <= max_labelno)
{
 align_flags alignment = LABEL_TO_ALIGNMENT (insn)(label_align[(((insn)->u.fld[5]).rt_int) - min_labelno]);
 if (alignment.levels[0].log && NEXT_INSN (insn))
   {
2395#ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
     /* Output both primary and secondary alignment.  */
     ASM_OUTPUT_MAX_SKIP_ALIGN (file, alignment.levels[0].log,do { if ((alignment.levels[0].log) != 0) { if ((alignment.levels
[0].maxskip) == 0 || (alignment.levels[0].maxskip) >= (1 <<
 (alignment.levels[0].log)) - 1) fprintf ((file), "\t.p2align %d\n"
, (alignment.levels[0].log)); else fprintf ((file), "\t.p2align %d,,%d\n"
, (alignment.levels[0].log), (alignment.levels[0].maxskip)); }
 } while (0)
			 alignment.levels[0].maxskip)do { if ((alignment.levels[0].log) != 0) { if ((alignment.levels
[0].maxskip) == 0 || (alignment.levels[0].maxskip) >= (1 <<
 (alignment.levels[0].log)) - 1) fprintf ((file), "\t.p2align %d\n"
, (alignment.levels[0].log)); else fprintf ((file), "\t.p2align %d,,%d\n"
, (alignment.levels[0].log), (alignment.levels[0].maxskip)); }
 } while (0);
     ASM_OUTPUT_MAX_SKIP_ALIGN (file, alignment.levels[1].log,do { if ((alignment.levels[1].log) != 0) { if ((alignment.levels
[1].maxskip) == 0 || (alignment.levels[1].maxskip) >= (1 <<
 (alignment.levels[1].log)) - 1) fprintf ((file), "\t.p2align %d\n"
, (alignment.levels[1].log)); else fprintf ((file), "\t.p2align %d,,%d\n"
, (alignment.levels[1].log), (alignment.levels[1].maxskip)); }
 } while (0)
			 alignment.levels[1].maxskip)do { if ((alignment.levels[1].log) != 0) { if ((alignment.levels
[1].maxskip) == 0 || (alignment.levels[1].maxskip) >= (1 <<
 (alignment.levels[1].log)) - 1) fprintf ((file), "\t.p2align %d\n"
, (alignment.levels[1].log)); else fprintf ((file), "\t.p2align %d,,%d\n"
, (alignment.levels[1].log), (alignment.levels[1].maxskip)); }
 } while (0);
2401#else
2402#ifdef ASM_OUTPUT_ALIGN_WITH_NOP
            ASM_OUTPUT_ALIGN_WITH_NOP (file, alignment.levels[0].log);
2404#else
     ASM_OUTPUT_ALIGN (file, alignment.levels[0].log)if ((alignment.levels[0].log) != 0) fprintf ((file), "\t.align %d\n"
, 1 << (alignment.levels[0].log));
2406#endif
2407#endif
   }
}
    CC_STATUS_INIT;

    if (!DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2412, __FUNCTION__))->decl_common.ignored_flag) && LABEL_NAME (insn)(((insn)->u.fld[6]).rt_str))
debug_hooks->label (as_a <rtx_code_label *> (insn));

    app_disable ();

    /* If this label is followed by a jump-table, make sure we put
the label in the read-only section.  Also possibly write the
label and jump table together.  */
    table = jump_table_for_label (as_a <rtx_code_label *> (insn));
    if (table)
{
2423#if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
 /* In this case, the case vector is being moved by the
    target, so don't output the label at all.  Leave that
    to the back end macros.  */
2427#else
 if (! JUMP_TABLES_IN_TEXT_SECTION(global_options.x_flag_pic && !(((global_options.x_ix86_isa_flags
 & (1UL << 1)) != 0) || 1)))
   {
     int log_align;

     switch_to_section (targetm.asm_out.function_rodata_section
		 (current_function_decl,
		  jumptable_relocatable ()));

2436#ifdef ADDR_VEC_ALIGN
     log_align = ADDR_VEC_ALIGN (table)final_addr_vec_align (table);
2438#else
     log_align = exact_log2 (BIGGEST_ALIGNMENT(((global_options.x_target_flags & (1U << 12)) != 0
) ? 32 : (((global_options.x_ix86_isa_flags & (1UL <<
 15)) != 0) ? 512 : (((global_options.x_ix86_isa_flags & (
1UL << 8)) != 0) ? 256 : 128))) / BITS_PER_UNIT(8));
2440#endif
     ASM_OUTPUT_ALIGN (file, log_align)if ((log_align) != 0) fprintf ((file), "\t.align %d\n", 1 <<
 (log_align));
   }
 else
   switch_to_section (current_function_section ());

2446#ifdef ASM_OUTPUT_CASE_LABEL
 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn), table)do { if ((2) != 0) fprintf (((file)), "\t.align %d\n", 1 <<
 (2)); (*targetm.asm_out.internal_label) (file, "L", (((insn)
->u.fld[5]).rt_int)); } while (0);
2448#else
 targetm.asm_out.internal_label (file, "L", CODE_LABEL_NUMBER (insn)(((insn)->u.fld[5]).rt_int));
2450#endif
2451#endif
 break;
}
    if (LABEL_ALT_ENTRY_P (insn)(__extension__ ({ __typeof (insn) const _label = (insn); if (
! (((enum rtx_code) (_label)->code) == CODE_LABEL)) rtl_check_failed_flag
 ("LABEL_KIND", _label, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2454, __FUNCTION__); (enum label_kind) ((_label->jump <<
 1) | _label->call); }) != LABEL_NORMAL))
output_alternate_entry_point (file, insn);
    else
targetm.asm_out.internal_label (file, "L", CODE_LABEL_NUMBER (insn)(((insn)->u.fld[5]).rt_int));
    break;

  default:
    {
rtx body = PATTERN (insn);
int insn_code_number;
const char *templ;
bool is_stmt, *is_stmt_p;

if (MAY_HAVE_DEBUG_MARKER_INSNSglobal_options.x_debug_nonbind_markers_p && cfun(cfun + 0)->debug_nonbind_markers)
 {
   is_stmt = false;
   is_stmt_p = NULL__null;
 }
else
 is_stmt_p = &is_stmt;

/* Reset this early so it is correct for ASM statements.  */
current_insn_predicate = NULL_RTX(rtx) 0;

/* An INSN, JUMP_INSN or CALL_INSN.
  First check for special kinds that recog doesn't recognize.  */

if (GET_CODE (body)((enum rtx_code) (body)->code) == USE /* These are just declarations.  */
   || GET_CODE (body)((enum rtx_code) (body)->code) == CLOBBER)
 break;

/* Detect insns that are really jump-tables
  and output them as such.  */

      if (JUMP_TABLE_DATA_P (insn)(((enum rtx_code) (insn)->code) == JUMP_TABLE_DATA))
 {
2490#if !(defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC))
   int vlen, idx;
2492#endif

   if (! JUMP_TABLES_IN_TEXT_SECTION(global_options.x_flag_pic && !(((global_options.x_ix86_isa_flags
 & (1UL << 1)) != 0) || 1)))
     switch_to_section (targetm.asm_out.function_rodata_section
		 (current_function_decl,
		  jumptable_relocatable ()));
   else
     switch_to_section (current_function_section ());

   app_disable ();

2503#if defined(ASM_OUTPUT_ADDR_VEC) || defined(ASM_OUTPUT_ADDR_DIFF_VEC)
   if (GET_CODE (body)((enum rtx_code) (body)->code) == ADDR_VEC)
     {
2506#ifdef ASM_OUTPUT_ADDR_VEC
ASM_OUTPUT_ADDR_VEC (PREV_INSN (insn), body);
2508#else
gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2509, __FUNCTION__));
2510#endif
     }
   else
     {
2514#ifdef ASM_OUTPUT_ADDR_DIFF_VEC
ASM_OUTPUT_ADDR_DIFF_VEC (PREV_INSN (insn), body);
2516#else
gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2517, __FUNCTION__));
2518#endif
     }
2520#else
   vlen = XVECLEN (body, GET_CODE (body) == ADDR_DIFF_VEC)(((((body)->u.fld[((enum rtx_code) (body)->code) == ADDR_DIFF_VEC
]).rt_rtvec))->num_elem);
   for (idx = 0; idx < vlen; idx++)
     {
if (GET_CODE (body)((enum rtx_code) (body)->code) == ADDR_VEC)
  {
2526#ifdef ASM_OUTPUT_ADDR_VEC_ELT
    ASM_OUTPUT_ADDR_VEC_ELTix86_output_addr_vec_elt ((file), ((((((((((((body)->u.fld
[0]).rt_rtvec))->elem[idx]))->u.fld[0]).rt_rtx))->u.
fld[5]).rt_int)))
      (file, CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 0, idx), 0)))ix86_output_addr_vec_elt ((file), ((((((((((((body)->u.fld
[0]).rt_rtvec))->elem[idx]))->u.fld[0]).rt_rtx))->u.
fld[5]).rt_int)));
2529#else
    gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2530, __FUNCTION__));
2531#endif
  }
else
  {
2535#ifdef ASM_OUTPUT_ADDR_DIFF_ELT
    ASM_OUTPUT_ADDR_DIFF_ELTix86_output_addr_diff_elt ((file), ((((((((((((body)->u.fld
[1]).rt_rtvec))->elem[idx]))->u.fld[0]).rt_rtx))->u.
fld[5]).rt_int)), ((((((((((body)->u.fld[0]).rt_rtx))->
u.fld[0]).rt_rtx))->u.fld[5]).rt_int)))
      (file,ix86_output_addr_diff_elt ((file), ((((((((((((body)->u.fld
[1]).rt_rtvec))->elem[idx]))->u.fld[0]).rt_rtx))->u.
fld[5]).rt_int)), ((((((((((body)->u.fld[0]).rt_rtx))->
u.fld[0]).rt_rtx))->u.fld[5]).rt_int)))
       body,ix86_output_addr_diff_elt ((file), ((((((((((((body)->u.fld
[1]).rt_rtvec))->elem[idx]))->u.fld[0]).rt_rtx))->u.
fld[5]).rt_int)), ((((((((((body)->u.fld[0]).rt_rtx))->
u.fld[0]).rt_rtx))->u.fld[5]).rt_int)))
       CODE_LABEL_NUMBER (XEXP (XVECEXP (body, 1, idx), 0)),ix86_output_addr_diff_elt ((file), ((((((((((((body)->u.fld
[1]).rt_rtvec))->elem[idx]))->u.fld[0]).rt_rtx))->u.
fld[5]).rt_int)), ((((((((((body)->u.fld[0]).rt_rtx))->
u.fld[0]).rt_rtx))->u.fld[5]).rt_int)))
       CODE_LABEL_NUMBER (XEXP (XEXP (body, 0), 0)))ix86_output_addr_diff_elt ((file), ((((((((((((body)->u.fld
[1]).rt_rtvec))->elem[idx]))->u.fld[0]).rt_rtx))->u.
fld[5]).rt_int)), ((((((((((body)->u.fld[0]).rt_rtx))->
u.fld[0]).rt_rtx))->u.fld[5]).rt_int)));
2541#else
    gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2542, __FUNCTION__));
2543#endif
  }
     }
2546#ifdef ASM_OUTPUT_CASE_END
   ASM_OUTPUT_CASE_END (file,
		 CODE_LABEL_NUMBER (PREV_INSN (insn))(((PREV_INSN (insn))->u.fld[5]).rt_int),
		 insn);
2550#endif
2551#endif

   switch_to_section (current_function_section ());

   if (debug_variable_location_viewsglobal_options.x_debug_variable_location_views
&& !DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2556, __FUNCTION__))->decl_common.ignored_flag))
     debug_hooks->var_location (insn);

   break;
 }
/* Output this line note if it is the first or the last line
  note in a row.  */
if (!DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2563, __FUNCTION__))->decl_common.ignored_flag)
   && notice_source_line (insn, is_stmt_p))
 {
   if (flag_verbose_asmglobal_options.x_flag_verbose_asm)
     asm_show_source (last_filename, last_linenum);
   (*debug_hooks->source_line) (last_linenum, last_columnnum,
			 last_filename, last_discriminator,
			 is_stmt);
   clear_next_view_needed (seen);
 }
else
 maybe_output_next_view (seen);

gcc_checking_assert (!DEBUG_INSN_P (insn))((void)(!(!(((enum rtx_code) (insn)->code) == DEBUG_INSN))
 ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2576, __FUNCTION__), 0 : 0));

if (GET_CODE (body)((enum rtx_code) (body)->code) == PARALLEL
   && GET_CODE (XVECEXP (body, 0, 0))((enum rtx_code) ((((((body)->u.fld[0]).rt_rtvec))->elem
[0]))->code) == ASM_INPUT)
 body = XVECEXP (body, 0, 0)(((((body)->u.fld[0]).rt_rtvec))->elem[0]);

if (GET_CODE (body)((enum rtx_code) (body)->code) == ASM_INPUT)
 {
   const char *string = XSTR (body, 0)(((body)->u.fld[0]).rt_str);

   /* There's no telling what that did to the condition codes.  */
   CC_STATUS_INIT;

   if (string[0])
     {
expanded_location loc;

app_enable ();
loc = expand_location (ASM_INPUT_SOURCE_LOCATION (body)(((body)->u.fld[1]).rt_uint));
if (*loc.file && loc.line)
  fprintf (asm_out_file, "%s %i \"%s\" 1\n",
	   ASM_COMMENT_START"#", loc.line, loc.file);
fprintf (asm_out_file, "\t%s\n", string);
2599#if HAVE_AS_LINE_ZERO1
if (*loc.file && loc.line)
  fprintf (asm_out_file, "%s 0 \"\" 2\n", ASM_COMMENT_START"#");
2602#endif
     }
   break;
 }

/* Detect `asm' construct with operands.  */
if (asm_noperands (body) >= 0)
 {
   unsigned int noperands = asm_noperands (body);
   rtx *ops = XALLOCAVEC (rtx, noperands)((rtx *) __builtin_alloca(sizeof (rtx) * (noperands)));
   const char *string;
   location_t loc;
   expanded_location expanded;

   /* There's no telling what that did to the condition codes.  */
   CC_STATUS_INIT;

   /* Get out the operand values.  */
   string = decode_asm_operands (body, ops, NULL__null, NULL__null, NULL__null, &loc);
   /* Inhibit dying on what would otherwise be compiler bugs.  */
   insn_noperands = noperands;
   this_is_asm_operands = insn;
   expanded = expand_location (loc);

2626#ifdef FINAL_PRESCAN_INSN
   FINAL_PRESCAN_INSN (insn, ops, insn_noperands);
2628#endif

   /* Output the insn using them.  */
   if (string[0])
     {
app_enable ();
if (expanded.file && expanded.line)
  fprintf (asm_out_file, "%s %i \"%s\" 1\n",
	   ASM_COMMENT_START"#", expanded.line, expanded.file);
       output_asm_insn (string, ops);
2638#if HAVE_AS_LINE_ZERO1
if (expanded.file && expanded.line)
  fprintf (asm_out_file, "%s 0 \"\" 2\n", ASM_COMMENT_START"#");
2641#endif
     }

   if (targetm.asm_out.final_postscan_insn)
     targetm.asm_out.final_postscan_insn (file, insn, ops,
				   insn_noperands);

   this_is_asm_operands = 0;
   break;
 }

app_disable ();

if (rtx_sequence *seq = dyn_cast <rtx_sequence *> (body))
 {
   /* A delayed-branch sequence */
   int i;

   final_sequence = seq;

   /* The first insn in this SEQUENCE might be a JUMP_INSN that will
      force the restoration of a comparison that was previously
      thought unnecessary.  If that happens, cancel this sequence
      and cause that insn to be restored.  */

   next = final_scan_insn (seq->insn (0), file, 0, 1, seen);
   if (next != seq->insn (1))
     {
final_sequence = 0;
return next;
     }

   for (i = 1; i < seq->len (); i++)
     {
rtx_insn *insn = seq->insn (i);
rtx_insn *next = NEXT_INSN (insn);
/* We loop in case any instruction in a delay slot gets
   split.  */
do
  insn = final_scan_insn (insn, file, 0, 1, seen);
while (insn != next);
     }
2683#ifdef DBR_OUTPUT_SEQEND
   DBR_OUTPUT_SEQEND (file);
2685#endif
   final_sequence = 0;

   /* If the insn requiring the delay slot was a CALL_INSN, the
      insns in the delay slot are actually executed before the
      called function.  Hence we don't preserve any CC-setting
      actions in these insns and the CC must be marked as being
      clobbered by the function.  */
   if (CALL_P (seq->insn (0))(((enum rtx_code) (seq->insn (0))->code) == CALL_INSN))
     {
CC_STATUS_INIT;
     }
   break;
 }

/* We have a real machine instruction as rtl.  */

body = PATTERN (insn);

/* Do machine-specific peephole optimizations if desired.  */

if (HAVE_peephole0 && optimize_p && !flag_no_peepholeglobal_options.x_flag_no_peephole && !nopeepholes)
 {
   rtx_insn *next = peephole (insn);
   /* When peepholing, if there were notes within the peephole,
      emit them before the peephole.  */
   if (next != 0 && next != NEXT_INSN (insn))
     {
rtx_insn *note, *prev = PREV_INSN (insn);

for (note = NEXT_INSN (insn); note != next;
     note = NEXT_INSN (note))
  final_scan_insn (note, file, optimize_p, nopeepholes, seen);

/* Put the notes in the proper position for a later
   rescan.  For example, the SH target can do this
   when generating a far jump in a delayed branch
   sequence.  */
note = NEXT_INSN (insn);
SET_PREV_INSN (note) = prev;
SET_NEXT_INSN (prev) = note;
SET_NEXT_INSN (PREV_INSN (next)) = insn;
SET_PREV_INSN (insn) = PREV_INSN (next);
SET_NEXT_INSN (insn) = next;
SET_PREV_INSN (next) = insn;
     }

   /* PEEPHOLE might have changed this.  */
   body = PATTERN (insn);
 }

/* Try to recognize the instruction.
  If successful, verify that the operands satisfy the
  constraints for the instruction.  Crash if they don't,
  since `reload' should have changed them so that they do.  */

insn_code_number = recog_memoized (insn);
cleanup_subreg_operands (insn);

/* Dump the insn in the assembly for debugging (-dAP).
  If the final dump is requested as slim RTL, dump slim
  RTL to the assembly file also.  */
if (flag_dump_rtl_in_asmglobal_options.x_flag_dump_rtl_in_asm)
 {
   print_rtx_head = ASM_COMMENT_START"#";
   if (! (dump_flags & TDF_SLIM))
     print_rtl_single (asm_out_file, insn);
   else
     dump_insn_slim (asm_out_file, insn);
   print_rtx_head = "";
 }

if (! constrain_operands_cached (insn, 1))
 fatal_insn_not_found (insn)_fatal_insn_not_found (insn, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2758, __FUNCTION__);

/* Some target machines need to prescan each insn before
  it is output.  */

2763#ifdef FINAL_PRESCAN_INSN
FINAL_PRESCAN_INSN (insn, recog_data.operand, recog_data.n_operands);
2765#endif

if (targetm.have_conditional_execution ()
   && GET_CODE (PATTERN (insn))((enum rtx_code) (PATTERN (insn))->code) == COND_EXEC)
 current_insn_predicate = COND_EXEC_TEST (PATTERN (insn))(((PATTERN (insn))->u.fld[0]).rt_rtx);

current_output_insn = debug_insn = insn;

/* Find the proper template for this insn.  */
templ = get_insn_template (insn_code_number, insn);

/* If the C code returns 0, it means that it is a jump insn
  which follows a deleted test insn, and that test insn
  needs to be reinserted.  */
if (templ == 0)
 {
   rtx_insn *prev;

   gcc_assert (prev_nonnote_insn (insn) == last_ignored_compare)((void)(!(prev_nonnote_insn (insn) == last_ignored_compare) ?
 fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2783, __FUNCTION__), 0 : 0));

   /* We have already processed the notes between the setter and
      the user.  Make sure we don't process them again, this is
      particularly important if one of the notes is a block
      scope note or an EH note.  */
   for (prev = insn;
 prev != last_ignored_compare;
 prev = PREV_INSN (prev))
     {
if (NOTE_P (prev)(((enum rtx_code) (prev)->code) == NOTE))
  delete_insn (prev);	/* Use delete_note.  */
     }

   return prev;
 }

/* If the template is the string "#", it means that this insn must
  be split.  */
if (templ[0] == '#' && templ[1] == '\0')
 {
   rtx_insn *new_rtx = try_split (body, insn, 0);

   /* If we didn't split the insn, go away.  */
   if (new_rtx == insn && PATTERN (new_rtx) == body)
     fatal_insn ("could not split insn", insn)_fatal_insn ("could not split insn", insn, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2808, __FUNCTION__);

   /* If we have a length attribute, this instruction should have
      been split in shorten_branches, to ensure that we would have
      valid length info for the splitees.  */
   gcc_assert (!HAVE_ATTR_length)((void)(!(!1) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2813, __FUNCTION__), 0 : 0));

   return new_rtx;
 }

/* ??? This will put the directives in the wrong place if
  get_insn_template outputs assembly directly.  However calling it
  before get_insn_template breaks if the insns is split.  */
if (targetm.asm_out.unwind_emit_before_insn
   && targetm.asm_out.unwind_emit)
 targetm.asm_out.unwind_emit (asm_out_file, insn);

rtx_call_insn *call_insn = dyn_cast <rtx_call_insn *> (insn);
if (call_insn != NULL__null)
 {
   rtx x = call_from_call_insn (call_insn);
   x = XEXP (x, 0)(((x)->u.fld[0]).rt_rtx);
   if (x && MEM_P (x)(((enum rtx_code) (x)->code) == MEM) && GET_CODE (XEXP (x, 0))((enum rtx_code) ((((x)->u.fld[0]).rt_rtx))->code) == SYMBOL_REF)
     {
tree t;
x = XEXP (x, 0)(((x)->u.fld[0]).rt_rtx);
t = SYMBOL_REF_DECL (x)((__extension__ ({ __typeof ((x)) const _rtx = ((x)); if (((enum
 rtx_code) (_rtx)->code) != SYMBOL_REF) rtl_check_failed_flag
 ("CONSTANT_POOL_ADDRESS_P", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2834, __FUNCTION__); _rtx; })->unchanging) ? __null : ((
((x))->u.fld[1]).rt_tree));
if (t)
  assemble_external (t);
     }
 }

/* Output assembler code from the template.  */
output_asm_insn (templ, recog_data.operand);

/* Some target machines need to postscan each insn after
  it is output.  */
if (targetm.asm_out.final_postscan_insn)
 targetm.asm_out.final_postscan_insn (file, insn, recog_data.operand,
			       recog_data.n_operands);

if (!targetm.asm_out.unwind_emit_before_insn
   && targetm.asm_out.unwind_emit)
 targetm.asm_out.unwind_emit (asm_out_file, insn);

/* Let the debug info back-end know about this call.  We do this only
  after the instruction has been emitted because labels that may be
  created to reference the call instruction must appear after it.  */
if ((debug_variable_location_viewsglobal_options.x_debug_variable_location_views || call_insn != NULL__null)
   && !DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2857, __FUNCTION__))->decl_common.ignored_flag))
 debug_hooks->var_location (insn);

current_output_insn = debug_insn = 0;
    }
  }
return NEXT_INSN (insn);
2864}

2866/* This is a wrapper around final_scan_insn_1 that allows ports to
 call it recursively without a known value for SEEN.  The value is
 saved at the outermost call, and recovered for recursive calls.
 Recursive calls MUST pass NULL, or the same pointer if they can
 otherwise get to it.  */

2872rtx_insn *
2873final_scan_insn (rtx_insn *insn, FILE *file, int optimize_p,
 int nopeepholes, int *seen)
2875{
static int *enclosing_seen;
static int recursion_counter;

gcc_assert (seen || recursion_counter)((void)(!(seen || recursion_counter) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2879, __FUNCTION__), 0 : 0));
gcc_assert (!recursion_counter || !seen || seen == enclosing_seen)((void)(!(!recursion_counter || !seen || seen == enclosing_seen
) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2880, __FUNCTION__), 0 : 0));

if (!recursion_counter++)
  enclosing_seen = seen;
else if (!seen)
  seen = enclosing_seen;

rtx_insn *ret = final_scan_insn_1 (insn, file, optimize_p, nopeepholes, seen);

if (!--recursion_counter)
  enclosing_seen = NULL__null;

return ret;
2893}

2895

2897/* Map DECLs to instance discriminators.  This is allocated and
 defined in ada/gcc-interfaces/trans.cc, when compiling with -gnateS.
 Mappings from this table are saved and restored for LTO, so
 link-time compilation will have this map set, at least in
 partitions containing at least one DECL with an associated instance
 discriminator.  */

2904decl_to_instance_map_t *decl_to_instance_map;

2906/* Return the instance number assigned to DECL.  */

2908static inline int
2909map_decl_to_instance (const_tree decl)
2910{
int *inst;

if (!decl_to_instance_map || !decl || !DECL_P (decl)(tree_code_type_tmpl <0>::tree_code_type[(int) (((enum tree_code
) (decl)->base.code))] == tcc_declaration))
  return 0;

inst = decl_to_instance_map->get (decl);

if (!inst)
  return 0;

return *inst;
2922}

2924/* Set DISCRIMINATOR to the appropriate value, possibly derived from LOC.  */

2926static inline int
2927compute_discriminator (location_t loc)
2928{
int discriminator;

if (!decl_to_instance_map)
  discriminator = get_discriminator_from_loc (loc);
else
  {
    tree block = LOCATION_BLOCK (loc)((tree) ((IS_ADHOC_LOC (loc)) ? get_data_from_adhoc_loc (line_table
, (loc)) : __null));

    while (block && TREE_CODE (block)((enum tree_code) (block)->base.code) == BLOCK
    && !inlined_function_outer_scope_p (block))
block = BLOCK_SUPERCONTEXT (block)((tree_check ((block), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 2939, __FUNCTION__, (BLOCK)))->block.supercontext);

    tree decl;

    if (!block)
decl = current_function_decl;
    else if (DECL_P (block)(tree_code_type_tmpl <0>::tree_code_type[(int) (((enum tree_code
) (block)->base.code))] == tcc_declaration))
decl = block;
    else
decl = block_ultimate_origin (block);

    discriminator = map_decl_to_instance (decl);
  }

return discriminator;
2954}

2956/* Return discriminator of the statement that produced this insn.  */
2957int
2958insn_discriminator (const rtx_insn *insn)
2959{
return compute_discriminator (INSN_LOCATION (insn));
2961}

2963/* Return whether a source line note needs to be emitted before INSN.
 Sets IS_STMT to TRUE if the line should be marked as a possible
 breakpoint location.  */

2967static bool
2968notice_source_line (rtx_insn *insn, bool *is_stmt)
2969{
const char *filename;
int linenum, columnnum;
int discriminator;

if (NOTE_MARKER_P (insn)((((enum rtx_code) (insn)->code) == NOTE) && ((((insn
)->u.fld[4]).rt_int) == NOTE_INSN_BEGIN_STMT || (((insn)->
u.fld[4]).rt_int) == NOTE_INSN_INLINE_ENTRY)))
  {
    location_t loc = NOTE_MARKER_LOCATION (insn)(((insn)->u.fld[3]).rt_uint);
    expanded_location xloc = expand_location (loc);
    if (xloc.line == 0
 && (LOCATION_LOCUS (loc)((IS_ADHOC_LOC (loc)) ? get_location_from_adhoc_loc (line_table
, loc) : (loc)) == UNKNOWN_LOCATION((location_t) 0)
     || LOCATION_LOCUS (loc)((IS_ADHOC_LOC (loc)) ? get_location_from_adhoc_loc (line_table
, loc) : (loc)) == BUILTINS_LOCATION((location_t) 1)))
return false;

    filename = xloc.file;
    linenum = xloc.line;
    columnnum = xloc.column;
    discriminator = compute_discriminator (loc);
    force_source_line = true;
  }
else if (override_filename)
  {
    filename = override_filename;
    linenum = override_linenum;
    columnnum = override_columnnum;
    discriminator = override_discriminator;
  }
else if (INSN_HAS_LOCATION (insn))
  {
    expanded_location xloc = insn_location (insn);
    filename = xloc.file;
    linenum = xloc.line;
    columnnum = xloc.column;
    discriminator = insn_discriminator (insn);
  }
else
  {
    filename = NULL__null;
    linenum = 0;
    columnnum = 0;
    discriminator = 0;
  }

if (filename == NULL__null)
  return false;

if (force_source_line
    || filename != last_filename
    || last_linenum != linenum
    || (debug_column_infoglobal_options.x_debug_column_info && last_columnnum != columnnum))
  {
    force_source_line = false;
    last_filename = filename;
    last_linenum = linenum;
    last_columnnum = columnnum;
    last_discriminator = discriminator;
    if (is_stmt)
*is_stmt = true;
    high_block_linenum = MAX (last_linenum, high_block_linenum)((last_linenum) > (high_block_linenum) ? (last_linenum) : (
high_block_linenum));
    high_function_linenum = MAX (last_linenum, high_function_linenum)((last_linenum) > (high_function_linenum) ? (last_linenum)
 : (high_function_linenum));
    return true;
  }

if (SUPPORTS_DISCRIMINATOR1 && last_discriminator != discriminator)
  {
    /* If the discriminator changed, but the line number did not,
       output the line table entry with is_stmt false so the
       debugger does not treat this as a breakpoint location.  */
    last_discriminator = discriminator;
    if (is_stmt)
*is_stmt = false;
    return true;
  }

return false;
3044}
3045
3046/* For each operand in INSN, simplify (subreg (reg)) so that it refers
 directly to the desired hard register.  */

3049void
3050cleanup_subreg_operands (rtx_insn *insn)
3051{
int i;
bool changed = false;
extract_insn_cached (insn);
for (i = 0; i < recog_data.n_operands; i++)
  {
    /* The following test cannot use recog_data.operand when testing
for a SUBREG: the underlying object might have been changed
already if we are inside a match_operator expression that
matches the else clause.  Instead we test the underlying
expression directly.  */
    if (GET_CODE (*recog_data.operand_loc[i])((enum rtx_code) (*recog_data.operand_loc[i])->code) == SUBREG)
{
 recog_data.operand[i] = alter_subreg (recog_data.operand_loc[i], true);
 changed = true;
}
    else if (GET_CODE (recog_data.operand[i])((enum rtx_code) (recog_data.operand[i])->code) == PLUS
      || GET_CODE (recog_data.operand[i])((enum rtx_code) (recog_data.operand[i])->code) == MULT
      || MEM_P (recog_data.operand[i])(((enum rtx_code) (recog_data.operand[i])->code) == MEM))
recog_data.operand[i] = walk_alter_subreg (recog_data.operand_loc[i], &changed);
  }

for (i = 0; i < recog_data.n_dups; i++)
  {
    if (GET_CODE (*recog_data.dup_loc[i])((enum rtx_code) (*recog_data.dup_loc[i])->code) == SUBREG)
{
 *recog_data.dup_loc[i] = alter_subreg (recog_data.dup_loc[i], true);
 changed = true;
}
    else if (GET_CODE (*recog_data.dup_loc[i])((enum rtx_code) (*recog_data.dup_loc[i])->code) == PLUS
      || GET_CODE (*recog_data.dup_loc[i])((enum rtx_code) (*recog_data.dup_loc[i])->code) == MULT
      || MEM_P (*recog_data.dup_loc[i])(((enum rtx_code) (*recog_data.dup_loc[i])->code) == MEM))
*recog_data.dup_loc[i] = walk_alter_subreg (recog_data.dup_loc[i], &changed);
  }
if (changed)
  df_insn_rescan (insn);
3087}

3089/* If X is a SUBREG, try to replace it with a REG or a MEM, based on
 the thing it is a subreg of.  Do it anyway if FINAL_P.  */

3092rtx
3093alter_subreg (rtx *xp, bool final_p)
3094{
rtx x = *xp;
rtx y = SUBREG_REG (x)(((x)->u.fld[0]).rt_rtx);

/* simplify_subreg does not remove subreg from volatile references.
   We are required to.  */
if (MEM_P (y)(((enum rtx_code) (y)->code) == MEM))
  {
    poly_int64 offset = SUBREG_BYTE (x)(((x)->u.fld[1]).rt_subreg);

    /* For paradoxical subregs on big-endian machines, SUBREG_BYTE
contains 0 instead of the proper offset.  See simplify_subreg.  */
    if (paradoxical_subreg_p (x))
offset = byte_lowpart_offset (GET_MODE (x)((machine_mode) (x)->mode), GET_MODE (y)((machine_mode) (y)->mode));

    if (final_p)
*xp = adjust_address (y, GET_MODE (x), offset)adjust_address_1 (y, ((machine_mode) (x)->mode), offset, 1
, 1, 0, 0);
    else
*xp = adjust_address_nv (y, GET_MODE (x), offset)adjust_address_1 (y, ((machine_mode) (x)->mode), offset, 0
, 1, 0, 0);
  }
else if (REG_P (y)(((enum rtx_code) (y)->code) == REG) && HARD_REGISTER_P (y)((((rhs_regno(y))) < 76)))
  {
    rtx new_rtx = simplify_subreg (GET_MODE (x)((machine_mode) (x)->mode), y, GET_MODE (y)((machine_mode) (y)->mode),
		     SUBREG_BYTE (x)(((x)->u.fld[1]).rt_subreg));

    if (new_rtx != 0)
*xp = new_rtx;
    else if (final_p && REG_P (y)(((enum rtx_code) (y)->code) == REG))
{
 /* Simplify_subreg can't handle some REG cases, but we have to.  */
 unsigned int regno;
 poly_int64 offset;

 regno = subreg_regno (x);
 if (subreg_lowpart_p (x))
   offset = byte_lowpart_offset (GET_MODE (x)((machine_mode) (x)->mode), GET_MODE (y)((machine_mode) (y)->mode));
 else
   offset = SUBREG_BYTE (x)(((x)->u.fld[1]).rt_subreg);
 *xp = gen_rtx_REG_offset (y, GET_MODE (x)((machine_mode) (x)->mode), regno, offset);
}
  }

return *xp;
3137}

3139/* Do alter_subreg on all the SUBREGs contained in X.  */

3141static rtx
3142walk_alter_subreg (rtx *xp, bool *changed)
3143{
rtx x = *xp;
switch (GET_CODE (x)((enum rtx_code) (x)->code))
  {
  case PLUS:
  case MULT:
  case AND:
    XEXP (x, 0)(((x)->u.fld[0]).rt_rtx) = walk_alter_subreg (&XEXP (x, 0)(((x)->u.fld[0]).rt_rtx), changed);
    XEXP (x, 1)(((x)->u.fld[1]).rt_rtx) = walk_alter_subreg (&XEXP (x, 1)(((x)->u.fld[1]).rt_rtx), changed);
    break;

  case MEM:
  case ZERO_EXTEND:
    XEXP (x, 0)(((x)->u.fld[0]).rt_rtx) = walk_alter_subreg (&XEXP (x, 0)(((x)->u.fld[0]).rt_rtx), changed);
    break;

  case SUBREG:
    *changed = true;
    return alter_subreg (xp, true);

  default:
    break;
  }

return *xp;
3168}
3169
3170/* Report inconsistency between the assembler template and the operands.
 In an `asm', it's the user's fault; otherwise, the compiler's fault.  */

3173void
3174output_operand_lossage (const char *cmsgid, ...)
3175{
char *fmt_string;
char *new_message;
const char *pfx_str;
va_list ap;

va_start (ap, cmsgid)__builtin_va_start(ap, cmsgid);

pfx_str = this_is_asm_operands ? _("invalid 'asm': ")gettext ("invalid 'asm': ") : "output_operand: ";
fmt_string = xasprintf ("%s%s", pfx_str, _(cmsgid)gettext (cmsgid));
new_message = xvasprintf (fmt_string, ap);

if (this_is_asm_operands)
  error_for_asm (this_is_asm_operands, "%s", new_message);
else
  internal_error ("%s", new_message);

free (fmt_string);
free (new_message);
va_end (ap)__builtin_va_end(ap);
3195}
3196
3197/* Output of assembler code from a template, and its subroutines.  */

3199/* Annotate the assembly with a comment describing the pattern and
 alternative used.  */

3202static void
3203output_asm_name (void)
3204{
if (debug_insn)
  {
    fprintf (asm_out_file, "\t%s %d\t",
      ASM_COMMENT_START"#", INSN_UID (debug_insn));

    fprintf (asm_out_file, "[c=%d",
      insn_cost (debug_insn, optimize_insn_for_speed_p ()));
    if (HAVE_ATTR_length1)
fprintf (asm_out_file, " l=%d",
 get_attr_length (debug_insn));
    fprintf (asm_out_file, "]  ");

    int num = INSN_CODE (debug_insn)(((debug_insn)->u.fld[5]).rt_int);
    fprintf (asm_out_file, "%s", insn_data[num].name);
    if (insn_data[num].n_alternatives > 1)
fprintf (asm_out_file, "/%d", which_alternative);

    /* Clear this so only the first assembler insn
of any rtl insn will get the special comment for -dp.  */
    debug_insn = 0;
  }
3226}

3228/* If OP is a REG or MEM and we can find a MEM_EXPR corresponding to it
 or its address, return that expr .  Set *PADDRESSP to 1 if the expr
 corresponds to the address of the object and 0 if to the object.  */

3232static tree
3233get_mem_expr_from_op (rtx op, int *paddressp)
3234{
tree expr;
int inner_addressp;

*paddressp = 0;

if (REG_P (op)(((enum rtx_code) (op)->code) == REG))
  return REG_EXPR (op)(((&(op)->u.reg)->attrs) == 0 ? 0 : ((&(op)->
u.reg)->attrs)->decl);
else if (!MEM_P (op)(((enum rtx_code) (op)->code) == MEM))
  return 0;

if (MEM_EXPR (op)(get_mem_attrs (op)->expr) != 0)
  return MEM_EXPR (op)(get_mem_attrs (op)->expr);

/* Otherwise we have an address, so indicate it and look at the address.  */
*paddressp = 1;
op = XEXP (op, 0)(((op)->u.fld[0]).rt_rtx);

/* First check if we have a decl for the address, then look at the right side
   if it is a PLUS.  Otherwise, strip off arithmetic and keep looking.
   But don't allow the address to itself be indirect.  */
if ((expr = get_mem_expr_from_op (op, &inner_addressp)) && ! inner_addressp)
  return expr;
else if (GET_CODE (op)((enum rtx_code) (op)->code) == PLUS
  && (expr = get_mem_expr_from_op (XEXP (op, 1)(((op)->u.fld[1]).rt_rtx), &inner_addressp)))
  return expr;

while (UNARY_P (op)((rtx_class[(int) (((enum rtx_code) (op)->code))]) == RTX_UNARY
)
|| GET_RTX_CLASS (GET_CODE (op))(rtx_class[(int) (((enum rtx_code) (op)->code))]) == RTX_BIN_ARITH)
  op = XEXP (op, 0)(((op)->u.fld[0]).rt_rtx);

expr = get_mem_expr_from_op (op, &inner_addressp);
return inner_addressp ? 0 : expr;
3267}

3269/* Output operand names for assembler instructions.  OPERANDS is the
 operand vector, OPORDER is the order to write the operands, and NOPS
 is the number of operands to write.  */

3273static void
3274output_asm_operand_names (rtx *operands, int *oporder, int nops)
3275{
int wrote = 0;
int i;

for (i = 0; i < nops; i++)
  {
    int addressp;
    rtx op = operands[oporder[i]];
    tree expr = get_mem_expr_from_op (op, &addressp);

    fprintf (asm_out_file, "%c%s",
      wrote ? ',' : '\t', wrote ? "" : ASM_COMMENT_START"#");
    wrote = 1;
    if (expr)
{
 fprintf (asm_out_file, "%s",
   addressp ? "*" : "");
 print_mem_expr (asm_out_file, expr);
 wrote = 1;
}
    else if (REG_P (op)(((enum rtx_code) (op)->code) == REG) && ORIGINAL_REGNO (op)(__extension__ ({ __typeof ((op)) const _rtx = ((op)); if (((
enum rtx_code) (_rtx)->code) != REG) rtl_check_failed_flag
 ("ORIGINAL_REGNO", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 3295, __FUNCTION__); _rtx; })->u2.original_regno)
      && ORIGINAL_REGNO (op)(__extension__ ({ __typeof ((op)) const _rtx = ((op)); if (((
enum rtx_code) (_rtx)->code) != REG) rtl_check_failed_flag
 ("ORIGINAL_REGNO", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 3296, __FUNCTION__); _rtx; })->u2.original_regno) != REGNO (op)(rhs_regno(op)))
fprintf (asm_out_file, " tmp%i", ORIGINAL_REGNO (op)(__extension__ ({ __typeof ((op)) const _rtx = ((op)); if (((
enum rtx_code) (_rtx)->code) != REG) rtl_check_failed_flag
 ("ORIGINAL_REGNO", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 3297, __FUNCTION__); _rtx; })->u2.original_regno));
  }
3299}

3301#ifdef ASSEMBLER_DIALECT(global_options.x_ix86_asm_dialect)
3302/* Helper function to parse assembler dialects in the asm string.
 This is called from output_asm_insn and asm_fprintf.  */
3304static const char *
3305do_assembler_dialects (const char *p, int *dialect)
3306{
char c = *(p - 1);

switch (c)
  {
  case '{':
    {
      int i;

      if (*dialect)
        output_operand_lossage ("nested assembly dialect alternatives");
      else
        *dialect = 1;

      /* If we want the first dialect, do nothing.  Otherwise, skip
         DIALECT_NUMBER of strings ending with '|'.  */
      for (i = 0; i < dialect_number; i++)
        {
          while (*p && *p != '}')
     {
if (*p == '|')
  {
    p++;
    break;
  }

/* Skip over any character after a percent sign.  */
if (*p == '%')
  p++;
if (*p)
  p++;
     }

          if (*p == '}')
     break;
        }

      if (*p == '\0')
        output_operand_lossage ("unterminated assembly dialect alternative");
    }
    break;

  case '|':
    if (*dialect)
      {
        /* Skip to close brace.  */
        do
          {
     if (*p == '\0')
{
  output_operand_lossage ("unterminated assembly dialect alternative");
  break;
}

     /* Skip over any character after a percent sign.  */
     if (*p == '%' && p[1])
{
  p += 2;
  continue;
}

     if (*p++ == '}')
break;
          }
        while (1);

        *dialect = 0;
      }
    else
      putc (c, asm_out_file);
    break;

  case '}':
    if (! *dialect)
      putc (c, asm_out_file);
    *dialect = 0;
    break;
  default:
    gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 3384, __FUNCTION__));
  }

return p;
3388}
3389#endif

3391/* Output text from TEMPLATE to the assembler output file,
 obeying %-directions to substitute operands taken from
 the vector OPERANDS.

 %N (for N a digit) means print operand N in usual manner.
 %lN means require operand N to be a CODE_LABEL or LABEL_REF
    and print the label name with no punctuation.
 %cN means require operand N to be a constant
    and print the constant expression with no punctuation.
 %aN means expect operand N to be a memory address
    (not a memory reference!) and print a reference
    to that address.
 %nN means expect operand N to be a constant
    and print a constant expression for minus the value
    of the operand, with no other punctuation.  */

3407void
3408output_asm_insn (const char *templ, rtx *operands)
3409{
const char *p;
int c;
3412#ifdef ASSEMBLER_DIALECT(global_options.x_ix86_asm_dialect)
int dialect = 0;
3414#endif
int oporder[MAX_RECOG_OPERANDS30];
char opoutput[MAX_RECOG_OPERANDS30];
int ops = 0;

/* An insn may return a null string template
   in a case where no assembler code is needed.  */
if (*templ == 0)
  return;

memset (opoutput, 0, sizeof opoutput);
p = templ;
putc ('\t', asm_out_file);

3428#ifdef ASM_OUTPUT_OPCODE
ASM_OUTPUT_OPCODE (asm_out_file, p){ if (((p))[0] == '%' && ((p))[1] == 'v') ((p)) += ((
global_options.x_ix86_isa_flags & (1UL << 8)) != 0)
 ? 1 : 2; };
3430#endif

while ((c = *p++))
  switch (c)
    {
    case '\n':
if (flag_verbose_asmglobal_options.x_flag_verbose_asm)
 output_asm_operand_names (operands, oporder, ops);
if (flag_print_asm_nameglobal_options.x_flag_print_asm_name)
 output_asm_name ();

ops = 0;
memset (opoutput, 0, sizeof opoutput);

putc (c, asm_out_file);
3445#ifdef ASM_OUTPUT_OPCODE
while ((c = *p) == '\t')
 {
   putc (c, asm_out_file);
   p++;
 }
ASM_OUTPUT_OPCODE (asm_out_file, p){ if (((p))[0] == '%' && ((p))[1] == 'v') ((p)) += ((
global_options.x_ix86_isa_flags & (1UL << 8)) != 0)
 ? 1 : 2; };
3452#endif
break;

3455#ifdef ASSEMBLER_DIALECT(global_options.x_ix86_asm_dialect)
    case '{':
    case '}':
    case '|':
p = do_assembler_dialects (p, &dialect);
break;
3461#endif

    case '%':
/* %% outputs a single %.  %{, %} and %| print {, } and | respectively
  if ASSEMBLER_DIALECT defined and these characters have a special
  meaning as dialect delimiters.*/
if (*p == '%'
3468#ifdef ASSEMBLER_DIALECT(global_options.x_ix86_asm_dialect)
   || *p == '{' || *p == '}' || *p == '|'
3470#endif
   )
 {
   putc (*p, asm_out_file);
   p++;
 }
/* %= outputs a number which is unique to each insn in the entire
  compilation.  This is useful for making local labels that are
  referred to more than once in a given insn.  */
else if (*p == '=')
 {
   p++;
   fprintf (asm_out_file, "%d", insn_counter);
 }
/* % followed by a letter and some digits
  outputs an operand in a special way depending on the letter.
  Letters `acln' are implemented directly.
  Other letters are passed to `output_operand' so that
  the TARGET_PRINT_OPERAND hook can define them.  */
else if (ISALPHA (*p)(_sch_istable[(*p) & 0xff] & (unsigned short)(_sch_isalpha
)))
 {
   int letter = *p++;
   unsigned long opnum;
   char *endptr;

   opnum = strtoul (p, &endptr, 10);

   if (endptr == p)
     output_operand_lossage ("operand number missing "
		      "after %%-letter");
   else if (this_is_asm_operands && opnum >= insn_noperands)
     output_operand_lossage ("operand number out of range");
   else if (letter == 'l')
     output_asm_label (operands[opnum]);
   else if (letter == 'a')
     output_address (VOIDmode((void) 0, E_VOIDmode), operands[opnum]);
   else if (letter == 'c')
     {
if (CONSTANT_ADDRESS_P (operands[opnum])constant_address_p (operands[opnum]))
  output_addr_const (asm_out_file, operands[opnum]);
else
  output_operand (operands[opnum], 'c');
     }
   else if (letter == 'n')
     {
if (CONST_INT_P (operands[opnum])(((enum rtx_code) (operands[opnum])->code) == CONST_INT))
  fprintf (asm_out_file, HOST_WIDE_INT_PRINT_DEC"%" "l" "d",
	   - INTVAL (operands[opnum])((operands[opnum])->u.hwint[0]));
else
  {
    putc ('-', asm_out_file);
    output_addr_const (asm_out_file, operands[opnum]);
  }
     }
   else
     output_operand (operands[opnum], letter);

   if (!opoutput[opnum])
     oporder[ops++] = opnum;
   opoutput[opnum] = 1;

   p = endptr;
   c = *p;
 }
/* % followed by a digit outputs an operand the default way.  */
else if (ISDIGIT (*p)(_sch_istable[(*p) & 0xff] & (unsigned short)(_sch_isdigit
)))
 {
   unsigned long opnum;
   char *endptr;

   opnum = strtoul (p, &endptr, 10);
   if (this_is_asm_operands && opnum >= insn_noperands)
     output_operand_lossage ("operand number out of range");
   else
     output_operand (operands[opnum], 0);

   if (!opoutput[opnum])
     oporder[ops++] = opnum;
   opoutput[opnum] = 1;

   p = endptr;
   c = *p;
 }
/* % followed by punctuation: output something for that
  punctuation character alone, with no operand.  The
  TARGET_PRINT_OPERAND hook decides what is actually done.  */
else if (targetm.asm_out.print_operand_punct_valid_p ((unsigned char) *p))
 output_operand (NULL_RTX(rtx) 0, *p++);
else
 output_operand_lossage ("invalid %%-code");
break;

    default:
putc (c, asm_out_file);
    }

/* Try to keep the asm a bit more readable.  */
if ((flag_verbose_asmglobal_options.x_flag_verbose_asm || flag_print_asm_nameglobal_options.x_flag_print_asm_name) && strlen (templ) < 9)
  putc ('\t', asm_out_file);

/* Write out the variable names for operands, if we know them.  */
if (flag_verbose_asmglobal_options.x_flag_verbose_asm)
  output_asm_operand_names (operands, oporder, ops);
if (flag_print_asm_nameglobal_options.x_flag_print_asm_name)
  output_asm_name ();

putc ('\n', asm_out_file);
3577}
3578
3579/* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol.  */

3581void
3582output_asm_label (rtx x)
3583{
char buf[256];

if (GET_CODE (x)((enum rtx_code) (x)->code) == LABEL_REF)
  x = label_ref_label (x);
if (LABEL_P (x)(((enum rtx_code) (x)->code) == CODE_LABEL)
    || (NOTE_P (x)(((enum rtx_code) (x)->code) == NOTE)
 && NOTE_KIND (x)(((x)->u.fld[4]).rt_int) == NOTE_INSN_DELETED_LABEL))
  ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x))do { char *__p; (buf)[0] = '*'; (buf)[1] = '.'; __p = stpcpy (
&(buf)[2], "L"); sprint_ul (__p, (unsigned long) ((((x)->
u.fld[5]).rt_int))); } while (0);
else
  output_operand_lossage ("'%%l' operand isn't a label");

assemble_name (asm_out_file, buf);
3596}

3598/* Marks SYMBOL_REFs in x as referenced through use of assemble_external.  */

3600void
3601mark_symbol_refs_as_used (rtx x)
3602{
subrtx_iterator::array_type array;
FOR_EACH_SUBRTX (iter, array, x, ALL)for (subrtx_iterator iter (array, x, rtx_all_subrtx_bounds); !
iter.at_end (); iter.next ())
  {
    const_rtx x = *iter;
    if (GET_CODE (x)((enum rtx_code) (x)->code) == SYMBOL_REF)
if (tree t = SYMBOL_REF_DECL (x)((__extension__ ({ __typeof ((x)) const _rtx = ((x)); if (((enum
 rtx_code) (_rtx)->code) != SYMBOL_REF) rtl_check_failed_flag
 ("CONSTANT_POOL_ADDRESS_P", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 3608, __FUNCTION__); _rtx; })->unchanging) ? __null : ((
((x))->u.fld[1]).rt_tree)))
 assemble_external (t);
  }
3611}

3613/* Print operand X using machine-dependent assembler syntax.
 CODE is a non-digit that preceded the operand-number in the % spec,
 such as 'z' if the spec was `%z3'.  CODE is 0 if there was no char
 between the % and the digits.
 When CODE is a non-letter, X is 0.

 The meanings of the letters are machine-dependent and controlled
 by TARGET_PRINT_OPERAND.  */

3622void
3623output_operand (rtx x, int code ATTRIBUTE_UNUSED__attribute__ ((__unused__)))
3624{
if (x && GET_CODE (x)((enum rtx_code) (x)->code) == SUBREG)
  x = alter_subreg (&x, true);

/* X must not be a pseudo reg.  */
if (!targetm.no_register_allocation)
  gcc_assert (!x || !REG_P (x) || REGNO (x) < FIRST_PSEUDO_REGISTER)((void)(!(!x || !(((enum rtx_code) (x)->code) == REG) || (
rhs_regno(x)) < 76) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 3630, __FUNCTION__), 0 : 0));

targetm.asm_out.print_operand (asm_out_file, x, code);

if (x == NULL_RTX(rtx) 0)
  return;

mark_symbol_refs_as_used (x);
3638}

3640/* Print a memory reference operand for address X using
 machine-dependent assembler syntax.  */

3643void
3644output_address (machine_mode mode, rtx x)
3645{
bool changed = false;
walk_alter_subreg (&x, &changed);
targetm.asm_out.print_operand_address (asm_out_file, mode, x);
3649}
3650
3651/* Print an integer constant expression in assembler syntax.
 Addition and subtraction are the only arithmetic
 that may appear in these expressions.  */

3655void
3656output_addr_const (FILE *file, rtx x)
3657{
char buf[256];

restart:
switch (GET_CODE (x)((enum rtx_code) (x)->code))
  {
  case PC:
    putc ('.', file);
    break;

  case SYMBOL_REF:
    if (SYMBOL_REF_DECL (x)((__extension__ ({ __typeof ((x)) const _rtx = ((x)); if (((enum
 rtx_code) (_rtx)->code) != SYMBOL_REF) rtl_check_failed_flag
 ("CONSTANT_POOL_ADDRESS_P", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 3668, __FUNCTION__); _rtx; })->unchanging) ? __null : ((
((x))->u.fld[1]).rt_tree)))
assemble_external (SYMBOL_REF_DECL (x)((__extension__ ({ __typeof ((x)) const _rtx = ((x)); if (((enum
 rtx_code) (_rtx)->code) != SYMBOL_REF) rtl_check_failed_flag
 ("CONSTANT_POOL_ADDRESS_P", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 3669, __FUNCTION__); _rtx; })->unchanging) ? __null : ((
((x))->u.fld[1]).rt_tree)));
3670#ifdef ASM_OUTPUT_SYMBOL_REF
    ASM_OUTPUT_SYMBOL_REF (file, x)do { const char *name = assemble_name_resolve ((((x)->u.fld
[0]).rt_str)); if ((global_options.x_ix86_asm_dialect) == ASM_ATT
 && name[0] == '$' && user_label_prefix[0] ==
 '\0') { fputc ('(', (file)); assemble_name_raw ((file), name
); fputc (')', (file)); } else assemble_name_raw ((file), name
); } while (0);
3672#else
    assemble_name (file, XSTR (x, 0)(((x)->u.fld[0]).rt_str));
3674#endif
    break;

  case LABEL_REF:
    x = label_ref_label (x);
    /* Fall through.  */
  case CODE_LABEL:
    ASM_GENERATE_INTERNAL_LABEL (buf, "L", CODE_LABEL_NUMBER (x))do { char *__p; (buf)[0] = '*'; (buf)[1] = '.'; __p = stpcpy (
&(buf)[2], "L"); sprint_ul (__p, (unsigned long) ((((x)->
u.fld[5]).rt_int))); } while (0);
3682#ifdef ASM_OUTPUT_LABEL_REF
    ASM_OUTPUT_LABEL_REF (file, buf);
3684#else
    assemble_name (file, buf);
3686#endif
    break;

  case CONST_INT:
    fprintf (file, HOST_WIDE_INT_PRINT_DEC"%" "l" "d", INTVAL (x)((x)->u.hwint[0]));
    break;

  case CONST:
    /* This used to output parentheses around the expression,
but that does not work on the 386 (either ATT or BSD assembler).  */
    output_addr_const (file, XEXP (x, 0)(((x)->u.fld[0]).rt_rtx));
    break;

  case CONST_WIDE_INT:
    /* We do not know the mode here so we have to use a round about
way to build a wide-int to get it printed properly.  */
    {
wide_int w = wide_int::from_array (&CONST_WIDE_INT_ELT (x, 0)((x)->u.hwiv.elem[0]),
			   CONST_WIDE_INT_NUNITS (x)((int)__extension__ ({ __typeof ((x)) const _rtx = ((x)); if (
((enum rtx_code) (_rtx)->code) != CONST_WIDE_INT) rtl_check_failed_flag
 ("CWI_GET_NUM_ELEM", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 3704, __FUNCTION__); _rtx; })->u2.num_elem),
			   CONST_WIDE_INT_NUNITS (x)((int)__extension__ ({ __typeof ((x)) const _rtx = ((x)); if (
((enum rtx_code) (_rtx)->code) != CONST_WIDE_INT) rtl_check_failed_flag
 ("CWI_GET_NUM_ELEM", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 3705, __FUNCTION__); _rtx; })->u2.num_elem)
			   * HOST_BITS_PER_WIDE_INT64,
			   false);
print_decs (w, file);
    }
    break;

  case CONST_DOUBLE:
    if (CONST_DOUBLE_AS_INT_P (x)(((enum rtx_code) (x)->code) == CONST_DOUBLE && ((
machine_mode) (x)->mode) == ((void) 0, E_VOIDmode)))
{
 /* We can use %d if the number is one word and positive.  */
 if (CONST_DOUBLE_HIGH (x)((x)->u.hwint[1]))
   fprintf (file, HOST_WIDE_INT_PRINT_DOUBLE_HEX"0x%" "l" "x" "%016" "l" "x",
     (unsigned HOST_WIDE_INTlong) CONST_DOUBLE_HIGH (x)((x)->u.hwint[1]),
     (unsigned HOST_WIDE_INTlong) CONST_DOUBLE_LOW (x)((x)->u.hwint[0]));
 else if (CONST_DOUBLE_LOW (x)((x)->u.hwint[0]) < 0)
   fprintf (file, HOST_WIDE_INT_PRINT_HEX"%#" "l" "x",
     (unsigned HOST_WIDE_INTlong) CONST_DOUBLE_LOW (x)((x)->u.hwint[0]));
 else
   fprintf (file, HOST_WIDE_INT_PRINT_DEC"%" "l" "d", CONST_DOUBLE_LOW (x)((x)->u.hwint[0]));
}
    else
/* We can't handle floating point constants;
  PRINT_OPERAND must handle them.  */
output_operand_lossage ("floating constant misused");
    break;

  case CONST_FIXED:
    fprintf (file, HOST_WIDE_INT_PRINT_DEC"%" "l" "d", CONST_FIXED_VALUE_LOW (x)((long) (((const struct fixed_value *) (&(x)->u.fv))->
data.low)));
    break;

  case PLUS:
    /* Some assemblers need integer constants to appear last (eg masm).  */
    if (CONST_INT_P (XEXP (x, 0))(((enum rtx_code) ((((x)->u.fld[0]).rt_rtx))->code) == CONST_INT
))
{
 output_addr_const (file, XEXP (x, 1)(((x)->u.fld[1]).rt_rtx));
 if (INTVAL (XEXP (x, 0))(((((x)->u.fld[0]).rt_rtx))->u.hwint[0]) >= 0)
   fprintf (file, "+");
 output_addr_const (file, XEXP (x, 0)(((x)->u.fld[0]).rt_rtx));
}
    else
{
 output_addr_const (file, XEXP (x, 0)(((x)->u.fld[0]).rt_rtx));
 if (!CONST_INT_P (XEXP (x, 1))(((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) == CONST_INT
)
     || INTVAL (XEXP (x, 1))(((((x)->u.fld[1]).rt_rtx))->u.hwint[0]) >= 0)
   fprintf (file, "+");
 output_addr_const (file, XEXP (x, 1)(((x)->u.fld[1]).rt_rtx));
}
    break;

  case MINUS:
    /* Avoid outputting things like x-x or x+5-x,
since some assemblers can't handle that.  */
    x = simplify_subtraction (x);
    if (GET_CODE (x)((enum rtx_code) (x)->code) != MINUS)
goto restart;

    output_addr_const (file, XEXP (x, 0)(((x)->u.fld[0]).rt_rtx));
    fprintf (file, "-");
    if ((CONST_INT_P (XEXP (x, 1))(((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) == CONST_INT
) && INTVAL (XEXP (x, 1))(((((x)->u.fld[1]).rt_rtx))->u.hwint[0]) >= 0)
 || GET_CODE (XEXP (x, 1))((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) == PC
 || GET_CODE (XEXP (x, 1))((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) == SYMBOL_REF)
output_addr_const (file, XEXP (x, 1)(((x)->u.fld[1]).rt_rtx));
    else
{
 fputs (targetm.asm_out.open_paren, file);
 output_addr_const (file, XEXP (x, 1)(((x)->u.fld[1]).rt_rtx));
 fputs (targetm.asm_out.close_paren, file);
}
    break;

  case ZERO_EXTEND:
  case SIGN_EXTEND:
  case SUBREG:
  case TRUNCATE:
    output_addr_const (file, XEXP (x, 0)(((x)->u.fld[0]).rt_rtx));
    break;

  default:
    if (targetm.asm_out.output_addr_const_extra (file, x))
break;

    output_operand_lossage ("invalid expression as operand");
  }
3789}
3790
3791/* Output a quoted string.  */

3793void
3794output_quoted_string (FILE *asm_file, const char *string)
3795{
3796#ifdef OUTPUT_QUOTED_STRING
OUTPUT_QUOTED_STRING (asm_file, string);
3798#else
char c;

putc ('\"', asm_file);
while ((c = *string++) != 0)
  {
    if (ISPRINT (c)(_sch_istable[(c) & 0xff] & (unsigned short)(_sch_isprint
)))
{
 if (c == '\"' || c == '\\')
   putc ('\\', asm_file);
 putc (c, asm_file);
}
    else
fprintf (asm_file, "\\%03o", (unsigned char) c);
  }
putc ('\"', asm_file);
3814#endif
3815}
3816
3817/* Write a HOST_WIDE_INT number in hex form 0x1234, fast. */

3819void
3820fprint_whex (FILE *f, unsigned HOST_WIDE_INTlong value)
3821{
char buf[2 + CHAR_BIT8 * sizeof (value) / 4];
if (value == 0)
  putc ('0', f);
else
  {
    char *p = buf + sizeof (buf);
    do
      *--p = "0123456789abcdef"[value % 16];
    while ((value /= 16) != 0);
    *--p = 'x';
    *--p = '0';
    fwrite (p, 1, buf + sizeof (buf) - p, f);
  }
3835}

3837/* Internal function that prints an unsigned long in decimal in reverse.
 The output string IS NOT null-terminated. */

3840static int
3841sprint_ul_rev (char *s, unsigned long value)
3842{
int i = 0;
do
  {
    s[i] = "0123456789"[value % 10];
    value /= 10;
    i++;
    /* alternate version, without modulo */
    /* oldval = value; */
    /* value /= 10; */
    /* s[i] = "0123456789" [oldval - 10*value]; */
    /* i++ */
  }
while (value != 0);
return i;
3857}

3859/* Write an unsigned long as decimal to a file, fast. */

3861void
3862fprint_ul (FILE *f, unsigned long value)
3863{
/* python says: len(str(2**64)) == 20 */
char s[20];
int i;

i = sprint_ul_rev (s, value);

/* It's probably too small to bother with string reversal and fputs. */
do
  {
    i--;
    putc (s[i], f);
  }
while (i != 0);
3877}

3879/* Write an unsigned long as decimal to a string, fast.
 s must be wide enough to not overflow, at least 21 chars.
 Returns the length of the string (without terminating '\0'). */

3883int
3884sprint_ul (char *s, unsigned long value)
3885{
int len = sprint_ul_rev (s, value);
s[len] = '\0';

std::reverse (s, s + len);
return len;
3891}

3893/* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
 %R prints the value of REGISTER_PREFIX.
 %L prints the value of LOCAL_LABEL_PREFIX.
 %U prints the value of USER_LABEL_PREFIX.
 %I prints the value of IMMEDIATE_PREFIX.
 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
 Also supported are %d, %i, %u, %x, %X, %o, %c, %s and %%.

 We handle alternate assembler dialects here, just like output_asm_insn.  */

3903void
3904asm_fprintf (FILE *file, const char *p, ...)
3905{
char buf[10];
char *q, c;
3908#ifdef ASSEMBLER_DIALECT(global_options.x_ix86_asm_dialect)
int dialect = 0;
3910#endif
va_list argptr;

va_start (argptr, p)__builtin_va_start(argptr, p);

buf[0] = '%';

while ((c = *p++))
  switch (c)
    {
3920#ifdef ASSEMBLER_DIALECT(global_options.x_ix86_asm_dialect)
    case '{':
    case '}':
    case '|':
p = do_assembler_dialects (p, &dialect);
break;
3926#endif

    case '%':
c = *p++;
q = &buf[1];
while (strchr ("-+ #0", c))
 {
   *q++ = c;
   c = *p++;
 }
while (ISDIGIT (c)(_sch_istable[(c) & 0xff] & (unsigned short)(_sch_isdigit
)) || c == '.')
 {
   *q++ = c;
   c = *p++;
 }
switch (c)
 {
 case '%':
   putc ('%', file);
   break;

 case 'd':  case 'i':  case 'u':
 case 'x':  case 'X':  case 'o':
 case 'c':
   *q++ = c;
   *q = 0;
   fprintf (file, buf, va_arg (argptr, int)__builtin_va_arg(argptr, int));
   break;

 case 'w':
   /* This is a prefix to the 'd', 'i', 'u', 'x', 'X', and
      'o' cases, but we do not check for those cases.  It
      means that the value is a HOST_WIDE_INT, which may be
      either `long' or `long long'.  */
   memcpy (q, HOST_WIDE_INT_PRINT"l", strlen (HOST_WIDE_INT_PRINT"l"));
   q += strlen (HOST_WIDE_INT_PRINT"l");
   *q++ = *p++;
   *q = 0;
   fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT)__builtin_va_arg(argptr, long));
   break;

 case 'l':
   *q++ = c;
3969#ifdef HAVE_LONG_LONG1
   if (*p == 'l')
     {
*q++ = *p++;
*q++ = *p++;
*q = 0;
fprintf (file, buf, va_arg (argptr, long long)__builtin_va_arg(argptr, long long));
     }
   else
3978#endif
     {
*q++ = *p++;
*q = 0;
fprintf (file, buf, va_arg (argptr, long)__builtin_va_arg(argptr, long));
     }

   break;

 case 's':
   *q++ = c;
   *q = 0;
   fprintf (file, buf, va_arg (argptr, char *)__builtin_va_arg(argptr, char *));
   break;

 case 'O':
3994#ifdef ASM_OUTPUT_OPCODE
   ASM_OUTPUT_OPCODE (asm_out_file, p){ if (((p))[0] == '%' && ((p))[1] == 'v') ((p)) += ((
global_options.x_ix86_isa_flags & (1UL << 8)) != 0)
 ? 1 : 2; };
3996#endif
   break;

 case 'R':
4000#ifdef REGISTER_PREFIX
   fprintf (file, "%s", REGISTER_PREFIX);
4002#endif
   break;

 case 'I':
4006#ifdef IMMEDIATE_PREFIX
   fprintf (file, "%s", IMMEDIATE_PREFIX);
4008#endif
   break;

 case 'L':
4012#ifdef LOCAL_LABEL_PREFIX"."
   fprintf (file, "%s", LOCAL_LABEL_PREFIX".");
4014#endif
   break;

 case 'U':
   fputs (user_label_prefix, file);
   break;

4021#ifdef ASM_FPRINTF_EXTENSIONS
   /* Uppercase letters are reserved for general use by asm_fprintf
      and so are not available to target specific code.  In order to
      prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
      they are defined here.  As they get turned into real extensions
      to asm_fprintf they should be removed from this list.  */
 case 'A': case 'B': case 'C': case 'D': case 'E':
 case 'F': case 'G': case 'H': case 'J': case 'K':
 case 'M': case 'N': case 'P': case 'Q': case 'S':
 case 'T': case 'V': case 'W': case 'Y': case 'Z':
   break;

 ASM_FPRINTF_EXTENSIONS (file, argptr, p)case 'z': fputc (((global_options.x_ix86_isa_flags & (1UL
 << 1)) != 0) ? 'q' : 'l', (file)); break; case 'r': { unsigned
 int regno = __builtin_va_arg((argptr), int); if ((((unsigned
 long) ((regno)) - (unsigned long) (0) <= (unsigned long) (
7) - (unsigned long) (0)))) fputc (((global_options.x_ix86_isa_flags
 & (1UL << 1)) != 0) ? 'r' : 'e', (file)); fputs ((
this_target_hard_regs->x_reg_names)[regno], (file)); break
; }
4034#endif
 default:
   gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4036, __FUNCTION__));
 }
break;

    default:
putc (c, file);
    }
va_end (argptr)__builtin_va_end(argptr);
4044}
4045
4046/* Return nonzero if this function has no function calls.  */

4048int
4049leaf_function_p (void)
4050{
rtx_insn *insn;

/* Ensure we walk the entire function body.  */
gcc_assert (!in_sequence_p ())((void)(!(!in_sequence_p ()) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4054, __FUNCTION__), 0 : 0));

/* Some back-ends (e.g. s390) want leaf functions to stay leaf
   functions even if they call mcount.  */
if (crtl(&x_rtl)->profile && !targetm.keep_leaf_when_profiled ())
  return 0;

for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
  {
    if (CALL_P (insn)(((enum rtx_code) (insn)->code) == CALL_INSN)
 && ! SIBLING_CALL_P (insn)(__extension__ ({ __typeof ((insn)) const _rtx = ((insn)); if
 (((enum rtx_code) (_rtx)->code) != CALL_INSN) rtl_check_failed_flag
 ("SIBLING_CALL_P", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4064, __FUNCTION__); _rtx; })->jump)
 && ! FAKE_CALL_P (insn)(__extension__ ({ __typeof ((insn)) const _rtx = ((insn)); if
 (((enum rtx_code) (_rtx)->code) != CALL_INSN) rtl_check_failed_flag
 ("FAKE_CALL_P", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4065, __FUNCTION__); _rtx; })->used))
return 0;
    if (NONJUMP_INSN_P (insn)(((enum rtx_code) (insn)->code) == INSN)
 && GET_CODE (PATTERN (insn))((enum rtx_code) (PATTERN (insn))->code) == SEQUENCE
 && CALL_P (XVECEXP (PATTERN (insn), 0, 0))(((enum rtx_code) ((((((PATTERN (insn))->u.fld[0]).rt_rtvec
))->elem[0]))->code) == CALL_INSN)
 && ! SIBLING_CALL_P (XVECEXP (PATTERN (insn), 0, 0))(__extension__ ({ __typeof (((((((PATTERN (insn))->u.fld[0
]).rt_rtvec))->elem[0]))) const _rtx = (((((((PATTERN (insn
))->u.fld[0]).rt_rtvec))->elem[0]))); if (((enum rtx_code
) (_rtx)->code) != CALL_INSN) rtl_check_failed_flag ("SIBLING_CALL_P"
, _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4070, __FUNCTION__); _rtx; })->jump))
return 0;
  }

return 1;
4075}

4077/* Return 1 if branch is a forward branch.
 Uses insn_shuid array, so it works only in the final pass.  May be used by
 output templates to customary add branch prediction hints.
*/
4081int
4082final_forward_branch_p (rtx_insn *insn)
4083{
int insn_id, label_id;

gcc_assert (uid_shuid)((void)(!(uid_shuid) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4086, __FUNCTION__), 0 : 0));
insn_id = INSN_SHUID (insn)(uid_shuid[INSN_UID (insn)]);
label_id = INSN_SHUID (JUMP_LABEL (insn))(uid_shuid[INSN_UID ((((insn)->u.fld[7]).rt_rtx))]);
/* We've hit some insns that does not have id information available.  */
gcc_assert (insn_id && label_id)((void)(!(insn_id && label_id) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4090, __FUNCTION__), 0 : 0));
return insn_id < label_id;
4092}

4094/* On some machines, a function with no call insns
 can run faster if it doesn't create its own register window.
 When output, the leaf function should use only the "output"
 registers.  Ordinarily, the function would be compiled to use
 the "input" registers to find its arguments; it is a candidate
 for leaf treatment if it uses only the "input" registers.
 Leaf function treatment means renumbering so the function
 uses the "output" registers instead.  */

4103#ifdef LEAF_REGISTERS

4105/* Return 1 if this function uses only the registers that can be
 safely renumbered.  */

4108int
4109only_leaf_regs_used (void)
4110{
int i;
const char *const permitted_reg_in_leaf_functions = LEAF_REGISTERS;

for (i = 0; i < FIRST_PSEUDO_REGISTER76; i++)
  if ((df_regs_ever_live_p (i) || global_regs[i])
&& ! permitted_reg_in_leaf_functions[i])
    return 0;

if (crtl(&x_rtl)->uses_pic_offset_table
    && pic_offset_table_rtx(this_target_rtl->x_pic_offset_table_rtx) != 0
    && REG_P (pic_offset_table_rtx)(((enum rtx_code) ((this_target_rtl->x_pic_offset_table_rtx
))->code) == REG)
    && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)(rhs_regno((this_target_rtl->x_pic_offset_table_rtx)))])
  return 0;

return 1;
4126}

4128/* Scan all instructions and renumber all registers into those
 available in leaf functions.  */

4131static void
4132leaf_renumber_regs (rtx_insn *first)
4133{
rtx_insn *insn;

/* Renumber only the actual patterns.
   The reg-notes can contain frame pointer refs,
   and renumbering them could crash, and should not be needed.  */
for (insn = first; insn; insn = NEXT_INSN (insn))
  if (INSN_P (insn)(((((enum rtx_code) (insn)->code) == INSN) || (((enum rtx_code
) (insn)->code) == JUMP_INSN) || (((enum rtx_code) (insn)->
code) == CALL_INSN)) || (((enum rtx_code) (insn)->code) ==
 DEBUG_INSN)))
    leaf_renumber_regs_insn (PATTERN (insn));
4142}

4144/* Scan IN_RTX and its subexpressions, and renumber all regs into those
 available in leaf functions.  */

4147void
4148leaf_renumber_regs_insn (rtx in_rtx)
4149{
int i, j;
const char *format_ptr;

if (in_rtx == 0)
  return;

/* Renumber all input-registers into output-registers.
   renumbered_regs would be 1 for an output-register;
   they  */

if (REG_P (in_rtx)(((enum rtx_code) (in_rtx)->code) == REG))
  {
    int newreg;

    /* Don't renumber the same reg twice.  */
    if (in_rtx->used)
return;

    newreg = REGNO (in_rtx)(rhs_regno(in_rtx));
    /* Don't try to renumber pseudo regs.  It is possible for a pseudo reg
to reach here as part of a REG_NOTE.  */
    if (newreg >= FIRST_PSEUDO_REGISTER76)
{
 in_rtx->used = 1;
 return;
}
    newreg = LEAF_REG_REMAP (newreg);
    gcc_assert (newreg >= 0)((void)(!(newreg >= 0) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4177, __FUNCTION__), 0 : 0));
    df_set_regs_ever_live (REGNO (in_rtx)(rhs_regno(in_rtx)), false);
    df_set_regs_ever_live (newreg, true);
    SET_REGNO (in_rtx, newreg)(df_ref_change_reg_with_loc (in_rtx, newreg));
    in_rtx->used = 1;
    return;
  }

if (INSN_P (in_rtx)(((((enum rtx_code) (in_rtx)->code) == INSN) || (((enum rtx_code
) (in_rtx)->code) == JUMP_INSN) || (((enum rtx_code) (in_rtx
)->code) == CALL_INSN)) || (((enum rtx_code) (in_rtx)->
code) == DEBUG_INSN)))
  {
    /* Inside a SEQUENCE, we find insns.
Renumber just the patterns of these insns,
just as we do for the top-level insns.  */
    leaf_renumber_regs_insn (PATTERN (in_rtx));
    return;
  }

format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx))(rtx_format[(int) (((enum rtx_code) (in_rtx)->code))]);

for (i = 0; i < GET_RTX_LENGTH (GET_CODE (in_rtx))(rtx_length[(int) (((enum rtx_code) (in_rtx)->code))]); i++)
  switch (*format_ptr++)
    {
    case 'e':
leaf_renumber_regs_insn (XEXP (in_rtx, i)(((in_rtx)->u.fld[i]).rt_rtx));
break;

    case 'E':
if (XVEC (in_rtx, i)(((in_rtx)->u.fld[i]).rt_rtvec) != NULL__null)
 for (j = 0; j < XVECLEN (in_rtx, i)(((((in_rtx)->u.fld[i]).rt_rtvec))->num_elem); j++)
   leaf_renumber_regs_insn (XVECEXP (in_rtx, i, j)(((((in_rtx)->u.fld[i]).rt_rtvec))->elem[j]));
break;

    case 'S':
    case 's':
    case '0':
    case 'i':
    case 'w':
    case 'p':
    case 'n':
    case 'u':
break;

    default:
gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4220, __FUNCTION__));
    }
4222}
4223#endif
4224
4225/* Turn the RTL into assembly.  */
4226static unsigned int
4227rest_of_handle_final (void)
4228{
const char *fnname = get_fnname_from_decl (current_function_decl);

/* Turn debug markers into notes if the var-tracking pass has not
   been invoked.  */
if (!flag_var_trackingglobal_options.x_flag_var_tracking && MAY_HAVE_DEBUG_MARKER_INSNSglobal_options.x_debug_nonbind_markers_p)
  delete_vta_debug_insns (false);

assemble_start_function (current_function_decl, fnname);
rtx_insn *first = get_insns ();
int seen = 0;
final_start_function_1 (&first, asm_out_file, &seen, optimizeglobal_options.x_optimize);
final_1 (first, asm_out_file, seen, optimizeglobal_options.x_optimize);
if (flag_ipa_raglobal_options.x_flag_ipa_ra
    && !lookup_attribute ("noipa", DECL_ATTRIBUTES (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4242, __FUNCTION__))->decl_common.attributes))
    /* Functions with naked attributes are supported only with basic asm
statements in the body, thus for supported use cases the information
on clobbered registers is not available.  */
    && !lookup_attribute ("naked", DECL_ATTRIBUTES (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4246, __FUNCTION__))->decl_common.attributes)))
  collect_fn_hard_reg_usage ();
final_end_function ();

/* The IA-64 ".handlerdata" directive must be issued before the ".endp"
   directive that closes the procedure descriptor.  Similarly, for x64 SEH.
   Otherwise it's not strictly necessary, but it doesn't hurt either.  */
output_function_exception_table (crtl(&x_rtl)->has_bb_partition ? 1 : 0);

assemble_end_function (current_function_decl, fnname);

/* Free up reg info memory.  */
free_reg_info ();

if (! quiet_flagglobal_options.x_quiet_flag)
  fflush (asm_out_file);

/* Note that for those inline functions where we don't initially
   know for certain that we will be generating an out-of-line copy,
   the first invocation of this routine (rest_of_compilation) will
   skip over this code by doing a `goto exit_rest_of_compilation;'.
   Later on, wrapup_global_declarations will (indirectly) call
   rest_of_compilation again for those inline functions that need
   to have out-of-line copies generated.  During that call, we
   *will* be routed past here.  */

timevar_push (TV_SYMOUT);
if (!DECL_IGNORED_P (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4273, __FUNCTION__))->decl_common.ignored_flag))
  debug_hooks->function_decl (current_function_decl);
timevar_pop (TV_SYMOUT);

/* Release the blocks that are linked to DECL_INITIAL() to free the memory.  */
DECL_INITIAL (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4278, __FUNCTION__))->decl_common.initial) = error_mark_nodeglobal_trees[TI_ERROR_MARK];

if (DECL_STATIC_CONSTRUCTOR (current_function_decl)((tree_check ((current_function_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4280, __FUNCTION__, (FUNCTION_DECL)))->function_decl.static_ctor_flag
)
    && targetm.have_ctors_dtors)
  targetm.asm_out.constructor (XEXP (DECL_RTL (current_function_decl), 0)(((((contains_struct_check ((current_function_decl), (TS_DECL_WRTL
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4282, __FUNCTION__))->decl_with_rtl.rtl ? (current_function_decl
)->decl_with_rtl.rtl : (make_decl_rtl (current_function_decl
), (current_function_decl)->decl_with_rtl.rtl)))->u.fld
[0]).rt_rtx),
		 decl_init_priority_lookup
		   (current_function_decl));
if (DECL_STATIC_DESTRUCTOR (current_function_decl)((tree_check ((current_function_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4285, __FUNCTION__, (FUNCTION_DECL)))->function_decl.static_dtor_flag
)
    && targetm.have_ctors_dtors)
  targetm.asm_out.destructor (XEXP (DECL_RTL (current_function_decl), 0)(((((contains_struct_check ((current_function_decl), (TS_DECL_WRTL
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4287, __FUNCTION__))->decl_with_rtl.rtl ? (current_function_decl
)->decl_with_rtl.rtl : (make_decl_rtl (current_function_decl
), (current_function_decl)->decl_with_rtl.rtl)))->u.fld
[0]).rt_rtx),
		decl_fini_priority_lookup
		  (current_function_decl));
return 0;
4291}

4293namespace {

4295const pass_data pass_data_final =
4296{
RTL_PASS, /* type */
"final", /* name */
OPTGROUP_NONE, /* optinfo_flags */
TV_FINAL, /* tv_id */
0, /* properties_required */
0, /* properties_provided */
0, /* properties_destroyed */
0, /* todo_flags_start */
0, /* todo_flags_finish */
4306};

4308class pass_final : public rtl_opt_pass
4309{
4310public:
pass_final (gcc::context *ctxt)
  : rtl_opt_pass (pass_data_final, ctxt)
{}

/* opt_pass methods: */
unsigned int execute (function *) final override
{
  return rest_of_handle_final ();
}

4321}; // class pass_final

4323} // anon namespace

4325rtl_opt_pass *
4326make_pass_final (gcc::context *ctxt)
4327{
return new pass_final (ctxt);
4329}


4332static unsigned int
4333rest_of_handle_shorten_branches (void)
4334{
/* Shorten branches.  */
shorten_branches (get_insns ());
return 0;
4338}

4340namespace {

4342const pass_data pass_data_shorten_branches =
4343{
RTL_PASS, /* type */
"shorten", /* name */
OPTGROUP_NONE, /* optinfo_flags */
TV_SHORTEN_BRANCH, /* tv_id */
0, /* properties_required */
0, /* properties_provided */
0, /* properties_destroyed */
0, /* todo_flags_start */
0, /* todo_flags_finish */
4353};

4355class pass_shorten_branches : public rtl_opt_pass
4356{
4357public:
pass_shorten_branches (gcc::context *ctxt)
  : rtl_opt_pass (pass_data_shorten_branches, ctxt)
{}

/* opt_pass methods: */
unsigned int execute (function *) final override
  {
    return rest_of_handle_shorten_branches ();
  }

4368}; // class pass_shorten_branches

4370} // anon namespace

4372rtl_opt_pass *
4373make_pass_shorten_branches (gcc::context *ctxt)
4374{
return new pass_shorten_branches (ctxt);
4376}


4379static unsigned int
4380rest_of_clean_state (void)
4381{
rtx_insn *insn, *next;
FILE *final_output = NULL__null;
int save_unnumbered = flag_dump_unnumberedglobal_options.x_flag_dump_unnumbered;
int save_noaddr = flag_dump_noaddrglobal_options.x_flag_dump_noaddr;

if (flag_dump_final_insnsglobal_options.x_flag_dump_final_insns)
  {
    final_output = fopen (flag_dump_final_insnsglobal_options.x_flag_dump_final_insns, "a");
    if (!final_output)
{
 error ("could not open final insn dump file %qs: %m",
 flag_dump_final_insnsglobal_options.x_flag_dump_final_insns);
 flag_dump_final_insnsglobal_options.x_flag_dump_final_insns = NULL__null;
}
    else
{
 flag_dump_noaddrglobal_options.x_flag_dump_noaddr = flag_dump_unnumberedglobal_options.x_flag_dump_unnumbered = 1;
 if (flag_compare_debug_optglobal_options.x_flag_compare_debug_opt || flag_compare_debugglobal_options.x_flag_compare_debug)
   dump_flags |= TDF_NOUID | TDF_COMPARE_DEBUG;
 dump_function_header (final_output, current_function_decl,
		dump_flags);
 final_insns_dump_p = true;

 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
   if (LABEL_P (insn)(((enum rtx_code) (insn)->code) == CODE_LABEL))
     INSN_UID (insn) = CODE_LABEL_NUMBER (insn)(((insn)->u.fld[5]).rt_int);
   else
     {
if (NOTE_P (insn)(((enum rtx_code) (insn)->code) == NOTE))
  set_block_for_insn (insn, NULL__null);
INSN_UID (insn) = 0;
     }
}
  }

/* It is very important to decompose the RTL instruction chain here:
   debug information keeps pointing into CODE_LABEL insns inside the function
   body.  If these remain pointing to the other insns, we end up preserving
   whole RTL chain and attached detailed debug info in memory.  */
for (insn = get_insns (); insn; insn = next)
  {
    next = NEXT_INSN (insn);
    SET_NEXT_INSN (insn) = NULL__null;
    SET_PREV_INSN (insn) = NULL__null;

    rtx_insn *call_insn = insn;
    if (NONJUMP_INSN_P (call_insn)(((enum rtx_code) (call_insn)->code) == INSN)
 && GET_CODE (PATTERN (call_insn))((enum rtx_code) (PATTERN (call_insn))->code) == SEQUENCE)
{
 rtx_sequence *seq = as_a <rtx_sequence *> (PATTERN (call_insn));
 call_insn = seq->insn (0);
}
    if (CALL_P (call_insn)(((enum rtx_code) (call_insn)->code) == CALL_INSN))
{
 rtx note
   = find_reg_note (call_insn, REG_CALL_ARG_LOCATION, NULL_RTX(rtx) 0);
 if (note)
   remove_note (call_insn, note);
}

    if (final_output
 && (!NOTE_P (insn)(((enum rtx_code) (insn)->code) == NOTE)
     || (NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int) != NOTE_INSN_VAR_LOCATION
  && NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int) != NOTE_INSN_BEGIN_STMT
  && NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int) != NOTE_INSN_INLINE_ENTRY
  && NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int) != NOTE_INSN_BLOCK_BEG
  && NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int) != NOTE_INSN_BLOCK_END
  && NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int) != NOTE_INSN_DELETED_DEBUG_LABEL)))
print_rtl_single (final_output, insn);
  }

if (final_output)
  {
    flag_dump_noaddrglobal_options.x_flag_dump_noaddr = save_noaddr;
    flag_dump_unnumberedglobal_options.x_flag_dump_unnumbered = save_unnumbered;
    final_insns_dump_p = false;

    if (fclose (final_output))
{
 error ("could not close final insn dump file %qs: %m",
 flag_dump_final_insnsglobal_options.x_flag_dump_final_insns);
 flag_dump_final_insnsglobal_options.x_flag_dump_final_insns = NULL__null;
}
  }

flag_rerun_cse_after_global_opts = 0;
reload_completed = 0;
epilogue_completed = 0;
4470#ifdef STACK_REGS
regstack_completed = 0;
4472#endif

/* Clear out the insn_length contents now that they are no
   longer valid.  */
init_insn_lengths ();

/* Show no temporary slots allocated.  */
init_temp_slots ();

free_bb_for_insn ();

if (cfun(cfun + 0)->gimple_df)
  delete_tree_ssa (cfun(cfun + 0));

/* We can reduce stack alignment on call site only when we are sure that
   the function body just produced will be actually used in the final
   executable.  */
if (flag_ipa_stack_alignmentglobal_options.x_flag_ipa_stack_alignment
    && decl_binds_to_current_def_p (current_function_decl))
  {
    unsigned int pref = crtl(&x_rtl)->preferred_stack_boundary;
    if (crtl(&x_rtl)->stack_alignment_needed > crtl(&x_rtl)->preferred_stack_boundary)
      pref = crtl(&x_rtl)->stack_alignment_needed;
    cgraph_node::rtl_info (current_function_decl)
->preferred_incoming_stack_boundary = pref;
  }

/* Make sure volatile mem refs aren't considered valid operands for
   arithmetic insns.  We must call this here if this is a nested inline
   function, since the above code leaves us in the init_recog state,
   and the function context push/pop code does not save/restore volatile_ok.

   ??? Maybe it isn't necessary for expand_start_function to call this
   anymore if we do it here?  */

init_recog_no_volatile ();

/* We're done with this function.  Free up memory if we can.  */
free_after_parsing (cfun(cfun + 0));
free_after_compilation (cfun(cfun + 0));
return 0;
4513}

4515namespace {

4517const pass_data pass_data_clean_state =
4518{
RTL_PASS, /* type */
"*clean_state", /* name */
OPTGROUP_NONE, /* optinfo_flags */
TV_FINAL, /* tv_id */
0, /* properties_required */
0, /* properties_provided */
PROP_rtl(1 << 7), /* properties_destroyed */
0, /* todo_flags_start */
0, /* todo_flags_finish */
4528};

4530class pass_clean_state : public rtl_opt_pass
4531{
4532public:
pass_clean_state (gcc::context *ctxt)
  : rtl_opt_pass (pass_data_clean_state, ctxt)
{}

/* opt_pass methods: */
unsigned int execute (function *) final override
  {
    return rest_of_clean_state ();
  }

4543}; // class pass_clean_state

4545} // anon namespace

4547rtl_opt_pass *
4548make_pass_clean_state (gcc::context *ctxt)
4549{
return new pass_clean_state (ctxt);
4551}

4553/* Return true if INSN is a call to the current function.  */

4555static bool
4556self_recursive_call_p (rtx_insn *insn)
4557{
tree fndecl = get_call_fndecl (insn);
return (fndecl == current_function_decl
 && decl_binds_to_current_def_p (fndecl));
4561}

4563/* Collect hard register usage for the current function.  */

4565static void
4566collect_fn_hard_reg_usage (void)
4567{
rtx_insn *insn;
4569#ifdef STACK_REGS
int i;
4571#endif
struct cgraph_rtl_info *node;
HARD_REG_SET function_used_regs;

/* ??? To be removed when all the ports have been fixed.  */
if (!targetm.call_fusage_contains_non_callee_clobbers)
  return;

/* Be conservative - mark fixed and global registers as used.  */
function_used_regs = fixed_reg_set(this_target_hard_regs->x_fixed_reg_set);

4582#ifdef STACK_REGS
/* Handle STACK_REGS conservatively, since the df-framework does not
   provide accurate information for them.  */

for (i = FIRST_STACK_REG8; i <= LAST_STACK_REG15; i++)
  SET_HARD_REG_BIT (function_used_regs, i);
4588#endif

for (insn = get_insns (); insn != NULL_RTX(rtx) 0; insn = next_insn (insn))
  {
    HARD_REG_SET insn_used_regs;

    if (!NONDEBUG_INSN_P (insn)((((enum rtx_code) (insn)->code) == INSN) || (((enum rtx_code
) (insn)->code) == JUMP_INSN) || (((enum rtx_code) (insn)->
code) == CALL_INSN)))
continue;

    if (CALL_P (insn)(((enum rtx_code) (insn)->code) == CALL_INSN)
 && !self_recursive_call_p (insn))
function_used_regs
 |= insn_callee_abi (insn).full_and_partial_reg_clobbers ();

    find_all_hard_reg_sets (insn, &insn_used_regs, false);
    function_used_regs |= insn_used_regs;

    if (hard_reg_set_subset_p (crtl(&x_rtl)->abi->full_and_partial_reg_clobbers (),
		 function_used_regs))
return;
  }

/* Mask out fully-saved registers, so that they don't affect equality
   comparisons between function_abis.  */
function_used_regs &= crtl(&x_rtl)->abi->full_and_partial_reg_clobbers ();

node = cgraph_node::rtl_info (current_function_decl);
gcc_assert (node != NULL)((void)(!(node != __null) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/final.cc"
, 4615, __FUNCTION__), 0 : 0));

node->function_used_regs = function_used_regs;
4618}

←

/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/is-a.h

→

1/* Dynamic testing for abstract is-a relationships.
2   Copyright (C) 2012-2023 Free Software Foundation, Inc.
3   Contributed by Lawrence Crowl.
4 
5This file is part of GCC.
6 
7GCC is free software; you can redistribute it and/or modify it under
8the terms of the GNU General Public License as published by the Free
9Software Foundation; either version 3, or (at your option) any later
10version.
11 
12GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13WARRANTY; without even the implied warranty of MERCHANTABILITY or
14FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
15for more details.
16 
17You should have received a copy of the GNU General Public License
18along with GCC; see the file COPYING3.  If not see
19<http://www.gnu.org/licenses/>.  */
20 
21 
22/* This header generic type query and conversion functions.
23 
24 
25USING THE GENERIC TYPE FACILITY
26 
27 
28The user functions are:
29 
30bool is_a <TYPE> (pointer)
31 
32    Tests whether the pointer actually points to a more derived TYPE.
33 
34    Suppose you have a symtab_node *ptr, AKA symtab_node *ptr.  You can test
35    whether it points to a 'derived' cgraph_node as follows.
36 
37      if (is_a <cgraph_node *> (ptr))
38        ....
39 
40 
41TYPE as_a <TYPE> (pointer)
42 
43    Converts pointer to a TYPE.
44 
45    You can just assume that it is such a node.
46 
47      do_something_with (as_a <cgraph_node *> *ptr);
48 
49TYPE safe_as_a <TYPE> (pointer)
50 
51    Like as_a <TYPE> (pointer), but where pointer could be NULL.  This
52    adds a check against NULL where the regular is_a_helper hook for TYPE
53    assumes non-NULL.
54 
55      do_something_with (safe_as_a <cgraph_node *> *ptr);
56 
57TYPE dyn_cast <TYPE> (pointer)
58 
59    Converts pointer to TYPE if and only if "is_a <TYPE> pointer".  Otherwise,
60    returns NULL.  This function is essentially a checked down cast.
61 
62    This functions reduce compile time and increase type safety when treating a
63    generic item as a more specific item.
64 
65    You can test and obtain a pointer to the 'derived' type in one indivisible
66    operation.
67 
68      if (cgraph_node *cptr = dyn_cast <cgraph_node *> (ptr))
69        ....
70 
71    As an example, the code change is from
72 
73      if (symtab_function_p (node))
74        {
75          struct cgraph_node *cnode = cgraph (node);
76          ....
77        }
78 
79    to
80 
81      if (cgraph_node *cnode = dyn_cast <cgraph_node *> (node))
82        {
83          ....
84        }
85 
86    The necessary conditional test defines a variable that holds a known good
87    pointer to the specific item and avoids subsequent conversion calls and
88    the assertion checks that may come with them.
89 
90    When, the property test is embedded within a larger condition, the
91    variable declaration gets pulled out of the condition.  (This approach
92    leaves some room for using the variable inappropriately.)
93 
94      if (symtab_variable_p (node) && varpool (node)->finalized)
95        varpool_analyze_node (varpool (node));
96 
97    becomes
98 
99      varpool_node *vnode = dyn_cast <varpool_node *> (node);
100      if (vnode && vnode->finalized)
101        varpool_analyze_node (vnode);
102 
103    Note that we have converted two sets of assertions in the calls to varpool
104    into safe and efficient use of a variable.
105 
106TYPE safe_dyn_cast <TYPE> (pointer)
107 
108    Like dyn_cast <TYPE> (pointer), except that it accepts null pointers
109    and returns null results for them.
110 
111 
112If you use these functions and get a 'inline function not defined' or a
113'missing symbol' error message for 'is_a_helper<....>::test', it means that
114the connection between the types has not been made.  See below.
115 
116 
117EXTENDING THE GENERIC TYPE FACILITY
118 
119Method 1
120--------
121 
122If DERIVED is derived from BASE, and if BASE contains enough information
123to determine whether an object is actually an instance of DERIVED,
124then you can make the above routines work for DERIVED by defining
125a specialization of is_a_helper such as:
126 
127  template<>
128  struct is_a_helper<DERIVED *> : static_is_a_helper<DERIVED *>
129  {
130    static inline bool test (const BASE *p) { return ...; }
131  };
132 
133This test function should return true if P is an instanced of DERIVED.
134This on its own is enough; the comments below for method 2 do not apply.
135 
136Method 2
137--------
138 
139Alternatively, if two types are connected in ways other than C++
140inheritance, each connection between them must be made by defining a
141specialization of the template member function 'test' of the template
142class 'is_a_helper'.  For example,
143 
144  template <>
145  template <>
146  inline bool
147  is_a_helper <cgraph_node *>::test (symtab_node *p)
148  {
149    return p->type == SYMTAB_FUNCTION;
150  }
151 
152If a simple reinterpret_cast between the pointer types is incorrect, then you
153must also specialize the template member function 'cast'.  Failure to do so
154when needed may result in a crash.  For example,
155 
156  template <>
157  template <>
158  inline bool
159  is_a_helper <cgraph_node *>::cast (symtab_node *p)
160  {
161    return &p->x_function;
162  }
163 
164*/
165 
166#ifndef GCC_IS_A_H
167#define GCC_IS_A_H
168 
169/* A base class that specializations of is_a_helper can use if casting
170   U * to T is simply a reinterpret_cast.  */
171 
172template <typename T>
173struct reinterpret_is_a_helper
174{
175  template <typename U>
176  static inline T cast (U *p) { return reinterpret_cast <T> (p); }
177};
178 
179/* A base class that specializations of is_a_helper can use if casting
180   U * to T is simply a static_cast.  This is more type-safe than
181   reinterpret_is_a_helper.  */
182 
183template <typename T>
184struct static_is_a_helper
185{
186  template <typename U>
187  static inline T cast (U *p) { return static_cast <T> (p); }
188};
189 
190/* A generic type conversion internal helper class.  */
191 
192template <typename T>
193struct is_a_helper : reinterpret_is_a_helper<T>
194{
195  template <typename U>
196  static inline bool test (U *p);
197};
198 
199/* Reuse the definition of is_a_helper<T *> to implement
200   is_a_helper<const T *>.  */
201 
202template <typename T>
203struct is_a_helper<const T *>
204{
205  template <typename U>
206  static inline const T *cast (const U *p)
207  {
208    return is_a_helper<T *>::cast (const_cast <U *> (p));
209  }
210  template <typename U>
211  static inline bool test (const U *p)
212  {
213    return is_a_helper<T *>::test (p);
214  }
215};
216 
217/* Note that we deliberately do not define the 'test' member template.  Not
218   doing so will result in a build-time error for type relationships that have
219   not been defined, rather than a run-time error.  See the discussion above
220   for when to define this member.  */
221 
222/* The public interface.  */
223 
224/* A generic test for a type relationship.  See the discussion above for when
225   to use this function.  The question answered is "Is type T a derived type of
226   type U?".  */
227 
228template <typename T, typename U>
229inline bool
230is_a (U *p)
231{
232  return is_a_helper<T>::test (p);
233}
234 
235/* A generic conversion from a base type U to a derived type T.  See the
236   discussion above for when to use this function.  */
237 
238template <typename T, typename U>
239inline T
240as_a (U *p)
241{
242  gcc_checking_assert (is_a <T> (p))((void)(!(is_a <T> (p)) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/is-a.h"
, 242, __FUNCTION__), 0 : 0));
243  return is_a_helper <T>::cast (p);
244}
245 
246/* Similar to as_a<>, but where the pointer can be NULL, even if
247   is_a_helper<T> doesn't check for NULL.  */
248 
249template <typename T, typename U>
250inline T
251safe_as_a (U *p)
252{
253  if (p)
17
←
Assuming 'p' is non-null→
18
←
Taking true branch→
254    {
255      gcc_checking_assert (is_a <T> (p))((void)(!(is_a <T> (p)) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/is-a.h"
, 255, __FUNCTION__), 0 : 0));
19
←
'?' condition is false→
256      return is_a_helper <T>::cast (p);
20
←
Returning pointer, which participates in a condition later→
257    }
258  else
259    return NULL__null;
260}
261 
262/* A generic checked conversion from a base type U to a derived type T.  See
263   the discussion above for when to use this function.  */
264 
265template <typename T, typename U>
266inline T
267dyn_cast (U *p)
268{
269  if (is_a <T> (p))
10
←
Taking true branch→
27
←
Taking true branch→
270    return is_a_helper <T>::cast (p);
11
←
Returning pointer, which participates in a condition later→
28
←
Returning pointer, which participates in a condition later→
271  else
272    return static_cast <T> (0);
273}
274 
275/* Similar to dyn_cast, except that the pointer may be null.  */
276 
277template <typename T, typename U>
278inline T
279safe_dyn_cast (U *p)
280{
281  return p24.1
'p' is non-null
24.1
'p' is non-null
24.1
'p' is non-null
24.1
'p' is non-null
24.1
'p' is non-null
 ? dyn_cast <T> (p) : 0;
25
←
'?' condition is true→
26
←
Calling 'dyn_cast<rtx_jump_table_data *, rtx_insn>'→
29
←
Returning from 'dyn_cast<rtx_jump_table_data *, rtx_insn>'→
30
←
Returning pointer, which participates in a condition later→
282}
283 
284#endif  /* GCC_IS_A_H  */

←

/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/rtl.h

→

1	/* Register Transfer Language (RTL) definitions for GCC
2	Copyright (C) 1987-2023 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	#ifndef GCC_RTL_H
21	#define GCC_RTL_H
22
23	/* This file is occasionally included by generator files which expect
24	machmode.h and other files to exist and would not normally have been
25	included by coretypes.h. */
26	#ifdef GENERATOR_FILE
27	#include "real.h"
28	#include "fixed-value.h"
29	#include "statistics.h"
30	#include "vec.h"
31	#include "hash-table.h"
32	#include "hash-set.h"
33	#include "input.h"
34	#include "is-a.h"
35	#endif /* GENERATOR_FILE */
36
37	#include "hard-reg-set.h"
38
39	class predefined_function_abi;
40
41	/* Value used by some passes to "recognize" noop moves as valid
42	instructions. */
43	#define NOOP_MOVE_INSN_CODE2147483647 INT_MAX2147483647
44
45	/* Register Transfer Language EXPRESSIONS CODES */
46
47	#define RTX_CODEenum rtx_code enum rtx_code
48	enum rtx_code {
49
50	#define DEF_RTL_EXPR(ENUM, NAME, FORMAT, CLASS) ENUM ,
51	#include "rtl.def" /* rtl expressions are documented here */
52	#undef DEF_RTL_EXPR
53
54	LAST_AND_UNUSED_RTX_CODE}; /* A convenient way to get a value for
55	NUM_RTX_CODE.
56	Assumes default enum value assignment. */
57
58	/* The cast here, saves many elsewhere. */
59	#define NUM_RTX_CODE((int) LAST_AND_UNUSED_RTX_CODE) ((int) LAST_AND_UNUSED_RTX_CODE)
60
61	/* Similar, but since generator files get more entries... */
62	#ifdef GENERATOR_FILE
63	# define NON_GENERATOR_NUM_RTX_CODE ((int) MATCH_OPERAND)
64	#endif
65
66	/* Register Transfer Language EXPRESSIONS CODE CLASSES */
67
68	enum rtx_class {
69	/* We check bit 0-1 of some rtx class codes in the predicates below. */
70
71	/* Bit 0 = comparison if 0, arithmetic is 1
72	Bit 1 = 1 if commutative. */
73	RTX_COMPARE, /* 0 */
74	RTX_COMM_COMPARE,
75	RTX_BIN_ARITH,
76	RTX_COMM_ARITH,
77
78	/* Must follow the four preceding values. */
79	RTX_UNARY, /* 4 */
80
81	RTX_EXTRA,
82	RTX_MATCH,
83	RTX_INSN,
84
85	/* Bit 0 = 1 if constant. */
86	RTX_OBJ, /* 8 */
87	RTX_CONST_OBJ,
88
89	RTX_TERNARY,
90	RTX_BITFIELD_OPS,
91	RTX_AUTOINC
92	};
93
94	#define RTX_OBJ_MASK(~1) (~1)
95	#define RTX_OBJ_RESULT(RTX_OBJ & (~1)) (RTX_OBJ & RTX_OBJ_MASK(~1))
96	#define RTX_COMPARE_MASK(~1) (~1)
97	#define RTX_COMPARE_RESULT(RTX_COMPARE & (~1)) (RTX_COMPARE & RTX_COMPARE_MASK(~1))
98	#define RTX_ARITHMETIC_MASK(~1) (~1)
99	#define RTX_ARITHMETIC_RESULT(RTX_COMM_ARITH & (~1)) (RTX_COMM_ARITH & RTX_ARITHMETIC_MASK(~1))
100	#define RTX_BINARY_MASK(~3) (~3)
101	#define RTX_BINARY_RESULT(RTX_COMPARE & (~3)) (RTX_COMPARE & RTX_BINARY_MASK(~3))
102	#define RTX_COMMUTATIVE_MASK(~2) (~2)
103	#define RTX_COMMUTATIVE_RESULT(RTX_COMM_COMPARE & (~2)) (RTX_COMM_COMPARE & RTX_COMMUTATIVE_MASK(~2))
104	#define RTX_NON_COMMUTATIVE_RESULT(RTX_COMPARE & (~2)) (RTX_COMPARE & RTX_COMMUTATIVE_MASK(~2))
105
106	extern const unsigned char rtx_length[NUM_RTX_CODE((int) LAST_AND_UNUSED_RTX_CODE)];
107	#define GET_RTX_LENGTH(CODE)(rtx_length[(int) (CODE)]) (rtx_length[(int) (CODE)])
108
109	extern const char * const rtx_name[NUM_RTX_CODE((int) LAST_AND_UNUSED_RTX_CODE)];
110	#define GET_RTX_NAME(CODE)(rtx_name[(int) (CODE)]) (rtx_name[(int) (CODE)])
111
112	extern const char * const rtx_format[NUM_RTX_CODE((int) LAST_AND_UNUSED_RTX_CODE)];
113	#define GET_RTX_FORMAT(CODE)(rtx_format[(int) (CODE)]) (rtx_format[(int) (CODE)])
114
115	extern const enum rtx_class rtx_class[NUM_RTX_CODE((int) LAST_AND_UNUSED_RTX_CODE)];
116	#define GET_RTX_CLASS(CODE)(rtx_class[(int) (CODE)]) (rtx_class[(int) (CODE)])
117
118	/* True if CODE is part of the insn chain (i.e. has INSN_UID, PREV_INSN
119	and NEXT_INSN fields). */
120	#define INSN_CHAIN_CODE_P(CODE)((unsigned long) (CODE) - (unsigned long) (DEBUG_INSN) <= ( unsigned long) (NOTE) - (unsigned long) (DEBUG_INSN)) IN_RANGE (CODE, DEBUG_INSN, NOTE)((unsigned long) (CODE) - (unsigned long) (DEBUG_INSN) <= ( unsigned long) (NOTE) - (unsigned long) (DEBUG_INSN))
121
122	extern const unsigned char rtx_code_size[NUM_RTX_CODE((int) LAST_AND_UNUSED_RTX_CODE)];
123	extern const unsigned char rtx_next[NUM_RTX_CODE((int) LAST_AND_UNUSED_RTX_CODE)];
124
125	/* The flags and bitfields of an ADDR_DIFF_VEC. BASE is the base label
126	relative to which the offsets are calculated, as explained in rtl.def. */
127	struct addr_diff_vec_flags
128	{
129	/* Set at the start of shorten_branches - ONLY WHEN OPTIMIZING - : */
130	unsigned min_align: 8;
131	/* Flags: */
132	unsigned base_after_vec: 1; /* BASE is after the ADDR_DIFF_VEC. */
133	unsigned min_after_vec: 1; /* minimum address target label is
134	after the ADDR_DIFF_VEC. */
135	unsigned max_after_vec: 1; /* maximum address target label is
136	after the ADDR_DIFF_VEC. */
137	unsigned min_after_base: 1; /* minimum address target label is
138	after BASE. */
139	unsigned max_after_base: 1; /* maximum address target label is
140	after BASE. */
141	/* Set by the actual branch shortening process - ONLY WHEN OPTIMIZING - : */
142	unsigned offset_unsigned: 1; /* offsets have to be treated as unsigned. */
143	unsigned : 2;
144	unsigned scale : 8;
145	};
146
147	/* Structure used to describe the attributes of a MEM. These are hashed
148	so MEMs that the same attributes share a data structure. This means
149	they cannot be modified in place. */
150	class GTY(()) mem_attrs
151	{
152	public:
153	mem_attrs ();
154
155	/* The expression that the MEM accesses, or null if not known.
156	This expression might be larger than the memory reference itself.
157	(In other words, the MEM might access only part of the object.) */
158	tree expr;
159
160	/* The offset of the memory reference from the start of EXPR.
161	Only valid if OFFSET_KNOWN_P. */
162	poly_int64 offset;
163
164	/* The size of the memory reference in bytes. Only valid if
165	SIZE_KNOWN_P. */
166	poly_int64 size;
167
168	/* The alias set of the memory reference. */
169	alias_set_type alias;
170
171	/* The alignment of the reference in bits. Always a multiple of
172	BITS_PER_UNIT. Note that EXPR may have a stricter alignment
173	than the memory reference itself. */
174	unsigned int align;
175
176	/* The address space that the memory reference uses. */
177	unsigned char addrspace;
178
179	/* True if OFFSET is known. */
180	bool offset_known_p;
181
182	/* True if SIZE is known. */
183	bool size_known_p;
184	};
185
186	/* Structure used to describe the attributes of a REG in similar way as
187	mem_attrs does for MEM above. Note that the OFFSET field is calculated
188	in the same way as for mem_attrs, rather than in the same way as a
189	SUBREG_BYTE. For example, if a big-endian target stores a byte
190	object in the low part of a 4-byte register, the OFFSET field
191	will be -3 rather than 0. */
192
193	class GTY((for_user)) reg_attrs {
194	public:
195	tree decl; /* decl corresponding to REG. */
196	poly_int64 offset; /* Offset from start of DECL. */
197	};
198
199	/* Common union for an element of an rtx. */
200
201	union rtunion
202	{
203	int rt_int;
204	unsigned int rt_uint;
205	poly_uint16_pod rt_subreg;
206	const char *rt_str;
207	rtx rt_rtx;
208	rtvec rt_rtvec;
209	machine_mode rt_type;
210	addr_diff_vec_flags rt_addr_diff_vec_flags;
211	struct cselib_val *rt_cselib;
212	tree rt_tree;
213	basic_block rt_bb;
214	mem_attrs *rt_mem;
215	class constant_descriptor_rtx *rt_constant;
216	struct dw_cfi_node *rt_cfi;
217	};
218
219	/* Describes the properties of a REG. */
220	struct GTY(()) reg_info {
221	/* The value of REGNO. */
222	unsigned int regno;
223
224	/* The value of REG_NREGS. */
225	unsigned int nregs : 8;
226	unsigned int unused : 24;
227
228	/* The value of REG_ATTRS. */
229	reg_attrs *attrs;
230	};
231
232	/* This structure remembers the position of a SYMBOL_REF within an
233	object_block structure. A SYMBOL_REF only provides this information
234	if SYMBOL_REF_HAS_BLOCK_INFO_P is true. */
235	struct GTY(()) block_symbol {
236	/* The usual SYMBOL_REF fields. */
237	rtunion GTY ((skip)) fld[2];
238
239	/* The block that contains this object. */
240	struct object_block *block;
241
242	/* The offset of this object from the start of its block. It is negative
243	if the symbol has not yet been assigned an offset. */
244	HOST_WIDE_INTlong offset;
245	};
246
247	/* Describes a group of objects that are to be placed together in such
248	a way that their relative positions are known. */
249	struct GTY((for_user)) object_block {
250	/* The section in which these objects should be placed. */
251	section *sect;
252
253	/* The alignment of the first object, measured in bits. */
254	unsigned int alignment;
255
256	/* The total size of the objects, measured in bytes. */
257	HOST_WIDE_INTlong size;
258
259	/* The SYMBOL_REFs for each object. The vector is sorted in
260	order of increasing offset and the following conditions will
261	hold for each element X:
262
263	SYMBOL_REF_HAS_BLOCK_INFO_P (X)
264	!SYMBOL_REF_ANCHOR_P (X)
265	SYMBOL_REF_BLOCK (X) == [address of this structure]
266	SYMBOL_REF_BLOCK_OFFSET (X) >= 0. */
267	vec<rtx, va_gc> *objects;
268
269	/* All the anchor SYMBOL_REFs used to address these objects, sorted
270	in order of increasing offset, and then increasing TLS model.
271	The following conditions will hold for each element X in this vector:
272
273	SYMBOL_REF_HAS_BLOCK_INFO_P (X)
274	SYMBOL_REF_ANCHOR_P (X)
275	SYMBOL_REF_BLOCK (X) == [address of this structure]
276	SYMBOL_REF_BLOCK_OFFSET (X) >= 0. */
277	vec<rtx, va_gc> *anchors;
278	};
279
280	struct GTY((variable_size)) hwivec_def {
281	HOST_WIDE_INTlong elem[1];
282	};
283
284	/* Number of elements of the HWIVEC if RTX is a CONST_WIDE_INT. */
285	#define CWI_GET_NUM_ELEM(RTX)((int)__extension__ ({ __typeof ((RTX)) const _rtx = ((RTX)); if (((enum rtx_code) (_rtx)->code) != CONST_WIDE_INT) rtl_check_failed_flag ("CWI_GET_NUM_ELEM", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/rtl.h" , 285, __FUNCTION__); _rtx; })->u2.num_elem) \
286	((int)RTL_FLAG_CHECK1("CWI_GET_NUM_ELEM", (RTX), CONST_WIDE_INT)__extension__ ({ __typeof ((RTX)) const _rtx = ((RTX)); if (( (enum rtx_code) (_rtx)->code) != CONST_WIDE_INT) rtl_check_failed_flag ("CWI_GET_NUM_ELEM", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/rtl.h" , 286, __FUNCTION__); _rtx; })->u2.num_elem)
287	#define CWI_PUT_NUM_ELEM(RTX, NUM)(__extension__ ({ __typeof ((RTX)) const _rtx = ((RTX)); if ( ((enum rtx_code) (_rtx)->code) != CONST_WIDE_INT) rtl_check_failed_flag ("CWI_PUT_NUM_ELEM", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/rtl.h" , 287, __FUNCTION__); _rtx; })->u2.num_elem = (NUM)) \
288	(RTL_FLAG_CHECK1("CWI_PUT_NUM_ELEM", (RTX), CONST_WIDE_INT)__extension__ ({ __typeof ((RTX)) const _rtx = ((RTX)); if (( (enum rtx_code) (_rtx)->code) != CONST_WIDE_INT) rtl_check_failed_flag ("CWI_PUT_NUM_ELEM", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/rtl.h" , 288, __FUNCTION__); _rtx; })->u2.num_elem = (NUM))
289
290	struct GTY((variable_size)) const_poly_int_def {
291	trailing_wide_ints<NUM_POLY_INT_COEFFS1> coeffs;
292	};
293
294	/* RTL expression ("rtx"). */
295
296	/* The GTY "desc" and "tag" options below are a kludge: we need a desc
297	field for gengtype to recognize that inheritance is occurring,
298	so that all subclasses are redirected to the traversal hook for the
299	base class.
300	However, all of the fields are in the base class, and special-casing
301	is at work. Hence we use desc and tag of 0, generating a switch
302	statement of the form:
303	switch (0)
304	{
305	case 0: // all the work happens here
306	}
307	in order to work with the existing special-casing in gengtype. */
308
309	struct GTY((desc("0"), tag("0"),
310	chain_next ("RTX_NEXT (&%h)"),
311	chain_prev ("RTX_PREV (&%h)"))) rtx_def {
312	/* The kind of expression this is. */
313	ENUM_BITFIELD(rtx_code)enum rtx_code code: 16;
314
315	/* The kind of value the expression has. */
316	ENUM_BITFIELD(machine_mode)enum machine_mode mode : 8;
317
318	/* 1 in a MEM if we should keep the alias set for this mem unchanged
319	when we access a component.
320	1 in a JUMP_INSN if it is a crossing jump.
321	1 in a CALL_INSN if it is a sibling call.
322	1 in a SET that is for a return.
323	In a CODE_LABEL, part of the two-bit alternate entry field.
324	1 in a CONCAT is VAL_EXPR_IS_COPIED in var-tracking.cc.
325	1 in a VALUE is SP_BASED_VALUE_P in cselib.cc.
326	1 in a SUBREG generated by LRA for reload insns.
327	1 in a REG if this is a static chain register.
328	Dumped as "/j" in RTL dumps. */
329	unsigned int jump : 1;
330	/* In a CODE_LABEL, part of the two-bit alternate entry field.
331	1 in a MEM if it cannot trap.
332	1 in a CALL_INSN logically equivalent to
333	ECF_LOOPING_CONST_OR_PURE and DECL_LOOPING_CONST_OR_PURE_P.
334	1 in a VALUE is SP_DERIVED_VALUE_P in cselib.cc.
335	Dumped as "/c" in RTL dumps. */
336	unsigned int call : 1;
337	/* 1 in a REG, MEM, or CONCAT if the value is set at most once, anywhere.
338	1 in a SUBREG used for SUBREG_PROMOTED_UNSIGNED_P.
339	1 in a SYMBOL_REF if it addresses something in the per-function
340	constants pool.
341	1 in a CALL_INSN logically equivalent to ECF_CONST and TREE_READONLY.
342	1 in a NOTE, or EXPR_LIST for a const call.
343	1 in a JUMP_INSN of an annulling branch.
344	1 in a CONCAT is VAL_EXPR_IS_CLOBBERED in var-tracking.cc.
345	1 in a preserved VALUE is PRESERVED_VALUE_P in cselib.cc.
346	1 in a clobber temporarily created for LRA.
347	Dumped as "/u" in RTL dumps. */
348	unsigned int unchanging : 1;
349	/* 1 in a MEM or ASM_OPERANDS expression if the memory reference is volatile.
350	1 in an INSN, CALL_INSN, JUMP_INSN, CODE_LABEL, BARRIER, or NOTE
351	if it has been deleted.
352	1 in a REG expression if corresponds to a variable declared by the user,
353	0 for an internally generated temporary.
354	1 in a SUBREG used for SUBREG_PROMOTED_UNSIGNED_P.
355	1 in a LABEL_REF, REG_LABEL_TARGET or REG_LABEL_OPERAND note for a
356	non-local label.
357	In a SYMBOL_REF, this flag is used for machine-specific purposes.
358	In a PREFETCH, this flag indicates that it should be considered a
359	scheduling barrier.
360	1 in a CONCAT is VAL_NEEDS_RESOLUTION in var-tracking.cc.
361	Dumped as "/v" in RTL dumps. */
362	unsigned int volatil : 1;
363	/* 1 in a REG if the register is used only in exit code a loop.
364	1 in a SUBREG expression if was generated from a variable with a
365	promoted mode.
366	1 in a CODE_LABEL if the label is used for nonlocal gotos
367	and must not be deleted even if its count is zero.
368	1 in an INSN, JUMP_INSN or CALL_INSN if this insn must be scheduled
369	together with the preceding insn. Valid only within sched.
370	1 in an INSN, JUMP_INSN, or CALL_INSN if insn is in a delay slot and
371	from the target of a branch. Valid from reorg until end of compilation;
372	cleared before used.
373
374	The name of the field is historical. It used to be used in MEMs
375	to record whether the MEM accessed part of a structure.
376	Dumped as "/s" in RTL dumps. */
377	unsigned int in_struct : 1;
378	/* At the end of RTL generation, 1 if this rtx is used. This is used for
379	copying shared structure. See `unshare_all_rtl'.
380	In a REG, this is not needed for that purpose, and used instead
381	in `leaf_renumber_regs_insn'.
382	1 in a SYMBOL_REF, means that emit_library_call
383	has used it as the function.
384	1 in a CONCAT is VAL_HOLDS_TRACK_EXPR in var-tracking.cc.
385	1 in a VALUE or DEBUG_EXPR is VALUE_RECURSED_INTO in var-tracking.cc. */
386	unsigned int used : 1;
387	/* 1 in an INSN or a SET if this rtx is related to the call frame,
388	either changing how we compute the frame address or saving and
389	restoring registers in the prologue and epilogue.
390	1 in a REG or MEM if it is a pointer.
391	1 in a SYMBOL_REF if it addresses something in the per-function
392	constant string pool.
393	1 in a VALUE is VALUE_CHANGED in var-tracking.cc.
394	Dumped as "/f" in RTL dumps. */
395	unsigned frame_related : 1;
396	/* 1 in a REG or PARALLEL that is the current function's return value.
397	1 in a SYMBOL_REF for a weak symbol.
398	1 in a CALL_INSN logically equivalent to ECF_PURE and DECL_PURE_P.
399	1 in a CONCAT is VAL_EXPR_HAS_REVERSE in var-tracking.cc.
400	1 in a VALUE or DEBUG_EXPR is NO_LOC_P in var-tracking.cc.
401	Dumped as "/i" in RTL dumps. */
402	unsigned return_val : 1;
403
404	union {
405	/* The final union field is aligned to 64 bits on LP64 hosts,
406	giving a 32-bit gap after the fields above. We optimize the
407	layout for that case and use the gap for extra code-specific
408	information. */
409
410	/* The ORIGINAL_REGNO of a REG. */
411	unsigned int original_regno;
412
413	/* The INSN_UID of an RTX_INSN-class code. */
414	int insn_uid;
415
416	/* The SYMBOL_REF_FLAGS of a SYMBOL_REF. */
417	unsigned int symbol_ref_flags;
418
419	/* The PAT_VAR_LOCATION_STATUS of a VAR_LOCATION. */
420	enum var_init_status var_location_status;
421
422	/* In a CONST_WIDE_INT (aka hwivec_def), this is the number of
423	HOST_WIDE_INTs in the hwivec_def. */
424	unsigned int num_elem;
425
426	/* Information about a CONST_VECTOR. */
427	struct
428	{
429	/* The value of CONST_VECTOR_NPATTERNS. */
430	unsigned int npatterns : 16;
431
432	/* The value of CONST_VECTOR_NELTS_PER_PATTERN. */
433	unsigned int nelts_per_pattern : 8;
434
435	/* For future expansion. */
436	unsigned int unused : 8;
437	} const_vector;
438	} GTY ((skip)) u2;
439
440	/* The first element of the operands of this rtx.
441	The number of operands and their types are controlled
442	by the `code' field, according to rtl.def. */
443	union u {
444	rtunion fld[1];
445	HOST_WIDE_INTlong hwint[1];
446	struct reg_info reg;
447	struct block_symbol block_sym;
448	struct real_value rv;
449	struct fixed_value fv;
450	struct hwivec_def hwiv;
451	struct const_poly_int_def cpi;
452	} GTY ((special ("rtx_def"), desc ("GET_CODE (&%0)"))) u;
453	};
454
455	/* A node for constructing singly-linked lists of rtx. */
456
457	struct GTY(()) rtx_expr_list : public rtx_def
458	{
459	private:
460	/* No extra fields, but adds invariant: (GET_CODE (X) == EXPR_LIST). */
461
462	public:
463	/* Get next in list. */
464	rtx_expr_list *next () const;
465
466	/* Get at the underlying rtx. */
467	rtx element () const;
468	};
469
470	template <>
471	template <>
472	inline bool
473	is_a_helper <rtx_expr_list *>::test (rtx rt)
474	{
475	return rt->code == EXPR_LIST;
476	}
477
478	struct GTY(()) rtx_insn_list : public rtx_def
479	{
480	private:
481	/* No extra fields, but adds invariant: (GET_CODE (X) == INSN_LIST).
482
483	This is an instance of:
484
485	DEF_RTL_EXPR(INSN_LIST, "insn_list", "ue", RTX_EXTRA)
486
487	i.e. a node for constructing singly-linked lists of rtx_insn *, where
488	the list is "external" to the insn (as opposed to the doubly-linked
489	list embedded within rtx_insn itself). */
490
491	public:
492	/* Get next in list. */
493	rtx_insn_list *next () const;
494
495	/* Get at the underlying instruction. */
496	rtx_insn *insn () const;
497
498	};
499
500	template <>
501	template <>
502	inline bool
503	is_a_helper <rtx_insn_list *>::test (rtx rt)
504	{
505	return rt->code == INSN_LIST;
506	}
507
508	/* A node with invariant GET_CODE (X) == SEQUENCE i.e. a vector of rtx,
509	typically (but not always) of rtx_insn , used in the late passes. /
510
511	struct GTY(()) rtx_sequence : public rtx_def
512	{
513	private:
514	/* No extra fields, but adds invariant: (GET_CODE (X) == SEQUENCE). */
515
516	public:
517	/* Get number of elements in sequence. */
518	int len () const;
519
520	/* Get i-th element of the sequence. */
521	rtx element (int index) const;
522
523	/* Get i-th element of the sequence, with a checked cast to
524	rtx_insn . /
525	rtx_insn *insn (int index) const;
526	};
527
528	template <>
529	template <>
530	inline bool
531	is_a_helper <rtx_sequence *>::test (rtx rt)
532	{
533	return rt->code == SEQUENCE;
534	}
535
536	template <>
537	template <>
538	inline bool
539	is_a_helper <const rtx_sequence *>::test (const_rtx rt)
540	{
541	return rt->code == SEQUENCE;
542	}
543
544	struct GTY(()) rtx_insn : public rtx_def
545	{
546	public:
547	/* No extra fields, but adds the invariant:
548
549	(INSN_P (X)
550	\|\| NOTE_P (X)
551	\|\| JUMP_TABLE_DATA_P (X)
552	\|\| BARRIER_P (X)
553	\|\| LABEL_P (X))
554
555	i.e. that we must be able to use the following:
556	INSN_UID ()
557	NEXT_INSN ()
558	PREV_INSN ()
559	i.e. we have an rtx that has an INSN_UID field and can be part of
560	a linked list of insns.
561	*/
562
563	/* Returns true if this insn has been deleted. */
564
565	bool deleted () const { return volatil; }
566
567	/* Mark this insn as deleted. */
568
569	void set_deleted () { volatil = true; }
570
571	/* Mark this insn as not deleted. */
572
573	void set_undeleted () { volatil = false; }
574	};
575
576	/* Subclasses of rtx_insn. */
577
578	struct GTY(()) rtx_debug_insn : public rtx_insn
579	{
580	/* No extra fields, but adds the invariant:
581	DEBUG_INSN_P (X) aka (GET_CODE (X) == DEBUG_INSN)
582	i.e. an annotation for tracking variable assignments.
583
584	This is an instance of:
585	DEF_RTL_EXPR(DEBUG_INSN, "debug_insn", "uuBeiie", RTX_INSN)
586	from rtl.def. */
587	};
588
589	struct GTY(()) rtx_nonjump_insn : public rtx_insn
590	{
591	/* No extra fields, but adds the invariant:
592	NONJUMP_INSN_P (X) aka (GET_CODE (X) == INSN)
593	i.e an instruction that cannot jump.
594
595	This is an instance of:
596	DEF_RTL_EXPR(INSN, "insn", "uuBeiie", RTX_INSN)
597	from rtl.def. */
598	};
599
600	struct GTY(()) rtx_jump_insn : public rtx_insn
601	{
602	public:
603	/* No extra fields, but adds the invariant:
604	JUMP_P (X) aka (GET_CODE (X) == JUMP_INSN)
605	i.e. an instruction that can possibly jump.
606
607	This is an instance of:
608	DEF_RTL_EXPR(JUMP_INSN, "jump_insn", "uuBeiie0", RTX_INSN)
609	from rtl.def. */
610
611	/* Returns jump target of this instruction. The returned value is not
612	necessarily a code label: it may also be a RETURN or SIMPLE_RETURN
613	expression. Also, when the code label is marked "deleted", it is
614	replaced by a NOTE. In some cases the value is NULL_RTX. */
615
616	inline rtx jump_label () const;
617
618	/* Returns jump target cast to rtx_code_label . /
619
620	inline rtx_code_label *jump_target () const;
621
622	/* Set jump target. */
623
624	inline void set_jump_target (rtx_code_label *);
625	};
626
627	struct GTY(()) rtx_call_insn : public rtx_insn
628	{
629	/* No extra fields, but adds the invariant:
630	CALL_P (X) aka (GET_CODE (X) == CALL_INSN)
631	i.e. an instruction that can possibly call a subroutine
632	but which will not change which instruction comes next
633	in the current function.
634
635	This is an instance of:
636	DEF_RTL_EXPR(CALL_INSN, "call_insn", "uuBeiiee", RTX_INSN)
637	from rtl.def. */
638	};
639
640	struct GTY(()) rtx_jump_table_data : public rtx_insn
641	{
642	/* No extra fields, but adds the invariant:
643	JUMP_TABLE_DATA_P (X) aka (GET_CODE (INSN) == JUMP_TABLE_DATA)
644	i.e. a data for a jump table, considered an instruction for
645	historical reasons.
646
647	This is an instance of:
648	DEF_RTL_EXPR(JUMP_TABLE_DATA, "jump_table_data", "uuBe0000", RTX_INSN)
649	from rtl.def. */
650
651	/* This can be either:
652
653	(a) a table of absolute jumps, in which case PATTERN (this) is an
654	ADDR_VEC with arg 0 a vector of labels, or
655
656	(b) a table of relative jumps (e.g. for -fPIC), in which case
657	PATTERN (this) is an ADDR_DIFF_VEC, with arg 0 a LABEL_REF and
658	arg 1 the vector of labels.
659
660	This method gets the underlying vec. */
661
662	inline rtvec get_labels () const;
663	inline scalar_int_mode get_data_mode () const;
664	};
665
666	struct GTY(()) rtx_barrier : public rtx_insn
667	{
668	/* No extra fields, but adds the invariant:
669	BARRIER_P (X) aka (GET_CODE (X) == BARRIER)
670	i.e. a marker that indicates that control will not flow through.
671
672	This is an instance of:
673	DEF_RTL_EXPR(BARRIER, "barrier", "uu00000", RTX_EXTRA)
674	from rtl.def. */
675	};
676
677	struct GTY(()) rtx_code_label : public rtx_insn
678	{
679	/* No extra fields, but adds the invariant:
680	LABEL_P (X) aka (GET_CODE (X) == CODE_LABEL)
681	i.e. a label in the assembler.
682
683	This is an instance of:
684	DEF_RTL_EXPR(CODE_LABEL, "code_label", "uuB00is", RTX_EXTRA)
685	from rtl.def. */
686	};
687
688	struct GTY(()) rtx_note : public rtx_insn
689	{
690	/* No extra fields, but adds the invariant:
691	NOTE_P(X) aka (GET_CODE (X) == NOTE)
692	i.e. a note about the corresponding source code.
693
694	This is an instance of:
695	DEF_RTL_EXPR(NOTE, "note", "uuB0ni", RTX_EXTRA)
696	from rtl.def. */
697	};
698
699	/* The size in bytes of an rtx header (code, mode and flags). */
700	#define RTX_HDR_SIZE__builtin_offsetof(struct rtx_def, u) offsetof (struct rtx_def, u)__builtin_offsetof(struct rtx_def, u)
701
702	/* The size in bytes of an rtx with code CODE. */
703	#define RTX_CODE_SIZE(CODE)rtx_code_size[CODE] rtx_code_size[CODE]
704
705	#define NULL_RTX(rtx) 0 (rtx) 0
706
707	/* The "next" and "previous" RTX, relative to this one. */
708
709	#define RTX_NEXT(X)(rtx_next[((enum rtx_code) (X)->code)] == 0 ? __null : (rtx )(((char *)X) + rtx_next[((enum rtx_code) (X)->code)])) (rtx_next[GET_CODE (X)((enum rtx_code) (X)->code)] == 0 ? NULL__null \
710	: (rtx )(((char *)X) + rtx_next[GET_CODE (X)((enum rtx_code) (X)->code)]))
711
712	/* FIXME: the "NEXT_INSN (PREV_INSN (X)) == X" condition shouldn't be needed.
713	*/
714	#define RTX_PREV(X)(((((((enum rtx_code) (X)->code) == INSN) \|\| (((enum rtx_code ) (X)->code) == JUMP_INSN) \|\| (((enum rtx_code) (X)->code ) == CALL_INSN)) \|\| (((enum rtx_code) (X)->code) == DEBUG_INSN )) \|\| (((enum rtx_code) (X)->code) == NOTE) \|\| (((enum rtx_code ) (X)->code) == JUMP_TABLE_DATA) \|\| (((enum rtx_code) (X)-> code) == BARRIER) \|\| (((enum rtx_code) (X)->code) == CODE_LABEL )) && PREV_INSN (as_a <rtx_insn > (X)) != __null && NEXT_INSN (PREV_INSN (as_a <rtx_insn > (X) )) == X ? PREV_INSN (as_a <rtx_insn *> (X)) : __null) ((INSN_P (X)(((((enum rtx_code) (X)->code) == INSN) \|\| (((enum rtx_code ) (X)->code) == JUMP_INSN) \|\| (((enum rtx_code) (X)->code ) == CALL_INSN)) \|\| (((enum rtx_code) (X)->code) == DEBUG_INSN )) \
715	\|\| NOTE_P (X)(((enum rtx_code) (X)->code) == NOTE) \
716	\|\| JUMP_TABLE_DATA_P (X)(((enum rtx_code) (X)->code) == JUMP_TABLE_DATA) \
717	\|\| BARRIER_P (X)(((enum rtx_code) (X)->code) == BARRIER) \
718	\|\| LABEL_P (X)(((enum rtx_code) (X)->code) == CODE_LABEL)) \
719	&& PREV_INSN (as_a <rtx_insn *> (X)) != NULL__null \
720	&& NEXT_INSN (PREV_INSN (as_a <rtx_insn *> (X))) == X \
721	? PREV_INSN (as_a <rtx_insn *> (X)) : NULL__null)
722
723	/* Define macros to access the `code' field of the rtx. */
724
725	#define GET_CODE(RTX)((enum rtx_code) (RTX)->code) ((enum rtx_code) (RTX)->code)
726	#define PUT_CODE(RTX, CODE)((RTX)->code = (CODE)) ((RTX)->code = (CODE))
727
728	#define GET_MODE(RTX)((machine_mode) (RTX)->mode) ((machine_mode) (RTX)->mode)
729	#define PUT_MODE_RAW(RTX, MODE)((RTX)->mode = (MODE)) ((RTX)->mode = (MODE))
730
731	/* RTL vector. These appear inside RTX's when there is a need
732	for a variable number of things. The principle use is inside
733	PARALLEL expressions. */
734
735	struct GTY(()) rtvec_def {
736	int num_elem; /* number of elements */
737	rtx GTY ((length ("%h.num_elem"))) elem[1];
738	};
739
740	#define NULL_RTVEC(rtvec) 0 (rtvec) 0
741
742	#define GET_NUM_ELEM(RTVEC)((RTVEC)->num_elem) ((RTVEC)->num_elem)
743	#define PUT_NUM_ELEM(RTVEC, NUM)((RTVEC)->num_elem = (NUM)) ((RTVEC)->num_elem = (NUM))
744
745	/* Predicate yielding nonzero iff X is an rtx for a register. */
746	#define REG_P(X)(((enum rtx_code) (X)->code) == REG) (GET_CODE (X)((enum rtx_code) (X)->code) == REG)
747
748	/* Predicate yielding nonzero iff X is an rtx for a memory location. */
749	#define MEM_P(X)(((enum rtx_code) (X)->code) == MEM) (GET_CODE (X)((enum rtx_code) (X)->code) == MEM)
750
751	#if TARGET_SUPPORTS_WIDE_INT1
752
753	/* Match CONST_s that can represent compile-time constant integers. /
754	#define CASE_CONST_SCALAR_INTcase CONST_INT: case CONST_WIDE_INT \
755	case CONST_INT: \
756	case CONST_WIDE_INT
757
758	/* Match CONST_*s for which pointer equality corresponds to value
759	equality. */
760	#define CASE_CONST_UNIQUEcase CONST_INT: case CONST_WIDE_INT: case CONST_POLY_INT: case CONST_DOUBLE: case CONST_FIXED \
761	case CONST_INT: \
762	case CONST_WIDE_INT: \
763	case CONST_POLY_INT: \
764	case CONST_DOUBLE: \
765	case CONST_FIXED
766
767	/* Match all CONST_* rtxes. */
768	#define CASE_CONST_ANYcase CONST_INT: case CONST_WIDE_INT: case CONST_POLY_INT: case CONST_DOUBLE: case CONST_FIXED: case CONST_VECTOR \
769	case CONST_INT: \
770	case CONST_WIDE_INT: \
771	case CONST_POLY_INT: \
772	case CONST_DOUBLE: \
773	case CONST_FIXED: \
774	case CONST_VECTOR
775
776	#else
777
778	/* Match CONST_s that can represent compile-time constant integers. /
779	#define CASE_CONST_SCALAR_INTcase CONST_INT: case CONST_WIDE_INT \
780	case CONST_INT: \
781	case CONST_DOUBLE
782
783	/* Match CONST_*s for which pointer equality corresponds to value
784	equality. */
785	#define CASE_CONST_UNIQUEcase CONST_INT: case CONST_WIDE_INT: case CONST_POLY_INT: case CONST_DOUBLE: case CONST_FIXED \
786	case CONST_INT: \
787	case CONST_DOUBLE: \
788	case CONST_FIXED
789
790	/* Match all CONST_* rtxes. */
791	#define CASE_CONST_ANYcase CONST_INT: case CONST_WIDE_INT: case CONST_POLY_INT: case CONST_DOUBLE: case CONST_FIXED: case CONST_VECTOR \
792	case CONST_INT: \
793	case CONST_DOUBLE: \
794	case CONST_FIXED: \
795	case CONST_VECTOR
796	#endif
797
798	/* Predicate yielding nonzero iff X is an rtx for a constant integer. */
799	#define CONST_INT_P(X)(((enum rtx_code) (X)->code) == CONST_INT) (GET_CODE (X)((enum rtx_code) (X)->code) == CONST_INT)
800
801	/* Predicate yielding nonzero iff X is an rtx for a constant integer. */
802	#define CONST_WIDE_INT_P(X)(((enum rtx_code) (X)->code) == CONST_WIDE_INT) (GET_CODE (X)((enum rtx_code) (X)->code) == CONST_WIDE_INT)
803
804	/* Predicate yielding nonzero iff X is an rtx for a polynomial constant
805	integer. */
806	#define CONST_POLY_INT_P(X)(1 > 1 && ((enum rtx_code) (X)->code) == CONST_POLY_INT ) \
807	(NUM_POLY_INT_COEFFS1 > 1 && GET_CODE (X)((enum rtx_code) (X)->code) == CONST_POLY_INT)
808
809	/* Predicate yielding nonzero iff X is an rtx for a constant fixed-point. */
810	#define CONST_FIXED_P(X)(((enum rtx_code) (X)->code) == CONST_FIXED) (GET_CODE (X)((enum rtx_code) (X)->code) == CONST_FIXED)
811
812	/* Predicate yielding true iff X is an rtx for a double-int
813	or floating point constant. */
814	#define CONST_DOUBLE_P(X)(((enum rtx_code) (X)->code) == CONST_DOUBLE) (GET_CODE (X)((enum rtx_code) (X)->code) == CONST_DOUBLE)
815
816	/* Predicate yielding true iff X is an rtx for a double-int. */
817	#define CONST_DOUBLE_AS_INT_P(X)(((enum rtx_code) (X)->code) == CONST_DOUBLE && (( machine_mode) (X)->mode) == ((void) 0, E_VOIDmode)) \
818	(GET_CODE (X)((enum rtx_code) (X)->code) == CONST_DOUBLE && GET_MODE (X)((machine_mode) (X)->mode) == VOIDmode((void) 0, E_VOIDmode))
819
820	/* Predicate yielding true iff X is an rtx for a integer const. */
821	#if TARGET_SUPPORTS_WIDE_INT1
822	#define CONST_SCALAR_INT_P(X)((((enum rtx_code) (X)->code) == CONST_INT) \|\| (((enum rtx_code ) (X)->code) == CONST_WIDE_INT)) \
823	(CONST_INT_P (X)(((enum rtx_code) (X)->code) == CONST_INT) \|\| CONST_WIDE_INT_P (X)(((enum rtx_code) (X)->code) == CONST_WIDE_INT))
824	#else
825	#define CONST_SCALAR_INT_P(X)((((enum rtx_code) (X)->code) == CONST_INT) \|\| (((enum rtx_code ) (X)->code) == CONST_WIDE_INT)) \
826	(CONST_INT_P (X)(((enum rtx_code) (X)->code) == CONST_INT) \|\| CONST_DOUBLE_AS_INT_P (X)(((enum rtx_code) (X)->code) == CONST_DOUBLE && (( machine_mode) (X)->mode) == ((void) 0, E_VOIDmode)))
827	#endif
828
829	/* Predicate yielding true iff X is an rtx for a double-int. */
830	#define CONST_DOUBLE_AS_FLOAT_P(X)(((enum rtx_code) (X)->code) == CONST_DOUBLE && (( machine_mode) (X)->mode) != ((void) 0, E_VOIDmode)) \
831	(GET_CODE (X)((enum rtx_code) (X)->code) == CONST_DOUBLE && GET_MODE (X)((machine_mode) (X)->mode) != VOIDmode((void) 0, E_VOIDmode))
832
833	/* Predicate yielding nonzero iff X is an rtx for a constant vector. */
834	#define CONST_VECTOR_P(X)(((enum rtx_code) (X)->code) == CONST_VECTOR) (GET_CODE (X)((enum rtx_code) (X)->code) == CONST_VECTOR)
835
836