BlockBasedFileSystem.cpp 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309
  1. /*
  2. * Copyright (c) 2018-2022, Andreas Kling <kling@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <AK/IntrusiveList.h>
  7. #include <Kernel/Debug.h>
  8. #include <Kernel/FileSystem/BlockBasedFileSystem.h>
  9. #include <Kernel/Process.h>
  10. namespace Kernel {
  11. struct CacheEntry {
  12. IntrusiveListNode<CacheEntry> list_node;
  13. BlockBasedFileSystem::BlockIndex block_index { 0 };
  14. u8* data { nullptr };
  15. bool has_data { false };
  16. };
  17. class DiskCache {
  18. public:
  19. static constexpr size_t EntryCount = 10000;
  20. explicit DiskCache(BlockBasedFileSystem& fs, NonnullOwnPtr<KBuffer> cached_block_data, NonnullOwnPtr<KBuffer> entries_buffer)
  21. : m_fs(fs)
  22. , m_cached_block_data(move(cached_block_data))
  23. , m_entries(move(entries_buffer))
  24. {
  25. for (size_t i = 0; i < EntryCount; ++i) {
  26. entries()[i].data = m_cached_block_data->data() + i * m_fs->block_size();
  27. m_clean_list.append(entries()[i]);
  28. }
  29. }
  30. ~DiskCache() = default;
  31. bool is_dirty() const { return !m_dirty_list.is_empty(); }
  32. bool entry_is_dirty(CacheEntry const& entry) const { return m_dirty_list.contains(entry); }
  33. void mark_all_clean()
  34. {
  35. while (auto* entry = m_dirty_list.first())
  36. m_clean_list.prepend(*entry);
  37. }
  38. void mark_dirty(CacheEntry& entry)
  39. {
  40. m_dirty_list.prepend(entry);
  41. }
  42. void mark_clean(CacheEntry& entry)
  43. {
  44. m_clean_list.prepend(entry);
  45. }
  46. CacheEntry* get(BlockBasedFileSystem::BlockIndex block_index) const
  47. {
  48. auto it = m_hash.find(block_index);
  49. if (it == m_hash.end())
  50. return nullptr;
  51. auto& entry = const_cast<CacheEntry&>(*it->value);
  52. VERIFY(entry.block_index == block_index);
  53. return &entry;
  54. }
  55. ErrorOr<CacheEntry*> ensure(BlockBasedFileSystem::BlockIndex block_index) const
  56. {
  57. if (auto* entry = get(block_index))
  58. return entry;
  59. if (m_clean_list.is_empty()) {
  60. // Not a single clean entry! Flush writes and try again.
  61. // NOTE: We want to make sure we only call FileBackedFileSystem flush here,
  62. // not some FileBackedFileSystem subclass flush!
  63. m_fs->flush_writes_impl();
  64. return ensure(block_index);
  65. }
  66. VERIFY(m_clean_list.last());
  67. auto& new_entry = *m_clean_list.last();
  68. m_clean_list.prepend(new_entry);
  69. m_hash.remove(new_entry.block_index);
  70. TRY(m_hash.try_set(block_index, &new_entry));
  71. new_entry.block_index = block_index;
  72. new_entry.has_data = false;
  73. return &new_entry;
  74. }
  75. CacheEntry const* entries() const { return (CacheEntry const*)m_entries->data(); }
  76. CacheEntry* entries() { return (CacheEntry*)m_entries->data(); }
  77. template<typename Callback>
  78. void for_each_dirty_entry(Callback callback)
  79. {
  80. for (auto& entry : m_dirty_list)
  81. callback(entry);
  82. }
  83. private:
  84. mutable NonnullRefPtr<BlockBasedFileSystem> m_fs;
  85. NonnullOwnPtr<KBuffer> m_cached_block_data;
  86. // NOTE: m_entries must be declared before m_dirty_list and m_clean_list because their entries are allocated from it.
  87. // We need to ensure that the destructors of m_dirty_list and m_clean_list are called before m_entries is destroyed.
  88. NonnullOwnPtr<KBuffer> m_entries;
  89. mutable IntrusiveList<&CacheEntry::list_node> m_dirty_list;
  90. mutable IntrusiveList<&CacheEntry::list_node> m_clean_list;
  91. mutable HashMap<BlockBasedFileSystem::BlockIndex, CacheEntry*> m_hash;
  92. };
  93. BlockBasedFileSystem::BlockBasedFileSystem(OpenFileDescription& file_description)
  94. : FileBackedFileSystem(file_description)
  95. {
  96. VERIFY(file_description.file().is_seekable());
  97. }
  98. BlockBasedFileSystem::~BlockBasedFileSystem() = default;
  99. void BlockBasedFileSystem::remove_disk_cache_before_last_unmount()
  100. {
  101. VERIFY(m_lock.is_locked());
  102. m_cache.with_exclusive([&](auto& cache) {
  103. cache.clear();
  104. });
  105. }
  106. ErrorOr<void> BlockBasedFileSystem::initialize_while_locked()
  107. {
  108. VERIFY(m_lock.is_locked());
  109. VERIFY(!is_initialized_while_locked());
  110. VERIFY(block_size() != 0);
  111. auto cached_block_data = TRY(KBuffer::try_create_with_size("BlockBasedFS: Cache blocks"sv, DiskCache::EntryCount * block_size()));
  112. auto entries_data = TRY(KBuffer::try_create_with_size("BlockBasedFS: Cache entries"sv, DiskCache::EntryCount * sizeof(CacheEntry)));
  113. auto disk_cache = TRY(adopt_nonnull_own_or_enomem(new (nothrow) DiskCache(*this, move(cached_block_data), move(entries_data))));
  114. m_cache.with_exclusive([&](auto& cache) {
  115. cache = move(disk_cache);
  116. });
  117. return {};
  118. }
  119. ErrorOr<void> BlockBasedFileSystem::write_block(BlockIndex index, UserOrKernelBuffer const& data, size_t count, u64 offset, bool allow_cache)
  120. {
  121. VERIFY(m_logical_block_size);
  122. VERIFY(offset + count <= block_size());
  123. dbgln_if(BBFS_DEBUG, "BlockBasedFileSystem::write_block {}, size={}", index, count);
  124. // NOTE: We copy the `data` to write into a local buffer before taking the cache lock.
  125. // This makes sure any page faults caused by accessing the data will occur before
  126. // we tie down the cache.
  127. auto buffered_data = TRY(ByteBuffer::create_uninitialized(count));
  128. TRY(data.read(buffered_data.bytes()));
  129. return m_cache.with_exclusive([&](auto& cache) -> ErrorOr<void> {
  130. if (!allow_cache) {
  131. flush_specific_block_if_needed(index);
  132. u64 base_offset = index.value() * block_size() + offset;
  133. auto nwritten = TRY(file_description().write(base_offset, data, count));
  134. VERIFY(nwritten == count);
  135. return {};
  136. }
  137. auto entry = TRY(cache->ensure(index));
  138. if (count < block_size()) {
  139. // Fill the cache first.
  140. TRY(read_block(index, nullptr, block_size()));
  141. }
  142. memcpy(entry->data + offset, buffered_data.data(), count);
  143. cache->mark_dirty(*entry);
  144. entry->has_data = true;
  145. return {};
  146. });
  147. }
  148. ErrorOr<void> BlockBasedFileSystem::raw_read(BlockIndex index, UserOrKernelBuffer& buffer)
  149. {
  150. auto base_offset = index.value() * m_logical_block_size;
  151. auto nread = TRY(file_description().read(buffer, base_offset, m_logical_block_size));
  152. VERIFY(nread == m_logical_block_size);
  153. return {};
  154. }
  155. ErrorOr<void> BlockBasedFileSystem::raw_write(BlockIndex index, UserOrKernelBuffer const& buffer)
  156. {
  157. auto base_offset = index.value() * m_logical_block_size;
  158. auto nwritten = TRY(file_description().write(base_offset, buffer, m_logical_block_size));
  159. VERIFY(nwritten == m_logical_block_size);
  160. return {};
  161. }
  162. ErrorOr<void> BlockBasedFileSystem::raw_read_blocks(BlockIndex index, size_t count, UserOrKernelBuffer& buffer)
  163. {
  164. auto current = buffer;
  165. for (auto block = index.value(); block < (index.value() + count); block++) {
  166. TRY(raw_read(BlockIndex { block }, current));
  167. current = current.offset(logical_block_size());
  168. }
  169. return {};
  170. }
  171. ErrorOr<void> BlockBasedFileSystem::raw_write_blocks(BlockIndex index, size_t count, UserOrKernelBuffer const& buffer)
  172. {
  173. auto current = buffer;
  174. for (auto block = index.value(); block < (index.value() + count); block++) {
  175. TRY(raw_write(block, current));
  176. current = current.offset(logical_block_size());
  177. }
  178. return {};
  179. }
  180. ErrorOr<void> BlockBasedFileSystem::write_blocks(BlockIndex index, unsigned count, UserOrKernelBuffer const& data, bool allow_cache)
  181. {
  182. VERIFY(m_logical_block_size);
  183. dbgln_if(BBFS_DEBUG, "BlockBasedFileSystem::write_blocks {}, count={}", index, count);
  184. for (unsigned i = 0; i < count; ++i) {
  185. TRY(write_block(BlockIndex { index.value() + i }, data.offset(i * block_size()), block_size(), 0, allow_cache));
  186. }
  187. return {};
  188. }
  189. ErrorOr<void> BlockBasedFileSystem::read_block(BlockIndex index, UserOrKernelBuffer* buffer, size_t count, u64 offset, bool allow_cache) const
  190. {
  191. VERIFY(m_logical_block_size);
  192. VERIFY(offset + count <= block_size());
  193. dbgln_if(BBFS_DEBUG, "BlockBasedFileSystem::read_block {}", index);
  194. return m_cache.with_exclusive([&](auto& cache) -> ErrorOr<void> {
  195. if (!allow_cache) {
  196. const_cast<BlockBasedFileSystem*>(this)->flush_specific_block_if_needed(index);
  197. u64 base_offset = index.value() * block_size() + offset;
  198. auto nread = TRY(file_description().read(*buffer, base_offset, count));
  199. VERIFY(nread == count);
  200. return {};
  201. }
  202. auto* entry = TRY(cache->ensure(index));
  203. if (!entry->has_data) {
  204. auto base_offset = index.value() * block_size();
  205. auto entry_data_buffer = UserOrKernelBuffer::for_kernel_buffer(entry->data);
  206. auto nread = TRY(file_description().read(entry_data_buffer, base_offset, block_size()));
  207. VERIFY(nread == block_size());
  208. entry->has_data = true;
  209. }
  210. if (buffer)
  211. TRY(buffer->write(entry->data + offset, count));
  212. return {};
  213. });
  214. }
  215. ErrorOr<void> BlockBasedFileSystem::read_blocks(BlockIndex index, unsigned count, UserOrKernelBuffer& buffer, bool allow_cache) const
  216. {
  217. VERIFY(m_logical_block_size);
  218. if (!count)
  219. return EINVAL;
  220. if (count == 1)
  221. return read_block(index, &buffer, block_size(), 0, allow_cache);
  222. auto out = buffer;
  223. for (unsigned i = 0; i < count; ++i) {
  224. TRY(read_block(BlockIndex { index.value() + i }, &out, block_size(), 0, allow_cache));
  225. out = out.offset(block_size());
  226. }
  227. return {};
  228. }
  229. void BlockBasedFileSystem::flush_specific_block_if_needed(BlockIndex index)
  230. {
  231. m_cache.with_exclusive([&](auto& cache) {
  232. if (!cache->is_dirty())
  233. return;
  234. auto* entry = cache->get(index);
  235. if (!entry)
  236. return;
  237. if (!cache->entry_is_dirty(*entry))
  238. return;
  239. size_t base_offset = entry->block_index.value() * block_size();
  240. auto entry_data_buffer = UserOrKernelBuffer::for_kernel_buffer(entry->data);
  241. (void)file_description().write(base_offset, entry_data_buffer, block_size());
  242. });
  243. }
  244. void BlockBasedFileSystem::flush_writes_impl()
  245. {
  246. size_t count = 0;
  247. m_cache.with_exclusive([&](auto& cache) {
  248. if (!cache->is_dirty())
  249. return;
  250. cache->for_each_dirty_entry([&](CacheEntry& entry) {
  251. auto base_offset = entry.block_index.value() * block_size();
  252. auto entry_data_buffer = UserOrKernelBuffer::for_kernel_buffer(entry.data);
  253. [[maybe_unused]] auto rc = file_description().write(base_offset, entry_data_buffer, block_size());
  254. ++count;
  255. });
  256. cache->mark_all_clean();
  257. dbgln("{}: Flushed {} blocks to disk", class_name(), count);
  258. });
  259. }
  260. void BlockBasedFileSystem::flush_writes()
  261. {
  262. flush_writes_impl();
  263. }
  264. }