When partition column's value is NULL, it should be loaded into
the partition which include MIN VALUE
252 lines
7.3 KiB
C++
252 lines
7.3 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.
|
|
|
|
#pragma once
|
|
|
|
#include <cstdint>
|
|
#include <map>
|
|
#include <memory>
|
|
#include <unordered_map>
|
|
#include <vector>
|
|
|
|
#include "common/object_pool.h"
|
|
#include "common/status.h"
|
|
#include "gen_cpp/Descriptors_types.h"
|
|
#include "gen_cpp/descriptors.pb.h"
|
|
#include "runtime/descriptors.h"
|
|
#include "runtime/tuple.h"
|
|
#include "runtime/raw_value.h"
|
|
|
|
namespace doris {
|
|
|
|
class MemPool;
|
|
class MemTracker;
|
|
class RowBatch;
|
|
|
|
struct OlapTableIndexSchema {
|
|
int64_t index_id;
|
|
std::vector<SlotDescriptor*> slots;
|
|
int32_t schema_hash;
|
|
|
|
void to_protobuf(POlapTableIndexSchema* pindex) const;
|
|
};
|
|
|
|
class OlapTableSchemaParam {
|
|
public:
|
|
OlapTableSchemaParam() { }
|
|
~OlapTableSchemaParam() noexcept { }
|
|
|
|
Status init(const TOlapTableSchemaParam& tschema);
|
|
Status init(const POlapTableSchemaParam& pschema);
|
|
|
|
int64_t db_id() const { return _db_id; }
|
|
int64_t table_id() const { return _table_id; }
|
|
int64_t version() const { return _version; }
|
|
|
|
TupleDescriptor* tuple_desc() const { return _tuple_desc; }
|
|
const std::vector<OlapTableIndexSchema*>& indexes() const {
|
|
return _indexes;
|
|
}
|
|
|
|
void to_protobuf(POlapTableSchemaParam* pschema) const;
|
|
|
|
// NOTE: this function is not thread-safe.
|
|
POlapTableSchemaParam* to_protobuf() const {
|
|
if (_proto_schema == nullptr) {
|
|
_proto_schema = _obj_pool.add(new POlapTableSchemaParam());
|
|
to_protobuf(_proto_schema);
|
|
}
|
|
return _proto_schema;
|
|
}
|
|
|
|
std::string debug_string() const;
|
|
|
|
private:
|
|
int64_t _db_id;
|
|
int64_t _table_id;
|
|
int64_t _version;
|
|
|
|
TupleDescriptor* _tuple_desc = nullptr;
|
|
mutable POlapTableSchemaParam* _proto_schema = nullptr;
|
|
std::vector<OlapTableIndexSchema*> _indexes;
|
|
mutable ObjectPool _obj_pool;
|
|
};
|
|
|
|
using OlapTableIndexTablets = TOlapTableIndexTablets;
|
|
// struct TOlapTableIndexTablets {
|
|
// 1: required i64 index_id
|
|
// 2: required list<i64> tablets
|
|
// }
|
|
|
|
struct OlapTablePartition {
|
|
int64_t id = 0;
|
|
Tuple* start_key = nullptr;
|
|
Tuple* end_key = nullptr;
|
|
int64_t num_buckets = 0;
|
|
std::vector<OlapTableIndexTablets> indexes;
|
|
|
|
std::string debug_string(TupleDescriptor* tuple_desc) const;
|
|
};
|
|
|
|
class OlapTablePartKeyComparator {
|
|
public:
|
|
OlapTablePartKeyComparator(SlotDescriptor* slot_desc) : _slot_desc(slot_desc) { }
|
|
// return true if lhs < rhs
|
|
// 'nullptr' is max value, but 'null' is min value
|
|
bool operator()(const Tuple* lhs, const Tuple* rhs) const {
|
|
if (lhs == nullptr) {
|
|
return false;
|
|
} else if (rhs == nullptr) {
|
|
return true;
|
|
}
|
|
|
|
bool lhs_null = lhs->is_null(_slot_desc->null_indicator_offset());
|
|
bool rhs_null = rhs->is_null(_slot_desc->null_indicator_offset());
|
|
if (lhs_null && rhs_null) {
|
|
return false;
|
|
} else if (lhs_null) {
|
|
return true;
|
|
} else if (rhs_null) {
|
|
return false;
|
|
}
|
|
|
|
auto lhs_value = lhs->get_slot(_slot_desc->tuple_offset());
|
|
auto rhs_value = rhs->get_slot(_slot_desc->tuple_offset());
|
|
return RawValue::lt(lhs_value, rhs_value, _slot_desc->type());
|
|
}
|
|
private:
|
|
SlotDescriptor* _slot_desc;
|
|
};
|
|
|
|
// store an olap table's tablet information
|
|
class OlapTablePartitionParam {
|
|
public:
|
|
OlapTablePartitionParam(
|
|
std::shared_ptr<OlapTableSchemaParam> schema,
|
|
const TOlapTablePartitionParam& param);
|
|
~OlapTablePartitionParam();
|
|
|
|
Status init();
|
|
|
|
int64_t db_id() const { return _t_param.db_id; }
|
|
int64_t table_id() const { return _t_param.table_id; }
|
|
int64_t version() const { return _t_param.version; }
|
|
|
|
// return true if we found this tuple in partition
|
|
bool find_tablet(Tuple* tuple,
|
|
const OlapTablePartition** partitions,
|
|
uint32_t* dist_hash) const;
|
|
|
|
const std::vector<OlapTablePartition*>& get_partitions() const {
|
|
return _partitions;
|
|
}
|
|
std::string debug_string() const;
|
|
private:
|
|
Status _create_partition_key(const TExprNode& t_expr, Tuple** part_key);
|
|
|
|
uint32_t _compute_dist_hash(Tuple* key) const;
|
|
|
|
// check if this partition contain this key
|
|
bool _part_contains(OlapTablePartition* part, Tuple* key) const {
|
|
if (part->start_key == nullptr) {
|
|
// start_key is nullptr means the lower bound is boundless
|
|
return true;
|
|
}
|
|
OlapTablePartKeyComparator comparator(_partition_slot_desc);
|
|
return !comparator(key, part->start_key);
|
|
}
|
|
private:
|
|
// this partition only valid in this schema
|
|
std::shared_ptr<OlapTableSchemaParam> _schema;
|
|
TOlapTablePartitionParam _t_param;
|
|
|
|
SlotDescriptor* _partition_slot_desc;
|
|
std::vector<SlotDescriptor*> _distributed_slot_descs;
|
|
|
|
ObjectPool _obj_pool;
|
|
std::unique_ptr<MemTracker> _mem_tracker;
|
|
std::unique_ptr<MemPool> _mem_pool;
|
|
std::vector<OlapTablePartition*> _partitions;
|
|
std::unique_ptr<
|
|
std::map<Tuple*, OlapTablePartition*, OlapTablePartKeyComparator>> _partitions_map;
|
|
};
|
|
|
|
using TabletLocation = TTabletLocation;
|
|
// struct TTabletLocation {
|
|
// 1: required i64 tablet_id
|
|
// 2: required list<i64> node_ids
|
|
// }
|
|
|
|
class OlapTableLocationParam {
|
|
public:
|
|
OlapTableLocationParam(const TOlapTableLocationParam& t_param) : _t_param(t_param) {
|
|
for (auto& location : _t_param.tablets) {
|
|
_tablets.emplace(location.tablet_id, &location);
|
|
}
|
|
}
|
|
|
|
int64_t db_id() const { return _t_param.db_id; }
|
|
int64_t table_id() const { return _t_param.table_id; }
|
|
int64_t version() const { return _t_param.version; }
|
|
|
|
TabletLocation* find_tablet(int64_t id) const {
|
|
auto it = _tablets.find(id);
|
|
if (it != std::end(_tablets)) {
|
|
return it->second;
|
|
}
|
|
return nullptr;
|
|
}
|
|
private:
|
|
TOlapTableLocationParam _t_param;
|
|
|
|
std::unordered_map<int64_t, TabletLocation*> _tablets;
|
|
};
|
|
|
|
struct NodeInfo {
|
|
int64_t id;
|
|
int64_t option;
|
|
std::string host;
|
|
int32_t brpc_port;
|
|
|
|
NodeInfo(const TNodeInfo& tnode)
|
|
: id(tnode.id),
|
|
option(tnode.option),
|
|
host(tnode.host),
|
|
brpc_port(tnode.async_internal_port) {
|
|
}
|
|
};
|
|
|
|
class DorisNodesInfo {
|
|
public:
|
|
DorisNodesInfo(const TPaloNodesInfo& t_nodes) {
|
|
for (auto& node : t_nodes.nodes) {
|
|
_nodes.emplace(node.id, node);
|
|
}
|
|
}
|
|
const NodeInfo* find_node(int64_t id) const {
|
|
auto it = _nodes.find(id);
|
|
if (it != std::end(_nodes)) {
|
|
return &it->second;
|
|
}
|
|
return nullptr;
|
|
}
|
|
private:
|
|
std::unordered_map<int64_t, NodeInfo> _nodes;
|
|
};
|
|
|
|
}
|