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

Bug Summary

File:	build/gcc/vec.h
Warning:	line 815, column 10 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 alias.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-AaC18R.plist -x c++ /home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c

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

→

1/* Alias analysis for GNU C
 Copyright (C) 1997-2021 Free Software Foundation, Inc.
 Contributed by John Carr (jfc@mit.edu).

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#include "config.h"
22#include "system.h"
23#include "coretypes.h"
24#include "backend.h"
25#include "target.h"
26#include "rtl.h"
27#include "tree.h"
28#include "gimple.h"
29#include "df.h"
30#include "memmodel.h"
31#include "tm_p.h"
32#include "gimple-ssa.h"
33#include "emit-rtl.h"
34#include "alias.h"
35#include "fold-const.h"
36#include "varasm.h"
37#include "cselib.h"
38#include "langhooks.h"
39#include "cfganal.h"
40#include "rtl-iter.h"
41#include "cgraph.h"
42#include "ipa-utils.h"

44/* The aliasing API provided here solves related but different problems:

 Say there exists (in c)

 struct X {
   struct Y y1;
   struct Z z2;
 } x1, *px1,  *px2;

 struct Y y2, *py;
 struct Z z2, *pz;


 py = &x1.y1;
 px2 = &x1;

 Consider the four questions:

 Can a store to x1 interfere with px2->y1?
 Can a store to x1 interfere with px2->z2?
 Can a store to x1 change the value pointed to by with py?
 Can a store to x1 change the value pointed to by with pz?

 The answer to these questions can be yes, yes, yes, and maybe.

 The first two questions can be answered with a simple examination
 of the type system.  If structure X contains a field of type Y then
 a store through a pointer to an X can overwrite any field that is
 contained (recursively) in an X (unless we know that px1 != px2).

 The last two questions can be solved in the same way as the first
 two questions but this is too conservative.  The observation is
 that in some cases we can know which (if any) fields are addressed
 and if those addresses are used in bad ways.  This analysis may be
 language specific.  In C, arbitrary operations may be applied to
 pointers.  However, there is some indication that this may be too
 conservative for some C++ types.

 The pass ipa-type-escape does this analysis for the types whose
 instances do not escape across the compilation boundary.

 Historically in GCC, these two problems were combined and a single
 data structure that was used to represent the solution to these
 problems.  We now have two similar but different data structures,
 The data structure to solve the last two questions is similar to
 the first, but does not contain the fields whose address are never
 taken.  For types that do escape the compilation unit, the data
 structures will have identical information.
92*/

94/* The alias sets assigned to MEMs assist the back-end in determining
 which MEMs can alias which other MEMs.  In general, two MEMs in
 different alias sets cannot alias each other, with one important
 exception.  Consider something like:

   struct S { int i; double d; };

 a store to an `S' can alias something of either type `int' or type
 `double'.  (However, a store to an `int' cannot alias a `double'
 and vice versa.)  We indicate this via a tree structure that looks
 like:
  struct S
   /   \
  /     \
|/_     _\|
int    double

 (The arrows are directed and point downwards.)
  In this situation we say the alias set for `struct S' is the
 `superset' and that those for `int' and `double' are `subsets'.

 To see whether two alias sets can point to the same memory, we must
 see if either alias set is a subset of the other. We need not trace
 past immediate descendants, however, since we propagate all
 grandchildren up one level.

 Alias set zero is implicitly a superset of all other alias sets.
 However, this is no actual entry for alias set zero.  It is an
 error to attempt to explicitly construct a subset of zero.  */

124struct alias_set_hash : int_hash <int, INT_MIN(-2147483647 -1), INT_MIN(-2147483647 -1) + 1> {};

126struct GTY(()) alias_set_entry {
/* The alias set number, as stored in MEM_ALIAS_SET.  */
alias_set_type alias_set;

/* Nonzero if would have a child of zero: this effectively makes this
   alias set the same as alias set zero.  */
bool has_zero_child;
/* Nonzero if alias set corresponds to pointer type itself (i.e. not to
   aggregate contaiing pointer.
   This is used for a special case where we need an universal pointer type
   compatible with all other pointer types.  */
bool is_pointer;
/* Nonzero if is_pointer or if one of childs have has_pointer set.  */
bool has_pointer;

/* The children of the alias set.  These are not just the immediate
   children, but, in fact, all descendants.  So, if we have:

     struct T { struct S s; float f; }

   continuing our example above, the children here will be all of
   `int', `double', `float', and `struct S'.  */
hash_map<alias_set_hash, int> *children;
149};

151static int rtx_equal_for_memref_p (const_rtx, const_rtx);
152static void record_set (rtx, const_rtx, void *);
153static int base_alias_check (rtx, rtx, rtx, rtx, machine_mode,
	     machine_mode);
155static rtx find_base_value (rtx);
156static int mems_in_disjoint_alias_sets_p (const_rtx, const_rtx);
157static alias_set_entry *get_alias_set_entry (alias_set_type);
158static tree decl_for_component_ref (tree);
159static int write_dependence_p (const_rtx,
	       const_rtx, machine_mode, rtx,
	       bool, bool, bool);
162static int compare_base_symbol_refs (const_rtx, const_rtx);

164static void memory_modified_1 (rtx, const_rtx, void *);

166/* Query statistics for the different low-level disambiguators.
 A high-level query may trigger multiple of them.  */

169static struct {
unsigned long long num_alias_zero;
unsigned long long num_same_alias_set;
unsigned long long num_same_objects;
unsigned long long num_volatile;
unsigned long long num_dag;
unsigned long long num_universal;
unsigned long long num_disambiguated;
177} alias_stats;


180/* Set up all info needed to perform alias analysis on memory references.  */

182/* Returns the size in bytes of the mode of X.  */
183#define SIZE_FOR_MODE(X)(GET_MODE_SIZE (((machine_mode) (X)->mode))) (GET_MODE_SIZE (GET_MODE (X)((machine_mode) (X)->mode)))

185/* Cap the number of passes we make over the insns propagating alias
 information through set chains.
 ??? 10 is a completely arbitrary choice.  This should be based on the
 maximum loop depth in the CFG, but we do not have this information
 available (even if current_loops _is_ available).  */
190#define MAX_ALIAS_LOOP_PASSES10 10

192/* reg_base_value[N] gives an address to which register N is related.
 If all sets after the first add or subtract to the current value
 or otherwise modify it so it does not point to a different top level
 object, reg_base_value[N] is equal to the address part of the source
 of the first set.

 A base address can be an ADDRESS, SYMBOL_REF, or LABEL_REF.  ADDRESS
 expressions represent three types of base:

   1. incoming arguments.  There is just one ADDRESS to represent all
arguments, since we do not know at this level whether accesses
based on different arguments can alias.  The ADDRESS has id 0.

   2. stack_pointer_rtx, frame_pointer_rtx, hard_frame_pointer_rtx
(if distinct from frame_pointer_rtx) and arg_pointer_rtx.
Each of these rtxes has a separate ADDRESS associated with it,
each with a negative id.

GCC is (and is required to be) precise in which register it
chooses to access a particular region of stack.  We can therefore
assume that accesses based on one of these rtxes do not alias
accesses based on another of these rtxes.

   3. bases that are derived from malloc()ed memory (REG_NOALIAS).
Each such piece of memory has a separate ADDRESS associated
with it, each with an id greater than 0.

 Accesses based on one ADDRESS do not alias accesses based on other
 ADDRESSes.  Accesses based on ADDRESSes in groups (2) and (3) do not
 alias globals either; the ADDRESSes have Pmode to indicate this.
 The ADDRESS in group (1) _may_ alias globals; it has VOIDmode to
 indicate this.  */

225static GTY(()) vec<rtx, va_gc> *reg_base_value;
226static rtx *new_reg_base_value;

228/* The single VOIDmode ADDRESS that represents all argument bases.
 It has id 0.  */
230static GTY(()) rtx arg_base_value;

232/* Used to allocate unique ids to each REG_NOALIAS ADDRESS.  */
233static int unique_id;

235/* We preserve the copy of old array around to avoid amount of garbage
 produced.  About 8% of garbage produced were attributed to this
 array.  */
238static GTY((deletable)) vec<rtx, va_gc> *old_reg_base_value;

240/* Values of XINT (address, 0) of Pmode ADDRESS rtxes for special
 registers.  */
242#define UNIQUE_BASE_VALUE_SP-1	-1
243#define UNIQUE_BASE_VALUE_ARGP-2	-2
244#define UNIQUE_BASE_VALUE_FP-3	-3
245#define UNIQUE_BASE_VALUE_HFP-4	-4

247#define static_reg_base_value(this_target_rtl->x_static_reg_base_value) \
(this_target_rtl->x_static_reg_base_value)

250#define REG_BASE_VALUE(X)((rhs_regno(X)) < vec_safe_length (reg_base_value) ? (*reg_base_value
)[(rhs_regno(X))] : 0)					\
(REGNO (X)(rhs_regno(X)) < vec_safe_length (reg_base_value)			\
 ? (*reg_base_value)[REGNO (X)(rhs_regno(X))] : 0)

254/* Vector indexed by N giving the initial (unchanging) value known for
 pseudo-register N.  This vector is initialized in init_alias_analysis,
 and does not change until end_alias_analysis is called.  */
257static GTY(()) vec<rtx, va_gc> *reg_known_value;

259/* Vector recording for each reg_known_value whether it is due to a
 REG_EQUIV note.  Future passes (viz., reload) may replace the
 pseudo with the equivalent expression and so we account for the
 dependences that would be introduced if that happens.

 The REG_EQUIV notes created in assign_parms may mention the arg
 pointer, and there are explicit insns in the RTL that modify the
 arg pointer.  Thus we must ensure that such insns don't get
 scheduled across each other because that would invalidate the
 REG_EQUIV notes.  One could argue that the REG_EQUIV notes are
 wrong, but solving the problem in the scheduler will likely give
 better code, so we do it here.  */
271static sbitmap reg_known_equiv_p;

273/* True when scanning insns from the start of the rtl to the
 NOTE_INSN_FUNCTION_BEG note.  */
275static bool copying_arguments;


278/* The splay-tree used to store the various alias set entries.  */
279static GTY (()) vec<alias_set_entry *, va_gc> *alias_sets;
280
281/* Build a decomposed reference object for querying the alias-oracle
 from the MEM rtx and store it in *REF.
 Returns false if MEM is not suitable for the alias-oracle.  */

285static bool
286ao_ref_from_mem (ao_ref *ref, const_rtx mem)
287{
tree expr = MEM_EXPR (mem)(get_mem_attrs (mem)->expr);
tree base;

if (!expr)
  return false;

ao_ref_init (ref, expr);

/* Get the base of the reference and see if we have to reject or
   adjust it.  */
base = ao_ref_base (ref);
if (base == NULL_TREE(tree) nullptr)
  return false;

/* The tree oracle doesn't like bases that are neither decls
   nor indirect references of SSA names.  */
if (!(DECL_P (base)(tree_code_type[(int) (((enum tree_code) (base)->base.code
))] == tcc_declaration)
|| (TREE_CODE (base)((enum tree_code) (base)->base.code) == MEM_REF
   && TREE_CODE (TREE_OPERAND (base, 0))((enum tree_code) ((*((const_cast<tree*> (tree_operand_check
 ((base), (0), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 306, __FUNCTION__))))))->base.code) == SSA_NAME)
|| (TREE_CODE (base)((enum tree_code) (base)->base.code) == TARGET_MEM_REF
   && TREE_CODE (TMR_BASE (base))((enum tree_code) (((*((const_cast<tree*> (tree_operand_check
 (((tree_check ((base), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 308, __FUNCTION__, (TARGET_MEM_REF)))), (0), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 308, __FUNCTION__)))))))->base.code) == SSA_NAME)))
  return false;

ref->ref_alias_set = MEM_ALIAS_SET (mem)(get_mem_attrs (mem)->alias);

/* If MEM_OFFSET or MEM_SIZE are unknown what we got from MEM_EXPR
   is conservative, so trust it.  */
if (!MEM_OFFSET_KNOWN_P (mem)(get_mem_attrs (mem)->offset_known_p)
    || !MEM_SIZE_KNOWN_P (mem)(get_mem_attrs (mem)->size_known_p))
  return true;

/* If MEM_OFFSET/MEM_SIZE get us outside of ref->offset/ref->max_size
   drop ref->ref.  */
if (maybe_lt (MEM_OFFSET (mem)(get_mem_attrs (mem)->offset), 0)
    || (ref->max_size_known_p ()
 && maybe_gt ((MEM_OFFSET (mem) + MEM_SIZE (mem)) * BITS_PER_UNIT,maybe_lt (ref->max_size, ((get_mem_attrs (mem)->offset)
 + (get_mem_attrs (mem)->size)) * (8))
       ref->max_size)maybe_lt (ref->max_size, ((get_mem_attrs (mem)->offset)
 + (get_mem_attrs (mem)->size)) * (8))))
  ref->ref = NULL_TREE(tree) nullptr;

/* Refine size and offset we got from analyzing MEM_EXPR by using
   MEM_SIZE and MEM_OFFSET.  */

ref->offset += MEM_OFFSET (mem)(get_mem_attrs (mem)->offset) * BITS_PER_UNIT(8);
ref->size = MEM_SIZE (mem)(get_mem_attrs (mem)->size) * BITS_PER_UNIT(8);

/* The MEM may extend into adjacent fields, so adjust max_size if
   necessary.  */
if (ref->max_size_known_p ())
  ref->max_size = upper_bound (ref->max_size, ref->size);

/* If MEM_OFFSET and MEM_SIZE might get us outside of the base object of
   the MEM_EXPR punt.  This happens for STRICT_ALIGNMENT targets a lot.  */
if (MEM_EXPR (mem)(get_mem_attrs (mem)->expr) != get_spill_slot_decl (false)
    && (maybe_lt (ref->offset, 0)
 || (DECL_P (ref->base)(tree_code_type[(int) (((enum tree_code) (ref->base)->base
.code))] == tcc_declaration)
     && (DECL_SIZE (ref->base)((contains_struct_check ((ref->base), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 343, __FUNCTION__))->decl_common.size) == NULL_TREE(tree) nullptr
  || !poly_int_tree_p (DECL_SIZE (ref->base)((contains_struct_check ((ref->base), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 344, __FUNCTION__))->decl_common.size))
  || maybe_lt (wi::to_poly_offset (DECL_SIZE (ref->base)((contains_struct_check ((ref->base), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 345, __FUNCTION__))->decl_common.size)),
	       ref->offset + ref->size)))))
  return false;

return true;
350}

352/* Query the alias-oracle on whether the two memory rtx X and MEM may
 alias.  If TBAA_P is set also apply TBAA.  Returns true if the
 two rtxen may alias, false otherwise.  */

356static bool
357rtx_refs_may_alias_p (const_rtx x, const_rtx mem, bool tbaa_p)
358{
ao_ref ref1, ref2;

if (!ao_ref_from_mem (&ref1, x)
    || !ao_ref_from_mem (&ref2, mem))
  return true;

return refs_may_alias_p_1 (&ref1, &ref2,
	     tbaa_p
	     && MEM_ALIAS_SET (x)(get_mem_attrs (x)->alias) != 0
	     && MEM_ALIAS_SET (mem)(get_mem_attrs (mem)->alias) != 0);
369}

371/* Return true if the ref EARLIER behaves the same as LATER with respect
 to TBAA for every memory reference that might follow LATER.  */

374bool
375refs_same_for_tbaa_p (tree earlier, tree later)
376{
ao_ref earlier_ref, later_ref;
ao_ref_init (&earlier_ref, earlier);
ao_ref_init (&later_ref, later);
alias_set_type earlier_set = ao_ref_alias_set (&earlier_ref);
alias_set_type later_set = ao_ref_alias_set (&later_ref);
if (!(earlier_set == later_set
|| alias_set_subset_of (later_set, earlier_set)))
  return false;
alias_set_type later_base_set = ao_ref_base_alias_set (&later_ref);
alias_set_type earlier_base_set = ao_ref_base_alias_set (&earlier_ref);
return (earlier_base_set == later_base_set
 || alias_set_subset_of (later_base_set, earlier_base_set));
389}

391/* Returns a pointer to the alias set entry for ALIAS_SET, if there is
 such an entry, or NULL otherwise.  */

394static inline alias_set_entry *
395get_alias_set_entry (alias_set_type alias_set)
396{
return (*alias_sets)[alias_set];
398}

400/* Returns nonzero if the alias sets for MEM1 and MEM2 are such that
 the two MEMs cannot alias each other.  */

403static inline int
404mems_in_disjoint_alias_sets_p (const_rtx mem1, const_rtx mem2)
405{
return (flag_strict_aliasingglobal_options.x_flag_strict_aliasing
 && ! alias_sets_conflict_p (MEM_ALIAS_SET (mem1)(get_mem_attrs (mem1)->alias),
		      MEM_ALIAS_SET (mem2)(get_mem_attrs (mem2)->alias)));
409}

411/* Return true if the first alias set is a subset of the second.  */

413bool
414alias_set_subset_of (alias_set_type set1, alias_set_type set2)
415{
alias_set_entry *ase2;

/* Disable TBAA oracle with !flag_strict_aliasing.  */
if (!flag_strict_aliasingglobal_options.x_flag_strict_aliasing)
  return true;

/* Everything is a subset of the "aliases everything" set.  */
if (set2 == 0)
  return true;

/* Check if set1 is a subset of set2.  */
ase2 = get_alias_set_entry (set2);
if (ase2 != 0
    && (ase2->has_zero_child
 || (ase2->children && ase2->children->get (set1))))
  return true;

/* As a special case we consider alias set of "void *" to be both subset
   and superset of every alias set of a pointer.  This extra symmetry does
   not matter for alias_sets_conflict_p but it makes aliasing_component_refs_p
   to return true on the following testcase:

   void *ptr;
   char **ptr2=(char **)&ptr;
   *ptr2 = ...

   Additionally if a set contains universal pointer, we consider every pointer
   to be a subset of it, but we do not represent this explicitely - doing so
   would require us to update transitive closure each time we introduce new
   pointer type.  This makes aliasing_component_refs_p to return true
   on the following testcase:

   struct a {void *ptr;}
   char **ptr = (char **)&a.ptr;
   ptr = ...

   This makes void * truly universal pointer type.  See pointer handling in
   get_alias_set for more details.  */
if (ase2 && ase2->has_pointer)
  {
    alias_set_entry *ase1 = get_alias_set_entry (set1);

    if (ase1 && ase1->is_pointer)
{
        alias_set_type voidptr_set = TYPE_ALIAS_SET (ptr_type_node)((tree_class_check ((global_trees[TI_PTR_TYPE]), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 460, __FUNCTION__))->type_common.alias_set);
 /* If one is ptr_type_node and other is pointer, then we consider
     them subset of each other.  */
 if (set1 == voidptr_set || set2 == voidptr_set)
   return true;
 /* If SET2 contains universal pointer's alias set, then we consdier
     every (non-universal) pointer.  */
 if (ase2->children && set1 != voidptr_set
     && ase2->children->get (voidptr_set))
   return true;
}
  }
return false;
473}

475/* Return 1 if the two specified alias sets may conflict.  */

477int
478alias_sets_conflict_p (alias_set_type set1, alias_set_type set2)
479{
alias_set_entry *ase1;
alias_set_entry *ase2;

/* The easy case.  */
if (alias_sets_must_conflict_p (set1, set2))
  return 1;

/* See if the first alias set is a subset of the second.  */
ase1 = get_alias_set_entry (set1);
if (ase1 != 0
    && ase1->children && ase1->children->get (set2))
  {
    ++alias_stats.num_dag;
    return 1;
  }

/* Now do the same, but with the alias sets reversed.  */
ase2 = get_alias_set_entry (set2);
if (ase2 != 0
    && ase2->children && ase2->children->get (set1))
  {
    ++alias_stats.num_dag;
    return 1;
  }

/* We want void * to be compatible with any other pointer without
   really dropping it to alias set 0. Doing so would make it
   compatible with all non-pointer types too.

   This is not strictly necessary by the C/C++ language
   standards, but avoids common type punning mistakes.  In
   addition to that, we need the existence of such universal
   pointer to implement Fortran's C_PTR type (which is defined as
   type compatible with all C pointers).  */
if (ase1 && ase2 && ase1->has_pointer && ase2->has_pointer)
  {
    alias_set_type voidptr_set = TYPE_ALIAS_SET (ptr_type_node)((tree_class_check ((global_trees[TI_PTR_TYPE]), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 516, __FUNCTION__))->type_common.alias_set);

    /* If one of the sets corresponds to universal pointer,
 we consider it to conflict with anything that is
or contains pointer.  */
    if (set1 == voidptr_set || set2 == voidptr_set)
{
 ++alias_stats.num_universal;
 return true;
}
   /* If one of sets is (non-universal) pointer and the other
contains universal pointer, we also get conflict.  */
   if (ase1->is_pointer && set2 != voidptr_set
&& ase2->children && ase2->children->get (voidptr_set))
{
 ++alias_stats.num_universal;
 return true;
}
   if (ase2->is_pointer && set1 != voidptr_set
&& ase1->children && ase1->children->get (voidptr_set))
{
 ++alias_stats.num_universal;
 return true;
}
  }

++alias_stats.num_disambiguated;

/* The two alias sets are distinct and neither one is the
   child of the other.  Therefore, they cannot conflict.  */
return 0;
547}

549/* Return 1 if the two specified alias sets will always conflict.  */

551int
552alias_sets_must_conflict_p (alias_set_type set1, alias_set_type set2)
553{
/* Disable TBAA oracle with !flag_strict_aliasing.  */
if (!flag_strict_aliasingglobal_options.x_flag_strict_aliasing)
  return 1;
if (set1 == 0 || set2 == 0)
  {
    ++alias_stats.num_alias_zero;
    return 1;
  }
if (set1 == set2)
  {
    ++alias_stats.num_same_alias_set;
    return 1;
  }

return 0;
569}

571/* Return 1 if any MEM object of type T1 will always conflict (using the
 dependency routines in this file) with any MEM object of type T2.
 This is used when allocating temporary storage.  If T1 and/or T2 are
 NULL_TREE, it means we know nothing about the storage.  */

576int
577objects_must_conflict_p (tree t1, tree t2)
578{
alias_set_type set1, set2;

/* If neither has a type specified, we don't know if they'll conflict
   because we may be using them to store objects of various types, for
   example the argument and local variables areas of inlined functions.  */
if (t1 == 0 && t2 == 0)
  return 0;

/* If they are the same type, they must conflict.  */
if (t1 == t2)
  {
    ++alias_stats.num_same_objects;
    return 1;
  }
/* Likewise if both are volatile.  */
if (t1 != 0 && TYPE_VOLATILE (t1)((tree_class_check ((t1), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 594, __FUNCTION__))->base.volatile_flag) && t2 != 0 && TYPE_VOLATILE (t2)((tree_class_check ((t2), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 594, __FUNCTION__))->base.volatile_flag))
  {
    ++alias_stats.num_volatile;
    return 1;
  }

set1 = t1 ? get_alias_set (t1) : 0;
set2 = t2 ? get_alias_set (t2) : 0;

/* We can't use alias_sets_conflict_p because we must make sure
   that every subtype of t1 will conflict with every subtype of
   t2 for which a pair of subobjects of these respective subtypes
   overlaps on the stack.  */
return alias_sets_must_conflict_p (set1, set2);
608}
609
610/* Return true if T is an end of the access path which can be used
 by type based alias oracle.  */

613bool
614ends_tbaa_access_path_p (const_tree t)
615{
switch (TREE_CODE (t)((enum tree_code) (t)->base.code))
  {
  case COMPONENT_REF:
    if (DECL_NONADDRESSABLE_P (TREE_OPERAND (t, 1))((tree_check (((*((const_cast<tree*> (tree_operand_check
 ((t), (1), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 619, __FUNCTION__)))))), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 619, __FUNCTION__, (FIELD_DECL)))->decl_common.decl_flag_2
))
return true;
    /* Permit type-punning when accessing a union, provided the access
is directly through the union.  For example, this code does not
permit taking the address of a union member and then storing
through it.  Even the type-punning allowed here is a GCC
extension, albeit a common and useful one; the C standard says
that such accesses have implementation-defined behavior.  */
    else if (TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0)))((enum tree_code) (((contains_struct_check (((*((const_cast<
tree*> (tree_operand_check ((t), (0), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 627, __FUNCTION__)))))), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 627, __FUNCTION__))->typed.type))->base.code) == UNION_TYPE)
return true;
    break;

  case ARRAY_REF:
  case ARRAY_RANGE_REF:
    if (TYPE_NONALIASED_COMPONENT (TREE_TYPE (TREE_OPERAND (t, 0)))((tree_check ((((contains_struct_check (((*((const_cast<tree
*> (tree_operand_check ((t), (0), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 633, __FUNCTION__)))))), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 633, __FUNCTION__))->typed.type)), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 633, __FUNCTION__, (ARRAY_TYPE)))->type_common.transparent_aggr_flag
))
return true;
    break;

  case REALPART_EXPR:
  case IMAGPART_EXPR:
    break;

  case BIT_FIELD_REF:
  case VIEW_CONVERT_EXPR:
    /* Bitfields and casts are never addressable.  */
    return true;
    break;

  default:
    gcc_unreachable ()(fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 648, __FUNCTION__));
  }
return false;
651}

653/* Return the outermost parent of component present in the chain of
 component references handled by get_inner_reference in T with the
 following property:
   - the component is non-addressable
 or NULL_TREE if no such parent exists.  In the former cases, the alias
 set of this parent is the alias set that must be used for T itself.  */

660tree
661component_uses_parent_alias_set_from (const_tree t)
662{
const_tree found = NULL_TREE(tree) nullptr;

while (handled_component_p (t))
  {
    if (ends_tbaa_access_path_p (t))
found = t;

    t = TREE_OPERAND (t, 0)(*((const_cast<tree*> (tree_operand_check ((t), (0), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 670, __FUNCTION__)))));
  }

if (found)
  return TREE_OPERAND (found, 0)(*((const_cast<tree*> (tree_operand_check ((found), (0)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 674, __FUNCTION__)))));

return NULL_TREE(tree) nullptr;
677}


680/* Return whether the pointer-type T effective for aliasing may
 access everything and thus the reference has to be assigned
 alias-set zero.  */

684static bool
685ref_all_alias_ptr_type_p (const_tree t)
686{
return (TREE_CODE (TREE_TYPE (t))((enum tree_code) (((contains_struct_check ((t), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 687, __FUNCTION__))->typed.type))->base.code) == VOID_TYPE
 || TYPE_REF_CAN_ALIAS_ALL (t)((tree_check2 ((t), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 688, __FUNCTION__, (POINTER_TYPE), (REFERENCE_TYPE)))->base
.static_flag));
689}

691/* Return the alias set for the memory pointed to by T, which may be
 either a type or an expression.  Return -1 if there is nothing
 special about dereferencing T.  */

695static alias_set_type
696get_deref_alias_set_1 (tree t)
697{
/* All we care about is the type.  */
if (! TYPE_P (t)(tree_code_type[(int) (((enum tree_code) (t)->base.code))]
 == tcc_type))
  t = TREE_TYPE (t)((contains_struct_check ((t), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 700, __FUNCTION__))->typed.type);

/* If we have an INDIRECT_REF via a void pointer, we don't
   know anything about what that might alias.  Likewise if the
   pointer is marked that way.  */
if (ref_all_alias_ptr_type_p (t))
  return 0;

return -1;
709}

711/* Return the alias set for the memory pointed to by T, which may be
 either a type or an expression.  */

714alias_set_type
715get_deref_alias_set (tree t)
716{
/* If we're not doing any alias analysis, just assume everything
   aliases everything else.  */
if (!flag_strict_aliasingglobal_options.x_flag_strict_aliasing)
  return 0;

alias_set_type set = get_deref_alias_set_1 (t);

/* Fall back to the alias-set of the pointed-to type.  */
if (set == -1)
  {
    if (! TYPE_P (t)(tree_code_type[(int) (((enum tree_code) (t)->base.code))]
 == tcc_type))
t = TREE_TYPE (t)((contains_struct_check ((t), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 728, __FUNCTION__))->typed.type);
    set = get_alias_set (TREE_TYPE (t)((contains_struct_check ((t), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 729, __FUNCTION__))->typed.type));
  }

return set;
733}

735/* Return the pointer-type relevant for TBAA purposes from the
 memory reference tree *T or NULL_TREE in which case *T is
 adjusted to point to the outermost component reference that
 can be used for assigning an alias set.  */

740tree
741reference_alias_ptr_type_1 (tree *t)
742{
tree inner;

/* Get the base object of the reference.  */
inner = *t;
while (handled_component_p (inner))
  {
    /* If there is a VIEW_CONVERT_EXPR in the chain we cannot use
the type of any component references that wrap it to
determine the alias-set.  */
    if (TREE_CODE (inner)((enum tree_code) (inner)->base.code) == VIEW_CONVERT_EXPR)
*t = TREE_OPERAND (inner, 0)(*((const_cast<tree*> (tree_operand_check ((inner), (0)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 753, __FUNCTION__)))));
    inner = TREE_OPERAND (inner, 0)(*((const_cast<tree*> (tree_operand_check ((inner), (0)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 754, __FUNCTION__)))));
  }

/* Handle pointer dereferences here, they can override the
   alias-set.  */
if (INDIRECT_REF_P (inner)(((enum tree_code) (inner)->base.code) == INDIRECT_REF)
    && ref_all_alias_ptr_type_p (TREE_TYPE (TREE_OPERAND (inner, 0))((contains_struct_check (((*((const_cast<tree*> (tree_operand_check
 ((inner), (0), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 760, __FUNCTION__)))))), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 760, __FUNCTION__))->typed.type)))
  return TREE_TYPE (TREE_OPERAND (inner, 0))((contains_struct_check (((*((const_cast<tree*> (tree_operand_check
 ((inner), (0), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 761, __FUNCTION__)))))), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 761, __FUNCTION__))->typed.type);
else if (TREE_CODE (inner)((enum tree_code) (inner)->base.code) == TARGET_MEM_REF)
  return TREE_TYPE (TMR_OFFSET (inner))((contains_struct_check ((((*((const_cast<tree*> (tree_operand_check
 (((tree_check ((inner), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 763, __FUNCTION__, (TARGET_MEM_REF)))), (1), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 763, __FUNCTION__))))))), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 763, __FUNCTION__))->typed.type);
else if (TREE_CODE (inner)((enum tree_code) (inner)->base.code) == MEM_REF
  && ref_all_alias_ptr_type_p (TREE_TYPE (TREE_OPERAND (inner, 1))((contains_struct_check (((*((const_cast<tree*> (tree_operand_check
 ((inner), (1), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 765, __FUNCTION__)))))), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 765, __FUNCTION__))->typed.type)))
  return TREE_TYPE (TREE_OPERAND (inner, 1))((contains_struct_check (((*((const_cast<tree*> (tree_operand_check
 ((inner), (1), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 766, __FUNCTION__)))))), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 766, __FUNCTION__))->typed.type);

/* If the innermost reference is a MEM_REF that has a
   conversion embedded treat it like a VIEW_CONVERT_EXPR above,
   using the memory access type for determining the alias-set.  */
if (TREE_CODE (inner)((enum tree_code) (inner)->base.code) == MEM_REF
    && (TYPE_MAIN_VARIANT (TREE_TYPE (inner))((tree_class_check ((((contains_struct_check ((inner), (TS_TYPED
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 772, __FUNCTION__))->typed.type)), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 772, __FUNCTION__))->type_common.main_variant)
 != TYPE_MAIN_VARIANT((tree_class_check ((((contains_struct_check ((((contains_struct_check
 (((*((const_cast<tree*> (tree_operand_check ((inner), (
1), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 774, __FUNCTION__)))))), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 774, __FUNCTION__))->typed.type)), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 774, __FUNCTION__))->typed.type)), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 774, __FUNCTION__))->type_common.main_variant)
      (TREE_TYPE (TREE_TYPE (TREE_OPERAND (inner, 1))))((tree_class_check ((((contains_struct_check ((((contains_struct_check
 (((*((const_cast<tree*> (tree_operand_check ((inner), (
1), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 774, __FUNCTION__)))))), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 774, __FUNCTION__))->typed.type)), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 774, __FUNCTION__))->typed.type)), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 774, __FUNCTION__))->type_common.main_variant)))
  return TREE_TYPE (TREE_OPERAND (inner, 1))((contains_struct_check (((*((const_cast<tree*> (tree_operand_check
 ((inner), (1), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 775, __FUNCTION__)))))), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 775, __FUNCTION__))->typed.type);

/* Otherwise, pick up the outermost object that we could have
   a pointer to.  */
tree tem = component_uses_parent_alias_set_from (*t);
if (tem)
  *t = tem;

return NULL_TREE(tree) nullptr;
784}

786/* Return the pointer-type relevant for TBAA purposes from the
 gimple memory reference tree T.  This is the type to be used for
 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T
 and guarantees that get_alias_set will return the same alias
 set for T and the replacement.  */

792tree
793reference_alias_ptr_type (tree t)
794{
/* If the frontend assigns this alias-set zero, preserve that.  */
if (lang_hooks.get_alias_set (t) == 0)
  return ptr_type_nodeglobal_trees[TI_PTR_TYPE];

tree ptype = reference_alias_ptr_type_1 (&t);
/* If there is a given pointer type for aliasing purposes, return it.  */
if (ptype != NULL_TREE(tree) nullptr)
  return ptype;

/* Otherwise build one from the outermost component reference we
   may use.  */
if (TREE_CODE (t)((enum tree_code) (t)->base.code) == MEM_REF
    || TREE_CODE (t)((enum tree_code) (t)->base.code) == TARGET_MEM_REF)
  return TREE_TYPE (TREE_OPERAND (t, 1))((contains_struct_check (((*((const_cast<tree*> (tree_operand_check
 ((t), (1), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 808, __FUNCTION__)))))), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 808, __FUNCTION__))->typed.type);
else
  return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (t))((tree_class_check ((((contains_struct_check ((t), (TS_TYPED)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 810, __FUNCTION__))->typed.type)), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 810, __FUNCTION__))->type_common.main_variant));
