mongodb/util/file_allocator.h

/**
 *    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>

#ifndef O_NOATIME
#define O_NOATIME 0
#endif

namespace mongo {

    // 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:
        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();
            boostlock lk( pendingMutex_ );
            while( 1 ) {
                if ( !inProgress( name ) ) {
                    return;
                }
                pendingUpdated_.wait( lk );                    
            }
        }

        void waitUntilFinished() const {
            boostlock lk( pendingMutex_ );
            while( 1 ) {
                if ( pending_.size() == 0 )
                    return;
                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_variable pendingUpdated_;
        list< string > pending_;
        mutable map< string, int > pendingSize_;
        
        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 ) {
                                        write(fd, buf, left);
                                        break;
                                    }
                                    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;
                        }
                        
                        {
                            boostlock lk( a_.pendingMutex_ );
                            a_.pendingSize_.erase( name );
                            a_.pending_.pop_front();
                        }
                        a_.pendingUpdated_.notify_all();
                    }
                }
            }
        };
    };
    
    FileAllocator &theFileAllocator();
    
} // namespace mongo