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
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
|
/* $OpenBSD: print-ntp.c,v 1.18 2018/07/06 05:47:22 dlg Exp $ */
/*
* Copyright (c) 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997
* 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: (1) source code distributions
* retain the above copyright notice and this paragraph in its entirety, (2)
* distributions including binary code include the above copyright notice and
* this paragraph in its entirety in the documentation or other materials
* provided with the distribution, and (3) all advertising materials mentioning
* features or use of this software display the following acknowledgement:
* ``This product includes software developed by the University of California,
* Lawrence Berkeley Laboratory and its contributors.'' 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 ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*
* Format and print ntp packets.
* By Jeffrey Mogul/DECWRL
* loosely based on print-bootp.c
*/
#include <sys/time.h>
#include <sys/socket.h>
struct mbuf;
struct rtentry;
#include <net/if.h>
#include <netinet/in.h>
#include <netinet/if_ether.h>
#include <ctype.h>
#include <stdio.h>
#include <string.h>
#include "interface.h"
#include "addrtoname.h"
#ifdef MODEMASK
#undef MODEMASK /* Solaris sucks */
#endif
#include "ntp.h"
static void p_sfix(const struct s_fixedpt *);
static void p_ntp_time(const struct l_fixedpt *);
static void p_ntp_delta(const struct l_fixedpt *, const struct l_fixedpt *);
/*
* Print ntp requests
*/
void
ntp_print(const u_char *cp, u_int length)
{
const struct ntpdata *bp;
int mode, version, leapind;
bp = (struct ntpdata *)cp;
/* Note funny sized packets */
if (length != sizeof(struct ntpdata))
(void)printf(" [len=%d]", length);
TCHECK(bp->status);
version = (int)(bp->status & VERSIONMASK) >> 3;
printf("v%d", version);
leapind = bp->status & LEAPMASK;
switch (leapind) {
case NO_WARNING:
break;
case ALARM:
fputs(" alarm", stdout);
break;
case PLUS_SEC:
fputs(" +1s", stdout);
break;
case MINUS_SEC:
fputs(" -1s", stdout);
break;
}
mode = bp->status & MODEMASK;
switch (mode) {
case MODE_UNSPEC: /* unspecified */
fputs(" unspec", stdout);
break;
case MODE_SYM_ACT: /* symmetric active */
fputs(" sym_act", stdout);
break;
case MODE_SYM_PAS: /* symmetric passive */
fputs(" sym_pas", stdout);
break;
case MODE_CLIENT: /* client */
fputs(" client", stdout);
break;
case MODE_SERVER: /* server */
fputs(" server", stdout);
break;
case MODE_BROADCAST: /* broadcast */
fputs(" bcast", stdout);
break;
case MODE_RES1: /* reserved */
fputs(" res1", stdout);
break;
case MODE_RES2: /* reserved */
fputs(" res2", stdout);
break;
}
TCHECK(bp->stratum);
printf(" strat %d", bp->stratum);
TCHECK(bp->ppoll);
printf(" poll %d", bp->ppoll);
/* Can't TCHECK bp->precision bitfield so bp->distance + 0 instead */
TCHECK2(bp->distance, 0);
printf(" prec %d", bp->precision);
if (!vflag)
return;
TCHECK(bp->distance);
fputs(" dist ", stdout);
p_sfix(&bp->distance);
TCHECK(bp->dispersion);
fputs(" disp ", stdout);
p_sfix(&bp->dispersion);
TCHECK(bp->refid);
fputs(" ref ", stdout);
/* Interpretation depends on stratum */
switch (bp->stratum) {
case UNSPECIFIED:
printf("(unspec)");
break;
case PRIM_REF:
fn_printn((u_char *)&bp->refid, sizeof(bp->refid), NULL);
break;
case INFO_QUERY:
printf("%s INFO_QUERY", ipaddr_string(&(bp->refid)));
/* this doesn't have more content */
return;
case INFO_REPLY:
printf("%s INFO_REPLY", ipaddr_string(&(bp->refid)));
/* this is too complex to be worth printing */
return;
default:
printf("%s", ipaddr_string(&(bp->refid)));
break;
}
TCHECK(bp->reftime);
putchar('@');
p_ntp_time(&(bp->reftime));
TCHECK(bp->org);
fputs(" orig ", stdout);
p_ntp_time(&(bp->org));
TCHECK(bp->rec);
fputs(" rec ", stdout);
p_ntp_delta(&(bp->org), &(bp->rec));
TCHECK(bp->xmt);
fputs(" xmt ", stdout);
p_ntp_delta(&(bp->org), &(bp->xmt));
return;
trunc:
fputs(" [|ntp]", stdout);
}
static void
p_sfix(const struct s_fixedpt *sfp)
{
int i;
int f;
float ff;
i = ntohs(sfp->int_part);
f = ntohs(sfp->fraction);
ff = f / 65536.0; /* shift radix point by 16 bits */
f = ff * 1000000.0; /* Treat fraction as parts per million */
printf("%d.%06d", i, f);
}
#define FMAXINT (4294967296.0) /* floating point rep. of MAXINT */
static void
p_ntp_time(const struct l_fixedpt *lfp)
{
int32_t i;
u_int32_t uf;
u_int32_t f;
float ff;
i = ntohl(lfp->int_part);
uf = ntohl(lfp->fraction);
ff = uf;
if (ff < 0.0) /* some compilers are buggy */
ff += FMAXINT;
ff = ff / FMAXINT; /* shift radix point by 32 bits */
f = ff * 1000000000.0; /* treat fraction as parts per billion */
printf("%u.%09d", i, f);
}
/* Prints time difference between *lfp and *olfp */
static void
p_ntp_delta(const struct l_fixedpt *olfp, const struct l_fixedpt *lfp)
{
int32_t i;
u_int32_t uf;
u_int32_t ouf;
u_int32_t f;
float ff;
int signbit;
i = ntohl(lfp->int_part) - ntohl(olfp->int_part);
uf = ntohl(lfp->fraction);
ouf = ntohl(olfp->fraction);
if (i > 0) { /* new is definitely greater than old */
signbit = 0;
f = uf - ouf;
if (ouf > uf) /* must borrow from high-order bits */
i -= 1;
} else if (i < 0) { /* new is definitely less than old */
signbit = 1;
f = ouf - uf;
if (uf > ouf) /* must carry into the high-order bits */
i += 1;
i = -i;
} else { /* int_part is zero */
if (uf > ouf) {
signbit = 0;
f = uf - ouf;
} else {
signbit = 1;
f = ouf - uf;
}
}
ff = f;
if (ff < 0.0) /* some compilers are buggy */
ff += FMAXINT;
ff = ff / FMAXINT; /* shift radix point by 32 bits */
f = ff * 1000000000.0; /* treat fraction as parts per billion */
if (signbit)
putchar('-');
else
putchar('+');
printf("%d.%09d", i, f);
}
|
