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

Bug Summary

File:	build/gcc/cfgloop.cc
Warning:	line 290, column 5 Called C++ object pointer is null

Annotated Source Code

Press '?' to see keyboard shortcuts

Show analyzer invocation

clang -cc1 -cc1 -triple x86_64-suse-linux -analyze -disable-free -clear-ast-before-backend -disable-llvm-verifier -discard-value-names -main-file-name cfgloop.cc -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -analyzer-config-compatibility-mode=true -mrelocation-model static -mframe-pointer=none -fmath-errno -ffp-contract=on -fno-rounding-math -mconstructor-aliases -funwind-tables=2 -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -fcoverage-compilation-dir=/buildworker/marxinbox-gcc-clang-static-analyzer/objdir/gcc -resource-dir /usr/lib64/clang/15.0.7 -D IN_GCC -D HAVE_CONFIG_H -I . -I . -I /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc -I /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/. -I /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../include -I /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../libcpp/include -I /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../libcody -I /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../libdecnumber -I /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../libdecnumber/bid -I ../libdecnumber -I /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/../libbacktrace -internal-isystem /usr/bin/../lib64/gcc/x86_64-suse-linux/13/../../../../include/c++/13 -internal-isystem /usr/bin/../lib64/gcc/x86_64-suse-linux/13/../../../../include/c++/13/x86_64-suse-linux -internal-isystem /usr/bin/../lib64/gcc/x86_64-suse-linux/13/../../../../include/c++/13/backward -internal-isystem /usr/lib64/clang/15.0.7/include -internal-isystem /usr/local/include -internal-isystem /usr/bin/../lib64/gcc/x86_64-suse-linux/13/../../../../x86_64-suse-linux/include -internal-externc-isystem /include -internal-externc-isystem /usr/include -O2 -Wno-narrowing -Wwrite-strings -Wno-long-long -Wno-variadic-macros -Wno-overlength-strings -fdeprecated-macro -fdebug-compilation-dir=/buildworker/marxinbox-gcc-clang-static-analyzer/objdir/gcc -ferror-limit 19 -fno-rtti -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -analyzer-output=plist-html -analyzer-config silence-checkers=core.NullDereference -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /buildworker/marxinbox-gcc-clang-static-analyzer/objdir/clang-static-analyzer/2023-03-27-141847-20772-1/report-X_E6CZ.plist -x c++ /buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc

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

→

1/* Natural loop discovery code for GNU compiler.
 Copyright (C) 2000-2023 Free Software Foundation, Inc.

4This file is part of GCC.

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

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

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

20#include "config.h"
21#include "system.h"
22#include "coretypes.h"
23#include "backend.h"
24#include "rtl.h"
25#include "tree.h"
26#include "gimple.h"
27#include "cfghooks.h"
28#include "gimple-ssa.h"
29#include "diagnostic-core.h"
30#include "cfganal.h"
31#include "cfgloop.h"
32#include "gimple-iterator.h"
33#include "dumpfile.h"
34#include "tree-ssa.h"
35#include "tree-pretty-print.h"

37static void flow_loops_cfg_dump (FILE *);
38
39/* Dump loop related CFG information.  */

41static void
42flow_loops_cfg_dump (FILE *file)
43{
basic_block bb;

if (!file)
  return;

FOR_EACH_BB_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_entry_block_ptr->next_bb
; bb != ((cfun + 0))->cfg->x_exit_block_ptr; bb = bb->
next_bb)
  {
    edge succ;
    edge_iterator ei;

    fprintf (file, ";; %d succs { ", bb->index);
    FOR_EACH_EDGE (succ, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(succ)); ei_next (&(ei)))
fprintf (file, "%d ", succ->dest->index);
    fprintf (file, "}\n");
  }
59}

61/* Return nonzero if the nodes of LOOP are a subset of OUTER.  */

63bool
64flow_loop_nested_p (const class loop *outer, const class loop *loop)
65{
unsigned odepth = loop_depth (outer);

return (loop_depth (loop) > odepth
 && (*loop->superloops)[odepth] == outer);
70}

72/* Returns the loop such that LOOP is nested DEPTH (indexed from zero)
 loops within LOOP.  */

75class loop *
76superloop_at_depth (class loop *loop, unsigned depth)
77{
unsigned ldepth = loop_depth (loop);

gcc_assert (depth <= ldepth)((void)(!(depth <= ldepth) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 80, __FUNCTION__), 0 : 0));

if (depth == ldepth)
  return loop;

return (*loop->superloops)[depth];
86}

88/* Returns the list of the latch edges of LOOP.  */

90static vec<edge> 
91get_loop_latch_edges (const class loop *loop)
92{
edge_iterator ei;
edge e;
vec<edge> ret = vNULL;

FOR_EACH_EDGE (e, ei, loop->header->preds)for ((ei) = ei_start_1 (&((loop->header->preds))); ei_cond
 ((ei), &(e)); ei_next (&(ei)))
  {
    if (dominated_by_p (CDI_DOMINATORS, e->src, loop->header))
ret.safe_push (e);
  }

return ret;
104}

106/* Dump the loop information specified by LOOP to the stream FILE
 using auxiliary dump callback function LOOP_DUMP_AUX if non null.  */

109void
110flow_loop_dump (const class loop *loop, FILE *file,
void (*loop_dump_aux) (const class loop *, FILE *, int),
int verbose)
113{
basic_block *bbs;
unsigned i;
vec<edge> latches;
edge e;

if (! loop || ! loop->header)
  return;

fprintf (file, ";;\n;; Loop %d\n", loop->num);

fprintf (file, ";;  header %d, ", loop->header->index);
if (loop->latch)
  fprintf (file, "latch %d\n", loop->latch->index);
else
  {
    fprintf (file, "multiple latches:");
    latches = get_loop_latch_edges (loop);
    FOR_EACH_VEC_ELT (latches, i, e)for (i = 0; (latches).iterate ((i), &(e)); ++(i))
fprintf (file, " %d", e->src->index);
    latches.release ();
    fprintf (file, "\n");
  }

fprintf (file, ";;  depth %d, outer %ld\n",
  loop_depth (loop), (long) (loop_outer (loop)
		      ? loop_outer (loop)->num : -1));

if (loop->latch)
  {
    bool read_profile_p;
    gcov_type nit = expected_loop_iterations_unbounded (loop, &read_profile_p);
    if (read_profile_p && !loop->any_estimate)
fprintf (file, ";;  profile-based iteration count: %" PRIu64"l" "u" "\n",
 (uint64_t) nit);
  }

fprintf (file, ";;  nodes:");
bbs = get_loop_body (loop);
for (i = 0; i < loop->num_nodes; i++)
  fprintf (file, " %d", bbs[i]->index);
free (bbs);
fprintf (file, "\n");

if (loop_dump_aux)
  loop_dump_aux (loop, file, verbose);
159}

161/* Dump the loop information about loops to the stream FILE,
 using auxiliary dump callback function LOOP_DUMP_AUX if non null.  */

164void
165flow_loops_dump (FILE *file, void (*loop_dump_aux) (const class loop *, FILE *, int), int verbose)
166{
if (!current_loops((cfun + 0)->x_current_loops) || ! file)
  return;

fprintf (file, ";; %d loops found\n", number_of_loops (cfun(cfun + 0)));

for (auto loop : loops_list (cfun(cfun + 0), LI_INCLUDE_ROOT))
  {
    flow_loop_dump (loop, file, loop_dump_aux, verbose);
  }

if (verbose)
  flow_loops_cfg_dump (file);
179}

181/* Free data allocated for LOOP.  */

183void
184flow_loop_free (class loop *loop)
185{
struct loop_exit *exit, *next;

vec_free (loop->superloops);

/* Break the list of the loop exit records.  They will be freed when the
   corresponding edge is rescanned or removed, and this avoids
   accessing the (already released) head of the list stored in the
   loop structure.  */
for (exit = loop->exits->next; exit != loop->exits; exit = next)
  {
    next = exit->next;
    exit->next = exit;
    exit->prev = exit;
  }

ggc_free (loop->exits);
ggc_free (loop);
203}

205/* Free all the memory allocated for LOOPS.  */

207void
208flow_loops_free (struct loops *loops)
209{
if (loops->larray)
  {
    unsigned i;
    loop_p loop;

    /* Free the loop descriptors.  */
    FOR_EACH_VEC_SAFE_ELT (loops->larray, i, loop)for (i = 0; vec_safe_iterate ((loops->larray), (i), &(
loop)); ++(i))
{
 if (!loop)
   continue;

 flow_loop_free (loop);
}

    vec_free (loops->larray);
  }
226}

228/* Find the nodes contained within the LOOP with header HEADER.
 Return the number of nodes within the loop.  */

231int
232flow_loop_nodes_find (basic_block header, class loop *loop)
233{
vec<basic_block> stack = vNULL;
int num_nodes = 1;
edge latch;
edge_iterator latch_ei;

header->loop_father = loop;

FOR_EACH_EDGE (latch, latch_ei, loop->header->preds)for ((latch_ei) = ei_start_1 (&((loop->header->preds
))); ei_cond ((latch_ei), &(latch)); ei_next (&(latch_ei
)))
  {
    if (latch->src->loop_father == loop
 || !dominated_by_p (CDI_DOMINATORS, latch->src, loop->header))
continue;

    num_nodes++;
    stack.safe_push (latch->src);
    latch->src->loop_father = loop;

    while (!stack.is_empty ())
{
 basic_block node;
 edge e;
 edge_iterator ei;

 node = stack.pop ();

 FOR_EACH_EDGE (e, ei, node->preds)for ((ei) = ei_start_1 (&((node->preds))); ei_cond ((ei
), &(e)); ei_next (&(ei)))
   {
     basic_block ancestor = e->src;

     if (ancestor->loop_father != loop)
{
  ancestor->loop_father = loop;
  num_nodes++;
  stack.safe_push (ancestor);
}
   }
}
  }
stack.release ();

return num_nodes;
275}

277/* Records the vector of superloops of the loop LOOP, whose immediate
 superloop is FATHER.  */

280static void
281establish_preds (class loop *loop, class loop *father)
282{
loop_p ploop;
unsigned depth = loop_depth (father) + 1;
unsigned i;

loop->superloops = 0;
vec_alloc (loop->superloops, depth);
14
←
Calling 'vec_alloc<loop *, va_gc>'→
22
←
Returning from 'vec_alloc<loop *, va_gc>'→
FOR_EACH_VEC_SAFE_ELT (father->superloops, i, ploop)for (i = 0; vec_safe_iterate ((father->superloops), (i), &
(ploop)); ++(i))
23
←
Loop condition is true.  Entering loop body→
  loop->superloops->quick_push (ploop);
24
←
Called C++ object pointer is null
loop->superloops->quick_push (father);

for (ploop = loop->inner; ploop; ploop = ploop->next)
  establish_preds (ploop, loop);
295}

297/* Add LOOP to the loop hierarchy tree where FATHER is father of the
 added loop.  If LOOP has some children, take care of that their
 pred field will be initialized correctly.  If AFTER is non-null
 then it's expected it's a pointer into FATHERs inner sibling
 list and LOOP is added behind AFTER, otherwise it's added in front
 of FATHERs siblings.  */

304void
305flow_loop_tree_node_add (class loop *father, class loop *loop,
	 class loop *after)
307{
if (after11.1
'after' is null
1
'after' is null
)
12
←
Taking false branch→
  {
    loop->next = after->next;
    after->next = loop;
  }
else
  {
    loop->next = father->inner;
    father->inner = loop;
  }

establish_preds (loop, father);
13
←
Calling 'establish_preds'→
320}

322/* Remove LOOP from the loop hierarchy tree.  */

324void
325flow_loop_tree_node_remove (class loop *loop)
326{
class loop *prev, *father;

father = loop_outer (loop);

/* Remove loop from the list of sons.  */
if (father->inner == loop)
  father->inner = loop->next;
else
  {
    for (prev = father->inner; prev->next != loop; prev = prev->next)
continue;
    prev->next = loop->next;
  }

loop->superloops = NULLnullptr;
342}

344/* Allocates and returns new loop structure.  */

346class loop *
347alloc_loop (void)
348{
class loop *loop = ggc_cleared_alloc<class loop> ();

loop->exits = ggc_cleared_alloc<loop_exit> ();
loop->exits->next = loop->exits->prev = loop->exits;
loop->can_be_parallel = false;
loop->constraints = 0;
loop->nb_iterations_upper_bound = 0;
loop->nb_iterations_likely_upper_bound = 0;
loop->nb_iterations_estimate = 0;
return loop;
359}

361/* Initializes loops structure LOOPS, reserving place for NUM_LOOPS loops
 (including the root of the loop tree).  */

364void
365init_loops_structure (struct function *fn,
      struct loops *loops, unsigned num_loops)
367{
class loop *root;

memset (loops, 0, sizeof *loops);
vec_alloc (loops->larray, num_loops);

/* Dummy loop containing whole function.  */
root = alloc_loop ();
root->num_nodes = n_basic_blocks_for_fn (fn)((fn)->cfg->x_n_basic_blocks);
root->latch = EXIT_BLOCK_PTR_FOR_FN (fn)((fn)->cfg->x_exit_block_ptr);
root->header = ENTRY_BLOCK_PTR_FOR_FN (fn)((fn)->cfg->x_entry_block_ptr);
ENTRY_BLOCK_PTR_FOR_FN (fn)((fn)->cfg->x_entry_block_ptr)->loop_father = root;
EXIT_BLOCK_PTR_FOR_FN (fn)((fn)->cfg->x_exit_block_ptr)->loop_father = root;

loops->larray->quick_push (root);
loops->tree_root = root;
383}

385/* Returns whether HEADER is a loop header.  */

387bool
388bb_loop_header_p (basic_block header)
389{
edge_iterator ei;
edge e;

/* If we have an abnormal predecessor, do not consider the
   loop (not worth the problems).  */
if (bb_has_abnormal_pred (header))
  return false;

/* Look for back edges where a predecessor is dominated
   by this block.  A natural loop has a single entry
   node (header) that dominates all the nodes in the
   loop.  It also has single back edge to the header
   from a latch node.  */
FOR_EACH_EDGE (e, ei, header->preds)for ((ei) = ei_start_1 (&((header->preds))); ei_cond (
(ei), &(e)); ei_next (&(ei)))
  {
    basic_block latch = e->src;
    if (latch != ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr)
 && dominated_by_p (CDI_DOMINATORS, latch, header))
return true;
  }

return false;
412}

414/* Find all the natural loops in the function and save in LOOPS structure and
 recalculate loop_father information in basic block structures.
 If LOOPS is non-NULL then the loop structures for already recorded loops
 will be re-used and their number will not change.  We assume that no
 stale loops exist in LOOPS.
 When LOOPS is NULL it is allocated and re-built from scratch.
 Return the built LOOPS structure.  */

422struct loops *
423flow_loops_find (struct loops *loops)
424{
bool from_scratch = (loops == NULLnullptr);
1
Assuming the condition is false→
int *rc_order;
int b;
unsigned i;

/* Ensure that the dominators are computed.  */
calculate_dominance_info (CDI_DOMINATORS);

if (!loops1.1
'loops' is non-null
1
'loops' is non-null
)
2
←
Taking false branch→
  {
    loops = ggc_cleared_alloc<struct loops> ();
    init_loops_structure (cfun(cfun + 0), loops, 1);
  }

/* Ensure that loop exits were released.  */
gcc_assert (loops->exits == NULL)((void)(!(loops->exits == nullptr) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 440, __FUNCTION__), 0 : 0));
3
←
Assuming the condition is true→
4
←
'?' condition is false→

/* Taking care of this degenerate case makes the rest of
   this code simpler.  */
if (n_basic_blocks_for_fn (cfun)(((cfun + 0))->cfg->x_n_basic_blocks) == NUM_FIXED_BLOCKS(2))
5
←
Assuming field 'x_n_basic_blocks' is not equal to NUM_FIXED_BLOCKS→
6
←
Taking false branch→
  return loops;

/* The root loop node contains all basic-blocks.  */
loops->tree_root->num_nodes = n_basic_blocks_for_fn (cfun)(((cfun + 0))->cfg->x_n_basic_blocks);

/* Compute depth first search order of the CFG so that outer
   natural loops will be found before inner natural loops.  */
rc_order = XNEWVEC (int, n_basic_blocks_for_fn (cfun))((int *) xmalloc (sizeof (int) * ((((cfun + 0))->cfg->x_n_basic_blocks
))));
pre_and_rev_post_order_compute (NULLnullptr, rc_order, false);

/* Gather all loop headers in reverse completion order and allocate
   loop structures for loops that are not already present.  */
auto_vec<loop_p> larray (loops->larray->length ());
for (b = 0; b < n_basic_blocks_for_fn (cfun)(((cfun + 0))->cfg->x_n_basic_blocks) - NUM_FIXED_BLOCKS(2); b++)
7
←
Assuming the condition is false→
8
←
Loop condition is false. Execution continues on line 500→
  {
    basic_block header = BASIC_BLOCK_FOR_FN (cfun, rc_order[b])((*(((cfun + 0))->cfg->x_basic_block_info))[(rc_order[b
])]);
    if (bb_loop_header_p (header))
{
 class loop *loop;

 /* The current active loop tree has valid loop-fathers for
    header blocks.  */
 if (!from_scratch
     && header->loop_father->header == header)
   {
     loop = header->loop_father;
     /* If we found an existing loop remove it from the
 loop tree.  It is going to be inserted again
 below.  */
     flow_loop_tree_node_remove (loop);
   }
 else
   {
     /* Otherwise allocate a new loop structure for the loop.  */
     loop = alloc_loop ();
     /* ???  We could re-use unused loop slots here.  */
     loop->num = loops->larray->length ();
     vec_safe_push (loops->larray, loop);
     loop->header = header;

     if (!from_scratch
  && dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "flow_loops_find: discovered new "
	 "loop %d with header %d\n",
	 loop->num, header->index);
   }
 /* Reset latch, we recompute it below.  */
 loop->latch = NULLnullptr;
 larray.safe_push (loop);
}

    /* Make blocks part of the loop root node at start.  */
    header->loop_father = loops->tree_root;
  }

