osprey-gcc/gcc/fold-const.c

Go to the documentation of this file.

/*
 * Copyright (C) 2006, 2007. QLogic Corporation. All Rights Reserved.
 */

/* Fold a constant sub-tree into a single node for C-compiler
   Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
   2000, 2001, 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, 59 Temple Place - Suite 330, Boston, MA
02111-1307, USA.  */

/*@@ This file should be rewritten to use an arbitrary precision
  @@ representation for "struct tree_int_cst" and "struct tree_real_cst".
  @@ Perhaps the routines could also be used for bc/dc, and made a lib.
  @@ The routines that translate from the ap rep should
  @@ warn if precision et. al. is lost.
  @@ This would also make life easier when this technology is used
  @@ for cross-compilers.  */

/* The entry points in this file are fold, size_int_wide, size_binop
   and force_fit_type.

   fold takes a tree as argument and returns a simplified tree.

   size_binop takes a tree code for an arithmetic operation
   and two operands that are trees, and produces a tree for the
   result, assuming the type comes from `sizetype'.

   size_int takes an integer value, and creates a tree constant
   with type from `sizetype'.

   force_fit_type takes a constant, an overflowable flag and prior
   overflow indicators.  It forces the value to fit the type and sets
   TREE_OVERFLOW and TREE_CONSTANT_OVERFLOW as appropriate.  */

#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "flags.h"
#include "tree.h"
#include "real.h"
#include "rtl.h"
#include "expr.h"
#include "tm_p.h"
#include "toplev.h"
#include "ggc.h"
#include "hashtab.h"
#include "langhooks.h"
#include "md5.h"

/* The following constants represent a bit based encoding of GCC's
   comparison operators.  This encoding simplifies transformations
   on relational comparison operators, such as AND and OR.  */
enum comparison_code {
  COMPCODE_FALSE = 0,
  COMPCODE_LT = 1,
  COMPCODE_EQ = 2,
  COMPCODE_LE = 3,
  COMPCODE_GT = 4,
  COMPCODE_LTGT = 5,
  COMPCODE_GE = 6,
  COMPCODE_ORD = 7,
  COMPCODE_UNORD = 8,
  COMPCODE_UNLT = 9,
  COMPCODE_UNEQ = 10,
  COMPCODE_UNLE = 11,
  COMPCODE_UNGT = 12,
  COMPCODE_NE = 13,
  COMPCODE_UNGE = 14,
  COMPCODE_TRUE = 15
};

