Replace insn_foo with insn_data.foo.

git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@29358 138bc75d-0d04-0410-961f-82ee72b054a4

1 files changed, 409 insertions, 410 deletions

diff --git a/gcc/genoutput.c b/gcc/genoutput.c
index 87c8b98a70a..9c44d7e6475 100644
--- a/gcc/genoutput.c
+++ b/gcc/genoutput.c
@@ -1,5 +1,6 @@
 /* Generate code from to output assembler insns as recognized from rtl.
-   Copyright (C) 1987, 88, 92, 94-95, 97-98, 1999 Free Software Foundation, Inc.
+   Copyright (C) 1987, 88, 92, 94-95, 97-98, 1999
+   Free Software Foundation, Inc.
 
 This file is part of GNU CC.
 
@@ -22,62 +23,56 @@ Boston, MA 02111-1307, USA.  */
 /* This program reads the machine description for the compiler target machine
    and produces a file containing these things:
 
-   1. An array of strings `insn_template' which is indexed by insn code number
-   and contains the template for output of that insn,
+   1. An array of `struct insn_data', which is indexed by insn code number,
+   which contains:
 
-   2. An array of functions `insn_outfun' which, indexed by the insn code
-   number, gives the function that returns a template to use for output of
-   that insn.  This is used only in the cases where the template is not
-   constant.  These cases are specified by a * or @ at the beginning of the
-   template string in the machine description.  They are identified for the
-   sake of other parts of the compiler by a zero element in `insn_template'.
+     a. `name' is the name for that pattern.  Nameless patterns are
+     given a name.
+
+     b. `template' is the template for output of that insn,
+
+     c. `outfun' is the function that returns a template to use for output of
+     that insn.  This is used only in the cases where the template is not
+     constant.  These cases are specified by a * or @ at the beginning of the
+     template string in the machine description.  They are identified for the
+     sake of other parts of the compiler by a zero element in `template'.
   
-   3. An array of functions `insn_gen_function' which, indexed
-   by insn code number, gives the function to generate a body
-   for that pattern, given operands as arguments.
+     d. `genfun' is the function to generate a body for that pattern,
+     given operands as arguments.
+
+     e. `n_operands' is the number of distinct operands in the pattern
+     for that insn,
 
-   4. An array of strings `insn_name' which, indexed by insn code number,
-   gives the name for that pattern.  Nameless patterns are given a name.
+     f. `n_dups' is the number of match_dup's that appear in the insn's
+     pattern.  This says how many elements of `recog_data.dup_loc' are
+     significant after an insn has been recognized.
 
-   5. An array of ints `insn_n_operands' which is indexed by insn code number
-   and contains the number of distinct operands in the pattern for that insn,
+     g. `n_alternatives' is the number of alternatives in the constraints
+     of each pattern.
 
-   6. An array of ints `insn_n_dups' which is indexed by insn code number
-   and contains the number of match_dup's that appear in the insn's pattern.
-   This says how many elements of `recog_data.dup_loc' are significant
-   after an insn has been recognized.
+     h. `operand' is the base of an array of operand data for the insn.
 
-   7. An array of arrays of operand constraint strings,
-   `insn_operand_constraint',
-   indexed first by insn code number and second by operand number,
-   containing the constraint for that operand.
+   2. An array of `struct insn_operand data', used by `operand' above.
 
-   This array is generated only if register constraints appear in 
-   match_operand rtx's.
+     a. `predicate', an int-valued function, is the match_operand predicate
+     for this operand.
 
-   8. An array of arrays of chars which indicate which operands of
-   which insn patterns appear within ADDRESS rtx's.  This array is
-   called `insn_operand_address_p' and is generated only if there
-   are *no* register constraints in the match_operand rtx's.
+     b. `constraint' is the constraint for this operand.  This exists
+     only if register constraints appear in match_operand rtx's.
 
-   9. An array of arrays of machine modes, `insn_operand_mode',
-   indexed first by insn code number and second by operand number,
-   containing the machine mode that that operand is supposed to have.
-   Also `insn_operand_strict_low', which is nonzero for operands
-   contained in a STRICT_LOW_PART.
+     c. `address_p' indicates that the operand appears within ADDRESS
+     rtx's.  This exists only if there are *no* register constraints
+     in the match_operand rtx's.
 
-   10. An array of arrays of int-valued functions, `insn_operand_predicate',
-   indexed first by insn code number and second by operand number,
-   containing the match_operand predicate for this operand.
+     d. `mode' is the machine mode that that operand is supposed to have.
 
-   11. An array of ints, `insn_n_alternatives', that gives the number
-   of alternatives in the constraints of each pattern.
+     e. `strict_low', is nonzero for operands contained in a STRICT_LOW_PART.
 
-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.
+  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.
 
-Thus, the following entry in the machine description
+  Thus, the following entry in the machine description
 
     (define_insn "clrdf"
       [(set (match_operand:DF 0 "general_operand" "")
@@ -85,10 +80,9 @@ Thus, the following entry in the machine description
       ""
       "clrd %0")
 
-assuming it is the 25th entry present, would cause
-insn_template[24] to be "clrd %0", and insn_n_operands[24] to be 1.
-It would not make an case in output_insn_hairy because the template
-given in the entry is a constant (it does not start with `*').  */
+  assuming it is the 25th entry present, would cause
+  insn_data[24].template to be "clrd %0", and
+  insn_data[24].n_operands to be 1.  */
 
 #include "hconfig.h"
 #include "system.h"
