2 % (c) The University of Glasgow 2000
4 \section[ByteCodeLink]{Bytecode assembler and linker}
8 {-# OPTIONS -optc-DNON_POSIX_SOURCE #-}
10 module ByteCodeLink ( UnlinkedBCO, UnlinkedBCOExpr, assembleBCO,
11 ClosureEnv, HValue, filterNameMap,
12 linkIModules, linkIExpr, linkFail,
13 iNTERP_STACK_CHECK_THRESH
16 #include "HsVersions.h"
19 import Name ( Name, getName, nameModule, toRdrName, isGlobalName )
20 import RdrName ( rdrNameOcc, rdrNameModule )
21 import OccName ( occNameString )
22 import FiniteMap ( FiniteMap, addListToFM, filterFM,
23 addToFM, lookupFM, emptyFM )
25 import Literal ( Literal(..) )
26 import PrimOp ( PrimOp, primOpOcc )
27 import PrimRep ( PrimRep(..) )
28 import Constants ( wORD_SIZE )
29 import Module ( ModuleName, moduleName, moduleNameFS )
30 import Linker ( lookupSymbol )
31 import FastString ( FastString(..) )
32 import ByteCodeInstr ( BCInstr(..), ProtoBCO(..) )
33 import ByteCodeItbls ( ItblEnv, ItblPtr )
35 import Panic ( GhcException(..) )
37 import Control.Monad ( when, foldM )
38 import Control.Monad.ST ( runST )
39 import Data.Array.IArray ( array )
41 import GHC.Word ( Word(..) )
42 import Data.Array.MArray ( MArray, newArray_, readArray, writeArray )
43 import Data.Array.ST ( castSTUArray )
44 import Data.Array.Base ( UArray(..) )
45 import Foreign.Ptr ( Ptr, nullPtr )
46 import Foreign ( Word16, Ptr(..), free )
47 import System.Mem.Weak ( addFinalizer )
48 import Data.Int ( Int64 )
50 import System.IO ( fixIO )
51 import Control.Exception ( throwDyn )
53 import GlaExts ( BCO#, newBCO#, unsafeCoerce#,
54 ByteArray#, Array#, addrToHValue#, mkApUpd0# )
56 #if __GLASGOW_HASKELL__ >= 503
57 import GHC.Arr ( Array(..) )
58 import GHC.IOBase ( IO(..) )
60 import PrelArr ( Array(..) )
61 import PrelIOBase ( IO(..) )
65 %************************************************************************
67 \subsection{Top-level stuff}
69 %************************************************************************
73 linkIModules :: ItblEnv -- incoming global itbl env; returned updated
74 -> ClosureEnv -- incoming global closure env; returned updated
75 -> [([UnlinkedBCO], ItblEnv)]
76 -> IO ([HValue], ItblEnv, ClosureEnv)
77 linkIModules gie gce mods
78 = do let (bcoss, ies) = unzip mods
80 final_gie = foldr plusFM gie ies
81 (final_gce, linked_bcos) <- linkSomeBCOs True final_gie gce bcos
82 return (linked_bcos, final_gie, final_gce)
85 linkIExpr :: ItblEnv -> ClosureEnv -> UnlinkedBCOExpr
86 -> IO HValue -- IO BCO# really
87 linkIExpr ie ce (root_ul_bco, aux_ul_bcos)
88 = do (aux_ce, _) <- linkSomeBCOs False ie ce aux_ul_bcos
89 (_, [root_bco]) <- linkSomeBCOs False ie aux_ce [root_ul_bco]
92 -- Link a bunch of BCOs and return them + updated closure env.
93 linkSomeBCOs :: Bool -- False <=> add _all_ BCOs to returned closure env
94 -- True <=> add only toplevel BCOs to closure env
98 -> IO (ClosureEnv, [HValue])
99 linkSomeBCOs toplevs_only ie ce_in ul_bcos
100 = do let nms = map nameOfUnlinkedBCO ul_bcos
102 ( \ hvs -> let ce_out = addListToFM ce_in (zipLazily nms hvs)
103 in mapM (linkBCO ie ce_out) ul_bcos )
105 let ce_all_additions = zip nms hvals
106 ce_top_additions = filter (isGlobalName.fst) ce_all_additions
107 ce_additions = if toplevs_only then ce_top_additions
108 else ce_all_additions
109 ce_out = -- make sure we're not inserting duplicate names into the
110 -- closure environment, which leads to trouble.
111 ASSERT (all (not . (`elemFM` ce_in)) (map fst ce_additions))
112 addListToFM ce_in ce_additions
113 return (ce_out, hvals)
115 -- A lazier zip, in which no demand is propagated to the second
116 -- list unless some demand is propagated to the snd of one of the
117 -- result list elems.
119 zipLazily (x:xs) ys = (x, head ys) : zipLazily xs (tail ys)
124 (SizedSeq Word16) -- insns
125 (SizedSeq (Either Word FAST_STRING)) -- literals
126 -- Either literal words or a pointer to a asciiz
127 -- string, denoting a label whose *address* should
128 -- be determined at link time
129 (SizedSeq (Either Name PrimOp)) -- ptrs
130 (SizedSeq Name) -- itbl refs
132 nameOfUnlinkedBCO (UnlinkedBCO nm _ _ _ _) = nm
134 -- When translating expressions, we need to distinguish the root
135 -- BCO for the expression
136 type UnlinkedBCOExpr = (UnlinkedBCO, [UnlinkedBCO])
138 instance Outputable UnlinkedBCO where
139 ppr (UnlinkedBCO nm insns lits ptrs itbls)
140 = sep [text "BCO", ppr nm, text "with",
141 int (sizeSS insns), text "insns",
142 int (sizeSS lits), text "lits",
143 int (sizeSS ptrs), text "ptrs",
144 int (sizeSS itbls), text "itbls"]
147 -- these need a proper home
148 type ClosureEnv = FiniteMap Name HValue
149 data HValue = HValue -- dummy type, actually a pointer to some Real Code.
151 -- remove all entries for a given set of modules from the environment;
152 -- note that this removes all local names too (ie. temporary bindings from
153 -- the command line).
154 filterNameMap :: [ModuleName] -> FiniteMap Name a -> FiniteMap Name a
155 filterNameMap mods env
156 = filterFM (\n _ -> isGlobalName n
157 && moduleName (nameModule n) `elem` mods) env
160 %************************************************************************
162 \subsection{The bytecode assembler}
164 %************************************************************************
166 The object format for bytecodes is: 16 bits for the opcode, and 16 for
167 each field -- so the code can be considered a sequence of 16-bit ints.
168 Each field denotes either a stack offset or number of items on the
169 stack (eg SLIDE), and index into the pointer table (eg PUSH_G), an
170 index into the literal table (eg PUSH_I/D/L), or a bytecode address in
174 -- Top level assembler fn.
175 assembleBCO :: ProtoBCO Name -> IO UnlinkedBCO
177 assembleBCO (ProtoBCO nm instrs origin malloced)
179 -- pass 1: collect up the offsets of the local labels.
180 -- Remember that the first insn starts at offset 1 since offset 0
181 -- (eventually) will hold the total # of insns.
182 label_env = mkLabelEnv emptyFM 1 instrs
184 mkLabelEnv env i_offset [] = env
185 mkLabelEnv env i_offset (i:is)
187 = case i of LABEL n -> addToFM env n i_offset ; _ -> env
188 in mkLabelEnv new_env (i_offset + instrSize16s i) is
191 = case lookupFM label_env lab of
192 Just bco_offset -> bco_offset
193 Nothing -> pprPanic "assembleBCO.findLabel" (int lab)
195 do -- pass 2: generate the instruction, ptr and nonptr bits
196 insns <- return emptySS :: IO (SizedSeq Word16)
197 lits <- return emptySS :: IO (SizedSeq (Either Word FAST_STRING))
198 ptrs <- return emptySS :: IO (SizedSeq (Either Name PrimOp))
199 itbls <- return emptySS :: IO (SizedSeq Name)
200 let init_asm_state = (insns,lits,ptrs,itbls)
201 (final_insns, final_lits, final_ptrs, final_itbls)
202 <- mkBits findLabel init_asm_state instrs
204 let ul_bco = UnlinkedBCO nm final_insns final_lits final_ptrs final_itbls
206 -- 8 Aug 01: Finalisers aren't safe when attached to non-primitive
207 -- objects, since they might get run too early. Disable this until
208 -- we figure out what to do.
209 -- when (not (null malloced)) (addFinalizer ul_bco (mapM_ zonk malloced))
213 zonk ptr = do -- putStrLn ("freeing malloc'd block at " ++ show (A# a#))
216 -- instrs nonptrs ptrs itbls
217 type AsmState = (SizedSeq Word16,
218 SizedSeq (Either Word FAST_STRING),
219 SizedSeq (Either Name PrimOp),
222 data SizedSeq a = SizedSeq !Int [a]
223 emptySS = SizedSeq 0 []
224 addToSS (SizedSeq n r_xs) x = return (SizedSeq (n+1) (x:r_xs))
225 addListToSS (SizedSeq n r_xs) xs
226 = return (SizedSeq (n + length xs) (reverse xs ++ r_xs))
227 sizeSS (SizedSeq n r_xs) = n
228 listFromSS (SizedSeq n r_xs) = return (reverse r_xs)
231 -- This is where all the action is (pass 2 of the assembler)
232 mkBits :: (Int -> Int) -- label finder
234 -> [BCInstr] -- instructions (in)
237 mkBits findLabel st proto_insns
238 = foldM doInstr st proto_insns
240 doInstr :: AsmState -> BCInstr -> IO AsmState
243 SWIZZLE stkoff n -> instr3 st i_SWIZZLE stkoff n
244 ARGCHECK n -> instr2 st i_ARGCHECK n
245 STKCHECK n -> instr2 st i_STKCHECK n
246 PUSH_L o1 -> instr2 st i_PUSH_L o1
247 PUSH_LL o1 o2 -> instr3 st i_PUSH_LL o1 o2
248 PUSH_LLL o1 o2 o3 -> instr4 st i_PUSH_LLL o1 o2 o3
249 PUSH_G nm -> do (p, st2) <- ptr st nm
250 instr2 st2 i_PUSH_G p
251 PUSH_AS nm pk -> do (p, st2) <- ptr st (Left nm)
252 (np, st3) <- ctoi_itbl st2 pk
253 instr3 st3 i_PUSH_AS p np
254 PUSH_UBX (Left lit) nws
255 -> do (np, st2) <- literal st lit
256 instr3 st2 i_PUSH_UBX np nws
257 PUSH_UBX (Right aa) nws
258 -> do (np, st2) <- addr st aa
259 instr3 st2 i_PUSH_UBX np nws
261 PUSH_TAG tag -> instr2 st i_PUSH_TAG tag
262 SLIDE n by -> instr3 st i_SLIDE n by
263 ALLOC n -> instr2 st i_ALLOC n
264 MKAP off sz -> instr3 st i_MKAP off sz
265 UNPACK n -> instr2 st i_UNPACK n
266 UPK_TAG n m k -> instr4 st i_UPK_TAG n m k
267 PACK dcon sz -> do (itbl_no,st2) <- itbl st dcon
268 instr3 st2 i_PACK itbl_no sz
269 LABEL lab -> return st
270 TESTLT_I i l -> do (np, st2) <- int st i
271 instr3 st2 i_TESTLT_I np (findLabel l)
272 TESTEQ_I i l -> do (np, st2) <- int st i
273 instr3 st2 i_TESTEQ_I np (findLabel l)
274 TESTLT_F f l -> do (np, st2) <- float st f
275 instr3 st2 i_TESTLT_F np (findLabel l)
276 TESTEQ_F f l -> do (np, st2) <- float st f
277 instr3 st2 i_TESTEQ_F np (findLabel l)
278 TESTLT_D d l -> do (np, st2) <- double st d
279 instr3 st2 i_TESTLT_D np (findLabel l)
280 TESTEQ_D d l -> do (np, st2) <- double st d
281 instr3 st2 i_TESTEQ_D np (findLabel l)
282 TESTLT_P i l -> instr3 st i_TESTLT_P i (findLabel l)
283 TESTEQ_P i l -> instr3 st i_TESTEQ_P i (findLabel l)
284 CASEFAIL -> instr1 st i_CASEFAIL
285 JMP l -> instr2 st i_JMP (findLabel l)
286 ENTER -> instr1 st i_ENTER
287 RETURN rep -> do (itbl_no,st2) <- itoc_itbl st rep
288 instr2 st2 i_RETURN itbl_no
289 CCALL m_addr -> do (np, st2) <- addr st m_addr
290 instr2 st2 i_CCALL np
295 instr1 (st_i0,st_l0,st_p0,st_I0) i1
296 = do st_i1 <- addToSS st_i0 (i2s i1)
297 return (st_i1,st_l0,st_p0,st_I0)
299 instr2 (st_i0,st_l0,st_p0,st_I0) i1 i2
300 = do st_i1 <- addToSS st_i0 (i2s i1)
301 st_i2 <- addToSS st_i1 (i2s i2)
302 return (st_i2,st_l0,st_p0,st_I0)
304 instr3 (st_i0,st_l0,st_p0,st_I0) i1 i2 i3
305 = do st_i1 <- addToSS st_i0 (i2s i1)
306 st_i2 <- addToSS st_i1 (i2s i2)
307 st_i3 <- addToSS st_i2 (i2s i3)
308 return (st_i3,st_l0,st_p0,st_I0)
310 instr4 (st_i0,st_l0,st_p0,st_I0) i1 i2 i3 i4
311 = do st_i1 <- addToSS st_i0 (i2s i1)
312 st_i2 <- addToSS st_i1 (i2s i2)
313 st_i3 <- addToSS st_i2 (i2s i3)
314 st_i4 <- addToSS st_i3 (i2s i4)
315 return (st_i4,st_l0,st_p0,st_I0)
317 float (st_i0,st_l0,st_p0,st_I0) f
318 = do let ws = mkLitF f
319 st_l1 <- addListToSS st_l0 (map Left ws)
320 return (sizeSS st_l0, (st_i0,st_l1,st_p0,st_I0))
322 double (st_i0,st_l0,st_p0,st_I0) d
323 = do let ws = mkLitD d
324 st_l1 <- addListToSS st_l0 (map Left ws)
325 return (sizeSS st_l0, (st_i0,st_l1,st_p0,st_I0))
327 int (st_i0,st_l0,st_p0,st_I0) i
328 = do let ws = mkLitI i
329 st_l1 <- addListToSS st_l0 (map Left ws)
330 return (sizeSS st_l0, (st_i0,st_l1,st_p0,st_I0))
332 int64 (st_i0,st_l0,st_p0,st_I0) i
333 = do let ws = mkLitI64 i
334 st_l1 <- addListToSS st_l0 (map Left ws)
335 return (sizeSS st_l0, (st_i0,st_l1,st_p0,st_I0))
337 addr (st_i0,st_l0,st_p0,st_I0) a
338 = do let ws = mkLitPtr a
339 st_l1 <- addListToSS st_l0 (map Left ws)
340 return (sizeSS st_l0, (st_i0,st_l1,st_p0,st_I0))
342 litlabel (st_i0,st_l0,st_p0,st_I0) fs
343 = do st_l1 <- addListToSS st_l0 [Right fs]
344 return (sizeSS st_l0, (st_i0,st_l1,st_p0,st_I0))
346 ptr (st_i0,st_l0,st_p0,st_I0) p
347 = do st_p1 <- addToSS st_p0 p
348 return (sizeSS st_p0, (st_i0,st_l0,st_p1,st_I0))
350 itbl (st_i0,st_l0,st_p0,st_I0) dcon
351 = do st_I1 <- addToSS st_I0 (getName dcon)
352 return (sizeSS st_I0, (st_i0,st_l0,st_p0,st_I1))
354 literal st (MachLabel fs) = litlabel st fs
355 literal st (MachWord w) = int st (fromIntegral w)
356 literal st (MachInt j) = int st (fromIntegral j)
357 literal st (MachFloat r) = float st (fromRational r)
358 literal st (MachDouble r) = double st (fromRational r)
359 literal st (MachChar c) = int st c
360 literal st (MachInt64 ii) = int64 st (fromIntegral ii)
361 literal st (MachWord64 ii) = int64 st (fromIntegral ii)
362 literal st other = pprPanic "ByteCodeLink.literal" (ppr other)
365 = addr st ret_itbl_addr
369 PtrRep -> stg_ctoi_ret_R1p_info
370 WordRep -> stg_ctoi_ret_R1n_info
371 IntRep -> stg_ctoi_ret_R1n_info
372 AddrRep -> stg_ctoi_ret_R1n_info
373 CharRep -> stg_ctoi_ret_R1n_info
374 FloatRep -> stg_ctoi_ret_F1_info
375 DoubleRep -> stg_ctoi_ret_D1_info
376 VoidRep -> stg_ctoi_ret_V_info
377 other -> pprPanic "ByteCodeLink.ctoi_itbl" (ppr pk)
380 = addr st ret_itbl_addr
384 CharRep -> stg_gc_unbx_r1_info
385 IntRep -> stg_gc_unbx_r1_info
386 WordRep -> stg_gc_unbx_r1_info
387 AddrRep -> stg_gc_unbx_r1_info
388 FloatRep -> stg_gc_f1_info
389 DoubleRep -> stg_gc_d1_info
391 -- Interpreter.c spots this special case
392 other -> pprPanic "ByteCodeLink.itoc_itbl" (ppr pk)
394 foreign label "stg_ctoi_ret_R1p_info" stg_ctoi_ret_R1p_info :: Ptr ()
395 foreign label "stg_ctoi_ret_R1n_info" stg_ctoi_ret_R1n_info :: Ptr ()
396 foreign label "stg_ctoi_ret_F1_info" stg_ctoi_ret_F1_info :: Ptr ()
397 foreign label "stg_ctoi_ret_D1_info" stg_ctoi_ret_D1_info :: Ptr ()
398 foreign label "stg_ctoi_ret_V_info" stg_ctoi_ret_V_info :: Ptr ()
400 foreign label "stg_gc_unbx_r1_info" stg_gc_unbx_r1_info :: Ptr ()
401 foreign label "stg_gc_f1_info" stg_gc_f1_info :: Ptr ()
402 foreign label "stg_gc_d1_info" stg_gc_d1_info :: Ptr ()
404 -- The size in 16-bit entities of an instruction.
405 instrSize16s :: BCInstr -> Int
438 -- Make lists of host-sized words for literals, so that when the
439 -- words are placed in memory at increasing addresses, the
440 -- bit pattern is correct for the host's word size and endianness.
441 mkLitI :: Int -> [Word]
442 mkLitF :: Float -> [Word]
443 mkLitD :: Double -> [Word]
444 mkLitPtr :: Ptr () -> [Word]
445 mkLitI64 :: Int64 -> [Word]
449 arr <- newArray_ ((0::Int),0)
451 f_arr <- castSTUArray arr
452 w0 <- readArray f_arr 0
459 arr <- newArray_ ((0::Int),1)
461 d_arr <- castSTUArray arr
462 w0 <- readArray d_arr 0
463 w1 <- readArray d_arr 1
464 return [w0 :: Word, w1]
468 arr <- newArray_ ((0::Int),0)
470 d_arr <- castSTUArray arr
471 w0 <- readArray d_arr 0
478 arr <- newArray_ ((0::Int),1)
480 d_arr <- castSTUArray arr
481 w0 <- readArray d_arr 0
482 w1 <- readArray d_arr 1
483 return [w0 :: Word,w1]
487 arr <- newArray_ ((0::Int),0)
489 d_arr <- castSTUArray arr
490 w0 <- readArray d_arr 0
496 arr <- newArray_ ((0::Int),0)
498 i_arr <- castSTUArray arr
499 w0 <- readArray i_arr 0
505 arr <- newArray_ ((0::Int),0)
507 a_arr <- castSTUArray arr
508 w0 <- readArray a_arr 0
513 %************************************************************************
515 \subsection{Linking interpretables into something we can run}
517 %************************************************************************
522 data BCO# = BCO# ByteArray# -- instrs :: Array Word16#
523 ByteArray# -- literals :: Array Word32#
524 PtrArray# -- ptrs :: Array HValue
525 ByteArray# -- itbls :: Array Addr#
528 linkBCO ie ce (UnlinkedBCO nm insnsSS literalsSS ptrsSS itblsSS)
529 = do insns <- listFromSS insnsSS
530 literals <- listFromSS literalsSS
531 ptrs <- listFromSS ptrsSS
532 itbls <- listFromSS itblsSS
534 linked_ptrs <- mapM (lookupCE ce) ptrs
535 linked_itbls <- mapM (lookupIE ie) itbls
536 linked_literals <- mapM lookupLiteral literals
538 let n_insns = sizeSS insnsSS
539 n_literals = sizeSS literalsSS
540 n_ptrs = sizeSS ptrsSS
541 n_itbls = sizeSS itblsSS
543 let ptrs_arr = array (0, n_ptrs-1) (indexify linked_ptrs)
545 ptrs_parr = case ptrs_arr of Array lo hi parr -> parr
547 itbls_arr = array (0, n_itbls-1) (indexify linked_itbls)
548 :: UArray Int ItblPtr
549 itbls_barr = case itbls_arr of UArray lo hi barr -> barr
551 insns_arr | n_insns > 65535
552 = panic "linkBCO: >= 64k insns in BCO"
555 (indexify (fromIntegral n_insns:insns))
557 insns_barr = case insns_arr of UArray lo hi barr -> barr
559 literals_arr = array (0, n_literals-1) (indexify linked_literals)
561 literals_barr = case literals_arr of UArray lo hi barr -> barr
563 indexify :: [a] -> [(Int, a)]
564 indexify xs = zip [0..] xs
566 BCO bco# <- newBCO insns_barr literals_barr ptrs_parr itbls_barr
568 -- WAS: return (unsafeCoerce# bco#)
569 case mkApUpd0# (unsafeCoerce# bco#) of
570 (# final_bco #) -> return final_bco
575 newBCO :: ByteArray# -> ByteArray# -> Array# a -> ByteArray# -> IO BCO
577 = IO (\s -> case newBCO# a b c d s of (# s1, bco #) -> (# s1, BCO bco #))
580 lookupLiteral :: Either Word FAST_STRING -> IO Word
581 lookupLiteral (Left w) = return w
582 lookupLiteral (Right addr_of_label_string)
583 = do let label_to_find = _UNPK_ addr_of_label_string
584 m <- lookupSymbol label_to_find
586 -- Can't be bothered to find the official way to convert Addr# to Word#;
587 -- the FFI/Foreign designers make it too damn difficult
588 -- Hence we apply the Blunt Instrument, which works correctly
589 -- on all reasonable architectures anyway
590 Just (Ptr addr) -> return (W# (unsafeCoerce# addr))
591 Nothing -> linkFail "ByteCodeLink: can't find label"
594 lookupCE :: ClosureEnv -> Either Name PrimOp -> IO HValue
595 lookupCE ce (Right primop)
596 = do let sym_to_find = primopToCLabel primop "closure"
597 m <- lookupSymbol sym_to_find
599 Just (Ptr addr) -> case addrToHValue# addr of
600 (# hval #) -> return hval
601 Nothing -> linkFail "ByteCodeLink.lookupCE(primop)" sym_to_find
602 lookupCE ce (Left nm)
603 = case lookupFM ce nm of
606 -> ASSERT2(isGlobalName nm, ppr nm)
607 do let sym_to_find = nameToCLabel nm "closure"
608 m <- lookupSymbol sym_to_find
610 Just (Ptr addr) -> case addrToHValue# addr of
611 (# hval #) -> return hval
612 Nothing -> linkFail "ByteCodeLink.lookupCE" sym_to_find
614 lookupIE :: ItblEnv -> Name -> IO (Ptr a)
616 = case lookupFM ie con_nm of
617 Just (Ptr a) -> return (Ptr a)
619 -> do -- try looking up in the object files.
620 let sym_to_find1 = nameToCLabel con_nm "con_info"
621 m <- lookupSymbol sym_to_find1
623 Just addr -> return addr
625 -> do -- perhaps a nullary constructor?
626 let sym_to_find2 = nameToCLabel con_nm "static_info"
627 n <- lookupSymbol sym_to_find2
629 Just addr -> return addr
630 Nothing -> linkFail "ByteCodeLink.lookupIE"
631 (sym_to_find1 ++ " or " ++ sym_to_find2)
633 linkFail :: String -> String -> IO a
635 = throwDyn (ProgramError $
637 , "During interactive linking, GHCi couldn't find the following symbol:"
639 , "This may be due to you not asking GHCi to load extra object files,"
640 , "archives or DLLs needed by your current session. Restart GHCi, specifying"
641 , "the missing library using the -L/path/to/object/dir and -lmissinglibname"
642 , "flags, or simply by naming the relevant files on the GHCi command line."
643 , "Alternatively, this link failure might indicate a bug in GHCi."
644 , "If you suspect the latter, please send a bug report to:"
645 , " glasgow-haskell-bugs@haskell.org"
648 -- HACKS!!! ToDo: cleaner
649 nameToCLabel :: Name -> String{-suffix-} -> String
650 nameToCLabel n suffix
651 = _UNPK_(moduleNameFS (rdrNameModule rn))
652 ++ '_':occNameString(rdrNameOcc rn) ++ '_':suffix
653 where rn = toRdrName n
655 primopToCLabel :: PrimOp -> String{-suffix-} -> String
656 primopToCLabel primop suffix
657 = let str = "PrelPrimopWrappers_" ++ occNameString (primOpOcc primop) ++ '_':suffix
658 in --trace ("primopToCLabel: " ++ str)
663 %************************************************************************
665 \subsection{Connect to actual values for bytecode opcodes}
667 %************************************************************************
671 #include "Bytecodes.h"
673 i_ARGCHECK = (bci_ARGCHECK :: Int)
674 i_PUSH_L = (bci_PUSH_L :: Int)
675 i_PUSH_LL = (bci_PUSH_LL :: Int)
676 i_PUSH_LLL = (bci_PUSH_LLL :: Int)
677 i_PUSH_G = (bci_PUSH_G :: Int)
678 i_PUSH_AS = (bci_PUSH_AS :: Int)
679 i_PUSH_UBX = (bci_PUSH_UBX :: Int)
680 i_PUSH_TAG = (bci_PUSH_TAG :: Int)
681 i_SLIDE = (bci_SLIDE :: Int)
682 i_ALLOC = (bci_ALLOC :: Int)
683 i_MKAP = (bci_MKAP :: Int)
684 i_UNPACK = (bci_UNPACK :: Int)
685 i_UPK_TAG = (bci_UPK_TAG :: Int)
686 i_PACK = (bci_PACK :: Int)
687 i_TESTLT_I = (bci_TESTLT_I :: Int)
688 i_TESTEQ_I = (bci_TESTEQ_I :: Int)
689 i_TESTLT_F = (bci_TESTLT_F :: Int)
690 i_TESTEQ_F = (bci_TESTEQ_F :: Int)
691 i_TESTLT_D = (bci_TESTLT_D :: Int)
692 i_TESTEQ_D = (bci_TESTEQ_D :: Int)
693 i_TESTLT_P = (bci_TESTLT_P :: Int)
694 i_TESTEQ_P = (bci_TESTEQ_P :: Int)
695 i_CASEFAIL = (bci_CASEFAIL :: Int)
696 i_ENTER = (bci_ENTER :: Int)
697 i_RETURN = (bci_RETURN :: Int)
698 i_STKCHECK = (bci_STKCHECK :: Int)
699 i_JMP = (bci_JMP :: Int)
701 i_CCALL = (bci_CCALL :: Int)
702 i_SWIZZLE = (bci_SWIZZLE :: Int)
704 i_CCALL = error "Sorry pal, you need to bootstrap to use i_CCALL."
705 i_SWIZZLE = error "Sorry pal, you need to bootstrap to use i_SWIZZLE."
708 iNTERP_STACK_CHECK_THRESH = (INTERP_STACK_CHECK_THRESH :: Int)