Return to routed.h CVS log

Up to [Apple Darwin 0.x] / kernel / bsd / include / protocols

Annotation of kernel/bsd/include/protocols/routed.h, revision 1.1

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

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.