/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/symbol-summary.h

Bug Summary

File:	build/gcc/symbol-summary.h
Warning:	line 701, column 35 Called C++ object pointer is null

Annotated Source Code

Press '?' to see keyboard shortcuts

Show analyzer invocation

clang -cc1 -cc1 -triple x86_64-unknown-linux-gnu -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name ipa-profile.c -analyzer-store=region -analyzer-opt-analyze-nested-blocks -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 -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -fno-split-dwarf-inlining -debugger-tuning=gdb -resource-dir /usr/lib64/clang/11.0.0 -D IN_GCC -D HAVE_CONFIG_H -I . -I . -I /home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc -I /home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/. -I /home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../include -I /home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../libcpp/include -I /home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../libcody -I /home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../libdecnumber -I /home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../libdecnumber/bid -I ../libdecnumber -I /home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../libbacktrace -internal-isystem /usr/bin/../lib64/gcc/x86_64-suse-linux/10/../../../../include/c++/10 -internal-isystem /usr/bin/../lib64/gcc/x86_64-suse-linux/10/../../../../include/c++/10/x86_64-suse-linux -internal-isystem /usr/bin/../lib64/gcc/x86_64-suse-linux/10/../../../../include/c++/10/backward -internal-isystem /usr/local/include -internal-isystem /usr/lib64/clang/11.0.0/include -internal-externc-isystem /include -internal-externc-isystem /usr/include -O2 -Wno-narrowing -Wwrite-strings -Wno-error=format-diag -Wno-long-long -Wno-variadic-macros -Wno-overlength-strings -fdeprecated-macro -fdebug-compilation-dir /home/marxin/BIG/buildbot/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 -o /home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/objdir/clang-static-analyzer/2021-01-16-135054-17580-1/report-rYW302.plist -x c++ /home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c

/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c

→

1/* Basic IPA optimizations based on profile.
 Copyright (C) 2003-2021 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/* ipa-profile pass implements the following analysis propagating profille
 inter-procedurally.

 - Count histogram construction.  This is a histogram analyzing how much
   time is spent executing statements with a given execution count read
   from profile feedback. This histogram is complete only with LTO,
   otherwise it contains information only about the current unit.

   The information is used to set hot/cold thresholds.
 - Next speculative indirect call resolution is performed:  the local
   profile pass assigns profile-id to each function and provide us with a
   histogram specifying the most common target.  We look up the callgraph
   node corresponding to the target and produce a speculative call.

   This call may or may not survive through IPA optimization based on decision
   of inliner. 
 - Finally we propagate the following flags: unlikely executed, executed
   once, executed at startup and executed at exit.  These flags are used to
   control code size/performance threshold and code placement (by producing
   .text.unlikely/.text.hot/.text.startup/.text.exit subsections).  */
40#include "config.h"
41#include "system.h"
42#include "coretypes.h"
43#include "backend.h"
44#include "tree.h"
45#include "gimple.h"
46#include "predict.h"
47#include "alloc-pool.h"
48#include "tree-pass.h"
49#include "cgraph.h"
50#include "data-streamer.h"
51#include "gimple-iterator.h"
52#include "ipa-utils.h"
53#include "profile.h"
54#include "value-prof.h"
55#include "tree-inline.h"
56#include "symbol-summary.h"
57#include "tree-vrp.h"
58#include "ipa-prop.h"
59#include "ipa-fnsummary.h"

61/* Entry in the histogram.  */

63struct histogram_entry
64{
gcov_type count;
int time;
int size;
68};

70/* Histogram of profile values.
 The histogram is represented as an ordered vector of entries allocated via
 histogram_pool. During construction a separate hashtable is kept to lookup
 duplicate entries.  */

75vec<histogram_entry *> histogram;
76static object_allocator<histogram_entry> histogram_pool ("IPA histogram");

78/* Hashtable support for storing SSA names hashed by their SSA_NAME_VAR.  */

80struct histogram_hash : nofree_ptr_hash <histogram_entry>
81{
static inline hashval_t hash (const histogram_entry *);
static inline int equal (const histogram_entry *, const histogram_entry *);
84};

86inline hashval_t
87histogram_hash::hash (const histogram_entry *val)
88{
return val->count;
90}

92inline int
93histogram_hash::equal (const histogram_entry *val, const histogram_entry *val2)
94{
return val->count == val2->count;
96}

98/* Account TIME and SIZE executed COUNT times into HISTOGRAM.
 HASHTABLE is the on-side hash kept to avoid duplicates.  */

101static void
102account_time_size (hash_table<histogram_hash> *hashtable,
   vec<histogram_entry *> &histogram,
   gcov_type count, int time, int size)
105{
histogram_entry key = {count, 0, 0};
histogram_entry **val = hashtable->find_slot (&key, INSERT);

if (!*val)
  {
    *val = histogram_pool.allocate ();
    **val = key;
    histogram.safe_push (*val);
  }
(*val)->time += time;
(*val)->size += size;
117}

119int
120cmp_counts (const void *v1, const void *v2)
121{
const histogram_entry *h1 = *(const histogram_entry * const *)v1;
const histogram_entry *h2 = *(const histogram_entry * const *)v2;
if (h1->count < h2->count)
  return 1;
if (h1->count > h2->count)
  return -1;
return 0;
129}

131/* Dump HISTOGRAM to FILE.  */

133static void
134dump_histogram (FILE *file, vec<histogram_entry *> histogram)
135{
unsigned int i;
gcov_type overall_time = 0, cumulated_time = 0, cumulated_size = 0,
   overall_size = 0;

fprintf (dump_file, "Histogram:\n");
for (i = 0; i < histogram.length (); i++)
  {
    overall_time += histogram[i]->count * histogram[i]->time;
    overall_size += histogram[i]->size;
  }
if (!overall_time)
  overall_time = 1;
if (!overall_size)
  overall_size = 1;
for (i = 0; i < histogram.length (); i++)
  {
    cumulated_time += histogram[i]->count * histogram[i]->time;
    cumulated_size += histogram[i]->size;
    fprintf (file, "  %" PRId64"l" "d"": time:%i (%2.2f) size:%i (%2.2f)\n",
      (int64_t) histogram[i]->count,
      histogram[i]->time,
      cumulated_time * 100.0 / overall_time,
      histogram[i]->size,
      cumulated_size * 100.0 / overall_size);
 }
161}

163/* Structure containing speculative target information from profile.  */

165struct speculative_call_target
166{
speculative_call_target (unsigned int id = 0, int prob = 0)
  : target_id (id), target_probability (prob)
{
}

/* Profile_id of target obtained from profile.  */
unsigned int target_id;
/* Probability that call will land in function with target_id.  */
unsigned int target_probability;
176};

178class speculative_call_summary
179{
180public:
speculative_call_summary () : speculative_call_targets ()
{}

auto_vec<speculative_call_target> speculative_call_targets;

void dump (FILE *f);

188};

/* Class to manage call summaries.  */

192class ipa_profile_call_summaries
: public call_summary<speculative_call_summary *>
194{
195public:
ipa_profile_call_summaries (symbol_table *table)
  : call_summary<speculative_call_summary *> (table)
{}

/* Duplicate info when an edge is cloned.  */
virtual void duplicate (cgraph_edge *, cgraph_edge *,
	  speculative_call_summary *old_sum,
	  speculative_call_summary *new_sum);
204};

206static ipa_profile_call_summaries *call_sums = NULLnullptr;

208/* Dump all information in speculative call summary to F.  */

210void
211speculative_call_summary::dump (FILE *f)
212{
cgraph_node *n2;

unsigned spec_count = speculative_call_targets.length ();
for (unsigned i = 0; i < spec_count; i++)
  {
    speculative_call_target item = speculative_call_targets[i];
    n2 = find_func_by_profile_id (item.target_id);
    if (n2)
fprintf (f, "    The %i speculative target is %s with prob %3.2f\n", i,
 n2->dump_name (),
 item.target_probability / (float) REG_BR_PROB_BASE10000);
    else
fprintf (f, "    The %i speculative target is %u with prob %3.2f\n", i,
 item.target_id,
 item.target_probability / (float) REG_BR_PROB_BASE10000);
  }
229}

231/* Duplicate info when an edge is cloned.  */

233void
234ipa_profile_call_summaries::duplicate (cgraph_edge *, cgraph_edge *,
		       speculative_call_summary *old_sum,
		       speculative_call_summary *new_sum)
237{
if (!old_sum)
  return;

unsigned old_count = old_sum->speculative_call_targets.length ();
if (!old_count)
  return;

new_sum->speculative_call_targets.reserve_exact (old_count);
new_sum->speculative_call_targets.quick_grow_cleared (old_count);

for (unsigned i = 0; i < old_count; i++)
  {
    new_sum->speculative_call_targets[i]
= old_sum->speculative_call_targets[i];
  }
253}

255/* Collect histogram and speculative target summaries from CFG profiles.  */

257static void
258ipa_profile_generate_summary (void)
259{
struct cgraph_node *node;
gimple_stmt_iterator gsi;
basic_block bb;

hash_table<histogram_hash> hashtable (10);

gcc_checking_assert (!call_sums)((void)(!(!call_sums) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 266, __FUNCTION__), 0 : 0));
1
Assuming 'call_sums' is null→
2
←
'?' condition is false→
call_sums = new ipa_profile_call_summaries (symtab);

FOR_EACH_FUNCTION_WITH_GIMPLE_BODY (node)for ((node) = symtab->first_function_with_gimple_body (); (
node); (node) = symtab->next_function_with_gimple_body (node
))
3
←
Calling 'symbol_table::first_function_with_gimple_body'→
48
←
Returning from 'symbol_table::first_function_with_gimple_body'→
49
←
Loop condition is true.  Entering loop body→
  if (ENTRY_BLOCK_PTR_FOR_FN((((tree_check ((node->decl), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 271, __FUNCTION__, (FUNCTION_DECL)))->function_decl.f))->
cfg->x_entry_block_ptr)
50
←
Calling 'profile_count::ipa_p'→
52
←
Returning from 'profile_count::ipa_p'→
53
←
Taking true branch→
 (DECL_STRUCT_FUNCTION (node->decl))((((tree_check ((node->decl), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 271, __FUNCTION__, (FUNCTION_DECL)))->function_decl.f))->
cfg->x_entry_block_ptr)->count.ipa_p ())
    FOR_EACH_BB_FN (bb, DECL_STRUCT_FUNCTION (node->decl))for (bb = (((tree_check ((node->decl), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 272, __FUNCTION__, (FUNCTION_DECL)))->function_decl.f))->
cfg->x_entry_block_ptr->next_bb; bb != (((tree_check ((
node->decl), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 272, __FUNCTION__, (FUNCTION_DECL)))->function_decl.f))->
cfg->x_exit_block_ptr; bb = bb->next_bb)
54
←
Assuming 'bb' is not equal to field 'x_exit_block_ptr'→
55
←
Loop condition is true.  Entering loop body→
{
 int time = 0;
 int size = 0;
 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
56
←
Calling 'gsi_end_p'→
59
←
Returning from 'gsi_end_p'→
60
←
Loop condition is true.  Entering loop body→
   {
     gimple *stmt = gsi_stmt (gsi);
     if (gimple_code (stmt) == GIMPLE_CALL
61
←
Assuming the condition is true→
72
←
Taking true branch→
  && !gimple_call_fndecl (stmt))
62
←
Calling 'gimple_call_fndecl'→
71
←
Returning from 'gimple_call_fndecl'→
{
  histogram_value h;
  h = gimple_histogram_value_of_type
	(DECL_STRUCT_FUNCTION (node->decl)((tree_check ((node->decl), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 284, __FUNCTION__, (FUNCTION_DECL)))->function_decl.f),
	 stmt, HIST_TYPE_INDIR_CALL);
  /* No need to do sanity check: gimple_ic_transform already
     takes away bad histograms.  */
  if (h)
73
←
Assuming 'h' is non-null→
74
←
Taking true branch→
    {
      gcov_type val, count, all;
      struct cgraph_edge *e = node->get_edge (stmt);
75
←
'e' initialized here→
      if (e && !e->indirect_unknown_callee)
76
←
Assuming 'e' is null→
	continue;

      speculative_call_summary *csum
	= call_sums->get_create (e);
77
←
Passing null pointer value via 1st parameter 'edge'→
78
←
Calling 'call_summary::get_create'→

      for (unsigned j = 0; j < GCOV_TOPN_MAXIMUM_TRACKED_VALUES32;
	   j++)
	{
	  if (!get_nth_most_common_value (NULLnullptr, "indirect call",
					  h, &val, &count, &all,
					  j))
	    continue;

	  if (val == 0 || count == 0)
	    continue;

	  if (count > all)
	    {
	      if (dump_file)
		fprintf (dump_file,
			 "Probability capped to 1\n");
	      count = all;
	    }
	  speculative_call_target item (
	    val, GCOV_COMPUTE_SCALE (count, all)((all) ? ((((count) * 10000) + ((all)) / 2) / ((all))) : 10000
));
	  csum->speculative_call_targets.safe_push (item);
	}

      gimple_remove_histogram_value
	 (DECL_STRUCT_FUNCTION (node->decl)((tree_check ((node->decl), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 322, __FUNCTION__, (FUNCTION_DECL)))->function_decl.f), stmt, h);
    }
}
     time += estimate_num_insns (stmt, &eni_time_weights);
     size += estimate_num_insns (stmt, &eni_size_weights);
   }
 if (bb->count.ipa_p () && bb->count.initialized_p ())
   account_time_size (&hashtable, histogram,
	       bb->count.ipa ().to_gcov_type (),
	       time, size);
}
histogram.qsort (cmp_counts)qsort (cmp_counts);
334}

336/* Serialize the speculative summary info for LTO.  */

338static void
339ipa_profile_write_edge_summary (lto_simple_output_block *ob,
		speculative_call_summary *csum)
341{
unsigned len = 0;

len = csum->speculative_call_targets.length ();

gcc_assert (len <= GCOV_TOPN_MAXIMUM_TRACKED_VALUES)((void)(!(len <= 32) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 346, __FUNCTION__), 0 : 0));

streamer_write_hwi_stream (ob->main_stream, len);

if (len)
  {
    unsigned spec_count = csum->speculative_call_targets.length ();
    for (unsigned i = 0; i < spec_count; i++)
{
 speculative_call_target item = csum->speculative_call_targets[i];
 gcc_assert (item.target_id)((void)(!(item.target_id) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 356, __FUNCTION__), 0 : 0));
 streamer_write_hwi_stream (ob->main_stream, item.target_id);
 streamer_write_hwi_stream (ob->main_stream, item.target_probability);
}
  }
361}

363/* Serialize the ipa info for lto.  */

365static void
366ipa_profile_write_summary (void)
367{
struct lto_simple_output_block *ob
  = lto_create_simple_output_block (LTO_section_ipa_profile);
unsigned int i;

streamer_write_uhwi_stream (ob->main_stream, histogram.length ());
for (i = 0; i < histogram.length (); i++)
  {
    streamer_write_gcov_count_stream (ob->main_stream, histogram[i]->count);
    streamer_write_uhwi_stream (ob->main_stream, histogram[i]->time);
    streamer_write_uhwi_stream (ob->main_stream, histogram[i]->size);
  }

if (!call_sums)
  return;

/* Serialize speculative targets information.  */
unsigned int count = 0;
lto_symtab_encoder_t encoder = ob->decl_state->symtab_node_encoder;
lto_symtab_encoder_iterator lsei;
cgraph_node *node;

for (lsei = lsei_start_function_in_partition (encoder); !lsei_end_p (lsei);
     lsei_next_function_in_partition (&lsei))
  {
    node = lsei_cgraph_node (lsei);
    if (node->definition && node->has_gimple_body_p ()
 && node->indirect_calls)
count++;
  }

streamer_write_uhwi_stream (ob->main_stream, count);

/* Process all of the functions.  */
for (lsei = lsei_start_function_in_partition (encoder);
     !lsei_end_p (lsei) && count; lsei_next_function_in_partition (&lsei))
  {
    cgraph_node *node = lsei_cgraph_node (lsei);
    if (node->definition && node->has_gimple_body_p ()
 && node->indirect_calls)
{
 int node_ref = lto_symtab_encoder_encode (encoder, node);
 streamer_write_uhwi_stream (ob->main_stream, node_ref);

 for (cgraph_edge *e = node->indirect_calls; e; e = e->next_callee)
   {
     speculative_call_summary *csum = call_sums->get_create (e);
     ipa_profile_write_edge_summary (ob, csum);
   }
    }
  }

lto_destroy_simple_output_block (ob);
420}

422/* Dump all profile summary data for all cgraph nodes and edges to file F.  */

424static void
425ipa_profile_dump_all_summaries (FILE *f)
426{
fprintf (dump_file,
  "\n========== IPA-profile speculative targets: ==========\n");
cgraph_node *node;
FOR_EACH_FUNCTION_WITH_GIMPLE_BODY (node)for ((node) = symtab->first_function_with_gimple_body (); (
node); (node) = symtab->next_function_with_gimple_body (node
))
  {
    fprintf (f, "\nSummary for node %s:\n", node->dump_name ());
    for (cgraph_edge *e = node->indirect_calls; e; e = e->next_callee)
{
 fprintf (f, "  Summary for %s of indirect edge %d:\n",
   e->caller->dump_name (), e->lto_stmt_uid);
 speculative_call_summary *csum = call_sums->get_create (e);
 csum->dump (f);
}
  }
fprintf (f, "\n\n");
442}

444/* Read speculative targets information about edge for LTO WPA.  */

446static void
447ipa_profile_read_edge_summary (class lto_input_block *ib, cgraph_edge *edge)
448{
unsigned i, len;

len = streamer_read_hwi (ib);
gcc_assert (len <= GCOV_TOPN_MAXIMUM_TRACKED_VALUES)((void)(!(len <= 32) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 452, __FUNCTION__), 0 : 0));
speculative_call_summary *csum = call_sums->get_create (edge);

for (i = 0; i < len; i++)
{
  unsigned int target_id = streamer_read_hwi (ib);
  int target_probability = streamer_read_hwi (ib);
  speculative_call_target item (target_id, target_probability);
  csum->speculative_call_targets.safe_push (item);
}
462}

464/* Read profile speculative targets section information for LTO WPA.  */

466static void
467ipa_profile_read_summary_section (struct lto_file_decl_data *file_data,
		  class lto_input_block *ib)
469{
if (!ib)
  return;

lto_symtab_encoder_t encoder = file_data->symtab_node_encoder;

unsigned int count = streamer_read_uhwi (ib);

unsigned int i;
unsigned int index;
cgraph_node * node;

for (i = 0; i < count; i++)
  {
    index = streamer_read_uhwi (ib);
    encoder = file_data->symtab_node_encoder;
    node
= dyn_cast<cgraph_node *> (lto_symtab_encoder_deref (encoder, index));

    for (cgraph_edge *e = node->indirect_calls; e; e = e->next_callee)
ipa_profile_read_edge_summary (ib, e);
  }
491}

493/* Deserialize the IPA histogram and speculative targets summary info for LTO.
 */

496static void
497ipa_profile_read_summary (void)
498{
struct lto_file_decl_data ** file_data_vec
  = lto_get_file_decl_data ();
struct lto_file_decl_data * file_data;
int j = 0;

hash_table<histogram_hash> hashtable (10);

gcc_checking_assert (!call_sums)((void)(!(!call_sums) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 506, __FUNCTION__), 0 : 0));
call_sums = new ipa_profile_call_summaries (symtab);

while ((file_data = file_data_vec[j++]))
  {
    const char *data;
    size_t len;
    class lto_input_block *ib
= lto_create_simple_input_block (file_data,
			 LTO_section_ipa_profile,
			 &data, &len);
    if (ib)
{
        unsigned int num = streamer_read_uhwi (ib);
 unsigned int n;
 for (n = 0; n < num; n++)
   {
     gcov_type count = streamer_read_gcov_count (ib);
     int time = streamer_read_uhwi (ib);
     int size = streamer_read_uhwi (ib);
     account_time_size (&hashtable, histogram,
		 count, time, size);
   }

 ipa_profile_read_summary_section (file_data, ib);

 lto_destroy_simple_input_block (file_data,
			  LTO_section_ipa_profile,
			  ib, data, len);
}
  }
histogram.qsort (cmp_counts)qsort (cmp_counts);
538}

540/* Data used by ipa_propagate_frequency.  */

542struct ipa_propagate_frequency_data
543{
cgraph_node *function_symbol;
bool maybe_unlikely_executed;
bool maybe_executed_once;
bool only_called_at_startup;
bool only_called_at_exit;
549};

551/* Worker for ipa_propagate_frequency_1.  */

553static bool
554ipa_propagate_frequency_1 (struct cgraph_node *node, void *data)
555{
struct ipa_propagate_frequency_data *d;
struct cgraph_edge *edge;

d = (struct ipa_propagate_frequency_data *)data;
for (edge = node->callers;
     edge && (d->maybe_unlikely_executed || d->maybe_executed_once
       || d->only_called_at_startup || d->only_called_at_exit);
     edge = edge->next_caller)
  {
    if (edge->caller != d->function_symbol)
{
        d->only_called_at_startup &= edge->caller->only_called_at_startup;
 /* It makes sense to put main() together with the static constructors.
    It will be executed for sure, but rest of functions called from
    main are definitely not at startup only.  */
 if (MAIN_NAME_P (DECL_NAME (edge->caller->decl))((tree_check ((((contains_struct_check ((edge->caller->
decl), (TS_DECL_MINIMAL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 571, __FUNCTION__))->decl_minimal.name)), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 571, __FUNCTION__, (IDENTIFIER_NODE))) == global_trees[TI_MAIN_IDENTIFIER
]))
   d->only_called_at_startup = 0;
        d->only_called_at_exit &= edge->caller->only_called_at_exit;
}

    /* When profile feedback is available, do not try to propagate too hard;
counts are already good guide on function frequencies and roundoff
errors can make us to push function into unlikely section even when
it is executed by the train run.  Transfer the function only if all
callers are unlikely executed.  */
    if (profile_info
 && !(edge->callee->count.ipa () == profile_count::zero ())
 && (edge->caller->frequency != NODE_FREQUENCY_UNLIKELY_EXECUTED
     || (edge->caller->inlined_to
  && edge->caller->inlined_to->frequency
     != NODE_FREQUENCY_UNLIKELY_EXECUTED)))
 d->maybe_unlikely_executed = false;
    if (edge->count.ipa ().initialized_p ()
 && !edge->count.ipa ().nonzero_p ())
continue;
    switch (edge->caller->frequency)
      {
case NODE_FREQUENCY_UNLIKELY_EXECUTED:
 break;
case NODE_FREQUENCY_EXECUTED_ONCE:
 {
   if (dump_file && (dump_flags & TDF_DETAILS))
     fprintf (dump_file, "  Called by %s that is executed once\n",
       edge->caller->dump_name ());
   d->maybe_unlikely_executed = false;
   ipa_call_summary *s = ipa_call_summaries->get (edge);
   if (s != NULLnullptr && s->loop_depth)
     {
d->maybe_executed_once = false;
if (dump_file && (dump_flags & TDF_DETAILS))
  fprintf (dump_file, "  Called in loop\n");
     }
   break;
 }
case NODE_FREQUENCY_HOT:
case NODE_FREQUENCY_NORMAL:
 if (dump_file && (dump_flags & TDF_DETAILS))
   fprintf (dump_file, "  Called by %s that is normal or hot\n",
     edge->caller->dump_name ());
 d->maybe_unlikely_executed = false;
 d->maybe_executed_once = false;
 break;
}
  }
return edge != NULLnullptr;
621}

623/* Return ture if NODE contains hot calls.  */

625bool
626contains_hot_call_p (struct cgraph_node *node)
627{
struct cgraph_edge *e;
for (e = node->callees; e; e = e->next_callee)
  if (e->maybe_hot_p ())
    return true;
  else if (!e->inline_failed
    && contains_hot_call_p (e->callee))
    return true;
for (e = node->indirect_calls; e; e = e->next_callee)
  if (e->maybe_hot_p ())
    return true;
return false;
639}

641/* See if the frequency of NODE can be updated based on frequencies of its
 callers.  */
643bool
644ipa_propagate_frequency (struct cgraph_node *node)
645{
struct ipa_propagate_frequency_data d = {node, true, true, true, true};
bool changed = false;

/* We cannot propagate anything useful about externally visible functions
   nor about virtuals.  */
if (!node->local
    || node->alias
    || (opt_for_fn (node->decl, flag_devirtualize)(opts_for_fn (node->decl)->x_flag_devirtualize)
 && DECL_VIRTUAL_P (node->decl)((contains_struct_check ((node->decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 654, __FUNCTION__))->decl_common.virtual_flag)))
  return false;
gcc_assert (node->analyzed)((void)(!(node->analyzed) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 656, __FUNCTION__), 0 : 0));
if (dump_file && (dump_flags & TDF_DETAILS))
  fprintf (dump_file, "Processing frequency %s\n", node->dump_name ());

node->call_for_symbol_and_aliases (ipa_propagate_frequency_1, &d,
		     true);

if ((d.only_called_at_startup && !d.only_called_at_exit)
    && !node->only_called_at_startup)
  {
     node->only_called_at_startup = true;
     if (dump_file)
       fprintf (dump_file, "Node %s promoted to only called at startup.\n",
  node->dump_name ());
     changed = true;
  }
if ((d.only_called_at_exit && !d.only_called_at_startup)
    && !node->only_called_at_exit)
  {
     node->only_called_at_exit = true;
     if (dump_file)
       fprintf (dump_file, "Node %s promoted to only called at exit.\n",
  node->dump_name ());
     changed = true;
  }

/* With profile we can decide on hot/normal based on count.  */
if (node->count. ipa().initialized_p ())
  {
    bool hot = false;
    if (!(node->count. ipa() == profile_count::zero ())
 && node->count. ipa() >= get_hot_bb_threshold ())
hot = true;
    if (!hot)
hot |= contains_hot_call_p (node);
    if (hot)
{
 if (node->frequency != NODE_FREQUENCY_HOT)
   {
     if (dump_file)
fprintf (dump_file, "Node %s promoted to hot.\n",
	 node->dump_name ());
     node->frequency = NODE_FREQUENCY_HOT;
     return true;
   }
 return false;
}
    else if (node->frequency == NODE_FREQUENCY_HOT)
{
 if (dump_file)
   fprintf (dump_file, "Node %s reduced to normal.\n",
     node->dump_name ());
 node->frequency = NODE_FREQUENCY_NORMAL;
 changed = true;
}
  }
/* These come either from profile or user hints; never update them.  */
if (node->frequency == NODE_FREQUENCY_HOT
    || node->frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED)
  return changed;
if (d.maybe_unlikely_executed)
  {
    node->frequency = NODE_FREQUENCY_UNLIKELY_EXECUTED;
    if (dump_file)
fprintf (dump_file, "Node %s promoted to unlikely executed.\n",
 node->dump_name ());
    changed = true;
  }
else if (d.maybe_executed_once && node->frequency != NODE_FREQUENCY_EXECUTED_ONCE)
  {
    node->frequency = NODE_FREQUENCY_EXECUTED_ONCE;
    if (dump_file)
fprintf (dump_file, "Node %s promoted to executed once.\n",
 node->dump_name ());
    changed = true;
  }
return changed;
733}

735/* Check that number of arguments of N agrees with E.
 Be conservative when summaries are not present.  */

738static bool
739check_argument_count (struct cgraph_node *n, struct cgraph_edge *e)
740{
if (!ipa_node_params_sum || !ipa_edge_args_sum)
  return true;
class ipa_node_params *info = IPA_NODE_REF (n->function_symbol ())(ipa_node_params_sum->get (n->function_symbol ()));
if (!info)
  return true;
ipa_edge_args *e_info = IPA_EDGE_REF (e)(ipa_edge_args_sum->get (e));
if (!e_info)
  return true;
if (ipa_get_param_count (info) != ipa_get_cs_argument_count (e_info)
    && (ipa_get_param_count (info) >= ipa_get_cs_argument_count (e_info)
 || !stdarg_p (TREE_TYPE (n->decl)((contains_struct_check ((n->decl), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 751, __FUNCTION__))->typed.type))))
  return false;
return true;
754}

756/* Simple ipa profile pass propagating frequencies across the callgraph.  */

758static unsigned int
759ipa_profile (void)
760{
struct cgraph_node **order;
struct cgraph_edge *e;
int order_pos;
bool something_changed = false;
int i;
gcov_type overall_time = 0, cutoff = 0, cumulated = 0, overall_size = 0;
struct cgraph_node *n,*n2;
int nindirect = 0, ncommon = 0, nunknown = 0, nuseless = 0, nconverted = 0;
int nmismatch = 0, nimpossible = 0;
bool node_map_initialized = false;
gcov_type threshold;

if (dump_file)
  dump_histogram (dump_file, histogram);
for (i = 0; i < (int)histogram.length (); i++)
  {
    overall_time += histogram[i]->count * histogram[i]->time;
    overall_size += histogram[i]->size;
  }
threshold = 0;
if (overall_time)
  {
    gcc_assert (overall_size)((void)(!(overall_size) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 783, __FUNCTION__), 0 : 0));

    cutoff = (overall_time * param_hot_bb_count_ws_permilleglobal_options.x_param_hot_bb_count_ws_permille + 500) / 1000;
    for (i = 0; cumulated < cutoff; i++)
{
 cumulated += histogram[i]->count * histogram[i]->time;
        threshold = histogram[i]->count;
}
    if (!threshold)
threshold = 1;
    if (dump_file)
{
 gcov_type cumulated_time = 0, cumulated_size = 0;

        for (i = 0;
      i < (int)histogram.length () && histogram[i]->count >= threshold;
      i++)
   {
     cumulated_time += histogram[i]->count * histogram[i]->time;
     cumulated_size += histogram[i]->size;
   }
 fprintf (dump_file, "Determined min count: %" PRId64"l" "d"
   " Time:%3.2f%% Size:%3.2f%%\n", 
   (int64_t)threshold,
   cumulated_time * 100.0 / overall_time,
   cumulated_size * 100.0 / overall_size);
}

    if (in_lto_pglobal_options.x_in_lto_p)
{
 if (dump_file)
   fprintf (dump_file, "Setting hotness threshold in LTO mode.\n");
        set_hot_bb_threshold (threshold);
}
  }
histogram.release ();
histogram_pool.release ();

/* Produce speculative calls: we saved common target from profiling into
   e->target_id.  Now, at link time, we can look up corresponding
   function node and produce speculative call.  */

gcc_checking_assert (call_sums)((void)(!(call_sums) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/ipa-profile.c"
, 825, __FUNCTION__), 0 : 0));