free (rc_order);

/* Now iterate over the loops found, insert them into the loop tree
   and assign basic-block ownership.  */
for (i = 0; i < larray.length (); ++i)
9
←
Assuming the condition is true→
10
←
Loop condition is true.  Entering loop body→
  {
    class loop *loop = larray[i];
    basic_block header = loop->header;
    edge_iterator ei;
    edge e;

    flow_loop_tree_node_add (header->loop_father, loop);
11
←
Calling 'flow_loop_tree_node_add'→
    loop->num_nodes = flow_loop_nodes_find (loop->header, loop);

    /* Look for the latch for this header block, if it has just a
single one.  */
    FOR_EACH_EDGE (e, ei, header->preds)for ((ei) = ei_start_1 (&((header->preds))); ei_cond (
(ei), &(e)); ei_next (&(ei)))
{
 basic_block latch = e->src;

 if (flow_bb_inside_loop_p (loop, latch))
   {
     if (loop->latch != NULLnullptr)
{
  /* More than one latch edge.  */
  loop->latch = NULLnullptr;
  break;
}
     loop->latch = latch;
   }
}
  }

return loops;
534}

536/* qsort helper for sort_sibling_loops.  */

538static int *sort_sibling_loops_cmp_rpo;
539static int
540sort_sibling_loops_cmp (const void *la_, const void *lb_)
541{
const class loop *la = *(const class loop * const *)la_;
const class loop *lb = *(const class loop * const *)lb_;
return (sort_sibling_loops_cmp_rpo[la->header->index]
 - sort_sibling_loops_cmp_rpo[lb->header->index]);
546}

548/* Sort sibling loops in RPO order.  */

550void
551sort_sibling_loops (function *fn)
552{
/* Match flow_loops_find in the order we sort sibling loops.  */
sort_sibling_loops_cmp_rpo = XNEWVEC (int, last_basic_block_for_fn (cfun))((int *) xmalloc (sizeof (int) * ((((cfun + 0))->cfg->x_last_basic_block
))));
int *rc_order = XNEWVEC (int, n_basic_blocks_for_fn (cfun))((int *) xmalloc (sizeof (int) * ((((cfun + 0))->cfg->x_n_basic_blocks
))));
pre_and_rev_post_order_compute_fn (fn, NULLnullptr, rc_order, false);
for (int i = 0; i < n_basic_blocks_for_fn (cfun)(((cfun + 0))->cfg->x_n_basic_blocks) - NUM_FIXED_BLOCKS(2); ++i)
  sort_sibling_loops_cmp_rpo[rc_order[i]] = i;
free (rc_order);

auto_vec<loop_p, 3> siblings;
for (auto loop : loops_list (fn, LI_INCLUDE_ROOT))
  if (loop->inner && loop->inner->next)
    {
loop_p sibling = loop->inner;
do
 {
   siblings.safe_push (sibling);
   sibling = sibling->next;
 }
while (sibling);
siblings.qsort (sort_sibling_loops_cmp)qsort (sort_sibling_loops_cmp);
loop_p *siblingp = &loop->inner;
for (unsigned i = 0; i < siblings.length (); ++i)
 {
   *siblingp = siblings[i];
   siblingp = &(*siblingp)->next;
 }
*siblingp = NULLnullptr;
siblings.truncate (0);
    }

free (sort_sibling_loops_cmp_rpo);
sort_sibling_loops_cmp_rpo = NULLnullptr;
585}

587/* Ratio of frequencies of edges so that one of more latch edges is
 considered to belong to inner loop with same header.  */
589#define HEAVY_EDGE_RATIO8 8

591/* Minimum number of samples for that we apply
 find_subloop_latch_edge_by_profile heuristics.  */
593#define HEAVY_EDGE_MIN_SAMPLES10 10

595/* If the profile info is available, finds an edge in LATCHES that much more
 frequent than the remaining edges.  Returns such an edge, or NULL if we do
 not find one.

 We do not use guessed profile here, only the measured one.  The guessed
 profile is usually too flat and unreliable for this (and it is mostly based
 on the loop structure of the program, so it does not make much sense to
 derive the loop structure from it).  */

604static edge
605find_subloop_latch_edge_by_profile (vec<edge> latches)
606{
unsigned i;
edge e, me = NULLnullptr;
profile_count mcount = profile_count::zero (), tcount = profile_count::zero ();

FOR_EACH_VEC_ELT (latches, i, e)for (i = 0; (latches).iterate ((i), &(e)); ++(i))
  {
    if (e->count ()> mcount)
{
 me = e;
 mcount = e->count();
}
    tcount += e->count();
  }

if (!tcount.initialized_p () || !(tcount.ipa () > HEAVY_EDGE_MIN_SAMPLES10)
    || (tcount - mcount) * HEAVY_EDGE_RATIO8 > tcount)
  return NULLnullptr;

if (dump_file)
  fprintf (dump_file,
    "Found latch edge %d -> %d using profile information.\n",
    me->src->index, me->dest->index);
return me;
630}

632/* Among LATCHES, guesses a latch edge of LOOP corresponding to subloop, based
 on the structure of induction variables.  Returns this edge, or NULL if we
 do not find any.

 We are quite conservative, and look just for an obvious simple innermost
 loop (which is the case where we would lose the most performance by not
 disambiguating the loop).  More precisely, we look for the following
 situation: The source of the chosen latch edge dominates sources of all
 the other latch edges.  Additionally, the header does not contain a phi node
 such that the argument from the chosen edge is equal to the argument from
 another edge.  */

644static edge
645find_subloop_latch_edge_by_ivs (class loop *loop ATTRIBUTE_UNUSED__attribute__ ((__unused__)), vec<edge> latches)
646{
edge e, latch = latches[0];
unsigned i;
gphi *phi;
gphi_iterator psi;
tree lop;
basic_block bb;

/* Find the candidate for the latch edge.  */
for (i = 1; latches.iterate (i, &e); i++)
  if (dominated_by_p (CDI_DOMINATORS, latch->src, e->src))
    latch = e;

/* Verify that it dominates all the latch edges.  */
FOR_EACH_VEC_ELT (latches, i, e)for (i = 0; (latches).iterate ((i), &(e)); ++(i))
  if (!dominated_by_p (CDI_DOMINATORS, e->src, latch->src))
    return NULLnullptr;

/* Check for a phi node that would deny that this is a latch edge of
   a subloop.  */
for (psi = gsi_start_phis (loop->header); !gsi_end_p (psi); gsi_next (&psi))
  {
    phi = psi.phi ();
    lop = PHI_ARG_DEF_FROM_EDGE (phi, latch)gimple_phi_arg_def (((phi)), ((latch)->dest_idx));

    /* Ignore the values that are not changed inside the subloop.  */
    if (TREE_CODE (lop)((enum tree_code) (lop)->base.code) != SSA_NAME
 || SSA_NAME_DEF_STMT (lop)(tree_check ((lop), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 673, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt == phi)
continue;
    bb = gimple_bb (SSA_NAME_DEF_STMT (lop)(tree_check ((lop), "/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 675, __FUNCTION__, (SSA_NAME)))->ssa_name.def_stmt);
    if (!bb || !flow_bb_inside_loop_p (loop, bb))
continue;

    FOR_EACH_VEC_ELT (latches, i, e)for (i = 0; (latches).iterate ((i), &(e)); ++(i))
if (e != latch
   && PHI_ARG_DEF_FROM_EDGE (phi, e)gimple_phi_arg_def (((phi)), ((e)->dest_idx)) == lop)
 return NULLnullptr;
  }

if (dump_file)
  fprintf (dump_file,
    "Found latch edge %d -> %d using iv structure.\n",
    latch->src->index, latch->dest->index);
return latch;
690}

692/* If we can determine that one of the several latch edges of LOOP behaves
 as a latch edge of a separate subloop, returns this edge.  Otherwise
 returns NULL.  */

696static edge
697find_subloop_latch_edge (class loop *loop)
698{
vec<edge> latches = get_loop_latch_edges (loop);
edge latch = NULLnullptr;

if (latches.length () > 1)
  {
    latch = find_subloop_latch_edge_by_profile (latches);

    if (!latch
 /* We consider ivs to guess the latch edge only in SSA.  Perhaps we
    should use cfghook for this, but it is hard to imagine it would
    be useful elsewhere.  */
 && current_ir_type () == IR_GIMPLE)
latch = find_subloop_latch_edge_by_ivs (loop, latches);
  }

latches.release ();
return latch;
716}

718/* Callback for make_forwarder_block.  Returns true if the edge E is marked
 in the set MFB_REIS_SET.  */

721static hash_set<edge> *mfb_reis_set;
722static bool
723mfb_redirect_edges_in_set (edge e)
724{
return mfb_reis_set->contains (e);
726}

728/* Creates a subloop of LOOP with latch edge LATCH.  */

730static void
731form_subloop (class loop *loop, edge latch)
732{
edge_iterator ei;
edge e, new_entry;
class loop *new_loop;

mfb_reis_set = new hash_set<edge>;
FOR_EACH_EDGE (e, ei, loop->header->preds)for ((ei) = ei_start_1 (&((loop->header->preds))); ei_cond
 ((ei), &(e)); ei_next (&(ei)))
  {
    if (e != latch)
mfb_reis_set->add (e);
  }
new_entry = make_forwarder_block (loop->header, mfb_redirect_edges_in_set,
		    NULLnullptr);
delete mfb_reis_set;

loop->header = new_entry->src;

/* Find the blocks and subloops that belong to the new loop, and add it to
   the appropriate place in the loop tree.  */
new_loop = alloc_loop ();
new_loop->header = new_entry->dest;
new_loop->latch = latch->src;
add_loop (new_loop, loop);
755}

757/* Make all the latch edges of LOOP to go to a single forwarder block --
 a new latch of LOOP.  */

760static void
761merge_latch_edges (class loop *loop)
762{
vec<edge> latches = get_loop_latch_edges (loop);
edge latch, e;
unsigned i;

gcc_assert (latches.length () > 0)((void)(!(latches.length () > 0) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 767, __FUNCTION__), 0 : 0));

if (latches.length () == 1)
  loop->latch = latches[0]->src;
else
  {
    if (dump_file)
fprintf (dump_file, "Merged latch edges of loop %d\n", loop->num);

    mfb_reis_set = new hash_set<edge>;
    FOR_EACH_VEC_ELT (latches, i, e)for (i = 0; (latches).iterate ((i), &(e)); ++(i))
mfb_reis_set->add (e);
    latch = make_forwarder_block (loop->header, mfb_redirect_edges_in_set,
		    NULLnullptr);
    delete mfb_reis_set;

    loop->header = latch->dest;
    loop->latch = latch->src;
  }

latches.release ();
788}

790/* LOOP may have several latch edges.  Transform it into (possibly several)
 loops with single latch edge.  */

793static void
794disambiguate_multiple_latches (class loop *loop)
795{
edge e;

/* We eliminate the multiple latches by splitting the header to the forwarder
   block F and the rest R, and redirecting the edges.  There are two cases:

   1) If there is a latch edge E that corresponds to a subloop (we guess
      that based on profile -- if it is taken much more often than the
remaining edges; and on trees, using the information about induction
variables of the loops), we redirect E to R, all the remaining edges to
F, then rescan the loops and try again for the outer loop.
   2) If there is no such edge, we redirect all latch edges to F, and the
      entry edges to R, thus making F the single latch of the loop.  */

if (dump_file)
  fprintf (dump_file, "Disambiguating loop %d with multiple latches\n",
    loop->num);

/* During latch merging, we may need to redirect the entry edges to a new
   block.  This would cause problems if the entry edge was the one from the
   entry block.  To avoid having to handle this case specially, split
   such entry edge.  */
e = find_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr), loop->header);
if (e)
  split_edge (e);

while (1)
  {
    e = find_subloop_latch_edge (loop);
    if (!e)
break;

    form_subloop (loop, e);
  }

merge_latch_edges (loop);
831}

833/* Split loops with multiple latch edges.  */

835void
836disambiguate_loops_with_multiple_latches (void)
837{
for (auto loop : loops_list (cfun(cfun + 0), 0))
  {
    if (!loop->latch)
disambiguate_multiple_latches (loop);
  }
843}

845/* Return nonzero if basic block BB belongs to LOOP.  */
846bool
847flow_bb_inside_loop_p (const class loop *loop, const_basic_block bb)
848{
class loop *source_loop;

if (bb == ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr)
    || bb == EXIT_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_exit_block_ptr))
  return 0;

source_loop = bb->loop_father;
return loop == source_loop || flow_loop_nested_p (loop, source_loop);
857}

859/* Enumeration predicate for get_loop_body_with_size.  */
860static bool
861glb_enum_p (const_basic_block bb, const void *glb_loop)
862{
const class loop *const loop = (const class loop *) glb_loop;
return (bb != loop->header
 && dominated_by_p (CDI_DOMINATORS, bb, loop->header));
866}

868/* Gets basic blocks of a LOOP.  Header is the 0-th block, rest is in dfs
 order against direction of edges from latch.  Specially, if
 header != latch, latch is the 1-st block.  LOOP cannot be the fake
 loop tree root, and its size must be at most MAX_SIZE.  The blocks
 in the LOOP body are stored to BODY, and the size of the LOOP is
 returned.  */

875unsigned
876get_loop_body_with_size (const class loop *loop, basic_block *body,
	 unsigned max_size)
878{
return dfs_enumerate_from (loop->header, 1, glb_enum_p,
	     body, max_size, loop);
881}

883/* Gets basic blocks of a LOOP.  Header is the 0-th block, rest is in dfs
 order against direction of edges from latch.  Specially, if
 header != latch, latch is the 1-st block.  */

887basic_block *
888get_loop_body (const class loop *loop)
889{
basic_block *body, bb;
unsigned tv = 0;

gcc_assert (loop->num_nodes)((void)(!(loop->num_nodes) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 893, __FUNCTION__), 0 : 0));

body = XNEWVEC (basic_block, loop->num_nodes)((basic_block *) xmalloc (sizeof (basic_block) * (loop->num_nodes
)));

if (loop->latch == EXIT_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_exit_block_ptr))
  {
    /* There may be blocks unreachable from EXIT_BLOCK, hence we need to
special-case the fake loop that contains the whole function.  */
    gcc_assert (loop->num_nodes == (unsigned) n_basic_blocks_for_fn (cfun))((void)(!(loop->num_nodes == (unsigned) (((cfun + 0))->
cfg->x_n_basic_blocks)) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 901, __FUNCTION__), 0 : 0));
    body[tv++] = loop->header;
    body[tv++] = EXIT_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_exit_block_ptr);
    FOR_EACH_BB_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_entry_block_ptr->next_bb
; bb != ((cfun + 0))->cfg->x_exit_block_ptr; bb = bb->
next_bb)
body[tv++] = bb;
  }
else
  tv = get_loop_body_with_size (loop, body, loop->num_nodes);

gcc_assert (tv == loop->num_nodes)((void)(!(tv == loop->num_nodes) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 910, __FUNCTION__), 0 : 0));
return body;
912}

914/* Fills dominance descendants inside LOOP of the basic block BB into
 array TOVISIT from index *TV.  */

917static void
918fill_sons_in_loop (const class loop *loop, basic_block bb,
   basic_block *tovisit, int *tv)
920{
basic_block son, postpone = NULLnullptr;

tovisit[(*tv)++] = bb;
for (son = first_dom_son (CDI_DOMINATORS, bb);
     son;
     son = next_dom_son (CDI_DOMINATORS, son))
  {
    if (!flow_bb_inside_loop_p (loop, son))
continue;

    if (dominated_by_p (CDI_DOMINATORS, loop->latch, son))
{
 postpone = son;
 continue;
}
    fill_sons_in_loop (loop, son, tovisit, tv);
  }

if (postpone)
  fill_sons_in_loop (loop, postpone, tovisit, tv);
941}

943/* Gets body of a LOOP (that must be different from the outermost loop)
 sorted by dominance relation.  Additionally, if a basic block s dominates
 the latch, then only blocks dominated by s are be after it.  */

947basic_block *
948get_loop_body_in_dom_order (const class loop *loop)
949{
basic_block *tovisit;
int tv;

gcc_assert (loop->num_nodes)((void)(!(loop->num_nodes) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 953, __FUNCTION__), 0 : 0));

tovisit = XNEWVEC (basic_block, loop->num_nodes)((basic_block *) xmalloc (sizeof (basic_block) * (loop->num_nodes
)));

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

tv = 0;
fill_sons_in_loop (loop, loop->header, tovisit, &tv);

gcc_assert (tv == (int) loop->num_nodes)((void)(!(tv == (int) loop->num_nodes) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 962, __FUNCTION__), 0 : 0));

return tovisit;
965}

967/* Gets body of a LOOP sorted via provided BB_COMPARATOR.  */

969basic_block *
970get_loop_body_in_custom_order (const class loop *loop,
	       int (*bb_comparator) (const void *, const void *))
972{
basic_block *bbs = get_loop_body (loop);

qsort (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator)gcc_qsort (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator
);

return bbs;
978}

