Database.cpp 7.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258
  1. /*
  2. * Copyright (c) 2021, Jan de Visser <jan@de-visser.net>
  3. * Copyright (c) 2021, Mahmoud Mandour <ma.mandourr@gmail.com>
  4. *
  5. * SPDX-License-Identifier: BSD-2-Clause
  6. */
  7. #include <AK/DeprecatedString.h>
  8. #include <AK/Format.h>
  9. #include <AK/RefPtr.h>
  10. #include <LibSQL/BTree.h>
  11. #include <LibSQL/Database.h>
  12. #include <LibSQL/Heap.h>
  13. #include <LibSQL/Meta.h>
  14. #include <LibSQL/Row.h>
  15. #include <LibSQL/Tuple.h>
  16. namespace SQL {
  17. Database::Database(DeprecatedString name)
  18. : m_heap(Heap::construct(move(name)))
  19. , m_serializer(m_heap)
  20. {
  21. }
  22. ResultOr<void> Database::open()
  23. {
  24. TRY(m_heap->open());
  25. m_schemas = BTree::construct(m_serializer, SchemaDef::index_def()->to_tuple_descriptor(), m_heap->schemas_root());
  26. m_schemas->on_new_root = [&]() {
  27. m_heap->set_schemas_root(m_schemas->root());
  28. };
  29. m_tables = BTree::construct(m_serializer, TableDef::index_def()->to_tuple_descriptor(), m_heap->tables_root());
  30. m_tables->on_new_root = [&]() {
  31. m_heap->set_tables_root(m_tables->root());
  32. };
  33. m_table_columns = BTree::construct(m_serializer, ColumnDef::index_def()->to_tuple_descriptor(), m_heap->table_columns_root());
  34. m_table_columns->on_new_root = [&]() {
  35. m_heap->set_table_columns_root(m_table_columns->root());
  36. };
  37. m_open = true;
  38. auto ensure_schema_exists = [&](auto schema_name) -> ResultOr<NonnullRefPtr<SchemaDef>> {
  39. if (auto result = get_schema(schema_name); result.is_error()) {
  40. if (result.error().error() != SQLErrorCode::SchemaDoesNotExist)
  41. return result.release_error();
  42. auto schema_def = SchemaDef::construct(schema_name);
  43. TRY(add_schema(*schema_def));
  44. return schema_def;
  45. } else {
  46. return result.release_value();
  47. }
  48. };
  49. (void)TRY(ensure_schema_exists("default"sv));
  50. auto master_schema = TRY(ensure_schema_exists("master"sv));
  51. if (auto result = get_table("master"sv, "internal_describe_table"sv); result.is_error()) {
  52. if (result.error().error() != SQLErrorCode::TableDoesNotExist)
  53. return result.release_error();
  54. auto internal_describe_table = TableDef::construct(master_schema, "internal_describe_table");
  55. internal_describe_table->append_column("Name", SQLType::Text);
  56. internal_describe_table->append_column("Type", SQLType::Text);
  57. TRY(add_table(*internal_describe_table));
  58. }
  59. return {};
  60. }
  61. Database::~Database() = default;
  62. ErrorOr<void> Database::commit()
  63. {
  64. VERIFY(is_open());
  65. TRY(m_heap->flush());
  66. return {};
  67. }
  68. ResultOr<void> Database::add_schema(SchemaDef const& schema)
  69. {
  70. VERIFY(is_open());
  71. if (!m_schemas->insert(schema.key()))
  72. return Result { SQLCommand::Unknown, SQLErrorCode::SchemaExists, schema.name() };
  73. return {};
  74. }
  75. Key Database::get_schema_key(DeprecatedString const& schema_name)
  76. {
  77. auto key = SchemaDef::make_key();
  78. key["schema_name"] = schema_name;
  79. return key;
  80. }
  81. ResultOr<NonnullRefPtr<SchemaDef>> Database::get_schema(DeprecatedString const& schema)
  82. {
  83. VERIFY(is_open());
  84. auto schema_name = schema;
  85. if (schema.is_empty())
  86. schema_name = "default"sv;
  87. Key key = get_schema_key(schema_name);
  88. if (auto it = m_schema_cache.find(key.hash()); it != m_schema_cache.end())
  89. return it->value;
  90. auto schema_iterator = m_schemas->find(key);
  91. if (schema_iterator.is_end() || (*schema_iterator != key))
  92. return Result { SQLCommand::Unknown, SQLErrorCode::SchemaDoesNotExist, schema_name };
  93. auto schema_def = SchemaDef::construct(*schema_iterator);
  94. m_schema_cache.set(key.hash(), schema_def);
  95. return schema_def;
  96. }
  97. ResultOr<void> Database::add_table(TableDef& table)
  98. {
  99. VERIFY(is_open());
  100. if (!m_tables->insert(table.key()))
  101. return Result { SQLCommand::Unknown, SQLErrorCode::TableExists, table.name() };
  102. for (auto& column : table.columns()) {
  103. if (!m_table_columns->insert(column.key()))
  104. VERIFY_NOT_REACHED();
  105. }
  106. return {};
  107. }
  108. Key Database::get_table_key(DeprecatedString const& schema_name, DeprecatedString const& table_name)
  109. {
  110. auto key = TableDef::make_key(get_schema_key(schema_name));
  111. key["table_name"] = table_name;
  112. return key;
  113. }
  114. ResultOr<NonnullRefPtr<TableDef>> Database::get_table(DeprecatedString const& schema, DeprecatedString const& name)
  115. {
  116. VERIFY(is_open());
  117. auto schema_name = schema;
  118. if (schema.is_empty())
  119. schema_name = "default"sv;
  120. Key key = get_table_key(schema_name, name);
  121. if (auto it = m_table_cache.find(key.hash()); it != m_table_cache.end())
  122. return it->value;
  123. auto table_iterator = m_tables->find(key);
  124. if (table_iterator.is_end() || (*table_iterator != key))
  125. return Result { SQLCommand::Unknown, SQLErrorCode::TableDoesNotExist, DeprecatedString::formatted("{}.{}", schema_name, name) };
  126. auto schema_def = TRY(get_schema(schema));
  127. auto table_def = TableDef::construct(schema_def, name);
  128. table_def->set_pointer((*table_iterator).pointer());
  129. m_table_cache.set(key.hash(), table_def);
  130. auto table_hash = table_def->hash();
  131. auto column_key = ColumnDef::make_key(table_def);
  132. for (auto it = m_table_columns->find(column_key); !it.is_end() && ((*it)["table_hash"].to_u32().value() == table_hash); ++it)
  133. table_def->append_column(*it);
  134. return table_def;
  135. }
  136. ErrorOr<Vector<Row>> Database::select_all(TableDef const& table)
  137. {
  138. VERIFY(m_table_cache.get(table.key().hash()).has_value());
  139. Vector<Row> ret;
  140. for (auto pointer = table.pointer(); pointer; pointer = ret.last().next_pointer()) {
  141. ret.append(m_serializer.deserialize_block<Row>(pointer, table, pointer));
  142. }
  143. return ret;
  144. }
  145. ErrorOr<Vector<Row>> Database::match(TableDef const& table, Key const& key)
  146. {
  147. VERIFY(m_table_cache.get(table.key().hash()).has_value());
  148. Vector<Row> ret;
  149. // TODO Match key against indexes defined on table. If found,
  150. // use the index instead of scanning the table.
  151. for (auto pointer = table.pointer(); pointer;) {
  152. auto row = m_serializer.deserialize_block<Row>(pointer, table, pointer);
  153. if (row.match(key))
  154. ret.append(row);
  155. pointer = ret.last().next_pointer();
  156. }
  157. return ret;
  158. }
  159. ErrorOr<void> Database::insert(Row& row)
  160. {
  161. VERIFY(m_table_cache.get(row.table().key().hash()).has_value());
  162. // TODO Check constraints
  163. row.set_pointer(m_heap->new_record_pointer());
  164. row.set_next_pointer(row.table().pointer());
  165. TRY(update(row));
  166. // TODO update indexes defined on table.
  167. auto table_key = row.table().key();
  168. table_key.set_pointer(row.pointer());
  169. VERIFY(m_tables->update_key_pointer(table_key));
  170. row.table().set_pointer(row.pointer());
  171. return {};
  172. }
  173. ErrorOr<void> Database::remove(Row& row)
  174. {
  175. auto& table = row.table();
  176. VERIFY(m_table_cache.get(table.key().hash()).has_value());
  177. if (table.pointer() == row.pointer()) {
  178. auto table_key = table.key();
  179. table_key.set_pointer(row.next_pointer());
  180. m_tables->update_key_pointer(table_key);
  181. table.set_pointer(row.next_pointer());
  182. return {};
  183. }
  184. for (auto pointer = table.pointer(); pointer;) {
  185. auto current = m_serializer.deserialize_block<Row>(pointer, table, pointer);
  186. if (current.next_pointer() == row.pointer()) {
  187. current.set_next_pointer(row.next_pointer());
  188. TRY(update(current));
  189. break;
  190. }
  191. pointer = current.next_pointer();
  192. }
  193. return {};
  194. }
  195. ErrorOr<void> Database::update(Row& tuple)
  196. {
  197. VERIFY(m_table_cache.get(tuple.table().key().hash()).has_value());
  198. // TODO Check constraints
  199. m_serializer.reset();
  200. m_serializer.serialize_and_write<Tuple>(tuple);
  201. // TODO update indexes defined on table.
  202. return {};
  203. }
  204. }