+2003-07-06 Andreas Jaeger <aj@suse.de>
+
+ * bad.c: Convert () to (void) in function definitions.
+ * bld.c: Likewise.
+ * data.c: Likewise.
+ * equiv.c: Likewise.
+ * expr.c: Likewise.
+ * global.c: Likewise.
+ * implic.c: Likewise.
+ * info.c: Likewise.
+ * intdoc.c: Likewise.
+ * intrin.c: Likewise.
+ * lab.c: Likewise.
+ * lex.c: Likewise.
+ * malloc.c: Likewise.
+ * src.c: Likewise.
+ * st.c: Likewise.
+ * sta.c: Likewise.
+ * stb.c: Likewise.
+ * stc.c: Likewise.
+ * std.c: Likewise.
+ * ste.c: Likewise.
+ * storag.c: Likewise.
+ * stt.c: Likewise.
+ * stw.c: Likewise.
+ * symbol.c: Likewise.
+ * top.c: Likewise.
+ * where.c: Likewise.
+
+ * com.c: Convert prototypes to ISO C90.
+ * com.h: Likewise.
+ * g77spec.c: Likewise.
+
Sun Jul 6 20:01:29 2003 Neil Booth <neil@daikokuya.co.uk>
* top.c (ffe_handle_option): Don't handle filenames.
/* bad.c -- Implementation File (module.c template V1.0)
- Copyright (C) 1995, 2002 Free Software Foundation, Inc.
+ Copyright (C) 1995, 2002, 2003 Free Software Foundation, Inc.
Contributed by James Craig Burley.
This file is part of GNU Fortran.
ffebad_init_0(); */
void
-ffebad_init_0 ()
+ffebad_init_0 (void)
{
assert (FFEBAD == ARRAY_SIZE (ffebad_messages_));
}
to actually get it to print (to stderr). */
void
-ffebad_finish ()
+ffebad_finish (void)
{
#define MAX_SPACES 132
static const char *const spaces
ffebld_init_0(); */
void
-ffebld_init_0 ()
+ffebld_init_0 (void)
{
assert (FFEBLD_op == ARRAY_SIZE (ffebld_op_string_));
assert (FFEBLD_op == ARRAY_SIZE (ffebld_arity_op_));
ffebld_init_1(); */
void
-ffebld_init_1 ()
+ffebld_init_1 (void)
{
#if FFEBLD_whereconstCURRENT_ == FFEBLD_whereconstFILE_
int i;
ffebld_init_2(); */
void
-ffebld_init_2 ()
+ffebld_init_2 (void)
{
#if FFEBLD_whereconstCURRENT_ == FFEBLD_whereconstPROGUNIT_
int i;
ffebld_pool_pop(); */
void
-ffebld_pool_pop ()
+ffebld_pool_pop (void)
{
ffebldPoolstack_ ps;
/* Static functions (internal). */
-static tree ffe_type_for_mode PARAMS ((enum machine_mode, int));
-static tree ffe_type_for_size PARAMS ((unsigned int, int));
-static tree ffe_unsigned_type PARAMS ((tree));
-static tree ffe_signed_type PARAMS ((tree));
-static tree ffe_signed_or_unsigned_type PARAMS ((int, tree));
-static bool ffe_mark_addressable PARAMS ((tree));
-static tree ffe_truthvalue_conversion PARAMS ((tree));
-static void ffecom_init_decl_processing PARAMS ((void));
+static tree ffe_type_for_mode (enum machine_mode, int);
+static tree ffe_type_for_size (unsigned int, int);
+static tree ffe_unsigned_type (tree);
+static tree ffe_signed_type (tree);
+static tree ffe_signed_or_unsigned_type (int, tree);
+static bool ffe_mark_addressable (tree);
+static tree ffe_truthvalue_conversion (tree);
+static void ffecom_init_decl_processing (void);
static tree ffecom_arglist_expr_ (const char *argstring, ffebld args);
static tree ffecom_widest_expr_type_ (ffebld list);
static bool ffecom_overlap_ (tree dest_decl, tree dest_offset,
static bool
ffecom_overlap_ (tree dest_decl, tree dest_offset, tree dest_size,
- tree source_tree, ffebld source UNUSED,
- bool scalar_arg)
+ tree source_tree, ffebld source UNUSED, bool scalar_arg)
{
tree source_decl;
tree source_offset;
in a COMMON area the callee might know about (and thus modify). */
static bool
-ffecom_args_overlapping_ (tree dest_tree, ffebld dest UNUSED,
- tree args, tree callee_commons,
- bool scalar_args)
+ffecom_args_overlapping_ (tree dest_tree, ffebld dest UNUSED, tree args,
+ tree callee_commons, bool scalar_args)
{
tree arg;
tree dest_decl;
to the arglist a pointer to a temporary to receive the return value. */
static tree
-ffecom_call_ (tree fn, ffeinfoKindtype kt, bool is_f2c_complex,
- tree type, tree args, tree dest_tree,
- ffebld dest, bool *dest_used, tree callee_commons,
- bool scalar_args, tree hook)
+ffecom_call_ (tree fn, ffeinfoKindtype kt, bool is_f2c_complex, tree type,
+ tree args, tree dest_tree, ffebld dest, bool *dest_used,
+ tree callee_commons, bool scalar_args, tree hook)
{
tree item;
tree tempvar;
static tree
ffecom_call_binop_ (tree fn, ffeinfoKindtype kt, bool is_f2c_complex,
- tree type, ffebld left, ffebld right,
- tree dest_tree, ffebld dest, bool *dest_used,
- tree callee_commons, bool scalar_args, bool ref, tree hook)
+ tree type, ffebld left, ffebld right, tree dest_tree,
+ ffebld dest, bool *dest_used, tree callee_commons,
+ bool scalar_args, bool ref, tree hook)
{
tree left_tree;
tree right_tree;
made, destination used instead, and dest_used flag set TRUE. */
static tree
-ffecom_expr_ (ffebld expr, tree dest_tree, ffebld dest,
- bool *dest_used, bool assignp, bool widenp)
+ffecom_expr_ (ffebld expr, tree dest_tree, ffebld dest, bool *dest_used,
+ bool assignp, bool widenp)
{
tree item;
tree list;
subroutines. */
static tree
-ffecom_expr_intrinsic_ (ffebld expr, tree dest_tree,
- ffebld dest, bool *dest_used)
+ffecom_expr_intrinsic_ (ffebld expr, tree dest_tree, ffebld dest,
+ bool *dest_used)
{
tree expr_tree;
tree saved_expr1; /* For those who need it. */
given size. */
static void
-ffecom_f2c_set_lio_code_ (ffeinfoBasictype bt, int size,
- int code)
+ffecom_f2c_set_lio_code_ (ffeinfoBasictype bt, int size, int code)
{
int j;
tree t;
}
static tree
-ffecom_intrinsic_ichar_ (tree tree_type, ffebld arg,
- tree *maybe_tree)
+ffecom_intrinsic_ichar_ (tree tree_type, ffebld arg, tree *maybe_tree)
{
tree expr_tree;
tree length_tree;
equivalent of a Fortran program unit. */
static void
-ffecom_start_progunit_ ()
+ffecom_start_progunit_ (void)
{
ffesymbol fn = ffecom_primary_entry_;
ffebld arglist;
taking into account different units of measurements for offsets. */
static void
-ffecom_tree_canonize_ptr_ (tree *decl, tree *offset,
- tree t)
+ffecom_tree_canonize_ptr_ (tree *decl, tree *offset, tree t)
{
switch (TREE_CODE (t))
{
reveal the overlap. */
static void
-ffecom_tree_canonize_ref_ (tree *decl, tree *offset,
- tree *size, tree t)
+ffecom_tree_canonize_ref_ (tree *decl, tree *offset, tree *size, tree t)
{
/* The default path is to report a nonexistant decl. */
*decl = NULL_TREE;
/* Do divide operation appropriate to type of operands. */
static tree
-ffecom_tree_divide_ (tree tree_type, tree left, tree right,
- tree dest_tree, ffebld dest, bool *dest_used,
- tree hook)
+ffecom_tree_divide_ (tree tree_type, tree left, tree right, tree dest_tree,
+ ffebld dest, bool *dest_used, tree hook)
{
if ((left == error_mark_node)
|| (right == error_mark_node))
/* Build type info for non-dummy variable. */
static tree
-ffecom_type_localvar_ (ffesymbol s, ffeinfoBasictype bt,
- ffeinfoKindtype kt)
+ffecom_type_localvar_ (ffesymbol s, ffeinfoBasictype bt, ffeinfoKindtype kt)
{
tree type;
ffebld dl;
static GTY(()) tree ffecom_type_namelist_var;
static tree
-ffecom_type_namelist_ ()
+ffecom_type_namelist_ (void)
{
if (ffecom_type_namelist_var == NULL_TREE)
{
static GTY(()) tree ffecom_type_vardesc_var;
static tree
-ffecom_type_vardesc_ ()
+ffecom_type_vardesc_ (void)
{
if (ffecom_type_vardesc_var == NULL_TREE)
{
checking for certain housekeeping things. */
tree
-ffecom_2 (enum tree_code code, tree type, tree node1,
- tree node2)
+ffecom_2 (enum tree_code code, tree type, tree node1, tree node2)
{
tree item;
TREE_SIDE_EFFECTS. */
tree
-ffecom_2s (enum tree_code code, tree type, tree node1,
- tree node2)
+ffecom_2s (enum tree_code code, tree type, tree node1, tree node2)
{
tree item;
checking for certain housekeeping things. */
tree
-ffecom_3 (enum tree_code code, tree type, tree node1,
- tree node2, tree node3)
+ffecom_3 (enum tree_code code, tree type, tree node1, tree node2, tree node3)
{
tree item;
TREE_SIDE_EFFECTS. */
tree
-ffecom_3s (enum tree_code code, tree type, tree node1,
- tree node2, tree node3)
+ffecom_3s (enum tree_code code, tree type, tree node1, tree node2, tree node3)
{
tree item;
/* Transform constant-union to tree, with the type known. */
tree
-ffecom_constantunion_with_type (ffebldConstantUnion *cu,
- tree tree_type, ffebldConst ct)
+ffecom_constantunion_with_type (ffebldConstantUnion *cu, tree tree_type,
+ ffebldConst ct)
{
tree item;
/* Handy way to make a field in a struct/union. */
tree
-ffecom_decl_field (tree context, tree prevfield,
- const char *name, tree type)
+ffecom_decl_field (tree context, tree prevfield, const char *name, tree type)
{
tree field;
Calls ffecom_sym_end_transition for each global and local symbol. */
void
-ffecom_end_transition ()
+ffecom_end_transition (void)
{
ffebld item;
Make sure error updating not inhibited. */
void
-ffecom_exec_transition ()
+ffecom_exec_transition (void)
{
bool inhibited;
/* Do global stuff. */
void
-ffecom_finish_compile ()
+ffecom_finish_compile (void)
{
assert (ffecom_outer_function_decl_ == NULL_TREE);
assert (current_function_decl == NULL_TREE);
/* Finish a program unit. */
void
-ffecom_finish_progunit ()
+ffecom_finish_progunit (void)
{
ffecom_end_compstmt ();
}
void
-ffecom_init_0 ()
+ffecom_init_0 (void)
{
tree endlink;
int i;
ffecom_init_2(); */
void
-ffecom_init_2 ()
+ffecom_init_2 (void)
{
assert (ffecom_outer_function_decl_ == NULL_TREE);
assert (current_function_decl == NULL_TREE);
the MODIFY_EXPR. */
tree
-ffecom_modify (tree newtype, tree lhs,
- tree rhs)
+ffecom_modify (tree newtype, tree lhs, tree rhs)
{
if (lhs == error_mark_node || rhs == error_mark_node)
return error_mark_node;
/* Create temporary gcc label. */
tree
-ffecom_temp_label ()
+ffecom_temp_label (void)
{
tree glabel;
static int mynumber = 0;
first ENTRY statement, and so on). */
tree
-ffecom_which_entrypoint_decl ()
+ffecom_which_entrypoint_decl (void)
{
assert (ffecom_which_entrypoint_decl_ != NULL_TREE);
"bison_rule_foo_" so they are easy to find. */
static void
-bison_rule_pushlevel_ ()
+bison_rule_pushlevel_ (void)
{
emit_line_note (input_filename, input_line);
pushlevel (0);
}
static tree
-bison_rule_compstmt_ ()
+bison_rule_compstmt_ (void)
{
tree t;
int keep = kept_level_p ();
tree
builtin_function (const char *name, tree type, int function_code,
- enum built_in_class class,
- const char *library_name,
+ enum built_in_class class, const char *library_name,
tree attrs ATTRIBUTE_UNUSED)
{
tree decl = build_decl (FUNCTION_DECL, get_identifier (name), type);
/* Create a new `struct f_binding_level'. */
static struct f_binding_level *
-make_binding_level ()
+make_binding_level (void)
{
/* NOSTRICT */
return ggc_alloc (sizeof (struct f_binding_level));
/* Restore the variables used during compilation of a C function. */
static void
-pop_f_function_context ()
+pop_f_function_context (void)
{
struct f_function *p = f_function_chain;
tree link;
used during compilation of a C function. */
static void
-push_f_function_context ()
+push_f_function_context (void)
{
struct f_function *p
= (struct f_function *) xmalloc (sizeof (struct f_function));
store the result back using `storedecls' or you will lose. */
tree
-getdecls ()
+getdecls (void)
{
return current_binding_level->names;
}
/* Nonzero if we are currently in the global binding level. */
int
-global_bindings_p ()
+global_bindings_p (void)
{
return current_binding_level == global_binding_level;
}
static void
-ffecom_init_decl_processing ()
+ffecom_init_decl_processing (void)
{
malloc_init ();
}
/* Each front end provides its own. */
-static bool ffe_init PARAMS ((void));
-static void ffe_finish PARAMS ((void));
-static bool ffe_post_options PARAMS ((const char **));
-static void ffe_print_identifier PARAMS ((FILE *, tree, int));
+static bool ffe_init (void);
+static void ffe_finish (void);
+static bool ffe_post_options (const char **);
+static void ffe_print_identifier (FILE *, tree, int);
struct language_function GTY(())
{
#undef DEFTREECODE
static bool
-ffe_post_options (pfilename)
- const char **pfilename;
+ffe_post_options (const char **pfilename)
{
const char *filename = *pfilename;
static bool
-ffe_init ()
+ffe_init (void)
{
#ifdef IO_BUFFER_SIZE
setvbuf (finput, (char *) xmalloc (IO_BUFFER_SIZE), _IOFBF, IO_BUFFER_SIZE);
}
static void
-ffe_finish ()
+ffe_finish (void)
{
ffe_terminate_0 ();
/* Nonzero if the current level needs to have a BLOCK made. */
static int
-kept_level_p ()
+kept_level_p (void)
{
tree decl;
FIRST is the beginning of the chain to append, and LAST is the end. */
static void
-append_include_chain (struct file_name_list *first, struct file_name_list *last)
+append_include_chain (struct file_name_list *first,
+ struct file_name_list *last)
{
struct file_name_list *dir;
#include "storag.h"
#include "symbol.h"
-extern int global_bindings_p PARAMS ((void));
-extern tree getdecls PARAMS ((void));
-extern void pushlevel PARAMS ((int));
-extern tree poplevel PARAMS ((int,int, int));
-extern void insert_block PARAMS ((tree));
-extern void set_block PARAMS ((tree));
-extern tree pushdecl PARAMS ((tree));
+extern int global_bindings_p (void);
+extern tree getdecls (void);
+extern void pushlevel (int);
+extern tree poplevel (int,int, int);
+extern void insert_block (tree);
+extern void set_block (tree);
+extern tree pushdecl (tree);
/* Global objects accessed by users of this module. */
CHARTYPE is CHARACTER*3, for example. */
static bool
-ffedata_advance_ ()
+ffedata_advance_ (void)
{
ffebld next;
ffedata_pop_(); */
static void
-ffedata_pop_ ()
+ffedata_pop_ (void)
{
ffedataImpdo_ victim = ffedata_stack_;
ffedata_push_(); */
static void
-ffedata_push_ ()
+ffedata_push_ (void)
{
ffedataImpdo_ baby;
/* equiv.c -- Implementation File (module.c template V1.0)
- Copyright (C) 1995, 1996, 1997, 1998 Free Software Foundation, Inc.
+ Copyright (C) 1995, 1996, 1997, 1998, 2003
+ Free Software Foundation, Inc.
Contributed by James Craig Burley.
This file is part of GNU Fortran.
ffeequiv_exec_transition(); */
void
-ffeequiv_exec_transition ()
+ffeequiv_exec_transition (void)
{
while (ffeequiv_list_.first != (ffeequiv) &ffeequiv_list_.first)
ffeequiv_layout_local_ (ffeequiv_list_.first);
Initializes the list of equivalences. */
void
-ffeequiv_init_2 ()
+ffeequiv_init_2 (void)
{
ffeequiv_list_.first = (ffeequiv) &ffeequiv_list_.first;
ffeequiv_list_.last = (ffeequiv) &ffeequiv_list_.first;
objects. */
ffeequiv
-ffeequiv_new ()
+ffeequiv_new (void)
{
ffeequiv eq;
/* Initializes the module. */
void
-ffeexpr_init_2 ()
+ffeexpr_init_2 (void)
{
ffeexpr_stack_ = NULL;
ffeexpr_level_ = 0;
Allocates and initializes a new expression object, returns it. */
static ffeexprExpr_
-ffeexpr_expr_new_ ()
+ffeexpr_expr_new_ (void)
{
ffeexprExpr_ e;
requisite type-assignment. */
static void
-ffeexpr_reduce_ ()
+ffeexpr_reduce_ (void)
{
ffeexprExpr_ operand; /* This is B in -B or A+B. */
ffeexprExpr_ left_operand; /* When operator is binary, this is A in A+B. */
/* Terminate module. */
void
-ffeexpr_terminate_2 ()
+ffeexpr_terminate_2 (void)
{
assert (ffeexpr_stack_ == NULL);
assert (ffeexpr_level_ == 0);
/* The original argument list and related info is copied here. */
static int g77_xargc;
static const char *const *g77_xargv;
-static void lookup_option PARAMS ((Option *, int *, const char **,
- const char *));
-static void append_arg PARAMS ((const char *));
+static void lookup_option (Option *, int *, const char **, const char *);
+static void append_arg (const char *);
/* The new argument list will be built here. */
static int g77_newargc;
to short ones, where available, has already been run. */
static void
-lookup_option (xopt, xskip, xarg, text)
- Option *xopt;
- int *xskip;
- const char **xarg;
- const char *text;
+lookup_option (Option *xopt, int *xskip, const char **xarg, const char *text)
{
Option opt = OPTION_;
int skip;
the new arg count. Otherwise allocate a new list, etc. */
static void
-append_arg (arg)
- const char *arg;
+append_arg (const char *arg)
{
static int newargsize;
}
void
-lang_specific_driver (in_argc, in_argv, in_added_libraries)
- int *in_argc;
- const char *const **in_argv;
- int *in_added_libraries ATTRIBUTE_UNUSED;
+lang_specific_driver (int *in_argc, const char *const **in_argv,
+ int *in_added_libraries ATTRIBUTE_UNUSED)
{
int argc = *in_argc;
const char *const *argv = *in_argv;
}
/* Called before linking. Returns 0 on success and -1 on failure. */
-int lang_specific_pre_link () /* Not used for F77. */
+int lang_specific_pre_link (void) /* Not used for F77. */
{
return 0;
}
ffeglobal_init_1(); */
void
-ffeglobal_init_1 ()
+ffeglobal_init_1 (void)
{
#if FFEGLOBAL_ENABLED
if (ffeglobal_filewide_ != NULL)
#endif
void
-ffeglobal_terminate_1 ()
+ffeglobal_terminate_1 (void)
{
}
/* implic.c -- Implementation File (module.c template V1.0)
- Copyright (C) 1995, 2002 Free Software Foundation, Inc.
+ Copyright (C) 1995, 2002, 2003 Free Software Foundation, Inc.
Contributed by James Craig Burley.
This file is part of GNU Fortran.
Allows for holes in the sequence of letters (i.e. EBCDIC). */
void
-ffeimplic_init_2 ()
+ffeimplic_init_2 (void)
{
ffeimplic_ imp;
char c;
Assigns null type information to all initial letters. */
void
-ffeimplic_none ()
+ffeimplic_none (void)
{
ffeimplic_ imp;
Kills info object for each entry in table. */
void
-ffeimplic_terminate_2 ()
+ffeimplic_terminate_2 (void)
{
}
/* info.c -- Implementation File (module.c template V1.0)
- Copyright (C) 1995, 2002 Free Software Foundation, Inc.
+ Copyright (C) 1995, 2002, 2003 Free Software Foundation, Inc.
Contributed by James Craig Burley.
This file is part of GNU Fortran.
ffeinfo_init_0(); */
void
-ffeinfo_init_0 ()
+ffeinfo_init_0 (void)
{
ffeinfoBasictype i;
ffeinfoBasictype j;
/* intdoc.c
- Copyright (C) 1997, 2000, 2001 Free Software Foundation, Inc.
+ Copyright (C) 1997, 2000, 2001, 2003
+ Free Software Foundation, Inc.
Contributed by James Craig Burley.
This file is part of GNU Fortran.
}
static void
-dumpendif ()
+dumpendif (void)
{
in_ifset = 2;
}
static void
-dumpclearif ()
+dumpclearif (void)
{
if ((in_ifset == 2)
|| (latest_family != FFEINTRIN_familyNONE))
}
static void
-dumpem ()
+dumpem (void)
{
int i;
}
void
-ffeintrin_init_0 ()
+ffeintrin_init_0 (void)
{
int i;
const char *p1;
Kill all the labels on the list. */
void
-ffelab_finish ()
+ffelab_finish (void)
{
ffelab l;
ffelab pl;
unit is going to be processed. */
void
-ffelab_init_3 ()
+ffelab_init_3 (void)
{
ffelab_list_ = NULL;
ffelab_num_news_ = 0;
typical fixed-form cases. */
static void
-ffelex_prepare_eos_ ()
+ffelex_prepare_eos_ (void)
{
if (ffelex_token_->type != FFELEX_typeNONE)
{
}
static void
-ffelex_finish_statement_ ()
+ffelex_finish_statement_ (void)
{
if ((ffelex_number_of_tokens_ == 0)
&& (ffelex_token_->type == FFELEX_typeNONE))
}
static void
-ffelex_include_ ()
+ffelex_include_ (void)
{
ffewhereFile include_wherefile = ffelex_include_wherefile_;
FILE *include_file = ffelex_include_file_;
}
static void
-ffelex_next_line_ ()
+ffelex_next_line_ (void)
{
ffelex_linecount_current_ = ffelex_linecount_next_;
++ffelex_linecount_next_;
}
static void
-ffelex_send_token_ ()
+ffelex_send_token_ (void)
{
++ffelex_number_of_tokens_;
}
static ffelexToken
-ffelex_token_new_ ()
+ffelex_token_new_ (void)
{
ffelexToken t;
return FALSE. */
bool
-ffelex_expecting_character ()
+ffelex_expecting_character (void)
{
return (ffelex_raw_mode_ != 0);
}
}
void
-ffelex_init_1 ()
+ffelex_init_1 (void)
{
unsigned int i;
Must be called while lexer is active, obviously. */
bool
-ffelex_is_names_expected ()
+ffelex_is_names_expected (void)
{
return ffelex_names_;
}
ffelex_linecount_current_. */
char *
-ffelex_line ()
+ffelex_line (void)
{
return ffelex_card_image_;
}
Must be called while lexer is active, obviously. */
ffewhereColumnNumber
-ffelex_line_length ()
+ffelex_line_length (void)
{
return ffelex_card_length_;
}
is current. */
ffewhereLineNumber
-ffelex_line_number ()
+ffelex_line_number (void)
{
return ffelex_linecount_current_;
}
/* Make a new EOF token right after end of file. */
ffelexToken
-ffelex_token_new_eof ()
+ffelex_token_new_eof (void)
{
ffelexToken t;
/* malloc.c -- Implementation File (module.c template V1.0)
- Copyright (C) 1995 Free Software Foundation, Inc.
+ Copyright (C) 1995, 2003 Free Software Foundation, Inc.
Contributed by James Craig Burley.
This file is part of GNU Fortran.
Call malloc_init before you do anything else. */
void
-malloc_init ()
+malloc_init (void)
{
if (malloc_reserve_ != NULL)
return;
/* src.c -- Implementation File
- Copyright (C) 1995 Free Software Foundation, Inc.
+ Copyright (C) 1995, 2003 Free Software Foundation, Inc.
Contributed by James Craig Burley.
This file is part of GNU Fortran.
/* Initialize table of alphabetic matches. */
void
-ffesrc_init_1 ()
+ffesrc_init_1 (void)
{
int i;
/* st.c -- Implementation File (module.c template V1.0)
- Copyright (C) 1995 Free Software Foundation, Inc.
+ Copyright (C) 1995, 2003 Free Software Foundation, Inc.
Contributed by James Craig Burley.
This file is part of GNU Fortran.
yet been set. */
void
-ffest_confirmed ()
+ffest_confirmed (void)
{
ffesta_confirmed ();
}
processing a statement (make and destroy pools, et cetera). */
void
-ffest_eof ()
+ffest_eof (void)
{
ffesta_eof ();
}
this list. Initializes the executable and nonexecutable lists. */
void
-ffest_init_0 ()
+ffest_init_0 (void)
{
ffesta_init_0 ();
ffestb_init_0 ();
this list. Initializes the executable and nonexecutable lists. */
void
-ffest_init_1 ()
+ffest_init_1 (void)
{
ffesta_init_1 ();
ffestb_init_1 ();
this list. Initializes the executable and nonexecutable lists. */
void
-ffest_init_2 ()
+ffest_init_2 (void)
{
ffesta_init_2 ();
ffestb_init_2 ();
ffest_init_3(); */
void
-ffest_init_3 ()
+ffest_init_3 (void)
{
ffesta_init_3 ();
ffestb_init_3 ();
ffest_init_4(); */
void
-ffest_init_4 ()
+ffest_init_4 (void)
{
ffesta_init_4 ();
ffestb_init_4 ();
Else returns FALSE. */
bool
-ffest_is_entry_valid ()
+ffest_is_entry_valid (void)
{
return ffesta_is_entry_valid;
}
the ffestb call would be completely dropped without this mechanism. */
bool
-ffest_is_inhibited ()
+ffest_is_inhibited (void)
{
return ffesta_is_inhibited ();
}
is being run. */
bool
-ffest_seen_first_exec ()
+ffest_seen_first_exec (void)
{
return ffesta_seen_first_exec;
}
user with a diagnostic if we're not inhibited. */
void
-ffest_shutdown ()
+ffest_shutdown (void)
{
ffesta_shutdown ();
}
ffest_terminate_0(); */
void
-ffest_terminate_0 ()
+ffest_terminate_0 (void)
{
ffesta_terminate_0 ();
ffestb_terminate_0 ();
ffest_terminate_1(); */
void
-ffest_terminate_1 ()
+ffest_terminate_1 (void)
{
ffesta_terminate_1 ();
ffestb_terminate_1 ();
ffest_terminate_2(); */
void
-ffest_terminate_2 ()
+ffest_terminate_2 (void)
{
ffesta_terminate_2 ();
ffestb_terminate_2 ();
ffest_terminate_3(); */
void
-ffest_terminate_3 ()
+ffest_terminate_3 (void)
{
ffesta_terminate_3 ();
ffestb_terminate_3 ();
ffest_terminate_4(); */
void
-ffest_terminate_4 ()
+ffest_terminate_4 (void)
{
ffesta_terminate_4 ();
ffestb_terminate_4 ();
invocation of ffestc_exec_transition. */
static bool
-ffesta_inhibited_exec_transition_ ()
+ffesta_inhibited_exec_transition_ (void)
{
bool result;
Clears the lists of executable and nonexecutable statements. */
static void
-ffesta_reset_possibles_ ()
+ffesta_reset_possibles_ (void)
{
ffesta_num_possibles_ = 0;
yet been set. */
void
-ffesta_confirmed ()
+ffesta_confirmed (void)
{
if (ffesta_inhibit_confirmation_)
return;
processing a statement (make and destroy pools, et cetera). */
void
-ffesta_eof ()
+ffesta_eof (void)
{
ffesta_tokens[0] = ffelex_token_new_eof ();
this list. Initializes the executable and nonexecutable lists. */
void
-ffesta_init_0 ()
+ffesta_init_0 (void)
{
ffestaPossible_ ptr;
int i;
ffesta_init_3(); */
void
-ffesta_init_3 ()
+ffesta_init_3 (void)
{
ffesta_output_pool = NULL; /* May be doing this just before reaching */
ffesta_scratch_pool = NULL; /* ffesta_zero or ffesta_two. */
the ffestb call would be completely dropped without this mechanism. */
bool
-ffesta_is_inhibited ()
+ffesta_is_inhibited (void)
{
assert (ffesta_confirmed_current_ || ffesta_inhibit_confirmation_);
return ffesta_is_inhibited_;
}
ffestaPooldisp
-ffesta_outpooldisp ()
+ffesta_outpooldisp (void)
{
return ffesta_outpooldisp_;
}
user with a diagnostic if we're not inhibited. */
void
-ffesta_shutdown ()
+ffesta_shutdown (void)
{
if (ffesta_is_inhibited_)
ffesta_current_shutdown_ = TRUE;
in _ents_ (perform housekeeping tasks). */
static void
-ffestb_subr_ambig_to_ents_ ()
+ffestb_subr_ambig_to_ents_ (void)
{
ffelexToken nt;
#if !FFESTB_KILL_EASY_
static void
-ffestb_subr_kill_accept_ ()
+ffestb_subr_kill_accept_ (void)
{
ffestpAcceptIx ix;
#if !FFESTB_KILL_EASY_
static void
-ffestb_subr_kill_beru_ ()
+ffestb_subr_kill_beru_ (void)
{
ffestpBeruIx ix;
#if !FFESTB_KILL_EASY_
static void
-ffestb_subr_kill_close_ ()
+ffestb_subr_kill_close_ (void)
{
ffestpCloseIx ix;
#if !FFESTB_KILL_EASY_
static void
-ffestb_subr_kill_delete_ ()
+ffestb_subr_kill_delete_ (void)
{
ffestpDeleteIx ix;
#if !FFESTB_KILL_EASY_
static void
-ffestb_subr_kill_inquire_ ()
+ffestb_subr_kill_inquire_ (void)
{
ffestpInquireIx ix;
#if !FFESTB_KILL_EASY_
static void
-ffestb_subr_kill_open_ ()
+ffestb_subr_kill_open_ (void)
{
ffestpOpenIx ix;
#if !FFESTB_KILL_EASY_
static void
-ffestb_subr_kill_print_ ()
+ffestb_subr_kill_print_ (void)
{
ffestpPrintIx ix;
#if !FFESTB_KILL_EASY_
static void
-ffestb_subr_kill_read_ ()
+ffestb_subr_kill_read_ (void)
{
ffestpReadIx ix;
#if !FFESTB_KILL_EASY_
static void
-ffestb_subr_kill_rewrite_ ()
+ffestb_subr_kill_rewrite_ (void)
{
ffestpRewriteIx ix;
#if !FFESTB_KILL_EASY_
static void
-ffestb_subr_kill_type_ ()
+ffestb_subr_kill_type_ (void)
{
ffestpTypeIx ix;
#if !FFESTB_KILL_EASY_
static void
-ffestb_subr_kill_write_ ()
+ffestb_subr_kill_write_ (void)
{
ffestpWriteIx ix;
ffestc_init_3(); */
void
-ffestc_init_3 ()
+ffestc_init_3 (void)
{
ffestv_save_state_ = FFESTV_savestateNONE;
ffestc_entry_num_ = 0;
defs, and statement function defs. */
void
-ffestc_init_4 ()
+ffestc_init_4 (void)
{
ffestc_saved_entry_num_ = ffestc_entry_num_;
ffestc_entry_num_ = 0;
/* Define label as usable for anything without complaint. */
static void
-ffestc_labeldef_any_ ()
+ffestc_labeldef_any_ (void)
{
if ((ffesta_label_token == NULL)
|| !ffestc_labeldef_begin_ ())
ffestc_labeldef_begin_(); */
static bool
-ffestc_labeldef_begin_ ()
+ffestc_labeldef_begin_ (void)
{
ffelabValue label_value;
ffelab label;
ffestc_labeldef_branch_begin_(); */
static void
-ffestc_labeldef_branch_begin_ ()
+ffestc_labeldef_branch_begin_ (void)
{
if ((ffesta_label_token == NULL)
|| (ffestc_shriek_after1_ != NULL)
which case they must issue a diagnostic). */
static void
-ffestc_labeldef_branch_end_ ()
+ffestc_labeldef_branch_end_ (void)
{
if (ffesta_label_token == NULL)
return;
ffestc_labeldef_endif_(); */
static void
-ffestc_labeldef_endif_ ()
+ffestc_labeldef_endif_ (void)
{
if ((ffesta_label_token == NULL)
|| (ffestc_shriek_after1_ != NULL)
ffestc_labeldef_format_(); */
static void
-ffestc_labeldef_format_ ()
+ffestc_labeldef_format_ (void)
{
if ((ffesta_label_token == NULL)
|| (ffestc_shriek_after1_ != NULL))
ffestc_labeldef_invalid_(); */
static void
-ffestc_labeldef_invalid_ ()
+ffestc_labeldef_invalid_ (void)
{
if ((ffesta_label_token == NULL)
|| (ffestc_shriek_after1_ != NULL)
be in the "then" part of a logical IF, such as a block-IF statement. */
static void
-ffestc_labeldef_notloop_ ()
+ffestc_labeldef_notloop_ (void)
{
if (ffesta_label_token == NULL)
return;
loop-ending label. */
static void
-ffestc_labeldef_notloop_begin_ ()
+ffestc_labeldef_notloop_begin_ (void)
{
if ((ffesta_label_token == NULL)
|| (ffestc_shriek_after1_ != NULL)
ffestc_labeldef_useless_(); */
static void
-ffestc_labeldef_useless_ ()
+ffestc_labeldef_useless_ (void)
{
if ((ffesta_label_token == NULL)
|| (ffestc_shriek_after1_ != NULL)
return; */
static ffestcOrder_
-ffestc_order_actiondo_ ()
+ffestc_order_actiondo_ (void)
{
recurse:
return; */
static ffestcOrder_
-ffestc_order_actionif_ ()
+ffestc_order_actionif_ (void)
{
bool update;
return; */
static ffestcOrder_
-ffestc_order_actionwhere_ ()
+ffestc_order_actionwhere_ (void)
{
bool update;
doesn't produce any diagnostics. */
static void
-ffestc_order_any_ ()
+ffestc_order_any_ (void)
{
bool update;
now. */
static void
-ffestc_order_bad_ ()
+ffestc_order_bad_ (void)
{
if (ffewhere_line_is_unknown (ffestw_line (ffestw_stack_top ())))
{
return; */
static ffestcOrder_
-ffestc_order_blockdata_ ()
+ffestc_order_blockdata_ (void)
{
recurse:
return; */
static ffestcOrder_
-ffestc_order_blockspec_ ()
+ffestc_order_blockspec_ (void)
{
recurse:
return; */
static ffestcOrder_
-ffestc_order_data_ ()
+ffestc_order_data_ (void)
{
recurse:
return; */
static ffestcOrder_
-ffestc_order_data77_ ()
+ffestc_order_data77_ (void)
{
recurse:
return; */
static ffestcOrder_
-ffestc_order_do_ ()
+ffestc_order_do_ (void)
{
switch (ffestw_state (ffestw_stack_top ()))
{
return; */
static ffestcOrder_
-ffestc_order_entry_ ()
+ffestc_order_entry_ (void)
{
recurse:
return; */
static ffestcOrder_
-ffestc_order_exec_ ()
+ffestc_order_exec_ (void)
{
bool update;
return; */
static ffestcOrder_
-ffestc_order_format_ ()
+ffestc_order_format_ (void)
{
recurse:
return; */
static ffestcOrder_
-ffestc_order_function_ ()
+ffestc_order_function_ (void)
{
recurse:
return; */
static ffestcOrder_
-ffestc_order_iface_ ()
+ffestc_order_iface_ (void)
{
switch (ffestw_state (ffestw_stack_top ()))
{
return; */
static ffestcOrder_
-ffestc_order_ifthen_ ()
+ffestc_order_ifthen_ (void)
{
switch (ffestw_state (ffestw_stack_top ()))
{
return; */
static ffestcOrder_
-ffestc_order_implicit_ ()
+ffestc_order_implicit_ (void)
{
recurse:
return; */
static ffestcOrder_
-ffestc_order_implicitnone_ ()
+ffestc_order_implicitnone_ (void)
{
recurse:
return; */
static ffestcOrder_
-ffestc_order_parameter_ ()
+ffestc_order_parameter_ (void)
{
recurse:
return; */
static ffestcOrder_
-ffestc_order_program_ ()
+ffestc_order_program_ (void)
{
recurse:
return; */
static ffestcOrder_
-ffestc_order_progspec_ ()
+ffestc_order_progspec_ (void)
{
recurse:
return; */
static ffestcOrder_
-ffestc_order_selectcase_ ()
+ffestc_order_selectcase_ (void)
{
switch (ffestw_state (ffestw_stack_top ()))
{
return; */
static ffestcOrder_
-ffestc_order_sfunc_ ()
+ffestc_order_sfunc_ (void)
{
recurse:
return; */
static ffestcOrder_
-ffestc_order_subroutine_ ()
+ffestc_order_subroutine_ (void)
{
recurse:
return; */
static ffestcOrder_
-ffestc_order_typedecl_ ()
+ffestc_order_typedecl_ (void)
{
recurse:
return; */
static ffestcOrder_
-ffestc_order_unit_ ()
+ffestc_order_unit_ (void)
{
switch (ffestw_state (ffestw_stack_top ()))
{
of a main program unit. */
static void
-ffestc_shriek_begin_program_ ()
+ffestc_shriek_begin_program_ (void)
{
ffestw b;
ffesymbol s;
like "DO 10", "IF (...) THEN", "10 ELSE", "END IF", "END". */
static void
-ffestc_try_shriek_do_ ()
+ffestc_try_shriek_do_ (void)
{
ffelab lab;
ffelabType ty;
Gonna specify values for the object now. */
void
-ffestc_decl_itemstartvals ()
+ffestc_decl_itemstartvals (void)
{
switch (ffestc_local_.decl.is_R426)
{
Just wrap up any local activities. */
void
-ffestc_decl_finish ()
+ffestc_decl_finish (void)
{
switch (ffestc_local_.decl.is_R426)
{
it. */
void
-ffestc_end ()
+ffestc_end (void)
{
ffestw b;
block's shriek function to clean up to state NIL. */
void
-ffestc_eof ()
+ffestc_eof (void)
{
if (ffestw_state (ffestw_stack_top ()) != FFESTV_stateNIL)
{
seeing the unrecognized statement? we do the former at the moment). */
bool
-ffestc_exec_transition ()
+ffestc_exec_transition (void)
{
bool update;
is the R1219 function-stmt case). */
bool
-ffestc_is_decl_not_R1219 ()
+ffestc_is_decl_not_R1219 (void)
{
switch (ffestw_state (ffestw_stack_top ()))
{
if the ENTRY is in a function context. */
bool
-ffestc_is_entry_in_subr ()
+ffestc_is_entry_in_subr (void)
{
ffestvState s;
explicit typing of name. */
bool
-ffestc_is_let_not_V027 ()
+ffestc_is_let_not_V027 (void)
{
switch (ffestw_state (ffestw_stack_top ()))
{
defs, and statement function defs. */
void
-ffestc_terminate_4 ()
+ffestc_terminate_4 (void)
{
ffestc_entry_num_ = ffestc_saved_entry_num_;
}
Gonna specify values for the object now. */
void
-ffestc_R501_itemstartvals ()
+ffestc_R501_itemstartvals (void)
{
ffestc_check_item_startvals_ ();
Just wrap up any local activities. */
void
-ffestc_R501_finish ()
+ffestc_R501_finish (void)
{
ffestc_check_finish_ ();
}
Verify that SAVE is valid here, and flag everything as SAVEd. */
void
-ffestc_R522 ()
+ffestc_R522 (void)
{
ffestc_check_simple_ ();
if (ffestc_order_blockspec_ () != FFESTC_orderOK_)
Verify that SAVE is valid here, and begin accepting items in the list. */
void
-ffestc_R522start ()
+ffestc_R522start (void)
{
ffestc_check_start_ ();
if (ffestc_order_blockspec_ () != FFESTC_orderOK_)
Just wrap up any local activities. */
void
-ffestc_R522finish ()
+ffestc_R522finish (void)
{
ffestc_check_finish_ ();
if (!ffestc_ok_)
Just wrap up any local activities. */
void
-ffestc_R524_finish ()
+ffestc_R524_finish (void)
{
ffestc_check_finish_ ();
if (!ffestc_ok_)
Verify that DATA is valid here, and begin accepting items in the list. */
void
-ffestc_R528_start ()
+ffestc_R528_start (void)
{
ffestcOrder_ order;
No more objects, gonna specify values for the list of objects now. */
void
-ffestc_R528_item_startvals ()
+ffestc_R528_item_startvals (void)
{
ffestc_check_item_startvals_ ();
if (!ffestc_ok_)
Just wrap up any local activities. */
void
-ffestc_R528_finish ()
+ffestc_R528_finish (void)
{
ffestc_check_finish_ ();
list. */
void
-ffestc_R537_start ()
+ffestc_R537_start (void)
{
ffestc_check_start_ ();
if (ffestc_order_parameter_ () != FFESTC_orderOK_)
Just wrap up any local activities. */
void
-ffestc_R537_finish ()
+ffestc_R537_finish (void)
{
ffestc_check_finish_ ();
if (!ffestc_ok_)
Verify that the IMPLICIT NONE statement is ok here and implement. */
void
-ffestc_R539 ()
+ffestc_R539 (void)
{
ffestc_check_simple_ ();
if (ffestc_order_implicitnone_ () != FFESTC_orderOK_)
Verify that the IMPLICIT statement is ok here and implement. */
void
-ffestc_R539start ()
+ffestc_R539start (void)
{
ffestc_check_start_ ();
if (ffestc_order_implicit_ () != FFESTC_orderOK_)
Finish up any local activities. */
void
-ffestc_R539finish ()
+ffestc_R539finish (void)
{
ffestc_check_finish_ ();
if (!ffestc_ok_)
list. */
void
-ffestc_R542_start ()
+ffestc_R542_start (void)
{
ffestc_check_start_ ();
if (ffestc_order_progspec_ () != FFESTC_orderOK_)
Just wrap up any local activities. */
void
-ffestc_R542_finish ()
+ffestc_R542_finish (void)
{
ffestc_check_finish_ ();
if (!ffestc_ok_)
list. */
void
-ffestc_R544_start ()
+ffestc_R544_start (void)
{
ffestc_check_start_ ();
if (ffestc_order_blockspec_ () != FFESTC_orderOK_)
Just wrap up any local activities. */
void
-ffestc_R544_finish ()
+ffestc_R544_finish (void)
{
ffestc_check_finish_ ();
}
Verify that COMMON is valid here, and begin accepting items in the list. */
void
-ffestc_R547_start ()
+ffestc_R547_start (void)
{
ffestc_check_start_ ();
if (ffestc_order_blockspec_ () != FFESTC_orderOK_)
Just wrap up any local activities. */
void
-ffestc_R547_finish ()
+ffestc_R547_finish (void)
{
ffestc_check_finish_ ();
if (!ffestc_ok_)
&& ((ffeinfo_basictype (ffebld_info (caseobj->expr1))
!= s->type)
|| ((ffeinfo_kindtype (ffebld_info (caseobj->expr1))
- != s->kindtype)
+ != s->kindtype)
&& (ffeinfo_kindtype (ffebld_info (caseobj->expr1)) != FFEINFO_kindtypeINTEGER1 ))
|| ((caseobj->range)
&& (caseobj->expr2 != NULL)
ffestc_R841(); */
void
-ffestc_R841 ()
+ffestc_R841 (void)
{
ffestc_check_simple_ ();
Make sure an OPEN is valid in the current context, and implement it. */
void
-ffestc_R904 ()
+ffestc_R904 (void)
{
int i;
int expect_file;
Make sure a CLOSE is valid in the current context, and implement it. */
void
-ffestc_R907 ()
+ffestc_R907 (void)
{
static const char *const status_strs[] =
{
Just wrap up any local activities. */
void
-ffestc_R909_finish ()
+ffestc_R909_finish (void)
{
ffestc_check_finish_ ();
if (!ffestc_ok_)
list. */
void
-ffestc_R910_start ()
+ffestc_R910_start (void)
{
ffestvUnit unit;
ffestvFormat format;
Just wrap up any local activities. */
void
-ffestc_R910_finish ()
+ffestc_R910_finish (void)
{
ffestc_check_finish_ ();
if (!ffestc_ok_)
list. */
void
-ffestc_R911_start ()
+ffestc_R911_start (void)
{
ffestvFormat format;
Just wrap up any local activities. */
void
-ffestc_R911_finish ()
+ffestc_R911_finish (void)
{
ffestc_check_finish_ ();
if (!ffestc_ok_)
Make sure a BACKSPACE is valid in the current context, and implement it. */
void
-ffestc_R919 ()
+ffestc_R919 (void)
{
ffestc_check_simple_ ();
if (ffestc_order_actionif_ () != FFESTC_orderOK_)
Make sure a ENDFILE is valid in the current context, and implement it. */
void
-ffestc_R920 ()
+ffestc_R920 (void)
{
ffestc_check_simple_ ();
if (ffestc_order_actionif_ () != FFESTC_orderOK_)
Make sure a REWIND is valid in the current context, and implement it. */
void
-ffestc_R921 ()
+ffestc_R921 (void)
{
ffestc_check_simple_ ();
if (ffestc_order_actionif_ () != FFESTC_orderOK_)
Make sure an INQUIRE is valid in the current context, and implement it. */
void
-ffestc_R923A ()
+ffestc_R923A (void)
{
bool by_file;
bool by_unit;
list. */
void
-ffestc_R923B_start ()
+ffestc_R923B_start (void)
{
ffestc_check_start_ ();
if (ffestc_order_actionif_ () != FFESTC_orderOK_)
Just wrap up any local activities. */
void
-ffestc_R923B_finish ()
+ffestc_R923B_finish (void)
{
ffestc_check_finish_ ();
if (!ffestc_ok_)
Verify that EXTERNAL is valid here, and begin accepting items in the list. */
void
-ffestc_R1207_start ()
+ffestc_R1207_start (void)
{
ffestc_check_start_ ();
if (ffestc_order_progspec_ () != FFESTC_orderOK_)
Just wrap up any local activities. */
void
-ffestc_R1207_finish ()
+ffestc_R1207_finish (void)
{
ffestc_check_finish_ ();
if (!ffestc_ok_)
Verify that INTRINSIC is valid here, and begin accepting items in the list. */
void
-ffestc_R1208_start ()
+ffestc_R1208_start (void)
{
ffestc_check_start_ ();
if (ffestc_order_progspec_ () != FFESTC_orderOK_)
Just wrap up any local activities. */
void
-ffestc_R1208_finish ()
+ffestc_R1208_finish (void)
{
ffestc_check_finish_ ();
if (!ffestc_ok_)
list. */
void
-ffestc_V014_start ()
+ffestc_V014_start (void)
{
ffestc_check_start_ ();
if (ffestc_order_progspec_ () != FFESTC_orderOK_)
Just wrap up any local activities. */
void
-ffestc_V014_finish ()
+ffestc_V014_finish (void)
{
ffestc_check_finish_ ();
if (!ffestc_ok_)
list. */
void
-ffestc_V020_start ()
+ffestc_V020_start (void)
{
ffestvFormat format;
Just wrap up any local activities. */
void
-ffestc_V020_finish ()
+ffestc_V020_finish (void)
{
ffestc_check_finish_ ();
if (!ffestc_ok_)
Verify that PARAMETER is valid here, and begin accepting items in the list. */
void
-ffestc_V027_start ()
+ffestc_V027_start (void)
{
ffestc_check_start_ ();
if (ffestc_order_parameter_ () != FFESTC_orderOK_)
Just wrap up any local activities. */
void
-ffestc_V027_finish ()
+ffestc_V027_finish (void)
{
ffestc_check_finish_ ();
if (!ffestc_ok_)
like the statement for a logical IF are reset. */
void
-ffestc_any ()
+ffestc_any (void)
{
ffestc_check_simple_ ();
ffestd_stmt_pass_(); */
static void
-ffestd_stmt_pass_ ()
+ffestd_stmt_pass_ (void)
{
ffestdStmt_ stmt;
ffestdExprItem_ expr; /* For traversing lists. */
ffestd_subr_vxt_(); */
static void
-ffestd_subr_vxt_ ()
+ffestd_subr_vxt_ (void)
{
ffebad_start (FFEBAD_VXT_UNSUPPORTED);
ffebad_here (0, ffelex_token_where_line (ffesta_tokens[0]),
handling them as a single block rather than one statement at a time). */
void
-ffestd_begin_uses ()
+ffestd_begin_uses (void)
{
}
ffestd_exec_begin(); */
void
-ffestd_exec_begin ()
+ffestd_exec_begin (void)
{
ffecom_exec_transition ();
ffestd_exec_end(); */
void
-ffestd_exec_end ()
+ffestd_exec_end (void)
{
location_t old_loc = input_location;
ffestd_init_3(); */
void
-ffestd_init_3 ()
+ffestd_init_3 (void)
{
ffestd_stmt_list_.first = (ffestdStmt_) &ffestd_stmt_list_.first;
ffestd_stmt_list_.last = (ffestdStmt_) &ffestd_stmt_list_.first;
Verify that SAVE is valid here, and flag everything as SAVEd. */
void
-ffestd_R522 ()
+ffestd_R522 (void)
{
ffestd_check_simple_ ();
}
Verify that SAVE is valid here, and begin accepting items in the list. */
void
-ffestd_R522start ()
+ffestd_R522start (void)
{
ffestd_check_start_ ();
}
Just wrap up any local activities. */
void
-ffestd_R522finish ()
+ffestd_R522finish (void)
{
ffestd_check_finish_ ();
}
Just wrap up any local activities. */
void
-ffestd_R524_finish ()
+ffestd_R524_finish (void)
{
ffestd_check_finish_ ();
}
Verify that PARAMETER is valid here, and begin accepting items in the list. */
void
-ffestd_R537_start ()
+ffestd_R537_start (void)
{
ffestd_check_start_ ();
}
Just wrap up any local activities. */
void
-ffestd_R537_finish ()
+ffestd_R537_finish (void)
{
ffestd_check_finish_ ();
}
Verify that the IMPLICIT NONE statement is ok here and implement. */
void
-ffestd_R539 ()
+ffestd_R539 (void)
{
ffestd_check_simple_ ();
}
Verify that the IMPLICIT statement is ok here and implement. */
void
-ffestd_R539start ()
+ffestd_R539start (void)
{
ffestd_check_start_ ();
}
Finish up any local activities. */
void
-ffestd_R539finish ()
+ffestd_R539finish (void)
{
ffestd_check_finish_ ();
}
Verify that NAMELIST is valid here, and begin accepting items in the list. */
void
-ffestd_R542_start ()
+ffestd_R542_start (void)
{
ffestd_check_start_ ();
}
Just wrap up any local activities. */
void
-ffestd_R542_finish ()
+ffestd_R542_finish (void)
{
ffestd_check_finish_ ();
}
Verify that COMMON is valid here, and begin accepting items in the list. */
void
-ffestd_R547_start ()
+ffestd_R547_start (void)
{
ffestd_check_start_ ();
}
Just wrap up any local activities. */
void
-ffestd_R547_finish ()
+ffestd_R547_finish (void)
{
ffestd_check_finish_ ();
}
Make sure an OPEN is valid in the current context, and implement it. */
void
-ffestd_R904 ()
+ffestd_R904 (void)
{
ffestdStmt_ stmt;
Make sure a CLOSE is valid in the current context, and implement it. */
void
-ffestd_R907 ()
+ffestd_R907 (void)
{
ffestdStmt_ stmt;
Just wrap up any local activities. */
void
-ffestd_R909_finish ()
+ffestd_R909_finish (void)
{
ffestd_check_finish_ ();
}
Just wrap up any local activities. */
void
-ffestd_R910_finish ()
+ffestd_R910_finish (void)
{
ffestd_check_finish_ ();
}
Just wrap up any local activities. */
void
-ffestd_R911_finish ()
+ffestd_R911_finish (void)
{
ffestd_check_finish_ ();
}
Make sure a BACKSPACE is valid in the current context, and implement it. */
void
-ffestd_R919 ()
+ffestd_R919 (void)
{
ffestdStmt_ stmt;
Make sure a ENDFILE is valid in the current context, and implement it. */
void
-ffestd_R920 ()
+ffestd_R920 (void)
{
ffestdStmt_ stmt;
Make sure a REWIND is valid in the current context, and implement it. */
void
-ffestd_R921 ()
+ffestd_R921 (void)
{
ffestdStmt_ stmt;
list. */
void
-ffestd_R923B_start ()
+ffestd_R923B_start (void)
{
ffestdStmt_ stmt;
Just wrap up any local activities. */
void
-ffestd_R923B_finish ()
+ffestd_R923B_finish (void)
{
ffestd_check_finish_ ();
}
Verify that EXTERNAL is valid here, and begin accepting items in the list. */
void
-ffestd_R1207_start ()
+ffestd_R1207_start (void)
{
ffestd_check_start_ ();
}
Just wrap up any local activities. */
void
-ffestd_R1207_finish ()
+ffestd_R1207_finish (void)
{
ffestd_check_finish_ ();
}
Verify that INTRINSIC is valid here, and begin accepting items in the list. */
void
-ffestd_R1208_start ()
+ffestd_R1208_start (void)
{
ffestd_check_start_ ();
}
Just wrap up any local activities. */
void
-ffestd_R1208_finish ()
+ffestd_R1208_finish (void)
{
ffestd_check_finish_ ();
}
Verify that VOLATILE is valid here, and begin accepting items in the list. */
void
-ffestd_V014_start ()
+ffestd_V014_start (void)
{
ffestd_check_start_ ();
}
Just wrap up any local activities. */
void
-ffestd_V014_finish ()
+ffestd_V014_finish (void)
{
ffestd_check_finish_ ();
}
Just wrap up any local activities. */
void
-ffestd_V020_finish ()
+ffestd_V020_finish (void)
{
ffestd_check_finish_ ();
}
Verify that PARAMETER is valid here, and begin accepting items in the list. */
void
-ffestd_V027_start ()
+ffestd_V027_start (void)
{
ffestd_check_start_ ();
ffestd_subr_vxt_ ();
Just wrap up any local activities. */
void
-ffestd_V027_finish ()
+ffestd_V027_finish (void)
{
ffestd_check_finish_ ();
}
/* Any executable statement. */
void
-ffestd_any ()
+ffestd_any (void)
{
ffestdStmt_ stmt;
tree exq = (Exp); \
tree lenexq = (Lenexp); \
int need_exq = (! exq); \
- int need_lenexq = (! lenexq); \
+ int need_lenexq = (! lenexq); \
if (need_exq || need_lenexq) \
{ \
exq = ffecom_arg_ptr_to_expr ((Spec)->u.expr, &lenexq); \
Applies to *only* logical IF, not to IF-THEN. */
void
-ffeste_end_R807 ()
+ffeste_end_R807 (void)
{
ffeste_emit_line_note_ ();
ending an iterative DO statement, even one that ends at a label. */
void
-ffeste_R825 ()
+ffeste_R825 (void)
{
ffeste_check_simple_ ();
/* CONTINUE statement. */
void
-ffeste_R841 ()
+ffeste_R841 (void)
{
ffeste_check_simple_ ();
/* READ statement -- end. */
void
-ffeste_R909_finish ()
+ffeste_R909_finish (void)
{
ffeste_check_finish_ ();
/* WRITE statement -- end. */
void
-ffeste_R910_finish ()
+ffeste_R910_finish (void)
{
ffeste_check_finish_ ();
/* PRINT statement -- end. */
void
-ffeste_R911_finish ()
+ffeste_R911_finish (void)
{
ffeste_check_finish_ ();
/* INQUIRE(IOLENGTH=expr) statement -- end. */
void
-ffeste_R923B_finish ()
+ffeste_R923B_finish (void)
{
ffeste_check_finish_ ();
}
/* END PROGRAM. */
void
-ffeste_R1103 ()
+ffeste_R1103 (void)
{
}
/* END BLOCK DATA. */
void
-ffeste_R1112 ()
+ffeste_R1112 (void)
{
}
/* END FUNCTION. */
void
-ffeste_R1221 ()
+ffeste_R1221 (void)
{
}
/* END SUBROUTINE. */
void
-ffeste_R1225 ()
+ffeste_R1225 (void)
{
}
/* TYPE statement -- end. */
void
-ffeste_V020_finish ()
+ffeste_V020_finish (void)
{
ffeste_check_finish_ ();
}
ffestorag_init_2(); */
void
-ffestorag_init_2 ()
+ffestorag_init_2 (void)
{
ffestorag_list_.first = ffestorag_list_.last
= (ffestorag) &ffestorag_list_.first;
/* Report info on LOCAL non-sym-assoc'ed entities if needed. */
void
-ffestorag_report ()
+ffestorag_report (void)
{
ffestorag s;
/* stt.c -- Implementation File (module.c template V1.0)
- Copyright (C) 1995, 1997 Free Software Foundation, Inc.
+ Copyright (C) 1995, 1997, 2003 Free Software Foundation, Inc.
Contributed by James Craig Burley.
This file is part of GNU Fortran.
The list is allocated out of the scratch pool. */
ffesttCaseList
-ffestt_caselist_create ()
+ffestt_caselist_create (void)
{
ffesttCaseList new;
The list is allocated out of the scratch pool. */
ffesttDimList
-ffestt_dimlist_create ()
+ffestt_dimlist_create (void)
{
ffesttDimList new;
The list is allocated out of the scratch pool. */
ffesttExprList
-ffestt_exprlist_create ()
+ffestt_exprlist_create (void)
{
ffesttExprList new;
The list is allocated out of the scratch pool. */
ffesttImpList
-ffestt_implist_create ()
+ffestt_implist_create (void)
{
ffesttImpList new;
The list is allocated out of the scratch pool. */
ffesttTokenList
-ffestt_tokenlist_create ()
+ffestt_tokenlist_create (void)
{
ffesttTokenList tl;
/* stw.c -- Implementation File (module.c template V1.0)
- Copyright (C) 1995 Free Software Foundation, Inc.
+ Copyright (C) 1995, 2003 Free Software Foundation, Inc.
Contributed by James Craig Burley.
This file is part of GNU Fortran.
ffestw_init_0(); */
void
-ffestw_init_0 ()
+ffestw_init_0 (void)
{
ffestw b;
/* Kill manifest (g77-picked) names. */
static void
-ffesymbol_kill_manifest_ ()
+ffesymbol_kill_manifest_ (void)
{
if (ffesymbol_token_blank_common_ != NULL)
ffelex_token_kill (ffesymbol_token_blank_common_);
}
void
-ffesymbol_init_0 ()
+ffesymbol_init_0 (void)
{
ffesymbolAttrs attrs = FFESYMBOL_attrsetNONE;
}
void
-ffesymbol_init_1 ()
+ffesymbol_init_1 (void)
{
#if FFESYMBOL_globalCURRENT_ == FFESYMBOL_globalFILE_
ffesymbol_global_ = ffename_space_new (ffe_pool_file ());
}
void
-ffesymbol_init_2 ()
+ffesymbol_init_2 (void)
{
}
void
-ffesymbol_init_3 ()
+ffesymbol_init_3 (void)
{
#if FFESYMBOL_globalCURRENT_ == FFESYMBOL_globalPROGUNIT_
ffesymbol_global_ = ffename_space_new (ffe_pool_program_unit ());
}
void
-ffesymbol_init_4 ()
+ffesymbol_init_4 (void)
{
ffesymbol_sfunc_ = ffename_space_new (ffe_pool_program_unit ());
}
/* Return retractable flag. */
bool
-ffesymbol_retractable ()
+ffesymbol_retractable (void)
{
return ffesymbol_retractable_;
}
}
void
-ffesymbol_terminate_0 ()
+ffesymbol_terminate_0 (void)
{
}
void
-ffesymbol_terminate_1 ()
+ffesymbol_terminate_1 (void)
{
#if FFESYMBOL_globalCURRENT_ == FFESYMBOL_globalFILE_
ffename_space_drive_symbol (ffesymbol_global_, ffesymbol_unhook_);
}
void
-ffesymbol_terminate_2 ()
+ffesymbol_terminate_2 (void)
{
#if FFESYMBOL_globalCURRENT_ == FFESYMBOL_globalPROGUNIT_
ffesymbol_kill_manifest_ ();
}
void
-ffesymbol_terminate_3 ()
+ffesymbol_terminate_3 (void)
{
#if FFESYMBOL_globalCURRENT_ == FFESYMBOL_globalPROGUNIT_
ffename_space_drive_symbol (ffesymbol_global_, ffesymbol_unhook_);
}
void
-ffesymbol_terminate_4 ()
+ffesymbol_terminate_4 (void)
{
ffename_space_drive_symbol (ffesymbol_sfunc_, ffesymbol_unhook_);
ffename_space_kill (ffesymbol_sfunc_);
/* top.c -- Implementation File (module.c template V1.0)
- Copyright (C) 1995, 1996, 1997, 1999, 2001 Free Software Foundation, Inc.
+ Copyright (C) 1995, 1996, 1997, 1999, 2001, 2003
+ Free Software Foundation, Inc.
Contributed by James Craig Burley.
This file is part of GNU Fortran.
Performs per-image invocation. */
void
-ffe_init_0 ()
+ffe_init_0 (void)
{
++ffe_count_0;
ffe_in_0 = TRUE;
Performs per-source-file invocation (not including INCLUDEd files). */
void
-ffe_init_1 ()
+ffe_init_1 (void)
{
++ffe_count_1;
ffe_in_1 = TRUE;
Performs per-program-unit invocation. */
void
-ffe_init_2 ()
+ffe_init_2 (void)
{
++ffe_count_2;
ffe_in_2 = TRUE;
of inits, from 0-3, breaks here; level 4 must be invoked independently). */
void
-ffe_init_3 ()
+ffe_init_3 (void)
{
++ffe_count_3;
ffe_in_3 = TRUE;
ffe_init_4(); */
void
-ffe_init_4 ()
+ffe_init_4 (void)
{
++ffe_count_4;
ffe_in_4 = TRUE;
ffe_terminate_0(); */
void
-ffe_terminate_0 ()
+ffe_terminate_0 (void)
{
ffe_count_1 = 0;
ffe_in_0 = FALSE;
ffe_terminate_1(); */
void
-ffe_terminate_1 ()
+ffe_terminate_1 (void)
{
ffe_count_2 = 0;
ffe_in_1 = FALSE;
ffe_terminate_2(); */
void
-ffe_terminate_2 ()
+ffe_terminate_2 (void)
{
ffe_count_3 = 0;
ffe_in_2 = FALSE;
ffe_terminate_3(); */
void
-ffe_terminate_3 ()
+ffe_terminate_3 (void)
{
ffe_count_4 = 0;
ffe_in_3 = FALSE;
ffe_terminate_4(); */
void
-ffe_terminate_4 ()
+ffe_terminate_4 (void)
{
ffe_in_4 = FALSE;
/* where.c -- Implementation File (module.c template V1.0)
- Copyright (C) 1995, 2002 Free Software Foundation, Inc.
+ Copyright (C) 1995, 2002, 2003 Free Software Foundation, Inc.
Contributed by James Craig Burley.
This file is part of GNU Fortran.
/* Do initializations. */
void
-ffewhere_init_1 ()
+ffewhere_init_1 (void)
{
ffewhere_root_line_.first = ffewhere_root_line_.last
= (ffewhereLine) &ffewhere_root_line_.first;
OSDN Git Service
