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

Bug Summary

File:	build/gcc/jump.cc
Warning:	line 1152, column 13 Called C++ object pointer is null
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 jump.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-8g9ZNs.plist -x c++ /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc
1/* Optimize jump instructions, 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 pathetic reminder of old fame of the jump-optimization pass
 of the compiler.  Now it contains basically a set of utility functions to
 operate with jumps.

 Each CODE_LABEL has a count of the times it is used
 stored in the LABEL_NUSES internal field, and each JUMP_INSN
 has one label that it refers to stored in the
 JUMP_LABEL internal field.  With this we can detect labels that
 become unused because of the deletion of all the jumps that
 formerly used them.  The JUMP_LABEL info is sometimes looked
 at by later passes.  For return insns, it contains either a
 RETURN or a SIMPLE_RETURN rtx.

 The subroutines redirect_jump and invert_jump are used
 from other passes as well.  */

36#include "config.h"
37#include "system.h"
38#include "coretypes.h"
39#include "backend.h"
40#include "target.h"
41#include "rtl.h"
42#include "tree.h"
43#include "cfghooks.h"
44#include "tree-pass.h"
45#include "memmodel.h"
46#include "tm_p.h"
47#include "insn-config.h"
48#include "regs.h"
49#include "emit-rtl.h"
50#include "recog.h"
51#include "cfgrtl.h"
52#include "rtl-iter.h"

54/* Optimize jump y; x: ... y: jumpif... x?
 Don't know if it is worth bothering with.  */
56/* Optimize two cases of conditional jump to conditional jump?
 This can never delete any instruction or make anything dead,
 or even change what is live at any point.
 So perhaps let combiner do it.  */

61static void init_label_info (rtx_insn *);
62static void mark_all_labels (rtx_insn *);
63static void mark_jump_label_1 (rtx, rtx_insn *, bool, bool);
64static void mark_jump_label_asm (rtx, rtx_insn *);
65static void redirect_exp_1 (rtx *, rtx, rtx, rtx_insn *);
66static int invert_exp_1 (rtx, rtx_insn *);
67
68/* Worker for rebuild_jump_labels and rebuild_jump_labels_chain.  */
69static void
70rebuild_jump_labels_1 (rtx_insn *f, bool count_forced)
71{
timevar_push (TV_REBUILD_JUMP);
init_label_info (f);
mark_all_labels (f);
2
←
Calling 'mark_all_labels'→

/* Keep track of labels used from static data; we don't track them
   closely enough to delete them here, so make sure their reference
   count doesn't drop to zero.  */

if (count_forced)
  {
    rtx_insn *insn;
    unsigned int i;
    FOR_EACH_VEC_SAFE_ELT (forced_labels, i, insn)for (i = 0; vec_safe_iterate ((((&x_rtl)->expr.x_forced_labels
)), (i), &(insn)); ++(i))
if (LABEL_P (insn)(((enum rtx_code) (insn)->code) == CODE_LABEL))
 LABEL_NUSES (insn)(((insn)->u.fld[4]).rt_int)++;
  }
timevar_pop (TV_REBUILD_JUMP);
89}

91/* This function rebuilds the JUMP_LABEL field and REG_LABEL_TARGET
 notes in jumping insns and REG_LABEL_OPERAND notes in non-jumping
 instructions and jumping insns that have labels as operands
 (e.g. cbranchsi4).  */
95void
96rebuild_jump_labels (rtx_insn *f)
97{
rebuild_jump_labels_1 (f, true);
99}

101/* This function is like rebuild_jump_labels, but doesn't run over
 forced_labels.  It can be used on insn chains that aren't the 
 main function chain.  */
104void
105rebuild_jump_labels_chain (rtx_insn *chain)
106{
rebuild_jump_labels_1 (chain, false);
1
Calling 'rebuild_jump_labels_1'→
108}
109
110/* Some old code expects exactly one BARRIER as the NEXT_INSN of a
 non-fallthru insn.  This is not generally true, as multiple barriers
 may have crept in, or the BARRIER may be separated from the last
 real insn by one or more NOTEs.

 This simple pass moves barriers and removes duplicates so that the
 old code is happy.
*/
118static unsigned int
119cleanup_barriers (void)
120{
rtx_insn *insn;
for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
  {
    if (BARRIER_P (insn)(((enum rtx_code) (insn)->code) == BARRIER))
{
 rtx_insn *prev = prev_nonnote_nondebug_insn (insn);
 if (!prev)
   continue;

 if (BARRIER_P (prev)(((enum rtx_code) (prev)->code) == BARRIER))
   delete_insn (insn);
 else if (prev != PREV_INSN (insn))
   {
     basic_block bb = BLOCK_FOR_INSN (prev);
     rtx_insn *end = PREV_INSN (insn);
     reorder_insns_nobb (insn, insn, prev);
     if (bb)
{
  /* If the backend called in machine reorg compute_bb_for_insn
     and didn't free_bb_for_insn again, preserve basic block
     boundaries.  Move the end of basic block to PREV since
     it is followed by a barrier now, and clear BLOCK_FOR_INSN
     on the following notes.
     ???  Maybe the proper solution for the targets that have
     cfg around after machine reorg is not to run cleanup_barriers
     pass at all.  */
  BB_END (bb)(bb)->il.x.rtl->end_ = prev;
  do
    {
      prev = NEXT_INSN (prev);
      if (prev != insn && BLOCK_FOR_INSN (prev) == bb)
	BLOCK_FOR_INSN (prev) = NULLnullptr;
    }
  while (prev != end);
}
   }
}
  }
return 0;
160}

162namespace {

164const pass_data pass_data_cleanup_barriers =
165{
RTL_PASS, /* type */
"barriers", /* 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 */
175};

177class pass_cleanup_barriers : public rtl_opt_pass
178{
179public:
pass_cleanup_barriers (gcc::context *ctxt)
  : rtl_opt_pass (pass_data_cleanup_barriers, ctxt)
{}

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

190}; // class pass_cleanup_barriers

192} // anon namespace

194rtl_opt_pass *
195make_pass_cleanup_barriers (gcc::context *ctxt)
196{
return new pass_cleanup_barriers (ctxt);
198}

200
201/* Initialize LABEL_NUSES and JUMP_LABEL fields, add REG_LABEL_TARGET
 for remaining targets for JUMP_P.  Delete any REG_LABEL_OPERAND
 notes whose labels don't occur in the insn any more.  */

205static void
206init_label_info (rtx_insn *f)
207{
rtx_insn *insn;

for (insn = f; insn; insn = NEXT_INSN (insn))
  {
    if (LABEL_P (insn)(((enum rtx_code) (insn)->code) == CODE_LABEL))
LABEL_NUSES (insn)(((insn)->u.fld[4]).rt_int) = (LABEL_PRESERVE_P (insn)(__extension__ ({ __typeof ((insn)) const _rtx = ((insn)); if
 (((enum rtx_code) (_rtx)->code) != CODE_LABEL && (
(enum rtx_code) (_rtx)->code) != NOTE) rtl_check_failed_flag
 ("LABEL_PRESERVE_P",_rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 213, __FUNCTION__); _rtx; })->in_struct) != 0);

    /* REG_LABEL_TARGET notes (including the JUMP_LABEL field) are
sticky and not reset here; that way we won't lose association
with a label when e.g. the source for a target register
disappears out of reach for targets that may use jump-target
registers.  Jump transformations are supposed to transform
any REG_LABEL_TARGET notes.  The target label reference in a
branch may disappear from the branch (and from the
instruction before it) for other reasons, like register
allocation.  */

    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)))
{
 rtx note, next;

 for (note = REG_NOTES (insn)(((insn)->u.fld[6]).rt_rtx); note; note = next)
   {
     next = XEXP (note, 1)(((note)->u.fld[1]).rt_rtx);
     if (REG_NOTE_KIND (note)((enum reg_note) ((machine_mode) (note)->mode)) == REG_LABEL_OPERAND
  && ! reg_mentioned_p (XEXP (note, 0)(((note)->u.fld[0]).rt_rtx), PATTERN (insn)))
remove_note (insn, note);
   }
}
  }
238}

240/* A subroutine of mark_all_labels.  Trivially propagate a simple label
 load into a jump_insn that uses it.  */

243static void
244maybe_propagate_label_ref (rtx_insn *jump_insn, rtx_insn *prev_nonjump_insn)
245{
rtx label_note, pc, pc_src;

pc = pc_set (jump_insn);
pc_src = pc != NULLnullptr ? SET_SRC (pc)(((pc)->u.fld[1]).rt_rtx) : NULLnullptr;
label_note = find_reg_note (prev_nonjump_insn, REG_LABEL_OPERAND, NULLnullptr);

/* If the previous non-jump insn sets something to a label,
   something that this jump insn uses, make that label the primary
   target of this insn if we don't yet have any.  That previous
   insn must be a single_set and not refer to more than one label.
   The jump insn must not refer to other labels as jump targets
   and must be a plain (set (pc) ...), maybe in a parallel, and
   may refer to the item being set only directly or as one of the
   arms in an IF_THEN_ELSE.  */

if (label_note != NULLnullptr && pc_src != NULLnullptr)
  {
    rtx label_set = single_set (prev_nonjump_insn);
    rtx label_dest = label_set != NULLnullptr ? SET_DEST (label_set)(((label_set)->u.fld[0]).rt_rtx) : NULLnullptr;

    if (label_set != NULLnullptr
 /* The source must be the direct LABEL_REF, not a
    PLUS, UNSPEC, IF_THEN_ELSE etc.  */
 && GET_CODE (SET_SRC (label_set))((enum rtx_code) ((((label_set)->u.fld[1]).rt_rtx))->code
) == LABEL_REF
 && (rtx_equal_p (label_dest, pc_src)
     || (GET_CODE (pc_src)((enum rtx_code) (pc_src)->code) == IF_THEN_ELSE
  && (rtx_equal_p (label_dest, XEXP (pc_src, 1)(((pc_src)->u.fld[1]).rt_rtx))
      || rtx_equal_p (label_dest, XEXP (pc_src, 2)(((pc_src)->u.fld[2]).rt_rtx))))))
{
 /* The CODE_LABEL referred to in the note must be the
    CODE_LABEL in the LABEL_REF of the "set".  We can
    conveniently use it for the marker function, which
    requires a LABEL_REF wrapping.  */
 gcc_assert (XEXP (label_note, 0) == label_ref_label (SET_SRC (label_set)))((void)(!((((label_note)->u.fld[0]).rt_rtx) == label_ref_label
 ((((label_set)->u.fld[1]).rt_rtx))) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 279, __FUNCTION__), 0 : 0));

 mark_jump_label_1 (label_set, jump_insn, false, true);

 gcc_assert (JUMP_LABEL (jump_insn) == XEXP (label_note, 0))((void)(!((((jump_insn)->u.fld[7]).rt_rtx) == (((label_note
)->u.fld[0]).rt_rtx)) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 283, __FUNCTION__), 0 : 0));
}
  }
