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
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
|
/**
* Copyright (C) 2014 MongoDB 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/>.
*
* 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 GNU Affero General 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/storage/sorted_data_interface.h"
#include <boost/scoped_ptr.hpp>
#include "mongo/db/operation_context.h"
#include "mongo/db/storage/mmap_v1/btree/btree_logic.h"
namespace mongo {
using boost::scoped_ptr;
template <class OnDiskFormat>
class BtreeBuilderInterfaceImpl : public SortedDataBuilderInterface {
public:
BtreeBuilderInterfaceImpl(OperationContext* trans,
typename BtreeLogic<OnDiskFormat>::Builder* builder)
: _builder(builder), _trans(trans) { }
Status addKey(const BSONObj& key, const RecordId& loc) {
return _builder->addKey(key, DiskLoc::fromRecordId(loc));
}
private:
boost::scoped_ptr<typename BtreeLogic<OnDiskFormat>::Builder> _builder;
// Not owned here.
OperationContext* _trans;
};
template <class OnDiskFormat>
class BtreeInterfaceImpl : public SortedDataInterface {
public:
BtreeInterfaceImpl(HeadManager* headManager,
RecordStore* recordStore,
const Ordering& ordering,
const string& indexName,
BucketDeletionNotification* bucketDeletionNotification) {
_btree.reset(new BtreeLogic<OnDiskFormat>(headManager,
recordStore,
ordering,
indexName,
bucketDeletionNotification));
}
virtual ~BtreeInterfaceImpl() { }
virtual SortedDataBuilderInterface* getBulkBuilder(OperationContext* txn,
bool dupsAllowed) {
return new BtreeBuilderInterfaceImpl<OnDiskFormat>(
txn, _btree->newBuilder(txn, dupsAllowed));
}
virtual Status insert(OperationContext* txn,
const BSONObj& key,
const RecordId& loc,
bool dupsAllowed) {
return _btree->insert(txn, key, DiskLoc::fromRecordId(loc), dupsAllowed);
}
virtual void unindex(OperationContext* txn,
const BSONObj& key,
const RecordId& loc,
bool dupsAllowed) {
_btree->unindex(txn, key, DiskLoc::fromRecordId(loc));
}
virtual void fullValidate(OperationContext* txn, bool full, long long *numKeysOut,
BSONObjBuilder* output) const {
*numKeysOut = _btree->fullValidate(txn, NULL, false, false, 0);
}
virtual bool appendCustomStats(OperationContext* txn, BSONObjBuilder* output, double scale)
const {
return false;
}
virtual long long getSpaceUsedBytes( OperationContext* txn ) const {
return _btree->getRecordStore()->dataSize( txn );
}
virtual Status dupKeyCheck(OperationContext* txn,
const BSONObj& key,
const RecordId& loc) {
return _btree->dupKeyCheck(txn, key, DiskLoc::fromRecordId(loc));
}
virtual bool isEmpty(OperationContext* txn) {
return _btree->isEmpty(txn);
}
virtual Status touch(OperationContext* txn) const{
return _btree->touch(txn);
}
class Cursor : public SortedDataInterface::Cursor {
public:
Cursor(OperationContext* txn,
const BtreeLogic<OnDiskFormat>* btree,
int direction)
: _txn(txn),
_btree(btree),
_direction(direction),
_bucket(btree->getHead(txn)), // XXX this shouldn't be nessisary, but is.
_ofs(0) {
}
virtual int getDirection() const { return _direction; }
virtual bool isEOF() const { return _bucket.isNull(); }
virtual bool pointsToSamePlaceAs(const SortedDataInterface::Cursor& otherBase) const {
const Cursor& other = static_cast<const Cursor&>(otherBase);
if (isEOF())
return other.isEOF();
return _bucket == other._bucket && _ofs == other._ofs;
}
virtual void aboutToDeleteBucket(const RecordId& bucket) {
if (_bucket.toRecordId() == bucket)
_ofs = -1;
}
virtual bool locate(const BSONObj& key, const RecordId& loc) {
return _btree->locate(_txn, key, DiskLoc::fromRecordId(loc), _direction, &_ofs,
&_bucket);
}
virtual void customLocate(const BSONObj& keyBegin,
int keyBeginLen,
bool afterKey,
const vector<const BSONElement*>& keyEnd,
const vector<bool>& keyEndInclusive) {
_btree->customLocate(_txn,
&_bucket,
&_ofs,
keyBegin,
keyBeginLen,
afterKey,
keyEnd,
keyEndInclusive,
_direction);
}
void advanceTo(const BSONObj &keyBegin,
int keyBeginLen,
bool afterKey,
const vector<const BSONElement*>& keyEnd,
const vector<bool>& keyEndInclusive) {
_btree->advanceTo(_txn,
&_bucket,
&_ofs,
keyBegin,
keyBeginLen,
afterKey,
keyEnd,
keyEndInclusive,
_direction);
}
virtual BSONObj getKey() const {
return _btree->getKey(_txn, _bucket, _ofs);
}
DiskLoc getDiskLoc() const {
return _btree->getDiskLoc(_txn, _bucket, _ofs);
}
virtual RecordId getRecordId() const {
return getDiskLoc().toRecordId();
}
virtual void advance() {
if (!_bucket.isNull()) {
_btree->advance(_txn, &_bucket, &_ofs, _direction);
}
}
virtual void savePosition() {
if (!_bucket.isNull()) {
_savedKey = getKey().getOwned();
_savedLoc = getDiskLoc();
}
}
virtual void restorePosition(OperationContext* txn) {
if (!_bucket.isNull()) {
_btree->restorePosition(_txn,
_savedKey,
_savedLoc,
_direction,
&_bucket,
&_ofs);
}
}
private:
OperationContext* _txn; // not owned
const BtreeLogic<OnDiskFormat>* const _btree;
const int _direction;
DiskLoc _bucket;
int _ofs;
// Only used by save/restorePosition() if _bucket is non-Null.
BSONObj _savedKey;
DiskLoc _savedLoc;
};
virtual Cursor* newCursor(OperationContext* txn, int direction) const {
return new Cursor(txn, _btree.get(), direction);
}
virtual Status initAsEmpty(OperationContext* txn) {
return _btree->initAsEmpty(txn);
}
private:
scoped_ptr<BtreeLogic<OnDiskFormat> > _btree;
};
SortedDataInterface* getMMAPV1Interface(HeadManager* headManager,
RecordStore* recordStore,
const Ordering& ordering,
const string& indexName,
int version,
BucketDeletionNotification* bucketDeletion) {
if (0 == version) {
return new BtreeInterfaceImpl<BtreeLayoutV0>(headManager,
recordStore,
ordering,
indexName,
bucketDeletion);
}
else {
invariant(1 == version);
return new BtreeInterfaceImpl<BtreeLayoutV1>(headManager,
recordStore,
ordering,
indexName,
bucketDeletion);
}
}
} // namespace mongo
|
