Annotation of kernel/bsd/net/if_slvar.h, revision 1.1.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: /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
                     26: /*-
                     27:  * Copyright (c) 1991, 1993
                     28:  *     The Regents of the University of California.  All rights reserved.
                     29:  *
                     30:  * Redistribution and use in source and binary forms, with or without
                     31:  * modification, are permitted provided that the following conditions
                     32:  * are met:
                     33:  * 1. Redistributions of source code must retain the above copyright
                     34:  *    notice, this list of conditions and the following disclaimer.
                     35:  * 2. Redistributions in binary form must reproduce the above copyright
                     36:  *    notice, this list of conditions and the following disclaimer in the
                     37:  *    documentation and/or other materials provided with the distribution.
                     38:  * 3. All advertising materials mentioning features or use of this software
                     39:  *    must display the following acknowledgement:
                     40:  *     This product includes software developed by the University of
                     41:  *     California, Berkeley and its contributors.
                     42:  * 4. Neither the name of the University nor the names of its contributors
                     43:  *    may be used to endorse or promote products derived from this software
                     44:  *    without specific prior written permission.
                     45:  *
                     46:  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
                     47:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
                     48:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
                     49:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
                     50:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
                     51:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
                     52:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
                     53:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
                     54:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
                     55:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
                     56:  * SUCH DAMAGE.
                     57:  *
                     58:  *     @(#)if_slvar.h  8.4 (Berkeley) 1/9/95
                     59:  *
                     60:  *     @(#)if_slvar.h  8.3 (Berkeley) 2/1/94
                     61:  */
                     62: 
                     63: /*
                     64:  * Definitions for SLIP interface data structures
                     65:  * 
                     66:  * (This exists so programs like slstats can get at the definition
                     67:  *  of sl_softc.)
                     68:  */
                     69: struct sl_softc {
                     70:        struct  ifnet sc_if;            /* network-visible interface */
                     71:        struct  ifqueue sc_fastq;       /* interactive output queue */
                     72:        struct  tty *sc_ttyp;           /* pointer to tty structure */
                     73:        u_char  *sc_mp;                 /* pointer to next available buf char */
                     74:        u_char  *sc_ep;                 /* pointer to last available buf char */
                     75:        u_char  *sc_buf;                /* input buffer */
                     76:        u_int   sc_flags;               /* see below */
                     77:        u_int   sc_escape;      /* =1 if last char input was FRAME_ESCAPE */
                     78:        long    sc_lasttime;            /* last time a char arrived */
                     79:        long    sc_abortcount;          /* number of abort esacpe chars */
                     80:        long    sc_starttime;           /* time of first abort in window */
                     81:        long    sc_oqlen;               /* previous output queue size */
                     82:        long    sc_otimeout;            /* number of times output's stalled */
                     83:        int     sc_oldbufsize;          /* previous output buffer size */
                     84:        int     sc_oldbufquot;          /* previous output buffer quoting */
                     85: #if INET                               /* XXX */
                     86:        struct  slcompress sc_comp;     /* tcp compression data */
                     87: #endif
                     88:        caddr_t sc_bpf;                 /* BPF data */
                     89: };
                     90: 
                     91: /* internal flags */
                     92: #define        SC_ERROR        0x0001          /* had an input error */
                     93: 
                     94: /* visible flags */
                     95: #define        SC_COMPRESS     IFF_LINK0       /* compress TCP traffic */
                     96: #define        SC_NOICMP       IFF_LINK1       /* supress ICMP traffic */
                     97: #define        SC_AUTOCOMP     IFF_LINK2       /* auto-enable TCP compression */
                     98: 
                     99: #ifdef _KERNEL
                    100: void   slattach __P((void));
                    101: void   slclose __P((struct tty *));
                    102: void   slinput __P((int, struct tty *));
                    103: int    slioctl __P((struct ifnet *, u_long, caddr_t));
                    104: int    slopen __P((dev_t, struct tty *));
                    105: int    sloutput __P((struct ifnet *,
                    106:            struct mbuf *, struct sockaddr *, struct rtentry *));
                    107: void   slstart __P((struct tty *));
                    108: int    sltioctl __P((struct tty *, u_long, caddr_t, int));
                    109: #endif /* _KERNEL */

unix.superglobalmegacorp.com

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