2 /* --------------------------------------------------------------------------
3 * Translator: generates stg code from output of pattern matching
6 * The Hugs 98 system is Copyright (c) Mark P Jones, Alastair Reid, the
7 * Yale Haskell Group, and the Oregon Graduate Institute of Science and
8 * Technology, 1994-1999, All rights reserved. It is distributed as
9 * free software under the license in the file "License", which is
10 * included in the distribution.
12 * $RCSfile: translate.c,v $
14 * $Date: 1999/11/01 11:07:07 $
15 * ------------------------------------------------------------------------*/
24 #include "Assembler.h"
27 /* ---------------------------------------------------------------- */
29 static StgVar local stgOffset Args((Offset,List));
30 static StgVar local stgText Args((Text,List));
31 static StgRhs local stgRhs Args((Cell,Int,List,StgExpr));
32 static StgCaseAlt local stgCaseAlt Args((Cell,Int,List,StgExpr));
33 static StgExpr local stgExpr Args((Cell,Int,List,StgExpr));
35 /* ---------------------------------------------------------------- */
37 /* Association list storing globals assigned to */
38 /* dictionaries, tuples, etc */
39 List stgGlobals = NIL;
41 static StgVar local getSTGTupleVar Args((Cell));
43 static StgVar local getSTGTupleVar( Cell d )
45 Pair p = cellAssoc(d,stgGlobals);
46 /* Yoiks - only the Prelude sees Tuple decls! */
48 implementTuple(tupleOf(d));
49 p = cellAssoc(d,stgGlobals);
55 /* ---------------------------------------------------------------- */
57 static Cell local stgOffset(Offset o, List sc)
59 Cell r = cellAssoc(o,sc);
64 static Cell local stgText(Text t,List sc)
67 for (; nonNull(xs); xs=tl(xs)) {
70 if (!isOffset(v) && t == textOf(v)) {
77 /* ---------------------------------------------------------------- */
79 static StgRhs local stgRhs(e,co,sc,failExpr)
88 return stgOffset(e,sc);
91 return stgText(textOf(e),sc);
93 return getSTGTupleVar(e);
98 return mkStgCon(nameMkC,singleton(e));
100 return mkStgCon(nameMkI,singleton(e));
102 return mkStgCon(nameMkInteger,singleton(e));
104 return mkStgCon(nameMkD,singleton(e));
106 #if USE_ADDR_FOR_STRINGS
108 StgVar v = mkStgVar(mkStgCon(nameMkA,singleton(e)),NIL);
109 return mkStgLet(singleton(v),
110 makeStgApp(nameUnpackString,singleton(v)));
113 return mkStgApp(nameUnpackString,singleton(e));
116 return stgExpr(e,co,sc,namePMFail);
120 return stgExpr(e,co,sc,failExpr/*namePMFail*/);
124 static StgCaseAlt local stgCaseAlt(alt,co,sc,failExpr)
130 StgDiscr d = fst(alt);
131 Int da = discrArity(d);
134 for(i=1; i<=da; ++i) {
135 StgVar nv = mkStgVar(NIL,NIL);
137 sc = cons(pair(mkOffset(co+i),nv),sc);
139 return mkStgCaseAlt(d,vs,stgExpr(snd(alt),co+da,sc,failExpr));
142 static StgExpr local stgExpr(e,co,sc,failExpr)
151 return makeStgIf(stgExpr(fst3(snd(e)),co,sc,namePMFail),
152 stgExpr(snd3(snd(e)),co,sc,failExpr),
153 stgExpr(thd3(snd(e)),co,sc,failExpr));
157 List guards = reverse(snd(e));
159 for(; nonNull(guards); guards=tl(guards)) {
161 Cell c = stgExpr(fst(g),co,sc,namePMFail);
162 Cell rhs = stgExpr(snd(g),co,sc,failExpr);
163 e = makeStgIf(c,rhs,e);
169 StgExpr e2 = stgExpr(snd(snd(e)),co,sc,failExpr);
170 StgVar alt = mkStgVar(e2,NIL);
171 return mkStgLet(singleton(alt),stgExpr(fst(snd(e)),co,sc,alt));
175 List alts = snd(snd(e));
176 Cell scrut = stgExpr(fst(snd(e)),co,sc,namePMFail);
179 } else if (isChar(fst(hd(alts)))) {
181 StgDiscr d = fst(alt);
183 mkStgCon(nameMkC,singleton(d)),NIL);
184 StgExpr test = nameEqChar;
185 /* duplicates scrut but it should be atomic */
187 makeStgLet(singleton(c),
188 makeStgApp(test,doubleton(scrut,c))),
189 stgExpr(snd(alt),co,sc,failExpr),
190 stgExpr(ap(CASE,pair(fst(snd(e)),
191 tl(alts))),co,sc,failExpr));
194 for(; nonNull(alts); alts=tl(alts)) {
195 as = cons(stgCaseAlt(hd(alts),co,sc,failExpr),as);
201 singleton(mkStgDefault(mkStgVar(NIL,NIL),
209 Cell discr = snd3(nc);
211 Cell scrut = stgOffset(o,sc);
212 Cell h = getHead(discr);
213 Int da = discrArity(discr);
216 if (whatIs(h) == ADDPAT && argCount == 1) {
217 /* ADDPAT num dictIntegral
219 * let n = fromInteger num in
220 * if pmLe dictIntegral n scrut
221 * then let v = pmSubtract dictIntegral scrut v
225 Cell dictIntegral = arg(discr); /* Integral dictionary */
228 StgVar dIntegral = NIL;
230 /* bind dictionary */
231 dIntegral = stgRhs(dictIntegral,co,sc,namePMFail);
232 if (!isAtomic(dIntegral)) { /* wasn't atomic */
233 dIntegral = mkStgVar(dIntegral,NIL);
234 binds = cons(dIntegral,binds);
237 n = mkStgVar(mkStgCon(nameMkInteger,singleton(n)),NIL);
238 binds = cons(n,binds);
240 /* coerce number to right type (using Integral dict) */
241 n = mkStgVar(mkStgApp(
242 namePmFromInteger,doubleton(dIntegral,n)),NIL);
243 binds = cons(n,binds);
246 v = mkStgVar(mkStgApp(
247 namePmSubtract,tripleton(dIntegral,scrut,n)),NIL);
252 mkStgApp(namePmLe,tripleton(dIntegral,n,scrut)),
253 mkStgLet(singleton(v),
256 cons(pair(mkOffset(co),v),sc),
262 assert(isName(h) && argCount == 2);
264 /* This code is rather ugly.
265 * We ought to desugar it using one of the following:
266 * if (==) dEq (fromInt dNum pat) scrut
267 * if (==) dEq (fromInteger dNum pat) scrut
268 * if (==) dEq (fromFloat dFractional pat) scrut
269 * But it would be very hard to obtain the Eq dictionary
270 * from the Num or Fractional dictionary we have.
271 * Instead, we rely on the Prelude to supply 3 helper
272 * functions which do the test for us.
273 * primPmInt :: Num a => Int -> a -> Bool
274 * primPmInteger :: Num a => Integer -> a -> Bool
275 * primPmDouble :: Fractional a => Double -> a -> Bool
278 Cell dict = arg(fun(discr));
283 = h == nameFromInt ? nameMkI
284 : h == nameFromInteger ? nameMkInteger
287 = h == nameFromInt ? namePmInt
288 : h == nameFromInteger ? namePmInteger
294 for(i=1; i<=da; ++i) {
295 Cell nv = mkStgVar(NIL,NIL);
297 altsc = cons(pair(mkOffset(co+i),nv),altsc);
299 /* bind dictionary */
300 d = stgRhs(dict,co,sc,namePMFail);
301 if (!isAtomic(d)) { /* wasn't atomic */
303 binds = cons(d,binds);
306 n = mkStgVar(mkStgCon(box,singleton(n)),NIL);
307 binds = cons(n,binds);
312 mkStgApp(testFun,tripleton(d,n,scrut))),
313 stgExpr(r,co+da,altsc,failExpr),
324 /* allocate variables, extend scope */
325 for(bs = snd(fst(snd(e))); nonNull(bs); bs=tl(bs)) {
326 Cell nv = mkStgVar(NIL,NIL);
327 sc = cons(pair(fst3(hd(bs)),nv),sc);
328 binds = cons(nv,binds);
331 for(bs = fst(fst(snd(e))); nonNull(bs); bs=tl(bs)) {
332 Cell nv = mkStgVar(NIL,NIL);
333 sc = cons(pair(mkOffset(++co),nv),sc);
334 binds = cons(nv,binds);
338 /* transform functions */
339 for(bs = snd(fst(snd(e))); nonNull(bs); bs=tl(bs), vs=tl(vs)) {
344 Int arity = intOf(snd3(fun));
346 for(i=1; i<=arity; ++i) {
347 Cell v = mkStgVar(NIL,NIL);
349 funsc = cons(pair(mkOffset(co+i),v),funsc);
354 stgExpr(thd3(thd3(fun)),co+arity,funsc,namePMFail));
356 /* transform expressions */
357 for(bs = fst(fst(snd(e))); nonNull(bs); bs=tl(bs), vs=tl(vs)) {
360 stgVarBody(nv) = stgRhs(rhs,co,sc,namePMFail);
362 return mkStgLet(binds,stgRhs(snd(snd(e)),co,sc,failExpr/*namePMFail*/));
365 default: /* convert to an StgApp or StgVar plus some bindings */
375 args = cons(arg,args);
379 if (e == nameSel && length(args) == 3) {
382 StgVar v = stgOffset(hd(tl(args)),sc);
384 StgExpr v = stgExpr(hd(tl(args)),co,sc,namePMFail);
386 Int ix = intOf(hd(tl(tl(args))));
387 Int da = discrArity(con);
390 for(i=1; i<=da; ++i) {
391 Cell nv = mkStgVar(NIL,NIL);
396 doubleton(mkStgCaseAlt(con,vs,nth(ix-1,vs)),
397 mkStgDefault(mkStgVar(NIL,NIL),namePMFail)));
400 /* Arguments must be StgAtoms */
401 for(as=args; nonNull(as); as=tl(as)) {
402 StgRhs a = stgRhs(hd(as),co,sc,namePMFail);
403 #if 1 /* optional flattening of let bindings */
404 if (whatIs(a) == LETREC) {
405 binds = appendOnto(stgLetBinds(a),binds);
412 binds = cons(a,binds);
417 /* Function must be StgVar or Name */
418 e = stgRhs(e,co,sc,namePMFail);
419 if (!isStgVar(e) && !isName(e)) {
421 binds = cons(e,binds);
424 return makeStgLet(binds,makeStgApp(e,args));
429 #if 0 /* apparently not used */
430 static Void ppExp( Name n, Int arity, Cell e )
432 if (1 || debugCode) {
434 printf("%s", textToStr(name(n).text));
435 for (i = arity; i > 0; i--) {
446 Void stgDefn( Name n, Int arity, Cell e )
451 for (i = 1; i <= arity; ++i) {
452 Cell nv = mkStgVar(NIL,NIL);
454 sc = cons(pair(mkOffset(i),nv),sc);
456 stgVarBody(name(n).stgVar)
457 = makeStgLambda(vs,stgExpr(e,arity,sc,namePMFail));
458 s = stgSize(stgVarBody(name(n).stgVar));
460 if (s <= SMALL_INLINE_SIZE && !name(n).inlineMe) {
461 name(n).inlineMe = TRUE;
465 Void implementCfun(c,scs) /* Build implementation for constr */
466 Name c; /* fun c. scs lists integers (1..)*/
467 List scs; { /* in incr order of strict comps. */
468 Int a = name(c).arity;
471 StgVar vcurr, e1, v, vsi;
472 List args = makeArgs(a);
473 StgVar v0 = mkStgVar(mkStgCon(c,args),NIL);
474 List binds = singleton(v0);
477 for (; nonNull(scs); scs=tl(scs)) {
478 vsi = nth(intOf(hd(scs))-1,args);
479 vcurr = mkStgVar(mkStgApp(namePrimSeq,doubleton(vsi,vcurr)), NIL);
480 binds = cons(vcurr,binds);
483 e1 = mkStgLet(binds,vcurr);
484 v = mkStgVar(mkStgLambda(args,e1),NIL);
487 StgVar v = mkStgVar(mkStgCon(c,NIL),NIL);
490 name(c).inlineMe = TRUE;
491 name(c).stgSize = stgSize(stgVarBody(name(c).stgVar));
492 stgGlobals = cons(pair(c,name(c).stgVar),stgGlobals);
493 /* printStg(stderr, name(c).stgVar); fprintf(stderr,"\n\n"); */
496 /* --------------------------------------------------------------------------
497 * Foreign function calls and primops
498 * ------------------------------------------------------------------------*/
500 /* Outbound denotes data moving from Haskell world to elsewhere.
501 Inbound denotes data moving from elsewhere to Haskell world.
503 static String charListToString ( List cs );
504 static Cell foreignTy ( Bool outBound, Type t );
505 static Cell foreignOutboundTy ( Type t );
506 static Cell foreignInboundTy ( Type t );
507 static Name repToBox ( char c );
508 static StgRhs makeStgPrim ( Name,Bool,List,String,String );
510 static String charListToString( List cs )
515 assert( length(cs) < 100 );
516 for(; nonNull(cs); ++i, cs=tl(cs)) {
517 s[i] = charOf(hd(cs));
520 return textToStr(findText(s));
523 static Cell foreignTy ( Bool outBound, Type t )
525 if (t == typeChar) return mkChar(CHAR_REP);
526 else if (t == typeInt) return mkChar(INT_REP);
528 else if (t == typeInteger)return mkChar(INTEGER_REP);
530 else if (t == typeWord) return mkChar(WORD_REP);
531 else if (t == typeAddr) return mkChar(ADDR_REP);
532 else if (t == typeFloat) return mkChar(FLOAT_REP);
533 else if (t == typeDouble) return mkChar(DOUBLE_REP);
534 else if (t == typeStable) return mkChar(STABLE_REP);
535 #ifdef PROVIDE_FOREIGN
536 else if (t == typeForeign)return mkChar(FOREIGN_REP);
537 /* ToDo: argty only! */
540 else if (t == typePrimByteArray) return mkChar(BARR_REP);
541 /* ToDo: argty only! */
542 else if (whatIs(t) == AP) {
544 if (h == typePrimMutableByteArray) return mkChar(MUTBARR_REP);
545 /* ToDo: argty only! */
548 /* ToDo: decent line numbers! */
550 ERRMSG(0) "Illegal outbound (away from Haskell) type" ETHEN
551 ERRTEXT " \"" ETHEN ERRTYPE(t);
555 ERRMSG(0) "Illegal inbound (towards Haskell) type" ETHEN
556 ERRTEXT " \"" ETHEN ERRTYPE(t);
562 static Cell foreignOutboundTy ( Type t )
564 return foreignTy ( TRUE, t );
567 static Cell foreignInboundTy ( Type t )
569 return foreignTy ( FALSE, t );
572 static Name repToBox( char c )
575 case CHAR_REP: return nameMkC;
576 case INT_REP: return nameMkI;
577 case INTEGER_REP: return nameMkInteger;
578 case WORD_REP: return nameMkW;
579 case ADDR_REP: return nameMkA;
580 case FLOAT_REP: return nameMkF;
581 case DOUBLE_REP: return nameMkD;
582 case ARR_REP: return nameMkPrimArray;
583 case BARR_REP: return nameMkPrimByteArray;
584 case REF_REP: return nameMkRef;
585 case MUTARR_REP: return nameMkPrimMutableArray;
586 case MUTBARR_REP: return nameMkPrimMutableByteArray;
587 case STABLE_REP: return nameMkStable;
589 case WEAK_REP: return nameMkWeak;
591 #ifdef PROVIDE_FOREIGN
592 case FOREIGN_REP: return nameMkForeign;
594 #ifdef PROVIDE_CONCURRENT
595 case THREADID_REP: return nameMkThreadId;
596 case MVAR_REP: return nameMkMVar;
602 static StgPrimAlt boxResults( String reps, StgVar state )
604 List rs = NIL; /* possibly unboxed results */
605 List bs = NIL; /* boxed results of wrapper */
606 List rbinds = NIL; /* bindings used to box results */
609 for(i=0; reps[i] != '\0'; ++i) {
610 StgRep k = mkStgRep(reps[i]);
611 Cell v = mkStgPrimVar(NIL,k,NIL);
612 Name box = repToBox(reps[i]);
616 StgRhs rhs = mkStgCon(box,singleton(v));
617 StgVar bv = mkStgVar(rhs,NIL); /* boxed */
619 rbinds = cons(bv,rbinds);
623 /* Construct tuple of results */
626 } else { /* includes i==0 case */
627 StgVar r = mkStgVar(mkStgCon(mkTuple(i),rev(bs)),NIL);
628 rbinds = cons(r,rbinds);
631 /* construct result pair if needed */
632 if (nonNull(state)) {
633 /* Note that this builds a tuple directly - we know it's
636 StgVar r = mkStgVar(mkStgCon(mkTuple(2),doubleton(e,state)),NIL);
637 rbinds = cons(r,rbinds);
638 rs = cons(state,rs); /* last result is a state */
641 return mkStgPrimAlt(rev(rs),makeStgLet(rbinds,e));
644 static List mkUnboxedVars( String reps )
648 for(i=0; reps[i] != '\0'; ++i) {
649 Cell v = mkStgPrimVar(NIL,mkStgRep(reps[i]),NIL);
655 static List mkBoxedVars( String reps )
659 for(i=0; reps[i] != '\0'; ++i) {
660 as = cons(mkStgVar(NIL,NIL),as);
665 static StgRhs unboxVars( String reps, List b_args, List u_args, StgExpr e )
667 if (nonNull(b_args)) {
668 StgVar b_arg = hd(b_args); /* boxed arg */
669 StgVar u_arg = hd(u_args); /* unboxed arg */
670 Name box = repToBox(*reps);
671 e = unboxVars(reps+1,tl(b_args),tl(u_args),e);
673 /* Use a trivial let-binding */
674 stgVarBody(u_arg) = b_arg;
675 return mkStgLet(singleton(u_arg),e);
677 StgCaseAlt alt = mkStgCaseAlt(box,singleton(u_arg),e);
678 return mkStgCase(b_arg,singleton(alt));
685 /* Generate wrapper for primop based on list of arg types and result types:
687 * makeStgPrim op# False "II" "II" =
688 * \ x y -> "case x of { I# x# ->
689 * case y of { I# y# ->
690 * case op#{x#,y#} of { r1# r2# ->
691 * let r1 = I# r1#; r2 = I# r2# in
695 static StgRhs local makeStgPrim(op,addState,extra_args,a_reps,r_reps)
701 List b_args = NIL; /* boxed args to primop */
702 List u_args = NIL; /* possibly unboxed args to primop */
704 StgVar s0 = addState ? mkStgVar(NIL,NIL) : NIL;
705 StgVar s1 = addState ? mkStgVar(NIL,NIL) : NIL;
708 if (strcmp(r_reps,"B") == 0) {
710 = mkStgPrimAlt(singleton(
711 mkStgPrimVar(mkInt(0),
712 mkStgRep(INT_REP),NIL)
717 singleton(mkStgPrimVar(NIL,mkStgRep(INT_REP),NIL)),
719 alts = doubleton(altF,altT);
720 assert(nonNull(nameTrue));
723 alts = singleton(boxResults(r_reps,s1));
725 b_args = mkBoxedVars(a_reps);
726 u_args = mkUnboxedVars(a_reps);
729 = appendOnto(extra_args,dupListOnto(u_args,singleton(s0)));
731 = makeStgLambda(singleton(s0),
732 unboxVars(a_reps,b_args,u_args,
733 mkStgPrimCase(mkStgPrim(op,actual_args),
735 StgVar m = mkStgVar(rhs,NIL);
736 return makeStgLambda(b_args,
737 mkStgLet(singleton(m),
738 mkStgApp(nameMkIO,singleton(m))));
740 List actual_args = appendOnto(extra_args,u_args);
741 return makeStgLambda(
743 unboxVars(a_reps,b_args,u_args,
744 mkStgPrimCase(mkStgPrim(op,actual_args),alts))
749 Void implementPrim ( n )
751 const AsmPrim* p = name(n).primop;
752 StgRhs rhs = makeStgPrim(n,p->monad!=MONAD_Id,NIL,p->args,p->results);
753 StgVar v = mkStgVar(rhs,NIL);
755 name(n).stgSize = stgSize(stgVarBody(v));
756 name(n).inlineMe = TRUE;
757 stgGlobals=cons(pair(n,v),stgGlobals); /* so it will get codegened */
760 /* Generate wrapper code from (in,out) type lists.
764 * inTypes = [Int,Float]
765 * outTypes = [Char,Addr]
769 * case a1 of { I# a1# ->
770 * case s2 of { F# a2# ->
771 * case ccall# "IF" "CA" fun a1# a2# s0 of { r1# r2# s1 ->
779 * Addr -> (Int -> Float -> IO (Char,Addr))
781 Void implementForeignImport ( Name n )
783 Type t = name(n).type;
785 List resultTys = NIL;
786 CFunDescriptor* descriptor = 0;
787 Bool addState = TRUE;
788 while (getHead(t)==typeArrow && argCount==2) {
789 Type ta = fullExpand(arg(fun(t)));
791 argTys = cons(ta,argTys);
794 argTys = rev(argTys);
795 if (getHead(t) == typeIO) {
796 resultTys = getArgs(t);
797 assert(length(resultTys) == 1);
798 resultTys = hd(resultTys);
804 resultTys = fullExpand(resultTys);
805 if (isTuple(getHead(resultTys))) {
806 resultTys = getArgs(resultTys);
807 } else if (getHead(resultTys) == typeUnit) {
810 resultTys = singleton(resultTys);
812 mapOver(foreignOutboundTy,argTys); /* allows foreignObj, byteArrays, etc */
813 mapOver(foreignInboundTy,resultTys); /* doesn't */
814 descriptor = mkDescriptor(charListToString(argTys),
815 charListToString(resultTys));
817 ERRMSG(name(n).line) "Can't allocate memory for call descriptor"
821 /* ccall is the default convention, if it wasn't specified */
822 if (isNull(name(n).callconv)
823 || name(n).callconv == textCcall) {
824 name(n).primop = addState ? &ccall_ccall_IO : &ccall_ccall_Id;
826 else if (name(n).callconv == textStdcall) {
827 if (!stdcallAllowed()) {
828 ERRMSG(name(n).line) "stdcall is not supported on this platform"
831 name(n).primop = addState ? &ccall_stdcall_IO : &ccall_stdcall_Id;
834 internal ( "implementForeignImport: unknown calling convention");
837 Pair extName = name(n).defn;
838 void* funPtr = getDLLSymbol(name(n).line,
839 textToStr(textOf(fst(extName))),
840 textToStr(textOf(snd(extName))));
841 List extra_args = doubleton(mkPtr(descriptor),mkPtr(funPtr));
842 StgRhs rhs = makeStgPrim(n,addState,extra_args,descriptor->arg_tys,
843 descriptor->result_tys);
844 StgVar v = mkStgVar(rhs,NIL);
846 ERRMSG(name(n).line) "Could not find foreign function \"%s\" in \"%s\"",
847 textToStr(textOf(snd(extName))),
848 textToStr(textOf(fst(extName)))
854 name(n).stgSize = stgSize(stgVarBody(v));
855 name(n).inlineMe = TRUE;
856 stgGlobals=cons(pair(n,v),stgGlobals);/*so it will get codegen'd */
865 e3 = C# 'c' -- (ccall), or 's' (stdcall)
866 in primMkAdjThunk fun e1 e3 s0
868 we require, and check that,
869 fun :: prim_arg* -> IO prim_result
871 Void implementForeignExport ( Name n )
873 Type t = name(n).type;
875 List resultTys = NIL;
878 if (getHead(t)==typeArrow && argCount==2) {
881 ERRMSG(name(n).line) "foreign export has illegal type" ETHEN
882 ERRTEXT " \"" ETHEN ERRTYPE(t);
887 while (getHead(t)==typeArrow && argCount==2) {
888 Type ta = fullExpand(arg(fun(t)));
890 argTys = cons(ta,argTys);
893 argTys = rev(argTys);
894 if (getHead(t) == typeIO) {
895 resultTys = getArgs(t);
896 assert(length(resultTys) == 1);
897 resultTys = hd(resultTys);
899 ERRMSG(name(n).line) "foreign export doesn't return an IO type" ETHEN
900 ERRTEXT " \"" ETHEN ERRTYPE(t);
904 resultTys = fullExpand(resultTys);
906 mapOver(foreignInboundTy,argTys);
908 /* ccall is the default convention, if it wasn't specified */
909 if (isNull(name(n).callconv)
910 || name(n).callconv == textCcall) {
913 else if (name(n).callconv == textStdcall) {
914 if (!stdcallAllowed()) {
915 ERRMSG(name(n).line) "stdcall is not supported on this platform"
921 internal ( "implementForeignExport: unknown calling convention");
928 StgVar e1, e2, e3, v;
931 tdList = cons(mkChar(':'),argTys);
932 if (resultTys != typeUnit)
933 tdList = cons(foreignOutboundTy(resultTys),tdList);
935 tdText = findText(charListToString ( tdList ));
938 mkStgCon(nameMkA,singleton(ap(STRCELL,tdText))),
942 mkStgApp(nameUnpackString,singleton(e1)),
946 mkStgCon(nameMkC,singleton(mkChar(cc_char))),
955 cons(hd(args),cons(e2,cons(e3,cons(hd(tl(args)),NIL))))
960 v = mkStgVar(fun,NIL);
965 name(n).stgSize = stgSize(stgVarBody(v));
966 name(n).inlineMe = FALSE;
967 stgGlobals = cons(pair(n,v),stgGlobals);
971 // ToDo: figure out how to set inlineMe for these (non-Name) things
972 Void implementTuple(size)
975 Cell t = mkTuple(size);
976 List args = makeArgs(size);
977 StgVar tv = mkStgVar(mkStgCon(t,args),NIL);
978 StgExpr e = mkStgLet(singleton(tv),tv);
979 StgVar v = mkStgVar(mkStgLambda(args,e),NIL);
980 stgGlobals = cons(pair(t,v),stgGlobals); /* so we can see it */
982 StgVar tv = mkStgVar(mkStgCon(nameUnit,NIL),NIL);
983 stgGlobals = cons(pair(nameUnit,tv),stgGlobals); /* ditto */
987 /* --------------------------------------------------------------------------
989 * ------------------------------------------------------------------------*/
991 Void translateControl(what)
996 /* deliberate fall through */
1007 /*-------------------------------------------------------------------------*/