/* Generate code from to output assembler insns as recognized from rtl.
- Copyright (C) 1987, 88, 92, 94-95, 97-98, 1999
+ Copyright (C) 1987, 1988, 1992, 1994, 1995, 1997, 1998, 1999, 2000
Free Software Foundation, Inc.
-This file is part of GNU CC.
+This file is part of GCC.
-GNU CC is free software; you can redistribute it and/or modify
-it under the terms of the GNU General Public License as published by
-the Free Software Foundation; either version 2, or (at your option)
-any later version.
+GCC is free software; you can redistribute it and/or modify it under
+the terms of the GNU General Public License as published by the Free
+Software Foundation; either version 2, or (at your option) any later
+version.
-GNU CC is distributed in the hope that it will be useful,
-but WITHOUT ANY WARRANTY; without even the implied warranty of
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-GNU General Public License for more details.
+GCC is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+for more details.
You should have received a copy of the GNU General Public License
-along with GNU CC; see the file COPYING. If not, write to
-the Free Software Foundation, 59 Temple Place - Suite 330,
-Boston, MA 02111-1307, USA. */
+along with GCC; see the file COPYING. If not, write to the Free
+Software Foundation, 59 Temple Place - Suite 330, Boston, MA
+02111-1307, USA. */
/* This program reads the machine description for the compiler target machine
e. `strict_low', is nonzero for operands contained in a STRICT_LOW_PART.
+ f. `eliminable', is nonzero for operands that are matched normally by
+ MATCH_OPERAND; it is zero for operands that should not be changed during
+ register elimination such as MATCH_OPERATORs.
+
The code number of an insn is simply its position in the machine
description; code numbers are assigned sequentially to entries in
the description, starting with code number 0.
#include "hconfig.h"
#include "system.h"
#include "rtl.h"
-#include "obstack.h"
#include "errors.h"
+#include "gensupport.h"
/* No instruction can have more operands than this. Sorry for this
arbitrary limit, but what machine will have an instruction with
#define MAX_MAX_OPERANDS 40
-static struct obstack obstack;
-struct obstack *rtl_obstack = &obstack;
-
-#define obstack_chunk_alloc xmalloc
-#define obstack_chunk_free free
-
-static int n_occurrences PROTO((int, char *));
+static int n_occurrences PARAMS ((int, const char *));
+static const char *strip_whitespace PARAMS ((const char *));
/* insns in the machine description are assigned sequential code numbers
that are used by insn-recog.c (produced by genrecog) to communicate
{
struct operand_data *next;
int index;
- char *predicate;
- char *constraint;
+ const char *predicate;
+ const char *constraint;
enum machine_mode mode;
unsigned char n_alternatives;
char address_p;
char strict_low;
+ char eliminable;
char seen;
};
static struct operand_data null_operand =
{
- 0, 0, "", "", VOIDmode, 0, 0, 0, 0
+ 0, 0, "", "", VOIDmode, 0, 0, 0, 0, 0
};
static struct operand_data *odata = &null_operand;
struct data
{
struct data *next;
- char *name;
- char *template;
+ const char *name;
+ const char *template;
int code_number;
int index_number;
+ int lineno;
int n_operands; /* Number of operands this insn recognizes */
int n_dups; /* Number times match_dup appears in pattern */
int n_alternatives; /* Number of alternatives in each constraint */
/* This variable points to the first link in the insn chain. */
static struct data *idata, **idata_end = &idata;
-
-/* Nonzero if any match_operand has a constraint string; implies that
- REGISTER_CONSTRAINTS will be defined for this machine description. */
-
-static int have_constraints;
-
\f
-static void output_prologue PROTO((void));
-static void output_predicate_decls PROTO((void));
-static void output_operand_data PROTO((void));
-static void output_insn_data PROTO((void));
-static void output_get_insn_name PROTO((void));
-static void scan_operands PROTO((struct data *, rtx, int, int));
-static int compare_operands PROTO((struct operand_data *,
+static void output_prologue PARAMS ((void));
+static void output_predicate_decls PARAMS ((void));
+static void output_operand_data PARAMS ((void));
+static void output_insn_data PARAMS ((void));
+static void output_get_insn_name PARAMS ((void));
+static void scan_operands PARAMS ((struct data *, rtx, int, int));
+static int compare_operands PARAMS ((struct operand_data *,
struct operand_data *));
-static void place_operands PROTO((struct data *));
-static void process_template PROTO((struct data *, char *));
-static void validate_insn_alternatives PROTO((struct data *));
-static void gen_insn PROTO((rtx));
-static void gen_peephole PROTO((rtx));
-static void gen_expand PROTO((rtx));
-static void gen_split PROTO((rtx));
-static int n_occurrences PROTO((int, char *));
+static void place_operands PARAMS ((struct data *));
+static void process_template PARAMS ((struct data *, const char *));
+static void validate_insn_alternatives PARAMS ((struct data *));
+static void validate_insn_operands PARAMS ((struct data *));
+static void gen_insn PARAMS ((rtx, int));
+static void gen_peephole PARAMS ((rtx, int));
+static void gen_expand PARAMS ((rtx, int));
+static void gen_split PARAMS ((rtx, int));
\f
const char *
get_insn_name (index)
output_prologue ()
{
printf ("/* Generated automatically by the program `genoutput'\n\
-from the machine description file `md'. */\n\n");
+ from the machine description file `md'. */\n\n");
- printf ("#define NO_MD_PROTOTYPES\n");
printf ("#include \"config.h\"\n");
printf ("#include \"system.h\"\n");
printf ("#include \"flags.h\"\n");
+ printf ("#include \"ggc.h\"\n");
printf ("#include \"rtl.h\"\n");
+ printf ("#include \"expr.h\"\n");
+ printf ("#include \"insn-codes.h\"\n");
+ printf ("#include \"tm_p.h\"\n");
printf ("#include \"function.h\"\n");
printf ("#include \"regs.h\"\n");
printf ("#include \"hard-reg-set.h\"\n");
printf ("#include \"real.h\"\n");
printf ("#include \"insn-config.h\"\n\n");
printf ("#include \"conditions.h\"\n");
- printf ("#include \"insn-flags.h\"\n");
printf ("#include \"insn-attr.h\"\n\n");
- printf ("#include \"insn-codes.h\"\n\n");
printf ("#include \"recog.h\"\n\n");
-
+ printf ("#include \"toplev.h\"\n");
printf ("#include \"output.h\"\n");
}
/* We need to define all predicates used. Keep a list of those we
have defined so far. There normally aren't very many predicates
used, so a linked list should be fast enough. */
+struct predicate { const char *name; struct predicate *next; };
static void
output_predicate_decls ()
{
- struct predicate { char *name; struct predicate *next; } *predicates = 0;
- register struct operand_data *d;
- struct predicate *p;
+ struct predicate *predicates = 0;
+ struct operand_data *d;
+ struct predicate *p, *next;
for (d = odata; d; d = d->next)
if (d->predicate && d->predicate[0])
if (p == 0)
{
- printf ("extern int %s PROTO ((rtx, enum machine_mode));\n",
+ printf ("extern int %s PARAMS ((rtx, enum machine_mode));\n",
d->predicate);
- p = (struct predicate *) alloca (sizeof (struct predicate));
+ p = (struct predicate *) xmalloc (sizeof (struct predicate));
p->name = d->predicate;
p->next = predicates;
predicates = p;
}
printf ("\n\n");
+ for (p = predicates; p; p = next)
+ {
+ next = p->next;
+ free (p);
+ }
}
static void
output_operand_data ()
{
- register struct operand_data *d;
+ struct operand_data *d;
printf ("\nstatic const struct insn_operand_data operand_data[] = \n{\n");
printf (" %s,\n",
d->predicate && d->predicate[0] ? d->predicate : "0");
- if (have_constraints)
- {
- printf (" \"%s\",\n",
- d->constraint ? d->constraint : "");
- }
+ printf (" \"%s\",\n", d->constraint ? d->constraint : "");
printf (" %smode,\n", GET_MODE_NAME (d->mode));
- if (! have_constraints)
- printf (" %d,\n", d->address_p);
+ printf (" %d,\n", d->strict_low);
- printf (" %d\n", d->strict_low);
+ printf (" %d\n", d->eliminable);
printf(" },\n");
}
static void
output_insn_data ()
{
- register struct data *d;
+ struct data *d;
int name_offset = 0;
int next_name_offset;
const char * last_name = 0;
const char * next_name = 0;
- register struct data *n;
+ struct data *n;
for (n = idata, next_name_offset = 1; n; n = n->next, next_name_offset++)
if (n->name)
printf (" 0,\n");
break;
case INSN_OUTPUT_FORMAT_SINGLE:
- printf (" \"%s\",\n", d->template);
+ {
+ const char *p = d->template;
+ char prev = 0;
+
+ printf (" \"");
+ while (*p)
+ {
+ if (IS_VSPACE (*p) && prev != '\\')
+ {
+ /* Preserve two consecutive \n's or \r's, but treat \r\n
+ as a single newline. */
+ if (*p == '\n' && prev != '\r')
+ printf ("\\n\\\n");
+ }
+ else
+ putchar (*p);
+ prev = *p;
+ ++p;
+ }
+ printf ("\",\n");
+ }
break;
case INSN_OUTPUT_FORMAT_MULTI:
case INSN_OUTPUT_FORMAT_FUNCTION:
- printf (" output_%d,\n", d->code_number);
+ printf (" (const PTR) output_%d,\n", d->code_number);
break;
default:
abort ();
}
if (d->name && d->name[0] != '*')
- printf (" gen_%s,\n", d->name);
+ printf (" (insn_gen_fn) gen_%s,\n", d->name);
else
printf (" 0,\n");
int this_address_p;
int this_strict_low;
{
- register int i, j;
- register const char *format_ptr;
+ int i, j;
+ const char *format_ptr;
int opno;
if (part == 0)
max_opno = opno;
if (max_opno >= MAX_MAX_OPERANDS)
{
- error ("Too many operands (%d) in definition %s.\n",
- max_opno + 1, get_insn_name (next_index_number));
+ message_with_line (d->lineno,
+ "maximum number of operands exceeded");
+ have_error = 1;
return;
}
if (d->operand[opno].seen)
- error ("Definition %s specified operand number %d more than once.\n",
- get_insn_name (next_index_number), opno);
+ {
+ message_with_line (d->lineno,
+ "repeated operand number %d\n", opno);
+ have_error = 1;
+ }
+
d->operand[opno].seen = 1;
d->operand[opno].mode = GET_MODE (part);
d->operand[opno].strict_low = this_strict_low;
d->operand[opno].predicate = XSTR (part, 1);
- d->operand[opno].constraint = XSTR (part, 2);
- if (XSTR (part, 2) != 0 && *XSTR (part, 2) != 0)
- {
- d->operand[opno].n_alternatives
- = n_occurrences (',', XSTR (part, 2)) + 1;
- have_constraints = 1;
- }
+ d->operand[opno].constraint = strip_whitespace (XSTR (part, 2));
+ d->operand[opno].n_alternatives
+ = n_occurrences (',', d->operand[opno].constraint) + 1;
d->operand[opno].address_p = this_address_p;
+ d->operand[opno].eliminable = 1;
return;
case MATCH_SCRATCH:
max_opno = opno;
if (max_opno >= MAX_MAX_OPERANDS)
{
- error ("Too many operands (%d) in definition %s.\n",
- max_opno + 1, get_insn_name (next_index_number));
+ message_with_line (d->lineno,
+ "maximum number of operands exceeded");
+ have_error = 1;
return;
}
if (d->operand[opno].seen)
- error ("Definition %s specified operand number %d more than once.\n",
- get_insn_name (next_index_number), opno);
+ {
+ message_with_line (d->lineno,
+ "repeated operand number %d\n", opno);
+ have_error = 1;
+ }
+
d->operand[opno].seen = 1;
d->operand[opno].mode = GET_MODE (part);
d->operand[opno].strict_low = 0;
d->operand[opno].predicate = "scratch_operand";
- d->operand[opno].constraint = XSTR (part, 1);
- if (XSTR (part, 1) != 0 && *XSTR (part, 1) != 0)
- {
- d->operand[opno].n_alternatives
- = n_occurrences (',', XSTR (part, 1)) + 1;
- have_constraints = 1;
- }
+ d->operand[opno].constraint = strip_whitespace (XSTR (part, 1));
+ d->operand[opno].n_alternatives
+ = n_occurrences (',', d->operand[opno].constraint) + 1;
d->operand[opno].address_p = 0;
+ d->operand[opno].eliminable = 0;
return;
case MATCH_OPERATOR:
max_opno = opno;
if (max_opno >= MAX_MAX_OPERANDS)
{
- error ("Too many operands (%d) in definition %s.\n",
- max_opno + 1, get_insn_name (next_index_number));
+ message_with_line (d->lineno,
+ "maximum number of operands exceeded");
+ have_error = 1;
return;
}
if (d->operand[opno].seen)
- error ("Definition %s specified operand number %d more than once.\n",
- get_insn_name (next_index_number), opno);
+ {
+ message_with_line (d->lineno,
+ "repeated operand number %d\n", opno);
+ have_error = 1;
+ }
+
d->operand[opno].seen = 1;
d->operand[opno].mode = GET_MODE (part);
d->operand[opno].strict_low = 0;
d->operand[opno].predicate = XSTR (part, 1);
d->operand[opno].constraint = 0;
d->operand[opno].address_p = 0;
+ d->operand[opno].eliminable = 0;
for (i = 0; i < XVECLEN (part, 2); i++)
scan_operands (d, XVECEXP (part, 2, i), 0, 0);
return;
case MATCH_OP_DUP:
case MATCH_PAR_DUP:
++num_dups;
- return;
+ break;
case ADDRESS:
scan_operands (d, XEXP (part, 0), 1, 0);
compare_operands (d0, d1)
struct operand_data *d0, *d1;
{
- char *p0, *p1;
+ const char *p0, *p1;
p0 = d0->predicate;
if (!p0)
if (strcmp (p0, p1) != 0)
return 0;
- if (have_constraints)
- {
- p0 = d0->constraint;
- if (!p0)
- p0 = "";
- p1 = d1->constraint;
- if (!p1)
- p1 = "";
- if (strcmp (p0, p1) != 0)
- return 0;
- }
+ p0 = d0->constraint;
+ if (!p0)
+ p0 = "";
+ p1 = d1->constraint;
+ if (!p1)
+ p1 = "";
+ if (strcmp (p0, p1) != 0)
+ return 0;
if (d0->mode != d1->mode)
return 0;
- if (!have_constraints)
- if (d0->address_p != d1->address_p)
- return 0;
-
if (d0->strict_low != d1->strict_low)
return 0;
+ if (d0->eliminable != d1->eliminable)
+ return 0;
+
return 1;
}
static void
process_template (d, template)
struct data *d;
- char *template;
+ const char *template;
{
- register char *cp;
- register int i;
+ const char *cp;
+ int i;
/* Templates starting with * contain straight code to be run. */
if (template[0] == '*')
d->template = 0;
d->output_format = INSN_OUTPUT_FORMAT_FUNCTION;
- printf ("\nstatic const char *output_%d PROTO ((rtx *, rtx));\n",
+ printf ("\nstatic const char *output_%d PARAMS ((rtx *, rtx));\n",
d->code_number);
puts ("\nstatic const char *");
printf ("output_%d (operands, insn)\n", d->code_number);
for (i = 0, cp = &template[1]; *cp; )
{
- while (*cp == '\n' || *cp == ' ' || *cp== '\t')
+ while (ISSPACE (*cp))
cp++;
printf (" \"");
- while (*cp != '\n' && *cp != '\0')
+ while (!IS_VSPACE (*cp) && *cp != '\0')
{
putchar (*cp);
cp++;
printf ("\",\n");
i++;
}
+ if (i == 1)
+ message_with_line (d->lineno,
+ "'@' is redundant for output template with single alternative");
+ if (i != d->n_alternatives)
+ {
+ message_with_line (d->lineno,
+ "wrong number of alternatives in the output template");
+ have_error = 1;
+ }
printf ("};\n");
}
validate_insn_alternatives (d)
struct data *d;
{
- register int n = 0, start;
+ int n = 0, start;
/* Make sure all the operands have the same number of alternatives
in their constraints. Let N be that number. */
if (n == 0)
n = d->operand[start].n_alternatives;
else if (n != d->operand[start].n_alternatives)
- error ("wrong number of alternatives in operand %d of insn %s",
- start, get_insn_name (d->index_number));
+ {
+ message_with_line (d->lineno,
+ "wrong number of alternatives in operand %d",
+ start);
+ have_error = 1;
+ }
}
/* Record the insn's overall number of alternatives. */
d->n_alternatives = n;
}
+
+/* Verify that there are no gaps in operand numbers for INSNs. */
+
+static void
+validate_insn_operands (d)
+ struct data *d;
+{
+ int i;
+
+ for (i = 0; i < d->n_operands; ++i)
+ if (d->operand[i].seen == 0)
+ {
+ message_with_line (d->lineno, "missing operand %d", i);
+ have_error = 1;
+ }
+}
\f
/* Look at a define_insn just read. Assign its code number. Record
on idata the template and the number of arguments. If the insn has
a hairy output action, output a function for now. */
static void
-gen_insn (insn)
+gen_insn (insn, lineno)
rtx insn;
+ int lineno;
{
- register struct data *d = (struct data *) xmalloc (sizeof (struct data));
- register int i;
+ struct data *d = (struct data *) xmalloc (sizeof (struct data));
+ int i;
- d->code_number = next_code_number++;
+ d->code_number = next_code_number;
d->index_number = next_index_number;
+ d->lineno = lineno;
if (XSTR (insn, 0)[0])
d->name = XSTR (insn, 0);
else
d->n_operands = max_opno + 1;
d->n_dups = num_dups;
+ validate_insn_operands (d);
validate_insn_alternatives (d);
place_operands (d);
- process_template (d, XSTR (insn, 3));
+ process_template (d, XTMPL (insn, 3));
}
\f
/* Look at a define_peephole just read. Assign its code number.
If the insn has a hairy output action, output it now. */
static void
-gen_peephole (peep)
+gen_peephole (peep, lineno)
rtx peep;
+ int lineno;
{
- register struct data *d = (struct data *) xmalloc (sizeof (struct data));
- register int i;
+ struct data *d = (struct data *) xmalloc (sizeof (struct data));
+ int i;
- d->code_number = next_code_number++;
+ d->code_number = next_code_number;
d->index_number = next_index_number;
+ d->lineno = lineno;
d->name = 0;
/* Build up the list in the same order as the insns are seen
validate_insn_alternatives (d);
place_operands (d);
- process_template (d, XSTR (peep, 2));
+ process_template (d, XTMPL (peep, 2));
}
\f
/* Process a define_expand just read. Assign its code number,
only for the purposes of `insn_gen_function'. */
static void
-gen_expand (insn)
+gen_expand (insn, lineno)
rtx insn;
+ int lineno;
{
- register struct data *d = (struct data *) xmalloc (sizeof (struct data));
- register int i;
+ struct data *d = (struct data *) xmalloc (sizeof (struct data));
+ int i;
- d->code_number = next_code_number++;
+ d->code_number = next_code_number;
d->index_number = next_index_number;
+ d->lineno = lineno;
if (XSTR (insn, 0)[0])
d->name = XSTR (insn, 0);
else
only for reasons of consistency and to simplify genrecog. */
static void
-gen_split (split)
+gen_split (split, lineno)
rtx split;
+ int lineno;
{
- register struct data *d = (struct data *) xmalloc (sizeof (struct data));
- register int i;
+ struct data *d = (struct data *) xmalloc (sizeof (struct data));
+ int i;
- d->code_number = next_code_number++;
+ d->code_number = next_code_number;
d->index_number = next_index_number;
+ d->lineno = lineno;
d->name = 0;
/* Build up the list in the same order as the insns are seen
place_operands (d);
}
-\f
-PTR
-xmalloc (size)
- size_t size;
-{
- register PTR val = (PTR) malloc (size);
-
- if (val == 0)
- fatal ("virtual memory exhausted");
- return val;
-}
-PTR
-xrealloc (old, size)
- PTR old;
- size_t size;
-{
- register PTR ptr;
- if (old)
- ptr = (PTR) realloc (old, size);
- else
- ptr = (PTR) malloc (size);
- if (!ptr)
- fatal ("virtual memory exhausted");
- return ptr;
-}
+extern int main PARAMS ((int, char **));
int
main (argc, argv)
char **argv;
{
rtx desc;
- FILE *infile;
- register int c;
progname = "genoutput";
- obstack_init (rtl_obstack);
if (argc <= 1)
- fatal ("No input file name.");
+ fatal ("no input file name");
- infile = fopen (argv[1], "r");
- if (infile == 0)
- {
- perror (argv[1]);
- exit (FATAL_EXIT_CODE);
- }
+ if (init_md_reader_args (argc, argv) != SUCCESS_EXIT_CODE)
+ return (FATAL_EXIT_CODE);
output_prologue ();
next_code_number = 0;
next_index_number = 0;
- have_constraints = 0;
/* Read the machine description. */
while (1)
{
- c = read_skip_spaces (infile);
- if (c == EOF)
+ int line_no;
+
+ desc = read_md_rtx (&line_no, &next_code_number);
+ if (desc == NULL)
break;
- ungetc (c, infile);
- desc = read_rtx (infile);
if (GET_CODE (desc) == DEFINE_INSN)
- gen_insn (desc);
+ gen_insn (desc, line_no);
if (GET_CODE (desc) == DEFINE_PEEPHOLE)
- gen_peephole (desc);
+ gen_peephole (desc, line_no);
if (GET_CODE (desc) == DEFINE_EXPAND)
- gen_expand (desc);
+ gen_expand (desc, line_no);
if (GET_CODE (desc) == DEFINE_SPLIT
|| GET_CODE (desc) == DEFINE_PEEPHOLE2)
- gen_split (desc);
+ gen_split (desc, line_no);
next_index_number++;
}
output_get_insn_name ();
fflush (stdout);
- exit (ferror (stdout) != 0 || have_error
+ return (ferror (stdout) != 0 || have_error
? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
-
- /* NOTREACHED */
- return 0;
}
+/* Return the number of occurrences of character C in string S or
+ -1 if S is the null string. */
+
static int
n_occurrences (c, s)
int c;
- char *s;
+ const char *s;
{
int n = 0;
+
+ if (s == 0 || *s == '\0')
+ return -1;
+
while (*s)
n += (*s++ == c);
+
return n;
}
+
+/* Remove whitespace in `s' by moving up characters until the end.
+ Return a new string. */
+
+static const char *
+strip_whitespace (s)
+ const char *s;
+{
+ char *p, *q;
+ char ch;
+
+ if (s == 0)
+ return 0;
+
+ p = q = xmalloc (strlen (s) + 1);
+ while ((ch = *s++) != '\0')
+ if (! ISSPACE (ch))
+ *p++ = ch;
+
+ *p = '\0';
+ return q;
+}
OSDN Git Service
