1/*-
2 * Copyright (c) 1985, 1993
3 *	The Regents of the University of California.  All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 *    notice, this list of conditions and the following disclaimer in the
12 *    documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 *    must display the following acknowledgement:
15 *	This product includes software developed by the University of
16 *	California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 *    may be used to endorse or promote products derived from this software
19 *    without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 *
33 *	@(#)globals.h	8.1 (Berkeley) 6/6/93
34 *	$FreeBSD: src/usr.sbin/timed/timed/globals.h,v 1.7 2007/01/20 08:24:02 maxim Exp $
35 */
36
37#include <sys/param.h>
38#include <sys/time.h>
39#include <sys/socket.h>
40
41#include <netinet/in.h>
42#include <arpa/inet.h>
43
44#include <err.h>
45#include <errno.h>
46#include <limits.h>
47#include <netdb.h>
48#include <stdio.h>
49#include <stdlib.h>
50#include <string.h>
51#include <syslog.h>
52#include <unistd.h>
53
54#include <protocols/timed.h>
55#define	SECHR	(60*60)
56#define	SECDAY	(24*SECHR)
57
58extern int sock;
59
60/* Best expected round trip for a measurement.
61 * This is essentially the number of milliseconds per CPU tick (CLK_TCK?).
62 * All delays shorter than this are usually reported as 0.
63 */
64#define MIN_ROUND ((1000-1)/CLK_TCK)
65
66
67#define SAMPLEINTVL	240		/* synch() freq for master in sec */
68#define	MAXADJ		20		/* max adjtime() correction in sec */
69
70#define MAX_TRIM	3000000		/* max drift in nsec/sec, 0.3% */
71#define BIG_ADJ		(MAX_TRIM/1000*SAMPLEINTVL*2)	/* max good adj */
72
73#define MINTOUT		360		/* election delays, 6-15 minutes */
74#define MAXTOUT		900
75
76#define BAD_STATUS	(-1)
77#define GOOD		1
78#define UNREACHABLE	2
79#define NONSTDTIME	3
80#define HOSTDOWN	0x7fffffff
81
82#define OFF		0
83#define ON		1
84
85#define MAX_HOPCNT	10		/* max value for tsp_hpcnt */
86
87#define LOSTHOST	3		/* forget after this many failures */
88
89#define VALID_RANGE (MAXADJ*1000)	/* good times in milliseconds */
90#define GOOD_RANGE (MIN_ROUND*2)
91#define VGOOD_RANGE (MIN_ROUND-1)
92
93
94/*
95 * Global and per-network states.
96 */
97#define NOMASTER	0		/* no good master */
98#define SLAVE		1
99#define MASTER		2
100#define IGNORE		4
101#define ALL		(SLAVE|MASTER|IGNORE)
102#define SUBMASTER	(SLAVE|MASTER)
103
104#define NHOSTS		1013		/* max of hosts controlled by timed
105					 * This must be a prime number.
106					 */
107struct hosttbl {
108	struct	hosttbl *h_bak;		/* hash chain */
109	struct	hosttbl *h_fwd;
110	struct  hosttbl *l_bak;		/* "sequential" list */
111	struct  hosttbl *l_fwd;
112	struct	netinfo *ntp;
113	struct	sockaddr_in addr;
114	char	name[MAXHOSTNAMELEN];
115	u_char	head;			/* 1=head of hash chain */
116	u_char	good;			/* 0=trusted host, for averaging */
117	u_char	noanswer;		/* count of failures to answer */
118	u_char	need_set;		/* need a SETTIME */
119	u_short seq;
120	long	delta;
121};
122
123/* closed hash table with internal chaining */
124extern struct hosttbl hosttbl[NHOSTS+1];
125#define self hosttbl[0]
126#define hostname (self.name)
127
128
129struct netinfo {
130	struct	netinfo *next;
131	struct	in_addr net;
132	u_int32_t	mask;
133	struct	in_addr my_addr;
134	struct	sockaddr_in dest_addr;	/* broadcast addr or point-point */
135	long	status;
136	struct timeval slvwait;		/* delay before sending our time */
137	int	quit_count;		/* recent QUITs */
138};
139
140#include "extern.h"
141
142#define tvtomsround(tv) ((tv).tv_sec*1000 + ((tv).tv_usec + 500)/1000)
143
144extern struct netinfo *nettab;
145extern int status;
146extern int trace;
147extern int sock;
148extern struct sockaddr_in from;
149extern struct timeval from_when;	/* when the last msg arrived */
150extern u_short sequence;		/* TSP message sequence number */
151extern struct netinfo *fromnet, *slavenet;
152extern FILE *fd;
153extern long delay1, delay2;
154extern int nslavenets;			/* nets were I could be a slave */
155extern int nmasternets;			/* nets were I could be a master */
156extern int nignorednets;		/* ignored nets */
157extern int nnets;			/* nets I am connected to */
158
159
160#define trace_msg(msg)		{if (trace) fprintf(fd, msg);}
161
162#define trace_sendto_err(addr) {					\
163	int st_errno = errno;						\
164	syslog(LOG_ERR, "%s %d: sendto %s: %m",				\
165		__FILE__, __LINE__, inet_ntoa(addr));			\
166	if (trace)							\
167		fprintf(fd, "%s %d: sendto %s: %d", __FILE__, __LINE__,	\
168			inet_ntoa(addr), st_errno);			\
169}
170
171
172# define max(a,b) 	(a<b ? b : a)
173# define min(a,b) 	(a>b ? b : a)
174# define abs(x)		(x>=0 ? x : -(x))
175