calls.c (expand_call): Initialize "src" and "dest".
authorJeffrey A Law <law@cygnus.com>
Sat, 20 Jun 1998 00:35:42 +0000 (00:35 +0000)
committerJeff Law <law@gcc.gnu.org>
Sat, 20 Jun 1998 00:35:42 +0000 (18:35 -0600)
        * 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
gcc/calls.c
gcc/expmed.c
gcc/gcse.c
gcc/jump.c
gcc/stmt.c
gcc/tree.c

index ae7e45c49b3a5e7437119961fe762e905a8b1de6..c626e8f381dac5b781cdfbc0dad4b51d3746874f 100644 (file)
@@ -1,5 +1,12 @@
 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.
 
index 8133cc0f58a59ab0e9e67724f82a161ba3c56fac..6271a611a8c643f481ec9ca24983503d5548ef02 100644 (file)
@@ -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;
       
index e81eb0a1b0183a1952887663c2c269a37fc8500c..d952d1b0ab82e341369733e3423e6789e966f019 100644 (file)
@@ -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
index eca12422c8901183ed4352b5e729b8a795d32744..bcabf3e52ec019b00d69b7ded0143a49e70def94 100644 (file)
@@ -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;
index 36f9e783175d95b584cc8da93a8e20ba17c08b35..273d31d662cde5e17faf7bd08b4a6c3946795391 100644 (file)
@@ -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
index fc8c382d958fcac46f372c92d9a05eaf6b515900..138783b47b6ed8f492279bbdf44be1fcf0de6d06 100644 (file)
@@ -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;
 
index 75e1e1f533c30a0c6ffa1be41c3be9ff7daca6a0..baf4551cadda32f55fd0fb2e227fcf58aa152499 100644 (file)
@@ -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