" ++ argstring ++ "

{-# LANGUAGE CPP #-} module Main(main) where import Control.Exception import Control.Monad.Identity import Control.Monad.Writer import Control.Monad.State import System.IO(hFlush,stderr,stdout) import Prelude hiding(putStrLn, putStr,print) import qualified Data.Map as Map import qualified Data.Set as Set import qualified List import qualified System import qualified System.Exit as Exit import Util.Util import StringTable.Atom import C.Arch import CharIO import DataConstructors import Doc.DocLike import Doc.PPrint import Doc.Pretty import E.Annotate(annotateDs,annotateCombs,annotateProgram) import E.Diff import E.E import E.Eta import E.FreeVars import E.FromHs import E.Inline import E.LambdaLift import E.LetFloat import E.Program import E.Rules import E.Show hiding(render) import E.Subst(subst) import E.Traverse import E.TypeAnalysis import E.TypeCheck import E.WorkerWrapper import FrontEnd.Class import FrontEnd.FrontEnd import FrontEnd.KindInfer(getConstructorKinds) import GenUtil hiding(replicateM,putErrLn,putErr,putErrDie) import Grin.DeadCode import Grin.Devolve(twiddleGrin,devolveTransform) import Grin.EvalInline(createEvalApply) import Grin.FromE import Grin.Grin import Grin.Lint import Grin.NodeAnalyze import Grin.Optimize import Grin.Show import Ho.Build import Ho.Library import Ho.Collected import FrontEnd.HsSyn import Info.Types import Name.Id import Name.Name import Name.Names import Name.VConsts import Options import Support.FreeVars import Support.CanType(getType) import Support.Transform import Util.Graph import Util.SetLike as S import LHCVersion import qualified C.FromGrin2 as FG2 import qualified E.CPR import qualified E.Demand as Demand(analyzeProgram) import qualified E.SSimplify as SS import qualified FlagDump as FD import qualified FlagOpts as FO import qualified Grin.Simplify import qualified Grin.SSimplify import qualified Info.Info as Info import qualified Interactive import qualified Stats import qualified System.IO as IO import System.FilePath (takeExtension) #if BASE4 runMain action = Control.Exception.catches (action >> return ()) [ Handler $ \ (e::Exit.ExitCode) -> throw e , Handler $ \ (e::SomeException) -> putErrDie $ show e ] #else runMain action = Control.Exception.catch (action >> return ()) $ \e -> case e of ExitException c -> throw (ExitException c) other -> putErrDie $ show e #endif progress str = wdump FD.Progress $ (putErrLn str) >> hFlush stderr progressM c = wdump FD.Progress $ (c >>= putErrLn) >> hFlush stderr collectPassStats = verbose bracketHtml action = do (argstring,_) <- getArgString wdump FD.Html $ putStrLn $ "" ++ argstring ++ "

"
    action `finally` (wdump FD.Html $ putStrLn "

") catom action = action `finally` dumpToFile main = do -- runMain $ catom $ bracketHtml $ do o <- processOptions progressM $ do (argstring,_) <- getArgString return (argstring ++ "\n" ++ versionSimple) case optMode o of BuildHl hl -> makeLibrary processInitialHo processDecls hl ListLibraries -> do when (optVerbose options > 0) $ do putStrLn "Search path:" mapM_ putStrLn (optHlPath options) putStrLn "Libraries found:" ll <- libraryList sequence_ [ putStrLn name | (name,_) <- ll ] ShowHo ho -> dumpHoFile ho Version -> putStrLn versionString DependencyTree -> doDependency (optArgs o) _ -> processFiles (optArgs o) processFiles [] | Nothing <- optMainFunc options = do int <- isInteractive when (not int) $ putErrDie "lhc: no input files" processFilesModules [Left (Module "Prelude")] processFiles [] | Just (b,m) <- optMainFunc options = do m <- return $ parseName Val m m <- getModule m processFilesModules [Left m] processFiles cs = do processFilesModules (map fileOrModule cs) processFilesModules fs = do compileModEnv =<< parseFiles fs processInitialHo processDecls fileOrModule f = case takeExtension f of ".hs" -> Right f ".lhs" -> Right f _ -> Left $ Module f --barendregtProg prog = transformProgram transBarendregt prog barendregtProg prog = return prog transBarendregt = transformParms { transformCategory = "Barendregt", transformIterate = DontIterate, transformDumpProgress = corePass, transformOperation = evaluate . barendregtProgram } where barendregtProgram prog | null $ progCombinators prog = prog barendregtProgram prog = programSetDs ds' prog where (ELetRec ds' Unknown,_) = renameE mempty mempty (ELetRec (programDs prog) Unknown) lamann _ nfo = return nfo letann e nfo = return (annotateArity e nfo) idann ps i nfo = return (props ps i nfo) where props :: IdMap Properties -> Id -> Info.Info -> Info.Info props ps i = case mlookup i ps of Just ps -> modifyProperties (mappend ps) Nothing -> id processInitialHo :: CollectedHo -- ^ current accumulated ho -> Ho -- ^ new ho, freshly read from file -> IO CollectedHo -- ^ final combined ho data. processInitialHo accumho aho = do let Rules rm = hoRules $ hoBuild aho newTVrs = fsts $ hoEs (hoBuild aho) (_,orphans) = mpartitionWithKey (\k _ -> k `elem` map tvrIdent newTVrs) rm let fakeEntry = emptyComb { combRules = map ruleUpdate . concat $ melems orphans } combs = fakeEntry:[combRules_s (map ruleUpdate $ mfindWithDefault [] (tvrIdent t) rm) (bindComb (t,e)) | (t,e) <- hoEs (hoBuild aho) ] -- extract new combinators and processed rules let choCombinators' = fromList [ (combIdent c,c) | c <- runIdentity $ annotateCombs (choVarMap accumho) (\_ -> return) letann lamann combs] nrules = map ruleUpdate . combRules $ mfindWithDefault emptyComb emptyId choCombinators' reRule :: Comb -> Comb reRule comb = combRules_u f comb where f rs = List.union rs [ x | x <- nrules, ruleHead x == combHead comb] let finalVarMap = mappend (fromList [(tvrIdent tvr,Just $ EVar tvr) | tvr <- map combHead $ melems choCombs ]) (choVarMap accumho) choCombs = mfilterWithKey (\k _ -> k /= emptyId) choCombinators' (mod:_) = Map.keys $ hoExports $ hoExp aho return $ mempty { choVarMap = finalVarMap, choExternalNames = choExternalNames accumho `mappend` (fromList . map tvrIdent $ newTVrs), choCombinators = choCombs `mappend` fmap reRule (choCombinators accumho), choHoMap = Map.singleton (show mod) aho `mappend` choHoMap accumho } -- | this is called on parsed, typechecked haskell code to convert it to the internal representation coreMini = dump FD.CoreMini corePass = dump FD.CorePass coreSteps = dump FD.CoreSteps miniCorePass = coreMini && corePass miniCoreSteps = coreMini && coreSteps processDecls :: CollectedHo -- ^ Collected ho -> Ho -- ^ preliminary haskell object data -> TiData -- ^ front end output -> IO (CollectedHo,Ho) -- ^ (new accumulated ho, final ho for this modules) processDecls cho ho' tiData = do -- some useful values let allHo = ho `mappend` ho' ho = choHo cho -- XXX typechecker drops foreign exports! decls = tiDataDecls tiData ++ [ x | x@HsForeignExport {} <- originalDecls ] originalDecls = concat [ hsModuleDecls m | (_,m) <- tiDataModules tiData ] -- build datatables let dataTable = toDataTable (getConstructorKinds (hoKinds $ hoBuild ho')) (tiAllAssumptions tiData) originalDecls (hoDataTable $ hoBuild ho) classInstances = deriveClasses (choCombinators cho) dataTable fullDataTable = dataTable `mappend` hoDataTable (hoBuild ho) wdump FD.Datatable $ putErrLn (render $ showDataTable dataTable) wdump FD.Derived $ mapM_ (\ (v,lc) -> printCheckName'' fullDataTable v lc) classInstances -- initial program let prog = program { progClassHierarchy = hoClassHierarchy $ hoBuild allHo, progDataTable = fullDataTable, progExternalNames = choExternalNames cho, progModule = head (fsts $ tiDataModules tiData) } -- Convert Haskell decls to E let allAssumps = (tiAllAssumptions tiData `mappend` hoAssumps (hoBuild ho)) theProps = fromList [ (toId x,y) | (x,y) <- Map.toList $ tiProps tiData] -- 'convertDecls' uses its monad for error handling. ds' <- convertDecls tiData theProps (hoClassHierarchy $ hoBuild ho') allAssumps fullDataTable decls let ds = [ (v,e) | (v,e) <- classInstances ] ++ [ (v,lc) | (n,v,lc) <- ds', v `notElem` fsts classInstances ] -- sequence_ [lintCheckE onerrNone fullDataTable v e | (_,v,e) <- ds ] -- Build rules from instances, specializations, and user specified rules and catalysts let instanceRules = createInstanceRules fullDataTable (hoClassHierarchy $ hoBuild ho') (ds `mappend` hoEs (hoBuild ho)) -- FIXME: 'converRules' and 'procAllSpecs' use IO for error handling. Use an error monad if they are user errors -- otherwise use exceptions and make the calls pure. userRules <- convertRules (progModule prog) tiData (hoClassHierarchy $ hoBuild ho') allAssumps fullDataTable decls (nds,specializeRules) <- procAllSpecs (tiCheckedRules tiData) ds ds <- return $ ds ++ nds wdump FD.CoreInitial $ mapM_ (\(v,lc) -> printCheckName'' fullDataTable v lc) ds -- The only thing this will do is simple variable substitution. -- '\a -> \a -> a' => '\a -> \b -> b'. -- I don't think any functions depends on such shadowing to be removed. ds <- annotateDs mempty (\_ nfo -> return nfo) (\_ nfo -> return nfo) (\_ nfo -> return nfo) ds wdump FD.CoreInitial $ mapM_ (\(v,lc) -> printCheckName'' fullDataTable v lc) ds let rules@(Rules rules') = instanceRules `mappend` userRules `mappend` specializeRules wdump FD.Rules $ putStrLn " ---- user rules ---- " >> printRules RuleUser rules wdump FD.Rules $ putStrLn " ---- user catalysts ---- " >> printRules RuleCatalyst rules wdump FD.RulesSpec $ putStrLn " ---- specializations ---- " >> printRules RuleSpecialization rules let seasoning = freeVars [ rs | (k,rs) <- massocs rules', k `notMember` defined ] `intersection` defined defined = fromList $ map (tvrIdent . fst) ds :: IdSet -- our initial program prog <- return prog { progSeasoning = seasoning } Identity prog <- return $ programMapDs (\ (t,e) -> return (shouldBeExported (getExports $ hoExp ho') t,e)) $ atomizeApps False (programSetDs ds prog) -- now we must attach rules to the existing chos, as well as the current ones let addRule c = case mlookup (combIdent c) rules' of Nothing -> c Just rs -> combRules_u (map ruleUpdate . List.union rs) c prog <- return $ progCombinators_u (map addRule) prog cho <- return $ choCombinators_u (fmap addRule) cho -- Here we substitute in all the original types, with rules and properties defined in the current module included prog <- return $ runIdentity $ annotateProgram (choVarMap cho) (idann theProps) letann lamann prog lintCheckProgram (putErrLn "LintPostProcess") prog let entryPoints = fromList . execWriter $ programMapDs_ (\ (t,_) -> when (getProperty prop_EXPORTED t || getProperty prop_INSTANCE t || getProperty prop_SPECIALIZATION t) (tell [tvrIdent t])) prog prog <- return $ prog { progEntry = entryPoints `mappend` progSeasoning prog } lintCheckProgram (putErrLn "InitialLint") prog prog <- programPrune prog -- initial pass, performs -- eta expansion of definitons -- simplify -- type analysis -- floating outward -- simplify -- floating inward let sopt = SS.cacheSimpOpts SS.emptySimplifyOpts { SS.so_boundVars = choCombinators cho, SS.so_forwardVars = progSeasoning prog } let tparms = transformParms { transformPass = "PreInit", transformDumpProgress = verbose } -- quick float inward pass to inline once used functions and prune unused ones prog <- transformProgram tparms { transformCategory = "FloatInward", transformOperation = return . programFloatInward } prog let fint mprog = do let names = pprint [ n | (n,_) <- programDs mprog] when coreMini $ putErrLn ("----\n" ++ names) let tparms = transformParms { transformPass = "Init", transformDumpProgress = coreMini } mprog <- evaluate $ etaAnnotateProgram mprog mprog <- simplifyProgram sopt "Init-One" coreMini mprog mprog <- barendregtProg mprog -- | this catches more static arguments if we wait until after the initial normalizing simplification pass mprog <- transformProgram tparms { transformSkipNoStats = True, transformCategory = "SimpleRecursive" , transformOperation = return . staticArgumentTransform } mprog mprog <- transformProgram tparms { transformCategory = "typeAnalyze", transformPass = "PreInit" , transformOperation = typeAnalyze True } mprog mprog <- transformProgram tparms { transformCategory = "FloatOutward", transformOperation = floatOutward } mprog -- perform another supersimplify in order to substitute the once used -- variables back in and replace the variable of case of variables with -- the default binding of the case statement. mprog <- simplifyProgram sopt "Init-Two-FloatOutCleanup" coreMini mprog mprog <- barendregtProg mprog mprog <- transformProgram tparms { transformCategory = "typeAnalyze", transformOperation = typeAnalyze True } mprog mprog <- transformProgram tparms { transformCategory = "FloatInward", transformOperation = return . programFloatInward } mprog mprog <- return $ Demand.analyzeProgram mprog lintCheckProgram onerrNone mprog mprog <- simplifyProgram sopt "Init-Three-AfterDemand" False mprog mprog <- barendregtProg mprog when miniCorePass $ printProgram mprog -- mapM_ (\ (v,lc) -> printCheckName'' fullDataTable v lc) (programDs mprog) when miniCoreSteps $ Stats.printLStat (optStatLevel options) ("InitialOptimize:" ++ names) (progStats mprog) wdump FD.Progress $ let SubProgram rec = progType mprog in putErr (if rec then "*" else ".") return mprog lintCheckProgram onerrNone prog progress "Initial optimization pass" prog <- programMapProgGroups mempty fint prog progress "!" hFlush stdout >> hFlush stderr wdump FD.Progress $ Stats.printLStat (optStatLevel options) "Initial Pass Stats" (progStats prog) lintCheckProgram onerrNone prog prog <- barendregtProg prog { progStats = mempty } prog <- etaExpandProg "Init-Big-One" prog prog <- transformProgram tparms { transformPass = "Init-Big-One", transformCategory = "FloatInward", transformOperation = return . programFloatInward } prog prog <- return $ Demand.analyzeProgram prog prog <- simplifyProgram' sopt "Init-Big-One" verbose (IterateMax 4) prog wdump FD.Progress $ Stats.printLStat (optStatLevel options) "Init-Big-One Stats" (progStats prog) -- This is the main function that optimizes the routines before writing them out let optWW mprog = do let names = pprint [ n | (n,_) <- programDs mprog] liftIO $ when coreMini $ putErrLn ("----\n" ++ names) smap <- get let tparms = transformParms { transformPass = "OptWW", transformDumpProgress = coreMini } sopt = SS.cacheSimpOpts SS.emptySimplifyOpts { SS.so_boundVars = smap, SS.so_forwardVars = progSeasoning mprog } mprog <- simplifyProgram sopt "Simplify-One" coreMini mprog mprog <- barendregtProg mprog mprog <- transformProgram tparms { transformCategory = "FloatInward", transformOperation = return . programFloatInward } mprog mprog <- return $ Demand.analyzeProgram mprog mprog <- simplifyProgram sopt "Simplify-Two" coreMini mprog mprog <- transformProgram tparms { transformCategory = "FloatInward", transformOperation = return . programFloatInward } mprog mprog <- return $ Demand.analyzeProgram mprog mprog <- return $ E.CPR.cprAnalyzeProgram mprog mprog' <- transformProgram tparms { transformSkipNoStats = True, transformCategory = "WorkWrap", transformOperation = return . workWrapProgram } mprog let wws = length (programDs mprog') - length (programDs mprog) liftIO $ wdump FD.Progress $ putErr (replicate wws 'w') mprog <- return mprog' mprog <- simplifyProgram sopt "Simplify-Three" coreMini mprog --mprog <- transformProgram tparms { transformCategory = "FloatInward", transformOperation = programFloatInward } mprog --mprog <- Demand.analyzeProgram mprog --mprog <- return $ E.CPR.cprAnalyzeProgram mprog --mprog <- transformProgram tparms { transformSkipNoStats = True, transformCategory = "WorkWrap2", transformOperation = return . workWrapProgram } mprog --mprog <- simplifyProgram sopt "Simplify-Four" coreMini mprog -- annotate our bindings for further passes mprog <- return $ etaAnnotateProgram mprog mprog <- return $ Demand.analyzeProgram mprog mprog <- return $ E.CPR.cprAnalyzeProgram mprog put $ fromList [ (combIdent c,c) | c <- progCombinators mprog] `S.union` smap liftIO $ wdump FD.Progress $ let SubProgram rec = progType mprog in putErr (if rec then "*" else ".") return mprog prog <- barendregtProg prog { progStats = mempty } prog <- evalStateT (programMapProgGroups mempty optWW prog) (SS.so_boundVars sopt) progress "!" hFlush stdout >> hFlush stderr wdump FD.Progress $ Stats.printLStat (optStatLevel options) "MainPass Stats" (progStats prog) lintCheckProgram (putErrLn "After the workwrap/CPR") prog prog <- programPrune prog lintCheckProgram (putErrLn "After the Opimization") prog wdump FD.Core $ printProgram prog let newHoBuild = (hoBuild ho') { hoDataTable = dataTable, hoEs = programDs prog, hoRules = hoRules (hoBuild ho') `mappend` rules } newMap = fmap (\c -> Just (EVar $ combHead c)) $ progCombMap prog (mod:_) = Map.keys $ hoExports $ hoExp ho' return (mempty { choHoMap = Map.singleton (show mod) ho' { hoBuild = newHoBuild}, choCombinators = fromList $ [ (combIdent c,c) | c <- progCombinators prog ], choExternalNames = idMapToIdSet newMap, choVarMap = newMap } `mappend` cho,ho' { hoBuild = newHoBuild }) programPruneUnreachable :: Program -> Program programPruneUnreachable prog = progCombinators_s ds' prog where ds' = reachable (newGraph (progCombinators prog) combIdent freeVars) (toList $ progEntry prog) programPrune :: Program -> IO Program programPrune prog = transformProgram transformParms { transformCategory = "PruneUnreachable" , transformDumpProgress = miniCorePass , transformOperation = evaluate . programPruneUnreachable } prog etaExpandProg :: String -> Program -> IO Program etaExpandProg pass prog = do let f prog = prog' { progStats = progStats prog `mappend` stats } where (prog',stats) = Stats.runStatM $ etaExpandProgram prog transformProgram transformParms { transformPass = pass, transformCategory = "EtaExpansion" , transformDumpProgress = miniCorePass, transformOperation = evaluate . f } prog getExports ho = Set.fromList $ map toId $ concat $ Map.elems (hoExports ho) shouldBeExported exports tvr | tvrIdent tvr `Set.member` exports || getProperty prop_SRCLOC_ANNOTATE_FUN tvr = setProperty prop_EXPORTED tvr | otherwise = tvr --idHistogram e = execWriter $ annotate mempty (\id nfo -> tell (Histogram.singleton id) >> return nfo) (\_ -> return) (\_ -> return) e isInteractive :: IO Bool isInteractive = do pn <- System.getProgName return $ (optMode options == Interactive) || "ichj" `isPrefixOf` reverse pn || not (null $ optStmts options) transTypeAnalyze = transformParms { transformCategory = "typeAnalyze", transformOperation = typeAnalyze True } compileModEnv cho = do if optMode options == CompileHo then return () else do let dataTable = progDataTable prog prog = programUpdate program { progCombinators = melems $ choCombinators cho, progClassHierarchy = choClassHierarchy cho, progDataTable = choDataTable cho } rules' = Rules $ fromList [ (combIdent x,combRules x) | x <- melems (choCombinators cho), not $ null (combRules x) ] -- dump final version of various requested things wdump FD.Datatable $ putErrLn (render $ showDataTable dataTable) when (dump FD.ClassSummary) $ do putStrLn " ---- class summary ---- " printClassSummary (choClassHierarchy cho) when (dump FD.Class) $ do putStrLn " ---- class hierarchy ---- " printClassHierarchy (choClassHierarchy cho) wdump FD.Rules $ putStrLn " ---- user rules ---- " >> printRules RuleUser rules' wdump FD.Rules $ putStrLn " ---- user catalysts ---- " >> printRules RuleCatalyst rules' wdump FD.RulesSpec $ putStrLn " ---- specializations ---- " >> printRules RuleSpecialization rules' -- enter interactive mode int <- isInteractive if int then Interactive.interact cho else do when collectPassStats $ do Stats.print "PassStats" Stats.theStats Stats.clear Stats.theStats let mainFunc = parseName Val (maybe "Main.main" snd (optMainFunc options)) esmap <- programEsMap prog (main,mainv) <- getMainFunction dataTable mainFunc esmap let ffiExportNames = [tv | tv <- map combHead $ progCombinators prog, name <- tvrName tv, "FE@" `isPrefixOf` show name] prog <- return prog { progMain = tvrIdent main, progEntry = fromList $ map tvrIdent (main:ffiExportNames), progCombinators = emptyComb { combHead = main, combBody = mainv }:map (unsetProperty prop_EXPORTED) (progCombinators prog) } prog <- transformProgram transformParms { transformCategory = "PruneUnreachable", transformOperation = evaluate . programPruneUnreachable } prog prog <- barendregtProg prog (viaGhc,fn,_,_) <- determineArch wdump FD.Progress $ putStrLn $ "Arch: " ++ fn let theTarget = ELit litCons { litName = dc_Target, litArgs = [ELit (LitInt targetIndex tEnumzh)], litType = ELit litCons { litName = tc_Target, litArgs = [], litType = eStar } } targetIndex = if viaGhc then 1 else 0 prog <- return $ runIdentity $ flip programMapDs prog $ \(t,e) -> return $ if tvrIdent t == toId v_target then (t { tvrInfo = setProperty prop_INLINE mempty },theTarget) else (t,e) --wdump FD.Core $ printProgram prog prog <- if (fopts FO.TypeAnalysis) then do typeAnalyze False prog else return prog when (verbose) $ do putStrLn "Type analyzed methods" flip mapM_ (programDs prog) $ \ (t,e) -> do let (_,ts) = fromLam e ts' = takeWhile (sortKindLike . getType) ts when (not (null ts')) $ putStrLn $ (pprint t) ++ " \\" ++ concat [ "(" ++ show (Info.fetch (tvrInfo t) :: Typ) ++ ")" | t <- ts' ] lintCheckProgram onerrNone prog prog <- programPrune prog --wdump FD.Core $ printProgram prog cmethods <- do let es' = concatMap expandPlaceholder (progCombinators prog) es' <- return [ combBody_u floatInward e | e <- es' ] wdump FD.Class $ do sequence_ [ printCheckName' dataTable (combHead x) (combBody x) | x <- es'] return es' prog <- evaluate $ progCombinators_s ([ p | p <- progCombinators prog, combHead p `notElem` map combHead cmethods] ++ cmethods) prog prog <- annotateProgram mempty (\_ nfo -> return $ unsetProperty prop_INSTANCE nfo) letann (\_ nfo -> return nfo) prog unless (fopts FO.GlobalOptimize) $ do prog <- programPrune prog prog <- barendregtProg prog wdump FD.CoreBeforelift $ printProgram prog prog <- transformProgram transformParms { transformCategory = "LambdaLift", transformDumpProgress = dump FD.Progress, transformOperation = lambdaLift } prog wdump FD.CoreAfterlift $ printProgram prog -- printCheckName dataTable (programE prog) compileToGrin prog exitSuccess prog <- transformProgram transTypeAnalyze { transformPass = "Main-AfterMethod", transformDumpProgress = verbose } prog prog <- barendregtProg prog prog <- simplifyProgram SS.emptySimplifyOpts "Main-One" verbose prog prog <- barendregtProg prog prog <- etaExpandProg "Main-AfterOne" prog prog <- barendregtProg prog prog <- transformProgram transTypeAnalyze { transformPass = "Main-AfterSimp", transformDumpProgress = verbose } prog prog <- barendregtProg prog prog <- simplifyProgram SS.emptySimplifyOpts "Main-Two" verbose prog prog <- barendregtProg prog -- run optimization again with no rules enabled -- delete rules prog <- return $ runIdentity $ annotateProgram mempty (\_ nfo -> return $ modifyProperties (flip (foldr S.delete) [prop_HASRULE,prop_WORKER]) nfo) letann (\_ -> return) prog --prog <- transformProgram "float inward" DontIterate True programFloatInward prog prog <- simplifyProgram SS.emptySimplifyOpts { SS.so_finalPhase = True } "SuperSimplify no rules" verbose prog prog <- barendregtProg prog -- We should float inward right before lambda lifting so that when a case statement is lifted out, it takes any local definitions with it. -- prog <- transformProgram transformParms { -- transformCategory = "FloatInward", -- transformDumpProgress = dump FD.Progress, -- transformOperation = programFloatInward -- } prog -- perform lambda lifting -- prog <- denewtypeProgram prog prog <- transformProgram transformParms { transformCategory = "BoxifyProgram", transformDumpProgress = dump FD.Progress, transformOperation = boxifyProgram } prog prog <- programPrune prog prog <- return $ Demand.analyzeProgram prog prog <- return $ E.CPR.cprAnalyzeProgram prog prog <- transformProgram transformParms { transformCategory = "Boxy WorkWrap", transformDumpProgress = dump FD.Progress, transformOperation = evaluate . workWrapProgram } prog prog <- simplifyProgram SS.emptySimplifyOpts { SS.so_finalPhase = True } "SuperSimplify after Boxy WorkWrap" verbose prog prog <- barendregtProg prog prog <- return $ runIdentity $ programMapBodies (return . cleanupE) prog when viaGhc $ do wdump FD.Core $ printProgram prog fail "Compiling to GHC currently disabled" --compileToHs prog exitSuccess wdump FD.CoreBeforelift $ printProgram prog prog <- transformProgram transformParms { transformCategory = "LambdaLift", transformDumpProgress = dump FD.Progress, transformOperation = lambdaLift } prog wdump FD.CoreAfterlift $ printProgram prog finalStats <- Stats.new -- final optimization pass to clean up lambda lifting droppings -- prog <- flip programMapBodies prog $ \ e -> do -- let cm stats e = do -- let sopt = mempty { SS.so_dataTable = dataTable } -- let (stat, e') = SS.simplifyE sopt e -- Stats.tickStat stats stat -- return e' -- doopt (mangle' Nothing dataTable) False finalStats "PostLambdaLift" cm e -- wdump FD.Progress $ Stats.print "PostLifting" finalStats lintCheckProgram (putErrLn "LintPostLifting") prog wdump FD.Progress $ printEStats (programE prog) when collectPassStats $ do Stats.print "PassStats" Stats.theStats Stats.clear Stats.theStats compileToGrin prog -- | this gets rid of all type variables, replacing them with boxes that can hold any type -- the program is still type-safe, but all polymorphism has been removed in favor of -- implicit coercion to a universal type. -- -- also, all rules are deleted. boxifyProgram :: Monad m => Program -> m Program boxifyProgram prog = ans where ans = do programMapDs f (progCombinators_u (map $ combRules_s []) prog) f (t,e) = do -- putStrLn $ ">>> " ++ pprint t e <- g e return (tv t,e) tv t = t { tvrType = boxify (tvrType t) } g e = do -- putStrLn $ "g: " ++ pprint e emapEG g (return . boxify) e -- (\e -> do putStrLn ("box: " ++ pprint e) ; return $ boxify e) e boxify t | Just e <- followAlias (progDataTable prog) t = boxify e boxify (EPi t e) = EPi t { tvrType = boxify (tvrType t) } (boxify e) boxify v@EVar {} | canBeBox v = mktBox (getType v) boxify (ELit lc) = ELit lc { litArgs = map boxify (litArgs lc) } -- boxify v@(EAp _ _) | canBeBox v = mktBox (getType v) boxify (EAp (ELam t b) e) = boxify (subst t e b) -- boxify (EAp a b) = EAp (boxify a) b -- TODO there should be no applications at the type level by now (boxify b) boxify (EAp a b) = EAp (boxify a) (boxify b) boxify s@ESort {} = s boxify x = error $ "boxify: " ++ show x -- | get rid of unused bindings cleanupE :: E -> E cleanupE e = runIdentity (f e) where f (ELam t@TVr { tvrIdent = v } e) | v /= 0, v `notMember` freeIds e = f (ELam t { tvrIdent = 0 } e) f (EPi t@TVr { tvrIdent = v } e) | v /= 0, v `notMember` freeIds e = f (EPi t { tvrIdent = 0 } e) f ec@ECase { eCaseBind = t@TVr { tvrIdent = v } } | v /= 0, v `notMember` (freeVars (caseBodies ec)::IdSet) = f ec { eCaseBind = t { tvrIdent = 0 } } f e = emapEG f f e simplifyParms = transformParms { transformDumpProgress = verbose, transformCategory = "Simplify", transformPass = "Grin", transformOperation = evaluate . Grin.SSimplify.simplify, transformIterate = IterateDone } compileToGrin prog = do stats <- Stats.new progress "Converting to Grin..." prog <- return $ atomizeApps True prog wdump FD.CoreMangled $ printProgram prog x <- Grin.FromE.compile prog when verbose $ Stats.print "Grin" Stats.theStats wdump FD.GrinInitial $ do dumpGrin "initial" x --x <- return $ normalizeGrin x x <- transformGrin simplifyParms x wdump FD.GrinNormalized $ do dumpGrin "normalized" x lintCheckGrin x let pushGrin grin = do grin <- transformGrin simplifyParms grin nf <- mapMsnd (grinPush undefined) (grinFuncs grin) return $ setGrinFunctions nf grin opt s grin = do stats' <- Stats.new let fop grin = do Grin.Simplify.simplify stats' grin tparms = transformParms { transformDumpProgress = verbose, transformCategory = s, transformPass = "Grin", transformOperation = fop } grin <- transformGrin tparms grin t' <- Stats.isEmpty stats' wdump FD.Progress $ Stats.print s stats' Stats.combine stats stats' case t' of True -> return grin False -> opt s grin x <- deadCode stats (grinEntryPointNames x) x -- XXX x <- evaluate $ Grin.SSimplify.simplify x --x <- transformGrin simplifyParms x x <- pushGrin x x <- opt "Optimization" x lintCheckGrin x x <- grinSpeculate x lintCheckGrin x x <- deadCode stats (grinEntryPointNames x) x -- XXX --x <- transformGrin simplifyParms x x <- opt "Optimization" x --lintCheckGrin x x <- evaluate $ Grin.SSimplify.simplify x wdump FD.OptimizationStats $ Stats.print "Optimization" stats wdump FD.GrinPreeval $ dumpGrin "preeval" x x <- nodeAnalyze x lintCheckGrin x x <- createEvalApply x lintCheckGrin x x <- evaluate $ Grin.SSimplify.simplify x lintCheckGrin x x <- transformGrin devolveTransform x x <- opt "After Devolve Optimization" x x <- transformGrin simplifyParms x x <- return $ twiddleGrin x dumpFinalGrin x compileGrinToC x dumpFinalGrin grin = do wdump FD.GrinGraph $ do let dot = graphGrin grin fn = optOutName options writeFile (fn ++ "_grin.dot") dot dumpGrin "final" grin compileGrinToC grin | optMode options == Interpret = fail "Interpretation currently not supported." compileGrinToC grin | optMode options /= CompileExe = return () compileGrinToC grin = do let (cg,rls) = FG2.compileGrin grin let fn = optOutName options let cf = (fn ++ "_code.c") progress ("Writing " ++ show cf) (argstring,sversion) <- getArgString let boehmOpts | fopts FO.Boehm = ["-D_LHC_GC=1", "-lgc"] | otherwise = [] profileOpts | fopts FO.Profile = ["-D_LHC_PROFILE=1"] | otherwise = [] comm = shellQuote $ [optCC options, "-std=gnu99", "-D_GNU_SOURCE", "-falign-functions=4", "-ffast-math" , "-Wshadow", "-Wextra", "-Wall", "-Wno-unused-parameter", "-o", fn, cf ] ++ (map ("-l" ++) rls) ++ debug ++ optCCargs options ++ boehmOpts ++ profileOpts debug = if fopts FO.Debug then ["-g"] else ["-DNDEBUG", "-O3", "-fomit-frame-pointer"] globalvar n c = "char " ++ n ++ "[] = \"" ++ c ++ "\";" writeFile cf $ unlines [globalvar "lhc_c_compile" comm, globalvar "lhc_command" argstring,globalvar "lhc_version" sversion,"",cg] progress ("Running: " ++ comm) r <- System.system comm when (r /= System.ExitSuccess) $ fail "C code did not compile." return () dumpCore pname prog = do let fn = optOutName options ++ "_" ++ pname ++ ".lhc_core" putErrLn $ "Writing: " ++ fn h <- IO.openFile fn IO.WriteMode (argstring,sversion) <- getArgString IO.hPutStrLn h $ unlines [ "-- " ++ argstring,"-- " ++ sversion,""] hPrintProgram h prog IO.hClose h wdump FD.Core $ do putErrLn $ "v-- " ++ pname ++ " Core" printProgram prog putErrLn $ "^-- " ++ pname ++ " Core" simplifyProgram sopt name dodump prog = liftIO $ do let istat = progStats prog let g prog = do let nprog = SS.programPruneOccurance prog when (corePass && dodump) $ do putStrLn "-- After Occurance Analysis" printProgram nprog return $ SS.programSSimplify sopt nprog prog <- transformProgram transformParms { transformCategory = "Simplify" , transformPass = name , transformIterate = IterateDone , transformDumpProgress = dodump , transformOperation = g } prog { progStats = mempty } when (dodump && (dump FD.Progress || coreSteps)) $ Stats.printLStat (optStatLevel options) ("Total: " ++ name) (progStats prog) return prog { progStats = progStats prog `mappend` istat } {- simplifyProgramPStat sopt name dodump prog = do let istat = progStats prog let g = SS.programSSimplifyPStat sopt { SS.so_dataTable = progDataTable prog } . SS.programPruneOccurance prog <- transformProgram ("PS:" ++ name) IterateDone dodump g prog { progStats = mempty } when ((dodump && dump FD.Progress) || dump FD.CoreSteps) $ Stats.printStat ("Total: " ++ name) (progStats prog) return prog { progStats = progStats prog `mappend` istat } -} simplifyProgram' sopt name dodump iterate prog = do let istat = progStats prog let g = return . SS.programSSimplify sopt . SS.programPruneOccurance prog <- transformProgram transformParms { transformCategory = "Simplify" , transformPass = name , transformIterate = iterate , transformDumpProgress = dodump , transformOperation = g } prog { progStats = mempty } when (dodump && (dump FD.Progress || coreSteps)) $ Stats.printLStat (optStatLevel options) ("Total: " ++ name) (progStats prog) return prog { progStats = progStats prog `mappend` istat } -- all transformation routines assume they are being passed a correct program, and only check the output transformProgram :: MonadIO m => TransformParms Program -> Program -> m Program transformProgram TransformParms { transformIterate = IterateMax n } prog | n <= 0 = return prog transformProgram TransformParms { transformIterate = IterateExactly n } prog | n <= 0 = return prog transformProgram tp prog = liftIO $ do let dodump = transformDumpProgress tp name = transformCategory tp ++ pname (transformPass tp) ++ pname (transformName tp) scname = transformCategory tp ++ pname (transformPass tp) pname "" = "" pname xs = '-':xs iterate = transformIterate tp when dodump $ putErrLn $ "-- " ++ name when (dodump && corePass) $ printProgram prog wdump FD.ESize $ printESize ("Before "++name) prog let istat = progStats prog let ferr e = do putErrLn $ "\n>>> Exception thrown" putErrLn $ "\n>>> Before " ++ name printProgram prog putErrLn $ "\n>>>" #if BASE4 putErrLn (show (e::SomeException)) #else putErrLn (show e) #endif maybeDie return prog prog' <- Control.Exception.catch (transformOperation tp prog { progStats = mempty }) ferr let estat = progStats prog' onerr = do putErrLn $ "\n>>> Before " ++ name printProgram prog Stats.printStat name estat putErrLn $ "\n>>> After " ++ name if transformSkipNoStats tp && estat == mempty then do when dodump $ putErrLn "program not changed" return prog else do when (dodump && dump FD.CoreSteps && (not $ Stats.null estat)) $ Stats.printLStat (optStatLevel options) name estat when collectPassStats $ do Stats.tick Stats.theStats scname Stats.tickStat Stats.theStats (Stats.prependStat scname estat) wdump FD.ESize $ printESize ("After "++name) prog' lintCheckProgram onerr prog' if doIterate iterate (not $ Stats.null estat) then transformProgram tp { transformIterate = iterateStep iterate } prog' { progStats = istat `mappend` estat } else return prog' { progStats = istat `mappend` estat, progPasses = name:progPasses prog' } typecheck dataTable e = case inferType dataTable [] e of Left ss -> do putErrLn (render $ ePretty e) putErrLn $ "\n>>> internal error:\n" ++ unlines (intersperse "----" $ tail ss) maybeDie return Unknown Right v -> return v maybeDie = case optKeepGoing options of True -> return () False -> putErrDie "Internal Error" onerrNone :: IO () onerrNone = return () lintCheckE onerr dataTable tvr e | flint = case inferType dataTable [] e of Left ss -> do onerr putErrLn ">>> Type Error" putErrLn ( render $ hang 4 (pprint tvr <+> equals <+> pprint e)) putErrLn $ "\n>>> internal error:\n" ++ unlines (intersperse "----" $ tail ss) maybeDie Right v -> return () lintCheckE _ _ _ _ = return () lintCheckProgram onerr prog | flint = do when (hasRepeatUnder fst (programDs prog)) $ do onerr let repeats = [ x | x@(_:_:_) <- List.group $ sort (map fst (programDs prog))] putErrLn $ ">>> Repeated top level decls: " ++ pprint repeats printProgram prog putErrLn $ ">>> program has repeated toplevel definitions" ++ pprint repeats maybeDie let f (tvr@TVr { tvrIdent = n },e) | not $ isValidAtom n = do onerr putErrLn $ ">>> non-unique name at top level: " ++ pprint tvr printProgram prog putErrLn $ ">>> non-unique name at top level: " ++ pprint tvr maybeDie f (tvr,e) = do case scopeCheck False mempty e of Left s -> do onerr putErrLn $ ">>> scopecheck failed in " ++ pprint tvr ++ " " ++ s printProgram prog putErrLn $ ">>> scopecheck failed in " ++ pprint tvr ++ " " ++ s maybeDie Right () -> return () lintCheckE onerr (progDataTable prog) tvr e mapM_ f (programDs prog) let ids = progExternalNames prog `mappend` fromList (map tvrIdent $ fsts (programDs prog)) `mappend` progSeasoning prog fvs = Set.fromList $ melems (freeVars $ snds $ programDs prog :: IdMap TVr) unaccounted = Set.filter (not . (`member` ids) . tvrIdent) fvs unless (Set.null unaccounted) $ do onerr putErrLn ("\n>>> Unaccounted for free variables: " ++ render (pprint $ Set.toList $ unaccounted)) printProgram prog putErrLn (">>> Unaccounted for free variables: " ++ render (pprint $ Set.toList $ unaccounted)) --putErrLn (show ids) maybeDie lintCheckProgram _ _ = return () printCheckName' dataTable tvr e = do putErrLn (show $ tvrInfo tvr) putErrLn ( render $ hang 4 (pprint tvr <+> equals <+> pprint e <+> text "::") ) ty <- typecheck dataTable e putErrLn ( render $ indent 4 (pprint ty)) printESize :: String -> Program -> IO () printESize str prog = putErrLn $ str ++ " program e-size: " ++ show (eSize (programE prog))