[deliverable/binutils-gdb.git] / sim / common / cgen-ops.h

/* Semantics ops support for CGEN-based simulators.
   Copyright (C) 1996, 1997, 1998, 1999 Free Software Foundation, Inc.
   Contributed by Cygnus Solutions.

This file is part of the GNU Simulators.

This program 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.

This program 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 this program; if not, write to the Free Software Foundation, Inc.,
59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

*/

#ifndef CGEN_SEM_OPS_H
#define CGEN_SEM_OPS_H

#if defined (__GNUC__) && ! defined (SEMOPS_DEFINE_INLINE)
#define SEMOPS_DEFINE_INLINE
#define SEMOPS_INLINE extern inline
#else
#define SEMOPS_INLINE
#endif

/* Semantic operations.
   At one point this file was machine generated.  Maybe it will be again.  */

/* TODO: Lazy encoding/decoding of fp values.  */

/* These don't really have a mode.  */
#define ANDIF(x, y) ((x) && (y))
#define ORIF(x, y) ((x) || (y))

#define ANDBI(x, y) ((x) & (y))
#define ORBI(x, y) ((x) | (y))
#define XORBI(x, y) ((x) ^ (y))
#define NEGBI(x) (- (x))
#define NOTBI(x) (! (BI) (x))
#define INVBI(x) (~ (x))
#define EQBI(x, y) ((BI) (x) == (BI) (y))
#define NEBI(x, y) ((BI) (x) != (BI) (y))
#define LTBI(x, y) ((BI) (x) < (BI) (y))
#define LEBI(x, y) ((BI) (x) <= (BI) (y))
#define GTBI(x, y) ((BI) (x) > (BI) (y))
#define GEBI(x, y) ((BI) (x) >= (BI) (y))
#define LTUBI(x, y) ((BI) (x) < (BI) (y))
#define LEUBI(x, y) ((BI) (x) <= (BI) (y))
#define GTUBI(x, y) ((BI) (x) > (BI) (y))
#define GEUBI(x, y) ((BI) (x) >= (BI) (y))
\f
#define ADDQI(x, y) ((x) + (y))
#define SUBQI(x, y) ((x) - (y))
#define MULQI(x, y) ((x) * (y))
#define DIVQI(x, y) ((QI) (x) / (QI) (y))
#define UDIVQI(x, y) ((UQI) (x) / (UQI) (y))
#define MODQI(x, y) ((QI) (x) % (QI) (y))
#define UMODQI(x, y) ((UQI) (x) % (UQI) (y))
#define SRAQI(x, y) ((QI) (x) >> (y))
#define SRLQI(x, y) ((UQI) (x) >> (y))
#define SLLQI(x, y) ((UQI) (x) << (y))
extern QI RORQI (QI, int);
extern QI ROLQI (QI, int);
#define ANDQI(x, y) ((x) & (y))
#define ORQI(x, y) ((x) | (y))
#define XORQI(x, y) ((x) ^ (y))
#define NEGQI(x) (- (x))
#define NOTQI(x) (! (QI) (x))
#define INVQI(x) (~ (x))
#define ABSQI(x) ((x) < 0 ? -(x) : (x))
#define EQQI(x, y) ((QI) (x) == (QI) (y))
#define NEQI(x, y) ((QI) (x) != (QI) (y))
#define LTQI(x, y) ((QI) (x) < (QI) (y))
#define LEQI(x, y) ((QI) (x) <= (QI) (y))
#define GTQI(x, y) ((QI) (x) > (QI) (y))
#define GEQI(x, y) ((QI) (x) >= (QI) (y))
#define LTUQI(x, y) ((UQI) (x) < (UQI) (y))
#define LEUQI(x, y) ((UQI) (x) <= (UQI) (y))
#define GTUQI(x, y) ((UQI) (x) > (UQI) (y))
#define GEUQI(x, y) ((UQI) (x) >= (UQI) (y))
\f
#define ADDHI(x, y) ((x) + (y))
#define SUBHI(x, y) ((x) - (y))
#define MULHI(x, y) ((x) * (y))
#define DIVHI(x, y) ((HI) (x) / (HI) (y))
#define UDIVHI(x, y) ((UHI) (x) / (UHI) (y))
#define MODHI(x, y) ((HI) (x) % (HI) (y))
#define UMODHI(x, y) ((UHI) (x) % (UHI) (y))
#define SRAHI(x, y) ((HI) (x) >> (y))
#define SRLHI(x, y) ((UHI) (x) >> (y))
#define SLLHI(x, y) ((UHI) (x) << (y))
extern HI RORHI (HI, int);
extern HI ROLHI (HI, int);
#define ANDHI(x, y) ((x) & (y))
#define ORHI(x, y) ((x) | (y))
#define XORHI(x, y) ((x) ^ (y))
#define NEGHI(x) (- (x))
#define NOTHI(x) (! (HI) (x))
#define INVHI(x) (~ (x))
#define ABSHI(x) ((x) < 0 ? -(x) : (x))
#define EQHI(x, y) ((HI) (x) == (HI) (y))
#define NEHI(x, y) ((HI) (x) != (HI) (y))
#define LTHI(x, y) ((HI) (x) < (HI) (y))
#define LEHI(x, y) ((HI) (x) <= (HI) (y))
#define GTHI(x, y) ((HI) (x) > (HI) (y))
#define GEHI(x, y) ((HI) (x) >= (HI) (y))
#define LTUHI(x, y) ((UHI) (x) < (UHI) (y))
#define LEUHI(x, y) ((UHI) (x) <= (UHI) (y))
#define GTUHI(x, y) ((UHI) (x) > (UHI) (y))
#define GEUHI(x, y) ((UHI) (x) >= (UHI) (y))
\f
#define ADDSI(x, y) ((x) + (y))
#define SUBSI(x, y) ((x) - (y))
#define MULSI(x, y) ((x) * (y))
#define DIVSI(x, y) ((SI) (x) / (SI) (y))
#define UDIVSI(x, y) ((USI) (x) / (USI) (y))
#define MODSI(x, y) ((SI) (x) % (SI) (y))
#define UMODSI(x, y) ((USI) (x) % (USI) (y))
#define SRASI(x, y) ((SI) (x) >> (y))
#define SRLSI(x, y) ((USI) (x) >> (y))
#define SLLSI(x, y) ((USI) (x) << (y))
extern SI RORSI (SI, int);
extern SI ROLSI (SI, int);
#define ANDSI(x, y) ((x) & (y))
#define ORSI(x, y) ((x) | (y))
#define XORSI(x, y) ((x) ^ (y))
#define NEGSI(x) (- (x))
#define NOTSI(x) (! (SI) (x))
#define INVSI(x) (~ (x))
#define ABSSI(x) ((x) < 0 ? -(x) : (x))
#define EQSI(x, y) ((SI) (x) == (SI) (y))
#define NESI(x, y) ((SI) (x) != (SI) (y))
#define LTSI(x, y) ((SI) (x) < (SI) (y))
#define LESI(x, y) ((SI) (x) <= (SI) (y))
#define GTSI(x, y) ((SI) (x) > (SI) (y))
#define GESI(x, y) ((SI) (x) >= (SI) (y))
#define LTUSI(x, y) ((USI) (x) < (USI) (y))
#define LEUSI(x, y) ((USI) (x) <= (USI) (y))
#define GTUSI(x, y) ((USI) (x) > (USI) (y))
#define GEUSI(x, y) ((USI) (x) >= (USI) (y))
\f
#ifdef DI_FN_SUPPORT
extern DI ADDDI (DI, DI);
extern DI SUBDI (DI, DI);
extern DI MULDI (DI, DI);
extern DI DIVDI (DI, DI);
extern DI UDIVDI (DI, DI);
extern DI MODDI (DI, DI);
extern DI UMODDI (DI, DI);
extern DI SRADI (DI, int);
extern UDI SRLDI (UDI, int);
extern UDI SLLDI (UDI, int);
extern DI RORDI (DI, int);
extern DI ROLDI (DI, int);
extern DI ANDDI (DI, DI);
extern DI ORDI (DI, DI);
extern DI XORDI (DI, DI);
extern DI NEGDI (DI);
extern int NOTDI (DI);
extern DI INVDI (DI);
extern int EQDI (DI, DI);
extern int NEDI (DI, DI);
extern int LTDI (DI, DI);
extern int LEDI (DI, DI);
extern int GTDI (DI, DI);
extern int GEDI (DI, DI);
extern int LTUDI (UDI, UDI);
extern int LEUDI (UDI, UDI);
extern int GTUDI (UDI, UDI);
extern int GEUDI (UDI, UDI);
#else /* ! DI_FN_SUPPORT */
#define ADDDI(x, y) ((x) + (y))
#define SUBDI(x, y) ((x) - (y))
#define MULDI(x, y) ((x) * (y))
#define DIVDI(x, y) ((DI) (x) / (DI) (y))
#define UDIVDI(x, y) ((UDI) (x) / (UDI) (y))
#define MODDI(x, y) ((DI) (x) % (DI) (y))
#define UMODDI(x, y) ((UDI) (x) % (UDI) (y))
#define SRADI(x, y) ((DI) (x) >> (y))
#define SRLDI(x, y) ((UDI) (x) >> (y))
#define SLLDI(x, y) ((UDI) (x) << (y))
extern DI RORDI (DI, int);
extern DI ROLDI (DI, int);
#define ANDDI(x, y) ((x) & (y))
#define ORDI(x, y) ((x) | (y))
#define XORDI(x, y) ((x) ^ (y))
#define NEGDI(x) (- (x))
#define NOTDI(x) (! (DI) (x))
#define INVDI(x) (~ (x))
#define ABSDI(x) ((x) < 0 ? -(x) : (x))
#define EQDI(x, y) ((DI) (x) == (DI) (y))
#define NEDI(x, y) ((DI) (x) != (DI) (y))
#define LTDI(x, y) ((DI) (x) < (DI) (y))
#define LEDI(x, y) ((DI) (x) <= (DI) (y))
#define GTDI(x, y) ((DI) (x) > (DI) (y))
#define GEDI(x, y) ((DI) (x) >= (DI) (y))
#define LTUDI(x, y) ((UDI) (x) < (UDI) (y))
#define LEUDI(x, y) ((UDI) (x) <= (UDI) (y))
#define GTUDI(x, y) ((UDI) (x) > (UDI) (y))
#define GEUDI(x, y) ((UDI) (x) >= (UDI) (y))
#endif /* DI_FN_SUPPORT */
\f
#define EXTBIQI(x) ((QI) (BI) (x))
#define EXTBIHI(x) ((HI) (BI) (x))
#define EXTBISI(x) ((SI) (BI) (x))
#if defined (DI_FN_SUPPORT)
extern DI EXTBIDI (BI);
#else
#define EXTBIDI(x) ((DI) (BI) (x))
#endif
#define EXTQIHI(x) ((HI) (QI) (x))
#define EXTQISI(x) ((SI) (QI) (x))
#if defined (DI_FN_SUPPORT)
extern DI EXTQIDI (QI);
#else
#define EXTQIDI(x) ((DI) (QI) (x))
#endif
#define EXTHISI(x) ((SI) (HI) (x))
#define EXTSISI(x) ((SI) (SI) (x))
#if defined (DI_FN_SUPPORT)
extern DI EXTHIDI (HI);
#else
#define EXTHIDI(x) ((DI) (HI) (x))
#endif
#if defined (DI_FN_SUPPORT)
extern DI EXTSIDI (SI);
#else
#define EXTSIDI(x) ((DI) (SI) (x))
#endif
\f
#define ZEXTBIQI(x) ((QI) (BI) (x))
#define ZEXTBIHI(x) ((HI) (BI) (x))
#define ZEXTBISI(x) ((SI) (BI) (x))
#if defined (DI_FN_SUPPORT)
extern DI ZEXTBIDI (BI);
#else
#define ZEXTBIDI(x) ((DI) (BI) (x))
#endif
#define ZEXTQIHI(x) ((HI) (UQI) (x))
#define ZEXTQISI(x) ((SI) (UQI) (x))
#if defined (DI_FN_SUPPORT)
extern DI ZEXTQIDI (QI);
#else
#define ZEXTQIDI(x) ((DI) (UQI) (x))
#endif
#define ZEXTHISI(x) ((SI) (UHI) (x))
#define ZEXTHIHI(x) ((HI) (UHI) (x))
#define ZEXTSISI(x) ((SI) (USI) (x))
#if defined (DI_FN_SUPPORT)
extern DI ZEXTHIDI (HI);
#else
#define ZEXTHIDI(x) ((DI) (UHI) (x))
#endif
#if defined (DI_FN_SUPPORT)
extern DI ZEXTSIDI (SI);
#else
#define ZEXTSIDI(x) ((DI) (USI) (x))
#endif
\f
#define TRUNCQIBI(x) ((BI) (QI) (x))
#define TRUNCHIBI(x) ((BI) (HI) (x))
#define TRUNCHIQI(x) ((QI) (HI) (x))
#define TRUNCSIBI(x) ((BI) (SI) (x))
#define TRUNCSIQI(x) ((QI) (SI) (x))
#define TRUNCSIHI(x) ((HI) (SI) (x))
#if defined (DI_FN_SUPPORT)
extern BI TRUNCDIBI (DI);
#else
#define TRUNCDIBI(x) ((BI) (DI) (x))
#endif
#if defined (DI_FN_SUPPORT)
extern QI TRUNCDIQI (DI);
#else
#define TRUNCDIQI(x) ((QI) (DI) (x))
#endif
#if defined (DI_FN_SUPPORT)
extern HI TRUNCDIHI (DI);
#else
#define TRUNCDIHI(x) ((HI) (DI) (x))
#endif
#if defined (DI_FN_SUPPORT)
extern SI TRUNCDISI (DI);
#else
#define TRUNCDISI(x) ((SI) (DI) (x))
#endif
\f
/* Composing/decomposing the various types.
   Word ordering is endian-independent.  Words are specified most to least
   significant and word number 0 is the most significant word.
   ??? May also wish an endian-dependent version.  Later.  */

