|
| 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 | +// Lightweight join-op level types split out of join_utils.h so that |
| 21 | +// exec/pipeline/dependency.h (which holds JoinOpVariants / AsofIndexVariant |
| 22 | +// members by value) does not have to see the hash-table machinery. |
| 23 | +// Everything here depends only on thrift enums and std containers. |
| 24 | + |
| 25 | +#include <gen_cpp/PlanNodes_types.h> |
| 26 | +#include <pdqsort.h> |
| 27 | + |
| 28 | +#include <cstdint> |
| 29 | +#include <variant> |
| 30 | +#include <vector> |
| 31 | + |
| 32 | +#include "common/compiler_util.h" |
| 33 | + |
| 34 | +namespace doris { |
| 35 | + |
| 36 | +using JoinOpVariants = |
| 37 | + std::variant<std::integral_constant<TJoinOp::type, TJoinOp::INNER_JOIN>, |
| 38 | + std::integral_constant<TJoinOp::type, TJoinOp::LEFT_SEMI_JOIN>, |
| 39 | + std::integral_constant<TJoinOp::type, TJoinOp::LEFT_ANTI_JOIN>, |
| 40 | + std::integral_constant<TJoinOp::type, TJoinOp::LEFT_OUTER_JOIN>, |
| 41 | + std::integral_constant<TJoinOp::type, TJoinOp::FULL_OUTER_JOIN>, |
| 42 | + std::integral_constant<TJoinOp::type, TJoinOp::RIGHT_OUTER_JOIN>, |
| 43 | + std::integral_constant<TJoinOp::type, TJoinOp::CROSS_JOIN>, |
| 44 | + std::integral_constant<TJoinOp::type, TJoinOp::RIGHT_SEMI_JOIN>, |
| 45 | + std::integral_constant<TJoinOp::type, TJoinOp::RIGHT_ANTI_JOIN>, |
| 46 | + std::integral_constant<TJoinOp::type, TJoinOp::NULL_AWARE_LEFT_ANTI_JOIN>, |
| 47 | + std::integral_constant<TJoinOp::type, TJoinOp::NULL_AWARE_LEFT_SEMI_JOIN>, |
| 48 | + std::integral_constant<TJoinOp::type, TJoinOp::ASOF_LEFT_INNER_JOIN>, |
| 49 | + std::integral_constant<TJoinOp::type, TJoinOp::ASOF_LEFT_OUTER_JOIN>>; |
| 50 | + |
| 51 | +inline bool is_asof_join(TJoinOp::type join_op) { |
| 52 | + return join_op == TJoinOp::ASOF_LEFT_INNER_JOIN || join_op == TJoinOp::ASOF_LEFT_OUTER_JOIN; |
| 53 | +} |
| 54 | + |
| 55 | +template <int JoinOpType> |
| 56 | +inline constexpr bool is_asof_join_op_v = |
| 57 | + JoinOpType == TJoinOp::ASOF_LEFT_INNER_JOIN || JoinOpType == TJoinOp::ASOF_LEFT_OUTER_JOIN; |
| 58 | + |
| 59 | +template <int JoinOpType> |
| 60 | +inline constexpr bool is_asof_outer_join_op_v = JoinOpType == TJoinOp::ASOF_LEFT_OUTER_JOIN; |
| 61 | + |
| 62 | +// ASOF JOIN index with inline values for cache-friendly branchless binary search. |
| 63 | +// IntType is the integer representation of the ASOF column value: |
| 64 | +// uint32_t for DateV2, uint64_t for DateTimeV2 and TimestampTZ. |
| 65 | +// Rows are sorted by asof_value during build, then materialized into SoA arrays |
| 66 | +// so probe-side binary search only touches the ASOF values hot path. |
| 67 | +template <typename IntType> |
| 68 | +struct AsofIndexGroup { |
| 69 | + using int_type = IntType; |
| 70 | + |
| 71 | + struct Entry { |
| 72 | + IntType asof_value; |
| 73 | + uint32_t row_index; // 1-based, 0 = invalid/padding |
| 74 | + }; |
| 75 | + |
| 76 | + std::vector<Entry> entries; |
| 77 | + std::vector<IntType> asof_values; |
| 78 | + std::vector<uint32_t> row_indexes; |
| 79 | + |
| 80 | + void add_row(IntType value, uint32_t row_idx) { entries.push_back({value, row_idx}); } |
| 81 | + |
| 82 | + void sort_and_finalize() { |
| 83 | + if (entries.empty()) { |
| 84 | + return; |
| 85 | + } |
| 86 | + if (entries.size() > 1) { |
| 87 | + pdqsort(entries.begin(), entries.end(), |
| 88 | + [](const Entry& a, const Entry& b) { return a.asof_value < b.asof_value; }); |
| 89 | + } |
| 90 | + |
| 91 | + asof_values.resize(entries.size()); |
| 92 | + row_indexes.resize(entries.size()); |
| 93 | + for (size_t i = 0; i < entries.size(); ++i) { |
| 94 | + asof_values[i] = entries[i].asof_value; |
| 95 | + row_indexes[i] = entries[i].row_index; |
| 96 | + } |
| 97 | + |
| 98 | + std::vector<Entry>().swap(entries); |
| 99 | + } |
| 100 | + |
| 101 | + const IntType* values_data() const { return asof_values.data(); } |
| 102 | + |
| 103 | + // Branchless lower_bound: first i where asof_values[i] >= target |
| 104 | + ALWAYS_INLINE size_t lower_bound(IntType target) const { |
| 105 | + size_t lo = 0, n = asof_values.size(); |
| 106 | + while (n > 1) { |
| 107 | + size_t half = n / 2; |
| 108 | + lo += half * (asof_values[lo + half] < target); |
| 109 | + n -= half; |
| 110 | + } |
| 111 | + if (lo < asof_values.size()) { |
| 112 | + lo += (asof_values[lo] < target); |
| 113 | + } |
| 114 | + return lo; |
| 115 | + } |
| 116 | + |
| 117 | + // Branchless upper_bound: first i where asof_values[i] > target |
| 118 | + ALWAYS_INLINE size_t upper_bound(IntType target) const { |
| 119 | + size_t lo = 0, n = asof_values.size(); |
| 120 | + while (n > 1) { |
| 121 | + size_t half = n / 2; |
| 122 | + lo += half * (asof_values[lo + half] <= target); |
| 123 | + n -= half; |
| 124 | + } |
| 125 | + if (lo < asof_values.size()) { |
| 126 | + lo += (asof_values[lo] <= target); |
| 127 | + } |
| 128 | + return lo; |
| 129 | + } |
| 130 | + |
| 131 | + // Semantics by (is_greater, is_strict): |
| 132 | + // (true, false): probe >= build -> find largest build value <= probe |
| 133 | + // (true, true): probe > build -> find largest build value < probe |
| 134 | + // (false, false): probe <= build -> find smallest build value >= probe |
| 135 | + // (false, true): probe < build -> find smallest build value > probe |
| 136 | + // Returns the build row index of the best match, or 0 if no match. |
| 137 | + template <bool IsGreater, bool IsStrict> |
| 138 | + ALWAYS_INLINE uint32_t find_best_match(IntType probe_value) const { |
| 139 | + if (asof_values.empty()) { |
| 140 | + return 0; |
| 141 | + } |
| 142 | + if constexpr (IsGreater) { |
| 143 | + size_t pos = IsStrict ? lower_bound(probe_value) : upper_bound(probe_value); |
| 144 | + return pos > 0 ? row_indexes[pos - 1] : 0; |
| 145 | + } else { |
| 146 | + size_t pos = IsStrict ? upper_bound(probe_value) : lower_bound(probe_value); |
| 147 | + return pos < asof_values.size() ? row_indexes[pos] : 0; |
| 148 | + } |
| 149 | + } |
| 150 | +}; |
| 151 | + |
| 152 | +// Type-erased container for all ASOF index groups. |
| 153 | +// DateV2 -> uint32_t, DateTimeV2/TimestampTZ -> uint64_t. |
| 154 | +using AsofIndexVariant = std::variant<std::monostate, std::vector<AsofIndexGroup<uint32_t>>, |
| 155 | + std::vector<AsofIndexGroup<uint64_t>>>; |
| 156 | + |
| 157 | +} // namespace doris |
0 commit comments