/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 trans-types.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_FRONTEND -D IN_GCC -D HAVE_CONFIG_H -I . -I fortran -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/fortran -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-AuTiOU.plist -x c++ /home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c

/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c

→

1/* Backend support for Fortran 95 basic types and derived types.
 Copyright (C) 2002-2021 Free Software Foundation, Inc.
 Contributed by Paul Brook <paul@nowt.org>
 and Steven Bosscher <s.bosscher@student.tudelft.nl>

6This file is part of GCC.

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.

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.

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

22/* trans-types.c -- gfortran backend types */

24#include "config.h"
25#include "system.h"
26#include "coretypes.h"
27#include "target.h"
28#include "tree.h"
29#include "gfortran.h"
30#include "trans.h"
31#include "stringpool.h"
32#include "fold-const.h"
33#include "stor-layout.h"
34#include "langhooks.h"	/* For iso-c-bindings.def.  */
35#include "toplev.h"	/* For rest_of_decl_compilation.  */
36#include "trans-types.h"
37#include "trans-const.h"
38#include "trans-array.h"
39#include "dwarf2out.h"	/* For struct array_descr_info.  */
40#include "attribs.h"
41#include "alias.h"
42

44#if (GFC_MAX_DIMENSIONS15 < 10)
45#define GFC_RANK_DIGITS2 1
46#define GFC_RANK_PRINTF_FORMAT"%02d" "%01d"
47#elif (GFC_MAX_DIMENSIONS15 < 100)
48#define GFC_RANK_DIGITS2 2
49#define GFC_RANK_PRINTF_FORMAT"%02d" "%02d"
50#else
51#error If you really need >99 dimensions, continue the sequence above...
52#endif

54/* array of structs so we don't have to worry about xmalloc or free */
55CInteropKind_t c_interop_kinds_table[ISOCBINDING_NUMBER];

57tree gfc_array_index_type;
58tree gfc_array_range_type;
59tree gfc_character1_type_node;
60tree pvoid_type_node;
61tree prvoid_type_node;
62tree ppvoid_type_node;
63tree pchar_type_node;
64tree pfunc_type_node;

66tree logical_type_node;
67tree logical_true_node;
68tree logical_false_node;
69tree gfc_charlen_type_node;

71tree gfc_float128_type_node = NULL_TREE(tree) __null;
72tree gfc_complex_float128_type_node = NULL_TREE(tree) __null;

74bool gfc_real16_is_float128 = false;

76static GTY(()) tree gfc_desc_dim_type;
77static GTY(()) tree gfc_max_array_element_size;
78static GTY(()) tree gfc_array_descriptor_base[2 * (GFC_MAX_DIMENSIONS15+1)];
79static GTY(()) tree gfc_array_descriptor_base_caf[2 * (GFC_MAX_DIMENSIONS15+1)];

81/* Arrays for all integral and real kinds.  We'll fill this in at runtime
 after the target has a chance to process command-line options.  */

84#define MAX_INT_KINDS5 5
85gfc_integer_info gfc_integer_kinds[MAX_INT_KINDS5 + 1];
86gfc_logical_info gfc_logical_kinds[MAX_INT_KINDS5 + 1];
87static GTY(()) tree gfc_integer_types[MAX_INT_KINDS5 + 1];
88static GTY(()) tree gfc_logical_types[MAX_INT_KINDS5 + 1];

90#define MAX_REAL_KINDS5 5
91gfc_real_info gfc_real_kinds[MAX_REAL_KINDS5 + 1];
92static GTY(()) tree gfc_real_types[MAX_REAL_KINDS5 + 1];
93static GTY(()) tree gfc_complex_types[MAX_REAL_KINDS5 + 1];

95#define MAX_CHARACTER_KINDS2 2
96gfc_character_info gfc_character_kinds[MAX_CHARACTER_KINDS2 + 1];
97static GTY(()) tree gfc_character_types[MAX_CHARACTER_KINDS2 + 1];
98static GTY(()) tree gfc_pcharacter_types[MAX_CHARACTER_KINDS2 + 1];

100static tree gfc_add_field_to_struct_1 (tree, tree, tree, tree **);

102/* The integer kind to use for array indices.  This will be set to the
 proper value based on target information from the backend.  */

105int gfc_index_integer_kind;

107/* The default kinds of the various types.  */

109int gfc_default_integer_kind;
110int gfc_max_integer_kind;
111int gfc_default_real_kind;
112int gfc_default_double_kind;
113int gfc_default_character_kind;
114int gfc_default_logical_kind;
115int gfc_default_complex_kind;
116int gfc_c_int_kind;
117int gfc_atomic_int_kind;
118int gfc_atomic_logical_kind;

120/* The kind size used for record offsets. If the target system supports
 kind=8, this will be set to 8, otherwise it is set to 4.  */
122int gfc_intio_kind;

124/* The integer kind used to store character lengths.  */
125int gfc_charlen_int_kind;

127/* Kind of internal integer for storing object sizes.  */
128int gfc_size_kind;

130/* The size of the numeric storage unit and character storage unit.  */
131int gfc_numeric_storage_size;
132int gfc_character_storage_size;

134tree dtype_type_node = NULL_TREE(tree) __null;


137/* Build the dtype_type_node if necessary.  */
138tree get_dtype_type_node (void)
139{
tree field;
tree dtype_node;
tree *dtype_chain = NULL__null;

if (dtype_type_node == NULL_TREE(tree) __null)
  {
    dtype_node = make_node (RECORD_TYPE);
    TYPE_NAME (dtype_node)((tree_class_check ((dtype_node), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 147, __FUNCTION__))->type_common.name) = get_identifier ("dtype_type")(__builtin_constant_p ("dtype_type") ? get_identifier_with_length
 (("dtype_type"), strlen ("dtype_type")) : get_identifier ("dtype_type"
));
    TYPE_NAMELESS (dtype_node)((tree_class_check ((dtype_node), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 148, __FUNCTION__))->base.u.bits.nameless_flag) = 1;
    field = gfc_add_field_to_struct_1 (dtype_node,
			 get_identifier ("elem_len")(__builtin_constant_p ("elem_len") ? get_identifier_with_length
 (("elem_len"), strlen ("elem_len")) : get_identifier ("elem_len"
)),
			 size_type_nodeglobal_trees[TI_SIZE_TYPE], &dtype_chain);
    TREE_NO_WARNING (field)((field)->base.nowarning_flag) = 1;
    field = gfc_add_field_to_struct_1 (dtype_node,
			 get_identifier ("version")(__builtin_constant_p ("version") ? get_identifier_with_length
 (("version"), strlen ("version")) : get_identifier ("version"
)),
			 integer_type_nodeinteger_types[itk_int], &dtype_chain);
    TREE_NO_WARNING (field)((field)->base.nowarning_flag) = 1;
    field = gfc_add_field_to_struct_1 (dtype_node,
			 get_identifier ("rank")(__builtin_constant_p ("rank") ? get_identifier_with_length (
("rank"), strlen ("rank")) : get_identifier ("rank")),
			 signed_char_type_nodeinteger_types[itk_signed_char], &dtype_chain);
    TREE_NO_WARNING (field)((field)->base.nowarning_flag) = 1;
    field = gfc_add_field_to_struct_1 (dtype_node,
			 get_identifier ("type")(__builtin_constant_p ("type") ? get_identifier_with_length (
("type"), strlen ("type")) : get_identifier ("type")),
			 signed_char_type_nodeinteger_types[itk_signed_char], &dtype_chain);
    TREE_NO_WARNING (field)((field)->base.nowarning_flag) = 1;
    field = gfc_add_field_to_struct_1 (dtype_node,
			 get_identifier ("attribute")(__builtin_constant_p ("attribute") ? get_identifier_with_length
 (("attribute"), strlen ("attribute")) : get_identifier ("attribute"
)),
			 short_integer_type_nodeinteger_types[itk_short], &dtype_chain);
    TREE_NO_WARNING (field)((field)->base.nowarning_flag) = 1;
    gfc_finish_type (dtype_node);
    TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (dtype_node))((tree_check (((((contains_struct_check (((tree_class_check (
(dtype_node), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 170, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 170, __FUNCTION__))->common.chain))), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 170, __FUNCTION__, (TYPE_DECL)))->decl_common.decl_flag_1
) = 1;
    dtype_type_node = dtype_node;
  }
return dtype_type_node;
174}

176bool
177gfc_check_any_c_kind (gfc_typespec *ts)
178{
int i;

for (i = 0; i < ISOCBINDING_NUMBER; i++)
  {
    /* Check for any C interoperable kind for the given type/kind in ts.
       This can be used after verify_c_interop to make sure that the
       Fortran kind being used exists in at least some form for C.  */
    if (c_interop_kinds_table[i].f90_type == ts->type &&
        c_interop_kinds_table[i].value == ts->kind)
      return true;
  }

return false;
192}


195static int
196get_real_kind_from_node (tree type)
197{
int i;

for (i = 0; gfc_real_kinds[i].kind != 0; i++)
  if (gfc_real_kinds[i].mode_precision == TYPE_PRECISION (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 201, __FUNCTION__))->type_common.precision))
    return gfc_real_kinds[i].kind;

return -4;
205}

207static int
208get_int_kind_from_node (tree type)
209{
int i;

if (!type)
  return -2;

for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
  if (gfc_integer_kinds[i].bit_size == TYPE_PRECISION (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 216, __FUNCTION__))->type_common.precision))
    return gfc_integer_kinds[i].kind;

return -1;
220}

222static int
223get_int_kind_from_name (const char *name)
224{
return get_int_kind_from_node (get_typenode_from_name (name));
226}


229/* Get the kind number corresponding to an integer of given size,
 following the required return values for ISO_FORTRAN_ENV INT* constants:
 -2 is returned if we support a kind of larger size, -1 otherwise.  */
232int
233gfc_get_int_kind_from_width_isofortranenv (int size)
234{
int i;

/* Look for a kind with matching storage size.  */
for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
  if (gfc_integer_kinds[i].bit_size == size)
    return gfc_integer_kinds[i].kind;

/* Look for a kind with larger storage size.  */
for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
  if (gfc_integer_kinds[i].bit_size > size)
    return -2;

return -1;
248}


251/* Get the kind number corresponding to a real of a given storage size.
 If two real's have the same storage size, then choose the real with
 the largest precision.  If a kind type is unavailable and a real
 exists with wider storage, then return -2; otherwise, return -1.  */

256int
257gfc_get_real_kind_from_width_isofortranenv (int size)
258{
int digits, i, kind;

size /= 8;

kind = -1;
digits = 0;

/* Look for a kind with matching storage size.  */
for (i = 0; gfc_real_kinds[i].kind != 0; i++)
  if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds[i].kind)) == size)
    {
if (gfc_real_kinds[i].digits > digits)
 {
   digits = gfc_real_kinds[i].digits;
   kind = gfc_real_kinds[i].kind;
 }
    }

if (kind != -1)
  return kind;

/* Look for a kind with larger storage size.  */
for (i = 0; gfc_real_kinds[i].kind != 0; i++)
  if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds[i].kind)) > size)
    kind = -2;

return kind;
286}



290static int
291get_int_kind_from_width (int size)
292{
int i;

for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
  if (gfc_integer_kinds[i].bit_size == size)
    return gfc_integer_kinds[i].kind;

return -2;
300}

302static int
303get_int_kind_from_minimal_width (int size)
304{
int i;

for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
  if (gfc_integer_kinds[i].bit_size >= size)
    return gfc_integer_kinds[i].kind;

return -2;
312}


315/* Generate the CInteropKind_t objects for the C interoperable
 kinds.  */

318void
319gfc_init_c_interop_kinds (void)
320{
int i;

/* init all pointers in the list to NULL */
for (i = 0; i < ISOCBINDING_NUMBER; i++)
  {
    /* Initialize the name and value fields.  */
    c_interop_kinds_table[i].name[0] = '\0';
    c_interop_kinds_table[i].value = -100;
    c_interop_kinds_table[i].f90_type = BT_UNKNOWN;
  }

332#define NAMED_INTCST(a,b,c,d) \
strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
c_interop_kinds_table[a].f90_type = BT_INTEGER; \
c_interop_kinds_table[a].value = c;
336#define NAMED_REALCST(a,b,c,d) \
strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
c_interop_kinds_table[a].f90_type = BT_REAL; \
c_interop_kinds_table[a].value = c;
340#define NAMED_CMPXCST(a,b,c,d) \
strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
c_interop_kinds_table[a].f90_type = BT_COMPLEX; \
c_interop_kinds_table[a].value = c;
344#define NAMED_LOGCST(a,b,c) \
strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
c_interop_kinds_table[a].f90_type = BT_LOGICAL; \
c_interop_kinds_table[a].value = c;
348#define NAMED_CHARKNDCST(a,b,c) \
strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
c_interop_kinds_table[a].f90_type = BT_CHARACTER; \
c_interop_kinds_table[a].value = c;
352#define NAMED_CHARCST(a,b,c) \
strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
c_interop_kinds_table[a].f90_type = BT_CHARACTER; \
c_interop_kinds_table[a].value = c;
356#define DERIVED_TYPE(a,b,c) \
strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
c_interop_kinds_table[a].f90_type = BT_DERIVED; \
c_interop_kinds_table[a].value = c;
360#define NAMED_FUNCTION(a,b,c,d) \
strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
c_interop_kinds_table[a].f90_type = BT_PROCEDURE; \
c_interop_kinds_table[a].value = c;
364#define NAMED_SUBROUTINE(a,b,c,d) \
strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
c_interop_kinds_table[a].f90_type = BT_PROCEDURE; \
c_interop_kinds_table[a].value = c;
368#include "iso-c-binding.def"
369}


372/* Query the target to determine which machine modes are available for
 computation.  Choose KIND numbers for them.  */

375void
376gfc_init_kinds (void)
377{
opt_scalar_int_mode int_mode_iter;
opt_scalar_float_mode float_mode_iter;
int i_index, r_index, kind;
bool saw_i4 = false, saw_i8 = false;
bool saw_r4 = false, saw_r8 = false, saw_r10 = false, saw_r16 = false;

i_index = 0;
FOR_EACH_MODE_IN_CLASS (int_mode_iter, MODE_INT)for (mode_iterator::start (&(int_mode_iter), MODE_INT); mode_iterator
::iterate_p (&(int_mode_iter)); mode_iterator::get_wider (
&(int_mode_iter)))
  {
    scalar_int_mode mode = int_mode_iter.require ();
    int kind, bitsize;

    if (!targetm.scalar_mode_supported_p (mode))
continue;

    /* The middle end doesn't support constants larger than 2*HWI.
Perhaps the target hook shouldn't have accepted these either,
but just to be safe...  */
    bitsize = GET_MODE_BITSIZE (mode);
    if (bitsize > 2*HOST_BITS_PER_WIDE_INT64)
continue;

    gcc_assert (i_index != MAX_INT_KINDS)((void)(!(i_index != 5) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 400, __FUNCTION__), 0 : 0));

    /* Let the kind equal the bit size divided by 8.  This insulates the
programmer from the underlying byte size.  */
    kind = bitsize / 8;

    if (kind == 4)
saw_i4 = true;
    if (kind == 8)
saw_i8 = true;

    gfc_integer_kinds[i_index].kind = kind;
    gfc_integer_kinds[i_index].radix = 2;
    gfc_integer_kinds[i_index].digits = bitsize - 1;
    gfc_integer_kinds[i_index].bit_size = bitsize;

    gfc_logical_kinds[i_index].kind = kind;
    gfc_logical_kinds[i_index].bit_size = bitsize;

    i_index += 1;
  }

/* Set the kind used to match GFC_INT_IO in libgfortran.  This is
   used for large file access.  */

if (saw_i8)
  gfc_intio_kind = 8;
else
  gfc_intio_kind = 4;

/* If we do not at least have kind = 4, everything is pointless.  */
gcc_assert(saw_i4)((void)(!(saw_i4) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 431, __FUNCTION__), 0 : 0));

/* Set the maximum integer kind.  Used with at least BOZ constants.  */
gfc_max_integer_kind = gfc_integer_kinds[i_index - 1].kind;

r_index = 0;
FOR_EACH_MODE_IN_CLASS (float_mode_iter, MODE_FLOAT)for (mode_iterator::start (&(float_mode_iter), MODE_FLOAT
); mode_iterator::iterate_p (&(float_mode_iter)); mode_iterator
::get_wider (&(float_mode_iter)))
  {
    scalar_float_mode mode = float_mode_iter.require ();
    const struct real_format *fmt = REAL_MODE_FORMAT (mode)(real_format_for_mode[(((enum mode_class) mode_class[mode]) ==
 MODE_DECIMAL_FLOAT) ? (((mode) - MIN_MODE_DECIMAL_FLOAT) + (
MAX_MODE_FLOAT - MIN_MODE_FLOAT + 1)) : ((enum mode_class) mode_class
[mode]) == MODE_FLOAT ? ((mode) - MIN_MODE_FLOAT) : ((fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 440, __FUNCTION__)), 0)]);
    int kind;

    if (fmt == NULL__null)
continue;
    if (!targetm.scalar_mode_supported_p (mode))
continue;

    /* Only let float, double, long double and __float128 go through.
Runtime support for others is not provided, so they would be
useless.  */
    if (!targetm.libgcc_floating_mode_supported_p (mode))
continue;
    if (mode != TYPE_MODE (float_type_node)((((enum tree_code) ((tree_class_check ((global_trees[TI_FLOAT_TYPE
]), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 453, __FUNCTION__)))->base.code) == VECTOR_TYPE) ? vector_type_mode
 (global_trees[TI_FLOAT_TYPE]) : (global_trees[TI_FLOAT_TYPE]
)->type_common.mode)
   && (mode != TYPE_MODE (double_type_node)((((enum tree_code) ((tree_class_check ((global_trees[TI_DOUBLE_TYPE
]), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 454, __FUNCTION__)))->base.code) == VECTOR_TYPE) ? vector_type_mode
 (global_trees[TI_DOUBLE_TYPE]) : (global_trees[TI_DOUBLE_TYPE
])->type_common.mode))
   && (mode != TYPE_MODE (long_double_type_node)((((enum tree_code) ((tree_class_check ((global_trees[TI_LONG_DOUBLE_TYPE
]), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 455, __FUNCTION__)))->base.code) == VECTOR_TYPE) ? vector_type_mode
 (global_trees[TI_LONG_DOUBLE_TYPE]) : (global_trees[TI_LONG_DOUBLE_TYPE
])->type_common.mode))
456#if defined(HAVE_TFmode) && defined(ENABLE_LIBQUADMATH_SUPPORT1)
   && (mode != TFmode(scalar_float_mode ((scalar_float_mode::from_int) E_TFmode)))
458#endif
  )
continue;

    /* Let the kind equal the precision divided by 8, rounding up.  Again,
this insulates the programmer from the underlying byte size.

Also, it effectively deals with IEEE extended formats.  There, the
total size of the type may equal 16, but it's got 6 bytes of padding
and the increased size can get in the way of a real IEEE quad format
which may also be supported by the target.

We round up so as to handle IA-64 __floatreg (RFmode), which is an
82 bit type.  Not to be confused with __float80 (XFmode), which is
an 80 bit type also supported by IA-64.  So XFmode should come out
to be kind=10, and RFmode should come out to be kind=11.  Egads.  */

    kind = (GET_MODE_PRECISION (mode) + 7) / 8;

    if (kind == 4)
saw_r4 = true;
    if (kind == 8)
saw_r8 = true;
    if (kind == 10)
saw_r10 = true;
    if (kind == 16)
saw_r16 = true;

    /* Careful we don't stumble a weird internal mode.  */
    gcc_assert (r_index <= 0 || gfc_real_kinds[r_index-1].kind != kind)((void)(!(r_index <= 0 || gfc_real_kinds[r_index-1].kind !=
 kind) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 487, __FUNCTION__), 0 : 0));
    /* Or have too many modes for the allocated space.  */
    gcc_assert (r_index != MAX_REAL_KINDS)((void)(!(r_index != 5) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 489, __FUNCTION__), 0 : 0));

    gfc_real_kinds[r_index].kind = kind;
    gfc_real_kinds[r_index].radix = fmt->b;
    gfc_real_kinds[r_index].digits = fmt->p;
    gfc_real_kinds[r_index].min_exponent = fmt->emin;
    gfc_real_kinds[r_index].max_exponent = fmt->emax;
    if (fmt->pnan < fmt->p)
/* This is an IBM extended double format (or the MIPS variant)
  made up of two IEEE doubles.  The value of the long double is
  the sum of the values of the two parts.  The most significant
  part is required to be the value of the long double rounded
  to the nearest double.  If we use emax of 1024 then we can't
  represent huge(x) = (1 - b**(-p)) * b**(emax-1) * b, because
  rounding will make the most significant part overflow.  */
gfc_real_kinds[r_index].max_exponent = fmt->emax - 1;
    gfc_real_kinds[r_index].mode_precision = GET_MODE_PRECISION (mode);
    r_index += 1;
  }

/* Choose the default integer kind.  We choose 4 unless the user directs us
   otherwise.  Even if the user specified that the default integer kind is 8,
   the numeric storage size is not 64 bits.  In this case, a warning will be
   issued when NUMERIC_STORAGE_SIZE is used.  Set NUMERIC_STORAGE_SIZE to 32.  */

gfc_numeric_storage_size = 4 * 8;

if (flag_default_integerglobal_options.x_flag_default_integer)
  {
    if (!saw_i8)
gfc_fatal_error ("INTEGER(KIND=8) is not available for "
	 "%<-fdefault-integer-8%> option");

    gfc_default_integer_kind = 8;

  }
else if (flag_integer4_kindglobal_options.x_flag_integer4_kind == 8)
  {
    if (!saw_i8)
gfc_fatal_error ("INTEGER(KIND=8) is not available for "
	 "%<-finteger-4-integer-8%> option");

    gfc_default_integer_kind = 8;
  }
else if (saw_i4)
  {
    gfc_default_integer_kind = 4;
  }
else
  {
    gfc_default_integer_kind = gfc_integer_kinds[i_index - 1].kind;
    gfc_numeric_storage_size = gfc_integer_kinds[i_index - 1].bit_size;
  }

/* Choose the default real kind.  Again, we choose 4 when possible.  */
if (flag_default_real_8global_options.x_flag_default_real_8)
  {
    if (!saw_r8)
gfc_fatal_error ("REAL(KIND=8) is not available for "
	 "%<-fdefault-real-8%> option");

    gfc_default_real_kind = 8;
  }
