[Git][ghc/ghc][wip/T26217] 3 commits: ghc-internal: Split out GHC.Internal.TH.Monad from .Syntax

Teo Camarasu pushed to branch wip/T26217 at Glasgow Haskell Compiler / GHC Commits: 840aeea0 by Teo Camarasu at 2025-08-17T23:30:11+01:00 ghc-internal: Split out GHC.Internal.TH.Monad from .Syntax Split the Quasi/Q, etc definition out of GHC.Internal.TH.Syntax into its own module. We do this for a few reasons: - it enables future refactors to speed up compilation of these modules. - it reduces the size of this very large module. - it clarifies which modules in the GHC tree depend on the TH monads (Q/Quasi, etc) and which just care about the syntax tree. A step towards addressing: #26217 - - - - - 9ddc10aa by Teo Camarasu at 2025-08-17T23:30:13+01:00 ghc-internal: Move Data instance for TH.Syntax to Data.Data This means that Data.Data no longer blocks building TH.Syntax, which allows greater parallelism in our builds. Previously TH.Syntax was a bottleneck when compiling ghc-internal. Now it is less of a bottle-neck and is also slightly quicker to compile (since it no longer contains these instances) at the cost of making Data.Data slightly more expensive to compile. TH.Lift which depends on TH.Syntax can also compile quicker and no longer blocks ghc-internal finishing to compile. Resolves #26217 - - - - - c2a0e9e2 by Teo Camarasu at 2025-08-17T23:30:13+01:00 compiler: delete unused names in Builtins.Names.TH returnQ and bindQ are no longer used in the compiler. There was also a very old comment that referred to them that I have modernized - - - - - 23 changed files: - compiler/GHC/Builtin/Names/TH.hs - compiler/GHC/Hs/Expr.hs - compiler/GHC/HsToCore/Quote.hs - compiler/GHC/Rename/Splice.hs - compiler/GHC/Tc/Gen/Splice.hs - compiler/GHC/Tc/Gen/Splice.hs-boot - compiler/GHC/Tc/Types/TH.hs - libraries/base/src/Data/Array/Byte.hs - libraries/base/src/Data/Fixed.hs - + libraries/ghc-boot-th/GHC/Boot/TH/Monad.hs - libraries/ghc-boot-th/GHC/Boot/TH/Ppr.hs - libraries/ghc-boot-th/ghc-boot-th.cabal.in - libraries/ghc-internal/ghc-internal.cabal.in - libraries/ghc-internal/src/GHC/Internal/Data/Data.hs - libraries/ghc-internal/src/GHC/Internal/TH/Lib.hs - libraries/ghc-internal/src/GHC/Internal/TH/Lift.hs - + libraries/ghc-internal/src/GHC/Internal/TH/Monad.hs - libraries/ghc-internal/src/GHC/Internal/TH/Quote.hs - libraries/ghc-internal/src/GHC/Internal/TH/Syntax.hs - libraries/ghci/GHCi/Message.hs - libraries/ghci/GHCi/TH.hs - libraries/template-haskell/Language/Haskell/TH/Quote.hs - libraries/template-haskell/Language/Haskell/TH/Syntax.hs Changes: ===================================== compiler/GHC/Builtin/Names/TH.hs ===================================== @@ -30,7 +30,7 @@ templateHaskellNames :: [Name] -- Should stay in sync with the import list of GHC.HsToCore.Quote templateHaskellNames = [ - returnQName, bindQName, sequenceQName, newNameName, liftName, liftTypedName, + sequenceQName, newNameName, liftName, liftTypedName, mkNameName, mkNameG_vName, mkNameG_dName, mkNameG_tcName, mkNameG_fldName, mkNameLName, mkNameSName, mkNameQName, @@ -181,26 +181,30 @@ templateHaskellNames = [ -- Quasiquoting quasiQuoterTyConName, quoteDecName, quoteTypeName, quoteExpName, quotePatName] -thSyn, thLib, qqLib, liftLib :: Module +thSyn, thMonad, thLib, qqLib, liftLib :: Module thSyn = mkTHModule (fsLit "GHC.Internal.TH.Syntax") +thMonad = mkTHModule (fsLit "GHC.Internal.TH.Monad") thLib = mkTHModule (fsLit "GHC.Internal.TH.Lib") qqLib = mkTHModule (fsLit "GHC.Internal.TH.Quote") liftLib = mkTHModule (fsLit "GHC.Internal.TH.Lift") + mkTHModule :: FastString -> Module mkTHModule m = mkModule ghcInternalUnit (mkModuleNameFS m) -libFun, libTc, thFun, thTc, thCls, thCon, liftFun :: FastString -> Unique -> Name +libFun, libTc, thFun, thTc, thCon, liftFun, thMonadTc, thMonadCls, thMonadFun :: FastString -> Unique -> Name libFun = mk_known_key_name varName thLib libTc = mk_known_key_name tcName thLib thFun = mk_known_key_name varName thSyn thTc = mk_known_key_name tcName thSyn -thCls = mk_known_key_name clsName thSyn thCon = mk_known_key_name dataName thSyn liftFun = mk_known_key_name varName liftLib +thMonadTc = mk_known_key_name tcName thMonad +thMonadCls = mk_known_key_name clsName thMonad +thMonadFun = mk_known_key_name varName thMonad -thFld :: FastString -> FastString -> Unique -> Name -thFld con = mk_known_key_name (fieldName con) thSyn +thMonadFld :: FastString -> FastString -> Unique -> Name +thMonadFld con = mk_known_key_name (fieldName con) thSyn qqFld :: FastString -> Unique -> Name qqFld = mk_known_key_name (fieldName (fsLit "QuasiQuoter")) qqLib @@ -210,14 +214,14 @@ liftClassName :: Name liftClassName = mk_known_key_name clsName liftLib (fsLit "Lift") liftClassKey quoteClassName :: Name -quoteClassName = thCls (fsLit "Quote") quoteClassKey +quoteClassName = thMonadCls (fsLit "Quote") quoteClassKey qTyConName, nameTyConName, fieldExpTyConName, patTyConName, fieldPatTyConName, expTyConName, decTyConName, typeTyConName, matchTyConName, clauseTyConName, funDepTyConName, predTyConName, codeTyConName, injAnnTyConName, overlapTyConName, decsTyConName, modNameTyConName, quasiQuoterTyConName :: Name -qTyConName = thTc (fsLit "Q") qTyConKey +qTyConName = thMonadTc (fsLit "Q") qTyConKey nameTyConName = thTc (fsLit "Name") nameTyConKey fieldExpTyConName = thTc (fsLit "FieldExp") fieldExpTyConKey patTyConName = thTc (fsLit "Pat") patTyConKey @@ -230,20 +234,18 @@ matchTyConName = thTc (fsLit "Match") matchTyConKey clauseTyConName = thTc (fsLit "Clause") clauseTyConKey funDepTyConName = thTc (fsLit "FunDep") funDepTyConKey predTyConName = thTc (fsLit "Pred") predTyConKey -codeTyConName = thTc (fsLit "Code") codeTyConKey +codeTyConName = thMonadTc (fsLit "Code") codeTyConKey injAnnTyConName = thTc (fsLit "InjectivityAnn") injAnnTyConKey overlapTyConName = thTc (fsLit "Overlap") overlapTyConKey modNameTyConName = thTc (fsLit "ModName") modNameTyConKey quasiQuoterTyConName = mk_known_key_name tcName qqLib (fsLit "QuasiQuoter") quasiQuoterTyConKey -returnQName, bindQName, sequenceQName, newNameName, liftName, +sequenceQName, newNameName, liftName, mkNameName, mkNameG_vName, mkNameG_fldName, mkNameG_dName, mkNameG_tcName, mkNameLName, mkNameSName, liftStringName, unTypeName, unTypeCodeName, unsafeCodeCoerceName, liftTypedName, mkModNameName, mkNameQName :: Name -returnQName = thFun (fsLit "returnQ") returnQIdKey -bindQName = thFun (fsLit "bindQ") bindQIdKey -sequenceQName = thFun (fsLit "sequenceQ") sequenceQIdKey -newNameName = thFun (fsLit "newName") newNameIdKey +sequenceQName = thMonadFun (fsLit "sequenceQ") sequenceQIdKey +newNameName = thMonadFun (fsLit "newName") newNameIdKey mkNameName = thFun (fsLit "mkName") mkNameIdKey mkNameG_vName = thFun (fsLit "mkNameG_v") mkNameG_vIdKey mkNameG_dName = thFun (fsLit "mkNameG_d") mkNameG_dIdKey @@ -253,9 +255,9 @@ mkNameLName = thFun (fsLit "mkNameL") mkNameLIdKey mkNameQName = thFun (fsLit "mkNameQ") mkNameQIdKey mkNameSName = thFun (fsLit "mkNameS") mkNameSIdKey mkModNameName = thFun (fsLit "mkModName") mkModNameIdKey -unTypeName = thFld (fsLit "TExp") (fsLit "unType") unTypeIdKey -unTypeCodeName = thFun (fsLit "unTypeCode") unTypeCodeIdKey -unsafeCodeCoerceName = thFun (fsLit "unsafeCodeCoerce") unsafeCodeCoerceIdKey +unTypeName = thMonadFld (fsLit "TExp") (fsLit "unType") unTypeIdKey +unTypeCodeName = thMonadFun (fsLit "unTypeCode") unTypeCodeIdKey +unsafeCodeCoerceName = thMonadFun (fsLit "unsafeCodeCoerce") unsafeCodeCoerceIdKey liftName = liftFun (fsLit "lift") liftIdKey liftStringName = liftFun (fsLit "liftString") liftStringIdKey liftTypedName = liftFun (fsLit "liftTyped") liftTypedIdKey @@ -808,12 +810,10 @@ dataNamespaceSpecifierDataConKey = mkPreludeDataConUnique 215 -- IdUniques available: 200-499 -- If you want to change this, make sure you check in GHC.Builtin.Names -returnQIdKey, bindQIdKey, sequenceQIdKey, liftIdKey, newNameIdKey, +sequenceQIdKey, liftIdKey, newNameIdKey, mkNameIdKey, mkNameG_vIdKey, mkNameG_fldIdKey, mkNameG_dIdKey, mkNameG_tcIdKey, mkNameLIdKey, mkNameSIdKey, unTypeIdKey, unTypeCodeIdKey, unsafeCodeCoerceIdKey, liftTypedIdKey, mkModNameIdKey, mkNameQIdKey :: Unique -returnQIdKey = mkPreludeMiscIdUnique 200 -bindQIdKey = mkPreludeMiscIdUnique 201 sequenceQIdKey = mkPreludeMiscIdUnique 202 liftIdKey = mkPreludeMiscIdUnique 203 newNameIdKey = mkPreludeMiscIdUnique 204 ===================================== compiler/GHC/Hs/Expr.hs ===================================== @@ -68,7 +68,7 @@ import GHC.Tc.Utils.TcType (TcType, TcTyVar) import {-# SOURCE #-} GHC.Tc.Types.LclEnv (TcLclEnv) import GHCi.RemoteTypes ( ForeignRef ) -import qualified GHC.Boot.TH.Syntax as TH (Q) +import qualified GHC.Boot.TH.Monad as TH (Q) -- libraries: import Data.Data hiding (Fixity(..)) ===================================== compiler/GHC/HsToCore/Quote.hs ===================================== @@ -245,14 +245,14 @@ first generate a polymorphic definition and then just apply the wrapper at the e [| \x -> x |] ====> - gensym (unpackString "x"#) `bindQ` \ x1::String -> - lam (pvar x1) (var x1) + newName (unpackString "x"#) >>= \ x1::Name -> + lamE (varP x1) (varE x1) [| \x -> $(f [| x |]) |] ====> - gensym (unpackString "x"#) `bindQ` \ x1::String -> - lam (pvar x1) (f (var x1)) + newName (unpackString "x"#) >>= \ x1::Name -> + lamE (varP x1) (f (varE x1)) -} ===================================== compiler/GHC/Rename/Splice.hs ===================================== @@ -68,7 +68,7 @@ import {-# SOURCE #-} GHC.Tc.Gen.Splice import GHC.Tc.Zonk.Type import GHCi.RemoteTypes ( ForeignRef ) -import qualified GHC.Boot.TH.Syntax as TH (Q) +import qualified GHC.Boot.TH.Monad as TH (Q) import qualified GHC.LanguageExtensions as LangExt import qualified Data.Set as Set ===================================== compiler/GHC/Tc/Gen/Splice.hs ===================================== @@ -144,6 +144,7 @@ import qualified GHC.LanguageExtensions as LangExt -- THSyntax gives access to internal functions and data types import qualified GHC.Boot.TH.Syntax as TH +import qualified GHC.Boot.TH.Monad as TH import qualified GHC.Boot.TH.Ppr as TH #if defined(HAVE_INTERNAL_INTERPRETER) ===================================== compiler/GHC/Tc/Gen/Splice.hs-boot ===================================== @@ -12,6 +12,7 @@ import GHC.Hs.Extension ( GhcRn, GhcPs, GhcTc ) import GHC.Hs ( HsQuote, HsExpr, LHsExpr, LHsType, LPat, LHsDecl, ThModFinalizers, HsUntypedSpliceResult, HsTypedSpliceResult, HsTypedSplice ) import qualified GHC.Boot.TH.Syntax as TH +import qualified GHC.Boot.TH.Monad as TH tcTypedSplice :: HsTypedSpliceResult -> HsTypedSplice GhcRn ===================================== compiler/GHC/Tc/Types/TH.hs ===================================== @@ -18,7 +18,7 @@ module GHC.Tc.Types.TH ( import GHC.Prelude import GHCi.RemoteTypes -import qualified GHC.Boot.TH.Syntax as TH +import qualified GHC.Boot.TH.Monad as TH import GHC.Tc.Types.Evidence import GHC.Utils.Outputable import GHC.Tc.Types.TcRef ===================================== libraries/base/src/Data/Array/Byte.hs ===================================== @@ -32,6 +32,7 @@ import GHC.Internal.Show (intToDigit) import GHC.Internal.ST (ST(..), runST) import GHC.Internal.Word (Word8(..)) import GHC.Internal.TH.Syntax +import GHC.Internal.TH.Monad import GHC.Internal.TH.Lift import GHC.Internal.ForeignPtr import Prelude ===================================== libraries/base/src/Data/Fixed.hs ===================================== @@ -91,7 +91,7 @@ import GHC.Internal.TypeLits (KnownNat, natVal) import GHC.Internal.Read import GHC.Internal.Text.ParserCombinators.ReadPrec import GHC.Internal.Text.Read.Lex -import qualified GHC.Internal.TH.Syntax as TH +import qualified GHC.Internal.TH.Monad as TH import qualified GHC.Internal.TH.Lift as TH import Data.Typeable import Prelude ===================================== libraries/ghc-boot-th/GHC/Boot/TH/Monad.hs ===================================== @@ -0,0 +1,6 @@ +{-# LANGUAGE Safe #-} +{-# OPTIONS_HADDOCK not-home #-} +module GHC.Boot.TH.Monad + (module GHC.Internal.TH.Monad) where + +import GHC.Internal.TH.Monad ===================================== libraries/ghc-boot-th/GHC/Boot/TH/Ppr.hs ===================================== @@ -1,4 +1,3 @@ -{-# LANGUAGE Trustworthy #-} {-# LANGUAGE LambdaCase #-} -- | contains a prettyprinter for the -- Template Haskell datatypes ===================================== libraries/ghc-boot-th/ghc-boot-th.cabal.in ===================================== @@ -60,9 +60,11 @@ Library exposed-modules: GHC.Boot.TH.Lib GHC.Boot.TH.Syntax + GHC.Boot.TH.Monad other-modules: GHC.Internal.TH.Lib GHC.Internal.TH.Syntax + GHC.Internal.TH.Monad GHC.Internal.ForeignSrcLang GHC.Internal.LanguageExtensions GHC.Internal.Lexeme @@ -74,4 +76,5 @@ Library GHC.Boot.TH.Lib, GHC.Boot.TH.Lift, GHC.Boot.TH.Quote, - GHC.Boot.TH.Syntax + GHC.Boot.TH.Syntax, + GHC.Boot.TH.Monad ===================================== libraries/ghc-internal/ghc-internal.cabal.in ===================================== @@ -298,6 +298,7 @@ Library GHC.Internal.TH.Lib GHC.Internal.TH.Lift GHC.Internal.TH.Quote + GHC.Internal.TH.Monad GHC.Internal.TopHandler GHC.Internal.TypeError GHC.Internal.TypeLits ===================================== libraries/ghc-internal/src/GHC/Internal/Data/Data.hs ===================================== @@ -143,6 +143,7 @@ import GHC.Internal.Arr -- So we can give Data instance for Array import qualified GHC.Internal.Generics as Generics (Fixity(..)) import GHC.Internal.Generics hiding (Fixity(..)) -- So we can give Data instance for U1, V1, ... +import qualified GHC.Internal.TH.Syntax as TH ------------------------------------------------------------------------------ -- @@ -1353,3 +1354,63 @@ deriving instance Data DecidedStrictness -- | @since base-4.12.0.0 deriving instance Data a => Data (Down a) + +---------------------------------------------------------------------------- +-- Data instances for GHC.Internal.TH.Syntax + +deriving instance Data TH.AnnLookup +deriving instance Data TH.AnnTarget +deriving instance Data TH.Bang +deriving instance Data TH.BndrVis +deriving instance Data TH.Body +deriving instance Data TH.Bytes +deriving instance Data TH.Callconv +deriving instance Data TH.Clause +deriving instance Data TH.Con +deriving instance Data TH.Dec +deriving instance Data TH.DecidedStrictness +deriving instance Data TH.DerivClause +deriving instance Data TH.DerivStrategy +deriving instance Data TH.DocLoc +deriving instance Data TH.Exp +deriving instance Data TH.FamilyResultSig +deriving instance Data TH.Fixity +deriving instance Data TH.FixityDirection +deriving instance Data TH.Foreign +deriving instance Data TH.FunDep +deriving instance Data TH.Guard +deriving instance Data TH.Info +deriving instance Data TH.InjectivityAnn +deriving instance Data TH.Inline +deriving instance Data TH.Lit +deriving instance Data TH.Loc +deriving instance Data TH.Match +deriving instance Data TH.ModName +deriving instance Data TH.Module +deriving instance Data TH.ModuleInfo +deriving instance Data TH.Name +deriving instance Data TH.NameFlavour +deriving instance Data TH.NameSpace +deriving instance Data TH.NamespaceSpecifier +deriving instance Data TH.OccName +deriving instance Data TH.Overlap +deriving instance Data TH.Pat +deriving instance Data TH.PatSynArgs +deriving instance Data TH.PatSynDir +deriving instance Data TH.Phases +deriving instance Data TH.PkgName +deriving instance Data TH.Pragma +deriving instance Data TH.Range +deriving instance Data TH.Role +deriving instance Data TH.RuleBndr +deriving instance Data TH.RuleMatch +deriving instance Data TH.Safety +deriving instance Data TH.SourceStrictness +deriving instance Data TH.SourceUnpackedness +deriving instance Data TH.Specificity +deriving instance Data TH.Stmt +deriving instance Data TH.TyLit +deriving instance Data TH.TySynEqn +deriving instance Data TH.Type +deriving instance Data TH.TypeFamilyHead +deriving instance Data flag => Data (TH.TyVarBndr flag) ===================================== libraries/ghc-internal/src/GHC/Internal/TH/Lib.hs ===================================== @@ -21,6 +21,7 @@ module GHC.Internal.TH.Lib where import GHC.Internal.TH.Syntax hiding (Role, InjectivityAnn) +import GHC.Internal.TH.Monad import qualified GHC.Internal.TH.Syntax as TH #ifdef BOOTSTRAP_TH ===================================== libraries/ghc-internal/src/GHC/Internal/TH/Lift.hs ===================================== @@ -30,6 +30,7 @@ module GHC.Internal.TH.Lift where import GHC.Internal.TH.Syntax +import GHC.Internal.TH.Monad import qualified GHC.Internal.TH.Lib as Lib (litE) -- See wrinkle (W4) of Note [Tracking dependencies on primitives] import GHC.Internal.Data.Either ===================================== libraries/ghc-internal/src/GHC/Internal/TH/Monad.hs ===================================== @@ -0,0 +1,971 @@ +{-# OPTIONS_HADDOCK not-home #-} -- we want users to import Language.Haskell.TH.Syntax instead +{-# LANGUAGE CPP #-} +{-# LANGUAGE DataKinds #-} +{-# LANGUAGE FlexibleInstances #-} +{-# LANGUAGE GADTs#-} +{-# LANGUAGE PolyKinds #-} +{-# LANGUAGE RankNTypes #-} +{-# LANGUAGE RoleAnnotations #-} +{-# LANGUAGE ScopedTypeVariables #-} +{-# LANGUAGE StandaloneKindSignatures #-} +{-# LANGUAGE Trustworthy #-} +{-# LANGUAGE UnboxedSums #-} + +-- | This module is used internally in GHC's integration with Template Haskell +-- and defines the Monads of Template Haskell, and associated definitions. +-- +-- This is not a part of the public API, and as such, there are no API +-- guarantees for this module from version to version. +-- +-- Import "Language.Haskell.TH" or "Language.Haskell.TH.Syntax" instead! +module GHC.Internal.TH.Monad + ( module GHC.Internal.TH.Monad + ) where + +#ifdef BOOTSTRAP_TH +import Prelude +import Data.Data hiding (Fixity(..)) +import Data.IORef +import System.IO.Unsafe ( unsafePerformIO ) +import Control.Monad.IO.Class (MonadIO (..)) +import Control.Monad.Fix (MonadFix (..)) +import Control.Exception (BlockedIndefinitelyOnMVar (..), catch, throwIO) +import Control.Exception.Base (FixIOException (..)) +import Control.Concurrent.MVar (newEmptyMVar, readMVar, putMVar) +import System.IO ( hPutStrLn, stderr ) +import qualified Data.Kind as Kind (Type) +import GHC.IO.Unsafe ( unsafeDupableInterleaveIO ) +import GHC.Types (TYPE, RuntimeRep(..)) +#else +import GHC.Internal.Base hiding (NonEmpty(..),Type, Module, sequence) +import GHC.Internal.Data.Data hiding (Fixity(..)) +import GHC.Internal.Data.Traversable +import GHC.Internal.IORef +import GHC.Internal.System.IO +import GHC.Internal.Data.Foldable +import GHC.Internal.Data.Typeable +import GHC.Internal.Control.Monad.IO.Class +import GHC.Internal.Control.Monad.Fail +import GHC.Internal.Control.Monad.Fix +import GHC.Internal.Control.Exception +import GHC.Internal.Num +import GHC.Internal.IO.Unsafe +import GHC.Internal.MVar +import GHC.Internal.IO.Exception +import qualified GHC.Internal.Types as Kind (Type) +#endif +import GHC.Internal.ForeignSrcLang +import GHC.Internal.LanguageExtensions +import GHC.Internal.TH.Syntax + +----------------------------------------------------- +-- +-- The Quasi class +-- +----------------------------------------------------- + +class (MonadIO m, MonadFail m) => Quasi m where + -- | Fresh names. See 'newName'. + qNewName :: String -> m Name + + ------- Error reporting and recovery ------- + -- | Report an error (True) or warning (False) + -- ...but carry on; use 'fail' to stop. See 'report'. + qReport :: Bool -> String -> m () + + -- | See 'recover'. + qRecover :: m a -- ^ the error handler + -> m a -- ^ action which may fail + -> m a -- ^ Recover from the monadic 'fail' + + ------- Inspect the type-checker's environment ------- + -- | True <=> type namespace, False <=> value namespace. See 'lookupName'. + qLookupName :: Bool -> String -> m (Maybe Name) + -- | See 'reify'. + qReify :: Name -> m Info + -- | See 'reifyFixity'. + qReifyFixity :: Name -> m (Maybe Fixity) + -- | See 'reifyType'. + qReifyType :: Name -> m Type + -- | Is (n tys) an instance? Returns list of matching instance Decs (with + -- empty sub-Decs) Works for classes and type functions. See 'reifyInstances'. + qReifyInstances :: Name -> [Type] -> m [Dec] + -- | See 'reifyRoles'. + qReifyRoles :: Name -> m [Role] + -- | See 'reifyAnnotations'. + qReifyAnnotations :: Data a => AnnLookup -> m [a] + -- | See 'reifyModule'. + qReifyModule :: Module -> m ModuleInfo + -- | See 'reifyConStrictness'. + qReifyConStrictness :: Name -> m [DecidedStrictness] + + -- | See 'location'. + qLocation :: m Loc + + -- | Input/output (dangerous). See 'runIO'. + qRunIO :: IO a -> m a + qRunIO = liftIO + -- | See 'getPackageRoot'. + qGetPackageRoot :: m FilePath + + -- | See 'addDependentFile'. + qAddDependentFile :: FilePath -> m () + + -- | See 'addTempFile'. + qAddTempFile :: String -> m FilePath + + -- | See 'addTopDecls'. + qAddTopDecls :: [Dec] -> m () + + -- | See 'addForeignFilePath'. + qAddForeignFilePath :: ForeignSrcLang -> String -> m () + + -- | See 'addModFinalizer'. + qAddModFinalizer :: Q () -> m () + + -- | See 'addCorePlugin'. + qAddCorePlugin :: String -> m () + + -- | See 'getQ'. + qGetQ :: Typeable a => m (Maybe a) + + -- | See 'putQ'. + qPutQ :: Typeable a => a -> m () + + -- | See 'isExtEnabled'. + qIsExtEnabled :: Extension -> m Bool + -- | See 'extsEnabled'. + qExtsEnabled :: m [Extension] + + -- | See 'putDoc'. + qPutDoc :: DocLoc -> String -> m () + -- | See 'getDoc'. + qGetDoc :: DocLoc -> m (Maybe String) + +----------------------------------------------------- +-- The IO instance of Quasi +----------------------------------------------------- + +-- | This instance is used only when running a Q +-- computation in the IO monad, usually just to +-- print the result. There is no interesting +-- type environment, so reification isn't going to +-- work. +instance Quasi IO where + qNewName = newNameIO + + qReport True msg = hPutStrLn stderr ("Template Haskell error: " ++ msg) + qReport False msg = hPutStrLn stderr ("Template Haskell error: " ++ msg) + + qLookupName _ _ = badIO "lookupName" + qReify _ = badIO "reify" + qReifyFixity _ = badIO "reifyFixity" + qReifyType _ = badIO "reifyFixity" + qReifyInstances _ _ = badIO "reifyInstances" + qReifyRoles _ = badIO "reifyRoles" + qReifyAnnotations _ = badIO "reifyAnnotations" + qReifyModule _ = badIO "reifyModule" + qReifyConStrictness _ = badIO "reifyConStrictness" + qLocation = badIO "currentLocation" + qRecover _ _ = badIO "recover" -- Maybe we could fix this? + qGetPackageRoot = badIO "getProjectRoot" + qAddDependentFile _ = badIO "addDependentFile" + qAddTempFile _ = badIO "addTempFile" + qAddTopDecls _ = badIO "addTopDecls" + qAddForeignFilePath _ _ = badIO "addForeignFilePath" + qAddModFinalizer _ = badIO "addModFinalizer" + qAddCorePlugin _ = badIO "addCorePlugin" + qGetQ = badIO "getQ" + qPutQ _ = badIO "putQ" + qIsExtEnabled _ = badIO "isExtEnabled" + qExtsEnabled = badIO "extsEnabled" + qPutDoc _ _ = badIO "putDoc" + qGetDoc _ = badIO "getDoc" + +instance Quote IO where + newName = newNameIO + +newNameIO :: String -> IO Name +newNameIO s = do { n <- atomicModifyIORef' counter (\x -> (x + 1, x)) + ; pure (mkNameU s n) } + +badIO :: String -> IO a +badIO op = do { qReport True ("Can't do `" ++ op ++ "' in the IO monad") + ; fail "Template Haskell failure" } + +-- Global variable to generate unique symbols +counter :: IORef Uniq +{-# NOINLINE counter #-} +counter = unsafePerformIO (newIORef 0) + + +----------------------------------------------------- +-- +-- The Q monad +-- +----------------------------------------------------- + +-- | In short, 'Q' provides the 'Quasi' operations in one neat monad for the +-- user. +-- +-- The longer story, is that 'Q' wraps an arbitrary 'Quasi'-able monad. +-- The perceptive reader notices that 'Quasi' has only two instances, 'Q' +-- itself and 'IO', neither of which have concrete implementations.'Q' plays +-- the trick of [dependency +-- inversion](https://en.wikipedia.org/wiki/Dependency_inversion_principle), +-- providing an abstract interface for the user which is later concretely +-- fufilled by an concrete 'Quasi' instance, internal to GHC. +newtype Q a = Q { unQ :: forall m. Quasi m => m a } + +-- | \"Runs\" the 'Q' monad. Normal users of Template Haskell +-- should not need this function, as the splice brackets @$( ... )@ +-- are the usual way of running a 'Q' computation. +-- +-- This function is primarily used in GHC internals, and for debugging +-- splices by running them in 'IO'. +-- +-- Note that many functions in 'Q', such as 'reify' and other compiler +-- queries, are not supported when running 'Q' in 'IO'; these operations +-- simply fail at runtime. Indeed, the only operations guaranteed to succeed +-- are 'newName', 'runIO', 'reportError' and 'reportWarning'. +runQ :: Quasi m => Q a -> m a +runQ (Q m) = m + +instance Monad Q where + Q m >>= k = Q (m >>= \x -> unQ (k x)) + (>>) = (*>) + +instance MonadFail Q where + fail s = report True s >> Q (fail "Q monad failure") + +instance Functor Q where + fmap f (Q x) = Q (fmap f x) + +instance Applicative Q where + pure x = Q (pure x) + Q f <*> Q x = Q (f <*> x) + Q m *> Q n = Q (m *> n) + +-- | @since 2.17.0.0 +instance Semigroup a => Semigroup (Q a) where + (<>) = liftA2 (<>) + +-- | @since 2.17.0.0 +instance Monoid a => Monoid (Q a) where + mempty = pure mempty + +-- | If the function passed to 'mfix' inspects its argument, +-- the resulting action will throw a 'FixIOException'. +-- +-- @since 2.17.0.0 +instance MonadFix Q where + -- We use the same blackholing approach as in fixIO. + -- See Note [Blackholing in fixIO] in System.IO in base. + mfix k = do + m <- runIO newEmptyMVar + ans <- runIO (unsafeDupableInterleaveIO + (readMVar m `catch` \BlockedIndefinitelyOnMVar -> + throwIO FixIOException)) + result <- k ans + runIO (putMVar m result) + return result + + +----------------------------------------------------- +-- +-- The Quote class +-- +----------------------------------------------------- + + + +-- | The 'Quote' class implements the minimal interface which is necessary for +-- desugaring quotations. +-- +-- * The @Monad m@ superclass is needed to stitch together the different +-- AST fragments. +-- * 'newName' is used when desugaring binding structures such as lambdas +-- to generate fresh names. +-- +-- Therefore the type of an untyped quotation in GHC is `Quote m => m Exp` +-- +-- For many years the type of a quotation was fixed to be `Q Exp` but by +-- more precisely specifying the minimal interface it enables the `Exp` to +-- be extracted purely from the quotation without interacting with `Q`. +class Monad m => Quote m where + {- | + Generate a fresh name, which cannot be captured. + + For example, this: + + @f = $(do + nm1 <- newName \"x\" + let nm2 = 'mkName' \"x\" + return ('LamE' ['VarP' nm1] (LamE [VarP nm2] ('VarE' nm1))) + )@ + + will produce the splice + + >f = \x0 -> \x -> x0 + + In particular, the occurrence @VarE nm1@ refers to the binding @VarP nm1@, + and is not captured by the binding @VarP nm2@. + + Although names generated by @newName@ cannot /be captured/, they can + /capture/ other names. For example, this: + + >g = $(do + > nm1 <- newName "x" + > let nm2 = mkName "x" + > return (LamE [VarP nm2] (LamE [VarP nm1] (VarE nm2))) + > ) + + will produce the splice + + >g = \x -> \x0 -> x0 + + since the occurrence @VarE nm2@ is captured by the innermost binding + of @x@, namely @VarP nm1@. + -} + newName :: String -> m Name + +instance Quote Q where + newName s = Q (qNewName s) + +----------------------------------------------------- +-- +-- The TExp type +-- +----------------------------------------------------- + +type TExp :: TYPE r -> Kind.Type +type role TExp nominal -- See Note [Role of TExp] +newtype TExp a = TExp + { unType :: Exp -- ^ Underlying untyped Template Haskell expression + } +-- ^ Typed wrapper around an 'Exp'. +-- +-- This is the typed representation of terms produced by typed quotes. +-- +-- Representation-polymorphic since /template-haskell-2.16.0.0/. + +-- | Discard the type annotation and produce a plain Template Haskell +-- expression +-- +-- Representation-polymorphic since /template-haskell-2.16.0.0/. +unTypeQ :: forall (r :: RuntimeRep) (a :: TYPE r) m . Quote m => m (TExp a) -> m Exp +unTypeQ m = do { TExp e <- m + ; return e } + +-- | Annotate the Template Haskell expression with a type +-- +-- This is unsafe because GHC cannot check for you that the expression +-- really does have the type you claim it has. +-- +-- Representation-polymorphic since /template-haskell-2.16.0.0/. +unsafeTExpCoerce :: forall (r :: RuntimeRep) (a :: TYPE r) m . + Quote m => m Exp -> m (TExp a) +unsafeTExpCoerce m = do { e <- m + ; return (TExp e) } + +{- Note [Role of TExp] +~~~~~~~~~~~~~~~~~~~~~~ +TExp's argument must have a nominal role, not phantom as would +be inferred (#8459). Consider + + e :: Code Q Age + e = [|| MkAge 3 ||] + + foo = $(coerce e) + 4::Int + +The splice will evaluate to (MkAge 3) and you can't add that to +4::Int. So you can't coerce a (Code Q Age) to a (Code Q Int). -} + +-- Code constructor +#if __GLASGOW_HASKELL__ >= 909 +type Code :: (Kind.Type -> Kind.Type) -> forall r. TYPE r -> Kind.Type + -- See Note [Foralls to the right in Code] +#else +type Code :: (Kind.Type -> Kind.Type) -> TYPE r -> Kind.Type +#endif +type role Code representational nominal -- See Note [Role of TExp] +newtype Code m a = Code + { examineCode :: m (TExp a) -- ^ Underlying monadic value + } +-- ^ Represents an expression which has type @a@, built in monadic context @m@. Built on top of 'TExp', typed +-- expressions allow for type-safe splicing via: +-- +-- - typed quotes, written as @[|| ... ||]@ where @...@ is an expression; if +-- that expression has type @a@, then the quotation has type +-- @Quote m => Code m a@ +-- +-- - typed splices inside of typed quotes, written as @$$(...)@ where @...@ +-- is an arbitrary expression of type @Quote m => Code m a@ +-- +-- Traditional expression quotes and splices let us construct ill-typed +-- expressions: +-- +-- >>> fmap ppr $ runQ (unTypeCode [| True == $( [| "foo" |] ) |]) +-- GHC.Internal.Types.True GHC.Internal.Classes.== "foo" +-- >>> GHC.Internal.Types.True GHC.Internal.Classes.== "foo" +-- <interactive> error: +-- • Couldn't match expected type ‘Bool’ with actual type ‘[Char]’ +-- • In the second argument of ‘(==)’, namely ‘"foo"’ +-- In the expression: True == "foo" +-- In an equation for ‘it’: it = True == "foo" +-- +-- With typed expressions, the type error occurs when /constructing/ the +-- Template Haskell expression: +-- +-- >>> fmap ppr $ runQ (unTypeCode [|| True == $$( [|| "foo" ||] ) ||]) +-- <interactive> error: +-- • Couldn't match type ‘[Char]’ with ‘Bool’ +-- Expected type: Code Q Bool +-- Actual type: Code Q [Char] +-- • In the Template Haskell quotation [|| "foo" ||] +-- In the expression: [|| "foo" ||] +-- In the Template Haskell splice $$([|| "foo" ||]) + + +{- Note [Foralls to the right in Code] +~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +Code has the following type signature: + type Code :: (Kind.Type -> Kind.Type) -> forall r. TYPE r -> Kind.Type + +This allows us to write + data T (f :: forall r . (TYPE r) -> Type) = MkT (f Int) (f Int#) + + tcodeq :: T (Code Q) + tcodeq = MkT [||5||] [||5#||] + +If we used the slightly more straightforward signature + type Code :: foral r. (Kind.Type -> Kind.Type) -> TYPE r -> Kind.Type + +then the example above would become ill-typed. (See #23592 for some discussion.) +-} + +-- | Unsafely convert an untyped code representation into a typed code +-- representation. +unsafeCodeCoerce :: forall (r :: RuntimeRep) (a :: TYPE r) m . + Quote m => m Exp -> Code m a +unsafeCodeCoerce m = Code (unsafeTExpCoerce m) + +-- | Lift a monadic action producing code into the typed 'Code' +-- representation +liftCode :: forall (r :: RuntimeRep) (a :: TYPE r) m . m (TExp a) -> Code m a +liftCode = Code + +-- | Extract the untyped representation from the typed representation +unTypeCode :: forall (r :: RuntimeRep) (a :: TYPE r) m . Quote m + => Code m a -> m Exp +unTypeCode = unTypeQ . examineCode + +-- | Modify the ambient monad used during code generation. For example, you +-- can use `hoistCode` to handle a state effect: +-- @ +-- handleState :: Code (StateT Int Q) a -> Code Q a +-- handleState = hoistCode (flip runState 0) +-- @ +hoistCode :: forall m n (r :: RuntimeRep) (a :: TYPE r) . Monad m + => (forall x . m x -> n x) -> Code m a -> Code n a +hoistCode f (Code a) = Code (f a) + + +-- | Variant of '(>>=)' which allows effectful computations to be injected +-- into code generation. +bindCode :: forall m a (r :: RuntimeRep) (b :: TYPE r) . Monad m + => m a -> (a -> Code m b) -> Code m b +bindCode q k = liftCode (q >>= examineCode . k) + +-- | Variant of '(>>)' which allows effectful computations to be injected +-- into code generation. +bindCode_ :: forall m a (r :: RuntimeRep) (b :: TYPE r) . Monad m + => m a -> Code m b -> Code m b +bindCode_ q c = liftCode ( q >> examineCode c) + +-- | A useful combinator for embedding monadic actions into 'Code' +-- @ +-- myCode :: ... => Code m a +-- myCode = joinCode $ do +-- x <- someSideEffect +-- return (makeCodeWith x) +-- @ +joinCode :: forall m (r :: RuntimeRep) (a :: TYPE r) . Monad m + => m (Code m a) -> Code m a +joinCode = flip bindCode id + +---------------------------------------------------- +-- Packaged versions for the programmer, hiding the Quasi-ness + + +-- | Report an error (True) or warning (False), +-- but carry on; use 'fail' to stop. +report :: Bool -> String -> Q () +report b s = Q (qReport b s) +{-# DEPRECATED report "Use reportError or reportWarning instead" #-} -- deprecated in 7.6 + +-- | Report an error to the user, but allow the current splice's computation to carry on. To abort the computation, use 'fail'. +reportError :: String -> Q () +reportError = report True + +-- | Report a warning to the user, and carry on. +reportWarning :: String -> Q () +reportWarning = report False + +-- | Recover from errors raised by 'reportError' or 'fail'. +recover :: Q a -- ^ handler to invoke on failure + -> Q a -- ^ computation to run + -> Q a +recover (Q r) (Q m) = Q (qRecover r m) + +-- We don't export lookupName; the Bool isn't a great API +-- Instead we export lookupTypeName, lookupValueName +lookupName :: Bool -> String -> Q (Maybe Name) +lookupName ns s = Q (qLookupName ns s) + +-- | Look up the given name in the (type namespace of the) current splice's scope. See "Language.Haskell.TH.Syntax#namelookup" for more details. +lookupTypeName :: String -> Q (Maybe Name) +lookupTypeName s = Q (qLookupName True s) + +-- | Look up the given name in the (value namespace of the) current splice's scope. See "Language.Haskell.TH.Syntax#namelookup" for more details. +lookupValueName :: String -> Q (Maybe Name) +lookupValueName s = Q (qLookupName False s) + +{- +Note [Name lookup] +~~~~~~~~~~~~~~~~~~ +-} +{- $namelookup #namelookup# +The functions 'lookupTypeName' and 'lookupValueName' provide +a way to query the current splice's context for what names +are in scope. The function 'lookupTypeName' queries the type +namespace, whereas 'lookupValueName' queries the value namespace, +but the functions are otherwise identical. + +A call @lookupValueName s@ will check if there is a value +with name @s@ in scope at the current splice's location. If +there is, the @Name@ of this value is returned; +if not, then @Nothing@ is returned. + +The returned name cannot be \"captured\". +For example: + +> f = "global" +> g = $( do +> Just nm <- lookupValueName "f" +> [| let f = "local" in $( varE nm ) |] + +In this case, @g = \"global\"@; the call to @lookupValueName@ +returned the global @f@, and this name was /not/ captured by +the local definition of @f@. + +The lookup is performed in the context of the /top-level/ splice +being run. For example: + +> f = "global" +> g = $( [| let f = "local" in +> $(do +> Just nm <- lookupValueName "f" +> varE nm +> ) |] ) + +Again in this example, @g = \"global\"@, because the call to +@lookupValueName@ queries the context of the outer-most @$(...)@. + +Operators should be queried without any surrounding parentheses, like so: + +> lookupValueName "+" + +Qualified names are also supported, like so: + +> lookupValueName "Prelude.+" +> lookupValueName "Prelude.map" + +-} + + +{- | 'reify' looks up information about the 'Name'. It will fail with +a compile error if the 'Name' is not visible. A 'Name' is visible if it is +imported or defined in a prior top-level declaration group. See the +documentation for 'newDeclarationGroup' for more details. + +It is sometimes useful to construct the argument name using 'lookupTypeName' or 'lookupValueName' +to ensure that we are reifying from the right namespace. For instance, in this context: + +> data D = D + +which @D@ does @reify (mkName \"D\")@ return information about? (Answer: @D@-the-type, but don't rely on it.) +To ensure we get information about @D@-the-value, use 'lookupValueName': + +> do +> Just nm <- lookupValueName "D" +> reify nm + +and to get information about @D@-the-type, use 'lookupTypeName'. +-} +reify :: Name -> Q Info +reify v = Q (qReify v) + +{- | @reifyFixity nm@ attempts to find a fixity declaration for @nm@. For +example, if the function @foo@ has the fixity declaration @infixr 7 foo@, then +@reifyFixity 'foo@ would return @'Just' ('Fixity' 7 'InfixR')@. If the function +@bar@ does not have a fixity declaration, then @reifyFixity 'bar@ returns +'Nothing', so you may assume @bar@ has 'defaultFixity'. +-} +reifyFixity :: Name -> Q (Maybe Fixity) +reifyFixity nm = Q (qReifyFixity nm) + +{- | @reifyType nm@ attempts to find the type or kind of @nm@. For example, +@reifyType 'not@ returns @Bool -> Bool@, and +@reifyType ''Bool@ returns @Type@. +This works even if there's no explicit signature and the type or kind is inferred. +-} +reifyType :: Name -> Q Type +reifyType nm = Q (qReifyType nm) + +{- | Template Haskell is capable of reifying information about types and +terms defined in previous declaration groups. Top-level declaration splices break up +declaration groups. + +For an example, consider this code block. We define a datatype @X@ and +then try to call 'reify' on the datatype. + +@ +module Check where + +data X = X + deriving Eq + +$(do + info <- reify ''X + runIO $ print info + ) +@ + +This code fails to compile, noting that @X@ is not available for reification at the site of 'reify'. We can fix this by creating a new declaration group using an empty top-level splice: + +@ +data X = X + deriving Eq + +$(pure []) + +$(do + info <- reify ''X + runIO $ print info + ) +@ + +We provide 'newDeclarationGroup' as a means of documenting this behavior +and providing a name for the pattern. + +Since top level splices infer the presence of the @$( ... )@ brackets, we can also write: + +@ +data X = X + deriving Eq + +newDeclarationGroup + +$(do + info <- reify ''X + runIO $ print info + ) +@ + +-} +newDeclarationGroup :: Q [Dec] +newDeclarationGroup = pure [] + +{- | @reifyInstances nm tys@ returns a list of all visible instances (see below for "visible") +of @nm tys@. That is, +if @nm@ is the name of a type class, then all instances of this class at the types @tys@ +are returned. Alternatively, if @nm@ is the name of a data family or type family, +all instances of this family at the types @tys@ are returned. + +Note that this is a \"shallow\" test; the declarations returned merely have +instance heads which unify with @nm tys@, they need not actually be satisfiable. + + - @reifyInstances ''Eq [ 'TupleT' 2 \``AppT`\` 'ConT' ''A \``AppT`\` 'ConT' ''B ]@ contains + the @instance (Eq a, Eq b) => Eq (a, b)@ regardless of whether @A@ and + @B@ themselves implement 'Eq' + + - @reifyInstances ''Show [ 'VarT' ('mkName' "a") ]@ produces every available + instance of 'Show' + +There is one edge case: @reifyInstances ''Typeable tys@ currently always +produces an empty list (no matter what @tys@ are given). + +In principle, the *visible* instances are +* all instances defined in a prior top-level declaration group + (see docs on @newDeclarationGroup@), or +* all instances defined in any module transitively imported by the + module being compiled + +However, actually searching all modules transitively below the one being +compiled is unreasonably expensive, so @reifyInstances@ will report only the +instance for modules that GHC has had some cause to visit during this +compilation. This is a shortcoming: @reifyInstances@ might fail to report +instances for a type that is otherwise unusued, or instances defined in a +different component. You can work around this shortcoming by explicitly importing the modules +whose instances you want to be visible. GHC issue <https://gitlab.haskell.org/ghc/ghc/-/issues/20529#note_388980 #20529> +has some discussion around this. + +-} +reifyInstances :: Name -> [Type] -> Q [InstanceDec] +reifyInstances cls tys = Q (qReifyInstances cls tys) + +{- | @reifyRoles nm@ returns the list of roles associated with the parameters +(both visible and invisible) of +the tycon @nm@. Fails if @nm@ cannot be found or is not a tycon. +The returned list should never contain 'InferR'. + +An invisible parameter to a tycon is often a kind parameter. For example, if +we have + +@ +type Proxy :: forall k. k -> Type +data Proxy a = MkProxy +@ + +and @reifyRoles Proxy@, we will get @['NominalR', 'PhantomR']@. The 'NominalR' is +the role of the invisible @k@ parameter. Kind parameters are always nominal. +-} +reifyRoles :: Name -> Q [Role] +reifyRoles nm = Q (qReifyRoles nm) + +-- | @reifyAnnotations target@ returns the list of annotations +-- associated with @target@. Only the annotations that are +-- appropriately typed is returned. So if you have @Int@ and @String@ +-- annotations for the same target, you have to call this function twice. +reifyAnnotations :: Data a => AnnLookup -> Q [a] +reifyAnnotations an = Q (qReifyAnnotations an) + +-- | @reifyModule mod@ looks up information about module @mod@. To +-- look up the current module, call this function with the return +-- value of 'Language.Haskell.TH.Lib.thisModule'. +reifyModule :: Module -> Q ModuleInfo +reifyModule m = Q (qReifyModule m) + +-- | @reifyConStrictness nm@ looks up the strictness information for the fields +-- of the constructor with the name @nm@. Note that the strictness information +-- that 'reifyConStrictness' returns may not correspond to what is written in +-- the source code. For example, in the following data declaration: +-- +-- @ +-- data Pair a = Pair a a +-- @ +-- +-- 'reifyConStrictness' would return @['DecidedLazy', DecidedLazy]@ under most +-- circumstances, but it would return @['DecidedStrict', DecidedStrict]@ if the +-- @-XStrictData@ language extension was enabled. +reifyConStrictness :: Name -> Q [DecidedStrictness] +reifyConStrictness n = Q (qReifyConStrictness n) + +-- | Is the list of instances returned by 'reifyInstances' nonempty? +-- +-- If you're confused by an instance not being visible despite being +-- defined in the same module and above the splice in question, see the +-- docs for 'newDeclarationGroup' for a possible explanation. +isInstance :: Name -> [Type] -> Q Bool +isInstance nm tys = do { decs <- reifyInstances nm tys + ; return (not (null decs)) } + +-- | The location at which this computation is spliced. +location :: Q Loc +location = Q qLocation + +-- |The 'runIO' function lets you run an I\/O computation in the 'Q' monad. +-- Take care: you are guaranteed the ordering of calls to 'runIO' within +-- a single 'Q' computation, but not about the order in which splices are run. +-- +-- Note: for various murky reasons, stdout and stderr handles are not +-- necessarily flushed when the compiler finishes running, so you should +-- flush them yourself. +runIO :: IO a -> Q a +runIO m = Q (qRunIO m) + +-- | Get the package root for the current package which is being compiled. +-- This can be set explicitly with the -package-root flag but is normally +-- just the current working directory. +-- +-- The motivation for this flag is to provide a principled means to remove the +-- assumption from splices that they will be executed in the directory where the +-- cabal file resides. Projects such as haskell-language-server can't and don't +-- change directory when compiling files but instead set the -package-root flag +-- appropriately. +getPackageRoot :: Q FilePath +getPackageRoot = Q qGetPackageRoot + + + +-- | Record external files that runIO is using (dependent upon). +-- The compiler can then recognize that it should re-compile the Haskell file +-- when an external file changes. +-- +-- Expects an absolute file path. +-- +-- Notes: +-- +-- * ghc -M does not know about these dependencies - it does not execute TH. +-- +-- * The dependency is based on file content, not a modification time +addDependentFile :: FilePath -> Q () +addDependentFile fp = Q (qAddDependentFile fp) + +-- | Obtain a temporary file path with the given suffix. The compiler will +-- delete this file after compilation. +addTempFile :: String -> Q FilePath +addTempFile suffix = Q (qAddTempFile suffix) + +-- | Add additional top-level declarations. The added declarations will be type +-- checked along with the current declaration group. +addTopDecls :: [Dec] -> Q () +addTopDecls ds = Q (qAddTopDecls ds) + + +-- | Emit a foreign file which will be compiled and linked to the object for +-- the current module. Currently only languages that can be compiled with +-- the C compiler are supported, and the flags passed as part of -optc will +-- be also applied to the C compiler invocation that will compile them. +-- +-- Note that for non-C languages (for example C++) @extern "C"@ directives +-- must be used to get symbols that we can access from Haskell. +-- +-- To get better errors, it is recommended to use #line pragmas when +-- emitting C files, e.g. +-- +-- > {-# LANGUAGE CPP #-} +-- > ... +-- > addForeignSource LangC $ unlines +-- > [ "#line " ++ show (__LINE__ + 1) ++ " " ++ show __FILE__ +-- > , ... +-- > ] +addForeignSource :: ForeignSrcLang -> String -> Q () +addForeignSource lang src = do + let suffix = case lang of + LangC -> "c" + LangCxx -> "cpp" + LangObjc -> "m" + LangObjcxx -> "mm" + LangAsm -> "s" + LangJs -> "js" + RawObject -> "a" + path <- addTempFile suffix + runIO $ writeFile path src + addForeignFilePath lang path + +-- | Same as 'addForeignSource', but expects to receive a path pointing to the +-- foreign file instead of a 'String' of its contents. Consider using this in +-- conjunction with 'addTempFile'. +-- +-- This is a good alternative to 'addForeignSource' when you are trying to +-- directly link in an object file. +addForeignFilePath :: ForeignSrcLang -> FilePath -> Q () +addForeignFilePath lang fp = Q (qAddForeignFilePath lang fp) + +-- | Add a finalizer that will run in the Q monad after the current module has +-- been type checked. This only makes sense when run within a top-level splice. +-- +-- The finalizer is given the local type environment at the splice point. Thus +-- 'reify' is able to find the local definitions when executed inside the +-- finalizer. +addModFinalizer :: Q () -> Q () +addModFinalizer act = Q (qAddModFinalizer (unQ act)) + +-- | Adds a core plugin to the compilation pipeline. +-- +-- @addCorePlugin m@ has almost the same effect as passing @-fplugin=m@ to ghc +-- in the command line. The major difference is that the plugin module @m@ +-- must not belong to the current package. When TH executes, it is too late +-- to tell the compiler that we needed to compile first a plugin module in the +-- current package. +addCorePlugin :: String -> Q () +addCorePlugin plugin = Q (qAddCorePlugin plugin) + +-- | Get state from the 'Q' monad. Note that the state is local to the +-- Haskell module in which the Template Haskell expression is executed. +getQ :: Typeable a => Q (Maybe a) +getQ = Q qGetQ + +-- | Replace the state in the 'Q' monad. Note that the state is local to the +-- Haskell module in which the Template Haskell expression is executed. +putQ :: Typeable a => a -> Q () +putQ x = Q (qPutQ x) + +-- | Determine whether the given language extension is enabled in the 'Q' monad. +isExtEnabled :: Extension -> Q Bool +isExtEnabled ext = Q (qIsExtEnabled ext) + +-- | List all enabled language extensions. +extsEnabled :: Q [Extension] +extsEnabled = Q qExtsEnabled + +-- | Add Haddock documentation to the specified location. This will overwrite +-- any documentation at the location if it already exists. This will reify the +-- specified name, so it must be in scope when you call it. If you want to add +-- documentation to something that you are currently splicing, you can use +-- 'addModFinalizer' e.g. +-- +-- > do +-- > let nm = mkName "x" +-- > addModFinalizer $ putDoc (DeclDoc nm) "Hello" +-- > [d| $(varP nm) = 42 |] +-- +-- The helper functions 'withDecDoc' and 'withDecsDoc' will do this for you, as +-- will the 'funD_doc' and other @_doc@ combinators. +-- You most likely want to have the @-haddock@ flag turned on when using this. +-- Adding documentation to anything outside of the current module will cause an +-- error. +putDoc :: DocLoc -> String -> Q () +putDoc t s = Q (qPutDoc t s) + +-- | Retrieves the Haddock documentation at the specified location, if one +-- exists. +-- It can be used to read documentation on things defined outside of the current +-- module, provided that those modules were compiled with the @-haddock@ flag. +getDoc :: DocLoc -> Q (Maybe String) +getDoc n = Q (qGetDoc n) + +instance MonadIO Q where + liftIO = runIO + +instance Quasi Q where + qNewName = newName + qReport = report + qRecover = recover + qReify = reify + qReifyFixity = reifyFixity + qReifyType = reifyType + qReifyInstances = reifyInstances + qReifyRoles = reifyRoles + qReifyAnnotations = reifyAnnotations + qReifyModule = reifyModule + qReifyConStrictness = reifyConStrictness + qLookupName = lookupName + qLocation = location + qGetPackageRoot = getPackageRoot + qAddDependentFile = addDependentFile + qAddTempFile = addTempFile + qAddTopDecls = addTopDecls + qAddForeignFilePath = addForeignFilePath + qAddModFinalizer = addModFinalizer + qAddCorePlugin = addCorePlugin + qGetQ = getQ + qPutQ = putQ + qIsExtEnabled = isExtEnabled + qExtsEnabled = extsEnabled + qPutDoc = putDoc + qGetDoc = getDoc + + +---------------------------------------------------- +-- The following operations are used solely in GHC.HsToCore.Quote when +-- desugaring brackets. They are not necessary for the user, who can use +-- ordinary return and (>>=) etc + +-- | This function is only used in 'GHC.HsToCore.Quote' when desugaring +-- brackets. This is not necessary for the user, who can use the ordinary +-- 'return' and '(>>=)' operations. +sequenceQ :: forall m . Monad m => forall a . [m a] -> m [a] +sequenceQ = sequence ===================================== libraries/ghc-internal/src/GHC/Internal/TH/Quote.hs ===================================== @@ -20,6 +20,7 @@ module GHC.Internal.TH.Quote( ) where import GHC.Internal.TH.Syntax +import GHC.Internal.TH.Monad import GHC.Internal.Base hiding (Type) ===================================== libraries/ghc-internal/src/GHC/Internal/TH/Syntax.hs ===================================== @@ -1,14 +1,20 @@ {-# OPTIONS_HADDOCK not-home #-} -- we want users to import Language.Haskell.TH.Syntax instead -{-# LANGUAGE CPP, DeriveDataTypeable, - DeriveGeneric, FlexibleInstances, DefaultSignatures, - RankNTypes, RoleAnnotations, ScopedTypeVariables, - MagicHash, KindSignatures, PolyKinds, TypeApplications, DataKinds, - GADTs, UnboxedTuples, UnboxedSums, TypeOperators, - Trustworthy, DeriveFunctor, DeriveTraversable, - BangPatterns, RecordWildCards, ImplicitParams #-} - -{-# LANGUAGE TemplateHaskellQuotes #-} -{-# LANGUAGE StandaloneKindSignatures #-} +{-# LANGUAGE CPP #-} +{-# LANGUAGE DataKinds #-} +{-# LANGUAGE DeriveGeneric #-} +{-# LANGUAGE DeriveTraversable #-} +{-# LANGUAGE FlexibleInstances #-} +{-# LANGUAGE GADTs #-} +{-# LANGUAGE PolyKinds #-} +{-# LANGUAGE RankNTypes #-} +{-# LANGUAGE RoleAnnotations #-} +{-# LANGUAGE ScopedTypeVariables #-} +#ifdef BOOTSTRAP_TH +{-# LANGUAGE Trustworthy #-} +#else +{-# LANGUAGE Safe #-} +#endif +{-# LANGUAGE UnboxedTuples #-} -- | This module is used internally in GHC's integration with Template Haskell -- and defines the abstract syntax of Template Haskell. @@ -26,971 +32,37 @@ module GHC.Internal.TH.Syntax #ifdef BOOTSTRAP_TH import Prelude -import Data.Data hiding (Fixity(..)) -import Data.IORef import System.IO.Unsafe ( unsafePerformIO ) -import Control.Monad.IO.Class (MonadIO (..)) -import Control.Monad.Fix (MonadFix (..)) -import Control.Exception (BlockedIndefinitelyOnMVar (..), catch, throwIO) -import Control.Exception.Base (FixIOException (..)) -import Control.Concurrent.MVar (newEmptyMVar, readMVar, putMVar) -import System.IO ( hPutStrLn, stderr ) import Data.Char ( isAlpha, isAlphaNum, isUpper ) import Data.List.NonEmpty ( NonEmpty(..) ) import Data.Word -import qualified Data.Kind as Kind (Type) import Foreign.ForeignPtr import Foreign.C.String import Foreign.C.Types -import GHC.IO.Unsafe ( unsafeDupableInterleaveIO ) import GHC.Ptr ( Ptr, plusPtr ) import GHC.Generics ( Generic ) -import GHC.Types (TYPE, RuntimeRep(..)) #else import GHC.Internal.Base hiding (NonEmpty(..),Type, Module, sequence) -import GHC.Internal.Data.Data hiding (Fixity(..)) import GHC.Internal.Data.NonEmpty (NonEmpty(..)) import GHC.Internal.Data.Traversable import GHC.Internal.Word import GHC.Internal.Generics (Generic) -import GHC.Internal.IORef -import GHC.Internal.System.IO import GHC.Internal.Show import GHC.Internal.Integer import GHC.Internal.Real import GHC.Internal.Data.Foldable import GHC.Internal.Foreign.Ptr import GHC.Internal.ForeignPtr -import GHC.Internal.Data.Typeable -import GHC.Internal.Control.Monad.IO.Class import GHC.Internal.Foreign.C.Types import GHC.Internal.Foreign.C.String -import GHC.Internal.Control.Monad.Fail -import GHC.Internal.Control.Monad.Fix -import GHC.Internal.Control.Exception import GHC.Internal.Num import GHC.Internal.IO.Unsafe import GHC.Internal.List (dropWhile, break, replicate, reverse, last) -import GHC.Internal.MVar -import GHC.Internal.IO.Exception import GHC.Internal.Unicode -import qualified GHC.Internal.Types as Kind (Type) #endif import GHC.Internal.ForeignSrcLang import GHC.Internal.LanguageExtensions ------------------------------------------------------ --- --- The Quasi class --- ------------------------------------------------------ - -class (MonadIO m, MonadFail m) => Quasi m where - -- | Fresh names. See 'newName'. - qNewName :: String -> m Name - - ------- Error reporting and recovery ------- - -- | Report an error (True) or warning (False) - -- ...but carry on; use 'fail' to stop. See 'report'. - qReport :: Bool -> String -> m () - - -- | See 'recover'. - qRecover :: m a -- ^ the error handler - -> m a -- ^ action which may fail - -> m a -- ^ Recover from the monadic 'fail' - - ------- Inspect the type-checker's environment ------- - -- | True <=> type namespace, False <=> value namespace. See 'lookupName'. - qLookupName :: Bool -> String -> m (Maybe Name) - -- | See 'reify'. - qReify :: Name -> m Info - -- | See 'reifyFixity'. - qReifyFixity :: Name -> m (Maybe Fixity) - -- | See 'reifyType'. - qReifyType :: Name -> m Type - -- | Is (n tys) an instance? Returns list of matching instance Decs (with - -- empty sub-Decs) Works for classes and type functions. See 'reifyInstances'. - qReifyInstances :: Name -> [Type] -> m [Dec] - -- | See 'reifyRoles'. - qReifyRoles :: Name -> m [Role] - -- | See 'reifyAnnotations'. - qReifyAnnotations :: Data a => AnnLookup -> m [a] - -- | See 'reifyModule'. - qReifyModule :: Module -> m ModuleInfo - -- | See 'reifyConStrictness'. - qReifyConStrictness :: Name -> m [DecidedStrictness] - - -- | See 'location'. - qLocation :: m Loc - - -- | Input/output (dangerous). See 'runIO'. - qRunIO :: IO a -> m a - qRunIO = liftIO - -- | See 'getPackageRoot'. - qGetPackageRoot :: m FilePath - - -- | See 'addDependentFile'. - qAddDependentFile :: FilePath -> m () - - -- | See 'addTempFile'. - qAddTempFile :: String -> m FilePath - - -- | See 'addTopDecls'. - qAddTopDecls :: [Dec] -> m () - - -- | See 'addForeignFilePath'. - qAddForeignFilePath :: ForeignSrcLang -> String -> m () - - -- | See 'addModFinalizer'. - qAddModFinalizer :: Q () -> m () - - -- | See 'addCorePlugin'. - qAddCorePlugin :: String -> m () - - -- | See 'getQ'. - qGetQ :: Typeable a => m (Maybe a) - - -- | See 'putQ'. - qPutQ :: Typeable a => a -> m () - - -- | See 'isExtEnabled'. - qIsExtEnabled :: Extension -> m Bool - -- | See 'extsEnabled'. - qExtsEnabled :: m [Extension] - - -- | See 'putDoc'. - qPutDoc :: DocLoc -> String -> m () - -- | See 'getDoc'. - qGetDoc :: DocLoc -> m (Maybe String) - ------------------------------------------------------ --- The IO instance of Quasi ------------------------------------------------------ - --- | This instance is used only when running a Q --- computation in the IO monad, usually just to --- print the result. There is no interesting --- type environment, so reification isn't going to --- work. -instance Quasi IO where - qNewName = newNameIO - - qReport True msg = hPutStrLn stderr ("Template Haskell error: " ++ msg) - qReport False msg = hPutStrLn stderr ("Template Haskell error: " ++ msg) - - qLookupName _ _ = badIO "lookupName" - qReify _ = badIO "reify" - qReifyFixity _ = badIO "reifyFixity" - qReifyType _ = badIO "reifyFixity" - qReifyInstances _ _ = badIO "reifyInstances" - qReifyRoles _ = badIO "reifyRoles" - qReifyAnnotations _ = badIO "reifyAnnotations" - qReifyModule _ = badIO "reifyModule" - qReifyConStrictness _ = badIO "reifyConStrictness" - qLocation = badIO "currentLocation" - qRecover _ _ = badIO "recover" -- Maybe we could fix this? - qGetPackageRoot = badIO "getProjectRoot" - qAddDependentFile _ = badIO "addDependentFile" - qAddTempFile _ = badIO "addTempFile" - qAddTopDecls _ = badIO "addTopDecls" - qAddForeignFilePath _ _ = badIO "addForeignFilePath" - qAddModFinalizer _ = badIO "addModFinalizer" - qAddCorePlugin _ = badIO "addCorePlugin" - qGetQ = badIO "getQ" - qPutQ _ = badIO "putQ" - qIsExtEnabled _ = badIO "isExtEnabled" - qExtsEnabled = badIO "extsEnabled" - qPutDoc _ _ = badIO "putDoc" - qGetDoc _ = badIO "getDoc" - -instance Quote IO where - newName = newNameIO - -newNameIO :: String -> IO Name -newNameIO s = do { n <- atomicModifyIORef' counter (\x -> (x + 1, x)) - ; pure (mkNameU s n) } - -badIO :: String -> IO a -badIO op = do { qReport True ("Can't do `" ++ op ++ "' in the IO monad") - ; fail "Template Haskell failure" } - --- Global variable to generate unique symbols -counter :: IORef Uniq -{-# NOINLINE counter #-} -counter = unsafePerformIO (newIORef 0) - - ------------------------------------------------------ --- --- The Q monad --- ------------------------------------------------------ - --- | In short, 'Q' provides the 'Quasi' operations in one neat monad for the --- user. --- --- The longer story, is that 'Q' wraps an arbitrary 'Quasi'-able monad. --- The perceptive reader notices that 'Quasi' has only two instances, 'Q' --- itself and 'IO', neither of which have concrete implementations.'Q' plays --- the trick of [dependency --- inversion](https://en.wikipedia.org/wiki/Dependency_inversion_principle), --- providing an abstract interface for the user which is later concretely --- fufilled by an concrete 'Quasi' instance, internal to GHC. -newtype Q a = Q { unQ :: forall m. Quasi m => m a } - --- | \"Runs\" the 'Q' monad. Normal users of Template Haskell --- should not need this function, as the splice brackets @$( ... )@ --- are the usual way of running a 'Q' computation. --- --- This function is primarily used in GHC internals, and for debugging --- splices by running them in 'IO'. --- --- Note that many functions in 'Q', such as 'reify' and other compiler --- queries, are not supported when running 'Q' in 'IO'; these operations --- simply fail at runtime. Indeed, the only operations guaranteed to succeed --- are 'newName', 'runIO', 'reportError' and 'reportWarning'. -runQ :: Quasi m => Q a -> m a -runQ (Q m) = m - -instance Monad Q where - Q m >>= k = Q (m >>= \x -> unQ (k x)) - (>>) = (*>) - -instance MonadFail Q where - fail s = report True s >> Q (fail "Q monad failure") - -instance Functor Q where - fmap f (Q x) = Q (fmap f x) - -instance Applicative Q where - pure x = Q (pure x) - Q f <*> Q x = Q (f <*> x) - Q m *> Q n = Q (m *> n) - --- | @since 2.17.0.0 -instance Semigroup a => Semigroup (Q a) where - (<>) = liftA2 (<>) - --- | @since 2.17.0.0 -instance Monoid a => Monoid (Q a) where - mempty = pure mempty - --- | If the function passed to 'mfix' inspects its argument, --- the resulting action will throw a 'FixIOException'. --- --- @since 2.17.0.0 -instance MonadFix Q where - -- We use the same blackholing approach as in fixIO. - -- See Note [Blackholing in fixIO] in System.IO in base. - mfix k = do - m <- runIO newEmptyMVar - ans <- runIO (unsafeDupableInterleaveIO - (readMVar m `catch` \BlockedIndefinitelyOnMVar -> - throwIO FixIOException)) - result <- k ans - runIO (putMVar m result) - return result - - ------------------------------------------------------ --- --- The Quote class --- ------------------------------------------------------ - - - --- | The 'Quote' class implements the minimal interface which is necessary for --- desugaring quotations. --- --- * The @Monad m@ superclass is needed to stitch together the different --- AST fragments. --- * 'newName' is used when desugaring binding structures such as lambdas --- to generate fresh names. --- --- Therefore the type of an untyped quotation in GHC is `Quote m => m Exp` --- --- For many years the type of a quotation was fixed to be `Q Exp` but by --- more precisely specifying the minimal interface it enables the `Exp` to --- be extracted purely from the quotation without interacting with `Q`. -class Monad m => Quote m where - {- | - Generate a fresh name, which cannot be captured. - - For example, this: - - @f = $(do - nm1 <- newName \"x\" - let nm2 = 'mkName' \"x\" - return ('LamE' ['VarP' nm1] (LamE [VarP nm2] ('VarE' nm1))) - )@ - - will produce the splice - - >f = \x0 -> \x -> x0 - - In particular, the occurrence @VarE nm1@ refers to the binding @VarP nm1@, - and is not captured by the binding @VarP nm2@. - - Although names generated by @newName@ cannot /be captured/, they can - /capture/ other names. For example, this: - - >g = $(do - > nm1 <- newName "x" - > let nm2 = mkName "x" - > return (LamE [VarP nm2] (LamE [VarP nm1] (VarE nm2))) - > ) - - will produce the splice - - >g = \x -> \x0 -> x0 - - since the occurrence @VarE nm2@ is captured by the innermost binding - of @x@, namely @VarP nm1@. - -} - newName :: String -> m Name - -instance Quote Q where - newName s = Q (qNewName s) - ------------------------------------------------------ --- --- The TExp type --- ------------------------------------------------------ - -type TExp :: TYPE r -> Kind.Type -type role TExp nominal -- See Note [Role of TExp] -newtype TExp a = TExp - { unType :: Exp -- ^ Underlying untyped Template Haskell expression - } --- ^ Typed wrapper around an 'Exp'. --- --- This is the typed representation of terms produced by typed quotes. --- --- Representation-polymorphic since /template-haskell-2.16.0.0/. - --- | Discard the type annotation and produce a plain Template Haskell --- expression --- --- Representation-polymorphic since /template-haskell-2.16.0.0/. -unTypeQ :: forall (r :: RuntimeRep) (a :: TYPE r) m . Quote m => m (TExp a) -> m Exp -unTypeQ m = do { TExp e <- m - ; return e } - --- | Annotate the Template Haskell expression with a type --- --- This is unsafe because GHC cannot check for you that the expression --- really does have the type you claim it has. --- --- Representation-polymorphic since /template-haskell-2.16.0.0/. -unsafeTExpCoerce :: forall (r :: RuntimeRep) (a :: TYPE r) m . - Quote m => m Exp -> m (TExp a) -unsafeTExpCoerce m = do { e <- m - ; return (TExp e) } - -{- Note [Role of TExp] -~~~~~~~~~~~~~~~~~~~~~~ -TExp's argument must have a nominal role, not phantom as would -be inferred (#8459). Consider - - e :: Code Q Age - e = [|| MkAge 3 ||] - - foo = $(coerce e) + 4::Int - -The splice will evaluate to (MkAge 3) and you can't add that to -4::Int. So you can't coerce a (Code Q Age) to a (Code Q Int). -} - --- Code constructor -#if __GLASGOW_HASKELL__ >= 909 -type Code :: (Kind.Type -> Kind.Type) -> forall r. TYPE r -> Kind.Type - -- See Note [Foralls to the right in Code] -#else -type Code :: (Kind.Type -> Kind.Type) -> TYPE r -> Kind.Type -#endif -type role Code representational nominal -- See Note [Role of TExp] -newtype Code m a = Code - { examineCode :: m (TExp a) -- ^ Underlying monadic value - } --- ^ Represents an expression which has type @a@, built in monadic context @m@. Built on top of 'TExp', typed --- expressions allow for type-safe splicing via: --- --- - typed quotes, written as @[|| ... ||]@ where @...@ is an expression; if --- that expression has type @a@, then the quotation has type --- @Quote m => Code m a@ --- --- - typed splices inside of typed quotes, written as @$$(...)@ where @...@ --- is an arbitrary expression of type @Quote m => Code m a@ --- --- Traditional expression quotes and splices let us construct ill-typed --- expressions: --- --- >>> fmap ppr $ runQ (unTypeCode [| True == $( [| "foo" |] ) |]) --- GHC.Internal.Types.True GHC.Internal.Classes.== "foo" --- >>> GHC.Internal.Types.True GHC.Internal.Classes.== "foo" --- <interactive> error: --- • Couldn't match expected type ‘Bool’ with actual type ‘[Char]’ --- • In the second argument of ‘(==)’, namely ‘"foo"’ --- In the expression: True == "foo" --- In an equation for ‘it’: it = True == "foo" --- --- With typed expressions, the type error occurs when /constructing/ the --- Template Haskell expression: --- --- >>> fmap ppr $ runQ (unTypeCode [|| True == $$( [|| "foo" ||] ) ||]) --- <interactive> error: --- • Couldn't match type ‘[Char]’ with ‘Bool’ --- Expected type: Code Q Bool --- Actual type: Code Q [Char] --- • In the Template Haskell quotation [|| "foo" ||] --- In the expression: [|| "foo" ||] --- In the Template Haskell splice $$([|| "foo" ||]) - - -{- Note [Foralls to the right in Code] -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -Code has the following type signature: - type Code :: (Kind.Type -> Kind.Type) -> forall r. TYPE r -> Kind.Type - -This allows us to write - data T (f :: forall r . (TYPE r) -> Type) = MkT (f Int) (f Int#) - - tcodeq :: T (Code Q) - tcodeq = MkT [||5||] [||5#||] - -If we used the slightly more straightforward signature - type Code :: foral r. (Kind.Type -> Kind.Type) -> TYPE r -> Kind.Type - -then the example above would become ill-typed. (See #23592 for some discussion.) --} - --- | Unsafely convert an untyped code representation into a typed code --- representation. -unsafeCodeCoerce :: forall (r :: RuntimeRep) (a :: TYPE r) m . - Quote m => m Exp -> Code m a -unsafeCodeCoerce m = Code (unsafeTExpCoerce m) - --- | Lift a monadic action producing code into the typed 'Code' --- representation -liftCode :: forall (r :: RuntimeRep) (a :: TYPE r) m . m (TExp a) -> Code m a -liftCode = Code - --- | Extract the untyped representation from the typed representation -unTypeCode :: forall (r :: RuntimeRep) (a :: TYPE r) m . Quote m - => Code m a -> m Exp -unTypeCode = unTypeQ . examineCode - --- | Modify the ambient monad used during code generation. For example, you --- can use `hoistCode` to handle a state effect: --- @ --- handleState :: Code (StateT Int Q) a -> Code Q a --- handleState = hoistCode (flip runState 0) --- @ -hoistCode :: forall m n (r :: RuntimeRep) (a :: TYPE r) . Monad m - => (forall x . m x -> n x) -> Code m a -> Code n a -hoistCode f (Code a) = Code (f a) - - --- | Variant of '(>>=)' which allows effectful computations to be injected --- into code generation. -bindCode :: forall m a (r :: RuntimeRep) (b :: TYPE r) . Monad m - => m a -> (a -> Code m b) -> Code m b -bindCode q k = liftCode (q >>= examineCode . k) - --- | Variant of '(>>)' which allows effectful computations to be injected --- into code generation. -bindCode_ :: forall m a (r :: RuntimeRep) (b :: TYPE r) . Monad m - => m a -> Code m b -> Code m b -bindCode_ q c = liftCode ( q >> examineCode c) - --- | A useful combinator for embedding monadic actions into 'Code' --- @ --- myCode :: ... => Code m a --- myCode = joinCode $ do --- x <- someSideEffect --- return (makeCodeWith x) --- @ -joinCode :: forall m (r :: RuntimeRep) (a :: TYPE r) . Monad m - => m (Code m a) -> Code m a -joinCode = flip bindCode id - ----------------------------------------------------- --- Packaged versions for the programmer, hiding the Quasi-ness - - --- | Report an error (True) or warning (False), --- but carry on; use 'fail' to stop. -report :: Bool -> String -> Q () -report b s = Q (qReport b s) -{-# DEPRECATED report "Use reportError or reportWarning instead" #-} -- deprecated in 7.6 - --- | Report an error to the user, but allow the current splice's computation to carry on. To abort the computation, use 'fail'. -reportError :: String -> Q () -reportError = report True - --- | Report a warning to the user, and carry on. -reportWarning :: String -> Q () -reportWarning = report False - --- | Recover from errors raised by 'reportError' or 'fail'. -recover :: Q a -- ^ handler to invoke on failure - -> Q a -- ^ computation to run - -> Q a -recover (Q r) (Q m) = Q (qRecover r m) - --- We don't export lookupName; the Bool isn't a great API --- Instead we export lookupTypeName, lookupValueName -lookupName :: Bool -> String -> Q (Maybe Name) -lookupName ns s = Q (qLookupName ns s) - --- | Look up the given name in the (type namespace of the) current splice's scope. See "Language.Haskell.TH.Syntax#namelookup" for more details. -lookupTypeName :: String -> Q (Maybe Name) -lookupTypeName s = Q (qLookupName True s) - --- | Look up the given name in the (value namespace of the) current splice's scope. See "Language.Haskell.TH.Syntax#namelookup" for more details. -lookupValueName :: String -> Q (Maybe Name) -lookupValueName s = Q (qLookupName False s) - -{- -Note [Name lookup] -~~~~~~~~~~~~~~~~~~ --} -{- $namelookup #namelookup# -The functions 'lookupTypeName' and 'lookupValueName' provide -a way to query the current splice's context for what names -are in scope. The function 'lookupTypeName' queries the type -namespace, whereas 'lookupValueName' queries the value namespace, -but the functions are otherwise identical. - -A call @lookupValueName s@ will check if there is a value -with name @s@ in scope at the current splice's location. If -there is, the @Name@ of this value is returned; -if not, then @Nothing@ is returned. - -The returned name cannot be \"captured\". -For example: - -> f = "global" -> g = $( do -> Just nm <- lookupValueName "f" -> [| let f = "local" in $( varE nm ) |] - -In this case, @g = \"global\"@; the call to @lookupValueName@ -returned the global @f@, and this name was /not/ captured by -the local definition of @f@. - -The lookup is performed in the context of the /top-level/ splice -being run. For example: - -> f = "global" -> g = $( [| let f = "local" in -> $(do -> Just nm <- lookupValueName "f" -> varE nm -> ) |] ) - -Again in this example, @g = \"global\"@, because the call to -@lookupValueName@ queries the context of the outer-most @$(...)@. - -Operators should be queried without any surrounding parentheses, like so: - -> lookupValueName "+" - -Qualified names are also supported, like so: - -> lookupValueName "Prelude.+" -> lookupValueName "Prelude.map" - --} - - -{- | 'reify' looks up information about the 'Name'. It will fail with -a compile error if the 'Name' is not visible. A 'Name' is visible if it is -imported or defined in a prior top-level declaration group. See the -documentation for 'newDeclarationGroup' for more details. - -It is sometimes useful to construct the argument name using 'lookupTypeName' or 'lookupValueName' -to ensure that we are reifying from the right namespace. For instance, in this context: - -> data D = D - -which @D@ does @reify (mkName \"D\")@ return information about? (Answer: @D@-the-type, but don't rely on it.) -To ensure we get information about @D@-the-value, use 'lookupValueName': - -> do -> Just nm <- lookupValueName "D" -> reify nm - -and to get information about @D@-the-type, use 'lookupTypeName'. --} -reify :: Name -> Q Info -reify v = Q (qReify v) - -{- | @reifyFixity nm@ attempts to find a fixity declaration for @nm@. For -example, if the function @foo@ has the fixity declaration @infixr 7 foo@, then -@reifyFixity 'foo@ would return @'Just' ('Fixity' 7 'InfixR')@. If the function -@bar@ does not have a fixity declaration, then @reifyFixity 'bar@ returns -'Nothing', so you may assume @bar@ has 'defaultFixity'. --} -reifyFixity :: Name -> Q (Maybe Fixity) -reifyFixity nm = Q (qReifyFixity nm) - -{- | @reifyType nm@ attempts to find the type or kind of @nm@. For example, -@reifyType 'not@ returns @Bool -> Bool@, and -@reifyType ''Bool@ returns @Type@. -This works even if there's no explicit signature and the type or kind is inferred. --} -reifyType :: Name -> Q Type -reifyType nm = Q (qReifyType nm) - -{- | Template Haskell is capable of reifying information about types and -terms defined in previous declaration groups. Top-level declaration splices break up -declaration groups. - -For an example, consider this code block. We define a datatype @X@ and -then try to call 'reify' on the datatype. - -@ -module Check where - -data X = X - deriving Eq - -$(do - info <- reify ''X - runIO $ print info - ) -@ - -This code fails to compile, noting that @X@ is not available for reification at the site of 'reify'. We can fix this by creating a new declaration group using an empty top-level splice: - -@ -data X = X - deriving Eq - -$(pure []) - -$(do - info <- reify ''X - runIO $ print info - ) -@ - -We provide 'newDeclarationGroup' as a means of documenting this behavior -and providing a name for the pattern. - -Since top level splices infer the presence of the @$( ... )@ brackets, we can also write: - -@ -data X = X - deriving Eq - -newDeclarationGroup - -$(do - info <- reify ''X - runIO $ print info - ) -@ - --} -newDeclarationGroup :: Q [Dec] -newDeclarationGroup = pure [] - -{- | @reifyInstances nm tys@ returns a list of all visible instances (see below for "visible") -of @nm tys@. That is, -if @nm@ is the name of a type class, then all instances of this class at the types @tys@ -are returned. Alternatively, if @nm@ is the name of a data family or type family, -all instances of this family at the types @tys@ are returned. - -Note that this is a \"shallow\" test; the declarations returned merely have -instance heads which unify with @nm tys@, they need not actually be satisfiable. - - - @reifyInstances ''Eq [ 'TupleT' 2 \``AppT`\` 'ConT' ''A \``AppT`\` 'ConT' ''B ]@ contains - the @instance (Eq a, Eq b) => Eq (a, b)@ regardless of whether @A@ and - @B@ themselves implement 'Eq' - - - @reifyInstances ''Show [ 'VarT' ('mkName' "a") ]@ produces every available - instance of 'Show' - -There is one edge case: @reifyInstances ''Typeable tys@ currently always -produces an empty list (no matter what @tys@ are given). - -In principle, the *visible* instances are -* all instances defined in a prior top-level declaration group - (see docs on @newDeclarationGroup@), or -* all instances defined in any module transitively imported by the - module being compiled - -However, actually searching all modules transitively below the one being -compiled is unreasonably expensive, so @reifyInstances@ will report only the -instance for modules that GHC has had some cause to visit during this -compilation. This is a shortcoming: @reifyInstances@ might fail to report -instances for a type that is otherwise unusued, or instances defined in a -different component. You can work around this shortcoming by explicitly importing the modules -whose instances you want to be visible. GHC issue <https://gitlab.haskell.org/ghc/ghc/-/issues/20529#note_388980 #20529> -has some discussion around this. - --} -reifyInstances :: Name -> [Type] -> Q [InstanceDec] -reifyInstances cls tys = Q (qReifyInstances cls tys) - -{- | @reifyRoles nm@ returns the list of roles associated with the parameters -(both visible and invisible) of -the tycon @nm@. Fails if @nm@ cannot be found or is not a tycon. -The returned list should never contain 'InferR'. - -An invisible parameter to a tycon is often a kind parameter. For example, if -we have - -@ -type Proxy :: forall k. k -> Type -data Proxy a = MkProxy -@ - -and @reifyRoles Proxy@, we will get @['NominalR', 'PhantomR']@. The 'NominalR' is -the role of the invisible @k@ parameter. Kind parameters are always nominal. --} -reifyRoles :: Name -> Q [Role] -reifyRoles nm = Q (qReifyRoles nm) - --- | @reifyAnnotations target@ returns the list of annotations --- associated with @target@. Only the annotations that are --- appropriately typed is returned. So if you have @Int@ and @String@ --- annotations for the same target, you have to call this function twice. -reifyAnnotations :: Data a => AnnLookup -> Q [a] -reifyAnnotations an = Q (qReifyAnnotations an) - --- | @reifyModule mod@ looks up information about module @mod@. To --- look up the current module, call this function with the return --- value of 'Language.Haskell.TH.Lib.thisModule'. -reifyModule :: Module -> Q ModuleInfo -reifyModule m = Q (qReifyModule m) - --- | @reifyConStrictness nm@ looks up the strictness information for the fields --- of the constructor with the name @nm@. Note that the strictness information --- that 'reifyConStrictness' returns may not correspond to what is written in --- the source code. For example, in the following data declaration: --- --- @ --- data Pair a = Pair a a --- @ --- --- 'reifyConStrictness' would return @['DecidedLazy', DecidedLazy]@ under most --- circumstances, but it would return @['DecidedStrict', DecidedStrict]@ if the --- @-XStrictData@ language extension was enabled. -reifyConStrictness :: Name -> Q [DecidedStrictness] -reifyConStrictness n = Q (qReifyConStrictness n) - --- | Is the list of instances returned by 'reifyInstances' nonempty? --- --- If you're confused by an instance not being visible despite being --- defined in the same module and above the splice in question, see the --- docs for 'newDeclarationGroup' for a possible explanation. -isInstance :: Name -> [Type] -> Q Bool -isInstance nm tys = do { decs <- reifyInstances nm tys - ; return (not (null decs)) } - --- | The location at which this computation is spliced. -location :: Q Loc -location = Q qLocation - --- |The 'runIO' function lets you run an I\/O computation in the 'Q' monad. --- Take care: you are guaranteed the ordering of calls to 'runIO' within --- a single 'Q' computation, but not about the order in which splices are run. --- --- Note: for various murky reasons, stdout and stderr handles are not --- necessarily flushed when the compiler finishes running, so you should --- flush them yourself. -runIO :: IO a -> Q a -runIO m = Q (qRunIO m) - --- | Get the package root for the current package which is being compiled. --- This can be set explicitly with the -package-root flag but is normally --- just the current working directory. --- --- The motivation for this flag is to provide a principled means to remove the --- assumption from splices that they will be executed in the directory where the --- cabal file resides. Projects such as haskell-language-server can't and don't --- change directory when compiling files but instead set the -package-root flag --- appropriately. -getPackageRoot :: Q FilePath -getPackageRoot = Q qGetPackageRoot - - - --- | Record external files that runIO is using (dependent upon). --- The compiler can then recognize that it should re-compile the Haskell file --- when an external file changes. --- --- Expects an absolute file path. --- --- Notes: --- --- * ghc -M does not know about these dependencies - it does not execute TH. --- --- * The dependency is based on file content, not a modification time -addDependentFile :: FilePath -> Q () -addDependentFile fp = Q (qAddDependentFile fp) - --- | Obtain a temporary file path with the given suffix. The compiler will --- delete this file after compilation. -addTempFile :: String -> Q FilePath -addTempFile suffix = Q (qAddTempFile suffix) - --- | Add additional top-level declarations. The added declarations will be type --- checked along with the current declaration group. -addTopDecls :: [Dec] -> Q () -addTopDecls ds = Q (qAddTopDecls ds) - - --- | Emit a foreign file which will be compiled and linked to the object for --- the current module. Currently only languages that can be compiled with --- the C compiler are supported, and the flags passed as part of -optc will --- be also applied to the C compiler invocation that will compile them. --- --- Note that for non-C languages (for example C++) @extern "C"@ directives --- must be used to get symbols that we can access from Haskell. --- --- To get better errors, it is recommended to use #line pragmas when --- emitting C files, e.g. --- --- > {-# LANGUAGE CPP #-} --- > ... --- > addForeignSource LangC $ unlines --- > [ "#line " ++ show (__LINE__ + 1) ++ " " ++ show __FILE__ --- > , ... --- > ] -addForeignSource :: ForeignSrcLang -> String -> Q () -addForeignSource lang src = do - let suffix = case lang of - LangC -> "c" - LangCxx -> "cpp" - LangObjc -> "m" - LangObjcxx -> "mm" - LangAsm -> "s" - LangJs -> "js" - RawObject -> "a" - path <- addTempFile suffix - runIO $ writeFile path src - addForeignFilePath lang path - --- | Same as 'addForeignSource', but expects to receive a path pointing to the --- foreign file instead of a 'String' of its contents. Consider using this in --- conjunction with 'addTempFile'. --- --- This is a good alternative to 'addForeignSource' when you are trying to --- directly link in an object file. -addForeignFilePath :: ForeignSrcLang -> FilePath -> Q () -addForeignFilePath lang fp = Q (qAddForeignFilePath lang fp) - --- | Add a finalizer that will run in the Q monad after the current module has --- been type checked. This only makes sense when run within a top-level splice. --- --- The finalizer is given the local type environment at the splice point. Thus --- 'reify' is able to find the local definitions when executed inside the --- finalizer. -addModFinalizer :: Q () -> Q () -addModFinalizer act = Q (qAddModFinalizer (unQ act)) - --- | Adds a core plugin to the compilation pipeline. --- --- @addCorePlugin m@ has almost the same effect as passing @-fplugin=m@ to ghc --- in the command line. The major difference is that the plugin module @m@ --- must not belong to the current package. When TH executes, it is too late --- to tell the compiler that we needed to compile first a plugin module in the --- current package. -addCorePlugin :: String -> Q () -addCorePlugin plugin = Q (qAddCorePlugin plugin) - --- | Get state from the 'Q' monad. Note that the state is local to the --- Haskell module in which the Template Haskell expression is executed. -getQ :: Typeable a => Q (Maybe a) -getQ = Q qGetQ - --- | Replace the state in the 'Q' monad. Note that the state is local to the --- Haskell module in which the Template Haskell expression is executed. -putQ :: Typeable a => a -> Q () -putQ x = Q (qPutQ x) - --- | Determine whether the given language extension is enabled in the 'Q' monad. -isExtEnabled :: Extension -> Q Bool -isExtEnabled ext = Q (qIsExtEnabled ext) - --- | List all enabled language extensions. -extsEnabled :: Q [Extension] -extsEnabled = Q qExtsEnabled - --- | Add Haddock documentation to the specified location. This will overwrite --- any documentation at the location if it already exists. This will reify the --- specified name, so it must be in scope when you call it. If you want to add --- documentation to something that you are currently splicing, you can use --- 'addModFinalizer' e.g. --- --- > do --- > let nm = mkName "x" --- > addModFinalizer $ putDoc (DeclDoc nm) "Hello" --- > [d| $(varP nm) = 42 |] --- --- The helper functions 'withDecDoc' and 'withDecsDoc' will do this for you, as --- will the 'funD_doc' and other @_doc@ combinators. --- You most likely want to have the @-haddock@ flag turned on when using this. --- Adding documentation to anything outside of the current module will cause an --- error. -putDoc :: DocLoc -> String -> Q () -putDoc t s = Q (qPutDoc t s) - --- | Retrieves the Haddock documentation at the specified location, if one --- exists. --- It can be used to read documentation on things defined outside of the current --- module, provided that those modules were compiled with the @-haddock@ flag. -getDoc :: DocLoc -> Q (Maybe String) -getDoc n = Q (qGetDoc n) - -instance MonadIO Q where - liftIO = runIO - -instance Quasi Q where - qNewName = newName - qReport = report - qRecover = recover - qReify = reify - qReifyFixity = reifyFixity - qReifyType = reifyType - qReifyInstances = reifyInstances - qReifyRoles = reifyRoles - qReifyAnnotations = reifyAnnotations - qReifyModule = reifyModule - qReifyConStrictness = reifyConStrictness - qLookupName = lookupName - qLocation = location - qGetPackageRoot = getPackageRoot - qAddDependentFile = addDependentFile - qAddTempFile = addTempFile - qAddTopDecls = addTopDecls - qAddForeignFilePath = addForeignFilePath - qAddModFinalizer = addModFinalizer - qAddCorePlugin = addCorePlugin - qGetQ = getQ - qPutQ = putQ - qIsExtEnabled = isExtEnabled - qExtsEnabled = extsEnabled - qPutDoc = putDoc - qGetDoc = getDoc - - ----------------------------------------------------- --- The following operations are used solely in GHC.HsToCore.Quote when --- desugaring brackets. They are not necessary for the user, who can use --- ordinary return and (>>=) etc - --- | This function is only used in 'GHC.HsToCore.Quote' when desugaring --- brackets. This is not necessary for the user, who can use the ordinary --- 'return' and '(>>=)' operations. -sequenceQ :: forall m . Monad m => forall a . [m a] -> m [a] -sequenceQ = sequence - oneName, manyName :: Name -- | Synonym for @''GHC.Internal.Types.One'@, from @ghc-internal@. oneName = mkNameG DataName "ghc-internal" "GHC.Internal.Types" "One" @@ -1004,19 +76,19 @@ manyName = mkNameG DataName "ghc-internal" "GHC.Internal.Types" "Many" -- | The name of a module. newtype ModName = ModName String -- Module name - deriving (Show,Eq,Ord,Data,Generic) + deriving (Show,Eq,Ord,Generic) -- | The name of a package. newtype PkgName = PkgName String -- package name - deriving (Show,Eq,Ord,Data,Generic) + deriving (Show,Eq,Ord,Generic) -- | Obtained from 'reifyModule' and 'Language.Haskell.TH.Lib.thisModule'. data Module = Module PkgName ModName -- package qualified module name - deriving (Show,Eq,Ord,Data,Generic) + deriving (Show,Eq,Ord,Generic) -- | An "Occurence Name". newtype OccName = OccName String - deriving (Show,Eq,Ord,Data,Generic) + deriving (Show,Eq,Ord,Generic) -- | Smart constructor for 'ModName' mkModName :: String -> ModName @@ -1132,7 +204,7 @@ Names constructed using @newName@ and @mkName@ may be used in bindings (such as @let x = ...@ or @\x -> ...@), but names constructed using @lookupValueName@, @lookupTypeName@, @'f@, @''T@ may not. -} -data Name = Name OccName NameFlavour deriving (Data, Eq, Generic) +data Name = Name OccName NameFlavour deriving (Eq, Generic) instance Ord Name where -- check if unique is different before looking at strings @@ -1148,7 +220,7 @@ data NameFlavour -- An original name (occurrences only, not binders) -- Need the namespace too to be sure which -- thing we are naming - deriving ( Data, Eq, Ord, Show, Generic ) + deriving ( Eq, Ord, Show, Generic ) data NameSpace = VarName -- ^ Variables | DataName -- ^ Data constructors @@ -1162,7 +234,7 @@ data NameSpace = VarName -- ^ Variables -- of the datatype (regardless of whether this constructor has this field). -- - For a field of a pattern synonym, this is the name of the pattern synonym. } - deriving( Eq, Ord, Show, Data, Generic ) + deriving( Eq, Ord, Show, Generic ) -- | @Uniq@ is used by GHC to distinguish names from each other. type Uniq = Integer @@ -1464,7 +536,7 @@ data Loc , loc_module :: String , loc_start :: CharPos , loc_end :: CharPos } - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) type CharPos = (Int, Int) -- ^ Line and character position @@ -1547,13 +619,13 @@ data Info | TyVarI -- Scoped type variable Name Type -- What it is bound to - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | Obtained from 'reifyModule' in the 'Q' Monad. data ModuleInfo = -- | Contains the import list of the module. ModuleInfo [Module] - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) {- | In 'ClassOpI' and 'DataConI', name of the parent class or type @@ -1591,11 +663,11 @@ type InstanceDec = Dec -- | Fixity, as specified in a @infix[lr] n@ declaration. data Fixity = Fixity Int FixityDirection - deriving( Eq, Ord, Show, Data, Generic ) + deriving( Eq, Ord, Show, Generic ) -- | The associativity of an operator, as in an @infix@ declaration. data FixityDirection = InfixL | InfixR | InfixN - deriving( Eq, Ord, Show, Data, Generic ) + deriving( Eq, Ord, Show, Generic ) -- | Highest allowed operator precedence for 'Fixity' constructor (answer: 9) maxPrecedence :: Int @@ -1628,7 +700,7 @@ data Lit = CharL Char -- ^ @\'c\'@ | StringPrimL [Word8] -- ^ @"string"#@. A primitive C-style string, type 'Addr#' | BytesPrimL Bytes -- ^ Some raw bytes, type 'Addr#': | CharPrimL Char -- ^ @\'c\'#@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- We could add Int, Float, Double etc, as we do in HsLit, -- but that could complicate the @@ -1650,7 +722,7 @@ data Bytes = Bytes -- , bytesInitialized :: Bool -- ^ False: only use `bytesSize` to allocate -- -- an uninitialized region } - deriving (Data,Generic) + deriving (Generic) -- We can't derive Show instance for Bytes because we don't want to show the -- pointer value but the actual bytes (similarly to what ByteString does). See @@ -1717,14 +789,14 @@ data Pat | TypeP Type -- ^ @{ type p }@ | InvisP Type -- ^ @{ @p }@ | OrP (NonEmpty Pat) -- ^ @{ p1; p2 }@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | A (field name, pattern) pair. See 'RecP'. type FieldPat = (Name,Pat) -- | A @case@-alternative data Match = Match Pat Body [Dec] -- ^ @case e of { pat -> body where decs }@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | A clause consists of patterns, guards, a body expression, and a list of -- declarations under a @where@. Clauses are seen in equations for function @@ -1732,7 +804,7 @@ data Match = Match Pat Body [Dec] -- ^ @case e of { pat -> body where decs }@ -- etc. data Clause = Clause [Pat] Body [Dec] -- ^ @f { p1 p2 = body where decs }@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | A Haskell expression. data Exp @@ -1827,7 +899,7 @@ data Exp | ForallE [TyVarBndr Specificity] Exp -- ^ @forall \. \@ | ForallVisE [TyVarBndr ()] Exp -- ^ @forall \ -> \@ | ConstrainedE [Exp] Exp -- ^ @\ => \@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | A (field name, expression) pair. See 'RecConE' and 'RecUpdE'. type FieldExp = (Name,Exp) @@ -1841,13 +913,13 @@ data Body -- | e3 = e4 } -- where ds@ | NormalB Exp -- ^ @f p { = e } where ds@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | A single guard. data Guard = NormalG Exp -- ^ @f x { | odd x } = x@ | PatG [Stmt] -- ^ @f x { | Just y <- x, Just z <- y } = z@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | A single statement, as in @do@-notation. data Stmt @@ -1856,14 +928,14 @@ data Stmt | NoBindS Exp -- ^ @e@ | ParS [[Stmt]] -- ^ @x <- e1 | s2, s3 | s4@ (in 'CompE') | RecS [Stmt] -- ^ @rec { s1; s2 }@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | A list/enum range expression. data Range = FromR Exp -- ^ @[n ..]@ | FromThenR Exp Exp -- ^ @[n, m ..]@ | FromToR Exp Exp -- ^ @[n .. m]@ | FromThenToR Exp Exp Exp -- ^ @[n, m .. k]@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | A single declaration. data Dec @@ -1950,7 +1022,7 @@ data Dec -- -- Implicit parameter binding declaration. Can only be used in let -- and where clauses which consist entirely of implicit bindings. - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | A way to specify a namespace to look in when GHC needs to find -- a name's source @@ -1962,7 +1034,7 @@ data NamespaceSpecifier -- or type variable | DataNamespaceSpecifier -- ^ Name should be a term-level entity, such as a -- function, data constructor, or pattern synonym - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | Varieties of allowed instance overlap. data Overlap = Overlappable -- ^ May be overlapped by more specific instances @@ -1971,12 +1043,12 @@ data Overlap = Overlappable -- ^ May be overlapped by more specific instances | Incoherent -- ^ Both 'Overlapping' and 'Overlappable', and -- pick an arbitrary one if multiple choices are -- available. - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | A single @deriving@ clause at the end of a datatype declaration. data DerivClause = DerivClause (Maybe DerivStrategy) Cxt -- ^ @{ deriving stock (Eq, Ord) }@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | What the user explicitly requests when deriving an instance with -- @-XDerivingStrategies@. @@ -1984,7 +1056,7 @@ data DerivStrategy = StockStrategy -- ^ @deriving {stock} C@ | AnyclassStrategy -- ^ @deriving {anyclass} C@, @-XDeriveAnyClass@ | NewtypeStrategy -- ^ @deriving {newtype} C@, @-XGeneralizedNewtypeDeriving@ | ViaStrategy Type -- ^ @deriving C {via T}@, @-XDerivingVia@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | A pattern synonym's type. Note that a pattern synonym's /fully/ -- specified type has a peculiar shape coming with two forall @@ -2040,7 +1112,7 @@ type PatSynType = Type -- between @type family@ and @where@. data TypeFamilyHead = TypeFamilyHead Name [TyVarBndr BndrVis] FamilyResultSig (Maybe InjectivityAnn) - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | One equation of a type family instance or closed type family. The -- arguments are the left-hand-side type and the right-hand-side result. @@ -2060,28 +1132,28 @@ data TypeFamilyHead = -- ('VarT' a) -- @ data TySynEqn = TySynEqn (Maybe [TyVarBndr ()]) Type Type - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | [Functional dependency](https://ghc.gitlab.haskell.org/ghc/doc/users_guide/exts/functional_dependenc...) -- syntax, as in a class declaration. data FunDep = FunDep [Name] [Name] -- ^ @class C a b {| a -> b}@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | A @foreign@ declaration. data Foreign = ImportF Callconv Safety String Name Type -- ^ @foreign import callconv safety "foreign_name" haskellName :: type@ | ExportF Callconv String Name Type -- ^ @foreign export callconv "foreign_name" haskellName :: type@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- keep Callconv in sync with module ForeignCall in ghc/compiler/GHC/Types/ForeignCall.hs -- | A calling convention identifier, as in a 'Foreign' declaration. data Callconv = CCall | StdCall | CApi | Prim | JavaScript - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | A safety level, as in a 'Foreign' declaration. data Safety = Unsafe | Safe | Interruptible - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) data Pragma = InlineP Name Inline RuleMatch Phases -- ^ @{ {\-\# [inline] [rule match] [phases] [phases] name #-} }@. See @@ -2106,7 +1178,7 @@ data Pragma = InlineP Name Inline RuleMatch Phases -- ^ @{ {\-\# COMPLETE C_1, ..., C_i [ :: T ] \#-} }@ | SCCP Name (Maybe String) -- ^ @{ {\-\# SCC fun "optional_name" \#-} }@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | An inline pragma. data Inline = NoInline @@ -2115,7 +1187,7 @@ data Inline = NoInline -- ^ @{ {\-\# INLINE ... #-} }@ | Inlinable -- ^ @{ {\-\# INLINABLE ... #-} }@ - deriving (Show, Eq, Ord, Data, Generic) + deriving (Show, Eq, Ord, Generic) -- | A @CONLIKE@ modifier, as in one of the various inline pragmas, or lack -- thereof ('FunLike'). @@ -2123,7 +1195,7 @@ data RuleMatch = ConLike -- ^ @{ {\-\# CONLIKE [inline] ... #-} }@ | FunLike -- ^ @{ {\-\# [inline] ... #-} }@ - deriving (Show, Eq, Ord, Data, Generic) + deriving (Show, Eq, Ord, Generic) -- | Phase control syntax. data Phases = AllPhases @@ -2132,14 +1204,14 @@ data Phases = AllPhases -- ^ @[n]@ | BeforePhase Int -- ^ @[~n]@ - deriving (Show, Eq, Ord, Data, Generic) + deriving (Show, Eq, Ord, Generic) -- | A binder found in the @forall@ of a @RULES@ pragma. data RuleBndr = RuleVar Name -- ^ @forall {a} ... .@ | TypedRuleVar Name Type -- ^ @forall {(a :: t)} ... .@ - deriving (Show, Eq, Ord, Data, Generic) + deriving (Show, Eq, Ord, Generic) -- | The target of an @ANN@ pragma data AnnTarget = ModuleAnnotation @@ -2148,7 +1220,7 @@ data AnnTarget = ModuleAnnotation -- ^ @{\-\# ANN type {name} ... #-}@ | ValueAnnotation Name -- ^ @{\-\# ANN {name} ... #-}@ - deriving (Show, Eq, Ord, Data, Generic) + deriving (Show, Eq, Ord, Generic) -- | A context, as found on the left side of a @=>@ in a type. type Cxt = [Pred] -- ^ @(Eq a, Ord b)@ @@ -2166,7 +1238,7 @@ data SourceUnpackedness = NoSourceUnpackedness -- ^ @C a@ | SourceNoUnpack -- ^ @C { {\-\# NOUNPACK \#-\} } a@ | SourceUnpack -- ^ @C { {\-\# UNPACK \#-\} } a@ - deriving (Show, Eq, Ord, Data, Generic) + deriving (Show, Eq, Ord, Generic) -- | 'SourceStrictness' corresponds to strictness annotations found in the source code. -- @@ -2175,7 +1247,7 @@ data SourceUnpackedness data SourceStrictness = NoSourceStrictness -- ^ @C a@ | SourceLazy -- ^ @C {~}a@ | SourceStrict -- ^ @C {!}a@ - deriving (Show, Eq, Ord, Data, Generic) + deriving (Show, Eq, Ord, Generic) -- | Unlike 'SourceStrictness' and 'SourceUnpackedness', 'DecidedStrictness' -- refers to the strictness annotations that the compiler chooses for a data constructor @@ -2188,7 +1260,7 @@ data SourceStrictness = NoSourceStrictness -- ^ @C a@ data DecidedStrictness = DecidedLazy -- ^ Field inferred to not have a bang. | DecidedStrict -- ^ Field inferred to have a bang. | DecidedUnpack -- ^ Field inferred to be unpacked. - deriving (Show, Eq, Ord, Data, Generic) + deriving (Show, Eq, Ord, Generic) -- | A data constructor. -- @@ -2253,7 +1325,7 @@ data Con = -- Invariant: the list must be non-empty. [VarBangType] -- ^ The constructor arguments Type -- ^ See Note [GADT return type] - deriving (Show, Eq, Ord, Data, Generic) + deriving (Show, Eq, Ord, Generic) -- Note [GADT return type] -- ~~~~~~~~~~~~~~~~~~~~~~~ @@ -2285,7 +1357,7 @@ data Con = -- | Strictness information in a data constructor's argument. data Bang = Bang SourceUnpackedness SourceStrictness -- ^ @C { {\-\# UNPACK \#-\} !}a@ - deriving (Show, Eq, Ord, Data, Generic) + deriving (Show, Eq, Ord, Generic) -- | A type with a strictness annotation, as in data constructors. See 'Con'. type BangType = (Bang, Type) @@ -2309,14 +1381,14 @@ data PatSynDir = Unidir -- ^ @pattern P x {<-} p@ | ImplBidir -- ^ @pattern P x {=} p@ | ExplBidir [Clause] -- ^ @pattern P x {<-} p where P x = e@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | A pattern synonym's argument type. data PatSynArgs = PrefixPatSyn [Name] -- ^ @pattern P {x y z} = p@ | InfixPatSyn Name Name -- ^ @pattern {x P y} = p@ | RecordPatSyn [Name] -- ^ @pattern P { {x,y,z} } = p@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | A Haskell type. data Type = ForallT [TyVarBndr Specificity] Cxt Type -- ^ @forall \. \ => \@ @@ -2355,12 +1427,12 @@ data Type = ForallT [TyVarBndr Specificity] Cxt Type -- ^ @forall \. \https://ghc.gitlab.haskell.org/ghc/doc/users_guide/exts/type_applications.ht...). data BndrVis = BndrReq -- ^ @a@ | BndrInvis -- ^ @\@a@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | Type family result signature data FamilyResultSig = NoSig -- ^ no signature | KindSig Kind -- ^ @k@ | TyVarSig (TyVarBndr ()) -- ^ @= r, = (r :: k)@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | Injectivity annotation as in an [injective type family](https://ghc.gitlab.haskell.org/ghc/doc/users_guide/exts/type_families.html) data InjectivityAnn = InjectivityAnn Name [Name] - deriving ( Show, Eq, Ord, Data, Generic ) + deriving ( Show, Eq, Ord, Generic ) -- | Type-level literals. data TyLit = NumTyLit Integer -- ^ @2@ | StrTyLit String -- ^ @\"Hello\"@ | CharTyLit Char -- ^ @\'C\'@, @since 4.16.0.0 - deriving ( Show, Eq, Ord, Data, Generic ) + deriving ( Show, Eq, Ord, Generic ) -- | Role annotations data Role = NominalR -- ^ @nominal@ | RepresentationalR -- ^ @representational@ | PhantomR -- ^ @phantom@ | InferR -- ^ @_@ - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | Annotation target for reifyAnnotations data AnnLookup = AnnLookupModule Module | AnnLookupName Name - deriving( Show, Eq, Ord, Data, Generic ) + deriving( Show, Eq, Ord, Generic ) -- | To avoid duplication between kinds and types, they -- are defined to be the same. Naturally, you would never @@ -2454,7 +1526,7 @@ data DocLoc | ArgDoc Name Int -- ^ At a specific argument of a function, indexed by its -- position. | InstDoc Type -- ^ At a class or family instance. - deriving ( Show, Eq, Ord, Data, Generic ) + deriving ( Show, Eq, Ord, Generic ) ----------------------------------------------------- -- Internal helper functions ===================================== libraries/ghci/GHCi/Message.hs ===================================== @@ -63,6 +63,7 @@ import Foreign import GHC.Generics import GHC.Stack.CCS import qualified GHC.Boot.TH.Syntax as TH +import qualified GHC.Boot.TH.Monad as TH import System.Exit import System.IO import System.IO.Error ===================================== libraries/ghci/GHCi/TH.hs ===================================== @@ -114,6 +114,7 @@ import qualified Data.Map as M import Data.Maybe import GHC.Desugar (AnnotationWrapper(..)) import qualified GHC.Boot.TH.Syntax as TH +import qualified GHC.Boot.TH.Monad as TH import Unsafe.Coerce -- | Create a new instance of 'QState' ===================================== libraries/template-haskell/Language/Haskell/TH/Quote.hs ===================================== @@ -22,7 +22,7 @@ module Language.Haskell.TH.Quote , dataToQa, dataToExpQ, dataToPatQ ) where -import GHC.Boot.TH.Syntax +import GHC.Boot.TH.Monad import GHC.Boot.TH.Quote import Language.Haskell.TH.Syntax (dataToQa, dataToExpQ, dataToPatQ) ===================================== libraries/template-haskell/Language/Haskell/TH/Syntax.hs ===================================== @@ -200,6 +200,7 @@ where import GHC.Boot.TH.Lift import GHC.Boot.TH.Syntax +import GHC.Boot.TH.Monad import System.FilePath import Data.Data hiding (Fixity(..)) import Data.List.NonEmpty (NonEmpty(..)) View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/compare/63b5b30d1efb0fed2c48a152052f0b3... -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/compare/63b5b30d1efb0fed2c48a152052f0b3... You're receiving this email because of your account on gitlab.haskell.org.