/* * This file Copyright (C) 2007-2008 Charles Kerr * * This file is licensed by the GPL version 2. Works owned by the * Transmission project are granted a special exemption to clause 2(b) * so that the bulk of its code can remain under the MIT license. * This exemption does not extend to derived works not owned by * the Transmission project. * * $Id$ */ #include #include #include #include #include #include #include "transmission.h" #include "completion.h" #include "crypto.h" #include "fastresume.h" #include "fdlimit.h" #include "inout.h" #include "list.h" #include "platform.h" #include "peer-mgr.h" #include "stats.h" #include "torrent.h" #include "utils.h" /**** ***** Low-level IO functions ****/ #ifdef WIN32 #define lseek _lseeki64 #endif enum { TR_IO_READ, TR_IO_WRITE }; static tr_errno readOrWriteBytes( const tr_torrent * tor, int ioMode, int fileIndex, uint64_t fileOffset, void * buf, size_t buflen ) { const tr_info * info = &tor->info; const tr_file * file = &info->files[fileIndex]; typedef size_t (* iofunc) ( int, void *, size_t ); iofunc func = ioMode == TR_IO_READ ? (iofunc)read : (iofunc)write; char path[MAX_PATH_LENGTH]; struct stat sb; int fd = -1; int err; int fileExists; assert( 0<=fileIndex && fileIndexfileCount ); assert( !file->length || (fileOffset < file->length)); assert( fileOffset + buflen <= file->length ); tr_buildPath ( path, sizeof(path), tor->destination, file->name, NULL ); fileExists = !stat( path, &sb ); if( !file->length ) return TR_OK; if ((ioMode==TR_IO_READ) && !fileExists ) /* does file exist? */ err = tr_ioErrorFromErrno( errno ); else if ((fd = tr_fdFileCheckout ( tor->destination, file->name, ioMode==TR_IO_WRITE )) < 0) err = fd; else if( lseek( fd, (off_t)fileOffset, SEEK_SET ) == ((off_t)-1) ) err = tr_ioErrorFromErrno( errno ); else if( func( fd, buf, buflen ) != buflen ) err = tr_ioErrorFromErrno( errno ); else err = TR_OK; if( ( err==TR_OK ) && ( !fileExists ) && ( ioMode == TR_IO_WRITE) ) tr_statsFileCreated( tor->handle ); if( fd >= 0 ) tr_fdFileReturn( fd ); return err; } static tr_errno findFileLocation( const tr_torrent * tor, int pieceIndex, int pieceOffset, int * fileIndex, uint64_t * fileOffset ) { const tr_info * info = &tor->info; int i; uint64_t piecePos = ((uint64_t)pieceIndex * info->pieceSize) + pieceOffset; if( pieceIndex < 0 || pieceIndex >= info->pieceCount ) return TR_ERROR_ASSERT; if( pieceOffset >= tr_torPieceCountBytes( tor, pieceIndex ) ) return TR_ERROR_ASSERT; if( piecePos >= info->totalSize ) return TR_ERROR_ASSERT; for( i=0; info->files[i].length<=piecePos; ++i ) piecePos -= info->files[i].length; *fileIndex = i; *fileOffset = piecePos; assert( 0<=*fileIndex && *fileIndexfileCount ); assert( *fileOffset < info->files[i].length ); return 0; } #ifdef WIN32 static tr_errno ensureMinimumFileSize( const tr_torrent * tor, int fileIndex, uint64_t minBytes ) { int fd; tr_errno err; struct stat sb; const tr_file * file = &tor->info.files[fileIndex]; assert( 0<=fileIndex && fileIndexinfo.fileCount ); assert( minBytes <= file->length ); fd = tr_fdFileCheckout( tor->destination, file->name, TRUE ); if( fd < 0 ) /* bad fd */ err = fd; else if (fstat (fd, &sb) ) /* how big is the file? */ err = tr_ioErrorFromErrno( errno ); else if (sb.st_size >= (off_t)minBytes) /* already big enough */ err = TR_OK; else if ( !ftruncate( fd, minBytes ) ) /* grow it */ err = TR_OK; else /* couldn't grow it */ err = tr_ioErrorFromErrno( errno ); if( fd >= 0 ) tr_fdFileReturn( fd ); return err; } #endif static tr_errno readOrWritePiece( tr_torrent * tor, int ioMode, int pieceIndex, int pieceOffset, uint8_t * buf, size_t buflen ) { tr_errno err = 0; int fileIndex; uint64_t fileOffset; const tr_info * info = &tor->info; if( pieceIndex < 0 || pieceIndex >= tor->info.pieceCount ) err = TR_ERROR_ASSERT; else if( buflen > ( size_t ) tr_torPieceCountBytes( tor, pieceIndex ) ) err = TR_ERROR_ASSERT; if( !err ) err = findFileLocation ( tor, pieceIndex, pieceOffset, &fileIndex, &fileOffset ); while( buflen && !err ) { const tr_file * file = &info->files[fileIndex]; const uint64_t bytesThisPass = MIN( buflen, file->length - fileOffset ); #ifdef WIN32 if( ioMode == TR_IO_WRITE ) err = ensureMinimumFileSize( tor, fileIndex, fileOffset + bytesThisPass ); if( !err ) #endif err = readOrWriteBytes( tor, ioMode, fileIndex, fileOffset, buf, bytesThisPass ); buf += bytesThisPass; buflen -= bytesThisPass; fileIndex++; fileOffset = 0; } return err; } tr_errno tr_ioRead( tr_torrent * tor, int pieceIndex, int begin, int len, uint8_t * buf ) { return readOrWritePiece( tor, TR_IO_READ, pieceIndex, begin, buf, len ); } tr_errno tr_ioWrite( tr_torrent * tor, int pieceIndex, int begin, int len, const uint8_t * buf ) { return readOrWritePiece( tor, TR_IO_WRITE, pieceIndex, begin, (void*)buf, len ); } /**** ***** ****/ static int tr_ioRecalculateHash( tr_torrent * tor, int pieceIndex, uint8_t * setme ) { int n; int ret; uint8_t * buf; const tr_info * info; assert( tor != NULL ); assert( setme != NULL ); assert( 0<=pieceIndex && pieceIndexinfo.pieceCount ); info = &tor->info; n = tr_torPieceCountBytes( tor, pieceIndex ); buf = tr_new( uint8_t, n ); ret = tr_ioRead( tor, pieceIndex, 0, n, buf ); if( !ret ) tr_sha1( setme, buf, n, NULL ); tr_free( buf ); return ret; } static int checkPiece( tr_torrent * tor, int pieceIndex ) { uint8_t hash[SHA_DIGEST_LENGTH]; const int ret = tr_ioRecalculateHash( tor, pieceIndex, hash ) || memcmp( hash, tor->info.pieces[pieceIndex].hash, SHA_DIGEST_LENGTH ); tr_dbg ("torrent [%s] piece %d hash check: %s", tor->info.name, pieceIndex, ( ret ? "FAILED" : "OK" )); return ret; } static void checkFile( tr_torrent * tor, int fileIndex, int * abortFlag ) { int i; int nofile; struct stat sb; char path[MAX_PATH_LENGTH]; const tr_file * file = &tor->info.files[fileIndex]; tr_buildPath ( path, sizeof(path), tor->destination, file->name, NULL ); nofile = stat( path, &sb ) || !S_ISREG( sb.st_mode ); for( i=file->firstPiece; i<=file->lastPiece && iinfo.pieceCount && (!*abortFlag); ++i ) { if( nofile ) { tr_torrentSetHasPiece( tor, i, 0 ); } else if( !tr_torrentIsPieceChecked( tor, i ) ) { const int check = checkPiece( tor, i ); tr_torrentSetHasPiece( tor, i, !check ); tr_torrentSetPieceChecked( tor, i, TRUE ); } } } /** *** **/ int tr_ioHash( tr_torrent * tor, int pieceIndex ) { int ret; const int success = !checkPiece( tor, pieceIndex ); if( success ) { tr_dbg( "Piece %d hash OK", pieceIndex ); tr_cpPieceAdd( tor->completion, pieceIndex ); ret = TR_OK; } else { tr_err( "Piece %d hash FAILED", pieceIndex ); tr_cpPieceRem( tor->completion, pieceIndex ); ret = TR_ERROR; } tr_peerMgrSetBlame( tor->handle->peerMgr, tor->info.hash, pieceIndex, success ); return ret; } /** *** **/ struct recheck_node { tr_torrent * torrent; tr_recheck_done_cb recheck_done_cb; }; static void fireCheckDone( tr_torrent * torrent, tr_recheck_done_cb recheck_done_cb ) { if( recheck_done_cb != NULL ) (*recheck_done_cb)( torrent ); } static struct recheck_node currentNode; static tr_list * recheckList = NULL; static tr_thread * recheckThread = NULL; static int stopCurrent = FALSE; static tr_lock* getRecheckLock( void ) { static tr_lock * lock = NULL; if( lock == NULL ) lock = tr_lockNew( ); return lock; } static void recheckThreadFunc( void * unused UNUSED ) { for( ;; ) { int i; tr_torrent * tor; struct recheck_node * node; tr_lockLock( getRecheckLock( ) ); stopCurrent = FALSE; node = (struct recheck_node*) recheckList ? recheckList->data : NULL; if( node == NULL ) { currentNode.torrent = NULL; break; } currentNode = *node; tor = currentNode.torrent; tr_list_remove_data( &recheckList, node ); tr_free( node ); tr_lockUnlock( getRecheckLock( ) ); tor->recheckState = TR_RECHECK_NOW; /* remove the unchecked pieces from completion... */ for( i=0; iinfo.pieceCount; ++i ) if( !tr_torrentIsPieceChecked( tor, i ) ) tr_cpPieceRem( tor->completion, i ); tr_inf( "Verifying some pieces of \"%s\"", tor->info.name ); for( i=0; iinfo.fileCount && !stopCurrent; ++i ) checkFile( tor, i, &stopCurrent ); tor->recheckState = TR_RECHECK_NONE; if( !stopCurrent ) { tr_fastResumeSave( tor ); fireCheckDone( tor, currentNode.recheck_done_cb ); } } recheckThread = NULL; tr_lockUnlock( getRecheckLock( ) ); } void tr_ioRecheckAdd( tr_torrent * tor, tr_recheck_done_cb recheck_done_cb ) { const int uncheckedCount = tr_torrentCountUncheckedPieces( tor ); if( !uncheckedCount ) { /* doesn't need to be checked... */ recheck_done_cb( tor ); } else { struct recheck_node * node; tr_inf( "Queueing %s to verify %d local file pieces", tor->info.name, uncheckedCount ); node = tr_new( struct recheck_node, 1 ); node->torrent = tor; node->recheck_done_cb = recheck_done_cb; tr_lockLock( getRecheckLock( ) ); tor->recheckState = recheckList ? TR_RECHECK_WAIT : TR_RECHECK_NOW; tr_list_append( &recheckList, node ); if( recheckThread == NULL ) recheckThread = tr_threadNew( recheckThreadFunc, NULL, "recheckThreadFunc" ); tr_lockUnlock( getRecheckLock( ) ); } } static int compareRecheckByTorrent( const void * va, const void * vb ) { const struct recheck_node * a = va; const tr_torrent * b = vb; return a->torrent - b; } void tr_ioRecheckRemove( tr_torrent * tor ) { tr_lock * lock = getRecheckLock( ); tr_lockLock( lock ); if( tor == currentNode.torrent ) { stopCurrent = TRUE; while( stopCurrent ) { tr_lockUnlock( lock ); tr_wait( 100 ); tr_lockLock( lock ); } } else { tr_free( tr_list_remove( &recheckList, tor, compareRecheckByTorrent ) ); tor->recheckState = TR_RECHECK_NONE; } tr_lockUnlock( lock ); }