/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc

Bug Summary

File:	build/gcc/tree-if-conv.cc
Warning:	line 2004, column 10 8th function call argument is an uninitialized value
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 tree-if-conv.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-zinhZT.plist -x c++ /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc
1/* If-conversion for vectorizer.
 Copyright (C) 2004-2023 Free Software Foundation, Inc.
 Contributed by Devang Patel <dpatel@apple.com>

5This file is part of GCC.

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.

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.

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/>.  */

21/* This pass implements a tree level if-conversion of loops.  Its
 initial goal is to help the vectorizer to vectorize loops with
 conditions.

 A short description of if-conversion:

   o Decide if a loop is if-convertible or not.
   o Walk all loop basic blocks in breadth first order (BFS order).
     o Remove conditional statements (at the end of basic block)
       and propagate condition into destination basic blocks'
predicate list.
     o Replace modify expression with conditional modify expression
       using current basic block's condition.
   o Merge all basic blocks
     o Replace phi nodes with conditional modify expr
     o Merge all basic blocks into header

   Sample transformation:

   INPUT
   -----

   # i_23 = PHI <0(0), i_18(10)>;
   <L0>:;
   j_15 = A[i_23];
   if (j_15 > 41) goto <L1>; else goto <L17>;

   <L17>:;
   goto <bb 3> (<L3>);

   <L1>:;

   # iftmp.2_4 = PHI <0(8), 42(2)>;
   <L3>:;
   A[i_23] = iftmp.2_4;
   i_18 = i_23 + 1;
   if (i_18 <= 15) goto <L19>; else goto <L18>;

   <L19>:;
   goto <bb 1> (<L0>);

   <L18>:;

   OUTPUT
   ------

   # i_23 = PHI <0(0), i_18(10)>;
   <L0>:;
   j_15 = A[i_23];

   <L3>:;
   iftmp.2_4 = j_15 > 41 ? 42 : 0;
   A[i_23] = iftmp.2_4;
   i_18 = i_23 + 1;
   if (i_18 <= 15) goto <L19>; else goto <L18>;

   <L19>:;
   goto <bb 1> (<L0>);

   <L18>:;
81*/

83#include "config.h"
84#include "system.h"
85#include "coretypes.h"
86#include "backend.h"
87#include "rtl.h"
88#include "tree.h"
89#include "gimple.h"
90#include "cfghooks.h"
91#include "tree-pass.h"
92#include "ssa.h"
93#include "expmed.h"
94#include "expr.h"
95#include "optabs-query.h"
96#include "gimple-pretty-print.h"
97#include "alias.h"
98#include "fold-const.h"
99#include "stor-layout.h"
100#include "gimple-iterator.h"
101#include "gimple-fold.h"
102#include "gimplify.h"
103#include "gimplify-me.h"
104#include "tree-cfg.h"
105#include "tree-into-ssa.h"
106#include "tree-ssa.h"
107#include "cfgloop.h"
108#include "tree-data-ref.h"
109#include "tree-scalar-evolution.h"
110#include "tree-ssa-loop.h"
111#include "tree-ssa-loop-niter.h"
112#include "tree-ssa-loop-ivopts.h"
113#include "tree-ssa-address.h"
114#include "dbgcnt.h"
115#include "tree-hash-traits.h"
116#include "varasm.h"
117#include "builtins.h"
118#include "cfganal.h"
119#include "internal-fn.h"
120#include "fold-const.h"
121#include "tree-ssa-sccvn.h"
122#include "tree-cfgcleanup.h"
123#include "tree-ssa-dse.h"
124#include "tree-vectorizer.h"
125#include "tree-eh.h"
126#include "cgraph.h"

128/* For lang_hooks.types.type_for_mode.  */
129#include "langhooks.h"

131/* Only handle PHIs with no more arguments unless we are asked to by
 simd pragma.  */
133#define MAX_PHI_ARG_NUM((unsigned) global_options.x_param_max_tree_if_conversion_phi_args
) \
((unsigned) param_max_tree_if_conversion_phi_argsglobal_options.x_param_max_tree_if_conversion_phi_args)

136/* True if we've converted a statement that was only executed when some
 condition C was true, and if for correctness we need to predicate the
 statement to ensure that it is a no-op when C is false.  See
 predicate_statements for the kinds of predication we support.  */
140static bool need_to_predicate;

142/* True if we have to rewrite stmts that may invoke undefined behavior
 when a condition C was false so it doesn't if it is always executed.
 See predicate_statements for the kinds of predication we support.  */
145static bool need_to_rewrite_undefined;

147/* Indicate if there are any complicated PHIs that need to be handled in
 if-conversion.  Complicated PHI has more than two arguments and can't
 be degenerated to two arguments PHI.  See more information in comment
 before phi_convertible_by_degenerating_args.  */
151static bool any_complicated_phi;

153/* True if we have bitfield accesses we can lower.  */
154static bool need_to_lower_bitfields;

156/* True if there is any ifcvting to be done.  */
157static bool need_to_ifcvt;

159/* Hash for struct innermost_loop_behavior.  It depends on the user to
 free the memory.  */

162struct innermost_loop_behavior_hash : nofree_ptr_hash <innermost_loop_behavior>
163{
static inline hashval_t hash (const value_type &);
static inline bool equal (const value_type &,
	    const compare_type &);
167};

169inline hashval_t
170innermost_loop_behavior_hash::hash (const value_type &e)
171{
hashval_t hash;

hash = iterative_hash_expr (e->base_address, 0);
hash = iterative_hash_expr (e->offset, hash);
hash = iterative_hash_expr (e->init, hash);
return iterative_hash_expr (e->step, hash);
178}

180inline bool
181innermost_loop_behavior_hash::equal (const value_type &e1,
		     const compare_type &e2)
183{
if ((e1->base_address && !e2->base_address)
    || (!e1->base_address && e2->base_address)
    || (!e1->offset && e2->offset)
    || (e1->offset && !e2->offset)
    || (!e1->init && e2->init)
    || (e1->init && !e2->init)
    || (!e1->step && e2->step)
    || (e1->step && !e2->step))
  return false;

if (e1->base_address && e2->base_address
    && !operand_equal_p (e1->base_address, e2->base_address, 0))
  return false;
if (e1->offset && e2->offset
    && !operand_equal_p (e1->offset, e2->offset, 0))
  return false;
if (e1->init && e2->init
    && !operand_equal_p (e1->init, e2->init, 0))
  return false;
if (e1->step && e2->step
    && !operand_equal_p (e1->step, e2->step, 0))
  return false;

return true;
208}

210/* List of basic blocks in if-conversion-suitable order.  */
211static basic_block *ifc_bbs;

213/* Hash table to store <DR's innermost loop behavior, DR> pairs.  */
214static hash_map<innermost_loop_behavior_hash,
data_reference_p> *innermost_DR_map;

217/* Hash table to store <base reference, DR> pairs.  */
218static hash_map<tree_operand_hash, data_reference_p> *baseref_DR_map;

220/* List of redundant SSA names: the first should be replaced by the second.  */
221static vec< std::pair<tree, tree> > redundant_ssa_names;

223/* Structure used to predicate basic blocks.  This is attached to the
 ->aux field of the BBs in the loop to be if-converted.  */
225struct bb_predicate {

/* The condition under which this basic block is executed.  */
tree predicate;

/* PREDICATE is gimplified, and the sequence of statements is
   recorded here, in order to avoid the duplication of computations
   that occur in previous conditions.  See PR44483.  */
gimple_seq predicate_gimplified_stmts;
234};

236/* Returns true when the basic block BB has a predicate.  */

238static inline bool
239bb_has_predicate (basic_block bb)
240{
return bb->aux != NULLnullptr;
242}

244/* Returns the gimplified predicate for basic block BB.  */

246static inline tree
247bb_predicate (basic_block bb)
248{
return ((struct bb_predicate *) bb->aux)->predicate;
250}

252/* Sets the gimplified predicate COND for basic block BB.  */

254static inline void
255set_bb_predicate (basic_block bb, tree cond)
256{
gcc_assert ((TREE_CODE (cond) == TRUTH_NOT_EXPR((void)(!((((enum tree_code) (cond)->base.code) == TRUTH_NOT_EXPR
 && is_gimple_val ((*((const_cast<tree*> (tree_operand_check
 ((cond), (0), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 258, __FUNCTION__))))))) || is_gimple_val (cond)) ? fancy_abort
 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 259, __FUNCTION__), 0 : 0))
      && is_gimple_val (TREE_OPERAND (cond, 0)))((void)(!((((enum tree_code) (cond)->base.code) == TRUTH_NOT_EXPR
 && is_gimple_val ((*((const_cast<tree*> (tree_operand_check
 ((cond), (0), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 258, __FUNCTION__))))))) || is_gimple_val (cond)) ? fancy_abort
 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 259, __FUNCTION__), 0 : 0))
     || is_gimple_val (cond))((void)(!((((enum tree_code) (cond)->base.code) == TRUTH_NOT_EXPR
 && is_gimple_val ((*((const_cast<tree*> (tree_operand_check
 ((cond), (0), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 258, __FUNCTION__))))))) || is_gimple_val (cond)) ? fancy_abort
 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 259, __FUNCTION__), 0 : 0));
((struct bb_predicate *) bb->aux)->predicate = cond;
261}

263/* Returns the sequence of statements of the gimplification of the
 predicate for basic block BB.  */

266static inline gimple_seq
267bb_predicate_gimplified_stmts (basic_block bb)
268{
return ((struct bb_predicate *) bb->aux)->predicate_gimplified_stmts;
270}

272/* Sets the sequence of statements STMTS of the gimplification of the
 predicate for basic block BB.  */

275static inline void
276set_bb_predicate_gimplified_stmts (basic_block bb, gimple_seq stmts)
277{
((struct bb_predicate *) bb->aux)->predicate_gimplified_stmts = stmts;
279}

281/* Adds the sequence of statements STMTS to the sequence of statements
 of the predicate for basic block BB.  */

284static inline void
285add_bb_predicate_gimplified_stmts (basic_block bb, gimple_seq stmts)
286{
/* We might have updated some stmts in STMTS via force_gimple_operand
   calling fold_stmt and that producing multiple stmts.  Delink immediate
   uses so update_ssa after loop versioning doesn't get confused for
   the not yet inserted predicates.
   ???  This should go away once we reliably avoid updating stmts
   not in any BB.  */
for (gimple_stmt_iterator gsi = gsi_start (stmts);
     !gsi_end_p (gsi); gsi_next (&gsi))
  {
    gimple *stmt = gsi_stmt (gsi);
    delink_stmt_imm_use (stmt);
    gimple_set_modified (stmt, true);
  }
gimple_seq_add_seq_without_update
  (&(((struct bb_predicate *) bb->aux)->predicate_gimplified_stmts), stmts);
302}

304/* Initializes to TRUE the predicate of basic block BB.  */

306static inline void
307init_bb_predicate (basic_block bb)
308{
bb->aux = XNEW (struct bb_predicate)((struct bb_predicate *) xmalloc (sizeof (struct bb_predicate
)));
set_bb_predicate_gimplified_stmts (bb, NULLnullptr);
set_bb_predicate (bb, boolean_true_nodeglobal_trees[TI_BOOLEAN_TRUE]);
312}

314/* Release the SSA_NAMEs associated with the predicate of basic block BB.  */

316static inline void
317release_bb_predicate (basic_block bb)
318{
gimple_seq stmts = bb_predicate_gimplified_stmts (bb);
if (stmts)
  {
    /* Ensure that these stmts haven't yet been added to a bb.  */
    if (flag_checkingglobal_options.x_flag_checking)
for (gimple_stmt_iterator i = gsi_start (stmts);
    !gsi_end_p (i); gsi_next (&i))
 gcc_assert (! gimple_bb (gsi_stmt (i)))((void)(!(! gimple_bb (gsi_stmt (i))) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 326, __FUNCTION__), 0 : 0));

    /* Discard them.  */
    gimple_seq_discard (stmts);
    set_bb_predicate_gimplified_stmts (bb, NULLnullptr);
  }
332}

334/* Free the predicate of basic block BB.  */

336static inline void
337free_bb_predicate (basic_block bb)
338{
if (!bb_has_predicate (bb))
  return;

release_bb_predicate (bb);
free (bb->aux);
bb->aux = NULLnullptr;
345}

347/* Reinitialize predicate of BB with the true predicate.  */

349static inline void
350reset_bb_predicate (basic_block bb)
351{
if (!bb_has_predicate (bb))
  init_bb_predicate (bb);
else
  {
    release_bb_predicate (bb);
    set_bb_predicate (bb, boolean_true_nodeglobal_trees[TI_BOOLEAN_TRUE]);
  }
359}

361/* Returns a new SSA_NAME of type TYPE that is assigned the value of
 the expression EXPR.  Inserts the statement created for this
 computation before GSI and leaves the iterator GSI at the same
 statement.  */

366static tree
367ifc_temp_var (tree type, tree expr, gimple_stmt_iterator *gsi)
368{
tree new_name = make_temp_ssa_name (type, NULLnullptr, "_ifc_");
gimple *stmt = gimple_build_assign (new_name, expr);
gimple_set_vuse (stmt, gimple_vuse (gsi_stmt (*gsi)));
gsi_insert_before (gsi, stmt, GSI_SAME_STMT);
return new_name;
374}

376/* Return true when COND is a false predicate.  */

378static inline bool
379is_false_predicate (tree cond)
380{
return (cond != NULL_TREE(tree) nullptr
 && (cond == boolean_false_nodeglobal_trees[TI_BOOLEAN_FALSE]
     || integer_zerop (cond)));
384}

386/* Return true when COND is a true predicate.  */

388static inline bool
389is_true_predicate (tree cond)
390{
return (cond == NULL_TREE(tree) nullptr
 || cond == boolean_true_nodeglobal_trees[TI_BOOLEAN_TRUE]
 || integer_onep (cond));
394}

396/* Returns true when BB has a predicate that is not trivial: true or
 NULL_TREE.  */

399static inline bool
400is_predicated (basic_block bb)
401{
return !is_true_predicate (bb_predicate (bb));
403}

405/* Parses the predicate COND and returns its comparison code and
 operands OP0 and OP1.  */

