module Agda.Compiler.MAlonzo.Misc where

import Data.Char

import qualified Agda.Utils.Haskell.Syntax as HS

import Agda.Compiler.Common

import Agda.Syntax.Common
import Agda.Syntax.Internal

import Agda.TypeChecking.Monad
import Agda.TypeChecking.Monad.Builtin

import Agda.Utils.Pretty

import Agda.Utils.Impossible

--------------------------------------------------
-- Setting up Interface before compile
--------------------------------------------------

curHsMod :: TCM HS.ModuleName
curHsMod :: TCM ModuleName
curHsMod = ModuleName -> ModuleName
mazMod (ModuleName -> ModuleName) -> TCMT IO ModuleName -> TCM ModuleName
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> TCMT IO ModuleName
curMName

--------------------------------------------------
-- utilities for haskell names
--------------------------------------------------

-- The following naming scheme seems to be used:
--
-- * Types coming from Agda are named "T\<number\>".
--
-- * Other definitions coming from Agda are named "d\<number\>".
--   Exception: the main function is named "main".
--
-- * Names coming from Haskell must always be used qualified.
--   Exception: names from the Prelude.

ihname :: String -> Nat -> HS.Name
ihname :: String -> Nat -> Name
ihname String
s Nat
i = String -> Name
HS.Ident (String -> Name) -> String -> Name
forall a b. (a -> b) -> a -> b
$ String
s String -> String -> String
forall a. [a] -> [a] -> [a]
++ Nat -> String
forall a. Show a => a -> String
show Nat
i

unqhname :: String -> QName -> HS.Name
{- NOT A GOOD IDEA, see Issue 728
unqhname s q | ("d", "main") == (s, show(qnameName q)) = HS.Ident "main"
             | otherwise = ihname s (idnum $ nameId $ qnameName $ q)
-}
unqhname :: String -> QName -> Name
unqhname String
s QName
q = String -> Nat -> Name
ihname String
s (NameId -> Nat
forall b. Num b => NameId -> b
idnum (NameId -> Nat) -> NameId -> Nat
forall a b. (a -> b) -> a -> b
$ Name -> NameId
nameId (Name -> NameId) -> Name -> NameId
forall a b. (a -> b) -> a -> b
$ QName -> Name
qnameName (QName -> Name) -> QName -> Name
forall a b. (a -> b) -> a -> b
$ QName
q)
   where idnum :: NameId -> b
idnum (NameId Word64
x Word64
_) = Word64 -> b
forall a b. (Integral a, Num b) => a -> b
fromIntegral Word64
x

-- the toplevel module containing the given one
tlmodOf :: ModuleName -> TCM HS.ModuleName
tlmodOf :: ModuleName -> TCM ModuleName
tlmodOf = (ModuleName -> ModuleName) -> TCMT IO ModuleName -> TCM ModuleName
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap ModuleName -> ModuleName
mazMod (TCMT IO ModuleName -> TCM ModuleName)
-> (ModuleName -> TCMT IO ModuleName)
-> ModuleName
-> TCM ModuleName
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ModuleName -> TCMT IO ModuleName
topLevelModuleName


-- qualify HS.Name n by the module of QName q, if necessary;
-- accumulates the used module in stImportedModules at the same time.
xqual :: QName -> HS.Name -> TCM HS.QName
xqual :: QName -> Name -> TCM QName
xqual QName
q Name
n = do ModuleName
m1 <- ModuleName -> TCMT IO ModuleName
topLevelModuleName (QName -> ModuleName
qnameModule QName
q)
               ModuleName
m2 <- TCMT IO ModuleName
curMName
               if ModuleName
m1 ModuleName -> ModuleName -> Bool
forall a. Eq a => a -> a -> Bool
== ModuleName
m2 then QName -> TCM QName
forall (m :: * -> *) a. Monad m => a -> m a
return (Name -> QName
HS.UnQual Name
n)
                  else ModuleName -> TCM ()
