Coverage Report

Created: 2026-04-01 06:23

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
be/src/exec/common/join_utils.h
Line
Count
Source
1
// Licensed to the Apache Software Foundation (ASF) under one
2
// or more contributor license agreements.  See the NOTICE file
3
// distributed with this work for additional information
4
// regarding copyright ownership.  The ASF licenses this file
5
// to you under the Apache License, Version 2.0 (the
6
// "License"); you may not use this file except in compliance
7
// with the License.  You may obtain a copy of the License at
8
//
9
//   http://www.apache.org/licenses/LICENSE-2.0
10
//
11
// Unless required by applicable law or agreed to in writing,
12
// software distributed under the License is distributed on an
13
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
14
// KIND, either express or implied.  See the License for the
15
// specific language governing permissions and limitations
16
// under the License.
17
18
#pragma once
19
20
#include <algorithm>
21
#include <variant>
22
23
#include "exec/common/hash_table/hash_key_type.h"
24
#include "exec/common/hash_table/hash_map_context.h"
25
#include "exec/common/hash_table/join_hash_table.h"
26
27
namespace doris {
28
29
// Devirtualize compare_at for ASOF JOIN supported column types.
30
// ASOF JOIN only supports DateV2, DateTimeV2, and TimestampTZ.
31
// Dispatches to the concrete ColumnVector<T> once so that all compare_at
32
// calls inside `func` are direct (non-virtual) calls.
33
// `func` receives a single argument: a const pointer to the concrete column
34
// (or const IColumn* as fallback for unexpected types).
35
template <typename Func>
36
125
decltype(auto) asof_column_dispatch(const IColumn* col, Func&& func) {
37
125
    if (const auto* c_dv2 = check_and_get_column<ColumnDateV2>(col)) {
38
1
        return std::forward<Func>(func)(c_dv2);
39
124
    } else if (const auto* c_dtv2 = check_and_get_column<ColumnDateTimeV2>(col)) {
40
122
        return std::forward<Func>(func)(c_dtv2);
41
122
    } else if (const auto* c_tstz = check_and_get_column<ColumnTimeStampTz>(col)) {
42
2
        return std::forward<Func>(func)(c_tstz);
43
2
    } else {
44
0
        return std::forward<Func>(func)(col);
45
0
    }
46
125
}
47
using JoinOpVariants =
48
        std::variant<std::integral_constant<TJoinOp::type, TJoinOp::INNER_JOIN>,
49
                     std::integral_constant<TJoinOp::type, TJoinOp::LEFT_SEMI_JOIN>,
50
                     std::integral_constant<TJoinOp::type, TJoinOp::LEFT_ANTI_JOIN>,
51
                     std::integral_constant<TJoinOp::type, TJoinOp::LEFT_OUTER_JOIN>,
52
                     std::integral_constant<TJoinOp::type, TJoinOp::FULL_OUTER_JOIN>,
53
                     std::integral_constant<TJoinOp::type, TJoinOp::RIGHT_OUTER_JOIN>,
54
                     std::integral_constant<TJoinOp::type, TJoinOp::CROSS_JOIN>,
55
                     std::integral_constant<TJoinOp::type, TJoinOp::RIGHT_SEMI_JOIN>,
56
                     std::integral_constant<TJoinOp::type, TJoinOp::RIGHT_ANTI_JOIN>,
57
                     std::integral_constant<TJoinOp::type, TJoinOp::NULL_AWARE_LEFT_ANTI_JOIN>,
58
                     std::integral_constant<TJoinOp::type, TJoinOp::NULL_AWARE_LEFT_SEMI_JOIN>,
59
                     std::integral_constant<TJoinOp::type, TJoinOp::ASOF_LEFT_INNER_JOIN>,
60
                     std::integral_constant<TJoinOp::type, TJoinOp::ASOF_LEFT_OUTER_JOIN>>;
61
62
589k
inline bool is_asof_join(TJoinOp::type join_op) {
63
589k
    return join_op == TJoinOp::ASOF_LEFT_INNER_JOIN || join_op == TJoinOp::ASOF_LEFT_OUTER_JOIN;
64
589k
}
65
66
template <int JoinOpType>
67
inline constexpr bool is_asof_join_op_v =
68
        JoinOpType == TJoinOp::ASOF_LEFT_INNER_JOIN || JoinOpType == TJoinOp::ASOF_LEFT_OUTER_JOIN;
69
70
template <int JoinOpType>
71
inline constexpr bool is_asof_outer_join_op_v = JoinOpType == TJoinOp::ASOF_LEFT_OUTER_JOIN;
72
73
template <class T>
74
using PrimaryTypeHashTableContext = MethodOneNumber<T, JoinHashMap<T, HashCRC32<T>, false>>;
75
76
template <class T>
77
using DirectPrimaryTypeHashTableContext =
78
        MethodOneNumberDirect<T, JoinHashMap<T, HashCRC32<T>, true>>;
79
80
template <class Key>
81
using FixedKeyHashTableContext = MethodKeysFixed<JoinHashMap<Key, HashCRC32<Key>, false>>;
82
83
using SerializedHashTableContext =
84
        MethodSerialized<JoinHashMap<StringRef, DefaultHash<StringRef>, false>>;
85
using MethodOneString = MethodStringNoCache<JoinHashMap<StringRef, DefaultHash<StringRef>, false>>;
86
87
using HashTableVariants = std::variant<
88
        std::monostate, SerializedHashTableContext, PrimaryTypeHashTableContext<UInt8>,
89
        PrimaryTypeHashTableContext<UInt16>, PrimaryTypeHashTableContext<UInt32>,
90
        PrimaryTypeHashTableContext<UInt64>, PrimaryTypeHashTableContext<UInt128>,
91
        PrimaryTypeHashTableContext<UInt256>, DirectPrimaryTypeHashTableContext<UInt8>,
92
        DirectPrimaryTypeHashTableContext<UInt16>, DirectPrimaryTypeHashTableContext<UInt32>,
93
        DirectPrimaryTypeHashTableContext<UInt64>, DirectPrimaryTypeHashTableContext<UInt128>,
94
        FixedKeyHashTableContext<UInt64>, FixedKeyHashTableContext<UInt72>,
95
        FixedKeyHashTableContext<UInt96>, FixedKeyHashTableContext<UInt104>,
96
        FixedKeyHashTableContext<UInt128>, FixedKeyHashTableContext<UInt136>,
97
        FixedKeyHashTableContext<UInt256>, MethodOneString>;
98
99
struct JoinDataVariants {
100
    HashTableVariants method_variant;
101
102
127k
    void init(const std::vector<DataTypePtr>& data_types, HashKeyType type) {
103
127k
        switch (type) {
104
14.7k
        case HashKeyType::serialized:
105
14.7k
            method_variant.emplace<SerializedHashTableContext>();
106
14.7k
            break;
107
2.44k
        case HashKeyType::int8_key:
108
2.44k
            method_variant.emplace<PrimaryTypeHashTableContext<UInt8>>();
109
2.44k
            break;
110
1.38k
        case HashKeyType::int16_key:
111
1.38k
            method_variant.emplace<PrimaryTypeHashTableContext<UInt16>>();
112
1.38k
            break;
113
25.5k
        case HashKeyType::int32_key:
114
25.5k
            method_variant.emplace<PrimaryTypeHashTableContext<UInt32>>();
115
25.5k
            break;
116
43.3k
        case HashKeyType::int64_key:
117
43.3k
            method_variant.emplace<PrimaryTypeHashTableContext<UInt64>>();
118
43.3k
            break;
119
760
        case HashKeyType::int128_key:
120
760
            method_variant.emplace<PrimaryTypeHashTableContext<UInt128>>();
121
760
            break;
122
44
        case HashKeyType::int256_key:
123
44
            method_variant.emplace<PrimaryTypeHashTableContext<UInt256>>();
124
44
            break;
125
2.36k
        case HashKeyType::string_key:
126
2.36k
            method_variant.emplace<MethodOneString>();
127
2.36k
            break;
128
7.76k
        case HashKeyType::fixed64:
129
7.76k
            method_variant.emplace<FixedKeyHashTableContext<UInt64>>(get_key_sizes(data_types));
130
7.76k
            break;
131
3.28k
        case HashKeyType::fixed72:
132
3.28k
            method_variant.emplace<FixedKeyHashTableContext<UInt72>>(get_key_sizes(data_types));
133
3.28k
            break;
134
8.13k
        case HashKeyType::fixed96:
135
8.13k
            method_variant.emplace<FixedKeyHashTableContext<UInt96>>(get_key_sizes(data_types));
136
8.13k
            break;
137
67
        case HashKeyType::fixed104:
138
67
            method_variant.emplace<FixedKeyHashTableContext<UInt104>>(get_key_sizes(data_types));
139
67
            break;
140
8.20k
        case HashKeyType::fixed128:
141
8.20k
            method_variant.emplace<FixedKeyHashTableContext<UInt128>>(get_key_sizes(data_types));
142
8.20k
            break;
143
960
        case HashKeyType::fixed136:
144
960
            method_variant.emplace<FixedKeyHashTableContext<UInt136>>(get_key_sizes(data_types));
145
960
            break;
146
7.96k
        case HashKeyType::fixed256:
147
7.96k
            method_variant.emplace<FixedKeyHashTableContext<UInt256>>(get_key_sizes(data_types));
148
7.96k
            break;
149
0
        default:
150
0
            throw Exception(ErrorCode::INTERNAL_ERROR,
151
0
                            "JoinDataVariants meet invalid key type, type={}", type);
152
127k
        }
153
127k
    }
154
};
155
156
template <typename Method>
157
void primary_to_direct_mapping(Method* context, const ColumnRawPtrs& key_columns,
158
60.7k
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
159
60.7k
    using FieldType = typename Method::Base::Key;
160
60.7k
    FieldType max_key = std::numeric_limits<FieldType>::min();
161
60.7k
    FieldType min_key = std::numeric_limits<FieldType>::max();
162
163
60.7k
    size_t num_rows = key_columns[0]->size();
164
60.7k
    if (key_columns[0]->is_nullable()) {
165
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
166
0
                                              ->get_nested_column_ptr()
167
0
                                              ->get_raw_data()
168
0
                                              .data;
169
0
        const NullMap& null_map =
170
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
171
        // skip first mocked row
172
0
        for (size_t i = 1; i < num_rows; i++) {
173
0
            if (null_map[i]) {
174
0
                continue;
175
0
            }
176
0
            max_key = std::max(max_key, input_keys[i]);
177
0
            min_key = std::min(min_key, input_keys[i]);
178
0
        }
179
60.7k
    } else {
180
60.7k
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
181
        // skip first mocked row
182
27.3M
        for (size_t i = 1; i < num_rows; i++) {
183
27.2M
            max_key = std::max(max_key, input_keys[i]);
184
27.2M
            min_key = std::min(min_key, input_keys[i]);
185
27.2M
        }
186
60.7k
    }
187
188
60.7k
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
189
60.7k
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
190
60.7k
    if (allow_direct_mapping) {
191
32.1k
        for (const auto& variant_ptr : variant_ptrs) {
192
32.1k
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
193
32.1k
                    max_key, min_key);
194
32.1k
        }
195
20.5k
    }
196
60.7k
}
_ZN5doris25primary_to_direct_mappingINS_15MethodOneNumberIhNS_13JoinHashTableIh9HashCRC32IhELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Line
Count
Source
158
1.62k
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
159
1.62k
    using FieldType = typename Method::Base::Key;
