ghc/rts/StgMiscClosures.hc

   1 /* -----------------------------------------------------------------------------
   2  * $Id: StgMiscClosures.hc,v 1.69 2001/11/08 12:46:31 simonmar Exp $
   3  *
   4  * (c) The GHC Team, 1998-2000
   5  *
   6  * Entry code for various built-in closure types.
   7  *
   8  * ---------------------------------------------------------------------------*/
   9
  10 #include "Stg.h"
  11 #include "Rts.h"
  12 #include "RtsUtils.h"
  13 #include "RtsFlags.h"
  14 #include "StgMiscClosures.h"
  15 #include "Storage.h"
  16 #include "StoragePriv.h"
  17 #include "Profiling.h"
  18 #include "Prelude.h"
  19 #include "Schedule.h"
  20 #include "SMP.h"
  21 #if defined(GRAN) || defined(PAR)
  22 # include "GranSimRts.h"      /* for DumpRawGranEvent */
  23 # include "StgRun.h"    /* for StgReturn and register saving */
  24 #endif
  25
  26 #ifdef HAVE_STDIO_H
  27 #include <stdio.h>
  28 #endif
  29
  30 /* ToDo: make the printing of panics more win32-friendly, i.e.,
  31  *       pop up some lovely message boxes (as well).
  32  */
  33 #define DUMP_ERRMSG(msg) STGCALL2(fprintf,stderr,msg)
  34
  35 /*
  36   Template for the entry code of non-enterable closures.
  37 */
  38
  39 #define NON_ENTERABLE_ENTRY_CODE(type)                                  \
  40 STGFUN(stg_##type##_entry)                                                      \
  41 {                                                                       \
  42   FB_                                                                   \
  43     DUMP_ERRMSG(#type " object entered!\n");                            \
  44     STGCALL1(shutdownHaskellAndExit, EXIT_FAILURE);                     \
  45     return NULL;                                                        \
  46   FE_                                                                   \
  47 }
  48
  49
  50 /* -----------------------------------------------------------------------------
  51    Support for the bytecode interpreter.
  52    -------------------------------------------------------------------------- */
  53
  54 /* 9 bits of return code for constructors created by the interpreter. */
  55 FN_(stg_interp_constr_entry)
  56 {
  57   /* R1 points at the constructor */
  58   FB_
  59     /* STGCALL2(fprintf,stderr,"stg_interp_constr_entry (direct return)!\n"); */
  60     /* Pointless, since SET_TAG doesn't do anything */
  61     SET_TAG( GET_TAG(GET_INFO(R1.cl)));
  62     JMP_(ENTRY_CODE((P_)(*Sp)));
  63   FE_
  64 }
  65
  66 FN_(stg_interp_constr1_entry) { FB_ JMP_(RET_VEC((P_)(*Sp),0)); FE_ }
  67 FN_(stg_interp_constr2_entry) { FB_ JMP_(RET_VEC((P_)(*Sp),1)); FE_ }
  68 FN_(stg_interp_constr3_entry) { FB_ JMP_(RET_VEC((P_)(*Sp),2)); FE_ }
  69 FN_(stg_interp_constr4_entry) { FB_ JMP_(RET_VEC((P_)(*Sp),3)); FE_ }
  70 FN_(stg_interp_constr5_entry) { FB_ JMP_(RET_VEC((P_)(*Sp),4)); FE_ }
  71 FN_(stg_interp_constr6_entry) { FB_ JMP_(RET_VEC((P_)(*Sp),5)); FE_ }
  72 FN_(stg_interp_constr7_entry) { FB_ JMP_(RET_VEC((P_)(*Sp),6)); FE_ }
  73 FN_(stg_interp_constr8_entry) { FB_ JMP_(RET_VEC((P_)(*Sp),7)); FE_ }
  74
  75 /* Some info tables to be used when compiled code returns a value to
  76    the interpreter, i.e. the interpreter pushes one of these onto the
  77    stack before entering a value.  What the code does is to
  78    impedance-match the compiled return convention (in R1p/R1n/F1/D1 etc) to
  79    the interpreter's convention (returned value is on top of stack),
  80    and then cause the scheduler to enter the interpreter.
  81
  82    On entry, the stack (growing down) looks like this:
  83
  84       ptr to BCO holding return continuation
  85       ptr to one of these info tables.
  86
  87    The info table code, both direct and vectored, must:
  88       * push R1/F1/D1 on the stack, and its tag if necessary
  89       * push the BCO (so it's now on the stack twice)
  90       * Yield, ie, go to the scheduler.
  91
  92    Scheduler examines the t.o.s, discovers it is a BCO, and proceeds
  93    directly to the bytecode interpreter.  That pops the top element
  94    (the BCO, containing the return continuation), and interprets it.
  95    Net result: return continuation gets interpreted, with the
  96    following stack:
  97
  98       ptr to this BCO
  99       ptr to the info table just jumped thru
 100       return value
 101
 102    which is just what we want -- the "standard" return layout for the
 103    interpreter.  Hurrah!
 104
 105    Don't ask me how unboxed tuple returns are supposed to work.  We
 106    haven't got a good story about that yet.
 107 */
 108
 109 /* When the returned value is in R1 and it is a pointer, so doesn't
 110    need tagging ... */
 111 #define STG_CtoI_RET_R1p_Template(label)        \
 112    IFN_(label)                          \
 113    {                                    \
 114       StgPtr bco;                       \
 115       FB_                               \
 116       bco = ((StgPtr*)Sp)[1];           \
 117       Sp -= 1;                          \
 118       ((StgPtr*)Sp)[0] = R1.p;          \
 119       Sp -= 1;                          \
 120       ((StgPtr*)Sp)[0] = bco;           \
 121       JMP_(stg_yield_to_interpreter);   \
 122       FE_                               \
 123    }
 124
 125 STG_CtoI_RET_R1p_Template(stg_ctoi_ret_R1p_entry);
 126 STG_CtoI_RET_R1p_Template(stg_ctoi_ret_R1p_0_entry);
 127 STG_CtoI_RET_R1p_Template(stg_ctoi_ret_R1p_1_entry);
 128 STG_CtoI_RET_R1p_Template(stg_ctoi_ret_R1p_2_entry);
 129 STG_CtoI_RET_R1p_Template(stg_ctoi_ret_R1p_3_entry);
 130 STG_CtoI_RET_R1p_Template(stg_ctoi_ret_R1p_4_entry);
 131 STG_CtoI_RET_R1p_Template(stg_ctoi_ret_R1p_5_entry);
 132 STG_CtoI_RET_R1p_Template(stg_ctoi_ret_R1p_6_entry);
 133 STG_CtoI_RET_R1p_Template(stg_ctoi_ret_R1p_7_entry);
 134
 135 VEC_POLY_INFO_TABLE(stg_ctoi_ret_R1p,0, NULL/*srt*/, 0/*srt_off*/, 0/*srt_len*/, RET_BCO,, EF_);
 136
 137
 138
 139 /* When the returned value is in R1 and it isn't a pointer. */
 140 #define STG_CtoI_RET_R1n_Template(label)        \
 141    IFN_(label)                          \
 142    {                                    \
 143       StgPtr bco;                       \
 144       FB_                               \
 145       bco = ((StgPtr*)Sp)[1];           \
 146       Sp -= 1;                          \
 147       ((StgPtr*)Sp)[0] = (StgPtr)R1.i;  \
 148       Sp -= 1;                          \
 149       ((StgPtr*)Sp)[0] = (StgPtr)1; /* tag */   \
 150       Sp -= 1;                          \
 151       ((StgPtr*)Sp)[0] = bco;           \
 152       JMP_(stg_yield_to_interpreter);   \
 153       FE_                               \
 154    }
 155
 156 STG_CtoI_RET_R1n_Template(stg_ctoi_ret_R1n_entry);
 157 STG_CtoI_RET_R1n_Template(stg_ctoi_ret_R1n_0_entry);
 158 STG_CtoI_RET_R1n_Template(stg_ctoi_ret_R1n_1_entry);
 159 STG_CtoI_RET_R1n_Template(stg_ctoi_ret_R1n_2_entry);
 160 STG_CtoI_RET_R1n_Template(stg_ctoi_ret_R1n_3_entry);
 161 STG_CtoI_RET_R1n_Template(stg_ctoi_ret_R1n_4_entry);
 162 STG_CtoI_RET_R1n_Template(stg_ctoi_ret_R1n_5_entry);
 163 STG_CtoI_RET_R1n_Template(stg_ctoi_ret_R1n_6_entry);
 164 STG_CtoI_RET_R1n_Template(stg_ctoi_ret_R1n_7_entry);
 165
 166 VEC_POLY_INFO_TABLE(stg_ctoi_ret_R1n,0, NULL/*srt*/, 0/*srt_off*/, 0/*srt_len*/, RET_BCO,, EF_);
 167
 168
 169
 170 /* When the returned value is in F1 ... */
 171 #define STG_CtoI_RET_F1_Template(label)         \
 172    IFN_(label)                          \
 173    {                                    \
 174       StgPtr bco;                       \
 175       FB_                               \
 176       bco = ((StgPtr*)Sp)[1];           \
 177       Sp -= sizeofW(StgFloat);          \
 178       ASSIGN_FLT((W_*)Sp, F1);          \
 179       Sp -= 1;                          \
 180       ((StgPtr*)Sp)[0] = (StgPtr)sizeofW(StgFloat); \
 181       Sp -= 1;                          \
 182       ((StgPtr*)Sp)[0] = bco;           \
 183       JMP_(stg_yield_to_interpreter);   \
 184       FE_                               \
 185    }
 186
 187 STG_CtoI_RET_F1_Template(stg_ctoi_ret_F1_entry);
 188 STG_CtoI_RET_F1_Template(stg_ctoi_ret_F1_0_entry);
 189 STG_CtoI_RET_F1_Template(stg_ctoi_ret_F1_1_entry);
 190 STG_CtoI_RET_F1_Template(stg_ctoi_ret_F1_2_entry);
 191 STG_CtoI_RET_F1_Template(stg_ctoi_ret_F1_3_entry);
 192 STG_CtoI_RET_F1_Template(stg_ctoi_ret_F1_4_entry);
 193 STG_CtoI_RET_F1_Template(stg_ctoi_ret_F1_5_entry);
 194 STG_CtoI_RET_F1_Template(stg_ctoi_ret_F1_6_entry);
 195 STG_CtoI_RET_F1_Template(stg_ctoi_ret_F1_7_entry);
 196
 197 VEC_POLY_INFO_TABLE(stg_ctoi_ret_F1,0, NULL/*srt*/, 0/*srt_off*/, 0/*srt_len*/, RET_BCO,, EF_);
 198
 199
 200 /* When the returned value is in D1 ... */
 201 #define STG_CtoI_RET_D1_Template(label)         \
 202    IFN_(label)                          \
 203    {                                    \
 204       StgPtr bco;                       \
 205       FB_                               \
 206       bco = ((StgPtr*)Sp)[1];           \
 207       Sp -= sizeofW(StgDouble);         \
 208       ASSIGN_DBL((W_*)Sp, D1);          \
 209       Sp -= 1;                          \
 210       ((StgPtr*)Sp)[0] = (StgPtr)sizeofW(StgDouble); \
 211       Sp -= 1;                          \
 212       ((StgPtr*)Sp)[0] = bco;           \
 213       JMP_(stg_yield_to_interpreter);   \
 214       FE_                               \
 215    }
 216
 217 STG_CtoI_RET_D1_Template(stg_ctoi_ret_D1_entry);
 218 STG_CtoI_RET_D1_Template(stg_ctoi_ret_D1_0_entry);
 219 STG_CtoI_RET_D1_Template(stg_ctoi_ret_D1_1_entry);
 220 STG_CtoI_RET_D1_Template(stg_ctoi_ret_D1_2_entry);
 221 STG_CtoI_RET_D1_Template(stg_ctoi_ret_D1_3_entry);
 222 STG_CtoI_RET_D1_Template(stg_ctoi_ret_D1_4_entry);
 223 STG_CtoI_RET_D1_Template(stg_ctoi_ret_D1_5_entry);
 224 STG_CtoI_RET_D1_Template(stg_ctoi_ret_D1_6_entry);
 225 STG_CtoI_RET_D1_Template(stg_ctoi_ret_D1_7_entry);
 226
 227 VEC_POLY_INFO_TABLE(stg_ctoi_ret_D1,0, NULL/*srt*/, 0/*srt_off*/, 0/*srt_len*/, RET_BCO,, EF_);
 228
 229
 230 /* When the returned value a VoidRep ... */
 231 #define STG_CtoI_RET_V_Template(label)  \
 232    IFN_(label)                          \
 233    {                                    \
 234       StgPtr bco;                       \
 235       FB_                               \
 236       bco = ((StgPtr*)Sp)[1];           \
 237       Sp -= 1;                          \
 238       ((StgPtr*)Sp)[0] = 0; /* VoidRep tag */ \
 239       Sp -= 1;                          \
 240       ((StgPtr*)Sp)[0] = bco;           \
 241       JMP_(stg_yield_to_interpreter);   \
 242       FE_                               \
 243    }
 244
 245 STG_CtoI_RET_V_Template(stg_ctoi_ret_V_entry);
 246 STG_CtoI_RET_V_Template(stg_ctoi_ret_V_0_entry);
 247 STG_CtoI_RET_V_Template(stg_ctoi_ret_V_1_entry);
 248 STG_CtoI_RET_V_Template(stg_ctoi_ret_V_2_entry);
 249 STG_CtoI_RET_V_Template(stg_ctoi_ret_V_3_entry);
 250 STG_CtoI_RET_V_Template(stg_ctoi_ret_V_4_entry);
 251 STG_CtoI_RET_V_Template(stg_ctoi_ret_V_5_entry);
 252 STG_CtoI_RET_V_Template(stg_ctoi_ret_V_6_entry);
 253 STG_CtoI_RET_V_Template(stg_ctoi_ret_V_7_entry);
 254
 255 VEC_POLY_INFO_TABLE(stg_ctoi_ret_V,0, NULL/*srt*/, 0/*srt_off*/, 0/*srt_len*/, RET_BCO,, EF_);
 256
 257
 258 /* The other way round: when the interpreter returns a value to
 259    compiled code.  The stack looks like this:
 260
 261       return info table (pushed by compiled code)
 262       return value (pushed by interpreter)
 263
 264    If the value is ptr-rep'd, the interpreter simply returns to the
 265    scheduler, instructing it to ThreadEnterGHC.
 266
 267    Otherwise (unboxed return value), we replace the top stack word,
 268    which must be the tag, with stg_gc_unbx_r1_info (or f1_info or d1_info),
 269    and return to the scheduler, instructing it to ThreadRunGHC.
 270
 271    No supporting code needed!
 272 */
 273
 274
 275 /* Entering a BCO.  Heave it on the stack and defer to the
 276    scheduler. */
 277 INFO_TABLE(stg_BCO_info,stg_BCO_entry,4,0,BCO,,EF_,"BCO","BCO");
 278 STGFUN(stg_BCO_entry) {
 279   FB_
 280     Sp -= 1;
 281     Sp[0] = R1.w;
 282     JMP_(stg_yield_to_interpreter);
 283   FE_
 284 }
 285
 286
 287 /* -----------------------------------------------------------------------------
 288    Entry code for an indirection.
 289    -------------------------------------------------------------------------- */
 290
 291 INFO_TABLE(stg_IND_info,stg_IND_entry,1,0,IND,,EF_,0,0);
 292 STGFUN(stg_IND_entry)
 293 {
 294     FB_
 295     TICK_ENT_IND(Node); /* tick */
 296
 297     R1.p = (P_) ((StgInd*)R1.p)->indirectee;
 298     TICK_ENT_VIA_NODE();
 299     JMP_(ENTRY_CODE(*R1.p));
 300     FE_
 301 }
 302
 303 INFO_TABLE(stg_IND_STATIC_info,stg_IND_STATIC_entry,1,0,IND_STATIC,,EF_,0,0);
 304 STGFUN(stg_IND_STATIC_entry)
 305 {
 306     FB_
 307     TICK_ENT_IND(Node); /* tick */
 308     R1.p = (P_) ((StgIndStatic*)R1.p)->indirectee;
 309     TICK_ENT_VIA_NODE();
 310     JMP_(ENTRY_CODE(*R1.p));
 311     FE_
 312 }
 313
 314 INFO_TABLE(stg_IND_PERM_info,stg_IND_PERM_entry,1,1,IND_PERM,,EF_,"IND_PERM","IND_PERM");
 315 STGFUN(stg_IND_PERM_entry)
 316 {
 317     FB_
 318     /* Don't add INDs to granularity cost */
 319     /* Dont: TICK_ENT_IND(Node); for ticky-ticky; this ind is here only to help profiling */
 320
 321 #if defined(TICKY_TICKY) && !defined(PROFILING)
 322     /* TICKY_TICKY && !PROFILING means PERM_IND *replaces* an IND, rather than being extra  */
 323     TICK_ENT_PERM_IND(R1.p); /* tick */
 324 #endif
 325
 326     /* Enter PAP cost centre -- lexical scoping only */
 327     ENTER_CCS_PAP_CL(R1.cl);
 328
 329     /* For ticky-ticky, change the perm_ind to a normal ind on first
 330      * entry, so the number of ent_perm_inds is the number of *thunks*
 331      * entered again, not the number of subsequent entries.
 332      *
 333      * Since this screws up cost centres, we die if profiling and
 334      * ticky_ticky are on at the same time.  KSW 1999-01.
 335      */
 336
 337 #ifdef TICKY_TICKY
 338 #  ifdef PROFILING
 339 #    error Profiling and ticky-ticky do not mix at present!
 340 #  endif  /* PROFILING */
 341     SET_INFO((StgInd*)R1.p,&stg_IND_info);
 342 #endif /* TICKY_TICKY */
 343
 344     R1.p = (P_) ((StgInd*)R1.p)->indirectee;
 345
 346     /* Dont: TICK_ENT_VIA_NODE(); for ticky-ticky; as above */
 347
 348 #if defined(TICKY_TICKY) && !defined(PROFILING)
 349     TICK_ENT_VIA_NODE();
 350 #endif
 351
 352     JMP_(ENTRY_CODE(*R1.p));
 353     FE_
 354 }
 355
 356 INFO_TABLE(stg_IND_OLDGEN_info,stg_IND_OLDGEN_entry,1,1,IND_OLDGEN,,EF_,0,0);
 357 STGFUN(stg_IND_OLDGEN_entry)
 358 {
 359     FB_
 360     TICK_ENT_IND(Node); /* tick */
 361
 362     R1.p = (P_) ((StgInd*)R1.p)->indirectee;
 363     TICK_ENT_VIA_NODE();
 364     JMP_(ENTRY_CODE(*R1.p));
 365     FE_
 366 }
 367
 368 INFO_TABLE(stg_IND_OLDGEN_PERM_info,stg_IND_OLDGEN_PERM_entry,1,1,IND_OLDGEN_PERM,,EF_,0,0);
 369 STGFUN(stg_IND_OLDGEN_PERM_entry)
 370 {
 371     FB_
 372     /* Dont: TICK_ENT_IND(Node); for ticky-ticky; this ind is here only to help profiling */
 373
 374 #if defined(TICKY_TICKY) && !defined(PROFILING)
 375     /* TICKY_TICKY && !PROFILING means PERM_IND *replaces* an IND, rather than being extra  */
 376     TICK_ENT_PERM_IND(R1.p); /* tick */
 377 #endif
 378
 379     /* Enter PAP cost centre -- lexical scoping only */
 380     ENTER_CCS_PAP_CL(R1.cl);
 381
 382     /* see comment in IND_PERM */
 383 #ifdef TICKY_TICKY
 384 #  ifdef PROFILING
 385 #    error Profiling and ticky-ticky do not mix at present!
 386 #  endif  /* PROFILING */
 387     SET_INFO((StgInd*)R1.p,&stg_IND_OLDGEN_info);
 388 #endif /* TICKY_TICKY */
 389
 390     R1.p = (P_) ((StgInd*)R1.p)->indirectee;
 391     TICK_ENT_VIA_NODE();
 392     JMP_(ENTRY_CODE(*R1.p));
 393     FE_
 394 }
 395
 396 /* -----------------------------------------------------------------------------
 397    Entry code for a black hole.
 398
 399    Entering a black hole normally causes a cyclic data dependency, but
 400    in the concurrent world, black holes are synchronization points,
 401    and they are turned into blocking queues when there are threads
 402    waiting for the evaluation of the closure to finish.
 403    -------------------------------------------------------------------------- */
 404
 405 /* Note: a BLACKHOLE and BLACKHOLE_BQ must be big enough to be
 406  * overwritten with an indirection/evacuee/catch.  Thus we claim it
 407  * has 1 non-pointer word of payload (in addition to the pointer word
 408  * for the blocking queue in a BQ), which should be big enough for an
 409  * old-generation indirection.
 410  */
 411
 412 INFO_TABLE(stg_BLACKHOLE_info, stg_BLACKHOLE_entry,0,2,BLACKHOLE,,EF_,"BLACKHOLE","BLACKHOLE");
 413 STGFUN(stg_BLACKHOLE_entry)
 414 {
 415   FB_
 416 #if defined(GRAN)
 417     /* Before overwriting TSO_LINK */
 418     STGCALL3(GranSimBlock,CurrentTSO,CurrentProc,(StgClosure *)R1.p /*Node*/);
 419 #endif
 420
 421 #ifdef SMP
 422     {
 423       bdescr *bd = Bdescr(R1.p);
 424       if (bd->back != (bdescr *)BaseReg) {
 425         if (bd->gen->no >= 1 || bd->step->no >= 1) {
 426           CMPXCHG(R1.cl->header.info, &stg_BLACKHOLE_info, &stg_WHITEHOLE_info);
 427         } else {
 428           EXTFUN_RTS(stg_gc_enter_1_hponly);
 429           JMP_(stg_gc_enter_1_hponly);
 430         }
 431       }
 432     }
 433 #endif
 434     TICK_ENT_BH();
 435
 436     // Put ourselves on the blocking queue for this black hole
 437 #if defined(GRAN) || defined(PAR)
 438     // in fact, only difference is the type of the end-of-queue marker!
 439     CurrentTSO->link = END_BQ_QUEUE;
 440     ((StgBlockingQueue *)R1.p)->blocking_queue = (StgBlockingQueueElement *)CurrentTSO;
 441 #else
 442     CurrentTSO->link = END_TSO_QUEUE;
 443     ((StgBlockingQueue *)R1.p)->blocking_queue = CurrentTSO;
 444 #endif
 445     // jot down why and on what closure we are blocked
 446     CurrentTSO->why_blocked = BlockedOnBlackHole;
 447     CurrentTSO->block_info.closure = R1.cl;
 448
 449     // Change the CAF_BLACKHOLE into a BLACKHOLE_BQ_STATIC
 450     ((StgBlockingQueue *)R1.p)->header.info = &stg_BLACKHOLE_BQ_info;
 451
 452     // closure is mutable since something has just been added to its BQ
 453     recordMutable((StgMutClosure *)R1.cl);
 454
 455     // PAR: dumping of event now done in blockThread -- HWL
 456
 457     // stg_gen_block is too heavyweight, use a specialised one
 458     BLOCK_NP(1);
 459   FE_
 460 }
 461
 462 INFO_TABLE(stg_BLACKHOLE_BQ_info, stg_BLACKHOLE_BQ_entry,1,1,BLACKHOLE_BQ,,EF_,"BLACKHOLE","BLACKHOLE");
 463 STGFUN(stg_BLACKHOLE_BQ_entry)
 464 {
 465   FB_
 466 #if defined(GRAN)
 467     /* Before overwriting TSO_LINK */
 468     STGCALL3(GranSimBlock,CurrentTSO,CurrentProc,(StgClosure *)R1.p /*Node*/);
 469 #endif
 470
 471 #ifdef SMP
 472     {
 473       bdescr *bd = Bdescr(R1.p);
 474       if (bd->back != (bdescr *)BaseReg) {
 475         if (bd->gen->no >= 1 || bd->step->no >= 1) {
 476           CMPXCHG(R1.cl->header.info, &stg_BLACKHOLE_info, &stg_WHITEHOLE_info);
 477         } else {
 478           EXTFUN_RTS(stg_gc_enter_1_hponly);
 479           JMP_(stg_gc_enter_1_hponly);
 480         }
 481       }
 482     }
 483 #endif
 484
 485     TICK_ENT_BH();
 486
 487     /* Put ourselves on the blocking queue for this black hole */
 488     CurrentTSO->link = ((StgBlockingQueue *)R1.p)->blocking_queue;
 489     ((StgBlockingQueue *)R1.p)->blocking_queue = CurrentTSO;
 490     /* jot down why and on what closure we are blocked */
 491     CurrentTSO->why_blocked = BlockedOnBlackHole;
 492     CurrentTSO->block_info.closure = R1.cl;
 493 #ifdef SMP
 494     ((StgBlockingQueue *)R1.p)->header.info = &stg_BLACKHOLE_BQ_info;
 495 #endif
 496
 497     /* PAR: dumping of event now done in blockThread -- HWL */
 498
 499     /* stg_gen_block is too heavyweight, use a specialised one */
 500     BLOCK_NP(1);
 501   FE_
 502 }
 503
 504 /*
 505    Revertible black holes are needed in the parallel world, to handle
 506    negative acknowledgements of messages containing updatable closures.
 507    The idea is that when the original message is transmitted, the closure
 508    is turned into a revertible black hole...an object which acts like a
 509    black hole when local threads try to enter it, but which can be reverted
 510    back to the original closure if necessary.
 511
 512    It's actually a lot like a blocking queue (BQ) entry, because revertible
 513    black holes are initially set up with an empty blocking queue.
 514 */
 515
 516 #if defined(PAR) || defined(GRAN)
 517
 518 INFO_TABLE(stg_RBH_info, stg_RBH_entry,1,1,RBH,,EF_,0,0);
 519 STGFUN(stg_RBH_entry)
 520 {
 521   FB_
 522 # if defined(GRAN)
 523     /* mainly statistics gathering for GranSim simulation */
 524     STGCALL3(GranSimBlock,CurrentTSO,CurrentProc,(StgClosure *)R1.p /*Node*/);
 525 # endif
 526
 527     /* exactly the same as a BLACKHOLE_BQ_entry -- HWL */
 528     /* Put ourselves on the blocking queue for this black hole */
 529     CurrentTSO->link = ((StgBlockingQueue *)R1.p)->blocking_queue;
 530     ((StgBlockingQueue *)R1.p)->blocking_queue = CurrentTSO;
 531     /* jot down why and on what closure we are blocked */
 532     CurrentTSO->why_blocked = BlockedOnBlackHole;
 533     CurrentTSO->block_info.closure = R1.cl;
 534
 535     /* PAR: dumping of event now done in blockThread -- HWL */
 536
 537     /* stg_gen_block is too heavyweight, use a specialised one */
 538     BLOCK_NP(1);
 539   FE_
 540 }
 541
 542 INFO_TABLE(stg_RBH_Save_0_info, stg_RBH_Save_0_entry,0,2,CONSTR,,EF_,0,0);
 543 NON_ENTERABLE_ENTRY_CODE(RBH_Save_0);
 544
 545 INFO_TABLE(stg_RBH_Save_1_info, stg_RBH_Save_1_entry,1,1,CONSTR,,EF_,0,0);
 546 NON_ENTERABLE_ENTRY_CODE(RBH_Save_1);
 547
 548 INFO_TABLE(stg_RBH_Save_2_info, stg_RBH_Save_2_entry,2,0,CONSTR,,EF_,0,0);
 549 NON_ENTERABLE_ENTRY_CODE(RBH_Save_2);
 550 #endif /* defined(PAR) || defined(GRAN) */
 551
 552 /* identical to BLACKHOLEs except for the infotag */
 553 INFO_TABLE(stg_CAF_BLACKHOLE_info, stg_CAF_BLACKHOLE_entry,0,2,CAF_BLACKHOLE,,EF_,"CAF_BLACKHOLE","CAF_BLACKHOLE");
 554 STGFUN(stg_CAF_BLACKHOLE_entry)
 555 {
 556   FB_
 557 #if defined(GRAN)
 558     /* mainly statistics gathering for GranSim simulation */
 559     STGCALL3(GranSimBlock,CurrentTSO,CurrentProc,(StgClosure *)R1.p /*Node*/);
 560 #endif
 561
 562 #ifdef SMP
 563     {
 564       bdescr *bd = Bdescr(R1.p);
 565       if (bd->back != (bdescr *)BaseReg) {
 566         if (bd->gen_no >= 1 || bd->step->no >= 1) {
 567           CMPXCHG(R1.cl->header.info, &stg_CAF_BLACKHOLE_info, &stg_WHITEHOLE_info);
 568         } else {
 569           EXTFUN_RTS(stg_gc_enter_1_hponly);
 570           JMP_(stg_gc_enter_1_hponly);
 571         }
 572       }
 573     }
 574 #endif
 575
 576     TICK_ENT_BH();
 577
 578     // Put ourselves on the blocking queue for this black hole
 579 #if defined(GRAN) || defined(PAR)
 580     // in fact, only difference is the type of the end-of-queue marker!
 581     CurrentTSO->link = END_BQ_QUEUE;
 582     ((StgBlockingQueue *)R1.p)->blocking_queue = (StgBlockingQueueElement *)CurrentTSO;
 583 #else
 584     CurrentTSO->link = END_TSO_QUEUE;
 585     ((StgBlockingQueue *)R1.p)->blocking_queue = CurrentTSO;
 586 #endif
 587     // jot down why and on what closure we are blocked
 588     CurrentTSO->why_blocked = BlockedOnBlackHole;
 589     CurrentTSO->block_info.closure = R1.cl;
 590
 591     // Change the CAF_BLACKHOLE into a BLACKHOLE_BQ_STATIC
 592     ((StgBlockingQueue *)R1.p)->header.info = &stg_BLACKHOLE_BQ_info;
 593
 594     // closure is mutable since something has just been added to its BQ
 595     recordMutable((StgMutClosure *)R1.cl);
 596
 597     // PAR: dumping of event now done in blockThread -- HWL
 598
 599     // stg_gen_block is too heavyweight, use a specialised one
 600     BLOCK_NP(1);
 601   FE_
 602 }
 603
 604 #ifdef TICKY_TICKY
 605 INFO_TABLE(stg_SE_BLACKHOLE_info, stg_SE_BLACKHOLE_entry,0,2,SE_BLACKHOLE,,EF_,0,0);
 606 STGFUN(stg_SE_BLACKHOLE_entry)
 607 {
 608   FB_
 609     STGCALL3(fprintf,stderr,"SE_BLACKHOLE at %p entered!\n",R1.p);
 610     STGCALL1(shutdownHaskellAndExit,EXIT_FAILURE);
 611   FE_
 612 }
 613
 614 INFO_TABLE(SE_CAF_BLACKHOLE_info, SE_CAF_BLACKHOLE_entry,0,2,SE_CAF_BLACKHOLE,,EF_,0,0);
 615 STGFUN(stg_SE_CAF_BLACKHOLE_entry)
 616 {
 617   FB_
 618     STGCALL3(fprintf,stderr,"SE_CAF_BLACKHOLE at %p entered!\n",R1.p);
 619     STGCALL1(shutdownHaskellAndExit,EXIT_FAILURE);
 620   FE_
 621 }
 622 #endif
 623
 624 #ifdef SMP
 625 INFO_TABLE(stg_WHITEHOLE_info, stg_WHITEHOLE_entry,0,2,CONSTR_NOCAF_STATIC,,EF_,0,0);
 626 STGFUN(stg_WHITEHOLE_entry)
 627 {
 628   FB_
 629      JMP_(GET_ENTRY(R1.cl));
 630   FE_
 631 }
 632 #endif
 633
 634 /* -----------------------------------------------------------------------------
 635    Some static info tables for things that don't get entered, and
 636    therefore don't need entry code (i.e. boxed but unpointed objects)
 637    NON_ENTERABLE_ENTRY_CODE now defined at the beginning of the file
 638    -------------------------------------------------------------------------- */
 639
 640 INFO_TABLE(stg_TSO_info, stg_TSO_entry, 0,0,TSO,,EF_,"TSO","TSO");
 641 NON_ENTERABLE_ENTRY_CODE(TSO);
 642
 643 /* -----------------------------------------------------------------------------
 644    Evacuees are left behind by the garbage collector.  Any attempt to enter
 645    one is a real bug.
 646    -------------------------------------------------------------------------- */
 647
 648 INFO_TABLE(stg_EVACUATED_info,stg_EVACUATED_entry,1,0,EVACUATED,,EF_,0,0);
 649 NON_ENTERABLE_ENTRY_CODE(EVACUATED);
 650
 651 /* -----------------------------------------------------------------------------
 652    Weak pointers
 653
 654    Live weak pointers have a special closure type.  Dead ones are just
 655    nullary constructors (although they live on the heap - we overwrite
 656    live weak pointers with dead ones).
 657    -------------------------------------------------------------------------- */
 658
 659 INFO_TABLE(stg_WEAK_info,stg_WEAK_entry,0,4,WEAK,,EF_,"WEAK","WEAK");
 660 NON_ENTERABLE_ENTRY_CODE(WEAK);
 661
 662 INFO_TABLE_CONSTR(stg_DEAD_WEAK_info,stg_DEAD_WEAK_entry,0,1,0,CONSTR,,EF_,"DEAD_WEAK","DEAD_WEAK");
 663 NON_ENTERABLE_ENTRY_CODE(DEAD_WEAK);
 664
 665 /* -----------------------------------------------------------------------------
 666    NO_FINALIZER
 667
 668    This is a static nullary constructor (like []) that we use to mark an empty
 669    finalizer in a weak pointer object.
 670    -------------------------------------------------------------------------- */
 671
 672 INFO_TABLE_CONSTR(stg_NO_FINALIZER_info,stg_NO_FINALIZER_entry,0,0,0,CONSTR_NOCAF_STATIC,,EF_,0,0);
 673 NON_ENTERABLE_ENTRY_CODE(NO_FINALIZER);
 674
 675 SET_STATIC_HDR(stg_NO_FINALIZER_closure,stg_NO_FINALIZER_info,0/*CC*/,,EI_)
 676 , /*payload*/{} };
 677
 678 /* -----------------------------------------------------------------------------
 679    Foreign Objects are unlifted and therefore never entered.
 680    -------------------------------------------------------------------------- */
 681
 682 INFO_TABLE(stg_FOREIGN_info,stg_FOREIGN_entry,0,1,FOREIGN,,EF_,"FOREIGN","FOREIGN");
 683 NON_ENTERABLE_ENTRY_CODE(FOREIGN);
 684
 685 /* -----------------------------------------------------------------------------
 686    Stable Names are unlifted too.
 687    -------------------------------------------------------------------------- */
 688
 689 INFO_TABLE(stg_STABLE_NAME_info,stg_STABLE_NAME_entry,0,1,STABLE_NAME,,EF_,"STABLE_NAME","STABLE_NAME");
 690 NON_ENTERABLE_ENTRY_CODE(STABLE_NAME);
 691
 692 /* -----------------------------------------------------------------------------
 693    MVars
 694
 695    There are two kinds of these: full and empty.  We need an info table
 696    and entry code for each type.
 697    -------------------------------------------------------------------------- */
 698
 699 INFO_TABLE(stg_FULL_MVAR_info,stg_FULL_MVAR_entry,4,0,MVAR,,EF_,"MVAR","MVAR");
 700 NON_ENTERABLE_ENTRY_CODE(FULL_MVAR);
 701
 702 INFO_TABLE(stg_EMPTY_MVAR_info,stg_EMPTY_MVAR_entry,4,0,MVAR,,EF_,"MVAR","MVAR");
 703 NON_ENTERABLE_ENTRY_CODE(EMPTY_MVAR);
 704
 705 /* -----------------------------------------------------------------------------
 706    END_TSO_QUEUE
 707
 708    This is a static nullary constructor (like []) that we use to mark the
 709    end of a linked TSO queue.
 710    -------------------------------------------------------------------------- */
 711
 712 INFO_TABLE_CONSTR(stg_END_TSO_QUEUE_info,stg_END_TSO_QUEUE_entry,0,0,0,CONSTR_NOCAF_STATIC,,EF_,0,0);
 713 NON_ENTERABLE_ENTRY_CODE(END_TSO_QUEUE);
 714
 715 SET_STATIC_HDR(stg_END_TSO_QUEUE_closure,stg_END_TSO_QUEUE_info,0/*CC*/,,EI_)
 716 , /*payload*/{} };
 717
 718 /* -----------------------------------------------------------------------------
 719    Mutable lists
 720
 721    Mutable lists (used by the garbage collector) consist of a chain of
 722    StgMutClosures connected through their mut_link fields, ending in
 723    an END_MUT_LIST closure.
 724    -------------------------------------------------------------------------- */
 725
 726 INFO_TABLE_CONSTR(stg_END_MUT_LIST_info,stg_END_MUT_LIST_entry,0,0,0,CONSTR_NOCAF_STATIC,,EF_,0,0);
 727 NON_ENTERABLE_ENTRY_CODE(END_MUT_LIST);
 728
 729 SET_STATIC_HDR(stg_END_MUT_LIST_closure,stg_END_MUT_LIST_info,0/*CC*/,,EI_)
 730 , /*payload*/{} };
 731
 732 INFO_TABLE(stg_MUT_CONS_info, stg_MUT_CONS_entry, 1, 1, MUT_CONS, , EF_, 0, 0);
 733 NON_ENTERABLE_ENTRY_CODE(MUT_CONS);
 734
 735 /* -----------------------------------------------------------------------------
 736    Exception lists
 737    -------------------------------------------------------------------------- */
 738
 739 INFO_TABLE_CONSTR(stg_END_EXCEPTION_LIST_info,stg_END_EXCEPTION_LIST_entry,0,0,0,CONSTR_NOCAF_STATIC,,EF_,0,0);
 740 NON_ENTERABLE_ENTRY_CODE(END_EXCEPTION_LIST);
 741
 742 SET_STATIC_HDR(stg_END_EXCEPTION_LIST_closure,stg_END_EXCEPTION_LIST_info,0/*CC*/,,EI_)
 743 , /*payload*/{} };
 744
 745 INFO_TABLE(stg_EXCEPTION_CONS_info, stg_EXCEPTION_CONS_entry, 1, 1, CONSTR, , EF_, 0, 0);
 746 NON_ENTERABLE_ENTRY_CODE(EXCEPTION_CONS);
 747
 748 /* -----------------------------------------------------------------------------
 749    Arrays
 750
 751    These come in two basic flavours: arrays of data (StgArrWords) and arrays of
 752    pointers (StgArrPtrs).  They all have a similar layout:
 753
 754         ___________________________
 755         | Info | No. of | data....
 756         |  Ptr | Words  |
 757         ---------------------------
 758
 759    These are *unpointed* objects: i.e. they cannot be entered.
 760
 761    -------------------------------------------------------------------------- */
 762
 763 #define ArrayInfo(type)                                 \
 764 INFO_TABLE(stg_##type##_info, stg_##type##_entry, 0, 0, type, , EF_,"" # type "","" # type "");
 765
 766 ArrayInfo(ARR_WORDS);
 767 NON_ENTERABLE_ENTRY_CODE(ARR_WORDS);
 768 ArrayInfo(MUT_ARR_PTRS);
 769 NON_ENTERABLE_ENTRY_CODE(MUT_ARR_PTRS);
 770 ArrayInfo(MUT_ARR_PTRS_FROZEN);
 771 NON_ENTERABLE_ENTRY_CODE(MUT_ARR_PTRS_FROZEN);
 772
 773 #undef ArrayInfo
 774
 775 /* -----------------------------------------------------------------------------
 776    Mutable Variables
 777    -------------------------------------------------------------------------- */
 778
 779 INFO_TABLE(stg_MUT_VAR_info, stg_MUT_VAR_entry, 1, 1, MUT_VAR, , EF_, "MUT_VAR", "MUT_VAR");
 780 NON_ENTERABLE_ENTRY_CODE(MUT_VAR);
 781
 782 /* -----------------------------------------------------------------------------
 783    Standard Error Entry.
 784
 785    This is used for filling in vector-table entries that can never happen,
 786    for instance.
 787    -------------------------------------------------------------------------- */
 788 /* No longer used; we use NULL, because a) it never happens, right? and b)
 789    Windows doesn't like DLL entry points being used as static initialisers
 790 STGFUN(stg_error_entry)                                                 \
 791 {                                                                       \
 792   FB_                                                                   \
 793     DUMP_ERRMSG("fatal: stg_error_entry");                              \
 794     STGCALL1(shutdownHaskellAndExit, EXIT_FAILURE);                     \
 795     return NULL;                                                        \
 796   FE_                                                                   \
 797 }
 798 */
 799 /* -----------------------------------------------------------------------------
 800    Dummy return closure
 801
 802    Entering this closure will just return to the address on the top of the
 803    stack.  Useful for getting a thread in a canonical form where we can
 804    just enter the top stack word to start the thread.  (see deleteThread)
 805  * -------------------------------------------------------------------------- */
 806
 807 INFO_TABLE(stg_dummy_ret_info, stg_dummy_ret_entry, 0, 0, CONSTR_NOCAF_STATIC, , EF_, 0, 0);
 808 STGFUN(stg_dummy_ret_entry)
 809 {
 810   W_ ret_addr;
 811   FB_
 812   ret_addr = Sp[0];
 813   Sp++;
 814   JMP_(ENTRY_CODE(ret_addr));
 815   FE_
 816 }
 817 SET_STATIC_HDR(stg_dummy_ret_closure,stg_dummy_ret_info,CCS_DONT_CARE,,EI_)
 818 , /*payload*/{} };
 819
 820 /* -----------------------------------------------------------------------------
 821     Strict IO application - performing an IO action and entering its result.
 822
 823     rts_evalIO() lets you perform Haskell IO actions from outside of Haskell-land,
 824     returning back to you their result. Want this result to be evaluated to WHNF
 825     by that time, so that we can easily get at the int/char/whatever using the
 826     various get{Ty} functions provided by the RTS API.
 827
 828     forceIO takes care of this, performing the IO action and entering the
 829     results that comes back.
 830
 831  * -------------------------------------------------------------------------- */
 832
 833 #ifdef REG_R1
 834 INFO_TABLE_SRT_BITMAP(stg_forceIO_ret_info,stg_forceIO_ret_entry,0,0,0,0,RET_SMALL,,EF_,0,0);
 835 STGFUN(stg_forceIO_ret_entry)
 836 {
 837   FB_
 838   Sp++;
 839   Sp -= sizeofW(StgSeqFrame);
 840   PUSH_SEQ_FRAME(Sp);
 841   JMP_(GET_ENTRY(R1.cl));
 842 }
 843 #else
 844 INFO_TABLE_SRT_BITMAP(stg_forceIO_ret_info,stg_forceIO_ret_entry,0,0,0,0,RET_SMALL,,EF_,0,0);
 845 STGFUN(stg_forceIO_ret_entry)
 846 {
 847   StgClosure *rval;
 848   FB_
 849   rval = (StgClosure *)Sp[0];
 850   Sp += 2;
 851   Sp -= sizeofW(StgSeqFrame);
 852   PUSH_SEQ_FRAME(Sp);
 853   R1.cl = rval;
 854   JMP_(GET_ENTRY(R1.cl));
 855 }
 856 #endif
 857
 858 INFO_TABLE(stg_forceIO_info,stg_forceIO_entry,1,0,FUN_STATIC,,EF_,0,0);
 859 FN_(stg_forceIO_entry)
 860 {
 861   FB_
 862   /* Sp[0] contains the IO action we want to perform */
 863   R1.p  = (P_)Sp[0];
 864   /* Replace it with the return continuation that enters the result. */
 865   Sp[0] = (W_)&stg_forceIO_ret_info;
 866   Sp--;
 867   /* Push the RealWorld# tag and enter */
 868   Sp[0] =(W_)REALWORLD_TAG;
 869   JMP_(GET_ENTRY(R1.cl));
 870   FE_
 871 }
 872 SET_STATIC_HDR(stg_forceIO_closure,stg_forceIO_info,CCS_DONT_CARE,,EI_)
 873 , /*payload*/{} };
 874
 875
 876 /* -----------------------------------------------------------------------------
 877    CHARLIKE and INTLIKE closures.
 878
 879    These are static representations of Chars and small Ints, so that
 880    we can remove dynamic Chars and Ints during garbage collection and
 881    replace them with references to the static objects.
 882    -------------------------------------------------------------------------- */
 883
 884 #if defined(INTERPRETER) || defined(ENABLE_WIN32_DLL_SUPPORT)
 885 /*
 886  * When sticking the RTS in a DLL, we delay populating the
 887  * Charlike and Intlike tables until load-time, which is only
 888  * when we've got the real addresses to the C# and I# closures.
 889  *
 890  */
 891 static INFO_TBL_CONST StgInfoTable czh_static_info;
 892 static INFO_TBL_CONST StgInfoTable izh_static_info;
 893 #define Char_hash_static_info czh_static_info
 894 #define Int_hash_static_info izh_static_info
 895 #else
 896 #define Char_hash_static_info PrelBase_Czh_static_info
 897 #define Int_hash_static_info PrelBase_Izh_static_info
 898 #endif
 899
 900 #define CHARLIKE_HDR(n)                                         \
 901         {                                                       \
 902           STATIC_HDR(Char_hash_static_info, /* C# */            \
 903                          CCS_DONT_CARE),                        \
 904           data : n                                              \
 905         }
 906
 907 #define INTLIKE_HDR(n)                                          \
 908         {                                                       \
 909           STATIC_HDR(Int_hash_static_info,  /* I# */            \
 910                          CCS_DONT_CARE),                        \
 911           data : n                                              \
 912         }
 913
 914 /* put these in the *data* section, since the garbage collector relies
 915  * on the fact that static closures live in the data section.
 916  */
 917
 918 /* end the name with _closure, to convince the mangler this is a closure */
 919
 920 StgIntCharlikeClosure stg_CHARLIKE_closure[] = {
 921     CHARLIKE_HDR(0),
 922     CHARLIKE_HDR(1),
 923     CHARLIKE_HDR(2),
 924     CHARLIKE_HDR(3),
 925     CHARLIKE_HDR(4),
 926     CHARLIKE_HDR(5),
 927     CHARLIKE_HDR(6),
 928     CHARLIKE_HDR(7),
 929     CHARLIKE_HDR(8),
 930     CHARLIKE_HDR(9),
 931     CHARLIKE_HDR(10),
 932     CHARLIKE_HDR(11),
 933     CHARLIKE_HDR(12),
 934     CHARLIKE_HDR(13),
 935     CHARLIKE_HDR(14),
 936     CHARLIKE_HDR(15),
 937     CHARLIKE_HDR(16),
 938     CHARLIKE_HDR(17),
 939     CHARLIKE_HDR(18),
 940     CHARLIKE_HDR(19),
 941     CHARLIKE_HDR(20),
 942     CHARLIKE_HDR(21),
 943     CHARLIKE_HDR(22),
 944     CHARLIKE_HDR(23),
 945     CHARLIKE_HDR(24),
 946     CHARLIKE_HDR(25),
 947     CHARLIKE_HDR(26),
 948     CHARLIKE_HDR(27),
 949     CHARLIKE_HDR(28),
 950     CHARLIKE_HDR(29),
 951     CHARLIKE_HDR(30),
 952     CHARLIKE_HDR(31),
 953     CHARLIKE_HDR(32),
 954     CHARLIKE_HDR(33),
 955     CHARLIKE_HDR(34),
 956     CHARLIKE_HDR(35),
 957     CHARLIKE_HDR(36),
 958     CHARLIKE_HDR(37),
 959     CHARLIKE_HDR(38),
 960     CHARLIKE_HDR(39),
 961     CHARLIKE_HDR(40),
 962     CHARLIKE_HDR(41),
 963     CHARLIKE_HDR(42),
 964     CHARLIKE_HDR(43),
 965     CHARLIKE_HDR(44),
 966     CHARLIKE_HDR(45),
 967     CHARLIKE_HDR(46),
 968     CHARLIKE_HDR(47),
 969     CHARLIKE_HDR(48),
 970     CHARLIKE_HDR(49),
 971     CHARLIKE_HDR(50),
 972     CHARLIKE_HDR(51),
 973     CHARLIKE_HDR(52),
 974     CHARLIKE_HDR(53),
 975     CHARLIKE_HDR(54),
 976     CHARLIKE_HDR(55),
 977     CHARLIKE_HDR(56),
 978     CHARLIKE_HDR(57),
 979     CHARLIKE_HDR(58),
 980     CHARLIKE_HDR(59),
 981     CHARLIKE_HDR(60),
 982     CHARLIKE_HDR(61),
 983     CHARLIKE_HDR(62),
 984     CHARLIKE_HDR(63),
 985     CHARLIKE_HDR(64),
 986     CHARLIKE_HDR(65),
 987     CHARLIKE_HDR(66),
 988     CHARLIKE_HDR(67),
 989     CHARLIKE_HDR(68),
 990     CHARLIKE_HDR(69),
 991     CHARLIKE_HDR(70),
 992     CHARLIKE_HDR(71),
 993     CHARLIKE_HDR(72),
 994     CHARLIKE_HDR(73),
 995     CHARLIKE_HDR(74),
 996     CHARLIKE_HDR(75),
 997     CHARLIKE_HDR(76),
 998     CHARLIKE_HDR(77),
 999     CHARLIKE_HDR(78),
1000     CHARLIKE_HDR(79),
1001     CHARLIKE_HDR(80),
1002     CHARLIKE_HDR(81),
1003     CHARLIKE_HDR(82),
1004     CHARLIKE_HDR(83),
1005     CHARLIKE_HDR(84),
1006     CHARLIKE_HDR(85),
1007     CHARLIKE_HDR(86),
1008     CHARLIKE_HDR(87),
1009     CHARLIKE_HDR(88),
1010     CHARLIKE_HDR(89),
1011     CHARLIKE_HDR(90),
1012     CHARLIKE_HDR(91),
1013     CHARLIKE_HDR(92),
1014     CHARLIKE_HDR(93),
1015     CHARLIKE_HDR(94),
1016     CHARLIKE_HDR(95),
1017     CHARLIKE_HDR(96),
1018     CHARLIKE_HDR(97),
1019     CHARLIKE_HDR(98),
1020     CHARLIKE_HDR(99),
1021     CHARLIKE_HDR(100),
1022     CHARLIKE_HDR(101),
1023     CHARLIKE_HDR(102),
1024     CHARLIKE_HDR(103),
1025     CHARLIKE_HDR(104),
1026     CHARLIKE_HDR(105),
1027     CHARLIKE_HDR(106),
1028     CHARLIKE_HDR(107),
1029     CHARLIKE_HDR(108),
1030     CHARLIKE_HDR(109),
1031     CHARLIKE_HDR(110),
1032     CHARLIKE_HDR(111),
1033     CHARLIKE_HDR(112),
1034     CHARLIKE_HDR(113),
1035     CHARLIKE_HDR(114),
1036     CHARLIKE_HDR(115),
1037     CHARLIKE_HDR(116),
1038     CHARLIKE_HDR(117),
1039     CHARLIKE_HDR(118),
1040     CHARLIKE_HDR(119),
1041     CHARLIKE_HDR(120),
1042     CHARLIKE_HDR(121),
1043     CHARLIKE_HDR(122),
1044     CHARLIKE_HDR(123),
1045     CHARLIKE_HDR(124),
1046     CHARLIKE_HDR(125),
1047     CHARLIKE_HDR(126),
1048     CHARLIKE_HDR(127),
1049     CHARLIKE_HDR(128),
1050     CHARLIKE_HDR(129),
1051     CHARLIKE_HDR(130),
1052     CHARLIKE_HDR(131),
1053     CHARLIKE_HDR(132),
1054     CHARLIKE_HDR(133),
1055     CHARLIKE_HDR(134),
1056     CHARLIKE_HDR(135),
1057     CHARLIKE_HDR(136),
1058     CHARLIKE_HDR(137),
1059     CHARLIKE_HDR(138),
1060     CHARLIKE_HDR(139),
1061     CHARLIKE_HDR(140),
1062     CHARLIKE_HDR(141),
1063     CHARLIKE_HDR(142),
1064     CHARLIKE_HDR(143),
1065     CHARLIKE_HDR(144),
1066     CHARLIKE_HDR(145),
1067     CHARLIKE_HDR(146),
1068     CHARLIKE_HDR(147),
1069     CHARLIKE_HDR(148),
1070     CHARLIKE_HDR(149),
1071     CHARLIKE_HDR(150),
1072     CHARLIKE_HDR(151),
1073     CHARLIKE_HDR(152),
1074     CHARLIKE_HDR(153),
1075     CHARLIKE_HDR(154),
1076     CHARLIKE_HDR(155),
1077     CHARLIKE_HDR(156),
1078     CHARLIKE_HDR(157),
1079     CHARLIKE_HDR(158),
1080     CHARLIKE_HDR(159),
1081     CHARLIKE_HDR(160),
1082     CHARLIKE_HDR(161),
1083     CHARLIKE_HDR(162),
1084     CHARLIKE_HDR(163),
1085     CHARLIKE_HDR(164),
1086     CHARLIKE_HDR(165),
1087     CHARLIKE_HDR(166),
1088     CHARLIKE_HDR(167),
1089     CHARLIKE_HDR(168),
1090     CHARLIKE_HDR(169),
1091     CHARLIKE_HDR(170),
1092     CHARLIKE_HDR(171),
1093     CHARLIKE_HDR(172),
1094     CHARLIKE_HDR(173),
1095     CHARLIKE_HDR(174),
1096     CHARLIKE_HDR(175),
1097     CHARLIKE_HDR(176),
1098     CHARLIKE_HDR(177),
1099     CHARLIKE_HDR(178),
1100     CHARLIKE_HDR(179),
1101     CHARLIKE_HDR(180),
1102     CHARLIKE_HDR(181),
1103     CHARLIKE_HDR(182),
1104     CHARLIKE_HDR(183),
1105     CHARLIKE_HDR(184),
1106     CHARLIKE_HDR(185),
1107     CHARLIKE_HDR(186),
1108     CHARLIKE_HDR(187),
1109     CHARLIKE_HDR(188),
1110     CHARLIKE_HDR(189),
1111     CHARLIKE_HDR(190),
1112     CHARLIKE_HDR(191),
1113     CHARLIKE_HDR(192),
1114     CHARLIKE_HDR(193),
1115     CHARLIKE_HDR(194),
1116     CHARLIKE_HDR(195),
1117     CHARLIKE_HDR(196),
1118     CHARLIKE_HDR(197),
1119     CHARLIKE_HDR(198),
1120     CHARLIKE_HDR(199),
1121     CHARLIKE_HDR(200),
1122     CHARLIKE_HDR(201),
1123     CHARLIKE_HDR(202),
1124     CHARLIKE_HDR(203),
1125     CHARLIKE_HDR(204),
1126     CHARLIKE_HDR(205),
1127     CHARLIKE_HDR(206),
1128     CHARLIKE_HDR(207),
1129     CHARLIKE_HDR(208),
1130     CHARLIKE_HDR(209),
1131     CHARLIKE_HDR(210),
1132     CHARLIKE_HDR(211),
1133     CHARLIKE_HDR(212),
1134     CHARLIKE_HDR(213),
1135     CHARLIKE_HDR(214),
1136     CHARLIKE_HDR(215),
1137     CHARLIKE_HDR(216),
1138     CHARLIKE_HDR(217),
1139     CHARLIKE_HDR(218),
1140     CHARLIKE_HDR(219),
1141     CHARLIKE_HDR(220),
1142     CHARLIKE_HDR(221),
1143     CHARLIKE_HDR(222),
1144     CHARLIKE_HDR(223),
1145     CHARLIKE_HDR(224),
1146     CHARLIKE_HDR(225),
1147     CHARLIKE_HDR(226),
1148     CHARLIKE_HDR(227),
1149     CHARLIKE_HDR(228),
1150     CHARLIKE_HDR(229),
1151     CHARLIKE_HDR(230),
1152     CHARLIKE_HDR(231),
1153     CHARLIKE_HDR(232),
1154     CHARLIKE_HDR(233),
1155     CHARLIKE_HDR(234),
1156     CHARLIKE_HDR(235),
1157     CHARLIKE_HDR(236),
1158     CHARLIKE_HDR(237),
1159     CHARLIKE_HDR(238),
1160     CHARLIKE_HDR(239),
1161     CHARLIKE_HDR(240),
1162     CHARLIKE_HDR(241),
1163     CHARLIKE_HDR(242),
1164     CHARLIKE_HDR(243),
1165     CHARLIKE_HDR(244),
1166     CHARLIKE_HDR(245),
1167     CHARLIKE_HDR(246),
1168     CHARLIKE_HDR(247),
1169     CHARLIKE_HDR(248),
1170     CHARLIKE_HDR(249),
1171     CHARLIKE_HDR(250),
1172     CHARLIKE_HDR(251),
1173     CHARLIKE_HDR(252),
1174     CHARLIKE_HDR(253),
1175     CHARLIKE_HDR(254),
1176     CHARLIKE_HDR(255)
1177 };
1178
1179 StgIntCharlikeClosure stg_INTLIKE_closure[] = {
1180     INTLIKE_HDR(-16),   /* MIN_INTLIKE == -16 */
1181     INTLIKE_HDR(-15),
1182     INTLIKE_HDR(-14),
1183     INTLIKE_HDR(-13),
1184     INTLIKE_HDR(-12),
1185     INTLIKE_HDR(-11),
1186     INTLIKE_HDR(-10),
1187     INTLIKE_HDR(-9),
1188     INTLIKE_HDR(-8),
1189     INTLIKE_HDR(-7),
1190     INTLIKE_HDR(-6),
1191     INTLIKE_HDR(-5),
1192     INTLIKE_HDR(-4),
1193     INTLIKE_HDR(-3),
1194     INTLIKE_HDR(-2),
1195     INTLIKE_HDR(-1),
1196     INTLIKE_HDR(0),
1197     INTLIKE_HDR(1),
1198     INTLIKE_HDR(2),
1199     INTLIKE_HDR(3),
1200     INTLIKE_HDR(4),
1201     INTLIKE_HDR(5),
1202     INTLIKE_HDR(6),
1203     INTLIKE_HDR(7),
1204     INTLIKE_HDR(8),
1205     INTLIKE_HDR(9),
1206     INTLIKE_HDR(10),
1207     INTLIKE_HDR(11),
1208     INTLIKE_HDR(12),
1209     INTLIKE_HDR(13),
1210     INTLIKE_HDR(14),
1211     INTLIKE_HDR(15),
1212     INTLIKE_HDR(16)     /* MAX_INTLIKE == 16 */
1213 };