Coverage Report

Created: 2026-02-09 13:50

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/root/doris/be/src/runtime/runtime_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 <functional>
21
#include <memory>
22
#include <mutex>
23
#include <shared_mutex>
24
#include <string>
25
26
#include "common/status.h"
27
#include "exec/olap_common.h"
28
#include "olap/shared_predicate.h"
29
#include "olap/tablet_schema.h"
30
#include "runtime/define_primitive_type.h"
31
#include "runtime/primitive_type.h"
32
#include "util/binary_cast.hpp"
33
#include "vec/common/arena.h"
34
#include "vec/core/field.h"
35
#include "vec/core/types.h"
36
#include "vec/runtime/vdatetime_value.h"
37
38
namespace doris {
39
class ColumnPredicate;
40
41
namespace vectorized {
42
43
class RuntimePredicate {
44
public:
45
    RuntimePredicate(const TTopnFilterDesc& desc);
46
47
    Status init_target(int32_t target_node_id,
48
                       phmap::flat_hash_map<int, SlotDescriptor*> slot_id_to_slot_desc,
49
                       const int column_id);
50
51
0
    bool enable() const {
52
        // when sort node and scan node are not in the same fragment, predicate will be disabled
53
0
        std::shared_lock<std::shared_mutex> rlock(_rwlock);
54
0
        return _detected_source && _detected_target;
55
0
    }
56
57
0
    void set_detected_source() {
58
0
        std::unique_lock<std::shared_mutex> wlock(_rwlock);
59
0
        _detected_source = true;
60
0
    }
61
62
0
    std::shared_ptr<ColumnPredicate> get_predicate(int32_t target_node_id) {
63
0
        std::shared_lock<std::shared_mutex> rlock(_rwlock);
64
0
        check_target_node_id(target_node_id);
65
0
        return _contexts.find(target_node_id)->second.predicate;
66
0
    }
67
68
    Status update(const Field& value);
69
70
0
    bool has_value() const {
71
0
        std::shared_lock<std::shared_mutex> rlock(_rwlock);
72
0
        return _has_value;
73
0
    }
74
75
0
    Field get_value() const {
76
0
        std::shared_lock<std::shared_mutex> rlock(_rwlock);
77
0
        return _orderby_extrem;
78
0
    }
79
80
0
    std::string get_col_name(int32_t target_node_id) const {
81
0
        check_target_node_id(target_node_id);
82
0
        return _contexts.find(target_node_id)->second.col_name;
83
0
    }
84
85
0
    bool is_asc() const { return _is_asc; }
86
87
0
    bool nulls_first() const { return _nulls_first; }
88
89
0
    bool target_is_slot(int32_t target_node_id) const {
90
0
        check_target_node_id(target_node_id);
91
0
        return _contexts.find(target_node_id)->second.target_is_slot();
92
0
    }
93
94
0
    const TExpr& get_texpr(int32_t target_node_id) const {
95
0
        check_target_node_id(target_node_id);
96
0
        return _contexts.find(target_node_id)->second.expr;
97
0
    }
98
99
private:
100
0
    void check_target_node_id(int32_t target_node_id) const {
101
0
        if (!_contexts.contains(target_node_id)) {
102
0
            std::string msg = "context target node ids: [";
103
0
            bool first = true;
104
0
            for (auto p : _contexts) {
105
0
                if (first) {
106
0
                    first = false;
107
0
                } else {
108
0
                    msg += ',';
109
0
                }
110
0
                msg += std::to_string(p.first);
111
0
            }
112
0
            msg += "], input target node is: " + std::to_string(target_node_id);
113
0
            DCHECK(false) << msg;
114
0
        }
115
0
    }
116
    struct TargetContext {
117
        TExpr expr;
118
        std::string col_name;
119
        vectorized::DataTypePtr col_data_type;
120
        std::shared_ptr<ColumnPredicate> predicate;
121
122
0
        bool target_is_slot() const {
123
0
            return expr.nodes[0].node_type == TExprNodeType::SLOT_REF &&
124
0
                   expr.nodes[0].slot_ref.is_virtual_slot == false;
125
0
        }
126
    };
127
128
    bool _init(PrimitiveType type);
129
130
    mutable std::shared_mutex _rwlock;
131
132
    bool _nulls_first;
133
    bool _is_asc;
134
    std::map<int32_t, TargetContext> _contexts;
135
136
    Field _orderby_extrem {PrimitiveType::TYPE_NULL};
137
    std::function<std::shared_ptr<ColumnPredicate>(const int cid, const std::string& col_name,
138
                                                   const vectorized::DataTypePtr& data_type,
139
                                                   const vectorized::Field& value, bool opposite)>
140
            _pred_constructor;
141
    bool _detected_source = false;
142
    bool _detected_target = false;
143
    bool _has_value = false;
144
    PrimitiveType _type;
145
};
146
147
} // namespace vectorized
148
} // namespace doris