980/* Same as above, but use gcc_sort_r instead of qsort.  */

982basic_block *
983get_loop_body_in_custom_order (const class loop *loop, void *data,
	       int (*bb_comparator) (const void *, const void *, void *))
985{
basic_block *bbs = get_loop_body (loop);

gcc_sort_r (bbs, loop->num_nodes, sizeof (basic_block), bb_comparator, data);

return bbs;
991}

993/* Get body of a LOOP in breadth first sort order.  */

995basic_block *
996get_loop_body_in_bfs_order (const class loop *loop)
997{
basic_block *blocks;
basic_block bb;
unsigned int i = 1;
unsigned int vc = 0;

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

blocks = XNEWVEC (basic_block, loop->num_nodes)((basic_block *) xmalloc (sizeof (basic_block) * (loop->num_nodes
)));
auto_bitmap visited;
blocks[0] = loop->header;
bitmap_set_bit (visited, loop->header->index);
while (i < loop->num_nodes)
  {
    edge e;
    edge_iterator ei;
    gcc_assert (i > vc)((void)(!(i > vc) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 1014, __FUNCTION__), 0 : 0));
    bb = blocks[vc++];

    FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
{
 if (flow_bb_inside_loop_p (loop, e->dest))
   {
     /* This bb is now visited.  */
     if (bitmap_set_bit (visited, e->dest->index))
blocks[i++] = e->dest;
   }
}
  }

return blocks;
1029}

1031/* Hash function for struct loop_exit.  */

1033hashval_t
1034loop_exit_hasher::hash (loop_exit *exit)
1035{
return htab_hash_pointer (exit->e);
1037}

1039/* Equality function for struct loop_exit.  Compares with edge.  */

1041bool
1042loop_exit_hasher::equal (loop_exit *exit, edge e)
1043{
return exit->e == e;
1045}

1047/* Frees the list of loop exit descriptions EX.  */

1049void
1050loop_exit_hasher::remove (loop_exit *exit)
1051{
loop_exit *next;
for (; exit; exit = next)
  {
    next = exit->next_e;

    exit->next->prev = exit->prev;
    exit->prev->next = exit->next;

    ggc_free (exit);
  }
1062}

1064/* Returns the list of records for E as an exit of a loop.  */

1066static struct loop_exit *
1067get_exit_descriptions (edge e)
1068{
return current_loops((cfun + 0)->x_current_loops)->exits->find_with_hash (e, htab_hash_pointer (e));
1070}

1072/* Updates the lists of loop exits in that E appears.
 If REMOVED is true, E is being removed, and we
 just remove it from the lists of exits.
 If NEW_EDGE is true and E is not a loop exit, we
 do not try to remove it from loop exit lists.  */

1078void
1079rescan_loop_exit (edge e, bool new_edge, bool removed)
1080{
struct loop_exit *exits = NULLnullptr, *exit;
class loop *aloop, *cloop;

if (!loops_state_satisfies_p (LOOPS_HAVE_RECORDED_EXITS))
  return;

if (!removed
    && e->src->loop_father != NULLnullptr
    && e->dest->loop_father != NULLnullptr
    && !flow_bb_inside_loop_p (e->src->loop_father, e->dest))
  {
    cloop = find_common_loop (e->src->loop_father, e->dest->loop_father);
    for (aloop = e->src->loop_father;
  aloop != cloop;
  aloop = loop_outer (aloop))
{
 exit = ggc_alloc<loop_exit> ();
 exit->e = e;

 exit->next = aloop->exits->next;
 exit->prev = aloop->exits;
 exit->next->prev = exit;
 exit->prev->next = exit;

 exit->next_e = exits;
 exits = exit;
}
  }

if (!exits && new_edge)
  return;

loop_exit **slot
  = current_loops((cfun + 0)->x_current_loops)->exits->find_slot_with_hash (e, htab_hash_pointer (e),
				 exits ? INSERT : NO_INSERT);
if (!slot)
  return;

if (exits)
  {
    if (*slot)
loop_exit_hasher::remove (*slot);
    *slot = exits;
  }
else
  current_loops((cfun + 0)->x_current_loops)->exits->clear_slot (slot);
1127}

1129/* For each loop, record list of exit edges, and start maintaining these
 lists.  */

1132void
1133record_loop_exits (void)
1134{
basic_block bb;
edge_iterator ei;
edge e;

if (!current_loops((cfun + 0)->x_current_loops))
  return;

if (loops_state_satisfies_p (LOOPS_HAVE_RECORDED_EXITS))
  return;
loops_state_set (LOOPS_HAVE_RECORDED_EXITS);

gcc_assert (current_loops->exits == NULL)((void)(!(((cfun + 0)->x_current_loops)->exits == nullptr
) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 1146, __FUNCTION__), 0 : 0));
current_loops((cfun + 0)->x_current_loops)->exits
  = hash_table<loop_exit_hasher>::create_ggc (2 * number_of_loops (cfun(cfun + 0)));

FOR_EACH_BB_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_entry_block_ptr->next_bb
; bb != ((cfun + 0))->cfg->x_exit_block_ptr; bb = bb->
next_bb)
  {
    FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
{
 rescan_loop_exit (e, true, false);
}
  }
1157}

1159/* Dumps information about the exit in *SLOT to FILE.
 Callback for htab_traverse.  */

1162int
1163dump_recorded_exit (loop_exit **slot, FILE *file)
1164{
struct loop_exit *exit = *slot;
unsigned n = 0;
edge e = exit->e;

for (; exit != NULLnullptr; exit = exit->next_e)
  n++;

fprintf (file, "Edge %d->%d exits %u loops\n",
  e->src->index, e->dest->index, n);

return 1;
1176}

1178/* Dumps the recorded exits of loops to FILE.  */

1180extern void dump_recorded_exits (FILE *);
1181void
1182dump_recorded_exits (FILE *file)
1183{
if (!current_loops((cfun + 0)->x_current_loops)->exits)
  return;
current_loops((cfun + 0)->x_current_loops)->exits->traverse<FILE *, dump_recorded_exit> (file);
1187}

1189/* Releases lists of loop exits.  */

1191void
1192release_recorded_exits (function *fn)
1193{
gcc_assert (loops_state_satisfies_p (fn, LOOPS_HAVE_RECORDED_EXITS))((void)(!(loops_state_satisfies_p (fn, LOOPS_HAVE_RECORDED_EXITS
)) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 1194, __FUNCTION__), 0 : 0));
loops_for_fn (fn)->exits->empty ();
loops_for_fn (fn)->exits = NULLnullptr;
loops_state_clear (fn, LOOPS_HAVE_RECORDED_EXITS);
1198}

1200/* Returns the list of the exit edges of a LOOP.  */

1202auto_vec<edge>
1203get_loop_exit_edges (const class loop *loop, basic_block *body)
1204{
auto_vec<edge> edges;
edge e;
unsigned i;
edge_iterator ei;
struct loop_exit *exit;

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

/* If we maintain the lists of exits, use them.  Otherwise we must
   scan the body of the loop.  */
if (loops_state_satisfies_p (LOOPS_HAVE_RECORDED_EXITS))
  {
    for (exit = loop->exits->next; exit->e; exit = exit->next)
edges.safe_push (exit->e);
  }
else
  {
    bool body_from_caller = true;
    if (!body)
{
 body = get_loop_body (loop);
 body_from_caller = false;
}
    for (i = 0; i < loop->num_nodes; i++)
FOR_EACH_EDGE (e, ei, body[i]->succs)for ((ei) = ei_start_1 (&((body[i]->succs))); ei_cond (
(ei), &(e)); ei_next (&(ei)))
 {
   if (!flow_bb_inside_loop_p (loop, e->dest))
     edges.safe_push (e);
 }
    if (!body_from_caller)
free (body);
  }

return edges;
1239}

1241/* Counts the number of conditional branches inside LOOP.  */

1243unsigned
1244num_loop_branches (const class loop *loop)
1245{
unsigned i, n;
basic_block * body;

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

body = get_loop_body (loop);
n = 0;
for (i = 0; i < loop->num_nodes; i++)
  if (EDGE_COUNT (body[i]->succs)vec_safe_length (body[i]->succs) >= 2)
    n++;
free (body);

return n;
1259}

1261/* Adds basic block BB to LOOP.  */
1262void
1263add_bb_to_loop (basic_block bb, class loop *loop)
1264{
unsigned i;
loop_p ploop;
edge_iterator ei;
edge e;

gcc_assert (bb->loop_father == NULL)((void)(!(bb->loop_father == nullptr) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 1270, __FUNCTION__), 0 : 0));
bb->loop_father = loop;
loop->num_nodes++;
FOR_EACH_VEC_SAFE_ELT (loop->superloops, i, ploop)for (i = 0; vec_safe_iterate ((loop->superloops), (i), &
(ploop)); ++(i))
  ploop->num_nodes++;

FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
  {
    rescan_loop_exit (e, true, false);
  }
FOR_EACH_EDGE (e, ei, bb->preds)for ((ei) = ei_start_1 (&((bb->preds))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
  {
    rescan_loop_exit (e, true, false);
  }
1284}

1286/* Remove basic block BB from loops.  */
1287void
1288remove_bb_from_loops (basic_block bb)
1289{
unsigned i;
class loop *loop = bb->loop_father;
loop_p ploop;
edge_iterator ei;
edge e;

gcc_assert (loop != NULL)((void)(!(loop != nullptr) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 1296, __FUNCTION__), 0 : 0));
loop->num_nodes--;
FOR_EACH_VEC_SAFE_ELT (loop->superloops, i, ploop)for (i = 0; vec_safe_iterate ((loop->superloops), (i), &
(ploop)); ++(i))
  ploop->num_nodes--;
bb->loop_father = NULLnullptr;

FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
  {
    rescan_loop_exit (e, false, true);
  }
FOR_EACH_EDGE (e, ei, bb->preds)for ((ei) = ei_start_1 (&((bb->preds))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
  {
    rescan_loop_exit (e, false, true);
  }
1310}

1312/* Finds nearest common ancestor in loop tree for given loops.  */
1313class loop *
1314find_common_loop (class loop *loop_s, class loop *loop_d)
1315{
unsigned sdepth, ddepth;

if (!loop_s) return loop_d;
if (!loop_d) return loop_s;

sdepth = loop_depth (loop_s);
ddepth = loop_depth (loop_d);

if (sdepth < ddepth)
  loop_d = (*loop_d->superloops)[sdepth];
else if (sdepth > ddepth)
  loop_s = (*loop_s->superloops)[ddepth];

while (loop_s != loop_d)
  {
    loop_s = loop_outer (loop_s);
    loop_d = loop_outer (loop_d);
  }
return loop_s;
1335}

1337/* Removes LOOP from structures and frees its data.  */

1339void
1340delete_loop (class loop *loop)
1341{
/* Remove the loop from structure.  */
flow_loop_tree_node_remove (loop);

/* Remove loop from loops array.  */
(*current_loops((cfun + 0)->x_current_loops)->larray)[loop->num] = NULLnullptr;

/* Free loop data.  */
flow_loop_free (loop);
1350}

1352/* Cancels the LOOP; it must be innermost one.  */

1354static void
1355cancel_loop (class loop *loop)
1356{
basic_block *bbs;
unsigned i;
class loop *outer = loop_outer (loop);

gcc_assert (!loop->inner)((void)(!(!loop->inner) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 1361, __FUNCTION__), 0 : 0));

/* Move blocks up one level (they should be removed as soon as possible).  */
bbs = get_loop_body (loop);
for (i = 0; i < loop->num_nodes; i++)
  bbs[i]->loop_father = outer;

free (bbs);
delete_loop (loop);
1370}

1372/* Cancels LOOP and all its subloops.  */
1373void
1374cancel_loop_tree (class loop *loop)
1375{
while (loop->inner)
  cancel_loop_tree (loop->inner);
cancel_loop (loop);
1379}

1381/* Disable warnings about missing quoting in GCC diagnostics for
 the verification errors.  Their format strings don't follow GCC
 diagnostic conventions and the calls are ultimately followed by
 a deliberate ICE triggered by a failed assertion.  */
1385#if __GNUC__4 >= 10
1386#  pragma GCC diagnostic push
1387#  pragma GCC diagnostic ignored "-Wformat-diag"
1388#endif

1390/* Checks that information about loops is correct
   -- sizes of loops are all right
   -- results of get_loop_body really belong to the loop
   -- loop header have just single entry edge and single latch edge
   -- loop latches have only single successor that is header of their loop
   -- irreducible loops are correctly marked
   -- the cached loop depth and loop father of each bb is correct
*/
1398DEBUG_FUNCTION__attribute__ ((__used__)) void
1399verify_loop_structure (void)
1400{
unsigned *sizes, i, j;
basic_block bb, *bbs;
int err = 0;
edge e;
unsigned num = number_of_loops (cfun(cfun + 0));
struct loop_exit *exit, *mexit;
bool dom_available = dom_info_available_p (CDI_DOMINATORS);

if (loops_state_satisfies_p (LOOPS_NEED_FIXUP))
  {
    error ("loop verification on loop tree that needs fixup");
    err = 1;
  }

/* We need up-to-date dominators, compute or verify them.  */
if (!dom_available)
  calculate_dominance_info (CDI_DOMINATORS);
else
  verify_dominators (CDI_DOMINATORS);

/* Check the loop tree root.  */
if (current_loops((cfun + 0)->x_current_loops)->tree_root->header != ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr)
    || current_loops((cfun + 0)->x_current_loops)->tree_root->latch != EXIT_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_exit_block_ptr)
    || (current_loops((cfun + 0)->x_current_loops)->tree_root->num_nodes
 != (unsigned) n_basic_blocks_for_fn (cfun)(((cfun + 0))->cfg->x_n_basic_blocks)))
  {
    error ("corrupt loop tree root");
    err = 1;
  }

/* Check the headers.  */
FOR_EACH_BB_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_entry_block_ptr->next_bb
; bb != ((cfun + 0))->cfg->x_exit_block_ptr; bb = bb->
next_bb)
  if (bb_loop_header_p (bb))
    {
if (bb->loop_father->header == NULLnullptr)
 {
   error ("loop with header %d marked for removal", bb->index);
   err = 1;
 }
else if (bb->loop_father->header != bb)
 {
   error ("loop with header %d not in loop tree", bb->index);
   err = 1;
 }
    }
  else if (bb->loop_father->header == bb)
    {
error ("non-loop with header %d not marked for removal", bb->index);
err = 1;
    }

/* Check the recorded loop father and sizes of loops.  */
auto_sbitmap visited (last_basic_block_for_fn (cfun)(((cfun + 0))->cfg->x_last_basic_block));
bitmap_clear (visited);
bbs = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun))((basic_block *) xmalloc (sizeof (basic_block) * ((((cfun + 0
))->cfg->x_n_basic_blocks))));
for (auto loop : loops_list (cfun(cfun + 0), LI_FROM_INNERMOST))
  {
    unsigned n;

    if (loop->header == NULLnullptr)
{
 error ("removed loop %d in loop tree", loop->num);
 err = 1;
 continue;
}

    n = get_loop_body_with_size (loop, bbs, n_basic_blocks_for_fn (cfun)(((cfun + 0))->cfg->x_n_basic_blocks));
    if (loop->num_nodes != n)
{
 error ("size of loop %d should be %d, not %d",
 loop->num, n, loop->num_nodes);
 err = 1;
}

    for (j = 0; j < n; j++)
{
 bb = bbs[j];

 if (!flow_bb_inside_loop_p (loop, bb))
   {
     error ("bb %d does not belong to loop %d",
     bb->index, loop->num);
     err = 1;
   }

 /* Ignore this block if it is in an inner loop.  */
 if (bitmap_bit_p (visited, bb->index))
   continue;
 bitmap_set_bit (visited, bb->index);

 if (bb->loop_father != loop)
   {
     error ("bb %d has father loop %d, should be loop %d",
     bb->index, bb->loop_father->num, loop->num);
     err = 1;
   }
}
  }
free (bbs);

/* Check headers and latches.  */
for (auto loop : loops_list (cfun(cfun + 0), 0))
  {
    i = loop->num;
    if (loop->header == NULLnullptr)
continue;
    if (!bb_loop_header_p (loop->header))
{
 error ("loop %d%'s header is not a loop header", i);
 err = 1;
}
    if (loops_state_satisfies_p (LOOPS_HAVE_PREHEADERS)
 && EDGE_COUNT (loop->header->preds)vec_safe_length (loop->header->preds) != 2)
{
 error ("loop %d%'s header does not have exactly 2 entries", i);
 err = 1;
}
    if (loop->latch)
{
 if (!find_edge (loop->latch, loop->header))
   {
     error ("loop %d%'s latch does not have an edge to its header", i);
     err = 1;
   }
 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, loop->header))
   {
     error ("loop %d%'s latch is not dominated by its header", i);
     err = 1;
   }
}
    if (loops_state_satisfies_p (LOOPS_HAVE_SIMPLE_LATCHES))
{
 if (!single_succ_p (loop->latch))
   {
     error ("loop %d%'s latch does not have exactly 1 successor", i);
     err = 1;
   }
 if (single_succ (loop->latch) != loop->header)
   {
     error ("loop %d%'s latch does not have header as successor", i);
     err = 1;
   }
 if (loop->latch->loop_father != loop)
   {
     error ("loop %d%'s latch does not belong directly to it", i);
     err = 1;
   }
}
    if (loop->header->loop_father != loop)
{
 error ("loop %d%'s header does not belong directly to it", i);
 err = 1;
}
    if (loops_state_satisfies_p (LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS))
{
 edge_iterator ei;
 FOR_EACH_EDGE (e, ei, loop->header->preds)for ((ei) = ei_start_1 (&((loop->header->preds))); ei_cond
 ((ei), &(e)); ei_next (&(ei)))
   if (dominated_by_p (CDI_DOMINATORS, e->src, loop->header)
&& e->flags & EDGE_IRREDUCIBLE_LOOP)
     {
error ("loop %d%'s latch is marked as part of irreducible"
       " region", i);
err = 1;
     }
}

    /* Check cached number of iterations for released SSA names.  */
    tree ref;
    if (loop->nb_iterations
 && (ref = walk_tree (&loop->nb_iterations,walk_tree_1 (&loop->nb_iterations, find_released_ssa_name
, nullptr, nullptr, nullptr)
	       find_released_ssa_name, NULL, NULL)walk_tree_1 (&loop->nb_iterations, find_released_ssa_name
, nullptr, nullptr, nullptr)))
{
 error ("loop %d%'s number of iterations %qE references the"
 " released SSA name %qE", i, loop->nb_iterations, ref);
 err = 1;
}
  }

