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