Lines Matching defs:nlist
2225 int nlist, nl3;
2262 nlist = 0;
2264 nlist += peer_hash_count[n];
2265 if (nlist > list_alloc) {
2271 while (list_alloc < nlist) {
2292 nlist = nl3 = 0; /* none yet */
2347 peer_list[nlist++] = peer;
2413 * Here, nlist is the number of candidates and allow is the
2420 for (allow = 0; 2 * allow < nlist; allow++) {
2432 if (n >= nlist - allow)
2441 if (n >= nlist - allow)
2475 for (i = 0; i < nlist; i++) {
2477 if (nlist > 1 && (peer->offset <= low || peer->offset >=
2519 nlist = j;
2527 if (nlist == 0) {
2533 nlist = 1;
2536 nlist = 1;
2541 nlist = 1;
2548 for (i = 0; i < nlist; i++) {
2571 for (i = 0; i < nlist; i++) {
2575 if (nlist > 1) {
2576 for (j = 0; j < nlist; j++)
2579 f = SQRT(f / (nlist - 1));
2588 if (nlist <= sys_minsane || nlist <= sys_minclock) {
2602 if (nlist > sys_maxclock)
2604 for (j = k + 1; j < nlist; j++) {
2609 nlist--;
2624 for (i = 0; i < nlist; i++) {
2631 leap_vote = nlist;
2646 if (nlist > 0 && nlist >= sys_minsane) {