StgCmmHeap.hs 20.7 KB
Newer Older
1 2 3 4 5 6 7 8 9
-----------------------------------------------------------------------------
--
-- Stg to C--: heap management functions
--
-- (c) The University of Glasgow 2004-2006
--
-----------------------------------------------------------------------------

module StgCmmHeap (
10 11
        getVirtHp, setVirtHp, setRealHp,
        getHpRelOffset, hpRel,
12

13
        entryHeapCheck, altHeapCheck,
14

15 16
        mkVirtHeapOffsets, mkVirtConstrOffsets,
        mkStaticClosureFields, mkStaticClosure,
17

18
        allocDynClosure, allocDynClosureCmm, emitSetDynHdr
19 20 21 22
    ) where

#include "HsVersions.h"

23
import CmmType
24 25 26 27 28 29 30 31 32 33 34
import StgSyn
import CLabel
import StgCmmLayout
import StgCmmUtils
import StgCmmMonad
import StgCmmProf
import StgCmmTicky
import StgCmmGran
import StgCmmClosure
import StgCmmEnv

35
import MkGraph
36 37

import SMRep
38
import Cmm
39 40 41
import CmmUtils
import CostCentre
import Outputable
42
import IdInfo( CafInfo(..), mayHaveCafRefs )
43
import Module
44
import FastString( mkFastString, fsLit )
45
import Constants
46
import DynFlags
47 48

-----------------------------------------------------------
49
--              Initialise dynamic heap objects
50 51 52
-----------------------------------------------------------

allocDynClosure
Simon Marlow's avatar
Simon Marlow committed
53 54
        :: CmmInfoTable
        -> LambdaFormInfo
55 56 57 58 59 60 61 62 63 64
        -> CmmExpr              -- Cost Centre to stick in the object
        -> CmmExpr              -- Cost Centre to blame for this alloc
                                -- (usually the same; sometimes "OVERHEAD")

        -> [(NonVoid StgArg, VirtualHpOffset)]  -- Offsets from start of object
                                                -- ie Info ptr has offset zero.
                                                -- No void args in here
        -> FCode (LocalReg, CmmAGraph)

allocDynClosureCmm
Simon Marlow's avatar
Simon Marlow committed
65
        :: CmmInfoTable -> LambdaFormInfo -> CmmExpr -> CmmExpr
66 67 68 69
        -> [(CmmExpr, VirtualHpOffset)]
        -> FCode (LocalReg, CmmAGraph)

-- allocDynClosure allocates the thing in the heap,
70
-- and modifies the virtual Hp to account for this.
71 72 73
-- The second return value is the graph that sets the value of the
-- returned LocalReg, which should point to the closure after executing
-- the graph.
74 75 76 77 78

-- Note [Return a LocalReg]
-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-- allocDynClosure returns a LocalReg, not a (Hp+8) CmmExpr.
-- Reason:
79 80 81 82 83
--      ...allocate object...
--      obj = Hp + 8
--      y = f(z)
--      ...here obj is still valid,
--         but Hp+8 means something quite different...
84 85


Simon Marlow's avatar
Simon Marlow committed
86
allocDynClosure info_tbl lf_info use_cc _blame_cc args_w_offsets
87 88
  = do  { let (args, offsets) = unzip args_w_offsets
        ; cmm_args <- mapM getArgAmode args     -- No void args
Simon Marlow's avatar
Simon Marlow committed
89 90
        ; allocDynClosureCmm info_tbl lf_info
                             use_cc _blame_cc (zip cmm_args offsets)
91 92
        }