static void encode (HOST_WIDE_INT *, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
static void decode (HOST_WIDE_INT *, unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
static bool negate_mathfn_p (enum built_in_function);
static bool negate_expr_p (tree);
static tree negate_expr (tree);
static tree split_tree (tree, enum tree_code, tree *, tree *, tree *, int);
static tree associate_trees (tree, tree, enum tree_code, tree);
static tree const_binop (enum tree_code, tree, tree, int);
static enum tree_code invert_tree_comparison (enum tree_code, bool);
static enum comparison_code comparison_to_compcode (enum tree_code);
static enum tree_code compcode_to_comparison (enum comparison_code);
static tree combine_comparisons (enum tree_code, enum tree_code,
         enum tree_code, tree, tree, tree);
static int truth_value_p (enum tree_code);
static int operand_equal_for_comparison_p (tree, tree, tree);
static int twoval_comparison_p (tree, tree *, tree *, int *);
static tree eval_subst (tree, tree, tree, tree, tree);
static tree pedantic_omit_one_operand (tree, tree, tree);
static tree distribute_bit_expr (enum tree_code, tree, tree, tree);
static tree make_bit_field_ref (tree, tree, int, int, int);
static tree optimize_bit_field_compare (enum tree_code, tree, tree, tree);
static tree decode_field_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
            enum machine_mode *, int *, int *,
            tree *, tree *);
static int all_ones_mask_p (tree, int);
static tree sign_bit_p (tree, tree);
static int simple_operand_p (tree);
static tree range_binop (enum tree_code, tree, tree, int, tree, int);
static tree make_range (tree, int *, tree *, tree *);
static tree build_range_check (tree, tree, int, tree, tree);
static int merge_ranges (int *, tree *, tree *, int, tree, tree, int, tree,
       tree);
static tree fold_range_test (tree);
static tree fold_cond_expr_with_comparison (tree, tree, tree, tree);
static tree unextend (tree, int, int, tree);
static tree fold_truthop (enum tree_code, tree, tree, tree);
static tree optimize_minmax_comparison (tree);
static tree extract_muldiv (tree, tree, enum tree_code, tree);
static tree extract_muldiv_1 (tree, tree, enum tree_code, tree);
static int multiple_of_p (tree, tree, tree);
static tree fold_binary_op_with_conditional_arg (tree, enum tree_code, 
             tree, tree, int);
static bool fold_real_zero_addition_p (tree, tree, int);
static tree fold_mathfn_compare (enum built_in_function, enum tree_code,
         tree, tree, tree);
static tree fold_inf_compare (enum tree_code, tree, tree, tree);
static tree fold_div_compare (enum tree_code, tree, tree, tree);
static bool reorder_operands_p (tree, tree);
static tree fold_negate_const (tree, tree);
static tree fold_not_const (tree, tree);
static tree fold_relational_const (enum tree_code, tree, tree, tree);
static tree fold_relational_hi_lo (enum tree_code *, const tree,
                                   tree *, tree *);
static bool tree_expr_nonzero_p (tree);

/* We know that A1 + B1 = SUM1, using 2's complement arithmetic and ignoring
   overflow.  Suppose A, B and SUM have the same respective signs as A1, B1,
   and SUM1.  Then this yields nonzero if overflow occurred during the
   addition.

   Overflow occurs if A and B have the same sign, but A and SUM differ in
   sign.  Use `^' to test whether signs differ, and `< 0' to isolate the
   sign.  */
#define OVERFLOW_SUM_SIGN(a, b, sum) ((~((a) ^ (b)) & ((a) ^ (sum))) < 0)

/* To do constant folding on INTEGER_CST nodes requires two-word arithmetic.
   We do that by representing the two-word integer in 4 words, with only
   HOST_BITS_PER_WIDE_INT / 2 bits stored in each word, as a positive
   number.  The value of the word is LOWPART + HIGHPART * BASE.  */

#define LOWPART(x) \
  ((x) & (((unsigned HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)) - 1))
#define HIGHPART(x) \
  ((unsigned HOST_WIDE_INT) (x) >> HOST_BITS_PER_WIDE_INT / 2)
#define BASE ((unsigned HOST_WIDE_INT) 1 << HOST_BITS_PER_WIDE_INT / 2)

/* Unpack a two-word integer into 4 words.
   LOW and HI are the integer, as two `HOST_WIDE_INT' pieces.
   WORDS points to the array of HOST_WIDE_INTs.  */

static void
encode (HOST_WIDE_INT *words, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
{
  words[0] = LOWPART (low);
  words[1] = HIGHPART (low);
  words[2] = LOWPART (hi);
  words[3] = HIGHPART (hi);
}

/* Pack an array of 4 words into a two-word integer.
   WORDS points to the array of words.
   The integer is stored into *LOW and *HI as two `HOST_WIDE_INT' pieces.  */

static void
decode (HOST_WIDE_INT *words, unsigned HOST_WIDE_INT *low,
  HOST_WIDE_INT *hi)
{
  *low = words[0] + words[1] * BASE;
  *hi = words[2] + words[3] * BASE;
}

/* T is an INT_CST node.  OVERFLOWABLE indicates if we are interested
   in overflow of the value, when >0 we are only interested in signed
   overflow, for <0 we are interested in any overflow.  OVERFLOWED
   indicates whether overflow has already occurred.  CONST_OVERFLOWED
   indicates whether constant overflow has already occurred.  We force
   T's value to be within range of T's type (by setting to 0 or 1 all
   the bits outside the type's range).  We set TREE_OVERFLOWED if,
    OVERFLOWED is nonzero,
  or OVERFLOWABLE is >0 and signed overflow occurs
  or OVERFLOWABLE is <0 and any overflow occurs
   We set TREE_CONSTANT_OVERFLOWED if,
        CONST_OVERFLOWED is nonzero
  or we set TREE_OVERFLOWED.
  We return either the original T, or a copy.  */

tree
force_fit_type (tree t, int overflowable,
    bool overflowed, bool overflowed_const)
{
  unsigned HOST_WIDE_INT low;
  HOST_WIDE_INT high;
  unsigned int prec;
  int sign_extended_type;

  gcc_assert (TREE_CODE (t) == INTEGER_CST);

  low = TREE_INT_CST_LOW (t);
  high = TREE_INT_CST_HIGH (t);

  if (POINTER_TYPE_P (TREE_TYPE (t))
      || TREE_CODE (TREE_TYPE (t)) == OFFSET_TYPE)
    prec = POINTER_SIZE;
  else
    prec = TYPE_PRECISION (TREE_TYPE (t));
  /* Size types *are* sign extended.  */
  sign_extended_type = (!TYPE_UNSIGNED (TREE_TYPE (t))
      || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
          && TYPE_IS_SIZETYPE (TREE_TYPE (t))));

  /* First clear all bits that are beyond the type's precision.  */

  if (prec >= 2 * HOST_BITS_PER_WIDE_INT)
    ;
  else if (prec > HOST_BITS_PER_WIDE_INT)
    high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
  else
    {
      high = 0;
      if (prec < HOST_BITS_PER_WIDE_INT)
  low &= ~((HOST_WIDE_INT) (-1) << prec);
    }

  if (!sign_extended_type)
    /* No sign extension */;
  else if (prec >= 2 * HOST_BITS_PER_WIDE_INT)
    /* Correct width already.  */;
  else if (prec > HOST_BITS_PER_WIDE_INT)
    {
      /* Sign extend top half? */
      if (high & ((unsigned HOST_WIDE_INT)1
      << (prec - HOST_BITS_PER_WIDE_INT - 1)))
  high |= (HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT);
    }
  else if (prec == HOST_BITS_PER_WIDE_INT)
    {
      if ((HOST_WIDE_INT)low < 0)
  high = -1;
    }
  else
    {
      /* Sign extend bottom half? */
      if (low & ((unsigned HOST_WIDE_INT)1 << (prec - 1)))
  {
    high = -1;
    low |= (HOST_WIDE_INT)(-1) << prec;
  }
    }

  /* If the value changed, return a new node.  */
  if (overflowed || overflowed_const
      || low != TREE_INT_CST_LOW (t) || high != TREE_INT_CST_HIGH (t))
    {
      t = build_int_cst_wide (TREE_TYPE (t), low, high);

      if (overflowed
    || overflowable < 0
    || (overflowable > 0 && sign_extended_type))
  {
    t = copy_node (t);
    TREE_OVERFLOW (t) = 1;
    TREE_CONSTANT_OVERFLOW (t) = 1;
  }
      else if (overflowed_const)
  {
    t = copy_node (t);
    TREE_CONSTANT_OVERFLOW (t) = 1;
  }
    }

  return t;
}

/* Add two doubleword integers with doubleword result.
   Each argument is given as two `HOST_WIDE_INT' pieces.
   One argument is L1 and H1; the other, L2 and H2.
   The value is stored as two `HOST_WIDE_INT' pieces in *LV and *HV.  */

int
add_double (unsigned HOST_WIDE_INT l1, HOST_WIDE_INT h1,
      unsigned HOST_WIDE_INT l2, HOST_WIDE_INT h2,
      unsigned HOST_WIDE_INT *lv, HOST_WIDE_INT *hv)
{
  unsigned HOST_WIDE_INT l;
  HOST_WIDE_INT h;

  l = l1 + l2;
  h = h1 + h2 + (l < l1);

  *lv = l;
  *hv = h;
  return OVERFLOW_SUM_SIGN (h1, h2, h);
}

/* Negate a doubleword integer with doubleword result.
   Return nonzero if the operation overflows, assuming it's signed.
   The argument is given as two `HOST_WIDE_INT' pieces in L1 and H1.
   The value is stored as two `HOST_WIDE_INT' pieces in *LV and *HV.  */

int
neg_double (unsigned HOST_WIDE_INT l1, HOST_WIDE_INT h1,
      unsigned HOST_WIDE_INT *lv, HOST_WIDE_INT *hv)
{
  if (l1 == 0)
    {
      *lv = 0;
      *hv = - h1;
      return (*hv & h1) < 0;
    }
  else
    {
      *lv = -l1;
      *hv = ~h1;
      return 0;
    }
}

/* Multiply two doubleword integers with doubleword result.
   Return nonzero if the operation overflows, assuming it's signed.
   Each argument is given as two `HOST_WIDE_INT' pieces.
   One argument is L1 and H1; the other, L2 and H2.
   The value is stored as two `HOST_WIDE_INT' pieces in *LV and *HV.  */

int
mul_double (unsigned HOST_WIDE_INT l1, HOST_WIDE_INT h1,
      unsigned HOST_WIDE_INT l2, HOST_WIDE_INT h2,
      unsigned HOST_WIDE_INT *lv, HOST_WIDE_INT *hv)
{
  HOST_WIDE_INT arg1[4];
  HOST_WIDE_INT arg2[4];
  HOST_WIDE_INT prod[4 * 2];
  unsigned HOST_WIDE_INT carry;
  int i, j, k;
  unsigned HOST_WIDE_INT toplow, neglow;
  HOST_WIDE_INT tophigh, neghigh;

  encode (arg1, l1, h1);
  encode (arg2, l2, h2);

  memset (prod, 0, sizeof prod);

  for (i = 0; i < 4; i++)
    {
      carry = 0;
      for (j = 0; j < 4; j++)
  {
    k = i + j;
    /* This product is <= 0xFFFE0001, the sum <= 0xFFFF0000.  */
    carry += arg1[i] * arg2[j];
          gcc_assert (arg1[i] * arg2[j] <= 0xFFFE0001);
          gcc_assert (carry <= 0xFFFF0000);
    /* Since prod[p] < 0xFFFF, this sum <= 0xFFFFFFFF.  */
    carry += prod[k];
          gcc_assert (carry <= 0xFFFFFFFF);
    prod[k] = LOWPART (carry);
    carry = HIGHPART (carry);
  }
      prod[i + 4] = carry;
    }

  decode (prod, lv, hv);  /* This ignores prod[4] through prod[4*2-1] */

  /* Check for overflow by calculating the top half of the answer in full;
     it should agree with the low half's sign bit.  */
  decode (prod + 4, &toplow, &tophigh);
  if (h1 < 0)
    {
      neg_double (l2, h2, &neglow, &neghigh);
      add_double (neglow, neghigh, toplow, tophigh, &toplow, &tophigh);
    }
  if (h2 < 0)
    {
      neg_double (l1, h1, &neglow, &neghigh);
      add_double (neglow, neghigh, toplow, tophigh, &toplow, &tophigh);
    }
  return (*hv < 0 ? ~(toplow & tophigh) : toplow | tophigh) != 0;
}

/* Shift the doubleword integer in L1, H1 left by COUNT places
   keeping only PREC bits of result.
   Shift right if COUNT is negative.
   ARITH nonzero specifies arithmetic shifting; otherwise use logical shift.
   Store the value as two `HOST_WIDE_INT' pieces in *LV and *HV.  */

void
lshift_double (unsigned HOST_WIDE_INT l1, HOST_WIDE_INT h1,
         HOST_WIDE_INT count, unsigned int prec,
         unsigned HOST_WIDE_INT *lv, HOST_WIDE_INT *hv, int arith)
{
  unsigned HOST_WIDE_INT signmask;

  if (count < 0)
    {
      rshift_double (l1, h1, -count, prec, lv, hv, arith);
      return;
    }

  if (SHIFT_COUNT_TRUNCATED)
    count %= prec;

  if (count >= 2 * HOST_BITS_PER_WIDE_INT)
    {
      /* Shifting by the host word size is undefined according to the
   ANSI standard, so we must handle this as a special case.  */
      *hv = 0;
      *lv = 0;
    }
  else if (count >= HOST_BITS_PER_WIDE_INT)
    {
      *hv = l1 << (count - HOST_BITS_PER_WIDE_INT);
      *lv = 0;
    }
  else
    {
      *hv = (((unsigned HOST_WIDE_INT) h1 << count)
       | (l1 >> (HOST_BITS_PER_WIDE_INT - count - 1) >> 1));
      *lv = l1 << count;
    }

  /* Sign extend all bits that are beyond the precision.  */

  signmask = -((prec > HOST_BITS_PER_WIDE_INT
    ? ((unsigned HOST_WIDE_INT) *hv
       >> (prec - HOST_BITS_PER_WIDE_INT - 1))
    : (*lv >> (prec - 1))) & 1);

  if (prec >= 2 * HOST_BITS_PER_WIDE_INT)
    ;
  else if (prec >= HOST_BITS_PER_WIDE_INT)
    {
      *hv &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
      *hv |= signmask << (prec - HOST_BITS_PER_WIDE_INT);
    }
  else
    {
      *hv = signmask;
      *lv &= ~((unsigned HOST_WIDE_INT) (-1) << prec);
      *lv |= signmask << prec;
    }
}

/* Shift the doubleword integer in L1, H1 right by COUNT places
   keeping only PREC bits of result.  COUNT must be positive.
   ARITH nonzero specifies arithmetic shifting; otherwise use logical shift.
   Store the value as two `HOST_WIDE_INT' pieces in *LV and *HV.  */

void
rshift_double (unsigned HOST_WIDE_INT l1, HOST_WIDE_INT h1,
         HOST_WIDE_INT count, unsigned int prec,
         unsigned HOST_WIDE_INT *lv, HOST_WIDE_INT *hv,
         int arith)
{
  unsigned HOST_WIDE_INT signmask;

  signmask = (arith
        ? -((unsigned HOST_WIDE_INT) h1 >> (HOST_BITS_PER_WIDE_INT - 1))
        : 0);

  if (SHIFT_COUNT_TRUNCATED)
    count %= prec;

  if (count >= 2 * HOST_BITS_PER_WIDE_INT)
    {
      /* Shifting by the host word size is undefined according to the
   ANSI standard, so we must handle this as a special case.  */
      *hv = 0;
      *lv = 0;
    }
  else if (count >= HOST_BITS_PER_WIDE_INT)
    {
      *hv = 0;
      *lv = (unsigned HOST_WIDE_INT) h1 >> (count - HOST_BITS_PER_WIDE_INT);
    }
  else
    {
      *hv = (unsigned HOST_WIDE_INT) h1 >> count;
      *lv = ((l1 >> count)
       | ((unsigned HOST_WIDE_INT) h1 << (HOST_BITS_PER_WIDE_INT - count - 1) << 1));
    }

  /* Zero / sign extend all bits that are beyond the precision.  */

  if (count >= (HOST_WIDE_INT)prec)
    {
      *hv = signmask;
      *lv = signmask;
    }
  else if ((prec - count) >= 2 * HOST_BITS_PER_WIDE_INT)
    ;
  else if ((prec - count) >= HOST_BITS_PER_WIDE_INT)
    {
      *hv &= ~((HOST_WIDE_INT) (-1) << (prec - count - HOST_BITS_PER_WIDE_INT));
      *hv |= signmask << (prec - count - HOST_BITS_PER_WIDE_INT);
    }
  else
    {
      *hv = signmask;
      *lv &= ~((unsigned HOST_WIDE_INT) (-1) << (prec - count));
      *lv |= signmask << (prec - count);
    }
}

/* Rotate the doubleword integer in L1, H1 left by COUNT places
   keeping only PREC bits of result.
   Rotate right if COUNT is negative.
   Store the value as two `HOST_WIDE_INT' pieces in *LV and *HV.  */

void
lrotate_double (unsigned HOST_WIDE_INT l1, HOST_WIDE_INT h1,
    HOST_WIDE_INT count, unsigned int prec,
    unsigned HOST_WIDE_INT *lv, HOST_WIDE_INT *hv)
{
  unsigned HOST_WIDE_INT s1l, s2l;
  HOST_WIDE_INT s1h, s2h;

  count %= prec;
  if (count < 0)
    count += prec;

  lshift_double (l1, h1, count, prec, &s1l, &s1h, 0);
  rshift_double (l1, h1, prec - count, prec, &s2l, &s2h, 0);
  *lv = s1l | s2l;
  *hv = s1h | s2h;
}

/* Rotate the doubleword integer in L1, H1 left by COUNT places
   keeping only PREC bits of result.  COUNT must be positive.
   Store the value as two `HOST_WIDE_INT' pieces in *LV and *HV.  */

void
rrotate_double (unsigned HOST_WIDE_INT l1, HOST_WIDE_INT h1,
    HOST_WIDE_INT count, unsigned int prec,
    unsigned HOST_WIDE_INT *lv, HOST_WIDE_INT *hv)
{
  unsigned HOST_WIDE_INT s1l, s2l;
  HOST_WIDE_INT s1h, s2h;

  count %= prec;
  if (count < 0)
    count += prec;

  rshift_double (l1, h1, count, prec, &s1l, &s1h, 0);
  lshift_double (l1, h1, prec - count, prec, &s2l, &s2h, 0);
  *lv = s1l | s2l;
  *hv = s1h | s2h;
}

/* Divide doubleword integer LNUM, HNUM by doubleword integer LDEN, HDEN
   for a quotient (stored in *LQUO, *HQUO) and remainder (in *LREM, *HREM).
   CODE is a tree code for a kind of division, one of
   TRUNC_DIV_EXPR, FLOOR_DIV_EXPR, CEIL_DIV_EXPR, ROUND_DIV_EXPR
   or EXACT_DIV_EXPR
   It controls how the quotient is rounded to an integer.
   Return nonzero if the operation overflows.
   UNS nonzero says do unsigned division.  */

int
div_and_round_double (enum tree_code code, int uns,
          unsigned HOST_WIDE_INT lnum_orig, /* num == numerator == dividend */
          HOST_WIDE_INT hnum_orig,
          unsigned HOST_WIDE_INT lden_orig, /* den == denominator == divisor */
          HOST_WIDE_INT hden_orig,
          unsigned HOST_WIDE_INT *lquo,
          HOST_WIDE_INT *hquo, unsigned HOST_WIDE_INT *lrem,
          HOST_WIDE_INT *hrem)
{
  int quo_neg = 0;
  HOST_WIDE_INT num[4 + 1]; /* extra element for scaling.  */
  HOST_WIDE_INT den[4], quo[4];
  int i, j;
  unsigned HOST_WIDE_INT work;
  unsigned HOST_WIDE_INT carry = 0;
  unsigned HOST_WIDE_INT lnum = lnum_orig;
  HOST_WIDE_INT hnum = hnum_orig;
  unsigned HOST_WIDE_INT lden = lden_orig;
  HOST_WIDE_INT hden = hden_orig;
  int overflow = 0;

  if (hden == 0 && lden == 0)
    overflow = 1, lden = 1;

  /* Calculate quotient sign and convert operands to unsigned.  */
  if (!uns)
    {
      if (hnum < 0)
  {
    quo_neg = ~ quo_neg;
    /* (minimum integer) / (-1) is the only overflow case.  */
    if (neg_double (lnum, hnum, &lnum, &hnum)
        && ((HOST_WIDE_INT) lden & hden) == -1)
      overflow = 1;
  }
      if (hden < 0)
  {
    quo_neg = ~ quo_neg;
    neg_double (lden, hden, &lden, &hden);
  }
    }

  if (hnum == 0 && hden == 0)
    {       /* single precision */
      *hquo = *hrem = 0;
      /* This unsigned division rounds toward zero.  */
      *lquo = lnum / lden;
      goto finish_up;
    }

  if (hnum == 0)
    {       /* trivial case: dividend < divisor */
      /* hden != 0 already checked.  */
      *hquo = *lquo = 0;
      *hrem = hnum;
      *lrem = lnum;
      goto finish_up;
    }

  memset (quo, 0, sizeof quo);

  memset (num, 0, sizeof num);  /* to zero 9th element */
  memset (den, 0, sizeof den);

  encode (num, lnum, hnum);
  encode (den, lden, hden);

  /* Special code for when the divisor < BASE.  */
  if (hden == 0 && lden < (unsigned HOST_WIDE_INT) BASE)
    {
      /* hnum != 0 already checked.  */
      for (i = 4 - 1; i >= 0; i--)
  {
    work = num[i] + carry * BASE;
    quo[i] = work / lden;
    carry = work % lden;
  }
    }
  else
    {
      /* Full double precision division,
   with thanks to Don Knuth's "Seminumerical Algorithms".  */
      int num_hi_sig, den_hi_sig;
      unsigned HOST_WIDE_INT quo_est, scale;

      /* Find the highest nonzero divisor digit.  */
      for (i = 4 - 1;; i--)
  if (den[i] != 0)
    {
      den_hi_sig = i;
      break;
    }

      /* Insure that the first digit of the divisor is at least BASE/2.
   This is required by the quotient digit estimation algorithm.  */

      scale = BASE / (den[den_hi_sig] + 1);
      if (scale > 1)
  {   /* scale divisor and dividend */
    carry = 0;
    for (i = 0; i <= 4 - 1; i++)
      {
        work = (num[i] * scale) + carry;
        num[i] = LOWPART (work);
        carry = HIGHPART (work);
      }

    num[4] = carry;
    carry = 0;
    for (i = 0; i <= 4 - 1; i++)
      {
        work = (den[i] * scale) + carry;
        den[i] = LOWPART (work);
        carry = HIGHPART (work);
        if (den[i] != 0) den_hi_sig = i;
      }
  }

      num_hi_sig = 4;

      /* Main loop */
      for (i = num_hi_sig - den_hi_sig - 1; i >= 0; i--)
  {
    /* Guess the next quotient digit, quo_est, by dividing the first
       two remaining dividend digits by the high order quotient digit.
       quo_est is never low and is at most 2 high.  */
    unsigned HOST_WIDE_INT tmp;

    num_hi_sig = i + den_hi_sig + 1;
    work = num[num_hi_sig] * BASE + num[num_hi_sig - 1];
    if (num[num_hi_sig] != den[den_hi_sig])
      quo_est = work / den[den_hi_sig];
    else
      quo_est = BASE - 1;

    /* Refine quo_est so it's usually correct, and at most one high.  */
    tmp = work - quo_est * den[den_hi_sig];
    if (tmp < BASE
        && (den[den_hi_sig - 1] * quo_est
      > (tmp * BASE + num[num_hi_sig - 2])))
      quo_est--;

    /* Try QUO_EST as the quotient digit, by multiplying the
       divisor by QUO_EST and subtracting from the remaining dividend.
       Keep in mind that QUO_EST is the I - 1st digit.  */

    carry = 0;
    for (j = 0; j <= den_hi_sig; j++)
      {
        work = quo_est * den[j] + carry;
        carry = HIGHPART (work);
        work = num[i + j] - LOWPART (work);
        num[i + j] = LOWPART (work);
        carry += HIGHPART (work) != 0;
      }

    /* If quo_est was high by one, then num[i] went negative and
       we need to correct things.  */
    if (num[num_hi_sig] < (HOST_WIDE_INT) carry)
      {
        quo_est--;
        carry = 0;    /* add divisor back in */
        for (j = 0; j <= den_hi_sig; j++)
    {
      work = num[i + j] + den[j] + carry;
      carry = HIGHPART (work);
      num[i + j] = LOWPART (work);
    }

        num [num_hi_sig] += carry;
      }

    /* Store the quotient digit.  */
    quo[i] = quo_est;
  }
    }

  decode (quo, lquo, hquo);

 finish_up:
  /* If result is negative, make it so.  */
  if (quo_neg)
    neg_double (*lquo, *hquo, lquo, hquo);

  /* Compute trial remainder:  rem = num - (quo * den)  */
  mul_double (*lquo, *hquo, lden_orig, hden_orig, lrem, hrem);
  neg_double (*lrem, *hrem, lrem, hrem);
  add_double (lnum_orig, hnum_orig, *lrem, *hrem, lrem, hrem);

  switch (code)
    {
    case TRUNC_DIV_EXPR:
    case TRUNC_MOD_EXPR:  /* round toward zero */
    case EXACT_DIV_EXPR:  /* for this one, it shouldn't matter */
      return overflow;

    case FLOOR_DIV_EXPR:
    case FLOOR_MOD_EXPR:  /* round toward negative infinity */
      if (quo_neg && (*lrem != 0 || *hrem != 0))   /* ratio < 0 && rem != 0 */
  {
    /* quo = quo - 1;  */
    add_double (*lquo, *hquo, (HOST_WIDE_INT) -1, (HOST_WIDE_INT)  -1,
          lquo, hquo);
  }
      else
  return overflow;
      break;

    case CEIL_DIV_EXPR:
    case CEIL_MOD_EXPR:   /* round toward positive infinity */
      if (!quo_neg && (*lrem != 0 || *hrem != 0))  /* ratio > 0 && rem != 0 */
  {
    add_double (*lquo, *hquo, (HOST_WIDE_INT) 1, (HOST_WIDE_INT) 0,
          lquo, hquo);
  }
      else
  return overflow;
      break;

    case ROUND_DIV_EXPR:
    case ROUND_MOD_EXPR:  /* round to closest integer */
      {
  unsigned HOST_WIDE_INT labs_rem = *lrem;
  HOST_WIDE_INT habs_rem = *hrem;
  unsigned HOST_WIDE_INT labs_den = lden, ltwice;
  HOST_WIDE_INT habs_den = hden, htwice;

  /* Get absolute values.  */
  if (*hrem < 0)
    neg_double (*lrem, *hrem, &labs_rem, &habs_rem);
  if (hden < 0)
    neg_double (lden, hden, &labs_den, &habs_den);

  /* If (2 * abs (lrem) >= abs (lden)) */
  mul_double ((HOST_WIDE_INT) 2, (HOST_WIDE_INT) 0,
        labs_rem, habs_rem, &ltwice, &htwice);

  if (((unsigned HOST_WIDE_INT) habs_den
       < (unsigned HOST_WIDE_INT) htwice)
      || (((unsigned HOST_WIDE_INT) habs_den
     == (unsigned HOST_WIDE_INT) htwice)
    && (labs_den < ltwice)))
    {
      if (*hquo < 0)
        /* quo = quo - 1;  */
        add_double (*lquo, *hquo,
        (HOST_WIDE_INT) -1, (HOST_WIDE_INT) -1, lquo, hquo);
      else
        /* quo = quo + 1; */
        add_double (*lquo, *hquo, (HOST_WIDE_INT) 1, (HOST_WIDE_INT) 0,
        lquo, hquo);
    }
  else
    return overflow;
      }
      break;

    default:
      gcc_unreachable ();
    }

  /* Compute true remainder:  rem = num - (quo * den)  */
  mul_double (*lquo, *hquo, lden_orig, hden_orig, lrem, hrem);
  neg_double (*lrem, *hrem, lrem, hrem);
  add_double (lnum_orig, hnum_orig, *lrem, *hrem, lrem, hrem);
  return overflow;
}

/* Return true if built-in mathematical function specified by CODE
   preserves the sign of it argument, i.e. -f(x) == f(-x).  */

static bool
negate_mathfn_p (enum built_in_function code)
{
  switch (code)
    {
    case BUILT_IN_ASIN:
    case BUILT_IN_ASINF:
    case BUILT_IN_ASINL:
    case BUILT_IN_ATAN:
    case BUILT_IN_ATANF:
    case BUILT_IN_ATANL:
    case BUILT_IN_SIN:
    case BUILT_IN_SINF:
    case BUILT_IN_SINL:
    case BUILT_IN_TAN:
    case BUILT_IN_TANF:
    case BUILT_IN_TANL:
      return true;

    default:
      break;
    }
  return false;
}

/* Check whether we may negate an integer constant T without causing
   overflow.  */

bool
may_negate_without_overflow_p (tree t)
{
  unsigned HOST_WIDE_INT val;
  unsigned int prec;
  tree type;

  gcc_assert (TREE_CODE (t) == INTEGER_CST);

  type = TREE_TYPE (t);
  if (TYPE_UNSIGNED (type))
    return false;

  prec = TYPE_PRECISION (type);
  if (prec > HOST_BITS_PER_WIDE_INT)
    {
      if (TREE_INT_CST_LOW (t) != 0)
  return true;
      prec -= HOST_BITS_PER_WIDE_INT;
      val = TREE_INT_CST_HIGH (t);
    }
  else
    val = TREE_INT_CST_LOW (t);
  if (prec < HOST_BITS_PER_WIDE_INT)
    val &= ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
  return val != ((unsigned HOST_WIDE_INT) 1 << (prec - 1));
}

/* Determine whether an expression T can be cheaply negated using
   the function negate_expr.  */

static bool
negate_expr_p (tree t)
{
  tree type;

  if (t == 0)
    return false;

  type = TREE_TYPE (t);

  STRIP_SIGN_NOPS (t);
  switch (TREE_CODE (t))
    {
    case INTEGER_CST:
      if (TYPE_UNSIGNED (type) || ! flag_trapv)
  return true;

      /* Check that -CST will not overflow type.  */
      return may_negate_without_overflow_p (t);

    case REAL_CST:
    case NEGATE_EXPR:
      return true;

    case COMPLEX_CST:
      return negate_expr_p (TREE_REALPART (t))
       && negate_expr_p (TREE_IMAGPART (t));

    case PLUS_EXPR:
      if (FLOAT_TYPE_P (type) && !flag_unsafe_math_optimizations)
  return false;
      /* -(A + B) -> (-B) - A.  */
      if (negate_expr_p (TREE_OPERAND (t, 1))
    && reorder_operands_p (TREE_OPERAND (t, 0),
         TREE_OPERAND (t, 1)))
  return true;
      /* -(A + B) -> (-A) - B.  */
      return negate_expr_p (TREE_OPERAND (t, 0));

    case MINUS_EXPR:
      /* We can't turn -(A-B) into B-A when we honor signed zeros.  */
      return (! FLOAT_TYPE_P (type) || flag_unsafe_math_optimizations)
       && reorder_operands_p (TREE_OPERAND (t, 0),
            TREE_OPERAND (t, 1));

    case MULT_EXPR:
      if (TYPE_UNSIGNED (TREE_TYPE (t)))
        break;

      /* Fall through.  */

    case RDIV_EXPR:
      if (! HONOR_SIGN_DEPENDENT_ROUNDING (TYPE_MODE (TREE_TYPE (t))))
  return negate_expr_p (TREE_OPERAND (t, 1))
         || negate_expr_p (TREE_OPERAND (t, 0));
      break;

    case NOP_EXPR:
      /* Negate -((double)float) as (double)(-float).  */
      if (TREE_CODE (type) == REAL_TYPE)
  {
    tree tem = strip_float_extensions (t);
    if (tem != t)
      return negate_expr_p (tem);
  }
      break;

    case CALL_EXPR:
      /* Negate -f(x) as f(-x).  */
      if (negate_mathfn_p (builtin_mathfn_code (t)))
  return negate_expr_p (TREE_VALUE (TREE_OPERAND (t, 1)));
      break;

    case RSHIFT_EXPR:
      /* Optimize -((int)x >> 31) into (unsigned)x >> 31.  */
      if (TREE_CODE (TREE_OPERAND (t, 1)) == INTEGER_CST)
  {
    tree op1 = TREE_OPERAND (t, 1);
    if (TREE_INT_CST_HIGH (op1) == 0
        && (unsigned HOST_WIDE_INT) (TYPE_PRECISION (type) - 1)
     == TREE_INT_CST_LOW (op1))
      return true;
  }
      break;

    default:
      break;
    }
  return false;
}

/* Given T, an expression, return the negation of T.  Allow for T to be
   null, in which case return null.  */

static tree
negate_expr (tree t)
{
  tree type;
  tree tem;

  if (t == 0)
    return 0;

  type = TREE_TYPE (t);
  STRIP_SIGN_NOPS (t);

  switch (TREE_CODE (t))
    {
    case INTEGER_CST:
      tem = fold_negate_const (t, type);
      if (! TREE_OVERFLOW (tem)
    || TYPE_UNSIGNED (type)
    || ! flag_trapv)
  return tem;
      break;

    case REAL_CST:
      tem = fold_negate_const (t, type);
      /* Two's complement FP formats, such as c4x, may overflow.  */
      if (! TREE_OVERFLOW (tem) || ! flag_trapping_math)
  return fold_convert (type, tem);
      break;

    case COMPLEX_CST:
      {
  tree rpart = negate_expr (TREE_REALPART (t));
  tree ipart = negate_expr (TREE_IMAGPART (t));

  if ((TREE_CODE (rpart) == REAL_CST
       && TREE_CODE (ipart) == REAL_CST)
      || (TREE_CODE (rpart) == INTEGER_CST
    && TREE_CODE (ipart) == INTEGER_CST))
    return build_complex (type, rpart, ipart);
      }
      break;

    case NEGATE_EXPR:
      return fold_convert (type, TREE_OPERAND (t, 0));

    case PLUS_EXPR:
      if (! FLOAT_TYPE_P (type) || flag_unsafe_math_optimizations)
  {
    /* -(A + B) -> (-B) - A.  */
    if (negate_expr_p (TREE_OPERAND (t, 1))
        && reorder_operands_p (TREE_OPERAND (t, 0),
             TREE_OPERAND (t, 1)))
      {
        tem = negate_expr (TREE_OPERAND (t, 1));
        tem = fold (build2 (MINUS_EXPR, TREE_TYPE (t),
          tem, TREE_OPERAND (t, 0)));
        return fold_convert (type, tem);
      }

    /* -(A + B) -> (-A) - B.  */
    if (negate_expr_p (TREE_OPERAND (t, 0)))
      {
        tem = negate_expr (TREE_OPERAND (t, 0));
        tem = fold (build2 (MINUS_EXPR, TREE_TYPE (t),
          tem, TREE_OPERAND (t, 1)));
        return fold_convert (type, tem);
      }
  }
      break;

    case MINUS_EXPR:
      /* - (A - B) -> B - A  */
      if ((! FLOAT_TYPE_P (type) || flag_unsafe_math_optimizations)
    && reorder_operands_p (TREE_OPERAND (t, 0), TREE_OPERAND (t, 1)))
  return fold_convert (type,
           fold (build2 (MINUS_EXPR, TREE_TYPE (t),
             TREE_OPERAND (t, 1),
             TREE_OPERAND (t, 0))));
      break;

    case MULT_EXPR:
      if (TYPE_UNSIGNED (TREE_TYPE (t)))
        break;

      /* Fall through.  */

    case RDIV_EXPR:
      if (! HONOR_SIGN_DEPENDENT_ROUNDING (TYPE_MODE (TREE_TYPE (t))))
  {
    tem = TREE_OPERAND (t, 1);
    if (negate_expr_p (tem))
      return fold_convert (type,
         fold (build2 (TREE_CODE (t), TREE_TYPE (t),
                 TREE_OPERAND (t, 0),
                 negate_expr (tem))));
    tem = TREE_OPERAND (t, 0);
    if (negate_expr_p (tem))
      return fold_convert (type,
         fold (build2 (TREE_CODE (t), TREE_TYPE (t),
                 negate_expr (tem),
                 TREE_OPERAND (t, 1))));
  }
      break;

    case NOP_EXPR:
      /* Convert -((double)float) into (double)(-float).  */
      if (TREE_CODE (type) == REAL_TYPE)
  {
    tem = strip_float_extensions (t);
    if (tem != t && negate_expr_p (tem))
      return fold_convert (type, negate_expr (tem));
  }
      break;

    case CALL_EXPR:
      /* Negate -f(x) as f(-x).  */
      if (negate_mathfn_p (builtin_mathfn_code (t))
    && negate_expr_p (TREE_VALUE (TREE_OPERAND (t, 1))))
  {
    tree fndecl, arg, arglist;

    fndecl = get_callee_fndecl (t);
    arg = negate_expr (TREE_VALUE (TREE_OPERAND (t, 1)));
    arglist = build_tree_list (NULL_TREE, arg);
    return build_function_call_expr (fndecl, arglist);
  }
      break;

    case RSHIFT_EXPR:
      /* Optimize -((int)x >> 31) into (unsigned)x >> 31.  */
      if (TREE_CODE (TREE_OPERAND (t, 1)) == INTEGER_CST)
  {
    tree op1 = TREE_OPERAND (t, 1);
    if (TREE_INT_CST_HIGH (op1) == 0
        && (unsigned HOST_WIDE_INT) (TYPE_PRECISION (type) - 1)
     == TREE_INT_CST_LOW (op1))
      {
        tree ntype = TYPE_UNSIGNED (type)
         ? lang_hooks.types.signed_type (type)
         : lang_hooks.types.unsigned_type (type);
        tree temp = fold_convert (ntype, TREE_OPERAND (t, 0));
        temp = fold (build2 (RSHIFT_EXPR, ntype, temp, op1));
        return fold_convert (type, temp);
      }
  }
      break;

    default:
      break;
    }

  tem = fold (build1 (NEGATE_EXPR, TREE_TYPE (t), t));
  return fold_convert (type, tem);
}

/* Split a tree IN into a constant, literal and variable parts that could be
   combined with CODE to make IN.  "constant" means an expression with
   TREE_CONSTANT but that isn't an actual constant.  CODE must be a
   commutative arithmetic operation.  Store the constant part into *CONP,
   the literal in *LITP and return the variable part.  If a part isn't
   present, set it to null.  If the tree does not decompose in this way,
   return the entire tree as the variable part and the other parts as null.

   If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR.  In that
   case, we negate an operand that was subtracted.  Except if it is a
   literal for which we use *MINUS_LITP instead.

   If NEGATE_P is true, we are negating all of IN, again except a literal
   for which we use *MINUS_LITP instead.

   If IN is itself a literal or constant, return it as appropriate.

   Note that we do not guarantee that any of the three values will be the
   same type as IN, but they will have the same signedness and mode.  */

static tree
split_tree (tree in, enum tree_code code, tree *conp, tree *litp,
      tree *minus_litp, int negate_p)
{
  tree var = 0;

  *conp = 0;
  *litp = 0;
  *minus_litp = 0;

  /* Strip any conversions that don't change the machine mode or signedness.  */
  STRIP_SIGN_NOPS (in);

  if (TREE_CODE (in) == INTEGER_CST || TREE_CODE (in) == REAL_CST)
    *litp = in;
  else if (TREE_CODE (in) == code
     || (! FLOAT_TYPE_P (TREE_TYPE (in))
         /* We can associate addition and subtraction together (even
      though the C standard doesn't say so) for integers because
      the value is not affected.  For reals, the value might be
      affected, so we can't.  */
         && ((code == PLUS_EXPR && TREE_CODE (in) == MINUS_EXPR)
       || (code == MINUS_EXPR && TREE_CODE (in) == PLUS_EXPR))))
    {
      tree op0 = TREE_OPERAND (in, 0);
      tree op1 = TREE_OPERAND (in, 1);
      int neg1_p = TREE_CODE (in) == MINUS_EXPR;
      int neg_litp_p = 0, neg_conp_p = 0, neg_var_p = 0;

      /* First see if either of the operands is a literal, then a constant.  */
      if (TREE_CODE (op0) == INTEGER_CST || TREE_CODE (op0) == REAL_CST)
  *litp = op0, op0 = 0;
      else if (TREE_CODE (op1) == INTEGER_CST || TREE_CODE (op1) == REAL_CST)
  *litp = op1, neg_litp_p = neg1_p, op1 = 0;

      if (op0 != 0 && TREE_CONSTANT (op0))
  *conp = op0, op0 = 0;
      else if (op1 != 0 && TREE_CONSTANT (op1))
  *conp = op1, neg_conp_p = neg1_p, op1 = 0;

      /* If we haven't dealt with either operand, this is not a case we can
   decompose.  Otherwise, VAR is either of the ones remaining, if any.  */
      if (op0 != 0 && op1 != 0)
  var = in;
      else if (op0 != 0)
  var = op0;
      else
  var = op1, neg_var_p = neg1_p;

      /* Now do any needed negations.  */
      if (neg_litp_p)
  *minus_litp = *litp, *litp = 0;
      if (neg_conp_p)
  *conp = negate_expr (*conp);
      if (neg_var_p)
  var = negate_expr (var);
    }
  else if (TREE_CONSTANT (in))
    *conp = in;
  else
    var = in;

  if (negate_p)
    {
      if (*litp)
  *minus_litp = *litp, *litp = 0;
      else if (*minus_litp)
  *litp = *minus_litp, *minus_litp = 0;
      *conp = negate_expr (*conp);
      var = negate_expr (var);
    }

  return var;
}

/* Re-associate trees split by the above function.  T1 and T2 are either
   expressions to associate or null.  Return the new expression, if any.  If
   we build an operation, do it in TYPE and with CODE.  */

static tree
associate_trees (tree t1, tree t2, enum tree_code code, tree type)
{
  if (t1 == 0)
    return t2;
  else if (t2 == 0)
    return t1;

  /* If either input is CODE, a PLUS_EXPR, or a MINUS_EXPR, don't
     try to fold this since we will have infinite recursion.  But do
     deal with any NEGATE_EXPRs.  */
  if (TREE_CODE (t1) == code || TREE_CODE (t2) == code
      || TREE_CODE (t1) == MINUS_EXPR || TREE_CODE (t2) == MINUS_EXPR)
    {
      if (code == PLUS_EXPR)
  {
    if (TREE_CODE (t1) == NEGATE_EXPR)
      return build2 (MINUS_EXPR, type, fold_convert (type, t2),
         fold_convert (type, TREE_OPERAND (t1, 0)));
    else if (TREE_CODE (t2) == NEGATE_EXPR)
      return build2 (MINUS_EXPR, type, fold_convert (type, t1),
         fold_convert (type, TREE_OPERAND (t2, 0)));
    else if (integer_zerop (t2))
      return fold_convert (type, t1);
  }
      else if (code == MINUS_EXPR)
  {
    if (integer_zerop (t2))
      return fold_convert (type, t1);
  }

      return build2 (code, type, fold_convert (type, t1),
         fold_convert (type, t2));
    }

  return fold (build2 (code, type, fold_convert (type, t1),
           fold_convert (type, t2)));
}

/* Combine two integer constants ARG1 and ARG2 under operation CODE
   to produce a new constant.

   If NOTRUNC is nonzero, do not truncate the result to fit the data type.  */

tree
int_const_binop (enum tree_code code, tree arg1, tree arg2, int notrunc)
{
  unsigned HOST_WIDE_INT int1l, int2l;
  HOST_WIDE_INT int1h, int2h;
  unsigned HOST_WIDE_INT low;
  HOST_WIDE_INT hi;
  unsigned HOST_WIDE_INT garbagel;
  HOST_WIDE_INT garbageh;
  tree t;
  tree type = TREE_TYPE (arg1);
  int uns = TYPE_UNSIGNED (type);
  int is_sizetype
    = (TREE_CODE (type) == INTEGER_TYPE && TYPE_IS_SIZETYPE (type));
  int overflow = 0;
  int no_overflow = 0;

  int1l = TREE_INT_CST_LOW (arg1);
  int1h = TREE_INT_CST_HIGH (arg1);
  int2l = TREE_INT_CST_LOW (arg2);
  int2h = TREE_INT_CST_HIGH (arg2);

  switch (code)
    {
    case BIT_IOR_EXPR:
      low = int1l | int2l, hi = int1h | int2h;
      break;

    case BIT_XOR_EXPR:
      low = int1l ^ int2l, hi = int1h ^ int2h;
      break;

    case BIT_AND_EXPR:
      low = int1l & int2l, hi = int1h & int2h;
      break;

    case RSHIFT_EXPR:
      int2l = -int2l;
    case LSHIFT_EXPR:
      /* It's unclear from the C standard whether shifts can overflow.
   The following code ignores overflow; perhaps a C standard
   interpretation ruling is needed.  */
      lshift_double (int1l, int1h, int2l, TYPE_PRECISION (type),
         &low, &hi, !uns);
      no_overflow = 1;
      break;

    case RROTATE_EXPR:
      int2l = - int2l;
    case LROTATE_EXPR:
      lrotate_double (int1l, int1h, int2l, TYPE_PRECISION (type),
          &low, &hi);
      break;

    case PLUS_EXPR:
      overflow = add_double (int1l, int1h, int2l, int2h, &low, &hi);
      break;

    case MINUS_EXPR:
      neg_double (int2l, int2h, &low, &hi);
      add_double (int1l, int1h, low, hi, &low, &hi);
      overflow = OVERFLOW_SUM_SIGN (hi, int2h, int1h);
      break;

    case MULT_EXPR:
      overflow = mul_double (int1l, int1h, int2l, int2h, &low, &hi);
      break;

    case TRUNC_DIV_EXPR:
    case FLOOR_DIV_EXPR: case CEIL_DIV_EXPR:
    case EXACT_DIV_EXPR:
      /* This is a shortcut for a common special case.  */
      if (int2h == 0 && (HOST_WIDE_INT) int2l > 0
    && ! TREE_CONSTANT_OVERFLOW (arg1)
    && ! TREE_CONSTANT_OVERFLOW (arg2)
    && int1h == 0 && (HOST_WIDE_INT) int1l >= 0)
  {
    if (code == CEIL_DIV_EXPR)
      int1l += int2l - 1;

    low = int1l / int2l, hi = 0;
    break;
  }

      /* ... fall through ...  */

    case ROUND_DIV_EXPR:
      if (int2h == 0 && int2l == 1)
  {
    low = int1l, hi = int1h;
    break;
  }
      if (int1l == int2l && int1h == int2h
    && ! (int1l == 0 && int1h == 0))
  {
    low = 1, hi = 0;
    break;
  }
      overflow = div_and_round_double (code, uns, int1l, int1h, int2l, int2h,
               &low, &hi, &garbagel, &garbageh);
      break;

    case TRUNC_MOD_EXPR:
    case FLOOR_MOD_EXPR: case CEIL_MOD_EXPR:
      /* This is a shortcut for a common special case.  */
      if (int2h == 0 && (HOST_WIDE_INT) int2l > 0
    && ! TREE_CONSTANT_OVERFLOW (arg1)
    && ! TREE_CONSTANT_OVERFLOW (arg2)
    && int1h == 0 && (HOST_WIDE_INT) int1l >= 0)
  {
    if (code == CEIL_MOD_EXPR)
      int1l += int2l - 1;
    low = int1l % int2l, hi = 0;
    break;
  }

      /* ... fall through ...  */

    case ROUND_MOD_EXPR:
      overflow = div_and_round_double (code, uns,
               int1l, int1h, int2l, int2h,
               &garbagel, &garbageh, &low, &hi);
      break;

    case MIN_EXPR:
    case MAX_EXPR:
      if (uns)
  low = (((unsigned HOST_WIDE_INT) int1h
    < (unsigned HOST_WIDE_INT) int2h)
         || (((unsigned HOST_WIDE_INT) int1h
        == (unsigned HOST_WIDE_INT) int2h)
       && int1l < int2l));
      else
  low = (int1h < int2h
         || (int1h == int2h && int1l < int2l));

      if (low == (code == MIN_EXPR))
  low = int1l, hi = int1h;
      else
  low = int2l, hi = int2h;
      break;

    default:
      gcc_unreachable ();
    }

  t = build_int_cst_wide (TREE_TYPE (arg1), low, hi);

  if (notrunc)
    {
      /* Propagate overflow flags ourselves.  */
      if (((!uns || is_sizetype) && overflow)
    | TREE_OVERFLOW (arg1) | TREE_OVERFLOW (arg2))
  {
    t = copy_node (t);
    TREE_OVERFLOW (t) = 1;
    TREE_CONSTANT_OVERFLOW (t) = 1;
  }
      else if (TREE_CONSTANT_OVERFLOW (arg1) | TREE_CONSTANT_OVERFLOW (arg2))
  {
    t = copy_node (t);
    TREE_CONSTANT_OVERFLOW (t) = 1;
  }
    }
  else
    t = force_fit_type (t, 1,
      ((!uns || is_sizetype) && overflow)
      | TREE_OVERFLOW (arg1) | TREE_OVERFLOW (arg2),
      TREE_CONSTANT_OVERFLOW (arg1)
      | TREE_CONSTANT_OVERFLOW (arg2));

  return t;
}

/* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
   constant.  We assume ARG1 and ARG2 have the same data type, or at least
   are the same kind of constant and the same machine mode.

   If NOTRUNC is nonzero, do not truncate the result to fit the data type.  */

static tree
const_binop (enum tree_code code, tree arg1, tree arg2, int notrunc)
{
  STRIP_NOPS (arg1);
  STRIP_NOPS (arg2);

  if (TREE_CODE (arg1) == INTEGER_CST)
    return int_const_binop (code, arg1, arg2, notrunc);

  if (TREE_CODE (arg1) == REAL_CST)
    {
      enum machine_mode mode;
      REAL_VALUE_TYPE d1;
      REAL_VALUE_TYPE d2;
      REAL_VALUE_TYPE value;
      REAL_VALUE_TYPE result;
      bool inexact;
      tree t, type;

      d1 = TREE_REAL_CST (arg1);
      d2 = TREE_REAL_CST (arg2);

      type = TREE_TYPE (arg1);
      mode = TYPE_MODE (type);

      /* Don't perform operation if we honor signaling NaNs and
   either operand is a NaN.  */
      if (HONOR_SNANS (mode)
    && (REAL_VALUE_ISNAN (d1) || REAL_VALUE_ISNAN (d2)))
  return NULL_TREE;

      /* Don't perform operation if it would raise a division
   by zero exception.  */
      if (code == RDIV_EXPR
    && REAL_VALUES_EQUAL (d2, dconst0)
    && (flag_trapping_math || ! MODE_HAS_INFINITIES (mode)))
  return NULL_TREE;

      /* If either operand is a NaN, just return it.  Otherwise, set up
   for floating-point trap; we return an overflow.  */
      if (REAL_VALUE_ISNAN (d1))
  return arg1;
      else if (REAL_VALUE_ISNAN (d2))
  return arg2;

      inexact = real_arithmetic (&value, code, &d1, &d2);
      real_convert (&result, mode, &value);

      /* Don't constant fold this floating point operation if the
   result may dependent upon the run-time rounding mode and
   flag_rounding_math is set, or if GCC's software emulation
   is unable to accurately represent the result.  */
      
      if ((flag_rounding_math
     || (REAL_MODE_FORMAT_COMPOSITE_P (mode)
         && !flag_unsafe_math_optimizations))
    && (inexact || !real_identical (&result, &value)))
  return NULL_TREE;

      t = build_real (type, result);

      TREE_OVERFLOW (t) = TREE_OVERFLOW (arg1) | TREE_OVERFLOW (arg2);
      TREE_CONSTANT_OVERFLOW (t)
  = TREE_OVERFLOW (t)
    | TREE_CONSTANT_OVERFLOW (arg1)
    | TREE_CONSTANT_OVERFLOW (arg2);
      return t;
    }
  if (TREE_CODE (arg1) == COMPLEX_CST)
    {
      tree type = TREE_TYPE (arg1);
      tree r1 = TREE_REALPART (arg1);
      tree i1 = TREE_IMAGPART (arg1);
      tree r2 = TREE_REALPART (arg2);
      tree i2 = TREE_IMAGPART (arg2);
      tree t;

      switch (code)
  {
  case PLUS_EXPR:
    t = build_complex (type,
           const_binop (PLUS_EXPR, r1, r2, notrunc),
           const_binop (PLUS_EXPR, i1, i2, notrunc));
    break;

  case MINUS_EXPR:
    t = build_complex (type,
           const_binop (MINUS_EXPR, r1, r2, notrunc),
           const_binop (MINUS_EXPR, i1, i2, notrunc));
    break;

  case MULT_EXPR:
    t = build_complex (type,
           const_binop (MINUS_EXPR,
            const_binop (MULT_EXPR,
                   r1, r2, notrunc),
            const_binop (MULT_EXPR,
                   i1, i2, notrunc),
            notrunc),
           const_binop (PLUS_EXPR,
            const_binop (MULT_EXPR,
                   r1, i2, notrunc),
            const_binop (MULT_EXPR,
                   i1, r2, notrunc),
            notrunc));
    break;

  case RDIV_EXPR:
    {
      tree magsquared
        = const_binop (PLUS_EXPR,
           const_binop (MULT_EXPR, r2, r2, notrunc),
           const_binop (MULT_EXPR, i2, i2, notrunc),
           notrunc);

      t = build_complex (type,
             const_binop
             (INTEGRAL_TYPE_P (TREE_TYPE (r1))
        ? TRUNC_DIV_EXPR : RDIV_EXPR,
        const_binop (PLUS_EXPR,
               const_binop (MULT_EXPR, r1, r2,
                notrunc),
               const_binop (MULT_EXPR, i1, i2,
                notrunc),
               notrunc),
        magsquared, notrunc),
             const_binop
             (INTEGRAL_TYPE_P (TREE_TYPE (r1))
        ? TRUNC_DIV_EXPR : RDIV_EXPR,
        const_binop (MINUS_EXPR,
               const_binop (MULT_EXPR, i1, r2,
                notrunc),
               const_binop (MULT_EXPR, r1, i2,
                notrunc),
               notrunc),
        magsquared, notrunc));
    }
    break;

  default:
    gcc_unreachable ();
  }
      return t;
    }
  return 0;
}

/* Create a size type INT_CST node with NUMBER sign extended.  KIND
   indicates which particular sizetype to create.  */

tree
size_int_kind (HOST_WIDE_INT number, enum size_type_kind kind)
{
  return build_int_cst (sizetype_tab[(int) kind], number);
}

/* Combine operands OP1 and OP2 with arithmetic operation CODE.  CODE
   is a tree code.  The type of the result is taken from the operands.
   Both must be the same type integer type and it must be a size type.
   If the operands are constant, so is the result.  */

tree
size_binop (enum tree_code code, tree arg0, tree arg1)
{
  tree type = TREE_TYPE (arg0);

  gcc_assert (TREE_CODE (type) == INTEGER_TYPE && TYPE_IS_SIZETYPE (type)
        && type == TREE_TYPE (arg1));

  /* Handle the special case of two integer constants faster.  */
  if (TREE_CODE (arg0) == INTEGER_CST && TREE_CODE (arg1) == INTEGER_CST)
    {
      /* And some specific cases even faster than that.  */
      if (code == PLUS_EXPR && integer_zerop (arg0))
  return arg1;
      else if ((code == MINUS_EXPR || code == PLUS_EXPR)
         && integer_zerop (arg1))
  return arg0;
      else if (code == MULT_EXPR && integer_onep (arg0))
  return arg1;

      /* Handle general case of two integer constants.  */
      return int_const_binop (code, arg0, arg1, 0);
    }

  if (arg0 == error_mark_node || arg1 == error_mark_node)
    return error_mark_node;

  return fold (build2 (code, type, arg0, arg1));
}

/* Given two values, either both of sizetype or both of bitsizetype,
   compute the difference between the two values.  Return the value
   in signed type corresponding to the type of the operands.  */

tree
size_diffop (tree arg0, tree arg1)
{
  tree type = TREE_TYPE (arg0);
  tree ctype;

  gcc_assert (TREE_CODE (type) == INTEGER_TYPE && TYPE_IS_SIZETYPE (type)
        && type == TREE_TYPE (arg1));

  /* If the type is already signed, just do the simple thing.  */
  if (!TYPE_UNSIGNED (type))
    return size_binop (MINUS_EXPR, arg0, arg1);

  ctype = type == bitsizetype ? sbitsizetype : ssizetype;

  /* If either operand is not a constant, do the conversions to the signed
     type and subtract.  The hardware will do the right thing with any
     overflow in the subtraction.  */
  if (TREE_CODE (arg0) != INTEGER_CST || TREE_CODE (arg1) != INTEGER_CST)
    return size_binop (MINUS_EXPR, fold_convert (ctype, arg0),
           fold_convert (ctype, arg1));

  /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
     Otherwise, subtract the other way, convert to CTYPE (we know that can't
     overflow) and negate (which can't either).  Special-case a result
     of zero while we're here.  */
  if (tree_int_cst_equal (arg0, arg1))
    return fold_convert (ctype, integer_zero_node);
  else if (tree_int_cst_lt (arg1, arg0))
    return fold_convert (ctype, size_binop (MINUS_EXPR, arg0, arg1));
  else
    return size_binop (MINUS_EXPR, fold_convert (ctype, integer_zero_node),
           fold_convert (ctype, size_binop (MINUS_EXPR,
              arg1, arg0)));
}

/* A subroutine of fold_convert_const handling conversions of an
   INTEGER_CST to another integer type.  */

static tree
fold_convert_const_int_from_int (tree type, tree arg1)
{
  tree t;

  /* Given an integer constant, make new constant with new type,
     appropriately sign-extended or truncated.  */
  t = build_int_cst_wide (type, TREE_INT_CST_LOW (arg1),
        TREE_INT_CST_HIGH (arg1));

  t = force_fit_type (t,
          /* Don't set the overflow when
             converting a pointer  */
          !POINTER_TYPE_P (TREE_TYPE (arg1)),
          (TREE_INT_CST_HIGH (arg1) < 0
           && (TYPE_UNSIGNED (type)
         < TYPE_UNSIGNED (TREE_TYPE (arg1))))
          | TREE_OVERFLOW (arg1),
          TREE_CONSTANT_OVERFLOW (arg1));

  return t;
}

/* A subroutine of fold_convert_const handling conversions a REAL_CST
   to an integer type.  */

static tree
fold_convert_const_int_from_real (enum tree_code code, tree type, tree arg1)
{
  int overflow = 0;
  tree t;

  /* The following code implements the floating point to integer
     conversion rules required by the Java Language Specification,
     that IEEE NaNs are mapped to zero and values that overflow
     the target precision saturate, i.e. values greater than
     INT_MAX are mapped to INT_MAX, and values less than INT_MIN
     are mapped to INT_MIN.  These semantics are allowed by the
     C and C++ standards that simply state that the behavior of
     FP-to-integer conversion is unspecified upon overflow.  */

  HOST_WIDE_INT high, low;
  REAL_VALUE_TYPE r;
  REAL_VALUE_TYPE x = TREE_REAL_CST (arg1);

  switch (code)
    {
    case FIX_TRUNC_EXPR:
      real_trunc (&r, VOIDmode, &x);
      break;

    case FIX_CEIL_EXPR:
      real_ceil (&r, VOIDmode, &x);
      break;

    case FIX_FLOOR_EXPR:
      real_floor (&r, VOIDmode, &x);
      break;

    case FIX_ROUND_EXPR:
      real_round (&r, VOIDmode, &x);
      break;

    default:
      gcc_unreachable ();
    }

  /* If R is NaN, return zero and show we have an overflow.  */
  if (REAL_VALUE_ISNAN (r))
    {
      overflow = 1;
      high = 0;
      low = 0;
    }

  /* See if R is less than the lower bound or greater than the
     upper bound.  */

  if (! overflow)
    {
      tree lt = TYPE_MIN_VALUE (type);
      REAL_VALUE_TYPE l = real_value_from_int_cst (NULL_TREE, lt);
      if (REAL_VALUES_LESS (r, l))
  {
    overflow = 1;
    high = TREE_INT_CST_HIGH (lt);
    low = TREE_INT_CST_LOW (lt);
  }
    }

  if (! overflow)
    {
      tree ut = TYPE_MAX_VALUE (type);
      if (ut)
  {
    REAL_VALUE_TYPE u = real_value_from_int_cst (NULL_TREE, ut);
    if (REAL_VALUES_LESS (u, r))
      {
        overflow = 1;
        high = TREE_INT_CST_HIGH (ut);
        low = TREE_INT_CST_LOW (ut);
      }
  }
    }

  if (! overflow)
    REAL_VALUE_TO_INT (&low, &high, r);

  t = build_int_cst_wide (type, low, high);

  t = force_fit_type (t, -1, overflow | TREE_OVERFLOW (arg1),
          TREE_CONSTANT_OVERFLOW (arg1));
  return t;
}

/* A subroutine of fold_convert_const handling conversions a REAL_CST
   to another floating point type.  */

static tree
fold_convert_const_real_from_real (tree type, tree arg1)
{
  REAL_VALUE_TYPE value;
  tree t;

  real_convert (&value, TYPE_MODE (type), &TREE_REAL_CST (arg1));
  t = build_real (type, value);

  TREE_OVERFLOW (t) = TREE_OVERFLOW (arg1);
  TREE_CONSTANT_OVERFLOW (t)
    = TREE_OVERFLOW (t) | TREE_CONSTANT_OVERFLOW (arg1);
  return t;
}

/* Attempt to fold type conversion operation CODE of expression ARG1 to
   type TYPE.  If no simplification can be done return NULL_TREE.  */

static tree
fold_convert_const (enum tree_code code, tree type, tree arg1)
{
  if (TREE_TYPE (arg1) == type)
    return arg1;

  if (POINTER_TYPE_P (type) || INTEGRAL_TYPE_P (type))
    {
      if (TREE_CODE (arg1) == INTEGER_CST)
  return fold_convert_const_int_from_int (type, arg1);
      else if (TREE_CODE (arg1) == REAL_CST)
  return fold_convert_const_int_from_real (code, type, arg1);
    }
  else if (TREE_CODE (type) == REAL_TYPE)
    {
      if (TREE_CODE (arg1) == INTEGER_CST)
  return build_real_from_int_cst (type, arg1);
      if (TREE_CODE (arg1) == REAL_CST)
  return fold_convert_const_real_from_real (type, arg1);
    }
  return NULL_TREE;
}

/* Construct a vector of zero elements of vector type TYPE.  */

static tree
build_zero_vector (tree type)
{
  tree elem, list;
  int i, units;

  elem = fold_convert_const (NOP_EXPR, TREE_TYPE (type), integer_zero_node);
  units = TYPE_VECTOR_SUBPARTS (type);
  
  list = NULL_TREE;
  for (i = 0; i < units; i++)
    list = tree_cons (NULL_TREE, elem, list);
  return build_vector (type, list);
}

/* Convert expression ARG to type TYPE.  Used by the middle-end for
   simple conversions in preference to calling the front-end's convert.  */

tree
fold_convert (tree type, tree arg)
{
  tree orig = TREE_TYPE (arg);
  tree tem;

  if (type == orig)
    return arg;

  if (TREE_CODE (arg) == ERROR_MARK
      || TREE_CODE (type) == ERROR_MARK
      || TREE_CODE (orig) == ERROR_MARK)
    return error_mark_node;

  if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (orig)
      || lang_hooks.types_compatible_p (TYPE_MAIN_VARIANT (type),
          TYPE_MAIN_VARIANT (orig)))
    return fold (build1 (NOP_EXPR, type, arg));

  switch (TREE_CODE (type))
    {
    case INTEGER_TYPE: case CHAR_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
    case POINTER_TYPE: case REFERENCE_TYPE:
    case OFFSET_TYPE:
      if (TREE_CODE (arg) == INTEGER_CST)
  {
    tem = fold_convert_const (NOP_EXPR, type, arg);
    if (tem != NULL_TREE)
      return tem;
  }
      if (INTEGRAL_TYPE_P (orig) || POINTER_TYPE_P (orig)
    || TREE_CODE (orig) == OFFSET_TYPE)
        return fold (build1 (NOP_EXPR, type, arg));
      if (TREE_CODE (orig) == COMPLEX_TYPE)
  {
    tem = fold (build1 (REALPART_EXPR, TREE_TYPE (orig), arg));
    return fold_convert (type, tem);
  }
      gcc_assert (TREE_CODE (orig) == VECTOR_TYPE
      && tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (orig)));
      return fold (build1 (NOP_EXPR, type, arg));

    case REAL_TYPE:
      if (TREE_CODE (arg) == INTEGER_CST)
  {
    tem = fold_convert_const (FLOAT_EXPR, type, arg);
    if (tem != NULL_TREE)
      return tem;
  }
      else if (TREE_CODE (arg) == REAL_CST)
  {
    tem = fold_convert_const (NOP_EXPR, type, arg);
    if (tem != NULL_TREE)
      return tem;
  }

      switch (TREE_CODE (orig))
  {
  case INTEGER_TYPE: case CHAR_TYPE:
  case BOOLEAN_TYPE: case ENUMERAL_TYPE:
  case POINTER_TYPE: case REFERENCE_TYPE:
    return fold (build1 (FLOAT_EXPR, type, arg));

  case REAL_TYPE:
    return fold (build1 (flag_float_store ? CONVERT_EXPR : NOP_EXPR,
             type, arg));

  case COMPLEX_TYPE:
    tem = fold (build1 (REALPART_EXPR, TREE_TYPE (orig), arg));
    return fold_convert (type, tem);

  default:
    gcc_unreachable ();
  }

    case COMPLEX_TYPE:
      switch (TREE_CODE (orig))
  {
  case INTEGER_TYPE: case CHAR_TYPE:
  case BOOLEAN_TYPE: case ENUMERAL_TYPE:
  case POINTER_TYPE: case REFERENCE_TYPE:
  case REAL_TYPE:
    return build2 (COMPLEX_EXPR, type,
       fold_convert (TREE_TYPE (type), arg),
       fold_convert (TREE_TYPE (type), integer_zero_node));
  case COMPLEX_TYPE:
    {
      tree rpart, ipart;

      if (TREE_CODE (arg) == COMPLEX_EXPR)
        {
    rpart = fold_convert (TREE_TYPE (type), TREE_OPERAND (arg, 0));
    ipart = fold_convert (TREE_TYPE (type), TREE_OPERAND (arg, 1));
    return fold (build2 (COMPLEX_EXPR, type, rpart, ipart));
        }

      arg = save_expr (arg);
      rpart = fold (build1 (REALPART_EXPR, TREE_TYPE (orig), arg));
      ipart = fold (build1 (IMAGPART_EXPR, TREE_TYPE (orig), arg));
      rpart = fold_convert (TREE_TYPE (type), rpart);
      ipart = fold_convert (TREE_TYPE (type), ipart);
      return fold (build2 (COMPLEX_EXPR, type, rpart, ipart));
    }

  default:
    gcc_unreachable ();
  }

    case VECTOR_TYPE:
      if (integer_zerop (arg))
  return build_zero_vector (type);
      gcc_assert (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (orig)));
      gcc_assert (INTEGRAL_TYPE_P (orig) || POINTER_TYPE_P (orig)
      || TREE_CODE (orig) == VECTOR_TYPE);
      return fold (build1 (VIEW_CONVERT_EXPR, type, arg));

    case VOID_TYPE:
      return fold (build1 (CONVERT_EXPR, type, fold_ignored_result (arg)));

    default:
      gcc_unreachable ();
    }
}

