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
|
/*-
* 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.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 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.
*
* @(#)globals.h 8.1 (Berkeley) 6/6/93
*/
#ifdef sgi
#ident "$Revision: 1.15 $"
#endif
#include <sys/param.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <errno.h>
#include <limits.h>
#include <netdb.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <syslog.h>
#include <syslog.h>
#include <unistd.h>
#include <protocols/timed.h>
#ifdef sgi
#include <bstring.h>
#include <sys/clock.h>
/* use the constant HZ instead of the function CLK_TCK */
#undef CLK_TCK
#define CLK_TCK HZ
#else
#define SECHR (60*60)
#define SECDAY (24*SECHR)
#endif /* sgi */
extern int errno;
extern int sock;
/* Best expected round trip for a measurement.
* This is essentially the number of milliseconds per CPU tick (CLK_TCK?).
* All delays shorter than this are usually reported as 0.
*/
#define MIN_ROUND ((1000-1)/CLK_TCK)
#define SAMPLEINTVL 240 /* synch() freq for master in sec */
#define MAXADJ 20 /* max adjtime() correction in sec */
#define MAX_TRIM 3000000 /* max drift in nsec/sec, 0.3% */
#define BIG_ADJ (MAX_TRIM/1000*SAMPLEINTVL*2) /* max good adj */
#define MINTOUT 360 /* election delays, 6-15 minutes */
#define MAXTOUT 900
#define BAD_STATUS (-1)
#define GOOD 1
#define UNREACHABLE 2
#define NONSTDTIME 3
#define HOSTDOWN 0x7fffffff
#define OFF 0
#define ON 1
#define MAX_HOPCNT 10 /* max value for tsp_hpcnt */
#define LOSTHOST 3 /* forget after this many failures */
#define VALID_RANGE (MAXADJ*1000) /* good times in milliseconds */
#define GOOD_RANGE (MIN_ROUND*2)
#define VGOOD_RANGE (MIN_ROUND-1)
/*
* Global and per-network states.
*/
#define NOMASTER 0 /* no good master */
#define SLAVE 1
#define MASTER 2
#define IGNORE 4
#define ALL (SLAVE|MASTER|IGNORE)
#define SUBMASTER (SLAVE|MASTER)
#define NHOSTS 1013 /* max of hosts controlled by timed
* This must be a prime number.
*/
struct hosttbl {
struct hosttbl *h_bak; /* hash chain */
struct hosttbl *h_fwd;
struct hosttbl *l_bak; /* "sequential" list */
struct hosttbl *l_fwd;
struct netinfo *ntp;
struct sockaddr_in addr;
char name[MAXHOSTNAMELEN+1];
u_char head; /* 1=head of hash chain */
u_char good; /* 0=trusted host, for averaging */
u_char noanswer; /* count of failures to answer */
u_char need_set; /* need a SETTIME */
u_short seq;
long delta;
};
/* closed hash table with internal chaining */
extern struct hosttbl hosttbl[NHOSTS+1];
#define self hosttbl[0]
#define hostname (self.name)
struct netinfo {
struct netinfo *next;
struct in_addr net;
u_long mask;
struct in_addr my_addr;
struct sockaddr_in dest_addr; /* broadcast addr or point-point */
long status;
struct timeval slvwait; /* delay before sending our time */
int quit_count; /* recent QUITs */
};
#include "extern.h"
#define tvtomsround(tv) ((tv).tv_sec*1000 + ((tv).tv_usec + 500)/1000)
extern struct netinfo *nettab;
extern int status;
extern int trace;
extern int sock;
extern struct sockaddr_in from;
extern struct timeval from_when; /* when the last msg arrived */
extern u_short sequence; /* TSP message sequence number */
extern struct netinfo *fromnet, *slavenet;
extern FILE *fd;
extern long delay1, delay2;
extern int nslavenets; /* nets were I could be a slave */
extern int nmasternets; /* nets were I could be a master */
extern int nignorednets; /* ignored nets */
extern int nnets; /* nets I am connected to */
#define trace_msg(msg) {if (trace) fprintf(fd, msg);}
#define trace_sendto_err(addr) { \
int st_errno = errno; \
syslog(LOG_ERR, "%s %d: sendto %s: %m", \
__FILE__, __LINE__, inet_ntoa(addr)); \
if (trace) \
fprintf(fd, "%s %d: sendto %s: %d", __FILE__, __LINE__, \
inet_ntoa(addr), st_errno); \
}
# define max(a,b) (a<b ? b : a)
# define min(a,b) (a>b ? b : a)
# define abs(x) (x>=0 ? x : -(x))
|