libT: first cut at implementing the internal peers' request queues as pieces rather than blocks, as discussed with erdgeist and denis, to avoid a couple of nasty CPU bottlenecks.

libtransmission/utils.h

@@ -263,12 +263,14 @@ size_t tr_bitfieldCountTrueBits( const tr_bitfield* );
 
 tr_bitfield* tr_bitfieldOr( tr_bitfield*, const tr_bitfield* );
 
+#if 0
 /** @brief finds the first true bit in the bitfield, starting at `startPos'
     @param setmePos the position of the true bit, if found, is set here.
     @return nonzero if a true bit was found */
 int tr_bitfieldFindTrue( const tr_bitfield  * bitfield,
                          size_t               startPos,
                          size_t             * setmePos );
+#endif
 
 
 /** A stripped-down version of bitfieldHas to be used