Simon Marlow's avatar
Simon Marlow committed
93
allocDynClosureCmm info_tbl lf_info use_cc _blame_cc amodes_w_offsets
94 95 96
  = do  { virt_hp <- getVirtHp

        -- SAY WHAT WE ARE ABOUT TO DO
Simon Marlow's avatar
Simon Marlow committed
97 98 99
        ; let rep = cit_rep info_tbl
        ; tickyDynAlloc rep lf_info
        ; profDynAlloc rep use_cc
100 101 102 103 104 105 106 107

        -- FIND THE OFFSET OF THE INFO-PTR WORD
        ; let   info_offset = virt_hp + 1
                -- info_offset is the VirtualHpOffset of the first
                -- word of the new object
                -- Remember, virtHp points to last allocated word,
                -- ie 1 *before* the info-ptr word of new object.

Simon Marlow's avatar
Simon Marlow committed
108
                info_ptr = CmmLit (CmmLabel (cit_lbl info_tbl))
109 110 111

        -- ALLOCATE THE OBJECT
        ; base <- getHpRelOffset info_offset
112
        ; emitComment $ mkFastString "allocDynClosure"
113 114 115 116 117
        ; emitSetDynHdr base info_ptr  use_cc
        ; let (cmm_args, offsets) = unzip amodes_w_offsets
        ; hpStore base cmm_args offsets

        -- BUMP THE VIRTUAL HEAP POINTER
Simon Marlow's avatar
Simon Marlow committed
118
        ; setVirtHp (virt_hp + heapClosureSize rep)
119 120 121 122 123

        -- Assign to a temporary and return
        -- Note [Return a LocalReg]
        ; hp_rel <- getHpRelOffset info_offset
        ; getCodeR $ assignTemp hp_rel }
124 125

emitSetDynHdr :: CmmExpr -> CmmExpr -> CmmExpr -> FCode ()
126
emitSetDynHdr base info_ptr ccs
127 128 129 130
  = hpStore base header [0..]
  where
    header :: [CmmExpr]
    header = [info_ptr] ++ dynProfHdr ccs
131 132 133
        -- ToDo: Gransim stuff
        -- ToDo: Parallel stuff
        -- No ticky header
134 135 136 137 138 139

hpStore :: CmmExpr -> [CmmExpr] -> [VirtualHpOffset] -> FCode ()
-- Store the item (expr,off) in base[off]
hpStore base vals offs
  = emit (catAGraphs (zipWith mk_store vals offs))
  where
140
    mk_store val off = mkStore (cmmOffsetW base off) val
141 142 143


-----------------------------------------------------------
144
--              Layout of static closures
145 146 147 148 149
-----------------------------------------------------------

-- Make a static closure, adding on any extra padding needed for CAFs,
-- and adding a static link field if necessary.

150
mkStaticClosureFields
Simon Marlow's avatar
Simon Marlow committed
151
        :: CmmInfoTable
152
        -> CostCentreStack
153
        -> CafInfo
Simon Marlow's avatar
Simon Marlow committed
154
        -> Bool                 -- SRT is non-empty?
155 156
        -> [CmmLit]             -- Payload
        -> [CmmLit]             -- The full closure
Simon Marlow's avatar
Simon Marlow committed
157
mkStaticClosureFields info_tbl ccs caf_refs has_srt payload
158 159
  = mkStaticClosure info_lbl ccs payload padding
        static_link_field saved_info_field
160
  where
Simon Marlow's avatar
Simon Marlow committed
161
    info_lbl = cit_lbl info_tbl
162 163 164 165 166 167 168 169 170

    -- CAFs must have consistent layout, regardless of whether they
    -- are actually updatable or not.  The layout of a CAF is:
    --
    --        3 saved_info
    --        2 static_link
    --        1 indirectee
    --        0 info ptr
    --
Simon Marlow's avatar
Simon Marlow committed
171 172 173
    -- the static_link and saved_info fields must always be in the
    -- same place.  So we use isThunkRep rather than closureUpdReqd
    -- here:
174

Simon Marlow's avatar
Simon Marlow committed
175
    is_caf = isThunkRep (cit_rep info_tbl)
176

177 178 179
    padding
        | not is_caf = []
        | otherwise  = ASSERT(null payload) [mkIntCLit 0]
180 181

    static_link_field
Simon Marlow's avatar
Simon Marlow committed
182 183 184 185
        | is_caf || staticClosureNeedsLink has_srt info_tbl
        = [static_link_value]
        | otherwise
        = []
186 187

    saved_info_field
188 189
        | is_caf     = [mkIntCLit 0]
        | otherwise  = []
190

191
        -- For a static constructor which has NoCafRefs, we set the
192 193
        -- static link field to a non-zero value so the garbage
        -- collector will ignore it.
194
    static_link_value
195 196
        | mayHaveCafRefs caf_refs  = mkIntCLit 0
        | otherwise                = mkIntCLit 1  -- No CAF refs
197 198 199 200


mkStaticClosure :: CLabel -> CostCentreStack -> [CmmLit]
  -> [CmmLit] -> [CmmLit] -> [CmmLit] -> [CmmLit]
