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
|
// matcher.h
/* JSMatcher is our boolean expression evaluator for "where" clauses */
/**
* Copyright (C) 2008 10gen Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* as published by the Free Software Foundation.
*
* 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
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#pragma once
#include "jsobj.h"
#include <pcrecpp.h>
namespace mongo {
class RegexMatcher {
public:
const char *fieldName;
pcrecpp::RE *re;
RegexMatcher() {
re = 0;
}
~RegexMatcher() {
delete re;
}
};
class BasicMatcher {
public:
BSONElement toMatch;
int compareOp;
};
// SQL where clause equivalent
class Where;
class DiskLoc;
/* Match BSON objects against a query pattern.
e.g.
db.foo.find( { a : 3 } );
{ a : 3 } is the pattern object.
GT/LT:
{ a : { $gt : 3 } }
Not equal:
{ a : { $ne : 3 } }
TODO: we should rewrite the matcher to be more an AST style.
*/
class JSMatcher : boost::noncopyable {
int matchesDotted(
const char *fieldName,
const BSONElement& toMatch, const BSONObj& obj,
int compareOp, bool *deep, bool isArr = false);
int matchesNe(
const char *fieldName,
const BSONElement &toMatch, const BSONObj &obj,
bool *deep);
struct element_lt
{
bool operator()(const BSONElement& l, const BSONElement& r) const
{
int x = (int) l.type() - (int) r.type();
if ( x < 0 ) return true;
if ( x > 0 ) return false;
return compareElementValues(l,r) < 0;
}
};
public:
static int opDirection(int op) {
return op <= BSONObj::LTE ? -1 : 1;
}
// Only specify constrainIndexKey if matches() will be called with
// index keys having empty string field names.
JSMatcher(const BSONObj &pattern, const BSONObj &constrainIndexKey = BSONObj());
~JSMatcher();
/* deep - means we looked into arrays for a match
*/
bool matches(const BSONObj& j, bool *deep = 0);
bool keyMatch() const { return !all && !haveSize; }
private:
void addBasic(const BSONElement &e, int c) {
// TODO May want to selectively ignore these element types based on op type.
if ( e.type() == MinKey || e.type() == MaxKey )
return;
BasicMatcher bm;
bm.toMatch = e;
bm.compareOp = c;
basics.push_back(bm);
}
int valuesMatch(const BSONElement& l, const BSONElement& r, int op, bool *deep=0);
set<BSONElement,element_lt> *in; // set if query uses $in
set<BSONElement,element_lt> *nin; // set if query uses $nin
set<BSONElement,element_lt> *all; // set if query uses $all
Where *where; // set if query uses $where
BSONObj jsobj; // the query pattern. e.g., { name: "joe" }
BSONObj constrainIndexKey_;
vector<BasicMatcher> basics;
// int n; // # of basicmatcher items
bool haveSize;
RegexMatcher regexs[4];
int nRegex;
// so we delete the mem when we're done:
vector< shared_ptr< BSONObjBuilder > > builders_;
};
// If match succeeds on index key, then attempt to match full record.
class KeyValJSMatcher : boost::noncopyable {
public:
KeyValJSMatcher(const BSONObj &pattern, const BSONObj &indexKeyPattern);
bool matches(const BSONObj &j, bool *deep = 0);
bool matches(const BSONObj &key, const DiskLoc &recLoc, bool *deep = 0);
private:
JSMatcher keyMatcher_;
JSMatcher recordMatcher_;
};
} // namespace mongo
|
