mirror of
https://github.com/transmission/transmission
synced 2024-12-25 09:13:06 +00:00
326 lines
8.4 KiB
C
326 lines
8.4 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 "transmission.h"
|
|
|
|
tr_completion_t * tr_cpInit( tr_torrent_t * tor )
|
|
{
|
|
tr_completion_t * cp;
|
|
|
|
cp = malloc( sizeof( tr_completion_t ) );
|
|
cp->tor = tor;
|
|
cp->blockBitfield = tr_bitfieldNew( tor->blockCount );
|
|
cp->blockDownloaders = malloc( tor->blockCount );
|
|
cp->pieceBitfield = tr_bitfieldNew( tor->info.pieceCount );
|
|
cp->missingBlocks = malloc( tor->info.pieceCount * sizeof( int ) );
|
|
|
|
tr_cpReset( cp );
|
|
|
|
return cp;
|
|
}
|
|
|
|
void tr_cpClose( tr_completion_t * cp )
|
|
{
|
|
tr_bitfieldFree( cp->blockBitfield );
|
|
free( cp->blockDownloaders );
|
|
tr_bitfieldFree( cp->pieceBitfield );
|
|
free( cp->missingBlocks );
|
|
free( cp );
|
|
}
|
|
|
|
void tr_cpReset( tr_completion_t * cp )
|
|
{
|
|
tr_torrent_t * tor = cp->tor;
|
|
int i;
|
|
|
|
cp->blockCount = 0;
|
|
tr_bitfieldClear( cp->blockBitfield );
|
|
memset( cp->blockDownloaders, 0, tor->blockCount );
|
|
tr_bitfieldClear( cp->pieceBitfield );
|
|
for( i = 0; i < tor->info.pieceCount; i++ )
|
|
{
|
|
cp->missingBlocks[i] = tr_pieceCountBlocks( i );
|
|
}
|
|
}
|
|
|
|
float tr_cpCompletionAsFloat( tr_completion_t * cp )
|
|
{
|
|
return (float) cp->blockCount / (float) cp->tor->blockCount;
|
|
}
|
|
|
|
uint64_t tr_cpLeftBytes( tr_completion_t * cp )
|
|
{
|
|
tr_torrent_t * tor = cp->tor;
|
|
uint64_t left;
|
|
left = (uint64_t) ( cp->tor->blockCount - cp->blockCount ) *
|
|
(uint64_t) tor->blockSize;
|
|
if( !tr_bitfieldHas( cp->blockBitfield, cp->tor->blockCount - 1 ) &&
|
|
tor->info.totalSize % tor->blockSize )
|
|
{
|
|
left += tor->info.totalSize % tor->blockSize;
|
|
left -= tor->blockSize;
|
|
}
|
|
return left;
|
|
}
|
|
|
|
/* Pieces */
|
|
int tr_cpPieceHasAllBlocks( tr_completion_t * cp, int piece )
|
|
{
|
|
tr_torrent_t * tor = cp->tor;
|
|
int startBlock = tr_pieceStartBlock( piece );
|
|
int endBlock = startBlock + tr_pieceCountBlocks( piece );
|
|
int i;
|
|
|
|
for( i = startBlock; i < endBlock; i++ )
|
|
{
|
|
if( !tr_bitfieldHas( cp->blockBitfield, i ) )
|
|
{
|
|
return 0;
|
|
}
|
|
}
|
|
return 1;
|
|
}
|
|
int tr_cpPieceIsComplete( tr_completion_t * cp, int piece )
|
|
{
|
|
return tr_bitfieldHas( cp->pieceBitfield, piece );
|
|
}
|
|
|
|
tr_bitfield_t * tr_cpPieceBitfield( tr_completion_t * cp )
|
|
{
|
|
return cp->pieceBitfield;
|
|
}
|
|
|
|
void tr_cpPieceAdd( tr_completion_t * cp, int piece )
|
|
{
|
|
tr_torrent_t * tor = cp->tor;
|
|
int startBlock, endBlock, i;
|
|
|
|
startBlock = tr_pieceStartBlock( piece );
|
|
endBlock = startBlock + tr_pieceCountBlocks( piece );
|
|
for( i = startBlock; i < endBlock; i++ )
|
|
{
|
|
tr_cpBlockAdd( cp, i );
|
|
}
|
|
|
|
tr_bitfieldAdd( cp->pieceBitfield, piece );
|
|
}
|
|
|
|
void tr_cpPieceRem( tr_completion_t * cp, int piece )
|
|
{
|
|
tr_torrent_t * tor = cp->tor;
|
|
int startBlock, endBlock, i;
|
|
|
|
startBlock = tr_pieceStartBlock( piece );
|
|
endBlock = startBlock + tr_pieceCountBlocks( piece );
|
|
for( i = startBlock; i < endBlock; i++ )
|
|
{
|
|
tr_cpBlockRem( cp, i );
|
|
}
|
|
|
|
tr_bitfieldRem( cp->pieceBitfield, piece );
|
|
}
|
|
|
|
/* Blocks */
|
|
void tr_cpDownloaderAdd( tr_completion_t * cp, int block )
|
|
{
|
|
tr_torrent_t * tor = cp->tor;
|
|
if( !cp->blockDownloaders[block] && !tr_cpBlockIsComplete( cp, block ) )
|
|
{
|
|
cp->missingBlocks[tr_blockPiece(block)]--;
|
|
}
|
|
(cp->blockDownloaders[block])++;
|
|
}
|
|
|
|
void tr_cpDownloaderRem( tr_completion_t * cp, int block )
|
|
{
|
|
tr_torrent_t * tor = cp->tor;
|
|
(cp->blockDownloaders[block])--;
|
|
if( !cp->blockDownloaders[block] && !tr_cpBlockIsComplete( cp, block ) )
|
|
{
|
|
cp->missingBlocks[tr_blockPiece(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 )
|
|
{
|
|
tr_torrent_t * tor = cp->tor;
|
|
if( !tr_cpBlockIsComplete( cp, block ) )
|
|
{
|
|
(cp->blockCount)++;
|
|
if( !cp->blockDownloaders[block] )
|
|
{
|
|
(cp->missingBlocks[tr_blockPiece(block)])--;
|
|
}
|
|
}
|
|
tr_bitfieldAdd( cp->blockBitfield, block );
|
|
}
|
|
|
|
void tr_cpBlockRem( tr_completion_t * cp, int block )
|
|
{
|
|
tr_torrent_t * tor = cp->tor;
|
|
if( tr_cpBlockIsComplete( cp, block ) )
|
|
{
|
|
(cp->blockCount)--;
|
|
if( !cp->blockDownloaders[block] )
|
|
{
|
|
(cp->missingBlocks[tr_blockPiece(block)])++;
|
|
}
|
|
}
|
|
tr_bitfieldRem( cp->blockBitfield, block );
|
|
}
|
|
|
|
tr_bitfield_t * tr_cpBlockBitfield( tr_completion_t * cp )
|
|
{
|
|
return cp->blockBitfield;
|
|
}
|
|
|
|
void tr_cpBlockBitfieldSet( tr_completion_t * cp, tr_bitfield_t * bitfield )
|
|
{
|
|
tr_torrent_t * tor = cp->tor;
|
|
int i, j;
|
|
int startBlock, endBlock;
|
|
int pieceComplete;
|
|
|
|
for( i = 0; i < cp->tor->info.pieceCount; i++ )
|
|
{
|
|
startBlock = tr_pieceStartBlock( i );
|
|
endBlock = startBlock + tr_pieceCountBlocks( i );
|
|
pieceComplete = 1;
|
|
|
|
for( j = startBlock; j < endBlock; j++ )
|
|
{
|
|
if( tr_bitfieldHas( bitfield, j ) )
|
|
{
|
|
tr_cpBlockAdd( cp, j );
|
|
}
|
|
else
|
|
{
|
|
pieceComplete = 0;
|
|
}
|
|
}
|
|
if( pieceComplete )
|
|
{
|
|
tr_cpPieceAdd( cp, i );
|
|
}
|
|
}
|
|
}
|
|
|
|
float tr_cpPercentBlocksInPiece( tr_completion_t * cp, int piece )
|
|
{
|
|
tr_torrent_t * tor = cp->tor;
|
|
int i;
|
|
int blockCount, startBlock, endBlock;
|
|
int complete;
|
|
tr_bitfield_t * bitfield;
|
|
|
|
blockCount = tr_pieceCountBlocks( piece );
|
|
startBlock = tr_pieceStartBlock( piece );
|
|
endBlock = startBlock + blockCount;
|
|
complete = 0;
|
|
|
|
bitfield = cp->blockBitfield;
|
|
|
|
for( i = startBlock; i < endBlock; i++ )
|
|
{
|
|
if( tr_bitfieldHas( bitfield, i ) )
|
|
{
|
|
complete++;
|
|
}
|
|
}
|
|
|
|
return (float)complete / (float)blockCount;
|
|
}
|
|
|
|
int tr_cpMissingBlockInPiece( const tr_completion_t * cp, int piece )
|
|
{
|
|
const tr_torrent_t * tor = cp->tor;
|
|
int start, count, end, i;
|
|
|
|
start = tr_pieceStartBlock( piece );
|
|
count = tr_pieceCountBlocks( piece );
|
|
end = start + count;
|
|
|
|
for( i = start; i < end; i++ )
|
|
{
|
|
if( tr_cpBlockIsComplete( cp, i ) || cp->blockDownloaders[i] )
|
|
{
|
|
continue;
|
|
}
|
|
return i;
|
|
}
|
|
|
|
return -1;
|
|
}
|
|
|
|
int tr_cpMostMissingBlockInPiece( tr_completion_t * cp, int piece,
|
|
int * downloaders )
|
|
{
|
|
tr_torrent_t * tor = cp->tor;
|
|
int start, count, end, i;
|
|
int * pool, poolSize, min, ret;
|
|
|
|
start = tr_pieceStartBlock( piece );
|
|
count = tr_pieceCountBlocks( piece );
|
|
end = start + count;
|
|
|
|
pool = malloc( count * sizeof( int ) );
|
|
poolSize = 0;
|
|
min = 255;
|
|
|
|
for( i = start; i < end; i++ )
|
|
{
|
|
if( tr_cpBlockIsComplete( cp, i ) || cp->blockDownloaders[i] > min )
|
|
{
|
|
continue;
|
|
}
|
|
if( cp->blockDownloaders[i] < min )
|
|
{
|
|
min = cp->blockDownloaders[i];
|
|
poolSize = 0;
|
|
}
|
|
if( cp->blockDownloaders[i] <= min )
|
|
{
|
|
pool[poolSize++] = i;
|
|
}
|
|
}
|
|
|
|
if( poolSize > 0 )
|
|
{
|
|
ret = pool[0];
|
|
*downloaders = min;
|
|
}
|
|
else
|
|
{
|
|
ret = -1;
|
|
}
|
|
|
|
free( pool );
|
|
return ret;
|
|
}
|
|
|