addImport ModuleName
m1 TCM () -> TCM QName -> TCM QName
forall (m :: * -> *) a b. Monad m => m a -> m b -> m b
>> QName -> TCM QName
forall (m :: * -> *) a. Monad m => a -> m a
return (ModuleName -> Name -> QName
HS.Qual (ModuleName -> ModuleName
mazMod ModuleName
m1) Name
n)

xhqn :: String -> QName -> TCM HS.QName
xhqn :: String -> QName -> TCM QName
xhqn String
s QName
q = QName -> Name -> TCM QName
xqual QName
q (String -> QName -> Name
unqhname String
s QName
q)

hsName :: String -> HS.QName
hsName :: String -> QName
hsName String
s = Name -> QName
HS.UnQual (String -> Name
HS.Ident String
s)

-- always use the original name for a constructor even when it's redefined.
conhqn :: QName -> TCM HS.QName
conhqn :: QName -> TCM QName
conhqn QName
q = String -> QName -> TCM QName
xhqn String
"C" (QName -> TCM QName) -> TCMT IO QName -> TCM QName
forall (m :: * -> *) a b. Monad m => (a -> m b) -> m a -> m b
=<< QName -> TCMT IO QName
forall (m :: * -> *). HasConstInfo m => QName -> m QName
canonicalName QName
q

-- qualify name s by the module of builtin b
bltQual :: String -> String -> TCM HS.QName
bltQual :: String -> String -> TCM QName
bltQual String
b String
s = do
  Def QName
q Elims
_ <- String -> TCMT IO Term
forall (m :: * -> *).
(HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) =>
String -> m Term
getBuiltin String
b
  QName -> Name -> TCM QName
xqual QName
q (String -> Name
HS.Ident String
s)

dname :: QName -> HS.Name
dname :: QName -> Name
dname QName
q = String -> QName -> Name
unqhname String
"d" QName
q

-- | Name for definition stripped of unused arguments
duname :: QName -> HS.Name
duname :: QName -> Name
duname QName
q = String -> QName -> Name
unqhname String
"du" QName
q

hsPrimOp :: String -> HS.QOp
hsPrimOp :: String -> QOp
hsPrimOp String
s = QName -> QOp
HS.QVarOp (QName -> QOp) -> QName -> QOp
forall a b. (a -> b) -> a -> b
$ Name -> QName
HS.UnQual (Name -> QName) -> Name -> QName
forall a b. (a -> b) -> a -> b
$ String -> Name
HS.Symbol String
s

hsPrimOpApp :: String -> HS.Exp -> HS.Exp -> HS.Exp
hsPrimOpApp :: String -> Exp -> Exp -> Exp
hsPrimOpApp String
op Exp
e Exp
e1 = Exp -> QOp -> Exp -> Exp
HS.InfixApp Exp
e (String -> QOp
hsPrimOp String
op) Exp
e1

hsInt :: Integer -> HS.Exp
hsInt :: Integer -> Exp
hsInt Integer
n = Literal -> Exp
HS.Lit (Integer -> Literal
HS.Int Integer
n)

hsTypedInt :: Integral a => a -> HS.Exp
hsTypedInt :: a -> Exp
hsTypedInt a
n = Exp -> Type -> Exp
HS.ExpTypeSig (Literal -> Exp
HS.Lit (Integer -> Literal
HS.Int (Integer -> Literal) -> Integer -> Literal
forall a b. (a -> b) -> a -> b
$ a -> Integer
forall a b. (Integral a, Num b) => a -> b
fromIntegral a
n)) (QName -> Type
HS.TyCon (String -> QName
hsName String
"Integer"))

hsTypedDouble :: Real a => a -> HS.Exp
hsTypedDouble :: a -> Exp
hsTypedDouble a
n = Exp -> Type -> Exp
HS.ExpTypeSig (Literal -> Exp
HS.Lit (Rational -> Literal
HS.Frac (Rational -> Literal) -> Rational -> Literal
forall a b. (a -> b) -> a -> b
$ a -> Rational
forall a. Real a => a -> Rational
toRational a
n)) (QName -> Type
HS.TyCon (String -> QName
hsName String
"Double"))

