print-tree.c (print_node, indent_to): Remove redundant prototypes.

	* print-tree.c (print_node, indent_to): Remove redundant prototypes.

	* profile.c (instrument_arcs, output_gcov_string,
	tablejump_entry_p): Add static prototypes.
	(output_gcov_string): Constify a char*.

	* regmove.c (replacement_quality, fixup_match_2): Add static
	prototypes.

	* resource.h (reg_dead_p): Add extern prototype.

	* rtl.c (trim_filename): Add static prototype.

	* scan-decls.c (skip_to_closing_brace): Likewise.

	* stmt.c (expand_decl_cleanup_no_eh): Hide definition.
	(expand_end_case): Initialize variable `range'.
	(emit_case_nodes): Remove unused prototype `rtx_fn'.

	* varasm.c (asm_emit_uninitialised): Add static prototype.
	(asm_emit_uninitialised, assemble_variable): Mark parameter with
	ATTRIBUTE_UNUSED.

From-SVN: r29784

9 files changed, 44 insertions, 11 deletions

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 7b90910..267ad93 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,28 @@
+Sun Oct  3 12:44:05 1999  Kaveh R. Ghazi  <ghazi@caip.rutgers.edu>
+
+	* print-tree.c (print_node, indent_to): Remove redundant prototypes.
+
+	* profile.c (instrument_arcs, output_gcov_string,
+	tablejump_entry_p): Add static prototypes.
+	(output_gcov_string): Constify a char*.
+	
+	* regmove.c (replacement_quality, fixup_match_2): Add static
+	prototypes.
+
+	* resource.h (reg_dead_p): Add extern prototype.
+
+	* rtl.c (trim_filename): Add static prototype.
+
+	* scan-decls.c (skip_to_closing_brace): Likewise.
+
+	* stmt.c (expand_decl_cleanup_no_eh): Hide definition.
+	(expand_end_case): Initialize variable `range'.
+	(emit_case_nodes): Remove unused prototype `rtx_fn'.
+
+	* varasm.c (asm_emit_uninitialised): Add static prototype.
+	(asm_emit_uninitialised, assemble_variable): Mark parameter with
+	ATTRIBUTE_UNUSED.
+
 Sun Oct  3 12:24:52 1999  Kaveh R. Ghazi  <ghazi@caip.rutgers.edu>
 
 	* cpplib.c (if_directive_nameo): Add static prototype.
diff --git a/gcc/print-tree.c b/gcc/print-tree.c
index df65337..51e2ce9 100644
--- a/gcc/print-tree.c
+++ b/gcc/print-tree.c
@@ -24,9 +24,6 @@ Boston, MA 02111-1307, USA.  */
 #include "tree.h"
 #include "ggc.h"
 
-void print_node ();
-void indent_to ();
-
 /* Define the hash table of nodes already seen.
    Such nodes are not repeated; brief cross-references are used.  */
 
diff --git a/gcc/profile.c b/gcc/profile.c
index 9e7cece..c45818b 100644
--- a/gcc/profile.c
+++ b/gcc/profile.c
@@ -157,6 +157,9 @@ static void expand_spanning_tree PROTO((int));
 static void fill_spanning_tree PROTO((int));
 static void init_arc_profiler PROTO((void));
 static void output_arc_profiler PROTO((int, rtx));
+static void instrument_arcs PROTO((rtx, int, FILE *));
+static void output_gcov_string PROTO((const char *, long));
+static int tablejump_entry_p PROTO((rtx, rtx));
 
 #ifndef LONG_TYPE_SIZE
 #define LONG_TYPE_SIZE BITS_PER_WORD
@@ -388,7 +391,7 @@ instrument_arcs (f, num_blocks, dump_file)
 
 static void
 output_gcov_string (string, delimiter)
