Lines Matching refs:nlist
3439 int nlist, nl2;
3482 nlist = 1;
3484 nlist++;
3485 endpoint_size = ALIGNED_SIZE(nlist * 2 * sizeof(*endpoint));
3486 peers_size = ALIGNED_SIZE(nlist * sizeof(*peers));
3487 indx_size = ALIGNED_SIZE(nlist * 2 * sizeof(*indx));
3503 nlist = nl2 = 0; /* none yet */
3601 peers[nlist].peer = peer;
3602 peers[nlist].error = peer->jitter;
3603 peers[nlist].synch = f;
3604 nlist++;
3662 * Here, nlist is the number of candidates and allow is the
3669 for (allow = 0; 2 * allow < nlist; allow++) {
3679 if (n >= nlist - allow)
3686 if (n >= nlist - allow)
3712 for (i = 0; i < nlist; i++) {
3741 nlist = j;
3749 if (nlist == 0) {
3755 nlist = 1;
3758 nlist = 1;
3763 nlist = 1;
3766 nlist = 1;
3773 for (i = 0; i < nlist; i++) {
3792 for (i = 0; i < nlist; i++) {
3796 if (nlist > 1) {
3798 for (j = 0; j < nlist; j++)
3801 peers[i].seljit = SQRT(f / (nlist - 1));
3810 if ( nlist <= max(1, sys_minclock)
3817 if (nlist > sys_maxclock)
3819 for (j = k + 1; j < nlist; j++)
3821 nlist--;
3852 for (i = 0; i < nlist; i++) {
3859 leap_vote_ins = nlist;
3860 else if (leap_vote_ins < nlist)
3865 leap_vote_del = nlist;
3866 else if (leap_vote_del < nlist)
3886 if (nlist > 0 && nlist >= sys_minsane) {