hsLet :: HS.Name -> HS.Exp -> HS.Exp -> HS.Exp
hsLet :: Name -> Exp -> Exp -> Exp
hsLet Name
x Exp
e Exp
b =
  Binds -> Exp -> Exp
HS.Let ([Decl] -> Binds
HS.BDecls [[Match] -> Decl
HS.FunBind [Name -> [Pat] -> Rhs -> Maybe Binds -> Match
HS.Match Name
x [] (Exp -> Rhs
HS.UnGuardedRhs Exp
e) Maybe Binds
emptyBinds]]) Exp
b

hsVarUQ :: HS.Name -> HS.Exp
hsVarUQ :: Name -> Exp
hsVarUQ = QName -> Exp
HS.Var (QName -> Exp) -> (Name -> QName) -> Name -> Exp
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Name -> QName
HS.UnQual

hsAppView :: HS.Exp -> [HS.Exp]
hsAppView :: Exp -> [Exp]
hsAppView = [Exp] -> [Exp]
forall a. [a] -> [a]
reverse ([Exp] -> [Exp]) -> (Exp -> [Exp]) -> Exp -> [Exp]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Exp -> [Exp]
view
  where
    view :: Exp -> [Exp]
view (HS.App Exp
e Exp
e1) = Exp
e1 Exp -> [Exp] -> [Exp]
forall a. a -> [a] -> [a]
: Exp -> [Exp]
view Exp
e
    view (HS.InfixApp Exp
e1 QOp
op Exp
e2) = [Exp
e2, Exp
e1, QOp -> Exp
hsOpToExp QOp
op]
    view Exp
e = [Exp
e]

hsOpToExp :: HS.QOp -> HS.Exp
hsOpToExp :: QOp -> Exp
hsOpToExp (HS.QVarOp QName
x) = QName -> Exp
HS.Var QName
x

hsLambda :: [HS.Pat] -> HS.Exp -> HS.Exp
hsLambda :: [Pat] -> Exp -> Exp
hsLambda [Pat]
ps (HS.Lambda [Pat]
ps1 Exp
e) = [Pat] -> Exp -> Exp
HS.Lambda ([Pat]
ps [Pat] -> [Pat] -> [Pat]
forall a. [a] -> [a] -> [a]
++ [Pat]
ps1) Exp
e
hsLambda [Pat]
ps Exp
e = [Pat] -> Exp -> Exp
HS.Lambda [Pat]
ps Exp
e

hsMapAlt :: (HS.Exp -> HS.Exp) -> HS.Alt -> HS.Alt
hsMapAlt :: (Exp -> Exp) -> Alt -> Alt
hsMapAlt Exp -> Exp
f (HS.Alt Pat
p Rhs
rhs Maybe Binds
wh) = Pat -> Rhs -> Maybe Binds -> Alt
HS.Alt Pat
p ((Exp -> Exp) -> Rhs -> Rhs
hsMapRHS Exp -> Exp
f Rhs
rhs) Maybe Binds
wh

hsMapRHS :: (HS.Exp -> HS.Exp) -> HS.Rhs -> HS.Rhs
hsMapRHS :: (Exp -> Exp) -> Rhs -> Rhs
hsMapRHS Exp -> Exp
f (HS.UnGuardedRhs Exp
def) = Exp -> Rhs
HS.UnGuardedRhs (Exp -> Exp
f Exp
def)
hsMapRHS Exp -> Exp
f (HS.GuardedRhss [GuardedRhs]
es)   = [GuardedRhs] -> Rhs
HS.GuardedRhss [ [Stmt] -> Exp -> GuardedRhs
HS.GuardedRhs [Stmt]
g (Exp -> Exp
f Exp
e) | HS.GuardedRhs [Stmt]
g Exp
e <- [GuardedRhs]
es ]

--------------------------------------------------
-- Hard coded module names
--------------------------------------------------

mazstr :: String
mazstr :: String
mazstr = String
"MAlonzo.Code"

mazName :: Name
mazName :: Name
mazName = NameId -> String -> Name
forall a. MkName a => NameId -> a -> Name
mkName_ NameId
forall a. HasCallStack => a
__IMPOSSIBLE__ String
mazstr

