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