timed.h (2cca9f8f681f640ab25c82bfc46f10f4a352e412) timed.h (59deaec541ae8baaa58daf6c5a2196ea7de180c3)
1/*
2 * Copyright (c) 1983, 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.
1/*
2 * Copyright (c) 1983, 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. Neither the name of the University nor the names of its contributors
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
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 *
29 * @(#)timed.h 8.1 (Berkeley) 6/2/93
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 * @(#)timed.h 8.1 (Berkeley) 6/2/93
30 *
31 * $FreeBSD$
32 */
33
34 */
35
34#ifndef _PROTOCOLS_TIMED_H_
35#define _PROTOCOLS_TIMED_H_
36#ifndef _TIMED_H_
37#define _TIMED_H_
36
37/*
38 * Time Synchronization Protocol
39 */
40
41#define TSPVERSION 1
42#define ANYADDR NULL
43
44struct tsp {
38
39/*
40 * Time Synchronization Protocol
41 */
42
43#define TSPVERSION 1
44#define ANYADDR NULL
45
46struct tsp {
45 u_int8_t tsp_type;
46 u_int8_t tsp_vers;
47 u_int16_t tsp_seq;
47 u_char tsp_type;
48 u_char tsp_vers;
49 u_short tsp_seq;
48 union {
50 union {
49 struct {
50 int32_t tv_sec;
51 int32_t tv_usec;
52 } tspu_time;
51 struct timeval tspu_time;
53 char tspu_hopcnt;
54 } tsp_u;
55 char tsp_name[MAXHOSTNAMELEN];
56};
57
58#define tsp_time tsp_u.tspu_time
59#define tsp_hopcnt tsp_u.tspu_hopcnt
52 char tspu_hopcnt;
53 } tsp_u;
54 char tsp_name[MAXHOSTNAMELEN];
55};
56
57#define tsp_time tsp_u.tspu_time
58#define tsp_hopcnt tsp_u.tspu_hopcnt
60
59
61/*
62 * Command types.
63 */
64#define TSP_ANY 0 /* match any types */
65#define TSP_ADJTIME 1 /* send adjtime */
66#define TSP_ACK 2 /* generic acknowledgement */
60/*
61 * Command types.
62 */
63#define TSP_ANY 0 /* match any types */
64#define TSP_ADJTIME 1 /* send adjtime */
65#define TSP_ACK 2 /* generic acknowledgement */
67#define TSP_MASTERREQ 3 /* ask for master's name */
66#define TSP_MASTERREQ 3 /* ask for master's name */
68#define TSP_MASTERACK 4 /* acknowledge master request */
69#define TSP_SETTIME 5 /* send network time */
70#define TSP_MASTERUP 6 /* inform slaves that master is up */
71#define TSP_SLAVEUP 7 /* slave is up but not polled */
72#define TSP_ELECTION 8 /* advance candidature for master */
73#define TSP_ACCEPT 9 /* support candidature of master */
74#define TSP_REFUSE 10 /* reject candidature of master */
75#define TSP_CONFLICT 11 /* two or more masters present */

--- 9 unchanged lines hidden (view full) ---

85#define TSP_TEST 21 /* for testing election algo */
86#define TSP_SETDATE 22 /* New from date command */
87#define TSP_SETDATEREQ 23 /* New remote for above */
88#define TSP_LOOP 24 /* loop detection packet */
89
90#define TSPTYPENUMBER 25
91
92#ifdef TSPTYPES
67#define TSP_MASTERACK 4 /* acknowledge master request */
68#define TSP_SETTIME 5 /* send network time */
69#define TSP_MASTERUP 6 /* inform slaves that master is up */
70#define TSP_SLAVEUP 7 /* slave is up but not polled */
71#define TSP_ELECTION 8 /* advance candidature for master */
72#define TSP_ACCEPT 9 /* support candidature of master */
73#define TSP_REFUSE 10 /* reject candidature of master */
74#define TSP_CONFLICT 11 /* two or more masters present */

--- 9 unchanged lines hidden (view full) ---

84#define TSP_TEST 21 /* for testing election algo */
85#define TSP_SETDATE 22 /* New from date command */
86#define TSP_SETDATEREQ 23 /* New remote for above */
87#define TSP_LOOP 24 /* loop detection packet */
88
89#define TSPTYPENUMBER 25
90
91#ifdef TSPTYPES
93const char *tsptype[TSPTYPENUMBER] =
94 { "ANY", "ADJTIME", "ACK", "MASTERREQ", "MASTERACK", "SETTIME", "MASTERUP",
95 "SLAVEUP", "ELECTION", "ACCEPT", "REFUSE", "CONFLICT", "RESOLVE", "QUIT",
92char *tsptype[TSPTYPENUMBER] =
93 { "ANY", "ADJTIME", "ACK", "MASTERREQ", "MASTERACK", "SETTIME", "MASTERUP",
94 "SLAVEUP", "ELECTION", "ACCEPT", "REFUSE", "CONFLICT", "RESOLVE", "QUIT",
96 "DATE", "DATEREQ", "DATEACK", "TRACEON", "TRACEOFF", "MSITE", "MSITEREQ",
97 "TEST", "SETDATE", "SETDATEREQ", "LOOP" };
98#endif
99
100#endif /* !_TIMED_H_ */
95 "DATE", "DATEREQ", "DATEACK", "TRACEON", "TRACEOFF", "MSITE", "MSITEREQ",
96 "TEST", "SETDATE", "SETDATEREQ", "LOOP" };
97#endif
98
99#endif /* !_TIMED_H_ */