else if (flag_default_real_10global_options.x_flag_default_real_10)
{
  if (!saw_r10)
    gfc_fatal_error ("REAL(KIND=10) is not available for "
	"%<-fdefault-real-10%> option");

  gfc_default_real_kind = 10;
}
else if (flag_default_real_16global_options.x_flag_default_real_16)
{
  if (!saw_r16)
    gfc_fatal_error ("REAL(KIND=16) is not available for "
	"%<-fdefault-real-16%> option");

  gfc_default_real_kind = 16;
}
else if (flag_real4_kindglobal_options.x_flag_real4_kind == 8)
{
  if (!saw_r8)
    gfc_fatal_error ("REAL(KIND=8) is not available for %<-freal-4-real-8%> "
       "option");

  gfc_default_real_kind = 8;
}
else if (flag_real4_kindglobal_options.x_flag_real4_kind == 10)
{
  if (!saw_r10)
    gfc_fatal_error ("REAL(KIND=10) is not available for "
       "%<-freal-4-real-10%> option");

  gfc_default_real_kind = 10;
}
else if (flag_real4_kindglobal_options.x_flag_real4_kind == 16)
{
  if (!saw_r16)
    gfc_fatal_error ("REAL(KIND=16) is not available for "
       "%<-freal-4-real-16%> option");

  gfc_default_real_kind = 16;
}
else if (saw_r4)
  gfc_default_real_kind = 4;
else
  gfc_default_real_kind = gfc_real_kinds[0].kind;

/* Choose the default double kind.  If -fdefault-real and -fdefault-double
   are specified, we use kind=8, if it's available.  If -fdefault-real is
   specified without -fdefault-double, we use kind=16, if it's available.
   Otherwise we do not change anything.  */
if (flag_default_doubleglobal_options.x_flag_default_double && saw_r8)
  gfc_default_double_kind = 8;
else if (flag_default_real_8global_options.x_flag_default_real_8 || flag_default_real_10global_options.x_flag_default_real_10 || flag_default_real_16global_options.x_flag_default_real_16)
  {
    /* Use largest available kind.  */
    if (saw_r16)
gfc_default_double_kind = 16;
    else if (saw_r10)
gfc_default_double_kind = 10;
    else if (saw_r8)
gfc_default_double_kind = 8;
    else
gfc_default_double_kind = gfc_default_real_kind;
  }
else if (flag_real8_kindglobal_options.x_flag_real8_kind == 4)
  {
    if (!saw_r4)
gfc_fatal_error ("REAL(KIND=4) is not available for "
	 "%<-freal-8-real-4%> option");

    gfc_default_double_kind = 4;
  }
else if (flag_real8_kindglobal_options.x_flag_real8_kind == 10 )
  {
    if (!saw_r10)
gfc_fatal_error ("REAL(KIND=10) is not available for "
	 "%<-freal-8-real-10%> option");

    gfc_default_double_kind = 10;
  }
else if (flag_real8_kindglobal_options.x_flag_real8_kind == 16 )
  {
    if (!saw_r16)
gfc_fatal_error ("REAL(KIND=10) is not available for "
	 "%<-freal-8-real-16%> option");

    gfc_default_double_kind = 16;
  }
else if (saw_r4 && saw_r8)
  gfc_default_double_kind = 8;
else
  {
    /* F95 14.6.3.1: A nonpointer scalar object of type double precision
real ... occupies two contiguous numeric storage units.

Therefore we must be supplied a kind twice as large as we chose
for single precision.  There are loopholes, in that double
precision must *occupy* two storage units, though it doesn't have
to *use* two storage units.  Which means that you can make this
kind artificially wide by padding it.  But at present there are
no GCC targets for which a two-word type does not exist, so we
just let gfc_validate_kind abort and tell us if something breaks.  */

    gfc_default_double_kind
= gfc_validate_kind (BT_REAL, gfc_default_real_kind * 2, false);
  }

/* The default logical kind is constrained to be the same as the
   default integer kind.  Similarly with complex and real.  */
gfc_default_logical_kind = gfc_default_integer_kind;
gfc_default_complex_kind = gfc_default_real_kind;

/* We only have two character kinds: ASCII and UCS-4.
   ASCII corresponds to a 8-bit integer type, if one is available.
   UCS-4 corresponds to a 32-bit integer type, if one is available.  */
i_index = 0;
if ((kind = get_int_kind_from_width (8)) > 0)
  {
    gfc_character_kinds[i_index].kind = kind;
    gfc_character_kinds[i_index].bit_size = 8;
    gfc_character_kinds[i_index].name = "ascii";
    i_index++;
  }
if ((kind = get_int_kind_from_width (32)) > 0)
  {
    gfc_character_kinds[i_index].kind = kind;
    gfc_character_kinds[i_index].bit_size = 32;
    gfc_character_kinds[i_index].name = "iso_10646";
    i_index++;
  }

/* Choose the smallest integer kind for our default character.  */
gfc_default_character_kind = gfc_character_kinds[0].kind;
gfc_character_storage_size = gfc_default_character_kind * 8;

gfc_index_integer_kind = get_int_kind_from_name (PTRDIFF_TYPE(((global_options.x_ix86_isa_flags & (1UL << 4)) !=
 0) ? "long int" : "int"));

/* Pick a kind the same size as the C "int" type.  */
gfc_c_int_kind = INT_TYPE_SIZE32 / 8;

/* Choose atomic kinds to match C's int.  */
gfc_atomic_int_kind = gfc_c_int_kind;
gfc_atomic_logical_kind = gfc_c_int_kind;
694}


697/* Make sure that a valid kind is present.  Returns an index into the
 associated kinds array, -1 if the kind is not present.  */

700static int
701validate_integer (int kind)
702{
int i;

for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
  if (gfc_integer_kinds[i].kind == kind)
    return i;

return -1;
710}

712static int
713validate_real (int kind)
714{
int i;

for (i = 0; gfc_real_kinds[i].kind != 0; i++)
  if (gfc_real_kinds[i].kind == kind)
    return i;

return -1;
722}

724static int
725validate_logical (int kind)
726{
int i;

for (i = 0; gfc_logical_kinds[i].kind; i++)
  if (gfc_logical_kinds[i].kind == kind)
    return i;

return -1;
734}

736static int
737validate_character (int kind)
738{
int i;

for (i = 0; gfc_character_kinds[i].kind; i++)
  if (gfc_character_kinds[i].kind == kind)
    return i;

return -1;
746}

748/* Validate a kind given a basic type.  The return value is the same
 for the child functions, with -1 indicating nonexistence of the
 type.  If MAY_FAIL is false, then -1 is never returned, and we ICE.  */

752int
753gfc_validate_kind (bt type, int kind, bool may_fail)
754{
int rc;

switch (type)
  {
  case BT_REAL:		/* Fall through */
  case BT_COMPLEX:
    rc = validate_real (kind);
    break;
  case BT_INTEGER:
    rc = validate_integer (kind);
    break;
  case BT_LOGICAL:
    rc = validate_logical (kind);
    break;
  case BT_CHARACTER:
    rc = validate_character (kind);
    break;

  default:
    gfc_internal_error ("gfc_validate_kind(): Got bad type");
  }

if (rc < 0 && !may_fail)
  gfc_internal_error ("gfc_validate_kind(): Got bad kind");

return rc;
781}


784/* Four subroutines of gfc_init_types.  Create type nodes for the given kind.
 Reuse common type nodes where possible.  Recognize if the kind matches up
 with a C type.  This will be used later in determining which routines may
 be scarfed from libm.  */

789static tree
790gfc_build_int_type (gfc_integer_info *info)
791{
int mode_precision = info->bit_size;

if (mode_precision == CHAR_TYPE_SIZE(8))
  info->c_char = 1;
if (mode_precision == SHORT_TYPE_SIZE16)
  info->c_short = 1;
if (mode_precision == INT_TYPE_SIZE32)
  info->c_int = 1;
if (mode_precision == LONG_TYPE_SIZE(((global_options.x_ix86_isa_flags & (1UL << 58)) !=
 0) ? 32 : ((8) * (((global_options.x_ix86_isa_flags & (1UL
 << 1)) != 0) ? 8 : 4))))
  info->c_long = 1;
if (mode_precision == LONG_LONG_TYPE_SIZE64)
  info->c_long_long = 1;

if (TYPE_PRECISION (intQI_type_node)((tree_class_check ((global_trees[TI_INTQI_TYPE]), (tcc_type)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 805, __FUNCTION__))->type_common.precision) == mode_precision)
  return intQI_type_nodeglobal_trees[TI_INTQI_TYPE];
if (TYPE_PRECISION (intHI_type_node)((tree_class_check ((global_trees[TI_INTHI_TYPE]), (tcc_type)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 807, __FUNCTION__))->type_common.precision) == mode_precision)
  return intHI_type_nodeglobal_trees[TI_INTHI_TYPE];
if (TYPE_PRECISION (intSI_type_node)((tree_class_check ((global_trees[TI_INTSI_TYPE]), (tcc_type)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 809, __FUNCTION__))->type_common.precision) == mode_precision)
  return intSI_type_nodeglobal_trees[TI_INTSI_TYPE];
if (TYPE_PRECISION (intDI_type_node)((tree_class_check ((global_trees[TI_INTDI_TYPE]), (tcc_type)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 811, __FUNCTION__))->type_common.precision) == mode_precision)
  return intDI_type_nodeglobal_trees[TI_INTDI_TYPE];
if (TYPE_PRECISION (intTI_type_node)((tree_class_check ((global_trees[TI_INTTI_TYPE]), (tcc_type)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 813, __FUNCTION__))->type_common.precision) == mode_precision)
  return intTI_type_nodeglobal_trees[TI_INTTI_TYPE];

return make_signed_type (mode_precision);
817}

819tree
820gfc_build_uint_type (int size)
821{
if (size == CHAR_TYPE_SIZE(8))
  return unsigned_char_type_nodeinteger_types[itk_unsigned_char];
if (size == SHORT_TYPE_SIZE16)
  return short_unsigned_type_nodeinteger_types[itk_unsigned_short];
if (size == INT_TYPE_SIZE32)
  return unsigned_type_nodeinteger_types[itk_unsigned_int];
if (size == LONG_TYPE_SIZE(((global_options.x_ix86_isa_flags & (1UL << 58)) !=
 0) ? 32 : ((8) * (((global_options.x_ix86_isa_flags & (1UL
 << 1)) != 0) ? 8 : 4))))
  return long_unsigned_type_nodeinteger_types[itk_unsigned_long];
if (size == LONG_LONG_TYPE_SIZE64)
  return long_long_unsigned_type_nodeinteger_types[itk_unsigned_long_long];

return make_unsigned_type (size);
834}


837static tree
838gfc_build_real_type (gfc_real_info *info)
839{
int mode_precision = info->mode_precision;
tree new_type;

if (mode_precision == FLOAT_TYPE_SIZE32)
  info->c_float = 1;
if (mode_precision == DOUBLE_TYPE_SIZE64)
  info->c_double = 1;
if (mode_precision == LONG_DOUBLE_TYPE_SIZE(((global_options.x_target_flags & (1U << 17)) != 0
) ? 64 : (((global_options.x_target_flags & (1U << 16
)) != 0) ? 128 : 80)))
  info->c_long_double = 1;
if (mode_precision != LONG_DOUBLE_TYPE_SIZE(((global_options.x_target_flags & (1U << 17)) != 0
) ? 64 : (((global_options.x_target_flags & (1U << 16
)) != 0) ? 128 : 80)) && mode_precision == 128)
  {
    info->c_float128 = 1;
    gfc_real16_is_float128 = true;
  }

if (TYPE_PRECISION (float_type_node)((tree_class_check ((global_trees[TI_FLOAT_TYPE]), (tcc_type)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 855, __FUNCTION__))->type_common.precision) == mode_precision)
  return float_type_nodeglobal_trees[TI_FLOAT_TYPE];
if (TYPE_PRECISION (double_type_node)((tree_class_check ((global_trees[TI_DOUBLE_TYPE]), (tcc_type
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 857, __FUNCTION__))->type_common.precision) == mode_precision)
  return double_type_nodeglobal_trees[TI_DOUBLE_TYPE];
if (TYPE_PRECISION (long_double_type_node)((tree_class_check ((global_trees[TI_LONG_DOUBLE_TYPE]), (tcc_type
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 859, __FUNCTION__))->type_common.precision) == mode_precision)
  return long_double_type_nodeglobal_trees[TI_LONG_DOUBLE_TYPE];

new_type = make_node (REAL_TYPE);
TYPE_PRECISION (new_type)((tree_class_check ((new_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 863, __FUNCTION__))->type_common.precision) = mode_precision;
layout_type (new_type);
return new_type;
866}

868static tree
869gfc_build_complex_type (tree scalar_type)
870{
tree new_type;

if (scalar_type == NULL__null)
  return NULL__null;
if (scalar_type == float_type_nodeglobal_trees[TI_FLOAT_TYPE])
  return complex_float_type_nodeglobal_trees[TI_COMPLEX_FLOAT_TYPE];
if (scalar_type == double_type_nodeglobal_trees[TI_DOUBLE_TYPE])
  return complex_double_type_nodeglobal_trees[TI_COMPLEX_DOUBLE_TYPE];
if (scalar_type == long_double_type_nodeglobal_trees[TI_LONG_DOUBLE_TYPE])
  return complex_long_double_type_nodeglobal_trees[TI_COMPLEX_LONG_DOUBLE_TYPE];

new_type = make_node (COMPLEX_TYPE);
TREE_TYPE (new_type)((contains_struct_check ((new_type), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 883, __FUNCTION__))->typed.type) = scalar_type;
layout_type (new_type);
return new_type;
886}

888static tree
889gfc_build_logical_type (gfc_logical_info *info)
890{
int bit_size = info->bit_size;
tree new_type;

if (bit_size == BOOL_TYPE_SIZE(8))
  {
    info->c_bool = 1;
    return boolean_type_nodeglobal_trees[TI_BOOLEAN_TYPE];
  }

new_type = make_unsigned_type (bit_size);
TREE_SET_CODE (new_type, BOOLEAN_TYPE)((new_type)->base.code = (BOOLEAN_TYPE));
TYPE_MAX_VALUE (new_type)((tree_check5 ((new_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 902, __FUNCTION__, (INTEGER_TYPE), (ENUMERAL_TYPE), (BOOLEAN_TYPE
), (REAL_TYPE), (FIXED_POINT_TYPE)))->type_non_common.maxval
) = build_int_cst (new_type, 1);
TYPE_PRECISION (new_type)((tree_class_check ((new_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 903, __FUNCTION__))->type_common.precision) = 1;

return new_type;
906}


909/* Create the backend type nodes. We map them to their
 equivalent C type, at least for now.  We also give
 names to the types here, and we push them in the
 global binding level context.*/

914void
915gfc_init_types (void)
916{
char name_buf[26];
int index;
tree type;
unsigned n;

/* Create and name the types.  */
923#define PUSH_TYPE(name, node) \
pushdecl (build_decl (input_location, \
	TYPE_DECL, get_identifier (name)(__builtin_constant_p (name) ? get_identifier_with_length ((name
), strlen (name)) : get_identifier (name)), node))

for (index = 0; gfc_integer_kinds[index].kind != 0; ++index)
  {
    type = gfc_build_int_type (&gfc_integer_kinds[index]);
    /* Ensure integer(kind=1) doesn't have TYPE_STRING_FLAG set.  */
    if (TYPE_STRING_FLAG (type)((tree_check2 ((type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 931, __FUNCTION__, (ARRAY_TYPE), (INTEGER_TYPE)))->type_common
.string_flag))
type = make_signed_type (gfc_integer_kinds[index].bit_size);
    gfc_integer_types[index] = type;
    snprintf (name_buf, sizeof(name_buf), "integer(kind=%d)",
gfc_integer_kinds[index].kind);
    PUSH_TYPE (name_buf, type);
  }

for (index = 0; gfc_logical_kinds[index].kind != 0; ++index)
  {
    type = gfc_build_logical_type (&gfc_logical_kinds[index]);
    gfc_logical_types[index] = type;
    snprintf (name_buf, sizeof(name_buf), "logical(kind=%d)",
gfc_logical_kinds[index].kind);
    PUSH_TYPE (name_buf, type);
  }

for (index = 0; gfc_real_kinds[index].kind != 0; index++)
  {
    type = gfc_build_real_type (&gfc_real_kinds[index]);
    gfc_real_types[index] = type;
    snprintf (name_buf, sizeof(name_buf), "real(kind=%d)",
gfc_real_kinds[index].kind);
    PUSH_TYPE (name_buf, type);

    if (gfc_real_kinds[index].c_float128)
gfc_float128_type_node = type;

    type = gfc_build_complex_type (type);
    gfc_complex_types[index] = type;
    snprintf (name_buf, sizeof(name_buf), "complex(kind=%d)",
gfc_real_kinds[index].kind);
    PUSH_TYPE (name_buf, type);

    if (gfc_real_kinds[index].c_float128)
gfc_complex_float128_type_node = type;
  }

for (index = 0; gfc_character_kinds[index].kind != 0; ++index)
  {
    type = gfc_build_uint_type (gfc_character_kinds[index].bit_size);
    type = build_qualified_type (type, TYPE_UNQUALIFIED);
    snprintf (name_buf, sizeof(name_buf), "character(kind=%d)",
gfc_character_kinds[index].kind);
    PUSH_TYPE (name_buf, type);
    gfc_character_types[index] = type;
    gfc_pcharacter_types[index] = build_pointer_type (type);
  }
gfc_character1_type_node = gfc_character_types[0];

PUSH_TYPE ("byte", unsigned_char_type_nodeinteger_types[itk_unsigned_char]);
PUSH_TYPE ("void", void_type_nodeglobal_trees[TI_VOID_TYPE]);

/* DBX debugging output gets upset if these aren't set.  */
if (!TYPE_NAME (integer_type_node)((tree_class_check ((integer_types[itk_int]), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 985, __FUNCTION__))->type_common.name))
  PUSH_TYPE ("c_integer", integer_type_nodeinteger_types[itk_int]);
if (!TYPE_NAME (char_type_node)((tree_class_check ((integer_types[itk_char]), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 987, __FUNCTION__))->type_common.name))
  PUSH_TYPE ("c_char", char_type_nodeinteger_types[itk_char]);

990#undef PUSH_TYPE

pvoid_type_node = build_pointer_type (void_type_nodeglobal_trees[TI_VOID_TYPE]);
prvoid_type_node = build_qualified_type (pvoid_type_node, TYPE_QUAL_RESTRICT);
ppvoid_type_node = build_pointer_type (pvoid_type_node);
pchar_type_node = build_pointer_type (gfc_character1_type_node);
pfunc_type_node
  = build_pointer_type (build_function_type_list (void_type_nodeglobal_trees[TI_VOID_TYPE], NULL_TREE(tree) __null));

gfc_array_index_type = gfc_get_int_type (gfc_index_integer_kind);
/* We cannot use gfc_index_zero_node in definition of gfc_array_range_type,
   since this function is called before gfc_init_constants.  */
gfc_array_range_type
 = build_range_type (gfc_array_index_type,
	      build_int_cst (gfc_array_index_type, 0),
	      NULL_TREE(tree) __null);

/* The maximum array element size that can be handled is determined
   by the number of bits available to store this field in the array
   descriptor.  */

n = TYPE_PRECISION (size_type_node)((tree_class_check ((global_trees[TI_SIZE_TYPE]), (tcc_type),
 "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1011, __FUNCTION__))->type_common.precision);
gfc_max_array_element_size
  = wide_int_to_tree (size_type_nodeglobal_trees[TI_SIZE_TYPE],
	wi::mask (n, UNSIGNED,
		  TYPE_PRECISION (size_type_node)((tree_class_check ((global_trees[TI_SIZE_TYPE]), (tcc_type),
 "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1015, __FUNCTION__))->type_common.precision)));

logical_type_node = gfc_get_logical_type (gfc_default_logical_kind);
logical_true_node = build_int_cst (logical_type_node, 1);
logical_false_node = build_int_cst (logical_type_node, 0);

/* Character lengths are of type size_t, except signed.  */
gfc_charlen_int_kind = get_int_kind_from_node (size_type_nodeglobal_trees[TI_SIZE_TYPE]);
gfc_charlen_type_node = gfc_get_int_type (gfc_charlen_int_kind);

/* Fortran kind number of size_type_node (size_t). This is used for
   the _size member in vtables.  */
gfc_size_kind = get_int_kind_from_node (size_type_nodeglobal_trees[TI_SIZE_TYPE]);
1028}

1030/* Get the type node for the given type and kind.  */

1032tree
1033gfc_get_int_type (int kind)
1034{
int index = gfc_validate_kind (BT_INTEGER, kind, true);
return index < 0 ? 0 : gfc_integer_types[index];
1037}

1039tree
1040gfc_get_real_type (int kind)
1041{
int index = gfc_validate_kind (BT_REAL, kind, true);
return index < 0 ? 0 : gfc_real_types[index];
1044}

1046tree
1047gfc_get_complex_type (int kind)
1048{
int index = gfc_validate_kind (BT_COMPLEX, kind, true);
return index < 0 ? 0 : gfc_complex_types[index];
1051}

1053tree
1054gfc_get_logical_type (int kind)
1055{
int index = gfc_validate_kind (BT_LOGICAL, kind, true);
return index < 0 ? 0 : gfc_logical_types[index];
1058}

1060tree
1061gfc_get_char_type (int kind)
1062{
int index = gfc_validate_kind (BT_CHARACTER, kind, true);
return index < 0 ? 0 : gfc_character_types[index];
1065}

1067tree
1068gfc_get_pchar_type (int kind)
1069{
int index = gfc_validate_kind (BT_CHARACTER, kind, true);
return index < 0 ? 0 : gfc_pcharacter_types[index];
1072}

1074
1075/* Create a character type with the given kind and length.  */

1077tree
1078gfc_get_character_type_len_for_eltype (tree eltype, tree len)
1079{
tree bounds, type;

bounds = build_range_type (gfc_charlen_type_node, gfc_index_one_nodegfc_rank_cst[1], len);
type = build_array_type (eltype, bounds);
TYPE_STRING_FLAG (type)((tree_check2 ((type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1084, __FUNCTION__, (ARRAY_TYPE), (INTEGER_TYPE)))->type_common
.string_flag) = 1;

return type;
1087}

1089tree
1090gfc_get_character_type_len (int kind, tree len)
1091{
gfc_validate_kind (BT_CHARACTER, kind, false);
return gfc_get_character_type_len_for_eltype (gfc_get_char_type (kind), len);
1094}


1097/* Get a type node for a character kind.  */

1099tree
1100gfc_get_character_type (int kind, gfc_charlen * cl)
1101{
tree len;

len = (cl == NULL__null) ? NULL_TREE(tree) __null : cl->backend_decl;
if (len && POINTER_TYPE_P (TREE_TYPE (len))(((enum tree_code) (((contains_struct_check ((len), (TS_TYPED
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1105, __FUNCTION__))->typed.type))->base.code) == POINTER_TYPE
 || ((enum tree_code) (((contains_struct_check ((len), (TS_TYPED
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1105, __FUNCTION__))->typed.type))->base.code) == REFERENCE_TYPE
))
  len = build_fold_indirect_ref (len)build_fold_indirect_ref_loc (((location_t) 0), len);

return gfc_get_character_type_len (kind, len);
1109}
1110
1111/* Convert a basic type.  This will be an array for character types.  */

1113tree
1114gfc_typenode_for_spec (gfc_typespec * spec, int codim)
1115{
tree basetype;

switch (spec->type)
  {
  case BT_UNKNOWN:
    gcc_unreachable ()(fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1121, __FUNCTION__));

  case BT_INTEGER:
    /* We use INTEGER(c_intptr_t) for C_PTR and C_FUNPTR once the symbol
       has been resolved.  This is done so we can convert C_PTR and
       C_FUNPTR to simple variables that get translated to (void *).  */
    if (spec->f90_type == BT_VOID)
{
 if (spec->u.derived
     && spec->u.derived->intmod_sym_id == ISOCBINDING_PTR)
   basetype = ptr_type_nodeglobal_trees[TI_PTR_TYPE];
 else
   basetype = pfunc_type_node;
}
    else
      basetype = gfc_get_int_type (spec->kind);
    break;

  case BT_REAL:
    basetype = gfc_get_real_type (spec->kind);
    break;

  case BT_COMPLEX:
    basetype = gfc_get_complex_type (spec->kind);
    break;

  case BT_LOGICAL:
    basetype = gfc_get_logical_type (spec->kind);
    break;

  case BT_CHARACTER:
    basetype = gfc_get_character_type (spec->kind, spec->u.cl);
    break;

  case BT_HOLLERITH:
    /* Since this cannot be used, return a length one character.  */
    basetype = gfc_get_character_type_len (gfc_default_character_kind,
			     gfc_index_one_nodegfc_rank_cst[1]);
    break;

  case BT_UNION:
    basetype = gfc_get_union_type (spec->u.derived);
    break;

  case BT_DERIVED:
  case BT_CLASS:
    basetype = gfc_get_derived_type (spec->u.derived, codim);

    if (spec->type == BT_CLASS)
GFC_CLASS_TYPE_P (basetype)((tree_class_check ((basetype), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1170, __FUNCTION__))->type_common.lang_flag_4) = 1;

    /* If we're dealing with either C_PTR or C_FUNPTR, we modified the
       type and kind to fit a (void *) and the basetype returned was a
       ptr_type_node.  We need to pass up this new information to the
       symbol that was declared of type C_PTR or C_FUNPTR.  */
    if (spec->u.derived->ts.f90_type == BT_VOID)
      {
        spec->type = BT_INTEGER;
        spec->kind = gfc_index_integer_kind;
 spec->f90_type = BT_VOID;
 spec->is_c_interop = 1;  /* Mark as escaping later.  */
      }
    break;
  case BT_VOID:
  case BT_ASSUMED:
    /* This is for the second arg to c_f_pointer and c_f_procpointer
       of the iso_c_binding module, to accept any ptr type.  */
    basetype = ptr_type_nodeglobal_trees[TI_PTR_TYPE];
    if (spec->f90_type == BT_VOID)
{
 if (spec->u.derived
     && spec->u.derived->intmod_sym_id == ISOCBINDING_PTR)
   basetype = ptr_type_nodeglobal_trees[TI_PTR_TYPE];
 else
   basetype = pfunc_type_node;
}
     break;
  case BT_PROCEDURE:
    basetype = pfunc_type_node;
    break;
  default:
    gcc_unreachable ()(fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1202, __FUNCTION__));
  }
return basetype;
1205}
1206
1207/* Build an INT_CST for constant expressions, otherwise return NULL_TREE.  */

1209static tree
1210gfc_conv_array_bound (gfc_expr * expr)
1211{
/* If expr is an integer constant, return that.  */
if (expr != NULL__null && expr->expr_type == EXPR_CONSTANT)
  return gfc_conv_mpz_to_tree (expr->value.integer, gfc_index_integer_kind);

/* Otherwise return NULL.  */
return NULL_TREE(tree) __null;
1218}
1219
1220/* Return the type of an element of the array.  Note that scalar coarrays
 are special.  In particular, for GFC_ARRAY_TYPE_P, the original argument
 (with POINTER_TYPE stripped) is returned.  */

1224tree
1225gfc_get_element_type (tree type)
1226{
tree element;

if (GFC_ARRAY_TYPE_P (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1229, __FUNCTION__))->type_common.lang_flag_2))
  {
    if (TREE_CODE (type)((enum tree_code) (type)->base.code) == POINTER_TYPE)
      type = TREE_TYPE (type)((contains_struct_check ((type), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1232, __FUNCTION__))->typed.type);
    if (GFC_TYPE_ARRAY_RANK (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1233, __FUNCTION__))->type_with_lang_specific.lang_specific
)->rank) == 0)
{
 gcc_assert (GFC_TYPE_ARRAY_CORANK (type) > 0)((void)(!((((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1235, __FUNCTION__))->type_with_lang_specific.lang_specific
)->corank) > 0) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1235, __FUNCTION__), 0 : 0));
 element = type;
}
    else
{
 gcc_assert (TREE_CODE (type) == ARRAY_TYPE)((void)(!(((enum tree_code) (type)->base.code) == ARRAY_TYPE
) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1240, __FUNCTION__), 0 : 0));
 element = TREE_TYPE (type)((contains_struct_check ((type), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1241, __FUNCTION__))->typed.type);
}
  }
else
  {
    gcc_assert (GFC_DESCRIPTOR_TYPE_P (type))((void)(!(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1246, __FUNCTION__))->type_common.lang_flag_1)) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1246, __FUNCTION__), 0 : 0));
    element = GFC_TYPE_ARRAY_DATAPTR_TYPE (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1247, __FUNCTION__))->type_with_lang_specific.lang_specific
)->dataptr_type);

    gcc_assert (TREE_CODE (element) == POINTER_TYPE)((void)(!(((enum tree_code) (element)->base.code) == POINTER_TYPE
) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1249, __FUNCTION__), 0 : 0));
    element = TREE_TYPE (element)((contains_struct_check ((element), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1250, __FUNCTION__))->typed.type);

    /* For arrays, which are not scalar coarrays.  */
    if (TREE_CODE (element)((enum tree_code) (element)->base.code) == ARRAY_TYPE && !TYPE_STRING_FLAG (element)((tree_check2 ((element), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1253, __FUNCTION__, (ARRAY_TYPE), (INTEGER_TYPE)))->type_common
.string_flag))
element = TREE_TYPE (element)((contains_struct_check ((element), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1254, __FUNCTION__))->typed.type);
  }

