X-Git-Url: http://git.megacz.com/?p=ghc-hetmet.git;a=blobdiff_plain;f=utils%2Fgenprimopcode%2FMain.hs;h=d228045ad945442e90dad1135f83654f4f7d66c7;hp=f957dbf1a728cb562b5352bc47cd3116734e028d;hb=b84b5969798530dbf5be9b8bb795b77e5dfbf042;hpb=01eb02c3392ff9acb5e4207f2633776ad6b8780d diff --git a/utils/genprimopcode/Main.hs b/utils/genprimopcode/Main.hs index f957dbf..d228045 100644 --- a/utils/genprimopcode/Main.hs +++ b/utils/genprimopcode/Main.hs @@ -5,11 +5,8 @@ module Main where -#if __GLASGOW_HASKELL__ >= 504 -import Text.ParserCombinators.Parsec -#else -import Parsec -#endif +import Parser +import Syntax import Monad import Char @@ -26,11 +23,10 @@ main = getArgs >>= \args -> ) else do s <- getContents - let pres = parse pTop "" s - case pres of + case parse s of Left err -> error ("parse error at " ++ (show err)) - Right p_o_specs - -> myseq (sanityTop p_o_specs) ( + Right p_o_specs@(Info _ entries) + -> seq (sanityTop p_o_specs) ( case head args of "--data-decl" @@ -66,11 +62,6 @@ main = getArgs >>= \args -> "strictness" "primOpStrictness" p_o_specs) - "--usage" - -> putStr (gen_switch_from_attribs - "usage" - "primOpUsg" p_o_specs) - "--primop-primop-info" -> putStr (gen_primop_info p_o_specs) @@ -86,6 +77,9 @@ main = getArgs >>= \args -> "--make-haskell-source" -> putStr (gen_hs_source p_o_specs) + "--make-ext-core-source" + -> putStr (gen_ext_core_source entries) + "--make-latex-doc" -> putStr (gen_latex_doc p_o_specs) @@ -101,12 +95,12 @@ known_args "--needs-wrapper", "--can-fail", "--strictness", - "--usage", "--primop-primop-info", "--primop-tag", "--primop-list", "--make-haskell-wrappers", "--make-haskell-source", + "--make-ext-core-source", "--make-latex-doc" ] @@ -118,7 +112,7 @@ gen_hs_source :: Info -> String gen_hs_source (Info defaults entries) = "-----------------------------------------------------------------------------\n" ++ "-- |\n" - ++ "-- Module : GHC.Arr\n" + ++ "-- Module : GHC.Prim\n" ++ "-- \n" ++ "-- Maintainer : cvs-ghc@haskell.org\n" ++ "-- Stability : internal\n" @@ -189,6 +183,128 @@ gen_hs_source (Info defaults entries) = escape = concatMap (\c -> if c `elem` special then '\\':c:[] else c:[]) where special = "/'`\"@<" +-- Generates the type environment that the stand-alone External Core tools use. +gen_ext_core_source :: [Entry] -> String +gen_ext_core_source entries = + "-----------------------------------------------------------------------\n" + ++ "-- This module is automatically generated by the GHC utility\n" + ++ "-- \"genprimopcode\". Do not edit!\n" + ++ "-----------------------------------------------------------------------\n" + ++ "module Language.Core.PrimEnv(primTcs, primVals, intLitTypes, ratLitTypes," + ++ "\n charLitTypes, stringLitTypes) where\nimport Language.Core.Core" + ++ "\nimport Language.Core.Encoding\n\n" + ++ "primTcs :: [(Tcon, Kind)]\n" + ++ "primTcs = [\n" + ++ printList tcEnt entries + ++ " ]\n" + ++ "primVals :: [(Var, Ty)]\n" + ++ "primVals = [\n" + ++ printList valEnt entries + ++ "]\n" + ++ "intLitTypes :: [Ty]\n" + ++ "intLitTypes = [\n" + ++ printList tyEnt (intLitTys entries) + ++ "]\n" + ++ "ratLitTypes :: [Ty]\n" + ++ "ratLitTypes = [\n" + ++ printList tyEnt (ratLitTys entries) + ++ "]\n" + ++ "charLitTypes :: [Ty]\n" + ++ "charLitTypes = [\n" + ++ printList tyEnt (charLitTys entries) + ++ "]\n" + ++ "stringLitTypes :: [Ty]\n" + ++ "stringLitTypes = [\n" + ++ printList tyEnt (stringLitTys entries) + ++ "]\n\n" + + where printList f = concat . intersperse ",\n" . filter (not . null) . map f + tcEnt (PrimTypeSpec {ty=t}) = + case t of + TyApp tc args -> parens tc (tcKind tc args) + _ -> error ("tcEnt: type in PrimTypeSpec is not a type" + ++ " constructor: " ++ show t) + tcEnt _ = "" + -- hack alert! + -- The primops.txt.pp format doesn't have enough information in it to + -- print out some of the information that ext-core needs (like kinds, + -- and later on in this code, module names) so we special-case. An + -- alternative would be to refer to things indirectly and hard-wire + -- certain things (e.g., the kind of the Any constructor, here) into + -- ext-core's Prims module again. + tcKind "Any" _ = "Klifted" + tcKind tc [] | last tc == '#' = "Kunlifted" + tcKind tc [] | otherwise = "Klifted" + -- assumes that all type arguments are lifted (are they?) + tcKind tc (v:as) = "(Karrow Klifted " ++ tcKind tc as + ++ ")" + valEnt (PseudoOpSpec {name=n, ty=t}) = valEntry n t + valEnt (PrimOpSpec {name=n, ty=t}) = valEntry n t + valEnt _ = "" + valEntry name ty = parens name (mkForallTy (freeTvars ty) (pty ty)) + where pty (TyF t1 t2) = mkFunTy (pty t1) (pty t2) + pty (TyApp tc ts) = mkTconApp (mkTcon tc) (map pty ts) + pty (TyUTup ts) = mkUtupleTy (map pty ts) + pty (TyVar tv) = paren $ "Tvar \"" ++ tv ++ "\"" + + mkFunTy s1 s2 = "Tapp " ++ (paren ("Tapp (Tcon tcArrow)" + ++ " " ++ paren s1)) + ++ " " ++ paren s2 + mkTconApp tc args = foldl tapp tc args + mkTcon tc = paren $ "Tcon " ++ paren (qualify True tc) + mkUtupleTy args = foldl tapp (tcUTuple (length args)) args + mkForallTy [] t = t + mkForallTy vs t = foldr + (\ v s -> "Tforall " ++ + (paren (quot v ++ ", " ++ vKind v)) ++ " " + ++ paren s) t vs + + -- hack alert! + vKind "o" = "Kopen" + vKind _ = "Klifted" + + freeTvars (TyF t1 t2) = freeTvars t1 `union` freeTvars t2 + freeTvars (TyApp _ tys) = freeTvarss tys + freeTvars (TyVar v) = [v] + freeTvars (TyUTup tys) = freeTvarss tys + freeTvarss = nub . concatMap freeTvars + + tapp s nextArg = paren $ "Tapp " ++ s ++ " " ++ paren nextArg + tcUTuple n = paren $ "Tcon " ++ paren (qualify False $ "Z" + ++ show n ++ "H") + + tyEnt (PrimTypeSpec {ty=(TyApp tc args)}) = " " ++ paren ("Tcon " ++ + (paren (qualify True tc))) + tyEnt _ = "" + + -- more hacks. might be better to do this on the ext-core side, + -- as per earlier comment + qualify _ tc | tc == "ByteArr#" = qualify True "ByteArray#" + qualify _ tc | tc == "MutArr#" = qualify True "MutableArray#" + qualify _ tc | tc == "MutByteArr#" = + qualify True "MutableByteArray#" + qualify _ tc | tc == "Bool" = "Just boolMname" ++ ", " + ++ ze True tc + qualify _ tc | tc == "()" = "Just baseMname" ++ ", " + ++ ze True tc + qualify enc tc = "Just primMname" ++ ", " ++ (ze enc tc) + ze enc tc = (if enc then "zEncodeString " else "") + ++ "\"" ++ tc ++ "\"" + + intLitTys = prefixes ["Int", "Word", "Addr", "Char"] + ratLitTys = prefixes ["Float", "Double"] + charLitTys = prefixes ["Char"] + stringLitTys = prefixes ["Addr"] + prefixes ps = filter (\ t -> + case t of + (PrimTypeSpec {ty=(TyApp tc args)}) -> + any (\ p -> p `isPrefixOf` tc) ps + _ -> False) + + parens n ty = " (zEncodeString \"" ++ n ++ "\", " ++ ty ++ ")" + paren s = "(" ++ s ++ ")" + quot s = "\"" ++ s ++ "\"" + gen_latex_doc :: Info -> String gen_latex_doc (Info defaults entries) = "\\primopdefaults{" @@ -263,7 +379,6 @@ gen_latex_doc (Info defaults entries) ++ mk_needs_wrapper o ++ "}{" ++ mk_can_fail o ++ "}{" ++ latex_encode (mk_strictness o) ++ "}{" - ++ latex_encode (mk_usage o) ++ "}" mk_has_side_effects o = mk_bool_opt o "has_side_effects" "Has side effects." "Has no side effects." @@ -285,12 +400,6 @@ gen_latex_doc (Info defaults entries) Just _ -> error "Boolean value for strictness" Nothing -> "" - mk_usage o = - case lookup_attrib "usage" o of - Just (OptionString _ s) -> s -- for now - Just _ -> error "Boolean value for usage" - Nothing -> "" - zencode xs = case maybe_tuple xs of Just n -> n -- Tuples go to Z2T etc @@ -393,12 +502,14 @@ gen_primop_list (Info _ entries) gen_primop_tag :: Info -> String gen_primop_tag (Info _ entries) - = unlines (max_def : zipWith f primop_entries [1 :: Int ..]) + = unlines (max_def_type : max_def : + tagOf_type : zipWith f primop_entries [1 :: Int ..]) where - primop_entries = filter is_primop entries - f i n = "tagOf_PrimOp " ++ cons i - ++ " = _ILIT(" ++ show n ++ ") :: FastInt" - max_def = "maxPrimOpTag = " ++ show (length primop_entries) ++ " :: Int" + primop_entries = filter is_primop entries + tagOf_type = "tagOf_PrimOp :: PrimOp -> FastInt" + f i n = "tagOf_PrimOp " ++ cons i ++ " = _ILIT(" ++ show n ++ ")" + max_def_type = "maxPrimOpTag :: Int" + max_def = "maxPrimOpTag = " ++ show (length primop_entries) gen_data_decl :: Info -> String gen_data_decl (Info _ entries) @@ -425,7 +536,7 @@ gen_switch_from_attribs attrib_name fn_name (Info defaults entries) Nothing -> error ("gen_switch_from: " ++ attrib_name) Just xx -> unlines alternatives - ++ fn_name ++ " other = " ++ getAltRhs xx ++ "\n" + ++ fn_name ++ " _ = " ++ getAltRhs xx ++ "\n" ------------------------------------------------------------------ -- Create PrimOpInfo text from PrimOpSpecs ----------------------- @@ -470,7 +581,7 @@ mkPOI_RHS_text i ++ "(" ++ ppType resTy ++ ")" sl_name :: Entry -> String -sl_name i = "FSLIT(\"" ++ name i ++ "\") " +sl_name i = "(fsLit \"" ++ name i ++ "\") " ppTyVar :: String -> String ppTyVar "a" = "alphaTyVar" @@ -550,358 +661,3 @@ tvsIn (TyUTup tys) = concatMap tvsIn tys arity :: Ty -> Int arity = length . fst . flatTys ------------------------------------------------------------------- --- Abstract syntax ----------------------------------------------- ------------------------------------------------------------------- - --- info for all primops; the totality of the info in primops.txt(.pp) -data Info - = Info [Option] [Entry] -- defaults, primops - deriving Show - --- info for one primop -data Entry - = PrimOpSpec { cons :: String, -- PrimOp name - name :: String, -- name in prog text - ty :: Ty, -- type - cat :: Category, -- category - desc :: String, -- description - opts :: [Option] } -- default overrides - | PseudoOpSpec { name :: String, -- name in prog text - ty :: Ty, -- type - desc :: String, -- description - opts :: [Option] } -- default overrides - | PrimTypeSpec { ty :: Ty, -- name in prog text - desc :: String, -- description - opts :: [Option] } -- default overrides - | Section { title :: String, -- section title - desc :: String } -- description - deriving Show - -is_primop :: Entry -> Bool -is_primop (PrimOpSpec _ _ _ _ _ _) = True -is_primop _ = False - --- a binding of property to value -data Option - = OptionFalse String -- name = False - | OptionTrue String -- name = True - | OptionString String String -- name = { ... unparsed stuff ... } - deriving Show - --- categorises primops -data Category - = Dyadic | Monadic | Compare | GenPrimOp - deriving Show - --- types -data Ty - = TyF Ty Ty - | TyApp TyCon [Ty] - | TyVar TyVar - | TyUTup [Ty] -- unboxed tuples; just a TyCon really, - -- but convenient like this - deriving (Eq,Show) - -type TyVar = String -type TyCon = String - - ------------------------------------------------------------------- --- Sanity checking ----------------------------------------------- ------------------------------------------------------------------- - -{- Do some simple sanity checks: - * all the default field names are unique - * for each PrimOpSpec, all override field names are unique - * for each PrimOpSpec, all overriden field names - have a corresponding default value - * that primop types correspond in certain ways to the - Category: eg if Comparison, the type must be of the form - T -> T -> Bool. - Dies with "error" if there's a problem, else returns (). --} -myseq :: () -> a -> a -myseq () x = x - -myseqAll :: [()] -> a -> a -myseqAll (():ys) x = myseqAll ys x -myseqAll [] x = x - -sanityTop :: Info -> () -sanityTop (Info defs entries) - = let opt_names = map get_attrib_name defs - primops = filter is_primop entries - in - if length opt_names /= length (nub opt_names) - then error ("non-unique default attribute names: " ++ show opt_names ++ "\n") - else myseqAll (map (sanityPrimOp opt_names) primops) () - -sanityPrimOp :: [String] -> Entry -> () -sanityPrimOp def_names p - = let p_names = map get_attrib_name (opts p) - p_names_ok - = length p_names == length (nub p_names) - && all (`elem` def_names) p_names - ty_ok = sane_ty (cat p) (ty p) - in - if not p_names_ok - then error ("attribute names are non-unique or have no default in\n" ++ - "info for primop " ++ cons p ++ "\n") - else - if not ty_ok - then error ("type of primop " ++ cons p ++ " doesn't make sense w.r.t" ++ - " category " ++ show (cat p) ++ "\n") - else () - -sane_ty :: Category -> Ty -> Bool -sane_ty Compare (TyF t1 (TyF t2 td)) - | t1 == t2 && td == TyApp "Bool" [] = True -sane_ty Monadic (TyF t1 td) - | t1 == td = True -sane_ty Dyadic (TyF t1 (TyF t2 _)) - | t1 == t2 && t2 == t2 = True -sane_ty GenPrimOp _ - = True -sane_ty _ _ - = False - -get_attrib_name :: Option -> String -get_attrib_name (OptionFalse nm) = nm -get_attrib_name (OptionTrue nm) = nm -get_attrib_name (OptionString nm _) = nm - -lookup_attrib :: String -> [Option] -> Maybe Option -lookup_attrib _ [] = Nothing -lookup_attrib nm (a:as) - = if get_attrib_name a == nm then Just a else lookup_attrib nm as - ------------------------------------------------------------------- --- The parser ---------------------------------------------------- ------------------------------------------------------------------- - -keywords :: [String] -keywords = [ "section", "primop", "pseudoop", "primtype", "with"] - --- Due to lack of proper lexing facilities, a hack to zap any --- leading comments -pTop :: Parser Info -pTop = then4 (\_ ds es _ -> Info ds es) - pCommentAndWhitespace pDefaults (many pEntry) - (lit "thats_all_folks") - -pEntry :: Parser Entry -pEntry - = alts [pPrimOpSpec, pPrimTypeSpec, pPseudoOpSpec, pSection] - -pSection :: Parser Entry -pSection = then3 (\_ n d -> Section {title = n, desc = d}) - (lit "section") stringLiteral pDesc - -pDefaults :: Parser [Option] -pDefaults = then2 sel22 (lit "defaults") (many pOption) - -pOption :: Parser Option -pOption - = alts [ - then3 (\nm _ _ -> OptionFalse nm) pName (lit "=") (lit "False"), - then3 (\nm _ _ -> OptionTrue nm) pName (lit "=") (lit "True"), - then3 (\nm _ zz -> OptionString nm zz) - pName (lit "=") pStuffBetweenBraces - ] - -pPrimOpSpec :: Parser Entry -pPrimOpSpec - = then7 (\_ c n k t d o -> PrimOpSpec { cons = c, name = n, ty = t, - cat = k, desc = d, opts = o } ) - (lit "primop") pConstructor stringLiteral - pCategory pType pDesc pOptions - -pPrimTypeSpec :: Parser Entry -pPrimTypeSpec - = then4 (\_ t d o -> PrimTypeSpec { ty = t, desc = d, opts = o } ) - (lit "primtype") pType pDesc pOptions - -pPseudoOpSpec :: Parser Entry -pPseudoOpSpec - = then5 (\_ n t d o -> PseudoOpSpec { name = n, ty = t, desc = d, - opts = o } ) - (lit "pseudoop") stringLiteral pType pDesc pOptions - -pOptions :: Parser [Option] -pOptions = pOptDef [] (then2 sel22 (lit "with") (many pOption)) - -pCategory :: Parser Category -pCategory - = alts [ - apply (const Dyadic) (lit "Dyadic"), - apply (const Monadic) (lit "Monadic"), - apply (const Compare) (lit "Compare"), - apply (const GenPrimOp) (lit "GenPrimOp") - ] - -pDesc :: Parser String -pDesc = pOptDef "" pStuffBetweenBraces - -pStuffBetweenBraces :: Parser String -pStuffBetweenBraces - = lexeme ( - do char '{' - ass <- many pInsides - char '}' - return (concat ass) ) - -pInsides :: Parser String -pInsides - = (do char '{' - stuff <- many pInsides - char '}' - return ("{" ++ (concat stuff) ++ "}")) - <|> - (do c <- satisfy (/= '}') - return [c]) - -------------------- --- Parsing types -- -------------------- - -pType :: Parser Ty -pType = then2 (\t maybe_tt -> case maybe_tt of - Just tt -> TyF t tt - Nothing -> t) - paT - (pOpt (then2 sel22 (lit "->") pType)) - --- Atomic types -paT :: Parser Ty -paT = alts [ then2 TyApp pTycon (many ppT), - pUnboxedTupleTy, - then3 sel23 (lit "(") pType (lit ")"), - ppT - ] - --- the magic bit in the middle is: T (,T)* so to speak -pUnboxedTupleTy :: Parser Ty -pUnboxedTupleTy - = then3 (\ _ ts _ -> TyUTup ts) - (lit "(#") - (then2 (:) pType (many (then2 sel22 (lit ",") pType))) - (lit "#)") - --- Primitive types -ppT :: Parser Ty -ppT = alts [apply TyVar pTyvar, - apply (\tc -> TyApp tc []) pTycon - ] - -pTyvar :: Parser String -pTyvar = sat (`notElem` keywords) pName - -pTycon :: Parser String -pTycon = alts [pConstructor, lexeme (string "()")] - -pName :: Parser String -pName = lexeme (then2 (:) lower (many isIdChar)) - -pConstructor :: Parser String -pConstructor = lexeme (then2 (:) upper (many isIdChar)) - -isIdChar :: Parser Char -isIdChar = satisfy (`elem` idChars) - -idChars :: [Char] -idChars = ['a' .. 'z'] ++ ['A' .. 'Z'] ++ ['0' .. '9'] ++ "#_" - -sat :: (a -> Bool) -> Parser a -> Parser a -sat predicate p - = do x <- try p - if predicate x - then return x - else pzero - ------------------------------------------------------------------- --- Helpful additions to Daan's parser stuff ---------------------- ------------------------------------------------------------------- - -alts :: [Parser a] -> Parser a -alts [] = pzero -alts [p1] = try p1 -alts (p1:p2:ps) = (try p1) <|> alts (p2:ps) - -then2 :: (a -> b -> c) -> Parser a -> Parser b -> Parser c -then2 f p1 p2 - = do x1 <- p1 ; x2 <- p2 ; return (f x1 x2) - -then3 :: (a -> b -> c -> d) -> Parser a -> Parser b -> Parser c -> Parser d -then3 f p1 p2 p3 - = do x1 <- p1 ; x2 <- p2 ; x3 <- p3 ; return (f x1 x2 x3) - -then4 :: (a -> b -> c -> d -> e) -> Parser a -> Parser b -> Parser c -> Parser d -> Parser e -then4 f p1 p2 p3 p4 - = do x1 <- p1 ; x2 <- p2 ; x3 <- p3 ; x4 <- p4 ; return (f x1 x2 x3 x4) - -then5 :: (a -> b -> c -> d -> e -> f) -> Parser a -> Parser b -> Parser c -> Parser d -> Parser e -> Parser f -then5 f p1 p2 p3 p4 p5 - = do x1 <- p1 ; x2 <- p2 ; x3 <- p3 ; x4 <- p4 ; x5 <- p5 - return (f x1 x2 x3 x4 x5) - -then6 :: (a -> b -> c -> d -> e -> f -> g) -> Parser a -> Parser b -> Parser c -> Parser d -> Parser e -> Parser f -> Parser g -then6 f p1 p2 p3 p4 p5 p6 - = do x1 <- p1 ; x2 <- p2 ; x3 <- p3 ; x4 <- p4 ; x5 <- p5 ; x6 <- p6 - return (f x1 x2 x3 x4 x5 x6) - -then7 :: (a -> b -> c -> d -> e -> f -> g -> h) -> Parser a -> Parser b -> Parser c -> Parser d -> Parser e -> Parser f -> Parser g -> Parser h -then7 f p1 p2 p3 p4 p5 p6 p7 - = do x1 <- p1 ; x2 <- p2 ; x3 <- p3 ; x4 <- p4 ; x5 <- p5 ; x6 <- p6 ; x7 <- p7 - return (f x1 x2 x3 x4 x5 x6 x7) - -pOpt :: Parser a -> Parser (Maybe a) -pOpt p - = (do x <- p; return (Just x)) <|> return Nothing - -pOptDef :: a -> Parser a -> Parser a -pOptDef d p - = (do x <- p; return x) <|> return d - -sel12 :: a -> b -> a -sel12 a _ = a - -sel22 :: a -> b -> b -sel22 _ b = b - -sel23 :: a -> b -> c -> b -sel23 _ b _ = b - -apply :: (a -> b) -> Parser a -> Parser b -apply f p = liftM f p - --- Hacks for zapping whitespace and comments, unfortunately needed --- because Daan won't let us have a lexer before the parser :-( -lexeme :: Parser p -> Parser p -lexeme p = then2 sel12 p pCommentAndWhitespace - -lit :: String -> Parser () -lit s = apply (const ()) (lexeme (string s)) - -pCommentAndWhitespace :: Parser () -pCommentAndWhitespace - = apply (const ()) (many (alts [pLineComment, - apply (const ()) (satisfy isSpace)])) - <|> - return () - -pLineComment :: Parser () -pLineComment - = try (then3 (\_ _ _ -> ()) (string "--") (many (satisfy (/= '\n'))) (char '\n')) - -stringLiteral :: Parser String -stringLiteral = lexeme ( - do { between (char '"') - (char '"' "end of string") - (many (noneOf "\"")) - } - "literal string") - ------------------------------------------------------------------- --- end -- -------------------------------------------------------------------