module Agda.Interaction.Highlighting.Generate
( Level(..)
, generateAndPrintSyntaxInfo
, generateTokenInfo, generateTokenInfoFromString
, printErrorInfo, errorHighlighting
, printUnsolvedInfo
, printHighlightingInfo
, highlightAsTypeChecked
, computeUnsolvedMetaWarnings
, computeUnsolvedConstraints
, storeDisambiguatedName
, Agda.Interaction.Highlighting.Generate.tests
) where
import Prelude hiding (null)
import Control.Monad
import Control.Monad.Trans
import Control.Monad.State
import Control.Monad.Reader
import Control.Applicative
import Control.Arrow ((***), first, second)
import Data.Monoid
import Data.Generics.Geniplate
import Data.HashSet (HashSet)
import qualified Data.HashSet as HSet
import qualified Data.Map as Map
import Data.Maybe
import Data.List ((\\), isPrefixOf)
import qualified Data.Foldable as Fold (toList, fold, foldMap)
import Data.IntMap (IntMap)
import qualified Data.IntMap as IntMap
import Agda.Interaction.FindFile
import Agda.Interaction.Response (Response(Resp_HighlightingInfo))
import Agda.Interaction.Highlighting.Precise hiding (tests)
import Agda.Interaction.Highlighting.Range hiding (tests)
import qualified Agda.TypeChecking.Errors as E
import Agda.TypeChecking.MetaVars (isBlockedTerm)
import Agda.TypeChecking.Monad
hiding (MetaInfo, Primitive, Constructor, Record, Function, Datatype)
import qualified Agda.TypeChecking.Monad as M
import Agda.TypeChecking.Pretty
import qualified Agda.TypeChecking.Reduce as R
import qualified Agda.Syntax.Abstract as A
import Agda.Syntax.Common (Delayed(..))
import qualified Agda.Syntax.Common as Common
import qualified Agda.Syntax.Concrete as C
import qualified Agda.Syntax.Info as SI
import qualified Agda.Syntax.Internal as I
import qualified Agda.Syntax.Literal as L
import qualified Agda.Syntax.Parser as Pa
import qualified Agda.Syntax.Parser.Tokens as T
import qualified Agda.Syntax.Position as P
import Agda.Utils.FileName
import Agda.Utils.Functor
import Agda.Utils.Lens
import Agda.Utils.List
import Agda.Utils.Maybe
import Agda.Utils.Null
import Agda.Utils.TestHelpers
import Agda.Utils.HashMap (HashMap)
import qualified Agda.Utils.HashMap as HMap
#include "undefined.h"
import Agda.Utils.Impossible
highlightAsTypeChecked
:: MonadTCM tcm
=> P.Range
-> P.Range
-> tcm a
-> tcm a
highlightAsTypeChecked rPre r m
| r /= P.noRange && delta == rPre' = wrap r' highlight clear
| otherwise = wrap delta clear highlight
where
rPre' = rToR (P.continuousPerLine rPre)
r' = rToR (P.continuousPerLine r)
delta = rPre' `minus` r'
clear = mempty
highlight = mempty { otherAspects = [TypeChecks] }
wrap rs x y = do
p rs x
v <- m
p rs y
return v
where
p rs x = printHighlightingInfo (singletonC rs x)
printHighlightingInfo :: MonadTCM tcm => HighlightingInfo -> tcm ()
printHighlightingInfo x = do
modToSrc <- use stModuleToSource
liftTCM $ reportSLn "highlighting" 50 $
"Printing highlighting info:\n" ++ show x ++ "\n" ++
" modToSrc = " ++ show modToSrc
unless (null $ ranges x) $ do
liftTCM $ appInteractionOutputCallback $
Resp_HighlightingInfo x modToSrc
data Level
= Full
| Partial
generateAndPrintSyntaxInfo :: A.Declaration -> Level -> TCM ()
generateAndPrintSyntaxInfo decl _ | null $ P.getRange decl = return ()
generateAndPrintSyntaxInfo decl hlLevel = do
file <- fromMaybe __IMPOSSIBLE__ <$> asks envCurrentPath
reportSLn "import.iface.create" 15 $
"Generating syntax info for " ++ filePath file ++ ' ' :
case hlLevel of
Full {} -> "(final)"
Partial {} -> "(first approximation)"
++ "."
M.ignoreAbstractMode $ do
modMap <- sourceToModule
kinds <- nameKinds hlLevel decl
let nameInfo = mconcat $ map (generate modMap file kinds) names
constructorInfo <- case hlLevel of
Full{} -> generateConstructorInfo modMap file kinds decl
_ -> return mempty
let (from, to) = case P.rangeToInterval (P.getRange decl) of
Nothing -> __IMPOSSIBLE__
Just i -> ( fromIntegral $ P.posPos $ P.iStart i
, fromIntegral $ P.posPos $ P.iEnd i)
(prevTokens, (curTokens, postTokens)) <-
(second (splitAtC to)) . splitAtC from <$> use stTokens
let syntaxInfo = compress (mconcat [ constructorInfo
, theRest modMap file
, nameInfo
])
`mappend`
curTokens
case hlLevel of
Full{} -> do stSyntaxInfo %= mappend syntaxInfo
stTokens .= prevTokens `mappend` postTokens
_ -> return ()
ifTopLevelAndHighlightingLevelIs NonInteractive $
printHighlightingInfo syntaxInfo
where
names :: [A.AmbiguousQName]
names =
(map (A.AmbQ . (:[])) $
filter (not . extendedLambda) $
universeBi decl) ++
universeBi decl
where
extendedLambda :: A.QName -> Bool
extendedLambda = (extendedLambdaName `isPrefixOf`) . show . A.nameConcrete . A.qnameName
theRest modMap file = mconcat
[ Fold.foldMap getFieldDecl $ universeBi decl
, Fold.foldMap getVarAndField $ universeBi decl
, Fold.foldMap getLet $ universeBi decl
, Fold.foldMap getLam $ universeBi decl
, Fold.foldMap getTyped $ universeBi decl
, Fold.foldMap getPattern $ universeBi decl
, Fold.foldMap getExpr $ universeBi decl
, Fold.foldMap getPatSynArgs $ universeBi decl
, Fold.foldMap getModuleName $ universeBi decl
, Fold.foldMap getModuleInfo $ universeBi decl
, Fold.foldMap getNamedArg $ universeBi decl
]
where
bound n = nameToFile modMap file [] (A.nameConcrete n)
(\isOp -> mempty { aspect = Just $ Name (Just Bound) isOp })
(Just $ A.nameBindingSite n)
patsyn n = nameToFileA modMap file n True $ \isOp ->
mempty { aspect = Just $ Name (Just $ Constructor Common.Inductive) isOp }
field m n = nameToFile modMap file m n
(\isOp -> mempty { aspect = Just $ Name (Just Field) isOp })
Nothing
asName n = nameToFile modMap file []
n
(\isOp -> mempty { aspect = Just $ Name (Just Module) isOp })
Nothing
mod isTopLevelModule n =
nameToFile modMap file []
(A.nameConcrete n)
(\isOp -> mempty { aspect = Just $ Name (Just Module) isOp })
(Just $ (if isTopLevelModule then P.beginningOfFile else id)
(A.nameBindingSite n))
getVarAndField :: A.Expr -> File
getVarAndField (A.Var x) = bound x
getVarAndField (A.Rec _ fs) = mconcat $ map (field [] . fst) fs
getVarAndField _ = mempty
getNamedArg :: Common.RString -> File
getNamedArg x = singleton (rToR $ P.getRange x) mempty{ aspect = Just $ Name (Just Argument) False }
getLet :: A.LetBinding -> File
getLet (A.LetBind _ _ x _ _) = bound x
getLet A.LetPatBind{} = mempty
getLet A.LetApply{} = mempty
getLet A.LetOpen{} = mempty
getLam :: A.LamBinding -> File
getLam (A.DomainFree _ x) = bound x
getLam (A.DomainFull {}) = mempty
getTyped :: A.TypedBinding -> File
getTyped (A.TBind _ xs _) = mconcat $ map (bound . dget) xs
getTyped A.TLet{} = mempty
getPatSynArgs :: A.Declaration -> File
getPatSynArgs (A.PatternSynDef _ xs _) = mconcat $ map (bound . Common.unArg) xs
getPatSynArgs _ = mempty
getPattern :: A.Pattern -> File
getPattern (A.VarP x) = bound x
getPattern (A.AsP _ x _) = bound x
getPattern (A.DotP pi _) =
singleton (rToR $ P.getRange pi)
(mempty { otherAspects = [DottedPattern] })
getPattern (A.PatternSynP _ q _) = patsyn q
getPattern _ = mempty
getExpr :: A.Expr -> File
getExpr (A.PatternSyn q) = patsyn q
getExpr _ = mempty
getFieldDecl :: A.Declaration -> File
getFieldDecl (A.RecDef _ _ _ _ _ _ fs) = Fold.foldMap extractField fs
where
extractField (A.ScopedDecl _ ds) = Fold.foldMap extractField ds
extractField (A.Field _ x _) = field (concreteQualifier x)
(concreteBase x)
extractField _ = mempty
getFieldDecl _ = mempty
getModuleName :: A.ModuleName -> File
getModuleName m@(A.MName { A.mnameToList = xs }) =
mconcat $ map (mod isTopLevelModule) xs
where
isTopLevelModule =
case catMaybes $
map (join .
fmap P.srcFile .
P.rStart .
A.nameBindingSite) xs of
f : _ -> Map.lookup f modMap ==
Just (C.toTopLevelModuleName $ A.mnameToConcrete m)
[] -> False
getModuleInfo :: SI.ModuleInfo -> File
getModuleInfo (SI.ModuleInfo { SI.minfoAsTo = asTo
, SI.minfoAsName = name }) =
singleton (rToR asTo) (mempty { aspect = Just Symbol })
`mappend`
maybe mempty asName name
generateTokenInfo
:: AbsolutePath
-> TCM CompressedFile
generateTokenInfo file =
liftIO $ tokenHighlighting <$> Pa.parseFile' Pa.tokensParser file
generateTokenInfoFromString :: P.Range -> String -> TCM CompressedFile
generateTokenInfoFromString r _ | r == P.noRange = return mempty
generateTokenInfoFromString r s = do
liftIO $ tokenHighlighting <$> Pa.parsePosString Pa.tokensParser p s
where
Just p = P.rStart r
tokenHighlighting :: [T.Token] -> CompressedFile
tokenHighlighting = merge . map tokenToCFile
where
aToF a r = singletonC (rToR r) (mempty { aspect = Just a })
merge = CompressedFile . concat . map ranges
tokenToCFile :: T.Token -> CompressedFile
tokenToCFile (T.TokSetN (i, _)) = aToF PrimitiveType (P.getRange i)
tokenToCFile (T.TokKeyword T.KwSet i) = aToF PrimitiveType (P.getRange i)
tokenToCFile (T.TokKeyword T.KwProp i) = aToF PrimitiveType (P.getRange i)
tokenToCFile (T.TokKeyword T.KwForall i) = aToF Symbol (P.getRange i)
tokenToCFile (T.TokKeyword _ i) = aToF Keyword (P.getRange i)
tokenToCFile (T.TokSymbol _ i) = aToF Symbol (P.getRange i)
tokenToCFile (T.TokLiteral (L.LitInt r _)) = aToF Number r
tokenToCFile (T.TokLiteral (L.LitFloat r _)) = aToF Number r
tokenToCFile (T.TokLiteral (L.LitString r _)) = aToF String r
tokenToCFile (T.TokLiteral (L.LitChar r _)) = aToF String r
tokenToCFile (T.TokLiteral (L.LitQName r _)) = aToF String r
tokenToCFile (T.TokComment (i, _)) = aToF Comment (P.getRange i)
tokenToCFile (T.TokTeX (i, _)) = aToF Comment (P.getRange i)
tokenToCFile (T.TokId {}) = mempty
tokenToCFile (T.TokQId {}) = mempty
tokenToCFile (T.TokString {}) = mempty
tokenToCFile (T.TokDummy {}) = mempty
tokenToCFile (T.TokEOF {}) = mempty
type NameKinds = A.QName -> Maybe NameKind
nameKinds :: Level
-> A.Declaration
-> TCM NameKinds
nameKinds hlLevel decl = do
imported <- fix <$> use stImports
local <- case hlLevel of
Full{} -> fix <$> use stSignature
_ -> return HMap.empty
let syntax = foldr ($) HMap.empty $ map declToKind $ universeBi decl
let merged = HMap.unions [local, imported, syntax]
return (\n -> HMap.lookup n merged)
where
fix = HMap.map (defnToKind . theDef) . sigDefinitions
insert = HMap.insertWith dropPostulates
where
dropPostulates Postulate k = k
dropPostulates k _ = k
defnToKind :: Defn -> NameKind
defnToKind M.Axiom{} = Postulate
defnToKind d@M.Function{} | isProperProjection d = Field
| otherwise = Function
defnToKind M.Datatype{} = Datatype
defnToKind M.Record{} = Record
defnToKind M.Constructor{ M.conInd = i } = Constructor i
defnToKind M.Primitive{} = Primitive
declToKind :: A.Declaration ->
HashMap A.QName NameKind -> HashMap A.QName NameKind
declToKind (A.Axiom _ _ _ q _) = insert q Postulate
declToKind (A.Field _ q _) = insert q Field
declToKind (A.Primitive _ q _) = insert q Primitive
declToKind (A.Mutual {}) = id
declToKind (A.Section {}) = id
declToKind (A.Apply {}) = id
declToKind (A.Import {}) = id
declToKind (A.Pragma {}) = id
declToKind (A.ScopedDecl {}) = id
declToKind (A.Open {}) = id
declToKind (A.PatternSynDef q _ _) = insert q (Constructor Common.Inductive)
declToKind (A.FunDef _ q _ _) = insert q Function
declToKind (A.UnquoteDecl _ _ q _) = insert q Function
declToKind (A.DataSig _ q _ _) = insert q Datatype
declToKind (A.DataDef _ q _ cs) = \m ->
insert q Datatype $
foldr (\d -> insert (A.axiomName d)
(Constructor Common.Inductive))
m cs
declToKind (A.RecSig _ q _ _) = insert q Record
declToKind (A.RecDef _ q _ c _ _ _) = insert q Record .
case c of
Nothing -> id
Just q -> insert q (Constructor Common.Inductive)
generateConstructorInfo
:: SourceToModule
-> AbsolutePath
-> NameKinds
-> A.Declaration
-> TCM File
generateConstructorInfo modMap file kinds decl = do
ifNull (P.getRange decl) (return mempty) $ \ (P.Range is) -> do
let start = fromIntegral $ P.posPos $ P.iStart $ head is
end = fromIntegral $ P.posPos $ P.iEnd $ last is
m0 <- use stDisambiguatedNames
let (_, m1) = IntMap.split (pred start) m0
(m2, _) = IntMap.split end m1
constrs = IntMap.elems m2
let files = for constrs $ \ q -> generate modMap file kinds $ A.AmbQ [q]
return $ Fold.fold files
printErrorInfo :: TCErr -> TCM ()
printErrorInfo e = printHighlightingInfo . compress =<< errorHighlighting e
errorHighlighting :: TCErr -> TCM File
errorHighlighting (TypeError s cl@(Closure sig env scope (TerminationCheckFailed termErrs))) =
return $ terminationErrorHighlighting termErrs
errorHighlighting e = do
let r = P.getRange e
erase = singleton (rToR $ P.continuousPerLine r) mempty
s <- E.prettyError e
let error = singleton (rToR r)
$ mempty { otherAspects = [Error]
, note = Just s
}
return $ mconcat [ erase, error ]
terminationErrorHighlighting :: [TerminationError] -> File
terminationErrorHighlighting termErrs = functionDefs `mappend` callSites
where
m = mempty { otherAspects = [TerminationProblem] }
functionDefs = Fold.foldMap (\x -> singleton (rToR $ bindingSite x) m) $
concatMap M.termErrFunctions termErrs
callSites = Fold.foldMap (\r -> singleton (rToR r) m) $
concatMap (map M.callInfoRange . M.termErrCalls) termErrs
printUnsolvedInfo :: TCM ()
printUnsolvedInfo = do
metaInfo <- computeUnsolvedMetaWarnings
constraintInfo <- computeUnsolvedConstraints
printHighlightingInfo
(compress $ metaInfo `mappend` constraintInfo)
computeUnsolvedMetaWarnings :: TCM File
computeUnsolvedMetaWarnings = do
is <- getInteractionMetas
let notBlocked m = not <$> isBlockedTerm m
ms <- filterM notBlocked =<< getOpenMetas
rs <- mapM getMetaRange (ms \\ is)
return $ several (map (rToR . P.continuousPerLine) rs)
(mempty { otherAspects = [UnsolvedMeta] })
computeUnsolvedConstraints :: TCM File
computeUnsolvedConstraints = do
cs <- getAllConstraints
let rs = [ r | PConstr{ theConstraint = Closure{ clValue = IsEmpty r t }} <- cs ]
return $ several (map (rToR . P.continuousPerLine) rs)
(mempty { otherAspects = [UnsolvedConstraint] })
generate :: SourceToModule
-> AbsolutePath
-> NameKinds
-> A.AmbiguousQName
-> File
generate modMap file kinds (A.AmbQ qs) =
mconcat $ map (\q -> nameToFileA modMap file q include m) qs
where
ks = map kinds qs
kind = case [ k | Just k <- ks ] of
k : _ -> Just k
[] -> Nothing
m isOp = mempty { aspect = Just $ Name kind isOp }
include = allEqual (map bindingSite qs)
nameToFile :: SourceToModule
-> AbsolutePath
-> [C.Name]
-> C.Name
-> (Bool -> Aspects)
-> Maybe P.Range
-> File
nameToFile modMap file xs x m mR =
if all (== Just file) fileNames then
several (map rToR rs)
((m $ C.isOperator x) { definitionSite = mFilePos })
else
mempty
where
fileNames = catMaybes $ map (fmap P.srcFile . P.rStart . P.getRange) (x : xs)
rs = map P.getRange (x : xs)
mFilePos = do
r <- mR
P.Pn { P.srcFile = Just f, P.posPos = p } <- P.rStart r
mod <- Map.lookup f modMap
return (mod, fromIntegral p)
nameToFileA
:: SourceToModule
-> AbsolutePath
-> A.QName
-> Bool
-> (Bool -> Aspects)
-> File
nameToFileA modMap file x include m =
nameToFile modMap
file
(concreteQualifier x)
(concreteBase x)
m
(if include then Just $ bindingSite x else Nothing)
concreteBase :: I.QName -> C.Name
concreteBase = A.nameConcrete . A.qnameName
concreteQualifier :: I.QName -> [C.Name]
concreteQualifier = map A.nameConcrete . A.mnameToList . A.qnameModule
bindingSite :: I.QName -> P.Range
bindingSite = A.nameBindingSite . A.qnameName
storeDisambiguatedName :: A.QName -> TCM ()
storeDisambiguatedName q = whenJust (start $ P.getRange q) $ \ i ->
stDisambiguatedNames %= IntMap.insert i q
where
start (P.Range []) = Nothing
start (P.Range (i:_)) = Just $ fromIntegral $ P.posPos $ P.iStart i
tests :: IO Bool
tests = runTests "Agda.Interaction.Highlighting.Generate" []