database/mariadb-columnstore-engine
1
0
Fork 0
mirror of https://github.com/mariadb-corporation/mariadb-columnstore-engine.git synced 2025-08-07 03:22:57 +03:00
Code Activity

No boost condition (#2822)

Browse Source 
This patch replaces boost primitives with stdlib counterparts.
This commit is contained in:
Leonid Fedorov
2023-04-22 00:42:45 +03:00
committed by GitHub
parent 3ce19abdae
commit f916e64927
245 changed files with 1261 additions and 2007 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
storage-manager/src/Cache.cpp
View File

@@ -32,7 +32,7 @@ namespace bf = boost::filesystem;
namespace
{
boost::mutex m;
std::mutex m;
storagemanager::Cache* inst = NULL;
} // namespace
@@ -42,7 +42,7 @@ Cache* Cache::get()
{
if (inst)
return inst;
boost::unique_lock<boost::mutex> s(m);
std::unique_lock<std::mutex> s(m);
if (inst)
return inst;
inst = new Cache();
@@ -122,7 +122,7 @@ Cache::~Cache()
// be careful using this! SM should be idle. No ongoing reads or writes.
void Cache::validateCacheSize()
{
boost::unique_lock<boost::mutex> s(lru_mutex);
std::unique_lock<std::mutex> s(lru_mutex);
for (auto it = prefixCaches.begin(); it != prefixCaches.end(); ++it)
it->second->validateCacheSize();
@@ -196,7 +196,7 @@ void Cache::deletedObject(const bf::path& prefix, const string& key, size_t size
void Cache::setMaxCacheSize(size_t size)
{
boost::unique_lock<boost::mutex> s(lru_mutex);
std::unique_lock<std::mutex> s(lru_mutex);
maxCacheSize = size;
for (auto it = prefixCaches.begin(); it != prefixCaches.end(); ++it)
@@ -231,7 +231,7 @@ size_t Cache::getCurrentCacheSize()
{
size_t totalSize = 0;
boost::unique_lock<boost::mutex> s(lru_mutex);
std::unique_lock<std::mutex> s(lru_mutex);
for (auto it = prefixCaches.begin(); it != prefixCaches.end(); ++it)
totalSize += it->second->getCurrentCacheSize();
@@ -259,7 +259,7 @@ size_t Cache::getCurrentCacheElementCount(const bf::path& prefix)
void Cache::reset()
{
boost::unique_lock<boost::mutex> s(lru_mutex);
std::unique_lock<std::mutex> s(lru_mutex);
for (auto it = prefixCaches.begin(); it != prefixCaches.end(); ++it)
it->second->reset();
@@ -267,7 +267,7 @@ void Cache::reset()
void Cache::newPrefix(const bf::path& prefix)
{
boost::unique_lock<boost::mutex> s(lru_mutex);
std::unique_lock<std::mutex> s(lru_mutex);
// cerr << "Cache: making new prefix " << prefix.string() << endl;
assert(prefixCaches.find(prefix) == prefixCaches.end());
@@ -280,7 +280,7 @@ void Cache::newPrefix(const bf::path& prefix)
void Cache::dropPrefix(const bf::path& prefix)
{
boost::unique_lock<boost::mutex> s(lru_mutex);
std::unique_lock<std::mutex> s(lru_mutex);
auto* pCache = prefixCaches[prefix];
prefixCaches.erase(prefix);
@@ -290,7 +290,7 @@ void Cache::dropPrefix(const bf::path& prefix)
inline PrefixCache& Cache::getPCache(const bf::path& prefix)
{
boost::unique_lock<boost::mutex> s(lru_mutex);
std::unique_lock<std::mutex> s(lru_mutex);
// cerr << "Getting pcache for " << prefix.string() << endl;
PrefixCache* ret;
@@ -316,7 +316,7 @@ Downloader* Cache::getDownloader() const
void Cache::shutdown()
{
boost::unique_lock<boost::mutex> s(lru_mutex);
std::unique_lock<std::mutex> s(lru_mutex);
downloader.reset();
}