84 lines
2.4 KiB
Text
84 lines
2.4 KiB
Text
/-
|
||
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
|
||
Released under Apache 2.0 license as described in the file LICENSE.
|
||
Authors: Sebastian Ullrich
|
||
-/
|
||
prelude
|
||
import init.lean.format init.data.rbmap init.lean.position init.lean.name init.lean.options
|
||
|
||
universe u
|
||
|
||
namespace Lean
|
||
|
||
inductive Message
|
||
| fromFormat (fmt : Format)
|
||
|
||
instance : HasCoe Format Message :=
|
||
⟨Message.fromFormat⟩
|
||
|
||
inductive Trace
|
||
| mk (msg : Message) (subtraces : List Trace)
|
||
|
||
def Trace.pp : Trace → Format
|
||
| (Trace.mk (Message.fromFormat fmt) subtraces) :=
|
||
fmt ++ Format.nest 2 (Format.join $ subtraces.map (λ t, Format.line ++ t.pp))
|
||
|
||
namespace Trace
|
||
|
||
def TraceMap := Rbmap Position Trace (<)
|
||
|
||
structure TraceState :=
|
||
(opts : Options)
|
||
(roots : TraceMap)
|
||
(curPos : Option Position)
|
||
(curTraces : List Trace)
|
||
|
||
def TraceT (m : Type → Type u) := StateT TraceState m
|
||
local attribute [reducible] TraceT
|
||
|
||
instance (m) [Monad m] : Monad (TraceT m) := inferInstance
|
||
|
||
class MonadTracer (m : Type → Type u) :=
|
||
(traceRoot {α} : Position → Name → Message → Thunk (m α) → m α)
|
||
(traceCtx {α} : Name → Message → Thunk (m α) → m α)
|
||
|
||
export MonadTracer (traceRoot traceCtx)
|
||
|
||
def Trace {m} [Monad m] [MonadTracer m] (cls : Name) (msg : Message) : m unit :=
|
||
traceCtx cls msg (pure () : m unit)
|
||
|
||
instance (m) [Monad m] : MonadTracer (TraceT m) :=
|
||
{ traceRoot := λ α pos cls msg ctx, do {
|
||
st ← get,
|
||
if st.opts.getBool cls = some tt then do {
|
||
modify $ λ st, {curPos := pos, curTraces := [], ..st},
|
||
a ← ctx.get,
|
||
modify $ λ (st : TraceState), {roots := st.roots.insert pos ⟨msg, st.curTraces⟩, ..st},
|
||
pure a
|
||
} else ctx.get
|
||
},
|
||
traceCtx := λ α cls msg ctx, do {
|
||
st ← get,
|
||
-- tracing enabled?
|
||
some _ ← pure st.curPos | ctx.get,
|
||
-- Trace class enabled?
|
||
if st.opts.getBool cls = some tt then do {
|
||
put {curTraces := [], ..st},
|
||
a ← ctx.get,
|
||
modify $ λ (st' : TraceState), {curTraces := st.curTraces ++ [⟨msg, st'.curTraces⟩], ..st'},
|
||
pure a
|
||
} else
|
||
-- disable tracing inside 'ctx'
|
||
adaptState'
|
||
(λ _, {curPos := none, ..st})
|
||
(λ st', {curPos := st.curPos, ..st'})
|
||
ctx.get
|
||
}
|
||
}
|
||
|
||
unsafe def TraceT.run {m α} [Monad m] (opts : Options) (x : TraceT m α) : m (α × TraceMap) :=
|
||
do (a, st) ← StateT.run x {opts := opts, roots := mkRbmap _ _ _, curPos := none, curTraces := []},
|
||
pure (a, st.roots)
|
||
|
||
end Trace
|
||
end Lean
|