Return to ns_if.h CVS log

Up to [Net/2] / Net2 / netns

Annotation of Net2/netns/ns_if.h, revision 1.1.1.2

1.1       root        1: /*
                      2:  * Copyright (c) 1984, 1985, 1986, 1987 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:  *
1.1.1.2 ! root       33:  *     from: @(#)ns_if.h       7.6 (Berkeley) 6/28/90
        !            34:  *     ns_if.h,v 1.3 1993/05/20 04:35:54 cgd Exp
1.1       root       35:  */
                     36: 
1.1.1.2 ! root       37: #ifndef _NETNS_NS_IF_H_
        !            38: #define _NETNS_NS_IF_H_
        !            39: 
1.1       root       40: /*
                     41:  * Interface address, xerox version.  One of these structures
                     42:  * is allocated for each interface with an internet address.
                     43:  * The ifaddr structure contains the protocol-independent part
                     44:  * of the structure and is assumed to be first.
                     45:  */
                     46: 
                     47: struct ns_ifaddr {
                     48:        struct  ifaddr ia_ifa;          /* protocol-independent info */
                     49: #define        ia_ifp          ia_ifa.ifa_ifp
                     50: #define        ia_flags        ia_ifa.ifa_flags
                     51: /*     union   ns_net  ia_net;         /* network number of interface */
                     52: #define ia_net         ia_addr.sns_addr.x_net
                     53:        struct  ns_ifaddr *ia_next;     /* next in list of xerox addresses */
                     54:        struct  sockaddr_ns ia_addr;    /* reserve space for my address */
                     55:        struct  sockaddr_ns ia_dstaddr; /* space for my broadcast address */
                     56: #define ia_broadaddr   ia_dstaddr
                     57:        struct  sockaddr_ns ia_netmask; /* space for my network mask */
                     58: };
                     59: 
                     60: struct ns_aliasreq {
                     61:        char    ifra_name[IFNAMSIZ];            /* if name, e.g. "en0" */
                     62:        struct  sockaddr_ns ifra_addr;
                     63:        struct  sockaddr_ns ifra_broadaddr;
                     64: #define ifra_dstaddr ifra_broadaddr
                     65: };
                     66: /*
                     67:  * Given a pointer to an ns_ifaddr (ifaddr),
                     68:  * return a pointer to the addr as a sockadd_ns.
                     69:  */
                     70: 
                     71: #define        IA_SNS(ia) (&(((struct ns_ifaddr *)(ia))->ia_addr))
                     72: 
                     73: /* This is not the right place for this but where is? */
                     74: #define        ETHERTYPE_NS    0x0600
                     75: 
                     76: #ifdef NSIP
                     77: struct nsip_req {
                     78:        struct sockaddr rq_ns;  /* must be ns format destination */
                     79:        struct sockaddr rq_ip;  /* must be ip format gateway */
                     80:        short rq_flags;
                     81: };
                     82: #endif
                     83: 
                     84: #ifdef KERNEL
                     85: struct ns_ifaddr *ns_ifaddr;
                     86: struct ns_ifaddr *ns_iaonnetof();
                     87: struct ifqueue nsintrq;        /* XNS input packet queue */
                     88: #endif
1.1.1.2 ! root       89: 
        !            90: #endif /* !_NETNS_NS_IF_H_ */

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