Coverage Report

Created: 2026-07-25 08:59

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_crc32_return32.h"
24
#include "exec/common/hash_table/hash_key_type.h"
25
#include "exec/common/hash_table/hash_map_context.h"
26
#include "exec/common/hash_table/join_hash_table.h"
27
28
namespace doris {
29
30
// Devirtualize compare_at for ASOF JOIN supported column types.
31
// ASOF JOIN only supports DateV2, DateTimeV2, and TimestampTZ.
32
// Dispatches to the concrete ColumnVector<T> once so that all compare_at
33
// calls inside `func` are direct (non-virtual) calls.
34
// `func` receives a single argument: a const pointer to the concrete column
35
// (or const IColumn* as fallback for unexpected types).
36
template <typename Func>
37
257
decltype(auto) asof_column_dispatch(const IColumn* col, Func&& func) {
38
257
    if (const auto* c_dv2 = check_and_get_column<ColumnDateV2>(col)) {
39
1
        return std::forward<Func>(func)(c_dv2);
40
256
    } else if (const auto* c_dtv2 = check_and_get_column<ColumnDateTimeV2>(col)) {
41
254
        return std::forward<Func>(func)(c_dtv2);
42
254
    } else if (const auto* c_tstz = check_and_get_column<ColumnTimeStampTz>(col)) {
43
2
        return std::forward<Func>(func)(c_tstz);
44
2
    } else {
45
0
        return std::forward<Func>(func)(col);
46
0
    }
47
257
}
48
using JoinOpVariants =
49
        std::variant<std::integral_constant<TJoinOp::type, TJoinOp::INNER_JOIN>,
50
                     std::integral_constant<TJoinOp::type, TJoinOp::LEFT_SEMI_JOIN>,
51
                     std::integral_constant<TJoinOp::type, TJoinOp::LEFT_ANTI_JOIN>,
52
                     std::integral_constant<TJoinOp::type, TJoinOp::LEFT_OUTER_JOIN>,
53
                     std::integral_constant<TJoinOp::type, TJoinOp::FULL_OUTER_JOIN>,
54
                     std::integral_constant<TJoinOp::type, TJoinOp::RIGHT_OUTER_JOIN>,
55
                     std::integral_constant<TJoinOp::type, TJoinOp::CROSS_JOIN>,
56
                     std::integral_constant<TJoinOp::type, TJoinOp::RIGHT_SEMI_JOIN>,
57
                     std::integral_constant<TJoinOp::type, TJoinOp::RIGHT_ANTI_JOIN>,
58
                     std::integral_constant<TJoinOp::type, TJoinOp::NULL_AWARE_LEFT_ANTI_JOIN>,
59
                     std::integral_constant<TJoinOp::type, TJoinOp::NULL_AWARE_LEFT_SEMI_JOIN>,
60
                     std::integral_constant<TJoinOp::type, TJoinOp::ASOF_LEFT_INNER_JOIN>,
61
                     std::integral_constant<TJoinOp::type, TJoinOp::ASOF_LEFT_OUTER_JOIN>>;
62
63
840k
inline bool is_asof_join(TJoinOp::type join_op) {
64
840k
    return join_op == TJoinOp::ASOF_LEFT_INNER_JOIN || join_op == TJoinOp::ASOF_LEFT_OUTER_JOIN;
65
840k
}
66
67
template <int JoinOpType>
68
inline constexpr bool is_asof_join_op_v =
69
        JoinOpType == TJoinOp::ASOF_LEFT_INNER_JOIN || JoinOpType == TJoinOp::ASOF_LEFT_OUTER_JOIN;
70
71
template <int JoinOpType>
72
inline constexpr bool is_asof_outer_join_op_v = JoinOpType == TJoinOp::ASOF_LEFT_OUTER_JOIN;
73
74
template <class T>
75
using PrimaryTypeHashTableContext = MethodOneNumber<T, JoinHashMap<T, HashCRC32Return32<T>, false>>;
76
77
template <class T>
78
using DirectPrimaryTypeHashTableContext =
79
        MethodOneNumberDirect<T, JoinHashMap<T, HashCRC32Return32<T>, true>>;
80
81
template <class Key>
82
using FixedKeyHashTableContext = MethodKeysFixed<JoinHashMap<Key, HashCRC32Return32<Key>, false>>;
83
84
using SerializedHashTableContext =
85
        MethodSerialized<JoinHashMap<StringRef, HashCRC32Return32<StringRef>, false>>;
86
using MethodOneString =
87
        MethodStringNoCache<JoinHashMap<StringRef, HashCRC32Return32<StringRef>, false>>;
88
89
using HashTableVariants = std::variant<
90
        std::monostate, SerializedHashTableContext, PrimaryTypeHashTableContext<UInt8>,
91
        PrimaryTypeHashTableContext<UInt16>, PrimaryTypeHashTableContext<UInt32>,
92
        PrimaryTypeHashTableContext<UInt64>, PrimaryTypeHashTableContext<UInt128>,
93
        PrimaryTypeHashTableContext<UInt256>, DirectPrimaryTypeHashTableContext<UInt8>,
94
        DirectPrimaryTypeHashTableContext<UInt16>, DirectPrimaryTypeHashTableContext<UInt32>,
95
        DirectPrimaryTypeHashTableContext<UInt64>, DirectPrimaryTypeHashTableContext<UInt128>,
96
        FixedKeyHashTableContext<UInt64>, FixedKeyHashTableContext<UInt72>,
97
        FixedKeyHashTableContext<UInt96>, FixedKeyHashTableContext<UInt104>,
98
        FixedKeyHashTableContext<UInt128>, FixedKeyHashTableContext<UInt136>,
99
        FixedKeyHashTableContext<UInt256>, MethodOneString>;
100
101
struct JoinDataVariants {
102
    HashTableVariants method_variant;
103
104
142k
    void init(const std::vector<DataTypePtr>& data_types, HashKeyType type) {
105
142k
        switch (type) {
106
28.6k
        case HashKeyType::serialized:
107
28.6k
            method_variant.emplace<SerializedHashTableContext>();
108
28.6k
            break;
109
1.75k
        case HashKeyType::int8_key:
110
1.75k
            method_variant.emplace<PrimaryTypeHashTableContext<UInt8>>();
111
1.75k
            break;
112
1.19k
        case HashKeyType::int16_key:
113
1.19k
            method_variant.emplace<PrimaryTypeHashTableContext<UInt16>>();
114
1.19k
            break;
115
26.5k
        case HashKeyType::int32_key:
116
26.5k
            method_variant.emplace<PrimaryTypeHashTableContext<UInt32>>();
117
26.5k
            break;
118
12.6k
        case HashKeyType::int64_key:
119
12.6k
            method_variant.emplace<PrimaryTypeHashTableContext<UInt64>>();
120
12.6k
            break;
121
1.02k
        case HashKeyType::int128_key:
122
1.02k
            method_variant.emplace<PrimaryTypeHashTableContext<UInt128>>();
123
1.02k
            break;
124
82
        case HashKeyType::int256_key:
125
82
            method_variant.emplace<PrimaryTypeHashTableContext<UInt256>>();
126
82
            break;
127
2.34k
        case HashKeyType::string_key:
128
2.34k
            method_variant.emplace<MethodOneString>();
129
2.34k
            break;
130
11.8k
        case HashKeyType::fixed64:
131
11.8k
            method_variant.emplace<FixedKeyHashTableContext<UInt64>>(get_key_sizes(data_types));
132
11.8k
            break;
133
6.44k
        case HashKeyType::fixed72:
134
6.44k
            method_variant.emplace<FixedKeyHashTableContext<UInt72>>(get_key_sizes(data_types));
135
6.44k
            break;
136
16.0k
        case HashKeyType::fixed96:
137
16.0k
            method_variant.emplace<FixedKeyHashTableContext<UInt96>>(get_key_sizes(data_types));
138
16.0k
            break;
139
39
        case HashKeyType::fixed104:
140
39
            method_variant.emplace<FixedKeyHashTableContext<UInt104>>(get_key_sizes(data_types));
141
39
            break;
142
16.0k
        case HashKeyType::fixed128:
143
16.0k
            method_variant.emplace<FixedKeyHashTableContext<UInt128>>(get_key_sizes(data_types));
144
16.0k
            break;
145
1.92k
        case HashKeyType::fixed136:
146
1.92k
            method_variant.emplace<FixedKeyHashTableContext<UInt136>>(get_key_sizes(data_types));
147
1.92k
            break;
148
15.8k
        case HashKeyType::fixed256:
149
15.8k
            method_variant.emplace<FixedKeyHashTableContext<UInt256>>(get_key_sizes(data_types));
150
15.8k
            break;
151
0
        default:
152
0
            throw Exception(ErrorCode::INTERNAL_ERROR,
153
0
                            "JoinDataVariants meet invalid key type, type={}", type);
154
142k
        }
155
142k
    }
156
};
157
158
template <typename Method>
159
void primary_to_direct_mapping(Method* context, const ColumnRawPtrs& key_columns,
160
31.7k
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
161
31.7k
    using FieldType = typename Method::Base::Key;
162
31.7k
    FieldType max_key = std::numeric_limits<FieldType>::min();
163
31.7k
    FieldType min_key = std::numeric_limits<FieldType>::max();
164
165
31.7k
    size_t num_rows = key_columns[0]->size();
166
31.7k
    if (is_column_nullable(*key_columns[0])) {
167
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
168
0
                                              ->get_nested_column_ptr()
169
0
                                              ->get_raw_data()
170
0
                                              .data;
171
0
        const NullMap& null_map =
172
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
173
        // skip first mocked row
174
0
        for (size_t i = 1; i < num_rows; i++) {
175
0
            if (null_map[i]) {
176
0
                continue;
177
0
            }
178
0
            max_key = std::max(max_key, input_keys[i]);
179
0
            min_key = std::min(min_key, input_keys[i]);
180
0
        }
181
31.7k
    } else {
182
31.7k
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
183
        // skip first mocked row
184
27.6M
        for (size_t i = 1; i < num_rows; i++) {
185
27.5M
            max_key = std::max(max_key, input_keys[i]);
186
27.5M
            min_key = std::min(min_key, input_keys[i]);
187
27.5M
        }
188
31.7k
    }
189
190
31.7k
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
191
31.7k
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
192
31.7k
    if (allow_direct_mapping) {
193
34.5k
        for (const auto& variant_ptr : variant_ptrs) {
194
34.5k
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
195
34.5k
                    max_key, min_key);
196
34.5k
        }
197
24.3k
    }
198
31.7k
}
_ZN5doris25primary_to_direct_mappingINS_15MethodOneNumberIhNS_13JoinHashTableIhNS_17HashCRC32Return32IhEELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Line
Count
Source
160
1.50k
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
161
1.50k
    using FieldType = typename Method::Base::Key;