160
1.62k
    FieldType max_key = std::numeric_limits<FieldType>::min();
161
1.62k
    FieldType min_key = std::numeric_limits<FieldType>::max();
162
163
1.62k
    size_t num_rows = key_columns[0]->size();
164
1.62k
    if (key_columns[0]->is_nullable()) {
165
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
166
0
                                              ->get_nested_column_ptr()
167
0
                                              ->get_raw_data()
168
0
                                              .data;
169
0
        const NullMap& null_map =
170
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
171
        // skip first mocked row
172
0
        for (size_t i = 1; i < num_rows; i++) {
173
0
            if (null_map[i]) {
174
0
                continue;
175
0
            }
176
0
            max_key = std::max(max_key, input_keys[i]);
177
0
            min_key = std::min(min_key, input_keys[i]);
178
0
        }
179
1.62k
    } else {
180
1.62k
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
181
        // skip first mocked row
182
3.62k
        for (size_t i = 1; i < num_rows; i++) {
183
2.00k
            max_key = std::max(max_key, input_keys[i]);
184
2.00k
            min_key = std::min(min_key, input_keys[i]);
185
2.00k
        }
186
1.62k
    }
187
188
1.62k
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
189
1.62k
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
190
1.62k
    if (allow_direct_mapping) {
191
1.64k
        for (const auto& variant_ptr : variant_ptrs) {
192
1.64k
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
193
1.64k
                    max_key, min_key);
194
1.64k
        }
