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
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
|
// database.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 "pch.h"
#include "pdfile.h"
#include "database.h"
#include "instance.h"
#include "clientcursor.h"
#include "databaseholder.h"
#include <boost/filesystem/operations.hpp>
namespace mongo {
bool Database::_openAllFiles = true;
void assertDbAtLeastReadLocked(const Database *db) {
if( db ) {
Lock::assertAtLeastReadLocked(db->name);
}
else {
verify( Lock::isLocked() );
}
}
void assertDbWriteLocked(const Database *db) {
if( db ) {
Lock::assertWriteLocked(db->name);
}
else {
d.dbMutex.assertWriteLocked();
}
}
Database::~Database() {
d.dbMutex.assertWriteLocked();
magic = 0;
size_t n = _files.size();
for ( size_t i = 0; i < n; i++ )
delete _files[i];
if( ccByLoc.size() ) {
log() << "\n\n\nWARNING: ccByLoc not empty on database close! " << ccByLoc.size() << ' ' << name << endl;
}
}
Database::Database(const char *nm, bool& newDb, const string& _path )
: name(nm), path(_path), namespaceIndex( path, name ),
profileName(name + ".system.profile")
{
try {
{
// check db name is valid
size_t L = strlen(nm);
uassert( 10028 , "db name is empty", L > 0 );
uassert( 10032 , "db name too long", L < 64 );
uassert( 10029 , "bad db name [1]", *nm != '.' );
uassert( 10030 , "bad db name [2]", nm[L-1] != '.' );
uassert( 10031 , "bad char(s) in db name", strchr(nm, ' ') == 0 );
}
newDb = namespaceIndex.exists();
profile = cmdLine.defaultProfile;
checkDuplicateUncasedNames(true);
// If already exists, open. Otherwise behave as if empty until
// there's a write, then open.
if ( ! newDb || cmdLine.defaultProfile ) {
namespaceIndex.init();
if( _openAllFiles )
openAllFiles();
}
magic = 781231;
} catch(std::exception& e) {
log() << "warning database " << path << ' ' << nm << " could not be opened" << endl;
log() << e.what() << endl;
// since destructor won't be called:
for ( size_t i = 0; i < _files.size(); i++ )
delete _files[i];
throw;
}
}
void Database::checkDuplicateUncasedNames(bool inholderlock) const {
string duplicate = duplicateUncasedName(inholderlock, name, path );
if ( !duplicate.empty() ) {
stringstream ss;
ss << "db already exists with different case other: [" << duplicate << "] me [" << name << "]";
uasserted( DatabaseDifferCaseCode , ss.str() );
}
}
/*static*/
string Database::duplicateUncasedName( bool inholderlock, const string &name, const string &path, set< string > *duplicates ) {
Lock::assertAtLeastReadLocked(name);
if ( duplicates ) {
duplicates->clear();
}
vector<string> others;
getDatabaseNames( others , path );
set<string> allShortNames;
dbHolder().getAllShortNames( inholderlock, allShortNames );
others.insert( others.end(), allShortNames.begin(), allShortNames.end() );
for ( unsigned i=0; i<others.size(); i++ ) {
if ( strcasecmp( others[i].c_str() , name.c_str() ) )
continue;
if ( strcmp( others[i].c_str() , name.c_str() ) == 0 )
continue;
if ( duplicates ) {
duplicates->insert( others[i] );
} else {
return others[i];
}
}
if ( duplicates ) {
return duplicates->empty() ? "" : *duplicates->begin();
}
return "";
}
boost::filesystem::path Database::fileName( int n ) const {
stringstream ss;
ss << name << '.' << n;
boost::filesystem::path fullName;
fullName = boost::filesystem::path(path);
if ( directoryperdb )
fullName /= name;
fullName /= ss.str();
return fullName;
}
bool Database::openExistingFile( int n ) {
verify(this);
Lock::assertWriteLocked(name);
{
// must not yet be visible to others as we aren't in the db's write lock and
// we will write to _files vector - thus this assert.
bool loaded = dbHolder().__isLoaded(name, path);
verify( !loaded );
}
// additionally must be in the dbholder mutex (no assert for that yet)
// todo: why here? that could be bad as we may be read locked only here
namespaceIndex.init();
if ( n < 0 || n >= DiskLoc::MaxFiles ) {
massert( 15924 , str::stream() << "getFile(): bad file number value " << n << " (corrupt db?): run repair", false);
}
{
if( n < (int) _files.size() && _files[n] ) {
dlog(2) << "openExistingFile " << n << " is already open" << endl;
return true;
}
}
{
boost::filesystem::path fullName = fileName( n );
string fullNameString = fullName.string();
MongoDataFile *df = new MongoDataFile(n);
try {
if( !df->openExisting( fullNameString.c_str() ) ) {
delete df;
return false;
}
}
catch ( AssertionException& ) {
delete df;
throw;
}
while ( n >= (int) _files.size() ) {
_files.push_back(0);
}
_files[n] = df;
}
return true;
}
// todo : we stop once a datafile dne.
// if one datafile were missing we should keep going for
// repair purposes yet we do not.
void Database::openAllFiles() {
//log() << "TEMP openallfiles " << path << ' ' << name << endl;
verify(this);
int n = 0;
while( openExistingFile(n) ) {
n++;
}
/*
int n = 0;
while( exists(n) ) {
getFile(n);
n++;
}
// If last file is empty, consider it preallocated and make sure it's not mapped
// until a write is requested
if ( n > 1 && getFile( n - 1 )->getHeader()->isEmpty() ) {
delete _files[ n - 1 ];
_files.pop_back();
}*/
}
// todo: this is called a lot. streamline the common case
MongoDataFile* Database::getFile( int n, int sizeNeeded , bool preallocateOnly) {
verify(this);
DEV assertDbAtLeastReadLocked(this);
namespaceIndex.init();
if ( n < 0 || n >= DiskLoc::MaxFiles ) {
out() << "getFile(): n=" << n << endl;
massert( 10295 , "getFile(): bad file number value (corrupt db?): run repair", false);
}
DEV {
if ( n > 100 ) {
out() << "getFile(): n=" << n << endl;
}
}
MongoDataFile* p = 0;
if ( !preallocateOnly ) {
while ( n >= (int) _files.size() ) {
verify(this);
if( !Lock::isWriteLocked(this->name) ) {
log() << "error: getFile() called in a read lock, yet file to return is not yet open" << endl;
log() << " getFile(" << n << ") _files.size:" <<_files.size() << ' ' << fileName(n).string() << endl;
log() << " context ns: " << cc().ns() << " openallfiles:" << _openAllFiles << endl;
verify(false);
}
_files.push_back(0);
}
p = _files[n];
}
if ( p == 0 ) {
assertDbWriteLocked(this);
boost::filesystem::path fullName = fileName( n );
string fullNameString = fullName.string();
p = new MongoDataFile(n);
int minSize = 0;
if ( n != 0 && _files[ n - 1 ] )
minSize = _files[ n - 1 ]->getHeader()->fileLength;
if ( sizeNeeded + DataFileHeader::HeaderSize > minSize )
minSize = sizeNeeded + DataFileHeader::HeaderSize;
try {
p->open( fullNameString.c_str(), minSize, preallocateOnly );
}
catch ( AssertionException& ) {
delete p;
throw;
}
if ( preallocateOnly )
delete p;
else
_files[n] = p;
}
return preallocateOnly ? 0 : p;
}
MongoDataFile* Database::addAFile( int sizeNeeded, bool preallocateNextFile ) {
assertDbWriteLocked(this);
int n = (int) _files.size();
MongoDataFile *ret = getFile( n, sizeNeeded );
if ( preallocateNextFile )
preallocateAFile();
return ret;
}
bool fileIndexExceedsQuota( const char *ns, int fileIndex, bool enforceQuota ) {
return
cmdLine.quota &&
enforceQuota &&
fileIndex >= cmdLine.quotaFiles &&
// we don't enforce the quota on "special" namespaces as that could lead to problems -- e.g.
// rejecting an index insert after inserting the main record.
!NamespaceString::special( ns ) &&
NamespaceString( ns ).db != "local";
}
MongoDataFile* Database::suitableFile( const char *ns, int sizeNeeded, bool preallocate, bool enforceQuota ) {
// check existing files
for ( int i=numFiles()-1; i>=0; i-- ) {
MongoDataFile* f = getFile( i );
if ( f->getHeader()->unusedLength >= sizeNeeded ) {
if ( fileIndexExceedsQuota( ns, i-1, enforceQuota ) ) // NOTE i-1 is the value used historically for this check.
;
else
return f;
}
}
if ( fileIndexExceedsQuota( ns, numFiles(), enforceQuota ) ) {
if ( cc().hasWrittenThisPass() ) {
warning() << "quota exceeded, but can't assert, probably going over quota for: " << ns << endl;
}
else {
uasserted(12501, "quota exceeded");
}
}
// allocate files until we either get one big enough or hit maxSize
for ( int i = 0; i < 8; i++ ) {
MongoDataFile* f = addAFile( sizeNeeded, preallocate );
if ( f->getHeader()->unusedLength >= sizeNeeded )
return f;
if ( f->getHeader()->fileLength >= MongoDataFile::maxSize() ) // this is as big as they get so might as well stop
return f;
}
uasserted(14810, "couldn't allocate space (suitableFile)"); // callers don't check for null return code
return 0;
}
MongoDataFile* Database::newestFile() {
int n = numFiles();
if ( n == 0 )
return 0;
return getFile(n-1);
}
Extent* Database::allocExtent( const char *ns, int size, bool capped, bool enforceQuota ) {
// todo: when profiling, these may be worth logging into profile collection
bool fromFreeList = true;
Extent *e = DataFileMgr::allocFromFreeList( ns, size, capped );
if( e == 0 ) {
fromFreeList = false;
e = suitableFile( ns, size, !capped, enforceQuota )->createExtent( ns, size, capped );
}
LOG(1) << "allocExtent " << ns << " size " << size << ' ' << fromFreeList << endl;
return e;
}
bool Database::setProfilingLevel( int newLevel , string& errmsg ) {
if ( profile == newLevel )
return true;
if ( newLevel < 0 || newLevel > 2 ) {
errmsg = "profiling level has to be >=0 and <= 2";
return false;
}
if ( newLevel == 0 ) {
profile = 0;
return true;
}
verify( cc().database() == this );
if ( ! namespaceIndex.details( profileName.c_str() ) ) {
log() << "creating profile collection: " << profileName << endl;
BSONObjBuilder spec;
spec.appendBool( "capped", true );
spec.append( "size", 1024*1024 );
if ( ! userCreateNS( profileName.c_str(), spec.done(), errmsg , false /* we don't replica profile messages */ ) ) {
return false;
}
}
profile = newLevel;
return true;
}
bool Database::exists(int n) const {
return boost::filesystem::exists( fileName( n ) );
}
int Database::numFiles() const {
DEV assertDbAtLeastReadLocked(this);
return (int) _files.size();
}
void Database::flushFiles( bool sync ) {
assertDbAtLeastReadLocked(this);
for( vector<MongoDataFile*>::iterator i = _files.begin(); i != _files.end(); i++ ) {
MongoDataFile *f = *i;
f->flush(sync);
}
}
long long Database::fileSize() const {
long long size=0;
for (int n=0; exists(n); n++)
size += boost::filesystem::file_size( fileName(n) );
return size;
}
Database* DatabaseHolder::getOrCreate( const string& ns , const string& path , bool& justCreated ) {
string dbname = _todb( ns );
{
SimpleMutex::scoped_lock lk(_m);
Lock::assertAtLeastReadLocked(ns);
DBs& m = _paths[path];
{
DBs::iterator i = m.find(dbname);
if( i != m.end() ) {
justCreated = false;
return i->second;
}
}
// todo: protect against getting sprayed with requests for different db names that DNE -
// that would make the DBs map very large. not clear what to do to handle though,
// perhaps just log it, which is what we do here with the "> 40" :
bool cant = !Lock::isWriteLocked(ns);
if( logLevel >= 1 || m.size() > 40 || cant || DEBUG_BUILD ) {
log() << "opening db: " << (path==dbpath?"":path) << ' ' << dbname << endl;
}
massert(15927, "can't open database in a read lock. if db was just closed, consider retrying the query. might otherwise indicate an internal error", !cant);
}
// this locks _m for defensive checks, so we don't want to be locked right here :
Database *db = new Database( dbname.c_str() , justCreated , path );
{
SimpleMutex::scoped_lock lk(_m);
DBs& m = _paths[path];
verify( m[dbname] == 0 );
m[dbname] = db;
_size++;
}
return db;
}
} // namespace mongo
|