Subversion Repositories openrisc

/* RTL utility routines.

   Copyright (C) 1987, 1988, 1991, 1994, 1997, 1998, 1999, 2000, 2001, 2002,

   2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011

   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 3, 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 COPYING3.  If not see

<http://www.gnu.org/licenses/>.  */

/* This file is compiled twice: once for the generator programs

   once for the compiler.  */

#ifdef GENERATOR_FILE

#include "bconfig.h"

#else

#include "config.h"

#endif

#include "system.h"

#include "coretypes.h"

#include "tm.h"

#include "rtl.h"

#include "ggc.h"

#ifdef GENERATOR_FILE

# include "errors.h"

#else

# include "diagnostic-core.h"

#endif

/* Indexed by rtx code, gives number of operands for an rtx with that code.

   Does NOT include rtx header data (code and links).  */

#define DEF_RTL_EXPR(ENUM, NAME, FORMAT, CLASS)   sizeof FORMAT - 1 ,

const unsigned char rtx_length[NUM_RTX_CODE] = {

#include "rtl.def"

};

#undef DEF_RTL_EXPR

/* Indexed by rtx code, gives the name of that kind of rtx, as a C string.  */

#define DEF_RTL_EXPR(ENUM, NAME, FORMAT, CLASS)   NAME ,

const char * const rtx_name[NUM_RTX_CODE] = {

#include "rtl.def"              /* rtl expressions are documented here */

};

#undef DEF_RTL_EXPR

/* Indexed by rtx code, gives a sequence of operand-types for

   rtx's of that code.  The sequence is a C string in which

   each character describes one operand.  */

const char * const rtx_format[NUM_RTX_CODE] = {

  /* "*" undefined.

         can cause a warning message

     "0" field is unused (or used in a phase-dependent manner)

         prints nothing

     "i" an integer

         prints the integer

     "n" like "i", but prints entries from `note_insn_name'

     "w" an integer of width HOST_BITS_PER_WIDE_INT

         prints the integer

     "s" a pointer to a string

         prints the string

     "S" like "s", but optional:

         the containing rtx may end before this operand

     "T" like "s", but treated specially by the RTL reader;

         only found in machine description patterns.

     "e" a pointer to an rtl expression

         prints the expression

     "E" a pointer to a vector that points to a number of rtl expressions

         prints a list of the rtl expressions

     "V" like "E", but optional:

         the containing rtx may end before this operand

     "u" a pointer to another insn

         prints the uid of the insn.

     "b" is a pointer to a bitmap header.

     "B" is a basic block pointer.

     "t" is a tree pointer.  */

#define DEF_RTL_EXPR(ENUM, NAME, FORMAT, CLASS)   FORMAT ,

#include "rtl.def"              /* rtl expressions are defined here */

#undef DEF_RTL_EXPR

};

/* Indexed by rtx code, gives a character representing the "class" of

   that rtx code.  See rtl.def for documentation on the defined classes.  */

const enum rtx_class rtx_class[NUM_RTX_CODE] = {

#define DEF_RTL_EXPR(ENUM, NAME, FORMAT, CLASS)   CLASS,

#include "rtl.def"              /* rtl expressions are defined here */

#undef DEF_RTL_EXPR

};

/* Indexed by rtx code, gives the size of the rtx in bytes.  */

const unsigned char rtx_code_size[NUM_RTX_CODE] = {

#define DEF_RTL_EXPR(ENUM, NAME, FORMAT, CLASS)                         \

  ((ENUM) == CONST_INT || (ENUM) == CONST_DOUBLE || (ENUM) == CONST_FIXED\

   ? RTX_HDR_SIZE + (sizeof FORMAT - 1) * sizeof (HOST_WIDE_INT)        \

   : RTX_HDR_SIZE + (sizeof FORMAT - 1) * sizeof (rtunion)),

#include "rtl.def"

#undef DEF_RTL_EXPR

};

/* Names for kinds of NOTEs and REG_NOTEs.  */

const char * const note_insn_name[NOTE_INSN_MAX] =

