1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
|
/*-
* Copyright (c) 1985, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifndef lint
#if 0
static char sccsid[] = "@(#)networkdelta.c 8.1 (Berkeley) 6/6/93";
#endif
static const char rcsid[] =
"$FreeBSD$";
#endif /* not lint */
#include "globals.h"
static long median(float, float *, long *, long *, unsigned int);
/*
* Compute a corrected date.
* Compute the median of the reasonable differences. First compute
* the median of all authorized differences, and then compute the
* median of all differences that are reasonably close to the first
* median.
*
* This differs from the original BSD implementation, which looked for
* the largest group of machines with essentially the same date.
* That assumed that machines with bad clocks would be uniformly
* distributed. Unfortunately, in real life networks, the distribution
* of machines is not uniform among models of machines, and the
* distribution of errors in clocks tends to be quite consistent
* for a given model. In other words, all model VI Supre Servres
* from GoFast Inc. tend to have about the same error.
* The original BSD implementation would chose the clock of the
* most common model, and discard all others.
*
* Therefore, get best we can do is to try to average over all
* of the machines in the network, while discarding "obviously"
* bad values.
*/
long
networkdelta(void)
{
struct hosttbl *htp;
long med;
long lodelta, hidelta;
long logood, higood;
long x[NHOSTS];
long *xp;
int numdelta;
float eps;
/*
* compute the median of the good values
*/
med = 0;
numdelta = 1;
xp = &x[0];
*xp = 0; /* account for ourself */
for (htp = self.l_fwd; htp != &self; htp = htp->l_fwd) {
if (htp->good
&& htp->noanswer == 0
&& htp->delta != HOSTDOWN) {
med += htp->delta;
numdelta++;
*++xp = htp->delta;
}
}
/*
* If we are the only trusted time keeper, then do not change our
* clock. There may be another time keeping service active.
*/
if (numdelta == 1)
return 0;
med /= numdelta;
eps = med - x[0];
if (trace)
fprintf(fd, "median of %d values starting at %ld is about ",
numdelta, med);
med = median(med, &eps, &x[0], xp+1, VALID_RANGE);
/*
* compute the median of all values near the good median
*/
hidelta = med + GOOD_RANGE;
lodelta = med - GOOD_RANGE;
higood = med + VGOOD_RANGE;
logood = med - VGOOD_RANGE;
xp = &x[0];
htp = &self;
do {
if (htp->noanswer == 0
&& htp->delta >= lodelta
&& htp->delta <= hidelta
&& (htp->good
|| (htp->delta >= logood
&& htp->delta <= higood))) {
*xp++ = htp->delta;
}
} while (&self != (htp = htp->l_fwd));
if (xp == &x[0]) {
if (trace)
fprintf(fd, "nothing close to median %ld\n", med);
return med;
}
if (xp == &x[1]) {
if (trace)
fprintf(fd, "only value near median is %ld\n", x[0]);
return x[0];
}
if (trace)
fprintf(fd, "median of %td values starting at %ld is ",
xp-&x[0], med);
return median(med, &eps, &x[0], xp, 1);
}
/*
* compute the median of an array of signed integers, using the idea
* in <<Numerical Recipes>>.
*/
static long
median(float a, float *eps_ptr, long *x, long *xlim, unsigned int gnuf)
/* float a; */ /* initial guess for the median */
/* float *eps_ptr; */ /* spacing near the median */
/* long *x, *xlim; */ /* the data */
/* unsigned int gnuf; */ /* good enough estimate */
{
long *xptr;
float ap = (float)LONG_MAX; /* bounds on the median */
float am = -(float)LONG_MAX;
float aa;
int npts; /* # of points above & below guess */
float xp; /* closet point above the guess */
float xm; /* closet point below the guess */
float eps;
float dum, sum, sumx;
int pass;
#define AMP 1.5 /* smoothing constants */
#define AFAC 1.5
eps = *eps_ptr;
if (eps < 1.0) {
eps = -eps;
if (eps < 1.0)
eps = 1.0;
}
for (pass = 1; ; pass++) { /* loop over the data */
sum = 0.0;
sumx = 0.0;
npts = 0;
xp = (float)LONG_MAX;
xm = -(float)LONG_MAX;
for (xptr = x; xptr != xlim; xptr++) {
float xx = *xptr;
dum = xx - a;
if (dum != 0.0) { /* avoid dividing by 0 */
if (dum > 0.0) {
npts++;
if (xx < xp)
xp = xx;
} else {
npts--;
if (xx > xm)
xm = xx;
dum = -dum;
}
dum = 1.0/(eps + dum);
sum += dum;
sumx += xx * dum;
}
}
if (ap-am < gnuf || sum == 0) {
if (trace)
fprintf(fd,
"%ld in %d passes; early out balance=%d\n",
(long)a, pass, npts);
return a; /* guess was good enough */
}
aa = (sumx/sum-a)*AMP;
if (npts >= 2) { /* guess was too low */
am = a;
aa = xp + max(0.0, aa);
if (aa > ap)
aa = (a + ap)/2;
} else if (npts <= -2) { /* guess was two high */
ap = a;
aa = xm + min(0.0, aa);
if (aa < am)
aa = (a + am)/2;
} else {
break; /* got it */
}
if (a == aa) {
if (trace)
fprintf(fd,
"%ld in %d passes; force out balance=%d\n",
(long)a, pass, npts);
return a;
}
eps = AFAC*abs(aa - a);
*eps_ptr = eps;
a = aa;
}
if (((x - xlim) % 2) != 0) { /* even number of points? */
if (npts == 0) /* yes, return an average */
a = (xp+xm)/2;
else if (npts > 0)
a = (a+xp)/2;
else
a = (xm+a)/2;
} else if (npts != 0) { /* odd number of points */
if (npts > 0)
a = xp;
else
a = xm;
}
if (trace)
fprintf(fd, "%ld in %d passes\n", (long)a, pass);
return a;
}
|
