2007-07-15 01:02:36 +04:00
|
|
|
/* $NetBSD: if_pppvar.h,v 1.26 2007/07/14 21:02:41 ad Exp $ */
|
1997-03-12 23:26:46 +03:00
|
|
|
/* Id: if_pppvar.h,v 1.3 1996/07/01 01:04:37 paulus Exp */
|
|
|
|
|
1995-07-04 10:28:17 +04:00
|
|
|
/*
|
|
|
|
* if_pppvar.h - private structures and declarations for PPP.
|
|
|
|
*
|
2002-09-13 18:32:11 +04:00
|
|
|
* Copyright (c) 1989-2002 Paul Mackerras. All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
*
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
*
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in
|
|
|
|
* the documentation and/or other materials provided with the
|
|
|
|
* distribution.
|
|
|
|
*
|
|
|
|
* 3. The name(s) of the authors of this software must not be used to
|
|
|
|
* endorse or promote products derived from this software without
|
|
|
|
* prior written permission.
|
|
|
|
*
|
|
|
|
* 4. Redistributions of any form whatsoever must retain the following
|
|
|
|
* acknowledgment:
|
|
|
|
* "This product includes software developed by Paul Mackerras
|
|
|
|
* <paulus@samba.org>".
|
|
|
|
*
|
|
|
|
* THE AUTHORS OF THIS SOFTWARE DISCLAIM ALL WARRANTIES WITH REGARD TO
|
|
|
|
* THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
|
|
|
|
* AND FITNESS, IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
|
|
|
|
* SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
|
|
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN
|
|
|
|
* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
1995-07-04 10:28:17 +04:00
|
|
|
*
|
2002-07-02 02:09:31 +04:00
|
|
|
* Copyright (c) 1984-2000 Carnegie Mellon University. All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
*
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
*
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in
|
|
|
|
* the documentation and/or other materials provided with the
|
|
|
|
* distribution.
|
|
|
|
*
|
|
|
|
* 3. The name "Carnegie Mellon University" must not be used to
|
|
|
|
* endorse or promote products derived from this software without
|
|
|
|
* prior written permission. For permission or any legal
|
|
|
|
* details, please contact
|
|
|
|
* Office of Technology Transfer
|
|
|
|
* Carnegie Mellon University
|
|
|
|
* 5000 Forbes Avenue
|
|
|
|
* Pittsburgh, PA 15213-3890
|
|
|
|
* (412) 268-4387, fax: (412) 268-7395
|
|
|
|
* tech-transfer@andrew.cmu.edu
|
|
|
|
*
|
|
|
|
* 4. Redistributions of any form whatsoever must retain the following
|
|
|
|
* acknowledgment:
|
|
|
|
* "This product includes software developed by Computing Services
|
|
|
|
* at Carnegie Mellon University (http://www.cmu.edu/computing/)."
|
1995-07-04 10:28:17 +04:00
|
|
|
*
|
2002-07-02 02:09:31 +04:00
|
|
|
* CARNEGIE MELLON UNIVERSITY DISCLAIMS ALL WARRANTIES WITH REGARD TO
|
|
|
|
* THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
|
|
|
|
* AND FITNESS, IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY BE LIABLE
|
|
|
|
* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
|
|
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN
|
|
|
|
* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
1995-07-04 10:28:17 +04:00
|
|
|
*/
|
|
|
|
|
1998-02-09 20:43:44 +03:00
|
|
|
#ifndef _NET_IF_PPPVAR_H_
|
|
|
|
#define _NET_IF_PPPVAR_H_
|
|
|
|
|
2000-03-23 10:01:25 +03:00
|
|
|
#include <sys/callout.h>
|
|
|
|
|
1995-07-04 10:28:17 +04:00
|
|
|
/*
|
|
|
|
* Supported network protocols. These values are used for
|
|
|
|
* indexing sc_npmode.
|
|
|
|
*/
|
|
|
|
#define NP_IP 0 /* Internet Protocol */
|
1999-07-30 14:35:34 +04:00
|
|
|
#define NP_IPV6 1 /* Internet Protocol version 6 */
|
|
|
|
#define NUM_NP 2 /* Number of NPs. */
|
1995-07-04 10:28:17 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Structure describing each ppp unit.
|
|
|
|
*/
|
|
|
|
struct ppp_softc {
|
|
|
|
struct ifnet sc_if; /* network-visible interface */
|
1996-05-07 06:40:22 +04:00
|
|
|
int sc_unit; /* XXX unit number */
|
1995-07-04 10:28:17 +04:00
|
|
|
u_int sc_flags; /* control/status bits; see if_ppp.h */
|
|
|
|
void *sc_devp; /* pointer to device-dep structure */
|
2005-12-12 02:05:24 +03:00
|
|
|
void (*sc_start)(struct ppp_softc *); /* start output proc */
|
|
|
|
void (*sc_ctlp)(struct ppp_softc *); /* rcvd control pkt */
|
|
|
|
void (*sc_relinq)(struct ppp_softc *); /* relinquish ifunit */
|
2000-03-23 10:01:25 +03:00
|
|
|
struct callout sc_timo_ch; /* timeout callout */
|
1995-07-04 10:28:17 +04:00
|
|
|
u_int16_t sc_mru; /* max receive unit */
|
|
|
|
pid_t sc_xfer; /* used in transferring unit */
|
|
|
|
struct ifqueue sc_rawq; /* received packets */
|
|
|
|
struct ifqueue sc_inq; /* queue of input packets for daemon */
|
|
|
|
struct ifqueue sc_fastq; /* interactive output packet q */
|
|
|
|
struct mbuf *sc_togo; /* output packet ready to go */
|
|
|
|
struct mbuf *sc_npqueue; /* output packets not to be sent yet */
|
|
|
|
struct mbuf **sc_npqtail; /* ptr to last next ptr in npqueue */
|
1996-03-15 05:28:00 +03:00
|
|
|
struct pppstat sc_stats; /* count of bytes/pkts sent/rcvd */
|
1995-07-04 10:28:17 +04:00
|
|
|
enum NPmode sc_npmode[NUM_NP]; /* what to do with each NP */
|
|
|
|
struct compressor *sc_xcomp; /* transmit compressor */
|
|
|
|
void *sc_xc_state; /* transmit compressor state */
|
|
|
|
struct compressor *sc_rcomp; /* receive decompressor */
|
|
|
|
void *sc_rc_state; /* receive decompressor state */
|
|
|
|
time_t sc_last_sent; /* time (secs) last NP pkt sent */
|
|
|
|
time_t sc_last_recv; /* time (secs) last NP pkt rcvd */
|
2001-01-15 19:33:30 +03:00
|
|
|
void *sc_si; /* software interrupt handle */
|
1997-03-12 23:26:46 +03:00
|
|
|
#ifdef PPP_FILTER
|
Decouple inbound and outbound filters. Now instead of using "active-filter"
and "pass-filter" and "inbound" and "outbound" qualifiers in the filter
expression, use new "active-filter-in", "active-filter-out", "pass-filter-in",
and "pass-filter-out" without these qualifiers.
This is necessary due to the horrible, awful way "inbound" and "outbound"
were specified for the filter programs when a packet was passed through them.
Basically, the "address" byte in the serial PPP header was overwritten with
a value to indicate the direction. However, the "address" byte doesn't even
exist on PPP headers for all other PPP encaps! So, this old method worked
only for serial encaps, and corrupted packets for all others (PPPoE, ATM, etc.)
1999-05-12 22:50:51 +04:00
|
|
|
/* Filter for packets to pass. */
|
|
|
|
struct bpf_program sc_pass_filt_in;
|
|
|
|
struct bpf_program sc_pass_filt_out;
|
|
|
|
|
|
|
|
/* Filter for "non-idle" packets. */
|
|
|
|
struct bpf_program sc_active_filt_in;
|
|
|
|
struct bpf_program sc_active_filt_out;
|
1997-03-12 23:26:46 +03:00
|
|
|
#endif /* PPP_FILTER */
|
1996-03-15 05:28:00 +03:00
|
|
|
#ifdef VJC
|
|
|
|
struct slcompress *sc_comp; /* vjc control buffer */
|
|
|
|
#endif
|
1997-03-12 23:26:46 +03:00
|
|
|
|
1995-07-04 10:28:17 +04:00
|
|
|
/* Device-dependent part for async lines. */
|
|
|
|
ext_accm sc_asyncmap; /* async control character map */
|
|
|
|
u_int32_t sc_rasyncmap; /* receive async control char map */
|
|
|
|
struct mbuf *sc_outm; /* mbuf chain currently being output */
|
|
|
|
struct mbuf *sc_m; /* pointer to input mbuf chain */
|
|
|
|
struct mbuf *sc_mc; /* pointer to current input mbuf */
|
|
|
|
char *sc_mp; /* ptr to next char in input mbuf */
|
|
|
|
u_int16_t sc_ilen; /* length of input packet so far */
|
|
|
|
u_int16_t sc_fcs; /* FCS so far (input) */
|
|
|
|
u_int16_t sc_outfcs; /* FCS so far for output packet */
|
2005-12-28 11:13:24 +03:00
|
|
|
u_int16_t sc_maxfastq; /* Maximum number of packets that
|
|
|
|
* can be received back-to-back in
|
|
|
|
* the high priority queue */
|
|
|
|
u_int8_t sc_nfastq; /* Number of packets received
|
|
|
|
* back-to-back in the high priority
|
|
|
|
* queue */
|
2003-09-01 20:51:25 +04:00
|
|
|
u_char sc_rawin_start; /* current char start */
|
|
|
|
struct ppp_rawin sc_rawin; /* chars as received */
|
2004-12-05 07:15:16 +03:00
|
|
|
LIST_ENTRY(ppp_softc) sc_iflist;
|
1995-07-04 10:28:17 +04:00
|
|
|
};
|
|
|
|
|
1997-01-03 10:23:29 +03:00
|
|
|
#ifdef _KERNEL
|
1995-07-04 10:28:17 +04:00
|
|
|
|
2005-12-12 02:05:24 +03:00
|
|
|
struct ppp_softc *pppalloc(pid_t);
|
|
|
|
void pppdealloc(struct ppp_softc *);
|
2007-03-04 08:59:00 +03:00
|
|
|
int pppioctl(struct ppp_softc *, u_long, void *, int, struct lwp *);
|
2005-12-12 02:05:24 +03:00
|
|
|
void ppp_restart(struct ppp_softc *);
|
|
|
|
void ppppktin(struct ppp_softc *, struct mbuf *, int);
|
|
|
|
struct mbuf *ppp_dequeue(struct ppp_softc *);
|
KNF: de-__P, bzero -> memset, bcmp -> memcmp. Remove extraneous
parentheses in return statements.
Cosmetic: don't open-code TAILQ_FOREACH().
Cosmetic: change types of variables to avoid oodles of casts: in
in6_src.c, avoid casts by changing several route_in6 pointers
to struct route pointers. Remove unnecessary casts to caddr_t
elsewhere.
Pave the way for eliminating address family-specific route caches:
soon, struct route will not embed a sockaddr, but it will hold
a reference to an external sockaddr, instead. We will set the
destination sockaddr using rtcache_setdst(). (I created a stub
for it, but it isn't used anywhere, yet.) rtcache_free() will
free the sockaddr. I have extracted from rtcache_free() a helper
subroutine, rtcache_clear(). rtcache_clear() will "forget" a
cached route, but it will not forget the destination by releasing
the sockaddr. I use rtcache_clear() instead of rtcache_free()
in rtcache_update(), because rtcache_update() is not supposed
to forget the destination.
Constify:
1 Introduce const accessor for route->ro_dst, rtcache_getdst().
2 Constify the 'dst' argument to ifnet->if_output(). This
led me to constify a lot of code called by output routines.
3 Constify the sockaddr argument to protosw->pr_ctlinput. This
led me to constify a lot of code called by ctlinput routines.
4 Introduce const macros for converting from a generic sockaddr
to family-specific sockaddrs, e.g., sockaddr_in: satocsin6,
satocsin, et cetera.
2007-02-18 01:34:07 +03:00
|
|
|
int pppoutput(struct ifnet *, struct mbuf *, const struct sockaddr *,
|
2005-12-12 02:05:24 +03:00
|
|
|
struct rtentry *);
|
1997-01-03 10:23:29 +03:00
|
|
|
#endif /* _KERNEL */
|
1998-02-09 20:43:44 +03:00
|
|
|
|
2005-12-11 02:21:38 +03:00
|
|
|
#endif /* !_NET_IF_PPPVAR_H_ */
|