#define obstack_chunk_free free
extern void free ();
+extern rtx read_rtx ();
static void fatal ();
void fancy_abort ();
{
rtx desc;
FILE *infile;
- extern rtx read_rtx ();
register int c;
struct attr_desc *attr;
struct attr_value *av;
#define obstack_chunk_free free
extern void free ();
+extern rtx read_rtx ();
/* flags to determine output of machine description dependent #define's. */
static int max_recog_operands;
{
rtx desc;
FILE *infile;
- extern rtx read_rtx ();
register int c;
obstack_init (rtl_obstack);
#define obstack_chunk_free free
extern void free ();
+extern rtx read_rtx ();
char *xmalloc ();
static void fatal ();
{
rtx desc;
FILE *infile;
- extern rtx read_rtx ();
register int c;
obstack_init (rtl_obstack);
#define obstack_chunk_free free
extern void free ();
+extern rtx read_rtx ();
/* This structure contains all the information needed to describe one
set of extractions methods. Each method may be used by more than
{
rtx desc;
FILE *infile;
- extern rtx read_rtx ();
register int c, i;
struct extraction *p;
struct code_ptr *link;
#define obstack_chunk_free free
extern void free ();
+extern rtx read_rtx ();
char *xmalloc ();
static void fatal ();
{
rtx desc;
FILE *infile;
- extern rtx read_rtx ();
register int c;
obstack_init (rtl_obstack);
#define obstack_chunk_free free
extern void free ();
+extern rtx read_rtx ();
/* While tree-walking an instruction pattern, we keep a chain
of these `struct link's to record how to get down to the
{
rtx desc;
FILE *infile;
- extern rtx read_rtx ();
register int c;
max_opno = -1;
#define obstack_chunk_free free
extern void free ();
+extern rtx read_rtx ();
/* Data structure for a listhead of decision trees. The alternatives
to a node are kept in a doublely-linked list so we can easily add nodes
struct decision_head recog_tree;
struct decision_head split_tree;
FILE *infile;
- extern rtx read_rtx ();
register int c;
obstack_init (rtl_obstack);