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

Bug Summary

File:	build/gcc/predict.cc
Warning:	line 811, column 36 Called C++ object pointer is null

Annotated Source Code

Press '?' to see keyboard shortcuts

Show analyzer invocation

clang -cc1 -cc1 -triple x86_64-suse-linux -analyze -disable-free -clear-ast-before-backend -disable-llvm-verifier -discard-value-names -main-file-name predict.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-HVgI6x.plist -x c++ /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc

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

→

1/* Branch prediction routines for the GNU compiler.
 Copyright (C) 2000-2023 Free Software Foundation, Inc.

4This file is part of GCC.

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

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

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

20/* References:

 [1] "Branch Prediction for Free"
     Ball and Larus; PLDI '93.
 [2] "Static Branch Frequency and Program Profile Analysis"
     Wu and Larus; MICRO-27.
 [3] "Corpus-based Static Branch Prediction"
     Calder, Grunwald, Lindsay, Martin, Mozer, and Zorn; PLDI '95.  */


30#include "config.h"
31#include "system.h"
32#include "coretypes.h"
33#include "backend.h"
34#include "rtl.h"
35#include "tree.h"
36#include "gimple.h"
37#include "cfghooks.h"
38#include "tree-pass.h"
39#include "ssa.h"
40#include "memmodel.h"
41#include "emit-rtl.h"
42#include "cgraph.h"
43#include "coverage.h"
44#include "diagnostic-core.h"
45#include "gimple-predict.h"
46#include "fold-const.h"
47#include "calls.h"
48#include "cfganal.h"
49#include "profile.h"
50#include "sreal.h"
51#include "cfgloop.h"
52#include "gimple-iterator.h"
53#include "tree-cfg.h"
54#include "tree-ssa-loop-niter.h"
55#include "tree-ssa-loop.h"
56#include "tree-scalar-evolution.h"
57#include "ipa-utils.h"
58#include "gimple-pretty-print.h"
59#include "selftest.h"
60#include "cfgrtl.h"
61#include "stringpool.h"
62#include "attribs.h"

64/* Enum with reasons why a predictor is ignored.  */

66enum predictor_reason
67{
REASON_NONE,
REASON_IGNORED,
REASON_SINGLE_EDGE_DUPLICATE,
REASON_EDGE_PAIR_DUPLICATE
72};

74/* String messages for the aforementioned enum.  */

76static const char *reason_messages[] = {"", " (ignored)",
  " (single edge duplicate)", " (edge pair duplicate)"};


80static void combine_predictions_for_insn (rtx_insn *, basic_block);
81static void dump_prediction (FILE *, enum br_predictor, int, basic_block,
	     enum predictor_reason, edge);
83static void predict_paths_leading_to (basic_block, enum br_predictor,
		      enum prediction,
		      class loop *in_loop = NULLnullptr);
86static void predict_paths_leading_to_edge (edge, enum br_predictor,
			   enum prediction,
			   class loop *in_loop = NULLnullptr);
89static bool can_predict_insn_p (const rtx_insn *);
90static HOST_WIDE_INTlong get_predictor_value (br_predictor, HOST_WIDE_INTlong);
91static void determine_unlikely_bbs ();

93/* Information we hold about each branch predictor.
 Filled using information from predict.def.  */

96struct predictor_info
97{
const char *const name;	/* Name used in the debugging dumps.  */
const int hitrate;		/* Expected hitrate used by
		   predict_insn_def call.  */
const int flags;
102};

104/* Use given predictor without Dempster-Shaffer theory if it matches
 using first_match heuristics.  */
106#define PRED_FLAG_FIRST_MATCH1 1

108/* Recompute hitrate in percent to our representation.  */

110#define HITRATE(VAL)((int) ((VAL) * 10000 + 50) / 100) ((int) ((VAL) * REG_BR_PROB_BASE10000 + 50) / 100)

112#define DEF_PREDICTOR(ENUM, NAME, HITRATE, FLAGS) {NAME, HITRATE, FLAGS},
113static const struct predictor_info predictor_info[]= {
114#include "predict.def"

/* Upper bound on predictors.  */
{NULLnullptr, 0, 0}
118};
119#undef DEF_PREDICTOR

121static gcov_type min_count = -1;

123/* Determine the threshold for hot BB counts.  */

125gcov_type
126get_hot_bb_threshold ()
127{
if (min_count == -1)
  {
    const int hot_frac = param_hot_bb_count_fractionglobal_options.x_param_hot_bb_count_fraction;
    const gcov_type min_hot_count
= hot_frac
 ? profile_info->sum_max / hot_frac
 : (gcov_type)profile_count::max_count;
    set_hot_bb_threshold (min_hot_count);
    if (dump_file)
fprintf (dump_file, "Setting hotness threshold to %" PRId64"l" "d" ".\n",
 min_hot_count);
  }
return min_count;
141}

143/* Set the threshold for hot BB counts.  */

145void
146set_hot_bb_threshold (gcov_type min)
147{
min_count = min;
149}

151/* Return TRUE if COUNT is considered to be hot in function FUN.  */

153bool
154maybe_hot_count_p (struct function *fun, profile_count count)
155{
if (!count.initialized_p ())
  return true;
if (count.ipa () == profile_count::zero ())
  return false;
if (!count.ipa_p ())
  {
    struct cgraph_node *node = cgraph_node::get (fun->decl);
    if (!profile_info || profile_status_for_fn (fun)((fun)->cfg->x_profile_status) != PROFILE_READ)
{
 if (node->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED)
   return false;
 if (node->frequency == NODE_FREQUENCY_HOT)
   return true;
}
    if (profile_status_for_fn (fun)((fun)->cfg->x_profile_status) == PROFILE_ABSENT)
return true;
    if (node->frequency == NODE_FREQUENCY_EXECUTED_ONCE
 && count < (ENTRY_BLOCK_PTR_FOR_FN (fun)((fun)->cfg->x_entry_block_ptr)->count.apply_scale (2, 3)))
return false;
    if (count * param_hot_bb_frequency_fractionglobal_options.x_param_hot_bb_frequency_fraction
 < ENTRY_BLOCK_PTR_FOR_FN (fun)((fun)->cfg->x_entry_block_ptr)->count)
return false;
    return true;
  }
/* Code executed at most once is not hot.  */
if (count <= MAX (profile_info ? profile_info->runs : 1, 1)((profile_info ? profile_info->runs : 1) > (1) ? (profile_info
 ? profile_info->runs : 1) : (1)))
  return false;
return (count >= get_hot_bb_threshold ());
184}

186/* Return true if basic block BB of function FUN can be CPU intensive
 and should thus be optimized for maximum performance.  */

189bool
190maybe_hot_bb_p (struct function *fun, const_basic_block bb)
191{
gcc_checking_assert (fun)((void)(!(fun) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 192, __FUNCTION__), 0 : 0));
return maybe_hot_count_p (fun, bb->count);
194}

196/* Return true if edge E can be CPU intensive and should thus be optimized
 for maximum performance.  */

199bool
200maybe_hot_edge_p (edge e)
201{
return maybe_hot_count_p (cfun(cfun + 0), e->count ());
203}

205/* Return true if COUNT is considered to be never executed in function FUN
 or if function FUN is considered so in the static profile.  */
 
208static bool
209probably_never_executed (struct function *fun, profile_count count)
210{
gcc_checking_assert (fun)((void)(!(fun) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 211, __FUNCTION__), 0 : 0));
if (count.ipa () == profile_count::zero ())
  return true;
/* Do not trust adjusted counts.  This will make us to drop int cold section
   code with low execution count as a result of inlining. These low counts
   are not safe even with read profile and may lead us to dropping
   code which actually gets executed into cold section of binary that is not
   desirable.  */
if (count.precise_p () && profile_status_for_fn (fun)((fun)->cfg->x_profile_status) == PROFILE_READ)
  {
    const int unlikely_frac = param_unlikely_bb_count_fractionglobal_options.x_param_unlikely_bb_count_fraction;
    if (count * unlikely_frac >= profile_info->runs)
return false;
    return true;
  }
if ((!profile_info || profile_status_for_fn (fun)((fun)->cfg->x_profile_status) != PROFILE_READ)
    && (cgraph_node::get (fun->decl)->frequency
 == NODE_FREQUENCY_UNLIKELY_EXECUTED))
  return true;
return false;
231}

233/* Return true if basic block BB of function FUN is probably never executed.  */

235bool
236probably_never_executed_bb_p (struct function *fun, const_basic_block bb)
237{
return probably_never_executed (fun, bb->count);
239}

241/* Return true if edge E is unlikely executed for obvious reasons.  */

243static bool
244unlikely_executed_edge_p (edge e)
245{
return (e->src->count == profile_count::zero ()
 || e->probability == profile_probability::never ())
|| (e->flags & (EDGE_EH | EDGE_FAKE));
249}

251/* Return true if edge E of function FUN is probably never executed.  */

253bool
254probably_never_executed_edge_p (struct function *fun, edge e)
255{
if (unlikely_executed_edge_p (e))
  return true;
return probably_never_executed (fun, e->count ());
259}

261/* Return true if function FUN should always be optimized for size.  */

263optimize_size_level
264optimize_function_for_size_p (struct function *fun)
265{
if (!fun || !fun->decl)
  return optimize_sizeglobal_options.x_optimize_size ? OPTIMIZE_SIZE_MAX : OPTIMIZE_SIZE_NO;
cgraph_node *n = cgraph_node::get (fun->decl);
if (n)
  return n->optimize_for_size_p ();
return OPTIMIZE_SIZE_NO;
272}

274/* Return true if function FUN should always be optimized for speed.  */

276bool
277optimize_function_for_speed_p (struct function *fun)
278{
return !optimize_function_for_size_p (fun);
280}

282/* Return the optimization type that should be used for function FUN.  */

284optimization_type
285function_optimization_type (struct function *fun)
286{
return (optimize_function_for_speed_p (fun)
 ? OPTIMIZE_FOR_SPEED
 : OPTIMIZE_FOR_SIZE);
290}

292/* Return TRUE if basic block BB should be optimized for size.  */

294optimize_size_level
295optimize_bb_for_size_p (const_basic_block bb)
296{
enum optimize_size_level ret = optimize_function_for_size_p (cfun(cfun + 0));

if (bb && ret < OPTIMIZE_SIZE_MAX && bb->count == profile_count::zero ())
  ret = OPTIMIZE_SIZE_MAX;
if (bb && ret < OPTIMIZE_SIZE_BALANCED && !maybe_hot_bb_p (cfun(cfun + 0), bb))
  ret = OPTIMIZE_SIZE_BALANCED;
return ret;
304}

306/* Return TRUE if basic block BB should be optimized for speed.  */

308bool
309optimize_bb_for_speed_p (const_basic_block bb)
310{
return !optimize_bb_for_size_p (bb);
312}

314/* Return the optimization type that should be used for basic block BB.  */

316optimization_type
317bb_optimization_type (const_basic_block bb)
318{
return (optimize_bb_for_speed_p (bb)
 ? OPTIMIZE_FOR_SPEED
 : OPTIMIZE_FOR_SIZE);
322}

324/* Return TRUE if edge E should be optimized for size.  */

326optimize_size_level
327optimize_edge_for_size_p (edge e)
328{
enum optimize_size_level ret = optimize_function_for_size_p (cfun(cfun + 0));

if (ret < OPTIMIZE_SIZE_MAX && unlikely_executed_edge_p (e))
  ret = OPTIMIZE_SIZE_MAX;
if (ret < OPTIMIZE_SIZE_BALANCED && !maybe_hot_edge_p (e))
  ret = OPTIMIZE_SIZE_BALANCED;
return ret;
336}

338/* Return TRUE if edge E should be optimized for speed.  */

340bool
341optimize_edge_for_speed_p (edge e)
342{
return !optimize_edge_for_size_p (e);
344}

346/* Return TRUE if the current function is optimized for size.  */

348optimize_size_level
349optimize_insn_for_size_p (void)
350{
enum optimize_size_level ret = optimize_function_for_size_p (cfun(cfun + 0));
if (ret < OPTIMIZE_SIZE_BALANCED && !crtl(&x_rtl)->maybe_hot_insn_p)
  ret = OPTIMIZE_SIZE_BALANCED;
return ret;
355}

357/* Return TRUE if the current function is optimized for speed.  */

359bool
360optimize_insn_for_speed_p (void)
361{
return !optimize_insn_for_size_p ();
363}

365/* Return the optimization type that should be used for the current
 instruction.  */

368optimization_type
369insn_optimization_type ()
370{
return (optimize_insn_for_speed_p ()
 ? OPTIMIZE_FOR_SPEED
 : OPTIMIZE_FOR_SIZE);
374}

376/* Return TRUE if LOOP should be optimized for size.  */

378optimize_size_level
379optimize_loop_for_size_p (class loop *loop)
380{
return optimize_bb_for_size_p (loop->header);
382}

384/* Return TRUE if LOOP should be optimized for speed.  */

386bool
387optimize_loop_for_speed_p (class loop *loop)
388{
return optimize_bb_for_speed_p (loop->header);
390}

392/* Return TRUE if nest rooted at LOOP should be optimized for speed.  */

394bool
395optimize_loop_nest_for_speed_p (class loop *loop)
396{
class loop *l = loop;
if (optimize_loop_for_speed_p (loop))
  return true;
l = loop->inner;
while (l && l != loop)
  {
    if (optimize_loop_for_speed_p (l))
      return true;
    if (l->inner)
      l = l->inner;
    else if (l->next)
      l = l->next;
    else
      {
 while (l != loop && !l->next)
   l = loop_outer (l);
 if (l != loop)
   l = l->next;
}
  }
return false;
418}

420/* Return TRUE if nest rooted at LOOP should be optimized for size.  */

422optimize_size_level
423optimize_loop_nest_for_size_p (class loop *loop)
424{
enum optimize_size_level ret = optimize_loop_for_size_p (loop);
class loop *l = loop;

l = loop->inner;
while (l && l != loop)
  {
    if (ret == OPTIMIZE_SIZE_NO)
break;
    ret = MIN (optimize_loop_for_size_p (l), ret)((optimize_loop_for_size_p (l)) < (ret) ? (optimize_loop_for_size_p
 (l)) : (ret));
    if (l->inner)
      l = l->inner;
    else if (l->next)
      l = l->next;
    else
      {
 while (l != loop && !l->next)
   l = loop_outer (l);
 if (l != loop)
   l = l->next;
}
  }
return ret;
447}

449/* Return true if edge E is likely to be well predictable by branch
 predictor.  */

452bool
453predictable_edge_p (edge e)
454{
if (!e->probability.initialized_p ())
  return false;
if ((e->probability.to_reg_br_prob_base ()
     <= param_predictable_branch_outcomeglobal_options.x_param_predictable_branch_outcome * REG_BR_PROB_BASE10000 / 100)
    || (REG_BR_PROB_BASE10000 - e->probability.to_reg_br_prob_base ()
 <= param_predictable_branch_outcomeglobal_options.x_param_predictable_branch_outcome * REG_BR_PROB_BASE10000 / 100))
  return true;
return false;
463}


466/* Set RTL expansion for BB profile.  */

468void
469rtl_profile_for_bb (basic_block bb)
470{
crtl(&x_rtl)->maybe_hot_insn_p = maybe_hot_bb_p (cfun(cfun + 0), bb);
472}

474/* Set RTL expansion for edge profile.  */

476void
477rtl_profile_for_edge (edge e)
478{
crtl(&x_rtl)->maybe_hot_insn_p = maybe_hot_edge_p (e);
480}

482/* Set RTL expansion to default mode (i.e. when profile info is not known).  */
483void
484default_rtl_profile (void)
485{
crtl(&x_rtl)->maybe_hot_insn_p = true;
487}

489/* Return true if the one of outgoing edges is already predicted by
 PREDICTOR.  */

492bool
493rtl_predicted_by_p (const_basic_block bb, enum br_predictor predictor)
494{
rtx note;
if (!INSN_P (BB_END (bb))(((((enum rtx_code) ((bb)->il.x.rtl->end_)->code) ==
 INSN) || (((enum rtx_code) ((bb)->il.x.rtl->end_)->
code) == JUMP_INSN) || (((enum rtx_code) ((bb)->il.x.rtl->
end_)->code) == CALL_INSN)) || (((enum rtx_code) ((bb)->
il.x.rtl->end_)->code) == DEBUG_INSN)))
  return false;
for (note = REG_NOTES (BB_END (bb))((((bb)->il.x.rtl->end_)->u.fld[6]).rt_rtx); note; note = XEXP (note, 1)(((note)->u.fld[1]).rt_rtx))
  if (REG_NOTE_KIND (note)((enum reg_note) ((machine_mode) (note)->mode)) == REG_BR_PRED
&& INTVAL (XEXP (XEXP (note, 0), 0))((((((((note)->u.fld[0]).rt_rtx))->u.fld[0]).rt_rtx))->
u.hwint[0]) == (int)predictor)
    return true;
return false;
503}

505/*  Structure representing predictions in tree level. */

507struct edge_prediction {
  struct edge_prediction *ep_next;
  edge ep_edge;
  enum br_predictor ep_predictor;
  int ep_probability;
512};

514/* This map contains for a basic block the list of predictions for the
 outgoing edges.  */

517static hash_map<const_basic_block, edge_prediction *> *bb_predictions;

519/* Return true if the one of outgoing edges is already predicted by
 PREDICTOR.  */

522bool
523gimple_predicted_by_p (const_basic_block bb, enum br_predictor predictor)
524{
struct edge_prediction *i;
edge_prediction **preds = bb_predictions->get (bb);

if (!preds)
  return false;

for (i = *preds; i; i = i->ep_next)
  if (i->ep_predictor == predictor)
    return true;
return false;
535}

537/* Return true if the one of outgoing edges is already predicted by
 PREDICTOR for edge E predicted as TAKEN.  */

540bool
541edge_predicted_by_p (edge e, enum br_predictor predictor, bool taken)
542{
struct edge_prediction *i;
basic_block bb = e->src;
edge_prediction **preds = bb_predictions->get (bb);
if (!preds)
  return false;

int probability = predictor_info[(int) predictor].hitrate;

if (taken != TAKEN)
  probability = REG_BR_PROB_BASE10000 - probability;

for (i = *preds; i; i = i->ep_next)
  if (i->ep_predictor == predictor
&& i->ep_edge == e
&& i->ep_probability == probability)
    return true;
return false;
560}

562/* Same predicate as above, working on edges.  */
563bool
564edge_probability_reliable_p (const_edge e)
565{
return e->probability.probably_reliable_p ();
567}

569/* Same predicate as edge_probability_reliable_p, working on notes.  */
570bool
571br_prob_note_reliable_p (const_rtx note)
572{
gcc_assert (REG_NOTE_KIND (note) == REG_BR_PROB)((void)(!(((enum reg_note) ((machine_mode) (note)->mode)) ==
 REG_BR_PROB) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 573, __FUNCTION__), 0 : 0));
return profile_probability::from_reg_br_prob_note
 (XINT (note, 0)(((note)->u.fld[0]).rt_int)).probably_reliable_p ();
576}

578static void
579predict_insn (rtx_insn *insn, enum br_predictor predictor, int probability)
580{
gcc_assert (any_condjump_p (insn))((void)(!(any_condjump_p (insn)) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 581, __FUNCTION__), 0 : 0));
if (!flag_guess_branch_probglobal_options.x_flag_guess_branch_prob)
  return;

add_reg_note (insn, REG_BR_PRED,
gen_rtx_CONCAT (VOIDmode,gen_rtx_fmt_ee_stat ((CONCAT), ((((void) 0, E_VOIDmode))), ((
gen_rtx_CONST_INT (((void) 0, E_VOIDmode), ((int) predictor))
)), ((gen_rtx_CONST_INT (((void) 0, E_VOIDmode), ((int) probability
)))) )
		GEN_INT ((int) predictor),gen_rtx_fmt_ee_stat ((CONCAT), ((((void) 0, E_VOIDmode))), ((
gen_rtx_CONST_INT (((void) 0, E_VOIDmode), ((int) predictor))
)), ((gen_rtx_CONST_INT (((void) 0, E_VOIDmode), ((int) probability
)))) )
		GEN_INT ((int) probability))gen_rtx_fmt_ee_stat ((CONCAT), ((((void) 0, E_VOIDmode))), ((
gen_rtx_CONST_INT (((void) 0, E_VOIDmode), ((int) predictor))
)), ((gen_rtx_CONST_INT (((void) 0, E_VOIDmode), ((int) probability
)))) ));
589}

591/* Predict insn by given predictor.  */

593void
594predict_insn_def (rtx_insn *insn, enum br_predictor predictor,
  enum prediction taken)
596{
 int probability = predictor_info[(int) predictor].hitrate;
 gcc_assert (probability != PROB_UNINITIALIZED)((void)(!(probability != (-1)) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 598, __FUNCTION__), 0 : 0));

 if (taken != TAKEN)
   probability = REG_BR_PROB_BASE10000 - probability;

 predict_insn (insn, predictor, probability);
604}

606/* Predict edge E with given probability if possible.  */

608void
609rtl_predict_edge (edge e, enum br_predictor predictor, int probability)
610{
rtx_insn *last_insn;
last_insn = BB_END (e->src)(e->src)->il.x.rtl->end_;

/* We can store the branch prediction information only about
   conditional jumps.  */
if (!any_condjump_p (last_insn))
  return;

/* We always store probability of branching.  */
if (e->flags & EDGE_FALLTHRU)
  probability = REG_BR_PROB_BASE10000 - probability;

predict_insn (last_insn, predictor, probability);
624}

626/* Predict edge E with the given PROBABILITY.  */
627void
628gimple_predict_edge (edge e, enum br_predictor predictor, int probability)
629{
if (e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr)
    && EDGE_COUNT (e->src->succs)vec_safe_length (e->src->succs) > 1
    && flag_guess_branch_probglobal_options.x_flag_guess_branch_prob
    && optimizeglobal_options.x_optimize)
  {
    struct edge_prediction *i = XNEW (struct edge_prediction)((struct edge_prediction *) xmalloc (sizeof (struct edge_prediction
)));
    edge_prediction *&preds = bb_predictions->get_or_insert (e->src);

    i->ep_next = preds;
    preds = i;
    i->ep_probability = probability;
    i->ep_predictor = predictor;
    i->ep_edge = e;
  }
644}

646/* Filter edge predictions PREDS by a function FILTER: if FILTER return false
 the prediction is removed.
 DATA are passed to the filter function.  */

650static void
651filter_predictions (edge_prediction **preds,
    bool (*filter) (edge_prediction *, void *), void *data)
653{
if (!bb_predictions)
  return;

if (preds)
  {
    struct edge_prediction **prediction = preds;
    struct edge_prediction *next;

    while (*prediction)
{
 if ((*filter) (*prediction, data))
   prediction = &((*prediction)->ep_next);
 else
   {
     next = (*prediction)->ep_next;
     free (*prediction);
     *prediction = next;
   }
}
  }
674}

676/* Filter function predicate that returns true for a edge predicate P
 if its edge is equal to DATA.  */

679static bool
680not_equal_edge_p (edge_prediction *p, void *data)
681{
return p->ep_edge != (edge)data;
683}

685/* Remove all predictions on given basic block that are attached
 to edge E.  */
687void
688remove_predictions_associated_with_edge (edge e)
689{
if (!bb_predictions)
  return;

edge_prediction **preds = bb_predictions->get (e->src);
filter_predictions (preds, not_equal_edge_p, e);
695}

697/* Clears the list of predictions stored for BB.  */

699static void
700clear_bb_predictions (basic_block bb)
701{
edge_prediction **preds = bb_predictions->get (bb);
struct edge_prediction *pred, *next;

if (!preds)
  return;

for (pred = *preds; pred; pred = next)
  {
    next = pred->ep_next;
    free (pred);
  }
*preds = NULLnullptr;
714}

716/* Return true when we can store prediction on insn INSN.
 At the moment we represent predictions only on conditional
 jumps, not at computed jump or other complicated cases.  */
719static bool
720can_predict_insn_p (const rtx_insn *insn)
721{
return (JUMP_P (insn)(((enum rtx_code) (insn)->code) == JUMP_INSN)
 && any_condjump_p (insn)
 && EDGE_COUNT (BLOCK_FOR_INSN (insn)->succs)vec_safe_length (BLOCK_FOR_INSN (insn)->succs) >= 2);
725}

727/* Predict edge E by given predictor if possible.  */

729void
730predict_edge_def (edge e, enum br_predictor predictor,
  enum prediction taken)
732{
 int probability = predictor_info[(int) predictor].hitrate;

 if (taken != TAKEN)
   probability = REG_BR_PROB_BASE10000 - probability;

 predict_edge (e, predictor, probability);
739}

741/* Invert all branch predictions or probability notes in the INSN.  This needs
 to be done each time we invert the condition used by the jump.  */

744void
745invert_br_probabilities (rtx insn)
746{
rtx note;

for (note = REG_NOTES (insn)(((insn)->u.fld[6]).rt_rtx); note; note = XEXP (note, 1)(((note)->u.fld[1]).rt_rtx))
  if (REG_NOTE_KIND (note)((enum reg_note) ((machine_mode) (note)->mode)) == REG_BR_PROB)
    XINT (note, 0)(((note)->u.fld[0]).rt_int) = profile_probability::from_reg_br_prob_note
	 (XINT (note, 0)(((note)->u.fld[0]).rt_int)).invert ().to_reg_br_prob_note ();
  else if (REG_NOTE_KIND (note)((enum reg_note) ((machine_mode) (note)->mode)) == REG_BR_PRED)
    XEXP (XEXP (note, 0), 1)((((((note)->u.fld[0]).rt_rtx))->u.fld[1]).rt_rtx)
= GEN_INT (REG_BR_PROB_BASE - INTVAL (XEXP (XEXP (note, 0), 1)))gen_rtx_CONST_INT (((void) 0, E_VOIDmode), (10000 - ((((((((note
)->u.fld[0]).rt_rtx))->u.fld[1]).rt_rtx))->u.hwint[0
])));
756}

758/* Dump information about the branch prediction to the output file.  */

760static void
761dump_prediction (FILE *file, enum br_predictor predictor, int probability,
 basic_block bb, enum predictor_reason reason = REASON_NONE,
 edge ep_edge = NULLnullptr)
