85092412c7
@Kha @dselsam: This hack was preventing us from making `Expr` a "real" Lean type. This was bad for a few reasons: - It was hard to extend/modify `Expr` in Lean since we would also have to modify the C++ code that creates the `Expr` objects with the hidden fields. - `Expr.lam` and `Expr.forallE` were not following the Lean layout standard where we sort fields by size. @Kha: recall we used that to avoid a UB. The issue with `Expr.lam` and `Expr.forallE` is that they have a "visible" field (`BinderInfo`), which is smaller than hidden fields such as hash code. - `Expr.fvar` had only one field at `Expr.lean,` but four behind the scenes. I added a new constructor `Local` that is only accessible from C++. It is only used in legacy code we inherited from Lean2. We will eventually delete it. This refactoring was quite painful since many parts of the codebase were mixing the new `Expr.fvar` with the old `Expr.local`. I doubt I would be able to do it without the new staging framework @Kha built. BTW, some of the patches are horrible. I didn't care much since we are going to deleted the super ugly files. That being said, you should expect new weird bevaior due to `Expr.fvar` vs `Expr.local`. Next step: use the new `ExprCachedData` to make all `Expr` hidden visibles accessible from Lean. checkpoint
128 lines
4.1 KiB
C++
128 lines
4.1 KiB
C++
/*
|
|
Copyright (c) 2013 Microsoft Corporation. All rights reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
|
|
Author: Leonardo de Moura
|
|
*/
|
|
#include <vector>
|
|
#include <utility>
|
|
#include "runtime/memory.h"
|
|
#include "runtime/interrupt.h"
|
|
#include "runtime/flet.h"
|
|
#include "kernel/for_each_fn.h"
|
|
#include "kernel/cache_stack.h"
|
|
|
|
#ifndef LEAN_DEFAULT_FOR_EACH_CACHE_CAPACITY
|
|
#define LEAN_DEFAULT_FOR_EACH_CACHE_CAPACITY 1024*8
|
|
#endif
|
|
|
|
namespace lean {
|
|
struct for_each_cache {
|
|
struct entry {
|
|
object const * m_cell;
|
|
unsigned m_offset;
|
|
entry():m_cell(nullptr) {}
|
|
};
|
|
unsigned m_capacity;
|
|
std::vector<entry> m_cache;
|
|
std::vector<unsigned> m_used;
|
|
for_each_cache(unsigned c):m_capacity(c), m_cache(c) {}
|
|
|
|
bool visited(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 true;
|
|
} else {
|
|
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;
|
|
return false;
|
|
}
|
|
}
|
|
|
|
void clear() {
|
|
for (unsigned i : m_used)
|
|
m_cache[i].m_cell = nullptr;
|
|
m_used.clear();
|
|
}
|
|
};
|
|
|
|
/* CACHE_RESET: NO */
|
|
MK_CACHE_STACK(for_each_cache, LEAN_DEFAULT_FOR_EACH_CACHE_CAPACITY)
|
|
|
|
class for_each_fn {
|
|
for_each_cache_ref m_cache;
|
|
std::function<bool(expr const &, unsigned)> m_f; // NOLINT
|
|
|
|
void apply(expr const & e, unsigned offset) {
|
|
buffer<pair<expr const &, unsigned>> todo;
|
|
todo.emplace_back(e, offset);
|
|
while (true) {
|
|
begin_loop:
|
|
if (todo.empty())
|
|
break;
|
|
check_interrupted();
|
|
check_memory("expression traversal");
|
|
auto p = todo.back();
|
|
todo.pop_back();
|
|
expr const & e = p.first;
|
|
unsigned offset = p.second;
|
|
|
|
switch (e.kind()) {
|
|
case expr_kind::Const: case expr_kind::BVar:
|
|
case expr_kind::Sort:
|
|
m_f(e, offset);
|
|
goto begin_loop;
|
|
default:
|
|
break;
|
|
}
|
|
|
|
if (is_shared(e) && m_cache->visited(e, offset))
|
|
goto begin_loop;
|
|
|
|
if (!m_f(e, offset))
|
|
goto begin_loop;
|
|
|
|
switch (e.kind()) {
|
|
case expr_kind::Const: case expr_kind::BVar:
|
|
case expr_kind::Sort: case expr_kind::Lit:
|
|
case expr_kind::MVar: case expr_kind::FVar:
|
|
goto begin_loop;
|
|
case expr_kind::MData:
|
|
todo.emplace_back(mdata_expr(e), offset);
|
|
goto begin_loop;
|
|
case expr_kind::Proj:
|
|
todo.emplace_back(proj_expr(e), offset);
|
|
goto begin_loop;
|
|
case expr_kind::Local:
|
|
// TODO(Leo): delete after refactoring
|
|
todo.emplace_back(local_type(e), offset);
|
|
goto begin_loop;
|
|
case expr_kind::App:
|
|
todo.emplace_back(app_arg(e), offset);
|
|
todo.emplace_back(app_fn(e), offset);
|
|
goto begin_loop;
|
|
case expr_kind::Lambda: case expr_kind::Pi:
|
|
todo.emplace_back(binding_body(e), offset + 1);
|
|
todo.emplace_back(binding_domain(e), offset);
|
|
goto begin_loop;
|
|
case expr_kind::Let:
|
|
todo.emplace_back(let_body(e), offset + 1);
|
|
todo.emplace_back(let_value(e), offset);
|
|
todo.emplace_back(let_type(e), offset);
|
|
goto begin_loop;
|
|
}
|
|
}
|
|
}
|
|
|
|
public:
|
|
for_each_fn(std::function<bool(expr const &, unsigned)> && f):m_f(f) {} // NOLINT
|
|
for_each_fn(std::function<bool(expr const &, unsigned)> const & f):m_f(f) {} // NOLINT
|
|
void operator()(expr const & e) { apply(e, 0); }
|
|
};
|
|
|
|
void for_each(expr const & e, std::function<bool(expr const &, unsigned)> && f) { // NOLINT
|
|
return for_each_fn(f)(e);
|
|
}
|
|
}
|