| /- | |
| Copyright (c) 2023 Amazon.com, Inc. or its affiliates. All Rights Reserved. | |
| Released under Apache 2.0 license as described in the file LICENSE. | |
| Authors: Leonardo de Moura | |
| -/ | |
| prelude | |
| import Lean.PrettyPrinter | |
| import Lean.Meta.Basic | |
| import Lean.Meta.Instances | |
| namespace Lean.Meta | |
| def collectAboveThreshold [BEq α] [Hashable α] (counters : PHashMap α Nat) (threshold : Nat) (p : α → Bool) (lt : α → α → Bool) : Array (α × Nat) := Id.run do | |
| let mut r := #[] | |
| for (declName, counter) in counters do | |
| if counter > threshold then | |
| if p declName then | |
| r := r.push (declName, counter) | |
| return r.qsort fun (d₁, c₁) (d₂, c₂) => if c₁ == c₂ then lt d₁ d₂ else c₁ > c₂ | |
| def subCounters [BEq α] [Hashable α] (newCounters oldCounters : PHashMap α Nat) : PHashMap α Nat := Id.run do | |
| let mut result := {} | |
| for (a, counterNew) in newCounters do | |
| if let some counterOld := oldCounters.find? a then | |
| result := result.insert a (counterNew - counterOld) | |
| else | |
| result := result.insert a counterNew | |
| return result | |
| structure DiagSummary where | |
| data : Array MessageData := #[] | |
| max : Nat := 0 | |
| deriving Inhabited | |
| def DiagSummary.isEmpty (s : DiagSummary) : Bool := | |
| s.data.isEmpty | |
| def mkDiagSummary (cls : Name) (counters : PHashMap Name Nat) (p : Name → Bool := fun _ => true) : MetaM DiagSummary := do | |
| let threshold := diagnostics.threshold.get (← getOptions) | |
| let entries := collectAboveThreshold counters threshold p Name.lt | |
| if entries.isEmpty then | |
| return {} | |
| else | |
| let mut data := #[] | |
| for (declName, counter) in entries do | |
| data := data.push <| .trace { cls } m!"{MessageData.ofConst (← mkConstWithLevelParams declName)} ↦ {counter}" #[] | |
| return { data, max := entries[0]!.2 } | |
| def mkDiagSummaryForUnfolded (counters : PHashMap Name Nat) (instances := false) : MetaM DiagSummary := do | |
| let env ← getEnv | |
| mkDiagSummary `reduction counters fun declName => | |
| getReducibilityStatusCore env declName matches .semireducible | |
| && isInstanceCore env declName == instances | |
| def mkDiagSummaryForUnfoldedReducible (counters : PHashMap Name Nat) : MetaM DiagSummary := do | |
| let env ← getEnv | |
| mkDiagSummary `reduction counters fun declName => | |
| getReducibilityStatusCore env declName matches .reducible | |
| def mkDiagSummaryForUsedInstances : MetaM DiagSummary := do | |
| mkDiagSummary `type_class (← get).diag.instanceCounter | |
| def mkDiagSynthPendingFailure (failures : PHashMap Expr MessageData) : MetaM DiagSummary := do | |
| if failures.isEmpty then | |
| return {} | |
| else | |
| let mut data := #[] | |
| for (_, msg) in failures do | |
| data := data.push <| .trace { cls := `type_class } msg #[] | |
| return { data } | |
| /-- | |
| We use below that this returns `m` unchanged if `s.isEmpty` | |
| -/ | |
| def appendSection (m : MessageData) (cls : Name) (header : String) (s : DiagSummary) (resultSummary := true) : MessageData := | |
| if s.isEmpty then | |
| m | |
| else | |
| let header := if resultSummary then s!"{header} (max: {s.max}, num: {s.data.size}):" else header | |
| m ++ .trace { cls } header s.data | |
| def reportDiag : MetaM Unit := do | |
| if (← isDiagnosticsEnabled) then | |
| let unfoldCounter := (← get).diag.unfoldCounter | |
| let unfoldDefault ← mkDiagSummaryForUnfolded unfoldCounter | |
| let unfoldInstance ← mkDiagSummaryForUnfolded unfoldCounter (instances := true) | |
| let unfoldReducible ← mkDiagSummaryForUnfoldedReducible unfoldCounter | |
| let heu ← mkDiagSummary `def_eq (← get).diag.heuristicCounter | |
| let inst ← mkDiagSummaryForUsedInstances | |
| let synthPending ← mkDiagSynthPendingFailure (← get).diag.synthPendingFailures | |
| let unfoldKernel ← mkDiagSummary `kernel (Kernel.getDiagnostics (← getEnv)).unfoldCounter | |
| let m := MessageData.nil | |
| let m := appendSection m `reduction "unfolded declarations" unfoldDefault | |
| let m := appendSection m `reduction "unfolded instances" unfoldInstance | |
| let m := appendSection m `reduction "unfolded reducible declarations" unfoldReducible | |
| let m := appendSection m `type_class "used instances" inst | |
| let m := appendSection m `type_class | |
| s!"max synth pending failures (maxSynthPendingDepth: {maxSynthPendingDepth.get (← getOptions)}), use `set_option maxSynthPendingDepth <limit>`" | |
| synthPending (resultSummary := false) | |
| let m := appendSection m `def_eq "heuristic for solving `f a =?= f b`" heu | |
| let m := appendSection m `kernel "unfolded declarations" unfoldKernel | |
| unless m matches .nil do | |
| let m := m ++ "use `set_option diagnostics.threshold <num>` to control threshold for reporting counters" | |
| logInfo m | |
| end Lean.Meta |