{

#define DEF_INSN_NOTE(NAME) #NAME,

#include "insn-notes.def"

#undef DEF_INSN_NOTE

};

const char * const reg_note_name[REG_NOTE_MAX] =

{

#define DEF_REG_NOTE(NAME) #NAME,

#include "reg-notes.def"

#undef DEF_REG_NOTE

};

#ifdef GATHER_STATISTICS

static int rtx_alloc_counts[(int) LAST_AND_UNUSED_RTX_CODE];

static int rtx_alloc_sizes[(int) LAST_AND_UNUSED_RTX_CODE];

static int rtvec_alloc_counts;

static int rtvec_alloc_sizes;

#endif

/* Allocate an rtx vector of N elements.

   Store the length, and initialize all elements to zero.  */

rtvec

rtvec_alloc (int n)

{

  rtvec rt;

  rt = ggc_alloc_rtvec_sized (n);

  /* Clear out the vector.  */

  memset (&rt->elem[0], 0, n * sizeof (rtx));

  PUT_NUM_ELEM (rt, n);

#ifdef GATHER_STATISTICS

  rtvec_alloc_counts++;

  rtvec_alloc_sizes += n * sizeof (rtx);

#endif

  return rt;

}

/* Create a bitwise copy of VEC.  */

rtvec

shallow_copy_rtvec (rtvec vec)

{

  rtvec newvec;

  int n;

  n = GET_NUM_ELEM (vec);

  newvec = rtvec_alloc (n);

  memcpy (&newvec->elem[0], &vec->elem[0], sizeof (rtx) * n);

  return newvec;

}

/* Return the number of bytes occupied by rtx value X.  */

unsigned int

rtx_size (const_rtx x)

{

  if (GET_CODE (x) == SYMBOL_REF && SYMBOL_REF_HAS_BLOCK_INFO_P (x))

    return RTX_HDR_SIZE + sizeof (struct block_symbol);

  return RTX_CODE_SIZE (GET_CODE (x));

}

/* Allocate an rtx of code CODE.  The CODE is stored in the rtx;

   all the rest is initialized to zero.  */

rtx

rtx_alloc_stat (RTX_CODE code MEM_STAT_DECL)

{

  rtx rt = ggc_alloc_zone_rtx_def_stat (&rtl_zone, RTX_CODE_SIZE (code)

                                        PASS_MEM_STAT);

  /* We want to clear everything up to the FLD array.  Normally, this

     is one int, but we don't want to assume that and it isn't very

     portable anyway; this is.  */

  memset (rt, 0, RTX_HDR_SIZE);

  PUT_CODE (rt, code);

#ifdef GATHER_STATISTICS

  rtx_alloc_counts[code]++;

  rtx_alloc_sizes[code] += RTX_CODE_SIZE (code);

#endif

  return rt;

}

/* Return true if ORIG is a sharable CONST.  */

bool

shared_const_p (const_rtx orig)

{

  gcc_assert (GET_CODE (orig) == CONST);

  /* CONST can be shared if it contains a SYMBOL_REF.  If it contains

     a LABEL_REF, it isn't sharable.  */

  return (GET_CODE (XEXP (orig, 0)) == PLUS

          && GET_CODE (XEXP (XEXP (orig, 0), 0)) == SYMBOL_REF

          && CONST_INT_P(XEXP (XEXP (orig, 0), 1)));

}

/* Create a new copy of an rtx.

   Recursively copies the operands of the rtx,

   except for those few rtx codes that are sharable.  */

rtx

copy_rtx (rtx orig)

