X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=ghc%2Fcompiler%2FabsCSyn%2FAbsCSyn.lhs;h=3c8a470aae2f4eb2233f979ba0ff9370fe7daf2f;hb=553e90d9a32ee1b1809430f260c401cc4169c6c7;hp=cb65a7f23940bebb63a09bdeab16b734e816e0ed;hpb=aba5a247c8911531630003569a2d5355ecf1a599;p=ghc-hetmet.git diff --git a/ghc/compiler/absCSyn/AbsCSyn.lhs b/ghc/compiler/absCSyn/AbsCSyn.lhs index cb65a7f..3c8a470 100644 --- a/ghc/compiler/absCSyn/AbsCSyn.lhs +++ b/ghc/compiler/absCSyn/AbsCSyn.lhs @@ -1,7 +1,7 @@ % % (c) The GRASP/AQUA Project, Glasgow University, 1992-1998 % -% $Id: AbsCSyn.lhs,v 1.25 1999/10/31 15:35:32 sof Exp $ +% $Id: AbsCSyn.lhs,v 1.56 2003/11/17 14:47:53 simonmar Exp $ % \section[AbstractC]{Abstract C: the last stop before machine code} @@ -14,54 +14,32 @@ From @AbstractC@, one may convert to real C (for portability) or to raw assembler/machine code. \begin{code} -module AbsCSyn {- ( - -- export everything - AbstractC(..), - CStmtMacro(..), - CExprMacro(..), - CAddrMode(..), - ReturnInfo(..), - mkAbstractCs, mkAbsCStmts, mkAlgAltsCSwitch, - mkIntCLit, - mkAbsCStmtList, - mkCCostCentre, - - -- RegRelatives - RegRelative(..), - - -- registers - MagicId(..), node, infoptr, - isVolatileReg, - CostRes(Cost) - )-} where +module AbsCSyn where -- export everything #include "HsVersions.h" import {-# SOURCE #-} ClosureInfo ( ClosureInfo ) -#if ! OMIT_NATIVE_CODEGEN -import {-# SOURCE #-} MachMisc -#endif - import CLabel import Constants ( mAX_Vanilla_REG, mAX_Float_REG, mAX_Double_REG, spRelToInt ) import CostCentre ( CostCentre, CostCentreStack ) -import Const ( mkMachInt, Literal(..) ) +import Literal ( mkMachInt, Literal(..) ) +import ForeignCall ( CCallSpec ) import PrimRep ( PrimRep(..) ) -import PrimOp ( PrimOp ) +import MachOp ( MachOp(..) ) import Unique ( Unique ) -import StgSyn ( SRT(..) ) +import StgSyn ( StgOp ) import TyCon ( TyCon ) -import BitSet -- for liveness masks - +import Bitmap ( Bitmap, mAX_SMALL_BITMAP_SIZE ) +import SMRep ( StgWord, StgHalfWord ) +import FastTypes +import FastString \end{code} @AbstractC@ is a list of Abstract~C statements, but the data structure is tree-ish, for easier and more efficient putting-together. \begin{code} -absCNop = AbsCNop - data AbstractC = AbsCNop | AbsCStmts AbstractC AbstractC @@ -115,12 +93,32 @@ stored in a mixed type location.) | CInitHdr -- to initialise the header of a closure (both fixed/var parts) ClosureInfo CAddrMode -- address of the info ptr - CAddrMode -- cost centre to place in closure + !CAddrMode -- cost centre to place in closure -- CReg CurCostCentre or CC_HDR(R1.p{-Node-}) + Int -- size of closure, for profiling + + -- NEW CASES FOR EXPANDED PRIMOPS + + | CMachOpStmt -- Machine-level operation + CAddrMode -- result + MachOp + [CAddrMode] -- Arguments + (Maybe [MagicId]) -- list of regs which need to be preserved + -- across the primop. This is allowed to be Nothing only if + -- machOpIsDefinitelyInline returns True. And that in turn may + -- only return True if we are absolutely sure that the mach op + -- can be done inline on all platforms. + + | CSequential -- Do the nested AbstractCs sequentially. + [AbstractC] -- In particular, as far as the AbsCUtils.doSimultaneously + -- is concerned, these stmts are to be treated as atomic + -- and are not to be reordered. + + -- end of NEW CASES FOR EXPANDED PRIMOPS | COpStmt [CAddrMode] -- Results - PrimOp + StgOp [CAddrMode] -- Arguments [MagicId] -- Potentially volatile/live registers -- (to save/restore around the call/op) @@ -149,13 +147,13 @@ stored in a mixed type location.) | CRetDirect -- Direct return !Unique -- for making labels AbstractC -- return code - (CLabel,SRT) -- SRT info + C_SRT -- SRT info Liveness -- stack liveness at the return point -- see the notes about these next few; they follow below... | CMacroStmt CStmtMacro [CAddrMode] - | CCallProfCtrMacro FAST_STRING [CAddrMode] - | CCallProfCCMacro FAST_STRING [CAddrMode] + | CCallProfCtrMacro FastString [CAddrMode] + | CCallProfCCMacro FastString [CAddrMode] {- The presence of this constructor is a makeshift solution; it being used to work around a gcc-related problem of @@ -167,40 +165,47 @@ stored in a mixed type location.) compiling 'foreign import dynamic's) -} | CCallTypedef Bool {- True => use "typedef"; False => use "extern"-} - PrimOp{-CCallOp-} [CAddrMode] [CAddrMode] + CCallSpec Unique [CAddrMode] [CAddrMode] -- *** the next three [or so...] are DATA (those above are CODE) *** | CStaticClosure - CLabel -- The (full, not base) label to use for labelling the closure. - ClosureInfo + CLabel -- The closure's label + ClosureInfo -- Todo: maybe info_lbl & closure_lbl instead? CAddrMode -- cost centre identifier to place in closure [CAddrMode] -- free vars; ptrs, then non-ptrs. | CSRT CLabel [CLabel] -- SRT declarations: basically an array of -- pointers to static closures. - | CBitmap CLabel LivenessMask -- A larger-than-32-bits bitmap. + | CBitmap Liveness -- A "large" bitmap to be emitted + + | CSRTDesc -- A "large" SRT descriptor (one that doesn't + -- fit into the half-word bitmap in the itbl). + !CLabel -- Label for this SRT descriptor + !CLabel -- Pointer to the SRT + !Int -- Offset within the SRT + !Int -- Length + !Bitmap -- Bitmap | CClosureInfoAndCode ClosureInfo -- Explains placement and layout of closure - AbstractC -- Slow entry point code - (Maybe AbstractC) - -- Fast entry point code, if any - String -- Closure description; NB we can't get this - -- from ClosureInfo, because the latter refers - -- to the *right* hand side of a defn, whereas - -- the "description" refers to *left* hand side + AbstractC -- Entry point code | CRetVector -- A labelled block of static data CLabel [CAddrMode] - (CLabel,SRT) -- SRT info + C_SRT -- SRT info Liveness -- stack liveness at the return point | CClosureTbl -- table of constructors for enumerated types TyCon -- which TyCon this table is for + | CModuleInitBlock -- module initialisation block + CLabel -- "plain" label for init block + CLabel -- label for init block (with ver + way info) + AbstractC -- initialisation code + | CCostCentreDecl -- A cost centre *declaration* Bool -- True <=> local => full declaration -- False <=> extern; just say so @@ -212,6 +217,16 @@ stored in a mixed type location.) -- CostCentre.lhs) | CSplitMarker -- Split into separate object modules here + +-- C_SRT is what StgSyn.SRT gets translated to... +-- we add a label for the table, and expect only the 'offset/length' form + +data C_SRT = NoC_SRT + | C_SRT !CLabel !Int{-offset-} !StgHalfWord{-bitmap or escape-} + +needsSRT :: C_SRT -> Bool +needsSRT NoC_SRT = False +needsSRT (C_SRT _ _ _) = True \end{code} About @CMacroStmt@, etc.: notionally, they all just call some @@ -226,15 +241,20 @@ macros. An example is @STK_CHK@, which checks for stack-space overflow. This enumeration type lists all such macros: \begin{code} data CStmtMacro - = ARGS_CHK -- arg satisfaction check - | ARGS_CHK_LOAD_NODE -- arg check for top-level functions - | UPD_CAF -- update CAF closure with indirection + = UPD_CAF -- update CAF closure with indirection | UPD_BH_UPDATABLE -- eager backholing | UPD_BH_SINGLE_ENTRY -- more eager blackholing | PUSH_UPD_FRAME -- push update frame - | PUSH_SEQ_FRAME -- push seq frame - | UPDATE_SU_FROM_UPD_FRAME -- pull Su out of the update frame | SET_TAG -- set TagReg if it exists + -- dataToTag# primop -- *only* used in unregisterised builds. + -- (see AbsCUtils.dsCOpStmt) + | DATA_TO_TAGZH + + | REGISTER_FOREIGN_EXPORT -- register a foreign exported fun + | REGISTER_IMPORT -- register an imported module + | REGISTER_DIMPORT -- register an imported module from + -- another DLL + | GRAN_FETCH -- for GrAnSim only -- HWL | GRAN_RESCHEDULE -- for GrAnSim only -- HWL | GRAN_FETCH_AND_RESCHEDULE -- for GrAnSim only -- HWL @@ -250,11 +270,10 @@ data CCheckMacro = HP_CHK_NP -- heap/stack checks when | STK_CHK_NP -- node points to the closure | HP_STK_CHK_NP - | HP_CHK_SEQ_NP -- for 'seq' style case alternatives - | HP_CHK -- heap/stack checks when - | STK_CHK -- node doesn't point - | HP_STK_CHK + | HP_CHK_FUN -- heap/stack checks when + | STK_CHK_FUN -- node doesn't point + | HP_STK_CHK_FUN -- case alternative heap checks: | HP_CHK_NOREGS -- no registers live @@ -263,9 +282,8 @@ data CCheckMacro | HP_CHK_F1 -- FloatReg1 (only) is live | HP_CHK_D1 -- DblReg1 (only) is live | HP_CHK_L1 -- LngReg1 (only) is live - | HP_CHK_UT_ALT -- unboxed tuple return. - | HP_CHK_GEN -- generic heap check + | HP_CHK_UNBX_TUPLE -- unboxed tuple heap check \end{code} \item[@CCallProfCtrMacro@:] @@ -298,6 +316,10 @@ data CAddrMode -- which gives the magic location itself -- (NB: superceded by CReg) + -- JRS 2002-02-05: CAddr is really scummy and should be fixed. + -- The effect is that the semantics of CAddr depend on what the + -- contained RegRelative is; it is decidely non-orthogonal. + | CReg MagicId -- To replace (CAddr MagicId 0) | CTemp !Unique !PrimRep -- Temporary locations @@ -309,7 +331,7 @@ data CAddrMode | CCharLike CAddrMode -- The address of a static char-like closure for -- the specified character. It is guaranteed to be in - -- the range 0..255. + -- the range mIN_CHARLIKE..mAX_CHARLIKE | CIntLike CAddrMode -- The address of a static int-like closure for the -- specified small integer. It is guaranteed to be in @@ -317,10 +339,6 @@ data CAddrMode | CLit Literal - | CLitLit FAST_STRING -- completely literal literal: just spit this String - -- into the C output - PrimRep - | CJoinPoint -- This is used as the amode of a let-no-escape-bound -- variable. VirtualSpOffset -- Sp value after any volatile free vars @@ -343,8 +361,10 @@ data CExprMacro = ENTRY_CODE | ARG_TAG -- stack argument tagging | GET_TAG -- get current constructor tag - | UPD_FRAME_UPDATEE - + | CCS_HDR + | BYTE_ARR_CTS -- used when passing a ByteArray# to a ccall + | PTRS_ARR_CTS -- similarly for an Array# + | ForeignObj_CLOSURE_DATA -- and again for a ForeignObj# \end{code} Convenience functions: @@ -353,7 +373,10 @@ Convenience functions: mkIntCLit :: Int -> CAddrMode mkIntCLit i = CLit (mkMachInt (toInteger i)) -mkCString :: FAST_STRING -> CAddrMode +mkWordCLit :: StgWord -> CAddrMode +mkWordCLit wd = CLit (MachWord (fromIntegral wd)) + +mkCString :: FastString -> CAddrMode mkCString s = CLit (MachStr s) mkCCostCentre :: CostCentre -> CAddrMode @@ -371,9 +394,9 @@ mkCCostCentreStack ccs = CLbl (mkCCS_Label ccs) DataPtrRep \begin{code} data RegRelative - = HpRel FAST_INT -- } - | SpRel FAST_INT -- }- offsets in StgWords - | NodeRel FAST_INT -- } + = HpRel FastInt -- } + | SpRel FastInt -- }- offsets in StgWords + | NodeRel FastInt -- } | CIndex CAddrMode CAddrMode PrimRep -- pointer arithmetic :-) -- CIndex a b k === (k*)a[b] @@ -385,16 +408,16 @@ data ReturnInfo hpRel :: VirtualHeapOffset -- virtual offset of Hp -> VirtualHeapOffset -- virtual offset of The Thing -> RegRelative -- integer offset -hpRel IBOX(hp) IBOX(off) = HpRel (hp _SUB_ off) +hpRel hp off = HpRel (iUnbox (hp - off)) spRel :: VirtualSpOffset -- virtual offset of Sp -> VirtualSpOffset -- virtual offset of The Thing -> RegRelative -- integer offset -spRel sp off = SpRel (case spRelToInt sp off of { IBOX(i) -> i }) +spRel sp off = SpRel (iUnbox (spRelToInt sp off)) nodeRel :: VirtualHeapOffset -> RegRelative -nodeRel IBOX(off) = NodeRel off +nodeRel off = NodeRel (iUnbox off) \end{code} @@ -408,11 +431,17 @@ We represent liveness bitmaps as a BitSet (whose internal representation really is a bitmap). These are pinned onto case return vectors to indicate the state of the stack for the garbage collector. +In the compiled program, liveness bitmaps that fit inside a single +word (StgWord) are stored as a single word, while larger bitmaps are +stored as a pointer to an array of words. + \begin{code} -type LivenessMask = [BitSet] +data Liveness = Liveness CLabel !Int Bitmap -data Liveness = LvSmall BitSet - | LvLarge CLabel +maybeLargeBitmap :: Liveness -> AbstractC +maybeLargeBitmap liveness@(Liveness _ size _) + | size <= mAX_SMALL_BITMAP_SIZE = AbsCNop + | otherwise = CBitmap liveness \end{code} %************************************************************************ @@ -430,9 +459,6 @@ type HeapOffset = Int -- ToDo: remove type VirtualHeapOffset = HeapOffset type VirtualSpOffset = Int - -type HpRelOffset = HeapOffset -type SpRelOffset = Int \end{code} %************************************************************************ @@ -448,17 +474,16 @@ data MagicId -- Argument and return registers | VanillaReg -- pointers, unboxed ints and chars PrimRep - FAST_INT -- its number (1 .. mAX_Vanilla_REG) + FastInt -- its number (1 .. mAX_Vanilla_REG) | FloatReg -- single-precision floating-point registers - FAST_INT -- its number (1 .. mAX_Float_REG) + FastInt -- its number (1 .. mAX_Float_REG) | DoubleReg -- double-precision floating-point registers - FAST_INT -- its number (1 .. mAX_Double_REG) + FastInt -- its number (1 .. mAX_Double_REG) -- STG registers | Sp -- Stack ptr; points to last occupied stack location. - | Su -- Stack update frame pointer | SpLim -- Stack limit | Hp -- Heap ptr; points to last occupied heap location. | HpLim -- Heap limit register @@ -467,38 +492,42 @@ data MagicId -- no actual register | LongReg -- long int registers (64-bit, really) PrimRep -- Int64Rep or Word64Rep - FAST_INT -- its number (1 .. mAX_Long_REG) + FastInt -- its number (1 .. mAX_Long_REG) + + | CurrentTSO -- pointer to current thread's TSO + | CurrentNursery -- pointer to allocation area + | HpAlloc -- allocation count for heap check failure -node = VanillaReg PtrRep ILIT(1) -- A convenient alias for Node -tagreg = VanillaReg WordRep ILIT(2) -- A convenient alias for TagReg +node = VanillaReg PtrRep (_ILIT 1) -- A convenient alias for Node +tagreg = VanillaReg WordRep (_ILIT 2) -- A convenient alias for TagReg +nodeReg = CReg node \end{code} We need magical @Eq@ because @VanillaReg@s come in multiple flavors. \begin{code} instance Eq MagicId where - reg1 == reg2 = tag reg1 _EQ_ tag reg2 + reg1 == reg2 = tag reg1 ==# tag reg2 where - tag BaseReg = (ILIT(0) :: FAST_INT) - tag Sp = ILIT(1) - tag Su = ILIT(2) - tag SpLim = ILIT(3) - tag Hp = ILIT(4) - tag HpLim = ILIT(5) - tag CurCostCentre = ILIT(6) - tag VoidReg = ILIT(7) - - tag (VanillaReg _ i) = ILIT(8) _ADD_ i - - tag (FloatReg i) = ILIT(8) _ADD_ maxv _ADD_ i - tag (DoubleReg i) = ILIT(8) _ADD_ maxv _ADD_ maxf _ADD_ i - tag (LongReg _ i) = ILIT(8) _ADD_ maxv _ADD_ maxf _ADD_ maxd _ADD_ i - - maxv = case mAX_Vanilla_REG of { IBOX(x) -> x } - maxf = case mAX_Float_REG of { IBOX(x) -> x } - maxd = case mAX_Double_REG of { IBOX(x) -> x } + tag BaseReg = (_ILIT(0) :: FastInt) + tag Sp = _ILIT(1) + tag SpLim = _ILIT(3) + tag Hp = _ILIT(4) + tag HpLim = _ILIT(5) + tag CurCostCentre = _ILIT(6) + tag VoidReg = _ILIT(7) + + tag (VanillaReg _ i) = _ILIT(8) +# i + + tag (FloatReg i) = _ILIT(8) +# maxv +# i + tag (DoubleReg i) = _ILIT(8) +# maxv +# maxf +# i + tag (LongReg _ i) = _ILIT(8) +# maxv +# maxf +# maxd +# i + + maxv = iUnbox mAX_Vanilla_REG + maxf = iUnbox mAX_Float_REG + maxd = iUnbox mAX_Double_REG \end{code} Returns True for any register that {\em potentially} dies across