BlockBasedFileSystem.cpp 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298
  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. const CacheEntry* entries() const { return (const CacheEntry*)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. BlockBasedFileSystem& m_fs;
  85. mutable HashMap<BlockBasedFileSystem::BlockIndex, CacheEntry*> m_hash;
  86. mutable IntrusiveList<&CacheEntry::list_node> m_clean_list;
  87. mutable IntrusiveList<&CacheEntry::list_node> m_dirty_list;
  88. NonnullOwnPtr<KBuffer> m_cached_block_data;
  89. NonnullOwnPtr<KBuffer> m_entries;
  90. };
  91. BlockBasedFileSystem::BlockBasedFileSystem(OpenFileDescription& file_description)
  92. : FileBackedFileSystem(file_description)
  93. {
  94. VERIFY(file_description.file().is_seekable());
  95. }
  96. BlockBasedFileSystem::~BlockBasedFileSystem()
  97. {
  98. }
  99. ErrorOr<void> BlockBasedFileSystem::initialize()
  100. {
  101. VERIFY(block_size() != 0);
  102. auto cached_block_data = TRY(KBuffer::try_create_with_size(DiskCache::EntryCount * block_size()));
  103. auto entries_data = TRY(KBuffer::try_create_with_size(DiskCache::EntryCount * sizeof(CacheEntry)));
  104. auto disk_cache = TRY(adopt_nonnull_own_or_enomem(new (nothrow) DiskCache(*this, move(cached_block_data), move(entries_data))));
  105. m_cache.with_exclusive([&](auto& cache) {
  106. cache = move(disk_cache);
  107. });
  108. return {};
  109. }
  110. ErrorOr<void> BlockBasedFileSystem::write_block(BlockIndex index, const UserOrKernelBuffer& data, size_t count, u64 offset, bool allow_cache)
  111. {
  112. VERIFY(m_logical_block_size);
  113. VERIFY(offset + count <= block_size());
  114. dbgln_if(BBFS_DEBUG, "BlockBasedFileSystem::write_block {}, size={}", index, count);
  115. // NOTE: We copy the `data` to write into a local buffer before taking the cache lock.
  116. // This makes sure any page faults caused by accessing the data will occur before
  117. // we tie down the cache.
  118. auto buffered_data = TRY(ByteBuffer::create_uninitialized(count));
  119. TRY(data.read(buffered_data.bytes()));
  120. return m_cache.with_exclusive([&](auto& cache) -> ErrorOr<void> {
  121. if (!allow_cache) {
  122. flush_specific_block_if_needed(index);
  123. u64 base_offset = index.value() * block_size() + offset;
  124. auto nwritten = TRY(file_description().write(base_offset, data, count));
  125. VERIFY(nwritten == count);
  126. return {};
  127. }
  128. auto entry = TRY(cache->ensure(index));
  129. if (count < block_size()) {
  130. // Fill the cache first.
  131. TRY(read_block(index, nullptr, block_size()));
  132. }
  133. memcpy(entry->data + offset, buffered_data.data(), count);
  134. cache->mark_dirty(*entry);
  135. entry->has_data = true;
  136. return {};
  137. });
  138. }
  139. ErrorOr<void> BlockBasedFileSystem::raw_read(BlockIndex index, UserOrKernelBuffer& buffer)
  140. {
  141. auto base_offset = index.value() * m_logical_block_size;
  142. auto nread = TRY(file_description().read(buffer, base_offset, m_logical_block_size));
  143. VERIFY(nread == m_logical_block_size);
  144. return {};
  145. }
  146. ErrorOr<void> BlockBasedFileSystem::raw_write(BlockIndex index, const UserOrKernelBuffer& buffer)
  147. {
  148. auto base_offset = index.value() * m_logical_block_size;
  149. auto nwritten = TRY(file_description().write(base_offset, buffer, m_logical_block_size));
  150. VERIFY(nwritten == m_logical_block_size);
  151. return {};
  152. }
  153. ErrorOr<void> BlockBasedFileSystem::raw_read_blocks(BlockIndex index, size_t count, UserOrKernelBuffer& buffer)
  154. {
  155. auto current = buffer;
  156. for (auto block = index.value(); block < (index.value() + count); block++) {
  157. TRY(raw_read(BlockIndex { block }, current));
  158. current = current.offset(logical_block_size());
  159. }
  160. return {};
  161. }
  162. ErrorOr<void> BlockBasedFileSystem::raw_write_blocks(BlockIndex index, size_t count, const UserOrKernelBuffer& buffer)
  163. {
  164. auto current = buffer;
  165. for (auto block = index.value(); block < (index.value() + count); block++) {
  166. TRY(raw_write(block, current));
  167. current = current.offset(logical_block_size());
  168. }
  169. return {};
  170. }
  171. ErrorOr<void> BlockBasedFileSystem::write_blocks(BlockIndex index, unsigned count, const UserOrKernelBuffer& data, bool allow_cache)
  172. {
  173. VERIFY(m_logical_block_size);
  174. dbgln_if(BBFS_DEBUG, "BlockBasedFileSystem::write_blocks {}, count={}", index, count);
  175. for (unsigned i = 0; i < count; ++i) {
  176. TRY(write_block(BlockIndex { index.value() + i }, data.offset(i * block_size()), block_size(), 0, allow_cache));
  177. }
  178. return {};
  179. }
  180. ErrorOr<void> BlockBasedFileSystem::read_block(BlockIndex index, UserOrKernelBuffer* buffer, size_t count, size_t offset, bool allow_cache) const
  181. {
  182. VERIFY(m_logical_block_size);
  183. VERIFY(offset + count <= block_size());
  184. dbgln_if(BBFS_DEBUG, "BlockBasedFileSystem::read_block {}", index);
  185. return m_cache.with_exclusive([&](auto& cache) -> ErrorOr<void> {
  186. if (!allow_cache) {
  187. const_cast<BlockBasedFileSystem*>(this)->flush_specific_block_if_needed(index);
  188. auto base_offset = index.value() * block_size() + offset;
  189. auto nread = TRY(file_description().read(*buffer, base_offset, count));
  190. VERIFY(nread == count);
  191. return {};
  192. }
  193. auto* entry = TRY(cache->ensure(index));
  194. if (!entry->has_data) {
  195. auto base_offset = index.value() * block_size();
  196. auto entry_data_buffer = UserOrKernelBuffer::for_kernel_buffer(entry->data);
  197. auto nread = TRY(file_description().read(entry_data_buffer, base_offset, block_size()));
  198. VERIFY(nread == block_size());
  199. entry->has_data = true;
  200. }
  201. if (buffer)
  202. TRY(buffer->write(entry->data + offset, count));
  203. return {};
  204. });
  205. }
  206. ErrorOr<void> BlockBasedFileSystem::read_blocks(BlockIndex index, unsigned count, UserOrKernelBuffer& buffer, bool allow_cache) const
  207. {
  208. VERIFY(m_logical_block_size);
  209. if (!count)
  210. return EINVAL;
  211. if (count == 1)
  212. return read_block(index, &buffer, block_size(), 0, allow_cache);
  213. auto out = buffer;
  214. for (unsigned i = 0; i < count; ++i) {
  215. TRY(read_block(BlockIndex { index.value() + i }, &out, block_size(), 0, allow_cache));
  216. out = out.offset(block_size());
  217. }
  218. return {};
  219. }
  220. void BlockBasedFileSystem::flush_specific_block_if_needed(BlockIndex index)
  221. {
  222. m_cache.with_exclusive([&](auto& cache) {
  223. if (!cache->is_dirty())
  224. return;
  225. auto* entry = cache->get(index);
  226. if (!entry)
  227. return;
  228. if (!cache->entry_is_dirty(*entry))
  229. return;
  230. size_t base_offset = entry->block_index.value() * block_size();
  231. auto entry_data_buffer = UserOrKernelBuffer::for_kernel_buffer(entry->data);
  232. (void)file_description().write(base_offset, entry_data_buffer, block_size());
  233. });
  234. }
  235. void BlockBasedFileSystem::flush_writes_impl()
  236. {
  237. size_t count = 0;
  238. m_cache.with_exclusive([&](auto& cache) {
  239. if (!cache->is_dirty())
  240. return;
  241. cache->for_each_dirty_entry([&](CacheEntry& entry) {
  242. auto base_offset = entry.block_index.value() * block_size();
  243. auto entry_data_buffer = UserOrKernelBuffer::for_kernel_buffer(entry.data);
  244. [[maybe_unused]] auto rc = file_description().write(base_offset, entry_data_buffer, block_size());
  245. ++count;
  246. });
  247. cache->mark_all_clean();
  248. dbgln("{}: Flushed {} blocks to disk", class_name(), count);
  249. });
  250. }
  251. void BlockBasedFileSystem::flush_writes()
  252. {
  253. flush_writes_impl();
  254. }
  255. }