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 */ 35 36 #ifdef sgi 37 #ident "$Revision: 1.1.1.2 $" 38 #endif 39 40 #include <sys/param.h> 41 #include <sys/time.h> 42 #include <sys/socket.h> 43 44 #include <netinet/in.h> 45 #include <arpa/inet.h> 46 47 #include <errno.h> 48 #include <limits.h> 49 #include <netdb.h> 50 #include <stdio.h> 51 #include <stdlib.h> 52 #include <string.h> 53 #include <syslog.h> 54 #include <syslog.h> 55 #include <unistd.h> 56 57 #include <protocols/timed.h> 58 #ifdef sgi 59 #include <bstring.h> 60 #include <sys/clock.h> 61 /* use the constant HZ instead of the function CLK_TCK */ 62 #undef CLK_TCK 63 #define CLK_TCK HZ 64 #else 65 #define SECHR (60*60) 66 #define SECDAY (24*SECHR) 67 #endif /* sgi */ 68 69 extern int errno; 70 extern int sock; 71 72 /* Best expected round trip for a measurement. 73 * This is essentially the number of milliseconds per CPU tick (CLK_TCK?). 74 * All delays shorter than this are usually reported as 0. 75 */ 76 #define MIN_ROUND ((1000-1)/CLK_TCK) 77 78 79 #define SAMPLEINTVL 240 /* synch() freq for master in sec */ 80 #define MAXADJ 20 /* max adjtime() correction in sec */ 81 82 #define MAX_TRIM 3000000 /* max drift in nsec/sec, 0.3% */ 83 #define BIG_ADJ (MAX_TRIM/1000*SAMPLEINTVL*2) /* max good adj */ 84 85 #define MINTOUT 360 /* election delays, 6-15 minutes */ 86 #define MAXTOUT 900 87 88 #define BAD_STATUS (-1) 89 #define GOOD 1 90 #define UNREACHABLE 2 91 #define NONSTDTIME 3 92 #define HOSTDOWN 0x7fffffff 93 94 #define OFF 0 95 #define ON 1 96 97 #define MAX_HOPCNT 10 /* max value for tsp_hpcnt */ 98 99 #define LOSTHOST 3 /* forget after this many failures */ 100 101 #define VALID_RANGE (MAXADJ*1000) /* good times in milliseconds */ 102 #define GOOD_RANGE (MIN_ROUND*2) 103 #define VGOOD_RANGE (MIN_ROUND-1) 104 105 106 /* 107 * Global and per-network states. 108 */ 109 #define NOMASTER 0 /* no good master */ 110 #define SLAVE 1 111 #define MASTER 2 112 #define IGNORE 4 113 #define ALL (SLAVE|MASTER|IGNORE) 114 #define SUBMASTER (SLAVE|MASTER) 115 116 #define NHOSTS 1013 /* max of hosts controlled by timed 117 * This must be a prime number. 118 */ 119 struct hosttbl { 120 struct hosttbl *h_bak; /* hash chain */ 121 struct hosttbl *h_fwd; 122 struct hosttbl *l_bak; /* "sequential" list */ 123 struct hosttbl *l_fwd; 124 struct netinfo *ntp; 125 struct sockaddr_in addr; 126 char name[MAXHOSTNAMELEN+1]; 127 u_char head; /* 1=head of hash chain */ 128 u_char good; /* 0=trusted host, for averaging */ 129 u_char noanswer; /* count of failures to answer */ 130 u_char need_set; /* need a SETTIME */ 131 u_short seq; 132 long delta; 133 }; 134 135 /* closed hash table with internal chaining */ 136 extern struct hosttbl hosttbl[NHOSTS+1]; 137 #define self hosttbl[0] 138 #define hostname (self.name) 139 140 141 struct netinfo { 142 struct netinfo *next; 143 struct in_addr net; 144 u_long mask; 145 struct in_addr my_addr; 146 struct sockaddr_in dest_addr; /* broadcast addr or point-point */ 147 long status; 148 struct timeval slvwait; /* delay before sending our time */ 149 int quit_count; /* recent QUITs */ 150 }; 151 152 #include "extern.h" 153 154 #define tvtomsround(tv) ((tv).tv_sec*1000 + ((tv).tv_usec + 500)/1000) 155 156 extern struct netinfo *nettab; 157 extern int status; 158 extern int trace; 159 extern int sock; 160 extern struct sockaddr_in from; 161 extern struct timeval from_when; /* when the last msg arrived */ 162 extern u_short sequence; /* TSP message sequence number */ 163 extern struct netinfo *fromnet, *slavenet; 164 extern FILE *fd; 165 extern long delay1, delay2; 166 extern int nslavenets; /* nets were I could be a slave */ 167 extern int nmasternets; /* nets were I could be a master */ 168 extern int nignorednets; /* ignored nets */ 169 extern int nnets; /* nets I am connected to */ 170 171 172 #define trace_msg(msg) {if (trace) fprintf(fd, msg);} 173 174 #define trace_sendto_err(addr) { \ 175 int st_errno = errno; \ 176 syslog(LOG_ERR, "%s %d: sendto %s: %m", \ 177 __FILE__, __LINE__, inet_ntoa(addr)); \ 178 if (trace) \ 179 fprintf(fd, "%s %d: sendto %s: %d", __FILE__, __LINE__, \ 180 inet_ntoa(addr), st_errno); \ 181 } 182 183 184 # define max(a,b) (a<b ? b : a) 185 # define min(a,b) (a>b ? b : a) 186 # define abs(x) (x>=0 ? x : -(x)) 187