/* Return false if expr can be assumed not to be an value, true
   otherwise.  */

static bool
maybe_lvalue_p (tree x)
{
  /* We only need to wrap lvalue tree codes.  */
  switch (TREE_CODE (x))
  {
  case VAR_DECL:
  case PARM_DECL:
  case RESULT_DECL:
  case LABEL_DECL:
  case FUNCTION_DECL:
  case SSA_NAME:

  case COMPONENT_REF:
  case INDIRECT_REF:
  case ALIGN_INDIRECT_REF:
  case MISALIGNED_INDIRECT_REF:
  case ARRAY_REF:
  case ARRAY_RANGE_REF:
  case BIT_FIELD_REF:
  case OBJ_TYPE_REF:

  case REALPART_EXPR:
  case IMAGPART_EXPR:
  case PREINCREMENT_EXPR:
  case PREDECREMENT_EXPR:
  case SAVE_EXPR:
  case TRY_CATCH_EXPR:
  case WITH_CLEANUP_EXPR:
  case COMPOUND_EXPR:
  case MODIFY_EXPR:
  case TARGET_EXPR:
  case COND_EXPR:
  case BIND_EXPR:
  case MIN_EXPR:
  case MAX_EXPR:
    break;

  default:
    /* Assume the worst for front-end tree codes.  */
    if ((int)TREE_CODE (x) >= NUM_TREE_CODES)
      break;
    return false;
  }

  return true;
}

/* Return an expr equal to X but certainly not valid as an lvalue.  */

tree
non_lvalue (tree x)
{
  /* While we are in GIMPLE, NON_LVALUE_EXPR doesn't mean anything to
     us.  */
  if (in_gimple_form)
    return x;

  if (! maybe_lvalue_p (x))
    return x;
  return build1 (NON_LVALUE_EXPR, TREE_TYPE (x), x);
}

/* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
   Zero means allow extended lvalues.  */

int pedantic_lvalues;

/* When pedantic, return an expr equal to X but certainly not valid as a
   pedantic lvalue.  Otherwise, return X.  */

static tree
pedantic_non_lvalue (tree x)
{
  if (pedantic_lvalues)
    return non_lvalue (x);
  else
    return x;
}

/* Given a tree comparison code, return the code that is the logical inverse
   of the given code.  It is not safe to do this for floating-point
   comparisons, except for NE_EXPR and EQ_EXPR, so we receive a machine mode
   as well: if reversing the comparison is unsafe, return ERROR_MARK.  */

static enum tree_code
invert_tree_comparison (enum tree_code code, bool honor_nans)
{
  if (honor_nans && flag_trapping_math)
    return ERROR_MARK;

  switch (code)
    {
    case EQ_EXPR:
      return NE_EXPR;
    case NE_EXPR:
      return EQ_EXPR;
    case GT_EXPR:
      return honor_nans ? UNLE_EXPR : LE_EXPR;
    case GE_EXPR:
      return honor_nans ? UNLT_EXPR : LT_EXPR;
    case LT_EXPR:
      return honor_nans ? UNGE_EXPR : GE_EXPR;
    case LE_EXPR:
      return honor_nans ? UNGT_EXPR : GT_EXPR;
    case LTGT_EXPR:
      return UNEQ_EXPR;
    case UNEQ_EXPR:
      return LTGT_EXPR;
    case UNGT_EXPR:
      return LE_EXPR;
    case UNGE_EXPR:
      return LT_EXPR;
    case UNLT_EXPR:
      return GE_EXPR;
    case UNLE_EXPR:
      return GT_EXPR;
    case ORDERED_EXPR:
      return UNORDERED_EXPR;
    case UNORDERED_EXPR:
      return ORDERED_EXPR;
    default:
      gcc_unreachable ();
    }
}

/* Similar, but return the comparison that results if the operands are
   swapped.  This is safe for floating-point.  */

enum tree_code
swap_tree_comparison (enum tree_code code)
{
  switch (code)
    {
    case EQ_EXPR:
    case NE_EXPR:
      return code;
    case GT_EXPR:
      return LT_EXPR;
    case GE_EXPR:
      return LE_EXPR;
    case LT_EXPR:
      return GT_EXPR;
    case LE_EXPR:
      return GE_EXPR;
    default:
      gcc_unreachable ();
    }
}


/* Convert a comparison tree code from an enum tree_code representation
   into a compcode bit-based encoding.  This function is the inverse of
   compcode_to_comparison.  */

static enum comparison_code
comparison_to_compcode (enum tree_code code)
{
  switch (code)
    {
    case LT_EXPR:
      return COMPCODE_LT;
    case EQ_EXPR:
      return COMPCODE_EQ;
    case LE_EXPR:
      return COMPCODE_LE;
    case GT_EXPR:
      return COMPCODE_GT;
    case NE_EXPR:
      return COMPCODE_NE;
    case GE_EXPR:
      return COMPCODE_GE;
    case ORDERED_EXPR:
      return COMPCODE_ORD;
    case UNORDERED_EXPR:
      return COMPCODE_UNORD;
    case UNLT_EXPR:
      return COMPCODE_UNLT;
    case UNEQ_EXPR:
      return COMPCODE_UNEQ;
    case UNLE_EXPR:
      return COMPCODE_UNLE;
    case UNGT_EXPR:
      return COMPCODE_UNGT;
    case LTGT_EXPR:
      return COMPCODE_LTGT;
    case UNGE_EXPR:
      return COMPCODE_UNGE;
    default:
      gcc_unreachable ();
    }
}

/* Convert a compcode bit-based encoding of a comparison operator back
   to GCC's enum tree_code representation.  This function is the
   inverse of comparison_to_compcode.  */

static enum tree_code
compcode_to_comparison (enum comparison_code code)
{
  switch (code)
    {
    case COMPCODE_LT:
      return LT_EXPR;
    case COMPCODE_EQ:
      return EQ_EXPR;
    case COMPCODE_LE:
      return LE_EXPR;
    case COMPCODE_GT:
      return GT_EXPR;
    case COMPCODE_NE:
      return NE_EXPR;
    case COMPCODE_GE:
      return GE_EXPR;
    case COMPCODE_ORD:
      return ORDERED_EXPR;
    case COMPCODE_UNORD:
      return UNORDERED_EXPR;
    case COMPCODE_UNLT:
      return UNLT_EXPR;
    case COMPCODE_UNEQ:
      return UNEQ_EXPR;
    case COMPCODE_UNLE:
      return UNLE_EXPR;
    case COMPCODE_UNGT:
      return UNGT_EXPR;
    case COMPCODE_LTGT:
      return LTGT_EXPR;
    case COMPCODE_UNGE:
      return UNGE_EXPR;
    default:
      gcc_unreachable ();
    }
}

/* Return a tree for the comparison which is the combination of
   doing the AND or OR (depending on CODE) of the two operations LCODE
   and RCODE on the identical operands LL_ARG and LR_ARG.  Take into account
   the possibility of trapping if the mode has NaNs, and return NULL_TREE
   if this makes the transformation invalid.  */

tree
combine_comparisons (enum tree_code code, enum tree_code lcode,
         enum tree_code rcode, tree truth_type,
         tree ll_arg, tree lr_arg)
{
  bool honor_nans = HONOR_NANS (TYPE_MODE (TREE_TYPE (ll_arg)));
  enum comparison_code lcompcode = comparison_to_compcode (lcode);
  enum comparison_code rcompcode = comparison_to_compcode (rcode);
  enum comparison_code compcode;

  switch (code)
    {
    case TRUTH_AND_EXPR: case TRUTH_ANDIF_EXPR:
      compcode = lcompcode & rcompcode;
      break;

    case TRUTH_OR_EXPR: case TRUTH_ORIF_EXPR:
      compcode = lcompcode | rcompcode;
      break;

    default:
      return NULL_TREE;
    }

  if (!honor_nans)
    {
      /* Eliminate unordered comparisons, as well as LTGT and ORD
   which are not used unless the mode has NaNs.  */
      compcode &= ~COMPCODE_UNORD;
      if (compcode == COMPCODE_LTGT)
  compcode = COMPCODE_NE;
      else if (compcode == COMPCODE_ORD)
  compcode = COMPCODE_TRUE;
    }
   else if (flag_trapping_math)
     {
  /* Check that the original operation and the optimized ones will trap
     under the same condition.  */
  bool ltrap = (lcompcode & COMPCODE_UNORD) == 0
         && (lcompcode != COMPCODE_EQ)
         && (lcompcode != COMPCODE_ORD);
  bool rtrap = (rcompcode & COMPCODE_UNORD) == 0
         && (rcompcode != COMPCODE_EQ)
         && (rcompcode != COMPCODE_ORD);
  bool trap = (compcode & COMPCODE_UNORD) == 0
        && (compcode != COMPCODE_EQ)
        && (compcode != COMPCODE_ORD);

        /* In a short-circuited boolean expression the LHS might be
     such that the RHS, if evaluated, will never trap.  For
     example, in ORD (x, y) && (x < y), we evaluate the RHS only
     if neither x nor y is NaN.  (This is a mixed blessing: for
     example, the expression above will never trap, hence
     optimizing it to x < y would be invalid).  */
        if ((code == TRUTH_ORIF_EXPR && (lcompcode & COMPCODE_UNORD))
            || (code == TRUTH_ANDIF_EXPR && !(lcompcode & COMPCODE_UNORD)))
          rtrap = false;

        /* If the comparison was short-circuited, and only the RHS
     trapped, we may now generate a spurious trap.  */
  if (rtrap && !ltrap
      && (code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR))
    return NULL_TREE;

  /* If we changed the conditions that cause a trap, we lose.  */
  if ((ltrap || rtrap) != trap)
    return NULL_TREE;
      }

  if (compcode == COMPCODE_TRUE)
    return constant_boolean_node (true, truth_type);
  else if (compcode == COMPCODE_FALSE)
    return constant_boolean_node (false, truth_type);
  else
    return fold (build2 (compcode_to_comparison (compcode),
       truth_type, ll_arg, lr_arg));
}

/* Return nonzero if CODE is a tree code that represents a truth value.  */

static int
truth_value_p (enum tree_code code)
{
  return (TREE_CODE_CLASS (code) == tcc_comparison
    || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
    || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
    || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
}

/* Return nonzero if two operands (typically of the same tree node)
   are necessarily equal.  If either argument has side-effects this
   function returns zero.  FLAGS modifies behavior as follows:

   If OEP_ONLY_CONST is set, only return nonzero for constants.
   This function tests whether the operands are indistinguishable;
   it does not test whether they are equal using C's == operation.
   The distinction is important for IEEE floating point, because
   (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
   (2) two NaNs may be indistinguishable, but NaN!=NaN.

   If OEP_ONLY_CONST is unset, a VAR_DECL is considered equal to itself
   even though it may hold multiple values during a function.
   This is because a GCC tree node guarantees that nothing else is
   executed between the evaluation of its "operands" (which may often
   be evaluated in arbitrary order).  Hence if the operands themselves
   don't side-effect, the VAR_DECLs, PARM_DECLs etc... must hold the
   same value in each operand/subexpression.  Hence leaving OEP_ONLY_CONST
   unset means assuming isochronic (or instantaneous) tree equivalence.
   Unless comparing arbitrary expression trees, such as from different
   statements, this flag can usually be left unset.

   If OEP_PURE_SAME is set, then pure functions with identical arguments
   are considered the same.  It is used when the caller has other ways
   to ensure that global memory is unchanged in between.  */

int
operand_equal_p (tree arg0, tree arg1, unsigned int flags)
{
  /* If either is ERROR_MARK, they aren't equal.  */
  if (TREE_CODE (arg0) == ERROR_MARK || TREE_CODE (arg1) == ERROR_MARK)
    return 0;

  /* If both types don't have the same signedness, then we can't consider
     them equal.  We must check this before the STRIP_NOPS calls
     because they may change the signedness of the arguments.  */
  if (TYPE_UNSIGNED (TREE_TYPE (arg0)) != TYPE_UNSIGNED (TREE_TYPE (arg1)))
    return 0;

  STRIP_NOPS (arg0);
  STRIP_NOPS (arg1);

  if (TREE_CODE (arg0) != TREE_CODE (arg1)
      /* This is needed for conversions and for COMPONENT_REF.
   Might as well play it safe and always test this.  */
      || TREE_CODE (TREE_TYPE (arg0)) == ERROR_MARK
      || TREE_CODE (TREE_TYPE (arg1)) == ERROR_MARK
      || TYPE_MODE (TREE_TYPE (arg0)) != TYPE_MODE (TREE_TYPE (arg1)))
    return 0;

  /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
     We don't care about side effects in that case because the SAVE_EXPR
     takes care of that for us. In all other cases, two expressions are
     equal if they have no side effects.  If we have two identical
     expressions with side effects that should be treated the same due
     to the only side effects being identical SAVE_EXPR's, that will
     be detected in the recursive calls below.  */
  if (arg0 == arg1 && ! (flags & OEP_ONLY_CONST)
      && (TREE_CODE (arg0) == SAVE_EXPR
    || (! TREE_SIDE_EFFECTS (arg0) && ! TREE_SIDE_EFFECTS (arg1))))
    return 1;

  /* Next handle constant cases, those for which we can return 1 even
     if ONLY_CONST is set.  */
  if (TREE_CONSTANT (arg0) && TREE_CONSTANT (arg1))
    switch (TREE_CODE (arg0))
      {
      case INTEGER_CST:
  return (! TREE_CONSTANT_OVERFLOW (arg0)
    && ! TREE_CONSTANT_OVERFLOW (arg1)
    && tree_int_cst_equal (arg0, arg1));

      case REAL_CST:
  return (! TREE_CONSTANT_OVERFLOW (arg0)
    && ! TREE_CONSTANT_OVERFLOW (arg1)
    && REAL_VALUES_IDENTICAL (TREE_REAL_CST (arg0),
            TREE_REAL_CST (arg1)));

      case VECTOR_CST:
  {
    tree v1, v2;

    if (TREE_CONSTANT_OVERFLOW (arg0)
        || TREE_CONSTANT_OVERFLOW (arg1))
      return 0;

    v1 = TREE_VECTOR_CST_ELTS (arg0);
    v2 = TREE_VECTOR_CST_ELTS (arg1);
    while (v1 && v2)
      {
        if (!operand_equal_p (TREE_VALUE (v1), TREE_VALUE (v2),
            flags))
    return 0;
        v1 = TREE_CHAIN (v1);
        v2 = TREE_CHAIN (v2);
      }

    return 1;
  }

      case COMPLEX_CST:
  return (operand_equal_p (TREE_REALPART (arg0), TREE_REALPART (arg1),
         flags)
    && operand_equal_p (TREE_IMAGPART (arg0), TREE_IMAGPART (arg1),
            flags));

      case STRING_CST:
  return (TREE_STRING_LENGTH (arg0) == TREE_STRING_LENGTH (arg1)
    && ! memcmp (TREE_STRING_POINTER (arg0),
            TREE_STRING_POINTER (arg1),
            TREE_STRING_LENGTH (arg0)));

      case ADDR_EXPR:
  return operand_equal_p (TREE_OPERAND (arg0, 0), TREE_OPERAND (arg1, 0),
        0);
      default:
  break;
      }

  if (flags & OEP_ONLY_CONST)
    return 0;

/* Define macros to test an operand from arg0 and arg1 for equality and a
   variant that allows null and views null as being different from any
   non-null value.  In the latter case, if either is null, the both
   must be; otherwise, do the normal comparison.  */
#define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \
            TREE_OPERAND (arg1, N), flags)

#define OP_SAME_WITH_NULL(N)        \
  ((!TREE_OPERAND (arg0, N) || !TREE_OPERAND (arg1, N)) \
   ? TREE_OPERAND (arg0, N) == TREE_OPERAND (arg1, N) : OP_SAME (N))

  switch (TREE_CODE_CLASS (TREE_CODE (arg0)))
    {
    case tcc_unary:
      /* Two conversions are equal only if signedness and modes match.  */
      switch (TREE_CODE (arg0))
        {
        case NOP_EXPR:
        case CONVERT_EXPR:
        case FIX_CEIL_EXPR:
        case FIX_TRUNC_EXPR:
        case FIX_FLOOR_EXPR:
        case FIX_ROUND_EXPR:
    if (TYPE_UNSIGNED (TREE_TYPE (arg0))
        != TYPE_UNSIGNED (TREE_TYPE (arg1)))
      return 0;
    break;
  default:
    break;
  }

      return OP_SAME (0);


    case tcc_comparison:
    case tcc_binary:
      if (OP_SAME (0) && OP_SAME (1))
  return 1;

      /* For commutative ops, allow the other order.  */
      return (commutative_tree_code (TREE_CODE (arg0))
        && operand_equal_p (TREE_OPERAND (arg0, 0),
          TREE_OPERAND (arg1, 1), flags)
        && operand_equal_p (TREE_OPERAND (arg0, 1),
          TREE_OPERAND (arg1, 0), flags));

    case tcc_reference:
      /* If either of the pointer (or reference) expressions we are
   dereferencing contain a side effect, these cannot be equal.  */
      if (TREE_SIDE_EFFECTS (arg0)
    || TREE_SIDE_EFFECTS (arg1))
  return 0;

      switch (TREE_CODE (arg0))
  {
  case INDIRECT_REF:
  case ALIGN_INDIRECT_REF:
  case MISALIGNED_INDIRECT_REF:
  case REALPART_EXPR:
  case IMAGPART_EXPR:
    return OP_SAME (0);

  case ARRAY_REF:
  case ARRAY_RANGE_REF:
    /* Operands 2 and 3 may be null.  */
    return (OP_SAME (0)
      && OP_SAME (1)
      && OP_SAME_WITH_NULL (2)
      && OP_SAME_WITH_NULL (3));

  case COMPONENT_REF:
    /* Handle operand 2 the same as for ARRAY_REF.  */
    return OP_SAME (0) && OP_SAME (1) && OP_SAME_WITH_NULL (2);

  case BIT_FIELD_REF:
    return OP_SAME (0) && OP_SAME (1) && OP_SAME (2);

  default:
    return 0;
  }

    case tcc_expression:
      switch (TREE_CODE (arg0))
  {
  case ADDR_EXPR:
  case TRUTH_NOT_EXPR:
    return OP_SAME (0);

  case TRUTH_ANDIF_EXPR:
  case TRUTH_ORIF_EXPR:
    return OP_SAME (0) && OP_SAME (1);

  case TRUTH_AND_EXPR:
  case TRUTH_OR_EXPR:
  case TRUTH_XOR_EXPR:
    if (OP_SAME (0) && OP_SAME (1))
      return 1;

    /* Otherwise take into account this is a commutative operation.  */
    return (operand_equal_p (TREE_OPERAND (arg0, 0),
           TREE_OPERAND (arg1, 1), flags)
      && operand_equal_p (TREE_OPERAND (arg0, 1),
              TREE_OPERAND (arg1, 0), flags));

  case CALL_EXPR:
    /* If the CALL_EXPRs call different functions, then they
       clearly can not be equal.  */
    if (!OP_SAME (0))
      return 0;

    {
      unsigned int cef = call_expr_flags (arg0);
      if (flags & OEP_PURE_SAME)
        cef &= ECF_CONST | ECF_PURE;
      else
        cef &= ECF_CONST;
      if (!cef)
        return 0;
    }

    /* Now see if all the arguments are the same.  operand_equal_p
       does not handle TREE_LIST, so we walk the operands here
       feeding them to operand_equal_p.  */
    arg0 = TREE_OPERAND (arg0, 1);
    arg1 = TREE_OPERAND (arg1, 1);
    while (arg0 && arg1)
      {
        if (! operand_equal_p (TREE_VALUE (arg0), TREE_VALUE (arg1),
             flags))
    return 0;

        arg0 = TREE_CHAIN (arg0);
        arg1 = TREE_CHAIN (arg1);
      }

    /* If we get here and both argument lists are exhausted
       then the CALL_EXPRs are equal.  */
    return ! (arg0 || arg1);

  default:
    return 0;
  }

    case tcc_declaration:
      /* Consider __builtin_sqrt equal to sqrt.  */
      return (TREE_CODE (arg0) == FUNCTION_DECL
        && DECL_BUILT_IN (arg0) && DECL_BUILT_IN (arg1)
        && DECL_BUILT_IN_CLASS (arg0) == DECL_BUILT_IN_CLASS (arg1)
        && DECL_FUNCTION_CODE (arg0) == DECL_FUNCTION_CODE (arg1));

    default:
      return 0;
    }

#undef OP_SAME
#undef OP_SAME_WITH_NULL
}

/* Similar to operand_equal_p, but see if ARG0 might have been made by
   shorten_compare from ARG1 when ARG1 was being compared with OTHER.

   When in doubt, return 0.  */

static int
operand_equal_for_comparison_p (tree arg0, tree arg1, tree other)
{
  int unsignedp1, unsignedpo;
  tree primarg0, primarg1, primother;
  unsigned int correct_width;

  if (operand_equal_p (arg0, arg1, 0))
    return 1;

  if (! INTEGRAL_TYPE_P (TREE_TYPE (arg0))
      || ! INTEGRAL_TYPE_P (TREE_TYPE (arg1)))
    return 0;

  /* Discard any conversions that don't change the modes of ARG0 and ARG1
     and see if the inner values are the same.  This removes any
     signedness comparison, which doesn't matter here.  */
  primarg0 = arg0, primarg1 = arg1;
  STRIP_NOPS (primarg0);
  STRIP_NOPS (primarg1);
  if (operand_equal_p (primarg0, primarg1, 0))
    return 1;

  /* Duplicate what shorten_compare does to ARG1 and see if that gives the
     actual comparison operand, ARG0.

     First throw away any conversions to wider types
     already present in the operands.  */

  primarg1 = get_narrower (arg1, &unsignedp1);
  primother = get_narrower (other, &unsignedpo);

  correct_width = TYPE_PRECISION (TREE_TYPE (arg1));
  if (unsignedp1 == unsignedpo
      && TYPE_PRECISION (TREE_TYPE (primarg1)) < correct_width
      && TYPE_PRECISION (TREE_TYPE (primother)) < correct_width)
    {
      tree type = TREE_TYPE (arg0);

      /* Make sure shorter operand is extended the right way
   to match the longer operand.  */
      primarg1 = fold_convert (lang_hooks.types.signed_or_unsigned_type
             (unsignedp1, TREE_TYPE (primarg1)), primarg1);

      if (operand_equal_p (arg0, fold_convert (type, primarg1), 0))
  return 1;
    }

  return 0;
}

/* See if ARG is an expression that is either a comparison or is performing
   arithmetic on comparisons.  The comparisons must only be comparing
   two different values, which will be stored in *CVAL1 and *CVAL2; if
   they are nonzero it means that some operands have already been found.
   No variables may be used anywhere else in the expression except in the
   comparisons.  If SAVE_P is true it means we removed a SAVE_EXPR around
   the expression and save_expr needs to be called with CVAL1 and CVAL2.

   If this is true, return 1.  Otherwise, return zero.  */

static int
twoval_comparison_p (tree arg, tree *cval1, tree *cval2, int *save_p)
{
  enum tree_code code = TREE_CODE (arg);
  enum tree_code_class class = TREE_CODE_CLASS (code);

  /* We can handle some of the tcc_expression cases here.  */
  if (class == tcc_expression && code == TRUTH_NOT_EXPR)
    class = tcc_unary;
  else if (class == tcc_expression
     && (code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR
         || code == COMPOUND_EXPR))
    class = tcc_binary;

  else if (class == tcc_expression && code == SAVE_EXPR
     && ! TREE_SIDE_EFFECTS (TREE_OPERAND (arg, 0)))
    {
      /* If we've already found a CVAL1 or CVAL2, this expression is
   two complex to handle.  */
      if (*cval1 || *cval2)
  return 0;

      class = tcc_unary;
      *save_p = 1;
    }

  switch (class)
    {
    case tcc_unary:
      return twoval_comparison_p (TREE_OPERAND (arg, 0), cval1, cval2, save_p);

    case tcc_binary:
      return (twoval_comparison_p (TREE_OPERAND (arg, 0), cval1, cval2, save_p)
        && twoval_comparison_p (TREE_OPERAND (arg, 1),
              cval1, cval2, save_p));

    case tcc_constant:
      return 1;

    case tcc_expression:
      if (code == COND_EXPR)
  return (twoval_comparison_p (TREE_OPERAND (arg, 0),
             cval1, cval2, save_p)
    && twoval_comparison_p (TREE_OPERAND (arg, 1),
          cval1, cval2, save_p)
    && twoval_comparison_p (TREE_OPERAND (arg, 2),
          cval1, cval2, save_p));
      return 0;

    case tcc_comparison:
      /* First see if we can handle the first operand, then the second.  For
   the second operand, we know *CVAL1 can't be zero.  It must be that
   one side of the comparison is each of the values; test for the
   case where this isn't true by failing if the two operands
   are the same.  */

      if (operand_equal_p (TREE_OPERAND (arg, 0),
         TREE_OPERAND (arg, 1), 0))
  return 0;

      if (*cval1 == 0)
  *cval1 = TREE_OPERAND (arg, 0);
      else if (operand_equal_p (*cval1, TREE_OPERAND (arg, 0), 0))
  ;
      else if (*cval2 == 0)
  *cval2 = TREE_OPERAND (arg, 0);
      else if (operand_equal_p (*cval2, TREE_OPERAND (arg, 0), 0))
  ;
      else
  return 0;

      if (operand_equal_p (*cval1, TREE_OPERAND (arg, 1), 0))
  ;
      else if (*cval2 == 0)
  *cval2 = TREE_OPERAND (arg, 1);
      else if (operand_equal_p (*cval2, TREE_OPERAND (arg, 1), 0))
  ;
      else
  return 0;

      return 1;

    default:
      return 0;
    }
}

/* ARG is a tree that is known to contain just arithmetic operations and
   comparisons.  Evaluate the operations in the tree substituting NEW0 for
   any occurrence of OLD0 as an operand of a comparison and likewise for
   NEW1 and OLD1.  */

static tree
eval_subst (tree arg, tree old0, tree new0, tree old1, tree new1)
{
  tree type = TREE_TYPE (arg);
  enum tree_code code = TREE_CODE (arg);
  enum tree_code_class class = TREE_CODE_CLASS (code);

  /* We can handle some of the tcc_expression cases here.  */
  if (class == tcc_expression && code == TRUTH_NOT_EXPR)
    class = tcc_unary;
  else if (class == tcc_expression
     && (code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR))
    class = tcc_binary;

  switch (class)
    {
    case tcc_unary:
      return fold (build1 (code, type,
         eval_subst (TREE_OPERAND (arg, 0),
               old0, new0, old1, new1)));

    case tcc_binary:
      return fold (build2 (code, type,
         eval_subst (TREE_OPERAND (arg, 0),
               old0, new0, old1, new1),
         eval_subst (TREE_OPERAND (arg, 1),
               old0, new0, old1, new1)));

    case tcc_expression:
      switch (code)
  {
  case SAVE_EXPR:
    return eval_subst (TREE_OPERAND (arg, 0), old0, new0, old1, new1);

  case COMPOUND_EXPR:
    return eval_subst (TREE_OPERAND (arg, 1), old0, new0, old1, new1);

  case COND_EXPR:
    return fold (build3 (code, type,
             eval_subst (TREE_OPERAND (arg, 0),
             old0, new0, old1, new1),
             eval_subst (TREE_OPERAND (arg, 1),
             old0, new0, old1, new1),
             eval_subst (TREE_OPERAND (arg, 2),
             old0, new0, old1, new1)));
  default:
    break;
  }
      /* Fall through - ???  */

    case tcc_comparison:
      {
  tree arg0 = TREE_OPERAND (arg, 0);
  tree arg1 = TREE_OPERAND (arg, 1);

  /* We need to check both for exact equality and tree equality.  The
     former will be true if the operand has a side-effect.  In that
     case, we know the operand occurred exactly once.  */

  if (arg0 == old0 || operand_equal_p (arg0, old0, 0))
    arg0 = new0;
  else if (arg0 == old1 || operand_equal_p (arg0, old1, 0))
    arg0 = new1;

  if (arg1 == old0 || operand_equal_p (arg1, old0, 0))
    arg1 = new0;
  else if (arg1 == old1 || operand_equal_p (arg1, old1, 0))
    arg1 = new1;

  return fold (build2 (code, type, arg0, arg1));
      }

    default:
      return arg;
    }
}

/* Return a tree for the case when the result of an expression is RESULT
   converted to TYPE and OMITTED was previously an operand of the expression
   but is now not needed (e.g., we folded OMITTED * 0).

   If OMITTED has side effects, we must evaluate it.  Otherwise, just do
   the conversion of RESULT to TYPE.  */

tree
omit_one_operand (tree type, tree result, tree omitted)
{
  tree t = fold_convert (type, result);

  if (TREE_SIDE_EFFECTS (omitted))
    return build2 (COMPOUND_EXPR, type, fold_ignored_result (omitted), t);

  return non_lvalue (t);
}

/* Similar, but call pedantic_non_lvalue instead of non_lvalue.  */

static tree
pedantic_omit_one_operand (tree type, tree result, tree omitted)
{
  tree t = fold_convert (type, result);

  if (TREE_SIDE_EFFECTS (omitted))
    return build2 (COMPOUND_EXPR, type, fold_ignored_result (omitted), t);

  return pedantic_non_lvalue (t);
}

/* Return a tree for the case when the result of an expression is RESULT
   converted to TYPE and OMITTED1 and OMITTED2 were previously operands
   of the expression but are now not needed.

   If OMITTED1 or OMITTED2 has side effects, they must be evaluated.
   If both OMITTED1 and OMITTED2 have side effects, OMITTED1 is
   evaluated before OMITTED2.  Otherwise, if neither has side effects,
   just do the conversion of RESULT to TYPE.  */

tree
omit_two_operands (tree type, tree result, tree omitted1, tree omitted2)
{
  tree t = fold_convert (type, result);

  if (TREE_SIDE_EFFECTS (omitted2))
    t = build2 (COMPOUND_EXPR, type, omitted2, t);
  if (TREE_SIDE_EFFECTS (omitted1))
    t = build2 (COMPOUND_EXPR, type, omitted1, t);

  return TREE_CODE (t) != COMPOUND_EXPR ? non_lvalue (t) : t;
}


/* Return a simplified tree node for the truth-negation of ARG.  This
   never alters ARG itself.  We assume that ARG is an operation that
   returns a truth value (0 or 1).

   FIXME: one would think we would fold the result, but it causes
   problems with the dominator optimizer.  */
tree
invert_truthvalue (tree arg)
{
  tree type = TREE_TYPE (arg);
  enum tree_code code = TREE_CODE (arg);

  if (code == ERROR_MARK)
    return arg;

  /* If this is a comparison, we can simply invert it, except for
     floating-point non-equality comparisons, in which case we just
     enclose a TRUTH_NOT_EXPR around what we have.  */

  if (TREE_CODE_CLASS (code) == tcc_comparison)
    {
      tree op_type = TREE_TYPE (TREE_OPERAND (arg, 0));
      if (FLOAT_TYPE_P (op_type)
    && flag_trapping_math
    && code != ORDERED_EXPR && code != UNORDERED_EXPR
    && code != NE_EXPR && code != EQ_EXPR)
  return build1 (TRUTH_NOT_EXPR, type, arg);
      else
  {
    code = invert_tree_comparison (code,
           HONOR_NANS (TYPE_MODE (op_type)));
    if (code == ERROR_MARK)
      return build1 (TRUTH_NOT_EXPR, type, arg);
    else
      return build2 (code, type,
         TREE_OPERAND (arg, 0), TREE_OPERAND (arg, 1));
  }
    }

  switch (code)
    {
    case INTEGER_CST:
      return constant_boolean_node (integer_zerop (arg), type);

    case TRUTH_AND_EXPR:
      return build2 (TRUTH_OR_EXPR, type,
         invert_truthvalue (TREE_OPERAND (arg, 0)),
         invert_truthvalue (TREE_OPERAND (arg, 1)));

    case TRUTH_OR_EXPR:
      return build2 (TRUTH_AND_EXPR, type,
         invert_truthvalue (TREE_OPERAND (arg, 0)),
         invert_truthvalue (TREE_OPERAND (arg, 1)));

    case TRUTH_XOR_EXPR:
      /* Here we can invert either operand.  We invert the first operand
   unless the second operand is a TRUTH_NOT_EXPR in which case our
   result is the XOR of the first operand with the inside of the
   negation of the second operand.  */

      if (TREE_CODE (TREE_OPERAND (arg, 1)) == TRUTH_NOT_EXPR)
  return build2 (TRUTH_XOR_EXPR, type, TREE_OPERAND (arg, 0),
           TREE_OPERAND (TREE_OPERAND (arg, 1), 0));
      else
  return build2 (TRUTH_XOR_EXPR, type,
           invert_truthvalue (TREE_OPERAND (arg, 0)),
           TREE_OPERAND (arg, 1));

    case TRUTH_ANDIF_EXPR:
      return build2 (TRUTH_ORIF_EXPR, type,
         invert_truthvalue (TREE_OPERAND (arg, 0)),
         invert_truthvalue (TREE_OPERAND (arg, 1)));

    case TRUTH_ORIF_EXPR:
      return build2 (TRUTH_ANDIF_EXPR, type,
         invert_truthvalue (TREE_OPERAND (arg, 0)),
         invert_truthvalue (TREE_OPERAND (arg, 1)));

    case TRUTH_NOT_EXPR:
      return TREE_OPERAND (arg, 0);

    case COND_EXPR:
      return build3 (COND_EXPR, type, TREE_OPERAND (arg, 0),
         invert_truthvalue (TREE_OPERAND (arg, 1)),
         invert_truthvalue (TREE_OPERAND (arg, 2)));

    case COMPOUND_EXPR:
      return build2 (COMPOUND_EXPR, type, TREE_OPERAND (arg, 0),
         invert_truthvalue (TREE_OPERAND (arg, 1)));

    case NON_LVALUE_EXPR:
      return invert_truthvalue (TREE_OPERAND (arg, 0));

    case NOP_EXPR:
      if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
        break;

    case CONVERT_EXPR:
    case FLOAT_EXPR:
      return build1 (TREE_CODE (arg), type,
         invert_truthvalue (TREE_OPERAND (arg, 0)));

    case BIT_AND_EXPR:
      if (!integer_onep (TREE_OPERAND (arg, 1)))
  break;
      return build2 (EQ_EXPR, type, arg,
         fold_convert (type, integer_zero_node));

    case SAVE_EXPR:
      return build1 (TRUTH_NOT_EXPR, type, arg);

    case CLEANUP_POINT_EXPR:
      return build1 (CLEANUP_POINT_EXPR, type,
         invert_truthvalue (TREE_OPERAND (arg, 0)));

    default:
      break;
    }
  gcc_assert (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE);
  return build1 (TRUTH_NOT_EXPR, type, arg);
}

