summaryrefslogtreecommitdiff
path: root/src/mongo/db/query/interval_evaluation_tree.cpp
blob: 804f6926d448e96770421c267e1c205d5e392a23 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
/**
 *    Copyright (C) 2022-present MongoDB, Inc.
 *
 *    This program is free software: you can redistribute it and/or modify
 *    it under the terms of the Server Side Public License, version 1,
 *    as published by MongoDB, Inc.
 *
 *    This program is distributed in the hope that it will be useful,
 *    but WITHOUT ANY WARRANTY; without even the implied warranty of
 *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *    Server Side Public License for more details.
 *
 *    You should have received a copy of the Server Side Public License
 *    along with this program. If not, see
 *    <http://www.mongodb.com/licensing/server-side-public-license>.
 *
 *    As a special exception, the copyright holders give permission to link the
 *    code of portions of this program with the OpenSSL library under certain
 *    conditions as described in each individual source file and distribute
 *    linked combinations including the program with the OpenSSL library. You
 *    must comply with the Server Side Public License in all respects for
 *    all of the code used other than as permitted herein. If you modify file(s)
 *    with this exception, you may extend this exception to your version of the
 *    file(s), but you are not obligated to do so. If you do not wish to do so,
 *    delete this exception statement from your version. If you delete this
 *    exception statement from all source files in the program, then also delete
 *    it in the license file.
 */

#include "mongo/db/query/interval_evaluation_tree.h"

#include "mongo/db/matcher/expression_internal_expr_comparison.h"
#include "mongo/db/query/index_bounds_builder.h"

namespace mongo {
namespace {
class IetPrinter {
public:
    static constexpr char kOpen = '(';
    static constexpr char kClose = ')';

    IetPrinter(std::ostream& os) : _os{os} {}

    void operator()(const IET&, const UnionInterval& node) {
        _os << kOpen << "union ";
        node.get<0>().visit(*this);
        _os << ' ';
        node.get<1>().visit(*this);
        _os << kClose;
    }

    void operator()(const IET&, const IntersectInterval& node) {
        _os << kOpen << "intersect ";
        node.get<0>().visit(*this);
        _os << ' ';
        node.get<1>().visit(*this);
        _os << kClose;
    }

    void operator()(const IET&, const ConstInterval& node) {
        _os << kOpen << "const";
        for (auto&& interval : node.intervals) {
            _os << ' ' << interval.toString(false);
        }
        _os << kClose;
    }

    void operator()(const IET&, const EvalInterval& node) {
        _os << kOpen << "eval " << matchTypeToString(node.matchType()) << " #"
            << node.inputParamId() << kClose;
    }

    void operator()(const IET&, const ComplementInterval& node) {
        _os << kOpen << "not ";
        node.get<0>().visit(*this);
        _os << kClose;
    }

private:
    static std::string matchTypeToString(const MatchExpression::MatchType& matchType) {
        switch (matchType) {
            case MatchExpression::EQ:
                return "$eq";
            case MatchExpression::LTE:
                return "$lte";
            case MatchExpression::LT:
                return "$lt";
            case MatchExpression::GTE:
                return "$gte";
            case MatchExpression::GT:
                return "$gt";
            case MatchExpression::MATCH_IN:
                return "$in";
            case MatchExpression::REGEX:
                return "$regex";
            default:
                tasserted(6334800, str::stream() << "unexpected MatchType" << matchType);
        }
    }

