Coverage Report

Created: 2026-04-10 18:35

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
be/src/storage/partial_update_info.cpp
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
#include "storage/partial_update_info.h"
19
20
#include <gen_cpp/olap_file.pb.h>
21
22
#include <cstdint>
23
24
#include "common/consts.h"
25
#include "common/logging.h"
26
#include "core/assert_cast.h"
27
#include "core/block/block.h"
28
#include "core/data_type/data_type_number.h" // IWYU pragma: keep
29
#include "core/value/bitmap_value.h"
30
#include "storage/iterator/olap_data_convertor.h"
31
#include "storage/olap_common.h"
32
#include "storage/rowset/rowset.h"
33
#include "storage/rowset/rowset_writer_context.h"
34
#include "storage/segment/vertical_segment_writer.h"
35
#include "storage/tablet/base_tablet.h"
36
#include "storage/tablet/tablet_meta.h"
37
#include "storage/tablet/tablet_schema.h"
38
#include "storage/utils.h"
39
40
namespace doris {
41
Status PartialUpdateInfo::init(int64_t tablet_id, int64_t txn_id, const TabletSchema& tablet_schema,
42
                               UniqueKeyUpdateModePB unique_key_update_mode,
43
                               PartialUpdateNewRowPolicyPB policy,
44
                               const std::set<std::string>& partial_update_cols,
45
                               bool is_strict_mode_, int64_t timestamp_ms_, int32_t nano_seconds_,
46
                               const std::string& timezone_,
47
                               const std::string& auto_increment_column,
48
188k
                               int32_t sequence_map_col_uid, int64_t cur_max_version) {
49
188k
    partial_update_mode = unique_key_update_mode;
50
188k
    partial_update_new_key_policy = policy;
51
188k
    partial_update_input_columns = partial_update_cols;
52
188k
    max_version_in_flush_phase = cur_max_version;
53
188k
    sequence_map_col_unqiue_id = sequence_map_col_uid;
54
188k
    timestamp_ms = timestamp_ms_;
55
188k
    nano_seconds = nano_seconds_;
56
188k
    timezone = timezone_;
57
188k
    missing_cids.clear();
58
188k
    update_cids.clear();
59
60
188k
    if (partial_update_mode == UniqueKeyUpdateModePB::UPDATE_FIXED_COLUMNS) {
61
        // partial_update_cols should include all key columns
62
10.6k
        for (std::size_t i {0}; i < tablet_schema.num_key_columns(); i++) {
63
7.24k
            const auto key_col = tablet_schema.column(i);
64
7.24k
            if (!partial_update_cols.contains(key_col.name())) {
65
0
                auto msg = fmt::format(
66
0
                        "Unable to do partial update on shadow index's tablet, tablet_id={}, "
67
0
                        "txn_id={}. Missing key column {}.",
68
0
                        tablet_id, txn_id, key_col.name());
69
0
                LOG_WARNING(msg);
70
0
                return Status::Aborted<false>(msg);
71
0
            }
72
7.24k
        }
73
3.40k
    }
74
188k
    if (is_partial_update()) {
75
35.3k
        for (auto i = 0; i < tablet_schema.num_columns(); ++i) {
76
31.6k
            if (partial_update_mode == UniqueKeyUpdateModePB::UPDATE_FIXED_COLUMNS) {
77
27.8k
                auto tablet_column = tablet_schema.column(i);
78
27.8k
                if (!partial_update_input_columns.contains(tablet_column.name())) {
79
16.2k
                    missing_cids.emplace_back(i);
80
16.2k
                    if (!tablet_column.has_default_value() && !tablet_column.is_nullable() &&
81
16.2k
                        tablet_schema.auto_increment_column() != tablet_column.name()) {
82
1.17k
                        can_insert_new_rows_in_partial_update = false;
83
1.17k
                    }
84
16.2k
                } else {
85
11.5k
                    update_cids.emplace_back(i);
86
11.5k
                }
87
27.8k
                if (auto_increment_column == tablet_column.name()) {
88
240
                    is_schema_contains_auto_inc_column = true;
89
240
                }
90
27.8k
            } else {
91
                // in flexible partial update, missing cids is all non sort keys' cid
92
3.87k
                if (i >= tablet_schema.num_key_columns()) {
93
3.60k
                    missing_cids.emplace_back(i);
94
3.60k
                }
95
3.87k
            }
96
31.6k
        }
97
3.66k
        _generate_default_values_for_missing_cids(tablet_schema);
98
3.66k
    }
99
188k
    is_strict_mode = is_strict_mode_;
100
188k
    is_input_columns_contains_auto_inc_column =
101
188k
            is_fixed_partial_update() &&
102
188k
            partial_update_input_columns.contains(auto_increment_column);
103
188k
    return Status::OK();
104
188k
}
105
106
198
void PartialUpdateInfo::to_pb(PartialUpdateInfoPB* partial_update_info_pb) const {
107
198
    partial_update_info_pb->set_partial_update_mode(partial_update_mode);
108
198
    partial_update_info_pb->set_partial_update_new_key_policy(partial_update_new_key_policy);
109
198
    partial_update_info_pb->set_max_version_in_flush_phase(max_version_in_flush_phase);
110
1.08k
    for (const auto& col : partial_update_input_columns) {
111
1.08k
        partial_update_info_pb->add_partial_update_input_columns(col);
112
1.08k
    }
113
1.19k
    for (auto cid : missing_cids) {
114
1.19k
        partial_update_info_pb->add_missing_cids(cid);
115
1.19k
    }
116
1.08k
    for (auto cid : update_cids) {
117
1.08k
        partial_update_info_pb->add_update_cids(cid);
118
1.08k
    }
119
198
    partial_update_info_pb->set_can_insert_new_rows_in_partial_update(
120
198
            can_insert_new_rows_in_partial_update);
121
198
    partial_update_info_pb->set_is_strict_mode(is_strict_mode);
122
198
    partial_update_info_pb->set_timestamp_ms(timestamp_ms);
123
198
    partial_update_info_pb->set_nano_seconds(nano_seconds);
124
198
    partial_update_info_pb->set_timezone(timezone);
125
198
    partial_update_info_pb->set_is_input_columns_contains_auto_inc_column(
126
198
            is_input_columns_contains_auto_inc_column);
127
198
    partial_update_info_pb->set_is_schema_contains_auto_inc_column(
128
198
            is_schema_contains_auto_inc_column);
129
1.19k
    for (const auto& value : default_values) {
130
1.19k
        partial_update_info_pb->add_default_values(value);
131
1.19k
    }
132
198
}
133
134
0
void PartialUpdateInfo::from_pb(PartialUpdateInfoPB* partial_update_info_pb) {
135
0
    if (!partial_update_info_pb->has_partial_update_mode()) {
136
        // for backward compatibility
137
0
        if (partial_update_info_pb->is_partial_update()) {
138
0
            partial_update_mode = UniqueKeyUpdateModePB::UPDATE_FIXED_COLUMNS;
139
0
        } else {
140
0
            partial_update_mode = UniqueKeyUpdateModePB::UPSERT;
141
0
        }
142
0
    } else {
143
0
        partial_update_mode = partial_update_info_pb->partial_update_mode();
144
0
    }
145
0
    if (partial_update_info_pb->has_partial_update_new_key_policy()) {
146
0
        partial_update_new_key_policy = partial_update_info_pb->partial_update_new_key_policy();
147
0
    }
148
0
    max_version_in_flush_phase = partial_update_info_pb->has_max_version_in_flush_phase()
149
0
                                         ? partial_update_info_pb->max_version_in_flush_phase()
150
0
                                         : -1;
151
0
    partial_update_input_columns.clear();
152
0
    for (const auto& col : partial_update_info_pb->partial_update_input_columns()) {
153
0
        partial_update_input_columns.insert(col);
154
0
    }
155
0
    missing_cids.clear();
156
0
    for (auto cid : partial_update_info_pb->missing_cids()) {
157
0
        missing_cids.push_back(cid);
158
0
    }
159
0
    update_cids.clear();
160
0
    for (auto cid : partial_update_info_pb->update_cids()) {
161
0
        update_cids.push_back(cid);
162
0
    }
163
0
    can_insert_new_rows_in_partial_update =
164
0
            partial_update_info_pb->can_insert_new_rows_in_partial_update();
165
0
    is_strict_mode = partial_update_info_pb->is_strict_mode();
166
0
    timestamp_ms = partial_update_info_pb->timestamp_ms();
167
0
    timezone = partial_update_info_pb->timezone();
168
0
    is_input_columns_contains_auto_inc_column =
169
0
            partial_update_info_pb->is_input_columns_contains_auto_inc_column();
170
0
    is_schema_contains_auto_inc_column =
171
0
            partial_update_info_pb->is_schema_contains_auto_inc_column();
172
0
    if (partial_update_info_pb->has_nano_seconds()) {
173
0
        nano_seconds = partial_update_info_pb->nano_seconds();
174
0
    }
175
0
    default_values.clear();
176
0
    for (const auto& value : partial_update_info_pb->default_values()) {
177
0
        default_values.push_back(value);
178
0
    }
179
0
}
180
181
0
std::string PartialUpdateInfo::summary() const {
182
0
    std::string mode;
183
0
    switch (partial_update_mode) {
184
0
    case UniqueKeyUpdateModePB::UPSERT:
185
0
        mode = "upsert";
186
0
        break;
187
0
    case UniqueKeyUpdateModePB::UPDATE_FIXED_COLUMNS:
188
0
        mode = "fixed partial update";
189
0
        break;
190
0
    case UniqueKeyUpdateModePB::UPDATE_FLEXIBLE_COLUMNS:
191
0
        mode = "flexible partial update";
192
0
        break;
193
0
    }
194
0
    return fmt::format(
195
0
            "mode={}, update_cids={}, missing_cids={}, is_strict_mode={}, "
196
0
            "max_version_in_flush_phase={}",
197
0
            mode, update_cids.size(), missing_cids.size(), is_strict_mode,
198
0
            max_version_in_flush_phase);
199
0
}
200
201
Status PartialUpdateInfo::handle_new_key(const TabletSchema& tablet_schema,
202
                                         const std::function<std::string()>& line,
203
556
                                         BitmapValue* skip_bitmap) {
204
556
    switch (partial_update_new_key_policy) {
205
520
    case doris::PartialUpdateNewRowPolicyPB::APPEND: {
206
520
        if (partial_update_mode == UniqueKeyUpdateModePB::UPDATE_FIXED_COLUMNS) {
207
237
            if (!can_insert_new_rows_in_partial_update) {
208
10
                std::string error_column;
209
18
                for (auto cid : missing_cids) {
210
18
                    const TabletColumn& col = tablet_schema.column(cid);
211
18
                    if (!col.has_default_value() && !col.is_nullable() &&
212
18
                        !(tablet_schema.auto_increment_column() == col.name())) {
213
10
                        error_column = col.name();
214
10
                        break;
215
10
                    }
216
18
                }
217
10
                return Status::Error<ErrorCode::INVALID_SCHEMA, false>(
218
10
                        "the unmentioned column `{}` should have default value or be nullable "
219
10
                        "for newly inserted rows in non-strict mode partial update",
220
10
                        error_column);
221
10
            }
222
283
        } else if (partial_update_mode == UniqueKeyUpdateModePB::UPDATE_FLEXIBLE_COLUMNS) {
223
283
            DCHECK(skip_bitmap != nullptr);
224
283
            bool can_insert_new_row {true};
225
283
            std::string error_column;
226
4.05k
            for (auto cid : missing_cids) {
227
4.05k
                const TabletColumn& col = tablet_schema.column(cid);
228
4.05k
                if (skip_bitmap->contains(col.unique_id()) && !col.has_default_value() &&
229
4.05k
                    !col.is_nullable() && !col.is_auto_increment()) {
230
0
                    error_column = col.name();
231
0
                    can_insert_new_row = false;
232
0
                    break;
233
0
                }
234
4.05k
            }
235
283
            if (!can_insert_new_row) {
236
0
                return Status::Error<ErrorCode::INVALID_SCHEMA, false>(
237
0
                        "the unmentioned column `{}` should have default value or be "
238
0
                        "nullable for newly inserted rows in non-strict mode flexible partial "
239
0
                        "update",
240
0
                        error_column);
241
0
            }
242
283
        }
243
520
    } break;
244
510
    case doris::PartialUpdateNewRowPolicyPB::ERROR: {
245
36
        return Status::Error<ErrorCode::NEW_ROWS_IN_PARTIAL_UPDATE, false>(
246
36
                "Can't append new rows in partial update when partial_update_new_key_behavior is "
247
36
                "ERROR. Row with key=[{}] is not in table.",
248
36
                line());
249
520
    } break;
250
556
    }
251
511
    return Status::OK();
252
556
}
253
254
void PartialUpdateInfo::_generate_default_values_for_missing_cids(
255
3.65k
        const TabletSchema& tablet_schema) {
256
19.7k
    for (unsigned int cur_cid : missing_cids) {
257
19.7k
        const auto& column = tablet_schema.column(cur_cid);
258
19.7k
        if (column.has_default_value()) {
259
7.44k
            std::string default_value;
260
7.44k
            if (UNLIKELY((column.type() == FieldType::OLAP_FIELD_TYPE_DATETIMEV2 ||
261
7.44k
                          column.type() == FieldType::OLAP_FIELD_TYPE_TIMESTAMPTZ) &&
262
7.44k
                         to_lower(column.default_value()).find(to_lower("CURRENT_TIMESTAMP")) !=
263
7.44k
                                 std::string::npos)) {
264
133
                auto pos = to_lower(column.default_value()).find('(');
265
133
                if (pos == std::string::npos) {
266
64
                    DateV2Value<DateTimeV2ValueType> dtv;
267
64
                    dtv.from_unixtime(timestamp_ms / 1000, timezone);
268
64
                    default_value = dtv.to_string();
269
64
                    if (column.type() == FieldType::OLAP_FIELD_TYPE_TIMESTAMPTZ) {
270
0
                        default_value += timezone;
271
0
                    }
272
69
                } else {
273
69
                    int precision = std::stoi(column.default_value().substr(pos + 1));
274
69
                    DateV2Value<DateTimeV2ValueType> dtv;
275
69
                    dtv.from_unixtime(timestamp_ms / 1000, nano_seconds, timezone, precision);
276
69
                    default_value = dtv.to_string();
277
69
                    if (column.type() == FieldType::OLAP_FIELD_TYPE_TIMESTAMPTZ) {
278
0
                        default_value += timezone;
279
0
                    }
280
69
                }
281
7.31k
            } else if (UNLIKELY(column.type() == FieldType::OLAP_FIELD_TYPE_DATEV2 &&
282
7.31k
                                to_lower(column.default_value()).find(to_lower("CURRENT_DATE")) !=
283
7.31k
                                        std::string::npos)) {
284
82
                DateV2Value<DateV2ValueType> dv;
285
82
                dv.from_unixtime(timestamp_ms / 1000, timezone);
286
82
                default_value = dv.to_string();
287
7.23k
            } else if (UNLIKELY(column.type() == FieldType::OLAP_FIELD_TYPE_BITMAP &&
288
7.23k
                                to_lower(column.default_value()).find(to_lower("BITMAP_EMPTY")) !=
289
7.23k
                                        std::string::npos)) {
290
0
                BitmapValue v = BitmapValue {};
291
0
                default_value = v.to_string();
292
7.23k
            } else {
293
7.23k
                default_value = column.default_value();
294
7.23k
            }
295
7.44k
            default_values.emplace_back(default_value);
296
12.3k
        } else {
297
            // place an empty string here
298
12.3k
            default_values.emplace_back();
299
12.3k
        }
300
19.7k
    }
301
3.65k
    CHECK_EQ(missing_cids.size(), default_values.size());
302
3.65k
}
303
304
9
bool FixedReadPlan::empty() const {
305
9
    return plan.empty();
306
9
}
307
308
22.7k
void FixedReadPlan::prepare_to_read(const RowLocation& row_location, size_t pos) {
309
22.7k
    plan[row_location.rowset_id][row_location.segment_id].emplace_back(row_location.row_id, pos);
310
22.7k
}
311
312
// read columns by read plan
313
// read_index: ori_pos-> block_idx
314
Status FixedReadPlan::read_columns_by_plan(
315
        const TabletSchema& tablet_schema, std::vector<uint32_t> cids_to_read,
316
        const std::map<RowsetId, RowsetSharedPtr>& rsid_to_rowset, Block& block,
317
        std::map<uint32_t, uint32_t>* read_index, bool force_read_old_delete_signs,
318
1.34k
        const signed char* __restrict cur_delete_signs) const {
319
1.34k
    if (force_read_old_delete_signs) {
320
        // always read delete sign column from historical data
321
1.32k
        if (block.get_position_by_name(DELETE_SIGN) == -1) {
322
790
            auto del_col_cid = tablet_schema.field_index(DELETE_SIGN);
323
790
            cids_to_read.emplace_back(del_col_cid);
324
790
            block.swap(tablet_schema.create_block_by_cids(cids_to_read));
325
790
        }
326
1.32k
    }
327
1.34k
    bool has_row_column = tablet_schema.has_row_store_for_all_columns();
328
1.34k
    auto mutable_columns = block.mutate_columns();
329
1.34k
    uint32_t read_idx = 0;
330
1.34k
    for (const auto& [rowset_id, segment_row_mappings] : plan) {
331
625
        for (const auto& [segment_id, mappings] : segment_row_mappings) {
332
625
            auto rowset_iter = rsid_to_rowset.find(rowset_id);
333
625
            CHECK(rowset_iter != rsid_to_rowset.end());
334
625
            std::vector<uint32_t> rids;
335
22.7k
            for (auto [rid, pos] : mappings) {
336
22.7k
                if (cur_delete_signs && cur_delete_signs[pos]) {
337
1
                    continue;
338
1
                }
339
22.7k
                rids.emplace_back(rid);
340
22.7k
                (*read_index)[static_cast<uint32_t>(pos)] = read_idx++;
341
22.7k
            }
342
625
            if (has_row_column) {
343
178
                auto st = BaseTablet::fetch_value_through_row_column(
344
178
                        rowset_iter->second, tablet_schema, segment_id, rids, cids_to_read, block);
345
178
                if (!st.ok()) {
346
0
                    LOG(WARNING) << "failed to fetch value through row column";
347
0
                    return st;
348
0
                }
349
178
                continue;
350
178
            }
351
2.57k
            for (size_t cid = 0; cid < mutable_columns.size(); ++cid) {
352
2.12k
                TabletColumn tablet_column = tablet_schema.column(cids_to_read[cid]);
353
2.12k
                auto st = doris::BaseTablet::fetch_value_by_rowids(
354
2.12k
                        rowset_iter->second, segment_id, rids, tablet_column, mutable_columns[cid]);
355
                // set read value to output block
356
2.12k
                if (!st.ok()) {
357
0
                    LOG(WARNING) << "failed to fetch value";
358
0
                    return st;
359
0
                }
360
2.12k
            }
361
447
        }
362
624
    }
363
1.34k
    block.set_columns(std::move(mutable_columns));
364
1.34k
    return Status::OK();
365
1.34k
}
366
367
Status FixedReadPlan::fill_missing_columns(
368
        RowsetWriterContext* rowset_ctx, const std::map<RowsetId, RowsetSharedPtr>& rsid_to_rowset,
369
        const TabletSchema& tablet_schema, Block& full_block,
370
        const std::vector<bool>& use_default_or_null_flag, bool has_default_or_nullable,
371
1.30k
        uint32_t segment_start_pos, const Block* block) const {
372
1.30k
    auto mutable_full_columns = full_block.mutate_columns();
373
    // create old value columns
374
1.30k
    const auto& missing_cids = rowset_ctx->partial_update_info->missing_cids;
375
1.30k
    bool have_input_seq_column = false;
376
1.30k
    if (tablet_schema.has_sequence_col()) {
377
224
        const std::vector<uint32_t>& including_cids = rowset_ctx->partial_update_info->update_cids;
378
224
        have_input_seq_column =
379
224
                (std::find(including_cids.cbegin(), including_cids.cend(),
380
224
                           tablet_schema.sequence_col_idx()) != including_cids.cend());
381
224
    }
382
383
1.30k
    auto old_value_block = tablet_schema.create_block_by_cids(missing_cids);
384
1.30k
    CHECK_EQ(missing_cids.size(), old_value_block.columns());
385
386
    // segment pos to write -> rowid to read in old_value_block
387
1.30k
    std::map<uint32_t, uint32_t> read_index;
388
1.30k
    RETURN_IF_ERROR(read_columns_by_plan(tablet_schema, missing_cids, rsid_to_rowset,
389
1.30k
                                         old_value_block, &read_index, true, nullptr));
390
391
1.30k
    const auto* old_delete_signs = BaseTablet::get_delete_sign_column_data(old_value_block);
392
1.30k
    if (old_delete_signs == nullptr) {
393
0
        return Status::InternalError("old delete signs column not found, block: {}",
394
0
                                     old_value_block.dump_structure());
395
0
    }
396
    // build default value columns
397
1.30k
    auto default_value_block = old_value_block.clone_empty();
398
1.30k
    RETURN_IF_ERROR(BaseTablet::generate_default_value_block(
399
1.30k
            tablet_schema, missing_cids, rowset_ctx->partial_update_info->default_values,
400
1.30k
            old_value_block, default_value_block));
401
1.30k
    auto mutable_default_value_columns = default_value_block.mutate_columns();
402
403
    // fill all missing value from mutable_old_columns, need to consider default value and null value
404
25.5k
    for (auto idx = 0; idx < use_default_or_null_flag.size(); idx++) {
405
24.2k
        auto segment_pos = idx + segment_start_pos;
406
24.2k
        auto pos_in_old_block = read_index[segment_pos];
407
408
114k
        for (auto i = 0; i < missing_cids.size(); ++i) {
409
            // if the column has default value, fill it with default value
410
            // otherwise, if the column is nullable, fill it with null value
411
90.5k
            const auto& tablet_column = tablet_schema.column(missing_cids[i]);
412
90.5k
            auto& missing_col = mutable_full_columns[missing_cids[i]];
413
414
90.5k
            bool should_use_default = use_default_or_null_flag[idx];
415
90.5k
            if (!should_use_default) {
416
79.1k
                bool old_row_delete_sign =
417
79.1k
                        (old_delete_signs != nullptr && old_delete_signs[pos_in_old_block] != 0);
418
79.1k
                if (old_row_delete_sign) {
419
151
                    if (!tablet_schema.has_sequence_col()) {
420
70
                        should_use_default = true;
421
81
                    } else if (have_input_seq_column || (!tablet_column.is_seqeunce_col())) {
422
                        // to keep the sequence column value not decreasing, we should read values of seq column
423
                        // from old rows even if the old row is deleted when the input don't specify the sequence column, otherwise
424
                        // it may cause the merge-on-read based compaction to produce incorrect results
425
77
                        should_use_default = true;
426
77
                    }
427
151
                }
428
79.1k
            }
429
430
90.5k
            if (should_use_default) {
431
11.5k
                if (tablet_column.has_default_value()) {
432
2.66k
                    missing_col->insert_from(*mutable_default_value_columns[i], 0);
433
8.91k
                } else if (tablet_column.is_nullable()) {
434
7.48k
                    auto* nullable_column = assert_cast<ColumnNullable*>(missing_col.get());
435
7.48k
                    nullable_column->insert_many_defaults(1);
436
7.48k
                } else if (tablet_schema.auto_increment_column() == tablet_column.name()) {
437
41
                    const auto& column =
438
41
                            *DORIS_TRY(rowset_ctx->tablet_schema->column(tablet_column.name()));
439
41
                    DCHECK(column.type() == FieldType::OLAP_FIELD_TYPE_BIGINT);
440
41
                    auto* auto_inc_column = assert_cast<ColumnInt64*>(missing_col.get());
441
41
                    int pos = block->get_position_by_name(BeConsts::PARTIAL_UPDATE_AUTO_INC_COL);
442
41
                    if (pos == -1) {
443
0
                        return Status::InternalError("auto increment column not found in block {}",
444
0
                                                     block->dump_structure());
445
0
                    }
446
41
                    auto_inc_column->insert_from(*block->get_by_position(pos).column.get(), idx);
447
1.38k
                } else {
448
                    // If the control flow reaches this branch, the column neither has default value
449
                    // nor is nullable. It means that the row's delete sign is marked, and the value
450
                    // columns are useless and won't be read. So we can just put arbitary values in the cells
451
1.38k
                    missing_col->insert(tablet_column.get_vec_type()->get_default());
452
1.38k
                }
453
78.9k
            } else {
454
78.9k
                missing_col->insert_from(*old_value_block.get_by_position(i).column,
455
78.9k
                                         pos_in_old_block);
456
78.9k
            }
457
90.5k
        }
458
24.2k
    }
459
1.30k
    full_block.set_columns(std::move(mutable_full_columns));
460
1.30k
    return Status::OK();
461
1.30k
}
462
463
void FlexibleReadPlan::prepare_to_read(const RowLocation& row_location, size_t pos,
464
1.78k
                                       const BitmapValue& skip_bitmap) {
465
1.78k
    if (!use_row_store) {
466
3.91k
        for (uint64_t col_uid : skip_bitmap) {
467
3.91k
            plan[row_location.rowset_id][row_location.segment_id][static_cast<uint32_t>(col_uid)]
468
3.91k
                    .emplace_back(row_location.row_id, pos);
469
3.91k
        }
470
930
    } else {
471
859
        row_store_plan[row_location.rowset_id][row_location.segment_id].emplace_back(
472
859
                row_location.row_id, pos);
473
859
    }
474
1.78k
}
475
476
Status FlexibleReadPlan::read_columns_by_plan(
477
        const TabletSchema& tablet_schema,
478
        const std::map<RowsetId, RowsetSharedPtr>& rsid_to_rowset, Block& old_value_block,
479
145
        std::map<uint32_t, std::map<uint32_t, uint32_t>>* read_index) const {
480
145
    auto mutable_columns = old_value_block.mutate_columns();
481
482
    // cid -> next rid to fill in block
483
145
    std::map<uint32_t, uint32_t> next_read_idx;
484
2.16k
    for (uint32_t cid {0}; cid < tablet_schema.num_columns(); cid++) {
485
2.02k
        next_read_idx[cid] = 0;
486
2.02k
    }
487
488
185
    for (const auto& [rowset_id, segment_mappings] : plan) {
489
185
        for (const auto& [segment_id, uid_mappings] : segment_mappings) {
490
1.51k
            for (const auto& [col_uid, mappings] : uid_mappings) {
491
1.51k
                auto rowset_iter = rsid_to_rowset.find(rowset_id);
492
1.51k
                CHECK(rowset_iter != rsid_to_rowset.end());
493
1.51k
                auto cid = tablet_schema.field_index(col_uid);
494
1.51k
                DCHECK_NE(cid, -1);
495
1.51k
                DCHECK_GE(cid, tablet_schema.num_key_columns());
496
1.51k
                std::vector<uint32_t> rids;
497
3.91k
                for (auto [rid, pos] : mappings) {
498
3.91k
                    rids.emplace_back(rid);
499
3.91k
                    (*read_index)[cid][static_cast<uint32_t>(pos)] = next_read_idx[cid]++;
500
3.91k
                }
501
502
1.51k
                TabletColumn tablet_column = tablet_schema.column(cid);
503
1.51k
                auto idx = cid - tablet_schema.num_key_columns();
504
1.51k
                RETURN_IF_ERROR(doris::BaseTablet::fetch_value_by_rowids(
505
1.51k
                        rowset_iter->second, segment_id, rids, tablet_column,
506
1.51k
                        mutable_columns[idx]));
507
1.51k
            }
508
185
        }
509
185
    }
510
    // !!!ATTENTION!!!: columns in block may have different size because every row has different columns to update
511
145
    old_value_block.set_columns(std::move(mutable_columns));
512
145
    return Status::OK();
513
145
}
514
515
Status FlexibleReadPlan::read_columns_by_plan(
516
        const TabletSchema& tablet_schema, const std::vector<uint32_t>& cids_to_read,
517
        const std::map<RowsetId, RowsetSharedPtr>& rsid_to_rowset, Block& old_value_block,
518
119
        std::map<uint32_t, uint32_t>* read_index) const {
519
119
    DCHECK(use_row_store);
520
119
    uint32_t read_idx = 0;
521
158
    for (const auto& [rowset_id, segment_row_mappings] : row_store_plan) {
522
158
        for (const auto& [segment_id, mappings] : segment_row_mappings) {
523
158
            auto rowset_iter = rsid_to_rowset.find(rowset_id);
524
158
            CHECK(rowset_iter != rsid_to_rowset.end());
525
158
            std::vector<uint32_t> rids;
526
859
            for (auto [rid, pos] : mappings) {
527
859
                rids.emplace_back(rid);
528
859
                (*read_index)[static_cast<uint32_t>(pos)] = read_idx++;
529
859
            }
530
158
            auto st = BaseTablet::fetch_value_through_row_column(rowset_iter->second, tablet_schema,
531
158
                                                                 segment_id, rids, cids_to_read,
532
158
                                                                 old_value_block);
533
158
            if (!st.ok()) {
534
0
                LOG(WARNING) << "failed to fetch value through row column";
535
0
                return st;
536
0
            }
537
158
        }
538
158
    }
539
119
    return Status::OK();
540
119
}
541
542
Status FlexibleReadPlan::fill_non_primary_key_columns(
543
        RowsetWriterContext* rowset_ctx, const std::map<RowsetId, RowsetSharedPtr>& rsid_to_rowset,
544
        const TabletSchema& tablet_schema, Block& full_block,
545
        const std::vector<bool>& use_default_or_null_flag, bool has_default_or_nullable,
546
        uint32_t segment_start_pos, uint32_t block_start_pos, const Block* block,
547
264
        std::vector<BitmapValue>* skip_bitmaps) const {
548
264
    auto mutable_full_columns = full_block.mutate_columns();
549
550
    // missing_cids are all non sort key columns' cids
551
264
    const auto& non_sort_key_cids = rowset_ctx->partial_update_info->missing_cids;
552
264
    auto old_value_block = tablet_schema.create_block_by_cids(non_sort_key_cids);
553
264
    CHECK_EQ(non_sort_key_cids.size(), old_value_block.columns());
554
555
264
    if (!use_row_store) {
556
145
        RETURN_IF_ERROR(fill_non_primary_key_columns_for_column_store(
557
145
                rowset_ctx, rsid_to_rowset, tablet_schema, non_sort_key_cids, old_value_block,
558
145
                mutable_full_columns, use_default_or_null_flag, has_default_or_nullable,
559
145
                segment_start_pos, block_start_pos, block, skip_bitmaps));
560
145
    } else {
561
119
        RETURN_IF_ERROR(fill_non_primary_key_columns_for_row_store(
562
119
                rowset_ctx, rsid_to_rowset, tablet_schema, non_sort_key_cids, old_value_block,
563
119
                mutable_full_columns, use_default_or_null_flag, has_default_or_nullable,
564
119
                segment_start_pos, block_start_pos, block, skip_bitmaps));
565
119
    }
566
264
    full_block.set_columns(std::move(mutable_full_columns));
567
264
    return Status::OK();
568
264
}
569
570
static void fill_non_primary_key_cell_for_column_store(
571
        const TabletColumn& tablet_column, uint32_t cid, MutableColumnPtr& new_col,
572
        const IColumn& default_value_col, const IColumn& old_value_col, const IColumn& cur_col,
573
        std::size_t block_pos, uint32_t segment_pos, bool skipped, bool row_has_sequence_col,
574
        bool use_default, const signed char* delete_sign_column_data,
575
        const TabletSchema& tablet_schema,
576
        std::map<uint32_t, std::map<uint32_t, uint32_t>>& read_index,
577
16.9k
        const PartialUpdateInfo* info) {
578
16.9k
    if (skipped) {
579
4.78k
        DCHECK(cid != tablet_schema.skip_bitmap_col_idx());
580
4.78k
        DCHECK(cid != tablet_schema.version_col_idx());
581
4.78k
        DCHECK(!tablet_column.is_row_store_column());
582
583
4.78k
        if (!use_default) {
584
3.91k
            if (delete_sign_column_data != nullptr) {
585
3.91k
                bool old_row_delete_sign = false;
586
3.91k
                if (auto it = read_index[tablet_schema.delete_sign_idx()].find(segment_pos);
587
3.91k
                    it != read_index[tablet_schema.delete_sign_idx()].end()) {
588
3.79k
                    old_row_delete_sign = (delete_sign_column_data[it->second] != 0);
589
3.79k
                }
590
591
3.91k
                if (old_row_delete_sign) {
592
7
                    if (!tablet_schema.has_sequence_col()) {
593
2
                        use_default = true;
594
5
                    } else if (row_has_sequence_col ||
595
5
                               (!tablet_column.is_seqeunce_col() &&
596
5
                                (tablet_column.unique_id() != info->sequence_map_col_uid()))) {
597
                        // to keep the sequence column value not decreasing, we should read values of seq column(and seq map column)
598
                        // from old rows even if the old row is deleted when the input don't specify the sequence column, otherwise
599
                        // it may cause the merge-on-read based compaction to produce incorrect results
600
3
                        use_default = true;
601
3
                    }
602
7
                }
603
3.91k
            }
604
3.91k
        }
605
4.78k
        if (!use_default && tablet_column.is_on_update_current_timestamp()) {
606
6
            use_default = true;
607
6
        }
608
4.78k
        if (use_default) {
609
873
            if (tablet_column.has_default_value()) {
610
424
                new_col->insert_from(default_value_col, 0);
611
449
            } else if (tablet_column.is_nullable()) {
612
426
                assert_cast<ColumnNullable*, TypeCheckOnRelease::DISABLE>(new_col.get())
613
426
                        ->insert_many_defaults(1);
614
426
            } else if (tablet_column.is_auto_increment()) {
615
                // In flexible partial update, the skip bitmap indicates whether a cell
616
                // is specified in the original load, so the generated auto-increment value is filled
617
                // in current block in place if needed rather than using a seperate column to
618
                // store the generated auto-increment value in fixed partial update
619
2
                new_col->insert_from(cur_col, block_pos);
620
21
            } else {
621
21
                new_col->insert(tablet_column.get_vec_type()->get_default());
622
21
            }
623
3.90k
        } else {
624
3.90k
            auto pos_in_old_block = read_index.at(cid).at(segment_pos);
625
3.90k
            new_col->insert_from(old_value_col, pos_in_old_block);
626
3.90k
        }
627
12.1k
    } else {
628
12.1k
        new_col->insert_from(cur_col, block_pos);
629
12.1k
    }
630
16.9k
}
631
632
Status FlexibleReadPlan::fill_non_primary_key_columns_for_column_store(
633
        RowsetWriterContext* rowset_ctx, const std::map<RowsetId, RowsetSharedPtr>& rsid_to_rowset,
634
        const TabletSchema& tablet_schema, const std::vector<uint32_t>& non_sort_key_cids,
635
        Block& old_value_block, MutableColumns& mutable_full_columns,
636
        const std::vector<bool>& use_default_or_null_flag, bool has_default_or_nullable,
637
        uint32_t segment_start_pos, uint32_t block_start_pos, const Block* block,
638
145
        std::vector<BitmapValue>* skip_bitmaps) const {
639
145
    auto* info = rowset_ctx->partial_update_info.get();
640
145
    int32_t seq_col_unique_id = -1;
641
145
    if (tablet_schema.has_sequence_col()) {
642
22
        seq_col_unique_id = tablet_schema.column(tablet_schema.sequence_col_idx()).unique_id();
643
22
    }
644
    // cid -> segment pos to write -> rowid to read in old_value_block
645
145
    std::map<uint32_t, std::map<uint32_t, uint32_t>> read_index;
646
145
    RETURN_IF_ERROR(
647
145
            read_columns_by_plan(tablet_schema, rsid_to_rowset, old_value_block, &read_index));
648
    // !!!ATTENTION!!!: columns in old_value_block may have different size because every row has different columns to update
649
650
145
    const auto* delete_sign_column_data = BaseTablet::get_delete_sign_column_data(old_value_block);
651
    // build default value columns
652
145
    auto default_value_block = old_value_block.clone_empty();
653
145
    if (has_default_or_nullable || delete_sign_column_data != nullptr) {
654
145
        RETURN_IF_ERROR(BaseTablet::generate_default_value_block(
655
145
                tablet_schema, non_sort_key_cids, info->default_values, old_value_block,
656
145
                default_value_block));
657
145
    }
658
659
    // fill all non sort key columns from mutable_old_columns, need to consider default value and null value
660
2.00k
    for (std::size_t i {0}; i < non_sort_key_cids.size(); i++) {
661
1.86k
        auto cid = non_sort_key_cids[i];
662
1.86k
        const auto& tablet_column = tablet_schema.column(cid);
663
1.86k
        auto col_uid = tablet_column.unique_id();
664
18.8k
        for (auto idx = 0; idx < use_default_or_null_flag.size(); idx++) {
665
16.9k
            auto segment_pos = segment_start_pos + idx;
666
16.9k
            auto block_pos = block_start_pos + idx;
667
668
16.9k
            fill_non_primary_key_cell_for_column_store(
669
16.9k
                    tablet_column, cid, mutable_full_columns[cid],
670
16.9k
                    *default_value_block.get_by_position(i).column,
671
16.9k
                    *old_value_block.get_by_position(i).column, *block->get_by_position(cid).column,
672
16.9k
                    block_pos, segment_pos, skip_bitmaps->at(block_pos).contains(col_uid),
673
16.9k
                    tablet_schema.has_sequence_col()
674
16.9k
                            ? !skip_bitmaps->at(block_pos).contains(seq_col_unique_id)
675
16.9k
                            : false,
676
16.9k
                    use_default_or_null_flag[idx], delete_sign_column_data, tablet_schema,
677
16.9k
                    read_index, info);
678
16.9k
        }
679
1.86k
    }
680
145
    return Status::OK();
681
145
}
682
683
static void fill_non_primary_key_cell_for_row_store(
684
        const TabletColumn& tablet_column, uint32_t cid, MutableColumnPtr& new_col,
685
        const IColumn& default_value_col, const IColumn& old_value_col, const IColumn& cur_col,
686
        std::size_t block_pos, bool skipped, bool row_has_sequence_col, bool use_default,
687
        const signed char* delete_sign_column_data, uint32_t pos_in_old_block,
688
16.5k
        const TabletSchema& tablet_schema, const PartialUpdateInfo* info) {
689
16.5k
    if (skipped) {
690
4.16k
        DCHECK(cid != tablet_schema.skip_bitmap_col_idx());
691
4.16k
        DCHECK(cid != tablet_schema.version_col_idx());
692
4.16k
        DCHECK(!tablet_column.is_row_store_column());
693
4.16k
        if (!use_default) {
694
3.64k
            if (delete_sign_column_data != nullptr) {
695
3.64k
                bool old_row_delete_sign = (delete_sign_column_data[pos_in_old_block] != 0);
696
3.64k
                if (old_row_delete_sign) {
697
7
                    if (!tablet_schema.has_sequence_col()) {
698
2
                        use_default = true;
699
5
                    } else if (row_has_sequence_col ||
700
5
                               (!tablet_column.is_seqeunce_col() &&
701
5
                                (tablet_column.unique_id() != info->sequence_map_col_uid()))) {
702
                        // to keep the sequence column value not decreasing, we should read values of seq column(and seq map column)
703
                        // from old rows even if the old row is deleted when the input don't specify the sequence column, otherwise
704
                        // it may cause the merge-on-read based compaction to produce incorrect results
705
3
                        use_default = true;
706
3
                    }
707
7
                }
708
3.64k
            }
709
3.64k
        }
710
711
4.16k
        if (!use_default && tablet_column.is_on_update_current_timestamp()) {
712
6
            use_default = true;
713
6
        }
714
4.16k
        if (use_default) {
715
529
            if (tablet_column.has_default_value()) {
716
175
                new_col->insert_from(default_value_col, 0);
717
354
            } else if (tablet_column.is_nullable()) {
718
350
                assert_cast<ColumnNullable*, TypeCheckOnRelease::DISABLE>(new_col.get())
719
350
                        ->insert_many_defaults(1);
720
350
            } else if (tablet_column.is_auto_increment()) {
721
                // In flexible partial update, the skip bitmap indicates whether a cell
722
                // is specified in the original load, so the generated auto-increment value is filled
723
                // in current block in place if needed rather than using a seperate column to
724
                // store the generated auto-increment value in fixed partial update
725
2
                new_col->insert_from(cur_col, block_pos);
726
2
            } else {
727
2
                new_col->insert(tablet_column.get_vec_type()->get_default());
728
2
            }
729
3.63k
        } else {
730
3.63k
            new_col->insert_from(old_value_col, pos_in_old_block);
731
3.63k
        }
732
12.3k
    } else {
733
12.3k
        new_col->insert_from(cur_col, block_pos);
734
12.3k
    }
735
16.5k
}
736
737
Status FlexibleReadPlan::fill_non_primary_key_columns_for_row_store(
738
        RowsetWriterContext* rowset_ctx, const std::map<RowsetId, RowsetSharedPtr>& rsid_to_rowset,
739
        const TabletSchema& tablet_schema, const std::vector<uint32_t>& non_sort_key_cids,
740
        Block& old_value_block, MutableColumns& mutable_full_columns,
741
        const std::vector<bool>& use_default_or_null_flag, bool has_default_or_nullable,
742
        uint32_t segment_start_pos, uint32_t block_start_pos, const Block* block,
743
119
        std::vector<BitmapValue>* skip_bitmaps) const {
744
119
    auto* info = rowset_ctx->partial_update_info.get();
745
119
    int32_t seq_col_unique_id = -1;
746
119
    if (tablet_schema.has_sequence_col()) {
747
3
        seq_col_unique_id = tablet_schema.column(tablet_schema.sequence_col_idx()).unique_id();
748
3
    }
749
    // segment pos to write -> rowid to read in old_value_block
750
119
    std::map<uint32_t, uint32_t> read_index;
751
119
    RETURN_IF_ERROR(read_columns_by_plan(tablet_schema, non_sort_key_cids, rsid_to_rowset,
752
119
                                         old_value_block, &read_index));
753
754
119
    const auto* delete_sign_column_data = BaseTablet::get_delete_sign_column_data(old_value_block);
755
    // build default value columns
756
119
    auto default_value_block = old_value_block.clone_empty();
757
119
    if (has_default_or_nullable || delete_sign_column_data != nullptr) {
758
119
        RETURN_IF_ERROR(BaseTablet::generate_default_value_block(
759
119
                tablet_schema, non_sort_key_cids, info->default_values, old_value_block,
760
119
                default_value_block));
761
119
    }
762
763
    // fill all non sort key columns from mutable_old_columns, need to consider default value and null value
764
1.87k
    for (std::size_t i {0}; i < non_sort_key_cids.size(); i++) {
765
1.75k
        auto cid = non_sort_key_cids[i];
766
1.75k
        const auto& tablet_column = tablet_schema.column(cid);
767
1.75k
        auto col_uid = tablet_column.unique_id();
768
18.2k
        for (auto idx = 0; idx < use_default_or_null_flag.size(); idx++) {
769
16.5k
            auto segment_pos = segment_start_pos + idx;
770
16.5k
            auto block_pos = block_start_pos + idx;
771
16.5k
            auto pos_in_old_block = read_index[segment_pos];
772
773
16.5k
            fill_non_primary_key_cell_for_row_store(
774
16.5k
                    tablet_column, cid, mutable_full_columns[cid],
775
16.5k
                    *default_value_block.get_by_position(i).column,
776
16.5k
                    *old_value_block.get_by_position(i).column, *block->get_by_position(cid).column,
777
16.5k
                    block_pos, skip_bitmaps->at(block_pos).contains(col_uid),
778
16.5k
                    tablet_schema.has_sequence_col()
779
16.5k
                            ? !skip_bitmaps->at(block_pos).contains(seq_col_unique_id)
780
16.5k
                            : false,
781
16.5k
                    use_default_or_null_flag[idx], delete_sign_column_data, pos_in_old_block,
782
16.5k
                    tablet_schema, info);
783
16.5k
        }
784
1.75k
    }
785
119
    return Status::OK();
786
119
}
787
788
BlockAggregator::BlockAggregator(segment_v2::VerticalSegmentWriter& vertical_segment_writer)
789
56.0k
        : _writer(vertical_segment_writer), _tablet_schema(*_writer._tablet_schema) {}
790
791
void BlockAggregator::merge_one_row(MutableBlock& dst_block, Block* src_block, int rid,
792
153
                                    BitmapValue& skip_bitmap) {
793
1.57k
    for (size_t cid {_tablet_schema.num_key_columns()}; cid < _tablet_schema.num_columns(); cid++) {
794
1.42k
        if (cid == _tablet_schema.skip_bitmap_col_idx()) {
795
153
            auto& cur_skip_bitmap =
796
153
                    assert_cast<ColumnBitmap*>(dst_block.mutable_columns()[cid].get())
797
153
                            ->get_data()
798
153
                            .back();
799
153
            const auto& new_row_skip_bitmap =
800
153
                    assert_cast<ColumnBitmap*>(
801
153
                            src_block->get_by_position(cid).column->assume_mutable().get())
802
153
                            ->get_data()[rid];
803
153
            cur_skip_bitmap &= new_row_skip_bitmap;
804
153
            continue;
805
153
        }
806
1.27k
        if (!skip_bitmap.contains(_tablet_schema.column(cid).unique_id())) {
807
460
            dst_block.mutable_columns()[cid]->pop_back(1);
808
460
            dst_block.mutable_columns()[cid]->insert_from(*src_block->get_by_position(cid).column,
809
460
                                                          rid);
810
460
        }
811
1.27k
    }
812
153
    VLOG_DEBUG << fmt::format("merge a row, after merge, output_block.rows()={}, state: {}",
813
0
                              dst_block.rows(), _state.to_string());
814
153
}
815
816
252
void BlockAggregator::append_one_row(MutableBlock& dst_block, Block* src_block, int rid) {
817
252
    dst_block.add_row(src_block, rid);
818
252
    _state.rows++;
819
252
    VLOG_DEBUG << fmt::format("append a new row, after append, output_block.rows()={}, state: {}",
820
0
                              dst_block.rows(), _state.to_string());
821
252
}
822
823
123
void BlockAggregator::remove_last_n_rows(MutableBlock& dst_block, int n) {
824
123
    if (n > 0) {
825
968
        for (size_t cid {0}; cid < _tablet_schema.num_columns(); cid++) {
826
880
            DCHECK_GE(dst_block.mutable_columns()[cid]->size(), n);
827
880
            dst_block.mutable_columns()[cid]->pop_back(n);
828
880
        }
829
88
    }
830
123
}
831
832
void BlockAggregator::append_or_merge_row(MutableBlock& dst_block, Block* src_block, int rid,
833
405
                                          BitmapValue& skip_bitmap, bool have_delete_sign) {
834
405
    if (have_delete_sign) {
835
        // remove all the previous batched rows
836
123
        remove_last_n_rows(dst_block, _state.rows);
837
123
        _state.rows = 0;
838
123
        _state.has_row_with_delete_sign = true;
839
840
123
        append_one_row(dst_block, src_block, rid);
841
282
    } else {
842
282
        if (_state.should_merge()) {
843
153
            merge_one_row(dst_block, src_block, rid, skip_bitmap);
844
153
        } else {
845
129
            append_one_row(dst_block, src_block, rid);
846
129
        }
847
282
    }
848
405
};
849
850
Status BlockAggregator::aggregate_rows(
851
        MutableBlock& output_block, Block* block, int start, int end, std::string key,
852
        std::vector<BitmapValue>* skip_bitmaps, const signed char* delete_signs,
853
        IOlapColumnDataAccessor* seq_column, const std::vector<RowsetSharedPtr>& specified_rowsets,
854
133
        std::vector<std::unique_ptr<SegmentCacheHandle>>& segment_caches) {
855
133
    VLOG_DEBUG << fmt::format("merge rows in range=[{}-{})", start, end);
856
133
    if (end - start == 1) {
857
34
        output_block.add_row(block, start);
858
34
        VLOG_DEBUG << fmt::format("append a row directly, rid={}", start);
859
34
        return Status::OK();
860
34
    }
861
862
99
    auto seq_col_unique_id = _tablet_schema.column(_tablet_schema.sequence_col_idx()).unique_id();
863
99
    auto delete_sign_col_unique_id =
864
99
            _tablet_schema.column(_tablet_schema.delete_sign_idx()).unique_id();
865
866
99
    _state.reset();
867
868
99
    RowLocation loc;
869
99
    RowsetSharedPtr rowset;
870
99
    std::string previous_encoded_seq_value {};
871
99
    Status st = _writer._tablet->lookup_row_key(
872
99
            key, &_tablet_schema, false, specified_rowsets, &loc, _writer._mow_context->max_version,
873
99
            segment_caches, &rowset, true, &previous_encoded_seq_value);
874
99
    int pos = start;
875
99
    bool is_expected_st = (st.is<ErrorCode::KEY_NOT_FOUND>() || st.ok());
876
99
    DCHECK(is_expected_st || st.is<ErrorCode::MEM_LIMIT_EXCEEDED>())
877
0
            << "[BlockAggregator::aggregate_rows] unexpected error status while lookup_row_key:"
878
0
            << st;
879
99
    if (!is_expected_st) {
880
0
        return st;
881
0
    }
882
883
99
    std::string cur_seq_val;
884
99
    if (st.ok()) {
885
97
        for (pos = start; pos < end; pos++) {
886
97
            auto& skip_bitmap = skip_bitmaps->at(pos);
887
97
            bool row_has_sequence_col = (!skip_bitmap.contains(seq_col_unique_id));
888
            // Discard all the rows whose seq value is smaller than previous_encoded_seq_value.
889
97
            if (row_has_sequence_col) {
890
56
                std::string seq_val {};
891
56
                _writer._encode_seq_column(seq_column, pos, &seq_val);
892
56
                if (Slice {seq_val}.compare(Slice {previous_encoded_seq_value}) < 0) {
893
19
                    continue;
894
19
                }
895
37
                cur_seq_val = std::move(seq_val);
896
37
                break;
897
56
            }
898
41
            cur_seq_val = std::move(previous_encoded_seq_value);
899
41
            break;
900
97
        }
901
78
    } else {
902
21
        pos = start;
903
21
        auto& skip_bitmap = skip_bitmaps->at(pos);
904
21
        bool row_has_sequence_col = (!skip_bitmap.contains(seq_col_unique_id));
905
21
        if (row_has_sequence_col) {
906
15
            std::string seq_val {};
907
            // for rows that don't specify seqeunce col, seq_val will be encoded to minial value
908
15
            _writer._encode_seq_column(seq_column, pos, &seq_val);
909
15
            cur_seq_val = std::move(seq_val);
910
15
        } else {
911
6
            cur_seq_val.clear();
912
6
            RETURN_IF_ERROR(_writer._generate_encoded_default_seq_value(
913
6
                    _tablet_schema, *_writer._opts.rowset_ctx->partial_update_info, &cur_seq_val));
914
6
        }
915
21
    }
916
917
562
    for (int rid {pos}; rid < end; rid++) {
918
463
        auto& skip_bitmap = skip_bitmaps->at(rid);
919
463
        bool row_has_sequence_col = (!skip_bitmap.contains(seq_col_unique_id));
920
463
        bool have_delete_sign =
921
463
                (!skip_bitmap.contains(delete_sign_col_unique_id) && delete_signs[rid] != 0);
922
463
        if (!row_has_sequence_col) {
923
193
            append_or_merge_row(output_block, block, rid, skip_bitmap, have_delete_sign);
924
270
        } else {
925
270
            std::string seq_val {};
926
270
            _writer._encode_seq_column(seq_column, rid, &seq_val);
927
270
            if (Slice {seq_val}.compare(Slice {cur_seq_val}) >= 0) {
928
212
                append_or_merge_row(output_block, block, rid, skip_bitmap, have_delete_sign);
929
212
                cur_seq_val = std::move(seq_val);
930
212
            } else {
931
58
                VLOG_DEBUG << fmt::format(
932
0
                        "skip rid={} becasue its seq value is lower than the previous", rid);
933
58
            }
934
270
        }
935
463
    }
936
99
    return Status::OK();
937
99
};
938
939
Status BlockAggregator::aggregate_for_sequence_column(
940
        Block* block, int num_rows, const std::vector<IOlapColumnDataAccessor*>& key_columns,
941
        IOlapColumnDataAccessor* seq_column, const std::vector<RowsetSharedPtr>& specified_rowsets,
942
25
        std::vector<std::unique_ptr<SegmentCacheHandle>>& segment_caches) {
943
25
    DCHECK_EQ(block->columns(), _tablet_schema.num_columns());
944
    // the process logic here is the same as MemTable::_aggregate_for_flexible_partial_update_without_seq_col()
945
    // after this function, there will be at most 2 rows for a specified key
946
25
    std::vector<BitmapValue>* skip_bitmaps = &(
947
25
            assert_cast<ColumnBitmap*>(block->get_by_position(_tablet_schema.skip_bitmap_col_idx())
948
25
                                               .column->assume_mutable()
949
25
                                               .get())
950
25
                    ->get_data());
951
25
    const auto* delete_signs = BaseTablet::get_delete_sign_column_data(*block, num_rows);
952
953
25
    auto filtered_block = _tablet_schema.create_block();
954
25
    MutableBlock output_block = MutableBlock::build_mutable_block(&filtered_block);
955
956
25
    int same_key_rows {0};
957
25
    std::string previous_key {};
958
541
    for (int block_pos {0}; block_pos < num_rows; block_pos++) {
959
516
        std::string key = _writer._full_encode_keys(key_columns, block_pos);
960
516
        if (block_pos > 0 && previous_key == key) {
961
383
            same_key_rows++;
962
383
        } else {
963
133
            if (same_key_rows > 0) {
964
108
                RETURN_IF_ERROR(aggregate_rows(output_block, block, block_pos - same_key_rows,
965
108
                                               block_pos, std::move(previous_key), skip_bitmaps,
966
108
                                               delete_signs, seq_column, specified_rowsets,
967
108
                                               segment_caches));
968
108
            }
969
133
            same_key_rows = 1;
970
133
        }
971
516
        previous_key = std::move(key);
972
516
    }
973
25
    if (same_key_rows > 0) {
974
25
        RETURN_IF_ERROR(aggregate_rows(output_block, block, num_rows - same_key_rows, num_rows,
975
25
                                       std::move(previous_key), skip_bitmaps, delete_signs,
976
25
                                       seq_column, specified_rowsets, segment_caches));
977
25
    }
978
979
25
    block->swap(output_block.to_block());
980
25
    return Status::OK();
981
25
}
982
983
Status BlockAggregator::fill_sequence_column(Block* block, size_t num_rows,
984
                                             const FixedReadPlan& read_plan,
985
4
                                             std::vector<BitmapValue>& skip_bitmaps) {
986
4
    DCHECK(_tablet_schema.has_sequence_col());
987
4
    std::vector<uint32_t> cids {static_cast<uint32_t>(_tablet_schema.sequence_col_idx())};
988
4
    auto seq_col_unique_id = _tablet_schema.column(_tablet_schema.sequence_col_idx()).unique_id();
989
990
4
    auto seq_col_block = _tablet_schema.create_block_by_cids(cids);
991
4
    auto tmp_block = _tablet_schema.create_block_by_cids(cids);
992
4
    std::map<uint32_t, uint32_t> read_index;
993
4
    RETURN_IF_ERROR(read_plan.read_columns_by_plan(_tablet_schema, cids, _writer._rsid_to_rowset,
994
4
                                                   seq_col_block, &read_index, false));
995
996
4
    auto new_seq_col_ptr = tmp_block.get_by_position(0).column->assume_mutable();
997
4
    const auto& old_seq_col_ptr = *seq_col_block.get_by_position(0).column;
998
4
    const auto& cur_seq_col_ptr = *block->get_by_position(_tablet_schema.sequence_col_idx()).column;
999
80
    for (uint32_t block_pos {0}; block_pos < num_rows; block_pos++) {
1000
76
        if (read_index.contains(block_pos)) {
1001
14
            new_seq_col_ptr->insert_from(old_seq_col_ptr, read_index[block_pos]);
1002
14
            skip_bitmaps[block_pos].remove(seq_col_unique_id);
1003
62
        } else {
1004
62
            new_seq_col_ptr->insert_from(cur_seq_col_ptr, block_pos);
1005
62
        }
1006
76
    }
1007
4
    block->replace_by_position(_tablet_schema.sequence_col_idx(), std::move(new_seq_col_ptr));
1008
4
    return Status::OK();
1009
4
}
1010
1011
Status BlockAggregator::aggregate_for_insert_after_delete(
1012
        Block* block, size_t num_rows, const std::vector<IOlapColumnDataAccessor*>& key_columns,
1013
        const std::vector<RowsetSharedPtr>& specified_rowsets,
1014
265
        std::vector<std::unique_ptr<SegmentCacheHandle>>& segment_caches) {
1015
265
    DCHECK_EQ(block->columns(), _tablet_schema.num_columns());
1016
    // there will be at most 2 rows for a specified key in block when control flow reaches here
1017
    // after this function, there will not be duplicate rows in block
1018
1019
265
    std::vector<BitmapValue>* skip_bitmaps = &(
1020
265
            assert_cast<ColumnBitmap*>(block->get_by_position(_tablet_schema.skip_bitmap_col_idx())
1021
265
                                               .column->assume_mutable()
1022
265
                                               .get())
1023
265
                    ->get_data());
1024
265
    const auto* delete_signs = BaseTablet::get_delete_sign_column_data(*block, num_rows);
1025
1026
265
    auto filter_column = ColumnUInt8::create(num_rows, 1);
1027
265
    auto* __restrict filter_map = filter_column->get_data().data();
1028
265
    std::string previous_key {};
1029
265
    bool previous_has_delete_sign {false};
1030
265
    int duplicate_rows {0};
1031
265
    int32_t delete_sign_col_unique_id =
1032
265
            _tablet_schema.column(_tablet_schema.delete_sign_idx()).unique_id();
1033
265
    auto seq_col_unique_id =
1034
265
            (_tablet_schema.sequence_col_idx() != -1)
1035
265
                    ? _tablet_schema.column(_tablet_schema.sequence_col_idx()).unique_id()
1036
265
                    : -1;
1037
265
    FixedReadPlan read_plan;
1038
2.45k
    for (size_t block_pos {0}; block_pos < num_rows; block_pos++) {
1039
2.19k
        size_t delta_pos = block_pos;
1040
2.19k
        auto& skip_bitmap = skip_bitmaps->at(block_pos);
1041
2.19k
        std::string key = _writer._full_encode_keys(key_columns, delta_pos);
1042
2.19k
        bool have_delete_sign =
1043
2.19k
                (!skip_bitmap.contains(delete_sign_col_unique_id) && delete_signs[block_pos] != 0);
1044
2.19k
        if (delta_pos > 0 && previous_key == key) {
1045
            // !!ATTENTION!!: We can only remove the row with delete sign if there is a insert with the same key after this row.
1046
            // If there is only a row with delete sign, we should keep it and can't remove it from block, because
1047
            // compaction will not use the delete bitmap when reading data. So there may still be rows with delete sign
1048
            // in later process
1049
43
            DCHECK(previous_has_delete_sign);
1050
43
            DCHECK(!have_delete_sign);
1051
43
            ++duplicate_rows;
1052
43
            RowLocation loc;
1053
43
            RowsetSharedPtr rowset;
1054
43
            Status st = _writer._tablet->lookup_row_key(
1055
43
                    key, &_tablet_schema, false, specified_rowsets, &loc,
1056
43
                    _writer._mow_context->max_version, segment_caches, &rowset, true);
1057
43
            bool is_expected_st = (st.is<ErrorCode::KEY_NOT_FOUND>() || st.ok());
1058
43
            DCHECK(is_expected_st || st.is<ErrorCode::MEM_LIMIT_EXCEEDED>())
1059
0
                    << "[BlockAggregator::aggregate_for_insert_after_delete] unexpected error "
1060
0
                       "status while lookup_row_key:"
1061
0
                    << st;
1062
43
            if (!is_expected_st) {
1063
0
                return st;
1064
0
            }
1065
1066
43
            Slice previous_seq_slice {};
1067
43
            if (st.ok()) {
1068
38
                if (_tablet_schema.has_sequence_col()) {
1069
                    // if the insert row doesn't specify the sequence column, we need to
1070
                    // read the historical's sequence column value so that we don't need
1071
                    // to handle seqeunce column in append_block_with_flexible_content()
1072
                    // for this row
1073
34
                    bool row_has_sequence_col = (!skip_bitmap.contains(seq_col_unique_id));
1074
34
                    if (!row_has_sequence_col) {
1075
14
                        read_plan.prepare_to_read(loc, block_pos);
1076
14
                        _writer._rsid_to_rowset.emplace(rowset->rowset_id(), rowset);
1077
14
                    }
1078
34
                }
1079
                // delete the existing row
1080
38
                _writer._mow_context->delete_bitmap->add(
1081
38
                        {loc.rowset_id, loc.segment_id, DeleteBitmap::TEMP_VERSION_COMMON},
1082
38
                        loc.row_id);
1083
38
            }
1084
            // and remove the row with delete sign from the current block
1085
43
            filter_map[block_pos - 1] = 0;
1086
43
        }
1087
2.19k
        previous_has_delete_sign = have_delete_sign;
1088
2.19k
        previous_key = std::move(key);
1089
2.19k
    }
1090
265
    if (duplicate_rows > 0) {
1091
9
        if (!read_plan.empty()) {
1092
            // fill sequence column value for some rows
1093
4
            RETURN_IF_ERROR(fill_sequence_column(block, num_rows, read_plan, *skip_bitmaps));
1094
4
        }
1095
9
        RETURN_IF_ERROR(filter_block(block, num_rows, std::move(filter_column), duplicate_rows,
1096
9
                                     "__filter_insert_after_delete_col__"));
1097
9
    }
1098
265
    return Status::OK();
1099
265
}
1100
1101
Status BlockAggregator::filter_block(Block* block, size_t num_rows, MutableColumnPtr filter_column,
1102
9
                                     int duplicate_rows, std::string col_name) {
1103
9
    auto num_cols = block->columns();
1104
9
    block->insert({std::move(filter_column), std::make_shared<DataTypeUInt8>(), col_name});
1105
9
    RETURN_IF_ERROR(Block::filter_block(block, num_cols, num_cols));
1106
9
    DCHECK_EQ(num_cols, block->columns());
1107
9
    size_t merged_rows = num_rows - block->rows();
1108
9
    if (duplicate_rows != merged_rows) {
1109
0
        auto msg = fmt::format(
1110
0
                "filter_block_for_flexible_partial_update {}: duplicate_rows != merged_rows, "
1111
0
                "duplicate_keys={}, merged_rows={}, num_rows={}, mutable_block->rows()={}",
1112
0
                col_name, duplicate_rows, merged_rows, num_rows, block->rows());
1113
0
        DCHECK(false) << msg;
1114
0
        return Status::InternalError<false>(msg);
1115
0
    }
1116
9
    return Status::OK();
1117
9
}
1118
1119
Status BlockAggregator::convert_pk_columns(Block* block, size_t row_pos, size_t num_rows,
1120
545
                                           std::vector<IOlapColumnDataAccessor*>& key_columns) {
1121
545
    key_columns.clear();
1122
1.15k
    for (uint32_t cid {0}; cid < _tablet_schema.num_key_columns(); cid++) {
1123
605
        RETURN_IF_ERROR(_writer._olap_data_convertor->set_source_content_with_specifid_column(
1124
605
                block->get_by_position(cid), row_pos, num_rows, cid));
1125
605
        auto [status, column] = _writer._olap_data_convertor->convert_column_data(cid);
1126
605
        if (!status.ok()) {
1127
0
            return status;
1128
0
        }
1129
605
        key_columns.push_back(column);
1130
605
    }
1131
545
    return Status::OK();
1132
545
}
1133
1134
Status BlockAggregator::convert_seq_column(Block* block, size_t row_pos, size_t num_rows,
1135
545
                                           IOlapColumnDataAccessor*& seq_column) {
1136
545
    seq_column = nullptr;
1137
545
    if (_tablet_schema.has_sequence_col()) {
1138
65
        auto seq_col_idx = _tablet_schema.sequence_col_idx();
1139
65
        RETURN_IF_ERROR(_writer._olap_data_convertor->set_source_content_with_specifid_column(
1140
65
                block->get_by_position(seq_col_idx), row_pos, num_rows, seq_col_idx));
1141
65
        auto [status, column] = _writer._olap_data_convertor->convert_column_data(seq_col_idx);
1142
65
        if (!status.ok()) {
1143
0
            return status;
1144
0
        }
1145
65
        seq_column = column;
1146
65
    }
1147
545
    return Status::OK();
1148
545
};
1149
1150
Status BlockAggregator::aggregate_for_flexible_partial_update(
1151
        Block* block, size_t num_rows, const std::vector<RowsetSharedPtr>& specified_rowsets,
1152
265
        std::vector<std::unique_ptr<SegmentCacheHandle>>& segment_caches) {
1153
265
    std::vector<IOlapColumnDataAccessor*> key_columns {};
1154
265
    IOlapColumnDataAccessor* seq_column {nullptr};
1155
1156
265
    RETURN_IF_ERROR(convert_pk_columns(block, 0, num_rows, key_columns));
1157
265
    RETURN_IF_ERROR(convert_seq_column(block, 0, num_rows, seq_column));
1158
1159
    // 1. merge duplicate rows when table has sequence column
1160
    // When there are multiple rows with the same keys in memtable, some of them specify specify the sequence column,
1161
    // some of them don't. We can't do the de-duplication in memtable because we don't know the historical data. We must
1162
    // de-duplicate them here.
1163
265
    if (_tablet_schema.has_sequence_col()) {
1164
25
        RETURN_IF_ERROR(aggregate_for_sequence_column(block, static_cast<int>(num_rows),
1165
25
                                                      key_columns, seq_column, specified_rowsets,
1166
25
                                                      segment_caches));
1167
25
    }
1168
1169
    // 2. merge duplicate rows and handle insert after delete
1170
265
    if (block->rows() != num_rows) {
1171
15
        num_rows = block->rows();
1172
        // data in block has changed, should re-encode key columns, sequence column
1173
15
        _writer._olap_data_convertor->clear_source_content();
1174
15
        RETURN_IF_ERROR(convert_pk_columns(block, 0, num_rows, key_columns));
1175
15
        RETURN_IF_ERROR(convert_seq_column(block, 0, num_rows, seq_column));
1176
15
    }
1177
265
    RETURN_IF_ERROR(aggregate_for_insert_after_delete(block, num_rows, key_columns,
1178
265
                                                      specified_rowsets, segment_caches));
1179
265
    return Status::OK();
1180
265
}
1181
1182
} // namespace doris