#ifdef SEMOPS_DEFINE_INLINE

SEMOPS_INLINE SF
SUBWORDSISF (SI in)
{
  union { SI in; SF out; } x;
  x.in = in;
  return x.out;
}

SEMOPS_INLINE SI
SUBWORDSFSI (SF in)
{
  union { SF in; SI out; } x;
  x.in = in;
  return x.out;
}

SEMOPS_INLINE SI
SUBWORDDISI (DI in, int word)
{
  if (word == 0)
    return (UDI) in >> 32;
  else
    return in;
}

SEMOPS_INLINE SI
SUBWORDDFSI (DF in, int word)
{
  /* Note: typedef UDI DF; */
  if (word == 0)
    return (UDI) in >> 32;
  else
    return in;
}

SEMOPS_INLINE SI
SUBWORDXFSI (XF in, int word)
{
  /* Note: typedef struct { SI parts[3]; } XF; */
  union { XF in; SI out[3]; } x;
  x.in = in;
  return x.out[word];
}

SEMOPS_INLINE SI
SUBWORDTFSI (TF in, int word)
{
  /* Note: typedef struct { SI parts[4]; } TF; */
  union { TF in; SI out[4]; } x;
  x.in = in;
  return x.out[word];
}

SEMOPS_INLINE DI
JOINSIDI (SI x0, SI x1)
{
  if (CURRENT_TARGET_BYTE_ORDER == BIG_ENDIAN)
    return MAKEDI (x0, x1);
  else
    return MAKEDI (x1, x0);
}

