Database.cpp 7.7 KB

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