811}

813/* Return whether the pointer-types T1 and T2 used to determine
 two alias sets of two references will yield the same answer
 from get_deref_alias_set.  */

817bool
818alias_ptr_types_compatible_p (tree t1, tree t2)
819{
if (TYPE_MAIN_VARIANT (t1)((tree_class_check ((t1), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 820, __FUNCTION__))->type_common.main_variant) == TYPE_MAIN_VARIANT (t2)((tree_class_check ((t2), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 820, __FUNCTION__))->type_common.main_variant))
  return true;

if (ref_all_alias_ptr_type_p (t1)
    || ref_all_alias_ptr_type_p (t2))
  return false;

  /* This function originally abstracts from simply comparing
     get_deref_alias_set so that we are sure this still computes
     the same result after LTO type merging is applied.
     When in LTO type merging is done we can actually do this compare.
  */
if (in_lto_pglobal_options.x_in_lto_p)
  return get_deref_alias_set (t1) == get_deref_alias_set (t2);
else
  return (TYPE_MAIN_VARIANT (TREE_TYPE (t1))((tree_class_check ((((contains_struct_check ((t1), (TS_TYPED
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 835, __FUNCTION__))->typed.type)), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 835, __FUNCTION__))->type_common.main_variant)
   == TYPE_MAIN_VARIANT (TREE_TYPE (t2))((tree_class_check ((((contains_struct_check ((t2), (TS_TYPED
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 836, __FUNCTION__))->typed.type)), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 836, __FUNCTION__))->type_common.main_variant));
837}

839/* Create emptry alias set entry.  */

841alias_set_entry *
842init_alias_set_entry (alias_set_type set)
843{
alias_set_entry *ase = ggc_alloc<alias_set_entry> ();
ase->alias_set = set;
ase->children = NULLnullptr;
ase->has_zero_child = false;
ase->is_pointer = false;
ase->has_pointer = false;
gcc_checking_assert (!get_alias_set_entry (set))((void)(!(!get_alias_set_entry (set)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 850, __FUNCTION__), 0 : 0));
(*alias_sets)[set] = ase;
return ase;
853}

855/* Return the alias set for T, which may be either a type or an
 expression.  Call language-specific routine for help, if needed.  */

858alias_set_type
859get_alias_set (tree t)
860{
alias_set_type set;

/* We cannot give up with -fno-strict-aliasing because we need to build
   proper type representations for possible functions which are built with
   -fstrict-aliasing.  */

/* return 0 if this or its type is an error.  */
if (t == error_mark_nodeglobal_trees[TI_ERROR_MARK]
    || (! TYPE_P (t)(tree_code_type[(int) (((enum tree_code) (t)->base.code))]
 == tcc_type)
 && (TREE_TYPE (t)((contains_struct_check ((t), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 870, __FUNCTION__))->typed.type) == 0 || TREE_TYPE (t)((contains_struct_check ((t), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 870, __FUNCTION__))->typed.type) == error_mark_nodeglobal_trees[TI_ERROR_MARK])))
  return 0;

/* We can be passed either an expression or a type.  This and the
   language-specific routine may make mutually-recursive calls to each other
   to figure out what to do.  At each juncture, we see if this is a tree
   that the language may need to handle specially.  First handle things that
   aren't types.  */
if (! TYPE_P (t)(tree_code_type[(int) (((enum tree_code) (t)->base.code))]
 == tcc_type))
  {
    /* Give the language a chance to do something with this tree
before we look at it.  */
    STRIP_NOPS (t)(t) = tree_strip_nop_conversions ((const_cast<union tree_node
 *> (((t)))));
    set = lang_hooks.get_alias_set (t);
    if (set != -1)
return set;

    /* Get the alias pointer-type to use or the outermost object
       that we could have a pointer to.  */
    tree ptype = reference_alias_ptr_type_1 (&t);
    if (ptype != NULLnullptr)
return get_deref_alias_set (ptype);

    /* If we've already determined the alias set for a decl, just return
it.  This is necessary for C++ anonymous unions, whose component
variables don't look like union members (boo!).  */
    if (VAR_P (t)(((enum tree_code) (t)->base.code) == VAR_DECL)
 && DECL_RTL_SET_P (t)(((tree_contains_struct[(((enum tree_code) (t)->base.code)
)][(TS_DECL_WRTL)])) && (contains_struct_check ((t), (
TS_DECL_WRTL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 897, __FUNCTION__))->decl_with_rtl.rtl != nullptr) && MEM_P (DECL_RTL (t))(((enum rtx_code) (((contains_struct_check ((t), (TS_DECL_WRTL
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 897, __FUNCTION__))->decl_with_rtl.rtl ? (t)->decl_with_rtl
.rtl : (make_decl_rtl (t), (t)->decl_with_rtl.rtl)))->code
) == MEM))
return MEM_ALIAS_SET (DECL_RTL (t))(get_mem_attrs (((contains_struct_check ((t), (TS_DECL_WRTL),
 "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 898, __FUNCTION__))->decl_with_rtl.rtl ? (t)->decl_with_rtl
.rtl : (make_decl_rtl (t), (t)->decl_with_rtl.rtl)))->alias
);

    /* Now all we care about is the type.  */
    t = TREE_TYPE (t)((contains_struct_check ((t), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 901, __FUNCTION__))->typed.type);
  }

/* Variant qualifiers don't affect the alias set, so get the main
   variant.  */
t = TYPE_MAIN_VARIANT (t)((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 906, __FUNCTION__))->type_common.main_variant);

if (AGGREGATE_TYPE_P (t)(((enum tree_code) (t)->base.code) == ARRAY_TYPE || (((enum
 tree_code) (t)->base.code) == RECORD_TYPE || ((enum tree_code
) (t)->base.code) == UNION_TYPE || ((enum tree_code) (t)->
base.code) == QUAL_UNION_TYPE))
    && TYPE_TYPELESS_STORAGE (t)((tree_check4 ((t), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 909, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
), (ARRAY_TYPE)))->type_common.typeless_storage))
  return 0;

/* Always use the canonical type as well.  If this is a type that
   requires structural comparisons to identify compatible types
   use alias set zero.  */
if (TYPE_STRUCTURAL_EQUALITY_P (t)(((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 915, __FUNCTION__))->type_common.canonical) == (tree) nullptr
))
  {
    /* Allow the language to specify another alias set for this
type.  */
    set = lang_hooks.get_alias_set (t);
    if (set != -1)
return set;
    /* Handle structure type equality for pointer types, arrays and vectors.
This is easy to do, because the code below ignores canonical types on
these anyway.  This is important for LTO, where TYPE_CANONICAL for
pointers cannot be meaningfully computed by the frontend.  */
    if (canonical_type_used_p (t))
{
 /* In LTO we set canonical types for all types where it makes
    sense to do so.  Double check we did not miss some type.  */
 gcc_checking_assert (!in_lto_p || !type_with_alias_set_p (t))((void)(!(!global_options.x_in_lto_p || !type_with_alias_set_p
 (t)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 930, __FUNCTION__), 0 : 0));
        return 0;
}
  }
else
  {
    t = TYPE_CANONICAL (t)((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 936, __FUNCTION__))->type_common.canonical);
    gcc_checking_assert (!TYPE_STRUCTURAL_EQUALITY_P (t))((void)(!(!(((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 937, __FUNCTION__))->type_common.canonical) == (tree) nullptr
)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 937, __FUNCTION__), 0 : 0));
  }

/* If this is a type with a known alias set, return it.  */
gcc_checking_assert (t == TYPE_MAIN_VARIANT (t))((void)(!(t == ((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 941, __FUNCTION__))->type_common.main_variant)) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 941, __FUNCTION__), 0 : 0));
if (TYPE_ALIAS_SET_KNOWN_P (t)((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 942, __FUNCTION__))->type_common.alias_set != -1))
  return TYPE_ALIAS_SET (t)((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 943, __FUNCTION__))->type_common.alias_set);

/* We don't want to set TYPE_ALIAS_SET for incomplete types.  */
if (!COMPLETE_TYPE_P (t)(((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 946, __FUNCTION__))->type_common.size) != (tree) nullptr
))
  {
    /* For arrays with unknown size the conservative answer is the
alias set of the element type.  */
    if (TREE_CODE (t)((enum tree_code) (t)->base.code) == ARRAY_TYPE)
return get_alias_set (TREE_TYPE (t)((contains_struct_check ((t), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 951, __FUNCTION__))->typed.type));

    /* But return zero as a conservative answer for incomplete types.  */
    return 0;
  }

/* See if the language has special handling for this type.  */
set = lang_hooks.get_alias_set (t);
if (set != -1)
  return set;

/* There are no objects of FUNCTION_TYPE, so there's no point in
   using up an alias set for them.  (There are, of course, pointers
   and references to functions, but that's different.)  */
else if (TREE_CODE (t)((enum tree_code) (t)->base.code) == FUNCTION_TYPE || TREE_CODE (t)((enum tree_code) (t)->base.code) == METHOD_TYPE)
  set = 0;

/* Unless the language specifies otherwise, let vector types alias
   their components.  This avoids some nasty type punning issues in
   normal usage.  And indeed lets vectors be treated more like an
   array slice.  */
else if (TREE_CODE (t)((enum tree_code) (t)->base.code) == VECTOR_TYPE)
  set = get_alias_set (TREE_TYPE (t)((contains_struct_check ((t), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 973, __FUNCTION__))->typed.type));

/* Unless the language specifies otherwise, treat array types the
   same as their components.  This avoids the asymmetry we get
   through recording the components.  Consider accessing a
   character(kind=1) through a reference to a character(kind=1)[1:1].
   Or consider if we want to assign integer(kind=4)[0:D.1387] and
   integer(kind=4)[4] the same alias set or not.
   Just be pragmatic here and make sure the array and its element
   type get the same alias set assigned.  */
else if (TREE_CODE (t)((enum tree_code) (t)->base.code) == ARRAY_TYPE
  && (!TYPE_NONALIASED_COMPONENT (t)((tree_check ((t), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 984, __FUNCTION__, (ARRAY_TYPE)))->type_common.transparent_aggr_flag
)
      || TYPE_STRUCTURAL_EQUALITY_P (t)(((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 985, __FUNCTION__))->type_common.canonical) == (tree) nullptr
)))
  set = get_alias_set (TREE_TYPE (t)((contains_struct_check ((t), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 986, __FUNCTION__))->typed.type));

/* From the former common C and C++ langhook implementation:

   Unfortunately, there is no canonical form of a pointer type.
   In particular, if we have `typedef int I', then `int *', and
   `I *' are different types.  So, we have to pick a canonical
   representative.  We do this below.

   Technically, this approach is actually more conservative that
   it needs to be.  In particular, `const int *' and `int *'
   should be in different alias sets, according to the C and C++
   standard, since their types are not the same, and so,
   technically, an `int **' and `const int **' cannot point at
   the same thing.

   But, the standard is wrong.  In particular, this code is
   legal C++:

   int *ip;
   int **ipp = &ip;
   const int* const* cipp = ipp;
   And, it doesn't make sense for that to be legal unless you
   can dereference IPP and CIPP.  So, we ignore cv-qualifiers on
   the pointed-to types.  This issue has been reported to the
   C++ committee.

   For this reason go to canonical type of the unqalified pointer type.
   Until GCC 6 this code set all pointers sets to have alias set of
   ptr_type_node but that is a bad idea, because it prevents disabiguations
   in between pointers.  For Firefox this accounts about 20% of all
   disambiguations in the program.  */
else if (POINTER_TYPE_P (t)(((enum tree_code) (t)->base.code) == POINTER_TYPE || ((enum
 tree_code) (t)->base.code) == REFERENCE_TYPE) && t != ptr_type_nodeglobal_trees[TI_PTR_TYPE])
  {
    tree p;
    auto_vec <bool, 8> reference;

    /* Unnest all pointers and references.
We also want to make pointer to array/vector equivalent to pointer to
its element (see the reasoning above). Skip all those types, too.  */
    for (p = t; POINTER_TYPE_P (p)(((enum tree_code) (p)->base.code) == POINTER_TYPE || ((enum
 tree_code) (p)->base.code) == REFERENCE_TYPE)
  || (TREE_CODE (p)((enum tree_code) (p)->base.code) == ARRAY_TYPE
      && (!TYPE_NONALIASED_COMPONENT (p)((tree_check ((p), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1028, __FUNCTION__, (ARRAY_TYPE)))->type_common.transparent_aggr_flag
)
   || !COMPLETE_TYPE_P (p)(((tree_class_check ((p), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1029, __FUNCTION__))->type_common.size) != (tree) nullptr
)
   || TYPE_STRUCTURAL_EQUALITY_P (p)(((tree_class_check ((p), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1030, __FUNCTION__))->type_common.canonical) == (tree) nullptr
)))
  || TREE_CODE (p)((enum tree_code) (p)->base.code) == VECTOR_TYPE;
  p = TREE_TYPE (p)((contains_struct_check ((p), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1032, __FUNCTION__))->typed.type))
{
 /* Ada supports recursive pointers.  Instead of doing recursion
    check, just give up once the preallocated space of 8 elements
    is up.  In this case just punt to void * alias set.  */
 if (reference.length () == 8)
   {
     p = ptr_type_nodeglobal_trees[TI_PTR_TYPE];
     break;
   }
 if (TREE_CODE (p)((enum tree_code) (p)->base.code) == REFERENCE_TYPE)
   /* In LTO we want languages that use references to be compatible
       with languages that use pointers.  */
   reference.safe_push (true && !in_lto_pglobal_options.x_in_lto_p);
 if (TREE_CODE (p)((enum tree_code) (p)->base.code) == POINTER_TYPE)
   reference.safe_push (false);
}
    p = TYPE_MAIN_VARIANT (p)((tree_class_check ((p), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1049, __FUNCTION__))->type_common.main_variant);

    /* In LTO for C++ programs we can turn incomplete types to complete
using ODR name lookup.  */
    if (in_lto_pglobal_options.x_in_lto_p && TYPE_STRUCTURAL_EQUALITY_P (p)(((tree_class_check ((p), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1053, __FUNCTION__))->type_common.canonical) == (tree) nullptr
) && odr_type_p (p))
{
 p = prevailing_odr_type (p);
 gcc_checking_assert (TYPE_MAIN_VARIANT (p) == p)((void)(!(((tree_class_check ((p), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1056, __FUNCTION__))->type_common.main_variant) == p) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1056, __FUNCTION__), 0 : 0));
}

    /* Make void * compatible with char * and also void **.
Programs are commonly violating TBAA by this.

We also make void * to conflict with every pointer
(see record_component_aliases) and thus it is safe it to use it for
pointers to types with TYPE_STRUCTURAL_EQUALITY_P.  */
    if (TREE_CODE (p)((enum tree_code) (p)->base.code) == VOID_TYPE || TYPE_STRUCTURAL_EQUALITY_P (p)(((tree_class_check ((p), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1065, __FUNCTION__))->type_common.canonical) == (tree) nullptr
))
set = get_alias_set (ptr_type_nodeglobal_trees[TI_PTR_TYPE]);
    else
{
 /* Rebuild pointer type starting from canonical types using
    unqualified pointers and references only.  This way all such
    pointers will have the same alias set and will conflict with
    each other.

    Most of time we already have pointers or references of a given type.
    If not we build new one just to be sure that if someone later
    (probably only middle-end can, as we should assign all alias
    classes only after finishing translation unit) builds the pointer
    type, the canonical type will match.  */
 p = TYPE_CANONICAL (p)((tree_class_check ((p), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1079, __FUNCTION__))->type_common.canonical);
 while (!reference.is_empty ())
   {
     if (reference.pop ())
p = build_reference_type (p);
     else
p = build_pointer_type (p);
     gcc_checking_assert (p == TYPE_MAIN_VARIANT (p))((void)(!(p == ((tree_class_check ((p), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1086, __FUNCTION__))->type_common.main_variant)) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1086, __FUNCTION__), 0 : 0));
     /* build_pointer_type should always return the canonical type.
 For LTO TYPE_CANOINCAL may be NULL, because we do not compute
 them.  Be sure that frontends do not glob canonical types of
 pointers in unexpected way and that p == TYPE_CANONICAL (p)
 in all other cases.  */
     gcc_checking_assert (!TYPE_CANONICAL (p)((void)(!(!((tree_class_check ((p), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1092, __FUNCTION__))->type_common.canonical) || p == ((tree_class_check
 ((p), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1093, __FUNCTION__))->type_common.canonical)) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1093, __FUNCTION__), 0 : 0))
		   || p == TYPE_CANONICAL (p))((void)(!(!((tree_class_check ((p), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1092, __FUNCTION__))->type_common.canonical) || p == ((tree_class_check
 ((p), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1093, __FUNCTION__))->type_common.canonical)) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1093, __FUNCTION__), 0 : 0));
   }

 /* Assign the alias set to both p and t.
    We cannot call get_alias_set (p) here as that would trigger
    infinite recursion when p == t.  In other cases it would just
    trigger unnecesary legwork of rebuilding the pointer again.  */
 gcc_checking_assert (p == TYPE_MAIN_VARIANT (p))((void)(!(p == ((tree_class_check ((p), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1100, __FUNCTION__))->type_common.main_variant)) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1100, __FUNCTION__), 0 : 0));
 if (TYPE_ALIAS_SET_KNOWN_P (p)((tree_class_check ((p), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1101, __FUNCTION__))->type_common.alias_set != -1))
   set = TYPE_ALIAS_SET (p)((tree_class_check ((p), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1102, __FUNCTION__))->type_common.alias_set);
 else
   {
     set = new_alias_set ();
     TYPE_ALIAS_SET (p)((tree_class_check ((p), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1106, __FUNCTION__))->type_common.alias_set) = set;
   }
}
  }
/* Alias set of ptr_type_node is special and serve as universal pointer which
   is TBAA compatible with every other pointer type.  Be sure we have the
   alias set built even for LTO which otherwise keeps all TYPE_CANONICAL
   of pointer types NULL.  */
else if (t == ptr_type_nodeglobal_trees[TI_PTR_TYPE])
  set = new_alias_set ();

/* Otherwise make a new alias set for this type.  */
else
  {
    /* Each canonical type gets its own alias set, so canonical types
shouldn't form a tree.  It doesn't really matter for types
we handle specially above, so only check it where it possibly
would result in a bogus alias set.  */
    gcc_checking_assert (TYPE_CANONICAL (t) == t)((void)(!(((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1124, __FUNCTION__))->type_common.canonical) == t) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1124, __FUNCTION__), 0 : 0));

    set = new_alias_set ();
  }

TYPE_ALIAS_SET (t)((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1129, __FUNCTION__))->type_common.alias_set) = set;

/* If this is an aggregate type or a complex type, we must record any
   component aliasing information.  */
if (AGGREGATE_TYPE_P (t)(((enum tree_code) (t)->base.code) == ARRAY_TYPE || (((enum
 tree_code) (t)->base.code) == RECORD_TYPE || ((enum tree_code
) (t)->base.code) == UNION_TYPE || ((enum tree_code) (t)->
base.code) == QUAL_UNION_TYPE)) || TREE_CODE (t)((enum tree_code) (t)->base.code) == COMPLEX_TYPE)
  record_component_aliases (t);

/* We treat pointer types specially in alias_set_subset_of.  */
if (POINTER_TYPE_P (t)(((enum tree_code) (t)->base.code) == POINTER_TYPE || ((enum
 tree_code) (t)->base.code) == REFERENCE_TYPE) && set)
  {
    alias_set_entry *ase = get_alias_set_entry (set);
    if (!ase)
ase = init_alias_set_entry (set);
    ase->is_pointer = true;
    ase->has_pointer = true;
  }

return set;
1147}

1149/* Return a brand-new alias set.  */

1151alias_set_type
1152new_alias_set (void)
1153{
if (alias_sets == 0)
4
←
Assuming 'alias_sets' is not equal to null→
5
←
Taking false branch→
  vec_safe_push (alias_sets, (alias_set_entry *) NULLnullptr);
vec_safe_push (alias_sets, (alias_set_entry *) NULLnullptr);
6
←
Passing value via 1st parameter 'v'→
7
←
Calling 'vec_safe_push<alias_set_entry *, va_gc>'→
return alias_sets->length () - 1;
1158}

1160/* Indicate that things in SUBSET can alias things in SUPERSET, but that
 not everything that aliases SUPERSET also aliases SUBSET.  For example,
 in C, a store to an `int' can alias a load of a structure containing an
 `int', and vice versa.  But it can't alias a load of a 'double' member
 of the same structure.  Here, the structure would be the SUPERSET and
 `int' the SUBSET.  This relationship is also described in the comment at
 the beginning of this file.

 This function should be called only once per SUPERSET/SUBSET pair.

 It is illegal for SUPERSET to be zero; everything is implicitly a
 subset of alias set zero.  */

1173void
1174record_alias_subset (alias_set_type superset, alias_set_type subset)
1175{
alias_set_entry *superset_entry;
alias_set_entry *subset_entry;

/* It is possible in complex type situations for both sets to be the same,
   in which case we can ignore this operation.  */
if (superset == subset)
  return;

gcc_assert (superset)((void)(!(superset) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1184, __FUNCTION__), 0 : 0));

superset_entry = get_alias_set_entry (superset);
if (superset_entry == 0)
  {
    /* Create an entry for the SUPERSET, so that we have a place to
attach the SUBSET.  */
    superset_entry = init_alias_set_entry (superset);
  }

if (subset == 0)
  superset_entry->has_zero_child = 1;
else
  {
    if (!superset_entry->children)
superset_entry->children
 = hash_map<alias_set_hash, int>::create_ggc (64);

    /* Enter the SUBSET itself as a child of the SUPERSET.  If it was
already there we're done.  */
    if (superset_entry->children->put (subset, 0))
return;

    subset_entry = get_alias_set_entry (subset);
    /* If there is an entry for the subset, enter all of its children
(if they are not already present) as children of the SUPERSET.  */
    if (subset_entry)
{
 if (subset_entry->has_zero_child)
   superset_entry->has_zero_child = true;
        if (subset_entry->has_pointer)
   superset_entry->has_pointer = true;

 if (subset_entry->children)
   {
     hash_map<alias_set_hash, int>::iterator iter
= subset_entry->children->begin ();
     for (; iter != subset_entry->children->end (); ++iter)
superset_entry->children->put ((*iter).first, (*iter).second);
   }
}
  }
1226}

1228/* Record that component types of TYPE, if any, are part of SUPERSET for
 aliasing purposes.  For record types, we only record component types
 for fields that are not marked non-addressable.  For array types, we
 only record the component type if it is not marked non-aliased.  */

