1
Fork 0
mirror of https://github.com/RGBCube/serenity synced 2025-05-14 14:44:58 +00:00

Kernel: Convert read_block method to get a reference instead of pointer

BlockBasedFileSystem::read_block method should get a reference of
a UserOrKernelBuffer.

If we need to force caching a block, we will call other method to do so.
This commit is contained in:
Liav A 2020-12-24 18:18:40 +02:00 committed by Andreas Kling
parent d1366b660e
commit 092a13211a
3 changed files with 80 additions and 47 deletions

View file

@ -32,19 +32,12 @@
namespace Kernel {
struct CacheEntry {
IntrusiveListNode list_node;
u32 block_index { 0 };
u8* data { nullptr };
bool has_data { false };
};
class DiskCache {
public:
explicit DiskCache(BlockBasedFS& fs)
: m_fs(fs)
, m_cached_block_data(KBuffer::create_with_size(m_entry_count * m_fs.block_size()))
, m_entries(KBuffer::create_with_size(m_entry_count * sizeof(CacheEntry)))
, m_entries(KBuffer::create_with_size(m_entry_count * sizeof(BlockBasedFS::CacheEntry&)))
{
for (size_t i = 0; i < m_entry_count; ++i) {
entries()[i].data = m_cached_block_data.data() + i * m_fs.block_size();
@ -64,21 +57,21 @@ public:
m_dirty = false;
}
void mark_dirty(CacheEntry& entry)
void mark_dirty(BlockBasedFS::CacheEntry& entry)
{
m_dirty_list.prepend(entry);
m_dirty = true;
}
void mark_clean(CacheEntry& entry)
void mark_clean(BlockBasedFS::CacheEntry& entry)
{
m_clean_list.prepend(entry);
}
CacheEntry& get(u32 block_index) const
BlockBasedFS::CacheEntry& get(u32 block_index) const
{
if (auto it = m_hash.find(block_index); it != m_hash.end()) {
auto& entry = const_cast<CacheEntry&>(*it->value);
auto& entry = const_cast<BlockBasedFS::CacheEntry&>(*it->value);
ASSERT(entry.block_index == block_index);
return entry;
}
@ -104,8 +97,8 @@ public:
return new_entry;
}
const CacheEntry* entries() const { return (const CacheEntry*)m_entries.data(); }
CacheEntry* entries() { return (CacheEntry*)m_entries.data(); }
const BlockBasedFS::CacheEntry* entries() const { return (const BlockBasedFS::CacheEntry*)m_entries.data(); }
BlockBasedFS::CacheEntry* entries() { return (BlockBasedFS::CacheEntry*)m_entries.data(); }
template<typename Callback>
void for_each_clean_entry(Callback callback)
@ -124,9 +117,9 @@ public:
private:
BlockBasedFS& m_fs;
size_t m_entry_count { 10000 };
mutable HashMap<u32, CacheEntry*> m_hash;
mutable IntrusiveList<CacheEntry, &CacheEntry::list_node> m_clean_list;
mutable IntrusiveList<CacheEntry, &CacheEntry::list_node> m_dirty_list;
mutable HashMap<u32, BlockBasedFS::CacheEntry*> m_hash;
mutable IntrusiveList<BlockBasedFS::CacheEntry, &BlockBasedFS::CacheEntry::list_node> m_clean_list;
mutable IntrusiveList<BlockBasedFS::CacheEntry, &BlockBasedFS::CacheEntry::list_node> m_dirty_list;
KBuffer m_cached_block_data;
KBuffer m_entries;
bool m_dirty { false };
@ -161,19 +154,50 @@ int BlockBasedFS::write_block(unsigned index, const UserOrKernelBuffer& data, si
return 0;
}
auto& entry = cache().get(index);
auto entry_or_error = cache_block(index);
if (entry_or_error.is_error())
return -EIO;
if (!entry_or_error.value().has_data)
return -EIO;
if (count < block_size()) {
// Fill the cache first.
read_block(index, nullptr, block_size());
if (!force_cache_block(index))
return -EIO;
}
if (!data.read(entry.data + offset, count))
if (!data.read(entry_or_error.value().data + offset, count))
return -EFAULT;
cache().mark_dirty(entry);
entry.has_data = true;
cache().mark_dirty(entry_or_error.value());
// Update the actual entry and not the copy of it!
cache().get(index).has_data = true;
return 0;
}
bool BlockBasedFS::force_cache_block(unsigned index) const
{
auto& entry = cache().get(index);
u32 base_offset = static_cast<u32>(index) * static_cast<u32>(block_size());
file_description().seek(base_offset, SEEK_SET);
auto entry_data_buffer = UserOrKernelBuffer::for_kernel_buffer(entry.data);
auto nread = file_description().read(entry_data_buffer, block_size());
if (nread.is_error())
return false;
ASSERT(nread.value() == block_size());
entry.has_data = true;
return true;
}
KResultOr<BlockBasedFS::CacheEntry> BlockBasedFS::cache_block(unsigned index) const
{
auto& entry = cache().get(index);
if (!entry.has_data) {
if (!force_cache_block(index))
return KResult(-EIO);
}
return entry;
}
bool BlockBasedFS::raw_read(unsigned index, UserOrKernelBuffer& buffer)
{
u32 base_offset = static_cast<u32>(index) * static_cast<u32>(m_logical_block_size);
@ -225,7 +249,7 @@ int BlockBasedFS::write_blocks(unsigned index, unsigned count, const UserOrKerne
return 0;
}
int BlockBasedFS::read_block(unsigned index, UserOrKernelBuffer* buffer, size_t count, size_t offset, bool allow_cache) const
int BlockBasedFS::read_block(unsigned index, UserOrKernelBuffer& buffer, size_t count, size_t offset, bool allow_cache) const
{
ASSERT(m_logical_block_size);
ASSERT(offset + count <= block_size());
@ -237,25 +261,19 @@ int BlockBasedFS::read_block(unsigned index, UserOrKernelBuffer* buffer, size_t
const_cast<BlockBasedFS*>(this)->flush_specific_block_if_needed(index);
u32 base_offset = static_cast<u32>(index) * static_cast<u32>(block_size()) + static_cast<u32>(offset);
file_description().seek(base_offset, SEEK_SET);
auto nread = file_description().read(*buffer, count);
auto nread = file_description().read(buffer, count);
if (nread.is_error())
return -EIO;
ASSERT(nread.value() == count);
return 0;
}
auto& entry = cache().get(index);
if (!entry.has_data) {
u32 base_offset = static_cast<u32>(index) * static_cast<u32>(block_size());
file_description().seek(base_offset, SEEK_SET);
auto entry_data_buffer = UserOrKernelBuffer::for_kernel_buffer(entry.data);
auto nread = file_description().read(entry_data_buffer, block_size());
if (nread.is_error())
return -EIO;
ASSERT(nread.value() == block_size());
entry.has_data = true;
}
if (buffer && !buffer->write(entry.data + offset, count))
auto entry_or_error = cache_block(index);
if (entry_or_error.is_error())
return -EIO;
if (!entry_or_error.value().has_data)
return -EIO;
if (!buffer.write(entry_or_error.value().data + offset, count))
return -EFAULT;
return 0;
}
@ -266,10 +284,10 @@ int BlockBasedFS::read_blocks(unsigned index, unsigned count, UserOrKernelBuffer
if (!count)
return false;
if (count == 1)
return read_block(index, &buffer, block_size(), 0, allow_cache);
return read_block(index, buffer, block_size(), 0, allow_cache);
auto out = buffer;
for (unsigned i = 0; i < count; ++i) {
auto err = read_block(index + i, &out, block_size(), 0, allow_cache);
auto err = read_block(index + i, out, block_size(), 0, allow_cache);
if (err < 0)
return err;
out = out.offset(block_size());
@ -284,7 +302,7 @@ void BlockBasedFS::flush_specific_block_if_needed(unsigned index)
if (!cache().is_dirty())
return;
Vector<CacheEntry*, 32> cleaned_entries;
cache().for_each_dirty_entry([&](CacheEntry& entry) {
cache().for_each_dirty_entry([&](BlockBasedFS::CacheEntry& entry) {
if (entry.block_index != index) {
u32 base_offset = static_cast<u32>(entry.block_index) * static_cast<u32>(block_size());
file_description().seek(base_offset, SEEK_SET);
@ -306,7 +324,7 @@ void BlockBasedFS::flush_writes_impl()
if (!cache().is_dirty())
return;
u32 count = 0;
cache().for_each_dirty_entry([&](CacheEntry& entry) {
cache().for_each_dirty_entry([&](BlockBasedFS::CacheEntry& entry) {
u32 base_offset = static_cast<u32>(entry.block_index) * static_cast<u32>(block_size());
file_description().seek(base_offset, SEEK_SET);
// FIXME: Should this error path be surfaced somehow?