You've already forked mariadb-columnstore-engine
mirror of
https://github.com/mariadb-corporation/mariadb-columnstore-engine.git
synced 2025-07-04 04:42:30 +03:00
134 lines
3.7 KiB
C++
134 lines
3.7 KiB
C++
/* Copyright (C) 2014 InfiniDB, Inc.
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU General Public License
|
|
as published by the Free Software Foundation; version 2 of
|
|
the License.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
|
|
MA 02110-1301, USA. */
|
|
|
|
/***********************************************************************
|
|
* $Id$
|
|
*
|
|
*
|
|
***********************************************************************/
|
|
/** @file */
|
|
|
|
#include "batchprimitiveprocessor.h"
|
|
#include "umsocketselector.h"
|
|
#include <queue>
|
|
#include <set>
|
|
#include <boost/thread/thread.hpp>
|
|
#include <boost/thread/condition.hpp>
|
|
|
|
#ifndef BPPSENDTHREAD_H
|
|
#define BPPSENDTHREAD_H
|
|
|
|
namespace primitiveprocessor
|
|
{
|
|
|
|
class BPPSendThread
|
|
{
|
|
|
|
public:
|
|
BPPSendThread(); // starts unthrottled
|
|
BPPSendThread(uint32_t initMsgsLeft); // starts throttled
|
|
virtual ~BPPSendThread();
|
|
|
|
struct Msg_t
|
|
{
|
|
messageqcpp::SBS msg;
|
|
SP_UM_IOSOCK sock;
|
|
SP_UM_MUTEX sockLock;
|
|
int sockIndex; // Socket index for round robin control. Bug 4475
|
|
Msg_t() : sockIndex(0) { }
|
|
Msg_t(const Msg_t& m) : msg(m.msg), sock(m.sock), sockLock(m.sockLock), sockIndex(m.sockIndex) { }
|
|
Msg_t& operator=(const Msg_t& m)
|
|
{
|
|
msg = m.msg;
|
|
sock = m.sock;
|
|
sockLock = m.sockLock;
|
|
sockIndex = m.sockIndex;
|
|
return *this;
|
|
}
|
|
Msg_t(const messageqcpp::SBS& m, const SP_UM_IOSOCK& so, const SP_UM_MUTEX& sl, int si) :
|
|
msg(m), sock(so), sockLock(sl), sockIndex(si) { }
|
|
};
|
|
|
|
bool okToProceed();
|
|
void sendMore(int num);
|
|
void sendResults(const std::vector<Msg_t>& msgs, bool newConnection);
|
|
void sendResult(const Msg_t& msg, bool newConnection);
|
|
void mainLoop();
|
|
bool flowControlEnabled();
|
|
void abort();
|
|
inline bool aborted() const
|
|
{
|
|
return die;
|
|
}
|
|
|
|
private:
|
|
BPPSendThread(const BPPSendThread&);
|
|
BPPSendThread& operator=(const BPPSendThread&);
|
|
|
|
struct Runner_t
|
|
{
|
|
BPPSendThread* bppst;
|
|
Runner_t(BPPSendThread* b) : bppst(b) { }
|
|
void operator()()
|
|
{
|
|
bppst->mainLoop();
|
|
}
|
|
};
|
|
|
|
boost::thread runner;
|
|
std::queue<Msg_t> msgQueue;
|
|
boost::mutex msgQueueLock;
|
|
boost::condition queueNotEmpty;
|
|
volatile bool die, gotException, mainThreadWaiting;
|
|
std::string exceptionString;
|
|
uint32_t sizeThreshold;
|
|
volatile int32_t msgsLeft;
|
|
bool waiting;
|
|
boost::mutex ackLock;
|
|
boost::condition okToSend;
|
|
|
|
/* Load balancing structures */
|
|
struct Connection_t
|
|
{
|
|
Connection_t(const SP_UM_MUTEX& lock, const SP_UM_IOSOCK& so) :
|
|
sockLock(lock), sock(so) { }
|
|
SP_UM_MUTEX sockLock;
|
|
SP_UM_IOSOCK sock;
|
|
bool operator<(const Connection_t& t) const
|
|
{
|
|
return sockLock.get() < t.sockLock.get();
|
|
}
|
|
bool operator==(const Connection_t& t) const
|
|
{
|
|
return sockLock.get() == t.sockLock.get();
|
|
}
|
|
};
|
|
std::set<Connection_t> connections_s;
|
|
std::vector<Connection_t> connections_v;
|
|
bool sawAllConnections;
|
|
volatile bool fcEnabled;
|
|
|
|
/* secondary queue size restriction based on byte size */
|
|
volatile uint64_t currentByteSize;
|
|
uint64_t maxByteSize;
|
|
};
|
|
|
|
}
|
|
|
|
#endif
|
|
|