/* Given a bit-wise operation CODE applied to ARG0 and ARG1, see if both
   operands are another bit-wise operation with a common input.  If so,
   distribute the bit operations to save an operation and possibly two if
   constants are involved.  For example, convert
  (A | B) & (A | C) into A | (B & C)
   Further simplification will occur if B and C are constants.

   If this optimization cannot be done, 0 will be returned.  */

static tree
distribute_bit_expr (enum tree_code code, tree type, tree arg0, tree arg1)
{
  tree common;
  tree left, right;

  if (TREE_CODE (arg0) != TREE_CODE (arg1)
      || TREE_CODE (arg0) == code
      || (TREE_CODE (arg0) != BIT_AND_EXPR
    && TREE_CODE (arg0) != BIT_IOR_EXPR))
    return 0;

  if (operand_equal_p (TREE_OPERAND (arg0, 0), TREE_OPERAND (arg1, 0), 0))
    {
      common = TREE_OPERAND (arg0, 0);
      left = TREE_OPERAND (arg0, 1);
      right = TREE_OPERAND (arg1, 1);
    }
  else if (operand_equal_p (TREE_OPERAND (arg0, 0), TREE_OPERAND (arg1, 1), 0))
    {
      common = TREE_OPERAND (arg0, 0);
      left = TREE_OPERAND (arg0, 1);
      right = TREE_OPERAND (arg1, 0);
    }
  else if (operand_equal_p (TREE_OPERAND (arg0, 1), TREE_OPERAND (arg1, 0), 0))
    {
      common = TREE_OPERAND (arg0, 1);
      left = TREE_OPERAND (arg0, 0);
      right = TREE_OPERAND (arg1, 1);
    }
  else if (operand_equal_p (TREE_OPERAND (arg0, 1), TREE_OPERAND (arg1, 1), 0))
    {
      common = TREE_OPERAND (arg0, 1);
      left = TREE_OPERAND (arg0, 0);
      right = TREE_OPERAND (arg1, 0);
    }
  else
    return 0;

  return fold (build2 (TREE_CODE (arg0), type, common,
           fold (build2 (code, type, left, right))));
}

/* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER
   starting at BITPOS.  The field is unsigned if UNSIGNEDP is nonzero.  */

static tree
make_bit_field_ref (tree inner, tree type, int bitsize, int bitpos,
        int unsignedp)
{
  tree result;

  if (bitpos == 0)
    {
      tree size = TYPE_SIZE (TREE_TYPE (inner));
      if ((INTEGRAL_TYPE_P (TREE_TYPE (inner))
     || POINTER_TYPE_P (TREE_TYPE (inner)))
    && host_integerp (size, 0) 
    && tree_low_cst (size, 0) == bitsize)
  return fold_convert (type, inner);
    }

  result = build3 (BIT_FIELD_REF, type, inner,
       size_int (bitsize), bitsize_int (bitpos));

  BIT_FIELD_REF_UNSIGNED (result) = unsignedp;

  return result;
}

/* Optimize a bit-field compare.

   There are two cases:  First is a compare against a constant and the
   second is a comparison of two items where the fields are at the same
   bit position relative to the start of a chunk (byte, halfword, word)
   large enough to contain it.  In these cases we can avoid the shift
   implicit in bitfield extractions.

   For constants, we emit a compare of the shifted constant with the
   BIT_AND_EXPR of a mask and a byte, halfword, or word of the operand being
   compared.  For two fields at the same position, we do the ANDs with the
   similar mask and compare the result of the ANDs.

   CODE is the comparison code, known to be either NE_EXPR or EQ_EXPR.
   COMPARE_TYPE is the type of the comparison, and LHS and RHS
   are the left and right operands of the comparison, respectively.

   If the optimization described above can be done, we return the resulting
   tree.  Otherwise we return zero.  */

static tree
optimize_bit_field_compare (enum tree_code code, tree compare_type,
          tree lhs, tree rhs)
{
  HOST_WIDE_INT lbitpos, lbitsize, rbitpos, rbitsize, nbitpos, nbitsize;
  tree type = TREE_TYPE (lhs);
  tree signed_type, unsigned_type;
  int const_p = TREE_CODE (rhs) == INTEGER_CST;
  enum machine_mode lmode, rmode, nmode;
  int lunsignedp, runsignedp;
  int lvolatilep = 0, rvolatilep = 0;
  tree linner, rinner = NULL_TREE;
  tree mask;
  tree offset;

  /* Get all the information about the extractions being done.  If the bit size
     if the same as the size of the underlying object, we aren't doing an
     extraction at all and so can do nothing.  We also don't want to
     do anything if the inner expression is a PLACEHOLDER_EXPR since we
     then will no longer be able to replace it.  */
  linner = get_inner_reference (lhs, &lbitsize, &lbitpos, &offset, &lmode,
        &lunsignedp, &lvolatilep, false);
  if (linner == lhs || lbitsize == GET_MODE_BITSIZE (lmode) || lbitsize < 0
      || offset != 0 || TREE_CODE (linner) == PLACEHOLDER_EXPR)
    return 0;

 if (!const_p)
   {
     /* If this is not a constant, we can only do something if bit positions,
  sizes, and signedness are the same.  */
     rinner = get_inner_reference (rhs, &rbitsize, &rbitpos, &offset, &rmode,
           &runsignedp, &rvolatilep, false);

     if (rinner == rhs || lbitpos != rbitpos || lbitsize != rbitsize
   || lunsignedp != runsignedp || offset != 0
   || TREE_CODE (rinner) == PLACEHOLDER_EXPR)
       return 0;
   }

  /* See if we can find a mode to refer to this field.  We should be able to,
     but fail if we can't.  */
  nmode = get_best_mode (lbitsize, lbitpos,
       const_p ? TYPE_ALIGN (TREE_TYPE (linner))
       : MIN (TYPE_ALIGN (TREE_TYPE (linner)),
        TYPE_ALIGN (TREE_TYPE (rinner))),
       word_mode, lvolatilep || rvolatilep);
  if (nmode == VOIDmode)
    return 0;

  /* Set signed and unsigned types of the precision of this mode for the
     shifts below.  */
  signed_type = lang_hooks.types.type_for_mode (nmode, 0);
  unsigned_type = lang_hooks.types.type_for_mode (nmode, 1);

  /* Compute the bit position and size for the new reference and our offset
     within it. If the new reference is the same size as the original, we
     won't optimize anything, so return zero.  */
  nbitsize = GET_MODE_BITSIZE (nmode);
  nbitpos = lbitpos & ~ (nbitsize - 1);
  lbitpos -= nbitpos;
  if (nbitsize == lbitsize)
    return 0;

  if (BYTES_BIG_ENDIAN)
    lbitpos = nbitsize - lbitsize - lbitpos;

  /* Make the mask to be used against the extracted field.  */
  mask = build_int_cst (unsigned_type, -1);
  mask = force_fit_type (mask, 0, false, false);
  mask = fold_convert (unsigned_type, mask);
  mask = const_binop (LSHIFT_EXPR, mask, size_int (nbitsize - lbitsize), 0);
  mask = const_binop (RSHIFT_EXPR, mask,
          size_int (nbitsize - lbitsize - lbitpos), 0);

  if (! const_p)
    /* If not comparing with constant, just rework the comparison
       and return.  */
    return build2 (code, compare_type,
       build2 (BIT_AND_EXPR, unsigned_type,
         make_bit_field_ref (linner, unsigned_type,
                 nbitsize, nbitpos, 1),
         mask),
       build2 (BIT_AND_EXPR, unsigned_type,
         make_bit_field_ref (rinner, unsigned_type,
                 nbitsize, nbitpos, 1),
         mask));

  /* Otherwise, we are handling the constant case. See if the constant is too
     big for the field.  Warn and return a tree of for 0 (false) if so.  We do
     this not only for its own sake, but to avoid having to test for this
     error case below.  If we didn't, we might generate wrong code.

     For unsigned fields, the constant shifted right by the field length should
     be all zero.  For signed fields, the high-order bits should agree with
     the sign bit.  */

  if (lunsignedp)
    {
      if (! integer_zerop (const_binop (RSHIFT_EXPR,
          fold_convert (unsigned_type, rhs),
          size_int (lbitsize), 0)))
  {
    warning ("comparison is always %d due to width of bit-field",
       code == NE_EXPR);
    return constant_boolean_node (code == NE_EXPR, compare_type);
  }
    }
  else
    {
      tree tem = const_binop (RSHIFT_EXPR, fold_convert (signed_type, rhs),
            size_int (lbitsize - 1), 0);
      if (! integer_zerop (tem) && ! integer_all_onesp (tem))
  {
    warning ("comparison is always %d due to width of bit-field",
       code == NE_EXPR);
    return constant_boolean_node (code == NE_EXPR, compare_type);
  }
    }

  /* Single-bit compares should always be against zero.  */
  if (lbitsize == 1 && ! integer_zerop (rhs))
    {
      code = code == EQ_EXPR ? NE_EXPR : EQ_EXPR;
      rhs = fold_convert (type, integer_zero_node);
    }

  /* Make a new bitfield reference, shift the constant over the
     appropriate number of bits and mask it with the computed mask
     (in case this was a signed field).  If we changed it, make a new one.  */
  lhs = make_bit_field_ref (linner, unsigned_type, nbitsize, nbitpos, 1);
  if (lvolatilep)
    {
      TREE_SIDE_EFFECTS (lhs) = 1;
      TREE_THIS_VOLATILE (lhs) = 1;
    }

  rhs = fold (const_binop (BIT_AND_EXPR,
         const_binop (LSHIFT_EXPR,
          fold_convert (unsigned_type, rhs),
          size_int (lbitpos), 0),
         mask, 0));

  return build2 (code, compare_type,
     build2 (BIT_AND_EXPR, unsigned_type, lhs, mask),
     rhs);
}

/* Subroutine for fold_truthop: decode a field reference.

   If EXP is a comparison reference, we return the innermost reference.

   *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
   set to the starting bit number.

   If the innermost field can be completely contained in a mode-sized
   unit, *PMODE is set to that mode.  Otherwise, it is set to VOIDmode.

   *PVOLATILEP is set to 1 if the any expression encountered is volatile;
   otherwise it is not changed.

   *PUNSIGNEDP is set to the signedness of the field.

   *PMASK is set to the mask used.  This is either contained in a
   BIT_AND_EXPR or derived from the width of the field.

   *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.

   Return 0 if this is not a component reference or is one that we can't
   do anything with.  */

static tree
decode_field_reference (tree exp, HOST_WIDE_INT *pbitsize,
      HOST_WIDE_INT *pbitpos, enum machine_mode *pmode,
      int *punsignedp, int *pvolatilep,
      tree *pmask, tree *pand_mask)
{
  tree outer_type = 0;
  tree and_mask = 0;
  tree mask, inner, offset;
  tree unsigned_type;
  unsigned int precision;

  /* All the optimizations using this function assume integer fields.
     There are problems with FP fields since the type_for_size call
     below can fail for, e.g., XFmode.  */
  if (! INTEGRAL_TYPE_P (TREE_TYPE (exp)))
    return 0;

  /* We are interested in the bare arrangement of bits, so strip everything
     that doesn't affect the machine mode.  However, record the type of the
     outermost expression if it may matter below.  */
  if (TREE_CODE (exp) == NOP_EXPR
      || TREE_CODE (exp) == CONVERT_EXPR
      || TREE_CODE (exp) == NON_LVALUE_EXPR)
    outer_type = TREE_TYPE (exp);
  STRIP_NOPS (exp);

  if (TREE_CODE (exp) == BIT_AND_EXPR)
    {
      and_mask = TREE_OPERAND (exp, 1);
      exp = TREE_OPERAND (exp, 0);
      STRIP_NOPS (exp); STRIP_NOPS (and_mask);
      if (TREE_CODE (and_mask) != INTEGER_CST)
  return 0;
    }

  inner = get_inner_reference (exp, pbitsize, pbitpos, &offset, pmode,
             punsignedp, pvolatilep, false);
  if ((inner == exp && and_mask == 0)
      || *pbitsize < 0 || offset != 0
      || TREE_CODE (inner) == PLACEHOLDER_EXPR)
    return 0;

  /* If the number of bits in the reference is the same as the bitsize of
     the outer type, then the outer type gives the signedness. Otherwise
     (in case of a small bitfield) the signedness is unchanged.  */
  if (outer_type && *pbitsize == TYPE_PRECISION (outer_type))
    *punsignedp = TYPE_UNSIGNED (outer_type);

  /* Compute the mask to access the bitfield.  */
  unsigned_type = lang_hooks.types.type_for_size (*pbitsize, 1);
  precision = TYPE_PRECISION (unsigned_type);

  mask = build_int_cst (unsigned_type, -1);
  mask = force_fit_type (mask, 0, false, false);

  mask = const_binop (LSHIFT_EXPR, mask, size_int (precision - *pbitsize), 0);
  mask = const_binop (RSHIFT_EXPR, mask, size_int (precision - *pbitsize), 0);

  /* Merge it with the mask we found in the BIT_AND_EXPR, if any.  */
  if (and_mask != 0)
    mask = fold (build2 (BIT_AND_EXPR, unsigned_type,
       fold_convert (unsigned_type, and_mask), mask));

  *pmask = mask;
  *pand_mask = and_mask;
  return inner;
}

/* Return nonzero if MASK represents a mask of SIZE ones in the low-order
   bit positions.  */

static int
all_ones_mask_p (tree mask, int size)
{
  tree type = TREE_TYPE (mask);
  unsigned int precision = TYPE_PRECISION (type);
  tree tmask;

  tmask = build_int_cst (lang_hooks.types.signed_type (type), -1);
  tmask = force_fit_type (tmask, 0, false, false);

  return
    tree_int_cst_equal (mask,
      const_binop (RSHIFT_EXPR,
             const_binop (LSHIFT_EXPR, tmask,
              size_int (precision - size),
              0),
             size_int (precision - size), 0));
}

/* Subroutine for fold: determine if VAL is the INTEGER_CONST that
   represents the sign bit of EXP's type.  If EXP represents a sign
   or zero extension, also test VAL against the unextended type.
   The return value is the (sub)expression whose sign bit is VAL,
   or NULL_TREE otherwise.  */

static tree
sign_bit_p (tree exp, tree val)
{
  unsigned HOST_WIDE_INT mask_lo, lo;
  HOST_WIDE_INT mask_hi, hi;
  int width;
  tree t;

  /* Tree EXP must have an integral type.  */
  t = TREE_TYPE (exp);
  if (! INTEGRAL_TYPE_P (t))
    return NULL_TREE;

  /* Tree VAL must be an integer constant.  */
  if (TREE_CODE (val) != INTEGER_CST
      || TREE_CONSTANT_OVERFLOW (val))
    return NULL_TREE;

  width = TYPE_PRECISION (t);
  if (width > HOST_BITS_PER_WIDE_INT)
    {
      hi = (unsigned HOST_WIDE_INT) 1 << (width - HOST_BITS_PER_WIDE_INT - 1);
      lo = 0;

      mask_hi = ((unsigned HOST_WIDE_INT) -1
     >> (2 * HOST_BITS_PER_WIDE_INT - width));
      mask_lo = -1;
    }
  else
    {
      hi = 0;
      lo = (unsigned HOST_WIDE_INT) 1 << (width - 1);

      mask_hi = 0;
      mask_lo = ((unsigned HOST_WIDE_INT) -1
     >> (HOST_BITS_PER_WIDE_INT - width));
    }

  /* We mask off those bits beyond TREE_TYPE (exp) so that we can
     treat VAL as if it were unsigned.  */
  if ((TREE_INT_CST_HIGH (val) & mask_hi) == hi
      && (TREE_INT_CST_LOW (val) & mask_lo) == lo)
    return exp;

  /* Handle extension from a narrower type.  */
  if (TREE_CODE (exp) == NOP_EXPR
      && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0))) < width)
    return sign_bit_p (TREE_OPERAND (exp, 0), val);

  return NULL_TREE;
}

/* Subroutine for fold_truthop: determine if an operand is simple enough
   to be evaluated unconditionally.  */

static int
simple_operand_p (tree exp)
{
  /* Strip any conversions that don't change the machine mode.  */
  STRIP_NOPS (exp);

  return (CONSTANT_CLASS_P (exp)
    || TREE_CODE (exp) == SSA_NAME
    || (DECL_P (exp)
        && ! TREE_ADDRESSABLE (exp)
        && ! TREE_THIS_VOLATILE (exp)
        && ! DECL_NONLOCAL (exp)
        /* Don't regard global variables as simple.  They may be
     allocated in ways unknown to the compiler (shared memory,
     #pragma weak, etc).  */
        && ! TREE_PUBLIC (exp)
        && ! DECL_EXTERNAL (exp)
        /* Loading a static variable is unduly expensive, but global
     registers aren't expensive.  */
        && (! TREE_STATIC (exp) || DECL_REGISTER (exp))));
}

/* The following functions are subroutines to fold_range_test and allow it to
   try to change a logical combination of comparisons into a range test.

   For example, both
  X == 2 || X == 3 || X == 4 || X == 5
   and
  X >= 2 && X <= 5
   are converted to
  (unsigned) (X - 2) <= 3

   We describe each set of comparisons as being either inside or outside
   a range, using a variable named like IN_P, and then describe the
   range with a lower and upper bound.  If one of the bounds is omitted,
   it represents either the highest or lowest value of the type.

   In the comments below, we represent a range by two numbers in brackets
   preceded by a "+" to designate being inside that range, or a "-" to
   designate being outside that range, so the condition can be inverted by
   flipping the prefix.  An omitted bound is represented by a "-".  For
   example, "- [-, 10]" means being outside the range starting at the lowest
   possible value and ending at 10, in other words, being greater than 10.
   The range "+ [-, -]" is always true and hence the range "- [-, -]" is
   always false.

   We set up things so that the missing bounds are handled in a consistent
   manner so neither a missing bound nor "true" and "false" need to be
   handled using a special case.  */

/* Return the result of applying CODE to ARG0 and ARG1, but handle the case
   of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
   and UPPER1_P are nonzero if the respective argument is an upper bound
   and zero for a lower.  TYPE, if nonzero, is the type of the result; it
   must be specified for a comparison.  ARG1 will be converted to ARG0's
   type if both are specified.  */

static tree
range_binop (enum tree_code code, tree type, tree arg0, int upper0_p,
       tree arg1, int upper1_p)
{
  tree tem;
  int result;
  int sgn0, sgn1;

  /* If neither arg represents infinity, do the normal operation.
     Else, if not a comparison, return infinity.  Else handle the special
     comparison rules. Note that most of the cases below won't occur, but
     are handled for consistency.  */

  if (arg0 != 0 && arg1 != 0)
    {
      tem = fold (build2 (code, type != 0 ? type : TREE_TYPE (arg0),
        arg0, fold_convert (TREE_TYPE (arg0), arg1)));
      STRIP_NOPS (tem);
      return TREE_CODE (tem) == INTEGER_CST ? tem : 0;
    }

  if (TREE_CODE_CLASS (code) != tcc_comparison)
    return 0;

  /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
     for neither.  In real maths, we cannot assume open ended ranges are
     the same. But, this is computer arithmetic, where numbers are finite.
     We can therefore make the transformation of any unbounded range with
     the value Z, Z being greater than any representable number. This permits
     us to treat unbounded ranges as equal.  */
  sgn0 = arg0 != 0 ? 0 : (upper0_p ? 1 : -1);
  sgn1 = arg1 != 0 ? 0 : (upper1_p ? 1 : -1);
  switch (code)
    {
    case EQ_EXPR:
      result = sgn0 == sgn1;
      break;
    case NE_EXPR:
      result = sgn0 != sgn1;
      break;
    case LT_EXPR:
      result = sgn0 < sgn1;
      break;
    case LE_EXPR:
      result = sgn0 <= sgn1;
      break;
    case GT_EXPR:
      result = sgn0 > sgn1;
      break;
    case GE_EXPR:
      result = sgn0 >= sgn1;
      break;
    default:
      gcc_unreachable ();
    }

  return constant_boolean_node (result, type);
}

/* Given EXP, a logical expression, set the range it is testing into
   variables denoted by PIN_P, PLOW, and PHIGH.  Return the expression
   actually being tested.  *PLOW and *PHIGH will be made of the same type
   as the returned expression.  If EXP is not a comparison, we will most
   likely not be returning a useful value and range.  */

static tree
make_range (tree exp, int *pin_p, tree *plow, tree *phigh)
{
  enum tree_code code;
  tree arg0 = NULL_TREE, arg1 = NULL_TREE;
  tree exp_type = NULL_TREE, arg0_type = NULL_TREE;
  int in_p, n_in_p;
  tree low, high, n_low, n_high;

  /* Start with simply saying "EXP != 0" and then look at the code of EXP
     and see if we can refine the range.  Some of the cases below may not
     happen, but it doesn't seem worth worrying about this.  We "continue"
     the outer loop when we've changed something; otherwise we "break"
     the switch, which will "break" the while.  */

  in_p = 0;
  low = high = fold_convert (TREE_TYPE (exp), integer_zero_node);

  while (1)
    {
      code = TREE_CODE (exp);
      exp_type = TREE_TYPE (exp);

      if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
  {
    if (TREE_CODE_LENGTH (code) > 0)
      arg0 = TREE_OPERAND (exp, 0);
    if (TREE_CODE_CLASS (code) == tcc_comparison
        || TREE_CODE_CLASS (code) == tcc_unary
        || TREE_CODE_CLASS (code) == tcc_binary)
      arg0_type = TREE_TYPE (arg0);
    if (TREE_CODE_CLASS (code) == tcc_binary
        || TREE_CODE_CLASS (code) == tcc_comparison
        || (TREE_CODE_CLASS (code) == tcc_expression
      && TREE_CODE_LENGTH (code) > 1))
      arg1 = TREE_OPERAND (exp, 1);
  }

      switch (code)
  {
  case TRUTH_NOT_EXPR:
    in_p = ! in_p, exp = arg0;
    continue;

  case EQ_EXPR: case NE_EXPR:
  case LT_EXPR: case LE_EXPR: case GE_EXPR: case GT_EXPR:
    /* We can only do something if the range is testing for zero
       and if the second operand is an integer constant.  Note that
       saying something is "in" the range we make is done by
       complementing IN_P since it will set in the initial case of
       being not equal to zero; "out" is leaving it alone.  */
    if (low == 0 || high == 0
        || ! integer_zerop (low) || ! integer_zerop (high)
        || TREE_CODE (arg1) != INTEGER_CST)
      break;

    switch (code)
      {
      case NE_EXPR:  /* - [c, c]  */
        low = high = arg1;
        break;
      case EQ_EXPR:  /* + [c, c]  */
        in_p = ! in_p, low = high = arg1;
        break;
      case GT_EXPR:  /* - [-, c] */
        low = 0, high = arg1;
        break;
      case GE_EXPR:  /* + [c, -] */
        in_p = ! in_p, low = arg1, high = 0;
        break;
      case LT_EXPR:  /* - [c, -] */
        low = arg1, high = 0;
        break;
      case LE_EXPR:  /* + [-, c] */
        in_p = ! in_p, low = 0, high = arg1;
        break;
      default:
        gcc_unreachable ();
      }

    /* If this is an unsigned comparison, we also know that EXP is
       greater than or equal to zero.  We base the range tests we make
       on that fact, so we record it here so we can parse existing
       range tests.  We test arg0_type since often the return type
       of, e.g. EQ_EXPR, is boolean.  */
    if (TYPE_UNSIGNED (arg0_type) && (low == 0 || high == 0))
      {
        if (! merge_ranges (&n_in_p, &n_low, &n_high,
          in_p, low, high, 1,
          fold_convert (arg0_type, integer_zero_node),
          NULL_TREE))
    break;

        in_p = n_in_p, low = n_low, high = n_high;

        /* If the high bound is missing, but we have a nonzero low
     bound, reverse the range so it goes from zero to the low bound
     minus 1.  */
        if (high == 0 && low && ! integer_zerop (low))
    {
      in_p = ! in_p;
      high = range_binop (MINUS_EXPR, NULL_TREE, low, 0,
              integer_one_node, 0);
      low = fold_convert (arg0_type, integer_zero_node);
    }
      }

    exp = arg0;
    continue;

  case NEGATE_EXPR:
    /* (-x) IN [a,b] -> x in [-b, -a]  */
    n_low = range_binop (MINUS_EXPR, exp_type,
             fold_convert (exp_type, integer_zero_node),
             0, high, 1);
    n_high = range_binop (MINUS_EXPR, exp_type,
        fold_convert (exp_type, integer_zero_node),
        0, low, 0);
    low = n_low, high = n_high;
    exp = arg0;
    continue;

  case BIT_NOT_EXPR:
    /* ~ X -> -X - 1  */
    exp = build2 (MINUS_EXPR, exp_type, negate_expr (arg0),
      fold_convert (exp_type, integer_one_node));
    continue;

  case PLUS_EXPR:  case MINUS_EXPR:
    if (TREE_CODE (arg1) != INTEGER_CST)
      break;

    /* If EXP is signed, any overflow in the computation is undefined,
       so we don't worry about it so long as our computations on
       the bounds don't overflow.  For unsigned, overflow is defined
       and this is exactly the right thing.  */
    n_low = range_binop (code == MINUS_EXPR ? PLUS_EXPR : MINUS_EXPR,
             arg0_type, low, 0, arg1, 0);
    n_high = range_binop (code == MINUS_EXPR ? PLUS_EXPR : MINUS_EXPR,
        arg0_type, high, 1, arg1, 0);
    if ((n_low != 0 && TREE_OVERFLOW (n_low))
        || (n_high != 0 && TREE_OVERFLOW (n_high)))
      break;

    /* Check for an unsigned range which has wrapped around the maximum
       value thus making n_high < n_low, and normalize it.  */
    if (n_low && n_high && tree_int_cst_lt (n_high, n_low))
      {
        low = range_binop (PLUS_EXPR, arg0_type, n_high, 0,
         integer_one_node, 0);
        high = range_binop (MINUS_EXPR, arg0_type, n_low, 0,
          integer_one_node, 0);

        /* If the range is of the form +/- [ x+1, x ], we won't
     be able to normalize it.  But then, it represents the
     whole range or the empty set, so make it
     +/- [ -, - ].  */
        if (tree_int_cst_equal (n_low, low)
      && tree_int_cst_equal (n_high, high))
    low = high = 0;
        else
    in_p = ! in_p;
      }
    else
      low = n_low, high = n_high;

    exp = arg0;
    continue;

  case NOP_EXPR:  case NON_LVALUE_EXPR:  case CONVERT_EXPR:
    if (TYPE_PRECISION (arg0_type) > TYPE_PRECISION (exp_type))
      break;

    if (! INTEGRAL_TYPE_P (arg0_type)
        || (low != 0 && ! int_fits_type_p (low, arg0_type))
        || (high != 0 && ! int_fits_type_p (high, arg0_type)))
      break;

    n_low = low, n_high = high;

    if (n_low != 0)
      n_low = fold_convert (arg0_type, n_low);

    if (n_high != 0)
      n_high = fold_convert (arg0_type, n_high);


    /* If we're converting arg0 from an unsigned type, to exp,
       a signed type,  we will be doing the comparison as unsigned.
       The tests above have already verified that LOW and HIGH
       are both positive.

       So we have to ensure that we will handle large unsigned
       values the same way that the current signed bounds treat
       negative values.  */

    if (!TYPE_UNSIGNED (exp_type) && TYPE_UNSIGNED (arg0_type))
      {
        tree high_positive;
        tree equiv_type = lang_hooks.types.type_for_mode
    (TYPE_MODE (arg0_type), 1);

        /* A range without an upper bound is, naturally, unbounded.
     Since convert would have cropped a very large value, use
     the max value for the destination type.  */
        high_positive
    = TYPE_MAX_VALUE (equiv_type) ? TYPE_MAX_VALUE (equiv_type)
    : TYPE_MAX_VALUE (arg0_type);

        if (TYPE_PRECISION (exp_type) == TYPE_PRECISION (arg0_type))
    high_positive = fold (build2 (RSHIFT_EXPR, arg0_type,
                fold_convert (arg0_type,
                  high_positive),
                fold_convert (arg0_type,
                  integer_one_node)));

        /* If the low bound is specified, "and" the range with the
     range for which the original unsigned value will be
     positive.  */
        if (low != 0)
    {
      if (! merge_ranges (&n_in_p, &n_low, &n_high,
              1, n_low, n_high, 1,
              fold_convert (arg0_type,
                integer_zero_node),
              high_positive))
        break;

      in_p = (n_in_p == in_p);
    }
        else
    {
      /* Otherwise, "or" the range with the range of the input
         that will be interpreted as negative.  */
      if (! merge_ranges (&n_in_p, &n_low, &n_high,
              0, n_low, n_high, 1,
              fold_convert (arg0_type,
                integer_zero_node),
              high_positive))
        break;

      in_p = (in_p != n_in_p);
    }
      }

    exp = arg0;
    low = n_low, high = n_high;
    continue;

  default:
    break;
  }

      break;
    }

  /* If EXP is a constant, we can evaluate whether this is true or false.  */
  if (TREE_CODE (exp) == INTEGER_CST)
    {
      in_p = in_p == (integer_onep (range_binop (GE_EXPR, integer_type_node,
             exp, 0, low, 0))
          && integer_onep (range_binop (LE_EXPR, integer_type_node,
                exp, 1, high, 1)));
      low = high = 0;
      exp = 0;
    }

  *pin_p = in_p, *plow = low, *phigh = high;
  return exp;
}

/* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
   type, TYPE, return an expression to test if EXP is in (or out of, depending
   on IN_P) the range.  Return 0 if the test couldn't be created.  */

static tree
build_range_check (tree type, tree exp, int in_p, tree low, tree high)
{
  tree etype = TREE_TYPE (exp);
  tree value;

#ifdef HAVE_canonicalize_funcptr_for_compare
  /* Disable this optimization for function pointer expressions
     on targets that require function pointer canonicalization.  */
  if (HAVE_canonicalize_funcptr_for_compare
      && TREE_CODE (etype) == POINTER_TYPE
      && TREE_CODE (TREE_TYPE (etype)) == FUNCTION_TYPE)
    return NULL_TREE;
#endif

  if (! in_p)
    {
      value = build_range_check (type, exp, 1, low, high);
      if (value != 0)
        return invert_truthvalue (value);

      return 0;
    }

  if (low == 0 && high == 0)
    return fold_convert (type, integer_one_node);

  if (low == 0)
    return fold (build2 (LE_EXPR, type, exp, high));

  if (high == 0)
    return fold (build2 (GE_EXPR, type, exp, low));

  if (operand_equal_p (low, high, 0))
    return fold (build2 (EQ_EXPR, type, exp, low));

  if (integer_zerop (low))
    {
      if (! TYPE_UNSIGNED (etype))
  {
    etype = lang_hooks.types.unsigned_type (etype);
    high = fold_convert (etype, high);
    exp = fold_convert (etype, exp);
  }
      return build_range_check (type, exp, 1, 0, high);
    }

  /* Optimize (c>=1) && (c<=127) into (signed char)c > 0.  */
  if (integer_onep (low) && TREE_CODE (high) == INTEGER_CST)
    {
      unsigned HOST_WIDE_INT lo;
      HOST_WIDE_INT hi;
      int prec;

      prec = TYPE_PRECISION (etype);
      if (prec <= HOST_BITS_PER_WIDE_INT)
  {
    hi = 0;
    lo = ((unsigned HOST_WIDE_INT) 1 << (prec - 1)) - 1;
  }
      else
  {
    hi = ((HOST_WIDE_INT) 1 << (prec - HOST_BITS_PER_WIDE_INT - 1)) - 1;
    lo = (unsigned HOST_WIDE_INT) -1;
  }

      if (TREE_INT_CST_HIGH (high) == hi && TREE_INT_CST_LOW (high) == lo)
  {
    if (TYPE_UNSIGNED (etype))
      {
        etype = lang_hooks.types.signed_type (etype);
        exp = fold_convert (etype, exp);
      }
    return fold (build2 (GT_EXPR, type, exp,
             fold_convert (etype, integer_zero_node)));
  }
    }

  value = const_binop (MINUS_EXPR, high, low, 0);
  if (value != 0 && TREE_OVERFLOW (value) && ! TYPE_UNSIGNED (etype))
    {
      tree utype, minv, maxv;

      /* Check if (unsigned) INT_MAX + 1 == (unsigned) INT_MIN
   for the type in question, as we rely on this here.  */
      switch (TREE_CODE (etype))
  {
  case INTEGER_TYPE:
  case ENUMERAL_TYPE:
  case CHAR_TYPE:
    utype = lang_hooks.types.unsigned_type (etype);
    maxv = fold_convert (utype, TYPE_MAX_VALUE (etype));
    maxv = range_binop (PLUS_EXPR, NULL_TREE, maxv, 1,
            integer_one_node, 1);
    minv = fold_convert (utype, TYPE_MIN_VALUE (etype));
    if (integer_zerop (range_binop (NE_EXPR, integer_type_node,
            minv, 1, maxv, 1)))
      {
        etype = utype;
        high = fold_convert (etype, high);
        low = fold_convert (etype, low);
        exp = fold_convert (etype, exp);
        value = const_binop (MINUS_EXPR, high, low, 0);
      }
    break;
  default:
    break;
  }
    }

  if (value != 0 && ! TREE_OVERFLOW (value))
    return build_range_check (type,
            fold (build2 (MINUS_EXPR, etype, exp, low)),
            1, fold_convert (etype, integer_zero_node),
            value);

  return 0;
}