162
1.50k
    FieldType max_key = std::numeric_limits<FieldType>::min();
163
1.50k
    FieldType min_key = std::numeric_limits<FieldType>::max();
164
165
1.50k
    size_t num_rows = key_columns[0]->size();
166
1.50k
    if (is_column_nullable(*key_columns[0])) {
167
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
168
0
                                              ->get_nested_column_ptr()
169
0
                                              ->get_raw_data()
170
0
                                              .data;
171
0
        const NullMap& null_map =
172
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
173
        // skip first mocked row
174
0
        for (size_t i = 1; i < num_rows; i++) {
175
0
            if (null_map[i]) {
176
0
                continue;
177
0
            }
178
0
            max_key = std::max(max_key, input_keys[i]);
179
0
            min_key = std::min(min_key, input_keys[i]);
180
0
        }
181
1.50k
    } else {
182
1.50k
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
183
        // skip first mocked row
184
4.79k
        for (size_t i = 1; i < num_rows; i++) {
185
3.29k
            max_key = std::max(max_key, input_keys[i]);
186
3.29k
            min_key = std::min(min_key, input_keys[i]);
187
3.29k
        }
188
1.50k
    }
189
190
1.50k
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
191
1.50k
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
192
1.50k
    if (allow_direct_mapping) {
193
1.47k
        for (const auto& variant_ptr : variant_ptrs) {
194
1.47k
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
195
1.47k
                    max_key, min_key);
196
1.47k
        }