return element;
1258}
1259
1260/* Build an array.  This function is called from gfc_sym_type().
 Actually returns array descriptor type.

 Format of array descriptors is as follows:

  struct gfc_array_descriptor
  {
    array *data;
    index offset;
    struct dtype_type dtype;
    struct descriptor_dimension dimension[N_DIM];
  }

  struct dtype_type
  {
    size_t elem_len;
    int version;
    signed char rank;
    signed char type;
    signed short attribute;
  }

  struct descriptor_dimension
  {
    index stride;
    index lbound;
    index ubound;
  }

 Translation code should use gfc_conv_descriptor_* rather than
 accessing the descriptor directly.  Any changes to the array
 descriptor type will require changes in gfc_conv_descriptor_* and
 gfc_build_array_initializer.

 This is represented internally as a RECORD_TYPE. The index nodes
 are gfc_array_index_type and the data node is a pointer to the
 data.  See below for the handling of character types.

 I originally used nested ARRAY_TYPE nodes to represent arrays, but
 this generated poor code for assumed/deferred size arrays.  These
 require use of PLACEHOLDER_EXPR/WITH_RECORD_EXPR, which isn't part
 of the GENERIC grammar.  Also, there is no way to explicitly set
 the array stride, so all data must be packed(1).  I've tried to
 mark all the functions which would require modification with a GCC
 ARRAYS comment.

 The data component points to the first element in the array.  The
 offset field is the position of the origin of the array (i.e. element
 (0, 0 ...)).  This may be outside the bounds of the array.

 An element is accessed by
  data[offset + index0*stride0 + index1*stride1 + index2*stride2]
 This gives good performance as the computation does not involve the
 bounds of the array.  For packed arrays, this is optimized further
 by substituting the known strides.

 This system has one problem: all array bounds must be within 2^31
 elements of the origin (2^63 on 64-bit machines).  For example
  integer, dimension (80000:90000, 80000:90000, 2) :: array
 may not work properly on 32-bit machines because 80000*80000 >
 2^31, so the calculation for stride2 would overflow.  This may
 still work, but I haven't checked, and it relies on the overflow
 doing the right thing.

 The way to fix this problem is to access elements as follows:
  data[(index0-lbound0)*stride0 + (index1-lbound1)*stride1]
 Obviously this is much slower.  I will make this a compile time
 option, something like -fsmall-array-offsets.  Mixing code compiled
 with and without this switch will work.

 (1) This can be worked around by modifying the upper bound of the
 previous dimension.  This requires extra fields in the descriptor
 (both real_ubound and fake_ubound).  */


1335/* Returns true if the array sym does not require a descriptor.  */

1337int
1338gfc_is_nodesc_array (gfc_symbol * sym)
1339{
symbol_attribute *array_attr;
gfc_array_spec *as;
bool is_classarray = IS_CLASS_ARRAY (sym)(sym->ts.type == BT_CLASS && sym->ts.u.derived->
components && sym->ts.u.derived->components->
attr.dimension && !sym->ts.u.derived->components
->attr.class_pointer);

array_attr = is_classarray ? &CLASS_DATA (sym)sym->ts.u.derived->components->attr : &sym->attr;
as = is_classarray ? CLASS_DATA (sym)sym->ts.u.derived->components->as : sym->as;

gcc_assert (array_attr->dimension || array_attr->codimension)((void)(!(array_attr->dimension || array_attr->codimension
) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1347, __FUNCTION__), 0 : 0));

/* We only want local arrays.  */
if ((sym->ts.type != BT_CLASS && sym->attr.pointer)
    || (sym->ts.type == BT_CLASS && CLASS_DATA (sym)sym->ts.u.derived->components->attr.class_pointer)
    || array_attr->allocatable)
  return 0;

/* We want a descriptor for associate-name arrays that do not have an
explicitly known shape already.  */
if (sym->assoc && as->type != AS_EXPLICIT)
  return 0;

/* The dummy is stored in sym and not in the component.  */
if (sym->attr.dummy)
  return as->type != AS_ASSUMED_SHAPE
&& as->type != AS_ASSUMED_RANK;

if (sym->attr.result || sym->attr.function)
  return 0;

gcc_assert (as->type == AS_EXPLICIT || as->cp_was_assumed)((void)(!(as->type == AS_EXPLICIT || as->cp_was_assumed
) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1368, __FUNCTION__), 0 : 0));

return 1;
1371}


1374/* Create an array descriptor type.  */

1376static tree
1377gfc_build_array_type (tree type, gfc_array_spec * as,
      enum gfc_array_kind akind, bool restricted,
      bool contiguous, int codim)
1380{
tree lbound[GFC_MAX_DIMENSIONS15];
tree ubound[GFC_MAX_DIMENSIONS15];
int n, corank;

/* Assumed-shape arrays do not have codimension information stored in the
   descriptor.  */
corank = MAX (as->corank, codim)((as->corank) > (codim) ? (as->corank) : (codim));
if (as->type == AS_ASSUMED_SHAPE ||
    (as->type == AS_ASSUMED_RANK && akind == GFC_ARRAY_ALLOCATABLE))
  corank = codim;

if (as->type == AS_ASSUMED_RANK)
  for (n = 0; n < GFC_MAX_DIMENSIONS15; n++)
    {
lbound[n] = NULL_TREE(tree) __null;
ubound[n] = NULL_TREE(tree) __null;
    }

for (n = 0; n < as->rank; n++)
  {
    /* Create expressions for the known bounds of the array.  */
    if (as->type == AS_ASSUMED_SHAPE && as->lower[n] == NULL__null)
      lbound[n] = gfc_index_one_nodegfc_rank_cst[1];
    else
      lbound[n] = gfc_conv_array_bound (as->lower[n]);
    ubound[n] = gfc_conv_array_bound (as->upper[n]);
  }

for (n = as->rank; n < as->rank + corank; n++)
  {
    if (as->type != AS_DEFERRED && as->lower[n] == NULL__null)
      lbound[n] = gfc_index_one_nodegfc_rank_cst[1];
    else
      lbound[n] = gfc_conv_array_bound (as->lower[n]);

    if (n < as->rank + corank - 1)
ubound[n] = gfc_conv_array_bound (as->upper[n]);
  }

if (as->type == AS_ASSUMED_SHAPE)
  akind = contiguous ? GFC_ARRAY_ASSUMED_SHAPE_CONT
       : GFC_ARRAY_ASSUMED_SHAPE;
else if (as->type == AS_ASSUMED_RANK)
  akind = contiguous ? GFC_ARRAY_ASSUMED_RANK_CONT
       : GFC_ARRAY_ASSUMED_RANK;
return gfc_get_array_type_bounds (type, as->rank == -1
			  ? GFC_MAX_DIMENSIONS15 : as->rank,
		    corank, lbound, ubound, 0, akind,
		    restricted);
1430}
1431
1432/* Returns the struct descriptor_dimension type.  */

1434static tree
1435gfc_get_desc_dim_type (void)
1436{
tree type;
tree decl, *chain = NULL__null;

if (gfc_desc_dim_type)
  return gfc_desc_dim_type;

/* Build the type node.  */
type = make_node (RECORD_TYPE);

TYPE_NAME (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1446, __FUNCTION__))->type_common.name) = get_identifier ("descriptor_dimension")(__builtin_constant_p ("descriptor_dimension") ? get_identifier_with_length
 (("descriptor_dimension"), strlen ("descriptor_dimension")) :
 get_identifier ("descriptor_dimension"));
TYPE_PACKED (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1447, __FUNCTION__))->base.u.bits.packed_flag) = 1;

/* Consists of the stride, lbound and ubound members.  */
decl = gfc_add_field_to_struct_1 (type,
		    get_identifier ("stride")(__builtin_constant_p ("stride") ? get_identifier_with_length
 (("stride"), strlen ("stride")) : get_identifier ("stride")),
		    gfc_array_index_type, &chain);
TREE_NO_WARNING (decl)((decl)->base.nowarning_flag) = 1;

decl = gfc_add_field_to_struct_1 (type,
		    get_identifier ("lbound")(__builtin_constant_p ("lbound") ? get_identifier_with_length
 (("lbound"), strlen ("lbound")) : get_identifier ("lbound")),
		    gfc_array_index_type, &chain);
TREE_NO_WARNING (decl)((decl)->base.nowarning_flag) = 1;

decl = gfc_add_field_to_struct_1 (type,
		    get_identifier ("ubound")(__builtin_constant_p ("ubound") ? get_identifier_with_length
 (("ubound"), strlen ("ubound")) : get_identifier ("ubound")),
		    gfc_array_index_type, &chain);
TREE_NO_WARNING (decl)((decl)->base.nowarning_flag) = 1;

/* Finish off the type.  */
gfc_finish_type (type);
TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type))((tree_check (((((contains_struct_check (((tree_class_check (
(type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1467, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1467, __FUNCTION__))->common.chain))), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1467, __FUNCTION__, (TYPE_DECL)))->decl_common.decl_flag_1
) = 1;

gfc_desc_dim_type = type;
return type;
1471}


1474/* Return the DTYPE for an array.  This describes the type and type parameters
 of the array.  */
1476/* TODO: Only call this when the value is actually used, and make all the
 unknown cases abort.  */

1479tree
1480gfc_get_dtype_rank_type (int rank, tree etype)
1481{
tree size;
int n;
tree tmp;
tree dtype;
tree field;
vec<constructor_elt, va_gc> *v = NULL__null;

size = TYPE_SIZE_UNIT (etype)((tree_class_check ((etype), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1489, __FUNCTION__))->type_common.size_unit);

switch (TREE_CODE (etype)((enum tree_code) (etype)->base.code))
  {
  case INTEGER_TYPE:
    n = BT_INTEGER;
    break;

  case BOOLEAN_TYPE:
    n = BT_LOGICAL;
    break;

  case REAL_TYPE:
    n = BT_REAL;
    break;

  case COMPLEX_TYPE:
    n = BT_COMPLEX;
    break;

  case RECORD_TYPE:
    if (GFC_CLASS_TYPE_P (etype)((tree_class_check ((etype), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1510, __FUNCTION__))->type_common.lang_flag_4))
n = BT_CLASS;
    else
n = BT_DERIVED;
    break;

  /* We will never have arrays of arrays.  */
  case ARRAY_TYPE:
    n = BT_CHARACTER;
    if (size == NULL_TREE(tree) __null)
size = TYPE_SIZE_UNIT (TREE_TYPE (etype))((tree_class_check ((((contains_struct_check ((etype), (TS_TYPED
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1520, __FUNCTION__))->typed.type)), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1520, __FUNCTION__))->type_common.size_unit);
    break;

  case POINTER_TYPE:
    n = BT_ASSUMED;
    if (TREE_CODE (TREE_TYPE (etype))((enum tree_code) (((contains_struct_check ((etype), (TS_TYPED
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1525, __FUNCTION__))->typed.type))->base.code) != VOID_TYPE)
size = TYPE_SIZE_UNIT (TREE_TYPE (etype))((tree_class_check ((((contains_struct_check ((etype), (TS_TYPED
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1526, __FUNCTION__))->typed.type)), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1526, __FUNCTION__))->type_common.size_unit);
    else
size = build_int_cst (size_type_nodeglobal_trees[TI_SIZE_TYPE], 0);
  break;

  default:
    /* TODO: Don't do dtype for temporary descriptorless arrays.  */
    /* We can encounter strange array types for temporary arrays.  */
    return gfc_index_zero_nodegfc_rank_cst[0];
  }

tmp = get_dtype_type_node ();
field = gfc_advance_chain (TYPE_FIELDS (tmp)((tree_check3 ((tmp), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1538, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
)))->type_non_common.values),
	     GFC_DTYPE_ELEM_LEN0);
CONSTRUCTOR_APPEND_ELT (v, field,do { constructor_elt _ce___ = {field, fold_convert_loc (((location_t
) 0), ((contains_struct_check ((field), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1541, __FUNCTION__))->typed.type), size)}; vec_safe_push
 ((v), _ce___); } while (0)
	  fold_convert (TREE_TYPE (field), size))do { constructor_elt _ce___ = {field, fold_convert_loc (((location_t
) 0), ((contains_struct_check ((field), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1541, __FUNCTION__))->typed.type), size)}; vec_safe_push
 ((v), _ce___); } while (0);

field = gfc_advance_chain (TYPE_FIELDS (dtype_type_node)((tree_check3 ((dtype_type_node), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1543, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
)))->type_non_common.values),
	     GFC_DTYPE_RANK2);
CONSTRUCTOR_APPEND_ELT (v, field,do { constructor_elt _ce___ = {field, build_int_cst (((contains_struct_check
 ((field), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1546, __FUNCTION__))->typed.type), rank)}; vec_safe_push
 ((v), _ce___); } while (0)
	  build_int_cst (TREE_TYPE (field), rank))do { constructor_elt _ce___ = {field, build_int_cst (((contains_struct_check
 ((field), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1546, __FUNCTION__))->typed.type), rank)}; vec_safe_push
 ((v), _ce___); } while (0);

field = gfc_advance_chain (TYPE_FIELDS (dtype_type_node)((tree_check3 ((dtype_type_node), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1548, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
)))->type_non_common.values),
	     GFC_DTYPE_TYPE3);
CONSTRUCTOR_APPEND_ELT (v, field,do { constructor_elt _ce___ = {field, build_int_cst (((contains_struct_check
 ((field), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1551, __FUNCTION__))->typed.type), n)}; vec_safe_push ((
v), _ce___); } while (0)
	  build_int_cst (TREE_TYPE (field), n))do { constructor_elt _ce___ = {field, build_int_cst (((contains_struct_check
 ((field), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1551, __FUNCTION__))->typed.type), n)}; vec_safe_push ((
v), _ce___); } while (0);

dtype = build_constructor (tmp, v);

return dtype;
1556}


1559tree
1560gfc_get_dtype (tree type)
1561{
tree dtype;
tree etype;
int rank;

gcc_assert (GFC_DESCRIPTOR_TYPE_P (type) || GFC_ARRAY_TYPE_P (type))((void)(!(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1566, __FUNCTION__))->type_common.lang_flag_1) || ((tree_class_check
 ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1566, __FUNCTION__))->type_common.lang_flag_2)) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1566, __FUNCTION__), 0 : 0));

rank = GFC_TYPE_ARRAY_RANK (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1568, __FUNCTION__))->type_with_lang_specific.lang_specific
)->rank);
etype = gfc_get_element_type (type);
dtype = gfc_get_dtype_rank_type (rank, etype);

GFC_TYPE_ARRAY_DTYPE (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1572, __FUNCTION__))->type_with_lang_specific.lang_specific
)->dtype) = dtype;
return dtype;
1574}


1577/* Build an array type for use without a descriptor, packed according
 to the value of PACKED.  */

1580tree
1581gfc_get_nodesc_array_type (tree etype, gfc_array_spec * as, gfc_packed packed,
	   bool restricted)
1583{
tree range;
tree type;
tree tmp;
int n;
int known_stride;
int known_offset;
mpz_t offset;
mpz_t stride;
mpz_t delta;
gfc_expr *expr;

mpz_init_set_ui__gmpz_init_set_ui (offset, 0);
mpz_init_set_ui__gmpz_init_set_ui (stride, 1);
mpz_init__gmpz_init (delta);

/* We don't use build_array_type because this does not include
   lang-specific information (i.e. the bounds of the array) when checking
   for duplicates.  */
if (as->rank)
  type = make_node (ARRAY_TYPE);
else
  type = build_variant_type_copy (etype);

GFC_ARRAY_TYPE_P (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1607, __FUNCTION__))->type_common.lang_flag_2) = 1;
TYPE_LANG_SPECIFIC (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1608, __FUNCTION__))->type_with_lang_specific.lang_specific
) = ggc_cleared_alloc<struct lang_type> ();