764{
edge e = ep_edge;
edge_iterator ei;

if (!file8.1
'file' is non-null
1
'file' is non-null
)
9
←
Taking false branch→
  return;

if (e == NULLnullptr)
10
←
Taking true branch→
  FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
11
←
Calling 'ei_cond'→
14
←
Returning from 'ei_cond'→
15
←
Loop condition is false. Execution continues on line 776→
    if (! (e->flags & EDGE_FALLTHRU))
break;

char edge_info_str[128];
if (ep_edge15.1
'ep_edge' is null
1
'ep_edge' is null
)
16
←
Taking false branch→
  sprintf (edge_info_str, " of edge %d->%d", ep_edge->src->index,
    ep_edge->dest->index);
else
  edge_info_str[0] = '\0';

fprintf (file, "  %s heuristics%s%s: %.2f%%",
  predictor_info[predictor].name,
  edge_info_str, reason_messages[reason],
  probability * 100.0 / REG_BR_PROB_BASE10000);

if (bb->count.initialized_p ())
17
←
Taking true branch→
  {
    fprintf (file, "  exec ");
    bb->count.dump (file);
    if (e17.1
'e' is null
1
'e' is null
)
18
←
Taking false branch→
{
 fprintf (file, " hit ");
 e->count ().dump (file);
 fprintf (file, " (%.1f%%)", e->count ().to_gcov_type() * 100.0
   / bb->count.to_gcov_type ());
}
  }

fprintf (file, "\n");

/* Print output that be easily read by analyze_brprob.py script. We are
   interested only in counts that are read from GCDA files.  */
if (dump_file && (dump_flags & TDF_DETAILS)
19
←
Assuming 'dump_file' is non-null→
20
←
Assuming the condition is true→
21
←
Taking true branch→
    && bb->count.precise_p ()
    && reason20.1
'reason' is equal to REASON_NONE
1
'reason' is equal to REASON_NONE
 == REASON_NONE)
  {
    fprintf (file, ";;heuristics;%s;%" PRId64"l" "d" ";%" PRId64"l" "d" ";%.1f;\n",
      predictor_info[predictor].name,
      bb->count.to_gcov_type (), e->count ().to_gcov_type (),
22
←
Called C++ object pointer is null
      probability * 100.0 / REG_BR_PROB_BASE10000);
  }
814}

816/* Return true if STMT is known to be unlikely executed.  */

818static bool
819unlikely_executed_stmt_p (gimple *stmt)
820{
if (!is_gimple_call (stmt))
  return false;
/* NORETURN attribute alone is not strong enough: exit() may be quite
   likely executed once during program run.  */
if (gimple_call_fntype (stmt)
    && lookup_attribute ("cold",
	   TYPE_ATTRIBUTES (gimple_call_fntype (stmt))((tree_class_check ((gimple_call_fntype (stmt)), (tcc_type), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 827, __FUNCTION__))->type_common.attributes))
    && !lookup_attribute ("cold", DECL_ATTRIBUTES (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 828, __FUNCTION__))->decl_common.attributes)))
  return true;
tree decl = gimple_call_fndecl (stmt);
if (!decl)
  return false;
if (lookup_attribute ("cold", DECL_ATTRIBUTES (decl)((contains_struct_check ((decl), (TS_DECL_COMMON), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 833, __FUNCTION__))->decl_common.attributes))
    && !lookup_attribute ("cold", DECL_ATTRIBUTES (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 834, __FUNCTION__))->decl_common.attributes)))
  return true;

cgraph_node *n = cgraph_node::get (decl);
if (!n)
  return false;

availability avail;
n = n->ultimate_alias_target (&avail);
if (avail < AVAIL_AVAILABLE)
  return false;
if (!n->analyzed
    || n->decl == current_function_decl)
  return false;
return n->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED;
849}

851/* Return true if BB is unlikely executed.  */

853static bool
854unlikely_executed_bb_p (basic_block bb)
855{
if (bb->count == profile_count::zero ())
  return true;
if (bb == ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr) || bb == EXIT_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_exit_block_ptr))
  return false;
for (gimple_stmt_iterator gsi = gsi_start_bb (bb);
     !gsi_end_p (gsi); gsi_next (&gsi))
  {
    if (unlikely_executed_stmt_p (gsi_stmt (gsi)))
      return true;
    if (stmt_can_terminate_bb_p (gsi_stmt (gsi)))
return false;
  }
return false;
869}

871/* We cannot predict the probabilities of outgoing edges of bb.  Set them
 evenly and hope for the best.  If UNLIKELY_EDGES is not null, distribute
 even probability for all edges not mentioned in the set.  These edges
 are given PROB_VERY_UNLIKELY probability.  Similarly for LIKELY_EDGES,
 if we have exactly one likely edge, make the other edges predicted
 as not probable.  */

878static void
879set_even_probabilities (basic_block bb,
	hash_set<edge> *unlikely_edges = NULLnullptr,
	hash_set<edge_prediction *> *likely_edges = NULLnullptr)
882{
unsigned nedges = 0, unlikely_count = 0;
edge e = NULLnullptr;
edge_iterator ei;
profile_probability all = profile_probability::always ();

FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
  if (e->probability.initialized_p ())
    all -= e->probability;
  else if (!unlikely_executed_edge_p (e))
    {
nedges++;
      if (unlikely_edges != NULLnullptr && unlikely_edges->contains (e))
 {
   all -= profile_probability::very_unlikely ();
   unlikely_count++;
 }
    }

/* Make the distribution even if all edges are unlikely.  */
unsigned likely_count = likely_edges ? likely_edges->elements () : 0;
if (unlikely_count == nedges)
  {
    unlikely_edges = NULLnullptr;
    unlikely_count = 0;
  }

/* If we have one likely edge, then use its probability and distribute
   remaining probabilities as even.  */
if (likely_count == 1)
  {
    FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
if (e->probability.initialized_p ())
 ;
else if (!unlikely_executed_edge_p (e))
 {
   edge_prediction *prediction = *likely_edges->begin ();
   int p = prediction->ep_probability;
   profile_probability prob
     = profile_probability::from_reg_br_prob_base (p);

   if (prediction->ep_edge == e)
     e->probability = prob;
   else if (unlikely_edges != NULLnullptr && unlikely_edges->contains (e))
     e->probability = profile_probability::very_unlikely ();
   else
     {
profile_probability remainder = prob.invert ();
remainder -= (profile_probability::very_unlikely ()
	      * unlikely_count);
int count = nedges - unlikely_count - 1;
gcc_assert (count >= 0)((void)(!(count >= 0) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 933, __FUNCTION__), 0 : 0));

e->probability = remainder / count;
     }
 }
else
 e->probability = profile_probability::never ();
  }
else
  {
    /* Make all unlikely edges unlikely and the rest will have even
probability.  */
    unsigned scale = nedges - unlikely_count;
    FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
if (e->probability.initialized_p ())
 ;
else if (!unlikely_executed_edge_p (e))
 {
   if (unlikely_edges != NULLnullptr && unlikely_edges->contains (e))
     e->probability = profile_probability::very_unlikely ();
   else
     e->probability = all / scale;
 }
else
 e->probability = profile_probability::never ();
  }
959}

961/* Add REG_BR_PROB note to JUMP with PROB.  */

963void
964add_reg_br_prob_note (rtx_insn *jump, profile_probability prob)
965{
gcc_checking_assert (JUMP_P (jump) && !find_reg_note (jump, REG_BR_PROB, 0))((void)(!((((enum rtx_code) (jump)->code) == JUMP_INSN) &&
 !find_reg_note (jump, REG_BR_PROB, 0)) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 966, __FUNCTION__), 0 : 0));
add_int_reg_note (jump, REG_BR_PROB, prob.to_reg_br_prob_note ());
968}

970/* Combine all REG_BR_PRED notes into single probability and attach REG_BR_PROB
 note if not already present.  Remove now useless REG_BR_PRED notes.  */

973static void
974combine_predictions_for_insn (rtx_insn *insn, basic_block bb)
975{
rtx prob_note;
rtx *pnote;
rtx note;
int best_probability = PROB_EVEN(10000 / 2);
enum br_predictor best_predictor = END_PREDICTORS;
int combined_probability = REG_BR_PROB_BASE10000 / 2;
int d;
bool first_match = false;
bool found = false;

if (!can_predict_insn_p (insn))
2
←
Taking false branch→
  {
    set_even_probabilities (bb);
    return;
  }

prob_note = find_reg_note (insn, REG_BR_PROB, 0);
pnote = &REG_NOTES (insn)(((insn)->u.fld[6]).rt_rtx);
if (dump_file)
3
←
Assuming 'dump_file' is non-null→
4
←
Taking true branch→
  fprintf (dump_file, "Predictions for insn %i bb %i\n", INSN_UID (insn),
    bb->index);

/* We implement "first match" heuristics and use probability guessed
   by predictor with smallest index.  */
for (note = REG_NOTES (insn)(((insn)->u.fld[6]).rt_rtx); note; note = XEXP (note, 1)(((note)->u.fld[1]).rt_rtx))
5
←
Loop condition is false. Execution continues on line 1029→
  if (REG_NOTE_KIND (note)((enum reg_note) ((machine_mode) (note)->mode)) == REG_BR_PRED)
    {
enum br_predictor predictor = ((enum br_predictor)
		       INTVAL (XEXP (XEXP (note, 0), 0))((((((((note)->u.fld[0]).rt_rtx))->u.fld[0]).rt_rtx))->
u.hwint[0]));
int probability = INTVAL (XEXP (XEXP (note, 0), 1))((((((((note)->u.fld[0]).rt_rtx))->u.fld[1]).rt_rtx))->
u.hwint[0]);

found = true;
if (best_predictor > predictor
   && predictor_info[predictor].flags & PRED_FLAG_FIRST_MATCH1)
 best_probability = probability, best_predictor = predictor;

d = (combined_probability * probability
    + (REG_BR_PROB_BASE10000 - combined_probability)
    * (REG_BR_PROB_BASE10000 - probability));

/* Use FP math to avoid overflows of 32bit integers.  */
if (d == 0)
 /* If one probability is 0% and one 100%, avoid division by zero.  */
 combined_probability = REG_BR_PROB_BASE10000 / 2;
else
 combined_probability = (((double) combined_probability) * probability
		  * REG_BR_PROB_BASE10000 / d + 0.5);
    }

/* Decide which heuristic to use.  In case we didn't match anything,
   use no_prediction heuristic, in case we did match, use either
   first match or Dempster-Shaffer theory depending on the flags.  */

if (best_predictor5.1
'best_predictor' is equal to END_PREDICTORS
1
'best_predictor' is equal to END_PREDICTORS
 != END_PREDICTORS)
6
←
Taking false branch→
  first_match = true;

if (!found6.1
'found' is false
1
'found' is false
)
7
←
Taking true branch→
  dump_prediction (dump_file, PRED_NO_PREDICTION,
8
←
Calling 'dump_prediction'→
     combined_probability, bb);
else
  {
    if (!first_match)
dump_prediction (dump_file, PRED_DS_THEORY, combined_probability,
	 bb, !first_match ? REASON_NONE : REASON_IGNORED);
    else
dump_prediction (dump_file, PRED_FIRST_MATCH, best_probability,
	 bb, first_match ? REASON_NONE : REASON_IGNORED);
  }

if (first_match)
  combined_probability = best_probability;
dump_prediction (dump_file, PRED_COMBINED, combined_probability, bb);

while (*pnote)
  {
    if (REG_NOTE_KIND (*pnote)((enum reg_note) ((machine_mode) (*pnote)->mode)) == REG_BR_PRED)
{
 enum br_predictor predictor = ((enum br_predictor)
			 INTVAL (XEXP (XEXP (*pnote, 0), 0))((((((((*pnote)->u.fld[0]).rt_rtx))->u.fld[0]).rt_rtx))
->u.hwint[0]));
 int probability = INTVAL (XEXP (XEXP (*pnote, 0), 1))((((((((*pnote)->u.fld[0]).rt_rtx))->u.fld[1]).rt_rtx))
->u.hwint[0]);

 dump_prediction (dump_file, predictor, probability, bb,
	   (!first_match || best_predictor == predictor)
	   ? REASON_NONE : REASON_IGNORED);
 *pnote = XEXP (*pnote, 1)(((*pnote)->u.fld[1]).rt_rtx);
}
    else
pnote = &XEXP (*pnote, 1)(((*pnote)->u.fld[1]).rt_rtx);
  }

if (!prob_note)
  {
    profile_probability p
= profile_probability::from_reg_br_prob_base (combined_probability);
    add_reg_br_prob_note (insn, p);

    /* Save the prediction into CFG in case we are seeing non-degenerated
conditional jump.  */
    if (!single_succ_p (bb))
{
 BRANCH_EDGE (bb)((*((bb))->succs)[(0)]->flags & EDGE_FALLTHRU ? (*(
(bb))->succs)[(1)] : (*((bb))->succs)[(0)])->probability = p;
 FALLTHRU_EDGE (bb)((*((bb))->succs)[(0)]->flags & EDGE_FALLTHRU ? (*(
(bb))->succs)[(0)] : (*((bb))->succs)[(1)])->probability
   = BRANCH_EDGE (bb)((*((bb))->succs)[(0)]->flags & EDGE_FALLTHRU ? (*(
(bb))->succs)[(1)] : (*((bb))->succs)[(0)])->probability.invert ();
}
  }
else if (!single_succ_p (bb))
  {
    profile_probability prob = profile_probability::from_reg_br_prob_note
			(XINT (prob_note, 0)(((prob_note)->u.fld[0]).rt_int));

    BRANCH_EDGE (bb)((*((bb))->succs)[(0)]->flags & EDGE_FALLTHRU ? (*(
(bb))->succs)[(1)] : (*((bb))->succs)[(0)])->probability = prob;
    FALLTHRU_EDGE (bb)((*((bb))->succs)[(0)]->flags & EDGE_FALLTHRU ? (*(
(bb))->succs)[(0)] : (*((bb))->succs)[(1)])->probability = prob.invert ();
  }
else
  single_succ_edge (bb)->probability = profile_probability::always ();
1091}

1093/* Edge prediction hash traits.  */

1095struct predictor_hash: pointer_hash <edge_prediction>
1096{

static inline hashval_t hash (const edge_prediction *);
static inline bool equal (const edge_prediction *, const edge_prediction *);
1100};

1102/* Calculate hash value of an edge prediction P based on predictor and
 normalized probability.  */

1105inline hashval_t
1106predictor_hash::hash (const edge_prediction *p)
1107{
inchash::hash hstate;
hstate.add_int (p->ep_predictor);

int prob = p->ep_probability;
if (prob > REG_BR_PROB_BASE10000 / 2)
  prob = REG_BR_PROB_BASE10000 - prob;

hstate.add_int (prob);

return hstate.end ();
1118}

1120/* Return true whether edge predictions P1 and P2 use the same predictor and
 have equal (or opposed probability).  */

1123inline bool
1124predictor_hash::equal (const edge_prediction *p1, const edge_prediction *p2)
1125{
return (p1->ep_predictor == p2->ep_predictor
 && (p1->ep_probability == p2->ep_probability
     || p1->ep_probability == REG_BR_PROB_BASE10000 - p2->ep_probability));
1129}

1131struct predictor_hash_traits: predictor_hash,
typed_noop_remove <edge_prediction *> {};

1134/* Return true if edge prediction P is not in DATA hash set.  */

1136static bool
1137not_removed_prediction_p (edge_prediction *p, void *data)
1138{
hash_set<edge_prediction *> *remove = (hash_set<edge_prediction *> *) data;
return !remove->contains (p);
1141}

1143/* Prune predictions for a basic block BB.  Currently we do following
 clean-up steps:

 1) remove duplicate prediction that is guessed with the same probability
    (different than 1/2) to both edge
 2) remove duplicates for a prediction that belongs with the same probability
    to a single edge

*/

1153static void
1154prune_predictions_for_bb (basic_block bb)
1155{
edge_prediction **preds = bb_predictions->get (bb);

if (preds)
  {
    hash_table <predictor_hash_traits> s (13);
    hash_set <edge_prediction *> remove;

    /* Step 1: identify predictors that should be removed.  */
    for (edge_prediction *pred = *preds; pred; pred = pred->ep_next)
{
 edge_prediction *existing = s.find (pred);
 if (existing)
   {
     if (pred->ep_edge == existing->ep_edge
  && pred->ep_probability == existing->ep_probability)
{
  /* Remove a duplicate predictor.  */
  dump_prediction (dump_file, pred->ep_predictor,
		   pred->ep_probability, bb,
		   REASON_SINGLE_EDGE_DUPLICATE, pred->ep_edge);

  remove.add (pred);
}
     else if (pred->ep_edge != existing->ep_edge
       && pred->ep_probability == existing->ep_probability
       && pred->ep_probability != REG_BR_PROB_BASE10000 / 2)
{
  /* Remove both predictors as they predict the same
     for both edges.  */
  dump_prediction (dump_file, existing->ep_predictor,
		   pred->ep_probability, bb,
		   REASON_EDGE_PAIR_DUPLICATE,
		   existing->ep_edge);
  dump_prediction (dump_file, pred->ep_predictor,
		   pred->ep_probability, bb,
		   REASON_EDGE_PAIR_DUPLICATE,
		   pred->ep_edge);

  remove.add (existing);
  remove.add (pred);
}
   }

 edge_prediction **slot2 = s.find_slot (pred, INSERT);
 *slot2 = pred;
}

    /* Step 2: Remove predictors.  */
    filter_predictions (preds, not_removed_prediction_p, &remove);
  }
1206}

1208/* Combine predictions into single probability and store them into CFG.
 Remove now useless prediction entries.
 If DRY_RUN is set, only produce dumps and do not modify profile.  */

1212static void
1213combine_predictions_for_bb (basic_block bb, bool dry_run)
1214{
int best_probability = PROB_EVEN(10000 / 2);
enum br_predictor best_predictor = END_PREDICTORS;
int combined_probability = REG_BR_PROB_BASE10000 / 2;
int d;
bool first_match = false;
bool found = false;
struct edge_prediction *pred;
int nedges = 0;
edge e, first = NULLnullptr, second = NULLnullptr;
edge_iterator ei;
int nzero = 0;
int nunknown = 0;

FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
  {
    if (!unlikely_executed_edge_p (e))
      {
 nedges ++;
 if (first && !second)
   second = e;
 if (!first)
   first = e;
      }
    else if (!e->probability.initialized_p ())
      e->probability = profile_probability::never ();
   if (!e->probability.initialized_p ())
      nunknown++;
   else if (e->probability == profile_probability::never ())
nzero++;
  }

/* When there is no successor or only one choice, prediction is easy.

   When we have a basic block with more than 2 successors, the situation
   is more complicated as DS theory cannot be used literally.
   More precisely, let's assume we predicted edge e1 with probability p1,
   thus: m1({b1}) = p1.  As we're going to combine more than 2 edges, we
   need to find probability of e.g. m1({b2}), which we don't know.
   The only approximation is to equally distribute 1-p1 to all edges
   different from b1.

   According to numbers we've got from SPEC2006 benchark, there's only
   one interesting reliable predictor (noreturn call), which can be
   handled with a bit easier approach.  */
if (nedges != 2)
  {
    hash_set<edge> unlikely_edges (4);
    hash_set<edge_prediction *> likely_edges (4);

    /* Identify all edges that have a probability close to very unlikely.
Doing the approach for very unlikely doesn't worth for doing as
there's no such probability in SPEC2006 benchmark.  */
    edge_prediction **preds = bb_predictions->get (bb);
    if (preds)
for (pred = *preds; pred; pred = pred->ep_next)
 {
   if (pred->ep_probability <= PROB_VERY_UNLIKELY(10000 / 2000 - 1)
|| pred->ep_predictor == PRED_COLD_LABEL)
     unlikely_edges.add (pred->ep_edge);
   else if (pred->ep_probability >= PROB_VERY_LIKELY(10000 - (10000 / 2000 - 1))
     || pred->ep_predictor == PRED_BUILTIN_EXPECT
     || pred->ep_predictor == PRED_HOT_LABEL)
     likely_edges.add (pred);
 }

    /* It can happen that an edge is both in likely_edges and unlikely_edges.
Clear both sets in that situation.  */
    for (hash_set<edge_prediction *>::iterator it = likely_edges.begin ();
  it != likely_edges.end (); ++it)
if (unlikely_edges.contains ((*it)->ep_edge))
 {
   likely_edges.empty ();
   unlikely_edges.empty ();
   break;
 }

    if (!dry_run)
set_even_probabilities (bb, &unlikely_edges, &likely_edges);
    clear_bb_predictions (bb);
    if (dump_file)
{
 fprintf (dump_file, "Predictions for bb %i\n", bb->index);
 if (unlikely_edges.is_empty ())
   fprintf (dump_file,
     "%i edges in bb %i predicted to even probabilities\n",
     nedges, bb->index);
 else
   {
     fprintf (dump_file,
       "%i edges in bb %i predicted with some unlikely edges\n",
       nedges, bb->index);
     FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
if (!unlikely_executed_edge_p (e))
  dump_prediction (dump_file, PRED_COMBINED,
   e->probability.to_reg_br_prob_base (), bb, REASON_NONE, e);
   }
}
    return;
  }

if (dump_file)
  fprintf (dump_file, "Predictions for bb %i\n", bb->index);

prune_predictions_for_bb (bb);

edge_prediction **preds = bb_predictions->get (bb);

if (preds)
  {
    /* We implement "first match" heuristics and use probability guessed
by predictor with smallest index.  */
    for (pred = *preds; pred; pred = pred->ep_next)
{
 enum br_predictor predictor = pred->ep_predictor;
 int probability = pred->ep_probability;

 if (pred->ep_edge != first)
   probability = REG_BR_PROB_BASE10000 - probability;

 found = true;
 /* First match heuristics would be widly confused if we predicted
    both directions.  */
 if (best_predictor > predictor
   && predictor_info[predictor].flags & PRED_FLAG_FIRST_MATCH1)
   {
            struct edge_prediction *pred2;
     int prob = probability;

     for (pred2 = (struct edge_prediction *) *preds;
   pred2; pred2 = pred2->ep_next)
      if (pred2 != pred && pred2->ep_predictor == pred->ep_predictor)
        {
   int probability2 = pred2->ep_probability;

   if (pred2->ep_edge != first)
     probability2 = REG_BR_PROB_BASE10000 - probability2;

   if ((probability < REG_BR_PROB_BASE10000 / 2) !=
       (probability2 < REG_BR_PROB_BASE10000 / 2))
     break;

   /* If the same predictor later gave better result, go for it! */
   if ((probability >= REG_BR_PROB_BASE10000 / 2 && (probability2 > probability))
       || (probability <= REG_BR_PROB_BASE10000 / 2 && (probability2 < probability)))
     prob = probability2;
 }
     if (!pred2)
       best_probability = prob, best_predictor = predictor;
   }

 d = (combined_probability * probability
      + (REG_BR_PROB_BASE10000 - combined_probability)
      * (REG_BR_PROB_BASE10000 - probability));

 /* Use FP math to avoid overflows of 32bit integers.  */
 if (d == 0)
   /* If one probability is 0% and one 100%, avoid division by zero.  */
   combined_probability = REG_BR_PROB_BASE10000 / 2;
 else
   combined_probability = (((double) combined_probability)
		    * probability
    		    * REG_BR_PROB_BASE10000 / d + 0.5);
}
  }

/* Decide which heuristic to use.  In case we didn't match anything,
   use no_prediction heuristic, in case we did match, use either
   first match or Dempster-Shaffer theory depending on the flags.  */

if (best_predictor != END_PREDICTORS)
  first_match = true;

if (!found)
  dump_prediction (dump_file, PRED_NO_PREDICTION, combined_probability, bb);
else
  {
    if (!first_match)
dump_prediction (dump_file, PRED_DS_THEORY, combined_probability, bb,
	 !first_match ? REASON_NONE : REASON_IGNORED);
    else
dump_prediction (dump_file, PRED_FIRST_MATCH, best_probability, bb,
	 first_match ? REASON_NONE : REASON_IGNORED);
  }

if (first_match)
  combined_probability = best_probability;
dump_prediction (dump_file, PRED_COMBINED, combined_probability, bb);

if (preds)
  {
    for (pred = (struct edge_prediction *) *preds; pred; pred = pred->ep_next)
{
 enum br_predictor predictor = pred->ep_predictor;
 int probability = pred->ep_probability;

 dump_prediction (dump_file, predictor, probability, bb,
	   (!first_match || best_predictor == predictor)
	   ? REASON_NONE : REASON_IGNORED, pred->ep_edge);
}
  }
clear_bb_predictions (bb);


/* If we have only one successor which is unknown, we can compute missing
   probability.  */
if (nunknown == 1)
  {
    profile_probability prob = profile_probability::always ();
    edge missing = NULLnullptr;

    FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
if (e->probability.initialized_p ())
 prob -= e->probability;
else if (missing == NULLnullptr)
 missing = e;
else
 gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 1431, __FUNCTION__));
     missing->probability = prob;
  }
/* If nothing is unknown, we have nothing to update.  */
else if (!nunknown && nzero != (int)EDGE_COUNT (bb->succs)vec_safe_length (bb->succs))
  ;
else if (!dry_run)
  {
    first->probability
= profile_probability::from_reg_br_prob_base (combined_probability);
    second->probability = first->probability.invert ();
  }
1443}

1445/* Check if T1 and T2 satisfy the IV_COMPARE condition.
 Return the SSA_NAME if the condition satisfies, NULL otherwise.

 T1 and T2 should be one of the following cases:
   1. T1 is SSA_NAME, T2 is NULL
   2. T1 is SSA_NAME, T2 is INTEGER_CST between [-4, 4]
   3. T2 is SSA_NAME, T1 is INTEGER_CST between [-4, 4]  */

1453static tree
1454strips_small_constant (tree t1, tree t2)
1455{
tree ret = NULLnullptr;
int value = 0;

if (!t1)
  return NULLnullptr;
else if (TREE_CODE (t1)((enum tree_code) (t1)->base.code) == SSA_NAME)
  ret = t1;
else if (tree_fits_shwi_p (t1))
  value = tree_to_shwi (t1);
else
  return NULLnullptr;

if (!t2)
  return ret;
else if (tree_fits_shwi_p (t2))
  value = tree_to_shwi (t2);
else if (TREE_CODE (t2)((enum tree_code) (t2)->base.code) == SSA_NAME)
  {
    if (ret)
      return NULLnullptr;
    else
      ret = t2;
  }

if (value <= 4 && value >= -4)
  return ret;
else
  return NULLnullptr;
1484}

1486/* Return the SSA_NAME in T or T's operands.
 Return NULL if SSA_NAME cannot be found.  */