    std::ostream& _os;
};

template <typename T, typename... Args>
inline auto makeInterval(Args&&... args) {
    return IET::make<T>(std::forward<Args>(args)...);
}

template <typename T, typename = std::enable_if_t<std::is_convertible_v<T*, PathMatchExpression*>>>
auto extractInputParamId(const MatchExpression* expr) {
    return checked_cast<const T*>(expr)->getInputParamId();
}

}  // namespace

std::string ietToString(const IET& iet) {
    std::ostringstream oss;
    IetPrinter printer{oss};
    iet.visit(printer);
    return oss.str();
}

std::string ietsToString(const IndexEntry& index, const std::vector<IET>& iets) {
    tassert(6334801,
            "IET vector must have the same number of elements as the key pattern",
            index.keyPattern.nFields() == static_cast<int>(iets.size()));

    std::ostringstream oss;
    IetPrinter printer{oss};

    oss << IetPrinter::kOpen << "iets " << index.keyPattern;

    BSONObjIterator it(index.keyPattern);
    for (const auto& iet : iets) {
        oss << ' ' << IetPrinter::kOpen << it.next() << ' ';
        iet.visit(printer);
        oss << IetPrinter::kClose;
    }

    oss << IetPrinter::kClose;
    return oss.str();
}

void IETBuilder::intersectIntervals() {
    tassert(6334802, "Intersection requires two index intervals", _intervals.size() >= 2);
    auto rhs = std::move(_intervals.top());
    _intervals.pop();
    auto lhs = std::move(_intervals.top());
    _intervals.pop();
    _intervals.push(makeInterval<IntersectInterval>(std::move(lhs), std::move(rhs)));
}

void IETBuilder::unionIntervals() {
    tassert(6334803, "Union requires two index intervals", _intervals.size() >= 2);
    auto rhs = std::move(_intervals.top());
    _intervals.pop();
    auto lhs = std::move(_intervals.top());
    _intervals.pop();
    _intervals.push(makeInterval<UnionInterval>(std::move(lhs), std::move(rhs)));
}

void IETBuilder::complementInterval() {
    tassert(6334804, "Not requires at least one index interval", _intervals.size() >= 1);
    auto child = std::move(_intervals.top());
    _intervals.pop();
    _intervals.push(makeInterval<ComplementInterval>(std::move(child)));
}

void IETBuilder::translate(const MatchExpression& expr, const OrderedIntervalList& oil) {
    tassert(6334805, "OrderedIntervalList must be non empty", !oil.intervals.empty());

    auto [inputParamId, shouldAppendConstInterval] =
        [&expr]() -> std::pair<boost::optional<MatchExpression::InputParamId>, bool> {
        if (ComparisonMatchExpression::isComparisonMatchExpression(&expr)) {
            return {extractInputParamId<ComparisonMatchExpression>(&expr), true};
        }

        switch (expr.matchType()) {
            case MatchExpression::MATCH_IN:
                return {extractInputParamId<InMatchExpression>(&expr), true};
            case MatchExpression::EXISTS:
            case MatchExpression::MOD:
                return {boost::none, true};
            case MatchExpression::ELEM_MATCH_VALUE:
            case MatchExpression::NOT:
                return {boost::none, false};
            case MatchExpression::REGEX: {
                const auto* regexExpr = checked_cast<const RegexMatchExpression*>(&expr);
                const auto inputParamId = regexExpr->getSourceRegexInputParamId();
                tassert(6334810, "RegexMatchExpression must be parameterized", inputParamId);
                return {inputParamId, false};
            }
            default:
                tasserted(6334811,
                          str::stream()
                              << "Got unexpected expression to translate: " << expr.matchType());
        };
    }();

    if (inputParamId) {
        _intervals.push(makeInterval<EvalInterval>(*inputParamId, expr.matchType()));
    } else if (shouldAppendConstInterval) {
        _intervals.push(makeInterval<ConstInterval>(oil.intervals));
    }
}

void IETBuilder::appendIntervalList(const OrderedIntervalList& oil) {
    _intervals.push(makeInterval<ConstInterval>(oil.intervals));
}

boost::optional<IET> IETBuilder::done() const {
    if (_intervals.empty()) {
        return boost::none;
    }

    tassert(6334812, "All intervals should be merged into one", _intervals.size() == 1);
    return _intervals.top();
}
}  // namespace mongo