[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 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 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 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 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))
#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))
#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;
}

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

#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))
	77	#define EQQI(x, y) ((QI) (x) == (QI) (y))
	78	#define NEQI(x, y) ((QI) (x) != (QI) (y))
	79	#define LTQI(x, y) ((QI) (x) < (QI) (y))
	80	#define LEQI(x, y) ((QI) (x) <= (QI) (y))
	81	#define GTQI(x, y) ((QI) (x) > (QI) (y))
	82	#define GEQI(x, y) ((QI) (x) >= (QI) (y))
	83	#define LTUQI(x, y) ((UQI) (x) < (UQI) (y))
	84	#define LEUQI(x, y) ((UQI) (x) <= (UQI) (y))
	85	#define GTUQI(x, y) ((UQI) (x) > (UQI) (y))
	86	#define GEUQI(x, y) ((UQI) (x) >= (UQI) (y))
43ff13b4	87	\f
c906108c SS	88	#define ADDHI(x, y) ((x) + (y))
	89	#define SUBHI(x, y) ((x) - (y))
	90	#define MULHI(x, y) ((x) * (y))
	91	#define DIVHI(x, y) ((HI) (x) / (HI) (y))
	92	#define UDIVHI(x, y) ((UHI) (x) / (UHI) (y))
	93	#define MODHI(x, y) ((HI) (x) % (HI) (y))
	94	#define UMODHI(x, y) ((UHI) (x) % (UHI) (y))
	95	#define SRAHI(x, y) ((HI) (x) >> (y))
	96	#define SRLHI(x, y) ((UHI) (x) >> (y))
	97	#define SLLHI(x, y) ((UHI) (x) << (y))
43ff13b4 JM	98	extern HI RORHI (HI, int);
43ff13b4 JM	99	extern HI ROLHI (HI, int);
c906108c SS	100	#define ANDHI(x, y) ((x) & (y))
	101	#define ORHI(x, y) ((x) \| (y))
	102	#define XORHI(x, y) ((x) ^ (y))
	103	#define NEGHI(x) (- (x))
	104	#define NOTHI(x) (! (HI) (x))
	105	#define INVHI(x) (~ (x))
	106	#define EQHI(x, y) ((HI) (x) == (HI) (y))
	107	#define NEHI(x, y) ((HI) (x) != (HI) (y))
	108	#define LTHI(x, y) ((HI) (x) < (HI) (y))
	109	#define LEHI(x, y) ((HI) (x) <= (HI) (y))
	110	#define GTHI(x, y) ((HI) (x) > (HI) (y))
	111	#define GEHI(x, y) ((HI) (x) >= (HI) (y))
	112	#define LTUHI(x, y) ((UHI) (x) < (UHI) (y))
	113	#define LEUHI(x, y) ((UHI) (x) <= (UHI) (y))
	114	#define GTUHI(x, y) ((UHI) (x) > (UHI) (y))
	115	#define GEUHI(x, y) ((UHI) (x) >= (UHI) (y))
43ff13b4	116	\f
c906108c SS	117	#define ADDSI(x, y) ((x) + (y))
	118	#define SUBSI(x, y) ((x) - (y))
	119	#define MULSI(x, y) ((x) * (y))
	120	#define DIVSI(x, y) ((SI) (x) / (SI) (y))
	121	#define UDIVSI(x, y) ((USI) (x) / (USI) (y))
	122	#define MODSI(x, y) ((SI) (x) % (SI) (y))
	123	#define UMODSI(x, y) ((USI) (x) % (USI) (y))
	124	#define SRASI(x, y) ((SI) (x) >> (y))
	125	#define SRLSI(x, y) ((USI) (x) >> (y))
	126	#define SLLSI(x, y) ((USI) (x) << (y))