1489static tree
1490get_base_value (tree t)
1491{
if (TREE_CODE (t)((enum tree_code) (t)->base.code) == SSA_NAME)
  return t;

if (!BINARY_CLASS_P (t)(tree_code_type_tmpl <0>::tree_code_type[(int) (((enum tree_code
) (t)->base.code))] == tcc_binary))
  return NULLnullptr;

switch (TREE_OPERAND_LENGTH (t)tree_operand_length (t))
  {
  case 1:
    return strips_small_constant (TREE_OPERAND (t, 0)(*((const_cast<tree*> (tree_operand_check ((t), (0), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 1501, __FUNCTION__))))), NULLnullptr);
  case 2:
    return strips_small_constant (TREE_OPERAND (t, 0)(*((const_cast<tree*> (tree_operand_check ((t), (0), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 1503, __FUNCTION__))))),
		    TREE_OPERAND (t, 1)(*((const_cast<tree*> (tree_operand_check ((t), (1), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 1504, __FUNCTION__))))));
  default:
    return NULLnullptr;
  }
1508}

1510/* Check the compare STMT in LOOP. If it compares an induction
 variable to a loop invariant, return true, and save
 LOOP_INVARIANT, COMPARE_CODE and LOOP_STEP.
 Otherwise return false and set LOOP_INVAIANT to NULL.  */

1515static bool
1516is_comparison_with_loop_invariant_p (gcond *stmt, class loop *loop,
		     tree *loop_invariant,
		     enum tree_code *compare_code,
		     tree *loop_step,
		     tree *loop_iv_base)
1521{
tree op0, op1, bound, base;
affine_iv iv0, iv1;
enum tree_code code;
tree step;

code = gimple_cond_code (stmt);
*loop_invariant = NULLnullptr;

switch (code)
  {
  case GT_EXPR:
  case GE_EXPR:
  case NE_EXPR:
  case LT_EXPR:
  case LE_EXPR:
  case EQ_EXPR:
    break;

  default:
    return false;
  }

op0 = gimple_cond_lhs (stmt);
op1 = gimple_cond_rhs (stmt);

if ((TREE_CODE (op0)((enum tree_code) (op0)->base.code) != SSA_NAME && TREE_CODE (op0)((enum tree_code) (op0)->base.code) != INTEGER_CST) 
     || (TREE_CODE (op1)((enum tree_code) (op1)->base.code) != SSA_NAME && TREE_CODE (op1)((enum tree_code) (op1)->base.code) != INTEGER_CST))
  return false;
if (!simple_iv (loop, loop_containing_stmt (stmt), op0, &iv0, true))
  return false;
if (!simple_iv (loop, loop_containing_stmt (stmt), op1, &iv1, true))
  return false;
if (TREE_CODE (iv0.step)((enum tree_code) (iv0.step)->base.code) != INTEGER_CST
    || TREE_CODE (iv1.step)((enum tree_code) (iv1.step)->base.code) != INTEGER_CST)
  return false;
if ((integer_zerop (iv0.step) && integer_zerop (iv1.step))
    || (!integer_zerop (iv0.step) && !integer_zerop (iv1.step)))
  return false;

if (integer_zerop (iv0.step))
  {
    if (code != NE_EXPR && code != EQ_EXPR)
code = invert_tree_comparison (code, false);
    bound = iv0.base;
    base = iv1.base;
    if (tree_fits_shwi_p (iv1.step))
step = iv1.step;
    else
return false;
  }
else
  {
    bound = iv1.base;
    base = iv0.base;
    if (tree_fits_shwi_p (iv0.step))
step = iv0.step;
    else
return false;
  }

if (TREE_CODE (bound)((enum tree_code) (bound)->base.code) != INTEGER_CST)
  bound = get_base_value (bound);
if (!bound)
  return false;
if (TREE_CODE (base)((enum tree_code) (base)->base.code) != INTEGER_CST)
  base = get_base_value (base);
if (!base)
  return false;

*loop_invariant = bound;
*compare_code = code;
*loop_step = step;
*loop_iv_base = base;
return true;
1596}

1598/* Compare two SSA_NAMEs: returns TRUE if T1 and T2 are value coherent.  */

1600static bool
1601expr_coherent_p (tree t1, tree t2)
1602{
gimple *stmt;
tree ssa_name_1 = NULLnullptr;
tree ssa_name_2 = NULLnullptr;

gcc_assert (TREE_CODE (t1) == SSA_NAME || TREE_CODE (t1) == INTEGER_CST)((void)(!(((enum tree_code) (t1)->base.code) == SSA_NAME ||
 ((enum tree_code) (t1)->base.code) == INTEGER_CST) ? fancy_abort
 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 1607, __FUNCTION__), 0 : 0));
gcc_assert (TREE_CODE (t2) == SSA_NAME || TREE_CODE (t2) == INTEGER_CST)((void)(!(((enum tree_code) (t2)->base.code) == SSA_NAME ||
 ((enum tree_code) (t2)->base.code) == INTEGER_CST) ? fancy_abort
 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 1608, __FUNCTION__), 0 : 0));

if (t1 == t2)
  return true;

if (TREE_CODE (t1)((enum tree_code) (t1)->base.code) == INTEGER_CST && TREE_CODE (t2)((enum tree_code) (t2)->base.code) == INTEGER_CST)
  return true;
if (TREE_CODE (t1)((enum tree_code) (t1)->base.code) == INTEGER_CST || TREE_CODE (t2)((enum tree_code) (t2)->base.code) == INTEGER_CST)
  return false;

/* Check to see if t1 is expressed/defined with t2.  */
stmt = SSA_NAME_DEF_STMT (t1)(tree_check ((t1), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 1619, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt;
gcc_assert (stmt != NULL)((void)(!(stmt != nullptr) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 1620, __FUNCTION__), 0 : 0));
if (is_gimple_assign (stmt))
  {
    ssa_name_1 = SINGLE_SSA_TREE_OPERAND (stmt, SSA_OP_USE)single_ssa_tree_operand (stmt, 0x01);
    if (ssa_name_1 && ssa_name_1 == t2)
return true;
  }

/* Check to see if t2 is expressed/defined with t1.  */
stmt = SSA_NAME_DEF_STMT (t2)(tree_check ((t2), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 1629, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt;
gcc_assert (stmt != NULL)((void)(!(stmt != nullptr) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 1630, __FUNCTION__), 0 : 0));
if (is_gimple_assign (stmt))
  {
    ssa_name_2 = SINGLE_SSA_TREE_OPERAND (stmt, SSA_OP_USE)single_ssa_tree_operand (stmt, 0x01);
    if (ssa_name_2 && ssa_name_2 == t1)
return true;
  }

/* Compare if t1 and t2's def_stmts are identical.  */
if (ssa_name_2 != NULLnullptr && ssa_name_1 == ssa_name_2)
  return true;
else
  return false;
1643}

1645/* Return true if E is predicted by one of loop heuristics.  */

1647static bool
1648predicted_by_loop_heuristics_p (basic_block bb)
1649{
struct edge_prediction *i;
edge_prediction **preds = bb_predictions->get (bb);

if (!preds)
  return false;

for (i = *preds; i; i = i->ep_next)
  if (i->ep_predictor == PRED_LOOP_ITERATIONS_GUESSED
|| i->ep_predictor == PRED_LOOP_ITERATIONS_MAX
|| i->ep_predictor == PRED_LOOP_ITERATIONS
|| i->ep_predictor == PRED_LOOP_EXIT
|| i->ep_predictor == PRED_LOOP_EXIT_WITH_RECURSION
|| i->ep_predictor == PRED_LOOP_EXTRA_EXIT)
    return true;
return false;
1665}

1667/* Predict branch probability of BB when BB contains a branch that compares
 an induction variable in LOOP with LOOP_IV_BASE_VAR to LOOP_BOUND_VAR. The
 loop exit is compared using LOOP_BOUND_CODE, with step of LOOP_BOUND_STEP.

 E.g.
   for (int i = 0; i < bound; i++) {
     if (i < bound - 2)
computation_1();
     else
computation_2();
   }

In this loop, we will predict the branch inside the loop to be taken.  */

1681static void
1682predict_iv_comparison (class loop *loop, basic_block bb,
       tree loop_bound_var,
       tree loop_iv_base_var,
       enum tree_code loop_bound_code,
       int loop_bound_step)
1687{
gimple *stmt;
tree compare_var, compare_base;
enum tree_code compare_code;
tree compare_step_var;
edge then_edge;
edge_iterator ei;

if (predicted_by_loop_heuristics_p (bb))
  return;

stmt = last_stmt (bb);
if (!stmt || gimple_code (stmt) != GIMPLE_COND)
  return;
if (!is_comparison_with_loop_invariant_p (as_a <gcond *> (stmt),
			    loop, &compare_var,
			    &compare_code,
			    &compare_step_var,
			    &compare_base))
  return;

/* Find the taken edge.  */
FOR_EACH_EDGE (then_edge, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(then_edge)); ei_next (&(ei)))
  if (then_edge->flags & EDGE_TRUE_VALUE)
    break;

/* When comparing an IV to a loop invariant, NE is more likely to be
   taken while EQ is more likely to be not-taken.  */
if (compare_code == NE_EXPR)
  {
    predict_edge_def (then_edge, PRED_LOOP_IV_COMPARE_GUESS, TAKEN);
    return;
  }
else if (compare_code == EQ_EXPR)
  {
    predict_edge_def (then_edge, PRED_LOOP_IV_COMPARE_GUESS, NOT_TAKEN);
    return;
  }

if (!expr_coherent_p (loop_iv_base_var, compare_base))
  return;

/* If loop bound, base and compare bound are all constants, we can
   calculate the probability directly.  */
if (tree_fits_shwi_p (loop_bound_var)
    && tree_fits_shwi_p (compare_var)
    && tree_fits_shwi_p (compare_base))
  {
    int probability;
    wi::overflow_type overflow;
    bool overall_overflow = false;
    widest_int compare_count, tem;

    /* (loop_bound - base) / compare_step */
    tem = wi::sub (wi::to_widest (loop_bound_var),
     wi::to_widest (compare_base), SIGNED, &overflow);
    overall_overflow |= overflow;
    widest_int loop_count = wi::div_trunc (tem,
			     wi::to_widest (compare_step_var),
			     SIGNED, &overflow);
    overall_overflow |= overflow;

    if (!wi::neg_p (wi::to_widest (compare_step_var))
        ^ (compare_code == LT_EXPR || compare_code == LE_EXPR))
{
 /* (loop_bound - compare_bound) / compare_step */
 tem = wi::sub (wi::to_widest (loop_bound_var),
	 wi::to_widest (compare_var), SIGNED, &overflow);
 overall_overflow |= overflow;
 compare_count = wi::div_trunc (tem, wi::to_widest (compare_step_var),
			 SIGNED, &overflow);
 overall_overflow |= overflow;
}
    else
      {
 /* (compare_bound - base) / compare_step */
 tem = wi::sub (wi::to_widest (compare_var),
	 wi::to_widest (compare_base), SIGNED, &overflow);
 overall_overflow |= overflow;
        compare_count = wi::div_trunc (tem, wi::to_widest (compare_step_var),
			 SIGNED, &overflow);
 overall_overflow |= overflow;
}
    if (compare_code == LE_EXPR || compare_code == GE_EXPR)
++compare_count;
    if (loop_bound_code == LE_EXPR || loop_bound_code == GE_EXPR)
++loop_count;
    if (wi::neg_p (compare_count))
      compare_count = 0;
    if (wi::neg_p (loop_count))
      loop_count = 0;
    if (loop_count == 0)
probability = 0;
    else if (wi::cmps (compare_count, loop_count) == 1)
probability = REG_BR_PROB_BASE10000;
    else
      {
 tem = compare_count * REG_BR_PROB_BASE10000;
 tem = wi::udiv_trunc (tem, loop_count);
 probability = tem.to_uhwi ();
}

    /* FIXME: The branch prediction seems broken. It has only 20% hitrate.  */
    if (!overall_overflow)
      predict_edge (then_edge, PRED_LOOP_IV_COMPARE, probability);

    return;
  }

if (expr_coherent_p (loop_bound_var, compare_var))
  {
    if ((loop_bound_code == LT_EXPR || loop_bound_code == LE_EXPR)
 && (compare_code == LT_EXPR || compare_code == LE_EXPR))
predict_edge_def (then_edge, PRED_LOOP_IV_COMPARE_GUESS, TAKEN);
    else if ((loop_bound_code == GT_EXPR || loop_bound_code == GE_EXPR)
      && (compare_code == GT_EXPR || compare_code == GE_EXPR))
predict_edge_def (then_edge, PRED_LOOP_IV_COMPARE_GUESS, TAKEN);
    else if (loop_bound_code == NE_EXPR)
{
 /* If the loop backedge condition is "(i != bound)", we do
    the comparison based on the step of IV:
    * step < 0 : backedge condition is like (i > bound)
    * step > 0 : backedge condition is like (i < bound)  */
 gcc_assert (loop_bound_step != 0)((void)(!(loop_bound_step != 0) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 1810, __FUNCTION__), 0 : 0));
 if (loop_bound_step > 0
     && (compare_code == LT_EXPR
  || compare_code == LE_EXPR))
   predict_edge_def (then_edge, PRED_LOOP_IV_COMPARE_GUESS, TAKEN);
 else if (loop_bound_step < 0
   && (compare_code == GT_EXPR
       || compare_code == GE_EXPR))
   predict_edge_def (then_edge, PRED_LOOP_IV_COMPARE_GUESS, TAKEN);
 else
   predict_edge_def (then_edge, PRED_LOOP_IV_COMPARE_GUESS, NOT_TAKEN);
}
    else
/* The branch is predicted not-taken if loop_bound_code is
  opposite with compare_code.  */
predict_edge_def (then_edge, PRED_LOOP_IV_COMPARE_GUESS, NOT_TAKEN);
  }
else if (expr_coherent_p (loop_iv_base_var, compare_var))
  {
    /* For cases like:
  for (i = s; i < h; i++)
    if (i > s + 2) ....
The branch should be predicted taken.  */
    if (loop_bound_step > 0
 && (compare_code == GT_EXPR || compare_code == GE_EXPR))
predict_edge_def (then_edge, PRED_LOOP_IV_COMPARE_GUESS, TAKEN);
    else if (loop_bound_step < 0
      && (compare_code == LT_EXPR || compare_code == LE_EXPR))
predict_edge_def (then_edge, PRED_LOOP_IV_COMPARE_GUESS, TAKEN);
    else
predict_edge_def (then_edge, PRED_LOOP_IV_COMPARE_GUESS, NOT_TAKEN);
  }
1842}

1844/* Predict for extra loop exits that will lead to EXIT_EDGE. The extra loop
 exits are resulted from short-circuit conditions that will generate an
 if_tmp. E.g.:

 if (foo() || global > 10)
   break;

 This will be translated into:

 BB3:
   loop header...
 BB4:
   if foo() goto BB6 else goto BB5
 BB5:
   if global > 10 goto BB6 else goto BB7
 BB6:
   goto BB7
 BB7:
   iftmp = (PHI 0(BB5), 1(BB6))
   if iftmp == 1 goto BB8 else goto BB3
 BB8:
   outside of the loop...

 The edge BB7->BB8 is loop exit because BB8 is outside of the loop.
 From the dataflow, we can infer that BB4->BB6 and BB5->BB6 are also loop
 exits. This function takes BB7->BB8 as input, and finds out the extra loop
 exits to predict them using PRED_LOOP_EXTRA_EXIT.  */

1872static void
1873predict_extra_loop_exits (class loop *loop, edge exit_edge)
1874{
unsigned i;
bool check_value_one;
gimple *lhs_def_stmt;
gphi *phi_stmt;
tree cmp_rhs, cmp_lhs;
gimple *last;
gcond *cmp_stmt;

last = last_stmt (exit_edge->src);
if (!last)
  return;
cmp_stmt = dyn_cast <gcond *> (last);
if (!cmp_stmt)
  return;

cmp_rhs = gimple_cond_rhs (cmp_stmt);
cmp_lhs = gimple_cond_lhs (cmp_stmt);
if (!TREE_CONSTANT (cmp_rhs)((non_type_check ((cmp_rhs), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 1892, __FUNCTION__))->base.constant_flag)
    || !(integer_zerop (cmp_rhs) || integer_onep (cmp_rhs)))
  return;
if (TREE_CODE (cmp_lhs)((enum tree_code) (cmp_lhs)->base.code) != SSA_NAME)
  return;

/* If check_value_one is true, only the phi_args with value '1' will lead
   to loop exit. Otherwise, only the phi_args with value '0' will lead to
   loop exit.  */
check_value_one = (((integer_onep (cmp_rhs))
    ^ (gimple_cond_code (cmp_stmt) == EQ_EXPR))
    ^ ((exit_edge->flags & EDGE_TRUE_VALUE) != 0));

lhs_def_stmt = SSA_NAME_DEF_STMT (cmp_lhs)(tree_check ((cmp_lhs), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 1905, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt;
if (!lhs_def_stmt)
  return;

phi_stmt = dyn_cast <gphi *> (lhs_def_stmt);
if (!phi_stmt)
  return;

for (i = 0; i < gimple_phi_num_args (phi_stmt); i++)
  {
    edge e1;
    edge_iterator ei;
    tree val = gimple_phi_arg_def (phi_stmt, i);
    edge e = gimple_phi_arg_edge (phi_stmt, i);

    if (!TREE_CONSTANT (val)((non_type_check ((val), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 1920, __FUNCTION__))->base.constant_flag) || !(integer_zerop (val) || integer_onep (val)))
continue;
    if ((check_value_one ^ integer_onep (val)) == 1)
continue;
    if (EDGE_COUNT (e->src->succs)vec_safe_length (e->src->succs) != 1)
{
 predict_paths_leading_to_edge (e, PRED_LOOP_EXTRA_EXIT, NOT_TAKEN,
			 loop);
 continue;
}

    FOR_EACH_EDGE (e1, ei, e->src->preds)for ((ei) = ei_start_1 (&((e->src->preds))); ei_cond
 ((ei), &(e1)); ei_next (&(ei)))
predict_paths_leading_to_edge (e1, PRED_LOOP_EXTRA_EXIT, NOT_TAKEN,
		       loop);
  }
1935}


1938/* Predict edge probabilities by exploiting loop structure.  */

1940static void
1941predict_loops (void)
1942{
basic_block bb;
hash_set <class loop *> with_recursion(10);

FOR_EACH_BB_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_entry_block_ptr->next_bb
; bb != ((cfun + 0))->cfg->x_exit_block_ptr; bb = bb->
next_bb)
  {
    gimple_stmt_iterator gsi;
    tree decl;

    for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
if (is_gimple_call (gsi_stmt (gsi))
   && (decl = gimple_call_fndecl (gsi_stmt (gsi))) != NULLnullptr
   && recursive_call_p (current_function_decl, decl))
 {
   class loop *loop = bb->loop_father;
   while (loop && !with_recursion.add (loop))
     loop = loop_outer (loop);
 }
  }

/* Try to predict out blocks in a loop that are not part of a
   natural loop.  */
for (auto loop : loops_list (cfun(cfun + 0), LI_FROM_INNERMOST))
  {
    basic_block bb, *bbs;
    unsigned j, n_exits = 0;
    class tree_niter_desc niter_desc;
    edge ex;
    class nb_iter_bound *nb_iter;
    enum tree_code loop_bound_code = ERROR_MARK;
    tree loop_bound_step = NULLnullptr;
    tree loop_bound_var = NULLnullptr;
    tree loop_iv_base = NULLnullptr;
    gcond *stmt = NULLnullptr;
    bool recursion = with_recursion.contains (loop);

    auto_vec<edge> exits = get_loop_exit_edges (loop);
    FOR_EACH_VEC_ELT (exits, j, ex)for (j = 0; (exits).iterate ((j), &(ex)); ++(j))
if (!unlikely_executed_edge_p (ex) && !(ex->flags & EDGE_ABNORMAL_CALL))
 n_exits ++;
    if (!n_exits)
continue;

    if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Predicting loop %i%s with %i exits.\n",
 loop->num, recursion ? " (with recursion)":"", n_exits);
    if (dump_file && (dump_flags & TDF_DETAILS)
 && max_loop_iterations_int (loop) >= 0)
{
 fprintf (dump_file,
   "Loop %d iterates at most %i times.\n", loop->num,
   (int)max_loop_iterations_int (loop));
}
    if (dump_file && (dump_flags & TDF_DETAILS)
 && likely_max_loop_iterations_int (loop) >= 0)
{
 fprintf (dump_file, "Loop %d likely iterates at most %i times.\n",
   loop->num, (int)likely_max_loop_iterations_int (loop));
}

    FOR_EACH_VEC_ELT (exits, j, ex)for (j = 0; (exits).iterate ((j), &(ex)); ++(j))
{
 tree niter = NULLnullptr;
 HOST_WIDE_INTlong nitercst;
 int max = param_max_predicted_iterationsglobal_options.x_param_max_predicted_iterations;
 int probability;
 enum br_predictor predictor;
 widest_int nit;

 if (unlikely_executed_edge_p (ex)
     || (ex->flags & EDGE_ABNORMAL_CALL))
   continue;
 /* Loop heuristics do not expect exit conditional to be inside
    inner loop.  We predict from innermost to outermost loop.  */
 if (predicted_by_loop_heuristics_p (ex->src))
   {
     if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Skipping exit %i->%i because "
	 "it is already predicted.\n",
	 ex->src->index, ex->dest->index);
     continue;
   }
 predict_extra_loop_exits (loop, ex);

 if (number_of_iterations_exit (loop, ex, &niter_desc, false, false))
   niter = niter_desc.niter;
 if (!niter || TREE_CODE (niter_desc.niter)((enum tree_code) (niter_desc.niter)->base.code) != INTEGER_CST)
   niter = loop_niter_by_eval (loop, ex);
 if (dump_file && (dump_flags & TDF_DETAILS)
     && TREE_CODE (niter)((enum tree_code) (niter)->base.code) == INTEGER_CST)
   {
     fprintf (dump_file, "Exit %i->%i %d iterates ",
       ex->src->index, ex->dest->index,
       loop->num);
     print_generic_expr (dump_file, niter, TDF_SLIM);
     fprintf (dump_file, " times.\n");
   }

 if (TREE_CODE (niter)((enum tree_code) (niter)->base.code) == INTEGER_CST)
   {
     if (tree_fits_uhwi_p (niter)
  && max
  && compare_tree_int (niter, max - 1) == -1)
nitercst = tree_to_uhwi (niter) + 1;
     else
nitercst = max;
     predictor = PRED_LOOP_ITERATIONS;
   }
 /* If we have just one exit and we can derive some information about
    the number of iterations of the loop from the statements inside
    the loop, use it to predict this exit.  */
 else if (n_exits == 1
   && estimated_stmt_executions (loop, &nit))
   {
     if (wi::gtu_p (nit, max))
nitercst = max;
     else
nitercst = nit.to_shwi ();
     predictor = PRED_LOOP_ITERATIONS_GUESSED;
   }
 /* If we have likely upper bound, trust it for very small iteration
    counts.  Such loops would otherwise get mispredicted by standard
    LOOP_EXIT heuristics.  */
 else if (n_exits == 1
   && likely_max_stmt_executions (loop, &nit)
   && wi::ltu_p (nit,
		 RDIV (REG_BR_PROB_BASE,(((10000) + (10000 - predictor_info [recursion ? PRED_LOOP_EXIT_WITH_RECURSION
 : PRED_LOOP_EXIT].hitrate) / 2) / (10000 - predictor_info [recursion
 ? PRED_LOOP_EXIT_WITH_RECURSION : PRED_LOOP_EXIT].hitrate))
		       REG_BR_PROB_BASE(((10000) + (10000 - predictor_info [recursion ? PRED_LOOP_EXIT_WITH_RECURSION
 : PRED_LOOP_EXIT].hitrate) / 2) / (10000 - predictor_info [recursion
 ? PRED_LOOP_EXIT_WITH_RECURSION : PRED_LOOP_EXIT].hitrate))
			 - predictor_info(((10000) + (10000 - predictor_info [recursion ? PRED_LOOP_EXIT_WITH_RECURSION
 : PRED_LOOP_EXIT].hitrate) / 2) / (10000 - predictor_info [recursion
 ? PRED_LOOP_EXIT_WITH_RECURSION : PRED_LOOP_EXIT].hitrate))
				 [recursion(((10000) + (10000 - predictor_info [recursion ? PRED_LOOP_EXIT_WITH_RECURSION
 : PRED_LOOP_EXIT].hitrate) / 2) / (10000 - predictor_info [recursion
 ? PRED_LOOP_EXIT_WITH_RECURSION : PRED_LOOP_EXIT].hitrate))
				  ? PRED_LOOP_EXIT_WITH_RECURSION(((10000) + (10000 - predictor_info [recursion ? PRED_LOOP_EXIT_WITH_RECURSION
 : PRED_LOOP_EXIT].hitrate) / 2) / (10000 - predictor_info [recursion
 ? PRED_LOOP_EXIT_WITH_RECURSION : PRED_LOOP_EXIT].hitrate))
				  : PRED_LOOP_EXIT].hitrate)(((10000) + (10000 - predictor_info [recursion ? PRED_LOOP_EXIT_WITH_RECURSION
 : PRED_LOOP_EXIT].hitrate) / 2) / (10000 - predictor_info [recursion
 ? PRED_LOOP_EXIT_WITH_RECURSION : PRED_LOOP_EXIT].hitrate))))
   {
     nitercst = nit.to_shwi ();
     predictor = PRED_LOOP_ITERATIONS_MAX;
   }
 else
   {
     if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Nothing known about exit %i->%i.\n",
	 ex->src->index, ex->dest->index);
     continue;
   }

 if (dump_file && (dump_flags & TDF_DETAILS))
   fprintf (dump_file, "Recording prediction to %i iterations by %s.\n",
     (int)nitercst, predictor_info[predictor].name);
 /* If the prediction for number of iterations is zero, do not
    predict the exit edges.  */
 if (nitercst == 0)
   continue;

 probability = RDIV (REG_BR_PROB_BASE, nitercst)(((10000) + (nitercst) / 2) / (nitercst));
 predict_edge (ex, predictor, probability);
}

    /* Find information about loop bound variables.  */
    for (nb_iter = loop->bounds; nb_iter;
  nb_iter = nb_iter->next)
if (nb_iter->stmt
   && gimple_code (nb_iter->stmt) == GIMPLE_COND)
 {
   stmt = as_a <gcond *> (nb_iter->stmt);
   break;
 }
    if (!stmt && last_stmt (loop->header)
 && gimple_code (last_stmt (loop->header)) == GIMPLE_COND)
stmt = as_a <gcond *> (last_stmt (loop->header));
    if (stmt)