SEMOPS_INLINE DF
JOINSIDF (SI x0, SI x1)
{
  union { SI in[2]; DF out; } x;
  if (CURRENT_TARGET_BYTE_ORDER == BIG_ENDIAN)
    x.in[0] = x0, x.in[1] = x1;
  else
    x.in[1] = x0, x.in[0] = x1;
  return x.out;
}

SEMOPS_INLINE XF
JOINSIXF (SI x0, SI x1, SI x2)
{
  union { SI in[3]; XF out; } x;
  if (CURRENT_TARGET_BYTE_ORDER == BIG_ENDIAN)
    x.in[0] = x0, x.in[1] = x1, x.in[2] = x2;
  else
    x.in[2] = x0, x.in[1] = x1, x.in[0] = x2;
  return x.out;
}

SEMOPS_INLINE TF
JOINSITF (SI x0, SI x1, SI x2, SI x3)
{
  union { SI in[4]; TF out; } x;
  if (CURRENT_TARGET_BYTE_ORDER == BIG_ENDIAN)
    x.in[0] = x0, x.in[1] = x1, x.in[2] = x2, x.in[3] = x3;
  else
    x.in[3] = x0, x.in[2] = x1, x.in[1] = x2, x.in[0] = x3;
  return x.out;
}

#else

SF SUBWORDSISF (SI);
SI SUBWORDSFSI (SF);
SI SUBWORDDISI (DI, int);
SI SUBWORDDFSI (DF, int);
SI SUBWORDXFSI (XF, int);
SI SUBWORDTFSI (TF, int);

DI JOINSIDI (SI, SI);
DF JOINSIDF (SI, SI);
XF JOINSIXF (SI, SI, SI);
TF JOINSITF (SI, SI, SI, SI);

#endif /* SUBWORD,JOIN */
\f
/* Semantic support utilities.  */

#ifdef SEMOPS_DEFINE_INLINE

SEMOPS_INLINE SI
ADDCSI (SI a, SI b, BI c)
{
  SI res = ADDSI (a, ADDSI (b, c));
  return res;
}

SEMOPS_INLINE BI
ADDCFSI (SI a, SI b, BI c)
{
  SI tmp = ADDSI (a, ADDSI (b, c));
  BI res = ((USI) tmp < (USI) a) || (c && tmp == a);
  return res;
}

