/root/doris/be/src/olap/column_predicate.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 <memory> |
21 | | #include <roaring/roaring.hh> |
22 | | |
23 | | #include "common/exception.h" |
24 | | #include "olap/rowset/segment_v2/bitmap_index_reader.h" |
25 | | #include "olap/rowset/segment_v2/bloom_filter.h" |
26 | | #include "olap/rowset/segment_v2/inverted_index_iterator.h" |
27 | | #include "runtime/define_primitive_type.h" |
28 | | #include "util/runtime_profile.h" |
29 | | #include "vec/columns/column.h" |
30 | | #include "vec/exec/format/parquet/parquet_predicate.h" |
31 | | #include "vec/exprs/vruntimefilter_wrapper.h" |
32 | | |
33 | | using namespace doris::segment_v2; |
34 | | |
35 | | namespace doris { |
36 | | |
37 | | enum class PredicateType { |
38 | | UNKNOWN = 0, |
39 | | EQ = 1, |
40 | | NE = 2, |
41 | | LT = 3, |
42 | | LE = 4, |
43 | | GT = 5, |
44 | | GE = 6, |
45 | | IN_LIST = 7, |
46 | | NOT_IN_LIST = 8, |
47 | | IS_NULL = 9, |
48 | | IS_NOT_NULL = 10, |
49 | | BF = 11, // BloomFilter |
50 | | BITMAP_FILTER = 12, // BitmapFilter |
51 | | MATCH = 13, // fulltext match |
52 | | }; |
53 | | |
54 | | template <PrimitiveType primitive_type, typename ResultType> |
55 | 1.07k | ResultType get_zone_map_value(void* data_ptr) { |
56 | 1.07k | ResultType res; |
57 | | // DecimalV2's storage value is different from predicate or compute value type |
58 | | // need convert it to DecimalV2Value |
59 | 1.07k | if constexpr (primitive_type == PrimitiveType::TYPE_DECIMALV2) { |
60 | 0 | decimal12_t decimal_12_t_value; |
61 | 0 | memcpy((char*)(&decimal_12_t_value), data_ptr, sizeof(decimal12_t)); |
62 | 0 | res.from_olap_decimal(decimal_12_t_value.integer, decimal_12_t_value.fraction); |
63 | 0 | } else if constexpr (primitive_type == PrimitiveType::TYPE_DATE) { |
64 | 0 | static_assert(std::is_same_v<ResultType, VecDateTimeValue>); |
65 | 0 | uint24_t date; |
66 | 0 | memcpy(&date, data_ptr, sizeof(uint24_t)); |
67 | 0 | res.from_olap_date(date); |
68 | 0 | } else if constexpr (primitive_type == PrimitiveType::TYPE_DATETIME) { |
69 | 0 | static_assert(std::is_same_v<ResultType, VecDateTimeValue>); |
70 | 0 | uint64_t datetime; |
71 | 0 | memcpy(&datetime, data_ptr, sizeof(uint64_t)); |
72 | 0 | res.from_olap_datetime(datetime); |
73 | 1.07k | } else { |
74 | 1.07k | memcpy(reinterpret_cast<void*>(&res), data_ptr, sizeof(ResultType)); |
75 | 1.07k | } |
76 | 1.07k | return res; |
77 | 1.07k | } _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE5EiEET0_Pv Line | Count | Source | 55 | 4 | ResultType get_zone_map_value(void* data_ptr) { | 56 | 4 | ResultType res; | 57 | | // DecimalV2's storage value is different from predicate or compute value type | 58 | | // need convert it to DecimalV2Value | 59 | | if constexpr (primitive_type == PrimitiveType::TYPE_DECIMALV2) { | 60 | | decimal12_t decimal_12_t_value; | 61 | | memcpy((char*)(&decimal_12_t_value), data_ptr, sizeof(decimal12_t)); | 62 | | res.from_olap_decimal(decimal_12_t_value.integer, decimal_12_t_value.fraction); | 63 | | } else if constexpr (primitive_type == PrimitiveType::TYPE_DATE) { | 64 | | static_assert(std::is_same_v<ResultType, VecDateTimeValue>); | 65 | | uint24_t date; | 66 | | memcpy(&date, data_ptr, sizeof(uint24_t)); | 67 | | res.from_olap_date(date); | 68 | | } else if constexpr (primitive_type == PrimitiveType::TYPE_DATETIME) { | 69 | | static_assert(std::is_same_v<ResultType, VecDateTimeValue>); | 70 | | uint64_t datetime; | 71 | | memcpy(&datetime, data_ptr, sizeof(uint64_t)); | 72 | | res.from_olap_datetime(datetime); | 73 | 4 | } else { | 74 | 4 | memcpy(reinterpret_cast<void*>(&res), data_ptr, sizeof(ResultType)); | 75 | 4 | } | 76 | 4 | return res; | 77 | 4 | } |
_ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE9EdEET0_Pv Line | Count | Source | 55 | 1.06k | ResultType get_zone_map_value(void* data_ptr) { | 56 | 1.06k | ResultType res; | 57 | | // DecimalV2's storage value is different from predicate or compute value type | 58 | | // need convert it to DecimalV2Value | 59 | | if constexpr (primitive_type == PrimitiveType::TYPE_DECIMALV2) { | 60 | | decimal12_t decimal_12_t_value; | 61 | | memcpy((char*)(&decimal_12_t_value), data_ptr, sizeof(decimal12_t)); | 62 | | res.from_olap_decimal(decimal_12_t_value.integer, decimal_12_t_value.fraction); | 63 | | } else if constexpr (primitive_type == PrimitiveType::TYPE_DATE) { | 64 | | static_assert(std::is_same_v<ResultType, VecDateTimeValue>); | 65 | | uint24_t date; | 66 | | memcpy(&date, data_ptr, sizeof(uint24_t)); | 67 | | res.from_olap_date(date); | 68 | | } else if constexpr (primitive_type == PrimitiveType::TYPE_DATETIME) { | 69 | | static_assert(std::is_same_v<ResultType, VecDateTimeValue>); | 70 | | uint64_t datetime; | 71 | | memcpy(&datetime, data_ptr, sizeof(uint64_t)); | 72 | | res.from_olap_datetime(datetime); | 73 | 1.06k | } else { | 74 | 1.06k | memcpy(reinterpret_cast<void*>(&res), data_ptr, sizeof(ResultType)); | 75 | 1.06k | } | 76 | 1.06k | return res; | 77 | 1.06k | } |
Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE8EfEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE11ENS_16VecDateTimeValueEEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE12ENS_16VecDateTimeValueEEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE3EaEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE4EsEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE6ElEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE7EnEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE20ENS_14DecimalV2ValueEEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE28ENS_10vectorized7DecimalIiEEEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE29ENS_10vectorized7DecimalIlEEEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE30ENS_10vectorized12Decimal128V3EEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE35ENS_10vectorized7DecimalIN4wide7integerILm256EiEEEEEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE15ENS_9StringRefEEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE23ENS_9StringRefEEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE25ENS_11DateV2ValueINS_15DateV2ValueTypeEEEEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE26ENS_11DateV2ValueINS_19DateTimeV2ValueTypeEEEEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE2EbEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE36EjEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE37EoEET0_Pv Unexecuted instantiation: _ZN5doris18get_zone_map_valueILNS_13PrimitiveTypeE10ENS_9StringRefEEET0_Pv |
78 | | |
79 | 0 | inline std::string type_to_string(PredicateType type) { |
80 | 0 | switch (type) { |
81 | 0 | case PredicateType::UNKNOWN: |
82 | 0 | return "UNKNOWN"; |
83 | | |
84 | 0 | case PredicateType::EQ: |
85 | 0 | return "EQ"; |
86 | | |
87 | 0 | case PredicateType::NE: |
88 | 0 | return "NE"; |
89 | | |
90 | 0 | case PredicateType::LT: |
91 | 0 | return "LT"; |
92 | | |
93 | 0 | case PredicateType::LE: |
94 | 0 | return "LE"; |
95 | | |
96 | 0 | case PredicateType::GT: |
97 | 0 | return "GT"; |
98 | | |
99 | 0 | case PredicateType::GE: |
100 | 0 | return "GE"; |
101 | | |
102 | 0 | case PredicateType::IN_LIST: |
103 | 0 | return "IN_LIST"; |
104 | | |
105 | 0 | case PredicateType::NOT_IN_LIST: |
106 | 0 | return "NOT_IN_LIST"; |
107 | | |
108 | 0 | case PredicateType::IS_NULL: |
109 | 0 | return "IS_NULL"; |
110 | | |
111 | 0 | case PredicateType::IS_NOT_NULL: |
112 | 0 | return "IS_NOT_NULL"; |
113 | | |
114 | 0 | case PredicateType::BF: |
115 | 0 | return "BF"; |
116 | 0 | default: |
117 | 0 | return ""; |
118 | 0 | }; |
119 | |
|
120 | 0 | return ""; |
121 | 0 | } |
122 | | |
123 | | struct PredicateTypeTraits { |
124 | 467 | static constexpr bool is_range(PredicateType type) { |
125 | 467 | return (type == PredicateType::LT || type == PredicateType::LE || |
126 | 467 | type == PredicateType::GT || type == PredicateType::GE); |
127 | 467 | } |
128 | | |
129 | 140 | static constexpr bool is_bloom_filter(PredicateType type) { return type == PredicateType::BF; } |
130 | | |
131 | 0 | static constexpr bool is_list(PredicateType type) { |
132 | 0 | return (type == PredicateType::IN_LIST || type == PredicateType::NOT_IN_LIST); |
133 | 0 | } |
134 | | |
135 | 0 | static constexpr bool is_equal_or_list(PredicateType type) { |
136 | 0 | return (type == PredicateType::EQ || type == PredicateType::IN_LIST); |
137 | 0 | } |
138 | | |
139 | 0 | static constexpr bool is_comparison(PredicateType type) { |
140 | 0 | return (type == PredicateType::EQ || type == PredicateType::NE || |
141 | 0 | type == PredicateType::LT || type == PredicateType::LE || |
142 | 0 | type == PredicateType::GT || type == PredicateType::GE); |
143 | 0 | } |
144 | | }; |
145 | | |
146 | | #define EVALUATE_BY_SELECTOR(EVALUATE_IMPL_WITH_NULL_MAP, EVALUATE_IMPL_WITHOUT_NULL_MAP) \ |
147 | 4.19k | const bool is_dense_column = pred_col.size() == size; \ |
148 | 3.90M | for (uint16_t i = 0; i < size; i++) { \ |
149 | 3.90M | uint16_t idx = is_dense_column ? i : sel[i]; \ |
150 | 3.90M | if constexpr (is_nullable) { \ |
151 | 9.40k | if (EVALUATE_IMPL_WITH_NULL_MAP(idx)) { \ |
152 | 9.01k | sel[new_size++] = idx; \ |
153 | 9.01k | } \ |
154 | 3.89M | } else { \ |
155 | 3.89M | if (EVALUATE_IMPL_WITHOUT_NULL_MAP(idx)) { \ |
156 | 3.68M | sel[new_size++] = idx; \ |
157 | 3.68M | } \ |
158 | 3.89M | } \ |
159 | 3.90M | } |
160 | | |
161 | | class ColumnPredicate { |
162 | | public: |
163 | | explicit ColumnPredicate(uint32_t column_id, bool opposite = false) |
164 | 756 | : _column_id(column_id), _opposite(opposite) { |
165 | 756 | reset_judge_selectivity(); |
166 | 756 | } |
167 | | |
168 | 756 | virtual ~ColumnPredicate() = default; |
169 | | |
170 | | virtual PredicateType type() const = 0; |
171 | | |
172 | | //evaluate predicate on Bitmap |
173 | | virtual Status evaluate(BitmapIndexIterator* iterator, uint32_t num_rows, |
174 | | roaring::Roaring* roaring) const = 0; |
175 | | |
176 | | //evaluate predicate on inverted |
177 | | virtual Status evaluate(const vectorized::IndexFieldNameAndTypePair& name_with_type, |
178 | | IndexIterator* iterator, uint32_t num_rows, |
179 | 0 | roaring::Roaring* bitmap) const { |
180 | 0 | return Status::NotSupported( |
181 | 0 | "Not Implemented evaluate with inverted index, please check the predicate"); |
182 | 0 | } |
183 | | |
184 | 0 | virtual double get_ignore_threshold() const { return 0; } |
185 | | |
186 | | // evaluate predicate on IColumn |
187 | | // a short circuit eval way |
188 | 4.20k | uint16_t evaluate(const vectorized::IColumn& column, uint16_t* sel, uint16_t size) const { |
189 | 4.20k | if (always_true()) { |
190 | 0 | return size; |
191 | 0 | } |
192 | | |
193 | 4.20k | uint16_t new_size = _evaluate_inner(column, sel, size); |
194 | 4.20k | if (_can_ignore()) { |
195 | 0 | do_judge_selectivity(size - new_size, size); |
196 | 0 | } |
197 | 4.20k | update_filter_info(size - new_size, size); |
198 | 4.20k | return new_size; |
199 | 4.20k | } |
200 | | virtual void evaluate_and(const vectorized::IColumn& column, const uint16_t* sel, uint16_t size, |
201 | 0 | bool* flags) const {} |
202 | | virtual void evaluate_or(const vectorized::IColumn& column, const uint16_t* sel, uint16_t size, |
203 | 0 | bool* flags) const {} |
204 | | |
205 | 0 | virtual bool support_zonemap() const { return true; } |
206 | | |
207 | 0 | virtual bool evaluate_and(const std::pair<WrapperField*, WrapperField*>& statistic) const { |
208 | 0 | return true; |
209 | 0 | } |
210 | | |
211 | 0 | virtual bool is_always_true(const std::pair<WrapperField*, WrapperField*>& statistic) const { |
212 | 0 | return false; |
213 | 0 | } |
214 | | |
215 | 0 | virtual bool evaluate_del(const std::pair<WrapperField*, WrapperField*>& statistic) const { |
216 | 0 | return false; |
217 | 0 | } |
218 | | |
219 | 0 | virtual bool evaluate_and(const BloomFilter* bf) const { return true; } |
220 | | |
221 | 0 | virtual bool evaluate_and(const StringRef* dict_words, const size_t dict_count) const { |
222 | 0 | return true; |
223 | 0 | } |
224 | | |
225 | 0 | virtual bool can_do_bloom_filter(bool ngram) const { return false; } |
226 | | |
227 | | /** |
228 | | * Figure out whether this page is matched partially or completely. |
229 | | */ |
230 | 0 | virtual bool evaluate_and(vectorized::ParquetPredicate::ColumnStat* statistic) const { |
231 | 0 | throw Exception(ErrorCode::INTERNAL_ERROR, |
232 | 0 | "ParquetPredicate is not supported by this predicate!"); |
233 | 0 | return true; |
234 | 0 | } |
235 | | |
236 | | // used to evaluate pre read column in lazy materialization |
237 | | // now only support integer/float |
238 | | // a vectorized eval way |
239 | 0 | virtual void evaluate_vec(const vectorized::IColumn& column, uint16_t size, bool* flags) const { |
240 | 0 | DCHECK(false) << "should not reach here"; |
241 | 0 | } |
242 | | virtual void evaluate_and_vec(const vectorized::IColumn& column, uint16_t size, |
243 | 0 | bool* flags) const { |
244 | 0 | DCHECK(false) << "should not reach here"; |
245 | 0 | } |
246 | | |
247 | 0 | virtual std::string get_search_str() const { |
248 | 0 | DCHECK(false) << "should not reach here"; |
249 | 0 | return ""; |
250 | 0 | } |
251 | | |
252 | 0 | virtual void set_page_ng_bf(std::unique_ptr<segment_v2::BloomFilter>) { |
253 | 0 | DCHECK(false) << "should not reach here"; |
254 | 0 | } |
255 | 15.1k | uint32_t column_id() const { return _column_id; } |
256 | | |
257 | 0 | bool opposite() const { return _opposite; } |
258 | | |
259 | 0 | std::string debug_string() const { |
260 | 0 | return _debug_string() + |
261 | 0 | fmt::format(", column_id={}, opposite={}, can_ignore={}, runtime_filter_id={}", |
262 | 0 | _column_id, _opposite, _can_ignore(), _runtime_filter_id); |
263 | 0 | } |
264 | | |
265 | 0 | int get_runtime_filter_id() const { return _runtime_filter_id; } |
266 | | |
267 | | void attach_profile_counter( |
268 | | int filter_id, std::shared_ptr<RuntimeProfile::Counter> predicate_filtered_rows_counter, |
269 | 0 | std::shared_ptr<RuntimeProfile::Counter> predicate_input_rows_counter) { |
270 | 0 | _runtime_filter_id = filter_id; |
271 | 0 | DCHECK(predicate_filtered_rows_counter != nullptr); |
272 | 0 | DCHECK(predicate_input_rows_counter != nullptr); |
273 | |
|
274 | 0 | if (predicate_filtered_rows_counter != nullptr) { |
275 | 0 | _predicate_filtered_rows_counter = predicate_filtered_rows_counter; |
276 | 0 | } |
277 | 0 | if (predicate_input_rows_counter != nullptr) { |
278 | 0 | _predicate_input_rows_counter = predicate_input_rows_counter; |
279 | 0 | } |
280 | 0 | } |
281 | | |
282 | | /// TODO: Currently we only record statistics for runtime filters, in the future we should record for all predicates |
283 | 4.20k | void update_filter_info(int64_t filter_rows, int64_t input_rows) const { |
284 | 4.20k | COUNTER_UPDATE(_predicate_input_rows_counter, input_rows); |
285 | 4.20k | COUNTER_UPDATE(_predicate_filtered_rows_counter, filter_rows); |
286 | 4.20k | } |
287 | | |
288 | 0 | static std::string pred_type_string(PredicateType type) { |
289 | 0 | switch (type) { |
290 | 0 | case PredicateType::EQ: |
291 | 0 | return "eq"; |
292 | 0 | case PredicateType::NE: |
293 | 0 | return "ne"; |
294 | 0 | case PredicateType::LT: |
295 | 0 | return "lt"; |
296 | 0 | case PredicateType::LE: |
297 | 0 | return "le"; |
298 | 0 | case PredicateType::GT: |
299 | 0 | return "gt"; |
300 | 0 | case PredicateType::GE: |
301 | 0 | return "ge"; |
302 | 0 | case PredicateType::IN_LIST: |
303 | 0 | return "in"; |
304 | 0 | case PredicateType::NOT_IN_LIST: |
305 | 0 | return "not_in"; |
306 | 0 | case PredicateType::IS_NULL: |
307 | 0 | return "is_null"; |
308 | 0 | case PredicateType::IS_NOT_NULL: |
309 | 0 | return "is_not_null"; |
310 | 0 | case PredicateType::BF: |
311 | 0 | return "bf"; |
312 | 0 | case PredicateType::MATCH: |
313 | 0 | return "match"; |
314 | 0 | default: |
315 | 0 | return "unknown"; |
316 | 0 | } |
317 | 0 | } |
318 | | |
319 | 4.20k | bool always_true() const { return _always_true; } |
320 | | // Return whether the ColumnPredicate was created by a runtime filter. |
321 | | // If true, it was definitely created by a runtime filter. |
322 | | // If false, it may still have been created by a runtime filter, |
323 | | // as certain filters like "in filter" generate key ranges instead of ColumnPredicate. |
324 | | // is_runtime_filter uses _can_ignore, except for BitmapFilter, |
325 | | // as BitmapFilter cannot ignore data. |
326 | 0 | virtual bool is_runtime_filter() const { return _can_ignore(); } |
327 | | |
328 | | protected: |
329 | | virtual std::string _debug_string() const = 0; |
330 | 4.20k | virtual bool _can_ignore() const { return _runtime_filter_id != -1; } |
331 | | virtual uint16_t _evaluate_inner(const vectorized::IColumn& column, uint16_t* sel, |
332 | 0 | uint16_t size) const { |
333 | 0 | throw Exception(INTERNAL_ERROR, "Not Implemented _evaluate_inner"); |
334 | 0 | } |
335 | | |
336 | 756 | void reset_judge_selectivity() const { |
337 | 756 | _always_true = false; |
338 | 756 | _judge_counter = config::runtime_filter_sampling_frequency; |
339 | 756 | _judge_input_rows = 0; |
340 | 756 | _judge_filter_rows = 0; |
341 | 756 | } |
342 | | |
343 | 0 | void do_judge_selectivity(uint64_t filter_rows, uint64_t input_rows) const { |
344 | 0 | if ((_judge_counter--) == 0) { |
345 | 0 | reset_judge_selectivity(); |
346 | 0 | } |
347 | 0 | if (!_always_true) { |
348 | 0 | _judge_filter_rows += filter_rows; |
349 | 0 | _judge_input_rows += input_rows; |
350 | 0 | vectorized::VRuntimeFilterWrapper::judge_selectivity( |
351 | 0 | get_ignore_threshold(), _judge_filter_rows, _judge_input_rows, _always_true); |
352 | 0 | } |
353 | 0 | } |
354 | | |
355 | | uint32_t _column_id; |
356 | | // TODO: the value is only in delete condition, better be template value |
357 | | bool _opposite; |
358 | | int _runtime_filter_id = -1; |
359 | | // VRuntimeFilterWrapper and ColumnPredicate share the same logic, |
360 | | // but it's challenging to unify them, so the code is duplicated. |
361 | | // _judge_counter, _judge_input_rows, _judge_filter_rows, and _always_true |
362 | | // are variables used to implement the _always_true logic, calculated periodically |
363 | | // based on runtime_filter_sampling_frequency. During each period, if _always_true |
364 | | // is evaluated as true, the logic for always_true is applied for the rest of that period |
365 | | // without recalculating. At the beginning of the next period, |
366 | | // reset_judge_selectivity is used to reset these variables. |
367 | | mutable int _judge_counter = 0; |
368 | | mutable uint64_t _judge_input_rows = 0; |
369 | | mutable uint64_t _judge_filter_rows = 0; |
370 | | mutable bool _always_true = false; |
371 | | |
372 | | std::shared_ptr<RuntimeProfile::Counter> _predicate_filtered_rows_counter = |
373 | | std::make_shared<RuntimeProfile::Counter>(TUnit::UNIT, 0); |
374 | | |
375 | | std::shared_ptr<RuntimeProfile::Counter> _predicate_input_rows_counter = |
376 | | std::make_shared<RuntimeProfile::Counter>(TUnit::UNIT, 0); |
377 | | }; |
378 | | |
379 | | } //namespace doris |