/* Given two ranges, see if we can merge them into one.  Return 1 if we
   can, 0 if we can't.  Set the output range into the specified parameters.  */

static int
merge_ranges (int *pin_p, tree *plow, tree *phigh, int in0_p, tree low0,
        tree high0, int in1_p, tree low1, tree high1)
{
  int no_overlap;
  int subset;
  int temp;
  tree tem;
  int in_p;
  tree low, high;
  int lowequal = ((low0 == 0 && low1 == 0)
      || integer_onep (range_binop (EQ_EXPR, integer_type_node,
            low0, 0, low1, 0)));
  int highequal = ((high0 == 0 && high1 == 0)
       || integer_onep (range_binop (EQ_EXPR, integer_type_node,
             high0, 1, high1, 1)));

  /* Make range 0 be the range that starts first, or ends last if they
     start at the same value.  Swap them if it isn't.  */
  if (integer_onep (range_binop (GT_EXPR, integer_type_node,
         low0, 0, low1, 0))
      || (lowequal
    && integer_onep (range_binop (GT_EXPR, integer_type_node,
          high1, 1, high0, 1))))
    {
      temp = in0_p, in0_p = in1_p, in1_p = temp;
      tem = low0, low0 = low1, low1 = tem;
      tem = high0, high0 = high1, high1 = tem;
    }

  /* Now flag two cases, whether the ranges are disjoint or whether the
     second range is totally subsumed in the first.  Note that the tests
     below are simplified by the ones above.  */
  no_overlap = integer_onep (range_binop (LT_EXPR, integer_type_node,
            high0, 1, low1, 0));
  subset = integer_onep (range_binop (LE_EXPR, integer_type_node,
              high1, 1, high0, 1));

  /* We now have four cases, depending on whether we are including or
     excluding the two ranges.  */
  if (in0_p && in1_p)
    {
      /* If they don't overlap, the result is false.  If the second range
   is a subset it is the result.  Otherwise, the range is from the start
   of the second to the end of the first.  */
      if (no_overlap)
  in_p = 0, low = high = 0;
      else if (subset)
  in_p = 1, low = low1, high = high1;
      else
  in_p = 1, low = low1, high = high0;
    }

  else if (in0_p && ! in1_p)
    {
      /* If they don't overlap, the result is the first range.  If they are
   equal, the result is false.  If the second range is a subset of the
   first, and the ranges begin at the same place, we go from just after
   the end of the first range to the end of the second.  If the second
   range is not a subset of the first, or if it is a subset and both
   ranges end at the same place, the range starts at the start of the
   first range and ends just before the second range.
   Otherwise, we can't describe this as a single range.  */
      if (no_overlap)
  in_p = 1, low = low0, high = high0;
      else if (lowequal && highequal)
  in_p = 0, low = high = 0;
      else if (subset && lowequal)
  {
    in_p = 1, high = high0;
    low = range_binop (PLUS_EXPR, NULL_TREE, high1, 0,
           integer_one_node, 0);
  }
      else if (! subset || highequal)
  {
    in_p = 1, low = low0;
    high = range_binop (MINUS_EXPR, NULL_TREE, low1, 0,
            integer_one_node, 0);
  }
      else
  return 0;
    }

  else if (! in0_p && in1_p)
    {
      /* If they don't overlap, the result is the second range.  If the second
   is a subset of the first, the result is false.  Otherwise,
   the range starts just after the first range and ends at the
   end of the second.  */
      if (no_overlap)
  in_p = 1, low = low1, high = high1;
      else if (subset || highequal)
  in_p = 0, low = high = 0;
      else
  {
    in_p = 1, high = high1;
    low = range_binop (PLUS_EXPR, NULL_TREE, high0, 1,
           integer_one_node, 0);
  }
    }

  else
    {
      /* The case where we are excluding both ranges.  Here the complex case
   is if they don't overlap.  In that case, the only time we have a
   range is if they are adjacent.  If the second is a subset of the
   first, the result is the first.  Otherwise, the range to exclude
   starts at the beginning of the first range and ends at the end of the
   second.  */
      if (no_overlap)
  {
    if (integer_onep (range_binop (EQ_EXPR, integer_type_node,
           range_binop (PLUS_EXPR, NULL_TREE,
                  high0, 1,
                  integer_one_node, 1),
           1, low1, 0)))
      in_p = 0, low = low0, high = high1;
    else
      {
        /* Canonicalize - [min, x] into - [-, x].  */
        if (low0 && TREE_CODE (low0) == INTEGER_CST)
    switch (TREE_CODE (TREE_TYPE (low0)))
      {
      case ENUMERAL_TYPE:
        if (TYPE_PRECISION (TREE_TYPE (low0))
      != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (low0))))
          break;
        /* FALLTHROUGH */
      case INTEGER_TYPE:
      case CHAR_TYPE:
        if (tree_int_cst_equal (low0,
              TYPE_MIN_VALUE (TREE_TYPE (low0))))
          low0 = 0;
        break;
      case POINTER_TYPE:
        if (TYPE_UNSIGNED (TREE_TYPE (low0))
      && integer_zerop (low0))
          low0 = 0;
        break;
      default:
        break;
      }

        /* Canonicalize - [x, max] into - [x, -].  */
        if (high1 && TREE_CODE (high1) == INTEGER_CST)
    switch (TREE_CODE (TREE_TYPE (high1)))
      {
      case ENUMERAL_TYPE:
        if (TYPE_PRECISION (TREE_TYPE (high1))
      != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (high1))))
          break;
        /* FALLTHROUGH */
      case INTEGER_TYPE:
      case CHAR_TYPE:
        if (tree_int_cst_equal (high1,
              TYPE_MAX_VALUE (TREE_TYPE (high1))))
          high1 = 0;
        break;
      case POINTER_TYPE:
        if (TYPE_UNSIGNED (TREE_TYPE (high1))
      && integer_zerop (range_binop (PLUS_EXPR, NULL_TREE,
                   high1, 1,
                   integer_one_node, 1)))
          high1 = 0;
        break;
      default:
        break;
      }

        /* The ranges might be also adjacent between the maximum and
           minimum values of the given type.  For
           - [{min,-}, x] and - [y, {max,-}] ranges where x + 1 < y
           return + [x + 1, y - 1].  */
        if (low0 == 0 && high1 == 0)
          {
      low = range_binop (PLUS_EXPR, NULL_TREE, high0, 1,
             integer_one_node, 1);
      high = range_binop (MINUS_EXPR, NULL_TREE, low1, 0,
              integer_one_node, 0);
      if (low == 0 || high == 0)
        return 0;

      in_p = 1;
    }
        else
    return 0;
      }
  }
      else if (subset)
  in_p = 0, low = low0, high = high0;
      else
  in_p = 0, low = low0, high = high1;
    }

  *pin_p = in_p, *plow = low, *phigh = high;
  return 1;
}


/* Subroutine of fold, looking inside expressions of the form
   A op B ? A : C, where ARG0, ARG1 and ARG2 are the three operands
   of the COND_EXPR.  This function is being used also to optimize
   A op B ? C : A, by reversing the comparison first.

   Return a folded expression whose code is not a COND_EXPR
   anymore, or NULL_TREE if no folding opportunity is found.  */

static tree
fold_cond_expr_with_comparison (tree type, tree arg0, tree arg1, tree arg2)
{
  enum tree_code comp_code = TREE_CODE (arg0);
  tree arg00 = TREE_OPERAND (arg0, 0);
  tree arg01 = TREE_OPERAND (arg0, 1);
  tree arg1_type = TREE_TYPE (arg1);
  tree tem;

  STRIP_NOPS (arg1);
  STRIP_NOPS (arg2);

  /* If we have A op 0 ? A : -A, consider applying the following
     transformations:

     A == 0? A : -A    same as -A
     A != 0? A : -A    same as A
     A >= 0? A : -A    same as abs (A)
     A > 0?  A : -A    same as abs (A)
     A <= 0? A : -A    same as -abs (A)
     A < 0?  A : -A    same as -abs (A)

     None of these transformations work for modes with signed
     zeros.  If A is +/-0, the first two transformations will
     change the sign of the result (from +0 to -0, or vice
     versa).  The last four will fix the sign of the result,
     even though the original expressions could be positive or
     negative, depending on the sign of A.

     Note that all these transformations are correct if A is
     NaN, since the two alternatives (A and -A) are also NaNs.  */
  if ((FLOAT_TYPE_P (TREE_TYPE (arg01))
       ? real_zerop (arg01)
       : integer_zerop (arg01))
      && TREE_CODE (arg2) == NEGATE_EXPR
      && operand_equal_p (TREE_OPERAND (arg2, 0), arg1, 0))
    switch (comp_code)
      {
      case EQ_EXPR:
      case UNEQ_EXPR:
  tem = fold_convert (arg1_type, arg1);
  return pedantic_non_lvalue (fold_convert (type, negate_expr (tem)));
      case NE_EXPR:
      case LTGT_EXPR:
  return pedantic_non_lvalue (fold_convert (type, arg1));
      case UNGE_EXPR:
      case UNGT_EXPR:
  if (flag_trapping_math)
    break;
  /* Fall through.  */
      case GE_EXPR:
      case GT_EXPR:
  if (TYPE_UNSIGNED (TREE_TYPE (arg1)))
    arg1 = fold_convert (lang_hooks.types.signed_type
             (TREE_TYPE (arg1)), arg1);
  tem = fold (build1 (ABS_EXPR, TREE_TYPE (arg1), arg1));
  return pedantic_non_lvalue (fold_convert (type, tem));
      case UNLE_EXPR:
      case UNLT_EXPR:
  if (flag_trapping_math)
    break;
      case LE_EXPR:
      case LT_EXPR:
  if (TYPE_UNSIGNED (TREE_TYPE (arg1)))
    arg1 = fold_convert (lang_hooks.types.signed_type
             (TREE_TYPE (arg1)), arg1);
  tem = fold (build1 (ABS_EXPR, TREE_TYPE (arg1), arg1));
  return negate_expr (fold_convert (type, tem));
      default:
  gcc_assert (TREE_CODE_CLASS (comp_code) == tcc_comparison);
  break;
      }

  /* A != 0 ? A : 0 is simply A, unless A is -0.  Likewise
     A == 0 ? A : 0 is always 0 unless A is -0.  Note that
     both transformations are correct when A is NaN: A != 0
     is then true, and A == 0 is false.  */

  if (integer_zerop (arg01) && integer_zerop (arg2))
    {
      if (comp_code == NE_EXPR)
  return pedantic_non_lvalue (fold_convert (type, arg1));
      else if (comp_code == EQ_EXPR)
  return fold_convert (type, integer_zero_node);
    }

  /* Try some transformations of A op B ? A : B.

     A == B? A : B    same as B
     A != B? A : B    same as A
     A >= B? A : B    same as max (A, B)
     A > B?  A : B    same as max (B, A)
     A <= B? A : B    same as min (A, B)
     A < B?  A : B    same as min (B, A)

     As above, these transformations don't work in the presence
     of signed zeros.  For example, if A and B are zeros of
     opposite sign, the first two transformations will change
     the sign of the result.  In the last four, the original
     expressions give different results for (A=+0, B=-0) and
     (A=-0, B=+0), but the transformed expressions do not.

     The first two transformations are correct if either A or B
     is a NaN.  In the first transformation, the condition will
     be false, and B will indeed be chosen.  In the case of the
     second transformation, the condition A != B will be true,
     and A will be chosen.

     The conversions to max() and min() are not correct if B is
     a number and A is not.  The conditions in the original
     expressions will be false, so all four give B.  The min()
     and max() versions would give a NaN instead.  */
  if (operand_equal_for_comparison_p (arg01, arg2, arg00)
      /* Avoid these transformations if the COND_EXPR may be used
   as an lvalue in the C++ front-end.  PR c++/19199.  */
      && (in_gimple_form
    || strcmp (lang_hooks.name, "GNU C++") != 0
    || ! maybe_lvalue_p (arg1)
    || ! maybe_lvalue_p (arg2)))
    {
      tree comp_op0 = arg00;
      tree comp_op1 = arg01;
      tree comp_type = TREE_TYPE (comp_op0);

      /* Avoid adding NOP_EXPRs in case this is an lvalue.  */
      if (TYPE_MAIN_VARIANT (comp_type) == TYPE_MAIN_VARIANT (type))
  {
    comp_type = type;
    comp_op0 = arg1;
    comp_op1 = arg2;
  }

      switch (comp_code)
  {
  case EQ_EXPR:
    return pedantic_non_lvalue (fold_convert (type, arg2));
  case NE_EXPR:
    return pedantic_non_lvalue (fold_convert (type, arg1));
  case LE_EXPR:
  case LT_EXPR:
  case UNLE_EXPR:
  case UNLT_EXPR:
    /* In C++ a ?: expression can be an lvalue, so put the
       operand which will be used if they are equal first
       so that we can convert this back to the
       corresponding COND_EXPR.  */
    if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg1))))
      {
        comp_op0 = fold_convert (comp_type, comp_op0);
        comp_op1 = fold_convert (comp_type, comp_op1);
        tem = (comp_code == LE_EXPR || comp_code == UNLE_EXPR)
        ? fold (build2 (MIN_EXPR, comp_type, comp_op0, comp_op1))
        : fold (build2 (MIN_EXPR, comp_type, comp_op1, comp_op0));
        return pedantic_non_lvalue (fold_convert (type, tem));
      }
    break;
  case GE_EXPR:
  case GT_EXPR:
  case UNGE_EXPR:
  case UNGT_EXPR:
    if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg1))))
      {
        comp_op0 = fold_convert (comp_type, comp_op0);
        comp_op1 = fold_convert (comp_type, comp_op1);
        tem = (comp_code == GE_EXPR || comp_code == UNGE_EXPR)
        ? fold (build2 (MAX_EXPR, comp_type, comp_op0, comp_op1))
        : fold (build2 (MAX_EXPR, comp_type, comp_op1, comp_op0));
        return pedantic_non_lvalue (fold_convert (type, tem));
      }
    break;
  case UNEQ_EXPR:
    if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg1))))
      return pedantic_non_lvalue (fold_convert (type, arg2));
    break;
  case LTGT_EXPR:
    if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg1))))
      return pedantic_non_lvalue (fold_convert (type, arg1));
    break;
  default:
    gcc_assert (TREE_CODE_CLASS (comp_code) == tcc_comparison);
    break;
  }
    }

  /* If this is A op C1 ? A : C2 with C1 and C2 constant integers,
     we might still be able to simplify this.  For example,
     if C1 is one less or one more than C2, this might have started
     out as a MIN or MAX and been transformed by this function.
     Only good for INTEGER_TYPEs, because we need TYPE_MAX_VALUE.  */

  if (INTEGRAL_TYPE_P (type)
      && TREE_CODE (arg01) == INTEGER_CST
      && TREE_CODE (arg2) == INTEGER_CST)
    switch (comp_code)
      {
      case EQ_EXPR:
  /* We can replace A with C1 in this case.  */
  arg1 = fold_convert (type, arg01);
  return fold (build3 (COND_EXPR, type, arg0, arg1, arg2));

      case LT_EXPR:
  /* If C1 is C2 + 1, this is min(A, C2).  */
  if (! operand_equal_p (arg2, TYPE_MAX_VALUE (type),
             OEP_ONLY_CONST)
      && operand_equal_p (arg01,
        const_binop (PLUS_EXPR, arg2,
               integer_one_node, 0),
        OEP_ONLY_CONST))
    return pedantic_non_lvalue (fold (build2 (MIN_EXPR,
                type, arg1, arg2)));
  break;

      case LE_EXPR:
  /* If C1 is C2 - 1, this is min(A, C2).  */
  if (! operand_equal_p (arg2, TYPE_MIN_VALUE (type),
             OEP_ONLY_CONST)
      && operand_equal_p (arg01,
        const_binop (MINUS_EXPR, arg2,
               integer_one_node, 0),
        OEP_ONLY_CONST))
    return pedantic_non_lvalue (fold (build2 (MIN_EXPR,
                type, arg1, arg2)));
  break;

      case GT_EXPR:
  /* If C1 is C2 - 1, this is max(A, C2).  */
  if (! operand_equal_p (arg2, TYPE_MIN_VALUE (type),
             OEP_ONLY_CONST)
      && operand_equal_p (arg01,
        const_binop (MINUS_EXPR, arg2,
               integer_one_node, 0),
        OEP_ONLY_CONST))
    return pedantic_non_lvalue (fold (build2 (MAX_EXPR,
                type, arg1, arg2)));
  break;

      case GE_EXPR:
  /* If C1 is C2 + 1, this is max(A, C2).  */
  if (! operand_equal_p (arg2, TYPE_MAX_VALUE (type),
             OEP_ONLY_CONST)
      && operand_equal_p (arg01,
        const_binop (PLUS_EXPR, arg2,
               integer_one_node, 0),
        OEP_ONLY_CONST))
    return pedantic_non_lvalue (fold (build2 (MAX_EXPR,
                type, arg1, arg2)));
  break;
      case NE_EXPR:
  break;
      default:
  gcc_unreachable ();
      }

  return NULL_TREE;
}



#ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
#ifdef KEY // bug 11517
#define LOGICAL_OP_NON_SHORT_CIRCUIT (!flag_spin_file && BRANCH_COST >= 2)
#else
#define LOGICAL_OP_NON_SHORT_CIRCUIT (BRANCH_COST >= 2)
#endif
#endif

/* EXP is some logical combination of boolean tests.  See if we can
   merge it into some range test.  Return the new tree if so.  */

static tree
fold_range_test (tree exp)
{
  int or_op = (TREE_CODE (exp) == TRUTH_ORIF_EXPR
         || TREE_CODE (exp) == TRUTH_OR_EXPR);
  int in0_p, in1_p, in_p;
  tree low0, low1, low, high0, high1, high;
  tree lhs = make_range (TREE_OPERAND (exp, 0), &in0_p, &low0, &high0);
  tree rhs = make_range (TREE_OPERAND (exp, 1), &in1_p, &low1, &high1);
  tree tem;

  /* If this is an OR operation, invert both sides; we will invert
     again at the end.  */
  if (or_op)
    in0_p = ! in0_p, in1_p = ! in1_p;

  /* If both expressions are the same, if we can merge the ranges, and we
     can build the range test, return it or it inverted.  If one of the
     ranges is always true or always false, consider it to be the same
     expression as the other.  */
  if ((lhs == 0 || rhs == 0 || operand_equal_p (lhs, rhs, 0))
      && merge_ranges (&in_p, &low, &high, in0_p, low0, high0,
           in1_p, low1, high1)
      && 0 != (tem = (build_range_check (TREE_TYPE (exp),
           lhs != 0 ? lhs
           : rhs != 0 ? rhs : integer_zero_node,
           in_p, low, high))))
    return or_op ? invert_truthvalue (tem) : tem;

  /* On machines where the branch cost is expensive, if this is a
     short-circuited branch and the underlying object on both sides
     is the same, make a non-short-circuit operation.  */
  else if (LOGICAL_OP_NON_SHORT_CIRCUIT
     && lhs != 0 && rhs != 0
     && (TREE_CODE (exp) == TRUTH_ANDIF_EXPR
         || TREE_CODE (exp) == TRUTH_ORIF_EXPR)
     && operand_equal_p (lhs, rhs, 0))
    {
      /* If simple enough, just rewrite.  Otherwise, make a SAVE_EXPR
   unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
   which cases we can't do this.  */
      if (simple_operand_p (lhs))
  return build2 (TREE_CODE (exp) == TRUTH_ANDIF_EXPR
           ? TRUTH_AND_EXPR : TRUTH_OR_EXPR,
           TREE_TYPE (exp), TREE_OPERAND (exp, 0),
           TREE_OPERAND (exp, 1));

      else if (lang_hooks.decls.global_bindings_p () == 0
         && ! CONTAINS_PLACEHOLDER_P (lhs))
  {
    tree common = save_expr (lhs);

    if (0 != (lhs = build_range_check (TREE_TYPE (exp), common,
               or_op ? ! in0_p : in0_p,
               low0, high0))
        && (0 != (rhs = build_range_check (TREE_TYPE (exp), common,
             or_op ? ! in1_p : in1_p,
             low1, high1))))
      return build2 (TREE_CODE (exp) == TRUTH_ANDIF_EXPR
         ? TRUTH_AND_EXPR : TRUTH_OR_EXPR,
         TREE_TYPE (exp), lhs, rhs);
  }
    }

  return 0;
}

/* Subroutine for fold_truthop: C is an INTEGER_CST interpreted as a P
   bit value.  Arrange things so the extra bits will be set to zero if and
   only if C is signed-extended to its full width.  If MASK is nonzero,
   it is an INTEGER_CST that should be AND'ed with the extra bits.  */

static tree
unextend (tree c, int p, int unsignedp, tree mask)
{
  tree type = TREE_TYPE (c);
  int modesize = GET_MODE_BITSIZE (TYPE_MODE (type));
  tree temp;

  if (p == modesize || unsignedp)
    return c;

  /* We work by getting just the sign bit into the low-order bit, then
     into the high-order bit, then sign-extend.  We then XOR that value
     with C.  */
  temp = const_binop (RSHIFT_EXPR, c, size_int (p - 1), 0);
  temp = const_binop (BIT_AND_EXPR, temp, size_int (1), 0);

  /* We must use a signed type in order to get an arithmetic right shift.
     However, we must also avoid introducing accidental overflows, so that
     a subsequent call to integer_zerop will work.  Hence we must
     do the type conversion here.  At this point, the constant is either
     zero or one, and the conversion to a signed type can never overflow.
     We could get an overflow if this conversion is done anywhere else.  */
  if (TYPE_UNSIGNED (type))
    temp = fold_convert (lang_hooks.types.signed_type (type), temp);

  temp = const_binop (LSHIFT_EXPR, temp, size_int (modesize - 1), 0);
  temp = const_binop (RSHIFT_EXPR, temp, size_int (modesize - p - 1), 0);
  if (mask != 0)
    temp = const_binop (BIT_AND_EXPR, temp,
      fold_convert (TREE_TYPE (c), mask), 0);
  /* If necessary, convert the type back to match the type of C.  */
  if (TYPE_UNSIGNED (type))
    temp = fold_convert (type, temp);

  return fold_convert (type, const_binop (BIT_XOR_EXPR, c, temp, 0));
}

/* Find ways of folding logical expressions of LHS and RHS:
   Try to merge two comparisons to the same innermost item.
   Look for range tests like "ch >= '0' && ch <= '9'".
   Look for combinations of simple terms on machines with expensive branches
   and evaluate the RHS unconditionally.

   For example, if we have p->a == 2 && p->b == 4 and we can make an
   object large enough to span both A and B, we can do this with a comparison
   against the object ANDed with the a mask.

   If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
   operations to do this with one comparison.

   We check for both normal comparisons and the BIT_AND_EXPRs made this by
   function and the one above.

   CODE is the logical operation being done.  It can be TRUTH_ANDIF_EXPR,
   TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.

   TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
   two operands.

   We return the simplified tree or 0 if no optimization is possible.  */

static tree
fold_truthop (enum tree_code code, tree truth_type, tree lhs, tree rhs)
{
  /* If this is the "or" of two comparisons, we can do something if
     the comparisons are NE_EXPR.  If this is the "and", we can do something
     if the comparisons are EQ_EXPR.  I.e.,
  (a->b == 2 && a->c == 4) can become (a->new == NEW).

     WANTED_CODE is this operation code.  For single bit fields, we can
     convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
     comparison for one-bit fields.  */

  enum tree_code wanted_code;
  enum tree_code lcode, rcode;
  tree ll_arg, lr_arg, rl_arg, rr_arg;
  tree ll_inner, lr_inner, rl_inner, rr_inner;
  HOST_WIDE_INT ll_bitsize, ll_bitpos, lr_bitsize, lr_bitpos;
  HOST_WIDE_INT rl_bitsize, rl_bitpos, rr_bitsize, rr_bitpos;
  HOST_WIDE_INT xll_bitpos, xlr_bitpos, xrl_bitpos, xrr_bitpos;
  HOST_WIDE_INT lnbitsize, lnbitpos, rnbitsize, rnbitpos;
  int ll_unsignedp, lr_unsignedp, rl_unsignedp, rr_unsignedp;
  enum machine_mode ll_mode, lr_mode, rl_mode, rr_mode;
  enum machine_mode lnmode, rnmode;
  tree ll_mask, lr_mask, rl_mask, rr_mask;
  tree ll_and_mask, lr_and_mask, rl_and_mask, rr_and_mask;
  tree l_const, r_const;
  tree lntype, rntype, result;
  int first_bit, end_bit;
  int volatilep;

  /* Start by getting the comparison codes.  Fail if anything is volatile.
     If one operand is a BIT_AND_EXPR with the constant one, treat it as if
     it were surrounded with a NE_EXPR.  */

  if (TREE_SIDE_EFFECTS (lhs) || TREE_SIDE_EFFECTS (rhs))
    return 0;

  lcode = TREE_CODE (lhs);
  rcode = TREE_CODE (rhs);

  if (lcode == BIT_AND_EXPR && integer_onep (TREE_OPERAND (lhs, 1)))
    {
      lhs = build2 (NE_EXPR, truth_type, lhs,
        fold_convert (TREE_TYPE (lhs), integer_zero_node));
      lcode = NE_EXPR;
    }

  if (rcode == BIT_AND_EXPR && integer_onep (TREE_OPERAND (rhs, 1)))
    {
      rhs = build2 (NE_EXPR, truth_type, rhs,
        fold_convert (TREE_TYPE (rhs), integer_zero_node));
      rcode = NE_EXPR;
    }

  if (TREE_CODE_CLASS (lcode) != tcc_comparison
      || TREE_CODE_CLASS (rcode) != tcc_comparison)
    return 0;

  ll_arg = TREE_OPERAND (lhs, 0);
  lr_arg = TREE_OPERAND (lhs, 1);
  rl_arg = TREE_OPERAND (rhs, 0);
  rr_arg = TREE_OPERAND (rhs, 1);

  /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations.  */
  if (simple_operand_p (ll_arg)
      && simple_operand_p (lr_arg))
    {
      tree result;
      if (operand_equal_p (ll_arg, rl_arg, 0)
          && operand_equal_p (lr_arg, rr_arg, 0))
  {
          result = combine_comparisons (code, lcode, rcode,
          truth_type, ll_arg, lr_arg);
    if (result)
      return result;
  }
      else if (operand_equal_p (ll_arg, rr_arg, 0)
               && operand_equal_p (lr_arg, rl_arg, 0))
  {
          result = combine_comparisons (code, lcode,
          swap_tree_comparison (rcode),
          truth_type, ll_arg, lr_arg);
    if (result)
      return result;
  }
    }

  code = ((code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR)
    ? TRUTH_AND_EXPR : TRUTH_OR_EXPR);

  /* If the RHS can be evaluated unconditionally and its operands are
     simple, it wins to evaluate the RHS unconditionally on machines
     with expensive branches.  In this case, this isn't a comparison
     that can be merged.  Avoid doing this if the RHS is a floating-point
     comparison since those can trap.  */

  if (BRANCH_COST >= 2
      && ! FLOAT_TYPE_P (TREE_TYPE (rl_arg))
      && simple_operand_p (rl_arg)
      && simple_operand_p (rr_arg))
    {
      /* Convert (a != 0) || (b != 0) into (a | b) != 0.  */
      if (code == TRUTH_OR_EXPR
    && lcode == NE_EXPR && integer_zerop (lr_arg)
    && rcode == NE_EXPR && integer_zerop (rr_arg)
    && TREE_TYPE (ll_arg) == TREE_TYPE (rl_arg))
  return build2 (NE_EXPR, truth_type,
           build2 (BIT_IOR_EXPR, TREE_TYPE (ll_arg),
             ll_arg, rl_arg),
           fold_convert (TREE_TYPE (ll_arg), integer_zero_node));

      /* Convert (a == 0) && (b == 0) into (a | b) == 0.  */
      if (code == TRUTH_AND_EXPR
    && lcode == EQ_EXPR && integer_zerop (lr_arg)
    && rcode == EQ_EXPR && integer_zerop (rr_arg)
    && TREE_TYPE (ll_arg) == TREE_TYPE (rl_arg))
  return build2 (EQ_EXPR, truth_type,
           build2 (BIT_IOR_EXPR, TREE_TYPE (ll_arg),
             ll_arg, rl_arg),
           fold_convert (TREE_TYPE (ll_arg), integer_zero_node));

      if (LOGICAL_OP_NON_SHORT_CIRCUIT)
  return build2 (code, truth_type, lhs, rhs);
    }

  /* See if the comparisons can be merged.  Then get all the parameters for
     each side.  */

  if ((lcode != EQ_EXPR && lcode != NE_EXPR)
      || (rcode != EQ_EXPR && rcode != NE_EXPR))
    return 0;

  volatilep = 0;
  ll_inner = decode_field_reference (ll_arg,
             &ll_bitsize, &ll_bitpos, &ll_mode,
             &ll_unsignedp, &volatilep, &ll_mask,
             &ll_and_mask);
  lr_inner = decode_field_reference (lr_arg,
             &lr_bitsize, &lr_bitpos, &lr_mode,
             &lr_unsignedp, &volatilep, &lr_mask,
             &lr_and_mask);
  rl_inner = decode_field_reference (rl_arg,
             &rl_bitsize, &rl_bitpos, &rl_mode,
             &rl_unsignedp, &volatilep, &rl_mask,
             &rl_and_mask);
  rr_inner = decode_field_reference (rr_arg,
             &rr_bitsize, &rr_bitpos, &rr_mode,
             &rr_unsignedp, &volatilep, &rr_mask,
             &rr_and_mask);

  /* It must be true that the inner operation on the lhs of each
     comparison must be the same if we are to be able to do anything.
     Then see if we have constants.  If not, the same must be true for
     the rhs's.  */
  if (volatilep || ll_inner == 0 || rl_inner == 0
      || ! operand_equal_p (ll_inner, rl_inner, 0))
    return 0;

  if (TREE_CODE (lr_arg) == INTEGER_CST
      && TREE_CODE (rr_arg) == INTEGER_CST)
    l_const = lr_arg, r_const = rr_arg;
  else if (lr_inner == 0 || rr_inner == 0
     || ! operand_equal_p (lr_inner, rr_inner, 0))
    return 0;
  else
    l_const = r_const = 0;

  /* If either comparison code is not correct for our logical operation,
     fail.  However, we can convert a one-bit comparison against zero into
     the opposite comparison against that bit being set in the field.  */

  wanted_code = (code == TRUTH_AND_EXPR ? EQ_EXPR : NE_EXPR);
  if (lcode != wanted_code)
    {
      if (l_const && integer_zerop (l_const) && integer_pow2p (ll_mask))
  {
    /* Make the left operand unsigned, since we are only interested
       in the value of one bit.  Otherwise we are doing the wrong
       thing below.  */
    ll_unsignedp = 1;
    l_const = ll_mask;
  }
      else
  return 0;
    }

  /* This is analogous to the code for l_const above.  */
  if (rcode != wanted_code)
    {
      if (r_const && integer_zerop (r_const) && integer_pow2p (rl_mask))
  {
    rl_unsignedp = 1;
    r_const = rl_mask;
  }
      else
  return 0;
    }

  /* After this point all optimizations will generate bit-field
     references, which we might not want.  */
  if (! lang_hooks.can_use_bit_fields_p ())
    return 0;

  /* See if we can find a mode that contains both fields being compared on
     the left.  If we can't, fail.  Otherwise, update all constants and masks
     to be relative to a field of that size.  */
  first_bit = MIN (ll_bitpos, rl_bitpos);
  end_bit = MAX (ll_bitpos + ll_bitsize, rl_bitpos + rl_bitsize);
  lnmode = get_best_mode (end_bit - first_bit, first_bit,
        TYPE_ALIGN (TREE_TYPE (ll_inner)), word_mode,
        volatilep);
  if (lnmode == VOIDmode)
    return 0;

  lnbitsize = GET_MODE_BITSIZE (lnmode);
  lnbitpos = first_bit & ~ (lnbitsize - 1);
  lntype = lang_hooks.types.type_for_size (lnbitsize, 1);
  xll_bitpos = ll_bitpos - lnbitpos, xrl_bitpos = rl_bitpos - lnbitpos;

  if (BYTES_BIG_ENDIAN)
    {
      xll_bitpos = lnbitsize - xll_bitpos - ll_bitsize;
      xrl_bitpos = lnbitsize - xrl_bitpos - rl_bitsize;
    }

  ll_mask = const_binop (LSHIFT_EXPR, fold_convert (lntype, ll_mask),
       size_int (xll_bitpos), 0);
  rl_mask = const_binop (LSHIFT_EXPR, fold_convert (lntype, rl_mask),
       size_int (xrl_bitpos), 0);

  if (l_const)
    {
      l_const = fold_convert (lntype, l_const);
      l_const = unextend (l_const, ll_bitsize, ll_unsignedp, ll_and_mask);
      l_const = const_binop (LSHIFT_EXPR, l_const, size_int (xll_bitpos), 0);
      if (! integer_zerop (const_binop (BIT_AND_EXPR, l_const,
          fold (build1 (BIT_NOT_EXPR,
                  lntype, ll_mask)),
          0)))
  {
    warning ("comparison is always %d", wanted_code == NE_EXPR);

    return constant_boolean_node (wanted_code == NE_EXPR, truth_type);
  }
    }
  if (r_const)
    {
      r_const = fold_convert (lntype, r_const);
      r_const = unextend (r_const, rl_bitsize, rl_unsignedp, rl_and_mask);
      r_const = const_binop (LSHIFT_EXPR, r_const, size_int (xrl_bitpos), 0);
      if (! integer_zerop (const_binop (BIT_AND_EXPR, r_const,
          fold (build1 (BIT_NOT_EXPR,
                  lntype, rl_mask)),
          0)))
  {
    warning ("comparison is always %d", wanted_code == NE_EXPR);

    return constant_boolean_node (wanted_code == NE_EXPR, truth_type);
  }
    }

  /* If the right sides are not constant, do the same for it.  Also,
     disallow this optimization if a size or signedness mismatch occurs
     between the left and right sides.  */
  if (l_const == 0)
    {
      if (ll_bitsize != lr_bitsize || rl_bitsize != rr_bitsize
    || ll_unsignedp != lr_unsignedp || rl_unsignedp != rr_unsignedp
    /* Make sure the two fields on the right
       correspond to the left without being swapped.  */
    || ll_bitpos - rl_bitpos != lr_bitpos - rr_bitpos)
  return 0;

      first_bit = MIN (lr_bitpos, rr_bitpos);
      end_bit = MAX (lr_bitpos + lr_bitsize, rr_bitpos + rr_bitsize);
      rnmode = get_best_mode (end_bit - first_bit, first_bit,
            TYPE_ALIGN (TREE_TYPE (lr_inner)), word_mode,
            volatilep);
      if (rnmode == VOIDmode)
  return 0;

      rnbitsize = GET_MODE_BITSIZE (rnmode);
      rnbitpos = first_bit & ~ (rnbitsize - 1);
      rntype = lang_hooks.types.type_for_size (rnbitsize, 1);
      xlr_bitpos = lr_bitpos - rnbitpos, xrr_bitpos = rr_bitpos - rnbitpos;

      if (BYTES_BIG_ENDIAN)
  {
    xlr_bitpos = rnbitsize - xlr_bitpos - lr_bitsize;
    xrr_bitpos = rnbitsize - xrr_bitpos - rr_bitsize;
  }

      lr_mask = const_binop (LSHIFT_EXPR, fold_convert (rntype, lr_mask),
           size_int (xlr_bitpos), 0);
      rr_mask = const_binop (LSHIFT_EXPR, fold_convert (rntype, rr_mask),
           size_int (xrr_bitpos), 0);

      /* Make a mask that corresponds to both fields being compared.
   Do this for both items being compared.  If the operands are the
   same size and the bits being compared are in the same position
   then we can do this by masking both and comparing the masked
   results.  */
      ll_mask = const_binop (BIT_IOR_EXPR, ll_mask, rl_mask, 0);
      lr_mask = const_binop (BIT_IOR_EXPR, lr_mask, rr_mask, 0);
      if (lnbitsize == rnbitsize && xll_bitpos == xlr_bitpos)
  {
    lhs = make_bit_field_ref (ll_inner, lntype, lnbitsize, lnbitpos,
            ll_unsignedp || rl_unsignedp);
    if (! all_ones_mask_p (ll_mask, lnbitsize))
      lhs = build2 (BIT_AND_EXPR, lntype, lhs, ll_mask);

    rhs = make_bit_field_ref (lr_inner, rntype, rnbitsize, rnbitpos,
            lr_unsignedp || rr_unsignedp);
    if (! all_ones_mask_p (lr_mask, rnbitsize))
      rhs = build2 (BIT_AND_EXPR, rntype, rhs, lr_mask);

    return build2 (wanted_code, truth_type, lhs, rhs);
  }

      /* There is still another way we can do something:  If both pairs of
   fields being compared are adjacent, we may be able to make a wider
   field containing them both.

   Note that we still must mask the lhs/rhs expressions.  Furthermore,
   the mask must be shifted to account for the shift done by
   make_bit_field_ref.  */
      if ((ll_bitsize + ll_bitpos == rl_bitpos
     && lr_bitsize + lr_bitpos == rr_bitpos)
    || (ll_bitpos == rl_bitpos + rl_bitsize
        && lr_bitpos == rr_bitpos + rr_bitsize))
  {
    tree type;

    lhs = make_bit_field_ref (ll_inner, lntype, ll_bitsize + rl_bitsize,
            MIN (ll_bitpos, rl_bitpos), ll_unsignedp);
    rhs = make_bit_field_ref (lr_inner, rntype, lr_bitsize + rr_bitsize,
            MIN (lr_bitpos, rr_bitpos), lr_unsignedp);

    ll_mask = const_binop (RSHIFT_EXPR, ll_mask,
         size_int (MIN (xll_bitpos, xrl_bitpos)), 0);
    lr_mask = const_binop (RSHIFT_EXPR, lr_mask,
         size_int (MIN (xlr_bitpos, xrr_bitpos)), 0);

    /* Convert to the smaller type before masking out unwanted bits.  */
    type = lntype;
    if (lntype != rntype)
      {
        if (lnbitsize > rnbitsize)
    {
      lhs = fold_convert (rntype, lhs);
      ll_mask = fold_convert (rntype, ll_mask);
      type = rntype;
    }
        else if (lnbitsize < rnbitsize)
    {
      rhs = fold_convert (lntype, rhs);
      lr_mask = fold_convert (lntype, lr_mask);
      type = lntype;
    }
      }

    if (! all_ones_mask_p (ll_mask, ll_bitsize + rl_bitsize))
      lhs = build2 (BIT_AND_EXPR, type, lhs, ll_mask);

    if (! all_ones_mask_p (lr_mask, lr_bitsize + rr_bitsize))
      rhs = build2 (BIT_AND_EXPR, type, rhs, lr_mask);

    return build2 (wanted_code, truth_type, lhs, rhs);
  }

      return 0;
    }

  /* Handle the case of comparisons with constants.  If there is something in
     common between the masks, those bits of the constants must be the same.
     If not, the condition is always false.  Test for this to avoid generating
     incorrect code below.  */
  result = const_binop (BIT_AND_EXPR, ll_mask, rl_mask, 0);
  if (! integer_zerop (result)
      && simple_cst_equal (const_binop (BIT_AND_EXPR, result, l_const, 0),
         const_binop (BIT_AND_EXPR, result, r_const, 0)) != 1)
    {
      if (wanted_code == NE_EXPR)
  {
    warning ("%<or%> of unmatched not-equal tests is always 1");
    return constant_boolean_node (true, truth_type);
  }
      else
  {
    warning ("%<and%> of mutually exclusive equal-tests is always 0");
    return constant_boolean_node (false, truth_type);
  }
    }

  /* Construct the expression we will return.  First get the component
     reference we will make.  Unless the mask is all ones the width of
     that field, perform the mask operation.  Then compare with the
     merged constant.  */
  result = make_bit_field_ref (ll_inner, lntype, lnbitsize, lnbitpos,
             ll_unsignedp || rl_unsignedp);

  ll_mask = const_binop (BIT_IOR_EXPR, ll_mask, rl_mask, 0);
  if (! all_ones_mask_p (ll_mask, lnbitsize))
    result = build2 (BIT_AND_EXPR, lntype, result, ll_mask);

  return build2 (wanted_code, truth_type, result,
     const_binop (BIT_IOR_EXPR, l_const, r_const, 0));
}