286}

288/* Mark the label each jump jumps to.
 Combine consecutive labels, and count uses of labels.  */

291static void
292mark_all_labels (rtx_insn *f)
293{
rtx_insn *insn;

if (current_ir_type () == IR_RTL_CFGLAYOUT)
3
←
Assuming the condition is true→
4
←
Taking true branch→
  {
    basic_block bb;
    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)
5
←
Assuming 'bb' is not equal to field 'x_exit_block_ptr'→
6
←
Loop condition is true.  Entering loop body→
{
 /* In cfglayout mode, we don't bother with trivial next-insn
    propagation of LABEL_REFs into JUMP_LABEL.  This will be
    handled by other optimizers using better algorithms.  */
 FOR_BB_INSNS (bb, insn)for ((insn) = (bb)->il.x.head_; (insn) && (insn) !=
 NEXT_INSN ((bb)->il.x.rtl->end_); (insn) = NEXT_INSN (
insn))
7
←
Assuming 'insn' is null→
   {
     gcc_assert (! insn->deleted ())((void)(!(! insn->deleted ()) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 306, __FUNCTION__), 0 : 0));
     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)))
       mark_jump_label (PATTERN (insn), insn, 0);
   }

 /* In cfglayout mode, there may be non-insns between the
    basic blocks.  If those non-insns represent tablejump data,
    they contain label references that we must record.  */
 for (insn = BB_HEADER (bb)(bb)->il.x.rtl->header_; insn; insn = NEXT_INSN (insn))
8
←
Loop condition is true.  Entering loop body→
   if (JUMP_TABLE_DATA_P (insn)(((enum rtx_code) (insn)->code) == JUMP_TABLE_DATA))
9
←
Assuming field 'code' is equal to JUMP_TABLE_DATA→
10
←
Taking true branch→
     mark_jump_label (PATTERN (insn), insn, 0);
11
←
Calling 'mark_jump_label'→
 for (insn = BB_FOOTER (bb)(bb)->il.x.rtl->footer_; insn; insn = NEXT_INSN (insn))
   if (JUMP_TABLE_DATA_P (insn)(((enum rtx_code) (insn)->code) == JUMP_TABLE_DATA))
     mark_jump_label (PATTERN (insn), insn, 0);
}
  }
else
  {
    rtx_insn *prev_nonjump_insn = NULLnullptr;
    for (insn = f; insn; insn = NEXT_INSN (insn))
{
 if (insn->deleted ())
   ;
 else if (LABEL_P (insn)(((enum rtx_code) (insn)->code) == CODE_LABEL))
   prev_nonjump_insn = NULLnullptr;
 else if (JUMP_TABLE_DATA_P (insn)(((enum rtx_code) (insn)->code) == JUMP_TABLE_DATA))
   mark_jump_label (PATTERN (insn), insn, 0);
 else 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)))
   {
     mark_jump_label (PATTERN (insn), insn, 0);
     if (JUMP_P (insn)(((enum rtx_code) (insn)->code) == JUMP_INSN))
{
  if (JUMP_LABEL (insn)(((insn)->u.fld[7]).rt_rtx) == NULLnullptr && prev_nonjump_insn != NULLnullptr)
    maybe_propagate_label_ref (insn, prev_nonjump_insn);
}
     else
prev_nonjump_insn = insn;
   }
}
  }
346}
347
348/* Given a comparison (CODE ARG0 ARG1), inside an insn, INSN, return a code
 of reversed comparison if it is possible to do so.  Otherwise return UNKNOWN.
 UNKNOWN may be returned in case we are having CC_MODE compare and we don't
 know whether it's source is floating point or integer comparison.  Machine
 description should define REVERSIBLE_CC_MODE and REVERSE_CONDITION macros
 to help this function avoid overhead in these cases.  */
354enum rtx_code
355reversed_comparison_code_parts (enum rtx_code code, const_rtx arg0,
		const_rtx arg1, const rtx_insn *insn)
357{
machine_mode mode;

/* If this is not actually a comparison, we can't reverse it.  */
if (GET_RTX_CLASS (code)(rtx_class[(int) (code)]) != RTX_COMPARE
    && GET_RTX_CLASS (code)(rtx_class[(int) (code)]) != RTX_COMM_COMPARE)
  return UNKNOWN;

mode = GET_MODE (arg0)((machine_mode) (arg0)->mode);
if (mode == VOIDmode((void) 0, E_VOIDmode))
  mode = GET_MODE (arg1)((machine_mode) (arg1)->mode);

/* First see if machine description supplies us way to reverse the
   comparison.  Give it priority over everything else to allow
   machine description to do tricks.  */
if (GET_MODE_CLASS (mode)((enum mode_class) mode_class[mode]) == MODE_CC
    && REVERSIBLE_CC_MODE (mode)1)
  return REVERSE_CONDITION (code, mode)ix86_reverse_condition ((code), (mode));

/* Try a few special cases based on the comparison code.  */
switch (code)
  {
  case GEU:
  case GTU:
  case LEU:
  case LTU:
  case NE:
  case EQ:
    /* It is always safe to reverse EQ and NE, even for the floating
point.  Similarly the unsigned comparisons are never used for
floating point so we can reverse them in the default way.  */
    return reverse_condition (code);
  case ORDERED:
  case UNORDERED:
  case LTGT:
  case UNEQ:
    /* In case we already see unordered comparison, we can be sure to
be dealing with floating point so we don't need any more tests.  */
    return reverse_condition_maybe_unordered (code);
  case UNLT:
  case UNLE:
  case UNGT:
  case UNGE:
    /* We don't have safe way to reverse these yet.  */
    return UNKNOWN;
  default:
    break;
  }

if (GET_MODE_CLASS (mode)((enum mode_class) mode_class[mode]) == MODE_CC)
  {
    /* Try to search for the comparison to determine the real mode.
       This code is expensive, but with sane machine description it
       will be never used, since REVERSIBLE_CC_MODE will return true
       in all cases.  */
    if (! insn)
return UNKNOWN;

    /* These CONST_CAST's are okay because prev_nonnote_insn just
returns its argument and we assign it to a const_rtx
variable.  */
    for (rtx_insn *prev = prev_nonnote_insn (const_cast<rtx_insn *> (insn));
  prev != 0 && !LABEL_P (prev)(((enum rtx_code) (prev)->code) == CODE_LABEL);
  prev = prev_nonnote_insn (prev))
{
 const_rtx set = set_of (arg0, prev);
 if (set && GET_CODE (set)((enum rtx_code) (set)->code) == SET
     && rtx_equal_p (SET_DEST (set)(((set)->u.fld[0]).rt_rtx), arg0))
   {
     rtx src = SET_SRC (set)(((set)->u.fld[1]).rt_rtx);

     if (GET_CODE (src)((enum rtx_code) (src)->code) == COMPARE)
{
  rtx comparison = src;
  arg0 = XEXP (src, 0)(((src)->u.fld[0]).rt_rtx);
  mode = GET_MODE (arg0)((machine_mode) (arg0)->mode);
  if (mode == VOIDmode((void) 0, E_VOIDmode))
    mode = GET_MODE (XEXP (comparison, 1))((machine_mode) ((((comparison)->u.fld[1]).rt_rtx))->mode
);
  break;
}
     /* We can get past reg-reg moves.  This may be useful for model
        of i387 comparisons that first move flag registers around.  */
     if (REG_P (src)(((enum rtx_code) (src)->code) == REG))
{
  arg0 = src;
  continue;
}
   }
 /* If register is clobbered in some ununderstandable way,
    give up.  */
 if (set)
   return UNKNOWN;
}
  }

/* Test for an integer condition, or a floating-point comparison
   in which NaNs can be ignored.  */
if (CONST_INT_P (arg0)(((enum rtx_code) (arg0)->code) == CONST_INT)
    || (GET_MODE (arg0)((machine_mode) (arg0)->mode) != VOIDmode((void) 0, E_VOIDmode)
 && GET_MODE_CLASS (mode)((enum mode_class) mode_class[mode]) != MODE_CC
 && !HONOR_NANS (mode)))
  return reverse_condition (code);

return UNKNOWN;
461}

463/* A wrapper around the previous function to take COMPARISON as rtx
 expression.  This simplifies many callers.  */
465enum rtx_code
466reversed_comparison_code (const_rtx comparison, const rtx_insn *insn)
467{
if (!COMPARISON_P (comparison)(((rtx_class[(int) (((enum rtx_code) (comparison)->code))]
) & (~1)) == (RTX_COMPARE & (~1))))
  return UNKNOWN;
return reversed_comparison_code_parts (GET_CODE (comparison)((enum rtx_code) (comparison)->code),
			 XEXP (comparison, 0)(((comparison)->u.fld[0]).rt_rtx),
			 XEXP (comparison, 1)(((comparison)->u.fld[1]).rt_rtx), insn);
473}

475/* Return comparison with reversed code of EXP.
 Return NULL_RTX in case we fail to do the reversal.  */
477rtx
478reversed_comparison (const_rtx exp, machine_mode mode)
479{
enum rtx_code reversed_code = reversed_comparison_code (exp, NULLnullptr);
if (reversed_code == UNKNOWN)
  return NULL_RTX(rtx) 0;
else
  return simplify_gen_relational (reversed_code, mode, VOIDmode((void) 0, E_VOIDmode),
                                  XEXP (exp, 0)(((exp)->u.fld[0]).rt_rtx), XEXP (exp, 1)(((exp)->u.fld[1]).rt_rtx));
486}

