1 /* $NetBSD: routed.h,v 1.3 1994/10/26 00:56:50 cgd Exp $ */ 2 3 /*- 4 * Copyright (c) 1983, 1989 Regents of the University of California. 5 * 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 5.3 (Berkeley) 4/3/91 36 */ 37 38 #ifndef _ROUTED_H_ 39 #define _ROUTED_H_ 40 41 /* 42 * Routing Information Protocol 43 * 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. 47 */ 48 #define RIPVERSION 1 49 50 struct netinfo { 51 struct sockaddr rip_dst; /* destination net/host */ 52 int rip_metric; /* cost of route */ 53 }; 54 55 struct rip { 56 u_char rip_cmd; /* request/response */ 57 u_char rip_vers; /* protocol version # */ 58 u_char rip_res1[2]; /* pad to 32-bit boundary */ 59 union { 60 struct netinfo ru_nets[1]; /* variable length... */ 61 char ru_tracefile[1]; /* ditto ... */ 62 } ripun; 63 #define rip_nets ripun.ru_nets 64 #define rip_tracefile ripun.ru_tracefile 65 }; 66 67 /* 68 * Packet types. 69 */ 70 #define RIPCMD_REQUEST 1 /* want info */ 71 #define RIPCMD_RESPONSE 2 /* responding to request */ 72 #define RIPCMD_TRACEON 3 /* turn tracing on */ 73 #define RIPCMD_TRACEOFF 4 /* turn it off */ 74 75 #define RIPCMD_MAX 5 76 #ifdef RIPCMDS 77 char *ripcmds[RIPCMD_MAX] = 78 { "#0", "REQUEST", "RESPONSE", "TRACEON", "TRACEOFF" }; 79 #endif 80 81 #define HOPCNT_INFINITY 16 /* per Xerox NS */ 82 #define MAXPACKETSIZE 512 /* max broadcast size */ 83 84 /* 85 * Timer values used in managing the routing table. 86 * Complete tables are broadcast every SUPPLY_INTERVAL seconds. 87 * If changes occur between updates, dynamic updates containing only changes 88 * may be sent. When these are sent, a timer is set for a random value 89 * between MIN_WAITTIME and MAX_WAITTIME, and no additional dynamic updates 90 * are sent until the timer expires. 91 * 92 * Every update of a routing entry forces an entry's timer to be reset. 93 * After EXPIRE_TIME without updates, the entry is marked invalid, 94 * but held onto until GARBAGE_TIME so that others may 95 * see it "be deleted". 96 */ 97 #define TIMER_RATE 30 /* alarm clocks every 30 seconds */ 98 99 #define SUPPLY_INTERVAL 30 /* time to supply tables */ 100 #define MIN_WAITTIME 2 /* min. interval to broadcast changes */ 101 #define MAX_WAITTIME 5 /* max. time to delay changes */ 102 103 #define EXPIRE_TIME 180 /* time to mark entry invalid */ 104 #define GARBAGE_TIME 240 /* time to garbage collect */ 105 106 #endif /* !_ROUTED_H_ */ 107