2008-12-06 20:49:27 +01:00
|
|
|
// database.h
|
|
|
|
|
2008-12-02 20:24:45 +01:00
|
|
|
/**
|
|
|
|
* Copyright (C) 2008 10gen Inc.
|
2008-12-29 02:28:49 +01:00
|
|
|
*
|
2008-12-02 20:24:45 +01:00
|
|
|
* 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.
|
2008-12-29 02:28:49 +01:00
|
|
|
*
|
2008-12-02 20:24:45 +01:00
|
|
|
* 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.
|
2008-12-29 02:28:49 +01:00
|
|
|
*
|
2008-12-02 20:24:45 +01:00
|
|
|
* 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/>.
|
|
|
|
*/
|
|
|
|
|
2008-12-05 22:45:10 +01:00
|
|
|
#pragma once
|
|
|
|
|
2009-12-29 18:27:27 +01:00
|
|
|
#include "cmdline.h"
|
|
|
|
|
2009-01-14 23:09:51 +01:00
|
|
|
namespace mongo {
|
|
|
|
|
2010-01-19 19:03:23 +01:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Database represents a database database
|
|
|
|
* Each database database has its own set of files -- dbname.ns, dbname.0, dbname.1, ...
|
|
|
|
* NOT memory mapped
|
|
|
|
*/
|
2009-01-15 16:17:11 +01:00
|
|
|
class Database {
|
|
|
|
public:
|
2009-12-02 15:39:17 +01:00
|
|
|
static bool _openAllFiles;
|
2010-01-19 19:03:23 +01:00
|
|
|
|
|
|
|
Database(const char *nm, bool& newDb, const string& _path = dbpath)
|
|
|
|
: name(nm), path(_path), namespaceIndex( path, name ) {
|
|
|
|
|
|
|
|
{ // check db name is valid
|
2010-01-28 23:21:26 +01:00
|
|
|
size_t L = strlen(nm);
|
2009-12-28 22:43:43 +01:00
|
|
|
uassert( 10028 , "db name is empty", L > 0 );
|
|
|
|
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 );
|
|
|
|
uassert( 10032 , "db name too long", L < 64 );
|
2009-01-15 16:17:11 +01:00
|
|
|
}
|
2008-12-30 15:43:13 +01:00
|
|
|
|
2009-02-06 18:45:05 +01:00
|
|
|
newDb = namespaceIndex.exists();
|
2009-01-15 16:17:11 +01:00
|
|
|
profile = 0;
|
|
|
|
profileName = name + ".system.profile";
|
2009-12-02 15:39:17 +01:00
|
|
|
|
|
|
|
// If already exists, open. Otherwise behave as if empty until
|
|
|
|
// there's a write, then open.
|
2009-12-29 18:27:27 +01:00
|
|
|
if ( ! newDb || cmdLine.defaultProfile ) {
|
2009-12-02 15:39:17 +01:00
|
|
|
namespaceIndex.init();
|
|
|
|
if( _openAllFiles )
|
|
|
|
openAllFiles();
|
2009-12-29 18:27:27 +01:00
|
|
|
|
2009-12-02 15:39:17 +01:00
|
|
|
}
|
2009-12-29 18:27:27 +01:00
|
|
|
|
2010-01-19 19:03:23 +01:00
|
|
|
magic = 781231;
|
2008-12-29 02:28:49 +01:00
|
|
|
}
|
2010-01-19 19:03:23 +01:00
|
|
|
|
2009-01-15 16:17:11 +01:00
|
|
|
~Database() {
|
2010-01-19 19:03:23 +01:00
|
|
|
magic = 0;
|
2009-03-24 17:53:13 +01:00
|
|
|
btreeStore->closeFiles(name, path);
|
2010-01-28 23:21:26 +01:00
|
|
|
size_t n = files.size();
|
|
|
|
for ( size_t i = 0; i < n; i++ )
|
2009-01-15 16:17:11 +01:00
|
|
|
delete files[i];
|
2008-12-29 02:28:49 +01:00
|
|
|
}
|
2010-01-19 19:03:23 +01:00
|
|
|
|
|
|
|
/**
|
|
|
|
* tries to make sure that this hasn't been deleted
|
|
|
|
*/
|
|
|
|
bool isOk(){
|
|
|
|
return magic == 781231;
|
|
|
|
}
|
2009-01-15 16:17:11 +01:00
|
|
|
|
2010-01-14 19:17:32 +01:00
|
|
|
bool isEmpty(){
|
|
|
|
return ! namespaceIndex.allocated();
|
|
|
|
}
|
|
|
|
|
2010-01-26 23:40:06 +01:00
|
|
|
boost::filesystem::path fileName( int n ) {
|
2009-12-02 15:39:17 +01:00
|
|
|
stringstream ss;
|
|
|
|
ss << name << '.' << n;
|
|
|
|
boost::filesystem::path fullName;
|
2010-01-26 23:40:06 +01:00
|
|
|
fullName = boost::filesystem::path(path);
|
|
|
|
if ( directoryperdb )
|
|
|
|
fullName /= name;
|
|
|
|
fullName /= ss.str();
|
|
|
|
return fullName;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool exists(int n) {
|
|
|
|
return boost::filesystem::exists( fileName( n ) );
|
2009-12-02 15:39:17 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void openAllFiles() {
|
|
|
|
int n = 0;
|
|
|
|
while( exists(n) ) {
|
|
|
|
getFile(n);
|
|
|
|
n++;
|
|
|
|
}
|
2010-01-20 01:33:41 +01:00
|
|
|
// 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();
|
|
|
|
}
|
2009-12-02 15:39:17 +01:00
|
|
|
}
|
|
|
|
|
2009-04-15 22:10:21 +02:00
|
|
|
MongoDataFile* getFile( int n, int sizeNeeded = 0, bool preallocateOnly = false ) {
|
2009-01-15 16:17:11 +01:00
|
|
|
assert(this);
|
|
|
|
|
2009-02-06 18:45:05 +01:00
|
|
|
namespaceIndex.init();
|
2009-01-15 16:17:11 +01:00
|
|
|
if ( n < 0 || n >= DiskLoc::MaxFiles ) {
|
2009-01-15 17:26:38 +01:00
|
|
|
out() << "getFile(): n=" << n << endl;
|
2009-03-20 17:19:21 +01:00
|
|
|
#if !defined(_RECSTORE)
|
|
|
|
if( n >= RecCache::Base && n <= RecCache::Base+1000 )
|
2009-12-28 22:43:43 +01:00
|
|
|
massert( 10294 , "getFile(): bad file number - using recstore db w/nonrecstore db build?", false);
|
2009-03-20 17:19:21 +01:00
|
|
|
#endif
|
2009-12-28 22:43:43 +01:00
|
|
|
massert( 10295 , "getFile(): bad file number value (corrupt db?): run repair", false);
|
2008-12-29 02:28:49 +01:00
|
|
|
}
|
2009-01-15 16:17:11 +01:00
|
|
|
DEV {
|
|
|
|
if ( n > 100 )
|
2009-01-15 17:26:38 +01:00
|
|
|
out() << "getFile(): n=" << n << "?" << endl;
|
2009-01-15 16:17:11 +01:00
|
|
|
}
|
2009-04-15 22:10:21 +02:00
|
|
|
MongoDataFile* p = 0;
|
|
|
|
if ( !preallocateOnly ) {
|
|
|
|
while ( n >= (int) files.size() )
|
|
|
|
files.push_back(0);
|
|
|
|
p = files[n];
|
|
|
|
}
|
2009-01-15 16:17:11 +01:00
|
|
|
if ( p == 0 ) {
|
2010-01-26 23:40:06 +01:00
|
|
|
boost::filesystem::path fullName = fileName( n );
|
2009-01-15 16:17:11 +01:00
|
|
|
string fullNameString = fullName.string();
|
2009-01-31 23:27:25 +01:00
|
|
|
p = new MongoDataFile(n);
|
2009-01-15 16:17:11 +01:00
|
|
|
int minSize = 0;
|
|
|
|
if ( n != 0 && files[ n - 1 ] )
|
|
|
|
minSize = files[ n - 1 ]->getHeader()->fileLength;
|
2010-03-31 21:49:28 +02:00
|
|
|
if ( sizeNeeded + DataFileHeader::HeaderSize > minSize )
|
|
|
|
minSize = sizeNeeded + DataFileHeader::HeaderSize;
|
2009-01-15 16:17:11 +01:00
|
|
|
try {
|
2009-04-15 22:10:21 +02:00
|
|
|
p->open( fullNameString.c_str(), minSize, preallocateOnly );
|
2009-01-15 16:17:11 +01:00
|
|
|
}
|
2009-02-12 21:03:38 +01:00
|
|
|
catch ( AssertionException& ) {
|
2009-01-15 16:17:11 +01:00
|
|
|
delete p;
|
2009-02-12 21:03:38 +01:00
|
|
|
throw;
|
2009-01-15 16:17:11 +01:00
|
|
|
}
|
2009-04-15 22:10:21 +02:00
|
|
|
if ( preallocateOnly )
|
|
|
|
delete p;
|
|
|
|
else
|
|
|
|
files[n] = p;
|
2009-01-15 16:17:11 +01:00
|
|
|
}
|
2009-04-15 22:10:21 +02:00
|
|
|
return preallocateOnly ? 0 : p;
|
2009-01-15 16:17:11 +01:00
|
|
|
}
|
|
|
|
|
2009-04-15 22:10:21 +02:00
|
|
|
MongoDataFile* addAFile( int sizeNeeded = 0, bool preallocateNextFile = false ) {
|
2009-01-15 16:17:11 +01:00
|
|
|
int n = (int) files.size();
|
2009-04-15 22:10:21 +02:00
|
|
|
MongoDataFile *ret = getFile( n, sizeNeeded );
|
|
|
|
if ( preallocateNextFile )
|
2009-04-15 22:10:34 +02:00
|
|
|
preallocateAFile();
|
2009-04-15 22:10:21 +02:00
|
|
|
return ret;
|
2009-01-15 16:17:11 +01:00
|
|
|
}
|
2009-04-15 22:10:34 +02:00
|
|
|
|
2009-12-21 18:26:16 +01:00
|
|
|
// safe to call this multiple times - the implementation will only preallocate one file
|
2009-04-15 22:10:34 +02:00
|
|
|
void preallocateAFile() {
|
|
|
|
int n = (int) files.size();
|
2010-01-20 01:33:41 +01:00
|
|
|
getFile( n, 0, true );
|
2009-04-15 22:10:34 +02:00
|
|
|
}
|
2009-01-15 16:17:11 +01:00
|
|
|
|
2009-01-31 23:27:25 +01:00
|
|
|
MongoDataFile* suitableFile( int sizeNeeded ) {
|
|
|
|
MongoDataFile* f = newestFile();
|
2009-01-15 16:17:11 +01:00
|
|
|
for ( int i = 0; i < 8; i++ ) {
|
|
|
|
if ( f->getHeader()->unusedLength >= sizeNeeded )
|
|
|
|
break;
|
|
|
|
f = addAFile( sizeNeeded );
|
2009-01-31 23:27:25 +01:00
|
|
|
if ( f->getHeader()->fileLength >= MongoDataFile::maxSize() ) // this is as big as they get so might as well stop
|
2009-01-15 16:17:11 +01:00
|
|
|
break;
|
2008-12-27 18:07:20 +01:00
|
|
|
}
|
2009-01-15 16:17:11 +01:00
|
|
|
return f;
|
|
|
|
}
|
|
|
|
|
2009-12-18 23:43:40 +01:00
|
|
|
Extent* allocExtent( const char *ns, int size, bool capped ) {
|
|
|
|
Extent *e = DataFileMgr::allocFromFreeList( ns, size, capped );
|
|
|
|
if( e ) return e;
|
|
|
|
return suitableFile( size )->createExtent( ns, size, capped );
|
|
|
|
}
|
2009-12-29 18:08:13 +01:00
|
|
|
|
2009-01-31 23:27:25 +01:00
|
|
|
MongoDataFile* newestFile() {
|
2009-01-15 16:17:11 +01:00
|
|
|
int n = (int) files.size();
|
|
|
|
if ( n > 0 ) n--;
|
|
|
|
return getFile(n);
|
2008-12-29 02:28:49 +01:00
|
|
|
}
|
2009-12-29 17:49:24 +01:00
|
|
|
|
2009-12-29 18:08:13 +01:00
|
|
|
/**
|
|
|
|
* @return true if success, false otherwise
|
|
|
|
*/
|
|
|
|
bool setProfilingLevel( int newLevel , string& errmsg );
|
|
|
|
|
2009-12-29 18:27:27 +01:00
|
|
|
void finishInit();
|
2010-01-19 19:03:23 +01:00
|
|
|
|
2009-01-31 23:27:25 +01:00
|
|
|
vector<MongoDataFile*> files;
|
2009-01-15 16:17:11 +01:00
|
|
|
string name; // "alleyinsider"
|
|
|
|
string path;
|
|
|
|
NamespaceIndex namespaceIndex;
|
|
|
|
int profile; // 0=off.
|
|
|
|
string profileName; // "alleyinsider.system.profile"
|
2010-01-19 19:03:23 +01:00
|
|
|
int magic; // used for making sure the object is still loaded in memory
|
2009-01-15 16:17:11 +01:00
|
|
|
};
|
2008-12-02 20:24:45 +01:00
|
|
|
|
2009-01-14 23:09:51 +01:00
|
|
|
} // namespace mongo
|