SEMOPS_INLINE BI
ADDOFSI (SI a, SI b, BI c)
{
  SI tmp = ADDSI (a, ADDSI (b, c));
  BI res = (((a < 0) == (b < 0))
	    && ((a < 0) != (tmp < 0)));
  return res;
}

SEMOPS_INLINE SI
SUBCSI (SI a, SI b, BI c)
{
  SI res = SUBSI (a, ADDSI (b, c));
  return res;
}

SEMOPS_INLINE BI
SUBCFSI (SI a, SI b, BI c)
{
  BI res = ((USI) a < (USI) b) || (c && a == b);
  return res;
}

SEMOPS_INLINE BI
SUBOFSI (SI a, SI b, BI c)
{
  SI tmp = SUBSI (a, ADDSI (b, c));
  BI res = (((a < 0) != (b < 0))
	    && ((a < 0) != (tmp < 0)));
  return res;
}

SEMOPS_INLINE HI
ADDCHI (HI a, HI b, BI c)
{
  HI res = ADDHI (a, ADDHI (b, c));
  return res;
}

SEMOPS_INLINE BI
ADDCFHI (HI a, HI b, BI c)
{
  HI tmp = ADDHI (a, ADDHI (b, c));
  BI res = ((UHI) tmp < (UHI) a) || (c && tmp == a);
  return res;
}

SEMOPS_INLINE BI
ADDOFHI (HI a, HI b, BI c)
{
  HI tmp = ADDHI (a, ADDHI (b, c));
  BI res = (((a < 0) == (b < 0))
	    && ((a < 0) != (tmp < 0)));
  return res;
}

SEMOPS_INLINE HI
SUBCHI (HI a, HI b, BI c)
{
  HI res = SUBHI (a, ADDHI (b, c));
  return res;
}

SEMOPS_INLINE BI
SUBCFHI (HI a, HI b, BI c)
{
  BI res = ((UHI) a < (UHI) b) || (c && a == b);
  return res;
}

SEMOPS_INLINE BI
SUBOFHI (HI a, HI b, BI c)
{
  HI tmp = SUBHI (a, ADDHI (b, c));
  BI res = (((a < 0) != (b < 0))
	    && ((a < 0) != (tmp < 0)));
  return res;
}

#else

SI ADDCSI (SI, SI, BI);
UBI ADDCFSI (SI, SI, BI);
UBI ADDOFSI (SI, SI, BI);
SI SUBCSI (SI, SI, BI);
UBI SUBCFSI (SI, SI, BI);
UBI SUBOFSI (SI, SI, BI);
HI ADDCHI (HI, HI, BI);
UBI ADDCFHI (HI, HI, BI);
UBI ADDOFHI (HI, HI, BI);
HI SUBCHI (HI, HI, BI);
UBI SUBCFHI (HI, HI, BI);
UBI SUBOFHI (HI, HI, BI);

#endif

#endif /* CGEN_SEM_OPS_H */
Commit	Line	Data
c906108c	1	/* Semantics ops support for CGEN-based simulators.
7a292a7a	2	Copyright (C) 1996, 1997, 1998, 1999 Free Software Foundation, Inc.
c906108c SS	3	Contributed by Cygnus Solutions.
	4
	5	This file is part of the GNU Simulators.
	6
	7	This program is free software; you can redistribute it and/or modify
	8	it under the terms of the GNU General Public License as published by
	9	the Free Software Foundation; either version 2, or (at your option)
	10	any later version.
	11
	12	This program is distributed in the hope that it will be useful,
	13	but WITHOUT ANY WARRANTY; without even the implied warranty of
	14	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	15	GNU General Public License for more details.
	16
	17	You should have received a copy of the GNU General Public License along
	18	with this program; if not, write to the Free Software Foundation, Inc.,
	19	59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
	20
	21	*/
	22
	23	#ifndef CGEN_SEM_OPS_H
	24	#define CGEN_SEM_OPS_H
	25
7a292a7a SS	26	#if defined (__GNUC__) && ! defined (SEMOPS_DEFINE_INLINE)
	27	#define SEMOPS_DEFINE_INLINE
	28	#define SEMOPS_INLINE extern inline
	29	#else
	30	#define SEMOPS_INLINE
	31	#endif
	32
c906108c SS	33	/* Semantic operations.
	34	At one point this file was machine generated. Maybe it will be again. */
	35
43ff13b4 JM	36	/* TODO: Lazy encoding/decoding of fp values. */
43ff13b4 JM	37
c906108c SS	38	/* These don't really have a mode. */
	39	#define ANDIF(x, y) ((x) && (y))
	40	#define ORIF(x, y) ((x) \|\| (y))
	41
	42	#define ANDBI(x, y) ((x) & (y))
	43	#define ORBI(x, y) ((x) \| (y))
	44	#define XORBI(x, y) ((x) ^ (y))
	45	#define NEGBI(x) (- (x))
	46	#define NOTBI(x) (! (BI) (x))
	47	#define INVBI(x) (~ (x))
	48	#define EQBI(x, y) ((BI) (x) == (BI) (y))
	49	#define NEBI(x, y) ((BI) (x) != (BI) (y))
	50	#define LTBI(x, y) ((BI) (x) < (BI) (y))
	51	#define LEBI(x, y) ((BI) (x) <= (BI) (y))
	52	#define GTBI(x, y) ((BI) (x) > (BI) (y))
	53	#define GEBI(x, y) ((BI) (x) >= (BI) (y))
	54	#define LTUBI(x, y) ((BI) (x) < (BI) (y))
	55	#define LEUBI(x, y) ((BI) (x) <= (BI) (y))
	56	#define GTUBI(x, y) ((BI) (x) > (BI) (y))
	57	#define GEUBI(x, y) ((BI) (x) >= (BI) (y))