/* Optimize T, which is a comparison of a MIN_EXPR or MAX_EXPR with a
   constant.  */

static tree
optimize_minmax_comparison (tree t)
{
  tree type = TREE_TYPE (t);
  tree arg0 = TREE_OPERAND (t, 0);
  enum tree_code op_code;
  tree comp_const = TREE_OPERAND (t, 1);
  tree minmax_const;
  int consts_equal, consts_lt;
  tree inner;

  STRIP_SIGN_NOPS (arg0);

  op_code = TREE_CODE (arg0);
  minmax_const = TREE_OPERAND (arg0, 1);
  consts_equal = tree_int_cst_equal (minmax_const, comp_const);
  consts_lt = tree_int_cst_lt (minmax_const, comp_const);
  inner = TREE_OPERAND (arg0, 0);

  /* If something does not permit us to optimize, return the original tree.  */
  if ((op_code != MIN_EXPR && op_code != MAX_EXPR)
      || TREE_CODE (comp_const) != INTEGER_CST
      || TREE_CONSTANT_OVERFLOW (comp_const)
      || TREE_CODE (minmax_const) != INTEGER_CST
      || TREE_CONSTANT_OVERFLOW (minmax_const))
    return t;

  /* Now handle all the various comparison codes.  We only handle EQ_EXPR
     and GT_EXPR, doing the rest with recursive calls using logical
     simplifications.  */
  switch (TREE_CODE (t))
    {
    case NE_EXPR:  case LT_EXPR:  case LE_EXPR:
      return
  invert_truthvalue (optimize_minmax_comparison (invert_truthvalue (t)));

    case GE_EXPR:
      return
  fold (build2 (TRUTH_ORIF_EXPR, type,
          optimize_minmax_comparison
          (build2 (EQ_EXPR, type, arg0, comp_const)),
          optimize_minmax_comparison
          (build2 (GT_EXPR, type, arg0, comp_const))));

    case EQ_EXPR:
      if (op_code == MAX_EXPR && consts_equal)
  /* MAX (X, 0) == 0  ->  X <= 0  */
  return fold (build2 (LE_EXPR, type, inner, comp_const));

      else if (op_code == MAX_EXPR && consts_lt)
  /* MAX (X, 0) == 5  ->  X == 5   */
  return fold (build2 (EQ_EXPR, type, inner, comp_const));

      else if (op_code == MAX_EXPR)
  /* MAX (X, 0) == -1  ->  false  */
  return omit_one_operand (type, integer_zero_node, inner);

      else if (consts_equal)
  /* MIN (X, 0) == 0  ->  X >= 0  */
  return fold (build2 (GE_EXPR, type, inner, comp_const));

      else if (consts_lt)
  /* MIN (X, 0) == 5  ->  false  */
  return omit_one_operand (type, integer_zero_node, inner);

      else
  /* MIN (X, 0) == -1  ->  X == -1  */
  return fold (build2 (EQ_EXPR, type, inner, comp_const));

    case GT_EXPR:
      if (op_code == MAX_EXPR && (consts_equal || consts_lt))
  /* MAX (X, 0) > 0  ->  X > 0
     MAX (X, 0) > 5  ->  X > 5  */
  return fold (build2 (GT_EXPR, type, inner, comp_const));

      else if (op_code == MAX_EXPR)
  /* MAX (X, 0) > -1  ->  true  */
  return omit_one_operand (type, integer_one_node, inner);

      else if (op_code == MIN_EXPR && (consts_equal || consts_lt))
  /* MIN (X, 0) > 0  ->  false
     MIN (X, 0) > 5  ->  false  */
  return omit_one_operand (type, integer_zero_node, inner);

      else
  /* MIN (X, 0) > -1  ->  X > -1  */
  return fold (build2 (GT_EXPR, type, inner, comp_const));

    default:
      return t;
    }
}

/* T is an integer expression that is being multiplied, divided, or taken a
   modulus (CODE says which and what kind of divide or modulus) by a
   constant C.  See if we can eliminate that operation by folding it with
   other operations already in T.  WIDE_TYPE, if non-null, is a type that
   should be used for the computation if wider than our type.

   For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
   (X * 2) + (Y * 4).  We must, however, be assured that either the original
   expression would not overflow or that overflow is undefined for the type
   in the language in question.

   We also canonicalize (X + 7) * 4 into X * 4 + 28 in the hope that either
   the machine has a multiply-accumulate insn or that this is part of an
   addressing calculation.

   If we return a non-null expression, it is an equivalent form of the
   original computation, but need not be in the original type.  */

static tree
extract_muldiv (tree t, tree c, enum tree_code code, tree wide_type)
{
  /* To avoid exponential search depth, refuse to allow recursion past
     three levels.  Beyond that (1) it's highly unlikely that we'll find
     something interesting and (2) we've probably processed it before
     when we built the inner expression.  */

  static int depth;
  tree ret;

  if (depth > 3)
    return NULL;

  depth++;
  ret = extract_muldiv_1 (t, c, code, wide_type);
  depth--;

  return ret;
}

static tree
extract_muldiv_1 (tree t, tree c, enum tree_code code, tree wide_type)
{
  tree type = TREE_TYPE (t);
  enum tree_code tcode = TREE_CODE (t);
  tree ctype = (wide_type != 0 && (GET_MODE_SIZE (TYPE_MODE (wide_type))
           > GET_MODE_SIZE (TYPE_MODE (type)))
    ? wide_type : type);
  tree t1, t2;
  int same_p = tcode == code;
  tree op0 = NULL_TREE, op1 = NULL_TREE;

  /* Don't deal with constants of zero here; they confuse the code below.  */
  if (integer_zerop (c))
    return NULL_TREE;

  if (TREE_CODE_CLASS (tcode) == tcc_unary)
    op0 = TREE_OPERAND (t, 0);

  if (TREE_CODE_CLASS (tcode) == tcc_binary)
    op0 = TREE_OPERAND (t, 0), op1 = TREE_OPERAND (t, 1);

  /* Note that we need not handle conditional operations here since fold
     already handles those cases.  So just do arithmetic here.  */
  switch (tcode)
    {
    case INTEGER_CST:
      /* For a constant, we can always simplify if we are a multiply
   or (for divide and modulus) if it is a multiple of our constant.  */
      if (code == MULT_EXPR
    || integer_zerop (const_binop (TRUNC_MOD_EXPR, t, c, 0)))
  return const_binop (code, fold_convert (ctype, t),
          fold_convert (ctype, c), 0);
      break;

    case CONVERT_EXPR:  case NON_LVALUE_EXPR:  case NOP_EXPR:
      /* If op0 is an expression ...  */
      if ((COMPARISON_CLASS_P (op0)
     || UNARY_CLASS_P (op0)
     || BINARY_CLASS_P (op0)
     || EXPRESSION_CLASS_P (op0))
    /* ... and is unsigned, and its type is smaller than ctype,
       then we cannot pass through as widening.  */
    && ((TYPE_UNSIGNED (TREE_TYPE (op0))
         && ! (TREE_CODE (TREE_TYPE (op0)) == INTEGER_TYPE
         && TYPE_IS_SIZETYPE (TREE_TYPE (op0)))
         && (GET_MODE_SIZE (TYPE_MODE (ctype))
             > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))))
        /* ... or this is a truncation (t is narrower than op0),
     then we cannot pass through this narrowing.  */
        || (GET_MODE_SIZE (TYPE_MODE (type))
      < GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0))))
        /* ... or signedness changes for division or modulus,
     then we cannot pass through this conversion.  */
        || (code != MULT_EXPR
      && (TYPE_UNSIGNED (ctype)
          != TYPE_UNSIGNED (TREE_TYPE (op0))))))
  break;

      /* Pass the constant down and see if we can make a simplification.  If
   we can, replace this expression with the inner simplification for
   possible later conversion to our or some other type.  */
      if ((t2 = fold_convert (TREE_TYPE (op0), c)) != 0
    && TREE_CODE (t2) == INTEGER_CST
    && ! TREE_CONSTANT_OVERFLOW (t2)
    && (0 != (t1 = extract_muldiv (op0, t2, code,
           code == MULT_EXPR
           ? ctype : NULL_TREE))))
  return t1;
      break;

    case ABS_EXPR:
      /* If widening the type changes it from signed to unsigned, then we
         must avoid building ABS_EXPR itself as unsigned.  */
      if (TYPE_UNSIGNED (ctype) && !TYPE_UNSIGNED (type))
        {
          tree cstype = (*lang_hooks.types.signed_type) (ctype);
          if ((t1 = extract_muldiv (op0, c, code, cstype)) != 0)
            {
              t1 = fold (build1 (tcode, cstype, fold_convert (cstype, t1)));
              return fold_convert (ctype, t1);
            }
          break;
        }
    /* If the constant is negative, we cannot simplify this.  */ 
    if (tree_int_cst_sgn (c) == -1) 
      break;
      /* FALLTHROUGH */
    case NEGATE_EXPR:
      if ((t1 = extract_muldiv (op0, c, code, wide_type)) != 0)
  return fold (build1 (tcode, ctype, fold_convert (ctype, t1)));
      break;

    case MIN_EXPR:  case MAX_EXPR:
      /* If widening the type changes the signedness, then we can't perform
   this optimization as that changes the result.  */
      if (TYPE_UNSIGNED (ctype) != TYPE_UNSIGNED (type))
  break;

      /* MIN (a, b) / 5 -> MIN (a / 5, b / 5)  */
      if ((t1 = extract_muldiv (op0, c, code, wide_type)) != 0
    && (t2 = extract_muldiv (op1, c, code, wide_type)) != 0)
  {
    if (tree_int_cst_sgn (c) < 0)
      tcode = (tcode == MIN_EXPR ? MAX_EXPR : MIN_EXPR);

    return fold (build2 (tcode, ctype, fold_convert (ctype, t1),
             fold_convert (ctype, t2)));
  }
      break;

    case LSHIFT_EXPR:  case RSHIFT_EXPR:
      /* If the second operand is constant, this is a multiplication
   or floor division, by a power of two, so we can treat it that
   way unless the multiplier or divisor overflows.  Signed
   left-shift overflow is implementation-defined rather than
   undefined in C90, so do not convert signed left shift into
   multiplication.  */
      if (TREE_CODE (op1) == INTEGER_CST
    && (tcode == RSHIFT_EXPR || TYPE_UNSIGNED (TREE_TYPE (op0)))
    /* const_binop may not detect overflow correctly,
       so check for it explicitly here.  */
    && TYPE_PRECISION (TREE_TYPE (size_one_node)) > TREE_INT_CST_LOW (op1)
    && TREE_INT_CST_HIGH (op1) == 0
    && 0 != (t1 = fold_convert (ctype,
              const_binop (LSHIFT_EXPR,
               size_one_node,
               op1, 0)))
    && ! TREE_OVERFLOW (t1))
  return extract_muldiv (build2 (tcode == LSHIFT_EXPR
               ? MULT_EXPR : FLOOR_DIV_EXPR,
               ctype, fold_convert (ctype, op0), t1),
             c, code, wide_type);
      break;

    case PLUS_EXPR:  case MINUS_EXPR:
      /* See if we can eliminate the operation on both sides.  If we can, we
   can return a new PLUS or MINUS.  If we can't, the only remaining
   cases where we can do anything are if the second operand is a
   constant.  */
      t1 = extract_muldiv (op0, c, code, wide_type);
      t2 = extract_muldiv (op1, c, code, wide_type);
      if (t1 != 0 && t2 != 0
    && (code == MULT_EXPR
        /* If not multiplication, we can only do this if both operands
     are divisible by c.  */
        || (multiple_of_p (ctype, op0, c)
            && multiple_of_p (ctype, op1, c))))
  return fold (build2 (tcode, ctype, fold_convert (ctype, t1),
           fold_convert (ctype, t2)));

      /* If this was a subtraction, negate OP1 and set it to be an addition.
   This simplifies the logic below.  */
      if (tcode == MINUS_EXPR)
  tcode = PLUS_EXPR, op1 = negate_expr (op1);

      if (TREE_CODE (op1) != INTEGER_CST)
  break;

      /* If either OP1 or C are negative, this optimization is not safe for
   some of the division and remainder types while for others we need
   to change the code.  */
      if (tree_int_cst_sgn (op1) < 0 || tree_int_cst_sgn (c) < 0)
  {
    if (code == CEIL_DIV_EXPR)
      code = FLOOR_DIV_EXPR;
    else if (code == FLOOR_DIV_EXPR)
      code = CEIL_DIV_EXPR;
    else if (code != MULT_EXPR
       && code != CEIL_MOD_EXPR && code != FLOOR_MOD_EXPR)
      break;
  }

      /* If it's a multiply or a division/modulus operation of a multiple
         of our constant, do the operation and verify it doesn't overflow.  */
      if (code == MULT_EXPR
    || integer_zerop (const_binop (TRUNC_MOD_EXPR, op1, c, 0)))
  {
    op1 = const_binop (code, fold_convert (ctype, op1),
           fold_convert (ctype, c), 0);
    /* We allow the constant to overflow with wrapping semantics.  */
    if (op1 == 0
        || (TREE_OVERFLOW (op1) && ! flag_wrapv))
      break;
  }
      else
  break;

      /* If we have an unsigned type is not a sizetype, we cannot widen
   the operation since it will change the result if the original
   computation overflowed.  */
      if (TYPE_UNSIGNED (ctype)
    && ! (TREE_CODE (ctype) == INTEGER_TYPE && TYPE_IS_SIZETYPE (ctype))
    && ctype != type)
  break;

      /* If we were able to eliminate our operation from the first side,
   apply our operation to the second side and reform the PLUS.  */
      if (t1 != 0 && (TREE_CODE (t1) != code || code == MULT_EXPR))
  return fold (build2 (tcode, ctype, fold_convert (ctype, t1), op1));

      /* The last case is if we are a multiply.  In that case, we can
   apply the distributive law to commute the multiply and addition
   if the multiplication of the constants doesn't overflow.  */
      if (code == MULT_EXPR)
  return fold (build2 (tcode, ctype,
           fold (build2 (code, ctype,
             fold_convert (ctype, op0),
             fold_convert (ctype, c))),
           op1));

      break;

    case MULT_EXPR:
      /* We have a special case here if we are doing something like
   (C * 8) % 4 since we know that's zero.  */
      if ((code == TRUNC_MOD_EXPR || code == CEIL_MOD_EXPR
     || code == FLOOR_MOD_EXPR || code == ROUND_MOD_EXPR)
    && TREE_CODE (TREE_OPERAND (t, 1)) == INTEGER_CST
    && integer_zerop (const_binop (TRUNC_MOD_EXPR, op1, c, 0)))
  return omit_one_operand (type, integer_zero_node, op0);

      /* ... fall through ...  */

    case TRUNC_DIV_EXPR:  case CEIL_DIV_EXPR:  case FLOOR_DIV_EXPR:
    case ROUND_DIV_EXPR:  case EXACT_DIV_EXPR:
      /* If we can extract our operation from the LHS, do so and return a
   new operation.  Likewise for the RHS from a MULT_EXPR.  Otherwise,
   do something only if the second operand is a constant.  */
      if (same_p
    && (t1 = extract_muldiv (op0, c, code, wide_type)) != 0)
  return fold (build2 (tcode, ctype, fold_convert (ctype, t1),
           fold_convert (ctype, op1)));
      else if (tcode == MULT_EXPR && code == MULT_EXPR
         && (t1 = extract_muldiv (op1, c, code, wide_type)) != 0)
  return fold (build2 (tcode, ctype, fold_convert (ctype, op0),
           fold_convert (ctype, t1)));
      else if (TREE_CODE (op1) != INTEGER_CST)
  return 0;

      /* If these are the same operation types, we can associate them
   assuming no overflow.  */
      if (tcode == code
    && 0 != (t1 = const_binop (MULT_EXPR, fold_convert (ctype, op1),
             fold_convert (ctype, c), 0))
    && ! TREE_OVERFLOW (t1))
  return fold (build2 (tcode, ctype, fold_convert (ctype, op0), t1));

      /* If these operations "cancel" each other, we have the main
   optimizations of this pass, which occur when either constant is a
   multiple of the other, in which case we replace this with either an
   operation or CODE or TCODE.

   If we have an unsigned type that is not a sizetype, we cannot do
   this since it will change the result if the original computation
   overflowed.  */
      if ((! TYPE_UNSIGNED (ctype)
     || (TREE_CODE (ctype) == INTEGER_TYPE && TYPE_IS_SIZETYPE (ctype)))
    && ! flag_wrapv
    && ((code == MULT_EXPR && tcode == EXACT_DIV_EXPR)
        || (tcode == MULT_EXPR
      && code != TRUNC_MOD_EXPR && code != CEIL_MOD_EXPR
      && code != FLOOR_MOD_EXPR && code != ROUND_MOD_EXPR)))
  {
    if (integer_zerop (const_binop (TRUNC_MOD_EXPR, op1, c, 0)))
      return fold (build2 (tcode, ctype, fold_convert (ctype, op0),
         fold_convert (ctype,
                 const_binop (TRUNC_DIV_EXPR,
                  op1, c, 0))));
    else if (integer_zerop (const_binop (TRUNC_MOD_EXPR, c, op1, 0)))
      return fold (build2 (code, ctype, fold_convert (ctype, op0),
         fold_convert (ctype,
                 const_binop (TRUNC_DIV_EXPR,
                  c, op1, 0))));
  }
      break;

    default:
      break;
    }

  return 0;
}

/* Return a node which has the indicated constant VALUE (either 0 or
   1), and is of the indicated TYPE.  */

tree
constant_boolean_node (int value, tree type)
{
  if (type == integer_type_node)
    return value ? integer_one_node : integer_zero_node;
  else if (type == boolean_type_node)
    return value ? boolean_true_node : boolean_false_node;
  else
    return build_int_cst (type, value);
}


/* Return true if expr looks like an ARRAY_REF and set base and
   offset to the appropriate trees.  If there is no offset,
   offset is set to NULL_TREE.  */

static bool
extract_array_ref (tree expr, tree *base, tree *offset)
{
  /* We have to be careful with stripping nops as with the
     base type the meaning of the offset can change.  */
  tree inner_expr = expr;
  STRIP_NOPS (inner_expr);
  /* One canonical form is a PLUS_EXPR with the first
     argument being an ADDR_EXPR with a possible NOP_EXPR
     attached.  */
  if (TREE_CODE (expr) == PLUS_EXPR)
    {
      tree op0 = TREE_OPERAND (expr, 0);
      STRIP_NOPS (op0);
      if (TREE_CODE (op0) == ADDR_EXPR)
  {
    *base = TREE_OPERAND (expr, 0);
    *offset = TREE_OPERAND (expr, 1);
    return true;
  }
    }
  /* Other canonical form is an ADDR_EXPR of an ARRAY_REF,
     which we transform into an ADDR_EXPR with appropriate
     offset.  For other arguments to the ADDR_EXPR we assume
     zero offset and as such do not care about the ADDR_EXPR
     type and strip possible nops from it.  */
  else if (TREE_CODE (inner_expr) == ADDR_EXPR)
    {
      tree op0 = TREE_OPERAND (inner_expr, 0);
      if (TREE_CODE (op0) == ARRAY_REF)
  {
    *base = build_fold_addr_expr (TREE_OPERAND (op0, 0));
    *offset = TREE_OPERAND (op0, 1);
  }
      else
  {
    *base = inner_expr;
    *offset = NULL_TREE;
  }
      return true;
    }

  return false;
}


/* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
   Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'.  Here
   CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
   expression, and ARG to `a'.  If COND_FIRST_P is nonzero, then the
   COND is the first argument to CODE; otherwise (as in the example
   given here), it is the second argument.  TYPE is the type of the
   original expression.  Return NULL_TREE if no simplification is
   possible.  */

static tree
fold_binary_op_with_conditional_arg (tree t, enum tree_code code, tree cond,
             tree arg, int cond_first_p)
{
  const tree type = TREE_TYPE (t);
  tree cond_type = cond_first_p ? TREE_TYPE (TREE_OPERAND (t, 0)) 
        : TREE_TYPE (TREE_OPERAND (t, 1));
  tree arg_type = cond_first_p ? TREE_TYPE (TREE_OPERAND (t, 1)) 
             : TREE_TYPE (TREE_OPERAND (t, 0));
  tree test, true_value, false_value;
  tree lhs = NULL_TREE;
  tree rhs = NULL_TREE;

  /* This transformation is only worthwhile if we don't have to wrap
     arg in a SAVE_EXPR, and the operation can be simplified on at least
     one of the branches once its pushed inside the COND_EXPR.  */
  if (!TREE_CONSTANT (arg))
    return NULL_TREE;

  if (TREE_CODE (cond) == COND_EXPR)
    {
      test = TREE_OPERAND (cond, 0);
      true_value = TREE_OPERAND (cond, 1);
      false_value = TREE_OPERAND (cond, 2);
      /* If this operand throws an expression, then it does not make
   sense to try to perform a logical or arithmetic operation
   involving it.  */
      if (VOID_TYPE_P (TREE_TYPE (true_value)))
  lhs = true_value;
      if (VOID_TYPE_P (TREE_TYPE (false_value)))
  rhs = false_value;
    }
  else
    {
      tree testtype = TREE_TYPE (cond);
      test = cond;
      true_value = constant_boolean_node (true, testtype);
      false_value = constant_boolean_node (false, testtype);
    }

  arg = fold_convert (arg_type, arg);
  if (lhs == 0)
    {
      true_value = fold_convert (cond_type, true_value);
      lhs = fold (cond_first_p ? build2 (code, type, true_value, arg)
           : build2 (code, type, arg, true_value));
    }
  if (rhs == 0)
    {
      false_value = fold_convert (cond_type, false_value);
      rhs = fold (cond_first_p ? build2 (code, type, false_value, arg)
           : build2 (code, type, arg, false_value));
    }

  test = fold (build3 (COND_EXPR, type, test, lhs, rhs));
  return fold_convert (type, test);
}


/* Subroutine of fold() that checks for the addition of +/- 0.0.

   If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
   TYPE, X + ADDEND is the same as X.  If NEGATE, return true if X -
   ADDEND is the same as X.

   X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
   and finite.  The problematic cases are when X is zero, and its mode
   has signed zeros.  In the case of rounding towards -infinity,
   X - 0 is not the same as X because 0 - 0 is -0.  In other rounding
   modes, X + 0 is not the same as X because -0 + 0 is 0.  */

static bool
fold_real_zero_addition_p (tree type, tree addend, int negate)
{
  if (!real_zerop (addend))
    return false;

  /* Don't allow the fold with -fsignaling-nans.  */
  if (HONOR_SNANS (TYPE_MODE (type)))
    return false;

  /* Allow the fold if zeros aren't signed, or their sign isn't important.  */
  if (!HONOR_SIGNED_ZEROS (TYPE_MODE (type)))
    return true;

  /* Treat x + -0 as x - 0 and x - -0 as x + 0.  */
  if (TREE_CODE (addend) == REAL_CST
      && REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (addend)))
    negate = !negate;

  /* The mode has signed zeros, and we have to honor their sign.
     In this situation, there is only one case we can return true for.
     X - 0 is the same as X unless rounding towards -infinity is
     supported.  */
  return negate && !HONOR_SIGN_DEPENDENT_ROUNDING (TYPE_MODE (type));
}

/* Subroutine of fold() that checks comparisons of built-in math
   functions against real constants.

   FCODE is the DECL_FUNCTION_CODE of the built-in, CODE is the comparison
   operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR, GE_EXPR or LE_EXPR.  TYPE
   is the type of the result and ARG0 and ARG1 are the operands of the
   comparison.  ARG1 must be a TREE_REAL_CST.

   The function returns the constant folded tree if a simplification
   can be made, and NULL_TREE otherwise.  */

static tree
fold_mathfn_compare (enum built_in_function fcode, enum tree_code code,
         tree type, tree arg0, tree arg1)
{
  REAL_VALUE_TYPE c;

  if (BUILTIN_SQRT_P (fcode))
    {
      tree arg = TREE_VALUE (TREE_OPERAND (arg0, 1));
      enum machine_mode mode = TYPE_MODE (TREE_TYPE (arg0));

      c = TREE_REAL_CST (arg1);
      if (REAL_VALUE_NEGATIVE (c))
  {
    /* sqrt(x) < y is always false, if y is negative.  */
    if (code == EQ_EXPR || code == LT_EXPR || code == LE_EXPR)
      return omit_one_operand (type, integer_zero_node, arg);

    /* sqrt(x) > y is always true, if y is negative and we
       don't care about NaNs, i.e. negative values of x.  */
    if (code == NE_EXPR || !HONOR_NANS (mode))
      return omit_one_operand (type, integer_one_node, arg);

    /* sqrt(x) > y is the same as x >= 0, if y is negative.  */
    return fold (build2 (GE_EXPR, type, arg,
             build_real (TREE_TYPE (arg), dconst0)));
  }
      else if (code == GT_EXPR || code == GE_EXPR)
  {
    REAL_VALUE_TYPE c2;

    REAL_ARITHMETIC (c2, MULT_EXPR, c, c);
    real_convert (&c2, mode, &c2);

    if (REAL_VALUE_ISINF (c2))
      {
        /* sqrt(x) > y is x == +Inf, when y is very large.  */
        if (HONOR_INFINITIES (mode))
    return fold (build2 (EQ_EXPR, type, arg,
             build_real (TREE_TYPE (arg), c2)));

        /* sqrt(x) > y is always false, when y is very large
     and we don't care about infinities.  */
        return omit_one_operand (type, integer_zero_node, arg);
      }

    /* sqrt(x) > c is the same as x > c*c.  */
    return fold (build2 (code, type, arg,
             build_real (TREE_TYPE (arg), c2)));
  }
      else if (code == LT_EXPR || code == LE_EXPR)
  {
    REAL_VALUE_TYPE c2;

    REAL_ARITHMETIC (c2, MULT_EXPR, c, c);
    real_convert (&c2, mode, &c2);

    if (REAL_VALUE_ISINF (c2))
      {
        /* sqrt(x) < y is always true, when y is a very large
     value and we don't care about NaNs or Infinities.  */
        if (! HONOR_NANS (mode) && ! HONOR_INFINITIES (mode))
    return omit_one_operand (type, integer_one_node, arg);

        /* sqrt(x) < y is x != +Inf when y is very large and we
     don't care about NaNs.  */
        if (! HONOR_NANS (mode))
    return fold (build2 (NE_EXPR, type, arg,
             build_real (TREE_TYPE (arg), c2)));

        /* sqrt(x) < y is x >= 0 when y is very large and we
     don't care about Infinities.  */
        if (! HONOR_INFINITIES (mode))
    return fold (build2 (GE_EXPR, type, arg,
             build_real (TREE_TYPE (arg), dconst0)));

        /* sqrt(x) < y is x >= 0 && x != +Inf, when y is large.  */
        if (lang_hooks.decls.global_bindings_p () != 0
      || CONTAINS_PLACEHOLDER_P (arg))
    return NULL_TREE;

        arg = save_expr (arg);
        return fold (build2 (TRUTH_ANDIF_EXPR, type,
           fold (build2 (GE_EXPR, type, arg,
             build_real (TREE_TYPE (arg),
                   dconst0))),
           fold (build2 (NE_EXPR, type, arg,
             build_real (TREE_TYPE (arg),
                   c2)))));
      }

    /* sqrt(x) < c is the same as x < c*c, if we ignore NaNs.  */
    if (! HONOR_NANS (mode))
      return fold (build2 (code, type, arg,
         build_real (TREE_TYPE (arg), c2)));

    /* sqrt(x) < c is the same as x >= 0 && x < c*c.  */
    if (lang_hooks.decls.global_bindings_p () == 0
        && ! CONTAINS_PLACEHOLDER_P (arg))
      {
        arg = save_expr (arg);
        return fold (build2 (TRUTH_ANDIF_EXPR, type,
           fold (build2 (GE_EXPR, type, arg,
             build_real (TREE_TYPE (arg),
                   dconst0))),
           fold (build2 (code, type, arg,
             build_real (TREE_TYPE (arg),
                   c2)))));
      }
  }
    }

  return NULL_TREE;
}

