379 lines
13 KiB
C++
379 lines
13 KiB
C++
/*
|
|
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
|
|
Author: Leonardo de Moura
|
|
*/
|
|
#include <string>
|
|
#include "util/object_serializer.h"
|
|
#include "kernel/expr.h"
|
|
#include "kernel/declaration.h"
|
|
#include "library/annotation.h"
|
|
#include "library/max_sharing.h"
|
|
#include "library/kernel_serializer.h"
|
|
|
|
// Procedures for serializing and deserializing kernel objects (levels, exprs, declarations)
|
|
namespace lean {
|
|
// Universe level serialization
|
|
class level_serializer : public object_serializer<level, level::ptr_hash, level::ptr_eq> {
|
|
typedef object_serializer<level, level::ptr_hash, level::ptr_eq> super;
|
|
public:
|
|
void write(level const & l) {
|
|
super::write(l, [&]() {
|
|
serializer & s = get_owner();
|
|
auto k = kind(l);
|
|
s << static_cast<char>(k);
|
|
switch (k) {
|
|
case level_kind::Zero: break;
|
|
case level_kind::Param: s << param_id(l); break;
|
|
case level_kind::Global: s << global_id(l); break;
|
|
case level_kind::Meta: s << meta_id(l); break;
|
|
case level_kind::Max: write(max_lhs(l)); write(max_rhs(l)); break;
|
|
case level_kind::IMax: write(imax_lhs(l)); write(imax_rhs(l)); break;
|
|
case level_kind::Succ: write(succ_of(l)); break;
|
|
}
|
|
});
|
|
}
|
|
};
|
|
|
|
class level_deserializer : public object_deserializer<level> {
|
|
typedef object_deserializer<level> super;
|
|
public:
|
|
level read() {
|
|
return super::read([&]() -> level {
|
|
deserializer & d = get_owner();
|
|
auto k = static_cast<level_kind>(d.read_char());
|
|
switch (k) {
|
|
case level_kind::Zero:
|
|
return mk_level_zero();
|
|
case level_kind::Param:
|
|
return mk_param_univ(read_name(d));
|
|
case level_kind::Global:
|
|
return mk_global_univ(read_name(d));
|
|
case level_kind::Meta:
|
|
return mk_meta_univ(read_name(d));
|
|
case level_kind::Max: {
|
|
level lhs = read();
|
|
return mk_max(lhs, read());
|
|
}
|
|
case level_kind::IMax: {
|
|
level lhs = read();
|
|
return mk_imax(lhs, read());
|
|
}
|
|
case level_kind::Succ:
|
|
return mk_succ(read());
|
|
}
|
|
throw corrupted_stream_exception();
|
|
});
|
|
}
|
|
};
|
|
|
|
struct level_sd {
|
|
unsigned m_s_extid;
|
|
unsigned m_d_extid;
|
|
level_sd() {
|
|
m_s_extid = serializer::register_extension([](){
|
|
return std::unique_ptr<serializer::extension>(new level_serializer());
|
|
});
|
|
m_d_extid = deserializer::register_extension([](){
|
|
return std::unique_ptr<deserializer::extension>(new level_deserializer());
|
|
});
|
|
}
|
|
};
|
|
|
|
static level_sd * g_level_sd = nullptr;
|
|
|
|
serializer & operator<<(serializer & s, level const & n) {
|
|
s.get_extension<level_serializer>(g_level_sd->m_s_extid).write(n);
|
|
return s;
|
|
}
|
|
|
|
level read_level(deserializer & d) { return d.get_extension<level_deserializer>(g_level_sd->m_d_extid).read(); }
|
|
|
|
serializer & operator<<(serializer & s, levels const & ls) { return write_list<level>(s, ls); }
|
|
|
|
levels read_levels(deserializer & d) { return read_list<level>(d, read_level); }
|
|
|
|
// Expression serialization
|
|
typedef std::unordered_map<std::string, macro_definition_cell::reader> macro_readers;
|
|
static macro_readers * g_macro_readers = nullptr;
|
|
|
|
macro_readers & get_macro_readers() {
|
|
return *g_macro_readers;
|
|
}
|
|
|
|
void register_macro_deserializer(std::string const & k, macro_definition_cell::reader rd) {
|
|
macro_readers & readers = get_macro_readers();
|
|
lean_assert(readers.find(k) == readers.end());
|
|
readers[k] = rd;
|
|
}
|
|
|
|
static expr read_macro_definition(deserializer & d, unsigned num, expr const * args) {
|
|
auto k = d.read_string();
|
|
macro_readers & readers = get_macro_readers();
|
|
auto it = readers.find(k);
|
|
lean_assert(it != readers.end());
|
|
return it->second(d, num, args);
|
|
}
|
|
|
|
serializer & operator<<(serializer & s, binder_info const & i) {
|
|
unsigned w =
|
|
(i.is_implicit() ? 16 : 0) +
|
|
(i.is_cast() ? 8 : 0) +
|
|
(i.is_contextual() ? 4 : 0) +
|
|
(i.is_strict_implicit() ? 2 : 0) +
|
|
(i.is_inst_implicit() ? 1 : 0);
|
|
s.write_char(w);
|
|
return s;
|
|
}
|
|
|
|
static binder_info read_binder_info(deserializer & d) {
|
|
unsigned w = d.read_char();
|
|
bool imp = (w & 16) != 0;
|
|
bool cast = (w & 8) != 0;
|
|
bool ctx = (w & 4) != 0;
|
|
bool s_imp = (w & 2) != 0;
|
|
bool i_imp = (w & 1) != 0;
|
|
return binder_info(imp, cast, ctx, s_imp, i_imp);
|
|
}
|
|
|
|
static name * g_binder_name = nullptr;
|
|
|
|
class expr_serializer : public object_serializer<expr, expr_hash_alloc, expr_eqp> {
|
|
typedef object_serializer<expr, expr_hash_alloc, expr_eqp> super;
|
|
max_sharing_fn m_max_sharing_fn;
|
|
unsigned m_next_id;
|
|
|
|
void write_binder_name(serializer & s, name const & a) {
|
|
// make sure binding names are atomic string
|
|
if (!a.is_atomic() || a.is_numeral()) {
|
|
s << g_binder_name->append_after(m_next_id);
|
|
m_next_id++;
|
|
} else {
|
|
s << a;
|
|
}
|
|
}
|
|
|
|
void write_core(expr const & a) {
|
|
auto k = a.kind();
|
|
super::write_core(a, static_cast<char>(k), [&]() {
|
|
serializer & s = get_owner();
|
|
switch (k) {
|
|
case expr_kind::Var:
|
|
s << var_idx(a);
|
|
break;
|
|
case expr_kind::Constant:
|
|
lean_assert(!const_name(a).is_anonymous());
|
|
s << const_name(a) << const_levels(a);
|
|
break;
|
|
case expr_kind::Sort:
|
|
s << sort_level(a);
|
|
break;
|
|
case expr_kind::Macro:
|
|
s << macro_num_args(a);
|
|
for (unsigned i = 0; i < macro_num_args(a); i++) {
|
|
write_core(macro_arg(a, i));
|
|
}
|
|
macro_def(a).write(s);
|
|
break;
|
|
case expr_kind::App:
|
|
write_core(app_fn(a)); write_core(app_arg(a));
|
|
break;
|
|
case expr_kind::Lambda: case expr_kind::Pi:
|
|
lean_assert(!binding_name(a).is_anonymous());
|
|
write_binder_name(s, binding_name(a));
|
|
s << binding_info(a); write_core(binding_domain(a)); write_core(binding_body(a));
|
|
break;
|
|
case expr_kind::Meta:
|
|
lean_assert(!mlocal_name(a).is_anonymous());
|
|
s << mlocal_name(a); write_core(mlocal_type(a));
|
|
break;
|
|
case expr_kind::Local:
|
|
lean_assert(!mlocal_name(a).is_anonymous());
|
|
lean_assert(!local_pp_name(a).is_anonymous());
|
|
s << mlocal_name(a) << local_pp_name(a) << local_info(a); write_core(mlocal_type(a));
|
|
break;
|
|
}
|
|
});
|
|
}
|
|
public:
|
|
expr_serializer() { m_next_id = 0; }
|
|
void write(expr const & a) {
|
|
write_core(m_max_sharing_fn(a));
|
|
}
|
|
};
|
|
|
|
class expr_deserializer : public object_deserializer<expr> {
|
|
typedef object_deserializer<expr> super;
|
|
public:
|
|
expr read_binding(expr_kind k) {
|
|
deserializer & d = get_owner();
|
|
name n = read_name(d);
|
|
binder_info i = read_binder_info(d);
|
|
expr t = read();
|
|
return mk_binding(k, n, t, read(), i);
|
|
}
|
|
|
|
expr read() {
|
|
return super::read_core([&](char c) {
|
|
deserializer & d = get_owner();
|
|
auto k = static_cast<expr_kind>(c);
|
|
switch (k) {
|
|
case expr_kind::Var:
|
|
return mk_var(d.read_unsigned());
|
|
case expr_kind::Constant: {
|
|
auto n = read_name(d);
|
|
return mk_constant(n, read_levels(d));
|
|
}
|
|
case expr_kind::Sort:
|
|
return mk_sort(read_level(d));
|
|
case expr_kind::Macro: {
|
|
unsigned n = d.read_unsigned();
|
|
buffer<expr> args;
|
|
for (unsigned i = 0; i < n; i++) {
|
|
args.push_back(read());
|
|
}
|
|
return read_macro_definition(d, args.size(), args.data());
|
|
}
|
|
case expr_kind::App: {
|
|
expr f = read();
|
|
return mk_app(f, read());
|
|
}
|
|
case expr_kind::Lambda: case expr_kind::Pi:
|
|
return read_binding(k);
|
|
case expr_kind::Meta: {
|
|
name n = read_name(d);
|
|
return mk_metavar(n, read());
|
|
}
|
|
case expr_kind::Local: {
|
|
name n = read_name(d);
|
|
name pp_n = read_name(d);
|
|
binder_info bi = read_binder_info(d);
|
|
return mk_local(n, pp_n, read(), bi);
|
|
}}
|
|
throw corrupted_stream_exception(); // LCOV_EXCL_LINE
|
|
});
|
|
}
|
|
};
|
|
|
|
struct expr_sd {
|
|
unsigned m_s_extid;
|
|
unsigned m_d_extid;
|
|
expr_sd() {
|
|
m_s_extid = serializer::register_extension([](){ return std::unique_ptr<serializer::extension>(new expr_serializer()); });
|
|
m_d_extid = deserializer::register_extension([](){ return std::unique_ptr<deserializer::extension>(new expr_deserializer()); });
|
|
}
|
|
};
|
|
static expr_sd * g_expr_sd = nullptr;
|
|
|
|
serializer & operator<<(serializer & s, expr const & n) {
|
|
s.get_extension<expr_serializer>(g_expr_sd->m_s_extid).write(n);
|
|
return s;
|
|
}
|
|
|
|
expr read_expr(deserializer & d) {
|
|
return d.get_extension<expr_deserializer>(g_expr_sd->m_d_extid).read();
|
|
}
|
|
|
|
// Declaration serialization
|
|
serializer & operator<<(serializer & s, level_param_names const & ps) { return write_list<name>(s, ps); }
|
|
level_param_names read_level_params(deserializer & d) { return read_list<name>(d); }
|
|
serializer & operator<<(serializer & s, declaration const & d) {
|
|
char k = 0;
|
|
if (d.is_definition()) {
|
|
k |= 1;
|
|
if (d.is_opaque())
|
|
k |= 2;
|
|
if (d.use_conv_opt())
|
|
k |= 4;
|
|
}
|
|
if (d.is_theorem() || d.is_axiom())
|
|
k |= 8;
|
|
s << k << d.get_name() << d.get_univ_params() << d.get_type();
|
|
if (d.is_definition()) {
|
|
s << d.get_value();
|
|
if (!d.is_theorem())
|
|
s << d.get_weight();
|
|
}
|
|
return s;
|
|
}
|
|
|
|
declaration read_declaration(deserializer & d, module_idx midx) {
|
|
char k = d.read_char();
|
|
bool has_value = (k & 1) != 0;
|
|
bool is_th_ax = (k & 8) != 0;
|
|
name n = read_name(d);
|
|
level_param_names ps = read_level_params(d);
|
|
expr t = read_expr(d);
|
|
if (has_value) {
|
|
expr v = read_expr(d);
|
|
if (is_th_ax) {
|
|
return mk_theorem(n, ps, t, v, midx);
|
|
} else {
|
|
unsigned w = d.read_unsigned();
|
|
bool is_opaque = (k & 2) != 0;
|
|
bool use_conv_opt = (k & 4) != 0;
|
|
return mk_definition(n, ps, t, v, is_opaque, w, midx, use_conv_opt);
|
|
}
|
|
} else {
|
|
if (is_th_ax)
|
|
return mk_axiom(n, ps, t);
|
|
else
|
|
return mk_constant_assumption(n, ps, t);
|
|
}
|
|
}
|
|
|
|
using inductive::inductive_decl;
|
|
using inductive::intro_rule;
|
|
using inductive::inductive_decl_name;
|
|
using inductive::inductive_decl_type;
|
|
using inductive::inductive_decl_intros;
|
|
using inductive::intro_rule_name;
|
|
using inductive::intro_rule_type;
|
|
|
|
serializer & operator<<(serializer & s, inductive_decls const & ds) {
|
|
s << std::get<0>(ds) << std::get<1>(ds);
|
|
auto const & ls = std::get<2>(ds);
|
|
s << length(ls);
|
|
for (inductive_decl const & d : ls) {
|
|
s << inductive_decl_name(d) << inductive_decl_type(d) << length(inductive_decl_intros(d));
|
|
for (intro_rule const & r : inductive_decl_intros(d))
|
|
s << intro_rule_name(r) << intro_rule_type(r);
|
|
}
|
|
return s;
|
|
}
|
|
|
|
inductive_decls read_inductive_decls(deserializer & d) {
|
|
level_param_names ps = read_level_params(d);
|
|
unsigned num_params, num_decls;
|
|
d >> num_params >> num_decls;
|
|
buffer<inductive_decl> decls;
|
|
for (unsigned i = 0; i < num_decls; i++) {
|
|
name d_name = read_name(d);
|
|
expr d_type = read_expr(d);
|
|
unsigned num_intros = d.read_unsigned();
|
|
buffer<intro_rule> rules;
|
|
for (unsigned j = 0; j < num_intros; j++) {
|
|
name r_name = read_name(d);
|
|
expr r_type = read_expr(d);
|
|
rules.push_back(intro_rule(r_name, r_type));
|
|
}
|
|
decls.push_back(inductive_decl(d_name, d_type, to_list(rules.begin(), rules.end())));
|
|
}
|
|
return inductive_decls(ps, num_params, to_list(decls.begin(), decls.end()));
|
|
}
|
|
|
|
void initialize_kernel_serializer() {
|
|
g_level_sd = new level_sd();
|
|
g_macro_readers = new macro_readers();
|
|
g_binder_name = new name("a");
|
|
g_expr_sd = new expr_sd();
|
|
}
|
|
|
|
void finalize_kernel_serializer() {
|
|
delete g_expr_sd;
|
|
delete g_binder_name;
|
|
delete g_macro_readers;
|
|
delete g_level_sd;
|
|
}
|
|
}
|