/* Check irreducible loops.  */
if (loops_state_satisfies_p (LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS))
  {
    auto_edge_flag saved_edge_irr (cfun(cfun + 0));
    auto_bb_flag saved_bb_irr (cfun(cfun + 0));
    /* Save old info.  */
    FOR_EACH_BB_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_entry_block_ptr->next_bb
; bb != ((cfun + 0))->cfg->x_exit_block_ptr; bb = bb->
next_bb)
{
 edge_iterator ei;
 if (bb->flags & BB_IRREDUCIBLE_LOOP)
   bb->flags |= saved_bb_irr;
 FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
   if (e->flags & EDGE_IRREDUCIBLE_LOOP)
     e->flags |= saved_edge_irr;
}

    /* Recount it.  */
    mark_irreducible_loops ();

    /* Compare.  */
    FOR_EACH_BB_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_entry_block_ptr->next_bb
; bb != ((cfun + 0))->cfg->x_exit_block_ptr; bb = bb->
next_bb)
{
 edge_iterator ei;

 if ((bb->flags & BB_IRREDUCIBLE_LOOP)
     && !(bb->flags & saved_bb_irr))
   {
     error ("basic block %d should be marked irreducible", bb->index);
     err = 1;
   }
 else if (!(bb->flags & BB_IRREDUCIBLE_LOOP)
   && (bb->flags & saved_bb_irr))
   {
     error ("basic block %d should not be marked irreducible", bb->index);
     err = 1;
   }
 bb->flags &= ~saved_bb_irr;
 FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
   {
     if ((e->flags & EDGE_IRREDUCIBLE_LOOP)
  && !(e->flags & saved_edge_irr))
{
  error ("edge from %d to %d should be marked irreducible",
	 e->src->index, e->dest->index);
  err = 1;
}
     else if (!(e->flags & EDGE_IRREDUCIBLE_LOOP)
       && (e->flags & saved_edge_irr))
{
  error ("edge from %d to %d should not be marked irreducible",
	 e->src->index, e->dest->index);
  err = 1;
}
     e->flags &= ~saved_edge_irr;
   }
}
  }

/* Check the recorded loop exits.  */
for (auto loop : loops_list (cfun(cfun + 0), 0))
  {
    if (!loop->exits || loop->exits->e != NULLnullptr)
{
 error ("corrupted head of the exits list of loop %d",
 loop->num);
 err = 1;
}
    else
{
 /* Check that the list forms a cycle, and all elements except
    for the head are nonnull.  */
 for (mexit = loop->exits, exit = mexit->next, i = 0;
      exit->e && exit != mexit;
      exit = exit->next)
   {
     if (i++ & 1)
mexit = mexit->next;
   }

 if (exit != loop->exits)
   {
     error ("corrupted exits list of loop %d", loop->num);
     err = 1;
   }
}

    if (!loops_state_satisfies_p (LOOPS_HAVE_RECORDED_EXITS))
{
 if (loop->exits->next != loop->exits)
   {
     error ("nonempty exits list of loop %d, but exits are not recorded",
     loop->num);
     err = 1;
   }
}
  }

if (loops_state_satisfies_p (LOOPS_HAVE_RECORDED_EXITS))
  {
    unsigned n_exits = 0, eloops;

    sizes = XCNEWVEC (unsigned, num)((unsigned *) xcalloc ((num), sizeof (unsigned)));
    memset (sizes, 0, sizeof (unsigned) * num);
    FOR_EACH_BB_FN (bb, cfun)for (bb = ((cfun + 0))->cfg->x_entry_block_ptr->next_bb
; bb != ((cfun + 0))->cfg->x_exit_block_ptr; bb = bb->
next_bb)
{
 edge_iterator ei;
 if (bb->loop_father == current_loops((cfun + 0)->x_current_loops)->tree_root)
   continue;
 FOR_EACH_EDGE (e, ei, bb->succs)for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei)
, &(e)); ei_next (&(ei)))
   {
     if (flow_bb_inside_loop_p (bb->loop_father, e->dest))
continue;

     n_exits++;
     exit = get_exit_descriptions (e);
     if (!exit)
{
  error ("exit %d->%d not recorded",
	 e->src->index, e->dest->index);
  err = 1;
}
     eloops = 0;
     for (; exit; exit = exit->next_e)
eloops++;

     for (class loop *loop = bb->loop_father;
   loop != e->dest->loop_father
   /* When a loop exit is also an entry edge which
      can happen when avoiding CFG manipulations
      then the last loop exited is the outer loop
      of the loop entered.  */
   && loop != loop_outer (e->dest->loop_father);
   loop = loop_outer (loop))
{
  eloops--;
  sizes[loop->num]++;
}

     if (eloops != 0)
{
  error ("wrong list of exited loops for edge %d->%d",
	 e->src->index, e->dest->index);
  err = 1;
}
   }
}

    if (n_exits != current_loops((cfun + 0)->x_current_loops)->exits->elements ())
{
 error ("too many loop exits recorded");
 err = 1;
}

    for (auto loop : loops_list (cfun(cfun + 0), 0))
{
 eloops = 0;
 for (exit = loop->exits->next; exit->e; exit = exit->next)
   eloops++;
 if (eloops != sizes[loop->num])
   {
     error ("%d exits recorded for loop %d (having %d exits)",
     eloops, loop->num, sizes[loop->num]);
     err = 1;
   }
}

    free (sizes);
  }

gcc_assert (!err)((void)(!(!err) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 1748, __FUNCTION__), 0 : 0));

if (!dom_available)
  free_dominance_info (CDI_DOMINATORS);
1752}

1754#if __GNUC__4 >= 10
1755#  pragma GCC diagnostic pop
1756#endif

1758/* Returns latch edge of LOOP.  */
1759edge
1760loop_latch_edge (const class loop *loop)
1761{
return find_edge (loop->latch, loop->header);
1763}

1765/* Returns preheader edge of LOOP.  */
1766edge
1767loop_preheader_edge (const class loop *loop)
1768{
edge e;
edge_iterator ei;

gcc_assert (loops_state_satisfies_p (LOOPS_HAVE_PREHEADERS)((void)(!(loops_state_satisfies_p (LOOPS_HAVE_PREHEADERS) &&
 ! loops_state_satisfies_p (LOOPS_MAY_HAVE_MULTIPLE_LATCHES))
 ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 1773, __FUNCTION__), 0 : 0))
     && ! loops_state_satisfies_p (LOOPS_MAY_HAVE_MULTIPLE_LATCHES))((void)(!(loops_state_satisfies_p (LOOPS_HAVE_PREHEADERS) &&
 ! loops_state_satisfies_p (LOOPS_MAY_HAVE_MULTIPLE_LATCHES))
 ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 1773, __FUNCTION__), 0 : 0));

FOR_EACH_EDGE (e, ei, loop->header->preds)for ((ei) = ei_start_1 (&((loop->header->preds))); ei_cond
 ((ei), &(e)); ei_next (&(ei)))
  if (e->src != loop->latch)
    break;

if (! e)
  {
    gcc_assert (! loop_outer (loop))((void)(!(! loop_outer (loop)) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 1781, __FUNCTION__), 0 : 0));
    return single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun)(((cfun + 0))->cfg->x_entry_block_ptr));
  }

return e;
1786}

1788/* Returns true if E is an exit of LOOP.  */

1790bool
1791loop_exit_edge_p (const class loop *loop, const_edge e)
1792{
return (flow_bb_inside_loop_p (loop, e->src)
 && !flow_bb_inside_loop_p (loop, e->dest));
1795}

1797/* Returns the single exit edge of LOOP, or NULL if LOOP has either no exit
 or more than one exit.  If loops do not have the exits recorded, NULL
 is returned always.  */

1801edge
1802single_exit (const class loop *loop)
1803{
struct loop_exit *exit = loop->exits->next;

if (!loops_state_satisfies_p (LOOPS_HAVE_RECORDED_EXITS))
  return NULLnullptr;

if (exit->e && exit->next == loop->exits)
  return exit->e;
else
  return NULLnullptr;
1813}

1815/* Returns true when BB has an incoming edge exiting LOOP.  */

1817bool
1818loop_exits_to_bb_p (class loop *loop, basic_block bb)
1819{
edge e;
edge_iterator ei;

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

return false;
1828}

1830/* Returns true when BB has an outgoing edge exiting LOOP.  */

1832bool
1833loop_exits_from_bb_p (class loop *loop, basic_block bb)
1834{
edge e;
edge_iterator ei;

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

return false;
1843}

1845/* Return location corresponding to the loop control condition if possible.  */

1847dump_user_location_t
1848get_loop_location (class loop *loop)
1849{
rtx_insn *insn = NULLnullptr;
class niter_desc *desc = NULLnullptr;
edge exit;

/* For a for or while loop, we would like to return the location
   of the for or while statement, if possible.  To do this, look
   for the branch guarding the loop back-edge.  */

/* If this is a simple loop with an in_edge, then the loop control
   branch is typically at the end of its source.  */
desc = get_simple_loop_desc (loop);
if (desc->in_edge)
  {
    FOR_BB_INSNS_REVERSE (desc->in_edge->src, insn)for ((insn) = (desc->in_edge->src)->il.x.rtl->end_
; (insn) && (insn) != PREV_INSN ((desc->in_edge->
src)->il.x.head_); (insn) = PREV_INSN (insn))
      {
        if (INSN_P (insn)(((((enum rtx_code) (insn)->code) == INSN) || (((enum rtx_code
) (insn)->code) == JUMP_INSN) || (((enum rtx_code) (insn)->
code) == CALL_INSN)) || (((enum rtx_code) (insn)->code) ==
 DEBUG_INSN)) && INSN_HAS_LOCATION (insn))
          return insn;
      }
  }
/* If loop has a single exit, then the loop control branch
   must be at the end of its source.  */
if ((exit = single_exit (loop)))
  {
    FOR_BB_INSNS_REVERSE (exit->src, insn)for ((insn) = (exit->src)->il.x.rtl->end_; (insn) &&
 (insn) != PREV_INSN ((exit->src)->il.x.head_); (insn) =
 PREV_INSN (insn))
      {
        if (INSN_P (insn)(((((enum rtx_code) (insn)->code) == INSN) || (((enum rtx_code
) (insn)->code) == JUMP_INSN) || (((enum rtx_code) (insn)->
code) == CALL_INSN)) || (((enum rtx_code) (insn)->code) ==
 DEBUG_INSN)) && INSN_HAS_LOCATION (insn))
          return insn;
      }
  }
/* Next check the latch, to see if it is non-empty.  */
FOR_BB_INSNS_REVERSE (loop->latch, insn)for ((insn) = (loop->latch)->il.x.rtl->end_; (insn) &&
 (insn) != PREV_INSN ((loop->latch)->il.x.head_); (insn
) = PREV_INSN (insn))
  {
    if (INSN_P (insn)(((((enum rtx_code) (insn)->code) == INSN) || (((enum rtx_code
) (insn)->code) == JUMP_INSN) || (((enum rtx_code) (insn)->
code) == CALL_INSN)) || (((enum rtx_code) (insn)->code) ==
 DEBUG_INSN)) && INSN_HAS_LOCATION (insn))
      return insn;
  }
/* Finally, if none of the above identifies the loop control branch,
   return the first location in the loop header.  */
FOR_BB_INSNS (loop->header, insn)for ((insn) = (loop->header)->il.x.head_; (insn) &&
 (insn) != NEXT_INSN ((loop->header)->il.x.rtl->end_
); (insn) = NEXT_INSN (insn))
  {
    if (INSN_P (insn)(((((enum rtx_code) (insn)->code) == INSN) || (((enum rtx_code
) (insn)->code) == JUMP_INSN) || (((enum rtx_code) (insn)->
code) == CALL_INSN)) || (((enum rtx_code) (insn)->code) ==
 DEBUG_INSN)) && INSN_HAS_LOCATION (insn))
      return insn;
  }
/* If all else fails, simply return the current function location.  */
return dump_user_location_t::from_function_decl (current_function_decl);
1894}

1896/* Records that every statement in LOOP is executed I_BOUND times.
 REALISTIC is true if I_BOUND is expected to be close to the real number
 of iterations.  UPPER is true if we are sure the loop iterates at most
 I_BOUND times.  */

1901void
1902record_niter_bound (class loop *loop, const widest_int &i_bound,
    bool realistic, bool upper)
1904{
/* Update the bounds only when there is no previous estimation, or when the
   current estimation is smaller.  */
if (upper
    && (!loop->any_upper_bound
 || wi::ltu_p (i_bound, loop->nb_iterations_upper_bound)))
  {
    loop->any_upper_bound = true;
    loop->nb_iterations_upper_bound = i_bound;
    if (!loop->any_likely_upper_bound)
{
 loop->any_likely_upper_bound = true;
 loop->nb_iterations_likely_upper_bound = i_bound;
}
  }
if (realistic
    && (!loop->any_estimate
 || wi::ltu_p (i_bound, loop->nb_iterations_estimate)))
  {
    loop->any_estimate = true;
    loop->nb_iterations_estimate = i_bound;
  }
if (!realistic
    && (!loop->any_likely_upper_bound
        || wi::ltu_p (i_bound, loop->nb_iterations_likely_upper_bound)))
  {
    loop->any_likely_upper_bound = true;
    loop->nb_iterations_likely_upper_bound = i_bound;
  }

/* If an upper bound is smaller than the realistic estimate of the
   number of iterations, use the upper bound instead.  */
if (loop->any_upper_bound
    && loop->any_estimate
    && wi::ltu_p (loop->nb_iterations_upper_bound,
    loop->nb_iterations_estimate))
  loop->nb_iterations_estimate = loop->nb_iterations_upper_bound;
if (loop->any_upper_bound
    && loop->any_likely_upper_bound
    && wi::ltu_p (loop->nb_iterations_upper_bound,
    loop->nb_iterations_likely_upper_bound))
  loop->nb_iterations_likely_upper_bound = loop->nb_iterations_upper_bound;
1946}

1948/* Similar to get_estimated_loop_iterations, but returns the estimate only
 if it fits to HOST_WIDE_INT.  If this is not the case, or the estimate
 on the number of iterations of LOOP could not be derived, returns -1.  */

1952HOST_WIDE_INTlong
1953get_estimated_loop_iterations_int (class loop *loop)
1954{
widest_int nit;
HOST_WIDE_INTlong hwi_nit;

if (!get_estimated_loop_iterations (loop, &nit))
  return -1;

if (!wi::fits_shwi_p (nit))
  return -1;
hwi_nit = nit.to_shwi ();

return hwi_nit < 0 ? -1 : hwi_nit;
1966}

1968/* Returns an upper bound on the number of executions of statements
 in the LOOP.  For statements before the loop exit, this exceeds
 the number of execution of the latch by one.  */

1972HOST_WIDE_INTlong
1973max_stmt_executions_int (class loop *loop)
1974{
HOST_WIDE_INTlong nit = get_max_loop_iterations_int (loop);
HOST_WIDE_INTlong snit;

if (nit == -1)
  return -1;

snit = (HOST_WIDE_INTlong) ((unsigned HOST_WIDE_INTlong) nit + 1);

/* If the computation overflows, return -1.  */
return snit < 0 ? -1 : snit;
1985}

1987/* Returns an likely upper bound on the number of executions of statements
 in the LOOP.  For statements before the loop exit, this exceeds
 the number of execution of the latch by one.  */

1991HOST_WIDE_INTlong
1992likely_max_stmt_executions_int (class loop *loop)
1993{
HOST_WIDE_INTlong nit = get_likely_max_loop_iterations_int (loop);
HOST_WIDE_INTlong snit;

if (nit == -1)
  return -1;

snit = (HOST_WIDE_INTlong) ((unsigned HOST_WIDE_INTlong) nit + 1);

/* If the computation overflows, return -1.  */
return snit < 0 ? -1 : snit;
2004}

2006/* Sets NIT to the estimated number of executions of the latch of the
 LOOP.  If we have no reliable estimate, the function returns false, otherwise
 returns true.  */

2010bool
2011get_estimated_loop_iterations (class loop *loop, widest_int *nit)
2012{
/* Even if the bound is not recorded, possibly we can derrive one from
   profile.  */
if (!loop->any_estimate)
  {
    if (loop->header->count.reliable_p ())
{
        *nit = gcov_type_to_wide_int
   (expected_loop_iterations_unbounded (loop) + 1);
 return true;
}
    return false;
  }

*nit = loop->nb_iterations_estimate;
return true;
2028}

2030/* Sets NIT to an upper bound for the maximum number of executions of the
 latch of the LOOP.  If we have no reliable estimate, the function returns
 false, otherwise returns true.  */