/* Subroutine of fold() that optimizes comparisons against Infinities,
   either +Inf or -Inf.

   CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
   GE_EXPR or LE_EXPR.  TYPE is the type of the result and ARG0 and ARG1
   are the operands of the comparison.  ARG1 must be a TREE_REAL_CST.

   The function returns the constant folded tree if a simplification
   can be made, and NULL_TREE otherwise.  */

static tree
fold_inf_compare (enum tree_code code, tree type, tree arg0, tree arg1)
{
  enum machine_mode mode;
  REAL_VALUE_TYPE max;
  tree temp;
  bool neg;

  mode = TYPE_MODE (TREE_TYPE (arg0));

  /* For negative infinity swap the sense of the comparison.  */
  neg = REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg1));
  if (neg)
    code = swap_tree_comparison (code);

  switch (code)
    {
    case GT_EXPR:
      /* x > +Inf is always false, if with ignore sNANs.  */
      if (HONOR_SNANS (mode))
        return NULL_TREE;
      return omit_one_operand (type, integer_zero_node, arg0);

    case LE_EXPR:
      /* x <= +Inf is always true, if we don't case about NaNs.  */
      if (! HONOR_NANS (mode))
  return omit_one_operand (type, integer_one_node, arg0);

      /* x <= +Inf is the same as x == x, i.e. isfinite(x).  */
      if (lang_hooks.decls.global_bindings_p () == 0
    && ! CONTAINS_PLACEHOLDER_P (arg0))
  {
    arg0 = save_expr (arg0);
    return fold (build2 (EQ_EXPR, type, arg0, arg0));
  }
      break;

    case EQ_EXPR:
    case GE_EXPR:
      /* x == +Inf and x >= +Inf are always equal to x > DBL_MAX.  */
      real_maxval (&max, neg, mode);
      return fold (build2 (neg ? LT_EXPR : GT_EXPR, type,
         arg0, build_real (TREE_TYPE (arg0), max)));

    case LT_EXPR:
      /* x < +Inf is always equal to x <= DBL_MAX.  */
      real_maxval (&max, neg, mode);
      return fold (build2 (neg ? GE_EXPR : LE_EXPR, type,
         arg0, build_real (TREE_TYPE (arg0), max)));

    case NE_EXPR:
      /* x != +Inf is always equal to !(x > DBL_MAX).  */
      real_maxval (&max, neg, mode);
      if (! HONOR_NANS (mode))
  return fold (build2 (neg ? GE_EXPR : LE_EXPR, type,
           arg0, build_real (TREE_TYPE (arg0), max)));

      /* The transformation below creates non-gimple code and thus is
   not appropriate if we are in gimple form.  */
      if (in_gimple_form)
  return NULL_TREE;

      temp = fold (build2 (neg ? LT_EXPR : GT_EXPR, type,
         arg0, build_real (TREE_TYPE (arg0), max)));
      return fold (build1 (TRUTH_NOT_EXPR, type, temp));

    default:
      break;
    }

  return NULL_TREE;
}

/* Subroutine of fold() that optimizes comparisons of a division by
   a nonzero integer constant against an integer constant, i.e.
   X/C1 op C2.

   CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
   GE_EXPR or LE_EXPR.  TYPE is the type of the result and ARG0 and ARG1
   are the operands of the comparison.  ARG1 must be a TREE_REAL_CST.

   The function returns the constant folded tree if a simplification
   can be made, and NULL_TREE otherwise.  */

static tree
fold_div_compare (enum tree_code code, tree type, tree arg0, tree arg1)
{
  tree prod, tmp, hi, lo;
  tree arg00 = TREE_OPERAND (arg0, 0);
  tree arg01 = TREE_OPERAND (arg0, 1);
  unsigned HOST_WIDE_INT lpart;
  HOST_WIDE_INT hpart;
  int overflow;

  /* We have to do this the hard way to detect unsigned overflow.
     prod = int_const_binop (MULT_EXPR, arg01, arg1, 0);  */
  overflow = mul_double (TREE_INT_CST_LOW (arg01),
       TREE_INT_CST_HIGH (arg01),
       TREE_INT_CST_LOW (arg1),
       TREE_INT_CST_HIGH (arg1), &lpart, &hpart);
  prod = build_int_cst_wide (TREE_TYPE (arg00), lpart, hpart);
  prod = force_fit_type (prod, -1, overflow, false);

  if (TYPE_UNSIGNED (TREE_TYPE (arg0)))
    {
      tmp = int_const_binop (MINUS_EXPR, arg01, integer_one_node, 0);
      lo = prod;

      /* Likewise hi = int_const_binop (PLUS_EXPR, prod, tmp, 0).  */
      overflow = add_double (TREE_INT_CST_LOW (prod),
           TREE_INT_CST_HIGH (prod),
           TREE_INT_CST_LOW (tmp),
           TREE_INT_CST_HIGH (tmp),
           &lpart, &hpart);
      hi = build_int_cst_wide (TREE_TYPE (arg00), lpart, hpart);
      hi = force_fit_type (hi, -1, overflow | TREE_OVERFLOW (prod),
         TREE_CONSTANT_OVERFLOW (prod));
    }
  else if (tree_int_cst_sgn (arg01) >= 0)
    {
      tmp = int_const_binop (MINUS_EXPR, arg01, integer_one_node, 0);
      switch (tree_int_cst_sgn (arg1))
  {
  case -1:
    lo = int_const_binop (MINUS_EXPR, prod, tmp, 0);
    hi = prod;
    break;

  case  0:
    lo = fold_negate_const (tmp, TREE_TYPE (arg0));
    hi = tmp;
    break;

  case  1:
          hi = int_const_binop (PLUS_EXPR, prod, tmp, 0);
    lo = prod;
    break;

  default:
    gcc_unreachable ();
  }
    }
  else
    {
      /* A negative divisor reverses the relational operators.  */
      code = swap_tree_comparison (code);

      tmp = int_const_binop (PLUS_EXPR, arg01, integer_one_node, 0);
      switch (tree_int_cst_sgn (arg1))
  {
  case -1:
    hi = int_const_binop (MINUS_EXPR, prod, tmp, 0);
    lo = prod;
    break;

  case  0:
    hi = fold_negate_const (tmp, TREE_TYPE (arg0));
    lo = tmp;
    break;

  case  1:
          lo = int_const_binop (PLUS_EXPR, prod, tmp, 0);
    hi = prod;
    break;

  default:
    gcc_unreachable ();
  }
    }

  switch (code)
    {
    case EQ_EXPR:
      if (TREE_OVERFLOW (lo) && TREE_OVERFLOW (hi))
  return omit_one_operand (type, integer_zero_node, arg00);
      if (TREE_OVERFLOW (hi))
  return fold (build2 (GE_EXPR, type, arg00, lo));
      if (TREE_OVERFLOW (lo))
  return fold (build2 (LE_EXPR, type, arg00, hi));
      return build_range_check (type, arg00, 1, lo, hi);

    case NE_EXPR:
      if (TREE_OVERFLOW (lo) && TREE_OVERFLOW (hi))
  return omit_one_operand (type, integer_one_node, arg00);
      if (TREE_OVERFLOW (hi))
  return fold (build2 (LT_EXPR, type, arg00, lo));
      if (TREE_OVERFLOW (lo))
  return fold (build2 (GT_EXPR, type, arg00, hi));
      return build_range_check (type, arg00, 0, lo, hi);

    case LT_EXPR:
      if (TREE_OVERFLOW (lo))
  return omit_one_operand (type, integer_zero_node, arg00);
      return fold (build2 (LT_EXPR, type, arg00, lo));

    case LE_EXPR:
      if (TREE_OVERFLOW (hi))
  return omit_one_operand (type, integer_one_node, arg00);
      return fold (build2 (LE_EXPR, type, arg00, hi));

    case GT_EXPR:
      if (TREE_OVERFLOW (hi))
  return omit_one_operand (type, integer_zero_node, arg00);
      return fold (build2 (GT_EXPR, type, arg00, hi));

    case GE_EXPR:
      if (TREE_OVERFLOW (lo))
  return omit_one_operand (type, integer_one_node, arg00);
      return fold (build2 (GE_EXPR, type, arg00, lo));

    default:
      break;
    }

  return NULL_TREE;
}


/* If CODE with arguments ARG0 and ARG1 represents a single bit
   equality/inequality test, then return a simplified form of
   the test using shifts and logical operations.  Otherwise return
   NULL.  TYPE is the desired result type.  */

tree
fold_single_bit_test (enum tree_code code, tree arg0, tree arg1,
          tree result_type)
{
  /* If this is testing a single bit, we can optimize the test.  */
  if ((code == NE_EXPR || code == EQ_EXPR)
      && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)
      && integer_pow2p (TREE_OPERAND (arg0, 1)))
    {
      tree inner = TREE_OPERAND (arg0, 0);
      tree type = TREE_TYPE (arg0);
      int bitnum = tree_log2 (TREE_OPERAND (arg0, 1));
      enum machine_mode operand_mode = TYPE_MODE (type);
      int ops_unsigned;
      tree signed_type, unsigned_type, intermediate_type;
      tree arg00;

      /* If we have (A & C) != 0 where C is the sign bit of A, convert
   this into A < 0.  Similarly for (A & C) == 0 into A >= 0.  */
      arg00 = sign_bit_p (TREE_OPERAND (arg0, 0), TREE_OPERAND (arg0, 1));
      if (arg00 != NULL_TREE
    /* This is only a win if casting to a signed type is cheap,
       i.e. when arg00's type is not a partial mode.  */
    && TYPE_PRECISION (TREE_TYPE (arg00))
       == GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (arg00))))
  {
    tree stype = lang_hooks.types.signed_type (TREE_TYPE (arg00));
    return fold (build2 (code == EQ_EXPR ? GE_EXPR : LT_EXPR,
             result_type, fold_convert (stype, arg00),
             fold_convert (stype, integer_zero_node)));
  }

      /* Otherwise we have (A & C) != 0 where C is a single bit,
   convert that into ((A >> C2) & 1).  Where C2 = log2(C).
   Similarly for (A & C) == 0.  */

      /* If INNER is a right shift of a constant and it plus BITNUM does
   not overflow, adjust BITNUM and INNER.  */
      if (TREE_CODE (inner) == RSHIFT_EXPR
    && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST
    && TREE_INT_CST_HIGH (TREE_OPERAND (inner, 1)) == 0
    && bitnum < TYPE_PRECISION (type)
    && 0 > compare_tree_int (TREE_OPERAND (inner, 1),
           bitnum - TYPE_PRECISION (type)))
  {
    bitnum += TREE_INT_CST_LOW (TREE_OPERAND (inner, 1));
    inner = TREE_OPERAND (inner, 0);
  }

      /* If we are going to be able to omit the AND below, we must do our
   operations as unsigned.  If we must use the AND, we have a choice.
   Normally unsigned is faster, but for some machines signed is.  */
#ifdef LOAD_EXTEND_OP
      ops_unsigned = (LOAD_EXTEND_OP (operand_mode) == SIGN_EXTEND 
          && !flag_syntax_only) ? 0 : 1;
#else
      ops_unsigned = 1;
#endif

      signed_type = lang_hooks.types.type_for_mode (operand_mode, 0);
      unsigned_type = lang_hooks.types.type_for_mode (operand_mode, 1);
      intermediate_type = ops_unsigned ? unsigned_type : signed_type;
      inner = fold_convert (intermediate_type, inner);

      if (bitnum != 0)
  inner = build2 (RSHIFT_EXPR, intermediate_type,
      inner, size_int (bitnum));

      if (code == EQ_EXPR)
  inner = fold (build2 (BIT_XOR_EXPR, intermediate_type,
            inner, integer_one_node));

      /* Put the AND last so it can combine with more things.  */
      inner = build2 (BIT_AND_EXPR, intermediate_type,
          inner, integer_one_node);

      /* Make sure to return the proper type.  */
      inner = fold_convert (result_type, inner);

      return inner;
    }
  return NULL_TREE;
}

/* Check whether we are allowed to reorder operands arg0 and arg1,
   such that the evaluation of arg1 occurs before arg0.  */

static bool
reorder_operands_p (tree arg0, tree arg1)
{
  if (! flag_evaluation_order)
      return true;
  if (TREE_CONSTANT (arg0) || TREE_CONSTANT (arg1))
    return true;
  return ! TREE_SIDE_EFFECTS (arg0)
   && ! TREE_SIDE_EFFECTS (arg1);
}

/* Test whether it is preferable two swap two operands, ARG0 and
   ARG1, for example because ARG0 is an integer constant and ARG1
   isn't.  If REORDER is true, only recommend swapping if we can
   evaluate the operands in reverse order.  */

bool
tree_swap_operands_p (tree arg0, tree arg1, bool reorder)
{
  STRIP_SIGN_NOPS (arg0);
  STRIP_SIGN_NOPS (arg1);

  if (TREE_CODE (arg1) == INTEGER_CST)
    return 0;
  if (TREE_CODE (arg0) == INTEGER_CST)
    return 1;

  if (TREE_CODE (arg1) == REAL_CST)
    return 0;
  if (TREE_CODE (arg0) == REAL_CST)
    return 1;

  if (TREE_CODE (arg1) == COMPLEX_CST)
    return 0;
  if (TREE_CODE (arg0) == COMPLEX_CST)
    return 1;

  if (TREE_CONSTANT (arg1))
    return 0;
  if (TREE_CONSTANT (arg0))
    return 1;

  if (optimize_size)
    return 0;

  if (reorder && flag_evaluation_order
      && (TREE_SIDE_EFFECTS (arg0) || TREE_SIDE_EFFECTS (arg1)))
    return 0;

  if (DECL_P (arg1))
    return 0;
  if (DECL_P (arg0))
    return 1;

  /* It is preferable to swap two SSA_NAME to ensure a canonical form
     for commutative and comparison operators.  Ensuring a canonical
     form allows the optimizers to find additional redundancies without
     having to explicitly check for both orderings.  */
  if (TREE_CODE (arg0) == SSA_NAME
      && TREE_CODE (arg1) == SSA_NAME
      && SSA_NAME_VERSION (arg0) > SSA_NAME_VERSION (arg1))
    return 1;

  return 0;
}

/* Fold comparison ARG0 CODE ARG1 (with result in TYPE), where
   ARG0 is extended to a wider type.  */

static tree
fold_widened_comparison (enum tree_code code, tree type, tree arg0, tree arg1)
{
  tree arg0_unw = get_unwidened (arg0, NULL_TREE);
  tree arg1_unw;
  tree shorter_type, outer_type;
  tree min, max;
  bool above, below;

  if (arg0_unw == arg0)
    return NULL_TREE;
  shorter_type = TREE_TYPE (arg0_unw);

#ifdef HAVE_canonicalize_funcptr_for_compare
  /* Disable this optimization if we're casting a function pointer
     type on targets that require function pointer canonicalization.  */
  if (HAVE_canonicalize_funcptr_for_compare
      && TREE_CODE (shorter_type) == POINTER_TYPE
      && TREE_CODE (TREE_TYPE (shorter_type)) == FUNCTION_TYPE)
    return NULL_TREE;
#endif

  if (TYPE_PRECISION (TREE_TYPE (arg0)) <= TYPE_PRECISION (shorter_type))
    return NULL_TREE;

  arg1_unw = get_unwidened (arg1, shorter_type);
  if (!arg1_unw)
    return NULL_TREE;

  /* If possible, express the comparison in the shorter mode.  */
  if ((code == EQ_EXPR || code == NE_EXPR
       || TYPE_UNSIGNED (TREE_TYPE (arg0)) == TYPE_UNSIGNED (shorter_type))
      && (TREE_TYPE (arg1_unw) == shorter_type
    || (TREE_CODE (arg1_unw) == INTEGER_CST
        && TREE_CODE (shorter_type) == INTEGER_TYPE
        && int_fits_type_p (arg1_unw, shorter_type))))
    return fold (build (code, type, arg0_unw,
      fold_convert (shorter_type, arg1_unw)));

  if (TREE_CODE (arg1_unw) != INTEGER_CST)
    return NULL_TREE;

  /* If we are comparing with the integer that does not fit into the range
     of the shorter type, the result is known.  */
  outer_type = TREE_TYPE (arg1_unw);
  min = lower_bound_in_type (outer_type, shorter_type);
  max = upper_bound_in_type (outer_type, shorter_type);

  above = integer_nonzerop (fold_relational_const (LT_EXPR, type,
               max, arg1_unw));
  below = integer_nonzerop (fold_relational_const (LT_EXPR, type,
               arg1_unw, min));

  switch (code)
    {
    case EQ_EXPR:
      if (above || below)
  return omit_one_operand (type, integer_zero_node, arg0);
      break;

    case NE_EXPR:
      if (above || below)
  return omit_one_operand (type, integer_one_node, arg0);
      break;

    case LT_EXPR:
    case LE_EXPR:
      if (above)
  return omit_one_operand (type, integer_one_node, arg0);
      else if (below)
  return omit_one_operand (type, integer_zero_node, arg0);

    case GT_EXPR:
    case GE_EXPR:
      if (above)
  return omit_one_operand (type, integer_zero_node, arg0);
      else if (below)
  return omit_one_operand (type, integer_one_node, arg0);

    default:
      break;
    }

  return NULL_TREE;
}

/* Fold comparison ARG0 CODE ARG1 (with result in TYPE), where for
   ARG0 just the signedness is changed.  */

static tree
fold_sign_changed_comparison (enum tree_code code, tree type,
            tree arg0, tree arg1)
{
  tree arg0_inner, tmp;
  tree inner_type, outer_type;

  if (TREE_CODE (arg0) != NOP_EXPR
      && TREE_CODE (arg0) != CONVERT_EXPR)
    return NULL_TREE;

  outer_type = TREE_TYPE (arg0);
  arg0_inner = TREE_OPERAND (arg0, 0);
  inner_type = TREE_TYPE (arg0_inner);

#ifdef HAVE_canonicalize_funcptr_for_compare
  /* Disable this optimization if we're casting a function pointer
     type on targets that require function pointer canonicalization.  */
  if (HAVE_canonicalize_funcptr_for_compare
      && TREE_CODE (inner_type) == POINTER_TYPE
      && TREE_CODE (TREE_TYPE (inner_type)) == FUNCTION_TYPE)
    return NULL_TREE;
#endif

  if (TYPE_PRECISION (inner_type) != TYPE_PRECISION (outer_type))
    return NULL_TREE;

  if (TREE_CODE (arg1) != INTEGER_CST
      && !((TREE_CODE (arg1) == NOP_EXPR
      || TREE_CODE (arg1) == CONVERT_EXPR)
     && TREE_TYPE (TREE_OPERAND (arg1, 0)) == inner_type))
    return NULL_TREE;

  if (TYPE_UNSIGNED (inner_type) != TYPE_UNSIGNED (outer_type)
      && code != NE_EXPR
      && code != EQ_EXPR)
    return NULL_TREE;

  if (TREE_CODE (arg1) == INTEGER_CST)
    {
      tmp = build_int_cst_wide (inner_type,
        TREE_INT_CST_LOW (arg1),
        TREE_INT_CST_HIGH (arg1));
      arg1 = force_fit_type (tmp, 0,
           TREE_OVERFLOW (arg1),
           TREE_CONSTANT_OVERFLOW (arg1));
    }
  else
    arg1 = fold_convert (inner_type, arg1);

  return fold (build2 (code, type, arg0_inner, arg1));
}

/* Tries to replace &a[idx] CODE s * delta with &a[idx CODE delta], if s is
   step of the array.  ADDR is the address. MULT is the multiplicative expression.
   If the function succeeds, the new address expression is returned.  Otherwise
   NULL_TREE is returned.  */

static tree
try_move_mult_to_index (enum tree_code code, tree addr, tree mult)
{
  tree s, delta, step;
  tree arg0 = TREE_OPERAND (mult, 0), arg1 = TREE_OPERAND (mult, 1);
  tree ref = TREE_OPERAND (addr, 0), pref;
  tree ret, pos;
  tree itype;

  STRIP_NOPS (arg0);
  STRIP_NOPS (arg1);
  
  if (TREE_CODE (arg0) == INTEGER_CST)
    {
      s = arg0;
      delta = arg1;
    }
  else if (TREE_CODE (arg1) == INTEGER_CST)
    {
      s = arg1;
      delta = arg0;
    }
  else
    return NULL_TREE;

  for (;; ref = TREE_OPERAND (ref, 0))
    {
      if (TREE_CODE (ref) == ARRAY_REF)
  {
    step = array_ref_element_size (ref);

    if (TREE_CODE (step) != INTEGER_CST)
      continue;

    itype = TREE_TYPE (step);

    /* If the type sizes do not match, we might run into problems
       when one of them would overflow.  */
    if (TYPE_PRECISION (itype) != TYPE_PRECISION (TREE_TYPE (s)))
      continue;

    if (!operand_equal_p (step, fold_convert (itype, s), 0))
      continue;

    delta = fold_convert (itype, delta);
    break;
  }

      if (!handled_component_p (ref))
  return NULL_TREE;
    }

  /* We found the suitable array reference.  So copy everything up to it,
     and replace the index.  */

  pref = TREE_OPERAND (addr, 0);
  ret = copy_node (pref);
  pos = ret;

  while (pref != ref)
    {
      pref = TREE_OPERAND (pref, 0);
      TREE_OPERAND (pos, 0) = copy_node (pref);
      pos = TREE_OPERAND (pos, 0);
    }

  TREE_OPERAND (pos, 1) = fold (build2 (code, itype,
          TREE_OPERAND (pos, 1),
          delta));

  return build1 (ADDR_EXPR, TREE_TYPE (addr), ret);
}


/* Fold A < X && A + 1 > Y to A < X && A >= Y.  Normally A + 1 > Y
   means A >= Y && A != MAX, but in this case we know that
   A < X <= MAX.  INEQ is A + 1 > Y, BOUND is A < X.  */

static tree
fold_to_nonsharp_ineq_using_bound (tree ineq, tree bound)
{
  tree a, typea, type = TREE_TYPE (ineq), a1, diff, y;

  if (TREE_CODE (bound) == LT_EXPR)
    a = TREE_OPERAND (bound, 0);
  else if (TREE_CODE (bound) == GT_EXPR)
    a = TREE_OPERAND (bound, 1);
  else
    return NULL_TREE;

  typea = TREE_TYPE (a);
  if (!INTEGRAL_TYPE_P (typea)
      && !POINTER_TYPE_P (typea))
    return NULL_TREE;

  if (TREE_CODE (ineq) == LT_EXPR)
    {
      a1 = TREE_OPERAND (ineq, 1);
      y = TREE_OPERAND (ineq, 0);
    }
  else if (TREE_CODE (ineq) == GT_EXPR)
    {
      a1 = TREE_OPERAND (ineq, 0);
      y = TREE_OPERAND (ineq, 1);
    }
  else
    return NULL_TREE;

  if (TREE_TYPE (a1) != typea)
    return NULL_TREE;

  diff = fold (build2 (MINUS_EXPR, typea, a1, a));
  if (!integer_onep (diff))
    return NULL_TREE;

  return fold (build2 (GE_EXPR, type, a, y));
}

/* Fold complex addition when both components are accessible by parts.
   Return non-null if successful.  CODE should be PLUS_EXPR for addition,
   or MINUS_EXPR for subtraction.  */

static tree
fold_complex_add (tree type, tree ac, tree bc, enum tree_code code)
{
  tree ar, ai, br, bi, rr, ri, inner_type;

  if (TREE_CODE (ac) == COMPLEX_EXPR)
    ar = TREE_OPERAND (ac, 0), ai = TREE_OPERAND (ac, 1);
  else if (TREE_CODE (ac) == COMPLEX_CST)
    ar = TREE_REALPART (ac), ai = TREE_IMAGPART (ac);
  else
    return NULL;

  if (TREE_CODE (bc) == COMPLEX_EXPR)
    br = TREE_OPERAND (bc, 0), bi = TREE_OPERAND (bc, 1);
  else if (TREE_CODE (bc) == COMPLEX_CST)
    br = TREE_REALPART (bc), bi = TREE_IMAGPART (bc);
  else
    return NULL;

  inner_type = TREE_TYPE (type);

  rr = fold (build2 (code, inner_type, ar, br));  
  ri = fold (build2 (code, inner_type, ai, bi));  

  return fold (build2 (COMPLEX_EXPR, type, rr, ri));
}

/* Perform some simplifications of complex multiplication when one or more
   of the components are constants or zeros.  Return non-null if successful.  */

tree
fold_complex_mult_parts (tree type, tree ar, tree ai, tree br, tree bi)
{
  tree rr, ri, inner_type, zero;
  bool ar0, ai0, br0, bi0, bi1;

  inner_type = TREE_TYPE (type);
  zero = NULL;

  if (SCALAR_FLOAT_TYPE_P (inner_type))
    {
      ar0 = ai0 = br0 = bi0 = bi1 = false;

      /* We're only interested in +0.0 here, thus we don't use real_zerop.  */

      if (TREE_CODE (ar) == REAL_CST
    && REAL_VALUES_IDENTICAL (TREE_REAL_CST (ar), dconst0))
  ar0 = true, zero = ar;

      if (TREE_CODE (ai) == REAL_CST
    && REAL_VALUES_IDENTICAL (TREE_REAL_CST (ai), dconst0))
  ai0 = true, zero = ai;

      if (TREE_CODE (br) == REAL_CST
    && REAL_VALUES_IDENTICAL (TREE_REAL_CST (br), dconst0))
  br0 = true, zero = br;

      if (TREE_CODE (bi) == REAL_CST)
  {
    if (REAL_VALUES_IDENTICAL (TREE_REAL_CST (bi), dconst0))
      bi0 = true, zero = bi;
    else if (REAL_VALUES_IDENTICAL (TREE_REAL_CST (bi), dconst1))
      bi1 = true;
  }
    }
  else
    {
      ar0 = integer_zerop (ar);
      if (ar0)
  zero = ar;
      ai0 = integer_zerop (ai);
      if (ai0)
  zero = ai;
      br0 = integer_zerop (br);
      if (br0)
  zero = br;
      bi0 = integer_zerop (bi);
      if (bi0)
  {
    zero = bi;
    bi1 = false;
  }
      else
  bi1 = integer_onep (bi);
    }

  /* We won't optimize anything below unless something is zero.  */
  if (zero == NULL)
    return NULL;

  if (ai0 && br0 && bi1)
    {
      rr = zero;
      ri = ar;
    }
  else if (ai0 && bi0)
    {
      rr = fold (build2 (MULT_EXPR, inner_type, ar, br));
      ri = zero;
    }
  else if (ai0 && br0)
    {
      rr = zero;
      ri = fold (build2 (MULT_EXPR, inner_type, ar, bi));
    }
  else if (ar0 && bi0)
    {
      rr = zero;
      ri = fold (build2 (MULT_EXPR, inner_type, ai, br));
    }
  else if (ar0 && br0)
    {
      rr = fold (build2 (MULT_EXPR, inner_type, ai, bi));
      rr = fold (build1 (NEGATE_EXPR, inner_type, rr));
      ri = zero;
    }
  else if (bi0)
    {
      rr = fold (build2 (MULT_EXPR, inner_type, ar, br));
      ri = fold (build2 (MULT_EXPR, inner_type, ai, br));
    }
  else if (ai0)
    {
      rr = fold (build2 (MULT_EXPR, inner_type, ar, br));
      ri = fold (build2 (MULT_EXPR, inner_type, ar, bi));
    }
  else if (br0)
    {
      rr = fold (build2 (MULT_EXPR, inner_type, ai, bi));
      rr = fold (build1 (NEGATE_EXPR, inner_type, rr));
      ri = fold (build2 (MULT_EXPR, inner_type, ar, bi));
    }
  else if (ar0)
    {
      rr = fold (build2 (MULT_EXPR, inner_type, ai, bi));
      rr = fold (build1 (NEGATE_EXPR, inner_type, rr));
      ri = fold (build2 (MULT_EXPR, inner_type, ai, br));
    }
  else
    return NULL;

  return fold (build2 (COMPLEX_EXPR, type, rr, ri));
}

static tree
fold_complex_mult (tree type, tree ac, tree bc)
{
  tree ar, ai, br, bi;

  if (TREE_CODE (ac) == COMPLEX_EXPR)
    ar = TREE_OPERAND (ac, 0), ai = TREE_OPERAND (ac, 1);
  else if (TREE_CODE (ac) == COMPLEX_CST)
    ar = TREE_REALPART (ac), ai = TREE_IMAGPART (ac);
  else
    return NULL;

  if (TREE_CODE (bc) == COMPLEX_EXPR)
    br = TREE_OPERAND (bc, 0), bi = TREE_OPERAND (bc, 1);
  else if (TREE_CODE (bc) == COMPLEX_CST)
    br = TREE_REALPART (bc), bi = TREE_IMAGPART (bc);
  else
    return NULL;

  return fold_complex_mult_parts (type, ar, ai, br, bi);
}

/* Perform some simplifications of complex division when one or more of
   the components are constants or zeros.  Return non-null if successful.  */

tree
fold_complex_div_parts (tree type, tree ar, tree ai, tree br, tree bi,
      enum tree_code code)
{
  tree rr, ri, inner_type, zero;
  bool ar0, ai0, br0, bi0, bi1;

  inner_type = TREE_TYPE (type);
  zero = NULL;

  if (SCALAR_FLOAT_TYPE_P (inner_type))
    {
      ar0 = ai0 = br0 = bi0 = bi1 = false;

      /* We're only interested in +0.0 here, thus we don't use real_zerop.  */

      if (TREE_CODE (ar) == REAL_CST
    && REAL_VALUES_IDENTICAL (TREE_REAL_CST (ar), dconst0))
  ar0 = true, zero = ar;

      if (TREE_CODE (ai) == REAL_CST
    && REAL_VALUES_IDENTICAL (TREE_REAL_CST (ai), dconst0))
  ai0 = true, zero = ai;

      if (TREE_CODE (br) == REAL_CST
    && REAL_VALUES_IDENTICAL (TREE_REAL_CST (br), dconst0))
  br0 = true, zero = br;

      if (TREE_CODE (bi) == REAL_CST)
  {
    if (REAL_VALUES_IDENTICAL (TREE_REAL_CST (bi), dconst0))
      bi0 = true, zero = bi;
    else if (REAL_VALUES_IDENTICAL (TREE_REAL_CST (bi), dconst1))
      bi1 = true;
  }
    }
  else
    {
      ar0 = integer_zerop (ar);
      if (ar0)
  zero = ar;
      ai0 = integer_zerop (ai);
      if (ai0)
  zero = ai;
      br0 = integer_zerop (br);
      if (br0)
  zero = br;
      bi0 = integer_zerop (bi);
      if (bi0)
  {
    zero = bi;
    bi1 = false;
  }
      else
  bi1 = integer_onep (bi);
    }

  /* We won't optimize anything below unless something is zero.  */
  if (zero == NULL)
    return NULL;

  if (ai0 && bi0)
    {
      rr = fold (build2 (code, inner_type, ar, br));
      ri = zero;
    }
  else if (ai0 && br0)
    {
      rr = zero;
      ri = fold (build2 (code, inner_type, ar, bi));
      ri = fold (build1 (NEGATE_EXPR, inner_type, ri));
    }
  else if (ar0 && bi0)
    {
      rr = zero;
      ri = fold (build2 (code, inner_type, ai, br));
    }
  else if (ar0 && br0)
    {
      rr = fold (build2 (code, inner_type, ai, bi));
      ri = zero;
    }
  else if (bi0)
    {
      rr = fold (build2 (code, inner_type, ar, br));
      ri = fold (build2 (code, inner_type, ai, br));
    }
  else if (br0)
    {
      rr = fold (build2 (code, inner_type, ai, bi));
      ri = fold (build2 (code, inner_type, ar, bi));
      ri = fold (build1 (NEGATE_EXPR, inner_type, ri));
    }
  else
    return NULL;

  return fold (build2 (COMPLEX_EXPR, type, rr, ri));
}

static tree
fold_complex_div (tree type, tree ac, tree bc, enum tree_code code)
{
  tree ar, ai, br, bi;

  if (TREE_CODE (ac) == COMPLEX_EXPR)
    ar = TREE_OPERAND (ac, 0), ai = TREE_OPERAND (ac, 1);
  else if (TREE_CODE (ac) == COMPLEX_CST)
    ar = TREE_REALPART (ac), ai = TREE_IMAGPART (ac);
  else
    return NULL;

  if (TREE_CODE (bc) == COMPLEX_EXPR)
    br = TREE_OPERAND (bc, 0), bi = TREE_OPERAND (bc, 1);
  else if (TREE_CODE (bc) == COMPLEX_CST)
    br = TREE_REALPART (bc), bi = TREE_IMAGPART (bc);
  else
    return NULL;

  return fold_complex_div_parts (type, ar, ai, br, bi, code);
}

/* Perform constant folding and related simplification of EXPR.
   The related simplifications include x*1 => x, x*0 => 0, etc.,
   and application of the associative law.
   NOP_EXPR conversions may be removed freely (as long as we
   are careful not to change the type of the overall expression).
   We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
   but we can constant-fold them if they have constant operands.  */