197
1.23k
    }
198
1.50k
}
_ZN5doris25primary_to_direct_mappingINS_15MethodOneNumberItNS_13JoinHashTableItNS_17HashCRC32Return32ItEELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Line
Count
Source
160
1.16k
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
161
1.16k
    using FieldType = typename Method::Base::Key;
162
1.16k
    FieldType max_key = std::numeric_limits<FieldType>::min();
163
1.16k
    FieldType min_key = std::numeric_limits<FieldType>::max();
164
165
1.16k
    size_t num_rows = key_columns[0]->size();
166
1.16k
    if (is_column_nullable(*key_columns[0])) {
167
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
168
0
                                              ->get_nested_column_ptr()
169
0
                                              ->get_raw_data()
170
0
                                              .data;
171
0
        const NullMap& null_map =
172
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
173
        // skip first mocked row
174
0
        for (size_t i = 1; i < num_rows; i++) {
175
0
            if (null_map[i]) {
176
0
                continue;
177
0
            }
178
0
            max_key = std::max(max_key, input_keys[i]);
179
0
            min_key = std::min(min_key, input_keys[i]);
180
0
        }
181
1.16k
    } else {
182
1.16k
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
183
        // skip first mocked row
184
9.20k
        for (size_t i = 1; i < num_rows; i++) {
185
8.04k
            max_key = std::max(max_key, input_keys[i]);
186
8.04k
            min_key = std::min(min_key, input_keys[i]);
187
8.04k
        }
188
1.16k
    }