2034bool
2035get_max_loop_iterations (const class loop *loop, widest_int *nit)
2036{
if (!loop->any_upper_bound)
  return false;

*nit = loop->nb_iterations_upper_bound;
return true;
2042}

2044/* Similar to get_max_loop_iterations, but returns the estimate only
 if it fits to HOST_WIDE_INT.  If this is not the case, or the estimate
 on the number of iterations of LOOP could not be derived, returns -1.  */

2048HOST_WIDE_INTlong
2049get_max_loop_iterations_int (const class loop *loop)
2050{
widest_int nit;
HOST_WIDE_INTlong hwi_nit;

if (!get_max_loop_iterations (loop, &nit))
  return -1;

if (!wi::fits_shwi_p (nit))
  return -1;
hwi_nit = nit.to_shwi ();

return hwi_nit < 0 ? -1 : hwi_nit;
2062}

2064/* Sets NIT to an upper bound for the maximum number of executions of the
 latch of the LOOP.  If we have no reliable estimate, the function returns
 false, otherwise returns true.  */

2068bool
2069get_likely_max_loop_iterations (class loop *loop, widest_int *nit)
2070{
if (!loop->any_likely_upper_bound)
  return false;

*nit = loop->nb_iterations_likely_upper_bound;
return true;
2076}

2078/* Similar to get_max_loop_iterations, but returns the estimate only
 if it fits to HOST_WIDE_INT.  If this is not the case, or the estimate
 on the number of iterations of LOOP could not be derived, returns -1.  */

2082HOST_WIDE_INTlong
2083get_likely_max_loop_iterations_int (class loop *loop)
2084{
widest_int nit;
HOST_WIDE_INTlong hwi_nit;

if (!get_likely_max_loop_iterations (loop, &nit))
  return -1;

if (!wi::fits_shwi_p (nit))
  return -1;
hwi_nit = nit.to_shwi ();

return hwi_nit < 0 ? -1 : hwi_nit;
2096}

2098/* Returns the loop depth of the loop BB belongs to.  */

2100int
2101bb_loop_depth (const_basic_block bb)
2102{
return bb->loop_father ? loop_depth (bb->loop_father) : 0;
2104}

2106/* Marks LOOP for removal and sets LOOPS_NEED_FIXUP.  */

2108void
2109mark_loop_for_removal (loop_p loop)
2110{
if (loop->header == NULLnullptr)
  return;
loop->former_header = loop->header;
loop->header = NULLnullptr;
loop->latch = NULLnullptr;
loops_state_set (LOOPS_NEED_FIXUP);
2117}

2119/* Starting from loop tree ROOT, walk loop tree as the visiting
 order specified by FLAGS.  The supported visiting orders
 are:
   - LI_ONLY_INNERMOST
   - LI_FROM_INNERMOST
   - Preorder (if neither of above is specified)  */

2126void
2127loops_list::walk_loop_tree (class loop *root, unsigned flags)
2128{
bool only_innermost_p = flags & LI_ONLY_INNERMOST;
bool from_innermost_p = flags & LI_FROM_INNERMOST;
bool preorder_p = !(only_innermost_p || from_innermost_p);

/* Early handle root without any inner loops, make later
   processing simpler, that is all loops processed in the
   following while loop are impossible to be root.  */
if (!root->inner)
  {
    if (flags & LI_INCLUDE_ROOT)
this->to_visit.quick_push (root->num);
    return;
  }
else if (preorder_p && flags & LI_INCLUDE_ROOT)
  this->to_visit.quick_push (root->num);

class loop *aloop;
for (aloop = root->inner;
     aloop->inner != NULLnullptr;
     aloop = aloop->inner)
  {
    if (preorder_p)
this->to_visit.quick_push (aloop->num);
    continue;
  }

while (1)
  {
    gcc_assert (aloop != root)((void)(!(aloop != root) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/cfgloop.cc"
, 2157, __FUNCTION__), 0 : 0));
    if (from_innermost_p || aloop->inner == NULLnullptr)
this->to_visit.quick_push (aloop->num);

    if (aloop->next)
{
 for (aloop = aloop->next;
      aloop->inner != NULLnullptr;
      aloop = aloop->inner)
   {
     if (preorder_p)
this->to_visit.quick_push (aloop->num);
     continue;
   }
}
    else if (loop_outer (aloop) == root)
break;
    else
aloop = loop_outer (aloop);
  }

/* When visiting from innermost, we need to consider root here
   since the previous while loop doesn't handle it.  */
if (from_innermost_p && flags & LI_INCLUDE_ROOT)
  this->to_visit.quick_push (root->num);
2182}


←

/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h

1/* Vector API for GNU compiler.
2   Copyright (C) 2004-2023 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.cc.  */
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 (exact)
229    return (pfx ? pfx->m_num : 0) + reserve;
230  else if (!pfx)
231    return MAX (4, reserve)((4) > (reserve) ? (4) : (reserve));
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 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 282, __FUNCTION__), 0 : 0));
283 
284  if (GATHER_STATISTICS0 && v)
285    v->m_vecpfx.release_overhead (v, elt_size * v->allocated (),
286				  v->allocated (), false);
287 
288  size_t size = vec<T, va_heap, vl_embed>::embedded_size (alloc);
289  unsigned nelem = v ? v->length () : 0;
290  v = static_cast <vec<T, va_heap, vl_embed> *> (xrealloc (v, size));
291  v->embedded_init (alloc, nelem);
292 
293  if (GATHER_STATISTICS0)
294    v->m_vecpfx.register_overhead (v, alloc, elt_size PASS_MEM_STAT);
295}
296 
297 
298#if GCC_VERSION(4 * 1000 + 2) >= 4007
299#pragma GCC diagnostic push
300#pragma GCC diagnostic ignored "-Wfree-nonheap-object"
301#endif
302 
303/* Free the heap space allocated for vector V.  */
304 
305template<typename T>
306void
307va_heap::release (vec<T, va_heap, vl_embed> *&v)
308{
309  size_t elt_size = sizeof (T);
310  if (v == NULLnullptr)
311    return;
312 
313  if (GATHER_STATISTICS0)
314    v->m_vecpfx.release_overhead (v, elt_size * v->allocated (),
315				  v->allocated (), true);
316  ::free (v);
317  v = NULLnullptr;
318}
319 
320#if GCC_VERSION(4 * 1000 + 2) >= 4007
321#pragma GCC diagnostic pop
322#endif
323 
324/* Allocator type for GC vectors.  Notice that we need the structure
325   declaration even if GC is not enabled.  */
326 
327struct va_gc
328{
329  /* Use vl_embed as the default layout for GC vectors.  Due to GTY
330     limitations, GC vectors must always be pointers, so it is more
331     efficient to use a pointer to the vl_embed layout, rather than
332     using a pointer to a pointer as would be the case with vl_ptr.  */
333  typedef vl_embed default_layout;
334 
335  template<typename T, typename A>
336  static void reserve (vec<T, A, vl_embed> *&, unsigned, bool
337		       CXX_MEM_STAT_INFO);
338 
339  template<typename T, typename A>
340  static void release (vec<T, A, vl_embed> *&v);
341};
342 
343 
344/* Free GC memory used by V and reset V to NULL.  */
345 
346template<typename T, typename A>
347inline void
348va_gc::release (vec<T, A, vl_embed> *&v)
349{
350  if (v)
351    ::ggc_free (v);
352  v = NULLnullptr;
353}
354 
355 
356/* Allocator for GC memory.  Ensure there are at least RESERVE free
357   slots in V.  If EXACT is true, grow exactly, else grow
358   exponentially.  As a special case, if the vector had not been
359   allocated and RESERVE is 0, no vector will be created.  */
360 
361template<typename T, typename A>
362void
363va_gc::reserve (vec<T, A, vl_embed> *&v, unsigned reserve, bool exact
364		MEM_STAT_DECL)
365{
366  unsigned alloc
367    = vec_prefix::calculate_allocation (v ? &v->m_vecpfx : 0, reserve, exact);
368  if (!alloc)
369    {
370      ::ggc_free (v);
371      v = NULLnullptr;
372      return;
373    }
374 
375  /* Calculate the amount of space we want.  */
376  size_t size = vec<T, A, vl_embed>::embedded_size (alloc);
377 
378  /* Ask the allocator how much space it will really give us.  */
379  size = ::ggc_round_alloc_size (size);
380 
381  /* Adjust the number of slots accordingly.  */
382  size_t vec_offset = sizeof (vec_prefix);
383  size_t elt_size = sizeof (T);
384  alloc = (size - vec_offset) / elt_size;
385 
386  /* And finally, recalculate the amount of space we ask for.  */
387  size = vec_offset + alloc * elt_size;
388 
389  unsigned nelem = v ? v->length () : 0;
390  v = static_cast <vec<T, A, vl_embed> *> (::ggc_realloc (v, size
391							       PASS_MEM_STAT));
392  v->embedded_init (alloc, nelem);
393}
394 
395 
396/* Allocator type for GC vectors.  This is for vectors of types
397   atomics w.r.t. collection, so allocation and deallocation is
398   completely inherited from va_gc.  */
399struct va_gc_atomic : va_gc
400{
401};
402 
403 
404/* Generic vector template.  Default values for A and L indicate the
405   most commonly used strategies.
406 
407   FIXME - Ideally, they would all be vl_ptr to encourage using regular
408           instances for vectors, but the existing GTY machinery is limited
409	   in that it can only deal with GC objects that are pointers
410	   themselves.
411 
412	   This means that vector operations that need to deal with
413	   potentially NULL pointers, must be provided as free
414	   functions (see the vec_safe_* functions above).  */
415template<typename T,
416         typename A = va_heap,
417         typename L = typename A::default_layout>
418struct GTY((user)) vec
419{
420};
421 
422/* Allow C++11 range-based 'for' to work directly on vec<T>*.  */
423template<typename T, typename A, typename L>
424T* begin (vec<T,A,L> *v) { return v ? v->begin () : nullptr; }
425template<typename T, typename A, typename L>
426T* end (vec<T,A,L> *v) { return v ? v->end () : nullptr; }
427template<typename T, typename A, typename L>
428const T* begin (const vec<T,A,L> *v) { return v ? v->begin () : nullptr; }
429template<typename T, typename A, typename L>
430const T* end (const vec<T,A,L> *v) { return v ? v->end () : nullptr; }
431 
432/* Generic vec<> debug helpers.
433 
434   These need to be instantiated for each vec<TYPE> used throughout
435   the compiler like this:
436 
437    DEFINE_DEBUG_VEC (TYPE)
438 
439   The reason we have a debug_helper() is because GDB can't
440   disambiguate a plain call to debug(some_vec), and it must be called
441   like debug<TYPE>(some_vec).  */
442 
443template<typename T>
444void
445debug_helper (vec<T> &ref)
446{
447  unsigned i;
448  for (i = 0; i < ref.length (); ++i)
449    {
450      fprintf (stderrstderr, "[%d] = ", i);
451      debug_slim (ref[i]);
452      fputc ('\n', stderrstderr);
453    }
454}
455 
456/* We need a separate va_gc variant here because default template
457   argument for functions cannot be used in c++-98.  Once this
458   restriction is removed, those variant should be folded with the
459   above debug_helper.  */
460 
461template<typename T>
462void
463debug_helper (vec<T, va_gc> &ref)
464{
465  unsigned i;
466  for (i = 0; i < ref.length (); ++i)
467    {
468      fprintf (stderrstderr, "[%d] = ", i);
469      debug_slim (ref[i]);
470      fputc ('\n', stderrstderr);
471    }
472}
473 
474/* Macro to define debug(vec<T>) and debug(vec<T, va_gc>) helper
475   functions for a type T.  */
476 
477#define DEFINE_DEBUG_VEC(T)template void debug_helper (vec<T> &); template void
 debug_helper (vec<T, va_gc> &); __attribute__ ((__used__
)) void debug (vec<T> &ref) { debug_helper <T>
 (ref); } __attribute__ ((__used__)) void debug (vec<T>
 *ptr) { if (ptr) debug (*ptr); else fprintf (stderr, "<nil>\n"
); } __attribute__ ((__used__)) void debug (vec<T, va_gc>
 &ref) { debug_helper <T> (ref); } __attribute__ ((
__used__)) void debug (vec<T, va_gc> *ptr) { if (ptr) debug
 (*ptr); else fprintf (stderr, "<nil>\n"); } \
