Coverage Report

Created: 2025-03-12 11:55

/root/doris/be/src/olap/olap_common.h
Line
Count
Source (jump to first uncovered line)
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 <netinet/in.h>
22
23
#include <atomic>
24
#include <charconv>
25
#include <cstdint>
26
#include <functional>
27
#include <list>
28
#include <map>
29
#include <memory>
30
#include <ostream>
31
#include <sstream>
32
#include <string>
33
#include <typeinfo>
34
#include <unordered_map>
35
#include <unordered_set>
36
#include <utility>
37
38
#include "common/config.h"
39
#include "common/exception.h"
40
#include "io/io_common.h"
41
#include "olap/inverted_index_stats.h"
42
#include "olap/olap_define.h"
43
#include "olap/rowset/rowset_fwd.h"
44
#include "util/hash_util.hpp"
45
#include "util/time.h"
46
#include "util/uid_util.h"
47
48
namespace doris {
49
50
static constexpr int64_t MAX_ROWSET_ID = 1L << 56;
51
static constexpr int64_t LOW_56_BITS = 0x00ffffffffffffff;
52
53
using SchemaHash = int32_t;
54
using int128_t = __int128;
55
using uint128_t = unsigned __int128;
56
57
using TabletUid = UniqueId;
58
59
enum CompactionType { BASE_COMPACTION = 1, CUMULATIVE_COMPACTION = 2, FULL_COMPACTION = 3 };
60
61
enum DataDirType {
62
    SPILL_DISK_DIR,
63
    OLAP_DATA_DIR,
64
    DATA_CACHE_DIR,
65
};
66
67
struct DataDirInfo {
68
    std::string path;
69
    size_t path_hash = 0;
70
    int64_t disk_capacity = 1; // actual disk capacity
71
    int64_t available = 0;     // available space, in bytes unit
72
    int64_t local_used_capacity = 0;
73
    int64_t remote_used_capacity = 0;
74
    int64_t trash_used_capacity = 0;
75
    bool is_used = false;                                      // whether available mark
76
    TStorageMedium::type storage_medium = TStorageMedium::HDD; // Storage medium type: SSD|HDD
77
    DataDirType data_dir_type = DataDirType::OLAP_DATA_DIR;
78
    std::string metric_name;
79
};
80
struct PredicateFilterInfo {
81
    int type = 0;
82
    uint64_t input_row = 0;
83
    uint64_t filtered_row = 0;
84
};
85
// Sort DataDirInfo by available space.
86
struct DataDirInfoLessAvailability {
87
7
    bool operator()(const DataDirInfo& left, const DataDirInfo& right) const {
88
7
        return left.available < right.available;
89
7
    }
90
};
91
92
struct TabletInfo {
93
    TabletInfo(TTabletId in_tablet_id, UniqueId in_uid)
94
            : tablet_id(in_tablet_id), tablet_uid(in_uid) {}
95
96
    bool operator<(const TabletInfo& right) const {
97
        if (tablet_id != right.tablet_id) {
98
            return tablet_id < right.tablet_id;
99
        } else {
100
            return tablet_uid < right.tablet_uid;
101
        }
102
    }
103
104
    std::string to_string() const {
105
        std::stringstream ss;
106
        ss << tablet_id << "." << tablet_uid.to_string();
107
        return ss.str();
108
    }
109
110
    TTabletId tablet_id;
111
    UniqueId tablet_uid;
112
};
113
114
struct TabletSize {
115
    TabletSize(TTabletId in_tablet_id, size_t in_tablet_size)
116
0
            : tablet_id(in_tablet_id), tablet_size(in_tablet_size) {}
117
118
    TTabletId tablet_id;
119
    size_t tablet_size;
120
};
121
122
// Define all data types supported by Field.
123
// If new filed_type is defined, not only new TypeInfo may need be defined,
124
// but also some functions like get_type_info in types.cpp need to be changed.
125
enum class FieldType {
126
    OLAP_FIELD_TYPE_TINYINT = 1, // MYSQL_TYPE_TINY
127
    OLAP_FIELD_TYPE_UNSIGNED_TINYINT = 2,
128
    OLAP_FIELD_TYPE_SMALLINT = 3, // MYSQL_TYPE_SHORT
129
    OLAP_FIELD_TYPE_UNSIGNED_SMALLINT = 4,
130
    OLAP_FIELD_TYPE_INT = 5, // MYSQL_TYPE_LONG
131
    OLAP_FIELD_TYPE_UNSIGNED_INT = 6,
132
    OLAP_FIELD_TYPE_BIGINT = 7, // MYSQL_TYPE_LONGLONG
133
    OLAP_FIELD_TYPE_UNSIGNED_BIGINT = 8,
134
    OLAP_FIELD_TYPE_LARGEINT = 9,
135
    OLAP_FIELD_TYPE_FLOAT = 10,  // MYSQL_TYPE_FLOAT
136
    OLAP_FIELD_TYPE_DOUBLE = 11, // MYSQL_TYPE_DOUBLE
137
    OLAP_FIELD_TYPE_DISCRETE_DOUBLE = 12,
138
    OLAP_FIELD_TYPE_CHAR = 13,     // MYSQL_TYPE_STRING
139
    OLAP_FIELD_TYPE_DATE = 14,     // MySQL_TYPE_NEWDATE
140
    OLAP_FIELD_TYPE_DATETIME = 15, // MySQL_TYPE_DATETIME
141
    OLAP_FIELD_TYPE_DECIMAL = 16,  // DECIMAL, using different store format against MySQL
142
    OLAP_FIELD_TYPE_VARCHAR = 17,
143
144
    OLAP_FIELD_TYPE_STRUCT = 18,  // Struct
145
    OLAP_FIELD_TYPE_ARRAY = 19,   // ARRAY
146
    OLAP_FIELD_TYPE_MAP = 20,     // Map
147
    OLAP_FIELD_TYPE_UNKNOWN = 21, // UNKNOW OLAP_FIELD_TYPE_STRING
148
    OLAP_FIELD_TYPE_NONE = 22,
149
    OLAP_FIELD_TYPE_HLL = 23,
150
    OLAP_FIELD_TYPE_BOOL = 24,
151
    OLAP_FIELD_TYPE_OBJECT = 25,
152
    OLAP_FIELD_TYPE_STRING = 26,
153
    OLAP_FIELD_TYPE_QUANTILE_STATE = 27,
154
    OLAP_FIELD_TYPE_DATEV2 = 28,
155
    OLAP_FIELD_TYPE_DATETIMEV2 = 29,
156
    OLAP_FIELD_TYPE_TIMEV2 = 30,
157
    OLAP_FIELD_TYPE_DECIMAL32 = 31,
158
    OLAP_FIELD_TYPE_DECIMAL64 = 32,
159
    OLAP_FIELD_TYPE_DECIMAL128I = 33,
160
    OLAP_FIELD_TYPE_JSONB = 34,
161
    OLAP_FIELD_TYPE_VARIANT = 35,
162
    OLAP_FIELD_TYPE_AGG_STATE = 36,
163
    OLAP_FIELD_TYPE_DECIMAL256 = 37,
164
    OLAP_FIELD_TYPE_IPV4 = 38,
165
    OLAP_FIELD_TYPE_IPV6 = 39,
166
};
167
168
// Define all aggregation methods supported by Field
169
// Note that in practice, not all types can use all the following aggregation methods
170
// For example, it is meaningless to use SUM for the string type (but it will not cause the program to crash)
171
// The implementation of the Field class does not perform such checks, and should be constrained when creating the table
172
enum class FieldAggregationMethod {
173
    OLAP_FIELD_AGGREGATION_NONE = 0,
174
    OLAP_FIELD_AGGREGATION_SUM = 1,
175
    OLAP_FIELD_AGGREGATION_MIN = 2,
176
    OLAP_FIELD_AGGREGATION_MAX = 3,
177
    OLAP_FIELD_AGGREGATION_REPLACE = 4,
178
    OLAP_FIELD_AGGREGATION_HLL_UNION = 5,
179
    OLAP_FIELD_AGGREGATION_UNKNOWN = 6,
180
    OLAP_FIELD_AGGREGATION_BITMAP_UNION = 7,
181
    // Replace if and only if added value is not null
182
    OLAP_FIELD_AGGREGATION_REPLACE_IF_NOT_NULL = 8,
183
    OLAP_FIELD_AGGREGATION_QUANTILE_UNION = 9,
184
    OLAP_FIELD_AGGREGATION_GENERIC = 10
185
};
186
187
enum class PushType {
188
    PUSH_NORMAL = 1,          // for broker/hadoop load, not used any more
189
    PUSH_FOR_DELETE = 2,      // for delete
190
    PUSH_FOR_LOAD_DELETE = 3, // not used any more
191
    PUSH_NORMAL_V2 = 4,       // for spark load
192
};
193
194
constexpr bool field_is_slice_type(const FieldType& field_type) {
195
    return field_type == FieldType::OLAP_FIELD_TYPE_VARCHAR ||
196
           field_type == FieldType::OLAP_FIELD_TYPE_CHAR ||
197
           field_type == FieldType::OLAP_FIELD_TYPE_STRING;
198
}
199
200
0
constexpr bool field_is_numeric_type(const FieldType& field_type) {
201
0
    return field_type == FieldType::OLAP_FIELD_TYPE_INT ||
202
0
           field_type == FieldType::OLAP_FIELD_TYPE_UNSIGNED_INT ||
203
0
           field_type == FieldType::OLAP_FIELD_TYPE_BIGINT ||
204
0
           field_type == FieldType::OLAP_FIELD_TYPE_SMALLINT ||
205
0
           field_type == FieldType::OLAP_FIELD_TYPE_UNSIGNED_TINYINT ||
206
0
           field_type == FieldType::OLAP_FIELD_TYPE_UNSIGNED_SMALLINT ||
207
0
           field_type == FieldType::OLAP_FIELD_TYPE_TINYINT ||
208
0
           field_type == FieldType::OLAP_FIELD_TYPE_DOUBLE ||
209
0
           field_type == FieldType::OLAP_FIELD_TYPE_FLOAT ||
210
0
           field_type == FieldType::OLAP_FIELD_TYPE_DATE ||
211
0
           field_type == FieldType::OLAP_FIELD_TYPE_DATEV2 ||
212
0
           field_type == FieldType::OLAP_FIELD_TYPE_DATETIME ||
213
0
           field_type == FieldType::OLAP_FIELD_TYPE_DATETIMEV2 ||
214
0
           field_type == FieldType::OLAP_FIELD_TYPE_LARGEINT ||
215
0
           field_type == FieldType::OLAP_FIELD_TYPE_DECIMAL ||
216
0
           field_type == FieldType::OLAP_FIELD_TYPE_DECIMAL32 ||
217
0
           field_type == FieldType::OLAP_FIELD_TYPE_DECIMAL64 ||
218
0
           field_type == FieldType::OLAP_FIELD_TYPE_DECIMAL128I ||
219
0
           field_type == FieldType::OLAP_FIELD_TYPE_DECIMAL256 ||
220
0
           field_type == FieldType::OLAP_FIELD_TYPE_BOOL ||
221
0
           field_type == FieldType::OLAP_FIELD_TYPE_IPV4 ||
222
0
           field_type == FieldType::OLAP_FIELD_TYPE_IPV6;
223
0
}
224
225
// <start_version_id, end_version_id>, such as <100, 110>
226
//using Version = std::pair<TupleVersion, TupleVersion>;
227
228
struct Version {
229
    int64_t first;
230
    int64_t second;
231
232
1.82M
    Version(int64_t first_, int64_t second_) : first(first_), second(second_) {}
233
7.74k
    Version() : first(0), second(0) {}
234
235
    static Version mock() {
236
        // Every time SchemaChange is used for external rowing, some temporary versions (such as 999, 1000, 1001) will be written, in order to avoid Cache conflicts, temporary
237
        // The version number takes a BIG NUMBER plus the version number of the current SchemaChange
238
        return Version(1 << 28, 1 << 29);
239
    }
240
241
    friend std::ostream& operator<<(std::ostream& os, const Version& version);
242
243
    bool operator!=(const Version& rhs) const { return first != rhs.first || second != rhs.second; }
244
245
358k
    bool operator==(const Version& rhs) const { return first == rhs.first && second == rhs.second; }
246
247
    bool contains(const Version& other) const {
248
        return first <= other.first && second >= other.second;
249
    }
250
251
813
    std::string to_string() const { return fmt::format("[{}-{}]", first, second); }
252
};
253
254
using Versions = std::vector<Version>;
255
256
10
inline std::ostream& operator<<(std::ostream& os, const Version& version) {
257
10
    return os << version.to_string();
258
10
}
259
260
inline std::ostream& operator<<(std::ostream& os, const Versions& versions) {
261
    for (auto& version : versions) {
262
        os << version;
263
    }
264
    return os;
265
}
266
267
// used for hash-struct of hash_map<Version, Rowset*>.
268
struct HashOfVersion {
269
11.6k
    size_t operator()(const Version& version) const {
270
11.6k
        size_t seed = 0;
271
11.6k
        seed = HashUtil::hash64(&version.first, sizeof(version.first), seed);
272
11.6k
        seed = HashUtil::hash64(&version.second, sizeof(version.second), seed);
273
11.6k
        return seed;
274
11.6k
    }
275
};
276
277
// It is used to represent Graph vertex.
278
struct Vertex {
279
    int64_t value = 0;
280
    std::list<int64_t> edges;
281
282
    Vertex(int64_t v) : value(v) {}
283
};
284
285
class Field;
286
class WrapperField;
287
using KeyRange = std::pair<WrapperField*, WrapperField*>;
288
289
// ReaderStatistics used to collect statistics when scan data from storage
290
struct OlapReaderStatistics {
291
    int64_t io_ns = 0;
292
    int64_t compressed_bytes_read = 0;
293
294
    int64_t decompress_ns = 0;
295
    int64_t uncompressed_bytes_read = 0;
296
297
    // total read bytes in memory
298
    int64_t bytes_read = 0;
299
300
    int64_t block_fetch_ns = 0; // time of rowset reader's `next_batch()` call
301
    int64_t block_load_ns = 0;
302
    int64_t blocks_load = 0;
303
    // Not used any more, will be removed after non-vectorized code is removed
304
    int64_t block_seek_num = 0;
305
    // Not used any more, will be removed after non-vectorized code is removed
306
    int64_t block_seek_ns = 0;
307
308
    // block_load_ns
309
    //      block_init_ns
310
    //          block_init_seek_ns
311
    //          generate_row_ranges_ns
312
    //      predicate_column_read_ns
313
    //          predicate_column_read_seek_ns
314
    //      lazy_read_ns
315
    //          block_lazy_read_seek_ns
316
    int64_t block_init_ns = 0;
317
    int64_t block_init_seek_num = 0;
318
    int64_t block_init_seek_ns = 0;
319
    int64_t predicate_column_read_ns = 0;
320
    int64_t non_predicate_read_ns = 0;
321
    int64_t predicate_column_read_seek_num = 0;
322
    int64_t predicate_column_read_seek_ns = 0;
323
    int64_t lazy_read_ns = 0;
324
    int64_t block_lazy_read_seek_num = 0;
325
    int64_t block_lazy_read_seek_ns = 0;
326
327
    int64_t raw_rows_read = 0;
328
329
    int64_t rows_vec_cond_filtered = 0;
330
    int64_t rows_short_circuit_cond_filtered = 0;
331
    int64_t rows_expr_cond_filtered = 0;
332
    int64_t vec_cond_input_rows = 0;
333
    int64_t short_circuit_cond_input_rows = 0;
334
    int64_t expr_cond_input_rows = 0;
335
    int64_t rows_vec_del_cond_filtered = 0;
336
    int64_t vec_cond_ns = 0;
337
    int64_t short_cond_ns = 0;
338
    int64_t expr_filter_ns = 0;
339
    int64_t output_col_ns = 0;
340
341
    std::map<int, PredicateFilterInfo> filter_info;
342
343
    int64_t rows_key_range_filtered = 0;
344
    int64_t rows_stats_filtered = 0;
345
    int64_t rows_stats_rp_filtered = 0;
346
    int64_t rows_bf_filtered = 0;
347
    int64_t rows_dict_filtered = 0;
348
    // Including the number of rows filtered out according to the Delete information in the Tablet,
349
    // and the number of rows filtered for marked deleted rows under the unique key model.
350
    // This metric is mainly used to record the number of rows filtered by the delete condition in Segment V1,
351
    // and it is also used to record the replaced rows in the Unique key model in the "Reader" class.
352
    // In segmentv2, if you want to get all filtered rows, you need the sum of "rows_del_filtered" and "rows_conditions_filtered".
353
    int64_t rows_del_filtered = 0;
354
    int64_t rows_del_by_bitmap = 0;
355
    // the number of rows filtered by various column indexes.
356
    int64_t rows_conditions_filtered = 0;
357
    int64_t generate_row_ranges_by_keys_ns = 0;
358
    int64_t generate_row_ranges_by_column_conditions_ns = 0;
359
    int64_t generate_row_ranges_by_bf_ns = 0;
360
    int64_t generate_row_ranges_by_zonemap_ns = 0;
361
    int64_t generate_row_ranges_by_dict_ns = 0;
362
363
    int64_t index_load_ns = 0;
364
365
    int64_t total_pages_num = 0;
366
    int64_t cached_pages_num = 0;
367
368
    int64_t rows_bitmap_index_filtered = 0;
369
    int64_t bitmap_index_filter_timer = 0;
370
371
    int64_t rows_inverted_index_filtered = 0;
372
    int64_t inverted_index_filter_timer = 0;
373
    int64_t inverted_index_query_timer = 0;
374
    int64_t inverted_index_query_cache_hit = 0;
375
    int64_t inverted_index_query_cache_miss = 0;
376
    int64_t inverted_index_query_null_bitmap_timer = 0;
377
    int64_t inverted_index_query_bitmap_copy_timer = 0;
378
    int64_t inverted_index_searcher_open_timer = 0;
379
    int64_t inverted_index_searcher_search_timer = 0;
380
    int64_t inverted_index_searcher_cache_hit = 0;
381
    int64_t inverted_index_searcher_cache_miss = 0;
382
    int64_t inverted_index_downgrade_count = 0;
383
    InvertedIndexStatistics inverted_index_stats;
384
385
    int64_t output_index_result_column_timer = 0;
386
    // number of segment filtered by column stat when creating seg iterator
387
    int64_t filtered_segment_number = 0;
388
    // total number of segment
389
    int64_t total_segment_number = 0;
390
391
    io::FileCacheStatistics file_cache_stats;
392
    int64_t load_segments_timer = 0;
393
394
    int64_t collect_iterator_merge_next_timer = 0;
395
    int64_t collect_iterator_normal_next_timer = 0;
396
    int64_t delete_bitmap_get_agg_ns = 0;
397
398
    int64_t tablet_reader_init_timer_ns = 0;
399
    int64_t tablet_reader_capture_rs_readers_timer_ns = 0;
400
    int64_t tablet_reader_init_return_columns_timer_ns = 0;
401
    int64_t tablet_reader_init_keys_param_timer_ns = 0;
402
    int64_t tablet_reader_init_orderby_keys_param_timer_ns = 0;
403
    int64_t tablet_reader_init_conditions_param_timer_ns = 0;
404
    int64_t tablet_reader_init_delete_condition_param_timer_ns = 0;
405
    int64_t block_reader_vcollect_iter_init_timer_ns = 0;
406
    int64_t block_reader_rs_readers_init_timer_ns = 0;
407
    int64_t block_reader_build_heap_init_timer_ns = 0;
408
409
    int64_t rowset_reader_get_segment_iterators_timer_ns = 0;
410
    int64_t rowset_reader_create_iterators_timer_ns = 0;
411
    int64_t rowset_reader_init_iterators_timer_ns = 0;
412
    int64_t rowset_reader_load_segments_timer_ns = 0;
413
414
    int64_t segment_iterator_init_timer_ns = 0;
415
    int64_t segment_iterator_init_return_column_iterators_timer_ns = 0;
416
    int64_t segment_iterator_init_bitmap_index_iterators_timer_ns = 0;
417
    int64_t segment_iterator_init_inverted_index_iterators_timer_ns = 0;
418
419
    int64_t segment_create_column_readers_timer_ns = 0;
420
    int64_t segment_load_index_timer_ns = 0;
421
};
422
423
using ColumnId = uint32_t;
424
// Column unique id set
425
using UniqueIdSet = std::set<uint32_t>;
426
// Column unique Id -> column id map
427
using UniqueIdToColumnIdMap = std::map<ColumnId, ColumnId>;
428
429
// 8 bit rowset id version
430
// 56 bit, inc number from 1
431
// 128 bit backend uid, it is a uuid bit, id version
432
struct RowsetId {
433
    int8_t version = 0;
434
    int64_t hi = 0;
435
    int64_t mi = 0;
436
    int64_t lo = 0;
437
438
11.4k
    void init(std::string_view rowset_id_str) {
439
        // for new rowsetid its a 48 hex string
440
        // if the len < 48, then it is an old format rowset id
441
11.4k
        if (rowset_id_str.length() < 48) [[unlikely]] {
442
69
            int64_t high;
443
69
            auto [_, ec] = std::from_chars(rowset_id_str.data(),
444
69
                                           rowset_id_str.data() + rowset_id_str.length(), high);
445
69
            if (ec != std::errc {}) [[unlikely]] {
446
1
                if (config::force_regenerate_rowsetid_on_start_error) {
447
1
                    LOG(WARNING) << "failed to init rowset id: " << rowset_id_str;
448
1
                    high = MAX_ROWSET_ID - 1;
449
1
                } else {
450
0
                    throw Exception(
451
0
                            Status::FatalError("failed to init rowset id: {}", rowset_id_str));
452
0
                }
453
1
            }
454
69
            init(1, high, 0, 0);
455
11.3k
        } else {
456
11.3k
            int64_t high = 0;
457
11.3k
            int64_t middle = 0;
458
11.3k
            int64_t low = 0;
459
11.3k
            from_hex(&high, rowset_id_str.substr(0, 16));
460
11.3k
            from_hex(&middle, rowset_id_str.substr(16, 16));
461
11.3k
            from_hex(&low, rowset_id_str.substr(32, 16));
462
11.3k
            init(high >> 56, high & LOW_56_BITS, middle, low);
463
11.3k
        }
464
11.4k
    }
465
466
    // to compatible with old version
467
1.08k
    void init(int64_t rowset_id) { init(1, rowset_id, 0, 0); }
468
469
29.0k
    void init(int64_t id_version, int64_t high, int64_t middle, int64_t low) {
470
29.0k
        version = id_version;
471
29.0k
        if (UNLIKELY(high >= MAX_ROWSET_ID)) {
472
0
            throw Exception(Status::FatalError("inc rowsetid is too large:{}", high));
473
0
        }
474
29.0k
        hi = (id_version << 56) + (high & LOW_56_BITS);
475
29.0k
        mi = middle;
476
29.0k
        lo = low;
477
29.0k
    }
478
479
45.8k
    std::string to_string() const {
480
45.8k
        if (version < 2) {
481
25.7k
            return std::to_string(hi & LOW_56_BITS);
482
25.7k
        } else {
483
20.1k
            char buf[48];
484
20.1k
            to_hex(hi, buf);
485
20.1k
            to_hex(mi, buf + 16);
486
20.1k
            to_hex(lo, buf + 32);
487
20.1k
            return {buf, 48};
488
20.1k
        }
489
45.8k
    }
490
491
    // std::unordered_map need this api
492
357k
    bool operator==(const RowsetId& rhs) const {
493
357k
        return hi == rhs.hi && mi == rhs.mi && lo == rhs.lo;
494
357k
    }
495
496
    bool operator!=(const RowsetId& rhs) const {
497
        return hi != rhs.hi || mi != rhs.mi || lo != rhs.lo;
498
    }
499
500
44.8M
    bool operator<(const RowsetId& rhs) const {
501
44.8M
        if (hi != rhs.hi) {
502
4.55M
            return hi < rhs.hi;
503
40.2M
        } else if (mi != rhs.mi) {
504
0
            return mi < rhs.mi;
505
40.2M
        } else {
506
40.2M
            return lo < rhs.lo;
507
40.2M
        }
508
44.8M
    }
509
510
947
    friend std::ostream& operator<<(std::ostream& out, const RowsetId& rowset_id) {
511
947
        out << rowset_id.to_string();
512
947
        return out;
513
947
    }
514
};
515
516
using RowsetIdUnorderedSet = std::unordered_set<RowsetId>;
517
518
// Extract rowset id from filename, return uninitialized rowset id if filename is invalid
519
483
inline RowsetId extract_rowset_id(std::string_view filename) {
520
483
    RowsetId rowset_id;
521
483
    if (filename.ends_with(".dat")) {
522
        // filename format: {rowset_id}_{segment_num}.dat
523
243
        auto end = filename.find('_');
524
243
        if (end == std::string::npos) {
525
0
            return rowset_id;
526
0
        }
527
243
        rowset_id.init(filename.substr(0, end));
528
243
        return rowset_id;
529
243
    }
530
240
    if (filename.ends_with(".idx")) {
531
        // filename format: {rowset_id}_{segment_num}_{index_id}.idx
532
240
        auto end = filename.find('_');
533
240
        if (end == std::string::npos) {
534
0
            return rowset_id;
535
0
        }
536
240
        rowset_id.init(filename.substr(0, end));
537
240
        return rowset_id;
538
240
    }
539
0
    return rowset_id;
540
240
}
541
542
class DeleteBitmap;
543
// merge on write context
544
struct MowContext {
545
    MowContext(int64_t version, int64_t txnid, const RowsetIdUnorderedSet& ids,
546
               std::vector<RowsetSharedPtr> rowset_ptrs, std::shared_ptr<DeleteBitmap> db)
547
            : max_version(version),
548
              txn_id(txnid),
549
              rowset_ids(ids),
550
              rowset_ptrs(std::move(rowset_ptrs)),
551
8
              delete_bitmap(std::move(db)) {}
552
    int64_t max_version;
553
    int64_t txn_id;
554
    const RowsetIdUnorderedSet& rowset_ids;
555
    std::vector<RowsetSharedPtr> rowset_ptrs;
556
    std::shared_ptr<DeleteBitmap> delete_bitmap;
557
};
558
559
// used for controll compaction
560
struct VersionWithTime {
561
    std::atomic<int64_t> version;
562
    int64_t update_ts;
563
564
    VersionWithTime() : version(0), update_ts(MonotonicMillis()) {}
565
566
    void update_version_monoto(int64_t new_version) {
567
        int64_t cur_version = version.load(std::memory_order_relaxed);
568
        while (cur_version < new_version) {
569
            if (version.compare_exchange_strong(cur_version, new_version, std::memory_order_relaxed,
570
                                                std::memory_order_relaxed)) {
571
                update_ts = MonotonicMillis();
572
                break;
573
            }
574
        }
575
    }
576
};
577
578
} // namespace doris
579
580
// This intended to be a "good" hash function.  It may change from time to time.
581
template <>
582
struct std::hash<doris::RowsetId> {
583
1.72k
    size_t operator()(const doris::RowsetId& rowset_id) const {
584
1.72k
        size_t seed = 0;
585
1.72k
        seed = doris::HashUtil::xxHash64WithSeed((const char*)&rowset_id.hi, sizeof(rowset_id.hi),
586
1.72k
                                                 seed);
587
1.72k
        seed = doris::HashUtil::xxHash64WithSeed((const char*)&rowset_id.mi, sizeof(rowset_id.mi),
588
1.72k
                                                 seed);
589
1.72k
        seed = doris::HashUtil::xxHash64WithSeed((const char*)&rowset_id.lo, sizeof(rowset_id.lo),
590
1.72k
                                                 seed);
591
1.72k
        return seed;
592
1.72k
    }
593
};