@@ -96,9 +90,9 @@ given in the entry is a constant (it does not start with `*').  */
 #include "obstack.h"
 #include "errors.h"
 
-/* No instruction can have more operands than this.
-   Sorry for this arbitrary limit, but what machine will
-   have an instruction with this many operands?  */
+/* No instruction can have more operands than this.  Sorry for this
+   arbitrary limit, but what machine will have an instruction with
+   this many operands?  */
 
 #define MAX_MAX_OPERANDS 40
 
@@ -110,9 +104,6 @@ struct obstack *rtl_obstack = &obstack;
 
 static int n_occurrences PROTO((int, char *));
 
-/* Define this so we can link with print-rtl.o to get debug_rtx function.  */
-char **insn_name_ptr = 0;
-
 /* insns in the machine description are assigned sequential code numbers
    that are used by insn-recog.c (produced by genrecog) to communicate
    to insn-output.c (produced by this program).  */
@@ -124,49 +115,73 @@ static int next_code_number;
 
 static int next_index_number;
 
+/* This counts all operands used in the md file.  The first is null.  */
+
+static int next_operand_number = 1;
+
+/* Record in this chain all information about the operands we will output.  */
+
+struct operand_data
+{
+  struct operand_data *next;
+  int index;
+  char *predicate;
+  char *constraint;
+  enum machine_mode mode;
+  unsigned char n_alternatives;
+  char address_p;
+  char strict_low;
+  char seen;
+};
+
+/* Begin with a null operand at index 0.  */
+
+static struct operand_data null_operand =
+{
+  0, 0, "", "", VOIDmode, 0, 0, 0, 0
+};
+
+static struct operand_data *odata = &null_operand;
+static struct operand_data **odata_end = &null_operand.next;
+
 /* Record in this chain all information that we will output,
    associated with the code number of the insn.  */
 
 struct data
 {
-  int code_number;
-  int index_number;
+  struct data *next;
   char *name;
   char *template;		/* string such as "movl %1,%0" */
+  int code_number;
+  int index_number;
   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 */
-  struct data *next;
-  char *constraints[MAX_MAX_OPERANDS];
-  /* Number of alternatives in constraints of operand N.  */
-  int op_n_alternatives[MAX_MAX_OPERANDS];
-  char *predicates[MAX_MAX_OPERANDS];
-  char address_p[MAX_MAX_OPERANDS];
-  enum machine_mode modes[MAX_MAX_OPERANDS];
-  char strict_low[MAX_MAX_OPERANDS];
   char outfun;			/* Nonzero means this has an output function */
+  int operand_number;		/* Operand index in the big array.  */
+  struct operand_data operand[MAX_MAX_OPERANDS];
 };
 
-/* This variable points to the first link in the chain.  */
-
-struct data *insn_data;
+/* This variable points to the first link in the insn chain.  */
 
-/* Pointer to the last link in the chain, so new elements
-   can be added at the end.  */
+static struct data *idata, **idata_end = &idata;
 
-struct data *end_of_insn_data;
+/* Nonzero if any match_operand has a constraint string; implies that
+   REGISTER_CONSTRAINTS will be defined for this machine description.  */
 
-/* Nonzero if any match_operand has a constraint string;
-   implies that REGISTER_CONSTRAINTS will be defined
-   for this machine description.  */
-
-int have_constraints;
+static int have_constraints;
 
 
 static char * name_for_index PROTO((int));
 static void output_prologue PROTO((void));
-static void output_epilogue PROTO((void));
-static void scan_operands PROTO((rtx, int, int));
+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 *,
+				   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));
@@ -175,14 +190,14 @@ static void gen_expand PROTO((rtx));
 static void gen_split PROTO((rtx));
 static int n_occurrences PROTO((int, char *));
 
-static char *
-name_for_index (index)
+const char *
+get_insn_name (index)
      int index;
 {
   static char buf[100];
 
   struct data *i, *last_named = NULL;
-  for (i = insn_data; i ; i = i->next)
+  for (i = idata; i ; i = i->next)
     {
       if (i->index_number == index)
 	return i->name;
@@ -204,6 +219,7 @@ output_prologue ()
   printf ("/* Generated automatically by the program `genoutput'\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");
@@ -222,224 +238,171 @@ from the machine description file `md'.  */\n\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.  */
+
 static void
-output_epilogue ()
+output_predicate_decls ()
 {
-  register struct data *d;
+  struct predicate { char *name; struct predicate *next; } *predicates = 0;
+  register struct operand_data *d;
+  struct predicate *p;
 
-  printf ("\nconst char * const insn_template[] =\n  {\n");
-  for (d = insn_data; d; d = d->next)
-    {
-      if (d->template)
-	printf ("    \"%s\",\n", d->template);
-      else
-	printf ("    0,\n");
-    }
-  printf ("  };\n");
+  for (d = odata; d; d = d->next)
+    if (d->predicate && d->predicate[0])
+      {
+	for (p = predicates; p; p = p->next)
+	  if (strcmp (p->name, d->predicate) == 0)
+	    break;
 
-  printf ("\nconst char *(*const insn_outfun[]) PROTO((rtx *, rtx)) =\n  {\n");
-  for (d = insn_data; d; d = d->next)
-    {
-      if (d->outfun)
-	printf ("    output_%d,\n", d->code_number);
-      else
-	printf ("    0,\n");
-    }
-  printf ("  };\n");
+	if (p == 0)
+	  {
+	    printf ("extern int %s PROTO ((rtx, enum machine_mode));\n",
+		    d->predicate);
+	    p = (struct predicate *) alloca (sizeof (struct predicate));
+	    p->name = d->predicate;
+	    p->next = predicates;
+	    predicates = p;
+	  }
+      }
+
+  printf ("\n\n");
+}
 
-  printf ("\nrtx (*const insn_gen_function[]) () =\n  {\n");
-  for (d = insn_data; d; d = d->next)
+static void
+output_operand_data ()
+{
+  register struct operand_data *d;
+
+  printf ("\nstatic const struct insn_operand_data operand_data[] = \n{\n");
+
+  for (d = odata; d; d = d->next)
     {
-      if (d->name && d->name[0] != '*')
-	printf ("    gen_%s,\n", d->name);
-      else
-	printf ("    0,\n");
-    }
-  printf ("  };\n");
-
-  printf ("\nconst char *insn_name[] =\n  {\n");
-  {
-    int offset = 0;
-    int next;
-    char * last_name = 0;
-    char * next_name = 0;
-    register struct data *n;
-
-    for (n = insn_data, next = 1; n; n = n->next, next++)
-      if (n->name)
+      printf ("  {\n");
+
+      printf ("    %s,\n",
+	      d->predicate && d->predicate[0] ? d->predicate : "0");
+
+      if (have_constraints)
 	{
-	  next_name = n->name;
-	  break;
+	  printf ("    \"%s\",\n",
+		  d->constraint ? d->constraint : "");
 	}
 
-    for (d = insn_data; d; d = d->next)
+      printf ("    %smode,\n", GET_MODE_NAME (d->mode));
+
+      if (! have_constraints)
+	printf ("    %d,\n", d->address_p);
+
+      printf ("    %d\n", d->strict_low);
+
+      printf("  },\n");
+    }
+  printf("};\n\n\n");
+}
+
+static void
+output_insn_data ()
+{
+  register 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;
+
+  for (n = idata, next_name_offset = 1; n; n = n->next, next_name_offset++)
+    if (n->name)
       {
-	if (d->name)
-	  {
-	    printf ("    \"%s\",\n", d->name);
-	    offset = 0;
-	    last_name = d->name;
-	    next_name = 0;
-	    for (n = d->next, next = 1; n; n = n->next, next++)
-	      if (n->name)
-		{
-		  next_name = n->name;
-		  break;
-		}
-	  }
-	else
-	  {
-	    offset++;
-	    if (next_name && (last_name == 0 || offset > next / 2))
-	      printf ("    \"%s-%d\",\n", next_name, next - offset);
-	    else
-	      printf ("    \"%s+%d\",\n", last_name, offset);
-	  }
+	next_name = n->name;
+	break;
       }
-  }
-  printf ("  };\n");
-  printf ("const char **insn_name_ptr = insn_name;\n");
-
-  printf ("\nconst int insn_n_operands[] =\n  {\n");
-  for (d = insn_data; d; d = d->next)
-    printf ("    %d,\n", d->n_operands);
-  printf ("  };\n");
 
-  printf ("\nconst int insn_n_dups[] =\n  {\n");
-  for (d = insn_data; d; d = d->next)
-    printf ("    %d,\n", d->n_dups);
-  printf ("  };\n");
+  printf ("\nconst struct insn_data insn_data[] = \n{\n");
 
-  if (have_constraints)
+  for (d = idata; d; d = d->next)
     {
-      printf ("\nconst char *const insn_operand_constraint[][MAX_RECOG_OPERANDS] =\n  {\n");
-      for (d = insn_data; d; d = d->next)
+      printf ("  {\n");
+
+      if (d->name)
 	{
-	  register int i;
-	  printf ("    {");
-	  for (i = 0; i < d->n_operands; i++)
+	  printf ("    \"%s\",\n", d->name);
+	  name_offset = 0;
+	  last_name = d->name;
+	  next_name = 0;
+	  for (n = d->next, next_name_offset = 1; n;
+	       n = n->next, next_name_offset++)
 	    {
-	      if (d->constraints[i] == 0)
-		printf (" \"\",");
-	      else
-		printf (" \"%s\",", d->constraints[i]);
+	      if (n->name)
+		{
+		  next_name = n->name;
+		  break;
+		}
 	    }
-	  if (d->n_operands == 0)
-	    printf (" 0");
-	  printf (" },\n");
 	}
-      printf ("  };\n");
-    }
-  else
-    {
-      printf ("\nconst char insn_operand_address_p[][MAX_RECOG_OPERANDS] =\n  {\n");
-      for (d = insn_data; d; d = d->next)
+      else
 	{
-	  register int i;
-	  printf ("    {");
-	  for (i = 0; i < d->n_operands; i++)
-	    printf (" %d,", d->address_p[i]);
-	  if (d->n_operands == 0)
-	    printf (" 0");
-	  printf (" },\n");
+	  name_offset++;
+	  if (next_name && (last_name == 0
+			    || name_offset > next_name_offset / 2))
+	    printf ("    \"%s-%d\",\n", next_name,
+		    next_name_offset - name_offset);
+	  else
+	    printf ("    \"%s+%d\",\n", last_name, name_offset);
 	}
-      printf ("  };\n");
-    }
 
-  printf ("\nconst enum machine_mode insn_operand_mode[][MAX_RECOG_OPERANDS] =\n  {\n");
-  for (d = insn_data; d; d = d->next)
-    {
-      register int i;
-      printf ("    {");
-      for (i = 0; i < d->n_operands; i++)
-	printf (" %smode,", GET_MODE_NAME (d->modes[i]));
-      if (d->n_operands == 0)
-	printf (" VOIDmode");
-      printf (" },\n");
-    }
-  printf ("  };\n");
+      if (d->template)
+	printf ("    \"%s\",\n", d->template);
+      else
+	printf ("    0,\n");
 
-  printf ("\nconst char insn_operand_strict_low[][MAX_RECOG_OPERANDS] =\n  {\n");
-  for (d = insn_data; d; d = d->next)
-    {
-      register int i;
-      printf ("    {");
-      for (i = 0; i < d->n_operands; i++)
-	printf (" %d,", d->strict_low[i]);
-      if (d->n_operands == 0)
-	printf (" 0");
-      printf (" },\n");
+      if (d->outfun)
+	printf ("    output_%d,\n", d->code_number);
+      else
+	printf ("    0,\n");
+
+      if (d->name && d->name[0] != '*')
+	printf ("    gen_%s,\n", d->name);
+      else
+	printf ("    0,\n");
+
+      printf ("    &operand_data[%d],\n", d->operand_number);
+      printf ("    %d,\n", d->n_operands);
+      printf ("    %d,\n", d->n_dups);
+      printf ("    %d\n", d->n_alternatives);
+
+      printf("  },\n");
     }
-  printf ("  };\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 { char *name; struct predicate *next; } *predicates = 0;
-    struct predicate *p;
-    int i;
-
-    printf ("\n");
-    for (d = insn_data; d; d = d->next)
-      for (i = 0; i < d->n_operands; i++)
-	if (d->predicates[i] && d->predicates[i][0])
-	  {
-	    for (p = predicates; p; p = p->next)
-	      if (! strcmp (p->name, d->predicates[i]))
-		break;
-
-	    if (p == 0)
-	      {
-		printf ("extern int %s PROTO ((rtx, enum machine_mode));\n",
-			d->predicates[i]);
-		p = (struct predicate *) alloca (sizeof (struct predicate));
-		p->name = d->predicates[i];
-		p->next = predicates;
-		predicates = p;
-	      }
-	  }
-    
-    printf ("\nint (*const insn_operand_predicate[][MAX_RECOG_OPERANDS]) PROTO ((rtx, enum machine_mode)) =\n  {\n");
-    for (d = insn_data; d; d = d->next)
-      {
-	printf ("    {");
-	for (i = 0; i < d->n_operands; i++)
-	  printf (" %s,", ((d->predicates[i] && d->predicates[i][0])
-			   ? d->predicates[i] : "0"));
-	if (d->n_operands == 0)
-	  printf (" 0");
-	printf (" },\n");
-      }
-    printf ("  };\n");
-  }
+  printf ("};\n\n\n");
+}
 
-  printf ("\nconst int insn_n_alternatives[] =\n  {\n");
-  for (d = insn_data; d; d = d->next)
-    printf ("    %d,\n", d->n_alternatives);
-  printf("  };\n");
+static void
+output_get_insn_name ()
+{
+  printf ("const char *\n");
+  printf ("get_insn_name (code)\n");
+  printf ("     int code;\n");
+  printf ("{\n");
+  printf ("  return insn_data[code].name;\n");
+  printf ("}\n");
 }
+
 
-/* scan_operands (X) stores in max_opno the largest operand
-   number present in X, if that is larger than the previous
-   value of max_opno.  It stores all the constraints in `constraints'
-   and all the machine modes in `modes'.
+/* Stores in max_opno the largest operand number present in `part', if
+   that is larger than the previous value of max_opno, and the rest of
+   the operand data into `d->operand[i]'.
 
    THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
    THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART.  */
 
 static int max_opno;
 static int num_dups;
-static char *constraints[MAX_MAX_OPERANDS];
-static int op_n_alternatives[MAX_MAX_OPERANDS];
-static const char *predicates[MAX_MAX_OPERANDS];
-static char address_p[MAX_MAX_OPERANDS];
-static enum machine_mode modes[MAX_MAX_OPERANDS];
-static char strict_low[MAX_MAX_OPERANDS];
-static char seen[MAX_MAX_OPERANDS];
 
 static void
-scan_operands (part, this_address_p, this_strict_low)
+scan_operands (d, part, this_address_p, this_strict_low)
+     struct data *d;
      rtx part;
      int this_address_p;
      int this_strict_low;
@@ -460,23 +423,24 @@ scan_operands (part, this_address_p, this_strict_low)
       if (max_opno >= MAX_MAX_OPERANDS)
 	{
 	  error ("Too many operands (%d) in definition %s.\n",
-		 max_opno + 1, name_for_index (next_index_number));
+		 max_opno + 1, get_insn_name (next_index_number));
 	  return;
 	}
-      if (seen[opno])
+      if (d->operand[opno].seen)
 	error ("Definition %s specified operand number %d more than once.\n",
-	       name_for_index (next_index_number), opno);
-      seen[opno] = 1;
-      modes[opno] = GET_MODE (part);
-      strict_low[opno] = this_strict_low;
-      predicates[opno] = XSTR (part, 1);
-      constraints[opno] = XSTR (part, 2);
+	       get_insn_name (next_index_number), opno);
+      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)
 	{
-	  op_n_alternatives[opno] = n_occurrences (',', XSTR (part, 2)) + 1;
+	  d->operand[opno].n_alternatives
+	    = n_occurrences (',', XSTR (part, 2)) + 1;
 	  have_constraints = 1;
 	}
-      address_p[opno] = this_address_p;
+      d->operand[opno].address_p = this_address_p;
       return;
 
     case MATCH_SCRATCH:
@@ -486,23 +450,24 @@ scan_operands (part, this_address_p, this_strict_low)
       if (max_opno >= MAX_MAX_OPERANDS)
 	{
 	  error ("Too many operands (%d) in definition %s.\n",
-		 max_opno + 1, name_for_index (next_index_number));
+		 max_opno + 1, get_insn_name (next_index_number));
 	  return;
 	}
-      if (seen[opno])
+      if (d->operand[opno].seen)
 	error ("Definition %s specified operand number %d more than once.\n",
-	       name_for_index (next_index_number), opno);
-      seen[opno] = 1;
-      modes[opno] = GET_MODE (part);
-      strict_low[opno] = 0;
-      predicates[opno] = "scratch_operand";
-      constraints[opno] = XSTR (part, 1);
+	       get_insn_name (next_index_number), opno);
+      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)
 	{
-	  op_n_alternatives[opno] = n_occurrences (',', XSTR (part, 1)) + 1;
+	  d->operand[opno].n_alternatives
+	    = n_occurrences (',', XSTR (part, 1)) + 1;
 	  have_constraints = 1;
 	}
-      address_p[opno] = 0;
+      d->operand[opno].address_p = 0;
       return;
 
     case MATCH_OPERATOR:
@@ -513,20 +478,20 @@ scan_operands (part, this_address_p, this_strict_low)
       if (max_opno >= MAX_MAX_OPERANDS)
 	{
 	  error ("Too many operands (%d) in definition %s.\n",
-		 max_opno + 1, name_for_index (next_index_number));
+		 max_opno + 1, get_insn_name (next_index_number));
 	  return;
 	}
-      if (seen[opno])
+      if (d->operand[opno].seen)
 	error ("Definition %s specified operand number %d more than once.\n",
-	       name_for_index (next_index_number), opno);
-      seen[opno] = 1;
-      modes[opno] = GET_MODE (part);
-      strict_low[opno] = 0;
-      predicates[opno] = XSTR (part, 1);
-      constraints[opno] = 0;
-      address_p[opno] = 0;
+	       get_insn_name (next_index_number), opno);
+      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;
       for (i = 0; i < XVECLEN (part, 2); i++)
-	scan_operands (XVECEXP (part, 2, i), 0, 0);
+	scan_operands (d, XVECEXP (part, 2, i), 0, 0);
       return;
 
     case MATCH_DUP:
@@ -536,11 +501,11 @@ scan_operands (part, this_address_p, this_strict_low)
       return;
 
     case ADDRESS:
-      scan_operands (XEXP (part, 0), 1, 0);
+      scan_operands (d, XEXP (part, 0), 1, 0);
       return;
 
     case STRICT_LOW_PART:
-      scan_operands (XEXP (part, 0), 0, 1);
+      scan_operands (d, XEXP (part, 0), 0, 1);
       return;
       
     default:
@@ -554,15 +519,111 @@ scan_operands (part, this_address_p, this_strict_low)
       {
       case 'e':
       case 'u':
-	scan_operands (XEXP (part, i), 0, 0);
+	scan_operands (d, XEXP (part, i), 0, 0);
 	break;
       case 'E':
 	if (XVEC (part, i) != NULL)
 	  for (j = 0; j < XVECLEN (part, i); j++)
-	    scan_operands (XVECEXP (part, i, j), 0, 0);
+	    scan_operands (d, XVECEXP (part, i, j), 0, 0);
 	break;
       }
 }
+
+/* Compare two operands for content equality.  */
+
+static int
+compare_operands (d0, d1)
+     struct operand_data *d0, *d1;
+{
+  char *p0, *p1;
+
+  p0 = d0->predicate;
+  if (!p0)
+    p0 = "";
+  p1 = d1->predicate;
+  if (!p1)
+    p1 = "";
+  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;
+    }
+
+  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;
+
+  return 1;
+}
+
+/* Scan the list of operands we've already committed to output and either
+   find a subsequence that is the same, or allocate a new one at the end.  */
+
+static void
+place_operands (d)
+     struct data *d;
+{
+  struct operand_data *od, *od2;
+  int i;
+
+  if (d->n_operands == 0)
+    {
+      d->operand_number = 0;
+      return;
+    }
+
+  /* Brute force substring search.  */
+  for (od = odata, i = 0; od; od = od->next, i = 0)
+    if (compare_operands (od, &d->operand[0]))
+      {
+	od2 = od->next;
+	i = 1;
+	while (1)
+	  {
+	    if (i == d->n_operands)
+	      goto full_match;
+	    if (od2 == NULL)
+	      goto partial_match;
+	    if (! compare_operands (od2, &d->operand[i]))
+	      break;
+	    ++i, od2 = od2->next;
+	  }
+      }
+
+  /* Either partial match at the end of the list, or no match.  In either
+     case, we tack on what operands are remaining to the end of the list.  */
+ partial_match:
+  d->operand_number = next_operand_number - i;
+  for (; i < d->n_operands; ++i)
+    {
+      od2 = &d->operand[i];
+      *odata_end = od2;
+      odata_end = &od2->next;
+      od2->index = next_operand_number++;
+    }
+  *odata_end = NULL;
+  return;
+
+ full_match:
+  d->operand_number = od->index;
+  return;
+}
+
 
 /* Process an assembler template from a define_insn or a define_peephole.
    It is either the assembler code template, a list of assembler code
@@ -634,9 +695,9 @@ process_template (d, template)
     }
   else
     {
-       /* The following is done in a funny way to get around problems in
-	  VAX-11 "C" on VMS.  It is the equivalent of:
-		printf ("%s\n", &template[1])); */
+      /* The following is done in a funny way to get around problems in
+	 VAX-11 "C" on VMS.  It is the equivalent of:
+	 printf ("%s\n", &template[1])); */
       cp = &template[1];
       while (*cp)
 	{
@@ -656,25 +717,26 @@ validate_insn_alternatives (d)
      struct data *d;
 {
   register int n = 0, start;
-  /* Make sure all the operands have the same number of
-     alternatives in their constraints.
-     Let N be that number.  */
+
+  /* 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->op_n_alternatives[start] > 0)
+    if (d->operand[start].n_alternatives > 0)
       {
 	if (n == 0)
-	  n = d->op_n_alternatives[start];
-	else if (n != d->op_n_alternatives[start])
+	  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, name_for_index (d->index_number));
+		 start, get_insn_name (d->index_number));
       }
+
   /* Record the insn's overall number of alternatives.  */
   d->n_alternatives = n;
 }
 
-/* Look at a define_insn just read.  Assign its code number.
-   Record on insn_data the template and the number of arguments.
-   If the insn has a hairy output action, output a function for now.  */
+/* 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)
@@ -693,43 +755,26 @@ gen_insn (insn)
   /* Build up the list in the same order as the insns are seen
      in the machine description.  */
   d->next = 0;
-  if (end_of_insn_data)
-    end_of_insn_data->next = d;
-  else
-    insn_data = d;
-
-  end_of_insn_data = d;
+  *idata_end = d;
+  idata_end = &d->next;
 
   max_opno = -1;
   num_dups = 0;
-
-  memset (constraints, 0, sizeof constraints);
-  memset (op_n_alternatives, 0, sizeof op_n_alternatives);
-  memset (predicates, 0, sizeof predicates);
-  memset (address_p, 0, sizeof address_p);
-  memset (modes, 0, sizeof modes);
-  memset (strict_low, 0, sizeof strict_low);
-  memset (seen, 0, sizeof seen);
+  memset (d->operand, 0, sizeof (d->operand));
 
   for (i = 0; i < XVECLEN (insn, 1); i++)
-    scan_operands (XVECEXP (insn, 1, i), 0, 0);
+    scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
 
   d->n_operands = max_opno + 1;
   d->n_dups = num_dups;
 
-  memcpy (d->constraints, constraints, sizeof constraints);
-  memcpy (d->op_n_alternatives, op_n_alternatives, sizeof op_n_alternatives);
-  memcpy (d->predicates, predicates, sizeof predicates);
-  memcpy (d->address_p, address_p, sizeof address_p);
-  memcpy (d->modes, modes, sizeof modes);
-  memcpy (d->strict_low, strict_low, sizeof strict_low);
-
   validate_insn_alternatives (d);
+  place_operands (d);
   process_template (d, XSTR (insn, 3));
 }
 
 /* Look at a define_peephole just read.  Assign its code number.
-   Record on insn_data the template and the number of arguments.
+   Record on idata the template and the number of arguments.
    If the insn has a hairy output action, output it now.  */
 
 static void
@@ -746,39 +791,24 @@ gen_peephole (peep)
   /* Build up the list in the same order as the insns are seen
      in the machine description.  */
   d->next = 0;
-  if (end_of_insn_data)
-    end_of_insn_data->next = d;
-  else
-    insn_data = d;
-
-  end_of_insn_data = d;
+  *idata_end = d;
+  idata_end = &d->next;
 
   max_opno = -1;
-  memset (constraints, 0, sizeof constraints);
-  memset (op_n_alternatives, 0, sizeof op_n_alternatives);
-  memset (predicates, 0, sizeof predicates);
-  memset (address_p, 0, sizeof address_p);
-  memset (modes, 0, sizeof modes);
-  memset (strict_low, 0, sizeof strict_low);
-  memset (seen, 0, sizeof seen);
-
-  /* Get the number of operands by scanning all the
-     patterns of the peephole optimizer.
-     But ignore all the rest of the information thus obtained.  */
+  num_dups = 0;
+  memset (d->operand, 0, sizeof (d->operand));
+
+  /* Get the number of operands by scanning all the patterns of the
+     peephole optimizer.  But ignore all the rest of the information
+     thus obtained.  */
   for (i = 0; i < XVECLEN (peep, 0); i++)
-    scan_operands (XVECEXP (peep, 0, i), 0, 0);
+    scan_operands (d, XVECEXP (peep, 0, i), 0, 0);
 
   d->n_operands = max_opno + 1;
   d->n_dups = 0;
 
-  memcpy (d->constraints, constraints, sizeof constraints);
-  memcpy (d->op_n_alternatives, op_n_alternatives, sizeof op_n_alternatives);
-  memset (d->predicates, 0, sizeof predicates);
-  memset (d->address_p, 0, sizeof address_p);
-  memset (d->modes, 0, sizeof modes);
-  memset (d->strict_low, 0, sizeof strict_low);
-
   validate_insn_alternatives (d);
+  place_operands (d);
   process_template (d, XSTR (peep, 2));
 }
 
@@ -802,50 +832,32 @@ gen_expand (insn)
   /* Build up the list in the same order as the insns are seen
      in the machine description.  */
   d->next = 0;
-  if (end_of_insn_data)
-    end_of_insn_data->next = d;
-  else
-    insn_data = d;
-
-  end_of_insn_data = d;
+  *idata_end = d;
+  idata_end = &d->next;
 
   max_opno = -1;
   num_dups = 0;
+  memset (d->operand, 0, sizeof (d->operand));
 
   /* Scan the operands to get the specified predicates and modes,
      since expand_binop needs to know them.  */
 
-  memset (constraints, 0, sizeof constraints);
-  memset (op_n_alternatives, 0, sizeof op_n_alternatives);
-  memset (predicates, 0, sizeof predicates);
-  memset (address_p, 0, sizeof address_p);
-  memset (modes, 0, sizeof modes);
-  memset (strict_low, 0, sizeof strict_low);
-  memset (seen, 0, sizeof seen);
-
   if (XVEC (insn, 1))
     for (i = 0; i < XVECLEN (insn, 1); i++)
-      scan_operands (XVECEXP (insn, 1, i), 0, 0);
+      scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
 
   d->n_operands = max_opno + 1;
   d->n_dups = num_dups;
-
-  memcpy (d->constraints, constraints, sizeof constraints);
-  memcpy (d->op_n_alternatives, op_n_alternatives, sizeof op_n_alternatives);
-  memcpy (d->predicates, predicates, sizeof predicates);
-  memcpy (d->address_p, address_p, sizeof address_p);
-  memcpy (d->modes, modes, sizeof modes);
-  memcpy (d->strict_low, strict_low, sizeof strict_low);
-
   d->template = 0;
   d->outfun = 0;
+
   validate_insn_alternatives (d);
+  place_operands (d);
 }
 
 /* Process a define_split just read.  Assign its code number,
    only for reasons of consistency and to simplify genrecog.  */
 
-
 static void
 gen_split (split)
      rtx split;
@@ -860,43 +872,26 @@ gen_split (split)
   /* Build up the list in the same order as the insns are seen
      in the machine description.  */
   d->next = 0;
-  if (end_of_insn_data)
-    end_of_insn_data->next = d;
-  else
-    insn_data = d;
-
-  end_of_insn_data = d;
+  *idata_end = d;
+  idata_end = &d->next;
 
   max_opno = -1;
   num_dups = 0;
+  memset (d->operand, 0, sizeof (d->operand));
 
-  memset (constraints, 0, sizeof constraints);
-  memset (op_n_alternatives, 0, sizeof op_n_alternatives);
-  memset (predicates, 0, sizeof predicates);
-  memset (address_p, 0, sizeof address_p);
-  memset (modes, 0, sizeof modes);
-  memset (strict_low, 0, sizeof strict_low);
-  memset (seen, 0, sizeof seen);
-
-  /* Get the number of operands by scanning all the
-     patterns of the split patterns.
-     But ignore all the rest of the information thus obtained.  */
+  /* Get the number of operands by scanning all the patterns of the
+     split patterns.  But ignore all the rest of the information thus
+     obtained.  */
   for (i = 0; i < XVECLEN (split, 0); i++)
-    scan_operands (XVECEXP (split, 0, i), 0, 0);
+    scan_operands (d, XVECEXP (split, 0, i), 0, 0);
 
   d->n_operands = max_opno + 1;
-
-  memset (d->constraints, 0, sizeof constraints);
-  memset (d->op_n_alternatives, 0, sizeof op_n_alternatives);
-  memset (d->predicates, 0, sizeof predicates);
-  memset (d->address_p, 0, sizeof address_p);
-  memset (d->modes, 0, sizeof modes);
-  memset (d->strict_low, 0, sizeof strict_low);
-
   d->n_dups = 0;
   d->n_alternatives = 0;
   d->template = 0;
   d->outfun = 0;
+
+  place_operands (d);
 }
 
 PTR
@@ -974,7 +969,11 @@ main (argc, argv)
       next_index_number++;
     }
 
-  output_epilogue ();
+  printf("\n\n");
+  output_predicate_decls ();
+  output_operand_data ();
+  output_insn_data ();
+  output_get_insn_name ();
 
   fflush (stdout);
   exit (ferror (stdout) != 0 || have_error