known_stride = (packed != PACKED_NO);
known_offset = 1;
for (n = 0; n < as->rank; n++)
  {
    /* Fill in the stride and bound components of the type.  */
    if (known_stride)
tmp = gfc_conv_mpz_to_tree (stride, gfc_index_integer_kind);
    else
      tmp = NULL_TREE(tree) __null;
    GFC_TYPE_ARRAY_STRIDE (type, n)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1619, __FUNCTION__))->type_with_lang_specific.lang_specific
)->stride[n]) = tmp;

    expr = as->lower[n];
    if (expr->expr_type == EXPR_CONSTANT)
      {
        tmp = gfc_conv_mpz_to_tree (expr->value.integer,
		      gfc_index_integer_kind);
      }
    else
      {
        known_stride = 0;
        tmp = NULL_TREE(tree) __null;
      }
    GFC_TYPE_ARRAY_LBOUND (type, n)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1632, __FUNCTION__))->type_with_lang_specific.lang_specific
)->lbound[n]) = tmp;

    if (known_stride)
{
        /* Calculate the offset.  */
        mpz_mul__gmpz_mul (delta, stride, as->lower[n]->value.integer);
        mpz_sub__gmpz_sub (offset, offset, delta);
}
    else
known_offset = 0;

    expr = as->upper[n];
    if (expr && expr->expr_type == EXPR_CONSTANT)
      {
 tmp = gfc_conv_mpz_to_tree (expr->value.integer,
	          gfc_index_integer_kind);
      }
    else
      {
        tmp = NULL_TREE(tree) __null;
        known_stride = 0;
      }
    GFC_TYPE_ARRAY_UBOUND (type, n)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1654, __FUNCTION__))->type_with_lang_specific.lang_specific
)->ubound[n]) = tmp;

    if (known_stride)
      {
        /* Calculate the stride.  */
        mpz_sub__gmpz_sub (delta, as->upper[n]->value.integer,
          as->lower[n]->value.integer);
        mpz_add_ui__gmpz_add_ui (delta, delta, 1);
        mpz_mul__gmpz_mul (stride, stride, delta);
      }

    /* Only the first stride is known for partial packed arrays.  */
    if (packed == PACKED_NO || packed == PACKED_PARTIAL)
      known_stride = 0;
  }
for (n = as->rank; n < as->rank + as->corank; n++)
  {
    expr = as->lower[n];
    if (expr->expr_type == EXPR_CONSTANT)
tmp = gfc_conv_mpz_to_tree (expr->value.integer,
		    gfc_index_integer_kind);
    else
    	tmp = NULL_TREE(tree) __null;
    GFC_TYPE_ARRAY_LBOUND (type, n)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1677, __FUNCTION__))->type_with_lang_specific.lang_specific
)->lbound[n]) = tmp;

    expr = as->upper[n];
    if (expr && expr->expr_type == EXPR_CONSTANT)
tmp = gfc_conv_mpz_to_tree (expr->value.integer,
		    gfc_index_integer_kind);
    else
tmp = NULL_TREE(tree) __null;
    if (n < as->rank + as->corank - 1)
    GFC_TYPE_ARRAY_UBOUND (type, n)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1686, __FUNCTION__))->type_with_lang_specific.lang_specific
)->ubound[n]) = tmp;
  }

if (known_offset)
  {
    GFC_TYPE_ARRAY_OFFSET (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1691, __FUNCTION__))->type_with_lang_specific.lang_specific
)->offset) =
      gfc_conv_mpz_to_tree (offset, gfc_index_integer_kind);
  }
else
  GFC_TYPE_ARRAY_OFFSET (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1695, __FUNCTION__))->type_with_lang_specific.lang_specific
)->offset) = NULL_TREE(tree) __null;

if (known_stride)
  {
    GFC_TYPE_ARRAY_SIZE (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1699, __FUNCTION__))->type_with_lang_specific.lang_specific
)->size) =
      gfc_conv_mpz_to_tree (stride, gfc_index_integer_kind);
  }
else
  GFC_TYPE_ARRAY_SIZE (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1703, __FUNCTION__))->type_with_lang_specific.lang_specific
)->size) = NULL_TREE(tree) __null;

GFC_TYPE_ARRAY_RANK (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1705, __FUNCTION__))->type_with_lang_specific.lang_specific
)->rank) = as->rank;
GFC_TYPE_ARRAY_CORANK (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1706, __FUNCTION__))->type_with_lang_specific.lang_specific
)->corank) = as->corank;
GFC_TYPE_ARRAY_DTYPE (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1707, __FUNCTION__))->type_with_lang_specific.lang_specific
)->dtype) = NULL_TREE(tree) __null;
range = build_range_type (gfc_array_index_type, gfc_index_zero_nodegfc_rank_cst[0],
	    NULL_TREE(tree) __null);
/* TODO: use main type if it is unbounded.  */
GFC_TYPE_ARRAY_DATAPTR_TYPE (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1711, __FUNCTION__))->type_with_lang_specific.lang_specific
)->dataptr_type) =
  build_pointer_type (build_array_type (etype, range));
if (restricted)
  GFC_TYPE_ARRAY_DATAPTR_TYPE (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1714, __FUNCTION__))->type_with_lang_specific.lang_specific
)->dataptr_type) =
    build_qualified_type (GFC_TYPE_ARRAY_DATAPTR_TYPE (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1715, __FUNCTION__))->type_with_lang_specific.lang_specific
)->dataptr_type),
	    TYPE_QUAL_RESTRICT);

if (as->rank == 0)
  {
    if (packed != PACKED_STATIC  || flag_coarrayglobal_options.x_flag_coarray == GFC_FCOARRAY_LIB)
{
 type = build_pointer_type (type);

 if (restricted)
   type = build_qualified_type (type, TYPE_QUAL_RESTRICT);

 GFC_ARRAY_TYPE_P (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1727, __FUNCTION__))->type_common.lang_flag_2) = 1;
 TYPE_LANG_SPECIFIC (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1728, __FUNCTION__))->type_with_lang_specific.lang_specific
) = TYPE_LANG_SPECIFIC (TREE_TYPE (type))((tree_class_check ((((contains_struct_check ((type), (TS_TYPED
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1728, __FUNCTION__))->typed.type)), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1728, __FUNCTION__))->type_with_lang_specific.lang_specific
);
}

    return type;
  }

if (known_stride)
  {
    mpz_sub_ui__gmpz_sub_ui (stride, stride, 1);
    range = gfc_conv_mpz_to_tree (stride, gfc_index_integer_kind);
  }
else
  range = NULL_TREE(tree) __null;

range = build_range_type (gfc_array_index_type, gfc_index_zero_nodegfc_rank_cst[0], range);
TYPE_DOMAIN (type)((tree_check ((type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1743, __FUNCTION__, (ARRAY_TYPE)))->type_non_common.values
) = range;

build_pointer_type (etype);
TREE_TYPE (type)((contains_struct_check ((type), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1746, __FUNCTION__))->typed.type) = etype;

layout_type (type);

mpz_clear__gmpz_clear (offset);
mpz_clear__gmpz_clear (stride);
mpz_clear__gmpz_clear (delta);

/* Represent packed arrays as multi-dimensional if they have rank >
   1 and with proper bounds, instead of flat arrays.  This makes for
   better debug info.  */
if (known_offset)
  {
    tree gtype = etype, rtype, type_decl;

    for (n = as->rank - 1; n >= 0; n--)
{
 rtype = build_range_type (gfc_array_index_type,
		    GFC_TYPE_ARRAY_LBOUND (type, n)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1764, __FUNCTION__))->type_with_lang_specific.lang_specific
)->lbound[n]),
		    GFC_TYPE_ARRAY_UBOUND (type, n)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1765, __FUNCTION__))->type_with_lang_specific.lang_specific
)->ubound[n]));
 gtype = build_array_type (gtype, rtype);
}
    TYPE_NAME (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1768, __FUNCTION__))->type_common.name) = type_decl = build_decl (input_location,
				 TYPE_DECL, NULL__null, gtype);
    DECL_ORIGINAL_TYPE (type_decl)((tree_check ((type_decl), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1770, __FUNCTION__, (TYPE_DECL)))->decl_non_common.result
) = gtype;
  }

if (packed != PACKED_STATIC || !known_stride
    || (as->corank && flag_coarrayglobal_options.x_flag_coarray == GFC_FCOARRAY_LIB))
  {
    /* For dummy arrays and automatic (heap allocated) arrays we
want a pointer to the array.  */
    type = build_pointer_type (type);
    if (restricted)
type = build_qualified_type (type, TYPE_QUAL_RESTRICT);
    GFC_ARRAY_TYPE_P (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1781, __FUNCTION__))->type_common.lang_flag_2) = 1;
    TYPE_LANG_SPECIFIC (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1782, __FUNCTION__))->type_with_lang_specific.lang_specific
) = TYPE_LANG_SPECIFIC (TREE_TYPE (type))((tree_class_check ((((contains_struct_check ((type), (TS_TYPED
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1782, __FUNCTION__))->typed.type)), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1782, __FUNCTION__))->type_with_lang_specific.lang_specific
);
  }
return type;
1785}


1788/* Return or create the base type for an array descriptor.  */

1790static tree
1791gfc_get_array_descriptor_base (int dimen, int codimen, bool restricted)
1792{
tree fat_type, decl, arraytype, *chain = NULL__null;
char name[16 + 2*GFC_RANK_DIGITS2 + 1 + 1];
int idx;

/* Assumed-rank array.  */
if (dimen == -1)
  dimen = GFC_MAX_DIMENSIONS15;

idx = 2 * (codimen + dimen) + restricted;

gcc_assert (codimen + dimen >= 0 && codimen + dimen <= GFC_MAX_DIMENSIONS)((void)(!(codimen + dimen >= 0 && codimen + dimen <=
 15) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1803, __FUNCTION__), 0 : 0));

if (flag_coarrayglobal_options.x_flag_coarray == GFC_FCOARRAY_LIB && codimen)
  {
    if (gfc_array_descriptor_base_caf[idx])
return gfc_array_descriptor_base_caf[idx];
  }
else if (gfc_array_descriptor_base[idx])
  return gfc_array_descriptor_base[idx];

/* Build the type node.  */
fat_type = make_node (RECORD_TYPE);

sprintf (name, "array_descriptor" GFC_RANK_PRINTF_FORMAT"%02d", dimen + codimen);
TYPE_NAME (fat_type)((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1817, __FUNCTION__))->type_common.name) = get_identifier (name)(__builtin_constant_p (name) ? get_identifier_with_length ((name
), strlen (name)) : get_identifier (name));
TYPE_NAMELESS (fat_type)((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1818, __FUNCTION__))->base.u.bits.nameless_flag) = 1;

/* Add the data member as the first element of the descriptor.  */
gfc_add_field_to_struct_1 (fat_type,
	     get_identifier ("data")(__builtin_constant_p ("data") ? get_identifier_with_length (
("data"), strlen ("data")) : get_identifier ("data")),
	     (restricted
	      ? prvoid_type_node
	      : ptr_type_nodeglobal_trees[TI_PTR_TYPE]), &chain);

/* Add the base component.  */
decl = gfc_add_field_to_struct_1 (fat_type,
		    get_identifier ("offset")(__builtin_constant_p ("offset") ? get_identifier_with_length
 (("offset"), strlen ("offset")) : get_identifier ("offset")),
		    gfc_array_index_type, &chain);
TREE_NO_WARNING (decl)((decl)->base.nowarning_flag) = 1;

/* Add the dtype component.  */
decl = gfc_add_field_to_struct_1 (fat_type,
		    get_identifier ("dtype")(__builtin_constant_p ("dtype") ? get_identifier_with_length (
("dtype"), strlen ("dtype")) : get_identifier ("dtype")),
		    get_dtype_type_node (), &chain);
TREE_NO_WARNING (decl)((decl)->base.nowarning_flag) = 1;

/* Add the span component.  */
decl = gfc_add_field_to_struct_1 (fat_type,
		    get_identifier ("span")(__builtin_constant_p ("span") ? get_identifier_with_length (
("span"), strlen ("span")) : get_identifier ("span")),
		    gfc_array_index_type, &chain);
TREE_NO_WARNING (decl)((decl)->base.nowarning_flag) = 1;

/* Build the array type for the stride and bound components.  */
if (dimen + codimen > 0)
  {
    arraytype =
build_array_type (gfc_get_desc_dim_type (),
	  build_range_type (gfc_array_index_type,
			    gfc_index_zero_nodegfc_rank_cst[0],
			    gfc_rank_cst[codimen + dimen - 1]));

    decl = gfc_add_field_to_struct_1 (fat_type, get_identifier ("dim")(__builtin_constant_p ("dim") ? get_identifier_with_length ((
"dim"), strlen ("dim")) : get_identifier ("dim")),
			arraytype, &chain);
    TREE_NO_WARNING (decl)((decl)->base.nowarning_flag) = 1;
  }

if (flag_coarrayglobal_options.x_flag_coarray == GFC_FCOARRAY_LIB)
  {
    decl = gfc_add_field_to_struct_1 (fat_type,
			get_identifier ("token")(__builtin_constant_p ("token") ? get_identifier_with_length (
("token"), strlen ("token")) : get_identifier ("token")),
			prvoid_type_node, &chain);
    TREE_NO_WARNING (decl)((decl)->base.nowarning_flag) = 1;
  }

