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
|
/**
* Copyright (C) 2009 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 "../stdafx.h"
#include <fcntl.h>
#include <errno.h>
#if defined(__freebsd__)
#include <sys/stat.h>
#endif
#ifndef O_NOATIME
#define O_NOATIME 0
#endif
namespace mongo {
#if !defined(_WIN32)
// Handles allocation of contiguous files on disk.
class FileAllocator {
// The public functions may not be called concurrently. The allocation
// functions may be called multiple times per file, but only the first
// size specified per file will be used.
public:
FileAllocator() : failed_() {}
void start() {
Runner r( *this );
boost::thread t( r );
}
// May be called if file exists. If file exists, or its allocation has
// been requested, size is updated to match existing file size.
void requestAllocation( const string &name, int &size ) {
boostlock lk( pendingMutex_ );
int oldSize = prevSize( name );
if ( oldSize != -1 ) {
size = oldSize;
return;
}
pending_.push_back( name );
pendingSize_[ name ] = size;
pendingUpdated_.notify_all();
}
// Returns when file has been allocated. If file exists, size is
// updated to match existing file size.
void allocateAsap( const string &name, int &size ) {
boostlock lk( pendingMutex_ );
int oldSize = prevSize( name );
if ( oldSize != -1 ) {
size = oldSize;
if ( !inProgress( name ) )
return;
}
pendingSize_[ name ] = size;
if ( pending_.size() == 0 )
pending_.push_back( name );
else if ( pending_.front() != name ) {
pending_.remove( name );
list< string >::iterator i = pending_.begin();
++i;
pending_.insert( i, name );
}
pendingUpdated_.notify_all();
while( inProgress( name ) )
pendingUpdated_.wait( lk );
}
void waitUntilFinished() const {
if ( failed_ )
return;
boostlock lk( pendingMutex_ );
while( pending_.size() != 0 )
pendingUpdated_.wait( lk );
}
private:
// caller must hold pendingMutex_ lock. Returns size if allocated or
// allocation requested, -1 otherwise.
int prevSize( const string &name ) const {
if ( pendingSize_.count( name ) > 0 )
return pendingSize_[ name ];
if ( boost::filesystem::exists( name ) )
return boost::filesystem::file_size( name );
return -1;
}
// caller must hold pendingMutex_ lock.
bool inProgress( const string &name ) const {
for( list< string >::const_iterator i = pending_.begin(); i != pending_.end(); ++i )
if ( *i == name )
return true;
return false;
}
mutable boost::mutex pendingMutex_;
mutable boost::condition pendingUpdated_;
list< string > pending_;
mutable map< string, int > pendingSize_;
bool failed_;
struct Runner {
Runner( FileAllocator &allocator ) : a_( allocator ) {}
FileAllocator &a_;
void operator()() {
while( 1 ) {
{
boostlock lk( a_.pendingMutex_ );
if ( a_.pending_.size() == 0 )
a_.pendingUpdated_.wait( lk );
}
while( 1 ) {
string name;
int size;
{
boostlock lk( a_.pendingMutex_ );
if ( a_.pending_.size() == 0 )
break;
name = a_.pending_.front();
size = a_.pendingSize_[ name ];
}
try {
int fd = open(name.c_str(), O_CREAT | O_RDWR | O_NOATIME, S_IRUSR | S_IWUSR);
if ( fd <= 0 ) {
stringstream ss;
ss << "couldn't open " << name << ' ' << errno;
massert( ss.str(), fd <= 0 );
}
/* make sure the file is the full desired length */
off_t filelen = lseek(fd, 0, SEEK_END);
if ( filelen < size ) {
massert( "failure mapping new file", filelen == 0 );
// Check for end of disk.
massert( "Unable to allocate file of desired size",
size - 1 == lseek(fd, size - 1, SEEK_SET) );
massert( "Unable to allocate file of desired size",
1 == write(fd, "", 1) );
lseek(fd, 0, SEEK_SET);
log() << "allocating new datafile " << name << ", filling with zeroes..." << endl;
Timer t;
int z = 8192;
char buf[z];
memset(buf, 0, z);
int left = size;
while ( 1 ) {
if ( left <= z ) {
massert( "write failed", left == write(fd, buf, left) );
break;
}
massert( "write failed", z == write(fd, buf, z) );
left -= z;
}
log() << "done allocating datafile " << name << ", size: " << size << ", took " << ((double)t.millis())/1000.0 << " secs" << endl;
}
close( fd );
} catch ( ... ) {
problem() << "Failed to allocate new file: " << name
<< ", size: " << size << ", aborting." << endl;
try {
BOOST_CHECK_EXCEPTION( boost::filesystem::remove( name ) );
} catch ( ... ) {
}
a_.failed_ = true;
dbexit( 45 );
}
{
boostlock lk( a_.pendingMutex_ );
a_.pendingSize_.erase( name );
a_.pending_.pop_front();
a_.pendingUpdated_.notify_all();
}
}
}
}
};
};
FileAllocator &theFileAllocator();
#endif
} // namespace mongo
|
