routed.h revision 1.8
1 /* $NetBSD: routed.h,v 1.8 1996/10/20 21:53:20 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 41 extern "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 65 struct 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 72 struct 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_int32_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 */ 87 struct netauth { 88 u_int16_t a_family; /* overlays netinfo.n_family */ 89 u_int16_t a_type; 90 #define RIP_AUTH_PW htons(2) /* password type */ 91 union { 92 #define RIP_AUTH_PW_LEN 16 93 int8_t au_pw[RIP_AUTH_PW_LEN]; 94 } au; 95 }; 96 97 struct rip { 98 u_int8_t rip_cmd; /* request/response */ 99 u_int8_t rip_vers; /* protocol version # */ 100 u_int16_t rip_res1; /* pad to 32-bit boundary */ 101 union { /* variable length... */ 102 struct netinfo ru_nets[1]; 103 int8_t ru_tracefile[1]; 104 struct netauth ru_auth[1]; 105 } ripun; 106 #define rip_nets ripun.ru_nets 107 #define rip_tracefile ripun.ru_tracefile 108 }; 109 110 /* Packet types. 111 */ 112 #define RIPCMD_REQUEST 1 /* want info */ 113 #define RIPCMD_RESPONSE 2 /* responding to request */ 114 #define RIPCMD_TRACEON 3 /* turn tracing on */ 115 #define RIPCMD_TRACEOFF 4 /* turn it off */ 116 117 /* Gated extended RIP to include a "poll" command instead of using 118 * RIPCMD_REQUEST with (RIP_AF_UNSPEC, RIP_DEFAULT). RFC 1058 says 119 * command 5 is used by Sun Microsystems for its own purposes. 120 */ 121 #define RIPCMD_POLL 5 122 123 #define RIPCMD_MAX 6 124 125 #ifdef RIPCMDS 126 char *ripcmds[RIPCMD_MAX] = { 127 "#0", "REQUEST", "RESPONSE", "TRACEON", "TRACEOFF" 128 }; 129 #endif 130 131 #define HOPCNT_INFINITY 16 132 #define MAXPACKETSIZE 512 /* max broadcast size */ 133 #define NETS_LEN ((MAXPACKETSIZE-sizeof(struct rip)) \ 134 / sizeof(struct netinfo) +1) 135 136 #define INADDR_RIP_GROUP (u_int32_t)0xe0000009 /* 224.0.0.9 */ 137 138 139 /* Timer values used in managing the routing table. 140 * 141 * Complete tables are broadcast every SUPPLY_INTERVAL seconds. 142 * If changes occur between updates, dynamic updates containing only changes 143 * may be sent. When these are sent, a timer is set for a random value 144 * between MIN_WAITTIME and MAX_WAITTIME, and no additional dynamic updates 145 * are sent until the timer expires. 146 * 147 * Every update of a routing entry forces an entry's timer to be reset. 148 * After EXPIRE_TIME without updates, the entry is marked invalid, 149 * but held onto until GARBAGE_TIME so that others may see it, to 150 * "poison" the bad route. 151 */ 152 #define SUPPLY_INTERVAL 30 /* time to supply tables */ 153 #define MIN_WAITTIME 2 /* min sec until next flash updates */ 154 #define MAX_WAITTIME 5 /* max sec until flash update */ 155 156 #define STALE_TIME 90 /* switch to a new gateway */ 157 #define EXPIRE_TIME 180 /* time to mark entry invalid */ 158 #define GARBAGE_TIME 240 /* time to garbage collect */ 159 160 #ifdef __cplusplus 161 } 162 #endif 163 #endif /* !_ROUTED_H_ */ 164
Indexes created Thu Sep 25 15:09:46 GMT 2025