be/src/storage/rowset/rowset_meta.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 | | #ifndef DORIS_BE_SRC_OLAP_ROWSET_ROWSET_META_H |
19 | | #define DORIS_BE_SRC_OLAP_ROWSET_ROWSET_META_H |
20 | | |
21 | | #include <gen_cpp/olap_file.pb.h> |
22 | | #include <glog/logging.h> |
23 | | |
24 | | #include <atomic> |
25 | | #include <chrono> |
26 | | #include <cstdint> |
27 | | #include <memory> |
28 | | #include <string> |
29 | | #include <vector> |
30 | | |
31 | | #include "common/cast_set.h" |
32 | | #include "common/config.h" |
33 | | #include "common/status.h" |
34 | | #include "io/fs/encrypted_fs_factory.h" |
35 | | #include "io/fs/file_system.h" |
36 | | #include "runtime/memory/lru_cache_policy.h" |
37 | | #include "storage/metadata_adder.h" |
38 | | #include "storage/olap_common.h" |
39 | | #include "storage/rowset/rowset_fwd.h" |
40 | | #include "storage/storage_policy.h" |
41 | | #include "storage/tablet/tablet_fwd.h" |
42 | | #include "util/once.h" |
43 | | |
44 | | namespace doris { |
45 | | |
46 | | class RowsetMeta : public MetadataAdder<RowsetMeta> { |
47 | | public: |
48 | 28.1k | RowsetMeta() = default; |
49 | | ~RowsetMeta(); |
50 | | |
51 | | bool init(std::string_view pb_rowset_meta); |
52 | | |
53 | | bool init(const RowsetMeta* rowset_meta); |
54 | | |
55 | | bool init_from_pb(const RowsetMetaPB& rowset_meta_pb); |
56 | | |
57 | | bool init_from_json(const std::string& json_rowset_meta); |
58 | | |
59 | 6 | bool serialize(std::string* value) { return _serialize_to_pb(value); } |
60 | | |
61 | | bool json_rowset_meta(std::string* json_rowset_meta); |
62 | | |
63 | | // If the rowset is a local rowset, return the global local file system. |
64 | | // Otherwise, return the remote file system corresponding to rowset's resource id. |
65 | | // Note that if the resource id cannot be found for the corresponding remote file system, nullptr will be returned. |
66 | | MOCK_FUNCTION io::FileSystemSPtr fs(); |
67 | | |
68 | | io::FileSystemSPtr physical_fs(); |
69 | | |
70 | | Result<const StorageResource*> remote_storage_resource(); |
71 | | |
72 | | void set_remote_storage_resource(StorageResource resource); |
73 | | |
74 | 33 | const std::string& resource_id() const { return _rowset_meta_pb.resource_id(); } |
75 | | |
76 | 19 | void set_resource_id(const std::string& resource_id) { |
77 | 19 | _rowset_meta_pb.set_resource_id(resource_id); |
78 | 19 | } |
79 | | |
80 | 21.5k | bool is_local() const { return !_rowset_meta_pb.has_resource_id(); } |
81 | | |
82 | | bool has_variant_type_in_schema() const; |
83 | | |
84 | 2.74M | RowsetId rowset_id() const { return _rowset_id; } |
85 | | |
86 | 12.7k | void set_rowset_id(const RowsetId& rowset_id) { |
87 | | // rowset id is a required field, just set it to 0 |
88 | 12.7k | _rowset_meta_pb.set_rowset_id(0); |
89 | 12.7k | _rowset_id = rowset_id; |
90 | 12.7k | _rowset_meta_pb.set_rowset_id_v2(rowset_id.to_string()); |
91 | 12.7k | } |
92 | | |
93 | 8.31k | int64_t tablet_id() const { return _rowset_meta_pb.tablet_id(); } |
94 | | |
95 | 11.7k | void set_tablet_id(int64_t tablet_id) { _rowset_meta_pb.set_tablet_id(tablet_id); } |
96 | | |
97 | 24 | int64_t db_id() const { return _rowset_meta_pb.db_id(); } |
98 | | |
99 | 1.04k | void set_db_id(int64_t db_id) { _rowset_meta_pb.set_db_id(db_id); } |
100 | | |
101 | 24 | int64_t table_id() const { return _rowset_meta_pb.table_id(); } |
102 | | |
103 | 1.04k | void set_table_id(int64_t table_id) { _rowset_meta_pb.set_table_id(table_id); } |
104 | | |
105 | 3 | int64_t index_id() const { return _rowset_meta_pb.index_id(); } |
106 | | |
107 | 1.05k | void set_index_id(int64_t index_id) { _rowset_meta_pb.set_index_id(index_id); } |
108 | | |
109 | 22 | TabletUid tablet_uid() const { return _rowset_meta_pb.tablet_uid(); } |
110 | | |
111 | 11.6k | void set_tablet_uid(TabletUid tablet_uid) { |
112 | 11.6k | *(_rowset_meta_pb.mutable_tablet_uid()) = tablet_uid.to_proto(); |
113 | 11.6k | } |
114 | | |
115 | 22 | int64_t txn_id() const { return _rowset_meta_pb.txn_id(); } |
116 | | |
117 | 148 | void set_txn_id(int64_t txn_id) { _rowset_meta_pb.set_txn_id(txn_id); } |
118 | | |
119 | 33 | int32_t tablet_schema_hash() const { return _rowset_meta_pb.tablet_schema_hash(); } |
120 | | |
121 | 1.12k | void set_tablet_schema_hash(int32_t tablet_schema_hash) { |
122 | 1.12k | _rowset_meta_pb.set_tablet_schema_hash(tablet_schema_hash); |
123 | 1.12k | } |
124 | | |
125 | 14 | void mark_row_binlog() { _rowset_meta_pb.set_is_row_binlog(true); } |
126 | | |
127 | 3.19k | bool is_row_binlog() const { |
128 | 3.19k | return _rowset_meta_pb.has_is_row_binlog() && _rowset_meta_pb.is_row_binlog(); |
129 | 3.19k | } |
130 | | |
131 | 12.5k | RowsetTypePB rowset_type() const { return _rowset_meta_pb.rowset_type(); } |
132 | | |
133 | 2.94k | void set_rowset_type(RowsetTypePB rowset_type) { _rowset_meta_pb.set_rowset_type(rowset_type); } |
134 | | |
135 | 16.1k | RowsetStatePB rowset_state() const { return _rowset_meta_pb.rowset_state(); } |
136 | | |
137 | 2.18k | void set_rowset_state(RowsetStatePB rowset_state) { |
138 | 2.18k | _rowset_meta_pb.set_rowset_state(rowset_state); |
139 | 2.18k | } |
140 | | |
141 | 2.61M | Version version() const { |
142 | 2.61M | return {_rowset_meta_pb.start_version(), _rowset_meta_pb.end_version()}; |
143 | 2.61M | } |
144 | | |
145 | 12.4k | void set_version(Version version) { |
146 | 12.4k | _rowset_meta_pb.set_start_version(version.first); |
147 | 12.4k | _rowset_meta_pb.set_end_version(version.second); |
148 | 12.4k | } |
149 | | |
150 | 17.8k | bool has_version() const { |
151 | 17.8k | return _rowset_meta_pb.has_start_version() && _rowset_meta_pb.has_end_version(); |
152 | 17.8k | } |
153 | | |
154 | 29.0k | int64_t start_version() const { return _rowset_meta_pb.start_version(); } |
155 | | |
156 | 49.8k | int64_t end_version() const { return _rowset_meta_pb.end_version(); } |
157 | | |
158 | 1.44k | int64_t num_rows() const { return _rowset_meta_pb.num_rows(); } |
159 | | |
160 | 1.53k | void set_num_rows(int64_t num_rows) { _rowset_meta_pb.set_num_rows(num_rows); } |
161 | | |
162 | 1.10k | void set_num_segment_rows(const std::vector<uint32_t>& num_segment_rows) { |
163 | 1.10k | _rowset_meta_pb.mutable_num_segment_rows()->Assign(num_segment_rows.cbegin(), |
164 | 1.10k | num_segment_rows.cend()); |
165 | 1.10k | } |
166 | | |
167 | 86 | void get_num_segment_rows(std::vector<uint32_t>* num_segment_rows) const { |
168 | 86 | num_segment_rows->assign(_rowset_meta_pb.num_segment_rows().cbegin(), |
169 | 86 | _rowset_meta_pb.num_segment_rows().cend()); |
170 | 86 | } |
171 | | |
172 | 1.60k | auto& get_num_segment_rows() const { return _rowset_meta_pb.num_segment_rows(); } |
173 | | |
174 | 7.95k | int64_t total_disk_size() const { return _rowset_meta_pb.total_disk_size(); } |
175 | | |
176 | 8.35k | void set_total_disk_size(int64_t total_disk_size) { |
177 | 8.35k | _rowset_meta_pb.set_total_disk_size(total_disk_size); |
178 | 8.35k | } |
179 | | |
180 | 314 | int64_t data_disk_size() const { return _rowset_meta_pb.data_disk_size(); } |
181 | | |
182 | 1.22k | void set_data_disk_size(int64_t data_disk_size) { |
183 | 1.22k | _rowset_meta_pb.set_data_disk_size(data_disk_size); |
184 | 1.22k | } |
185 | | |
186 | 305 | int64_t index_disk_size() const { return _rowset_meta_pb.index_disk_size(); } |
187 | | |
188 | 1.22k | void set_index_disk_size(int64_t index_disk_size) { |
189 | 1.22k | _rowset_meta_pb.set_index_disk_size(index_disk_size); |
190 | 1.22k | } |
191 | | |
192 | 0 | void zone_maps(std::vector<ZoneMap>* zone_maps) { |
193 | 0 | for (const ZoneMap& zone_map : _rowset_meta_pb.zone_maps()) { |
194 | 0 | zone_maps->push_back(zone_map); |
195 | 0 | } |
196 | 0 | } |
197 | | |
198 | 0 | void set_zone_maps(const std::vector<ZoneMap>& zone_maps) { |
199 | 0 | for (const ZoneMap& zone_map : zone_maps) { |
200 | 0 | ZoneMap* new_zone_map = _rowset_meta_pb.add_zone_maps(); |
201 | 0 | *new_zone_map = zone_map; |
202 | 0 | } |
203 | 0 | } |
204 | | |
205 | 0 | void add_zone_map(const ZoneMap& zone_map) { |
206 | 0 | ZoneMap* new_zone_map = _rowset_meta_pb.add_zone_maps(); |
207 | 0 | *new_zone_map = zone_map; |
208 | 0 | } |
209 | | |
210 | 5.90k | bool has_delete_predicate() const { return _rowset_meta_pb.has_delete_predicate(); } |
211 | | |
212 | 171 | const DeletePredicatePB& delete_predicate() const { return _rowset_meta_pb.delete_predicate(); } |
213 | | |
214 | 0 | DeletePredicatePB* mutable_delete_predicate() { |
215 | 0 | return _rowset_meta_pb.mutable_delete_predicate(); |
216 | 0 | } |
217 | | |
218 | 83 | void set_delete_predicate(DeletePredicatePB delete_predicate) { |
219 | 83 | DeletePredicatePB* new_delete_condition = _rowset_meta_pb.mutable_delete_predicate(); |
220 | 83 | *new_delete_condition = std::move(delete_predicate); |
221 | 83 | } |
222 | | |
223 | 51 | bool empty() const { return _rowset_meta_pb.empty(); } |
224 | | |
225 | 1.22k | void set_empty(bool empty) { _rowset_meta_pb.set_empty(empty); } |
226 | | |
227 | 0 | PUniqueId load_id() const { return _rowset_meta_pb.load_id(); } |
228 | | |
229 | 55 | void set_load_id(PUniqueId load_id) { |
230 | 55 | PUniqueId* new_load_id = _rowset_meta_pb.mutable_load_id(); |
231 | 55 | new_load_id->set_hi(load_id.hi()); |
232 | 55 | new_load_id->set_lo(load_id.lo()); |
233 | 55 | } |
234 | | |
235 | 1 | void set_job_id(const std::string& job_id) { _rowset_meta_pb.set_job_id(job_id); } |
236 | | |
237 | 0 | const std::string& job_id() const { return _rowset_meta_pb.job_id(); } |
238 | | |
239 | 0 | bool delete_flag() const { return _rowset_meta_pb.delete_flag(); } |
240 | | |
241 | 30 | int64_t creation_time() const { return _rowset_meta_pb.creation_time(); } |
242 | | |
243 | 1.20k | void set_creation_time(int64_t creation_time) { |
244 | 1.20k | return _rowset_meta_pb.set_creation_time(creation_time); |
245 | 1.20k | } |
246 | | |
247 | 717 | int64_t stale_at() const { |
248 | 717 | int64_t stale_time = _stale_at_s.load(); |
249 | 717 | return stale_time > 0 ? stale_time : _rowset_meta_pb.creation_time(); |
250 | 717 | } |
251 | | |
252 | 2 | bool has_stale_at() const { return _stale_at_s.load() > 0; } |
253 | | |
254 | 632 | void set_stale_at(int64_t stale_at) { _stale_at_s.store(stale_at); } |
255 | | |
256 | 10 | int64_t partition_id() const { return _rowset_meta_pb.partition_id(); } |
257 | | |
258 | 1.05k | void set_partition_id(int64_t partition_id) { |
259 | 1.05k | return _rowset_meta_pb.set_partition_id(partition_id); |
260 | 1.05k | } |
261 | | |
262 | 85.0k | int64_t num_segments() const { return _rowset_meta_pb.num_segments(); } |
263 | | |
264 | 5.17k | void set_num_segments(int64_t num_segments) { _rowset_meta_pb.set_num_segments(num_segments); } |
265 | | |
266 | | // Convert to RowsetMetaPB, skip_schema is only used by cloud to separate schema from rowset meta. |
267 | | void to_rowset_pb(RowsetMetaPB* rs_meta_pb, bool skip_schema = false) const; |
268 | | |
269 | | // Convert to RowsetMetaPB, skip_schema is only used by cloud to separate schema from rowset meta. |
270 | | RowsetMetaPB get_rowset_pb(bool skip_schema = false) const; |
271 | | |
272 | 0 | inline DeletePredicatePB* mutable_delete_pred_pb() { |
273 | 0 | return _rowset_meta_pb.mutable_delete_predicate(); |
274 | 0 | } |
275 | | |
276 | 937 | bool is_singleton_delta() const { |
277 | 937 | return has_version() && _rowset_meta_pb.start_version() == _rowset_meta_pb.end_version(); |
278 | 937 | } |
279 | | |
280 | | // Some time, we may check if this rowset is in rowset meta manager's meta by using RowsetMetaManager::check_rowset_meta. |
281 | | // But, this check behavior may cost a lot of time when it is frequent. |
282 | | // If we explicitly remove this rowset from rowset meta manager's meta, we can set _is_removed_from_rowset_meta to true, |
283 | | // And next time when we want to check if this rowset is in rowset mata manager's meta, we can |
284 | | // check is_remove_from_rowset_meta() first. |
285 | 0 | void set_remove_from_rowset_meta() { _is_removed_from_rowset_meta = true; } |
286 | | |
287 | 0 | bool is_remove_from_rowset_meta() const { return _is_removed_from_rowset_meta; } |
288 | | |
289 | 1.53k | SegmentsOverlapPB segments_overlap() const { return _rowset_meta_pb.segments_overlap_pb(); } |
290 | | |
291 | 5.68k | void set_segments_overlap(SegmentsOverlapPB segments_overlap) { |
292 | 5.68k | _rowset_meta_pb.set_segments_overlap_pb(segments_overlap); |
293 | 5.68k | } |
294 | | |
295 | 17.1k | static bool comparator(const RowsetMetaSharedPtr& left, const RowsetMetaSharedPtr& right) { |
296 | 17.1k | return left->end_version() < right->end_version(); |
297 | 17.1k | } |
298 | | |
299 | | // return true if segments in this rowset has overlapping data. |
300 | | // this is not same as `segments_overlap()` method. |
301 | | // `segments_overlap()` only return the value of "segments_overlap" field in rowset meta, |
302 | | // but "segments_overlap" may be UNKNOWN. |
303 | | // |
304 | | // Returns true if all of the following conditions are met |
305 | | // 1. the rowset contains more than one segment |
306 | | // 2. the rowset's start version == end version (non-singleton rowset was generated by compaction process |
307 | | // which always produces non-overlapped segments) |
308 | | // 3. segments_overlap() flag is not NONOVERLAPPING (OVERLAP_UNKNOWN and OVERLAPPING are OK) |
309 | 30.7k | bool is_segments_overlapping() const { |
310 | 30.7k | return num_segments() > 1 && is_singleton_delta() && segments_overlap() != NONOVERLAPPING; |
311 | 30.7k | } |
312 | | |
313 | 0 | bool produced_by_compaction() const { |
314 | 0 | return has_version() && |
315 | 0 | (start_version() < end_version() || |
316 | 0 | (start_version() == end_version() && segments_overlap() == NONOVERLAPPING)); |
317 | 0 | } |
318 | | |
319 | | // get the compaction score of this rowset. |
320 | | // if segments are overlapping, the score equals to the number of segments, |
321 | | // otherwise, score is 1. |
322 | 28.9k | uint32_t get_compaction_score() const { |
323 | 28.9k | uint32_t score = 0; |
324 | 28.9k | if (!is_segments_overlapping()) { |
325 | 28.8k | score = 1; |
326 | 28.8k | } else { |
327 | 96 | auto num_seg = num_segments(); |
328 | 96 | DCHECK_GT(num_seg, 0); |
329 | 96 | score = cast_set<uint32_t>(num_seg); |
330 | 96 | CHECK(score > 0); |
331 | 96 | } |
332 | 28.9k | return score; |
333 | 28.9k | } |
334 | | |
335 | 0 | uint32_t get_merge_way_num() const { |
336 | 0 | uint32_t way_num = 0; |
337 | 0 | if (!is_segments_overlapping()) { |
338 | 0 | if (num_segments() == 0) { |
339 | 0 | way_num = 0; |
340 | 0 | } else { |
341 | 0 | way_num = 1; |
342 | 0 | } |
343 | 0 | } else { |
344 | 0 | auto num_seg = num_segments(); |
345 | 0 | DCHECK_GT(num_seg, 0); |
346 | |
|
347 | 0 | way_num = cast_set<uint32_t>(num_seg); |
348 | 0 | CHECK(way_num > 0); |
349 | 0 | } |
350 | 0 | return way_num; |
351 | 0 | } |
352 | | |
353 | 211 | void get_segments_key_bounds(std::vector<KeyBoundsPB>* segments_key_bounds) const { |
354 | 228 | for (const KeyBoundsPB& key_range : _rowset_meta_pb.segments_key_bounds()) { |
355 | 228 | segments_key_bounds->push_back(key_range); |
356 | 228 | } |
357 | 211 | } |
358 | | |
359 | 3 | auto& get_segments_key_bounds() const { return _rowset_meta_pb.segments_key_bounds(); } |
360 | | |
361 | 1.16k | bool is_segments_key_bounds_truncated() const { |
362 | 1.16k | return _rowset_meta_pb.has_segments_key_bounds_truncated() && |
363 | 1.16k | _rowset_meta_pb.segments_key_bounds_truncated(); |
364 | 1.16k | } |
365 | | |
366 | 1.16k | void set_segments_key_bounds_truncated(bool truncated) { |
367 | 1.16k | _rowset_meta_pb.set_segments_key_bounds_truncated(truncated); |
368 | 1.16k | } |
369 | | |
370 | | // When true, `segments_key_bounds` holds a single aggregated |
371 | | // [rowset_min, rowset_max] entry instead of per-segment bounds. |
372 | 87 | bool is_segments_key_bounds_aggregated() const { |
373 | 87 | return _rowset_meta_pb.has_segments_key_bounds_aggregated() && |
374 | 87 | _rowset_meta_pb.segments_key_bounds_aggregated(); |
375 | 87 | } |
376 | | |
377 | 1.10k | void set_segments_key_bounds_aggregated(bool aggregated) { |
378 | 1.10k | _rowset_meta_pb.set_segments_key_bounds_aggregated(aggregated); |
379 | 1.10k | } |
380 | | |
381 | 201 | bool get_first_segment_key_bound(KeyBoundsPB* key_bounds) { |
382 | | // for compatibility, old version has not segment key bounds |
383 | 201 | if (_rowset_meta_pb.segments_key_bounds_size() == 0) { |
384 | 0 | return false; |
385 | 0 | } |
386 | 201 | *key_bounds = *_rowset_meta_pb.segments_key_bounds().begin(); |
387 | 201 | return true; |
388 | 201 | } |
389 | | |
390 | 138 | bool get_last_segment_key_bound(KeyBoundsPB* key_bounds) { |
391 | 138 | if (_rowset_meta_pb.segments_key_bounds_size() == 0) { |
392 | 0 | return false; |
393 | 0 | } |
394 | 138 | *key_bounds = *_rowset_meta_pb.segments_key_bounds().rbegin(); |
395 | 138 | return true; |
396 | 138 | } |
397 | | |
398 | | // If `aggregate_into_single` is true, collapse per-segment bounds into a single |
399 | | // [rowset_min, rowset_max] entry and mark this rowset as aggregated. |
400 | | void set_segments_key_bounds(const std::vector<KeyBoundsPB>& segments_key_bounds, |
401 | | bool aggregate_into_single = false); |
402 | | |
403 | 0 | void add_segment_key_bounds(KeyBoundsPB segments_key_bounds) { |
404 | 0 | *_rowset_meta_pb.add_segments_key_bounds() = std::move(segments_key_bounds); |
405 | 0 | set_segments_overlap(OVERLAPPING); |
406 | 0 | } |
407 | | |
408 | 1.63k | void set_newest_write_timestamp(int64_t timestamp) { |
409 | 1.63k | _rowset_meta_pb.set_newest_write_timestamp(timestamp); |
410 | 1.63k | } |
411 | | |
412 | 1.08k | int64_t newest_write_timestamp() const { return _rowset_meta_pb.newest_write_timestamp(); } |
413 | | |
414 | | // for cloud only |
415 | 269 | bool has_visible_ts_ms() const { return _rowset_meta_pb.has_visible_ts_ms(); } |
416 | 268 | int64_t visible_ts_ms() const { return _rowset_meta_pb.visible_ts_ms(); } |
417 | 269 | std::chrono::time_point<std::chrono::system_clock> visible_timestamp() const { |
418 | 269 | using namespace std::chrono; |
419 | 269 | if (has_visible_ts_ms()) { |
420 | 268 | return time_point<system_clock>(milliseconds(visible_ts_ms())); |
421 | 268 | } |
422 | 1 | return system_clock::from_time_t(newest_write_timestamp()); |
423 | 269 | } |
424 | 771 | void set_visible_ts_ms(int64_t visible_ts_ms) { |
425 | 771 | _rowset_meta_pb.set_visible_ts_ms(visible_ts_ms); |
426 | 771 | } |
427 | | |
428 | | void set_tablet_schema(const TabletSchemaSPtr& tablet_schema); |
429 | | void set_tablet_schema(const TabletSchemaPB& tablet_schema); |
430 | | |
431 | 34.6k | const TabletSchemaSPtr& tablet_schema() const { return _schema; } |
432 | | |
433 | 1 | void set_txn_expiration(int64_t expiration) { _rowset_meta_pb.set_txn_expiration(expiration); } |
434 | | |
435 | 1.01k | void set_compaction_level(int64_t compaction_level) { |
436 | 1.01k | _rowset_meta_pb.set_compaction_level(compaction_level); |
437 | 1.01k | } |
438 | | |
439 | 11 | int64_t compaction_level() { return _rowset_meta_pb.compaction_level(); } |
440 | | |
441 | | // `seg_file_size` MUST ordered by segment id |
442 | | void add_segments_file_size(const std::vector<size_t>& seg_file_size); |
443 | | |
444 | | // Return -1 if segment file size is unknown |
445 | | int64_t segment_file_size(int seg_id) const; |
446 | | |
447 | 0 | const auto& segments_file_size() const { return _rowset_meta_pb.segments_file_size(); } |
448 | | |
449 | | // Used for partial update, when publish, partial update may add a new rowset and we should update rowset meta |
450 | | void merge_rowset_meta(const RowsetMeta& other); |
451 | | |
452 | | InvertedIndexFileInfo inverted_index_file_info(int seg_id); |
453 | | |
454 | 0 | const auto& inverted_index_file_info() const { |
455 | 0 | return _rowset_meta_pb.inverted_index_file_info(); |
456 | 0 | } |
457 | | |
458 | | void add_inverted_index_files_info( |
459 | | const std::vector<const InvertedIndexFileInfo*>& idx_file_info); |
460 | | |
461 | | int64_t get_metadata_size() const override; |
462 | | |
463 | | // Because the member field '_handle' is a raw pointer, use member func 'init' to replace copy ctor |
464 | | RowsetMeta(const RowsetMeta&) = delete; |
465 | | RowsetMeta operator=(const RowsetMeta&) = delete; |
466 | | |
467 | | void add_packed_slice_location(const std::string& segment_path, |
468 | | const std::string& packed_file_path, int64_t offset, |
469 | 0 | int64_t size, int64_t packed_file_size) { |
470 | 0 | auto* index_map = _rowset_meta_pb.mutable_packed_slice_locations(); |
471 | 0 | auto& index_pb = (*index_map)[segment_path]; |
472 | 0 | index_pb.set_packed_file_path(packed_file_path); |
473 | 0 | index_pb.set_offset(offset); |
474 | 0 | index_pb.set_size(size); |
475 | 0 | index_pb.set_packed_file_size(packed_file_size); |
476 | 0 | } |
477 | | |
478 | 81 | int32_t schema_version() const { return _rowset_meta_pb.schema_version(); } |
479 | | |
480 | 0 | std::string debug_string() const { return _rowset_meta_pb.ShortDebugString(); } |
481 | | |
482 | | // Pre-set the encryption algorithm to avoid re-entrant get_tablet calls |
483 | | // that can cause SingleFlight deadlock during tablet loading. |
484 | 0 | void set_encryption_algorithm(EncryptionAlgorithmPB algorithm) { |
485 | 0 | _determine_encryption_once.call( |
486 | 0 | [algorithm]() -> Result<EncryptionAlgorithmPB> { return algorithm; }); |
487 | 0 | } |
488 | | |
489 | 1.22k | TsoRange commit_tso() const { |
490 | 1.22k | const auto& commit_tso_pb = _rowset_meta_pb.commit_tso(); |
491 | 1.22k | return {commit_tso_pb.start_tso(), commit_tso_pb.end_tso()}; |
492 | 1.22k | } |
493 | | |
494 | 25 | void set_commit_tso(const TsoRange& commit_tso) { |
495 | 25 | auto* commit_tso_pb = _rowset_meta_pb.mutable_commit_tso(); |
496 | 25 | commit_tso_pb->set_start_tso(commit_tso.start_tso()); |
497 | 25 | commit_tso_pb->set_end_tso(commit_tso.end_tso()); |
498 | 25 | } |
499 | | |
500 | 19 | void set_commit_tso(int64_t commit_tso) { set_commit_tso({commit_tso, commit_tso}); } |
501 | | |
502 | 0 | void set_cloud_fields_after_visible(int64_t visible_version, int64_t version_update_time_ms) { |
503 | | // Update rowset meta with correct version and visible_ts |
504 | | // !!ATTENTION!!: this code should be updated if there are more fields |
505 | | // in rowset meta which will be modified in meta-service when commit_txn in the future |
506 | 0 | set_version({visible_version, visible_version}); |
507 | 0 | if (version_update_time_ms > 0) { |
508 | 0 | set_visible_ts_ms(version_update_time_ms); |
509 | 0 | } |
510 | 0 | } |
511 | | |
512 | | private: |
513 | | bool _deserialize_from_pb(std::string_view value); |
514 | | |
515 | | bool _serialize_to_pb(std::string* value); |
516 | | |
517 | | void _init(); |
518 | | |
519 | | friend bool operator==(const RowsetMeta& a, const RowsetMeta& b); |
520 | | |
521 | 0 | friend bool operator!=(const RowsetMeta& a, const RowsetMeta& b) { return !(a == b); } |
522 | | |
523 | | private: |
524 | | RowsetMetaPB _rowset_meta_pb; |
525 | | TabletSchemaSPtr _schema; |
526 | | Cache::Handle* _handle = nullptr; |
527 | | RowsetId _rowset_id; |
528 | | StorageResource _storage_resource; |
529 | | bool _is_removed_from_rowset_meta = false; |
530 | | DorisCallOnce<Result<EncryptionAlgorithmPB>> _determine_encryption_once; |
531 | | std::atomic<int64_t> _stale_at_s {0}; |
532 | | }; |
533 | | |
534 | | using RowsetMetaMapContainer = std::unordered_map<Version, RowsetMetaSharedPtr, HashOfVersion>; |
535 | | |
536 | | } // namespace doris |
537 | | |
538 | | #endif // DORIS_BE_SRC_OLAP_ROWSET_ROWSET_META_H |