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
|
// database.h
/**
* 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/>.
*/
#pragma once
/* Database represents a database database
Each database database has its own set of files -- dbname.ns, dbname.0, dbname.1, ...
*/
namespace mongo {
class Database {
public:
Database(const char *nm, bool& justCreated, const char *_path = dbpath) :
name(nm),
path(_path)
{
{
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 );
}
justCreated = namespaceIndex.init(_path, nm);
profile = 0;
profileName = name + ".system.profile";
}
~Database() {
int n = files.size();
for ( int i = 0; i < n; i++ )
delete files[i];
}
PhysicalDataFile* getFile( int n, int sizeNeeded = 0 ) {
assert(this);
if ( n < 0 || n >= DiskLoc::MaxFiles ) {
out() << "getFile(): n=" << n << endl;
assert( n >= 0 && n < DiskLoc::MaxFiles );
}
DEV {
if ( n > 100 )
out() << "getFile(): n=" << n << "?" << endl;
}
while ( n >= (int) files.size() )
files.push_back(0);
PhysicalDataFile* 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 PhysicalDataFile(n);
int minSize = 0;
if ( n != 0 && files[ n - 1 ] )
minSize = files[ n - 1 ]->getHeader()->fileLength;
if ( sizeNeeded + PDFHeader::headerSize() > minSize )
minSize = sizeNeeded + PDFHeader::headerSize();
try {
p->open( fullNameString.c_str(), minSize );
}
catch ( AssertionException& u ) {
delete p;
throw u;
}
files[n] = p;
}
return p;
}
PhysicalDataFile* addAFile( int sizeNeeded = 0 ) {
int n = (int) files.size();
return getFile( n, sizeNeeded );
}
PhysicalDataFile* suitableFile( int sizeNeeded ) {
PhysicalDataFile* f = newestFile();
for ( int i = 0; i < 8; i++ ) {
if ( f->getHeader()->unusedLength >= sizeNeeded )
break;
f = addAFile( sizeNeeded );
if ( f->getHeader()->fileLength >= PhysicalDataFile::maxSize() ) // this is as big as they get so might as well stop
break;
}
return f;
}
PhysicalDataFile* newestFile() {
int n = (int) files.size();
if ( n > 0 ) n--;
return getFile(n);
}
void finishInit(); // ugly...
vector<PhysicalDataFile*> files;
string name; // "alleyinsider"
string path;
NamespaceIndex namespaceIndex;
int profile; // 0=off.
string profileName; // "alleyinsider.system.profile"
QueryOptimizer optimizer;
bool haveLogged() {
return _haveLogged;
}
void setHaveLogged();
private:
// see dbinfo.h description. if true, we have logged to the replication log.
bool _haveLogged;
};
extern Database *database;
} // namespace mongo
|