201
mkStaticClosure info_lbl ccs payload padding static_link_field saved_info_field
202 203
  =  [CmmLabel info_lbl]
  ++ variable_header_words
204
  ++ concatMap padLitToWord payload
205
  ++ padding
206 207 208 209
  ++ static_link_field
  ++ saved_info_field
  where
    variable_header_words
210 211 212 213
        =  staticGranHdr
        ++ staticParHdr
        ++ staticProfHdr ccs
        ++ staticTickyHdr
214

215 216
-- JD: Simon had ellided this padding, but without it the C back end asserts
-- failure. Maybe it's a bad assertion, and this padding is indeed unnecessary?
217 218 219 220 221 222 223 224 225 226 227
padLitToWord :: CmmLit -> [CmmLit]
padLitToWord lit = lit : padding pad_length
  where width = typeWidth (cmmLitType lit)
        pad_length = wORD_SIZE - widthInBytes width :: Int

        padding n | n <= 0 = []
                  | n `rem` 2 /= 0 = CmmInt 0 W8  : padding (n-1)
                  | n `rem` 4 /= 0 = CmmInt 0 W16 : padding (n-2)
                  | n `rem` 8 /= 0 = CmmInt 0 W32 : padding (n-4)
                  | otherwise      = CmmInt 0 W64 : padding (n-8)

228
-----------------------------------------------------------
229
--              Heap overflow checking
230 231 232 233 234 235 236 237 238 239 240 241
-----------------------------------------------------------

{- Note [Heap checks]
   ~~~~~~~~~~~~~~~~~~
Heap checks come in various forms.  We provide the following entry
points to the runtime system, all of which use the native C-- entry
convention.

  * gc() performs garbage collection and returns
    nothing to its caller

  * A series of canned entry points like
242
        r = gc_1p( r )
243 244
    where r is a pointer.  This performs gc, and
    then returns its argument r to its caller.
245

246
  * A series of canned entry points like
247
        gcfun_2p( f, x, y )
248 249 250 251 252 253 254 255 256
    where f is a function closure of arity 2
    This performs garbage collection, keeping alive the
    three argument ptrs, and then tail-calls f(x,y)

These are used in the following circumstances

* entryHeapCheck: Function entry
    (a) With a canned GC entry sequence
        f( f_clo, x:ptr, y:ptr ) {
257 258 259
             Hp = Hp+8
             if Hp > HpLim goto L
             ...
260 261 262
          L: HpAlloc = 8
             jump gcfun_2p( f_clo, x, y ) }
     Note the tail call to the garbage collector;
263
     it should do no register shuffling
264 265 266

    (b) No canned sequence
        f( f_clo, x:ptr, y:ptr, ...etc... ) {
267 268 269
          T: Hp = Hp+8
             if Hp > HpLim goto L
             ...
270
          L: HpAlloc = 8
271 272
             call gc()  -- Needs an info table
             goto T }
273 274

* altHeapCheck: Immediately following an eval
275 276
  Started as
        case f x y of r { (p,q) -> rhs }
277 278 279
  (a) With a canned sequence for the results of f
       (which is the very common case since
       all boxed cases return just one pointer
280 281 282 283 284 285
           ...
           r = f( x, y )
        K:      -- K needs an info table
           Hp = Hp+8
           if Hp > HpLim goto L
           ...code for rhs...
286

287 288
        L: r = gc_1p( r )
           goto K }
289

290 291 292 293
        Here, the info table needed by the call
        to gc_1p should be the *same* as the
        one for the call to f; the C-- optimiser
        spots this sharing opportunity)
294 295 296

   (b) No canned sequence for results of f
       Note second info table
297 298 299 300 301 302
           ...
           (r1,r2,r3) = call f( x, y )
        K:
           Hp = Hp+8
           if Hp > HpLim goto L
           ...code for rhs...
303

304 305
        L: call gc()    -- Extra info table here
           goto K
306 307 308

* generalHeapCheck: Anywhere else
  e.g. entry to thunk
309
       case branch *not* following eval,
310 311 312
       or let-no-escape
  Exactly the same as the previous case:

313 314 315 316
        K:      -- K needs an info table
           Hp = Hp+8
           if Hp > HpLim goto L
           ...
317

318 319
        L: call gc()
           goto K
320 321 322 323 324
-}

--------------------------------------------------------------
-- A heap/stack check at a function or thunk entry point.

