Subversion Repositories scarts

/* Generate code from to output assembler insns as recognized from rtl.

   Copyright (C) 1987, 1988, 1992, 1994, 1995, 1997, 1998, 1999, 2000, 2002,

   2003, 2004, 2005 Free Software Foundation, Inc.

This file is part of GCC.

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.

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 GCC; see the file COPYING.  If not, write to the Free

Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA

02110-1301, USA.  */

/* This program reads the machine description for the compiler target machine

   and produces a file containing these things:

   1. An array of `struct insn_data', which is indexed by insn code number,

   which contains:

     a. `name' is the name for that pattern.  Nameless patterns are

     given a name.

     b. `output' hold either the output template, an array of output

     templates, or an output function.

     c. `genfun' is the function to generate a body for that pattern,

     given operands as arguments.

     d. `n_operands' is the number of distinct operands in the pattern

     for that insn,

     e. `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.

     f. `n_alternatives' is the number of alternatives in the constraints

     of each pattern.

     g. `output_format' tells what type of thing `output' is.

     h. `operand' is the base of an array of operand data for the insn.

   2. An array of `struct insn_operand data', used by `operand' above.

     a. `predicate', an int-valued function, is the match_operand predicate

     for this operand.

     b. `constraint' is the constraint for this operand.  This exists

     only if register constraints appear in match_operand rtx's.

     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.

     d. `mode' is the machine mode that that operand is supposed to have.

     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.

  Thus, the following entry in the machine description

    (define_insn "clrdf"

      [(set (match_operand:DF 0 "general_operand" "")

            (const_int 0))]

      ""

      "clrd %0")

  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 "bconfig.h"

#include "system.h"

#include "coretypes.h"

#include "tm.h"

#include "rtl.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

   this many operands?  */

#define MAX_MAX_OPERANDS 40

static int n_occurrences                (int, const char *);

static const char *strip_whitespace     (const char *);

/* 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).  */

static int next_code_number;

/* This counts all definitions in the md file,

   for the sake of error messages.  */

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;

  const char *predicate;

  const char *constraint;

  enum machine_mode mode;

  unsigned char n_alternatives;

  char address_p;

  char strict_low;

  char eliminable;

  char seen;

};

/* Begin with a null operand at index 0.  */

static struct operand_data null_operand =

{

  0, 0, "", "", VOIDmode, 0, 0, 0, 0, 0

};

static struct operand_data *odata = &null_operand;

static struct operand_data **odata_end = &null_operand.next;

/* Must match the constants in recog.h.  */

#define INSN_OUTPUT_FORMAT_NONE         0       /* abort */

#define INSN_OUTPUT_FORMAT_SINGLE       1       /* const char * */

#define INSN_OUTPUT_FORMAT_MULTI        2       /* const char * const * */

#define INSN_OUTPUT_FORMAT_FUNCTION     3       /* const char * (*)(...) */

/* Record in this chain all information that we will output,

   associated with the code number of the insn.  */

struct data

{

  struct data *next;

  const char *name;

  const char *template;

  int code_number;

  int index_number;

  const char *filename;

  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 */

  int operand_number;           /* Operand index in the big array.  */

  int output_format;            /* INSN_OUTPUT_FORMAT_*.  */

  struct operand_data operand[MAX_MAX_OPERANDS];

};

/* This variable points to the first link in the insn chain.  */

static struct data *idata, **idata_end = &idata;

static void output_prologue (void);

static void output_operand_data (void);

static void output_insn_data (void);

static void output_get_insn_name (void);

static void scan_operands (struct data *, rtx, int, int);

static int compare_operands (struct operand_data *,

                             struct operand_data *);

static void place_operands (struct data *);

static void process_template (struct data *, const char *);

static void validate_insn_alternatives (struct data *);

static void validate_insn_operands (struct data *);

static void gen_insn (rtx, int);

static void gen_peephole (rtx, int);

static void gen_expand (rtx, int);

static void gen_split (rtx, int);

static void check_constraint_len (void);

static int constraint_len (const char *, int);

const char *

get_insn_name (int index)

{

  static char buf[100];

  struct data *i, *last_named = NULL;

  for (i = idata; i ; i = i->next)

    {

      if (i->index_number == index)

        return i->name;

      if (i->name)

        last_named = i;

    }

  if (last_named)

    sprintf(buf, "%s+%d", last_named->name, index - last_named->index_number);

  else

    sprintf(buf, "insn %d", index);

  return buf;

}

static void

output_prologue (void)