43ff13b4	58	\f
c906108c SS	59	#define ADDQI(x, y) ((x) + (y))
	60	#define SUBQI(x, y) ((x) - (y))
	61	#define MULQI(x, y) ((x) * (y))
	62	#define DIVQI(x, y) ((QI) (x) / (QI) (y))
	63	#define UDIVQI(x, y) ((UQI) (x) / (UQI) (y))
	64	#define MODQI(x, y) ((QI) (x) % (QI) (y))
	65	#define UMODQI(x, y) ((UQI) (x) % (UQI) (y))
	66	#define SRAQI(x, y) ((QI) (x) >> (y))
	67	#define SRLQI(x, y) ((UQI) (x) >> (y))
	68	#define SLLQI(x, y) ((UQI) (x) << (y))
43ff13b4 JM	69	extern QI RORQI (QI, int);
43ff13b4 JM	70	extern QI ROLQI (QI, int);
c906108c SS	71	#define ANDQI(x, y) ((x) & (y))
	72	#define ORQI(x, y) ((x) \| (y))
	73	#define XORQI(x, y) ((x) ^ (y))
	74	#define NEGQI(x) (- (x))
	75	#define NOTQI(x) (! (QI) (x))
	76	#define INVQI(x) (~ (x))
0fda6bd2	77	#define ABSQI(x) ((x) < 0 ? -(x) : (x))
c906108c SS	78	#define EQQI(x, y) ((QI) (x) == (QI) (y))
	79	#define NEQI(x, y) ((QI) (x) != (QI) (y))
	80	#define LTQI(x, y) ((QI) (x) < (QI) (y))
	81	#define LEQI(x, y) ((QI) (x) <= (QI) (y))
	82	#define GTQI(x, y) ((QI) (x) > (QI) (y))
	83	#define GEQI(x, y) ((QI) (x) >= (QI) (y))
	84	#define LTUQI(x, y) ((UQI) (x) < (UQI) (y))
	85	#define LEUQI(x, y) ((UQI) (x) <= (UQI) (y))
	86	#define GTUQI(x, y) ((UQI) (x) > (UQI) (y))
	87	#define GEUQI(x, y) ((UQI) (x) >= (UQI) (y))
43ff13b4	88	\f
c906108c SS	89	#define ADDHI(x, y) ((x) + (y))
	90	#define SUBHI(x, y) ((x) - (y))
	91	#define MULHI(x, y) ((x) * (y))
	92	#define DIVHI(x, y) ((HI) (x) / (HI) (y))
	93	#define UDIVHI(x, y) ((UHI) (x) / (UHI) (y))
	94	#define MODHI(x, y) ((HI) (x) % (HI) (y))
	95	#define UMODHI(x, y) ((UHI) (x) % (UHI) (y))
	96	#define SRAHI(x, y) ((HI) (x) >> (y))
	97	#define SRLHI(x, y) ((UHI) (x) >> (y))
	98	#define SLLHI(x, y) ((UHI) (x) << (y))
43ff13b4 JM	99	extern HI RORHI (HI, int);
43ff13b4 JM	100	extern HI ROLHI (HI, int);
c906108c SS	101	#define ANDHI(x, y) ((x) & (y))
	102	#define ORHI(x, y) ((x) \| (y))
	103	#define XORHI(x, y) ((x) ^ (y))
	104	#define NEGHI(x) (- (x))
	105	#define NOTHI(x) (! (HI) (x))
	106	#define INVHI(x) (~ (x))
0fda6bd2	107	#define ABSHI(x) ((x) < 0 ? -(x) : (x))
c906108c SS	108	#define EQHI(x, y) ((HI) (x) == (HI) (y))
	109	#define NEHI(x, y) ((HI) (x) != (HI) (y))
	110	#define LTHI(x, y) ((HI) (x) < (HI) (y))
	111	#define LEHI(x, y) ((HI) (x) <= (HI) (y))
	112	#define GTHI(x, y) ((HI) (x) > (HI) (y))
	113	#define GEHI(x, y) ((HI) (x) >= (HI) (y))
	114	#define LTUHI(x, y) ((UHI) (x) < (UHI) (y))
	115	#define LEUHI(x, y) ((UHI) (x) <= (UHI) (y))
	116	#define GTUHI(x, y) ((UHI) (x) > (UHI) (y))
	117	#define GEUHI(x, y) ((UHI) (x) >= (UHI) (y))
43ff13b4	118	\f
c906108c SS	119	#define ADDSI(x, y) ((x) + (y))
	120	#define SUBSI(x, y) ((x) - (y))
	121	#define MULSI(x, y) ((x) * (y))
	122	#define DIVSI(x, y) ((SI) (x) / (SI) (y))
	123	#define UDIVSI(x, y) ((USI) (x) / (USI) (y))
	124	#define MODSI(x, y) ((SI) (x) % (SI) (y))
	125	#define UMODSI(x, y) ((USI) (x) % (USI) (y))
	126	#define SRASI(x, y) ((SI) (x) >> (y))
	127	#define SRLSI(x, y) ((USI) (x) >> (y))
	128	#define SLLSI(x, y) ((USI) (x) << (y))
43ff13b4 JM	129	extern SI RORSI (SI, int);
43ff13b4 JM	130	extern SI ROLSI (SI, int);
c906108c SS	131	#define ANDSI(x, y) ((x) & (y))
	132	#define ORSI(x, y) ((x) \| (y))
	133	#define XORSI(x, y) ((x) ^ (y))
	134	#define NEGSI(x) (- (x))
	135	#define NOTSI(x) (! (SI) (x))
	136	#define INVSI(x) (~ (x))
0fda6bd2	137	#define ABSSI(x) ((x) < 0 ? -(x) : (x))
c906108c SS	138	#define EQSI(x, y) ((SI) (x) == (SI) (y))
	139	#define NESI(x, y) ((SI) (x) != (SI) (y))
	140	#define LTSI(x, y) ((SI) (x) < (SI) (y))
	141	#define LESI(x, y) ((SI) (x) <= (SI) (y))
	142	#define GTSI(x, y) ((SI) (x) > (SI) (y))
	143	#define GESI(x, y) ((SI) (x) >= (SI) (y))
	144	#define LTUSI(x, y) ((USI) (x) < (USI) (y))
	145	#define LEUSI(x, y) ((USI) (x) <= (USI) (y))
	146	#define GTUSI(x, y) ((USI) (x) > (USI) (y))
	147	#define GEUSI(x, y) ((USI) (x) >= (USI) (y))
