Changeset 2242 for trunk/libtransmission/completion.c

Timestamp:

Jun 30, 2007, 12:54:26 PM (16 years ago)

Author:

charles

Message:

• make tr_cpLeftUntilDone() slightly more accurate
• simplify completion code a little

File:

• trunk/libtransmission/completion.c (modified) (14 diffs)

trunk/libtransmission/completion.c

@@ -33 +33 @@
     tr_bitfield_t     * pieceBitfield;
 
-    /* a block is missing if we don't have it AND there's not a request pending */
-    int * missingBlocks;
-
     /* a block is complete if and only if we have it */
     int * completeBlocks;
@@ -45 +42 @@
 };
 
-#define tr_cpCountBlocks(cp,piece) \
-    (piece==cp->tor->info.pieceCount-1 ? cp->nBlocksInLastPiece : cp->nBlocksInPiece)
+#define tr_cpCountBlocks(cp,piece) (piece==cp->tor->info.pieceCount-1 \
+    ? cp->nBlocksInLastPiece \
+    : cp->nBlocksInPiece)
 
 tr_completion_t * tr_cpInit( tr_torrent_t * tor )
@@ -57 +55 @@
     cp->blockDownloaders = tr_new( uint8_t, tor->blockCount );
     cp->pieceBitfield    = tr_bitfieldNew( tor->info.pieceCount );
-    cp->missingBlocks    = tr_new( int, tor->info.pieceCount );
     cp->completeBlocks   = tr_new( int, tor->info.pieceCount );
 
@@ -72 +69 @@
 {
     tr_free(         cp->completeBlocks );
-    tr_free(         cp->missingBlocks );
     tr_bitfieldFree( cp->pieceBitfield );
     tr_free(         cp->blockDownloaders );
@@ -87 +83 @@
     memset( cp->blockDownloaders, 0, tor->blockCount );
     tr_bitfieldClear( cp->pieceBitfield );
-    for( i = 0; i < tor->info.pieceCount; ++i ) {
-        cp->missingBlocks[i] = tr_cpCountBlocks( cp, i );
+    for( i = 0; i < tor->info.pieceCount; ++i )
         cp->completeBlocks[i] = 0;
-    }
 }
 
@@ -113 +107 @@
 void tr_cpPieceAdd( tr_completion_t * cp, int piece )
 {
-    int i;
     const tr_torrent_t * tor = cp->tor;
     const int n_blocks = tr_cpCountBlocks( cp, piece );
@@ -120 +113 @@
 
     cp->completeBlocks[piece] = n_blocks;
-
-    for( i=startBlock; i<endBlock; ++i )
-        if( !cp->blockDownloaders[i] )
-            --cp->missingBlocks[piece];
-
     tr_bitfieldAddRange( cp->blockBitfield, startBlock, endBlock-1 );
-
     tr_bitfieldAdd( cp->pieceBitfield, piece );
 }
@@ -132 +119 @@
 void tr_cpPieceRem( tr_completion_t * cp, int piece )
 {
-    int i;
     const tr_torrent_t * tor = cp->tor;
     const int n_blocks = tr_cpCountBlocks( cp, piece );
@@ -139 +125 @@
 
     cp->completeBlocks[piece] = 0;
-
-    for( i=startBlock; i<endBlock; ++i )
-        if( !cp->blockDownloaders[i] )
-            ++cp->missingBlocks[piece];
-
     tr_bitfieldRemRange ( cp->blockBitfield, startBlock, endBlock-1 );
-
     tr_bitfieldRem( cp->pieceBitfield, piece );
 }
@@ -152 +132 @@
 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])++;
+    ++cp->blockDownloaders[block];
 }
 
 void tr_cpDownloaderRem( tr_completion_t * cp, int block )
 {
-    tr_torrent_t * tor;
-
-    assert( cp != NULL );
-    assert( cp->tor != NULL );
-    assert( 0 <= block );
-
-    tor = cp->tor;
-    (cp->blockDownloaders[block])--;
-    if( !cp->blockDownloaders[block] && !tr_cpBlockIsComplete( cp, block ) )
-    {
-        cp->missingBlocks[tr_blockPiece(block)]++;
-    }
+    --cp->blockDownloaders[block];
 }
 
 int tr_cpBlockIsComplete( const tr_completion_t * cp, int block )
 {
-    assert( cp != NULL );
-    assert( 0 <= block );
-
     return tr_bitfieldHas( cp->blockBitfield, block );
 }
@@ -202 +163 @@
             tr_bitfieldAdd( cp->pieceBitfield, piece );
 
-        if( !cp->blockDownloaders[block] )
-            cp->missingBlocks[piece]--;
-
         tr_bitfieldAdd( cp->blockBitfield, block );
     }
@@ -236 +194 @@
 
     return cp->completeBlocks[piece] / (double)tr_cpCountBlocks( cp, 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_pieceStartBlock( piece );
+    const int end   = start + tr_cpCountBlocks( cp, piece );
+
+    n = 0;
+    for( i = start; i < end; ++i )
+        if( !tr_cpBlockIsComplete( cp, i ) && !cp->blockDownloaders[i] )
+            ++n;
+
+    return n;
 }
 
@@ -300 +275 @@
 
 
-int
-tr_cpMissingBlocksForPiece( const tr_completion_t * cp, int piece )
-{
-    assert( cp != NULL );
-
-    return cp->missingBlocks[piece];
-}
-
 /***
 ****
@@ -370 +337 @@
     for( i=0; i<info->pieceCount; ++i )
         if( !tr_cpPieceIsComplete( cp, i ) && info->pieces[i].priority != TR_PRI_DND )
-            b += tor->blockSize * (tr_cpCountBlocks( cp, i ) - cp->completeBlocks[ i ] );
-
-    return b;
+            b += ( tr_cpCountBlocks( cp, i ) - cp->completeBlocks[ i ] );
+
+    return b * tor->blockSize;
 }