Lines Matching refs:candidates
112 * which ones would make good candidates for connecting to, and to watch out
3867 checkPartition( const struct peer_candidate * candidates, int left, int right, uint64_t pivotScore, int storeIndex )
3873 assert( candidates[storeIndex].score == pivotScore );
3876 assert( candidates[i].score < pivotScore );
3878 assert( candidates[i].score >= pivotScore );
3887 partitionPeerCandidates( struct peer_candidate * candidates, int left, int right, int pivotIndex )
3892 const struct peer_candidate pivotValue = candidates[pivotIndex];
3895 tmp = candidates[right];
3896 candidates[right] = pivotValue;
3897 candidates[pivotIndex] = tmp;
3902 if( candidates[i].score < pivotValue.score )
3904 tmp = candidates[storeIndex];
3905 candidates[storeIndex] = candidates[i];
3906 candidates[i] = tmp;
3912 tmp = candidates[right];
3913 candidates[right] = candidates[storeIndex];
3914 candidates[storeIndex] = tmp;
3917 assert( checkPartition( candidates, left, right, pivotValue.score, storeIndex ) );
3924 selectPeerCandidates( struct peer_candidate * candidates, int left, int right, int k )
3930 int pivotNewIndex = partitionPeerCandidates( candidates, left, right, pivotIndex );
3933 selectPeerCandidates( candidates, left, pivotNewIndex-1, k );
3935 selectPeerCandidates( candidates, pivotNewIndex+1, right, k+left-pivotNewIndex-1 );
3941 checkBestScoresComeFirst( const struct peer_candidate * candidates, int n, int k )
3948 if( worstFirstScore < candidates[i].score )
3949 worstFirstScore = candidates[i].score;
3952 assert( candidates[i].score <= worstFirstScore );
3955 assert( candidates[i].score >= worstFirstScore );
3968 struct peer_candidate * candidates;
3990 /* allocate an array of candidates */
3991 walk = candidates = tr_new( struct peer_candidate, atomCount );
4027 *candidateCount = walk - candidates;
4028 if( walk != candidates )
4029 selectPeerCandidates( candidates, 0, (walk-candidates)-1, max );
4031 assert( checkBestScoresComeFirst( candidates, *candidateCount, max ) );
4033 return candidates;
4107 struct peer_candidate * candidates;
4109 candidates = getPeerCandidates( mgr->session, &n, max );
4112 initiateCandidateConnection( mgr, &candidates[i] );
4114 tr_free( candidates );