43ff13b4 JM	127	extern SI RORSI (SI, int);
43ff13b4 JM	128	extern SI ROLSI (SI, int);
c906108c SS	129	#define ANDSI(x, y) ((x) & (y))
	130	#define ORSI(x, y) ((x) \| (y))
	131	#define XORSI(x, y) ((x) ^ (y))
	132	#define NEGSI(x) (- (x))
	133	#define NOTSI(x) (! (SI) (x))
	134	#define INVSI(x) (~ (x))
	135	#define EQSI(x, y) ((SI) (x) == (SI) (y))
	136	#define NESI(x, y) ((SI) (x) != (SI) (y))
	137	#define LTSI(x, y) ((SI) (x) < (SI) (y))
	138	#define LESI(x, y) ((SI) (x) <= (SI) (y))
	139	#define GTSI(x, y) ((SI) (x) > (SI) (y))
	140	#define GESI(x, y) ((SI) (x) >= (SI) (y))
	141	#define LTUSI(x, y) ((USI) (x) < (USI) (y))
	142	#define LEUSI(x, y) ((USI) (x) <= (USI) (y))
	143	#define GTUSI(x, y) ((USI) (x) > (USI) (y))
	144	#define GEUSI(x, y) ((USI) (x) >= (USI) (y))
43ff13b4	145	\f
c906108c	146	#ifdef DI_FN_SUPPORT
43ff13b4 JM	147	extern DI ADDDI (DI, DI);
	148	extern DI SUBDI (DI, DI);
	149	extern DI MULDI (DI, DI);
	150	extern DI DIVDI (DI, DI);
	151	extern DI UDIVDI (DI, DI);
	152	extern DI MODDI (DI, DI);
	153	extern DI UMODDI (DI, DI);
	154	extern DI SRADI (DI, int);
	155	extern UDI SRLDI (UDI, int);
	156	extern UDI SLLDI (UDI, int);
	157	extern DI RORDI (DI, int);
	158	extern DI ROLDI (DI, int);
	159	extern DI ANDDI (DI, DI);
	160	extern DI ORDI (DI, DI);
	161	extern DI XORDI (DI, DI);
	162	extern DI NEGDI (DI);
	163	extern int NOTDI (DI);
	164	extern DI INVDI (DI);
	165	extern int EQDI (DI, DI);
	166	extern int NEDI (DI, DI);
	167	extern int LTDI (DI, DI);
	168	extern int LEDI (DI, DI);
	169	extern int GTDI (DI, DI);
	170	extern int GEDI (DI, DI);
	171	extern int LTUDI (UDI, UDI);
	172	extern int LEUDI (UDI, UDI);
	173	extern int GTUDI (UDI, UDI);
	174	extern int GEUDI (UDI, UDI);
c906108c SS	175	#else /* ! DI_FN_SUPPORT */
	176	#define ADDDI(x, y) ((x) + (y))
	177	#define SUBDI(x, y) ((x) - (y))
	178	#define MULDI(x, y) ((x) * (y))
	179	#define DIVDI(x, y) ((DI) (x) / (DI) (y))
	180	#define UDIVDI(x, y) ((UDI) (x) / (UDI) (y))
	181	#define MODDI(x, y) ((DI) (x) % (DI) (y))
	182	#define UMODDI(x, y) ((UDI) (x) % (UDI) (y))
	183	#define SRADI(x, y) ((DI) (x) >> (y))
	184	#define SRLDI(x, y) ((UDI) (x) >> (y))
	185	#define SLLDI(x, y) ((UDI) (x) << (y))
43ff13b4 JM	186	extern DI RORDI (DI, int);
43ff13b4 JM	187	extern DI ROLDI (DI, int);
c906108c SS	188	#define ANDDI(x, y) ((x) & (y))
	189	#define ORDI(x, y) ((x) \| (y))
	190	#define XORDI(x, y) ((x) ^ (y))
	191	#define NEGDI(x) (- (x))
	192	#define NOTDI(x) (! (DI) (x))
	193	#define INVDI(x) (~ (x))
	194	#define EQDI(x, y) ((DI) (x) == (DI) (y))
	195	#define NEDI(x, y) ((DI) (x) != (DI) (y))
	196	#define LTDI(x, y) ((DI) (x) < (DI) (y))
	197	#define LEDI(x, y) ((DI) (x) <= (DI) (y))
	198	#define GTDI(x, y) ((DI) (x) > (DI) (y))
	199	#define GEDI(x, y) ((DI) (x) >= (DI) (y))
	200	#define LTUDI(x, y) ((UDI) (x) < (UDI) (y))
	201	#define LEUDI(x, y) ((UDI) (x) <= (UDI) (y))
	202	#define GTUDI(x, y) ((UDI) (x) > (UDI) (y))
	203	#define GEUDI(x, y) ((UDI) (x) >= (UDI) (y))
	204	#endif /* DI_FN_SUPPORT */