325 326 327 328 329 330 331
entryHeapCheck :: ClosureInfo
               -> Int            -- Arg Offset
               -> Maybe LocalReg -- Function (closure environment)
               -> Int            -- Arity -- not same as len args b/c of voids
               -> [LocalReg]     -- Non-void args (empty for thunk)
               -> FCode ()
               -> FCode ()
332

333
entryHeapCheck cl_info offset nodeSet arity args code
334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363
  = do dflags <- getDynFlags

       let platform = targetPlatform dflags

           is_thunk = arity == 0
           is_fastf = case closureFunInfo cl_info of
                           Just (_, ArgGen _) -> False
                           _otherwise         -> True

           args' = map (CmmReg . CmmLocal) args
           setN = case nodeSet of
                          Just n  -> mkAssign nodeReg (CmmReg $ CmmLocal n)
                          Nothing -> mkAssign nodeReg $
                              CmmLit (CmmLabel $ staticClosureLabel platform cl_info)

           {- Thunks:          Set R1 = node, jump GCEnter1
              Function (fast): Set R1 = node, jump GCFun
              Function (slow): Set R1 = node, call generic_gc -}
           gc_call upd = setN <*> gc_lbl upd
           gc_lbl upd
               | is_thunk  = mkDirectJump (CmmReg $ CmmGlobal GCEnter1) [] sp
               | is_fastf  = mkDirectJump (CmmReg $ CmmGlobal GCFun) [] sp
               | otherwise = mkForeignJump Slow (CmmReg $ CmmGlobal GCFun) args' upd
               where sp = max offset upd
           {- DT (12/08/10) This is a little fishy, mainly the sp fix up amount.
            - This is since the ncg inserts spills before the stack/heap check.
            - This should be fixed up and then we won't need to fix up the Sp on
            - GC calls, but until then this fishy code works -}

       updfr_sz <- getUpdFrameOff
364 365 366 367 368 369 370 371 372 373
       heapCheck True (gc_call updfr_sz) code

{-
    -- This code is slightly outdated now and we could easily keep the above
    -- GC methods. However, there may be some performance gains to be made by
    -- using more specialised GC entry points. Since the semi generic GCFun
    -- entry needs to check the node and figure out what registers to save...
    -- if we provided and used more specialised GC entry points then these
    -- runtime decisions could be turned into compile time decisions.

374 375
    args'     = case fun of Just f  -> f : args
                            Nothing -> args
376
    arg_exprs = map (CmmReg . CmmLocal) args'
377
    gc_call updfr_sz
378
        | arity == 0 = mkJumpGC (CmmReg (CmmGlobal GCEnter1)) arg_exprs updfr_sz
379 380 381 382 383 384
        | otherwise =
            case gc_lbl args' of
                Just _lbl -> panic "StgCmmHeap.entryHeapCheck: not finished"
                            -- mkJumpGC (CmmLit (CmmLabel (mkRtsCodeLabel lbl)))
                            --         arg_exprs updfr_sz
                Nothing  -> mkCall generic_gc (GC, GC) [] [] updfr_sz
385

386
    gc_lbl :: [LocalReg] -> Maybe FastString
387
    gc_lbl [reg]
388 389 390 391 392 393 394 395 396 397 398
        | isGcPtrType ty  = Just (sLit "stg_gc_unpt_r1") -- "stg_gc_fun_1p"
        | isFloatType ty  = case width of
                              W32 -> Just (sLit "stg_gc_f1")
                              W64 -> Just (sLit "stg_gc_d1")
                              _other -> Nothing
        | width == wordWidth = Just (mkGcLabel "stg_gc_unbx_r1")
        | width == W64       = Just (mkGcLabel "stg_gc_l1")
        | otherwise          = Nothing
        where
          ty = localRegType reg
          width = typeWidth ty
399 400 401

    gc_lbl regs = gc_lbl_ptrs (map (isGcPtrType . localRegType) regs)

402
    gc_lbl_ptrs :: [Bool] -> Maybe FastString
403
    -- JD: TEMPORARY -- UNTIL THESE FUNCTIONS EXIST...
404 405 406
    --gc_lbl_ptrs [True,True]      = Just (sLit "stg_gc_fun_2p")
    --gc_lbl_ptrs [True,True,True] = Just (sLit "stg_gc_fun_3p")
    gc_lbl_ptrs _ = Nothing
407 408 409 410 411
-}