/* Finish off the type.  */
gfc_finish_type (fat_type);
TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (fat_type))((tree_check (((((contains_struct_check (((tree_class_check (
(fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1869, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1869, __FUNCTION__))->common.chain))), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1869, __FUNCTION__, (TYPE_DECL)))->decl_common.decl_flag_1
) = 1;

if (flag_coarrayglobal_options.x_flag_coarray == GFC_FCOARRAY_LIB && codimen)
  gfc_array_descriptor_base_caf[idx] = fat_type;
else
  gfc_array_descriptor_base[idx] = fat_type;

return fat_type;
1877}


1880/* Build an array (descriptor) type with given bounds.  */

1882tree
1883gfc_get_array_type_bounds (tree etype, int dimen, int codimen, tree * lbound,
	   tree * ubound, int packed,
	   enum gfc_array_kind akind, bool restricted)
1886{
char name[8 + 2*GFC_RANK_DIGITS2 + 1 + GFC_MAX_SYMBOL_LEN63];
tree fat_type, base_type, arraytype, lower, upper, stride, tmp, rtype;
const char *type_name;
int n;

base_type = gfc_get_array_descriptor_base (dimen, codimen, restricted);
fat_type = build_distinct_type_copy (base_type);
/* Unshare TYPE_FIELDs.  */
for (tree *tp = &TYPE_FIELDS (fat_type)((tree_check3 ((fat_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1895, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
)))->type_non_common.values); *tp; tp = &DECL_CHAIN (*tp)(((contains_struct_check (((contains_struct_check ((*tp), (TS_DECL_MINIMAL
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1895, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1895, __FUNCTION__))->common.chain)))
  {
    tree next = DECL_CHAIN (*tp)(((contains_struct_check (((contains_struct_check ((*tp), (TS_DECL_MINIMAL
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1897, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1897, __FUNCTION__))->common.chain));
    *tp = copy_node (*tp);
    DECL_CONTEXT (*tp)((contains_struct_check ((*tp), (TS_DECL_MINIMAL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1899, __FUNCTION__))->decl_minimal.context) = fat_type;
    DECL_CHAIN (*tp)(((contains_struct_check (((contains_struct_check ((*tp), (TS_DECL_MINIMAL
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1900, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1900, __FUNCTION__))->common.chain)) = next;
  }
/* Make sure that nontarget and target array type have the same canonical
   type (and same stub decl for debug info).  */
base_type = gfc_get_array_descriptor_base (dimen, codimen, false);
TYPE_CANONICAL (fat_type)((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1905, __FUNCTION__))->type_common.canonical) = base_type;
TYPE_STUB_DECL (fat_type)(((contains_struct_check (((tree_class_check ((fat_type), (tcc_type
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1906, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1906, __FUNCTION__))->common.chain)) = TYPE_STUB_DECL (base_type)(((contains_struct_check (((tree_class_check ((base_type), (tcc_type
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1906, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1906, __FUNCTION__))->common.chain));
/* Arrays of unknown type must alias with all array descriptors.  */
TYPE_TYPELESS_STORAGE (base_type)((tree_check4 ((base_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1908, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
), (ARRAY_TYPE)))->type_common.typeless_storage) = 1;
TYPE_TYPELESS_STORAGE (fat_type)((tree_check4 ((fat_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1909, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
), (ARRAY_TYPE)))->type_common.typeless_storage) = 1;
gcc_checking_assert (!get_alias_set (base_type) && !get_alias_set (fat_type))((void)(!(!get_alias_set (base_type) && !get_alias_set
 (fat_type)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1910, __FUNCTION__), 0 : 0));

tmp = TYPE_NAME (etype)((tree_class_check ((etype), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1912, __FUNCTION__))->type_common.name);
if (tmp && TREE_CODE (tmp)((enum tree_code) (tmp)->base.code) == TYPE_DECL)
  tmp = DECL_NAME (tmp)((contains_struct_check ((tmp), (TS_DECL_MINIMAL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1914, __FUNCTION__))->decl_minimal.name);
if (tmp)
  type_name = IDENTIFIER_POINTER (tmp)((const char *) (tree_check ((tmp), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1916, __FUNCTION__, (IDENTIFIER_NODE)))->identifier.id.str
);
else
  type_name = "unknown";
sprintf (name, "array" GFC_RANK_PRINTF_FORMAT"%02d" "_%.*s", dimen + codimen,
  GFC_MAX_SYMBOL_LEN63, type_name);
TYPE_NAME (fat_type)((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1921, __FUNCTION__))->type_common.name) = get_identifier (name)(__builtin_constant_p (name) ? get_identifier_with_length ((name
), strlen (name)) : get_identifier (name));
TYPE_NAMELESS (fat_type)((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1922, __FUNCTION__))->base.u.bits.nameless_flag) = 1;

GFC_DESCRIPTOR_TYPE_P (fat_type)((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1924, __FUNCTION__))->type_common.lang_flag_1) = 1;
TYPE_LANG_SPECIFIC (fat_type)((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1925, __FUNCTION__))->type_with_lang_specific.lang_specific
) = ggc_cleared_alloc<struct lang_type> ();

GFC_TYPE_ARRAY_RANK (fat_type)(((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1927, __FUNCTION__))->type_with_lang_specific.lang_specific
)->rank) = dimen;
GFC_TYPE_ARRAY_CORANK (fat_type)(((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1928, __FUNCTION__))->type_with_lang_specific.lang_specific
)->corank) = codimen;
GFC_TYPE_ARRAY_DTYPE (fat_type)(((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1929, __FUNCTION__))->type_with_lang_specific.lang_specific
)->dtype) = NULL_TREE(tree) __null;
GFC_TYPE_ARRAY_AKIND (fat_type)(((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1930, __FUNCTION__))->type_with_lang_specific.lang_specific
)->akind) = akind;

/* Build an array descriptor record type.  */
if (packed != 0)
  stride = gfc_index_one_nodegfc_rank_cst[1];
else
  stride = NULL_TREE(tree) __null;
for (n = 0; n < dimen + codimen; n++)
  {
    if (n < dimen)
GFC_TYPE_ARRAY_STRIDE (fat_type, n)(((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1940, __FUNCTION__))->type_with_lang_specific.lang_specific
)->stride[n]) = stride;

    if (lbound)
lower = lbound[n];
    else
lower = NULL_TREE(tree) __null;

    if (lower != NULL_TREE(tree) __null)
{
 if (INTEGER_CST_P (lower)(((enum tree_code) (lower)->base.code) == INTEGER_CST))
   GFC_TYPE_ARRAY_LBOUND (fat_type, n)(((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1950, __FUNCTION__))->type_with_lang_specific.lang_specific
)->lbound[n]) = lower;
 else
   lower = NULL_TREE(tree) __null;
}

    if (codimen && n == dimen + codimen - 1)
break;

    upper = ubound[n];
    if (upper != NULL_TREE(tree) __null)
{
 if (INTEGER_CST_P (upper)(((enum tree_code) (upper)->base.code) == INTEGER_CST))
   GFC_TYPE_ARRAY_UBOUND (fat_type, n)(((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1962, __FUNCTION__))->type_with_lang_specific.lang_specific
)->ubound[n]) = upper;
 else
   upper = NULL_TREE(tree) __null;
}

    if (n >= dimen)
continue;

    if (upper != NULL_TREE(tree) __null && lower != NULL_TREE(tree) __null && stride != NULL_TREE(tree) __null)
{
 tmp = fold_build2_loc (input_location, MINUS_EXPR,
		 gfc_array_index_type, upper, lower);
 tmp = fold_build2_loc (input_location, PLUS_EXPR,
		 gfc_array_index_type, tmp,
		 gfc_index_one_nodegfc_rank_cst[1]);
 stride = fold_build2_loc (input_location, MULT_EXPR,
		    gfc_array_index_type, tmp, stride);
 /* Check the folding worked.  */
 gcc_assert (INTEGER_CST_P (stride))((void)(!((((enum tree_code) (stride)->base.code) == INTEGER_CST
)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1980, __FUNCTION__), 0 : 0));
}
    else
stride = NULL_TREE(tree) __null;
  }
GFC_TYPE_ARRAY_SIZE (fat_type)(((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1985, __FUNCTION__))->type_with_lang_specific.lang_specific
)->size) = stride;

/* TODO: known offsets for descriptors.  */
GFC_TYPE_ARRAY_OFFSET (fat_type)(((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1988, __FUNCTION__))->type_with_lang_specific.lang_specific
)->offset) = NULL_TREE(tree) __null;

if (dimen == 0)
  {
    arraytype =  build_pointer_type (etype);
    if (restricted)
arraytype = build_qualified_type (arraytype, TYPE_QUAL_RESTRICT);

    GFC_TYPE_ARRAY_DATAPTR_TYPE (fat_type)(((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 1996, __FUNCTION__))->type_with_lang_specific.lang_specific
)->dataptr_type) = arraytype;
    return fat_type;
  }

/* We define data as an array with the correct size if possible.
   Much better than doing pointer arithmetic.  */
if (stride)
  rtype = build_range_type (gfc_array_index_type, gfc_index_zero_nodegfc_rank_cst[0],
	      int_const_binop (MINUS_EXPR, stride,
			       build_int_cst (TREE_TYPE (stride)((contains_struct_check ((stride), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2005, __FUNCTION__))->typed.type), 1)));
else
  rtype = gfc_array_range_type;
arraytype = build_array_type (etype, rtype);
arraytype = build_pointer_type (arraytype);
if (restricted)
  arraytype = build_qualified_type (arraytype, TYPE_QUAL_RESTRICT);
GFC_TYPE_ARRAY_DATAPTR_TYPE (fat_type)(((tree_class_check ((fat_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2012, __FUNCTION__))->type_with_lang_specific.lang_specific
)->dataptr_type) = arraytype;

/* This will generate the base declarations we need to emit debug
   information for this type.  FIXME: there must be a better way to
   avoid divergence between compilations with and without debug
   information.  */
{
  struct array_descr_info info;
  gfc_get_array_descr_info (fat_type, &info);
  gfc_get_array_descr_info (build_pointer_type (fat_type), &info);
}

return fat_type;
2025}
2026
2027/* Build a pointer type. This function is called from gfc_sym_type().  */

2029static tree
2030gfc_build_pointer_type (gfc_symbol * sym, tree type)
2031{
/* Array pointer types aren't actually pointers.  */
if (sym->attr.dimension)
  return type;
else
  return build_pointer_type (type);
2037}

2039static tree gfc_nonrestricted_type (tree t);
2040/* Given two record or union type nodes TO and FROM, ensure
 that all fields in FROM have a corresponding field in TO,
 their type being nonrestrict variants.  This accepts a TO
 node that already has a prefix of the fields in FROM.  */
2044static void
2045mirror_fields (tree to, tree from)
2046{
tree fto, ffrom;
tree *chain;

/* Forward to the end of TOs fields.  */
fto = TYPE_FIELDS (to)((tree_check3 ((to), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2051, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
)))->type_non_common.values);
ffrom = TYPE_FIELDS (from)((tree_check3 ((from), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2052, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
)))->type_non_common.values);
chain = &TYPE_FIELDS (to)((tree_check3 ((to), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2053, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
)))->type_non_common.values);
while (fto)
  {
    gcc_assert (ffrom && DECL_NAME (fto) == DECL_NAME (ffrom))((void)(!(ffrom && ((contains_struct_check ((fto), (TS_DECL_MINIMAL
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2056, __FUNCTION__))->decl_minimal.name) == ((contains_struct_check
 ((ffrom), (TS_DECL_MINIMAL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2056, __FUNCTION__))->decl_minimal.name)) ? fancy_abort (
"/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2056, __FUNCTION__), 0 : 0));
    chain = &DECL_CHAIN (fto)(((contains_struct_check (((contains_struct_check ((fto), (TS_DECL_MINIMAL
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2057, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2057, __FUNCTION__))->common.chain));
    fto = DECL_CHAIN (fto)(((contains_struct_check (((contains_struct_check ((fto), (TS_DECL_MINIMAL
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2058, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2058, __FUNCTION__))->common.chain));
    ffrom = DECL_CHAIN (ffrom)(((contains_struct_check (((contains_struct_check ((ffrom), (
TS_DECL_MINIMAL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2059, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2059, __FUNCTION__))->common.chain));
  }

/* Now add all fields remaining in FROM (starting with ffrom).  */
for (; ffrom; ffrom = DECL_CHAIN (ffrom)(((contains_struct_check (((contains_struct_check ((ffrom), (
TS_DECL_MINIMAL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2063, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2063, __FUNCTION__))->common.chain)))
  {
    tree newfield = copy_node (ffrom);
    DECL_CONTEXT (newfield)((contains_struct_check ((newfield), (TS_DECL_MINIMAL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2066, __FUNCTION__))->decl_minimal.context) = to;
    /* The store to DECL_CHAIN might seem redundant with the
stores to *chain, but not clearing it here would mean
leaving a chain into the old fields.  If ever
our called functions would look at them confusion
will arise.  */
    DECL_CHAIN (newfield)(((contains_struct_check (((contains_struct_check ((newfield)
, (TS_DECL_MINIMAL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2072, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2072, __FUNCTION__))->common.chain)) = NULL_TREE(tree) __null;
    *chain = newfield;
    chain = &DECL_CHAIN (newfield)(((contains_struct_check (((contains_struct_check ((newfield)
, (TS_DECL_MINIMAL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2074, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2074, __FUNCTION__))->common.chain));

    if (TREE_CODE (ffrom)((enum tree_code) (ffrom)->base.code) == FIELD_DECL)
{
 tree elemtype = gfc_nonrestricted_type (TREE_TYPE (ffrom)((contains_struct_check ((ffrom), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2078, __FUNCTION__))->typed.type));
 TREE_TYPE (newfield)((contains_struct_check ((newfield), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2079, __FUNCTION__))->typed.type) = elemtype;
}
  }
*chain = NULL_TREE(tree) __null;
2083}

2085/* Given a type T, returns a different type of the same structure,
 except that all types it refers to (recursively) are always
 non-restrict qualified types.  */
2088static tree
2089gfc_nonrestricted_type (tree t)
2090{
tree ret = t;

/* If the type isn't laid out yet, don't copy it.  If something
   needs it for real it should wait until the type got finished.  */
if (!TYPE_SIZE (t)((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2095, __FUNCTION__))->type_common.size))
  return t;

if (!TYPE_LANG_SPECIFIC (t)((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2098, __FUNCTION__))->type_with_lang_specific.lang_specific
))
  TYPE_LANG_SPECIFIC (t)((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2099, __FUNCTION__))->type_with_lang_specific.lang_specific
) = ggc_cleared_alloc<struct lang_type> ();
/* If we're dealing with this very node already further up
   the call chain (recursion via pointers and struct members)
   we haven't yet determined if we really need a new type node.
   Assume we don't, return T itself.  */
if (TYPE_LANG_SPECIFIC (t)((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2104, __FUNCTION__))->type_with_lang_specific.lang_specific
)->nonrestricted_type == error_mark_nodeglobal_trees[TI_ERROR_MARK])
  return t;

/* If we have calculated this all already, just return it.  */
if (TYPE_LANG_SPECIFIC (t)((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2108, __FUNCTION__))->type_with_lang_specific.lang_specific
)->nonrestricted_type)
  return TYPE_LANG_SPECIFIC (t)((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2109, __FUNCTION__))->type_with_lang_specific.lang_specific
)->nonrestricted_type;

/* Mark this type.  */
TYPE_LANG_SPECIFIC (t)((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2112, __FUNCTION__))->type_with_lang_specific.lang_specific
)->nonrestricted_type = error_mark_nodeglobal_trees[TI_ERROR_MARK];

switch (TREE_CODE (t)((enum tree_code) (t)->base.code))
  {
    default:
break;

    case POINTER_TYPE:
    case REFERENCE_TYPE:
{
 tree totype = gfc_nonrestricted_type (TREE_TYPE (t)((contains_struct_check ((t), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2122, __FUNCTION__))->typed.type));
 if (totype == TREE_TYPE (t)((contains_struct_check ((t), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2123, __FUNCTION__))->typed.type))
   ret = t;
 else if (TREE_CODE (t)((enum tree_code) (t)->base.code) == POINTER_TYPE)
   ret = build_pointer_type (totype);
 else
   ret = build_reference_type (totype);
 ret = build_qualified_type (ret,
		      TYPE_QUALS (t)((int) ((((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2130, __FUNCTION__))->base.readonly_flag) * TYPE_QUAL_CONST
) | (((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2130, __FUNCTION__))->base.volatile_flag) * TYPE_QUAL_VOLATILE
) | (((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2130, __FUNCTION__))->base.u.bits.atomic_flag) * TYPE_QUAL_ATOMIC
) | (((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2130, __FUNCTION__))->type_common.restrict_flag) * TYPE_QUAL_RESTRICT
) | (((((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2130, __FUNCTION__))->base.u.bits.address_space) & 0xFF
) << 8)))) & ~TYPE_QUAL_RESTRICT);
}
break;

    case ARRAY_TYPE:
{
 tree elemtype = gfc_nonrestricted_type (TREE_TYPE (t)((contains_struct_check ((t), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2136, __FUNCTION__))->typed.type));
 if (elemtype == TREE_TYPE (t)((contains_struct_check ((t), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2137, __FUNCTION__))->typed.type))
   ret = t;
 else
   {
     ret = build_variant_type_copy (t);
     TREE_TYPE (ret)((contains_struct_check ((ret), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2142, __FUNCTION__))->typed.type) = elemtype;
     if (TYPE_LANG_SPECIFIC (t)((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2143, __FUNCTION__))->type_with_lang_specific.lang_specific
)
  && GFC_TYPE_ARRAY_DATAPTR_TYPE (t)(((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2144, __FUNCTION__))->type_with_lang_specific.lang_specific
)->dataptr_type))
{
  tree dataptr_type = GFC_TYPE_ARRAY_DATAPTR_TYPE (t)(((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2146, __FUNCTION__))->type_with_lang_specific.lang_specific
)->dataptr_type);
  dataptr_type = gfc_nonrestricted_type (dataptr_type);
  if (dataptr_type != GFC_TYPE_ARRAY_DATAPTR_TYPE (t)(((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2148, __FUNCTION__))->type_with_lang_specific.lang_specific
)->dataptr_type))
    {
      TYPE_LANG_SPECIFIC (ret)((tree_class_check ((ret), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2150, __FUNCTION__))->type_with_lang_specific.lang_specific
)
	= ggc_cleared_alloc<struct lang_type> ();
      *TYPE_LANG_SPECIFIC (ret)((tree_class_check ((ret), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2152, __FUNCTION__))->type_with_lang_specific.lang_specific
) = *TYPE_LANG_SPECIFIC (t)((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2152, __FUNCTION__))->type_with_lang_specific.lang_specific
);
      GFC_TYPE_ARRAY_DATAPTR_TYPE (ret)(((tree_class_check ((ret), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2153, __FUNCTION__))->type_with_lang_specific.lang_specific
)->dataptr_type) = dataptr_type;
    }
}
   }
}
break;

    case RECORD_TYPE:
    case UNION_TYPE:
    case QUAL_UNION_TYPE:
{
 tree field;
 /* First determine if we need a new type at all.
    Careful, the two calls to gfc_nonrestricted_type per field
    might return different values.  That happens exactly when
    one of the fields reaches back to this very record type
    (via pointers).  The first calls will assume that we don't
    need to copy T (see the error_mark_node marking).  If there
    are any reasons for copying T apart from having to copy T,
    we'll indeed copy it, and the second calls to
    gfc_nonrestricted_type will use that new node if they
    reach back to T.  */
 for (field = TYPE_FIELDS (t)((tree_check3 ((t), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2175, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
)))->type_non_common.values); field; 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/fortran/trans-types.c"
, 2175, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2175, __FUNCTION__))->common.chain)))
   if (TREE_CODE (field)((enum tree_code) (field)->base.code) == FIELD_DECL)
     {
tree elemtype = gfc_nonrestricted_type (TREE_TYPE (field)((contains_struct_check ((field), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2178, __FUNCTION__))->typed.type));
if (elemtype != TREE_TYPE (field)((contains_struct_check ((field), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2179, __FUNCTION__))->typed.type))
  break;
     }
 if (!field)
   break;
 ret = build_variant_type_copy (t);
 TYPE_FIELDS (ret)((tree_check3 ((ret), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2185, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
)))->type_non_common.values) = NULL_TREE(tree) __null;

 /* Here we make sure that as soon as we know we have to copy
    T, that also fields reaching back to us will use the new
    copy.  It's okay if that copy still contains the old fields,
    we won't look at them.  */
 TYPE_LANG_SPECIFIC (t)((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2191, __FUNCTION__))->type_with_lang_specific.lang_specific
)->nonrestricted_type = ret;
 mirror_fields (ret, t);
}
      break;
  }

TYPE_LANG_SPECIFIC (t)((tree_class_check ((t), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2197, __FUNCTION__))->type_with_lang_specific.lang_specific
)->nonrestricted_type = ret;
return ret;
2199}

2201
2202/* Return the type for a symbol.  Special handling is required for character
 types to get the correct level of indirection.
 For functions return the return type.
 For subroutines return void_type_node.
 Calling this multiple times for the same symbol should be avoided,
 especially for character and array types.  */

2209tree
2210gfc_sym_type (gfc_symbol * sym)
2211{
tree type;
int byref;
bool restricted;

/* Procedure Pointers inside COMMON blocks.  */
if (sym->attr.proc_pointer && sym->attr.in_common)
27
←
Assuming field 'proc_pointer' is not equal to 0→
28
←
Assuming field 'in_common' is not equal to 0→
29
←
Taking true branch→
  {
    /* Unset proc_pointer as gfc_get_function_type calls gfc_sym_type.  */
    sym->attr.proc_pointer = 0;
    type = build_pointer_type (gfc_get_function_type (sym));
30
←
Value assigned to field 'deferred', which participates in a condition later→
    sym->attr.proc_pointer = 1;
    return type;
  }

if (sym->attr.flavor == FL_PROCEDURE && !sym->attr.function)
  return void_type_nodeglobal_trees[TI_VOID_TYPE];

/* In the case of a function the fake result variable may have a
   type different from the function type, so don't return early in
   that case.  */
if (sym->backend_decl && !sym->attr.function)
  return TREE_TYPE (sym->backend_decl)((contains_struct_check ((sym->backend_decl), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2233, __FUNCTION__))->typed.type);

if (sym->attr.result
    && sym->ts.type == BT_CHARACTER
    && sym->ts.u.cl->backend_decl == NULL_TREE(tree) __null
    && sym->ns->proc_name
    && sym->ns->proc_name->ts.u.cl
    && sym->ns->proc_name->ts.u.cl->backend_decl != NULL_TREE(tree) __null)
  sym->ts.u.cl->backend_decl = sym->ns->proc_name->ts.u.cl->backend_decl;

if (sym->ts.type == BT_CHARACTER
    && ((sym->attr.function && sym->attr.is_bind_c)
 || (sym->attr.result
     && sym->ns->proc_name
     && sym->ns->proc_name->attr.is_bind_c)
 || (sym->ts.deferred && (!sym->ts.u.cl
		   || !sym->ts.u.cl->backend_decl))))
  type = gfc_character1_type_node;
else
  type = gfc_typenode_for_spec (&sym->ts, sym->attr.codimension);

if (sym->attr.dummy && !sym->attr.function && !sym->attr.value
    && !sym->pass_as_value)
  byref = 1;
else
  byref = 0;

restricted = !sym->attr.target && !sym->attr.pointer
             && !sym->attr.proc_pointer && !sym->attr.cray_pointee;
if (!restricted)
  type = gfc_nonrestricted_type (type);

if (sym->attr.dimension || sym->attr.codimension)
  {
    if (gfc_is_nodesc_array (sym))
      {
 /* If this is a character argument of unknown length, just use the
    base type.  */
 if (sym->ts.type != BT_CHARACTER
     || !(sym->attr.dummy || sym->attr.function)
     || sym->ts.u.cl->backend_decl)
   {
     type = gfc_get_nodesc_array_type (type, sym->as,
				byref ? PACKED_FULL
				      : PACKED_STATIC,
				restricted);
     byref = 0;
   }
      }
    else
{
 enum gfc_array_kind akind = GFC_ARRAY_UNKNOWN;
 if (sym->attr.pointer)
   akind = sym->attr.contiguous ? GFC_ARRAY_POINTER_CONT
			 : GFC_ARRAY_POINTER;
 else if (sym->attr.allocatable)
   akind = GFC_ARRAY_ALLOCATABLE;
 type = gfc_build_array_type (type, sym->as, akind, restricted,
		       sym->attr.contiguous, false);
}
  }
else
  {
    if (sym->attr.allocatable || sym->attr.pointer
 || gfc_is_associate_pointer (sym))
type = gfc_build_pointer_type (sym, type);
  }

/* We currently pass all parameters by reference.
   See f95_get_function_decl.  For dummy function parameters return the
   function type.  */
if (byref)
  {
    /* We must use pointer types for potentially absent variables.  The
optimizers assume a reference type argument is never NULL.  */
    if (sym->attr.optional
 || (sym->ns->proc_name && sym->ns->proc_name->attr.entry_master))
type = build_pointer_type (type);
    else
{
 type = build_reference_type (type);
 if (restricted)
   type = build_qualified_type (type, TYPE_QUAL_RESTRICT);
}
  }

return (type);
2320}
2321
2322/* Layout and output debug info for a record type.  */

2324void
2325gfc_finish_type (tree type)
2326{
tree decl;

decl = build_decl (input_location,
     TYPE_DECL, NULL_TREE(tree) __null, type);
TYPE_STUB_DECL (type)(((contains_struct_check (((tree_class_check ((type), (tcc_type
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2331, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2331, __FUNCTION__))->common.chain)) = decl;
layout_type (type);
rest_of_type_compilation (type, 1);
rest_of_decl_compilation (decl, 1, 0);
2335}
2336
2337/* Add a field of given NAME and TYPE to the context of a UNION_TYPE
 or RECORD_TYPE pointed to by CONTEXT.  The new field is chained
 to the end of the field list pointed to by *CHAIN.

 Returns a pointer to the new field.  */

2343static tree
2344gfc_add_field_to_struct_1 (tree context, tree name, tree type, tree **chain)
2345{
tree decl = build_decl (input_location, FIELD_DECL, name, type);

DECL_CONTEXT (decl)((contains_struct_check ((decl), (TS_DECL_MINIMAL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2348, __FUNCTION__))->decl_minimal.context) = context;
DECL_CHAIN (decl)(((contains_struct_check (((contains_struct_check ((decl), (TS_DECL_MINIMAL
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2349, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2349, __FUNCTION__))->common.chain)) = NULL_TREE(tree) __null;
if (TYPE_FIELDS (context)((tree_check3 ((context), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2350, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
)))->type_non_common.values) == NULL_TREE(tree) __null)
  TYPE_FIELDS (context)((tree_check3 ((context), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2351, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
)))->type_non_common.values) = decl;
if (chain != NULL__null)
  {
    if (*chain != NULL__null)
**chain = decl;
    *chain = &DECL_CHAIN (decl)(((contains_struct_check (((contains_struct_check ((decl), (TS_DECL_MINIMAL
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2356, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2356, __FUNCTION__))->common.chain));
  }

return decl;
2360}

2362/* Like `gfc_add_field_to_struct_1', but adds alignment
 information.  */

2365tree
2366gfc_add_field_to_struct (tree context, tree name, tree type, tree **chain)
2367{
tree decl = gfc_add_field_to_struct_1 (context, name, type, chain);

DECL_INITIAL (decl)((contains_struct_check ((decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2370, __FUNCTION__))->decl_common.initial) = 0;
SET_DECL_ALIGN (decl, 0)(((contains_struct_check ((decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2371, __FUNCTION__))->decl_common.align) = ffs_hwi (0));
DECL_USER_ALIGN (decl)((contains_struct_check ((decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2372, __FUNCTION__))->base.u.bits.user_align) = 0;

return decl;
2375}


2378/* Copy the backend_decl and component backend_decls if
 the two derived type symbols are "equal", as described
 in 4.4.2 and resolved by gfc_compare_derived_types.  */

2382int
2383gfc_copy_dt_decls_ifequal (gfc_symbol *from, gfc_symbol *to,
	   bool from_gsym)
2385{
gfc_component *to_cm;
gfc_component *from_cm;

if (from == to)
  return 1;

if (from->backend_decl == NULL__null
|| !gfc_compare_derived_types (from, to))
  return 0;

to->backend_decl = from->backend_decl;

to_cm = to->components;
from_cm = from->components;

/* Copy the component declarations.  If a component is itself
   a derived type, we need a copy of its component declarations.
   This is done by recursing into gfc_get_derived_type and
   ensures that the component's component declarations have
   been built.  If it is a character, we need the character
   length, as well.  */
for (; to_cm; to_cm = to_cm->next, from_cm = from_cm->next)
  {
    to_cm->backend_decl = from_cm->backend_decl;
    to_cm->caf_token = from_cm->caf_token;
    if (from_cm->ts.type == BT_UNION)
      gfc_get_union_type (to_cm->ts.u.derived);
    else if (from_cm->ts.type == BT_DERIVED
 && (!from_cm->attr.pointer || from_gsym))
gfc_get_derived_type (to_cm->ts.u.derived);
    else if (from_cm->ts.type == BT_CLASS
      && (!CLASS_DATA (from_cm)from_cm->ts.u.derived->components->attr.class_pointer || from_gsym))
gfc_get_derived_type (to_cm->ts.u.derived);
    else if (from_cm->ts.type == BT_CHARACTER)
to_cm->ts.u.cl->backend_decl = from_cm->ts.u.cl->backend_decl;
  }

return 1;
2424}


2427/* Build a tree node for a procedure pointer component.  */

2429tree
2430gfc_get_ppc_type (gfc_component* c)
2431{
tree t;

/* Explicit interface.  */
if (c->attr.if_source != IFSRC_UNKNOWN && c->ts.interface)
  return build_pointer_type (gfc_get_function_type (c->ts.interface));

/* Implicit interface (only return value may be known).  */
if (c->attr.function && !c->attr.dimension && c->ts.type != BT_CHARACTER)
  t = gfc_typenode_for_spec (&c->ts);
else
  t = void_type_nodeglobal_trees[TI_VOID_TYPE];

/* FIXME: it would be better to provide explicit interfaces in all
   cases, since they should be known by the compiler.  */
return build_pointer_type (build_function_type (t, NULL_TREE(tree) __null));
2447}


2450/* Build a tree node for a union type. Requires building each map
 structure which is an element of the union. */

2453tree
2454gfc_get_union_type (gfc_symbol *un)
2455{
  gfc_component *map = NULL__null;
  tree typenode = NULL__null, map_type = NULL__null, map_field = NULL__null;
  tree *chain = NULL__null;

  if (un->backend_decl)
    {
      if (TYPE_FIELDS (un->backend_decl)((tree_check3 ((un->backend_decl), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2462, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
)))->type_non_common.values) || un->attr.proc_pointer_comp)
        return un->backend_decl;
      else
        typenode = un->backend_decl;
    }
  else
    {
      typenode = make_node (UNION_TYPE);
      TYPE_NAME (typenode)((tree_class_check ((typenode), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2470, __FUNCTION__))->type_common.name) = get_identifier (un->name)(__builtin_constant_p (un->name) ? get_identifier_with_length
 ((un->name), strlen (un->name)) : get_identifier (un->
name));
    }

  /* Add each contained MAP as a field. */
  for (map = un->components; map; map = map->next)
    {
      gcc_assert (map->ts.type == BT_DERIVED)((void)(!(map->ts.type == BT_DERIVED) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2476, __FUNCTION__), 0 : 0));

      /* The map's type node, which is defined within this union's context. */
      map_type = gfc_get_derived_type (map->ts.u.derived);
      TYPE_CONTEXT (map_type)((tree_class_check ((map_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2480, __FUNCTION__))->type_common.context) = typenode;

      /* The map field's declaration. */
      map_field = gfc_add_field_to_struct(typenode, get_identifier(map->name)(__builtin_constant_p (map->name) ? get_identifier_with_length
 ((map->name), strlen (map->name)) : get_identifier (map
->name)),
                                          map_type, &chain);
      if (map->loc.lb)
        gfc_set_decl_location (map_field, &map->loc);
      else if (un->declared_at.lb)
        gfc_set_decl_location (map_field, &un->declared_at);

      DECL_PACKED (map_field)((tree_check ((map_field), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2490, __FUNCTION__, (FIELD_DECL)))->base.u.bits.packed_flag
) |= TYPE_PACKED (typenode)((tree_class_check ((typenode), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2490, __FUNCTION__))->base.u.bits.packed_flag);
      DECL_NAMELESS(map_field)((contains_struct_check ((map_field), (TS_DECL_MINIMAL), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2491, __FUNCTION__))->base.u.bits.nameless_flag) = true;

      /* We should never clobber another backend declaration for this map,
         because each map component is unique. */
      if (!map->backend_decl)
        map->backend_decl = map_field;
    }

  un->backend_decl = typenode;
  gfc_finish_type (typenode);

  return typenode;
2503}


2506/* Build a tree node for a derived type.  If there are equal
 derived types, with different local names, these are built
 at the same time.  If an equal derived type has been built
 in a parent namespace, this is used.  */

2511tree
2512gfc_get_derived_type (gfc_symbol * derived, int codimen)
2513{
tree typenode = NULL__null, field = NULL__null, field_type = NULL__null;
tree canonical = NULL_TREE(tree) __null;
tree *chain = NULL__null;
bool got_canonical = false;
bool unlimited_entity = false;
gfc_component *c;
gfc_namespace *ns;
tree tmp;
bool coarray_flag;

coarray_flag = flag_coarrayglobal_options.x_flag_coarray == GFC_FCOARRAY_LIB
 && derived->module && !derived->attr.vtype;

gcc_assert (!derived->attr.pdt_template)((void)(!(!derived->attr.pdt_template) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2527, __FUNCTION__), 0 : 0));

if (derived->attr.unlimited_polymorphic
    || (flag_coarrayglobal_options.x_flag_coarray == GFC_FCOARRAY_LIB
 && derived->from_intmod == INTMOD_ISO_FORTRAN_ENV
 && (derived->intmod_sym_id == ISOFORTRAN_LOCK_TYPE
     || derived->intmod_sym_id == ISOFORTRAN_EVENT_TYPE
     || derived->intmod_sym_id == ISOFORTRAN_TEAM_TYPE)))
  return ptr_type_nodeglobal_trees[TI_PTR_TYPE];

if (flag_coarrayglobal_options.x_flag_coarray != GFC_FCOARRAY_LIB
    && derived->from_intmod == INTMOD_ISO_FORTRAN_ENV
    && (derived->intmod_sym_id == ISOFORTRAN_EVENT_TYPE
 || derived->intmod_sym_id == ISOFORTRAN_TEAM_TYPE))
  return gfc_get_int_type (gfc_default_integer_kind);

if (derived && derived->attr.flavor == FL_PROCEDURE
    && derived->attr.generic)
  derived = gfc_find_dt_in_generic (derived);

/* See if it's one of the iso_c_binding derived types.  */
if (derived->attr.is_iso_c == 1 || derived->ts.f90_type == BT_VOID)
  {
    if (derived->backend_decl)
return derived->backend_decl;

    if (derived->intmod_sym_id == ISOCBINDING_PTR)
derived->backend_decl = ptr_type_nodeglobal_trees[TI_PTR_TYPE];
    else
derived->backend_decl = pfunc_type_node;

    derived->ts.kind = gfc_index_integer_kind;
    derived->ts.type = BT_INTEGER;
    /* Set the f90_type to BT_VOID as a way to recognize something of type
       BT_INTEGER that needs to fit a void * for the purpose of the
       iso_c_binding derived types.  */
    derived->ts.f90_type = BT_VOID;

    return derived->backend_decl;
  }

/* If use associated, use the module type for this one.  */
if (derived->backend_decl == NULL__null
    && (derived->attr.use_assoc || derived->attr.used_in_submodule)
    && derived->module
    && gfc_get_module_backend_decl (derived))
  goto copy_derived_types;

/* The derived types from an earlier namespace can be used as the
   canonical type.  */
if (derived->backend_decl == NULL__null
    && !derived->attr.use_assoc
    && !derived->attr.used_in_submodule
    && gfc_global_ns_list)
  {
    for (ns = gfc_global_ns_list;
  ns->translated && !got_canonical;
  ns = ns->sibling)
{
 if (ns->derived_types)
   {
     for (gfc_symbol *dt = ns->derived_types; dt && !got_canonical;
   dt = dt->dt_next)
{
  gfc_copy_dt_decls_ifequal (dt, derived, true);
  if (derived->backend_decl)
    got_canonical = true;
  if (dt->dt_next == ns->derived_types)
    break;
}
    }
}
  }

/* Store up the canonical type to be added to this one.  */
if (got_canonical)
  {
    if (TYPE_CANONICAL (derived->backend_decl)((tree_class_check ((derived->backend_decl), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2604, __FUNCTION__))->type_common.canonical))
canonical = TYPE_CANONICAL (derived->backend_decl)((tree_class_check ((derived->backend_decl), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2605, __FUNCTION__))->type_common.canonical);
    else
canonical = derived->backend_decl;

    derived->backend_decl = NULL_TREE(tree) __null;
  }

/* derived->backend_decl != 0 means we saw it before, but its
   components' backend_decl may have not been built.  */
if (derived->backend_decl)
  {
    /* Its components' backend_decl have been built or we are
seeing recursion through the formal arglist of a procedure
pointer component.  */
    if (TYPE_FIELDS (derived->backend_decl)((tree_check3 ((derived->backend_decl), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2619, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
)))->type_non_common.values))
      return derived->backend_decl;
    else if (derived->attr.abstract
      && derived->attr.proc_pointer_comp)
{
 /* If an abstract derived type with procedure pointer
    components has no other type of component, return the
    backend_decl. Otherwise build the components if any of the
    non-procedure pointer components have no backend_decl.  */
 for (c = derived->components; c; c = c->next)
   {
     bool same_alloc_type = c->attr.allocatable
		     && derived == c->ts.u.derived;
     if (!c->attr.proc_pointer
  && !same_alloc_type
  && c->backend_decl == NULL__null)
break;
     else if (c->next == NULL__null)
return derived->backend_decl;
   }
 typenode = derived->backend_decl;
}
    else
      typenode = derived->backend_decl;
  }
else
  {
    /* We see this derived type first time, so build the type node.  */
    typenode = make_node (RECORD_TYPE);
    TYPE_NAME (typenode)((tree_class_check ((typenode), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2648, __FUNCTION__))->type_common.name) = get_identifier (derived->name)(__builtin_constant_p (derived->name) ? get_identifier_with_length
 ((derived->name), strlen (derived->name)) : get_identifier
 (derived->name));
    TYPE_PACKED (typenode)((tree_class_check ((typenode), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2649, __FUNCTION__))->base.u.bits.packed_flag) = flag_pack_derivedglobal_options.x_flag_pack_derived;
    derived->backend_decl = typenode;
  }

if (derived->components
&& derived->components->ts.type == BT_DERIVED
&& strcmp (derived->components->name, "_data") == 0
&& derived->components->ts.u.derived->attr.unlimited_polymorphic)
  unlimited_entity = true;

/* Go through the derived type components, building them as
   necessary. The reason for doing this now is that it is
   possible to recurse back to this derived type through a
   pointer component (PR24092). If this happens, the fields
   will be built and so we can return the type.  */
for (c = derived->components; c; c = c->next)
  {
    bool same_alloc_type = c->attr.allocatable
	     && derived == c->ts.u.derived;

    if (c->ts.type == BT_UNION && c->ts.u.derived->backend_decl == NULL__null)
      c->ts.u.derived->backend_decl = gfc_get_union_type (c->ts.u.derived);

    if (c->ts.type != BT_DERIVED && c->ts.type != BT_CLASS)
continue;

    if ((!c->attr.pointer && !c->attr.proc_pointer
 && !same_alloc_type)
 || c->ts.u.derived->backend_decl == NULL__null)
{
 int local_codim = c->attr.codimension ? c->as->corank: codimen;
 c->ts.u.derived->backend_decl = gfc_get_derived_type (c->ts.u.derived,
						local_codim);
}

    if (c->ts.u.derived->attr.is_iso_c)
      {
        /* Need to copy the modified ts from the derived type.  The
           typespec was modified because C_PTR/C_FUNPTR are translated
           into (void *) from derived types.  */
        c->ts.type = c->ts.u.derived->ts.type;
        c->ts.kind = c->ts.u.derived->ts.kind;
        c->ts.f90_type = c->ts.u.derived->ts.f90_type;
 if (c->initializer)
   {
     c->initializer->ts.type = c->ts.type;
     c->initializer->ts.kind = c->ts.kind;
     c->initializer->ts.f90_type = c->ts.f90_type;
     c->initializer->expr_type = EXPR_NULL;
   }
      }
  }

if (TYPE_FIELDS (derived->backend_decl)((tree_check3 ((derived->backend_decl), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2702, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
)))->type_non_common.values))
  return derived->backend_decl;

/* Build the type member list. Install the newly created RECORD_TYPE
   node as DECL_CONTEXT of each FIELD_DECL. In this case we must go
   through only the top-level linked list of components so we correctly
   build UNION_TYPE nodes for BT_UNION components. MAPs and other nested
   types are built as part of gfc_get_union_type.  */
for (c = derived->components; c; c = c->next)
  {
    bool same_alloc_type = c->attr.allocatable
	     && derived == c->ts.u.derived;
    /* Prevent infinite recursion, when the procedure pointer type is
the same as derived, by forcing the procedure pointer component to
be built as if the explicit interface does not exist.  */
    if (c->attr.proc_pointer
 && (c->ts.type != BT_DERIVED || (c->ts.u.derived
    && !gfc_compare_derived_types (derived, c->ts.u.derived)))
 && (c->ts.type != BT_CLASS || (CLASS_DATA (c)c->ts.u.derived->components->ts.u.derived
    && !gfc_compare_derived_types (derived, CLASS_DATA (c)c->ts.u.derived->components->ts.u.derived))))
field_type = gfc_get_ppc_type (c);
    else if (c->attr.proc_pointer && derived->backend_decl)
{
 tmp = build_function_type (derived->backend_decl, NULL_TREE(tree) __null);
 field_type = build_pointer_type (tmp);
}
    else if (c->ts.type == BT_DERIVED || c->ts.type == BT_CLASS)
field_type = c->ts.u.derived->backend_decl;
    else if (c->attr.caf_token)
field_type = pvoid_type_node;
    else
{
 if (c->ts.type == BT_CHARACTER
     && !c->ts.deferred && !c->attr.pdt_string)
   {
     /* Evaluate the string length.  */
     gfc_conv_const_charlen (c->ts.u.cl);
     gcc_assert (c->ts.u.cl->backend_decl)((void)(!(c->ts.u.cl->backend_decl) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2739, __FUNCTION__), 0 : 0));
   }
 else if (c->ts.type == BT_CHARACTER)
   c->ts.u.cl->backend_decl
	= build_int_cst (gfc_charlen_type_node, 0);

 field_type = gfc_typenode_for_spec (&c->ts, codimen);
}

    /* This returns an array descriptor type.  Initialization may be
       required.  */
    if ((c->attr.dimension || c->attr.codimension) && !c->attr.proc_pointer )
{
 if (c->attr.pointer || c->attr.allocatable || c->attr.pdt_array)
   {
     enum gfc_array_kind akind;
     if (c->attr.pointer)
akind = c->attr.contiguous ? GFC_ARRAY_POINTER_CONT
			   : GFC_ARRAY_POINTER;
     else
akind = GFC_ARRAY_ALLOCATABLE;
     /* Pointers to arrays aren't actually pointer types.  The
        descriptors are separate, but the data is common.  */
     field_type = gfc_build_array_type (field_type, c->as, akind,
				 !c->attr.target
				 && !c->attr.pointer,
				 c->attr.contiguous,
				 codimen);
   }
 else
   field_type = gfc_get_nodesc_array_type (field_type, c->as,
				    PACKED_STATIC,
				    !c->attr.target);
}
    else if ((c->attr.pointer || c->attr.allocatable || c->attr.pdt_string)
      && !c->attr.proc_pointer
      && !(unlimited_entity && c == derived->components))
field_type = build_pointer_type (field_type);

    if (c->attr.pointer || same_alloc_type)
field_type = gfc_nonrestricted_type (field_type);

    /* vtype fields can point to different types to the base type.  */
    if (c->ts.type == BT_DERIVED
   && c->ts.u.derived && c->ts.u.derived->attr.vtype)
 field_type = build_pointer_type_for_mode (TREE_TYPE (field_type)((contains_struct_check ((field_type), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2784, __FUNCTION__))->typed.type),
				    ptr_mode, true);

    /* Ensure that the CLASS language specific flag is set.  */
    if (c->ts.type == BT_CLASS)
{
 if (POINTER_TYPE_P (field_type)(((enum tree_code) (field_type)->base.code) == POINTER_TYPE
 || ((enum tree_code) (field_type)->base.code) == REFERENCE_TYPE
))
   GFC_CLASS_TYPE_P (TREE_TYPE (field_type))((tree_class_check ((((contains_struct_check ((field_type), (
TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2791, __FUNCTION__))->typed.type)), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2791, __FUNCTION__))->type_common.lang_flag_4) = 1;
 else
   GFC_CLASS_TYPE_P (field_type)((tree_class_check ((field_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2793, __FUNCTION__))->type_common.lang_flag_4) = 1;
}

    field = gfc_add_field_to_struct (typenode,
		       get_identifier (c->name)(__builtin_constant_p (c->name) ? get_identifier_with_length
 ((c->name), strlen (c->name)) : get_identifier (c->
name)),
		       field_type, &chain);
    if (c->loc.lb)
gfc_set_decl_location (field, &c->loc);
    else if (derived->declared_at.lb)
gfc_set_decl_location (field, &derived->declared_at);

    gfc_finish_decl_attrs (field, &c->attr);

    DECL_PACKED (field)((tree_check ((field), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2806, __FUNCTION__, (FIELD_DECL)))->base.u.bits.packed_flag
) |= TYPE_PACKED (typenode)((tree_class_check ((typenode), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2806, __FUNCTION__))->base.u.bits.packed_flag);

    gcc_assert (field)((void)(!(field) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2808, __FUNCTION__), 0 : 0));
    if (!c->backend_decl)
c->backend_decl = field;

    if (c->attr.pointer && c->attr.dimension
 && !(c->ts.type == BT_DERIVED
      && strcmp (c->name, "_data") == 0))
GFC_DECL_PTR_ARRAY_P (c->backend_decl)((contains_struct_check ((c->backend_decl), (TS_DECL_COMMON
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2815, __FUNCTION__))->decl_common.lang_flag_6) = 1;
  }

/* Now lay out the derived type, including the fields.  */
if (canonical)
  TYPE_CANONICAL (typenode)((tree_class_check ((typenode), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2820, __FUNCTION__))->type_common.canonical) = canonical;

gfc_finish_type (typenode);
gfc_set_decl_location (TYPE_STUB_DECL (typenode)(((contains_struct_check (((tree_class_check ((typenode), (tcc_type
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2823, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2823, __FUNCTION__))->common.chain)), &derived->declared_at);
if (derived->module && derived->ns->proc_name
    && derived->ns->proc_name->attr.flavor == FL_MODULE)
  {
    if (derived->ns->proc_name->backend_decl
 && TREE_CODE (derived->ns->proc_name->backend_decl)((enum tree_code) (derived->ns->proc_name->backend_decl
)->base.code)
    == NAMESPACE_DECL)
{
 TYPE_CONTEXT (typenode)((tree_class_check ((typenode), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2831, __FUNCTION__))->type_common.context) = derived->ns->proc_name->backend_decl;
 DECL_CONTEXT (TYPE_STUB_DECL (typenode))((contains_struct_check (((((contains_struct_check (((tree_class_check
 ((typenode), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2832, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2832, __FUNCTION__))->common.chain))), (TS_DECL_MINIMAL)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2832, __FUNCTION__))->decl_minimal.context)
   = derived->ns->proc_name->backend_decl;
}
  }

derived->backend_decl = typenode;

2839copy_derived_types:

for (c = derived->components; c; c = c->next)
  {
    /* Do not add a caf_token field for class container components.  */
    if ((codimen || coarray_flag)
 && !c->attr.dimension && !c->attr.codimension
 && (c->attr.allocatable || c->attr.pointer)
 && !derived->attr.is_class)
{
 /* Provide sufficient space to hold "_caf_symbol".  */
 char caf_name[GFC_MAX_SYMBOL_LEN63 + 6];
 gfc_component *token;
 snprintf (caf_name, sizeof (caf_name), "_caf_%s", c->name);
 token = gfc_find_component (derived, caf_name, true, true, NULL__null);
 gcc_assert (token)((void)(!(token) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2854, __FUNCTION__), 0 : 0));
 c->caf_token = token->backend_decl;
 TREE_NO_WARNING (c->caf_token)((c->caf_token)->base.nowarning_flag) = 1;
}
  }

for (gfc_symbol *dt = gfc_derived_types; dt; dt = dt->dt_next)
  {
    gfc_copy_dt_decls_ifequal (derived, dt, false);
    if (dt->dt_next == gfc_derived_types)
break;
  }

return derived->backend_decl;
2868}


2871int
2872gfc_return_by_reference (gfc_symbol * sym)
2873{
if (!sym->attr.function)
13
←
Assuming field 'function' is not equal to 0→
14
←
Taking false branch→
  return 0;

if (sym->attr.dimension)
15
←
Assuming field 'dimension' is 0→
16
←
Taking false branch→
  return 1;

if (sym->ts.type16.1
Field 'type' is not equal to BT_CHARACTER
1
Field 'type' is not equal to BT_CHARACTER
 == BT_CHARACTER
    && !sym->attr.is_bind_c
    && (!sym->attr.result
 || !sym->ns->proc_name
 || !sym->ns->proc_name->attr.is_bind_c))
  return 1;

/* Possibly return complex numbers by reference for g77 compatibility.
   We don't do this for calls to intrinsics (as the library uses the
   -fno-f2c calling convention), nor for calls to functions which always
   require an explicit interface, as no compatibility problems can
   arise there.  */
if (flag_f2cglobal_options.x_flag_f2c && sym->ts.type == BT_COMPLEX
17
←
Assuming field 'x_flag_f2c' is not equal to 0→
18
←
Assuming field 'type' is equal to BT_COMPLEX→
21
←
Taking true branch→
    && !sym->attr.intrinsic && !sym->attr.always_explicit)
19
←
Assuming field 'intrinsic' is 0→
20
←
Assuming field 'always_explicit' is 0→
  return 1;
22
←
Returning without writing to 'sym->ts.deferred', which participates in a condition later→
23
←
Returning the value 1, which participates in a condition later→

return 0;
2897}
2898
2899static tree
2900gfc_get_mixed_entry_union (gfc_namespace *ns)
2901{
tree type;
tree *chain = NULL__null;
char name[GFC_MAX_SYMBOL_LEN63 + 1];
gfc_entry_list *el, *el2;

gcc_assert (ns->proc_name->attr.mixed_entry_master)((void)(!(ns->proc_name->attr.mixed_entry_master) ? fancy_abort
 ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2907, __FUNCTION__), 0 : 0));
gcc_assert (memcmp (ns->proc_name->name, "master.", 7) == 0)((void)(!(memcmp (ns->proc_name->name, "master.", 7) ==
 0) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2908, __FUNCTION__), 0 : 0));

snprintf (name, GFC_MAX_SYMBOL_LEN63, "munion.%s", ns->proc_name->name + 7);

/* Build the type node.  */
type = make_node (UNION_TYPE);

TYPE_NAME (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2915, __FUNCTION__))->type_common.name) = get_identifier (name)(__builtin_constant_p (name) ? get_identifier_with_length ((name
), strlen (name)) : get_identifier (name));

for (el = ns->entries; el; el = el->next)
  {
    /* Search for duplicates.  */
    for (el2 = ns->entries; el2 != el; el2 = el2->next)
if (el2->sym->result == el->sym->result)
 break;

    if (el == el2)
gfc_add_field_to_struct_1 (type,
		   get_identifier (el->sym->result->name)(__builtin_constant_p (el->sym->result->name) ? get_identifier_with_length
 ((el->sym->result->name), strlen (el->sym->result
->name)) : get_identifier (el->sym->result->name)
),
		   gfc_sym_type (el->sym->result), &chain);
  }

/* Finish off the type.  */
gfc_finish_type (type);
TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type))((tree_check (((((contains_struct_check (((tree_class_check (
(type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2932, __FUNCTION__))), (TS_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2932, __FUNCTION__))->common.chain))), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 2932, __FUNCTION__, (TYPE_DECL)))->decl_common.decl_flag_1
) = 1;
return type;
2934}
2935
2936/* Create a "fn spec" based on the formal arguments;
 cf. create_function_arglist.  */

2939static tree
2940create_fn_spec (gfc_symbol *sym, tree fntype)
2941{
char spec[150];
size_t spec_len;
gfc_formal_arglist *f;
tree tmp;

memset (&spec, 0, sizeof (spec));
spec[0] = '.';
spec[1] = ' ';
spec_len = 2;

if (sym->attr.entry_master)
  {
    spec[spec_len++] = 'R';
    spec[spec_len++] = ' ';
  }
if (gfc_return_by_reference (sym))
  {
    gfc_symbol *result = sym->result ? sym->result : sym;

    if (result->attr.pointer || sym->attr.proc_pointer)
{
 spec[spec_len++] = '.';
 spec[spec_len++] = ' ';
}
    else
{
 spec[spec_len++] = 'w';
 spec[spec_len++] = ' ';
}
    if (sym->ts.type == BT_CHARACTER)
{
 spec[spec_len++] = 'R';
 spec[spec_len++] = ' ';
}
  }

for (f = gfc_sym_get_dummy_args (sym); f; f = f->next)
  if (spec_len < sizeof (spec))
    {
if (!f->sym || f->sym->attr.pointer || f->sym->attr.target
   || f->sym->attr.external || f->sym->attr.cray_pointer
   || (f->sym->ts.type == BT_DERIVED
&& (f->sym->ts.u.derived->attr.proc_pointer_comp
    || f->sym->ts.u.derived->attr.pointer_comp))
   || (f->sym->ts.type == BT_CLASS
&& (CLASS_DATA (f->sym)f->sym->ts.u.derived->components->ts.u.derived->attr.proc_pointer_comp
    || CLASS_DATA (f->sym)f->sym->ts.u.derived->components->ts.u.derived->attr.pointer_comp))
   || (f->sym->ts.type == BT_INTEGER && f->sym->ts.is_c_interop))
 {
   spec[spec_len++] = '.';
   spec[spec_len++] = ' ';
 }
else if (f->sym->attr.intent == INTENT_IN)
 {
   spec[spec_len++] = 'r';
   spec[spec_len++] = ' ';
 }
else if (f->sym)
 {
   spec[spec_len++] = 'w';
   spec[spec_len++] = ' ';
 }
    }

tmp = build_tree_list (NULL_TREE(tree) __null, build_string (spec_len, spec));
tmp = tree_cons (get_identifier ("fn spec")(__builtin_constant_p ("fn spec") ? get_identifier_with_length
 (("fn spec"), strlen ("fn spec")) : get_identifier ("fn spec"
)), tmp, TYPE_ATTRIBUTES (fntype)((tree_class_check ((fntype), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3007, __FUNCTION__))->type_common.attributes));
return build_type_attribute_variant (fntype, tmp);
3009}

3011tree
3012gfc_get_function_type (gfc_symbol * sym, gfc_actual_arglist *actual_args,
       const char *fnspec)
3014{
tree type;
vec<tree, va_gc> *typelist = NULL__null;
gfc_formal_arglist *f;
gfc_symbol *arg;
int alternate_return = 0;
bool is_varargs = true;

/* Make sure this symbol is a function, a subroutine or the main
   program.  */
gcc_assert (sym->attr.flavor == FL_PROCEDURE((void)(!(sym->attr.flavor == FL_PROCEDURE || sym->attr
.flavor == FL_PROGRAM) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3025, __FUNCTION__), 0 : 0))
1
Assuming field 'flavor' is not equal to FL_PROCEDURE→
2
←
Assuming field 'flavor' is equal to FL_PROGRAM→
3
←
'?' condition is false→
     || sym->attr.flavor == FL_PROGRAM)((void)(!(sym->attr.flavor == FL_PROCEDURE || sym->attr
.flavor == FL_PROGRAM) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3025, __FUNCTION__), 0 : 0));

/* To avoid recursing infinitely on recursive types, we use error_mark_node
   so that they can be detected here and handled further down.  */
if (sym->backend_decl == NULL__null)
4
←
Assuming field 'backend_decl' is equal to NULL→
5
←
Taking true branch→
  sym->backend_decl = error_mark_nodeglobal_trees[TI_ERROR_MARK];
else if (sym->backend_decl == error_mark_nodeglobal_trees[TI_ERROR_MARK])
  goto arg_type_list_done;
else if (sym->attr.proc_pointer)
  return TREE_TYPE (TREE_TYPE (sym->backend_decl))((contains_struct_check ((((contains_struct_check ((sym->backend_decl
), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3034, __FUNCTION__))->typed.type)), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3034, __FUNCTION__))->typed.type);
else
  return TREE_TYPE (sym->backend_decl)((contains_struct_check ((sym->backend_decl), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3036, __FUNCTION__))->typed.type);

if (sym->attr.entry_master)
6
←
Assuming field 'entry_master' is 0→
7
←
Taking false branch→
  /* Additional parameter for selecting an entry point.  */
  vec_safe_push (typelist, gfc_array_index_type);

if (sym->result)
8
←
Assuming field 'result' is null→
9
←
Taking false branch→
  arg = sym->result;
else
  arg = sym;

if (arg->ts.type == BT_CHARACTER)
10
←
Assuming field 'type' is not equal to BT_CHARACTER→
11
←
Taking false branch→
  gfc_conv_const_charlen (arg->ts.u.cl);

/* Some functions we use an extra parameter for the return value.  */
if (gfc_return_by_reference (sym))
12
←
Calling 'gfc_return_by_reference'→
24
←
Returning from 'gfc_return_by_reference'→
25
←
Taking true branch→
  {
    type = gfc_sym_type (arg);
26
←
Calling 'gfc_sym_type'→
31
←
Returning from 'gfc_sym_type'→
    if (arg->ts.type == BT_COMPLEX
32
←
Assuming field 'type' is not equal to BT_COMPLEX→
 || arg->attr.dimension
33
←
Assuming field 'dimension' is not equal to 0→
 || arg->ts.type == BT_CHARACTER)
type = build_reference_type (type);

    vec_safe_push (typelist, type);
34
←
Calling 'vec_safe_push<tree_node *, va_gc>'→
55
←
Returning from 'vec_safe_push<tree_node *, va_gc>'→
    if (arg->ts.type == BT_CHARACTER)
56
←
Assuming field 'type' is equal to BT_CHARACTER→
57
←
Taking true branch→
{
 if (!arg->ts.deferred)
58
←
Assuming field 'deferred' is false→
59
←
Taking true branch→
   /* Transfer by value.  */
   vec_safe_push (typelist, gfc_charlen_type_node);
60
←
Passing value via 1st parameter 'v'→
61
←
Calling 'vec_safe_push<tree_node *, va_gc>'→
 else
   /* Deferred character lengths are transferred by reference
      so that the value can be returned.  */
   vec_safe_push (typelist, build_pointer_type(gfc_charlen_type_node));
}
  }
if (sym->backend_decl == error_mark_nodeglobal_trees[TI_ERROR_MARK] && actual_args != NULL__null
    && sym->formal == NULL__null && (sym->attr.proc == PROC_EXTERNAL
		 || sym->attr.proc == PROC_UNKNOWN))
  gfc_get_formal_from_actual_arglist (sym, actual_args);

/* Build the argument types for the function.  */
for (f = gfc_sym_get_dummy_args (sym); f; f = f->next)
  {
    arg = f->sym;
    if (arg)
{
 /* Evaluate constant character lengths here so that they can be
    included in the type.  */
 if (arg->ts.type == BT_CHARACTER)
   gfc_conv_const_charlen (arg->ts.u.cl);

 if (arg->attr.flavor == FL_PROCEDURE)
   {
     type = gfc_get_function_type (arg);
     type = build_pointer_type (type);
   }
 else
   type = gfc_sym_type (arg);

 /* Parameter Passing Convention

    We currently pass all parameters by reference.
    Parameters with INTENT(IN) could be passed by value.
    The problem arises if a function is called via an implicit
    prototype. In this situation the INTENT is not known.
    For this reason all parameters to global functions must be
    passed by reference.  Passing by value would potentially
    generate bad code.  Worse there would be no way of telling that
    this code was bad, except that it would give incorrect results.

    Contained procedures could pass by value as these are never
    used without an explicit interface, and cannot be passed as
    actual parameters for a dummy procedure.  */

 vec_safe_push (typelist, type);
}
    else
      {
        if (sym->attr.subroutine)
          alternate_return = 1;
      }
  }

/* Add hidden string length parameters.  */
for (f = gfc_sym_get_dummy_args (sym); f; f = f->next)
  {
    arg = f->sym;
    if (arg && arg->ts.type == BT_CHARACTER && !sym->attr.is_bind_c)
{
 if (!arg->ts.deferred)
   /* Transfer by value.  */
   type = gfc_charlen_type_node;
 else
   /* Deferred character lengths are transferred by reference
      so that the value can be returned.  */
   type = build_pointer_type (gfc_charlen_type_node);

 vec_safe_push (typelist, type);
}
    /* For noncharacter scalar intrinsic types, VALUE passes the value,
hence, the optional status cannot be transferred via a NULL pointer.
Thus, we will use a hidden argument in that case.  */
    else if (arg
      && arg->attr.optional
      && arg->attr.value
      && !arg->attr.dimension
      && arg->ts.type != BT_CLASS
      && !gfc_bt_struct (arg->ts.type)((arg->ts.type) == BT_DERIVED || (arg->ts.type) == BT_UNION
))
vec_safe_push (typelist, boolean_type_nodeglobal_trees[TI_BOOLEAN_TYPE]);
  }

if (!vec_safe_is_empty (typelist)
    || sym->attr.is_main_program
    || sym->attr.if_source != IFSRC_UNKNOWN)
  is_varargs = false;

if (sym->backend_decl == error_mark_nodeglobal_trees[TI_ERROR_MARK])
  sym->backend_decl = NULL_TREE(tree) __null;

3155arg_type_list_done:

if (alternate_return)
  type = integer_type_nodeinteger_types[itk_int];
else if (!sym->attr.function || gfc_return_by_reference (sym))
  type = void_type_nodeglobal_trees[TI_VOID_TYPE];
else if (sym->attr.mixed_entry_master)
  type = gfc_get_mixed_entry_union (sym->ns);
else if (flag_f2cglobal_options.x_flag_f2c && sym->ts.type == BT_REAL
  && sym->ts.kind == gfc_default_real_kind
  && !sym->attr.always_explicit)
  {
    /* Special case: f2c calling conventions require that (scalar)
default REAL functions return the C type double instead.  f2c
compatibility is only an issue with functions that don't
require an explicit interface, as only these could be
implemented in Fortran 77.  */
    sym->ts.kind = gfc_default_double_kind;
    type = gfc_typenode_for_spec (&sym->ts);
    sym->ts.kind = gfc_default_real_kind;
  }
else if (sym->result && sym->result->attr.proc_pointer)
  /* Procedure pointer return values.  */
  {
    if (sym->result->attr.result && strcmp (sym->name,"ppr@") != 0)
{
 /* Unset proc_pointer as gfc_get_function_type
    is called recursively.  */
 sym->result->attr.proc_pointer = 0;
 type = build_pointer_type (gfc_get_function_type (sym->result));
 sym->result->attr.proc_pointer = 1;
}
    else
     type = gfc_sym_type (sym->result);
  }
else
  type = gfc_sym_type (sym);

if (is_varargs)
  type = build_varargs_function_type_vec (type, typelist)build_varargs_function_type_array (type, vec_safe_length (typelist
), vec_safe_address (typelist));
else
  type = build_function_type_vec (type, typelist)build_function_type_array (type, vec_safe_length (typelist), vec_safe_address
 (typelist));

/* If we were passed an fn spec, add it here, otherwise determine it from
   the formal arguments.  */
if (fnspec)
  {
    tree tmp;
    int spec_len = strlen (fnspec);
    tmp = build_tree_list (NULL_TREE(tree) __null, build_string (spec_len, fnspec));
    tmp = tree_cons (get_identifier ("fn spec")(__builtin_constant_p ("fn spec") ? get_identifier_with_length
 (("fn spec"), strlen ("fn spec")) : get_identifier ("fn spec"
)), tmp, TYPE_ATTRIBUTES (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3205, __FUNCTION__))->type_common.attributes));
    type = build_type_attribute_variant (type, tmp);
  }
else
  type = create_fn_spec (sym, type);

return type;
3212}
3213
3214/* Language hooks for middle-end access to type nodes.  */

3216/* Return an integer type with BITS bits of precision,
 that is unsigned if UNSIGNEDP is nonzero, otherwise signed.  */

3219tree
3220gfc_type_for_size (unsigned bits, int unsignedp)
3221{
if (!unsignedp)
  {
    int i;
    for (i = 0; i <= MAX_INT_KINDS5; ++i)
{
 tree type = gfc_integer_types[i];
 if (type && bits == TYPE_PRECISION (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3228, __FUNCTION__))->type_common.precision))
   return type;
}

    /* Handle TImode as a special case because it is used by some backends
       (e.g. ARM) even though it is not available for normal use.  */
3234#if HOST_BITS_PER_WIDE_INT64 >= 64
    if (bits == TYPE_PRECISION (intTI_type_node)((tree_class_check ((global_trees[TI_INTTI_TYPE]), (tcc_type)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3235, __FUNCTION__))->type_common.precision))
return intTI_type_nodeglobal_trees[TI_INTTI_TYPE];
3237#endif

    if (bits <= TYPE_PRECISION (intQI_type_node)((tree_class_check ((global_trees[TI_INTQI_TYPE]), (tcc_type)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3239, __FUNCTION__))->type_common.precision))
return intQI_type_nodeglobal_trees[TI_INTQI_TYPE];
    if (bits <= TYPE_PRECISION (intHI_type_node)((tree_class_check ((global_trees[TI_INTHI_TYPE]), (tcc_type)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3241, __FUNCTION__))->type_common.precision))
return intHI_type_nodeglobal_trees[TI_INTHI_TYPE];
    if (bits <= TYPE_PRECISION (intSI_type_node)((tree_class_check ((global_trees[TI_INTSI_TYPE]), (tcc_type)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3243, __FUNCTION__))->type_common.precision))
return intSI_type_nodeglobal_trees[TI_INTSI_TYPE];
    if (bits <= TYPE_PRECISION (intDI_type_node)((tree_class_check ((global_trees[TI_INTDI_TYPE]), (tcc_type)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3245, __FUNCTION__))->type_common.precision))
return intDI_type_nodeglobal_trees[TI_INTDI_TYPE];
    if (bits <= TYPE_PRECISION (intTI_type_node)((tree_class_check ((global_trees[TI_INTTI_TYPE]), (tcc_type)
, "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3247, __FUNCTION__))->type_common.precision))
return intTI_type_nodeglobal_trees[TI_INTTI_TYPE];
  }
else
  {
    if (bits <= TYPE_PRECISION (unsigned_intQI_type_node)((tree_class_check ((global_trees[TI_UINTQI_TYPE]), (tcc_type
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3252, __FUNCTION__))->type_common.precision))
      return unsigned_intQI_type_nodeglobal_trees[TI_UINTQI_TYPE];
    if (bits <= TYPE_PRECISION (unsigned_intHI_type_node)((tree_class_check ((global_trees[TI_UINTHI_TYPE]), (tcc_type
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3254, __FUNCTION__))->type_common.precision))
return unsigned_intHI_type_nodeglobal_trees[TI_UINTHI_TYPE];
    if (bits <= TYPE_PRECISION (unsigned_intSI_type_node)((tree_class_check ((global_trees[TI_UINTSI_TYPE]), (tcc_type
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3256, __FUNCTION__))->type_common.precision))
return unsigned_intSI_type_nodeglobal_trees[TI_UINTSI_TYPE];
    if (bits <= TYPE_PRECISION (unsigned_intDI_type_node)((tree_class_check ((global_trees[TI_UINTDI_TYPE]), (tcc_type
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3258, __FUNCTION__))->type_common.precision))
return unsigned_intDI_type_nodeglobal_trees[TI_UINTDI_TYPE];
    if (bits <= TYPE_PRECISION (unsigned_intTI_type_node)((tree_class_check ((global_trees[TI_UINTTI_TYPE]), (tcc_type
), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3260, __FUNCTION__))->type_common.precision))
return unsigned_intTI_type_nodeglobal_trees[TI_UINTTI_TYPE];
  }

return NULL_TREE(tree) __null;
3265}

3267/* Return a data type that has machine mode MODE.  If the mode is an
 integer, then UNSIGNEDP selects between signed and unsigned types.  */

3270tree
3271gfc_type_for_mode (machine_mode mode, int unsignedp)
3272{
int i;
tree *base;
scalar_int_mode int_mode;

if (GET_MODE_CLASS (mode)((enum mode_class) mode_class[mode]) == MODE_FLOAT)
  base = gfc_real_types;
else if (GET_MODE_CLASS (mode)((enum mode_class) mode_class[mode]) == MODE_COMPLEX_FLOAT)
  base = gfc_complex_types;
else if (is_a <scalar_int_mode> (mode, &int_mode))
  {
    tree type = gfc_type_for_size (GET_MODE_PRECISION (int_mode), unsignedp);
    return type != NULL_TREE(tree) __null && mode == TYPE_MODE (type)((((enum tree_code) ((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3284, __FUNCTION__)))->base.code) == VECTOR_TYPE) ? vector_type_mode
 (type) : (type)->type_common.mode) ? type : NULL_TREE(tree) __null;
  }
else if (GET_MODE_CLASS (mode)((enum mode_class) mode_class[mode]) == MODE_VECTOR_BOOL
  && valid_vector_subparts_p (GET_MODE_NUNITS (mode)))
  {
    unsigned int elem_bits = vector_element_size (GET_MODE_BITSIZE (mode),(exact_div (GET_MODE_BITSIZE (mode), GET_MODE_NUNITS (mode)).
to_constant ())
				    GET_MODE_NUNITS (mode))(exact_div (GET_MODE_BITSIZE (mode), GET_MODE_NUNITS (mode)).
to_constant ());
    tree bool_type = build_nonstandard_boolean_type (elem_bits);
    return build_vector_type_for_mode (bool_type, mode);
  }
else if (VECTOR_MODE_P (mode)(((enum mode_class) mode_class[mode]) == MODE_VECTOR_BOOL || (
(enum mode_class) mode_class[mode]) == MODE_VECTOR_INT || ((enum
 mode_class) mode_class[mode]) == MODE_VECTOR_FLOAT || ((enum
 mode_class) mode_class[mode]) == MODE_VECTOR_FRACT || ((enum
 mode_class) mode_class[mode]) == MODE_VECTOR_UFRACT || ((enum
 mode_class) mode_class[mode]) == MODE_VECTOR_ACCUM || ((enum
 mode_class) mode_class[mode]) == MODE_VECTOR_UACCUM)
  && valid_vector_subparts_p (GET_MODE_NUNITS (mode)))
  {
    machine_mode inner_mode = GET_MODE_INNER (mode)(mode_to_inner (mode));
    tree inner_type = gfc_type_for_mode (inner_mode, unsignedp);
    if (inner_type != NULL_TREE(tree) __null)
      return build_vector_type_for_mode (inner_type, mode);
    return NULL_TREE(tree) __null;
  }
else
  return NULL_TREE(tree) __null;

for (i = 0; i <= MAX_REAL_KINDS5; ++i)
  {
    tree type = base[i];
    if (type && mode == TYPE_MODE (type)((((enum tree_code) ((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3309, __FUNCTION__)))->base.code) == VECTOR_TYPE) ? vector_type_mode
 (type) : (type)->type_common.mode))
return type;
  }

return NULL_TREE(tree) __null;
3314}

3316/* Return TRUE if TYPE is a type with a hidden descriptor, fill in INFO
 in that case.  */

3319bool
3320gfc_get_array_descr_info (const_tree type, struct array_descr_info *info)
3321{
int rank, dim;
bool indirect = false;
tree etype, ptype, t, base_decl;
tree data_off, span_off, dim_off, dtype_off, dim_size, elem_size;
tree lower_suboff, upper_suboff, stride_suboff;
tree dtype, field, rank_off;

if (! GFC_DESCRIPTOR_TYPE_P (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3329, __FUNCTION__))->type_common.lang_flag_1))
  {
    if (! POINTER_TYPE_P (type)(((enum tree_code) (type)->base.code) == POINTER_TYPE || (
(enum tree_code) (type)->base.code) == REFERENCE_TYPE))
return false;
    type = TREE_TYPE (type)((contains_struct_check ((type), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3333, __FUNCTION__))->typed.type);
    if (! GFC_DESCRIPTOR_TYPE_P (type)((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3334, __FUNCTION__))->type_common.lang_flag_1))
return false;
    indirect = true;
  }

rank = GFC_TYPE_ARRAY_RANK (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3339, __FUNCTION__))->type_with_lang_specific.lang_specific
)->rank);
if (rank >= (int) (sizeof (info->dimen) / sizeof (info->dimen[0])))
  return false;

etype = GFC_TYPE_ARRAY_DATAPTR_TYPE (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3343, __FUNCTION__))->type_with_lang_specific.lang_specific
)->dataptr_type);
gcc_assert (POINTER_TYPE_P (etype))((void)(!((((enum tree_code) (etype)->base.code) == POINTER_TYPE
 || ((enum tree_code) (etype)->base.code) == REFERENCE_TYPE
)) ? fancy_abort ("/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3344, __FUNCTION__), 0 : 0));
etype = TREE_TYPE (etype)((contains_struct_check ((etype), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3345, __FUNCTION__))->typed.type);

/* If the type is not a scalar coarray.  */
if (TREE_CODE (etype)((enum tree_code) (etype)->base.code) == ARRAY_TYPE)
  etype = TREE_TYPE (etype)((contains_struct_check ((etype), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3349, __FUNCTION__))->typed.type);

/* Can't handle variable sized elements yet.  */
if (int_size_in_bytes (etype) <= 0)
  return false;
/* Nor non-constant lower bounds in assumed shape arrays.  */
if (GFC_TYPE_ARRAY_AKIND (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3355, __FUNCTION__))->type_with_lang_specific.lang_specific
)->akind) == GFC_ARRAY_ASSUMED_SHAPE
    || GFC_TYPE_ARRAY_AKIND (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3356, __FUNCTION__))->type_with_lang_specific.lang_specific
)->akind) == GFC_ARRAY_ASSUMED_SHAPE_CONT)
  {
    for (dim = 0; dim < rank; dim++)
if (GFC_TYPE_ARRAY_LBOUND (type, dim)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3359, __FUNCTION__))->type_with_lang_specific.lang_specific
)->lbound[dim]) == NULL_TREE(tree) __null
   || TREE_CODE (GFC_TYPE_ARRAY_LBOUND (type, dim))((enum tree_code) ((((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3360, __FUNCTION__))->type_with_lang_specific.lang_specific
)->lbound[dim]))->base.code) != INTEGER_CST)
 return false;
  }

memset (info, '\0', sizeof (*info));
info->ndimensions = rank;
info->ordering = array_descr_ordering_column_major;
info->element_type = etype;
ptype = build_pointer_type (gfc_array_index_type);
base_decl = GFC_TYPE_ARRAY_BASE_DECL (type, indirect)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3369, __FUNCTION__))->type_with_lang_specific.lang_specific
)->base_decl[(indirect)]);
if (!base_decl)
  {
    base_decl = make_node (DEBUG_EXPR_DECL);
    DECL_ARTIFICIAL (base_decl)((contains_struct_check ((base_decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3373, __FUNCTION__))->decl_common.artificial_flag) = 1;
    TREE_TYPE (base_decl)((contains_struct_check ((base_decl), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3374, __FUNCTION__))->typed.type) = indirect ? build_pointer_type (ptype) : ptype;
    SET_DECL_MODE (base_decl, TYPE_MODE (TREE_TYPE (base_decl)))((contains_struct_check ((base_decl), (TS_DECL_COMMON), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3375, __FUNCTION__))->decl_common.mode = (((((enum tree_code
) ((tree_class_check ((((contains_struct_check ((base_decl), (
TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3375, __FUNCTION__))->typed.type)), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3375, __FUNCTION__)))->base.code) == VECTOR_TYPE) ? vector_type_mode
 (((contains_struct_check ((base_decl), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3375, __FUNCTION__))->typed.type)) : (((contains_struct_check
 ((base_decl), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3375, __FUNCTION__))->typed.type))->type_common.mode)
));
    GFC_TYPE_ARRAY_BASE_DECL (type, indirect)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3376, __FUNCTION__))->type_with_lang_specific.lang_specific
)->base_decl[(indirect)]) = base_decl;
  }
info->base_decl = base_decl;
if (indirect)
  base_decl = build1 (INDIRECT_REF, ptype, base_decl);

gfc_get_descriptor_offsets_for_info (type, &data_off, &dtype_off, &span_off,
		       &dim_off, &dim_size, &stride_suboff,
		       &lower_suboff, &upper_suboff);

t = fold_build_pointer_plus (base_decl, span_off)fold_build_pointer_plus_loc (((location_t) 0), base_decl, span_off
);
elem_size = build1 (INDIRECT_REF, gfc_array_index_type, t);

t = base_decl;
if (!integer_zerop (data_off))
  t = fold_build_pointer_plus (t, data_off)fold_build_pointer_plus_loc (((location_t) 0), t, data_off);
t = build1 (NOP_EXPR, build_pointer_type (ptr_type_nodeglobal_trees[TI_PTR_TYPE]), t);
info->data_location = build1 (INDIRECT_REF, ptr_type_nodeglobal_trees[TI_PTR_TYPE], t);
if (GFC_TYPE_ARRAY_AKIND (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3394, __FUNCTION__))->type_with_lang_specific.lang_specific
)->akind) == GFC_ARRAY_ALLOCATABLE)
  info->allocated = build2 (NE_EXPR, logical_type_node,
	      info->data_location, null_pointer_nodeglobal_trees[TI_NULL_POINTER]);
else if (GFC_TYPE_ARRAY_AKIND (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3397, __FUNCTION__))->type_with_lang_specific.lang_specific
)->akind) == GFC_ARRAY_POINTER
  || GFC_TYPE_ARRAY_AKIND (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3398, __FUNCTION__))->type_with_lang_specific.lang_specific
)->akind) == GFC_ARRAY_POINTER_CONT)
  info->associated = build2 (NE_EXPR, logical_type_node,
	       info->data_location, null_pointer_nodeglobal_trees[TI_NULL_POINTER]);