43ff13b4	148	\f
c906108c	149	#ifdef DI_FN_SUPPORT
43ff13b4 JM	150	extern DI ADDDI (DI, DI);
	151	extern DI SUBDI (DI, DI);
	152	extern DI MULDI (DI, DI);
	153	extern DI DIVDI (DI, DI);
	154	extern DI UDIVDI (DI, DI);
	155	extern DI MODDI (DI, DI);
	156	extern DI UMODDI (DI, DI);
	157	extern DI SRADI (DI, int);
	158	extern UDI SRLDI (UDI, int);
	159	extern UDI SLLDI (UDI, int);
	160	extern DI RORDI (DI, int);
	161	extern DI ROLDI (DI, int);
	162	extern DI ANDDI (DI, DI);
	163	extern DI ORDI (DI, DI);
	164	extern DI XORDI (DI, DI);
	165	extern DI NEGDI (DI);
	166	extern int NOTDI (DI);
	167	extern DI INVDI (DI);
	168	extern int EQDI (DI, DI);
	169	extern int NEDI (DI, DI);
	170	extern int LTDI (DI, DI);
	171	extern int LEDI (DI, DI);
	172	extern int GTDI (DI, DI);
	173	extern int GEDI (DI, DI);
	174	extern int LTUDI (UDI, UDI);
	175	extern int LEUDI (UDI, UDI);
	176	extern int GTUDI (UDI, UDI);
	177	extern int GEUDI (UDI, UDI);
c906108c SS	178	#else /* ! DI_FN_SUPPORT */
	179	#define ADDDI(x, y) ((x) + (y))
	180	#define SUBDI(x, y) ((x) - (y))
	181	#define MULDI(x, y) ((x) * (y))
	182	#define DIVDI(x, y) ((DI) (x) / (DI) (y))
	183	#define UDIVDI(x, y) ((UDI) (x) / (UDI) (y))
	184	#define MODDI(x, y) ((DI) (x) % (DI) (y))
	185	#define UMODDI(x, y) ((UDI) (x) % (UDI) (y))
	186	#define SRADI(x, y) ((DI) (x) >> (y))
	187	#define SRLDI(x, y) ((UDI) (x) >> (y))
	188	#define SLLDI(x, y) ((UDI) (x) << (y))
43ff13b4 JM	189	extern DI RORDI (DI, int);
43ff13b4 JM	190	extern DI ROLDI (DI, int);
c906108c SS	191	#define ANDDI(x, y) ((x) & (y))
	192	#define ORDI(x, y) ((x) \| (y))
	193	#define XORDI(x, y) ((x) ^ (y))
	194	#define NEGDI(x) (- (x))
	195	#define NOTDI(x) (! (DI) (x))
	196	#define INVDI(x) (~ (x))
0fda6bd2	197	#define ABSDI(x) ((x) < 0 ? -(x) : (x))
c906108c SS	198	#define EQDI(x, y) ((DI) (x) == (DI) (y))
	199	#define NEDI(x, y) ((DI) (x) != (DI) (y))
	200	#define LTDI(x, y) ((DI) (x) < (DI) (y))
	201	#define LEDI(x, y) ((DI) (x) <= (DI) (y))
	202	#define GTDI(x, y) ((DI) (x) > (DI) (y))
	203	#define GEDI(x, y) ((DI) (x) >= (DI) (y))
	204	#define LTUDI(x, y) ((UDI) (x) < (UDI) (y))
	205	#define LEUDI(x, y) ((UDI) (x) <= (UDI) (y))
	206	#define GTUDI(x, y) ((UDI) (x) > (UDI) (y))
	207	#define GEUDI(x, y) ((UDI) (x) >= (UDI) (y))
	208	#endif /* DI_FN_SUPPORT */
43ff13b4	209	\f
c906108c SS	210	#define EXTBIQI(x) ((QI) (BI) (x))
	211	#define EXTBIHI(x) ((HI) (BI) (x))
	212	#define EXTBISI(x) ((SI) (BI) (x))
	213	#if defined (DI_FN_SUPPORT)
43ff13b4	214	extern DI EXTBIDI (BI);
c906108c SS	215	#else
	216	#define EXTBIDI(x) ((DI) (BI) (x))
	217	#endif
	218	#define EXTQIHI(x) ((HI) (QI) (x))
	219	#define EXTQISI(x) ((SI) (QI) (x))
	220	#if defined (DI_FN_SUPPORT)
43ff13b4	221	extern DI EXTQIDI (QI);
c906108c SS	222	#else
	223	#define EXTQIDI(x) ((DI) (QI) (x))
	224	#endif
	225	#define EXTHISI(x) ((SI) (HI) (x))
0fda6bd2	226	#define EXTSISI(x) ((SI) (SI) (x))
c906108c	227	#if defined (DI_FN_SUPPORT)
43ff13b4	228	extern DI EXTHIDI (HI);
c906108c SS	229	#else
	230	#define EXTHIDI(x) ((DI) (HI) (x))
	231	#endif
	232	#if defined (DI_FN_SUPPORT)
43ff13b4	233	extern DI EXTSIDI (SI);
c906108c SS	234	#else
	235	#define EXTSIDI(x) ((DI) (SI) (x))
	236	#endif
43ff13b4	237	\f
c906108c SS	238	#define ZEXTBIQI(x) ((QI) (BI) (x))
	239	#define ZEXTBIHI(x) ((HI) (BI) (x))
	240	#define ZEXTBISI(x) ((SI) (BI) (x))
	241	#if defined (DI_FN_SUPPORT)
43ff13b4	242	extern DI ZEXTBIDI (BI);
c906108c SS	243	#else
	244	#define ZEXTBIDI(x) ((DI) (BI) (x))
	245	#endif
	246	#define ZEXTQIHI(x) ((HI) (UQI) (x))
	247	#define ZEXTQISI(x) ((SI) (UQI) (x))
	248	#if defined (DI_FN_SUPPORT)
