5cd352588c
`unordered_map`/`unordered_set` does an allocation per insert, use mimalloc for them for important hash maps
70 lines
2.3 KiB
C++
70 lines
2.3 KiB
C++
/*
|
|
Copyright (c) 2024 Amazon.com, Inc. or its affiliates. All Rights Reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
|
|
Author: Leonardo de Moura
|
|
*/
|
|
#pragma once
|
|
#include <vector>
|
|
#include "runtime/object_ref.h"
|
|
#include "util/alloc.h"
|
|
|
|
namespace lean {
|
|
extern "C" LEAN_EXPORT uint8 lean_sharecommon_eq(b_obj_arg o1, b_obj_arg o2);
|
|
extern "C" LEAN_EXPORT uint64_t lean_sharecommon_hash(b_obj_arg o);
|
|
|
|
/*
|
|
A faster version of `sharecommon_fn` which only uses a local state.
|
|
It optimizes the number of RC operations, the strategy for caching results,
|
|
and uses C++ hashmap.
|
|
*/
|
|
class LEAN_EXPORT sharecommon_quick_fn {
|
|
protected:
|
|
struct set_hash {
|
|
std::size_t operator()(lean_object * o) const { return lean_sharecommon_hash(o); }
|
|
};
|
|
struct set_eq {
|
|
std::size_t operator()(lean_object * o1, lean_object * o2) const { return lean_sharecommon_eq(o1, o2); }
|
|
};
|
|
|
|
/*
|
|
We use `m_cache` to ensure we do **not** traverse a DAG as a tree.
|
|
We use pointer equality for this collection.
|
|
*/
|
|
lean::unordered_map<lean_object *, lean_object *> m_cache;
|
|
/* Set of maximally shared terms. AKA hash-consing table. */
|
|
lean::unordered_set<lean_object *, set_hash, set_eq> m_set;
|
|
/*
|
|
If `true`, `check_cache` will also check `m_set`.
|
|
This is useful when the input term may contain terms that have already
|
|
been hashconsed.
|
|
*/
|
|
bool m_check_set;
|
|
|
|
lean_object * check_cache(lean_object * a);
|
|
lean_object * save(lean_object * a, lean_object * new_a);
|
|
lean_object * visit_terminal(lean_object * a);
|
|
lean_object * visit_array(lean_object * a);
|
|
lean_object * visit_ctor(lean_object * a);
|
|
lean_object * visit(lean_object * a);
|
|
public:
|
|
sharecommon_quick_fn(bool s = false):m_check_set(s) {}
|
|
void set_check_set(bool f) { m_check_set = f; }
|
|
lean_object * operator()(lean_object * a) {
|
|
return visit(a);
|
|
}
|
|
};
|
|
|
|
/*
|
|
Similar to `sharecommon_quick_fn`, but we save the entry points and result values to ensure
|
|
they are not deleted.
|
|
*/
|
|
class LEAN_EXPORT sharecommon_persistent_fn : private sharecommon_quick_fn {
|
|
std::vector<object_ref> m_saved;
|
|
public:
|
|
sharecommon_persistent_fn(bool s = false):sharecommon_quick_fn(s) {}
|
|
void set_check_set(bool f) { m_check_set = f; }
|
|
lean_object * operator()(lean_object * e);
|
|
};
|
|
|
|
};
|