----------------------------------------------------------------------------- -- -- Module : Language.PureScript -- Copyright : (c) 2013-14 Phil Freeman, (c) 2014 Gary Burgess, and other contributors -- License : MIT -- -- Maintainer : Phil Freeman -- Stability : experimental -- Portability : -- -- | -- The main compiler module -- ----------------------------------------------------------------------------- {-# LANGUAGE DataKinds #-} {-# LANGUAGE FlexibleContexts #-} {-# LANGUAGE ScopedTypeVariables #-} module Language.PureScript ( module P , compile , compile' , RebuildPolicy(..) , MonadMake(..) , make , version ) where import Data.Function (on) import Data.List (sortBy, groupBy, intercalate) import Data.Maybe (fromMaybe) import Data.Time.Clock import Data.Version (Version) import qualified Data.Map as M import qualified Data.Set as S import Control.Applicative import Control.Arrow ((&&&)) import Control.Monad import Control.Monad.Error.Class (MonadError(..)) import Control.Monad.Reader import Control.Monad.Writer import Control.Monad.Supply.Class (fresh) import Language.PureScript.AST as P import Language.PureScript.Comments as P import Language.PureScript.CodeGen import Language.PureScript.DeadCodeElimination as P import Language.PureScript.Environment as P import Language.PureScript.Errors as P import Language.PureScript.Kinds as P import Language.PureScript.Linter as P import Language.PureScript.ModuleDependencies as P import Language.PureScript.Names as P import Language.PureScript.Options as P import Language.PureScript.Parser as P import Language.PureScript.Pretty as P import Language.PureScript.Renamer as P import Language.PureScript.Sugar as P import Control.Monad.Supply as P import Language.PureScript.TypeChecker as P import Language.PureScript.Types as P import qualified Language.PureScript.CoreFn as CoreFn import qualified Language.PureScript.Constants as C import qualified Paths_purescript as Paths -- | -- Compile a collection of modules -- -- The compilation pipeline proceeds as follows: -- -- * Sort the modules based on module dependencies, checking for cyclic dependencies. -- -- * Perform a set of desugaring passes. -- -- * Type check, and elaborate values to include type annotations and type class dictionaries. -- -- * Regroup values to take into account new value dependencies introduced by elaboration. -- -- * Eliminate dead code. -- -- * Generate Javascript, and perform optimization passes. -- -- * Pretty-print the generated Javascript -- compile :: (Functor m, Applicative m, MonadError MultipleErrors m, MonadWriter MultipleErrors m, MonadReader (Options Compile) m) => [Module] -> m ([CoreFn.Module CoreFn.Ann], String, Environment, Integer) compile = compile' initEnvironment compile' :: (Functor m, Applicative m, MonadError MultipleErrors m, MonadWriter MultipleErrors m, MonadReader (Options Compile) m) => Environment -> [Module] -> m ([CoreFn.Module CoreFn.Ann], String, Environment, Integer) compile' env ms = do noPrelude <- asks optionsNoPrelude unless noPrelude (checkPreludeIsDefined ms) additional <- asks optionsAdditional mainModuleIdent <- asks (fmap moduleNameFromString . optionsMain) (sorted, _) <- sortModules $ map importPrim $ if noPrelude then ms else map importPrelude ms mapM_ lint sorted (desugared, nextVar) <- runSupplyT 0 $ desugar sorted (elaborated, env') <- runCheck' env $ forM desugared $ typeCheckModule mainModuleIdent regrouped <- createBindingGroupsModule . collapseBindingGroupsModule $ elaborated let corefn = map (CoreFn.moduleToCoreFn env') regrouped entryPoints = moduleNameFromString `map` entryPointModules additional elim = if null entryPoints then corefn else eliminateDeadCode entryPoints corefn renamed = renameInModules elim codeGenModuleNames = moduleNameFromString `map` codeGenModules additional modulesToCodeGen = if null codeGenModuleNames then renamed else filter (\(CoreFn.Module _ mn _ _ _ _) -> mn `elem` codeGenModuleNames) renamed let exts = intercalate "\n" . map (`moduleToPs` env') $ regrouped return (modulesToCodeGen, exts, env', nextVar) -- | -- A type class which collects the IO actions we need to be able to run in "make" mode -- class (MonadReader (P.Options P.Make) m, MonadError MultipleErrors m, MonadWriter MultipleErrors m) => MonadMake m where -- | -- Get a file timestamp -- getTimestamp :: FilePath -> m (Maybe UTCTime) -- | -- Read a file as a string -- readTextFile :: FilePath -> m String -- | -- Write a text file -- writeTextFile :: FilePath -> String -> m () -- | -- Respond to a progress update -- progress :: String -> m () -- | -- Determines when to rebuild a module -- data RebuildPolicy -- | Never rebuild this module = RebuildNever -- | Always rebuild this module | RebuildAlways deriving (Show, Eq, Ord) -- | -- Compiles in "make" mode, compiling each module separately to a js files and an externs file -- -- If timestamps have not changed, the externs file can be used to provide the module's types without -- having to typecheck the module again. -- make :: forall m. (Functor m, Applicative m, Monad m, MonadMake m) => (ModuleName -> m (Either RebuildPolicy (Maybe UTCTime))) -> (ModuleName -> m (Maybe UTCTime)) -> (ModuleName -> m (FilePath, String)) -> (CoreFn.Module CoreFn.Ann -> String -> Environment -> Integer -> m ()) -> [(Either RebuildPolicy FilePath, Module)] -> m Environment make getInputTimestamp getOutputTimestamp readExterns codegen ms = do noPrelude <- asks optionsNoPrelude unless noPrelude (checkPreludeIsDefined (map snd ms)) (sorted, graph) <- sortModules $ map importPrim $ if noPrelude then map snd ms else map (importPrelude . snd) ms mapM_ lint sorted toRebuild <- foldM (\s (Module _ moduleName' _ _) -> do inputTimestamp <- getInputTimestamp moduleName' outputTimestamp <- getOutputTimestamp moduleName' return $ case (inputTimestamp, outputTimestamp) of (Right (Just t1), Just t2) | t1 < t2 -> s (Left RebuildNever, Just _) -> s _ -> S.insert moduleName' s) S.empty sorted marked <- rebuildIfNecessary (reverseDependencies graph) toRebuild sorted (desugared, nextVar) <- runSupplyT 0 $ zip (map fst marked) <$> desugar (map snd marked) evalSupplyT nextVar $ go initEnvironment desugared where go :: Environment -> [(Bool, Module)] -> SupplyT m Environment go env [] = return env go env ((False, m) : ms') = do (_, env') <- lift . runCheck' env $ typeCheckModule Nothing m go env' ms' go env ((True, m@(Module coms moduleName' _ exps)) : ms') = do lift . progress $ "Compiling " ++ runModuleName moduleName' (Module _ _ elaborated _, env') <- lift . runCheck' env $ typeCheckModule Nothing m regrouped <- createBindingGroups moduleName' . collapseBindingGroups $ elaborated let mod' = Module coms moduleName' regrouped exps corefn = CoreFn.moduleToCoreFn env' mod' [renamed] = renameInModules [corefn] let exts = moduleToPs mod' env' nextVar <- fresh lift $ codegen renamed exts env' nextVar go env' ms' rebuildIfNecessary :: M.Map ModuleName [ModuleName] -> S.Set ModuleName -> [Module] -> m [(Bool, Module)] rebuildIfNecessary _ _ [] = return [] rebuildIfNecessary graph toRebuild (m@(Module _ moduleName' _ _) : ms') | moduleName' `S.member` toRebuild = do let deps = fromMaybe [] $ moduleName' `M.lookup` graph toRebuild' = toRebuild `S.union` S.fromList deps (:) (True, m) <$> rebuildIfNecessary graph toRebuild' ms' rebuildIfNecessary graph toRebuild (Module _ moduleName' _ _ : ms') = do (path, externs) <- readExterns moduleName' externsModules <- fmap (map snd) . alterErrors $ P.parseModulesFromFiles id [(path, externs)] case externsModules of [m'@(Module _ moduleName'' _ _)] | moduleName'' == moduleName' -> (:) (False, m') <$> rebuildIfNecessary graph toRebuild ms' _ -> throwError . errorMessage . InvalidExternsFile $ path where alterErrors = flip catchError $ \(MultipleErrors errs) -> throwError . MultipleErrors $ flip map errs $ \e -> case e of SimpleErrorWrapper (ErrorParsingModule err) -> SimpleErrorWrapper (ErrorParsingExterns err) _ -> e checkPreludeIsDefined :: (MonadWriter MultipleErrors m) => [Module] -> m () checkPreludeIsDefined ms = do let mns = map getModuleName ms unless (preludeModuleName `elem` mns) $ tell (errorMessage PreludeNotPresent) reverseDependencies :: ModuleGraph -> M.Map ModuleName [ModuleName] reverseDependencies g = combine [ (dep, mn) | (mn, deps) <- g, dep <- deps ] where combine :: (Ord a) => [(a, b)] -> M.Map a [b] combine = M.fromList . map ((fst . head) &&& map snd) . groupBy ((==) `on` fst) . sortBy (compare `on` fst) -- | -- Add an import declaration for a module if it does not already explicitly import it. -- addDefaultImport :: ModuleName -> Module -> Module addDefaultImport toImport m@(Module coms mn decls exps) = if isExistingImport `any` decls || mn == toImport then m else Module coms mn (ImportDeclaration toImport Implicit Nothing : decls) exps where isExistingImport (ImportDeclaration mn' _ _) | mn' == toImport = True isExistingImport (PositionedDeclaration _ _ d) = isExistingImport d isExistingImport _ = False importPrim :: Module -> Module importPrim = addDefaultImport (ModuleName [ProperName C.prim]) preludeModuleName :: ModuleName preludeModuleName = ModuleName [ProperName C.prelude] importPrelude :: Module -> Module importPrelude = addDefaultImport preludeModuleName version :: Version version = Paths.version