2022-12-19 14:37:51 +00:00
|
|
|
[info]
|
2023-05-23 22:26:38 +01:00
|
|
|
type_name = "std::multimap"
|
|
|
|
stub_template_params = [2,3]
|
2022-12-19 14:37:51 +00:00
|
|
|
ctype = "MULTI_MAP_TYPE"
|
|
|
|
header = "map"
|
2023-05-23 22:26:38 +01:00
|
|
|
|
|
|
|
# Old:
|
|
|
|
typeName = "std::multimap"
|
2022-12-19 14:37:51 +00:00
|
|
|
ns = ["namespace std"]
|
2023-05-23 22:26:38 +01:00
|
|
|
numTemplateParams = 2
|
2023-01-20 16:30:02 +00:00
|
|
|
replaceTemplateParamIndex = [2]
|
|
|
|
allocatorIndex = 3
|
2022-12-19 14:37:51 +00:00
|
|
|
|
|
|
|
[codegen]
|
|
|
|
decl = """
|
|
|
|
template<class Key, class T, class Compare, class Allocator>
|
|
|
|
void getSizeType(const %1%<Key,T,Compare,Allocator> &container, size_t& returnArg);
|
|
|
|
"""
|
|
|
|
|
|
|
|
func = """
|
|
|
|
template<class Key, class T, class Compare, class Allocator>
|
|
|
|
void getSizeType(const %1%<Key,T,Compare,Allocator> &container, size_t& returnArg)
|
|
|
|
{
|
|
|
|
SAVE_SIZE(sizeof(%1%<Key,T,Compare,Allocator>));
|
|
|
|
|
|
|
|
SAVE_DATA((uintptr_t)container.size());
|
|
|
|
|
|
|
|
for (auto const& it : container)
|
|
|
|
{
|
|
|
|
getSizeType(it.first, returnArg);
|
|
|
|
getSizeType(it.second, returnArg);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
"""
|
2023-04-20 17:52:58 +01:00
|
|
|
|
2023-08-24 16:58:59 +01:00
|
|
|
traversal_func = """
|
|
|
|
auto tail = returnArg
|
|
|
|
.write((uintptr_t)&container)
|
|
|
|
.write(container.size());
|
|
|
|
|
|
|
|
for (const auto &entry: container) {
|
2023-11-16 15:34:03 +00:00
|
|
|
tail = tail.delegate([&ctx, &key = entry.first, &value = entry.second](auto ret) {
|
|
|
|
auto next = ret.delegate([&ctx, &key](typename TypeHandler<Ctx, T0>::type ret) {
|
|
|
|
return OIInternal::getSizeType<Ctx>(ctx, key, ret);
|
2023-08-24 16:58:59 +01:00
|
|
|
});
|
2023-11-16 15:34:03 +00:00
|
|
|
return OIInternal::getSizeType<Ctx>(ctx, value, next);
|
2023-08-24 16:58:59 +01:00
|
|
|
});
|
|
|
|
}
|
|
|
|
|
|
|
|
return tail.finish();
|
|
|
|
"""
|
|
|
|
|
|
|
|
[[codegen.processor]]
|
|
|
|
type = "types::st::VarInt<DB>"
|
|
|
|
func = "el.pointer = std::get<ParsedData::VarInt>(d.val).value;"
|
|
|
|
|
|
|
|
[[codegen.processor]]
|
|
|
|
type = """
|
|
|
|
types::st::List<DB, types::st::Pair<DB,
|
2023-11-15 19:28:21 +00:00
|
|
|
typename TypeHandler<Ctx, T0>::type,
|
|
|
|
typename TypeHandler<Ctx, T1>::type>>
|
2023-08-24 16:58:59 +01:00
|
|
|
"""
|
|
|
|
func = """
|
|
|
|
#ifdef __GLIBCXX__
|
|
|
|
/* We don't have access to the _Rb_tree_node struct, so we manually re-create it
|
|
|
|
* to get the effective size of a multimap entry. Is there a better way to do this?
|
|
|
|
*
|
|
|
|
* https://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/a00716_source.html#l00216
|
|
|
|
* From the source of <bits/stl_tree.h>, an _Rb_tree_node has the following members:
|
|
|
|
*/
|
|
|
|
struct OI_Rb_tree_node {
|
|
|
|
using _Rb_tree_color = int; // enum
|
|
|
|
using _Base_ptr = std::nullptr_t; // pointer
|
|
|
|
using _value_type = std::pair<const T0, T1>; // from https://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/a00695_source.html#l00104
|
|
|
|
|
|
|
|
_Rb_tree_color _M_color; // from parent _Rb_tree_node_base
|
|
|
|
_Base_ptr _M_parent; // from parent _Rb_tree_node_base
|
|
|
|
_Base_ptr _M_left; // from parent _Rb_tree_node_base
|
|
|
|
_Base_ptr _M_right; // from parent _Rb_tree_node_base
|
|
|
|
_value_type _M_value;
|
|
|
|
};
|
|
|
|
|
|
|
|
static constexpr size_t element_size = sizeof(OI_Rb_tree_node);
|
|
|
|
#elif _LIBCPP_VERSION
|
|
|
|
static_assert(false && "libc++ is currently not supported");
|
|
|
|
|
|
|
|
/* We don't have access to the __tree_node struct, so we manually re-create it
|
|
|
|
* to get the effective size of a multimap entry. Is there a better way to do this?
|
|
|
|
*
|
|
|
|
* https://github.com/llvm/llvm-project/blob/1b10920164695a487669405223f8bbe93799430c/libcxx/include/__tree#L729-L781
|
|
|
|
* From the source of <__tree>, a __tree_node has the following members:
|
|
|
|
*/
|
|
|
|
struct OI__tree_node {
|
|
|
|
using pointer = std::nullptr_t; // pointer
|
|
|
|
using __parent_pointer = std::nullptr_t; // pointer
|
|
|
|
using _value_pair = std::pair<const T0, T1>; // from https://github.com/llvm/llvm-project/blob/main/libcxx/include/map#L1864
|
|
|
|
|
|
|
|
pointer __left_; // from parent __tree_end_node
|
|
|
|
pointer __right_; // from parent __tree_node_base
|
|
|
|
__parent_pointer __parent_; // from parent __tree_node_base
|
|
|
|
bool __is_black_; // from parent __tree_node_base
|
|
|
|
_value_type __value_;
|
|
|
|
};
|
|
|
|
|
|
|
|
static constexpr size_t element_size = sizeof(OI__tree_node);
|
|
|
|
#else
|
|
|
|
static_assert(false && "No known element_size for sets. See types/multi_map_type.toml");
|
|
|
|
#endif
|
|
|
|
|
2023-08-25 18:36:42 +01:00
|
|
|
static constexpr std::array<inst::Field, 2> elementFields{
|
2023-11-15 19:28:21 +00:00
|
|
|
make_field<Ctx, T0>("key"),
|
|
|
|
make_field<Ctx, T1>("value"),
|
2023-08-24 16:58:59 +01:00
|
|
|
};
|
|
|
|
static constexpr auto element = inst::Field {
|
|
|
|
element_size,
|
|
|
|
element_size - sizeof(T0) - sizeof(T1),
|
|
|
|
"[]",
|
2023-08-24 13:42:12 +01:00
|
|
|
std::array<std::string_view, 0>{},
|
2023-08-25 18:36:42 +01:00
|
|
|
elementFields,
|
2023-08-24 16:58:59 +01:00
|
|
|
std::array<inst::ProcessorInst, 0>{},
|
2024-01-15 16:23:10 +00:00
|
|
|
elementFields[0].is_primitive && elementFields[1].is_primitive,
|
2023-08-24 16:58:59 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
auto list = std::get<ParsedData::List>(d.val);
|
|
|
|
el.container_stats.emplace(result::Element::ContainerStats {
|
|
|
|
.capacity = list.length,
|
|
|
|
.length = list.length,
|
|
|
|
});
|
|
|
|
|
|
|
|
for (size_t i = 0; i < list.length; i++)
|
2023-09-14 16:09:23 +01:00
|
|
|
stack_ins(element);
|
2023-08-24 16:58:59 +01:00
|
|
|
"""
|