/* Copyright (c) 2013-2014 Microsoft Corporation. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Author: Leonardo de Moura */ #include #include #include "kernel/replace_fn.h" #include "kernel/cache_stack.h" #ifndef LEAN_DEFAULT_REPLACE_CACHE_CAPACITY #define LEAN_DEFAULT_REPLACE_CACHE_CAPACITY 1024*8 #endif namespace lean { struct replace_cache { struct entry { object * m_cell; unsigned m_offset; expr m_result; entry():m_cell(nullptr) {} }; unsigned m_capacity; std::vector m_cache; std::vector m_used; replace_cache(unsigned c):m_capacity(c), m_cache(c) {} expr * find(expr const & e, unsigned offset) { unsigned i = hash(hash(e), offset) % m_capacity; if (m_cache[i].m_cell == e.raw() && m_cache[i].m_offset == offset) return &m_cache[i].m_result; else return nullptr; } void insert(expr const & e, unsigned offset, expr const & v) { unsigned i = hash(hash(e), offset) % m_capacity; if (m_cache[i].m_cell == nullptr) m_used.push_back(i); m_cache[i].m_cell = e.raw(); m_cache[i].m_offset = offset; m_cache[i].m_result = v; } void clear() { for (unsigned i : m_used) { m_cache[i].m_cell = nullptr; m_cache[i].m_result = expr(); } m_used.clear(); } }; /* CACHE_RESET: NO */ MK_CACHE_STACK(replace_cache, LEAN_DEFAULT_REPLACE_CACHE_CAPACITY) class replace_rec_fn { replace_cache_ref m_cache; std::function(expr const &, unsigned)> m_f; bool m_use_cache; expr save_result(expr const & e, unsigned offset, expr const & r, bool shared) { if (shared) m_cache->insert(e, offset, r); return r; } expr apply(expr const & e, unsigned offset) { bool shared = false; if (m_use_cache && is_shared(e)) { if (auto r = m_cache->find(e, offset)) return *r; shared = true; } check_system("replace"); if (optional r = m_f(e, offset)) { return save_result(e, offset, *r, shared); } else { switch (e.kind()) { case expr_kind::Const: case expr_kind::Sort: case expr_kind::BVar: case expr_kind::Lit: case expr_kind::MVar: case expr_kind::FVar: return save_result(e, offset, e, shared); case expr_kind::MData: { expr new_e = apply(mdata_expr(e), offset); return save_result(e, offset, update_mdata(e, new_e), shared); } case expr_kind::Proj: { expr new_e = apply(proj_expr(e), offset); return save_result(e, offset, update_proj(e, new_e), shared); } case expr_kind::App: { expr new_f = apply(app_fn(e), offset); expr new_a = apply(app_arg(e), offset); return save_result(e, offset, update_app(e, new_f, new_a), shared); } case expr_kind::Pi: case expr_kind::Lambda: { expr new_d = apply(binding_domain(e), offset); expr new_b = apply(binding_body(e), offset+1); return save_result(e, offset, update_binding(e, new_d, new_b), shared); } case expr_kind::Let: { expr new_t = apply(let_type(e), offset); expr new_v = apply(let_value(e), offset); expr new_b = apply(let_body(e), offset+1); return save_result(e, offset, update_let(e, new_t, new_v, new_b), shared); } } lean_unreachable(); } } public: template replace_rec_fn(F const & f, bool use_cache):m_f(f), m_use_cache(use_cache) {} expr operator()(expr const & e) { return apply(e, 0); } }; expr replace(expr const & e, std::function(expr const &, unsigned)> const & f, bool use_cache) { return replace_rec_fn(f, use_cache)(e); } }