1233void
1234record_component_aliases (tree type, alias_set_type superset)
1235{
tree field;

if (superset == 0)
  return;

switch (TREE_CODE (type)((enum tree_code) (type)->base.code))
  {
  case RECORD_TYPE:
  case UNION_TYPE:
  case QUAL_UNION_TYPE:
    {
/* LTO non-ODR type merging does not make any difference between 
  component pointer types.  We may have

  struct foo {int *a;};

  as TYPE_CANONICAL of 

  struct bar {float *a;};

  Because accesses to int * and float * do not alias, we would get
  false negative when accessing the same memory location by
  float ** and bar *. We thus record the canonical type as:

  struct {void *a;};

  void * is special cased and works as a universal pointer type.
  Accesses to it conflicts with accesses to any other pointer
  type.  */
bool void_pointers = in_lto_pglobal_options.x_in_lto_p
	     && (!odr_type_p (type)
		 || !odr_based_tbaa_p (type));
for (field = TYPE_FIELDS (type)((tree_check3 ((type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1268, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
)))->type_non_common.values); field != 0; field = DECL_CHAIN (field)(((contains_struct_check (((contains_struct_check ((field), (
TS_DECL_MINIMAL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1268, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1268, __FUNCTION__))->common.chain)))
 if (TREE_CODE (field)((enum tree_code) (field)->base.code) == FIELD_DECL && !DECL_NONADDRESSABLE_P (field)((tree_check ((field), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1269, __FUNCTION__, (FIELD_DECL)))->decl_common.decl_flag_2
))
   {
     tree t = TREE_TYPE (field)((contains_struct_check ((field), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1271, __FUNCTION__))->typed.type);
     if (void_pointers)
{
  /* VECTOR_TYPE and ARRAY_TYPE share the alias set with their
     element type and that type has to be normalized to void *,
     too, in the case it is a pointer. */
  while (!canonical_type_used_p (t) && !POINTER_TYPE_P (t)(((enum tree_code) (t)->base.code) == POINTER_TYPE || ((enum
 tree_code) (t)->base.code) == REFERENCE_TYPE))
    {
      gcc_checking_assert (TYPE_STRUCTURAL_EQUALITY_P (t))((void)(!((((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1279, __FUNCTION__))->type_common.canonical) == (tree) nullptr
)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1279, __FUNCTION__), 0 : 0));
      t = TREE_TYPE (t)((contains_struct_check ((t), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1280, __FUNCTION__))->typed.type);
    }
  if (POINTER_TYPE_P (t)(((enum tree_code) (t)->base.code) == POINTER_TYPE || ((enum
 tree_code) (t)->base.code) == REFERENCE_TYPE))
    t = ptr_type_nodeglobal_trees[TI_PTR_TYPE];
  else if (flag_checkingglobal_options.x_flag_checking)
    gcc_checking_assert (get_alias_set (t)((void)(!(get_alias_set (t) == get_alias_set (((contains_struct_check
 ((field), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1286, __FUNCTION__))->typed.type))) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1286, __FUNCTION__), 0 : 0))
			 == get_alias_set (TREE_TYPE (field)))((void)(!(get_alias_set (t) == get_alias_set (((contains_struct_check
 ((field), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1286, __FUNCTION__))->typed.type))) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1286, __FUNCTION__), 0 : 0));
}

     alias_set_type set = get_alias_set (t);
     record_alias_subset (superset, set);
     /* If the field has alias-set zero make sure to still record
 any componets of it.  This makes sure that for
   struct A {
     struct B {
       int i;
       char c[4];
     } b;
   };
 in C++ even though 'B' has alias-set zero because
 TYPE_TYPELESS_STORAGE is set, 'A' has the alias-set of
 'int' as subset.  */
     if (set == 0)
record_component_aliases (t, superset);
   }
    }
    break;

  case COMPLEX_TYPE:
    record_alias_subset (superset, get_alias_set (TREE_TYPE (type)((contains_struct_check ((type), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1309, __FUNCTION__))->typed.type)));
    break;

  /* VECTOR_TYPE and ARRAY_TYPE share the alias set with their
     element type.  */

  default:
    break;
  }
1318}

1320/* Record that component types of TYPE, if any, are part of that type for
 aliasing purposes.  For record types, we only record component types
 for fields that are not marked non-addressable.  For array types, we
 only record the component type if it is not marked non-aliased.  */

1325void
1326record_component_aliases (tree type)
1327{
alias_set_type superset = get_alias_set (type);
record_component_aliases (type, superset);
1330}


1333/* Allocate an alias set for use in storing and reading from the varargs
 spill area.  */

1336static GTY(()) alias_set_type varargs_set = -1;

1338alias_set_type
1339get_varargs_alias_set (void)
1340{
1341#if 1
/* We now lower VA_ARG_EXPR, and there's currently no way to attach the
   varargs alias set to an INDIRECT_REF (FIXME!), so we can't
   consistently use the varargs alias set for loads from the varargs
   area.  So don't use it anywhere.  */
return 0;
1347#else
if (varargs_set == -1)
  varargs_set = new_alias_set ();

return varargs_set;
1352#endif
1353}

1355/* Likewise, but used for the fixed portions of the frame, e.g., register
 save areas.  */

1358static GTY(()) alias_set_type frame_set = -1;

1360alias_set_type
1361get_frame_alias_set (void)
1362{
if (frame_set == -1)
1
Assuming the condition is true→
2
←
Taking true branch→
  frame_set = new_alias_set ();
3
←
Calling 'new_alias_set'→

return frame_set;
1367}

1369/* Create a new, unique base with id ID.  */

1371static rtx
1372unique_base_value (HOST_WIDE_INTlong id)
1373{
return gen_rtx_ADDRESS (Pmode, id)gen_rtx_fmt_i_stat ((ADDRESS), (((global_options.x_ix86_pmode
 == PMODE_DI ? (scalar_int_mode ((scalar_int_mode::from_int) E_DImode
)) : (scalar_int_mode ((scalar_int_mode::from_int) E_SImode))
))), ((id)) );
1375}

1377/* Return true if accesses based on any other base value cannot alias
 those based on X.  */

1380static bool
1381unique_base_value_p (rtx x)
1382{
return GET_CODE (x)((enum rtx_code) (x)->code) == ADDRESS && GET_MODE (x)((machine_mode) (x)->mode) == Pmode(global_options.x_ix86_pmode == PMODE_DI ? (scalar_int_mode (
(scalar_int_mode::from_int) E_DImode)) : (scalar_int_mode ((scalar_int_mode
::from_int) E_SImode)));
1384}

1386/* Return true if X is known to be a base value.  */

1388static bool
1389known_base_value_p (rtx x)
1390{
switch (GET_CODE (x)((enum rtx_code) (x)->code))
  {
  case LABEL_REF:
  case SYMBOL_REF:
    return true;

  case ADDRESS:
    /* Arguments may or may not be bases; we don't know for sure.  */
    return GET_MODE (x)((machine_mode) (x)->mode) != VOIDmode((void) 0, E_VOIDmode);

  default:
    return false;
  }
1404}

1406/* Inside SRC, the source of a SET, find a base address.  */

1408static rtx
1409find_base_value (rtx src)
1410{
unsigned int regno;
scalar_int_mode int_mode;

1414#if defined (FIND_BASE_TERM)
/* Try machine-dependent ways to find the base term.  */
src = FIND_BASE_TERM (src)ix86_find_base_term (src);
1417#endif

switch (GET_CODE (src)((enum rtx_code) (src)->code))
  {
  case SYMBOL_REF:
  case LABEL_REF:
    return src;

  case REG:
    regno = REGNO (src)(rhs_regno(src));
    /* At the start of a function, argument registers have known base
values which may be lost later.  Returning an ADDRESS
expression here allows optimization based on argument values
even when the argument registers are used for other purposes.  */
    if (regno < FIRST_PSEUDO_REGISTER76 && copying_arguments)
return new_reg_base_value[regno];

    /* If a pseudo has a known base value, return it.  Do not do this
for non-fixed hard regs since it can result in a circular
dependency chain for registers which have values at function entry.

The test above is not sufficient because the scheduler may move
a copy out of an arg reg past the NOTE_INSN_FUNCTION_BEGIN.  */
    if ((regno >= FIRST_PSEUDO_REGISTER76 || fixed_regs(this_target_hard_regs->x_fixed_regs)[regno])
 && regno < vec_safe_length (reg_base_value))
{
 /* If we're inside init_alias_analysis, use new_reg_base_value
    to reduce the number of relaxation iterations.  */
 if (new_reg_base_value && new_reg_base_value[regno]
     && DF_REG_DEF_COUNT (regno)(df->def_regs[(regno)]->n_refs) == 1)
   return new_reg_base_value[regno];

 if ((*reg_base_value)[regno])
   return (*reg_base_value)[regno];
}

    return 0;

  case MEM:
    /* Check for an argument passed in memory.  Only record in the
copying-arguments block; it is too hard to track changes
otherwise.  */
    if (copying_arguments
 && (XEXP (src, 0)(((src)->u.fld[0]).rt_rtx) == arg_pointer_rtx((this_target_rtl->x_global_rtl)[GR_ARG_POINTER])
     || (GET_CODE (XEXP (src, 0))((enum rtx_code) ((((src)->u.fld[0]).rt_rtx))->code) == PLUS
  && XEXP (XEXP (src, 0), 0)((((((src)->u.fld[0]).rt_rtx))->u.fld[0]).rt_rtx) == arg_pointer_rtx((this_target_rtl->x_global_rtl)[GR_ARG_POINTER]))))
return arg_base_value;
    return 0;

  case CONST:
    src = XEXP (src, 0)(((src)->u.fld[0]).rt_rtx);
    if (GET_CODE (src)((enum rtx_code) (src)->code) != PLUS && GET_CODE (src)((enum rtx_code) (src)->code) != MINUS)
break;

    /* fall through */

  case PLUS:
  case MINUS:
    {
rtx temp, src_0 = XEXP (src, 0)(((src)->u.fld[0]).rt_rtx), src_1 = XEXP (src, 1)(((src)->u.fld[1]).rt_rtx);

/* If either operand is a REG that is a known pointer, then it
  is the base.  */
if (REG_P (src_0)(((enum rtx_code) (src_0)->code) == REG) && REG_POINTER (src_0)(__extension__ ({ __typeof ((src_0)) const _rtx = ((src_0)); if
 (((enum rtx_code) (_rtx)->code) != REG) rtl_check_failed_flag
 ("REG_POINTER", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1480, __FUNCTION__); _rtx; })->frame_related))
 return find_base_value (src_0);
if (REG_P (src_1)(((enum rtx_code) (src_1)->code) == REG) && REG_POINTER (src_1)(__extension__ ({ __typeof ((src_1)) const _rtx = ((src_1)); if
 (((enum rtx_code) (_rtx)->code) != REG) rtl_check_failed_flag
 ("REG_POINTER", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1482, __FUNCTION__); _rtx; })->frame_related))
 return find_base_value (src_1);

/* If either operand is a REG, then see if we already have
  a known value for it.  */
if (REG_P (src_0)(((enum rtx_code) (src_0)->code) == REG))
 {
   temp = find_base_value (src_0);
   if (temp != 0)
     src_0 = temp;
 }

if (REG_P (src_1)(((enum rtx_code) (src_1)->code) == REG))
 {
   temp = find_base_value (src_1);
   if (temp!= 0)
     src_1 = temp;
 }

/* If either base is named object or a special address
  (like an argument or stack reference), then use it for the
  base term.  */
if (src_0 != 0 && known_base_value_p (src_0))
 return src_0;

if (src_1 != 0 && known_base_value_p (src_1))
 return src_1;

/* Guess which operand is the base address:
  If either operand is a symbol, then it is the base.  If
  either operand is a CONST_INT, then the other is the base.  */
if (CONST_INT_P (src_1)(((enum rtx_code) (src_1)->code) == CONST_INT) || CONSTANT_P (src_0)((rtx_class[(int) (((enum rtx_code) (src_0)->code))]) == RTX_CONST_OBJ
))
 return find_base_value (src_0);
else if (CONST_INT_P (src_0)(((enum rtx_code) (src_0)->code) == CONST_INT) || CONSTANT_P (src_1)((rtx_class[(int) (((enum rtx_code) (src_1)->code))]) == RTX_CONST_OBJ
))
 return find_base_value (src_1);

return 0;
    }

  case LO_SUM:
    /* The standard form is (lo_sum reg sym) so look only at the
second operand.  */
    return find_base_value (XEXP (src, 1)(((src)->u.fld[1]).rt_rtx));

  case AND:
    /* Look through aligning ANDs.  And AND with zero or one with
       the LSB set isn't one (see for example PR92462).  */
    if (CONST_INT_P (XEXP (src, 1))(((enum rtx_code) ((((src)->u.fld[1]).rt_rtx))->code) ==
 CONST_INT)
 && INTVAL (XEXP (src, 1))(((((src)->u.fld[1]).rt_rtx))->u.hwint[0]) != 0
 && (INTVAL (XEXP (src, 1))(((((src)->u.fld[1]).rt_rtx))->u.hwint[0]) & 1) == 0)
return find_base_value (XEXP (src, 0)(((src)->u.fld[0]).rt_rtx));
    return 0;

  case TRUNCATE:
    /* As we do not know which address space the pointer is referring to, we can
handle this only if the target does not support different pointer or
address modes depending on the address space.  */
    if (!target_default_pointer_address_modes_p ())
break;
    if (!is_a <scalar_int_mode> (GET_MODE (src)((machine_mode) (src)->mode), &int_mode)
 || GET_MODE_PRECISION (int_mode) < GET_MODE_PRECISION (Pmode(global_options.x_ix86_pmode == PMODE_DI ? (scalar_int_mode (
(scalar_int_mode::from_int) E_DImode)) : (scalar_int_mode ((scalar_int_mode
::from_int) E_SImode)))))
break;
    /* Fall through.  */
  case HIGH:
  case PRE_INC:
  case PRE_DEC:
  case POST_INC:
  case POST_DEC:
  case PRE_MODIFY:
  case POST_MODIFY:
    return find_base_value (XEXP (src, 0)(((src)->u.fld[0]).rt_rtx));

  case ZERO_EXTEND:
  case SIGN_EXTEND:	/* used for NT/Alpha pointers */
    /* As we do not know which address space the pointer is referring to, we can
handle this only if the target does not support different pointer or
address modes depending on the address space.  */
    if (!target_default_pointer_address_modes_p ())
break;

    {
rtx temp = find_base_value (XEXP (src, 0)(((src)->u.fld[0]).rt_rtx));

if (temp != 0 && CONSTANT_P (temp)((rtx_class[(int) (((enum rtx_code) (temp)->code))]) == RTX_CONST_OBJ
))
 temp = convert_memory_address (Pmode, temp)convert_memory_address_addr_space (((global_options.x_ix86_pmode
 == PMODE_DI ? (scalar_int_mode ((scalar_int_mode::from_int) E_DImode
)) : (scalar_int_mode ((scalar_int_mode::from_int) E_SImode))
)), (temp), 0);

return temp;
    }

  default:
    break;
  }

return 0;
1576}

1578/* Called from init_alias_analysis indirectly through note_stores,
 or directly if DEST is a register with a REG_NOALIAS note attached.
 SET is null in the latter case.  */

1582/* While scanning insns to find base values, reg_seen[N] is nonzero if
 register N has been set in this function.  */
1584static sbitmap reg_seen;

1586static void
1587record_set (rtx dest, const_rtx set, void *data ATTRIBUTE_UNUSED__attribute__ ((__unused__)))
1588{
unsigned regno;
rtx src;
int n;

if (!REG_P (dest)(((enum rtx_code) (dest)->code) == REG))
  return;

regno = REGNO (dest)(rhs_regno(dest));

gcc_checking_assert (regno < reg_base_value->length ())((void)(!(regno < reg_base_value->length ()) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1598, __FUNCTION__), 0 : 0));

n = REG_NREGS (dest)((&(dest)->u.reg)->nregs);
if (n != 1)
  {
    while (--n >= 0)
{
 bitmap_set_bit (reg_seen, regno + n);
 new_reg_base_value[regno + n] = 0;
}
    return;
  }

if (set)
  {
    /* A CLOBBER wipes out any old value but does not prevent a previously
unset register from acquiring a base address (i.e. reg_seen is not
set).  */
    if (GET_CODE (set)((enum rtx_code) (set)->code) == CLOBBER)
{
 new_reg_base_value[regno] = 0;
 return;
}

    src = SET_SRC (set)(((set)->u.fld[1]).rt_rtx);
  }
else
  {
    /* There's a REG_NOALIAS note against DEST.  */
    if (bitmap_bit_p (reg_seen, regno))
{
 new_reg_base_value[regno] = 0;
 return;
}
    bitmap_set_bit (reg_seen, regno);
    new_reg_base_value[regno] = unique_base_value (unique_id++);
    return;
  }

/* If this is not the first set of REGNO, see whether the new value
   is related to the old one.  There are two cases of interest:

(1) The register might be assigned an entirely new value
   that has the same base term as the original set.

(2) The set might be a simple self-modification that
   cannot change REGNO's base value.

   If neither case holds, reject the original base value as invalid.
   Note that the following situation is not detected:

extern int x, y;  int *p = &x; p += (&y-&x);

   ANSI C does not allow computing the difference of addresses
   of distinct top level objects.  */
if (new_reg_base_value[regno] != 0
    && find_base_value (src) != new_reg_base_value[regno])
  switch (GET_CODE (src)((enum rtx_code) (src)->code))
    {
    case LO_SUM:
    case MINUS:
if (XEXP (src, 0)(((src)->u.fld[0]).rt_rtx) != dest && XEXP (src, 1)(((src)->u.fld[1]).rt_rtx) != dest)
 new_reg_base_value[regno] = 0;
break;
    case PLUS:
/* If the value we add in the PLUS is also a valid base value,
  this might be the actual base value, and the original value
  an index.  */
{
 rtx other = NULL_RTX(rtx) 0;

 if (XEXP (src, 0)(((src)->u.fld[0]).rt_rtx) == dest)
   other = XEXP (src, 1)(((src)->u.fld[1]).rt_rtx);
 else if (XEXP (src, 1)(((src)->u.fld[1]).rt_rtx) == dest)
   other = XEXP (src, 0)(((src)->u.fld[0]).rt_rtx);

 if (! other || find_base_value (other))
   new_reg_base_value[regno] = 0;
 break;
}
    case AND:
if (XEXP (src, 0)(((src)->u.fld[0]).rt_rtx) != dest || !CONST_INT_P (XEXP (src, 1))(((enum rtx_code) ((((src)->u.fld[1]).rt_rtx))->code) ==
 CONST_INT))
 new_reg_base_value[regno] = 0;
break;
    default:
new_reg_base_value[regno] = 0;
break;
    }
/* If this is the first set of a register, record the value.  */
else if ((regno >= FIRST_PSEUDO_REGISTER76 || ! fixed_regs(this_target_hard_regs->x_fixed_regs)[regno])
  && ! bitmap_bit_p (reg_seen, regno) && new_reg_base_value[regno] == 0)
  new_reg_base_value[regno] = find_base_value (src);

bitmap_set_bit (reg_seen, regno);
1692}

1694/* Return REG_BASE_VALUE for REGNO.  Selective scheduler uses this to avoid
 using hard registers with non-null REG_BASE_VALUE for renaming.  */
1696rtx
1697get_reg_base_value (unsigned int regno)
1698{
return (*reg_base_value)[regno];
1700}

1702/* If a value is known for REGNO, return it.  */

1704rtx
1705get_reg_known_value (unsigned int regno)
1706{
if (regno >= FIRST_PSEUDO_REGISTER76)
  {
    regno -= FIRST_PSEUDO_REGISTER76;
    if (regno < vec_safe_length (reg_known_value))
return (*reg_known_value)[regno];
  }
return NULLnullptr;
1714}

1716/* Set it.  */

1718static void
1719set_reg_known_value (unsigned int regno, rtx val)
1720{
if (regno >= FIRST_PSEUDO_REGISTER76)
  {
    regno -= FIRST_PSEUDO_REGISTER76;
    if (regno < vec_safe_length (reg_known_value))
(*reg_known_value)[regno] = val;
  }
1727}

1729/* Similarly for reg_known_equiv_p.  */

1731bool
1732get_reg_known_equiv_p (unsigned int regno)
1733{
if (regno >= FIRST_PSEUDO_REGISTER76)
  {
    regno -= FIRST_PSEUDO_REGISTER76;
    if (regno < vec_safe_length (reg_known_value))
return bitmap_bit_p (reg_known_equiv_p, regno);
  }
return false;
1741}

1743static void
1744set_reg_known_equiv_p (unsigned int regno, bool val)
1745{
if (regno >= FIRST_PSEUDO_REGISTER76)
  {
    regno -= FIRST_PSEUDO_REGISTER76;
    if (regno < vec_safe_length (reg_known_value))
{
 if (val)
   bitmap_set_bit (reg_known_equiv_p, regno);
 else
   bitmap_clear_bit (reg_known_equiv_p, regno);
}
  }
1757}


1760/* Returns a canonical version of X, from the point of view alias
 analysis.  (For example, if X is a MEM whose address is a register,
 and the register has a known value (say a SYMBOL_REF), then a MEM
 whose address is the SYMBOL_REF is returned.)  */

1765rtx
1766canon_rtx (rtx x)
1767{
/* Recursively look for equivalences.  */
if (REG_P (x)(((enum rtx_code) (x)->code) == REG) && REGNO (x)(rhs_regno(x)) >= FIRST_PSEUDO_REGISTER76)
  {
    rtx t = get_reg_known_value (REGNO (x)(rhs_regno(x)));
    if (t == x)
return x;
    if (t)
return canon_rtx (t);
  }

if (GET_CODE (x)((enum rtx_code) (x)->code) == PLUS)
  {
    rtx x0 = canon_rtx (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx));
    rtx x1 = canon_rtx (XEXP (x, 1)(((x)->u.fld[1]).rt_rtx));

    if (x0 != XEXP (x, 0)(((x)->u.fld[0]).rt_rtx) || x1 != XEXP (x, 1)(((x)->u.fld[1]).rt_rtx))
return simplify_gen_binary (PLUS, GET_MODE (x)((machine_mode) (x)->mode), x0, x1);
  }

/* This gives us much better alias analysis when called from
   the loop optimizer.   Note we want to leave the original
   MEM alone, but need to return the canonicalized MEM with
   all the flags with their original values.  */
else if (MEM_P (x)(((enum rtx_code) (x)->code) == MEM))
  x = replace_equiv_address_nv (x, canon_rtx (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx)));

return x;
1795}

1797/* Return 1 if X and Y are identical-looking rtx's.
 Expect that X and Y has been already canonicalized.

 We use the data in reg_known_value above to see if two registers with
 different numbers are, in fact, equivalent.  */

1803static int
1804rtx_equal_for_memref_p (const_rtx x, const_rtx y)
1805{
int i;
int j;
enum rtx_code code;
const char *fmt;

if (x == 0 && y == 0)
  return 1;
if (x == 0 || y == 0)
  return 0;

if (x == y)
  return 1;

code = GET_CODE (x)((enum rtx_code) (x)->code);
/* Rtx's of different codes cannot be equal.  */
if (code != GET_CODE (y)((enum rtx_code) (y)->code))
  return 0;

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

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

/* Some RTL can be compared without a recursive examination.  */
switch (code)
  {
  case REG:
    return REGNO (x)(rhs_regno(x)) == REGNO (y)(rhs_regno(y));

  case LABEL_REF:
    return label_ref_label (x) == label_ref_label (y);

  case SYMBOL_REF:
    return compare_base_symbol_refs (x, y) == 1;

  case ENTRY_VALUE:
    /* This is magic, don't go through canonicalization et al.  */
    return rtx_equal_p (ENTRY_VALUE_EXP (x)(((x)->u.fld[0]).rt_rtx), ENTRY_VALUE_EXP (y)(((y)->u.fld[0]).rt_rtx));

  case VALUE:
  CASE_CONST_UNIQUEcase CONST_INT: case CONST_WIDE_INT: case CONST_POLY_INT: case
 CONST_DOUBLE: case CONST_FIXED:
    /* Pointer equality guarantees equality for these nodes.  */
    return 0;

  default:
    break;
  }

/* canon_rtx knows how to handle plus.  No need to canonicalize.  */
if (code == PLUS)
  return ((rtx_equal_for_memref_p (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx), XEXP (y, 0)(((y)->u.fld[0]).rt_rtx))
    && rtx_equal_for_memref_p (XEXP (x, 1)(((x)->u.fld[1]).rt_rtx), XEXP (y, 1)(((y)->u.fld[1]).rt_rtx)))
   || (rtx_equal_for_memref_p (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx), XEXP (y, 1)(((y)->u.fld[1]).rt_rtx))
&& rtx_equal_for_memref_p (XEXP (x, 1)(((x)->u.fld[1]).rt_rtx), XEXP (y, 0)(((y)->u.fld[0]).rt_rtx))));
/* For commutative operations, the RTX match if the operand match in any
   order.  Also handle the simple binary and unary cases without a loop.  */
if (COMMUTATIVE_P (x)(((rtx_class[(int) (((enum rtx_code) (x)->code))]) & (
~2)) == (RTX_COMM_COMPARE & (~2))))
  {
    rtx xop0 = canon_rtx (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx));
    rtx yop0 = canon_rtx (XEXP (y, 0)(((y)->u.fld[0]).rt_rtx));
    rtx yop1 = canon_rtx (XEXP (y, 1)(((y)->u.fld[1]).rt_rtx));

    return ((rtx_equal_for_memref_p (xop0, yop0)
      && rtx_equal_for_memref_p (canon_rtx (XEXP (x, 1)(((x)->u.fld[1]).rt_rtx)), yop1))
     || (rtx_equal_for_memref_p (xop0, yop1)
  && rtx_equal_for_memref_p (canon_rtx (XEXP (x, 1)(((x)->u.fld[1]).rt_rtx)), yop0)));
  }
else if (NON_COMMUTATIVE_P (x)(((rtx_class[(int) (((enum rtx_code) (x)->code))]) & (
~2)) == (RTX_COMPARE & (~2))))
  {
    return (rtx_equal_for_memref_p (canon_rtx (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx)),
		      canon_rtx (XEXP (y, 0)(((y)->u.fld[0]).rt_rtx)))
     && rtx_equal_for_memref_p (canon_rtx (XEXP (x, 1)(((x)->u.fld[1]).rt_rtx)),
			 canon_rtx (XEXP (y, 1)(((y)->u.fld[1]).rt_rtx))));
  }
else if (UNARY_P (x)((rtx_class[(int) (((enum rtx_code) (x)->code))]) == RTX_UNARY
))
  return rtx_equal_for_memref_p (canon_rtx (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx)),
		   canon_rtx (XEXP (y, 0)(((y)->u.fld[0]).rt_rtx)));

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

   Limit cases to types which actually appear in addresses.  */

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

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

case 'E':
 /* Two vectors must have the same length.  */
 if (XVECLEN (x, i)(((((x)->u.fld[i]).rt_rtvec))->num_elem) != XVECLEN (y, i)(((((y)->u.fld[i]).rt_rtvec))->num_elem))
   return 0;

 /* And the corresponding elements must match.  */
 for (j = 0; j < XVECLEN (x, i)(((((x)->u.fld[i]).rt_rtvec))->num_elem); j++)
   if (rtx_equal_for_memref_p (canon_rtx (XVECEXP (x, i, j)(((((x)->u.fld[i]).rt_rtvec))->elem[j])),
			canon_rtx (XVECEXP (y, i, j)(((((y)->u.fld[i]).rt_rtvec))->elem[j]))) == 0)
     return 0;
 break;

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

 /* This can happen for asm operands.  */
case 's':
 if (strcmp (XSTR (x, i)(((x)->u.fld[i]).rt_str), XSTR (y, i)(((y)->u.fld[i]).rt_str)))
   return 0;
 break;

/* This can happen for an asm which clobbers memory.  */
case '0':
 break;

 /* It is believed that rtx's at this level will never
    contain anything but integers and other rtx's,
    except for within LABEL_REFs and SYMBOL_REFs.  */
default:
 gcc_unreachable ()(fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 1937, __FUNCTION__));
}
  }
return 1;
1941}

1943static rtx
1944find_base_term (rtx x, vec<std::pair<cselib_val *,
		     struct elt_loc_list *> > &visited_vals)
1946{
cselib_val *val;
struct elt_loc_list *l, *f;
rtx ret;
scalar_int_mode int_mode;

1952#if defined (FIND_BASE_TERM)
/* Try machine-dependent ways to find the base term.  */
x = FIND_BASE_TERM (x)ix86_find_base_term (x);
1955#endif

switch (GET_CODE (x)((enum rtx_code) (x)->code))
  {
  case REG:
    return REG_BASE_VALUE (x)((rhs_regno(x)) < vec_safe_length (reg_base_value) ? (*reg_base_value
)[(rhs_regno(x))] : 0);

  case TRUNCATE:
    /* As we do not know which address space the pointer is referring to, we can
handle this only if the target does not support different pointer or
address modes depending on the address space.  */
    if (!target_default_pointer_address_modes_p ())
return 0;
    if (!is_a <scalar_int_mode> (GET_MODE (x)((machine_mode) (x)->mode), &int_mode)
 || GET_MODE_PRECISION (int_mode) < GET_MODE_PRECISION (Pmode(global_options.x_ix86_pmode == PMODE_DI ? (scalar_int_mode (
(scalar_int_mode::from_int) E_DImode)) : (scalar_int_mode ((scalar_int_mode
::from_int) E_SImode)))))
return 0;
    /* Fall through.  */
  case HIGH:
  case PRE_INC:
  case PRE_DEC:
  case POST_INC:
  case POST_DEC:
  case PRE_MODIFY:
  case POST_MODIFY:
    return find_base_term (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx), visited_vals);

  case ZERO_EXTEND:
  case SIGN_EXTEND:	/* Used for Alpha/NT pointers */
    /* As we do not know which address space the pointer is referring to, we can
handle this only if the target does not support different pointer or
address modes depending on the address space.  */
    if (!target_default_pointer_address_modes_p ())
return 0;

    {
rtx temp = find_base_term (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx), visited_vals);

if (temp != 0 && CONSTANT_P (temp)((rtx_class[(int) (((enum rtx_code) (temp)->code))]) == RTX_CONST_OBJ
))
 temp = convert_memory_address (Pmode, temp)convert_memory_address_addr_space (((global_options.x_ix86_pmode
 == PMODE_DI ? (scalar_int_mode ((scalar_int_mode::from_int) E_DImode
)) : (scalar_int_mode ((scalar_int_mode::from_int) E_SImode))
)), (temp), 0);

return temp;
    }

  case VALUE:
    val = CSELIB_VAL_PTR (x)(((x)->u.fld[0]).rt_cselib);
    ret = NULL_RTX(rtx) 0;

    if (!val)
return ret;

    if (cselib_sp_based_value_p (val))
return static_reg_base_value(this_target_rtl->x_static_reg_base_value)[STACK_POINTER_REGNUM7];

    if (visited_vals.length () > (unsigned) param_max_find_base_term_valuesglobal_options.x_param_max_find_base_term_values)
return ret;

    f = val->locs;
    /* Reset val->locs to avoid infinite recursion.  */
    if (f)
visited_vals.safe_push (std::make_pair (val, f));
    val->locs = NULLnullptr;

    for (l = f; l; l = l->next)
if (GET_CODE (l->loc)((enum rtx_code) (l->loc)->code) == VALUE
   && CSELIB_VAL_PTR (l->loc)(((l->loc)->u.fld[0]).rt_cselib)->locs
   && !CSELIB_VAL_PTR (l->loc)(((l->loc)->u.fld[0]).rt_cselib)->locs->next
   && CSELIB_VAL_PTR (l->loc)(((l->loc)->u.fld[0]).rt_cselib)->locs->loc == x)
 continue;
else if ((ret = find_base_term (l->loc, visited_vals)) != 0)
 break;

    return ret;

  case LO_SUM:
    /* The standard form is (lo_sum reg sym) so look only at the
       second operand.  */
    return find_base_term (XEXP (x, 1)(((x)->u.fld[1]).rt_rtx), visited_vals);

  case CONST:
    x = XEXP (x, 0)(((x)->u.fld[0]).rt_rtx);
    if (GET_CODE (x)((enum rtx_code) (x)->code) != PLUS && GET_CODE (x)((enum rtx_code) (x)->code) != MINUS)
return 0;
    /* Fall through.  */
  case PLUS:
  case MINUS:
    {
rtx tmp1 = XEXP (x, 0)(((x)->u.fld[0]).rt_rtx);
rtx tmp2 = XEXP (x, 1)(((x)->u.fld[1]).rt_rtx);

/* This is a little bit tricky since we have to determine which of
  the two operands represents the real base address.  Otherwise this
  routine may return the index register instead of the base register.

  That may cause us to believe no aliasing was possible, when in
  fact aliasing is possible.

  We use a few simple tests to guess the base register.  Additional
  tests can certainly be added.  For example, if one of the operands
  is a shift or multiply, then it must be the index register and the
  other operand is the base register.  */

if (tmp1 == pic_offset_table_rtx(this_target_rtl->x_pic_offset_table_rtx) && CONSTANT_P (tmp2)((rtx_class[(int) (((enum rtx_code) (tmp2)->code))]) == RTX_CONST_OBJ
))
 return find_base_term (tmp2, visited_vals);

/* If either operand is known to be a pointer, then prefer it
  to determine the base term.  */
if (REG_P (tmp1)(((enum rtx_code) (tmp1)->code) == REG) && REG_POINTER (tmp1)(__extension__ ({ __typeof ((tmp1)) const _rtx = ((tmp1)); if
 (((enum rtx_code) (_rtx)->code) != REG) rtl_check_failed_flag
 ("REG_POINTER", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2061, __FUNCTION__); _rtx; })->frame_related))
 ;
else if (REG_P (tmp2)(((enum rtx_code) (tmp2)->code) == REG) && REG_POINTER (tmp2)(__extension__ ({ __typeof ((tmp2)) const _rtx = ((tmp2)); if
 (((enum rtx_code) (_rtx)->code) != REG) rtl_check_failed_flag
 ("REG_POINTER", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2063, __FUNCTION__); _rtx; })->frame_related))
 std::swap (tmp1, tmp2);
/* If second argument is constant which has base term, prefer it
  over variable tmp1.  See PR64025.  */
else if (CONSTANT_P (tmp2)((rtx_class[(int) (((enum rtx_code) (tmp2)->code))]) == RTX_CONST_OBJ
) && !CONST_INT_P (tmp2)(((enum rtx_code) (tmp2)->code) == CONST_INT))
 std::swap (tmp1, tmp2);

/* Go ahead and find the base term for both operands.  If either base
  term is from a pointer or is a named object or a special address
  (like an argument or stack reference), then use it for the
  base term.  */
rtx base = find_base_term (tmp1, visited_vals);
if (base != NULL_RTX(rtx) 0
   && ((REG_P (tmp1)(((enum rtx_code) (tmp1)->code) == REG) && REG_POINTER (tmp1)(__extension__ ({ __typeof ((tmp1)) const _rtx = ((tmp1)); if
 (((enum rtx_code) (_rtx)->code) != REG) rtl_check_failed_flag
 ("REG_POINTER", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2076, __FUNCTION__); _rtx; })->frame_related))
 || known_base_value_p (base)))
 return base;
base = find_base_term (tmp2, visited_vals);
if (base != NULL_RTX(rtx) 0
   && ((REG_P (tmp2)(((enum rtx_code) (tmp2)->code) == REG) && REG_POINTER (tmp2)(__extension__ ({ __typeof ((tmp2)) const _rtx = ((tmp2)); if
 (((enum rtx_code) (_rtx)->code) != REG) rtl_check_failed_flag
 ("REG_POINTER", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2081, __FUNCTION__); _rtx; })->frame_related))
 || known_base_value_p (base)))
 return base;

/* We could not determine which of the two operands was the
  base register and which was the index.  So we can determine
  nothing from the base alias check.  */
return 0;
    }

  case AND:
    /* Look through aligning ANDs.  And AND with zero or one with
       the LSB set isn't one (see for example PR92462).  */
    if (CONST_INT_P (XEXP (x, 1))(((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) == CONST_INT
)
 && INTVAL (XEXP (x, 1))(((((x)->u.fld[1]).rt_rtx))->u.hwint[0]) != 0
 && (INTVAL (XEXP (x, 1))(((((x)->u.fld[1]).rt_rtx))->u.hwint[0]) & 1) == 0)
return find_base_term (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx), visited_vals);
    return 0;

  case SYMBOL_REF:
  case LABEL_REF:
    return x;

  default:
    return 0;
  }
2107}

2109/* Wrapper around the worker above which removes locs from visited VALUEs
 to avoid visiting them multiple times.  We unwind that changes here.  */

2112static rtx
2113find_base_term (rtx x)
2114{
auto_vec<std::pair<cselib_val *, struct elt_loc_list *>, 32> visited_vals;
rtx res = find_base_term (x, visited_vals);
for (unsigned i = 0; i < visited_vals.length (); ++i)
  visited_vals[i].first->locs = visited_vals[i].second;
return res;
2120}

2122/* Return true if accesses to address X may alias accesses based
 on the stack pointer.  */

2125bool
2126may_be_sp_based_p (rtx x)
2127{
rtx base = find_base_term (x);
return !base || base == static_reg_base_value(this_target_rtl->x_static_reg_base_value)[STACK_POINTER_REGNUM7];
2130}

2132/* BASE1 and BASE2 are decls.  Return 1 if they refer to same object, 0
 if they refer to different objects and -1 if we cannot decide.  */

2135int
2136compare_base_decls (tree base1, tree base2)
2137{
int ret;
gcc_checking_assert (DECL_P (base1) && DECL_P (base2))((void)(!((tree_code_type[(int) (((enum tree_code) (base1)->
base.code))] == tcc_declaration) && (tree_code_type[(
int) (((enum tree_code) (base2)->base.code))] == tcc_declaration
)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2139, __FUNCTION__), 0 : 0));
if (base1 == base2)
  return 1;

/* If we have two register decls with register specification we
   cannot decide unless their assembler names are the same.  */
if (VAR_P (base1)(((enum tree_code) (base1)->base.code) == VAR_DECL)
    && VAR_P (base2)(((enum tree_code) (base2)->base.code) == VAR_DECL)
    && DECL_HARD_REGISTER (base1)((tree_check ((base1), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2147, __FUNCTION__, (VAR_DECL)))->decl_with_vis.hard_register
)
    && DECL_HARD_REGISTER (base2)((tree_check ((base2), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2148, __FUNCTION__, (VAR_DECL)))->decl_with_vis.hard_register
)
    && DECL_ASSEMBLER_NAME_SET_P (base1)(((contains_struct_check ((base1), (TS_DECL_WITH_VIS), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2149, __FUNCTION__))->decl_with_vis.assembler_name) != (
tree) nullptr)
    && DECL_ASSEMBLER_NAME_SET_P (base2)(((contains_struct_check ((base2), (TS_DECL_WITH_VIS), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2150, __FUNCTION__))->decl_with_vis.assembler_name) != (
tree) nullptr))
  {
    if (DECL_ASSEMBLER_NAME_RAW (base1)((contains_struct_check ((base1), (TS_DECL_WITH_VIS), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2152, __FUNCTION__))->decl_with_vis.assembler_name) == DECL_ASSEMBLER_NAME_RAW (base2)((contains_struct_check ((base2), (TS_DECL_WITH_VIS), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2152, __FUNCTION__))->decl_with_vis.assembler_name))
return 1;
    return -1;
  }

/* Declarations of non-automatic variables may have aliases.  All other
   decls are unique.  */
if (!decl_in_symtab_p (base1)
    || !decl_in_symtab_p (base2))
  return 0;

/* Don't cause symbols to be inserted by the act of checking.  */
symtab_node *node1 = symtab_node::get (base1);
if (!node1)
  return 0;
symtab_node *node2 = symtab_node::get (base2);
if (!node2)
  return 0;

ret = node1->equal_address_to (node2, true);
return ret;
2173}

