559211d284
This is one of the performance problems at issue #1646. The method `local_context::erase_user_name(local_decl const & d)` was inefficient when there are many locals with the same user facing name. For size 7 in the example described at issue #1646, the average size of the declaration list was 400. Here are the runtimes for size 7 Before: 19.021 secs After: 16.433 secs There are more performance issues.
512 lines
18 KiB
C++
512 lines
18 KiB
C++
/*
|
|
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
|
|
Author: Leonardo de Moura
|
|
*/
|
|
#include <limits>
|
|
#include "util/fresh_name.h"
|
|
#include "util/list_fn.h"
|
|
#include "kernel/for_each_fn.h"
|
|
#include "kernel/find_fn.h"
|
|
#include "kernel/replace_fn.h"
|
|
#include "library/pp_options.h"
|
|
#include "library/local_context.h"
|
|
#include "library/metavar_context.h"
|
|
#include "library/trace.h"
|
|
|
|
namespace lean {
|
|
static name * g_local_prefix;
|
|
static expr * g_dummy_type;
|
|
static local_decl * g_dummy_decl;
|
|
|
|
DEF_THREAD_MEMORY_POOL(get_local_decl_allocator, sizeof(local_decl::cell));
|
|
|
|
void local_decl::cell::dealloc() {
|
|
this->~cell();
|
|
get_local_decl_allocator().recycle(this);
|
|
}
|
|
local_decl::cell::cell(unsigned idx, name const & n, name const & pp_n, expr const & t, optional<expr> const & v, binder_info const & bi):
|
|
m_name(n), m_pp_name(pp_n), m_type(t), m_value(v), m_bi(bi), m_idx(idx), m_rc(1) {}
|
|
|
|
local_decl::local_decl():local_decl(*g_dummy_decl) {}
|
|
local_decl::local_decl(unsigned idx, name const & n, name const & pp_n, expr const & t, optional<expr> const & v, binder_info const & bi) {
|
|
m_ptr = new (get_local_decl_allocator().allocate()) cell(idx, n, pp_n, t, v, bi);
|
|
}
|
|
|
|
local_decl::local_decl(local_decl const & d, expr const & t, optional<expr> const & v):
|
|
local_decl(d.m_ptr->m_idx, d.m_ptr->m_name, d.m_ptr->m_pp_name, t, v, d.m_ptr->m_bi) {}
|
|
|
|
name mk_local_decl_name() {
|
|
return mk_tagged_fresh_name(*g_local_prefix);
|
|
}
|
|
|
|
DEBUG_CODE(
|
|
static bool is_local_decl_name(name const & n) {
|
|
return is_tagged_by(n, *g_local_prefix);
|
|
})
|
|
|
|
static expr mk_local_ref(name const & n, name const & pp_n, binder_info const & bi) {
|
|
return mk_local(n, pp_n, *g_dummy_type, bi);
|
|
}
|
|
|
|
bool is_local_decl_ref(expr const & e) {
|
|
return is_local(e) && mlocal_type(e) == *g_dummy_type;
|
|
}
|
|
|
|
expr local_decl::mk_ref() const {
|
|
return mk_local_ref(m_ptr->m_name, m_ptr->m_pp_name, m_ptr->m_bi);
|
|
}
|
|
|
|
struct depends_on_fn {
|
|
metavar_context const & m_mctx;
|
|
local_context const * m_lctx;
|
|
unsigned m_num;
|
|
expr const * m_locals;
|
|
name_set m_visited_mvars;
|
|
name_set m_visited_decls;
|
|
|
|
depends_on_fn(metavar_context const & mctx, local_context const & lctx, unsigned num, expr const * locals):
|
|
m_mctx(mctx), m_lctx(&lctx), m_num(num), m_locals(locals) {
|
|
lean_assert(std::all_of(locals, locals+num, is_local_decl_ref));
|
|
}
|
|
|
|
depends_on_fn(metavar_context const & mctx, unsigned num, expr const * locals):
|
|
m_mctx(mctx), m_lctx(nullptr), m_num(num), m_locals(locals) {
|
|
lean_assert(std::all_of(locals, locals+num, is_local_decl_ref));
|
|
}
|
|
|
|
bool visit(expr const & e) {
|
|
if (!has_local(e) && !has_expr_metavar(e))
|
|
return false;
|
|
bool found = false;
|
|
for_each(e, [&](expr const & e, unsigned) {
|
|
if (found) return false;
|
|
if (!has_local(e) && !has_expr_metavar(e)) return false;
|
|
if (is_local_decl_ref(e)) {
|
|
if (std::any_of(m_locals, m_locals + m_num,
|
|
[&](expr const & l) { return mlocal_name(e) == mlocal_name(l); })) {
|
|
found = true;
|
|
return false;
|
|
}
|
|
if (m_lctx) {
|
|
if (optional<local_decl> decl = m_lctx->find_local_decl(e)) {
|
|
if (optional<expr> v = decl->get_value()) {
|
|
if (!m_visited_decls.contains(decl->get_name())) {
|
|
m_visited_decls.insert(decl->get_name());
|
|
if (visit(*v)) {
|
|
found = true;
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
if (is_metavar_decl_ref(e)) {
|
|
if (auto v = m_mctx.get_assignment(e)) {
|
|
if (!m_visited_mvars.contains(mlocal_name(e))) {
|
|
m_visited_mvars.insert(mlocal_name(e));
|
|
if (visit(*v)) {
|
|
found = true;
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return true;
|
|
});
|
|
return found;
|
|
}
|
|
|
|
bool operator()(expr const & e) { return visit(e); }
|
|
};
|
|
|
|
bool depends_on(expr const & e, metavar_context const & mctx, unsigned num, expr const * locals) {
|
|
return depends_on_fn(mctx, num, locals)(e);
|
|
}
|
|
|
|
bool depends_on(local_decl const & d, metavar_context const & mctx, unsigned num, expr const * locals) {
|
|
depends_on_fn fn(mctx, num, locals);
|
|
if (fn(d.get_type()))
|
|
return true;
|
|
if (auto v = d.get_value()) {
|
|
return fn(*v);
|
|
}
|
|
return false;
|
|
}
|
|
|
|
bool depends_on(expr const & e, metavar_context const & mctx, buffer<expr> const & locals) {
|
|
return depends_on_fn(mctx, locals.size(), locals.data())(e);
|
|
}
|
|
|
|
bool depends_on(local_decl const & d, metavar_context const & mctx, buffer<expr> const & locals) {
|
|
return depends_on(d, mctx, locals.size(), locals.data());
|
|
}
|
|
|
|
bool depends_on(expr const & e, metavar_context const & mctx, local_context const & lctx, unsigned num, expr const * locals) {
|
|
return depends_on_fn(mctx, lctx, num, locals)(e);
|
|
}
|
|
|
|
void local_context::insert_user_name(local_decl const &d) {
|
|
unsigned_set idxs;
|
|
if (auto existing_idxs = m_user_name2idxs.find(d.get_pp_name())) {
|
|
idxs = *existing_idxs;
|
|
} else {
|
|
m_user_names.insert(d.get_pp_name());
|
|
}
|
|
idxs.insert(d.get_idx());
|
|
m_user_name2idxs.insert(d.get_pp_name(), idxs);
|
|
}
|
|
|
|
void local_context::erase_user_name(local_decl const & d) {
|
|
unsigned_set idxs = *m_user_name2idxs.find(d.get_pp_name());
|
|
idxs.erase(d.get_idx());
|
|
if (idxs.empty()) {
|
|
m_user_name2idxs.erase(d.get_pp_name());
|
|
m_user_names.erase(d.get_pp_name());
|
|
} else {
|
|
m_user_name2idxs.insert(d.get_pp_name(), idxs);
|
|
}
|
|
}
|
|
|
|
expr local_context::mk_local_decl(name const & n, name const & ppn, expr const & type, optional<expr> const & value, binder_info const & bi) {
|
|
lean_assert(is_local_decl_name(n));
|
|
lean_assert(!m_name2local_decl.contains(n));
|
|
unsigned idx = m_next_idx;
|
|
m_next_idx++;
|
|
local_decl l(idx, n, ppn, type, value, bi);
|
|
m_name2local_decl.insert(n, l);
|
|
m_idx2local_decl.insert(idx, l);
|
|
insert_user_name(l);
|
|
return mk_local_ref(n, ppn, bi);
|
|
}
|
|
|
|
expr local_context::mk_local_decl(expr const & type, binder_info const & bi) {
|
|
name n = mk_local_decl_name();
|
|
return mk_local_decl(n, n, type, none_expr(), bi);
|
|
}
|
|
|
|
expr local_context::mk_local_decl(expr const & type, expr const & value) {
|
|
name n = mk_local_decl_name();
|
|
return mk_local_decl(n, n, type, some_expr(value), binder_info());
|
|
}
|
|
|
|
expr local_context::mk_local_decl(name const & ppn, expr const & type, binder_info const & bi) {
|
|
return mk_local_decl(mk_local_decl_name(), ppn, type, none_expr(), bi);
|
|
}
|
|
|
|
expr local_context::mk_local_decl(name const & ppn, expr const & type, expr const & value) {
|
|
return mk_local_decl(mk_local_decl_name(), ppn, type, some_expr(value), binder_info());
|
|
}
|
|
|
|
expr local_context::mk_local_decl(name const & n, name const & ppn, expr const & type, binder_info const & bi) {
|
|
return mk_local_decl(n, ppn, type, none_expr(), bi);
|
|
}
|
|
|
|
expr local_context::mk_local_decl(name const & n, name const & ppn, expr const & type, expr const & value) {
|
|
return mk_local_decl(n, ppn, type, some_expr(value), binder_info());
|
|
}
|
|
|
|
optional<local_decl> local_context::find_local_decl(name const & n) const {
|
|
if (auto r = m_name2local_decl.find(n))
|
|
return optional<local_decl>(*r);
|
|
else
|
|
return optional<local_decl>();
|
|
}
|
|
|
|
optional<local_decl> local_context::find_local_decl(expr const & e) const {
|
|
lean_assert(is_local_decl_ref(e));
|
|
return find_local_decl(mlocal_name(e));
|
|
}
|
|
|
|
local_decl const & local_context::get_local_decl(name const & n) const {
|
|
if (local_decl const * r = m_name2local_decl.find(n))
|
|
return *r;
|
|
else
|
|
throw exception(sstream() << "unknown local constant: " << n);
|
|
}
|
|
|
|
local_decl const & local_context::get_local_decl(expr const & e) const {
|
|
lean_assert(is_local_decl_ref(e));
|
|
return get_local_decl(mlocal_name(e));
|
|
}
|
|
|
|
|
|
expr local_context::get_local(name const & n) const {
|
|
lean_assert(find_local_decl(n));
|
|
return get_local_decl(n).mk_ref();
|
|
}
|
|
|
|
void local_context::for_each(std::function<void(local_decl const &)> const & fn) const {
|
|
m_idx2local_decl.for_each([&](unsigned, local_decl const & d) { fn(d); });
|
|
}
|
|
|
|
optional<local_decl> local_context::find_if(std::function<bool(local_decl const &)> const & pred) const { // NOLINT
|
|
return m_idx2local_decl.find_if([&](unsigned, local_decl const & d) { return pred(d); });
|
|
}
|
|
|
|
optional<local_decl> local_context::back_find_if(std::function<bool(local_decl const &)> const & pred) const { // NOLINT
|
|
return m_idx2local_decl.back_find_if([&](unsigned, local_decl const & d) { return pred(d); });
|
|
}
|
|
|
|
optional<local_decl> local_context::find_local_decl_from_user_name(name const & n) const {
|
|
if (auto idxs = m_user_name2idxs.find(n)) {
|
|
if (auto m = idxs->max()) {
|
|
return optional<local_decl>(*m_idx2local_decl.find(*m));
|
|
}
|
|
}
|
|
return optional<local_decl>();
|
|
}
|
|
|
|
optional<local_decl> local_context::find_last_local_decl() const {
|
|
if (m_idx2local_decl.empty()) return optional<local_decl>();
|
|
return optional<local_decl>(m_idx2local_decl.max());
|
|
}
|
|
|
|
local_decl local_context::get_last_local_decl() const {
|
|
if (m_idx2local_decl.empty()) throw("unknown local constant, context is empty");
|
|
return m_idx2local_decl.max();
|
|
}
|
|
|
|
void local_context::for_each_after(local_decl const & d, std::function<void(local_decl const &)> const & fn) const {
|
|
m_idx2local_decl.for_each_greater(d.get_idx(), [&](unsigned, local_decl const & d) { return fn(d); });
|
|
}
|
|
|
|
void local_context::pop_local_decl() {
|
|
lean_assert(!m_idx2local_decl.empty());
|
|
local_decl d = m_idx2local_decl.max();
|
|
m_name2local_decl.erase(d.get_name());
|
|
m_idx2local_decl.erase(d.get_idx());
|
|
erase_user_name(d);
|
|
}
|
|
|
|
bool local_context::rename_user_name(name const & from, name const & to) {
|
|
if (auto d = find_local_decl_from_user_name(from)) {
|
|
erase_user_name(*d);
|
|
local_decl new_d(d->get_idx(), d->get_name(), to, d->get_type(), d->get_value(), d->get_info());
|
|
m_idx2local_decl.insert(d->get_idx(), new_d);
|
|
m_name2local_decl.insert(d->get_name(), new_d);
|
|
insert_user_name(new_d);
|
|
return true;
|
|
} else {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
optional<local_decl> local_context::has_dependencies(local_decl const & d, metavar_context const & mctx) const {
|
|
lean_assert(find_local_decl(d.get_name()));
|
|
expr l = d.mk_ref();
|
|
optional<local_decl> r;
|
|
for_each_after(d, [&](local_decl const & d2) {
|
|
if (r) return;
|
|
if (depends_on(d2, mctx, 1, &l))
|
|
r = d2;
|
|
});
|
|
return r;
|
|
}
|
|
|
|
void local_context::clear(local_decl const & d) {
|
|
lean_assert(find_local_decl(d.get_name()));
|
|
m_idx2local_decl.erase(d.get_idx());
|
|
m_name2local_decl.erase(d.get_name());
|
|
erase_user_name(d);
|
|
}
|
|
|
|
bool local_context::is_subset_of(name_set const & ls) const {
|
|
// TODO(Leo): we can improve performance by implementing the subset operation in the rb_map/rb_tree class
|
|
return !static_cast<bool>(m_name2local_decl.find_if([&](name const & n, local_decl const &) {
|
|
return !ls.contains(n);
|
|
}));
|
|
}
|
|
|
|
bool local_context::is_subset_of(local_context const & ctx) const {
|
|
// TODO(Leo): we can improve performance by implementing the subset operation in the rb_map/rb_tree class
|
|
return !static_cast<bool>(m_name2local_decl.find_if([&](name const & n, local_decl const &) {
|
|
return !ctx.m_name2local_decl.contains(n);
|
|
}));
|
|
}
|
|
|
|
local_context local_context::remove(buffer<expr> const & locals) const {
|
|
lean_assert(std::all_of(locals.begin(), locals.end(),
|
|
[&](expr const & l) {
|
|
return is_local_decl_ref(l) && find_local_decl(l);
|
|
}));
|
|
/* TODO(Leo): check whether the following loop is a performance bottleneck. */
|
|
local_context r = *this;
|
|
r.m_instance_fingerprint = m_instance_fingerprint;
|
|
for (expr const & l : locals) {
|
|
local_decl d = get_local_decl(l);
|
|
r.m_name2local_decl.erase(mlocal_name(l));
|
|
r.m_idx2local_decl.erase(d.get_idx());
|
|
r.erase_user_name(d);
|
|
}
|
|
lean_assert(r.well_formed());
|
|
return r;
|
|
}
|
|
|
|
/* Return true iff all local_decl references in \c e are in \c s. */
|
|
static bool locals_subset_of(expr const & e, name_set const & s) {
|
|
bool ok = true;
|
|
for_each(e, [&](expr const & e, unsigned) {
|
|
if (!ok) return false; // stop search
|
|
if (is_local_decl_ref(e) && !s.contains(mlocal_name(e))) {
|
|
ok = false;
|
|
return false;
|
|
}
|
|
return true;
|
|
});
|
|
return ok;
|
|
}
|
|
|
|
bool local_context::well_formed() const {
|
|
bool ok = true;
|
|
name_set found_locals;
|
|
for_each([&](local_decl const & d) {
|
|
if (!locals_subset_of(d.get_type(), found_locals)) {
|
|
ok = false;
|
|
lean_unreachable();
|
|
}
|
|
if (auto v = d.get_value()) {
|
|
if (!locals_subset_of(*v, found_locals)) {
|
|
ok = false;
|
|
lean_unreachable();
|
|
}
|
|
}
|
|
if (!m_user_names.contains(d.get_pp_name())) {
|
|
ok = false;
|
|
lean_unreachable();
|
|
}
|
|
found_locals.insert(d.get_name());
|
|
});
|
|
return ok;
|
|
}
|
|
|
|
bool local_context::well_formed(expr const & e) const {
|
|
bool ok = true;
|
|
::lean::for_each(e, [&](expr const & e, unsigned) {
|
|
if (!ok) return false;
|
|
if (is_local_decl_ref(e) && !find_local_decl(e)) {
|
|
ok = false;
|
|
}
|
|
return true;
|
|
});
|
|
return ok;
|
|
}
|
|
|
|
format local_context::pp(formatter const & fmt, std::function<bool(local_decl const &)> const & pred) const { // NOLINT
|
|
options const & opts = fmt.get_options();
|
|
unsigned indent = get_pp_indent(opts);
|
|
unsigned max_hs = get_pp_goal_max_hyps(opts);
|
|
bool first = true;
|
|
unsigned i = 0;
|
|
format ids;
|
|
optional<expr> type;
|
|
format r;
|
|
m_idx2local_decl.for_each([&](unsigned, local_decl const & d) {
|
|
if (!pred(d))
|
|
return;
|
|
if (i >= max_hs)
|
|
return;
|
|
i++;
|
|
if (type && (d.get_type() != *type || d.get_value())) {
|
|
// add (ids : type) IF the d.get_type() != type OR d is a let-decl
|
|
if (first) first = false;
|
|
else r += comma() + line();
|
|
|
|
r += group(ids + space() + colon() + nest(indent, line() + fmt(*type)));
|
|
type = optional<expr>();
|
|
ids = format();
|
|
}
|
|
|
|
name n = sanitize_if_fresh(d.get_pp_name());
|
|
|
|
if (d.get_value()) {
|
|
if (first) first = false;
|
|
else r += comma() + line();
|
|
r += group(format(n) + space() + colon() + space() + fmt(d.get_type()) +
|
|
space() + format(":=") + nest(indent, line() + fmt(*d.get_value())));
|
|
} else if (!type) {
|
|
lean_assert(!d.get_value());
|
|
ids = format(n);
|
|
type = d.get_type();
|
|
} else {
|
|
lean_assert(!d.get_value());
|
|
lean_assert(type && d.get_type() == *type);
|
|
ids += space() + format(n);
|
|
}
|
|
});
|
|
if (type) {
|
|
if (!first) r += comma() + line();
|
|
r += group(ids + space() + colon() + nest(indent, line() + fmt(*type)));
|
|
}
|
|
if (get_pp_goal_compact(opts))
|
|
r = group(r);
|
|
return r;
|
|
}
|
|
|
|
bool local_context::uses_user_name(name const & n) const {
|
|
return m_user_names.contains(n);
|
|
}
|
|
|
|
name local_context::get_unused_name(name const & prefix, unsigned & idx) const {
|
|
return m_user_names.get_unused_name(prefix, idx);
|
|
}
|
|
|
|
name local_context::get_unused_name(name const & suggestion) const {
|
|
return m_user_names.get_unused_name(suggestion);
|
|
}
|
|
|
|
local_context local_context::instantiate_mvars(metavar_context & mctx) const {
|
|
local_context r;
|
|
r.m_next_idx = m_next_idx;
|
|
m_idx2local_decl.for_each([&](unsigned, local_decl const & d) {
|
|
expr new_type = mctx.instantiate_mvars(d.m_ptr->m_type);
|
|
optional<expr> new_value;
|
|
if (d.m_ptr->m_value)
|
|
new_value = mctx.instantiate_mvars(*d.m_ptr->m_value);
|
|
local_decl new_d(d, new_type, new_value);
|
|
r.m_name2local_decl.insert(d.get_name(), new_d);
|
|
r.m_idx2local_decl.insert(d.get_idx(), new_d);
|
|
r.insert_user_name(d);
|
|
});
|
|
return r;
|
|
}
|
|
|
|
bool contains_let_local_decl(local_context const & lctx, expr const & e) {
|
|
if (!has_local(e)) return false;
|
|
return static_cast<bool>(find(e, [&](expr const & e, unsigned) {
|
|
if (!is_local(e)) return false;
|
|
optional<local_decl> d = lctx.find_local_decl(e);
|
|
return d && d->get_value();
|
|
}));
|
|
}
|
|
|
|
expr zeta_expand(local_context const & lctx, expr const & e) {
|
|
if (!contains_let_local_decl(lctx, e)) return e;
|
|
return replace(e, [&](expr const & e, unsigned) {
|
|
if (!has_local(e)) return some_expr(e);
|
|
if (is_local(e)) {
|
|
if (auto d = lctx.find_local_decl(e)) {
|
|
if (auto v = d->get_value())
|
|
return some_expr(zeta_expand(lctx, *v));
|
|
}
|
|
}
|
|
return none_expr();
|
|
});
|
|
}
|
|
|
|
void initialize_local_context() {
|
|
g_local_prefix = new name(name::mk_internal_unique_name());
|
|
g_dummy_type = new expr(mk_constant(name::mk_internal_unique_name()));
|
|
g_dummy_decl = new local_decl(std::numeric_limits<unsigned>::max(),
|
|
name("__local_decl_for_default_constructor"), name("__local_decl_for_default_constructor"),
|
|
*g_dummy_type, optional<expr>(), binder_info());
|
|
}
|
|
|
|
void finalize_local_context() {
|
|
delete g_local_prefix;
|
|
delete g_dummy_type;
|
|
delete g_dummy_decl;
|
|
}
|
|
}
|