195
868
    }
196
1.62k
}
_ZN5doris25primary_to_direct_mappingINS_15MethodOneNumberItNS_13JoinHashTableIt9HashCRC32ItELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Line
Count
Source
158
728
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
159
728
    using FieldType = typename Method::Base::Key;
160
728
    FieldType max_key = std::numeric_limits<FieldType>::min();
161
728
    FieldType min_key = std::numeric_limits<FieldType>::max();
162
163
728
    size_t num_rows = key_columns[0]->size();
164
728
    if (key_columns[0]->is_nullable()) {
165
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
166
0
                                              ->get_nested_column_ptr()
167
0
                                              ->get_raw_data()
168
0
                                              .data;
169
0
        const NullMap& null_map =
170
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
171
        // skip first mocked row
172
0
        for (size_t i = 1; i < num_rows; i++) {
173
0
            if (null_map[i]) {
174
0
                continue;
175
0
            }
176
0
            max_key = std::max(max_key, input_keys[i]);
177
0
            min_key = std::min(min_key, input_keys[i]);
178
0
        }
179
728
    } else {
180
728
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
181
        // skip first mocked row
182
3.55k
        for (size_t i = 1; i < num_rows; i++) {
183
2.82k
            max_key = std::max(max_key, input_keys[i]);
184
2.82k
            min_key = std::min(min_key, input_keys[i]);
185
2.82k
        }
186
728
    }
