Coverage Report

Created: 2025-12-04 14:41

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/root/doris/be/src/olap/tablet_schema.h
Line
Count
Source
1
// Licensed to the Apache Software Foundation (ASF) under one
2
// or more contributor license agreements.  See the NOTICE file
3
// distributed with this work for additional information
4
// regarding copyright ownership.  The ASF licenses this file
5
// to you under the Apache License, Version 2.0 (the
6
// "License"); you may not use this file except in compliance
7
// with the License.  You may obtain a copy of the License at
8
//
9
//   http://www.apache.org/licenses/LICENSE-2.0
10
//
11
// Unless required by applicable law or agreed to in writing,
12
// software distributed under the License is distributed on an
13
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
14
// KIND, either express or implied.  See the License for the
15
// specific language governing permissions and limitations
16
// under the License.
17
18
#pragma once
19
20
#include <gen_cpp/Types_types.h>
21
#include <gen_cpp/olap_common.pb.h>
22
#include <gen_cpp/olap_file.pb.h>
23
#include <gen_cpp/segment_v2.pb.h>
24
#include <parallel_hashmap/phmap.h>
25
26
#include <algorithm>
27
#include <cstdint>
28
#include <map>
29
#include <memory>
30
#include <string>
31
#include <unordered_map>
32
#include <unordered_set>
33
#include <utility>
34
#include <vector>
35
36
#include "common/consts.h"
37
#include "common/status.h"
38
#include "olap/inverted_index_parser.h"
39
#include "olap/metadata_adder.h"
40
#include "olap/olap_common.h"
41
#include "olap/rowset/segment_v2/options.h"
42
#include "runtime/define_primitive_type.h"
43
#include "runtime/descriptors.h"
44
#include "runtime/memory/lru_cache_policy.h"
45
#include "udf/udf.h"
46
#include "util/debug_points.h"
47
#include "util/string_parser.hpp"
48
#include "util/string_util.h"
49
#include "vec/aggregate_functions/aggregate_function.h"
50
#include "vec/common/string_ref.h"
51
#include "vec/common/string_utils/string_utils.h"
52
#include "vec/core/types.h"
53
#include "vec/json/path_in_data.h"
54
55
namespace doris {
56
namespace vectorized {
57
class Block;
58
class PathInData;
59
class IDataType;
60
} // namespace vectorized
61
62
#include "common/compile_check_begin.h"
63
64
struct OlapTableIndexSchema;
65
class TColumn;
66
class TOlapTableIndex;
67
class TabletColumn;
68
69
using TabletColumnPtr = std::shared_ptr<TabletColumn>;
70
71
class TabletColumn : public MetadataAdder<TabletColumn> {
72
public:
73
    TabletColumn();
74
    TabletColumn(const ColumnPB& column);
75
    TabletColumn(const TColumn& column);
76
    TabletColumn(FieldAggregationMethod agg, FieldType type);
77
    TabletColumn(FieldAggregationMethod agg, FieldType filed_type, bool is_nullable);
78
    TabletColumn(FieldAggregationMethod agg, FieldType filed_type, bool is_nullable,
79
                 int32_t unique_id, size_t length);
80
81
#ifdef BE_TEST
82
71.4k
    virtual ~TabletColumn() = default;
83
#endif
84
85
    void init_from_pb(const ColumnPB& column);
86
    void init_from_thrift(const TColumn& column);
87
    void to_schema_pb(ColumnPB* column) const;
88
89
267k
    int32_t unique_id() const { return _unique_id; }
90
1.47k
    void set_unique_id(int32_t id) { _unique_id = id; }
91
233k
    const std::string& name() const { return _col_name; }
92
22.4k
    const std::string& name_lower_case() const { return _col_name_lower_case; }
93
4.47k
    void set_name(std::string col_name) {
94
4.47k
        _col_name = col_name;
95
4.47k
        _col_name_lower_case = to_lower(_col_name);
96
4.47k
    }
97
1.10M
    MOCK_FUNCTION FieldType type() const { return _type; }
98
4.78k
    void set_type(FieldType type) { _type = type; }
99
103k
    bool is_key() const { return _is_key; }
100
176k
    bool is_nullable() const { return _is_nullable; }
101
0
    bool is_auto_increment() const { return _is_auto_increment; }
102
0
    bool is_seqeunce_col() const { return _col_name == SEQUENCE_COL; }
103
0
    bool is_on_update_current_timestamp() const { return _is_on_update_current_timestamp; }
104
83.1k
    bool is_variant_type() const { return _type == FieldType::OLAP_FIELD_TYPE_VARIANT; }
105
18.0k
    bool is_bf_column() const { return _is_bf_column; }
106
55.8k
    bool is_array_type() const { return _type == FieldType::OLAP_FIELD_TYPE_ARRAY; }
107
12.5k
    bool is_agg_state_type() const { return _type == FieldType::OLAP_FIELD_TYPE_AGG_STATE; }
108
0
    bool is_jsonb_type() const { return _type == FieldType::OLAP_FIELD_TYPE_JSONB; }
109
0
    bool is_length_variable_type() const {
110
0
        return _type == FieldType::OLAP_FIELD_TYPE_CHAR ||
111
0
               _type == FieldType::OLAP_FIELD_TYPE_VARCHAR ||
112
0
               _type == FieldType::OLAP_FIELD_TYPE_STRING ||
113
0
               _type == FieldType::OLAP_FIELD_TYPE_HLL ||
114
0
               _type == FieldType::OLAP_FIELD_TYPE_BITMAP ||
115
0
               _type == FieldType::OLAP_FIELD_TYPE_QUANTILE_STATE ||
116
0
               _type == FieldType::OLAP_FIELD_TYPE_AGG_STATE;
117
0
    }
118
    // Such columns are not exist in frontend schema info, so we need to
119
    // add them into tablet_schema for later column indexing.
120
    static TabletColumn create_materialized_variant_column(const std::string& root,
121
                                                           const std::vector<std::string>& paths,
122
                                                           int32_t parent_unique_id,
123
                                                           int32_t max_subcolumns_count);
124
193
    bool has_default_value() const { return _has_default_value; }
125
17.9k
    std::string default_value() const { return _default_value; }
126
174k
    int32_t length() const { return _length; }
127
2.24k
    void set_length(int32_t length) { _length = length; }
128
645
    void set_default_value(const std::string& default_value) {
129
645
        _default_value = default_value;
130
645
        _has_default_value = true;
131
645
    }
132
38.4k
    int32_t index_length() const { return _index_length; }
133
1.55k
    void set_index_length(int32_t index_length) { _index_length = index_length; }
134
1.26k
    void set_is_key(bool is_key) { _is_key = is_key; }
135
2.29k
    void set_is_nullable(bool is_nullable) { _is_nullable = is_nullable; }
136
0
    void set_is_auto_increment(bool is_auto_increment) { _is_auto_increment = is_auto_increment; }
137
0
    void set_is_on_update_current_timestamp(bool is_on_update_current_timestamp) {
138
0
        _is_on_update_current_timestamp = is_on_update_current_timestamp;
139
0
    }
140
    void set_path_info(const vectorized::PathInData& path);
141
29.4k
    FieldAggregationMethod aggregation() const { return _aggregation; }
142
    vectorized::AggregateFunctionPtr get_aggregate_function_union(
143
            vectorized::DataTypePtr type, int current_be_exec_version) const;
144
    vectorized::AggregateFunctionPtr get_aggregate_function(std::string suffix,
145
                                                            int current_be_exec_version) const;
146
139k
    int precision() const { return _precision; }
147
139k
    int frac() const { return _frac; }
148
2
    inline bool visible() const { return _visible; }
149
    bool has_char_type() const;
150
151
1.70k
    void set_aggregation_method(FieldAggregationMethod agg) {
152
1.70k
        _aggregation = agg;
153
1.70k
        _aggregation_name = get_string_by_aggregation_type(agg);
154
1.70k
    }
155
156
    /**
157
     * Add a sub column.
158
     */
159
    void add_sub_column(TabletColumn& sub_column);
160
161
20.5k
    uint32_t get_subtype_count() const { return _sub_column_count; }
162
3.38k
    MOCK_FUNCTION const TabletColumn& get_sub_column(uint64_t i) const { return *_sub_columns[i]; }
163
1.04k
    const std::vector<TabletColumnPtr>& get_sub_columns() const { return _sub_columns; }
164
165
    friend bool operator==(const TabletColumn& a, const TabletColumn& b);
166
    friend bool operator!=(const TabletColumn& a, const TabletColumn& b);
167
168
    static std::string get_string_by_field_type(FieldType type);
169
    static std::string get_string_by_aggregation_type(FieldAggregationMethod aggregation_type);
170
    static FieldType get_field_type_by_string(const std::string& str);
171
    static FieldType get_field_type_by_type(PrimitiveType type);
172
    static PrimitiveType get_primitive_type_by_field_type(FieldType type);
173
    static FieldAggregationMethod get_aggregation_type_by_string(const std::string& str);
174
    static uint32_t get_field_length_by_type(TPrimitiveType::type type, uint32_t string_length);
175
    bool is_row_store_column() const;
176
15.9k
    std::string get_aggregation_name() const { return _aggregation_name; }
177
15.9k
    bool get_result_is_nullable() const { return _result_is_nullable; }
178
16.0k
    int get_be_exec_version() const { return _be_exec_version; }
179
76.3k
    bool has_path_info() const { return _column_path != nullptr && !_column_path->empty(); }
180
54.3k
    const vectorized::PathInDataPtr& path_info_ptr() const { return _column_path; }
181
    // If it is an extracted column from variant column
182
199k
    bool is_extracted_column() const {
183
199k
        return _column_path != nullptr && !_column_path->empty() && _parent_col_unique_id > 0;
184
199k
    };
185
28.6k
    std::string suffix_path() const {
186
28.6k
        return is_extracted_column() ? _column_path->get_path() : "";
187
28.6k
    }
188
9
    bool is_nested_subcolumn() const {
189
9
        return _column_path != nullptr && _column_path->has_nested_part();
190
9
    }
191
37.5k
    int32_t parent_unique_id() const { return _parent_col_unique_id; }
192
1.78k
    void set_parent_unique_id(int32_t col_unique_id) { _parent_col_unique_id = col_unique_id; }
193
393
    void set_is_bf_column(bool is_bf_column) { _is_bf_column = is_bf_column; }
194
    std::shared_ptr<const vectorized::IDataType> get_vec_type() const;
195
196
647
    Status check_valid() const {
197
647
        if (type() != FieldType::OLAP_FIELD_TYPE_ARRAY &&
198
647
            type() != FieldType::OLAP_FIELD_TYPE_STRUCT &&
199
647
            type() != FieldType::OLAP_FIELD_TYPE_MAP) {
200
647
            return Status::OK();
201
647
        }
202
0
        if (is_bf_column()) {
203
0
            return Status::NotSupported("Do not support bloom filter index, type={}",
204
0
                                        get_string_by_field_type(type()));
205
0
        }
206
0
        return Status::OK();
207
0
    }
208
209
2
    void set_precision(int precision) {
210
2
        _precision = precision;
211
2
        _is_decimal = true;
212
2
    }
213
214
33
    void set_frac(int frac) { _frac = frac; }
215
216
69
    void set_variant_max_subcolumns_count(int32_t variant_max_subcolumns_count) {
217
69
        _variant_max_subcolumns_count = variant_max_subcolumns_count;
218
69
    }
219
220
13
    void set_variant_enable_typed_paths_to_sparse(bool enable) {
221
13
        _variant_enable_typed_paths_to_sparse = enable;
222
13
    }
223
224
    void set_variant_max_sparse_column_statistics_size(
225
2
            int32_t variant_max_sparse_column_statistics_size) {
226
2
        _variant_max_sparse_column_statistics_size = variant_max_sparse_column_statistics_size;
227
2
    }
228
229
0
    void set_variant_sparse_hash_shard_count(int32_t variant_sparse_hash_shard_count) {
230
0
        _variant_sparse_hash_shard_count = variant_sparse_hash_shard_count;
231
0
    }
232
233
2.09k
    int32_t variant_max_subcolumns_count() const { return _variant_max_subcolumns_count; }
234
235
94
    PatternTypePB pattern_type() const { return _pattern_type; }
236
237
411
    bool variant_enable_typed_paths_to_sparse() const {
238
411
        return _variant_enable_typed_paths_to_sparse;
239
411
    }
240
241
20.7k
    int32_t variant_max_sparse_column_statistics_size() const {
242
20.7k
        return _variant_max_sparse_column_statistics_size;
243
20.7k
    }
244
245
315
    int32_t variant_sparse_hash_shard_count() const { return _variant_sparse_hash_shard_count; }
246
247
31
    bool is_decimal() const { return _is_decimal; }
248
249
private:
250
    int32_t _unique_id = -1;
251
    std::string _col_name;
252
    std::string _col_name_lower_case;
253
    // the field _type will change from TPrimitiveType
254
    // to string by 'EnumToString(TPrimitiveType, tcolumn.column_type.type, data_type);' (reference: TabletMeta::init_column_from_tcolumn)
255
    // to FieldType by 'TabletColumn::get_field_type_by_string' (reference: TabletColumn::init_from_pb).
256
    // And the _type in columnPB is string and it changed from FieldType by 'get_string_by_field_type' (reference: TabletColumn::to_schema_pb).
257
    FieldType _type;
258
    bool _is_key = false;
259
    FieldAggregationMethod _aggregation;
260
    std::string _aggregation_name;
261
    bool _is_nullable = false;
262
    bool _is_auto_increment = false;
263
    bool _is_on_update_current_timestamp {false};
264
265
    bool _has_default_value = false;
266
    std::string _default_value;
267
268
    bool _is_decimal = false;
269
    int32_t _precision = -1;
270
    int32_t _frac = -1;
271
272
    int32_t _length = -1;
273
    int32_t _index_length = -1;
274
275
    bool _is_bf_column = false;
276
277
    bool _visible = true;
278
279
    std::vector<TabletColumnPtr> _sub_columns;
280
    uint32_t _sub_column_count = 0;
281
282
    bool _result_is_nullable = false;
283
    int _be_exec_version = -1;
284
285
    // The extracted sub-columns from "variant" contain the following information:
286
    int32_t _parent_col_unique_id = -1;     // "variant" -> col_unique_id
287
    vectorized::PathInDataPtr _column_path; // the path of the sub-columns themselves
288
289
    int32_t _variant_max_subcolumns_count = 0;
290
    PatternTypePB _pattern_type = PatternTypePB::MATCH_NAME_GLOB;
291
    bool _variant_enable_typed_paths_to_sparse = false;
292
    // set variant_max_sparse_column_statistics_size
293
    int32_t _variant_max_sparse_column_statistics_size =
294
            BeConsts::DEFAULT_VARIANT_MAX_SPARSE_COLUMN_STATS_SIZE;
295
    // default to 0, no shard
296
    int32_t _variant_sparse_hash_shard_count = 0;
297
};
298
299
bool operator==(const TabletColumn& a, const TabletColumn& b);
300
bool operator!=(const TabletColumn& a, const TabletColumn& b);
301
302
class TabletIndex : public MetadataAdder<TabletIndex> {
303
public:
304
7.60k
    TabletIndex() = default;
305
    void init_from_thrift(const TOlapTableIndex& index, const TabletSchema& tablet_schema);
306
    void init_from_thrift(const TOlapTableIndex& index, const std::vector<int32_t>& column_uids);
307
    void init_from_pb(const TabletIndexPB& index);
308
    void to_schema_pb(TabletIndexPB* index) const;
309
310
19.1k
    int64_t index_id() const { return _index_id; }
311
25
    const std::string& index_name() const { return _index_name; }
312
12.0k
    MOCK_FUNCTION IndexType index_type() const { return _index_type; }
313
9.34k
    const std::vector<int32_t>& col_unique_ids() const { return _col_unique_ids; }
314
25.7k
    MOCK_FUNCTION const std::map<std::string, std::string>& properties() const {
315
25.7k
        return _properties;
316
25.7k
    }
317
1
    int32_t get_gram_size() const {
318
1
        if (_properties.contains("gram_size")) {
319
1
            return std::stoi(_properties.at("gram_size"));
320
1
        }
321
322
0
        return 0;
323
1
    }
324
1
    int32_t get_gram_bf_size() const {
325
1
        if (_properties.contains("bf_size")) {
326
1
            return std::stoi(_properties.at("bf_size"));
327
1
        }
328
329
0
        return 0;
330
1
    }
331
332
15.9k
    const std::string& get_index_suffix() const { return _escaped_index_suffix_path; }
333
334
    void set_escaped_escaped_index_suffix_path(const std::string& name);
335
336
2.28k
    bool is_inverted_index() const { return _index_type == IndexType::INVERTED; }
337
338
2
    bool is_ann_index() const { return _index_type == IndexType::ANN; }
339
340
8
    void remove_parser_and_analyzer() {
341
8
        _properties.erase(INVERTED_INDEX_PARSER_KEY);
342
8
        _properties.erase(INVERTED_INDEX_PARSER_KEY_ALIAS);
343
8
        _properties.erase(INVERTED_INDEX_CUSTOM_ANALYZER_KEY);
344
8
    }
345
346
7.48k
    std::string field_pattern() const {
347
7.48k
        if (_properties.contains("field_pattern")) {
348
8
            return _properties.at("field_pattern");
349
8
        }
350
7.47k
        return "";
351
7.48k
    }
352
353
8
    bool is_same_except_id(const TabletIndex* other) const {
354
8
        return _escaped_index_suffix_path == other->_escaped_index_suffix_path &&
355
8
               _index_name == other->_index_name && _index_type == other->_index_type &&
356
8
               _col_unique_ids == other->_col_unique_ids && _properties == other->_properties;
357
8
    }
358
359
private:
360
    int64_t _index_id = -1;
361
    // Identify the different index with the same _index_id
362
    std::string _escaped_index_suffix_path;
363
    std::string _index_name;
364
    IndexType _index_type;
365
    std::vector<int32_t> _col_unique_ids;
366
    std::map<std::string, std::string> _properties;
367
};
368
369
using TabletIndexPtr = std::shared_ptr<TabletIndex>;
370
using TabletIndexes = std::vector<std::shared_ptr<TabletIndex>>;
371
using PathSet = phmap::flat_hash_set<std::string>;
372
373
class TabletSchema : public MetadataAdder<TabletSchema> {
374
public:
375
    enum class ColumnType { NORMAL = 0, DROPPED = 1, VARIANT = 2 };
376
    // TODO(yingchun): better to make constructor as private to avoid
377
    // manually init members incorrectly, and define a new function like
378
    // void create_from_pb(const TabletSchemaPB& schema, TabletSchema* tablet_schema).
379
    TabletSchema();
380
    ~TabletSchema() override;
381
382
    // Init from pb
383
    // ignore_extracted_columns: ignore the extracted columns from variant column
384
    // reuse_cached_column: reuse the cached column in the schema if they are the same, to reduce memory usage
385
    void init_from_pb(const TabletSchemaPB& schema, bool ignore_extracted_columns = false,
386
                      bool reuse_cached_column = false);
387
    // Notice: Use deterministic way to serialize protobuf,
388
    // since serialize Map in protobuf may could lead to un-deterministic by default
389
    template <class PbType>
390
4.40k
    static std::string deterministic_string_serialize(const PbType& pb) {
391
4.40k
        std::string output;
392
4.40k
        google::protobuf::io::StringOutputStream string_output_stream(&output);
393
4.40k
        google::protobuf::io::CodedOutputStream output_stream(&string_output_stream);
394
4.40k
        output_stream.SetSerializationDeterministic(true);
395
4.40k
        pb.SerializeToCodedStream(&output_stream);
396
4.40k
        return output;
397
4.40k
    }
_ZN5doris12TabletSchema30deterministic_string_serializeINS_14TabletSchemaPBEEENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERKT_
Line
Count
Source
390
3.90k
    static std::string deterministic_string_serialize(const PbType& pb) {
391
3.90k
        std::string output;
392
3.90k
        google::protobuf::io::StringOutputStream string_output_stream(&output);
393
3.90k
        google::protobuf::io::CodedOutputStream output_stream(&string_output_stream);
394
3.90k
        output_stream.SetSerializationDeterministic(true);
395
3.90k
        pb.SerializeToCodedStream(&output_stream);
396
3.90k
        return output;
397
3.90k
    }
_ZN5doris12TabletSchema30deterministic_string_serializeINS_8ColumnPBEEENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERKT_
Line
Count
Source
390
340
    static std::string deterministic_string_serialize(const PbType& pb) {
391
340
        std::string output;
392
340
        google::protobuf::io::StringOutputStream string_output_stream(&output);
393
340
        google::protobuf::io::CodedOutputStream output_stream(&string_output_stream);
394
340
        output_stream.SetSerializationDeterministic(true);
395
340
        pb.SerializeToCodedStream(&output_stream);
396
340
        return output;
397
340
    }
_ZN5doris12TabletSchema30deterministic_string_serializeINS_13TabletIndexPBEEENSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEERKT_
Line
Count
Source
390
160
    static std::string deterministic_string_serialize(const PbType& pb) {
391
160
        std::string output;
392
160
        google::protobuf::io::StringOutputStream string_output_stream(&output);
393
160
        google::protobuf::io::CodedOutputStream output_stream(&string_output_stream);
394
160
        output_stream.SetSerializationDeterministic(true);
395
160
        pb.SerializeToCodedStream(&output_stream);
396
160
        return output;
397
160
    }
398
    void to_schema_pb(TabletSchemaPB* tablet_meta_pb) const;
399
    void append_column(TabletColumn column, ColumnType col_type = ColumnType::NORMAL);
400
    void append_index(TabletIndex&& index);
401
    void remove_index(int64_t index_id);
402
    void clear_index();
403
    // Must make sure the row column is always the last column
404
    void add_row_column();
405
    void copy_from(const TabletSchema& tablet_schema);
406
    // lightweight copy, take care of lifecycle of TabletColumn
407
    void shawdow_copy_without_columns(const TabletSchema& tablet_schema);
408
    void update_index_info_from(const TabletSchema& tablet_schema);
409
    std::string to_key() const;
410
    // get_metadata_size is only the memory of the TabletSchema itself, not include child objects.
411
67
    int64_t mem_size() const { return get_metadata_size(); }
412
    size_t row_size() const;
413
    int32_t field_index(const std::string& field_name) const;
414
    int32_t field_index(const vectorized::PathInData& path) const;
415
    int32_t field_index(int32_t col_unique_id) const;
416
    const TabletColumn& column(size_t ordinal) const;
417
    Result<const TabletColumn*> column(const std::string& field_name) const;
418
    Status have_column(const std::string& field_name) const;
419
    bool exist_column(const std::string& field_name) const;
420
    bool has_column_unique_id(int32_t col_unique_id) const;
421
    const TabletColumn& column_by_uid(int32_t col_unique_id) const;
422
    TabletColumn& mutable_column_by_uid(int32_t col_unique_id);
423
    TabletColumn& mutable_column(size_t ordinal);
424
    void replace_column(size_t pos, TabletColumn new_col);
425
    const std::vector<TabletColumnPtr>& columns() const;
426
795k
    size_t num_columns() const { return _num_columns; }
427
1.08M
    size_t num_key_columns() const { return _num_key_columns; }
428
136k
    const std::vector<uint32_t>& cluster_key_uids() const { return _cluster_key_uids; }
429
0
    size_t num_null_columns() const { return _num_null_columns; }
430
5.37k
    size_t num_short_key_columns() const { return _num_short_key_columns; }
431
0
    size_t num_rows_per_row_block() const { return _num_rows_per_row_block; }
432
1.14k
    size_t num_variant_columns() const { return _num_variant_columns; };
433
0
    size_t num_virtual_columns() const { return _num_virtual_columns; }
434
7.12M
    KeysType keys_type() const { return _keys_type; }
435
5.62k
    SortType sort_type() const { return _sort_type; }
436
0
    size_t sort_col_num() const { return _sort_col_num; }
437
0
    CompressKind compress_kind() const { return _compress_kind; }
438
0
    size_t next_column_unique_id() const { return _next_column_unique_id; }
439
4
    bool has_bf_fpp() const { return _has_bf_fpp; }
440
4
    double bloom_filter_fpp() const { return _bf_fpp; }
441
15.7k
    bool is_in_memory() const { return _is_in_memory; }
442
0
    void set_is_in_memory(bool is_in_memory) { _is_in_memory = is_in_memory; }
443
2
    void set_disable_auto_compaction(bool disable_auto_compaction) {
444
2
        _disable_auto_compaction = disable_auto_compaction;
445
2
    }
446
288
    bool disable_auto_compaction() const { return _disable_auto_compaction; }
447
0
    void set_enable_variant_flatten_nested(bool flatten_nested) {
448
0
        _enable_variant_flatten_nested = flatten_nested;
449
0
    }
450
0
    bool variant_flatten_nested() const { return _enable_variant_flatten_nested; }
451
0
    void set_enable_single_replica_compaction(bool enable_single_replica_compaction) {
452
0
        _enable_single_replica_compaction = enable_single_replica_compaction;
453
0
    }
454
356
    bool enable_single_replica_compaction() const { return _enable_single_replica_compaction; }
455
    // indicate if full row store column(all the columns encodes as row) exists
456
0
    bool has_row_store_for_all_columns() const {
457
0
        return _store_row_column && row_columns_uids().empty();
458
0
    }
459
0
    void set_skip_write_index_on_load(bool skip) { _skip_write_index_on_load = skip; }
460
73
    bool skip_write_index_on_load() const { return _skip_write_index_on_load; }
461
8.20k
    int32_t delete_sign_idx() const { return _delete_sign_idx; }
462
143k
    bool has_sequence_col() const { return _sequence_col_idx != -1; }
463
64.7k
    int32_t sequence_col_idx() const { return _sequence_col_idx; }
464
0
    void set_version_col_idx(int32_t version_col_idx) { _version_col_idx = version_col_idx; }
465
0
    int32_t version_col_idx() const { return _version_col_idx; }
466
0
    bool has_skip_bitmap_col() const { return _skip_bitmap_col_idx != -1; }
467
0
    int32_t skip_bitmap_col_idx() const { return _skip_bitmap_col_idx; }
468
5.25k
    segment_v2::CompressionTypePB compression_type() const { return _compression_type; }
469
0
    void set_row_store_page_size(long page_size) { _row_store_page_size = page_size; }
470
0
    long row_store_page_size() const { return _row_store_page_size; }
471
0
    void set_storage_page_size(long storage_page_size) { _storage_page_size = storage_page_size; }
472
15.9k
    long storage_page_size() const { return _storage_page_size; }
473
0
    void set_storage_dict_page_size(long storage_dict_page_size) {
474
0
        _storage_dict_page_size = storage_dict_page_size;
475
0
    }
476
15.9k
    long storage_dict_page_size() const { return _storage_dict_page_size; }
477
0
    bool has_global_row_id() const {
478
0
        for (auto [col_name, _] : _field_name_to_index) {
479
0
            if (col_name.start_with(StringRef(BeConsts::GLOBAL_ROWID_COL.data(),
480
0
                                              BeConsts::GLOBAL_ROWID_COL.size()))) {
481
0
                return true;
482
0
            }
483
0
        }
484
0
        return false;
485
0
    }
486
487
120
    const std::vector<const TabletIndex*> inverted_indexes() const {
488
120
        std::vector<const TabletIndex*> inverted_indexes;
489
1.26k
        for (const auto& index : _indexes) {
490
1.26k
            if (index->index_type() == IndexType::INVERTED) {
491
1.25k
                inverted_indexes.emplace_back(index.get());
492
1.25k
            }
493
1.26k
        }
494
120
        return inverted_indexes;
495
120
    }
496
11.4k
    bool has_inverted_index() const {
497
11.4k
        for (const auto& index : _indexes) {
498
712
            DBUG_EXECUTE_IF("tablet_schema::has_inverted_index", {
499
712
                if (index->col_unique_ids().empty()) {
500
712
                    throw Exception(Status::InternalError("col unique ids cannot be empty"));
501
712
                }
502
712
            });
503
504
712
            if (index->index_type() == IndexType::INVERTED) {
505
                //if index_id == -1, ignore it.
506
706
                if (!index->col_unique_ids().empty() && index->col_unique_ids()[0] >= 0) {
507
706
                    return true;
508
706
                }
509
706
            }
510
712
        }
511
10.7k
        return false;
512
11.4k
    }
513
514
10.7k
    bool has_ann_index() const {
515
10.7k
        for (const auto& index : _indexes) {
516
7
            if (index->index_type() == IndexType::ANN) {
517
5
                if (!index->col_unique_ids().empty() && index->col_unique_ids()[0] >= 0) {
518
5
                    return true;
519
5
                }
520
5
            }
521
7
        }
522
10.7k
        return false;
523
10.7k
    }
524
525
    bool has_inverted_index_with_index_id(int64_t index_id) const;
526
527
    std::vector<const TabletIndex*> inverted_indexs(const TabletColumn& col) const;
528
529
    std::vector<const TabletIndex*> inverted_indexs(int32_t col_unique_id,
530
                                                    const std::string& suffix_path = "") const;
531
    const TabletIndex* ann_index(const TabletColumn& col) const;
532
533
    // Regardless of whether this column supports inverted index
534
    // TabletIndex information will be returned as long as it exists.
535
    const TabletIndex* ann_index(int32_t col_unique_id, const std::string& suffix_path = "") const;
536
537
    std::vector<TabletIndexPtr> inverted_index_by_field_pattern(
538
            int32_t col_unique_id, const std::string& field_pattern) const;
539
540
    bool has_ngram_bf_index(int32_t col_unique_id) const;
541
    const TabletIndex* get_ngram_bf_index(int32_t col_unique_id) const;
542
    const TabletIndex* get_index(int32_t col_unique_id, IndexType index_type,
543
                                 const std::string& suffix_path) const;
544
    void update_indexes_from_thrift(const std::vector<doris::TOlapTableIndex>& indexes);
545
    // If schema version is not set, it should be -1
546
1.56k
    int32_t schema_version() const { return _schema_version; }
547
    void clear_columns();
548
    vectorized::Block create_block(
549
            const std::vector<uint32_t>& return_columns,
550
            const std::unordered_set<uint32_t>* tablet_columns_need_convert_null = nullptr) const;
551
    vectorized::Block create_block(bool ignore_dropped_col = true) const;
552
2
    void set_schema_version(int32_t version) { _schema_version = version; }
553
0
    void set_auto_increment_column(const std::string& auto_increment_column) {
554
0
        _auto_increment_column = auto_increment_column;
555
0
    }
556
0
    std::string auto_increment_column() const { return _auto_increment_column; }
557
558
28
    void set_table_id(int64_t table_id) { _table_id = table_id; }
559
483
    int64_t table_id() const { return _table_id; }
560
28
    void set_db_id(int64_t db_id) { _db_id = db_id; }
561
0
    int64_t db_id() const { return _db_id; }
562
    void build_current_tablet_schema(int64_t index_id, int32_t version,
563
                                     const OlapTableIndexSchema* index,
564
                                     const TabletSchema& out_tablet_schema);
565
566
    // Merge columns that not exit in current schema, these column is dropped in current schema
567
    // but they are useful in some cases. For example,
568
    // 1. origin schema is  ColA, ColB
569
    // 2. insert values     1, 2
570
    // 3. delete where ColB = 2
571
    // 4. drop ColB
572
    // 5. insert values  3
573
    // 6. add column ColB, although it is name ColB, but it is different with previous ColB, the new ColB we name could call ColB'
574
    // 7. insert value  4, 5
575
    // Then the read schema should be ColA, ColB, ColB' because the delete predicate need ColB to remove related data.
576
    // Because they have same name, so that the dropped column should not be added to the map, only with unique id.
577
    void merge_dropped_columns(const TabletSchema& src_schema);
578
579
    bool is_dropped_column(const TabletColumn& col) const;
580
581
    // copy extracted columns from src_schema
582
    void copy_extracted_columns(const TabletSchema& src_schema);
583
584
    // only reserve extracted columns
585
    void reserve_extracted_columns();
586
587
4.04k
    std::string get_all_field_names() const {
588
4.04k
        std::string str = "[";
589
4.04k
        for (auto p : _field_name_to_index) {
590
4.04k
            if (str.size() > 1) {
591
0
                str += ", ";
592
0
            }
593
4.04k
            str += p.first.to_string() + "(" + std::to_string(_cols[p.second]->unique_id()) + ")";
594
4.04k
        }
595
4.04k
        str += "]";
596
4.04k
        return str;
597
4.04k
    }
598
599
    // Dump [(name, type, is_nullable), ...]
600
1
    std::string dump_structure() const {
601
1
        std::string str = "[";
602
15
        for (auto p : _cols) {
603
15
            if (str.size() > 1) {
604
14
                str += ", ";
605
14
            }
606
15
            str += "(";
607
15
            str += p->name();
608
15
            str += ", ";
609
15
            str += TabletColumn::get_string_by_field_type(p->type());
610
15
            str += ", ";
611
15
            str += "is_nullable:";
612
15
            str += (p->is_nullable() ? "true" : "false");
613
15
            str += ")";
614
15
        }
615
1
        str += "]";
616
1
        return str;
617
1
    }
618
619
1
    std::string dump_full_schema() const {
620
1
        std::string str = "[";
621
4
        for (auto p : _cols) {
622
4
            if (str.size() > 1) {
623
3
                str += ", ";
624
3
            }
625
4
            ColumnPB col_pb;
626
4
            p->to_schema_pb(&col_pb);
627
4
            str += "(";
628
4
            str += col_pb.ShortDebugString();
629
4
            str += ")";
630
4
        }
631
1
        str += "]";
632
1
        return str;
633
1
    }
634
635
    vectorized::Block create_block_by_cids(const std::vector<uint32_t>& cids) const;
636
637
    std::shared_ptr<TabletSchema> copy_without_variant_extracted_columns();
638
9.36k
    InvertedIndexStorageFormatPB get_inverted_index_storage_format() const {
639
9.36k
        return _inverted_index_storage_format;
640
9.36k
    }
641
642
    void update_tablet_columns(const TabletSchema& tablet_schema,
643
                               const std::vector<TColumn>& t_columns);
644
645
0
    const std::vector<int32_t>& row_columns_uids() const { return _row_store_column_unique_ids; }
646
647
    int64_t get_metadata_size() const override;
648
649
    struct SubColumnInfo {
650
        TabletColumn column;
651
        TabletIndexes indexes;
652
    };
653
654
    // all path in path_set_info are relative to the parent column
655
    struct PathsSetInfo {
656
        std::unordered_map<std::string, SubColumnInfo> typed_path_set;    // typed columns
657
        std::unordered_map<std::string, TabletIndexes> subcolumn_indexes; // subcolumns indexes
658
        PathSet sub_path_set;                                             // extracted columns
659
        PathSet sparse_path_set;                                          // sparse columns
660
    };
661
662
41
    void set_path_set_info(std::unordered_map<int32_t, PathsSetInfo>&& path_set_info_map) {
663
41
        _path_set_info_map = std::move(path_set_info_map);
664
41
    }
665
666
2
    const PathsSetInfo& path_set_info(int32_t unique_id) const {
667
2
        return _path_set_info_map.at(unique_id);
668
2
    }
669
670
6
    bool need_record_variant_extended_schema() const { return variant_max_subcolumns_count() == 0; }
671
672
11
    int32_t variant_max_subcolumns_count() const {
673
12
        for (const auto& col : _cols) {
674
12
            if (col->is_variant_type()) {
675
7
                return col->variant_max_subcolumns_count();
676
7
            }
677
12
        }
678
4
        return 0;
679
11
    }
680
681
0
    void add_pruned_columns_data_type(int32_t col_unique_id, vectorized::DataTypePtr data_type) {
682
0
        _pruned_columns_data_type[col_unique_id] = std::move(data_type);
683
0
    }
684
685
0
    void clear_pruned_columns_data_type() { _pruned_columns_data_type.clear(); }
686
687
0
    bool has_pruned_columns() const { return !_pruned_columns_data_type.empty(); }
688
689
    // Whether new segments use externalized ColumnMetaPB layout (CMO) by default
690
5.26k
    bool is_external_segment_column_meta_used() const {
691
5.26k
        return _is_external_segment_column_meta_used;
692
5.26k
    }
693
694
25
    void set_external_segment_meta_used_default(bool v) {
695
25
        _is_external_segment_column_meta_used = v;
696
25
    }
697
698
private:
699
    friend bool operator==(const TabletSchema& a, const TabletSchema& b);
700
    friend bool operator!=(const TabletSchema& a, const TabletSchema& b);
701
0
    TabletSchema(const TabletSchema&) = default;
702
703
    KeysType _keys_type = DUP_KEYS;
704
    SortType _sort_type = SortType::LEXICAL;
705
    size_t _sort_col_num = 0;
706
    std::vector<TabletColumnPtr> _cols;
707
708
    std::vector<TabletIndexPtr> _indexes;
709
    std::unordered_map<StringRef, int32_t, StringRefHash> _field_name_to_index;
710
    std::unordered_map<int32_t, int32_t> _field_uniqueid_to_index;
711
    std::unordered_map<vectorized::PathInDataRef, int32_t, vectorized::PathInDataRef::Hash>
712
            _field_path_to_index;
713
714
    // index_type/col_unique_id/suffix -> idxs in _indexes
715
    using IndexKey = std::tuple<IndexType, int32_t, std::string>;
716
    struct IndexKeyHash {
717
56.1k
        size_t operator()(const IndexKey& t) const {
718
56.1k
            uint32_t seed = 0;
719
56.1k
            seed = doris::HashUtil::hash((const char*)&std::get<0>(t), sizeof(std::get<0>(t)),
720
56.1k
                                         seed);
721
56.1k
            seed = doris::HashUtil::hash((const char*)&std::get<1>(t), sizeof(std::get<1>(t)),
722
56.1k
                                         seed);
723
56.1k
            seed = doris::HashUtil::hash((const char*)std::get<2>(t).c_str(),
724
56.1k
                                         static_cast<uint32_t>(std::get<2>(t).size()), seed);
725
56.1k
            return seed;
726
56.1k
        }
727
    };
728
    std::unordered_map<IndexKey, std::vector<size_t>, IndexKeyHash> _col_id_suffix_to_index;
729
730
    int32_t _num_columns = 0;
731
    size_t _num_variant_columns = 0;
732
    size_t _num_virtual_columns = 0;
733
    size_t _num_key_columns = 0;
734
    std::vector<uint32_t> _cluster_key_uids;
735
    size_t _num_null_columns = 0;
736
    size_t _num_short_key_columns = 0;
737
    size_t _num_rows_per_row_block = 0;
738
    CompressKind _compress_kind = COMPRESS_NONE;
739
    segment_v2::CompressionTypePB _compression_type = segment_v2::CompressionTypePB::LZ4F;
740
    long _row_store_page_size = segment_v2::ROW_STORE_PAGE_SIZE_DEFAULT_VALUE;
741
    long _storage_page_size = segment_v2::STORAGE_PAGE_SIZE_DEFAULT_VALUE;
742
    long _storage_dict_page_size = segment_v2::STORAGE_DICT_PAGE_SIZE_DEFAULT_VALUE;
743
    size_t _next_column_unique_id = 0;
744
    std::string _auto_increment_column;
745
746
    bool _has_bf_fpp = false;
747
    double _bf_fpp = 0;
748
    bool _is_in_memory = false;
749
    int32_t _delete_sign_idx = -1;
750
    int32_t _sequence_col_idx = -1;
751
    int32_t _version_col_idx = -1;
752
    int32_t _skip_bitmap_col_idx = -1;
753
    int32_t _schema_version = -1;
754
    int64_t _table_id = -1;
755
    int64_t _db_id = -1;
756
    bool _disable_auto_compaction = false;
757
    bool _enable_single_replica_compaction = false;
758
    bool _store_row_column = false;
759
    bool _skip_write_index_on_load = false;
760
    InvertedIndexStorageFormatPB _inverted_index_storage_format = InvertedIndexStorageFormatPB::V1;
761
762
    // Contains column ids of which columns should be encoded into row store.
763
    // ATTN: For compability reason empty cids means all columns of tablet schema are encoded to row column
764
    std::vector<int32_t> _row_store_column_unique_ids;
765
    bool _enable_variant_flatten_nested = false;
766
767
    std::map<size_t, int32_t> _vir_col_idx_to_unique_id;
768
    std::map<int32_t, vectorized::DataTypePtr> _pruned_columns_data_type;
769
770
    // value: extracted path set and sparse path set
771
    std::unordered_map<int32_t, PathsSetInfo> _path_set_info_map;
772
773
    // key: field_pattern
774
    // value: indexes
775
    using PatternToIndex = std::unordered_map<std::string, std::vector<TabletIndexPtr>>;
776
    std::unordered_map<int32_t, PatternToIndex> _index_by_unique_id_with_pattern;
777
778
    // Default behavior for new segments: use external ColumnMeta region + CMO table if true
779
    bool _is_external_segment_column_meta_used = false;
780
};
781
782
bool operator==(const TabletSchema& a, const TabletSchema& b);
783
bool operator!=(const TabletSchema& a, const TabletSchema& b);
784
785
using TabletSchemaSPtr = std::shared_ptr<TabletSchema>;
786
787
#include "common/compile_check_end.h"
788
} // namespace doris