43ff13b4	205	\f
c906108c SS	206	#define EXTBIQI(x) ((QI) (BI) (x))
	207	#define EXTBIHI(x) ((HI) (BI) (x))
	208	#define EXTBISI(x) ((SI) (BI) (x))
	209	#if defined (DI_FN_SUPPORT)
43ff13b4	210	extern DI EXTBIDI (BI);
c906108c SS	211	#else
	212	#define EXTBIDI(x) ((DI) (BI) (x))
	213	#endif
	214	#define EXTQIHI(x) ((HI) (QI) (x))
	215	#define EXTQISI(x) ((SI) (QI) (x))
	216	#if defined (DI_FN_SUPPORT)
43ff13b4	217	extern DI EXTQIDI (QI);
c906108c SS	218	#else
	219	#define EXTQIDI(x) ((DI) (QI) (x))
	220	#endif
	221	#define EXTHISI(x) ((SI) (HI) (x))
	222	#if defined (DI_FN_SUPPORT)
43ff13b4	223	extern DI EXTHIDI (HI);
c906108c SS	224	#else
	225	#define EXTHIDI(x) ((DI) (HI) (x))
	226	#endif
	227	#if defined (DI_FN_SUPPORT)
43ff13b4	228	extern DI EXTSIDI (SI);
c906108c SS	229	#else
	230	#define EXTSIDI(x) ((DI) (SI) (x))
	231	#endif
43ff13b4	232	\f
c906108c SS	233	#define ZEXTBIQI(x) ((QI) (BI) (x))
	234	#define ZEXTBIHI(x) ((HI) (BI) (x))
	235	#define ZEXTBISI(x) ((SI) (BI) (x))
	236	#if defined (DI_FN_SUPPORT)
43ff13b4	237	extern DI ZEXTBIDI (BI);
c906108c SS	238	#else
	239	#define ZEXTBIDI(x) ((DI) (BI) (x))
	240	#endif
	241	#define ZEXTQIHI(x) ((HI) (UQI) (x))
	242	#define ZEXTQISI(x) ((SI) (UQI) (x))
	243	#if defined (DI_FN_SUPPORT)
43ff13b4	244	extern DI ZEXTQIDI (QI);
c906108c SS	245	#else
	246	#define ZEXTQIDI(x) ((DI) (UQI) (x))
	247	#endif
	248	#define ZEXTHISI(x) ((SI) (UHI) (x))
	249	#if defined (DI_FN_SUPPORT)
43ff13b4	250	extern DI ZEXTHIDI (HI);
c906108c SS	251	#else
	252	#define ZEXTHIDI(x) ((DI) (UHI) (x))
	253	#endif
	254	#if defined (DI_FN_SUPPORT)
43ff13b4	255	extern DI ZEXTSIDI (SI);
c906108c SS	256	#else
	257	#define ZEXTSIDI(x) ((DI) (USI) (x))
	258	#endif
43ff13b4	259	\f
c906108c SS	260	#define TRUNCQIBI(x) ((BI) (QI) (x))
	261	#define TRUNCHIBI(x) ((BI) (HI) (x))
	262	#define TRUNCHIQI(x) ((QI) (HI) (x))
	263	#define TRUNCSIBI(x) ((BI) (SI) (x))
	264	#define TRUNCSIQI(x) ((QI) (SI) (x))
	265	#define TRUNCSIHI(x) ((HI) (SI) (x))
	266	#if defined (DI_FN_SUPPORT)
43ff13b4	267	extern BI TRUNCDIBI (DI);
c906108c SS	268	#else
	269	#define TRUNCDIBI(x) ((BI) (DI) (x))
	270	#endif
	271	#if defined (DI_FN_SUPPORT)
