gcc/genoutput.c

   1 /* Generate code from to output assembler insns as recognized from rtl.
   2    Copyright (C) 1987, 1988, 1992, 1994, 1995, 1997, 1998, 1999, 2000
   3    Free Software Foundation, Inc.
   4
   5 This file is part of GNU CC.
   6
   7 GNU CC is free software; you can redistribute it and/or modify
   8 it under the terms of the GNU General Public License as published by
   9 the Free Software Foundation; either version 2, or (at your option)
  10 any later version.
  11
  12 GNU CC is distributed in the hope that it will be useful,
  13 but WITHOUT ANY WARRANTY; without even the implied warranty of
  14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15 GNU General Public License for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GNU CC; see the file COPYING.  If not, write to
  19 the Free Software Foundation, 59 Temple Place - Suite 330,
  20 Boston, MA 02111-1307, USA.  */
  21
  22
  23 /* This program reads the machine description for the compiler target machine
  24    and produces a file containing these things:
  25
  26    1. An array of `struct insn_data', which is indexed by insn code number,
  27    which contains:
  28
  29      a. `name' is the name for that pattern.  Nameless patterns are
  30      given a name.
  31
  32      b. `output' hold either the output template, an array of output
  33      templates, or an output function.
  34
  35      c. `genfun' is the function to generate a body for that pattern,
  36      given operands as arguments.
  37
  38      d. `n_operands' is the number of distinct operands in the pattern
  39      for that insn,
  40
  41      e. `n_dups' is the number of match_dup's that appear in the insn's
  42      pattern.  This says how many elements of `recog_data.dup_loc' are
  43      significant after an insn has been recognized.
  44
  45      f. `n_alternatives' is the number of alternatives in the constraints
  46      of each pattern.
  47
  48      g. `output_format' tells what type of thing `output' is.
  49
  50      h. `operand' is the base of an array of operand data for the insn.
  51
  52    2. An array of `struct insn_operand data', used by `operand' above.
  53
  54      a. `predicate', an int-valued function, is the match_operand predicate
  55      for this operand.
  56
  57      b. `constraint' is the constraint for this operand.  This exists
  58      only if register constraints appear in match_operand rtx's.
  59
  60      c. `address_p' indicates that the operand appears within ADDRESS
  61      rtx's.  This exists only if there are *no* register constraints
  62      in the match_operand rtx's.
  63
  64      d. `mode' is the machine mode that that operand is supposed to have.
  65
  66      e. `strict_low', is nonzero for operands contained in a STRICT_LOW_PART.
  67
  68      f. `eliminable', is nonzero for operands that are matched normally by
  69      MATCH_OPERAND; it is zero for operands that should not be changed during
  70      register elimination such as MATCH_OPERATORs.
  71
  72   The code number of an insn is simply its position in the machine
  73   description; code numbers are assigned sequentially to entries in
  74   the description, starting with code number 0.
  75
  76   Thus, the following entry in the machine description
  77
  78     (define_insn "clrdf"
  79       [(set (match_operand:DF 0 "general_operand" "")
  80             (const_int 0))]
  81       ""
  82       "clrd %0")
  83
  84   assuming it is the 25th entry present, would cause
  85   insn_data[24].template to be "clrd %0", and
  86   insn_data[24].n_operands to be 1.  */
  87 \f
  88 #include "hconfig.h"
  89 #include "system.h"
  90 #include "rtl.h"
  91 #include "errors.h"
  92 #include "gensupport.h"
  93
  94 /* No instruction can have more operands than this.  Sorry for this
  95    arbitrary limit, but what machine will have an instruction with
  96    this many operands?  */
  97
  98 #define MAX_MAX_OPERANDS 40
  99
 100 static int n_occurrences                PARAMS ((int, const char *));
 101 static const char *strip_whitespace     PARAMS ((const char *));
 102
 103 /* insns in the machine description are assigned sequential code numbers
 104    that are used by insn-recog.c (produced by genrecog) to communicate
 105    to insn-output.c (produced by this program).  */
 106
 107 static int next_code_number;
 108
 109 /* This counts all definitions in the md file,
 110    for the sake of error messages.  */
 111
 112 static int next_index_number;
 113
 114 /* This counts all operands used in the md file.  The first is null.  */
 115
 116 static int next_operand_number = 1;
 117
 118 /* Record in this chain all information about the operands we will output.  */
 119
 120 struct operand_data
 121 {
 122   struct operand_data *next;
 123   int index;
 124   const char *predicate;
 125   const char *constraint;
 126   enum machine_mode mode;
 127   unsigned char n_alternatives;
 128   char address_p;
 129   char strict_low;
 130   char eliminable;
 131   char seen;
 132 };
 133
 134 /* Begin with a null operand at index 0.  */
 135
 136 static struct operand_data null_operand =
 137 {
 138   0, 0, "", "", VOIDmode, 0, 0, 0, 0, 0
 139 };
 140
 141 static struct operand_data *odata = &null_operand;
 142 static struct operand_data **odata_end = &null_operand.next;
 143
 144 /* Must match the constants in recog.h.  */
 145
 146 #define INSN_OUTPUT_FORMAT_NONE         0       /* abort */
 147 #define INSN_OUTPUT_FORMAT_SINGLE       1       /* const char * */
 148 #define INSN_OUTPUT_FORMAT_MULTI        2       /* const char * const * */
 149 #define INSN_OUTPUT_FORMAT_FUNCTION     3       /* const char * (*)(...) */
 150
 151 /* Record in this chain all information that we will output,
 152    associated with the code number of the insn.  */
 153
 154 struct data
 155 {
 156   struct data *next;
 157   const char *name;
 158   const char *template;
 159   int code_number;
 160   int index_number;
 161   int lineno;
 162   int n_operands;               /* Number of operands this insn recognizes */
 163   int n_dups;                   /* Number times match_dup appears in pattern */
 164   int n_alternatives;           /* Number of alternatives in each constraint */
 165   int operand_number;           /* Operand index in the big array.  */
 166   int output_format;            /* INSN_OUTPUT_FORMAT_*.  */
 167   struct operand_data operand[MAX_MAX_OPERANDS];
 168 };
 169
 170 /* This variable points to the first link in the insn chain.  */
 171
 172 static struct data *idata, **idata_end = &idata;
 173 \f
 174 static void output_prologue PARAMS ((void));
 175 static void output_predicate_decls PARAMS ((void));
 176 static void output_operand_data PARAMS ((void));
 177 static void output_insn_data PARAMS ((void));
 178 static void output_get_insn_name PARAMS ((void));
 179 static void scan_operands PARAMS ((struct data *, rtx, int, int));
 180 static int compare_operands PARAMS ((struct operand_data *,
 181                                    struct operand_data *));
 182 static void place_operands PARAMS ((struct data *));
 183 static void process_template PARAMS ((struct data *, const char *));
 184 static void validate_insn_alternatives PARAMS ((struct data *));
 185 static void gen_insn PARAMS ((rtx, int));
 186 static void gen_peephole PARAMS ((rtx, int));
 187 static void gen_expand PARAMS ((rtx, int));
 188 static void gen_split PARAMS ((rtx, int));
 189 \f
 190 const char *
 191 get_insn_name (index)
 192      int index;
 193 {
 194   static char buf[100];
 195
 196   struct data *i, *last_named = NULL;
 197   for (i = idata; i ; i = i->next)
 198     {
 199       if (i->index_number == index)
 200         return i->name;
 201       if (i->name)
 202         last_named = i;
 203     }
 204
 205   if (last_named)
 206     sprintf(buf, "%s+%d", last_named->name, index - last_named->index_number);
 207   else
 208     sprintf(buf, "insn %d", index);
 209
 210   return buf;
 211 }
 212
 213 static void
 214 output_prologue ()
 215 {
 216   printf ("/* Generated automatically by the program `genoutput'\n\
 217    from the machine description file `md'.  */\n\n");
 218
 219   printf ("#include \"config.h\"\n");
 220   printf ("#include \"system.h\"\n");
 221   printf ("#include \"flags.h\"\n");
 222   printf ("#include \"ggc.h\"\n");
 223   printf ("#include \"rtl.h\"\n");
 224   printf ("#include \"tm_p.h\"\n");
 225   printf ("#include \"function.h\"\n");
 226   printf ("#include \"regs.h\"\n");
 227   printf ("#include \"hard-reg-set.h\"\n");
 228   printf ("#include \"real.h\"\n");
 229   printf ("#include \"insn-config.h\"\n\n");
 230   printf ("#include \"conditions.h\"\n");
 231   printf ("#include \"insn-flags.h\"\n");
 232   printf ("#include \"insn-attr.h\"\n\n");
 233   printf ("#include \"insn-codes.h\"\n\n");
 234   printf ("#include \"recog.h\"\n\n");
 235   printf ("#include \"toplev.h\"\n");
 236   printf ("#include \"output.h\"\n");
 237 }
 238
 239
 240 /* We need to define all predicates used.  Keep a list of those we
 241    have defined so far.  There normally aren't very many predicates
 242    used, so a linked list should be fast enough.  */
 243
 244 static void
 245 output_predicate_decls ()
 246 {
 247   struct predicate { const char *name; struct predicate *next; } *predicates = 0;
 248   register struct operand_data *d;
 249   struct predicate *p;
 250
 251   for (d = odata; d; d = d->next)
 252     if (d->predicate && d->predicate[0])
 253       {
 254         for (p = predicates; p; p = p->next)
 255           if (strcmp (p->name, d->predicate) == 0)
 256             break;
 257
 258         if (p == 0)
 259           {
 260             printf ("extern int %s PARAMS ((rtx, enum machine_mode));\n",
 261                     d->predicate);
 262             p = (struct predicate *) alloca (sizeof (struct predicate));
 263             p->name = d->predicate;
 264             p->next = predicates;
 265             predicates = p;
 266           }
 267       }
 268
 269   printf ("\n\n");
 270 }
 271
 272 static void
 273 output_operand_data ()
 274 {
 275   register struct operand_data *d;
 276
 277   printf ("\nstatic const struct insn_operand_data operand_data[] = \n{\n");
 278
 279   for (d = odata; d; d = d->next)
 280     {
 281       printf ("  {\n");
 282
 283       printf ("    %s,\n",
 284               d->predicate && d->predicate[0] ? d->predicate : "0");
 285
 286       printf ("    \"%s\",\n", d->constraint ? d->constraint : "");
 287
 288       printf ("    %smode,\n", GET_MODE_NAME (d->mode));
 289
 290       printf ("    %d,\n", d->strict_low);
 291
 292       printf ("    %d\n", d->eliminable);
 293
 294       printf("  },\n");
 295     }
 296   printf("};\n\n\n");
 297 }
 298
 299 static void
 300 output_insn_data ()
 301 {
 302   register struct data *d;
 303   int name_offset = 0;
 304   int next_name_offset;
 305   const char * last_name = 0;
 306   const char * next_name = 0;
 307   register struct data *n;
 308
 309   for (n = idata, next_name_offset = 1; n; n = n->next, next_name_offset++)
 310     if (n->name)
 311       {
 312         next_name = n->name;
 313         break;
 314       }
 315
 316   printf ("\nconst struct insn_data insn_data[] = \n{\n");
 317
 318   for (d = idata; d; d = d->next)
 319     {
 320       printf ("  {\n");
 321
 322       if (d->name)
 323         {
 324           printf ("    \"%s\",\n", d->name);
 325           name_offset = 0;
 326           last_name = d->name;
 327           next_name = 0;
 328           for (n = d->next, next_name_offset = 1; n;
 329                n = n->next, next_name_offset++)
 330             {
 331               if (n->name)
 332                 {
 333                   next_name = n->name;
 334                   break;
 335                 }
 336             }
 337         }
 338       else
 339         {
 340           name_offset++;
 341           if (next_name && (last_name == 0
 342                             || name_offset > next_name_offset / 2))
 343             printf ("    \"%s-%d\",\n", next_name,
 344                     next_name_offset - name_offset);
 345           else
 346             printf ("    \"%s+%d\",\n", last_name, name_offset);
 347         }
 348
 349       switch (d->output_format)
 350         {
 351         case INSN_OUTPUT_FORMAT_NONE:
 352           printf ("    0,\n");
 353           break;
 354         case INSN_OUTPUT_FORMAT_SINGLE:
 355           printf ("    \"%s\",\n", d->template);
 356           break;
 357         case INSN_OUTPUT_FORMAT_MULTI:
 358         case INSN_OUTPUT_FORMAT_FUNCTION:
 359           printf ("    (const PTR) output_%d,\n", d->code_number);
 360           break;
 361         default:
 362           abort ();
 363         }
 364
 365       if (d->name && d->name[0] != '*')
 366         printf ("    (insn_gen_fn) gen_%s,\n", d->name);
 367       else
 368         printf ("    0,\n");
 369
 370       printf ("    &operand_data[%d],\n", d->operand_number);
 371       printf ("    %d,\n", d->n_operands);
 372       printf ("    %d,\n", d->n_dups);
 373       printf ("    %d,\n", d->n_alternatives);
 374       printf ("    %d\n", d->output_format);
 375
 376       printf("  },\n");
 377     }
 378   printf ("};\n\n\n");
 379 }
 380
 381 static void
 382 output_get_insn_name ()
 383 {
 384   printf ("const char *\n");
 385   printf ("get_insn_name (code)\n");
 386   printf ("     int code;\n");
 387   printf ("{\n");
 388   printf ("  return insn_data[code].name;\n");
 389   printf ("}\n");
 390 }
 391
 392 \f
 393 /* Stores in max_opno the largest operand number present in `part', if
 394    that is larger than the previous value of max_opno, and the rest of
 395    the operand data into `d->operand[i]'.
 396
 397    THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
 398    THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART.  */
 399
 400 static int max_opno;
 401 static int num_dups;
 402
 403 static void
 404 scan_operands (d, part, this_address_p, this_strict_low)
 405      struct data *d;
 406      rtx part;
 407      int this_address_p;
 408      int this_strict_low;
 409 {
 410   register int i, j;
 411   register const char *format_ptr;
 412   int opno;
 413
 414   if (part == 0)
 415     return;
 416
 417   switch (GET_CODE (part))
 418     {
 419     case MATCH_OPERAND:
 420       opno = XINT (part, 0);
 421       if (opno > max_opno)
 422         max_opno = opno;
 423       if (max_opno >= MAX_MAX_OPERANDS)
 424         {
 425           message_with_line (d->lineno,
 426                              "maximum number of operands exceeded");
 427           have_error = 1;
 428           return;
 429         }
 430       if (d->operand[opno].seen)
 431         {
 432           message_with_line (d->lineno,
 433                              "repeated operand number %d\n", opno);
 434           have_error = 1;
 435         }
 436
 437       d->operand[opno].seen = 1;
 438       d->operand[opno].mode = GET_MODE (part);
 439       d->operand[opno].strict_low = this_strict_low;
 440       d->operand[opno].predicate = XSTR (part, 1);
 441       d->operand[opno].constraint = strip_whitespace (XSTR (part, 2));
 442       d->operand[opno].n_alternatives
 443         = n_occurrences (',', d->operand[opno].constraint) + 1;
 444       d->operand[opno].address_p = this_address_p;
 445       d->operand[opno].eliminable = 1;
 446       return;
 447
 448     case MATCH_SCRATCH:
 449       opno = XINT (part, 0);
 450       if (opno > max_opno)
 451         max_opno = opno;
 452       if (max_opno >= MAX_MAX_OPERANDS)
 453         {
 454           message_with_line (d->lineno,
 455                              "maximum number of operands exceeded");
 456           have_error = 1;
 457           return;
 458         }
 459       if (d->operand[opno].seen)
 460         {
 461           message_with_line (d->lineno,
 462                              "repeated operand number %d\n", opno);
 463           have_error = 1;
 464         }
 465
 466       d->operand[opno].seen = 1;
 467       d->operand[opno].mode = GET_MODE (part);
 468       d->operand[opno].strict_low = 0;
 469       d->operand[opno].predicate = "scratch_operand";
 470       d->operand[opno].constraint = strip_whitespace (XSTR (part, 1));
 471       d->operand[opno].n_alternatives
 472         = n_occurrences (',', d->operand[opno].constraint) + 1;
 473       d->operand[opno].address_p = 0;
 474       d->operand[opno].eliminable = 0;
 475       return;
 476
 477     case MATCH_OPERATOR:
 478     case MATCH_PARALLEL:
 479       opno = XINT (part, 0);
 480       if (opno > max_opno)
 481         max_opno = opno;
 482       if (max_opno >= MAX_MAX_OPERANDS)
 483         {
 484           message_with_line (d->lineno,
 485                              "maximum number of operands exceeded");
 486           have_error = 1;
 487           return;
 488         }
 489       if (d->operand[opno].seen)
 490         {
 491           message_with_line (d->lineno,
 492                              "repeated operand number %d\n", opno);
 493           have_error = 1;
 494         }
 495
 496       d->operand[opno].seen = 1;
 497       d->operand[opno].mode = GET_MODE (part);
 498       d->operand[opno].strict_low = 0;
 499       d->operand[opno].predicate = XSTR (part, 1);
 500       d->operand[opno].constraint = 0;
 501       d->operand[opno].address_p = 0;
 502       d->operand[opno].eliminable = 0;
 503       for (i = 0; i < XVECLEN (part, 2); i++)
 504         scan_operands (d, XVECEXP (part, 2, i), 0, 0);
 505       return;
 506
 507     case MATCH_DUP:
 508     case MATCH_OP_DUP:
 509     case MATCH_PAR_DUP:
 510       ++num_dups;
 511       return;
 512
 513     case ADDRESS:
 514       scan_operands (d, XEXP (part, 0), 1, 0);
 515       return;
 516
 517     case STRICT_LOW_PART:
 518       scan_operands (d, XEXP (part, 0), 0, 1);
 519       return;
 520
 521     default:
 522       break;
 523     }
 524
 525   format_ptr = GET_RTX_FORMAT (GET_CODE (part));
 526
 527   for (i = 0; i < GET_RTX_LENGTH (GET_CODE (part)); i++)
 528     switch (*format_ptr++)
 529       {
 530       case 'e':
 531       case 'u':
 532         scan_operands (d, XEXP (part, i), 0, 0);
 533         break;
 534       case 'E':
 535         if (XVEC (part, i) != NULL)
 536           for (j = 0; j < XVECLEN (part, i); j++)
 537             scan_operands (d, XVECEXP (part, i, j), 0, 0);
 538         break;
 539       }
 540 }
 541
 542 /* Compare two operands for content equality.  */
 543
 544 static int
 545 compare_operands (d0, d1)
 546      struct operand_data *d0, *d1;
 547 {
 548   const char *p0, *p1;
 549
 550   p0 = d0->predicate;
 551   if (!p0)
 552     p0 = "";
 553   p1 = d1->predicate;
 554   if (!p1)
 555     p1 = "";
 556   if (strcmp (p0, p1) != 0)
 557     return 0;
 558
 559   p0 = d0->constraint;
 560   if (!p0)
 561     p0 = "";
 562   p1 = d1->constraint;
 563   if (!p1)
 564     p1 = "";
 565   if (strcmp (p0, p1) != 0)
 566     return 0;
 567
 568   if (d0->mode != d1->mode)
 569     return 0;
 570
 571   if (d0->strict_low != d1->strict_low)
 572     return 0;
 573
 574   if (d0->eliminable != d1->eliminable)
 575     return 0;
 576
 577   return 1;
 578 }
 579
 580 /* Scan the list of operands we've already committed to output and either
 581    find a subsequence that is the same, or allocate a new one at the end.  */
 582
 583 static void
 584 place_operands (d)
 585      struct data *d;
 586 {
 587   struct operand_data *od, *od2;
 588   int i;
 589
 590   if (d->n_operands == 0)
 591     {
 592       d->operand_number = 0;
 593       return;
 594     }
 595
 596   /* Brute force substring search.  */
 597   for (od = odata, i = 0; od; od = od->next, i = 0)
 598     if (compare_operands (od, &d->operand[0]))
 599       {
 600         od2 = od->next;
 601         i = 1;
 602         while (1)
 603           {
 604             if (i == d->n_operands)
 605               goto full_match;
 606             if (od2 == NULL)
 607               goto partial_match;
 608             if (! compare_operands (od2, &d->operand[i]))
 609               break;
 610             ++i, od2 = od2->next;
 611           }
 612       }
 613
 614   /* Either partial match at the end of the list, or no match.  In either
 615      case, we tack on what operands are remaining to the end of the list.  */
 616  partial_match:
 617   d->operand_number = next_operand_number - i;
 618   for (; i < d->n_operands; ++i)
 619     {
 620       od2 = &d->operand[i];
 621       *odata_end = od2;
 622       odata_end = &od2->next;
 623       od2->index = next_operand_number++;
 624     }
 625   *odata_end = NULL;
 626   return;
 627
 628  full_match:
 629   d->operand_number = od->index;
 630   return;
 631 }
 632
 633 \f
 634 /* Process an assembler template from a define_insn or a define_peephole.
 635    It is either the assembler code template, a list of assembler code
 636    templates, or C code to generate the assembler code template.  */
 637
 638 static void
 639 process_template (d, template)
 640     struct data *d;
 641     const char *template;
 642 {
 643   register const char *cp;
 644   register int i;
 645
 646   /* Templates starting with * contain straight code to be run.  */
 647   if (template[0] == '*')
 648     {
 649       d->template = 0;
 650       d->output_format = INSN_OUTPUT_FORMAT_FUNCTION;
 651
 652       printf ("\nstatic const char *output_%d PARAMS ((rtx *, rtx));\n",
 653               d->code_number);
 654       puts ("\nstatic const char *");
 655       printf ("output_%d (operands, insn)\n", d->code_number);
 656       puts ("     rtx *operands ATTRIBUTE_UNUSED;");
 657       puts ("     rtx insn ATTRIBUTE_UNUSED;");
 658       puts ("{");
 659
 660       puts (template + 1);
 661       puts ("}");
 662     }
 663
 664   /* If the assembler code template starts with a @ it is a newline-separated
 665      list of assembler code templates, one for each alternative.  */
 666   else if (template[0] == '@')
 667     {
 668       d->template = 0;
 669       d->output_format = INSN_OUTPUT_FORMAT_MULTI;
 670
 671       printf ("\nstatic const char * const output_%d[] = {\n", d->code_number);
 672
 673       for (i = 0, cp = &template[1]; *cp; )
 674         {
 675           while (*cp == '\n' || *cp == ' ' || *cp== '\t')
 676             cp++;
 677
 678           printf ("  \"");
 679           while (*cp != '\n' && *cp != '\0')
 680             {
 681               putchar (*cp);
 682               cp++;
 683             }
 684
 685           printf ("\",\n");
 686           i++;
 687         }
 688
 689       printf ("};\n");
 690     }
 691   else
 692     {
 693       d->template = template;
 694       d->output_format = INSN_OUTPUT_FORMAT_SINGLE;
 695     }
 696 }
 697 \f
 698 /* Check insn D for consistency in number of constraint alternatives.  */
 699
 700 static void
 701 validate_insn_alternatives (d)
 702      struct data *d;
 703 {
 704   register int n = 0, start;
 705
 706   /* Make sure all the operands have the same number of alternatives
 707      in their constraints.  Let N be that number.  */
 708   for (start = 0; start < d->n_operands; start++)
 709     if (d->operand[start].n_alternatives > 0)
 710       {
 711         if (n == 0)
 712           n = d->operand[start].n_alternatives;
 713         else if (n != d->operand[start].n_alternatives)
 714           {
 715             message_with_line (d->lineno,
 716                                "wrong number of alternatives in operand %d",
 717                                start);
 718             have_error = 1;
 719           }
 720       }
 721
 722   /* Record the insn's overall number of alternatives.  */
 723   d->n_alternatives = n;
 724 }
 725 \f
 726 /* Look at a define_insn just read.  Assign its code number.  Record
 727    on idata the template and the number of arguments.  If the insn has
 728    a hairy output action, output a function for now.  */
 729
 730 static void
 731 gen_insn (insn, lineno)
 732      rtx insn;
 733      int lineno;
 734 {
 735   register struct data *d = (struct data *) xmalloc (sizeof (struct data));
 736   register int i;
 737
 738   d->code_number = next_code_number;
 739   d->index_number = next_index_number;
 740   d->lineno = lineno;
 741   if (XSTR (insn, 0)[0])
 742     d->name = XSTR (insn, 0);
 743   else
 744     d->name = 0;
 745
 746   /* Build up the list in the same order as the insns are seen
 747      in the machine description.  */
 748   d->next = 0;
 749   *idata_end = d;
 750   idata_end = &d->next;
 751
 752   max_opno = -1;
 753   num_dups = 0;
 754   memset (d->operand, 0, sizeof (d->operand));
 755
 756   for (i = 0; i < XVECLEN (insn, 1); i++)
 757     scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
 758
 759   d->n_operands = max_opno + 1;
 760   d->n_dups = num_dups;
 761
 762   validate_insn_alternatives (d);
 763   place_operands (d);
 764   process_template (d, XSTR (insn, 3));
 765 }
 766 \f
 767 /* Look at a define_peephole just read.  Assign its code number.
 768    Record on idata the template and the number of arguments.
 769    If the insn has a hairy output action, output it now.  */
 770
 771 static void
 772 gen_peephole (peep, lineno)
 773      rtx peep;
 774      int lineno;
 775 {
 776   register struct data *d = (struct data *) xmalloc (sizeof (struct data));
 777   register int i;
 778
 779   d->code_number = next_code_number;
 780   d->index_number = next_index_number;
 781   d->lineno = lineno;
 782   d->name = 0;
 783
 784   /* Build up the list in the same order as the insns are seen
 785      in the machine description.  */
 786   d->next = 0;
 787   *idata_end = d;
 788   idata_end = &d->next;
 789
 790   max_opno = -1;
 791   num_dups = 0;
 792   memset (d->operand, 0, sizeof (d->operand));
 793
 794   /* Get the number of operands by scanning all the patterns of the
 795      peephole optimizer.  But ignore all the rest of the information
 796      thus obtained.  */
 797   for (i = 0; i < XVECLEN (peep, 0); i++)
 798     scan_operands (d, XVECEXP (peep, 0, i), 0, 0);
 799
 800   d->n_operands = max_opno + 1;
 801   d->n_dups = 0;
 802
 803   validate_insn_alternatives (d);
 804   place_operands (d);
 805   process_template (d, XSTR (peep, 2));
 806 }
 807 \f
 808 /* Process a define_expand just read.  Assign its code number,
 809    only for the purposes of `insn_gen_function'.  */
 810
 811 static void
 812 gen_expand (insn, lineno)
 813      rtx insn;
 814      int lineno;
 815 {
 816   register struct data *d = (struct data *) xmalloc (sizeof (struct data));
 817   register int i;
 818
 819   d->code_number = next_code_number;
 820   d->index_number = next_index_number;
 821   d->lineno = lineno;
 822   if (XSTR (insn, 0)[0])
 823     d->name = XSTR (insn, 0);
 824   else
 825     d->name = 0;
 826
 827   /* Build up the list in the same order as the insns are seen
 828      in the machine description.  */
 829   d->next = 0;
 830   *idata_end = d;
 831   idata_end = &d->next;
 832
 833   max_opno = -1;
 834   num_dups = 0;
 835   memset (d->operand, 0, sizeof (d->operand));
 836
 837   /* Scan the operands to get the specified predicates and modes,
 838      since expand_binop needs to know them.  */
 839
 840   if (XVEC (insn, 1))
 841     for (i = 0; i < XVECLEN (insn, 1); i++)
 842       scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
 843
 844   d->n_operands = max_opno + 1;
 845   d->n_dups = num_dups;
 846   d->template = 0;
 847   d->output_format = INSN_OUTPUT_FORMAT_NONE;
 848
 849   validate_insn_alternatives (d);
 850   place_operands (d);
 851 }
 852 \f
 853 /* Process a define_split just read.  Assign its code number,
 854    only for reasons of consistency and to simplify genrecog.  */
 855
 856 static void
 857 gen_split (split, lineno)
 858      rtx split;
 859      int lineno;
 860 {
 861   register struct data *d = (struct data *) xmalloc (sizeof (struct data));
 862   register int i;
 863
 864   d->code_number = next_code_number;
 865   d->index_number = next_index_number;
 866   d->lineno = lineno;
 867   d->name = 0;
 868
 869   /* Build up the list in the same order as the insns are seen
 870      in the machine description.  */
 871   d->next = 0;
 872   *idata_end = d;
 873   idata_end = &d->next;
 874
 875   max_opno = -1;
 876   num_dups = 0;
 877   memset (d->operand, 0, sizeof (d->operand));
 878
 879   /* Get the number of operands by scanning all the patterns of the
 880      split patterns.  But ignore all the rest of the information thus
 881      obtained.  */
 882   for (i = 0; i < XVECLEN (split, 0); i++)
 883     scan_operands (d, XVECEXP (split, 0, i), 0, 0);
 884
 885   d->n_operands = max_opno + 1;
 886   d->n_dups = 0;
 887   d->n_alternatives = 0;
 888   d->template = 0;
 889   d->output_format = INSN_OUTPUT_FORMAT_NONE;
 890
 891   place_operands (d);
 892 }
 893
 894 extern int main PARAMS ((int, char **));
 895
 896 int
 897 main (argc, argv)
 898      int argc;
 899      char **argv;
 900 {
 901   rtx desc;
 902
 903   progname = "genoutput";
 904
 905   if (argc <= 1)
 906     fatal ("No input file name.");
 907
 908   if (init_md_reader (argv[1]) != SUCCESS_EXIT_CODE)
 909     return (FATAL_EXIT_CODE);
 910
 911   output_prologue ();
 912   next_code_number = 0;
 913   next_index_number = 0;
 914
 915   /* Read the machine description.  */
 916
 917   while (1)
 918     {
 919       int line_no;
 920
 921       desc = read_md_rtx (&line_no, &next_code_number);
 922       if (desc == NULL)
 923         break;
 924
 925       if (GET_CODE (desc) == DEFINE_INSN)
 926         gen_insn (desc, line_no);
 927       if (GET_CODE (desc) == DEFINE_PEEPHOLE)
 928         gen_peephole (desc, line_no);
 929       if (GET_CODE (desc) == DEFINE_EXPAND)
 930         gen_expand (desc, line_no);
 931       if (GET_CODE (desc) == DEFINE_SPLIT
 932           || GET_CODE (desc) == DEFINE_PEEPHOLE2)
 933         gen_split (desc, line_no);
 934       next_index_number++;
 935     }
 936
 937   printf("\n\n");
 938   output_predicate_decls ();
 939   output_operand_data ();
 940   output_insn_data ();
 941   output_get_insn_name ();
 942
 943   fflush (stdout);
 944   return (ferror (stdout) != 0 || have_error
 945         ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
 946 }
 947
 948 /* Return the number of occurrences of character C in string S or
 949    -1 if S is the null string.  */
 950
 951 static int
 952 n_occurrences (c, s)
 953      int c;
 954      const char *s;
 955 {
 956   int n = 0;
 957
 958   if (s == 0 || *s == '\0')
 959     return -1;
 960
 961   while (*s)
 962     n += (*s++ == c);
 963
 964   return n;
 965 }
 966
 967 /* Remove whitespace in `s' by moving up characters until the end.
 968    Return a new string.  */
 969
 970 static const char *
 971 strip_whitespace (s)
 972      const char *s;
 973 {
 974   char *p, *q;
 975   char ch;
 976
 977   if (s == 0)
 978     return 0;
 979
 980   p = q = xmalloc (strlen (s) + 1);
 981   while ((ch = *s++) != '\0')
 982     if (! ISSPACE (ch))
 983       *p++ = ch;
 984
 985   *p = '\0';
 986   return q;
 987 }