2 % (c) The GRASP Project, Glasgow University, 1992-1998
4 \section[CgCon]{Code generation for constructors}
6 This module provides the support code for @StgToAbstractC@ to deal
7 with {\em constructors} on the RHSs of let(rec)s. See also
8 @CgClosure@, which deals with closures.
12 cgTopRhsCon, buildDynCon,
13 bindConArgs, bindUnboxedTupleComponents,
17 #include "HsVersions.h"
23 import AbsCUtils ( getAmodeRep )
24 import CgBindery ( getArgAmodes, bindNewToNode,
26 idInfoToAmode, stableAmodeIdInfo,
27 heapIdInfo, CgIdInfo, bindNewToStack
29 import CgStackery ( mkTaggedVirtStkOffsets, freeStackSlots,
32 import CgUsages ( getRealSp, getVirtSp, setRealAndVirtualSp,
34 import CgRetConv ( assignRegs )
35 import Constants ( mAX_INTLIKE, mIN_INTLIKE, mAX_CHARLIKE, mIN_CHARLIKE,
37 import CgHeapery ( allocDynClosure, inPlaceAllocDynClosure )
38 import CgTailCall ( performReturn, mkStaticAlgReturnCode, doTailCall,
39 mkUnboxedTupleReturnCode )
40 import CLabel ( mkClosureLabel )
41 import ClosureInfo ( mkConLFInfo, mkLFArgument,
42 layOutDynCon, layOutDynClosure,
43 layOutStaticClosure, closureSize
45 import CostCentre ( currentOrSubsumedCCS, dontCareCCS, CostCentreStack,
47 import DataCon ( DataCon, dataConName, dataConTag,
48 isUnboxedTupleCon, isNullaryDataCon, dataConId,
49 dataConWrapId, dataConRepArity
51 import Id ( Id, idName, idPrimRep )
52 import Literal ( Literal(..) )
53 import PrelInfo ( maybeCharLikeCon, maybeIntLikeCon )
54 import PrimRep ( PrimRep(..), isFollowableRep )
55 import Unique ( Uniquable(..) )
60 %************************************************************************
62 \subsection[toplevel-constructors]{Top-level constructors}
64 %************************************************************************
67 cgTopRhsCon :: Id -- Name of thing bound to this RHS
70 -> FCode (Id, CgIdInfo)
71 cgTopRhsCon id con args
72 = ASSERT(not (isDllConApp con args)) -- checks for litlit args too
73 ASSERT(length args == dataConRepArity con)
76 closure_label = mkClosureLabel name
77 lf_info = mkConLFInfo con
78 cg_id_info = stableAmodeIdInfo id (CLbl closure_label PtrRep) lf_info
83 getArgAmodes args `thenFC` \ amodes ->
86 (closure_info, amodes_w_offsets)
87 = layOutStaticClosure name getAmodeRep amodes lf_info
92 closure_label -- Labelled with the name on lhs of defn
93 closure_info -- Closure is static
94 (mkCCostCentreStack dontCareCCS) -- because it's static data
95 (map fst amodes_w_offsets)) -- Sorted into ptrs first, then nonptrs
100 returnFC (id, stableAmodeIdInfo id (CLbl closure_label PtrRep) lf_info)
103 %************************************************************************
105 %* non-top-level constructors *
107 %************************************************************************
108 \subsection[code-for-constructors]{The code for constructors}
111 buildDynCon :: Id -- Name of the thing to which this constr will
113 -> CostCentreStack -- Where to grab cost centre from;
114 -- current CCS if currentOrSubsumedCCS
115 -> DataCon -- The data constructor
116 -> [CAddrMode] -- Its args
117 -> FCode CgIdInfo -- Return details about how to find it
119 -- We used to pass a boolean indicating whether all the
120 -- args were of size zero, so we could use a static
121 -- construtor; but I concluded that it just isn't worth it.
122 -- Now I/O uses unboxed tuples there just aren't any constructors
123 -- with all size-zero args.
125 -- The reason for having a separate argument, rather than looking at
126 -- the addr modes of the args is that we may be in a "knot", and
127 -- premature looking at the args will cause the compiler to black-hole!
130 First we deal with the case of zero-arity constructors. Now, they
131 will probably be unfolded, so we don't expect to see this case much,
132 if at all, but it does no harm, and sets the scene for characters.
134 In the case of zero-arity constructors, or, more accurately, those
135 which have exclusively size-zero (VoidRep) args, we generate no code
139 buildDynCon binder cc con []
140 = returnFC (stableAmodeIdInfo binder
141 (CLbl (mkClosureLabel (idName (dataConWrapId con))) PtrRep)
145 The following three paragraphs about @Char@-like and @Int@-like
146 closures are obsolete, but I don't understand the details well enough
147 to properly word them, sorry. I've changed the treatment of @Char@s to
148 be analogous to @Int@s: only a subset is preallocated, because @Char@
149 has now 31 bits. Only literals are handled here. -- Qrczak
151 Now for @Char@-like closures. We generate an assignment of the
152 address of the closure to a temporary. It would be possible simply to
153 generate no code, and record the addressing mode in the environment,
154 but we'd have to be careful if the argument wasn't a constant --- so
155 for simplicity we just always asssign to a temporary.
157 Last special case: @Int@-like closures. We only special-case the
158 situation in which the argument is a literal in the range
159 @mIN_INTLIKE@..@mAX_INTLILKE@. NB: for @Char@-like closures we can
160 work with any old argument, but for @Int@-like ones the argument has
161 to be a literal. Reason: @Char@ like closures have an argument type
162 which is guaranteed in range.
164 Because of this, we use can safely return an addressing mode.
167 buildDynCon binder cc con [arg_amode]
168 | maybeIntLikeCon con && in_range_int_lit arg_amode
169 = returnFC (stableAmodeIdInfo binder (CIntLike arg_amode) (mkConLFInfo con))
171 in_range_int_lit (CLit (MachInt val)) = val <= mAX_INTLIKE && val >= mIN_INTLIKE
172 in_range_int_lit _other_amode = False
174 buildDynCon binder cc con [arg_amode]
175 | maybeCharLikeCon con && in_range_char_lit arg_amode
176 = returnFC (stableAmodeIdInfo binder (CCharLike arg_amode) (mkConLFInfo con))
178 in_range_char_lit (CLit (MachChar val)) = val <= mAX_CHARLIKE && val >= mIN_CHARLIKE
179 in_range_char_lit _other_amode = False
182 Now the general case.
185 buildDynCon binder ccs con args
186 = allocDynClosure closure_info use_cc blame_cc amodes_w_offsets `thenFC` \ hp_off ->
187 returnFC (heapIdInfo binder hp_off lf_info)
189 (closure_info, amodes_w_offsets)
190 = layOutDynClosure (idName binder) getAmodeRep args lf_info
191 lf_info = mkConLFInfo con
193 use_cc -- cost-centre to stick in the object
194 = if currentOrSubsumedCCS ccs
195 then CReg CurCostCentre
196 else mkCCostCentreStack ccs
198 blame_cc = use_cc -- cost-centre on which to blame the alloc (same)
202 %************************************************************************
204 %* constructor-related utility function: *
205 %* bindConArgs is called from cgAlt of a case *
207 %************************************************************************
208 \subsection[constructor-utilities]{@bindConArgs@: constructor-related utility}
210 @bindConArgs@ $con args$ augments the environment with bindings for the
211 binders $args$, assuming that we have just returned from a @case@ which
216 :: DataCon -> [Id] -- Constructor and args
220 = ASSERT(not (isUnboxedTupleCon con))
221 mapCs bind_arg args_w_offsets
223 bind_arg (arg, offset) = bindNewToNode arg offset mkLFArgument
224 (_, args_w_offsets) = layOutDynCon con idPrimRep args
227 Unboxed tuples are handled slightly differently - the object is
228 returned in registers and on the stack instead of the heap.
231 bindUnboxedTupleComponents
233 -> FCode ([MagicId], -- regs assigned
234 [(VirtualSpOffset,Int)], -- tag slots
235 Bool) -- any components on stack?
237 bindUnboxedTupleComponents args
238 = -- Assign as many components as possible to registers
239 let (arg_regs, leftovers) = assignRegs [] (map idPrimRep args)
240 (reg_args, stk_args) = splitAt (length arg_regs) args
243 -- Allocate the rest on the stack (ToDo: separate out pointers)
244 getVirtSp `thenFC` \ vsp ->
245 getRealSp `thenFC` \ rsp ->
246 let (top_sp, stk_offsets, tags) =
247 mkTaggedVirtStkOffsets rsp idPrimRep stk_args
250 -- The stack pointer points to the last stack-allocated component
251 setRealAndVirtualSp top_sp `thenC`
253 -- need to explicitly free any empty slots we just jumped over
254 (if vsp < rsp then freeStackSlots [vsp+1 .. rsp] else nopC) `thenC`
256 bindArgsToRegs reg_args arg_regs `thenC`
257 mapCs bindNewToStack stk_offsets `thenC`
258 returnFC (arg_regs,tags, not (null stk_offsets))
261 %************************************************************************
263 \subsubsection[CgRetConv-cgReturnDataCon]{Actually generate code for a constructor return}
265 %************************************************************************
268 Note: it's the responsibility of the @cgReturnDataCon@ caller to be
269 sure the @amodes@ passed don't conflict with each other.
271 cgReturnDataCon :: DataCon -> [CAddrMode] -> Code
273 cgReturnDataCon con amodes
274 = ASSERT(length amodes == dataConRepArity con)
275 getEndOfBlockInfo `thenFC` \ (EndOfBlockInfo args_sp sequel) ->
279 CaseAlts _ (Just (alts, Just (maybe_deflt, (_,deflt_lbl))))
280 | not (dataConTag con `is_elem` map fst alts)
282 -- Special case! We're returning a constructor to the default case
283 -- of an enclosing case. For example:
285 -- case (case e of (a,b) -> C a b) of
287 -- y -> ...<returning here!>...
290 -- if the default is a non-bind-default (ie does not use y),
291 -- then we should simply jump to the default join point;
294 Nothing -> performReturn AbsCNop {- No reg assts -} jump_to_join_point
295 Just _ -> build_it_then jump_to_join_point
297 is_elem = isIn "cgReturnDataCon"
298 jump_to_join_point sequel = absC (CJump (CLbl deflt_lbl CodePtrRep))
299 -- Ignore the sequel: we've already looked at it above
301 -- If the sequel is an update frame, we might be able to
302 -- do update in place...
304 | not (isNullaryDataCon con) -- no nullary constructors, please
305 && not (any isFollowableRep (map getAmodeRep amodes))
306 -- no ptrs please (generational gc...)
307 && closureSize closure_info <= mIN_UPD_SIZE
308 -- don't know the real size of the
309 -- thunk, so assume mIN_UPD_SIZE
311 -> -- get a new temporary and make it point to the updatee
314 temp = CTemp uniq PtrRep
317 profCtrC SLIT("TICK_UPD_CON_IN_PLACE")
318 [mkIntCLit (length amodes)] `thenC`
320 getSpRelOffset args_sp `thenFC` \ sp_rel ->
322 (CMacroExpr PtrRep UPD_FRAME_UPDATEE [CAddr sp_rel]))
325 -- stomp all over it with the new constructor
326 inPlaceAllocDynClosure closure_info temp (CReg CurCostCentre) stuff
329 -- don't forget to update Su from the update frame
330 absC (CMacroStmt UPDATE_SU_FROM_UPD_FRAME [CAddr sp_rel]) `thenC`
332 -- set Node to point to the closure being returned
333 -- (can't be done earlier: node might conflict with amodes)
334 absC (CAssign (CReg node) temp) `thenC`
336 -- pop the update frame off the stack, and do the proper
338 let new_sp = args_sp - updateFrameSize in
339 setEndOfBlockInfo (EndOfBlockInfo new_sp (OnStack new_sp)) $
340 performReturn (AbsCNop) (mkStaticAlgReturnCode con)
342 where (closure_info, stuff)
343 = layOutDynClosure (dataConName con)
344 getAmodeRep amodes lf_info
346 lf_info = mkConLFInfo con
348 other_sequel -- The usual case
350 | isUnboxedTupleCon con ->
351 -- Return unboxed tuple in registers
352 let (ret_regs, leftovers) =
353 assignRegs [] (map getAmodeRep amodes)
355 profCtrC SLIT("TICK_RET_UNBOXED_TUP")
356 [mkIntCLit (length amodes)] `thenC`
358 doTailCall amodes ret_regs
359 mkUnboxedTupleReturnCode
360 (length leftovers) {- fast args arity -}
361 AbsCNop {-no pending assigments-}
362 Nothing {-not a let-no-escape-}
363 False {-node doesn't point-}
366 build_it_then (mkStaticAlgReturnCode con)
369 move_to_reg :: CAddrMode -> MagicId -> AbstractC
370 move_to_reg src_amode dest_reg = CAssign (CReg dest_reg) src_amode
372 build_it_then return =
373 -- BUILD THE OBJECT IN THE HEAP
374 -- The first "con" says that the name bound to this
375 -- closure is "con", which is a bit of a fudge, but it only
378 -- This Id is also used to get a unique for a
379 -- temporary variable, if the closure is a CHARLIKE.
380 -- funnily enough, this makes the unique always come
382 buildDynCon (dataConId con) currentCCS con amodes `thenFC` \ idinfo ->
383 idInfoToAmode PtrRep idinfo `thenFC` \ amode ->
387 profCtrC SLIT("TICK_RET_NEW") [mkIntCLit (length amodes)] `thenC`
388 -- could use doTailCall here.
389 performReturn (move_to_reg amode node) return