diff options
| author | bje <bje@138bc75d-0d04-0410-961f-82ee72b054a4> | 2005-07-19 04:08:32 +0000 |
|---|---|---|
| committer | bje <bje@138bc75d-0d04-0410-961f-82ee72b054a4> | 2005-07-19 04:08:32 +0000 |
| commit | 86c1585a0b5021e5010158be36933f5e13bd955e (patch) | |
| tree | 6dbb8cbe0b281c1de8f2264e4a111ada8e550d69 /gcc/ddg.c | |
| parent | 28982d9410803f5885d6ae4dbd16e1562b21abd2 (diff) | |
| download | gcc-86c1585a0b5021e5010158be36933f5e13bd955e.tar.gz | |
* 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.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@102151 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/ddg.c')
| -rw-r--r-- | gcc/ddg.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/ddg.c b/gcc/ddg.c index d098181d846..6bb3d6c374d 100644 --- a/gcc/ddg.c +++ b/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; |