488
489/* Given an rtx-code for a comparison, return the code for the negated
 comparison.  If no such code exists, return UNKNOWN.

 WATCH OUT!  reverse_condition is not safe to use on a jump that might
 be acting on the results of an IEEE floating point comparison, because
 of the special treatment of non-signaling nans in comparisons.
 Use reversed_comparison_code instead.  */

497enum rtx_code
498reverse_condition (enum rtx_code code)
499{
switch (code)
  {
  case EQ:
    return NE;
  case NE:
    return EQ;
  case GT:
    return LE;
  case GE:
    return LT;
  case LT:
    return GE;
  case LE:
    return GT;
  case GTU:
    return LEU;
  case GEU:
    return LTU;
  case LTU:
    return GEU;
  case LEU:
    return GTU;
  case UNORDERED:
    return ORDERED;
  case ORDERED:
    return UNORDERED;

  case UNLT:
  case UNLE:
  case UNGT:
  case UNGE:
  case UNEQ:
  case LTGT:
    return UNKNOWN;

  default:
    gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 536, __FUNCTION__));
  }
538}

540/* Similar, but we're allowed to generate unordered comparisons, which
 makes it safe for IEEE floating-point.  Of course, we have to recognize
 that the target will support them too...  */

544enum rtx_code
545reverse_condition_maybe_unordered (enum rtx_code code)
546{
switch (code)
  {
  case EQ:
    return NE;
  case NE:
    return EQ;
  case GT:
    return UNLE;
  case GE:
    return UNLT;
  case LT:
    return UNGE;
  case LE:
    return UNGT;
  case LTGT:
    return UNEQ;
  case UNORDERED:
    return ORDERED;
  case ORDERED:
    return UNORDERED;
  case UNLT:
    return GE;
  case UNLE:
    return GT;
  case UNGT:
    return LE;
  case UNGE:
    return LT;
  case UNEQ:
    return LTGT;

  default:
    gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 579, __FUNCTION__));
  }
581}

583/* Similar, but return the code when two operands of a comparison are swapped.
 This IS safe for IEEE floating-point.  */

586enum rtx_code
587swap_condition (enum rtx_code code)
588{
switch (code)
  {
  case EQ:
  case NE:
  case UNORDERED:
  case ORDERED:
  case UNEQ:
  case LTGT:
    return code;

  case GT:
    return LT;
  case GE:
    return LE;
  case LT:
    return GT;
  case LE:
    return GE;
  case GTU:
    return LTU;
  case GEU:
    return LEU;
  case LTU:
    return GTU;
  case LEU:
    return GEU;
  case UNLT:
    return UNGT;
  case UNLE:
    return UNGE;
  case UNGT:
    return UNLT;
  case UNGE:
    return UNLE;

  default:
    gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 625, __FUNCTION__));
  }
627}

629/* Given a comparison CODE, return the corresponding unsigned comparison.
 If CODE is an equality comparison or already an unsigned comparison,
 CODE is returned.  */

633enum rtx_code
634unsigned_condition (enum rtx_code code)
635{
switch (code)
  {
  case EQ:
  case NE:
  case GTU:
  case GEU:
  case LTU:
  case LEU:
    return code;

  case GT:
    return GTU;
  case GE:
    return GEU;
  case LT:
    return LTU;
  case LE:
    return LEU;

  default:
    gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 656, __FUNCTION__));
  }
658}

660/* Similarly, return the signed version of a comparison.  */

662enum rtx_code
663signed_condition (enum rtx_code code)
664{
switch (code)
  {
  case EQ:
  case NE:
  case GT:
  case GE:
  case LT:
  case LE:
    return code;

  case GTU:
    return GT;
  case GEU:
    return GE;
  case LTU:
    return LT;
  case LEU:
    return LE;

  default:
    gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 685, __FUNCTION__));
  }
687}
688
689/* Return nonzero if CODE1 is more strict than CODE2, i.e., if the
 truth of CODE1 implies the truth of CODE2.  */

692int
693comparison_dominates_p (enum rtx_code code1, enum rtx_code code2)
694{
/* UNKNOWN comparison codes can happen as a result of trying to revert
   comparison codes.
   They can't match anything, so we have to reject them here.  */
if (code1 == UNKNOWN || code2 == UNKNOWN)
  return 0;

if (code1 == code2)
  return 1;

switch (code1)
  {
  case UNEQ:
    if (code2 == UNLE || code2 == UNGE)
return 1;
    break;

  case EQ:
    if (code2 == LE || code2 == LEU || code2 == GE || code2 == GEU
 || code2 == ORDERED)
return 1;
    break;

  case UNLT:
    if (code2 == UNLE || code2 == NE)
return 1;
    break;

  case LT:
    if (code2 == LE || code2 == NE || code2 == ORDERED || code2 == LTGT)
return 1;
    break;

  case UNGT:
    if (code2 == UNGE || code2 == NE)
return 1;
    break;

  case GT:
    if (code2 == GE || code2 == NE || code2 == ORDERED || code2 == LTGT)
return 1;
    break;

  case GE:
  case LE:
    if (code2 == ORDERED)
return 1;
    break;

  case LTGT:
    if (code2 == NE || code2 == ORDERED)
return 1;
    break;

  case LTU:
    if (code2 == LEU || code2 == NE)
return 1;
    break;

  case GTU:
    if (code2 == GEU || code2 == NE)
return 1;
    break;

  case UNORDERED:
    if (code2 == NE || code2 == UNEQ || code2 == UNLE || code2 == UNLT
 || code2 == UNGE || code2 == UNGT)
return 1;
    break;

  default:
    break;
  }

return 0;
769}
770
771/* Return 1 if INSN is an unconditional jump and nothing else.  */

773int
774simplejump_p (const rtx_insn *insn)
775{
return (JUMP_P (insn)(((enum rtx_code) (insn)->code) == JUMP_INSN)
 && GET_CODE (PATTERN (insn))((enum rtx_code) (PATTERN (insn))->code) == SET
 && GET_CODE (SET_DEST (PATTERN (insn)))((enum rtx_code) ((((PATTERN (insn))->u.fld[0]).rt_rtx))->
code) == PC
 && GET_CODE (SET_SRC (PATTERN (insn)))((enum rtx_code) ((((PATTERN (insn))->u.fld[1]).rt_rtx))->
code) == LABEL_REF);
780}

782/* Return nonzero if INSN is a (possibly) conditional jump
 and nothing more.

 Use of this function is deprecated, since we need to support combined
 branch and compare insns.  Use any_condjump_p instead whenever possible.  */