{

  printf ("/* Generated automatically by the program `genoutput'\n\

   from the machine description file `md'.  */\n\n");

  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 \"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-attr.h\"\n\n");

  printf ("#include \"recog.h\"\n\n");

  printf ("#include \"toplev.h\"\n");

  printf ("#include \"output.h\"\n");

  printf ("#include \"target.h\"\n");

}

static void

output_operand_data (void)

{

  struct operand_data *d;

  printf ("\nstatic const struct insn_operand_data operand_data[] = \n{\n");

  for (d = odata; d; d = d->next)

    {

      printf ("  {\n");

      printf ("    %s,\n",

              d->predicate && d->predicate[0] ? d->predicate : "0");

      printf ("    \"%s\",\n", d->constraint ? d->constraint : "");

      printf ("    %smode,\n", GET_MODE_NAME (d->mode));

      printf ("    %d,\n", d->strict_low);

      printf ("    %d\n", d->eliminable);

      printf("  },\n");

    }

  printf("};\n\n\n");

}

static void

output_insn_data (void)

{

  struct data *d;

  int name_offset = 0;

  int next_name_offset;

  const char * last_name = 0;

  const char * next_name = 0;

  struct data *n;

  for (n = idata, next_name_offset = 1; n; n = n->next, next_name_offset++)

    if (n->name)

      {

        next_name = n->name;

        break;

      }

  printf ("#if GCC_VERSION >= 2007\n__extension__\n#endif\n");

  printf ("\nconst struct insn_data insn_data[] = \n{\n");

  for (d = idata; d; d = d->next)

    {

      printf ("  /* %s:%d */\n", d->filename, d->lineno);

      printf ("  {\n");

      if (d->name)

        {

          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 (n->name)

                {

                  next_name = n->name;

                  break;

                }

            }

        }

      else

        {

          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);

        }

      switch (d->output_format)

        {

        case INSN_OUTPUT_FORMAT_NONE:

          printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");

          printf ("    { 0 },\n");

          printf ("#else\n");

          printf ("    { 0, 0, 0 },\n");

          printf ("#endif\n");

          break;

        case INSN_OUTPUT_FORMAT_SINGLE:

          {

            const char *p = d->template;

            char prev = 0;

            printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");

            printf ("    { .single =\n");

            printf ("#else\n");

            printf ("    {\n");

            printf ("#endif\n");

            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");

            printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");

            printf ("    },\n");

            printf ("#else\n");

            printf ("    0, 0 },\n");

            printf ("#endif\n");

          }

          break;

        case INSN_OUTPUT_FORMAT_MULTI:

          printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");

          printf ("    { .multi = output_%d },\n", d->code_number);

          printf ("#else\n");

          printf ("    { 0, output_%d, 0 },\n", d->code_number);

          printf ("#endif\n");

          break;

        case INSN_OUTPUT_FORMAT_FUNCTION:

          printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");

          printf ("    { .function = output_%d },\n", d->code_number);

          printf ("#else\n");

          printf ("    { 0, 0, output_%d },\n", d->code_number);

          printf ("#endif\n");

          break;

        default:

          gcc_unreachable ();

        }

      if (d->name && d->name[0] != '*')

        printf ("    (insn_gen_fn) 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 ("    %d\n", d->output_format);

      printf("  },\n");

    }

  printf ("};\n\n\n");

}

static void

output_get_insn_name (void)

{

  printf ("const char *\n");

  printf ("get_insn_name (int code)\n");

  printf ("{\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");

}

/* 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 void

scan_operands (struct data *d, rtx part, int this_address_p,

               int this_strict_low)

{

  int i, j;

  const char *format_ptr;

  int opno;

  if (part == 0)

    return;

  switch (GET_CODE (part))

    {

    case MATCH_OPERAND:

      opno = XINT (part, 0);

      if (opno > max_opno)

        max_opno = opno;

      if (max_opno >= MAX_MAX_OPERANDS)

        {

          message_with_line (d->lineno,

                             "maximum number of operands exceeded");

          have_error = 1;

          return;

        }

      if (d->operand[opno].seen)

        {

          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 = 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:

      opno = XINT (part, 0);

      if (opno > max_opno)

        max_opno = opno;

      if (max_opno >= MAX_MAX_OPERANDS)

        {

          message_with_line (d->lineno,

                             "maximum number of operands exceeded");

          have_error = 1;

          return;

        }

      if (d->operand[opno].seen)

        {

          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 = 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:

    case MATCH_PARALLEL:

      opno = XINT (part, 0);

      if (opno > max_opno)

        max_opno = opno;

      if (max_opno >= MAX_MAX_OPERANDS)

        {

          message_with_line (d->lineno,

                             "maximum number of operands exceeded");

          have_error = 1;

          return;

        }

      if (d->operand[opno].seen)

        {

          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_DUP:

    case MATCH_OP_DUP:

    case MATCH_PAR_DUP:

      ++num_dups;

      break;

    case ADDRESS:

      scan_operands (d, XEXP (part, 0), 1, 0);

      return;

    case STRICT_LOW_PART:

      scan_operands (d, XEXP (part, 0), 0, 1);

      return;

    default:

      break;

    }

  format_ptr = GET_RTX_FORMAT (GET_CODE (part));

  for (i = 0; i < GET_RTX_LENGTH (GET_CODE (part)); i++)

    switch (*format_ptr++)

      {

      case 'e':

      case 'u':

        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 (d, XVECEXP (part, i, j), 0, 0);

        break;

      }

}

/* Compare two operands for content equality.  */

static int

compare_operands (struct operand_data *d0, struct operand_data *d1)

{

  const char *p0, *p1;

  p0 = d0->predicate;

  if (!p0)

    p0 = "";

  p1 = d1->predicate;

  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 (d0->strict_low != d1->strict_low)

    return 0;

  if (d0->eliminable != d1->eliminable)

    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 (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;