478  template void debug_helper (vec<T> &);		\
479  template void debug_helper (vec<T, va_gc> &);		\
480  /* Define the vec<T> debug functions.  */		\
481  DEBUG_FUNCTION__attribute__ ((__used__)) void					\
482  debug (vec<T> &ref)					\
483  {							\
484    debug_helper <T> (ref);				\
485  }							\
486  DEBUG_FUNCTION__attribute__ ((__used__)) void					\
487  debug (vec<T> *ptr)					\
488  {							\
489    if (ptr)						\
490      debug (*ptr);					\
491    else						\
492      fprintf (stderrstderr, "<nil>\n");			\
493  }							\
494  /* Define the vec<T, va_gc> debug functions.  */	\
495  DEBUG_FUNCTION__attribute__ ((__used__)) void					\
496  debug (vec<T, va_gc> &ref)				\
497  {							\
498    debug_helper <T> (ref);				\
499  }							\
500  DEBUG_FUNCTION__attribute__ ((__used__)) void					\
501  debug (vec<T, va_gc> *ptr)				\
502  {							\
503    if (ptr)						\
504      debug (*ptr);					\
505    else						\
506      fprintf (stderrstderr, "<nil>\n");			\
507  }
508 
509/* Default-construct N elements in DST.  */
510 
511template <typename T>
512inline void
513vec_default_construct (T *dst, unsigned n)
514{
515#ifdef BROKEN_VALUE_INITIALIZATION
516  /* Versions of GCC before 4.4 sometimes leave certain objects
517     uninitialized when value initialized, though if the type has
518     user defined default ctor, that ctor is invoked.  As a workaround
519     perform clearing first and then the value initialization, which
520     fixes the case when value initialization doesn't initialize due to
521     the bugs and should initialize to all zeros, but still allows
522     vectors for types with user defined default ctor that initializes
523     some or all elements to non-zero.  If T has no user defined
524     default ctor and some non-static data members have user defined
525     default ctors that initialize to non-zero the workaround will
526     still not work properly; in that case we just need to provide
527     user defined default ctor.  */
528  memset (dst, '\0', sizeof (T) * n);
529#endif
530  for ( ; n; ++dst, --n)
531    ::new (static_cast<void*>(dst)) T ();
532}
533 
534/* Copy-construct N elements in DST from *SRC.  */
535 
536template <typename T>
537inline void
538vec_copy_construct (T *dst, const T *src, unsigned n)
539{
540  for ( ; n; ++dst, ++src, --n)
541    ::new (static_cast<void*>(dst)) T (*src);
542}
543 
544/* Type to provide zero-initialized values for vec<T, A, L>.  This is
545   used to  provide nil initializers for vec instances.  Since vec must
546   be a trivially copyable type that can be copied by memcpy and zeroed
547   out by memset, it must have defaulted default and copy ctor and copy
548   assignment.  To initialize a vec either use value initialization
549   (e.g., vec() or vec v{ };) or assign it the value vNULL.  This isn't
550   needed for file-scope and function-local static vectors, which are
551   zero-initialized by default.  */
552struct vnull { };
553constexpr vnull vNULL{ };
554 
555 
556/* Embeddable vector.  These vectors are suitable to be embedded
557   in other data structures so that they can be pre-allocated in a
558   contiguous memory block.
559 
560   Embeddable vectors are implemented using the trailing array idiom,
561   thus they are not resizeable without changing the address of the
562   vector object itself.  This means you cannot have variables or
563   fields of embeddable vector type -- always use a pointer to a
564   vector.  The one exception is the final field of a structure, which
565   could be a vector type.
566 
567   You will have to use the embedded_size & embedded_init calls to
568   create such objects, and they will not be resizeable (so the 'safe'
569   allocation variants are not available).
570 
571   Properties:
572 
573	- The whole vector and control data are allocated in a single
574	  contiguous block.  It uses the trailing-vector idiom, so
575	  allocation must reserve enough space for all the elements
576  	  in the vector plus its control data.
577  	- The vector cannot be re-allocated.
578  	- The vector cannot grow nor shrink.
579  	- No indirections needed for access/manipulation.
580  	- It requires 2 words of storage (prior to vector allocation).  */
581 
582template<typename T, typename A>
583struct GTY((user)) vec<T, A, vl_embed>
584{
585public:
586  unsigned allocated (void) const { return m_vecpfx.m_alloc; }
587  unsigned length (void) const { return m_vecpfx.m_num; }
588  bool is_empty (void) const { return m_vecpfx.m_num == 0; }
589  T *address (void) { return reinterpret_cast <T *> (this + 1); }
590  const T *address (void) const
591    { return reinterpret_cast <const T *> (this + 1); }
592  T *begin () { return address (); }
593  const T *begin () const { return address (); }
594  T *end () { return address () + length (); }
595  const T *end () const { return address () + length (); }
596  const T &operator[] (unsigned) const;
597  T &operator[] (unsigned);
598  T &last (void);
599  bool space (unsigned) const;
600  bool iterate (unsigned, T *) const;
601  bool iterate (unsigned, T **) const;
602  vec *copy (ALONE_CXX_MEM_STAT_INFO) const;
603  void splice (const vec &);
604  void splice (const vec *src);
605  T *quick_push (const T &);
606  T &pop (void);
607  void truncate (unsigned);
608  void quick_insert (unsigned, const T &);
609  void ordered_remove (unsigned);
610  void unordered_remove (unsigned);
611  void block_remove (unsigned, unsigned);
612  void qsort (int (*) (const void *, const void *))qsort (int (*) (const void *, const void *));
613  void sort (int (*) (const void *, const void *, void *), void *);
614  void stablesort (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 (const 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 - This field should be private, but we need to cater to
634	     compilers that have stricter notions of PODness for types.  */
635  /* Align m_vecpfx to simplify address ().  */
636  alignas (T) alignas (vec_prefix) vec_prefix m_vecpfx;
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 v ? v->space (nelems) : nelems == 0;
660}
661 
662 
663/* If V is NULL, return 0.  Otherwise, return V->length().  */
664template<typename T, typename A>
665inline unsigned
666vec_safe_length (const vec<T, A, vl_embed> *v)
667{
668  return v ? v->length () : 0;
669}
670 
671 
672/* If V is NULL, return NULL.  Otherwise, return V->address().  */
673template<typename T, typename A>
674inline T *
675vec_safe_address (vec<T, A, vl_embed> *v)
676{
677  return v ? v->address () : NULLnullptr;
678}
679 
680 
681/* If V is NULL, return true.  Otherwise, return V->is_empty().  */
682template<typename T, typename A>
683inline bool
684vec_safe_is_empty (vec<T, A, vl_embed> *v)
685{
686  return v ? v->is_empty () : true;
687}
688 
689/* If V does not have space for NELEMS elements, call
690   V->reserve(NELEMS, EXACT).  */
691template<typename T, typename A>
692inline bool
693vec_safe_reserve (vec<T, A, vl_embed> *&v, unsigned nelems, bool exact = false
694		  CXX_MEM_STAT_INFO)
695{
696  bool extend = nelems ? !vec_safe_space (v, nelems) : false;
17
←
Assuming 'nelems' is 0→
18
←
'?' condition is false→
697  if (extend18.1
'extend' is false
18.1
'extend' is false
)
19
←
Taking false branch→
698    A::reserve (v, nelems, exact PASS_MEM_STAT);
699  return extend;
20
←
Returning without writing to 'v'→
700}
701 
702template<typename T, typename A>
703inline bool
704vec_safe_reserve_exact (vec<T, A, vl_embed> *&v, unsigned nelems
705			CXX_MEM_STAT_INFO)
706{
707  return vec_safe_reserve (v, nelems, true PASS_MEM_STAT);
708}
709 
710 
711/* Allocate GC memory for V with space for NELEMS slots.  If NELEMS
712   is 0, V is initialized to NULL.  */
713 
714template<typename T, typename A>
715inline void
716vec_alloc (vec<T, A, vl_embed> *&v, unsigned nelems CXX_MEM_STAT_INFO)
717{
718  v = NULLnullptr;
15
←
Null pointer value stored to field 'superloops'→
719  vec_safe_reserve (v, nelems, false PASS_MEM_STAT);
16
←
Calling 'vec_safe_reserve<loop *, va_gc>'→
21
←
Returning from 'vec_safe_reserve<loop *, va_gc>'→
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 ("/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);
815  return v->quick_push (obj);
816}
817 
818 
819/* if V has no room for one more element, reallocate it.  Then call
820   V->quick_insert(IX, OBJ).  */
821template<typename T, typename A>
822inline void
823vec_safe_insert (vec<T, A, vl_embed> *&v, unsigned ix, const T &obj
824		 CXX_MEM_STAT_INFO)
825{
826  vec_safe_reserve (v, 1, false PASS_MEM_STAT);
827  v->quick_insert (ix, obj);
828}
829 
830 
831/* If V is NULL, do nothing.  Otherwise, call V->truncate(SIZE).  */
832template<typename T, typename A>
833inline void
834vec_safe_truncate (vec<T, A, vl_embed> *v, unsigned size)
835{
836  if (v)
837    v->truncate (size);
838}
839 
840 
841/* If SRC is not NULL, return a pointer to a copy of it.  */
842template<typename T, typename A>
843inline vec<T, A, vl_embed> *
844vec_safe_copy (vec<T, A, vl_embed> *src CXX_MEM_STAT_INFO)
845{
846  return src ? src->copy (ALONE_PASS_MEM_STAT) : NULLnullptr;
847}
848 
849/* Copy the elements from SRC to the end of DST as if by memcpy.
850   Reallocate DST, if necessary.  */
851template<typename T, typename A>
852inline void
853vec_safe_splice (vec<T, A, vl_embed> *&dst, const vec<T, A, vl_embed> *src
854		 CXX_MEM_STAT_INFO)
855{
856  unsigned src_len = vec_safe_length (src);
857  if (src_len)
858    {
859      vec_safe_reserve_exact (dst, vec_safe_length (dst) + src_len
860			      PASS_MEM_STAT);
861      dst->splice (*src);
862    }
863}
864 
865/* Return true if SEARCH is an element of V.  Note that this is O(N) in the
866   size of the vector and so should be used with care.  */
867 
868template<typename T, typename A>
869inline bool
870vec_safe_contains (vec<T, A, vl_embed> *v, const T &search)
871{
872  return v ? v->contains (search) : false;
873}
874 
875/* Index into vector.  Return the IX'th element.  IX must be in the
876   domain of the vector.  */
877 
878template<typename T, typename A>
879inline const T &
880vec<T, A, vl_embed>::operator[] (unsigned ix) const
881{
882  gcc_checking_assert (ix < m_vecpfx.m_num)((void)(!(ix < m_vecpfx.m_num) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 882, __FUNCTION__), 0 : 0));
883  return address ()[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 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 890, __FUNCTION__), 0 : 0));
891  return address ()[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 ("/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 (a copy of) 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; v->iterate (ix, &val); 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 = address ()[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 *, &address ()[ix])(const_cast<T *> ((&address ()[ix])));
960      return true;
961    }
962  else
963    {
964      *ptr = 0;
965      return false;
966    }
967}
968 
969 
970/* Return a pointer to a copy of this vector.  */
971 
972template<typename T, typename A>
973inline vec<T, A, vl_embed> *
974vec<T, A, vl_embed>::copy (ALONE_MEM_STAT_DECLvoid) const
975{
976  vec<T, A, vl_embed> *new_vec = NULLnullptr;
977  unsigned len = length ();
978  if (len)
979    {
980      vec_alloc (new_vec, len PASS_MEM_STAT);
981      new_vec->embedded_init (len, len);
982      vec_copy_construct (new_vec->address (), address (), 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 ("/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 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1021, __FUNCTION__), 0 : 0));
1022  T *slot = &address ()[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 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1034, __FUNCTION__), 0 : 0));
1035  return address ()[--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 ("/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 ("/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 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1059, __FUNCTION__), 0 : 0));
1060  T *slot = &address ()[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 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1074, __FUNCTION__), 0 : 0));
1075  T *slot = &address ()[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 ("/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 ("/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 ("/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
 ("/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
 ("/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
 ("/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
 ("/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 ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1121, __FUNCTION__), 0 : 0));
1122  T *p = address ();
1123  p[ix] = p[--m_vecpfx.m_num];
1124}
1125 
1126 
1127/* Remove LEN elements starting at the IXth.  Ordering is retained.
1128   This is an O(N) operation due to memmove.  */
1129 
1130template<typename T, typename A>
1131inline void
1132vec<T, A, vl_embed>::block_remove (unsigned ix, unsigned len)
1133{
1134  gcc_checking_assert (ix + len <= length ())((void)(!(ix + len <= length ()) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1134, __FUNCTION__), 0 : 0));
1135  T *slot = &address ()[ix];
1136  m_vecpfx.m_num -= len;
1137  memmove (slot, slot + len, (m_vecpfx.m_num - ix) * sizeof (T));
1138}
1139 
1140 
1141/* Sort the contents of this vector with qsort.  CMP is the comparison
1142   function to pass to qsort.  */
1143 
1144template<typename T, typename A>
1145inline void
1146vec<T, A, vl_embed>::qsort (int (*cmp) (const void *, const void *))qsort (int (*cmp) (const void *, const void *))
1147{
1148  if (length () > 1)
1149    gcc_qsort (address (), length (), sizeof (T), cmp);
1150}
1151 
1152/* Sort the contents of this vector with qsort.  CMP is the comparison
1153   function to pass to qsort.  */
1154 
1155template<typename T, typename A>
1156inline void
1157vec<T, A, vl_embed>::sort (int (*cmp) (const void *, const void *, void *),
1158			   void *data)
1159{
1160  if (length () > 1)
1161    gcc_sort_r (address (), length (), sizeof (T), cmp, data);
1162}
1163 
1164/* Sort the contents of this vector with gcc_stablesort_r.  CMP is the
1165   comparison function to pass to qsort.  */
1166 
1167template<typename T, typename A>
1168inline void
1169vec<T, A, vl_embed>::stablesort (int (*cmp) (const void *, const void *,
1170					     void *), void *data)
1171{
1172  if (length () > 1)
1173    gcc_stablesort_r (address (), length (), sizeof (T), cmp, data);
1174}
1175 
1176/* Search the contents of the sorted vector with a binary search.
1177   CMP is the comparison function to pass to bsearch.  */
1178 
1179template<typename T, typename A>
1180inline T *
1181vec<T, A, vl_embed>::bsearch (const void *key,
1182			      int (*compar) (const void *, const void *))
1183{
1184  const void *base = this->address ();
1185  size_t nmemb = this->length ();
1186  size_t size = sizeof (T);
1187  /* The following is a copy of glibc stdlib-bsearch.h.  */
1188  size_t l, u, idx;
1189  const void *p;
1190  int comparison;
1191 
1192  l = 0;
1193  u = nmemb;
1194  while (l < u)
1195    {
1196      idx = (l + u) / 2;
1197      p = (const void *) (((const char *) base) + (idx * size));
1198      comparison = (*compar) (key, p);
1199      if (comparison < 0)
1200	u = idx;
1201      else if (comparison > 0)
1202	l = idx + 1;
1203      else
1204	return (T *)const_cast<void *>(p);
1205    }
1206 
1207  return NULLnullptr;
1208}
1209 
1210/* Search the contents of the sorted vector with a binary search.
1211   CMP is the comparison function to pass to bsearch.  */
1212 
1213template<typename T, typename A>
1214inline T *
1215vec<T, A, vl_embed>::bsearch (const void *key,
1216			      int (*compar) (const void *, const void *,
1217					     void *), void *data)
1218{
1219  const void *base = this->address ();
1220  size_t nmemb = this->length ();
1221  size_t size = sizeof (T);
1222  /* The following is a copy of glibc stdlib-bsearch.h.  */
1223  size_t l, u, idx;
1224  const void *p;
1225  int comparison;
1226 
1227  l = 0;
1228  u = nmemb;
1229  while (l < u)
1230    {
1231      idx = (l + u) / 2;
1232      p = (const void *) (((const char *) base) + (idx * size));
1233      comparison = (*compar) (key, p, data);
1234      if (comparison < 0)
1235	u = idx;
1236      else if (comparison > 0)
1237	l = idx + 1;
1238      else
1239	return (T *)const_cast<void *>(p);
1240    }
1241 
1242  return NULLnullptr;
1243}
1244 
1245/* Return true if SEARCH is an element of V.  Note that this is O(N) in the
1246   size of the vector and so should be used with care.  */
1247 
1248template<typename T, typename A>
1249inline bool
1250vec<T, A, vl_embed>::contains (const T &search) const
1251{
1252  unsigned int len = length ();
1253  const T *p = address ();
1254  for (unsigned int i = 0; i < len; i++)
1255    {
1256      const T *slot = &p[i];
1257      if (*slot == search)
1258	return true;
1259    }
1260 
1261  return false;
1262}
1263 
1264/* Find and return the first position in which OBJ could be inserted
1265   without changing the ordering of this vector.  LESSTHAN is a
1266   function that returns true if the first argument is strictly less
1267   than the second.  */
1268 
1269template<typename T, typename A>
1270unsigned
1271vec<T, A, vl_embed>::lower_bound (const T &obj,
1272				  bool (*lessthan)(const T &, const T &))
1273  const
1274{
1275  unsigned int len = length ();
1276  unsigned int half, middle;
1277  unsigned int first = 0;
1278  while (len > 0)
1279    {
1280      half = len / 2;
1281      middle = first;
1282      middle += half;
1283      const T &middle_elem = address ()[middle];
1284      if (lessthan (middle_elem, obj))
1285	{
1286	  first = middle;
1287	  ++first;
1288	  len = len - half - 1;
1289	}
1290      else
1291	len = half;
1292    }
1293  return first;
1294}
1295 
1296 
1297/* Return the number of bytes needed to embed an instance of an
1298   embeddable vec inside another data structure.
1299 
1300   Use these methods to determine the required size and initialization
1301   of a vector V of type T embedded within another structure (as the
1302   final member):
1303 
1304   size_t vec<T, A, vl_embed>::embedded_size (unsigned alloc);
1305   void v->embedded_init (unsigned alloc, unsigned num);
1306 
1307   These allow the caller to perform the memory allocation.  */
1308 
1309template<typename T, typename A>
1310inline size_t
1311vec<T, A, vl_embed>::embedded_size (unsigned alloc)
1312{
1313  struct alignas (T) U { char data[sizeof (T)]; };
1314  typedef vec<U, A, vl_embed> vec_embedded;
1315  typedef typename std::conditional<std::is_standard_layout<T>::value,
1316				    vec, vec_embedded>::type vec_stdlayout;
1317  static_assert (sizeof (vec_stdlayout) == sizeof (vec), "");
1318  static_assert (alignof (vec_stdlayout) == alignof (vec), "");
1319  return sizeof (vec_stdlayout) + alloc * sizeof (T);
1320}
1321 
1322 
1323/* Initialize the vector to contain room for ALLOC elements and
1324   NUM active elements.  */
1325 
1326template<typename T, typename A>
1327inline void
1328vec<T, A, vl_embed>::embedded_init (unsigned alloc, unsigned num, unsigned aut)
1329{
1330  m_vecpfx.m_alloc = alloc;
1331  m_vecpfx.m_using_auto_storage = aut;
1332  m_vecpfx.m_num = num;
1333}
1334 
1335 
1336/* Grow the vector to a specific length.  LEN must be as long or longer than
1337   the current length.  The new elements are uninitialized.  */
1338 
1339template<typename T, typename A>
1340inline void
1341vec<T, A, vl_embed>::quick_grow (unsigned len)
1342{
1343  gcc_checking_assert (length () <= len && len <= m_vecpfx.m_alloc)((void)(!(length () <= len && len <= m_vecpfx.m_alloc
) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1343, __FUNCTION__), 0 : 0));
1344  m_vecpfx.m_num = len;
1345}
1346 
1347 
1348/* Grow the vector to a specific length.  LEN must be as long or longer than
1349   the current length.  The new elements are initialized to zero.  */
1350 
1351template<typename T, typename A>
1352inline void
1353vec<T, A, vl_embed>::quick_grow_cleared (unsigned len)
1354{
1355  unsigned oldlen = length ();
1356  size_t growby = len - oldlen;
1357  quick_grow (len);
1358  if (growby != 0)
1359    vec_default_construct (address () + oldlen, growby);
1360}
1361 
1362/* Garbage collection support for vec<T, A, vl_embed>.  */
1363 
1364template<typename T>
1365void
1366gt_ggc_mx (vec<T, va_gc> *v)
1367{
1368  extern void gt_ggc_mx (T &);
1369  for (unsigned i = 0; i < v->length (); i++)
1370    gt_ggc_mx ((*v)[i]);
1371}
1372 
1373template<typename T>
1374void
1375gt_ggc_mx (vec<T, va_gc_atomic, vl_embed> *v ATTRIBUTE_UNUSED__attribute__ ((__unused__)))
1376{
1377  /* Nothing to do.  Vectors of atomic types wrt GC do not need to
1378     be traversed.  */
1379}
1380 
1381 
1382/* PCH support for vec<T, A, vl_embed>.  */
1383 
1384template<typename T, typename A>
1385void
1386gt_pch_nx (vec<T, A, vl_embed> *v)
1387{
1388  extern void gt_pch_nx (T &);
1389  for (unsigned i = 0; i < v->length (); i++)
1390    gt_pch_nx ((*v)[i]);
1391}
1392 
1393template<typename T, typename A>
1394void
1395gt_pch_nx (vec<T *, A, vl_embed> *v, gt_pointer_operator op, void *cookie)
1396{
1397  for (unsigned i = 0; i < v->length (); i++)
1398    op (&((*v)[i]), NULLnullptr, cookie);
1399}
1400 
1401template<typename T, typename A>
1402void
1403gt_pch_nx (vec<T, A, vl_embed> *v, gt_pointer_operator op, void *cookie)
1404{
1405  extern void gt_pch_nx (T *, gt_pointer_operator, void *);
1406  for (unsigned i = 0; i < v->length (); i++)
1407    gt_pch_nx (&((*v)[i]), op, cookie);
1408}
1409 
1410 
1411/* Space efficient vector.  These vectors can grow dynamically and are
1412   allocated together with their control data.  They are suited to be
1413   included in data structures.  Prior to initial allocation, they
1414   only take a single word of storage.
1415 
1416   These vectors are implemented as a pointer to an embeddable vector.
1417   The semantics allow for this pointer to be NULL to represent empty
1418   vectors.  This way, empty vectors occupy minimal space in the
1419   structure containing them.
1420 
1421   Properties:
1422 
1423	- The whole vector and control data are allocated in a single
1424	  contiguous block.
1425  	- The whole vector may be re-allocated.
1426  	- Vector data may grow and shrink.
1427  	- Access and manipulation requires a pointer test and
1428	  indirection.
1429	- It requires 1 word of storage (prior to vector allocation).
1430 
1431 
1432   Limitations:
1433 
1434   These vectors must be PODs because they are stored in unions.
1435   (http://en.wikipedia.org/wiki/Plain_old_data_structures).
1436   As long as we use C++03, we cannot have constructors nor
1437   destructors in classes that are stored in unions.  */
1438 
1439template<typename T, size_t N = 0>
1440class auto_vec;
1441 
1442template<typename T>
1443struct vec<T, va_heap, vl_ptr>
1444{
1445public:
1446  /* Default ctors to ensure triviality.  Use value-initialization
1447     (e.g., vec() or vec v{ };) or vNULL to create a zero-initialized
1448     instance.  */
1449  vec () = default;
1450  vec (const vec &) = default;
1451  /* Initialization from the generic vNULL.  */
1452  vec (vnull): m_vec () { }
1453  /* Same as default ctor: vec storage must be released manually.  */
1454  ~vec () = default;
1455 
1456  /* Defaulted same as copy ctor.  */
1457  vec& operator= (const vec &) = default;
1458 
1459  /* Prevent implicit conversion from auto_vec.  Use auto_vec::to_vec()
1460     instead.  */
1461  template <size_t N>
1462  vec (auto_vec<T, N> &) = delete;
1463 
1464  template <size_t N>
1465  void operator= (auto_vec<T, N> &) = delete;
1466 
1467  /* Memory allocation and deallocation for the embedded vector.
1468     Needed because we cannot have proper ctors/dtors defined.  */
1469  void create (unsigned nelems CXX_MEM_STAT_INFO);
1470  void release (void);
1471 
1472  /* Vector operations.  */
1473  bool exists (void) const
1474  { return m_vec != NULLnullptr; }
1475 
1476  bool is_empty (void) const
1477  { return m_vec ? m_vec->is_empty () : true; }
1478 
1479  unsigned allocated (void) const
1480  { return m_vec ? m_vec->allocated () : 0; }
1481 
1482  unsigned length (void) const
1483  { return m_vec ? m_vec->length () : 0; }
1484 
1485  T *address (void)
1486  { return m_vec ? m_vec->address () : NULLnullptr; }
1487 
1488  const T *address (void) const
1489  { return m_vec ? m_vec->address () : NULLnullptr; }
1490 
1491  T *begin () { return address (); }
1492  const T *begin () const { return address (); }
1493  T *end () { return begin () + length (); }
1494  const T *end () const { return begin () + length (); }
1495  const T &operator[] (unsigned ix) const
1496  { return (*m_vec)[ix]; }
1497 
1498  bool operator!=(const vec &other) const
1499  { return !(*this == other); }
1500 
1501  bool operator==(const vec &other) const
1502  { return address () == other.address (); }
1503 
1504  T &operator[] (unsigned ix)
1505  { return (*m_vec)[ix]; }
1506 
1507  T &last (void)
1508  { return m_vec->last (); }
1509 
1510  bool space (int nelems) const
1511  { return m_vec ? m_vec->space (nelems) : nelems == 0; }
1512 
1513  bool iterate (unsigned ix, T *p) const;
1514  bool iterate (unsigned ix, T **p) const;
1515  vec copy (ALONE_CXX_MEM_STAT_INFO) const;
1516  bool reserve (unsigned, bool = false CXX_MEM_STAT_INFO);
1517  bool reserve_exact (unsigned CXX_MEM_STAT_INFO);
1518  void splice (const vec &);
1519  void safe_splice (const vec & CXX_MEM_STAT_INFO);
1520  T *quick_push (const T &);
1521  T *safe_push (const T &CXX_MEM_STAT_INFO);
1522  T &pop (void);
1523  void truncate (unsigned);
1524  void safe_grow (unsigned, bool = false CXX_MEM_STAT_INFO);
1525  void safe_grow_cleared (unsigned, bool = false CXX_MEM_STAT_INFO);
1526  void quick_grow (unsigned);
1527  void quick_grow_cleared (unsigned);
1528  void quick_insert (unsigned, const T &);
1529  void safe_insert (unsigned, const T & CXX_MEM_STAT_INFO);
1530  void ordered_remove (unsigned);
1531  void unordered_remove (unsigned);
1532  void block_remove (unsigned, unsigned);
1533  void qsort (int (*) (const void *, const void *))qsort (int (*) (const void *, const void *));
1534  void sort (int (*) (const void *, const void *, void *), void *);
1535  void stablesort (int (*) (const void *, const void *, void *), void *);
1536  T *bsearch (const void *key, int (*compar)(const void *, const void *));
1537  T *bsearch (const void *key,
1538	      int (*compar)(const void *, const void *, void *), void *);
1539  unsigned lower_bound (T, bool (*)(const T &, const T &)) const;
1540  bool contains (const T &search) const;
1541  void reverse (void);
1542 
1543  bool using_auto_storage () const;
1544 
1545  /* FIXME - This field should be private, but we need to cater to
1546	     compilers that have stricter notions of PODness for types.  */
1547  vec<T, va_heap, vl_embed> *m_vec;
1548};
1549 
1550 
1551/* auto_vec is a subclass of vec that automatically manages creating and
1552   releasing the internal vector. If N is non zero then it has N elements of
1553   internal storage.  The default is no internal storage, and you probably only
1554   want to ask for internal storage for vectors on the stack because if the
1555   size of the vector is larger than the internal storage that space is wasted.
1556   */
1557template<typename T, size_t N /* = 0 */>
1558class auto_vec : public vec<T, va_heap>
1559{
1560public:
1561  auto_vec ()
1562  {
1563    m_auto.embedded_init (N, 0, 1);
1564    /* ???  Instead of initializing m_vec from &m_auto directly use an
1565       expression that avoids refering to a specific member of 'this'
1566       to derail the -Wstringop-overflow diagnostic code, avoiding
1567       the impression that data accesses are supposed to be to the
1568       m_auto member storage.  */
1569    size_t off = (char *) &m_auto - (char *) this;
1570    this->m_vec = (vec<T, va_heap, vl_embed> *) ((char *) this + off);
1571  }
1572 
1573  auto_vec (size_t s CXX_MEM_STAT_INFO)
1574  {
1575    if (s > N)
1576      {
1577	this->create (s PASS_MEM_STAT);
1578	return;
1579      }
1580 
1581    m_auto.embedded_init (N, 0, 1);
1582    /* ???  See above.  */
1583    size_t off = (char *) &m_auto - (char *) this;
1584    this->m_vec = (vec<T, va_heap, vl_embed> *) ((char *) this + off);
1585  }
1586 
1587  ~auto_vec ()
1588  {
1589    this->release ();
1590  }
1591 
1592  /* Explicitly convert to the base class.  There is no conversion
1593     from a const auto_vec because a copy of the returned vec can
1594     be used to modify *THIS.
1595     This is a legacy function not to be used in new code.  */
1596  vec<T, va_heap> to_vec_legacy () {
1597    return *static_cast<vec<T, va_heap> *>(this);
1598  }
1599 
1600private:
1601  vec<T, va_heap, vl_embed> m_auto;
1602  unsigned char m_data[sizeof (T) * N];
1603};
1604 
1605/* auto_vec is a sub class of vec whose storage is released when it is
1606  destroyed. */
1607template<typename T>
1608class auto_vec<T, 0> : public vec<T, va_heap>
1609{
1610public:
1611  auto_vec () { this->m_vec = NULLnullptr; }
1612  auto_vec (size_t n CXX_MEM_STAT_INFO) { this->create (n PASS_MEM_STAT); }
1613  ~auto_vec () { this->release (); }
1614 
1615  auto_vec (vec<T, va_heap>&& r)
1616    {
1617      gcc_assert (!r.using_auto_storage ())((void)(!(!r.using_auto_storage ()) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1617, __FUNCTION__), 0 : 0));
1618      this->m_vec = r.m_vec;
1619      r.m_vec = NULLnullptr;
1620    }
1621 
1622  auto_vec (auto_vec<T> &&r)
1623    {
1624      gcc_assert (!r.using_auto_storage ())((void)(!(!r.using_auto_storage ()) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1624, __FUNCTION__), 0 : 0));
1625      this->m_vec = r.m_vec;
1626      r.m_vec = NULLnullptr;
1627    }
1628 
1629  auto_vec& operator= (vec<T, va_heap>&& r)
1630    {
1631	    if (this == &r)
1632		    return *this;
1633 
1634      gcc_assert (!r.using_auto_storage ())((void)(!(!r.using_auto_storage ()) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1634, __FUNCTION__), 0 : 0));
1635      this->release ();
1636      this->m_vec = r.m_vec;
1637      r.m_vec = NULLnullptr;
1638      return *this;
1639    }
1640 
1641  auto_vec& operator= (auto_vec<T> &&r)
1642    {
1643	    if (this == &r)
1644		    return *this;
1645 
1646      gcc_assert (!r.using_auto_storage ())((void)(!(!r.using_auto_storage ()) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 1646, __FUNCTION__), 0 : 0));
1647      this->release ();
1648      this->m_vec = r.m_vec;
1649      r.m_vec = NULLnullptr;
1650      return *this;
1651    }
1652 
1653  /* Explicitly convert to the base class.  There is no conversion
1654     from a const auto_vec because a copy of the returned vec can
1655     be used to modify *THIS.
1656     This is a legacy function not to be used in new code.  */
1657  vec<T, va_heap> to_vec_legacy () {
1658    return *static_cast<vec<T, va_heap> *>(this);
1659  }
1660 
1661  // You probably don't want to copy a vector, so these are deleted to prevent
1662  // unintentional use.  If you really need a copy of the vectors contents you
1663  // can use copy ().
1664  auto_vec(const auto_vec &) = delete;
1665  auto_vec &operator= (const auto_vec &) = delete;
1666};
1667 
1668 
1669/* Allocate heap memory for pointer V and create the internal vector
1670   with space for NELEMS elements.  If NELEMS is 0, the internal
1671   vector is initialized to empty.  */
1672 
1673template<typename T>
1674inline void
1675vec_alloc (vec<T> *&v, unsigned nelems CXX_MEM_STAT_INFO)
1676{
1677  v = new vec<T>;
1678  v->create (nelems PASS_MEM_STAT);
1679}
1680 
1681 
1682/* A subclass of auto_vec <char *> that frees all of its elements on
1683   deletion.  */
1684 
1685class auto_string_vec : public auto_vec <char *>
1686{
1687 public:
1688  ~auto_string_vec ();
1689};
1690 
1691/* A subclass of auto_vec <T *> that deletes all of its elements on
1692   destruction.
1693 
1694   This is a crude way for a vec to "own" the objects it points to
1695   and clean up automatically.
1696 
1697   For example, no attempt is made to delete elements when an item
1698   within the vec is overwritten.
1699 
1700   We can't rely on gnu::unique_ptr within a container,
1701   since we can't rely on move semantics in C++98.  */
1702 
1703template <typename T>
1704class auto_delete_vec : public auto_vec <T *>
1705{
1706 public:
1707  auto_delete_vec () {}
1708  auto_delete_vec (size_t s) : auto_vec <T *> (s) {}
1709 
1710  ~auto_delete_vec ();
1711 
1712private:
1713  DISABLE_COPY_AND_ASSIGN(auto_delete_vec)auto_delete_vec (const auto_delete_vec&) = delete; void operator
= (const auto_delete_vec &) = delete;
1714};
1715 
1716/* Conditionally allocate heap memory for VEC and its internal vector.  */
1717 
1718template<typename T>
1719inline void
1720vec_check_alloc (vec<T, va_heap> *&vec, unsigned nelems CXX_MEM_STAT_INFO)
1721{
1722  if (!vec)
1723    vec_alloc (vec, nelems PASS_MEM_STAT);
1724}
1725 
1726 
1727/* Free the heap memory allocated by vector V and set it to NULL.  */
1728 
1729template<typename T>
1730inline void
1731vec_free (vec<T> *&v)
1732{
1733  if (v == NULLnullptr)
1734    return;
1735 
1736  v->release ();
1737  delete v;
1738  v = NULLnullptr;
1739}
1740 
1741 
1742/* Return iteration condition and update PTR to point to the IX'th
1743   element of this vector.  Use this to iterate over the elements of a
1744   vector as follows,
1745 
1746     for (ix = 0; v.iterate (ix, &ptr); ix++)
1747       continue;  */
1748 
1749template<typename T>
1750inline bool
1751vec<T, va_heap, vl_ptr>::iterate (unsigned ix, T *ptr) const
1752{
1753  if (m_vec)
1754    return m_vec->iterate (ix, ptr);
1755  else
1756    {
1757      *ptr = 0;
1758      return false;
1759    }
1760}
1761 
1762 
1763/* Return iteration condition and update *PTR to point to the
1764   IX'th element of this vector.  Use this to iterate over the
1765   elements of a vector as follows,
1766 
1767     for (ix = 0; v->iterate (ix, &ptr); ix++)
1768       continue;
1769 
1770   This variant is for vectors of objects.  */
1771 
1772template<typename T>
1773inline bool
1774vec<T, va_heap, vl_ptr>::iterate (unsigned ix, T **ptr) const
1775{
1776  if (m_vec)
1777    return m_vec->iterate (ix, ptr);
1778  else
1779    {
1780      *ptr = 0;
1781      return false;
1782    }
1783}
1784 
1785 
1786/* Convenience macro for forward iteration.  */
1787#define FOR_EACH_VEC_ELT(V, I, P)for (I = 0; (V).iterate ((I), &(P)); ++(I))			\
1788  for (I = 0; (V).iterate ((I), &(P)); ++(I))
1789 
1790#define FOR_EACH_VEC_SAFE_ELT(V, I, P)for (I = 0; vec_safe_iterate ((V), (I), &(P)); ++(I))			\
1791  for (I = 0; vec_safe_iterate ((V), (I), &(P)); ++(I))
1792 
1793/* Likewise, but start from FROM rather than 0.  */
1794#define FOR_EACH_VEC_ELT_FROM(V, I, P, FROM)for (I = (FROM); (V).iterate ((I), &(P)); ++(I))		\
1795  for (I = (FROM); (V).iterate ((I), &(P)); ++(I))
1796 
1797/* Convenience macro for reverse iteration.  */
1798#define FOR_EACH_VEC_ELT_REVERSE(V, I, P)for (I = (V).length () - 1; (V).iterate ((I), &(P)); (I)--
)		\
1799  for (I = (V).length () - 1;				\
1800       (V).iterate ((I), &(P));				\
1801       (I)--)
1802 
1803#define FOR_EACH_VEC_SAFE_ELT_REVERSE(V, I, P)for (I = vec_safe_length (V) - 1; vec_safe_iterate ((V), (I),
 &(P)); (I)--)		\
