Return to iso_snpac.h CVS log

Up to [Net/2] / Net2 / netiso

Annotation of Net2/netiso/iso_snpac.h, revision 1.1

1.1     ! root        1: /*-
        !             2:  * Copyright (c) 1991 The 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:  *     @(#)iso_snpac.h 7.8 (Berkeley) 5/6/91
        !            34:  */
        !            35: 
        !            36: /***********************************************************
        !            37:                Copyright IBM Corporation 1987
        !            38: 
        !            39:                       All Rights Reserved
        !            40: 
        !            41: Permission to use, copy, modify, and distribute this software and its 
        !            42: documentation for any purpose and without fee is hereby granted, 
        !            43: provided that the above copyright notice appear in all copies and that
        !            44: both that copyright notice and this permission notice appear in 
        !            45: supporting documentation, and that the name of IBM not be
        !            46: used in advertising or publicity pertaining to distribution of the
        !            47: software without specific, written prior permission.  
        !            48: 
        !            49: IBM DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
        !            50: ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
        !            51: IBM BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
        !            52: ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
        !            53: WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
        !            54: ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
        !            55: SOFTWARE.
        !            56: 
        !            57: ******************************************************************/
        !            58: 
        !            59: /*
        !            60:  * ARGO Project, Computer Sciences Dept., University of Wisconsin - Madison
        !            61:  */
        !            62: 
        !            63: #define        MAX_SNPALEN             8                       /* curiously equal to sizeof x.121 (
        !            64:                                                                                plus 1 for nibble len) addr */
        !            65: struct snpa_req {
        !            66:        struct iso_addr sr_isoa;                /* nsap address */
        !            67:        u_char                  sr_len;                 /* length of snpa */
        !            68:        u_char                  sr_snpa[MAX_SNPALEN];   /* snpa associated 
        !            69:                                                                                                with nsap address */
        !            70:        u_char                  sr_flags;               /* true if entry is valid */
        !            71:        u_short                 sr_ht;                  /* holding time */
        !            72: };
        !            73: 
        !            74: #define        SNPA_VALID              0x01
        !            75: #define        SNPA_ES                 0x02
        !            76: #define SNPA_IS                        0x04
        !            77: #define        SNPA_PERM               0x10
        !            78: 
        !            79: struct systype_req {
        !            80:        short   sr_holdt;               /* holding timer */
        !            81:        short   sr_configt;             /* configuration timer */
        !            82:        short   sr_esconfigt;   /* suggested ES configuration timer */
        !            83:        char    sr_type;                /* SNPA_ES or SNPA_IS */
        !            84: };
        !            85: 
        !            86: struct esis_req {
        !            87:        short   er_ht;                  /* holding time */
        !            88:        u_char  er_flags;               /* type and validity */
        !            89: };
        !            90: /*
        !            91:  * Space for this structure gets added onto the end of a route
        !            92:  * going to an ethernet or other 802.[45x] device.
        !            93:  */
        !            94: 
        !            95: struct llinfo_llc {
        !            96:        struct  llinfo_llc *lc_next;    /* keep all llc routes linked */
        !            97:        struct  llinfo_llc *lc_prev;    /* keep all llc routes linked */
        !            98:        struct  rtentry *lc_rt;                 /* backpointer to route */
        !            99:        struct  esis_req lc_er;                 /* holding time, etc */
        !           100: #define lc_ht          lc_er.er_ht
        !           101: #define lc_flags       lc_er.er_flags
        !           102: };
        !           103: 
        !           104: 
        !           105: /* ISO arp IOCTL data structures */
        !           106: 
        !           107: #define        SIOCSSTYPE      _IOW('a', 39, struct systype_req) /* set system type */
        !           108: #define        SIOCGSTYPE      _IOR('a', 40, struct systype_req) /* get system type */
        !           109: 
        !           110: #ifdef KERNEL
        !           111: struct llinfo_llc llinfo_llc;  /* head for linked lists */
        !           112: #endif KERNEL

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