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
|
// matcher_covered.cpp
/* Matcher 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/>.
*/
#include "mongo/pch.h"
#include "mongo/db/cursor.h"
#include "mongo/db/matcher.h"
#include "mongo/db/matcher_covered.h"
#include "mongo/db/pdfile.h"
#include "mongo/db/queryutil.h"
namespace mongo {
CoveredIndexMatcher::CoveredIndexMatcher( const BSONObj &jsobj,
const BSONObj &indexKeyPattern ) :
_docMatcher( new Matcher( jsobj ) ),
_keyMatcher( *_docMatcher, indexKeyPattern ) {
init();
}
CoveredIndexMatcher::CoveredIndexMatcher( const CoveredIndexMatcher &prevClauseMatcher,
const shared_ptr<FieldRangeVector> &prevClauseFrv,
const BSONObj &nextClauseIndexKeyPattern ) :
_docMatcher( prevClauseMatcher._docMatcher ),
_keyMatcher( *_docMatcher, nextClauseIndexKeyPattern ),
_orDedupConstraints( prevClauseMatcher._orDedupConstraints ) {
if ( prevClauseFrv ) {
_orDedupConstraints.push_back( prevClauseFrv );
}
init();
}
void CoveredIndexMatcher::init() {
_needRecord =
!_keyMatcher.keyMatch( *_docMatcher ) ||
!_orDedupConstraints.empty();
}
bool CoveredIndexMatcher::matchesCurrent( Cursor * cursor , MatchDetails * details ) const {
// bool keyUsable = ! cursor->isMultiKey() && check for $orish like conditions in matcher SERVER-1264
bool keyUsable = true;
if ( cursor->indexKeyPattern().isEmpty() ) { // unindexed cursor
keyUsable = false;
}
else if ( cursor->isMultiKey() ) {
keyUsable =
_keyMatcher.singleSimpleCriterion() &&
( ! _docMatcher || _docMatcher->singleSimpleCriterion() );
}
return matches( cursor->currKey(),
cursor->currLoc(),
details,
keyUsable );
}
bool CoveredIndexMatcher::matches( const BSONObj& key, const DiskLoc& recLoc,
MatchDetails* details, bool keyUsable ) const {
LOG(5) << "CoveredIndexMatcher::matches() " << key.toString() << ' ' << recLoc.toString() << ' ' << keyUsable << endl;
dassert( key.isValid() );
if ( details )
details->resetOutput();
if ( keyUsable ) {
if ( !_keyMatcher.matches(key, details ) ) {
return false;
}
bool needRecordForDetails = details && details->needRecord();
if ( !_needRecord && !needRecordForDetails ) {
return true;
}
}
BSONObj obj = recLoc.obj();
bool res =
_docMatcher->matches( obj, details ) &&
!isOrClauseDup( obj );
if ( details )
details->setLoadedRecord( true );
LOG(5) << "CoveredIndexMatcher _docMatcher->matches() returns " << res << endl;
return res;
}
bool CoveredIndexMatcher::isOrClauseDup( const BSONObj &obj ) const {
for( vector<shared_ptr<FieldRangeVector> >::const_iterator i = _orDedupConstraints.begin();
i != _orDedupConstraints.end(); ++i ) {
if ( (*i)->matches( obj ) ) {
// If a document matches a prior $or clause index range, generally it would have
// been returned while scanning that range and so is reported as a dup.
return true;
}
}
return false;
}
string CoveredIndexMatcher::toString() const {
StringBuilder buf;
buf << "(CoveredIndexMatcher ";
if ( _needRecord )
buf << "needRecord ";
buf << "keyMatcher: " << _keyMatcher.toString() << " ";
if ( _docMatcher )
buf << "docMatcher: " << _docMatcher->toString() << " ";
buf << ")";
return buf.str();
}
}
|