is_comparison_with_loop_invariant_p (stmt, loop,
			     &loop_bound_var,
			     &loop_bound_code,
			     &loop_bound_step,
			     &loop_iv_base);

    bbs = get_loop_body (loop);

    for (j = 0; j < loop->num_nodes; j++)
{
 edge e;
 edge_iterator ei;

 bb = bbs[j];

 /* Bypass loop heuristics on continue statement.  These
    statements construct loops via "non-loop" constructs
    in the source language and are better to be handled
    separately.  */
 if (predicted_by_p (bb, PRED_CONTINUE))
   {
     if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "BB %i predicted by continue.\n",
	 bb->index);
     continue;
   }

 /* If we already used more reliable loop exit predictors, do not
    bother with PRED_LOOP_EXIT.  */
 if (!predicted_by_loop_heuristics_p (bb))
   {
     /* For loop with many exits we don't want to predict all exits
        with the pretty large probability, because if all exits are
 considered in row, the loop would be predicted to iterate
 almost never.  The code to divide probability by number of
 exits is very rough.  It should compute the number of exits
 taken in each patch through function (not the overall number
 of exits that might be a lot higher for loops with wide switch
 statements in them) and compute n-th square root.

 We limit the minimal probability by 2% to avoid
 EDGE_PROBABILITY_RELIABLE from trusting the branch prediction
 as this was causing regression in perl benchmark containing such
 a wide loop.  */

     int probability = ((REG_BR_PROB_BASE10000
                  - predictor_info
		     [recursion
		      ? PRED_LOOP_EXIT_WITH_RECURSION
		      : PRED_LOOP_EXIT].hitrate)
		 / n_exits);
     if (probability < HITRATE (2)((int) ((2) * 10000 + 50) / 100))
probability = HITRATE (2)((int) ((2) * 10000 + 50) / 100);
     FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
if (e->dest->index < NUM_FIXED_BLOCKS(2)
    || !flow_bb_inside_loop_p (loop, e->dest))
  {
    if (dump_file && (dump_flags & TDF_DETAILS))
      fprintf (dump_file,
	       "Predicting exit %i->%i with prob %i.\n",
	       e->src->index, e->dest->index, probability);
    predict_edge (e,
		  recursion ? PRED_LOOP_EXIT_WITH_RECURSION
	          : PRED_LOOP_EXIT, probability);
  }
   }
 if (loop_bound_var)
   predict_iv_comparison (loop, bb, loop_bound_var, loop_iv_base,
		   loop_bound_code,
		   tree_to_shwi (loop_bound_step));
}

    /* In the following code
for (loop1)
  if (cond)
    for (loop2)
      body;
guess that cond is unlikely.  */
    if (loop_outer (loop)->num)
{
 basic_block bb = NULLnullptr;
 edge preheader_edge = loop_preheader_edge (loop);

 if (single_pred_p (preheader_edge->src)
     && single_succ_p (preheader_edge->src))
   preheader_edge = single_pred_edge (preheader_edge->src);

 gimple *stmt = last_stmt (preheader_edge->src);
 /* Pattern match fortran loop preheader:
    _16 = BUILTIN_EXPECT (_15, 1, PRED_FORTRAN_LOOP_PREHEADER);
    _17 = (logical(kind=4)) _16;
    if (_17 != 0)
      goto <bb 11>;
    else
      goto <bb 13>;

    Loop guard branch prediction says nothing about duplicated loop
    headers produced by fortran frontend and in this case we want
    to predict paths leading to this preheader.  */

 if (stmt
     && gimple_code (stmt) == GIMPLE_COND
     && gimple_cond_code (stmt) == NE_EXPR
     && TREE_CODE (gimple_cond_lhs (stmt))((enum tree_code) (gimple_cond_lhs (stmt))->base.code) == SSA_NAME
     && integer_zerop (gimple_cond_rhs (stmt)))
    {
      gimple *call_stmt = SSA_NAME_DEF_STMT (gimple_cond_lhs (stmt))(tree_check ((gimple_cond_lhs (stmt)), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2217, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt;
      if (gimple_code (call_stmt) == GIMPLE_ASSIGN
   && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (call_stmt))((gimple_assign_rhs_code (call_stmt)) == NOP_EXPR || (gimple_assign_rhs_code
 (call_stmt)) == CONVERT_EXPR)
   && TREE_CODE (gimple_assign_rhs1 (call_stmt))((enum tree_code) (gimple_assign_rhs1 (call_stmt))->base.code
) == SSA_NAME)
 call_stmt = SSA_NAME_DEF_STMT (gimple_assign_rhs1 (call_stmt))(tree_check ((gimple_assign_rhs1 (call_stmt)), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2221, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt;
      if (gimple_call_internal_p (call_stmt, IFN_BUILTIN_EXPECT)
   && TREE_CODE (gimple_call_arg (call_stmt, 2))((enum tree_code) (gimple_call_arg (call_stmt, 2))->base.code
) == INTEGER_CST
   && tree_fits_uhwi_p (gimple_call_arg (call_stmt, 2))
   && tree_to_uhwi (gimple_call_arg (call_stmt, 2))
	== PRED_FORTRAN_LOOP_PREHEADER)
 bb = preheader_edge->src;
    }
 if (!bb)
   {
     if (!dominated_by_p (CDI_DOMINATORS,
		   loop_outer (loop)->latch, loop->header))
predict_paths_leading_to_edge (loop_preheader_edge (loop),
			       recursion
			       ? PRED_LOOP_GUARD_WITH_RECURSION
			       : PRED_LOOP_GUARD,
			       NOT_TAKEN,
			       loop_outer (loop));
   }
 else
   {
     if (!dominated_by_p (CDI_DOMINATORS,
		   loop_outer (loop)->latch, bb))
predict_paths_leading_to (bb,
			  recursion
			  ? PRED_LOOP_GUARD_WITH_RECURSION
			  : PRED_LOOP_GUARD,
			  NOT_TAKEN,
			  loop_outer (loop));
   }
}

    /* Free basic blocks from get_loop_body.  */
    free (bbs);
  }
2256}

2258/* Attempt to predict probabilities of BB outgoing edges using local
 properties.  */
2260static void
2261bb_estimate_probability_locally (basic_block bb)
2262{
rtx_insn *last_insn = BB_END (bb)(bb)->il.x.rtl->end_;
rtx cond;

if (! can_predict_insn_p (last_insn))
  return;
cond = get_condition (last_insn, NULLnullptr, false, false);
if (! cond)
  return;

/* Try "pointer heuristic."
   A comparison ptr == 0 is predicted as false.
   Similarly, a comparison ptr1 == ptr2 is predicted as false.  */
if (COMPARISON_P (cond)(((rtx_class[(int) (((enum rtx_code) (cond)->code))]) &
 (~1)) == (RTX_COMPARE & (~1)))
    && ((REG_P (XEXP (cond, 0))(((enum rtx_code) ((((cond)->u.fld[0]).rt_rtx))->code) ==
 REG) && REG_POINTER (XEXP (cond, 0))(__extension__ ({ __typeof (((((cond)->u.fld[0]).rt_rtx)))
 const _rtx = (((((cond)->u.fld[0]).rt_rtx))); if (((enum rtx_code
) (_rtx)->code) != REG) rtl_check_failed_flag ("REG_POINTER"
, _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2276, __FUNCTION__); _rtx; })->frame_related))
 || (REG_P (XEXP (cond, 1))(((enum rtx_code) ((((cond)->u.fld[1]).rt_rtx))->code) ==
 REG) && REG_POINTER (XEXP (cond, 1))(__extension__ ({ __typeof (((((cond)->u.fld[1]).rt_rtx)))
 const _rtx = (((((cond)->u.fld[1]).rt_rtx))); if (((enum rtx_code
) (_rtx)->code) != REG) rtl_check_failed_flag ("REG_POINTER"
, _rtx, "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2277, __FUNCTION__); _rtx; })->frame_related))))
  {
    if (GET_CODE (cond)((enum rtx_code) (cond)->code) == EQ)
predict_insn_def (last_insn, PRED_POINTER, NOT_TAKEN);
    else if (GET_CODE (cond)((enum rtx_code) (cond)->code) == NE)
predict_insn_def (last_insn, PRED_POINTER, TAKEN);
  }
else

/* Try "opcode heuristic."
   EQ tests are usually false and NE tests are usually true. Also,
   most quantities are positive, so we can make the appropriate guesses
   about signed comparisons against zero.  */
  switch (GET_CODE (cond)((enum rtx_code) (cond)->code))
    {
    case CONST_INT:
/* Unconditional branch.  */
predict_insn_def (last_insn, PRED_UNCONDITIONAL,
	  cond == const0_rtx(const_int_rtx[64]) ? NOT_TAKEN : TAKEN);
break;

    case EQ:
    case UNEQ:
/* Floating point comparisons appears to behave in a very
  unpredictable way because of special role of = tests in
  FP code.  */
if (FLOAT_MODE_P (GET_MODE (XEXP (cond, 0)))(((enum mode_class) mode_class[((machine_mode) ((((cond)->
u.fld[0]).rt_rtx))->mode)]) == MODE_FLOAT || ((enum mode_class
) mode_class[((machine_mode) ((((cond)->u.fld[0]).rt_rtx))
->mode)]) == MODE_DECIMAL_FLOAT || ((enum mode_class) mode_class
[((machine_mode) ((((cond)->u.fld[0]).rt_rtx))->mode)])
 == MODE_COMPLEX_FLOAT || ((enum mode_class) mode_class[((machine_mode
) ((((cond)->u.fld[0]).rt_rtx))->mode)]) == MODE_VECTOR_FLOAT
))
 ;
/* Comparisons with 0 are often used for booleans and there is
  nothing useful to predict about them.  */
else if (XEXP (cond, 1)(((cond)->u.fld[1]).rt_rtx) == const0_rtx(const_int_rtx[64])
 || XEXP (cond, 0)(((cond)->u.fld[0]).rt_rtx) == const0_rtx(const_int_rtx[64]))
 ;
else
 predict_insn_def (last_insn, PRED_OPCODE_NONEQUAL, NOT_TAKEN);
break;

    case NE:
    case LTGT:
/* Floating point comparisons appears to behave in a very
  unpredictable way because of special role of = tests in
  FP code.  */
if (FLOAT_MODE_P (GET_MODE (XEXP (cond, 0)))(((enum mode_class) mode_class[((machine_mode) ((((cond)->
u.fld[0]).rt_rtx))->mode)]) == MODE_FLOAT || ((enum mode_class
) mode_class[((machine_mode) ((((cond)->u.fld[0]).rt_rtx))
->mode)]) == MODE_DECIMAL_FLOAT || ((enum mode_class) mode_class
[((machine_mode) ((((cond)->u.fld[0]).rt_rtx))->mode)])
 == MODE_COMPLEX_FLOAT || ((enum mode_class) mode_class[((machine_mode
) ((((cond)->u.fld[0]).rt_rtx))->mode)]) == MODE_VECTOR_FLOAT
))
 ;
/* Comparisons with 0 are often used for booleans and there is
  nothing useful to predict about them.  */
else if (XEXP (cond, 1)(((cond)->u.fld[1]).rt_rtx) == const0_rtx(const_int_rtx[64])
 || XEXP (cond, 0)(((cond)->u.fld[0]).rt_rtx) == const0_rtx(const_int_rtx[64]))
 ;
else
 predict_insn_def (last_insn, PRED_OPCODE_NONEQUAL, TAKEN);
break;

    case ORDERED:
predict_insn_def (last_insn, PRED_FPOPCODE, TAKEN);
break;

    case UNORDERED:
predict_insn_def (last_insn, PRED_FPOPCODE, NOT_TAKEN);
break;

    case LE:
    case LT:
if (XEXP (cond, 1)(((cond)->u.fld[1]).rt_rtx) == const0_rtx(const_int_rtx[64]) || XEXP (cond, 1)(((cond)->u.fld[1]).rt_rtx) == const1_rtx(const_int_rtx[64 +1])
   || XEXP (cond, 1)(((cond)->u.fld[1]).rt_rtx) == constm1_rtx(const_int_rtx[64 -1]))
 predict_insn_def (last_insn, PRED_OPCODE_POSITIVE, NOT_TAKEN);
break;

    case GE:
    case GT:
if (XEXP (cond, 1)(((cond)->u.fld[1]).rt_rtx) == const0_rtx(const_int_rtx[64]) || XEXP (cond, 1)(((cond)->u.fld[1]).rt_rtx) == const1_rtx(const_int_rtx[64 +1])
   || XEXP (cond, 1)(((cond)->u.fld[1]).rt_rtx) == constm1_rtx(const_int_rtx[64 -1]))
 predict_insn_def (last_insn, PRED_OPCODE_POSITIVE, TAKEN);
break;

    default:
break;
    }
2355}

2357/* Set edge->probability for each successor edge of BB.  */
2358void
2359guess_outgoing_edge_probabilities (basic_block bb)
2360{
bb_estimate_probability_locally (bb);
combine_predictions_for_insn (BB_END (bb)(bb)->il.x.rtl->end_, bb);
1
Calling 'combine_predictions_for_insn'→
2363}
2364
2365static tree expr_expected_value (tree, bitmap, enum br_predictor *predictor,
		 HOST_WIDE_INTlong *probability);

2368/* Helper function for expr_expected_value.  */

2370static tree
2371expr_expected_value_1 (tree type, tree op0, enum tree_code code,
       tree op1, bitmap visited, enum br_predictor *predictor,
       HOST_WIDE_INTlong *probability)
2374{
gimple *def;

/* Reset returned probability value.  */
*probability = -1;
*predictor = PRED_UNCONDITIONAL;

if (get_gimple_rhs_class (code) == GIMPLE_SINGLE_RHS)
  {
    if (TREE_CONSTANT (op0)((non_type_check ((op0), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2383, __FUNCTION__))->base.constant_flag))
return op0;

    if (code == IMAGPART_EXPR)
{
 if (TREE_CODE (TREE_OPERAND (op0, 0))((enum tree_code) ((*((const_cast<tree*> (tree_operand_check
 ((op0), (0), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2388, __FUNCTION__))))))->base.code) == SSA_NAME)
   {
     def = SSA_NAME_DEF_STMT (TREE_OPERAND (op0, 0))(tree_check (((*((const_cast<tree*> (tree_operand_check
 ((op0), (0), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2390, __FUNCTION__)))))), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2390, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt;
     if (is_gimple_call (def)
  && gimple_call_internal_p (def)
  && (gimple_call_internal_fn (def)
      == IFN_ATOMIC_COMPARE_EXCHANGE))
{
  /* Assume that any given atomic operation has low contention,
     and thus the compare-and-swap operation succeeds.  */
  *predictor = PRED_COMPARE_AND_SWAP;
  return build_one_cst (TREE_TYPE (op0)((contains_struct_check ((op0), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2399, __FUNCTION__))->typed.type));
}
   }
}

    if (code != SSA_NAME)
return NULL_TREE(tree) nullptr;

    def = SSA_NAME_DEF_STMT (op0)(tree_check ((op0), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2407, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt;

    /* If we were already here, break the infinite cycle.  */
    if (!bitmap_set_bit (visited, SSA_NAME_VERSION (op0)(tree_check ((op0), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2410, __FUNCTION__, (SSA_NAME)))->base.u.version))
return NULLnullptr;

    if (gimple_code (def) == GIMPLE_PHI)
{
 /* All the arguments of the PHI node must have the same constant
    length.  */
 int i, n = gimple_phi_num_args (def);
 tree val = NULLnullptr, new_val;

 for (i = 0; i < n; i++)
   {
     tree arg = PHI_ARG_DEF (def, i)gimple_phi_arg_def ((def), (i));
     enum br_predictor predictor2;

     /* If this PHI has itself as an argument, we cannot
 determine the string length of this argument.  However,
 if we can find an expected constant value for the other
 PHI args then we can still be sure that this is
 likely a constant.  So be optimistic and just
 continue with the next argument.  */
     if (arg == PHI_RESULT (def)get_def_from_ptr (gimple_phi_result_ptr (def)))
continue;

     HOST_WIDE_INTlong probability2;
     new_val = expr_expected_value (arg, visited, &predictor2,
			     &probability2);

     /* It is difficult to combine value predictors.  Simply assume
 that later predictor is weaker and take its prediction.  */
     if (*predictor < predictor2)
{
  *predictor = predictor2;
  *probability = probability2;
}
     if (!new_val)
return NULLnullptr;
     if (!val)
val = new_val;
     else if (!operand_equal_p (val, new_val, false))
return NULLnullptr;
   }
 return val;
}
    if (is_gimple_assign (def))
{
 if (gimple_assign_lhs (def) != op0)
   return NULLnullptr;

 return expr_expected_value_1 (TREE_TYPE (gimple_assign_lhs (def))((contains_struct_check ((gimple_assign_lhs (def)), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2459, __FUNCTION__))->typed.type),
			gimple_assign_rhs1 (def),
			gimple_assign_rhs_code (def),
			gimple_assign_rhs2 (def),
			visited, predictor, probability);
}

    if (is_gimple_call (def))
{
 tree decl = gimple_call_fndecl (def);
 if (!decl)
   {
     if (gimple_call_internal_p (def)
  && gimple_call_internal_fn (def) == IFN_BUILTIN_EXPECT)
{
  gcc_assert (gimple_call_num_args (def) == 3)((void)(!(gimple_call_num_args (def) == 3) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2474, __FUNCTION__), 0 : 0));
  tree val = gimple_call_arg (def, 0);
  if (TREE_CONSTANT (val)((non_type_check ((val), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2476, __FUNCTION__))->base.constant_flag))
    return val;
  tree val2 = gimple_call_arg (def, 2);
  gcc_assert (TREE_CODE (val2) == INTEGER_CST((void)(!(((enum tree_code) (val2)->base.code) == INTEGER_CST
 && tree_fits_uhwi_p (val2) && tree_to_uhwi (
val2) < END_PREDICTORS) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2481, __FUNCTION__), 0 : 0))
	      && tree_fits_uhwi_p (val2)((void)(!(((enum tree_code) (val2)->base.code) == INTEGER_CST
 && tree_fits_uhwi_p (val2) && tree_to_uhwi (
val2) < END_PREDICTORS) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2481, __FUNCTION__), 0 : 0))
	      && tree_to_uhwi (val2) < END_PREDICTORS)((void)(!(((enum tree_code) (val2)->base.code) == INTEGER_CST
 && tree_fits_uhwi_p (val2) && tree_to_uhwi (
val2) < END_PREDICTORS) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2481, __FUNCTION__), 0 : 0));
  *predictor = (enum br_predictor) tree_to_uhwi (val2);
  if (*predictor == PRED_BUILTIN_EXPECT)
    *probability
      = HITRATE (param_builtin_expect_probability)((int) ((global_options.x_param_builtin_expect_probability) *
+ 50) / 100);
  return gimple_call_arg (def, 1);
}
     return NULLnullptr;
   }

 if (DECL_IS_MALLOC (decl)((tree_check ((decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2491, __FUNCTION__, (FUNCTION_DECL)))->function_decl.malloc_flag
) || DECL_IS_OPERATOR_NEW_P (decl)(((tree_check ((decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2491, __FUNCTION__, (FUNCTION_DECL)))->function_decl.decl_type
) == OPERATOR_NEW))
   {
     if (predictor)
*predictor = PRED_MALLOC_NONNULL;
     return boolean_true_nodeglobal_trees[TI_BOOLEAN_TRUE];
   }

 if (DECL_BUILT_IN_CLASS (decl)((built_in_class) (tree_check ((decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2498, __FUNCTION__, (FUNCTION_DECL)))->function_decl.built_in_class
) == BUILT_IN_NORMAL)
   switch (DECL_FUNCTION_CODE (decl))
     {
     case BUILT_IN_EXPECT:
{
  tree val;
  if (gimple_call_num_args (def) != 2)
    return NULLnullptr;
  val = gimple_call_arg (def, 0);
  if (TREE_CONSTANT (val)((non_type_check ((val), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2507, __FUNCTION__))->base.constant_flag))
    return val;
  *predictor = PRED_BUILTIN_EXPECT;
  *probability
    = HITRATE (param_builtin_expect_probability)((int) ((global_options.x_param_builtin_expect_probability) *
+ 50) / 100);
  return gimple_call_arg (def, 1);
}
     case BUILT_IN_EXPECT_WITH_PROBABILITY:
{
  tree val;
  if (gimple_call_num_args (def) != 3)
    return NULLnullptr;
  val = gimple_call_arg (def, 0);
  if (TREE_CONSTANT (val)((non_type_check ((val), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2520, __FUNCTION__))->base.constant_flag))
    return val;
  /* Compute final probability as:
     probability * REG_BR_PROB_BASE.  */
  tree prob = gimple_call_arg (def, 2);
  tree t = TREE_TYPE (prob)((contains_struct_check ((prob), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2525, __FUNCTION__))->typed.type);
  tree base = build_int_cst (integer_type_nodeinteger_types[itk_int],
			     REG_BR_PROB_BASE10000);
  base = build_real_from_int_cst (t, base);
  tree r = fold_build2_initializer_loc (UNKNOWN_LOCATION((location_t) 0),
					MULT_EXPR, t, prob, base);
  if (TREE_CODE (r)((enum tree_code) (r)->base.code) != REAL_CST)
    {
      error_at (gimple_location (def),
		"probability %qE must be "
		"constant floating-point expression", prob);
      return NULLnullptr;
    }
  HOST_WIDE_INTlong probi
    = real_to_integer (TREE_REAL_CST_PTR (r)(&(tree_check ((r), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2539, __FUNCTION__, (REAL_CST)))->real_cst.value));
  if (probi >= 0 && probi <= REG_BR_PROB_BASE10000)
    {
      *predictor = PRED_BUILTIN_EXPECT_WITH_PROBABILITY;
      *probability = probi;
    }
  else
    error_at (gimple_location (def),
	      "probability %qE is outside "
	      "the range [0.0, 1.0]", prob);

  return gimple_call_arg (def, 1);
}

     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N:
     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1:
     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_2:
     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_4:
     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_8:
     case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_16:
     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE:
     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N:
     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1:
     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_2:
     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_4:
     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_8:
     case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_16:
/* Assume that any given atomic operation has low contention,
   and thus the compare-and-swap operation succeeds.  */
*predictor = PRED_COMPARE_AND_SWAP;
return boolean_true_nodeglobal_trees[TI_BOOLEAN_TRUE];
     case BUILT_IN_REALLOC:
if (predictor)
  *predictor = PRED_MALLOC_NONNULL;
return boolean_true_nodeglobal_trees[TI_BOOLEAN_TRUE];
     default:
break;
   }
}

    return NULLnullptr;
  }

if (get_gimple_rhs_class (code) == GIMPLE_BINARY_RHS)
  {
    tree res;
    enum br_predictor predictor2;
    HOST_WIDE_INTlong probability2;
    op0 = expr_expected_value (op0, visited, predictor, probability);
    if (!op0)
return NULLnullptr;
    op1 = expr_expected_value (op1, visited, &predictor2, &probability2);
    if (!op1)
return NULLnullptr;
    res = fold_build2 (code, type, op0, op1)fold_build2_loc (((location_t) 0), code, type, op0, op1 );
    if (TREE_CODE (res)((enum tree_code) (res)->base.code) == INTEGER_CST
 && TREE_CODE (op0)((enum tree_code) (op0)->base.code) == INTEGER_CST
 && TREE_CODE (op1)((enum tree_code) (op1)->base.code) == INTEGER_CST)
{
 /* Combine binary predictions.  */
 if (*probability != -1 || probability2 != -1)
   {
     HOST_WIDE_INTlong p1 = get_predictor_value (*predictor, *probability);
     HOST_WIDE_INTlong p2 = get_predictor_value (predictor2, probability2);
     *probability = RDIV (p1 * p2, REG_BR_PROB_BASE)(((p1 * p2) + (10000) / 2) / (10000));
   }

 if (*predictor < predictor2)
   *predictor = predictor2;

 return res;
}
    return NULLnullptr;
  }
if (get_gimple_rhs_class (code) == GIMPLE_UNARY_RHS)
  {
    tree res;
    op0 = expr_expected_value (op0, visited, predictor, probability);
    if (!op0)
return NULLnullptr;
    res = fold_build1 (code, type, op0)fold_build1_loc (((location_t) 0), code, type, op0 );
    if (TREE_CONSTANT (res)((non_type_check ((res), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2620, __FUNCTION__))->base.constant_flag))
return res;
    return NULLnullptr;
  }
return NULLnullptr;
2625}

2627/* Return constant EXPR will likely have at execution time, NULL if unknown.
 The function is used by builtin_expect branch predictor so the evidence
 must come from this construct and additional possible constant folding.

 We may want to implement more involved value guess (such as value range
 propagation based prediction), but such tricks shall go to new
 implementation.  */

2635static tree
2636expr_expected_value (tree expr, bitmap visited,
     enum br_predictor *predictor,
     HOST_WIDE_INTlong *probability)
2639{
enum tree_code code;
tree op0, op1;

if (TREE_CONSTANT (expr)((non_type_check ((expr), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2643, __FUNCTION__))->base.constant_flag))
  {
    *predictor = PRED_UNCONDITIONAL;
    *probability = -1;
    return expr;
  }

extract_ops_from_tree (expr, &code, &op0, &op1);
return expr_expected_value_1 (TREE_TYPE (expr)((contains_struct_check ((expr), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2651, __FUNCTION__))->typed.type),
		op0, code, op1, visited, predictor,
		probability);
2654}
2655

2657/* Return probability of a PREDICTOR.  If the predictor has variable
 probability return passed PROBABILITY.  */

2660static HOST_WIDE_INTlong
2661get_predictor_value (br_predictor predictor, HOST_WIDE_INTlong probability)
2662{
switch (predictor)
  {
  case PRED_BUILTIN_EXPECT:
  case PRED_BUILTIN_EXPECT_WITH_PROBABILITY:
    gcc_assert (probability != -1)((void)(!(probability != -1) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2667, __FUNCTION__), 0 : 0));
    return probability;
  default:
    gcc_assert (probability == -1)((void)(!(probability == -1) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2670, __FUNCTION__), 0 : 0));
    return predictor_info[(int) predictor].hitrate;
  }
2673}

2675/* Predict using opcode of the last statement in basic block.  */
2676static void
2677tree_predict_by_opcode (basic_block bb)
2678{
gimple *stmt = last_stmt (bb);
edge then_edge;
tree op0, op1;
tree type;
tree val;
enum tree_code cmp;
edge_iterator ei;
enum br_predictor predictor;
HOST_WIDE_INTlong probability;

if (!stmt)
  return;

if (gswitch *sw = dyn_cast <gswitch *> (stmt))
  {
    tree index = gimple_switch_index (sw);
    tree val = expr_expected_value (index, auto_bitmap (),
		      &predictor, &probability);
    if (val && TREE_CODE (val)((enum tree_code) (val)->base.code) == INTEGER_CST)
{
 edge e = find_taken_edge_switch_expr (sw, val);
 if (predictor == PRED_BUILTIN_EXPECT)
   {
     int percent = param_builtin_expect_probabilityglobal_options.x_param_builtin_expect_probability;
     gcc_assert (percent >= 0 && percent <= 100)((void)(!(percent >= 0 && percent <= 100) ? fancy_abort
 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2703, __FUNCTION__), 0 : 0));
     predict_edge (e, PRED_BUILTIN_EXPECT,
	    HITRATE (percent)((int) ((percent) * 10000 + 50) / 100));
   }
 else
   predict_edge_def (e, predictor, TAKEN);
}
  }

if (gimple_code (stmt) != GIMPLE_COND)
  return;
FOR_EACH_EDGE (then_edge, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(then_edge)); ei_next (&(ei)))
  if (then_edge->flags & EDGE_TRUE_VALUE)
    break;
op0 = gimple_cond_lhs (stmt);
op1 = gimple_cond_rhs (stmt);
cmp = gimple_cond_code (stmt);
type = TREE_TYPE (op0)((contains_struct_check ((op0), (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2720, __FUNCTION__))->typed.type);
val = expr_expected_value_1 (boolean_type_nodeglobal_trees[TI_BOOLEAN_TYPE], op0, cmp, op1, auto_bitmap (),
	       &predictor, &probability);
if (val && TREE_CODE (val)((enum tree_code) (val)->base.code) == INTEGER_CST)
  {
    HOST_WIDE_INTlong prob = get_predictor_value (predictor, probability);
    if (integer_zerop (val))
prob = REG_BR_PROB_BASE10000 - prob;
    predict_edge (then_edge, predictor, prob);
  }
/* Try "pointer heuristic."
   A comparison ptr == 0 is predicted as false.
   Similarly, a comparison ptr1 == ptr2 is predicted as false.  */
if (POINTER_TYPE_P (type)(((enum tree_code) (type)->base.code) == POINTER_TYPE || (
(enum tree_code) (type)->base.code) == REFERENCE_TYPE))
  {
    if (cmp == EQ_EXPR)
predict_edge_def (then_edge, PRED_TREE_POINTER, NOT_TAKEN);
    else if (cmp == NE_EXPR)
predict_edge_def (then_edge, PRED_TREE_POINTER, TAKEN);
  }
else

/* Try "opcode heuristic."
   EQ tests are usually false and NE tests are usually true. Also,
   most quantities are positive, so we can make the appropriate guesses
   about signed comparisons against zero.  */
  switch (cmp)
    {
    case EQ_EXPR:
    case UNEQ_EXPR:
/* Floating point comparisons appears to behave in a very
  unpredictable way because of special role of = tests in
  FP code.  */
if (FLOAT_TYPE_P (type)((((enum tree_code) (type)->base.code) == REAL_TYPE) || ((
((enum tree_code) (type)->base.code) == COMPLEX_TYPE || ((
(enum tree_code) (type)->base.code) == VECTOR_TYPE)) &&
 (((enum tree_code) (((contains_struct_check ((type), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2753, __FUNCTION__))->typed.type))->base.code) == REAL_TYPE
))))
 ;
/* Comparisons with 0 are often used for booleans and there is
  nothing useful to predict about them.  */
else if (integer_zerop (op0) || integer_zerop (op1))
 ;
else
 predict_edge_def (then_edge, PRED_TREE_OPCODE_NONEQUAL, NOT_TAKEN);
break;

    case NE_EXPR:
    case LTGT_EXPR:
/* Floating point comparisons appears to behave in a very
  unpredictable way because of special role of = tests in
  FP code.  */
if (FLOAT_TYPE_P (type)((((enum tree_code) (type)->base.code) == REAL_TYPE) || ((
((enum tree_code) (type)->base.code) == COMPLEX_TYPE || ((
(enum tree_code) (type)->base.code) == VECTOR_TYPE)) &&
 (((enum tree_code) (((contains_struct_check ((type), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2768, __FUNCTION__))->typed.type))->base.code) == REAL_TYPE
))))
 ;
/* Comparisons with 0 are often used for booleans and there is
  nothing useful to predict about them.  */
else if (integer_zerop (op0)
 || integer_zerop (op1))
 ;
else
 predict_edge_def (then_edge, PRED_TREE_OPCODE_NONEQUAL, TAKEN);
break;

    case ORDERED_EXPR:
predict_edge_def (then_edge, PRED_TREE_FPOPCODE, TAKEN);
break;

    case UNORDERED_EXPR:
predict_edge_def (then_edge, PRED_TREE_FPOPCODE, NOT_TAKEN);
break;

    case LE_EXPR:
    case LT_EXPR:
if (integer_zerop (op1)
   || integer_onep (op1)
   || integer_all_onesp (op1)
   || real_zerop (op1)
   || real_onep (op1)
   || real_minus_onep (op1))
 predict_edge_def (then_edge, PRED_TREE_OPCODE_POSITIVE, NOT_TAKEN);
break;

    case GE_EXPR:
    case GT_EXPR:
if (integer_zerop (op1)
   || integer_onep (op1)
   || integer_all_onesp (op1)
   || real_zerop (op1)
   || real_onep (op1)
   || real_minus_onep (op1))
 predict_edge_def (then_edge, PRED_TREE_OPCODE_POSITIVE, TAKEN);
break;

    default:
break;
    }
2812}

2814/* Returns TRUE if the STMT is exit(0) like statement. */

2816static bool
2817is_exit_with_zero_arg (const gimple *stmt)
2818{
/* This is not exit, _exit or _Exit. */
if (!gimple_call_builtin_p (stmt, BUILT_IN_EXIT)
    && !gimple_call_builtin_p (stmt, BUILT_IN__EXIT)
    && !gimple_call_builtin_p (stmt, BUILT_IN__EXIT2))
  return false;

/* Argument is an interger zero. */
return integer_zerop (gimple_call_arg (stmt, 0));
2827}

2829/* Try to guess whether the value of return means error code.  */

2831static enum br_predictor
2832return_prediction (tree val, enum prediction *prediction)
2833{
/* VOID.  */
if (!val)
  return PRED_NO_PREDICTION;
/* Different heuristics for pointers and scalars.  */
if (POINTER_TYPE_P (TREE_TYPE (val))(((enum tree_code) (((contains_struct_check ((val), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2838, __FUNCTION__))->typed.type))->base.code) == POINTER_TYPE
 || ((enum tree_code) (((contains_struct_check ((val), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2838, __FUNCTION__))->typed.type))->base.code) == REFERENCE_TYPE
))
  {
    /* NULL is usually not returned.  */
    if (integer_zerop (val))
{
 *prediction = NOT_TAKEN;
 return PRED_NULL_RETURN;
}
  }
else if (INTEGRAL_TYPE_P (TREE_TYPE (val))(((enum tree_code) (((contains_struct_check ((val), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2847, __FUNCTION__))->typed.type))->base.code) == ENUMERAL_TYPE
 || ((enum tree_code) (((contains_struct_check ((val), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2847, __FUNCTION__))->typed.type))->base.code) == BOOLEAN_TYPE
 || ((enum tree_code) (((contains_struct_check ((val), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2847, __FUNCTION__))->typed.type))->base.code) == INTEGER_TYPE
))
  {
    /* Negative return values are often used to indicate
       errors.  */
    if (TREE_CODE (val)((enum tree_code) (val)->base.code) == INTEGER_CST
 && tree_int_cst_sgn (val) < 0)
{
 *prediction = NOT_TAKEN;
 return PRED_NEGATIVE_RETURN;
}
    /* Constant return values seems to be commonly taken.
       Zero/one often represent booleans so exclude them from the
heuristics.  */
    if (TREE_CONSTANT (val)((non_type_check ((val), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2860, __FUNCTION__))->base.constant_flag)
 && (!integer_zerop (val) && !integer_onep (val)))
{
 *prediction = NOT_TAKEN;
 return PRED_CONST_RETURN;
}
  }
return PRED_NO_PREDICTION;
2868}

2870/* Return zero if phi result could have values other than -1, 0 or 1,
 otherwise return a bitmask, with bits 0, 1 and 2 set if -1, 0 and 1
 values are used or likely.  */

2874static int
2875zero_one_minusone (gphi *phi, int limit)
2876{
int phi_num_args = gimple_phi_num_args (phi);
int ret = 0;
for (int i = 0; i < phi_num_args; i++)
  {
    tree t = PHI_ARG_DEF (phi, i)gimple_phi_arg_def ((phi), (i));
    if (TREE_CODE (t)((enum tree_code) (t)->base.code) != INTEGER_CST)
continue;
    wide_int w = wi::to_wide (t);
    if (w == -1)
ret |= 1;
    else if (w == 0)
ret |= 2;
    else if (w == 1)
ret |= 4;
    else
return 0;
  }
for (int i = 0; i < phi_num_args; i++)
  {
    tree t = PHI_ARG_DEF (phi, i)gimple_phi_arg_def ((phi), (i));
    if (TREE_CODE (t)((enum tree_code) (t)->base.code) == INTEGER_CST)
continue;
    if (TREE_CODE (t)((enum tree_code) (t)->base.code) != SSA_NAME)
return 0;
    gimple *g = SSA_NAME_DEF_STMT (t)(tree_check ((t), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2901, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt;
    if (gimple_code (g) == GIMPLE_PHI && limit > 0)
if (int r = zero_one_minusone (as_a <gphi *> (g), limit - 1))
 {
   ret |= r;
   continue;
 }
    if (!is_gimple_assign (g))
return 0;
    if (gimple_assign_cast_p (g))
{
 tree rhs1 = gimple_assign_rhs1 (g);
 if (TREE_CODE (rhs1)((enum tree_code) (rhs1)->base.code) != SSA_NAME
     || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1))(((enum tree_code) (((contains_struct_check ((rhs1), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2914, __FUNCTION__))->typed.type))->base.code) == ENUMERAL_TYPE
 || ((enum tree_code) (((contains_struct_check ((rhs1), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2914, __FUNCTION__))->typed.type))->base.code) == BOOLEAN_TYPE
 || ((enum tree_code) (((contains_struct_check ((rhs1), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2914, __FUNCTION__))->typed.type))->base.code) == INTEGER_TYPE
)
     || TYPE_PRECISION (TREE_TYPE (rhs1))((tree_class_check ((((contains_struct_check ((rhs1), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2915, __FUNCTION__))->typed.type)), (tcc_type), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2915, __FUNCTION__))->type_common.precision) != 1
     || !TYPE_UNSIGNED (TREE_TYPE (rhs1))((tree_class_check ((((contains_struct_check ((rhs1), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2916, __FUNCTION__))->typed.type)), (tcc_type), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2916, __FUNCTION__))->base.u.bits.unsigned_flag))
   return 0;
 ret |= (2 | 4);
 continue;
}
    if (TREE_CODE_CLASS (gimple_assign_rhs_code (g))tree_code_type_tmpl <0>::tree_code_type[(int) (gimple_assign_rhs_code
 (g))] != tcc_comparison)
return 0;
    ret |= (2 | 4);
  }
return ret;
2926}

2928/* Find the basic block with return expression and look up for possible
 return value trying to apply RETURN_PREDICTION heuristics.  */
2930static void
2931apply_return_prediction (void)
2932{
greturn *return_stmt = NULLnullptr;
tree return_val;
edge e;
gphi *phi;
int phi_num_args, i;
enum br_predictor pred;
enum prediction direction;
edge_iterator ei;

FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)for ((ei) = ei_start_1 (&(((((cfun + 0))->cfg->x_exit_block_ptr
)->preds))); ei_cond ((ei), &(e)); ei_next (&(ei))
)
  {
    gimple *last = last_stmt (e->src);
    if (last
 && gimple_code (last) == GIMPLE_RETURN)
{
 return_stmt = as_a <greturn *> (last);
 break;
}
  }
if (!e)
  return;
return_val = gimple_return_retval (return_stmt);
if (!return_val)
  return;
if (TREE_CODE (return_val)((enum tree_code) (return_val)->base.code) != SSA_NAME
    || !SSA_NAME_DEF_STMT (return_val)(tree_check ((return_val), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2958, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt
    || gimple_code (SSA_NAME_DEF_STMT (return_val)(tree_check ((return_val), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2959, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt) != GIMPLE_PHI)
  return;
phi = as_a <gphi *> (SSA_NAME_DEF_STMT (return_val)(tree_check ((return_val), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2961, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt);
phi_num_args = gimple_phi_num_args (phi);
pred = return_prediction (PHI_ARG_DEF (phi, 0)gimple_phi_arg_def ((phi), (0)), &direction);

/* Avoid the case where the function returns -1, 0 and 1 values and
   nothing else.  Those could be qsort etc. comparison functions
   where the negative return isn't less probable than positive.
   For this require that the function returns at least -1 or 1
   or -1 and a boolean value or comparison result, so that functions
   returning just -1 and 0 are treated as if -1 represents error value.  */
if (INTEGRAL_TYPE_P (TREE_TYPE (return_val))(((enum tree_code) (((contains_struct_check ((return_val), (TS_TYPED
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2971, __FUNCTION__))->typed.type))->base.code) == ENUMERAL_TYPE
 || ((enum tree_code) (((contains_struct_check ((return_val),
 (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2971, __FUNCTION__))->typed.type))->base.code) == BOOLEAN_TYPE
 || ((enum tree_code) (((contains_struct_check ((return_val),
 (TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2971, __FUNCTION__))->typed.type))->base.code) == INTEGER_TYPE
)
    && !TYPE_UNSIGNED (TREE_TYPE (return_val))((tree_class_check ((((contains_struct_check ((return_val), (
TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2972, __FUNCTION__))->typed.type)), (tcc_type), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2972, __FUNCTION__))->base.u.bits.unsigned_flag)
    && TYPE_PRECISION (TREE_TYPE (return_val))((tree_class_check ((((contains_struct_check ((return_val), (
TS_TYPED), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2973, __FUNCTION__))->typed.type)), (tcc_type), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 2973, __FUNCTION__))->type_common.precision) > 1)
  if (int r = zero_one_minusone (phi, 3))
    if ((r & (1 | 4)) == (1 | 4))
return;

/* Avoid the degenerate case where all return values form the function
   belongs to same category (ie they are all positive constants)
   so we can hardly say something about them.  */
for (i = 1; i < phi_num_args; i++)
  if (pred != return_prediction (PHI_ARG_DEF (phi, i)gimple_phi_arg_def ((phi), (i)), &direction))
    break;
if (i != phi_num_args)
  for (i = 0; i < phi_num_args; i++)
    {
pred = return_prediction (PHI_ARG_DEF (phi, i)gimple_phi_arg_def ((phi), (i)), &direction);
if (pred != PRED_NO_PREDICTION)
 predict_paths_leading_to_edge (gimple_phi_arg_edge (phi, i), pred,
		         direction);
    }
2992}

2994/* Look for basic block that contains unlikely to happen events
 (such as noreturn calls) and mark all paths leading to execution
 of this basic blocks as unlikely.  */

2998static void
2999tree_bb_level_predictions (void)
3000{
basic_block bb;
bool has_return_edges = false;
edge e;
edge_iterator ei;

FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)for ((ei) = ei_start_1 (&(((((cfun + 0))->cfg->x_exit_block_ptr
)->preds))); ei_cond ((ei), &(e)); ei_next (&(ei))
)
  if (!unlikely_executed_edge_p (e) && !(e->flags & EDGE_ABNORMAL_CALL))
    {
      has_return_edges = true;
break;
    }

apply_return_prediction ();

FOR_EACH_BB_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_entry_block_ptr->next_bb
; bb != ((cfun + 0))->cfg->x_exit_block_ptr; bb = bb->
next_bb)
  {
    gimple_stmt_iterator gsi;

    for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
{
 gimple *stmt = gsi_stmt (gsi);
 tree decl;

 if (is_gimple_call (stmt))
   {
     if (gimple_call_noreturn_p (stmt)
  && has_return_edges
  && !is_exit_with_zero_arg (stmt))
predict_paths_leading_to (bb, PRED_NORETURN,
			  NOT_TAKEN);
     decl = gimple_call_fndecl (stmt);
     if (decl
  && lookup_attribute ("cold",
		       DECL_ATTRIBUTES (decl)((contains_struct_check ((decl), (TS_DECL_COMMON), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 3034, __FUNCTION__))->decl_common.attributes)))
predict_paths_leading_to (bb, PRED_COLD_FUNCTION,
			  NOT_TAKEN);
     if (decl && recursive_call_p (current_function_decl, decl))
predict_paths_leading_to (bb, PRED_RECURSIVE_CALL,
			  NOT_TAKEN);
   }
 else if (gimple_code (stmt) == GIMPLE_PREDICT)
   {
     predict_paths_leading_to (bb, gimple_predict_predictor (stmt),
			gimple_predict_outcome (stmt));
     /* Keep GIMPLE_PREDICT around so early inlining will propagate
        hints to callers.  */
   }
}
  }
3050}

3052/* Callback for hash_map::traverse, asserts that the pointer map is
 empty.  */

3055bool
3056assert_is_empty (const_basic_block const &, edge_prediction *const &value,
 void *)
3058{
gcc_assert (!value)((void)(!(!value) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 3059, __FUNCTION__), 0 : 0));
return true;
3061}

3063/* Predict branch probabilities and estimate profile for basic block BB.
 When LOCAL_ONLY is set do not use any global properties of CFG.  */

3066static void
3067tree_estimate_probability_bb (basic_block bb, bool local_only)
3068{
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)))
  {
    /* Look for block we are guarding (ie we dominate it,
but it doesn't postdominate us).  */
    if (e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_exit_block_ptr) && e->dest != bb
 && !local_only
 && dominated_by_p (CDI_DOMINATORS, e->dest, e->src)
 && !dominated_by_p (CDI_POST_DOMINATORS, e->src, e->dest))
{
 gimple_stmt_iterator bi;

 /* The call heuristic claims that a guarded function call
    is improbable.  This is because such calls are often used
    to signal exceptional situations such as printing error
    messages.  */
 for (bi = gsi_start_bb (e->dest); !gsi_end_p (bi);
      gsi_next (&bi))
   {
     gimple *stmt = gsi_stmt (bi);
     if (is_gimple_call (stmt)
  && !gimple_inexpensive_call_p (as_a <gcall *>  (stmt))
  /* Constant and pure calls are hardly used to signalize
     something exceptional.  */
  && gimple_has_side_effects (stmt))
{
  if (gimple_call_fndecl (stmt))
    predict_edge_def (e, PRED_CALL, NOT_TAKEN);
  else if (virtual_method_call_p (gimple_call_fn (stmt)))
    predict_edge_def (e, PRED_POLYMORPHIC_CALL, NOT_TAKEN);
  else
    predict_edge_def (e, PRED_INDIR_CALL, TAKEN);
  break;
}
   }
}
  }
tree_predict_by_opcode (bb);
3109}

3111/* Predict branch probabilities and estimate profile of the tree CFG.
 This function can be called from the loop optimizers to recompute
 the profile information.
 If DRY_RUN is set, do not modify CFG and only produce dump files.  */

3116void
3117tree_estimate_probability (bool dry_run)
3118{
basic_block bb;

connect_infinite_loops_to_exit ();
/* We use loop_niter_by_eval, which requires that the loops have
   preheaders.  */
create_preheaders (CP_SIMPLE_PREHEADERS);
calculate_dominance_info (CDI_POST_DOMINATORS);
/* Decide which edges are known to be unlikely.  This improves later
   branch prediction. */
determine_unlikely_bbs ();

bb_predictions = new hash_map<const_basic_block, edge_prediction *>;
tree_bb_level_predictions ();
record_loop_exits ();

if (number_of_loops (cfun(cfun + 0)) > 1)
  predict_loops ();

FOR_EACH_BB_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_entry_block_ptr->next_bb
; bb != ((cfun + 0))->cfg->x_exit_block_ptr; bb = bb->
next_bb)
  tree_estimate_probability_bb (bb, false);

FOR_EACH_BB_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_entry_block_ptr->next_bb
; bb != ((cfun + 0))->cfg->x_exit_block_ptr; bb = bb->
next_bb)
  combine_predictions_for_bb (bb, dry_run);

if (flag_checkingglobal_options.x_flag_checking)
  bb_predictions->traverse<void *, assert_is_empty> (NULLnullptr);

delete bb_predictions;
bb_predictions = NULLnullptr;

if (!dry_run)
  estimate_bb_frequencies (false);
free_dominance_info (CDI_POST_DOMINATORS);
remove_fake_exit_edges ();
3153}

3155/* Set edge->probability for each successor edge of BB.  */
3156void
3157tree_guess_outgoing_edge_probabilities (basic_block bb)
3158{
bb_predictions = new hash_map<const_basic_block, edge_prediction *>;
tree_estimate_probability_bb (bb, true);
combine_predictions_for_bb (bb, false);
if (flag_checkingglobal_options.x_flag_checking)
  bb_predictions->traverse<void *, assert_is_empty> (NULLnullptr);
delete bb_predictions;
bb_predictions = NULLnullptr;
3166}
3167
3168/* Filter function predicate that returns true for a edge predicate P
 if its edge is equal to DATA.  */

3171static bool
3172not_loop_guard_equal_edge_p (edge_prediction *p, void *data)
3173{
return p->ep_edge != (edge)data || p->ep_predictor != PRED_LOOP_GUARD;
3175}

3177/* Predict edge E with PRED unless it is already predicted by some predictor
 considered equivalent.  */

3180static void
3181maybe_predict_edge (edge e, enum br_predictor pred, enum prediction taken)
3182{
if (edge_predicted_by_p (e, pred, taken))
  return;
if (pred == PRED_LOOP_GUARD
    && edge_predicted_by_p (e, PRED_LOOP_GUARD_WITH_RECURSION, taken))
  return;
/* Consider PRED_LOOP_GUARD_WITH_RECURSION superrior to LOOP_GUARD.  */
if (pred == PRED_LOOP_GUARD_WITH_RECURSION)
  {
    edge_prediction **preds = bb_predictions->get (e->src);
    if (preds)
filter_predictions (preds, not_loop_guard_equal_edge_p, e);
  }
predict_edge_def (e, pred, taken);
3196}
3197/* Predict edges to successors of CUR whose sources are not postdominated by
 BB by PRED and recurse to all postdominators.  */

3200static void
3201predict_paths_for_bb (basic_block cur, basic_block bb,
      enum br_predictor pred,
      enum prediction taken,
      bitmap visited, class loop *in_loop = NULLnullptr)
3205{
edge e;
edge_iterator ei;
basic_block son;

/* If we exited the loop or CUR is unconditional in the loop, there is
   nothing to do.  */
if (in_loop
    && (!flow_bb_inside_loop_p (in_loop, cur)
 || dominated_by_p (CDI_DOMINATORS, in_loop->latch, cur)))
  return;

/* We are looking for all edges forming edge cut induced by
   set of all blocks postdominated by BB.  */
FOR_EACH_EDGE (e, ei, cur->preds)for ((ei) = ei_start_1 (&((cur->preds))); ei_cond ((ei
), &(e)); ei_next (&(ei)))
  if (e->src->index >= NUM_FIXED_BLOCKS(2)
&& !dominated_by_p (CDI_POST_DOMINATORS, e->src, bb))
  {
    edge e2;
    edge_iterator ei2;
    bool found = false;

    /* Ignore fake edges and eh, we predict them as not taken anyway.  */
    if (unlikely_executed_edge_p (e))
continue;
    gcc_assert (bb == cur || dominated_by_p (CDI_POST_DOMINATORS, cur, bb))((void)(!(bb == cur || dominated_by_p (CDI_POST_DOMINATORS, cur
, bb)) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 3230, __FUNCTION__), 0 : 0));

    /* See if there is an edge from e->src that is not abnormal
and does not lead to BB and does not exit the loop.  */
    FOR_EACH_EDGE (e2, ei2, e->src->succs)for ((ei2) = ei_start_1 (&((e->src->succs))); ei_cond
 ((ei2), &(e2)); ei_next (&(ei2)))
if (e2 != e
   && !unlikely_executed_edge_p (e2)
   && !dominated_by_p (CDI_POST_DOMINATORS, e2->dest, bb)
   && (!in_loop || !loop_exit_edge_p (in_loop, e2)))
 {
   found = true;
   break;
 }

    /* If there is non-abnormal path leaving e->src, predict edge
using predictor.  Otherwise we need to look for paths
leading to e->src.

The second may lead to infinite loop in the case we are predicitng
regions that are only reachable by abnormal edges.  We simply
prevent visiting given BB twice.  */
    if (found)
maybe_predict_edge (e, pred, taken);
    else if (bitmap_set_bit (visited, e->src->index))
predict_paths_for_bb (e->src, e->src, pred, taken, visited, in_loop);
  }
for (son = first_dom_son (CDI_POST_DOMINATORS, cur);
     son;
     son = next_dom_son (CDI_POST_DOMINATORS, son))
  predict_paths_for_bb (son, bb, pred, taken, visited, in_loop);
3260}

3262/* Sets branch probabilities according to PREDiction and
 FLAGS.  */

3265static void
3266predict_paths_leading_to (basic_block bb, enum br_predictor pred,
	  enum prediction taken, class loop *in_loop)
3268{
predict_paths_for_bb (bb, bb, pred, taken, auto_bitmap (), in_loop);
3270}

3272/* Like predict_paths_leading_to but take edge instead of basic block.  */

3274static void
3275predict_paths_leading_to_edge (edge e, enum br_predictor pred,
	       enum prediction taken, class loop *in_loop)
3277{
bool has_nonloop_edge = false;
edge_iterator ei;
edge e2;

basic_block bb = e->src;
FOR_EACH_EDGE (e2, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e2)); ei_next (&(ei)))
  if (e2->dest != e->src && e2->dest != e->dest
&& !unlikely_executed_edge_p (e2)
&& !dominated_by_p (CDI_POST_DOMINATORS, e->src, e2->dest))
    {
has_nonloop_edge = true;
break;
    }

if (!has_nonloop_edge)
  predict_paths_for_bb (bb, bb, pred, taken, auto_bitmap (), in_loop);
else
  maybe_predict_edge (e, pred, taken);
3296}
3297
3298/* This is used to carry information about basic blocks.  It is
 attached to the AUX field of the standard CFG block.  */

3301class block_info
3302{
3303public:
/* Estimated frequency of execution of basic_block.  */
sreal frequency;

/* To keep queue of basic blocks to process.  */
basic_block next;

/* Number of predecessors we need to visit first.  */
int npredecessors;
3312};

3314/* Similar information for edges.  */
3315class edge_prob_info
3316{
3317public:
/* In case edge is a loopback edge, the probability edge will be reached
   in case header is.  Estimated number of iterations of the loop can be
   then computed as 1 / (1 - back_edge_prob).  */
sreal back_edge_prob;
/* True if the edge is a loopback edge in the natural loop.  */
unsigned int back_edge:1;
3324};

3326#define BLOCK_INFO(B)((block_info *) (B)->aux)	((block_info *) (B)->aux)
3327#undef EDGE_INFO
3328#define EDGE_INFO(E)((edge_prob_info *) (E)->aux)	((edge_prob_info *) (E)->aux)

3330/* Helper function for estimate_bb_frequencies.
 Propagate the frequencies in blocks marked in
 TOVISIT, starting in HEAD.  */

3334static void
3335propagate_freq (basic_block head, bitmap tovisit,
sreal max_cyclic_prob)
3337{
basic_block bb;
basic_block last;
unsigned i;
edge e;
basic_block nextbb;
bitmap_iterator bi;

/* For each basic block we need to visit count number of his predecessors
   we need to visit first.  */
EXECUTE_IF_SET_IN_BITMAP (tovisit, 0, i, bi)for (bmp_iter_set_init (&(bi), (tovisit), (0), &(i));
 bmp_iter_set (&(bi), &(i)); bmp_iter_next (&(bi)
, &(i)))
  {
    edge_iterator ei;
    int count = 0;

    bb = BASIC_BLOCK_FOR_FN (cfun, i)((*(((cfun + 0))->cfg->x_basic_block_info))[(i)]);

    FOR_EACH_EDGE (e, ei, bb->preds)for ((ei) = ei_start_1 (&((bb->preds))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
{
 bool visit = bitmap_bit_p (tovisit, e->src->index);

 if (visit && !(e->flags & EDGE_DFS_BACK))
   count++;
 else if (visit && dump_file && !EDGE_INFO (e)((edge_prob_info *) (e)->aux)->back_edge)
   fprintf (dump_file,
     "Irreducible region hit, ignoring edge to %i->%i\n",
     e->src->index, bb->index);
}
    BLOCK_INFO (bb)((block_info *) (bb)->aux)->npredecessors = count;
    /* When function never returns, we will never process exit block.  */
    if (!count && bb == EXIT_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_exit_block_ptr))
bb->count = profile_count::zero ();
  }

BLOCK_INFO (head)((block_info *) (head)->aux)->frequency = 1;
last = head;
for (bb = head; bb; bb = nextbb)
  {
    edge_iterator ei;
    sreal cyclic_probability = 0;
    sreal frequency = 0;

    nextbb = BLOCK_INFO (bb)((block_info *) (bb)->aux)->next;
    BLOCK_INFO (bb)((block_info *) (bb)->aux)->next = NULLnullptr;

    /* Compute frequency of basic block.  */
    if (bb != head)
{
 if (flag_checkingglobal_options.x_flag_checking)
   FOR_EACH_EDGE (e, ei, bb->preds)for ((ei) = ei_start_1 (&((bb->preds))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
     gcc_assert (!bitmap_bit_p (tovisit, e->src->index)((void)(!(!bitmap_bit_p (tovisit, e->src->index) || (e->
flags & EDGE_DFS_BACK)) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 3388, __FUNCTION__), 0 : 0))
	  || (e->flags & EDGE_DFS_BACK))((void)(!(!bitmap_bit_p (tovisit, e->src->index) || (e->
flags & EDGE_DFS_BACK)) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 3388, __FUNCTION__), 0 : 0));

 FOR_EACH_EDGE (e, ei, bb->preds)for ((ei) = ei_start_1 (&((bb->preds))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
   if (EDGE_INFO (e)((edge_prob_info *) (e)->aux)->back_edge)
     cyclic_probability += EDGE_INFO (e)((edge_prob_info *) (e)->aux)->back_edge_prob;
   else if (!(e->flags & EDGE_DFS_BACK))
     {
/* FIXME: Graphite is producing edges with no profile. Once
   this is fixed, drop this.  */
sreal tmp = e->probability.initialized_p () ?
	    e->probability.to_sreal () : 0;
frequency += tmp * BLOCK_INFO (e->src)((block_info *) (e->src)->aux)->frequency;
     }

 if (cyclic_probability == 0)
   {
     BLOCK_INFO (bb)((block_info *) (bb)->aux)->frequency = frequency;
   }
 else
   {
     if (cyclic_probability > max_cyclic_prob)
{
  if (dump_file)
    fprintf (dump_file,
	     "cyclic probability of bb %i is %f (capped to %f)"
	     "; turning freq %f",
	     bb->index, cyclic_probability.to_double (),
	     max_cyclic_prob.to_double (),
	     frequency.to_double ());
	
  cyclic_probability = max_cyclic_prob;
}
     else if (dump_file)
fprintf (dump_file,
	 "cyclic probability of bb %i is %f; turning freq %f",
	 bb->index, cyclic_probability.to_double (),
	 frequency.to_double ());

     BLOCK_INFO (bb)((block_info *) (bb)->aux)->frequency = frequency
		 / (sreal (1) - cyclic_probability);
     if (dump_file)
fprintf (dump_file, " to %f\n",
	 BLOCK_INFO (bb)((block_info *) (bb)->aux)->frequency.to_double ());
   }
}

    bitmap_clear_bit (tovisit, bb->index);

    e = find_edge (bb, head);
    if (e)
{
 /* FIXME: Graphite is producing edges with no profile. Once
    this is fixed, drop this.  */
 sreal tmp = e->probability.initialized_p () ?
      e->probability.to_sreal () : 0;
 EDGE_INFO (e)((edge_prob_info *) (e)->aux)->back_edge_prob = tmp * BLOCK_INFO (bb)((block_info *) (bb)->aux)->frequency;
}

    /* Propagate to successor blocks.  */
    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_DFS_BACK)
   && BLOCK_INFO (e->dest)((block_info *) (e->dest)->aux)->npredecessors)
 {
   BLOCK_INFO (e->dest)((block_info *) (e->dest)->aux)->npredecessors--;
   if (!BLOCK_INFO (e->dest)((block_info *) (e->dest)->aux)->npredecessors)
     {
if (!nextbb)
  nextbb = e->dest;
else
  BLOCK_INFO (last)((block_info *) (last)->aux)->next = e->dest;

last = e->dest;
     }
 }
  }
3463}

3465/* Estimate frequencies in loops at same nest level.  */

3467static void
3468estimate_loops_at_level (class loop *first_loop, sreal max_cyclic_prob)
3469{
class loop *loop;

for (loop = first_loop; loop; loop = loop->next)
  {
    edge e;
    basic_block *bbs;
    unsigned i;
    auto_bitmap tovisit;

    estimate_loops_at_level (loop->inner, max_cyclic_prob);

    /* Find current loop back edge and mark it.  */
    e = loop_latch_edge (loop);
    EDGE_INFO (e)((edge_prob_info *) (e)->aux)->back_edge = 1;

    bbs = get_loop_body (loop);
    for (i = 0; i < loop->num_nodes; i++)
bitmap_set_bit (tovisit, bbs[i]->index);
    free (bbs);
    propagate_freq (loop->header, tovisit, max_cyclic_prob);
  }
3491}

3493/* Propagates frequencies through structure of loops.  */

3495static void
3496estimate_loops (void)
3497{
auto_bitmap tovisit;
basic_block bb;
sreal max_cyclic_prob = (sreal)1
	   - (sreal)1 / (param_max_predicted_iterationsglobal_options.x_param_max_predicted_iterations + 1);

/* Start by estimating the frequencies in the loops.  */
if (number_of_loops (cfun(cfun + 0)) > 1)
  estimate_loops_at_level (current_loops((cfun + 0)->x_current_loops)->tree_root->inner, max_cyclic_prob);

/* Now propagate the frequencies through all the blocks.  */
FOR_ALL_BB_FN (bb, cfun)for (bb = (((cfun + 0))->cfg->x_entry_block_ptr); bb; bb
 = bb->next_bb)
  {
    bitmap_set_bit (tovisit, bb->index);
  }
propagate_freq (ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr), tovisit, max_cyclic_prob);
3513}

3515/* Drop the profile for NODE to guessed, and update its frequency based on
 whether it is expected to be hot given the CALL_COUNT.  */

3518static void
3519drop_profile (struct cgraph_node *node, profile_count call_count)
3520{
struct function *fn = DECL_STRUCT_FUNCTION (node->decl)((tree_check ((node->decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 3521, __FUNCTION__, (FUNCTION_DECL)))->function_decl.f);
/* In the case where this was called by another function with a
   dropped profile, call_count will be 0. Since there are no
   non-zero call counts to this function, we don't know for sure
   whether it is hot, and therefore it will be marked normal below.  */
bool hot = maybe_hot_count_p (NULLnullptr, call_count);

if (dump_file)
  fprintf (dump_file,
    "Dropping 0 profile for %s. %s based on calls.\n",
    node->dump_name (),
    hot ? "Function is hot" : "Function is normal");
/* We only expect to miss profiles for functions that are reached
   via non-zero call edges in cases where the function may have
   been linked from another module or library (COMDATs and extern
   templates). See the comments below for handle_missing_profiles.
   Also, only warn in cases where the missing counts exceed the
   number of training runs. In certain cases with an execv followed
   by a no-return call the profile for the no-return call is not
   dumped and there can be a mismatch.  */
if (!DECL_COMDAT (node->decl)((contains_struct_check ((node->decl), (TS_DECL_WITH_VIS),
 "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 3541, __FUNCTION__))->decl_with_vis.comdat_flag) && !DECL_EXTERNAL (node->decl)((contains_struct_check ((node->decl), (TS_DECL_COMMON), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 3541, __FUNCTION__))->decl_common.decl_flag_1)
    && call_count > profile_info->runs)
  {
    if (flag_profile_correctionglobal_options.x_flag_profile_correction)
      {
        if (dump_file)
          fprintf (dump_file,
     "Missing counts for called function %s\n",
     node->dump_name ());
      }
    else
warning (0, "Missing counts for called function %s",
 node->dump_name ());
  }

basic_block bb;
if (opt_for_fn (node->decl, flag_guess_branch_prob)(opts_for_fn (node->decl)->x_flag_guess_branch_prob))
  {
    bool clear_zeros
= !ENTRY_BLOCK_PTR_FOR_FN (fn)((fn)->cfg->x_entry_block_ptr)->count.nonzero_p ();
    FOR_ALL_BB_FN (bb, fn)for (bb = ((fn)->cfg->x_entry_block_ptr); bb; bb = bb->
next_bb)
if (clear_zeros || !(bb->count == profile_count::zero ()))
 bb->count = bb->count.guessed_local ();
    fn->cfg->count_max = fn->cfg->count_max.guessed_local ();
  }
else
  {
    FOR_ALL_BB_FN (bb, fn)for (bb = ((fn)->cfg->x_entry_block_ptr); bb; bb = bb->
next_bb)
bb->count = profile_count::uninitialized ();
    fn->cfg->count_max = profile_count::uninitialized ();
  }

struct cgraph_edge *e;
for (e = node->callees; e; e = e->next_callee)
  e->count = gimple_bb (e->call_stmt)->count;
for (e = node->indirect_calls; e; e = e->next_callee)
  e->count = gimple_bb (e->call_stmt)->count;
node->count = ENTRY_BLOCK_PTR_FOR_FN (fn)((fn)->cfg->x_entry_block_ptr)->count;

profile_status_for_fn (fn)((fn)->cfg->x_profile_status)
    = (flag_guess_branch_probglobal_options.x_flag_guess_branch_prob ? PROFILE_GUESSED : PROFILE_ABSENT);
node->frequency
    = hot ? NODE_FREQUENCY_HOT : NODE_FREQUENCY_NORMAL;
3584}

3586/* In the case of COMDAT routines, multiple object files will contain the same
 function and the linker will select one for the binary. In that case
 all the other copies from the profile instrument binary will be missing
 profile counts. Look for cases where this happened, due to non-zero
 call counts going to 0-count functions, and drop the profile to guessed
 so that we can use the estimated probabilities and avoid optimizing only
 for size.
 
 The other case where the profile may be missing is when the routine
 is not going to be emitted to the object file, e.g. for "extern template"
 class methods. Those will be marked DECL_EXTERNAL. Emit a warning in
 all other cases of non-zero calls to 0-count functions.  */

3599void
3600handle_missing_profiles (void)
3601{
const int unlikely_frac = param_unlikely_bb_count_fractionglobal_options.x_param_unlikely_bb_count_fraction;
struct cgraph_node *node;
auto_vec<struct cgraph_node *, 64> worklist;

/* See if 0 count function has non-0 count callers.  In this case we
   lost some profile.  Drop its function profile to PROFILE_GUESSED.  */
FOR_EACH_DEFINED_FUNCTION (node)for ((node) = symtab->first_defined_function (); (node); (
node) = symtab->next_defined_function ((node)))
  {
    struct cgraph_edge *e;
    profile_count call_count = profile_count::zero ();
    gcov_type max_tp_first_run = 0;
    struct function *fn = DECL_STRUCT_FUNCTION (node->decl)((tree_check ((node->decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 3613, __FUNCTION__, (FUNCTION_DECL)))->function_decl.f);

    if (node->count.ipa ().nonzero_p ())
      continue;
    for (e = node->callers; e; e = e->next_caller)
if (e->count.ipa ().initialized_p () && e->count.ipa () > 0)
 {
          call_count = call_count + e->count.ipa ();

   if (e->caller->tp_first_run > max_tp_first_run)
     max_tp_first_run = e->caller->tp_first_run;
 }

    /* If time profile is missing, let assign the maximum that comes from
caller functions.  */
    if (!node->tp_first_run && max_tp_first_run)
node->tp_first_run = max_tp_first_run + 1;

    if (call_count > 0
        && fn && fn->cfg
 && call_count * unlikely_frac >= profile_info->runs)
      {
        drop_profile (node, call_count);
        worklist.safe_push (node);
      }
  }

/* Propagate the profile dropping to other 0-count COMDATs that are
   potentially called by COMDATs we already dropped the profile on.  */
while (worklist.length () > 0)
  {
    struct cgraph_edge *e;

    node = worklist.pop ();
    for (e = node->callees; e; e = e->next_caller)
      {
        struct cgraph_node *callee = e->callee;
        struct function *fn = DECL_STRUCT_FUNCTION (callee->decl)((tree_check ((callee->decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 3650, __FUNCTION__, (FUNCTION_DECL)))->function_decl.f);

        if (!(e->count.ipa () == profile_count::zero ())
     && callee->count.ipa ().nonzero_p ())
          continue;
        if ((DECL_COMDAT (callee->decl)((contains_struct_check ((callee->decl), (TS_DECL_WITH_VIS
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 3655, __FUNCTION__))->decl_with_vis.comdat_flag) || DECL_EXTERNAL (callee->decl)((contains_struct_check ((callee->decl), (TS_DECL_COMMON),
 "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 3655, __FUNCTION__))->decl_common.decl_flag_1))
     && fn && fn->cfg
            && profile_status_for_fn (fn)((fn)->cfg->x_profile_status) == PROFILE_READ)
          {
            drop_profile (node, profile_count::zero ());
            worklist.safe_push (callee);
          }
      }
  }
3664}

3666/* Convert counts measured by profile driven feedback to frequencies.
 Return nonzero iff there was any nonzero execution count.  */

3669bool
3670update_max_bb_count (void)
3671{
profile_count true_count_max = profile_count::uninitialized ();
basic_block bb;

FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb)for (bb = (((cfun + 0))->cfg->x_entry_block_ptr); bb !=
 nullptr; bb = bb->next_bb)
  true_count_max = true_count_max.max (bb->count);

cfun(cfun + 0)->cfg->count_max = true_count_max;

return true_count_max.ipa ().nonzero_p ();
3681}

3683/* Return true if function is likely to be expensive, so there is no point to
 optimize performance of prologue, epilogue or do inlining at the expense
 of code size growth.  THRESHOLD is the limit of number of instructions
 function can execute at average to be still considered not expensive.  */

3688bool
3689expensive_function_p (int threshold)
3690{
basic_block bb;

/* If profile was scaled in a way entry block has count 0, then the function
   is deifnitly taking a lot of time.  */
if (!ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr)->count.nonzero_p ())
  return true;

profile_count limit = ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr)->count * threshold;
profile_count sum = profile_count::zero ();
FOR_EACH_BB_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_entry_block_ptr->next_bb
; bb != ((cfun + 0))->cfg->x_exit_block_ptr; bb = bb->
next_bb)
  {
    rtx_insn *insn;

    if (!bb->count.initialized_p ())
{
 if (dump_file)
   fprintf (dump_file, "Function is considered expensive because"
     " count of bb %i is not initialized\n", bb->index);
 return true;
}

    FOR_BB_INSNS (bb, insn)for ((insn) = (bb)->il.x.head_; (insn) && (insn) !=
 NEXT_INSN ((bb)->il.x.rtl->end_); (insn) = NEXT_INSN (
insn))
if (active_insn_p (insn))
 {
   sum += bb->count;
   if (sum > limit)
     return true;
}
  }

return false;
3722}

3724/* All basic blocks that are reachable only from unlikely basic blocks are
 unlikely.  */

3727void
3728propagate_unlikely_bbs_forward (void)
3729{
auto_vec<basic_block, 64> worklist;
basic_block bb;
edge_iterator ei;
edge e;

if (!(ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr)->count == profile_count::zero ()))
  {
    ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr)->aux = (void *)(size_t) 1;
    worklist.safe_push (ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr));

    while (worklist.length () > 0)
{
 bb = worklist.pop ();
 FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
   if (!(e->count () == profile_count::zero ())
&& !(e->dest->count == profile_count::zero ())
&& !e->dest->aux)
     {
e->dest->aux = (void *)(size_t) 1;
worklist.safe_push (e->dest);
     }
}
  }

FOR_ALL_BB_FN (bb, cfun)for (bb = (((cfun + 0))->cfg->x_entry_block_ptr); bb; bb
 = bb->next_bb)
  {
    if (!bb->aux)
{
 if (!(bb->count == profile_count::zero ())
     && (dump_file && (dump_flags & TDF_DETAILS)))
   fprintf (dump_file,
     "Basic block %i is marked unlikely by forward prop\n",
     bb->index);
 bb->count = profile_count::zero ();
}
    else
      bb->aux = NULLnullptr;
  }
3768}

3770/* Determine basic blocks/edges that are known to be unlikely executed and set
 their counters to zero.
 This is done with first identifying obviously unlikely BBs/edges and then
 propagating in both directions.  */

3775static void
3776determine_unlikely_bbs ()
3777{
basic_block bb;
auto_vec<basic_block, 64> worklist;
edge_iterator ei;
edge e;

FOR_EACH_BB_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_entry_block_ptr->next_bb
; bb != ((cfun + 0))->cfg->x_exit_block_ptr; bb = bb->
next_bb)
  {
    if (!(bb->count == profile_count::zero ())
 && unlikely_executed_bb_p (bb))
{
        if (dump_file && (dump_flags & TDF_DETAILS))
   fprintf (dump_file, "Basic block %i is locally unlikely\n",
     bb->index);
 bb->count = profile_count::zero ();
}

    FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
if (!(e->probability == profile_probability::never ())
   && unlikely_executed_edge_p (e))
 {
          if (dump_file && (dump_flags & TDF_DETAILS))
     fprintf (dump_file, "Edge %i->%i is locally unlikely\n",
       bb->index, e->dest->index);
   e->probability = profile_probability::never ();
 }

    gcc_checking_assert (!bb->aux)((void)(!(!bb->aux) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 3804, __FUNCTION__), 0 : 0));
  }
propagate_unlikely_bbs_forward ();

auto_vec<int, 64> nsuccs;
nsuccs.safe_grow_cleared (last_basic_block_for_fn (cfun)(((cfun + 0))->cfg->x_last_basic_block), true);
FOR_ALL_BB_FN (bb, cfun)for (bb = (((cfun + 0))->cfg->x_entry_block_ptr); bb; bb
 = bb->next_bb)
  if (!(bb->count == profile_count::zero ())
&& bb != EXIT_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_exit_block_ptr))
    {
nsuccs[bb->index] = 0;
      FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
 if (!(e->probability == profile_probability::never ())
     && !(e->dest->count == profile_count::zero ()))
   nsuccs[bb->index]++;
if (!nsuccs[bb->index])
 worklist.safe_push (bb);
    }
while (worklist.length () > 0)
  {
    bb = worklist.pop ();
    if (bb->count == profile_count::zero ())
continue;
    if (bb != ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr))
{
 bool found = false;
        for (gimple_stmt_iterator gsi = gsi_start_bb (bb);
             !gsi_end_p (gsi); gsi_next (&gsi))
   if (stmt_can_terminate_bb_p (gsi_stmt (gsi))
/* stmt_can_terminate_bb_p special cases noreturns because it
   assumes that fake edges are created.  We want to know that
   noreturn alone does not imply BB to be unlikely.  */
|| (is_gimple_call (gsi_stmt (gsi))
    && (gimple_call_flags (gsi_stmt (gsi)) & ECF_NORETURN(1 << 3))))
     {
found = true;
break;
     }
 if (found)
   continue;
}
    if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
 "Basic block %i is marked unlikely by backward prop\n",
 bb->index);
    bb->count = profile_count::zero ();
    FOR_EACH_EDGE (e, ei, bb->preds)for ((ei) = ei_start_1 (&((bb->preds))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
if (!(e->probability == profile_probability::never ()))
 {
   if (!(e->src->count == profile_count::zero ()))
     {
gcc_checking_assert (nsuccs[e->src->index] > 0)((void)(!(nsuccs[e->src->index] > 0) ? fancy_abort (
"/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 3855, __FUNCTION__), 0 : 0));
       nsuccs[e->src->index]--;
       if (!nsuccs[e->src->index])
  worklist.safe_push (e->src);
     }
 }
  }
/* Finally all edges from non-0 regions to 0 are unlikely.  */
FOR_ALL_BB_FN (bb, cfun)for (bb = (((cfun + 0))->cfg->x_entry_block_ptr); bb; bb
 = bb->next_bb)
  {
    if (!(bb->count == profile_count::zero ()))
FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
 if (!(e->probability == profile_probability::never ())
     && e->dest->count == profile_count::zero ())
    {
      if (dump_file && (dump_flags & TDF_DETAILS))
 fprintf (dump_file, "Edge %i->%i is unlikely because "
	  "it enters unlikely block\n",
	  bb->index, e->dest->index);
      e->probability = profile_probability::never ();
    }

    edge other = NULLnullptr;

    FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
if (e->probability == profile_probability::never ())
 ;
else if (other)
 {
   other = NULLnullptr;
   break;
 }
else
 other = e;
    if (other
 && !(other->probability == profile_probability::always ()))
{
          if (dump_file && (dump_flags & TDF_DETAILS))
     fprintf (dump_file, "Edge %i->%i is locally likely\n",
       bb->index, other->dest->index);
 other->probability = profile_probability::always ();
}
  }
if (ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr)->count == profile_count::zero ())
  cgraph_node::get (current_function_decl)->count = profile_count::zero ();
3900}

3902/* Estimate and propagate basic block frequencies using the given branch
 probabilities.  If FORCE is true, the frequencies are used to estimate
 the counts even when there are already non-zero profile counts.  */

3906void
3907estimate_bb_frequencies (bool force)
3908{
basic_block bb;
sreal freq_max;

determine_unlikely_bbs ();

if (force || profile_status_for_fn (cfun)(((cfun + 0))->cfg->x_profile_status) != PROFILE_READ
    || !update_max_bb_count ())
  {

    mark_dfs_back_edges ();

    single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr))->probability =
profile_probability::always ();

    /* Set up block info for each basic block.  */
    alloc_aux_for_blocks (sizeof (block_info));
    alloc_aux_for_edges (sizeof (edge_prob_info));
    FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb)for (bb = (((cfun + 0))->cfg->x_entry_block_ptr); bb !=
 nullptr; bb = bb->next_bb)
{
 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)))
   {
     /* FIXME: Graphite is producing edges with no profile. Once
 this is fixed, drop this.  */
     if (e->probability.initialized_p ())
       EDGE_INFO (e)((edge_prob_info *) (e)->aux)->back_edge_prob
   = e->probability.to_sreal ();
     else
/* back_edge_prob = 0.5 */
EDGE_INFO (e)((edge_prob_info *) (e)->aux)->back_edge_prob = sreal (1, -1);
   }
}

    /* First compute frequencies locally for each loop from innermost
       to outermost to examine frequencies for back edges.  */
    estimate_loops ();

    freq_max = 0;
    FOR_EACH_BB_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_entry_block_ptr->next_bb
; bb != ((cfun + 0))->cfg->x_exit_block_ptr; bb = bb->
next_bb)
if (freq_max < BLOCK_INFO (bb)((block_info *) (bb)->aux)->frequency)
 freq_max = BLOCK_INFO (bb)((block_info *) (bb)->aux)->frequency;

    /* Scaling frequencies up to maximal profile count may result in
frequent overflows especially when inlining loops.
Small scalling results in unnecesary precision loss.  Stay in
the half of the (exponential) range.  */
    freq_max = (sreal (1) << (profile_count::n_bits / 2)) / freq_max;
    if (freq_max < 16)
freq_max = 16;
    profile_count ipa_count = ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr)->count.ipa ();
    cfun(cfun + 0)->cfg->count_max = profile_count::uninitialized ();
    FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb)for (bb = (((cfun + 0))->cfg->x_entry_block_ptr); bb !=
 nullptr; bb = bb->next_bb)
{
 sreal tmp = BLOCK_INFO (bb)((block_info *) (bb)->aux)->frequency;
 if (tmp >= 1)
   {
     gimple_stmt_iterator gsi;
     tree decl;

     /* Self recursive calls can not have frequency greater than 1
 or program will never terminate.  This will result in an
 inconsistent bb profile but it is better than greatly confusing
 IPA cost metrics.  */
     for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
if (is_gimple_call (gsi_stmt (gsi))
    && (decl = gimple_call_fndecl (gsi_stmt (gsi))) != NULLnullptr
    && recursive_call_p (current_function_decl, decl))
  {
    if (dump_file)
      fprintf (dump_file, "Dropping frequency of recursive call"
	       " in bb %i from %f\n", bb->index,
	       tmp.to_double ());
    tmp = (sreal)9 / (sreal)10;
    break;
  }
   }
 tmp = tmp * freq_max + sreal (1, -1);
 profile_count count = profile_count::from_gcov_type (tmp.to_int ());	

 /* If we have profile feedback in which this function was never
    executed, then preserve this info.  */
 if (!(bb->count == profile_count::zero ()))
   bb->count = count.guessed_local ().combine_with_ipa_count (ipa_count);
        cfun(cfun + 0)->cfg->count_max = cfun(cfun + 0)->cfg->count_max.max (bb->count);
}

    free_aux_for_blocks ();
    free_aux_for_edges ();
  }