if (dump_file)
  {
    if (!node_map_initialized)
init_node_map (false);
    node_map_initialized = true;

    ipa_profile_dump_all_summaries (dump_file);
  }

FOR_EACH_DEFINED_FUNCTION (n)for ((n) = symtab->first_defined_function (); (n); (n) = symtab
->next_defined_function ((n)))
  {
    bool update = false;

    if (!opt_for_fn (n->decl, flag_ipa_profile)(opts_for_fn (n->decl)->x_flag_ipa_profile))
continue;

    for (e = n->indirect_calls; e; e = e->next_callee)
{
 if (n->count.initialized_p ())
   nindirect++;

 speculative_call_summary *csum = call_sums->get_create (e);
 unsigned spec_count = csum->speculative_call_targets.length ();
 if (spec_count)
   {
     if (!node_map_initialized)
init_node_map (false);
     node_map_initialized = true;
     ncommon++;

     if (in_lto_pglobal_options.x_in_lto_p)
{
  if (dump_file)
    {
      fprintf (dump_file,
	       "Updating hotness threshold in LTO mode.\n");
      fprintf (dump_file, "Updated min count: %" PRId64"l" "d" "\n",
	       (int64_t) threshold / spec_count);
    }
  set_hot_bb_threshold (threshold / spec_count);
}

     unsigned speculative_id = 0;
     profile_count orig = e->count;
     for (unsigned i = 0; i < spec_count; i++)
{
  speculative_call_target item
    = csum->speculative_call_targets[i];
  n2 = find_func_by_profile_id (item.target_id);
  if (n2)
    {
      if (dump_file)
	{
	  fprintf (dump_file,
		   "Indirect call -> direct call from"
		   " other module %s => %s, prob %3.2f\n",
		   n->dump_name (),
		   n2->dump_name (),
		   item.target_probability
		     / (float) REG_BR_PROB_BASE10000);
	}
      if (item.target_probability < REG_BR_PROB_BASE10000 / 2)
	{
	  nuseless++;
	  if (dump_file)
	    fprintf (dump_file,
		     "Not speculating: "
		     "probability is too low.\n");
	}
      else if (!e->maybe_hot_p ())
	{
	  nuseless++;
	  if (dump_file)
	    fprintf (dump_file,
		     "Not speculating: call is cold.\n");
	}
      else if (n2->get_availability () <= AVAIL_INTERPOSABLE
	       && n2->can_be_discarded_p ())
	{
	  nuseless++;
	  if (dump_file)
	    fprintf (dump_file,
		     "Not speculating: target is overwritable "
		     "and can be discarded.\n");
	}
      else if (!check_argument_count (n2, e))
	{
	  nmismatch++;
	  if (dump_file)
	    fprintf (dump_file,
		     "Not speculating: "
		     "parameter count mismatch\n");
	}
      else if (e->indirect_info->polymorphic
	       && !opt_for_fn (n->decl, flag_devirtualize)(opts_for_fn (n->decl)->x_flag_devirtualize)
	       && !possible_polymorphic_call_target_p (e, n2))
	{
	  nimpossible++;
	  if (dump_file)
	    fprintf (dump_file,
		     "Not speculating: "
		     "function is not in the polymorphic "
		     "call target list\n");
	}
      else
	{
	  /* Target may be overwritable, but profile says that
	     control flow goes to this particular implementation
	     of N2.  Speculate on the local alias to allow
	     inlining.  */
	  if (!n2->can_be_discarded_p ())
	    {
	      cgraph_node *alias;
	      alias = dyn_cast<cgraph_node *>
		   (n2->noninterposable_alias ());
	      if (alias)
		n2 = alias;
	    }
	  nconverted++;
	  profile_probability prob
		 = profile_probability::from_reg_br_prob_base
			(item.target_probability).adjusted ();
	  e->make_speculative (n2,
			       orig.apply_probability (prob),
			       speculative_id);
	  update = true;
	  speculative_id++;
	}
    }
  else
    {
      if (dump_file)
	fprintf (dump_file,
		 "Function with profile-id %i not found.\n",
		 item.target_id);
      nunknown++;
    }
}
   }
}
    if (update)
ipa_update_overall_fn_summary (n);
  }
if (node_map_initialized)
  del_node_map ();
if (dump_file && nindirect)
  fprintf (dump_file,
    "%i indirect calls trained.\n"
    "%i (%3.2f%%) have common target.\n"
    "%i (%3.2f%%) targets was not found.\n"
    "%i (%3.2f%%) targets had parameter count mismatch.\n"
    "%i (%3.2f%%) targets was not in polymorphic call target list.\n"
    "%i (%3.2f%%) speculations seems useless.\n"
    "%i (%3.2f%%) speculations produced.\n",
    nindirect,
    ncommon, ncommon * 100.0 / nindirect,
    nunknown, nunknown * 100.0 / nindirect,
    nmismatch, nmismatch * 100.0 / nindirect,
    nimpossible, nimpossible * 100.0 / nindirect,
    nuseless, nuseless * 100.0 / nindirect,
    nconverted, nconverted * 100.0 / nindirect);

order = XCNEWVEC (struct cgraph_node *, symtab->cgraph_count)((struct cgraph_node * *) xcalloc ((symtab->cgraph_count),
 sizeof (struct cgraph_node *)));
order_pos = ipa_reverse_postorder (order);
for (i = order_pos - 1; i >= 0; i--)
  {
    if (order[i]->local
 && opt_for_fn (order[i]->decl, flag_ipa_profile)(opts_for_fn (order[i]->decl)->x_flag_ipa_profile)
 && ipa_propagate_frequency (order[i]))
{
 for (e = order[i]->callees; e; e = e->next_callee)
   if (e->callee->local && !e->callee->aux)
     {
       something_changed = true;
       e->callee->aux = (void *)1;
     }
}
    order[i]->aux = NULLnullptr;
  }

while (something_changed)
  {
    something_changed = false;
    for (i = order_pos - 1; i >= 0; i--)
{
 if (order[i]->aux
     && opt_for_fn (order[i]->decl, flag_ipa_profile)(opts_for_fn (order[i]->decl)->x_flag_ipa_profile)
     && ipa_propagate_frequency (order[i]))
   {
     for (e = order[i]->callees; e; e = e->next_callee)
if (e->callee->local && !e->callee->aux)
  {
    something_changed = true;
    e->callee->aux = (void *)1;
  }
   }
 order[i]->aux = NULLnullptr;
}
  }
free (order);

if (dump_file && (dump_flags & TDF_DETAILS))
  symtab->dump (dump_file);

delete call_sums;
call_sums = NULLnullptr;

return 0;
1035}

1037namespace {

1039const pass_data pass_data_ipa_profile =
1040{
IPA_PASS, /* type */
"profile_estimate", /* name */
OPTGROUP_NONE, /* optinfo_flags */
TV_IPA_PROFILE, /* tv_id */
0, /* properties_required */
0, /* properties_provided */
0, /* properties_destroyed */
0, /* todo_flags_start */
0, /* todo_flags_finish */
1050};

1052class pass_ipa_profile : public ipa_opt_pass_d
1053{
1054public:
pass_ipa_profile (gcc::context *ctxt)
  : ipa_opt_pass_d (pass_data_ipa_profile, ctxt,
      ipa_profile_generate_summary, /* generate_summary */
      ipa_profile_write_summary, /* write_summary */
      ipa_profile_read_summary, /* read_summary */
      NULLnullptr, /* write_optimization_summary */
      NULLnullptr, /* read_optimization_summary */
      NULLnullptr, /* stmt_fixup */
      0, /* function_transform_todo_flags_start */
      NULLnullptr, /* function_transform */
      NULLnullptr) /* variable_transform */
{}

/* opt_pass methods: */
virtual bool gate (function *) { return flag_ipa_profileglobal_options.x_flag_ipa_profile || in_lto_pglobal_options.x_in_lto_p; }
virtual unsigned int execute (function *) { return ipa_profile (); }

1072}; // class pass_ipa_profile

1074} // anon namespace

1076ipa_opt_pass_d *
1077make_pass_ipa_profile (gcc::context *ctxt)
1078{
return new pass_ipa_profile (ctxt);
1080}

←

/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h

→

1/* Callgraph handling code.
 Copyright (C) 2003-2021 Free Software Foundation, Inc.
 Contributed by Jan Hubicka

5This file is part of GCC.

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

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

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

21#ifndef GCC_CGRAPH_H
22#define GCC_CGRAPH_H

24#include "profile-count.h"
25#include "ipa-ref.h"
26#include "plugin-api.h"
27#include "ipa-param-manipulation.h"

29extern void debuginfo_early_init (void);
30extern void debuginfo_init (void);
31extern void debuginfo_fini (void);
32extern void debuginfo_start (void);
33extern void debuginfo_stop (void);
34extern void debuginfo_early_start (void);
35extern void debuginfo_early_stop (void);

37class ipa_opt_pass_d;
38typedef ipa_opt_pass_d *ipa_opt_pass;

40/* Symbol table consists of functions and variables.
 TODO: add labels and CONST_DECLs.  */
42enum symtab_type
43{
SYMTAB_SYMBOL,
SYMTAB_FUNCTION,
SYMTAB_VARIABLE
47};

49/* Section names are stored as reference counted strings in GGC safe hashtable
 (to make them survive through PCH).  */

52struct GTY((for_user)) section_hash_entry
53{
int ref_count;
char *name;  /* As long as this datastructure stays in GGC, we cannot put
  string at the tail of structure of GGC dies in horrible
  way  */
58};

60struct section_name_hasher : ggc_ptr_hash<section_hash_entry>
61{
typedef const char *compare_type;

static hashval_t hash (section_hash_entry *);
static bool equal (section_hash_entry *, const char *);
66};

68enum availability
69{
/* Not yet set by cgraph_function_body_availability.  */
AVAIL_UNSET,
/* Function body/variable initializer is unknown.  */
AVAIL_NOT_AVAILABLE,
/* Function body/variable initializer is known but might be replaced
   by a different one from other compilation unit and thus needs to
   be dealt with a care.  Like AVAIL_NOT_AVAILABLE it can have
   arbitrary side effects on escaping variables and functions, while
   like AVAILABLE it might access static variables.  */
AVAIL_INTERPOSABLE,
/* Function body/variable initializer is known and will be used in final
   program.  */
AVAIL_AVAILABLE,
/* Function body/variable initializer is known and all it's uses are
   explicitly visible within current unit (i.e. it's address is never taken
   and it is not exported to other units). Currently used only for
   functions.  */
AVAIL_LOCAL
88};

90/* Classification of symbols WRT partitioning.  */
91enum symbol_partitioning_class
92{
 /* External declarations are ignored by partitioning algorithms and they are
    added into the boundary later via compute_ltrans_boundary.  */
 SYMBOL_EXTERNAL,
 /* Partitioned symbols are put into one of partitions.  */
 SYMBOL_PARTITION,
 /* Duplicated symbols (such as comdat or constant pool references) are
    copied into every node needing them via add_symbol_to_partition.  */
 SYMBOL_DUPLICATE
101};

103/* Base of all entries in the symbol table.
 The symtab_node is inherited by cgraph and varpol nodes.  */
105struct GTY((desc ("%h.type"), tag ("SYMTAB_SYMBOL"),
   chain_next ("%h.next"), chain_prev ("%h.previous")))
symtab_node
108{
109public:
friend class symbol_table;

/* Constructor.  */
explicit symtab_node (symtab_type t)
  : type (t), resolution (LDPR_UNKNOWN), definition (false), alias (false),
    transparent_alias (false), weakref (false), cpp_implicit_alias (false),
    symver (false), analyzed (false), writeonly (false),
    refuse_visibility_changes (false), externally_visible (false),
    no_reorder (false), force_output (false), forced_by_abi (false),
    unique_name (false), implicit_section (false), body_removed (false),
    used_from_other_partition (false), in_other_partition (false),
    address_taken (false), in_init_priority_hash (false),
    need_lto_streaming (false), offloadable (false), ifunc_resolver (false),
    order (false), next_sharing_asm_name (NULLnullptr),
    previous_sharing_asm_name (NULLnullptr), same_comdat_group (NULLnullptr), ref_list (),
    alias_target (NULLnullptr), lto_file_data (NULLnullptr), aux (NULLnullptr),
    x_comdat_group (NULL_TREE(tree) nullptr), x_section (NULLnullptr)
{}

/* Return name.  */
const char *name () const;

/* Return dump name.  */
const char *dump_name () const;

/* Return asm name.  */
const char *asm_name () const;

/* Return dump name with assembler name.  */
const char *dump_asm_name () const;

/* Return visibility name.  */
const char *get_visibility_string () const;

/* Return type_name name.  */
const char *get_symtab_type_string () const;

/* Add node into symbol table.  This function is not used directly, but via
   cgraph/varpool node creation routines.  */
void register_symbol (void);

/* Remove symbol from symbol table.  */
void remove (void);

/* Dump symtab node to F.  */
void dump (FILE *f);

/* Dump symtab callgraph in graphviz format.  */
void dump_graphviz (FILE *f);

/* Dump symtab node to stderr.  */
void DEBUG_FUNCTION__attribute__ ((__used__)) debug (void);

/* Verify consistency of node.  */
void DEBUG_FUNCTION__attribute__ ((__used__)) verify (void);

/* Return ipa reference from this symtab_node to
   REFERRED_NODE or REFERRED_VARPOOL_NODE. USE_TYPE specify type
   of the use and STMT the statement (if it exists).  */
ipa_ref *create_reference (symtab_node *referred_node,
	     enum ipa_ref_use use_type);

/* Return ipa reference from this symtab_node to
   REFERRED_NODE or REFERRED_VARPOOL_NODE. USE_TYPE specify type
   of the use and STMT the statement (if it exists).  */
ipa_ref *create_reference (symtab_node *referred_node,
	     enum ipa_ref_use use_type, gimple *stmt);

/* If VAL is a reference to a function or a variable, add a reference from
   this symtab_node to the corresponding symbol table node.  Return the new
   reference or NULL if none was created.  */
ipa_ref *maybe_create_reference (tree val, gimple *stmt);

/* Clone all references from symtab NODE to this symtab_node.  */
void clone_references (symtab_node *node);

/* Remove all stmt references in non-speculative references.
   Those are not maintained during inlining & clonning.
   The exception are speculative references that are updated along
   with callgraph edges associated with them.  */
void clone_referring (symtab_node *node);

/* Clone reference REF to this symtab_node and set its stmt to STMT.  */
ipa_ref *clone_reference (ipa_ref *ref, gimple *stmt);

/* Find the structure describing a reference to REFERRED_NODE
   and associated with statement STMT.  */
ipa_ref *find_reference (symtab_node *referred_node, gimple *stmt,
	   unsigned int lto_stmt_uid);

/* Remove all references that are associated with statement STMT.  */
void remove_stmt_references (gimple *stmt);

/* Remove all stmt references in non-speculative references.
   Those are not maintained during inlining & clonning.
   The exception are speculative references that are updated along
   with callgraph edges associated with them.  */
void clear_stmts_in_references (void);

/* Remove all references in ref list.  */
void remove_all_references (void);

/* Remove all referring items in ref list.  */
void remove_all_referring (void);

/* Dump references in ref list to FILE.  */
void dump_references (FILE *file);

/* Dump referring in list to FILE.  */
void dump_referring (FILE *);

/* Get number of references for this node.  */
inline unsigned num_references (void)
{
  return ref_list.references.length ();
}

/* Iterates I-th reference in the list, REF is also set.  */
ipa_ref *iterate_reference (unsigned i, ipa_ref *&ref);

/* Iterates I-th referring item in the list, REF is also set.  */
ipa_ref *iterate_referring (unsigned i, ipa_ref *&ref);

/* Iterates I-th referring alias item in the list, REF is also set.  */
ipa_ref *iterate_direct_aliases (unsigned i, ipa_ref *&ref);

/* Return true if symtab node and TARGET represents
   semantically equivalent symbols.  */
bool semantically_equivalent_p (symtab_node *target);

/* Classify symbol symtab node for partitioning.  */
enum symbol_partitioning_class get_partitioning_class (void);

/* Return comdat group.  */
tree get_comdat_group ()
  {
    return x_comdat_group;
  }

/* Return comdat group as identifier_node.  */
tree get_comdat_group_id ()
  {
    if (x_comdat_group && TREE_CODE (x_comdat_group)((enum tree_code) (x_comdat_group)->base.code) != IDENTIFIER_NODE)
x_comdat_group = DECL_ASSEMBLER_NAME (x_comdat_group)decl_assembler_name (x_comdat_group);
    return x_comdat_group;
  }

/* Set comdat group.  */
void set_comdat_group (tree group)
  {
    gcc_checking_assert (!group || TREE_CODE (group) == IDENTIFIER_NODE((void)(!(!group || ((enum tree_code) (group)->base.code) ==
 IDENTIFIER_NODE || (tree_code_type[(int) (((enum tree_code) (
group)->base.code))] == tcc_declaration)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 261, __FUNCTION__), 0 : 0))
	   || DECL_P (group))((void)(!(!group || ((enum tree_code) (group)->base.code) ==
 IDENTIFIER_NODE || (tree_code_type[(int) (((enum tree_code) (
group)->base.code))] == tcc_declaration)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 261, __FUNCTION__), 0 : 0));
    x_comdat_group = group;
  }

/* Return section as string.  */
const char * get_section () const
  {
    if (!x_section)
return NULLnullptr;
    return x_section->name;
  }

/* Remove node from same comdat group.   */
void remove_from_same_comdat_group (void);

/* Add this symtab_node to the same comdat group that OLD is in.  */
void add_to_same_comdat_group (symtab_node *old_node);

/* Dissolve the same_comdat_group list in which NODE resides.  */
void dissolve_same_comdat_group_list (void);

/* Return true when symtab_node is known to be used from other (non-LTO)
   object file. Known only when doing LTO via linker plugin.  */
bool used_from_object_file_p (void);

/* Walk the alias chain to return the symbol NODE is alias of.
   If NODE is not an alias, return NODE.
   When AVAILABILITY is non-NULL, get minimal availability in the chain.
   When REF is non-NULL, assume that reference happens in symbol REF
   when determining the availability.  */
symtab_node *ultimate_alias_target (enum availability *avail = NULLnullptr,
		      struct symtab_node *ref = NULLnullptr);

/* Return next reachable static symbol with initializer after NODE.  */
inline symtab_node *next_defined_symbol (void);

/* Add reference recording that symtab node is alias of TARGET.
   If TRANSPARENT is true make the alias to be transparent alias.
   The function can fail in the case of aliasing cycles; in this case
   it returns false.  */
bool resolve_alias (symtab_node *target, bool transparent = false);

/* C++ FE sometimes change linkage flags after producing same
   body aliases.  */
void fixup_same_cpp_alias_visibility (symtab_node *target);

/* Call callback on symtab node and aliases associated to this node.
   When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
   skipped.  */
bool call_for_symbol_and_aliases (bool (*callback) (symtab_node *, void *),
		    void *data,
		    bool include_overwrite);

/* If node cannot be interposable by static or dynamic linker to point to
   different definition, return this symbol. Otherwise look for alias with
   such property and if none exists, introduce new one.  */
symtab_node *noninterposable_alias (void);

/* Return node that alias is aliasing.  */
inline symtab_node *get_alias_target (void);

/* Set section for symbol and its aliases.  */
void set_section (const char *section);

/* Like set_section, but copying the section name from another node.  */
void set_section (const symtab_node &other);

/* Set section, do not recurse into aliases.
   When one wants to change section of symbol and its aliases,
   use set_section.  */
void set_section_for_node (const char *section);

/* Like set_section_for_node, but copying the section name from another
   node.  */
void set_section_for_node (const symtab_node &other);

/* Set initialization priority to PRIORITY.  */
void set_init_priority (priority_type priority);

/* Return the initialization priority.  */
priority_type get_init_priority ();

/* Return availability of NODE when referenced from REF.  */
enum availability get_availability (symtab_node *ref = NULLnullptr);

/* During LTO stream-in this predicate can be used to check whether node
   in question prevails in the linking to save some memory usage.  */
bool prevailing_p (void);

/* Return true if NODE binds to current definition in final executable
   when referenced from REF.  If REF is NULL return conservative value
   for any reference.  */
bool binds_to_current_def_p (symtab_node *ref = NULLnullptr);

/* Make DECL local.  */
void make_decl_local (void);

/* Copy visibility from N.  */
void copy_visibility_from (symtab_node *n);

/* Return desired alignment of the definition.  This is NOT alignment useful
   to access THIS, because THIS may be interposable and DECL_ALIGN should
   be used instead.  It however must be guaranteed when output definition
   of THIS.  */
unsigned int definition_alignment ();

/* Return true if alignment can be increased.  */
bool can_increase_alignment_p ();

/* Increase alignment of symbol to ALIGN.  */
void increase_alignment (unsigned int align);

/* Return true if list contains an alias.  */
bool has_aliases_p (void);

/* Return true when the symbol is real symbol, i.e. it is not inline clone
   or abstract function kept for debug info purposes only.  */
bool real_symbol_p (void);

/* Return true when the symbol needs to be output to the LTO symbol table.  */
bool output_to_lto_symbol_table_p (void);

/* Determine if symbol declaration is needed.  That is, visible to something
   either outside this translation unit, something magic in the system
   configury. This function is used just during symbol creation.  */
bool needed_p (void);

/* Return true if this symbol is a function from the C frontend specified
   directly in RTL form (with "__RTL").  */
bool native_rtl_p () const;

/* Return true when there are references to the node.  */
bool referred_to_p (bool include_self = true);

/* Return true if symbol can be discarded by linker from the binary.
   Assume that symbol is used (so there is no need to take into account
   garbage collecting linkers)

   This can happen for comdats, commons and weaks when they are prevailed
   by other definition at static linking time.  */
inline bool
can_be_discarded_p (void)
{
  return (DECL_EXTERNAL (decl)((contains_struct_check ((decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 404, __FUNCTION__))->decl_common.decl_flag_1)
   || ((get_comdat_group ()
 || DECL_COMMON (decl)((contains_struct_check ((decl), (TS_DECL_WITH_VIS), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 406, __FUNCTION__))->decl_with_vis.common_flag)
 || (DECL_SECTION_NAME (decl)decl_section_name (decl) && DECL_WEAK (decl)((contains_struct_check ((decl), (TS_DECL_WITH_VIS), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 407, __FUNCTION__))->decl_with_vis.weak_flag)))
&& ((resolution != LDPR_PREVAILING_DEF
     && resolution != LDPR_PREVAILING_DEF_IRONLY_EXP)
    || flag_incremental_linkglobal_options.x_flag_incremental_link)
&& resolution != LDPR_PREVAILING_DEF_IRONLY));
}

/* Return true if NODE is local to a particular COMDAT group, and must not
   be named from outside the COMDAT.  This is used for C++ decloned
   constructors.  */
inline bool comdat_local_p (void)
{
  return (same_comdat_group && !TREE_PUBLIC (decl)((decl)->base.public_flag));
}

/* Return true if ONE and TWO are part of the same COMDAT group.  */
inline bool in_same_comdat_group_p (symtab_node *target);

/* Return true if symbol is known to be nonzero.  */
bool nonzero_address ();

/* Return 0 if symbol is known to have different address than S2,
   Return 1 if symbol is known to have same address as S2,
   return 2 otherwise. 

   If MEMORY_ACCESSED is true, assume that both memory pointer to THIS
   and S2 is going to be accessed.  This eliminates the situations when
   either THIS or S2 is NULL and is useful for comparing bases when deciding
   about memory aliasing.  */
int equal_address_to (symtab_node *s2, bool memory_accessed = false);

/* Return true if symbol's address may possibly be compared to other
   symbol's address.  */
bool address_matters_p ();

/* Return true if NODE's address can be compared.  This use properties
   of NODE only and does not look if the address is actually taken in
   interesting way.  For that use ADDRESS_MATTERS_P instead.  */
bool address_can_be_compared_p (void);

/* Return symbol table node associated with DECL, if any,
   and NULL otherwise.  */
static inline symtab_node *get (const_tree decl)
{
  /* Check that we are called for sane type of object - functions
     and static or external variables.  */
  gcc_checking_assert (TREE_CODE (decl) == FUNCTION_DECL((void)(!(((enum tree_code) (decl)->base.code) == FUNCTION_DECL
 || (((enum tree_code) (decl)->base.code) == VAR_DECL &&
 (((decl)->base.static_flag) || ((contains_struct_check ((
decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 455, __FUNCTION__))->decl_common.decl_flag_1) || global_options
.x_in_lto_p))) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 456, __FUNCTION__), 0 : 0))
	 || (TREE_CODE (decl) == VAR_DECL((void)(!(((enum tree_code) (decl)->base.code) == FUNCTION_DECL
 || (((enum tree_code) (decl)->base.code) == VAR_DECL &&
 (((decl)->base.static_flag) || ((contains_struct_check ((
decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 455, __FUNCTION__))->decl_common.decl_flag_1) || global_options
.x_in_lto_p))) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 456, __FUNCTION__), 0 : 0))
	     && (TREE_STATIC (decl) || DECL_EXTERNAL (decl)((void)(!(((enum tree_code) (decl)->base.code) == FUNCTION_DECL
 || (((enum tree_code) (decl)->base.code) == VAR_DECL &&
 (((decl)->base.static_flag) || ((contains_struct_check ((
decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 455, __FUNCTION__))->decl_common.decl_flag_1) || global_options
.x_in_lto_p))) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 456, __FUNCTION__), 0 : 0))
		 || in_lto_p)))((void)(!(((enum tree_code) (decl)->base.code) == FUNCTION_DECL
 || (((enum tree_code) (decl)->base.code) == VAR_DECL &&
 (((decl)->base.static_flag) || ((contains_struct_check ((
decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 455, __FUNCTION__))->decl_common.decl_flag_1) || global_options
.x_in_lto_p))) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 456, __FUNCTION__), 0 : 0));
  /* Check that the mapping is sane - perhaps this check can go away,
     but at the moment frontends tends to corrupt the mapping by calling
     memcpy/memset on the tree nodes.  */
  gcc_checking_assert (!decl->decl_with_vis.symtab_node((void)(!(!decl->decl_with_vis.symtab_node || decl->decl_with_vis
.symtab_node->decl == decl) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 461, __FUNCTION__), 0 : 0))
	 || decl->decl_with_vis.symtab_node->decl == decl)((void)(!(!decl->decl_with_vis.symtab_node || decl->decl_with_vis
.symtab_node->decl == decl) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 461, __FUNCTION__), 0 : 0));
  return decl->decl_with_vis.symtab_node;
}

