* 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
+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.
#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. */
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
static void
output_gcov_string (string, delimiter)
- char *string;
+ const char *string;
long delimiter;
{
long temp;
/* 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;
{
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
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;
{
/* 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;
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));
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 *));
\f
/* Allocate an rtx vector of N elements.
Store the length, and initialize all elements to zero. */
#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
/* 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;
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
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;
{
/* 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.
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));
\f
static enum in_section { no_section, in_text, in_data, in_named
#ifdef BSS_SECTION_ASM_OP
tree decl;
char * name;
int size;
- int rounded;
+ int rounded ATTRIBUTE_UNUSED;
{
enum {
asm_dest_common,
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;