788int
789condjump_p (const rtx_insn *insn)
790{
const_rtx x = PATTERN (insn);

if (GET_CODE (x)((enum rtx_code) (x)->code) != SET
    || GET_CODE (SET_DEST (x))((enum rtx_code) ((((x)->u.fld[0]).rt_rtx))->code) != PC)
  return 0;

x = SET_SRC (x)(((x)->u.fld[1]).rt_rtx);
if (GET_CODE (x)((enum rtx_code) (x)->code) == LABEL_REF)
  return 1;
else
  return (GET_CODE (x)((enum rtx_code) (x)->code) == IF_THEN_ELSE
   && ((GET_CODE (XEXP (x, 2))((enum rtx_code) ((((x)->u.fld[2]).rt_rtx))->code) == PC
 && (GET_CODE (XEXP (x, 1))((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) == LABEL_REF
     || ANY_RETURN_P (XEXP (x, 1))(((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) == RETURN
 || ((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) ==
 SIMPLE_RETURN)))
|| (GET_CODE (XEXP (x, 1))((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) == PC
    && (GET_CODE (XEXP (x, 2))((enum rtx_code) ((((x)->u.fld[2]).rt_rtx))->code) == LABEL_REF
	|| ANY_RETURN_P (XEXP (x, 2))(((enum rtx_code) ((((x)->u.fld[2]).rt_rtx))->code) == RETURN
 || ((enum rtx_code) ((((x)->u.fld[2]).rt_rtx))->code) ==
 SIMPLE_RETURN)))));
808}

810/* Return nonzero if INSN is a (possibly) conditional jump inside a
 PARALLEL.

 Use this function is deprecated, since we need to support combined
 branch and compare insns.  Use any_condjump_p instead whenever possible.  */

816int
817condjump_in_parallel_p (const rtx_insn *insn)
818{
const_rtx x = PATTERN (insn);

if (GET_CODE (x)((enum rtx_code) (x)->code) != PARALLEL)
  return 0;
else
  x = XVECEXP (x, 0, 0)(((((x)->u.fld[0]).rt_rtvec))->elem[0]);

if (GET_CODE (x)((enum rtx_code) (x)->code) != SET)
  return 0;
if (GET_CODE (SET_DEST (x))((enum rtx_code) ((((x)->u.fld[0]).rt_rtx))->code) != PC)
  return 0;
if (GET_CODE (SET_SRC (x))((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) == LABEL_REF)
  return 1;
if (GET_CODE (SET_SRC (x))((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) != IF_THEN_ELSE)
  return 0;
if (XEXP (SET_SRC (x), 2)((((((x)->u.fld[1]).rt_rtx))->u.fld[2]).rt_rtx) == pc_rtx
    && (GET_CODE (XEXP (SET_SRC (x), 1))((enum rtx_code) (((((((x)->u.fld[1]).rt_rtx))->u.fld[1
]).rt_rtx))->code) == LABEL_REF
 || ANY_RETURN_P (XEXP (SET_SRC (x), 1))(((enum rtx_code) (((((((x)->u.fld[1]).rt_rtx))->u.fld[
1]).rt_rtx))->code) == RETURN || ((enum rtx_code) (((((((x
)->u.fld[1]).rt_rtx))->u.fld[1]).rt_rtx))->code) == SIMPLE_RETURN
)))
  return 1;
if (XEXP (SET_SRC (x), 1)((((((x)->u.fld[1]).rt_rtx))->u.fld[1]).rt_rtx) == pc_rtx
    && (GET_CODE (XEXP (SET_SRC (x), 2))((enum rtx_code) (((((((x)->u.fld[1]).rt_rtx))->u.fld[2
]).rt_rtx))->code) == LABEL_REF
 || ANY_RETURN_P (XEXP (SET_SRC (x), 2))(((enum rtx_code) (((((((x)->u.fld[1]).rt_rtx))->u.fld[
2]).rt_rtx))->code) == RETURN || ((enum rtx_code) (((((((x
)->u.fld[1]).rt_rtx))->u.fld[2]).rt_rtx))->code) == SIMPLE_RETURN
)))
  return 1;
return 0;
843}

845/* Return set of PC, otherwise NULL.  */

847rtx
848pc_set (const rtx_insn *insn)
849{
rtx pat;
if (!JUMP_P (insn)(((enum rtx_code) (insn)->code) == JUMP_INSN))
  return NULL_RTX(rtx) 0;
pat = PATTERN (insn);

/* The set is allowed to appear either as the insn pattern or
   the first set in a PARALLEL, UNSPEC or UNSPEC_VOLATILE.  */
switch (GET_CODE (pat)((enum rtx_code) (pat)->code))
  {
  case PARALLEL:
  case UNSPEC:
  case UNSPEC_VOLATILE:
    pat = XVECEXP (pat, 0, 0)(((((pat)->u.fld[0]).rt_rtvec))->elem[0]);
    break;
  default:
    break;
  }
if (GET_CODE (pat)((enum rtx_code) (pat)->code) == SET && GET_CODE (SET_DEST (pat))((enum rtx_code) ((((pat)->u.fld[0]).rt_rtx))->code) == PC)
  return pat;

return NULL_RTX(rtx) 0;
871}

873/* Return true when insn is an unconditional direct jump,
 possibly bundled inside a PARALLEL, UNSPEC or UNSPEC_VOLATILE.
 The instruction may have various other effects so before removing the jump
 you must verify onlyjump_p.  */

878int
879any_uncondjump_p (const rtx_insn *insn)
880{
const_rtx x = pc_set (insn);
if (!x)
  return 0;
if (GET_CODE (SET_SRC (x))((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) != LABEL_REF)
  return 0;
if (find_reg_note (insn, REG_NON_LOCAL_GOTO, NULL_RTX(rtx) 0))
  return 0;
return 1;
889}

891/* Return true when insn is a conditional jump.  This function works for
 instructions containing PC sets in PARALLELs, UNSPECs or UNSPEC_VOLATILEs.
 The instruction may have various other effects so before removing the jump
 you must verify onlyjump_p.

 Note that unlike condjump_p it returns false for unconditional jumps.  */

898int
899any_condjump_p (const rtx_insn *insn)
900{
const_rtx x = pc_set (insn);
enum rtx_code a, b;

if (!x)
  return 0;
if (GET_CODE (SET_SRC (x))((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) != IF_THEN_ELSE)
  return 0;

a = GET_CODE (XEXP (SET_SRC (x), 1))((enum rtx_code) (((((((x)->u.fld[1]).rt_rtx))->u.fld[1
]).rt_rtx))->code);
b = GET_CODE (XEXP (SET_SRC (x), 2))((enum rtx_code) (((((((x)->u.fld[1]).rt_rtx))->u.fld[2
]).rt_rtx))->code);

return ((b == PC && (a == LABEL_REF || a == RETURN || a == SIMPLE_RETURN))
 || (a == PC
     && (b == LABEL_REF || b == RETURN || b == SIMPLE_RETURN)));
915}

917/* Return the label of a conditional jump.  */

919rtx
920condjump_label (const rtx_insn *insn)
921{
rtx x = pc_set (insn);

if (!x)
  return NULL_RTX(rtx) 0;
x = SET_SRC (x)(((x)->u.fld[1]).rt_rtx);
if (GET_CODE (x)((enum rtx_code) (x)->code) == LABEL_REF)
  return x;
if (GET_CODE (x)((enum rtx_code) (x)->code) != IF_THEN_ELSE)
  return NULL_RTX(rtx) 0;
if (XEXP (x, 2)(((x)->u.fld[2]).rt_rtx) == pc_rtx && GET_CODE (XEXP (x, 1))((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) == LABEL_REF)
  return XEXP (x, 1)(((x)->u.fld[1]).rt_rtx);
if (XEXP (x, 1)(((x)->u.fld[1]).rt_rtx) == pc_rtx && GET_CODE (XEXP (x, 2))((enum rtx_code) ((((x)->u.fld[2]).rt_rtx))->code) == LABEL_REF)
  return XEXP (x, 2)(((x)->u.fld[2]).rt_rtx);
return NULL_RTX(rtx) 0;
936}

938/* Return TRUE if INSN is a return jump.  */

940int
941returnjump_p (const rtx_insn *insn)
942{
if (JUMP_P (insn)(((enum rtx_code) (insn)->code) == JUMP_INSN))
  {
    subrtx_iterator::array_type array;
    FOR_EACH_SUBRTX (iter, array, PATTERN (insn), NONCONST)for (subrtx_iterator iter (array, PATTERN (insn), rtx_nonconst_subrtx_bounds
); !iter.at_end (); iter.next ())
{
 const_rtx x = *iter;
 switch (GET_CODE (x)((enum rtx_code) (x)->code))
   {
   case RETURN:
   case SIMPLE_RETURN:
   case EH_RETURN:
     return true;

   case SET:
     if (SET_IS_RETURN_P (x)(__extension__ ({ __typeof ((x)) const _rtx = ((x)); if (((enum
 rtx_code) (_rtx)->code) != SET) rtl_check_failed_flag ("SET_IS_RETURN_P"
, _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 957, __FUNCTION__); _rtx; })->jump))
return true;
     break;

   default:
     break;
   }
}
  }
return false;
967}

969/* Return true if INSN is a (possibly conditional) return insn.  */

971int
972eh_returnjump_p (rtx_insn *insn)
973{
if (JUMP_P (insn)(((enum rtx_code) (insn)->code) == JUMP_INSN))
  {
    subrtx_iterator::array_type array;
    FOR_EACH_SUBRTX (iter, array, PATTERN (insn), NONCONST)for (subrtx_iterator iter (array, PATTERN (insn), rtx_nonconst_subrtx_bounds
); !iter.at_end (); iter.next ())
if (GET_CODE (*iter)((enum rtx_code) (*iter)->code) == EH_RETURN)
 return true;
  }
return false;
982}

984/* Return true if INSN is a jump that only transfers control and
 nothing more.  */

987int
988onlyjump_p (const rtx_insn *insn)
989{
rtx set;

if (!JUMP_P (insn)(((enum rtx_code) (insn)->code) == JUMP_INSN))
  return 0;

set = single_set (insn);
if (set == NULLnullptr)
  return 0;
if (GET_CODE (SET_DEST (set))((enum rtx_code) ((((set)->u.fld[0]).rt_rtx))->code) != PC)
  return 0;
if (side_effects_p (SET_SRC (set)(((set)->u.fld[1]).rt_rtx)))
  return 0;

return 1;
1004}

1006/* Return true iff INSN is a jump and its JUMP_LABEL is a label, not
 NULL or a return.  */
1008bool
1009jump_to_label_p (const rtx_insn *insn)
1010{
return (JUMP_P (insn)(((enum rtx_code) (insn)->code) == JUMP_INSN)
 && JUMP_LABEL (insn)(((insn)->u.fld[7]).rt_rtx) != NULLnullptr && !ANY_RETURN_P (JUMP_LABEL (insn))(((enum rtx_code) ((((insn)->u.fld[7]).rt_rtx))->code) ==
 RETURN || ((enum rtx_code) ((((insn)->u.fld[7]).rt_rtx))->
code) == SIMPLE_RETURN));
1013}
1014
1015/* Find all CODE_LABELs referred to in X, and increment their use
 counts.  If INSN is a JUMP_INSN and there is at least one
 CODE_LABEL referenced in INSN as a jump target, then store the last
 one in JUMP_LABEL (INSN).  For a tablejump, this must be the label
 for the ADDR_VEC.  Store any other jump targets as REG_LABEL_TARGET
 notes.  If INSN is an INSN or a CALL_INSN or non-target operands of
 a JUMP_INSN, and there is at least one CODE_LABEL referenced in
 INSN, add a REG_LABEL_OPERAND note containing that label to INSN.
 For returnjumps, the JUMP_LABEL will also be set as appropriate.

 Note that two labels separated by a loop-beginning note
 must be kept distinct if we have not yet done loop-optimization,
 because the gap between them is where loop-optimize
 will want to move invariant code to.  CROSS_JUMP tells us
 that loop-optimization is done with.  */

1031void
1032mark_jump_label (rtx x, rtx_insn *insn, int in_mem)
1033{
rtx asmop = extract_asm_operands (x);
if (asmop)
12
←
Assuming 'asmop' is null→
13
←
Taking false branch→
  mark_jump_label_asm (asmop, insn);
else
  mark_jump_label_1 (x, insn, in_mem != 0,
14
←
Calling 'mark_jump_label_1'→
       (insn != NULLnullptr && x == PATTERN (insn) && JUMP_P (insn)(((enum rtx_code) (insn)->code) == JUMP_INSN)));
1040}

1042/* Worker function for mark_jump_label.  IN_MEM is TRUE when X occurs
 within a (MEM ...).  IS_TARGET is TRUE when X is to be treated as a
 jump-target; when the JUMP_LABEL field of INSN should be set or a
 REG_LABEL_TARGET note should be added, not a REG_LABEL_OPERAND
 note.  */

1048static void
1049mark_jump_label_1 (rtx x, rtx_insn *insn, bool in_mem, bool is_target)
1050{
RTX_CODEenum rtx_code code = GET_CODE (x)((enum rtx_code) (x)->code);
int i;
const char *fmt;

switch (code)
15
←
Control jumps to 'case ADDR_VEC:'  at line 1150→
23
←
Control jumps to 'case ADDR_DIFF_VEC:'  at line 1151→
  {
  case PC:
  case REG:
  case CLOBBER:
  case CALL:
    return;

  case RETURN:
  case SIMPLE_RETURN:
    if (is_target)
{
 gcc_assert (JUMP_LABEL (insn) == NULL || JUMP_LABEL (insn) == x)((void)(!((((insn)->u.fld[7]).rt_rtx) == nullptr || (((insn
)->u.fld[7]).rt_rtx) == x) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 1067, __FUNCTION__), 0 : 0));
 JUMP_LABEL (insn)(((insn)->u.fld[7]).rt_rtx) = x;
}
    return;

  case MEM:
    in_mem = true;
    break;

  case SEQUENCE:
    {
rtx_sequence *seq = as_a <rtx_sequence *> (x);
for (i = 0; i < seq->len (); i++)
 mark_jump_label (PATTERN (seq->insn (i)),
	   seq->insn (i), 0);
    }
    return;

  case SYMBOL_REF:
    if (!in_mem)
return;

    /* If this is a constant-pool reference, see if it is a label.  */
    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/jump.cc"
, 1090, __FUNCTION__); _rtx; })->unchanging))
mark_jump_label_1 (get_pool_constant (x), insn, in_mem, is_target);
    break;

    /* Handle operands in the condition of an if-then-else as for a
non-jump insn.  */
  case IF_THEN_ELSE:
    if (!is_target)
break;
    mark_jump_label_1 (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx), insn, in_mem, false);
    mark_jump_label_1 (XEXP (x, 1)(((x)->u.fld[1]).rt_rtx), insn, in_mem, true);
    mark_jump_label_1 (XEXP (x, 2)(((x)->u.fld[2]).rt_rtx), insn, in_mem, true);
    return;

  case LABEL_REF:
    {
rtx_insn *label = label_ref_label (x);

/* Ignore remaining references to unreachable labels that
  have been deleted.  */
if (NOTE_P (label)(((enum rtx_code) (label)->code) == NOTE)
   && NOTE_KIND (label)(((label)->u.fld[4]).rt_int) == NOTE_INSN_DELETED_LABEL)
 break;

gcc_assert (LABEL_P (label))((void)(!((((enum rtx_code) (label)->code) == CODE_LABEL))
 ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 1114, __FUNCTION__), 0 : 0));

/* Ignore references to labels of containing functions.  */
if (LABEL_REF_NONLOCAL_P (x)(__extension__ ({ __typeof ((x)) const _rtx = ((x)); if (((enum
 rtx_code) (_rtx)->code) != LABEL_REF) rtl_check_failed_flag
 ("LABEL_REF_NONLOCAL_P", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 1117, __FUNCTION__); _rtx; })->volatil))
 break;

set_label_ref_label (x, label);
if (! insn || ! insn->deleted ())
 ++LABEL_NUSES (label)(((label)->u.fld[4]).rt_int);

if (insn)
 {
   if (is_target
/* Do not change a previous setting of JUMP_LABEL.  If the
   JUMP_LABEL slot is occupied by a different label,
   create a note for this label.  */
&& (JUMP_LABEL (insn)(((insn)->u.fld[7]).rt_rtx) == NULLnullptr || JUMP_LABEL (insn)(((insn)->u.fld[7]).rt_rtx) == label))
     JUMP_LABEL (insn)(((insn)->u.fld[7]).rt_rtx) = label;
   else
     {
enum reg_note kind
  = is_target ? REG_LABEL_TARGET : REG_LABEL_OPERAND;

/* Add a REG_LABEL_OPERAND or REG_LABEL_TARGET note
   for LABEL unless there already is one.  All uses of
   a label, except for the primary target of a jump,
   must have such a note.  */
if (! find_reg_note (insn, kind, label))
  add_reg_note (insn, kind, label);
     }
 }
return;
    }

  /* Do walk the labels in a vector, but not the first operand of an
     ADDR_DIFF_VEC.  Don't set the JUMP_LABEL of a vector.  */
  case ADDR_VEC:
  case ADDR_DIFF_VEC:
    if (! insn->deleted ())
16
←
Assuming the condition is true→
24
←
Called C++ object pointer is null
{
 int eltnum = code17.1
'code' is not equal to ADDR_DIFF_VEC
 == ADDR_DIFF_VEC ? 1 : 0;
17
←
Taking true branch→
18
←
'?' condition is false→

 for (i = 0; i < XVECLEN (x, eltnum)(((((x)->u.fld[eltnum]).rt_rtvec))->num_elem); i++)
19
←
Assuming 'i' is < field 'num_elem'→
20
←
Loop condition is true.  Entering loop body→
   mark_jump_label_1 (XVECEXP (x, eltnum, i)(((((x)->u.fld[eltnum]).rt_rtvec))->elem[i]), NULLnullptr, in_mem,
21
←
Passing null pointer value via 2nd parameter 'insn'→
22
←
Calling 'mark_jump_label_1'→
	       is_target);
}
    return;

  default:
    break;
  }

fmt = GET_RTX_FORMAT (code)(rtx_format[(int) (code)]);

/* The primary target of a tablejump is the label of the ADDR_VEC,
   which is canonically mentioned *last* in the insn.  To get it
   marked as JUMP_LABEL, we iterate over items in reverse order.  */
for (i = GET_RTX_LENGTH (code)(rtx_length[(int) (code)]) - 1; i >= 0; i--)
  {
    if (fmt[i] == 'e')
mark_jump_label_1 (XEXP (x, i)(((x)->u.fld[i]).rt_rtx), insn, in_mem, is_target);
    else if (fmt[i] == 'E')
{
 int j;

 for (j = XVECLEN (x, i)(((((x)->u.fld[i]).rt_rtvec))->num_elem) - 1; j >= 0; j--)
   mark_jump_label_1 (XVECEXP (x, i, j)(((((x)->u.fld[i]).rt_rtvec))->elem[j]), insn, in_mem,
	       is_target);
}
  }
1184}

1186/* Worker function for mark_jump_label.  Handle asm insns specially.
 In particular, output operands need not be considered so we can
 avoid re-scanning the replicated asm_operand.  Also, the asm_labels
 need to be considered targets.  */

1191static void
1192mark_jump_label_asm (rtx asmop, rtx_insn *insn)
1193{
int i;

for (i = ASM_OPERANDS_INPUT_LENGTH (asmop)(((((asmop)->u.fld[3]).rt_rtvec))->num_elem) - 1; i >= 0; --i)
  mark_jump_label_1 (ASM_OPERANDS_INPUT (asmop, i)(((((asmop)->u.fld[3]).rt_rtvec))->elem[i]), insn, false, false);

for (i = ASM_OPERANDS_LABEL_LENGTH (asmop)(((((asmop)->u.fld[5]).rt_rtvec))->num_elem) - 1; i >= 0; --i)
  mark_jump_label_1 (ASM_OPERANDS_LABEL (asmop, i)(((((asmop)->u.fld[5]).rt_rtvec))->elem[i]), insn, false, true);
1201}
1202
1203/* Delete insn INSN from the chain of insns and update label ref counts
 and delete insns now unreachable.

 Returns the first insn after INSN that was not deleted.

 Usage of this instruction is deprecated.  Use delete_insn instead and
 subsequent cfg_cleanup pass to delete unreachable code if needed.  */

1211rtx_insn *
1212delete_related_insns (rtx uncast_insn)
1213{
rtx_insn *insn = as_a <rtx_insn *> (uncast_insn);
int was_code_label = (LABEL_P (insn)(((enum rtx_code) (insn)->code) == CODE_LABEL));
rtx note;
rtx_insn *next = NEXT_INSN (insn), *prev = PREV_INSN (insn);

while (next && next->deleted ())
  next = NEXT_INSN (next);

/* This insn is already deleted => return first following nondeleted.  */
if (insn->deleted ())
  return next;

delete_insn (insn);

/* If instruction is followed by a barrier,
   delete the barrier too.  */

if (next != 0 && BARRIER_P (next)(((enum rtx_code) (next)->code) == BARRIER))
  delete_insn (next);

/* If deleting a jump, decrement the count of the label,
   and delete the label if it is now unused.  */

if (jump_to_label_p (insn))
  {
    rtx lab = JUMP_LABEL (insn)(((insn)->u.fld[7]).rt_rtx);
    rtx_jump_table_data *lab_next;

    if (LABEL_NUSES (lab)(((lab)->u.fld[4]).rt_int) == 0)
/* This can delete NEXT or PREV,
  either directly if NEXT is JUMP_LABEL (INSN),
  or indirectly through more levels of jumps.  */
delete_related_insns (lab);
    else if (tablejump_p (insn, NULLnullptr, &lab_next))
{
 /* If we're deleting the tablejump, delete the dispatch table.
    We may not be able to kill the label immediately preceding
    just yet, as it might be referenced in code leading up to
    the tablejump.  */
 delete_related_insns (lab_next);
}
  }

/* Likewise if we're deleting a dispatch table.  */

if (rtx_jump_table_data *table = dyn_cast <rtx_jump_table_data *> (insn))
  {
    rtvec labels = table->get_labels ();
    int i;
    int len = GET_NUM_ELEM (labels)((labels)->num_elem);

    for (i = 0; i < len; i++)
if (LABEL_NUSES (XEXP (RTVEC_ELT (labels, i), 0))((((((((labels)->elem[i]))->u.fld[0]).rt_rtx))->u.fld
[4]).rt_int) == 0)
 delete_related_insns (XEXP (RTVEC_ELT (labels, i), 0)(((((labels)->elem[i]))->u.fld[0]).rt_rtx));
    while (next && next->deleted ())
next = NEXT_INSN (next);
    return next;
  }

/* Likewise for any JUMP_P / INSN / CALL_INSN with a
   REG_LABEL_OPERAND or REG_LABEL_TARGET note.  */
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)))
  for (note = REG_NOTES (insn)(((insn)->u.fld[6]).rt_rtx); note; note = XEXP (note, 1)(((note)->u.fld[1]).rt_rtx))
    if ((REG_NOTE_KIND (note)((enum reg_note) ((machine_mode) (note)->mode)) == REG_LABEL_OPERAND
  || REG_NOTE_KIND (note)((enum reg_note) ((machine_mode) (note)->mode)) == REG_LABEL_TARGET)
 /* This could also be a NOTE_INSN_DELETED_LABEL note.  */
 && LABEL_P (XEXP (note, 0))(((enum rtx_code) ((((note)->u.fld[0]).rt_rtx))->code) ==
 CODE_LABEL))