--------------------------------------------------------------
-- A heap/stack check at in a case alternative
412

413 414
altHeapCheck :: [LocalReg] -> FCode a -> FCode a
altHeapCheck regs code
415
  = do updfr_sz <- getUpdFrameOff
416 417
       gc_call_code <- gc_call updfr_sz
       heapCheck False gc_call_code code
418

419 420 421 422 423
  where
    reg_exprs = map (CmmReg . CmmLocal) regs

    gc_call sp =
        case rts_label regs of
Simon Marlow's avatar
Simon Marlow committed
424 425
             Just gc -> mkCall (CmmLit gc) (GC, GC) regs reg_exprs sp (0,[])
             Nothing -> mkCall generic_gc (GC, GC) [] [] sp (0,[])
426 427 428 429 430 431 432 433 434 435 436 437 438 439

    rts_label [reg]
        | isGcPtrType ty = Just (mkGcLabel "stg_gc_unpt_r1")
        | isFloatType ty = case width of
                                W32       -> Just (mkGcLabel "stg_gc_f1")
                                W64       -> Just (mkGcLabel "stg_gc_d1")
                                _         -> Nothing

        | width == wordWidth = Just (mkGcLabel "stg_gc_unbx_r1")
        | width == W64       = Just (mkGcLabel "stg_gc_l1")
        | otherwise          = Nothing
        where
            ty = localRegType reg
            width = typeWidth ty
440 441 442 443

    rts_label _ = Nothing


444 445 446 447 448 449 450
-- | The generic GC procedure; no params, no results
generic_gc :: CmmExpr
generic_gc = CmmLit $ mkGcLabel "stg_gc_noregs"

-- | Create a CLabel for calling a garbage collector entry point
mkGcLabel :: String -> CmmLit
mkGcLabel = (CmmLabel . (mkCmmCodeLabel rtsPackageId) . fsLit)
451 452

-------------------------------
453 454
heapCheck :: Bool -> CmmAGraph -> FCode a -> FCode a
heapCheck checkStack do_gc code
455
  = getHeapUsage $ \ hpHw ->
456 457
    -- Emit heap checks, but be sure to do it lazily so
    -- that the conditionals on hpHw don't cause a black hole
458
    do  { codeOnly $ do_checks checkStack hpHw do_gc
459 460 461 462
        ; tickyAllocHeap hpHw
        ; doGranAllocate hpHw
        ; setRealHp hpHw
        ; code }
463

464
do_checks :: Bool       -- Should we check the stack?
465 466
          -> WordOff    -- Heap headroom
          -> CmmAGraph  -- What to do on failure
467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487
          -> FCode ()
do_checks checkStack alloc do_gc = do
  loop_id <- newLabelC
  gc_id <- newLabelC
  emitLabel loop_id
  hp_check <- if alloc == 0
                 then return mkNop
                 else do
                   ifthen <- mkCmmIfThen hp_oflo (alloc_n <*> mkBranch gc_id)
                   return (mkAssign hpReg bump_hp <*> ifthen)

  if checkStack
     then emit =<< mkCmmIfThenElse sp_oflo (mkBranch gc_id) hp_check
     else emit hp_check

  emit $ mkComment (mkFastString "outOfLine should follow:")

  emitOutOfLine gc_id $
     mkComment (mkFastString "outOfLine here") <*>
     do_gc <*>
     mkBranch loop_id
488 489 490 491 492 493
                -- Test for stack pointer exhaustion, then
                -- bump heap pointer, and test for heap exhaustion
                -- Note that we don't move the heap pointer unless the
                -- stack check succeeds.  Otherwise we might end up
                -- with slop at the end of the current block, which can
                -- confuse the LDV profiler.
494
  where
495
    alloc_lit = CmmLit (mkIntCLit (alloc*wORD_SIZE)) -- Bytes
496 497
    bump_hp   = cmmOffsetExprB (CmmReg hpReg) alloc_lit

498 499 500
    -- Sp overflow if (Sp - CmmHighStack < SpLim)
    sp_oflo = CmmMachOp mo_wordULt
                  [CmmMachOp (MO_Sub (typeWidth (cmmRegType spReg)))
501 502
                             [CmmReg spReg, CmmLit CmmHighStackMark],
                   CmmReg spLimReg]
