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
|
// heap_record_store_btree.h
/**
* 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.
*/
#pragma once
#include <boost/shared_array.hpp>
#include <map>
#include "mongo/db/storage/record_store.h"
#include "mongo/db/storage/recovery_unit.h"
namespace mongo {
/**
* A RecordStore that stores all data on the heap. This implementation contains only the
* functionality necessary to test btree.
*/
class HeapRecordStoreBtree : public RecordStore {
struct Record;
public:
// RecordId(0,0) isn't valid for records.
explicit HeapRecordStoreBtree(const StringData& ns): RecordStore(ns), _nextId(1) { }
virtual RecordData dataFor(OperationContext* txn, const RecordId& loc) const;
virtual bool findRecord(OperationContext* txn, const RecordId& loc, RecordData* out) const;
virtual void deleteRecord(OperationContext* txn, const RecordId& dl);
virtual StatusWith<RecordId> insertRecord(OperationContext* txn,
const char* data,
int len,
bool enforceQuota);
virtual StatusWith<RecordId> insertRecord(OperationContext* txn,
const DocWriter* doc,
bool enforceQuota);
virtual long long numRecords( OperationContext* txn ) const { return _records.size(); }
virtual Status touch(OperationContext* txn, BSONObjBuilder* output) const;
// public methods below here are not necessary to test btree, and will crash when called.
// ------------------------------
virtual StatusWith<RecordId> updateRecord(OperationContext* txn,
const RecordId& oldLocation,
const char* data,
int len,
bool enforceQuota,
UpdateNotifier* notifier) {
invariant(false);
}
virtual bool updateWithDamagesSupported() const {
return true;
}
virtual Status updateWithDamages(OperationContext* txn,
const RecordId& loc,
const RecordData& oldRec,
const char* damageSource,
const mutablebson::DamageVector& damages) {
invariant(false);
}
virtual RecordIterator* getIterator(OperationContext* txn,
const RecordId& start,
const CollectionScanParams::Direction& dir) const {
invariant(false);
}
virtual RecordIterator* getIteratorForRepair(OperationContext* txn) const {
invariant(false);
}
virtual std::vector<RecordIterator*> getManyIterators(OperationContext* txn) const {
invariant(false);
}
virtual Status truncate(OperationContext* txn) { invariant(false); }
virtual void temp_cappedTruncateAfter(OperationContext* txn,
RecordId end,
bool inclusive) {
invariant(false);
}
virtual bool compactSupported() const { invariant(false); }
virtual Status validate(OperationContext* txn,
bool full,
bool scanData,
ValidateAdaptor* adaptor,
ValidateResults* results, BSONObjBuilder* output) {
invariant(false);
}
virtual void appendCustomStats(OperationContext* txn,
BSONObjBuilder* result,
double scale) const {
invariant(false);
}
virtual Status setCustomOption(OperationContext* txn,
const BSONElement& option,
BSONObjBuilder* info = NULL) {
invariant(false);
}
virtual void increaseStorageSize(OperationContext* txn, int size, bool enforceQuota) {
invariant(false);
}
virtual int64_t storageSize(OperationContext* txn,
BSONObjBuilder* extraInfo = NULL,
int infoLevel = 0) const {
invariant(false);
}
virtual long long dataSize(OperationContext* txn) const { invariant(false); }
virtual Record* recordFor(const RecordId& loc) const { invariant(false); }
virtual bool isCapped() const { invariant(false); }
virtual const char* name() const { invariant(false); }
virtual void updateStatsAfterRepair(OperationContext* txn,
long long numRecords,
long long dataSize) {
invariant(false);
}
// more things that we actually care about below
private:
struct Record {
Record(): dataSize(-1), data() { }
explicit Record(int size): dataSize(size), data(new char[size]) { }
int dataSize;
boost::shared_array<char> data;
};
RecordId allocateLoc();
typedef std::map<RecordId, HeapRecordStoreBtree::Record> Records;
Records _records;
int64_t _nextId;
};
/**
* A RecoveryUnit for HeapRecordStoreBtree, this is for testing btree only.
*/
class HeapRecordStoreBtreeRecoveryUnit : public RecoveryUnit {
public:
HeapRecordStoreBtreeRecoveryUnit() {
_depth = 0;
}
virtual ~HeapRecordStoreBtreeRecoveryUnit();
virtual void beginUnitOfWork();
virtual void commitUnitOfWork();
virtual void endUnitOfWork();
virtual bool awaitCommit() { return true; }
virtual void commitAndRestart() {}
virtual void registerChange(Change* change) {
change->commit();
delete change;
}
virtual void* writingPtr(void* data, size_t len);
// -----------------------
void notifyInsert( HeapRecordStoreBtree* rs, const RecordId& loc );
static void notifyInsert( OperationContext* ctx,
HeapRecordStoreBtree* rs, const RecordId& loc );
private:
int _depth;
struct InsertEntry {
HeapRecordStoreBtree* rs;
RecordId loc;
};
std::vector<InsertEntry> _insertions;
struct ModEntry {
void* data;
size_t len;
boost::shared_array<char> old;
};
std::vector<ModEntry> _mods;
};
} // namespace mongo
|