408static enum tree_code
409parse_predicate (tree cond, tree *op0, tree *op1)
410{
gimple *s;

if (TREE_CODE (cond)((enum tree_code) (cond)->base.code) == SSA_NAME
    && is_gimple_assign (s = SSA_NAME_DEF_STMT (cond)(tree_check ((cond), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 414, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt))
  {
    if (TREE_CODE_CLASS (gimple_assign_rhs_code (s))tree_code_type_tmpl <0>::tree_code_type[(int) (gimple_assign_rhs_code
 (s))] == tcc_comparison)
{
 *op0 = gimple_assign_rhs1 (s);
 *op1 = gimple_assign_rhs2 (s);
 return gimple_assign_rhs_code (s);
}

    else if (gimple_assign_rhs_code (s) == TRUTH_NOT_EXPR)
{
 tree op = gimple_assign_rhs1 (s);
 tree type = TREE_TYPE (op)((contains_struct_check ((op), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 426, __FUNCTION__))->typed.type);
 enum tree_code code = parse_predicate (op, op0, op1);

 return code == ERROR_MARK ? ERROR_MARK
   : invert_tree_comparison (code, HONOR_NANS (type));
}

    return ERROR_MARK;
  }

if (COMPARISON_CLASS_P (cond)(tree_code_type_tmpl <0>::tree_code_type[(int) (((enum tree_code
) (cond)->base.code))] == tcc_comparison))
  {
    *op0 = TREE_OPERAND (cond, 0)(*((const_cast<tree*> (tree_operand_check ((cond), (0),
 "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 438, __FUNCTION__)))));
    *op1 = TREE_OPERAND (cond, 1)(*((const_cast<tree*> (tree_operand_check ((cond), (1),
 "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 439, __FUNCTION__)))));
    return TREE_CODE (cond)((enum tree_code) (cond)->base.code);
  }

return ERROR_MARK;
444}

446/* Returns the fold of predicate C1 OR C2 at location LOC.  */

448static tree
449fold_or_predicates (location_t loc, tree c1, tree c2)
450{
tree op1a, op1b, op2a, op2b;
enum tree_code code1 = parse_predicate (c1, &op1a, &op1b);
enum tree_code code2 = parse_predicate (c2, &op2a, &op2b);

if (code1 != ERROR_MARK && code2 != ERROR_MARK)
  {
    tree t = maybe_fold_or_comparisons (boolean_type_nodeglobal_trees[TI_BOOLEAN_TYPE], code1, op1a, op1b,
			  code2, op2a, op2b);
    if (t)
return t;
  }

return fold_build2_loc (loc, TRUTH_OR_EXPR, boolean_type_nodeglobal_trees[TI_BOOLEAN_TYPE], c1, c2);
464}

466/* Returns either a COND_EXPR or the folded expression if the folded
 expression is a MIN_EXPR, a MAX_EXPR, an ABS_EXPR,
 a constant or a SSA_NAME. */

470static tree
471fold_build_cond_expr (tree type, tree cond, tree rhs, tree lhs)
472{
/* If COND is comparison r != 0 and r has boolean type, convert COND
   to SSA_NAME to accept by vect bool pattern.  */
if (TREE_CODE (cond)((enum tree_code) (cond)->base.code) == NE_EXPR)
  {
    tree op0 = TREE_OPERAND (cond, 0)(*((const_cast<tree*> (tree_operand_check ((cond), (0),
 "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 477, __FUNCTION__)))));
    tree op1 = TREE_OPERAND (cond, 1)(*((const_cast<tree*> (tree_operand_check ((cond), (1),
 "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 478, __FUNCTION__)))));
    if (TREE_CODE (op0)((enum tree_code) (op0)->base.code) == SSA_NAME
 && TREE_CODE (TREE_TYPE (op0))((enum tree_code) (((contains_struct_check ((op0), (TS_TYPED)
, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 480, __FUNCTION__))->typed.type))->base.code) == BOOLEAN_TYPE
 && (integer_zerop (op1)))
cond = op0;
  }

gimple_match_op cexpr (gimple_match_cond::UNCOND, COND_EXPR,
	 type, cond, rhs, lhs);
if (cexpr.resimplify (NULLnullptr, follow_all_ssa_edges))
  {
    if (gimple_simplified_result_is_gimple_val (&cexpr))
return cexpr.ops[0];
    else if (cexpr.code == ABS_EXPR)
return build1 (ABS_EXPR, type, cexpr.ops[0]);
    else if (cexpr.code == MIN_EXPR
      || cexpr.code == MAX_EXPR)
return build2 ((tree_code)cexpr.code, type, cexpr.ops[0], cexpr.ops[1]);
  }

return build3 (COND_EXPR, type, cond, rhs, lhs);
499}

501/* Add condition NC to the predicate list of basic block BB.  LOOP is
 the loop to be if-converted. Use predicate of cd-equivalent block
 for join bb if it exists: we call basic blocks bb1 and bb2 
 cd-equivalent if they are executed under the same condition.  */

506static inline void
507add_to_predicate_list (class loop *loop, basic_block bb, tree nc)
508{
tree bc, *tp;
basic_block dom_bb;

if (is_true_predicate (nc))
  return;

/* If dominance tells us this basic block is always executed,
   don't record any predicates for it.  */
if (dominated_by_p (CDI_DOMINATORS, loop->latch, bb))
  return;

dom_bb = get_immediate_dominator (CDI_DOMINATORS, bb);
/* We use notion of cd equivalence to get simpler predicate for
   join block, e.g. if join block has 2 predecessors with predicates
   p1 & p2 and p1 & !p2, we'd like to get p1 for it instead of
   p1 & p2 | p1 & !p2.  */
if (dom_bb != loop->header
    && get_immediate_dominator (CDI_POST_DOMINATORS, dom_bb) == bb)
  {
    gcc_assert (flow_bb_inside_loop_p (loop, dom_bb))((void)(!(flow_bb_inside_loop_p (loop, dom_bb)) ? fancy_abort
 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 528, __FUNCTION__), 0 : 0));
    bc = bb_predicate (dom_bb);
    if (!is_true_predicate (bc))
set_bb_predicate (bb, bc);
    else
gcc_assert (is_true_predicate (bb_predicate (bb)))((void)(!(is_true_predicate (bb_predicate (bb))) ? fancy_abort
 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 533, __FUNCTION__), 0 : 0));
    if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Use predicate of bb#%d for bb#%d\n",
 dom_bb->index, bb->index);
    return;
  }

if (!is_predicated (bb))
  bc = nc;
else
  {
    bc = bb_predicate (bb);
    bc = fold_or_predicates (EXPR_LOCATION (bc)((((bc)) && ((tree_code_type_tmpl <0>::tree_code_type
[(int) (((enum tree_code) ((bc))->base.code))]) >= tcc_reference
 && (tree_code_type_tmpl <0>::tree_code_type[(int
) (((enum tree_code) ((bc))->base.code))]) <= tcc_expression
)) ? (bc)->exp.locus : ((location_t) 0)), nc, bc);
    if (is_true_predicate (bc))
{
 reset_bb_predicate (bb);
 return;
}
  }

/* Allow a TRUTH_NOT_EXPR around the main predicate.  */
if (TREE_CODE (bc)((enum tree_code) (bc)->base.code) == TRUTH_NOT_EXPR)
  tp = &TREE_OPERAND (bc, 0)(*((const_cast<tree*> (tree_operand_check ((bc), (0), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 555, __FUNCTION__)))));
else
  tp = &bc;
if (!is_gimple_val (*tp))
  {
    gimple_seq stmts;
    *tp = force_gimple_operand (*tp, &stmts, true, NULL_TREE(tree) nullptr);
    add_bb_predicate_gimplified_stmts (bb, stmts);
  }
set_bb_predicate (bb, bc);
565}

567/* Add the condition COND to the previous condition PREV_COND, and add
 this to the predicate list of the destination of edge E.  LOOP is
 the loop to be if-converted.  */

571static void
572add_to_dst_predicate_list (class loop *loop, edge e,
	   tree prev_cond, tree cond)
574{
if (!flow_bb_inside_loop_p (loop, e->dest))
  return;

if (!is_true_predicate (prev_cond))
  cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,fold_build2_loc (((location_t) 0), TRUTH_AND_EXPR, global_trees
[TI_BOOLEAN_TYPE], prev_cond, cond )
	prev_cond, cond)fold_build2_loc (((location_t) 0), TRUTH_AND_EXPR, global_trees
[TI_BOOLEAN_TYPE], prev_cond, cond );

if (!dominated_by_p (CDI_DOMINATORS, loop->latch, e->dest))
  add_to_predicate_list (loop, e->dest, cond);
584}

586/* Return true if one of the successor edges of BB exits LOOP.  */

588static bool
589bb_with_exit_edge_p (class loop *loop, basic_block bb)
590{
edge e;
edge_iterator ei;

FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
  if (loop_exit_edge_p (loop, e))
    return true;

return false;
599}

601/* Given PHI which has more than two arguments, this function checks if
 it's if-convertible by degenerating its arguments.  Specifically, if
 below two conditions are satisfied:

   1) Number of PHI arguments with different values equals to 2 and one
argument has the only occurrence.
   2) The edge corresponding to the unique argument isn't critical edge.

 Such PHI can be handled as PHIs have only two arguments.  For example,
 below PHI:

   res = PHI <A_1(e1), A_1(e2), A_2(e3)>;

 can be transformed into:

   res = (predicate of e3) ? A_2 : A_1;

 Return TRUE if it is the case, FALSE otherwise.  */

620static bool
621phi_convertible_by_degenerating_args (gphi *phi)
622{
edge e;
tree arg, t1 = NULLnullptr, t2 = NULLnullptr;
unsigned int i, i1 = 0, i2 = 0, n1 = 0, n2 = 0;
unsigned int num_args = gimple_phi_num_args (phi);

gcc_assert (num_args > 2)((void)(!(num_args > 2) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 628, __FUNCTION__), 0 : 0));

for (i = 0; i < num_args; i++)
  {
    arg = gimple_phi_arg_def (phi, i);
    if (t1 == NULLnullptr || operand_equal_p (t1, arg, 0))
{
 n1++;
 i1 = i;
 t1 = arg;
}
    else if (t2 == NULLnullptr || operand_equal_p (t2, arg, 0))
{
 n2++;
 i2 = i;
 t2 = arg;
}
    else
return false;
  }

if (n1 != 1 && n2 != 1)
  return false;

/* Check if the edge corresponding to the unique arg is critical.  */
e = gimple_phi_arg_edge (phi, (n1 == 1) ? i1 : i2);
if (EDGE_COUNT (e->src->succs)vec_safe_length (e->src->succs) > 1)
  return false;

return true;
658}

660/* Return true when PHI is if-convertible.  PHI is part of loop LOOP
 and it belongs to basic block BB.  Note at this point, it is sure
 that PHI is if-convertible.  This function updates global variable
 ANY_COMPLICATED_PHI if PHI is complicated.  */

665static bool
666if_convertible_phi_p (class loop *loop, basic_block bb, gphi *phi)
667{
if (dump_file && (dump_flags & TDF_DETAILS))
  {
    fprintf (dump_file, "-------------------------\n");
    print_gimple_stmt (dump_file, phi, 0, TDF_SLIM);
  }

if (bb != loop->header
    && gimple_phi_num_args (phi) > 2
    && !phi_convertible_by_degenerating_args (phi))
  any_complicated_phi = true;

return true;
680}

682/* Records the status of a data reference.  This struct is attached to
 each DR->aux field.  */

685struct ifc_dr {
bool rw_unconditionally;
bool w_unconditionally;
bool written_at_least_once;

tree rw_predicate;
tree w_predicate;
tree base_w_predicate;
693};

695#define IFC_DR(DR)((struct ifc_dr *) (DR)->aux) ((struct ifc_dr *) (DR)->aux)
696#define DR_BASE_W_UNCONDITIONALLY(DR)(((struct ifc_dr *) (DR)->aux)->written_at_least_once) (IFC_DR (DR)((struct ifc_dr *) (DR)->aux)->written_at_least_once)
697#define DR_RW_UNCONDITIONALLY(DR)(((struct ifc_dr *) (DR)->aux)->rw_unconditionally) (IFC_DR (DR)((struct ifc_dr *) (DR)->aux)->rw_unconditionally)
698#define DR_W_UNCONDITIONALLY(DR)(((struct ifc_dr *) (DR)->aux)->w_unconditionally) (IFC_DR (DR)((struct ifc_dr *) (DR)->aux)->w_unconditionally)

700/* Iterates over DR's and stores refs, DR and base refs, DR pairs in
 HASH tables.  While storing them in HASH table, it checks if the
 reference is unconditionally read or written and stores that as a flag
 information.  For base reference it checks if it is written atlest once
 unconditionally and stores it as flag information along with DR.
 In other words for every data reference A in STMT there exist other
 accesses to a data reference with the same base with predicates that
 add up (OR-up) to the true predicate: this ensures that the data
 reference A is touched (read or written) on every iteration of the
 if-converted loop.  */
710static void
711hash_memrefs_baserefs_and_store_DRs_read_written_info (data_reference_p a)
712{

data_reference_p *master_dr, *base_master_dr;
tree base_ref = DR_BASE_OBJECT (a)(a)->indices.base_object;
innermost_loop_behavior *innermost = &DR_INNERMOST (a)(a)->innermost;
tree ca = bb_predicate (gimple_bb (DR_STMT (a)(a)->stmt));
bool exist1, exist2;

master_dr = &innermost_DR_map->get_or_insert (innermost, &exist1);
if (!exist1)
  *master_dr = a;

if (DR_IS_WRITE (a)(!(a)->is_read))
  {
    IFC_DR (*master_dr)((struct ifc_dr *) (*master_dr)->aux)->w_predicate
= fold_or_predicates (UNKNOWN_LOCATION((location_t) 0), ca,
	      IFC_DR (*master_dr)((struct ifc_dr *) (*master_dr)->aux)->w_predicate);
    if (is_true_predicate (IFC_DR (*master_dr)((struct ifc_dr *) (*master_dr)->aux)->w_predicate))
DR_W_UNCONDITIONALLY (*master_dr)(((struct ifc_dr *) (*master_dr)->aux)->w_unconditionally
) = true;
  }
IFC_DR (*master_dr)((struct ifc_dr *) (*master_dr)->aux)->rw_predicate
  = fold_or_predicates (UNKNOWN_LOCATION((location_t) 0), ca,
	  IFC_DR (*master_dr)((struct ifc_dr *) (*master_dr)->aux)->rw_predicate);
if (is_true_predicate (IFC_DR (*master_dr)((struct ifc_dr *) (*master_dr)->aux)->rw_predicate))
  DR_RW_UNCONDITIONALLY (*master_dr)(((struct ifc_dr *) (*master_dr)->aux)->rw_unconditionally
) = true;

if (DR_IS_WRITE (a)(!(a)->is_read))
  {
    base_master_dr = &baseref_DR_map->get_or_insert (base_ref, &exist2);
    if (!exist2)
*base_master_dr = a;
    IFC_DR (*base_master_dr)((struct ifc_dr *) (*base_master_dr)->aux)->base_w_predicate
= fold_or_predicates (UNKNOWN_LOCATION((location_t) 0), ca,
	      IFC_DR (*base_master_dr)((struct ifc_dr *) (*base_master_dr)->aux)->base_w_predicate);
    if (is_true_predicate (IFC_DR (*base_master_dr)((struct ifc_dr *) (*base_master_dr)->aux)->base_w_predicate))
DR_BASE_W_UNCONDITIONALLY (*base_master_dr)(((struct ifc_dr *) (*base_master_dr)->aux)->written_at_least_once
) = true;
  }
749}

751/* Return TRUE if can prove the index IDX of an array reference REF is
 within array bound.  Return false otherwise.  */

754static bool
755idx_within_array_bound (tree ref, tree *idx, void *dta)
756{
wi::overflow_type overflow;
widest_int niter, valid_niter, delta, wi_step;
tree ev, init, step;
tree low, high;
class loop *loop = (class loop*) dta;

/* Only support within-bound access for array references.  */
if (TREE_CODE (ref)((enum tree_code) (ref)->base.code) != ARRAY_REF)
  return false;

/* For arrays that might have flexible sizes, it is not guaranteed that they
   do not extend over their declared size.  */
if (array_ref_flexible_size_p (ref))
  return false;

ev = analyze_scalar_evolution (loop, *idx);
ev = instantiate_parameters (loop, ev);
init = initial_condition (ev);
step = evolution_part_in_loop_num (ev, loop->num);

if (!init || TREE_CODE (init)((enum tree_code) (init)->base.code) != INTEGER_CST
    || (step && TREE_CODE (step)((enum tree_code) (step)->base.code) != INTEGER_CST))
  return false;

low = array_ref_low_bound (ref);
high = array_ref_up_bound (ref);

/* The case of nonconstant bounds could be handled, but it would be
   complicated.  */
if (TREE_CODE (low)((enum tree_code) (low)->base.code) != INTEGER_CST
    || !high || TREE_CODE (high)((enum tree_code) (high)->base.code) != INTEGER_CST)
  return false;

/* Check if the intial idx is within bound.  */
if (wi::to_widest (init) < wi::to_widest (low)
    || wi::to_widest (init) > wi::to_widest (high))
  return false;

/* The idx is always within bound.  */
if (!step || integer_zerop (step))
  return true;

if (!max_loop_iterations (loop, &niter))
  return false;

if (wi::to_widest (step) < 0)
  {
    delta = wi::to_widest (init) - wi::to_widest (low);
    wi_step = -wi::to_widest (step);
  }
else
  {
    delta = wi::to_widest (high) - wi::to_widest (init);
    wi_step = wi::to_widest (step);
  }

valid_niter = wi::div_floor (delta, wi_step, SIGNED, &overflow);
/* The iteration space of idx is within array bound.  */
if (!overflow && niter <= valid_niter)
  return true;

return false;
819}

821/* Return TRUE if ref is a within bound array reference.  */

823static bool
824ref_within_array_bound (gimple *stmt, tree ref)
825{
class loop *loop = loop_containing_stmt (stmt);

gcc_assert (loop != NULL)((void)(!(loop != nullptr) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 828, __FUNCTION__), 0 : 0));
return for_each_index (&ref, idx_within_array_bound, loop);
830}


833/* Given a memory reference expression T, return TRUE if base object
 it refers to is writable.  The base object of a memory reference
 is the main object being referenced, which is returned by function
 get_base_address.  */

838static bool
839base_object_writable (tree ref)
840{
tree base_tree = get_base_address (ref);

return (base_tree
 && DECL_P (base_tree)(tree_code_type_tmpl <0>::tree_code_type[(int) (((enum tree_code
) (base_tree)->base.code))] == tcc_declaration)
 && decl_binds_to_current_def_p (base_tree)
 && !TREE_READONLY (base_tree)((non_type_check ((base_tree), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 846, __FUNCTION__))->base.readonly_flag));
847}

849/* Return true when the memory references of STMT won't trap in the
 if-converted code.  There are two things that we have to check for:

 - writes to memory occur to writable memory: if-conversion of
 memory writes transforms the conditional memory writes into
 unconditional writes, i.e. "if (cond) A[i] = foo" is transformed
 into "A[i] = cond ? foo : A[i]", and as the write to memory may not
 be executed at all in the original code, it may be a readonly
 memory.  To check that A is not const-qualified, we check that
 there exists at least an unconditional write to A in the current
 function.

 - reads or writes to memory are valid memory accesses for every
 iteration.  To check that the memory accesses are correctly formed
 and that we are allowed to read and write in these locations, we
 check that the memory accesses to be if-converted occur at every
 iteration unconditionally.

 Returns true for the memory reference in STMT, same memory reference
 is read or written unconditionally atleast once and the base memory
 reference is written unconditionally once.  This is to check reference
 will not write fault.  Also retuns true if the memory reference is
 unconditionally read once then we are conditionally writing to memory
 which is defined as read and write and is bound to the definition
 we are seeing.  */
874static bool
875ifcvt_memrefs_wont_trap (gimple *stmt, vec<data_reference_p> drs)
876{
/* If DR didn't see a reference here we can't use it to tell
   whether the ref traps or not.  */
if (gimple_uid (stmt) == 0)
  return false;

data_reference_p *master_dr, *base_master_dr;
data_reference_p a = drs[gimple_uid (stmt) - 1];

tree base = DR_BASE_OBJECT (a)(a)->indices.base_object;
innermost_loop_behavior *innermost = &DR_INNERMOST (a)(a)->innermost;

gcc_assert (DR_STMT (a) == stmt)((void)(!((a)->stmt == stmt) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 888, __FUNCTION__), 0 : 0));
gcc_assert (DR_BASE_ADDRESS (a) || DR_OFFSET (a)((void)(!((a)->innermost.base_address || (a)->innermost
.offset || (a)->innermost.init || (a)->innermost.step) ?
 fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 890, __FUNCTION__), 0 : 0))
            || DR_INIT (a) || DR_STEP (a))((void)(!((a)->innermost.base_address || (a)->innermost
.offset || (a)->innermost.init || (a)->innermost.step) ?
 fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 890, __FUNCTION__), 0 : 0));

master_dr = innermost_DR_map->get (innermost);
gcc_assert (master_dr != NULL)((void)(!(master_dr != nullptr) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 893, __FUNCTION__), 0 : 0));

base_master_dr = baseref_DR_map->get (base);

/* If a is unconditionally written to it doesn't trap.  */
if (DR_W_UNCONDITIONALLY (*master_dr)(((struct ifc_dr *) (*master_dr)->aux)->w_unconditionally
))
  return true;

/* If a is unconditionally accessed then ...

   Even a is conditional access, we can treat it as an unconditional
   one if it's an array reference and all its index are within array
   bound.  */
if (DR_RW_UNCONDITIONALLY (*master_dr)(((struct ifc_dr *) (*master_dr)->aux)->rw_unconditionally
)
    || ref_within_array_bound (stmt, DR_REF (a)(a)->ref))
  {
    /* an unconditional read won't trap.  */
    if (DR_IS_READ (a)(a)->is_read)
return true;

    /* an unconditionaly write won't trap if the base is written
       to unconditionally.  */
    if (base_master_dr
 && DR_BASE_W_UNCONDITIONALLY (*base_master_dr)(((struct ifc_dr *) (*base_master_dr)->aux)->written_at_least_once
))
return flag_store_data_racesglobal_options.x_flag_store_data_races;
    /* or the base is known to be not readonly.  */
    else if (base_object_writable (DR_REF (a)(a)->ref))
return flag_store_data_racesglobal_options.x_flag_store_data_races;
  }

return false;
924}

926/* Return true if STMT could be converted into a masked load or store
 (conditional load or store based on a mask computed from bb predicate).  */

929static bool
930ifcvt_can_use_mask_load_store (gimple *stmt)
931{
/* Check whether this is a load or store.  */
tree lhs = gimple_assign_lhs (stmt);
bool is_load;
tree ref;
if (gimple_store_p (stmt))
  {
    if (!is_gimple_val (gimple_assign_rhs1 (stmt)))
return false;
    is_load = false;
    ref = lhs;
  }
else if (gimple_assign_load_p (stmt))
  {
    is_load = true;
    ref = gimple_assign_rhs1 (stmt);
  }
else
  return false;

if (may_be_nonaddressable_p (ref))
  return false;

/* Mask should be integer mode of the same size as the load/store
   mode.  */
machine_mode mode = TYPE_MODE (TREE_TYPE (lhs))((((enum tree_code) ((tree_class_check ((((contains_struct_check
 ((lhs), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 956, __FUNCTION__))->typed.type)), (tcc_type), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 956, __FUNCTION__)))->base.code) == VECTOR_TYPE) ? vector_type_mode
 (((contains_struct_check ((lhs), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 956, __FUNCTION__))->typed.type)) : (((contains_struct_check
 ((lhs), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 956, __FUNCTION__))->typed.type))->type_common.mode);
if (!int_mode_for_mode (mode).exists () || VECTOR_MODE_P (mode)(((enum mode_class) mode_class[mode]) == MODE_VECTOR_BOOL || (
(enum mode_class) mode_class[mode]) == MODE_VECTOR_INT || ((enum
 mode_class) mode_class[mode]) == MODE_VECTOR_FLOAT || ((enum
 mode_class) mode_class[mode]) == MODE_VECTOR_FRACT || ((enum
 mode_class) mode_class[mode]) == MODE_VECTOR_UFRACT || ((enum
 mode_class) mode_class[mode]) == MODE_VECTOR_ACCUM || ((enum
 mode_class) mode_class[mode]) == MODE_VECTOR_UACCUM))
  return false;

if (can_vec_mask_load_store_p (mode, VOIDmode((void) 0, E_VOIDmode), is_load))
  return true;

return false;
964}

966/* Return true if STMT could be converted from an operation that is
 unconditional to one that is conditional on a bb predicate mask.  */

969static bool
970ifcvt_can_predicate (gimple *stmt)
971{
basic_block bb = gimple_bb (stmt);

if (!(flag_tree_loop_vectorizeglobal_options.x_flag_tree_loop_vectorize || bb->loop_father->force_vectorize)
    || bb->loop_father->dont_vectorize
    || gimple_has_volatile_ops (stmt))
  return false;

if (gimple_assign_single_p (stmt))
  return ifcvt_can_use_mask_load_store (stmt);

tree_code code = gimple_assign_rhs_code (stmt);
tree lhs_type = TREE_TYPE (gimple_assign_lhs (stmt))((contains_struct_check ((gimple_assign_lhs (stmt)), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 983, __FUNCTION__))->typed.type);
tree rhs_type = TREE_TYPE (gimple_assign_rhs1 (stmt))((contains_struct_check ((gimple_assign_rhs1 (stmt)), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 984, __FUNCTION__))->typed.type);
if (!types_compatible_p (lhs_type, rhs_type))
  return false;
internal_fn cond_fn = get_conditional_internal_fn (code);
return (cond_fn != IFN_LAST
 && vectorized_internal_fn_supported_p (cond_fn, lhs_type));
990}

992/* Return true when STMT is if-convertible.

 GIMPLE_ASSIGN statement is not if-convertible if,
 - it is not movable,
 - it could trap,
 - LHS is not var decl.  */

999static bool
1000if_convertible_gimple_assign_stmt_p (gimple *stmt,
		     vec<data_reference_p> refs)
1002{
tree lhs = gimple_assign_lhs (stmt);

if (dump_file && (dump_flags & TDF_DETAILS))
  {
    fprintf (dump_file, "-------------------------\n");
    print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
  }

if (!is_gimple_reg_type (TREE_TYPE (lhs)((contains_struct_check ((lhs), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1011, __FUNCTION__))->typed.type)))
  return false;

/* Some of these constrains might be too conservative.  */
if (stmt_ends_bb_p (stmt)
    || gimple_has_volatile_ops (stmt)
    || (TREE_CODE (lhs)((enum tree_code) (lhs)->base.code) == SSA_NAME
        && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (lhs)(tree_check ((lhs), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1018, __FUNCTION__, (SSA_NAME)))->base.asm_written_flag)
    || gimple_has_side_effects (stmt))
  {
    if (dump_file && (dump_flags & TDF_DETAILS))
      fprintf (dump_file, "stmt not suitable for ifcvt\n");
    return false;
  }

/* tree-into-ssa.cc uses GF_PLF_1, so avoid it, because
   in between if_convertible_loop_p and combine_blocks
   we can perform loop versioning.  */
gimple_set_plf (stmt, GF_PLF_2, false);

if ((! gimple_vuse (stmt)
     || gimple_could_trap_p_1 (stmt, false, false)
     || ! ifcvt_memrefs_wont_trap (stmt, refs))
    && gimple_could_trap_p (stmt))
  {
    if (ifcvt_can_predicate (stmt))
{
 gimple_set_plf (stmt, GF_PLF_2, true);
 need_to_predicate = true;
 return true;
}
    if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "tree could trap...\n");
    return false;
  }
else if ((INTEGRAL_TYPE_P (TREE_TYPE (lhs))(((enum tree_code) (((contains_struct_check ((lhs), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1046, __FUNCTION__))->typed.type))->base.code) == ENUMERAL_TYPE
 || ((enum tree_code) (((contains_struct_check ((lhs), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1046, __FUNCTION__))->typed.type))->base.code) == BOOLEAN_TYPE
 || ((enum tree_code) (((contains_struct_check ((lhs), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1046, __FUNCTION__))->typed.type))->base.code) == INTEGER_TYPE
)
   || POINTER_TYPE_P (TREE_TYPE (lhs))(((enum tree_code) (((contains_struct_check ((lhs), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1047, __FUNCTION__))->typed.type))->base.code) == POINTER_TYPE
 || ((enum tree_code) (((contains_struct_check ((lhs), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1047, __FUNCTION__))->typed.type))->base.code) == REFERENCE_TYPE
))
  && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (lhs))((((enum tree_code) (((contains_struct_check ((lhs), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1048, __FUNCTION__))->typed.type))->base.code) == POINTER_TYPE
 || ((enum tree_code) (((contains_struct_check ((lhs), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1048, __FUNCTION__))->typed.type))->base.code) == REFERENCE_TYPE
) ? !global_options.x_flag_wrapv_pointer : (!(any_integral_type_check
 ((((contains_struct_check ((lhs), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1048, __FUNCTION__))->typed.type)), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1048, __FUNCTION__))->base.u.bits.unsigned_flag &&
 !global_options.x_flag_wrapv && !global_options.x_flag_trapv
))
  && arith_code_with_undefined_signed_overflow
		(gimple_assign_rhs_code (stmt)))
  /* We have to rewrite stmts with undefined overflow.  */
  need_to_rewrite_undefined = true;

/* When if-converting stores force versioning, likewise if we
   ended up generating store data races.  */
if (gimple_vdef (stmt))
  need_to_predicate = true;

return true;
1060}

1062/* Return true when STMT is if-convertible.

 A statement is if-convertible if:
 - it is an if-convertible GIMPLE_ASSIGN,
 - it is a GIMPLE_LABEL or a GIMPLE_COND,
 - it is builtins call,
 - it is a call to a function with a SIMD clone.  */

1070static bool
1071if_convertible_stmt_p (gimple *stmt, vec<data_reference_p> refs)
1072{
switch (gimple_code (stmt))
  {
  case GIMPLE_LABEL:
  case GIMPLE_DEBUG:
  case GIMPLE_COND:
    return true;

  case GIMPLE_ASSIGN:
    return if_convertible_gimple_assign_stmt_p (stmt, refs);

  case GIMPLE_CALL:
    {
tree fndecl = gimple_call_fndecl (stmt);
if (fndecl)
 {
   /* We can vectorize some builtins and functions with SIMD
      "inbranch" clones.  */
   int flags = gimple_call_flags (stmt);
   struct cgraph_node *node = cgraph_node::get (fndecl);
   if ((flags & ECF_CONST(1 << 0))
&& !(flags & ECF_LOOPING_CONST_OR_PURE(1 << 2))
&& fndecl_built_in_p (fndecl))
     return true;
   if (node && node->simd_clones != NULLnullptr)
     /* Ensure that at least one clone can be "inbranch".  */
     for (struct cgraph_node *n = node->simd_clones; n != NULLnullptr;
   n = n->simdclone->next_clone)
if (n->simdclone->inbranch)
  {
    gimple_set_plf (stmt, GF_PLF_2, true);
    need_to_predicate = true;
    return true;
  }
 }
return false;
    }

  default:
    /* Don't know what to do with 'em so don't do anything.  */
    if (dump_file && (dump_flags & TDF_DETAILS))
{
 fprintf (dump_file, "don't know what to do\n");
 print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
}
    return false;
  }
1119}

1121/* Assumes that BB has more than 1 predecessors.
 Returns false if at least one successor is not on critical edge
 and true otherwise.  */

1125static inline bool
1126all_preds_critical_p (basic_block bb)
1127{
edge e;
edge_iterator ei;

FOR_EACH_EDGE (e, ei, bb->preds)for ((ei) = ei_start_1 (&((bb->preds))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
  if (EDGE_COUNT (e->src->succs)vec_safe_length (e->src->succs) == 1)
    return false;
return true;
1135}

1137/* Return true when BB is if-convertible.  This routine does not check
 basic block's statements and phis.

 A basic block is not if-convertible if:
 - it is non-empty and it is after the exit block (in BFS order),
 - it is after the exit block but before the latch,
 - its edges are not normal.

 EXIT_BB is the basic block containing the exit of the LOOP.  BB is
 inside LOOP.  */

1148static bool
1149if_convertible_bb_p (class loop *loop, basic_block bb, basic_block exit_bb)
1150{
edge e;
edge_iterator ei;

if (dump_file && (dump_flags & TDF_DETAILS))
  fprintf (dump_file, "----------[%d]-------------\n", bb->index);

if (EDGE_COUNT (bb->succs)vec_safe_length (bb->succs) > 2)
  return false;

gimple *last = last_stmt (bb);
if (gcall *call = safe_dyn_cast <gcall *> (last))
  if (gimple_call_ctrl_altering_p (call))
    return false;

if (exit_bb)
  {
    if (bb != loop->latch)
{
 if (dump_file && (dump_flags & TDF_DETAILS))
   fprintf (dump_file, "basic block after exit bb but before latch\n");
 return false;
}
    else if (!empty_block_p (bb))
{
 if (dump_file && (dump_flags & TDF_DETAILS))
   fprintf (dump_file, "non empty basic block after exit bb\n");
 return false;
}
    else if (bb == loop->latch
      && bb != exit_bb
      && !dominated_by_p (CDI_DOMINATORS, bb, exit_bb))
 {
   if (dump_file && (dump_flags & TDF_DETAILS))
     fprintf (dump_file, "latch is not dominated by exit_block\n");
   return false;
 }
  }

/* Be less adventurous and handle only normal edges.  */
FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
  if (e->flags & (EDGE_EH | EDGE_ABNORMAL | EDGE_IRREDUCIBLE_LOOP))
    {
if (dump_file && (dump_flags & TDF_DETAILS))
 fprintf (dump_file, "Difficult to handle edges\n");
return false;
    }

return true;
1199}

1201/* Return true when all predecessor blocks of BB are visited.  The
 VISITED bitmap keeps track of the visited blocks.  */

1204static bool
1205pred_blocks_visited_p (basic_block bb, bitmap *visited)
1206{
edge e;
edge_iterator ei;
FOR_EACH_EDGE (e, ei, bb->preds)for ((ei) = ei_start_1 (&((bb->preds))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
  if (!bitmap_bit_p (*visited, e->src->index))
    return false;

return true;
1214}

1216/* Get body of a LOOP in suitable order for if-conversion.  It is
 caller's responsibility to deallocate basic block list.
 If-conversion suitable order is, breadth first sort (BFS) order
 with an additional constraint: select a block only if all its
 predecessors are already selected.  */

1222static basic_block *
1223get_loop_body_in_if_conv_order (const class loop *loop)
1224{
basic_block *blocks, *blocks_in_bfs_order;
basic_block bb;
bitmap visited;
unsigned int index = 0;
unsigned int visited_count = 0;

gcc_assert (loop->num_nodes)((void)(!(loop->num_nodes) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1231, __FUNCTION__), 0 : 0));
gcc_assert (loop->latch != EXIT_BLOCK_PTR_FOR_FN (cfun))((void)(!(loop->latch != (((cfun + 0))->cfg->x_exit_block_ptr
)) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1232, __FUNCTION__), 0 : 0));

blocks = XCNEWVEC (basic_block, loop->num_nodes)((basic_block *) xcalloc ((loop->num_nodes), sizeof (basic_block
)));
visited = BITMAP_ALLOCbitmap_alloc (NULLnullptr);

blocks_in_bfs_order = get_loop_body_in_bfs_order (loop);

index = 0;
while (index < loop->num_nodes)
  {
    bb = blocks_in_bfs_order [index];

    if (bb->flags & BB_IRREDUCIBLE_LOOP)
{
 free (blocks_in_bfs_order);
 BITMAP_FREE (visited)((void) (bitmap_obstack_free ((bitmap) visited), (visited) = (
bitmap) nullptr));
 free (blocks);
 return NULLnullptr;
}

    if (!bitmap_bit_p (visited, bb->index))
{
 if (pred_blocks_visited_p (bb, &visited)
     || bb == loop->header)
   {
     /* This block is now visited.  */
     bitmap_set_bit (visited, bb->index);
     blocks[visited_count++] = bb;
   }
}

    index++;

    if (index == loop->num_nodes
 && visited_count != loop->num_nodes)
/* Not done yet.  */
index = 0;
  }
free (blocks_in_bfs_order);
BITMAP_FREE (visited)((void) (bitmap_obstack_free ((bitmap) visited), (visited) = (
bitmap) nullptr));
return blocks;
1273}

1275/* Returns true when the analysis of the predicates for all the basic
 blocks in LOOP succeeded.

 predicate_bbs first allocates the predicates of the basic blocks.
 These fields are then initialized with the tree expressions
 representing the predicates under which a basic block is executed
 in the LOOP.  As the loop->header is executed at each iteration, it
 has the "true" predicate.  Other statements executed under a
 condition are predicated with that condition, for example

 | if (x)
 |   S1;
 | else
 |   S2;

 S1 will be predicated with "x", and
 S2 will be predicated with "!x".  */

1293static void
1294predicate_bbs (loop_p loop)
1295{
unsigned int i;

for (i = 0; i < loop->num_nodes; i++)
  init_bb_predicate (ifc_bbs[i]);

for (i = 0; i < loop->num_nodes; i++)
  {
    basic_block bb = ifc_bbs[i];
    tree cond;
    gimple *stmt;

    /* The loop latch and loop exit block are always executed and
have no extra conditions to be processed: skip them.  */
    if (bb == loop->latch
 || bb_with_exit_edge_p (loop, bb))
{
 reset_bb_predicate (bb);
 continue;
}

    cond = bb_predicate (bb);
    stmt = last_stmt (bb);
    if (stmt && gimple_code (stmt) == GIMPLE_COND)
{
 tree c2;
 edge true_edge, false_edge;
 location_t loc = gimple_location (stmt);
 tree c;
 /* gcc.dg/fold-bopcond-1.c shows that despite all forwprop passes
    conditions can remain unfolded because of multiple uses so
    try to re-fold here, especially to get precision changing
    conversions sorted out.  Do not simply fold the stmt since
    this is analysis only.  When conditions were embedded in
    COND_EXPRs those were folded separately before folding the
    COND_EXPR but as they are now outside we have to make sure
    to fold them.  Do it here - another opportunity would be to
    fold predicates as they are inserted.  */
 gimple_match_op cexpr (gimple_match_cond::UNCOND,
		 gimple_cond_code (stmt),
		 boolean_type_nodeglobal_trees[TI_BOOLEAN_TYPE],
		 gimple_cond_lhs (stmt),
		 gimple_cond_rhs (stmt));
 if (cexpr.resimplify (NULLnullptr, follow_all_ssa_edges)
     && cexpr.code.is_tree_code ()
     && TREE_CODE_CLASS ((tree_code)cexpr.code)tree_code_type_tmpl <0>::tree_code_type[(int) ((tree_code
)cexpr.code)] == tcc_comparison)
   c = build2_loc (loc, (tree_code)cexpr.code, boolean_type_nodeglobal_trees[TI_BOOLEAN_TYPE],
	    cexpr.ops[0], cexpr.ops[1]);
 else
   c = build2_loc (loc, gimple_cond_code (stmt),
	    boolean_type_nodeglobal_trees[TI_BOOLEAN_TYPE],
	    gimple_cond_lhs (stmt),
	    gimple_cond_rhs (stmt));

 /* Add new condition into destination's predicate list.  */
 extract_true_false_edges_from_block (gimple_bb (stmt),
			       &true_edge, &false_edge);

 /* If C is true, then TRUE_EDGE is taken.  */
 add_to_dst_predicate_list (loop, true_edge, unshare_expr (cond),
		     unshare_expr (c));

 /* If C is false, then FALSE_EDGE is taken.  */
 c2 = build1_loc (loc, TRUTH_NOT_EXPR, boolean_type_nodeglobal_trees[TI_BOOLEAN_TYPE],
	   unshare_expr (c));
 add_to_dst_predicate_list (loop, false_edge,
		     unshare_expr (cond), c2);

 cond = NULL_TREE(tree) nullptr;
}

    /* If current bb has only one successor, then consider it as an
unconditional goto.  */
    if (single_succ_p (bb))
{
 basic_block bb_n = single_succ (bb);

 /* The successor bb inherits the predicate of its
    predecessor.  If there is no predicate in the predecessor
    bb, then consider the successor bb as always executed.  */
 if (cond == NULL_TREE(tree) nullptr)
   cond = boolean_true_nodeglobal_trees[TI_BOOLEAN_TRUE];

 add_to_predicate_list (loop, bb_n, cond);
}
  }

/* The loop header is always executed.  */
reset_bb_predicate (loop->header);
gcc_assert (bb_predicate_gimplified_stmts (loop->header) == NULL((void)(!(bb_predicate_gimplified_stmts (loop->header) == nullptr
 && bb_predicate_gimplified_stmts (loop->latch) ==
 nullptr) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1385, __FUNCTION__), 0 : 0))
     && bb_predicate_gimplified_stmts (loop->latch) == NULL)((void)(!(bb_predicate_gimplified_stmts (loop->header) == nullptr
 && bb_predicate_gimplified_stmts (loop->latch) ==
 nullptr) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1385, __FUNCTION__), 0 : 0));
1386}

1388/* Build region by adding loop pre-header and post-header blocks.  */

1390static vec<basic_block>
1391build_region (class loop *loop)
1392{
vec<basic_block> region = vNULL;
basic_block exit_bb = NULLnullptr;

gcc_assert (ifc_bbs)((void)(!(ifc_bbs) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1396, __FUNCTION__), 0 : 0));
/* The first element is loop pre-header.  */
region.safe_push (loop_preheader_edge (loop)->src);

for (unsigned int i = 0; i < loop->num_nodes; i++)
  {
    basic_block bb = ifc_bbs[i];
    region.safe_push (bb);
    /* Find loop postheader.  */
    edge e;
    edge_iterator ei;
    FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
if (loop_exit_edge_p (loop, e))
 {
     exit_bb = e->dest;
     break;
 }
  }
/* The last element is loop post-header.  */
gcc_assert (exit_bb)((void)(!(exit_bb) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1415, __FUNCTION__), 0 : 0));
region.safe_push (exit_bb);
return region;
1418}

1420/* Return true when LOOP is if-convertible.  This is a helper function
 for if_convertible_loop_p.  REFS and DDRS are initialized and freed
 in if_convertible_loop_p.  */

1424static bool
1425if_convertible_loop_p_1 (class loop *loop, vec<data_reference_p> *refs)
1426{
unsigned int i;
basic_block exit_bb = NULLnullptr;
vec<basic_block> region;

calculate_dominance_info (CDI_DOMINATORS);

for (i = 0; i < loop->num_nodes; i++)
  {
    basic_block bb = ifc_bbs[i];

    if (!if_convertible_bb_p (loop, bb, exit_bb))
return false;

    if (bb_with_exit_edge_p (loop, bb))
exit_bb = bb;
  }

for (i = 0; i < loop->num_nodes; i++)
  {
    basic_block bb = ifc_bbs[i];
    gimple_stmt_iterator gsi;

    bool may_have_nonlocal_labels
= bb_with_exit_edge_p (loop, bb) || bb == loop->latch;
    for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
switch (gimple_code (gsi_stmt (gsi)))
 {
 case GIMPLE_LABEL:
   if (!may_have_nonlocal_labels)
     {
tree label
  = gimple_label_label (as_a <glabel *> (gsi_stmt (gsi)));
if (DECL_NONLOCAL (label)((contains_struct_check ((label), (TS_DECL_COMMON), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1459, __FUNCTION__))->decl_common.nonlocal_flag) || FORCED_LABEL (label)((tree_check ((label), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1459, __FUNCTION__, (LABEL_DECL)))->base.side_effects_flag
))
  return false;
     }
   /* Fallthru.  */
 case GIMPLE_ASSIGN:
 case GIMPLE_CALL:
 case GIMPLE_DEBUG:
 case GIMPLE_COND:
   gimple_set_uid (gsi_stmt (gsi), 0);
   break;
 default:
   return false;
 }
  }

data_reference_p dr;

innermost_DR_map
 = new hash_map<innermost_loop_behavior_hash, data_reference_p>;
baseref_DR_map = new hash_map<tree_operand_hash, data_reference_p>;

/* Compute post-dominator tree locally.  */
region = build_region (loop);
calculate_dominance_info_for_region (CDI_POST_DOMINATORS, region);

predicate_bbs (loop);

/* Free post-dominator tree since it is not used after predication.  */
free_dominance_info_for_region (cfun(cfun + 0), CDI_POST_DOMINATORS, region);
region.release ();

for (i = 0; refs->iterate (i, &dr); i++)
  {
    tree ref = DR_REF (dr)(dr)->ref;

    dr->aux = XNEW (struct ifc_dr)((struct ifc_dr *) xmalloc (sizeof (struct ifc_dr)));
    DR_BASE_W_UNCONDITIONALLY (dr)(((struct ifc_dr *) (dr)->aux)->written_at_least_once) = false;
    DR_RW_UNCONDITIONALLY (dr)(((struct ifc_dr *) (dr)->aux)->rw_unconditionally) = false;
    DR_W_UNCONDITIONALLY (dr)(((struct ifc_dr *) (dr)->aux)->w_unconditionally) = false;
    IFC_DR (dr)((struct ifc_dr *) (dr)->aux)->rw_predicate = boolean_false_nodeglobal_trees[TI_BOOLEAN_FALSE];
    IFC_DR (dr)((struct ifc_dr *) (dr)->aux)->w_predicate = boolean_false_nodeglobal_trees[TI_BOOLEAN_FALSE];
    IFC_DR (dr)((struct ifc_dr *) (dr)->aux)->base_w_predicate = boolean_false_nodeglobal_trees[TI_BOOLEAN_FALSE];
    if (gimple_uid (DR_STMT (dr)(dr)->stmt) == 0)
gimple_set_uid (DR_STMT (dr)(dr)->stmt, i + 1);

    /* If DR doesn't have innermost loop behavior or it's a compound
       memory reference, we synthesize its innermost loop behavior
       for hashing.  */
    if (TREE_CODE (ref)((enum tree_code) (ref)->base.code) == COMPONENT_REF
        || TREE_CODE (ref)((enum tree_code) (ref)->base.code) == IMAGPART_EXPR
        || TREE_CODE (ref)((enum tree_code) (ref)->base.code) == REALPART_EXPR
        || !(DR_BASE_ADDRESS (dr)(dr)->innermost.base_address || DR_OFFSET (dr)(dr)->innermost.offset
      || DR_INIT (dr)(dr)->innermost.init || DR_STEP (dr)(dr)->innermost.step))
      {
        while (TREE_CODE (ref)((enum tree_code) (ref)->base.code) == COMPONENT_REF
        || TREE_CODE (ref)((enum tree_code) (ref)->base.code) == IMAGPART_EXPR
        || TREE_CODE (ref)((enum tree_code) (ref)->base.code) == REALPART_EXPR)
   ref = TREE_OPERAND (ref, 0)(*((const_cast<tree*> (tree_operand_check ((ref), (0), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1516, __FUNCTION__)))));

 memset (&DR_INNERMOST (dr)(dr)->innermost, 0, sizeof (DR_INNERMOST (dr)(dr)->innermost));
 DR_BASE_ADDRESS (dr)(dr)->innermost.base_address = ref;
      }
    hash_memrefs_baserefs_and_store_DRs_read_written_info (dr);
  }

for (i = 0; i < loop->num_nodes; i++)
  {
    basic_block bb = ifc_bbs[i];
    gimple_stmt_iterator itr;

    /* Check the if-convertibility of statements in predicated BBs.  */
    if (!dominated_by_p (CDI_DOMINATORS, loop->latch, bb))
for (itr = gsi_start_bb (bb); !gsi_end_p (itr); gsi_next (&itr))
 if (!if_convertible_stmt_p (gsi_stmt (itr), *refs))
   return false;
  }

/* Checking PHIs needs to be done after stmts, as the fact whether there
   are any masked loads or stores affects the tests.  */
for (i = 0; i < loop->num_nodes; i++)
  {
    basic_block bb = ifc_bbs[i];
    gphi_iterator itr;

    for (itr = gsi_start_phis (bb); !gsi_end_p (itr); gsi_next (&itr))
if (!if_convertible_phi_p (loop, bb, itr.phi ()))
 return false;
  }

if (dump_file)
  fprintf (dump_file, "Applying if-conversion\n");

return true;
1552}

1554/* Return true when LOOP is if-convertible.
 LOOP is if-convertible if:
 - it is innermost,
 - it has two or more basic blocks,
 - it has only one exit,
 - loop header is not the exit edge,
 - if its basic blocks and phi nodes are if convertible.  */

1562static bool
1563if_convertible_loop_p (class loop *loop, vec<data_reference_p> *refs)
1564{
edge e;
edge_iterator ei;
bool res = false;

/* Handle only innermost loop.  */
if (!loop || loop->inner)
  {
    if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "not innermost loop\n");
    return false;
  }

/* If only one block, no need for if-conversion.  */
if (loop->num_nodes <= 2)
  {
    if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "less than 2 basic blocks\n");
    return false;
  }

/* More than one loop exit is too much to handle.  */
if (!single_exit (loop))
  {
    if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "multiple exits\n");
    return false;
  }

/* If one of the loop header's edge is an exit edge then do not
   apply if-conversion.  */
FOR_EACH_EDGE (e, ei, loop->header->succs)for ((ei) = ei_start_1 (&((loop->header->succs))); ei_cond
 ((ei), &(e)); ei_next (&(ei)))
  if (loop_exit_edge_p (loop, e))
    return false;

res = if_convertible_loop_p_1 (loop, refs);

delete innermost_DR_map;
innermost_DR_map = NULLnullptr;

delete baseref_DR_map;
baseref_DR_map = NULLnullptr;

return res;
1608}

1610/* Return reduc_1 if has_nop.

 if (...)
   tmp1 = (unsigned type) reduc_1;
   tmp2 = tmp1 + rhs2;
   reduc_3 = (signed type) tmp2.  */
1616static tree
1617strip_nop_cond_scalar_reduction (bool has_nop, tree op)
1618{
if (!has_nop)
  return op;

if (TREE_CODE (op)((enum tree_code) (op)->base.code) != SSA_NAME)
  return NULL_TREE(tree) nullptr;

gassign *stmt = safe_dyn_cast <gassign *> (SSA_NAME_DEF_STMT (op)(tree_check ((op), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1625, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt);
if (!stmt
    || !CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (stmt))((gimple_assign_rhs_code (stmt)) == NOP_EXPR || (gimple_assign_rhs_code
 (stmt)) == CONVERT_EXPR)
    || !tree_nop_conversion_p (TREE_TYPE (op)((contains_struct_check ((op), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1628, __FUNCTION__))->typed.type), TREE_TYPE((contains_struct_check ((gimple_assign_rhs1 (stmt)), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1629, __FUNCTION__))->typed.type)
		 (gimple_assign_rhs1 (stmt))((contains_struct_check ((gimple_assign_rhs1 (stmt)), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1629, __FUNCTION__))->typed.type)))
  return NULL_TREE(tree) nullptr;

return gimple_assign_rhs1 (stmt);
1633}

1635/* Returns true if def-stmt for phi argument ARG is simple increment/decrement
 which is in predicated basic block.
 In fact, the following PHI pattern is searching:
    loop-header:
reduc_1 = PHI <..., reduc_2>
    ...
if (...)
 reduc_3 = ...
reduc_2 = PHI <reduc_1, reduc_3>

 ARG_0 and ARG_1 are correspondent PHI arguments.
 REDUC, OP0 and OP1 contain reduction stmt and its operands.
 EXTENDED is true if PHI has > 2 arguments.  */

1649static bool
1650is_cond_scalar_reduction (gimple *phi, gimple **reduc, tree arg_0, tree arg_1,
	  tree *op0, tree *op1, bool extended, bool* has_nop,
	  gimple **nop_reduc)
1653{
tree lhs, r_op1, r_op2, r_nop1, r_nop2;
gimple *stmt;
gimple *header_phi = NULLnullptr;
enum tree_code reduction_op;
basic_block bb = gimple_bb (phi);
class loop *loop = bb->loop_father;
edge latch_e = loop_latch_edge (loop);
imm_use_iterator imm_iter;
use_operand_p use_p;
edge e;
edge_iterator ei;
bool result = *has_nop = false;
if (TREE_CODE (arg_0)((enum tree_code) (arg_0)->base.code) != SSA_NAME || TREE_CODE (arg_1)((enum tree_code) (arg_1)->base.code) != SSA_NAME)
12
←
Assuming field 'code' is equal to SSA_NAME→
13
←
Assuming field 'code' is equal to SSA_NAME→
  return false;

if (!extended13.1
'extended' is false
 && gimple_code (SSA_NAME_DEF_STMT (arg_0)(tree_check ((arg_0), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1669, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt) == GIMPLE_PHI)
14
←
Assuming the condition is false→
15
←
Taking false branch→
  {
    lhs = arg_1;
    header_phi = SSA_NAME_DEF_STMT (arg_0)(tree_check ((arg_0), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1672, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt;
    stmt = SSA_NAME_DEF_STMT (arg_1)(tree_check ((arg_1), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1673, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt;
  }
else if (gimple_code (SSA_NAME_DEF_STMT (arg_1)(tree_check ((arg_1), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1675, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt) == GIMPLE_PHI)
16
←
Assuming the condition is true→
17
←
Taking true branch→
  {
    lhs = arg_0;
    header_phi = SSA_NAME_DEF_STMT (arg_1)(tree_check ((arg_1), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1678, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt;
    stmt = SSA_NAME_DEF_STMT (arg_0)(tree_check ((arg_0), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1679, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt;
  }
else
  return false;
if (gimple_bb (header_phi) != loop->header)
18
←
Assuming the condition is false→
19
←
Taking false branch→
  return false;

if (PHI_ARG_DEF_FROM_EDGE (header_phi, latch_e)gimple_phi_arg_def (((header_phi)), ((latch_e)->dest_idx)) != PHI_RESULT (phi)get_def_from_ptr (gimple_phi_result_ptr (phi)))
20
←
Assuming the condition is false→
  return false;

if (gimple_code (stmt) != GIMPLE_ASSIGN
21
←
Assuming the condition is false→
23
←
Taking false branch→
    || gimple_has_volatile_ops (stmt))
22
←
Assuming the condition is false→
  return false;

if (!flow_bb_inside_loop_p (loop, gimple_bb (stmt)))
24
←
Assuming the condition is false→
25
←
Taking false branch→
  return false;

if (!is_predicated (gimple_bb (stmt)))
26
←
Taking false branch→
  return false;

/* Check that stmt-block is predecessor of phi-block.  */
FOR_EACH_EDGE (e, ei, gimple_bb (stmt)->succs)for ((ei) = ei_start_1 (&((gimple_bb (stmt)->succs)));
 ei_cond ((ei), &(e)); ei_next (&(ei)))
27
←
Loop condition is true.  Entering loop body→
  if (e->dest == bb)
28
←
Assuming 'bb' is equal to field 'dest'→
29
←
Taking true branch→
    {
result = true;
break;
    }
if (!result30.1
'result' is true
)
30
←
 Execution continues on line 1706→
31
←
Taking false branch→
  return false;

if (!has_single_use (lhs))
32
←
Taking false branch→
  return false;

reduction_op = gimple_assign_rhs_code (stmt);

  /* Catch something like below

   loop-header:
   reduc_1 = PHI <..., reduc_2>
   ...
   if (...)
   tmp1 = (unsigned type) reduc_1;
   tmp2 = tmp1 + rhs2;
   reduc_3 = (signed type) tmp2;

   reduc_2 = PHI <reduc_1, reduc_3>

   and convert to

   reduc_2 = PHI <0, reduc_3>
   tmp1 = (unsigned type)reduce_1;
   ifcvt = cond_expr ? rhs2 : 0
   tmp2 = tmp1 +/- ifcvt;
   reduce_1 = (signed type)tmp2;  */

if (CONVERT_EXPR_CODE_P (reduction_op)((reduction_op) == NOP_EXPR || (reduction_op) == CONVERT_EXPR
))
33
←
Assuming 'reduction_op' is not equal to NOP_EXPR→
34
←
Assuming 'reduction_op' is not equal to CONVERT_EXPR→
  {
    lhs = gimple_assign_rhs1 (stmt);
    if (TREE_CODE (lhs)((enum tree_code) (lhs)->base.code) != SSA_NAME
 || !has_single_use (lhs))
return false;

    *nop_reduc = stmt;
    stmt = SSA_NAME_DEF_STMT (lhs)(tree_check ((lhs), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1742, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt;
    if (gimple_bb (stmt) != gimple_bb (*nop_reduc)
 || !is_gimple_assign (stmt))
return false;

    *has_nop = true;
    reduction_op = gimple_assign_rhs_code (stmt);
  }

if (reduction_op != PLUS_EXPR
35
←
Assuming 'reduction_op' is equal to PLUS_EXPR→
    && reduction_op != MINUS_EXPR
    && reduction_op != MULT_EXPR
    && reduction_op != BIT_IOR_EXPR
    && reduction_op != BIT_XOR_EXPR
    && reduction_op != BIT_AND_EXPR)
  return false;
r_op1 = gimple_assign_rhs1 (stmt);
r_op2 = gimple_assign_rhs2 (stmt);

r_nop1 = strip_nop_cond_scalar_reduction (*has_nop, r_op1);
r_nop2 = strip_nop_cond_scalar_reduction (*has_nop, r_op2);

/* Make R_OP1 to hold reduction variable.  */
if (r_nop2 == PHI_RESULT (header_phi)get_def_from_ptr (gimple_phi_result_ptr (header_phi))
36
←
Assuming the condition is false→
    && commutative_tree_code (reduction_op))
  {
    std::swap (r_op1, r_op2);
    std::swap (r_nop1, r_nop2);
  }
else if (r_nop1 != PHI_RESULT (header_phi)get_def_from_ptr (gimple_phi_result_ptr (header_phi)))
37
←
Assuming the condition is false→
38
←
Taking false branch→
  return false;

if (*has_nop)
39
←
Taking false branch→
  {
    /* Check that R_NOP1 is used in nop_stmt or in PHI only.  */
    FOR_EACH_IMM_USE_FAST (use_p, imm_iter, r_nop1)for ((use_p) = first_readonly_imm_use (&(imm_iter), (r_nop1
)); !end_readonly_imm_use_p (&(imm_iter)); (void) ((use_p
) = next_readonly_imm_use (&(imm_iter))))
{
 gimple *use_stmt = USE_STMT (use_p)(use_p)->loc.stmt;
 if (is_gimple_debug (use_stmt))
   continue;
 if (use_stmt == SSA_NAME_DEF_STMT (r_op1)(tree_check ((r_op1), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1782, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt)
   continue;
 if (use_stmt != phi)
   return false;
}
  }

/* Check that R_OP1 is used in reduction stmt or in PHI only.  */
FOR_EACH_IMM_USE_FAST (use_p, imm_iter, r_op1)for ((use_p) = first_readonly_imm_use (&(imm_iter), (r_op1
)); !end_readonly_imm_use_p (&(imm_iter)); (void) ((use_p
) = next_readonly_imm_use (&(imm_iter))))
40
←
Loop condition is false. Execution continues on line 1801→
  {
    gimple *use_stmt = USE_STMT (use_p)(use_p)->loc.stmt;
    if (is_gimple_debug (use_stmt))
continue;
    if (use_stmt == stmt)
continue;
    if (gimple_code (use_stmt) != GIMPLE_PHI)
return false;
  }

*op0 = r_op1; *op1 = r_op2;
*reduc = stmt;
return true;
41
←
Returning without writing to '*nop_reduc'→
1804}

1806/* Converts conditional scalar reduction into unconditional form, e.g.
   bb_4
     if (_5 != 0) goto bb_5 else goto bb_6
   end_bb_4
   bb_5
     res_6 = res_13 + 1;
   end_bb_5
   bb_6
     # res_2 = PHI <res_13(4), res_6(5)>
   end_bb_6

 will be converted into sequence
  _ifc__1 = _5 != 0 ? 1 : 0;
  res_2 = res_13 + _ifc__1;
Argument SWAP tells that arguments of conditional expression should be
swapped.
Returns rhs of resulting PHI assignment.  */

1824static tree
1825convert_scalar_cond_reduction (gimple *reduc, gimple_stmt_iterator *gsi,
	       tree cond, tree op0, tree op1, bool swap,
	       bool has_nop, gimple* nop_reduc)
1828{
gimple_stmt_iterator stmt_it;
gimple *new_assign;
tree rhs;
tree rhs1 = gimple_assign_rhs1 (reduc);
tree tmp = make_temp_ssa_name (TREE_TYPE (rhs1)((contains_struct_check ((rhs1), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1833, __FUNCTION__))->typed.type), NULLnullptr, "_ifc_");
tree c;
enum tree_code reduction_op  = gimple_assign_rhs_code (reduc);
tree op_nochange = neutral_op_for_reduction (TREE_TYPE (rhs1)((contains_struct_check ((rhs1), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1836, __FUNCTION__))->typed.type), reduction_op, NULLnullptr);
gimple_seq stmts = NULLnullptr;

if (dump_file && (dump_flags & TDF_DETAILS))
  {
    fprintf (dump_file, "Found cond scalar reduction.\n");
    print_gimple_stmt (dump_file, reduc, 0, TDF_SLIM);
  }

/* Build cond expression using COND and constant operand
   of reduction rhs.  */
c = fold_build_cond_expr (TREE_TYPE (rhs1)((contains_struct_check ((rhs1), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1847, __FUNCTION__))->typed.type),
	    unshare_expr (cond),
	    swap ? op_nochange : op1,
	    swap ? op1 : op_nochange);

/* Create assignment stmt and insert it at GSI.  */
new_assign = gimple_build_assign (tmp, c);
gsi_insert_before (gsi, new_assign, GSI_SAME_STMT);
/* Build rhs for unconditional increment/decrement/logic_operation.  */
rhs = gimple_build (&stmts, reduction_op,
      TREE_TYPE (rhs1)((contains_struct_check ((rhs1), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1857, __FUNCTION__))->typed.type), op0, tmp);

if (has_nop)
  {
    rhs = gimple_convert (&stmts,
	    TREE_TYPE (gimple_assign_lhs (nop_reduc))((contains_struct_check ((gimple_assign_lhs (nop_reduc)), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1862, __FUNCTION__))->typed.type), rhs);
    stmt_it = gsi_for_stmt (nop_reduc);
    gsi_remove (&stmt_it, true);
    release_defs (nop_reduc);
  }
gsi_insert_seq_before (gsi, stmts, GSI_SAME_STMT);

/* Delete original reduction stmt.  */
stmt_it = gsi_for_stmt (reduc);
gsi_remove (&stmt_it, true);
release_defs (reduc);
return rhs;
1874}

1876/* Produce condition for all occurrences of ARG in PHI node.  */

1878static tree
1879gen_phi_arg_condition (gphi *phi, vec<int> *occur,
       gimple_stmt_iterator *gsi)
1881{
int len;
int i;
tree cond = NULL_TREE(tree) nullptr;
tree c;
edge e;

len = occur->length ();
gcc_assert (len > 0)((void)(!(len > 0) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1889, __FUNCTION__), 0 : 0));
for (i = 0; i < len; i++)
  {
    e = gimple_phi_arg_edge (phi, (*occur)[i]);
    c = bb_predicate (e->src);
    if (is_true_predicate (c))
{
 cond = c;
 break;
}
    c = force_gimple_operand_gsi (gsi, unshare_expr (c),
		    true, NULL_TREE(tree) nullptr, true, GSI_SAME_STMT);
    if (cond != NULL_TREE(tree) nullptr)
{
 /* Must build OR expression.  */
 cond = fold_or_predicates (EXPR_LOCATION (c)((((c)) && ((tree_code_type_tmpl <0>::tree_code_type
[(int) (((enum tree_code) ((c))->base.code))]) >= tcc_reference
 && (tree_code_type_tmpl <0>::tree_code_type[(int
) (((enum tree_code) ((c))->base.code))]) <= tcc_expression
)) ? (c)->exp.locus : ((location_t) 0)), c, cond);
 cond = force_gimple_operand_gsi (gsi, unshare_expr (cond), true,
			   NULL_TREE(tree) nullptr, true, GSI_SAME_STMT);
}
    else
cond = c;
  }
gcc_assert (cond != NULL_TREE)((void)(!(cond != (tree) nullptr) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1911, __FUNCTION__), 0 : 0));
return cond;
1913}

1915/* Replace a scalar PHI node with a COND_EXPR using COND as condition.
 This routine can handle PHI nodes with more than two arguments.

 For example,
   S1: A = PHI <x1(1), x2(5)>
 is converted into,
   S2: A = cond ? x1 : x2;

 The generated code is inserted at GSI that points to the top of
 basic block's statement list.
 If PHI node has more than two arguments a chain of conditional
 expression is produced.  */


1929static void
1930predicate_scalar_phi (gphi *phi, gimple_stmt_iterator *gsi)
1931{
gimple *new_stmt = NULLnullptr, *reduc, *nop_reduc;
1
'nop_reduc' declared without an initial value→
tree rhs, res, arg0, arg1, op0, op1, scev;
tree cond;
unsigned int index0;
unsigned int max, args_len;
edge e;
basic_block bb;
unsigned int i;
bool has_nop;

res = gimple_phi_result (phi);
if (virtual_operand_p (res))
  return;

if ((rhs = degenerate_phi_result (phi))
2
←
Assuming 'rhs' is null→
    || ((scev = analyze_scalar_evolution (gimple_bb (phi)->loop_father,
3
←
Assuming 'scev' is null→
			    res))
 && !chrec_contains_undetermined (scev)
 && scev != res
 && (rhs = gimple_phi_arg_def (phi, 0))))
  {
    if (dump_file && (dump_flags & TDF_DETAILS))
{
 fprintf (dump_file, "Degenerate phi!\n");
 print_gimple_stmt (dump_file, phi, 0, TDF_SLIM);
}
    new_stmt = gimple_build_assign (res, rhs);
    gsi_insert_before (gsi, new_stmt, GSI_SAME_STMT);
    update_stmt (new_stmt);
    return;
  }

bb = gimple_bb (phi);
if (EDGE_COUNT (bb->preds)vec_safe_length (bb->preds) == 2)
4
←
Assuming the condition is true→
5
←
Taking true branch→
  {
    /* Predicate ordinary PHI node with 2 arguments.  */
    edge first_edge, second_edge;
    basic_block true_bb;
    first_edge = EDGE_PRED (bb, 0)(*(bb)->preds)[(0)];
    second_edge = EDGE_PRED (bb, 1)(*(bb)->preds)[(1)];
    cond = bb_predicate (first_edge->src);
    if (TREE_CODE (cond)((enum tree_code) (cond)->base.code) == TRUTH_NOT_EXPR)
6
←
Assuming field 'code' is not equal to TRUTH_NOT_EXPR→
7
←
Taking false branch→
std::swap (first_edge, second_edge);
    if (EDGE_COUNT (first_edge->src->succs)vec_safe_length (first_edge->src->succs) > 1)
8
←
Taking false branch→
{
 cond = bb_predicate (second_edge->src);
 if (TREE_CODE (cond)((enum tree_code) (cond)->base.code) == TRUTH_NOT_EXPR)
   cond = TREE_OPERAND (cond, 0)(*((const_cast<tree*> (tree_operand_check ((cond), (0),
 "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 1979, __FUNCTION__)))));
 else
   first_edge = second_edge;
}
    else
cond = bb_predicate (first_edge->src);
    /* Gimplify the condition to a valid cond-expr conditonal operand.  */
    cond = force_gimple_operand_gsi (gsi, unshare_expr (cond), true,
		       NULL_TREE(tree) nullptr, true, GSI_SAME_STMT);
    true_bb = first_edge->src;
    if (EDGE_PRED (bb, 1)(*(bb)->preds)[(1)]->src == true_bb)
9
←
Assuming 'true_bb' is not equal to field 'src'→
10
←
Taking false branch→
{
 arg0 = gimple_phi_arg_def (phi, 1);
 arg1 = gimple_phi_arg_def (phi, 0);
}
    else
{
 arg0 = gimple_phi_arg_def (phi, 0);
 arg1 = gimple_phi_arg_def (phi, 1);
}
    if (is_cond_scalar_reduction (phi, &reduc, arg0, arg1,
11
←
Calling 'is_cond_scalar_reduction'→
42
←
Returning from 'is_cond_scalar_reduction'→
43
←
Taking true branch→
		    &op0, &op1, false, &has_nop,
		    &nop_reduc))
{
 /* Convert reduction stmt into vectorizable form.  */
 rhs = convert_scalar_cond_reduction (reduc, gsi, cond, op0, op1,
45
←
8th function call argument is an uninitialized value
			       true_bb != gimple_bb (reduc),
44
←
Assuming the condition is false→
			       has_nop, nop_reduc);
 redundant_ssa_names.safe_push (std::make_pair (res, rhs));
}
    else
/* Build new RHS using selected condition and arguments.  */
rhs = fold_build_cond_expr (TREE_TYPE (res)((contains_struct_check ((res), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2011, __FUNCTION__))->typed.type), unshare_expr (cond),
		    arg0, arg1);
    new_stmt = gimple_build_assign (res, rhs);
    gsi_insert_before (gsi, new_stmt, GSI_SAME_STMT);
    gimple_stmt_iterator new_gsi = gsi_for_stmt (new_stmt);
    if (fold_stmt (&new_gsi, follow_all_ssa_edges))
{
 new_stmt = gsi_stmt (new_gsi);
 update_stmt (new_stmt);
}

    if (dump_file && (dump_flags & TDF_DETAILS))
{
 fprintf (dump_file, "new phi replacement stmt\n");
 print_gimple_stmt (dump_file, new_stmt, 0, TDF_SLIM);
}
    return;
  }

/* Create hashmap for PHI node which contain vector of argument indexes
   having the same value.  */
bool swap = false;
hash_map<tree_operand_hash, auto_vec<int> > phi_arg_map;
unsigned int num_args = gimple_phi_num_args (phi);
int max_ind = -1;
/* Vector of different PHI argument values.  */
auto_vec<tree> args (num_args);

/* Compute phi_arg_map.  */
for (i = 0; i < num_args; i++)
  {
    tree arg;

    arg = gimple_phi_arg_def (phi, i);
    if (!phi_arg_map.get (arg))
args.quick_push (arg);
    phi_arg_map.get_or_insert (arg).safe_push (i);
  }

/* Determine element with max number of occurrences.  */
max_ind = -1;
max = 1;
args_len = args.length ();
for (i = 0; i < args_len; i++)
  {
    unsigned int len;
    if ((len = phi_arg_map.get (args[i])->length ()) > max)
{
 max_ind = (int) i;
 max = len;
}
  }

/* Put element with max number of occurences to the end of ARGS.  */
if (max_ind != -1 && max_ind +1 != (int) args_len)
  std::swap (args[args_len - 1], args[max_ind]);

/* Handle one special case when number of arguments with different values
   is equal 2 and one argument has the only occurrence.  Such PHI can be
   handled as if would have only 2 arguments.  */
if (args_len == 2 && phi_arg_map.get (args[0])->length () == 1)
  {
    vec<int> *indexes;
    indexes = phi_arg_map.get (args[0]);
    index0 = (*indexes)[0];
    arg0 = args[0];
    arg1 = args[1];
    e = gimple_phi_arg_edge (phi, index0);
    cond = bb_predicate (e->src);
    if (TREE_CODE (cond)((enum tree_code) (cond)->base.code) == TRUTH_NOT_EXPR)
{
 swap = true;
 cond = TREE_OPERAND (cond, 0)(*((const_cast<tree*> (tree_operand_check ((cond), (0),
 "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2083, __FUNCTION__)))));
}
    /* Gimplify the condition to a valid cond-expr conditonal operand.  */
    cond = force_gimple_operand_gsi (gsi, unshare_expr (cond), true,
		       NULL_TREE(tree) nullptr, true, GSI_SAME_STMT);
    if (!(is_cond_scalar_reduction (phi, &reduc, arg0 , arg1,
		      &op0, &op1, true, &has_nop, &nop_reduc)))
rhs = fold_build_cond_expr (TREE_TYPE (res)((contains_struct_check ((res), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2090, __FUNCTION__))->typed.type), unshare_expr (cond),
		    swap? arg1 : arg0,
		    swap? arg0 : arg1);
    else
{
 /* Convert reduction stmt into vectorizable form.  */
 rhs = convert_scalar_cond_reduction (reduc, gsi, cond, op0, op1,
			       swap,has_nop, nop_reduc);
 redundant_ssa_names.safe_push (std::make_pair (res, rhs));
}
    new_stmt = gimple_build_assign (res, rhs);
    gsi_insert_before (gsi, new_stmt, GSI_SAME_STMT);
    update_stmt (new_stmt);
  }
else
  {
    /* Common case.  */
    vec<int> *indexes;
    tree type = TREE_TYPE (gimple_phi_result (phi))((contains_struct_check ((gimple_phi_result (phi)), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2108, __FUNCTION__))->typed.type);
    tree lhs;
    arg1 = args[1];
    for (i = 0; i < args_len; i++)
{
 arg0 = args[i];
 indexes = phi_arg_map.get (args[i]);
 if (i != args_len - 1)
   lhs = make_temp_ssa_name (type, NULLnullptr, "_ifc_");
 else
   lhs = res;
 cond = gen_phi_arg_condition (phi, indexes, gsi);
 rhs = fold_build_cond_expr (type, unshare_expr (cond),
		      arg0, arg1);
 new_stmt = gimple_build_assign (lhs, rhs);
 gsi_insert_before (gsi, new_stmt, GSI_SAME_STMT);
 update_stmt (new_stmt);
 arg1 = lhs;
}
  }

if (dump_file && (dump_flags & TDF_DETAILS))
  {
    fprintf (dump_file, "new extended phi replacement stmt\n");
    print_gimple_stmt (dump_file, new_stmt, 0, TDF_SLIM);
  }
2134}

2136/* Replaces in LOOP all the scalar phi nodes other than those in the
 LOOP->header block with conditional modify expressions.  */

2139static void
2140predicate_all_scalar_phis (class loop *loop)
2141{
basic_block bb;
unsigned int orig_loop_num_nodes = loop->num_nodes;
unsigned int i;

for (i = 1; i < orig_loop_num_nodes; i++)
  {
    gphi *phi;
    gimple_stmt_iterator gsi;
    gphi_iterator phi_gsi;
    bb = ifc_bbs[i];

    if (bb == loop->header)
continue;

    phi_gsi = gsi_start_phis (bb);
    if (gsi_end_p (phi_gsi))
continue;

    gsi = gsi_after_labels (bb);
    while (!gsi_end_p (phi_gsi))
{
 phi = phi_gsi.phi ();
 if (virtual_operand_p (gimple_phi_result (phi)))
   gsi_next (&phi_gsi);
 else
   {
     predicate_scalar_phi (phi, &gsi);
     remove_phi_node (&phi_gsi, false);
   }
}
  }
2173}

2175/* Insert in each basic block of LOOP the statements produced by the
 gimplification of the predicates.  */

2178static void
2179insert_gimplified_predicates (loop_p loop)
2180{
unsigned int i;

for (i = 0; i < loop->num_nodes; i++)
  {
    basic_block bb = ifc_bbs[i];
    gimple_seq stmts;
    if (!is_predicated (bb))
gcc_assert (bb_predicate_gimplified_stmts (bb) == NULL)((void)(!(bb_predicate_gimplified_stmts (bb) == nullptr) ? fancy_abort
 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2188, __FUNCTION__), 0 : 0));
    if (!is_predicated (bb))
{
 /* Do not insert statements for a basic block that is not
    predicated.  Also make sure that the predicate of the
    basic block is set to true.  */
 reset_bb_predicate (bb);
 continue;
}

    stmts = bb_predicate_gimplified_stmts (bb);
    if (stmts)
{
 if (need_to_predicate)
   {
     /* Insert the predicate of the BB just after the label,
 as the if-conversion of memory writes will use this
 predicate.  */
     gimple_stmt_iterator gsi = gsi_after_labels (bb);
     gsi_insert_seq_before (&gsi, stmts, GSI_SAME_STMT);
   }
 else
   {
     /* Insert the predicate of the BB at the end of the BB
 as this would reduce the register pressure: the only
 use of this predicate will be in successor BBs.  */
     gimple_stmt_iterator gsi = gsi_last_bb (bb);

     if (gsi_end_p (gsi)
  || stmt_ends_bb_p (gsi_stmt (gsi)))
gsi_insert_seq_before (&gsi, stmts, GSI_SAME_STMT);
     else
gsi_insert_seq_after (&gsi, stmts, GSI_SAME_STMT);
   }

 /* Once the sequence is code generated, set it to NULL.  */
 set_bb_predicate_gimplified_stmts (bb, NULLnullptr);
}
  }
2227}

2229/* Helper function for predicate_statements. Returns index of existent
 mask if it was created for given SIZE and -1 otherwise.  */

2232static int
2233mask_exists (int size, const vec<int> &vec)
2234{
unsigned int ix;
int v;
FOR_EACH_VEC_ELT (vec, ix, v)for (ix = 0; (vec).iterate ((ix), &(v)); ++(ix))
  if (v == size)
    return (int) ix;
return -1;
2241}

2243/* Helper function for predicate_statements.  STMT is a memory read or
 write and it needs to be predicated by MASK.  Return a statement
 that does so.  */

2247static gimple *
2248predicate_load_or_store (gimple_stmt_iterator *gsi, gassign *stmt, tree mask)
2249{
gcall *new_stmt;

tree lhs = gimple_assign_lhs (stmt);
tree rhs = gimple_assign_rhs1 (stmt);
tree ref = TREE_CODE (lhs)((enum tree_code) (lhs)->base.code) == SSA_NAME ? rhs : lhs;
mark_addressable (ref);
tree addr = force_gimple_operand_gsi (gsi, build_fold_addr_expr (ref)build_fold_addr_expr_loc (((location_t) 0), (ref)),
			true, NULL_TREE(tree) nullptr, true, GSI_SAME_STMT);
tree ptr = build_int_cst (reference_alias_ptr_type (ref),
	    get_object_alignment (ref));
/* Copy points-to info if possible.  */
if (TREE_CODE (addr)((enum tree_code) (addr)->base.code) == SSA_NAME && !SSA_NAME_PTR_INFO (addr)(tree_check ((addr), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2261, __FUNCTION__, (SSA_NAME)))->ssa_name.info.ptr_info)
  copy_ref_info (build2 (MEM_REF, TREE_TYPE (ref)((contains_struct_check ((ref), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2262, __FUNCTION__))->typed.type), addr, ptr),
   ref);
if (TREE_CODE (lhs)((enum tree_code) (lhs)->base.code) == SSA_NAME)
  {
    new_stmt
= gimple_build_call_internal (IFN_MASK_LOAD, 3, addr,
		      ptr, mask);
    gimple_call_set_lhs (new_stmt, lhs);
    gimple_set_vuse (new_stmt, gimple_vuse (stmt));
  }
else
  {
    new_stmt
= gimple_build_call_internal (IFN_MASK_STORE, 4, addr, ptr,
		      mask, rhs);
    gimple_move_vops (new_stmt, stmt);
  }
gimple_call_set_nothrow (new_stmt, true);
return new_stmt;
2281}

2283/* STMT uses OP_LHS.  Check whether it is equivalent to:

   ... = OP_MASK ? OP_LHS : X;

 Return X if so, otherwise return null.  OP_MASK is an SSA_NAME that is
 known to have value OP_COND.  */

2290static tree
2291check_redundant_cond_expr (gimple *stmt, tree op_mask, tree op_cond,
	   tree op_lhs)
2293{
gassign *assign = dyn_cast <gassign *> (stmt);
if (!assign || gimple_assign_rhs_code (assign) != COND_EXPR)
  return NULL_TREE(tree) nullptr;

tree use_cond = gimple_assign_rhs1 (assign);
tree if_true = gimple_assign_rhs2 (assign);
tree if_false = gimple_assign_rhs3 (assign);

if ((use_cond == op_mask || operand_equal_p (use_cond, op_cond, 0))
    && if_true == op_lhs)
  return if_false;

if (inverse_conditions_p (use_cond, op_cond) && if_false == op_lhs)
  return if_true;

return NULL_TREE(tree) nullptr;
2310}

2312/* Return true if VALUE is available for use at STMT.  SSA_NAMES is
 the set of SSA names defined earlier in STMT's block.  */

2315static bool
2316value_available_p (gimple *stmt, hash_set<tree_ssa_name_hash> *ssa_names,
   tree value)
2318{
if (is_gimple_min_invariant (value))
  return true;

if (TREE_CODE (value)((enum tree_code) (value)->base.code) == SSA_NAME)
  {
    if (SSA_NAME_IS_DEFAULT_DEF (value)(tree_check ((value), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2324, __FUNCTION__, (SSA_NAME)))->base.default_def_flag)
return true;

    basic_block def_bb = gimple_bb (SSA_NAME_DEF_STMT (value)(tree_check ((value), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2327, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt);
    basic_block use_bb = gimple_bb (stmt);
    return (def_bb == use_bb
     ? ssa_names->contains (value)
     : dominated_by_p (CDI_DOMINATORS, use_bb, def_bb));
  }

return false;
2335}

2337/* Helper function for predicate_statements.  STMT is a potentially-trapping
 arithmetic operation that needs to be predicated by MASK, an SSA_NAME that
 has value COND.  Return a statement that does so.  SSA_NAMES is the set of
 SSA names defined earlier in STMT's block.  */

2342static gimple *
2343predicate_rhs_code (gassign *stmt, tree mask, tree cond,
    hash_set<tree_ssa_name_hash> *ssa_names)
2345{
tree lhs = gimple_assign_lhs (stmt);
tree_code code = gimple_assign_rhs_code (stmt);
unsigned int nops = gimple_num_ops (stmt);
internal_fn cond_fn = get_conditional_internal_fn (code);

/* Construct the arguments to the conditional internal function.   */
auto_vec<tree, 8> args;
args.safe_grow (nops + 1, true);
args[0] = mask;
for (unsigned int i = 1; i < nops; ++i)
  args[i] = gimple_op (stmt, i);
args[nops] = NULL_TREE(tree) nullptr;

/* Look for uses of the result to see whether they are COND_EXPRs that can
   be folded into the conditional call.  */
imm_use_iterator imm_iter;
gimple *use_stmt;
FOR_EACH_IMM_USE_STMT (use_stmt, imm_iter, lhs)for (struct auto_end_imm_use_stmt_traverse auto_end_imm_use_stmt_traverse
 ((((use_stmt) = first_imm_use_stmt (&(imm_iter), (lhs)))
, &(imm_iter))); !end_imm_use_stmt_p (&(imm_iter)); (
void) ((use_stmt) = next_imm_use_stmt (&(imm_iter))))
  {
    tree new_else = check_redundant_cond_expr (use_stmt, mask, cond, lhs);
    if (new_else && value_available_p (stmt, ssa_names, new_else))
{
 if (!args[nops])
   args[nops] = new_else;
 if (operand_equal_p (new_else, args[nops], 0))
   {
     /* We have:

   LHS = IFN_COND (MASK, ..., ELSE);
   X = MASK ? LHS : ELSE;

 which makes X equivalent to LHS.  */
     tree use_lhs = gimple_assign_lhs (use_stmt);
     redundant_ssa_names.safe_push (std::make_pair (use_lhs, lhs));
   }
}
  }
if (!args[nops])
  args[nops] = targetm.preferred_else_value (cond_fn, TREE_TYPE (lhs)((contains_struct_check ((lhs), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2384, __FUNCTION__))->typed.type),
			       nops - 1, &args[1]);

/* Create and insert the call.  */
gcall *new_stmt = gimple_build_call_internal_vec (cond_fn, args);
gimple_call_set_lhs (new_stmt, lhs);
gimple_call_set_nothrow (new_stmt, true);

return new_stmt;
2393}

2395/* Predicate each write to memory in LOOP.

 This function transforms control flow constructs containing memory
 writes of the form:

 | for (i = 0; i < N; i++)
 |   if (cond)
 |     A[i] = expr;

 into the following form that does not contain control flow:

 | for (i = 0; i < N; i++)
 |   A[i] = cond ? expr : A[i];

 The original CFG looks like this:

 | bb_0
 |   i = 0
 | end_bb_0
 |
 | bb_1
 |   if (i < N) goto bb_5 else goto bb_2
 | end_bb_1
 |
 | bb_2
 |   cond = some_computation;
 |   if (cond) goto bb_3 else goto bb_4
 | end_bb_2
 |
 | bb_3
 |   A[i] = expr;
 |   goto bb_4
 | end_bb_3
 |
 | bb_4
 |   goto bb_1
 | end_bb_4

 insert_gimplified_predicates inserts the computation of the COND
 expression at the beginning of the destination basic block:

 | bb_0
 |   i = 0
 | end_bb_0
 |
 | bb_1
 |   if (i < N) goto bb_5 else goto bb_2
 | end_bb_1
 |
 | bb_2
 |   cond = some_computation;
 |   if (cond) goto bb_3 else goto bb_4
 | end_bb_2
 |
 | bb_3
 |   cond = some_computation;
 |   A[i] = expr;
 |   goto bb_4
 | end_bb_3
 |
 | bb_4
 |   goto bb_1
 | end_bb_4

 predicate_statements is then predicating the memory write as follows:

 | bb_0
 |   i = 0
 | end_bb_0
 |
 | bb_1
 |   if (i < N) goto bb_5 else goto bb_2
 | end_bb_1
 |
 | bb_2
 |   if (cond) goto bb_3 else goto bb_4
 | end_bb_2
 |
 | bb_3
 |   cond = some_computation;
 |   A[i] = cond ? expr : A[i];
 |   goto bb_4
 | end_bb_3
 |
 | bb_4
 |   goto bb_1
 | end_bb_4

 and finally combine_blocks removes the basic block boundaries making
 the loop vectorizable:

 | bb_0
 |   i = 0
 |   if (i < N) goto bb_5 else goto bb_1
 | end_bb_0
 |
 | bb_1
 |   cond = some_computation;
 |   A[i] = cond ? expr : A[i];
 |   if (i < N) goto bb_5 else goto bb_4
 | end_bb_1
 |
 | bb_4
 |   goto bb_1
 | end_bb_4
2500*/

2502static void
2503predicate_statements (loop_p loop)
2504{
unsigned int i, orig_loop_num_nodes = loop->num_nodes;
auto_vec<int, 1> vect_sizes;
auto_vec<tree, 1> vect_masks;
hash_set<tree_ssa_name_hash> ssa_names;

for (i = 1; i < orig_loop_num_nodes; i++)
  {
    gimple_stmt_iterator gsi;
    basic_block bb = ifc_bbs[i];
    tree cond = bb_predicate (bb);
    bool swap;
    int index;

    if (is_true_predicate (cond))
continue;

    swap = false;
    if (TREE_CODE (cond)((enum tree_code) (cond)->base.code) == TRUTH_NOT_EXPR)
{
 swap = true;
 cond = TREE_OPERAND (cond, 0)(*((const_cast<tree*> (tree_operand_check ((cond), (0),
 "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2525, __FUNCTION__)))));
}

    vect_sizes.truncate (0);
    vect_masks.truncate (0);

    for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi);)
{
 gassign *stmt = dyn_cast <gassign *> (gsi_stmt (gsi));
 tree lhs;
 if (!stmt)
   ;
 else if (is_false_predicate (cond)
   && gimple_vdef (stmt))
   {
     unlink_stmt_vdef (stmt);
     gsi_remove (&gsi, true);
     release_defs (stmt);
     continue;
   }
 else if (gimple_plf (stmt, GF_PLF_2)
   && is_gimple_assign (stmt))
   {
     tree lhs = gimple_assign_lhs (stmt);
     tree mask;
     gimple *new_stmt;
     gimple_seq stmts = NULLnullptr;
     machine_mode mode = TYPE_MODE (TREE_TYPE (lhs))((((enum tree_code) ((tree_class_check ((((contains_struct_check
 ((lhs), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2552, __FUNCTION__))->typed.type)), (tcc_type), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2552, __FUNCTION__)))->base.code) == VECTOR_TYPE) ? vector_type_mode
 (((contains_struct_check ((lhs), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2552, __FUNCTION__))->typed.type)) : (((contains_struct_check
 ((lhs), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2552, __FUNCTION__))->typed.type))->type_common.mode);
     /* We checked before setting GF_PLF_2 that an equivalent
 integer mode exists.  */
     int bitsize = GET_MODE_BITSIZE (mode).to_constant ();
     if (!vect_sizes.is_empty ()
  && (index = mask_exists (bitsize, vect_sizes)) != -1)
/* Use created mask.  */
mask = vect_masks[index];
     else
{
  if (COMPARISON_CLASS_P (cond)(tree_code_type_tmpl <0>::tree_code_type[(int) (((enum tree_code
) (cond)->base.code))] == tcc_comparison))
    mask = gimple_build (&stmts, TREE_CODE (cond)((enum tree_code) (cond)->base.code),
			 boolean_type_nodeglobal_trees[TI_BOOLEAN_TYPE],
			 TREE_OPERAND (cond, 0)(*((const_cast<tree*> (tree_operand_check ((cond), (0),
 "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2565, __FUNCTION__))))),
			 TREE_OPERAND (cond, 1)(*((const_cast<tree*> (tree_operand_check ((cond), (1),
 "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2566, __FUNCTION__))))));
  else
    mask = cond;

  if (swap)
    {
      tree true_val
	= constant_boolean_node (true, TREE_TYPE (mask)((contains_struct_check ((mask), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2573, __FUNCTION__))->typed.type));
      mask = gimple_build (&stmts, BIT_XOR_EXPR,
			   TREE_TYPE (mask)((contains_struct_check ((mask), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2575, __FUNCTION__))->typed.type), mask, true_val);
    }
  gsi_insert_seq_before (&gsi, stmts, GSI_SAME_STMT);

  /* Save mask and its size for further use.  */
  vect_sizes.safe_push (bitsize);
  vect_masks.safe_push (mask);
}
     if (gimple_assign_single_p (stmt))
new_stmt = predicate_load_or_store (&gsi, stmt, mask);
     else
new_stmt = predicate_rhs_code (stmt, mask, cond, &ssa_names);

     gsi_replace (&gsi, new_stmt, true);
   }
 else if (((lhs = gimple_assign_lhs (stmt)), true)
   && (INTEGRAL_TYPE_P (TREE_TYPE (lhs))(((enum tree_code) (((contains_struct_check ((lhs), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2591, __FUNCTION__))->typed.type))->base.code) == ENUMERAL_TYPE
 || ((enum tree_code) (((contains_struct_check ((lhs), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2591, __FUNCTION__))->typed.type))->base.code) == BOOLEAN_TYPE
 || ((enum tree_code) (((contains_struct_check ((lhs), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2591, __FUNCTION__))->typed.type))->base.code) == INTEGER_TYPE
)
       || POINTER_TYPE_P (TREE_TYPE (lhs))(((enum tree_code) (((contains_struct_check ((lhs), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2592, __FUNCTION__))->typed.type))->base.code) == POINTER_TYPE
 || ((enum tree_code) (((contains_struct_check ((lhs), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2592, __FUNCTION__))->typed.type))->base.code) == REFERENCE_TYPE
))
   && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (lhs))((((enum tree_code) (((contains_struct_check ((lhs), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2593, __FUNCTION__))->typed.type))->base.code) == POINTER_TYPE
 || ((enum tree_code) (((contains_struct_check ((lhs), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2593, __FUNCTION__))->typed.type))->base.code) == REFERENCE_TYPE
) ? !global_options.x_flag_wrapv_pointer : (!(any_integral_type_check
 ((((contains_struct_check ((lhs), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2593, __FUNCTION__))->typed.type)), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2593, __FUNCTION__))->base.u.bits.unsigned_flag &&
 !global_options.x_flag_wrapv && !global_options.x_flag_trapv
))
   && arith_code_with_undefined_signed_overflow
				(gimple_assign_rhs_code (stmt)))
   {
     gsi_remove (&gsi, true);
     gimple_seq stmts = rewrite_to_defined_overflow (stmt);
     bool first = true;
     for (gimple_stmt_iterator gsi2 = gsi_start (stmts);
   !gsi_end_p (gsi2);)
{
  gassign *stmt2 = as_a <gassign *> (gsi_stmt (gsi2));
  gsi_remove (&gsi2, false);
  if (first)
    {
      gsi_insert_before (&gsi, stmt2, GSI_NEW_STMT);
      first = false;
    }
  else
    gsi_insert_after (&gsi, stmt2, GSI_NEW_STMT);
}
   }
 else if (gimple_vdef (stmt))
   {
     tree lhs = gimple_assign_lhs (stmt);
     tree rhs = gimple_assign_rhs1 (stmt);
     tree type = TREE_TYPE (lhs)((contains_struct_check ((lhs), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2618, __FUNCTION__))->typed.type);

     lhs = ifc_temp_var (type, unshare_expr (lhs), &gsi);
     rhs = ifc_temp_var (type, unshare_expr (rhs), &gsi);
     if (swap)
std::swap (lhs, rhs);
     cond = force_gimple_operand_gsi (&gsi, unshare_expr (cond), true,
			       NULL_TREE(tree) nullptr, true, GSI_SAME_STMT);
     rhs = fold_build_cond_expr (type, unshare_expr (cond), rhs, lhs);
     gimple_assign_set_rhs1 (stmt, ifc_temp_var (type, rhs, &gsi));
     update_stmt (stmt);
   }
 else if (gimple_plf (stmt, GF_PLF_2)
   && is_gimple_call (stmt))
   {
     /* Convert functions that have a SIMD clone to IFN_MASK_CALL.
 This will cause the vectorizer to match the "in branch"
 clone variants, and serves to build the mask vector
 in a natural way.  */
     gcall *call = dyn_cast <gcall *> (gsi_stmt (gsi));
     tree orig_fn = gimple_call_fn (call);
     int orig_nargs = gimple_call_num_args (call);
     auto_vec<tree> args;
     args.safe_push (orig_fn);
     for (int i = 0; i < orig_nargs; i++)
args.safe_push (gimple_call_arg (call, i));
     args.safe_push (cond);

     /* Replace the call with a IFN_MASK_CALL that has the extra
 condition parameter. */
     gcall *new_call = gimple_build_call_internal_vec (IFN_MASK_CALL,
						args);
     gimple_call_set_lhs (new_call, gimple_call_lhs (call));
     gsi_replace (&gsi, new_call, true);
   }

 lhs = gimple_get_lhs (gsi_stmt (gsi));
 if (lhs && TREE_CODE (lhs)((enum tree_code) (lhs)->base.code) == SSA_NAME)
   ssa_names.add (lhs);
 gsi_next (&gsi);
}
    ssa_names.empty ();
  }
2661}

2663/* Remove all GIMPLE_CONDs and GIMPLE_LABELs of all the basic blocks
 other than the exit and latch of the LOOP.  Also resets the
 GIMPLE_DEBUG information.  */

2667static void
2668remove_conditions_and_labels (loop_p loop)
2669{
gimple_stmt_iterator gsi;
unsigned int i;

for (i = 0; i < loop->num_nodes; i++)
  {
    basic_block bb = ifc_bbs[i];

    if (bb_with_exit_edge_p (loop, bb)
 || bb == loop->latch)
continue;

    for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); )
switch (gimple_code (gsi_stmt (gsi)))
 {
 case GIMPLE_COND:
 case GIMPLE_LABEL:
   gsi_remove (&gsi, true);
   break;

 case GIMPLE_DEBUG:
   /* ??? Should there be conditional GIMPLE_DEBUG_BINDs?  */
   if (gimple_debug_bind_p (gsi_stmt (gsi)))
     {
gimple_debug_bind_reset_value (gsi_stmt (gsi));
update_stmt (gsi_stmt (gsi));
     }
   gsi_next (&gsi);
   break;

 default:
   gsi_next (&gsi);
 }
  }
2703}

2705/* Combine all the basic blocks from LOOP into one or two super basic
 blocks.  Replace PHI nodes with conditional modify expressions.  */

2708static void
2709combine_blocks (class loop *loop)
2710{
basic_block bb, exit_bb, merge_target_bb;
unsigned int orig_loop_num_nodes = loop->num_nodes;
unsigned int i;
edge e;
edge_iterator ei;

remove_conditions_and_labels (loop);
insert_gimplified_predicates (loop);
predicate_all_scalar_phis (loop);

if (need_to_predicate || need_to_rewrite_undefined)
  predicate_statements (loop);

/* Merge basic blocks.  */
exit_bb = NULLnullptr;
bool *predicated = XNEWVEC (bool, orig_loop_num_nodes)((bool *) xmalloc (sizeof (bool) * (orig_loop_num_nodes)));
for (i = 0; i < orig_loop_num_nodes; i++)
  {
    bb = ifc_bbs[i];
    predicated[i] = !is_true_predicate (bb_predicate (bb));
    free_bb_predicate (bb);
    if (bb_with_exit_edge_p (loop, bb))
{
 gcc_assert (exit_bb == NULL)((void)(!(exit_bb == nullptr) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2734, __FUNCTION__), 0 : 0));
 exit_bb = bb;
}
  }
gcc_assert (exit_bb != loop->latch)((void)(!(exit_bb != loop->latch) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2738, __FUNCTION__), 0 : 0));

merge_target_bb = loop->header;

/* Get at the virtual def valid for uses starting at the first block
   we merge into the header.  Without a virtual PHI the loop has the
   same virtual use on all stmts.  */
gphi *vphi = get_virtual_phi (loop->header);
tree last_vdef = NULL_TREE(tree) nullptr;
if (vphi)
  {
    last_vdef = gimple_phi_result (vphi);
    for (gimple_stmt_iterator gsi = gsi_start_bb (loop->header);
  ! gsi_end_p (gsi); gsi_next (&gsi))
if (gimple_vdef (gsi_stmt (gsi)))
 last_vdef = gimple_vdef (gsi_stmt (gsi));
  }
for (i = 1; i < orig_loop_num_nodes; i++)
  {
    gimple_stmt_iterator gsi;
    gimple_stmt_iterator last;

    bb = ifc_bbs[i];

    if (bb == exit_bb || bb == loop->latch)
continue;

    /* We release virtual PHIs late because we have to propagate them
       out using the current VUSE.  The def might be the one used
after the loop.  */
    vphi = get_virtual_phi (bb);
    if (vphi)
{
 /* When there's just loads inside the loop a stray virtual
    PHI merging the uses can appear, update last_vdef from
    it.  */
 if (!last_vdef)
   last_vdef = gimple_phi_arg_def (vphi, 0);
 imm_use_iterator iter;
 use_operand_p use_p;
 gimple *use_stmt;
 FOR_EACH_IMM_USE_STMT (use_stmt, iter, gimple_phi_result (vphi))for (struct auto_end_imm_use_stmt_traverse auto_end_imm_use_stmt_traverse
 ((((use_stmt) = first_imm_use_stmt (&(iter), (gimple_phi_result
 (vphi)))), &(iter))); !end_imm_use_stmt_p (&(iter));
 (void) ((use_stmt) = next_imm_use_stmt (&(iter))))
   {
     FOR_EACH_IMM_USE_ON_STMT (use_p, iter)for ((use_p) = first_imm_use_on_stmt (&(iter)); !end_imm_use_on_stmt_p
 (&(iter)); (void) ((use_p) = next_imm_use_on_stmt (&
(iter))))
SET_USE (use_p, last_vdef)set_ssa_use_from_ptr (use_p, last_vdef);
   }
 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (gimple_phi_result (vphi))(tree_check ((gimple_phi_result (vphi)), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2784, __FUNCTION__, (SSA_NAME)))->base.asm_written_flag)
   SSA_NAME_OCCURS_IN_ABNORMAL_PHI (last_vdef)(tree_check ((last_vdef), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2785, __FUNCTION__, (SSA_NAME)))->base.asm_written_flag = 1;
 gsi = gsi_for_stmt (vphi); 
 remove_phi_node (&gsi, true);
}

    /* Make stmts member of loop->header and clear range info from all stmts
in BB which is now no longer executed conditional on a predicate we
could have derived it from.  */
    for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
{
 gimple *stmt = gsi_stmt (gsi);
 gimple_set_bb (stmt, merge_target_bb);
 /* Update virtual operands.  */
 if (last_vdef)
   {
     use_operand_p use_p = ssa_vuse_operand (stmt);
     if (use_p
  && USE_FROM_PTR (use_p)get_use_from_ptr (use_p) != last_vdef)
SET_USE (use_p, last_vdef)set_ssa_use_from_ptr (use_p, last_vdef);
     if (gimple_vdef (stmt))
last_vdef = gimple_vdef (stmt);
   }
 else
   /* If this is the first load we arrive at update last_vdef
      so we handle stray PHIs correctly.  */
   last_vdef = gimple_vuse (stmt);
 if (predicated[i])
   {
     ssa_op_iter i;
     tree op;
     FOR_EACH_SSA_TREE_OPERAND (op, stmt, i, SSA_OP_DEF)for (op = op_iter_init_tree (&(i), stmt, 0x02); !op_iter_done
 (&(i)); (void) (op = op_iter_next_tree (&(i))))
reset_flow_sensitive_info (op);
   }
}

    /* Update stmt list.  */
    last = gsi_last_bb (merge_target_bb);
    gsi_insert_seq_after_without_update (&last, bb_seq (bb), GSI_NEW_STMT);
    set_bb_seq (bb, NULLnullptr);
  }

/* Fixup virtual operands in the exit block.  */
if (exit_bb
    && exit_bb != loop->header)
  {
    /* We release virtual PHIs late because we have to propagate them
       out using the current VUSE.  The def might be the one used
after the loop.  */
    vphi = get_virtual_phi (exit_bb);
    if (vphi)
{
 /* When there's just loads inside the loop a stray virtual
    PHI merging the uses can appear, update last_vdef from
    it.  */
 if (!last_vdef)
   last_vdef = gimple_phi_arg_def (vphi, 0);
 imm_use_iterator iter;
 use_operand_p use_p;
 gimple *use_stmt;
 FOR_EACH_IMM_USE_STMT (use_stmt, iter, gimple_phi_result (vphi))for (struct auto_end_imm_use_stmt_traverse auto_end_imm_use_stmt_traverse
 ((((use_stmt) = first_imm_use_stmt (&(iter), (gimple_phi_result
 (vphi)))), &(iter))); !end_imm_use_stmt_p (&(iter));
 (void) ((use_stmt) = next_imm_use_stmt (&(iter))))
   {
     FOR_EACH_IMM_USE_ON_STMT (use_p, iter)for ((use_p) = first_imm_use_on_stmt (&(iter)); !end_imm_use_on_stmt_p
 (&(iter)); (void) ((use_p) = next_imm_use_on_stmt (&
(iter))))
SET_USE (use_p, last_vdef)set_ssa_use_from_ptr (use_p, last_vdef);
   }
 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (gimple_phi_result (vphi))(tree_check ((gimple_phi_result (vphi)), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2849, __FUNCTION__, (SSA_NAME)))->base.asm_written_flag)
   SSA_NAME_OCCURS_IN_ABNORMAL_PHI (last_vdef)(tree_check ((last_vdef), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 2850, __FUNCTION__, (SSA_NAME)))->base.asm_written_flag = 1;
 gimple_stmt_iterator gsi = gsi_for_stmt (vphi); 
 remove_phi_node (&gsi, true);
}
  }

/* Now remove all the edges in the loop, except for those from the exit
   block and delete the blocks we elided.  */
for (i = 1; i < orig_loop_num_nodes; i++)
  {
    bb = ifc_bbs[i];

    for (ei = ei_start (bb->preds)ei_start_1 (&(bb->preds)); (e = ei_safe_edge (ei));)
{
 if (e->src == exit_bb)
   ei_next (&ei);
 else
   remove_edge (e);
}
  }
for (i = 1; i < orig_loop_num_nodes; i++)
  {
    bb = ifc_bbs[i];

    if (bb == exit_bb || bb == loop->latch)
continue;

    delete_basic_block (bb);
  }

/* Re-connect the exit block.  */
if (exit_bb != NULLnullptr)
  {
    if (exit_bb != loop->header)
{
 /* Connect this node to loop header.  */
 make_single_succ_edge (loop->header, exit_bb, EDGE_FALLTHRU);
 set_immediate_dominator (CDI_DOMINATORS, exit_bb, loop->header);
}

    /* Redirect non-exit edges to loop->latch.  */
    FOR_EACH_EDGE (e, ei, exit_bb->succs)for ((ei) = ei_start_1 (&((exit_bb->succs))); ei_cond (
(ei), &(e)); ei_next (&(ei)))
{
 if (!loop_exit_edge_p (loop, e))
   redirect_edge_and_branch (e, loop->latch);
}
    set_immediate_dominator (CDI_DOMINATORS, loop->latch, exit_bb);
  }
else
  {
    /* If the loop does not have an exit, reconnect header and latch.  */
    make_edge (loop->header, loop->latch, EDGE_FALLTHRU);
    set_immediate_dominator (CDI_DOMINATORS, loop->latch, loop->header);
  }

/* If possible, merge loop header to the block with the exit edge.
   This reduces the number of basic blocks to two, to please the
   vectorizer that handles only loops with two nodes.  */
if (exit_bb
    && exit_bb != loop->header)
  {
    if (can_merge_blocks_p (loop->header, exit_bb))
merge_blocks (loop->header, exit_bb);
  }

free (ifc_bbs);
ifc_bbs = NULLnullptr;
free (predicated);
2918}

2920/* Version LOOP before if-converting it; the original loop
 will be if-converted, the new copy of the loop will not,
 and the LOOP_VECTORIZED internal call will be guarding which
 loop to execute.  The vectorizer pass will fold this
 internal call into either true or false. 

 Note that this function intentionally invalidates profile.  Both edges
 out of LOOP_VECTORIZED must have 100% probability so the profile remains
 consistent after the condition is folded in the vectorizer.  */

2930static class loop *
2931version_loop_for_if_conversion (class loop *loop, vec<gimple *> *preds)
2932{
basic_block cond_bb;
tree cond = make_ssa_name (boolean_type_nodeglobal_trees[TI_BOOLEAN_TYPE]);
class loop *new_loop;
gimple *g;
gimple_stmt_iterator gsi;
unsigned int save_length = 0;

g = gimple_build_call_internal (IFN_LOOP_VECTORIZED, 2,
		  build_int_cst (integer_type_nodeinteger_types[itk_int], loop->num),
		  integer_zero_nodeglobal_trees[TI_INTEGER_ZERO]);
gimple_call_set_lhs (g, cond);

void **saved_preds = NULLnullptr;
if (any_complicated_phi || need_to_predicate)
  {
    /* Save BB->aux around loop_version as that uses the same field.  */
    save_length = loop->inner ? loop->inner->num_nodes : loop->num_nodes;
    saved_preds = XALLOCAVEC (void *, save_length)((void * *) __builtin_alloca(sizeof (void *) * (save_length))
);
    for (unsigned i = 0; i < save_length; i++)
saved_preds[i] = ifc_bbs[i]->aux;
  }

initialize_original_copy_tables ();
/* At this point we invalidate porfile confistency until IFN_LOOP_VECTORIZED
   is re-merged in the vectorizer.  */
new_loop = loop_version (loop, cond, &cond_bb,
	   profile_probability::always (),
	   profile_probability::always (),
	   profile_probability::always (),
	   profile_probability::always (), true);
free_original_copy_tables ();

if (any_complicated_phi || need_to_predicate)
  for (unsigned i = 0; i < save_length; i++)
    ifc_bbs[i]->aux = saved_preds[i];

if (new_loop == NULLnullptr)
  return NULLnullptr;

new_loop->dont_vectorize = true;
new_loop->force_vectorize = false;
gsi = gsi_last_bb (cond_bb);
gimple_call_set_arg (g, 1, build_int_cst (integer_type_nodeinteger_types[itk_int], new_loop->num));
if (preds)
  preds->safe_push (g);
gsi_insert_before (&gsi, g, GSI_SAME_STMT);
update_ssa (TODO_update_ssa_no_phi(1 << 12));
return new_loop;
2981}

2983/* Return true when LOOP satisfies the follow conditions that will
 allow it to be recognized by the vectorizer for outer-loop
 vectorization:
  - The loop is not the root node of the loop tree.
  - The loop has exactly one inner loop.
  - The loop has a single exit.
  - The loop header has a single successor, which is the inner
    loop header.
  - Each of the inner and outer loop latches have a single
    predecessor.
  - The loop exit block has a single predecessor, which is the
    inner loop's exit block.  */

2996static bool
2997versionable_outer_loop_p (class loop *loop)
2998{
if (!loop_outer (loop)
    || loop->dont_vectorize
    || !loop->inner
    || loop->inner->next
    || !single_exit (loop)
    || !single_succ_p (loop->header)
    || single_succ (loop->header) != loop->inner->header
    || !single_pred_p (loop->latch)
    || !single_pred_p (loop->inner->latch))
  return false;

basic_block outer_exit = single_pred (loop->latch);
basic_block inner_exit = single_pred (loop->inner->latch);

if (!single_pred_p (outer_exit) || single_pred (outer_exit) != inner_exit)
  return false;

if (dump_file)
  fprintf (dump_file, "Found vectorizable outer loop for versioning\n");

return true;
3020}

3022/* Performs splitting of critical edges.  Skip splitting and return false
 if LOOP will not be converted because:

   - LOOP is not well formed.
   - LOOP has PHI with more than MAX_PHI_ARG_NUM arguments.

 Last restriction is valid only if AGGRESSIVE_IF_CONV is false.  */

3030static bool
3031ifcvt_split_critical_edges (class loop *loop, bool aggressive_if_conv)
3032{
basic_block *body;
basic_block bb;
unsigned int num = loop->num_nodes;
unsigned int i;
gimple *stmt;
edge e;
edge_iterator ei;
auto_vec<edge> critical_edges;

/* Loop is not well formed.  */
if (loop->inner)
  return false;

body = get_loop_body (loop);
for (i = 0; i < num; i++)
  {
    bb = body[i];
    if (!aggressive_if_conv
 && phi_nodes (bb)
 && EDGE_COUNT (bb->preds)vec_safe_length (bb->preds) > MAX_PHI_ARG_NUM((unsigned) global_options.x_param_max_tree_if_conversion_phi_args
))
{
 if (dump_file && (dump_flags & TDF_DETAILS))
   fprintf (dump_file,
     "BB %d has complicated PHI with more than %u args.\n",
     bb->index, MAX_PHI_ARG_NUM((unsigned) global_options.x_param_max_tree_if_conversion_phi_args
));

 free (body);
 return false;
}
    if (bb == loop->latch || bb_with_exit_edge_p (loop, bb))
continue;

    stmt = last_stmt (bb);
    /* Skip basic blocks not ending with conditional branch.  */
    if (!stmt || gimple_code (stmt) != GIMPLE_COND)
continue;

    FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
if (EDGE_CRITICAL_P (e)(vec_safe_length ((e)->src->succs) >= 2 && vec_safe_length
 ((e)->dest->preds) >= 2) && e->dest->loop_father == loop)
 critical_edges.safe_push (e);
  }
free (body);

while (critical_edges.length () > 0)
  {
    e = critical_edges.pop ();
    /* Don't split if bb can be predicated along non-critical edge.  */
    if (EDGE_COUNT (e->dest->preds)vec_safe_length (e->dest->preds) > 2 || all_preds_critical_p (e->dest))
split_edge (e);
  }

return true;
3085}

3087/* Delete redundant statements produced by predication which prevents
 loop vectorization.  */

3090static void
3091ifcvt_local_dce (class loop *loop)
3092{
gimple *stmt;
gimple *stmt1;
gimple *phi;
gimple_stmt_iterator gsi;
auto_vec<gimple *> worklist;
enum gimple_code code;
use_operand_p use_p;
imm_use_iterator imm_iter;

/* The loop has a single BB only.  */
basic_block bb = loop->header;
tree latch_vdef = NULL_TREE(tree) nullptr;

worklist.create (64);
/* Consider all phi as live statements.  */
for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
  {
    phi = gsi_stmt (gsi);
    gimple_set_plf (phi, GF_PLF_2, true);
    worklist.safe_push (phi);
    if (virtual_operand_p (gimple_phi_result (phi)))
latch_vdef = PHI_ARG_DEF_FROM_EDGE (phi, loop_latch_edge (loop))gimple_phi_arg_def (((phi)), ((loop_latch_edge (loop))->dest_idx
));
  }
/* Consider load/store statements, CALL and COND as live.  */
for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
  {
    stmt = gsi_stmt (gsi);
    if (is_gimple_debug (stmt))
{
 gimple_set_plf (stmt, GF_PLF_2, true);
 continue;
}
    if (gimple_store_p (stmt) || gimple_assign_load_p (stmt))
{
 gimple_set_plf (stmt, GF_PLF_2, true);
 worklist.safe_push (stmt);
 continue;
}
    code = gimple_code (stmt);
    if (code == GIMPLE_COND || code == GIMPLE_CALL)
{
 gimple_set_plf (stmt, GF_PLF_2, true);
 worklist.safe_push (stmt);
 continue;
}
    gimple_set_plf (stmt, GF_PLF_2, false);

    if (code == GIMPLE_ASSIGN)
{
 tree lhs = gimple_assign_lhs (stmt);
 FOR_EACH_IMM_USE_FAST (use_p, imm_iter, lhs)for ((use_p) = first_readonly_imm_use (&(imm_iter), (lhs)
); !end_readonly_imm_use_p (&(imm_iter)); (void) ((use_p)
 = next_readonly_imm_use (&(imm_iter))))
   {
     stmt1 = USE_STMT (use_p)(use_p)->loc.stmt;
     if (!is_gimple_debug (stmt1) && gimple_bb (stmt1) != bb)
{
  gimple_set_plf (stmt, GF_PLF_2, true);
  worklist.safe_push (stmt);
  break;
}
   }
}
  }
/* Propagate liveness through arguments of live stmt.  */
while (worklist.length () > 0)
  {
    ssa_op_iter iter;
    use_operand_p use_p;
    tree use;

    stmt = worklist.pop ();
    FOR_EACH_PHI_OR_STMT_USE (use_p, stmt, iter, SSA_OP_USE)for ((use_p) = (gimple_code (stmt) == GIMPLE_PHI ? op_iter_init_phiuse
 (&(iter), as_a <gphi *> (stmt), 0x01) : op_iter_init_use
 (&(iter), stmt, 0x01)); !op_iter_done (&(iter)); (use_p
) = op_iter_next_use (&(iter)))
{
 use = USE_FROM_PTR (use_p)get_use_from_ptr (use_p);
 if (TREE_CODE (use)((enum tree_code) (use)->base.code) != SSA_NAME)
   continue;
 stmt1 = SSA_NAME_DEF_STMT (use)(tree_check ((use), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3168, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt;
 if (gimple_bb (stmt1) != bb || gimple_plf (stmt1, GF_PLF_2))
   continue;
 gimple_set_plf (stmt1, GF_PLF_2, true);
 worklist.safe_push (stmt1);
}
  }
/* Delete dead statements.  */
gsi = gsi_last_bb (bb);
while (!gsi_end_p (gsi))
  {
    gimple_stmt_iterator gsiprev = gsi;
    gsi_prev (&gsiprev);
    stmt = gsi_stmt (gsi);
    if (gimple_store_p (stmt) && gimple_vdef (stmt))
{
 tree lhs = gimple_get_lhs (stmt);
 ao_ref write;
 ao_ref_init (&write, lhs);

 if (dse_classify_store (&write, stmt, false, NULLnullptr, NULLnullptr, latch_vdef)
     == DSE_STORE_DEAD)
   delete_dead_or_redundant_assignment (&gsi, "dead");
 gsi = gsiprev;
 continue;
}

    if (gimple_plf (stmt, GF_PLF_2))
{
 gsi = gsiprev;
 continue;
}
    if (dump_file && (dump_flags & TDF_DETAILS))
{
 fprintf (dump_file, "Delete dead stmt in bb#%d\n", bb->index);
 print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
}
    gsi_remove (&gsi, true);
    release_defs (stmt);
    gsi = gsiprev;
  }
3209}

3211/* Return true if VALUE is already available on edge PE.  */

3213static bool
3214ifcvt_available_on_edge_p (edge pe, tree value)
3215{
if (is_gimple_min_invariant (value))
  return true;

if (TREE_CODE (value)((enum tree_code) (value)->base.code) == SSA_NAME)
  {
    basic_block def_bb = gimple_bb (SSA_NAME_DEF_STMT (value)(tree_check ((value), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3221, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt);
    if (!def_bb || dominated_by_p (CDI_DOMINATORS, pe->dest, def_bb))
return true;
  }

return false;
3227}

3229/* Return true if STMT can be hoisted from if-converted loop LOOP to
 edge PE.  */

3232static bool
3233ifcvt_can_hoist (class loop *loop, edge pe, gimple *stmt)
3234{
if (auto *call = dyn_cast<gcall *> (stmt))
  {
    if (gimple_call_internal_p (call)
 && internal_fn_mask_index (gimple_call_internal_fn (call)) >= 0)
return false;
  }
else if (auto *assign = dyn_cast<gassign *> (stmt))
  {
    if (gimple_assign_rhs_code (assign) == COND_EXPR)
return false;
  }
else
  return false;

if (gimple_has_side_effects (stmt)
    || gimple_could_trap_p (stmt)
    || stmt_could_throw_p (cfun(cfun + 0), stmt)
    || gimple_vdef (stmt)
    || gimple_vuse (stmt))
  return false;

int num_args = gimple_num_args (stmt);
if (pe != loop_preheader_edge (loop))
  {
    for (int i = 0; i < num_args; ++i)
if (!ifcvt_available_on_edge_p (pe, gimple_arg (stmt, i)))
 return false;
  }
else
  {
    for (int i = 0; i < num_args; ++i)
if (!expr_invariant_in_loop_p (loop, gimple_arg (stmt, i)))
 return false;
  }

return true;
3271}

3273/* Hoist invariant statements from LOOP to edge PE.  */

3275static void
3276ifcvt_hoist_invariants (class loop *loop, edge pe)
3277{
gimple_stmt_iterator hoist_gsi = {};
unsigned int num_blocks = loop->num_nodes;
basic_block *body = get_loop_body (loop);
for (unsigned int i = 0; i < num_blocks; ++i)
  for (gimple_stmt_iterator gsi = gsi_start_bb (body[i]); !gsi_end_p (gsi);)
    {
gimple *stmt = gsi_stmt (gsi);
if (ifcvt_can_hoist (loop, pe, stmt))
 {
   /* Once we've hoisted one statement, insert other statements
      after it.  */
   gsi_remove (&gsi, false);
   if (hoist_gsi.ptr)
     gsi_insert_after (&hoist_gsi, stmt, GSI_NEW_STMT);
   else
     {
gsi_insert_on_edge_immediate (pe, stmt);
hoist_gsi = gsi_for_stmt (stmt);
     }
   continue;
 }
gsi_next (&gsi);
    }
free (body);
3302}

3304/* Returns the DECL_FIELD_BIT_OFFSET of the bitfield accesse in stmt iff its
 type mode is not BLKmode.  If BITPOS is not NULL it will hold the poly_int64
 value of the DECL_FIELD_BIT_OFFSET of the bitfield access and STRUCT_EXPR,
 if not NULL, will hold the tree representing the base struct of this
 bitfield.  */

3310static tree
3311get_bitfield_rep (gassign *stmt, bool write, tree *bitpos,
  tree *struct_expr)
3313{
tree comp_ref = write ? gimple_assign_lhs (stmt)
	: gimple_assign_rhs1 (stmt);

tree field_decl = TREE_OPERAND (comp_ref, 1)(*((const_cast<tree*> (tree_operand_check ((comp_ref), (
1), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3317, __FUNCTION__)))));
tree rep_decl = DECL_BIT_FIELD_REPRESENTATIVE (field_decl)((tree_check ((field_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3318, __FUNCTION__, (FIELD_DECL)))->field_decl.qualifier
);

/* Bail out if the representative is not a suitable type for a scalar
   register variable.  */
if (!is_gimple_reg_type (TREE_TYPE (rep_decl)((contains_struct_check ((rep_decl), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3322, __FUNCTION__))->typed.type)))
  return NULL_TREE(tree) nullptr;

/* Bail out if the DECL_SIZE of the field_decl isn't the same as the BF's
   precision.  */
unsigned HOST_WIDE_INTlong bf_prec
  = TYPE_PRECISION (TREE_TYPE (gimple_assign_lhs (stmt)))((tree_class_check ((((contains_struct_check ((gimple_assign_lhs
 (stmt)), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3328, __FUNCTION__))->typed.type)), (tcc_type), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3328, __FUNCTION__))->type_common.precision);
if (compare_tree_int (DECL_SIZE (field_decl)((contains_struct_check ((field_decl), (TS_DECL_COMMON), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3329, __FUNCTION__))->decl_common.size), bf_prec) != 0)
  return NULL_TREE(tree) nullptr;

if (struct_expr)
  *struct_expr = TREE_OPERAND (comp_ref, 0)(*((const_cast<tree*> (tree_operand_check ((comp_ref), (
0), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3333, __FUNCTION__)))));

if (bitpos)
  {
    /* To calculate the bitposition of the BITFIELD_REF we have to determine
where our bitfield starts in relation to the container REP_DECL. The
DECL_FIELD_OFFSET of the original bitfield's member FIELD_DECL tells
us how many bytes from the start of the structure there are until the
start of the group of bitfield members the FIELD_DECL belongs to,
whereas DECL_FIELD_BIT_OFFSET will tell us how many bits from that
position our actual bitfield member starts.  For the container
REP_DECL adding DECL_FIELD_OFFSET and DECL_FIELD_BIT_OFFSET will tell
us the distance between the start of the structure and the start of
the container, though the first is in bytes and the later other in
bits.  With this in mind we calculate the bit position of our new
BITFIELD_REF by subtracting the number of bits between the start of
the structure and the container from the number of bits from the start
of the structure and the actual bitfield member. */
    tree bf_pos = fold_build2 (MULT_EXPR, bitsizetype,fold_build2_loc (((location_t) 0), MULT_EXPR, sizetype_tab[(int
) stk_bitsizetype], ((tree_check ((field_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3352, __FUNCTION__, (FIELD_DECL)))->field_decl.offset), build_int_cst
 (sizetype_tab[(int) stk_bitsizetype], (8)) )
		 DECL_FIELD_OFFSET (field_decl),fold_build2_loc (((location_t) 0), MULT_EXPR, sizetype_tab[(int
) stk_bitsizetype], ((tree_check ((field_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3352, __FUNCTION__, (FIELD_DECL)))->field_decl.offset), build_int_cst
 (sizetype_tab[(int) stk_bitsizetype], (8)) )
		 build_int_cst (bitsizetype, BITS_PER_UNIT))fold_build2_loc (((location_t) 0), MULT_EXPR, sizetype_tab[(int
) stk_bitsizetype], ((tree_check ((field_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3352, __FUNCTION__, (FIELD_DECL)))->field_decl.offset), build_int_cst
 (sizetype_tab[(int) stk_bitsizetype], (8)) );
    bf_pos = fold_build2 (PLUS_EXPR, bitsizetype, bf_pos,fold_build2_loc (((location_t) 0), PLUS_EXPR, sizetype_tab[(int
) stk_bitsizetype], bf_pos, ((tree_check ((field_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3355, __FUNCTION__, (FIELD_DECL)))->field_decl.bit_offset
) )
	    DECL_FIELD_BIT_OFFSET (field_decl))fold_build2_loc (((location_t) 0), PLUS_EXPR, sizetype_tab[(int
) stk_bitsizetype], bf_pos, ((tree_check ((field_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3355, __FUNCTION__, (FIELD_DECL)))->field_decl.bit_offset
) );
    tree rep_pos = fold_build2 (MULT_EXPR, bitsizetype,fold_build2_loc (((location_t) 0), MULT_EXPR, sizetype_tab[(int
) stk_bitsizetype], ((tree_check ((rep_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3357, __FUNCTION__, (FIELD_DECL)))->field_decl.offset), build_int_cst
 (sizetype_tab[(int) stk_bitsizetype], (8)) )
		  DECL_FIELD_OFFSET (rep_decl),fold_build2_loc (((location_t) 0), MULT_EXPR, sizetype_tab[(int
) stk_bitsizetype], ((tree_check ((rep_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3357, __FUNCTION__, (FIELD_DECL)))->field_decl.offset), build_int_cst
 (sizetype_tab[(int) stk_bitsizetype], (8)) )
		  build_int_cst (bitsizetype, BITS_PER_UNIT))fold_build2_loc (((location_t) 0), MULT_EXPR, sizetype_tab[(int
) stk_bitsizetype], ((tree_check ((rep_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3357, __FUNCTION__, (FIELD_DECL)))->field_decl.offset), build_int_cst
 (sizetype_tab[(int) stk_bitsizetype], (8)) );
    rep_pos = fold_build2 (PLUS_EXPR, bitsizetype, rep_pos,fold_build2_loc (((location_t) 0), PLUS_EXPR, sizetype_tab[(int
) stk_bitsizetype], rep_pos, ((tree_check ((rep_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3360, __FUNCTION__, (FIELD_DECL)))->field_decl.bit_offset
) )
	     DECL_FIELD_BIT_OFFSET (rep_decl))fold_build2_loc (((location_t) 0), PLUS_EXPR, sizetype_tab[(int
) stk_bitsizetype], rep_pos, ((tree_check ((rep_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3360, __FUNCTION__, (FIELD_DECL)))->field_decl.bit_offset
) );

    *bitpos = fold_build2 (MINUS_EXPR, bitsizetype, bf_pos, rep_pos)fold_build2_loc (((location_t) 0), MINUS_EXPR, sizetype_tab[(
int) stk_bitsizetype], bf_pos, rep_pos );
  }

return rep_decl;

3367}

3369/* Lowers the bitfield described by DATA.
 For a write like:

 struct.bf = _1;

 lower to:

 __ifc_1 = struct.<representative>;
 __ifc_2 = BIT_INSERT_EXPR (__ifc_1, _1, bitpos);
 struct.<representative> = __ifc_2;

 For a read:

 _1 = struct.bf;

  lower to:

  __ifc_1 = struct.<representative>;
  _1 =  BIT_FIELD_REF (__ifc_1, bitsize, bitpos);

  where representative is a legal load that contains the bitfield value,
  bitsize is the size of the bitfield and bitpos the offset to the start of
  the bitfield within the representative.  */

3393static void
3394lower_bitfield (gassign *stmt, bool write)
3395{
tree struct_expr;
tree bitpos;
tree rep_decl = get_bitfield_rep (stmt, write, &bitpos, &struct_expr);
tree rep_type = TREE_TYPE (rep_decl)((contains_struct_check ((rep_decl), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3399, __FUNCTION__))->typed.type);
tree bf_type = TREE_TYPE (gimple_assign_lhs (stmt))((contains_struct_check ((gimple_assign_lhs (stmt)), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3400, __FUNCTION__))->typed.type);

gimple_stmt_iterator gsi = gsi_for_stmt (stmt);
if (dump_file && (dump_flags & TDF_DETAILS))
  {
    fprintf (dump_file, "Lowering:\n");
    print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
    fprintf (dump_file, "to:\n");
  }

/* REP_COMP_REF is a COMPONENT_REF for the representative.  NEW_VAL is it's
   defining SSA_NAME.  */
tree rep_comp_ref = build3 (COMPONENT_REF, rep_type, struct_expr, rep_decl,
	      NULL_TREE(tree) nullptr);
tree new_val = ifc_temp_var (rep_type, rep_comp_ref, &gsi);

if (dump_file && (dump_flags & TDF_DETAILS))
  print_gimple_stmt (dump_file, SSA_NAME_DEF_STMT (new_val)(tree_check ((new_val), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3417, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt, 0, TDF_SLIM);

if (write)
  {
    new_val = ifc_temp_var (rep_type,
	      build3 (BIT_INSERT_EXPR, rep_type, new_val,
		      unshare_expr (gimple_assign_rhs1 (stmt)),
		      bitpos), &gsi);

    if (dump_file && (dump_flags & TDF_DETAILS))
print_gimple_stmt (dump_file, SSA_NAME_DEF_STMT (new_val)(tree_check ((new_val), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3427, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt, 0, TDF_SLIM);

    gimple *new_stmt = gimple_build_assign (unshare_expr (rep_comp_ref),
			      new_val);
    gimple_move_vops (new_stmt, stmt);
    gsi_insert_before (&gsi, new_stmt, GSI_SAME_STMT);

    if (dump_file && (dump_flags & TDF_DETAILS))
print_gimple_stmt (dump_file, new_stmt, 0, TDF_SLIM);
  }
else
  {
    tree bfr = build3 (BIT_FIELD_REF, bf_type, new_val,
	 build_int_cst (bitsizetypesizetype_tab[(int) stk_bitsizetype], TYPE_PRECISION (bf_type)((tree_class_check ((bf_type), (tcc_type), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3440, __FUNCTION__))->type_common.precision)),
	 bitpos);
    new_val = ifc_temp_var (bf_type, bfr, &gsi);

    gimple *new_stmt = gimple_build_assign (gimple_assign_lhs (stmt),
			      new_val);
    gimple_move_vops (new_stmt, stmt);
    gsi_insert_before (&gsi, new_stmt, GSI_SAME_STMT);

    if (dump_file && (dump_flags & TDF_DETAILS))
print_gimple_stmt (dump_file, new_stmt, 0, TDF_SLIM);
  }

gsi_remove (&gsi, true);
3454}

3456/* Return TRUE if there are bitfields to lower in this LOOP.  Fill TO_LOWER
 with data structures representing these bitfields.  */

3459static bool
3460bitfields_to_lower_p (class loop *loop,
      vec <gassign *> &reads_to_lower,
      vec <gassign *> &writes_to_lower)
3463{
gimple_stmt_iterator gsi;

if (dump_file && (dump_flags & TDF_DETAILS))
  {
    fprintf (dump_file, "Analyzing loop %d for bitfields:\n", loop->num);
  }

for (unsigned i = 0; i < loop->num_nodes; ++i)
  {
    basic_block bb = ifc_bbs[i];
    for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
{
 gassign *stmt = dyn_cast<gassign*> (gsi_stmt (gsi));
 if (!stmt)
   continue;

 tree op = gimple_assign_lhs (stmt);
 bool write = TREE_CODE (op)((enum tree_code) (op)->base.code) == COMPONENT_REF;

 if (!write)
   op = gimple_assign_rhs1 (stmt);

 if (TREE_CODE (op)((enum tree_code) (op)->base.code) != COMPONENT_REF)
   continue;

 if (DECL_BIT_FIELD_TYPE (TREE_OPERAND (op, 1))((tree_check (((*((const_cast<tree*> (tree_operand_check
 ((op), (1), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3489, __FUNCTION__)))))), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3489, __FUNCTION__, (FIELD_DECL)))->field_decl.bit_field_type
))
   {
     if (dump_file && (dump_flags & TDF_DETAILS))
print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);

     if (!INTEGRAL_TYPE_P (TREE_TYPE (op))(((enum tree_code) (((contains_struct_check ((op), (TS_TYPED)
, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3494, __FUNCTION__))->typed.type))->base.code) == ENUMERAL_TYPE
 || ((enum tree_code) (((contains_struct_check ((op), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3494, __FUNCTION__))->typed.type))->base.code) == BOOLEAN_TYPE
 || ((enum tree_code) (((contains_struct_check ((op), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3494, __FUNCTION__))->typed.type))->base.code) == INTEGER_TYPE
))
{
  if (dump_file && (dump_flags & TDF_DETAILS))
    fprintf (dump_file, "\t Bitfield NO OK to lower,"
			" field type is not Integral.\n");
  return false;
}

     if (!get_bitfield_rep (stmt, write, NULLnullptr, NULLnullptr))
{
  if (dump_file && (dump_flags & TDF_DETAILS))
    fprintf (dump_file, "\t Bitfield NOT OK to lower,"
			" representative is BLKmode.\n");
  return false;
}

     if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "\tBitfield OK to lower.\n");
     if (write)
writes_to_lower.safe_push (stmt);
     else
reads_to_lower.safe_push (stmt);
   }
}
  }
return !reads_to_lower.is_empty () || !writes_to_lower.is_empty ();
3520}


3523/* If-convert LOOP when it is legal.  For the moment this pass has no
 profitability analysis.  Returns non-zero todo flags when something
 changed.  */

3527unsigned int
3528tree_if_conversion (class loop *loop, vec<gimple *> *preds)
3529{
unsigned int todo = 0;
bool aggressive_if_conv;
class loop *rloop;
auto_vec <gassign *, 4> reads_to_lower;
auto_vec <gassign *, 4> writes_to_lower;
bitmap exit_bbs;
edge pe;
auto_vec<data_reference_p, 10> refs;

again:
rloop = NULLnullptr;
ifc_bbs = NULLnullptr;
need_to_lower_bitfields = false;
need_to_ifcvt = false;
need_to_predicate = false;
need_to_rewrite_undefined = false;
any_complicated_phi = false;

/* Apply more aggressive if-conversion when loop or its outer loop were
   marked with simd pragma.  When that's the case, we try to if-convert
   loop containing PHIs with more than MAX_PHI_ARG_NUM arguments.  */
aggressive_if_conv = loop->force_vectorize;
if (!aggressive_if_conv)
  {
    class loop *outer_loop = loop_outer (loop);
    if (outer_loop && outer_loop->force_vectorize)
aggressive_if_conv = true;
  }

if (!single_exit (loop))
  goto cleanup;

/* If there are more than two BBs in the loop then there is at least one if
   to convert.  */
if (loop->num_nodes > 2
    && !ifcvt_split_critical_edges (loop, aggressive_if_conv))
  goto cleanup;

ifc_bbs = get_loop_body_in_if_conv_order (loop);
if (!ifc_bbs)
  {
    if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Irreducible loop\n");
    goto cleanup;
  }

if (find_data_references_in_loop (loop, &refs) == chrec_dont_knowglobal_trees[TI_CHREC_DONT_KNOW])
  goto cleanup;

if (loop->num_nodes > 2)
  {
    need_to_ifcvt = true;

    if (!if_convertible_loop_p (loop, &refs) || !dbg_cnt (if_conversion_tree))
goto cleanup;

    if ((need_to_predicate || any_complicated_phi)
 && ((!flag_tree_loop_vectorizeglobal_options.x_flag_tree_loop_vectorize && !loop->force_vectorize)
     || loop->dont_vectorize))
goto cleanup;
  }

if ((flag_tree_loop_vectorizeglobal_options.x_flag_tree_loop_vectorize || loop->force_vectorize)
    && !loop->dont_vectorize)
  need_to_lower_bitfields = bitfields_to_lower_p (loop, reads_to_lower,
				    writes_to_lower);

if (!need_to_ifcvt && !need_to_lower_bitfields)
  goto cleanup;

/* The edge to insert invariant stmts on.  */
pe = loop_preheader_edge (loop);

/* Since we have no cost model, always version loops unless the user
   specified -ftree-loop-if-convert or unless versioning is required.
   Either version this loop, or if the pattern is right for outer-loop
   vectorization, version the outer loop.  In the latter case we will
   still if-convert the original inner loop.  */
if (need_to_lower_bitfields
    || need_to_predicate
    || any_complicated_phi
    || flag_tree_loop_if_convertglobal_options.x_flag_tree_loop_if_convert != 1)
  {
    class loop *vloop
= (versionable_outer_loop_p (loop_outer (loop))
  ? loop_outer (loop) : loop);
    class loop *nloop = version_loop_for_if_conversion (vloop, preds);
    if (nloop == NULLnullptr)
goto cleanup;
    if (vloop != loop)
{
 /* If versionable_outer_loop_p decided to version the
    outer loop, version also the inner loop of the non-vectorized
    loop copy.  So we transform:
     loop1
loop2
    into:
     if (LOOP_VECTORIZED (1, 3))
{
  loop1
    loop2
}
     else
loop3 (copy of loop1)
  if (LOOP_VECTORIZED (4, 5))
    loop4 (copy of loop2)
  else
    loop5 (copy of loop4)  */
 gcc_assert (nloop->inner && nloop->inner->next == NULL)((void)(!(nloop->inner && nloop->inner->next
 == nullptr) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3638, __FUNCTION__), 0 : 0));
 rloop = nloop->inner;
}
    else
/* If we versioned loop then make sure to insert invariant
  stmts before the .LOOP_VECTORIZED check since the vectorizer
  will re-use that for things like runtime alias versioning
  whose condition can end up using those invariants.  */
pe = single_pred_edge (gimple_bb (preds->last ()));
  }

if (need_to_lower_bitfields)
  {
    if (dump_file && (dump_flags & TDF_DETAILS))
{
 fprintf (dump_file, "-------------------------\n");
 fprintf (dump_file, "Start lowering bitfields\n");
}
    while (!reads_to_lower.is_empty ())
lower_bitfield (reads_to_lower.pop (), false);
    while (!writes_to_lower.is_empty ())
lower_bitfield (writes_to_lower.pop (), true);

    if (dump_file && (dump_flags & TDF_DETAILS))
{
 fprintf (dump_file, "Done lowering bitfields\n");
 fprintf (dump_file, "-------------------------\n");
}
  }
if (need_to_ifcvt)
  {
    /* Now all statements are if-convertible.  Combine all the basic
blocks into one huge basic block doing the if-conversion
on-the-fly.  */
    combine_blocks (loop);
  }

/* Perform local CSE, this esp. helps the vectorizer analysis if loads
   and stores are involved.  CSE only the loop body, not the entry
   PHIs, those are to be kept in sync with the non-if-converted copy.
   ???  We'll still keep dead stores though.  */
exit_bbs = BITMAP_ALLOCbitmap_alloc (NULLnullptr);
bitmap_set_bit (exit_bbs, single_exit (loop)->dest->index);
bitmap_set_bit (exit_bbs, loop->latch->index);

std::pair <tree, tree> *name_pair;
unsigned ssa_names_idx;
FOR_EACH_VEC_ELT (redundant_ssa_names, ssa_names_idx, name_pair)for (ssa_names_idx = 0; (redundant_ssa_names).iterate ((ssa_names_idx
), &(name_pair)); ++(ssa_names_idx))
  replace_uses_by (name_pair->first, name_pair->second);
redundant_ssa_names.release ();

todo |= do_rpo_vn (cfun(cfun + 0), loop_preheader_edge (loop), exit_bbs);

/* Delete dead predicate computations.  */
ifcvt_local_dce (loop);
BITMAP_FREE (exit_bbs)((void) (bitmap_obstack_free ((bitmap) exit_bbs), (exit_bbs) =
 (bitmap) nullptr));

ifcvt_hoist_invariants (loop, pe);

todo |= TODO_cleanup_cfg(1 << 5);

cleanup:
data_reference_p dr;
unsigned int i;
for (i = 0; refs.iterate (i, &dr); i++)
  {
    free (dr->aux);
    free_data_ref (dr);
  }
refs.truncate (0);

if (ifc_bbs)
  {
    unsigned int i;

    for (i = 0; i < loop->num_nodes; i++)
free_bb_predicate (ifc_bbs[i]);

    free (ifc_bbs);
    ifc_bbs = NULLnullptr;
  }
if (rloop != NULLnullptr)
  {
    loop = rloop;
    reads_to_lower.truncate (0);
    writes_to_lower.truncate (0);
    goto again;
  }

return todo;
3728}

3730/* Tree if-conversion pass management.  */

3732namespace {

3734const pass_data pass_data_if_conversion =
3735{
GIMPLE_PASS, /* type */
"ifcvt", /* name */
OPTGROUP_NONE, /* optinfo_flags */
TV_TREE_LOOP_IFCVT, /* tv_id */
( PROP_cfg(1 << 3) | PROP_ssa(1 << 5) ), /* properties_required */
0, /* properties_provided */
0, /* properties_destroyed */
0, /* todo_flags_start */
0, /* todo_flags_finish */
3745};

3747class pass_if_conversion : public gimple_opt_pass
3748{
3749public:
pass_if_conversion (gcc::context *ctxt)
  : gimple_opt_pass (pass_data_if_conversion, ctxt)
{}

/* opt_pass methods: */
bool gate (function *) final override;
unsigned int execute (function *) final override;

3758}; // class pass_if_conversion

3760bool
3761pass_if_conversion::gate (function *fun)
3762{
return (((flag_tree_loop_vectorizeglobal_options.x_flag_tree_loop_vectorize || fun->has_force_vectorize_loops)
  && flag_tree_loop_if_convertglobal_options.x_flag_tree_loop_if_convert != 0)
 || flag_tree_loop_if_convertglobal_options.x_flag_tree_loop_if_convert == 1);
3766}

3768unsigned int
3769pass_if_conversion::execute (function *fun)
3770{
unsigned todo = 0;

if (number_of_loops (fun) <= 1)
  return 0;

auto_vec<gimple *> preds;
for (auto loop : loops_list (cfun(cfun + 0), 0))
  if (flag_tree_loop_if_convertglobal_options.x_flag_tree_loop_if_convert == 1
|| ((flag_tree_loop_vectorizeglobal_options.x_flag_tree_loop_vectorize || loop->force_vectorize)
   && !loop->dont_vectorize))
    todo |= tree_if_conversion (loop, &preds);

if (todo)
  {
    free_numbers_of_iterations_estimates (fun);
    scev_reset ();
  }

if (flag_checkingglobal_options.x_flag_checking)
  {
    basic_block bb;
    FOR_EACH_BB_FN (bb, fun)for (bb = (fun)->cfg->x_entry_block_ptr->next_bb; bb
 != (fun)->cfg->x_exit_block_ptr; bb = bb->next_bb)
gcc_assert (!bb->aux)((void)(!(!bb->aux) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/tree-if-conv.cc"
, 3793, __FUNCTION__), 0 : 0));
  }

/* Perform IL update now, it might elide some loops.  */
if (todo & TODO_cleanup_cfg(1 << 5))
  {
    cleanup_tree_cfg ();
    if (need_ssa_update_p (fun))
todo |= TODO_update_ssa(1 << 11);
  }
if (todo & TODO_update_ssa_any((1 << 11) | (1 << 12) | (1 << 13) | (1 <<
 14)))
  update_ssa (todo & TODO_update_ssa_any((1 << 11) | (1 << 12) | (1 << 13) | (1 <<
 14)));

/* If if-conversion elided the loop fall back to the original one.  */
for (unsigned i = 0; i < preds.length (); ++i)
  {
    gimple *g = preds[i];
    if (!gimple_bb (g))
continue;
    unsigned ifcvt_loop = tree_to_uhwi (gimple_call_arg (g, 0));
    unsigned orig_loop = tree_to_uhwi (gimple_call_arg (g, 1));
    if (!get_loop (fun, ifcvt_loop) || !get_loop (fun, orig_loop))
{
 if (dump_file)
   fprintf (dump_file, "If-converted loop vanished\n");
 fold_loop_internal_call (g, boolean_false_nodeglobal_trees[TI_BOOLEAN_FALSE]);
}
  }

return 0;
3823}

3825} // anon namespace

3827gimple_opt_pass *
3828make_pass_if_conversion (gcc::context *ctxt)
3829{
return new pass_if_conversion (ctxt);
3831}