12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697 |
- /*
- * Copyright (c) 1983, 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.
- * 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.
- *
- * @(#)timed.h 8.1 (Berkeley) 6/2/93
- */
- #ifndef _PROTOCOLS_TIMED_H
- #define _PROTOCOLS_TIMED_H 1
- #include <rpc/types.h>
- /*
- * Time Synchronization Protocol
- */
- #define TSPVERSION 1
- #define ANYADDR NULL
- struct tsp {
- u_char tsp_type;
- u_char tsp_vers;
- u_short tsp_seq;
- union {
- struct timeval tspu_time;
- char tspu_hopcnt;
- } tsp_u;
- char tsp_name[MAXHOSTNAMELEN];
- };
- #define tsp_time tsp_u.tspu_time
- #define tsp_hopcnt tsp_u.tspu_hopcnt
- /*
- * Command types.
- */
- #define TSP_ANY 0 /* match any types */
- #define TSP_ADJTIME 1 /* send adjtime */
- #define TSP_ACK 2 /* generic acknowledgement */
- #define TSP_MASTERREQ 3 /* ask for master's name */
- #define TSP_MASTERACK 4 /* acknowledge master request */
- #define TSP_SETTIME 5 /* send network time */
- #define TSP_MASTERUP 6 /* inform slaves that master is up */
- #define TSP_SLAVEUP 7 /* slave is up but not polled */
- #define TSP_ELECTION 8 /* advance candidature for master */
- #define TSP_ACCEPT 9 /* support candidature of master */
- #define TSP_REFUSE 10 /* reject candidature of master */
- #define TSP_CONFLICT 11 /* two or more masters present */
- #define TSP_RESOLVE 12 /* masters' conflict resolution */
- #define TSP_QUIT 13 /* reject candidature if master is up */
- #define TSP_DATE 14 /* reset the time (date command) */
- #define TSP_DATEREQ 15 /* remote request to reset the time */
- #define TSP_DATEACK 16 /* acknowledge time setting */
- #define TSP_TRACEON 17 /* turn tracing on */
- #define TSP_TRACEOFF 18 /* turn tracing off */
- #define TSP_MSITE 19 /* find out master's site */
- #define TSP_MSITEREQ 20 /* remote master's site request */
- #define TSP_TEST 21 /* for testing election algo */
- #define TSP_SETDATE 22 /* New from date command */
- #define TSP_SETDATEREQ 23 /* New remote for above */
- #define TSP_LOOP 24 /* loop detection packet */
- #define TSPTYPENUMBER 25
- #ifdef TSPTYPES
- char *tsptype[TSPTYPENUMBER] =
- { "ANY", "ADJTIME", "ACK", "MASTERREQ", "MASTERACK", "SETTIME", "MASTERUP",
- "SLAVEUP", "ELECTION", "ACCEPT", "REFUSE", "CONFLICT", "RESOLVE", "QUIT",
- "DATE", "DATEREQ", "DATEACK", "TRACEON", "TRACEOFF", "MSITE", "MSITEREQ",
- "TEST", "SETDATE", "SETDATEREQ", "LOOP" };
- #endif
- #endif /* protocols/timed.h */
|