routed.h revision 1.5 
1/*	$NetBSD: routed.h,v 1.5 1996/08/10 01:37:09 thorpej Exp $	*/
2
3/*-
4 * Copyright (c) 1983, 1989, 1993
5 *	The Regents of the University of California.  All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 *    notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 *    notice, this list of conditions and the following disclaimer in the
14 *    documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 *    must display the following acknowledgement:
17 *	This product includes software developed by the University of
18 *	California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 *    may be used to endorse or promote products derived from this software
21 *    without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 *
35 *	@(#)routed.h	8.1 (Berkeley) 6/2/93
36 */
37
38#ifndef _ROUTED_H_
39#define	_ROUTED_H_
40#ifdef __cplusplus
41extern "C" {
42#endif
43
44/*
45 * Routing Information Protocol
46 *
47 * Derived from Xerox NS Routing Information Protocol
48 * by changing 32-bit net numbers to sockaddr's and
49 * padding stuff to 32-bit boundaries.
50 */
51
52#define RIP_VERSION_0	0
53#define	RIP_VERSION_1	1
54#define	RIP_VERSION_2	2
55
56#define	RIPv1		RIP_VERSION_1
57#define	RIPv2		RIP_VERSION_2
58#ifndef RIPVERSION
59#define	RIPVERSION	RIPv1
60#endif
61
62#define RIP_PORT	520
63
64#if RIPVERSION == 1
65struct netinfo {
66	u_int16_t	rip_family;
67	u_int16_t	rip_tag;
68	u_int32_t	rip_dst;	/* destination net/host */
69	u_int32_t	rip_metric;	/* cost of route */
70};
71#else
72struct netinfo {
73	u_int16_t	n_family;
74#define	    RIP_AF_INET	    htons(AF_INET)
75#define	    RIP_AF_UNSPEC   0
76#define	    RIP_AF_AUTH	    0xffff
77	u_int16_t	n_tag;		/* optional in RIPv2 */
78	u_int16_t	n_dst;		/* destination net or host */
79#define	    RIP_DEFAULT	    0
80	u_int32_t	n_mask;		/* netmask in RIPv2 */
81	u_int32_t	n_nhop;		/* optional next hop in RIPv2 */
82	u_int32_t	n_metric;	/* cost of route */
83};
84#endif
85
86/* RIPv2 authentication */
87struct netauth {
88	u_int16_t	a_type;
89#define	    RIP_AUTH_PW	    htons(2)	/* password type */
90	union {
91#define	    RIP_AUTH_PW_LEN 16
92	    int8_t    au_pw[RIP_AUTH_PW_LEN];
93	} au;
94};
95
96struct rip {
97	u_int8_t	rip_cmd;	/* request/response */
98	u_int8_t	rip_vers;	/* protocol version # */
99	u_int16_t	rip_res1;	/* pad to 32-bit boundary */
100	union {				/* variable length... */
101	    struct netinfo ru_nets[1];
102	    int8_t    ru_tracefile[1];
103	    struct netauth ru_auth[1];
104	} ripun;
105#define	rip_nets	ripun.ru_nets
106#define	rip_tracefile	ripun.ru_tracefile
107};
108
109/* Packet types.
110 */
111#define	RIPCMD_REQUEST		1	/* want info */
112#define	RIPCMD_RESPONSE		2	/* responding to request */
113#define	RIPCMD_TRACEON		3	/* turn tracing on */
114#define	RIPCMD_TRACEOFF		4	/* turn it off */
115
116/* Gated extended RIP to include a "poll" command instead of using
117 * RIPCMD_REQUEST with (RIP_AF_UNSPEC, RIP_DEFAULT).  RFC 1058 says
118 * command 5 is used by Sun Microsystems for its own purposes.
119 */
120#define RIPCMD_POLL		5
121
122#define	RIPCMD_MAX		6
123
124#ifdef RIPCMDS
125char *ripcmds[RIPCMD_MAX] = {
126	"#0", "REQUEST", "RESPONSE", "TRACEON", "TRACEOFF"
127};
128#endif
129
130#define	HOPCNT_INFINITY		16
131#define	MAXPACKETSIZE		512	/* max broadcast size */
132#define NETS_LEN ((MAXPACKETSIZE-sizeof(struct rip))	\
133		      / sizeof(struct netinfo) +1)
134
135#define INADDR_RIP_GROUP (u_int32_t)0xe0000009 /* 224.0.0.9 */
136
137
138/* Timer values used in managing the routing table.
139 *
140 * Complete tables are broadcast every SUPPLY_INTERVAL seconds.
141 * If changes occur between updates, dynamic updates containing only changes
142 * may be sent.  When these are sent, a timer is set for a random value
143 * between MIN_WAITTIME and MAX_WAITTIME, and no additional dynamic updates
144 * are sent until the timer expires.
145 *
146 * Every update of a routing entry forces an entry's timer to be reset.
147 * After EXPIRE_TIME without updates, the entry is marked invalid,
148 * but held onto until GARBAGE_TIME so that others may see it, to
149 * "poison" the bad route.
150 */
151#define	SUPPLY_INTERVAL		30	/* time to supply tables */
152#define	MIN_WAITTIME		2	/* min sec until next flash updates */
153#define	MAX_WAITTIME		5	/* max sec until flash update */
154
155#define STALE_TIME		90	/* switch to a new gateway */
156#define	EXPIRE_TIME		180	/* time to mark entry invalid */
157#define	GARBAGE_TIME		240	/* time to garbage collect */
158
159#ifdef __cplusplus
160}
161#endif
162#endif /* !_ROUTED_H_ */
163