43ff13b4	272	extern QI TRUNCDIQI (DI);
c906108c SS	273	#else
	274	#define TRUNCDIQI(x) ((QI) (DI) (x))
	275	#endif
	276	#if defined (DI_FN_SUPPORT)
43ff13b4	277	extern HI TRUNCDIHI (DI);
c906108c SS	278	#else
	279	#define TRUNCDIHI(x) ((HI) (DI) (x))
	280	#endif
	281	#if defined (DI_FN_SUPPORT)
43ff13b4	282	extern SI TRUNCDISI (DI);
c906108c SS	283	#else
	284	#define TRUNCDISI(x) ((SI) (DI) (x))
	285	#endif
c906108c	286	\f
6426a772 JM	287	/* Composing/decomposing the various types.
	288	Word ordering is endian-independent. Words are specified most to least
	289	significant and word number 0 is the most significant word.
	290	??? May also wish an endian-dependent version. Later. */
43ff13b4	291
c906108c	292	#ifdef SEMOPS_DEFINE_INLINE
7a292a7a SS	293
7a292a7a SS	294	SEMOPS_INLINE SF
6426a772	295	SUBWORDSISF (SI in)
7a292a7a SS	296	{
	297	union { SI in; SF out; } x;
	298	x.in = in;
	299	return x.out;
	300	}
	301
	302	SEMOPS_INLINE SI
6426a772	303	SUBWORDSFSI (SF in)
7a292a7a SS	304	{
	305	union { SF in; SI out; } x;
	306	x.in = in;
	307	return x.out;
	308	}
	309
	310	SEMOPS_INLINE SI
6426a772	311	SUBWORDDISI (DI in, int word)
7a292a7a	312	{
6426a772 JM	313	if (word == 0)
6426a772 JM	314	return (UDI) in >> 32;
7a292a7a	315	else
6426a772	316	return in;
7a292a7a SS	317	}
	318
	319	SEMOPS_INLINE SI
6426a772	320	SUBWORDDFSI (DF in, int word)
7a292a7a	321	{
6426a772 JM	322	/* Note: typedef UDI DF; */
	323	if (word == 0)
	324	return (UDI) in >> 32;
7a292a7a	325	else
6426a772	326	return in;
7a292a7a SS	327	}
7a292a7a SS	328
43ff13b4	329	SEMOPS_INLINE SI
6426a772	330	SUBWORDXFSI (XF in, int word)
43ff13b4	331	{
6426a772	332	/* Note: typedef struct { SI parts[3]; } XF; */
43ff13b4 JM	333	union { XF in; SI out[3]; } x;
43ff13b4 JM	334	x.in = in;
6426a772	335	return x.out[word];
43ff13b4 JM	336	}
43ff13b4 JM	337
7a292a7a	338	SEMOPS_INLINE SI
6426a772	339	SUBWORDTFSI (TF in, int word)
7a292a7a	340	{
6426a772	341	/* Note: typedef struct { SI parts[4]; } TF; */
7a292a7a SS	342	union { TF in; SI out[4]; } x;
7a292a7a SS	343	x.in = in;
6426a772	344	return x.out[word];
7a292a7a SS	345	}
	346
	347	SEMOPS_INLINE DI
6426a772	348	JOINSIDI (SI x0, SI x1)
7a292a7a SS	349	{
	350	if (CURRENT_TARGET_BYTE_ORDER == BIG_ENDIAN)
	351	return MAKEDI (x0, x1);
	352	else
	353	return MAKEDI (x1, x0);
	354	}
	355
	356	SEMOPS_INLINE DF
6426a772	357	JOINSIDF (SI x0, SI x1)
7a292a7a SS	358	{
	359	union { SI in[2]; DF out; } x;
	360	if (CURRENT_TARGET_BYTE_ORDER == BIG_ENDIAN)
	361	x.in[0] = x0, x.in[1] = x1;
	362	else
	363	x.in[1] = x0, x.in[0] = x1;
	364	return x.out;
	365	}
	366
