Warning fixes:

        * loop.c (insert_bct): Hide the definition of variables
        `increment_direction', `compare_direction', `add_iteration' and
        `loop_var_mode'.
        * recog.c (mode_dependent_address_p): Mark parameter `addr' with
        ATTRIBUTE_UNUSED.  Mark label `win' with ATTRIBUTE_UNUSED_LABEL.
        (mode_independent_operand): Mark label `lose' with
        ATTRIBUTE_UNUSED_LABEL.
        * regclass.c (n_occurrences): Remove prototype and definition.
        * reload.c (find_reloads_address_1): Mark variable `tem' with
        ATTRIBUTE_UNUSED.
        * reload1.c (reload): Cast the first two arguments of `bcopy' to PTR.
        * sbitmap.c (sbitmap_copy): Likewise.
        * scan-decls.c (scan_decls): Hide label `handle_comma'.
        * toplev.c (output_lang_identify): Mark prototype with
        ATTRIBUTE_UNUSED.
        * tree.c (make_node): Cast the first argument of `bzero' to PTR.
        (make_tree_vec): Likewise.
        (build1): Likewise.
        * varasm.c (assemble_static_space): Mark variable `tem' with
        ATTRIBUTE_UNUSED.

From-SVN: r24740

1 files changed, 3 insertions, 3 deletions

diff --git a/gcc/tree.c b/gcc/tree.c
index 053420c..f7db3c4 100644
--- a/gcc/tree.c
+++ b/gcc/tree.c
@@ -1070,7 +1070,7 @@ make_node (code)
     }
 
   t = (tree) obstack_alloc (obstack, length);
-  bzero (t, length);
+  bzero ((PTR) t, length);
 
 #ifdef GATHER_STATISTICS
   tree_node_counts[(int)kind]++;
@@ -1551,7 +1551,7 @@ make_tree_vec (len)
 #endif
 
   t = (tree) obstack_alloc (obstack, length);
-  bzero (t, length);
+  bzero ((PTR) t, length);
 
   TREE_SET_CODE (t, TREE_VEC);
   TREE_VEC_LENGTH (t) = len;
@@ -3058,7 +3058,7 @@ build1 (code, type, node)
   length = sizeof (struct tree_exp);
 
   t = (tree) obstack_alloc (obstack, length);
-  bzero (t, length);
+  bzero ((PTR) t, length);
 
 #ifdef GATHER_STATISTICS
   tree_node_counts[(int)kind]++;