ghc/includes/PrimOps.h

   1 /* -----------------------------------------------------------------------------
   2  * $Id: PrimOps.h,v 1.64 2000/10/12 15:49:34 simonmar Exp $
   3  *
   4  * (c) The GHC Team, 1998-1999
   5  *
   6  * Macros for primitive operations in STG-ish C code.
   7  *
   8  * ---------------------------------------------------------------------------*/
   9
  10 #ifndef PRIMOPS_H
  11 #define PRIMOPS_H
  12
  13 /* -----------------------------------------------------------------------------
  14    Helpers for the metacircular interpreter.
  15    -------------------------------------------------------------------------- */
  16
  17 #ifdef GHCI
  18
  19 #define CHASE_INDIRECTIONS(lval)                                        \
  20    do {                                                                 \
  21         int again;                                                      \
  22         do {                                                            \
  23            again = 0;                                                   \
  24            if (get_itbl((StgClosure*)lval)->type == IND)                \
  25               { again = 1; lval = ((StgInd*)lval)->indirectee; }        \
  26            else                                                         \
  27            if (get_itbl((StgClosure*)lval)->type == IND_OLDGEN)         \
  28               { again = 1; lval = ((StgIndOldGen*)lval)->indirectee; }  \
  29         } while (again);                                                \
  30    } while (0)
  31
  32 #define indexWordOffClosurezh(r,a,i)                                    \
  33    do { StgClosure* tmp = (StgClosure*)(a);                             \
  34         CHASE_INDIRECTIONS(tmp);                                        \
  35         r = ((W_ *)tmp)[i];                                             \
  36    } while (0)
  37
  38 #define indexPtrOffClosurezh(r,a,i)                                     \
  39    do { StgClosure* tmp = (StgClosure*)(a);                             \
  40         CHASE_INDIRECTIONS(tmp);                                        \
  41         r = ((P_ *)tmp)[i];                                             \
  42    } while (0)
  43
  44 #endif
  45
  46 /* -----------------------------------------------------------------------------
  47    Comparison PrimOps.
  48    -------------------------------------------------------------------------- */
  49
  50 #define gtCharzh(r,a,b) r=(I_)((a)> (b))
  51 #define geCharzh(r,a,b) r=(I_)((a)>=(b))
  52 #define eqCharzh(r,a,b) r=(I_)((a)==(b))
  53 #define neCharzh(r,a,b) r=(I_)((a)!=(b))
  54 #define ltCharzh(r,a,b) r=(I_)((a)< (b))
  55 #define leCharzh(r,a,b) r=(I_)((a)<=(b))
  56
  57 /* Int comparisons: >#, >=# etc */
  58 #define zgzh(r,a,b)     r=(I_)((I_)(a) >(I_)(b))
  59 #define zgzezh(r,a,b)   r=(I_)((I_)(a)>=(I_)(b))
  60 #define zezezh(r,a,b)   r=(I_)((I_)(a)==(I_)(b))
  61 #define zszezh(r,a,b)   r=(I_)((I_)(a)!=(I_)(b))
  62 #define zlzh(r,a,b)     r=(I_)((I_)(a) <(I_)(b))
  63 #define zlzezh(r,a,b)   r=(I_)((I_)(a)<=(I_)(b))
  64
  65 #define gtWordzh(r,a,b) r=(I_)((W_)(a) >(W_)(b))
  66 #define geWordzh(r,a,b) r=(I_)((W_)(a)>=(W_)(b))
  67 #define eqWordzh(r,a,b) r=(I_)((W_)(a)==(W_)(b))
  68 #define neWordzh(r,a,b) r=(I_)((W_)(a)!=(W_)(b))
  69 #define ltWordzh(r,a,b) r=(I_)((W_)(a) <(W_)(b))
  70 #define leWordzh(r,a,b) r=(I_)((W_)(a)<=(W_)(b))
  71
  72 #define gtAddrzh(r,a,b) r=(I_)((a) >(b))
  73 #define geAddrzh(r,a,b) r=(I_)((a)>=(b))
  74 #define eqAddrzh(r,a,b) r=(I_)((a)==(b))
  75 #define neAddrzh(r,a,b) r=(I_)((a)!=(b))
  76 #define ltAddrzh(r,a,b) r=(I_)((a) <(b))
  77 #define leAddrzh(r,a,b) r=(I_)((a)<=(b))
  78
  79 #define gtFloatzh(r,a,b)  r=(I_)((a)> (b))
  80 #define geFloatzh(r,a,b)  r=(I_)((a)>=(b))
  81 #define eqFloatzh(r,a,b)  r=(I_)((a)==(b))
  82 #define neFloatzh(r,a,b)  r=(I_)((a)!=(b))
  83 #define ltFloatzh(r,a,b)  r=(I_)((a)< (b))
  84 #define leFloatzh(r,a,b)  r=(I_)((a)<=(b))
  85
  86 /* Double comparisons: >##, >=#@ etc */
  87 #define zgzhzh(r,a,b)   r=(I_)((a) >(b))
  88 #define zgzezhzh(r,a,b) r=(I_)((a)>=(b))
  89 #define zezezhzh(r,a,b) r=(I_)((a)==(b))
  90 #define zszezhzh(r,a,b) r=(I_)((a)!=(b))
  91 #define zlzhzh(r,a,b)   r=(I_)((a) <(b))
  92 #define zlzezhzh(r,a,b) r=(I_)((a)<=(b))
  93
  94 /* -----------------------------------------------------------------------------
  95    Char# PrimOps.
  96    -------------------------------------------------------------------------- */
  97
  98 #define ordzh(r,a)      r=(I_)((W_) (a))
  99 #define chrzh(r,a)      r=(StgChar)((W_)(a))
 100
 101 /* -----------------------------------------------------------------------------
 102    Int# PrimOps.
 103    -------------------------------------------------------------------------- */
 104
 105 I_ stg_div (I_ a, I_ b);
 106
 107 #define zpzh(r,a,b)             r=(a)+(b)
 108 #define zmzh(r,a,b)             r=(a)-(b)
 109 #define ztzh(r,a,b)             r=(a)*(b)
 110 #define quotIntzh(r,a,b)        r=(a)/(b)
 111 #define zszh(r,a,b)             r=ULTRASAFESTGCALL2(I_,(void *, I_, I_),stg_div,(a),(b))
 112 #define remIntzh(r,a,b)         r=(a)%(b)
 113 #define negateIntzh(r,a)        r=-(a)
 114
 115 /* -----------------------------------------------------------------------------
 116  * Int operations with carry.
 117  * -------------------------------------------------------------------------- */
 118
 119 /* With some bit-twiddling, we can define int{Add,Sub}Czh portably in
 120  * C, and without needing any comparisons.  This may not be the
 121  * fastest way to do it - if you have better code, please send it! --SDM
 122  *
 123  * Return : r = a + b,  c = 0 if no overflow, 1 on overflow.
 124  *
 125  * We currently don't make use of the r value if c is != 0 (i.e.
 126  * overflow), we just convert to big integers and try again.  This
 127  * could be improved by making r and c the correct values for
 128  * plugging into a new J#.
 129  */
 130 #define addIntCzh(r,c,a,b)                      \
 131 { r = a + b;                                    \
 132   c = ((StgWord)(~(a^b) & (a^r)))               \
 133     >> (BITS_PER_BYTE * sizeof(I_) - 1);        \
 134 }
 135
 136
 137 #define subIntCzh(r,c,a,b)                      \
 138 { r = a - b;                                    \
 139   c = ((StgWord)((a^b) & (a^r)))                \
 140     >> (BITS_PER_BYTE * sizeof(I_) - 1);        \
 141 }
 142
 143 /* Multiply with overflow checking.
 144  *
 145  * This is slightly more tricky - the usual sign rules for add/subtract
 146  * don't apply.
 147  *
 148  * On x86 hardware we use a hand-crafted assembly fragment to do the job.
 149  *
 150  * On other 32-bit machines we use gcc's 'long long' types, finding
 151  * overflow with some careful bit-twiddling.
 152  *
 153  * On 64-bit machines where gcc's 'long long' type is also 64-bits,
 154  * we use a crude approximation, testing whether either operand is
 155  * larger than 32-bits; if neither is, then we go ahead with the
 156  * multiplication.
 157  */
 158
 159 #if i386_TARGET_ARCH
 160
 161 #define mulIntCzh(r,c,a,b)                              \
 162 {                                                       \
 163   __asm__("xorl %1,%1\n\t                               \
 164            imull %2,%3\n\t                              \
 165            jno 1f\n\t                                   \
 166            movl $1,%1\n\t                               \
 167            1:"                                          \
 168         : "=r" (r), "=&r" (c) : "r" (a), "0" (b));      \
 169 }
 170
 171 #elif SIZEOF_VOID_P == 4
 172
 173 #ifdef WORDS_BIGENDIAN
 174 #define C 0
 175 #define R 1
 176 #else
 177 #define C 1
 178 #define R 0
 179 #endif
 180
 181 typedef union {
 182     StgInt64 l;
 183     StgInt32 i[2];
 184 } long_long_u ;
 185
 186 #define mulIntCzh(r,c,a,b)                      \
 187 {                                               \
 188   long_long_u z;                                \
 189   z.l = (StgInt64)a * (StgInt64)b;              \
 190   r = z.i[R];                                   \
 191   c = z.i[C];                                   \
 192   if (c == 0 || c == -1) {                      \
 193     c = ((StgWord)((a^b) ^ r))                  \
 194       >> (BITS_PER_BYTE * sizeof(I_) - 1);      \
 195   }                                             \
 196 }
 197 /* Careful: the carry calculation above is extremely delicate.  Make sure
 198  * you test it thoroughly after changing it.
 199  */
 200
 201 #else
 202
 203 #define HALF_INT  (1 << (BITS_PER_BYTE * sizeof(I_) / 2))
 204
 205 #define stg_abs(a) ((a) < 0 ? -(a) : (a))
 206
 207 #define mulIntCzh(r,c,a,b)                      \
 208 {                                               \
 209   if (stg_abs(a) >= HALF_INT                    \
 210       stg_abs(b) >= HALF_INT) {                 \
 211     c = 1;                                      \
 212   } else {                                      \
 213     r = a * b;                                  \
 214     c = 0;                                      \
 215   }                                             \
 216 }
 217 #endif
 218
 219 /* -----------------------------------------------------------------------------
 220    Word PrimOps.
 221    -------------------------------------------------------------------------- */
 222
 223 #define quotWordzh(r,a,b)       r=((W_)a)/((W_)b)
 224 #define remWordzh(r,a,b)        r=((W_)a)%((W_)b)
 225
 226 #define andzh(r,a,b)            r=(a)&(b)
 227 #define orzh(r,a,b)             r=(a)|(b)
 228 #define xorzh(r,a,b)            r=(a)^(b)
 229 #define notzh(r,a)              r=~(a)
 230
 231 /* The extra tests below properly define the behaviour when shifting
 232  * by offsets larger than the width of the value being shifted.  Doing
 233  * so is undefined in C (and in fact gives different answers depending
 234  * on whether the operation is constant folded or not with gcc on x86!)
 235  */
 236
 237 #define shiftLzh(r,a,b)         r=((b) >= BITS_IN(W_)) ? 0 : (a)<<(b)
 238 #define shiftRLzh(r,a,b)        r=((b) >= BITS_IN(W_)) ? 0 : (a)>>(b)
 239 #define iShiftLzh(r,a,b)        r=((b) >= BITS_IN(W_)) ? 0 : (a)<<(b)
 240 /* Right shifting of signed quantities is not portable in C, so
 241    the behaviour you'll get from using these primops depends
 242    on the whatever your C compiler is doing. ToDo: fix/document. -- sof 8/98
 243 */
 244 #define iShiftRAzh(r,a,b)       r=((b) >= BITS_IN(I_)) ? (((a) < 0) ? -1 : 0) : (a)>>(b)
 245 #define iShiftRLzh(r,a,b)       r=((b) >= BITS_IN(I_)) ? 0 : ((W_)(a))>>(b)
 246
 247 #define int2Wordzh(r,a)         r=(W_)(a)
 248 #define word2Intzh(r,a)         r=(I_)(a)
 249
 250 /* -----------------------------------------------------------------------------
 251    Addr PrimOps.
 252    -------------------------------------------------------------------------- */
 253
 254 #define int2Addrzh(r,a)         r=(A_)(a)
 255 #define addr2Intzh(r,a)         r=(I_)(a)
 256
 257 #define readCharOffAddrzh(r,a,i)        r= ((unsigned char *)(a))[i]
 258 /* unsigned char is for compatibility: the index is still in bytes. */
 259 #define readIntOffAddrzh(r,a,i)         r= ((I_ *)(a))[i]
 260 #define readWordOffAddrzh(r,a,i)        r= ((W_ *)(a))[i]
 261 #define readAddrOffAddrzh(r,a,i)        r= ((PP_)(a))[i]
 262 #define readFloatOffAddrzh(r,a,i)       r= PK_FLT((P_) (((StgFloat *)(a)) + i))
 263 #define readDoubleOffAddrzh(r,a,i)      r= PK_DBL((P_) (((StgDouble *)(a)) + i))
 264 #define readStablePtrOffAddrzh(r,a,i)   r= ((StgStablePtr *)(a))[i]
 265 #ifdef SUPPORT_LONG_LONGS
 266 #define readInt64OffAddrzh(r,a,i)       r= ((LI_ *)(a))[i]
 267 #define readWord64OffAddrzh(r,a,i)      r= ((LW_ *)(a))[i]
 268 #endif
 269
 270 #define writeCharOffAddrzh(a,i,v)       ((unsigned char *)(a))[i] = (unsigned char)(v)
 271 /* unsigned char is for compatibility: the index is still in bytes. */
 272 #define writeIntOffAddrzh(a,i,v)        ((I_ *)(a))[i] = (v)
 273 #define writeWordOffAddrzh(a,i,v)       ((W_ *)(a))[i] = (v)
 274 #define writeAddrOffAddrzh(a,i,v)       ((PP_)(a))[i] = (v)
 275 #define writeForeignObjOffAddrzh(a,i,v) ((PP_)(a))[i] = ForeignObj_CLOSURE_DATA(v)
 276 #define writeFloatOffAddrzh(a,i,v)      ASSIGN_FLT((P_) (((StgFloat *)(a)) + i),v)
 277 #define writeDoubleOffAddrzh(a,i,v)     ASSIGN_DBL((P_) (((StgDouble *)(a)) + i),v)
 278 #define writeStablePtrOffAddrzh(a,i,v)  ((StgStablePtr *)(a))[i] = (v)
 279 #ifdef SUPPORT_LONG_LONGS
 280 #define writeInt64OffAddrzh(a,i,v)   ((LI_ *)(a))[i] = (v)
 281 #define writeWord64OffAddrzh(a,i,v)  ((LW_ *)(a))[i] = (v)
 282 #endif
 283
 284 #define indexCharOffAddrzh(r,a,i)       r= ((unsigned char *)(a))[i]
 285 /* unsigned char is for compatibility: the index is still in bytes. */
 286 #define indexIntOffAddrzh(r,a,i)        r= ((I_ *)(a))[i]
 287 #define indexWordOffAddrzh(r,a,i)       r= ((W_ *)(a))[i]
 288 #define indexAddrOffAddrzh(r,a,i)       r= ((PP_)(a))[i]
 289 #define indexFloatOffAddrzh(r,a,i)      r= PK_FLT((P_) (((StgFloat *)(a)) + i))
 290 #define indexDoubleOffAddrzh(r,a,i)     r= PK_DBL((P_) (((StgDouble *)(a)) + i))
 291 #define indexStablePtrOffAddrzh(r,a,i)  r= ((StgStablePtr *)(a))[i]
 292 #ifdef SUPPORT_LONG_LONGS
 293 #define indexInt64OffAddrzh(r,a,i)      r= ((LI_ *)(a))[i]
 294 #define indexWord64OffAddrzh(r,a,i)     r= ((LW_ *)(a))[i]
 295 #endif
 296
 297 /* -----------------------------------------------------------------------------
 298    Float PrimOps.
 299    -------------------------------------------------------------------------- */
 300
 301 #define plusFloatzh(r,a,b)   r=(a)+(b)
 302 #define minusFloatzh(r,a,b)  r=(a)-(b)
 303 #define timesFloatzh(r,a,b)  r=(a)*(b)
 304 #define divideFloatzh(r,a,b) r=(a)/(b)
 305 #define negateFloatzh(r,a)   r=-(a)
 306
 307 #define int2Floatzh(r,a)     r=(StgFloat)(a)
 308 #define float2Intzh(r,a)     r=(I_)(a)
 309
 310 #define expFloatzh(r,a)      r=(StgFloat) RET_PRIM_STGCALL1(StgDouble,exp,a)
 311 #define logFloatzh(r,a)      r=(StgFloat) RET_PRIM_STGCALL1(StgDouble,log,a)
 312 #define sqrtFloatzh(r,a)     r=(StgFloat) RET_PRIM_STGCALL1(StgDouble,sqrt,a)
 313 #define sinFloatzh(r,a)      r=(StgFloat) RET_PRIM_STGCALL1(StgDouble,sin,a)
 314 #define cosFloatzh(r,a)      r=(StgFloat) RET_PRIM_STGCALL1(StgDouble,cos,a)
 315 #define tanFloatzh(r,a)      r=(StgFloat) RET_PRIM_STGCALL1(StgDouble,tan,a)
 316 #define asinFloatzh(r,a)     r=(StgFloat) RET_PRIM_STGCALL1(StgDouble,asin,a)
 317 #define acosFloatzh(r,a)     r=(StgFloat) RET_PRIM_STGCALL1(StgDouble,acos,a)
 318 #define atanFloatzh(r,a)     r=(StgFloat) RET_PRIM_STGCALL1(StgDouble,atan,a)
 319 #define sinhFloatzh(r,a)     r=(StgFloat) RET_PRIM_STGCALL1(StgDouble,sinh,a)
 320 #define coshFloatzh(r,a)     r=(StgFloat) RET_PRIM_STGCALL1(StgDouble,cosh,a)
 321 #define tanhFloatzh(r,a)     r=(StgFloat) RET_PRIM_STGCALL1(StgDouble,tanh,a)
 322 #define powerFloatzh(r,a,b)  r=(StgFloat) RET_PRIM_STGCALL2(StgDouble,pow,a,b)
 323
 324 /* -----------------------------------------------------------------------------
 325    Double PrimOps.
 326    -------------------------------------------------------------------------- */
 327
 328 #define zpzhzh(r,a,b)        r=(a)+(b)
 329 #define zmzhzh(r,a,b)        r=(a)-(b)
 330 #define ztzhzh(r,a,b)        r=(a)*(b)
 331 #define zszhzh(r,a,b)        r=(a)/(b)
 332 #define negateDoublezh(r,a)  r=-(a)
 333
 334 #define int2Doublezh(r,a)    r=(StgDouble)(a)
 335 #define double2Intzh(r,a)    r=(I_)(a)
 336
 337 #define float2Doublezh(r,a)  r=(StgDouble)(a)
 338 #define double2Floatzh(r,a)  r=(StgFloat)(a)
 339
 340 #define expDoublezh(r,a)     r=(StgDouble) RET_PRIM_STGCALL1(StgDouble,exp,a)
 341 #define logDoublezh(r,a)     r=(StgDouble) RET_PRIM_STGCALL1(StgDouble,log,a)
 342 #define sqrtDoublezh(r,a)    r=(StgDouble) RET_PRIM_STGCALL1(StgDouble,sqrt,a)
 343 #define sinDoublezh(r,a)     r=(StgDouble) RET_PRIM_STGCALL1(StgDouble,sin,a)
 344 #define cosDoublezh(r,a)     r=(StgDouble) RET_PRIM_STGCALL1(StgDouble,cos,a)
 345 #define tanDoublezh(r,a)     r=(StgDouble) RET_PRIM_STGCALL1(StgDouble,tan,a)
 346 #define asinDoublezh(r,a)    r=(StgDouble) RET_PRIM_STGCALL1(StgDouble,asin,a)
 347 #define acosDoublezh(r,a)    r=(StgDouble) RET_PRIM_STGCALL1(StgDouble,acos,a)
 348 #define atanDoublezh(r,a)    r=(StgDouble) RET_PRIM_STGCALL1(StgDouble,atan,a)
 349 #define sinhDoublezh(r,a)    r=(StgDouble) RET_PRIM_STGCALL1(StgDouble,sinh,a)
 350 #define coshDoublezh(r,a)    r=(StgDouble) RET_PRIM_STGCALL1(StgDouble,cosh,a)
 351 #define tanhDoublezh(r,a)    r=(StgDouble) RET_PRIM_STGCALL1(StgDouble,tanh,a)
 352 /* Power: **## */
 353 #define ztztzhzh(r,a,b) r=(StgDouble) RET_PRIM_STGCALL2(StgDouble,pow,a,b)
 354
 355 /* -----------------------------------------------------------------------------
 356    Integer PrimOps.
 357    -------------------------------------------------------------------------- */
 358
 359 /* We can do integer2Int and cmpInteger inline, since they don't need
 360  * to allocate any memory.
 361  *
 362  * integer2Int# is now modular.
 363  */
 364
 365 #define integer2Intzh(r, sa,da)                         \
 366 { StgWord word0 = ((StgWord *)BYTE_ARR_CTS(da))[0];     \
 367   int size = sa;                                        \
 368                                                         \
 369   (r) =                                                 \
 370     ( size == 0 ) ?                                     \
 371        0 :                                              \
 372        ( size < 0 && word0 != 0x8000000 ) ?             \
 373          -(I_)word0 :                                   \
 374           (I_)word0;                                    \
 375 }
 376
 377 #define integer2Wordzh(r, sa,da)                        \
 378 { StgWord word0 = ((StgWord *)BYTE_ARR_CTS(da))[0];     \
 379   int size = sa;                                        \
 380   (r) = ( size == 0 ) ? 0 : word0 ;                     \
 381 }
 382
 383 #define cmpIntegerzh(r, s1,d1, s2,d2)                           \
 384 { MP_INT arg1;                                                  \
 385   MP_INT arg2;                                                  \
 386                                                                 \
 387   arg1._mp_size = (s1);                                         \
 388   arg1._mp_alloc= ((StgArrWords *)d1)->words;                   \
 389   arg1._mp_d    = (unsigned long int *) (BYTE_ARR_CTS(d1));     \
 390   arg2._mp_size = (s2);                                         \
 391   arg2._mp_alloc= ((StgArrWords *)d2)->words;                   \
 392   arg2._mp_d    = (unsigned long int *) (BYTE_ARR_CTS(d2));     \
 393                                                                 \
 394   (r) = RET_PRIM_STGCALL2(I_,mpz_cmp,&arg1,&arg2);              \
 395 }
 396
 397 #define cmpIntegerIntzh(r, s,d, i)                              \
 398 { MP_INT arg;                                                   \
 399                                                                 \
 400   arg._mp_size  = (s);                                          \
 401   arg._mp_alloc = ((StgArrWords *)d)->words;                    \
 402   arg._mp_d     = (unsigned long int *) (BYTE_ARR_CTS(d));      \
 403                                                                 \
 404   (r) = RET_PRIM_STGCALL2(I_,mpz_cmp_si,&arg,i);                \
 405 }
 406
 407 /* NOTE: gcdIntzh and gcdIntegerIntzh work only for positive inputs! */
 408
 409 /* mp_limb_t must be able to hold an StgInt for this to work properly */
 410 #define gcdIntzh(r,a,b) \
 411 { mp_limb_t aa = (mp_limb_t)(a); \
 412   r = RET_STGCALL3(StgInt, mpn_gcd_1, (mp_limb_t *)(&aa), 1, (mp_limb_t)(b)); \
 413 }
 414
 415 #define gcdIntegerIntzh(r,sa,a,b) \
 416   r = RET_STGCALL3(StgInt, mpn_gcd_1, (mp_limb_t *)(BYTE_ARR_CTS(a)), sa, b)
 417
 418 /* The rest are all out-of-line: -------- */
 419
 420 /* Integer arithmetic */
 421 EXTFUN_RTS(plusIntegerzh_fast);
 422 EXTFUN_RTS(minusIntegerzh_fast);
 423 EXTFUN_RTS(timesIntegerzh_fast);
 424 EXTFUN_RTS(gcdIntegerzh_fast);
 425 EXTFUN_RTS(quotRemIntegerzh_fast);
 426 EXTFUN_RTS(quotIntegerzh_fast);
 427 EXTFUN_RTS(remIntegerzh_fast);
 428 EXTFUN_RTS(divExactIntegerzh_fast);
 429 EXTFUN_RTS(divModIntegerzh_fast);
 430
 431 /* Conversions */
 432 EXTFUN_RTS(int2Integerzh_fast);
 433 EXTFUN_RTS(word2Integerzh_fast);
 434
 435 /* Floating-point decodings */
 436 EXTFUN_RTS(decodeFloatzh_fast);
 437 EXTFUN_RTS(decodeDoublezh_fast);
 438
 439 /* -----------------------------------------------------------------------------
 440    Word64 PrimOps.
 441    -------------------------------------------------------------------------- */
 442
 443 #ifdef SUPPORT_LONG_LONGS
 444
 445 #define integerToWord64zh(r, sa,da)                     \
 446 { unsigned long int* d;                                 \
 447   I_ s;                                                 \
 448   StgWord64 res;                                        \
 449                                                         \
 450   d = (unsigned long int *) (BYTE_ARR_CTS(da));         \
 451   s = (sa);                                             \
 452   if ( s == 0 ) {                                       \
 453      res = (LW_)0;                                      \
 454   } else if ( s == 1) {                                 \
 455      res = (LW_)d[0];                                   \
 456   } else {                                              \
 457      res = (LW_)d[0] + (LW_)d[1] * 0x100000000ULL;      \
 458   }                                                     \
 459   (r) = res;                                            \
 460 }
 461
 462 #define integerToInt64zh(r, sa,da)                      \
 463 { unsigned long int* d;                                 \
 464   I_ s;                                                 \
 465   StgInt64 res;                                         \
 466                                                         \
 467   d = (unsigned long int *) (BYTE_ARR_CTS(da));         \
 468   s = (sa);                                             \
 469   if ( s == 0 ) {                                       \
 470      res = (LI_)0;                                      \
 471   } else if ( s == 1) {                                 \
 472      res = (LI_)d[0];                                   \
 473   } else {                                              \
 474      res = (LI_)d[0] + (LI_)d[1] * 0x100000000LL;       \
 475      if ( s < 0 ) {                                     \
 476            res = (LI_)-res;                             \
 477      }                                                  \
 478   }                                                     \
 479   (r) = res;                                            \
 480 }
 481
 482 /* Conversions */
 483 EXTFUN_RTS(int64ToIntegerzh_fast);
 484 EXTFUN_RTS(word64ToIntegerzh_fast);
 485
 486 /* The rest are (way!) out of line, implemented via C entry points.
 487  */
 488 I_ stg_gtWord64 (StgWord64, StgWord64);
 489 I_ stg_geWord64 (StgWord64, StgWord64);
 490 I_ stg_eqWord64 (StgWord64, StgWord64);
 491 I_ stg_neWord64 (StgWord64, StgWord64);
 492 I_ stg_ltWord64 (StgWord64, StgWord64);
 493 I_ stg_leWord64 (StgWord64, StgWord64);
 494
 495 I_ stg_gtInt64 (StgInt64, StgInt64);
 496 I_ stg_geInt64 (StgInt64, StgInt64);
 497 I_ stg_eqInt64 (StgInt64, StgInt64);
 498 I_ stg_neInt64 (StgInt64, StgInt64);
 499 I_ stg_ltInt64 (StgInt64, StgInt64);
 500 I_ stg_leInt64 (StgInt64, StgInt64);
 501
 502 LW_ stg_remWord64  (StgWord64, StgWord64);
 503 LW_ stg_quotWord64 (StgWord64, StgWord64);
 504
 505 LI_ stg_remInt64    (StgInt64, StgInt64);
 506 LI_ stg_quotInt64   (StgInt64, StgInt64);
 507 LI_ stg_negateInt64 (StgInt64);
 508 LI_ stg_plusInt64   (StgInt64, StgInt64);
 509 LI_ stg_minusInt64  (StgInt64, StgInt64);
 510 LI_ stg_timesInt64  (StgInt64, StgInt64);
 511
 512 LW_ stg_and64  (StgWord64, StgWord64);
 513 LW_ stg_or64   (StgWord64, StgWord64);
 514 LW_ stg_xor64  (StgWord64, StgWord64);
 515 LW_ stg_not64  (StgWord64);
 516
 517 LW_ stg_shiftL64   (StgWord64, StgInt);
 518 LW_ stg_shiftRL64  (StgWord64, StgInt);
 519 LI_ stg_iShiftL64  (StgInt64, StgInt);
 520 LI_ stg_iShiftRL64 (StgInt64, StgInt);
 521 LI_ stg_iShiftRA64 (StgInt64, StgInt);
 522
 523 LI_ stg_intToInt64    (StgInt);
 524 I_ stg_int64ToInt     (StgInt64);
 525 LW_ stg_int64ToWord64 (StgInt64);
 526
 527 LW_ stg_wordToWord64  (StgWord);
 528 W_  stg_word64ToWord  (StgWord64);
 529 LI_ stg_word64ToInt64 (StgWord64);
 530 #endif
 531
 532 /* -----------------------------------------------------------------------------
 533    Array PrimOps.
 534    -------------------------------------------------------------------------- */
 535
 536 /* We cast to void* instead of StgChar* because this avoids a warning
 537  * about increasing the alignment requirements.
 538  */
 539 #define REAL_BYTE_ARR_CTS(a)   ((void *) (((StgArrWords *)(a))->payload))
 540 #define REAL_PTRS_ARR_CTS(a)   ((P_)   (((StgMutArrPtrs  *)(a))->payload))
 541
 542 #ifdef DEBUG
 543 #define BYTE_ARR_CTS(a)                           \
 544  ({ ASSERT(GET_INFO((StgArrWords *)(a)) == &ARR_WORDS_info);      \
 545     REAL_BYTE_ARR_CTS(a); })
 546 #define PTRS_ARR_CTS(a)                           \
 547  ({ ASSERT((GET_INFO((StgMutArrPtrs  *)(a)) == &MUT_ARR_PTRS_FROZEN_info)         \
 548         || (GET_INFO((StgMutArrPtrs  *)(a)) == &MUT_ARR_PTRS_info));  \
 549     REAL_PTRS_ARR_CTS(a); })
 550 #else
 551 #define BYTE_ARR_CTS(a)         REAL_BYTE_ARR_CTS(a)
 552 #define PTRS_ARR_CTS(a)         REAL_PTRS_ARR_CTS(a)
 553 #endif
 554
 555 extern I_ genSymZh(void);
 556 extern I_ resetGenSymZh(void);
 557
 558 /*--- everything except new*Array is done inline: */
 559
 560 #define sameMutableArrayzh(r,a,b)       r=(I_)((a)==(b))
 561 #define sameMutableByteArrayzh(r,a,b)   r=(I_)((a)==(b))
 562
 563 #define readArrayzh(r,a,i)       r=((PP_) PTRS_ARR_CTS(a))[(i)]
 564
 565 #define readCharArrayzh(r,a,i)   indexCharOffAddrzh(r,BYTE_ARR_CTS(a),i)
 566 #define readIntArrayzh(r,a,i)    indexIntOffAddrzh(r,BYTE_ARR_CTS(a),i)
 567 #define readWordArrayzh(r,a,i)   indexWordOffAddrzh(r,BYTE_ARR_CTS(a),i)
 568 #define readAddrArrayzh(r,a,i)   indexAddrOffAddrzh(r,BYTE_ARR_CTS(a),i)
 569 #define readFloatArrayzh(r,a,i)  indexFloatOffAddrzh(r,BYTE_ARR_CTS(a),i)
 570 #define readDoubleArrayzh(r,a,i) indexDoubleOffAddrzh(r,BYTE_ARR_CTS(a),i)
 571 #define readStablePtrArrayzh(r,a,i) indexStablePtrOffAddrzh(r,BYTE_ARR_CTS(a),i)
 572 #ifdef SUPPORT_LONG_LONGS
 573 #define readInt64Arrayzh(r,a,i)  indexInt64OffAddrzh(r,BYTE_ARR_CTS(a),i)
 574 #define readWord64Arrayzh(r,a,i) indexWord64OffAddrzh(r,BYTE_ARR_CTS(a),i)
 575 #endif
 576
 577 /* result ("r") arg ignored in write macros! */
 578 #define writeArrayzh(a,i,v)     ((PP_) PTRS_ARR_CTS(a))[(i)]=(v)
 579
 580 #define writeCharArrayzh(a,i,v)   ((unsigned char *)(BYTE_ARR_CTS(a)))[i] = (unsigned char)(v)
 581 /* unsigned char is for compatibility: the index is still in bytes. */
 582 #define writeIntArrayzh(a,i,v)    ((I_ *)(BYTE_ARR_CTS(a)))[i] = (v)
 583 #define writeWordArrayzh(a,i,v)   ((W_ *)(BYTE_ARR_CTS(a)))[i] = (v)
 584 #define writeAddrArrayzh(a,i,v)   ((PP_)(BYTE_ARR_CTS(a)))[i] = (v)
 585 #define writeFloatArrayzh(a,i,v)  \
 586         ASSIGN_FLT((P_) (((StgFloat *)(BYTE_ARR_CTS(a))) + i),v)
 587 #define writeDoubleArrayzh(a,i,v) \
 588         ASSIGN_DBL((P_) (((StgDouble *)(BYTE_ARR_CTS(a))) + i),v)
 589 #define writeStablePtrArrayzh(a,i,v)      ((StgStablePtr *)(BYTE_ARR_CTS(a)))[i] = (v)
 590 #ifdef SUPPORT_LONG_LONGS
 591 #define writeInt64Arrayzh(a,i,v)  ((LI_ *)(BYTE_ARR_CTS(a)))[i] = (v)
 592 #define writeWord64Arrayzh(a,i,v) ((LW_ *)(BYTE_ARR_CTS(a)))[i] = (v)
 593 #endif
 594
 595 #define indexArrayzh(r,a,i)       r=((PP_) PTRS_ARR_CTS(a))[(i)]
 596
 597 #define indexCharArrayzh(r,a,i)   indexCharOffAddrzh(r,BYTE_ARR_CTS(a),i)
 598 #define indexIntArrayzh(r,a,i)    indexIntOffAddrzh(r,BYTE_ARR_CTS(a),i)
 599 #define indexWordArrayzh(r,a,i)   indexWordOffAddrzh(r,BYTE_ARR_CTS(a),i)
 600 #define indexAddrArrayzh(r,a,i)   indexAddrOffAddrzh(r,BYTE_ARR_CTS(a),i)
 601 #define indexFloatArrayzh(r,a,i)  indexFloatOffAddrzh(r,BYTE_ARR_CTS(a),i)
 602 #define indexDoubleArrayzh(r,a,i) indexDoubleOffAddrzh(r,BYTE_ARR_CTS(a),i)
 603 #define indexStablePtrArrayzh(r,a,i) indexStablePtrOffAddrzh(r,BYTE_ARR_CTS(a),i)
 604 #ifdef SUPPORT_LONG_LONGS
 605 #define indexInt64Arrayzh(r,a,i)  indexInt64OffAddrzh(r,BYTE_ARR_CTS(a),i)
 606 #define indexWord64Arrayzh(r,a,i) indexWord64OffAddrzh(r,BYTE_ARR_CTS(a),i)
 607 #endif
 608
 609 /* Freezing arrays-of-ptrs requires changing an info table, for the
 610    benefit of the generational collector.  It needs to scavenge mutable
 611    objects, even if they are in old space.  When they become immutable,
 612    they can be removed from this scavenge list.  */
 613
 614 #define unsafeFreezzeArrayzh(r,a)                                       \
 615         {                                                               \
 616         SET_INFO((StgClosure *)a,&MUT_ARR_PTRS_FROZEN_info);            \
 617         r = a;                                                          \
 618         }
 619
 620 #define unsafeFreezzeByteArrayzh(r,a)   r=(a)
 621
 622 EXTFUN_RTS(unsafeThawArrayzh_fast);
 623
 624 #define sizzeofByteArrayzh(r,a) \
 625      r = (((StgArrWords *)(a))->words * sizeof(W_))
 626 #define sizzeofMutableByteArrayzh(r,a) \
 627      r = (((StgArrWords *)(a))->words * sizeof(W_))
 628
 629 /* and the out-of-line ones... */
 630
 631 EXTFUN_RTS(newCharArrayzh_fast);
 632 EXTFUN_RTS(newIntArrayzh_fast);
 633 EXTFUN_RTS(newWordArrayzh_fast);
 634 EXTFUN_RTS(newAddrArrayzh_fast);
 635 EXTFUN_RTS(newFloatArrayzh_fast);
 636 EXTFUN_RTS(newDoubleArrayzh_fast);
 637 EXTFUN_RTS(newStablePtrArrayzh_fast);
 638 EXTFUN_RTS(newArrayzh_fast);
 639
 640 /* encoding and decoding of floats/doubles. */
 641
 642 /* We only support IEEE floating point format */
 643 #include "ieee-flpt.h"
 644
 645 /* The decode operations are out-of-line because they need to allocate
 646  * a byte array.
 647  */
 648 #ifdef FLOATS_AS_DOUBLES
 649 #define decodeFloatzh_fast decodeDoublezh_fast
 650 #else
 651 EXTFUN_RTS(decodeFloatzh_fast);
 652 #endif
 653
 654 EXTFUN_RTS(decodeDoublezh_fast);
 655
 656 /* grimy low-level support functions defined in StgPrimFloat.c */
 657
 658 extern StgDouble __encodeDouble (I_ size, StgByteArray arr, I_ e);
 659 extern StgDouble __int_encodeDouble (I_ j, I_ e);
 660 #ifndef FLOATS_AS_DOUBLES
 661 extern StgFloat  __encodeFloat (I_ size, StgByteArray arr, I_ e);
 662 extern StgFloat  __int_encodeFloat (I_ j, I_ e);
 663 #endif
 664 extern void      __decodeDouble (MP_INT *man, I_ *_exp, StgDouble dbl);
 665 extern void      __decodeFloat  (MP_INT *man, I_ *_exp, StgFloat flt);
 666 extern StgInt    isDoubleNaN(StgDouble d);
 667 extern StgInt    isDoubleInfinite(StgDouble d);
 668 extern StgInt    isDoubleDenormalized(StgDouble d);
 669 extern StgInt    isDoubleNegativeZero(StgDouble d);
 670 extern StgInt    isFloatNaN(StgFloat f);
 671 extern StgInt    isFloatInfinite(StgFloat f);
 672 extern StgInt    isFloatDenormalized(StgFloat f);
 673 extern StgInt    isFloatNegativeZero(StgFloat f);
 674
 675 /* -----------------------------------------------------------------------------
 676    Mutable variables
 677
 678    newMutVar is out of line.
 679    -------------------------------------------------------------------------- */
 680
 681 EXTFUN_RTS(newMutVarzh_fast);
 682
 683 #define readMutVarzh(r,a)        r=(P_)(((StgMutVar *)(a))->var)
 684 #define writeMutVarzh(a,v)       (P_)(((StgMutVar *)(a))->var)=(v)
 685 #define sameMutVarzh(r,a,b)      r=(I_)((a)==(b))
 686
 687 /* -----------------------------------------------------------------------------
 688    MVar PrimOps.
 689
 690    All out of line, because they either allocate or may block.
 691    -------------------------------------------------------------------------- */
 692 #define sameMVarzh(r,a,b)        r=(I_)((a)==(b))
 693
 694 /* Assume external decl of EMPTY_MVAR_info is in scope by now */
 695 #define isEmptyMVarzh(r,a)       r=(I_)((GET_INFO((StgMVar*)(a))) == &EMPTY_MVAR_info )
 696 EXTFUN_RTS(newMVarzh_fast);
 697 EXTFUN_RTS(takeMVarzh_fast);
 698 EXTFUN_RTS(tryTakeMVarzh_fast);
 699 EXTFUN_RTS(putMVarzh_fast);
 700
 701
 702 /* -----------------------------------------------------------------------------
 703    Delay/Wait PrimOps
 704    -------------------------------------------------------------------------- */
 705
 706 EXTFUN_RTS(waitReadzh_fast);
 707 EXTFUN_RTS(waitWritezh_fast);
 708 EXTFUN_RTS(delayzh_fast);
 709
 710 /* -----------------------------------------------------------------------------
 711    Primitive I/O, error-handling PrimOps
 712    -------------------------------------------------------------------------- */
 713
 714 EXTFUN_RTS(catchzh_fast);
 715 EXTFUN_RTS(raisezh_fast);
 716
 717 extern void stg_exit(I_ n)  __attribute__ ((noreturn));
 718
 719 /* -----------------------------------------------------------------------------
 720    Stable Name / Stable Pointer  PrimOps
 721    -------------------------------------------------------------------------- */
 722
 723 #ifndef PAR
 724
 725 EXTFUN_RTS(makeStableNamezh_fast);
 726
 727 #define stableNameToIntzh(r,s)   (r = ((StgStableName *)s)->sn)
 728
 729 #define eqStableNamezh(r,sn1,sn2)                                       \
 730     (r = (((StgStableName *)sn1)->sn == ((StgStableName *)sn2)->sn))
 731
 732 #define makeStablePtrzh(r,a) \
 733    r = RET_STGCALL1(StgStablePtr,getStablePtr,a)
 734
 735 #define deRefStablePtrzh(r,sp) do {             \
 736   ASSERT(stable_ptr_table[stgCast(StgWord,sp) & ~STABLEPTR_WEIGHT_MASK].weight > 0);    \
 737   r = stable_ptr_table[stgCast(StgWord,sp) & ~STABLEPTR_WEIGHT_MASK].addr; \
 738 } while (0);
 739
 740 #define eqStablePtrzh(r,sp1,sp2) \
 741     (r = ((stgCast(StgWord,sp1) & ~STABLEPTR_WEIGHT_MASK) == (stgCast(StgWord,sp2) & ~STABLEPTR_WEIGHT_MASK)))
 742
 743 #endif
 744
 745 /* -----------------------------------------------------------------------------
 746    Concurrency/Exception PrimOps.
 747    -------------------------------------------------------------------------- */
 748
 749 EXTFUN_RTS(forkzh_fast);
 750 EXTFUN_RTS(yieldzh_fast);
 751 EXTFUN_RTS(killThreadzh_fast);
 752 EXTFUN_RTS(seqzh_fast);
 753 EXTFUN_RTS(blockAsyncExceptionszh_fast);
 754 EXTFUN_RTS(unblockAsyncExceptionszh_fast);
 755
 756 #define myThreadIdzh(t) (t = CurrentTSO)
 757
 758 extern int cmp_thread(const StgTSO *tso1, const StgTSO *tso2);
 759
 760 /* ------------------------------------------------------------------------
 761    Parallel PrimOps
 762
 763    A par in the Haskell code is ultimately translated to a parzh macro
 764    (with a case wrapped around it to guarantee that the macro is actually
 765     executed; see compiler/prelude/PrimOps.lhs)
 766    In GUM and SMP we only add a pointer to the spark pool.
 767    In GranSim we call an RTS fct, forwarding additional parameters which
 768    supply info on granularity of the computation, size of the result value
 769    and the degree of parallelism in the sparked expression.
 770    ---------------------------------------------------------------------- */
 771
 772 #if defined(GRAN)
 773 //@cindex _par_
 774 #define parzh(r,node)             PAR(r,node,1,0,0,0,0,0)
 775
 776 //@cindex _parAt_
 777 #define parAtzh(r,node,where,identifier,gran_info,size_info,par_info,rest) \
 778         parAT(r,node,where,identifier,gran_info,size_info,par_info,rest,1)
 779
 780 //@cindex _parAtAbs_
 781 #define parAtAbszh(r,node,proc,identifier,gran_info,size_info,par_info,rest) \
 782         parAT(r,node,proc,identifier,gran_info,size_info,par_info,rest,2)
 783
 784 //@cindex _parAtRel_
 785 #define parAtRelzh(r,node,proc,identifier,gran_info,size_info,par_info,rest) \
 786         parAT(r,node,proc,identifier,gran_info,size_info,par_info,rest,3)
 787
 788 //@cindex _parAtForNow_
 789 #define parAtForNowzh(r,node,where,identifier,gran_info,size_info,par_info,rest)        \
 790         parAT(r,node,where,identifier,gran_info,size_info,par_info,rest,0)
 791
 792 #define parAT(r,node,where,identifier,gran_info,size_info,par_info,rest,local)  \
 793 {                                                               \
 794   if (closure_SHOULD_SPARK((StgClosure*)node)) {                \
 795     rtsSparkQ result;                                           \
 796     PEs p;                                                      \
 797                                                                 \
 798     STGCALL6(newSpark, node,identifier,gran_info,size_info,par_info,local); \
 799     switch (local) {                                                        \
 800       case 2: p = where;  /* parAtAbs means absolute PE no. expected */     \
 801               break;                                                        \
 802       case 3: p = CurrentProc+where; /* parAtRel means rel PE no. expected */\
 803               break;                                                        \
 804       default: p = where_is(where); /* parAt means closure expected */      \
 805               break;                                                        \
 806     }                                                                       \
 807     /* update GranSim state according to this spark */                      \
 808     STGCALL3(GranSimSparkAtAbs, result, (I_)p, identifier);                 \
 809   }                                                                         \
 810 }
 811
 812 //@cindex _parLocal_
 813 #define parLocalzh(r,node,identifier,gran_info,size_info,par_info,rest) \
 814         PAR(r,node,rest,identifier,gran_info,size_info,par_info,1)
 815
 816 //@cindex _parGlobal_
 817 #define parGlobalzh(r,node,identifier,gran_info,size_info,par_info,rest) \
 818         PAR(r,node,rest,identifier,gran_info,size_info,par_info,0)
 819
 820 #define PAR(r,node,rest,identifier,gran_info,size_info,par_info,local) \
 821 {                                                                        \
 822   if (closure_SHOULD_SPARK((StgClosure*)node)) {                         \
 823     rtsSpark *result;                                                    \
 824     result = RET_STGCALL6(rtsSpark*, newSpark,                           \
 825                           node,identifier,gran_info,size_info,par_info,local);\
 826     STGCALL1(add_to_spark_queue,result);                                \
 827     STGCALL2(GranSimSpark, local,(P_)node);                             \
 828   }                                                                     \
 829 }
 830
 831 #define copyablezh(r,node)                              \
 832   /* copyable not yet implemented!! */
 833
 834 #define noFollowzh(r,node)                              \
 835   /* noFollow not yet implemented!! */
 836
 837 #elif defined(SMP) || defined(PAR)
 838
 839 #define parzh(r,node)                                   \
 840 {                                                       \
 841   extern unsigned int context_switch;                   \
 842   if (closure_SHOULD_SPARK((StgClosure *)node) &&       \
 843       SparkTl < SparkLim) {                             \
 844     *SparkTl++ = (StgClosure *)(node);                  \
 845   }                                                     \
 846   r = context_switch = 1;                               \
 847 }
 848 #else /* !GRAN && !SMP && !PAR */
 849 #define parzh(r,node) r = 1
 850 #endif
 851
 852 /* -----------------------------------------------------------------------------
 853    Pointer equality
 854    -------------------------------------------------------------------------- */
 855
 856 /* warning: extremely non-referentially transparent, need to hide in
 857    an appropriate monad.
 858
 859    ToDo: follow indirections.
 860 */
 861
 862 #define reallyUnsafePtrEqualityzh(r,a,b) r=((StgPtr)(a) == (StgPtr)(b))
 863
 864 /* -----------------------------------------------------------------------------
 865    Weak Pointer PrimOps.
 866    -------------------------------------------------------------------------- */
 867
 868 #ifndef PAR
 869
 870 EXTFUN_RTS(mkWeakzh_fast);
 871 EXTFUN_RTS(finalizzeWeakzh_fast);
 872
 873 #define deRefWeakzh(code,val,w)                         \
 874   if (((StgWeak *)w)->header.info == &WEAK_info) {      \
 875         code = 1;                                       \
 876         val = (P_)((StgWeak *)w)->value;                \
 877   } else {                                              \
 878         code = 0;                                       \
 879         val = (P_)w;                                    \
 880   }
 881
 882 #define sameWeakzh(w1,w2)  ((w1)==(w2))
 883
 884 #endif
 885
 886 /* -----------------------------------------------------------------------------
 887    Foreign Object PrimOps.
 888    -------------------------------------------------------------------------- */
 889
 890 #ifndef PAR
 891
 892 #define ForeignObj_CLOSURE_DATA(c)  (((StgForeignObj *)c)->data)
 893
 894 #define foreignObjToAddrzh(r,fo)    r=ForeignObj_CLOSURE_DATA(fo)
 895 #define touchzh(o)                  /* nothing */
 896
 897 EXTFUN_RTS(mkForeignObjzh_fast);
 898
 899 #define writeForeignObjzh(res,datum) \
 900    (ForeignObj_CLOSURE_DATA(res) = (P_)(datum))
 901
 902 #define eqForeignObj(f1,f2)  ((f1)==(f2))
 903
 904 #define indexCharOffForeignObjzh(r,fo,i)   indexCharOffAddrzh(r,ForeignObj_CLOSURE_DATA(fo),i)
 905 #define indexIntOffForeignObjzh(r,fo,i)    indexIntOffAddrzh(r,ForeignObj_CLOSURE_DATA(fo),i)
 906 #define indexWordOffForeignObjzh(r,fo,i)   indexWordOffAddrzh(r,ForeignObj_CLOSURE_DATA(fo),i)
 907 #define indexAddrOffForeignObjzh(r,fo,i)   indexAddrOffAddrzh(r,ForeignObj_CLOSURE_DATA(fo),i)
 908 #define indexFloatOffForeignObjzh(r,fo,i)  indexFloatOffAddrzh(r,ForeignObj_CLOSURE_DATA(fo),i)
 909 #define indexDoubleOffForeignObjzh(r,fo,i) indexDoubleOffAddrzh(r,ForeignObj_CLOSURE_DATA(fo),i)
 910 #define indexStablePtrOffForeignObjzh(r,fo,i)  indexStablePtrOffAddrzh(r,ForeignObj_CLOSURE_DATA(fo),i)
 911 #ifdef SUPPORT_LONG_LONGS
 912 #define indexInt64OffForeignObjzh(r,fo,i)  indexInt64OffAddrzh(r,ForeignObj_CLOSURE_DATA(fo),i)
 913 #define indexWord64OffForeignObjzh(r,fo,i) indexWord64OffAddrzh(r,ForeignObj_CLOSURE_DATA(fo),i)
 914 #endif
 915
 916 #endif
 917
 918
 919 /* -----------------------------------------------------------------------------
 920    Constructor tags
 921    -------------------------------------------------------------------------- */
 922
 923 #ifdef GHCI
 924 #define dataToTagzh(r,a)                                                \
 925    do { StgClosure* tmp = (StgClosure*)(a);                             \
 926         CHASE_INDIRECTIONS(tmp);                                        \
 927         r = (GET_TAG(((StgClosure *)tmp)->header.info));                \
 928    } while (0)
 929 #else
 930 /* Original version doesn't chase indirections. */
 931 #define dataToTagzh(r,a)  r=(GET_TAG(((StgClosure *)a)->header.info))
 932 #endif
 933
 934 /*  tagToEnum# is handled directly by the code generator. */
 935
 936 /* -----------------------------------------------------------------------------
 937    Signal processing.  Not really primops, but called directly from
 938    Haskell.
 939    -------------------------------------------------------------------------- */
 940
 941 #define STG_SIG_DFL  (-1)
 942 #define STG_SIG_IGN  (-2)
 943 #define STG_SIG_ERR  (-3)
 944 #define STG_SIG_HAN  (-4)
 945
 946 extern StgInt sig_install (StgInt, StgInt, StgStablePtr, sigset_t *);
 947 #define stg_sig_default(sig,mask) sig_install(sig,STG_SIG_DFL,0,(sigset_t *)mask)
 948 #define stg_sig_ignore(sig,mask) sig_install(sig,STG_SIG_IGN,0,(sigset_t *)mask)
 949 #define stg_sig_catch(sig,ptr,mask) sig_install(sig,STG_SIG_HAN,ptr,(sigset_t *)mask)
 950
 951 #endif /* PRIMOPS_H */