compute_function_frequency ();
4001}

4003/* Decide whether function is hot, cold or unlikely executed.  */
4004void
4005compute_function_frequency (void)
4006{
basic_block bb;
struct cgraph_node *node = cgraph_node::get (current_function_decl);

if (DECL_STATIC_CONSTRUCTOR (current_function_decl)((tree_check ((current_function_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 4010, __FUNCTION__, (FUNCTION_DECL)))->function_decl.static_ctor_flag
)
    || MAIN_NAME_P (DECL_NAME (current_function_decl))((tree_check ((((contains_struct_check ((current_function_decl
), (TS_DECL_MINIMAL), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 4011, __FUNCTION__))->decl_minimal.name)), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 4011, __FUNCTION__, (IDENTIFIER_NODE))) == global_trees[TI_MAIN_IDENTIFIER
]))
  node->only_called_at_startup = true;
if (DECL_STATIC_DESTRUCTOR (current_function_decl)((tree_check ((current_function_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 4013, __FUNCTION__, (FUNCTION_DECL)))->function_decl.static_dtor_flag
))
  node->only_called_at_exit = true;

if (!ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr)->count.ipa_p ())
  {
    int flags = flags_from_decl_or_type (current_function_decl);
    if (lookup_attribute ("cold", DECL_ATTRIBUTES (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 4019, __FUNCTION__))->decl_common.attributes))
 != NULLnullptr)
node->frequency = NODE_FREQUENCY_UNLIKELY_EXECUTED;
    else if (lookup_attribute ("hot", DECL_ATTRIBUTES (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 4022, __FUNCTION__))->decl_common.attributes))
      != NULLnullptr)
      node->frequency = NODE_FREQUENCY_HOT;
    else if (flags & ECF_NORETURN(1 << 3))
      node->frequency = NODE_FREQUENCY_EXECUTED_ONCE;
    else if (MAIN_NAME_P (DECL_NAME (current_function_decl))((tree_check ((((contains_struct_check ((current_function_decl
), (TS_DECL_MINIMAL), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 4027, __FUNCTION__))->decl_minimal.name)), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 4027, __FUNCTION__, (IDENTIFIER_NODE))) == global_trees[TI_MAIN_IDENTIFIER
]))
      node->frequency = NODE_FREQUENCY_EXECUTED_ONCE;
    else if (DECL_STATIC_CONSTRUCTOR (current_function_decl)((tree_check ((current_function_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 4029, __FUNCTION__, (FUNCTION_DECL)))->function_decl.static_ctor_flag
)
      || DECL_STATIC_DESTRUCTOR (current_function_decl)((tree_check ((current_function_decl), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 4030, __FUNCTION__, (FUNCTION_DECL)))->function_decl.static_dtor_flag
))
      node->frequency = NODE_FREQUENCY_EXECUTED_ONCE;
    return;
  }

