Lines Matching refs:nlist
1798 int nlist, nl3;
1832 nlist = 0;
1834 nlist += peer_hash_count[n];
1835 if (nlist > list_alloc) {
1841 while (list_alloc < nlist) {
1862 nlist = nl3 = 0; /* none yet */
1910 peer_list[nlist++] = peer;
1976 * Here, nlist is the number of candidates and allow is the
1983 for (allow = 0; 2 * allow < nlist; allow++) {
1995 if (n >= nlist - allow)
2004 if (n >= nlist - allow)
2039 for (i = 0; i < nlist; i++) {
2041 if (nlist > 1 && (peer->offset <= low || peer->offset >=
2076 nlist = j;
2084 if (nlist == 0) {
2088 nlist = 1;
2092 nlist = 1;
2112 if (nlist < sys_minsane)
2115 for (i = 0; i < nlist; i++)
2131 for (i = 0; i < nlist; i++) {
2135 if (nlist > 1) {
2136 for (j = 0; j < nlist; j++)
2139 f = SQRT(f / (nlist - 1));
2148 if (nlist <= sys_minclock || f <= d ||
2157 for (j = k + 1; j < nlist; j++) {
2161 nlist--;
2176 for (i = 0; i < nlist; i++) {
2281 clock_combine(peer_list, nlist);