Coverage Report

Created: 2025-04-10 14:34

/root/doris/be/src/olap/rowid_conversion.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 <map>
21
#include <vector>
22
23
#include "olap/olap_common.h"
24
#include "olap/utils.h"
25
#include "runtime/thread_context.h"
26
27
namespace doris {
28
29
// For unique key merge on write table, we should update delete bitmap
30
// of destination rowset when compaction finished.
31
// Through the row id correspondence between the source rowset and the
32
// destination rowset, we can quickly update the delete bitmap of the
33
// destination rowset.
34
class RowIdConversion {
35
public:
36
144
    RowIdConversion() = default;
37
144
    ~RowIdConversion() { RELEASE_THREAD_MEM_TRACKER(_seg_rowid_map_mem_used); }
38
39
    // resize segment rowid map to its rows num
40
378
    Status init_segment_map(const RowsetId& src_rowset_id, const std::vector<uint32_t>& num_rows) {
41
970
        for (size_t i = 0; i < num_rows.size(); i++) {
42
592
            constexpr size_t RESERVED_MEMORY = 10 * 1024 * 1024; // 10M
43
592
            if (doris::GlobalMemoryArbitrator::is_exceed_hard_mem_limit(RESERVED_MEMORY)) {
44
0
                return Status::MemoryLimitExceeded(fmt::format(
45
0
                        "RowIdConversion init_segment_map failed, memory exceed limit, {}, "
46
0
                        "consuming "
47
0
                        "tracker:<{}>, peak used {}, current used {}.",
48
0
                        doris::GlobalMemoryArbitrator::process_limit_exceeded_errmsg_str(),
49
0
                        doris::thread_context()
50
0
                                ->thread_mem_tracker_mgr->limiter_mem_tracker()
51
0
                                ->label(),
52
0
                        doris::thread_context()
53
0
                                ->thread_mem_tracker_mgr->limiter_mem_tracker()
54
0
                                ->peak_consumption(),
55
0
                        doris::thread_context()
56
0
                                ->thread_mem_tracker_mgr->limiter_mem_tracker()
57
0
                                ->consumption()));
58
0
            }
59
60
592
            uint32_t id = _segments_rowid_map.size();
61
592
            _segment_to_id_map.emplace(std::pair<RowsetId, uint32_t> {src_rowset_id, i}, id);
62
592
            _id_to_segment_map.emplace_back(src_rowset_id, i);
63
592
            std::vector<std::pair<uint32_t, uint32_t>> vec(
64
592
                    num_rows[i], std::pair<uint32_t, uint32_t>(UINT32_MAX, UINT32_MAX));
65
66
            //NOTE: manually count _segments_rowid_map's memory here, because _segments_rowid_map could be used by indexCompaction.
67
            // indexCompaction is a thridparty code, it's too complex to modify it.
68
            // refer compact_column.
69
592
            track_mem_usage(vec.capacity());
70
592
            _segments_rowid_map.emplace_back(std::move(vec));
71
592
        }
72
378
        return Status::OK();
73
378
    }
74
75
    // set dst rowset id
76
128
    void set_dst_rowset_id(const RowsetId& dst_rowset_id) { _dst_rowst_id = dst_rowset_id; }
77
18
    const RowsetId get_dst_rowset_id() { return _dst_rowst_id; }
78
79
    // add row id to the map
80
    void add(const std::vector<RowLocation>& rss_row_ids,
81
5.18k
             const std::vector<uint32_t>& dst_segments_num_row) {
82
4.70M
        for (auto& item : rss_row_ids) {
83
4.70M
            if (item.row_id == -1) {
84
0
                continue;
85
0
            }
86
4.70M
            uint32_t id = _segment_to_id_map.at(
87
4.70M
                    std::pair<RowsetId, uint32_t> {item.rowset_id, item.segment_id});
88
4.70M
            if (_cur_dst_segment_id < dst_segments_num_row.size() &&
89
4.70M
                _cur_dst_segment_rowid >= dst_segments_num_row[_cur_dst_segment_id]) {
90
3.64k
                _cur_dst_segment_id++;
91
3.64k
                _cur_dst_segment_rowid = 0;
92
3.64k
            }
93
4.70M
            _segments_rowid_map[id][item.row_id] =
94
4.70M
                    std::pair<uint32_t, uint32_t> {_cur_dst_segment_id, _cur_dst_segment_rowid++};
95
4.70M
        }
96
5.18k
    }
97
98
    // get destination RowLocation
99
    // return non-zero if the src RowLocation does not exist
100
1.75M
    int get(const RowLocation& src, RowLocation* dst) const {
101
1.75M
        auto iter = _segment_to_id_map.find({src.rowset_id, src.segment_id});
102
1.75M
        if (iter == _segment_to_id_map.end()) {
103
1
            return -1;
104
1
        }
105
1.75M
        const auto& rowid_map = _segments_rowid_map[iter->second];
106
1.75M
        if (src.row_id >= rowid_map.size()) {
107
1
            return -1;
108
1
        }
109
1.75M
        auto& [dst_segment_id, dst_rowid] = rowid_map[src.row_id];
110
1.75M
        if (dst_segment_id == UINT32_MAX && dst_rowid == UINT32_MAX) {
111
764k
            return -1;
112
764k
        }
113
114
993k
        dst->rowset_id = _dst_rowst_id;
115
993k
        dst->segment_id = dst_segment_id;
116
993k
        dst->row_id = dst_rowid;
117
993k
        return 0;
118
1.75M
    }
119
120
    const std::vector<std::vector<std::pair<uint32_t, uint32_t>>>& get_rowid_conversion_map()
121
18
            const {
122
18
        return _segments_rowid_map;
123
18
    }
124
125
18
    const std::map<std::pair<RowsetId, uint32_t>, uint32_t>& get_src_segment_to_id_map() {
126
18
        return _segment_to_id_map;
127
18
    }
128
129
0
    std::pair<RowsetId, uint32_t> get_segment_by_id(uint32_t id) const {
130
0
        DCHECK_GT(_id_to_segment_map.size(), id);
131
0
        return _id_to_segment_map.at(id);
132
0
    }
133
134
0
    uint32_t get_id_by_segment(const std::pair<RowsetId, uint32_t>& segment) const {
135
0
        return _segment_to_id_map.at(segment);
136
0
    }
137
138
private:
139
592
    void track_mem_usage(size_t delta_std_pair_cap) {
140
592
        _std_pair_cap += delta_std_pair_cap;
141
142
592
        size_t new_size =
143
592
                _std_pair_cap * sizeof(std::pair<uint32_t, uint32_t>) +
144
592
                _segments_rowid_map.capacity() * sizeof(std::vector<std::pair<uint32_t, uint32_t>>);
145
592
        CONSUME_THREAD_MEM_TRACKER(new_size - _seg_rowid_map_mem_used);
146
592
        _seg_rowid_map_mem_used = new_size;
147
592
    }
148
149
private:
150
    // the first level vector: index indicates src segment.
151
    // the second level vector: index indicates row id of source segment,
152
    // value indicates row id of destination segment.
153
    // <UINT32_MAX, UINT32_MAX> indicates current row not exist.
154
    std::vector<std::vector<std::pair<uint32_t, uint32_t>>> _segments_rowid_map;
155
    size_t _seg_rowid_map_mem_used {0};
156
    size_t _std_pair_cap {0};
157
158
    // Map source segment to 0 to n
159
    std::map<std::pair<RowsetId, uint32_t>, uint32_t> _segment_to_id_map;
160
161
    // Map 0 to n to source segment
162
    std::vector<std::pair<RowsetId, uint32_t>> _id_to_segment_map;
163
164
    // dst rowset id
165
    RowsetId _dst_rowst_id;
166
167
    // current dst segment id
168
    std::uint32_t _cur_dst_segment_id = 0;
169
170
    // current rowid of dst segment
171
    std::uint32_t _cur_dst_segment_rowid = 0;
172
};
173
174
} // namespace doris