363 lines
9.2 KiB
C
363 lines
9.2 KiB
C
/******************************************************************************
|
|
* $Id$
|
|
*
|
|
* Copyright (c) 2005 Transmission authors and contributors
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
* copy of this software and associated documentation files (the "Software"),
|
|
* to deal in the Software without restriction, including without limitation
|
|
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
* and/or sell copies of the Software, and to permit persons to whom the
|
|
* Software is furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included in
|
|
* all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
|
* DEALINGS IN THE SOFTWARE.
|
|
*****************************************************************************/
|
|
|
|
#include <assert.h>
|
|
#include <string.h>
|
|
|
|
#include "transmission.h"
|
|
#include "completion.h"
|
|
#include "utils.h"
|
|
|
|
struct tr_completion_s
|
|
{
|
|
tr_torrent_t * tor;
|
|
|
|
/* true if a peer is requesting this block */
|
|
tr_bitfield_t * blockRequested;
|
|
|
|
/* do we have this block? */
|
|
tr_bitfield_t * blockBitfield;
|
|
|
|
/* do we have this piece? */
|
|
tr_bitfield_t * pieceBitfield;
|
|
|
|
/* a block is complete if and only if we have it */
|
|
uint16_t * completeBlocks;
|
|
|
|
uint8_t doneDirty;
|
|
uint64_t doneHave;
|
|
uint64_t doneTotal;
|
|
uint64_t completeHave;
|
|
};
|
|
|
|
tr_completion_t * tr_cpInit( tr_torrent_t * tor )
|
|
{
|
|
tr_completion_t * cp;
|
|
|
|
cp = tr_new( tr_completion_t, 1 );
|
|
cp->tor = tor;
|
|
cp->blockBitfield = tr_bitfieldNew( tor->blockCount );
|
|
cp->blockRequested = tr_bitfieldNew( tor->blockCount );
|
|
cp->pieceBitfield = tr_bitfieldNew( tor->info.pieceCount );
|
|
cp->completeBlocks = tr_new( uint16_t, tor->info.pieceCount );
|
|
|
|
tr_cpReset( cp );
|
|
|
|
return cp;
|
|
}
|
|
|
|
void tr_cpClose( tr_completion_t * cp )
|
|
{
|
|
tr_free( cp->completeBlocks );
|
|
tr_bitfieldFree( cp->pieceBitfield );
|
|
tr_bitfieldFree( cp->blockRequested );
|
|
tr_bitfieldFree( cp->blockBitfield );
|
|
tr_free( cp );
|
|
}
|
|
|
|
void tr_cpReset( tr_completion_t * cp )
|
|
{
|
|
tr_torrent_t * tor = cp->tor;
|
|
|
|
tr_bitfieldClear( cp->pieceBitfield );
|
|
tr_bitfieldClear( cp->blockBitfield );
|
|
tr_bitfieldClear( cp->blockRequested );
|
|
memset( cp->completeBlocks, 0, sizeof(uint16_t) * tor->info.pieceCount );
|
|
|
|
cp->doneDirty = TRUE;
|
|
cp->doneHave = 0;
|
|
cp->doneTotal = 0;
|
|
cp->completeHave = 0;
|
|
}
|
|
|
|
/**
|
|
***
|
|
**/
|
|
|
|
static void
|
|
tr_cpEnsureDoneValid( const tr_completion_t * ccp )
|
|
{
|
|
const tr_torrent_t * tor = ccp->tor;
|
|
const tr_info_t * info = &tor->info;
|
|
uint64_t have=0, total=0;
|
|
int i;
|
|
tr_completion_t * cp ;
|
|
|
|
if( !ccp->doneDirty )
|
|
return;
|
|
|
|
/* too bad C doesn't have 'mutable' */
|
|
cp = (tr_completion_t*) ccp;
|
|
cp->doneDirty = FALSE;
|
|
|
|
for( i=0; i<info->pieceCount; ++i ) {
|
|
if( !info->pieces[i].dnd ) {
|
|
total += info->pieceSize;
|
|
have += cp->completeBlocks[ i ];
|
|
}
|
|
}
|
|
|
|
have *= tor->blockSize;
|
|
|
|
/* the last piece/block is probably smaller than the others */
|
|
if( !info->pieces[info->pieceCount-1].dnd ) {
|
|
total -= ( info->pieceSize - ( info->totalSize % info->pieceSize ) );
|
|
if( tr_cpBlockIsComplete( cp, tor->blockCount-1 ) )
|
|
have -= ( tor->blockSize - ( info->totalSize % tor->blockSize ) );
|
|
}
|
|
|
|
assert( have <= total );
|
|
assert( total <= info->totalSize );
|
|
|
|
cp->doneHave = have;
|
|
cp->doneTotal = total;
|
|
}
|
|
|
|
void
|
|
tr_cpInvalidateDND ( tr_completion_t * cp )
|
|
{
|
|
cp->doneDirty = TRUE;
|
|
}
|
|
|
|
int tr_cpPieceHasAllBlocks( const tr_completion_t * cp, int piece )
|
|
{
|
|
return tr_cpPieceIsComplete( cp, piece );
|
|
}
|
|
|
|
int tr_cpPieceIsComplete( const tr_completion_t * cp, int piece )
|
|
{
|
|
return cp->completeBlocks[piece] >= tr_torPieceCountBlocks(cp->tor,piece);
|
|
}
|
|
|
|
const tr_bitfield_t * tr_cpPieceBitfield( const tr_completion_t * cp )
|
|
{
|
|
return cp->pieceBitfield;
|
|
}
|
|
|
|
void tr_cpPieceAdd( tr_completion_t * cp, int piece )
|
|
{
|
|
const tr_torrent_t * tor = cp->tor;
|
|
const int start = tr_torPieceFirstBlock(tor,piece);
|
|
const int end = start + tr_torPieceCountBlocks(tor,piece);
|
|
int i;
|
|
|
|
for( i=start; i<end; ++i )
|
|
tr_cpBlockAdd( cp, i );
|
|
}
|
|
|
|
void tr_cpPieceRem( tr_completion_t * cp, int piece )
|
|
{
|
|
const tr_torrent_t * tor = cp->tor;
|
|
const int start = tr_torPieceFirstBlock(tor,piece);
|
|
const int end = start + tr_torPieceCountBlocks(tor,piece);
|
|
int block;
|
|
|
|
assert( cp != NULL );
|
|
assert( 0 <= piece );
|
|
assert( piece < tor->info.pieceCount );
|
|
assert( 0 <= start );
|
|
assert( start < tor->blockCount );
|
|
assert( start <= end );
|
|
assert( end <= tor->blockCount );
|
|
|
|
for( block=start; block<end; ++block ) {
|
|
if( tr_cpBlockIsComplete( cp, block ) ) {
|
|
const int blockSize = tr_torBlockCountBytes( tor, block );
|
|
cp->completeHave -= blockSize;
|
|
if( !tor->info.pieces[piece].dnd )
|
|
cp->doneHave -= blockSize;
|
|
}
|
|
}
|
|
|
|
cp->completeBlocks[piece] = 0;
|
|
tr_bitfieldRemRange ( cp->blockBitfield, start, end );
|
|
tr_bitfieldRem( cp->pieceBitfield, piece );
|
|
}
|
|
|
|
/* Blocks */
|
|
void tr_cpDownloaderAdd( tr_completion_t * cp, int block )
|
|
{
|
|
tr_bitfieldAdd( cp->blockRequested, block );
|
|
}
|
|
|
|
void tr_cpDownloaderRem( tr_completion_t * cp, int block )
|
|
{
|
|
tr_bitfieldRem( cp->blockRequested, block );
|
|
}
|
|
|
|
int tr_cpBlockIsComplete( const tr_completion_t * cp, int block )
|
|
{
|
|
return tr_bitfieldHas( cp->blockBitfield, block );
|
|
}
|
|
|
|
void
|
|
tr_cpBlockAdd( tr_completion_t * cp, int block )
|
|
{
|
|
const tr_torrent_t * tor = cp->tor;
|
|
|
|
if( !tr_cpBlockIsComplete( cp, block ) )
|
|
{
|
|
const int piece = tr_torBlockPiece( tor, block );
|
|
const int blockSize = tr_torBlockCountBytes( tor, block );
|
|
|
|
++cp->completeBlocks[piece];
|
|
|
|
if( cp->completeBlocks[piece] == tr_torPieceCountBlocks( tor, piece ) )
|
|
tr_bitfieldAdd( cp->pieceBitfield, piece );
|
|
|
|
tr_bitfieldAdd( cp->blockBitfield, block );
|
|
|
|
cp->completeHave += blockSize;
|
|
|
|
if( !tor->info.pieces[piece].dnd )
|
|
cp->doneHave += blockSize;
|
|
}
|
|
}
|
|
|
|
const tr_bitfield_t * tr_cpBlockBitfield( const tr_completion_t * cp )
|
|
{
|
|
assert( cp != NULL );
|
|
|
|
return cp->blockBitfield;
|
|
}
|
|
|
|
void
|
|
tr_cpBlockBitfieldSet( tr_completion_t * cp, tr_bitfield_t * bitfield )
|
|
{
|
|
int i;
|
|
|
|
assert( cp != NULL );
|
|
assert( bitfield != NULL );
|
|
|
|
tr_cpReset( cp );
|
|
|
|
for( i=0; i < cp->tor->blockCount; ++i )
|
|
if( tr_bitfieldHas( bitfield, i ) )
|
|
tr_cpBlockAdd( cp, i );
|
|
}
|
|
|
|
float tr_cpPercentBlocksInPiece( const tr_completion_t * cp, int piece )
|
|
{
|
|
assert( cp != NULL );
|
|
|
|
return (double)cp->completeBlocks[piece] / tr_torPieceCountBlocks(cp->tor,piece);
|
|
}
|
|
|
|
int
|
|
tr_cpMissingBlocksForPiece( const tr_completion_t * cp, int piece )
|
|
{
|
|
int i;
|
|
int n;
|
|
const tr_torrent_t * tor = cp->tor;
|
|
const int start = tr_torPieceFirstBlock(tor,piece);
|
|
const int end = start + tr_torPieceCountBlocks(tor,piece);
|
|
|
|
n = 0;
|
|
for( i = start; i < end; ++i )
|
|
if( !tr_cpBlockIsComplete( cp, i ) && !tr_bitfieldHas( cp->blockRequested, i ) )
|
|
++n;
|
|
|
|
return n;
|
|
}
|
|
|
|
int tr_cpMissingBlockInPiece( const tr_completion_t * cp, int piece )
|
|
{
|
|
int i;
|
|
const tr_torrent_t * tor = cp->tor;
|
|
const int start = tr_torPieceFirstBlock(tor,piece);
|
|
const int end = start + tr_torPieceCountBlocks(tor,piece);
|
|
|
|
for( i = start; i < end; ++i )
|
|
if( !tr_cpBlockIsComplete( cp, i ) && !tr_bitfieldHas( cp->blockRequested, i ) )
|
|
return i;
|
|
|
|
return -1;
|
|
}
|
|
|
|
/***
|
|
****
|
|
***/
|
|
|
|
float
|
|
tr_cpPercentComplete ( const tr_completion_t * cp )
|
|
{
|
|
return (double)cp->completeHave / cp->tor->info.totalSize;
|
|
}
|
|
|
|
uint64_t
|
|
tr_cpLeftUntilComplete ( const tr_completion_t * cp )
|
|
{
|
|
return cp->tor->info.totalSize - cp->completeHave;
|
|
}
|
|
|
|
float
|
|
tr_cpPercentDone( const tr_completion_t * cp )
|
|
{
|
|
tr_cpEnsureDoneValid( cp );
|
|
|
|
return (double)cp->doneHave / cp->doneTotal;
|
|
}
|
|
|
|
uint64_t
|
|
tr_cpLeftUntilDone ( const tr_completion_t * cp )
|
|
{
|
|
tr_cpEnsureDoneValid( cp );
|
|
|
|
return cp->doneTotal - cp->doneHave;
|
|
}
|
|
|
|
cp_status_t
|
|
tr_cpGetStatus ( const tr_completion_t * cp )
|
|
{
|
|
if( cp->completeHave >= cp->tor->info.totalSize )
|
|
return TR_CP_COMPLETE;
|
|
|
|
tr_cpEnsureDoneValid( cp );
|
|
|
|
if( cp->doneHave >= cp->doneTotal )
|
|
return TR_CP_DONE;
|
|
|
|
return TR_CP_INCOMPLETE;
|
|
}
|
|
|
|
uint64_t
|
|
tr_cpDownloadedValid( const tr_completion_t * cp )
|
|
{
|
|
uint64_t b = 0;
|
|
const tr_torrent_t * tor = cp->tor;
|
|
const tr_info_t * info = &tor->info;
|
|
int i;
|
|
|
|
for( i=0; i<info->pieceCount; ++i )
|
|
if( tr_cpPieceIsComplete( cp, i ) )
|
|
++b;
|
|
|
|
b *= info->pieceSize;
|
|
|
|
if( tr_cpPieceIsComplete( cp, info->pieceCount-1 ) )
|
|
b -= (info->pieceSize - (info->totalSize % info->pieceSize));
|
|
|
|
return b;
|
|
}
|