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

gcc/ChangeLog

+2005-07-22  Manfred Hollstein  <mh@suse.com>
+
+	* tree-ssa-structalias.c (merge_graph_nodes): Fix uninitialised
+	warnings.
+	(int_add_graph_edge): Likewise.
+	(collapse_nodes): Likewise.
+	(process_unification_queue): Likewise.
+
 2005-07-22  Richard Kenner  <kenner@vlsi1.ultra.nyu.edu>
             Laurent GUERBY  <laurent@guerby.net>
 

gcc/cp/ChangeLog

+2005-07-22  Manfred Hollstein  <mh@suse.com>
+
+	* parser.c (cp_parser_declaration): Fix unitialised warnings.
+
 2005-07-21  Andrew Pinski  <pinskia@physics.uc.edu>
 
 	* class.c (build_base_path): Fix typo.

gcc/cp/parser.c

@@ -6919,6 +6919,8 @@ cp_parser_declaration (cp_parser* parser)
 
   if (token1.type != CPP_EOF)
     token2 = *cp_lexer_peek_nth_token (parser->lexer, 2);
+  else
+    token2.type = token2.keyword = RID_MAX;
 
   /* Get the high-water mark for the DECLARATOR_OBSTACK.  */
   p = obstack_alloc (&declarator_obstack, 0);

gcc/fortran/ChangeLog

+2005-07-22  Manfred Hollstein  <mh@suse.com>
+
+	* match.c (gfc_match_symbol): Fix uninitialised warnings.
+	* matchexp.c (gfc_match_expr): Likewise.
+
 2005-07-20  Giovanni Bajo  <giovannibajo@libero.it>
 
 	Make CONSTRUCTOR use VEC to store initializers.

gcc/fortran/match.c

@@ -447,6 +447,8 @@ gfc_match_symbol (gfc_symbol ** matched_symbol, int host_assoc)
       else
         *matched_symbol = NULL;
     }
+  else
+    *matched_symbol = NULL;
   return m;
 }
 

gcc/fortran/matchexp.c

@@ -852,6 +852,7 @@ gfc_match_expr (gfc_expr ** result)
 
   for (;;)
     {
+      uop = NULL;
       m = match_defined_operator (&uop);
       if (m == MATCH_NO)
 	break;

gcc/java/ChangeLog

+2005-07-22  Manfred Hollstein  <mh@suse.com>
+
+	* verify-impl.c (check_class_constant): Fix uninitialised warnings.
+	(check_constant): Likewise.
+	(check_wide_constant): Likewise.
+
 2005-07-20  Giovanni Bajo  <giovannibajo@libero.it>
 
 	Make CONSTRUCTOR use VEC to store initializers.

gcc/java/verify-impl.c

@@ -1946,7 +1946,7 @@ check_pool_index (int index)
 static type
 check_class_constant (int index)
 {
-  type t;
+  type t = { 0, 0, 0 };
   vfy_constants *pool;
 
   check_pool_index (index);
@@ -1963,7 +1963,7 @@ check_class_constant (int index)
 static type
 check_constant (int index)
 {
-  type t;
+  type t = { 0, 0, 0 };
   vfy_constants *pool;
 
   check_pool_index (index);
@@ -1983,7 +1983,7 @@ check_constant (int index)
 static type
 check_wide_constant (int index)
 {
-  type t;
+  type t = { 0, 0, 0 };
   vfy_constants *pool;
 
   check_pool_index (index);

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);