if ((GFC_TYPE_ARRAY_AKIND (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3401, __FUNCTION__))->type_with_lang_specific.lang_specific
)->akind) == GFC_ARRAY_ASSUMED_RANK
     || GFC_TYPE_ARRAY_AKIND (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3402, __FUNCTION__))->type_with_lang_specific.lang_specific
)->akind) == GFC_ARRAY_ASSUMED_RANK_CONT)
    && dwarf_versionglobal_options.x_dwarf_version >= 5)
  {
    rank = 1;
    info->ndimensions = 1;
    t = base_decl;
    if (!integer_zerop (dtype_off))
t = fold_build_pointer_plus (t, dtype_off)fold_build_pointer_plus_loc (((location_t) 0), t, dtype_off);
    dtype = TYPE_MAIN_VARIANT (get_dtype_type_node ())((tree_class_check ((get_dtype_type_node ()), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3410, __FUNCTION__))->type_common.main_variant);
    field = gfc_advance_chain (TYPE_FIELDS (dtype)((tree_check3 ((dtype), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3411, __FUNCTION__, (RECORD_TYPE), (UNION_TYPE), (QUAL_UNION_TYPE
)))->type_non_common.values), GFC_DTYPE_RANK2);
    rank_off = byte_position (field);
    if (!integer_zerop (dtype_off))
t = fold_build_pointer_plus (t, rank_off)fold_build_pointer_plus_loc (((location_t) 0), t, rank_off);

    t = build1 (NOP_EXPR, build_pointer_type (gfc_array_index_type), t);
    t = build1 (INDIRECT_REF, gfc_array_index_type, t);
    info->rank = t;
    t = build0 (PLACEHOLDER_EXPR, TREE_TYPE (dim_off)((contains_struct_check ((dim_off), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3419, __FUNCTION__))->typed.type));
    t = size_binop (MULT_EXPR, t, dim_size)size_binop_loc (((location_t) 0), MULT_EXPR, t, dim_size);
    dim_off = build2 (PLUS_EXPR, TREE_TYPE (dim_off)((contains_struct_check ((dim_off), (TS_TYPED), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3421, __FUNCTION__))->typed.type), t, dim_off);
  }

