/* Allocation for dataflow support routines.
- Copyright (C) 1999-2020 Free Software Foundation, Inc.
+ Copyright (C) 1999-2021 Free Software Foundation, Inc.
Originally contributed by Michael P. Hayes
(m.hayes@elec.canterbury.ac.nz, mhayes@redhat.com)
Major rewrite contributed by Danny Berlin (dberlin@dberlin.org)
vec<int> last_change_age = vNULL;
int prev_age;
- last_visit_age.safe_grow_cleared (n_blocks);
- last_change_age.safe_grow_cleared (n_blocks);
+ last_visit_age.safe_grow_cleared (n_blocks, true);
+ last_change_age.safe_grow_cleared (n_blocks, true);
/* Double-queueing. Worklist is for the current iteration,
and pending is for the next. */
" n_basic_blocks %d n_edges %d"
" count %d (%5.2g)\n",
n_basic_blocks_for_fn (cfun), n_edges_for_fn (cfun),
- dcount, dcount / (float)n_basic_blocks_for_fn (cfun));
+ dcount, dcount / (double)n_basic_blocks_for_fn (cfun));
}
/* Worklist-based dataflow solver. It uses sbitmap as a worklist,