503

504 505 506 507 508 509 510
    -- Hp overflow if (Hp > HpLim)
    -- (Hp has been incremented by now)
    -- HpLim points to the LAST WORD of valid allocation space.
    hp_oflo = CmmMachOp mo_wordUGt
                  [CmmReg hpReg, CmmReg (CmmGlobal HpLim)]

    alloc_n = mkAssign (CmmGlobal HpAlloc) alloc_lit
511 512 513 514 515 516 517 518 519 520

{-

{- Unboxed tuple alternatives and let-no-escapes (the two most annoying
constructs to generate code for!)  For unboxed tuple returns, there
are an arbitrary number of possibly unboxed return values, some of
which will be in registers, and the others will be on the stack.  We
always organise the stack-resident fields into pointers &
non-pointers, and pass the number of each to the heap check code. -}

521 522 523 524 525 526 527
unbxTupleHeapCheck
        :: [(Id, GlobalReg)]    -- Live registers
        -> WordOff      -- no. of stack slots containing ptrs
        -> WordOff      -- no. of stack slots containing nonptrs
        -> CmmAGraph    -- code to insert in the failure path
        -> FCode ()
        -> FCode ()
528 529

unbxTupleHeapCheck regs ptrs nptrs fail_code code
530
  -- We can't manage more than 255 pointers/non-pointers
531 532
  -- in a generic heap check.
  | ptrs > 255 || nptrs > 255 = panic "altHeapCheck"
533
  | otherwise
534
  = initHeapUsage $ \ hpHw -> do
535 536 537 538 539
        { codeOnly $ do { do_checks 0 {- no stack check -} hpHw
                                    full_fail_code rts_label
                        ; tickyAllocHeap hpHw }
        ; setRealHp hpHw
        ; code }
540 541
  where
    full_fail_code  = fail_code `plusStmts` oneStmt assign_liveness
542 543 544 545
    assign_liveness = CmmAssign (CmmGlobal (VanillaReg 9))      -- Ho ho ho!
                                (CmmLit (mkWordCLit liveness))
    liveness        = mkRegLiveness regs ptrs nptrs
    rts_label       = CmmLit (CmmLabel (mkRtsCodeLabel (sLit "stg_gc_ut")))
546 547


548
{- Old Gransim com -- I have no idea whether it still makes sense (SLPJ Sep07)
549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567
For GrAnSim the code for doing a heap check and doing a context switch
has been separated. Especially, the HEAP_CHK macro only performs a
heap check. THREAD_CONTEXT_SWITCH should be used for doing a context
switch. GRAN_FETCH_AND_RESCHEDULE must be put at the beginning of
every slow entry code in order to simulate the fetching of
closures. If fetching is necessary (i.e. current closure is not local)
then an automatic context switch is done. -}


When failing a check, we save a return address on the stack and
jump to a pre-compiled code fragment that saves the live registers
and returns to the scheduler.

The return address in most cases will be the beginning of the basic
block in which the check resides, since we need to perform the check
again on re-entry because someone else might have stolen the resource
in the meantime.

%************************************************************************
568
%*                                                                      *
569
     Generic Heap/Stack Checks - used in the RTS
570
%*                                                                      *
571 572 573 574 575 576 577 578
%************************************************************************

\begin{code}
hpChkGen :: CmmExpr -> CmmExpr -> CmmExpr -> FCode ()
hpChkGen bytes liveness reentry
  = do_checks' bytes True assigns stg_gc_gen
  where
    assigns = mkStmts [
579 580 581
                CmmAssign (CmmGlobal (VanillaReg 9))  liveness,
                CmmAssign (CmmGlobal (VanillaReg 10)) reentry
                ]
582 583 584 585 586 587 588 589 590 591 592 593

-- a heap check where R1 points to the closure to enter on return, and
-- we want to assign to Sp[0] on failure (used in AutoApply.cmm:BUILD_PAP).
hpChkNodePointsAssignSp0 :: CmmExpr -> CmmExpr -> FCode ()
hpChkNodePointsAssignSp0 bytes sp0
  = do_checks' bytes True assign stg_gc_enter1
  where assign = oneStmt (CmmStore (CmmReg spReg) sp0)

stg_gc_gen    = CmmLit (CmmLabel (mkRtsCodeLabel (sLit "stg_gc_gen")))
\end{code}

-}