1
0
mirror of https://github.com/mariadb-corporation/mariadb-columnstore-engine.git synced 2025-08-04 05:02:11 +03:00
Files
mariadb-columnstore-engine/primitives/linux-port/primitiveprocessor.cpp
Leonid Fedorov 82421c208f chore(ci): collect asan ubsan and libc++ build with mtr and regression status ignored (#3672)
* MSan added with fixes for libc++

* libc++ sepatare build

* add libc++ to ci

* libstdc++ in CI

* libcpp and msan to external projects

* std::sqrt

* awful_hack(ci): install whole llvm instead of libc++ in terrible way for test containers

* Adding ddeb packages for teststages and repos

* libc++ more for test container

* save some money on debug

* colored coredumps

* revert ci

* chore(ci): collect asan ubsan and libc++ build with mtr and regression status ignored
2025-07-31 00:32:32 +04:00

74 lines
2.0 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: primitiveprocessor.cpp 2035 2013-01-21 14:12:19Z rdempsey $
*
****************************************************************************/
// #define NDEBUG
#include <cassert>
#ifdef __linux__
#include <sys/types.h>
#endif
#include "primitiveprocessor.h"
using namespace std;
namespace primitives
{
PrimitiveProcessor::PrimitiveProcessor(int debugLevel)
: fDebugLevel(debugLevel), fStatsPtr(NULL), logicalBlockMode(false)
{
// This does
// masks[11] = { 0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023 };
int acc, i;
for (acc = 0, i = 0; i < 11; i++)
{
masks[i] = acc;
acc = acc << 1 | 1;
}
}
PrimitiveProcessor::~PrimitiveProcessor()
{
}
void PrimitiveProcessor::setParsedColumnFilter(boost::shared_ptr<ParsedColumnFilter> pcf)
{
parsedColumnFilter = pcf;
}
ParsedColumnFilter::ParsedColumnFilter() : columnFilterMode(ALWAYS_TRUE), mFilterCount(0)
{
}
ParsedColumnFilter::ParsedColumnFilter(const uint32_t aFilterCount, const int BOP)
: columnFilterMode(ALWAYS_TRUE), mFilterCount(aFilterCount), mBOP(BOP)
{
prestored_rfs.reset(new uint8_t[mFilterCount]);
prestored_cops.reset(new uint8_t[mFilterCount]);
}
ParsedColumnFilter::~ParsedColumnFilter()
{
}
} // namespace primitives