routed.h revision 1.6
1 /* $NetBSD: routed.h,v 1.6 1996/09/24 16:36:19 christos 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 39 #ifndef _ROUTED_H_ 40 #define _ROUTED_H_ 41 #ifdef __cplusplus 42 extern "C" { 43 #endif 44 45 /* 46 * Routing Information Protocol 47 * 48 * Derived from Xerox NS Routing Information Protocol 49 * by changing 32-bit net numbers to sockaddr's and 50 * padding stuff to 32-bit boundaries. 51 */ 52 53 #define RIP_VERSION_0 0 54 #define RIP_VERSION_1 1 55 #define RIP_VERSION_2 2 56 57 #define RIPv1 RIP_VERSION_1 58 #define RIPv2 RIP_VERSION_2 59 #ifndef RIPVERSION 60 #define RIPVERSION RIPv1 61 #endif 62 63 #define RIP_PORT 520 64 65 #if RIPVERSION == 1 66 /* Note that this so called sockaddr has a 2-byte sa_family and no sa_len. 67 * It is not a UNIX sockaddr, but the shape of an address as defined 68 * in RIPv1. It is still defined to allow old versions of programs 69 * such as `gated` to use this file to define RIPv1. 70 */ 71 struct netinfo { 72 struct sockaddr rip_dst; /* destination net/host */ 73 u_int32_t rip_metric; /* cost of route */ 74 }; 75 #else 76 struct netinfo { 77 u_int16_t n_family; 78 #define RIP_AF_INET htons(AF_INET) 79 #define RIP_AF_UNSPEC 0 80 #define RIP_AF_AUTH 0xffff 81 u_int16_t n_tag; /* optional in RIPv2 */ 82 u_int32_t n_dst; /* destination net or host */ 83 #define RIP_DEFAULT 0 84 u_int32_t n_mask; /* netmask in RIPv2 */ 85 u_int32_t n_nhop; /* optional next hop in RIPv2 */ 86 u_int32_t n_metric; /* cost of route */ 87 }; 88 #endif 89 90 /* RIPv2 authentication */ 91 struct netauth { 92 u_int16_t a_type; 93 #define RIP_AUTH_PW htons(2) /* password type */ 94 union { 95 #define RIP_AUTH_PW_LEN 16 96 int8_t au_pw[RIP_AUTH_PW_LEN]; 97 } au; 98 }; 99 100 struct rip { 101 u_int8_t rip_cmd; /* request/response */ 102 u_int8_t rip_vers; /* protocol version # */ 103 u_int16_t rip_res1; /* pad to 32-bit boundary */ 104 union { /* variable length... */ 105 struct netinfo ru_nets[1]; 106 int8_t ru_tracefile[1]; 107 struct netauth ru_auth[1]; 108 } ripun; 109 #define rip_nets ripun.ru_nets 110 #define rip_tracefile ripun.ru_tracefile 111 }; 112 113 /* Packet types. 114 */ 115 #define RIPCMD_REQUEST 1 /* want info */ 116 #define RIPCMD_RESPONSE 2 /* responding to request */ 117 #define RIPCMD_TRACEON 3 /* turn tracing on */ 118 #define RIPCMD_TRACEOFF 4 /* turn it off */ 119 120 /* Gated extended RIP to include a "poll" command instead of using 121 * RIPCMD_REQUEST with (RIP_AF_UNSPEC, RIP_DEFAULT). RFC 1058 says 122 * command 5 is used by Sun Microsystems for its own purposes. 123 */ 124 #define RIPCMD_POLL 5 125 126 #define RIPCMD_MAX 6 127 128 #ifdef RIPCMDS 129 char *ripcmds[RIPCMD_MAX] = { 130 "#0", "REQUEST", "RESPONSE", "TRACEON", "TRACEOFF" 131 }; 132 #endif 133 134 #define HOPCNT_INFINITY 16 135 #define MAXPACKETSIZE 512 /* max broadcast size */ 136 #define NETS_LEN ((MAXPACKETSIZE-sizeof(struct rip)) \ 137 / sizeof(struct netinfo) +1) 138 139 #define INADDR_RIP_GROUP (u_int32_t)0xe0000009 /* 224.0.0.9 */ 140 141 142 /* Timer values used in managing the routing table. 143 * 144 * Complete tables are broadcast every SUPPLY_INTERVAL seconds. 145 * If changes occur between updates, dynamic updates containing only changes 146 * may be sent. When these are sent, a timer is set for a random value 147 * between MIN_WAITTIME and MAX_WAITTIME, and no additional dynamic updates 148 * are sent until the timer expires. 149 * 150 * Every update of a routing entry forces an entry's timer to be reset. 151 * After EXPIRE_TIME without updates, the entry is marked invalid, 152 * but held onto until GARBAGE_TIME so that others may see it, to 153 * "poison" the bad route. 154 */ 155 #define SUPPLY_INTERVAL 30 /* time to supply tables */ 156 #define MIN_WAITTIME 2 /* min sec until next flash updates */ 157 #define MAX_WAITTIME 5 /* max sec until flash update */ 158 159 #define STALE_TIME 90 /* switch to a new gateway */ 160 #define EXPIRE_TIME 180 /* time to mark entry invalid */ 161 #define GARBAGE_TIME 240 /* time to garbage collect */ 162 163 #ifdef __cplusplus 164 } 165 #endif 166 #endif /* !_ROUTED_H_ */ 167
Indexes created Tue Sep 23 14:10:03 GMT 2025