Skip to content

R
riscv-gcc-1
Commit dfea6c85 by Ben Elliston Committed by Ben Elliston
Options

bt-load.c (link_btr_uses): Fix uninitialised warnings. 

	* bt-load.c (link_btr_uses): Fix uninitialised warnings.
	* cfganal.c (find_edge_index): Ditto.
	* combine.c (combine_instructions): Ditto.
	* ddg.c (create_scc): Ditto.
	(find_successors): Ditto.
	(find_predecessors): Ditto.
	(find_nodes_on_paths): Ditto.
	(longest_simple_path): Ditto.
	* flow.c (update_life_info): Ditto.
	(count_or_remove_death_notes): Ditto.
	(clear_log_links): Ditto.
	* modulo-sched.c (generate_reg_moves): Ditto.
	(find_max_asap): Ditto.
	(find_max_hv_min_mob): Ditto.
	(find_max_dv_min_mob): Ditto.
	* sbitmap.c (sbitmap_first_set_bit): Ditto.
	* sched-rgn.c (extract_edgelst): Ditto.
	* tree-into-ssa.c (prepare_names_to_update): Ditto.
	(dump_update_ssa): Ditto.
	(ssa_names_to_replace) Ditto.
	(switch_virtuals_to_full_rewrite): Ditto.
	(update_ssa): Ditto.
	* tree-vect-transform.c (vect_create_epilog_for_reduction): Ditto.