if (LABEL_NUSES (XEXP (note, 0))((((((note)->u.fld[0]).rt_rtx))->u.fld[4]).rt_int) == 0)
 delete_related_insns (XEXP (note, 0)(((note)->u.fld[0]).rt_rtx));

while (prev && (prev->deleted () || NOTE_P (prev)(((enum rtx_code) (prev)->code) == NOTE)))
  prev = PREV_INSN (prev);

/* If INSN was a label and a dispatch table follows it,
   delete the dispatch table.  The tablejump must have gone already.
   It isn't useful to fall through into a table.  */

if (was_code_label
    && NEXT_INSN (insn) != 0
    && JUMP_TABLE_DATA_P (NEXT_INSN (insn))(((enum rtx_code) (NEXT_INSN (insn))->code) == JUMP_TABLE_DATA
))
  next = delete_related_insns (NEXT_INSN (insn));

/* If INSN was a label, delete insns following it if now unreachable.  */

if (was_code_label && prev && BARRIER_P (prev)(((enum rtx_code) (prev)->code) == BARRIER))
  {
    enum rtx_code code;
    while (next)
{
 code = GET_CODE (next)((enum rtx_code) (next)->code);
 if (code == NOTE)
   next = NEXT_INSN (next);
 /* Keep going past other deleted labels to delete what follows.  */
 else if (code == CODE_LABEL && next->deleted ())
   next = NEXT_INSN (next);
 /* Keep the (use (insn))s created by dbr_schedule, which needs
    them in order to track liveness relative to a previous
    barrier.  */
 else if (INSN_P (next)(((((enum rtx_code) (next)->code) == INSN) || (((enum rtx_code
) (next)->code) == JUMP_INSN) || (((enum rtx_code) (next)->
code) == CALL_INSN)) || (((enum rtx_code) (next)->code) ==
 DEBUG_INSN))
   && GET_CODE (PATTERN (next))((enum rtx_code) (PATTERN (next))->code) == USE
   && INSN_P (XEXP (PATTERN (next), 0))(((((enum rtx_code) ((((PATTERN (next))->u.fld[0]).rt_rtx)
)->code) == INSN) || (((enum rtx_code) ((((PATTERN (next))
->u.fld[0]).rt_rtx))->code) == JUMP_INSN) || (((enum rtx_code
) ((((PATTERN (next))->u.fld[0]).rt_rtx))->code) == CALL_INSN
)) || (((enum rtx_code) ((((PATTERN (next))->u.fld[0]).rt_rtx
))->code) == DEBUG_INSN)))
   next = NEXT_INSN (next);
 else if (code == BARRIER || INSN_P (next)(((((enum rtx_code) (next)->code) == INSN) || (((enum rtx_code
) (next)->code) == JUMP_INSN) || (((enum rtx_code) (next)->
code) == CALL_INSN)) || (((enum rtx_code) (next)->code) ==
 DEBUG_INSN)))
   /* Note: if this deletes a jump, it can cause more
      deletion of unreachable code, after a different label.
      As long as the value from this recursive call is correct,
      this invocation functions correctly.  */
   next = delete_related_insns (next);
 else
   break;
}
  }

