/root/doris/be/src/exprs/vtopn_pred.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 <gen_cpp/types.pb.h> |
21 | | |
22 | | #include <utility> |
23 | | |
24 | | #include "core/block/column_numbers.h" |
25 | | #include "core/data_type/data_type.h" |
26 | | #include "exec/common/util.hpp" |
27 | | #include "exprs/function/simple_function_factory.h" |
28 | | #include "exprs/vectorized_fn_call.h" |
29 | | #include "exprs/vexpr.h" |
30 | | #include "exprs/vslot_ref.h" |
31 | | #include "runtime/query_context.h" |
32 | | #include "runtime/runtime_predicate.h" |
33 | | #include "runtime/runtime_state.h" |
34 | | |
35 | | namespace doris { |
36 | | #include "common/compile_check_begin.h" |
37 | | |
38 | | // only used for dynamic topn filter |
39 | | class VTopNPred : public VExpr { |
40 | | ENABLE_FACTORY_CREATOR(VTopNPred); |
41 | | |
42 | | public: |
43 | | VTopNPred(const TExprNode& node, int source_node_id, VExprContextSPtr target_ctx) |
44 | 33 | : VExpr(node), |
45 | 33 | _source_node_id(source_node_id), |
46 | 33 | _expr_name(fmt::format("VTopNPred(source_node_id={})", _source_node_id)), |
47 | 33 | _target_ctx(std::move(target_ctx)) {} |
48 | 2 | bool is_topn_filter() const override { return true; } |
49 | | |
50 | 0 | static Status create_vtopn_pred(const TExpr& target_expr, int source_node_id, VExprSPtr& expr) { |
51 | 0 | VExprContextSPtr target_ctx; |
52 | 0 | RETURN_IF_ERROR(VExpr::create_expr_tree(target_expr, target_ctx)); |
53 | | |
54 | 0 | TExprNode node; |
55 | 0 | node.__set_node_type(TExprNodeType::FUNCTION_CALL); |
56 | 0 | node.__set_type(create_type_desc(PrimitiveType::TYPE_BOOLEAN)); |
57 | 0 | node.__set_is_nullable(target_ctx->root()->is_nullable()); |
58 | 0 | expr = VTopNPred::create_shared(node, source_node_id, target_ctx); |
59 | |
|
60 | 0 | DCHECK(target_ctx->root() != nullptr); |
61 | 0 | expr->add_child(target_ctx->root()); |
62 | |
|
63 | 0 | return Status::OK(); |
64 | 0 | } |
65 | | |
66 | 0 | int source_node_id() const { return _source_node_id; } |
67 | 0 | Status clone_node(VExprSPtr* cloned_expr) const override { |
68 | 0 | DORIS_CHECK(cloned_expr != nullptr); |
69 | 0 | *cloned_expr = VTopNPred::create_shared(clone_texpr_node(), _source_node_id, nullptr); |
70 | 0 | return Status::OK(); |
71 | 0 | } |
72 | | |
73 | 33 | Status prepare(RuntimeState* state, const RowDescriptor& desc, VExprContext* context) override { |
74 | 33 | _predicate = &state->get_query_ctx()->get_runtime_predicate(_source_node_id); |
75 | 33 | RETURN_IF_ERROR_OR_PREPARED(VExpr::prepare(state, desc, context)); |
76 | | |
77 | 33 | ColumnsWithTypeAndName argument_template; |
78 | 33 | argument_template.emplace_back(nullptr, _children[0]->data_type(), |
79 | 33 | _children[0]->expr_name()); |
80 | 33 | argument_template.emplace_back(nullptr, _children[0]->data_type(), "topn value"); |
81 | | |
82 | 33 | _function = SimpleFunctionFactory::instance().get_function( |
83 | 33 | _predicate->is_asc() ? "le" : "ge", argument_template, _data_type, {}, |
84 | 33 | state->be_exec_version()); |
85 | 33 | if (!_function) { |
86 | 0 | return Status::InternalError("get function failed"); |
87 | 0 | } |
88 | 33 | return Status::OK(); |
89 | 33 | } |
90 | | |
91 | | Status execute_column(VExprContext* context, const Block* block, Selector* selector, |
92 | 3 | size_t count, ColumnPtr& result_column) const override { |
93 | 3 | if (!_predicate->has_value()) { |
94 | 1 | result_column = create_always_true_column(count, _data_type->is_nullable()); |
95 | 1 | return Status::OK(); |
96 | 1 | } |
97 | | |
98 | 2 | Block temp_block; |
99 | | |
100 | | // slot |
101 | 2 | ColumnPtr slot_column; |
102 | 2 | RETURN_IF_ERROR(_children[0]->execute_column(context, block, selector, count, slot_column)); |
103 | 2 | auto slot_type = _children[0]->execute_type(block); |
104 | 2 | temp_block.insert({slot_column, slot_type, _children[0]->expr_name()}); |
105 | 2 | int slot_id = 0; |
106 | | |
107 | | // topn value |
108 | 2 | Field field = _predicate->get_value(); |
109 | 2 | auto column_ptr = _children[0]->data_type()->create_column_const(1, field); |
110 | 2 | int topn_value_id = VExpr::insert_param(&temp_block, |
111 | 2 | {column_ptr, _children[0]->data_type(), _expr_name}, |
112 | 2 | std::max(count, column_ptr->size())); |
113 | | |
114 | | // if error(slot_id == -1), will return. |
115 | 2 | ColumnNumbers arguments = {static_cast<uint32_t>(slot_id), |
116 | 2 | static_cast<uint32_t>(topn_value_id)}; |
117 | | |
118 | 2 | uint32_t num_columns_without_result = temp_block.columns(); |
119 | | // prepare a column to save result |
120 | 2 | temp_block.insert({nullptr, _data_type, _expr_name}); |
121 | | |
122 | 2 | RETURN_IF_ERROR(_function->execute(nullptr, temp_block, arguments, |
123 | 2 | num_columns_without_result, temp_block.rows())); |
124 | 2 | result_column = std::move(temp_block.get_by_position(num_columns_without_result).column); |
125 | 2 | if (is_nullable() && _predicate->nulls_first()) { |
126 | | // null values are always not filtered |
127 | 0 | change_null_to_true(result_column); |
128 | 0 | } |
129 | 2 | DCHECK_EQ(result_column->size(), count); |
130 | 2 | return Status::OK(); |
131 | 2 | } |
132 | | |
133 | | // Returns true only for a direct slot binding whose logical fixed-width type exactly matches |
134 | | // `data_type`. Eligibility does not depend on whether the dynamic TopN bound has arrived: a |
135 | | // reader may cache this answer during initialization and observe the bound in a later batch. |
136 | | bool can_execute_on_raw_fixed_values(const DataTypePtr& data_type, |
137 | | int column_id) const override; |
138 | | |
139 | | // Compares the contiguous non-NULL physical values with one snapshot of the current TopN bound |
140 | | // and ANDs the result into `matches`. `value_width` must equal the logical Doris value width. |
141 | | // When no bound is available yet, this is deliberately an all-pass operation. |
142 | | Status execute_on_raw_fixed_values(const uint8_t* values, size_t num_values, size_t value_width, |
143 | | const DataTypePtr& data_type, int column_id, |
144 | | uint8_t* matches) const override; |
145 | | |
146 | | // Returns true for a directly bound STRING-like or VARBINARY slot. As with the fixed-width |
147 | | // capability, a not-yet-published bound does not force the scanner onto a materializing path. |
148 | | bool can_execute_on_raw_binary_values(const DataTypePtr& data_type, |
149 | | int column_id) const override; |
150 | | |
151 | | // Compares decoder-owned immutable byte slices with the current TopN bound and ANDs each |
152 | | // decision into `matches`; it never copies the slices into a ColumnString/ColumnVarbinary. |
153 | | Status execute_on_raw_binary_values(const StringRef* values, size_t num_values, |
154 | | const DataTypePtr& data_type, int column_id, |
155 | | uint8_t* matches) const override; |
156 | | |
157 | 9 | bool raw_predicate_result_for_null() const override { |
158 | | // execute_column() is all-pass until publication; afterwards NULLS FIRST keeps NULL while |
159 | | // NULLS LAST rejects it. Sample this state per fragment just like the mutable bound. |
160 | 9 | return _predicate != nullptr && (!_predicate->has_value() || _predicate->nulls_first()); |
161 | 9 | } |
162 | | |
163 | | // Dictionary capability is restricted to a direct slot and NULLS-LAST semantics. It stays |
164 | | // enabled before the first bound so row-group setup can cache an all-pass bitmap; the scan |
165 | | // scheduler retains a per-batch residual and defers dictionary-id filtering while NULL still |
166 | | // matches, then safely resumes it after bound publication. |
167 | | bool can_evaluate_dictionary_filter() const override; |
168 | | |
169 | | // Evaluates every non-NULL entry in the bound slot dictionary against one current-bound |
170 | | // snapshot. kNoMatch proves that no entry can pass; kMayMatch includes both a matching entry and |
171 | | // a not-yet-published bound; kUnsupported reports an absent or incompatible dictionary slot. |
172 | | ZoneMapFilterResult evaluate_dictionary_filter(const DictionaryEvalContext& ctx) const override; |
173 | | |
174 | 0 | const std::string& expr_name() const override { return _expr_name; } |
175 | | |
176 | | // only used in external table (for min-max filter). get `slot > xxx`, not `function(slot) > xxx`. |
177 | 0 | bool get_binary_expr(VExprSPtr& new_root) const { |
178 | 0 | if (!get_child(0)->is_slot_ref()) { |
179 | | // top rf maybe is `xxx order by abs(column) limit xxx`. |
180 | 0 | return false; |
181 | 0 | } |
182 | | |
183 | 0 | if (!_predicate->has_value()) { |
184 | 0 | return false; |
185 | 0 | } |
186 | | |
187 | 0 | auto* slot_ref = assert_cast<VSlotRef*>(get_child(0).get()); |
188 | 0 | auto slot_data_type = remove_nullable(slot_ref->data_type()); |
189 | 0 | { |
190 | 0 | TFunction fn; |
191 | 0 | TFunctionName fn_name; |
192 | 0 | fn_name.__set_db_name(""); |
193 | 0 | fn_name.__set_function_name(_predicate->is_asc() ? "le" : "ge"); |
194 | 0 | fn.__set_name(fn_name); |
195 | 0 | fn.__set_binary_type(TFunctionBinaryType::BUILTIN); |
196 | 0 | std::vector<TTypeDesc> arg_types; |
197 | 0 | arg_types.push_back(create_type_desc(slot_data_type->get_primitive_type(), |
198 | 0 | slot_data_type->get_precision(), |
199 | 0 | slot_data_type->get_scale())); |
200 | |
|
201 | 0 | arg_types.push_back(create_type_desc(slot_data_type->get_primitive_type(), |
202 | 0 | slot_data_type->get_precision(), |
203 | 0 | slot_data_type->get_scale())); |
204 | 0 | fn.__set_arg_types(arg_types); |
205 | 0 | fn.__set_ret_type(create_type_desc(PrimitiveType::TYPE_BOOLEAN)); |
206 | 0 | fn.__set_has_var_args(false); |
207 | |
|
208 | 0 | TExprNode texpr_node; |
209 | 0 | texpr_node.__set_type(create_type_desc(PrimitiveType::TYPE_BOOLEAN)); |
210 | 0 | texpr_node.__set_node_type(TExprNodeType::BINARY_PRED); |
211 | 0 | texpr_node.__set_opcode(_predicate->is_asc() ? TExprOpcode::LE : TExprOpcode::GE); |
212 | 0 | texpr_node.__set_fn(fn); |
213 | 0 | texpr_node.__set_num_children(2); |
214 | 0 | texpr_node.__set_is_nullable(is_nullable()); |
215 | 0 | new_root = VectorizedFnCall::create_shared(texpr_node); |
216 | 0 | } |
217 | |
|
218 | 0 | { |
219 | | // add slot |
220 | 0 | new_root->add_child(children().at(0)); |
221 | 0 | } |
222 | | // add Literal |
223 | 0 | { |
224 | 0 | Field field = _predicate->get_value(); |
225 | 0 | TExprNode node = create_texpr_node_from(field, slot_data_type->get_primitive_type(), |
226 | 0 | slot_data_type->get_precision(), |
227 | 0 | slot_data_type->get_scale()); |
228 | 0 | new_root->add_child(VLiteral::create_shared(node)); |
229 | 0 | } |
230 | | |
231 | | // Since the normal greater than or less than relationship does not consider the relationship of null values, the generated `col >=/<= xxx OR col is null.` |
232 | 0 | if (_predicate->nulls_first()) { |
233 | 0 | VExprSPtr col_is_null_node; |
234 | 0 | { |
235 | 0 | TFunction fn; |
236 | 0 | TFunctionName fn_name; |
237 | 0 | fn_name.__set_db_name(""); |
238 | 0 | fn_name.__set_function_name("is_null_pred"); |
239 | 0 | fn.__set_name(fn_name); |
240 | 0 | fn.__set_binary_type(TFunctionBinaryType::BUILTIN); |
241 | 0 | std::vector<TTypeDesc> arg_types; |
242 | 0 | arg_types.push_back(create_type_desc(slot_data_type->get_primitive_type(), |
243 | 0 | slot_data_type->get_precision(), |
244 | 0 | slot_data_type->get_scale())); |
245 | 0 | fn.__set_arg_types(arg_types); |
246 | 0 | fn.__set_ret_type(create_type_desc(PrimitiveType::TYPE_BOOLEAN)); |
247 | 0 | fn.__set_has_var_args(false); |
248 | |
|
249 | 0 | TExprNode texpr_node; |
250 | 0 | texpr_node.__set_type(create_type_desc(PrimitiveType::TYPE_BOOLEAN)); |
251 | 0 | texpr_node.__set_node_type(TExprNodeType::FUNCTION_CALL); |
252 | 0 | texpr_node.__set_fn(fn); |
253 | 0 | texpr_node.__set_num_children(1); |
254 | 0 | col_is_null_node = VectorizedFnCall::create_shared(texpr_node); |
255 | | |
256 | | // add slot. |
257 | 0 | col_is_null_node->add_child(children().at(0)); |
258 | 0 | } |
259 | |
|
260 | 0 | VExprSPtr or_node; |
261 | 0 | { |
262 | 0 | TExprNode texpr_node; |
263 | 0 | texpr_node.__set_type(create_type_desc(PrimitiveType::TYPE_BOOLEAN)); |
264 | 0 | texpr_node.__set_node_type(TExprNodeType::COMPOUND_PRED); |
265 | 0 | texpr_node.__set_opcode(TExprOpcode::COMPOUND_OR); |
266 | 0 | texpr_node.__set_num_children(2); |
267 | 0 | or_node = VectorizedFnCall::create_shared(texpr_node); |
268 | 0 | } |
269 | |
|
270 | 0 | or_node->add_child(col_is_null_node); |
271 | 0 | or_node->add_child(new_root); |
272 | 0 | new_root = or_node; |
273 | 0 | } |
274 | |
|
275 | 0 | return true; |
276 | 0 | } |
277 | | |
278 | | private: |
279 | | int _source_node_id; |
280 | | std::string _expr_name; |
281 | | RuntimePredicate* _predicate = nullptr; |
282 | | FunctionBasePtr _function; |
283 | | VExprContextSPtr _target_ctx; |
284 | | }; |
285 | | |
286 | | #include "common/compile_check_end.h" |
287 | | } // namespace doris |