2175/* Same as compare_base_decls but for SYMBOL_REF.  */

2177static int
2178compare_base_symbol_refs (const_rtx x_base, const_rtx y_base)
2179{
tree x_decl = SYMBOL_REF_DECL (x_base)((__extension__ ({ __typeof ((x_base)) const _rtx = ((x_base)
); if (((enum rtx_code) (_rtx)->code) != SYMBOL_REF) rtl_check_failed_flag
 ("CONSTANT_POOL_ADDRESS_P", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2180, __FUNCTION__); _rtx; })->unchanging) ? nullptr : (
(((x_base))->u.fld[1]).rt_tree));
tree y_decl = SYMBOL_REF_DECL (y_base)((__extension__ ({ __typeof ((y_base)) const _rtx = ((y_base)
); if (((enum rtx_code) (_rtx)->code) != SYMBOL_REF) rtl_check_failed_flag
 ("CONSTANT_POOL_ADDRESS_P", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2181, __FUNCTION__); _rtx; })->unchanging) ? nullptr : (
(((y_base))->u.fld[1]).rt_tree));
bool binds_def = true;

if (XSTR (x_base, 0)(((x_base)->u.fld[0]).rt_str) == XSTR (y_base, 0)(((y_base)->u.fld[0]).rt_str))
  return 1;
if (x_decl && y_decl)
  return compare_base_decls (x_decl, y_decl);
if (x_decl || y_decl)
  {
    if (!x_decl)
{
 std::swap (x_decl, y_decl);
 std::swap (x_base, y_base);
}
    /* We handle specially only section anchors and assume that other
 labels may overlap with user variables in an arbitrary way.  */
    if (!SYMBOL_REF_HAS_BLOCK_INFO_P (y_base)(((__extension__ ({ __typeof ((y_base)) const _rtx = ((y_base
)); if (((enum rtx_code) (_rtx)->code) != SYMBOL_REF) rtl_check_failed_flag
 ("SYMBOL_REF_FLAGS", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2197, __FUNCTION__); _rtx; }) ->u2.symbol_ref_flags) &
 (1 << 7)) != 0))
      return -1;
    /* Anchors contains static VAR_DECLs and CONST_DECLs.  We are safe
to ignore CONST_DECLs because they are readonly.  */
    if (!VAR_P (x_decl)(((enum tree_code) (x_decl)->base.code) == VAR_DECL)
 || (!TREE_STATIC (x_decl)((x_decl)->base.static_flag) && !TREE_PUBLIC (x_decl)((x_decl)->base.public_flag)))
return 0;

    symtab_node *x_node = symtab_node::get_create (x_decl)
	    ->ultimate_alias_target ();
    /* External variable cannot be in section anchor.  */
    if (!x_node->definition)
return 0;
    x_base = XEXP (DECL_RTL (x_node->decl), 0)(((((contains_struct_check ((x_node->decl), (TS_DECL_WRTL)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2210, __FUNCTION__))->decl_with_rtl.rtl ? (x_node->decl
)->decl_with_rtl.rtl : (make_decl_rtl (x_node->decl), (
x_node->decl)->decl_with_rtl.rtl)))->u.fld[0]).rt_rtx
);
    /* If not in anchor, we can disambiguate.  */
    if (!SYMBOL_REF_HAS_BLOCK_INFO_P (x_base)(((__extension__ ({ __typeof ((x_base)) const _rtx = ((x_base
)); if (((enum rtx_code) (_rtx)->code) != SYMBOL_REF) rtl_check_failed_flag
 ("SYMBOL_REF_FLAGS", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2212, __FUNCTION__); _rtx; }) ->u2.symbol_ref_flags) &
 (1 << 7)) != 0))
return 0;

    /* We have an alias of anchored variable.  If it can be interposed;
 we must assume it may or may not alias its anchor.  */
    binds_def = decl_binds_to_current_def_p (x_decl);
  }
/* If we have variable in section anchor, we can compare by offset.  */
if (SYMBOL_REF_HAS_BLOCK_INFO_P (x_base)(((__extension__ ({ __typeof ((x_base)) const _rtx = ((x_base
)); if (((enum rtx_code) (_rtx)->code) != SYMBOL_REF) rtl_check_failed_flag
 ("SYMBOL_REF_FLAGS", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2220, __FUNCTION__); _rtx; }) ->u2.symbol_ref_flags) &
 (1 << 7)) != 0)
    && SYMBOL_REF_HAS_BLOCK_INFO_P (y_base)(((__extension__ ({ __typeof ((y_base)) const _rtx = ((y_base
)); if (((enum rtx_code) (_rtx)->code) != SYMBOL_REF) rtl_check_failed_flag
 ("SYMBOL_REF_FLAGS", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2221, __FUNCTION__); _rtx; }) ->u2.symbol_ref_flags) &
 (1 << 7)) != 0))
  {
    if (SYMBOL_REF_BLOCK (x_base)((&(x_base)->u.block_sym)->block) != SYMBOL_REF_BLOCK (y_base)((&(y_base)->u.block_sym)->block))
return 0;
    if (SYMBOL_REF_BLOCK_OFFSET (x_base)((&(x_base)->u.block_sym)->offset) == SYMBOL_REF_BLOCK_OFFSET (y_base)((&(y_base)->u.block_sym)->offset))
return binds_def ? 1 : -1;
    if (SYMBOL_REF_ANCHOR_P (x_base)(((__extension__ ({ __typeof ((x_base)) const _rtx = ((x_base
)); if (((enum rtx_code) (_rtx)->code) != SYMBOL_REF) rtl_check_failed_flag
 ("SYMBOL_REF_FLAGS", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2227, __FUNCTION__); _rtx; }) ->u2.symbol_ref_flags) &
 (1 << 8)) != 0) != SYMBOL_REF_ANCHOR_P (y_base)(((__extension__ ({ __typeof ((y_base)) const _rtx = ((y_base
)); if (((enum rtx_code) (_rtx)->code) != SYMBOL_REF) rtl_check_failed_flag
 ("SYMBOL_REF_FLAGS", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2227, __FUNCTION__); _rtx; }) ->u2.symbol_ref_flags) &
 (1 << 8)) != 0))
return -1;
    return 0;
  }
/* In general we assume that memory locations pointed to by different labels
   may overlap in undefined ways.  */
return -1;
2234}

2236/* Return 0 if the addresses X and Y are known to point to different
 objects, 1 if they might be pointers to the same object.  */

2239static int
2240base_alias_check (rtx x, rtx x_base, rtx y, rtx y_base,
  machine_mode x_mode, machine_mode y_mode)
2242{
/* If the address itself has no known base see if a known equivalent
   value has one.  If either address still has no known base, nothing
   is known about aliasing.  */
if (x_base == 0)
  {
    rtx x_c;

    if (! flag_expensive_optimizationsglobal_options.x_flag_expensive_optimizations || (x_c = canon_rtx (x)) == x)
return 1;

    x_base = find_base_term (x_c);
    if (x_base == 0)
return 1;
  }

if (y_base == 0)
  {
    rtx y_c;
    if (! flag_expensive_optimizationsglobal_options.x_flag_expensive_optimizations || (y_c = canon_rtx (y)) == y)
return 1;

    y_base = find_base_term (y_c);
    if (y_base == 0)
return 1;
  }

/* If the base addresses are equal nothing is known about aliasing.  */
if (rtx_equal_p (x_base, y_base))
  return 1;

/* The base addresses are different expressions.  If they are not accessed
   via AND, there is no conflict.  We can bring knowledge of object
   alignment into play here.  For example, on alpha, "char a, b;" can
   alias one another, though "char a; long b;" cannot.  AND addresses may
   implicitly alias surrounding objects; i.e. unaligned access in DImode
   via AND address can alias all surrounding object types except those
   with aligment 8 or higher.  */
if (GET_CODE (x)((enum rtx_code) (x)->code) == AND && GET_CODE (y)((enum rtx_code) (y)->code) == AND)
  return 1;
if (GET_CODE (x)((enum rtx_code) (x)->code) == AND
    && (!CONST_INT_P (XEXP (x, 1))(((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) == CONST_INT
)
 || (int) GET_MODE_UNIT_SIZE (y_mode)mode_to_unit_size (y_mode) < -INTVAL (XEXP (x, 1))(((((x)->u.fld[1]).rt_rtx))->u.hwint[0])))
  return 1;
if (GET_CODE (y)((enum rtx_code) (y)->code) == AND
    && (!CONST_INT_P (XEXP (y, 1))(((enum rtx_code) ((((y)->u.fld[1]).rt_rtx))->code) == CONST_INT
)
 || (int) GET_MODE_UNIT_SIZE (x_mode)mode_to_unit_size (x_mode) < -INTVAL (XEXP (y, 1))(((((y)->u.fld[1]).rt_rtx))->u.hwint[0])))
  return 1;

/* Differing symbols not accessed via AND never alias.  */
if (GET_CODE (x_base)((enum rtx_code) (x_base)->code) == SYMBOL_REF && GET_CODE (y_base)((enum rtx_code) (y_base)->code) == SYMBOL_REF)
  return compare_base_symbol_refs (x_base, y_base) != 0;

if (GET_CODE (x_base)((enum rtx_code) (x_base)->code) != ADDRESS && GET_CODE (y_base)((enum rtx_code) (y_base)->code) != ADDRESS)
  return 0;

if (unique_base_value_p (x_base) || unique_base_value_p (y_base))
  return 0;

return 1;
2302}

2304/* Return TRUE if EXPR refers to a VALUE whose uid is greater than
 (or equal to) that of V.  */

2307static bool
2308refs_newer_value_p (const_rtx expr, rtx v)
2309{
int minuid = CSELIB_VAL_PTR (v)(((v)->u.fld[0]).rt_cselib)->uid;
subrtx_iterator::array_type array;
FOR_EACH_SUBRTX (iter, array, expr, NONCONST)for (subrtx_iterator iter (array, expr, rtx_nonconst_subrtx_bounds
); !iter.at_end (); iter.next ())
  if (GET_CODE (*iter)((enum rtx_code) (*iter)->code) == VALUE && CSELIB_VAL_PTR (*iter)(((*iter)->u.fld[0]).rt_cselib)->uid >= minuid)
    return true;
return false;
2316}

2318/* Convert the address X into something we can use.  This is done by returning
 it unchanged unless it is a VALUE or VALUE +/- constant; for VALUE
 we call cselib to get a more useful rtx.  */

2322rtx
2323get_addr (rtx x)
2324{
cselib_val *v;
struct elt_loc_list *l;

if (GET_CODE (x)((enum rtx_code) (x)->code) != VALUE)
  {
    if ((GET_CODE (x)((enum rtx_code) (x)->code) == PLUS || GET_CODE (x)((enum rtx_code) (x)->code) == MINUS)
 && GET_CODE (XEXP (x, 0))((enum rtx_code) ((((x)->u.fld[0]).rt_rtx))->code) == VALUE
 && CONST_SCALAR_INT_P (XEXP (x, 1))((((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) ==
 CONST_INT) || (((enum rtx_code) ((((x)->u.fld[1]).rt_rtx)
)->code) == CONST_WIDE_INT)))
{
 rtx op0 = get_addr (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx));
 if (op0 != XEXP (x, 0)(((x)->u.fld[0]).rt_rtx))
   {
     poly_int64 c;
     if (GET_CODE (x)((enum rtx_code) (x)->code) == PLUS
  && poly_int_rtx_p (XEXP (x, 1)(((x)->u.fld[1]).rt_rtx), &c))
return plus_constant (GET_MODE (x)((machine_mode) (x)->mode), op0, c);
     return simplify_gen_binary (GET_CODE (x)((enum rtx_code) (x)->code), GET_MODE (x)((machine_mode) (x)->mode),
			  op0, XEXP (x, 1)(((x)->u.fld[1]).rt_rtx));
   }
}
    return x;
  }
v = CSELIB_VAL_PTR (x)(((x)->u.fld[0]).rt_cselib);
if (v)
  {
    bool have_equivs = cselib_have_permanent_equivalences ();
    if (have_equivs)
v = canonical_cselib_val (v);
    for (l = v->locs; l; l = l->next)
if (CONSTANT_P (l->loc)((rtx_class[(int) (((enum rtx_code) (l->loc)->code))]) ==
 RTX_CONST_OBJ))
 return l->loc;
    for (l = v->locs; l; l = l->next)
if (!REG_P (l->loc)(((enum rtx_code) (l->loc)->code) == REG) && !MEM_P (l->loc)(((enum rtx_code) (l->loc)->code) == MEM)
   /* Avoid infinite recursion when potentially dealing with
      var-tracking artificial equivalences, by skipping the
      equivalences themselves, and not choosing expressions
      that refer to newer VALUEs.  */
   && (!have_equivs
|| (GET_CODE (l->loc)((enum rtx_code) (l->loc)->code) != VALUE
    && !refs_newer_value_p (l->loc, x))))
 return l->loc;
    if (have_equivs)
{
 for (l = v->locs; l; l = l->next)
   if (REG_P (l->loc)(((enum rtx_code) (l->loc)->code) == REG)
|| (GET_CODE (l->loc)((enum rtx_code) (l->loc)->code) != VALUE
    && !refs_newer_value_p (l->loc, x)))
     return l->loc;
 /* Return the canonical value.  */
 return v->val_rtx;
}
    if (v->locs)
return v->locs->loc;
  }
return x;
2380}

2382/*  Return the address of the (N_REFS + 1)th memory reference to ADDR
  where SIZE is the size in bytes of the memory reference.  If ADDR
  is not modified by the memory reference then ADDR is returned.  */

2386static rtx
2387addr_side_effect_eval (rtx addr, poly_int64 size, int n_refs)
2388{
poly_int64 offset = 0;

switch (GET_CODE (addr)((enum rtx_code) (addr)->code))
  {
  case PRE_INC:
    offset = (n_refs + 1) * size;
    break;
  case PRE_DEC:
    offset = -(n_refs + 1) * size;
    break;
  case POST_INC:
    offset = n_refs * size;
    break;
  case POST_DEC:
    offset = -n_refs * size;
    break;

  default:
    return addr;
  }

addr = plus_constant (GET_MODE (addr)((machine_mode) (addr)->mode), XEXP (addr, 0)(((addr)->u.fld[0]).rt_rtx), offset);
addr = canon_rtx (addr);

return addr;
2414}

2416/* Return TRUE if an object X sized at XSIZE bytes and another object
 Y sized at YSIZE bytes, starting C bytes after X, may overlap.  If
 any of the sizes is zero, assume an overlap, otherwise use the
 absolute value of the sizes as the actual sizes.  */

2421static inline bool
2422offset_overlap_p (poly_int64 c, poly_int64 xsize, poly_int64 ysize)
2423{
if (known_eq (xsize, 0)(!maybe_ne (xsize, 0)) || known_eq (ysize, 0)(!maybe_ne (ysize, 0)))
  return true;

if (maybe_ge (c, 0)maybe_le (0, c))
  return maybe_gt (maybe_lt (xsize, 0) ? -xsize : xsize, c)maybe_lt (c, maybe_lt (xsize, 0) ? -xsize : xsize);
else
  return maybe_gt (maybe_lt (ysize, 0) ? -ysize : ysize, -c)maybe_lt (-c, maybe_lt (ysize, 0) ? -ysize : ysize);
2431}

2433/* Return one if X and Y (memory addresses) reference the
 same location in memory or if the references overlap.
 Return zero if they do not overlap, else return
 minus one in which case they still might reference the same location.

 C is an offset accumulator.  When
 C is nonzero, we are testing aliases between X and Y + C.
 XSIZE is the size in bytes of the X reference,
 similarly YSIZE is the size in bytes for Y.
 Expect that canon_rtx has been already called for X and Y.

 If XSIZE or YSIZE is zero, we do not know the amount of memory being
 referenced (the reference was BLKmode), so make the most pessimistic
 assumptions.

 If XSIZE or YSIZE is negative, we may access memory outside the object
 being referenced as a side effect.  This can happen when using AND to
 align memory references, as is done on the Alpha.

 Nice to notice that varying addresses cannot conflict with fp if no
 local variables had their addresses taken, but that's too hard now.

 ???  Contrary to the tree alias oracle this does not return
 one for X + non-constant and Y + non-constant when X and Y are equal.
 If that is fixed the TBAA hack for union type-punning can be removed.  */

2459static int
2460memrefs_conflict_p (poly_int64 xsize, rtx x, poly_int64 ysize, rtx y,
    poly_int64 c)
2462{
if (GET_CODE (x)((enum rtx_code) (x)->code) == VALUE)
  {
    if (REG_P (y)(((enum rtx_code) (y)->code) == REG))
{
 struct elt_loc_list *l = NULLnullptr;
 if (CSELIB_VAL_PTR (x)(((x)->u.fld[0]).rt_cselib))
   for (l = canonical_cselib_val (CSELIB_VAL_PTR (x)(((x)->u.fld[0]).rt_cselib))->locs;
 l; l = l->next)
     if (REG_P (l->loc)(((enum rtx_code) (l->loc)->code) == REG) && rtx_equal_for_memref_p (l->loc, y))
break;
 if (l)
   x = y;
 else
   x = get_addr (x);
}
    /* Don't call get_addr if y is the same VALUE.  */
    else if (x != y)
x = get_addr (x);
  }
if (GET_CODE (y)((enum rtx_code) (y)->code) == VALUE)
  {
    if (REG_P (x)(((enum rtx_code) (x)->code) == REG))
{
 struct elt_loc_list *l = NULLnullptr;
 if (CSELIB_VAL_PTR (y)(((y)->u.fld[0]).rt_cselib))
   for (l = canonical_cselib_val (CSELIB_VAL_PTR (y)(((y)->u.fld[0]).rt_cselib))->locs;
 l; l = l->next)
     if (REG_P (l->loc)(((enum rtx_code) (l->loc)->code) == REG) && rtx_equal_for_memref_p (l->loc, x))
break;
 if (l)
   y = x;
 else
   y = get_addr (y);
}
    /* Don't call get_addr if x is the same VALUE.  */
    else if (y != x)
y = get_addr (y);
  }
if (GET_CODE (x)((enum rtx_code) (x)->code) == HIGH)
  x = XEXP (x, 0)(((x)->u.fld[0]).rt_rtx);
else if (GET_CODE (x)((enum rtx_code) (x)->code) == LO_SUM)
  x = XEXP (x, 1)(((x)->u.fld[1]).rt_rtx);
else
  x = addr_side_effect_eval (x, maybe_lt (xsize, 0) ? -xsize : xsize, 0);
if (GET_CODE (y)((enum rtx_code) (y)->code) == HIGH)
  y = XEXP (y, 0)(((y)->u.fld[0]).rt_rtx);
else if (GET_CODE (y)((enum rtx_code) (y)->code) == LO_SUM)
  y = XEXP (y, 1)(((y)->u.fld[1]).rt_rtx);
else
  y = addr_side_effect_eval (y, maybe_lt (ysize, 0) ? -ysize : ysize, 0);

if (GET_CODE (x)((enum rtx_code) (x)->code) == SYMBOL_REF && GET_CODE (y)((enum rtx_code) (y)->code) == SYMBOL_REF)
  {
    int cmp = compare_base_symbol_refs (x,y);

    /* If both decls are the same, decide by offsets.  */
    if (cmp == 1)
      return offset_overlap_p (c, xsize, ysize);
    /* Assume a potential overlap for symbolic addresses that went
through alignment adjustments (i.e., that have negative
sizes), because we can't know how far they are from each
other.  */
    if (maybe_lt (xsize, 0) || maybe_lt (ysize, 0))
return -1;
    /* If decls are different or we know by offsets that there is no overlap,
we win.  */
    if (!cmp || !offset_overlap_p (c, xsize, ysize))
return 0;
    /* Decls may or may not be different and offsets overlap....*/
    return -1;
  }
else if (rtx_equal_for_memref_p (x, y))
  {
    return offset_overlap_p (c, xsize, ysize);
  }

/* This code used to check for conflicts involving stack references and
   globals but the base address alias code now handles these cases.  */

if (GET_CODE (x)((enum rtx_code) (x)->code) == PLUS)
  {
    /* The fact that X is canonicalized means that this
PLUS rtx is canonicalized.  */
    rtx x0 = XEXP (x, 0)(((x)->u.fld[0]).rt_rtx);
    rtx x1 = XEXP (x, 1)(((x)->u.fld[1]).rt_rtx);

    /* However, VALUEs might end up in different positions even in
canonical PLUSes.  Comparing their addresses is enough.  */
    if (x0 == y)
return memrefs_conflict_p (xsize, x1, ysize, const0_rtx(const_int_rtx[64]), c);
    else if (x1 == y)
return memrefs_conflict_p (xsize, x0, ysize, const0_rtx(const_int_rtx[64]), c);

    poly_int64 cx1, cy1;
    if (GET_CODE (y)((enum rtx_code) (y)->code) == PLUS)
{
 /* The fact that Y is canonicalized means that this
    PLUS rtx is canonicalized.  */
 rtx y0 = XEXP (y, 0)(((y)->u.fld[0]).rt_rtx);
 rtx y1 = XEXP (y, 1)(((y)->u.fld[1]).rt_rtx);

 if (x0 == y1)
   return memrefs_conflict_p (xsize, x1, ysize, y0, c);
 if (x1 == y0)
   return memrefs_conflict_p (xsize, x0, ysize, y1, c);

 if (rtx_equal_for_memref_p (x1, y1))
   return memrefs_conflict_p (xsize, x0, ysize, y0, c);
 if (rtx_equal_for_memref_p (x0, y0))
   return memrefs_conflict_p (xsize, x1, ysize, y1, c);
 if (poly_int_rtx_p (x1, &cx1))
   {
     if (poly_int_rtx_p (y1, &cy1))
return memrefs_conflict_p (xsize, x0, ysize, y0,
			   c - cx1 + cy1);
     else
return memrefs_conflict_p (xsize, x0, ysize, y, c - cx1);
   }
 else if (poly_int_rtx_p (y1, &cy1))
   return memrefs_conflict_p (xsize, x, ysize, y0, c + cy1);

 return -1;
}
    else if (poly_int_rtx_p (x1, &cx1))
return memrefs_conflict_p (xsize, x0, ysize, y, c - cx1);
  }
else if (GET_CODE (y)((enum rtx_code) (y)->code) == PLUS)
  {
    /* The fact that Y is canonicalized means that this
PLUS rtx is canonicalized.  */
    rtx y0 = XEXP (y, 0)(((y)->u.fld[0]).rt_rtx);
    rtx y1 = XEXP (y, 1)(((y)->u.fld[1]).rt_rtx);

    if (x == y0)
return memrefs_conflict_p (xsize, const0_rtx(const_int_rtx[64]), ysize, y1, c);
    if (x == y1)
return memrefs_conflict_p (xsize, const0_rtx(const_int_rtx[64]), ysize, y0, c);

    poly_int64 cy1;
    if (poly_int_rtx_p (y1, &cy1))
return memrefs_conflict_p (xsize, x, ysize, y0, c + cy1);
    else
return -1;
  }

if (GET_CODE (x)((enum rtx_code) (x)->code) == GET_CODE (y)((enum rtx_code) (y)->code))
  switch (GET_CODE (x)((enum rtx_code) (x)->code))
    {
    case MULT:
{
 /* Handle cases where we expect the second operands to be the
    same, and check only whether the first operand would conflict
    or not.  */
 rtx x0, y0;
 rtx x1 = canon_rtx (XEXP (x, 1)(((x)->u.fld[1]).rt_rtx));
 rtx y1 = canon_rtx (XEXP (y, 1)(((y)->u.fld[1]).rt_rtx));
 if (! rtx_equal_for_memref_p (x1, y1))
   return -1;
 x0 = canon_rtx (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx));
 y0 = canon_rtx (XEXP (y, 0)(((y)->u.fld[0]).rt_rtx));
 if (rtx_equal_for_memref_p (x0, y0))
   return offset_overlap_p (c, xsize, ysize);

 /* Can't properly adjust our sizes.  */
 poly_int64 c1;
 if (!poly_int_rtx_p (x1, &c1)
     || !can_div_trunc_p (xsize, c1, &xsize)
     || !can_div_trunc_p (ysize, c1, &ysize)
     || !can_div_trunc_p (c, c1, &c))
   return -1;
 return memrefs_conflict_p (xsize, x0, ysize, y0, c);
}

    default:
break;
    }

/* Deal with alignment ANDs by adjusting offset and size so as to
   cover the maximum range, without taking any previously known
   alignment into account.  Make a size negative after such an
   adjustments, so that, if we end up with e.g. two SYMBOL_REFs, we
   assume a potential overlap, because they may end up in contiguous
   memory locations and the stricter-alignment access may span over
   part of both.  */
if (GET_CODE (x)((enum rtx_code) (x)->code) == AND && CONST_INT_P (XEXP (x, 1))(((enum rtx_code) ((((x)->u.fld[1]).rt_rtx))->code) == CONST_INT
))
  {
    HOST_WIDE_INTlong sc = INTVAL (XEXP (x, 1))(((((x)->u.fld[1]).rt_rtx))->u.hwint[0]);
    unsigned HOST_WIDE_INTlong uc = sc;
    if (sc < 0 && pow2_or_zerop (-uc))
{
 if (maybe_gt (xsize, 0)maybe_lt (0, xsize))
   xsize = -xsize;
 if (maybe_ne (xsize, 0))
   xsize += sc + 1;
 c -= sc + 1;
 return memrefs_conflict_p (xsize, canon_rtx (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx)),
		     ysize, y, c);
}
  }
if (GET_CODE (y)((enum rtx_code) (y)->code) == AND && CONST_INT_P (XEXP (y, 1))(((enum rtx_code) ((((y)->u.fld[1]).rt_rtx))->code) == CONST_INT
))
  {
    HOST_WIDE_INTlong sc = INTVAL (XEXP (y, 1))(((((y)->u.fld[1]).rt_rtx))->u.hwint[0]);
    unsigned HOST_WIDE_INTlong uc = sc;
    if (sc < 0 && pow2_or_zerop (-uc))
{
 if (maybe_gt (ysize, 0)maybe_lt (0, ysize))
   ysize = -ysize;
 if (maybe_ne (ysize, 0))
   ysize += sc + 1;
 c += sc + 1;
 return memrefs_conflict_p (xsize, x,
		     ysize, canon_rtx (XEXP (y, 0)(((y)->u.fld[0]).rt_rtx)), c);
}
  }

if (CONSTANT_P (x)((rtx_class[(int) (((enum rtx_code) (x)->code))]) == RTX_CONST_OBJ
))
  {
    poly_int64 cx, cy;
    if (poly_int_rtx_p (x, &cx) && poly_int_rtx_p (y, &cy))
{
 c += cy - cx;
 return offset_overlap_p (c, xsize, ysize);
}

    if (GET_CODE (x)((enum rtx_code) (x)->code) == CONST)
{
 if (GET_CODE (y)((enum rtx_code) (y)->code) == CONST)
   return memrefs_conflict_p (xsize, canon_rtx (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx)),
		       ysize, canon_rtx (XEXP (y, 0)(((y)->u.fld[0]).rt_rtx)), c);
 else
   return memrefs_conflict_p (xsize, canon_rtx (XEXP (x, 0)(((x)->u.fld[0]).rt_rtx)),
		       ysize, y, c);
}
    if (GET_CODE (y)((enum rtx_code) (y)->code) == CONST)
return memrefs_conflict_p (xsize, x, ysize,
		   canon_rtx (XEXP (y, 0)(((y)->u.fld[0]).rt_rtx)), c);

    /* Assume a potential overlap for symbolic addresses that went
through alignment adjustments (i.e., that have negative
sizes), because we can't know how far they are from each
other.  */
    if (CONSTANT_P (y)((rtx_class[(int) (((enum rtx_code) (y)->code))]) == RTX_CONST_OBJ
))
return (maybe_lt (xsize, 0)
|| maybe_lt (ysize, 0)
|| offset_overlap_p (c, xsize, ysize));

    return -1;
  }

return -1;
2713}

2715/* Functions to compute memory dependencies.

 Since we process the insns in execution order, we can build tables
 to keep track of what registers are fixed (and not aliased), what registers
 are varying in known ways, and what registers are varying in unknown
 ways.

 If both memory references are volatile, then there must always be a
 dependence between the two references, since their order cannot be
 changed.  A volatile and non-volatile reference can be interchanged
 though.

 We also must allow AND addresses, because they may generate accesses
 outside the object being referenced.  This is used to generate aligned
 addresses from unaligned addresses, for instance, the alpha
 storeqi_unaligned pattern.  */

2732/* Read dependence: X is read after read in MEM takes place.  There can
 only be a dependence here if both reads are volatile, or if either is
 an explicit barrier.  */

2736int
2737read_dependence (const_rtx mem, const_rtx x)
2738{
if (MEM_VOLATILE_P (x)(__extension__ ({ __typeof ((x)) const _rtx = ((x)); if (((enum
 rtx_code) (_rtx)->code) != MEM && ((enum rtx_code
) (_rtx)->code) != ASM_OPERANDS && ((enum rtx_code
) (_rtx)->code) != ASM_INPUT) rtl_check_failed_flag ("MEM_VOLATILE_P"
, _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2739, __FUNCTION__); _rtx; })->volatil) && MEM_VOLATILE_P (mem)(__extension__ ({ __typeof ((mem)) const _rtx = ((mem)); if (
((enum rtx_code) (_rtx)->code) != MEM && ((enum rtx_code
) (_rtx)->code) != ASM_OPERANDS && ((enum rtx_code
) (_rtx)->code) != ASM_INPUT) rtl_check_failed_flag ("MEM_VOLATILE_P"
, _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2739, __FUNCTION__); _rtx; })->volatil))
  return true;
if (MEM_ALIAS_SET (x)(get_mem_attrs (x)->alias) == ALIAS_SET_MEMORY_BARRIER((alias_set_type) -1)
    || MEM_ALIAS_SET (mem)(get_mem_attrs (mem)->alias) == ALIAS_SET_MEMORY_BARRIER((alias_set_type) -1))
  return true;
return false;
2745}

2747/* Look at the bottom of the COMPONENT_REF list for a DECL, and return it.  */

2749static tree
2750decl_for_component_ref (tree x)
2751{
do
  {
    x = TREE_OPERAND (x, 0)(*((const_cast<tree*> (tree_operand_check ((x), (0), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2754, __FUNCTION__)))));
  }
while (x && TREE_CODE (x)((enum tree_code) (x)->base.code) == COMPONENT_REF);

return x && DECL_P (x)(tree_code_type[(int) (((enum tree_code) (x)->base.code))]
 == tcc_declaration) ? x : NULL_TREE(tree) nullptr;
2759}

2761/* Walk up the COMPONENT_REF list in X and adjust *OFFSET to compensate
 for the offset of the field reference.  *KNOWN_P says whether the
 offset is known.  */

2765static void
2766adjust_offset_for_component_ref (tree x, bool *known_p,
		 poly_int64 *offset)