187
188
728
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
189
728
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
190
728
    if (allow_direct_mapping) {
191
1.14k
        for (const auto& variant_ptr : variant_ptrs) {
192
1.14k
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
193
1.14k
                    max_key, min_key);
194
1.14k
        }
195
493
    }
196
728
}
_ZN5doris25primary_to_direct_mappingINS_15MethodOneNumberIjNS_13JoinHashTableIj9HashCRC32IjELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Line
Count
Source
158
17.9k
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
159
17.9k
    using FieldType = typename Method::Base::Key;
160
17.9k
    FieldType max_key = std::numeric_limits<FieldType>::min();
161
17.9k
    FieldType min_key = std::numeric_limits<FieldType>::max();
162
163
17.9k
    size_t num_rows = key_columns[0]->size();
164
17.9k
    if (key_columns[0]->is_nullable()) {
165
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
166
0
                                              ->get_nested_column_ptr()
167
0
                                              ->get_raw_data()
168
0
                                              .data;
169
0
        const NullMap& null_map =
170
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
171
        // skip first mocked row
172
0
        for (size_t i = 1; i < num_rows; i++) {
173
0
            if (null_map[i]) {
174
0
                continue;
175
0
            }
176
0
            max_key = std::max(max_key, input_keys[i]);
177
0
            min_key = std::min(min_key, input_keys[i]);
178
0
        }
179
17.9k
    } else {
180
17.9k
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
181
        // skip first mocked row
182
26.9M
        for (size_t i = 1; i < num_rows; i++) {
183
26.9M
            max_key = std::max(max_key, input_keys[i]);
184
26.9M
            min_key = std::min(min_key, input_keys[i]);
185
26.9M
        }
186
17.9k
    }
187
188
17.9k
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
189
17.9k
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
190
17.9k
    if (allow_direct_mapping) {
191
20.4k
        for (const auto& variant_ptr : variant_ptrs) {
192
20.4k
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
193
20.4k
                    max_key, min_key);
194
20.4k
        }
195
13.1k
    }
196
17.9k
}
_ZN5doris25primary_to_direct_mappingINS_15MethodOneNumberImNS_13JoinHashTableIm9HashCRC32ImELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Line
Count
Source
158
39.9k
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
159
39.9k
    using FieldType = typename Method::Base::Key;
160
39.9k
    FieldType max_key = std::numeric_limits<FieldType>::min();
161
39.9k
    FieldType min_key = std::numeric_limits<FieldType>::max();
162
163
39.9k
    size_t num_rows = key_columns[0]->size();
164
39.9k
    if (key_columns[0]->is_nullable()) {
165
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
166
0
                                              ->get_nested_column_ptr()
167
0
                                              ->get_raw_data()
168
0
                                              .data;
169
0
        const NullMap& null_map =
170
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
171
        // skip first mocked row
172
0
        for (size_t i = 1; i < num_rows; i++) {
173
0
            if (null_map[i]) {
174
0
                continue;
175
0
            }
176
0
            max_key = std::max(max_key, input_keys[i]);
177
0
            min_key = std::min(min_key, input_keys[i]);
178
0
        }
179
39.9k
    } else {
180
39.9k
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
181
        // skip first mocked row
182
303k
        for (size_t i = 1; i < num_rows; i++) {
183
263k
            max_key = std::max(max_key, input_keys[i]);
184
263k
            min_key = std::min(min_key, input_keys[i]);
185
263k
        }
186
39.9k
    }
187
188
39.9k
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
189
39.9k
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
190
39.9k
    if (allow_direct_mapping) {
191
8.40k
        for (const auto& variant_ptr : variant_ptrs) {
192
8.40k
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
193
8.40k
                    max_key, min_key);
194
8.40k
        }
195
5.69k
    }
196
39.9k
}
_ZN5doris25primary_to_direct_mappingINS_15MethodOneNumberIN4wide7integerILm128EjEENS_13JoinHashTableIS4_9HashCRC32IS4_ELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISF_EERKSC_ISt10shared_ptrINS_16JoinDataVariantsEESaISM_EE
Line
Count
Source
158
554
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
159
554
    using FieldType = typename Method::Base::Key;
160
554
    FieldType max_key = std::numeric_limits<FieldType>::min();
161
554
    FieldType min_key = std::numeric_limits<FieldType>::max();