node->frequency = NODE_FREQUENCY_UNLIKELY_EXECUTED;
if (lookup_attribute ("cold", DECL_ATTRIBUTES (current_function_decl)((contains_struct_check ((current_function_decl), (TS_DECL_COMMON
), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 4036, __FUNCTION__))->decl_common.attributes))
    == NULLnullptr)
  warn_function_cold (current_function_decl);
if (ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr)->count.ipa() == profile_count::zero ())
  return;
FOR_EACH_BB_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_entry_block_ptr->next_bb
; bb != ((cfun + 0))->cfg->x_exit_block_ptr; bb = bb->
next_bb)
  {
    if (maybe_hot_bb_p (cfun(cfun + 0), bb))
{
 node->frequency = NODE_FREQUENCY_HOT;
 return;
}
    if (!probably_never_executed_bb_p (cfun(cfun + 0), bb))
node->frequency = NODE_FREQUENCY_NORMAL;
  }
4051}

4053/* Build PREDICT_EXPR.  */
4054tree
4055build_predict_expr (enum br_predictor predictor, enum prediction taken)
4056{
tree t = build1 (PREDICT_EXPR, void_type_nodeglobal_trees[TI_VOID_TYPE],
   build_int_cst (integer_type_nodeinteger_types[itk_int], predictor));
SET_PREDICT_EXPR_OUTCOME (t, taken)((tree_check ((t), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 4059, __FUNCTION__, (PREDICT_EXPR)))->base.addressable_flag
 = (int) taken);
return t;
4061}