/* Try to find a symtab node for declaration DECL and if it does not
   exist or if it corresponds to an inline clone, create a new one.  */
static inline symtab_node * get_create (tree node);

/* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
   Return NULL if there's no such node.  */
static symtab_node *get_for_asmname (const_tree asmname);

/* Verify symbol table for internal consistency.  */
static DEBUG_FUNCTION__attribute__ ((__used__)) void verify_symtab_nodes (void);

/* Perform internal consistency checks, if they are enabled.  */
static inline void checking_verify_symtab_nodes (void);

/* Type of the symbol.  */
ENUM_BITFIELD (symtab_type)enum symtab_type type : 8;

/* The symbols resolution.  */
ENUM_BITFIELD (ld_plugin_symbol_resolution)enum ld_plugin_symbol_resolution resolution : 8;

/*** Flags representing the symbol type.  ***/

/* True when symbol corresponds to a definition in current unit.
   set via finalize_function or finalize_decl  */
unsigned definition : 1;
/* True when symbol is an alias.
   Set by assemble_alias.  */
unsigned alias : 1;
/* When true the alias is translated into its target symbol either by GCC
   or assembler (it also may just be a duplicate declaration of the same
   linker name).

   Currently transparent aliases come in three different flavors
     - aliases having the same assembler name as their target (aka duplicated
declarations). In this case the assembler names compare via
assembler_names_equal_p and weakref is false
     - aliases that are renamed at a time being output to final file
by varasm.c. For those DECL_ASSEMBLER_NAME have
IDENTIFIER_TRANSPARENT_ALIAS set and thus also their assembler
name must be unique.
Weakrefs belong to this category when we target assembler without
.weakref directive.
     - weakrefs that are renamed by assembler via .weakref directive.
In this case the alias may or may not be definition (depending if
target declaration was seen by the compiler), weakref is set.
Unless we are before renaming statics, assembler names are different.

   Given that we now support duplicate declarations, the second option is
   redundant and will be removed.  */
unsigned transparent_alias : 1;
/* True when alias is a weakref.  */
unsigned weakref : 1;
/* C++ frontend produce same body aliases and extra name aliases for
   virtual functions and vtables that are obviously equivalent.
   Those aliases are bit special, especially because C++ frontend
   visibility code is so ugly it cannot get them right at first time
   and their visibility needs to be copied from their "masters" at
   the end of parsing.  */
unsigned cpp_implicit_alias : 1;
/* The alias is a symbol version.  */
unsigned symver : 1;
/* Set once the definition was analyzed.  The list of references and
   other properties are built during analysis.  */
unsigned analyzed : 1;
/* Set for write-only variables.  */
unsigned writeonly : 1;
/* Visibility of symbol was used for further optimization; do not
   permit further changes.  */
unsigned refuse_visibility_changes : 1;

/*** Visibility and linkage flags.  ***/

/* Set when function is visible by other units.  */
unsigned externally_visible : 1;
/* Don't reorder to other symbols having this set.  */
unsigned no_reorder : 1;
/* The symbol will be assumed to be used in an invisible way (like
   by an toplevel asm statement).  */
unsigned force_output : 1;
/* Like FORCE_OUTPUT, but in the case it is ABI requiring the symbol to be
   exported.  Unlike FORCE_OUTPUT this flag gets cleared to symbols promoted
   to static and it does not inhibit optimization.  */
unsigned forced_by_abi : 1;
/* True when the name is known to be unique and thus it does not need mangling.  */
unsigned unique_name : 1;
/* Specify whether the section was set by user or by
   compiler via -ffunction-sections.  */
unsigned implicit_section : 1;
/* True when body and other characteristics have been removed by
   symtab_remove_unreachable_nodes. */
unsigned body_removed : 1;

/*** WHOPR Partitioning flags.
     These flags are used at ltrans stage when only part of the callgraph is
     available. ***/

/* Set when variable is used from other LTRANS partition.  */
unsigned used_from_other_partition : 1;
/* Set when function is available in the other LTRANS partition.
   During WPA output it is used to mark nodes that are present in
   multiple partitions.  */
unsigned in_other_partition : 1;



/*** other flags.  ***/

/* Set when symbol has address taken. */
unsigned address_taken : 1;
/* Set when init priority is set.  */
unsigned in_init_priority_hash : 1;

/* Set when symbol needs to be streamed into LTO bytecode for LTO, or in case
   of offloading, for separate compilation for a different target.  */
unsigned need_lto_streaming : 1;

/* Set when symbol can be streamed into bytecode for offloading.  */
unsigned offloadable : 1;

/* Set when symbol is an IFUNC resolver.  */
unsigned ifunc_resolver : 1;


/* Ordering of all symtab entries.  */
int order;

/* Declaration representing the symbol.  */
tree decl;

/* Linked list of symbol table entries starting with symtab_nodes.  */
symtab_node *next;
symtab_node *previous;

/* Linked list of symbols with the same asm name.  There may be multiple
   entries for single symbol name during LTO, because symbols are renamed
   only after partitioning.

   Because inline clones are kept in the assembler name has, they also produce
   duplicate entries.

   There are also several long standing bugs where frontends and builtin
   code produce duplicated decls.  */
symtab_node *next_sharing_asm_name;
symtab_node *previous_sharing_asm_name;

/* Circular list of nodes in the same comdat group if non-NULL.  */
symtab_node *same_comdat_group;

/* Vectors of referring and referenced entities.  */
ipa_ref_list GTY((skip)) ref_list;

/* Alias target. May be either DECL pointer or ASSEMBLER_NAME pointer
   depending to what was known to frontend on the creation time.
   Once alias is resolved, this pointer become NULL.  */
tree alias_target;

/* File stream where this node is being written to.  */
struct lto_file_decl_data * lto_file_data;

PTRvoid * GTY ((skip)) aux;

/* Comdat group the symbol is in.  Can be private if GGC allowed that.  */
tree x_comdat_group;

/* Section name. Again can be private, if allowed.  */
section_hash_entry *x_section;

632protected:
/* Dump base fields of symtab nodes to F.  Not to be used directly.  */
void dump_base (FILE *);

/* Verify common part of symtab node.  */
bool DEBUG_FUNCTION__attribute__ ((__used__)) verify_base (void);

/* Remove node from symbol table.  This function is not used directly, but via
   cgraph/varpool node removal routines.  */
void unregister (struct clone_info *);

/* Return the initialization and finalization priority information for
   DECL.  If there is no previous priority information, a freshly
   allocated structure is returned.  */
struct symbol_priority_map *priority_info (void);

/* Worker for call_for_symbol_and_aliases_1.  */
bool call_for_symbol_and_aliases_1 (bool (*callback) (symtab_node *, void *),
		      void *data,
		      bool include_overwrite);
652private:
/* Workers for set_section.  */
static bool set_section_from_string (symtab_node *n, void *s);
static bool set_section_from_node (symtab_node *n, void *o);

/* Worker for symtab_resolve_alias.  */
static bool set_implicit_section (symtab_node *n, void *);

/* Worker searching noninterposable alias.  */
static bool noninterposable_alias (symtab_node *node, void *data);

/* Worker for ultimate_alias_target.  */
symtab_node *ultimate_alias_target_1 (enum availability *avail = NULLnullptr,
			symtab_node *ref = NULLnullptr);

/* Get dump name with normal or assembly name.  */
const char *get_dump_name (bool asm_name_p) const;
669};

671inline void
672symtab_node::checking_verify_symtab_nodes (void)
673{
if (flag_checkingglobal_options.x_flag_checking)
  symtab_node::verify_symtab_nodes ();
676}

678/* Walk all aliases for NODE.  */
679#define FOR_EACH_ALIAS(NODE, ALIAS)for (unsigned ALIAS_iter_ = 0; (NODE)->iterate_direct_aliases
 (ALIAS_iter_, ALIAS); ALIAS_iter_++)				\
