e17aef9467
Modify the implementation of MemTracker: 1. Simplify a lot of useless logic; 2. Added MemTrackerTaskPool, as the ancestor of all query and import trackers, This is used to track the local memory usage of all tasks executing; 3. Add cosume/release cache, trigger a cosume/release when the memory accumulation exceeds the parameter mem_tracker_consume_min_size_bytes; 4. Add a new memory leak detection mode (Experimental feature), throw an exception when the remaining statistical value is greater than the specified range when the MemTracker is destructed, and print the accurate statistical value in HTTP, the parameter memory_leak_detection 5. Added Virtual MemTracker, cosume/release will not sync to parent. It will be used when introducing TCMalloc Hook to record memory later, to record the specified memory independently; 6. Modify the GC logic, register the buffer cached in DiskIoMgr as a GC function, and add other GC functions later; 7. Change the global root node from Root MemTracker to Process MemTracker, and remove Process MemTracker in exec_env; 8. Modify the macro that detects whether the memory has reached the upper limit, modify the parameters and default behavior of creating MemTracker, modify the error message format in mem_limit_exceeded, extend and apply transfer_to, remove Metric in MemTracker, etc.; Modify where MemTracker is used: 1. MemPool adds a constructor to create a temporary tracker to avoid a lot of redundant code; 2. Added trackers for global objects such as ChunkAllocator and StorageEngine; 3. Added more fine-grained trackers such as ExprContext; 4. RuntimeState removes FragmentMemTracker, that is, PlanFragmentExecutor mem_tracker, which was previously used for independent statistical scan process memory, and replaces it with _scanner_mem_tracker in OlapScanNode; 5. MemTracker is no longer recorded in ReservationTracker, and ReservationTracker will be removed later;
360 lines
15 KiB
C++
360 lines
15 KiB
C++
// Licensed to the Apache Software Foundation (ASF) under one
|
|
// or more contributor license agreements. See the NOTICE file
|
|
// distributed with this work for additional information
|
|
// regarding copyright ownership. The ASF licenses this file
|
|
// to you under the Apache License, Version 2.0 (the
|
|
// "License"); you may not use this file except in compliance
|
|
// with the License. You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing,
|
|
// software distributed under the License is distributed on an
|
|
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
|
|
// KIND, either express or implied. See the License for the
|
|
// specific language governing permissions and limitations
|
|
// under the License.
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
#include "gen_cpp/olap_file.pb.h"
|
|
#include "gtest/gtest.h"
|
|
#include "olap/comparison_predicate.h"
|
|
#include "olap/data_dir.h"
|
|
#include "olap/row_block.h"
|
|
#include "olap/row_cursor.h"
|
|
#include "olap/rowset/beta_rowset_reader.h"
|
|
#include "olap/rowset/rowset_factory.h"
|
|
#include "olap/rowset/rowset_reader_context.h"
|
|
#include "olap/rowset/rowset_writer.h"
|
|
#include "olap/rowset/rowset_writer_context.h"
|
|
#include "olap/storage_engine.h"
|
|
#include "olap/tablet_schema.h"
|
|
#include "olap/utils.h"
|
|
#include "runtime/exec_env.h"
|
|
#include "runtime/mem_pool.h"
|
|
#include "runtime/mem_tracker.h"
|
|
#include "util/file_utils.h"
|
|
#include "util/slice.h"
|
|
|
|
using std::string;
|
|
|
|
namespace doris {
|
|
|
|
static const uint32_t MAX_PATH_LEN = 1024;
|
|
StorageEngine* k_engine = nullptr;
|
|
|
|
class BetaRowsetTest : public testing::Test {
|
|
protected:
|
|
OlapReaderStatistics _stats;
|
|
|
|
void SetUp() override {
|
|
config::tablet_map_shard_size = 1;
|
|
config::txn_map_shard_size = 1;
|
|
config::txn_shard_size = 1;
|
|
char buffer[MAX_PATH_LEN];
|
|
getcwd(buffer, MAX_PATH_LEN);
|
|
config::storage_root_path = std::string(buffer) + "/data_test";
|
|
|
|
ASSERT_TRUE(FileUtils::remove_all(config::storage_root_path).ok());
|
|
ASSERT_TRUE(FileUtils::create_dir(config::storage_root_path).ok());
|
|
|
|
std::vector<StorePath> paths;
|
|
paths.emplace_back(config::storage_root_path, -1);
|
|
|
|
doris::EngineOptions options;
|
|
options.store_paths = paths;
|
|
Status s = doris::StorageEngine::open(options, &k_engine);
|
|
ASSERT_TRUE(s.ok()) << s.to_string();
|
|
|
|
ExecEnv* exec_env = doris::ExecEnv::GetInstance();
|
|
exec_env->set_storage_engine(k_engine);
|
|
|
|
const std::string rowset_dir = "./data_test/data/beta_rowset_test";
|
|
ASSERT_TRUE(FileUtils::create_dir(rowset_dir).ok());
|
|
}
|
|
|
|
void TearDown() override {
|
|
if (FileUtils::check_exist(config::storage_root_path)) {
|
|
ASSERT_TRUE(FileUtils::remove_all(config::storage_root_path).ok());
|
|
}
|
|
}
|
|
|
|
// (k1 int, k2 varchar(20), k3 int) duplicated key (k1, k2)
|
|
void create_tablet_schema(TabletSchema* tablet_schema) {
|
|
TabletSchemaPB tablet_schema_pb;
|
|
tablet_schema_pb.set_keys_type(DUP_KEYS);
|
|
tablet_schema_pb.set_num_short_key_columns(2);
|
|
tablet_schema_pb.set_num_rows_per_row_block(1024);
|
|
tablet_schema_pb.set_compress_kind(COMPRESS_NONE);
|
|
tablet_schema_pb.set_next_column_unique_id(4);
|
|
|
|
ColumnPB* column_1 = tablet_schema_pb.add_column();
|
|
column_1->set_unique_id(1);
|
|
column_1->set_name("k1");
|
|
column_1->set_type("INT");
|
|
column_1->set_is_key(true);
|
|
column_1->set_length(4);
|
|
column_1->set_index_length(4);
|
|
column_1->set_is_nullable(true);
|
|
column_1->set_is_bf_column(false);
|
|
|
|
ColumnPB* column_2 = tablet_schema_pb.add_column();
|
|
column_2->set_unique_id(2);
|
|
column_2->set_name("k2");
|
|
column_2->set_type(
|
|
"INT"); // TODO change to varchar(20) when dict encoding for string is supported
|
|
column_2->set_length(4);
|
|
column_2->set_index_length(4);
|
|
column_2->set_is_nullable(true);
|
|
column_2->set_is_key(true);
|
|
column_2->set_is_nullable(true);
|
|
column_2->set_is_bf_column(false);
|
|
|
|
ColumnPB* column_3 = tablet_schema_pb.add_column();
|
|
column_3->set_unique_id(3);
|
|
column_3->set_name("v1");
|
|
column_3->set_type("INT");
|
|
column_3->set_length(4);
|
|
column_3->set_is_key(false);
|
|
column_3->set_is_nullable(false);
|
|
column_3->set_is_bf_column(false);
|
|
column_3->set_aggregation("SUM");
|
|
|
|
tablet_schema->init_from_pb(tablet_schema_pb);
|
|
}
|
|
|
|
void create_rowset_writer_context(TabletSchema* tablet_schema,
|
|
RowsetWriterContext* rowset_writer_context) {
|
|
RowsetId rowset_id;
|
|
rowset_id.init(10000);
|
|
rowset_writer_context->rowset_id = rowset_id;
|
|
rowset_writer_context->tablet_id = 12345;
|
|
rowset_writer_context->tablet_schema_hash = 1111;
|
|
rowset_writer_context->partition_id = 10;
|
|
rowset_writer_context->rowset_type = BETA_ROWSET;
|
|
rowset_writer_context->path_desc.filepath = "./data_test/data/beta_rowset_test";
|
|
rowset_writer_context->rowset_state = VISIBLE;
|
|
rowset_writer_context->tablet_schema = tablet_schema;
|
|
rowset_writer_context->version.first = 10;
|
|
rowset_writer_context->version.second = 10;
|
|
}
|
|
|
|
void create_and_init_rowset_reader(Rowset* rowset, RowsetReaderContext& context,
|
|
RowsetReaderSharedPtr* result) {
|
|
auto s = rowset->create_reader(result);
|
|
ASSERT_EQ(OLAP_SUCCESS, s);
|
|
ASSERT_TRUE(*result != nullptr);
|
|
|
|
s = (*result)->init(&context);
|
|
ASSERT_EQ(OLAP_SUCCESS, s);
|
|
}
|
|
};
|
|
|
|
TEST_F(BetaRowsetTest, BasicFunctionTest) {
|
|
OLAPStatus s;
|
|
TabletSchema tablet_schema;
|
|
create_tablet_schema(&tablet_schema);
|
|
|
|
RowsetSharedPtr rowset;
|
|
const int num_segments = 3;
|
|
const uint32_t rows_per_segment = 4096;
|
|
{ // write `num_segments * rows_per_segment` rows to rowset
|
|
RowsetWriterContext writer_context;
|
|
create_rowset_writer_context(&tablet_schema, &writer_context);
|
|
|
|
std::unique_ptr<RowsetWriter> rowset_writer;
|
|
s = RowsetFactory::create_rowset_writer(writer_context, &rowset_writer);
|
|
ASSERT_EQ(OLAP_SUCCESS, s);
|
|
|
|
RowCursor input_row;
|
|
input_row.init(tablet_schema);
|
|
|
|
// for segment "i", row "rid"
|
|
// k1 := rid*10 + i
|
|
// k2 := k1 * 10
|
|
// k3 := 4096 * i + rid
|
|
for (int i = 0; i < num_segments; ++i) {
|
|
MemPool mem_pool("BetaRowsetTest");
|
|
for (int rid = 0; rid < rows_per_segment; ++rid) {
|
|
uint32_t k1 = rid * 10 + i;
|
|
uint32_t k2 = k1 * 10;
|
|
uint32_t k3 = rows_per_segment * i + rid;
|
|
input_row.set_field_content(0, reinterpret_cast<char*>(&k1), &mem_pool);
|
|
input_row.set_field_content(1, reinterpret_cast<char*>(&k2), &mem_pool);
|
|
input_row.set_field_content(2, reinterpret_cast<char*>(&k3), &mem_pool);
|
|
s = rowset_writer->add_row(input_row);
|
|
ASSERT_EQ(OLAP_SUCCESS, s);
|
|
}
|
|
s = rowset_writer->flush();
|
|
ASSERT_EQ(OLAP_SUCCESS, s);
|
|
}
|
|
|
|
rowset = rowset_writer->build();
|
|
ASSERT_TRUE(rowset != nullptr);
|
|
ASSERT_EQ(num_segments, rowset->rowset_meta()->num_segments());
|
|
ASSERT_EQ(num_segments * rows_per_segment, rowset->rowset_meta()->num_rows());
|
|
}
|
|
|
|
{ // test return ordered results and return k1 and k2
|
|
RowsetReaderContext reader_context;
|
|
reader_context.tablet_schema = &tablet_schema;
|
|
reader_context.need_ordered_result = true;
|
|
std::vector<uint32_t> return_columns = {0, 1};
|
|
reader_context.return_columns = &return_columns;
|
|
reader_context.seek_columns = &return_columns;
|
|
reader_context.stats = &_stats;
|
|
|
|
// without predicates
|
|
{
|
|
RowsetReaderSharedPtr rowset_reader;
|
|
create_and_init_rowset_reader(rowset.get(), reader_context, &rowset_reader);
|
|
RowBlock* output_block;
|
|
uint32_t num_rows_read = 0;
|
|
while ((s = rowset_reader->next_block(&output_block)) == OLAP_SUCCESS) {
|
|
ASSERT_TRUE(output_block != nullptr);
|
|
ASSERT_GT(output_block->row_num(), 0);
|
|
ASSERT_EQ(0, output_block->pos());
|
|
ASSERT_EQ(output_block->row_num(), output_block->limit());
|
|
ASSERT_EQ(return_columns, output_block->row_block_info().column_ids);
|
|
// after sort merge segments, k1 will be 0, 1, 2, 10, 11, 12, 20, 21, 22, ..., 40950, 40951, 40952
|
|
for (int i = 0; i < output_block->row_num(); ++i) {
|
|
char* field1 = output_block->field_ptr(i, 0);
|
|
char* field2 = output_block->field_ptr(i, 1);
|
|
// test null bit
|
|
ASSERT_FALSE(*reinterpret_cast<bool*>(field1));
|
|
ASSERT_FALSE(*reinterpret_cast<bool*>(field2));
|
|
uint32_t k1 = *reinterpret_cast<uint32_t*>(field1 + 1);
|
|
uint32_t k2 = *reinterpret_cast<uint32_t*>(field2 + 1);
|
|
ASSERT_EQ(k1 * 10, k2);
|
|
|
|
int rid = num_rows_read / 3;
|
|
int seg_id = num_rows_read % 3;
|
|
ASSERT_EQ(rid * 10 + seg_id, k1);
|
|
num_rows_read++;
|
|
}
|
|
}
|
|
EXPECT_EQ(OLAP_ERR_DATA_EOF, s);
|
|
EXPECT_TRUE(output_block == nullptr);
|
|
EXPECT_EQ(rowset->rowset_meta()->num_rows(), num_rows_read);
|
|
}
|
|
|
|
// merge segments with predicates
|
|
{
|
|
std::vector<ColumnPredicate*> column_predicates;
|
|
// column predicate: k1 = 10
|
|
std::unique_ptr<ColumnPredicate> predicate(new EqualPredicate<int32_t>(0, 10));
|
|
column_predicates.emplace_back(predicate.get());
|
|
reader_context.predicates = &column_predicates;
|
|
RowsetReaderSharedPtr rowset_reader;
|
|
create_and_init_rowset_reader(rowset.get(), reader_context, &rowset_reader);
|
|
RowBlock* output_block;
|
|
uint32_t num_rows_read = 0;
|
|
while ((s = rowset_reader->next_block(&output_block)) == OLAP_SUCCESS) {
|
|
ASSERT_TRUE(output_block != nullptr);
|
|
ASSERT_EQ(1, output_block->row_num());
|
|
ASSERT_EQ(0, output_block->pos());
|
|
ASSERT_EQ(output_block->row_num(), output_block->limit());
|
|
ASSERT_EQ(return_columns, output_block->row_block_info().column_ids);
|
|
// after sort merge segments, k1 will be 10
|
|
for (int i = 0; i < output_block->row_num(); ++i) {
|
|
char* field1 = output_block->field_ptr(i, 0);
|
|
char* field2 = output_block->field_ptr(i, 1);
|
|
// test null bit
|
|
ASSERT_FALSE(*reinterpret_cast<bool*>(field1));
|
|
ASSERT_FALSE(*reinterpret_cast<bool*>(field2));
|
|
uint32_t k1 = *reinterpret_cast<uint32_t*>(field1 + 1);
|
|
uint32_t k2 = *reinterpret_cast<uint32_t*>(field2 + 1);
|
|
ASSERT_EQ(10, k1);
|
|
ASSERT_EQ(k1 * 10, k2);
|
|
num_rows_read++;
|
|
}
|
|
}
|
|
EXPECT_EQ(OLAP_ERR_DATA_EOF, s);
|
|
EXPECT_TRUE(output_block == nullptr);
|
|
EXPECT_EQ(1, num_rows_read);
|
|
}
|
|
}
|
|
|
|
{ // test return unordered data and only k3
|
|
RowsetReaderContext reader_context;
|
|
reader_context.tablet_schema = &tablet_schema;
|
|
reader_context.need_ordered_result = false;
|
|
std::vector<uint32_t> return_columns = {2};
|
|
reader_context.return_columns = &return_columns;
|
|
reader_context.seek_columns = &return_columns;
|
|
reader_context.stats = &_stats;
|
|
|
|
// without predicate
|
|
{
|
|
RowsetReaderSharedPtr rowset_reader;
|
|
create_and_init_rowset_reader(rowset.get(), reader_context, &rowset_reader);
|
|
|
|
RowBlock* output_block;
|
|
uint32_t num_rows_read = 0;
|
|
while ((s = rowset_reader->next_block(&output_block)) == OLAP_SUCCESS) {
|
|
ASSERT_TRUE(output_block != nullptr);
|
|
ASSERT_GT(output_block->row_num(), 0);
|
|
ASSERT_EQ(0, output_block->pos());
|
|
ASSERT_EQ(output_block->row_num(), output_block->limit());
|
|
ASSERT_EQ(return_columns, output_block->row_block_info().column_ids);
|
|
// for unordered result, k3 will be 0, 1, 2, ..., 4096*3-1
|
|
for (int i = 0; i < output_block->row_num(); ++i) {
|
|
char* field3 = output_block->field_ptr(i, 2);
|
|
// test null bit
|
|
ASSERT_FALSE(*reinterpret_cast<bool*>(field3));
|
|
uint32_t k3 = *reinterpret_cast<uint32_t*>(field3 + 1);
|
|
ASSERT_EQ(num_rows_read, k3);
|
|
num_rows_read++;
|
|
}
|
|
}
|
|
EXPECT_EQ(OLAP_ERR_DATA_EOF, s);
|
|
EXPECT_TRUE(output_block == nullptr);
|
|
EXPECT_EQ(rowset->rowset_meta()->num_rows(), num_rows_read);
|
|
}
|
|
|
|
// with predicate
|
|
{
|
|
std::vector<ColumnPredicate*> column_predicates;
|
|
// column predicate: k3 < 100
|
|
ColumnPredicate* predicate = new LessPredicate<int32_t>(2, 100);
|
|
column_predicates.emplace_back(predicate);
|
|
reader_context.predicates = &column_predicates;
|
|
RowsetReaderSharedPtr rowset_reader;
|
|
create_and_init_rowset_reader(rowset.get(), reader_context, &rowset_reader);
|
|
|
|
RowBlock* output_block;
|
|
uint32_t num_rows_read = 0;
|
|
while ((s = rowset_reader->next_block(&output_block)) == OLAP_SUCCESS) {
|
|
ASSERT_TRUE(output_block != nullptr);
|
|
ASSERT_LE(output_block->row_num(), 100);
|
|
ASSERT_EQ(0, output_block->pos());
|
|
ASSERT_EQ(output_block->row_num(), output_block->limit());
|
|
ASSERT_EQ(return_columns, output_block->row_block_info().column_ids);
|
|
// for unordered result, k3 will be 0, 1, 2, ..., 99
|
|
for (int i = 0; i < output_block->row_num(); ++i) {
|
|
char* field3 = output_block->field_ptr(i, 2);
|
|
// test null bit
|
|
ASSERT_FALSE(*reinterpret_cast<bool*>(field3));
|
|
uint32_t k3 = *reinterpret_cast<uint32_t*>(field3 + 1);
|
|
ASSERT_EQ(num_rows_read, k3);
|
|
num_rows_read++;
|
|
}
|
|
}
|
|
EXPECT_EQ(OLAP_ERR_DATA_EOF, s);
|
|
EXPECT_TRUE(output_block == nullptr);
|
|
EXPECT_EQ(100, num_rows_read);
|
|
delete predicate;
|
|
}
|
|
}
|
|
}
|
|
|
|
} // namespace doris
|
|
|
|
int main(int argc, char** argv) {
|
|
doris::StoragePageCache::create_global_cache(1 << 30, 10);
|
|
doris::SegmentLoader::create_global_instance(1000);
|
|
::testing::InitGoogleTest(&argc, argv);
|
|
return RUN_ALL_TESTS();
|
|
}
|