{

  rtx copy;

  int i, j;

  RTX_CODE code;

  const char *format_ptr;

  code = GET_CODE (orig);

  switch (code)

    {

    case REG:

    case DEBUG_EXPR:

    case VALUE:

    case CONST_INT:

    case CONST_DOUBLE:

    case CONST_FIXED:

    case CONST_VECTOR:

    case SYMBOL_REF:

    case CODE_LABEL:

    case PC:

    case CC0:

    case RETURN:

    case SIMPLE_RETURN:

    case SCRATCH:

      /* SCRATCH must be shared because they represent distinct values.  */

      return orig;

    case CLOBBER:

      if (REG_P (XEXP (orig, 0)) && REGNO (XEXP (orig, 0)) < FIRST_PSEUDO_REGISTER)

        return orig;

      break;

    case CONST:

      if (shared_const_p (orig))

        return orig;

      break;

      /* A MEM with a constant address is not sharable.  The problem is that

         the constant address may need to be reloaded.  If the mem is shared,

         then reloading one copy of this mem will cause all copies to appear

         to have been reloaded.  */

    default:

      break;

    }

  /* Copy the various flags, fields, and other information.  We assume

     that all fields need copying, and then clear the fields that should

     not be copied.  That is the sensible default behavior, and forces

     us to explicitly document why we are *not* copying a flag.  */

  copy = shallow_copy_rtx (orig);

  /* We do not copy the USED flag, which is used as a mark bit during

     walks over the RTL.  */

  RTX_FLAG (copy, used) = 0;

  format_ptr = GET_RTX_FORMAT (GET_CODE (copy));

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

    switch (*format_ptr++)

      {

      case 'e':

        if (XEXP (orig, i) != NULL)

          XEXP (copy, i) = copy_rtx (XEXP (orig, i));

        break;

      case 'E':

      case 'V':

        if (XVEC (orig, i) != NULL)

          {

            XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));

            for (j = 0; j < XVECLEN (copy, i); j++)

              XVECEXP (copy, i, j) = copy_rtx (XVECEXP (orig, i, j));

          }

        break;

      case 't':

      case 'w':

      case 'i':

      case 's':

      case 'S':

      case 'T':

      case 'u':

      case 'B':

      case '0':

        /* These are left unchanged.  */

        break;

      default:

        gcc_unreachable ();

      }

  return copy;

}

/* Create a new copy of an rtx.  Only copy just one level.  */

rtx

shallow_copy_rtx_stat (const_rtx orig MEM_STAT_DECL)

{

  const unsigned int size = rtx_size (orig);

  rtx const copy = ggc_alloc_zone_rtx_def_stat (&rtl_zone, size PASS_MEM_STAT);

  return (rtx) memcpy (copy, orig, size);

}

/* Nonzero when we are generating CONCATs.  */

int generating_concat_p;

/* Nonzero when we are expanding trees to RTL.  */

int currently_expanding_to_rtl;

/* Same as rtx_equal_p, but call CB on each pair of rtx if CB is not NULL.

   When the callback returns true, we continue with the new pair.

   Whenever changing this function check if rtx_equal_p below doesn't need

   changing as well.  */

int

rtx_equal_p_cb (const_rtx x, const_rtx y, rtx_equal_p_callback_function cb)

