blob: 5fa965b3ad655fe1df5c73d0de6ef635c41d87c6 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
|
#include "FileAccessorCache.h"
#include <cassert>
CacheAccessorID GetCacheAccessorID(const std::string& filePath)
{
constexpr std::hash<std::string> hasher;
return static_cast<CacheAccessorID>(hasher(filePath));
}
FileAccessorCache::FileAccessorCache(size_t cacheSize)
{
m_cacheSize = cacheSize;
m_accessors = {};
}
void FileAccessorCache::EvictLastUsed()
{
if (m_cache.empty())
return;
// Evict the least recently used element.
const auto lruID = m_cache.front();
m_cache.pop_front();
// Ensure the least recently used ID actually exists in the accessors map.
assert(m_accessors.find(lruID) != m_accessors.end() && "Evicting non-existent ID from accessors map");
m_accessors.erase(lruID);
}
FileAccessorCache& FileAccessorCache::Global()
{
static FileAccessorCache cache {};
return cache;
}
WeakFileAccessor FileAccessorCache::Open(const std::string& filePath)
{
const auto id = GetCacheAccessorID(filePath);
std::unique_lock lock(m_mutex);
// Check if the file is already in the cache.
if (const auto it = m_accessors.find(id); it != m_accessors.end())
{
// Move the accessed ID to the back so we keep it in the cache.
auto pos = std::find(m_cache.begin(), m_cache.end(), id);
if (pos != m_cache.end())
m_cache.erase(pos);
m_cache.push_back(id);
return WeakFileAccessor(it->second, filePath);
}
// Evict if we are going to go above the limit.
while (m_cache.size() >= m_cacheSize)
EvictLastUsed();
// Create a new file accessor and add it to the cache.
auto accessor = MappedFileAccessor::Open(filePath);
if (accessor == nullptr)
{
// We failed to open the file, we must throw hard!
// TODO: Make this mechanism more thought out...
throw std::runtime_error("Failed to open file: " + filePath);
}
auto sharedAccessor = std::make_shared<MappedFileAccessor>(std::move(*accessor));
m_accessors.insert_or_assign(id, sharedAccessor);
m_cache.push_back(id);
return WeakFileAccessor(sharedAccessor, filePath);
}
std::shared_ptr<MappedFileAccessor> WeakFileAccessor::lock()
{
auto sharedPtr = m_weakPtr.lock();
if (!sharedPtr)
{
// This will revive other weak pointers to the same shared ptr.
// Update the weak pointer to the newly created shared instance
m_weakPtr = FileAccessorCache::Global().Open(m_filePath).m_weakPtr;
sharedPtr = m_weakPtr.lock();
// Call the function registered with `RegisterReviveCallback`.
// TODO: This races if two functions cannot acquire and revive the same file at the same time.
// TODO: This will be called twice.
if (m_reviveCallback.has_value())
(*m_reviveCallback)(*sharedPtr);
}
return sharedPtr;
}
|