/* I feel a little doubtful about this loop,
   but I see no clean and sure alternative way
   to find the first insn after INSN that is not now deleted.
   I hope this works.  */
while (next && next->deleted ())
  next = NEXT_INSN (next);
return next;
1334}
1335
1336/* Delete a range of insns from FROM to TO, inclusive.
 This is for the sake of peephole optimization, so assume
 that whatever these insns do will still be done by a new
 peephole insn that will replace them.  */

1341void
1342delete_for_peephole (rtx_insn *from, rtx_insn *to)
1343{
rtx_insn *insn = from;

while (1)
  {
    rtx_insn *next = NEXT_INSN (insn);
    rtx_insn *prev = PREV_INSN (insn);

    if (!NOTE_P (insn)(((enum rtx_code) (insn)->code) == NOTE))
{
 insn->set_deleted();

 /* Patch this insn out of the chain.  */
 /* We don't do this all at once, because we
    must preserve all NOTEs.  */
 if (prev)
   SET_NEXT_INSN (prev) = next;

 if (next)
   SET_PREV_INSN (next) = prev;
}

    if (insn == to)
break;
    insn = next;
  }

/* Note that if TO is an unconditional jump
   we *do not* delete the BARRIER that follows,
   since the peephole that replaces this sequence
   is also an unconditional jump in that case.  */
1374}
1375
1376/* A helper function for redirect_exp_1; examines its input X and returns
 either a LABEL_REF around a label, or a RETURN if X was NULL.  */
1378static rtx
1379redirect_target (rtx x)
1380{
if (x == NULL_RTX(rtx) 0)
  return ret_rtx;
if (!ANY_RETURN_P (x)(((enum rtx_code) (x)->code) == RETURN || ((enum rtx_code)
 (x)->code) == SIMPLE_RETURN))
  return gen_rtx_LABEL_REF (Pmode, x)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))
))), ((x)) );
return x;
1386}

1388/* Throughout LOC, redirect OLABEL to NLABEL.  Treat null OLABEL or
 NLABEL as a return.  Accrue modifications into the change group.  */

1391static void
1392redirect_exp_1 (rtx *loc, rtx olabel, rtx nlabel, rtx_insn *insn)
1393{
rtx x = *loc;
RTX_CODEenum rtx_code code = GET_CODE (x)((enum rtx_code) (x)->code);
int i;
const char *fmt;

if ((code == LABEL_REF && label_ref_label (x) == olabel)
    || x == olabel)
  {
    x = redirect_target (nlabel);
    if (GET_CODE (x)((enum rtx_code) (x)->code) == LABEL_REF && loc == &PATTERN (insn))
x = gen_rtx_SET (pc_rtx, x)gen_rtx_fmt_ee_stat ((SET), (((void) 0, E_VOIDmode)), ((pc_rtx
)), ((x)) );
    validate_change (insn, loc, x, 1);
    return;
  }

if (code == SET && SET_DEST (x)(((x)->u.fld[0]).rt_rtx) == pc_rtx
    && ANY_RETURN_P (nlabel)(((enum rtx_code) (nlabel)->code) == RETURN || ((enum rtx_code
) (nlabel)->code) == SIMPLE_RETURN)
    && GET_CODE (SET_SRC (x))((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) == LABEL_REF
    && label_ref_label (SET_SRC (x)(((x)->u.fld[1]).rt_rtx)) == olabel)
  {
    validate_change (insn, loc, nlabel, 1);
    return;
  }

if (code == IF_THEN_ELSE)
  {
    /* Skip the condition of an IF_THEN_ELSE.  We only want to
       change jump destinations, not eventual label comparisons.  */
    redirect_exp_1 (&XEXP (x, 1)(((x)->u.fld[1]).rt_rtx), olabel, nlabel, insn);
    redirect_exp_1 (&XEXP (x, 2)(((x)->u.fld[2]).rt_rtx), olabel, nlabel, insn);
    return;
  }

fmt = GET_RTX_FORMAT (code)(rtx_format[(int) (code)]);
for (i = GET_RTX_LENGTH (code)(rtx_length[(int) (code)]) - 1; i >= 0; i--)
  {
    if (fmt[i] == 'e')
redirect_exp_1 (&XEXP (x, i)(((x)->u.fld[i]).rt_rtx), olabel, nlabel, insn);
    else if (fmt[i] == 'E')
{
 int j;
 for (j = 0; j < XVECLEN (x, i)(((((x)->u.fld[i]).rt_rtvec))->num_elem); j++)
   redirect_exp_1 (&XVECEXP (x, i, j)(((((x)->u.fld[i]).rt_rtvec))->elem[j]), olabel, nlabel, insn);
}
  }
1439}

1441/* Make JUMP go to NLABEL instead of where it jumps now.  Accrue
 the modifications into the change group.  Return false if we did
 not see how to do that.  */

1445int
1446redirect_jump_1 (rtx_insn *jump, rtx nlabel)
1447{
int ochanges = num_validated_changes ();
rtx *loc, asmop;

gcc_assert (nlabel != NULL_RTX)((void)(!(nlabel != (rtx) 0) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 1451, __FUNCTION__), 0 : 0));
asmop = extract_asm_operands (PATTERN (jump));
if (asmop)
  {
    if (nlabel == NULLnullptr)
return 0;
    gcc_assert (ASM_OPERANDS_LABEL_LENGTH (asmop) == 1)((void)(!((((((asmop)->u.fld[5]).rt_rtvec))->num_elem) ==
 1) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 1457, __FUNCTION__), 0 : 0));
    loc = &ASM_OPERANDS_LABEL (asmop, 0)(((((asmop)->u.fld[5]).rt_rtvec))->elem[0]);
  }
else if (GET_CODE (PATTERN (jump))((enum rtx_code) (PATTERN (jump))->code) == PARALLEL)
  loc = &XVECEXP (PATTERN (jump), 0, 0)(((((PATTERN (jump))->u.fld[0]).rt_rtvec))->elem[0]);
else
  loc = &PATTERN (jump);

redirect_exp_1 (loc, JUMP_LABEL (jump)(((jump)->u.fld[7]).rt_rtx), nlabel, jump);
return num_validated_changes () > ochanges;
1467}

1469/* Make JUMP go to NLABEL instead of where it jumps now.  If the old
 jump target label is unused as a result, it and the code following
 it may be deleted.

 Normally, NLABEL will be a label, but it may also be a RETURN rtx;
 in that case we are to turn the jump into a (possibly conditional)
 return insn.

 The return value will be 1 if the change was made, 0 if it wasn't
 (this can only occur when trying to produce return insns).  */