mazMod' :: String -> HS.ModuleName
mazMod' :: String -> ModuleName
mazMod' String
s = String -> ModuleName
HS.ModuleName (String -> ModuleName) -> String -> ModuleName
forall a b. (a -> b) -> a -> b
$ String
mazstr String -> String -> String
forall a. [a] -> [a] -> [a]
++ String
"." String -> String -> String
forall a. [a] -> [a] -> [a]
++ String
s

mazMod :: ModuleName -> HS.ModuleName
mazMod :: ModuleName -> ModuleName
mazMod = String -> ModuleName
mazMod' (String -> ModuleName)
-> (ModuleName -> String) -> ModuleName -> ModuleName
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ModuleName -> String
forall a. Pretty a => a -> String
prettyShow

mazerror :: String -> a
mazerror :: String -> a
mazerror String
msg = String -> a
forall a. HasCallStack => String -> a
error (String -> a) -> String -> a
forall a b. (a -> b) -> a -> b
$ String
mazstr String -> String -> String
forall a. [a] -> [a] -> [a]
++ String
": " String -> String -> String
forall a. [a] -> [a] -> [a]
++ String
msg

mazCoerceName :: String
mazCoerceName :: String
mazCoerceName = String
"coe"

mazErasedName :: String
mazErasedName :: String
mazErasedName = String
"erased"

mazAnyTypeName :: String
mazAnyTypeName :: String
mazAnyTypeName = String
"AgdaAny"

mazCoerce :: HS.Exp
-- mazCoerce = HS.Var $ HS.Qual unsafeCoerceMod (HS.Ident "unsafeCoerce")
-- mazCoerce = HS.Var $ HS.Qual mazRTE $ HS.Ident mazCoerceName
mazCoerce :: Exp
mazCoerce = QName -> Exp
HS.Var (QName -> Exp) -> QName -> Exp
forall a b. (a -> b) -> a -> b
$ Name -> QName
HS.UnQual (Name -> QName) -> Name -> QName
forall a b. (a -> b) -> a -> b
$ String -> Name
HS.Ident String
mazCoerceName

-- Andreas, 2011-11-16: error incomplete match now RTE-call
mazIncompleteMatch :: HS.Exp
mazIncompleteMatch :: Exp
mazIncompleteMatch = QName -> Exp
HS.Var (QName -> Exp) -> QName -> Exp
forall a b. (a -> b) -> a -> b
$ ModuleName -> Name -> QName
HS.Qual ModuleName
mazRTE (Name -> QName) -> Name -> QName
forall a b. (a -> b) -> a -> b
$ String -> Name
HS.Ident String
"mazIncompleteMatch"

rtmIncompleteMatch :: QName -> HS.Exp
rtmIncompleteMatch :: QName -> Exp
rtmIncompleteMatch QName
q = Exp
mazIncompleteMatch Exp -> Exp -> Exp
`HS.App` Name -> Exp
hsVarUQ (String -> QName -> Name
unqhname String
"name" QName
q)

mazUnreachableError :: HS.Exp
mazUnreachableError :: Exp
mazUnreachableError = QName -> Exp
HS.Var (QName -> Exp) -> QName -> Exp
forall a b. (a -> b) -> a -> b
$ ModuleName -> Name -> QName
HS.Qual ModuleName
mazRTE (Name -> QName) -> Name -> QName
forall a b. (a -> b) -> a -> b
$ String -> Name
HS.Ident String
"mazUnreachableError"

rtmUnreachableError :: HS.Exp
rtmUnreachableError :: Exp
rtmUnreachableError = Exp
mazUnreachableError

mazAnyType :: HS.Type
mazAnyType :: Type
mazAnyType = QName -> Type
HS.TyCon (String -> QName
hsName String
mazAnyTypeName)

mazRTE :: HS.ModuleName
mazRTE :: ModuleName
mazRTE = String -> ModuleName
HS.ModuleName String
"MAlonzo.RTE"

