routed.h revision 1.10
1/* $NetBSD: routed.h,v 1.10 1997/02/03 22:20:38 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#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 65/* We include the V2 fields to get the right size */ 66struct netinfo { 67 u_int16_t rip_family; 68 u_int16_t rip_tag; 69 u_int32_t rip_dst; /* destination net/host */ 70 u_int32_t rip_dst_mask; /* destination mask (V2 only) */ 71 u_int32_t rip_router; /* next host (V2 only) */ 72 u_int32_t rip_metric; /* cost of route */ 73}; 74#else 75struct netinfo { 76 u_int16_t n_family; 77#define RIP_AF_INET htons(AF_INET) 78#define RIP_AF_UNSPEC 0 79#define RIP_AF_AUTH 0xffff 80 u_int16_t n_tag; /* optional in RIPv2 */ 81 u_int32_t n_dst; /* destination net or host */ 82#define RIP_DEFAULT 0 83 u_int32_t n_mask; /* netmask in RIPv2 */ 84 u_int32_t n_nhop; /* optional next hop in RIPv2 */ 85 u_int32_t n_metric; /* cost of route */ 86}; 87#endif 88 89/* RIPv2 authentication */ 90struct netauth { 91 u_int16_t a_family; /* always RIP_AF_AUTH */ 92 u_int16_t a_type; 93#define RIP_AUTH_NONE 0 94#define RIP_AUTH_PW htons(2) /* password type */ 95#define RIP_AUTH_MD5 htons(3) /* Keyed MD5 */ 96 union { 97#define RIP_AUTH_PW_LEN 16 98 u_int8_t au_pw[RIP_AUTH_PW_LEN]; 99 struct a_md5 { 100 int16_t md5_pkt_len; /* RIP-II packet length */ 101 int8_t md5_keyid; /* key ID and auth data len */ 102 int8_t md5_auth_len; /* 16 */ 103 u_int32_t md5_seqno; /* sequence number */ 104 u_int32_t rsvd[2]; /* must be 0 */ 105#define RIP_AUTH_MD5_LEN RIP_AUTH_PW_LEN 106 } a_md5; 107 } au; 108}; 109 110struct rip { 111 u_int8_t rip_cmd; /* request/response */ 112 u_int8_t rip_vers; /* protocol version # */ 113 u_int16_t rip_res1; /* pad to 32-bit boundary */ 114 union { /* variable length... */ 115 struct netinfo ru_nets[1]; 116 int8_t ru_tracefile[1]; 117 struct netauth ru_auth[1]; 118 } ripun; 119#define rip_nets ripun.ru_nets 120#define rip_auths ripun.ru_auth 121#define rip_tracefile ripun.ru_tracefile 122}; 123 124/* Packet types. 125 */ 126#define RIPCMD_REQUEST 1 /* want info */ 127#define RIPCMD_RESPONSE 2 /* responding to request */ 128#define RIPCMD_TRACEON 3 /* turn tracing on */ 129#define RIPCMD_TRACEOFF 4 /* turn it off */ 130 131/* Gated extended RIP to include a "poll" command instead of using 132 * RIPCMD_REQUEST with (RIP_AF_UNSPEC, RIP_DEFAULT). RFC 1058 says 133 * command 5 is used by Sun Microsystems for its own purposes. 134 */ 135#define RIPCMD_POLL 5 136 137#define RIPCMD_MAX 6 138 139#ifdef RIPCMDS 140char *ripcmds[RIPCMD_MAX] = { 141 "#0", "REQUEST", "RESPONSE", "TRACEON", "TRACEOFF" 142}; 143#endif 144 145#define HOPCNT_INFINITY 16 146#define MAXPACKETSIZE 512 /* max broadcast size */ 147#define NETS_LEN ((MAXPACKETSIZE-sizeof(struct rip)) \ 148 / sizeof(struct netinfo) +1) 149 150#define INADDR_RIP_GROUP (u_int32_t)0xe0000009 /* 224.0.0.9 */ 151 152 153/* Timer values used in managing the routing table. 154 * 155 * Complete tables are broadcast every SUPPLY_INTERVAL seconds. 156 * If changes occur between updates, dynamic updates containing only changes 157 * may be sent. When these are sent, a timer is set for a random value 158 * between MIN_WAITTIME and MAX_WAITTIME, and no additional dynamic updates 159 * are sent until the timer expires. 160 * 161 * Every update of a routing entry forces an entry's timer to be reset. 162 * After EXPIRE_TIME without updates, the entry is marked invalid, 163 * but held onto until GARBAGE_TIME so that others may see it, to 164 * "poison" the bad route. 165 */ 166#define SUPPLY_INTERVAL 30 /* time to supply tables */ 167#define MIN_WAITTIME 2 /* min sec until next flash updates */ 168#define MAX_WAITTIME 5 /* max sec until flash update */ 169 170#define STALE_TIME 90 /* switch to a new gateway */ 171#define EXPIRE_TIME 180 /* time to mark entry invalid */ 172#define GARBAGE_TIME 240 /* time to garbage collect */ 173 174#ifdef __cplusplus 175} 176#endif 177#endif /* !_ROUTED_H_ */ 178