{

  int i;

  int j;

  enum rtx_code code;

  const char *fmt;

  rtx nx, ny;

  if (x == y)

    return 1;

  if (x == 0 || y == 0)

    return 0;

  /* Invoke the callback first.  */

  if (cb != NULL

      && ((*cb) (&x, &y, &nx, &ny)))

    return rtx_equal_p_cb (nx, ny, cb);

  code = GET_CODE (x);

  /* Rtx's of different codes cannot be equal.  */

  if (code != GET_CODE (y))

    return 0;

  /* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent.

     (REG:SI x) and (REG:HI x) are NOT equivalent.  */

  if (GET_MODE (x) != GET_MODE (y))

    return 0;

  /* MEMs refering to different address space are not equivalent.  */

  if (code == MEM && MEM_ADDR_SPACE (x) != MEM_ADDR_SPACE (y))

    return 0;

  /* Some RTL can be compared nonrecursively.  */

  switch (code)

    {

    case REG:

      return (REGNO (x) == REGNO (y));

    case LABEL_REF:

      return XEXP (x, 0) == XEXP (y, 0);

    case SYMBOL_REF:

      return XSTR (x, 0) == XSTR (y, 0);

    case DEBUG_EXPR:

    case VALUE:

    case SCRATCH:

    case CONST_DOUBLE:

    case CONST_INT:

    case CONST_FIXED:

      return 0;

    case DEBUG_IMPLICIT_PTR:

      return DEBUG_IMPLICIT_PTR_DECL (x)

             == DEBUG_IMPLICIT_PTR_DECL (y);

    case DEBUG_PARAMETER_REF:

      return DEBUG_PARAMETER_REF_DECL (x)

             == DEBUG_PARAMETER_REF_DECL (x);

    case ENTRY_VALUE:

      return rtx_equal_p_cb (ENTRY_VALUE_EXP (x), ENTRY_VALUE_EXP (y), cb);

    default:

      break;

    }

  /* Compare the elements.  If any pair of corresponding elements

     fail to match, return 0 for the whole thing.  */

  fmt = GET_RTX_FORMAT (code);

  for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)

    {

      switch (fmt[i])

        {

        case 'w':

          if (XWINT (x, i) != XWINT (y, i))

            return 0;

          break;

        case 'n':

        case 'i':

          if (XINT (x, i) != XINT (y, i))

            {

#ifndef GENERATOR_FILE

              if (((code == ASM_OPERANDS && i == 6)

                   || (code == ASM_INPUT && i == 1))

                  && locator_eq (XINT (x, i), XINT (y, i)))

                break;

#endif

              return 0;

            }

          break;

        case 'V':

        case 'E':

          /* Two vectors must have the same length.  */

          if (XVECLEN (x, i) != XVECLEN (y, i))

            return 0;

          /* And the corresponding elements must match.  */

          for (j = 0; j < XVECLEN (x, i); j++)

            if (rtx_equal_p_cb (XVECEXP (x, i, j),

                                XVECEXP (y, i, j), cb) == 0)

              return 0;

          break;

        case 'e':

          if (rtx_equal_p_cb (XEXP (x, i), XEXP (y, i), cb) == 0)

            return 0;

          break;

        case 'S':

        case 's':

          if ((XSTR (x, i) || XSTR (y, i))

              && (! XSTR (x, i) || ! XSTR (y, i)

                  || strcmp (XSTR (x, i), XSTR (y, i))))

            return 0;

          break;

        case 'u':

          /* These are just backpointers, so they don't matter.  */

          break;

        case '0':

        case 't':

          break;

          /* It is believed that rtx's at this level will never

             contain anything but integers and other rtx's,

             except for within LABEL_REFs and SYMBOL_REFs.  */

        default:

          gcc_unreachable ();

        }

    }

  return 1;

}

/* Return 1 if X and Y are identical-looking rtx's.

   This is the Lisp function EQUAL for rtx arguments.

   Whenever changing this function check if rtx_equal_p_cb above doesn't need

   changing as well.  */

int

rtx_equal_p (const_rtx x, const_rtx y)