for (unsigned ALIAS##_iter_ = 0;				\
     (NODE)->iterate_direct_aliases (ALIAS##_iter_, ALIAS);	\
     ALIAS##_iter_++)

684/* This is the information that is put into the cgraph local structure
 to recover a function.  */
686struct lto_file_decl_data;

688extern const char * const cgraph_availability_names[];
689extern const char * const ld_plugin_symbol_resolution_names[];
690extern const char * const tls_model_names[];

692/* Represent which DECL tree (or reference to such tree)
 will be replaced by another tree while versioning.  */
694struct GTY(()) ipa_replace_map
695{
/* The new (replacing) tree.  */
tree new_tree;
/* Parameter number to replace, when old_tree is NULL.  */
int parm_num;
700};

702enum cgraph_simd_clone_arg_type
703{
SIMD_CLONE_ARG_TYPE_VECTOR,
SIMD_CLONE_ARG_TYPE_UNIFORM,
/* These are only for integer/pointer arguments passed by value.  */
SIMD_CLONE_ARG_TYPE_LINEAR_CONSTANT_STEP,
SIMD_CLONE_ARG_TYPE_LINEAR_VARIABLE_STEP,
/* These 6 are only for reference type arguments or arguments passed
   by reference.  */
SIMD_CLONE_ARG_TYPE_LINEAR_REF_CONSTANT_STEP,
SIMD_CLONE_ARG_TYPE_LINEAR_REF_VARIABLE_STEP,
SIMD_CLONE_ARG_TYPE_LINEAR_UVAL_CONSTANT_STEP,
SIMD_CLONE_ARG_TYPE_LINEAR_UVAL_VARIABLE_STEP,
SIMD_CLONE_ARG_TYPE_LINEAR_VAL_CONSTANT_STEP,
SIMD_CLONE_ARG_TYPE_LINEAR_VAL_VARIABLE_STEP,
SIMD_CLONE_ARG_TYPE_MASK
718};

720/* Function arguments in the original function of a SIMD clone.
 Supplementary data for `struct simd_clone'.  */

723struct GTY(()) cgraph_simd_clone_arg {
/* Original function argument as it originally existed in
   DECL_ARGUMENTS.  */
tree orig_arg;

/* orig_arg's function (or for extern functions type from
   TYPE_ARG_TYPES).  */
tree orig_type;

/* If argument is a vector, this holds the vector version of
   orig_arg that after adjusting the argument types will live in
   DECL_ARGUMENTS.  Otherwise, this is NULL.

   This basically holds:
     vector(simdlen) __typeof__(orig_arg) new_arg.  */
tree vector_arg;

/* vector_arg's type (or for extern functions new vector type.  */
tree vector_type;

/* If argument is a vector, this holds the array where the simd
   argument is held while executing the simd clone function.  This
   is a local variable in the cloned function.  Its content is
   copied from vector_arg upon entry to the clone.

   This basically holds:
     __typeof__(orig_arg) simd_array[simdlen].  */
tree simd_array;

/* A SIMD clone's argument can be either linear (constant or
   variable), uniform, or vector.  */
enum cgraph_simd_clone_arg_type arg_type;

/* For arg_type SIMD_CLONE_ARG_TYPE_LINEAR_*CONSTANT_STEP this is
   the constant linear step, if arg_type is
   SIMD_CLONE_ARG_TYPE_LINEAR_*VARIABLE_STEP, this is index of
   the uniform argument holding the step, otherwise 0.  */
HOST_WIDE_INTlong linear_step;

/* Variable alignment if available, otherwise 0.  */
unsigned int alignment;
764};

766/* Specific data for a SIMD function clone.  */

768struct GTY(()) cgraph_simd_clone {
/* Number of words in the SIMD lane associated with this clone.  */
poly_uint64 simdlen;

/* Number of annotated function arguments in `args'.  This is
   usually the number of named arguments in FNDECL.  */
unsigned int nargs;

/* Max hardware vector size in bits for integral vectors.  */
poly_uint64 vecsize_int;

/* Max hardware vector size in bits for floating point vectors.  */
poly_uint64 vecsize_float;

/* Machine mode of the mask argument(s), if they are to be passed
   as bitmasks in integer argument(s).  VOIDmode if masks are passed
   as vectors of characteristic type.  */
machine_mode mask_mode;

/* The mangling character for a given vector size.  This is used
   to determine the ISA mangling bit as specified in the Intel
   Vector ABI.  */
unsigned char vecsize_mangle;

/* True if this is the masked, in-branch version of the clone,
   otherwise false.  */
unsigned int inbranch : 1;

/* Doubly linked list of SIMD clones.  */
cgraph_node *prev_clone, *next_clone;

/* Original cgraph node the SIMD clones were created for.  */
cgraph_node *origin;

/* Annotated function arguments for the original function.  */
cgraph_simd_clone_arg GTY((length ("%h.nargs"))) args[1];
804};

806/* Function Multiversioning info.  */
807struct GTY((for_user)) cgraph_function_version_info {
/* The cgraph_node for which the function version info is stored.  */
cgraph_node *this_node;
/* Chains all the semantically identical function versions.  The
   first function in this chain is the version_info node of the
   default function.  */
cgraph_function_version_info *prev;
/* If this version node corresponds to a dispatcher for function
   versions, this points to the version info node of the default
   function, the first node in the chain.  */
cgraph_function_version_info *next;
/* If this node corresponds to a function version, this points
   to the dispatcher function decl, which is the function that must
   be called to execute the right function version at run-time.

   If this cgraph node is a dispatcher (if dispatcher_function is
   true, in the cgraph_node struct) for function versions, this
   points to resolver function, which holds the function body of the
   dispatcher. The dispatcher decl is an alias to the resolver
   function decl.  */
tree dispatcher_resolver;
828};

830#define DEFCIFCODE(code, type, string)CIF_code,	CIF_ ## code,
831/* Reasons for inlining failures.  */

833enum cgraph_inline_failed_t {
834#include "cif-code.def"
CIF_N_REASONS
836};

838enum cgraph_inline_failed_type_t
839{
CIF_FINAL_NORMAL = 0,
CIF_FINAL_ERROR
842};

844struct cgraph_edge;

846struct cgraph_edge_hasher : ggc_ptr_hash<cgraph_edge>
847{
typedef gimple *compare_type;

static hashval_t hash (cgraph_edge *);
static hashval_t hash (gimple *);
static bool equal (cgraph_edge *, gimple *);
853};

855/* The cgraph data structure.
 Each function decl has assigned cgraph_node listing callees and callers.  */

858struct GTY((tag ("SYMTAB_FUNCTION"))) cgraph_node : public symtab_node
859{
friend class symbol_table;

/* Constructor.  */
explicit cgraph_node (int uid)
  : symtab_node (SYMTAB_FUNCTION), callees (NULLnullptr), callers (NULLnullptr),
    indirect_calls (NULLnullptr),
    next_sibling_clone (NULLnullptr), prev_sibling_clone (NULLnullptr), clones (NULLnullptr),
    clone_of (NULLnullptr), call_site_hash (NULLnullptr), former_clone_of (NULLnullptr),
    simdclone (NULLnullptr), simd_clones (NULLnullptr), ipa_transforms_to_apply (vNULL),
    inlined_to (NULLnullptr), rtl (NULLnullptr),
    count (profile_count::uninitialized ()),
    count_materialization_scale (REG_BR_PROB_BASE10000), profile_id (0),
    unit_id (0), tp_first_run (0), thunk (false),
    used_as_abstract_origin (false),
    lowered (false), process (false), frequency (NODE_FREQUENCY_NORMAL),
    only_called_at_startup (false), only_called_at_exit (false),
    tm_clone (false), dispatcher_function (false), calls_comdat_local (false),
    icf_merged (false), nonfreeing_fn (false), merged_comdat (false),
    merged_extern_inline (false), parallelized_function (false),
    split_part (false), indirect_call_target (false), local (false),
    versionable (false), can_change_signature (false),
    redefined_extern_inline (false), tm_may_enter_irr (false),
    ipcp_clone (false), declare_variant_alt (false),
    calls_declare_variant_alt (false), m_uid (uid), m_summary_id (-1)
{}

/* Remove the node from cgraph and all inline clones inlined into it.
   Skip however removal of FORBIDDEN_NODE and return true if it needs to be
   removed.  This allows to call the function from outer loop walking clone
   tree.  */
bool remove_symbol_and_inline_clones (cgraph_node *forbidden_node = NULLnullptr);

/* Record all references from cgraph_node that are taken
   in statement STMT.  */
void record_stmt_references (gimple *stmt);

/* Like cgraph_set_call_stmt but walk the clone tree and update all
   clones sharing the same function body.
   When WHOLE_SPECULATIVE_EDGES is true, all three components of
   speculative edge gets updated.  Otherwise we update only direct
   call.  */
void set_call_stmt_including_clones (gimple *old_stmt, gcall *new_stmt,
		       bool update_speculative = true);

/* Walk the alias chain to return the function cgraph_node is alias of.
   Walk through thunk, too.
   When AVAILABILITY is non-NULL, get minimal availability in the chain. 
   When REF is non-NULL, assume that reference happens in symbol REF
   when determining the availability.  */
cgraph_node *function_symbol (enum availability *avail = NULLnullptr,
		struct symtab_node *ref = NULLnullptr);

/* Walk the alias chain to return the function cgraph_node is alias of.
   Walk through non virtual thunks, too.  Thus we return either a function
   or a virtual thunk node.
   When AVAILABILITY is non-NULL, get minimal availability in the chain.  
   When REF is non-NULL, assume that reference happens in symbol REF
   when determining the availability.  */
cgraph_node *function_or_virtual_thunk_symbol
		(enum availability *avail = NULLnullptr,
		 struct symtab_node *ref = NULLnullptr);

/* Create node representing clone of N executed COUNT times.  Decrease
   the execution counts from original node too.
   The new clone will have decl set to DECL that may or may not be the same
   as decl of N.

   When UPDATE_ORIGINAL is true, the counts are subtracted from the original
   function's profile to reflect the fact that part of execution is handled
   by node.
   When CALL_DUPLICATION_HOOK is true, the ipa passes are acknowledged about
   the new clone. Otherwise the caller is responsible for doing so later.

   If the new node is being inlined into another one, NEW_INLINED_TO should be
   the outline function the new one is (even indirectly) inlined to.
   All hooks will see this in node's inlined_to, when invoked.
   Can be NULL if the node is not inlined.  SUFFIX is string that is appended
   to the original name.  */
cgraph_node *create_clone (tree decl, profile_count count,
	     bool update_original,
	     vec<cgraph_edge *> redirect_callers,
	     bool call_duplication_hook,
	     cgraph_node *new_inlined_to,
	     ipa_param_adjustments *param_adjustments,
	     const char *suffix = NULLnullptr);

/* Create callgraph node clone with new declaration.  The actual body will be
   copied later at compilation stage.  The name of the new clone will be
   constructed from the name of the original node, SUFFIX and NUM_SUFFIX.  */
cgraph_node *create_virtual_clone (vec<cgraph_edge *> redirect_callers,
		     vec<ipa_replace_map *, va_gc> *tree_map,
		     ipa_param_adjustments *param_adjustments,
		     const char * suffix, unsigned num_suffix);

/* Remove the node from the tree of virtual and inline clones and make it a
   standalone node - not a clone any more.  */
void remove_from_clone_tree ();

/* cgraph node being removed from symbol table; see if its entry can be
 replaced by other inline clone.  */
cgraph_node *find_replacement (struct clone_info *);

/* Create a new cgraph node which is the new version of
   callgraph node.  REDIRECT_CALLERS holds the callers
   edges which should be redirected to point to
   NEW_VERSION.  ALL the callees edges of the node
   are cloned to the new version node.  Return the new
   version node.

   If non-NULL BLOCK_TO_COPY determine what basic blocks
   was copied to prevent duplications of calls that are dead
   in the clone.

   SUFFIX is string that is appended to the original name.  */

cgraph_node *create_version_clone (tree new_decl,
		    vec<cgraph_edge *> redirect_callers,
		    bitmap bbs_to_copy,
		    const char *suffix = NULLnullptr);

/* Perform function versioning.
   Function versioning includes copying of the tree and
   a callgraph update (creating a new cgraph node and updating
   its callees and callers).

   REDIRECT_CALLERS varray includes the edges to be redirected
   to the new version.

   TREE_MAP is a mapping of tree nodes we want to replace with
   new ones (according to results of prior analysis).

   If non-NULL ARGS_TO_SKIP determine function parameters to remove
   from new version.
   If SKIP_RETURN is true, the new version will return void.
   If non-NULL BLOCK_TO_COPY determine what basic blocks to copy.
   If non_NULL NEW_ENTRY determine new entry BB of the clone.

   If TARGET_ATTRIBUTES is non-null, when creating a new declaration,
   add the attributes to DECL_ATTRIBUTES.  And call valid_attribute_p
   that will promote value of the attribute DECL_FUNCTION_SPECIFIC_TARGET
   of the declaration.

   Return the new version's cgraph node.  */
cgraph_node *create_version_clone_with_body
  (vec<cgraph_edge *> redirect_callers,
   vec<ipa_replace_map *, va_gc> *tree_map,
   ipa_param_adjustments *param_adjustments,
   bitmap bbs_to_copy, basic_block new_entry_block, const char *clone_name,
   tree target_attributes = NULL_TREE(tree) nullptr);

/* Insert a new cgraph_function_version_info node into cgraph_fnver_htab
   corresponding to cgraph_node.  */
cgraph_function_version_info *insert_new_function_version (void);

/* Get the cgraph_function_version_info node corresponding to node.  */
cgraph_function_version_info *function_version (void);

/* Discover all functions and variables that are trivially needed, analyze
   them as well as all functions and variables referred by them  */
void analyze (void);

/* Add thunk alias into callgraph.  The alias declaration is ALIAS and it
   aliases DECL with an adjustments made into the first parameter.
   See comments in struct symtab-thunks.h for detail on the parameters.  */
cgraph_node * create_thunk (tree alias, tree, bool this_adjusting,
	      HOST_WIDE_INTlong fixed_offset,
	      HOST_WIDE_INTlong virtual_value,
	      HOST_WIDE_INTlong indirect_offset,
	      tree virtual_offset,
	      tree real_alias);


/* Return node that alias is aliasing.  */
inline cgraph_node *get_alias_target (void);

/* Given function symbol, walk the alias chain to return the function node
   is alias of. Do not walk through thunks.
   When AVAILABILITY is non-NULL, get minimal availability in the chain.
   When REF is non-NULL, assume that reference happens in symbol REF
   when determining the availability.  */

cgraph_node *ultimate_alias_target (availability *availability = NULLnullptr,
		      symtab_node *ref = NULLnullptr);

/*  Call expand_thunk on all callers that are thunks and analyze those
    nodes that were expanded.  */
void expand_all_artificial_thunks ();

/* Assemble thunks and aliases associated to node.  */
void assemble_thunks_and_aliases (void);

/* Expand function specified by node.  */
void expand (void);

/* As an GCC extension we allow redefinition of the function.  The
   semantics when both copies of bodies differ is not well defined.
   We replace the old body with new body so in unit at a time mode
   we always use new body, while in normal mode we may end up with
   old body inlined into some functions and new body expanded and
   inlined in others.  */
void reset (void);

/* Creates a wrapper from cgraph_node to TARGET node. Thunk is used for this
   kind of wrapper method.  */
void create_wrapper (cgraph_node *target);

/* Verify cgraph nodes of the cgraph node.  */
void DEBUG_FUNCTION__attribute__ ((__used__)) verify_node (void);

/* Remove function from symbol table.  */
void remove (void);

/* Dump call graph node to file F.  */
void dump (FILE *f);

/* Dump call graph node to file F.  */
void dump_graphviz (FILE *f);

/* Dump call graph node to stderr.  */
void DEBUG_FUNCTION__attribute__ ((__used__)) debug (void);

/* When doing LTO, read cgraph_node's body from disk if it is not already
   present.  */
bool get_untransformed_body ();

/* Prepare function body.  When doing LTO, read cgraph_node's body from disk 
   if it is not already present.  When some IPA transformations are scheduled,
   apply them.  */
bool get_body ();

void materialize_clone (void);

/* Release memory used to represent body of function.
   Use this only for functions that are released before being translated to
   target code (i.e. RTL).  Functions that are compiled to RTL and beyond
   are free'd in final.c via free_after_compilation().  */
void release_body (bool keep_arguments = false);

/* Return the DECL_STRUCT_FUNCTION of the function.  */
struct function *get_fun () const;

/* Bring cgraph node local.  */
void make_local (void);

/* Likewise indicate that a node is having address taken.  */
void mark_address_taken (void);

/* Set finalization priority to PRIORITY.  */
void set_fini_priority (priority_type priority);

/* Return the finalization priority.  */
priority_type get_fini_priority (void);

/* Create edge from a given function to CALLEE in the cgraph.  */
cgraph_edge *create_edge (cgraph_node *callee,
	    gcall *call_stmt, profile_count count,
	    bool cloning_p = false);

/* Create an indirect edge with a yet-undetermined callee where the call
   statement destination is a formal parameter of the caller with index
   PARAM_INDEX. */
cgraph_edge *create_indirect_edge (gcall *call_stmt, int ecf_flags,
		     profile_count count,
		     bool cloning_p = false);

/* Like cgraph_create_edge walk the clone tree and update all clones sharing
 same function body.  If clones already have edge for OLD_STMT; only
 update the edge same way as cgraph_set_call_stmt_including_clones does.  */
void create_edge_including_clones (cgraph_node *callee,
		     gimple *old_stmt, gcall *stmt,
		     profile_count count,
		     cgraph_inline_failed_t reason);

/* Return the callgraph edge representing the GIMPLE_CALL statement
   CALL_STMT.  */
cgraph_edge *get_edge (gimple *call_stmt);

/* Collect all callers of cgraph_node and its aliases that are known to lead
   to NODE (i.e. are not overwritable) and that are not thunks.  */
vec<cgraph_edge *> collect_callers (void);

/* Remove all callers from the node.  */
void remove_callers (void);

/* Remove all callees from the node.  */
void remove_callees (void);

/* Return function availability.  See cgraph.h for description of individual
   return values.  */
enum availability get_availability (symtab_node *ref = NULLnullptr);

/* Set TREE_NOTHROW on cgraph_node's decl and on aliases of the node
   if any to NOTHROW.  */
bool set_nothrow_flag (bool nothrow);

/* SET DECL_IS_MALLOC on cgraph_node's decl and on aliases of the node
   if any.  */
bool set_malloc_flag (bool malloc_p);

/* If SET_CONST is true, mark function, aliases and thunks to be ECF_CONST.
  If SET_CONST if false, clear the flag.

  When setting the flag be careful about possible interposition and
  do not set the flag for functions that can be interposed and set pure
  flag for functions that can bind to other definition. 

  Return true if any change was done. */

bool set_const_flag (bool set_const, bool looping);

/* Set DECL_PURE_P on cgraph_node's decl and on aliases of the node
   if any to PURE.

   When setting the flag, be careful about possible interposition.
   Return true if any change was done. */

bool set_pure_flag (bool pure, bool looping);

/* Call callback on function and aliases associated to the function.
   When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
   skipped. */

bool call_for_symbol_and_aliases (bool (*callback) (cgraph_node *,
				      void *),
		    void *data, bool include_overwritable);

/* Call callback on cgraph_node, thunks and aliases associated to NODE.
   When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
   skipped.  When EXCLUDE_VIRTUAL_THUNKS is true, virtual thunks are
   skipped.  */
bool call_for_symbol_thunks_and_aliases (bool (*callback) (cgraph_node *node,
					     void *data),
			   void *data,
			   bool include_overwritable,
			   bool exclude_virtual_thunks = false);

/* Likewise indicate that a node is needed, i.e. reachable via some
   external means.  */
inline void mark_force_output (void);

/* Return true when function can be marked local.  */
bool local_p (void);

/* Return true if cgraph_node can be made local for API change.
   Extern inline functions and C++ COMDAT functions can be made local
   at the expense of possible code size growth if function is used in multiple
   compilation units.  */
bool can_be_local_p (void);

/* Return true when cgraph_node cannot return or throw and thus
   it is safe to ignore its side effects for IPA analysis.  */
bool cannot_return_p (void);

/* Return true when function cgraph_node and all its aliases are only called
   directly.
   i.e. it is not externally visible, address was not taken and
   it is not used in any other non-standard way.  */
bool only_called_directly_p (void);

/* Return true when function is only called directly or it has alias.
   i.e. it is not externally visible, address was not taken and
   it is not used in any other non-standard way.  */
inline bool only_called_directly_or_aliased_p (void);

/* Return true when function cgraph_node can be expected to be removed
   from program when direct calls in this compilation unit are removed.

   As a special case COMDAT functions are
   cgraph_can_remove_if_no_direct_calls_p while the are not
   cgraph_only_called_directly_p (it is possible they are called from other
   unit)

   This function behaves as cgraph_only_called_directly_p because eliminating
   all uses of COMDAT function does not make it necessarily disappear from
   the program unless we are compiling whole program or we do LTO.  In this
   case we know we win since dynamic linking will not really discard the
   linkonce section.  

   If WILL_INLINE is true, assume that function will be inlined into all the
   direct calls.  */
bool will_be_removed_from_program_if_no_direct_calls_p
(bool will_inline = false);

/* Return true when function can be removed from callgraph
   if all direct calls and references are eliminated.  The function does
   not take into account comdat groups.  */
bool can_remove_if_no_direct_calls_and_refs_p (void);

/* Return true when function cgraph_node and its aliases can be removed from
   callgraph if all direct calls are eliminated. 
   If WILL_INLINE is true, assume that function will be inlined into all the
   direct calls.  */
bool can_remove_if_no_direct_calls_p (bool will_inline = false);

/* Return true when callgraph node is a function with Gimple body defined
   in current unit.  Functions can also be define externally or they
   can be thunks with no Gimple representation.

   Note that at WPA stage, the function body may not be present in memory.  */
inline bool has_gimple_body_p (void);

/* Return true if this node represents a former, i.e. an expanded, thunk.  */
bool former_thunk_p (void);

/* Check if function calls comdat local.  This is used to recompute
   calls_comdat_local flag after function transformations.  */
bool check_calls_comdat_local_p ();

/* Return true if function should be optimized for size.  */
enum optimize_size_level optimize_for_size_p (void);

/* Dump the callgraph to file F.  */
static void dump_cgraph (FILE *f);

/* Dump the call graph to stderr.  */
static inline
void debug_cgraph (void)
{
  dump_cgraph (stderrstderr);
}

/* Get unique identifier of the node.  */
inline int get_uid ()
{
  return m_uid;
}

/* Get summary id of the node.  */
inline int get_summary_id ()
{
  return m_summary_id;
}

/* Record that DECL1 and DECL2 are semantically identical function
   versions.  */
static void record_function_versions (tree decl1, tree decl2);

/* Remove the cgraph_function_version_info and cgraph_node for DECL.  This
   DECL is a duplicate declaration.  */
static void delete_function_version_by_decl (tree decl);

/* Add the function FNDECL to the call graph.
   Unlike finalize_function, this function is intended to be used
   by middle end and allows insertion of new function at arbitrary point
   of compilation.  The function can be either in high, low or SSA form
   GIMPLE.

   The function is assumed to be reachable and have address taken (so no
   API breaking optimizations are performed on it).

   Main work done by this function is to enqueue the function for later
   processing to avoid need the passes to be re-entrant.  */
static void add_new_function (tree fndecl, bool lowered);

/* Return callgraph node for given symbol and check it is a function. */
static inline cgraph_node *get (const_tree decl)
{
  gcc_checking_assert (TREE_CODE (decl) == FUNCTION_DECL)((void)(!(((enum tree_code) (decl)->base.code) == FUNCTION_DECL
) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 1317, __FUNCTION__), 0 : 0));
  return dyn_cast <cgraph_node *> (symtab_node::get (decl));
}

/* DECL has been parsed.  Take it, queue it, compile it at the whim of the
   logic in effect.  If NO_COLLECT is true, then our caller cannot stand to
   have the garbage collector run at the moment.  We would need to either
   create a new GC context, or just not compile right now.  */
static void finalize_function (tree, bool);

/* Return cgraph node assigned to DECL.  Create new one when needed.  */
static cgraph_node * create (tree decl);

/* Try to find a call graph node for declaration DECL and if it does not
   exist or if it corresponds to an inline clone, create a new one.  */
static cgraph_node * get_create (tree);

/* Return local info for the compiled function.  */
static cgraph_node *local_info_node (tree decl);

/* Return RTL info for the compiled function.  */
static struct cgraph_rtl_info *rtl_info (const_tree);

/* Return the cgraph node that has ASMNAME for its DECL_ASSEMBLER_NAME.
   Return NULL if there's no such node.  */
static cgraph_node *get_for_asmname (tree asmname);

/* Attempt to mark ALIAS as an alias to DECL.  Return alias node if
   successful and NULL otherwise.
   Same body aliases are output whenever the body of DECL is output,
   and cgraph_node::get (ALIAS) transparently
   returns cgraph_node::get (DECL).  */
static cgraph_node * create_same_body_alias (tree alias, tree decl);

/* Verify whole cgraph structure.  */
static void DEBUG_FUNCTION__attribute__ ((__used__)) verify_cgraph_nodes (void);

/* Verify cgraph, if consistency checking is enabled.  */
static inline void checking_verify_cgraph_nodes (void);

/* Worker to bring NODE local.  */
static bool make_local (cgraph_node *node, void *);

/* Mark ALIAS as an alias to DECL.  DECL_NODE is cgraph node representing
   the function body is associated
   with (not necessarily cgraph_node (DECL).  */
static cgraph_node *create_alias (tree alias, tree target);

/* Return true if NODE has thunk.  */
static bool has_thunk_p (cgraph_node *node, void *);

cgraph_edge *callees;
cgraph_edge *callers;
/* List of edges representing indirect calls with a yet undetermined
   callee.  */
cgraph_edge *indirect_calls;
cgraph_node *next_sibling_clone;
cgraph_node *prev_sibling_clone;
cgraph_node *clones;
cgraph_node *clone_of;
/* For functions with many calls sites it holds map from call expression
   to the edge to speed up cgraph_edge function.  */
hash_table<cgraph_edge_hasher> *GTY(()) call_site_hash;
/* Declaration node used to be clone of. */
tree former_clone_of;

/* If this is a SIMD clone, this points to the SIMD specific
   information for it.  */
cgraph_simd_clone *simdclone;
/* If this function has SIMD clones, this points to the first clone.  */
cgraph_node *simd_clones;

/* Interprocedural passes scheduled to have their transform functions
   applied next time we execute local pass on them.  We maintain it
   per-function in order to allow IPA passes to introduce new functions.  */
vec<ipa_opt_pass, va_heap, vl_ptr> GTY((skip)) ipa_transforms_to_apply;

/* For inline clones this points to the function they will be
   inlined into.  */
cgraph_node *inlined_to;

struct cgraph_rtl_info *rtl;

/* Expected number of executions: calculated in profile.c.  */
profile_count count;
/* How to scale counts at materialization time; used to merge
   LTO units with different number of profile runs.  */
int count_materialization_scale;
/* ID assigned by the profiling.  */
unsigned int profile_id;
/* ID of the translation unit.  */
int unit_id;
/* Time profiler: first run of function.  */
int tp_first_run;

/* True when symbol is a thunk.  */
unsigned thunk : 1;
/* Set when decl is an abstract function pointed to by the
   ABSTRACT_DECL_ORIGIN of a reachable function.  */
unsigned used_as_abstract_origin : 1;
/* Set once the function is lowered (i.e. its CFG is built).  */
unsigned lowered : 1;
/* Set once the function has been instantiated and its callee
   lists created.  */
unsigned process : 1;
/* How commonly executed the node is.  Initialized during branch
   probabilities pass.  */
ENUM_BITFIELD (node_frequency)enum node_frequency frequency : 2;
/* True when function can only be called at startup (from static ctor).  */
unsigned only_called_at_startup : 1;
/* True when function can only be called at startup (from static dtor).  */
unsigned only_called_at_exit : 1;
/* True when function is the transactional clone of a function which
   is called only from inside transactions.  */
/* ?? We should be able to remove this.  We have enough bits in
   cgraph to calculate it.  */
unsigned tm_clone : 1;
/* True if this decl is a dispatcher for function versions.  */
unsigned dispatcher_function : 1;
/* True if this decl calls a COMDAT-local function.  This is set up in
   compute_fn_summary and inline_call.  */
unsigned calls_comdat_local : 1;
/* True if node has been created by merge operation in IPA-ICF.  */
unsigned icf_merged: 1;
/* True if call to node can't result in a call to free, munmap or
   other operation that could make previously non-trapping memory
   accesses trapping.  */
unsigned nonfreeing_fn : 1;
/* True if there was multiple COMDAT bodies merged by lto-symtab.  */
unsigned merged_comdat : 1;
/* True if this def was merged with extern inlines.  */
unsigned merged_extern_inline : 1;
/* True if function was created to be executed in parallel.  */
unsigned parallelized_function : 1;
/* True if function is part split out by ipa-split.  */
unsigned split_part : 1;
/* True if the function appears as possible target of indirect call.  */
unsigned indirect_call_target : 1;
/* Set when function is visible in current compilation unit only and
   its address is never taken.  */
unsigned local : 1;
/* False when there is something makes versioning impossible.  */
unsigned versionable : 1;
/* False when function calling convention and signature cannot be changed.
   This is the case when __builtin_apply_args is used.  */
unsigned can_change_signature : 1;
/* True when the function has been originally extern inline, but it is
   redefined now.  */
unsigned redefined_extern_inline : 1;
/* True if the function may enter serial irrevocable mode.  */
unsigned tm_may_enter_irr : 1;
/* True if this was a clone created by ipa-cp.  */
unsigned ipcp_clone : 1;
/* True if this is the deferred declare variant resolution artificial
   function.  */
unsigned declare_variant_alt : 1;
/* True if the function calls declare_variant_alt functions.  */
unsigned calls_declare_variant_alt : 1;

1476private:
/* Unique id of the node.  */
int m_uid;

/* Summary id that is recycled.  */
int m_summary_id;

/* Worker for call_for_symbol_and_aliases.  */
bool call_for_symbol_and_aliases_1 (bool (*callback) (cgraph_node *,
				        void *),
		      void *data, bool include_overwritable);
1487};

1489/* A cgraph node set is a collection of cgraph nodes.  A cgraph node
 can appear in multiple sets.  */
1491struct cgraph_node_set_def
1492{
hash_map<cgraph_node *, size_t> *map;
vec<cgraph_node *> nodes;
1495};

1497typedef cgraph_node_set_def *cgraph_node_set;
1498typedef struct varpool_node_set_def *varpool_node_set;

1500struct varpool_node;

1502/* A varpool node set is a collection of varpool nodes.  A varpool node
 can appear in multiple sets.  */
1504struct varpool_node_set_def
1505{
hash_map<varpool_node *, size_t> * map;
vec<varpool_node *> nodes;
1508};

1510/* Iterator structure for cgraph node sets.  */
1511struct cgraph_node_set_iterator
1512{
cgraph_node_set set;
unsigned index;
1515};

1517/* Iterator structure for varpool node sets.  */
1518struct varpool_node_set_iterator
1519{
varpool_node_set set;
unsigned index;
1522};

1524/* Context of polymorphic call. It represent information about the type of
 instance that may reach the call.  This is used by ipa-devirt walkers of the
 type inheritance graph.  */

1528class GTY(()) ipa_polymorphic_call_context {
1529public:
/* The called object appears in an object of type OUTER_TYPE
   at offset OFFSET.  When information is not 100% reliable, we
   use SPECULATIVE_OUTER_TYPE and SPECULATIVE_OFFSET. */
HOST_WIDE_INTlong offset;
HOST_WIDE_INTlong speculative_offset;
tree outer_type;
tree speculative_outer_type;
/* True if outer object may be in construction or destruction.  */
unsigned maybe_in_construction : 1;
/* True if outer object may be of derived type.  */
unsigned maybe_derived_type : 1;
/* True if speculative outer object may be of derived type.  We always
   speculate that construction does not happen.  */
unsigned speculative_maybe_derived_type : 1;
/* True if the context is invalid and all calls should be redirected
   to BUILTIN_UNREACHABLE.  */
unsigned invalid : 1;
/* True if the outer type is dynamic.  */
unsigned dynamic : 1;

/* Build empty "I know nothing" context.  */
ipa_polymorphic_call_context ();
/* Build polymorphic call context for indirect call E.  */
ipa_polymorphic_call_context (cgraph_edge *e);
/* Build polymorphic call context for IP invariant CST.
   If specified, OTR_TYPE specify the type of polymorphic call
   that takes CST+OFFSET as a parameter.  */
ipa_polymorphic_call_context (tree cst, tree otr_type = NULLnullptr,
		HOST_WIDE_INTlong offset = 0);
/* Build context for pointer REF contained in FNDECL at statement STMT.
   if INSTANCE is non-NULL, return pointer to the object described by
   the context.  */
ipa_polymorphic_call_context (tree fndecl, tree ref, gimple *stmt,
		tree *instance = NULLnullptr);

/* Look for vtable stores or constructor calls to work out dynamic type
   of memory location.  */
bool get_dynamic_type (tree, tree, tree, gimple *, unsigned *);

/* Make context non-speculative.  */
void clear_speculation ();

/* Produce context specifying all derived types of OTR_TYPE.  If OTR_TYPE is
   NULL, the context is set to dummy "I know nothing" setting.  */
void clear_outer_type (tree otr_type = NULLnullptr);

/* Walk container types and modify context to point to actual class
   containing OTR_TYPE (if non-NULL) as base class.
   Return true if resulting context is valid.

   When CONSIDER_PLACEMENT_NEW is false, reject contexts that may be made
   valid only via allocation of new polymorphic type inside by means
   of placement new.

   When CONSIDER_BASES is false, only look for actual fields, not base types
   of TYPE.  */
bool restrict_to_inner_class (tree otr_type,
		bool consider_placement_new = true,
		bool consider_bases = true);

/* Adjust all offsets in contexts by given number of bits.  */
void offset_by (HOST_WIDE_INTlong);
/* Use when we cannot track dynamic type change.  This speculatively assume
   type change is not happening.  */
void possible_dynamic_type_change (bool, tree otr_type = NULLnullptr);
/* Assume that both THIS and a given context is valid and strengthen THIS
   if possible.  Return true if any strengthening was made.
   If actual type the context is being used in is known, OTR_TYPE should be
   set accordingly. This improves quality of combined result.  */
bool combine_with (ipa_polymorphic_call_context, tree otr_type = NULLnullptr);
bool meet_with (ipa_polymorphic_call_context, tree otr_type = NULLnullptr);

/* Return TRUE if context is fully useless.  */
bool useless_p () const;
/* Return TRUE if this context conveys the same information as X.  */
bool equal_to (const ipa_polymorphic_call_context &x) const;

/* Dump human readable context to F.  If NEWLINE is true, it will be
   terminated by a newline.  */
void dump (FILE *f, bool newline = true) const;
void DEBUG_FUNCTION__attribute__ ((__used__)) debug () const;

/* LTO streaming.  */
void stream_out (struct output_block *) const;
void stream_in (class lto_input_block *, class data_in *data_in);

1616private:
bool combine_speculation_with (tree, HOST_WIDE_INTlong, bool, tree);
bool meet_speculation_with (tree, HOST_WIDE_INTlong, bool, tree);
void set_by_decl (tree, HOST_WIDE_INTlong);
bool set_by_invariant (tree, tree, HOST_WIDE_INTlong);
bool speculation_consistent_p (tree, HOST_WIDE_INTlong, bool, tree) const;
void make_speculative (tree otr_type = NULLnullptr);
1623};

1625/* Structure containing additional information about an indirect call.  */

1627class GTY(()) cgraph_indirect_call_info
1628{
1629public:
/* When agg_content is set, an offset where the call pointer is located
   within the aggregate.  */
HOST_WIDE_INTlong offset;
/* Context of the polymorphic call; use only when POLYMORPHIC flag is set.  */
ipa_polymorphic_call_context context;
/* OBJ_TYPE_REF_TOKEN of a polymorphic call (if polymorphic is set).  */
HOST_WIDE_INTlong otr_token;
/* Type of the object from OBJ_TYPE_REF_OBJECT. */
tree otr_type;
/* Index of the parameter that is called.  */
int param_index;
/* ECF flags determined from the caller.  */
int ecf_flags;

/* Number of speculative call targets, it's less than GCOV_TOPN_VALUES.  */
unsigned num_speculative_call_targets : 16;

/* Set when the call is a virtual call with the parameter being the
   associated object pointer rather than a simple direct call.  */
unsigned polymorphic : 1;
/* Set when the call is a call of a pointer loaded from contents of an
   aggregate at offset.  */
unsigned agg_contents : 1;
/* Set when this is a call through a member pointer.  */
unsigned member_ptr : 1;
/* When the agg_contents bit is set, this one determines whether the
   destination is loaded from a parameter passed by reference. */
unsigned by_ref : 1;
/* When the agg_contents bit is set, this one determines whether we can
   deduce from the function body that the loaded value from the reference is
   never modified between the invocation of the function and the load
   point.  */
unsigned guaranteed_unmodified : 1;
/* For polymorphic calls this specify whether the virtual table pointer
   may have changed in between function entry and the call.  */
unsigned vptr_changed : 1;
1666};

1668class GTY((chain_next ("%h.next_caller"), chain_prev ("%h.prev_caller"),
  for_user)) cgraph_edge
1670{
1671public:
friend struct cgraph_node;
friend class symbol_table;

/* Remove EDGE from the cgraph.  */
static void remove (cgraph_edge *edge);

/* Change field call_stmt of edge E to NEW_STMT.  If UPDATE_SPECULATIVE and E
   is any component of speculative edge, then update all components.
   Speculations can be resolved in the process and EDGE can be removed and
   deallocated.  Return the edge that now represents the call.  */
static cgraph_edge *set_call_stmt (cgraph_edge *e, gcall *new_stmt,
		     bool update_speculative = true);

/* Redirect callee of the edge to N.  The function does not update underlying
   call expression.  */
void redirect_callee (cgraph_node *n);

/* If the edge does not lead to a thunk, simply redirect it to N.  Otherwise
   create one or more equivalent thunks for N and redirect E to the first in
   the chain.  Note that it is then necessary to call
   n->expand_all_artificial_thunks once all callers are redirected.  */
void redirect_callee_duplicating_thunks (cgraph_node *n);

/* Make an indirect edge with an unknown callee an ordinary edge leading to
   CALLEE.  Speculations can be resolved in the process and EDGE can be
   removed and deallocated.  Return the edge that now represents the
   call.  */
static cgraph_edge *make_direct (cgraph_edge *edge, cgraph_node *callee);

/* Turn edge into speculative call calling N2. Update
   the profile so the direct call is taken COUNT times
   with FREQUENCY.  speculative_id is used to link direct calls with their
   corresponding IPA_REF_ADDR references when representing speculative calls.
 */
cgraph_edge *make_speculative (cgraph_node *n2, profile_count direct_count,
		 unsigned int speculative_id = 0);

/* Speculative call consists of an indirect edge and one or more
   direct edge+ref pairs.  Speculative will expand to the following sequence:

   if (call_dest == target1)		// reference to target1
target1 ();			// direct call to target1
   else if (call_dest == target2)	// reference to targt2
target2 ();			// direct call to target2
   else
call_dest ();			// indirect call

   Before the expansion we will have indirect call and the direct call+ref
   pairs all linked to single statement.

   Note that ref may point to different symbol than the corresponding call
   becuase the speculated edge may have been optimized (redirected to
   a clone) or inlined.

   Given an edge which is part of speculative call, return the first
   direct call edge in the speculative call sequence.

   In the example above called on any cgraph edge in the sequence it will
   return direct call to target1.  */
cgraph_edge *first_speculative_call_target ();

/* Return next speculative call target or NULL if there is none.
   All targets are required to form an interval in the callee list.

   In example above, if called on call to target1 it will return call to
   target2.  */
cgraph_edge *next_speculative_call_target ()
{
  cgraph_edge *e = this;
  gcc_checking_assert (speculative && callee)((void)(!(speculative && callee) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 1741, __FUNCTION__), 0 : 0));

  if (e->next_callee && e->next_callee->speculative
&& e->next_callee->call_stmt == e->call_stmt
&& e->next_callee->lto_stmt_uid == e->lto_stmt_uid)
    return e->next_callee;
  return NULLnullptr;
}

/* When called on any edge in the speculative call return the (unique)
   indirect call edge in the speculative call sequence.  */
cgraph_edge *speculative_call_indirect_edge ()
{
  gcc_checking_assert (speculative)((void)(!(speculative) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 1754, __FUNCTION__), 0 : 0));
  if (!callee)
    return this;
  for (cgraph_edge *e2 = caller->indirect_calls;
true; e2 = e2->next_callee)
    if (e2->speculative
 && call_stmt == e2->call_stmt
 && lto_stmt_uid == e2->lto_stmt_uid)
return e2;
}