1480int
1481redirect_jump (rtx_jump_insn *jump, rtx nlabel, int delete_unused)
1482{
rtx olabel = jump->jump_label ();

if (!nlabel)
  {
    /* If there is no label, we are asked to redirect to the EXIT block.
When before the epilogue is emitted, return/simple_return cannot be
created so we return 0 immediately.  After the epilogue is emitted,
we always expect a label, either a non-null label, or a
return/simple_return RTX.  */

    if (!epilogue_completed)
return 0;
    gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 1495, __FUNCTION__));
  }

if (nlabel == olabel)
  return 1;

if (! redirect_jump_1 (jump, nlabel) || ! apply_change_group ())
  return 0;

redirect_jump_2 (jump, olabel, nlabel, delete_unused, 0);
return 1;
1506}

1508/* Fix up JUMP_LABEL and label ref counts after OLABEL has been replaced with
 NLABEL in JUMP.
 If DELETE_UNUSED is positive, delete related insn to OLABEL if its ref
 count has dropped to zero.  */
1512void
1513redirect_jump_2 (rtx_jump_insn *jump, rtx olabel, rtx nlabel, int delete_unused,
 int invert)
1515{
rtx note;

gcc_assert (JUMP_LABEL (jump) == olabel)((void)(!((((jump)->u.fld[7]).rt_rtx) == olabel) ? fancy_abort
 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 1518, __FUNCTION__), 0 : 0));

/* Negative DELETE_UNUSED used to be used to signalize behavior on
   moving FUNCTION_END note.  Just sanity check that no user still worry
   about this.  */
gcc_assert (delete_unused >= 0)((void)(!(delete_unused >= 0) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 1523, __FUNCTION__), 0 : 0));
JUMP_LABEL (jump)(((jump)->u.fld[7]).rt_rtx) = nlabel;
if (!ANY_RETURN_P (nlabel)(((enum rtx_code) (nlabel)->code) == RETURN || ((enum rtx_code
) (nlabel)->code) == SIMPLE_RETURN))
  ++LABEL_NUSES (nlabel)(((nlabel)->u.fld[4]).rt_int);

/* Update labels in any REG_EQUAL note.  */
if ((note = find_reg_note (jump, REG_EQUAL, NULL_RTX(rtx) 0)) != NULL_RTX(rtx) 0)
  {
    if (ANY_RETURN_P (nlabel)(((enum rtx_code) (nlabel)->code) == RETURN || ((enum rtx_code
) (nlabel)->code) == SIMPLE_RETURN)
 || (invert && !invert_exp_1 (XEXP (note, 0)(((note)->u.fld[0]).rt_rtx), jump)))
remove_note (jump, note);
    else
{
 redirect_exp_1 (&XEXP (note, 0)(((note)->u.fld[0]).rt_rtx), olabel, nlabel, jump);
 confirm_change_group ();
}
  }

/* Handle the case where we had a conditional crossing jump to a return
   label and are now changing it into a direct conditional return.
   The jump is no longer crossing in that case.  */
if (ANY_RETURN_P (nlabel)(((enum rtx_code) (nlabel)->code) == RETURN || ((enum rtx_code
) (nlabel)->code) == SIMPLE_RETURN))
  CROSSING_JUMP_P (jump)(__extension__ ({ __typeof ((jump)) const _rtx = ((jump)); if
 (((enum rtx_code) (_rtx)->code) != JUMP_INSN) rtl_check_failed_flag
 ("CROSSING_JUMP_P", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 1545, __FUNCTION__); _rtx; })->jump) = 0;

if (!ANY_RETURN_P (olabel)(((enum rtx_code) (olabel)->code) == RETURN || ((enum rtx_code
) (olabel)->code) == SIMPLE_RETURN)
    && --LABEL_NUSES (olabel)(((olabel)->u.fld[4]).rt_int) == 0 && delete_unused > 0
    /* Undefined labels will remain outside the insn stream.  */
    && INSN_UID (olabel))
  delete_related_insns (olabel);
if (invert)
  invert_br_probabilities (jump);
1554}

1556/* Invert the jump condition X contained in jump insn INSN.  Accrue the
 modifications into the change group.  Return nonzero for success.  */
1558static int
1559invert_exp_1 (rtx x, rtx_insn *insn)
1560{
RTX_CODEenum rtx_code code = GET_CODE (x)((enum rtx_code) (x)->code);

if (code == IF_THEN_ELSE)
  {
    rtx comp = XEXP (x, 0)(((x)->u.fld[0]).rt_rtx);
    rtx tem;
    enum rtx_code reversed_code;

    /* We can do this in two ways:  The preferable way, which can only
be done if this is not an integer comparison, is to reverse
the comparison code.  Otherwise, swap the THEN-part and ELSE-part
of the IF_THEN_ELSE.  If we can't do either, fail.  */

    reversed_code = reversed_comparison_code (comp, insn);

    if (reversed_code != UNKNOWN)
{
 validate_change (insn, &XEXP (x, 0)(((x)->u.fld[0]).rt_rtx),
	   gen_rtx_fmt_ee (reversed_code,gen_rtx_fmt_ee_stat ((reversed_code), (((machine_mode) (comp)
->mode)), ((((comp)->u.fld[0]).rt_rtx)), ((((comp)->
u.fld[1]).rt_rtx)) )
			   GET_MODE (comp), XEXP (comp, 0),gen_rtx_fmt_ee_stat ((reversed_code), (((machine_mode) (comp)
->mode)), ((((comp)->u.fld[0]).rt_rtx)), ((((comp)->
u.fld[1]).rt_rtx)) )
			   XEXP (comp, 1))gen_rtx_fmt_ee_stat ((reversed_code), (((machine_mode) (comp)
->mode)), ((((comp)->u.fld[0]).rt_rtx)), ((((comp)->
u.fld[1]).rt_rtx)) ),
	   1);
 return 1;
}

    tem = XEXP (x, 1)(((x)->u.fld[1]).rt_rtx);
    validate_change (insn, &XEXP (x, 1)(((x)->u.fld[1]).rt_rtx), XEXP (x, 2)(((x)->u.fld[2]).rt_rtx), 1);
    validate_change (insn, &XEXP (x, 2)(((x)->u.fld[2]).rt_rtx), tem, 1);
    return 1;
  }
else
  return 0;
1593}

1595/* Invert the condition of the jump JUMP, and make it jump to label
 NLABEL instead of where it jumps now.  Accrue changes into the
 change group.  Return false if we didn't see how to perform the
 inversion and redirection.  */

1600int
1601invert_jump_1 (rtx_jump_insn *jump, rtx nlabel)
1602{
rtx x = pc_set (jump);
int ochanges;
int ok;

ochanges = num_validated_changes ();
if (x == NULLnullptr)
  return 0;
ok = invert_exp_1 (SET_SRC (x)(((x)->u.fld[1]).rt_rtx), jump);
gcc_assert (ok)((void)(!(ok) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 1611, __FUNCTION__), 0 : 0));

if (num_validated_changes () == ochanges)
  return 0;

/* redirect_jump_1 will fail of nlabel == olabel, and the current use is
   in Pmode, so checking this is not merely an optimization.  */
return nlabel == JUMP_LABEL (jump)(((jump)->u.fld[7]).rt_rtx) || redirect_jump_1 (jump, nlabel);
1619}

1621/* Invert the condition of the jump JUMP, and make it jump to label
 NLABEL instead of where it jumps now.  Return true if successful.  */

1624int
1625invert_jump (rtx_jump_insn *jump, rtx nlabel, int delete_unused)
1626{
rtx olabel = JUMP_LABEL (jump)(((jump)->u.fld[7]).rt_rtx);

if (invert_jump_1 (jump, nlabel) && apply_change_group ())
  {
    redirect_jump_2 (jump, olabel, nlabel, delete_unused, 1);
    return 1;
  }
cancel_changes (0);
return 0;
1636}

1638
1639/* Like rtx_equal_p except that it considers two REGs as equal
 if they renumber to the same value and considers two commutative
 operations to be the same if the order of the operands has been
 reversed.  */