189
190
1.16k
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
191
1.16k
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
192
1.16k
    if (allow_direct_mapping) {
193
1.09k
        for (const auto& variant_ptr : variant_ptrs) {
194
1.09k
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
195
1.09k
                    max_key, min_key);
196
1.09k
        }
197
1.05k
    }
198
1.16k
}
_ZN5doris25primary_to_direct_mappingINS_15MethodOneNumberIjNS_13JoinHashTableIjNS_17HashCRC32Return32IjEELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Line
Count
Source
160
18.4k
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
161
18.4k
    using FieldType = typename Method::Base::Key;
162
18.4k
    FieldType max_key = std::numeric_limits<FieldType>::min();
163
18.4k
    FieldType min_key = std::numeric_limits<FieldType>::max();
164
165
18.4k
    size_t num_rows = key_columns[0]->size();
166
18.4k
    if (is_column_nullable(*key_columns[0])) {
167
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
168
0
                                              ->get_nested_column_ptr()
169
0
                                              ->get_raw_data()
170
0
                                              .data;
171
0
        const NullMap& null_map =
172
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
173
        // skip first mocked row
174
0
        for (size_t i = 1; i < num_rows; i++) {
175
0
            if (null_map[i]) {
176
0
                continue;
177
0
            }
178
0
            max_key = std::max(max_key, input_keys[i]);
179
0
            min_key = std::min(min_key, input_keys[i]);
180
0
        }
181
18.4k
    } else {
182
18.4k
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
183
        // skip first mocked row
184
27.3M
        for (size_t i = 1; i < num_rows; i++) {
185
27.2M
            max_key = std::max(max_key, input_keys[i]);
186
27.2M
            min_key = std::min(min_key, input_keys[i]);
187
27.2M
        }
188
18.4k
    }
189
190
18.4k
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
191
18.4k
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
192
18.4k
    if (allow_direct_mapping) {
193
23.2k
        for (const auto& variant_ptr : variant_ptrs) {
194
23.2k
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
195
23.2k
                    max_key, min_key);
196
23.2k
        }
197
15.5k
    }
198
18.4k
}
_ZN5doris25primary_to_direct_mappingINS_15MethodOneNumberImNS_13JoinHashTableImNS_17HashCRC32Return32ImEELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Line
Count
Source
160
9.77k
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
161
9.77k
    using FieldType = typename Method::Base::Key;
162
9.77k
    FieldType max_key = std::numeric_limits<FieldType>::min();
163
9.77k
    FieldType min_key = std::numeric_limits<FieldType>::max();
164
165
9.77k
    size_t num_rows = key_columns[0]->size();
166
9.77k
    if (is_column_nullable(*key_columns[0])) {
167
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
168
0
                                              ->get_nested_column_ptr()
169
0
                                              ->get_raw_data()
170
0
                                              .data;
171
0
        const NullMap& null_map =
172
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
173
        // skip first mocked row
174
0
        for (size_t i = 1; i < num_rows; i++) {
175
0
            if (null_map[i]) {
176
0
                continue;
177
0
            }
178
0
            max_key = std::max(max_key, input_keys[i]);
179
0
            min_key = std::min(min_key, input_keys[i]);
180
0
        }
181
9.77k
    } else {
182
9.77k
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
183
        // skip first mocked row
184
284k
        for (size_t i = 1; i < num_rows; i++) {
185
274k
            max_key = std::max(max_key, input_keys[i]);
186
274k
            min_key = std::min(min_key, input_keys[i]);
187
274k
        }
188
9.77k
    }
189
190
9.77k
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
191
9.77k
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
192
9.77k
    if (allow_direct_mapping) {
193
7.86k
        for (const auto& variant_ptr : variant_ptrs) {
194
7.86k
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
195
7.86k
                    max_key, min_key);
196
7.86k
        }
197
5.71k
    }
198
9.77k
}
_ZN5doris25primary_to_direct_mappingINS_15MethodOneNumberIN4wide7integerILm128EjEENS_13JoinHashTableIS4_NS_17HashCRC32Return32IS4_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISF_EERKSC_ISt10shared_ptrINS_16JoinDataVariantsEESaISM_EE
Line
Count
Source
160
861
                               const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
161
861
    using FieldType = typename Method::Base::Key;
162
861
    FieldType max_key = std::numeric_limits<FieldType>::min();
163
861
    FieldType min_key = std::numeric_limits<FieldType>::max();
164
165
861
    size_t num_rows = key_columns[0]->size();