1804  for (I = vec_safe_length (V) - 1;			\
1805       vec_safe_iterate ((V), (I), &(P));	\
1806       (I)--)
1807 
1808/* auto_string_vec's dtor, freeing all contained strings, automatically
1809   chaining up to ~auto_vec <char *>, which frees the internal buffer.  */
1810 
1811inline
1812auto_string_vec::~auto_string_vec ()
1813{
1814  int i;
1815  char *str;
1816  FOR_EACH_VEC_ELT (*this, i, str)for (i = 0; (*this).iterate ((i), &(str)); ++(i))
1817    free (str);
1818}
1819 
1820/* auto_delete_vec's dtor, deleting all contained items, automatically
1821   chaining up to ~auto_vec <T*>, which frees the internal buffer.  */
1822 
1823template <typename T>
1824inline
1825auto_delete_vec<T>::~auto_delete_vec ()
1826{
1827  int i;
1828  T *item;
1829  FOR_EACH_VEC_ELT (*this, i, item)for (i = 0; (*this).iterate ((i), &(item)); ++(i))
1830    delete item;
1831}
1832 
1833 
1834/* Return a copy of this vector.  */
1835 
1836template<typename T>
1837inline vec<T, va_heap, vl_ptr>
1838vec<T, va_heap, vl_ptr>::copy (ALONE_MEM_STAT_DECLvoid) const
1839{
1840  vec<T, va_heap, vl_ptr> new_vec{ };
1841  if (length ())
1842    new_vec.m_vec = m_vec->copy (ALONE_PASS_MEM_STAT);
1843  return new_vec;
1844}
1845 
1846 
1847/* Ensure that the vector has at least RESERVE slots available (if
1848   EXACT is false), or exactly RESERVE slots available (if EXACT is
1849   true).
1850 
1851   This may create additional headroom if EXACT is false.
1852 
1853   Note that this can cause the embedded vector to be reallocated.
1854   Returns true iff reallocation actually occurred.  */
1855 
1856template<typename T>
1857inline bool
1858vec<T, va_heap, vl_ptr>::reserve (unsigned nelems, bool exact MEM_STAT_DECL)
1859{
1860  if (space (nelems))
1861    return false;
1862 
1863  /* For now play a game with va_heap::reserve to hide our auto storage if any,
1864     this is necessary because it doesn't have enough information to know the
1865     embedded vector is in auto storage, and so should not be freed.  */
1866  vec<T, va_heap, vl_embed> *oldvec = m_vec;
1867  unsigned int oldsize = 0;
1868  bool handle_auto_vec = m_vec && using_auto_storage ();
1869  if (handle_auto_vec)
1870    {
1871      m_vec = NULLnullptr;
1872      oldsize = oldvec->length ();
1873      nelems += oldsize;
1874    }
1875 
1876  va_heap::reserve (m_vec, nelems, exact PASS_MEM_STAT);
1877  if (handle_auto_vec)
1878    {
1879      vec_copy_construct (m_vec->address (), oldvec->address (), oldsize);
1880      m_vec->m_vecpfx.m_num = oldsize;
1881    }
1882 
1883  return true;
1884}
1885 
1886 
1887/* Ensure that this vector has exactly NELEMS slots available.  This
1888   will not create additional headroom.  Note this can cause the
1889   embedded vector to be reallocated.  Returns true iff reallocation
1890   actually occurred.  */
1891 
1892template<typename T>
1893inline bool
1894vec<T, va_heap, vl_ptr>::reserve_exact (unsigned nelems MEM_STAT_DECL)
1895{
1896  return reserve (nelems, true PASS_MEM_STAT);
1897}
1898 
1899 
1900/* Create the internal vector and reserve NELEMS for it.  This is
1901   exactly like vec::reserve, but the internal vector is
1902   unconditionally allocated from scratch.  The old one, if it
1903   existed, is lost.  */
1904 
1905template<typename T>
1906inline void
1907vec<T, va_heap, vl_ptr>::create (unsigned nelems MEM_STAT_DECL)
1908{
1909  m_vec = NULLnullptr;
1910  if (nelems > 0)
1911    reserve_exact (nelems PASS_MEM_STAT);
1912}
1913 
1914 
1915/* Free the memory occupied by the embedded vector.  */
1916 
1917template<typename T>
1918inline void
1919vec<T, va_heap, vl_ptr>::release (void)
1920{
1921  if (!m_vec)
1922    return;
1923 
1924  if (using_auto_storage ())
1925    {
1926      m_vec->m_vecpfx.m_num = 0;
1927      return;
1928    }
1929 
1930  va_heap::release (m_vec);
1931}
1932 
1933/* Copy the elements from SRC to the end of this vector as if by memcpy.
1934   SRC and this vector must be allocated with the same memory
1935   allocation mechanism. This vector is assumed to have sufficient
1936   headroom available.  */
1937 
1938template<typename T>
1939inline void
1940vec<T, va_heap, vl_ptr>::splice (const vec<T, va_heap, vl_ptr> &src)
1941{
1942  if (src.length ())
1943    m_vec->splice (*(src.m_vec));
1944}
1945 
1946 
1947/* Copy the elements in SRC to the end of this vector as if by memcpy.
1948   SRC and this vector must be allocated with the same mechanism.
1949   If there is not enough headroom in this vector, it will be reallocated
1950   as needed.  */
1951 
1952template<typename T>
1953inline void
1954vec<T, va_heap, vl_ptr>::safe_splice (const vec<T, va_heap, vl_ptr> &src
1955				      MEM_STAT_DECL)
1956{
1957  if (src.length ())
1958    {
1959      reserve_exact (src.length ());
1960      splice (src);
1961    }
1962}
1963 
1964 
1965/* Push OBJ (a new element) onto the end of the vector.  There must be
1966   sufficient space in the vector.  Return a pointer to the slot
1967   where OBJ was inserted.  */
1968 
1969template<typename T>
1970inline T *
1971vec<T, va_heap, vl_ptr>::quick_push (const T &obj)
1972{
1973  return m_vec->quick_push (obj);
1974}
1975 
1976 
1977/* Push a new element OBJ onto the end of this vector.  Reallocates
1978   the embedded vector, if needed.  Return a pointer to the slot where
1979   OBJ was inserted.  */
1980 
1981template<typename T>
1982inline T *
1983vec<T, va_heap, vl_ptr>::safe_push (const T &obj MEM_STAT_DECL)
1984{
1985  reserve (1, false PASS_MEM_STAT);
1986  return quick_push (obj);
1987}
1988 
1989 
1990/* Pop and return the last element off the end of the vector.  */
1991 
1992template<typename T>
1993inline T &
1994vec<T, va_heap, vl_ptr>::pop (void)
1995{
1996  return m_vec->pop ();
1997}
1998 
1999 
2000/* Set the length of the vector to LEN.  The new length must be less
2001   than or equal to the current length.  This is an O(1) operation.  */
2002 
2003template<typename T>
2004inline void
2005vec<T, va_heap, vl_ptr>::truncate (unsigned size)
2006{
2007  if (m_vec)
2008    m_vec->truncate (size);
2009  else
2010    gcc_checking_assert (size == 0)((void)(!(size == 0) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 2010, __FUNCTION__), 0 : 0));
2011}
2012 
2013 
2014/* Grow the vector to a specific length.  LEN must be as long or
2015   longer than the current length.  The new elements are
2016   uninitialized.  Reallocate the internal vector, if needed.  */
2017 
2018template<typename T>
2019inline void
2020vec<T, va_heap, vl_ptr>::safe_grow (unsigned len, bool exact MEM_STAT_DECL)
2021{
2022  unsigned oldlen = length ();
2023  gcc_checking_assert (oldlen <= len)((void)(!(oldlen <= len) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 2023, __FUNCTION__), 0 : 0));
2024  reserve (len - oldlen, exact PASS_MEM_STAT);
2025  if (m_vec)
2026    m_vec->quick_grow (len);
2027  else
2028    gcc_checking_assert (len == 0)((void)(!(len == 0) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 2028, __FUNCTION__), 0 : 0));
2029}
2030 
2031 
2032/* Grow the embedded vector to a specific length.  LEN must be as
2033   long or longer than the current length.  The new elements are
2034   initialized to zero.  Reallocate the internal vector, if needed.  */
2035 
2036template<typename T>
2037inline void
2038vec<T, va_heap, vl_ptr>::safe_grow_cleared (unsigned len, bool exact
2039					    MEM_STAT_DECL)
2040{
2041  unsigned oldlen = length ();
2042  size_t growby = len - oldlen;
2043  safe_grow (len, exact PASS_MEM_STAT);
2044  if (growby != 0)
2045    vec_default_construct (address () + oldlen, growby);
2046}
2047 
2048 
2049/* Same as vec::safe_grow but without reallocation of the internal vector.
2050   If the vector cannot be extended, a runtime assertion will be triggered.  */
2051 
2052template<typename T>
2053inline void
2054vec<T, va_heap, vl_ptr>::quick_grow (unsigned len)
2055{
2056  gcc_checking_assert (m_vec)((void)(!(m_vec) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 2056, __FUNCTION__), 0 : 0));
2057  m_vec->quick_grow (len);
2058}
2059 
2060 
2061/* Same as vec::quick_grow_cleared but without reallocation of the
2062   internal vector. If the vector cannot be extended, a runtime
2063   assertion will be triggered.  */
2064 
2065template<typename T>
2066inline void
2067vec<T, va_heap, vl_ptr>::quick_grow_cleared (unsigned len)
2068{
2069  gcc_checking_assert (m_vec)((void)(!(m_vec) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 2069, __FUNCTION__), 0 : 0));
2070  m_vec->quick_grow_cleared (len);
2071}
2072 
2073 
2074/* Insert an element, OBJ, at the IXth position of this vector.  There
2075   must be sufficient space.  */
2076 
2077template<typename T>
2078inline void
2079vec<T, va_heap, vl_ptr>::quick_insert (unsigned ix, const T &obj)
2080{
2081  m_vec->quick_insert (ix, obj);
2082}
2083 
2084 
2085/* Insert an element, OBJ, at the IXth position of the vector.
2086   Reallocate the embedded vector, if necessary.  */
2087 
2088template<typename T>
2089inline void
2090vec<T, va_heap, vl_ptr>::safe_insert (unsigned ix, const T &obj MEM_STAT_DECL)
2091{
2092  reserve (1, false PASS_MEM_STAT);
2093  quick_insert (ix, obj);
2094}
2095 
2096 
2097/* Remove an element from the IXth position of this vector.  Ordering of
2098   remaining elements is preserved.  This is an O(N) operation due to
2099   a memmove.  */
2100 
2101template<typename T>
2102inline void
2103vec<T, va_heap, vl_ptr>::ordered_remove (unsigned ix)
2104{
2105  m_vec->ordered_remove (ix);
2106}
2107 
2108 
2109/* Remove an element from the IXth position of this vector.  Ordering
2110   of remaining elements is destroyed.  This is an O(1) operation.  */
2111 
2112template<typename T>
2113inline void
2114vec<T, va_heap, vl_ptr>::unordered_remove (unsigned ix)
2115{
2116  m_vec->unordered_remove (ix);
2117}
2118 
2119 
2120/* Remove LEN elements starting at the IXth.  Ordering is retained.
2121   This is an O(N) operation due to memmove.  */
2122 
2123template<typename T>
2124inline void
2125vec<T, va_heap, vl_ptr>::block_remove (unsigned ix, unsigned len)
2126{
2127  m_vec->block_remove (ix, len);
2128}
2129 
2130 
2131/* Sort the contents of this vector with qsort.  CMP is the comparison
2132   function to pass to qsort.  */
2133 
2134template<typename T>
2135inline void
2136vec<T, va_heap, vl_ptr>::qsort (int (*cmp) (const void *, const void *))qsort (int (*cmp) (const void *, const void *))
2137{
2138  if (m_vec)
2139    m_vec->qsort (cmp)qsort (cmp);
2140}
2141 
2142/* Sort the contents of this vector with qsort.  CMP is the comparison
2143   function to pass to qsort.  */
2144 
2145template<typename T>
2146inline void
2147vec<T, va_heap, vl_ptr>::sort (int (*cmp) (const void *, const void *,
2148					   void *), void *data)
2149{
2150  if (m_vec)
2151    m_vec->sort (cmp, data);
2152}
2153 
2154/* Sort the contents of this vector with gcc_stablesort_r.  CMP is the
2155   comparison function to pass to qsort.  */
2156 
2157template<typename T>
2158inline void
2159vec<T, va_heap, vl_ptr>::stablesort (int (*cmp) (const void *, const void *,
2160						 void *), void *data)
2161{
2162  if (m_vec)
2163    m_vec->stablesort (cmp, data);
2164}
2165 
2166/* Search the contents of the sorted vector with a binary search.
2167   CMP is the comparison function to pass to bsearch.  */
2168 
2169template<typename T>
2170inline T *
2171vec<T, va_heap, vl_ptr>::bsearch (const void *key,
2172				  int (*cmp) (const void *, const void *))
2173{
2174  if (m_vec)
2175    return m_vec->bsearch (key, cmp);
2176  return NULLnullptr;
2177}
2178 
2179/* Search the contents of the sorted vector with a binary search.
2180   CMP is the comparison function to pass to bsearch.  */
2181 
2182template<typename T>
2183inline T *
2184vec<T, va_heap, vl_ptr>::bsearch (const void *key,
2185				  int (*cmp) (const void *, const void *,
2186					      void *), void *data)
2187{
2188  if (m_vec)
2189    return m_vec->bsearch (key, cmp, data);
2190  return NULLnullptr;
2191}
2192 
2193 
2194/* Find and return the first position in which OBJ could be inserted
2195   without changing the ordering of this vector.  LESSTHAN is a
2196   function that returns true if the first argument is strictly less
2197   than the second.  */
2198 
2199template<typename T>
2200inline unsigned
2201vec<T, va_heap, vl_ptr>::lower_bound (T obj,
2202				      bool (*lessthan)(const T &, const T &))
2203    const
2204{
2205  return m_vec ? m_vec->lower_bound (obj, lessthan) : 0;
2206}
2207 
2208/* Return true if SEARCH is an element of V.  Note that this is O(N) in the
2209   size of the vector and so should be used with care.  */
2210 
2211template<typename T>
2212inline bool
2213vec<T, va_heap, vl_ptr>::contains (const T &search) const
2214{
2215  return m_vec ? m_vec->contains (search) : false;
2216}
2217 
2218/* Reverse content of the vector.  */
2219 
2220template<typename T>
2221inline void
2222vec<T, va_heap, vl_ptr>::reverse (void)
2223{
2224  unsigned l = length ();
2225  T *ptr = address ();
2226 
2227  for (unsigned i = 0; i < l / 2; i++)
2228    std::swap (ptr[i], ptr[l - i - 1]);
2229}
2230 
2231template<typename T>
2232inline bool
2233vec<T, va_heap, vl_ptr>::using_auto_storage () const
2234{
2235  return m_vec ? m_vec->m_vecpfx.m_using_auto_storage : false;
2236}
2237 
2238/* Release VEC and call release of all element vectors.  */
2239 
2240template<typename T>
2241inline void
2242release_vec_vec (vec<vec<T> > &vec)
2243{
2244  for (unsigned i = 0; i < vec.length (); i++)
2245    vec[i].release ();
2246 
2247  vec.release ();
2248}
2249 
2250// Provide a subset of the std::span functionality.  (We can't use std::span
2251// itself because it's a C++20 feature.)
2252//
2253// In addition, provide an invalid value that is distinct from all valid
2254// sequences (including the empty sequence).  This can be used to return
2255// failure without having to use std::optional.
2256//
2257// There is no operator bool because it would be ambiguous whether it is
2258// testing for a valid value or an empty sequence.
2259template<typename T>
2260class array_slice
2261{
2262  template<typename OtherT> friend class array_slice;
2263 
2264public:
2265  using value_type = T;
2266  using iterator = T *;
2267  using const_iterator = const T *;
2268 
2269  array_slice () : m_base (nullptr), m_size (0) {}
2270 
2271  template<typename OtherT>
2272  array_slice (array_slice<OtherT> other)
2273    : m_base (other.m_base), m_size (other.m_size) {}
2274 
2275  array_slice (iterator base, unsigned int size)
2276    : m_base (base), m_size (size) {}
2277 
2278  template<size_t N>
2279  array_slice (T (&array)[N]) : m_base (array), m_size (N) {}
2280 
2281  template<typename OtherT>
2282  array_slice (const vec<OtherT> &v)
2283    : m_base (v.address ()), m_size (v.length ()) {}
2284 
2285  template<typename OtherT>
2286  array_slice (vec<OtherT> &v)
2287    : m_base (v.address ()), m_size (v.length ()) {}
2288 
2289  template<typename OtherT>
2290  array_slice (const vec<OtherT, va_gc> *v)
2291    : m_base (v ? v->address () : nullptr), m_size (v ? v->length () : 0) {}
2292 
2293  template<typename OtherT>
2294  array_slice (vec<OtherT, va_gc> *v)
2295    : m_base (v ? v->address () : nullptr), m_size (v ? v->length () : 0) {}
2296 
2297  iterator begin () { return m_base; }
2298  iterator end () { return m_base + m_size; }
2299 
2300  const_iterator begin () const { return m_base; }
2301  const_iterator end () const { return m_base + m_size; }
2302 
2303  value_type &front ();
2304  value_type &back ();
2305  value_type &operator[] (unsigned int i);
2306 
2307  const value_type &front () const;
2308  const value_type &back () const;
2309  const value_type &operator[] (unsigned int i) const;
2310 
2311  size_t size () const { return m_size; }
2312  size_t size_bytes () const { return m_size * sizeof (T); }
2313  bool empty () const { return m_size == 0; }
2314 
2315  // An invalid array_slice that represents a failed operation.  This is
2316  // distinct from an empty slice, which is a valid result in some contexts.
2317  static array_slice invalid () { return { nullptr, ~0U }; }
2318 
2319  // True if the array is valid, false if it is an array like INVALID.
2320  bool is_valid () const { return m_base || m_size == 0; }
2321 
2322private:
2323  iterator m_base;
2324  unsigned int m_size;
2325};
2326 
2327template<typename T>
2328inline typename array_slice<T>::value_type &
2329array_slice<T>::front ()
2330{
2331  gcc_checking_assert (m_size)((void)(!(m_size) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 2331, __FUNCTION__), 0 : 0));
2332  return m_base[0];
2333}
2334 
2335template<typename T>
2336inline const typename array_slice<T>::value_type &
2337array_slice<T>::front () const
2338{
2339  gcc_checking_assert (m_size)((void)(!(m_size) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 2339, __FUNCTION__), 0 : 0));
2340  return m_base[0];
2341}
2342 
2343template<typename T>
2344inline typename array_slice<T>::value_type &
2345array_slice<T>::back ()
2346{
2347  gcc_checking_assert (m_size)((void)(!(m_size) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 2347, __FUNCTION__), 0 : 0));
2348  return m_base[m_size - 1];
2349}
2350 
2351template<typename T>
2352inline const typename array_slice<T>::value_type &
2353array_slice<T>::back () const
2354{
2355  gcc_checking_assert (m_size)((void)(!(m_size) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 2355, __FUNCTION__), 0 : 0));
2356  return m_base[m_size - 1];
2357}
2358 
2359template<typename T>
2360inline typename array_slice<T>::value_type &
2361array_slice<T>::operator[] (unsigned int i)
2362{
2363  gcc_checking_assert (i < m_size)((void)(!(i < m_size) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 2363, __FUNCTION__), 0 : 0));
2364  return m_base[i];
2365}
2366 
2367template<typename T>
2368inline const typename array_slice<T>::value_type &
2369array_slice<T>::operator[] (unsigned int i) const
2370{
2371  gcc_checking_assert (i < m_size)((void)(!(i < m_size) ? fancy_abort ("/buildworker/marxinbox-gcc-clang-static-analyzer/build/gcc/vec.h"
, 2371, __FUNCTION__), 0 : 0));
2372  return m_base[i];
2373}
2374 
2375template<typename T>
2376array_slice<T>
2377make_array_slice (T *base, unsigned int size)
2378{
2379  return array_slice<T> (base, size);
2380}
2381 
2382#if (GCC_VERSION(4 * 1000 + 2) >= 3000)
2383# pragma GCC poison m_vec m_vecpfx m_vecdata
2384#endif
2385 
2386#endif // GCC_VEC_H