162
163
554
    size_t num_rows = key_columns[0]->size();
164
554
    if (key_columns[0]->is_nullable()) {
165
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
166
0
                                              ->get_nested_column_ptr()
167
0
                                              ->get_raw_data()
168
0
                                              .data;
169
0
        const NullMap& null_map =
170
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
171
        // skip first mocked row
172
0
        for (size_t i = 1; i < num_rows; i++) {
173
0
            if (null_map[i]) {
174
0
                continue;
175
0
            }
176
0
            max_key = std::max(max_key, input_keys[i]);
177
0
            min_key = std::min(min_key, input_keys[i]);
178
0
        }
179
554
    } else {
180
554
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
181
        // skip first mocked row
182
1.64k
        for (size_t i = 1; i < num_rows; i++) {
183
1.09k
            max_key = std::max(max_key, input_keys[i]);
184
1.09k
            min_key = std::min(min_key, input_keys[i]);
185
1.09k
        }
186
554
    }
187
188
554
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
189
554
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
190
554
    if (allow_direct_mapping) {
191
598
        for (const auto& variant_ptr : variant_ptrs) {
192
598
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
193
598
                    max_key, min_key);
194
598
        }
195
419
    }
196
554
}
197
198
template <typename Method>
199
void try_convert_to_direct_mapping(
200
        Method* method, const ColumnRawPtrs& key_columns,
201
50.8k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingISt9monostateEEvPT_RKSt6vectorIPKNS_7IColumnESaIS7_EERKS4_ISt10shared_ptrINS_16JoinDataVariantsEESaISE_EE
_ZN5doris29try_convert_to_direct_mappingINS_16MethodSerializedINS_13JoinHashTableINS_9StringRefE11DefaultHashIS3_vELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
201
14.5k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodOneNumberIN4wide7integerILm256EjEENS_13JoinHashTableIS4_9HashCRC32IS4_ELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISF_EERKSC_ISt10shared_ptrINS_16JoinDataVariantsEESaISM_EE
Line
Count
Source
201
44
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_21MethodOneNumberDirectIhNS_13JoinHashTableIh9HashCRC32IhELb1EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_21MethodOneNumberDirectItNS_13JoinHashTableIt9HashCRC32ItELb1EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_21MethodOneNumberDirectIjNS_13JoinHashTableIj9HashCRC32IjELb1EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_21MethodOneNumberDirectImNS_13JoinHashTableIm9HashCRC32ImELb1EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_21MethodOneNumberDirectIN4wide7integerILm128EjEENS_13JoinHashTableIS4_9HashCRC32IS4_ELb1EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISF_EERKSC_ISt10shared_ptrINS_16JoinDataVariantsEESaISM_EE
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableIm9HashCRC32ImELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Line
Count
Source
201
6.75k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableINS_6UInt72E9HashCRC32IS3_ELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
201
3.26k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableINS_6UInt96E9HashCRC32IS3_ELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
201
8.05k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableINS_7UInt104E9HashCRC32IS3_ELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
201
36
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableIN4wide7integerILm128EjEE9HashCRC32IS5_ELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISF_EERKSC_ISt10shared_ptrINS_16JoinDataVariantsEESaISM_EE
Line
Count
Source
201
8.08k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableINS_7UInt136E9HashCRC32IS3_ELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
201
960
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableIN4wide7integerILm256EjEE9HashCRC32IS5_ELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISF_EERKSC_ISt10shared_ptrINS_16JoinDataVariantsEESaISM_EE
Line
Count
Source
201
7.92k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_19MethodStringNoCacheINS_13JoinHashTableINS_9StringRefE11DefaultHashIS3_vELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
201
1.13k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
202
203
inline void try_convert_to_direct_mapping(
204
        PrimaryTypeHashTableContext<UInt8>* context, const ColumnRawPtrs& key_columns,
205
1.62k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
206
1.62k
    primary_to_direct_mapping(context, key_columns, variant_ptrs);
207
1.62k
}
208
209
inline void try_convert_to_direct_mapping(
210
        PrimaryTypeHashTableContext<UInt16>* context, const ColumnRawPtrs& key_columns,
211
728
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
212
728
    primary_to_direct_mapping(context, key_columns, variant_ptrs);
213
728
}
214
215
inline void try_convert_to_direct_mapping(
216
        PrimaryTypeHashTableContext<UInt32>* context, const ColumnRawPtrs& key_columns,
217
17.9k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
218
17.9k
    primary_to_direct_mapping(context, key_columns, variant_ptrs);
219
17.9k
}
220
221
inline void try_convert_to_direct_mapping(
222
        PrimaryTypeHashTableContext<UInt64>* context, const ColumnRawPtrs& key_columns,
223
39.9k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
224
39.9k
    primary_to_direct_mapping(context, key_columns, variant_ptrs);
225
39.9k
}
226
227
inline void try_convert_to_direct_mapping(
228
        PrimaryTypeHashTableContext<UInt128>* context, const ColumnRawPtrs& key_columns,
229
554
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
230
554
    primary_to_direct_mapping(context, key_columns, variant_ptrs);
231
554
}
232
233
// ASOF JOIN index with inline values for cache-friendly branchless binary search.
234
// IntType is the integer representation of the ASOF column value:
235
//   uint32_t for DateV2, uint64_t for DateTimeV2 and TimestampTZ.
236
// Rows are sorted by asof_value during build, then materialized into SoA arrays
237
// so probe-side binary search only touches the ASOF values hot path.
238
template <typename IntType>
239
struct AsofIndexGroup {
240
    using int_type = IntType;
241
242
    struct Entry {
243
        IntType asof_value;
244
        uint32_t row_index; // 1-based, 0 = invalid/padding
245
    };
246
247
    std::vector<Entry> entries;
248
    std::vector<IntType> asof_values;
249
    std::vector<uint32_t> row_indexes;
250
251
2.53k
    void add_row(IntType value, uint32_t row_idx) { entries.push_back({value, row_idx}); }
_ZN5doris14AsofIndexGroupIjE7add_rowEjj
Line
Count
Source
251
1.05k
    void add_row(IntType value, uint32_t row_idx) { entries.push_back({value, row_idx}); }
_ZN5doris14AsofIndexGroupImE7add_rowEmj
Line
Count
Source
251
1.47k
    void add_row(IntType value, uint32_t row_idx) { entries.push_back({value, row_idx}); }
252
253
300
    void sort_and_finalize() {
254
300
        if (entries.empty()) {
255
4
            return;
256
4
        }
257
296
        if (entries.size() > 1) {
258
254
            pdqsort(entries.begin(), entries.end(),
259
7.25k
                    [](const Entry& a, const Entry& b) { return a.asof_value < b.asof_value; });
_ZZN5doris14AsofIndexGroupIjE17sort_and_finalizeEvENKUlRKNS1_5EntryES4_E_clES4_S4_
Line
Count
Source
259
2.05k
                    [](const Entry& a, const Entry& b) { return a.asof_value < b.asof_value; });
_ZZN5doris14AsofIndexGroupImE17sort_and_finalizeEvENKUlRKNS1_5EntryES4_E_clES4_S4_
Line
Count
Source
259
5.19k
                    [](const Entry& a, const Entry& b) { return a.asof_value < b.asof_value; });
260
254
        }
261
262
296
        asof_values.resize(entries.size());
263
296
        row_indexes.resize(entries.size());
264
2.82k
        for (size_t i = 0; i < entries.size(); ++i) {
265
2.53k
            asof_values[i] = entries[i].asof_value;
266
2.53k
            row_indexes[i] = entries[i].row_index;
267
2.53k
        }
268
269
296
        std::vector<Entry>().swap(entries);
270
296
    }
