0
0
mirror of https://github.com/mongodb/mongo.git synced 2024-12-01 01:21:03 +01:00
mongodb/db/database.h

174 lines
5.7 KiB
C
Raw Normal View History

// database.h
/**
* Copyright (C) 2008 10gen Inc.
2008-12-29 02:28:49 +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
*
* 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
*
* 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
2008-12-29 02:28:49 +01:00
/* Database represents a database database
Each database database has its own set of files -- dbname.ns, dbname.0, dbname.1, ...
*/
2009-01-14 23:09:51 +01:00
namespace mongo {
class Database {
public:
static bool _openAllFiles;
2009-08-11 20:29:03 +02:00
Database(const char *nm, bool& newDb, const string& _path = dbpath) :
2009-02-06 18:45:05 +01:00
name(nm),
path(_path),
namespaceIndex( path, name )
{
{
int L = strlen(nm);
uassert( "db name is empty", L > 0 );
uassert( "bad db name [1]", *nm != '.' );
uassert( "bad db name [2]", nm[L-1] != '.' );
uassert( "bad char(s) in db name", strchr(nm, ' ') == 0 );
uassert( "db name too long", L < 64 );
}
2009-02-06 18:45:05 +01:00
newDb = namespaceIndex.exists();
profile = 0;
profileName = name + ".system.profile";
// If already exists, open. Otherwise behave as if empty until
// there's a write, then open.
if ( !newDb ) {
namespaceIndex.init();
if( _openAllFiles )
openAllFiles();
}
2008-12-29 02:28:49 +01:00
}
~Database() {
2009-03-24 17:53:13 +01:00
btreeStore->closeFiles(name, path);
int n = files.size();
for ( int i = 0; i < n; i++ )
delete files[i];
2008-12-29 02:28:49 +01:00
}
bool exists(int n) {
stringstream ss;
ss << name << '.' << n;
boost::filesystem::path fullName;
fullName = boost::filesystem::path(path) / ss.str();
return boost::filesystem::exists(fullName);
}
void openAllFiles() {
int n = 0;
while( exists(n) ) {
getFile(n);
n++;
}
}
MongoDataFile* getFile( int n, int sizeNeeded = 0, bool preallocateOnly = false ) {
assert(this);
2009-02-06 18:45:05 +01:00
namespaceIndex.init();
if ( n < 0 || n >= DiskLoc::MaxFiles ) {
out() << "getFile(): n=" << n << endl;
2009-03-20 17:19:21 +01:00
#if !defined(_RECSTORE)
if( n >= RecCache::Base && n <= RecCache::Base+1000 )
massert("getFile(): bad file number - using recstore db w/nonrecstore db build?", false);
#endif
2009-09-24 23:10:45 +02:00
massert("getFile(): bad file number value (corrupt db?): run repair", false);
2008-12-29 02:28:49 +01:00
}
DEV {
if ( n > 100 )
out() << "getFile(): n=" << n << "?" << endl;
}
MongoDataFile* p = 0;
if ( !preallocateOnly ) {
while ( n >= (int) files.size() )
files.push_back(0);
p = files[n];
}
if ( p == 0 ) {
stringstream ss;
ss << name << '.' << n;
boost::filesystem::path fullName;
fullName = boost::filesystem::path(path) / ss.str();
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 + MDFHeader::headerSize() > minSize )
minSize = sizeNeeded + MDFHeader::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* addAFile( int sizeNeeded = 0, bool preallocateNextFile = false ) {
int n = (int) files.size();
MongoDataFile *ret = getFile( n, sizeNeeded );
if ( preallocateNextFile )
preallocateAFile();
return ret;
}
// ok to call multiple times
void preallocateAFile() {
int n = (int) files.size();
getFile( n, 0, true );
}
MongoDataFile* suitableFile( int sizeNeeded ) {
MongoDataFile* f = newestFile();
for ( int i = 0; i < 8; i++ ) {
if ( f->getHeader()->unusedLength >= sizeNeeded )
break;
f = addAFile( sizeNeeded );
if ( f->getHeader()->fileLength >= MongoDataFile::maxSize() ) // this is as big as they get so might as well stop
break;
2008-12-27 18:07:20 +01:00
}
return f;
}
MongoDataFile* newestFile() {
int n = (int) files.size();
if ( n > 0 ) n--;
return getFile(n);
2008-12-29 02:28:49 +01:00
}
//void finishInit(); // ugly...
vector<MongoDataFile*> files;
string name; // "alleyinsider"
string path;
NamespaceIndex namespaceIndex;
int profile; // 0=off.
string profileName; // "alleyinsider.system.profile"
};
2009-01-14 23:09:51 +01:00
} // namespace mongo