2 * Copyright (c) 1983, 1989, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
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
29 * @(#)routed.h 8.1 (Berkeley) 6/2/93
31 * $FreeBSD: src/include/protocols/routed.h,v 1.15 1999/09/05 17:43:31 peter Exp $
32 * $DragonFly: src/include/protocols/routed.h,v 1.2 2003/06/17 04:25:58 dillon Exp $
42 * Routing Information Protocol
44 * Derived from Xerox NS Routing Information Protocol
45 * by changing 32-bit net numbers to sockaddr's and
46 * padding stuff to 32-bit boundaries.
52 #define RIPVERSION RIPv1
58 /* Note that this so called sockaddr has a 2-byte sa_family and no sa_len.
59 * It is not a UNIX sockaddr, but the shape of an address as defined
60 * in RIPv1. It is still defined to allow old versions of programs
61 * such as `gated` to use this file to define RIPv1.
64 struct sockaddr rip_dst
; /* destination net/host */
65 u_int32_t rip_metric
; /* cost of route */
70 #define RIP_AF_INET htons(AF_INET)
71 #define RIP_AF_UNSPEC 0
72 #define RIP_AF_AUTH 0xffff
73 u_int16_t n_tag
; /* optional in RIPv2 */
74 u_int32_t n_dst
; /* destination net or host */
76 u_int32_t n_mask
; /* netmask in RIPv2 */
77 u_int32_t n_nhop
; /* optional next hop in RIPv2 */
78 u_int32_t n_metric
; /* cost of route */
82 /* RIPv2 authentication */
84 u_int16_t a_family
; /* always RIP_AF_AUTH */
86 #define RIP_AUTH_NONE 0
87 #define RIP_AUTH_PW htons(2) /* password type */
88 #define RIP_AUTH_MD5 htons(3) /* Keyed MD5 */
90 #define RIP_AUTH_PW_LEN 16
91 u_int8_t au_pw
[RIP_AUTH_PW_LEN
];
93 int16_t md5_pkt_len
; /* RIP-II packet length */
94 int8_t md5_keyid
; /* key ID and auth data len */
95 int8_t md5_auth_len
; /* 16 */
96 u_int32_t md5_seqno
; /* sequence number */
97 u_int32_t rsvd
[2]; /* must be 0 */
98 #define RIP_AUTH_MD5_LEN RIP_AUTH_PW_LEN
104 u_int8_t rip_cmd
; /* request/response */
105 u_int8_t rip_vers
; /* protocol version # */
106 u_int16_t rip_res1
; /* pad to 32-bit boundary */
107 union { /* variable length... */
108 struct netinfo ru_nets
[1];
109 int8_t ru_tracefile
[1];
110 struct netauth ru_auth
[1];
112 #define rip_nets ripun.ru_nets
113 #define rip_auths ripun.ru_auth
114 #define rip_tracefile ripun.ru_tracefile
119 #define RIPCMD_REQUEST 1 /* want info */
120 #define RIPCMD_RESPONSE 2 /* responding to request */
121 #define RIPCMD_TRACEON 3 /* turn tracing on */
122 #define RIPCMD_TRACEOFF 4 /* turn it off */
124 /* Gated extended RIP to include a "poll" command instead of using
125 * RIPCMD_REQUEST with (RIP_AF_UNSPEC, RIP_DEFAULT). RFC 1058 says
126 * command 5 is used by Sun Microsystems for its own purposes.
128 #define RIPCMD_POLL 5
133 const char *ripcmds
[RIPCMD_MAX
] = {
134 "#0", "REQUEST", "RESPONSE", "TRACEON", "TRACEOFF"
138 #define HOPCNT_INFINITY 16
139 #define MAXPACKETSIZE 512 /* max broadcast size */
140 #define NETS_LEN ((MAXPACKETSIZE-sizeof(struct rip)) \
141 / sizeof(struct netinfo) +1)
143 #define INADDR_RIP_GROUP (u_int32_t)0xe0000009 /* 224.0.0.9 */
146 /* Timer values used in managing the routing table.
148 * Complete tables are broadcast every SUPPLY_INTERVAL seconds.
149 * If changes occur between updates, dynamic updates containing only changes
150 * may be sent. When these are sent, a timer is set for a random value
151 * between MIN_WAITTIME and MAX_WAITTIME, and no additional dynamic updates
152 * are sent until the timer expires.
154 * Every update of a routing entry forces an entry's timer to be reset.
155 * After EXPIRE_TIME without updates, the entry is marked invalid,
156 * but held onto until GARBAGE_TIME so that others may see it, to
157 * "poison" the bad route.
159 #define SUPPLY_INTERVAL 30 /* time to supply tables */
160 #define MIN_WAITTIME 2 /* min sec until next flash updates */
161 #define MAX_WAITTIME 5 /* max sec until flash update */
163 #define STALE_TIME 90 /* switch to a new gateway */
164 #define EXPIRE_TIME 180 /* time to mark entry invalid */
165 #define GARBAGE_TIME 240 /* time to garbage collect */
170 #endif /* !_ROUTED_H_ */