166
861
    if (is_column_nullable(*key_columns[0])) {
167
0
        const FieldType* input_keys = (FieldType*)assert_cast<const ColumnNullable*>(key_columns[0])
168
0
                                              ->get_nested_column_ptr()
169
0
                                              ->get_raw_data()
170
0
                                              .data;
171
0
        const NullMap& null_map =
172
0
                assert_cast<const ColumnNullable*>(key_columns[0])->get_null_map_data();
173
        // skip first mocked row
174
0
        for (size_t i = 1; i < num_rows; i++) {
175
0
            if (null_map[i]) {
176
0
                continue;
177
0
            }
178
0
            max_key = std::max(max_key, input_keys[i]);
179
0
            min_key = std::min(min_key, input_keys[i]);
180
0
        }
181
861
    } else {
182
861
        const FieldType* input_keys = (FieldType*)key_columns[0]->get_raw_data().data;
183
        // skip first mocked row
184
2.56k
        for (size_t i = 1; i < num_rows; i++) {
185
1.69k
            max_key = std::max(max_key, input_keys[i]);
186
1.69k
            min_key = std::min(min_key, input_keys[i]);
187
1.69k
        }
188
861
    }
189
190
861
    constexpr auto MAX_MAPPING_RANGE = 1 << 23;
191
861
    bool allow_direct_mapping = (max_key >= min_key && max_key - min_key < MAX_MAPPING_RANGE - 1);
192
861
    if (allow_direct_mapping) {
193
850
        for (const auto& variant_ptr : variant_ptrs) {
194
850
            variant_ptr->method_variant.emplace<DirectPrimaryTypeHashTableContext<FieldType>>(
195
850
                    max_key, min_key);
196
850
        }
197
733
    }