for (dim = 0; dim < rank; dim++)
  {
    t = fold_build_pointer_plus (base_decl,fold_build_pointer_plus_loc (((location_t) 0), base_decl, size_binop_loc
 (((location_t) 0), PLUS_EXPR, dim_off, lower_suboff))
		   size_binop (PLUS_EXPR,fold_build_pointer_plus_loc (((location_t) 0), base_decl, size_binop_loc
 (((location_t) 0), PLUS_EXPR, dim_off, lower_suboff))
			       dim_off, lower_suboff))fold_build_pointer_plus_loc (((location_t) 0), base_decl, size_binop_loc
 (((location_t) 0), PLUS_EXPR, dim_off, lower_suboff));
    t = build1 (INDIRECT_REF, gfc_array_index_type, t);
    info->dimen[dim].lower_bound = t;
    t = fold_build_pointer_plus (base_decl,fold_build_pointer_plus_loc (((location_t) 0), base_decl, size_binop_loc
 (((location_t) 0), PLUS_EXPR, dim_off, upper_suboff))
		   size_binop (PLUS_EXPR,fold_build_pointer_plus_loc (((location_t) 0), base_decl, size_binop_loc
 (((location_t) 0), PLUS_EXPR, dim_off, upper_suboff))
			       dim_off, upper_suboff))fold_build_pointer_plus_loc (((location_t) 0), base_decl, size_binop_loc
 (((location_t) 0), PLUS_EXPR, dim_off, upper_suboff));
    t = build1 (INDIRECT_REF, gfc_array_index_type, t);
    info->dimen[dim].upper_bound = t;
    if (GFC_TYPE_ARRAY_AKIND (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3436, __FUNCTION__))->type_with_lang_specific.lang_specific
)->akind) == GFC_ARRAY_ASSUMED_SHAPE
 || GFC_TYPE_ARRAY_AKIND (type)(((tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3437, __FUNCTION__))->type_with_lang_specific.lang_specific
)->akind) == GFC_ARRAY_ASSUMED_SHAPE_CONT)
{
 /* Assumed shape arrays have known lower bounds.  */
 info->dimen[dim].upper_bound
   = build2 (MINUS_EXPR, gfc_array_index_type,
      info->dimen[dim].upper_bound,
      info->dimen[dim].lower_bound);
 info->dimen[dim].lower_bound
   = fold_convert (gfc_array_index_type,fold_convert_loc (((location_t) 0), gfc_array_index_type, (((
tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3446, __FUNCTION__))->type_with_lang_specific.lang_specific
)->lbound[dim]))
	    GFC_TYPE_ARRAY_LBOUND (type, dim))fold_convert_loc (((location_t) 0), gfc_array_index_type, (((
tree_class_check ((type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3446, __FUNCTION__))->type_with_lang_specific.lang_specific
)->lbound[dim]));
 info->dimen[dim].upper_bound
   = build2 (PLUS_EXPR, gfc_array_index_type,
      info->dimen[dim].lower_bound,
      info->dimen[dim].upper_bound);
}
    t = fold_build_pointer_plus (base_decl,fold_build_pointer_plus_loc (((location_t) 0), base_decl, size_binop_loc
 (((location_t) 0), PLUS_EXPR, dim_off, stride_suboff))
		   size_binop (PLUS_EXPR,fold_build_pointer_plus_loc (((location_t) 0), base_decl, size_binop_loc
 (((location_t) 0), PLUS_EXPR, dim_off, stride_suboff))
			       dim_off, stride_suboff))fold_build_pointer_plus_loc (((location_t) 0), base_decl, size_binop_loc
 (((location_t) 0), PLUS_EXPR, dim_off, stride_suboff));
    t = build1 (INDIRECT_REF, gfc_array_index_type, t);
    t = build2 (MULT_EXPR, gfc_array_index_type, t, elem_size);
    info->dimen[dim].stride = t;
    if (dim + 1 < rank)