From-SVN: r102151
parent b9d33488
Showing with 49 additions and 24 deletions
gcc/ChangeLog
2005-07-19 Ben Elliston <bje@au.ibm.com>
* bt-load.c (link_btr_uses): Fix uninitialised warnings.
* cfganal.c (find_edge_index): Ditto.
* combine.c (combine_instructions): Ditto.
* ddg.c (create_scc): Ditto.
(find_successors): Ditto.
(find_predecessors): Ditto.
(find_nodes_on_paths): Ditto.
(longest_simple_path): Ditto.
* flow.c (update_life_info): Ditto.
(count_or_remove_death_notes): Ditto.
(clear_log_links): Ditto.
* modulo-sched.c (generate_reg_moves): Ditto.
(find_max_asap): Ditto.
(find_max_hv_min_mob): Ditto.
(find_max_dv_min_mob): Ditto.
* sbitmap.c (sbitmap_first_set_bit): Ditto.
* sched-rgn.c (extract_edgelst): Ditto.
* tree-into-ssa.c (prepare_names_to_update): Ditto.
(dump_update_ssa): Ditto.
(ssa_names_to_replace) Ditto.
(switch_virtuals_to_full_rewrite): Ditto.
(update_ssa): Ditto.
* tree-vect-transform.c (vect_create_epilog_for_reduction): Ditto.
2005-07-18 Daniel Berlin <dberlin@dberlin.org>
Fix PR tree-optimization/22483
......@@ -140,7 +166,6 @@
statics are not marked as clobbered if the call does not clobber
them.
2005-07-16 Daniel Berlin <dberlin@dberlin.org>
* tree-ssa-structalias.c (need_to_solve): Need to check for preds,
......
gcc/bt-load.c
......@@ -701,7 +701,7 @@ link_btr_uses (btr_def *def_array, btr_user *use_array, sbitmap *bb_out,
{
/* Find all the reaching defs for this use. */
sbitmap reaching_defs_of_reg = sbitmap_alloc(max_uid);
unsigned int uid;
unsigned int uid = 0;
sbitmap_iterator sbi;
if (user->use)
......
gcc/cfganal.c
......@@ -521,7 +521,7 @@ find_edge_index (struct edge_list *edge_list, basic_block pred, basic_block succ
void
flow_nodes_print (const char *str, const sbitmap nodes, FILE *file)
{
unsigned int node;
unsigned int node = 0;
sbitmap_iterator sbi;
if (! nodes)
......
gcc/combine.c
......@@ -641,7 +641,7 @@ combine_instructions (rtx f, unsigned int nregs)
rtx prev;
#endif
int i;
unsigned int j;
unsigned int j = 0;
rtx links, nextlinks;
sbitmap_iterator sbi;
......
gcc/ddg.c
......@@ -692,7 +692,7 @@ static ddg_scc_ptr
create_scc (ddg_ptr g, sbitmap nodes)
{
ddg_scc_ptr scc;
unsigned int u;
unsigned int u = 0;
sbitmap_iterator sbi;
scc = (ddg_scc_ptr) xmalloc (sizeof (struct ddg_scc));
......@@ -783,7 +783,7 @@ get_node_of_insn (ddg_ptr g, rtx insn)
void
find_successors (sbitmap succ, ddg_ptr g, sbitmap ops)
{
unsigned int i;
unsigned int i = 0;
sbitmap_iterator sbi;
EXECUTE_IF_SET_IN_SBITMAP (ops, 0, i, sbi)
......@@ -802,7 +802,7 @@ find_successors (sbitmap succ, ddg_ptr g, sbitmap ops)
void
find_predecessors (sbitmap preds, ddg_ptr g, sbitmap ops)
{
unsigned int i;
unsigned int i = 0;
sbitmap_iterator sbi;
EXECUTE_IF_SET_IN_SBITMAP (ops, 0, i, sbi)
......@@ -905,7 +905,7 @@ find_nodes_on_paths (sbitmap result, ddg_ptr g, sbitmap from, sbitmap to)
{
int answer;
int change;
unsigned int u;
unsigned int u = 0;
int num_nodes = g->num_nodes;
sbitmap_iterator sbi;
......@@ -1015,7 +1015,7 @@ int
longest_simple_path (struct ddg * g, int src, int dest, sbitmap nodes)
{
int i;
unsigned int u;
unsigned int u = 0;
int change = 1;
int result;
int num_nodes = g->num_nodes;
......
gcc/flow.c
......@@ -572,7 +572,7 @@ update_life_info (sbitmap blocks, enum update_life_extent extent,
int prop_flags)
{
regset tmp;
unsigned i;
unsigned i = 0;
int stabilized_prop_flags = prop_flags;
basic_block bb;
......@@ -4383,7 +4383,7 @@ int
count_or_remove_death_notes (sbitmap blocks, int kill)
{
int count = 0;
unsigned int i;
unsigned int i = 0;
basic_block bb;
/* This used to be a loop over all the blocks with a membership test
......@@ -4489,7 +4489,7 @@ clear_log_links (sbitmap blocks)
}
else
{
unsigned int i;
unsigned int i = 0;
sbitmap_iterator sbi;
EXECUTE_IF_SET_IN_SBITMAP (blocks, 0, i, sbi)
......
gcc/modulo-sched.c
......@@ -501,7 +501,7 @@ generate_reg_moves (partial_schedule_ptr ps)
for (i_reg_move = 0; i_reg_move < nreg_moves; i_reg_move++)
{
unsigned int i_use;
unsigned int i_use = 0;
rtx new_reg = gen_reg_rtx (GET_MODE (prev_reg));
rtx reg_move = gen_move_insn (new_reg, prev_reg);
sbitmap_iterator sbi;
......@@ -1845,7 +1845,7 @@ calculate_order_params (ddg_ptr g, int mii ATTRIBUTE_UNUSED)
static int
find_max_asap (ddg_ptr g, sbitmap nodes)
{
unsigned int u;
unsigned int u = 0;
int max_asap = -1;
int result = -1;
sbitmap_iterator sbi;
......@@ -1866,7 +1866,7 @@ find_max_asap (ddg_ptr g, sbitmap nodes)
static int
find_max_hv_min_mob (ddg_ptr g, sbitmap nodes)
{
unsigned int u;
unsigned int u = 0;
int max_hv = -1;
int min_mob = INT_MAX;
int result = -1;
......@@ -1895,7 +1895,7 @@ find_max_hv_min_mob (ddg_ptr g, sbitmap nodes)
static int
find_max_dv_min_mob (ddg_ptr g, sbitmap nodes)
{
unsigned int u;
unsigned int u = 0;
int max_dv = -1;
int min_mob = INT_MAX;
int result = -1;
......
gcc/sbitmap.c
......@@ -690,7 +690,7 @@ sbitmap_union_of_preds (sbitmap dst, sbitmap *src, int bb)
int
sbitmap_first_set_bit (sbitmap bmap)
{
unsigned int n;
unsigned int n = 0;
sbitmap_iterator sbi;
EXECUTE_IF_SET_IN_SBITMAP (bmap, 0, n, sbi)
......
gcc/sched-rgn.c
......@@ -353,7 +353,7 @@ is_cfg_nonregular (void)
static void
extract_edgelst (sbitmap set, edgelst *el)
{
unsigned int i;
unsigned int i = 0;
sbitmap_iterator sbi;
/* edgelst table space is reused in each call to extract_edgelst. */
......
gcc/tree-into-ssa.c
......@@ -2031,7 +2031,7 @@ prepare_def_site_for (tree name, bitmap blocks, bool insert_phi_p)
static void
prepare_names_to_update (bitmap blocks, bool insert_phi_p)
{
unsigned i;
unsigned i = 0;
bitmap_iterator bi;
sbitmap_iterator sbi;
......@@ -2098,7 +2098,7 @@ debug_names_replaced_by (tree name)
void
dump_update_ssa (FILE *file)
{
unsigned i;
unsigned i = 0;
bitmap_iterator bi;
if (!need_ssa_update_p ())
......@@ -2347,7 +2347,7 @@ name_registered_for_update_p (tree n)
bitmap
ssa_names_to_replace (void)
{
unsigned i;
unsigned i = 0;
bitmap ret;
sbitmap_iterator sbi;
......@@ -2519,7 +2519,7 @@ switch_virtuals_to_full_rewrite_p (void)
static void
switch_virtuals_to_full_rewrite (void)
{
unsigned i;
unsigned i = 0;
sbitmap_iterator sbi;
if (dump_file)
......@@ -2618,7 +2618,7 @@ update_ssa (unsigned update_flags)
bitmap blocks;
basic_block bb, start_bb;
bitmap_iterator bi;
unsigned i;
unsigned i = 0;
sbitmap tmp;
bool insert_phi_p;
sbitmap_iterator sbi;
......
gcc/tree-vect-transform.c
......@@ -924,7 +924,7 @@ vect_create_epilog_for_reduction (tree vect_def, tree stmt, tree reduction_op,
}
else
{
enum tree_code shift_code;
enum tree_code shift_code = 0;
bool have_whole_vector_shift = true;
enum tree_code code = TREE_CODE (TREE_OPERAND (stmt, 1)); /* CHECKME */
int bit_offset;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment