assert( n == t->pieceReplicationSize );
assert( tr_bitfieldTestFast( b, n-1 ) );
- if( tr_bitfieldTestFast( b, n-1 ) )
- for( i=0; i<n; ++i )
- if( tr_bitfieldHasFast( b, i ) )
- ++rep[i];
+ for( i=0; i<n; ++i )
+ if( tr_bitfieldHas( b, i ) )
+ ++rep[i];
if( t->pieceSortState == PIECES_SORTED_BY_WEIGHT )
invalidatePieceSorting( t );
{
const tr_bitfield * const b = &bitset->bitfield;
- if( tr_bitfieldTestFast( b, n-1 ) )
- for( i=0; i<n; ++i )
- if( tr_bitfieldHasFast( b, i ) )
- --t->pieceReplication[i];
+ for( i=0; i<n; ++i )
+ if( tr_bitfieldHas( b, i ) )
+ --t->pieceReplication[i];
if( t->pieceSortState == PIECES_SORTED_BY_WEIGHT )
invalidatePieceSorting( t );