You've already forked mariadb-columnstore-engine
mirror of
https://github.com/mariadb-corporation/mariadb-columnstore-engine.git
synced 2025-07-30 19:23:07 +03:00
Reformat all code to coding standard
This commit is contained in:
Andrew Hutchings
510
primitives/primproc/batchprimitiveprocessor.h
Executable file → Normal file
510
primitives/primproc/batchprimitiveprocessor.h
Executable file → Normal file
@ -65,300 +65,340 @@ namespace primitiveprocessor
|
||||
|
||||
typedef boost::shared_ptr<BatchPrimitiveProcessor> SBPP;
|
||||
|
||||
class scalar_exception : public std::exception {
|
||||
const char * what() const throw() { return "Not a scalar subquery."; }
|
||||
class scalar_exception : public std::exception
|
||||
{
|
||||
const char* what() const throw()
|
||||
{
|
||||
return "Not a scalar subquery.";
|
||||
}
|
||||
};
|
||||
|
||||
class NeedToRestartJob : public std::runtime_error
|
||||
{
|
||||
public:
|
||||
NeedToRestartJob() : std::runtime_error("NeedToRestartJob") { }
|
||||
NeedToRestartJob(const std::string &s) :
|
||||
std::runtime_error(s) { }
|
||||
public:
|
||||
NeedToRestartJob() : std::runtime_error("NeedToRestartJob") { }
|
||||
NeedToRestartJob(const std::string& s) :
|
||||
std::runtime_error(s) { }
|
||||
};
|
||||
|
||||
|
||||
class BatchPrimitiveProcessor
|
||||
{
|
||||
public:
|
||||
BatchPrimitiveProcessor(messageqcpp::ByteStream &, double prefetchThresh,
|
||||
boost::shared_ptr<BPPSendThread>);
|
||||
public:
|
||||
BatchPrimitiveProcessor(messageqcpp::ByteStream&, double prefetchThresh,
|
||||
boost::shared_ptr<BPPSendThread>);
|
||||
|
||||
~BatchPrimitiveProcessor();
|
||||
~BatchPrimitiveProcessor();
|
||||
|
||||
/* Interface used by primproc */
|
||||
void initBPP(messageqcpp::ByteStream &);
|
||||
void resetBPP(messageqcpp::ByteStream &, const SP_UM_MUTEX& wLock, const SP_UM_IOSOCK& outputSock);
|
||||
void addToJoiner(messageqcpp::ByteStream &);
|
||||
int endOfJoiner();
|
||||
int operator()();
|
||||
void setLBIDForScan(uint64_t rid);
|
||||
/* Interface used by primproc */
|
||||
void initBPP(messageqcpp::ByteStream&);
|
||||
void resetBPP(messageqcpp::ByteStream&, const SP_UM_MUTEX& wLock, const SP_UM_IOSOCK& outputSock);
|
||||
void addToJoiner(messageqcpp::ByteStream&);
|
||||
int endOfJoiner();
|
||||
int operator()();
|
||||
void setLBIDForScan(uint64_t rid);
|
||||
|
||||
/* Duplicate() returns a deep copy of this object as it was init'd by initBPP.
|
||||
It's thread-safe wrt resetBPP. */
|
||||
SBPP duplicate();
|
||||
/* Duplicate() returns a deep copy of this object as it was init'd by initBPP.
|
||||
It's thread-safe wrt resetBPP. */
|
||||
SBPP duplicate();
|
||||
|
||||
/* These need to be updated */
|
||||
//bool operator==(const BatchPrimitiveProcessor&) const;
|
||||
//inline bool operator!=(const BatchPrimitiveProcessor& bpp) const
|
||||
//{
|
||||
// return !(*this == bpp);
|
||||
//}
|
||||
/* These need to be updated */
|
||||
//bool operator==(const BatchPrimitiveProcessor&) const;
|
||||
//inline bool operator!=(const BatchPrimitiveProcessor& bpp) const
|
||||
//{
|
||||
// return !(*this == bpp);
|
||||
//}
|
||||
|
||||
inline uint32_t getSessionID() { return sessionID; }
|
||||
inline uint32_t getStepID() { return stepID; }
|
||||
inline uint32_t getUniqueID() { return uniqueID; }
|
||||
inline bool busy() { return fBusy; }
|
||||
inline void busy(bool b) { fBusy = b; }
|
||||
inline uint32_t getSessionID()
|
||||
{
|
||||
return sessionID;
|
||||
}
|
||||
inline uint32_t getStepID()
|
||||
{
|
||||
return stepID;
|
||||
}
|
||||
inline uint32_t getUniqueID()
|
||||
{
|
||||
return uniqueID;
|
||||
}
|
||||
inline bool busy()
|
||||
{
|
||||
return fBusy;
|
||||
}
|
||||
inline void busy(bool b)
|
||||
{
|
||||
fBusy = b;
|
||||
}
|
||||
|
||||
uint16_t FilterCount() const {return filterCount;}
|
||||
uint16_t ProjectCount() const {return projectCount;}
|
||||
uint32_t PhysIOCount() const { return physIO;}
|
||||
uint32_t CachedIOCount() const { return cachedIO;}
|
||||
uint32_t BlocksTouchedCount() const { return touchedBlocks;}
|
||||
uint16_t FilterCount() const
|
||||
{
|
||||
return filterCount;
|
||||
}
|
||||
uint16_t ProjectCount() const
|
||||
{
|
||||
return projectCount;
|
||||
}
|
||||
uint32_t PhysIOCount() const
|
||||
{
|
||||
return physIO;
|
||||
}
|
||||
uint32_t CachedIOCount() const
|
||||
{
|
||||
return cachedIO;
|
||||
}
|
||||
uint32_t BlocksTouchedCount() const
|
||||
{
|
||||
return touchedBlocks;
|
||||
}
|
||||
|
||||
void setError(const std::string& error, logging::ErrorCodeValues errorCode) {}
|
||||
void setError(const std::string& error, logging::ErrorCodeValues errorCode) {}
|
||||
|
||||
// these two functions are used by BPPV to create BPP instances
|
||||
// on demand. TRY not to use unlock() for anything else.
|
||||
void unlock() { pthread_mutex_unlock(&objLock); }
|
||||
bool hasJoin() { return doJoin; }
|
||||
private:
|
||||
BatchPrimitiveProcessor();
|
||||
BatchPrimitiveProcessor(const BatchPrimitiveProcessor &);
|
||||
BatchPrimitiveProcessor& operator=(const BatchPrimitiveProcessor &);
|
||||
// these two functions are used by BPPV to create BPP instances
|
||||
// on demand. TRY not to use unlock() for anything else.
|
||||
void unlock()
|
||||
{
|
||||
pthread_mutex_unlock(&objLock);
|
||||
}
|
||||
bool hasJoin()
|
||||
{
|
||||
return doJoin;
|
||||
}
|
||||
private:
|
||||
BatchPrimitiveProcessor();
|
||||
BatchPrimitiveProcessor(const BatchPrimitiveProcessor&);
|
||||
BatchPrimitiveProcessor& operator=(const BatchPrimitiveProcessor&);
|
||||
|
||||
void initProcessor();
|
||||
void initProcessor();
|
||||
#ifdef PRIMPROC_STOPWATCH
|
||||
void execute(logging::StopWatch *stopwatch);
|
||||
void execute(logging::StopWatch* stopwatch);
|
||||
#else
|
||||
void execute();
|
||||
void execute();
|
||||
#endif
|
||||
void writeProjectionPreamble();
|
||||
void makeResponse();
|
||||
void sendResponse();
|
||||
void writeProjectionPreamble();
|
||||
void makeResponse();
|
||||
void sendResponse();
|
||||
|
||||
/* Used by scan operations to increment the LBIDs in successive steps */
|
||||
void nextLBID();
|
||||
/* Used by scan operations to increment the LBIDs in successive steps */
|
||||
void nextLBID();
|
||||
|
||||
/* these send relative rids, should this be abs rids? */
|
||||
void serializeElementTypes();
|
||||
void serializeStrings();
|
||||
/* these send relative rids, should this be abs rids? */
|
||||
void serializeElementTypes();
|
||||
void serializeStrings();
|
||||
|
||||
void asyncLoadProjectColumns();
|
||||
void writeErrorMsg(const std::string& error, uint16_t errCode, bool logIt = true, bool critical = true);
|
||||
void asyncLoadProjectColumns();
|
||||
void writeErrorMsg(const std::string& error, uint16_t errCode, bool logIt = true, bool critical = true);
|
||||
|
||||
BPSOutputType ot;
|
||||
BPSOutputType ot;
|
||||
|
||||
BRM::QueryContext versionInfo;
|
||||
uint32_t txnID;
|
||||
uint32_t sessionID;
|
||||
uint32_t stepID;
|
||||
uint32_t uniqueID;
|
||||
BRM::QueryContext versionInfo;
|
||||
uint32_t txnID;
|
||||
uint32_t sessionID;
|
||||
uint32_t stepID;
|
||||
uint32_t uniqueID;
|
||||
|
||||
// # of times to loop over the command arrays
|
||||
// ... This is 1, except when the first command is a scan, in which case
|
||||
// this single BPP object produces count responses.
|
||||
uint16_t count;
|
||||
uint64_t baseRid; // first rid of the logical block
|
||||
// # of times to loop over the command arrays
|
||||
// ... This is 1, except when the first command is a scan, in which case
|
||||
// this single BPP object produces count responses.
|
||||
uint16_t count;
|
||||
uint64_t baseRid; // first rid of the logical block
|
||||
|
||||
uint16_t relRids[LOGICAL_BLOCK_RIDS];
|
||||
int64_t values[LOGICAL_BLOCK_RIDS];
|
||||
boost::scoped_array<uint64_t> absRids;
|
||||
boost::scoped_array<std::string> strValues;
|
||||
uint16_t ridCount;
|
||||
bool needStrValues;
|
||||
uint16_t relRids[LOGICAL_BLOCK_RIDS];
|
||||
int64_t values[LOGICAL_BLOCK_RIDS];
|
||||
boost::scoped_array<uint64_t> absRids;
|
||||
boost::scoped_array<std::string> strValues;
|
||||
uint16_t ridCount;
|
||||
bool needStrValues;
|
||||
|
||||
/* Common space for primitive data */
|
||||
static const uint32_t BUFFER_SIZE = 65536;
|
||||
uint8_t blockData[BLOCK_SIZE * 8];
|
||||
boost::scoped_array<uint8_t> outputMsg;
|
||||
uint32_t outMsgSize;
|
||||
/* Common space for primitive data */
|
||||
static const uint32_t BUFFER_SIZE = 65536;
|
||||
uint8_t blockData[BLOCK_SIZE * 8];
|
||||
boost::scoped_array<uint8_t> outputMsg;
|
||||
uint32_t outMsgSize;
|
||||
|
||||
std::vector<SCommand> filterSteps;
|
||||
std::vector<SCommand> projectSteps;
|
||||
//@bug 1136
|
||||
uint16_t filterCount;
|
||||
uint16_t projectCount;
|
||||
bool sendRidsAtDelivery;
|
||||
uint8_t ridMap;
|
||||
bool gotAbsRids;
|
||||
bool gotValues;
|
||||
std::vector<SCommand> filterSteps;
|
||||
std::vector<SCommand> projectSteps;
|
||||
//@bug 1136
|
||||
uint16_t filterCount;
|
||||
uint16_t projectCount;
|
||||
bool sendRidsAtDelivery;
|
||||
uint8_t ridMap;
|
||||
bool gotAbsRids;
|
||||
bool gotValues;
|
||||
|
||||
bool hasScan;
|
||||
bool validCPData;
|
||||
int64_t minVal, maxVal; // CP data from a scanned column
|
||||
uint64_t lbidForCP;
|
||||
bool hasScan;
|
||||
bool validCPData;
|
||||
int64_t minVal, maxVal; // CP data from a scanned column
|
||||
uint64_t lbidForCP;
|
||||
|
||||
// IO counters
|
||||
boost::mutex counterLock;
|
||||
uint32_t busyLoaderCount;
|
||||
// IO counters
|
||||
boost::mutex counterLock;
|
||||
uint32_t busyLoaderCount;
|
||||
|
||||
uint32_t physIO, cachedIO, touchedBlocks;
|
||||
uint32_t physIO, cachedIO, touchedBlocks;
|
||||
|
||||
SP_UM_IOSOCK sock;
|
||||
messageqcpp::SBS serialized;
|
||||
SP_UM_MUTEX writelock;
|
||||
SP_UM_IOSOCK sock;
|
||||
messageqcpp::SBS serialized;
|
||||
SP_UM_MUTEX writelock;
|
||||
|
||||
// MCOL-744 using pthread mutex instead of Boost mutex because
|
||||
// in it is possible that this lock could be unlocked when it is
|
||||
// already unlocked. In Ubuntu 16.04's Boost this triggers a
|
||||
// crash. Whilst it is very hard to hit this it is still bad.
|
||||
// Longer term TODO: fix/remove objLock and/or refactor BPP
|
||||
pthread_mutex_t objLock;
|
||||
bool LBIDTrace;
|
||||
bool fBusy;
|
||||
// MCOL-744 using pthread mutex instead of Boost mutex because
|
||||
// in it is possible that this lock could be unlocked when it is
|
||||
// already unlocked. In Ubuntu 16.04's Boost this triggers a
|
||||
// crash. Whilst it is very hard to hit this it is still bad.
|
||||
// Longer term TODO: fix/remove objLock and/or refactor BPP
|
||||
pthread_mutex_t objLock;
|
||||
bool LBIDTrace;
|
||||
bool fBusy;
|
||||
|
||||
/* Join support TODO: Make join ops a seperate Command class. */
|
||||
boost::shared_ptr<joiner::Joiner> joiner;
|
||||
std::vector<joblist::ElementType> smallSideMatches;
|
||||
bool doJoin;
|
||||
uint32_t joinerSize;
|
||||
uint16_t preJoinRidCount;
|
||||
boost::mutex addToJoinerLock;
|
||||
void executeJoin();
|
||||
/* Join support TODO: Make join ops a seperate Command class. */
|
||||
boost::shared_ptr<joiner::Joiner> joiner;
|
||||
std::vector<joblist::ElementType> smallSideMatches;
|
||||
bool doJoin;
|
||||
uint32_t joinerSize;
|
||||
uint16_t preJoinRidCount;
|
||||
boost::mutex addToJoinerLock;
|
||||
void executeJoin();
|
||||
|
||||
// uint32_t ridsIn, ridsOut;
|
||||
|
||||
//@bug 1051 FilterStep on PM
|
||||
bool hasFilterStep;
|
||||
bool filtOnString;
|
||||
boost::scoped_array<uint16_t> fFiltCmdRids[2];
|
||||
boost::scoped_array<int64_t> fFiltCmdValues[2];
|
||||
boost::scoped_array<std::string> fFiltStrValues[2];
|
||||
uint64_t fFiltRidCount[2];
|
||||
//@bug 1051 FilterStep on PM
|
||||
bool hasFilterStep;
|
||||
bool filtOnString;
|
||||
boost::scoped_array<uint16_t> fFiltCmdRids[2];
|
||||
boost::scoped_array<int64_t> fFiltCmdValues[2];
|
||||
boost::scoped_array<std::string> fFiltStrValues[2];
|
||||
uint64_t fFiltRidCount[2];
|
||||
|
||||
// query density threshold for prefetch & async loading
|
||||
double prefetchThreshold;
|
||||
// query density threshold for prefetch & async loading
|
||||
double prefetchThreshold;
|
||||
|
||||
/* RowGroup support */
|
||||
rowgroup::RowGroup outputRG;
|
||||
boost::scoped_ptr<rowgroup::RGData> outRowGroupData;
|
||||
boost::shared_array<int> rgMap; // maps input cols to output cols
|
||||
boost::shared_array<int> projectionMap; // maps the projection steps to the output RG
|
||||
bool hasRowGroup;
|
||||
/* RowGroup support */
|
||||
rowgroup::RowGroup outputRG;
|
||||
boost::scoped_ptr<rowgroup::RGData> outRowGroupData;
|
||||
boost::shared_array<int> rgMap; // maps input cols to output cols
|
||||
boost::shared_array<int> projectionMap; // maps the projection steps to the output RG
|
||||
bool hasRowGroup;
|
||||
|
||||
/* Rowgroups + join */
|
||||
typedef std::tr1::unordered_multimap<uint64_t, uint32_t,
|
||||
joiner::TupleJoiner::hasher, std::equal_to<uint64_t>,
|
||||
utils::SimpleAllocator<std::pair<const uint64_t, uint32_t> > > TJoiner;
|
||||
/* Rowgroups + join */
|
||||
typedef std::tr1::unordered_multimap<uint64_t, uint32_t,
|
||||
joiner::TupleJoiner::hasher, std::equal_to<uint64_t>,
|
||||
utils::SimpleAllocator<std::pair<const uint64_t, uint32_t> > > TJoiner;
|
||||
|
||||
typedef std::tr1::unordered_multimap<joiner::TypelessData,
|
||||
uint32_t, joiner::TupleJoiner::hasher> TLJoiner;
|
||||
typedef std::tr1::unordered_multimap<joiner::TypelessData,
|
||||
uint32_t, joiner::TupleJoiner::hasher> TLJoiner;
|
||||
|
||||
bool generateJoinedRowGroup(rowgroup::Row &baseRow, const uint32_t depth = 0);
|
||||
/* generateJoinedRowGroup helper fcns & vars */
|
||||
void initGJRG(); // called once after joining
|
||||
void resetGJRG(); // called after every rowgroup returned by generateJRG
|
||||
boost::scoped_array<uint32_t> gjrgPlaceHolders;
|
||||
uint32_t gjrgRowNumber;
|
||||
bool gjrgFull;
|
||||
rowgroup::Row largeRow, joinedRow, baseJRow;
|
||||
boost::scoped_array<uint8_t> baseJRowMem;
|
||||
boost::scoped_ptr<rowgroup::RGData> joinedRGMem;
|
||||
boost::scoped_array<rowgroup::Row> smallRows;
|
||||
boost::shared_array<boost::shared_array<int> > gjrgMappings;
|
||||
bool generateJoinedRowGroup(rowgroup::Row& baseRow, const uint32_t depth = 0);
|
||||
/* generateJoinedRowGroup helper fcns & vars */
|
||||
void initGJRG(); // called once after joining
|
||||
void resetGJRG(); // called after every rowgroup returned by generateJRG
|
||||
boost::scoped_array<uint32_t> gjrgPlaceHolders;
|
||||
uint32_t gjrgRowNumber;
|
||||
bool gjrgFull;
|
||||
rowgroup::Row largeRow, joinedRow, baseJRow;
|
||||
boost::scoped_array<uint8_t> baseJRowMem;
|
||||
boost::scoped_ptr<rowgroup::RGData> joinedRGMem;
|
||||
boost::scoped_array<rowgroup::Row> smallRows;
|
||||
boost::shared_array<boost::shared_array<int> > gjrgMappings;
|
||||
|
||||
boost::shared_array<boost::shared_ptr<TJoiner> > tJoiners;
|
||||
typedef std::vector<uint32_t> MatchedData[LOGICAL_BLOCK_RIDS];
|
||||
boost::shared_array<MatchedData> tSmallSideMatches;
|
||||
void executeTupleJoin();
|
||||
bool getTupleJoinRowGroupData;
|
||||
std::vector<rowgroup::RowGroup> smallSideRGs;
|
||||
rowgroup::RowGroup largeSideRG;
|
||||
boost::shared_array<rowgroup::RGData> smallSideRowData;
|
||||
boost::shared_array<rowgroup::RGData> smallNullRowData;
|
||||
boost::shared_array<rowgroup::Row::Pointer> smallNullPointers;
|
||||
boost::shared_array<uint64_t> ssrdPos; // this keeps track of position when building smallSideRowData
|
||||
boost::shared_array<uint32_t> smallSideRowLengths;
|
||||
boost::shared_array<joblist::JoinType> joinTypes;
|
||||
uint32_t joinerCount;
|
||||
boost::shared_array<uint32_t> tJoinerSizes;
|
||||
// LSKC[i] = the column in outputRG joiner i uses as its key column
|
||||
boost::shared_array<uint32_t> largeSideKeyColumns;
|
||||
// KCPP[i] = true means a joiner uses projection step i as a key column
|
||||
boost::shared_array<bool> keyColumnProj;
|
||||
rowgroup::Row oldRow, newRow; // used by executeTupleJoin()
|
||||
boost::shared_array<uint64_t> joinNullValues;
|
||||
boost::shared_array<bool> doMatchNulls;
|
||||
boost::scoped_array<boost::scoped_ptr<funcexp::FuncExpWrapper> > joinFEFilters;
|
||||
bool hasJoinFEFilters;
|
||||
bool hasSmallOuterJoin;
|
||||
boost::shared_array<boost::shared_ptr<TJoiner> > tJoiners;
|
||||
typedef std::vector<uint32_t> MatchedData[LOGICAL_BLOCK_RIDS];
|
||||
boost::shared_array<MatchedData> tSmallSideMatches;
|
||||
void executeTupleJoin();
|
||||
bool getTupleJoinRowGroupData;
|
||||
std::vector<rowgroup::RowGroup> smallSideRGs;
|
||||
rowgroup::RowGroup largeSideRG;
|
||||
boost::shared_array<rowgroup::RGData> smallSideRowData;
|
||||
boost::shared_array<rowgroup::RGData> smallNullRowData;
|
||||
boost::shared_array<rowgroup::Row::Pointer> smallNullPointers;
|
||||
boost::shared_array<uint64_t> ssrdPos; // this keeps track of position when building smallSideRowData
|
||||
boost::shared_array<uint32_t> smallSideRowLengths;
|
||||
boost::shared_array<joblist::JoinType> joinTypes;
|
||||
uint32_t joinerCount;
|
||||
boost::shared_array<uint32_t> tJoinerSizes;
|
||||
// LSKC[i] = the column in outputRG joiner i uses as its key column
|
||||
boost::shared_array<uint32_t> largeSideKeyColumns;
|
||||
// KCPP[i] = true means a joiner uses projection step i as a key column
|
||||
boost::shared_array<bool> keyColumnProj;
|
||||
rowgroup::Row oldRow, newRow; // used by executeTupleJoin()
|
||||
boost::shared_array<uint64_t> joinNullValues;
|
||||
boost::shared_array<bool> doMatchNulls;
|
||||
boost::scoped_array<boost::scoped_ptr<funcexp::FuncExpWrapper> > joinFEFilters;
|
||||
bool hasJoinFEFilters;
|
||||
bool hasSmallOuterJoin;
|
||||
|
||||
/* extra typeless join vars & fcns*/
|
||||
boost::shared_array<bool> typelessJoin;
|
||||
boost::shared_array<std::vector<uint32_t> > tlLargeSideKeyColumns;
|
||||
boost::shared_array<boost::shared_ptr<TLJoiner> > tlJoiners;
|
||||
boost::shared_array<uint32_t> tlKeyLengths;
|
||||
inline void getJoinResults(const rowgroup::Row &r, uint32_t jIndex, std::vector<uint32_t>& v);
|
||||
// these allocators hold the memory for the keys stored in tlJoiners
|
||||
boost::shared_array<utils::PoolAllocator> storedKeyAllocators;
|
||||
// these allocators hold the memory for the large side keys which are short-lived
|
||||
boost::scoped_array<utils::FixedAllocator> tmpKeyAllocators;
|
||||
/* extra typeless join vars & fcns*/
|
||||
boost::shared_array<bool> typelessJoin;
|
||||
boost::shared_array<std::vector<uint32_t> > tlLargeSideKeyColumns;
|
||||
boost::shared_array<boost::shared_ptr<TLJoiner> > tlJoiners;
|
||||
boost::shared_array<uint32_t> tlKeyLengths;
|
||||
inline void getJoinResults(const rowgroup::Row& r, uint32_t jIndex, std::vector<uint32_t>& v);
|
||||
// these allocators hold the memory for the keys stored in tlJoiners
|
||||
boost::shared_array<utils::PoolAllocator> storedKeyAllocators;
|
||||
// these allocators hold the memory for the large side keys which are short-lived
|
||||
boost::scoped_array<utils::FixedAllocator> tmpKeyAllocators;
|
||||
|
||||
/* PM Aggregation */
|
||||
rowgroup::RowGroup joinedRG; // if there's a join, the rows are formatted with this
|
||||
rowgroup::SP_ROWAGG_PM_t fAggregator;
|
||||
rowgroup::RowGroup fAggregateRG;
|
||||
rowgroup::RGData fAggRowGroupData;
|
||||
//boost::scoped_array<uint8_t> fAggRowGroupData;
|
||||
boost::shared_array<boost::shared_ptr<utils::SimplePool> > _pools;
|
||||
/* PM Aggregation */
|
||||
rowgroup::RowGroup joinedRG; // if there's a join, the rows are formatted with this
|
||||
rowgroup::SP_ROWAGG_PM_t fAggregator;
|
||||
rowgroup::RowGroup fAggregateRG;
|
||||
rowgroup::RGData fAggRowGroupData;
|
||||
//boost::scoped_array<uint8_t> fAggRowGroupData;
|
||||
boost::shared_array<boost::shared_ptr<utils::SimplePool> > _pools;
|
||||
|
||||
/* OR hacks */
|
||||
uint8_t bop; // BOP_AND or BOP_OR
|
||||
bool hasPassThru;
|
||||
uint8_t forHJ;
|
||||
/* OR hacks */
|
||||
uint8_t bop; // BOP_AND or BOP_OR
|
||||
bool hasPassThru;
|
||||
uint8_t forHJ;
|
||||
|
||||
boost::scoped_ptr<funcexp::FuncExpWrapper> fe1, fe2;
|
||||
rowgroup::RowGroup fe1Input, fe2Output, *fe2Input;
|
||||
// note, joinFERG is only for metadata, and is shared between BPPs
|
||||
boost::shared_ptr<rowgroup::RowGroup> joinFERG;
|
||||
boost::scoped_array<uint8_t> joinFERowData;
|
||||
boost::scoped_ptr<rowgroup::RGData> fe1Data, fe2Data; // can probably make these RGDatas not pointers to RGDatas
|
||||
boost::shared_array<int> projectForFE1;
|
||||
boost::shared_array<int> fe1ToProjection, fe2Mapping; // RG mappings
|
||||
boost::scoped_array<boost::shared_array<int> > joinFEMappings;
|
||||
rowgroup::Row fe1In, fe1Out, fe2In, fe2Out, joinFERow;
|
||||
boost::scoped_ptr<funcexp::FuncExpWrapper> fe1, fe2;
|
||||
rowgroup::RowGroup fe1Input, fe2Output, *fe2Input;
|
||||
// note, joinFERG is only for metadata, and is shared between BPPs
|
||||
boost::shared_ptr<rowgroup::RowGroup> joinFERG;
|
||||
boost::scoped_array<uint8_t> joinFERowData;
|
||||
boost::scoped_ptr<rowgroup::RGData> fe1Data, fe2Data; // can probably make these RGDatas not pointers to RGDatas
|
||||
boost::shared_array<int> projectForFE1;
|
||||
boost::shared_array<int> fe1ToProjection, fe2Mapping; // RG mappings
|
||||
boost::scoped_array<boost::shared_array<int> > joinFEMappings;
|
||||
rowgroup::Row fe1In, fe1Out, fe2In, fe2Out, joinFERow;
|
||||
|
||||
bool hasDictStep;
|
||||
bool hasDictStep;
|
||||
|
||||
primitives::PrimitiveProcessor pp;
|
||||
primitives::PrimitiveProcessor pp;
|
||||
|
||||
/* VSS cache members */
|
||||
VSSCache vssCache;
|
||||
void buildVSSCache(uint32_t loopCount);
|
||||
/* VSS cache members */
|
||||
VSSCache vssCache;
|
||||
void buildVSSCache(uint32_t loopCount);
|
||||
|
||||
/* To support limited DEC queues on the PM */
|
||||
boost::shared_ptr<BPPSendThread> sendThread;
|
||||
bool newConnection; // to support the load balancing code in sendThread
|
||||
/* To support limited DEC queues on the PM */
|
||||
boost::shared_ptr<BPPSendThread> sendThread;
|
||||
bool newConnection; // to support the load balancing code in sendThread
|
||||
|
||||
/* To support reentrancy */
|
||||
uint32_t currentBlockOffset;
|
||||
boost::scoped_array<uint64_t> relLBID;
|
||||
boost::scoped_array<bool> asyncLoaded;
|
||||
/* To support reentrancy */
|
||||
uint32_t currentBlockOffset;
|
||||
boost::scoped_array<uint64_t> relLBID;
|
||||
boost::scoped_array<bool> asyncLoaded;
|
||||
|
||||
/* To support a smaller memory footprint when idle */
|
||||
static const uint64_t maxIdleBufferSize = 16*1024*1024; // arbitrary
|
||||
void allocLargeBuffers();
|
||||
void freeLargeBuffers();
|
||||
/* To support a smaller memory footprint when idle */
|
||||
static const uint64_t maxIdleBufferSize = 16 * 1024 * 1024; // arbitrary
|
||||
void allocLargeBuffers();
|
||||
void freeLargeBuffers();
|
||||
|
||||
/* To ensure all packets of an LBID go out the same socket */
|
||||
int sockIndex;
|
||||
/* To ensure all packets of an LBID go out the same socket */
|
||||
int sockIndex;
|
||||
|
||||
/* Shared nothing vars */
|
||||
uint32_t dbRoot;
|
||||
/* Shared nothing vars */
|
||||
uint32_t dbRoot;
|
||||
|
||||
bool endOfJoinerRan;
|
||||
bool endOfJoinerRan;
|
||||
|
||||
friend class Command;
|
||||
friend class ColumnCommand;
|
||||
friend class DictStep;
|
||||
friend class PassThruCommand;
|
||||
friend class RTSCommand;
|
||||
friend class FilterCommand;
|
||||
friend class ScaledFilterCmd;
|
||||
friend class StrFilterCmd;
|
||||
friend class PseudoCC;
|
||||
friend class Command;
|
||||
friend class ColumnCommand;
|
||||
friend class DictStep;
|
||||
friend class PassThruCommand;
|
||||
friend class RTSCommand;
|
||||
friend class FilterCommand;
|
||||
friend class ScaledFilterCmd;
|
||||
friend class StrFilterCmd;
|
||||
friend class PseudoCC;
|
||||
};
|
||||
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user