projects / unix-history / blame
| Commit | Line | Data |
|---|---|---|
| 15637ed4 RG |
1 | /*- |
| 2 | * Copyright (c) 1983, 1989 Regents of the University of California. | |
| 3 | * All rights reserved. | |
| 4 | * | |
| 5 | * Redistribution and use in source and binary forms, with or without | |
| 6 | * modification, are permitted provided that the following conditions | |
| 7 | * are met: | |
| 8 | * 1. Redistributions of source code must retain the above copyright | |
| 9 | * notice, this list of conditions and the following disclaimer. | |
| 10 | * 2. Redistributions in binary form must reproduce the above copyright | |
| 11 | * notice, this list of conditions and the following disclaimer in the | |
| 12 | * documentation and/or other materials provided with the distribution. | |
| 13 | * 3. All advertising materials mentioning features or use of this software | |
| 14 | * must display the following acknowledgement: | |
| 15 | * This product includes software developed by the University of | |
| 16 | * California, Berkeley and its contributors. | |
| 17 | * 4. Neither the name of the University nor the names of its contributors | |
| 18 | * may be used to endorse or promote products derived from this software | |
| 19 | * without specific prior written permission. | |
| 20 | * | |
| 21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
| 22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
| 23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
| 24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
| 25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
| 26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
| 27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
| 28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
| 29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
| 30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
| 31 | * SUCH DAMAGE. | |
| 32 | * | |
| 33 | * @(#)routed.h 5.3 (Berkeley) 4/3/91 | |
| 34 | */ | |
| 35 | ||
| 36 | #ifndef _ROUTED_H_ | |
| 37 | #define _ROUTED_H_ | |
| 38 | ||
| 39 | /* | |
| 40 | * Routing Information Protocol | |
| 41 | * | |
| 42 | * Derived from Xerox NS Routing Information Protocol | |
| 43 | * by changing 32-bit net numbers to sockaddr's and | |
| 44 | * padding stuff to 32-bit boundaries. | |
| 45 | */ | |
| 46 | #define RIPVERSION 1 | |
| 47 | ||
| 48 | struct netinfo { | |
| 49 | struct sockaddr rip_dst; /* destination net/host */ | |
| 50 | int rip_metric; /* cost of route */ | |
| 51 | }; | |
| 52 | ||
| 53 | struct rip { | |
| 54 | u_char rip_cmd; /* request/response */ | |
| 55 | u_char rip_vers; /* protocol version # */ | |
| 56 | u_char rip_res1[2]; /* pad to 32-bit boundary */ | |
| 57 | union { | |
| 58 | struct netinfo ru_nets[1]; /* variable length... */ | |
| 59 | char ru_tracefile[1]; /* ditto ... */ | |
| 60 | } ripun; | |
| 61 | #define rip_nets ripun.ru_nets | |
| 62 | #define rip_tracefile ripun.ru_tracefile | |
| 63 | }; | |
| 64 | ||
| 65 | /* | |
| 66 | * Packet types. | |
| 67 | */ | |
| 68 | #define RIPCMD_REQUEST 1 /* want info */ | |
| 69 | #define RIPCMD_RESPONSE 2 /* responding to request */ | |
| 70 | #define RIPCMD_TRACEON 3 /* turn tracing on */ | |
| 71 | #define RIPCMD_TRACEOFF 4 /* turn it off */ | |
| 72 | ||
| 73 | #define RIPCMD_MAX 5 | |
| 74 | #ifdef RIPCMDS | |
| 75 | char *ripcmds[RIPCMD_MAX] = | |
| 76 | { "#0", "REQUEST", "RESPONSE", "TRACEON", "TRACEOFF" }; | |
| 77 | #endif | |
| 78 | ||
| 79 | #define HOPCNT_INFINITY 16 /* per Xerox NS */ | |
| 80 | #define MAXPACKETSIZE 512 /* max broadcast size */ | |
| 81 | ||
| 82 | /* | |
| 83 | * Timer values used in managing the routing table. | |
| 84 | * Complete tables are broadcast every SUPPLY_INTERVAL seconds. | |
| 85 | * If changes occur between updates, dynamic updates containing only changes | |
| 86 | * may be sent. When these are sent, a timer is set for a random value | |
| 87 | * between MIN_WAITTIME and MAX_WAITTIME, and no additional dynamic updates | |
| 88 | * are sent until the timer expires. | |
| 89 | * | |
| 90 | * Every update of a routing entry forces an entry's timer to be reset. | |
| 91 | * After EXPIRE_TIME without updates, the entry is marked invalid, | |
| 92 | * but held onto until GARBAGE_TIME so that others may | |
| 93 | * see it "be deleted". | |
| 94 | */ | |
| 95 | #define TIMER_RATE 30 /* alarm clocks every 30 seconds */ | |
| 96 | ||
| 97 | #define SUPPLY_INTERVAL 30 /* time to supply tables */ | |
| 98 | #define MIN_WAITTIME 2 /* min. interval to broadcast changes */ | |
| 99 | #define MAX_WAITTIME 5 /* max. time to delay changes */ | |
| 100 | ||
| 101 | #define EXPIRE_TIME 180 /* time to mark entry invalid */ | |
| 102 | #define GARBAGE_TIME 240 /* time to garbage collect */ | |
| 103 | ||
| 104 | #endif /* !_ROUTED_H_ */ |