aboutsummaryrefslogtreecommitdiff
path: root/gcc/tree-ssa-structalias.c
diff options
context:
space:
mode:
authorManfred Hollstein <mh@suse.com>2005-07-22 07:31:32 +0000
committerManfred Hollstein <manfred@gcc.gnu.org>2005-07-22 07:31:32 +0000
commit32cafd7366917d37360844b42b73ffc6af881bb0 (patch)
treecb073ef49c05b064e1e54eeefa318120ca913ed7 /gcc/tree-ssa-structalias.c
parentee184c4def9632d74193f291f94244c6dac220d5 (diff)
downloadgcc-32cafd7366917d37360844b42b73ffc6af881bb0.zip
gcc-32cafd7366917d37360844b42b73ffc6af881bb0.tar.gz
gcc-32cafd7366917d37360844b42b73ffc6af881bb0.tar.bz2
tree-ssa-structalias.c (merge_graph_nodes): Fix uninitialised warnings.
gcc/ChangeLog: * tree-ssa-structalias.c (merge_graph_nodes): Fix uninitialised warnings. (int_add_graph_edge): Likewise. (collapse_nodes): Likewise. (process_unification_queue): Likewise. gcc/cp/ChangeLog: * parser.c (cp_parser_declaration): Fix unitialised warnings. gcc/fortran/ChangeLog: * match.c (gfc_match_symbol): Fix uninitialised warnings. * matchexp.c (gfc_match_expr): Likewise. gcc/java/ChangeLog: * verify-impl.c (check_class_constant): Fix uninitialised warnings. (check_constant): Likewise. (check_wide_constant): Likewise. From-SVN: r102273
Diffstat (limited to 'gcc/tree-ssa-structalias.c')
-rw-r--r--gcc/tree-ssa-structalias.c5
1 files changed, 5 insertions, 0 deletions
diff --git a/gcc/tree-ssa-structalias.c b/gcc/tree-ssa-structalias.c
index f715ce7..867c6a7 100644
--- a/gcc/tree-ssa-structalias.c
+++ b/gcc/tree-ssa-structalias.c
@@ -897,6 +897,7 @@ merge_graph_nodes (constraint_graph_t graph, unsigned int to,
add_graph_edge (graph, newe);
olde.src = from;
olde.dest = c->dest;
+ olde.weights = NULL;
temp = get_graph_weights (graph, olde);
weights = get_graph_weights (graph, newe);
bitmap_ior_into (weights, temp);
@@ -917,6 +918,7 @@ merge_graph_nodes (constraint_graph_t graph, unsigned int to,
add_graph_edge (graph, newe);
olde.src = c->dest;
olde.dest = from;
+ olde.weights = NULL;
temp = get_graph_weights (graph, olde);
weights = get_graph_weights (graph, newe);
bitmap_ior_into (weights, temp);
@@ -942,6 +944,7 @@ int_add_graph_edge (constraint_graph_t graph, unsigned int to,
struct constraint_edge edge;
edge.src = to;
edge.dest = from;
+ edge.weights = NULL;
r = add_graph_edge (graph, edge);
r |= !bitmap_bit_p (get_graph_weights (graph, edge), weight);
bitmap_set_bit (get_graph_weights (graph, edge), weight);
@@ -1113,6 +1116,7 @@ collapse_nodes (constraint_graph_t graph, unsigned int to, unsigned int from)
merge_graph_nodes (graph, to, from);
edge.src = to;
edge.dest = to;
+ edge.weights = NULL;
if (valid_graph_edge (graph, edge))
{
bitmap weights = get_graph_weights (graph, edge);
@@ -1216,6 +1220,7 @@ process_unification_queue (constraint_graph_t graph, struct scc_info *si,
bitmap_clear (tmp);
edge.src = n;
edge.dest = n;
+ edge.weights = NULL;
if (valid_graph_edge (graph, edge))
{
bitmap weights = get_graph_weights (graph, edge);