database/mariadb-columnstore-engine
1
0
Fork 0
mirror of https://github.com/mariadb-corporation/mariadb-columnstore-engine.git synced 2025-08-01 06:46:55 +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

23
dbcon/joblist/tuple-bps.cpp
View File

@ -30,7 +30,7 @@
using namespace std;
#include <boost/thread.hpp>
#include <boost/thread/condition.hpp>
#include <condition_variable>
#include <boost/uuid/uuid_io.hpp>
using namespace boost;
@ -79,7 +79,7 @@ using namespace querytele;
#include "pseudocolumn.h"
//#define DEBUG 1
extern boost::mutex fileLock_g;
extern std::mutex fileLock_g;
namespace
{
@ -1160,7 +1160,7 @@ void TupleBPS::serializeJoiner()
{
{
// code block to release the lock immediatly
boost::mutex::scoped_lock lk(serializeJoinerMutex);
std::unique_lock lk(serializeJoinerMutex);
more = fBPP->nextTupleJoinerMsg(*sbs);
}
#ifdef JLF_DEBUG
@ -1175,7 +1175,7 @@ void TupleBPS::serializeJoiner()
void TupleBPS::serializeJoiner(uint32_t conn)
{
// We need this lock for TupleBPS::serializeJoiner()
boost::mutex::scoped_lock lk(serializeJoinerMutex);
std::unique_lock lk(serializeJoinerMutex);
ByteStream bs;
bool more = true;
@ -1195,7 +1195,7 @@ void TupleBPS::prepCasualPartitioning()
uint32_t i;
int64_t min, max, seq;
int128_t bigMin, bigMax;
boost::mutex::scoped_lock lk(cpMutex);
std::unique_lock lk(cpMutex);
for (i = 0; i < scannedExtents.size(); i++)
{
@ -1405,7 +1405,7 @@ void TupleBPS::reloadExtentLists()
void TupleBPS::run()
{
uint32_t i;
boost::mutex::scoped_lock lk(jlLock);
std::unique_lock lk(jlLock);
uint32_t retryCounter = 0;
const uint32_t retryMax = 1000; // 50s max; we've seen a 15s window so 50s should be 'safe'
const uint32_t waitInterval = 50000; // in us
@ -1500,7 +1500,7 @@ void TupleBPS::run()
void TupleBPS::join()
{
boost::mutex::scoped_lock lk(jlLock);
std::unique_lock lk(jlLock);
if (joinRan)
return;
@ -1512,7 +1512,7 @@ void TupleBPS::join()
if (msgsRecvd < msgsSent)
{
// wake up the sending thread, it should drain the input dl and exit
boost::unique_lock<boost::mutex> tplLock(tplMutex);
std::unique_lock<std::mutex> tplLock(tplMutex);
condvarWakeupProducer.notify_all();
tplLock.unlock();
}
@ -1669,7 +1669,7 @@ void TupleBPS::interleaveJobs(vector<Job>* jobs) const
void TupleBPS::sendJobs(const vector<Job>& jobs)
{
uint32_t i;
boost::unique_lock<boost::mutex> tplLock(tplMutex, boost::defer_lock);
std::unique_lock<std::mutex> tplLock(tplMutex, std::defer_lock);
for (i = 0; i < jobs.size() && !cancelled(); i++)
{
@ -2142,7 +2142,7 @@ void TupleBPS::sendPrimitiveMessages()
}
abort:
boost::unique_lock<boost::mutex> tplLock(tplMutex);
std::unique_lock<std::mutex> tplLock(tplMutex);
finishedSending = true;
condvar.notify_all();
tplLock.unlock();
@ -2402,7 +2402,7 @@ void TupleBPS::receiveMultiPrimitiveMessages()
initializeJoinLocalDataPool(1);
vector<boost::shared_ptr<messageqcpp::ByteStream>> bsv;
boost::unique_lock<boost::mutex> tplLock(tplMutex, boost::defer_lock);
std::unique_lock<std::mutex> tplLock(tplMutex, std::defer_lock);
try
{
@ -3393,7 +3393,6 @@ void TupleBPS::abort_nolock()
void TupleBPS::abort()
{
boost::mutex::scoped_lock scoped(boost::mutex);
abort_nolock();
}