{

  int i;

  int j;

  enum rtx_code code;

  const char *fmt;

  if (x == y)

    return 1;

  if (x == 0 || y == 0)

    return 0;

  code = GET_CODE (x);

  /* Rtx's of different codes cannot be equal.  */

  if (code != GET_CODE (y))

    return 0;

  /* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent.

     (REG:SI x) and (REG:HI x) are NOT equivalent.  */

  if (GET_MODE (x) != GET_MODE (y))

    return 0;

  /* MEMs refering to different address space are not equivalent.  */

  if (code == MEM && MEM_ADDR_SPACE (x) != MEM_ADDR_SPACE (y))

    return 0;

  /* Some RTL can be compared nonrecursively.  */

  switch (code)

    {

    case REG:

      return (REGNO (x) == REGNO (y));

    case LABEL_REF:

      return XEXP (x, 0) == XEXP (y, 0);

    case SYMBOL_REF:

      return XSTR (x, 0) == XSTR (y, 0);

    case DEBUG_EXPR:

    case VALUE:

    case SCRATCH:

    case CONST_DOUBLE:

    case CONST_INT:

    case CONST_FIXED:

      return 0;

    case DEBUG_IMPLICIT_PTR:

      return DEBUG_IMPLICIT_PTR_DECL (x)

             == DEBUG_IMPLICIT_PTR_DECL (y);

    case DEBUG_PARAMETER_REF:

      return DEBUG_PARAMETER_REF_DECL (x)

             == DEBUG_PARAMETER_REF_DECL (y);

    case ENTRY_VALUE:

      return rtx_equal_p (ENTRY_VALUE_EXP (x), ENTRY_VALUE_EXP (y));

    default:

      break;

    }

  /* Compare the elements.  If any pair of corresponding elements

     fail to match, return 0 for the whole thing.  */

  fmt = GET_RTX_FORMAT (code);

  for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)

    {

      switch (fmt[i])

        {

        case 'w':

          if (XWINT (x, i) != XWINT (y, i))

            return 0;

          break;

        case 'n':

        case 'i':

          if (XINT (x, i) != XINT (y, i))

            {

#ifndef GENERATOR_FILE

              if (((code == ASM_OPERANDS && i == 6)

                   || (code == ASM_INPUT && i == 1))

                  && locator_eq (XINT (x, i), XINT (y, i)))

                break;

#endif

              return 0;

            }

          break;

        case 'V':

        case 'E':

          /* Two vectors must have the same length.  */

          if (XVECLEN (x, i) != XVECLEN (y, i))

            return 0;

          /* And the corresponding elements must match.  */

          for (j = 0; j < XVECLEN (x, i); j++)

            if (rtx_equal_p (XVECEXP (x, i, j),  XVECEXP (y, i, j)) == 0)

              return 0;

          break;

        case 'e':

          if (rtx_equal_p (XEXP (x, i), XEXP (y, i)) == 0)

            return 0;

          break;

        case 'S':

        case 's':

          if ((XSTR (x, i) || XSTR (y, i))

              && (! XSTR (x, i) || ! XSTR (y, i)

                  || strcmp (XSTR (x, i), XSTR (y, i))))

            return 0;

          break;

        case 'u':

          /* These are just backpointers, so they don't matter.  */

          break;

        case '0':

        case 't':

          break;

          /* It is believed that rtx's at this level will never

             contain anything but integers and other rtx's,

             except for within LABEL_REFs and SYMBOL_REFs.  */

        default:

          gcc_unreachable ();

        }

    }

  return 1;

}

/* Iteratively hash rtx X.  */

hashval_t

iterative_hash_rtx (const_rtx x, hashval_t hash)

{

  enum rtx_code code;

  enum machine_mode mode;

  int i, j;

  const char *fmt;

  if (x == NULL_RTX)

    return hash;

  code = GET_CODE (x);

  hash = iterative_hash_object (code, hash);

  mode = GET_MODE (x);

  hash = iterative_hash_object (mode, hash);

  switch (code)

    {

    case REG:

      i = REGNO (x);

      return iterative_hash_object (i, hash);

    case CONST_INT:

      return iterative_hash_object (INTVAL (x), hash);

    case SYMBOL_REF:

      if (XSTR (x, 0))

        return iterative_hash (XSTR (x, 0), strlen (XSTR (x, 0)) + 1,

                               hash);

      return hash;

    case LABEL_REF:

    case DEBUG_EXPR:

    case VALUE:

    case SCRATCH:

    case CONST_DOUBLE:

    case CONST_FIXED:

    case DEBUG_IMPLICIT_PTR:

    case DEBUG_PARAMETER_REF:

      return hash;

    default:

      break;

    }

  fmt = GET_RTX_FORMAT (code);

  for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)

    switch (fmt[i])

      {

      case 'w':

        hash = iterative_hash_object (XWINT (x, i), hash);

        break;

      case 'n':

      case 'i':

        hash = iterative_hash_object (XINT (x, i), hash);

        break;

      case 'V':

      case 'E':

        j = XVECLEN (x, i);

        hash = iterative_hash_object (j, hash);

        for (j = 0; j < XVECLEN (x, i); j++)

          hash = iterative_hash_rtx (XVECEXP (x, i, j), hash);

        break;

      case 'e':

        hash = iterative_hash_rtx (XEXP (x, i), hash);

        break;

      case 'S':

      case 's':