_ZN5doris14AsofIndexGroupIjE17sort_and_finalizeEv
Line
Count
Source
253
21
    void sort_and_finalize() {
254
21
        if (entries.empty()) {
255
4
            return;
256
4
        }
257
17
        if (entries.size() > 1) {
258
13
            pdqsort(entries.begin(), entries.end(),
259
13
                    [](const Entry& a, const Entry& b) { return a.asof_value < b.asof_value; });
260
13
        }
261
262
17
        asof_values.resize(entries.size());
263
17
        row_indexes.resize(entries.size());
264
1.07k
        for (size_t i = 0; i < entries.size(); ++i) {
265
1.05k
            asof_values[i] = entries[i].asof_value;
266
1.05k
            row_indexes[i] = entries[i].row_index;
267
1.05k
        }
268
269
17
        std::vector<Entry>().swap(entries);
270
17
    }
_ZN5doris14AsofIndexGroupImE17sort_and_finalizeEv
Line
Count
Source
253
279
    void sort_and_finalize() {
254
279
        if (entries.empty()) {
255
0
            return;
256
0
        }
257
279
        if (entries.size() > 1) {
258
241
            pdqsort(entries.begin(), entries.end(),
259
241
                    [](const Entry& a, const Entry& b) { return a.asof_value < b.asof_value; });
260
241
        }
261
262
279
        asof_values.resize(entries.size());
263
279
        row_indexes.resize(entries.size());
264
1.75k
        for (size_t i = 0; i < entries.size(); ++i) {
265
1.47k
            asof_values[i] = entries[i].asof_value;
266
1.47k
            row_indexes[i] = entries[i].row_index;
267
1.47k
        }
268
269
279
        std::vector<Entry>().swap(entries);
270
279
    }