-     char *string;
+     const char *string;
      long delimiter;
 {
   long temp;
@@ -418,7 +421,7 @@ output_gcov_string (string, delimiter)
 /* Return TRUE if this insn must be a tablejump entry insn.  This works for
    the MIPS port, but may give false negatives for some targets.  */
 
-int
+static int
 tablejump_entry_p (insn, label)
      rtx insn, label;
 {
diff --git a/gcc/regmove.c b/gcc/regmove.c
index 98e2d13..98061afa 100644
--- a/gcc/regmove.c
+++ b/gcc/regmove.c
@@ -66,6 +66,8 @@ static int fixup_match_1 PROTO((rtx, rtx, rtx, rtx, rtx, int, int, int, FILE *))
 static int reg_is_remote_constant_p PROTO((rtx, rtx, rtx));
 static int stable_and_no_regs_but_for_p PROTO((rtx, rtx, rtx));
 static int regclass_compatible_p PROTO((int, int));
+static int replacement_quality PROTO((rtx));
+static int fixup_match_2 PROTO((rtx, rtx, rtx, rtx, FILE *));
 static int loop_depth;
 
 /* Return non-zero if registers with CLASS1 and CLASS2 can be merged without
@@ -335,7 +337,7 @@ static int *regno_src_regno;
    the choice.  The main objective is to avoid using a register that is
    a candidate for tying to a hard register, since the output might in
    turn be a candidate to be tied to a different hard register.  */
-int
+static int
 replacement_quality(reg)
      rtx reg;
 {
@@ -938,7 +940,7 @@ reg_is_remote_constant_p (reg, insn, first)
 /* cse disrupts preincrement / postdecrement squences when it finds a
    hard register as ultimate source, like the frame pointer.  */
 
-int
+static int
 fixup_match_2 (insn, dst, src, offset, regmove_dump_file)
      rtx insn, dst, src, offset;
      FILE *regmove_dump_file;
diff --git a/gcc/resource.h b/gcc/resource.h
index 49f3c4f..a867bae 100644
--- a/gcc/resource.h
+++ b/gcc/resource.h
@@ -44,3 +44,4 @@ extern void init_resource_info		PROTO((rtx));
 extern void free_resource_info		PROTO((void));
 extern rtx find_free_register		PROTO((rtx, rtx, char *, int,
 					       HARD_REG_SET *));
+extern int reg_dead_p			PROTO((rtx, rtx));
diff --git a/gcc/rtl.c b/gcc/rtl.c
index 011c440..495512e 100644
--- a/gcc/rtl.c
+++ b/gcc/rtl.c
@@ -261,6 +261,7 @@ const char * const reg_note_name[] = { "", "REG_DEAD", "REG_INC", "REG_EQUIV", "
 
 static void dump_and_abort	PROTO((int, int, FILE *)) ATTRIBUTE_NORETURN;
 static void read_name		PROTO((char *, FILE *));
+static const char *trim_filename PROTO((const char *));
 
 /* Allocate an rtx vector of N elements.
    Store the length, and initialize all elements to zero.  */
diff --git a/gcc/scan-decls.c b/gcc/scan-decls.c
index 5fea643..3dafd34 100644
--- a/gcc/scan-decls.c
+++ b/gcc/scan-decls.c
@@ -22,6 +22,8 @@ Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 #include "cpplib.h"
 #include "scan.h"
 
+static void skip_to_closing_brace PARAMS ((cpp_reader *));
+
 int brace_nesting = 0;
 
 /* The first extern_C_braces_length elements of extern_C_braces
diff --git a/gcc/stmt.c b/gcc/stmt.c
index 265f365..9d67502 100644
--- a/gcc/stmt.c
+++ b/gcc/stmt.c
@@ -4052,6 +4052,7 @@ expand_decl_cleanup (decl, cleanup)
 /* Like expand_decl_cleanup, but suppress generating an exception handler
    to perform the cleanup.  */
 
+#if 0
 int
 expand_decl_cleanup_no_eh (decl, cleanup)
      tree decl, cleanup;
@@ -4065,6 +4066,7 @@ expand_decl_cleanup_no_eh (decl, cleanup)
 
   return result;
 }
+#endif
 
 /* Arrange for the top element of the dynamic cleanup chain to be
    popped if we exit the current binding contour.  DECL is the
@@ -5235,7 +5237,7 @@ void
 expand_end_case (orig_index)
      tree orig_index;
 {
-  tree minval = NULL_TREE, maxval = NULL_TREE, range, orig_minval;
+  tree minval = NULL_TREE, maxval = NULL_TREE, range = NULL_TREE, orig_minval;
   rtx default_label = 0;
   register struct case_node *n;
   unsigned int count;
@@ -6065,7 +6067,6 @@ emit_case_nodes (index, node, default_label, index_type)
 {
   /* If INDEX has an unsigned type, we must make unsigned branches.  */
   int unsignedp = TREE_UNSIGNED (index_type);
-  typedef rtx rtx_fn ();
   enum machine_mode mode = GET_MODE (index);
 
   /* See if our parents have already tested everything for us.
diff --git a/gcc/varasm.c b/gcc/varasm.c
index 0f9d36a..9eb92bc 100644
--- a/gcc/varasm.c
+++ b/gcc/varasm.c
@@ -191,6 +191,7 @@ static void asm_output_aligned_bss	PROTO((FILE *, tree, char *, int, int));
 static void mark_pool_constant          PROTO((struct pool_constant *));
 static void mark_pool_sym_hash_table	PROTO((struct pool_sym **));
 static void mark_const_hash_entry	PROTO((void *));
+static void asm_emit_uninitialised	PROTO((tree, char *, int, int));
 
 static enum in_section { no_section, in_text, in_data, in_named
 #ifdef BSS_SECTION_ASM_OP
@@ -1240,7 +1241,7 @@ asm_emit_uninitialised (decl, name, size, rounded)
      tree decl;
      char * name;
      int size;
-     int rounded;
+     int rounded ATTRIBUTE_UNUSED;
 {
   enum {
     asm_dest_common,
@@ -1317,7 +1318,7 @@ void
 assemble_variable (decl, top_level, at_end, dont_output_data)
      tree decl;
      int top_level ATTRIBUTE_UNUSED;
-     int at_end;
+     int at_end ATTRIBUTE_UNUSED;
      int dont_output_data;
 {
   register char *name;