198
861
}
199
200
template <typename Method>
201
void try_convert_to_direct_mapping(
202
        Method* method, const ColumnRawPtrs& key_columns,
203
97.4k
        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_9StringRefENS_17HashCRC32Return32IS3_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
203
28.5k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodOneNumberIN4wide7integerILm256EjEENS_13JoinHashTableIS4_NS_17HashCRC32Return32IS4_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISF_EERKSC_ISt10shared_ptrINS_16JoinDataVariantsEESaISM_EE
Line
Count
Source
203
69
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_21MethodOneNumberDirectIhNS_13JoinHashTableIhNS_17HashCRC32Return32IhEELb1EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_21MethodOneNumberDirectItNS_13JoinHashTableItNS_17HashCRC32Return32ItEELb1EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_21MethodOneNumberDirectIjNS_13JoinHashTableIjNS_17HashCRC32Return32IjEELb1EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_21MethodOneNumberDirectImNS_13JoinHashTableImNS_17HashCRC32Return32ImEELb1EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Unexecuted instantiation: _ZN5doris29try_convert_to_direct_mappingINS_21MethodOneNumberDirectIN4wide7integerILm128EjEENS_13JoinHashTableIS4_NS_17HashCRC32Return32IS4_EELb1EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISF_EERKSC_ISt10shared_ptrINS_16JoinDataVariantsEESaISM_EE
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableImNS_17HashCRC32Return32ImEELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISC_EERKS9_ISt10shared_ptrINS_16JoinDataVariantsEESaISJ_EE
Line
Count
Source
203
10.8k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableINS_6UInt72ENS_17HashCRC32Return32IS3_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
203
6.44k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableINS_6UInt96ENS_17HashCRC32Return32IS3_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
203
16.0k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableINS_7UInt104ENS_17HashCRC32Return32IS3_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
203
39
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableIN4wide7integerILm128EjEENS_17HashCRC32Return32IS5_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISF_EERKSC_ISt10shared_ptrINS_16JoinDataVariantsEESaISM_EE
Line
Count
Source
203
16.0k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableINS_7UInt136ENS_17HashCRC32Return32IS3_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
203
1.92k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_15MethodKeysFixedINS_13JoinHashTableIN4wide7integerILm256EjEENS_17HashCRC32Return32IS5_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISF_EERKSC_ISt10shared_ptrINS_16JoinDataVariantsEESaISM_EE
Line
Count
Source
203
15.8k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
_ZN5doris29try_convert_to_direct_mappingINS_19MethodStringNoCacheINS_13JoinHashTableINS_9StringRefENS_17HashCRC32Return32IS3_EELb0EEEEEEEvPT_RKSt6vectorIPKNS_7IColumnESaISD_EERKSA_ISt10shared_ptrINS_16JoinDataVariantsEESaISK_EE
Line
Count
Source
203
1.52k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {}
204
205
inline void try_convert_to_direct_mapping(
206
        PrimaryTypeHashTableContext<UInt8>* context, const ColumnRawPtrs& key_columns,
207
1.50k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
208
1.50k
    primary_to_direct_mapping(context, key_columns, variant_ptrs);
209
1.50k
}
210
211
inline void try_convert_to_direct_mapping(
212
        PrimaryTypeHashTableContext<UInt16>* context, const ColumnRawPtrs& key_columns,
213
1.16k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
214
1.16k
    primary_to_direct_mapping(context, key_columns, variant_ptrs);
215
1.16k
}
216
217
inline void try_convert_to_direct_mapping(
218
        PrimaryTypeHashTableContext<UInt32>* context, const ColumnRawPtrs& key_columns,
219
18.4k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
220
18.4k
    primary_to_direct_mapping(context, key_columns, variant_ptrs);
221
18.4k
}
222
223
inline void try_convert_to_direct_mapping(
224
        PrimaryTypeHashTableContext<UInt64>* context, const ColumnRawPtrs& key_columns,
225
9.77k
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
226
9.77k
    primary_to_direct_mapping(context, key_columns, variant_ptrs);
227
9.77k
}
228
229
inline void try_convert_to_direct_mapping(
230
        PrimaryTypeHashTableContext<UInt128>* context, const ColumnRawPtrs& key_columns,
231
861
        const std::vector<std::shared_ptr<JoinDataVariants>>& variant_ptrs) {
232
861
    primary_to_direct_mapping(context, key_columns, variant_ptrs);
233
861
}
234
235
// ASOF JOIN index with inline values for cache-friendly branchless binary search.
236
// IntType is the integer representation of the ASOF column value:
237
//   uint32_t for DateV2, uint64_t for DateTimeV2 and TimestampTZ.
238
// Rows are sorted by asof_value during build, then materialized into SoA arrays
239
// so probe-side binary search only touches the ASOF values hot path.
240
template <typename IntType>
241
struct AsofIndexGroup {
242
    using int_type = IntType;
243
244
    struct Entry {
245
        IntType asof_value;
246
        uint32_t row_index; // 1-based, 0 = invalid/padding
247
    };
248
249
    std::vector<Entry> entries;
250
    std::vector<IntType> asof_values;
251
    std::vector<uint32_t> row_indexes;
252
253
4.49k
    void add_row(IntType value, uint32_t row_idx) { entries.push_back({value, row_idx}); }
_ZN5doris14AsofIndexGroupIjE7add_rowEjj
Line
Count
Source
253
2.10k
    void add_row(IntType value, uint32_t row_idx) { entries.push_back({value, row_idx}); }
_ZN5doris14AsofIndexGroupImE7add_rowEmj
Line
Count
Source
253
2.39k
    void add_row(IntType value, uint32_t row_idx) { entries.push_back({value, row_idx}); }
254
255
467
    void sort_and_finalize() {
256
467
        if (entries.empty()) {
257
8
            return;
258
8
        }
259
459
        if (entries.size() > 1) {
260
407
            pdqsort(entries.begin(), entries.end(),
261
13.7k
                    [](const Entry& a, const Entry& b) { return a.asof_value < b.asof_value; });
_ZZN5doris14AsofIndexGroupIjE17sort_and_finalizeEvENKUlRKNS1_5EntryES4_E_clES4_S4_
Line
Count
Source
261
4.11k
                    [](const Entry& a, const Entry& b) { return a.asof_value < b.asof_value; });
_ZZN5doris14AsofIndexGroupImE17sort_and_finalizeEvENKUlRKNS1_5EntryES4_E_clES4_S4_
Line
Count
Source
261
9.65k
                    [](const Entry& a, const Entry& b) { return a.asof_value < b.asof_value; });
262
407
        }
263
264
459
        asof_values.resize(entries.size());
265
459
        row_indexes.resize(entries.size());
266
4.95k
        for (size_t i = 0; i < entries.size(); ++i) {
267
4.50k
            asof_values[i] = entries[i].asof_value;
268
4.50k
            row_indexes[i] = entries[i].row_index;
269
4.50k
        }
270
271
459
        std::vector<Entry>().swap(entries);
272
459
    }
_ZN5doris14AsofIndexGroupIjE17sort_and_finalizeEv
Line
Count
Source
255
40
    void sort_and_finalize() {
256
40
        if (entries.empty()) {
257
8
            return;
258
8
        }
259
32
        if (entries.size() > 1) {
260
25
            pdqsort(entries.begin(), entries.end(),
261
25
                    [](const Entry& a, const Entry& b) { return a.asof_value < b.asof_value; });
262
25
        }
263
264
32
        asof_values.resize(entries.size());
265
32
        row_indexes.resize(entries.size());
266
2.14k
        for (size_t i = 0; i < entries.size(); ++i) {
267
2.10k
            asof_values[i] = entries[i].asof_value;
268
2.10k
            row_indexes[i] = entries[i].row_index;
269
2.10k
        }
270
271
32
        std::vector<Entry>().swap(entries);
272
32
    }
