2023-05-11 13:27:25 +00:00
|
|
|
|
/-
|
|
|
|
|
Copyright (c) 2022 Henrik Böving. All rights reserved.
|
|
|
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
|
|
|
Authors: Henrik Böving
|
|
|
|
|
-/
|
|
|
|
|
|
|
|
|
|
import Lean
|
|
|
|
|
import Lean.Data.HashMap
|
|
|
|
|
import Lean.Data.HashSet
|
|
|
|
|
|
|
|
|
|
import DocGen4.Process.Base
|
|
|
|
|
import DocGen4.Process.Hierarchy
|
|
|
|
|
import DocGen4.Process.DocInfo
|
|
|
|
|
|
|
|
|
|
namespace DocGen4.Process
|
|
|
|
|
|
|
|
|
|
open Lean Meta
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
Member of a module, either a declaration or some module doc string.
|
|
|
|
|
-/
|
|
|
|
|
inductive ModuleMember where
|
|
|
|
|
| docInfo (info : DocInfo) : ModuleMember
|
|
|
|
|
| modDoc (doc : ModuleDoc) : ModuleMember
|
|
|
|
|
deriving Inhabited
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
A Lean module.
|
|
|
|
|
-/
|
|
|
|
|
structure Module where
|
|
|
|
|
/--
|
|
|
|
|
Name of the module.
|
|
|
|
|
-/
|
|
|
|
|
name : Name
|
|
|
|
|
/--
|
|
|
|
|
All members of the module, sorted according to their line numbers.
|
|
|
|
|
-/
|
|
|
|
|
members : Array ModuleMember
|
|
|
|
|
imports : Array Name
|
|
|
|
|
deriving Inhabited
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
The result of running a full doc-gen analysis on a project.
|
|
|
|
|
-/
|
|
|
|
|
structure AnalyzerResult where
|
|
|
|
|
/--
|
|
|
|
|
The map from module names to indices of the `moduleNames` array.
|
|
|
|
|
-/
|
|
|
|
|
name2ModIdx : HashMap Name ModuleIdx
|
|
|
|
|
/--
|
|
|
|
|
The list of all modules, accessible nicely via `name2ModIdx`.
|
|
|
|
|
-/
|
|
|
|
|
moduleNames : Array Name
|
|
|
|
|
/--
|
|
|
|
|
A map from module names to information about these modules.
|
|
|
|
|
-/
|
|
|
|
|
moduleInfo : HashMap Name Module
|
|
|
|
|
deriving Inhabited
|
|
|
|
|
|
|
|
|
|
namespace ModuleMember
|
|
|
|
|
|
|
|
|
|
def getDeclarationRange : ModuleMember → DeclarationRange
|
|
|
|
|
| docInfo i => i.getDeclarationRange
|
|
|
|
|
| modDoc i => i.declarationRange
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
An order for module members, based on their declaration range.
|
|
|
|
|
-/
|
|
|
|
|
def order (l r : ModuleMember) : Bool :=
|
|
|
|
|
Position.lt l.getDeclarationRange.pos r.getDeclarationRange.pos
|
|
|
|
|
|
|
|
|
|
def getName : ModuleMember → Name
|
|
|
|
|
| docInfo i => i.getName
|
|
|
|
|
| modDoc _ => Name.anonymous
|
|
|
|
|
|
|
|
|
|
def getDocString : ModuleMember → Option String
|
|
|
|
|
| docInfo i => i.getDocString
|
|
|
|
|
| modDoc i => i.doc
|
|
|
|
|
|
|
|
|
|
def shouldRender : ModuleMember → Bool
|
|
|
|
|
| docInfo i => i.shouldRender
|
|
|
|
|
| modDoc _ => true
|
|
|
|
|
|
|
|
|
|
end ModuleMember
|
|
|
|
|
|
|
|
|
|
inductive AnalyzeTask where
|
2023-11-08 07:26:03 +00:00
|
|
|
|
| loadAll (load : Array Name) : AnalyzeTask
|
|
|
|
|
| loadAllLimitAnalysis (analyze : Array Name) : AnalyzeTask
|
2023-05-11 13:27:25 +00:00
|
|
|
|
|
2023-11-08 07:26:03 +00:00
|
|
|
|
def AnalyzeTask.getLoad : AnalyzeTask → Array Name
|
2023-05-11 13:27:25 +00:00
|
|
|
|
| loadAll load => load
|
|
|
|
|
| loadAllLimitAnalysis load => load
|
|
|
|
|
|
|
|
|
|
def getAllModuleDocs (relevantModules : Array Name) : MetaM (HashMap Name Module) := do
|
|
|
|
|
let env ← getEnv
|
|
|
|
|
let mut res := mkHashMap relevantModules.size
|
|
|
|
|
for module in relevantModules do
|
|
|
|
|
let modDocs := getModuleDoc? env module |>.getD #[] |>.map .modDoc
|
|
|
|
|
let some modIdx := env.getModuleIdx? module | unreachable!
|
|
|
|
|
let moduleData := env.header.moduleData.get! modIdx
|
|
|
|
|
let imports := moduleData.imports.map Import.module
|
|
|
|
|
res := res.insert module <| Module.mk module modDocs imports
|
|
|
|
|
return res
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
Run the doc-gen analysis on all modules that are loaded into the `Environment`
|
|
|
|
|
of this `MetaM` run and mentioned by the `AnalyzeTask`.
|
|
|
|
|
-/
|
|
|
|
|
def process (task : AnalyzeTask) : MetaM (AnalyzerResult × Hierarchy) := do
|
|
|
|
|
let env ← getEnv
|
|
|
|
|
let relevantModules := match task with
|
|
|
|
|
| .loadAll _ => HashSet.fromArray env.header.moduleNames
|
2023-11-08 01:36:00 +00:00
|
|
|
|
| .loadAllLimitAnalysis analysis => HashSet.fromArray analysis
|
2023-05-11 13:27:25 +00:00
|
|
|
|
let allModules := env.header.moduleNames
|
|
|
|
|
|
|
|
|
|
let mut res ← getAllModuleDocs relevantModules.toArray
|
|
|
|
|
|
|
|
|
|
for (name, cinfo) in env.constants.toList do
|
|
|
|
|
let some modidx := env.getModuleIdxFor? name | unreachable!
|
|
|
|
|
let moduleName := env.allImportedModuleNames.get! modidx
|
|
|
|
|
if !relevantModules.contains moduleName then
|
|
|
|
|
continue
|
|
|
|
|
|
|
|
|
|
try
|
|
|
|
|
let config := {
|
|
|
|
|
maxHeartbeats := 5000000,
|
|
|
|
|
options := ← getOptions,
|
|
|
|
|
fileName := ← getFileName,
|
|
|
|
|
fileMap := ← getFileMap
|
|
|
|
|
}
|
|
|
|
|
let analysis ← Prod.fst <$> Meta.MetaM.toIO (DocInfo.ofConstant (name, cinfo)) config { env := env } {} {}
|
|
|
|
|
if let some dinfo := analysis then
|
|
|
|
|
let moduleName := env.allImportedModuleNames.get! modidx
|
|
|
|
|
let module := res.find! moduleName
|
|
|
|
|
res := res.insert moduleName {module with members := module.members.push (ModuleMember.docInfo dinfo)}
|
|
|
|
|
catch e =>
|
2023-11-08 00:28:35 +00:00
|
|
|
|
if let some pos := e.getRef.getPos? then
|
|
|
|
|
let pos := (← getFileMap).toPosition pos
|
|
|
|
|
IO.println s!"WARNING: Failed to obtain information in file: {pos}, for: {name}, {← e.toMessageData.toString}"
|
|
|
|
|
else
|
|
|
|
|
IO.println s!"WARNING: Failed to obtain information for: {name}: {← e.toMessageData.toString}"
|
2023-05-11 13:27:25 +00:00
|
|
|
|
|
|
|
|
|
-- TODO: This could probably be faster if we did sorted insert above instead
|
|
|
|
|
for (moduleName, module) in res.toArray do
|
|
|
|
|
res := res.insert moduleName {module with members := module.members.qsort ModuleMember.order}
|
|
|
|
|
|
|
|
|
|
let hierarchy := Hierarchy.fromArray allModules
|
|
|
|
|
let analysis := {
|
|
|
|
|
name2ModIdx := env.const2ModIdx,
|
|
|
|
|
moduleNames := allModules,
|
|
|
|
|
moduleInfo := res,
|
|
|
|
|
}
|
|
|
|
|
return (analysis, hierarchy)
|
|
|
|
|
|
|
|
|
|
def filterDocInfo (ms : Array ModuleMember) : Array DocInfo :=
|
|
|
|
|
ms.filterMap filter
|
|
|
|
|
where
|
|
|
|
|
filter : ModuleMember → Option DocInfo
|
|
|
|
|
| ModuleMember.docInfo i => some i
|
|
|
|
|
| _ => none
|
|
|
|
|
|
|
|
|
|
end DocGen4.Process
|