43ff13b4	249	extern DI ZEXTQIDI (QI);
c906108c SS	250	#else
	251	#define ZEXTQIDI(x) ((DI) (UQI) (x))
	252	#endif
	253	#define ZEXTHISI(x) ((SI) (UHI) (x))
0fda6bd2 JM	254	#define ZEXTHIHI(x) ((HI) (UHI) (x))
0fda6bd2 JM	255	#define ZEXTSISI(x) ((SI) (USI) (x))
c906108c	256	#if defined (DI_FN_SUPPORT)
43ff13b4	257	extern DI ZEXTHIDI (HI);
c906108c SS	258	#else
	259	#define ZEXTHIDI(x) ((DI) (UHI) (x))
	260	#endif
	261	#if defined (DI_FN_SUPPORT)
43ff13b4	262	extern DI ZEXTSIDI (SI);
c906108c SS	263	#else
	264	#define ZEXTSIDI(x) ((DI) (USI) (x))
	265	#endif
43ff13b4	266	\f
c906108c SS	267	#define TRUNCQIBI(x) ((BI) (QI) (x))
	268	#define TRUNCHIBI(x) ((BI) (HI) (x))
	269	#define TRUNCHIQI(x) ((QI) (HI) (x))
	270	#define TRUNCSIBI(x) ((BI) (SI) (x))
	271	#define TRUNCSIQI(x) ((QI) (SI) (x))
	272	#define TRUNCSIHI(x) ((HI) (SI) (x))
	273	#if defined (DI_FN_SUPPORT)
43ff13b4	274	extern BI TRUNCDIBI (DI);
c906108c SS	275	#else
	276	#define TRUNCDIBI(x) ((BI) (DI) (x))
	277	#endif
	278	#if defined (DI_FN_SUPPORT)
43ff13b4	279	extern QI TRUNCDIQI (DI);
c906108c SS	280	#else
	281	#define TRUNCDIQI(x) ((QI) (DI) (x))
	282	#endif
	283	#if defined (DI_FN_SUPPORT)
43ff13b4	284	extern HI TRUNCDIHI (DI);
c906108c SS	285	#else
	286	#define TRUNCDIHI(x) ((HI) (DI) (x))
	287	#endif
	288	#if defined (DI_FN_SUPPORT)
43ff13b4	289	extern SI TRUNCDISI (DI);
c906108c SS	290	#else
	291	#define TRUNCDISI(x) ((SI) (DI) (x))
	292	#endif
c906108c	293	\f
6426a772 JM	294	/* Composing/decomposing the various types.
	295	Word ordering is endian-independent. Words are specified most to least
	296	significant and word number 0 is the most significant word.
	297	??? May also wish an endian-dependent version. Later. */
43ff13b4	298
c906108c	299	#ifdef SEMOPS_DEFINE_INLINE
7a292a7a SS	300
7a292a7a SS	301	SEMOPS_INLINE SF
6426a772	302	SUBWORDSISF (SI in)
7a292a7a SS	303	{
	304	union { SI in; SF out; } x;
	305	x.in = in;
	306	return x.out;
	307	}
	308
	309	SEMOPS_INLINE SI
6426a772	310	SUBWORDSFSI (SF in)
7a292a7a SS	311	{
	312	union { SF in; SI out; } x;
	313	x.in = in;
	314	return x.out;
	315	}
	316
	317	SEMOPS_INLINE SI
6426a772	318	SUBWORDDISI (DI in, int word)
7a292a7a	319	{
6426a772 JM	320	if (word == 0)
6426a772 JM	321	return (UDI) in >> 32;
7a292a7a	322	else
6426a772	323	return in;
7a292a7a SS	324	}
	325
	326	SEMOPS_INLINE SI
6426a772	327	SUBWORDDFSI (DF in, int word)
7a292a7a	328	{
6426a772 JM	329	/* Note: typedef UDI DF; */
	330	if (word == 0)
	331	return (UDI) in >> 32;
7a292a7a	332	else
6426a772	333	return in;
7a292a7a SS	334	}
7a292a7a SS	335
43ff13b4	336	SEMOPS_INLINE SI
6426a772	337	SUBWORDXFSI (XF in, int word)
43ff13b4	338	{
6426a772	339	/* Note: typedef struct { SI parts[3]; } XF; */
43ff13b4 JM	340	union { XF in; SI out[3]; } x;
43ff13b4 JM	341	x.in = in;
6426a772	342	return x.out[word];
43ff13b4 JM	343	}
43ff13b4 JM	344
7a292a7a	345	SEMOPS_INLINE SI
6426a772	346	SUBWORDTFSI (TF in, int word)
7a292a7a	347	{
6426a772	348	/* Note: typedef struct { SI parts[4]; } TF; */
7a292a7a SS	349	union { TF in; SI out[4]; } x;
7a292a7a SS	350	x.in = in;
6426a772	351	return x.out[word];
7a292a7a SS	352	}
	353
	354	SEMOPS_INLINE DI
6426a772	355	JOINSIDI (SI x0, SI x1)
7a292a7a SS	356	{
	357	if (CURRENT_TARGET_BYTE_ORDER == BIG_ENDIAN)
	358	return MAKEDI (x0, x1);
	359	else
	360	return MAKEDI (x1, x0);
	361	}
	362
	363	SEMOPS_INLINE DF
6426a772	364	JOINSIDF (SI x0, SI x1)
7a292a7a SS	365	{
	366	union { SI in[2]; DF out; } x;
	367	if (CURRENT_TARGET_BYTE_ORDER == BIG_ENDIAN)
	368	x.in[0] = x0, x.in[1] = x1;
	369	else
	370	x.in[1] = x0, x.in[0] = x1;
	371	return x.out;
	372	}
	373