43ff13b4	367	SEMOPS_INLINE XF
6426a772	368	JOINSIXF (SI x0, SI x1, SI x2)
43ff13b4 JM	369	{
	370	union { SI in[3]; XF out; } x;
	371	if (CURRENT_TARGET_BYTE_ORDER == BIG_ENDIAN)
	372	x.in[0] = x0, x.in[1] = x1, x.in[2] = x2;
	373	else
	374	x.in[2] = x0, x.in[1] = x1, x.in[0] = x2;
	375	return x.out;
	376	}
	377
7a292a7a	378	SEMOPS_INLINE TF
6426a772	379	JOINSITF (SI x0, SI x1, SI x2, SI x3)
7a292a7a SS	380	{
	381	union { SI in[4]; TF out; } x;
	382	if (CURRENT_TARGET_BYTE_ORDER == BIG_ENDIAN)
	383	x.in[0] = x0, x.in[1] = x1, x.in[2] = x2, x.in[3] = x3;
	384	else
	385	x.in[3] = x0, x.in[2] = x1, x.in[1] = x2, x.in[0] = x3;
	386	return x.out;
	387	}
	388
c906108c	389	#else
7a292a7a	390
6426a772 JM	391	SF SUBWORDSISF (SI);
	392	SI SUBWORDSFSI (SF);
	393	SI SUBWORDDISI (DI, int);
	394	SI SUBWORDDFSI (DF, int);
	395	SI SUBWORDXFSI (XF, int);
	396	SI SUBWORDTFSI (TF, int);
7a292a7a	397
6426a772 JM	398	DI JOINSIDI (SI, SI);
	399	DF JOINSIDF (SI, SI);
	400	XF JOINSIXF (SI, SI, SI);
	401	TF JOINSITF (SI, SI, SI, SI);
7a292a7a SS	402
	403	#endif /* SUBWORD,JOIN */
	404	\f
	405	/* Semantic support utilities. */
	406
	407	#ifdef SEMOPS_DEFINE_INLINE
c906108c SS	408
	409	SEMOPS_INLINE SI
	410	ADDCSI (SI a, SI b, BI c)
	411	{
	412	SI res = ADDSI (a, ADDSI (b, c));
	413	return res;
	414	}
	415
	416	SEMOPS_INLINE BI
	417	ADDCFSI (SI a, SI b, BI c)
	418	{
	419	SI tmp = ADDSI (a, ADDSI (b, c));
	420	BI res = ((USI) tmp < (USI) a) \|\| (c && tmp == a);
	421	return res;
	422	}
	423
	424	SEMOPS_INLINE BI
	425	ADDOFSI (SI a, SI b, BI c)
	426	{
	427	SI tmp = ADDSI (a, ADDSI (b, c));
	428	BI res = (((a < 0) == (b < 0))
	429	&& ((a < 0) != (tmp < 0)));
	430	return res;
	431	}
	432
	433	SEMOPS_INLINE SI
	434	SUBCSI (SI a, SI b, BI c)
	435	{
	436	SI res = SUBSI (a, ADDSI (b, c));
	437	return res;
	438	}
	439
	440	SEMOPS_INLINE BI
	441	SUBCFSI (SI a, SI b, BI c)
	442	{
	443	BI res = ((USI) a < (USI) b) \|\| (c && a == b);
	444	return res;
	445	}
	446
	447	SEMOPS_INLINE BI
	448	SUBOFSI (SI a, SI b, BI c)
	449	{
	450	SI tmp = SUBSI (a, ADDSI (b, c));
	451	BI res = (((a < 0) != (b < 0))
	452	&& ((a < 0) != (tmp < 0)));
	453	return res;
	454	}
	455
	456	#else
	457
	458	SI ADDCSI (SI, SI, BI);
	459	UBI ADDCFSI (SI, SI, BI);
	460	UBI ADDOFSI (SI, SI, BI);
	461	SI SUBCSI (SI, SI, BI);
	462	UBI SUBCFSI (SI, SI, BI);
	463	UBI SUBOFSI (SI, SI, BI);
	464
	465	#endif
c906108c SS	466
c906108c SS	467	#endif /* CGEN_SEM_OPS_H */