271
272
817
    const IntType* values_data() const { return asof_values.data(); }
_ZNK5doris14AsofIndexGroupIjE11values_dataEv
Line
Count
Source
272
1
    const IntType* values_data() const { return asof_values.data(); }
_ZNK5doris14AsofIndexGroupImE11values_dataEv
Line
Count
Source
272
816
    const IntType* values_data() const { return asof_values.data(); }
273
274
    // Branchless lower_bound: first i where asof_values[i] >= target
275
454
    ALWAYS_INLINE size_t lower_bound(IntType target) const {
276
454
        size_t lo = 0, n = asof_values.size();
277
2.30k
        while (n > 1) {
278
1.85k
            size_t half = n / 2;
279
1.85k
            lo += half * (asof_values[lo + half] < target);
280
1.85k
            n -= half;
281
1.85k
        }
282
454
        if (lo < asof_values.size()) {
283
453
            lo += (asof_values[lo] < target);
284
453
        }
285
454
        return lo;
286
454
    }
_ZNK5doris14AsofIndexGroupIjE11lower_boundEj
Line
Count
Source
275
33
    ALWAYS_INLINE size_t lower_bound(IntType target) const {
276
33
        size_t lo = 0, n = asof_values.size();
277
163
        while (n > 1) {
278
130
            size_t half = n / 2;
279
130
            lo += half * (asof_values[lo + half] < target);
280
130
            n -= half;
281
130
        }
282
33
        if (lo < asof_values.size()) {
283
32
            lo += (asof_values[lo] < target);
284
32
        }
285
33
        return lo;
286
33
    }
_ZNK5doris14AsofIndexGroupImE11lower_boundEm
Line
Count
Source
275
421
    ALWAYS_INLINE size_t lower_bound(IntType target) const {
276
421
        size_t lo = 0, n = asof_values.size();
277
2.14k
        while (n > 1) {
278
1.72k
            size_t half = n / 2;
279
1.72k
            lo += half * (asof_values[lo + half] < target);
280
1.72k
            n -= half;
281
1.72k
        }
282
421
        if (lo < asof_values.size()) {
283
421
            lo += (asof_values[lo] < target);
284
421
        }
285
421
        return lo;
286
421
    }
287
288
    // Branchless upper_bound: first i where asof_values[i] > target
289
946
    ALWAYS_INLINE size_t upper_bound(IntType target) const {
290
946
        size_t lo = 0, n = asof_values.size();
291
4.06k
        while (n > 1) {
292
3.12k
            size_t half = n / 2;
293
3.12k
            lo += half * (asof_values[lo + half] <= target);
294
3.12k
            n -= half;
295
3.12k
        }
296
946
        if (lo < asof_values.size()) {
297
945
            lo += (asof_values[lo] <= target);
298
945
        }
299
946
        return lo;
300
946
    }
_ZNK5doris14AsofIndexGroupIjE11upper_boundEj
Line
Count
Source
289
41
    ALWAYS_INLINE size_t upper_bound(IntType target) const {
290
41
        size_t lo = 0, n = asof_values.size();
291
215
        while (n > 1) {
292
174
            size_t half = n / 2;
293
174
            lo += half * (asof_values[lo + half] <= target);
294
174
            n -= half;
295
174
        }
296
41
        if (lo < asof_values.size()) {
297
40
            lo += (asof_values[lo] <= target);
298
40
        }
299
41
        return lo;
300
41
    }
_ZNK5doris14AsofIndexGroupImE11upper_boundEm
Line
Count
Source
289
905
    ALWAYS_INLINE size_t upper_bound(IntType target) const {
290
905
        size_t lo = 0, n = asof_values.size();
291
3.85k
        while (n > 1) {
292
2.94k
            size_t half = n / 2;
293
2.94k
            lo += half * (asof_values[lo + half] <= target);
294
2.94k
            n -= half;
295
2.94k
        }
296
905
        if (lo < asof_values.size()) {
297
905
            lo += (asof_values[lo] <= target);
298
905
        }
299
905
        return lo;
300
905
    }
301
302
    // Semantics by (is_greater, is_strict):
303
    //   (true,  false): probe >= build  ->  find largest  build value <= probe
304
    //   (true,  true):  probe >  build  ->  find largest  build value <  probe
305
    //   (false, false): probe <= build  ->  find smallest build value >= probe
306
    //   (false, true):  probe <  build  ->  find smallest build value >  probe
307
    // Returns the build row index of the best match, or 0 if no match.
308
    template <bool IsGreater, bool IsStrict>
309
1.38k
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
310
1.38k
        if (asof_values.empty()) {
311
4
            return 0;
312
4
        }