2768{
if (!*known_p)
  return;
do
  {
    tree xoffset = component_ref_field_offset (x);
    tree field = TREE_OPERAND (x, 1)(*((const_cast<tree*> (tree_operand_check ((x), (1), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2774, __FUNCTION__)))));
    if (!poly_int_tree_p (xoffset))
{
 *known_p = false;
 return;
}

    poly_offset_int woffset
= (wi::to_poly_offset (xoffset)
  + (wi::to_offset (DECL_FIELD_BIT_OFFSET (field)((tree_check ((field), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2783, __FUNCTION__, (FIELD_DECL)))->field_decl.bit_offset
))
     >> LOG2_BITS_PER_UNIT3)
  + *offset);
    if (!woffset.to_shwi (offset))
{
 *known_p = false;
 return;
}

    x = TREE_OPERAND (x, 0)(*((const_cast<tree*> (tree_operand_check ((x), (0), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2792, __FUNCTION__)))));
  }
while (x && TREE_CODE (x)((enum tree_code) (x)->base.code) == COMPONENT_REF);
2795}

2797/* Return nonzero if we can determine the exprs corresponding to memrefs
 X and Y and they do not overlap. 
 If LOOP_VARIANT is set, skip offset-based disambiguation */

2801int
2802nonoverlapping_memrefs_p (const_rtx x, const_rtx y, bool loop_invariant)
2803{
tree exprx = MEM_EXPR (x)(get_mem_attrs (x)->expr), expry = MEM_EXPR (y)(get_mem_attrs (y)->expr);
rtx rtlx, rtly;
rtx basex, basey;
bool moffsetx_known_p, moffsety_known_p;
poly_int64 moffsetx = 0, moffsety = 0;
poly_int64 offsetx = 0, offsety = 0, sizex, sizey;

/* Unless both have exprs, we can't tell anything.  */
if (exprx == 0 || expry == 0)
  return 0;

/* For spill-slot accesses make sure we have valid offsets.  */
if ((exprx == get_spill_slot_decl (false)
     && ! MEM_OFFSET_KNOWN_P (x)(get_mem_attrs (x)->offset_known_p))
    || (expry == get_spill_slot_decl (false)
 && ! MEM_OFFSET_KNOWN_P (y)(get_mem_attrs (y)->offset_known_p)))
  return 0;

/* If the field reference test failed, look at the DECLs involved.  */
moffsetx_known_p = MEM_OFFSET_KNOWN_P (x)(get_mem_attrs (x)->offset_known_p);
if (moffsetx_known_p)
  moffsetx = MEM_OFFSET (x)(get_mem_attrs (x)->offset);
if (TREE_CODE (exprx)((enum tree_code) (exprx)->base.code) == COMPONENT_REF)
  {
    tree t = decl_for_component_ref (exprx);
    if (! t)
return 0;
    adjust_offset_for_component_ref (exprx, &moffsetx_known_p, &moffsetx);
    exprx = t;
  }

moffsety_known_p = MEM_OFFSET_KNOWN_P (y)(get_mem_attrs (y)->offset_known_p);
if (moffsety_known_p)
  moffsety = MEM_OFFSET (y)(get_mem_attrs (y)->offset);
if (TREE_CODE (expry)((enum tree_code) (expry)->base.code) == COMPONENT_REF)
  {
    tree t = decl_for_component_ref (expry);
    if (! t)
return 0;
    adjust_offset_for_component_ref (expry, &moffsety_known_p, &moffsety);
    expry = t;
  }

if (! DECL_P (exprx)(tree_code_type[(int) (((enum tree_code) (exprx)->base.code
))] == tcc_declaration) || ! DECL_P (expry)(tree_code_type[(int) (((enum tree_code) (expry)->base.code
))] == tcc_declaration))
  return 0;

/* If we refer to different gimple registers, or one gimple register
   and one non-gimple-register, we know they can't overlap.  First,
   gimple registers don't have their addresses taken.  Now, there
   could be more than one stack slot for (different versions of) the
   same gimple register, but we can presumably tell they don't
   overlap based on offsets from stack base addresses elsewhere.
   It's important that we don't proceed to DECL_RTL, because gimple
   registers may not pass DECL_RTL_SET_P, and make_decl_rtl won't be
   able to do anything about them since no SSA information will have
   remained to guide it.  */
if (is_gimple_reg (exprx) || is_gimple_reg (expry))
  return exprx != expry
    || (moffsetx_known_p && moffsety_known_p
 && MEM_SIZE_KNOWN_P (x)(get_mem_attrs (x)->size_known_p) && MEM_SIZE_KNOWN_P (y)(get_mem_attrs (y)->size_known_p)
 && !offset_overlap_p (moffsety - moffsetx,
		MEM_SIZE (x)(get_mem_attrs (x)->size), MEM_SIZE (y)(get_mem_attrs (y)->size)));

/* With invalid code we can end up storing into the constant pool.
   Bail out to avoid ICEing when creating RTL for this.
   See gfortran.dg/lto/20091028-2_0.f90.  */
if (TREE_CODE (exprx)((enum tree_code) (exprx)->base.code) == CONST_DECL
    || TREE_CODE (expry)((enum tree_code) (expry)->base.code) == CONST_DECL)
  return 1;

/* If one decl is known to be a function or label in a function and
   the other is some kind of data, they can't overlap.  */
if ((TREE_CODE (exprx)((enum tree_code) (exprx)->base.code) == FUNCTION_DECL
     || TREE_CODE (exprx)((enum tree_code) (exprx)->base.code) == LABEL_DECL)
    != (TREE_CODE (expry)((enum tree_code) (expry)->base.code) == FUNCTION_DECL
 || TREE_CODE (expry)((enum tree_code) (expry)->base.code) == LABEL_DECL))
  return 1;

/* If either of the decls doesn't have DECL_RTL set (e.g. marked as
   living in multiple places), we can't tell anything.  Exception
   are FUNCTION_DECLs for which we can create DECL_RTL on demand.  */
if ((!DECL_RTL_SET_P (exprx)(((tree_contains_struct[(((enum tree_code) (exprx)->base.code
))][(TS_DECL_WRTL)])) && (contains_struct_check ((exprx
), (TS_DECL_WRTL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2885, __FUNCTION__))->decl_with_rtl.rtl != nullptr) && TREE_CODE (exprx)((enum tree_code) (exprx)->base.code) != FUNCTION_DECL)
    || (!DECL_RTL_SET_P (expry)(((tree_contains_struct[(((enum tree_code) (expry)->base.code
))][(TS_DECL_WRTL)])) && (contains_struct_check ((expry
), (TS_DECL_WRTL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2886, __FUNCTION__))->decl_with_rtl.rtl != nullptr) && TREE_CODE (expry)((enum tree_code) (expry)->base.code) != FUNCTION_DECL))
  return 0;

rtlx = DECL_RTL (exprx)((contains_struct_check ((exprx), (TS_DECL_WRTL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2889, __FUNCTION__))->decl_with_rtl.rtl ? (exprx)->decl_with_rtl
.rtl : (make_decl_rtl (exprx), (exprx)->decl_with_rtl.rtl)
);
rtly = DECL_RTL (expry)((contains_struct_check ((expry), (TS_DECL_WRTL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2890, __FUNCTION__))->decl_with_rtl.rtl ? (expry)->decl_with_rtl
.rtl : (make_decl_rtl (expry), (expry)->decl_with_rtl.rtl)
);

/* If either RTL is not a MEM, it must be a REG or CONCAT, meaning they
   can't overlap unless they are the same because we never reuse that part
   of the stack frame used for locals for spilled pseudos.  */
if ((!MEM_P (rtlx)(((enum rtx_code) (rtlx)->code) == MEM) || !MEM_P (rtly)(((enum rtx_code) (rtly)->code) == MEM))
    && ! rtx_equal_p (rtlx, rtly))
  return 1;

/* If we have MEMs referring to different address spaces (which can
   potentially overlap), we cannot easily tell from the addresses
   whether the references overlap.  */
if (MEM_P (rtlx)(((enum rtx_code) (rtlx)->code) == MEM) && MEM_P (rtly)(((enum rtx_code) (rtly)->code) == MEM)
    && MEM_ADDR_SPACE (rtlx)(get_mem_attrs (rtlx)->addrspace) != MEM_ADDR_SPACE (rtly)(get_mem_attrs (rtly)->addrspace))
  return 0;

/* Get the base and offsets of both decls.  If either is a register, we
   know both are and are the same, so use that as the base.  The only
   we can avoid overlap is if we can deduce that they are nonoverlapping
   pieces of that decl, which is very rare.  */
basex = MEM_P (rtlx)(((enum rtx_code) (rtlx)->code) == MEM) ? XEXP (rtlx, 0)(((rtlx)->u.fld[0]).rt_rtx) : rtlx;
basex = strip_offset_and_add (basex, &offsetx);

basey = MEM_P (rtly)(((enum rtx_code) (rtly)->code) == MEM) ? XEXP (rtly, 0)(((rtly)->u.fld[0]).rt_rtx) : rtly;
basey = strip_offset_and_add (basey, &offsety);

/* If the bases are different, we know they do not overlap if both
   are constants or if one is a constant and the other a pointer into the
   stack frame.  Otherwise a different base means we can't tell if they
   overlap or not.  */
if (compare_base_decls (exprx, expry) == 0)
  return ((CONSTANT_P (basex)((rtx_class[(int) (((enum rtx_code) (basex)->code))]) == RTX_CONST_OBJ
) && CONSTANT_P (basey)((rtx_class[(int) (((enum rtx_code) (basey)->code))]) == RTX_CONST_OBJ
))
   || (CONSTANT_P (basex)((rtx_class[(int) (((enum rtx_code) (basex)->code))]) == RTX_CONST_OBJ
) && REG_P (basey)(((enum rtx_code) (basey)->code) == REG)
&& REGNO_PTR_FRAME_P (REGNO (basey))(((rhs_regno(basey))) == 7 || ((rhs_regno(basey))) == 19 || (
(rhs_regno(basey))) == 6 || ((rhs_regno(basey))) == 16 || (((
rhs_regno(basey))) >= (76) && ((rhs_regno(basey)))
 <= (((76)) + 4))))
   || (CONSTANT_P (basey)((rtx_class[(int) (((enum rtx_code) (basey)->code))]) == RTX_CONST_OBJ
) && REG_P (basex)(((enum rtx_code) (basex)->code) == REG)
&& REGNO_PTR_FRAME_P (REGNO (basex))(((rhs_regno(basex))) == 7 || ((rhs_regno(basex))) == 19 || (
(rhs_regno(basex))) == 6 || ((rhs_regno(basex))) == 16 || (((
rhs_regno(basex))) >= (76) && ((rhs_regno(basex)))
 <= (((76)) + 4)))));

/* Offset based disambiguation not appropriate for loop invariant */
if (loop_invariant)
  return 0;

/* Offset based disambiguation is OK even if we do not know that the
   declarations are necessarily different
  (i.e. compare_base_decls (exprx, expry) == -1)  */

sizex = (!MEM_P (rtlx)(((enum rtx_code) (rtlx)->code) == MEM) ? poly_int64 (GET_MODE_SIZE (GET_MODE (rtlx)((machine_mode) (rtlx)->mode)))
  : MEM_SIZE_KNOWN_P (rtlx)(get_mem_attrs (rtlx)->size_known_p) ? MEM_SIZE (rtlx)(get_mem_attrs (rtlx)->size)
  : -1);
sizey = (!MEM_P (rtly)(((enum rtx_code) (rtly)->code) == MEM) ? poly_int64 (GET_MODE_SIZE (GET_MODE (rtly)((machine_mode) (rtly)->mode)))
  : MEM_SIZE_KNOWN_P (rtly)(get_mem_attrs (rtly)->size_known_p) ? MEM_SIZE (rtly)(get_mem_attrs (rtly)->size)
  : -1);

/* If we have an offset for either memref, it can update the values computed
   above.  */
if (moffsetx_known_p)
  offsetx += moffsetx, sizex -= moffsetx;
if (moffsety_known_p)
  offsety += moffsety, sizey -= moffsety;

/* If a memref has both a size and an offset, we can use the smaller size.
   We can't do this if the offset isn't known because we must view this
   memref as being anywhere inside the DECL's MEM.  */
if (MEM_SIZE_KNOWN_P (x)(get_mem_attrs (x)->size_known_p) && moffsetx_known_p)
  sizex = MEM_SIZE (x)(get_mem_attrs (x)->size);
if (MEM_SIZE_KNOWN_P (y)(get_mem_attrs (y)->size_known_p) && moffsety_known_p)
  sizey = MEM_SIZE (y)(get_mem_attrs (y)->size);

return !ranges_maybe_overlap_p (offsetx, sizex, offsety, sizey);
2958}

2960/* Helper for true_dependence and canon_true_dependence.
 Checks for true dependence: X is read after store in MEM takes place.

 If MEM_CANONICALIZED is FALSE, then X_ADDR and MEM_ADDR should be
 NULL_RTX, and the canonical addresses of MEM and X are both computed
 here.  If MEM_CANONICALIZED, then MEM must be already canonicalized.

 If X_ADDR is non-NULL, it is used in preference of XEXP (x, 0).

 Returns 1 if there is a true dependence, 0 otherwise.  */

2971static int
2972true_dependence_1 (const_rtx mem, machine_mode mem_mode, rtx mem_addr,
   const_rtx x, rtx x_addr, bool mem_canonicalized)
2974{
rtx true_mem_addr;
rtx base;
int ret;

gcc_checking_assert (mem_canonicalized ? (mem_addr != NULL_RTX)((void)(!(mem_canonicalized ? (mem_addr != (rtx) 0) : (mem_addr
 == (rtx) 0 && x_addr == (rtx) 0)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2980, __FUNCTION__), 0 : 0))
       : (mem_addr == NULL_RTX && x_addr == NULL_RTX))((void)(!(mem_canonicalized ? (mem_addr != (rtx) 0) : (mem_addr
 == (rtx) 0 && x_addr == (rtx) 0)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2980, __FUNCTION__), 0 : 0));

if (MEM_VOLATILE_P (x)(__extension__ ({ __typeof ((x)) const _rtx = ((x)); if (((enum
 rtx_code) (_rtx)->code) != MEM && ((enum rtx_code
) (_rtx)->code) != ASM_OPERANDS && ((enum rtx_code
) (_rtx)->code) != ASM_INPUT) rtl_check_failed_flag ("MEM_VOLATILE_P"
, _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2982, __FUNCTION__); _rtx; })->volatil) && MEM_VOLATILE_P (mem)(__extension__ ({ __typeof ((mem)) const _rtx = ((mem)); if (
((enum rtx_code) (_rtx)->code) != MEM && ((enum rtx_code
) (_rtx)->code) != ASM_OPERANDS && ((enum rtx_code
) (_rtx)->code) != ASM_INPUT) rtl_check_failed_flag ("MEM_VOLATILE_P"
, _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 2982, __FUNCTION__); _rtx; })->volatil))
  return 1;

/* (mem:BLK (scratch)) is a special mechanism to conflict with everything.
   This is used in epilogue deallocation functions, and in cselib.  */
if (GET_MODE (x)((machine_mode) (x)->mode) == BLKmode((void) 0, E_BLKmode) && GET_CODE (XEXP (x, 0))((enum rtx_code) ((((x)->u.fld[0]).rt_rtx))->code) == SCRATCH)
  return 1;
if (GET_MODE (mem)((machine_mode) (mem)->mode) == BLKmode((void) 0, E_BLKmode) && GET_CODE (XEXP (mem, 0))((enum rtx_code) ((((mem)->u.fld[0]).rt_rtx))->code) == SCRATCH)
  return 1;
if (MEM_ALIAS_SET (x)(get_mem_attrs (x)->alias) == ALIAS_SET_MEMORY_BARRIER((alias_set_type) -1)
    || MEM_ALIAS_SET (mem)(get_mem_attrs (mem)->alias) == ALIAS_SET_MEMORY_BARRIER((alias_set_type) -1))
  return 1;

if (! x_addr)
  x_addr = XEXP (x, 0)(((x)->u.fld[0]).rt_rtx);
x_addr = get_addr (x_addr);

if (! mem_addr)
  {
    mem_addr = XEXP (mem, 0)(((mem)->u.fld[0]).rt_rtx);
    if (mem_mode == VOIDmode((void) 0, E_VOIDmode))
mem_mode = GET_MODE (mem)((machine_mode) (mem)->mode);
  }
true_mem_addr = get_addr (mem_addr);

/* Read-only memory is by definition never modified, and therefore can't
   conflict with anything.  However, don't assume anything when AND
   addresses are involved and leave to the code below to determine
   dependence.  We don't expect to find read-only set on MEM, but
   stupid user tricks can produce them, so don't die.  */
if (MEM_READONLY_P (x)(__extension__ ({ __typeof ((x)) const _rtx = ((x)); if (((enum
 rtx_code) (_rtx)->code) != MEM) rtl_check_failed_flag ("MEM_READONLY_P"
, _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 3012, __FUNCTION__); _rtx; })->unchanging)
    && GET_CODE (x_addr)((enum rtx_code) (x_addr)->code) != AND
    && GET_CODE (true_mem_addr)((enum rtx_code) (true_mem_addr)->code) != AND)
  return 0;

/* If we have MEMs referring to different address spaces (which can
   potentially overlap), we cannot easily tell from the addresses
   whether the references overlap.  */
if (MEM_ADDR_SPACE (mem)(get_mem_attrs (mem)->addrspace) != MEM_ADDR_SPACE (x)(get_mem_attrs (x)->addrspace))
  return 1;

base = find_base_term (x_addr);
if (base && (GET_CODE (base)((enum rtx_code) (base)->code) == LABEL_REF
      || (GET_CODE (base)((enum rtx_code) (base)->code) == SYMBOL_REF
   && CONSTANT_POOL_ADDRESS_P (base)(__extension__ ({ __typeof ((base)) const _rtx = ((base)); if
 (((enum rtx_code) (_rtx)->code) != SYMBOL_REF) rtl_check_failed_flag
 ("CONSTANT_POOL_ADDRESS_P", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 3026, __FUNCTION__); _rtx; })->unchanging))))
  return 0;

rtx mem_base = find_base_term (true_mem_addr);
if (! base_alias_check (x_addr, base, true_mem_addr, mem_base,
	  GET_MODE (x)((machine_mode) (x)->mode), mem_mode))
  return 0;

x_addr = canon_rtx (x_addr);
if (!mem_canonicalized)
  mem_addr = canon_rtx (true_mem_addr);

if ((ret = memrefs_conflict_p (GET_MODE_SIZE (mem_mode), mem_addr,
		 SIZE_FOR_MODE (x)(GET_MODE_SIZE (((machine_mode) (x)->mode))), x_addr, 0)) != -1)
  return ret;

if (mems_in_disjoint_alias_sets_p (x, mem))
  return 0;

if (nonoverlapping_memrefs_p (mem, x, false))
  return 0;

return rtx_refs_may_alias_p (x, mem, true);
3049}

3051/* True dependence: X is read after store in MEM takes place.  */

3053int
3054true_dependence (const_rtx mem, machine_mode mem_mode, const_rtx x)
3055{
return true_dependence_1 (mem, mem_mode, NULL_RTX(rtx) 0,
	    x, NULL_RTX(rtx) 0, /*mem_canonicalized=*/false);
3058}

3060/* Canonical true dependence: X is read after store in MEM takes place.
 Variant of true_dependence which assumes MEM has already been
 canonicalized (hence we no longer do that here).
 The mem_addr argument has been added, since true_dependence_1 computed
 this value prior to canonicalizing.  */

3066int
3067canon_true_dependence (const_rtx mem, machine_mode mem_mode, rtx mem_addr,
       const_rtx x, rtx x_addr)
3069{
return true_dependence_1 (mem, mem_mode, mem_addr,
	    x, x_addr, /*mem_canonicalized=*/true);
3072}

3074/* Returns nonzero if a write to X might alias a previous read from
 (or, if WRITEP is true, a write to) MEM.
 If X_CANONCALIZED is true, then X_ADDR is the canonicalized address of X,
 and X_MODE the mode for that access.
 If MEM_CANONICALIZED is true, MEM is canonicalized.  */

3080static int
3081write_dependence_p (const_rtx mem,
    const_rtx x, machine_mode x_mode, rtx x_addr,
    bool mem_canonicalized, bool x_canonicalized, bool writep)
3084{
rtx mem_addr;
rtx true_mem_addr, true_x_addr;
rtx base;
int ret;

gcc_checking_assert (x_canonicalized((void)(!(x_canonicalized ? (x_addr != (rtx) 0 && (x_mode
 != ((void) 0, E_VOIDmode) || ((machine_mode) (x)->mode) ==
 ((void) 0, E_VOIDmode))) : (x_addr == (rtx) 0 && x_mode
 == ((void) 0, E_VOIDmode))) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 3093, __FUNCTION__), 0 : 0))
       ? (x_addr != NULL_RTX((void)(!(x_canonicalized ? (x_addr != (rtx) 0 && (x_mode
 != ((void) 0, E_VOIDmode) || ((machine_mode) (x)->mode) ==
 ((void) 0, E_VOIDmode))) : (x_addr == (rtx) 0 && x_mode
 == ((void) 0, E_VOIDmode))) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 3093, __FUNCTION__), 0 : 0))
	  && (x_mode != VOIDmode || GET_MODE (x) == VOIDmode))((void)(!(x_canonicalized ? (x_addr != (rtx) 0 && (x_mode
 != ((void) 0, E_VOIDmode) || ((machine_mode) (x)->mode) ==
 ((void) 0, E_VOIDmode))) : (x_addr == (rtx) 0 && x_mode
 == ((void) 0, E_VOIDmode))) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 3093, __FUNCTION__), 0 : 0))
       : (x_addr == NULL_RTX && x_mode == VOIDmode))((void)(!(x_canonicalized ? (x_addr != (rtx) 0 && (x_mode
 != ((void) 0, E_VOIDmode) || ((machine_mode) (x)->mode) ==
 ((void) 0, E_VOIDmode))) : (x_addr == (rtx) 0 && x_mode
 == ((void) 0, E_VOIDmode))) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 3093, __FUNCTION__), 0 : 0));

if (MEM_VOLATILE_P (x)(__extension__ ({ __typeof ((x)) const _rtx = ((x)); if (((enum
 rtx_code) (_rtx)->code) != MEM && ((enum rtx_code
) (_rtx)->code) != ASM_OPERANDS && ((enum rtx_code
) (_rtx)->code) != ASM_INPUT) rtl_check_failed_flag ("MEM_VOLATILE_P"
, _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 3095, __FUNCTION__); _rtx; })->volatil) && MEM_VOLATILE_P (mem)(__extension__ ({ __typeof ((mem)) const _rtx = ((mem)); if (
((enum rtx_code) (_rtx)->code) != MEM && ((enum rtx_code
) (_rtx)->code) != ASM_OPERANDS && ((enum rtx_code
) (_rtx)->code) != ASM_INPUT) rtl_check_failed_flag ("MEM_VOLATILE_P"
, _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 3095, __FUNCTION__); _rtx; })->volatil))
  return 1;

/* (mem:BLK (scratch)) is a special mechanism to conflict with everything.
   This is used in epilogue deallocation functions.  */
if (GET_MODE (x)((machine_mode) (x)->mode) == BLKmode((void) 0, E_BLKmode) && GET_CODE (XEXP (x, 0))((enum rtx_code) ((((x)->u.fld[0]).rt_rtx))->code) == SCRATCH)
  return 1;
if (GET_MODE (mem)((machine_mode) (mem)->mode) == BLKmode((void) 0, E_BLKmode) && GET_CODE (XEXP (mem, 0))((enum rtx_code) ((((mem)->u.fld[0]).rt_rtx))->code) == SCRATCH)
  return 1;
if (MEM_ALIAS_SET (x)(get_mem_attrs (x)->alias) == ALIAS_SET_MEMORY_BARRIER((alias_set_type) -1)
    || MEM_ALIAS_SET (mem)(get_mem_attrs (mem)->alias) == ALIAS_SET_MEMORY_BARRIER((alias_set_type) -1))
  return 1;

if (!x_addr)
  x_addr = XEXP (x, 0)(((x)->u.fld[0]).rt_rtx);
true_x_addr = get_addr (x_addr);

mem_addr = XEXP (mem, 0)(((mem)->u.fld[0]).rt_rtx);
true_mem_addr = get_addr (mem_addr);

/* A read from read-only memory can't conflict with read-write memory.
   Don't assume anything when AND addresses are involved and leave to
   the code below to determine dependence.  */
if (!writep
    && MEM_READONLY_P (mem)(__extension__ ({ __typeof ((mem)) const _rtx = ((mem)); if (
((enum rtx_code) (_rtx)->code) != MEM) rtl_check_failed_flag
 ("MEM_READONLY_P", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 3119, __FUNCTION__); _rtx; })->unchanging)
    && GET_CODE (true_x_addr)((enum rtx_code) (true_x_addr)->code) != AND
    && GET_CODE (true_mem_addr)((enum rtx_code) (true_mem_addr)->code) != AND)
  return 0;

/* If we have MEMs referring to different address spaces (which can
   potentially overlap), we cannot easily tell from the addresses
   whether the references overlap.  */
if (MEM_ADDR_SPACE (mem)(get_mem_attrs (mem)->addrspace) != MEM_ADDR_SPACE (x)(get_mem_attrs (x)->addrspace))
  return 1;

base = find_base_term (true_mem_addr);
if (! writep
    && base
    && (GET_CODE (base)((enum rtx_code) (base)->code) == LABEL_REF
 || (GET_CODE (base)((enum rtx_code) (base)->code) == SYMBOL_REF
     && CONSTANT_POOL_ADDRESS_P (base)(__extension__ ({ __typeof ((base)) const _rtx = ((base)); if
 (((enum rtx_code) (_rtx)->code) != SYMBOL_REF) rtl_check_failed_flag
 ("CONSTANT_POOL_ADDRESS_P", _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 3135, __FUNCTION__); _rtx; })->unchanging))))
  return 0;

rtx x_base = find_base_term (true_x_addr);
if (! base_alias_check (true_x_addr, x_base, true_mem_addr, base,
	  GET_MODE (x)((machine_mode) (x)->mode), GET_MODE (mem)((machine_mode) (mem)->mode)))
  return 0;

if (!x_canonicalized)
  {
    x_addr = canon_rtx (true_x_addr);
    x_mode = GET_MODE (x)((machine_mode) (x)->mode);
  }
if (!mem_canonicalized)
  mem_addr = canon_rtx (true_mem_addr);

if ((ret = memrefs_conflict_p (SIZE_FOR_MODE (mem)(GET_MODE_SIZE (((machine_mode) (mem)->mode))), mem_addr,
		 GET_MODE_SIZE (x_mode), x_addr, 0)) != -1)
  return ret;

if (nonoverlapping_memrefs_p (x, mem, false))
  return 0;

return rtx_refs_may_alias_p (x, mem, false);
3159}

3161/* Anti dependence: X is written after read in MEM takes place.  */

3163int
3164anti_dependence (const_rtx mem, const_rtx x)
3165{
return write_dependence_p (mem, x, VOIDmode((void) 0, E_VOIDmode), NULL_RTX(rtx) 0,
	     /*mem_canonicalized=*/false,
	     /*x_canonicalized*/false, /*writep=*/false);
3169}

3171/* Likewise, but we already have a canonicalized MEM, and X_ADDR for X.
 Also, consider X in X_MODE (which might be from an enclosing
 STRICT_LOW_PART / ZERO_EXTRACT).
 If MEM_CANONICALIZED is true, MEM is canonicalized.  */

3176int
3177canon_anti_dependence (const_rtx mem, bool mem_canonicalized,
       const_rtx x, machine_mode x_mode, rtx x_addr)
3179{
return write_dependence_p (mem, x, x_mode, x_addr,
	     mem_canonicalized, /*x_canonicalized=*/true,
	     /*writep=*/false);
3183}

3185/* Output dependence: X is written after store in MEM takes place.  */

3187int
3188output_dependence (const_rtx mem, const_rtx x)
3189{
return write_dependence_p (mem, x, VOIDmode((void) 0, E_VOIDmode), NULL_RTX(rtx) 0,
	     /*mem_canonicalized=*/false,
	     /*x_canonicalized*/false, /*writep=*/true);
3193}

3195/* Likewise, but we already have a canonicalized MEM, and X_ADDR for X.
 Also, consider X in X_MODE (which might be from an enclosing
 STRICT_LOW_PART / ZERO_EXTRACT).
 If MEM_CANONICALIZED is true, MEM is canonicalized.  */

3200int
3201canon_output_dependence (const_rtx mem, bool mem_canonicalized,
	 const_rtx x, machine_mode x_mode, rtx x_addr)
3203{
return write_dependence_p (mem, x, x_mode, x_addr,
	     mem_canonicalized, /*x_canonicalized=*/true,
	     /*writep=*/true);
3207}
3208


3211/* Check whether X may be aliased with MEM.  Don't do offset-based
memory disambiguation & TBAA.  */
3213int
3214may_alias_p (const_rtx mem, const_rtx x)
3215{
rtx x_addr, mem_addr;

if (MEM_VOLATILE_P (x)(__extension__ ({ __typeof ((x)) const _rtx = ((x)); if (((enum
 rtx_code) (_rtx)->code) != MEM && ((enum rtx_code
) (_rtx)->code) != ASM_OPERANDS && ((enum rtx_code
) (_rtx)->code) != ASM_INPUT) rtl_check_failed_flag ("MEM_VOLATILE_P"
, _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 3218, __FUNCTION__); _rtx; })->volatil) && MEM_VOLATILE_P (mem)(__extension__ ({ __typeof ((mem)) const _rtx = ((mem)); if (
((enum rtx_code) (_rtx)->code) != MEM && ((enum rtx_code
) (_rtx)->code) != ASM_OPERANDS && ((enum rtx_code
) (_rtx)->code) != ASM_INPUT) rtl_check_failed_flag ("MEM_VOLATILE_P"
, _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 3218, __FUNCTION__); _rtx; })->volatil))
  return 1;

/* (mem:BLK (scratch)) is a special mechanism to conflict with everything.
   This is used in epilogue deallocation functions.  */
if (GET_MODE (x)((machine_mode) (x)->mode) == BLKmode((void) 0, E_BLKmode) && GET_CODE (XEXP (x, 0))((enum rtx_code) ((((x)->u.fld[0]).rt_rtx))->code) == SCRATCH)
  return 1;
if (GET_MODE (mem)((machine_mode) (mem)->mode) == BLKmode((void) 0, E_BLKmode) && GET_CODE (XEXP (mem, 0))((enum rtx_code) ((((mem)->u.fld[0]).rt_rtx))->code) == SCRATCH)
  return 1;
if (MEM_ALIAS_SET (x)(get_mem_attrs (x)->alias) == ALIAS_SET_MEMORY_BARRIER((alias_set_type) -1)
    || MEM_ALIAS_SET (mem)(get_mem_attrs (mem)->alias) == ALIAS_SET_MEMORY_BARRIER((alias_set_type) -1))
  return 1;

x_addr = XEXP (x, 0)(((x)->u.fld[0]).rt_rtx);
x_addr = get_addr (x_addr);

mem_addr = XEXP (mem, 0)(((mem)->u.fld[0]).rt_rtx);
mem_addr = get_addr (mem_addr);

/* Read-only memory is by definition never modified, and therefore can't
   conflict with anything.  However, don't assume anything when AND
   addresses are involved and leave to the code below to determine
   dependence.  We don't expect to find read-only set on MEM, but
   stupid user tricks can produce them, so don't die.  */
if (MEM_READONLY_P (x)(__extension__ ({ __typeof ((x)) const _rtx = ((x)); if (((enum
 rtx_code) (_rtx)->code) != MEM) rtl_check_failed_flag ("MEM_READONLY_P"
, _rtx, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 3242, __FUNCTION__); _rtx; })->unchanging)
    && GET_CODE (x_addr)((enum rtx_code) (x_addr)->code) != AND
    && GET_CODE (mem_addr)((enum rtx_code) (mem_addr)->code) != AND)
  return 0;

/* If we have MEMs referring to different address spaces (which can
   potentially overlap), we cannot easily tell from the addresses
   whether the references overlap.  */
if (MEM_ADDR_SPACE (mem)(get_mem_attrs (mem)->addrspace) != MEM_ADDR_SPACE (x)(get_mem_attrs (x)->addrspace))
  return 1;

rtx x_base = find_base_term (x_addr);
rtx mem_base = find_base_term (mem_addr);
if (! base_alias_check (x_addr, x_base, mem_addr, mem_base,
	  GET_MODE (x)((machine_mode) (x)->mode), GET_MODE (mem_addr)((machine_mode) (mem_addr)->mode)))
  return 0;

if (nonoverlapping_memrefs_p (mem, x, true))
  return 0;

/* TBAA not valid for loop_invarint */
return rtx_refs_may_alias_p (x, mem, false);
3264}