#ifdef ENABLE_FOLD_CHECKING
# define fold(x) fold_1 (x)
static tree fold_1 (tree);
static
#endif
tree
fold (tree expr)
{
  const tree t = expr;
  const tree type = TREE_TYPE (expr);
  tree t1 = NULL_TREE;
  tree tem;
  tree arg0 = NULL_TREE, arg1 = NULL_TREE;
  enum tree_code code = TREE_CODE (t);
  enum tree_code_class kind = TREE_CODE_CLASS (code);

  /* WINS will be nonzero when the switch is done
     if all operands are constant.  */
  int wins = 1;

  /* Return right away if a constant.  */
  if (kind == tcc_constant)
    return t;

  if (code == NOP_EXPR || code == FLOAT_EXPR || code == CONVERT_EXPR)
    {
      tree subop;

      /* Special case for conversion ops that can have fixed point args.  */
      arg0 = TREE_OPERAND (t, 0);

      /* Don't use STRIP_NOPS, because signedness of argument type matters.  */
      if (arg0 != 0)
  STRIP_SIGN_NOPS (arg0);

      if (arg0 != 0 && TREE_CODE (arg0) == COMPLEX_CST)
  subop = TREE_REALPART (arg0);
      else
  subop = arg0;

      if (subop != 0 && TREE_CODE (subop) != INTEGER_CST
    && TREE_CODE (subop) != REAL_CST)
  /* Note that TREE_CONSTANT isn't enough:
     static var addresses are constant but we can't
     do arithmetic on them.  */
  wins = 0;
    }
  else if (IS_EXPR_CODE_CLASS (kind))
    {
      int len = TREE_CODE_LENGTH (code);
      int i;
      for (i = 0; i < len; i++)
  {
    tree op = TREE_OPERAND (t, i);
    tree subop;

    if (op == 0)
      continue;   /* Valid for CALL_EXPR, at least.  */

    /* Strip any conversions that don't change the mode.  This is
       safe for every expression, except for a comparison expression
       because its signedness is derived from its operands.  So, in
       the latter case, only strip conversions that don't change the
       signedness.

       Note that this is done as an internal manipulation within the
       constant folder, in order to find the simplest representation
       of the arguments so that their form can be studied.  In any
       cases, the appropriate type conversions should be put back in
       the tree that will get out of the constant folder.  */
    if (kind == tcc_comparison)
      STRIP_SIGN_NOPS (op);
    else
      STRIP_NOPS (op);

    if (TREE_CODE (op) == COMPLEX_CST)
      subop = TREE_REALPART (op);
    else
      subop = op;

    if (TREE_CODE (subop) != INTEGER_CST
        && TREE_CODE (subop) != REAL_CST)
      /* Note that TREE_CONSTANT isn't enough:
         static var addresses are constant but we can't
         do arithmetic on them.  */
      wins = 0;

    if (i == 0)
      arg0 = op;
    else if (i == 1)
      arg1 = op;
  }
    }

  /* If this is a commutative operation, and ARG0 is a constant, move it
     to ARG1 to reduce the number of tests below.  */
  if (commutative_tree_code (code)
      && tree_swap_operands_p (arg0, arg1, true))
    return fold (build2 (code, type, TREE_OPERAND (t, 1),
       TREE_OPERAND (t, 0)));

  /* Now WINS is set as described above,
     ARG0 is the first operand of EXPR,
     and ARG1 is the second operand (if it has more than one operand).

     First check for cases where an arithmetic operation is applied to a
     compound, conditional, or comparison operation.  Push the arithmetic
     operation inside the compound or conditional to see if any folding
     can then be done.  Convert comparison to conditional for this purpose.
     The also optimizes non-constant cases that used to be done in
     expand_expr.

     Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
     one of the operands is a comparison and the other is a comparison, a
     BIT_AND_EXPR with the constant 1, or a truth value.  In that case, the
     code below would make the expression more complex.  Change it to a
     TRUTH_{AND,OR}_EXPR.  Likewise, convert a similar NE_EXPR to
     TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR.  */

  if ((code == BIT_AND_EXPR || code == BIT_IOR_EXPR
       || code == EQ_EXPR || code == NE_EXPR)
      && ((truth_value_p (TREE_CODE (arg0))
     && (truth_value_p (TREE_CODE (arg1))
         || (TREE_CODE (arg1) == BIT_AND_EXPR
       && integer_onep (TREE_OPERAND (arg1, 1)))))
    || (truth_value_p (TREE_CODE (arg1))
        && (truth_value_p (TREE_CODE (arg0))
      || (TREE_CODE (arg0) == BIT_AND_EXPR
          && integer_onep (TREE_OPERAND (arg0, 1)))))))
    {
      tem = fold (build2 (code == BIT_AND_EXPR ? TRUTH_AND_EXPR
        : code == BIT_IOR_EXPR ? TRUTH_OR_EXPR
        : TRUTH_XOR_EXPR,
        boolean_type_node,
        fold_convert (boolean_type_node, arg0),
        fold_convert (boolean_type_node, arg1)));

      if (code == EQ_EXPR)
  tem = invert_truthvalue (tem);

      return fold_convert (type, tem);
    }

  if (TREE_CODE_CLASS (code) == tcc_unary)
    {
      if (TREE_CODE (arg0) == COMPOUND_EXPR)
  return build2 (COMPOUND_EXPR, type, TREE_OPERAND (arg0, 0),
           fold (build1 (code, type, TREE_OPERAND (arg0, 1))));
      else if (TREE_CODE (arg0) == COND_EXPR)
  {
    tree arg01 = TREE_OPERAND (arg0, 1);
    tree arg02 = TREE_OPERAND (arg0, 2);
    if (! VOID_TYPE_P (TREE_TYPE (arg01)))
      arg01 = fold (build1 (code, type, arg01));
    if (! VOID_TYPE_P (TREE_TYPE (arg02)))
      arg02 = fold (build1 (code, type, arg02));
    tem = fold (build3 (COND_EXPR, type, TREE_OPERAND (arg0, 0),
            arg01, arg02));

    /* If this was a conversion, and all we did was to move into
       inside the COND_EXPR, bring it back out.  But leave it if
       it is a conversion from integer to integer and the
       result precision is no wider than a word since such a
       conversion is cheap and may be optimized away by combine,
       while it couldn't if it were outside the COND_EXPR.  Then return
       so we don't get into an infinite recursion loop taking the
       conversion out and then back in.  */

    if ((code == NOP_EXPR || code == CONVERT_EXPR
         || code == NON_LVALUE_EXPR)
        && TREE_CODE (tem) == COND_EXPR
        && TREE_CODE (TREE_OPERAND (tem, 1)) == code
        && TREE_CODE (TREE_OPERAND (tem, 2)) == code
        && ! VOID_TYPE_P (TREE_OPERAND (tem, 1))
        && ! VOID_TYPE_P (TREE_OPERAND (tem, 2))
        && (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem, 1), 0))
      == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem, 2), 0)))
        && (! (INTEGRAL_TYPE_P (TREE_TYPE (tem))
         && (INTEGRAL_TYPE_P
       (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem, 1), 0))))
         && TYPE_PRECISION (TREE_TYPE (tem)) <= BITS_PER_WORD)
      || flag_syntax_only))
      tem = build1 (code, type,
        build3 (COND_EXPR,
          TREE_TYPE (TREE_OPERAND
               (TREE_OPERAND (tem, 1), 0)),
          TREE_OPERAND (tem, 0),
          TREE_OPERAND (TREE_OPERAND (tem, 1), 0),
          TREE_OPERAND (TREE_OPERAND (tem, 2), 0)));
    return tem;
  }
      else if (COMPARISON_CLASS_P (arg0))
  {
    if (TREE_CODE (type) == BOOLEAN_TYPE)
      {
        arg0 = copy_node (arg0);
        TREE_TYPE (arg0) = type;
        return arg0;
      }
    else if (TREE_CODE (type) != INTEGER_TYPE)
      return fold (build3 (COND_EXPR, type, arg0,
         fold (build1 (code, type,
                 integer_one_node)),
         fold (build1 (code, type,
                 integer_zero_node))));
  }
   }
  else if (TREE_CODE_CLASS (code) == tcc_comparison
     && TREE_CODE (arg0) == COMPOUND_EXPR)
    return build2 (COMPOUND_EXPR, type, TREE_OPERAND (arg0, 0),
       fold (build2 (code, type, TREE_OPERAND (arg0, 1), arg1)));
  else if (TREE_CODE_CLASS (code) == tcc_comparison
     && TREE_CODE (arg1) == COMPOUND_EXPR)
    return build2 (COMPOUND_EXPR, type, TREE_OPERAND (arg1, 0),
       fold (build2 (code, type, arg0, TREE_OPERAND (arg1, 1))));
  else if (TREE_CODE_CLASS (code) == tcc_binary
     || TREE_CODE_CLASS (code) == tcc_comparison)
    {
      if (TREE_CODE (arg0) == COMPOUND_EXPR)
  return build2 (COMPOUND_EXPR, type, TREE_OPERAND (arg0, 0),
           fold (build2 (code, type, TREE_OPERAND (arg0, 1),
             arg1)));
      if (TREE_CODE (arg1) == COMPOUND_EXPR
    && reorder_operands_p (arg0, TREE_OPERAND (arg1, 0)))
  return build2 (COMPOUND_EXPR, type, TREE_OPERAND (arg1, 0),
           fold (build2 (code, type,
             arg0, TREE_OPERAND (arg1, 1))));

      if (TREE_CODE (arg0) == COND_EXPR || COMPARISON_CLASS_P (arg0))
  {
    tem = fold_binary_op_with_conditional_arg (t, code, arg0, arg1, 
                 /*cond_first_p=*/1);
    if (tem != NULL_TREE)
      return tem;
  }

      if (TREE_CODE (arg1) == COND_EXPR || COMPARISON_CLASS_P (arg1))
  {
    tem = fold_binary_op_with_conditional_arg (t, code, arg1, arg0, 
                       /*cond_first_p=*/0);
    if (tem != NULL_TREE)
      return tem;
  }
    }

  switch (code)
    {
    case CONST_DECL:
      return fold (DECL_INITIAL (t));

    case NOP_EXPR:
    case FLOAT_EXPR:
    case CONVERT_EXPR:
    case FIX_TRUNC_EXPR:
    case FIX_CEIL_EXPR:
    case FIX_FLOOR_EXPR:
    case FIX_ROUND_EXPR:
      if (TREE_TYPE (TREE_OPERAND (t, 0)) == type)
  return TREE_OPERAND (t, 0);

      /* Handle cases of two conversions in a row.  */
      if (TREE_CODE (TREE_OPERAND (t, 0)) == NOP_EXPR
    || TREE_CODE (TREE_OPERAND (t, 0)) == CONVERT_EXPR)
  {
    tree inside_type = TREE_TYPE (TREE_OPERAND (TREE_OPERAND (t, 0), 0));
    tree inter_type = TREE_TYPE (TREE_OPERAND (t, 0));
    int inside_int = INTEGRAL_TYPE_P (inside_type);
    int inside_ptr = POINTER_TYPE_P (inside_type);
    int inside_float = FLOAT_TYPE_P (inside_type);
    int inside_vec = TREE_CODE (inside_type) == VECTOR_TYPE;
    unsigned int inside_prec = TYPE_PRECISION (inside_type);
    int inside_unsignedp = TYPE_UNSIGNED (inside_type);
    int inter_int = INTEGRAL_TYPE_P (inter_type);
    int inter_ptr = POINTER_TYPE_P (inter_type);
    int inter_float = FLOAT_TYPE_P (inter_type);
    int inter_vec = TREE_CODE (inter_type) == VECTOR_TYPE;
    unsigned int inter_prec = TYPE_PRECISION (inter_type);
    int inter_unsignedp = TYPE_UNSIGNED (inter_type);
    int final_int = INTEGRAL_TYPE_P (type);
    int final_ptr = POINTER_TYPE_P (type);
    int final_float = FLOAT_TYPE_P (type);
    int final_vec = TREE_CODE (type) == VECTOR_TYPE;
    unsigned int final_prec = TYPE_PRECISION (type);
    int final_unsignedp = TYPE_UNSIGNED (type);

    /* In addition to the cases of two conversions in a row
       handled below, if we are converting something to its own
       type via an object of identical or wider precision, neither
       conversion is needed.  */
    if (TYPE_MAIN_VARIANT (inside_type) == TYPE_MAIN_VARIANT (type)
        && ((inter_int && final_int) || (inter_float && final_float))
        && inter_prec >= final_prec)
      return fold (build1 (code, type,
         TREE_OPERAND (TREE_OPERAND (t, 0), 0)));

    /* Likewise, if the intermediate and final types are either both
       float or both integer, we don't need the middle conversion if
       it is wider than the final type and doesn't change the signedness
       (for integers).  Avoid this if the final type is a pointer
       since then we sometimes need the inner conversion.  Likewise if
       the outer has a precision not equal to the size of its mode.  */
    if ((((inter_int || inter_ptr) && (inside_int || inside_ptr))
         || (inter_float && inside_float)
         || (inter_vec && inside_vec))
        && inter_prec >= inside_prec
        && (inter_float || inter_vec
      || inter_unsignedp == inside_unsignedp)
        && ! (final_prec != GET_MODE_BITSIZE (TYPE_MODE (type))
        && TYPE_MODE (type) == TYPE_MODE (inter_type))
        && ! final_ptr
        && (! final_vec || inter_prec == inside_prec))
      return fold (build1 (code, type,
         TREE_OPERAND (TREE_OPERAND (t, 0), 0)));

    /* If we have a sign-extension of a zero-extended value, we can
       replace that by a single zero-extension.  */
    if (inside_int && inter_int && final_int
        && inside_prec < inter_prec && inter_prec < final_prec
        && inside_unsignedp && !inter_unsignedp)
      return fold (build1 (code, type,
         TREE_OPERAND (TREE_OPERAND (t, 0), 0)));

    /* Two conversions in a row are not needed unless:
       - some conversion is floating-point (overstrict for now), or
       - some conversion is a vector (overstrict for now), or
       - the intermediate type is narrower than both initial and
         final, or
       - the intermediate type and innermost type differ in signedness,
         and the outermost type is wider than the intermediate, or
       - the initial type is a pointer type and the precisions of the
         intermediate and final types differ, or
       - the final type is a pointer type and the precisions of the
         initial and intermediate types differ.  */
    if (! inside_float && ! inter_float && ! final_float
        && ! inside_vec && ! inter_vec && ! final_vec
        && (inter_prec > inside_prec || inter_prec > final_prec)
        && ! (inside_int && inter_int
        && inter_unsignedp != inside_unsignedp
        && inter_prec < final_prec)
        && ((inter_unsignedp && inter_prec > inside_prec)
      == (final_unsignedp && final_prec > inter_prec))
        && ! (inside_ptr && inter_prec != final_prec)
        && ! (final_ptr && inside_prec != inter_prec)
        && ! (final_prec != GET_MODE_BITSIZE (TYPE_MODE (type))
        && TYPE_MODE (type) == TYPE_MODE (inter_type))
        && ! final_ptr)
      return fold (build1 (code, type,
         TREE_OPERAND (TREE_OPERAND (t, 0), 0)));
  }

      if (TREE_CODE (TREE_OPERAND (t, 0)) == MODIFY_EXPR
    && TREE_CONSTANT (TREE_OPERAND (TREE_OPERAND (t, 0), 1))
    /* Detect assigning a bitfield.  */
    && !(TREE_CODE (TREE_OPERAND (TREE_OPERAND (t, 0), 0)) == COMPONENT_REF
         && DECL_BIT_FIELD (TREE_OPERAND (TREE_OPERAND (TREE_OPERAND (t, 0), 0), 1))))
  {
    /* Don't leave an assignment inside a conversion
       unless assigning a bitfield.  */
    tree prev = TREE_OPERAND (t, 0);
    tem = copy_node (t);
    TREE_OPERAND (tem, 0) = TREE_OPERAND (prev, 1);
    /* First do the assignment, then return converted constant.  */
    tem = build2 (COMPOUND_EXPR, TREE_TYPE (tem), prev, fold (tem));
    TREE_NO_WARNING (tem) = 1;
    TREE_USED (tem) = 1;
    return tem;
  }

      /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
   constants (if x has signed type, the sign bit cannot be set
   in c).  This folds extension into the BIT_AND_EXPR.  */
      if (INTEGRAL_TYPE_P (type)
    && TREE_CODE (type) != BOOLEAN_TYPE
    && TREE_CODE (TREE_OPERAND (t, 0)) == BIT_AND_EXPR
    && TREE_CODE (TREE_OPERAND (TREE_OPERAND (t, 0), 1)) == INTEGER_CST)
  {
    tree and = TREE_OPERAND (t, 0);
    tree and0 = TREE_OPERAND (and, 0), and1 = TREE_OPERAND (and, 1);
    int change = 0;

    if (TYPE_UNSIGNED (TREE_TYPE (and))
        || (TYPE_PRECISION (type)
      <= TYPE_PRECISION (TREE_TYPE (and))))
      change = 1;
    else if (TYPE_PRECISION (TREE_TYPE (and1))
       <= HOST_BITS_PER_WIDE_INT
       && host_integerp (and1, 1))
      {
        unsigned HOST_WIDE_INT cst;

        cst = tree_low_cst (and1, 1);
        cst &= (HOST_WIDE_INT) -1
         << (TYPE_PRECISION (TREE_TYPE (and1)) - 1);
        change = (cst == 0);
#ifdef LOAD_EXTEND_OP
        if (change
      && !flag_syntax_only
      && (LOAD_EXTEND_OP (TYPE_MODE (TREE_TYPE (and0)))
          == ZERO_EXTEND))
    {
      tree uns = lang_hooks.types.unsigned_type (TREE_TYPE (and0));
      and0 = fold_convert (uns, and0);
      and1 = fold_convert (uns, and1);
    }
#endif
      }
    if (change)
      {
        tem = build_int_cst_wide (type, TREE_INT_CST_LOW (and1),
          TREE_INT_CST_HIGH (and1));
        tem = force_fit_type (tem, 0, TREE_OVERFLOW (and1),
            TREE_CONSTANT_OVERFLOW (and1));
        return fold (build2 (BIT_AND_EXPR, type,
           fold_convert (type, and0), tem));
      }
  }

      /* Convert (T1)((T2)X op Y) into (T1)X op Y, for pointer types T1 and
   T2 being pointers to types of the same size.  */
      if (POINTER_TYPE_P (TREE_TYPE (t))
    && BINARY_CLASS_P (arg0)
    && TREE_CODE (TREE_OPERAND (arg0, 0)) == NOP_EXPR
    && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (arg0, 0))))
  {
    tree arg00 = TREE_OPERAND (arg0, 0);
    tree t0 = TREE_TYPE (t);
    tree t1 = TREE_TYPE (arg00);
    tree tt0 = TREE_TYPE (t0);
    tree tt1 = TREE_TYPE (t1);
    tree s0 = TYPE_SIZE (tt0);
    tree s1 = TYPE_SIZE (tt1);

    if (s0 && s1 && operand_equal_p (s0, s1, OEP_ONLY_CONST))
      return build2 (TREE_CODE (arg0), t0, fold_convert (t0, arg00),
         TREE_OPERAND (arg0, 1));
  }

      tem = fold_convert_const (code, type, arg0);
      return tem ? tem : t;

    case VIEW_CONVERT_EXPR:
      if (TREE_CODE (TREE_OPERAND (t, 0)) == VIEW_CONVERT_EXPR)
  return build1 (VIEW_CONVERT_EXPR, type,
           TREE_OPERAND (TREE_OPERAND (t, 0), 0));
      return t;

    case COMPONENT_REF:
      if (TREE_CODE (arg0) == CONSTRUCTOR
    && ! type_contains_placeholder_p (TREE_TYPE (arg0)))
  {
    tree m = purpose_member (arg1, CONSTRUCTOR_ELTS (arg0));
    if (m)
      return TREE_VALUE (m);
  }
      return t;

    case RANGE_EXPR:
      if (TREE_CONSTANT (t) != wins)
  {
    tem = copy_node (t);
    TREE_CONSTANT (tem) = wins;
    TREE_INVARIANT (tem) = wins;
    return tem;
  }
      return t;

    case NEGATE_EXPR:
      if (negate_expr_p (arg0))
  return fold_convert (type, negate_expr (arg0));
      /* Convert - (~A) to A + 1.  */
      if (INTEGRAL_TYPE_P (type) && TREE_CODE (arg0) == BIT_NOT_EXPR)
  return fold (build2 (PLUS_EXPR, type, TREE_OPERAND (arg0, 0),
           build_int_cst (type, 1)));
      return t;

    case ABS_EXPR:
      if (TREE_CODE (arg0) == INTEGER_CST || TREE_CODE (arg0) == REAL_CST)
  return fold_abs_const (arg0, type);
      else if (TREE_CODE (arg0) == NEGATE_EXPR)
  return fold (build1 (ABS_EXPR, type, TREE_OPERAND (arg0, 0)));
      /* Convert fabs((double)float) into (double)fabsf(float).  */
      else if (TREE_CODE (arg0) == NOP_EXPR
         && TREE_CODE (type) == REAL_TYPE)
  {
    tree targ0 = strip_float_extensions (arg0);
    if (targ0 != arg0)
      return fold_convert (type, fold (build1 (ABS_EXPR,
                 TREE_TYPE (targ0),
                 targ0)));
  }
      else if (tree_expr_nonnegative_p (arg0))
  return arg0;

      /* Strip sign ops from argument.  */
      if (TREE_CODE (type) == REAL_TYPE)
  {
    tem = fold_strip_sign_ops (arg0);
    if (tem)
      return fold (build1 (ABS_EXPR, type, fold_convert (type, tem)));
  }
      return t;

    case CONJ_EXPR:
      if (TREE_CODE (TREE_TYPE (arg0)) != COMPLEX_TYPE)
  return fold_convert (type, arg0);
      else if (TREE_CODE (arg0) == COMPLEX_EXPR)
  return build2 (COMPLEX_EXPR, type,
           TREE_OPERAND (arg0, 0),
           negate_expr (TREE_OPERAND (arg0, 1)));
      else if (TREE_CODE (arg0) == COMPLEX_CST)
  return build_complex (type, TREE_REALPART (arg0),
            negate_expr (TREE_IMAGPART (arg0)));
      else if (TREE_CODE (arg0) == PLUS_EXPR || TREE_CODE (arg0) == MINUS_EXPR)
  return fold (build2 (TREE_CODE (arg0), type,
           fold (build1 (CONJ_EXPR, type,
             TREE_OPERAND (arg0, 0))),
           fold (build1 (CONJ_EXPR, type,
             TREE_OPERAND (arg0, 1)))));
      else if (TREE_CODE (arg0) == CONJ_EXPR)
  return TREE_OPERAND (arg0, 0);
      return t;

    case BIT_NOT_EXPR:
      if (TREE_CODE (arg0) == INTEGER_CST)
        return fold_not_const (arg0, type);
      else if (TREE_CODE (arg0) == BIT_NOT_EXPR)
  return TREE_OPERAND (arg0, 0);
      /* Convert ~ (-A) to A - 1.  */
      else if (INTEGRAL_TYPE_P (type) && TREE_CODE (arg0) == NEGATE_EXPR)
  return fold (build2 (MINUS_EXPR, type, TREE_OPERAND (arg0, 0),
           build_int_cst (type, 1)));
      /* Convert ~ (A - 1) or ~ (A + -1) to -A.  */
      else if (INTEGRAL_TYPE_P (type)
         && ((TREE_CODE (arg0) == MINUS_EXPR
        && integer_onep (TREE_OPERAND (arg0, 1)))
       || (TREE_CODE (arg0) == PLUS_EXPR
           && integer_all_onesp (TREE_OPERAND (arg0, 1)))))
  return fold (build1 (NEGATE_EXPR, type, TREE_OPERAND (arg0, 0)));
      return t;

    case PLUS_EXPR:
      /* A + (-B) -> A - B */
      if (TREE_CODE (arg1) == NEGATE_EXPR)
  return fold (build2 (MINUS_EXPR, type, arg0, TREE_OPERAND (arg1, 0)));
      /* (-A) + B -> B - A */
      if (TREE_CODE (arg0) == NEGATE_EXPR
    && reorder_operands_p (TREE_OPERAND (arg0, 0), arg1))
  return fold (build2 (MINUS_EXPR, type, arg1, TREE_OPERAND (arg0, 0)));

      if (TREE_CODE (type) == COMPLEX_TYPE)
  {
    tem = fold_complex_add (type, arg0, arg1, PLUS_EXPR);
    if (tem)
      return tem;
  }

      if (! FLOAT_TYPE_P (type))
  {
    if (integer_zerop (arg1))
      return non_lvalue (fold_convert (type, arg0));

    /* If we are adding two BIT_AND_EXPR's, both of which are and'ing
       with a constant, and the two constants have no bits in common,
       we should treat this as a BIT_IOR_EXPR since this may produce more
       simplifications.  */
    if (TREE_CODE (arg0) == BIT_AND_EXPR
        && TREE_CODE (arg1) == BIT_AND_EXPR
        && TREE_CODE (TREE_OPERAND (arg0, 1)) == INTEGER_CST
        && TREE_CODE (TREE_OPERAND (arg1, 1)) == INTEGER_CST
        && integer_zerop (const_binop (BIT_AND_EXPR,
               TREE_OPERAND (arg0, 1),
               TREE_OPERAND (arg1, 1), 0)))
      {
        code = BIT_IOR_EXPR;
        goto bit_ior;
      }

    /* Reassociate (plus (plus (mult) (foo)) (mult)) as
       (plus (plus (mult) (mult)) (foo)) so that we can
       take advantage of the factoring cases below.  */
    if (((TREE_CODE (arg0) == PLUS_EXPR
    || TREE_CODE (arg0) == MINUS_EXPR)
         && TREE_CODE (arg1) == MULT_EXPR)
        || ((TREE_CODE (arg1) == PLUS_EXPR
       || TREE_CODE (arg1) == MINUS_EXPR)
      && TREE_CODE (arg0) == MULT_EXPR))
      {
        tree parg0, parg1, parg, marg;
        enum tree_code pcode;

        if (TREE_CODE (arg1) == MULT_EXPR)
    parg = arg0, marg = arg1;
        else
    parg = arg1, marg = arg0;
        pcode = TREE_CODE (parg);
        parg0 = TREE_OPERAND (parg, 0);
        parg1 = TREE_OPERAND (parg, 1);
        STRIP_NOPS (parg0);
        STRIP_NOPS (parg1);

        if (TREE_CODE (parg0) == MULT_EXPR
      && TREE_CODE (parg1) != MULT_EXPR)
    return fold (build2 (pcode, type,
             fold (build2 (PLUS_EXPR, type,
               fold_convert (type, parg0),
               fold_convert (type, marg))),
             fold_convert (type, parg1)));
        if (TREE_CODE (parg0) != MULT_EXPR
      && TREE_CODE (parg1) == MULT_EXPR)
    return fold (build2 (PLUS_EXPR, type,
             fold_convert (type, parg0),
             fold (build2 (pcode, type,
               fold_convert (type, marg),
               fold_convert (type,
                 parg1)))));
      }

    if (TREE_CODE (arg0) == MULT_EXPR && TREE_CODE (arg1) == MULT_EXPR)
      {
        tree arg00, arg01, arg10, arg11;
        tree alt0 = NULL_TREE, alt1 = NULL_TREE, same;

        /* (A * C) + (B * C) -> (A+B) * C.
     We are most concerned about the case where C is a constant,
     but other combinations show up during loop reduction.  Since
     it is not difficult, try all four possibilities.  */

        arg00 = TREE_OPERAND (arg0, 0);
        arg01 = TREE_OPERAND (arg0, 1);
        arg10 = TREE_OPERAND (arg1, 0);
        arg11 = TREE_OPERAND (arg1, 1);
        same = NULL_TREE;

        if (operand_equal_p (arg01, arg11, 0))
    same = arg01, alt0 = arg00, alt1 = arg10;
        else if (operand_equal_p (arg00, arg10, 0))
    same = arg00, alt0 = arg01, alt1 = arg11;
        else if (operand_equal_p (arg00, arg11, 0))
    same = arg00, alt0 = arg01, alt1 = arg10;
        else if (operand_equal_p (arg01, arg10, 0))
    same = arg01, alt0 = arg00, alt1 = arg11;

        /* No identical multiplicands; see if we can find a common
     power-of-two factor in non-power-of-two multiplies.  This
     can help in multi-dimensional array access.  */
        else if (TREE_CODE (arg01) == INTEGER_CST
           && TREE_CODE (arg11) == INTEGER_CST
           && TREE_INT_CST_HIGH (arg01) == 0
           && TREE_INT_CST_HIGH (arg11) == 0)
    {
      HOST_WIDE_INT int01, int11, tmp;
      int01 = TREE_INT_CST_LOW (arg01);
      int11 = TREE_INT_CST_LOW (arg11);

      /* Move min of absolute values to int11.  */
      if ((int01 >= 0 ? int01 : -int01)
          < (int11 >= 0 ? int11 : -int11))
        {
          tmp = int01, int01 = int11, int11 = tmp;
          alt0 = arg00, arg00 = arg10, arg10 = alt0;
          alt0 = arg01, arg01 = arg11, arg11 = alt0;
        }

      if (exact_log2 (int11) > 0 && int01 % int11 == 0)
        {
          alt0 = fold (build2 (MULT_EXPR, type, arg00,
             build_int_cst (NULL_TREE,
                int01 / int11)));
          alt1 = arg10;
          same = arg11;
        }
    }

        if (same)
    return fold (build2 (MULT_EXPR, type,
             fold (build2 (PLUS_EXPR, type,
               fold_convert (type, alt0),
               fold_convert (type, alt1))),
             same));
      }

    /* Try replacing &a[i1] + c * i2 with &a[i1 + i2], if c is step
       of the array.  Loop optimizer sometimes produce this type of
       expressions.  */
    if (TREE_CODE (arg0) == ADDR_EXPR
        && TREE_CODE (arg1) == MULT_EXPR)
      {
        tem = try_move_mult_to_index (PLUS_EXPR, arg0, arg1);
        if (tem)
    return fold_convert (type, fold (tem));
      }
    else if (TREE_CODE (arg1) == ADDR_EXPR
       && TREE_CODE (arg0) == MULT_EXPR)
      {
        tem = try_move_mult_to_index (PLUS_EXPR, arg1, arg0);
        if (tem)
    return fold_convert (type, fold (tem));
      }
  }
      else
  {
    /* See if ARG1 is zero and X + ARG1 reduces to X.  */
    if (fold_real_zero_addition_p (TREE_TYPE (arg0), arg1, 0))
      return non_lvalue (fold_convert (type, arg0));

    /* Likewise if the operands are reversed.  */
    if (fold_real_zero_addition_p (TREE_TYPE (arg1), arg0, 0))
      return non_lvalue (fold_convert (type, arg1));

    /* Convert X + -C into X - C.  */
    if (TREE_CODE (arg1) == REAL_CST
        && REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg1)))
      {
        tem = fold_negate_const (arg1, type);
        if (!TREE_OVERFLOW (arg1) || !flag_trapping_math)
    return fold (build2 (MINUS_EXPR, type,
             fold_convert (type, arg0),
             fold_convert (type, tem)));
      }

    /* Convert x+x into x*2.0.  */
    if (operand_equal_p (arg0, arg1, 0)
        && SCALAR_FLOAT_TYPE_P (type))
      return fold (build2 (MULT_EXPR, type, arg0,
         build_real (type, dconst2)));

    /* Convert x*c+x into x*(c+1).  */
    if (flag_unsafe_math_optimizations
        && TREE_CODE (arg0) == MULT_EXPR
        && TREE_CODE (TREE_OPERAND (arg0, 1)) == REAL_CST
        && ! TREE_CONSTANT_OVERFLOW (TREE_OPERAND (arg0, 1))
        && operand_equal_p (TREE_OPERAND (arg0, 0), arg1, 0))
      {
        REAL_VALUE_TYPE c;

        c = TREE_REAL_CST (TREE_OPERAND (arg0, 1));
        real_arithmetic (&c, PLUS_EXPR, &c, &dconst1);
        return fold (build2 (MULT_EXPR, type, arg1,
           build_real (type, c)));
      }

    /* Convert x+x*c into x*(c+1).  */
    if (flag_unsafe_math_optimizations
        && TREE_CODE (arg1) == MULT_EXPR
        && TREE_CODE (TREE_OPERAND (arg1, 1)) == REAL_CST
        && ! TREE_CONSTANT_OVERFLOW (TREE_OPERAND (arg1, 1))
        && operand_equal_p (TREE_OPERAND (arg1, 0), arg0, 0))
      {
        REAL_VALUE_TYPE c;

        c = TREE_REAL_CST (TREE_OPERAND (arg1, 1));
        real_arithmetic (&c, PLUS_EXPR, &c, &dconst1);
        return fold (build2 (MULT_EXPR, type, arg0,
           build_real (type, c)));
      }

    /* Convert x*c1+x*c2 into x*(c1+c2).  */
    if (flag_unsafe_math_optimizations
        && TREE_CODE (arg0) == MULT_EXPR
        && TREE_CODE (arg1) == MULT_EXPR
        && TREE_CODE (TREE_OPERAND (arg0, 1)) == REAL_CST
        && ! TREE_CONSTANT_OVERFLOW (TREE_OPERAND (arg0, 1))
        && TREE_CODE (TREE_OPERAND (arg1, 1)) == REAL_CST
        && ! TREE_CONSTANT_OVERFLOW (TREE_OPERAND (arg1, 1))
        && operand_equal_p (TREE_OPERAND (arg0, 0),
          TREE_OPERAND (arg1, 0), 0))
      {
        REAL_VALUE_TYPE c1, c2;

        c1 = TREE_REAL_CST (TREE_OPERAND (arg0, 1));
        c2 = TREE_REAL_CST (TREE_OPERAND (arg1, 1));
        real_arithmetic (&c1, PLUS_EXPR, &c1, &c2);
        return fold (build2 (MULT_EXPR, type,
           TREE_OPERAND (arg0, 0),
           build_real (type, c1)));
      }
          /* Convert a + (b*c + d*e) into (a + b*c) + d*e.  */
          if (flag_unsafe_math_optimizations
              && TREE_CODE (arg1) == PLUS_EXPR
              && TREE_CODE (arg0) != MULT_EXPR)
            {
              tree tree10 = TREE_OPERAND (arg1, 0);
              tree tree11 = TREE_OPERAND (arg1, 1);
              if (TREE_CODE (tree11) == MULT_EXPR
      && TREE_CODE (tree10) == MULT_EXPR)
                {
                  tree tree0;
                  tree0 = fold (build2 (PLUS_EXPR, type, arg0, tree10));
                  return fold (build2 (PLUS_EXPR, type, tree0, tree11));
                }
            }
          /* Convert (b*c + d*e) + a into b*c + (d*e +a).  */
          if (flag_unsafe_math_optimizations
              && TREE_CODE (arg0) == PLUS_EXPR
              && TREE_CODE (arg1) != MULT_EXPR)
            {
              tree tree00 = TREE_OPERAND (arg0, 0);
              tree tree01 = TREE_OPERAND (arg0, 1);
              if (TREE_CODE (tree01) == MULT_EXPR
      && TREE_CODE (tree00) == MULT_EXPR)
                {
                  tree tree0;
                  tree0 = fold (build2 (PLUS_EXPR, type, tree01, arg1));
                  return fold (build2 (PLUS_EXPR, type, tree00, tree0));
                }
            }
  }

     bit_rotate:
      /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
   is a rotate of A by C1 bits.  */
      /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
   is a rotate of A by B bits.  */
      {
  enum tree_code code0, code1;
  code0 = TREE_CODE (arg0);
  code1 = TREE_CODE (arg1);
  if (((code0 == RSHIFT_EXPR && code1 == LSHIFT_EXPR)
       || (code1 == RSHIFT_EXPR && code0 == LSHIFT_EXPR))
      && operand_equal_p (TREE_OPERAND (arg0, 0),