Changeset 2297

Timestamp:

Jul 6, 2007, 4:17:37 PM (15 years ago)

Author:

charles

Message:

fix endgame bugs

Location:

trunk/libtransmission

Files:

• peer.c (modified) (4 diffs)
• peerutils.h (modified) (3 diffs)
• utils.c (modified) (1 diff)

trunk/libtransmission/peer.c

@@ -155 +155 @@
     /* The pieces that the peer has */
     tr_bitfield_t     * bitfield;
+
+    /* blocks we've requested from this peer */
+    tr_bitfield_t     * reqfield;
     int                 pieceCount;
     float               progress;
@@ -232 +235 @@
 tr_peer_t * tr_peerInit( struct in_addr addr, in_port_t port, int s, int from )
 {
-    tr_peer_t * peer = peerInit();
+    tr_peer_t * peer;
 
     assert( 0 <= from && TR_PEER_FROM__MAX > from );
+
+    peer              = tr_new0( tr_peer_t, 1 );
+    peertreeInit( &peer->sentPeers );
+    peer->amChoking   = TRUE;
+    peer->peerChoking = TRUE;
+    peer->date        = tr_date();
+    peer->keepAlive   = peer->date;
+    peer->download    = tr_rcInit();
+    peer->upload      = tr_rcInit();
 
     peer->outRequestMax = peer->outRequestAlloc = 2;
@@ -276 +288 @@
     tr_bitfieldFree( peer->blamefield );
     tr_bitfieldFree( peer->banfield );
+    tr_bitfieldFree( peer->reqfield );
     tr_free( peer->inRequests );
     tr_free( peer->outRequests );
@@ -622 +635 @@
         if( endgame ) /* endgame -- request everything we don't already have */
         {
-            const tr_bitfield_t * blocks = tr_cpBlockBitfield( tor->completion );
-            for( i=0; i<tor->blockCount && peer->inRequestCount<peer->inRequestMax; ++i ) {
-                if( tr_bitfieldHas( blocks, i ) )
-                    sendRequest( tor, peer, i );
+            for( i=0; i<tor->blockCount && peer->inRequestCount<peer->inRequestMax; ++i )
+            {
+                if( !isBlockInteresting( tor, peer, i ) )
+                    continue;
+                if( tr_bitfieldHas( peer->reqfield, i ) ) /* we've already asked them for it */
+                    continue;
+                if( !peer->reqfield )
+                    peer->reqfield = tr_bitfieldNew( tor->blockCount );
+                tr_bitfieldAdd( peer->reqfield, i );
+                sendRequest( tor, peer, i );
             }
         }

trunk/libtransmission/peerutils.h

@@ -25 +25 @@
 static void updateInterest( tr_torrent_t * tor, tr_peer_t * peer );
 
-/***********************************************************************
- * peerInit
- ***********************************************************************
- * Allocates a new tr_peer_t and returns a pointer to it.
- **********************************************************************/
-static tr_peer_t * peerInit()
-{
-    tr_peer_t * peer;
-
-    peer              = calloc( sizeof( tr_peer_t ), 1 );
-    peertreeInit( &peer->sentPeers );
-    peer->amChoking   = 1;
-    peer->peerChoking = 1;
-    peer->date        = tr_date();
-    peer->keepAlive   = peer->date;
-    peer->download    = tr_rcInit();
-    peer->upload      = tr_rcInit();
-
-    return peer;
-}
 
 static int peerCmp( tr_peer_t * peer1, tr_peer_t * peer2 )
@@ -190 +170 @@
                                int                   piece )
 {
+    if( tr_cpPieceIsComplete( tor->completion, piece ) ) /* we already have it */
+        return 0;
+
     if( tor->info.pieces[piece].priority == TR_PRI_DND ) /* we don't want it */
         return 0;
@@ -199 +182 @@
         return 0;
 
-    if( tr_cpPieceIsComplete( tor->completion, piece ) ) /* we already have it */
+    return 1;
+}
+
+static int isBlockInteresting( const tr_torrent_t  * tor,
+                               const tr_peer_t     * peer,
+                               int                   block )
+{
+    if( !isPieceInteresting( tor, peer, tr_blockPiece( block ) ) ) /* is piece interesting? */
+        return 0;
+
+    if( tr_cpBlockIsComplete( tor->completion, block )) /* we already have it */
         return 0;
 

trunk/libtransmission/utils.c

@@ -496 +496 @@
     if ( bitfield == NULL ) return 0;
     assert( bit / 8u < bitfield->len );
-    return ( bitfield->bits[ bit/8u ] & bitmask[bit%8] );
+    return ( bitfield->bits[ bit/8u ] & bitmask[bit%8] ) != 0;
 }