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
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
|
// dbhelpers.cpp
/**
* 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 "stdafx.h"
#include "db.h"
#include "dbhelpers.h"
#include "query.h"
#include "json.h"
#include "queryoptimizer.h"
#include "btree.h"
#include "pdfile.h"
namespace mongo {
CursorIterator::CursorIterator( auto_ptr<Cursor> c , BSONObj filter )
: _cursor( c ){
if ( ! filter.isEmpty() )
_matcher.reset( new CoveredIndexMatcher( filter , BSONObj() ) );
_advance();
}
BSONObj CursorIterator::next(){
BSONObj o = _o;
_advance();
return o;
}
bool CursorIterator::hasNext(){
return ! _o.isEmpty();
}
void CursorIterator::_advance(){
if ( ! _cursor->ok() ){
_o = BSONObj();
return;
}
while ( _cursor->ok() ){
_o = _cursor->current();
_cursor->advance();
if ( _matcher.get() == 0 || _matcher->matches( _o ) )
return;
}
_o = BSONObj();
}
void Helpers::ensureIndex(const char *ns, BSONObj keyPattern, bool unique, const char *name) {
NamespaceDetails *d = nsdetails(ns);
if( d == 0 )
return;
{
NamespaceDetails::IndexIterator i = d->ii();
while( i.more() ) {
if( i.next().keyPattern().woCompare(keyPattern) == 0 )
return;
}
}
if( d->nIndexes >= NamespaceDetails::NIndexesMax ) {
problem() << "Helper::ensureIndex fails, MaxIndexes exceeded " << ns << '\n';
return;
}
string system_indexes = cc().database()->name + ".system.indexes";
BSONObjBuilder b;
b.append("name", name);
b.append("ns", ns);
b.append("key", keyPattern);
b.appendBool("unique", unique);
BSONObj o = b.done();
theDataFileMgr.insert(system_indexes.c_str(), o.objdata(), o.objsize());
}
class FindOne : public QueryOp {
public:
FindOne( bool requireIndex ) : requireIndex_( requireIndex ) {}
virtual void init() {
if ( requireIndex_ && strcmp( qp().indexKey().firstElement().fieldName(), "$natural" ) == 0 )
throw MsgAssertionException( 9011 , "Not an index cursor" );
c_ = qp().newCursor();
if ( !c_->ok() )
setComplete();
else
matcher_.reset( new CoveredIndexMatcher( qp().query(), qp().indexKey() ) );
}
virtual void next() {
if ( !c_->ok() ) {
setComplete();
return;
}
if ( matcher_->matches( c_->currKey(), c_->currLoc() ) ) {
one_ = c_->current();
setComplete();
} else {
c_->advance();
}
}
virtual bool mayRecordPlan() const { return false; }
virtual QueryOp *clone() const { return new FindOne( requireIndex_ ); }
BSONObj one() const { return one_; }
private:
bool requireIndex_;
auto_ptr< Cursor > c_;
auto_ptr< CoveredIndexMatcher > matcher_;
BSONObj one_;
};
/* fetch a single object from collection ns that matches query
set your db SavedContext first
*/
bool Helpers::findOne(const char *ns, BSONObj query, BSONObj& result, bool requireIndex) {
QueryPlanSet s( ns, query, BSONObj(), 0, !requireIndex );
FindOne original( requireIndex );
shared_ptr< FindOne > res = s.runOp( original );
massert( 10302 , res->exceptionMessage(), res->complete() );
if ( res->one().isEmpty() )
return false;
result = res->one();
return true;
}
auto_ptr<CursorIterator> Helpers::find( const char *ns , BSONObj query , bool requireIndex ){
uassert( 10047 , "requireIndex not supported in Helpers::find yet" , ! requireIndex );
auto_ptr<CursorIterator> i;
i.reset( new CursorIterator( DataFileMgr::findAll( ns ) , query ) );
return i;
}
bool Helpers::findById(Client& c, const char *ns, BSONObj query, BSONObj& result ,
bool * nsFound , bool * indexFound ){
Database *database = c.database();
assert( database );
NamespaceDetails *d = database->namespaceIndex.details(ns);
if ( ! d )
return false;
if ( nsFound )
*nsFound = 1;
int idxNo = d->findIdIndex();
if ( idxNo < 0 )
return false;
if ( indexFound )
*indexFound = 1;
IndexDetails& i = d->idx( idxNo );
BSONObj key = i.getKeyFromQuery( query );
DiskLoc loc = i.head.btree()->findSingle( i , i.head , key );
if ( loc.isNull() )
return false;
result = loc.obj();
return true;
}
/* Get the first object from a collection. Generally only useful if the collection
only ever has a single object -- which is a "singleton collection.
Returns: true if object exists.
*/
bool Helpers::getSingleton(const char *ns, BSONObj& result) {
Client::Context context(ns);
auto_ptr<Cursor> c = DataFileMgr::findAll(ns);
if ( !c->ok() )
return false;
result = c->current();
return true;
}
void Helpers::putSingleton(const char *ns, BSONObj obj) {
OpDebug debug;
Client::Context context(ns);
updateObjects(ns, obj, /*pattern=*/BSONObj(), /*upsert=*/true, /*multi=*/false , true , debug );
}
void Helpers::emptyCollection(const char *ns) {
Client::Context context(ns);
deleteObjects(ns, BSONObj(), false);
}
DbSet::~DbSet() {
if ( name_.empty() )
return;
try {
Client::Context c( name_.c_str() );
if ( nsdetails( name_.c_str() ) ) {
string errmsg;
BSONObjBuilder result;
dropCollection( name_, errmsg, result );
}
} catch ( ... ) {
problem() << "exception cleaning up DbSet" << endl;
}
}
void DbSet::reset( const string &name, const BSONObj &key ) {
if ( !name.empty() )
name_ = name;
if ( !key.isEmpty() )
key_ = key.getOwned();
Client::Context c( name_.c_str() );
if ( nsdetails( name_.c_str() ) ) {
Helpers::emptyCollection( name_.c_str() );
} else {
string err;
massert( 10303 , err, userCreateNS( name_.c_str(), fromjson( "{autoIndexId:false}" ), err, false ) );
}
Helpers::ensureIndex( name_.c_str(), key_, true, "setIdx" );
}
bool DbSet::get( const BSONObj &obj ) const {
Client::Context c( name_.c_str() );
BSONObj temp;
return Helpers::findOne( name_.c_str(), obj, temp, true );
}
void DbSet::set( const BSONObj &obj, bool val ) {
Client::Context c( name_.c_str() );
if ( val ) {
try {
BSONObj k = obj;
theDataFileMgr.insert( name_.c_str(), k, false );
} catch ( DBException& ) {
// dup key - already in set
}
} else {
deleteObjects( name_.c_str(), obj, true, false, false );
}
}
} // namespace mongo
|