3266void
3267init_alias_target (void)
3268{
int i;

if (!arg_base_value)
  arg_base_value = gen_rtx_ADDRESS (VOIDmode, 0)gen_rtx_fmt_i_stat ((ADDRESS), ((((void) 0, E_VOIDmode))), ((
0)) );

memset (static_reg_base_value(this_target_rtl->x_static_reg_base_value), 0, sizeof static_reg_base_value(this_target_rtl->x_static_reg_base_value));

for (i = 0; i < FIRST_PSEUDO_REGISTER76; i++)
  /* Check whether this register can hold an incoming pointer
     argument.  FUNCTION_ARG_REGNO_P tests outgoing register
     numbers, so translate if necessary due to register windows.  */
  if (FUNCTION_ARG_REGNO_P (OUTGOING_REGNO (i))ix86_function_arg_regno_p ((i))
&& targetm.hard_regno_mode_ok (i, Pmode(global_options.x_ix86_pmode == PMODE_DI ? (scalar_int_mode (
(scalar_int_mode::from_int) E_DImode)) : (scalar_int_mode ((scalar_int_mode
::from_int) E_SImode)))))
    static_reg_base_value(this_target_rtl->x_static_reg_base_value)[i] = arg_base_value;

/* RTL code is required to be consistent about whether it uses the
   stack pointer, the frame pointer or the argument pointer to
   access a given area of the frame.  We can therefore use the
   base address to distinguish between the different areas.  */
static_reg_base_value(this_target_rtl->x_static_reg_base_value)[STACK_POINTER_REGNUM7]
  = unique_base_value (UNIQUE_BASE_VALUE_SP-1);
static_reg_base_value(this_target_rtl->x_static_reg_base_value)[ARG_POINTER_REGNUM16]
  = unique_base_value (UNIQUE_BASE_VALUE_ARGP-2);
static_reg_base_value(this_target_rtl->x_static_reg_base_value)[FRAME_POINTER_REGNUM19]
  = unique_base_value (UNIQUE_BASE_VALUE_FP-3);

/* The above rules extend post-reload, with eliminations applying
   consistently to each of the three pointers.  Cope with cases in
   which the frame pointer is eliminated to the hard frame pointer
   rather than the stack pointer.  */
if (!HARD_FRAME_POINTER_IS_FRAME_POINTER(6 == 19))
  static_reg_base_value(this_target_rtl->x_static_reg_base_value)[HARD_FRAME_POINTER_REGNUM6]
    = unique_base_value (UNIQUE_BASE_VALUE_HFP-4);
3302}

3304/* Set MEMORY_MODIFIED when X modifies DATA (that is assumed
 to be memory reference.  */
3306static bool memory_modified;
3307static void
3308memory_modified_1 (rtx x, const_rtx pat ATTRIBUTE_UNUSED__attribute__ ((__unused__)), void *data)
3309{
if (MEM_P (x)(((enum rtx_code) (x)->code) == MEM))
  {
    if (anti_dependence (x, (const_rtx)data) || output_dependence (x, (const_rtx)data))
memory_modified = true;
  }
3315}


3318/* Return true when INSN possibly modify memory contents of MEM
 (i.e. address can be modified).  */
3320bool
3321memory_modified_in_insn_p (const_rtx mem, const_rtx insn)
3322{
if (!INSN_P (insn)(((((enum rtx_code) (insn)->code) == INSN) || (((enum rtx_code
) (insn)->code) == JUMP_INSN) || (((enum rtx_code) (insn)->
code) == CALL_INSN)) || (((enum rtx_code) (insn)->code) ==
 DEBUG_INSN)))
  return false;
/* Conservatively assume all non-readonly MEMs might be modified in
   calls.  */
if (CALL_P (insn)(((enum rtx_code) (insn)->code) == CALL_INSN))
  return true;
memory_modified = false;
note_stores (as_a<const rtx_insn *> (insn), memory_modified_1,
      CONST_CAST_RTX(mem)(const_cast<struct rtx_def *> (((mem)))));
return memory_modified;
3333}

3335/* Initialize the aliasing machinery.  Initialize the REG_KNOWN_VALUE
 array.  */

3338void
3339init_alias_analysis (void)
3340{
unsigned int maxreg = max_reg_num ();
int changed, pass;
int i;
unsigned int ui;
rtx_insn *insn;
rtx val;
int rpo_cnt;
int *rpo;

timevar_push (TV_ALIAS_ANALYSIS);

vec_safe_grow_cleared (reg_known_value, maxreg - FIRST_PSEUDO_REGISTER76,
	 true);
reg_known_equiv_p = sbitmap_alloc (maxreg - FIRST_PSEUDO_REGISTER76);
bitmap_clear (reg_known_equiv_p);

/* If we have memory allocated from the previous run, use it.  */
if (old_reg_base_value)
  reg_base_value = old_reg_base_value;

if (reg_base_value)
  reg_base_value->truncate (0);

vec_safe_grow_cleared (reg_base_value, maxreg, true);

new_reg_base_value = XNEWVEC (rtx, maxreg)((rtx *) xmalloc (sizeof (rtx) * (maxreg)));
reg_seen = sbitmap_alloc (maxreg);

/* The basic idea is that each pass through this loop will use the
   "constant" information from the previous pass to propagate alias
   information through another level of assignments.

   The propagation is done on the CFG in reverse post-order, to propagate
   things forward as far as possible in each iteration.

   This could get expensive if the assignment chains are long.  Maybe
   we should throttle the number of iterations, possibly based on
   the optimization level or flag_expensive_optimizations.

   We could propagate more information in the first pass by making use
   of DF_REG_DEF_COUNT to determine immediately that the alias information
   for a pseudo is "constant".

   A program with an uninitialized variable can cause an infinite loop
   here.  Instead of doing a full dataflow analysis to detect such problems
   we just cap the number of iterations for the loop.

   The state of the arrays for the set chain in question does not matter
   since the program has undefined behavior.  */

rpo = XNEWVEC (int, n_basic_blocks_for_fn (cfun))((int *) xmalloc (sizeof (int) * ((((cfun + 0))->cfg->x_n_basic_blocks
))));
rpo_cnt = pre_and_rev_post_order_compute (NULLnullptr, rpo, false);

/* The prologue/epilogue insns are not threaded onto the
   insn chain until after reload has completed.  Thus,
   there is no sense wasting time checking if INSN is in
   the prologue/epilogue until after reload has completed.  */
bool could_be_prologue_epilogue = ((targetm.have_prologue ()
		      || targetm.have_epilogue ())
		     && reload_completed);

pass = 0;
do
  {
    /* Assume nothing will change this iteration of the loop.  */
    changed = 0;

    /* We want to assign the same IDs each iteration of this loop, so
start counting from one each iteration of the loop.  */
    unique_id = 1;

    /* We're at the start of the function each iteration through the
loop, so we're copying arguments.  */
    copying_arguments = true;

    /* Wipe the potential alias information clean for this pass.  */
    memset (new_reg_base_value, 0, maxreg * sizeof (rtx));

    /* Wipe the reg_seen array clean.  */
    bitmap_clear (reg_seen);

    /* Initialize the alias information for this pass.  */
    for (i = 0; i < FIRST_PSEUDO_REGISTER76; i++)
if (static_reg_base_value(this_target_rtl->x_static_reg_base_value)[i]
   /* Don't treat the hard frame pointer as special if we
      eliminated the frame pointer to the stack pointer instead.  */
   && !(i == HARD_FRAME_POINTER_REGNUM6
 && reload_completed
 && !frame_pointer_needed((&x_rtl)->frame_pointer_needed)
 && targetm.can_eliminate (FRAME_POINTER_REGNUM19,
			   STACK_POINTER_REGNUM7)))
 {
   new_reg_base_value[i] = static_reg_base_value(this_target_rtl->x_static_reg_base_value)[i];
   bitmap_set_bit (reg_seen, i);
 }

    /* Walk the insns adding values to the new_reg_base_value array.  */
    for (i = 0; i < rpo_cnt; i++)
{
 basic_block bb = BASIC_BLOCK_FOR_FN (cfun, rpo[i])((*(((cfun + 0))->cfg->x_basic_block_info))[(rpo[i])]);
 FOR_BB_INSNS (bb, insn)for ((insn) = (bb)->il.x.head_; (insn) && (insn) !=
 NEXT_INSN ((bb)->il.x.rtl->end_); (insn) = NEXT_INSN (
insn))
   {
     if (NONDEBUG_INSN_P (insn)((((enum rtx_code) (insn)->code) == INSN) || (((enum rtx_code
) (insn)->code) == JUMP_INSN) || (((enum rtx_code) (insn)->
code) == CALL_INSN)))
{
  rtx note, set;

  if (could_be_prologue_epilogue
      && prologue_epilogue_contains (insn))
    continue;

  /* If this insn has a noalias note, process it,  Otherwise,
     scan for sets.  A simple set will have no side effects
     which could change the base value of any other register.  */

  if (GET_CODE (PATTERN (insn))((enum rtx_code) (PATTERN (insn))->code) == SET
      && REG_NOTES (insn)(((insn)->u.fld[6]).rt_rtx) != 0
      && find_reg_note (insn, REG_NOALIAS, NULL_RTX(rtx) 0))
    record_set (SET_DEST (PATTERN (insn))(((PATTERN (insn))->u.fld[0]).rt_rtx), NULL_RTX(rtx) 0, NULLnullptr);
  else
    note_stores (insn, record_set, NULLnullptr);

  set = single_set (insn);

  if (set != 0
      && REG_P (SET_DEST (set))(((enum rtx_code) ((((set)->u.fld[0]).rt_rtx))->code) ==
 REG)
      && REGNO (SET_DEST (set))(rhs_regno((((set)->u.fld[0]).rt_rtx))) >= FIRST_PSEUDO_REGISTER76)
    {
      unsigned int regno = REGNO (SET_DEST (set))(rhs_regno((((set)->u.fld[0]).rt_rtx)));
      rtx src = SET_SRC (set)(((set)->u.fld[1]).rt_rtx);
      rtx t;

      note = find_reg_equal_equiv_note (insn);
      if (note && REG_NOTE_KIND (note)((enum reg_note) ((machine_mode) (note)->mode)) == REG_EQUAL
	  && DF_REG_DEF_COUNT (regno)(df->def_regs[(regno)]->n_refs) != 1)
	note = NULL_RTX(rtx) 0;

      poly_int64 offset;
      if (note != NULL_RTX(rtx) 0
	  && GET_CODE (XEXP (note, 0))((enum rtx_code) ((((note)->u.fld[0]).rt_rtx))->code) != EXPR_LIST
	  && ! rtx_varies_p (XEXP (note, 0)(((note)->u.fld[0]).rt_rtx), 1)
	  && ! reg_overlap_mentioned_p (SET_DEST (set)(((set)->u.fld[0]).rt_rtx),
					XEXP (note, 0)(((note)->u.fld[0]).rt_rtx)))
	{
	  set_reg_known_value (regno, XEXP (note, 0)(((note)->u.fld[0]).rt_rtx));
	  set_reg_known_equiv_p (regno,
				 REG_NOTE_KIND (note)((enum reg_note) ((machine_mode) (note)->mode)) == REG_EQUIV);
	}
      else if (DF_REG_DEF_COUNT (regno)(df->def_regs[(regno)]->n_refs) == 1
	       && GET_CODE (src)((enum rtx_code) (src)->code) == PLUS
	       && REG_P (XEXP (src, 0))(((enum rtx_code) ((((src)->u.fld[0]).rt_rtx))->code) ==
 REG)
	       && (t = get_reg_known_value (REGNO (XEXP (src, 0))(rhs_regno((((src)->u.fld[0]).rt_rtx)))))
	       && poly_int_rtx_p (XEXP (src, 1)(((src)->u.fld[1]).rt_rtx), &offset))
	{
	  t = plus_constant (GET_MODE (src)((machine_mode) (src)->mode), t, offset);
	  set_reg_known_value (regno, t);
	  set_reg_known_equiv_p (regno, false);
	}
      else if (DF_REG_DEF_COUNT (regno)(df->def_regs[(regno)]->n_refs) == 1
	       && ! rtx_varies_p (src, 1))
	{
	  set_reg_known_value (regno, src);
	  set_reg_known_equiv_p (regno, false);
	}
    }
}
     else if (NOTE_P (insn)(((enum rtx_code) (insn)->code) == NOTE)
       && NOTE_KIND (insn)(((insn)->u.fld[4]).rt_int) == NOTE_INSN_FUNCTION_BEG)
copying_arguments = false;
   }
}

    /* Now propagate values from new_reg_base_value to reg_base_value.  */
    gcc_assert (maxreg == (unsigned int) max_reg_num ())((void)(!(maxreg == (unsigned int) max_reg_num ()) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/alias.c"
, 3513, __FUNCTION__), 0 : 0));

    for (ui = 0; ui < maxreg; ui++)
{
 if (new_reg_base_value[ui]
     && new_reg_base_value[ui] != (*reg_base_value)[ui]
     && ! rtx_equal_p (new_reg_base_value[ui], (*reg_base_value)[ui]))
   {
     (*reg_base_value)[ui] = new_reg_base_value[ui];
     changed = 1;
   }
}
  }
while (changed && ++pass < MAX_ALIAS_LOOP_PASSES10);
XDELETEVEC (rpo)free ((void*) (rpo));

/* Fill in the remaining entries.  */
FOR_EACH_VEC_ELT (*reg_known_value, i, val)for (i = 0; (*reg_known_value).iterate ((i), &(val)); ++(
i))
  {
    int regno = i + FIRST_PSEUDO_REGISTER76;
    if (! val)
set_reg_known_value (regno, regno_reg_rtx[regno]);
  }

/* Clean up.  */
free (new_reg_base_value);
new_reg_base_value = 0;
sbitmap_free (reg_seen);
reg_seen = 0;
timevar_pop (TV_ALIAS_ANALYSIS);
3543}

3545/* Equate REG_BASE_VALUE (reg1) to REG_BASE_VALUE (reg2).
 Special API for var-tracking pass purposes.  */

3548void
3549vt_equate_reg_base_value (const_rtx reg1, const_rtx reg2)
3550{
(*reg_base_value)[REGNO (reg1)(rhs_regno(reg1))] = REG_BASE_VALUE (reg2)((rhs_regno(reg2)) < vec_safe_length (reg_base_value) ? (*
reg_base_value)[(rhs_regno(reg2))] : 0);
3552}

3554void
3555end_alias_analysis (void)
3556{
old_reg_base_value = reg_base_value;
vec_free (reg_known_value);
sbitmap_free (reg_known_equiv_p);
3560}

3562void
3563dump_alias_stats_in_alias_c (FILE *s)
3564{
fprintf (s, "  TBAA oracle: %llu disambiguations %llu queries\n"
     "               %llu are in alias set 0\n"
     "               %llu queries asked about the same object\n"
     "               %llu queries asked about the same alias set\n"
     "               %llu access volatile\n"
     "               %llu are dependent in the DAG\n"
     "               %llu are aritificially in conflict with void *\n",
  alias_stats.num_disambiguated,
  alias_stats.num_alias_zero + alias_stats.num_same_alias_set
  + alias_stats.num_same_objects + alias_stats.num_volatile
  + alias_stats.num_dag + alias_stats.num_disambiguated
  + alias_stats.num_universal,
  alias_stats.num_alias_zero, alias_stats.num_same_alias_set,
  alias_stats.num_same_objects, alias_stats.num_volatile,
  alias_stats.num_dag, alias_stats.num_universal);
3580}
3581#include "gt-alias.h"

←

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

1/* Vector API for GNU compiler.
2   Copyright (C) 2004-2021 Free Software Foundation, Inc.
3   Contributed by Nathan Sidwell <nathan@codesourcery.com>
4   Re-implemented in C++ by Diego Novillo <dnovillo@google.com>
5 
6This file is part of GCC.
7 
8GCC is free software; you can redistribute it and/or modify it under
9the terms of the GNU General Public License as published by the Free
10Software Foundation; either version 3, or (at your option) any later
11version.
12 
13GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14WARRANTY; without even the implied warranty of MERCHANTABILITY or
15FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
16for more details.
17 
18You should have received a copy of the GNU General Public License
19along with GCC; see the file COPYING3.  If not see
20<http://www.gnu.org/licenses/>.  */
21 
22#ifndef GCC_VEC_H
23#define GCC_VEC_H
24 
25/* Some gen* file have no ggc support as the header file gtype-desc.h is
26   missing.  Provide these definitions in case ggc.h has not been included.
27   This is not a problem because any code that runs before gengtype is built
28   will never need to use GC vectors.*/
29 
30extern void ggc_free (void *);
31extern size_t ggc_round_alloc_size (size_t requested_size);
32extern void *ggc_realloc (void *, size_t MEM_STAT_DECL);
33 
34/* Templated vector type and associated interfaces.
35 
36   The interface functions are typesafe and use inline functions,
37   sometimes backed by out-of-line generic functions.  The vectors are
38   designed to interoperate with the GTY machinery.
39 
40   There are both 'index' and 'iterate' accessors.  The index accessor
41   is implemented by operator[].  The iterator returns a boolean
42   iteration condition and updates the iteration variable passed by
43   reference.  Because the iterator will be inlined, the address-of
44   can be optimized away.
45 
46   Each operation that increases the number of active elements is
47   available in 'quick' and 'safe' variants.  The former presumes that
48   there is sufficient allocated space for the operation to succeed
49   (it dies if there is not).  The latter will reallocate the
50   vector, if needed.  Reallocation causes an exponential increase in
51   vector size.  If you know you will be adding N elements, it would
52   be more efficient to use the reserve operation before adding the
53   elements with the 'quick' operation.  This will ensure there are at
54   least as many elements as you ask for, it will exponentially
55   increase if there are too few spare slots.  If you want reserve a
56   specific number of slots, but do not want the exponential increase
57   (for instance, you know this is the last allocation), use the
58   reserve_exact operation.  You can also create a vector of a
59   specific size from the get go.
60 
61   You should prefer the push and pop operations, as they append and
62   remove from the end of the vector. If you need to remove several
63   items in one go, use the truncate operation.  The insert and remove
64   operations allow you to change elements in the middle of the
65   vector.  There are two remove operations, one which preserves the
66   element ordering 'ordered_remove', and one which does not
67   'unordered_remove'.  The latter function copies the end element
68   into the removed slot, rather than invoke a memmove operation.  The
69   'lower_bound' function will determine where to place an item in the
70   array using insert that will maintain sorted order.
71 
72   Vectors are template types with three arguments: the type of the
73   elements in the vector, the allocation strategy, and the physical
74   layout to use
75 
76   Four allocation strategies are supported:
77 
78	- Heap: allocation is done using malloc/free.  This is the
79	  default allocation strategy.
80 
81  	- GC: allocation is done using ggc_alloc/ggc_free.
82 
83  	- GC atomic: same as GC with the exception that the elements
84	  themselves are assumed to be of an atomic type that does
85	  not need to be garbage collected.  This means that marking
86	  routines do not need to traverse the array marking the
87	  individual elements.  This increases the performance of
88	  GC activities.
89 
90   Two physical layouts are supported:
91 
92	- Embedded: The vector is structured using the trailing array
93	  idiom.  The last member of the structure is an array of size
94	  1.  When the vector is initially allocated, a single memory
95	  block is created to hold the vector's control data and the
96	  array of elements.  These vectors cannot grow without
97	  reallocation (see discussion on embeddable vectors below).
98 
99	- Space efficient: The vector is structured as a pointer to an
100	  embedded vector.  This is the default layout.  It means that
101	  vectors occupy a single word of storage before initial
102	  allocation.  Vectors are allowed to grow (the internal
103	  pointer is reallocated but the main vector instance does not
104	  need to relocate).
105 
106   The type, allocation and layout are specified when the vector is
107   declared.
108 
109   If you need to directly manipulate a vector, then the 'address'
110   accessor will return the address of the start of the vector.  Also
111   the 'space' predicate will tell you whether there is spare capacity
112   in the vector.  You will not normally need to use these two functions.
113 
114   Notes on the different layout strategies
115 
116   * Embeddable vectors (vec<T, A, vl_embed>)
117   
118     These vectors are suitable to be embedded in other data
119     structures so that they can be pre-allocated in a contiguous
120     memory block.
121 
122     Embeddable vectors are implemented using the trailing array
123     idiom, thus they are not resizeable without changing the address
124     of the vector object itself.  This means you cannot have
125     variables or fields of embeddable vector type -- always use a
126     pointer to a vector.  The one exception is the final field of a
127     structure, which could be a vector type.
128 
129     You will have to use the embedded_size & embedded_init calls to
130     create such objects, and they will not be resizeable (so the
131     'safe' allocation variants are not available).
132 
133     Properties of embeddable vectors:
134 
135	  - The whole vector and control data are allocated in a single
136	    contiguous block.  It uses the trailing-vector idiom, so
137	    allocation must reserve enough space for all the elements
138	    in the vector plus its control data.
139	  - The vector cannot be re-allocated.
140	  - The vector cannot grow nor shrink.
141	  - No indirections needed for access/manipulation.
142	  - It requires 2 words of storage (prior to vector allocation).
143 
144 
145   * Space efficient vector (vec<T, A, vl_ptr>)
146 
147     These vectors can grow dynamically and are allocated together
148     with their control data.  They are suited to be included in data
149     structures.  Prior to initial allocation, they only take a single
150     word of storage.
151 
152     These vectors are implemented as a pointer to embeddable vectors.
153     The semantics allow for this pointer to be NULL to represent
154     empty vectors.  This way, empty vectors occupy minimal space in
155     the structure containing them.
156 
157     Properties:
158 
159	- The whole vector and control data are allocated in a single
160	  contiguous block.
161  	- The whole vector may be re-allocated.
162  	- Vector data may grow and shrink.
163  	- Access and manipulation requires a pointer test and
164	  indirection.
165  	- It requires 1 word of storage (prior to vector allocation).
166 
167   An example of their use would be,
168 
169   struct my_struct {
170     // A space-efficient vector of tree pointers in GC memory.
171     vec<tree, va_gc, vl_ptr> v;
172   };
173 
174   struct my_struct *s;
175 
176   if (s->v.length ()) { we have some contents }
177   s->v.safe_push (decl); // append some decl onto the end
178   for (ix = 0; s->v.iterate (ix, &elt); ix++)
179     { do something with elt }
180*/
181 
182/* Support function for statistics.  */
183extern void dump_vec_loc_statistics (void);
184 
185/* Hashtable mapping vec addresses to descriptors.  */
186extern htab_t vec_mem_usage_hash;
187 
188/* Control data for vectors.  This contains the number of allocated
189   and used slots inside a vector.  */
190 
191struct vec_prefix
192{
193  /* FIXME - These fields should be private, but we need to cater to
194	     compilers that have stricter notions of PODness for types.  */
195 
196  /* Memory allocation support routines in vec.c.  */
197  void register_overhead (void *, size_t, size_t CXX_MEM_STAT_INFO);
198  void release_overhead (void *, size_t, size_t, bool CXX_MEM_STAT_INFO);
199  static unsigned calculate_allocation (vec_prefix *, unsigned, bool);
200  static unsigned calculate_allocation_1 (unsigned, unsigned);
201 
202  /* Note that vec_prefix should be a base class for vec, but we use
203     offsetof() on vector fields of tree structures (e.g.,
204     tree_binfo::base_binfos), and offsetof only supports base types.
205 
206     To compensate, we make vec_prefix a field inside vec and make
207     vec a friend class of vec_prefix so it can access its fields.  */
208  template <typename, typename, typename> friend struct vec;
209 
210  /* The allocator types also need access to our internals.  */
211  friend struct va_gc;
212  friend struct va_gc_atomic;
213  friend struct va_heap;
214 
215  unsigned m_alloc : 31;
216  unsigned m_using_auto_storage : 1;
217  unsigned m_num;
218};
219 
220/* Calculate the number of slots to reserve a vector, making sure that
221   RESERVE slots are free.  If EXACT grow exactly, otherwise grow
222   exponentially.  PFX is the control data for the vector.  */
223 
224inline unsigned
225vec_prefix::calculate_allocation (vec_prefix *pfx, unsigned reserve,
226				  bool exact)
227{
228  if (exact20.1
'exact' is false
20.1
'exact' is false
)
21
←
Taking false branch→
229    return (pfx ? pfx->m_num : 0) + reserve;
230  else if (!pfx21.1
'pfx' is non-null, which participates in a condition later
21.1
'pfx' is non-null, which participates in a condition later
)
22
←
Taking false branch→
231    return MAX (4, reserve)((4) > (reserve) ? (4) : (reserve));
232  return calculate_allocation_1 (pfx->m_alloc, pfx->m_num + reserve);
23
←
Returning value, which participates in a condition later→
233}
234 
235template<typename, typename, typename> struct vec;
236 
237/* Valid vector layouts
238 
239   vl_embed	- Embeddable vector that uses the trailing array idiom.
240   vl_ptr	- Space efficient vector that uses a pointer to an
241		  embeddable vector.  */
242struct vl_embed { };
243struct vl_ptr { };
244 
245 
246/* Types of supported allocations
247 
248   va_heap	- Allocation uses malloc/free.
249   va_gc	- Allocation uses ggc_alloc.
250   va_gc_atomic	- Same as GC, but individual elements of the array
251		  do not need to be marked during collection.  */
252 
253/* Allocator type for heap vectors.  */
254struct va_heap
255{
256  /* Heap vectors are frequently regular instances, so use the vl_ptr
257     layout for them.  */
258  typedef vl_ptr default_layout;
259 
260  template<typename T>
261  static void reserve (vec<T, va_heap, vl_embed> *&, unsigned, bool
262		       CXX_MEM_STAT_INFO);
263 
264  template<typename T>
265  static void release (vec<T, va_heap, vl_embed> *&);
266};
267 
268 
269/* Allocator for heap memory.  Ensure there are at least RESERVE free
270   slots in V.  If EXACT is true, grow exactly, else grow
271   exponentially.  As a special case, if the vector had not been
272   allocated and RESERVE is 0, no vector will be created.  */
273 
274template<typename T>
275inline void
276va_heap::reserve (vec<T, va_heap, vl_embed> *&v, unsigned reserve, bool exact
277		  MEM_STAT_DECL)
278{
279  size_t elt_size = sizeof (T);
280  unsigned alloc
281    = vec_prefix::calculate_allocation (v ? &v->m_vecpfx : 0, reserve, exact);
282  gcc_checking_assert (alloc)((void)(!(alloc) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 282, __FUNCTION__), 0 : 0));
283 
284  if (GATHER_STATISTICS0 && v)
285    v->m_vecpfx.release_overhead (v, elt_size * v->allocated (),
286				  v->allocated (), false);
287 
288  size_t size = vec<T, va_heap, vl_embed>::embedded_size (alloc);
289  unsigned nelem = v ? v->length () : 0;
290  v = static_cast <vec<T, va_heap, vl_embed> *> (xrealloc (v, size));
291  v->embedded_init (alloc, nelem);
292 
293  if (GATHER_STATISTICS0)
294    v->m_vecpfx.register_overhead (v, alloc, elt_size PASS_MEM_STAT);
295}
296 
297 
298#if GCC_VERSION(4 * 1000 + 2) >= 4007
299#pragma GCC diagnostic push
300#pragma GCC diagnostic ignored "-Wfree-nonheap-object"
301#endif
302 
303/* Free the heap space allocated for vector V.  */
304 
305template<typename T>
306void
307va_heap::release (vec<T, va_heap, vl_embed> *&v)
308{
309  size_t elt_size = sizeof (T);
310  if (v == NULLnullptr)
311    return;
312 
313  if (GATHER_STATISTICS0)
314    v->m_vecpfx.release_overhead (v, elt_size * v->allocated (),
315				  v->allocated (), true);
316  ::free (v);
317  v = NULLnullptr;
318}
319 
320#if GCC_VERSION(4 * 1000 + 2) >= 4007
321#pragma GCC diagnostic pop
322#endif
323 
324/* Allocator type for GC vectors.  Notice that we need the structure
325   declaration even if GC is not enabled.  */
326 
327struct va_gc
328{
329  /* Use vl_embed as the default layout for GC vectors.  Due to GTY
330     limitations, GC vectors must always be pointers, so it is more
331     efficient to use a pointer to the vl_embed layout, rather than
332     using a pointer to a pointer as would be the case with vl_ptr.  */
333  typedef vl_embed default_layout;
334 
335  template<typename T, typename A>
336  static void reserve (vec<T, A, vl_embed> *&, unsigned, bool
337		       CXX_MEM_STAT_INFO);
338 
339  template<typename T, typename A>
340  static void release (vec<T, A, vl_embed> *&v);
341};
342 
343 
344/* Free GC memory used by V and reset V to NULL.  */
345 
346template<typename T, typename A>
347inline void
348va_gc::release (vec<T, A, vl_embed> *&v)
349{
350  if (v)
351    ::ggc_free (v);
352  v = NULLnullptr;
353}
354 
355 
356/* Allocator for GC memory.  Ensure there are at least RESERVE free
357   slots in V.  If EXACT is true, grow exactly, else grow
358   exponentially.  As a special case, if the vector had not been
359   allocated and RESERVE is 0, no vector will be created.  */
360 
361template<typename T, typename A>
362void
363va_gc::reserve (vec<T, A, vl_embed> *&v, unsigned reserve, bool exact
364		MEM_STAT_DECL)
365{
366  unsigned alloc
367    = vec_prefix::calculate_allocation (v ? &v->m_vecpfx : 0, reserve, exact);
18
←
Assuming 'v' is non-null→
19
←
'?' condition is true→
20
←
Calling 'vec_prefix::calculate_allocation'→
24
←
Returning from 'vec_prefix::calculate_allocation'→
368  if (!alloc)
25
←
Assuming 'alloc' is 0, which participates in a condition later→
26
←
Taking true branch→
369    {
370      ::ggc_free (v);
371      v = NULLnullptr;
27
←
Null pointer value stored to 'alias_sets'→
372      return;
373    }
374 
375  /* Calculate the amount of space we want.  */
376  size_t size = vec<T, A, vl_embed>::embedded_size (alloc);
377 
378  /* Ask the allocator how much space it will really give us.  */
379  size = ::ggc_round_alloc_size (size);
380 
381  /* Adjust the number of slots accordingly.  */
382  size_t vec_offset = sizeof (vec_prefix);
383  size_t elt_size = sizeof (T);
384  alloc = (size - vec_offset) / elt_size;
385 
386  /* And finally, recalculate the amount of space we ask for.  */
387  size = vec_offset + alloc * elt_size;
388 
389  unsigned nelem = v ? v->length () : 0;
390  v = static_cast <vec<T, A, vl_embed> *> (::ggc_realloc (v, size
391							       PASS_MEM_STAT));
392  v->embedded_init (alloc, nelem);
393}
394 
395 
396/* Allocator type for GC vectors.  This is for vectors of types
397   atomics w.r.t. collection, so allocation and deallocation is
398   completely inherited from va_gc.  */
399struct va_gc_atomic : va_gc
400{
401};
402 
403 
404/* Generic vector template.  Default values for A and L indicate the
405   most commonly used strategies.
406 
407   FIXME - Ideally, they would all be vl_ptr to encourage using regular
408           instances for vectors, but the existing GTY machinery is limited
409	   in that it can only deal with GC objects that are pointers
410	   themselves.
411 
412	   This means that vector operations that need to deal with
413	   potentially NULL pointers, must be provided as free
414	   functions (see the vec_safe_* functions above).  */
415template<typename T,
416         typename A = va_heap,
417         typename L = typename A::default_layout>
418struct GTY((user)) vec
419{
420};
421 
422/* Allow C++11 range-based 'for' to work directly on vec<T>*.  */
423template<typename T, typename A, typename L>
424T* begin (vec<T,A,L> *v) { return v ? v->begin () : nullptr; }
425template<typename T, typename A, typename L>
426T* end (vec<T,A,L> *v) { return v ? v->end () : nullptr; }
427template<typename T, typename A, typename L>
428const T* begin (const vec<T,A,L> *v) { return v ? v->begin () : nullptr; }
429template<typename T, typename A, typename L>
430const T* end (const vec<T,A,L> *v) { return v ? v->end () : nullptr; }
431 
432/* Generic vec<> debug helpers.
433 
434   These need to be instantiated for each vec<TYPE> used throughout
435   the compiler like this:
436 
437    DEFINE_DEBUG_VEC (TYPE)
438 
439   The reason we have a debug_helper() is because GDB can't
440   disambiguate a plain call to debug(some_vec), and it must be called
441   like debug<TYPE>(some_vec).  */
442 
443template<typename T>
444void
445debug_helper (vec<T> &ref)
446{
447  unsigned i;
448  for (i = 0; i < ref.length (); ++i)
449    {
450      fprintf (stderrstderr, "[%d] = ", i);
451      debug_slim (ref[i]);
452      fputc ('\n', stderrstderr);
453    }
454}
455 
456/* We need a separate va_gc variant here because default template
457   argument for functions cannot be used in c++-98.  Once this
458   restriction is removed, those variant should be folded with the
459   above debug_helper.  */
460 
461template<typename T>
462void
463debug_helper (vec<T, va_gc> &ref)
464{
465  unsigned i;
466  for (i = 0; i < ref.length (); ++i)
467    {
468      fprintf (stderrstderr, "[%d] = ", i);
469      debug_slim (ref[i]);
470      fputc ('\n', stderrstderr);
471    }
472}
473 
474/* Macro to define debug(vec<T>) and debug(vec<T, va_gc>) helper
475   functions for a type T.  */
476 
477#define DEFINE_DEBUG_VEC(T)template void debug_helper (vec<T> &); template void
 debug_helper (vec<T, va_gc> &); __attribute__ ((__used__
)) void debug (vec<T> &ref) { debug_helper <T>
 (ref); } __attribute__ ((__used__)) void debug (vec<T>
 *ptr) { if (ptr) debug (*ptr); else fprintf (stderr, "<nil>\n"
); } __attribute__ ((__used__)) void debug (vec<T, va_gc>
 &ref) { debug_helper <T> (ref); } __attribute__ ((
__used__)) void debug (vec<T, va_gc> *ptr) { if (ptr) debug
 (*ptr); else fprintf (stderr, "<nil>\n"); } \