/* When called on any edge in speculative call and when given any target
   of ref which is speculated to it returns the corresponding direct call.

   In example above if called on function target2 it will return call to
   target2.  */
cgraph_edge *speculative_call_for_target (cgraph_node *);

/* Return REF corresponding to direct call in the specualtive call
   sequence.  */
ipa_ref *speculative_call_target_ref ()
{
  ipa_ref *ref;

  gcc_checking_assert (speculative)((void)(!(speculative) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 1778, __FUNCTION__), 0 : 0));
  for (unsigned int i = 0; caller->iterate_reference (i, ref); i++)
    if (ref->speculative && ref->speculative_id == speculative_id
 && ref->stmt == (gimple *)call_stmt
 && ref->lto_stmt_uid == lto_stmt_uid)
return ref;
  gcc_unreachable ()(fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 1784, __FUNCTION__));
}

/* Speculative call edge turned out to be direct call to CALLEE_DECL.  Remove
   the speculative call sequence and return edge representing the call, the
   original EDGE can be removed and deallocated.  It is up to caller to
   redirect the call as appropriate.  Return the edge that now represents the
   call.

   For "speculative" indirect call that contains multiple "speculative"
   targets (i.e. edge->indirect_info->num_speculative_call_targets > 1),
   decrease the count and only remove current direct edge.

   If no speculative direct call left to the speculative indirect call, remove
   the speculative of both the indirect call and corresponding direct edge.

   It is up to caller to iteratively resolve each "speculative" direct call
   and redirect the call as appropriate.  */
static cgraph_edge *resolve_speculation (cgraph_edge *edge,
			   tree callee_decl = NULLnullptr);

/* If necessary, change the function declaration in the call statement
   associated with edge E so that it corresponds to the edge callee.
   Speculations can be resolved in the process and EDGE can be removed and
   deallocated.

   The edge could be one of speculative direct call generated from speculative
   indirect call.  In this circumstance, decrease the speculative targets
   count (i.e. num_speculative_call_targets) and redirect call stmt to the
   corresponding i-th target.  If no speculative direct call left to the
   speculative indirect call, remove "speculative" of the indirect call and
   also redirect stmt to it's final direct target.

   It is up to caller to iteratively transform each "speculative"
   direct call as appropriate.  */
static gimple *redirect_call_stmt_to_callee (cgraph_edge *e);

/* Create clone of edge in the node N represented
   by CALL_EXPR the callgraph.  */
cgraph_edge * clone (cgraph_node *n, gcall *call_stmt, unsigned stmt_uid,
       profile_count num, profile_count den,
       bool update_original);

/* Verify edge count and frequency.  */
bool verify_count ();

/* Return true when call of edge cannot lead to return from caller
   and thus it is safe to ignore its side effects for IPA analysis
   when computing side effects of the caller.  */
bool cannot_lead_to_return_p (void);

/* Return true when the edge represents a direct recursion.  */
bool recursive_p (void);

/* Return true if the edge may be considered hot.  */
bool maybe_hot_p (void);

/* Get unique identifier of the edge.  */
inline int get_uid ()
{
  return m_uid;
}

/* Get summary id of the edge.  */
inline int get_summary_id ()
{
  return m_summary_id;
}

/* Rebuild cgraph edges for current function node.  This needs to be run after
   passes that don't update the cgraph.  */
static unsigned int rebuild_edges (void);

/* Rebuild cgraph references for current function node.  This needs to be run
   after passes that don't update the cgraph.  */
static void rebuild_references (void);

/* During LTO stream in this can be used to check whether call can possibly
   be internal to the current translation unit.  */
bool possibly_call_in_translation_unit_p (void);

/* Return num_speculative_targets of this edge.  */
int num_speculative_call_targets_p (void);

/* Expected number of executions: calculated in profile.c.  */
profile_count count;
cgraph_node *caller;
cgraph_node *callee;
cgraph_edge *prev_caller;
cgraph_edge *next_caller;
cgraph_edge *prev_callee;
cgraph_edge *next_callee;
gcall *call_stmt;
/* Additional information about an indirect call.  Not cleared when an edge
   becomes direct.  */
cgraph_indirect_call_info *indirect_info;
PTRvoid * GTY ((skip (""))) aux;
/* When equal to CIF_OK, inline this call.  Otherwise, points to the
   explanation why function was not inlined.  */
enum cgraph_inline_failed_t inline_failed;
/* The stmt_uid of call_stmt.  This is used by LTO to recover the call_stmt
   when the function is serialized in.  */
unsigned int lto_stmt_uid;
/* speculative id is used to link direct calls with their corresponding
   IPA_REF_ADDR references when representing speculative calls.  */
unsigned int speculative_id : 16;
/* Whether this edge was made direct by indirect inlining.  */
unsigned int indirect_inlining_edge : 1;
/* Whether this edge describes an indirect call with an undetermined
   callee.  */
unsigned int indirect_unknown_callee : 1;
/* Whether this edge is still a dangling  */
/* True if the corresponding CALL stmt cannot be inlined.  */
unsigned int call_stmt_cannot_inline_p : 1;
/* Can this call throw externally?  */
unsigned int can_throw_external : 1;
/* Edges with SPECULATIVE flag represents indirect calls that was
   speculatively turned into direct (i.e. by profile feedback).
   The final code sequence will have form:

   if (call_target == expected_fn)
     expected_fn ();
   else
     call_target ();

   Every speculative call is represented by three components attached
   to a same call statement:
   1) a direct call (to expected_fn)
   2) an indirect call (to call_target)
   3) a IPA_REF_ADDR reference to expected_fn.

   Optimizers may later redirect direct call to clone, so 1) and 3)
   do not need to necessarily agree with destination.  */
unsigned int speculative : 1;
/* Set to true when caller is a constructor or destructor of polymorphic
   type.  */
unsigned in_polymorphic_cdtor : 1;

/* Return true if call must bind to current definition.  */
bool binds_to_current_def_p ();

/* Expected frequency of executions within the function.
   When set to CGRAPH_FREQ_BASE, the edge is expected to be called once
   per function call.  The range is 0 to CGRAPH_FREQ_MAX.  */
int frequency ();

/* Expected frequency of executions within the function.  */
sreal sreal_frequency ();
1932private:
/* Unique id of the edge.  */
int m_uid;

/* Summary id that is recycled.  */
int m_summary_id;

/* Remove the edge from the list of the callers of the callee.  */
void remove_caller (void);

/* Remove the edge from the list of the callees of the caller.  */
void remove_callee (void);

/* Set callee N of call graph edge and add it to the corresponding set of
   callers. */
void set_callee (cgraph_node *n);

/* Output flags of edge to a file F.  */
void dump_edge_flags (FILE *f);

/* Dump edge to stderr.  */
void DEBUG_FUNCTION__attribute__ ((__used__)) debug (void);

/* Verify that call graph edge corresponds to DECL from the associated
   statement.  Return true if the verification should fail.  */
bool verify_corresponds_to_fndecl (tree decl);
1958};

1960#define CGRAPH_FREQ_BASE1000 1000
1961#define CGRAPH_FREQ_MAX100000 100000

1963/* The varpool data structure.
 Each static variable decl has assigned varpool_node.  */

1966struct GTY((tag ("SYMTAB_VARIABLE"))) varpool_node : public symtab_node
1967{
/* Constructor.  */
explicit varpool_node ()
  : symtab_node (SYMTAB_VARIABLE), output (0), dynamically_initialized (0),
    tls_model (TLS_MODEL_NONE), used_by_single_function (0)
{}

/* Dump given varpool node to F.  */
void dump (FILE *f);

/* Dump given varpool node to stderr.  */
void DEBUG_FUNCTION__attribute__ ((__used__)) debug (void);

/* Remove variable from symbol table.  */
void remove (void);

/* Remove node initializer when it is no longer needed.  */
void remove_initializer (void);

void analyze (void);

/* Return variable availability.  */
availability get_availability (symtab_node *ref = NULLnullptr);

/* When doing LTO, read variable's constructor from disk if
   it is not already present.  */
tree get_constructor (void);

/* Return true if variable has constructor that can be used for folding.  */
bool ctor_useable_for_folding_p (void);

/* For given variable pool node, walk the alias chain to return the function
   the variable is alias of. Do not walk through thunks.
   When AVAILABILITY is non-NULL, get minimal availability in the chain.
   When REF is non-NULL, assume that reference happens in symbol REF
   when determining the availability.  */
inline varpool_node *ultimate_alias_target
  (availability *availability = NULLnullptr, symtab_node *ref = NULLnullptr);

/* Return node that alias is aliasing.  */
inline varpool_node *get_alias_target (void);

/* Output one variable, if necessary.  Return whether we output it.  */
bool assemble_decl (void);

/* For variables in named sections make sure get_variable_section
   is called before we switch to those sections.  Then section
   conflicts between read-only and read-only requiring relocations
   sections can be resolved.  */
void finalize_named_section_flags (void);

/* Call callback on varpool symbol and aliases associated to varpool symbol.
   When INCLUDE_OVERWRITABLE is false, overwritable aliases and thunks are
   skipped. */
bool call_for_symbol_and_aliases (bool (*callback) (varpool_node *, void *),
		    void *data,
		    bool include_overwritable);

/* Return true when variable should be considered externally visible.  */
bool externally_visible_p (void);

/* Return true when all references to variable must be visible
   in ipa_ref_list.
   i.e. if the variable is not externally visible or not used in some magic
   way (asm statement or such).
   The magic uses are all summarized in force_output flag.  */
inline bool all_refs_explicit_p ();

/* Return true when variable can be removed from variable pool
   if all direct calls are eliminated.  */
inline bool can_remove_if_no_refs_p (void);

/* Add the variable DECL to the varpool.
   Unlike finalize_decl function is intended to be used
   by middle end and allows insertion of new variable at arbitrary point
   of compilation.  */
static void add (tree decl);

/* Return varpool node for given symbol and check it is a function. */
static inline varpool_node *get (const_tree decl);

/* Mark DECL as finalized.  By finalizing the declaration, frontend instruct
   the middle end to output the variable to asm file, if needed or externally
   visible.  */
static void finalize_decl (tree decl);

/* Attempt to mark ALIAS as an alias to DECL.  Return TRUE if successful.
   Extra name aliases are output whenever DECL is output.  */
static varpool_node * create_extra_name_alias (tree alias, tree decl);

/* Attempt to mark ALIAS as an alias to DECL.  Return TRUE if successful.
   Extra name aliases are output whenever DECL is output.  */
static varpool_node * create_alias (tree, tree);

/* Dump the variable pool to F.  */
static void dump_varpool (FILE *f);

/* Dump the variable pool to stderr.  */
static void DEBUG_FUNCTION__attribute__ ((__used__)) debug_varpool (void);

/* Allocate new callgraph node and insert it into basic data structures.  */
static varpool_node *create_empty (void);

/* Return varpool node assigned to DECL.  Create new one when needed.  */
static varpool_node *get_create (tree decl);

/* Given an assembler name, lookup node.  */
static varpool_node *get_for_asmname (tree asmname);

/* Set when variable is scheduled to be assembled.  */
unsigned output : 1;

/* Set if the variable is dynamically initialized, except for
   function local statics.   */
unsigned dynamically_initialized : 1;

ENUM_BITFIELD(tls_model)enum tls_model tls_model : 3;

/* Set if the variable is known to be used by single function only.
   This is computed by ipa_single_use pass and used by late optimizations
   in places where optimization would be valid for local static variable
   if we did not do any inter-procedural code movement.  */
unsigned used_by_single_function : 1;

2091private:
/* Assemble thunks and aliases associated to varpool node.  */
void assemble_aliases (void);

/* Worker for call_for_node_and_aliases.  */
bool call_for_symbol_and_aliases_1 (bool (*callback) (varpool_node *, void *),
		      void *data,
		      bool include_overwritable);
2099};

2101/* Every top level asm statement is put into a asm_node.  */

2103struct GTY(()) asm_node {
/* Next asm node.  */
asm_node *next;
/* String for this asm node.  */
tree asm_str;
/* Ordering of all cgraph nodes.  */
int order;
2110};

2112/* Report whether or not THIS symtab node is a function, aka cgraph_node.  */

2114template <>
2115template <>
2116inline bool
2117is_a_helper <cgraph_node *>::test (symtab_node *p)
2118{
return p7.1
'p' is non-null
1
'p' is non-null
1
'p' is non-null
1
'p' is non-null
1
'p' is non-null
1
'p' is non-null
1
'p' is non-null
1
'p' is non-null
1
'p' is non-null
1
'p' is non-null
1
'p' is non-null
1
'p' is non-null
1
'p' is non-null
1
'p' is non-null
1
'p' is non-null
1
'p' is non-null
 && p->type == SYMTAB_FUNCTION;
8
←
Assuming field 'type' is equal to SYMTAB_FUNCTION→
9
←
Returning without writing to 'p->next', which participates in a condition later→
10
←
Returning the value 1, which participates in a condition later→
32
←
Assuming field 'type' is equal to SYMTAB_FUNCTION→
33
←
Returning the value 1, which participates in a condition later→
2120}

2122/* Report whether or not THIS symtab node is a variable, aka varpool_node.  */

2124template <>
2125template <>
2126inline bool
2127is_a_helper <varpool_node *>::test (symtab_node *p)
2128{
return p && p->type == SYMTAB_VARIABLE;
2130}

2132typedef void (*cgraph_edge_hook)(cgraph_edge *, void *);
2133typedef void (*cgraph_node_hook)(cgraph_node *, void *);
2134typedef void (*varpool_node_hook)(varpool_node *, void *);
2135typedef void (*cgraph_2edge_hook)(cgraph_edge *, cgraph_edge *, void *);
2136typedef void (*cgraph_2node_hook)(cgraph_node *, cgraph_node *, void *);

2138struct cgraph_edge_hook_list;
2139struct cgraph_node_hook_list;
2140struct varpool_node_hook_list;
2141struct cgraph_2edge_hook_list;
2142struct cgraph_2node_hook_list;

2144/* Map from a symbol to initialization/finalization priorities.  */
2145struct GTY(()) symbol_priority_map {
priority_type init;
priority_type fini;
2148};

2150enum symtab_state
2151{
/* Frontend is parsing and finalizing functions.  */
PARSING,
/* Callgraph is being constructed.  It is safe to add new functions.  */
CONSTRUCTION,
/* Callgraph is being streamed-in at LTO time.  */
LTO_STREAMING,
/* Callgraph is built and early IPA passes are being run.  */
IPA,
/* Callgraph is built and all functions are transformed to SSA form.  */
IPA_SSA,
/* All inline decisions are done; it is now possible to remove extern inline
   functions and virtual call targets.  */
IPA_SSA_AFTER_INLINING,
/* Functions are now ordered and being passed to RTL expanders.  */
EXPANSION,
/* All cgraph expansion is done.  */
FINISHED
2169};

2171struct asmname_hasher : ggc_ptr_hash <symtab_node>
2172{
typedef const_tree compare_type;

static hashval_t hash (symtab_node *n);
static bool equal (symtab_node *n, const_tree t);
2177};

2179/* Core summaries maintained about symbols.  */

2181struct thunk_info;
2182template <class T> class function_summary;
2183typedef function_summary <thunk_info *> thunk_summary;

2185struct clone_info;
2186template <class T> class function_summary;
2187typedef function_summary <clone_info *> clone_summary;

2189class GTY((tag ("SYMTAB"))) symbol_table
2190{
2191public:
friend struct symtab_node;
friend struct cgraph_node;
friend struct cgraph_edge;

symbol_table (): 
cgraph_count (0), cgraph_max_uid (1), cgraph_max_summary_id (0),
edges_count (0), edges_max_uid (1), edges_max_summary_id (0),
cgraph_released_summary_ids (), edge_released_summary_ids (),
nodes (NULLnullptr), asmnodes (NULLnullptr), asm_last_node (NULLnullptr),
order (0), max_unit (0), global_info_ready (false), state (PARSING),
function_flags_ready (false), cpp_implicit_aliases_done (false),
section_hash (NULLnullptr), assembler_name_hash (NULLnullptr), init_priority_hash (NULLnullptr),
dump_file (NULLnullptr), ipa_clones_dump_file (NULLnullptr), cloned_nodes (),
m_thunks (NULLnullptr), m_clones (NULLnullptr),
m_first_edge_removal_hook (NULLnullptr), m_first_cgraph_removal_hook (NULLnullptr),
m_first_edge_duplicated_hook (NULLnullptr), m_first_cgraph_duplicated_hook (NULLnullptr),
m_first_cgraph_insertion_hook (NULLnullptr), m_first_varpool_insertion_hook (NULLnullptr),
m_first_varpool_removal_hook (NULLnullptr)
{
}

/* Initialize callgraph dump file.  */
void initialize (void);

/* Register a top-level asm statement ASM_STR.  */
inline asm_node *finalize_toplevel_asm (tree asm_str);

/* Analyze the whole compilation unit once it is parsed completely.  */
void finalize_compilation_unit (void);

/* C++ frontend produce same body aliases all over the place, even before PCH
   gets streamed out. It relies on us linking the aliases with their function
   in order to do the fixups, but ipa-ref is not PCH safe.  Consequently we
   first produce aliases without links, but once C++ FE is sure it won't
   stream PCH we build the links via this function.  */
void process_same_body_aliases (void);

/* Perform simple optimizations based on callgraph.  */
void compile (void);

/* Process CGRAPH_NEW_FUNCTIONS and perform actions necessary to add these
   functions into callgraph in a way so they look like ordinary reachable
   functions inserted into callgraph already at construction time.  */
void process_new_functions (void);

/* Register a symbol NODE.  */
inline void register_symbol (symtab_node *node);

inline void
clear_asm_symbols (void)
{
  asmnodes = NULLnullptr;
  asm_last_node = NULLnullptr;
}

/* Perform reachability analysis and reclaim all unreachable nodes.  */
bool remove_unreachable_nodes (FILE *file);

/* Optimization of function bodies might've rendered some variables as
   unnecessary so we want to avoid these from being compiled.  Re-do
   reachability starting from variables that are either externally visible
   or was referred from the asm output routines.  */
void remove_unreferenced_decls (void);

/* Unregister a symbol NODE.  */
inline void unregister (symtab_node *node);

/* Allocate new callgraph node and insert it into basic data structures.  */
cgraph_node *create_empty (void);

/* Release a callgraph NODE.  */
void release_symbol (cgraph_node *node);

/* Output all variables enqueued to be assembled.  */
bool output_variables (void);

/* Weakrefs may be associated to external decls and thus not output
   at expansion time.  Emit all necessary aliases.  */
void output_weakrefs (void);

/* Return first static symbol with definition.  */
inline symtab_node *first_symbol (void);

/* Return first assembler symbol.  */
inline asm_node *
first_asm_symbol (void)
{
  return asmnodes;
}

/* Return first static symbol with definition.  */
inline symtab_node *first_defined_symbol (void);

/* Return first variable.  */
inline varpool_node *first_variable (void);

/* Return next variable after NODE.  */
inline varpool_node *next_variable (varpool_node *node);

/* Return first static variable with initializer.  */
inline varpool_node *first_static_initializer (void);

/* Return next static variable with initializer after NODE.  */
inline varpool_node *next_static_initializer (varpool_node *node);

/* Return first static variable with definition.  */
inline varpool_node *first_defined_variable (void);

/* Return next static variable with definition after NODE.  */
inline varpool_node *next_defined_variable (varpool_node *node);

/* Return first function with body defined.  */
inline cgraph_node *first_defined_function (void);

/* Return next function with body defined after NODE.  */
inline cgraph_node *next_defined_function (cgraph_node *node);

/* Return first function.  */
inline cgraph_node *first_function (void);

/* Return next function.  */
inline cgraph_node *next_function (cgraph_node *node);

/* Return first function with body defined.  */
cgraph_node *first_function_with_gimple_body (void);

/* Return next reachable static variable with initializer after NODE.  */
inline cgraph_node *next_function_with_gimple_body (cgraph_node *node);

/* Register HOOK to be called with DATA on each removed edge.  */
cgraph_edge_hook_list *add_edge_removal_hook (cgraph_edge_hook hook,
				void *data);

/* Remove ENTRY from the list of hooks called on removing edges.  */
void remove_edge_removal_hook (cgraph_edge_hook_list *entry);

/* Register HOOK to be called with DATA on each removed node.  */
cgraph_node_hook_list *add_cgraph_removal_hook (cgraph_node_hook hook,
				  void *data);

/* Remove ENTRY from the list of hooks called on removing nodes.  */
void remove_cgraph_removal_hook (cgraph_node_hook_list *entry);

/* Register HOOK to be called with DATA on each removed node.  */
varpool_node_hook_list *add_varpool_removal_hook (varpool_node_hook hook,
				    void *data);

/* Remove ENTRY from the list of hooks called on removing nodes.  */
void remove_varpool_removal_hook (varpool_node_hook_list *entry);

/* Register HOOK to be called with DATA on each inserted node.  */
cgraph_node_hook_list *add_cgraph_insertion_hook (cgraph_node_hook hook,
				    void *data);

/* Remove ENTRY from the list of hooks called on inserted nodes.  */
void remove_cgraph_insertion_hook (cgraph_node_hook_list *entry);

/* Register HOOK to be called with DATA on each inserted node.  */
varpool_node_hook_list *add_varpool_insertion_hook (varpool_node_hook hook,
				      void *data);

/* Remove ENTRY from the list of hooks called on inserted nodes.  */
void remove_varpool_insertion_hook (varpool_node_hook_list *entry);

/* Register HOOK to be called with DATA on each duplicated edge.  */
cgraph_2edge_hook_list *add_edge_duplication_hook (cgraph_2edge_hook hook,
				     void *data);
/* Remove ENTRY from the list of hooks called on duplicating edges.  */
void remove_edge_duplication_hook (cgraph_2edge_hook_list *entry);

/* Register HOOK to be called with DATA on each duplicated node.  */
cgraph_2node_hook_list *add_cgraph_duplication_hook (cgraph_2node_hook hook,
				       void *data);

/* Remove ENTRY from the list of hooks called on duplicating nodes.  */
void remove_cgraph_duplication_hook (cgraph_2node_hook_list *entry);

/* Call all edge removal hooks.  */
void call_edge_removal_hooks (cgraph_edge *e);

/* Call all node insertion hooks.  */
void call_cgraph_insertion_hooks (cgraph_node *node);

/* Call all node removal hooks.  */
void call_cgraph_removal_hooks (cgraph_node *node);

/* Call all node duplication hooks.  */
void call_cgraph_duplication_hooks (cgraph_node *node, cgraph_node *node2);

/* Call all edge duplication hooks.  */
void call_edge_duplication_hooks (cgraph_edge *cs1, cgraph_edge *cs2);

/* Call all node removal hooks.  */
void call_varpool_removal_hooks (varpool_node *node);

/* Call all node insertion hooks.  */
void call_varpool_insertion_hooks (varpool_node *node);

/* Arrange node to be first in its entry of assembler_name_hash.  */
void symtab_prevail_in_asm_name_hash (symtab_node *node);

/* Initialize asm name hash unless.  */
void symtab_initialize_asm_name_hash (void);

/* Set the DECL_ASSEMBLER_NAME and update symtab hashtables.  */
void change_decl_assembler_name (tree decl, tree name);

/* Dump symbol table to F.  */
void dump (FILE *f);

/* Dump symbol table to F in graphviz format.  */
void dump_graphviz (FILE *f);

/* Dump symbol table to stderr.  */
void DEBUG_FUNCTION__attribute__ ((__used__)) debug (void);

/* Assign a new summary ID for the callgraph NODE.  */
inline int assign_summary_id (cgraph_node *node)
{
  if (!cgraph_released_summary_ids.is_empty ())
    node->m_summary_id = cgraph_released_summary_ids.pop ();
  else
    node->m_summary_id = cgraph_max_summary_id++;

  return node->m_summary_id;
}

/* Assign a new summary ID for the callgraph EDGE.  */
inline int assign_summary_id (cgraph_edge *edge)
{
  if (!edge_released_summary_ids.is_empty ())
    edge->m_summary_id = edge_released_summary_ids.pop ();
  else
    edge->m_summary_id = edges_max_summary_id++;

  return edge->m_summary_id;
}

/* Return true if assembler names NAME1 and NAME2 leads to the same symbol
   name.  */
static bool assembler_names_equal_p (const char *name1, const char *name2);

int cgraph_count;
int cgraph_max_uid;
int cgraph_max_summary_id;

int edges_count;
int edges_max_uid;
int edges_max_summary_id;

/* Vector of released summary IDS for cgraph nodes.  */
vec<int> GTY ((skip)) cgraph_released_summary_ids;

/* Vector of released summary IDS for cgraph nodes.  */
vec<int> GTY ((skip)) edge_released_summary_ids;

/* Return symbol used to separate symbol name from suffix.  */
static char symbol_suffix_separator ();

symtab_node* GTY(()) nodes;
asm_node* GTY(()) asmnodes;
asm_node* GTY(()) asm_last_node;

/* The order index of the next symtab node to be created.  This is
   used so that we can sort the cgraph nodes in order by when we saw
   them, to support -fno-toplevel-reorder.  */
int order;

/* Maximal unit ID used.  */
int max_unit;

/* Set when whole unit has been analyzed so we can access global info.  */
bool global_info_ready;
/* What state callgraph is in right now.  */
enum symtab_state state;
/* Set when the cgraph is fully build and the basic flags are computed.  */
bool function_flags_ready;

bool cpp_implicit_aliases_done;

/* Hash table used to hold sections.  */
hash_table<section_name_hasher> *GTY(()) section_hash;

/* Hash table used to convert assembler names into nodes.  */
hash_table<asmname_hasher> *assembler_name_hash;

/* Hash table used to hold init priorities.  */
hash_map<symtab_node *, symbol_priority_map> *init_priority_hash;

FILE* GTY ((skip)) dump_file;

FILE* GTY ((skip)) ipa_clones_dump_file;

hash_set <const cgraph_node *> GTY ((skip)) cloned_nodes;

/* Thunk annotations.  */
thunk_summary *m_thunks;

/* Virtual clone annotations.  */
clone_summary *m_clones;

2493private:
/* Allocate a cgraph_edge structure and fill it with data according to the
   parameters of which only CALLEE can be NULL (when creating an indirect
   call edge).  CLONING_P should be set if properties that are copied from an
   original edge should not be calculated.  */
cgraph_edge *create_edge (cgraph_node *caller, cgraph_node *callee,
	    gcall *call_stmt, profile_count count,
	    bool indir_unknown_callee, bool cloning_p);

/* Put the edge onto the free list.  */
void free_edge (cgraph_edge *e);

/* Insert NODE to assembler name hash.  */
void insert_to_assembler_name_hash (symtab_node *node, bool with_clones);

/* Remove NODE from assembler name hash.  */
void unlink_from_assembler_name_hash (symtab_node *node, bool with_clones);

/* Hash asmnames ignoring the user specified marks.  */
static hashval_t decl_assembler_name_hash (const_tree asmname);

/* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL.  */
static bool decl_assembler_name_equal (tree decl, const_tree asmname);

friend struct asmname_hasher;

/* List of hooks triggered when an edge is removed.  */
cgraph_edge_hook_list * GTY((skip)) m_first_edge_removal_hook;
/* List of hooks trigger_red when a cgraph node is removed.  */
cgraph_node_hook_list * GTY((skip)) m_first_cgraph_removal_hook;
/* List of hooks triggered when an edge is duplicated.  */
cgraph_2edge_hook_list * GTY((skip)) m_first_edge_duplicated_hook;
/* List of hooks triggered when a node is duplicated.  */
cgraph_2node_hook_list * GTY((skip)) m_first_cgraph_duplicated_hook;
/* List of hooks triggered when an function is inserted.  */
cgraph_node_hook_list * GTY((skip)) m_first_cgraph_insertion_hook;
/* List of hooks triggered when an variable is inserted.  */
varpool_node_hook_list * GTY((skip)) m_first_varpool_insertion_hook;
/* List of hooks triggered when a node is removed.  */
varpool_node_hook_list * GTY((skip)) m_first_varpool_removal_hook;
2533};

