Lines Matching defs:piece
59 /* how frequently to age out old piece request lists */
208 /* An array of pieceCount items stating how many peers have each piece.
1096 struct weighted_piece * piece = pieces + i;
1097 piece->index = pool[i];
1098 piece->requestCount = 0;
1099 piece->salt = tr_cryptoWeakRandInt( 4096 );
1136 pieceListRemovePiece( Torrent * t, tr_piece_index_t piece )
1140 if(( p = pieceListLookup( t, piece )))
1226 * Increase the replication count of this piece and sort it if the
1227 * piece list is already sorted
1235 /* One more replication of this piece is present in the swarm */
1238 /* we only resort the piece if the list is already sorted */
1264 * Increase the replication count of every piece
1359 /* if the peer has this piece that we want... */
1433 /* not enough requests || last piece modified */
1448 const struct weighted_piece piece = t->pieces[i];
1452 t->pieces[i + newpos] = piece;
1578 /* is this a valid piece? */
1594 /* request the blocks that we don't have in this piece */
1800 tordbg( t, "[LAZY] checked just-completed piece %zu", (size_t)p );
2249 tordbg( t, "peer %s contributed to corrupt piece (%d); now has %d strikes",
2567 const int piece = i * interval;
2569 if( isSeed || tr_cpPieceIsComplete( &tor->completion, piece ) )
2574 if( tr_bitfieldHas( &peers[j]->have, piece ) )
3233 /* disconnect if it's been too long since piece data has been transferred.
3246 /*fprintf( stderr, "strictness is %.3f, limit is %d seconds... time since connect is %d, time since piece is %d ... idleTime is %d, doPurge is %d\n", (double)strictness, limit, (int)(now - atom->time), (int)(now - atom->piece_data_time), idleTime, idleTime > limit );*/
3283 /* if we were recently connected to this peer and transferring piece
3343 /* if we transferred piece data, then they might be good peers,
3673 /* primary key: the last piece data time *if* it was within the last hour */