4063const char *
4064predictor_name (enum br_predictor predictor)
4065{
return predictor_info[predictor].name;
4067}

4069/* Predict branch probabilities and estimate profile of the tree CFG. */

4071namespace {

4073const pass_data pass_data_profile =
4074{
GIMPLE_PASS, /* type */
"profile_estimate", /* name */
OPTGROUP_NONE, /* optinfo_flags */
TV_BRANCH_PROB, /* tv_id */
PROP_cfg(1 << 3), /* properties_required */
0, /* properties_provided */
0, /* properties_destroyed */
0, /* todo_flags_start */
0, /* todo_flags_finish */
4084};

4086class pass_profile : public gimple_opt_pass
4087{
4088public:
pass_profile (gcc::context *ctxt)
  : gimple_opt_pass (pass_data_profile, ctxt)
{}

/* opt_pass methods: */
bool gate (function *) final override { return flag_guess_branch_probglobal_options.x_flag_guess_branch_prob; }
unsigned int execute (function *) final override;

4097}; // class pass_profile

4099unsigned int
4100pass_profile::execute (function *fun)
4101{
unsigned nb_loops;

if (profile_status_for_fn (cfun)(((cfun + 0))->cfg->x_profile_status) == PROFILE_GUESSED)
  return 0;

loop_optimizer_init (LOOPS_NORMAL(LOOPS_HAVE_PREHEADERS | LOOPS_HAVE_SIMPLE_LATCHES | LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS
));
if (dump_file && (dump_flags & TDF_DETAILS))
  flow_loops_dump (dump_file, NULLnullptr, 0);

nb_loops = number_of_loops (fun);
if (nb_loops > 1)
  scev_initialize ();

tree_estimate_probability (false);

if (nb_loops > 1)
  scev_finalize ();

loop_optimizer_finalize ();
if (dump_file && (dump_flags & TDF_DETAILS))
  gimple_dump_cfg (dump_file, dump_flags);
if (profile_status_for_fn (fun)((fun)->cfg->x_profile_status) == PROFILE_ABSENT)
  profile_status_for_fn (fun)((fun)->cfg->x_profile_status) = PROFILE_GUESSED;
if (dump_file && (dump_flags & TDF_DETAILS))
 {
   for (auto loop : loops_list (cfun(cfun + 0), LI_FROM_INNERMOST))
     if (loop->header->count.initialized_p ())
       fprintf (dump_file, "Loop got predicted %d to iterate %i times.\n",
     	   loop->num,
     	   (int)expected_loop_iterations_unbounded (loop));
 }
return 0;
4134}

4136} // anon namespace

4138gimple_opt_pass *
4139make_pass_profile (gcc::context *ctxt)
4140{
return new pass_profile (ctxt);
4142}

4144/* Return true when PRED predictor should be removed after early
 tree passes.  Most of the predictors are beneficial to survive
 as early inlining can also distribute then into caller's bodies.  */

4148static bool
4149strip_predictor_early (enum br_predictor pred)
4150{
switch (pred)
  {
  case PRED_TREE_EARLY_RETURN:
    return true;
  default:
    return false;
  }
4158}

4160/* Get rid of all builtin_expect calls and GIMPLE_PREDICT statements
 we no longer need.  EARLY is set to true when called from early
 optimizations.  */

4164unsigned int
4165strip_predict_hints (function *fun, bool early)
4166{
basic_block bb;
gimple *ass_stmt;
tree var;
bool changed = false;

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)
  {
    gimple_stmt_iterator bi;
    for (bi = gsi_start_bb (bb); !gsi_end_p (bi);)
{
 gimple *stmt = gsi_stmt (bi);

 if (gimple_code (stmt) == GIMPLE_PREDICT)
   {
     if (!early
  || strip_predictor_early (gimple_predict_predictor (stmt)))
{
  gsi_remove (&bi, true);
  changed = true;
  continue;
}
   }
 else if (is_gimple_call (stmt))
   {
     tree fndecl = gimple_call_fndecl (stmt);

     if (!early
  && ((fndecl != NULL_TREE(tree) nullptr
       && fndecl_built_in_p (fndecl, BUILT_IN_EXPECT)
       && gimple_call_num_args (stmt) == 2)
      || (fndecl != NULL_TREE(tree) nullptr
	  && fndecl_built_in_p (fndecl,
				BUILT_IN_EXPECT_WITH_PROBABILITY)
	  && gimple_call_num_args (stmt) == 3)
      || (gimple_call_internal_p (stmt)
	  && gimple_call_internal_fn (stmt) == IFN_BUILTIN_EXPECT)))
{
  var = gimple_call_lhs (stmt);
         changed = true;
  if (var)
    {
      ass_stmt
	= gimple_build_assign (var, gimple_call_arg (stmt, 0));
      gsi_replace (&bi, ass_stmt, true);
    }
  else
    {
      gsi_remove (&bi, true);
      continue;
    }
}
   }
 gsi_next (&bi);
}
  }
return changed ? TODO_cleanup_cfg(1 << 5) : 0;
4223}

4225namespace {

4227const pass_data pass_data_strip_predict_hints =
4228{
GIMPLE_PASS, /* type */
"*strip_predict_hints", /* name */
OPTGROUP_NONE, /* optinfo_flags */
TV_BRANCH_PROB, /* tv_id */
PROP_cfg(1 << 3), /* properties_required */
0, /* properties_provided */
0, /* properties_destroyed */
0, /* todo_flags_start */
0, /* todo_flags_finish */
4238};

4240class pass_strip_predict_hints : public gimple_opt_pass
4241{
4242public:
pass_strip_predict_hints (gcc::context *ctxt)
  : gimple_opt_pass (pass_data_strip_predict_hints, ctxt)
{}

/* opt_pass methods: */
opt_pass * clone () final override
{
  return new pass_strip_predict_hints (m_ctxt);
}
void set_pass_param (unsigned int n, bool param) final override
  {
    gcc_assert (n == 0)((void)(!(n == 0) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 4254, __FUNCTION__), 0 : 0));
    early_p = param;
  }

unsigned int execute (function *) final override;

4260private:
bool early_p;

4263}; // class pass_strip_predict_hints

4265unsigned int
4266pass_strip_predict_hints::execute (function *fun)
4267{
return strip_predict_hints (fun, early_p);
4269}

4271} // anon namespace

4273gimple_opt_pass *
4274make_pass_strip_predict_hints (gcc::context *ctxt)
4275{
return new pass_strip_predict_hints (ctxt);
4277}

4279/* Rebuild function frequencies.  Passes are in general expected to
 maintain profile by hand, however in some cases this is not possible:
 for example when inlining several functions with loops freuqencies might run
 out of scale and thus needs to be recomputed.  */

4284void
4285rebuild_frequencies (void)
4286{
timevar_push (TV_REBUILD_FREQUENCIES);

/* When the max bb count in the function is small, there is a higher
   chance that there were truncation errors in the integer scaling
   of counts by inlining and other optimizations. This could lead
   to incorrect classification of code as being cold when it isn't.
   In that case, force the estimation of bb counts/frequencies from the
   branch probabilities, rather than computing frequencies from counts,
   which may also lead to frequencies incorrectly reduced to 0. There
   is less precision in the probabilities, so we only do this for small
   max counts.  */
cfun(cfun + 0)->cfg->count_max = profile_count::uninitialized ();
basic_block bb;
FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb)for (bb = (((cfun + 0))->cfg->x_entry_block_ptr); bb !=
 nullptr; bb = bb->next_bb)
  cfun(cfun + 0)->cfg->count_max = cfun(cfun + 0)->cfg->count_max.max (bb->count);

if (profile_status_for_fn (cfun)(((cfun + 0))->cfg->x_profile_status) == PROFILE_GUESSED)
  {
    loop_optimizer_init (LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS);
    connect_infinite_loops_to_exit ();
    estimate_bb_frequencies (true);
    remove_fake_exit_edges ();
    loop_optimizer_finalize ();
  }
else if (profile_status_for_fn (cfun)(((cfun + 0))->cfg->x_profile_status) == PROFILE_READ)
  update_max_bb_count ();
else if (profile_status_for_fn (cfun)(((cfun + 0))->cfg->x_profile_status) == PROFILE_ABSENT
  && !flag_guess_branch_probglobal_options.x_flag_guess_branch_prob)
  ;
else
  gcc_unreachable ()(fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 4317, __FUNCTION__));
timevar_pop (TV_REBUILD_FREQUENCIES);
4319}

4321/* Perform a dry run of the branch prediction pass and report comparsion of
 the predicted and real profile into the dump file.  */

4324void
4325report_predictor_hitrates (void)
4326{
unsigned nb_loops;

loop_optimizer_init (LOOPS_NORMAL(LOOPS_HAVE_PREHEADERS | LOOPS_HAVE_SIMPLE_LATCHES | LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS
));
if (dump_file && (dump_flags & TDF_DETAILS))
  flow_loops_dump (dump_file, NULLnullptr, 0);

nb_loops = number_of_loops (cfun(cfun + 0));
if (nb_loops > 1)
  scev_initialize ();

tree_estimate_probability (true);

if (nb_loops > 1)
  scev_finalize ();

loop_optimizer_finalize ();
4343}

4345/* Force edge E to be cold.
 If IMPOSSIBLE is true, for edge to have count and probability 0 otherwise
 keep low probability to represent possible error in a guess.  This is used
 i.e. in case we predict loop to likely iterate given number of times but
 we are not 100% sure.

 This function locally updates profile without attempt to keep global
 consistency which cannot be reached in full generality without full profile
 rebuild from probabilities alone.  Doing so is not necessarily a good idea
 because frequencies and counts may be more realistic then probabilities.

 In some cases (such as for elimination of early exits during full loop
 unrolling) the caller can ensure that profile will get consistent
 afterwards.  */

4360void
4361force_edge_cold (edge e, bool impossible)
4362{
profile_count count_sum = profile_count::zero ();
profile_probability prob_sum = profile_probability::never ();
edge_iterator ei;
edge e2;
bool uninitialized_exit = false;

/* When branch probability guesses are not known, then do nothing.  */
if (!impossible && !e->count ().initialized_p ())
  return;

profile_probability goal = (impossible ? profile_probability::never ()
	      : profile_probability::very_unlikely ());

/* If edge is already improbably or cold, just return.  */
if (e->probability <= goal
    && (!impossible || e->count () == profile_count::zero ()))
  return;
FOR_EACH_EDGE (e2, ei, e->src->succs)for ((ei) = ei_start_1 (&((e->src->succs))); ei_cond
 ((ei), &(e2)); ei_next (&(ei)))
  if (e2 != e)
    {
if (e->flags & EDGE_FAKE)
 continue;
if (e2->count ().initialized_p ())
 count_sum += e2->count ();
if (e2->probability.initialized_p ())
 prob_sum += e2->probability;
else 
 uninitialized_exit = true;
    }

/* If we are not guessing profiles but have some other edges out,
   just assume the control flow goes elsewhere.  */
if (uninitialized_exit)
  e->probability = goal;
/* If there are other edges out of e->src, redistribute probabilitity
   there.  */
else if (prob_sum > profile_probability::never ())
  {
    if (!(e->probability < goal))
e->probability = goal;

    profile_probability prob_comp = prob_sum / e->probability.invert ();

    if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Making edge %i->%i %s by redistributing "
 "probability to other edges.\n",
 e->src->index, e->dest->index,
 impossible ? "impossible" : "cold");
    FOR_EACH_EDGE (e2, ei, e->src->succs)for ((ei) = ei_start_1 (&((e->src->succs))); ei_cond
 ((ei), &(e2)); ei_next (&(ei)))
if (e2 != e)
 {
   e2->probability /= prob_comp;
 }
    if (current_ir_type () != IR_GIMPLE
 && e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr))
update_br_prob_note (e->src);
  }
/* If all edges out of e->src are unlikely, the basic block itself
   is unlikely.  */
else
  {
    if (prob_sum == profile_probability::never ())
      e->probability = profile_probability::always ();
    else
{
 if (impossible)
   e->probability = profile_probability::never ();
 /* If BB has some edges out that are not impossible, we cannot
    assume that BB itself is.  */
 impossible = false;
}
    if (current_ir_type () != IR_GIMPLE
 && e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr))
update_br_prob_note (e->src);
    if (e->src->count == profile_count::zero ())
return;
    if (count_sum == profile_count::zero () && impossible)
{
 bool found = false;
 if (e->src == ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr))
   ;
 else if (current_ir_type () == IR_GIMPLE)
   for (gimple_stmt_iterator gsi = gsi_start_bb (e->src);
        !gsi_end_p (gsi); gsi_next (&gsi))
     {
       if (stmt_can_terminate_bb_p (gsi_stmt (gsi)))
  {
    found = true;
           break;
  }
     }
 /* FIXME: Implement RTL path.  */
 else 
   found = true;
 if (!found)
   {
     if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
	 "Making bb %i impossible and dropping count to 0.\n",
	 e->src->index);
     e->src->count = profile_count::zero ();
     FOR_EACH_EDGE (e2, ei, e->src->preds)for ((ei) = ei_start_1 (&((e->src->preds))); ei_cond
 ((ei), &(e2)); ei_next (&(ei)))
force_edge_cold (e2, impossible);
     return;
   }
}

    /* If we did not adjusting, the source basic block has no likely edeges
 leaving other direction. In that case force that bb cold, too.
This in general is difficult task to do, but handle special case when
BB has only one predecestor.  This is common case when we are updating
after loop transforms.  */
    if (!(prob_sum > profile_probability::never ())
 && count_sum == profile_count::zero ()
 && single_pred_p (e->src) && e->src->count.to_frequency (cfun(cfun + 0))
    > (impossible ? 0 : 1))
{
 int old_frequency = e->src->count.to_frequency (cfun(cfun + 0));
 if (dump_file && (dump_flags & TDF_DETAILS))
   fprintf (dump_file, "Making bb %i %s.\n", e->src->index,
     impossible ? "impossible" : "cold");
 int new_frequency = MIN (e->src->count.to_frequency (cfun),((e->src->count.to_frequency ((cfun + 0))) < (impossible
 ? 0 : 1) ? (e->src->count.to_frequency ((cfun + 0))) :
 (impossible ? 0 : 1))
		   impossible ? 0 : 1)((e->src->count.to_frequency ((cfun + 0))) < (impossible
 ? 0 : 1) ? (e->src->count.to_frequency ((cfun + 0))) :
 (impossible ? 0 : 1));
 if (impossible)
   e->src->count = profile_count::zero ();
 else
   e->src->count = e->count ().apply_scale (new_frequency,
				     old_frequency);
 force_edge_cold (single_pred_edge (e->src), impossible);
}
    else if (dump_file && (dump_flags & TDF_DETAILS)
      && maybe_hot_bb_p (cfun(cfun + 0), e->src))
fprintf (dump_file, "Giving up on making bb %i %s.\n", e->src->index,
 impossible ? "impossible" : "cold");
  }
4498}

4500/* Change E's probability to NEW_E_PROB, redistributing the probabilities
 of other outgoing edges proportionally.

 Note that this function does not change the profile counts of any
 basic blocks.  The caller must do that instead, using whatever
 information it has about the region that needs updating.  */

4507void
4508change_edge_frequency (edge e, profile_probability new_e_prob)
4509{
profile_probability old_e_prob = e->probability;
profile_probability old_other_prob = old_e_prob.invert ();
profile_probability new_other_prob = new_e_prob.invert ();

e->probability = new_e_prob;
profile_probability cumulative_prob = new_e_prob;

unsigned int num_other = EDGE_COUNT (e->src->succs)vec_safe_length (e->src->succs) - 1;
edge other_e;
edge_iterator ei;
FOR_EACH_EDGE (other_e, ei, e->src->succs)for ((ei) = ei_start_1 (&((e->src->succs))); ei_cond
 ((ei), &(other_e)); ei_next (&(ei)))
  if (other_e != e)
    {
num_other -= 1;
if (num_other == 0)
 /* Ensure that the probabilities add up to 1 without
    rounding error.  */
 other_e->probability = cumulative_prob.invert ();
else
 {
   other_e->probability /= old_other_prob;
   other_e->probability *= new_other_prob;
   cumulative_prob += other_e->probability;
 }
    }
4535}

4537#if CHECKING_P1

4539namespace selftest {

4541/* Test that value range of predictor values defined in predict.def is
 within range (50, 100].  */

4544struct branch_predictor
4545{
const char *name;
int probability;
4548};

4550#define DEF_PREDICTOR(ENUM, NAME, HITRATE, FLAGS) { NAME, HITRATE },

4552static void
4553test_prediction_value_range ()
4554{
branch_predictor predictors[] = {
4556#include "predict.def"
  { NULLnullptr, PROB_UNINITIALIZED(-1) }
};

for (unsigned i = 0; predictors[i].name != NULLnullptr; i++)
  {
    if (predictors[i].probability == PROB_UNINITIALIZED(-1))
continue;

    unsigned p = 100 * predictors[i].probability / REG_BR_PROB_BASE10000;
    ASSERT_TRUE (p >= 50 && p <= 100)do { const char *desc_ = "ASSERT_TRUE (" "(p >= 50 && p <= 100)"
 ")"; bool actual_ = ((p >= 50 && p <= 100)); if
 (actual_) ::selftest::pass (((::selftest::location ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 4566, __FUNCTION__))), desc_); else ::selftest::fail (((::selftest
::location ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/predict.cc"
, 4566, __FUNCTION__))), desc_); } while (0);
  }
4568}

4570#undef DEF_PREDICTOR

4572/* Run all of the selfests within this file.  */

4574void
4575predict_cc_tests ()
4576{
test_prediction_value_range ();
4578}

4580} // namespace selftest
4581#endif /* CHECKING_P.  */

←

/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/basic-block.h

1/* Define control flow data structures for the CFG.
2   Copyright (C) 1987-2023 Free Software Foundation, Inc.
3 
4This file is part of GCC.
5 
6GCC is free software; you can redistribute it and/or modify it under
7the terms of the GNU General Public License as published by the Free
8Software Foundation; either version 3, or (at your option) any later
9version.
10 
11GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12WARRANTY; without even the implied warranty of MERCHANTABILITY or
13FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
14for more details.
15 
16You should have received a copy of the GNU General Public License
17along with GCC; see the file COPYING3.  If not see
18<http://www.gnu.org/licenses/>.  */
19 
20#ifndef GCC_BASIC_BLOCK_H
21#define GCC_BASIC_BLOCK_H
22 
23#include <profile-count.h>
24 
25/* Control flow edge information.  */
26class GTY((user)) edge_def {
27public:
28  /* The two blocks at the ends of the edge.  */
29  basic_block src;
30  basic_block dest;
31 
32  /* Instructions queued on the edge.  */
33  union edge_def_insns {
34    gimple_seq g;
35    rtx_insn *r;
36  } insns;
37 
38  /* Auxiliary info specific to a pass.  */
39  void *aux;
40 
41  /* Location of any goto implicit in the edge.  */
42  location_t goto_locus;
43 
44  /* The index number corresponding to this edge in the edge vector
45     dest->preds.  */
46  unsigned int dest_idx;
47 
48  int flags;			/* see cfg-flags.def */
49  profile_probability probability;
50 
51  /* Return count of edge E.  */
52  inline profile_count count () const;
53};
54 
55/* Masks for edge.flags.  */
56#define DEF_EDGE_FLAG(NAME,IDX) EDGE_##NAME = 1 << IDX ,
57enum cfg_edge_flags {
58#include "cfg-flags.def"
59  LAST_CFG_EDGE_FLAG		/* this is only used for EDGE_ALL_FLAGS */
60};
61#undef DEF_EDGE_FLAG
62 
63/* Bit mask for all edge flags.  */
64#define EDGE_ALL_FLAGS((LAST_CFG_EDGE_FLAG - 1) * 2 - 1)		((LAST_CFG_EDGE_FLAG - 1) * 2 - 1)
65 
66/* The following four flags all indicate something special about an edge.
67   Test the edge flags on EDGE_COMPLEX to detect all forms of "strange"
68   control flow transfers.  */
69#define EDGE_COMPLEX(EDGE_ABNORMAL | EDGE_ABNORMAL_CALL | EDGE_EH | EDGE_PRESERVE
) \
70  (EDGE_ABNORMAL | EDGE_ABNORMAL_CALL | EDGE_EH | EDGE_PRESERVE)
71 
72struct GTY(()) rtl_bb_info {
73  /* The first insn of the block is embedded into bb->il.x.  */
74  /* The last insn of the block.  */
75  rtx_insn *end_;
76 
77  /* In CFGlayout mode points to insn notes/jumptables to be placed just before
78     and after the block.   */
79  rtx_insn *header_;
80  rtx_insn *footer_;
81};
82 
83struct GTY(()) gimple_bb_info {
84  /* Sequence of statements in this block.  */
85  gimple_seq seq;
86 
87  /* PHI nodes for this block.  */
88  gimple_seq phi_nodes;
89};
90 
91/* A basic block is a sequence of instructions with only one entry and
92   only one exit.  If any one of the instructions are executed, they
93   will all be executed, and in sequence from first to last.
94 
95   There may be COND_EXEC instructions in the basic block.  The
96   COND_EXEC *instructions* will be executed -- but if the condition
97   is false the conditionally executed *expressions* will of course
98   not be executed.  We don't consider the conditionally executed
99   expression (which might have side-effects) to be in a separate
100   basic block because the program counter will always be at the same
101   location after the COND_EXEC instruction, regardless of whether the
102   condition is true or not.
103 
104   Basic blocks need not start with a label nor end with a jump insn.
105   For example, a previous basic block may just "conditionally fall"
106   into the succeeding basic block, and the last basic block need not
107   end with a jump insn.  Block 0 is a descendant of the entry block.
108 
109   A basic block beginning with two labels cannot have notes between
110   the labels.
111 
112   Data for jump tables are stored in jump_insns that occur in no
113   basic block even though these insns can follow or precede insns in
114   basic blocks.  */
115 
116/* Basic block information indexed by block number.  */
117struct GTY((chain_next ("%h.next_bb"), chain_prev ("%h.prev_bb"))) basic_block_def {
118  /* The edges into and out of the block.  */
119  vec<edge, va_gc> *preds;
120  vec<edge, va_gc> *succs;
121 
122  /* Auxiliary info specific to a pass.  */
123  void *GTY ((skip (""))) aux;
124 
125  /* Innermost loop containing the block.  */
126  class loop *loop_father;
127 
128  /* The dominance and postdominance information node.  */
129  struct et_node * GTY ((skip (""))) dom[2];
130 
131  /* Previous and next blocks in the chain.  */
132  basic_block prev_bb;
133  basic_block next_bb;
134 
135  union basic_block_il_dependent {
136      struct gimple_bb_info GTY ((tag ("0"))) gimple;
137      struct {
138        rtx_insn *head_;
139        struct rtl_bb_info * rtl;
140      } GTY ((tag ("1"))) x;
141    } GTY ((desc ("((%1.flags & BB_RTL) != 0)"))) il;
142 
143  /* Various flags.  See cfg-flags.def.  */
144  int flags;
145 
146  /* The index of this block.  */
147  int index;
148 
149  /* Expected number of executions: calculated in profile.cc.  */
150  profile_count count;
151};
152 
153/* This ensures that struct gimple_bb_info is smaller than
154   struct rtl_bb_info, so that inlining the former into basic_block_def
155   is the better choice.  */
156STATIC_ASSERT (sizeof (rtl_bb_info) >= sizeof (gimple_bb_info))static_assert ((sizeof (rtl_bb_info) >= sizeof (gimple_bb_info
)), "sizeof (rtl_bb_info) >= sizeof (gimple_bb_info)");
157 
158#define BB_FREQ_MAX10000 10000
159 
160/* Masks for basic_block.flags.  */
161#define DEF_BASIC_BLOCK_FLAG(NAME,IDX) BB_##NAME = 1 << IDX ,
162enum cfg_bb_flags
163{
164#include "cfg-flags.def"
165  LAST_CFG_BB_FLAG		/* this is only used for BB_ALL_FLAGS */
166};
167#undef DEF_BASIC_BLOCK_FLAG
168 
169/* Bit mask for all basic block flags.  */
170#define BB_ALL_FLAGS((LAST_CFG_BB_FLAG - 1) * 2 - 1)		((LAST_CFG_BB_FLAG - 1) * 2 - 1)
171 
172/* Bit mask for all basic block flags that must be preserved.  These are
173   the bit masks that are *not* cleared by clear_bb_flags.  */
174#define BB_FLAGS_TO_PRESERVE(BB_DISABLE_SCHEDULE | BB_RTL | BB_NON_LOCAL_GOTO_TARGET | BB_HOT_PARTITION
 | BB_COLD_PARTITION)					\
