mirror of
https://github.com/RGBCube/serenity
synced 2025-05-22 17:25:07 +00:00
6601ff9d65
Previously, `Heap` would store serialized data in blocks of 1024 bytes regardless of the actual length. Data longer than 1024 bytes was silently truncated causing database corruption. This changes the heap storage to prefix every block with two new fields: the total data size in bytes, and the next block to retrieve if the data is longer than what can be stored inside a single block. By chaining blocks together, we can store arbitrary amounts of data without needing to change anything of the logic in the rest of LibSQL. As part of these changes, the "free list" is also removed from the heap awaiting an actual implementation: it was never used. Note that this bumps the database version from 3 to 4, and as such invalidates (deletes) any database opened with LibSQL that is not version 4.
108 lines
2.4 KiB
C++
108 lines
2.4 KiB
C++
/*
|
|
* Copyright (c) 2021, Jan de Visser <jan@de-visser.net>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#include <LibSQL/BTree.h>
|
|
#include <LibSQL/Meta.h>
|
|
|
|
namespace SQL {
|
|
|
|
BTree::BTree(Serializer& serializer, NonnullRefPtr<TupleDescriptor> const& descriptor, bool unique, u32 pointer)
|
|
: Index(serializer, descriptor, unique, pointer)
|
|
, m_root(nullptr)
|
|
{
|
|
}
|
|
|
|
BTree::BTree(Serializer& serializer, NonnullRefPtr<TupleDescriptor> const& descriptor, u32 pointer)
|
|
: BTree(serializer, descriptor, true, pointer)
|
|
{
|
|
}
|
|
|
|
BTreeIterator BTree::begin()
|
|
{
|
|
if (!m_root)
|
|
initialize_root();
|
|
VERIFY(m_root);
|
|
return BTreeIterator(m_root, -1);
|
|
}
|
|
|
|
BTreeIterator BTree::end()
|
|
{
|
|
return BTreeIterator(nullptr, -1);
|
|
}
|
|
|
|
void BTree::initialize_root()
|
|
{
|
|
if (pointer()) {
|
|
if (serializer().has_block(pointer())) {
|
|
serializer().read_storage(pointer());
|
|
m_root = serializer().make_and_deserialize<TreeNode>(*this, pointer());
|
|
} else {
|
|
m_root = make<TreeNode>(*this, nullptr, pointer());
|
|
}
|
|
} else {
|
|
set_pointer(request_new_block_index());
|
|
m_root = make<TreeNode>(*this, nullptr, pointer());
|
|
if (on_new_root)
|
|
on_new_root();
|
|
}
|
|
m_root->dump_if(0, "initialize_root");
|
|
}
|
|
|
|
TreeNode* BTree::new_root()
|
|
{
|
|
set_pointer(request_new_block_index());
|
|
m_root = make<TreeNode>(*this, nullptr, m_root.leak_ptr(), pointer());
|
|
serializer().serialize_and_write(*m_root.ptr());
|
|
if (on_new_root)
|
|
on_new_root();
|
|
return m_root;
|
|
}
|
|
|
|
bool BTree::insert(Key const& key)
|
|
{
|
|
if (!m_root)
|
|
initialize_root();
|
|
return m_root->insert(key);
|
|
}
|
|
|
|
bool BTree::update_key_pointer(Key const& key)
|
|
{
|
|
if (!m_root)
|
|
initialize_root();
|
|
return m_root->update_key_pointer(key);
|
|
}
|
|
|
|
Optional<u32> BTree::get(Key& key)
|
|
{
|
|
if (!m_root)
|
|
initialize_root();
|
|
return m_root->get(key);
|
|
}
|
|
|
|
BTreeIterator BTree::find(Key const& key)
|
|
{
|
|
if (!m_root)
|
|
initialize_root();
|
|
for (auto node = m_root->node_for(key); node; node = node->up()) {
|
|
for (auto ix = 0u; ix < node->size(); ix++) {
|
|
auto match = (*node)[ix].match(key);
|
|
if (match == 0)
|
|
return BTreeIterator(node, (int)ix);
|
|
else if (match > 0)
|
|
return end();
|
|
}
|
|
}
|
|
return end();
|
|
}
|
|
|
|
void BTree::list_tree()
|
|
{
|
|
if (!m_root)
|
|
initialize_root();
|
|
m_root->list_node(0);
|
|
}
|
|
|
|
}
|