dim_off = size_binop (PLUS_EXPR, dim_off, dim_size)size_binop_loc (((location_t) 0), PLUS_EXPR, dim_off, dim_size
);
  }

return true;
3463}


3466/* Create a type to handle vector subscripts for coarray library calls. It
 has the form:
   struct caf_vector_t {
     size_t nvec;  // size of the vector
     union {
       struct {
         void *vector;
         int kind;
       } v;
       struct {
         ptrdiff_t lower_bound;
         ptrdiff_t upper_bound;
         ptrdiff_t stride;
       } triplet;
     } u;
   }
 where nvec == 0 for DIMEN_ELEMENT or DIMEN_RANGE and nvec being the vector
 size in case of DIMEN_VECTOR, where kind is the integer type of the vector.  */

3485tree
3486gfc_get_caf_vector_type (int dim)
3487{
static tree vector_types[GFC_MAX_DIMENSIONS15];
static tree vec_type = NULL_TREE(tree) __null;
tree triplet_struct_type, vect_struct_type, union_type, tmp, *chain;

if (vector_types[dim-1] != NULL_TREE(tree) __null)
  return vector_types[dim-1];

if (vec_type == NULL_TREE(tree) __null)
  {
    chain = 0;
    vect_struct_type = make_node (RECORD_TYPE);
    tmp = gfc_add_field_to_struct_1 (vect_struct_type,
		       get_identifier ("vector")(__builtin_constant_p ("vector") ? get_identifier_with_length
 (("vector"), strlen ("vector")) : get_identifier ("vector")),
		       pvoid_type_node, &chain);
    TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
    tmp = gfc_add_field_to_struct_1 (vect_struct_type,
		       get_identifier ("kind")(__builtin_constant_p ("kind") ? get_identifier_with_length (
("kind"), strlen ("kind")) : get_identifier ("kind")),
		       integer_type_nodeinteger_types[itk_int], &chain);
    TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
    gfc_finish_type (vect_struct_type);

    chain = 0;
    triplet_struct_type = make_node (RECORD_TYPE);
    tmp = gfc_add_field_to_struct_1 (triplet_struct_type,
		       get_identifier ("lower_bound")(__builtin_constant_p ("lower_bound") ? get_identifier_with_length
 (("lower_bound"), strlen ("lower_bound")) : get_identifier (
"lower_bound")),
		       gfc_array_index_type, &chain);
    TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
    tmp = gfc_add_field_to_struct_1 (triplet_struct_type,
		       get_identifier ("upper_bound")(__builtin_constant_p ("upper_bound") ? get_identifier_with_length
 (("upper_bound"), strlen ("upper_bound")) : get_identifier (
"upper_bound")),
		       gfc_array_index_type, &chain);
    TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
    tmp = gfc_add_field_to_struct_1 (triplet_struct_type, get_identifier ("stride")(__builtin_constant_p ("stride") ? get_identifier_with_length
 (("stride"), strlen ("stride")) : get_identifier ("stride")),
		       gfc_array_index_type, &chain);
    TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
    gfc_finish_type (triplet_struct_type);

    chain = 0;
    union_type = make_node (UNION_TYPE);
    tmp = gfc_add_field_to_struct_1 (union_type, get_identifier ("v")(__builtin_constant_p ("v") ? get_identifier_with_length (("v"
), strlen ("v")) : get_identifier ("v")),
                                     vect_struct_type, &chain);
    TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
    tmp = gfc_add_field_to_struct_1 (union_type, get_identifier ("triplet")(__builtin_constant_p ("triplet") ? get_identifier_with_length
 (("triplet"), strlen ("triplet")) : get_identifier ("triplet"
)),
		       triplet_struct_type, &chain);
    TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
    gfc_finish_type (union_type);

    chain = 0;
    vec_type = make_node (RECORD_TYPE);
    tmp = gfc_add_field_to_struct_1 (vec_type, get_identifier ("nvec")(__builtin_constant_p ("nvec") ? get_identifier_with_length (
("nvec"), strlen ("nvec")) : get_identifier ("nvec")),
		       size_type_nodeglobal_trees[TI_SIZE_TYPE], &chain);
    TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
    tmp = gfc_add_field_to_struct_1 (vec_type, get_identifier ("u")(__builtin_constant_p ("u") ? get_identifier_with_length (("u"
), strlen ("u")) : get_identifier ("u")),
		       union_type, &chain);
    TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
    gfc_finish_type (vec_type);
    TYPE_NAME (vec_type)((tree_class_check ((vec_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3543, __FUNCTION__))->type_common.name) = get_identifier ("caf_vector_t")(__builtin_constant_p ("caf_vector_t") ? get_identifier_with_length
 (("caf_vector_t"), strlen ("caf_vector_t")) : get_identifier
 ("caf_vector_t"));
  }

tmp = build_range_type (gfc_array_index_type, gfc_index_zero_nodegfc_rank_cst[0],
	  gfc_rank_cst[dim-1]);
vector_types[dim-1] = build_array_type (vec_type, tmp);
return vector_types[dim-1];
3550}


3553tree
3554gfc_get_caf_reference_type ()
3555{
static tree reference_type = NULL_TREE(tree) __null;
tree c_struct_type, s_struct_type, v_struct_type, union_type, dim_union_type,
    a_struct_type, u_union_type, tmp, *chain;

if (reference_type != NULL_TREE(tree) __null)
  return reference_type;

chain = 0;
c_struct_type = make_node (RECORD_TYPE);
tmp = gfc_add_field_to_struct_1 (c_struct_type,
		   get_identifier ("offset")(__builtin_constant_p ("offset") ? get_identifier_with_length
 (("offset"), strlen ("offset")) : get_identifier ("offset")),
		   gfc_array_index_type, &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
tmp = gfc_add_field_to_struct_1 (c_struct_type,
		   get_identifier ("caf_token_offset")(__builtin_constant_p ("caf_token_offset") ? get_identifier_with_length
 (("caf_token_offset"), strlen ("caf_token_offset")) : get_identifier
 ("caf_token_offset")),
		   gfc_array_index_type, &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
gfc_finish_type (c_struct_type);

chain = 0;
s_struct_type = make_node (RECORD_TYPE);
tmp = gfc_add_field_to_struct_1 (s_struct_type,
		   get_identifier ("start")(__builtin_constant_p ("start") ? get_identifier_with_length (
("start"), strlen ("start")) : get_identifier ("start")),
		   gfc_array_index_type, &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
tmp = gfc_add_field_to_struct_1 (s_struct_type,
		   get_identifier ("end")(__builtin_constant_p ("end") ? get_identifier_with_length ((
"end"), strlen ("end")) : get_identifier ("end")),
		   gfc_array_index_type, &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
tmp = gfc_add_field_to_struct_1 (s_struct_type,
		   get_identifier ("stride")(__builtin_constant_p ("stride") ? get_identifier_with_length
 (("stride"), strlen ("stride")) : get_identifier ("stride")),
		   gfc_array_index_type, &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
gfc_finish_type (s_struct_type);

chain = 0;
v_struct_type = make_node (RECORD_TYPE);
tmp = gfc_add_field_to_struct_1 (v_struct_type,
		   get_identifier ("vector")(__builtin_constant_p ("vector") ? get_identifier_with_length
 (("vector"), strlen ("vector")) : get_identifier ("vector")),
		   pvoid_type_node, &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
tmp = gfc_add_field_to_struct_1 (v_struct_type,
		   get_identifier ("nvec")(__builtin_constant_p ("nvec") ? get_identifier_with_length (
("nvec"), strlen ("nvec")) : get_identifier ("nvec")),
		   size_type_nodeglobal_trees[TI_SIZE_TYPE], &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
tmp = gfc_add_field_to_struct_1 (v_struct_type,
		   get_identifier ("kind")(__builtin_constant_p ("kind") ? get_identifier_with_length (
("kind"), strlen ("kind")) : get_identifier ("kind")),
		   integer_type_nodeinteger_types[itk_int], &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
gfc_finish_type (v_struct_type);

chain = 0;
union_type = make_node (UNION_TYPE);
tmp = gfc_add_field_to_struct_1 (union_type, get_identifier ("s")(__builtin_constant_p ("s") ? get_identifier_with_length (("s"
), strlen ("s")) : get_identifier ("s")),
		   s_struct_type, &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
tmp = gfc_add_field_to_struct_1 (union_type, get_identifier ("v")(__builtin_constant_p ("v") ? get_identifier_with_length (("v"
), strlen ("v")) : get_identifier ("v")),
		   v_struct_type, &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
gfc_finish_type (union_type);

tmp = build_range_type (gfc_array_index_type, gfc_index_zero_nodegfc_rank_cst[0],
	  gfc_rank_cst[GFC_MAX_DIMENSIONS15 - 1]);
dim_union_type = build_array_type (union_type, tmp);

chain = 0;
a_struct_type = make_node (RECORD_TYPE);
tmp = gfc_add_field_to_struct_1 (a_struct_type, get_identifier ("mode")(__builtin_constant_p ("mode") ? get_identifier_with_length (
("mode"), strlen ("mode")) : get_identifier ("mode")),
build_array_type (unsigned_char_type_nodeinteger_types[itk_unsigned_char],
		  build_range_type (gfc_array_index_type,
				    gfc_index_zero_nodegfc_rank_cst[0],
			 gfc_rank_cst[GFC_MAX_DIMENSIONS15 - 1])),
&chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
tmp = gfc_add_field_to_struct_1 (a_struct_type,
		   get_identifier ("static_array_type")(__builtin_constant_p ("static_array_type") ? get_identifier_with_length
 (("static_array_type"), strlen ("static_array_type")) : get_identifier
 ("static_array_type")),
		   integer_type_nodeinteger_types[itk_int], &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
tmp = gfc_add_field_to_struct_1 (a_struct_type, get_identifier ("dim")(__builtin_constant_p ("dim") ? get_identifier_with_length ((
"dim"), strlen ("dim")) : get_identifier ("dim")),
		   dim_union_type, &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
gfc_finish_type (a_struct_type);

chain = 0;
u_union_type = make_node (UNION_TYPE);
tmp = gfc_add_field_to_struct_1 (u_union_type, get_identifier ("c")(__builtin_constant_p ("c") ? get_identifier_with_length (("c"
), strlen ("c")) : get_identifier ("c")),
		   c_struct_type, &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
tmp = gfc_add_field_to_struct_1 (u_union_type, get_identifier ("a")(__builtin_constant_p ("a") ? get_identifier_with_length (("a"
), strlen ("a")) : get_identifier ("a")),
		   a_struct_type, &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
gfc_finish_type (u_union_type);

chain = 0;
reference_type = make_node (RECORD_TYPE);
tmp = gfc_add_field_to_struct_1 (reference_type, get_identifier ("next")(__builtin_constant_p ("next") ? get_identifier_with_length (
("next"), strlen ("next")) : get_identifier ("next")),
		   build_pointer_type (reference_type), &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
tmp = gfc_add_field_to_struct_1 (reference_type, get_identifier ("type")(__builtin_constant_p ("type") ? get_identifier_with_length (
("type"), strlen ("type")) : get_identifier ("type")),
		   integer_type_nodeinteger_types[itk_int], &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
tmp = gfc_add_field_to_struct_1 (reference_type, get_identifier ("item_size")(__builtin_constant_p ("item_size") ? get_identifier_with_length
 (("item_size"), strlen ("item_size")) : get_identifier ("item_size"
)),
		   size_type_nodeglobal_trees[TI_SIZE_TYPE], &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
tmp = gfc_add_field_to_struct_1 (reference_type, get_identifier ("u")(__builtin_constant_p ("u") ? get_identifier_with_length (("u"
), strlen ("u")) : get_identifier ("u")),
		   u_union_type, &chain);
TREE_NO_WARNING (tmp)((tmp)->base.nowarning_flag) = 1;
gfc_finish_type (reference_type);
TYPE_NAME (reference_type)((tree_class_check ((reference_type), (tcc_type), "/home/marxin/BIG/buildbot/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/fortran/trans-types.c"
, 3664, __FUNCTION__))->type_common.name) = get_identifier ("caf_reference_t")(__builtin_constant_p ("caf_reference_t") ? get_identifier_with_length
 (("caf_reference_t"), strlen ("caf_reference_t")) : get_identifier
 ("caf_reference_t"));

return reference_type;
3667}

3669#include "gt-fortran-trans-types.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 (exact44.1
'exact' is false
44.1
'exact' is false
)
45
←
Taking false branch→
229    return (pfx ? pfx->m_num : 0) + reserve;
230  else if (!pfx45.1
'pfx' is null
45.1
'pfx' is null
)
46
←
Taking true branch→
231    return MAX (4, reserve)((4) > (reserve) ? (4) : (reserve));
47
←
'?' condition is true→
48
←
Returning the value 4, which participates in a condition later→
232  return calculate_allocation_1 (pfx->m_alloc, pfx->m_num + reserve);
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 == NULL__null)
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 = NULL__null;
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 = NULL__null;
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 (v42.1
'v' is null
66.1
'v' is non-null
42.1
'v' is null
66.1
'v' is non-null
 ? &v->m_vecpfx : 0, reserve, exact);
43
←
'?' condition is false→
44
←
Calling 'vec_prefix::calculate_allocation'→
49
←
Returning from 'vec_prefix::calculate_allocation'→
67
←
'?' condition is true→
368  if (!alloc49.1
'alloc' is 4
49.1
'alloc' is 4
)
50
←
Taking false branch→
68
←
Assuming 'alloc' is 0→
69
←
Taking true branch→
369    {
370      ::ggc_free (v);
371      v = NULL__null;
70
←
Null pointer value stored to 'typelist'→
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 = v50.1
'v' is null
50.1
'v' is null
 ? v->length () : 0;
51
←
'?' condition is false→
390  v = static_cast <vec<T, A, vl_embed> *> (::ggc_realloc (v, size
52
←
Value assigned to 'typelist'→
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 v37.1
'v' is null
37.1
'v' is null
 ? v->space (nelems) : nelems == 0;
38
←
'?' condition is false→
39
←
Returning zero, 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 () : NULL__null;
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 = nelems35.1
'nelems' is 1
62.1
'nelems' is 1
35.1
'nelems' is 1
62.1
'nelems' is 1
 ? !vec_safe_space (v, nelems) : false;
36
←
'?' condition is true→
37
←
Calling 'vec_safe_space<tree_node *, va_gc>'→
40
←
Returning from 'vec_safe_space<tree_node *, va_gc>'→
63
←
'?' condition is true→
64
←
Assuming the condition is true→
697  if (extend40.1
'extend' is true
64.1
'extend' is true
40.1
'extend' is true
64.1
'extend' is true
)
41
←
Taking true branch→
65
←
Taking true branch→
698    A::reserve (v, nelems, exact PASS_MEM_STAT);
42
←
Calling 'va_gc::reserve'→
53
←
Returning from 'va_gc::reserve'→
66
←
Calling 'va_gc::reserve'→
71
←
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 = NULL__null;
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);
35
←
Calling 'vec_safe_reserve<tree_node *, va_gc>'→
54
←
Returning from 'vec_safe_reserve<tree_node *, va_gc>'→
62
←
Calling 'vec_safe_reserve<tree_node *, va_gc>'→
72
←
Returning from 'vec_safe_reserve<tree_node *, va_gc>'→
815  return v->quick_push (obj);
73
←
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) : NULL__null;
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 = NULL__null;
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 NULL__null;
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 NULL__null;
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 != NULL__null; }
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 : NULL__null; }
1443 
1444  const T *address (void) const
1445  { return m_vec ? m_vec->m_vecdata : NULL__null; }
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 = NULL__null; }
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 = NULL__null;
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 = NULL__null;
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 == NULL__null)
1636    return;
1637 
1638  v->release ();
1639  delete v;
1640  v = NULL__null;
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 = NULL__null;
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 = NULL__null;
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 