1644int
1645rtx_renumbered_equal_p (const_rtx x, const_rtx y)
1646{
int i;
const enum rtx_code code = GET_CODE (x)((enum rtx_code) (x)->code);
const char *fmt;

if (x == y)
  return 1;

if ((code == REG || (code == SUBREG && REG_P (SUBREG_REG (x))(((enum rtx_code) ((((x)->u.fld[0]).rt_rtx))->code) == REG
)))
    && (REG_P (y)(((enum rtx_code) (y)->code) == REG) || (GET_CODE (y)((enum rtx_code) (y)->code) == SUBREG
		  && REG_P (SUBREG_REG (y))(((enum rtx_code) ((((y)->u.fld[0]).rt_rtx))->code) == REG
))))
  {
    int reg_x = -1, reg_y = -1;
    poly_int64 byte_x = 0, byte_y = 0;
    struct subreg_info info;

    if (GET_MODE (x)((machine_mode) (x)->mode) != GET_MODE (y)((machine_mode) (y)->mode))
return 0;

    /* If we haven't done any renumbering, don't
make any assumptions.  */
    if (reg_renumber == 0)
return rtx_equal_p (x, y);

    if (code == SUBREG)
{
 reg_x = REGNO (SUBREG_REG (x))(rhs_regno((((x)->u.fld[0]).rt_rtx)));
 byte_x = SUBREG_BYTE (x)(((x)->u.fld[1]).rt_subreg);

 if (reg_renumber[reg_x] >= 0)
   {
     subreg_get_info (reg_renumber[reg_x],
	       GET_MODE (SUBREG_REG (x))((machine_mode) ((((x)->u.fld[0]).rt_rtx))->mode), byte_x,
	       GET_MODE (x)((machine_mode) (x)->mode), &info);
     if (!info.representable_p)
return 0;
     reg_x = info.offset;
     byte_x = 0;
   }
}
    else
{
 reg_x = REGNO (x)(rhs_regno(x));
 if (reg_renumber[reg_x] >= 0)
   reg_x = reg_renumber[reg_x];
}

    if (GET_CODE (y)((enum rtx_code) (y)->code) == SUBREG)
{
 reg_y = REGNO (SUBREG_REG (y))(rhs_regno((((y)->u.fld[0]).rt_rtx)));
 byte_y = SUBREG_BYTE (y)(((y)->u.fld[1]).rt_subreg);

 if (reg_renumber[reg_y] >= 0)
   {
     subreg_get_info (reg_renumber[reg_y],
	       GET_MODE (SUBREG_REG (y))((machine_mode) ((((y)->u.fld[0]).rt_rtx))->mode), byte_y,
	       GET_MODE (y)((machine_mode) (y)->mode), &info);
     if (!info.representable_p)
return 0;
     reg_y = info.offset;
     byte_y = 0;
   }
}
    else
{
 reg_y = REGNO (y)(rhs_regno(y));
 if (reg_renumber[reg_y] >= 0)
   reg_y = reg_renumber[reg_y];
}

    return reg_x >= 0 && reg_x == reg_y && known_eq (byte_x, byte_y)(!maybe_ne (byte_x, byte_y));
  }

/* Now we have disposed of all the cases
   in which different rtx codes can match.  */
if (code != GET_CODE (y)((enum rtx_code) (y)->code))
  return 0;

switch (code)
  {
  case PC:
  case ADDR_VEC:
  case ADDR_DIFF_VEC:
  CASE_CONST_UNIQUEcase CONST_INT: case CONST_WIDE_INT: case CONST_POLY_INT: case
 CONST_DOUBLE: case CONST_FIXED:
    return 0;

  case CONST_VECTOR:
    if (!same_vector_encodings_p (x, y))
return false;
    break;

  case LABEL_REF:
    /* We can't assume nonlocal labels have their following insns yet.  */
    if (LABEL_REF_NONLOCAL_P (x)(__extension__ ({ __typeof ((x)) const _rtx = ((x)); if (((enum
 rtx_code) (_rtx)->code) != LABEL_REF) rtl_check_failed_flag
 ("LABEL_REF_NONLOCAL_P", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 1739, __FUNCTION__); _rtx; })->volatil) || LABEL_REF_NONLOCAL_P (y)(__extension__ ({ __typeof ((y)) const _rtx = ((y)); if (((enum
 rtx_code) (_rtx)->code) != LABEL_REF) rtl_check_failed_flag
 ("LABEL_REF_NONLOCAL_P", _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 1739, __FUNCTION__); _rtx; })->volatil))
return label_ref_label (x) == label_ref_label (y);

    /* Two label-refs are equivalent if they point at labels
in the same position in the instruction stream.  */
    else
{
 rtx_insn *xi = next_nonnote_nondebug_insn (label_ref_label (x));
 rtx_insn *yi = next_nonnote_nondebug_insn (label_ref_label (y));
 while (xi && LABEL_P (xi)(((enum rtx_code) (xi)->code) == CODE_LABEL))
   xi = next_nonnote_nondebug_insn (xi);
 while (yi && LABEL_P (yi)(((enum rtx_code) (yi)->code) == CODE_LABEL))
   yi = next_nonnote_nondebug_insn (yi);
 return xi == yi;
}

  case SYMBOL_REF:
    return XSTR (x, 0)(((x)->u.fld[0]).rt_str) == XSTR (y, 0)(((y)->u.fld[0]).rt_str);

  case CODE_LABEL:
    /* If we didn't match EQ equality above, they aren't the same.  */
    return 0;

  default:
    break;
  }

/* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent.  */

if (GET_MODE (x)((machine_mode) (x)->mode) != GET_MODE (y)((machine_mode) (y)->mode))
  return 0;

/* MEMs referring to different address space are not equivalent.  */
if (code == MEM && MEM_ADDR_SPACE (x)(get_mem_attrs (x)->addrspace) != MEM_ADDR_SPACE (y)(get_mem_attrs (y)->addrspace))
  return 0;

/* For commutative operations, the RTX match if the operand match in any
   order.  Also handle the simple binary and unary cases without a loop.  */
if (targetm.commutative_p (x, UNKNOWN))
  return ((rtx_renumbered_equal_p (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx), XEXP (y, 0)(((y)->u.fld[0]).rt_rtx))
    && rtx_renumbered_equal_p (XEXP (x, 1)(((x)->u.fld[1]).rt_rtx), XEXP (y, 1)(((y)->u.fld[1]).rt_rtx)))
   || (rtx_renumbered_equal_p (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx), XEXP (y, 1)(((y)->u.fld[1]).rt_rtx))
&& rtx_renumbered_equal_p (XEXP (x, 1)(((x)->u.fld[1]).rt_rtx), XEXP (y, 0)(((y)->u.fld[0]).rt_rtx))));
else if (NON_COMMUTATIVE_P (x)(((rtx_class[(int) (((enum rtx_code) (x)->code))]) & (
~2)) == (RTX_COMPARE & (~2))))
  return (rtx_renumbered_equal_p (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx), XEXP (y, 0)(((y)->u.fld[0]).rt_rtx))
   && rtx_renumbered_equal_p (XEXP (x, 1)(((x)->u.fld[1]).rt_rtx), XEXP (y, 1)(((y)->u.fld[1]).rt_rtx)));
else if (UNARY_P (x)((rtx_class[(int) (((enum rtx_code) (x)->code))]) == RTX_UNARY
))
  return rtx_renumbered_equal_p (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx), XEXP (y, 0)(((y)->u.fld[0]).rt_rtx));

/* Compare the elements.  If any pair of corresponding elements
   fail to match, return 0 for the whole things.  */

fmt = GET_RTX_FORMAT (code)(rtx_format[(int) (code)]);
for (i = GET_RTX_LENGTH (code)(rtx_length[(int) (code)]) - 1; i >= 0; i--)
  {
    int j;
    switch (fmt[i])
{
case 'w':
 if (XWINT (x, i)((x)->u.hwint[i]) != XWINT (y, i)((y)->u.hwint[i]))
   return 0;
 break;

case 'i':
 if (XINT (x, i)(((x)->u.fld[i]).rt_int) != XINT (y, i)(((y)->u.fld[i]).rt_int))
   {
     if (((code == ASM_OPERANDS && i == 6)
   || (code == ASM_INPUT && i == 1)))
break;
     return 0;
   }
 break;

case 'p':
 if (maybe_ne (SUBREG_BYTE (x)(((x)->u.fld[1]).rt_subreg), SUBREG_BYTE (y)(((y)->u.fld[1]).rt_subreg)))
   return 0;
 break;

case 't':
 if (XTREE (x, i)(((x)->u.fld[i]).rt_tree) != XTREE (y, i)(((y)->u.fld[i]).rt_tree))
   return 0;
 break;

case 's':
 if (strcmp (XSTR (x, i)(((x)->u.fld[i]).rt_str), XSTR (y, i)(((y)->u.fld[i]).rt_str)))
   return 0;
 break;

case 'e':
 if (! rtx_renumbered_equal_p (XEXP (x, i)(((x)->u.fld[i]).rt_rtx), XEXP (y, i)(((y)->u.fld[i]).rt_rtx)))
   return 0;
 break;

case 'u':
 if (XEXP (x, i)(((x)->u.fld[i]).rt_rtx) != XEXP (y, i)(((y)->u.fld[i]).rt_rtx))
   return 0;
 /* Fall through.  */
case '0':
 break;

case 'E':
 if (XVECLEN (x, i)(((((x)->u.fld[i]).rt_rtvec))->num_elem) != XVECLEN (y, i)(((((y)->u.fld[i]).rt_rtvec))->num_elem))
   return 0;
 for (j = XVECLEN (x, i)(((((x)->u.fld[i]).rt_rtvec))->num_elem) - 1; j >= 0; j--)
   if (!rtx_renumbered_equal_p (XVECEXP (x, i, j)(((((x)->u.fld[i]).rt_rtvec))->elem[j]), XVECEXP (y, i, j)(((((y)->u.fld[i]).rt_rtvec))->elem[j])))
     return 0;
 break;

default:
 gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 1848, __FUNCTION__));
}
  }
return 1;
1852}
1853
1854/* If X is a hard register or equivalent to one or a subregister of one,
 return the hard register number.  If X is a pseudo register that was not
 assigned a hard register, return the pseudo register number.  Otherwise,
 return -1.  Any rtx is valid for X.  */

1859int
1860true_regnum (const_rtx x)
1861{
if (REG_P (x)(((enum rtx_code) (x)->code) == REG))
  {
    if (REGNO (x)(rhs_regno(x)) >= FIRST_PSEUDO_REGISTER76
 && (lra_in_progress || reg_renumber[REGNO (x)(rhs_regno(x))] >= 0))
return reg_renumber[REGNO (x)(rhs_regno(x))];
    return REGNO (x)(rhs_regno(x));
  }
if (GET_CODE (x)((enum rtx_code) (x)->code) == SUBREG)
  {
    int base = true_regnum (SUBREG_REG (x)(((x)->u.fld[0]).rt_rtx));
    if (base >= 0
 && base < FIRST_PSEUDO_REGISTER76)
{
 struct subreg_info info;

 subreg_get_info (lra_in_progress
	   ? (unsigned) base : REGNO (SUBREG_REG (x))(rhs_regno((((x)->u.fld[0]).rt_rtx))),
	   GET_MODE (SUBREG_REG (x))((machine_mode) ((((x)->u.fld[0]).rt_rtx))->mode),
	   SUBREG_BYTE (x)(((x)->u.fld[1]).rt_subreg), GET_MODE (x)((machine_mode) (x)->mode), &info);

 if (info.representable_p)
   return base + info.offset;
}
  }
return -1;
1887}

1889/* Return regno of the register REG and handle subregs too.  */
1890unsigned int
1891reg_or_subregno (const_rtx reg)
1892{
if (GET_CODE (reg)((enum rtx_code) (reg)->code) == SUBREG)
  reg = SUBREG_REG (reg)(((reg)->u.fld[0]).rt_rtx);
gcc_assert (REG_P (reg))((void)(!((((enum rtx_code) (reg)->code) == REG)) ? fancy_abort
 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/jump.cc"
, 1895, __FUNCTION__), 0 : 0));
return REGNO (reg)(rhs_regno(reg));
1897}