2535extern GTY(()) symbol_table *symtab;

2537extern vec<cgraph_node *> cgraph_new_nodes;

2539inline hashval_t
2540asmname_hasher::hash (symtab_node *n)
2541{
return symbol_table::decl_assembler_name_hash
  (DECL_ASSEMBLER_NAME (n->decl)decl_assembler_name (n->decl));
2544}

2546inline bool
2547asmname_hasher::equal (symtab_node *n, const_tree t)
2548{
return symbol_table::decl_assembler_name_equal (n->decl, t);
2550}

2552/* In cgraph.c  */
2553void cgraph_c_finalize (void);
2554void release_function_body (tree);
2555cgraph_indirect_call_info *cgraph_allocate_init_indirect_info (void);

2557void cgraph_update_edges_for_call_stmt (gimple *, tree, gimple *);
2558bool cgraph_function_possibly_inlined_p (tree);

2560const char* cgraph_inline_failed_string (cgraph_inline_failed_t);
2561cgraph_inline_failed_type_t cgraph_inline_failed_type (cgraph_inline_failed_t);

2563/* In cgraphunit.c  */
2564void cgraphunit_c_finalize (void);
2565int tp_first_run_node_cmp (const void *pa, const void *pb);

2567/* In symtab-thunks.cc  */
2568void symtab_thunks_cc_finalize (void);

2570/*  Initialize datastructures so DECL is a function in lowered gimple form.
  IN_SSA is true if the gimple is in SSA.  */
2572basic_block init_lowered_empty_function (tree, bool, profile_count);

2574tree thunk_adjust (gimple_stmt_iterator *, tree, bool, HOST_WIDE_INTlong, tree,
   HOST_WIDE_INTlong);
2576/* In cgraphclones.c  */

2578tree clone_function_name_numbered (const char *name, const char *suffix);
2579tree clone_function_name_numbered (tree decl, const char *suffix);
2580tree clone_function_name (const char *name, const char *suffix,
	  unsigned long number);
2582tree clone_function_name (tree decl, const char *suffix,
	  unsigned long number);
2584tree clone_function_name (tree decl, const char *suffix);

2586void tree_function_versioning (tree, tree, vec<ipa_replace_map *, va_gc> *,
	       ipa_param_adjustments *,
	       bool, bitmap, basic_block);

2590void dump_callgraph_transformation (const cgraph_node *original,
		    const cgraph_node *clone,
		    const char *suffix);
2593/* In cgraphbuild.c  */
2594int compute_call_stmt_bb_frequency (tree, basic_block bb);
2595void record_references_in_initializer (tree, bool);

2597/* In ipa.c  */
2598void cgraph_build_static_cdtor (char which, tree body, int priority);
2599bool ipa_discover_variable_flags (void);

2601/* In varpool.c  */
2602tree ctor_for_folding (tree);

2604/* In ipa-inline-analysis.c  */
2605void initialize_inline_failed (struct cgraph_edge *);
2606bool speculation_useful_p (struct cgraph_edge *e, bool anticipate_inlining);

2608/* Return true when the symbol is real symbol, i.e. it is not inline clone
 or abstract function kept for debug info purposes only.  */
2610inline bool
2611symtab_node::real_symbol_p (void)
2612{
cgraph_node *cnode;

if (DECL_ABSTRACT_P (decl)((contains_struct_check ((decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 2615, __FUNCTION__))->decl_common.abstract_flag))
  return false;
if (transparent_alias && definition)
  return false;
if (!is_a <cgraph_node *> (this))
  return true;
cnode = dyn_cast <cgraph_node *> (this);
if (cnode->inlined_to)
  return false;
return true;
2625}

2627/* Return true if DECL should have entry in symbol table if used.
 Those are functions and static & external variables.  */

2630static inline bool
2631decl_in_symtab_p (const_tree decl)
2632{
return (TREE_CODE (decl)((enum tree_code) (decl)->base.code) == FUNCTION_DECL
        || (TREE_CODE (decl)((enum tree_code) (decl)->base.code) == VAR_DECL
     && (TREE_STATIC (decl)((decl)->base.static_flag) || DECL_EXTERNAL (decl)((contains_struct_check ((decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 2635, __FUNCTION__))->decl_common.decl_flag_1))));
2636}

2638inline bool
2639symtab_node::in_same_comdat_group_p (symtab_node *target)
2640{
symtab_node *source = this;

if (cgraph_node *cn = dyn_cast <cgraph_node *> (target))
  {
    if (cn->inlined_to)
source = cn->inlined_to;
  }
if (cgraph_node *cn = dyn_cast <cgraph_node *> (target))
  {
    if (cn->inlined_to)
target = cn->inlined_to;
  }

return source->get_comdat_group () == target->get_comdat_group ();
2655}

2657/* Return node that alias is aliasing.  */

2659inline symtab_node *
2660symtab_node::get_alias_target (void)
2661{
ipa_ref *ref = NULLnullptr;
iterate_reference (0, ref);
gcc_checking_assert (ref->use == IPA_REF_ALIAS)((void)(!(ref->use == IPA_REF_ALIAS) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 2664, __FUNCTION__), 0 : 0));
return ref->referred;
2666}

2668/* Return next reachable static symbol with initializer after the node.  */

2670inline symtab_node *
2671symtab_node::next_defined_symbol (void)
2672{
symtab_node *node1 = next;

for (; node1; node1 = node1->next)
  if (node1->definition)
    return node1;

return NULLnullptr;
2680}

2682/* Iterates I-th reference in the list, REF is also set.  */

2684inline ipa_ref *
2685symtab_node::iterate_reference (unsigned i, ipa_ref *&ref)
2686{
ref_list.references.iterate (i, &ref);

return ref;
2690}

2692/* Iterates I-th referring item in the list, REF is also set.  */

2694inline ipa_ref *
2695symtab_node::iterate_referring (unsigned i, ipa_ref *&ref)
2696{
ref_list.referring.iterate (i, &ref);

return ref;
2700}

2702/* Iterates I-th referring alias item in the list, REF is also set.  */

2704inline ipa_ref *
2705symtab_node::iterate_direct_aliases (unsigned i, ipa_ref *&ref)
2706{
ref_list.referring.iterate (i, &ref);

if (ref && ref->use != IPA_REF_ALIAS)
  return NULLnullptr;

return ref;
2713}

2715/* Return true if list contains an alias.  */

2717inline bool
2718symtab_node::has_aliases_p (void)
2719{
ipa_ref *ref = NULLnullptr;

return (iterate_direct_aliases (0, ref) != NULLnullptr);
2723}

2725/* Return true when RESOLUTION indicate that linker will use
 the symbol from non-LTO object files.  */

2728inline bool
2729resolution_used_from_other_file_p (enum ld_plugin_symbol_resolution resolution)
2730{
return (resolution == LDPR_PREVAILING_DEF
 || resolution == LDPR_PREEMPTED_REG
 || resolution == LDPR_RESOLVED_EXEC
 || resolution == LDPR_RESOLVED_DYN);
2735}

2737/* Return true when symtab_node is known to be used from other (non-LTO)
 object file. Known only when doing LTO via linker plugin.  */

2740inline bool
2741symtab_node::used_from_object_file_p (void)
2742{
if (!TREE_PUBLIC (decl)((decl)->base.public_flag) || DECL_EXTERNAL (decl)((contains_struct_check ((decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 2743, __FUNCTION__))->decl_common.decl_flag_1))
  return false;
if (resolution_used_from_other_file_p (resolution))
  return true;
return false;
2748}

2750/* Return varpool node for given symbol and check it is a function. */

2752inline varpool_node *
2753varpool_node::get (const_tree decl)
2754{
gcc_checking_assert (TREE_CODE (decl) == VAR_DECL)((void)(!(((enum tree_code) (decl)->base.code) == VAR_DECL
) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 2755, __FUNCTION__), 0 : 0));
return dyn_cast<varpool_node *> (symtab_node::get (decl));
2757}

2759/* Register a symbol NODE.  */

2761inline void
2762symbol_table::register_symbol (symtab_node *node)
2763{
node->next = nodes;
node->previous = NULLnullptr;

if (nodes)
  nodes->previous = node;
nodes = node;

node->order = order++;
2772}

2774/* Register a top-level asm statement ASM_STR.  */

2776asm_node *
2777symbol_table::finalize_toplevel_asm (tree asm_str)
2778{
asm_node *node;

node = ggc_cleared_alloc<asm_node> ();
node->asm_str = asm_str;
node->order = order++;
node->next = NULLnullptr;

if (asmnodes == NULLnullptr)
  asmnodes = node;
else
  asm_last_node->next = node;

asm_last_node = node;
return node;
2793}

2795/* Unregister a symbol NODE.  */
2796inline void
2797symbol_table::unregister (symtab_node *node)
2798{
if (node->previous)
  node->previous->next = node->next;
else
  nodes = node->next;

if (node->next)
  node->next->previous = node->previous;

node->next = NULLnullptr;
node->previous = NULLnullptr;
2809}

2811/* Release a callgraph NODE with UID and put in to the list of free nodes.  */

2813inline void
2814symbol_table::release_symbol (cgraph_node *node)
2815{
cgraph_count--;
if (node->m_summary_id != -1)
  cgraph_released_summary_ids.safe_push (node->m_summary_id);
ggc_free (node);
2820}

2822/* Return first static symbol with definition.  */
2823inline symtab_node *
2824symbol_table::first_symbol (void)
2825{
return nodes;
2827}

2829/* Walk all symbols.  */
2830#define FOR_EACH_SYMBOL(node)for ((node) = symtab->first_symbol (); (node); (node) = (node
)->next) \
 for ((node) = symtab->first_symbol (); (node); (node) = (node)->next)

2833/* Return first static symbol with definition.  */
2834inline symtab_node *
2835symbol_table::first_defined_symbol (void)
2836{
symtab_node *node;

for (node = nodes; node; node = node->next)
  if (node->definition)
    return node;

return NULLnullptr;
2844}

2846/* Walk all symbols with definitions in current unit.  */
2847#define FOR_EACH_DEFINED_SYMBOL(node)for ((node) = symtab->first_defined_symbol (); (node); (node
) = node->next_defined_symbol ()) \
 for ((node) = symtab->first_defined_symbol (); (node); \
(node) = node->next_defined_symbol ())

2851/* Return first variable.  */
2852inline varpool_node *
2853symbol_table::first_variable (void)
2854{
symtab_node *node;
for (node = nodes; node; node = node->next)
  if (varpool_node *vnode = dyn_cast <varpool_node *> (node))
    return vnode;
return NULLnullptr;
2860}

2862/* Return next variable after NODE.  */
2863inline varpool_node *
2864symbol_table::next_variable (varpool_node *node)
2865{
symtab_node *node1 = node->next;
for (; node1; node1 = node1->next)
  if (varpool_node *vnode1 = dyn_cast <varpool_node *> (node1))
    return vnode1;
return NULLnullptr;
2871}
2872/* Walk all variables.  */
2873#define FOR_EACH_VARIABLE(node)for ((node) = symtab->first_variable (); (node); (node) = symtab
->next_variable ((node))) \
 for ((node) = symtab->first_variable (); \
      (node); \
(node) = symtab->next_variable ((node)))

2878/* Return first static variable with initializer.  */
2879inline varpool_node *
2880symbol_table::first_static_initializer (void)
2881{
symtab_node *node;
for (node = nodes; node; node = node->next)
  {
    varpool_node *vnode = dyn_cast <varpool_node *> (node);
    if (vnode && DECL_INITIAL (node->decl)((contains_struct_check ((node->decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 2886, __FUNCTION__))->decl_common.initial))
return vnode;
  }
return NULLnullptr;
2890}

2892/* Return next static variable with initializer after NODE.  */
2893inline varpool_node *
2894symbol_table::next_static_initializer (varpool_node *node)
2895{
symtab_node *node1 = node->next;
for (; node1; node1 = node1->next)
  {
    varpool_node *vnode1 = dyn_cast <varpool_node *> (node1);
    if (vnode1 && DECL_INITIAL (node1->decl)((contains_struct_check ((node1->decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 2900, __FUNCTION__))->decl_common.initial))
return vnode1;
  }
return NULLnullptr;
2904}

2906/* Walk all static variables with initializer set.  */
2907#define FOR_EACH_STATIC_INITIALIZER(node)for ((node) = symtab->first_static_initializer (); (node);
 (node) = symtab->next_static_initializer (node)) \
 for ((node) = symtab->first_static_initializer (); (node); \
(node) = symtab->next_static_initializer (node))

2911/* Return first static variable with definition.  */
2912inline varpool_node *
2913symbol_table::first_defined_variable (void)
2914{
symtab_node *node;
for (node = nodes; node; node = node->next)
  {
    varpool_node *vnode = dyn_cast <varpool_node *> (node);
    if (vnode && vnode->definition)
return vnode;
  }
return NULLnullptr;
2923}

2925/* Return next static variable with definition after NODE.  */
2926inline varpool_node *
2927symbol_table::next_defined_variable (varpool_node *node)
2928{
symtab_node *node1 = node->next;
for (; node1; node1 = node1->next)
  {
    varpool_node *vnode1 = dyn_cast <varpool_node *> (node1);
    if (vnode1 && vnode1->definition)
return vnode1;
  }
return NULLnullptr;
2937}
2938/* Walk all variables with definitions in current unit.  */
2939#define FOR_EACH_DEFINED_VARIABLE(node)for ((node) = symtab->first_defined_variable (); (node); (
node) = symtab->next_defined_variable (node)) \
 for ((node) = symtab->first_defined_variable (); (node); \
(node) = symtab->next_defined_variable (node))

2943/* Return first function with body defined.  */
2944inline cgraph_node *
2945symbol_table::first_defined_function (void)
2946{
symtab_node *node;
for (node = nodes; node; node = node->next)
  {
    cgraph_node *cn = dyn_cast <cgraph_node *> (node);
    if (cn && cn->definition)
return cn;
  }
return NULLnullptr;
2955}

2957/* Return next function with body defined after NODE.  */
2958inline cgraph_node *
2959symbol_table::next_defined_function (cgraph_node *node)
2960{
symtab_node *node1 = node->next;
for (; node1; node1 = node1->next)
  {
    cgraph_node *cn1 = dyn_cast <cgraph_node *> (node1);
    if (cn1 && cn1->definition)
return cn1;
  }
return NULLnullptr;
2969}

2971/* Walk all functions with body defined.  */
2972#define FOR_EACH_DEFINED_FUNCTION(node)for ((node) = symtab->first_defined_function (); (node); (
node) = symtab->next_defined_function ((node))) \
 for ((node) = symtab->first_defined_function (); (node); \
(node) = symtab->next_defined_function ((node)))

2976/* Return first function.  */
2977inline cgraph_node *
2978symbol_table::first_function (void)
2979{
symtab_node *node;
for (node = nodes; node; node = node->next)
  if (cgraph_node *cn = dyn_cast <cgraph_node *> (node))
    return cn;
return NULLnullptr;
2985}

2987/* Return next function.  */
2988inline cgraph_node *
2989symbol_table::next_function (cgraph_node *node)
2990{
symtab_node *node1 = node->next;
for (; node1; node1 = node1->next)
  if (cgraph_node *cn1 = dyn_cast <cgraph_node *> (node1))
    return cn1;
return NULLnullptr;
2996}

2998/* Return first function with body defined.  */
2999inline cgraph_node *
3000symbol_table::first_function_with_gimple_body (void)
3001{
symtab_node *node;
for (node = nodes; node; node = node->next)
4
←
Loop condition is true.  Entering loop body→
28
←
Loop condition is true.  Entering loop body→
  {
    cgraph_node *cn = dyn_cast <cgraph_node *> (node);
5
←
Calling 'dyn_cast<cgraph_node *, symtab_node>'→
22
←
Returning from 'dyn_cast<cgraph_node *, symtab_node>'→
29
←
Calling 'dyn_cast<cgraph_node *, symtab_node>'→
39
←
Returning from 'dyn_cast<cgraph_node *, symtab_node>'→
    if (cn22.1
'cn' is non-null
1
'cn' is non-null
1
'cn' is non-null
1
'cn' is non-null
1
'cn' is non-null
1
'cn' is non-null
1
'cn' is non-null
1
'cn' is non-null
1
'cn' is non-null
1
'cn' is non-null
1
'cn' is non-null
1
'cn' is non-null
1
'cn' is non-null
1
'cn' is non-null
1
'cn' is non-null
1
'cn' is non-null
 && cn->has_gimple_body_p ())
23
←
Calling 'cgraph_node::has_gimple_body_p'→
26
←
Returning from 'cgraph_node::has_gimple_body_p'→
27
←
Taking false branch→
40
←
Calling 'cgraph_node::has_gimple_body_p'→
45
←
Returning from 'cgraph_node::has_gimple_body_p'→
46
←
Taking true branch→
return cn;
47
←
Returning pointer (loaded from 'cn'), which participates in a condition later→
  }
return NULLnullptr;
3010}

3012/* Return next reachable static variable with initializer after NODE.  */
3013inline cgraph_node *
3014symbol_table::next_function_with_gimple_body (cgraph_node *node)
3015{
symtab_node *node1 = node->next;
for (; node1; node1 = node1->next)
  {
    cgraph_node *cn1 = dyn_cast <cgraph_node *> (node1);
    if (cn1 && cn1->has_gimple_body_p ())
return cn1;
  }
return NULLnullptr;
3024}

3026/* Walk all functions.  */
3027#define FOR_EACH_FUNCTION(node)for ((node) = symtab->first_function (); (node); (node) = symtab
->next_function ((node))) \
 for ((node) = symtab->first_function (); (node); \
(node) = symtab->next_function ((node)))

3031/* Return true when callgraph node is a function with Gimple body defined
 in current unit.  Functions can also be define externally or they
 can be thunks with no Gimple representation.

 Note that at WPA stage, the function body may not be present in memory.  */

3037inline bool
3038cgraph_node::has_gimple_body_p (void)
3039{
return definition && !thunk && !alias;
24
←
Assuming field 'definition' is 0→
25
←
Returning zero, which participates in a condition later→
41
←
Assuming field 'definition' is not equal to 0→
42
←
Assuming field 'thunk' is 0→
43
←
Assuming field 'alias' is 0→
44
←
Returning the value 1, which participates in a condition later→
3041}

3043/* Walk all functions with body defined.  */
3044#define FOR_EACH_FUNCTION_WITH_GIMPLE_BODY(node)for ((node) = symtab->first_function_with_gimple_body (); (
node); (node) = symtab->next_function_with_gimple_body (node
)) \
 for ((node) = symtab->first_function_with_gimple_body (); (node); \
(node) = symtab->next_function_with_gimple_body (node))

3048/* Uniquize all constants that appear in memory.
 Each constant in memory thus far output is recorded
 in `const_desc_table'.  */

3052struct GTY((for_user)) constant_descriptor_tree {
/* A MEM for the constant.  */
rtx rtl;

/* The value of the constant.  */
tree value;

/* Hash of value.  Computing the hash from value each time
   hashfn is called can't work properly, as that means recursive
   use of the hash table during hash table expansion.  */
hashval_t hash;
3063};

3065/* Return true when function is only called directly or it has alias.
 i.e. it is not externally visible, address was not taken and
 it is not used in any other non-standard way.  */

3069inline bool
3070cgraph_node::only_called_directly_or_aliased_p (void)
3071{
gcc_assert (!inlined_to)((void)(!(!inlined_to) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3072, __FUNCTION__), 0 : 0));
return (!force_output && !address_taken
 && !ifunc_resolver
 && !used_from_other_partition
 && !DECL_VIRTUAL_P (decl)((contains_struct_check ((decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3076, __FUNCTION__))->decl_common.virtual_flag)
 && !DECL_STATIC_CONSTRUCTOR (decl)((tree_check ((decl), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3077, __FUNCTION__, (FUNCTION_DECL)))->function_decl.static_ctor_flag
)
 && !DECL_STATIC_DESTRUCTOR (decl)((tree_check ((decl), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3078, __FUNCTION__, (FUNCTION_DECL)))->function_decl.static_dtor_flag
)
 && !used_from_object_file_p ()
 && !externally_visible);
3081}