478  template void debug_helper (vec<T> &);		\
479  template void debug_helper (vec<T, va_gc> &);		\
480  /* Define the vec<T> debug functions.  */		\
481  DEBUG_FUNCTION__attribute__ ((__used__)) void					\
482  debug (vec<T> &ref)					\
483  {							\
484    debug_helper <T> (ref);				\
485  }							\
486  DEBUG_FUNCTION__attribute__ ((__used__)) void					\
487  debug (vec<T> *ptr)					\
488  {							\
489    if (ptr)						\
490      debug (*ptr);					\
491    else						\
492      fprintf (stderrstderr, "<nil>\n");			\
493  }							\
494  /* Define the vec<T, va_gc> debug functions.  */	\
495  DEBUG_FUNCTION__attribute__ ((__used__)) void					\
496  debug (vec<T, va_gc> &ref)				\
497  {							\
498    debug_helper <T> (ref);				\
499  }							\
500  DEBUG_FUNCTION__attribute__ ((__used__)) void					\
501  debug (vec<T, va_gc> *ptr)				\
502  {							\
503    if (ptr)						\
504      debug (*ptr);					\
505    else						\
506      fprintf (stderrstderr, "<nil>\n");			\
507  }
508 
509/* Default-construct N elements in DST.  */
510 
511template <typename T>
512inline void
513vec_default_construct (T *dst, unsigned n)
514{
515#ifdef BROKEN_VALUE_INITIALIZATION
516  /* Versions of GCC before 4.4 sometimes leave certain objects
517     uninitialized when value initialized, though if the type has
518     user defined default ctor, that ctor is invoked.  As a workaround
519     perform clearing first and then the value initialization, which
520     fixes the case when value initialization doesn't initialize due to
521     the bugs and should initialize to all zeros, but still allows
522     vectors for types with user defined default ctor that initializes
523     some or all elements to non-zero.  If T has no user defined
524     default ctor and some non-static data members have user defined
525     default ctors that initialize to non-zero the workaround will
526     still not work properly; in that case we just need to provide
527     user defined default ctor.  */
528  memset (dst, '\0', sizeof (T) * n);
529#endif
530  for ( ; n; ++dst, --n)
531    ::new (static_cast<void*>(dst)) T ();
532}
533 
534/* Copy-construct N elements in DST from *SRC.  */
535 
536template <typename T>
537inline void
538vec_copy_construct (T *dst, const T *src, unsigned n)
539{
540  for ( ; n; ++dst, ++src, --n)
541    ::new (static_cast<void*>(dst)) T (*src);
542}
543 
544/* Type to provide NULL values for vec<T, A, L>.  This is used to
545   provide nil initializers for vec instances.  Since vec must be
546   a POD, we cannot have proper ctor/dtor for it.  To initialize
547   a vec instance, you can assign it the value vNULL.  This isn't
548   needed for file-scope and function-local static vectors, which
549   are zero-initialized by default.  */
550struct vnull
551{
552  template <typename T, typename A, typename L>
553  CONSTEXPRconstexpr operator vec<T, A, L> () const { return vec<T, A, L>(); }
554};
555extern vnull vNULL;
556 
557 
558/* Embeddable vector.  These vectors are suitable to be embedded
559   in other data structures so that they can be pre-allocated in a
560   contiguous memory block.
561 
562   Embeddable vectors are implemented using the trailing array idiom,
563   thus they are not resizeable without changing the address of the
564   vector object itself.  This means you cannot have variables or
565   fields of embeddable vector type -- always use a pointer to a
566   vector.  The one exception is the final field of a structure, which
567   could be a vector type.
568 
569   You will have to use the embedded_size & embedded_init calls to
570   create such objects, and they will not be resizeable (so the 'safe'
571   allocation variants are not available).
572 
573   Properties:
574 
575	- The whole vector and control data are allocated in a single
576	  contiguous block.  It uses the trailing-vector idiom, so
577	  allocation must reserve enough space for all the elements
578  	  in the vector plus its control data.
579  	- The vector cannot be re-allocated.
580  	- The vector cannot grow nor shrink.
581  	- No indirections needed for access/manipulation.
582  	- It requires 2 words of storage (prior to vector allocation).  */
583 
584template<typename T, typename A>
585struct GTY((user)) vec<T, A, vl_embed>
586{
587public:
588  unsigned allocated (void) const { return m_vecpfx.m_alloc; }
589  unsigned length (void) const { return m_vecpfx.m_num; }
590  bool is_empty (void) const { return m_vecpfx.m_num == 0; }
591  T *address (void) { return m_vecdata; }
592  const T *address (void) const { return m_vecdata; }
593  T *begin () { return address (); }
594  const T *begin () const { return address (); }
595  T *end () { return address () + length (); }
596  const T *end () const { return address () + length (); }
597  const T &operator[] (unsigned) const;
598  T &operator[] (unsigned);
599  T &last (void);
600  bool space (unsigned) const;
601  bool iterate (unsigned, T *) const;
602  bool iterate (unsigned, T **) const;
603  vec *copy (ALONE_CXX_MEM_STAT_INFO) const;
604  void splice (const vec &);
605  void splice (const vec *src);
606  T *quick_push (const T &);
607  T &pop (void);
608  void truncate (unsigned);
609  void quick_insert (unsigned, const T &);
610  void ordered_remove (unsigned);
611  void unordered_remove (unsigned);
612  void block_remove (unsigned, unsigned);
613  void qsort (int (*) (const void *, const void *))qsort (int (*) (const void *, const void *));
614  void sort (int (*) (const void *, const void *, void *), void *);
615  T *bsearch (const void *key, int (*compar)(const void *, const void *));
616  T *bsearch (const void *key,
617	      int (*compar)(const void *, const void *, void *), void *);
618  unsigned lower_bound (T, bool (*)(const T &, const T &)) const;
619  bool contains (const T &search) const;
620  static size_t embedded_size (unsigned);
621  void embedded_init (unsigned, unsigned = 0, unsigned = 0);
622  void quick_grow (unsigned len);
623  void quick_grow_cleared (unsigned len);
624 
625  /* vec class can access our internal data and functions.  */
626  template <typename, typename, typename> friend struct vec;
627 
628  /* The allocator types also need access to our internals.  */
629  friend struct va_gc;
630  friend struct va_gc_atomic;
631  friend struct va_heap;
632 
633  /* FIXME - These fields should be private, but we need to cater to
634	     compilers that have stricter notions of PODness for types.  */
635  vec_prefix m_vecpfx;
636  T m_vecdata[1];
637};
638 
639 
640/* Convenience wrapper functions to use when dealing with pointers to
641   embedded vectors.  Some functionality for these vectors must be
642   provided via free functions for these reasons:
643 
644	1- The pointer may be NULL (e.g., before initial allocation).
645 
646  	2- When the vector needs to grow, it must be reallocated, so
647  	   the pointer will change its value.
648 
649   Because of limitations with the current GC machinery, all vectors
650   in GC memory *must* be pointers.  */
651 
652 
653/* If V contains no room for NELEMS elements, return false. Otherwise,
654   return true.  */
655template<typename T, typename A>
656inline bool
657vec_safe_space (const vec<T, A, vl_embed> *v, unsigned nelems)
658{
659  return v10.1
'v' is non-null
10.1
'v' is non-null
 ? v->space (nelems) : nelems == 0;
11
←
'?' condition is true→
12
←
Value assigned to 'alias_sets', which participates in a condition later→
13
←
Returning value, which participates in a condition later→
660}
661 
662 
663/* If V is NULL, return 0.  Otherwise, return V->length().  */
664template<typename T, typename A>
665inline unsigned
666vec_safe_length (const vec<T, A, vl_embed> *v)
667{
668  return v ? v->length () : 0;
669}
670 
671 
672/* If V is NULL, return NULL.  Otherwise, return V->address().  */
673template<typename T, typename A>
674inline T *
675vec_safe_address (vec<T, A, vl_embed> *v)
676{
677  return v ? v->address () : NULLnullptr;
678}
679 
680 
681/* If V is NULL, return true.  Otherwise, return V->is_empty().  */
682template<typename T, typename A>
683inline bool
684vec_safe_is_empty (vec<T, A, vl_embed> *v)
685{
686  return v ? v->is_empty () : true;
687}
688 
689/* If V does not have space for NELEMS elements, call
690   V->reserve(NELEMS, EXACT).  */
691template<typename T, typename A>
692inline bool
693vec_safe_reserve (vec<T, A, vl_embed> *&v, unsigned nelems, bool exact = false
694		  CXX_MEM_STAT_INFO)
695{
696  bool extend = nelems8.1
'nelems' is 1
8.1
'nelems' is 1
 ? !vec_safe_space (v, nelems) : false;
9
←
'?' condition is true→
10
←
Calling 'vec_safe_space<alias_set_entry *, va_gc>'→
14
←
Returning from 'vec_safe_space<alias_set_entry *, va_gc>'→
15
←
Assuming the condition is true→
697  if (extend15.1
'extend' is true
15.1
'extend' is true
)
16
←
Taking true branch→
698    A::reserve (v, nelems, exact PASS_MEM_STAT);
17
←
Calling 'va_gc::reserve'→
28
←
Returning from 'va_gc::reserve'→
699  return extend;
700}
701 
702template<typename T, typename A>
703inline bool
704vec_safe_reserve_exact (vec<T, A, vl_embed> *&v, unsigned nelems
705			CXX_MEM_STAT_INFO)
706{
707  return vec_safe_reserve (v, nelems, true PASS_MEM_STAT);
708}
709 
710 
711/* Allocate GC memory for V with space for NELEMS slots.  If NELEMS
712   is 0, V is initialized to NULL.  */
713 
714template<typename T, typename A>
715inline void
716vec_alloc (vec<T, A, vl_embed> *&v, unsigned nelems CXX_MEM_STAT_INFO)
717{
718  v = NULLnullptr;
719  vec_safe_reserve (v, nelems, false PASS_MEM_STAT);
720}
721 
722 
723/* Free the GC memory allocated by vector V and set it to NULL.  */
724 
725template<typename T, typename A>
726inline void
727vec_free (vec<T, A, vl_embed> *&v)
728{
729  A::release (v);
730}
731 
732 
733/* Grow V to length LEN.  Allocate it, if necessary.  */
734template<typename T, typename A>
735inline void
736vec_safe_grow (vec<T, A, vl_embed> *&v, unsigned len,
737	       bool exact = false CXX_MEM_STAT_INFO)
738{
739  unsigned oldlen = vec_safe_length (v);
740  gcc_checking_assert (len >= oldlen)((void)(!(len >= oldlen) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 740, __FUNCTION__), 0 : 0));
741  vec_safe_reserve (v, len - oldlen, exact PASS_MEM_STAT);
742  v->quick_grow (len);
743}
744 
745 
746/* If V is NULL, allocate it.  Call V->safe_grow_cleared(LEN).  */
747template<typename T, typename A>
748inline void
749vec_safe_grow_cleared (vec<T, A, vl_embed> *&v, unsigned len,
750		       bool exact = false CXX_MEM_STAT_INFO)
751{
752  unsigned oldlen = vec_safe_length (v);
753  vec_safe_grow (v, len, exact PASS_MEM_STAT);
754  vec_default_construct (v->address () + oldlen, len - oldlen);
755}
756 
757 
758/* Assume V is not NULL.  */
759 
760template<typename T>
761inline void
762vec_safe_grow_cleared (vec<T, va_heap, vl_ptr> *&v,
763		       unsigned len, bool exact = false CXX_MEM_STAT_INFO)
764{
765  v->safe_grow_cleared (len, exact PASS_MEM_STAT);
766}
767 
768/* If V does not have space for NELEMS elements, call
769   V->reserve(NELEMS, EXACT).  */
770 
771template<typename T>
772inline bool
773vec_safe_reserve (vec<T, va_heap, vl_ptr> *&v, unsigned nelems, bool exact = false
774		  CXX_MEM_STAT_INFO)
775{
776  return v->reserve (nelems, exact);
777}
778 
779 
780/* If V is NULL return false, otherwise return V->iterate(IX, PTR).  */
781template<typename T, typename A>
782inline bool
783vec_safe_iterate (const vec<T, A, vl_embed> *v, unsigned ix, T **ptr)
784{
785  if (v)
786    return v->iterate (ix, ptr);
787  else
788    {
789      *ptr = 0;
790      return false;
791    }
792}
793 
794template<typename T, typename A>
795inline bool
796vec_safe_iterate (const vec<T, A, vl_embed> *v, unsigned ix, T *ptr)
797{
798  if (v)
799    return v->iterate (ix, ptr);
800  else
801    {
802      *ptr = 0;
803      return false;
804    }
805}
806 
807 
808/* If V has no room for one more element, reallocate it.  Then call
809   V->quick_push(OBJ).  */
810template<typename T, typename A>
811inline T *
812vec_safe_push (vec<T, A, vl_embed> *&v, const T &obj CXX_MEM_STAT_INFO)
813{
814  vec_safe_reserve (v, 1, false PASS_MEM_STAT);
8
←
Calling 'vec_safe_reserve<alias_set_entry *, va_gc>'→
29
←
Returning from 'vec_safe_reserve<alias_set_entry *, va_gc>'→
815  return v->quick_push (obj);
30
←
Called C++ object pointer is null
816}
817 
818 
819/* if V has no room for one more element, reallocate it.  Then call
820   V->quick_insert(IX, OBJ).  */
821template<typename T, typename A>
822inline void
823vec_safe_insert (vec<T, A, vl_embed> *&v, unsigned ix, const T &obj
824		 CXX_MEM_STAT_INFO)
825{
826  vec_safe_reserve (v, 1, false PASS_MEM_STAT);
827  v->quick_insert (ix, obj);
828}
829 
830 
831/* If V is NULL, do nothing.  Otherwise, call V->truncate(SIZE).  */
832template<typename T, typename A>
833inline void
834vec_safe_truncate (vec<T, A, vl_embed> *v, unsigned size)
835{
836  if (v)
837    v->truncate (size);
838}
839 
840 
841/* If SRC is not NULL, return a pointer to a copy of it.  */
842template<typename T, typename A>
843inline vec<T, A, vl_embed> *
844vec_safe_copy (vec<T, A, vl_embed> *src CXX_MEM_STAT_INFO)
845{
846  return src ? src->copy (ALONE_PASS_MEM_STAT) : NULLnullptr;
847}
848 
849/* Copy the elements from SRC to the end of DST as if by memcpy.
850   Reallocate DST, if necessary.  */
851template<typename T, typename A>
852inline void
853vec_safe_splice (vec<T, A, vl_embed> *&dst, const vec<T, A, vl_embed> *src
854		 CXX_MEM_STAT_INFO)
855{
856  unsigned src_len = vec_safe_length (src);
857  if (src_len)
858    {
859      vec_safe_reserve_exact (dst, vec_safe_length (dst) + src_len
860			      PASS_MEM_STAT);
861      dst->splice (*src);
862    }
863}
864 
865/* Return true if SEARCH is an element of V.  Note that this is O(N) in the
866   size of the vector and so should be used with care.  */
867 
868template<typename T, typename A>
869inline bool
870vec_safe_contains (vec<T, A, vl_embed> *v, const T &search)
871{
872  return v ? v->contains (search) : false;
873}
874 
875/* Index into vector.  Return the IX'th element.  IX must be in the
876   domain of the vector.  */
877 
878template<typename T, typename A>
879inline const T &
880vec<T, A, vl_embed>::operator[] (unsigned ix) const
881{
882  gcc_checking_assert (ix < m_vecpfx.m_num)((void)(!(ix < m_vecpfx.m_num) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 882, __FUNCTION__), 0 : 0));
883  return m_vecdata[ix];
884}
885 
886template<typename T, typename A>
887inline T &
888vec<T, A, vl_embed>::operator[] (unsigned ix)
889{
890  gcc_checking_assert (ix < m_vecpfx.m_num)((void)(!(ix < m_vecpfx.m_num) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 890, __FUNCTION__), 0 : 0));
891  return m_vecdata[ix];
892}
893 
894 
895/* Get the final element of the vector, which must not be empty.  */
896 
897template<typename T, typename A>
898inline T &
899vec<T, A, vl_embed>::last (void)
900{
901  gcc_checking_assert (m_vecpfx.m_num > 0)((void)(!(m_vecpfx.m_num > 0) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 901, __FUNCTION__), 0 : 0));
902  return (*this)[m_vecpfx.m_num - 1];
903}
904 
905 
906/* If this vector has space for NELEMS additional entries, return
907   true.  You usually only need to use this if you are doing your
908   own vector reallocation, for instance on an embedded vector.  This
909   returns true in exactly the same circumstances that vec::reserve
910   will.  */
911 
912template<typename T, typename A>
913inline bool
914vec<T, A, vl_embed>::space (unsigned nelems) const
915{
916  return m_vecpfx.m_alloc - m_vecpfx.m_num >= nelems;
917}
918 
919 
920/* Return iteration condition and update PTR to point to the IX'th
921   element of this vector.  Use this to iterate over the elements of a
922   vector as follows,
923 
924     for (ix = 0; vec<T, A>::iterate (v, ix, &ptr); ix++)
925       continue;  */
926 
927template<typename T, typename A>
928inline bool
929vec<T, A, vl_embed>::iterate (unsigned ix, T *ptr) const
930{
931  if (ix < m_vecpfx.m_num)
932    {
933      *ptr = m_vecdata[ix];
934      return true;
935    }
936  else
937    {
938      *ptr = 0;
939      return false;
940    }
941}
942 
943 
944/* Return iteration condition and update *PTR to point to the
945   IX'th element of this vector.  Use this to iterate over the
946   elements of a vector as follows,
947 
948     for (ix = 0; v->iterate (ix, &ptr); ix++)
949       continue;
950 
951   This variant is for vectors of objects.  */
952 
953template<typename T, typename A>
954inline bool
955vec<T, A, vl_embed>::iterate (unsigned ix, T **ptr) const
956{
957  if (ix < m_vecpfx.m_num)
958    {
959      *ptr = CONST_CAST (T *, &m_vecdata[ix])(const_cast<T *> ((&m_vecdata[ix])));
960      return true;
961    }
962  else
963    {
964      *ptr = 0;
965      return false;
966    }
967}
968 
969 
970/* Return a pointer to a copy of this vector.  */
971 
972template<typename T, typename A>
973inline vec<T, A, vl_embed> *
974vec<T, A, vl_embed>::copy (ALONE_MEM_STAT_DECLvoid) const
975{
976  vec<T, A, vl_embed> *new_vec = NULLnullptr;
977  unsigned len = length ();
978  if (len)
979    {
980      vec_alloc (new_vec, len PASS_MEM_STAT);
981      new_vec->embedded_init (len, len);
982      vec_copy_construct (new_vec->address (), m_vecdata, len);
983    }
984  return new_vec;
985}
986 
987 
988/* Copy the elements from SRC to the end of this vector as if by memcpy.
989   The vector must have sufficient headroom available.  */
990 
991template<typename T, typename A>
992inline void
993vec<T, A, vl_embed>::splice (const vec<T, A, vl_embed> &src)
994{
995  unsigned len = src.length ();
996  if (len)
997    {
998      gcc_checking_assert (space (len))((void)(!(space (len)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 998, __FUNCTION__), 0 : 0));
999      vec_copy_construct (end (), src.address (), len);
1000      m_vecpfx.m_num += len;
1001    }
1002}
1003 
1004template<typename T, typename A>
1005inline void
1006vec<T, A, vl_embed>::splice (const vec<T, A, vl_embed> *src)
1007{
1008  if (src)
1009    splice (*src);
1010}
1011 
1012 
1013/* Push OBJ (a new element) onto the end of the vector.  There must be
1014   sufficient space in the vector.  Return a pointer to the slot
1015   where OBJ was inserted.  */
1016 
1017template<typename T, typename A>
1018inline T *
1019vec<T, A, vl_embed>::quick_push (const T &obj)
1020{
1021  gcc_checking_assert (space (1))((void)(!(space (1)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1021, __FUNCTION__), 0 : 0));
1022  T *slot = &m_vecdata[m_vecpfx.m_num++];
1023  *slot = obj;
1024  return slot;
1025}
1026 
1027 
1028/* Pop and return the last element off the end of the vector.  */
1029 
1030template<typename T, typename A>
1031inline T &
1032vec<T, A, vl_embed>::pop (void)
1033{
1034  gcc_checking_assert (length () > 0)((void)(!(length () > 0) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1034, __FUNCTION__), 0 : 0));
1035  return m_vecdata[--m_vecpfx.m_num];
1036}
1037 
1038 
1039/* Set the length of the vector to SIZE.  The new length must be less
1040   than or equal to the current length.  This is an O(1) operation.  */
1041 
1042template<typename T, typename A>
1043inline void
1044vec<T, A, vl_embed>::truncate (unsigned size)
1045{
1046  gcc_checking_assert (length () >= size)((void)(!(length () >= size) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1046, __FUNCTION__), 0 : 0));
1047  m_vecpfx.m_num = size;
1048}
1049 
1050 
1051/* Insert an element, OBJ, at the IXth position of this vector.  There
1052   must be sufficient space.  */
1053 
1054template<typename T, typename A>
1055inline void
1056vec<T, A, vl_embed>::quick_insert (unsigned ix, const T &obj)
1057{
1058  gcc_checking_assert (length () < allocated ())((void)(!(length () < allocated ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1058, __FUNCTION__), 0 : 0));
1059  gcc_checking_assert (ix <= length ())((void)(!(ix <= length ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1059, __FUNCTION__), 0 : 0));
1060  T *slot = &m_vecdata[ix];
1061  memmove (slot + 1, slot, (m_vecpfx.m_num++ - ix) * sizeof (T));
1062  *slot = obj;
1063}
1064 
1065 
1066/* Remove an element from the IXth position of this vector.  Ordering of
1067   remaining elements is preserved.  This is an O(N) operation due to
1068   memmove.  */
1069 
1070template<typename T, typename A>
1071inline void
1072vec<T, A, vl_embed>::ordered_remove (unsigned ix)
1073{
1074  gcc_checking_assert (ix < length ())((void)(!(ix < length ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1074, __FUNCTION__), 0 : 0));
1075  T *slot = &m_vecdata[ix];
1076  memmove (slot, slot + 1, (--m_vecpfx.m_num - ix) * sizeof (T));
1077}
1078 
1079 
1080/* Remove elements in [START, END) from VEC for which COND holds.  Ordering of
1081   remaining elements is preserved.  This is an O(N) operation.  */
1082 
1083#define VEC_ORDERED_REMOVE_IF_FROM_TO(vec, read_index, write_index,	\{ ((void)(!((end) <= (vec).length ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1084, __FUNCTION__), 0 : 0)); for (read_index = write_index
 = (start); read_index < (end); ++read_index) { elem_ptr =
 &(vec)[read_index]; bool remove_p = (cond); if (remove_p
) continue; if (read_index != write_index) (vec)[write_index]
 = (vec)[read_index]; write_index++; } if (read_index - write_index
 > 0) (vec).block_remove (write_index, read_index - write_index
); }
1084				      elem_ptr, start, end, cond){ ((void)(!((end) <= (vec).length ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1084, __FUNCTION__), 0 : 0)); for (read_index = write_index
 = (start); read_index < (end); ++read_index) { elem_ptr =
 &(vec)[read_index]; bool remove_p = (cond); if (remove_p
) continue; if (read_index != write_index) (vec)[write_index]
 = (vec)[read_index]; write_index++; } if (read_index - write_index
 > 0) (vec).block_remove (write_index, read_index - write_index
); }	\
1085  {									\
1086    gcc_assert ((end) <= (vec).length ())((void)(!((end) <= (vec).length ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1086, __FUNCTION__), 0 : 0));				\
1087    for (read_index = write_index = (start); read_index < (end);	\
1088	 ++read_index)							\
1089      {									\
1090	elem_ptr = &(vec)[read_index];					\
1091	bool remove_p = (cond);						\
1092	if (remove_p)							\
1093	  continue;							\
1094									\
1095	if (read_index != write_index)					\
1096	  (vec)[write_index] = (vec)[read_index];			\
1097									\
1098	write_index++;							\
1099      }									\
1100									\
1101    if (read_index - write_index > 0)					\
1102      (vec).block_remove (write_index, read_index - write_index);	\
1103  }
1104 
1105 
1106/* Remove elements from VEC for which COND holds.  Ordering of remaining
1107   elements is preserved.  This is an O(N) operation.  */
1108 
1109#define VEC_ORDERED_REMOVE_IF(vec, read_index, write_index, elem_ptr,	\{ ((void)(!(((vec).length ()) <= ((vec)).length ()) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1110, __FUNCTION__), 0 : 0)); for (read_index = write_index
 = (0); read_index < ((vec).length ()); ++read_index) { elem_ptr
 = &((vec))[read_index]; bool remove_p = ((cond)); if (remove_p
) continue; if (read_index != write_index) ((vec))[write_index
] = ((vec))[read_index]; write_index++; } if (read_index - write_index
 > 0) ((vec)).block_remove (write_index, read_index - write_index
); }
1110			      cond){ ((void)(!(((vec).length ()) <= ((vec)).length ()) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1110, __FUNCTION__), 0 : 0)); for (read_index = write_index
 = (0); read_index < ((vec).length ()); ++read_index) { elem_ptr
 = &((vec))[read_index]; bool remove_p = ((cond)); if (remove_p
) continue; if (read_index != write_index) ((vec))[write_index
] = ((vec))[read_index]; write_index++; } if (read_index - write_index
 > 0) ((vec)).block_remove (write_index, read_index - write_index
); }					\
1111  VEC_ORDERED_REMOVE_IF_FROM_TO ((vec), read_index, write_index,	\{ ((void)(!(((vec).length ()) <= ((vec)).length ()) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1112, __FUNCTION__), 0 : 0)); for (read_index = write_index
 = (0); read_index < ((vec).length ()); ++read_index) { elem_ptr
 = &((vec))[read_index]; bool remove_p = ((cond)); if (remove_p
) continue; if (read_index != write_index) ((vec))[write_index
] = ((vec))[read_index]; write_index++; } if (read_index - write_index
 > 0) ((vec)).block_remove (write_index, read_index - write_index
); }
1112				 elem_ptr, 0, (vec).length (), (cond)){ ((void)(!(((vec).length ()) <= ((vec)).length ()) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1112, __FUNCTION__), 0 : 0)); for (read_index = write_index
 = (0); read_index < ((vec).length ()); ++read_index) { elem_ptr
 = &((vec))[read_index]; bool remove_p = ((cond)); if (remove_p
) continue; if (read_index != write_index) ((vec))[write_index
] = ((vec))[read_index]; write_index++; } if (read_index - write_index
 > 0) ((vec)).block_remove (write_index, read_index - write_index
); }
1113 
1114/* Remove an element from the IXth position of this vector.  Ordering of
1115   remaining elements is destroyed.  This is an O(1) operation.  */
1116 
1117template<typename T, typename A>
1118inline void
1119vec<T, A, vl_embed>::unordered_remove (unsigned ix)
1120{
1121  gcc_checking_assert (ix < length ())((void)(!(ix < length ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1121, __FUNCTION__), 0 : 0));
1122  m_vecdata[ix] = m_vecdata[--m_vecpfx.m_num];
1123}
1124 
1125 
1126/* Remove LEN elements starting at the IXth.  Ordering is retained.
1127   This is an O(N) operation due to memmove.  */
1128 
1129template<typename T, typename A>
1130inline void
1131vec<T, A, vl_embed>::block_remove (unsigned ix, unsigned len)
1132{
1133  gcc_checking_assert (ix + len <= length ())((void)(!(ix + len <= length ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1133, __FUNCTION__), 0 : 0));
1134  T *slot = &m_vecdata[ix];
1135  m_vecpfx.m_num -= len;
1136  memmove (slot, slot + len, (m_vecpfx.m_num - ix) * sizeof (T));
1137}
1138 
1139 
1140/* Sort the contents of this vector with qsort.  CMP is the comparison
1141   function to pass to qsort.  */
1142 
1143template<typename T, typename A>
1144inline void
1145vec<T, A, vl_embed>::qsort (int (*cmp) (const void *, const void *))qsort (int (*cmp) (const void *, const void *))
1146{
1147  if (length () > 1)
1148    gcc_qsort (address (), length (), sizeof (T), cmp);
1149}
1150 
1151/* Sort the contents of this vector with qsort.  CMP is the comparison
1152   function to pass to qsort.  */
1153 
1154template<typename T, typename A>
1155inline void
1156vec<T, A, vl_embed>::sort (int (*cmp) (const void *, const void *, void *),
1157			   void *data)
1158{
1159  if (length () > 1)
1160    gcc_sort_r (address (), length (), sizeof (T), cmp, data);
1161}
1162 
1163 
1164/* Search the contents of the sorted vector with a binary search.
1165   CMP is the comparison function to pass to bsearch.  */
1166 
1167template<typename T, typename A>
1168inline T *
1169vec<T, A, vl_embed>::bsearch (const void *key,
1170			      int (*compar) (const void *, const void *))
1171{
1172  const void *base = this->address ();
1173  size_t nmemb = this->length ();
1174  size_t size = sizeof (T);
1175  /* The following is a copy of glibc stdlib-bsearch.h.  */
1176  size_t l, u, idx;
1177  const void *p;
1178  int comparison;
1179 
1180  l = 0;
1181  u = nmemb;
1182  while (l < u)
1183    {
1184      idx = (l + u) / 2;
1185      p = (const void *) (((const char *) base) + (idx * size));
1186      comparison = (*compar) (key, p);
1187      if (comparison < 0)
1188	u = idx;
1189      else if (comparison > 0)
1190	l = idx + 1;
1191      else
1192	return (T *)const_cast<void *>(p);
1193    }
1194 
1195  return NULLnullptr;
1196}
1197 
1198/* Search the contents of the sorted vector with a binary search.
1199   CMP is the comparison function to pass to bsearch.  */
1200 
1201template<typename T, typename A>
1202inline T *
1203vec<T, A, vl_embed>::bsearch (const void *key,
1204			      int (*compar) (const void *, const void *,
1205					     void *), void *data)
1206{
1207  const void *base = this->address ();
1208  size_t nmemb = this->length ();
1209  size_t size = sizeof (T);
1210  /* The following is a copy of glibc stdlib-bsearch.h.  */
1211  size_t l, u, idx;
1212  const void *p;
1213  int comparison;
1214 
1215  l = 0;
1216  u = nmemb;
1217  while (l < u)
1218    {
1219      idx = (l + u) / 2;
1220      p = (const void *) (((const char *) base) + (idx * size));
1221      comparison = (*compar) (key, p, data);
1222      if (comparison < 0)
1223	u = idx;
1224      else if (comparison > 0)
1225	l = idx + 1;
1226      else
1227	return (T *)const_cast<void *>(p);
1228    }
1229 
1230  return NULLnullptr;
1231}
1232 
1233/* Return true if SEARCH is an element of V.  Note that this is O(N) in the
1234   size of the vector and so should be used with care.  */
1235 
1236template<typename T, typename A>
1237inline bool
1238vec<T, A, vl_embed>::contains (const T &search) const
1239{
1240  unsigned int len = length ();
1241  for (unsigned int i = 0; i < len; i++)
1242    if ((*this)[i] == search)
1243      return true;
1244 
1245  return false;
1246}
1247 
1248/* Find and return the first position in which OBJ could be inserted
1249   without changing the ordering of this vector.  LESSTHAN is a
1250   function that returns true if the first argument is strictly less
1251   than the second.  */
1252 
1253template<typename T, typename A>
1254unsigned
1255vec<T, A, vl_embed>::lower_bound (T obj, bool (*lessthan)(const T &, const T &))
1256  const
1257{
1258  unsigned int len = length ();
1259  unsigned int half, middle;
1260  unsigned int first = 0;
1261  while (len > 0)
1262    {
1263      half = len / 2;
1264      middle = first;
1265      middle += half;
1266      T middle_elem = (*this)[middle];
1267      if (lessthan (middle_elem, obj))
1268	{
1269	  first = middle;
1270	  ++first;
1271	  len = len - half - 1;
1272	}
1273      else
1274	len = half;
1275    }
1276  return first;
1277}
1278 
1279 
1280/* Return the number of bytes needed to embed an instance of an
1281   embeddable vec inside another data structure.
1282 
1283   Use these methods to determine the required size and initialization
1284   of a vector V of type T embedded within another structure (as the
1285   final member):
1286 
1287   size_t vec<T, A, vl_embed>::embedded_size (unsigned alloc);
1288   void v->embedded_init (unsigned alloc, unsigned num);
1289 
1290   These allow the caller to perform the memory allocation.  */
1291 
1292template<typename T, typename A>
1293inline size_t
1294vec<T, A, vl_embed>::embedded_size (unsigned alloc)
1295{
1296  struct alignas (T) U { char data[sizeof (T)]; };
1297  typedef vec<U, A, vl_embed> vec_embedded;
1298  typedef typename std::conditional<std::is_standard_layout<T>::value,
1299				    vec, vec_embedded>::type vec_stdlayout;
1300  static_assert (sizeof (vec_stdlayout) == sizeof (vec), "");
1301  static_assert (alignof (vec_stdlayout) == alignof (vec), "");
1302  return offsetof (vec_stdlayout, m_vecdata)__builtin_offsetof(vec_stdlayout, m_vecdata) + alloc * sizeof (T);
1303}
1304 
1305 
1306/* Initialize the vector to contain room for ALLOC elements and
1307   NUM active elements.  */
1308 
1309template<typename T, typename A>
1310inline void
1311vec<T, A, vl_embed>::embedded_init (unsigned alloc, unsigned num, unsigned aut)
1312{
1313  m_vecpfx.m_alloc = alloc;
1314  m_vecpfx.m_using_auto_storage = aut;
1315  m_vecpfx.m_num = num;
1316}
1317 
1318 
1319/* Grow the vector to a specific length.  LEN must be as long or longer than
1320   the current length.  The new elements are uninitialized.  */
1321 
1322template<typename T, typename A>
1323inline void
1324vec<T, A, vl_embed>::quick_grow (unsigned len)
1325{
1326  gcc_checking_assert (length () <= len && len <= m_vecpfx.m_alloc)((void)(!(length () <= len && len <= m_vecpfx.m_alloc
) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1326, __FUNCTION__), 0 : 0));
1327  m_vecpfx.m_num = len;
1328}
1329 
1330 
1331/* Grow the vector to a specific length.  LEN must be as long or longer than
1332   the current length.  The new elements are initialized to zero.  */
1333 
1334template<typename T, typename A>
1335inline void
1336vec<T, A, vl_embed>::quick_grow_cleared (unsigned len)
1337{
1338  unsigned oldlen = length ();
1339  size_t growby = len - oldlen;
1340  quick_grow (len);
1341  if (growby != 0)
1342    vec_default_construct (address () + oldlen, growby);
1343}
1344 
1345/* Garbage collection support for vec<T, A, vl_embed>.  */
1346 
1347template<typename T>
1348void
1349gt_ggc_mx (vec<T, va_gc> *v)
1350{
1351  extern void gt_ggc_mx (T &);
1352  for (unsigned i = 0; i < v->length (); i++)
1353    gt_ggc_mx ((*v)[i]);
1354}
1355 
1356template<typename T>
1357void
1358gt_ggc_mx (vec<T, va_gc_atomic, vl_embed> *v ATTRIBUTE_UNUSED__attribute__ ((__unused__)))
1359{
1360  /* Nothing to do.  Vectors of atomic types wrt GC do not need to
1361     be traversed.  */
1362}
1363 
1364 
1365/* PCH support for vec<T, A, vl_embed>.  */
1366 
1367template<typename T, typename A>
1368void
1369gt_pch_nx (vec<T, A, vl_embed> *v)
1370{
1371  extern void gt_pch_nx (T &);
1372  for (unsigned i = 0; i < v->length (); i++)
1373    gt_pch_nx ((*v)[i]);
1374}
1375 
1376template<typename T, typename A>
1377void
1378gt_pch_nx (vec<T *, A, vl_embed> *v, gt_pointer_operator op, void *cookie)
1379{
1380  for (unsigned i = 0; i < v->length (); i++)
1381    op (&((*v)[i]), cookie);
1382}
1383 
1384template<typename T, typename A>
1385void
1386gt_pch_nx (vec<T, A, vl_embed> *v, gt_pointer_operator op, void *cookie)
1387{
1388  extern void gt_pch_nx (T *, gt_pointer_operator, void *);
1389  for (unsigned i = 0; i < v->length (); i++)
1390    gt_pch_nx (&((*v)[i]), op, cookie);
1391}
1392 
1393 
1394/* Space efficient vector.  These vectors can grow dynamically and are
1395   allocated together with their control data.  They are suited to be
1396   included in data structures.  Prior to initial allocation, they
1397   only take a single word of storage.
1398 
1399   These vectors are implemented as a pointer to an embeddable vector.
1400   The semantics allow for this pointer to be NULL to represent empty
1401   vectors.  This way, empty vectors occupy minimal space in the
1402   structure containing them.
1403 
1404   Properties:
1405 
1406	- The whole vector and control data are allocated in a single
1407	  contiguous block.
1408  	- The whole vector may be re-allocated.
1409  	- Vector data may grow and shrink.
1410  	- Access and manipulation requires a pointer test and
1411	  indirection.
1412	- It requires 1 word of storage (prior to vector allocation).
1413 
1414 
1415   Limitations:
1416 
1417   These vectors must be PODs because they are stored in unions.
1418   (http://en.wikipedia.org/wiki/Plain_old_data_structures).
1419   As long as we use C++03, we cannot have constructors nor
1420   destructors in classes that are stored in unions.  */
1421 
1422template<typename T>
1423struct vec<T, va_heap, vl_ptr>
1424{
1425public:
1426  /* Memory allocation and deallocation for the embedded vector.
1427     Needed because we cannot have proper ctors/dtors defined.  */
1428  void create (unsigned nelems CXX_MEM_STAT_INFO);
1429  void release (void);
1430 
1431  /* Vector operations.  */
1432  bool exists (void) const
1433  { return m_vec != NULLnullptr; }
1434 
1435  bool is_empty (void) const
1436  { return m_vec ? m_vec->is_empty () : true; }
1437 
1438  unsigned length (void) const
1439  { return m_vec ? m_vec->length () : 0; }
1440 
1441  T *address (void)
1442  { return m_vec ? m_vec->m_vecdata : NULLnullptr; }
1443 
1444  const T *address (void) const
1445  { return m_vec ? m_vec->m_vecdata : NULLnullptr; }
1446 
1447  T *begin () { return address (); }
1448  const T *begin () const { return address (); }
1449  T *end () { return begin () + length (); }
1450  const T *end () const { return begin () + length (); }
1451  const T &operator[] (unsigned ix) const
1452  { return (*m_vec)[ix]; }
1453 
1454  bool operator!=(const vec &other) const
1455  { return !(*this == other); }
1456 
1457  bool operator==(const vec &other) const
1458  { return address () == other.address (); }
1459 
1460  T &operator[] (unsigned ix)
1461  { return (*m_vec)[ix]; }
1462 
1463  T &last (void)
1464  { return m_vec->last (); }
1465 
1466  bool space (int nelems) const
1467  { return m_vec ? m_vec->space (nelems) : nelems == 0; }
1468 
1469  bool iterate (unsigned ix, T *p) const;
1470  bool iterate (unsigned ix, T **p) const;
1471  vec copy (ALONE_CXX_MEM_STAT_INFO) const;
1472  bool reserve (unsigned, bool = false CXX_MEM_STAT_INFO);
1473  bool reserve_exact (unsigned CXX_MEM_STAT_INFO);
1474  void splice (const vec &);
1475  void safe_splice (const vec & CXX_MEM_STAT_INFO);
1476  T *quick_push (const T &);
1477  T *safe_push (const T &CXX_MEM_STAT_INFO);
1478  T &pop (void);
1479  void truncate (unsigned);
1480  void safe_grow (unsigned, bool = false CXX_MEM_STAT_INFO);
1481  void safe_grow_cleared (unsigned, bool = false CXX_MEM_STAT_INFO);
1482  void quick_grow (unsigned);
1483  void quick_grow_cleared (unsigned);
1484  void quick_insert (unsigned, const T &);
1485  void safe_insert (unsigned, const T & CXX_MEM_STAT_INFO);
1486  void ordered_remove (unsigned);
1487  void unordered_remove (unsigned);
1488  void block_remove (unsigned, unsigned);
1489  void qsort (int (*) (const void *, const void *))qsort (int (*) (const void *, const void *));
1490  void sort (int (*) (const void *, const void *, void *), void *);
1491  T *bsearch (const void *key, int (*compar)(const void *, const void *));
1492  T *bsearch (const void *key,
1493	      int (*compar)(const void *, const void *, void *), void *);
1494  unsigned lower_bound (T, bool (*)(const T &, const T &)) const;
1495  bool contains (const T &search) const;
1496  void reverse (void);
1497 
1498  bool using_auto_storage () const;
1499 
1500  /* FIXME - This field should be private, but we need to cater to
1501	     compilers that have stricter notions of PODness for types.  */
1502  vec<T, va_heap, vl_embed> *m_vec;
1503};
1504 
1505 
1506/* auto_vec is a subclass of vec that automatically manages creating and
1507   releasing the internal vector. If N is non zero then it has N elements of
1508   internal storage.  The default is no internal storage, and you probably only
1509   want to ask for internal storage for vectors on the stack because if the
1510   size of the vector is larger than the internal storage that space is wasted.
1511   */
1512template<typename T, size_t N = 0>
1513class auto_vec : public vec<T, va_heap>
1514{
1515public:
1516  auto_vec ()
1517  {
1518    m_auto.embedded_init (MAX (N, 2)((N) > (2) ? (N) : (2)), 0, 1);
1519    this->m_vec = &m_auto;
1520  }
1521 
1522  auto_vec (size_t s)
1523  {
1524    if (s > N)
1525      {
1526	this->create (s);
1527	return;
1528      }
1529 
1530    m_auto.embedded_init (MAX (N, 2)((N) > (2) ? (N) : (2)), 0, 1);
1531    this->m_vec = &m_auto;
1532  }
1533 
1534  ~auto_vec ()
1535  {
1536    this->release ();
1537  }
1538 
1539private:
1540  vec<T, va_heap, vl_embed> m_auto;
1541  T m_data[MAX (N - 1, 1)((N - 1) > (1) ? (N - 1) : (1))];
1542};
1543 
1544/* auto_vec is a sub class of vec whose storage is released when it is
1545  destroyed. */
1546template<typename T>
1547class auto_vec<T, 0> : public vec<T, va_heap>
1548{
1549public:
1550  auto_vec () { this->m_vec = NULLnullptr; }
1551  auto_vec (size_t n) { this->create (n); }
1552  ~auto_vec () { this->release (); }
1553 
1554  auto_vec (vec<T, va_heap>&& r)
1555    {
1556      gcc_assert (!r.using_auto_storage ())((void)(!(!r.using_auto_storage ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1556, __FUNCTION__), 0 : 0));
1557      this->m_vec = r.m_vec;
1558      r.m_vec = NULLnullptr;
1559    }
1560  auto_vec& operator= (vec<T, va_heap>&& r)
1561    {
1562      gcc_assert (!r.using_auto_storage ())((void)(!(!r.using_auto_storage ()) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1562, __FUNCTION__), 0 : 0));
1563      this->release ();
1564      this->m_vec = r.m_vec;
1565      r.m_vec = NULLnullptr;
1566      return *this;
1567    }
1568};
1569 
1570 
1571/* Allocate heap memory for pointer V and create the internal vector
1572   with space for NELEMS elements.  If NELEMS is 0, the internal
1573   vector is initialized to empty.  */
1574 
1575template<typename T>
1576inline void
1577vec_alloc (vec<T> *&v, unsigned nelems CXX_MEM_STAT_INFO)
1578{
1579  v = new vec<T>;
1580  v->create (nelems PASS_MEM_STAT);
1581}
1582 
1583 
1584/* A subclass of auto_vec <char *> that frees all of its elements on
1585   deletion.  */
1586 
1587class auto_string_vec : public auto_vec <char *>
1588{
1589 public:
1590  ~auto_string_vec ();
1591};
1592 
1593/* A subclass of auto_vec <T *> that deletes all of its elements on
1594   destruction.
1595 
1596   This is a crude way for a vec to "own" the objects it points to
1597   and clean up automatically.
1598 
1599   For example, no attempt is made to delete elements when an item
1600   within the vec is overwritten.
1601 
1602   We can't rely on gnu::unique_ptr within a container,
1603   since we can't rely on move semantics in C++98.  */
1604 
1605template <typename T>
1606class auto_delete_vec : public auto_vec <T *>
1607{
1608 public:
1609  auto_delete_vec () {}
1610  auto_delete_vec (size_t s) : auto_vec <T *> (s) {}
1611 
1612  ~auto_delete_vec ();
1613 
1614private:
1615  DISABLE_COPY_AND_ASSIGN(auto_delete_vec)auto_delete_vec (const auto_delete_vec&) = delete; void operator
= (const auto_delete_vec &) = delete;
1616};
1617 
1618/* Conditionally allocate heap memory for VEC and its internal vector.  */
1619 
1620template<typename T>
1621inline void
1622vec_check_alloc (vec<T, va_heap> *&vec, unsigned nelems CXX_MEM_STAT_INFO)
1623{
1624  if (!vec)
1625    vec_alloc (vec, nelems PASS_MEM_STAT);
1626}
1627 
1628 
1629/* Free the heap memory allocated by vector V and set it to NULL.  */
1630 
1631template<typename T>
1632inline void
1633vec_free (vec<T> *&v)
1634{
1635  if (v == NULLnullptr)
1636    return;
1637 
1638  v->release ();
1639  delete v;
1640  v = NULLnullptr;
1641}
1642 
1643 
1644/* Return iteration condition and update PTR to point to the IX'th
1645   element of this vector.  Use this to iterate over the elements of a
1646   vector as follows,
1647 
1648     for (ix = 0; v.iterate (ix, &ptr); ix++)
1649       continue;  */
1650 
1651template<typename T>
1652inline bool
1653vec<T, va_heap, vl_ptr>::iterate (unsigned ix, T *ptr) const
1654{
1655  if (m_vec)
1656    return m_vec->iterate (ix, ptr);
1657  else
1658    {
1659      *ptr = 0;
1660      return false;
1661    }
1662}
1663 
1664 
1665/* Return iteration condition and update *PTR to point to the
1666   IX'th element of this vector.  Use this to iterate over the
1667   elements of a vector as follows,
1668 
1669     for (ix = 0; v->iterate (ix, &ptr); ix++)
1670       continue;
1671 
1672   This variant is for vectors of objects.  */
1673 
1674template<typename T>
1675inline bool
1676vec<T, va_heap, vl_ptr>::iterate (unsigned ix, T **ptr) const
1677{
1678  if (m_vec)
1679    return m_vec->iterate (ix, ptr);
1680  else
1681    {
1682      *ptr = 0;
1683      return false;
1684    }
1685}
1686 
1687 
1688/* Convenience macro for forward iteration.  */
1689#define FOR_EACH_VEC_ELT(V, I, P)for (I = 0; (V).iterate ((I), &(P)); ++(I))			\
1690  for (I = 0; (V).iterate ((I), &(P)); ++(I))
1691 
1692#define FOR_EACH_VEC_SAFE_ELT(V, I, P)for (I = 0; vec_safe_iterate ((V), (I), &(P)); ++(I))			\
1693  for (I = 0; vec_safe_iterate ((V), (I), &(P)); ++(I))
1694 
1695/* Likewise, but start from FROM rather than 0.  */
1696#define FOR_EACH_VEC_ELT_FROM(V, I, P, FROM)for (I = (FROM); (V).iterate ((I), &(P)); ++(I))		\
1697  for (I = (FROM); (V).iterate ((I), &(P)); ++(I))
1698 
1699/* Convenience macro for reverse iteration.  */
1700#define FOR_EACH_VEC_ELT_REVERSE(V, I, P)for (I = (V).length () - 1; (V).iterate ((I), &(P)); (I)--
)		\
1701  for (I = (V).length () - 1;				\
1702       (V).iterate ((I), &(P));				\
1703       (I)--)
1704 
1705#define FOR_EACH_VEC_SAFE_ELT_REVERSE(V, I, P)for (I = vec_safe_length (V) - 1; vec_safe_iterate ((V), (I),
 &(P)); (I)--)		\
