2001-06-13 21:52:19 +00:00
|
|
|
/*-
|
|
|
|
* Copyright (c) 1996 - 2001 Brian Somers <brian@Awfulhak.org>
|
|
|
|
* based on work by Toshiharu OHNO <tony-o@iij.ad.jp>
|
|
|
|
* Internet Initiative Japan, Inc (IIJ)
|
|
|
|
* All rights reserved.
|
1995-01-31 06:29:58 +00:00
|
|
|
*
|
2001-06-13 21:52:19 +00:00
|
|
|
* 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.
|
1995-01-31 06:29:58 +00:00
|
|
|
*
|
2001-06-13 21:52:19 +00:00
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
1995-01-31 06:29:58 +00:00
|
|
|
*
|
1999-08-28 01:35:59 +00:00
|
|
|
* $FreeBSD$
|
1995-01-31 06:29:58 +00:00
|
|
|
*/
|
|
|
|
|
1999-07-27 23:44:00 +00:00
|
|
|
/* Operations - f_srcop, f_dstop */
|
1995-01-31 06:29:58 +00:00
|
|
|
#define OP_NONE 0
|
|
|
|
#define OP_EQ 1
|
|
|
|
#define OP_GT 2
|
1999-07-27 23:44:00 +00:00
|
|
|
#define OP_LT 3
|
1995-01-31 06:29:58 +00:00
|
|
|
|
1999-05-31 23:57:40 +00:00
|
|
|
/* srctype or dsttype */
|
|
|
|
#define T_ADDR 0
|
|
|
|
#define T_MYADDR 1
|
2001-08-14 16:05:52 +00:00
|
|
|
#define T_MYADDR6 2
|
|
|
|
#define T_HISADDR 3
|
|
|
|
#define T_HISADDR6 4
|
|
|
|
#define T_DNS0 5
|
|
|
|
#define T_DNS1 6
|
1999-05-31 23:57:40 +00:00
|
|
|
|
1999-07-27 23:44:00 +00:00
|
|
|
/*
|
|
|
|
* There's a struct filterent for each possible filter rule. The
|
|
|
|
* layout is designed to minimise size (there are 4 * MAXFILTERS of
|
|
|
|
* them) - which is also conveniently a power of 2 (32 bytes) on
|
|
|
|
* architectures where sizeof(int)==4 (this makes indexing faster).
|
|
|
|
*
|
|
|
|
* Note that there are four free bits in the initial word for future
|
|
|
|
* extensions.
|
|
|
|
*/
|
1995-01-31 06:29:58 +00:00
|
|
|
struct filterent {
|
2001-08-14 16:05:52 +00:00
|
|
|
int f_proto; /* Protocol: getprotoby*() */
|
|
|
|
unsigned f_action : 8; /* Filtering action: goto or A_... */
|
1999-07-27 23:44:00 +00:00
|
|
|
unsigned f_srcop : 2; /* Source port operation: OP_... */
|
|
|
|
unsigned f_dstop : 2; /* Destination port operation: OP_... */
|
2000-03-14 20:11:45 +00:00
|
|
|
unsigned f_srctype : 3; /* T_ value of src */
|
|
|
|
unsigned f_dsttype : 3; /* T_ value of dst */
|
1999-07-27 23:44:00 +00:00
|
|
|
unsigned f_estab : 1; /* Check TCP ACK bit */
|
|
|
|
unsigned f_syn : 1; /* Check TCP SYN bit */
|
|
|
|
unsigned f_finrst : 1; /* Check TCP FIN/RST bits */
|
|
|
|
unsigned f_invert : 1; /* true to complement match */
|
2001-08-14 16:05:52 +00:00
|
|
|
struct ncprange f_src; /* Source address and mask */
|
|
|
|
struct ncprange f_dst; /* Destination address and mask */
|
1999-07-27 23:44:00 +00:00
|
|
|
u_short f_srcport; /* Source port, compared with f_srcop */
|
|
|
|
u_short f_dstport; /* Destination port, compared with f_dstop */
|
2000-07-11 22:11:36 +00:00
|
|
|
unsigned timeout; /* Keep alive value for passed packet */
|
1995-01-31 06:29:58 +00:00
|
|
|
};
|
|
|
|
|
1999-07-27 23:44:00 +00:00
|
|
|
#define MAXFILTERS 40 /* in each filter set */
|
|
|
|
|
|
|
|
/* f_action values [0..MAXFILTERS) specify the next filter rule, others are: */
|
|
|
|
#define A_NONE (MAXFILTERS)
|
|
|
|
#define A_PERMIT (A_NONE+1)
|
|
|
|
#define A_DENY (A_PERMIT+1)
|
1998-05-21 21:49:08 +00:00
|
|
|
|
|
|
|
struct filter {
|
|
|
|
struct filterent rule[MAXFILTERS]; /* incoming packet filter */
|
|
|
|
const char *name;
|
|
|
|
unsigned fragok : 1;
|
|
|
|
unsigned logok : 1;
|
|
|
|
};
|
1995-01-31 06:29:58 +00:00
|
|
|
|
1999-07-27 23:44:00 +00:00
|
|
|
/* Which filter set */
|
1995-03-11 15:18:55 +00:00
|
|
|
#define FL_IN 0
|
|
|
|
#define FL_OUT 1
|
|
|
|
#define FL_DIAL 2
|
|
|
|
#define FL_KEEP 3
|
1995-01-31 06:29:58 +00:00
|
|
|
|
1998-05-21 21:49:08 +00:00
|
|
|
struct ipcp;
|
|
|
|
struct cmdargs;
|
1997-08-25 00:29:32 +00:00
|
|
|
|
1998-05-21 21:49:08 +00:00
|
|
|
extern int filter_Show(struct cmdargs const *);
|
|
|
|
extern int filter_Set(struct cmdargs const *);
|
|
|
|
extern const char * filter_Action2Nam(int);
|
|
|
|
extern const char *filter_Op2Nam(int);
|
2001-08-14 16:05:52 +00:00
|
|
|
extern void filter_AdjustAddr(struct filter *, struct ncpaddr *,
|
|
|
|
struct ncpaddr *, struct in_addr *);
|