3083/* Return true when function can be removed from callgraph
 if all direct calls are eliminated.  */

3086inline bool
3087cgraph_node::can_remove_if_no_direct_calls_and_refs_p (void)
3088{
gcc_checking_assert (!inlined_to)((void)(!(!inlined_to) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3089, __FUNCTION__), 0 : 0));
/* Extern inlines can always go, we will use the external definition.  */
if (DECL_EXTERNAL (decl)((contains_struct_check ((decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3091, __FUNCTION__))->decl_common.decl_flag_1))
  return true;
/* When function is needed, we cannot remove it.  */
if (force_output || used_from_other_partition)
  return false;
if (DECL_STATIC_CONSTRUCTOR (decl)((tree_check ((decl), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3096, __FUNCTION__, (FUNCTION_DECL)))->function_decl.static_ctor_flag
)
    || DECL_STATIC_DESTRUCTOR (decl)((tree_check ((decl), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3097, __FUNCTION__, (FUNCTION_DECL)))->function_decl.static_dtor_flag
))
  return false;
/* Only COMDAT functions can be removed if externally visible.  */
if (externally_visible
    && ((!DECL_COMDAT (decl)((contains_struct_check ((decl), (TS_DECL_WITH_VIS), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3101, __FUNCTION__))->decl_with_vis.comdat_flag) || ifunc_resolver)
 || forced_by_abi
 || used_from_object_file_p ()))
  return false;
return true;
3106}

3108/* Verify cgraph, if consistency checking is enabled.  */

3110inline void
3111cgraph_node::checking_verify_cgraph_nodes (void)
3112{
if (flag_checkingglobal_options.x_flag_checking)
  cgraph_node::verify_cgraph_nodes ();
3115}

3117/* Return true when variable can be removed from variable pool
 if all direct calls are eliminated.  */

3120inline bool
3121varpool_node::can_remove_if_no_refs_p (void)
3122{
if (DECL_EXTERNAL (decl)((contains_struct_check ((decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3123, __FUNCTION__))->decl_common.decl_flag_1))
  return true;
return (!force_output && !used_from_other_partition
 && ((DECL_COMDAT (decl)((contains_struct_check ((decl), (TS_DECL_WITH_VIS), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3126, __FUNCTION__))->decl_with_vis.comdat_flag)
      && !forced_by_abi
      && !used_from_object_file_p ())
     || !externally_visible
     || DECL_HAS_VALUE_EXPR_P (decl)((tree_check3 ((decl), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3130, __FUNCTION__, (VAR_DECL), (PARM_DECL), (RESULT_DECL))
) ->decl_common.decl_flag_2)));
3131}

3133/* Return true when all references to variable must be visible in ipa_ref_list.
 i.e. if the variable is not externally visible or not used in some magic
 way (asm statement or such).
 The magic uses are all summarized in force_output flag.  */

3138inline bool
3139varpool_node::all_refs_explicit_p ()
3140{
return (definition
 && !externally_visible
 && !used_from_other_partition
 && !force_output);
3145}

3147struct tree_descriptor_hasher : ggc_ptr_hash<constant_descriptor_tree>
3148{
static hashval_t hash (constant_descriptor_tree *);
static bool equal (constant_descriptor_tree *, constant_descriptor_tree *);
3151};

3153/* Constant pool accessor function.  */
3154hash_table<tree_descriptor_hasher> *constant_pool_htab (void);

3156/* Return node that alias is aliasing.  */

3158inline cgraph_node *
3159cgraph_node::get_alias_target (void)
3160{
return dyn_cast <cgraph_node *> (symtab_node::get_alias_target ());
3162}

3164/* Return node that alias is aliasing.  */

3166inline varpool_node *
3167varpool_node::get_alias_target (void)
3168{
return dyn_cast <varpool_node *> (symtab_node::get_alias_target ());
3170}

3172/* Walk the alias chain to return the symbol NODE is alias of.
 If NODE is not an alias, return NODE.
 When AVAILABILITY is non-NULL, get minimal availability in the chain.
 When REF is non-NULL, assume that reference happens in symbol REF
 when determining the availability.  */

3178inline symtab_node *
3179symtab_node::ultimate_alias_target (enum availability *availability,
		    symtab_node *ref)
3181{
if (!alias)
  {
    if (availability)
*availability = get_availability (ref);
    return this;
  }

return ultimate_alias_target_1 (availability, ref);
3190}

3192/* Given function symbol, walk the alias chain to return the function node
 is alias of. Do not walk through thunks.
 When AVAILABILITY is non-NULL, get minimal availability in the chain.
 When REF is non-NULL, assume that reference happens in symbol REF
 when determining the availability.  */

3198inline cgraph_node *
3199cgraph_node::ultimate_alias_target (enum availability *availability,
		    symtab_node *ref)
3201{
cgraph_node *n = dyn_cast <cgraph_node *>
  (symtab_node::ultimate_alias_target (availability, ref));
if (!n && availability)
  *availability = AVAIL_NOT_AVAILABLE;
return n;
3207}

3209/* For given variable pool node, walk the alias chain to return the function
 the variable is alias of. Do not walk through thunks.
 When AVAILABILITY is non-NULL, get minimal availability in the chain.
 When REF is non-NULL, assume that reference happens in symbol REF
 when determining the availability.  */

3215inline varpool_node *
3216varpool_node::ultimate_alias_target (availability *availability,
		     symtab_node *ref)
3218{
varpool_node *n = dyn_cast <varpool_node *>
  (symtab_node::ultimate_alias_target (availability, ref));

if (!n && availability)
  *availability = AVAIL_NOT_AVAILABLE;
return n;
3225}

3227/* Set callee N of call graph edge and add it to the corresponding set of
 callers. */

3230inline void
3231cgraph_edge::set_callee (cgraph_node *n)
3232{
prev_caller = NULLnullptr;
if (n->callers)
  n->callers->prev_caller = this;
next_caller = n->callers;
n->callers = this;
callee = n;
3239}

3241/* Return true when the edge represents a direct recursion.  */

3243inline bool
3244cgraph_edge::recursive_p (void)
3245{
cgraph_node *c = callee->ultimate_alias_target ();
if (caller->inlined_to)
  return caller->inlined_to->decl == c->decl;
else
  return caller->decl == c->decl;
3251}

3253/* Remove the edge from the list of the callers of the callee.  */

3255inline void
3256cgraph_edge::remove_callee (void)
3257{
gcc_assert (!indirect_unknown_callee)((void)(!(!indirect_unknown_callee) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3258, __FUNCTION__), 0 : 0));
if (prev_caller)
  prev_caller->next_caller = next_caller;
if (next_caller)
  next_caller->prev_caller = prev_caller;
if (!prev_caller)
  callee->callers = next_caller;
3265}

3267/* Return true if call must bind to current definition.  */

3269inline bool
3270cgraph_edge::binds_to_current_def_p ()
3271{
if (callee)
  return callee->binds_to_current_def_p (caller);
else
  return false;
3276}

3278/* Expected frequency of executions within the function.
 When set to CGRAPH_FREQ_BASE, the edge is expected to be called once
 per function call.  The range is 0 to CGRAPH_FREQ_MAX.  */

3282inline int
3283cgraph_edge::frequency ()
3284{
return count.to_cgraph_frequency (caller->inlined_to
		    ? caller->inlined_to->count
		    : caller->count);
3288}


3291/* Return true if the TM_CLONE bit is set for a given FNDECL.  */
3292static inline bool
3293decl_is_tm_clone (const_tree fndecl)
3294{
cgraph_node *n = cgraph_node::get (fndecl);
if (n)
  return n->tm_clone;
return false;
3299}

3301/* Likewise indicate that a node is needed, i.e. reachable via some
 external means.  */

3304inline void
3305cgraph_node::mark_force_output (void)
3306{
force_output = 1;
gcc_checking_assert (!inlined_to)((void)(!(!inlined_to) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3308, __FUNCTION__), 0 : 0));
3309}

3311/* Return true if function should be optimized for size.  */

3313inline enum optimize_size_level
3314cgraph_node::optimize_for_size_p (void)
3315{
if (opt_for_fn (decl, optimize_size)(opts_for_fn (decl)->x_optimize_size))
  return OPTIMIZE_SIZE_MAX;
if (count == profile_count::zero ())
  return OPTIMIZE_SIZE_MAX;
if (frequency == NODE_FREQUENCY_UNLIKELY_EXECUTED)
  return OPTIMIZE_SIZE_BALANCED;
else
  return OPTIMIZE_SIZE_NO;
3324}

3326/* Return symtab_node for NODE or create one if it is not present
 in symtab.  */

3329inline symtab_node *
3330symtab_node::get_create (tree node)
3331{
if (TREE_CODE (node)((enum tree_code) (node)->base.code) == VAR_DECL)
  return varpool_node::get_create (node);
else
  return cgraph_node::get_create (node);
3336}

3338/* Return availability of NODE when referenced from REF.  */

3340inline enum availability
3341symtab_node::get_availability (symtab_node *ref)
3342{
if (is_a <cgraph_node *> (this))
  return dyn_cast <cgraph_node *> (this)->get_availability (ref);
else
  return dyn_cast <varpool_node *> (this)->get_availability (ref);
3347}

3349/* Call callback on symtab node and aliases associated to this node.
 When INCLUDE_OVERWRITABLE is false, overwritable symbols are skipped. */

3352inline bool
3353symtab_node::call_for_symbol_and_aliases (bool (*callback) (symtab_node *,
					    void *),
			  void *data,
			  bool include_overwritable)
3357{
if (include_overwritable
    || get_availability () > AVAIL_INTERPOSABLE)
  {
    if (callback (this, data))
      return true;
  }
if (has_aliases_p ())
  return call_for_symbol_and_aliases_1 (callback, data, include_overwritable);
return false;
3367}

3369/* Call callback on function and aliases associated to the function.
 When INCLUDE_OVERWRITABLE is false, overwritable symbols are
 skipped.  */

3373inline bool
3374cgraph_node::call_for_symbol_and_aliases (bool (*callback) (cgraph_node *,
					    void *),
			  void *data,
			  bool include_overwritable)
3378{
if (include_overwritable
    || get_availability () > AVAIL_INTERPOSABLE)
  {
    if (callback (this, data))
      return true;
  }
if (has_aliases_p ())
  return call_for_symbol_and_aliases_1 (callback, data, include_overwritable);
return false;
3388}

3390/* Call callback on varpool symbol and aliases associated to varpool symbol.
 When INCLUDE_OVERWRITABLE is false, overwritable symbols are
 skipped. */

3394inline bool
3395varpool_node::call_for_symbol_and_aliases (bool (*callback) (varpool_node *,
					     void *),
			   void *data,
			   bool include_overwritable)
3399{
if (include_overwritable
    || get_availability () > AVAIL_INTERPOSABLE)
  {
    if (callback (this, data))
      return true;
  }
if (has_aliases_p ())
  return call_for_symbol_and_aliases_1 (callback, data, include_overwritable);
return false;
3409}

3411/* Return true if reference may be used in address compare.  */

