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
|
/**
* 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/>.
*
* 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/platform/basic.h"
#include "mongo/db/storage/mmap_v1/catalog/namespace_details.h"
#include <algorithm>
#include <list>
#include "mongo/base/counter.h"
#include "mongo/db/catalog/collection.h"
#include "mongo/db/catalog/collection_options.h"
#include "mongo/db/clientcursor.h"
#include "mongo/db/commands/server_status.h"
#include "mongo/db/concurrency/locker.h"
#include "mongo/db/db.h"
#include "mongo/db/index_legacy.h"
#include "mongo/db/json.h"
#include "mongo/db/ops/delete.h"
#include "mongo/db/ops/update.h"
#include "mongo/db/storage/mmap_v1/catalog/hashtab.h"
#include "mongo/db/storage/mmap_v1/catalog/namespace_index.h"
#include "mongo/db/operation_context.h"
#include "mongo/scripting/engine.h"
#include "mongo/util/startup_test.h"
namespace mongo {
BSONObj idKeyPattern = fromjson("{\"_id\":1}");
NamespaceDetails::NamespaceDetails( const DiskLoc &loc, bool capped ) {
BOOST_STATIC_ASSERT( sizeof(NamespaceDetails::Extra) <= sizeof(NamespaceDetails) );
/* be sure to initialize new fields here -- doesn't default to zeroes the way we use it */
firstExtent = lastExtent = capExtent = loc;
stats.datasize = stats.nrecords = 0;
lastExtentSize = 0;
nIndexes = 0;
isCapped = capped;
maxDocsInCapped = 0x7fffffff; // no limit (value is for pre-v2.3.2 compatibility)
paddingFactor = 1.0;
systemFlagsOldDoNotUse = 0;
userFlags = 0;
capFirstNewRecord = DiskLoc();
// Signal that we are on first allocation iteration through extents.
capFirstNewRecord.setInvalid();
// For capped case, signal that we are doing initial extent allocation.
if ( capped ) {
// WAS: cappedLastDelRecLastExtent().setInvalid();
deletedList[1].setInvalid();
}
verify( sizeof(_dataFileVersion) == 2 );
_dataFileVersion = 0;
_indexFileVersion = 0;
multiKeyIndexBits = 0;
_reservedA = 0;
_extraOffset = 0;
indexBuildsInProgress = 0;
memset(_reserved, 0, sizeof(_reserved));
}
NamespaceDetails::Extra* NamespaceDetails::allocExtra( OperationContext* txn,
const StringData& ns,
NamespaceIndex& ni,
int nindexessofar) {
txn->lockState()->assertWriteLocked(ns);
int i = (nindexessofar - NIndexesBase) / NIndexesExtra;
verify( i >= 0 && i <= 1 );
Namespace fullns( ns );
Namespace extrans( fullns.extraName(i) ); // throws UserException if ns name too long
massert( 10350, "allocExtra: base ns missing?", this );
massert( 10351, "allocExtra: extra already exists", ni.details(extrans) == 0 );
Extra temp;
temp.init();
ni.add_ns( txn, extrans, reinterpret_cast<NamespaceDetails*>( &temp ) );
Extra* e = reinterpret_cast<NamespaceDetails::Extra*>( ni.details( extrans ) );
long ofs = e->ofsFrom(this);
if( i == 0 ) {
verify( _extraOffset == 0 );
*txn->recoveryUnit()->writing(&_extraOffset) = ofs;
verify( extra() == e );
}
else {
Extra *hd = extra();
verify( hd->next(this) == 0 );
hd->setNext(txn, ofs);
}
return e;
}
IndexDetails& NamespaceDetails::idx(int idxNo, bool missingExpected) {
if( idxNo < NIndexesBase ) {
IndexDetails& id = _indexes[idxNo];
return id;
}
Extra *e = extra();
if ( ! e ) {
if ( missingExpected )
throw MsgAssertionException( 13283 , "Missing Extra" );
massert(14045, "missing Extra", e);
}
int i = idxNo - NIndexesBase;
if( i >= NIndexesExtra ) {
e = e->next(this);
if ( ! e ) {
if ( missingExpected )
throw MsgAssertionException( 14823 , "missing extra" );
massert(14824, "missing Extra", e);
}
i -= NIndexesExtra;
}
return e->details[i];
}
const IndexDetails& NamespaceDetails::idx(int idxNo, bool missingExpected) const {
if( idxNo < NIndexesBase ) {
const IndexDetails& id = _indexes[idxNo];
return id;
}
const Extra *e = extra();
if ( ! e ) {
if ( missingExpected )
throw MsgAssertionException( 17421 , "Missing Extra" );
massert(17422, "missing Extra", e);
}
int i = idxNo - NIndexesBase;
if( i >= NIndexesExtra ) {
e = e->next(this);
if ( ! e ) {
if ( missingExpected )
throw MsgAssertionException( 17423 , "missing extra" );
massert(17424, "missing Extra", e);
}
i -= NIndexesExtra;
}
return e->details[i];
}
NamespaceDetails::IndexIterator::IndexIterator(const NamespaceDetails *_d,
bool includeBackgroundInProgress) {
d = _d;
i = 0;
n = d->nIndexes;
if ( includeBackgroundInProgress )
n += d->indexBuildsInProgress;
}
// must be called when renaming a NS to fix up extra
void NamespaceDetails::copyingFrom( OperationContext* txn,
const StringData& thisns,
NamespaceIndex& ni,
NamespaceDetails* src) {
_extraOffset = 0; // we are a copy -- the old value is wrong. fixing it up below.
Extra *se = src->extra();
int n = NIndexesBase;
if( se ) {
Extra *e = allocExtra(txn, thisns, ni, n);
while( 1 ) {
n += NIndexesExtra;
e->copy(this, *se);
se = se->next(src);
if( se == 0 ) break;
Extra *nxt = allocExtra(txn, thisns, ni, n);
e->setNext( txn, nxt->ofsFrom(this) );
e = nxt;
}
verify( _extraOffset );
}
}
NamespaceDetails* NamespaceDetails::writingWithoutExtra( OperationContext* txn ) {
return txn->recoveryUnit()->writing( this );
}
// XXX - this method should go away
NamespaceDetails *NamespaceDetails::writingWithExtra( OperationContext* txn ) {
for( Extra *e = extra(); e; e = e->next( this ) ) {
txn->recoveryUnit()->writing( e );
}
return writingWithoutExtra( txn );
}
void NamespaceDetails::setMaxCappedDocs( OperationContext* txn, long long max ) {
massert( 16499,
"max in a capped collection has to be < 2^31 or -1",
CollectionOptions::validMaxCappedDocs( &max ) );
maxDocsInCapped = max;
}
/* ------------------------------------------------------------------------- */
int NamespaceDetails::_catalogFindIndexByName(OperationContext* txn,
const Collection* coll,
const StringData& name,
bool includeBackgroundInProgress) const {
IndexIterator i = ii(includeBackgroundInProgress);
while( i.more() ) {
const BSONObj obj = coll->docFor(txn, i.next().info);
if ( name == obj.getStringField("name") )
return i.pos()-1;
}
return -1;
}
void NamespaceDetails::Extra::setNext( OperationContext* txn,
long ofs ) {
*txn->recoveryUnit()->writing(&_next) = ofs;
}
} // namespace mongo
|