rtmQual :: String -> HS.QName
rtmQual :: String -> QName
rtmQual = Name -> QName
HS.UnQual (Name -> QName) -> (String -> Name) -> String -> QName
forall b c a. (b -> c) -> (a -> b) -> a -> c
. String -> Name
HS.Ident

rtmVar :: String -> HS.Exp
rtmVar :: String -> Exp
rtmVar  = QName -> Exp
HS.Var (QName -> Exp) -> (String -> QName) -> String -> Exp
forall b c a. (b -> c) -> (a -> b) -> a -> c
. String -> QName
rtmQual

rtmError :: String -> HS.Exp
rtmError :: String -> Exp
rtmError String
s = String -> Exp
rtmVar String
"error" Exp -> Exp -> Exp
`HS.App`
             (Literal -> Exp
HS.Lit (Literal -> Exp) -> Literal -> Exp
forall a b. (a -> b) -> a -> b
$ String -> Literal
HS.String (String -> Literal) -> String -> Literal
forall a b. (a -> b) -> a -> b
$ String
"MAlonzo Runtime Error: " String -> String -> String
forall a. [a] -> [a] -> [a]
++ String
s)

unsafeCoerceMod :: HS.ModuleName
unsafeCoerceMod :: ModuleName
unsafeCoerceMod = String -> ModuleName
HS.ModuleName String
"Unsafe.Coerce"

--------------------------------------------------
-- Sloppy ways to declare <name> = <string>
--------------------------------------------------

fakeD :: HS.Name -> String -> HS.Decl
fakeD :: Name -> String -> Decl
fakeD Name
v String
s = [Match] -> Decl
HS.FunBind [Name -> [Pat] -> Rhs -> Maybe Binds -> Match
HS.Match Name
v [] (Exp -> Rhs
HS.UnGuardedRhs (Exp -> Rhs) -> Exp -> Rhs
forall a b. (a -> b) -> a -> b
$ String -> Exp
fakeExp String
s) Maybe Binds
emptyBinds]

fakeDS :: String -> String -> HS.Decl
fakeDS :: String -> String -> Decl
fakeDS = Name -> String -> Decl
fakeD (Name -> String -> Decl)
-> (String -> Name) -> String -> String -> Decl
forall b c a. (b -> c) -> (a -> b) -> a -> c
. String -> Name
HS.Ident

fakeDQ :: QName -> String -> HS.Decl
fakeDQ :: QName -> String -> Decl
fakeDQ = Name -> String -> Decl
fakeD (Name -> String -> Decl)
-> (QName -> Name) -> QName -> String -> Decl
forall b c a. (b -> c) -> (a -> b) -> a -> c
. String -> QName -> Name
unqhname String
"d"

fakeType :: String -> HS.Type
fakeType :: String -> Type
fakeType = String -> Type
HS.FakeType

fakeExp :: String -> HS.Exp
fakeExp :: String -> Exp
fakeExp = String -> Exp
HS.FakeExp

fakeDecl :: String -> HS.Decl
fakeDecl :: String -> Decl
fakeDecl = String -> Decl
HS.FakeDecl

--------------------------------------------------
-- Auxiliary definitions
--------------------------------------------------

emptyBinds :: Maybe HS.Binds
emptyBinds :: Maybe Binds
emptyBinds = Maybe Binds
forall a. Maybe a
Nothing

--------------------------------------------------
-- Utilities for Haskell modules names
--------------------------------------------------

-- | Can the character be used in a Haskell module name part
-- (@conid@)? This function is more restrictive than what the Haskell
-- report allows.

isModChar :: Char -> Bool
isModChar :: Char -> Bool
isModChar Char
c =
  Char -> Bool
isLower Char
c Bool -> Bool -> Bool
|| Char -> Bool
isUpper Char
c Bool -> Bool -> Bool
|| Char -> Bool
isDigit Char
c Bool -> Bool -> Bool
|| Char
c Char -> Char -> Bool
forall a. Eq a => a -> a -> Bool
== Char
'_' Bool -> Bool -> Bool
|| Char
c Char -> Char -> Bool
forall a. Eq a => a -> a -> Bool
== Char
'\''