3413inline bool
3414ipa_ref::address_matters_p ()
3415{
if (use != IPA_REF_ADDR)
  return false;
/* Addresses taken from virtual tables are never compared.  */
if (is_a <varpool_node *> (referring)
    && DECL_VIRTUAL_P (referring->decl)((contains_struct_check ((referring->decl), (TS_DECL_COMMON
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3420, __FUNCTION__))->decl_common.virtual_flag))
  return false;
return referred->address_can_be_compared_p ();
3423}

3425/* Build polymorphic call context for indirect call E.  */

3427inline
3428ipa_polymorphic_call_context::ipa_polymorphic_call_context (cgraph_edge *e)
3429{
gcc_checking_assert (e->indirect_info->polymorphic)((void)(!(e->indirect_info->polymorphic) ? fancy_abort (
"/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3430, __FUNCTION__), 0 : 0));
*this = e->indirect_info->context;
3432}

3434/* Build empty "I know nothing" context.  */

3436inline
3437ipa_polymorphic_call_context::ipa_polymorphic_call_context ()
3438{
clear_speculation ();
clear_outer_type ();
invalid = false;
3442}

3444/* Make context non-speculative.  */

3446inline void
3447ipa_polymorphic_call_context::clear_speculation ()
3448{
speculative_outer_type = NULLnullptr;
speculative_offset = 0;
speculative_maybe_derived_type = false;
3452}

3454/* Produce context specifying all derived types of OTR_TYPE.  If OTR_TYPE is
 NULL, the context is set to dummy "I know nothing" setting.  */

3457inline void
3458ipa_polymorphic_call_context::clear_outer_type (tree otr_type)
3459{
outer_type = otr_type ? TYPE_MAIN_VARIANT (otr_type)((tree_class_check ((otr_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3460, __FUNCTION__))->type_common.main_variant) : NULLnullptr;
offset = 0;
maybe_derived_type = true;
maybe_in_construction = true;
dynamic = true;
3465}

3467/* Adjust all offsets in contexts by OFF bits.  */

3469inline void
3470ipa_polymorphic_call_context::offset_by (HOST_WIDE_INTlong off)
3471{
if (outer_type)
  offset += off;
if (speculative_outer_type)
  speculative_offset += off;
3476}

3478/* Return TRUE if context is fully useless.  */

3480inline bool
3481ipa_polymorphic_call_context::useless_p () const
3482{
return (!outer_type && !speculative_outer_type);
3484}

3486/* When using fprintf (or similar), problems can arise with
 transient generated strings.  Many string-generation APIs
 only support one result being alive at once (e.g. by
 returning a pointer to a statically-allocated buffer).

 If there is more than one generated string within one
 fprintf call: the first string gets evicted or overwritten
 by the second, before fprintf is fully evaluated.
 See e.g. PR/53136.

 This function provides a workaround for this, by providing
 a simple way to create copies of these transient strings,
 without the need to have explicit cleanup:

     fprintf (dumpfile, "string 1: %s string 2:%s\n",
              xstrdup_for_dump (EXPR_1),
              xstrdup_for_dump (EXPR_2));

 This is actually a simple wrapper around ggc_strdup, but
 the name documents the intent.  We require that no GC can occur
 within the fprintf call.  */

3508static inline const char *
3509xstrdup_for_dump (const char *transient_str)
3510{
return ggc_strdup (transient_str)ggc_alloc_string ((transient_str), -1 );
3512}

3514/* During LTO stream-in this predicate can be used to check whether node
 in question prevails in the linking to save some memory usage.  */
3516inline bool
3517symtab_node::prevailing_p (void)
3518{
return definition && ((!TREE_PUBLIC (decl)((decl)->base.public_flag) && !DECL_EXTERNAL (decl)((contains_struct_check ((decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cgraph.h"
, 3519, __FUNCTION__))->decl_common.decl_flag_1))
	 || previous_sharing_asm_name == NULLnullptr);
3521}

3523extern GTY(()) symbol_table *saved_symtab;

3525#if CHECKING_P1

3527namespace selftest {

3529/* An RAII-style class for use in selftests for temporarily using a different
 symbol_table, so that such tests can be isolated from each other.  */

3532class symbol_table_test
3533{
public:
/* Constructor.  Override "symtab".  */
symbol_table_test ();

/* Destructor.  Restore the saved_symtab.  */
~symbol_table_test ();
3540};

3542} // namespace selftest

3544#endif /* CHECKING_P */

3546#endif  /* GCC_CGRAPH_H  */

←

/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/is-a.h

→

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

←

/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h

→

1/* Profile counter container type.
 Copyright (C) 2017-2021 Free Software Foundation, Inc.
 Contributed by Jan Hubicka

5This file is part of GCC.

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

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

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

21#ifndef GCC_PROFILE_COUNT_H
22#define GCC_PROFILE_COUNT_H

24struct function;
25struct profile_count;
26class sreal;

28/* Quality of the profile count.  Because gengtype does not support enums
 inside of classes, this is in global namespace.  */
30enum profile_quality {
/* Uninitialized value.  */
UNINITIALIZED_PROFILE,

/* Profile is based on static branch prediction heuristics and may
   or may not match reality.  It is local to function and cannot be compared
   inter-procedurally.  Never used by probabilities (they are always local).
 */
GUESSED_LOCAL,

/* Profile was read by feedback and was 0, we used local heuristics to guess
   better.  This is the case of functions not run in profile feedback.
   Never used by probabilities.  */
GUESSED_GLOBAL0,

/* Same as GUESSED_GLOBAL0 but global count is adjusted 0.  */
GUESSED_GLOBAL0_ADJUSTED,

/* Profile is based on static branch prediction heuristics.  It may or may
   not reflect the reality but it can be compared interprocedurally
   (for example, we inlined function w/o profile feedback into function
    with feedback and propagated from that).
   Never used by probabilities.  */
GUESSED,

/* Profile was determined by autofdo.  */
AFDO,

/* Profile was originally based on feedback but it was adjusted
   by code duplicating optimization.  It may not precisely reflect the
   particular code path.  */
ADJUSTED,

/* Profile was read from profile feedback or determined by accurate static
   method.  */
PRECISE
66};

68extern const char *profile_quality_as_string (enum profile_quality);
69extern bool parse_profile_quality (const char *value,
		   profile_quality *quality);

72/* The base value for branch probability notes and edge probabilities.  */
73#define REG_BR_PROB_BASE10000  10000

75#define RDIV(X,Y)(((X) + (Y) / 2) / (Y)) (((X) + (Y) / 2) / (Y))

77bool slow_safe_scale_64bit (uint64_t a, uint64_t b, uint64_t c, uint64_t *res);

79/* Compute RES=(a*b + c/2)/c capping and return false if overflow happened.  */

81inline bool
82safe_scale_64bit (uint64_t a, uint64_t b, uint64_t c, uint64_t *res)
83{
84#if (GCC_VERSION(4 * 1000 + 2) >= 5000)
uint64_t tmp;
if (!__builtin_mul_overflow (a, b, &tmp)
    && !__builtin_add_overflow (tmp, c/2, &tmp))
  {
    *res = tmp / c;
    return true;
  }
if (c == 1)
  {
    *res = (uint64_t) -1;
    return false;
  }
97#else
if (a < ((uint64_t)1 << 31)
    && b < ((uint64_t)1 << 31)
    && c < ((uint64_t)1 << 31))
  {
    *res = (a * b + (c / 2)) / c;
    return true;
  }
105#endif
return slow_safe_scale_64bit (a, b, c, res);
107}

109/* Data type to hold probabilities.  It implements fixed point arithmetics
 with capping so probability is always in range [0,1] and scaling requiring
 values greater than 1 needs to be represented otherwise.

 In addition to actual value the quality of profile is tracked and propagated
 through all operations.  Special value UNINITIALIZED_PROFILE is used for probabilities
 that has not been determined yet (for example because of
 -fno-guess-branch-probability)

 Typically probabilities are derived from profile feedback (via
 probability_in_gcov_type), autoFDO or guessed statically and then propagated
 thorough the compilation.

 Named probabilities are available:
   - never           (0 probability)
   - guessed_never
   - very_unlikely   (1/2000 probability)
   - unlikely        (1/5 probability)
   - even            (1/2 probability)
   - likely          (4/5 probability)
   - very_likely     (1999/2000 probability)
   - guessed_always
   - always

 Named probabilities except for never/always are assumed to be statically
 guessed and thus not necessarily accurate.  The difference between never
 and guessed_never is that the first one should be used only in case that
 well behaving program will very likely not execute the "never" path.
 For example if the path is going to abort () call or it exception handling.

 Always and guessed_always probabilities are symmetric.

 For legacy code we support conversion to/from REG_BR_PROB_BASE based fixpoint
 integer arithmetics. Once the code is converted to branch probabilities,
 these conversions will probably go away because they are lossy.
144*/

146class GTY((user)) profile_probability
147{
static const int n_bits = 29;
/* We can technically use ((uint32_t) 1 << (n_bits - 1)) - 2 but that
   will lead to harder multiplication sequences.  */
static const uint32_t max_probability = (uint32_t) 1 << (n_bits - 2);
static const uint32_t uninitialized_probability
 = ((uint32_t) 1 << (n_bits - 1)) - 1;

uint32_t m_val : 29;
enum profile_quality m_quality : 3;

friend struct profile_count;
159public:
profile_probability (): m_val (uninitialized_probability),
  m_quality (GUESSED)
{}

profile_probability (uint32_t val, profile_quality quality):
  m_val (val), m_quality (quality)
{}

/* Named probabilities.  */
static profile_probability never ()
  {
    profile_probability ret;
    ret.m_val = 0;
    ret.m_quality = PRECISE;
    return ret;
  }

static profile_probability guessed_never ()
  {
    profile_probability ret;
    ret.m_val = 0;
    ret.m_quality = GUESSED;
    return ret;
  }

static profile_probability very_unlikely ()
  {
    /* Be consistent with PROB_VERY_UNLIKELY in predict.h.  */
    profile_probability r = guessed_always ().apply_scale (1, 2000);
    r.m_val--;
    return r;
  }

static profile_probability unlikely ()
  {
    /* Be consistent with PROB_VERY_LIKELY in predict.h.  */
    profile_probability r = guessed_always ().apply_scale (1, 5);
    r.m_val--;
    return r;
  }

static profile_probability even ()
  {
    return guessed_always ().apply_scale (1, 2);
  }

static profile_probability very_likely ()
  {
    return always () - very_unlikely ();
  }

static profile_probability likely ()
  {
    return always () - unlikely ();
  }

static profile_probability guessed_always ()
  {
    profile_probability ret;
    ret.m_val = max_probability;
    ret.m_quality = GUESSED;
    return ret;
  }

static profile_probability always ()
  {
    profile_probability ret;
    ret.m_val = max_probability;
    ret.m_quality = PRECISE;
    return ret;
  }

/* Probabilities which has not been initialized. Either because
   initialization did not happen yet or because profile is unknown.  */
static profile_probability uninitialized ()
  {
    profile_probability c;
    c.m_val = uninitialized_probability;
    c.m_quality = GUESSED;
    return c;
  }

/* Return true if value has been initialized.  */
bool initialized_p () const
  {
    return m_val != uninitialized_probability;
  }

/* Return true if value can be trusted.  */
bool reliable_p () const
  {
    return m_quality >= ADJUSTED;
  }

/* Conversion from and to REG_BR_PROB_BASE integer fixpoint arithmetics.
   this is mostly to support legacy code and should go away.  */
static profile_probability from_reg_br_prob_base (int v)
  {
    profile_probability ret;
    gcc_checking_assert (v >= 0 && v <= REG_BR_PROB_BASE)((void)(!(v >= 0 && v <= 10000) ? fancy_abort (
"/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 259, __FUNCTION__), 0 : 0));
    ret.m_val = RDIV (v * (uint64_t) max_probability, REG_BR_PROB_BASE)(((v * (uint64_t) max_probability) + (10000) / 2) / (10000));
    ret.m_quality = GUESSED;
    return ret;
  }

/* Return THIS with quality set to ADJUSTED.  */
profile_probability adjusted () const
  {
    profile_probability ret = *this;
    if (!initialized_p ())
return *this;
    ret.m_quality = ADJUSTED;
    return ret;
  }

int to_reg_br_prob_base () const
  {
    gcc_checking_assert (initialized_p ())((void)(!(initialized_p ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 277, __FUNCTION__), 0 : 0));
    return RDIV (m_val * (uint64_t) REG_BR_PROB_BASE, max_probability)(((m_val * (uint64_t) 10000) + (max_probability) / 2) / (max_probability
));
  }

/* Conversion to and from RTL representation of profile probabilities.  */
static profile_probability from_reg_br_prob_note (int v)
  {
    profile_probability ret;
    ret.m_val = ((unsigned int)v) / 8;
    ret.m_quality = (enum profile_quality)(v & 7);
    return ret;
  }

int to_reg_br_prob_note () const
  {
    gcc_checking_assert (initialized_p ())((void)(!(initialized_p ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 292, __FUNCTION__), 0 : 0));
    int ret = m_val * 8 + m_quality;
    gcc_checking_assert (from_reg_br_prob_note (ret) == *this)((void)(!(from_reg_br_prob_note (ret) == *this) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 294, __FUNCTION__), 0 : 0));
    return ret;
  }

/* Return VAL1/VAL2.  */
static profile_probability probability_in_gcov_type
		 (gcov_type val1, gcov_type val2)
  {
    profile_probability ret;
    gcc_checking_assert (val1 >= 0 && val2 > 0)((void)(!(val1 >= 0 && val2 > 0) ? fancy_abort (
"/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 303, __FUNCTION__), 0 : 0));
    if (val1 > val2)
ret.m_val = max_probability;
    else
{
 uint64_t tmp;
 safe_scale_64bit (val1, max_probability, val2, &tmp);
 gcc_checking_assert (tmp <= max_probability)((void)(!(tmp <= max_probability) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 310, __FUNCTION__), 0 : 0));
 ret.m_val = tmp;
}
    ret.m_quality = PRECISE;
    return ret;
  }

/* Basic operations.  */
bool operator== (const profile_probability &other) const
  {
    return m_val == other.m_val && m_quality == other.m_quality;
  }

profile_probability operator+ (const profile_probability &other) const
  {
    if (other == never ())
return *this;
    if (*this == never ())
return other;
    if (!initialized_p () || !other.initialized_p ())
return uninitialized ();

    profile_probability ret;
    ret.m_val = MIN ((uint32_t)(m_val + other.m_val), max_probability)(((uint32_t)(m_val + other.m_val)) < (max_probability) ? (
(uint32_t)(m_val + other.m_val)) : (max_probability));
    ret.m_quality = MIN (m_quality, other.m_quality)((m_quality) < (other.m_quality) ? (m_quality) : (other.m_quality
));
    return ret;
  }

profile_probability &operator+= (const profile_probability &other)
  {
    if (other == never ())
return *this;
    if (*this == never ())
{
 *this = other;
 return *this;
}
    if (!initialized_p () || !other.initialized_p ())
return *this = uninitialized ();
    else
{
 m_val = MIN ((uint32_t)(m_val + other.m_val), max_probability)(((uint32_t)(m_val + other.m_val)) < (max_probability) ? (
(uint32_t)(m_val + other.m_val)) : (max_probability));
 m_quality = MIN (m_quality, other.m_quality)((m_quality) < (other.m_quality) ? (m_quality) : (other.m_quality
));
}
    return *this;
  }

profile_probability operator- (const profile_probability &other) const
  {
    if (*this == never ()
 || other == never ())
return *this;
    if (!initialized_p () || !other.initialized_p ())
return uninitialized ();
    profile_probability ret;
    ret.m_val = m_val >= other.m_val ? m_val - other.m_val : 0;
    ret.m_quality = MIN (m_quality, other.m_quality)((m_quality) < (other.m_quality) ? (m_quality) : (other.m_quality
));
    return ret;
  }

profile_probability &operator-= (const profile_probability &other)
  {
    if (*this == never ()
 || other == never ())
return *this;
    if (!initialized_p () || !other.initialized_p ())
return *this = uninitialized ();
    else
{
 m_val = m_val >= other.m_val ? m_val - other.m_val : 0;
 m_quality = MIN (m_quality, other.m_quality)((m_quality) < (other.m_quality) ? (m_quality) : (other.m_quality
));
}
    return *this;
  }

profile_probability operator* (const profile_probability &other) const
  {
    if (*this == never ()
 || other == never ())
return never ();
    if (!initialized_p () || !other.initialized_p ())
return uninitialized ();
    profile_probability ret;
    ret.m_val = RDIV ((uint64_t)m_val * other.m_val, max_probability)((((uint64_t)m_val * other.m_val) + (max_probability) / 2) / (
max_probability));
    ret.m_quality = MIN (MIN (m_quality, other.m_quality), ADJUSTED)((((m_quality) < (other.m_quality) ? (m_quality) : (other.
m_quality))) < (ADJUSTED) ? (((m_quality) < (other.m_quality
) ? (m_quality) : (other.m_quality))) : (ADJUSTED));
    return ret;
  }

profile_probability &operator*= (const profile_probability &other)
  {
    if (*this == never ()
 || other == never ())
return *this = never ();
    if (!initialized_p () || !other.initialized_p ())
return *this = uninitialized ();
    else
{
 m_val = RDIV ((uint64_t)m_val * other.m_val, max_probability)((((uint64_t)m_val * other.m_val) + (max_probability) / 2) / (
max_probability));
 m_quality = MIN (MIN (m_quality, other.m_quality), ADJUSTED)((((m_quality) < (other.m_quality) ? (m_quality) : (other.
m_quality))) < (ADJUSTED) ? (((m_quality) < (other.m_quality
) ? (m_quality) : (other.m_quality))) : (ADJUSTED));
}
    return *this;
  }

profile_probability operator/ (const profile_probability &other) const
  {
    if (*this == never ())
return never ();
    if (!initialized_p () || !other.initialized_p ())
return uninitialized ();
    profile_probability ret;
    /* If we get probability above 1, mark it as unreliable and return 1. */
    if (m_val >= other.m_val)
{
 ret.m_val = max_probability;
        ret.m_quality = MIN (MIN (m_quality, other.m_quality),((((m_quality) < (other.m_quality) ? (m_quality) : (other.
m_quality))) < (GUESSED) ? (((m_quality) < (other.m_quality
) ? (m_quality) : (other.m_quality))) : (GUESSED))
	       GUESSED)((((m_quality) < (other.m_quality) ? (m_quality) : (other.
m_quality))) < (GUESSED) ? (((m_quality) < (other.m_quality
) ? (m_quality) : (other.m_quality))) : (GUESSED));
 return ret;
}
    else if (!m_val)
ret.m_val = 0;
    else
{
 gcc_checking_assert (other.m_val)((void)(!(other.m_val) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 432, __FUNCTION__), 0 : 0));
 ret.m_val = MIN (RDIV ((uint64_t)m_val * max_probability,((((((uint64_t)m_val * max_probability) + (other.m_val) / 2) /
 (other.m_val))) < (max_probability) ? (((((uint64_t)m_val
 * max_probability) + (other.m_val) / 2) / (other.m_val))) : (
max_probability))
		 other.m_val),((((((uint64_t)m_val * max_probability) + (other.m_val) / 2) /
 (other.m_val))) < (max_probability) ? (((((uint64_t)m_val
 * max_probability) + (other.m_val) / 2) / (other.m_val))) : (
max_probability))
	   max_probability)((((((uint64_t)m_val * max_probability) + (other.m_val) / 2) /
 (other.m_val))) < (max_probability) ? (((((uint64_t)m_val
 * max_probability) + (other.m_val) / 2) / (other.m_val))) : (
max_probability));
}
    ret.m_quality = MIN (MIN (m_quality, other.m_quality), ADJUSTED)((((m_quality) < (other.m_quality) ? (m_quality) : (other.
m_quality))) < (ADJUSTED) ? (((m_quality) < (other.m_quality
) ? (m_quality) : (other.m_quality))) : (ADJUSTED));
    return ret;
  }

profile_probability &operator/= (const profile_probability &other)
  {
    if (*this == never ())
return *this = never ();
    if (!initialized_p () || !other.initialized_p ())
return *this = uninitialized ();
    else
{
        /* If we get probability above 1, mark it as unreliable
    and return 1. */
 if (m_val > other.m_val)
   {
     m_val = max_probability;
            m_quality = MIN (MIN (m_quality, other.m_quality),((((m_quality) < (other.m_quality) ? (m_quality) : (other.
m_quality))) < (GUESSED) ? (((m_quality) < (other.m_quality
) ? (m_quality) : (other.m_quality))) : (GUESSED))
	       GUESSED)((((m_quality) < (other.m_quality) ? (m_quality) : (other.
m_quality))) < (GUESSED) ? (((m_quality) < (other.m_quality
) ? (m_quality) : (other.m_quality))) : (GUESSED));
     return *this;
   }
 else if (!m_val)
   ;
 else
   {
     gcc_checking_assert (other.m_val)((void)(!(other.m_val) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 462, __FUNCTION__), 0 : 0));
     m_val = MIN (RDIV ((uint64_t)m_val * max_probability,((((((uint64_t)m_val * max_probability) + (other.m_val) / 2) /
 (other.m_val))) < (max_probability) ? (((((uint64_t)m_val
 * max_probability) + (other.m_val) / 2) / (other.m_val))) : (
max_probability))
		 other.m_val),((((((uint64_t)m_val * max_probability) + (other.m_val) / 2) /
 (other.m_val))) < (max_probability) ? (((((uint64_t)m_val
 * max_probability) + (other.m_val) / 2) / (other.m_val))) : (
max_probability))
	   max_probability)((((((uint64_t)m_val * max_probability) + (other.m_val) / 2) /
 (other.m_val))) < (max_probability) ? (((((uint64_t)m_val
 * max_probability) + (other.m_val) / 2) / (other.m_val))) : (
max_probability));
   }
 m_quality = MIN (MIN (m_quality, other.m_quality), ADJUSTED)((((m_quality) < (other.m_quality) ? (m_quality) : (other.
m_quality))) < (ADJUSTED) ? (((m_quality) < (other.m_quality
) ? (m_quality) : (other.m_quality))) : (ADJUSTED));
}
    return *this;
  }

/* Split *THIS (ORIG) probability into 2 probabilities, such that
   the returned one (FIRST) is *THIS * CPROB and *THIS is
   adjusted (SECOND) so that FIRST + FIRST.invert () * SECOND
   == ORIG.  This is useful e.g. when splitting a conditional
   branch like:
   if (cond)
     goto lab; // ORIG probability
   into
   if (cond1)
     goto lab; // FIRST = ORIG * CPROB probability
   if (cond2)
     goto lab; // SECOND probability
   such that the overall probability of jumping to lab remains
   the same.  CPROB gives the relative probability between the
   branches.  */
profile_probability split (const profile_probability &cprob)
  {
    profile_probability ret = *this * cprob;
    /* The following is equivalent to:
       *this = cprob.invert () * *this / ret.invert ();
Avoid scaling when overall outcome is supposed to be always.
Without knowing that one is inverse of other, the result would be
conservative.  */
    if (!(*this == always ()))
      *this = (*this - ret) / ret.invert ();
    return ret;
  }

gcov_type apply (gcov_type val) const
  {
    if (*this == uninitialized ())
return val / 2;
    return RDIV (val * m_val, max_probability)(((val * m_val) + (max_probability) / 2) / (max_probability));
  }

/* Return 1-*THIS.  */
profile_probability invert () const
  {
    return always() - *this;
  }

/* Return THIS with quality dropped to GUESSED.  */
profile_probability guessed () const
  {
    profile_probability ret = *this;
    ret.m_quality = GUESSED;
    return ret;
  }

/* Return THIS with quality dropped to AFDO.  */
profile_probability afdo () const
  {
    profile_probability ret = *this;
    ret.m_quality = AFDO;
    return ret;
  }

/* Return *THIS * NUM / DEN.  */
profile_probability apply_scale (int64_t num, int64_t den) const
  {
    if (*this == never ())
return *this;
    if (!initialized_p ())
return uninitialized ();
    profile_probability ret;
    uint64_t tmp;
    safe_scale_64bit (m_val, num, den, &tmp);
    ret.m_val = MIN (tmp, max_probability)((tmp) < (max_probability) ? (tmp) : (max_probability));
    ret.m_quality = MIN (m_quality, ADJUSTED)((m_quality) < (ADJUSTED) ? (m_quality) : (ADJUSTED));
    return ret;
  }

/* Return true when the probability of edge is reliable.

   The profile guessing code is good at predicting branch outcome (i.e.
   taken/not taken), that is predicted right slightly over 75% of time.
   It is however notoriously poor on predicting the probability itself.
   In general the profile appear a lot flatter (with probabilities closer
   to 50%) than the reality so it is bad idea to use it to drive optimization
   such as those disabling dynamic branch prediction for well predictable
   branches.

   There are two exceptions - edges leading to noreturn edges and edges
   predicted by number of iterations heuristics are predicted well.  This macro
   should be able to distinguish those, but at the moment it simply check for
   noreturn heuristic that is only one giving probability over 99% or bellow
   1%.  In future we might want to propagate reliability information across the
   CFG if we find this information useful on multiple places.   */
bool probably_reliable_p () const
  {
    if (m_quality >= ADJUSTED)
return true;
    if (!initialized_p ())
return false;
    return m_val < max_probability / 100
    || m_val > max_probability - max_probability / 100;
  }

/* Return false if profile_probability is bogus.  */
bool verify () const
  {
    gcc_checking_assert (m_quality != UNINITIALIZED_PROFILE)((void)(!(m_quality != UNINITIALIZED_PROFILE) ? fancy_abort (
"/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 573, __FUNCTION__), 0 : 0));
    if (m_val == uninitialized_probability)
return m_quality == GUESSED;
    else if (m_quality < GUESSED)
return false;
    return m_val <= max_probability;
  }

/* Comparisons are three-state and conservative.  False is returned if
   the inequality cannot be decided.  */
bool operator< (const profile_probability &other) const
  {
    return initialized_p () && other.initialized_p () && m_val < other.m_val;
  }

bool operator> (const profile_probability &other) const
  {
    return initialized_p () && other.initialized_p () && m_val > other.m_val;
  }

bool operator<= (const profile_probability &other) const
  {
    return initialized_p () && other.initialized_p () && m_val <= other.m_val;
  }

bool operator>= (const profile_probability &other) const
  {
    return initialized_p () && other.initialized_p () && m_val >= other.m_val;
  }

/* Get the value of the count.  */
uint32_t value () const { return m_val; }

/* Get the quality of the count.  */
enum profile_quality quality () const { return m_quality; }

/* Output THIS to F.  */
void dump (FILE *f) const;

/* Print THIS to stderr.  */
void debug () const;

/* Return true if THIS is known to differ significantly from OTHER.  */
bool differs_from_p (profile_probability other) const;

/* Return if difference is greater than 50%.  */
bool differs_lot_from_p (profile_probability other) const;

/* COUNT1 times event happens with *THIS probability, COUNT2 times OTHER
   happens with COUNT2 probability. Return probability that either *THIS or
   OTHER happens.  */
profile_probability combine_with_count (profile_count count1,
			  profile_probability other,
			  profile_count count2) const;

/* Return probability as sreal.  */
sreal to_sreal () const;
/* LTO streaming support.  */
static profile_probability stream_in (class lto_input_block *);
void stream_out (struct output_block *);
void stream_out (struct lto_output_stream *);
634};

636/* Main data type to hold profile counters in GCC. Profile counts originate
 either from profile feedback, static profile estimation or both.  We do not
 perform whole program profile propagation and thus profile estimation
 counters are often local to function, while counters from profile feedback
 (or special cases of profile estimation) can be used inter-procedurally.

 There are 3 basic types
   1) local counters which are result of intra-procedural static profile
      estimation.
   2) ipa counters which are result of profile feedback or special case
      of static profile estimation (such as in function main).
   3) counters which counts as 0 inter-procedurally (because given function
      was never run in train feedback) but they hold local static profile
      estimate.

 Counters of type 1 and 3 cannot be mixed with counters of different type
 within operation (because whole function should use one type of counter)
 with exception that global zero mix in most operations where outcome is
 well defined.

 To take local counter and use it inter-procedurally use ipa member function
 which strips information irrelevant at the inter-procedural level.

 Counters are 61bit integers representing number of executions during the
 train run or normalized frequency within the function.

 As the profile is maintained during the compilation, many adjustments are
 made.  Not all transformations can be made precisely, most importantly
 when code is being duplicated.  It also may happen that part of CFG has
 profile counts known while other do not - for example when LTO optimizing
 partly profiled program or when profile was lost due to COMDAT merging.

 For this reason profile_count tracks more information than
 just unsigned integer and it is also ready for profile mismatches.
 The API of this data type represent operations that are natural
 on profile counts - sum, difference and operation with scales and
 probabilities.  All operations are safe by never getting negative counts
 and they do end up in uninitialized scale if any of the parameters is
 uninitialized.

 All comparisons that are three state and handling of probabilities.  Thus
 a < b is not equal to !(a >= b).

 The following pre-defined counts are available:

 profile_count::zero ()  for code that is known to execute zero times at
    runtime (this can be detected statically i.e. for paths leading to
    abort ();
 profile_count::one () for code that is known to execute once (such as
    main () function
 profile_count::uninitialized ()  for unknown execution count.

*/

690struct GTY(()) profile_count
691{
692public:
/* Use 62bit to hold basic block counters.  Should be at least
   64bit.  Although a counter cannot be negative, we use a signed
   type to hold various extra stages.  */

static const int n_bits = 61;
static const uint64_t max_count = ((uint64_t) 1 << n_bits) - 2;
699private:
static const uint64_t uninitialized_count = ((uint64_t) 1 << n_bits) - 1;

702#if defined (__arm__) && (__GNUC__4 >= 6 && __GNUC__4 <= 8)
/* Work-around for PR88469.  A bug in the gcc-6/7/8 PCS layout code
   incorrectly detects the alignment of a structure where the only
   64-bit aligned object is a bit-field.  We force the alignment of
   the entire field to mitigate this.  */
707#define UINT64_BIT_FIELD_ALIGN __attribute__ ((aligned(8)))
708#else
709#define UINT64_BIT_FIELD_ALIGN
710#endif
uint64_t UINT64_BIT_FIELD_ALIGN m_val : n_bits;
712#undef UINT64_BIT_FIELD_ALIGN
enum profile_quality m_quality : 3;
714public:

/* Return true if both values can meaningfully appear in single function
   body.  We have either all counters in function local or global, otherwise
   operations between them are not really defined well.  */
bool compatible_p (const profile_count other) const
  {
    if (!initialized_p () || !other.initialized_p ())
return true;
    if (*this == zero ()
 || other == zero ())
return true;
    /* Do not allow nonzero global profile together with local guesses
that are globally0.  */
    if (ipa ().nonzero_p ()
 && !(other.ipa () == other))
return false;
    if (other.ipa ().nonzero_p ()
 && !(ipa () == *this))
return false;

    return ipa_p () == other.ipa_p ();
  }

/* Used for counters which are expected to be never executed.  */
static profile_count zero ()
  {
    return from_gcov_type (0);
  }

static profile_count adjusted_zero ()
  {
    profile_count c;
    c.m_val = 0;
    c.m_quality = ADJUSTED;
    return c;
  }

static profile_count guessed_zero ()
  {
    profile_count c;
    c.m_val = 0;
    c.m_quality = GUESSED;
    return c;
  }

static profile_count one ()
  {
    return from_gcov_type (1);
  }

/* Value of counters which has not been initialized. Either because
   initialization did not happen yet or because profile is unknown.  */
static profile_count uninitialized ()
  {
    profile_count c;
    c.m_val = uninitialized_count;
    c.m_quality = GUESSED_LOCAL;
    return c;
  }

/* Conversion to gcov_type is lossy.  */
gcov_type to_gcov_type () const
  {
    gcc_checking_assert (initialized_p ())((void)(!(initialized_p ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 778, __FUNCTION__), 0 : 0));
    return m_val;
  }

/* Return true if value has been initialized.  */
bool initialized_p () const
  {
    return m_val != uninitialized_count;
  }

/* Return true if value can be trusted.  */
bool reliable_p () const
  {
    return m_quality >= ADJUSTED;
  }

/* Return true if value can be operated inter-procedurally.  */
bool ipa_p () const
  {
    return !initialized_p () || m_quality >= GUESSED_GLOBAL0;
51
←
Returning the value 1, which participates in a condition later→
  }

/* Return true if quality of profile is precise.  */
bool precise_p () const
  {
    return m_quality == PRECISE;
  }

/* Get the value of the count.  */
uint32_t value () const { return m_val; }

/* Get the quality of the count.  */
enum profile_quality quality () const { return m_quality; }

/* When merging basic blocks, the two different profile counts are unified.
   Return true if this can be done without losing info about profile.
   The only case we care about here is when first BB contains something
   that makes it terminate in a way not visible in CFG.  */
bool ok_for_merging (profile_count other) const
  {
    if (m_quality < ADJUSTED
 || other.m_quality < ADJUSTED)
return true;
    return !(other < *this);
  }

/* When merging two BBs with different counts, pick common count that looks
   most representative.  */
profile_count merge (profile_count other) const
  {
    if (*this == other || !other.initialized_p ()
 || m_quality > other.m_quality)
return *this;
    if (other.m_quality > m_quality
 || other > *this)
return other;
    return *this;
  }

/* Basic operations.  */
bool operator== (const profile_count &other) const
  {
    return m_val == other.m_val && m_quality == other.m_quality;
  }

profile_count operator+ (const profile_count &other) const
  {
    if (other == zero ())
return *this;
    if (*this == zero ())
return other;
    if (!initialized_p () || !other.initialized_p ())
return uninitialized ();

    profile_count ret;
    gcc_checking_assert (compatible_p (other))((void)(!(compatible_p (other)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 853, __FUNCTION__), 0 : 0));
    ret.m_val = m_val + other.m_val;
    ret.m_quality = MIN (m_quality, other.m_quality)((m_quality) < (other.m_quality) ? (m_quality) : (other.m_quality
));
    return ret;
  }

profile_count &operator+= (const profile_count &other)
  {
    if (other == zero ())
return *this;
    if (*this == zero ())
{
 *this = other;
 return *this;
}
    if (!initialized_p () || !other.initialized_p ())
return *this = uninitialized ();
    else
{
        gcc_checking_assert (compatible_p (other))((void)(!(compatible_p (other)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 872, __FUNCTION__), 0 : 0));
 m_val += other.m_val;
 m_quality = MIN (m_quality, other.m_quality)((m_quality) < (other.m_quality) ? (m_quality) : (other.m_quality
));
}
    return *this;
  }

profile_count operator- (const profile_count &other) const
  {
    if (*this == zero () || other == zero ())
return *this;
    if (!initialized_p () || !other.initialized_p ())
return uninitialized ();
    gcc_checking_assert (compatible_p (other))((void)(!(compatible_p (other)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 885, __FUNCTION__), 0 : 0));
    profile_count ret;
    ret.m_val = m_val >= other.m_val ? m_val - other.m_val : 0;
    ret.m_quality = MIN (m_quality, other.m_quality)((m_quality) < (other.m_quality) ? (m_quality) : (other.m_quality
));
    return ret;
  }

profile_count &operator-= (const profile_count &other)
  {
    if (*this == zero () || other == zero ())
return *this;
    if (!initialized_p () || !other.initialized_p ())
return *this = uninitialized ();
    else
{
        gcc_checking_assert (compatible_p (other))((void)(!(compatible_p (other)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 900, __FUNCTION__), 0 : 0));
 m_val = m_val >= other.m_val ? m_val - other.m_val: 0;
 m_quality = MIN (m_quality, other.m_quality)((m_quality) < (other.m_quality) ? (m_quality) : (other.m_quality
));
}
    return *this;
  }

/* Return false if profile_count is bogus.  */
bool verify () const
  {
    gcc_checking_assert (m_quality != UNINITIALIZED_PROFILE)((void)(!(m_quality != UNINITIALIZED_PROFILE) ? fancy_abort (
"/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 910, __FUNCTION__), 0 : 0));
    return m_val != uninitialized_count || m_quality == GUESSED_LOCAL;
  }

/* Comparisons are three-state and conservative.  False is returned if
   the inequality cannot be decided.  */
bool operator< (const profile_count &other) const
  {
    if (!initialized_p () || !other.initialized_p ())
return false;
    if (*this == zero ())
return !(other == zero ());
    if (other == zero ())
return false;
    gcc_checking_assert (compatible_p (other))((void)(!(compatible_p (other)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 924, __FUNCTION__), 0 : 0));
    return m_val < other.m_val;
  }

bool operator> (const profile_count &other) const
  {
    if (!initialized_p () || !other.initialized_p ())
return false;
    if (*this  == zero ())
return false;
    if (other == zero ())
return !(*this == zero ());
    gcc_checking_assert (compatible_p (other))((void)(!(compatible_p (other)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 936, __FUNCTION__), 0 : 0));
    return initialized_p () && other.initialized_p () && m_val > other.m_val;
  }

bool operator< (const gcov_type other) const
  {
    gcc_checking_assert (ipa_p ())((void)(!(ipa_p ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 942, __FUNCTION__), 0 : 0));
    gcc_checking_assert (other >= 0)((void)(!(other >= 0) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 943, __FUNCTION__), 0 : 0));
    return ipa ().initialized_p () && ipa ().m_val < (uint64_t) other;
  }

bool operator> (const gcov_type other) const
  {
    gcc_checking_assert (ipa_p ())((void)(!(ipa_p ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 949, __FUNCTION__), 0 : 0));
    gcc_checking_assert (other >= 0)((void)(!(other >= 0) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 950, __FUNCTION__), 0 : 0));
    return ipa ().initialized_p () && ipa ().m_val > (uint64_t) other;
  }

bool operator<= (const profile_count &other) const
  {
    if (!initialized_p () || !other.initialized_p ())
return false;
    if (*this == zero ())
return true;
    if (other == zero ())
return (*this == zero ());
    gcc_checking_assert (compatible_p (other))((void)(!(compatible_p (other)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 962, __FUNCTION__), 0 : 0));
    return m_val <= other.m_val;
  }

bool operator>= (const profile_count &other) const
  {
    if (!initialized_p () || !other.initialized_p ())
return false;
    if (other == zero ())
return true;
    if (*this == zero ())
return (other == zero ());
    gcc_checking_assert (compatible_p (other))((void)(!(compatible_p (other)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 974, __FUNCTION__), 0 : 0));
    return m_val >= other.m_val;
  }

bool operator<= (const gcov_type other) const
  {
    gcc_checking_assert (ipa_p ())((void)(!(ipa_p ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 980, __FUNCTION__), 0 : 0));
    gcc_checking_assert (other >= 0)((void)(!(other >= 0) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 981, __FUNCTION__), 0 : 0));
    return ipa ().initialized_p () && ipa ().m_val <= (uint64_t) other;
  }

bool operator>= (const gcov_type other) const
  {
    gcc_checking_assert (ipa_p ())((void)(!(ipa_p ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 987, __FUNCTION__), 0 : 0));
    gcc_checking_assert (other >= 0)((void)(!(other >= 0) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/profile-count.h"
, 988, __FUNCTION__), 0 : 0));
    return ipa ().initialized_p () && ipa ().m_val >= (uint64_t) other;
  }

/* Return true when value is not zero and can be used for scaling. 
   This is different from *this > 0 because that requires counter to
   be IPA.  */
bool nonzero_p () const
  {
    return initialized_p () && m_val != 0;
  }

/* Make counter forcibly nonzero.  */
profile_count force_nonzero () const
  {
    if (!initialized_p ())
return *this;
    profile_count ret = *this;
    if (ret.m_val == 0)
{
 ret.m_val = 1;
        ret.m_quality = MIN (m_quality, ADJUSTED)((m_quality) < (ADJUSTED) ? (m_quality) : (ADJUSTED));
}
    return ret;
  }

profile_count max (profile_count other) const
  {
    profile_count val = *this;

    /* Always prefer nonzero IPA counts over local counts.  */
    if (ipa ().nonzero_p () || other.ipa ().nonzero_p ())
{
 val = ipa ();