175  (BB_DISABLE_SCHEDULE | BB_RTL | BB_NON_LOCAL_GOTO_TARGET	\
176   | BB_HOT_PARTITION | BB_COLD_PARTITION)
177 
178/* Dummy bitmask for convenience in the hot/cold partitioning code.  */
179#define BB_UNPARTITIONED0	0
180 
181/* Partitions, to be used when partitioning hot and cold basic blocks into
182   separate sections.  */
183#define BB_PARTITION(bb)((bb)->flags & (BB_HOT_PARTITION|BB_COLD_PARTITION)) ((bb)->flags & (BB_HOT_PARTITION|BB_COLD_PARTITION))
184#define BB_SET_PARTITION(bb, part)do { basic_block bb_ = (bb); bb_->flags = ((bb_->flags &
 ~(BB_HOT_PARTITION|BB_COLD_PARTITION)) | (part)); } while (0
) do {					\
185  basic_block bb_ = (bb);						\
186  bb_->flags = ((bb_->flags & ~(BB_HOT_PARTITION|BB_COLD_PARTITION))	\
187		| (part));						\
188} while (0)
189 
190#define BB_COPY_PARTITION(dstbb, srcbb)do { basic_block bb_ = (dstbb); bb_->flags = ((bb_->flags
 & ~(BB_HOT_PARTITION|BB_COLD_PARTITION)) | (((srcbb)->
flags & (BB_HOT_PARTITION|BB_COLD_PARTITION)))); } while (
0) \
191  BB_SET_PARTITION (dstbb, BB_PARTITION (srcbb))do { basic_block bb_ = (dstbb); bb_->flags = ((bb_->flags
 & ~(BB_HOT_PARTITION|BB_COLD_PARTITION)) | (((srcbb)->
flags & (BB_HOT_PARTITION|BB_COLD_PARTITION)))); } while (
0)
192 
193/* Defines for accessing the fields of the CFG structure for function FN.  */
194#define ENTRY_BLOCK_PTR_FOR_FN(FN)((FN)->cfg->x_entry_block_ptr)	     ((FN)->cfg->x_entry_block_ptr)
195#define EXIT_BLOCK_PTR_FOR_FN(FN)((FN)->cfg->x_exit_block_ptr)	     ((FN)->cfg->x_exit_block_ptr)
196#define basic_block_info_for_fn(FN)((FN)->cfg->x_basic_block_info)	     ((FN)->cfg->x_basic_block_info)
197#define n_basic_blocks_for_fn(FN)((FN)->cfg->x_n_basic_blocks)	     ((FN)->cfg->x_n_basic_blocks)
198#define n_edges_for_fn(FN)((FN)->cfg->x_n_edges)		     ((FN)->cfg->x_n_edges)
199#define last_basic_block_for_fn(FN)((FN)->cfg->x_last_basic_block)	     ((FN)->cfg->x_last_basic_block)
200#define label_to_block_map_for_fn(FN)((FN)->cfg->x_label_to_block_map)	     ((FN)->cfg->x_label_to_block_map)
201#define profile_status_for_fn(FN)((FN)->cfg->x_profile_status)	     ((FN)->cfg->x_profile_status)
202 
203#define BASIC_BLOCK_FOR_FN(FN,N)((*((FN)->cfg->x_basic_block_info))[(N)]) \
204  ((*basic_block_info_for_fn (FN)((FN)->cfg->x_basic_block_info))[(N)])
205#define SET_BASIC_BLOCK_FOR_FN(FN,N,BB)((*((FN)->cfg->x_basic_block_info))[(N)] = (BB)) \
206  ((*basic_block_info_for_fn (FN)((FN)->cfg->x_basic_block_info))[(N)] = (BB))
207 
208/* For iterating over basic blocks.  */
209#define FOR_BB_BETWEEN(BB, FROM, TO, DIR)for (BB = FROM; BB != TO; BB = BB->DIR) \
210  for (BB = FROM; BB != TO; BB = BB->DIR)
211 
212#define FOR_EACH_BB_FN(BB, FN)for (BB = (FN)->cfg->x_entry_block_ptr->next_bb; BB !=
 (FN)->cfg->x_exit_block_ptr; BB = BB->next_bb) \
213  FOR_BB_BETWEEN (BB, (FN)->cfg->x_entry_block_ptr->next_bb, (FN)->cfg->x_exit_block_ptr, next_bb)for (BB = (FN)->cfg->x_entry_block_ptr->next_bb; BB !=
 (FN)->cfg->x_exit_block_ptr; BB = BB->next_bb)
214 
215#define FOR_EACH_BB_REVERSE_FN(BB, FN)for (BB = (FN)->cfg->x_exit_block_ptr->prev_bb; BB !=
 (FN)->cfg->x_entry_block_ptr; BB = BB->prev_bb) \
216  FOR_BB_BETWEEN (BB, (FN)->cfg->x_exit_block_ptr->prev_bb, (FN)->cfg->x_entry_block_ptr, prev_bb)for (BB = (FN)->cfg->x_exit_block_ptr->prev_bb; BB !=
 (FN)->cfg->x_entry_block_ptr; BB = BB->prev_bb)
217 
218/* For iterating over insns in basic block.  */
219#define FOR_BB_INSNS(BB, INSN)for ((INSN) = (BB)->il.x.head_; (INSN) && (INSN) !=
 NEXT_INSN ((BB)->il.x.rtl->end_); (INSN) = NEXT_INSN (
INSN))			\
220  for ((INSN) = BB_HEAD (BB)(BB)->il.x.head_;			\
221       (INSN) && (INSN) != NEXT_INSN (BB_END (BB)(BB)->il.x.rtl->end_);	\
222       (INSN) = NEXT_INSN (INSN))
223 
224/* For iterating over insns in basic block when we might remove the
225   current insn.  */
226#define FOR_BB_INSNS_SAFE(BB, INSN, CURR)for ((INSN) = (BB)->il.x.head_, (CURR) = (INSN) ? NEXT_INSN
 ((INSN)): nullptr; (INSN) && (INSN) != NEXT_INSN ((BB
)->il.x.rtl->end_); (INSN) = (CURR), (CURR) = (INSN) ? NEXT_INSN
 ((INSN)) : nullptr)			\
227  for ((INSN) = BB_HEAD (BB)(BB)->il.x.head_, (CURR) = (INSN) ? NEXT_INSN ((INSN)): NULLnullptr;	\
228       (INSN) && (INSN) != NEXT_INSN (BB_END (BB)(BB)->il.x.rtl->end_);	\
229       (INSN) = (CURR), (CURR) = (INSN) ? NEXT_INSN ((INSN)) : NULLnullptr)
230 
231#define FOR_BB_INSNS_REVERSE(BB, INSN)for ((INSN) = (BB)->il.x.rtl->end_; (INSN) && (
INSN) != PREV_INSN ((BB)->il.x.head_); (INSN) = PREV_INSN (
INSN))		\
232  for ((INSN) = BB_END (BB)(BB)->il.x.rtl->end_;			\
233       (INSN) && (INSN) != PREV_INSN (BB_HEAD (BB)(BB)->il.x.head_);	\
234       (INSN) = PREV_INSN (INSN))
235 
236#define FOR_BB_INSNS_REVERSE_SAFE(BB, INSN, CURR)for ((INSN) = (BB)->il.x.rtl->end_,(CURR) = (INSN) ? PREV_INSN
 ((INSN)) : nullptr; (INSN) && (INSN) != PREV_INSN ((
BB)->il.x.head_); (INSN) = (CURR), (CURR) = (INSN) ? PREV_INSN
 ((INSN)) : nullptr)	\
237  for ((INSN) = BB_END (BB)(BB)->il.x.rtl->end_,(CURR) = (INSN) ? PREV_INSN ((INSN)) : NULLnullptr;	\
238       (INSN) && (INSN) != PREV_INSN (BB_HEAD (BB)(BB)->il.x.head_);	\
239       (INSN) = (CURR), (CURR) = (INSN) ? PREV_INSN ((INSN)) : NULLnullptr)
240 
241/* Cycles through _all_ basic blocks, even the fake ones (entry and
242   exit block).  */
243 
244#define FOR_ALL_BB_FN(BB, FN)for (BB = ((FN)->cfg->x_entry_block_ptr); BB; BB = BB->
next_bb) \
245  for (BB = ENTRY_BLOCK_PTR_FOR_FN (FN)((FN)->cfg->x_entry_block_ptr); BB; BB = BB->next_bb)
246 
247
248/* Stuff for recording basic block info.  */
249 
250/* For now, these will be functions (so that they can include checked casts
251   to rtx_insn.   Once the underlying fields are converted from rtx
252   to rtx_insn, these can be converted back to macros.  */
253 
254#define BB_HEAD(B)(B)->il.x.head_      (B)->il.x.head_
255#define BB_END(B)(B)->il.x.rtl->end_       (B)->il.x.rtl->end_
256#define BB_HEADER(B)(B)->il.x.rtl->header_    (B)->il.x.rtl->header_
257#define BB_FOOTER(B)(B)->il.x.rtl->footer_    (B)->il.x.rtl->footer_
258 
259/* Special block numbers [markers] for entry and exit.
260   Neither of them is supposed to hold actual statements.  */
261#define ENTRY_BLOCK(0) (0)
262#define EXIT_BLOCK(1) (1)
263 
264/* The two blocks that are always in the cfg.  */
265#define NUM_FIXED_BLOCKS(2) (2)
266 
267/* This is the value which indicates no edge is present.  */
268#define EDGE_INDEX_NO_EDGE-1	-1
269 
270/* EDGE_INDEX returns an integer index for an edge, or EDGE_INDEX_NO_EDGE
271   if there is no edge between the 2 basic blocks.  */
272#define EDGE_INDEX(el, pred, succ)(find_edge_index ((el), (pred), (succ))) (find_edge_index ((el), (pred), (succ)))
273 
274/* INDEX_EDGE_PRED_BB and INDEX_EDGE_SUCC_BB return a pointer to the basic
275   block which is either the pred or succ end of the indexed edge.  */
276#define INDEX_EDGE_PRED_BB(el, index)((el)->index_to_edge[(index)]->src)	((el)->index_to_edge[(index)]->src)
277#define INDEX_EDGE_SUCC_BB(el, index)((el)->index_to_edge[(index)]->dest)	((el)->index_to_edge[(index)]->dest)
278 
279/* INDEX_EDGE returns a pointer to the edge.  */
280#define INDEX_EDGE(el, index)((el)->index_to_edge[(index)])           ((el)->index_to_edge[(index)])
281 
282/* Number of edges in the compressed edge list.  */
283#define NUM_EDGES(el)((el)->num_edges)			((el)->num_edges)
284 
285/* BB is assumed to contain conditional jump.  Return the fallthru edge.  */
286#define FALLTHRU_EDGE(bb)((*((bb))->succs)[(0)]->flags & EDGE_FALLTHRU ? (*(
(bb))->succs)[(0)] : (*((bb))->succs)[(1)])		(EDGE_SUCC ((bb), 0)(*((bb))->succs)[(0)]->flags & EDGE_FALLTHRU \
287					 ? EDGE_SUCC ((bb), 0)(*((bb))->succs)[(0)] : EDGE_SUCC ((bb), 1)(*((bb))->succs)[(1)])
288 
289/* BB is assumed to contain conditional jump.  Return the branch edge.  */
290#define BRANCH_EDGE(bb)((*((bb))->succs)[(0)]->flags & EDGE_FALLTHRU ? (*(
(bb))->succs)[(1)] : (*((bb))->succs)[(0)])			(EDGE_SUCC ((bb), 0)(*((bb))->succs)[(0)]->flags & EDGE_FALLTHRU \
291					 ? EDGE_SUCC ((bb), 1)(*((bb))->succs)[(1)] : EDGE_SUCC ((bb), 0)(*((bb))->succs)[(0)])
292 
293/* Return expected execution frequency of the edge E.  */
294#define EDGE_FREQUENCY(e)e->count ().to_frequency ((cfun + 0))		e->count ().to_frequency (cfun(cfun + 0))
295 
296/* Compute a scale factor (or probability) suitable for scaling of
297   gcov_type values via apply_probability() and apply_scale().  */
298#define GCOV_COMPUTE_SCALE(num,den)((den) ? ((((num) * 10000) + ((den)) / 2) / ((den))) : 10000) \
299  ((den) ? RDIV ((num) * REG_BR_PROB_BASE, (den))((((num) * 10000) + ((den)) / 2) / ((den))) : REG_BR_PROB_BASE10000)
300 
301/* Return nonzero if edge is critical.  */
302#define EDGE_CRITICAL_P(e)(vec_safe_length ((e)->src->succs) >= 2 && vec_safe_length
 ((e)->dest->preds) >= 2)		(EDGE_COUNT ((e)->src->succs)vec_safe_length ((e)->src->succs) >= 2 \
303					 && EDGE_COUNT ((e)->dest->preds)vec_safe_length ((e)->dest->preds) >= 2)
304 
305#define EDGE_COUNT(ev)vec_safe_length (ev)			vec_safe_length (ev)
306#define EDGE_I(ev,i)(*ev)[(i)]			(*ev)[(i)]
307#define EDGE_PRED(bb,i)(*(bb)->preds)[(i)]			(*(bb)->preds)[(i)]
308#define EDGE_SUCC(bb,i)(*(bb)->succs)[(i)]			(*(bb)->succs)[(i)]
309 
310/* Returns true if BB has precisely one successor.  */
311 
312inline bool
313single_succ_p (const_basic_block bb)
314{
315  return EDGE_COUNT (bb->succs)vec_safe_length (bb->succs) == 1;
316}
317 
318/* Returns true if BB has precisely one predecessor.  */
319 
320inline bool
321single_pred_p (const_basic_block bb)
322{
323  return EDGE_COUNT (bb->preds)vec_safe_length (bb->preds) == 1;
324}
325 
326/* Returns the single successor edge of basic block BB.  Aborts if
327   BB does not have exactly one successor.  */
328 
329inline edge
330single_succ_edge (const_basic_block bb)
331{
332  gcc_checking_assert (single_succ_p (bb))((void)(!(single_succ_p (bb)) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/basic-block.h"
, 332, __FUNCTION__), 0 : 0));
333  return EDGE_SUCC (bb, 0)(*(bb)->succs)[(0)];
334}
335 
336/* Returns the single predecessor edge of basic block BB.  Aborts
337   if BB does not have exactly one predecessor.  */
338 
339inline edge
340single_pred_edge (const_basic_block bb)
341{
342  gcc_checking_assert (single_pred_p (bb))((void)(!(single_pred_p (bb)) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/basic-block.h"
, 342, __FUNCTION__), 0 : 0));
343  return EDGE_PRED (bb, 0)(*(bb)->preds)[(0)];
344}
345 
346/* Returns the single successor block of basic block BB.  Aborts
347   if BB does not have exactly one successor.  */
348 
349inline basic_block
350single_succ (const_basic_block bb)
351{
352  return single_succ_edge (bb)->dest;
353}
354 
355/* Returns the single predecessor block of basic block BB.  Aborts
356   if BB does not have exactly one predecessor.*/
357 
358inline basic_block
359single_pred (const_basic_block bb)
360{
361  return single_pred_edge (bb)->src;
362}
363 
364/* Iterator object for edges.  */
365 
366struct edge_iterator {
367  unsigned index;
368  vec<edge, va_gc> **container;
369};
370 
371inline vec<edge, va_gc> *
372ei_container (edge_iterator i)
373{
374  gcc_checking_assert (i.container)((void)(!(i.container) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/basic-block.h"
, 374, __FUNCTION__), 0 : 0));
375  return *i.container;
376}
377 
378#define ei_start(iter)ei_start_1 (&(iter)) ei_start_1 (&(iter))
379#define ei_last(iter)ei_last_1 (&(iter)) ei_last_1 (&(iter))
380 
381/* Return an iterator pointing to the start of an edge vector.  */
382inline edge_iterator
383ei_start_1 (vec<edge, va_gc> **ev)
384{
385  edge_iterator i;
386 
387  i.index = 0;
388  i.container = ev;
389 
390  return i;
391}
392 
393/* Return an iterator pointing to the last element of an edge
394   vector.  */
395inline edge_iterator
396ei_last_1 (vec<edge, va_gc> **ev)
397{
398  edge_iterator i;
399 
400  i.index = EDGE_COUNT (*ev)vec_safe_length (*ev) - 1;
401  i.container = ev;
402 
403  return i;
404}
405 
406/* Is the iterator `i' at the end of the sequence?  */
407inline bool
408ei_end_p (edge_iterator i)
409{
410  return (i.index == EDGE_COUNT (ei_container (i))vec_safe_length (ei_container (i)));
411}
412 
413/* Is the iterator `i' at one position before the end of the
414   sequence?  */
415inline bool
416ei_one_before_end_p (edge_iterator i)
417{
418  return (i.index + 1 == EDGE_COUNT (ei_container (i))vec_safe_length (ei_container (i)));
419}
420 
421/* Advance the iterator to the next element.  */
422inline void
423ei_next (edge_iterator *i)
424{
425  gcc_checking_assert (i->index < EDGE_COUNT (ei_container (*i)))((void)(!(i->index < vec_safe_length (ei_container (*i)
)) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/basic-block.h"
, 425, __FUNCTION__), 0 : 0));
426  i->index++;
427}
428 
429/* Move the iterator to the previous element.  */
430inline void
431ei_prev (edge_iterator *i)
432{
433  gcc_checking_assert (i->index > 0)((void)(!(i->index > 0) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/basic-block.h"
, 433, __FUNCTION__), 0 : 0));
434  i->index--;
435}
436 
437/* Return the edge pointed to by the iterator `i'.  */
438inline edge
439ei_edge (edge_iterator i)
440{
441  return EDGE_I (ei_container (i), i.index)(*ei_container (i))[(i.index)];
442}
443 
444/* Return an edge pointed to by the iterator.  Do it safely so that
445   NULL is returned when the iterator is pointing at the end of the
446   sequence.  */
447inline edge
448ei_safe_edge (edge_iterator i)
449{
450  return !ei_end_p (i) ? ei_edge (i) : NULLnullptr;
451}
452 
453/* Return 1 if we should continue to iterate.  Return 0 otherwise.
454   *Edge P is set to the next edge if we are to continue to iterate
455   and NULL otherwise.  */
456 
457inline bool
458ei_cond (edge_iterator ei, edge *p)
459{
460  if (!ei_end_p (ei))
12
←
Taking false branch→
461    {
462      *p = ei_edge (ei);
463      return 1;
464    }
465  else
466    {
467      *p = NULLnullptr;
13
←
Null pointer value stored to 'e'→
468      return 0;
469    }
470}
471 
472/* This macro serves as a convenient way to iterate each edge in a
473   vector of predecessor or successor edges.  It must not be used when
474   an element might be removed during the traversal, otherwise
475   elements will be missed.  Instead, use a for-loop like that shown
476   in the following pseudo-code:
477 
478   FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
479     {
480	IF (e != taken_edge)
481	  remove_edge (e);
482	ELSE
483	  ei_next (&ei);
484     }
485*/
486 
487#define FOR_EACH_EDGE(EDGE,ITER,EDGE_VEC)for ((ITER) = ei_start_1 (&((EDGE_VEC))); ei_cond ((ITER)
, &(EDGE)); ei_next (&(ITER)))	\
488  for ((ITER) = ei_start ((EDGE_VEC))ei_start_1 (&((EDGE_VEC)));		\
489       ei_cond ((ITER), &(EDGE));		\
490       ei_next (&(ITER)))
491 
492#define CLEANUP_EXPENSIVE1	1	/* Do relatively expensive optimizations
493					   except for edge forwarding */
494#define CLEANUP_CROSSJUMP2	2	/* Do crossjumping.  */
495#define CLEANUP_POST_REGSTACK4	4	/* We run after reg-stack and need
496					   to care REG_DEAD notes.  */
497#define CLEANUP_THREADING8	8	/* Do jump threading.  */
498#define CLEANUP_NO_INSN_DEL16	16	/* Do not try to delete trivially dead
499					   insns.  */
500#define CLEANUP_CFGLAYOUT32	32	/* Do cleanup in cfglayout mode.  */
501#define CLEANUP_CFG_CHANGED64	64      /* The caller changed the CFG.  */
502#define CLEANUP_NO_PARTITIONING128	128     /* Do not try to fix partitions.  */
503#define CLEANUP_FORCE_FAST_DCE0x100	0x100	/* Force run_fast_dce to be called
504					   at least once.  */
505 
506/* Return true if BB is in a transaction.  */
507 
508inline bool
509bb_in_transaction (basic_block bb)
510{
511  return bb->flags & BB_IN_TRANSACTION;
512}
513 
514/* Return true when one of the predecessor edges of BB is marked with EDGE_EH.  */
515inline bool
516bb_has_eh_pred (basic_block bb)
517{
518  edge e;
519  edge_iterator ei;
520 
521  FOR_EACH_EDGE (e, ei, bb->preds)for ((ei) = ei_start_1 (&((bb->preds))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
522    {
523      if (e->flags & EDGE_EH)
524	return true;
525    }
526  return false;
527}
528 
529/* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL.  */
530inline bool
531bb_has_abnormal_pred (basic_block bb)
532{
533  edge e;
534  edge_iterator ei;
535 
536  FOR_EACH_EDGE (e, ei, bb->preds)for ((ei) = ei_start_1 (&((bb->preds))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
537    {
538      if (e->flags & EDGE_ABNORMAL)
539	return true;
540    }
541  return false;
542}
543 
544/* Return the fallthru edge in EDGES if it exists, NULL otherwise.  */
545inline edge
546find_fallthru_edge (vec<edge, va_gc> *edges)
547{
548  edge e;
549  edge_iterator ei;
550 
551  FOR_EACH_EDGE (e, ei, edges)for ((ei) = ei_start_1 (&((edges))); ei_cond ((ei), &
(e)); ei_next (&(ei)))
552    if (e->flags & EDGE_FALLTHRU)
553      break;
554 
555  return e;
556}
557 
558/* Check tha probability is sane.  */
559 
560inline void
561check_probability (int prob)
562{
563  gcc_checking_assert (prob >= 0 && prob <= REG_BR_PROB_BASE)((void)(!(prob >= 0 && prob <= 10000) ? fancy_abort
 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/basic-block.h"
, 563, __FUNCTION__), 0 : 0));
564}
565 
566/* Given PROB1 and PROB2, return PROB1*PROB2/REG_BR_PROB_BASE. 
567   Used to combine BB probabilities.  */
568 
569inline int
570combine_probabilities (int prob1, int prob2)
571{
572  check_probability (prob1);
573  check_probability (prob2);
574  return RDIV (prob1 * prob2, REG_BR_PROB_BASE)(((prob1 * prob2) + (10000) / 2) / (10000));
575}
576 
577/* Apply scale factor SCALE on frequency or count FREQ. Use this
578   interface when potentially scaling up, so that SCALE is not
579   constrained to be < REG_BR_PROB_BASE.  */
580 
581inline gcov_type
582apply_scale (gcov_type freq, gcov_type scale)
583{
584  return RDIV (freq * scale, REG_BR_PROB_BASE)(((freq * scale) + (10000) / 2) / (10000));
585}
586 
587/* Apply probability PROB on frequency or count FREQ.  */
588 
589inline gcov_type
590apply_probability (gcov_type freq, int prob)
591{
592  check_probability (prob);
593  return apply_scale (freq, prob);
594}
595 
596/* Return inverse probability for PROB.  */
597 
598inline int
599inverse_probability (int prob1)
600{
601  check_probability (prob1);
602  return REG_BR_PROB_BASE10000 - prob1;
603}
604 
605/* Return true if BB has at least one abnormal outgoing edge.  */
606 
607inline bool
608has_abnormal_or_eh_outgoing_edge_p (basic_block bb)
609{
610  edge e;
611  edge_iterator ei;
612 
613  FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
614    if (e->flags & (EDGE_ABNORMAL | EDGE_EH))
615      return true;
616 
617  return false;
618}
619 
620/* Return true when one of the predecessor edges of BB is marked with
621   EDGE_ABNORMAL_CALL or EDGE_EH.  */
622 
623inline bool
624has_abnormal_call_or_eh_pred_edge_p (basic_block bb)
625{
626  edge e;
627  edge_iterator ei;
628 
629  FOR_EACH_EDGE (e, ei, bb->preds)for ((ei) = ei_start_1 (&((bb->preds))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
630    if (e->flags & (EDGE_ABNORMAL_CALL | EDGE_EH))
631      return true;
632 
633  return false;
634}
635 
636/* Return count of edge E.  */
637inline profile_count edge_def::count () const
638{
639  return src->count.apply_probability (probability);
640}
641 
642#endif /* GCC_BASIC_BLOCK_H */