Heap.cpp 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219
  1. /*
  2. * Copyright (c) 2021, Jan de Visser <jan@de-visser.net>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <AK/Format.h>
  7. #include <AK/QuickSort.h>
  8. #include <AK/String.h>
  9. #include <LibCore/IODevice.h>
  10. #include <LibSQL/Heap.h>
  11. #include <LibSQL/Serialize.h>
  12. #include <sys/stat.h>
  13. #include <sys/types.h>
  14. namespace SQL {
  15. Heap::Heap(String file_name)
  16. {
  17. set_name(move(file_name));
  18. size_t file_size = 0;
  19. struct stat stat_buffer;
  20. if (stat(name().characters(), &stat_buffer) != 0) {
  21. if (errno != ENOENT) {
  22. perror("stat");
  23. VERIFY_NOT_REACHED();
  24. }
  25. } else {
  26. file_size = stat_buffer.st_size;
  27. }
  28. if (file_size > 0)
  29. m_next_block = m_end_of_file = file_size / BLOCKSIZE;
  30. auto file_or_error = Core::File::open(name(), Core::OpenMode::ReadWrite);
  31. if (file_or_error.is_error()) {
  32. warnln("Couldn't open '{}': {}", name(), file_or_error.error());
  33. VERIFY_NOT_REACHED();
  34. }
  35. m_file = file_or_error.value();
  36. if (file_size > 0)
  37. read_zero_block();
  38. else
  39. initialize_zero_block();
  40. }
  41. Result<ByteBuffer, String> Heap::read_block(u32 block)
  42. {
  43. auto buffer_or_empty = m_write_ahead_log.get(block);
  44. if (buffer_or_empty.has_value())
  45. return buffer_or_empty.value();
  46. VERIFY(block < m_next_block);
  47. dbgln_if(SQL_DEBUG, "Read heap block {}", block);
  48. if (!seek_block(block))
  49. VERIFY_NOT_REACHED();
  50. auto ret = m_file->read(BLOCKSIZE);
  51. if (ret.is_empty())
  52. return String("Could not read block");
  53. return ret;
  54. }
  55. bool Heap::write_block(u32 block, ByteBuffer& buffer)
  56. {
  57. VERIFY(block < m_next_block);
  58. if (!seek_block(block))
  59. VERIFY_NOT_REACHED();
  60. dbgln_if(SQL_DEBUG, "Write heap block {} size {}", block, buffer.size());
  61. VERIFY(buffer.size() <= BLOCKSIZE);
  62. auto sz = buffer.size();
  63. if (sz < BLOCKSIZE) {
  64. buffer.resize(BLOCKSIZE);
  65. memset(buffer.offset_pointer((int)sz), 0, BLOCKSIZE - sz);
  66. }
  67. if (m_file->write(buffer.data(), (int)buffer.size())) {
  68. if (block == m_end_of_file)
  69. m_end_of_file++;
  70. return true;
  71. }
  72. return false;
  73. }
  74. bool Heap::seek_block(u32 block)
  75. {
  76. if (block == m_end_of_file) {
  77. off_t pos;
  78. if (!m_file->seek(0, Core::SeekMode::FromEndPosition, &pos)) {
  79. warnln("Could not seek block {} from file {}, which is at the end of the file", block, name());
  80. warnln("FD: {} Position: {} error: {}", m_file->fd(), pos, m_file->error_string());
  81. return false;
  82. }
  83. } else if (block > m_end_of_file) {
  84. warnln("Seeking block {} of file {} which is beyond the end of the file", block, name());
  85. return false;
  86. } else {
  87. if (!m_file->seek(block * BLOCKSIZE)) {
  88. warnln("Could not seek block {} of file {}. The current size is {} blocks",
  89. block, name(), m_end_of_file);
  90. return false;
  91. }
  92. }
  93. return true;
  94. }
  95. u32 Heap::new_record_pointer()
  96. {
  97. if (m_free_list) {
  98. auto block_or_error = read_block(m_free_list);
  99. if (block_or_error.is_error()) {
  100. warnln("FREE LIST CORRUPTION");
  101. VERIFY_NOT_REACHED();
  102. }
  103. auto new_pointer = m_free_list;
  104. size_t offset = 0;
  105. deserialize_from<u32>(block_or_error.value(), offset, m_free_list);
  106. update_zero_block();
  107. return new_pointer;
  108. }
  109. return m_next_block++;
  110. }
  111. void Heap::flush()
  112. {
  113. Vector<u32> blocks;
  114. for (auto& wal_entry : m_write_ahead_log) {
  115. blocks.append(wal_entry.key);
  116. }
  117. quick_sort(blocks);
  118. for (auto& block : blocks) {
  119. auto buffer_or_empty = m_write_ahead_log.get(block);
  120. if (buffer_or_empty->is_empty()) {
  121. VERIFY_NOT_REACHED();
  122. }
  123. dbgln_if(SQL_DEBUG, "Flushing block {} to {}", block, name());
  124. write_block(block, buffer_or_empty.value());
  125. }
  126. m_write_ahead_log.clear();
  127. }
  128. constexpr static const char* FILE_ID = "SerenitySQL ";
  129. constexpr static int VERSION_OFFSET = 12;
  130. constexpr static int SCHEMAS_ROOT_OFFSET = 16;
  131. constexpr static int TABLES_ROOT_OFFSET = 20;
  132. constexpr static int TABLE_COLUMNS_ROOT_OFFSET = 24;
  133. constexpr static int FREE_LIST_OFFSET = 28;
  134. constexpr static int USER_VALUES_OFFSET = 32;
  135. void Heap::read_zero_block()
  136. {
  137. char file_id[256];
  138. auto bytes_or_error = read_block(0);
  139. if (bytes_or_error.is_error())
  140. VERIFY_NOT_REACHED();
  141. auto buffer = bytes_or_error.value();
  142. memcpy(file_id, buffer.offset_pointer(0), strlen(FILE_ID));
  143. file_id[strlen(FILE_ID)] = 0;
  144. if (strncmp(file_id, FILE_ID, strlen(FILE_ID)) != 0) {
  145. warnln("Corrupt zero page in {}", name());
  146. VERIFY_NOT_REACHED();
  147. }
  148. dbgln_if(SQL_DEBUG, "Read zero block from {}", name());
  149. memcpy(&m_version, buffer.offset_pointer(VERSION_OFFSET), sizeof(u32));
  150. dbgln_if(SQL_DEBUG, "Version: {}.{}", (m_version & 0xFFFF0000) >> 16, (m_version & 0x0000FFFF));
  151. memcpy(&m_schemas_root, buffer.offset_pointer(SCHEMAS_ROOT_OFFSET), sizeof(u32));
  152. dbgln_if(SQL_DEBUG, "Schemas root node: {}", m_tables_root);
  153. memcpy(&m_tables_root, buffer.offset_pointer(TABLES_ROOT_OFFSET), sizeof(u32));
  154. dbgln_if(SQL_DEBUG, "Tables root node: {}", m_tables_root);
  155. memcpy(&m_table_columns_root, buffer.offset_pointer(TABLE_COLUMNS_ROOT_OFFSET), sizeof(u32));
  156. dbgln_if(SQL_DEBUG, "Table columns root node: {}", m_table_columns_root);
  157. memcpy(&m_free_list, buffer.offset_pointer(FREE_LIST_OFFSET), sizeof(u32));
  158. dbgln_if(SQL_DEBUG, "Free list: {}", m_free_list);
  159. memcpy(m_user_values.data(), buffer.offset_pointer(USER_VALUES_OFFSET), m_user_values.size() * sizeof(u32));
  160. for (auto ix = 0u; ix < m_user_values.size(); ix++) {
  161. if (m_user_values[ix]) {
  162. dbgln_if(SQL_DEBUG, "User value {}: {}", ix, m_user_values[ix]);
  163. }
  164. }
  165. }
  166. void Heap::update_zero_block()
  167. {
  168. dbgln_if(SQL_DEBUG, "Write zero block to {}", name());
  169. dbgln_if(SQL_DEBUG, "Version: {}.{}", (m_version & 0xFFFF0000) >> 16, (m_version & 0x0000FFFF));
  170. dbgln_if(SQL_DEBUG, "Schemas root node: {}", m_schemas_root);
  171. dbgln_if(SQL_DEBUG, "Tables root node: {}", m_tables_root);
  172. dbgln_if(SQL_DEBUG, "Table Columns root node: {}", m_table_columns_root);
  173. dbgln_if(SQL_DEBUG, "Free list: {}", m_free_list);
  174. for (auto ix = 0u; ix < m_user_values.size(); ix++) {
  175. if (m_user_values[ix]) {
  176. dbgln_if(SQL_DEBUG, "User value {}: {}", ix, m_user_values[ix]);
  177. }
  178. }
  179. auto buffer = ByteBuffer::create_zeroed(BLOCKSIZE);
  180. buffer.overwrite(0, FILE_ID, strlen(FILE_ID));
  181. buffer.overwrite(VERSION_OFFSET, &m_version, sizeof(u32));
  182. buffer.overwrite(SCHEMAS_ROOT_OFFSET, &m_schemas_root, sizeof(u32));
  183. buffer.overwrite(TABLES_ROOT_OFFSET, &m_tables_root, sizeof(u32));
  184. buffer.overwrite(TABLE_COLUMNS_ROOT_OFFSET, &m_table_columns_root, sizeof(u32));
  185. buffer.overwrite(FREE_LIST_OFFSET, &m_free_list, sizeof(u32));
  186. buffer.overwrite(USER_VALUES_OFFSET, m_user_values.data(), m_user_values.size() * sizeof(u32));
  187. add_to_wal(0, buffer);
  188. }
  189. void Heap::initialize_zero_block()
  190. {
  191. m_version = 0x00000001;
  192. m_schemas_root = 0;
  193. m_tables_root = 0;
  194. m_table_columns_root = 0;
  195. m_next_block = 1;
  196. m_free_list = 0;
  197. for (auto& user : m_user_values) {
  198. user = 0u;
  199. }
  200. update_zero_block();
  201. }
  202. }