_ZN5doris14AsofIndexGroupImE17sort_and_finalizeEv
Line
Count
Source
255
427
    void sort_and_finalize() {
256
427
        if (entries.empty()) {
257
0
            return;
258
0
        }
259
427
        if (entries.size() > 1) {
260
382
            pdqsort(entries.begin(), entries.end(),
261
382
                    [](const Entry& a, const Entry& b) { return a.asof_value < b.asof_value; });
262
382
        }
263
264
427
        asof_values.resize(entries.size());
265
427
        row_indexes.resize(entries.size());
266
2.81k
        for (size_t i = 0; i < entries.size(); ++i) {
267
2.39k
            asof_values[i] = entries[i].asof_value;
268
2.39k
            row_indexes[i] = entries[i].row_index;
269
2.39k
        }
270
271
427
        std::vector<Entry>().swap(entries);
272
427
    }
273
274
818
    const IntType* values_data() const { return asof_values.data(); }
_ZNK5doris14AsofIndexGroupIjE11values_dataEv
Line
Count
Source
274
2
    const IntType* values_data() const { return asof_values.data(); }
_ZNK5doris14AsofIndexGroupImE11values_dataEv
Line
Count
Source
274
816
    const IntType* values_data() const { return asof_values.data(); }
275
276
    // Branchless lower_bound: first i where asof_values[i] >= target
277
493
    ALWAYS_INLINE size_t lower_bound(IntType target) const {
278
493
        size_t lo = 0, n = asof_values.size();
279
2.48k
        while (n > 1) {
280
1.99k
            size_t half = n / 2;
281
1.99k
            lo += half * (asof_values[lo + half] < target);
282
1.99k
            n -= half;
283
1.99k
        }
284
493
        if (lo < asof_values.size()) {
285
491
            lo += (asof_values[lo] < target);
286
491
        }
287
493
        return lo;
288
493
    }
_ZNK5doris14AsofIndexGroupIjE11lower_boundEj
Line
Count
Source
277
66
    ALWAYS_INLINE size_t lower_bound(IntType target) const {
278
66
        size_t lo = 0, n = asof_values.size();
279
326
        while (n > 1) {
280
260
            size_t half = n / 2;
281
260
            lo += half * (asof_values[lo + half] < target);
282
260
            n -= half;
283
260
        }
284
66
        if (lo < asof_values.size()) {
285
64
            lo += (asof_values[lo] < target);
286
64
        }
287
66
        return lo;
288
66
    }
_ZNK5doris14AsofIndexGroupImE11lower_boundEm
Line
Count
Source
277
427
    ALWAYS_INLINE size_t lower_bound(IntType target) const {
278
427
        size_t lo = 0, n = asof_values.size();
279
2.15k
        while (n > 1) {
280
1.73k
            size_t half = n / 2;
281
1.73k
            lo += half * (asof_values[lo + half] < target);
282
1.73k
            n -= half;
283
1.73k
        }
284
427
        if (lo < asof_values.size()) {
285
427
            lo += (asof_values[lo] < target);
286
427
        }
287
427
        return lo;
288
427
    }
289
290
    // Branchless upper_bound: first i where asof_values[i] > target
291
990
    ALWAYS_INLINE size_t upper_bound(IntType target) const {
292
990
        size_t lo = 0, n = asof_values.size();
293
4.29k
        while (n > 1) {
294
3.30k
            size_t half = n / 2;
295
3.30k
            lo += half * (asof_values[lo + half] <= target);
296
3.30k
            n -= half;
297
3.30k
        }
298
990
        if (lo < asof_values.size()) {
299
988
            lo += (asof_values[lo] <= target);
300
988
        }
301
990
        return lo;
302
990
    }
_ZNK5doris14AsofIndexGroupIjE11upper_boundEj
Line
Count
Source
291
79
    ALWAYS_INLINE size_t upper_bound(IntType target) const {
292
79
        size_t lo = 0, n = asof_values.size();
293
423
        while (n > 1) {
294
344
            size_t half = n / 2;
295
344
            lo += half * (asof_values[lo + half] <= target);
296
344
            n -= half;
297
344
        }
298
79
        if (lo < asof_values.size()) {
299
77
            lo += (asof_values[lo] <= target);
300
77
        }
301
79
        return lo;
302
79
    }