313
1.38k
        if constexpr (IsGreater) {
314
943
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
315
943
            return pos > 0 ? row_indexes[pos - 1] : 0;
316
943
        } else {
317
439
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
318
439
            return pos < asof_values.size() ? row_indexes[pos] : 0;
319
439
        }
320
1.38k
    }
_ZNK5doris14AsofIndexGroupIjE15find_best_matchILb1ELb1EEEjj
Line
Count
Source
309
15
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
310
15
        if (asof_values.empty()) {
311
1
            return 0;
312
1
        }
313
14
        if constexpr (IsGreater) {
314
14
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
315
14
            return pos > 0 ? row_indexes[pos - 1] : 0;
316
        } else {
317
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
318
            return pos < asof_values.size() ? row_indexes[pos] : 0;
319
        }
320
14
    }
_ZNK5doris14AsofIndexGroupIjE15find_best_matchILb1ELb0EEEjj
Line
Count
Source
309
22
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
310
22
        if (asof_values.empty()) {
311
1
            return 0;
312
1
        }
313
21
        if constexpr (IsGreater) {
314
21
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
315
21
            return pos > 0 ? row_indexes[pos - 1] : 0;
316
        } else {
317
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
318
            return pos < asof_values.size() ? row_indexes[pos] : 0;
319
        }
320
21
    }
_ZNK5doris14AsofIndexGroupIjE15find_best_matchILb0ELb1EEEjj
Line
Count
Source
309
16
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
310
16
        if (asof_values.empty()) {
311
1
            return 0;
312
1
        }
313
        if constexpr (IsGreater) {
314
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
315
            return pos > 0 ? row_indexes[pos - 1] : 0;
316
15
        } else {
317
15
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
318
15
            return pos < asof_values.size() ? row_indexes[pos] : 0;
319
15
        }
320
15
    }
_ZNK5doris14AsofIndexGroupIjE15find_best_matchILb0ELb0EEEjj
Line
Count
Source
309
15
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
310
15
        if (asof_values.empty()) {
311
1
            return 0;
312
1
        }
313
        if constexpr (IsGreater) {
314
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
315
            return pos > 0 ? row_indexes[pos - 1] : 0;
316
14
        } else {
317
14
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
318
14
            return pos < asof_values.size() ? row_indexes[pos] : 0;
319
14
        }
320
14
    }
_ZNK5doris14AsofIndexGroupImE15find_best_matchILb1ELb1EEEjm
Line
Count
Source
309
205
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
310
205
        if (asof_values.empty()) {
311
0
            return 0;
312
0
        }
313
205
        if constexpr (IsGreater) {
314
205
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
315
205
            return pos > 0 ? row_indexes[pos - 1] : 0;
316
        } else {
317
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
318
            return pos < asof_values.size() ? row_indexes[pos] : 0;
319
        }
320
205
    }
_ZNK5doris14AsofIndexGroupImE15find_best_matchILb1ELb0EEEjm
Line
Count
Source
309
703
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
310
703
        if (asof_values.empty()) {
311
0
            return 0;
312
0
        }
313
703
        if constexpr (IsGreater) {
314
703
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
315
703
            return pos > 0 ? row_indexes[pos - 1] : 0;
316
        } else {
317
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
318
            return pos < asof_values.size() ? row_indexes[pos] : 0;
319
        }
320
703
    }
_ZNK5doris14AsofIndexGroupImE15find_best_matchILb0ELb1EEEjm
Line
Count
Source
309
198
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
310
198
        if (asof_values.empty()) {
311
0
            return 0;
312
0
        }
313
        if constexpr (IsGreater) {
314
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
315
            return pos > 0 ? row_indexes[pos - 1] : 0;
316
198
        } else {
317
198
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
318
198
            return pos < asof_values.size() ? row_indexes[pos] : 0;
319
198
        }
320
198
    }
_ZNK5doris14AsofIndexGroupImE15find_best_matchILb0ELb0EEEjm
Line
Count
Source
309
212
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
310
212
        if (asof_values.empty()) {
311
0
            return 0;
312
0
        }
313
        if constexpr (IsGreater) {
314
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
315
            return pos > 0 ? row_indexes[pos - 1] : 0;
316
212
        } else {
317
212
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
318
212
            return pos < asof_values.size() ? row_indexes[pos] : 0;
319
212
        }
320
212
    }
321
};
322
323
// Type-erased container for all ASOF index groups.
324
// DateV2 -> uint32_t, DateTimeV2/TimestampTZ -> uint64_t.
325
using AsofIndexVariant = std::variant<std::monostate, std::vector<AsofIndexGroup<uint32_t>>,
326
                                      std::vector<AsofIndexGroup<uint64_t>>>;
327
328
} // namespace doris