ghc/includes/StgMacros.h

   1 /* -----------------------------------------------------------------------------
   2  * $Id: StgMacros.h,v 1.41 2001/11/08 16:37:54 simonmar Exp $
   3  *
   4  * (c) The GHC Team, 1998-1999
   5  *
   6  * Macros used for writing STG-ish C code.
   7  *
   8  * ---------------------------------------------------------------------------*/
   9
  10 #ifndef STGMACROS_H
  11 #define STGMACROS_H
  12
  13 /* -----------------------------------------------------------------------------
  14   The following macros create function headers.
  15
  16   Each basic block is represented by a C function with no arguments.
  17   We therefore always begin with either
  18
  19   extern F_ f(void)
  20
  21   or
  22
  23   static F_ f(void)
  24
  25   The macros can be used either to define the function itself, or to provide
  26   prototypes (by following with a ';').
  27
  28   Note: the various I*_ shorthands in the second block below are used to
  29   declare forward references to local symbols. These shorthands *have* to
  30   use the 'extern' type specifier and not 'static'. The reason for this is
  31   that 'static' declares a reference as being a static/local variable,
  32   and *not* as a forward reference to a static variable.
  33
  34   This might seem obvious, but it had me stumped as to why my info tables
  35   were suddenly all filled with 0s.
  36
  37     -- sof 1/99
  38
  39   --------------------------------------------------------------------------- */
  40
  41 #define STGFUN(f)       StgFunPtr f(void)
  42 #define EXTFUN(f)       extern StgFunPtr f(void)
  43 #define EXTFUN_RTS(f)   extern DLL_IMPORT_RTS StgFunPtr f(void)
  44 #define FN_(f)          F_ f(void)
  45 #define IFN_(f)         static F_ f(void)
  46 #define IF_(f)          static F_ f(void)
  47 #define EF_(f)          extern F_ f(void)
  48 #define EDF_(f)         extern DLLIMPORT F_ f(void)
  49
  50 #define EXTINFO_RTS     extern DLL_IMPORT_RTS INFO_TBL_CONST StgInfoTable
  51 #define ED_             extern
  52 #define EDD_            extern DLLIMPORT
  53 #define ED_RO_          extern const
  54 #define ID_             static
  55 #define ID_RO_          static const
  56 #define EI_             extern INFO_TBL_CONST StgInfoTable
  57 #define EDI_            extern DLLIMPORT INFO_TBL_CONST StgInfoTable
  58 #define II_             static INFO_TBL_CONST StgInfoTable
  59 #define EC_             extern StgClosure
  60 #define EDC_            extern DLLIMPORT StgClosure
  61 #define IC_             static StgClosure
  62 #define ECP_(x)         extern const StgClosure *(x)[]
  63 #define EDCP_(x)        extern DLLIMPORT StgClosure *(x)[]
  64 #define ICP_(x)         static const StgClosure *(x)[]
  65
  66 /* -----------------------------------------------------------------------------
  67    Stack Tagging.
  68
  69    For a  block of non-pointer words on the stack, we precede the
  70    block with a small-integer tag giving the number of non-pointer
  71    words in the block.
  72    -------------------------------------------------------------------------- */
  73
  74 #define ARGTAG_MAX 16           /* probably arbitrary */
  75 #define ARG_TAG(n)  (n)
  76 #define ARG_SIZE(n) (StgWord)n
  77
  78 typedef enum {
  79     REALWORLD_TAG = 0,
  80     INT_TAG       = sizeofW(StgInt),
  81     INT64_TAG     = sizeofW(StgInt64),
  82     WORD_TAG      = sizeofW(StgWord),
  83     ADDR_TAG      = sizeofW(StgAddr),
  84     CHAR_TAG      = sizeofW(StgChar),
  85     FLOAT_TAG     = sizeofW(StgFloat),
  86     DOUBLE_TAG    = sizeofW(StgDouble),
  87     STABLE_TAG    = sizeofW(StgWord),
  88 } StackTag;
  89
  90 static inline int IS_ARG_TAG( StgWord p );
  91 static inline int IS_ARG_TAG( StgWord p ) { return p <= ARGTAG_MAX; }
  92
  93 /* -----------------------------------------------------------------------------
  94    Argument checks.
  95
  96    If (Sp + <n_args>) > Su { JMP_(stg_update_PAP); }
  97
  98    Sp points to the topmost used word on the stack, and Su points to
  99    the most recently pushed update frame.
 100
 101    Remember that <n_args> must include any tagging of unboxed values.
 102
 103    ARGS_CHK_LOAD_NODE is for top-level functions, whose entry
 104    convention doesn't require that Node is loaded with a pointer to
 105    the closure.  Thus we must load node before calling stg_updatePAP if
 106    the argument check fails.
 107    -------------------------------------------------------------------------- */
 108
 109 #define ARGS_CHK(n)                             \
 110         if ((P_)(Sp + (n)) > (P_)Su) {          \
 111                 JMP_(stg_update_PAP);           \
 112         }
 113
 114 #define ARGS_CHK_LOAD_NODE(n,closure)           \
 115         if ((P_)(Sp + (n)) > (P_)Su) {          \
 116                 R1.p = (P_)closure;             \
 117                 JMP_(stg_update_PAP);           \
 118         }
 119
 120 /* -----------------------------------------------------------------------------
 121    Heap/Stack Checks.
 122
 123    When failing a check, we save a return address on the stack and
 124    jump to a pre-compiled code fragment that saves the live registers
 125    and returns to the scheduler.
 126
 127    The return address in most cases will be the beginning of the basic
 128    block in which the check resides, since we need to perform the check
 129    again on re-entry because someone else might have stolen the resource
 130    in the meantime.
 131    ------------------------------------------------------------------------- */
 132
 133 #define STK_CHK(headroom,ret,r,layout,tag_assts)                \
 134         if (Sp - headroom < SpLim) {                            \
 135             tag_assts                                           \
 136             (r) = (P_)ret;                                      \
 137             JMP_(stg_chk_##layout);                             \
 138         }
 139
 140 #define HP_CHK(headroom,ret,r,layout,tag_assts)                 \
 141         DO_GRAN_ALLOCATE(headroom)                              \
 142         if ((Hp += headroom) > HpLim) {                         \
 143             HpAlloc = (headroom);                               \
 144             tag_assts                                           \
 145             (r) = (P_)ret;                                      \
 146             JMP_(stg_chk_##layout);                             \
 147         }
 148
 149 #define HP_STK_CHK(stk_headroom,hp_headroom,ret,r,layout,tag_assts) \
 150         DO_GRAN_ALLOCATE(hp_headroom)                              \
 151         if (Sp - stk_headroom < SpLim || (Hp += hp_headroom) > HpLim) { \
 152             HpAlloc = (hp_headroom);                            \
 153             tag_assts                                           \
 154             (r) = (P_)ret;                                      \
 155             JMP_(stg_chk_##layout);                             \
 156         }
 157
 158 /* -----------------------------------------------------------------------------
 159    A Heap Check in a case alternative are much simpler: everything is
 160    on the stack and covered by a liveness mask already, and there is
 161    even a return address with an SRT info table there as well.
 162
 163    Just push R1 and return to the scheduler saying 'EnterGHC'
 164
 165    {STK,HP,HP_STK}_CHK_NP are the various checking macros for
 166    bog-standard case alternatives, thunks, and non-top-level
 167    functions.  In all these cases, node points to a closure that we
 168    can just enter to restart the heap check (the NP stands for 'node points').
 169
 170    In the NP case GranSim absolutely has to check whether the current node
 171    resides on the current processor. Otherwise a FETCH event has to be
 172    scheduled. All that is done in GranSimFetch. -- HWL
 173
 174    HpLim points to the LAST WORD of valid allocation space.
 175    -------------------------------------------------------------------------- */
 176
 177 #define STK_CHK_NP(headroom,ptrs,tag_assts)                     \
 178         if ((Sp - (headroom)) < SpLim) {                        \
 179             tag_assts                                           \
 180             JMP_(stg_gc_enter_##ptrs);                          \
 181         }
 182
 183 #define HP_CHK_NP(headroom,ptrs,tag_assts)                      \
 184         DO_GRAN_ALLOCATE(headroom)                              \
 185         if ((Hp += (headroom)) > HpLim) {                       \
 186             HpAlloc = (headroom);                               \
 187             tag_assts                                           \
 188             JMP_(stg_gc_enter_##ptrs);                          \
 189         }
 190
 191 #define HP_CHK_SEQ_NP(headroom,ptrs,tag_assts)                  \
 192         DO_GRAN_ALLOCATE(headroom)                              \
 193         if ((Hp += (headroom)) > HpLim) {                       \
 194             HpAlloc = (headroom);                               \
 195             tag_assts                                           \
 196             JMP_(stg_gc_seq_##ptrs);                            \
 197         }
 198
 199 #define HP_STK_CHK_NP(stk_headroom, hp_headroom, ptrs, tag_assts) \
 200         DO_GRAN_ALLOCATE(hp_headroom)                              \
 201         if ((Sp - (stk_headroom)) < SpLim || (Hp += (hp_headroom)) > HpLim) { \
 202             HpAlloc = (hp_headroom);                            \
 203             tag_assts                                           \
 204             JMP_(stg_gc_enter_##ptrs);                          \
 205         }
 206
 207
 208 /* Heap checks for branches of a primitive case / unboxed tuple return */
 209
 210 #define GEN_HP_CHK_ALT(headroom,lbl,tag_assts)                  \
 211         DO_GRAN_ALLOCATE(headroom)                              \
 212         if ((Hp += (headroom)) > HpLim) {                       \
 213             EXTFUN_RTS(lbl);                                    \
 214             HpAlloc = (headroom);                               \
 215             tag_assts                                           \
 216             JMP_(lbl);                                          \
 217         }
 218
 219 #define HP_CHK_NOREGS(headroom,tag_assts) \
 220     GEN_HP_CHK_ALT(headroom,stg_gc_noregs,tag_assts);
 221 #define HP_CHK_UNPT_R1(headroom,tag_assts)  \
 222     GEN_HP_CHK_ALT(headroom,stg_gc_unpt_r1,tag_assts);
 223 #define HP_CHK_UNBX_R1(headroom,tag_assts)  \
 224     GEN_HP_CHK_ALT(headroom,stg_gc_unbx_r1,tag_assts);
 225 #define HP_CHK_F1(headroom,tag_assts)       \
 226     GEN_HP_CHK_ALT(headroom,stg_gc_f1,tag_assts);
 227 #define HP_CHK_D1(headroom,tag_assts)       \
 228     GEN_HP_CHK_ALT(headroom,stg_gc_d1,tag_assts);
 229
 230 #define HP_CHK_L1(headroom,tag_assts)       \
 231     GEN_HP_CHK_ALT(headroom,stg_gc_d1,tag_assts);
 232
 233 #define HP_CHK_UT_ALT(headroom, ptrs, nptrs, r, ret, tag_assts) \
 234     GEN_HP_CHK_ALT(headroom, stg_gc_ut_##ptrs##_##nptrs, \
 235                      tag_assts r = (P_)ret;)
 236
 237 /* -----------------------------------------------------------------------------
 238    Generic Heap checks.
 239
 240    These are slow, but have the advantage of being usable in a variety
 241    of situations.
 242
 243    The one restriction is that any relevant SRTs must already be pointed
 244    to from the stack.  The return address doesn't need to have an info
 245    table attached: hence it can be any old code pointer.
 246
 247    The liveness mask is a logical 'XOR' of NO_PTRS and zero or more
 248    Rn_PTR constants defined below.  All registers will be saved, but
 249    the garbage collector needs to know which ones contain pointers.
 250
 251    Good places to use a generic heap check:
 252
 253         - case alternatives (the return address with an SRT is already
 254           on the stack).
 255
 256         - primitives (no SRT required).
 257
 258    The stack layout is like this:
 259
 260           DblReg1-2
 261           FltReg1-4
 262           R1-8
 263           return address
 264           liveness mask
 265           stg_gen_chk_info
 266
 267    so the liveness mask depends on the size of an StgDouble (FltRegs
 268    and R<n> are guaranteed to be 1 word in size).
 269
 270    -------------------------------------------------------------------------- */
 271
 272 /* VERY MAGIC CONSTANTS!
 273  * must agree with code in HeapStackCheck.c, stg_gen_chk
 274  */
 275
 276 #if SIZEOF_DOUBLE > SIZEOF_VOID_P
 277 #define ALL_NON_PTRS   0xffff
 278 #else /* SIZEOF_DOUBLE == SIZEOF_VOID_P */
 279 #define ALL_NON_PTRS   0x3fff
 280 #endif
 281
 282 #define LIVENESS_MASK(ptr_regs)  (ALL_NON_PTRS ^ (ptr_regs))
 283
 284 #define NO_PTRS   0
 285 #define R1_PTR    1<<0
 286 #define R2_PTR    1<<1
 287 #define R3_PTR    1<<2
 288 #define R4_PTR    1<<3
 289 #define R5_PTR    1<<4
 290 #define R6_PTR    1<<5
 291 #define R7_PTR    1<<6
 292 #define R8_PTR    1<<7
 293
 294 #define HP_CHK_GEN(headroom,liveness,reentry,tag_assts) \
 295    if ((Hp += (headroom)) > HpLim ) {                   \
 296         HpAlloc = (headroom);                           \
 297         tag_assts                                       \
 298         R9.w = (W_)LIVENESS_MASK(liveness);             \
 299         R10.w = (W_)reentry;                            \
 300         JMP_(stg_gen_chk);                              \
 301    }
 302
 303 #define HP_CHK_GEN_TICKY(headroom,liveness,reentry,tag_assts)   \
 304    HP_CHK_GEN(headroom,liveness,reentry,tag_assts);             \
 305    TICK_ALLOC_HEAP_NOCTR(headroom)
 306
 307 #define STK_CHK_GEN(headroom,liveness,reentry,tag_assts)        \
 308    if ((Sp - (headroom)) < SpLim) {                             \
 309         tag_assts                                               \
 310         R9.w = (W_)LIVENESS_MASK(liveness);                     \
 311         R10.w = (W_)reentry;                                    \
 312         JMP_(stg_gen_chk);                                      \
 313    }
 314
 315 #define MAYBE_GC(liveness,reentry)              \
 316    if (doYouWantToGC()) {                       \
 317         R9.w = (W_)LIVENESS_MASK(liveness);     \
 318         R10.w = (W_)reentry;                    \
 319         JMP_(stg_gen_hp);                       \
 320    }
 321
 322 /* -----------------------------------------------------------------------------
 323    Voluntary Yields/Blocks
 324
 325    We only have a generic version of this at the moment - if it turns
 326    out to be slowing us down we can make specialised ones.
 327    -------------------------------------------------------------------------- */
 328
 329 EXTFUN_RTS(stg_gen_yield);
 330 EXTFUN_RTS(stg_gen_block);
 331
 332 #define YIELD(liveness,reentry)                 \
 333   {                                             \
 334    R9.w  = (W_)LIVENESS_MASK(liveness);         \
 335    R10.w = (W_)reentry;                         \
 336    JMP_(stg_gen_yield);                         \
 337   }
 338
 339 #define BLOCK(liveness,reentry)                 \
 340   {                                             \
 341    R9.w  = (W_)LIVENESS_MASK(liveness);         \
 342    R10.w = (W_)reentry;                         \
 343    JMP_(stg_gen_block);                         \
 344   }
 345
 346 #define BLOCK_NP(ptrs)                          \
 347   {                                             \
 348     EXTFUN_RTS(stg_block_##ptrs);                       \
 349     JMP_(stg_block_##ptrs);                     \
 350   }
 351
 352 #if defined(PAR)
 353 /*
 354   Similar to BLOCK_NP but separates the saving of the thread state from the
 355   actual jump via an StgReturn
 356 */
 357
 358 #define SAVE_THREAD_STATE(ptrs)                  \
 359   ASSERT(ptrs==1);                               \
 360   Sp -= 1;                                       \
 361   Sp[0] = R1.w;                                  \
 362   SaveThreadState();
 363
 364 #define THREAD_RETURN(ptrs)                      \
 365   ASSERT(ptrs==1);                               \
 366   CurrentTSO->what_next = ThreadEnterGHC;        \
 367   R1.i = ThreadBlocked;                          \
 368   JMP_(StgReturn);
 369 #endif
 370
 371 /* -----------------------------------------------------------------------------
 372    CCall_GC needs to push a dummy stack frame containing the contents
 373    of volatile registers and variables.
 374
 375    We use a RET_DYN frame the same as for a dynamic heap check.
 376    ------------------------------------------------------------------------- */
 377
 378 EXTINFO_RTS(stg_gen_chk_info);
 379
 380 /* -----------------------------------------------------------------------------
 381    Vectored Returns
 382
 383    RETVEC(p,t) where 'p' is a pointer to the info table for a
 384    vectored return address, returns the address of the return code for
 385    tag 't'.
 386
 387    Return vectors are placed in *reverse order* immediately before the info
 388    table for the return address.  Hence the formula for computing the
 389    actual return address is (addr - sizeof(InfoTable) - tag - 1).
 390    The extra subtraction of one word is because tags start at zero.
 391    -------------------------------------------------------------------------- */
 392
 393 #ifdef TABLES_NEXT_TO_CODE
 394 #define RET_VEC(p,t) (*((P_)(p) - sizeofW(StgInfoTable) - t - 1))
 395 #else
 396 #define RET_VEC(p,t) (((StgInfoTable *)p)->vector[t])
 397 #endif
 398
 399 /* -----------------------------------------------------------------------------
 400    Misc
 401    -------------------------------------------------------------------------- */
 402
 403
 404 /* set the tag register (if we have one) */
 405 #define SET_TAG(t)  /* nothing */
 406
 407 #ifdef EAGER_BLACKHOLING
 408 #  ifdef SMP
 409 #    define UPD_BH_UPDATABLE(info)                              \
 410         TICK_UPD_BH_UPDATABLE();                                \
 411         {                                                       \
 412           bdescr *bd = Bdescr(R1.p);                            \
 413           if (bd->back != (bdescr *)BaseReg) {                  \
 414              if (bd->gen->no >= 1 || bd->step->no >= 1) {       \
 415                  LOCK_THUNK(info);                              \
 416              } else {                                           \
 417                  EXTFUN_RTS(stg_gc_enter_1_hponly);             \
 418                  JMP_(stg_gc_enter_1_hponly);                   \
 419              }                                                  \
 420           }                                                     \
 421         }                                                       \
 422         SET_INFO(R1.cl,&stg_BLACKHOLE_info)
 423 #    define UPD_BH_SINGLE_ENTRY(info)                           \
 424         TICK_UPD_BH_SINGLE_ENTRY();                             \
 425         {                                                       \
 426           bdescr *bd = Bdescr(R1.p);                            \
 427           if (bd->back != (bdescr *)BaseReg) {                  \
 428              if (bd->gen->no >= 1 || bd->step->no >= 1) {       \
 429                  LOCK_THUNK(info);                              \
 430              } else {                                           \
 431                  EXTFUN_RTS(stg_gc_enter_1_hponly);             \
 432                  JMP_(stg_gc_enter_1_hponly);                   \
 433              }                                                  \
 434           }                                                     \
 435         }                                                       \
 436         SET_INFO(R1.cl,&stg_BLACKHOLE_info)
 437 #  else
 438 #    define UPD_BH_UPDATABLE(info)              \
 439         TICK_UPD_BH_UPDATABLE();                \
 440         SET_INFO(R1.cl,&stg_BLACKHOLE_info)
 441 #    define UPD_BH_SINGLE_ENTRY(info)           \
 442         TICK_UPD_BH_SINGLE_ENTRY();             \
 443         SET_INFO(R1.cl,&stg_SE_BLACKHOLE_info)
 444 #  endif
 445 #else /* !EAGER_BLACKHOLING */
 446 #  define UPD_BH_UPDATABLE(thunk)    /* nothing */
 447 #  define UPD_BH_SINGLE_ENTRY(thunk) /* nothing */
 448 #endif /* EAGER_BLACKHOLING */
 449
 450 #define UPD_FRAME_UPDATEE(p)  ((P_)(((StgUpdateFrame *)(p))->updatee))
 451 #define UPDATE_SU_FROM_UPD_FRAME(p) (Su=((StgUpdateFrame *)(p))->link)
 452
 453 /* -----------------------------------------------------------------------------
 454    Moving Floats and Doubles
 455
 456    ASSIGN_FLT is for assigning a float to memory (usually the
 457               stack/heap).  The memory address is guaranteed to be
 458               StgWord aligned (currently == sizeof(long)).
 459
 460    PK_FLT     is for pulling a float out of memory.  The memory is
 461               guaranteed to be StgWord aligned.
 462    -------------------------------------------------------------------------- */
 463
 464 static inline void        ASSIGN_FLT (W_ [], StgFloat);
 465 static inline StgFloat    PK_FLT     (W_ []);
 466
 467 #if ALIGNMENT_FLOAT <= ALIGNMENT_LONG
 468
 469 static inline void     ASSIGN_FLT(W_ p_dest[], StgFloat src) { *(StgFloat *)p_dest = src; }
 470 static inline StgFloat PK_FLT    (W_ p_src[])                { return *(StgFloat *)p_src; }
 471
 472 #else  /* ALIGNMENT_FLOAT > ALIGNMENT_UNSIGNED_INT */
 473
 474 static inline void ASSIGN_FLT(W_ p_dest[], StgFloat src)
 475 {
 476     float_thing y;
 477     y.f = src;
 478     *p_dest = y.fu;
 479 }
 480
 481 static inline StgFloat PK_FLT(W_ p_src[])
 482 {
 483     float_thing y;
 484     y.fu = *p_src;
 485     return(y.f);
 486 }
 487
 488 #endif /* ALIGNMENT_FLOAT > ALIGNMENT_LONG */
 489
 490 #if ALIGNMENT_DOUBLE <= ALIGNMENT_LONG
 491
 492 static inline void        ASSIGN_DBL (W_ [], StgDouble);
 493 static inline StgDouble   PK_DBL     (W_ []);
 494
 495 static inline void      ASSIGN_DBL(W_ p_dest[], StgDouble src) { *(StgDouble *)p_dest = src; }
 496 static inline StgDouble PK_DBL    (W_ p_src[])                 { return *(StgDouble *)p_src; }
 497
 498 #else   /* ALIGNMENT_DOUBLE > ALIGNMENT_LONG */
 499
 500 /* Sparc uses two floating point registers to hold a double.  We can
 501  * write ASSIGN_DBL and PK_DBL by directly accessing the registers
 502  * independently - unfortunately this code isn't writable in C, we
 503  * have to use inline assembler.
 504  */
 505 #if sparc_TARGET_ARCH
 506
 507 #define ASSIGN_DBL(dst0,src) \
 508     { StgPtr dst = (StgPtr)(dst0); \
 509       __asm__("st %2,%0\n\tst %R2,%1" : "=m" (((P_)(dst))[0]), \
 510         "=m" (((P_)(dst))[1]) : "f" (src)); \
 511     }
 512
 513 #define PK_DBL(src0) \
 514     ( { StgPtr src = (StgPtr)(src0); \
 515         register double d; \
 516       __asm__("ld %1,%0\n\tld %2,%R0" : "=f" (d) : \
 517         "m" (((P_)(src))[0]), "m" (((P_)(src))[1])); d; \
 518     } )
 519
 520 #else /* ! sparc_TARGET_ARCH */
 521
 522 static inline void        ASSIGN_DBL (W_ [], StgDouble);
 523 static inline StgDouble   PK_DBL     (W_ []);
 524
 525 typedef struct
 526   { StgWord dhi;
 527     StgWord dlo;
 528   } unpacked_double;
 529
 530 typedef union
 531   { StgDouble d;
 532     unpacked_double du;
 533   } double_thing;
 534
 535 static inline void ASSIGN_DBL(W_ p_dest[], StgDouble src)
 536 {
 537     double_thing y;
 538     y.d = src;
 539     p_dest[0] = y.du.dhi;
 540     p_dest[1] = y.du.dlo;
 541 }
 542
 543 /* GCC also works with this version, but it generates
 544    the same code as the previous one, and is not ANSI
 545
 546 #define ASSIGN_DBL( p_dest, src ) \
 547         *p_dest = ((double_thing) src).du.dhi; \
 548         *(p_dest+1) = ((double_thing) src).du.dlo \
 549 */
 550
 551 static inline StgDouble PK_DBL(W_ p_src[])
 552 {
 553     double_thing y;
 554     y.du.dhi = p_src[0];
 555     y.du.dlo = p_src[1];
 556     return(y.d);
 557 }
 558
 559 #endif /* ! sparc_TARGET_ARCH */
 560
 561 #endif /* ALIGNMENT_DOUBLE > ALIGNMENT_UNSIGNED_INT */
 562
 563 #ifdef SUPPORT_LONG_LONGS
 564
 565 typedef struct
 566   { StgWord dhi;
 567     StgWord dlo;
 568   } unpacked_double_word;
 569
 570 typedef union
 571   { StgInt64 i;
 572     unpacked_double_word iu;
 573   } int64_thing;
 574
 575 typedef union
 576   { StgWord64 w;
 577     unpacked_double_word wu;
 578   } word64_thing;
 579
 580 static inline void ASSIGN_Word64(W_ p_dest[], StgWord64 src)
 581 {
 582     word64_thing y;
 583     y.w = src;
 584     p_dest[0] = y.wu.dhi;
 585     p_dest[1] = y.wu.dlo;
 586 }
 587
 588 static inline StgWord64 PK_Word64(W_ p_src[])
 589 {
 590     word64_thing y;
 591     y.wu.dhi = p_src[0];
 592     y.wu.dlo = p_src[1];
 593     return(y.w);
 594 }
 595
 596 static inline void ASSIGN_Int64(W_ p_dest[], StgInt64 src)
 597 {
 598     int64_thing y;
 599     y.i = src;
 600     p_dest[0] = y.iu.dhi;
 601     p_dest[1] = y.iu.dlo;
 602 }
 603
 604 static inline StgInt64 PK_Int64(W_ p_src[])
 605 {
 606     int64_thing y;
 607     y.iu.dhi = p_src[0];
 608     y.iu.dlo = p_src[1];
 609     return(y.i);
 610 }
 611
 612 #elif SIZEOF_VOID_P == 8
 613
 614 static inline void ASSIGN_Word64(W_ p_dest[], StgWord64 src)
 615 {
 616         p_dest[0] = src;
 617 }
 618
 619 static inline StgWord64 PK_Word64(W_ p_src[])
 620 {
 621     return p_src[0];
 622 }
 623
 624 static inline void ASSIGN_Int64(W_ p_dest[], StgInt64 src)
 625 {
 626     p_dest[0] = src;
 627 }
 628
 629 static inline StgInt64 PK_Int64(W_ p_src[])
 630 {
 631     return p_src[0];
 632 }
 633
 634 #endif
 635
 636 /* -----------------------------------------------------------------------------
 637    Catch frames
 638    -------------------------------------------------------------------------- */
 639
 640 extern DLL_IMPORT_RTS const StgPolyInfoTable stg_catch_frame_info;
 641
 642 /* -----------------------------------------------------------------------------
 643    Seq frames
 644
 645    A seq frame is very like an update frame, except that it doesn't do
 646    an update...
 647    -------------------------------------------------------------------------- */
 648
 649 extern DLL_IMPORT_RTS const StgPolyInfoTable stg_seq_frame_info;
 650
 651 #define PUSH_SEQ_FRAME(sp)                                      \
 652         {                                                       \
 653                 StgSeqFrame *__frame;                           \
 654                 TICK_SEQF_PUSHED();                             \
 655                 __frame = (StgSeqFrame *)(sp);                  \
 656                 SET_HDR_(__frame,&stg_seq_frame_info,CCCS);     \
 657                 __frame->link = Su;                             \
 658                 Su = (StgUpdateFrame *)__frame;                 \
 659         }
 660
 661 /* -----------------------------------------------------------------------------
 662    Split markers
 663    -------------------------------------------------------------------------- */
 664
 665 #if defined(USE_SPLIT_MARKERS)
 666 #if defined(cygwin32_TARGET_OS) || defined(mingw32_TARGET_OS)
 667 #define __STG_SPLIT_MARKER __asm__("\n___stg_split_marker:");
 668 #else
 669 #define __STG_SPLIT_MARKER __asm__("\n__stg_split_marker:");
 670 #endif
 671 #else
 672 #define __STG_SPLIT_MARKER /* nothing */
 673 #endif
 674
 675 /* -----------------------------------------------------------------------------
 676    Closure and Info Macros with casting.
 677
 678    We don't want to mess around with casts in the generated C code, so
 679    we use these casting versions of the closure/info tables macros.
 680    -------------------------------------------------------------------------- */
 681
 682 #define SET_HDR_(c,info,ccs) \
 683    SET_HDR((StgClosure *)(c),(StgInfoTable *)(info),ccs)
 684
 685 /* -----------------------------------------------------------------------------
 686    Saving context for exit from the STG world, and loading up context
 687    on entry to STG code.
 688
 689    We save all the STG registers (that is, the ones that are mapped to
 690    machine registers) in their places in the TSO.
 691
 692    The stack registers go into the current stack object, and the
 693    current nursery is updated from the heap pointer.
 694
 695    These functions assume that BaseReg is loaded appropriately (if
 696    we have one).
 697    -------------------------------------------------------------------------- */
 698
 699 #if IN_STG_CODE
 700
 701 static __inline__ void
 702 SaveThreadState(void)
 703 {
 704   StgTSO *tso;
 705
 706   /* Don't need to save REG_Base, it won't have changed. */
 707
 708   tso = CurrentTSO;
 709   tso->sp       = Sp;
 710   tso->su       = Su;
 711   CloseNursery(Hp);
 712
 713 #ifdef REG_CurrentTSO
 714   SAVE_CurrentTSO = tso;
 715 #endif
 716 #ifdef REG_CurrentNursery
 717   SAVE_CurrentNursery = CurrentNursery;
 718 #endif
 719 #if defined(PROFILING)
 720   CurrentTSO->prof.CCCS = CCCS;
 721 #endif
 722 }
 723
 724 static __inline__ void
 725 LoadThreadState (void)
 726 {
 727   StgTSO *tso;
 728
 729 #ifdef REG_CurrentTSO
 730   CurrentTSO = SAVE_CurrentTSO;
 731 #endif
 732
 733   tso = CurrentTSO;
 734   Sp    = tso->sp;
 735   Su    = tso->su;
 736   SpLim = (P_)&(tso->stack) + RESERVED_STACK_WORDS;
 737   OpenNursery(Hp,HpLim);
 738
 739 #ifdef REG_CurrentNursery
 740   CurrentNursery = SAVE_CurrentNursery;
 741 #endif
 742 # if defined(PROFILING)
 743   CCCS = CurrentTSO->prof.CCCS;
 744 # endif
 745 }
 746
 747 #endif
 748
 749 /* -----------------------------------------------------------------------------
 750    Module initialisation
 751    -------------------------------------------------------------------------- */
 752
 753 #define PUSH_INIT_STACK(reg_function)           \
 754         *(Sp++) = (W_)reg_function
 755
 756 #define POP_INIT_STACK()                        \
 757         *(--Sp)
 758
 759 #define START_MOD_INIT(reg_mod_name)            \
 760         static int _module_registered = 0;      \
 761         FN_(reg_mod_name) {                     \
 762             FB_;                                \
 763             if (! _module_registered) {         \
 764                 _module_registered = 1;         \
 765                 {
 766             /* extern decls go here, followed by init code */
 767
 768 #define REGISTER_FOREIGN_EXPORT(reg_fe_binder)  \
 769         STGCALL1(getStablePtr,reg_fe_binder)
 770
 771 #define REGISTER_IMPORT(reg_mod_name)           \
 772         PUSH_INIT_STACK(reg_mod_name)
 773
 774 #define END_MOD_INIT()                          \
 775         }};                                     \
 776         JMP_(POP_INIT_STACK());                 \
 777         FE_ }
 778
 779 /* -----------------------------------------------------------------------------
 780    Support for _ccall_GC_ and _casm_GC.
 781    -------------------------------------------------------------------------- */
 782
 783 /*
 784  * Suspending/resuming threads for doing external C-calls (_ccall_GC).
 785  * These functions are defined in rts/Schedule.c.
 786  */
 787 StgInt        suspendThread ( StgRegTable * );
 788 StgRegTable * resumeThread  ( StgInt );
 789
 790 #define SUSPEND_THREAD(token)                   \
 791    SaveThreadState();                           \
 792    token = suspendThread(BaseReg);
 793
 794 #ifdef SMP
 795 #define RESUME_THREAD(token)                    \
 796     BaseReg = resumeThread(token);              \
 797     LoadThreadState();
 798 #else
 799 #define RESUME_THREAD(token)                    \
 800    (void)resumeThread(token);                   \
 801    LoadThreadState();
 802 #endif
 803
 804 #endif /* STGMACROS_H */
 805