_ZNK5doris14AsofIndexGroupImE11upper_boundEm
Line
Count
Source
291
911
    ALWAYS_INLINE size_t upper_bound(IntType target) const {
292
911
        size_t lo = 0, n = asof_values.size();
293
3.86k
        while (n > 1) {
294
2.95k
            size_t half = n / 2;
295
2.95k
            lo += half * (asof_values[lo + half] <= target);
296
2.95k
            n -= half;
297
2.95k
        }
298
911
        if (lo < asof_values.size()) {
299
911
            lo += (asof_values[lo] <= target);
300
911
        }
301
911
        return lo;
302
911
    }
303
304
    // Semantics by (is_greater, is_strict):
305
    //   (true,  false): probe >= build  ->  find largest  build value <= probe
306
    //   (true,  true):  probe >  build  ->  find largest  build value <  probe
307
    //   (false, false): probe <= build  ->  find smallest build value >= probe
308
    //   (false, true):  probe <  build  ->  find smallest build value >  probe
309
    // Returns the build row index of the best match, or 0 if no match.
310
    template <bool IsGreater, bool IsStrict>
311
1.45k
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
1.45k
        if (asof_values.empty()) {
313
8
            return 0;
314
8
        }
315
1.44k
        if constexpr (IsGreater) {
316
977
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
977
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
977
        } else {
319
470
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
470
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
470
        }
322
1.44k
    }
_ZNK5doris14AsofIndexGroupIjE15find_best_matchILb1ELb1EEEjj
Line
Count
Source
311
30
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
30
        if (asof_values.empty()) {
313
2
            return 0;
314
2
        }
315
28
        if constexpr (IsGreater) {
316
28
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
28
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
        } else {
319
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
        }
322
28
    }
_ZNK5doris14AsofIndexGroupIjE15find_best_matchILb1ELb0EEEjj
Line
Count
Source
311
41
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
41
        if (asof_values.empty()) {
313
2
            return 0;
314
2
        }
315
39
        if constexpr (IsGreater) {
316
39
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
39
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
        } else {
319
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
        }
322
39
    }
_ZNK5doris14AsofIndexGroupIjE15find_best_matchILb0ELb1EEEjj
Line
Count
Source
311
32
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
32
        if (asof_values.empty()) {
313
2
            return 0;
314
2
        }
315
        if constexpr (IsGreater) {
316
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
30
        } else {
319
30
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
30
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
30
        }
322
30
    }
_ZNK5doris14AsofIndexGroupIjE15find_best_matchILb0ELb0EEEjj
Line
Count
Source
311
30
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
30
        if (asof_values.empty()) {
313
2
            return 0;
314
2
        }
315
        if constexpr (IsGreater) {
316
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
28
        } else {
319
28
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
28
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
28
        }
322
28
    }
_ZNK5doris14AsofIndexGroupImE15find_best_matchILb1ELb1EEEjm
Line
Count
Source
311
206
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
206
        if (asof_values.empty()) {
313
0
            return 0;
314
0
        }
315
206
        if constexpr (IsGreater) {
316
206
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
206
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
        } else {
319
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
        }
322
206
    }
_ZNK5doris14AsofIndexGroupImE15find_best_matchILb1ELb0EEEjm
Line
Count
Source
311
704
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
704
        if (asof_values.empty()) {
313
0
            return 0;
314
0
        }
315
704
        if constexpr (IsGreater) {
316
704
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
704
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
        } else {
319
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
        }
322
704
    }
_ZNK5doris14AsofIndexGroupImE15find_best_matchILb0ELb1EEEjm
Line
Count
Source
311
199
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
199
        if (asof_values.empty()) {
313
0
            return 0;
314
0
        }
315
        if constexpr (IsGreater) {
316
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
199
        } else {
319
199
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
199
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
199
        }
322
199
    }
_ZNK5doris14AsofIndexGroupImE15find_best_matchILb0ELb0EEEjm
Line
Count
Source
311
213
    ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const {
312
213
        if (asof_values.empty()) {
313
0
            return 0;
314
0
        }
315
        if constexpr (IsGreater) {
316
            size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value);
317
            return pos > 0 ? row_indexes[pos - 1] : 0;
318
213
        } else {
319
213
            size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value);
320
213
            return pos < asof_values.size() ? row_indexes[pos] : 0;
321
213
        }
322
213
    }
323
};
324
325
// Type-erased container for all ASOF index groups.
326
// DateV2 -> uint32_t, DateTimeV2/TimestampTZ -> uint64_t.
327
using AsofIndexVariant = std::variant<std::monostate, std::vector<AsofIndexGroup<uint32_t>>,
328
                                      std::vector<AsofIndexGroup<uint64_t>>>;
329
330
} // namespace doris