43ff13b4	374	SEMOPS_INLINE XF
6426a772	375	JOINSIXF (SI x0, SI x1, SI x2)
43ff13b4 JM	376	{
	377	union { SI in[3]; XF out; } x;
	378	if (CURRENT_TARGET_BYTE_ORDER == BIG_ENDIAN)
	379	x.in[0] = x0, x.in[1] = x1, x.in[2] = x2;
	380	else
	381	x.in[2] = x0, x.in[1] = x1, x.in[0] = x2;
	382	return x.out;
	383	}
	384
7a292a7a	385	SEMOPS_INLINE TF
6426a772	386	JOINSITF (SI x0, SI x1, SI x2, SI x3)
7a292a7a SS	387	{
	388	union { SI in[4]; TF out; } x;
	389	if (CURRENT_TARGET_BYTE_ORDER == BIG_ENDIAN)
	390	x.in[0] = x0, x.in[1] = x1, x.in[2] = x2, x.in[3] = x3;
	391	else
	392	x.in[3] = x0, x.in[2] = x1, x.in[1] = x2, x.in[0] = x3;
	393	return x.out;
	394	}
	395
c906108c	396	#else
7a292a7a	397
6426a772 JM	398	SF SUBWORDSISF (SI);
	399	SI SUBWORDSFSI (SF);
	400	SI SUBWORDDISI (DI, int);
	401	SI SUBWORDDFSI (DF, int);
	402	SI SUBWORDXFSI (XF, int);
	403	SI SUBWORDTFSI (TF, int);
7a292a7a	404
6426a772 JM	405	DI JOINSIDI (SI, SI);
	406	DF JOINSIDF (SI, SI);
	407	XF JOINSIXF (SI, SI, SI);
	408	TF JOINSITF (SI, SI, SI, SI);
7a292a7a SS	409
	410	#endif /* SUBWORD,JOIN */
	411	\f
	412	/* Semantic support utilities. */
	413
	414	#ifdef SEMOPS_DEFINE_INLINE
c906108c SS	415
	416	SEMOPS_INLINE SI
	417	ADDCSI (SI a, SI b, BI c)
	418	{
	419	SI res = ADDSI (a, ADDSI (b, c));
	420	return res;
	421	}
	422
	423	SEMOPS_INLINE BI
	424	ADDCFSI (SI a, SI b, BI c)
	425	{
	426	SI tmp = ADDSI (a, ADDSI (b, c));
	427	BI res = ((USI) tmp < (USI) a) \|\| (c && tmp == a);
	428	return res;
	429	}
	430
	431	SEMOPS_INLINE BI
	432	ADDOFSI (SI a, SI b, BI c)
	433	{
	434	SI tmp = ADDSI (a, ADDSI (b, c));
	435	BI res = (((a < 0) == (b < 0))
	436	&& ((a < 0) != (tmp < 0)));
	437	return res;
	438	}
	439
	440	SEMOPS_INLINE SI
	441	SUBCSI (SI a, SI b, BI c)
	442	{
	443	SI res = SUBSI (a, ADDSI (b, c));
	444	return res;
	445	}
	446
	447	SEMOPS_INLINE BI
	448	SUBCFSI (SI a, SI b, BI c)
	449	{
	450	BI res = ((USI) a < (USI) b) \|\| (c && a == b);
	451	return res;
	452	}
	453
	454	SEMOPS_INLINE BI
	455	SUBOFSI (SI a, SI b, BI c)
	456	{
	457	SI tmp = SUBSI (a, ADDSI (b, c));
	458	BI res = (((a < 0) != (b < 0))
	459	&& ((a < 0) != (tmp < 0)));
	460	return res;
	461	}
	462
0fda6bd2 JM	463	SEMOPS_INLINE HI
	464	ADDCHI (HI a, HI b, BI c)
	465	{
	466	HI res = ADDHI (a, ADDHI (b, c));
	467	return res;
	468	}
	469
	470	SEMOPS_INLINE BI
	471	ADDCFHI (HI a, HI b, BI c)
	472	{
	473	HI tmp = ADDHI (a, ADDHI (b, c));
	474	BI res = ((UHI) tmp < (UHI) a) \|\| (c && tmp == a);
	475	return res;
	476	}
	477
	478	SEMOPS_INLINE BI
	479	ADDOFHI (HI a, HI b, BI c)
	480	{
	481	HI tmp = ADDHI (a, ADDHI (b, c));
	482	BI res = (((a < 0) == (b < 0))
	483	&& ((a < 0) != (tmp < 0)));
	484	return res;
	485	}
	486
	487	SEMOPS_INLINE HI
	488	SUBCHI (HI a, HI b, BI c)
	489	{
	490	HI res = SUBHI (a, ADDHI (b, c));
	491	return res;
	492	}
	493
	494	SEMOPS_INLINE BI
	495	SUBCFHI (HI a, HI b, BI c)
	496	{
	497	BI res = ((UHI) a < (UHI) b) \|\| (c && a == b);
	498	return res;
	499	}
	500
	501	SEMOPS_INLINE BI
	502	SUBOFHI (HI a, HI b, BI c)
	503	{
	504	HI tmp = SUBHI (a, ADDHI (b, c));
	505	BI res = (((a < 0) != (b < 0))
	506	&& ((a < 0) != (tmp < 0)));
	507	return res;
	508	}
	509
c906108c SS	510	#else
	511
	512	SI ADDCSI (SI, SI, BI);
	513	UBI ADDCFSI (SI, SI, BI);
	514	UBI ADDOFSI (SI, SI, BI);
	515	SI SUBCSI (SI, SI, BI);
	516	UBI SUBCFSI (SI, SI, BI);
	517	UBI SUBOFSI (SI, SI, BI);
0fda6bd2 JM	518	HI ADDCHI (HI, HI, BI);
	519	UBI ADDCFHI (HI, HI, BI);
	520	UBI ADDOFHI (HI, HI, BI);
	521	HI SUBCHI (HI, HI, BI);
	522	UBI SUBCFHI (HI, HI, BI);
	523	UBI SUBOFHI (HI, HI, BI);
c906108c SS	524
c906108c SS	525	#endif
c906108c SS	526
c906108c SS	527	#endif /* CGEN_SEM_OPS_H */