1706  for (I = vec_safe_length (V) - 1;			\
1707       vec_safe_iterate ((V), (I), &(P));	\
1708       (I)--)
1709 
1710/* auto_string_vec's dtor, freeing all contained strings, automatically
1711   chaining up to ~auto_vec <char *>, which frees the internal buffer.  */
1712 
1713inline
1714auto_string_vec::~auto_string_vec ()
1715{
1716  int i;
1717  char *str;
1718  FOR_EACH_VEC_ELT (*this, i, str)for (i = 0; (*this).iterate ((i), &(str)); ++(i))
1719    free (str);
1720}
1721 
1722/* auto_delete_vec's dtor, deleting all contained items, automatically
1723   chaining up to ~auto_vec <T*>, which frees the internal buffer.  */
1724 
1725template <typename T>
1726inline
1727auto_delete_vec<T>::~auto_delete_vec ()
1728{
1729  int i;
1730  T *item;
1731  FOR_EACH_VEC_ELT (*this, i, item)for (i = 0; (*this).iterate ((i), &(item)); ++(i))
1732    delete item;
1733}
1734 
1735 
1736/* Return a copy of this vector.  */
1737 
1738template<typename T>
1739inline vec<T, va_heap, vl_ptr>
1740vec<T, va_heap, vl_ptr>::copy (ALONE_MEM_STAT_DECLvoid) const
1741{
1742  vec<T, va_heap, vl_ptr> new_vec = vNULL;
1743  if (length ())
1744    new_vec.m_vec = m_vec->copy (ALONE_PASS_MEM_STAT);
1745  return new_vec;
1746}
1747 
1748 
1749/* Ensure that the vector has at least RESERVE slots available (if
1750   EXACT is false), or exactly RESERVE slots available (if EXACT is
1751   true).
1752 
1753   This may create additional headroom if EXACT is false.
1754 
1755   Note that this can cause the embedded vector to be reallocated.
1756   Returns true iff reallocation actually occurred.  */
1757 
1758template<typename T>
1759inline bool
1760vec<T, va_heap, vl_ptr>::reserve (unsigned nelems, bool exact MEM_STAT_DECL)
1761{
1762  if (space (nelems))
1763    return false;
1764 
1765  /* For now play a game with va_heap::reserve to hide our auto storage if any,
1766     this is necessary because it doesn't have enough information to know the
1767     embedded vector is in auto storage, and so should not be freed.  */
1768  vec<T, va_heap, vl_embed> *oldvec = m_vec;
1769  unsigned int oldsize = 0;
1770  bool handle_auto_vec = m_vec && using_auto_storage ();
1771  if (handle_auto_vec)
1772    {
1773      m_vec = NULLnullptr;
1774      oldsize = oldvec->length ();
1775      nelems += oldsize;
1776    }
1777 
1778  va_heap::reserve (m_vec, nelems, exact PASS_MEM_STAT);
1779  if (handle_auto_vec)
1780    {
1781      vec_copy_construct (m_vec->address (), oldvec->address (), oldsize);
1782      m_vec->m_vecpfx.m_num = oldsize;
1783    }
1784 
1785  return true;
1786}
1787 
1788 
1789/* Ensure that this vector has exactly NELEMS slots available.  This
1790   will not create additional headroom.  Note this can cause the
1791   embedded vector to be reallocated.  Returns true iff reallocation
1792   actually occurred.  */
1793 
1794template<typename T>
1795inline bool
1796vec<T, va_heap, vl_ptr>::reserve_exact (unsigned nelems MEM_STAT_DECL)
1797{
1798  return reserve (nelems, true PASS_MEM_STAT);
1799}
1800 
1801 
1802/* Create the internal vector and reserve NELEMS for it.  This is
1803   exactly like vec::reserve, but the internal vector is
1804   unconditionally allocated from scratch.  The old one, if it
1805   existed, is lost.  */
1806 
1807template<typename T>
1808inline void
1809vec<T, va_heap, vl_ptr>::create (unsigned nelems MEM_STAT_DECL)
1810{
1811  m_vec = NULLnullptr;
1812  if (nelems > 0)
1813    reserve_exact (nelems PASS_MEM_STAT);
1814}
1815 
1816 
1817/* Free the memory occupied by the embedded vector.  */
1818 
1819template<typename T>
1820inline void
1821vec<T, va_heap, vl_ptr>::release (void)
1822{
1823  if (!m_vec)
1824    return;
1825 
1826  if (using_auto_storage ())
1827    {
1828      m_vec->m_vecpfx.m_num = 0;
1829      return;
1830    }
1831 
1832  va_heap::release (m_vec);
1833}
1834 
1835/* Copy the elements from SRC to the end of this vector as if by memcpy.
1836   SRC and this vector must be allocated with the same memory
1837   allocation mechanism. This vector is assumed to have sufficient
1838   headroom available.  */
1839 
1840template<typename T>
1841inline void
1842vec<T, va_heap, vl_ptr>::splice (const vec<T, va_heap, vl_ptr> &src)
1843{
1844  if (src.length ())
1845    m_vec->splice (*(src.m_vec));
1846}
1847 
1848 
1849/* Copy the elements in SRC to the end of this vector as if by memcpy.
1850   SRC and this vector must be allocated with the same mechanism.
1851   If there is not enough headroom in this vector, it will be reallocated
1852   as needed.  */
1853 
1854template<typename T>
1855inline void
1856vec<T, va_heap, vl_ptr>::safe_splice (const vec<T, va_heap, vl_ptr> &src
1857				      MEM_STAT_DECL)
1858{
1859  if (src.length ())
1860    {
1861      reserve_exact (src.length ());
1862      splice (src);
1863    }
1864}
1865 
1866 
1867/* Push OBJ (a new element) onto the end of the vector.  There must be
1868   sufficient space in the vector.  Return a pointer to the slot
1869   where OBJ was inserted.  */
1870 
1871template<typename T>
1872inline T *
1873vec<T, va_heap, vl_ptr>::quick_push (const T &obj)
1874{
1875  return m_vec->quick_push (obj);
1876}
1877 
1878 
1879/* Push a new element OBJ onto the end of this vector.  Reallocates
1880   the embedded vector, if needed.  Return a pointer to the slot where
1881   OBJ was inserted.  */
1882 
1883template<typename T>
1884inline T *
1885vec<T, va_heap, vl_ptr>::safe_push (const T &obj MEM_STAT_DECL)
1886{
1887  reserve (1, false PASS_MEM_STAT);
1888  return quick_push (obj);
1889}
1890 
1891 
1892/* Pop and return the last element off the end of the vector.  */
1893 
1894template<typename T>
1895inline T &
1896vec<T, va_heap, vl_ptr>::pop (void)
1897{
1898  return m_vec->pop ();
1899}
1900 
1901 
1902/* Set the length of the vector to LEN.  The new length must be less
1903   than or equal to the current length.  This is an O(1) operation.  */
1904 
1905template<typename T>
1906inline void
1907vec<T, va_heap, vl_ptr>::truncate (unsigned size)
1908{
1909  if (m_vec)
1910    m_vec->truncate (size);
1911  else
1912    gcc_checking_assert (size == 0)((void)(!(size == 0) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1912, __FUNCTION__), 0 : 0));
1913}
1914 
1915 
1916/* Grow the vector to a specific length.  LEN must be as long or
1917   longer than the current length.  The new elements are
1918   uninitialized.  Reallocate the internal vector, if needed.  */
1919 
1920template<typename T>
1921inline void
1922vec<T, va_heap, vl_ptr>::safe_grow (unsigned len, bool exact MEM_STAT_DECL)
1923{
1924  unsigned oldlen = length ();
1925  gcc_checking_assert (oldlen <= len)((void)(!(oldlen <= len) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1925, __FUNCTION__), 0 : 0));
1926  reserve (len - oldlen, exact PASS_MEM_STAT);
1927  if (m_vec)
1928    m_vec->quick_grow (len);
1929  else
1930    gcc_checking_assert (len == 0)((void)(!(len == 0) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1930, __FUNCTION__), 0 : 0));
1931}
1932 
1933 
1934/* Grow the embedded vector to a specific length.  LEN must be as
1935   long or longer than the current length.  The new elements are
1936   initialized to zero.  Reallocate the internal vector, if needed.  */
1937 
1938template<typename T>
1939inline void
1940vec<T, va_heap, vl_ptr>::safe_grow_cleared (unsigned len, bool exact
1941					    MEM_STAT_DECL)
1942{
1943  unsigned oldlen = length ();
1944  size_t growby = len - oldlen;
1945  safe_grow (len, exact PASS_MEM_STAT);
1946  if (growby != 0)
1947    vec_default_construct (address () + oldlen, growby);
1948}
1949 
1950 
1951/* Same as vec::safe_grow but without reallocation of the internal vector.
1952   If the vector cannot be extended, a runtime assertion will be triggered.  */
1953 
1954template<typename T>
1955inline void
1956vec<T, va_heap, vl_ptr>::quick_grow (unsigned len)
1957{
1958  gcc_checking_assert (m_vec)((void)(!(m_vec) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1958, __FUNCTION__), 0 : 0));
1959  m_vec->quick_grow (len);
1960}
1961 
1962 
1963/* Same as vec::quick_grow_cleared but without reallocation of the
1964   internal vector. If the vector cannot be extended, a runtime
1965   assertion will be triggered.  */
1966 
1967template<typename T>
1968inline void
1969vec<T, va_heap, vl_ptr>::quick_grow_cleared (unsigned len)
1970{
1971  gcc_checking_assert (m_vec)((void)(!(m_vec) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1971, __FUNCTION__), 0 : 0));
1972  m_vec->quick_grow_cleared (len);
1973}
1974 
1975 
1976/* Insert an element, OBJ, at the IXth position of this vector.  There
1977   must be sufficient space.  */
1978 
1979template<typename T>
1980inline void
1981vec<T, va_heap, vl_ptr>::quick_insert (unsigned ix, const T &obj)
1982{
1983  m_vec->quick_insert (ix, obj);
1984}
1985 
1986 
1987/* Insert an element, OBJ, at the IXth position of the vector.
1988   Reallocate the embedded vector, if necessary.  */
1989 
1990template<typename T>
1991inline void
1992vec<T, va_heap, vl_ptr>::safe_insert (unsigned ix, const T &obj MEM_STAT_DECL)
1993{
1994  reserve (1, false PASS_MEM_STAT);
1995  quick_insert (ix, obj);
1996}
1997 
1998 
1999/* Remove an element from the IXth position of this vector.  Ordering of
2000   remaining elements is preserved.  This is an O(N) operation due to
2001   a memmove.  */
2002 
2003template<typename T>
2004inline void
2005vec<T, va_heap, vl_ptr>::ordered_remove (unsigned ix)
2006{
2007  m_vec->ordered_remove (ix);
2008}
2009 
2010 
2011/* Remove an element from the IXth position of this vector.  Ordering
2012   of remaining elements is destroyed.  This is an O(1) operation.  */
2013 
2014template<typename T>
2015inline void
2016vec<T, va_heap, vl_ptr>::unordered_remove (unsigned ix)
2017{
2018  m_vec->unordered_remove (ix);
2019}
2020 
2021 
2022/* Remove LEN elements starting at the IXth.  Ordering is retained.
2023   This is an O(N) operation due to memmove.  */
2024 
2025template<typename T>
2026inline void
2027vec<T, va_heap, vl_ptr>::block_remove (unsigned ix, unsigned len)
2028{
2029  m_vec->block_remove (ix, len);
2030}
2031 
2032 
2033/* Sort the contents of this vector with qsort.  CMP is the comparison
2034   function to pass to qsort.  */
2035 
2036template<typename T>
2037inline void
2038vec<T, va_heap, vl_ptr>::qsort (int (*cmp) (const void *, const void *))qsort (int (*cmp) (const void *, const void *))
2039{
2040  if (m_vec)
2041    m_vec->qsort (cmp)qsort (cmp);
2042}
2043 
2044/* Sort the contents of this vector with qsort.  CMP is the comparison
2045   function to pass to qsort.  */
2046 
2047template<typename T>
2048inline void
2049vec<T, va_heap, vl_ptr>::sort (int (*cmp) (const void *, const void *,
2050					   void *), void *data)
2051{
2052  if (m_vec)
2053    m_vec->sort (cmp, data);
2054}
2055 
2056 
2057/* Search the contents of the sorted vector with a binary search.
2058   CMP is the comparison function to pass to bsearch.  */
2059 
2060template<typename T>
2061inline T *
2062vec<T, va_heap, vl_ptr>::bsearch (const void *key,
2063				  int (*cmp) (const void *, const void *))
2064{
2065  if (m_vec)
2066    return m_vec->bsearch (key, cmp);
2067  return NULLnullptr;
2068}
2069 
2070/* Search the contents of the sorted vector with a binary search.
2071   CMP is the comparison function to pass to bsearch.  */
2072 
2073template<typename T>
2074inline T *
2075vec<T, va_heap, vl_ptr>::bsearch (const void *key,
2076				  int (*cmp) (const void *, const void *,
2077					      void *), void *data)
2078{
2079  if (m_vec)
2080    return m_vec->bsearch (key, cmp, data);
2081  return NULLnullptr;
2082}
2083 
2084 