1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
|
/*
* Copyright (c) 2021, Jan de Visser <jan@de-visser.net>
* Copyright (c) 2021, Mahmoud Mandour <ma.mandourr@gmail.com>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#include <AK/Format.h>
#include <AK/RefPtr.h>
#include <AK/String.h>
#include <LibSQL/BTree.h>
#include <LibSQL/Database.h>
#include <LibSQL/Heap.h>
#include <LibSQL/Meta.h>
#include <LibSQL/Row.h>
#include <LibSQL/Tuple.h>
namespace SQL {
Database::Database(String name)
: m_heap(Heap::construct(move(name)))
, m_serializer(m_heap)
{
}
ErrorOr<void> Database::open()
{
TRY(m_heap->open());
m_schemas = BTree::construct(m_serializer, SchemaDef::index_def()->to_tuple_descriptor(), m_heap->schemas_root());
m_schemas->on_new_root = [&]() {
m_heap->set_schemas_root(m_schemas->root());
};
m_tables = BTree::construct(m_serializer, TableDef::index_def()->to_tuple_descriptor(), m_heap->tables_root());
m_tables->on_new_root = [&]() {
m_heap->set_tables_root(m_tables->root());
};
m_table_columns = BTree::construct(m_serializer, ColumnDef::index_def()->to_tuple_descriptor(), m_heap->table_columns_root());
m_table_columns->on_new_root = [&]() {
m_heap->set_table_columns_root(m_table_columns->root());
};
m_open = true;
auto default_schema = TRY(get_schema("default"));
if (!default_schema) {
default_schema = SchemaDef::construct("default");
TRY(add_schema(*default_schema));
}
auto master_schema = TRY(get_schema("master"));
if (!master_schema) {
master_schema = SchemaDef::construct("master");
TRY(add_schema(*master_schema));
}
auto table_def = TRY(get_table("master", "internal_describe_table"));
if (!table_def) {
auto describe_internal_table = TableDef::construct(master_schema, "internal_describe_table");
describe_internal_table->append_column("Name", SQLType::Text);
describe_internal_table->append_column("Type", SQLType::Text);
TRY(add_table(*describe_internal_table));
}
return {};
}
Database::~Database()
{
// This crashes if the database can't commit. It's recommended to commit
// before the Database goes out of scope so the application can handle
// errors.
// Maybe we should enforce that by having a VERIFY here that there are no
// pending writes. But that's a new API on Heap so let's not do that right
// now.
if (is_open())
MUST(commit());
}
ErrorOr<void> Database::commit()
{
VERIFY(is_open());
TRY(m_heap->flush());
return {};
}
ErrorOr<void> Database::add_schema(SchemaDef const& schema)
{
VERIFY(is_open());
if (!m_schemas->insert(schema.key())) {
warnln("Duplicate schema name {}"sv, schema.name());
return Error::from_string_literal("Duplicate schema name");
}
return {};
}
Key Database::get_schema_key(String const& schema_name)
{
auto key = SchemaDef::make_key();
key["schema_name"] = schema_name;
return key;
}
ErrorOr<RefPtr<SchemaDef>> Database::get_schema(String const& schema)
{
VERIFY(is_open());
auto schema_name = schema;
if (schema.is_null() || schema.is_empty())
schema_name = "default";
Key key = get_schema_key(schema_name);
auto schema_def_opt = m_schema_cache.get(key.hash());
if (schema_def_opt.has_value()) {
return RefPtr<SchemaDef>(schema_def_opt.value());
}
auto schema_iterator = m_schemas->find(key);
if (schema_iterator.is_end() || (*schema_iterator != key)) {
return RefPtr<SchemaDef>(nullptr);
}
auto ret = SchemaDef::construct(*schema_iterator);
m_schema_cache.set(key.hash(), ret);
return RefPtr<SchemaDef>(ret);
}
ErrorOr<void> Database::add_table(TableDef& table)
{
VERIFY(is_open());
if (!m_tables->insert(table.key())) {
warnln("Duplicate table name '{}'.'{}'"sv, table.parent()->name(), table.name());
return Error::from_string_literal("Duplicate table name");
}
for (auto& column : table.columns()) {
VERIFY(m_table_columns->insert(column.key()));
}
return {};
}
Key Database::get_table_key(String const& schema_name, String const& table_name)
{
auto key = TableDef::make_key(get_schema_key(schema_name));
key["table_name"] = table_name;
return key;
}
ErrorOr<RefPtr<TableDef>> Database::get_table(String const& schema, String const& name)
{
VERIFY(is_open());
auto schema_name = schema;
if (schema.is_null() || schema.is_empty())
schema_name = "default";
Key key = get_table_key(schema_name, name);
auto table_def_opt = m_table_cache.get(key.hash());
if (table_def_opt.has_value())
return RefPtr<TableDef>(table_def_opt.value());
auto table_iterator = m_tables->find(key);
if (table_iterator.is_end() || (*table_iterator != key)) {
return RefPtr<TableDef>(nullptr);
}
auto schema_def = TRY(get_schema(schema));
if (!schema_def) {
warnln("Schema '{}' does not exist"sv, schema);
return Error::from_string_literal("Schema does not exist");
}
auto ret = TableDef::construct(schema_def, name);
ret->set_pointer((*table_iterator).pointer());
m_table_cache.set(key.hash(), ret);
auto hash = ret->hash();
auto column_key = ColumnDef::make_key(ret);
for (auto column_iterator = m_table_columns->find(column_key);
!column_iterator.is_end() && ((*column_iterator)["table_hash"].to_u32().value() == hash);
column_iterator++) {
ret->append_column(*column_iterator);
}
return RefPtr<TableDef>(ret);
}
ErrorOr<Vector<Row>> Database::select_all(TableDef const& table)
{
VERIFY(m_table_cache.get(table.key().hash()).has_value());
Vector<Row> ret;
for (auto pointer = table.pointer(); pointer; pointer = ret.last().next_pointer()) {
ret.append(m_serializer.deserialize_block<Row>(pointer, table, pointer));
}
return ret;
}
ErrorOr<Vector<Row>> Database::match(TableDef const& table, Key const& key)
{
VERIFY(m_table_cache.get(table.key().hash()).has_value());
Vector<Row> ret;
// TODO Match key against indexes defined on table. If found,
// use the index instead of scanning the table.
for (auto pointer = table.pointer(); pointer;) {
auto row = m_serializer.deserialize_block<Row>(pointer, table, pointer);
if (row.match(key))
ret.append(row);
pointer = ret.last().next_pointer();
}
return ret;
}
ErrorOr<void> Database::insert(Row& row)
{
VERIFY(m_table_cache.get(row.table()->key().hash()).has_value());
// TODO Check constraints
row.set_pointer(m_heap->new_record_pointer());
row.next_pointer(row.table()->pointer());
TRY(update(row));
// TODO update indexes defined on table.
auto table_key = row.table()->key();
table_key.set_pointer(row.pointer());
VERIFY(m_tables->update_key_pointer(table_key));
row.table()->set_pointer(row.pointer());
return {};
}
ErrorOr<void> Database::update(Row& tuple)
{
VERIFY(m_table_cache.get(tuple.table()->key().hash()).has_value());
// TODO Check constraints
m_serializer.reset();
m_serializer.serialize_and_write<Tuple>(tuple, tuple.pointer());
// TODO update indexes defined on table.
return {};
}
}
|
