/* Process an option that can accept a `no-' form.
Return 1 if option found, 0 otherwise. */
static int
-process_option_with_no (p, table, table_size)
- const char *p;
- const struct string_option *table;
- int table_size;
+process_option_with_no (const char *p, const struct string_option *table,
+ int table_size)
{
int j;
* return 0, but do not complain if the option is not recognized.
*/
static int
-java_decode_option (argc, argv)
- int argc __attribute__ ((__unused__));
- char **argv;
+java_decode_option (int argc __attribute__ ((__unused__)), char **argv)
{
char *p = argv[0];
FILE *finput;
static const char *
-java_init (filename)
- const char *filename;
+java_init (const char *filename)
{
#if 0
extern int flag_minimal_debug;
}
static void
-java_finish ()
+java_finish (void)
{
jcf_dependency_write ();
}
It length is given by LEN; -1 means the string is nul-terminated. */
static void
-put_decl_string (str, len)
- const char *str;
- int len;
+put_decl_string (const char *str, int len)
{
if (len < 0)
len = strlen (str);
/* Append to decl_buf a printable name for NODE. */
static void
-put_decl_node (node)
- tree node;
+put_decl_node (tree node)
{
int was_pointer = 0;
if (TREE_CODE (node) == POINTER_TYPE)
which is also called directly by java_print_error_function. */
const char *
-lang_printable_name (decl, v)
- tree decl;
- int v __attribute__ ((__unused__));
+lang_printable_name (tree decl, int v __attribute__ ((__unused__)))
{
decl_bufpos = 0;
put_decl_node (decl);
space to the DECL name string -- With Leading Space. */
const char *
-lang_printable_name_wls (decl, v)
- tree decl;
- int v __attribute__ ((__unused__));
+lang_printable_name_wls (tree decl, int v __attribute__ ((__unused__)))
{
decl_bufpos = 1;
put_decl_node (decl);
static GTY(()) tree last_error_function_context;
static GTY(()) tree last_error_function;
static void
-java_print_error_function (context, file)
- diagnostic_context *context __attribute__((__unused__));
- const char *file;
+java_print_error_function (diagnostic_context *context ATTRIBUTE_UNUSED,
+ const char *file)
{
/* Don't print error messages with bogus function prototypes. */
if (inhibit_error_function_printing)
2, function prototypes are fully resolved and can be printed when
reporting errors. */
-void lang_init_source (level)
- int level;
+void lang_init_source (int level)
{
inhibit_error_function_printing = (level == 1);
}
static void
-java_init_options ()
+java_init_options (void)
{
flag_bounds_check = 1;
flag_exceptions = 1;
}
static bool
-java_can_use_bit_fields_p ()
+java_can_use_bit_fields_p (void)
{
/* The bit-field optimizations cause problems when generating class
files. */
/* Post-switch processing. */
static bool
-java_post_options ()
+java_post_options (void)
{
/* Use tree inlining if possible. Function instrumentation is only
done in the RTL level, so we disable tree inlining. */
/* Return either DECL or its known constant value (if it has one). */
tree
-decl_constant_value (decl)
- tree decl;
+decl_constant_value (tree decl)
{
if (/* Don't change a variable array bound or initial value to a constant
in a place where a variable is invalid. */
/* Walk the language specific tree nodes during inlining. */
static tree
-java_tree_inlining_walk_subtrees (tp,subtrees,func,data,htab)
- tree *tp ATTRIBUTE_UNUSED;
- int *subtrees ATTRIBUTE_UNUSED;
- walk_tree_fn func ATTRIBUTE_UNUSED;
- void *data ATTRIBUTE_UNUSED;
- void *htab ATTRIBUTE_UNUSED;
+java_tree_inlining_walk_subtrees (tree *tp ATTRIBUTE_UNUSED,
+ int *subtrees ATTRIBUTE_UNUSED,
+ walk_tree_fn func ATTRIBUTE_UNUSED,
+ void *data ATTRIBUTE_UNUSED,
+ void *htab ATTRIBUTE_UNUSED)
{
enum tree_code code;
tree result;
/* Called from unsafe_for_reeval. */
static int
-java_unsafe_for_reeval (t)
- tree t;
+java_unsafe_for_reeval (tree t)
{
switch (TREE_CODE (t))
{
to one in the scope of the method being inlined into. */
static int
-merge_init_test_initialization (entry, x)
- void * * entry;
- void * x;
+merge_init_test_initialization (void **entry, void *x)
{
struct treetreehash_entry *ite = (struct treetreehash_entry *) *entry;
splay_tree decl_map = (splay_tree)x;
inlining. */
void
-java_inlining_merge_static_initializers (fn, decl_map)
- tree fn;
- void *decl_map;
+java_inlining_merge_static_initializers (tree fn, void *decl_map)
{
htab_traverse
(DECL_FUNCTION_INIT_TEST_TABLE (fn),
pre-existing one. */
static int
-inline_init_test_initialization (entry, x)
- void * * entry;
- void * x;
+inline_init_test_initialization (void **entry, void *x)
{
struct treetreehash_entry *ite = (struct treetreehash_entry *) *entry;
splay_tree decl_map = (splay_tree)x;
into, create a new mapping for it. */
void
-java_inlining_map_static_initializers (fn, decl_map)
- tree fn;
- void *decl_map;
+java_inlining_map_static_initializers (tree fn, void *decl_map)
{
htab_traverse
(DECL_FUNCTION_INIT_TEST_TABLE (fn),
/* Avoid voluminous output for deep recursion of compound exprs. */
static void
-dump_compound_expr (di, t)
- dump_info_p di;
- tree t;
+dump_compound_expr (dump_info_p di, tree t)
{
int i;
}
static int
-java_dump_tree (dump_info, t)
- void *dump_info;
- tree t;
+java_dump_tree (void *dump_info, tree t)
{
enum tree_code code;
dump_info_p di = (dump_info_p) dump_info;
OSDN Git Service
