calls.c (expand_call): Initialize "src" and "dest".

        * calls.c (expand_call): Initialize "src" and "dest".
        * stmt.c (expand_return): Likewise.
        * expmed.c (extract_split_bit_field): Similarly for "result"
        * gcse.c (compute_hash_table): Mark first arg as unused.
        * jump.c (jump_optimize): Initialize reversep.
        * tree.c (make_node): Initialize length.

From-SVN: r20629

gcc/ChangeLog

 Sat Jun 20 00:36:16 1998  Jeffrey A Law  (law@cygnus.com)
 
+	* calls.c (expand_call): Initialize "src" and "dest".
+	* stmt.c (expand_return): Likewise.
+	* expmed.c (extract_split_bit_field): Similarly for "result"
+	* gcse.c (compute_hash_table): Mark first arg as unused.
+	* jump.c (jump_optimize): Initialize reversep.
+	* tree.c (make_node): Initialize length.
+
 	* c-common.c (check_format_info): Initialize length_char and
 	fci to keep -Wall quiet.
 

gcc/calls.c

@@ -2116,7 +2116,7 @@ expand_call (exp, target, ignore)
 	 Deal with them explicitly by copying from the return registers
 	 into the target MEM locations.  */
       int bytes = int_size_in_bytes (TREE_TYPE (exp));
-      rtx src, dst;
+      rtx src = NULL, dst = NULL;
       int bitsize = MIN (TYPE_ALIGN (TREE_TYPE (exp)), BITS_PER_WORD);
       int bitpos, xbitpos, big_endian_correction = 0;
       

gcc/expmed.c

@@ -1614,7 +1614,7 @@ extract_split_bit_field (op0, bitsize, bitpos, unsignedp, align)
 {
   int unit;
   int bitsdone = 0;
-  rtx result;
+  rtx result = NULL_RTX;
   int first = 1;
 
   /* Make sure UNIT isn't larger than BITS_PER_WORD, we can only handle that

gcc/gcse.c

@@ -2011,7 +2011,7 @@ record_last_set_info (dest, setter)
 
 static void
 compute_hash_table (f, set_p)
-     rtx f;
+     rtx f ATTRIBUTE_UNUSED;
      int set_p;
 {
   int bb;

gcc/jump.c

@@ -598,7 +598,7 @@ jump_optimize (f, cross_jump, noop_moves, after_regscan)
 	  rtx reallabelprev;
 	  rtx temp, temp1, temp2, temp3, temp4, temp5, temp6;
 	  rtx nlabel;
-	  int this_is_simplejump, this_is_condjump, reversep;
+	  int this_is_simplejump, this_is_condjump, reversep = 0;
 	  int this_is_condjump_in_parallel;
 #if 0
 	  /* If NOT the first iteration, if this is the last jump pass

gcc/stmt.c

@@ -2452,7 +2452,7 @@ expand_return (retval)
       int n_regs = (bytes + UNITS_PER_WORD - 1) / UNITS_PER_WORD;
       int bitsize = MIN (TYPE_ALIGN (TREE_TYPE (retval_rhs)),BITS_PER_WORD);
       rtx *result_pseudos = (rtx *) alloca (sizeof (rtx) * n_regs);
-      rtx result_reg, src, dst;
+      rtx result_reg, src = NULL_RTX, dst = NULL_RTX;
       rtx result_val = expand_expr (retval_rhs, NULL_RTX, VOIDmode, 0);
       enum machine_mode tmpmode, result_reg_mode;
 

gcc/tree.c

@@ -936,7 +936,7 @@ make_node (code)
 {
   register tree t;
   register int type = TREE_CODE_CLASS (code);
-  register int length;
+  register int length = 0;
   register struct obstack *obstack = current_obstack;
   register int i;
 #ifdef GATHER_STATISTICS