/* Generate code from to output assembler insns as recognized from rtl.
- Copyright (C) 1987, 1988, 1992, 1994, 1995, 1997, 1998, 1999, 2000
- Free Software Foundation, Inc.
+ Copyright (C) 1987, 1988, 1992, 1994, 1995, 1997, 1998, 1999, 2000, 2002,
+ 2003 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
insn_data[24].template to be "clrd %0", and
insn_data[24].n_operands to be 1. */
\f
-#include "hconfig.h"
+#include "bconfig.h"
#include "system.h"
+#include "coretypes.h"
+#include "tm.h"
#include "rtl.h"
#include "errors.h"
#include "gensupport.h"
static void gen_peephole PARAMS ((rtx, int));
static void gen_expand PARAMS ((rtx, int));
static void gen_split PARAMS ((rtx, int));
+static void check_constraint_len PARAMS ((void));
+static int constraint_len PARAMS ((const char *, int));
\f
const char *
get_insn_name (index)
printf ("#include \"config.h\"\n");
printf ("#include \"system.h\"\n");
+ printf ("#include \"coretypes.h\"\n");
+ printf ("#include \"tm.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 \"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");
+ printf ("#include \"target.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 { const 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])
{
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");
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 (" \"");
while (*p)
{
- if (*p == '\n' && prev != '\\')
- printf ("\\n\\\n");
+ 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;
printf ("get_insn_name (code)\n");
printf (" int code;\n");
printf ("{\n");
- printf (" return insn_data[code].name;\n");
+ printf (" if (code == NOOP_MOVE_INSN_CODE)\n");
+ printf (" return \"NOOP_MOVE\";\n");
+ printf (" else\n");
+ printf (" return insn_data[code].name;\n");
printf ("}\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)
case MATCH_OP_DUP:
case MATCH_PAR_DUP:
++num_dups;
- return;
+ break;
case ADDRESS:
scan_operands (d, XEXP (part, 0), 1, 0);
struct data *d;
const char *template;
{
- register const char *cp;
- register int i;
+ const char *cp;
+ int i;
/* Templates starting with * contain straight code to be run. */
if (template[0] == '*')
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++;
if (i != d->n_alternatives)
{
message_with_line (d->lineno,
- "Wrong number of alternatives in the output template");
+ "wrong number of alternatives in the output template");
have_error = 1;
}
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. */
for (start = 0; start < d->n_operands; start++)
if (d->operand[start].n_alternatives > 0)
{
- if (n == 0)
+ int len, i;
+ const char *p;
+ char c;
+ int which_alternative = 0;
+ int alternative_count_unsure = 0;
+
+ for (p = d->operand[start].constraint; (c = *p); p += len)
+ {
+ len = CONSTRAINT_LEN (c, p);
+
+ if (len < 1 || (len > 1 && strchr (",#*+=&%!0123456789", c)))
+ {
+ message_with_line (d->lineno,
+ "invalid length %d for char '%c' in alternative %d of operand %d",
+ len, c, which_alternative, start);
+ len = 1;
+ have_error = 1;
+ }
+
+ if (c == ',')
+ {
+ which_alternative++;
+ continue;
+ }
+
+ for (i = 1; i < len; i++)
+ if (p[i] == '\0')
+ {
+ message_with_line (d->lineno,
+ "NUL in alternative %d of operand %d",
+ which_alternative, start);
+ alternative_count_unsure = 1;
+ break;
+ }
+ else if (strchr (",#*", p[i]))
+ {
+ message_with_line (d->lineno,
+ "'%c' in alternative %d of operand %d",
+ p[i], which_alternative, start);
+ alternative_count_unsure = 1;
+ }
+ }
+ if (alternative_count_unsure)
+ have_error = 1;
+ else if (n == 0)
n = d->operand[start].n_alternatives;
else if (n != d->operand[start].n_alternatives)
{
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->index_number = next_index_number;
d->n_operands = max_opno + 1;
d->n_dups = num_dups;
+ check_constraint_len ();
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.
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->index_number = next_index_number;
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,
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->index_number = next_index_number;
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->index_number = next_index_number;
progname = "genoutput";
if (argc <= 1)
- fatal ("No input file name.");
+ fatal ("no input file name");
- if (init_md_reader (argv[1]) != SUCCESS_EXIT_CODE)
+ if (init_md_reader_args (argc, argv) != SUCCESS_EXIT_CODE)
return (FATAL_EXIT_CODE);
output_prologue ();
*p = '\0';
return q;
}
+
+/* Verify that DEFAULT_CONSTRAINT_LEN is used properly and not
+ tampered with. This isn't bullet-proof, but it should catch
+ most genuine mistakes. */
+static void
+check_constraint_len ()
+{
+ const char *p;
+ int d;
+
+ for (p = ",#*+=&%!1234567890"; *p; p++)
+ for (d = -9; d < 9; d++)
+ if (constraint_len (p, d) != d)
+ abort ();
+}
+
+static int
+constraint_len (p, genoutput_default_constraint_len)
+ const char *p;
+ int genoutput_default_constraint_len;
+{
+ /* Check that we still match defaults.h . First we do a generation-time
+ check that fails if the value is not the expected one... */
+ if (DEFAULT_CONSTRAINT_LEN (*p, p) != 1)
+ abort ();
+ /* And now a comile-time check that should give a diagnostic if the
+ definition doesn't exactly match. */
+#define DEFAULT_CONSTRAINT_LEN(C,STR) 1
+ /* Now re-define DEFAULT_CONSTRAINT_LEN so that we can verify it is
+ being used. */
+#undef DEFAULT_CONSTRAINT_LEN
+#define DEFAULT_CONSTRAINT_LEN(C,STR) \
+ ((C) != *p || STR != p ? -1 : genoutput_default_constraint_len)
+ return CONSTRAINT_LEN (*p, p);
+ /* And set it back. */
+#undef DEFAULT_CONSTRAINT_LEN
+#define DEFAULT_CONSTRAINT_LEN(C,STR) 1
+}