Return to if_arp.h CVS log

Up to [Net/2] / Net2 / net

Annotation of Net2/net/if_arp.h, revision 1.1.1.2

1.1       root        1: /*
                      2:  * Copyright (c) 1986 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: @(#)if_arp.h      7.4 (Berkeley) 6/28/90
        !            34:  *     if_arp.h,v 1.3 1993/05/20 03:05:57 cgd Exp
1.1       root       35:  */
                     36: 
1.1.1.2 ! root       37: #ifndef _NET_IF_ARP_H_
        !            38: #define _NET_IF_ARP_H_
        !            39: 
1.1       root       40: /*
                     41:  * Address Resolution Protocol.
                     42:  *
                     43:  * See RFC 826 for protocol description.  ARP packets are variable
                     44:  * in size; the arphdr structure defines the fixed-length portion.
                     45:  * Protocol type values are the same as those for 10 Mb/s Ethernet.
                     46:  * It is followed by the variable-sized fields ar_sha, arp_spa,
                     47:  * arp_tha and arp_tpa in that order, according to the lengths
                     48:  * specified.  Field names used correspond to RFC 826.
                     49:  */
                     50: struct arphdr {
                     51:        u_short ar_hrd;         /* format of hardware address */
                     52: #define ARPHRD_ETHER   1       /* ethernet hardware address */
                     53:        u_short ar_pro;         /* format of protocol address */
                     54:        u_char  ar_hln;         /* length of hardware address */
                     55:        u_char  ar_pln;         /* length of protocol address */
                     56:        u_short ar_op;          /* one of: */
                     57: #define        ARPOP_REQUEST   1       /* request to resolve address */
                     58: #define        ARPOP_REPLY     2       /* response to previous request */
                     59: /*
                     60:  * The remaining fields are variable in size,
                     61:  * according to the sizes above.
                     62:  */
                     63: /*     u_char  ar_sha[];       /* sender hardware address */
                     64: /*     u_char  ar_spa[];       /* sender protocol address */
                     65: /*     u_char  ar_tha[];       /* target hardware address */
                     66: /*     u_char  ar_tpa[];       /* target protocol address */
                     67: };
                     68: 
                     69: /*
                     70:  * ARP ioctl request
                     71:  */
                     72: struct arpreq {
                     73:        struct  sockaddr arp_pa;                /* protocol address */
                     74:        struct  sockaddr arp_ha;                /* hardware address */
                     75:        int     arp_flags;                      /* flags */
                     76: };
                     77: /*  arp_flags and at_flags field values */
                     78: #define        ATF_INUSE       0x01    /* entry in use */
                     79: #define ATF_COM                0x02    /* completed entry (enaddr valid) */
                     80: #define        ATF_PERM        0x04    /* permanent entry */
                     81: #define        ATF_PUBL        0x08    /* publish entry (respond for other host) */
                     82: #define        ATF_USETRAILERS 0x10    /* has requested trailers */
1.1.1.2 ! root       83: 
        !            84: #endif /* !_NET_IF_ARP_H_ */

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