2 % (c) The AQUA Project, Glasgow University, 1994-1998
4 \section[DsCCall]{Desugaring \tr{_ccall_}s and \tr{_casm_}s}
15 #include "HsVersions.h"
21 import CoreUtils ( exprType, mkCoerce2 )
22 import Id ( Id, mkWildId )
23 import MkId ( mkFCallId, realWorldPrimId, mkPrimOpId )
24 import Maybes ( maybeToBool )
25 import ForeignCall ( ForeignCall(..), CCallSpec(..), CCallTarget(..), Safety, CCallConv(..) )
26 import DataCon ( splitProductType_maybe, dataConSourceArity, dataConWrapId )
27 import ForeignCall ( ForeignCall, CCallTarget(..) )
29 import TcType ( tcSplitTyConApp_maybe )
30 import Type ( Type, isUnLiftedType, mkFunTys, mkFunTy,
31 tyVarsOfType, mkForAllTys, mkTyConApp,
32 isPrimitiveType, splitTyConApp_maybe,
33 splitNewType_maybe, splitForAllTy_maybe,
38 import PrimOp ( PrimOp(..) )
39 import TysPrim ( realWorldStatePrimTy, intPrimTy,
40 byteArrayPrimTyCon, mutableByteArrayPrimTyCon,
43 import TyCon ( TyCon, tyConDataCons, tyConName )
44 import TysWiredIn ( unitDataConId,
45 unboxedSingletonDataCon, unboxedPairDataCon,
46 unboxedSingletonTyCon, unboxedPairTyCon,
47 trueDataCon, falseDataCon,
48 trueDataConId, falseDataConId,
49 listTyCon, charTyCon, stringTy,
52 import BasicTypes ( Boxity(..) )
53 import Literal ( mkMachInt )
54 import CStrings ( CLabelString )
55 import PrelNames ( Unique, hasKey, ioTyConKey, boolTyConKey, unitTyConKey,
56 int8TyConKey, int16TyConKey, int32TyConKey,
57 word8TyConKey, word16TyConKey, word32TyConKey
59 , marshalStringName, unmarshalStringName
60 , marshalObjectName, unmarshalObjectName
63 import VarSet ( varSetElems )
64 import Constants ( wORD_SIZE)
68 Desugaring of @ccall@s consists of adding some state manipulation,
69 unboxing any boxed primitive arguments and boxing the result if
72 The state stuff just consists of adding in
73 @PrimIO (\ s -> case s of { S# s# -> ... })@ in an appropriate place.
75 The unboxing is straightforward, as all information needed to unbox is
76 available from the type. For each boxed-primitive argument, we
79 _ccall_ foo [ r, t1, ... tm ] e1 ... em
83 case e1 of { T1# x1# ->
85 case em of { Tm# xm# -> xm#
86 ccall# foo [ r, t1#, ... tm# ] x1# ... xm#
90 The reboxing of a @_ccall_@ result is a bit tricker: the types don't
91 contain information about the state-pairing functions so we have to
92 keep a list of \tr{(type, s-p-function)} pairs. We transform as
95 ccall# foo [ r, t1#, ... tm# ] e1# ... em#
99 \ s# -> case (ccall# foo [ r, t1#, ... tm# ] s# e1# ... em#) of
100 (StateAnd<r># result# state#) -> (R# result#, realWorld#)
104 dsCCall :: CLabelString -- C routine to invoke
105 -> [CoreExpr] -- Arguments (desugared)
106 -> Safety -- Safety of the call
107 -> Bool -- True <=> really a "_casm_"
108 -> Type -- Type of the result: IO t
111 dsCCall lbl args may_gc is_asm result_ty
112 = mapAndUnzipDs unboxArg args `thenDs` \ (unboxed_args, arg_wrappers) ->
113 boxResult [] id Nothing result_ty `thenDs` \ (ccall_result_ty, res_wrapper) ->
114 getUniqueDs `thenDs` \ uniq ->
116 target | is_asm = CasmTarget lbl
117 | otherwise = StaticTarget lbl
118 the_fcall = CCall (CCallSpec target CCallConv may_gc)
119 the_prim_app = mkFCall uniq the_fcall unboxed_args ccall_result_ty
121 returnDs (foldr ($) (res_wrapper the_prim_app) arg_wrappers)
123 mkFCall :: Unique -> ForeignCall
124 -> [CoreExpr] -- Args
125 -> Type -- Result type
127 -- Construct the ccall. The only tricky bit is that the ccall Id should have
128 -- no free vars, so if any of the arg tys do we must give it a polymorphic type.
129 -- [I forget *why* it should have no free vars!]
131 -- mkCCall ... [s::StablePtr (a->b), x::Addr, c::Char]
133 -- Here we build a ccall thus
134 -- (ccallid::(forall a b. StablePtr (a -> b) -> Addr -> Char -> IO Addr))
136 mkFCall uniq the_fcall val_args res_ty
137 = mkApps (mkVarApps (Var the_fcall_id) tyvars) val_args
139 arg_tys = map exprType val_args
140 body_ty = (mkFunTys arg_tys res_ty)
141 tyvars = varSetElems (tyVarsOfType body_ty)
142 ty = mkForAllTys tyvars body_ty
143 the_fcall_id = mkFCallId uniq the_fcall ty
147 unboxArg :: CoreExpr -- The supplied argument
148 -> DsM (CoreExpr, -- To pass as the actual argument
149 CoreExpr -> CoreExpr -- Wrapper to unbox the arg
151 -- Example: if the arg is e::Int, unboxArg will return
152 -- (x#::Int#, \W. case x of I# x# -> W)
153 -- where W is a CoreExpr that probably mentions x#
156 -- Primtive types: nothing to unbox
157 | isPrimitiveType arg_ty
158 = returnDs (arg, \body -> body)
160 -- Recursive newtypes
161 | Just rep_ty <- splitNewType_maybe arg_ty
162 = unboxArg (mkCoerce2 rep_ty arg_ty arg)
165 | Just (tc,_) <- splitTyConApp_maybe arg_ty,
166 tc `hasKey` boolTyConKey
167 = newSysLocalDs intPrimTy `thenDs` \ prim_arg ->
168 returnDs (Var prim_arg,
169 \ body -> Case (Case arg (mkWildId arg_ty)
170 [(DataAlt falseDataCon,[],mkIntLit 0),
171 (DataAlt trueDataCon, [],mkIntLit 1)])
175 -- Data types with a single constructor, which has a single, primitive-typed arg
176 -- This deals with Int, Float etc
177 | is_product_type && data_con_arity == 1
178 = ASSERT(isUnLiftedType data_con_arg_ty1 ) -- Typechecker ensures this
179 newSysLocalDs arg_ty `thenDs` \ case_bndr ->
180 newSysLocalDs data_con_arg_ty1 `thenDs` \ prim_arg ->
181 returnDs (Var prim_arg,
182 \ body -> Case arg case_bndr [(DataAlt data_con,[prim_arg],body)]
185 -- Byte-arrays, both mutable and otherwise; hack warning
186 -- We're looking for values of type ByteArray, MutableByteArray
187 -- data ByteArray ix = ByteArray ix ix ByteArray#
188 -- data MutableByteArray s ix = MutableByteArray ix ix (MutableByteArray# s)
190 data_con_arity == 3 &&
191 maybeToBool maybe_arg3_tycon &&
192 (arg3_tycon == byteArrayPrimTyCon ||
193 arg3_tycon == mutableByteArrayPrimTyCon)
194 -- and, of course, it is an instance of CCallable
195 = newSysLocalDs arg_ty `thenDs` \ case_bndr ->
196 newSysLocalsDs data_con_arg_tys `thenDs` \ vars@[l_var, r_var, arr_cts_var] ->
197 returnDs (Var arr_cts_var,
198 \ body -> Case arg case_bndr [(DataAlt data_con,vars,body)]
201 | Just (tc, [arg_ty]) <- splitTyConApp_maybe arg_ty,
203 Just (cc,[]) <- splitTyConApp_maybe arg_ty,
205 -- String; dotnet only
206 = dsLookupGlobalId marshalStringName `thenDs` \ unpack_id ->
207 newSysLocalDs addrPrimTy `thenDs` \ prim_string ->
208 returnDs (Var prim_string,
211 io_ty = exprType body
212 (Just (_,[io_arg])) = tcSplitTyConApp_maybe io_ty
214 mkApps (Var unpack_id)
217 , Lam prim_string body
219 | Just (tc, [arg_ty]) <- splitTyConApp_maybe arg_ty,
220 tyConName tc == objectTyConName
221 -- Object; dotnet only
222 = dsLookupGlobalId marshalObjectName `thenDs` \ unpack_id ->
223 newSysLocalDs addrPrimTy `thenDs` \ prim_obj ->
224 returnDs (Var prim_obj,
227 io_ty = exprType body
228 (Just (_,[io_arg])) = tcSplitTyConApp_maybe io_ty
230 mkApps (Var unpack_id)
237 = getSrcLocDs `thenDs` \ l ->
238 pprPanic "unboxArg: " (ppr l <+> ppr arg_ty)
240 arg_ty = exprType arg
241 maybe_product_type = splitProductType_maybe arg_ty
242 is_product_type = maybeToBool maybe_product_type
243 Just (_, _, data_con, data_con_arg_tys) = maybe_product_type
244 data_con_arity = dataConSourceArity data_con
245 (data_con_arg_ty1 : _) = data_con_arg_tys
247 (_ : _ : data_con_arg_ty3 : _) = data_con_arg_tys
248 maybe_arg3_tycon = splitTyConApp_maybe data_con_arg_ty3
249 Just (arg3_tycon,_) = maybe_arg3_tycon
255 -> ((Maybe Type, CoreExpr -> CoreExpr) -> (Maybe Type, CoreExpr -> CoreExpr))
258 -> DsM (Type, CoreExpr -> CoreExpr)
260 -- Takes the result of the user-level ccall:
262 -- or maybe just t for an side-effect-free call
263 -- Returns a wrapper for the primitive ccall itself, along with the
264 -- type of the result of the primitive ccall. This result type
265 -- will be of the form
266 -- State# RealWorld -> (# State# RealWorld, t' #)
267 -- where t' is the unwrapped form of t. If t is simply (), then
268 -- the result type will be
269 -- State# RealWorld -> (# State# RealWorld #)
271 boxResult arg_ids augment mbTopCon result_ty
272 = case tcSplitTyConApp_maybe result_ty of
273 -- This split absolutely has to be a tcSplit, because we must
274 -- see the IO type; and it's a newtype which is transparent to splitTyConApp.
276 -- The result is IO t, so wrap the result in an IO constructor
277 Just (io_tycon, [io_res_ty]) | io_tycon `hasKey` ioTyConKey
278 -> resultWrapper io_res_ty `thenDs` \ res ->
279 let aug_res = augment res
283 | isUnboxedTupleType ty ->
284 let (Just (_, ls)) = splitTyConApp_maybe ty in tail ls
287 mk_alt (return_result extra_result_tys) aug_res
288 `thenDs` \ (ccall_res_ty, the_alt) ->
289 newSysLocalDs realWorldStatePrimTy `thenDs` \ state_id ->
291 io_data_con = head (tyConDataCons io_tycon)
294 Nothing -> dataConWrapId io_data_con
300 Case (App the_call (Var state_id))
301 (mkWildId ccall_res_ty)
305 returnDs (realWorldStatePrimTy `mkFunTy` ccall_res_ty, wrap)
307 return_result ts state anss
308 = mkConApp (tupleCon Unboxed (2 + length ts))
309 (Type realWorldStatePrimTy : Type io_res_ty : map Type ts ++
311 -- It isn't, so do unsafePerformIO
312 -- It's not conveniently available, so we inline it
313 other -> resultWrapper result_ty `thenDs` \ res ->
314 mk_alt return_result (augment res) `thenDs` \ (ccall_res_ty, the_alt) ->
316 wrap = \ the_call -> Case (App the_call (Var realWorldPrimId))
317 (mkWildId ccall_res_ty)
320 returnDs (realWorldStatePrimTy `mkFunTy` ccall_res_ty, wrap)
322 return_result state [ans] = ans
323 return_result _ _ = panic "return_result: expected single result"
325 mk_alt return_result (Nothing, wrap_result)
326 = -- The ccall returns ()
327 newSysLocalDs realWorldStatePrimTy `thenDs` \ state_id ->
329 the_rhs = return_result (Var state_id)
330 [wrap_result (panic "boxResult")]
332 ccall_res_ty = mkTyConApp unboxedSingletonTyCon [realWorldStatePrimTy]
333 the_alt = (DataAlt unboxedSingletonDataCon, [state_id], the_rhs)
335 returnDs (ccall_res_ty, the_alt)
337 mk_alt return_result (Just prim_res_ty, wrap_result)
338 -- The ccall returns a non-() value
339 | isUnboxedTupleType prim_res_ty
341 (Just (_, ls@(prim_res_ty1:extras))) = splitTyConApp_maybe prim_res_ty
342 arity = 1 + length ls
344 mapDs newSysLocalDs ls `thenDs` \ args_ids@(result_id:as) ->
345 newSysLocalDs realWorldStatePrimTy `thenDs` \ state_id ->
347 the_rhs = return_result (Var state_id)
348 (wrap_result (Var result_id) : map Var as)
349 ccall_res_ty = mkTyConApp (tupleTyCon Unboxed arity)
350 (realWorldStatePrimTy : ls)
351 the_alt = ( DataAlt (tupleCon Unboxed arity)
352 , (state_id : args_ids)
356 returnDs (ccall_res_ty, the_alt)
359 newSysLocalDs prim_res_ty `thenDs` \ result_id ->
360 newSysLocalDs realWorldStatePrimTy `thenDs` \ state_id ->
362 the_rhs = return_result (Var state_id)
363 [wrap_result (Var result_id)]
365 ccall_res_ty = mkTyConApp unboxedPairTyCon [realWorldStatePrimTy, prim_res_ty]
366 the_alt = (DataAlt unboxedPairDataCon, [state_id, result_id], the_rhs)
368 returnDs (ccall_res_ty, the_alt)
371 resultWrapper :: Type
372 -> DsM (Maybe Type, -- Type of the expected result, if any
373 CoreExpr -> CoreExpr) -- Wrapper for the result
374 resultWrapper result_ty
375 -- Base case 1: primitive types
376 | isPrimitiveType result_ty
377 = returnDs (Just result_ty, \e -> e)
379 -- Base case 2: the unit type ()
380 | Just (tc,_) <- maybe_tc_app, tc `hasKey` unitTyConKey
381 = returnDs (Nothing, \e -> Var unitDataConId)
383 -- Base case 3: the boolean type
384 | Just (tc,_) <- maybe_tc_app, tc `hasKey` boolTyConKey
386 (Just intPrimTy, \e -> Case e (mkWildId intPrimTy)
387 [(DEFAULT ,[],Var trueDataConId ),
388 (LitAlt (mkMachInt 0),[],Var falseDataConId)])
390 -- Recursive newtypes
391 | Just rep_ty <- splitNewType_maybe result_ty
392 = resultWrapper rep_ty `thenDs` \ (maybe_ty, wrapper) ->
393 returnDs (maybe_ty, \e -> mkCoerce2 result_ty rep_ty (wrapper e))
395 -- The type might contain foralls (eg. for dummy type arguments,
396 -- referring to 'Ptr a' is legal).
397 | Just (tyvar, rest) <- splitForAllTy_maybe result_ty
398 = resultWrapper rest `thenDs` \ (maybe_ty, wrapper) ->
399 returnDs (maybe_ty, \e -> Lam tyvar (wrapper e))
401 -- Data types with a single constructor, which has a single arg
402 | Just (tycon, tycon_arg_tys, data_con, data_con_arg_tys) <- splitProductType_maybe result_ty,
403 dataConSourceArity data_con == 1
405 (unwrapped_res_ty : _) = data_con_arg_tys
406 narrow_wrapper = maybeNarrow tycon
408 resultWrapper unwrapped_res_ty `thenDs` \ (maybe_ty, wrapper) ->
410 (maybe_ty, \e -> mkApps (Var (dataConWrapId data_con))
411 (map Type tycon_arg_tys ++ [wrapper (narrow_wrapper e)]))
413 -- Strings; 'dotnet' only.
414 | Just (tc, [arg_ty]) <- maybe_tc_app, tc == listTyCon,
415 Just (cc,[]) <- splitTyConApp_maybe arg_ty, cc == charTyCon
416 = dsLookupGlobalId unmarshalStringName `thenDs` \ pack_id ->
417 returnDs (Just addrPrimTy,
418 \ e -> App (Var pack_id) e)
420 -- Objects; 'dotnet' only.
421 | Just (tc, [arg_ty]) <- maybe_tc_app,
422 tyConName tc == objectTyConName
423 = dsLookupGlobalId unmarshalObjectName `thenDs` \ pack_id ->
424 returnDs (Just addrPrimTy,
425 \ e -> App (Var pack_id) e)
428 = pprPanic "resultWrapper" (ppr result_ty)
430 maybe_tc_app = splitTyConApp_maybe result_ty
432 -- When the result of a foreign call is smaller than the word size, we
433 -- need to sign- or zero-extend the result up to the word size. The C
434 -- standard appears to say that this is the responsibility of the
435 -- caller, not the callee.
437 maybeNarrow :: TyCon -> (CoreExpr -> CoreExpr)
439 | tycon `hasKey` int8TyConKey = \e -> App (Var (mkPrimOpId Narrow8IntOp)) e
440 | tycon `hasKey` int16TyConKey = \e -> App (Var (mkPrimOpId Narrow16IntOp)) e
441 | tycon `hasKey` int32TyConKey
442 && wORD_SIZE > 4 = \e -> App (Var (mkPrimOpId Narrow32IntOp)) e
444 | tycon `hasKey` word8TyConKey = \e -> App (Var (mkPrimOpId Narrow8WordOp)) e
445 | tycon `hasKey` word16TyConKey = \e -> App (Var (mkPrimOpId Narrow16WordOp)) e
446 | tycon `hasKey` word32TyConKey
447 && wORD_SIZE > 4 = \e -> App (Var (mkPrimOpId Narrow32WordOp)) e