1999-04-28 02:49:29 +00:00
|
|
|
.\"
|
1999-08-28 00:22:10 +00:00
|
|
|
.\" $FreeBSD$
|
1999-04-28 02:49:29 +00:00
|
|
|
.\"
|
2016-08-13 16:09:49 +00:00
|
|
|
.Dd August 13, 2016
|
1999-06-15 12:56:38 +00:00
|
|
|
.Dt IPFW 8
|
2001-07-10 11:04:34 +00:00
|
|
|
.Os
|
1994-11-17 09:50:30 +00:00
|
|
|
.Sh NAME
|
1995-10-26 05:36:24 +00:00
|
|
|
.Nm ipfw
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.Nd User interface for firewall, traffic shaper, packet scheduler,
|
|
|
|
in-kernel NAT.
|
1994-11-17 09:50:30 +00:00
|
|
|
.Sh SYNOPSIS
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.Ss FIREWALL CONFIGURATION
|
2000-11-20 16:52:27 +00:00
|
|
|
.Nm
|
2002-08-19 12:36:54 +00:00
|
|
|
.Op Fl cq
|
2002-08-10 15:04:40 +00:00
|
|
|
.Cm add
|
|
|
|
.Ar rule
|
2000-11-20 16:52:27 +00:00
|
|
|
.Nm
|
2003-07-12 08:35:25 +00:00
|
|
|
.Op Fl acdefnNStT
|
2007-06-18 17:52:37 +00:00
|
|
|
.Op Cm set Ar N
|
2001-10-01 14:13:36 +00:00
|
|
|
.Brq Cm list | show
|
2003-07-12 07:01:48 +00:00
|
|
|
.Op Ar rule | first-last ...
|
2000-11-20 16:52:27 +00:00
|
|
|
.Nm
|
2002-08-10 15:04:40 +00:00
|
|
|
.Op Fl f | q
|
2007-06-18 17:52:37 +00:00
|
|
|
.Op Cm set Ar N
|
2002-08-10 15:04:40 +00:00
|
|
|
.Cm flush
|
2000-11-20 16:52:27 +00:00
|
|
|
.Nm
|
2002-08-10 15:04:40 +00:00
|
|
|
.Op Fl q
|
2007-06-18 17:52:37 +00:00
|
|
|
.Op Cm set Ar N
|
2002-08-16 10:31:47 +00:00
|
|
|
.Brq Cm delete | zero | resetlog
|
2002-08-10 15:04:40 +00:00
|
|
|
.Op Ar number ...
|
2002-08-16 10:31:47 +00:00
|
|
|
.Pp
|
2000-11-20 16:52:27 +00:00
|
|
|
.Nm
|
2002-08-16 10:31:47 +00:00
|
|
|
.Cm set Oo Cm disable Ar number ... Oc Op Cm enable Ar number ...
|
|
|
|
.Nm
|
|
|
|
.Cm set move
|
|
|
|
.Op Cm rule
|
|
|
|
.Ar number Cm to Ar number
|
2000-11-20 16:52:27 +00:00
|
|
|
.Nm
|
2002-08-16 10:31:47 +00:00
|
|
|
.Cm set swap Ar number number
|
|
|
|
.Nm
|
|
|
|
.Cm set show
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.Ss SYSCTL SHORTCUTS
|
|
|
|
.Nm
|
|
|
|
.Cm enable
|
|
|
|
.Brq Cm firewall | altq | one_pass | debug | verbose | dyn_keepalive
|
|
|
|
.Nm
|
|
|
|
.Cm disable
|
|
|
|
.Brq Cm firewall | altq | one_pass | debug | verbose | dyn_keepalive
|
|
|
|
.Ss LOOKUP TABLES
|
2002-08-10 15:04:40 +00:00
|
|
|
.Nm
|
2014-08-13 15:29:29 +00:00
|
|
|
.Oo Cm set Ar N Oc Cm table Ar name Cm create Ar create-options
|
2004-06-09 20:10:38 +00:00
|
|
|
.Nm
|
2014-08-13 15:29:29 +00:00
|
|
|
.Oo Cm set Ar N Oc Cm table Ar name Cm destroy
|
2004-06-09 20:10:38 +00:00
|
|
|
.Nm
|
2014-08-13 15:29:29 +00:00
|
|
|
.Oo Cm set Ar N Oc Cm table Ar name Cm modify Ar modify-options
|
2014-08-13 00:19:18 +00:00
|
|
|
.Nm
|
2014-08-13 15:29:29 +00:00
|
|
|
.Oo Cm set Ar N Oc Cm table Ar name Cm swap Ar name
|
2014-08-13 00:19:18 +00:00
|
|
|
.Nm
|
2014-08-13 15:29:29 +00:00
|
|
|
.Oo Cm set Ar N Oc Cm table Ar name Cm add Ar table-key Op Ar value
|
2014-08-13 00:19:18 +00:00
|
|
|
.Nm
|
2014-08-13 15:29:29 +00:00
|
|
|
.Oo Cm set Ar N Oc Cm table Ar name Cm add Op Ar table-key Ar value ...
|
2014-08-13 00:19:18 +00:00
|
|
|
.Nm
|
2014-08-13 15:29:29 +00:00
|
|
|
.Oo Cm set Ar N Oc Cm table Ar name Cm atomic add Op Ar table-key Ar value ...
|
2014-08-13 00:19:18 +00:00
|
|
|
.Nm
|
2014-08-13 15:29:29 +00:00
|
|
|
.Oo Cm set Ar N Oc Cm table Ar name Cm delete Op Ar table-key ...
|
2014-08-13 00:19:18 +00:00
|
|
|
.Nm
|
2014-08-13 15:29:29 +00:00
|
|
|
.Oo Cm set Ar N Oc Cm table Ar name Cm lookup Ar addr
|
2014-08-13 00:19:18 +00:00
|
|
|
.Nm
|
2014-08-13 15:29:29 +00:00
|
|
|
.Oo Cm set Ar N Oc Cm table Ar name Cm lock
|
2014-08-13 00:19:18 +00:00
|
|
|
.Nm
|
2014-08-13 15:29:29 +00:00
|
|
|
.Oo Cm set Ar N Oc Cm table Ar name Cm unlock
|
2004-06-09 20:10:38 +00:00
|
|
|
.Nm
|
2014-08-13 15:29:29 +00:00
|
|
|
.Oo Cm set Ar N Oc Cm table
|
2014-08-13 00:19:18 +00:00
|
|
|
.Brq Ar name | all
|
2008-09-27 15:09:00 +00:00
|
|
|
.Cm list
|
2014-08-13 00:19:18 +00:00
|
|
|
.Nm
|
2014-08-13 15:29:29 +00:00
|
|
|
.Oo Cm set Ar N Oc Cm table
|
2014-08-13 00:19:18 +00:00
|
|
|
.Brq Ar name | all
|
2014-12-29 13:50:59 +00:00
|
|
|
.Cm info
|
2014-08-13 00:19:18 +00:00
|
|
|
.Nm
|
2014-08-13 15:29:29 +00:00
|
|
|
.Oo Cm set Ar N Oc Cm table
|
2014-08-13 00:19:18 +00:00
|
|
|
.Brq Ar name | all
|
|
|
|
.Cm detail
|
|
|
|
.Nm
|
2014-08-13 15:29:29 +00:00
|
|
|
.Oo Cm set Ar N Oc Cm table
|
2014-08-13 00:19:18 +00:00
|
|
|
.Brq Ar name | all
|
|
|
|
.Cm flush
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.Ss DUMMYNET CONFIGURATION (TRAFFIC SHAPER AND PACKET SCHEDULER)
|
2004-06-09 20:10:38 +00:00
|
|
|
.Nm
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.Brq Cm pipe | queue | sched
|
2000-06-08 13:38:57 +00:00
|
|
|
.Ar number
|
|
|
|
.Cm config
|
2002-08-10 15:04:40 +00:00
|
|
|
.Ar config-options
|
2000-11-20 16:52:27 +00:00
|
|
|
.Nm
|
2002-08-10 15:04:40 +00:00
|
|
|
.Op Fl s Op Ar field
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.Brq Cm pipe | queue | sched
|
2001-10-01 14:13:36 +00:00
|
|
|
.Brq Cm delete | list | show
|
2000-01-08 11:19:19 +00:00
|
|
|
.Op Ar number ...
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.Ss IN-KERNEL NAT
|
2002-08-10 15:04:40 +00:00
|
|
|
.Nm
|
2008-12-18 21:46:18 +00:00
|
|
|
.Op Fl q
|
2007-02-15 14:32:26 +00:00
|
|
|
.Cm nat
|
|
|
|
.Ar number
|
|
|
|
.Cm config
|
|
|
|
.Ar config-options
|
|
|
|
.Pp
|
|
|
|
.Nm
|
2003-12-24 13:04:04 +00:00
|
|
|
.Op Fl cfnNqS
|
2002-08-10 15:04:40 +00:00
|
|
|
.Oo
|
|
|
|
.Fl p Ar preproc
|
2002-12-23 20:08:21 +00:00
|
|
|
.Oo
|
|
|
|
.Ar preproc-flags
|
2002-08-10 15:04:40 +00:00
|
|
|
.Oc
|
|
|
|
.Oc
|
|
|
|
.Ar pathname
|
2016-08-13 16:09:49 +00:00
|
|
|
.Ss STATEFUL IPv6/IPv4 NETWORK ADDRESS AND PROTOCOL TRANSLATION
|
|
|
|
.Nm
|
|
|
|
.Oo Cm set Ar N Oc Cm nat64lsn Ar name Cm create Ar create-options
|
|
|
|
.Nm
|
|
|
|
.Oo Cm set Ar N Oc Cm nat64lsn Ar name Cm config Ar config-options
|
|
|
|
.Nm
|
|
|
|
.Oo Cm set Ar N Oc Cm nat64lsn
|
|
|
|
.Brq Ar name | all
|
|
|
|
.Brq Cm list | show
|
|
|
|
.Op Cm states
|
|
|
|
.Nm
|
|
|
|
.Oo Cm set Ar N Oc Cm nat64lsn
|
|
|
|
.Brq Ar name | all
|
|
|
|
.Cm destroy
|
|
|
|
.Nm
|
|
|
|
.Oo Cm set Ar N Oc Cm nat64lsn Ar name Cm stats Op Cm reset
|
|
|
|
.Ss STATELESS IPv6/IPv4 NETWORK ADDRESS AND PROTOCOL TRANSLATION
|
|
|
|
.Nm
|
|
|
|
.Oo Cm set Ar N Oc Cm nat64stl Ar name Cm create Ar create-options
|
|
|
|
.Nm
|
|
|
|
.Oo Cm set Ar N Oc Cm nat64stl Ar name Cm config Ar config-options
|
|
|
|
.Nm
|
|
|
|
.Oo Cm set Ar N Oc Cm nat64stl
|
|
|
|
.Brq Ar name | all
|
|
|
|
.Brq Cm list | show
|
|
|
|
.Nm
|
|
|
|
.Oo Cm set Ar N Oc Cm nat64stl
|
|
|
|
.Brq Ar name | all
|
|
|
|
.Cm destroy
|
|
|
|
.Nm
|
|
|
|
.Oo Cm set Ar N Oc Cm nat64stl Ar name Cm stats Op Cm reset
|
2016-07-18 19:46:31 +00:00
|
|
|
.Ss IPv6-to-IPv6 NETWORK PREFIX TRANSLATION
|
|
|
|
.Nm
|
|
|
|
.Oo Cm set Ar N Oc Cm nptv6 Ar name Cm create Ar create-options
|
|
|
|
.Nm
|
|
|
|
.Oo Cm set Ar N Oc Cm nptv6
|
|
|
|
.Brq Ar name | all
|
|
|
|
.Brq Cm list | show
|
|
|
|
.Nm
|
|
|
|
.Oo Cm set Ar N Oc Cm nptv6
|
|
|
|
.Brq Ar name | all
|
|
|
|
.Cm destroy
|
|
|
|
.Nm
|
2016-08-13 16:45:14 +00:00
|
|
|
.Oo Cm set Ar N Oc Cm nptv6 Ar name Cm stats Op Cm reset
|
2014-08-14 17:31:04 +00:00
|
|
|
.Ss INTERNAL DIAGNOSTICS
|
|
|
|
.Nm
|
|
|
|
.Cm internal iflist
|
|
|
|
.Nm
|
|
|
|
.Cm internal talist
|
2014-10-03 15:36:58 +00:00
|
|
|
.Nm
|
|
|
|
.Cm internal vlist
|
1994-11-17 09:50:30 +00:00
|
|
|
.Sh DESCRIPTION
|
2002-07-06 19:34:18 +00:00
|
|
|
The
|
2000-01-08 11:19:19 +00:00
|
|
|
.Nm
|
2002-07-06 19:34:18 +00:00
|
|
|
utility is the user interface for controlling the
|
2002-08-10 15:04:40 +00:00
|
|
|
.Xr ipfw 4
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
firewall, the
|
2000-02-28 15:21:12 +00:00
|
|
|
.Xr dummynet 4
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
traffic shaper/packet scheduler, and the
|
|
|
|
in-kernel NAT services.
|
2000-01-08 11:19:19 +00:00
|
|
|
.Pp
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
A firewall configuration, or
|
2002-08-10 15:04:40 +00:00
|
|
|
.Em ruleset ,
|
|
|
|
is made of a list of
|
|
|
|
.Em rules
|
|
|
|
numbered from 1 to 65535.
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
Packets are passed to the firewall
|
2002-10-28 07:03:56 +00:00
|
|
|
from a number of different places in the protocol stack
|
2002-08-10 15:04:40 +00:00
|
|
|
(depending on the source and destination of the packet,
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
it is possible for the firewall to be
|
|
|
|
invoked multiple times on the same packet).
|
2002-08-10 15:04:40 +00:00
|
|
|
The packet passed to the firewall is compared
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
against each of the rules in the
|
|
|
|
.Em ruleset ,
|
|
|
|
in rule-number order
|
|
|
|
(multiple rules with the same number are permitted, in which case
|
|
|
|
they are processed in order of insertion).
|
2002-08-10 15:04:40 +00:00
|
|
|
When a match is found, the action corresponding to the
|
|
|
|
matching rule is performed.
|
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
Depending on the action and certain system settings, packets
|
2002-08-10 15:04:40 +00:00
|
|
|
can be reinjected into the firewall at some rule after the
|
2000-02-28 15:21:12 +00:00
|
|
|
matching one for further processing.
|
2000-01-08 11:19:19 +00:00
|
|
|
.Pp
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
A ruleset always includes a
|
2002-08-10 15:04:40 +00:00
|
|
|
.Em default
|
2003-07-15 23:08:44 +00:00
|
|
|
rule (numbered 65535) which cannot be modified or deleted,
|
2001-09-27 23:44:27 +00:00
|
|
|
and matches all packets.
|
2002-08-10 15:04:40 +00:00
|
|
|
The action associated with the
|
|
|
|
.Em default
|
|
|
|
rule can be either
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm deny
|
2000-01-08 11:19:19 +00:00
|
|
|
or
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm allow
|
2000-01-08 11:19:19 +00:00
|
|
|
depending on how the kernel is configured.
|
|
|
|
.Pp
|
2000-02-10 14:25:26 +00:00
|
|
|
If the ruleset includes one or more rules with the
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm keep-state
|
2001-09-27 23:44:27 +00:00
|
|
|
or
|
|
|
|
.Cm limit
|
2009-04-08 15:18:21 +00:00
|
|
|
option,
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
the firewall will have a
|
2000-02-28 15:21:12 +00:00
|
|
|
.Em stateful
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
behaviour, i.e., upon a match it will create
|
|
|
|
.Em dynamic rules ,
|
2012-09-18 02:33:23 +00:00
|
|
|
i.e., rules that match packets with the same 5-tuple
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
(protocol, source and destination addresses and ports)
|
|
|
|
as the packet which caused their creation.
|
|
|
|
Dynamic rules, which have a limited lifetime, are checked
|
2000-02-28 15:21:12 +00:00
|
|
|
at the first occurrence of a
|
2002-08-10 15:04:40 +00:00
|
|
|
.Cm check-state ,
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm keep-state
|
2002-08-10 15:04:40 +00:00
|
|
|
or
|
|
|
|
.Cm limit
|
2000-02-28 15:21:12 +00:00
|
|
|
rule, and are typically used to open the firewall on-demand to
|
|
|
|
legitimate traffic only.
|
|
|
|
See the
|
2002-08-16 10:31:47 +00:00
|
|
|
.Sx STATEFUL FIREWALL
|
2000-02-10 14:25:26 +00:00
|
|
|
and
|
2000-02-28 15:21:12 +00:00
|
|
|
.Sx EXAMPLES
|
2002-08-16 10:31:47 +00:00
|
|
|
Sections below for more information on the stateful behaviour of
|
2000-11-20 16:52:27 +00:00
|
|
|
.Nm .
|
2000-02-28 15:21:12 +00:00
|
|
|
.Pp
|
|
|
|
All rules (including dynamic ones) have a few associated counters:
|
|
|
|
a packet count, a byte count, a log count and a timestamp
|
|
|
|
indicating the time of the last match.
|
|
|
|
Counters can be displayed or reset with
|
2000-01-08 11:19:19 +00:00
|
|
|
.Nm
|
|
|
|
commands.
|
|
|
|
.Pp
|
2009-04-08 15:18:21 +00:00
|
|
|
Each rule belongs to one of 32 different
|
|
|
|
.Em sets
|
|
|
|
, and there are
|
|
|
|
.Nm
|
|
|
|
commands to atomically manipulate sets, such as enable,
|
|
|
|
disable, swap sets, move all rules in a set to another
|
|
|
|
one, delete all rules in a set.
|
|
|
|
These can be useful to
|
|
|
|
install temporary configurations, or to test them.
|
|
|
|
See Section
|
|
|
|
.Sx SETS OF RULES
|
|
|
|
for more information on
|
|
|
|
.Em sets .
|
|
|
|
.Pp
|
2000-01-08 11:19:19 +00:00
|
|
|
Rules can be added with the
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm add
|
2002-08-10 15:04:40 +00:00
|
|
|
command; deleted individually or in groups with the
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm delete
|
2003-07-15 23:08:44 +00:00
|
|
|
command, and globally (except those in set 31) with the
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm flush
|
|
|
|
command; displayed, optionally with the content of the
|
|
|
|
counters, using the
|
|
|
|
.Cm show
|
2000-01-08 11:19:19 +00:00
|
|
|
and
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm list
|
|
|
|
commands.
|
|
|
|
Finally, counters can be reset with the
|
|
|
|
.Cm zero
|
2000-01-08 11:19:19 +00:00
|
|
|
and
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm resetlog
|
2000-01-08 11:19:19 +00:00
|
|
|
commands.
|
|
|
|
.Pp
|
2009-04-08 15:18:21 +00:00
|
|
|
.Ss COMMAND OPTIONS
|
2009-04-08 17:46:45 +00:00
|
|
|
The following general options are available when invoking
|
2009-04-08 15:18:21 +00:00
|
|
|
.Nm :
|
2000-01-08 11:19:19 +00:00
|
|
|
.Bl -tag -width indent
|
|
|
|
.It Fl a
|
2009-04-08 15:18:21 +00:00
|
|
|
Show counter values when listing rules.
|
2002-01-02 20:16:15 +00:00
|
|
|
The
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm show
|
2009-04-08 15:18:21 +00:00
|
|
|
command implies this option.
|
2003-12-12 16:14:28 +00:00
|
|
|
.It Fl b
|
|
|
|
Only show the action and the comment, not the body of a rule.
|
|
|
|
Implies
|
|
|
|
.Fl c .
|
2002-08-19 12:36:54 +00:00
|
|
|
.It Fl c
|
|
|
|
When entering or showing rules, print them in compact form,
|
2009-04-08 15:18:21 +00:00
|
|
|
i.e., omitting the "ip from any to any" string
|
2002-08-19 12:36:54 +00:00
|
|
|
when this does not carry any additional information.
|
2001-05-20 10:01:39 +00:00
|
|
|
.It Fl d
|
2009-04-08 15:18:21 +00:00
|
|
|
When listing, show dynamic rules in addition to static ones.
|
2001-06-04 23:56:26 +00:00
|
|
|
.It Fl e
|
2009-04-08 15:18:21 +00:00
|
|
|
When listing and
|
2001-06-04 23:56:26 +00:00
|
|
|
.Fl d
|
2009-04-08 15:18:21 +00:00
|
|
|
is specified, also show expired dynamic rules.
|
2000-01-08 11:19:19 +00:00
|
|
|
.It Fl f
|
2005-02-13 22:25:33 +00:00
|
|
|
Do not ask for confirmation for commands that can cause problems
|
2012-09-18 02:33:23 +00:00
|
|
|
if misused, i.e.,
|
|
|
|
.Cm flush .
|
2002-08-16 10:31:47 +00:00
|
|
|
If there is no tty associated with the process, this is implied.
|
2008-02-18 19:56:09 +00:00
|
|
|
.It Fl i
|
2009-04-08 15:18:21 +00:00
|
|
|
When listing a table (see the
|
2008-02-18 19:56:09 +00:00
|
|
|
.Sx LOOKUP TABLES
|
|
|
|
section below for more information on lookup tables), format values
|
2012-09-18 02:33:23 +00:00
|
|
|
as IP addresses.
|
|
|
|
By default, values are shown as integers.
|
2003-07-08 08:07:03 +00:00
|
|
|
.It Fl n
|
|
|
|
Only check syntax of the command strings, without actually passing
|
|
|
|
them to the kernel.
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Fl N
|
|
|
|
Try to resolve addresses and service names in output.
|
2000-01-08 11:19:19 +00:00
|
|
|
.It Fl q
|
2009-04-08 15:18:21 +00:00
|
|
|
Be quiet when executing the
|
|
|
|
.Cm add ,
|
|
|
|
.Cm nat ,
|
|
|
|
.Cm zero ,
|
|
|
|
.Cm resetlog
|
2000-02-28 15:21:12 +00:00
|
|
|
or
|
2009-04-08 15:18:21 +00:00
|
|
|
.Cm flush
|
|
|
|
commands;
|
2001-08-07 15:48:51 +00:00
|
|
|
(implies
|
|
|
|
.Fl f ) .
|
2009-04-08 15:18:21 +00:00
|
|
|
This is useful when updating rulesets by executing multiple
|
2000-01-08 11:19:19 +00:00
|
|
|
.Nm
|
|
|
|
commands in a script
|
2001-08-07 15:48:51 +00:00
|
|
|
(e.g.,
|
|
|
|
.Ql sh\ /etc/rc.firewall ) ,
|
2009-04-08 15:18:21 +00:00
|
|
|
or by processing a file with many
|
2000-02-28 15:21:12 +00:00
|
|
|
.Nm
|
2006-09-18 11:55:10 +00:00
|
|
|
rules across a remote login session.
|
|
|
|
It also stops a table add or delete
|
2006-02-14 03:10:29 +00:00
|
|
|
from failing if the entry already exists or is not present.
|
2009-04-08 15:18:21 +00:00
|
|
|
.Pp
|
|
|
|
The reason why this option may be important is that
|
|
|
|
for some of these actions,
|
|
|
|
.Nm
|
|
|
|
may print a message; if the action results in blocking the
|
|
|
|
traffic to the remote client,
|
|
|
|
the remote login session will be closed
|
|
|
|
and the rest of the ruleset will not be processed.
|
2002-08-10 15:04:40 +00:00
|
|
|
Access to the console would then be required to recover.
|
|
|
|
.It Fl S
|
2009-04-08 15:18:21 +00:00
|
|
|
When listing rules, show the
|
2002-08-16 10:31:47 +00:00
|
|
|
.Em set
|
|
|
|
each rule belongs to.
|
2002-08-10 15:04:40 +00:00
|
|
|
If this flag is not specified, disabled rules will not be
|
|
|
|
listed.
|
2000-02-28 15:21:12 +00:00
|
|
|
.It Fl s Op Ar field
|
2009-04-08 15:18:21 +00:00
|
|
|
When listing pipes, sort according to one of the four
|
2002-10-28 07:03:56 +00:00
|
|
|
counters (total or current packets or bytes).
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Fl t
|
2009-04-08 15:18:21 +00:00
|
|
|
When listing, show last match timestamp converted with ctime().
|
2003-07-12 08:35:25 +00:00
|
|
|
.It Fl T
|
2009-04-08 15:18:21 +00:00
|
|
|
When listing, show last match timestamp as seconds from the epoch.
|
2003-07-12 08:35:25 +00:00
|
|
|
This form can be more convenient for postprocessing by scripts.
|
2000-01-08 11:19:19 +00:00
|
|
|
.El
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.Ss LIST OF RULES AND PREPROCESSING
|
2000-02-28 15:21:12 +00:00
|
|
|
To ease configuration, rules can be put into a file which is
|
|
|
|
processed using
|
2000-01-08 11:19:19 +00:00
|
|
|
.Nm
|
2003-01-05 00:09:23 +00:00
|
|
|
as shown in the last synopsis line.
|
2000-10-11 12:17:06 +00:00
|
|
|
An absolute
|
|
|
|
.Ar pathname
|
|
|
|
must be used.
|
2002-08-10 15:04:40 +00:00
|
|
|
The file will be read line by line and applied as arguments to the
|
1996-08-13 19:43:24 +00:00
|
|
|
.Nm
|
2000-02-28 15:21:12 +00:00
|
|
|
utility.
|
1996-02-24 13:39:46 +00:00
|
|
|
.Pp
|
1998-11-23 10:54:28 +00:00
|
|
|
Optionally, a preprocessor can be specified using
|
|
|
|
.Fl p Ar preproc
|
|
|
|
where
|
2000-10-11 12:17:06 +00:00
|
|
|
.Ar pathname
|
2000-02-28 15:21:12 +00:00
|
|
|
is to be piped through.
|
|
|
|
Useful preprocessors include
|
1998-11-23 10:54:28 +00:00
|
|
|
.Xr cpp 1
|
|
|
|
and
|
|
|
|
.Xr m4 1 .
|
|
|
|
If
|
|
|
|
.Ar preproc
|
2005-02-13 22:25:33 +00:00
|
|
|
does not start with a slash
|
2000-02-28 15:21:12 +00:00
|
|
|
.Pq Ql /
|
|
|
|
as its first character, the usual
|
1998-11-23 10:54:28 +00:00
|
|
|
.Ev PATH
|
2000-02-28 15:21:12 +00:00
|
|
|
name search is performed.
|
|
|
|
Care should be taken with this in environments where not all
|
2002-08-21 18:11:48 +00:00
|
|
|
file systems are mounted (yet) by the time
|
1998-11-23 10:54:28 +00:00
|
|
|
.Nm
|
2004-07-02 21:45:06 +00:00
|
|
|
is being run (e.g.\& when they are mounted over NFS).
|
2000-02-28 15:21:12 +00:00
|
|
|
Once
|
1998-11-23 10:54:28 +00:00
|
|
|
.Fl p
|
2009-06-26 05:09:00 +00:00
|
|
|
has been specified, any additional arguments are passed on to the preprocessor
|
2002-12-23 20:08:21 +00:00
|
|
|
for interpretation.
|
1998-11-23 10:54:28 +00:00
|
|
|
This allows for flexible configuration files (like conditionalizing
|
|
|
|
them on the local hostname) and the use of macros to centralize
|
|
|
|
frequently required arguments like IP addresses.
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.Ss TRAFFIC SHAPER CONFIGURATION
|
2000-01-08 11:19:19 +00:00
|
|
|
The
|
1999-04-28 02:49:29 +00:00
|
|
|
.Nm
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.Cm pipe , queue
|
2002-08-10 15:04:40 +00:00
|
|
|
and
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.Cm sched
|
|
|
|
commands are used to configure the traffic shaper and packet scheduler.
|
|
|
|
See the
|
2002-10-28 07:03:56 +00:00
|
|
|
.Sx TRAFFIC SHAPER (DUMMYNET) CONFIGURATION
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
Section below for details.
|
2003-01-12 03:31:10 +00:00
|
|
|
.Pp
|
|
|
|
If the world and the kernel get out of sync the
|
|
|
|
.Nm
|
2004-07-02 21:45:06 +00:00
|
|
|
ABI may break, preventing you from being able to add any rules.
|
2013-12-21 21:56:12 +00:00
|
|
|
This can adversely affect the booting process.
|
2004-07-02 21:45:06 +00:00
|
|
|
You can use
|
2003-01-12 03:31:10 +00:00
|
|
|
.Nm
|
|
|
|
.Cm disable
|
|
|
|
.Cm firewall
|
|
|
|
to temporarily disable the firewall to regain access to the network,
|
|
|
|
allowing you to fix the problem.
|
2002-08-10 15:04:40 +00:00
|
|
|
.Sh PACKET FLOW
|
2002-10-28 07:03:56 +00:00
|
|
|
A packet is checked against the active ruleset in multiple places
|
|
|
|
in the protocol stack, under control of several sysctl variables.
|
|
|
|
These places and variables are shown below, and it is important to
|
|
|
|
have this picture in mind in order to design a correct ruleset.
|
2002-08-10 15:04:40 +00:00
|
|
|
.Bd -literal -offset indent
|
2005-04-18 18:35:05 +00:00
|
|
|
^ to upper layers V
|
|
|
|
| |
|
|
|
|
+----------->-----------+
|
|
|
|
^ V
|
2006-05-12 18:09:33 +00:00
|
|
|
[ip(6)_input] [ip(6)_output] net.inet(6).ip(6).fw.enable=1
|
2005-04-18 18:35:05 +00:00
|
|
|
| |
|
|
|
|
^ V
|
|
|
|
[ether_demux] [ether_output_frame] net.link.ether.ipfw=1
|
|
|
|
| |
|
2005-09-28 08:18:55 +00:00
|
|
|
+-->--[bdg_forward]-->--+ net.link.bridge.ipfw=1
|
2005-04-18 18:35:05 +00:00
|
|
|
^ V
|
|
|
|
| to devices |
|
2002-08-10 15:04:40 +00:00
|
|
|
.Ed
|
|
|
|
.Pp
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
The number of
|
2002-08-10 15:04:40 +00:00
|
|
|
times the same packet goes through the firewall can
|
2002-09-08 09:01:08 +00:00
|
|
|
vary between 0 and 4 depending on packet source and
|
2002-08-10 15:04:40 +00:00
|
|
|
destination, and system configuration.
|
2002-10-28 07:03:56 +00:00
|
|
|
.Pp
|
|
|
|
Note that as packets flow through the stack, headers can be
|
|
|
|
stripped or added to it, and so they may or may not be available
|
|
|
|
for inspection.
|
|
|
|
E.g., incoming packets will include the MAC header when
|
2002-08-10 15:04:40 +00:00
|
|
|
.Nm
|
|
|
|
is invoked from
|
|
|
|
.Cm ether_demux() ,
|
|
|
|
but the same packets will have the MAC header stripped off when
|
|
|
|
.Nm
|
|
|
|
is invoked from
|
2005-06-14 11:24:56 +00:00
|
|
|
.Cm ip_input()
|
2005-04-18 18:35:05 +00:00
|
|
|
or
|
|
|
|
.Cm ip6_input() .
|
2002-10-28 07:03:56 +00:00
|
|
|
.Pp
|
|
|
|
Also note that each packet is always checked against the complete ruleset,
|
|
|
|
irrespective of the place where the check occurs, or the source of the packet.
|
2002-08-10 15:04:40 +00:00
|
|
|
If a rule contains some match patterns or actions which are not valid
|
2004-07-02 21:45:06 +00:00
|
|
|
for the place of invocation (e.g.\& trying to match a MAC header within
|
2005-04-18 18:35:05 +00:00
|
|
|
.Cm ip_input
|
|
|
|
or
|
|
|
|
.Cm ip6_input ),
|
2005-01-15 11:21:24 +00:00
|
|
|
the match pattern will not match, but a
|
2002-08-19 12:36:54 +00:00
|
|
|
.Cm not
|
2002-10-28 07:03:56 +00:00
|
|
|
operator in front of such patterns
|
|
|
|
.Em will
|
|
|
|
cause the pattern to
|
2002-08-19 12:36:54 +00:00
|
|
|
.Em always
|
2002-10-28 07:03:56 +00:00
|
|
|
match on those packets.
|
|
|
|
It is thus the responsibility of
|
2002-08-10 15:04:40 +00:00
|
|
|
the programmer, if necessary, to write a suitable ruleset to
|
|
|
|
differentiate among the possible places.
|
|
|
|
.Cm skipto
|
|
|
|
rules can be useful here, as an example:
|
|
|
|
.Bd -literal -offset indent
|
|
|
|
# packets from ether_demux or bdg_forward
|
|
|
|
ipfw add 10 skipto 1000 all from any to any layer2 in
|
|
|
|
# packets from ip_input
|
|
|
|
ipfw add 10 skipto 2000 all from any to any not layer2 in
|
|
|
|
# packets from ip_output
|
|
|
|
ipfw add 10 skipto 3000 all from any to any not layer2 out
|
|
|
|
# packets from ether_output_frame
|
|
|
|
ipfw add 10 skipto 4000 all from any to any layer2 out
|
|
|
|
.Ed
|
|
|
|
.Pp
|
|
|
|
(yes, at the moment there is no way to differentiate between
|
|
|
|
ether_demux and bdg_forward).
|
2003-07-08 08:07:03 +00:00
|
|
|
.Sh SYNTAX
|
|
|
|
In general, each keyword or argument must be provided as
|
|
|
|
a separate command line argument, with no leading or trailing
|
2004-07-02 21:45:06 +00:00
|
|
|
spaces.
|
|
|
|
Keywords are case-sensitive, whereas arguments may
|
2003-07-08 08:07:03 +00:00
|
|
|
or may not be case-sensitive depending on their nature
|
2004-07-02 21:45:06 +00:00
|
|
|
(e.g.\& uid's are, hostnames are not).
|
2003-07-08 08:07:03 +00:00
|
|
|
.Pp
|
2012-09-18 02:33:23 +00:00
|
|
|
Some arguments (e.g., port or address lists) are comma-separated
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
lists of values.
|
|
|
|
In this case, spaces after commas ',' are allowed to make
|
2004-07-02 21:45:06 +00:00
|
|
|
the line more readable.
|
|
|
|
You can also put the entire
|
2003-07-08 08:07:03 +00:00
|
|
|
command (including flags) into a single argument.
|
2004-07-02 21:45:06 +00:00
|
|
|
E.g., the following forms are equivalent:
|
2003-07-08 08:07:03 +00:00
|
|
|
.Bd -literal -offset indent
|
|
|
|
ipfw -q add deny src-ip 10.0.0.0/24,127.0.0.1/8
|
|
|
|
ipfw -q add deny src-ip 10.0.0.0/24, 127.0.0.1/8
|
|
|
|
ipfw "-q add deny src-ip 10.0.0.0/24, 127.0.0.1/8"
|
|
|
|
.Ed
|
2000-01-08 11:19:19 +00:00
|
|
|
.Sh RULE FORMAT
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
The format of firewall rules is the following:
|
2002-08-10 15:04:40 +00:00
|
|
|
.Bd -ragged -offset indent
|
2005-11-18 10:36:29 +00:00
|
|
|
.Bk -words
|
2002-08-10 15:04:40 +00:00
|
|
|
.Op Ar rule_number
|
|
|
|
.Op Cm set Ar set_number
|
2000-02-28 15:21:12 +00:00
|
|
|
.Op Cm prob Ar match_probability
|
2005-11-18 10:36:29 +00:00
|
|
|
.Ar action
|
2000-02-28 15:21:12 +00:00
|
|
|
.Op Cm log Op Cm logamount Ar number
|
2004-10-03 00:17:46 +00:00
|
|
|
.Op Cm altq Ar queue
|
2006-05-24 13:09:55 +00:00
|
|
|
.Oo
|
|
|
|
.Bro Cm tag | untag
|
|
|
|
.Brc Ar number
|
|
|
|
.Oc
|
2002-08-10 15:04:40 +00:00
|
|
|
.Ar body
|
2005-11-18 10:36:29 +00:00
|
|
|
.Ek
|
2000-02-28 15:21:12 +00:00
|
|
|
.Ed
|
2000-01-08 11:19:19 +00:00
|
|
|
.Pp
|
2002-08-10 15:04:40 +00:00
|
|
|
where the body of the rule specifies which information is used
|
|
|
|
for filtering packets, among the following:
|
1999-04-28 02:49:29 +00:00
|
|
|
.Pp
|
2002-08-10 15:04:40 +00:00
|
|
|
.Bl -tag -width "Source and dest. addresses and ports" -offset XXX -compact
|
|
|
|
.It Layer-2 header fields
|
|
|
|
When available
|
2005-04-18 18:35:05 +00:00
|
|
|
.It IPv4 and IPv6 Protocol
|
2002-08-10 15:04:40 +00:00
|
|
|
TCP, UDP, ICMP, etc.
|
|
|
|
.It Source and dest. addresses and ports
|
2000-10-06 11:17:06 +00:00
|
|
|
.It Direction
|
2002-08-10 15:04:40 +00:00
|
|
|
See Section
|
|
|
|
.Sx PACKET FLOW
|
2000-10-06 11:17:06 +00:00
|
|
|
.It Transmit and receive interface
|
2002-08-10 15:04:40 +00:00
|
|
|
By name or address
|
|
|
|
.It Misc. IP header fields
|
|
|
|
Version, type of service, datagram length, identification,
|
|
|
|
fragment flag (non-zero IP offset),
|
|
|
|
Time To Live
|
2000-02-28 15:21:12 +00:00
|
|
|
.It IP options
|
2005-04-18 18:35:05 +00:00
|
|
|
.It IPv6 Extension headers
|
|
|
|
Fragmentation, Hop-by-Hop options,
|
2007-05-04 11:15:41 +00:00
|
|
|
Routing Headers, Source routing rthdr0, Mobile IPv6 rthdr2, IPSec options.
|
2005-04-18 18:35:05 +00:00
|
|
|
.It IPv6 Flow-ID
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Misc. TCP header fields
|
|
|
|
TCP flags (SYN, FIN, ACK, RST, etc.),
|
|
|
|
sequence number, acknowledgment number,
|
|
|
|
window
|
2000-10-06 11:17:06 +00:00
|
|
|
.It TCP options
|
2000-02-28 15:21:12 +00:00
|
|
|
.It ICMP types
|
2002-08-10 15:04:40 +00:00
|
|
|
for ICMP packets
|
2005-04-18 18:35:05 +00:00
|
|
|
.It ICMP6 types
|
|
|
|
for ICMP6 packets
|
2002-08-10 15:04:40 +00:00
|
|
|
.It User/group ID
|
2002-10-28 07:03:56 +00:00
|
|
|
When the packet can be associated with a local socket.
|
2004-10-03 00:17:46 +00:00
|
|
|
.It Divert status
|
2005-01-10 16:17:34 +00:00
|
|
|
Whether a packet came from a divert socket (e.g.,
|
|
|
|
.Xr natd 8 ) .
|
Add code to allow the system to handle multiple routing tables.
This particular implementation is designed to be fully backwards compatible
and to be MFC-able to 7.x (and 6.x)
Currently the only protocol that can make use of the multiple tables is IPv4
Similar functionality exists in OpenBSD and Linux.
From my notes:
-----
One thing where FreeBSD has been falling behind, and which by chance I
have some time to work on is "policy based routing", which allows
different
packet streams to be routed by more than just the destination address.
Constraints:
------------
I want to make some form of this available in the 6.x tree
(and by extension 7.x) , but FreeBSD in general needs it so I might as
well do it in -current and back port the portions I need.
One of the ways that this can be done is to have the ability to
instantiate multiple kernel routing tables (which I will now
refer to as "Forwarding Information Bases" or "FIBs" for political
correctness reasons). Which FIB a particular packet uses to make
the next hop decision can be decided by a number of mechanisms.
The policies these mechanisms implement are the "Policies" referred
to in "Policy based routing".
One of the constraints I have if I try to back port this work to
6.x is that it must be implemented as a EXTENSION to the existing
ABIs in 6.x so that third party applications do not need to be
recompiled in timespan of the branch.
This first version will not have some of the bells and whistles that
will come with later versions. It will, for example, be limited to 16
tables in the first commit.
Implementation method, Compatible version. (part 1)
-------------------------------
For this reason I have implemented a "sufficient subset" of a
multiple routing table solution in Perforce, and back-ported it
to 6.x. (also in Perforce though not always caught up with what I
have done in -current/P4). The subset allows a number of FIBs
to be defined at compile time (8 is sufficient for my purposes in 6.x)
and implements the changes needed to allow IPV4 to use them. I have not
done the changes for ipv6 simply because I do not need it, and I do not
have enough knowledge of ipv6 (e.g. neighbor discovery) needed to do it.
Other protocol families are left untouched and should there be
users with proprietary protocol families, they should continue to work
and be oblivious to the existence of the extra FIBs.
To understand how this is done, one must know that the current FIB
code starts everything off with a single dimensional array of
pointers to FIB head structures (One per protocol family), each of
which in turn points to the trie of routes available to that family.
The basic change in the ABI compatible version of the change is to
extent that array to be a 2 dimensional array, so that
instead of protocol family X looking at rt_tables[X] for the
table it needs, it looks at rt_tables[Y][X] when for all
protocol families except ipv4 Y is always 0.
Code that is unaware of the change always just sees the first row
of the table, which of course looks just like the one dimensional
array that existed before.
The entry points rtrequest(), rtalloc(), rtalloc1(), rtalloc_ign()
are all maintained, but refer only to the first row of the array,
so that existing callers in proprietary protocols can continue to
do the "right thing".
Some new entry points are added, for the exclusive use of ipv4 code
called in_rtrequest(), in_rtalloc(), in_rtalloc1() and in_rtalloc_ign(),
which have an extra argument which refers the code to the correct row.
In addition, there are some new entry points (currently called
rtalloc_fib() and friends) that check the Address family being
looked up and call either rtalloc() (and friends) if the protocol
is not IPv4 forcing the action to row 0 or to the appropriate row
if it IS IPv4 (and that info is available). These are for calling
from code that is not specific to any particular protocol. The way
these are implemented would change in the non ABI preserving code
to be added later.
One feature of the first version of the code is that for ipv4,
the interface routes show up automatically on all the FIBs, so
that no matter what FIB you select you always have the basic
direct attached hosts available to you. (rtinit() does this
automatically).
You CAN delete an interface route from one FIB should you want
to but by default it's there. ARP information is also available
in each FIB. It's assumed that the same machine would have the
same MAC address, regardless of which FIB you are using to get
to it.
This brings us as to how the correct FIB is selected for an outgoing
IPV4 packet.
Firstly, all packets have a FIB associated with them. if nothing
has been done to change it, it will be FIB 0. The FIB is changed
in the following ways.
Packets fall into one of a number of classes.
1/ locally generated packets, coming from a socket/PCB.
Such packets select a FIB from a number associated with the
socket/PCB. This in turn is inherited from the process,
but can be changed by a socket option. The process in turn
inherits it on fork. I have written a utility call setfib
that acts a bit like nice..
setfib -3 ping target.example.com # will use fib 3 for ping.
It is an obvious extension to make it a property of a jail
but I have not done so. It can be achieved by combining the setfib and
jail commands.
2/ packets received on an interface for forwarding.
By default these packets would use table 0,
(or possibly a number settable in a sysctl(not yet)).
but prior to routing the firewall can inspect them (see below).
(possibly in the future you may be able to associate a FIB
with packets received on an interface.. An ifconfig arg, but not yet.)
3/ packets inspected by a packet classifier, which can arbitrarily
associate a fib with it on a packet by packet basis.
A fib assigned to a packet by a packet classifier
(such as ipfw) would over-ride a fib associated by
a more default source. (such as cases 1 or 2).
4/ a tcp listen socket associated with a fib will generate
accept sockets that are associated with that same fib.
5/ Packets generated in response to some other packet (e.g. reset
or icmp packets). These should use the FIB associated with the
packet being reponded to.
6/ Packets generated during encapsulation.
gif, tun and other tunnel interfaces will encapsulate using the FIB
that was in effect withthe proces that set up the tunnel.
thus setfib 1 ifconfig gif0 [tunnel instructions]
will set the fib for the tunnel to use to be fib 1.
Routing messages would be associated with their
process, and thus select one FIB or another.
messages from the kernel would be associated with the fib they
refer to and would only be received by a routing socket associated
with that fib. (not yet implemented)
In addition Netstat has been edited to be able to cope with the
fact that the array is now 2 dimensional. (It looks in system
memory using libkvm (!)). Old versions of netstat see only the first FIB.
In addition two sysctls are added to give:
a) the number of FIBs compiled in (active)
b) the default FIB of the calling process.
Early testing experience:
-------------------------
Basically our (IronPort's) appliance does this functionality already
using ipfw fwd but that method has some drawbacks.
For example,
It can't fully simulate a routing table because it can't influence the
socket's choice of local address when a connect() is done.
Testing during the generating of these changes has been
remarkably smooth so far. Multiple tables have co-existed
with no notable side effects, and packets have been routes
accordingly.
ipfw has grown 2 new keywords:
setfib N ip from anay to any
count ip from any to any fib N
In pf there seems to be a requirement to be able to give symbolic names to the
fibs but I do not have that capacity. I am not sure if it is required.
SCTP has interestingly enough built in support for this, called VRFs
in Cisco parlance. it will be interesting to see how that handles it
when it suddenly actually does something.
Where to next:
--------------------
After committing the ABI compatible version and MFCing it, I'd
like to proceed in a forward direction in -current. this will
result in some roto-tilling in the routing code.
Firstly: the current code's idea of having a separate tree per
protocol family, all of the same format, and pointed to by the
1 dimensional array is a bit silly. Especially when one considers that
there is code that makes assumptions about every protocol having the
same internal structures there. Some protocols don't WANT that
sort of structure. (for example the whole idea of a netmask is foreign
to appletalk). This needs to be made opaque to the external code.
My suggested first change is to add routing method pointers to the
'domain' structure, along with information pointing the data.
instead of having an array of pointers to uniform structures,
there would be an array pointing to the 'domain' structures
for each protocol address domain (protocol family),
and the methods this reached would be called. The methods would have
an argument that gives FIB number, but the protocol would be free
to ignore it.
When the ABI can be changed it raises the possibilty of the
addition of a fib entry into the "struct route". Currently,
the structure contains the sockaddr of the desination, and the resulting
fib entry. To make this work fully, one could add a fib number
so that given an address and a fib, one can find the third element, the
fib entry.
Interaction with the ARP layer/ LL layer would need to be
revisited as well. Qing Li has been working on this already.
This work was sponsored by Ironport Systems/Cisco
Reviewed by: several including rwatson, bz and mlair (parts each)
Obtained from: Ironport systems/Cisco
2008-05-09 23:03:00 +00:00
|
|
|
.It Fib annotation state
|
|
|
|
Whether a packet has been tagged for using a specific FIB (routing table)
|
|
|
|
in future forwarding decisions.
|
1999-04-28 02:49:29 +00:00
|
|
|
.El
|
|
|
|
.Pp
|
2004-07-02 21:45:06 +00:00
|
|
|
Note that some of the above information, e.g.\& source MAC or IP addresses and
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
TCP/UDP ports, can be easily spoofed, so filtering on those fields
|
2002-08-10 15:04:40 +00:00
|
|
|
alone might not guarantee the desired results.
|
2000-02-28 15:21:12 +00:00
|
|
|
.Bl -tag -width indent
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Ar rule_number
|
|
|
|
Each rule is associated with a
|
|
|
|
.Ar rule_number
|
|
|
|
in the range 1..65535, with the latter reserved for the
|
|
|
|
.Em default
|
|
|
|
rule.
|
|
|
|
Rules are checked sequentially by rule number.
|
|
|
|
Multiple rules can have the same number, in which case they are
|
|
|
|
checked (and listed) according to the order in which they have
|
|
|
|
been added.
|
|
|
|
If a rule is entered without specifying a number, the kernel will
|
|
|
|
assign one in such a way that the rule becomes the last one
|
|
|
|
before the
|
|
|
|
.Em default
|
|
|
|
rule.
|
|
|
|
Automatic rule numbers are assigned by incrementing the last
|
|
|
|
non-default rule number by the value of the sysctl variable
|
|
|
|
.Ar net.inet.ip.fw.autoinc_step
|
|
|
|
which defaults to 100.
|
2004-07-02 21:45:06 +00:00
|
|
|
If this is not possible (e.g.\& because we would go beyond the
|
2002-10-28 07:03:56 +00:00
|
|
|
maximum allowed rule number), the number of the last
|
2002-08-10 15:04:40 +00:00
|
|
|
non-default value is used instead.
|
2002-08-16 10:31:47 +00:00
|
|
|
.It Cm set Ar set_number
|
2002-10-28 07:03:56 +00:00
|
|
|
Each rule is associated with a
|
2002-08-10 15:04:40 +00:00
|
|
|
.Ar set_number
|
2003-07-15 23:08:44 +00:00
|
|
|
in the range 0..31.
|
2002-08-10 15:04:40 +00:00
|
|
|
Sets can be individually disabled and enabled, so this parameter
|
|
|
|
is of fundamental importance for atomic ruleset manipulation.
|
|
|
|
It can be also used to simplify deletion of groups of rules.
|
|
|
|
If a rule is entered without specifying a set number,
|
|
|
|
set 0 will be used.
|
2003-07-15 23:08:44 +00:00
|
|
|
.br
|
|
|
|
Set 31 is special in that it cannot be disabled,
|
|
|
|
and rules in set 31 are not deleted by the
|
|
|
|
.Nm ipfw flush
|
|
|
|
command (but you can delete them with the
|
|
|
|
.Nm ipfw delete set 31
|
|
|
|
command).
|
|
|
|
Set 31 is also used for the
|
|
|
|
.Em default
|
|
|
|
rule.
|
2000-02-28 15:21:12 +00:00
|
|
|
.It Cm prob Ar match_probability
|
|
|
|
A match is only declared with the specified probability
|
|
|
|
(floating point number between 0 and 1).
|
|
|
|
This can be useful for a number of applications such as
|
|
|
|
random packet drop or
|
2001-08-07 15:48:51 +00:00
|
|
|
(in conjunction with
|
2007-11-26 00:36:40 +00:00
|
|
|
.Nm dummynet )
|
2000-02-28 15:21:12 +00:00
|
|
|
to simulate the effect of multiple paths leading to out-of-order
|
1999-08-11 15:36:13 +00:00
|
|
|
packet delivery.
|
2002-11-26 19:51:40 +00:00
|
|
|
.Pp
|
|
|
|
Note: this condition is checked before any other condition, including
|
|
|
|
ones such as keep-state or check-state which might have side effects.
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm log Op Cm logamount Ar number
|
2010-10-13 22:07:57 +00:00
|
|
|
Packets matching a rule with the
|
2002-08-10 15:04:40 +00:00
|
|
|
.Cm log
|
2010-10-13 22:07:57 +00:00
|
|
|
keyword will be made available for logging in two ways:
|
|
|
|
if the sysctl variable
|
|
|
|
.Va net.inet.ip.fw.verbose
|
|
|
|
is set to 0 (default), one can use
|
|
|
|
.Xr bpf 4
|
|
|
|
attached to the
|
2011-05-17 12:58:19 +00:00
|
|
|
.Li ipfw0
|
2012-07-09 07:16:19 +00:00
|
|
|
pseudo interface.
|
|
|
|
This pseudo interface can be created after a boot
|
|
|
|
manually by using the following command:
|
|
|
|
.Bd -literal -offset indent
|
|
|
|
# ifconfig ipfw0 create
|
|
|
|
.Ed
|
|
|
|
.Pp
|
|
|
|
Or, automatically at boot time by adding the following
|
|
|
|
line to the
|
|
|
|
.Xr rc.conf 5
|
|
|
|
file:
|
|
|
|
.Bd -literal -offset indent
|
|
|
|
firewall_logif="YES"
|
|
|
|
.Ed
|
|
|
|
.Pp
|
|
|
|
There is no overhead if no
|
2011-05-17 12:58:19 +00:00
|
|
|
.Xr bpf 4
|
2010-10-13 22:07:57 +00:00
|
|
|
is attached to the pseudo interface.
|
|
|
|
.Pp
|
|
|
|
If
|
|
|
|
.Va net.inet.ip.fw.verbose
|
|
|
|
is set to 1, packets will be logged to
|
2002-08-10 15:04:40 +00:00
|
|
|
.Xr syslogd 8
|
|
|
|
with a
|
|
|
|
.Dv LOG_SECURITY
|
2010-10-13 22:07:57 +00:00
|
|
|
facility up to a maximum of
|
2002-08-10 15:04:40 +00:00
|
|
|
.Cm logamount
|
2010-10-13 22:07:57 +00:00
|
|
|
packets.
|
2002-08-10 15:04:40 +00:00
|
|
|
If no
|
|
|
|
.Cm logamount
|
|
|
|
is specified, the limit is taken from the sysctl variable
|
2007-11-26 00:36:40 +00:00
|
|
|
.Va net.inet.ip.fw.verbose_limit .
|
2010-10-13 22:07:57 +00:00
|
|
|
In both cases, a value of 0 means unlimited logging.
|
2002-08-10 15:04:40 +00:00
|
|
|
.Pp
|
|
|
|
Once the limit is reached, logging can be re-enabled by
|
2002-10-28 07:03:56 +00:00
|
|
|
clearing the logging counter or the packet counter for that entry, see the
|
2002-08-10 15:04:40 +00:00
|
|
|
.Cm resetlog
|
|
|
|
command.
|
|
|
|
.Pp
|
2002-11-26 19:51:40 +00:00
|
|
|
Note: logging is done after all other packet matching conditions
|
|
|
|
have been successfully verified, and before performing the final
|
|
|
|
action (accept, deny, etc.) on the packet.
|
2006-05-24 13:09:55 +00:00
|
|
|
.It Cm tag Ar number
|
|
|
|
When a packet matches a rule with the
|
|
|
|
.Cm tag
|
|
|
|
keyword, the numeric tag for the given
|
|
|
|
.Ar number
|
2006-07-25 11:07:31 +00:00
|
|
|
in the range 1..65534 will be attached to the packet.
|
2006-05-24 13:09:55 +00:00
|
|
|
The tag acts as an internal marker (it is not sent out over
|
|
|
|
the wire) that can be used to identify these packets later on.
|
|
|
|
This can be used, for example, to provide trust between interfaces
|
|
|
|
and to start doing policy-based filtering.
|
2009-04-08 17:46:45 +00:00
|
|
|
A packet can have multiple tags at the same time.
|
2006-05-24 13:09:55 +00:00
|
|
|
Tags are "sticky", meaning once a tag is applied to a packet by a
|
|
|
|
matching rule it exists until explicit removal.
|
|
|
|
Tags are kept with the packet everywhere within the kernel, but are
|
|
|
|
lost when packet leaves the kernel, for example, on transmitting
|
|
|
|
packet out to the network or sending packet to a
|
|
|
|
.Xr divert 4
|
|
|
|
socket.
|
|
|
|
.Pp
|
|
|
|
To check for previously applied tags, use the
|
|
|
|
.Cm tagged
|
2006-09-18 11:55:10 +00:00
|
|
|
rule option.
|
|
|
|
To delete previously applied tag, use the
|
2006-05-24 13:09:55 +00:00
|
|
|
.Cm untag
|
|
|
|
keyword.
|
|
|
|
.Pp
|
|
|
|
Note: since tags are kept with the packet everywhere in kernelspace,
|
2009-03-19 10:42:07 +00:00
|
|
|
they can be set and unset anywhere in the kernel network subsystem
|
|
|
|
(using the
|
2006-05-24 13:09:55 +00:00
|
|
|
.Xr mbuf_tags 9
|
2009-03-19 10:42:07 +00:00
|
|
|
facility), not only by means of the
|
2006-05-24 13:09:55 +00:00
|
|
|
.Xr ipfw 4
|
|
|
|
.Cm tag
|
|
|
|
and
|
|
|
|
.Cm untag
|
|
|
|
keywords.
|
|
|
|
For example, there can be a specialized
|
|
|
|
.Xr netgraph 4
|
|
|
|
node doing traffic analyzing and tagging for later inspecting
|
|
|
|
in firewall.
|
|
|
|
.It Cm untag Ar number
|
|
|
|
When a packet matches a rule with the
|
|
|
|
.Cm untag
|
|
|
|
keyword, the tag with the number
|
|
|
|
.Ar number
|
|
|
|
is searched among the tags attached to this packet and,
|
|
|
|
if found, removed from it.
|
|
|
|
Other tags bound to packet, if present, are left untouched.
|
2004-10-03 00:17:46 +00:00
|
|
|
.It Cm altq Ar queue
|
|
|
|
When a packet matches a rule with the
|
|
|
|
.Cm altq
|
|
|
|
keyword, the ALTQ identifier for the given
|
|
|
|
.Ar queue
|
|
|
|
(see
|
2004-10-08 03:31:09 +00:00
|
|
|
.Xr altq 4 )
|
2004-10-03 00:17:46 +00:00
|
|
|
will be attached.
|
|
|
|
Note that this ALTQ tag is only meaningful for packets going "out" of IPFW,
|
|
|
|
and not being rejected or going to divert sockets.
|
|
|
|
Note that if there is insufficient memory at the time the packet is
|
|
|
|
processed, it will not be tagged, so it is wise to make your ALTQ
|
|
|
|
"default" queue policy account for this.
|
|
|
|
If multiple
|
|
|
|
.Cm altq
|
2005-06-04 19:04:31 +00:00
|
|
|
rules match a single packet, only the first one adds the ALTQ classification
|
|
|
|
tag.
|
|
|
|
In doing so, traffic may be shaped by using
|
|
|
|
.Cm count Cm altq Ar queue
|
|
|
|
rules for classification early in the ruleset, then later applying
|
|
|
|
the filtering decision.
|
|
|
|
For example,
|
|
|
|
.Cm check-state
|
|
|
|
and
|
|
|
|
.Cm keep-state
|
|
|
|
rules may come later and provide the actual filtering decisions in
|
|
|
|
addition to the fallback ALTQ tag.
|
2004-10-03 00:17:46 +00:00
|
|
|
.Pp
|
|
|
|
You must run
|
|
|
|
.Xr pfctl 8
|
|
|
|
to set up the queues before IPFW will be able to look them up by name,
|
|
|
|
and if the ALTQ disciplines are rearranged, the rules in containing the
|
|
|
|
queue identifiers in the kernel will likely have gone stale and need
|
|
|
|
to be reloaded.
|
2005-06-04 19:04:31 +00:00
|
|
|
Stale queue identifiers will probably result in misclassification.
|
2004-10-03 00:17:46 +00:00
|
|
|
.Pp
|
|
|
|
All system ALTQ processing can be turned on or off via
|
|
|
|
.Nm
|
|
|
|
.Cm enable Ar altq
|
|
|
|
and
|
|
|
|
.Nm
|
|
|
|
.Cm disable Ar altq .
|
|
|
|
The usage of
|
2007-11-26 00:36:40 +00:00
|
|
|
.Va net.inet.ip.fw.one_pass
|
2004-10-03 00:17:46 +00:00
|
|
|
is irrelevant to ALTQ traffic shaping, as the actual rule action is followed
|
|
|
|
always after adding an ALTQ tag.
|
2002-08-10 15:04:40 +00:00
|
|
|
.El
|
|
|
|
.Ss RULE ACTIONS
|
|
|
|
A rule can be associated with one of the following actions, which
|
|
|
|
will be executed when the packet matches the body of the rule.
|
2000-02-28 15:21:12 +00:00
|
|
|
.Bl -tag -width indent
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm allow | accept | pass | permit
|
1996-06-15 01:38:51 +00:00
|
|
|
Allow packets that match rule.
|
2000-02-28 15:21:12 +00:00
|
|
|
The search terminates.
|
2016-07-19 04:56:59 +00:00
|
|
|
.It Cm check-state Op Ar flowname | Cm any
|
2000-02-28 15:21:12 +00:00
|
|
|
Checks the packet against the dynamic ruleset.
|
2002-08-10 15:04:40 +00:00
|
|
|
If a match is found, execute the action associated with
|
|
|
|
the rule which generated this dynamic rule, otherwise
|
|
|
|
move to the next rule.
|
|
|
|
.br
|
|
|
|
.Cm Check-state
|
|
|
|
rules do not have a body.
|
2000-02-10 14:25:26 +00:00
|
|
|
If no
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm check-state
|
2000-02-10 14:25:26 +00:00
|
|
|
rule is found, the dynamic ruleset is checked at the first
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm keep-state
|
2002-08-10 15:04:40 +00:00
|
|
|
or
|
|
|
|
.Cm limit
|
2000-02-10 14:25:26 +00:00
|
|
|
rule.
|
2016-07-19 04:56:59 +00:00
|
|
|
The
|
|
|
|
.Ar flowname
|
|
|
|
is symbolic name assigned to dynamic rule by
|
|
|
|
.Cm keep-state
|
|
|
|
opcode.
|
|
|
|
The special flowname
|
|
|
|
.Cm any
|
|
|
|
can be used to ignore states flowname when matching.
|
|
|
|
The
|
|
|
|
.Cm default
|
|
|
|
keyword is special name used for compatibility with old rulesets.
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm count
|
|
|
|
Update counters for all packets that match rule.
|
|
|
|
The search continues with the next rule.
|
|
|
|
.It Cm deny | drop
|
|
|
|
Discard packets that match this rule.
|
|
|
|
The search terminates.
|
2000-02-28 15:21:12 +00:00
|
|
|
.It Cm divert Ar port
|
1997-06-02 05:02:37 +00:00
|
|
|
Divert packets that match this rule to the
|
|
|
|
.Xr divert 4
|
|
|
|
socket bound to port
|
1996-07-10 19:44:30 +00:00
|
|
|
.Ar port .
|
1996-02-24 13:39:46 +00:00
|
|
|
The search terminates.
|
2006-08-17 22:49:50 +00:00
|
|
|
.It Cm fwd | forward Ar ipaddr | tablearg Ns Op , Ns Ar port
|
1998-07-06 03:20:19 +00:00
|
|
|
Change the next-hop on matching packets to
|
|
|
|
.Ar ipaddr ,
|
2005-06-03 01:10:28 +00:00
|
|
|
which can be an IP address or a host name.
|
2011-08-20 17:05:11 +00:00
|
|
|
For IPv4, the next hop can also be supplied by the last table
|
2006-08-18 22:36:05 +00:00
|
|
|
looked up for the packet by using the
|
|
|
|
.Cm tablearg
|
2006-08-17 22:49:50 +00:00
|
|
|
keyword instead of an explicit address.
|
2002-08-10 15:04:40 +00:00
|
|
|
The search terminates if this rule matches.
|
|
|
|
.Pp
|
1998-07-06 03:20:19 +00:00
|
|
|
If
|
|
|
|
.Ar ipaddr
|
2002-08-10 15:04:40 +00:00
|
|
|
is a local address, then matching packets will be forwarded to
|
|
|
|
.Ar port
|
|
|
|
(or the port number in the packet if one is not specified in the rule)
|
|
|
|
on the local machine.
|
|
|
|
.br
|
1998-07-06 03:20:19 +00:00
|
|
|
If
|
|
|
|
.Ar ipaddr
|
2002-08-10 15:04:40 +00:00
|
|
|
is not a local address, then the port number
|
|
|
|
(if specified) is ignored, and the packet will be
|
|
|
|
forwarded to the remote address, using the route as found in
|
|
|
|
the local routing table for that IP.
|
|
|
|
.br
|
|
|
|
A
|
|
|
|
.Ar fwd
|
|
|
|
rule will not match layer-2 packets (those received
|
|
|
|
on ether_input, ether_output, or bridged).
|
|
|
|
.br
|
|
|
|
The
|
2002-01-10 15:41:06 +00:00
|
|
|
.Cm fwd
|
2002-08-10 15:04:40 +00:00
|
|
|
action does not change the contents of the packet at all.
|
|
|
|
In particular, the destination address remains unmodified, so
|
|
|
|
packets forwarded to another system will usually be rejected by that system
|
|
|
|
unless there is a matching rule on that system to capture them.
|
|
|
|
For packets forwarded locally,
|
|
|
|
the local address of the socket will be
|
|
|
|
set to the original destination address of the packet.
|
2002-09-22 11:30:51 +00:00
|
|
|
This makes the
|
2001-12-28 22:24:26 +00:00
|
|
|
.Xr netstat 1
|
2002-01-02 19:46:14 +00:00
|
|
|
entry look rather weird but is intended for
|
2001-12-28 22:24:26 +00:00
|
|
|
use with transparent proxy servers.
|
2011-11-10 12:05:26 +00:00
|
|
|
.It Cm nat Ar nat_nr | tablearg
|
2007-02-15 14:32:26 +00:00
|
|
|
Pass packet to a
|
|
|
|
nat instance
|
|
|
|
(for network address translation, address redirect, etc.):
|
|
|
|
see the
|
|
|
|
.Sx NETWORK ADDRESS TRANSLATION (NAT)
|
|
|
|
Section for further information.
|
2016-08-13 16:09:49 +00:00
|
|
|
.It Cm nat64lsn Ar name
|
|
|
|
Pass packet to a stateful NAT64 instance (for IPv6/IPv4 network address and
|
|
|
|
protocol translation): see the
|
|
|
|
.Sx IPv6/IPv4 NETWORK ADDRESS AND PROTOCOL TRANSLATION
|
|
|
|
Section for further information.
|
|
|
|
.It Cm nat64stl Ar name
|
|
|
|
Pass packet to a stateless NAT64 instance (for IPv6/IPv4 network address and
|
|
|
|
protocol translation): see the
|
|
|
|
.Sx IPv6/IPv4 NETWORK ADDRESS AND PROTOCOL TRANSLATION
|
|
|
|
Section for further information.
|
2016-07-18 19:46:31 +00:00
|
|
|
.It Cm nptv6 Ar name
|
|
|
|
Pass packet to a NPTv6 instance (for IPv6-to-IPv6 network prefix translation):
|
|
|
|
see the
|
|
|
|
.Sx IPv6-to-IPv6 NETWORK PREFIX TRANSLATION (NPTv6)
|
|
|
|
Section for further information.
|
2000-02-28 15:21:12 +00:00
|
|
|
.It Cm pipe Ar pipe_nr
|
1999-08-11 15:36:13 +00:00
|
|
|
Pass packet to a
|
2007-11-26 00:36:40 +00:00
|
|
|
.Nm dummynet
|
2000-02-28 15:21:12 +00:00
|
|
|
.Dq pipe
|
|
|
|
(for bandwidth limitation, delay, etc.).
|
|
|
|
See the
|
2002-10-28 07:03:56 +00:00
|
|
|
.Sx TRAFFIC SHAPER (DUMMYNET) CONFIGURATION
|
2002-08-16 10:31:47 +00:00
|
|
|
Section for further information.
|
2000-02-28 15:21:12 +00:00
|
|
|
The search terminates; however, on exit from the pipe and if
|
|
|
|
the
|
|
|
|
.Xr sysctl 8
|
|
|
|
variable
|
2007-11-26 00:36:40 +00:00
|
|
|
.Va net.inet.ip.fw.one_pass
|
2000-02-28 15:21:12 +00:00
|
|
|
is not set, the packet is passed again to the firewall code
|
|
|
|
starting from the next rule.
|
2000-06-08 13:38:57 +00:00
|
|
|
.It Cm queue Ar queue_nr
|
|
|
|
Pass packet to a
|
2007-11-26 00:36:40 +00:00
|
|
|
.Nm dummynet
|
2000-06-08 13:38:57 +00:00
|
|
|
.Dq queue
|
2002-10-28 07:03:56 +00:00
|
|
|
(for bandwidth limitation using WF2Q+).
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm reject
|
|
|
|
(Deprecated).
|
|
|
|
Synonym for
|
|
|
|
.Cm unreach host .
|
|
|
|
.It Cm reset
|
|
|
|
Discard packets that match this rule, and if the
|
|
|
|
packet is a TCP packet, try to send a TCP reset (RST) notice.
|
|
|
|
The search terminates.
|
2005-08-13 11:02:34 +00:00
|
|
|
.It Cm reset6
|
|
|
|
Discard packets that match this rule, and if the
|
|
|
|
packet is a TCP packet, try to send a TCP reset (RST) notice.
|
|
|
|
The search terminates.
|
2008-08-01 22:34:01 +00:00
|
|
|
.It Cm skipto Ar number | tablearg
|
1997-06-02 05:02:37 +00:00
|
|
|
Skip all subsequent rules numbered less than
|
|
|
|
.Ar number .
|
|
|
|
The search continues with the first rule numbered
|
|
|
|
.Ar number
|
2008-08-01 23:31:28 +00:00
|
|
|
or higher.
|
2012-03-29 05:02:12 +00:00
|
|
|
It is possible to use the
|
2008-08-01 22:34:01 +00:00
|
|
|
.Cm tablearg
|
2012-03-29 05:02:12 +00:00
|
|
|
keyword with a skipto for a
|
2008-08-01 22:34:01 +00:00
|
|
|
.Em computed
|
2014-08-13 00:19:18 +00:00
|
|
|
skipto. Skipto may work either in O(log(N)) or in O(1) depending
|
|
|
|
on amount of memory and/or sysctl variables.
|
|
|
|
See the
|
|
|
|
.Sx SYSCTL VARIABLES
|
|
|
|
section for more details.
|
2011-06-29 10:06:58 +00:00
|
|
|
.It Cm call Ar number | tablearg
|
|
|
|
The current rule number is saved in the internal stack and
|
|
|
|
ruleset processing continues with the first rule numbered
|
|
|
|
.Ar number
|
|
|
|
or higher.
|
|
|
|
If later a rule with the
|
|
|
|
.Cm return
|
|
|
|
action is encountered, the processing returns to the first rule
|
|
|
|
with number of this
|
|
|
|
.Cm call
|
|
|
|
rule plus one or higher
|
|
|
|
(the same behaviour as with packets returning from
|
|
|
|
.Xr divert 4
|
|
|
|
socket after a
|
|
|
|
.Cm divert
|
|
|
|
action).
|
|
|
|
This could be used to make somewhat like an assembly language
|
|
|
|
.Dq subroutine
|
|
|
|
calls to rules with common checks for different interfaces, etc.
|
|
|
|
.Pp
|
|
|
|
Rule with any number could be called, not just forward jumps as with
|
|
|
|
.Cm skipto .
|
|
|
|
So, to prevent endless loops in case of mistakes, both
|
|
|
|
.Cm call
|
|
|
|
and
|
|
|
|
.Cm return
|
|
|
|
actions don't do any jumps and simply go to the next rule if memory
|
2013-04-11 19:05:24 +00:00
|
|
|
cannot be allocated or stack overflowed/underflowed.
|
2011-06-29 10:06:58 +00:00
|
|
|
.Pp
|
|
|
|
Internally stack for rule numbers is implemented using
|
|
|
|
.Xr mbuf_tags 9
|
|
|
|
facility and currently has size of 16 entries.
|
|
|
|
As mbuf tags are lost when packet leaves the kernel,
|
|
|
|
.Cm divert
|
|
|
|
should not be used in subroutines to avoid endless loops
|
|
|
|
and other undesired effects.
|
|
|
|
.It Cm return
|
|
|
|
Takes rule number saved to internal stack by the last
|
|
|
|
.Cm call
|
|
|
|
action and returns ruleset processing to the first rule
|
|
|
|
with number greater than number of corresponding
|
|
|
|
.Cm call
|
2012-09-18 02:33:23 +00:00
|
|
|
rule.
|
|
|
|
See description of the
|
2011-06-29 10:06:58 +00:00
|
|
|
.Cm call
|
|
|
|
action for more details.
|
|
|
|
.Pp
|
|
|
|
Note that
|
|
|
|
.Cm return
|
|
|
|
rules usually end a
|
|
|
|
.Dq subroutine
|
|
|
|
and thus are unconditional, but
|
|
|
|
.Nm
|
|
|
|
command-line utility currently requires every action except
|
|
|
|
.Cm check-state
|
|
|
|
to have body.
|
|
|
|
While it is sometimes useful to return only on some packets,
|
|
|
|
usually you want to print just
|
|
|
|
.Dq return
|
|
|
|
for readability.
|
|
|
|
A workaround for this is to use new syntax and
|
|
|
|
.Fl c
|
|
|
|
switch:
|
|
|
|
.Bd -literal -offset indent
|
|
|
|
# Add a rule without actual body
|
|
|
|
ipfw add 2999 return via any
|
|
|
|
|
|
|
|
# List rules without "from any to any" part
|
|
|
|
ipfw -c list
|
|
|
|
.Ed
|
|
|
|
.Pp
|
|
|
|
This cosmetic annoyance may be fixed in future releases.
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm tee Ar port
|
|
|
|
Send a copy of packets matching this rule to the
|
|
|
|
.Xr divert 4
|
|
|
|
socket bound to port
|
|
|
|
.Ar port .
|
2004-09-13 16:46:05 +00:00
|
|
|
The search continues with the next rule.
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm unreach Ar code
|
|
|
|
Discard packets that match this rule, and try to send an ICMP
|
|
|
|
unreachable notice with code
|
|
|
|
.Ar code ,
|
|
|
|
where
|
|
|
|
.Ar code
|
|
|
|
is a number from 0 to 255, or one of these aliases:
|
|
|
|
.Cm net , host , protocol , port ,
|
|
|
|
.Cm needfrag , srcfail , net-unknown , host-unknown ,
|
|
|
|
.Cm isolated , net-prohib , host-prohib , tosnet ,
|
|
|
|
.Cm toshost , filter-prohib , host-precedence
|
|
|
|
or
|
|
|
|
.Cm precedence-cutoff .
|
|
|
|
The search terminates.
|
2005-08-13 11:02:34 +00:00
|
|
|
.It Cm unreach6 Ar code
|
|
|
|
Discard packets that match this rule, and try to send an ICMPv6
|
|
|
|
unreachable notice with code
|
|
|
|
.Ar code ,
|
|
|
|
where
|
|
|
|
.Ar code
|
|
|
|
is a number from 0, 1, 3 or 4, or one of these aliases:
|
|
|
|
.Cm no-route, admin-prohib, address
|
|
|
|
or
|
|
|
|
.Cm port .
|
|
|
|
The search terminates.
|
2005-02-05 18:29:03 +00:00
|
|
|
.It Cm netgraph Ar cookie
|
|
|
|
Divert packet into netgraph with given
|
|
|
|
.Ar cookie .
|
|
|
|
The search terminates.
|
|
|
|
If packet is later returned from netgraph it is either
|
|
|
|
accepted or continues with the next rule, depending on
|
2007-11-26 00:36:40 +00:00
|
|
|
.Va net.inet.ip.fw.one_pass
|
2005-02-05 18:29:03 +00:00
|
|
|
sysctl variable.
|
|
|
|
.It Cm ngtee Ar cookie
|
|
|
|
A copy of packet is diverted into netgraph, original
|
2010-07-27 14:31:39 +00:00
|
|
|
packet continues with the next rule.
|
2005-02-05 18:29:03 +00:00
|
|
|
See
|
|
|
|
.Xr ng_ipfw 4
|
|
|
|
for more information on
|
|
|
|
.Cm netgraph
|
|
|
|
and
|
|
|
|
.Cm ngtee
|
|
|
|
actions.
|
2011-05-30 05:37:26 +00:00
|
|
|
.It Cm setfib Ar fibnum | tablearg
|
Add code to allow the system to handle multiple routing tables.
This particular implementation is designed to be fully backwards compatible
and to be MFC-able to 7.x (and 6.x)
Currently the only protocol that can make use of the multiple tables is IPv4
Similar functionality exists in OpenBSD and Linux.
From my notes:
-----
One thing where FreeBSD has been falling behind, and which by chance I
have some time to work on is "policy based routing", which allows
different
packet streams to be routed by more than just the destination address.
Constraints:
------------
I want to make some form of this available in the 6.x tree
(and by extension 7.x) , but FreeBSD in general needs it so I might as
well do it in -current and back port the portions I need.
One of the ways that this can be done is to have the ability to
instantiate multiple kernel routing tables (which I will now
refer to as "Forwarding Information Bases" or "FIBs" for political
correctness reasons). Which FIB a particular packet uses to make
the next hop decision can be decided by a number of mechanisms.
The policies these mechanisms implement are the "Policies" referred
to in "Policy based routing".
One of the constraints I have if I try to back port this work to
6.x is that it must be implemented as a EXTENSION to the existing
ABIs in 6.x so that third party applications do not need to be
recompiled in timespan of the branch.
This first version will not have some of the bells and whistles that
will come with later versions. It will, for example, be limited to 16
tables in the first commit.
Implementation method, Compatible version. (part 1)
-------------------------------
For this reason I have implemented a "sufficient subset" of a
multiple routing table solution in Perforce, and back-ported it
to 6.x. (also in Perforce though not always caught up with what I
have done in -current/P4). The subset allows a number of FIBs
to be defined at compile time (8 is sufficient for my purposes in 6.x)
and implements the changes needed to allow IPV4 to use them. I have not
done the changes for ipv6 simply because I do not need it, and I do not
have enough knowledge of ipv6 (e.g. neighbor discovery) needed to do it.
Other protocol families are left untouched and should there be
users with proprietary protocol families, they should continue to work
and be oblivious to the existence of the extra FIBs.
To understand how this is done, one must know that the current FIB
code starts everything off with a single dimensional array of
pointers to FIB head structures (One per protocol family), each of
which in turn points to the trie of routes available to that family.
The basic change in the ABI compatible version of the change is to
extent that array to be a 2 dimensional array, so that
instead of protocol family X looking at rt_tables[X] for the
table it needs, it looks at rt_tables[Y][X] when for all
protocol families except ipv4 Y is always 0.
Code that is unaware of the change always just sees the first row
of the table, which of course looks just like the one dimensional
array that existed before.
The entry points rtrequest(), rtalloc(), rtalloc1(), rtalloc_ign()
are all maintained, but refer only to the first row of the array,
so that existing callers in proprietary protocols can continue to
do the "right thing".
Some new entry points are added, for the exclusive use of ipv4 code
called in_rtrequest(), in_rtalloc(), in_rtalloc1() and in_rtalloc_ign(),
which have an extra argument which refers the code to the correct row.
In addition, there are some new entry points (currently called
rtalloc_fib() and friends) that check the Address family being
looked up and call either rtalloc() (and friends) if the protocol
is not IPv4 forcing the action to row 0 or to the appropriate row
if it IS IPv4 (and that info is available). These are for calling
from code that is not specific to any particular protocol. The way
these are implemented would change in the non ABI preserving code
to be added later.
One feature of the first version of the code is that for ipv4,
the interface routes show up automatically on all the FIBs, so
that no matter what FIB you select you always have the basic
direct attached hosts available to you. (rtinit() does this
automatically).
You CAN delete an interface route from one FIB should you want
to but by default it's there. ARP information is also available
in each FIB. It's assumed that the same machine would have the
same MAC address, regardless of which FIB you are using to get
to it.
This brings us as to how the correct FIB is selected for an outgoing
IPV4 packet.
Firstly, all packets have a FIB associated with them. if nothing
has been done to change it, it will be FIB 0. The FIB is changed
in the following ways.
Packets fall into one of a number of classes.
1/ locally generated packets, coming from a socket/PCB.
Such packets select a FIB from a number associated with the
socket/PCB. This in turn is inherited from the process,
but can be changed by a socket option. The process in turn
inherits it on fork. I have written a utility call setfib
that acts a bit like nice..
setfib -3 ping target.example.com # will use fib 3 for ping.
It is an obvious extension to make it a property of a jail
but I have not done so. It can be achieved by combining the setfib and
jail commands.
2/ packets received on an interface for forwarding.
By default these packets would use table 0,
(or possibly a number settable in a sysctl(not yet)).
but prior to routing the firewall can inspect them (see below).
(possibly in the future you may be able to associate a FIB
with packets received on an interface.. An ifconfig arg, but not yet.)
3/ packets inspected by a packet classifier, which can arbitrarily
associate a fib with it on a packet by packet basis.
A fib assigned to a packet by a packet classifier
(such as ipfw) would over-ride a fib associated by
a more default source. (such as cases 1 or 2).
4/ a tcp listen socket associated with a fib will generate
accept sockets that are associated with that same fib.
5/ Packets generated in response to some other packet (e.g. reset
or icmp packets). These should use the FIB associated with the
packet being reponded to.
6/ Packets generated during encapsulation.
gif, tun and other tunnel interfaces will encapsulate using the FIB
that was in effect withthe proces that set up the tunnel.
thus setfib 1 ifconfig gif0 [tunnel instructions]
will set the fib for the tunnel to use to be fib 1.
Routing messages would be associated with their
process, and thus select one FIB or another.
messages from the kernel would be associated with the fib they
refer to and would only be received by a routing socket associated
with that fib. (not yet implemented)
In addition Netstat has been edited to be able to cope with the
fact that the array is now 2 dimensional. (It looks in system
memory using libkvm (!)). Old versions of netstat see only the first FIB.
In addition two sysctls are added to give:
a) the number of FIBs compiled in (active)
b) the default FIB of the calling process.
Early testing experience:
-------------------------
Basically our (IronPort's) appliance does this functionality already
using ipfw fwd but that method has some drawbacks.
For example,
It can't fully simulate a routing table because it can't influence the
socket's choice of local address when a connect() is done.
Testing during the generating of these changes has been
remarkably smooth so far. Multiple tables have co-existed
with no notable side effects, and packets have been routes
accordingly.
ipfw has grown 2 new keywords:
setfib N ip from anay to any
count ip from any to any fib N
In pf there seems to be a requirement to be able to give symbolic names to the
fibs but I do not have that capacity. I am not sure if it is required.
SCTP has interestingly enough built in support for this, called VRFs
in Cisco parlance. it will be interesting to see how that handles it
when it suddenly actually does something.
Where to next:
--------------------
After committing the ABI compatible version and MFCing it, I'd
like to proceed in a forward direction in -current. this will
result in some roto-tilling in the routing code.
Firstly: the current code's idea of having a separate tree per
protocol family, all of the same format, and pointed to by the
1 dimensional array is a bit silly. Especially when one considers that
there is code that makes assumptions about every protocol having the
same internal structures there. Some protocols don't WANT that
sort of structure. (for example the whole idea of a netmask is foreign
to appletalk). This needs to be made opaque to the external code.
My suggested first change is to add routing method pointers to the
'domain' structure, along with information pointing the data.
instead of having an array of pointers to uniform structures,
there would be an array pointing to the 'domain' structures
for each protocol address domain (protocol family),
and the methods this reached would be called. The methods would have
an argument that gives FIB number, but the protocol would be free
to ignore it.
When the ABI can be changed it raises the possibilty of the
addition of a fib entry into the "struct route". Currently,
the structure contains the sockaddr of the desination, and the resulting
fib entry. To make this work fully, one could add a fib number
so that given an address and a fib, one can find the third element, the
fib entry.
Interaction with the ARP layer/ LL layer would need to be
revisited as well. Qing Li has been working on this already.
This work was sponsored by Ironport Systems/Cisco
Reviewed by: several including rwatson, bz and mlair (parts each)
Obtained from: Ironport systems/Cisco
2008-05-09 23:03:00 +00:00
|
|
|
The packet is tagged so as to use the FIB (routing table)
|
|
|
|
.Ar fibnum
|
2009-03-19 10:42:07 +00:00
|
|
|
in any subsequent forwarding decisions.
|
2012-09-18 16:00:44 +00:00
|
|
|
In the current implementation, this is limited to the values 0 through 15, see
|
|
|
|
.Xr setfib 2 .
|
2008-07-24 18:39:36 +00:00
|
|
|
Processing continues at the next rule.
|
2012-03-29 05:02:12 +00:00
|
|
|
It is possible to use the
|
2011-05-30 05:37:26 +00:00
|
|
|
.Cm tablearg
|
2012-09-18 16:00:44 +00:00
|
|
|
keyword with setfib.
|
|
|
|
If the tablearg value is not within the compiled range of fibs,
|
|
|
|
the packet's fib is set to 0.
|
2013-03-20 10:35:33 +00:00
|
|
|
.It Cm setdscp Ar DSCP | number | tablearg
|
|
|
|
Set specified DiffServ codepoint for an IPv4/IPv6 packet.
|
|
|
|
Processing continues at the next rule.
|
|
|
|
Supported values are:
|
|
|
|
.Pp
|
|
|
|
.Cm CS0
|
|
|
|
.Pq Dv 000000 ,
|
|
|
|
.Cm CS1
|
|
|
|
.Pq Dv 001000 ,
|
|
|
|
.Cm CS2
|
|
|
|
.Pq Dv 010000 ,
|
|
|
|
.Cm CS3
|
|
|
|
.Pq Dv 011000 ,
|
|
|
|
.Cm CS4
|
|
|
|
.Pq Dv 100000 ,
|
|
|
|
.Cm CS5
|
|
|
|
.Pq Dv 101000 ,
|
|
|
|
.Cm CS6
|
|
|
|
.Pq Dv 110000 ,
|
|
|
|
.Cm CS7
|
|
|
|
.Pq Dv 111000 ,
|
|
|
|
.Cm AF11
|
|
|
|
.Pq Dv 001010 ,
|
|
|
|
.Cm AF12
|
|
|
|
.Pq Dv 001100 ,
|
|
|
|
.Cm AF13
|
|
|
|
.Pq Dv 001110 ,
|
|
|
|
.Cm AF21
|
|
|
|
.Pq Dv 010010 ,
|
|
|
|
.Cm AF22
|
|
|
|
.Pq Dv 010100 ,
|
|
|
|
.Cm AF23
|
|
|
|
.Pq Dv 010110 ,
|
|
|
|
.Cm AF31
|
|
|
|
.Pq Dv 011010 ,
|
|
|
|
.Cm AF32
|
|
|
|
.Pq Dv 011100 ,
|
|
|
|
.Cm AF33
|
|
|
|
.Pq Dv 011110 ,
|
|
|
|
.Cm AF41
|
|
|
|
.Pq Dv 100010 ,
|
|
|
|
.Cm AF42
|
|
|
|
.Pq Dv 100100 ,
|
|
|
|
.Cm AF43
|
|
|
|
.Pq Dv 100110 ,
|
|
|
|
.Cm EF
|
|
|
|
.Pq Dv 101110 ,
|
|
|
|
.Cm BE
|
|
|
|
.Pq Dv 000000 .
|
|
|
|
Additionally, DSCP value can be specified by number (0..64).
|
|
|
|
It is also possible to use the
|
|
|
|
.Cm tablearg
|
|
|
|
keyword with setdscp.
|
|
|
|
If the tablearg value is not within the 0..64 range, lower 6 bits of supplied
|
|
|
|
value are used.
|
2009-04-01 20:23:47 +00:00
|
|
|
.It Cm reass
|
2012-09-18 16:00:44 +00:00
|
|
|
Queue and reassemble IP fragments.
|
2012-09-18 02:33:23 +00:00
|
|
|
If the packet is not fragmented, counters are updated and
|
|
|
|
processing continues with the next rule.
|
2009-04-01 20:23:47 +00:00
|
|
|
If the packet is the last logical fragment, the packet is reassembled and, if
|
|
|
|
.Va net.inet.ip.fw.one_pass
|
2012-09-18 16:00:44 +00:00
|
|
|
is set to 0, processing continues with the next rule.
|
|
|
|
Otherwise, the packet is allowed to pass and the search terminates.
|
|
|
|
If the packet is a fragment in the middle of a logical group of fragments,
|
|
|
|
it is consumed and
|
2012-09-18 02:33:23 +00:00
|
|
|
processing stops immediately.
|
2009-04-05 15:24:27 +00:00
|
|
|
.Pp
|
2012-09-18 16:00:44 +00:00
|
|
|
Fragment handling can be tuned via
|
2009-04-05 15:24:27 +00:00
|
|
|
.Va net.inet.ip.maxfragpackets
|
|
|
|
and
|
|
|
|
.Va net.inet.ip.maxfragsperpacket
|
2012-09-18 02:33:23 +00:00
|
|
|
which limit, respectively, the maximum number of processable
|
|
|
|
fragments (default: 800) and
|
2009-04-05 15:24:27 +00:00
|
|
|
the maximum number of fragments per packet (default: 16).
|
|
|
|
.Pp
|
2012-09-18 02:33:23 +00:00
|
|
|
NOTA BENE: since fragments do not contain port numbers,
|
|
|
|
they should be avoided with the
|
2009-04-05 15:24:27 +00:00
|
|
|
.Nm reass
|
2009-04-07 13:51:41 +00:00
|
|
|
rule.
|
2012-03-29 05:02:12 +00:00
|
|
|
Alternatively, direction-based (like
|
2009-04-05 15:24:27 +00:00
|
|
|
.Nm in
|
|
|
|
/
|
|
|
|
.Nm out
|
|
|
|
) and source-based (like
|
|
|
|
.Nm via
|
|
|
|
) match patterns can be used to select fragments.
|
|
|
|
.Pp
|
|
|
|
Usually a simple rule like:
|
|
|
|
.Bd -literal -offset indent
|
|
|
|
# reassemble incoming fragments
|
|
|
|
ipfw add reass all from any to any in
|
|
|
|
.Ed
|
|
|
|
.Pp
|
|
|
|
is all you need at the beginning of your ruleset.
|
1996-02-24 13:39:46 +00:00
|
|
|
.El
|
2002-08-10 15:04:40 +00:00
|
|
|
.Ss RULE BODY
|
|
|
|
The body of a rule contains zero or more patterns (such as
|
|
|
|
specific source and destination addresses or ports,
|
|
|
|
protocol options, incoming or outgoing interfaces, etc.)
|
|
|
|
that the packet must match in order to be recognised.
|
|
|
|
In general, the patterns are connected by (implicit)
|
2002-08-19 12:36:54 +00:00
|
|
|
.Cm and
|
2004-07-02 21:45:06 +00:00
|
|
|
operators -- i.e., all must match in order for the
|
2002-08-10 15:04:40 +00:00
|
|
|
rule to match.
|
|
|
|
Individual patterns can be prefixed by the
|
2002-08-19 12:36:54 +00:00
|
|
|
.Cm not
|
|
|
|
operator to reverse the result of the match, as in
|
2002-08-10 15:04:40 +00:00
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add 100 allow ip from not 1.2.3.4 to any"
|
|
|
|
.Pp
|
2005-01-15 11:21:24 +00:00
|
|
|
Additionally, sets of alternative match patterns
|
|
|
|
.Pq Em or-blocks
|
|
|
|
can be constructed by putting the patterns in
|
2002-08-10 15:04:40 +00:00
|
|
|
lists enclosed between parentheses ( ) or braces { }, and
|
2002-08-19 12:36:54 +00:00
|
|
|
using the
|
2002-08-10 15:04:40 +00:00
|
|
|
.Cm or
|
2002-08-19 12:36:54 +00:00
|
|
|
operator as follows:
|
2002-08-10 15:04:40 +00:00
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add 100 allow ip from { x or not y or z } to any"
|
|
|
|
.Pp
|
|
|
|
Only one level of parentheses is allowed.
|
|
|
|
Beware that most shells have special meanings for parentheses
|
2002-08-19 12:36:54 +00:00
|
|
|
or braces, so it is advisable to put a backslash \\ in front of them
|
|
|
|
to prevent such interpretations.
|
2002-08-10 15:04:40 +00:00
|
|
|
.Pp
|
2002-08-19 04:52:15 +00:00
|
|
|
The body of a rule must in general include a source and destination
|
2002-10-28 07:03:56 +00:00
|
|
|
address specifier.
|
2002-08-10 15:04:40 +00:00
|
|
|
The keyword
|
|
|
|
.Ar any
|
|
|
|
can be used in various places to specify that the content of
|
|
|
|
a required field is irrelevant.
|
|
|
|
.Pp
|
2002-08-19 12:36:54 +00:00
|
|
|
The rule body has the following format:
|
2002-08-10 15:04:40 +00:00
|
|
|
.Bd -ragged -offset indent
|
2002-08-19 12:36:54 +00:00
|
|
|
.Op Ar proto Cm from Ar src Cm to Ar dst
|
2002-08-10 15:04:40 +00:00
|
|
|
.Op Ar options
|
|
|
|
.Ed
|
1996-02-24 13:39:46 +00:00
|
|
|
.Pp
|
2003-07-08 08:07:03 +00:00
|
|
|
The first part (proto from src to dst) is for backward
|
2006-01-13 16:44:56 +00:00
|
|
|
compatibility with earlier versions of
|
|
|
|
.Fx .
|
|
|
|
In modern
|
|
|
|
.Fx
|
2005-04-18 18:35:05 +00:00
|
|
|
any match pattern (including MAC headers, IP protocols,
|
2002-08-19 12:36:54 +00:00
|
|
|
addresses and ports) can be specified in the
|
2002-08-19 04:52:15 +00:00
|
|
|
.Ar options
|
2002-08-19 12:36:54 +00:00
|
|
|
section.
|
2002-08-16 10:31:47 +00:00
|
|
|
.Pp
|
|
|
|
Rule fields have the following meaning:
|
2002-08-10 15:04:40 +00:00
|
|
|
.Bl -tag -width indent
|
2002-08-19 12:36:54 +00:00
|
|
|
.It Ar proto : protocol | Cm { Ar protocol Cm or ... }
|
2003-07-08 08:07:03 +00:00
|
|
|
.It Ar protocol : Oo Cm not Oc Ar protocol-name | protocol-number
|
2005-04-18 18:35:05 +00:00
|
|
|
An IP protocol specified by number or name
|
2002-08-19 12:36:54 +00:00
|
|
|
(for a complete list see
|
2005-06-14 11:24:56 +00:00
|
|
|
.Pa /etc/protocols ) ,
|
2005-06-03 01:10:28 +00:00
|
|
|
or one of the following keywords:
|
2005-06-14 11:24:56 +00:00
|
|
|
.Bl -tag -width indent
|
2005-06-03 01:10:28 +00:00
|
|
|
.It Cm ip4 | ipv4
|
|
|
|
Matches IPv4 packets.
|
|
|
|
.It Cm ip6 | ipv6
|
|
|
|
Matches IPv6 packets.
|
2005-06-14 11:24:56 +00:00
|
|
|
.It Cm ip | all
|
2005-06-03 01:10:28 +00:00
|
|
|
Matches any packet.
|
|
|
|
.El
|
2003-07-08 08:07:03 +00:00
|
|
|
.Pp
|
|
|
|
The
|
2005-11-29 15:25:09 +00:00
|
|
|
.Cm ipv6
|
|
|
|
in
|
|
|
|
.Cm proto
|
|
|
|
option will be treated as inner protocol.
|
|
|
|
And, the
|
|
|
|
.Cm ipv4
|
|
|
|
is not available in
|
|
|
|
.Cm proto
|
|
|
|
option.
|
|
|
|
.Pp
|
|
|
|
The
|
2003-07-08 08:07:03 +00:00
|
|
|
.Cm { Ar protocol Cm or ... }
|
|
|
|
format (an
|
|
|
|
.Em or-block )
|
|
|
|
is provided for convenience only but its use is deprecated.
|
|
|
|
.It Ar src No and Ar dst : Bro Cm addr | Cm { Ar addr Cm or ... } Brc Op Oo Cm not Oc Ar ports
|
|
|
|
An address (or a list, see below)
|
2002-08-10 15:04:40 +00:00
|
|
|
optionally followed by
|
2002-08-19 04:52:15 +00:00
|
|
|
.Ar ports
|
|
|
|
specifiers.
|
2003-07-08 08:07:03 +00:00
|
|
|
.Pp
|
2005-01-15 11:21:24 +00:00
|
|
|
The second format
|
|
|
|
.Em ( or-block
|
2003-07-08 08:07:03 +00:00
|
|
|
with multiple addresses) is provided for convenience only and
|
|
|
|
its use is discouraged.
|
2004-06-09 20:10:38 +00:00
|
|
|
.It Ar addr : Oo Cm not Oc Bro
|
2006-02-03 16:41:13 +00:00
|
|
|
.Cm any | me | me6 |
|
2014-08-13 00:19:18 +00:00
|
|
|
.Cm table Ns Pq Ar name Ns Op , Ns Ar value
|
2004-06-09 20:10:38 +00:00
|
|
|
.Ar | addr-list | addr-set
|
|
|
|
.Brc
|
2010-10-21 12:27:13 +00:00
|
|
|
.Bl -tag -width indent
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm any
|
|
|
|
matches any IP address.
|
|
|
|
.It Cm me
|
|
|
|
matches any IP address configured on an interface in the system.
|
2005-04-18 18:35:05 +00:00
|
|
|
.It Cm me6
|
|
|
|
matches any IPv6 address configured on an interface in the system.
|
2002-08-10 15:04:40 +00:00
|
|
|
The address list is evaluated at the time the packet is
|
|
|
|
analysed.
|
2014-08-13 00:19:18 +00:00
|
|
|
.It Cm table Ns Pq Ar name Ns Op , Ns Ar value
|
|
|
|
Matches any IPv4 or IPv6 address for which an entry exists in the lookup table
|
2004-06-09 20:10:38 +00:00
|
|
|
.Ar number .
|
|
|
|
If an optional 32-bit unsigned
|
|
|
|
.Ar value
|
|
|
|
is also specified, an entry will match only if it has this value.
|
|
|
|
See the
|
|
|
|
.Sx LOOKUP TABLES
|
|
|
|
section below for more information on lookup tables.
|
2009-12-15 09:32:35 +00:00
|
|
|
.El
|
2003-07-08 08:07:03 +00:00
|
|
|
.It Ar addr-list : ip-addr Ns Op Ns , Ns Ar addr-list
|
|
|
|
.It Ar ip-addr :
|
|
|
|
A host or subnet address specified in one of the following ways:
|
|
|
|
.Bl -tag -width indent
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Ar numeric-ip | hostname
|
|
|
|
Matches a single IPv4 address, specified as dotted-quad or a hostname.
|
|
|
|
Hostnames are resolved at the time the rule is added to the firewall list.
|
|
|
|
.It Ar addr Ns / Ns Ar masklen
|
|
|
|
Matches all addresses with base
|
|
|
|
.Ar addr
|
2006-10-04 19:29:05 +00:00
|
|
|
(specified as an IP address, a network number, or a hostname)
|
2002-08-10 15:04:40 +00:00
|
|
|
and mask width of
|
|
|
|
.Cm masklen
|
|
|
|
bits.
|
2006-10-04 19:29:05 +00:00
|
|
|
As an example, 1.2.3.4/25 or 1.2.3.0/25 will match
|
2002-08-10 15:04:40 +00:00
|
|
|
all IP numbers from 1.2.3.0 to 1.2.3.127 .
|
2002-08-21 05:57:41 +00:00
|
|
|
.It Ar addr Ns : Ns Ar mask
|
|
|
|
Matches all addresses with base
|
|
|
|
.Ar addr
|
2006-10-04 19:29:05 +00:00
|
|
|
(specified as an IP address, a network number, or a hostname)
|
2002-08-21 05:57:41 +00:00
|
|
|
and the mask of
|
|
|
|
.Ar mask ,
|
|
|
|
specified as a dotted quad.
|
2006-10-04 19:29:05 +00:00
|
|
|
As an example, 1.2.3.4:255.0.255.0 or 1.0.3.0:255.0.255.0 will match
|
2002-08-21 05:57:41 +00:00
|
|
|
1.*.3.*.
|
2004-01-23 06:37:19 +00:00
|
|
|
This form is advised only for non-contiguous
|
2004-07-02 21:45:06 +00:00
|
|
|
masks.
|
|
|
|
It is better to resort to the
|
2002-08-21 05:57:41 +00:00
|
|
|
.Ar addr Ns / Ns Ar masklen
|
|
|
|
format for contiguous masks, which is more compact and less
|
|
|
|
error-prone.
|
1996-02-24 13:39:46 +00:00
|
|
|
.El
|
2003-07-08 08:07:03 +00:00
|
|
|
.It Ar addr-set : addr Ns Oo Ns / Ns Ar masklen Oc Ns Cm { Ns Ar list Ns Cm }
|
|
|
|
.It Ar list : Bro Ar num | num-num Brc Ns Op Ns , Ns Ar list
|
|
|
|
Matches all addresses with base address
|
|
|
|
.Ar addr
|
2006-10-04 19:29:05 +00:00
|
|
|
(specified as an IP address, a network number, or a hostname)
|
2003-07-08 08:07:03 +00:00
|
|
|
and whose last byte is in the list between braces { } .
|
|
|
|
Note that there must be no spaces between braces and
|
|
|
|
numbers (spaces after commas are allowed).
|
|
|
|
Elements of the list can be specified as single entries
|
|
|
|
or ranges.
|
|
|
|
The
|
|
|
|
.Ar masklen
|
|
|
|
field is used to limit the size of the set of addresses,
|
2004-07-02 21:45:06 +00:00
|
|
|
and can have any value between 24 and 32.
|
|
|
|
If not specified,
|
2003-07-08 08:07:03 +00:00
|
|
|
it will be assumed as 24.
|
|
|
|
.br
|
|
|
|
This format is particularly useful to handle sparse address sets
|
2004-07-02 21:45:06 +00:00
|
|
|
within a single rule.
|
|
|
|
Because the matching occurs using a
|
2003-07-08 08:07:03 +00:00
|
|
|
bitmask, it takes constant time and dramatically reduces
|
|
|
|
the complexity of rulesets.
|
|
|
|
.br
|
|
|
|
As an example, an address specified as 1.2.3.4/24{128,35-55,89}
|
2006-10-04 19:29:05 +00:00
|
|
|
or 1.2.3.0/24{128,35-55,89}
|
2003-07-08 08:07:03 +00:00
|
|
|
will match the following IP addresses:
|
|
|
|
.br
|
|
|
|
1.2.3.128, 1.2.3.35 to 1.2.3.55, 1.2.3.89 .
|
2005-04-18 18:35:05 +00:00
|
|
|
.It Ar addr6-list : ip6-addr Ns Op Ns , Ns Ar addr6-list
|
|
|
|
.It Ar ip6-addr :
|
|
|
|
A host or subnet specified one of the following ways:
|
|
|
|
.Bl -tag -width indent
|
|
|
|
.It Ar numeric-ip | hostname
|
|
|
|
Matches a single IPv6 address as allowed by
|
|
|
|
.Xr inet_pton 3
|
|
|
|
or a hostname.
|
|
|
|
Hostnames are resolved at the time the rule is added to the firewall
|
|
|
|
list.
|
|
|
|
.It Ar addr Ns / Ns Ar masklen
|
|
|
|
Matches all IPv6 addresses with base
|
|
|
|
.Ar addr
|
|
|
|
(specified as allowed by
|
|
|
|
.Xr inet_pton
|
|
|
|
or a hostname)
|
|
|
|
and mask width of
|
|
|
|
.Cm masklen
|
|
|
|
bits.
|
|
|
|
.El
|
|
|
|
.Pp
|
|
|
|
No support for sets of IPv6 addresses is provided because IPv6 addresses
|
|
|
|
are typically random past the initial prefix.
|
2003-07-08 08:07:03 +00:00
|
|
|
.It Ar ports : Bro Ar port | port Ns \&- Ns Ar port Ns Brc Ns Op , Ns Ar ports
|
2002-08-19 04:52:15 +00:00
|
|
|
For protocols which support port numbers (such as TCP and UDP), optional
|
2002-08-10 15:04:40 +00:00
|
|
|
.Cm ports
|
|
|
|
may be specified as one or more ports or port ranges, separated
|
|
|
|
by commas but no spaces, and an optional
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm not
|
2002-08-19 04:52:15 +00:00
|
|
|
operator.
|
2000-01-08 11:19:19 +00:00
|
|
|
The
|
2000-02-28 15:21:12 +00:00
|
|
|
.Ql \&-
|
2000-01-08 11:19:19 +00:00
|
|
|
notation specifies a range of ports (including boundaries).
|
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
Service names (from
|
1996-06-15 01:38:51 +00:00
|
|
|
.Pa /etc/services )
|
1997-06-23 22:32:13 +00:00
|
|
|
may be used instead of numeric port values.
|
2002-08-19 04:52:15 +00:00
|
|
|
The length of the port list is limited to 30 ports or ranges,
|
|
|
|
though one can specify larger ranges by using an
|
2002-08-10 15:04:40 +00:00
|
|
|
.Em or-block
|
2002-08-19 04:52:15 +00:00
|
|
|
in the
|
|
|
|
.Cm options
|
|
|
|
section of the rule.
|
2002-08-10 15:04:40 +00:00
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
A backslash
|
|
|
|
.Pq Ql \e
|
|
|
|
can be used to escape the dash
|
|
|
|
.Pq Ql -
|
2002-08-19 12:36:54 +00:00
|
|
|
character in a service name (from a shell, the backslash must be
|
2002-10-28 07:03:56 +00:00
|
|
|
typed twice to avoid the shell itself interpreting it as an escape
|
2002-08-19 12:36:54 +00:00
|
|
|
character).
|
1999-06-15 12:56:38 +00:00
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
.Dl "ipfw add count tcp from any ftp\e\e-data-ftp to any"
|
1996-06-15 01:38:51 +00:00
|
|
|
.Pp
|
2004-07-02 21:45:06 +00:00
|
|
|
Fragmented packets which have a non-zero offset (i.e., not the first
|
1998-02-12 00:57:06 +00:00
|
|
|
fragment) will never match a rule which has one or more port
|
2000-02-28 15:21:12 +00:00
|
|
|
specifications.
|
|
|
|
See the
|
|
|
|
.Cm frag
|
1998-02-12 00:57:06 +00:00
|
|
|
option for details on matching fragmented packets.
|
1997-06-02 05:02:37 +00:00
|
|
|
.El
|
2002-08-19 04:52:15 +00:00
|
|
|
.Ss RULE OPTIONS (MATCH PATTERNS)
|
2002-08-10 15:04:40 +00:00
|
|
|
Additional match patterns can be used within
|
2004-07-02 21:45:06 +00:00
|
|
|
rules.
|
|
|
|
Zero or more of these so-called
|
2002-08-10 15:04:40 +00:00
|
|
|
.Em options
|
|
|
|
can be present in a rule, optionally prefixed by the
|
|
|
|
.Cm not
|
|
|
|
operand, and possibly grouped into
|
|
|
|
.Em or-blocks .
|
|
|
|
.Pp
|
2002-08-19 04:52:15 +00:00
|
|
|
The following match patterns can be used (listed in alphabetical order):
|
2002-08-10 15:04:40 +00:00
|
|
|
.Bl -tag -width indent
|
2003-07-12 07:01:48 +00:00
|
|
|
.It Cm // this is a comment.
|
|
|
|
Inserts the specified text as a comment in the rule.
|
|
|
|
Everything following // is considered as a comment and stored in the rule.
|
|
|
|
You can have comment-only rules, which are listed as having a
|
|
|
|
.Cm count
|
|
|
|
action followed by the comment.
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm bridged
|
2004-11-03 21:51:34 +00:00
|
|
|
Alias for
|
|
|
|
.Cm layer2 .
|
2004-10-03 00:35:52 +00:00
|
|
|
.It Cm diverted
|
|
|
|
Matches only packets generated by a divert socket.
|
|
|
|
.It Cm diverted-loopback
|
|
|
|
Matches only packets coming from a divert socket back into the IP stack
|
|
|
|
input for delivery.
|
|
|
|
.It Cm diverted-output
|
|
|
|
Matches only packets going from a divert socket back outward to the IP
|
|
|
|
stack output for delivery.
|
2003-06-22 17:33:19 +00:00
|
|
|
.It Cm dst-ip Ar ip-address
|
2005-04-18 18:35:05 +00:00
|
|
|
Matches IPv4 packets whose destination IP is one of the address(es)
|
|
|
|
specified as argument.
|
|
|
|
.It Bro Cm dst-ip6 | dst-ipv6 Brc Ar ip6-address
|
|
|
|
Matches IPv6 packets whose destination IP is one of the address(es)
|
2002-08-19 04:52:15 +00:00
|
|
|
specified as argument.
|
2003-06-22 17:33:19 +00:00
|
|
|
.It Cm dst-port Ar ports
|
2002-08-19 04:52:15 +00:00
|
|
|
Matches IP packets whose destination port is one of the port(s)
|
|
|
|
specified as argument.
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm established
|
2004-03-27 14:13:53 +00:00
|
|
|
Matches TCP packets that have the RST or ACK bits set.
|
2005-04-18 18:35:05 +00:00
|
|
|
.It Cm ext6hdr Ar header
|
|
|
|
Matches IPv6 packets containing the extended header given by
|
|
|
|
.Ar header .
|
|
|
|
Supported headers are:
|
|
|
|
.Pp
|
|
|
|
Fragment,
|
|
|
|
.Pq Cm frag ,
|
|
|
|
Hop-to-hop options
|
|
|
|
.Pq Cm hopopt ,
|
2007-05-04 11:15:41 +00:00
|
|
|
any type of Routing Header
|
2005-04-18 18:35:05 +00:00
|
|
|
.Pq Cm route ,
|
2007-05-04 11:15:41 +00:00
|
|
|
Source routing Routing Header Type 0
|
|
|
|
.Pq Cm rthdr0 ,
|
|
|
|
Mobile IPv6 Routing Header Type 2
|
|
|
|
.Pq Cm rthdr2 ,
|
2005-08-13 11:02:34 +00:00
|
|
|
Destination options
|
|
|
|
.Pq Cm dstopt ,
|
2005-04-18 18:35:05 +00:00
|
|
|
IPSec authentication headers
|
|
|
|
.Pq Cm ah ,
|
2009-03-19 10:42:07 +00:00
|
|
|
and IPsec encapsulated security payload headers
|
2005-04-18 18:35:05 +00:00
|
|
|
.Pq Cm esp .
|
Add code to allow the system to handle multiple routing tables.
This particular implementation is designed to be fully backwards compatible
and to be MFC-able to 7.x (and 6.x)
Currently the only protocol that can make use of the multiple tables is IPv4
Similar functionality exists in OpenBSD and Linux.
From my notes:
-----
One thing where FreeBSD has been falling behind, and which by chance I
have some time to work on is "policy based routing", which allows
different
packet streams to be routed by more than just the destination address.
Constraints:
------------
I want to make some form of this available in the 6.x tree
(and by extension 7.x) , but FreeBSD in general needs it so I might as
well do it in -current and back port the portions I need.
One of the ways that this can be done is to have the ability to
instantiate multiple kernel routing tables (which I will now
refer to as "Forwarding Information Bases" or "FIBs" for political
correctness reasons). Which FIB a particular packet uses to make
the next hop decision can be decided by a number of mechanisms.
The policies these mechanisms implement are the "Policies" referred
to in "Policy based routing".
One of the constraints I have if I try to back port this work to
6.x is that it must be implemented as a EXTENSION to the existing
ABIs in 6.x so that third party applications do not need to be
recompiled in timespan of the branch.
This first version will not have some of the bells and whistles that
will come with later versions. It will, for example, be limited to 16
tables in the first commit.
Implementation method, Compatible version. (part 1)
-------------------------------
For this reason I have implemented a "sufficient subset" of a
multiple routing table solution in Perforce, and back-ported it
to 6.x. (also in Perforce though not always caught up with what I
have done in -current/P4). The subset allows a number of FIBs
to be defined at compile time (8 is sufficient for my purposes in 6.x)
and implements the changes needed to allow IPV4 to use them. I have not
done the changes for ipv6 simply because I do not need it, and I do not
have enough knowledge of ipv6 (e.g. neighbor discovery) needed to do it.
Other protocol families are left untouched and should there be
users with proprietary protocol families, they should continue to work
and be oblivious to the existence of the extra FIBs.
To understand how this is done, one must know that the current FIB
code starts everything off with a single dimensional array of
pointers to FIB head structures (One per protocol family), each of
which in turn points to the trie of routes available to that family.
The basic change in the ABI compatible version of the change is to
extent that array to be a 2 dimensional array, so that
instead of protocol family X looking at rt_tables[X] for the
table it needs, it looks at rt_tables[Y][X] when for all
protocol families except ipv4 Y is always 0.
Code that is unaware of the change always just sees the first row
of the table, which of course looks just like the one dimensional
array that existed before.
The entry points rtrequest(), rtalloc(), rtalloc1(), rtalloc_ign()
are all maintained, but refer only to the first row of the array,
so that existing callers in proprietary protocols can continue to
do the "right thing".
Some new entry points are added, for the exclusive use of ipv4 code
called in_rtrequest(), in_rtalloc(), in_rtalloc1() and in_rtalloc_ign(),
which have an extra argument which refers the code to the correct row.
In addition, there are some new entry points (currently called
rtalloc_fib() and friends) that check the Address family being
looked up and call either rtalloc() (and friends) if the protocol
is not IPv4 forcing the action to row 0 or to the appropriate row
if it IS IPv4 (and that info is available). These are for calling
from code that is not specific to any particular protocol. The way
these are implemented would change in the non ABI preserving code
to be added later.
One feature of the first version of the code is that for ipv4,
the interface routes show up automatically on all the FIBs, so
that no matter what FIB you select you always have the basic
direct attached hosts available to you. (rtinit() does this
automatically).
You CAN delete an interface route from one FIB should you want
to but by default it's there. ARP information is also available
in each FIB. It's assumed that the same machine would have the
same MAC address, regardless of which FIB you are using to get
to it.
This brings us as to how the correct FIB is selected for an outgoing
IPV4 packet.
Firstly, all packets have a FIB associated with them. if nothing
has been done to change it, it will be FIB 0. The FIB is changed
in the following ways.
Packets fall into one of a number of classes.
1/ locally generated packets, coming from a socket/PCB.
Such packets select a FIB from a number associated with the
socket/PCB. This in turn is inherited from the process,
but can be changed by a socket option. The process in turn
inherits it on fork. I have written a utility call setfib
that acts a bit like nice..
setfib -3 ping target.example.com # will use fib 3 for ping.
It is an obvious extension to make it a property of a jail
but I have not done so. It can be achieved by combining the setfib and
jail commands.
2/ packets received on an interface for forwarding.
By default these packets would use table 0,
(or possibly a number settable in a sysctl(not yet)).
but prior to routing the firewall can inspect them (see below).
(possibly in the future you may be able to associate a FIB
with packets received on an interface.. An ifconfig arg, but not yet.)
3/ packets inspected by a packet classifier, which can arbitrarily
associate a fib with it on a packet by packet basis.
A fib assigned to a packet by a packet classifier
(such as ipfw) would over-ride a fib associated by
a more default source. (such as cases 1 or 2).
4/ a tcp listen socket associated with a fib will generate
accept sockets that are associated with that same fib.
5/ Packets generated in response to some other packet (e.g. reset
or icmp packets). These should use the FIB associated with the
packet being reponded to.
6/ Packets generated during encapsulation.
gif, tun and other tunnel interfaces will encapsulate using the FIB
that was in effect withthe proces that set up the tunnel.
thus setfib 1 ifconfig gif0 [tunnel instructions]
will set the fib for the tunnel to use to be fib 1.
Routing messages would be associated with their
process, and thus select one FIB or another.
messages from the kernel would be associated with the fib they
refer to and would only be received by a routing socket associated
with that fib. (not yet implemented)
In addition Netstat has been edited to be able to cope with the
fact that the array is now 2 dimensional. (It looks in system
memory using libkvm (!)). Old versions of netstat see only the first FIB.
In addition two sysctls are added to give:
a) the number of FIBs compiled in (active)
b) the default FIB of the calling process.
Early testing experience:
-------------------------
Basically our (IronPort's) appliance does this functionality already
using ipfw fwd but that method has some drawbacks.
For example,
It can't fully simulate a routing table because it can't influence the
socket's choice of local address when a connect() is done.
Testing during the generating of these changes has been
remarkably smooth so far. Multiple tables have co-existed
with no notable side effects, and packets have been routes
accordingly.
ipfw has grown 2 new keywords:
setfib N ip from anay to any
count ip from any to any fib N
In pf there seems to be a requirement to be able to give symbolic names to the
fibs but I do not have that capacity. I am not sure if it is required.
SCTP has interestingly enough built in support for this, called VRFs
in Cisco parlance. it will be interesting to see how that handles it
when it suddenly actually does something.
Where to next:
--------------------
After committing the ABI compatible version and MFCing it, I'd
like to proceed in a forward direction in -current. this will
result in some roto-tilling in the routing code.
Firstly: the current code's idea of having a separate tree per
protocol family, all of the same format, and pointed to by the
1 dimensional array is a bit silly. Especially when one considers that
there is code that makes assumptions about every protocol having the
same internal structures there. Some protocols don't WANT that
sort of structure. (for example the whole idea of a netmask is foreign
to appletalk). This needs to be made opaque to the external code.
My suggested first change is to add routing method pointers to the
'domain' structure, along with information pointing the data.
instead of having an array of pointers to uniform structures,
there would be an array pointing to the 'domain' structures
for each protocol address domain (protocol family),
and the methods this reached would be called. The methods would have
an argument that gives FIB number, but the protocol would be free
to ignore it.
When the ABI can be changed it raises the possibilty of the
addition of a fib entry into the "struct route". Currently,
the structure contains the sockaddr of the desination, and the resulting
fib entry. To make this work fully, one could add a fib number
so that given an address and a fib, one can find the third element, the
fib entry.
Interaction with the ARP layer/ LL layer would need to be
revisited as well. Qing Li has been working on this already.
This work was sponsored by Ironport Systems/Cisco
Reviewed by: several including rwatson, bz and mlair (parts each)
Obtained from: Ironport systems/Cisco
2008-05-09 23:03:00 +00:00
|
|
|
.It Cm fib Ar fibnum
|
|
|
|
Matches a packet that has been tagged to use
|
|
|
|
the given FIB (routing table) number.
|
2014-08-13 00:19:18 +00:00
|
|
|
.It Cm flow Ar table Ns Pq Ar name Ns Op , Ns Ar value
|
|
|
|
Search for the flow entry in lookup table
|
|
|
|
.Ar name .
|
|
|
|
If not found, the match fails.
|
|
|
|
Otherwise, the match succeeds and
|
|
|
|
.Cm tablearg
|
|
|
|
is set to the value extracted from the table.
|
|
|
|
.Pp
|
|
|
|
This option can be useful to quickly dispatch traffic based on
|
|
|
|
certain packet fields.
|
|
|
|
See the
|
|
|
|
.Sx LOOKUP TABLES
|
|
|
|
section below for more information on lookup tables.
|
2005-04-18 18:35:05 +00:00
|
|
|
.It Cm flow-id Ar labels
|
|
|
|
Matches IPv6 packets containing any of the flow labels given in
|
|
|
|
.Ar labels .
|
|
|
|
.Ar labels
|
2009-04-08 17:46:45 +00:00
|
|
|
is a comma separated list of numeric flow labels.
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm frag
|
2002-08-19 04:52:15 +00:00
|
|
|
Matches packets that are fragments and not the first
|
2004-07-02 21:45:06 +00:00
|
|
|
fragment of an IP datagram.
|
|
|
|
Note that these packets will not have
|
|
|
|
the next protocol header (e.g.\& TCP, UDP) so options that look into
|
2002-08-19 04:52:15 +00:00
|
|
|
these headers cannot match.
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm gid Ar group
|
2002-08-19 04:52:15 +00:00
|
|
|
Matches all TCP or UDP packets sent by or received for a
|
2002-08-10 15:04:40 +00:00
|
|
|
.Ar group .
|
|
|
|
A
|
|
|
|
.Ar group
|
2002-08-19 04:52:15 +00:00
|
|
|
may be specified by name or number.
|
2004-08-12 22:06:55 +00:00
|
|
|
.It Cm jail Ar prisonID
|
|
|
|
Matches all TCP or UDP packets sent by or received for the
|
2004-08-13 02:50:59 +00:00
|
|
|
jail whos prison ID is
|
|
|
|
.Ar prisonID .
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm icmptypes Ar types
|
2002-08-19 04:52:15 +00:00
|
|
|
Matches ICMP packets whose ICMP type is in the list
|
2002-08-10 15:04:40 +00:00
|
|
|
.Ar types .
|
2003-07-12 07:01:48 +00:00
|
|
|
The list may be specified as any combination of
|
|
|
|
individual types (numeric) separated by commas.
|
2007-11-26 00:36:40 +00:00
|
|
|
.Em Ranges are not allowed .
|
2002-08-10 15:04:40 +00:00
|
|
|
The supported ICMP types are:
|
|
|
|
.Pp
|
|
|
|
echo reply
|
|
|
|
.Pq Cm 0 ,
|
|
|
|
destination unreachable
|
|
|
|
.Pq Cm 3 ,
|
|
|
|
source quench
|
|
|
|
.Pq Cm 4 ,
|
|
|
|
redirect
|
|
|
|
.Pq Cm 5 ,
|
|
|
|
echo request
|
|
|
|
.Pq Cm 8 ,
|
|
|
|
router advertisement
|
|
|
|
.Pq Cm 9 ,
|
|
|
|
router solicitation
|
|
|
|
.Pq Cm 10 ,
|
|
|
|
time-to-live exceeded
|
|
|
|
.Pq Cm 11 ,
|
|
|
|
IP header bad
|
|
|
|
.Pq Cm 12 ,
|
|
|
|
timestamp request
|
|
|
|
.Pq Cm 13 ,
|
|
|
|
timestamp reply
|
|
|
|
.Pq Cm 14 ,
|
|
|
|
information request
|
|
|
|
.Pq Cm 15 ,
|
|
|
|
information reply
|
|
|
|
.Pq Cm 16 ,
|
|
|
|
address mask request
|
|
|
|
.Pq Cm 17
|
|
|
|
and address mask reply
|
|
|
|
.Pq Cm 18 .
|
2005-04-18 18:35:05 +00:00
|
|
|
.It Cm icmp6types Ar types
|
|
|
|
Matches ICMP6 packets whose ICMP6 type is in the list of
|
|
|
|
.Ar types .
|
|
|
|
The list may be specified as any combination of
|
|
|
|
individual types (numeric) separated by commas.
|
2007-11-26 00:36:40 +00:00
|
|
|
.Em Ranges are not allowed .
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm in | out
|
2002-08-19 04:52:15 +00:00
|
|
|
Matches incoming or outgoing packets, respectively.
|
2002-08-10 15:04:40 +00:00
|
|
|
.Cm in
|
|
|
|
and
|
|
|
|
.Cm out
|
|
|
|
are mutually exclusive (in fact,
|
|
|
|
.Cm out
|
|
|
|
is implemented as
|
2002-08-19 04:52:15 +00:00
|
|
|
.Cm not in Ns No ).
|
2003-06-22 17:33:19 +00:00
|
|
|
.It Cm ipid Ar id-list
|
2005-04-18 18:35:05 +00:00
|
|
|
Matches IPv4 packets whose
|
2002-08-19 04:52:15 +00:00
|
|
|
.Cm ip_id
|
2003-06-22 17:33:19 +00:00
|
|
|
field has value included in
|
|
|
|
.Ar id-list ,
|
|
|
|
which is either a single value or a list of values or ranges
|
|
|
|
specified in the same way as
|
|
|
|
.Ar ports .
|
|
|
|
.It Cm iplen Ar len-list
|
2002-08-19 04:52:15 +00:00
|
|
|
Matches IP packets whose total length, including header and data, is
|
2003-06-22 17:33:19 +00:00
|
|
|
in the set
|
|
|
|
.Ar len-list ,
|
2004-07-02 21:45:06 +00:00
|
|
|
which is either a single value or a list of values or ranges
|
2003-06-22 17:33:19 +00:00
|
|
|
specified in the same way as
|
|
|
|
.Ar ports .
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm ipoptions Ar spec
|
2005-04-18 18:35:05 +00:00
|
|
|
Matches packets whose IPv4 header contains the comma separated list of
|
2002-08-10 15:04:40 +00:00
|
|
|
options specified in
|
|
|
|
.Ar spec .
|
|
|
|
The supported IP options are:
|
|
|
|
.Pp
|
|
|
|
.Cm ssrr
|
|
|
|
(strict source route),
|
|
|
|
.Cm lsrr
|
|
|
|
(loose source route),
|
|
|
|
.Cm rr
|
|
|
|
(record packet route) and
|
|
|
|
.Cm ts
|
|
|
|
(timestamp).
|
|
|
|
The absence of a particular option may be denoted
|
|
|
|
with a
|
|
|
|
.Ql \&! .
|
|
|
|
.It Cm ipprecedence Ar precedence
|
2005-04-18 18:35:05 +00:00
|
|
|
Matches IPv4 packets whose precedence field is equal to
|
2002-08-10 15:04:40 +00:00
|
|
|
.Ar precedence .
|
2003-07-04 21:42:32 +00:00
|
|
|
.It Cm ipsec
|
|
|
|
Matches packets that have IPSEC history associated with them
|
2004-07-02 21:45:06 +00:00
|
|
|
(i.e., the packet comes encapsulated in IPSEC, the kernel
|
2007-08-05 16:16:15 +00:00
|
|
|
has IPSEC support and IPSEC_FILTERTUNNEL option, and can correctly
|
2003-07-04 21:42:32 +00:00
|
|
|
decapsulate it).
|
|
|
|
.Pp
|
|
|
|
Note that specifying
|
|
|
|
.Cm ipsec
|
|
|
|
is different from specifying
|
|
|
|
.Cm proto Ar ipsec
|
|
|
|
as the latter will only look at the specific IP protocol field,
|
|
|
|
irrespective of IPSEC kernel support and the validity of the IPSEC data.
|
2003-12-02 00:23:45 +00:00
|
|
|
.Pp
|
|
|
|
Further note that this flag is silently ignored in kernels without
|
|
|
|
IPSEC support.
|
|
|
|
It does not affect rule processing when given and the
|
|
|
|
rules are handled as if with no
|
|
|
|
.Cm ipsec
|
|
|
|
flag.
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm iptos Ar spec
|
2005-04-18 18:35:05 +00:00
|
|
|
Matches IPv4 packets whose
|
2002-08-19 04:52:15 +00:00
|
|
|
.Cm tos
|
|
|
|
field contains the comma separated list of
|
2002-08-10 15:04:40 +00:00
|
|
|
service types specified in
|
|
|
|
.Ar spec .
|
|
|
|
The supported IP types of service are:
|
|
|
|
.Pp
|
|
|
|
.Cm lowdelay
|
|
|
|
.Pq Dv IPTOS_LOWDELAY ,
|
|
|
|
.Cm throughput
|
|
|
|
.Pq Dv IPTOS_THROUGHPUT ,
|
|
|
|
.Cm reliability
|
|
|
|
.Pq Dv IPTOS_RELIABILITY ,
|
|
|
|
.Cm mincost
|
|
|
|
.Pq Dv IPTOS_MINCOST ,
|
|
|
|
.Cm congestion
|
2007-10-19 18:24:19 +00:00
|
|
|
.Pq Dv IPTOS_ECN_CE .
|
2002-08-10 15:04:40 +00:00
|
|
|
The absence of a particular type may be denoted
|
|
|
|
with a
|
|
|
|
.Ql \&! .
|
2013-03-20 10:35:33 +00:00
|
|
|
.It Cm dscp spec Ns Op , Ns Ar spec
|
|
|
|
Matches IPv4/IPv6 packets whose
|
|
|
|
.Cm DS
|
|
|
|
field value is contained in
|
|
|
|
.Ar spec
|
|
|
|
mask.
|
2013-03-21 11:22:13 +00:00
|
|
|
Multiple values can be specified via
|
2013-03-20 10:35:33 +00:00
|
|
|
the comma separated list.
|
|
|
|
Value can be one of keywords used in
|
|
|
|
.Cm setdscp
|
|
|
|
action or exact number.
|
2003-06-22 17:33:19 +00:00
|
|
|
.It Cm ipttl Ar ttl-list
|
2005-04-18 18:35:05 +00:00
|
|
|
Matches IPv4 packets whose time to live is included in
|
2003-06-22 17:33:19 +00:00
|
|
|
.Ar ttl-list ,
|
|
|
|
which is either a single value or a list of values or ranges
|
|
|
|
specified in the same way as
|
|
|
|
.Ar ports .
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm ipversion Ar ver
|
2002-08-19 04:52:15 +00:00
|
|
|
Matches IP packets whose IP version field is
|
2002-08-10 15:04:40 +00:00
|
|
|
.Ar ver .
|
2016-07-19 04:56:59 +00:00
|
|
|
.It Cm keep-state Op Ar flowname
|
2002-08-10 15:04:40 +00:00
|
|
|
Upon a match, the firewall will create a dynamic rule, whose
|
2002-10-28 07:03:56 +00:00
|
|
|
default behaviour is to match bidirectional traffic between
|
2002-08-10 15:04:40 +00:00
|
|
|
source and destination IP/port using the same protocol.
|
|
|
|
The rule has a limited lifetime (controlled by a set of
|
|
|
|
.Xr sysctl 8
|
|
|
|
variables), and the lifetime is refreshed every time a matching
|
|
|
|
packet is found.
|
2016-07-19 04:56:59 +00:00
|
|
|
The
|
|
|
|
.Ar flowname
|
|
|
|
is used to assign additional to addresses, ports and protocol parameter
|
|
|
|
to dynamic rule. It can be used for more accurate matching by
|
|
|
|
.Cm check-state
|
|
|
|
rule.
|
|
|
|
The
|
|
|
|
.Cm default
|
|
|
|
keyword is special name used for compatibility with old rulesets.
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm layer2
|
2004-07-02 21:45:06 +00:00
|
|
|
Matches only layer2 packets, i.e., those passed to
|
2002-08-10 15:04:40 +00:00
|
|
|
.Nm
|
|
|
|
from ether_demux() and ether_output_frame().
|
2016-07-19 04:56:59 +00:00
|
|
|
.It Cm limit Bro Cm src-addr | src-port | dst-addr | dst-port Brc Ar N Op Ar flowname
|
2002-08-10 15:04:40 +00:00
|
|
|
The firewall will only allow
|
|
|
|
.Ar N
|
|
|
|
connections with the same
|
|
|
|
set of parameters as specified in the rule.
|
|
|
|
One or more
|
|
|
|
of source and destination addresses and ports can be
|
|
|
|
specified.
|
2014-08-13 00:19:18 +00:00
|
|
|
.It Cm lookup Bro Cm dst-ip | dst-port | src-ip | src-port | uid | jail Brc Ar name
|
2009-12-15 09:46:27 +00:00
|
|
|
Search an entry in lookup table
|
2014-08-13 00:19:18 +00:00
|
|
|
.Ar name
|
2009-12-15 09:46:27 +00:00
|
|
|
that matches the field specified as argument.
|
|
|
|
If not found, the match fails.
|
|
|
|
Otherwise, the match succeeds and
|
|
|
|
.Cm tablearg
|
|
|
|
is set to the value extracted from the table.
|
2010-03-05 14:13:58 +00:00
|
|
|
.Pp
|
2009-12-15 09:46:27 +00:00
|
|
|
This option can be useful to quickly dispatch traffic based on
|
|
|
|
certain packet fields.
|
|
|
|
See the
|
|
|
|
.Sx LOOKUP TABLES
|
|
|
|
section below for more information on lookup tables.
|
2002-08-19 04:52:15 +00:00
|
|
|
.It Cm { MAC | mac } Ar dst-mac src-mac
|
2002-08-19 12:36:54 +00:00
|
|
|
Match packets with a given
|
|
|
|
.Ar dst-mac
|
|
|
|
and
|
2002-09-22 11:30:51 +00:00
|
|
|
.Ar src-mac
|
2002-08-19 12:36:54 +00:00
|
|
|
addresses, specified as the
|
|
|
|
.Cm any
|
|
|
|
keyword (matching any MAC address), or six groups of hex digits
|
2002-10-28 07:03:56 +00:00
|
|
|
separated by colons,
|
2003-09-10 06:41:16 +00:00
|
|
|
and optionally followed by a mask indicating the significant bits.
|
|
|
|
The mask may be specified using either of the following methods:
|
|
|
|
.Bl -enum -width indent
|
|
|
|
.It
|
|
|
|
A slash
|
|
|
|
.Pq /
|
|
|
|
followed by the number of significant bits.
|
|
|
|
For example, an address with 33 significant bits could be specified as:
|
2002-08-19 12:36:54 +00:00
|
|
|
.Pp
|
|
|
|
.Dl "MAC 10:20:30:40:50:60/33 any"
|
2003-09-10 06:41:16 +00:00
|
|
|
.It
|
|
|
|
An ampersand
|
|
|
|
.Pq &
|
|
|
|
followed by a bitmask specified as six groups of hex digits separated
|
|
|
|
by colons.
|
|
|
|
For example, an address in which the last 16 bits are significant could
|
|
|
|
be specified as:
|
|
|
|
.Pp
|
|
|
|
.Dl "MAC 10:20:30:40:50:60&00:00:00:00:ff:ff any"
|
|
|
|
.Pp
|
|
|
|
Note that the ampersand character has a special meaning in many shells
|
|
|
|
and should generally be escaped.
|
|
|
|
.El
|
2002-08-19 12:36:54 +00:00
|
|
|
Note that the order of MAC addresses (destination first,
|
|
|
|
source second) is
|
|
|
|
the same as on the wire, but the opposite of the one used for
|
|
|
|
IP addresses.
|
2002-08-19 04:52:15 +00:00
|
|
|
.It Cm mac-type Ar mac-type
|
2002-08-19 12:36:54 +00:00
|
|
|
Matches packets whose Ethernet Type field
|
2002-08-19 04:52:15 +00:00
|
|
|
corresponds to one of those specified as argument.
|
2002-08-19 12:36:54 +00:00
|
|
|
.Ar mac-type
|
|
|
|
is specified in the same way as
|
|
|
|
.Cm port numbers
|
2004-07-02 21:45:06 +00:00
|
|
|
(i.e., one or more comma-separated single values or ranges).
|
2002-08-19 12:36:54 +00:00
|
|
|
You can use symbolic names for known values such as
|
|
|
|
.Em vlan , ipv4, ipv6 .
|
2002-10-28 07:03:56 +00:00
|
|
|
Values can be entered as decimal or hexadecimal (if prefixed by 0x),
|
2002-08-19 12:36:54 +00:00
|
|
|
and they are always printed as hexadecimal (unless the
|
|
|
|
.Cm -N
|
|
|
|
option is used, in which case symbolic resolution will be attempted).
|
2002-08-19 04:52:15 +00:00
|
|
|
.It Cm proto Ar protocol
|
2005-04-18 18:35:05 +00:00
|
|
|
Matches packets with the corresponding IP protocol.
|
2014-08-13 00:19:18 +00:00
|
|
|
.It Cm recv | xmit | via Brq Ar ifX | Ar if Ns Cm * | Ar table Ns Po Ar name Ns Oo , Ns Ar value Oc Pc | Ar ipno | Ar any
|
2002-10-28 07:03:56 +00:00
|
|
|
Matches packets received, transmitted or going through,
|
2002-08-19 04:52:15 +00:00
|
|
|
respectively, the interface specified by exact name
|
2012-05-12 17:14:55 +00:00
|
|
|
.Po Ar ifX Pc ,
|
2002-08-19 04:52:15 +00:00
|
|
|
by device name
|
2012-05-12 17:14:55 +00:00
|
|
|
.Po Ar if* Pc ,
|
2002-08-19 04:52:15 +00:00
|
|
|
by IP address, or through some interface.
|
2014-08-13 00:19:18 +00:00
|
|
|
Table
|
|
|
|
.Ar name
|
|
|
|
may be used to match interface by its kernel ifindex.
|
|
|
|
See the
|
|
|
|
.Sx LOOKUP TABLES
|
|
|
|
section below for more information on lookup tables.
|
1997-06-02 05:02:37 +00:00
|
|
|
.Pp
|
|
|
|
The
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm via
|
1997-06-02 05:02:37 +00:00
|
|
|
keyword causes the interface to always be checked.
|
|
|
|
If
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm recv
|
1997-06-02 05:02:37 +00:00
|
|
|
or
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm xmit
|
1997-06-02 05:02:37 +00:00
|
|
|
is used instead of
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm via ,
|
2001-10-14 22:46:05 +00:00
|
|
|
then only the receive or transmit interface (respectively)
|
2000-02-28 15:21:12 +00:00
|
|
|
is checked.
|
|
|
|
By specifying both, it is possible to match packets based on
|
|
|
|
both receive and transmit interface, e.g.:
|
1997-06-02 05:02:37 +00:00
|
|
|
.Pp
|
2002-08-10 15:04:40 +00:00
|
|
|
.Dl "ipfw add deny ip from any to any out recv ed0 xmit ed1"
|
1996-02-24 13:39:46 +00:00
|
|
|
.Pp
|
1997-06-02 05:02:37 +00:00
|
|
|
The
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm recv
|
|
|
|
interface can be tested on either incoming or outgoing packets,
|
|
|
|
while the
|
|
|
|
.Cm xmit
|
|
|
|
interface can only be tested on outgoing packets.
|
|
|
|
So
|
|
|
|
.Cm out
|
1997-06-02 05:02:37 +00:00
|
|
|
is required (and
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm in
|
|
|
|
is invalid) whenever
|
|
|
|
.Cm xmit
|
|
|
|
is used.
|
1997-06-02 05:02:37 +00:00
|
|
|
.Pp
|
2010-03-20 14:42:16 +00:00
|
|
|
A packet might not have a receive or transmit interface: packets
|
2000-02-28 15:21:12 +00:00
|
|
|
originating from the local host have no receive interface,
|
|
|
|
while packets destined for the local host have no transmit
|
|
|
|
interface.
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm setup
|
2002-08-19 04:52:15 +00:00
|
|
|
Matches TCP packets that have the SYN bit set but no ACK bit.
|
2002-08-10 15:04:40 +00:00
|
|
|
This is the short form of
|
|
|
|
.Dq Li tcpflags\ syn,!ack .
|
2010-11-12 13:05:17 +00:00
|
|
|
.It Cm sockarg
|
|
|
|
Matches packets that are associated to a local socket and
|
|
|
|
for which the SO_USER_COOKIE socket option has been set
|
2012-09-18 02:33:23 +00:00
|
|
|
to a non-zero value.
|
|
|
|
As a side effect, the value of the
|
2010-11-12 13:05:17 +00:00
|
|
|
option is made available as
|
|
|
|
.Cm tablearg
|
|
|
|
value, which in turn can be used as
|
|
|
|
.Cm skipto
|
|
|
|
or
|
|
|
|
.Cm pipe
|
|
|
|
number.
|
2002-08-19 04:52:15 +00:00
|
|
|
.It Cm src-ip Ar ip-address
|
2005-04-18 18:35:05 +00:00
|
|
|
Matches IPv4 packets whose source IP is one of the address(es)
|
|
|
|
specified as an argument.
|
|
|
|
.It Cm src-ip6 Ar ip6-address
|
|
|
|
Matches IPv6 packets whose source IP is one of the address(es)
|
|
|
|
specified as an argument.
|
2002-08-19 04:52:15 +00:00
|
|
|
.It Cm src-port Ar ports
|
|
|
|
Matches IP packets whose source port is one of the port(s)
|
|
|
|
specified as argument.
|
2006-05-24 13:09:55 +00:00
|
|
|
.It Cm tagged Ar tag-list
|
|
|
|
Matches packets whose tags are included in
|
|
|
|
.Ar tag-list ,
|
|
|
|
which is either a single value or a list of values or ranges
|
|
|
|
specified in the same way as
|
|
|
|
.Ar ports .
|
|
|
|
Tags can be applied to the packet using
|
|
|
|
.Cm tag
|
|
|
|
rule action parameter (see it's description for details on tags).
|
2000-10-06 11:17:06 +00:00
|
|
|
.It Cm tcpack Ar ack
|
1996-02-24 13:39:46 +00:00
|
|
|
TCP packets only.
|
2000-10-06 11:17:06 +00:00
|
|
|
Match if the TCP header acknowledgment number field is set to
|
|
|
|
.Ar ack .
|
2004-10-03 00:47:15 +00:00
|
|
|
.It Cm tcpdatalen Ar tcpdatalen-list
|
|
|
|
Matches TCP packets whose length of TCP data is
|
|
|
|
.Ar tcpdatalen-list ,
|
|
|
|
which is either a single value or a list of values or ranges
|
|
|
|
specified in the same way as
|
|
|
|
.Ar ports .
|
2000-02-28 15:21:12 +00:00
|
|
|
.It Cm tcpflags Ar spec
|
1996-02-24 13:39:46 +00:00
|
|
|
TCP packets only.
|
1999-05-29 08:12:38 +00:00
|
|
|
Match if the TCP header contains the comma separated list of
|
1996-06-15 01:38:51 +00:00
|
|
|
flags specified in
|
|
|
|
.Ar spec .
|
|
|
|
The supported TCP flags are:
|
2000-01-08 11:19:19 +00:00
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm fin ,
|
|
|
|
.Cm syn ,
|
|
|
|
.Cm rst ,
|
|
|
|
.Cm psh ,
|
|
|
|
.Cm ack
|
1996-06-15 01:38:51 +00:00
|
|
|
and
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm urg .
|
1996-06-15 01:38:51 +00:00
|
|
|
The absence of a particular flag may be denoted
|
1999-04-28 02:49:29 +00:00
|
|
|
with a
|
2000-12-18 15:16:24 +00:00
|
|
|
.Ql \&! .
|
1998-02-12 00:57:06 +00:00
|
|
|
A rule which contains a
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm tcpflags
|
1998-02-12 00:57:06 +00:00
|
|
|
specification can never match a fragmented packet which has
|
2000-02-28 15:21:12 +00:00
|
|
|
a non-zero offset.
|
|
|
|
See the
|
|
|
|
.Cm frag
|
1998-02-12 00:57:06 +00:00
|
|
|
option for details on matching fragmented packets.
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm tcpseq Ar seq
|
2000-10-06 11:17:06 +00:00
|
|
|
TCP packets only.
|
2002-08-10 15:04:40 +00:00
|
|
|
Match if the TCP header sequence number field is set to
|
|
|
|
.Ar seq .
|
2012-02-06 11:35:29 +00:00
|
|
|
.It Cm tcpwin Ar tcpwin-list
|
|
|
|
Matches TCP packets whose header window field is set to
|
|
|
|
.Ar tcpwin-list ,
|
|
|
|
which is either a single value or a list of values or ranges
|
|
|
|
specified in the same way as
|
|
|
|
.Ar ports .
|
2000-10-06 11:17:06 +00:00
|
|
|
.It Cm tcpoptions Ar spec
|
|
|
|
TCP packets only.
|
|
|
|
Match if the TCP header contains the comma separated list of
|
|
|
|
options specified in
|
|
|
|
.Ar spec .
|
|
|
|
The supported TCP options are:
|
|
|
|
.Pp
|
|
|
|
.Cm mss
|
|
|
|
(maximum segment size),
|
|
|
|
.Cm window
|
|
|
|
(tcp window advertisement),
|
|
|
|
.Cm sack
|
|
|
|
(selective ack),
|
|
|
|
.Cm ts
|
|
|
|
(rfc1323 timestamp) and
|
|
|
|
.Cm cc
|
|
|
|
(rfc1644 t/tcp connection count).
|
|
|
|
The absence of a particular option may be denoted
|
|
|
|
with a
|
2000-12-18 15:16:24 +00:00
|
|
|
.Ql \&! .
|
2000-02-28 15:21:12 +00:00
|
|
|
.It Cm uid Ar user
|
2000-01-08 11:19:19 +00:00
|
|
|
Match all TCP or UDP packets sent by or received for a
|
|
|
|
.Ar user .
|
|
|
|
A
|
|
|
|
.Ar user
|
|
|
|
may be matched by name or identification number.
|
2003-03-15 01:13:00 +00:00
|
|
|
.It Cm verrevpath
|
|
|
|
For incoming packets,
|
|
|
|
a routing table lookup is done on the packet's source address.
|
|
|
|
If the interface on which the packet entered the system matches the
|
|
|
|
outgoing interface for the route,
|
|
|
|
the packet matches.
|
|
|
|
If the interfaces do not match up,
|
|
|
|
the packet does not match.
|
|
|
|
All outgoing packets or packets with no incoming interface match.
|
|
|
|
.Pp
|
|
|
|
The name and functionality of the option is intentionally similar to
|
|
|
|
the Cisco IOS command:
|
|
|
|
.Pp
|
|
|
|
.Dl ip verify unicast reverse-path
|
|
|
|
.Pp
|
2004-04-23 14:28:38 +00:00
|
|
|
This option can be used to make anti-spoofing rules to reject all
|
|
|
|
packets with source addresses not from this interface.
|
2004-08-09 16:12:10 +00:00
|
|
|
See also the option
|
|
|
|
.Cm antispoof .
|
2004-04-23 14:28:38 +00:00
|
|
|
.It Cm versrcreach
|
|
|
|
For incoming packets,
|
|
|
|
a routing table lookup is done on the packet's source address.
|
2004-07-21 19:55:14 +00:00
|
|
|
If a route to the source address exists, but not the default route
|
|
|
|
or a blackhole/reject route, the packet matches.
|
2004-08-09 16:12:10 +00:00
|
|
|
Otherwise, the packet does not match.
|
2004-04-23 14:28:38 +00:00
|
|
|
All outgoing packets match.
|
|
|
|
.Pp
|
|
|
|
The name and functionality of the option is intentionally similar to
|
|
|
|
the Cisco IOS command:
|
|
|
|
.Pp
|
|
|
|
.Dl ip verify unicast source reachable-via any
|
|
|
|
.Pp
|
|
|
|
This option can be used to make anti-spoofing rules to reject all
|
|
|
|
packets whose source address is unreachable.
|
2004-08-09 16:12:10 +00:00
|
|
|
.It Cm antispoof
|
|
|
|
For incoming packets, the packet's source address is checked if it
|
|
|
|
belongs to a directly connected network.
|
|
|
|
If the network is directly connected, then the interface the packet
|
|
|
|
came on in is compared to the interface the network is connected to.
|
|
|
|
When incoming interface and directly connected interface are not the
|
|
|
|
same, the packet does not match.
|
|
|
|
Otherwise, the packet does match.
|
|
|
|
All outgoing packets match.
|
|
|
|
.Pp
|
|
|
|
This option can be used to make anti-spoofing rules to reject all
|
|
|
|
packets that pretend to be from a directly connected network but do
|
|
|
|
not come in through that interface.
|
|
|
|
This option is similar to but more restricted than
|
|
|
|
.Cm verrevpath
|
|
|
|
because it engages only on packets with source addresses of directly
|
|
|
|
connected networks instead of all source addresses.
|
2000-02-28 15:21:12 +00:00
|
|
|
.El
|
2004-06-09 20:10:38 +00:00
|
|
|
.Sh LOOKUP TABLES
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
Lookup tables are useful to handle large sparse sets of
|
2012-09-18 02:33:23 +00:00
|
|
|
addresses or other search keys (e.g., ports, jail IDs, interface names).
|
2014-08-13 00:19:18 +00:00
|
|
|
In the rest of this section we will use the term ``key''.
|
|
|
|
Table name needs to match the following spec:
|
|
|
|
.Ar table-name .
|
2014-12-29 13:50:59 +00:00
|
|
|
Tables with the same name can be created in different
|
2014-08-13 15:29:29 +00:00
|
|
|
.Ar sets .
|
|
|
|
However, rule links to the tables in
|
|
|
|
.Ar set 0
|
|
|
|
by default.
|
|
|
|
This behavior can be controlled by
|
|
|
|
.Va net.inet.ip.fw.tables_sets
|
|
|
|
variable.
|
|
|
|
See the
|
|
|
|
.Sx SETS OF RULES
|
|
|
|
section for more information.
|
2014-08-13 00:19:18 +00:00
|
|
|
There may be up to 65535 different lookup tables.
|
2004-06-09 20:10:38 +00:00
|
|
|
.Pp
|
2014-08-13 00:19:18 +00:00
|
|
|
The following table types are supported:
|
|
|
|
.Bl -tag -width indent
|
2014-08-14 21:43:20 +00:00
|
|
|
.It Ar table-type : Ar addr | iface | number | flow
|
2014-08-13 00:19:18 +00:00
|
|
|
.It Ar table-key : Ar addr Ns Oo / Ns Ar masklen Oc | iface-name | number | flow-spec
|
|
|
|
.It Ar flow-spec : Ar flow-field Ns Op , Ns Ar flow-spec
|
|
|
|
.It Ar flow-field : src-ip | proto | src-port | dst-ip | dst-port
|
2014-08-14 21:43:20 +00:00
|
|
|
.It Cm addr
|
2014-08-13 00:19:18 +00:00
|
|
|
matches IPv4 or IPv6 address.
|
2004-06-09 20:10:38 +00:00
|
|
|
Each entry is represented by an
|
|
|
|
.Ar addr Ns Op / Ns Ar masklen
|
|
|
|
and will match all addresses with base
|
|
|
|
.Ar addr
|
2014-08-13 00:19:18 +00:00
|
|
|
(specified as an IPv4/IPv6 address, or a hostname) and mask width of
|
2004-06-09 20:10:38 +00:00
|
|
|
.Ar masklen
|
|
|
|
bits.
|
|
|
|
If
|
|
|
|
.Ar masklen
|
2012-03-12 14:07:57 +00:00
|
|
|
is not specified, it defaults to 32 for IPv4 and 128 for IPv6.
|
2004-06-09 20:10:38 +00:00
|
|
|
When looking up an IP address in a table, the most specific
|
|
|
|
entry will match.
|
2014-08-13 00:19:18 +00:00
|
|
|
.It Cm iface
|
|
|
|
matches interface names.
|
|
|
|
Each entry is represented by string treated as interface name.
|
|
|
|
Wildcards are not supported.
|
|
|
|
.It Cm number
|
|
|
|
maches protocol ports, uids/gids or jail IDs.
|
|
|
|
Each entry is represented by 32-bit unsigned integer.
|
|
|
|
Ranges are not supported.
|
|
|
|
.It Cm flow
|
|
|
|
Matches packet fields specified by
|
|
|
|
.Ar flow
|
|
|
|
type suboptions with table entries.
|
|
|
|
.El
|
2005-04-18 18:35:05 +00:00
|
|
|
.Pp
|
2014-08-13 00:19:18 +00:00
|
|
|
Tables require explicit creation via
|
|
|
|
.Cm create
|
|
|
|
before use.
|
|
|
|
.Pp
|
|
|
|
The following creation options are supported:
|
|
|
|
.Bl -tag -width indent
|
|
|
|
.It Ar create-options : Ar create-option | create-options
|
2014-10-03 15:36:58 +00:00
|
|
|
.It Ar create-option : Cm type Ar table-type | Cm valtype Ar value-mask | Cm algo Ar algo-desc |
|
2014-08-13 00:19:18 +00:00
|
|
|
.Cm limit Ar number | Cm locked
|
|
|
|
.It Cm type
|
|
|
|
Table key type.
|
2014-10-03 15:36:58 +00:00
|
|
|
.It Cm valtype
|
|
|
|
Table value mask.
|
2014-08-13 00:19:18 +00:00
|
|
|
.It Cm algo
|
|
|
|
Table algorithm to use (see below).
|
|
|
|
.It Cm limit
|
|
|
|
Maximum number of items that may be inserted into table.
|
|
|
|
.It Cm locked
|
|
|
|
Restrict any table modifications.
|
|
|
|
.El
|
|
|
|
.Pp
|
|
|
|
Some of these options may be modified later via
|
|
|
|
.Cm modify
|
|
|
|
keyword.
|
|
|
|
The following options can be changed:
|
|
|
|
.Bl -tag -width indent
|
|
|
|
.It Ar modify-options : Ar modify-option | modify-options
|
2014-10-03 15:36:58 +00:00
|
|
|
.It Ar modify-option : Cm limit Ar number
|
2014-08-13 00:19:18 +00:00
|
|
|
.It Cm limit
|
|
|
|
Alter maximum number of items that may be inserted into table.
|
|
|
|
.El
|
|
|
|
.Pp
|
|
|
|
Additionally, table can be locked or unlocked using
|
|
|
|
.Cm lock
|
|
|
|
or
|
|
|
|
.Cm unlock
|
|
|
|
commands.
|
|
|
|
.Pp
|
|
|
|
Tables of the same
|
|
|
|
.Ar type
|
|
|
|
can be swapped with each other using
|
|
|
|
.Cm swap Ar name
|
|
|
|
command.
|
|
|
|
Swap may fail if tables limits are set and data exchange
|
|
|
|
would result in limits hit.
|
|
|
|
Operation is performed atomically.
|
|
|
|
.Pp
|
|
|
|
One or more entries can be added to a table at once using
|
|
|
|
.Cm add
|
|
|
|
command.
|
|
|
|
Addition of all items are performed atomically.
|
|
|
|
By default, error in addition of one entry does not influence
|
|
|
|
addition of other entries. However, non-zero error code is returned
|
2014-12-29 13:50:59 +00:00
|
|
|
in that case.
|
2014-08-13 00:19:18 +00:00
|
|
|
Special
|
|
|
|
.Cm atomic
|
|
|
|
keyword may be specified before
|
|
|
|
.Cm add
|
|
|
|
to indicate all-or-none add request.
|
|
|
|
.Pp
|
|
|
|
One or more entries can be removed from a table at once using
|
|
|
|
.Cm delete
|
|
|
|
command.
|
|
|
|
By default, error in removal of one entry does not influence
|
|
|
|
removing of other entries. However, non-zero error code is returned
|
2014-12-29 13:50:59 +00:00
|
|
|
in that case.
|
2014-08-13 00:19:18 +00:00
|
|
|
.Pp
|
|
|
|
It may be possible to check what entry will be found on particular
|
|
|
|
.Ar table-key
|
|
|
|
using
|
|
|
|
.Cm lookup
|
2014-11-23 21:00:00 +00:00
|
|
|
.Ar table-key
|
2014-08-13 00:19:18 +00:00
|
|
|
command.
|
|
|
|
This functionality is optional and may be unsupported in some algorithms.
|
|
|
|
.Pp
|
|
|
|
The following operations can be performed on
|
|
|
|
.Ar one
|
|
|
|
or
|
|
|
|
.Cm all
|
|
|
|
tables:
|
|
|
|
.Bl -tag -width indent
|
|
|
|
.It Cm list
|
|
|
|
List all entries.
|
|
|
|
.It Cm flush
|
|
|
|
Removes all entries.
|
|
|
|
.It Cm info
|
|
|
|
Shows generic table information.
|
|
|
|
.It Cm detail
|
|
|
|
Shows generic table information and algo-specific data.
|
|
|
|
.El
|
|
|
|
.Pp
|
|
|
|
The following lookup algorithms are supported:
|
|
|
|
.Bl -tag -width indent
|
|
|
|
.It Ar algo-desc : algo-name | "algo-name algo-data"
|
2014-10-24 17:06:56 +00:00
|
|
|
.It Ar algo-name: Ar addr:radix | addr:hash | iface:array | number:array | flow:hash
|
2014-08-14 21:43:20 +00:00
|
|
|
.It Cm addr:radix
|
2014-08-13 00:19:18 +00:00
|
|
|
Separate Radix trees for IPv4 and IPv6, the same way as the routing table (see
|
|
|
|
.Xr route 4 ) .
|
|
|
|
Default choice for
|
2014-10-03 15:36:58 +00:00
|
|
|
.Ar addr
|
2014-08-13 00:19:18 +00:00
|
|
|
type.
|
2014-08-14 21:43:20 +00:00
|
|
|
.It Cm addr:hash
|
2014-08-13 00:19:18 +00:00
|
|
|
Separate auto-growing hashes for IPv4 and IPv6.
|
|
|
|
Accepts entries with the same mask length specified initially via
|
2014-08-14 21:43:20 +00:00
|
|
|
.Cm "addr:hash masks=/v4,/v6"
|
2014-08-13 00:19:18 +00:00
|
|
|
algorithm creation options.
|
|
|
|
Assume /32 and /128 masks by default.
|
|
|
|
Search removes host bits (according to mask) from supplied address and checks
|
|
|
|
resulting key in appropriate hash.
|
|
|
|
Mostly optimized for /64 and byte-ranged IPv6 masks.
|
2014-10-24 17:06:56 +00:00
|
|
|
.It Cm iface:array
|
2014-08-13 00:19:18 +00:00
|
|
|
Array storing sorted indexes for entries which are presented in the system.
|
|
|
|
Optimized for very fast lookup.
|
|
|
|
.It Cm number:array
|
|
|
|
Array storing sorted u32 numbers.
|
|
|
|
.It Cm flow:hash
|
|
|
|
Auto-growing hash storing flow entries.
|
|
|
|
Search calculates hash on required packet fields and searches for matching
|
|
|
|
entries in selected bucket.
|
|
|
|
.El
|
2006-01-13 15:48:38 +00:00
|
|
|
.Pp
|
|
|
|
The
|
|
|
|
.Cm tablearg
|
|
|
|
feature provides the ability to use a value, looked up in the table, as
|
2006-06-15 09:39:22 +00:00
|
|
|
the argument for a rule action, action parameter or rule option.
|
2006-01-13 15:48:38 +00:00
|
|
|
This can significantly reduce number of rules in some configurations.
|
2008-08-01 22:34:01 +00:00
|
|
|
If two tables are used in a rule, the result of the second (destination)
|
|
|
|
is used.
|
2014-08-13 00:19:18 +00:00
|
|
|
.Pp
|
2014-10-03 15:36:58 +00:00
|
|
|
Each record may hold one or more values according to
|
|
|
|
.Ar value-mask .
|
|
|
|
This mask is set on table creation via
|
|
|
|
.Cm valtype
|
|
|
|
option.
|
2014-08-13 00:19:18 +00:00
|
|
|
The following value types are supported:
|
|
|
|
.Bl -tag -width indent
|
2014-10-03 15:36:58 +00:00
|
|
|
.It Ar value-mask : Ar value-type Ns Op , Ns Ar value-mask
|
|
|
|
.It Ar value-type : Ar skipto | pipe | fib | nat | dscp | tag | divert |
|
|
|
|
.Ar netgraph | limit | ipv4
|
|
|
|
.It Cm skipto
|
|
|
|
rule number to jump to.
|
|
|
|
.It Cm pipe
|
|
|
|
Pipe number to use.
|
|
|
|
.It Cm fib
|
|
|
|
fib number to match/set.
|
|
|
|
.It Cm nat
|
|
|
|
nat number to jump to.
|
|
|
|
.It Cm dscp
|
|
|
|
dscp value to match/set.
|
|
|
|
.It Cm tag
|
|
|
|
tag number to match/set.
|
|
|
|
.It Cm divert
|
|
|
|
port number to divert traffic to.
|
|
|
|
.It Cm netgraph
|
|
|
|
hook number to move packet to.
|
|
|
|
.It Cm limit
|
|
|
|
maximum number of connections.
|
|
|
|
.It Cm ipv4
|
|
|
|
IPv4 nexthop to fwd packets to.
|
2015-03-13 09:03:25 +00:00
|
|
|
.It Cm ipv6
|
|
|
|
IPv6 nexthop to fwd packets to.
|
2014-08-13 00:19:18 +00:00
|
|
|
.El
|
2014-08-13 15:29:29 +00:00
|
|
|
.Pp
|
2006-01-13 15:48:38 +00:00
|
|
|
The
|
|
|
|
.Cm tablearg
|
|
|
|
argument can be used with the following actions:
|
2011-05-30 05:37:26 +00:00
|
|
|
.Cm nat, pipe , queue, divert, tee, netgraph, ngtee, fwd, skipto, setfib,
|
2006-06-15 09:39:22 +00:00
|
|
|
action parameters:
|
|
|
|
.Cm tag, untag,
|
|
|
|
rule options:
|
|
|
|
.Cm limit, tagged.
|
2006-08-17 22:49:50 +00:00
|
|
|
.Pp
|
2008-08-01 22:34:01 +00:00
|
|
|
When used with the
|
|
|
|
.Cm skipto
|
|
|
|
action, the user should be aware that the code will walk the ruleset
|
2014-10-03 15:36:58 +00:00
|
|
|
up to a rule equal to, or past, the given number.
|
|
|
|
.Pp
|
|
|
|
See the
|
|
|
|
.Sx EXAMPLES
|
|
|
|
Section for example usage of tables and the tablearg keyword.
|
2002-08-16 10:31:47 +00:00
|
|
|
.Sh SETS OF RULES
|
2014-08-13 15:29:29 +00:00
|
|
|
Each rule or table belongs to one of 32 different
|
2002-08-16 10:31:47 +00:00
|
|
|
.Em sets
|
|
|
|
, numbered 0 to 31.
|
|
|
|
Set 31 is reserved for the default rule.
|
|
|
|
.Pp
|
2014-08-13 15:29:29 +00:00
|
|
|
By default, rules or tables are put in set 0, unless you use the
|
2002-08-16 10:31:47 +00:00
|
|
|
.Cm set N
|
2014-08-13 15:29:29 +00:00
|
|
|
attribute when adding a new rule or table.
|
2002-08-16 10:31:47 +00:00
|
|
|
Sets can be individually and atomically enabled or disabled,
|
|
|
|
so this mechanism permits an easy way to store multiple configurations
|
|
|
|
of the firewall and quickly (and atomically) switch between them.
|
2014-08-13 15:29:29 +00:00
|
|
|
.Pp
|
|
|
|
By default, tables from set 0 are referenced when adding rule with
|
|
|
|
table opcodes regardless of rule set.
|
|
|
|
This behavior can be changed by setting
|
|
|
|
.Va net.inet.ip.fw.tables_set
|
|
|
|
variable to 1.
|
|
|
|
Rule's set will then be used for table references.
|
|
|
|
.Pp
|
2002-08-16 10:31:47 +00:00
|
|
|
The command to enable/disable sets is
|
2002-10-28 07:03:56 +00:00
|
|
|
.Bd -ragged -offset indent
|
2002-08-16 10:31:47 +00:00
|
|
|
.Nm
|
2002-10-28 07:03:56 +00:00
|
|
|
.Cm set Oo Cm disable Ar number ... Oc Op Cm enable Ar number ...
|
|
|
|
.Ed
|
2002-08-16 10:31:47 +00:00
|
|
|
.Pp
|
|
|
|
where multiple
|
|
|
|
.Cm enable
|
|
|
|
or
|
|
|
|
.Cm disable
|
|
|
|
sections can be specified.
|
|
|
|
Command execution is atomic on all the sets specified in the command.
|
|
|
|
By default, all sets are enabled.
|
|
|
|
.Pp
|
2002-10-28 07:03:56 +00:00
|
|
|
When you disable a set, its rules behave as if they do not exist
|
2002-08-16 10:31:47 +00:00
|
|
|
in the firewall configuration, with only one exception:
|
2002-10-28 07:03:56 +00:00
|
|
|
.Bd -ragged -offset indent
|
2002-08-16 10:31:47 +00:00
|
|
|
dynamic rules created from a rule before it had been disabled
|
2004-07-02 21:45:06 +00:00
|
|
|
will still be active until they expire.
|
|
|
|
In order to delete
|
2002-08-16 10:31:47 +00:00
|
|
|
dynamic rules you have to explicitly delete the parent rule
|
2002-10-28 07:03:56 +00:00
|
|
|
which generated them.
|
|
|
|
.Ed
|
2002-08-16 10:31:47 +00:00
|
|
|
.Pp
|
2002-10-28 07:03:56 +00:00
|
|
|
The set number of rules can be changed with the command
|
|
|
|
.Bd -ragged -offset indent
|
2003-03-03 22:46:36 +00:00
|
|
|
.Nm
|
2002-08-16 10:31:47 +00:00
|
|
|
.Cm set move
|
|
|
|
.Brq Cm rule Ar rule-number | old-set
|
|
|
|
.Cm to Ar new-set
|
2002-10-28 07:03:56 +00:00
|
|
|
.Ed
|
2002-08-16 10:31:47 +00:00
|
|
|
.Pp
|
|
|
|
Also, you can atomically swap two rulesets with the command
|
2002-10-28 07:03:56 +00:00
|
|
|
.Bd -ragged -offset indent
|
2002-08-16 10:31:47 +00:00
|
|
|
.Nm
|
|
|
|
.Cm set swap Ar first-set second-set
|
2002-10-28 07:03:56 +00:00
|
|
|
.Ed
|
2002-08-16 10:31:47 +00:00
|
|
|
.Pp
|
|
|
|
See the
|
|
|
|
.Sx EXAMPLES
|
|
|
|
Section on some possible uses of sets of rules.
|
2002-08-10 15:04:40 +00:00
|
|
|
.Sh STATEFUL FIREWALL
|
2002-08-16 10:31:47 +00:00
|
|
|
Stateful operation is a way for the firewall to dynamically
|
|
|
|
create rules for specific flows when packets that
|
2004-07-02 21:45:06 +00:00
|
|
|
match a given pattern are detected.
|
|
|
|
Support for stateful
|
2002-08-16 10:31:47 +00:00
|
|
|
operation comes through the
|
|
|
|
.Cm check-state , keep-state
|
|
|
|
and
|
|
|
|
.Cm limit
|
|
|
|
options of
|
2005-12-13 17:07:52 +00:00
|
|
|
.Nm rules .
|
2002-08-16 10:31:47 +00:00
|
|
|
.Pp
|
|
|
|
Dynamic rules are created when a packet matches a
|
|
|
|
.Cm keep-state
|
|
|
|
or
|
|
|
|
.Cm limit
|
|
|
|
rule, causing the creation of a
|
|
|
|
.Em dynamic
|
|
|
|
rule which will match all and only packets with
|
|
|
|
a given
|
|
|
|
.Em protocol
|
|
|
|
between a
|
|
|
|
.Em src-ip/src-port dst-ip/dst-port
|
2005-01-15 11:21:24 +00:00
|
|
|
pair of addresses
|
|
|
|
.Em ( src
|
2002-08-16 10:31:47 +00:00
|
|
|
and
|
|
|
|
.Em dst
|
|
|
|
are used here only to denote the initial match addresses, but they
|
|
|
|
are completely equivalent afterwards).
|
2016-07-19 04:56:59 +00:00
|
|
|
Rules created by
|
|
|
|
.Cm keep-state
|
|
|
|
option also have a
|
|
|
|
.Ar flowname
|
|
|
|
taken from it.
|
|
|
|
This name is used in matching together with addresses, ports and protocol.
|
2002-08-16 10:31:47 +00:00
|
|
|
Dynamic rules will be checked at the first
|
|
|
|
.Cm check-state, keep-state
|
|
|
|
or
|
|
|
|
.Cm limit
|
|
|
|
occurrence, and the action performed upon a match will be the same
|
|
|
|
as in the parent rule.
|
|
|
|
.Pp
|
|
|
|
Note that no additional attributes other than protocol and IP addresses
|
2016-07-19 04:56:59 +00:00
|
|
|
and ports and flowname are checked on dynamic rules.
|
2002-08-16 10:31:47 +00:00
|
|
|
.Pp
|
|
|
|
The typical use of dynamic rules is to keep a closed firewall configuration,
|
|
|
|
but let the first TCP SYN packet from the inside network install a
|
|
|
|
dynamic rule for the flow so that packets belonging to that session
|
|
|
|
will be allowed through the firewall:
|
|
|
|
.Pp
|
2016-07-19 04:56:59 +00:00
|
|
|
.Dl "ipfw add check-state OUTBOUND"
|
|
|
|
.Dl "ipfw add allow tcp from my-subnet to any setup keep-state OUTBOUND"
|
2002-08-16 10:31:47 +00:00
|
|
|
.Dl "ipfw add deny tcp from any to any"
|
|
|
|
.Pp
|
|
|
|
A similar approach can be used for UDP, where an UDP packet coming
|
|
|
|
from the inside will install a dynamic rule to let the response through
|
|
|
|
the firewall:
|
|
|
|
.Pp
|
2016-07-19 04:56:59 +00:00
|
|
|
.Dl "ipfw add check-state OUTBOUND"
|
|
|
|
.Dl "ipfw add allow udp from my-subnet to any keep-state OUTBOUND"
|
2002-08-16 10:31:47 +00:00
|
|
|
.Dl "ipfw add deny udp from any to any"
|
|
|
|
.Pp
|
|
|
|
Dynamic rules expire after some time, which depends on the status
|
|
|
|
of the flow and the setting of some
|
|
|
|
.Cm sysctl
|
|
|
|
variables.
|
|
|
|
See Section
|
|
|
|
.Sx SYSCTL VARIABLES
|
|
|
|
for more details.
|
|
|
|
For TCP sessions, dynamic rules can be instructed to periodically
|
|
|
|
send keepalive packets to refresh the state of the rule when it is
|
|
|
|
about to expire.
|
|
|
|
.Pp
|
|
|
|
See Section
|
|
|
|
.Sx EXAMPLES
|
|
|
|
for more examples on how to use dynamic rules.
|
2002-10-28 07:03:56 +00:00
|
|
|
.Sh TRAFFIC SHAPER (DUMMYNET) CONFIGURATION
|
2000-02-28 15:21:12 +00:00
|
|
|
.Nm
|
2002-08-16 10:31:47 +00:00
|
|
|
is also the user interface for the
|
2007-11-26 00:36:40 +00:00
|
|
|
.Nm dummynet
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
traffic shaper, packet scheduler and network emulator, a subsystem that
|
2009-04-08 15:18:21 +00:00
|
|
|
can artificially queue, delay or drop packets
|
2010-03-05 14:13:58 +00:00
|
|
|
emulating the behaviour of certain network links
|
2009-04-08 15:18:21 +00:00
|
|
|
or queueing systems.
|
2000-06-08 13:38:57 +00:00
|
|
|
.Pp
|
2002-10-28 07:03:56 +00:00
|
|
|
.Nm dummynet
|
2009-04-08 15:18:21 +00:00
|
|
|
operates by first using the firewall to select packets
|
2002-10-28 07:03:56 +00:00
|
|
|
using any match pattern that can be used in
|
|
|
|
.Nm
|
|
|
|
rules.
|
2009-04-08 15:18:21 +00:00
|
|
|
Matching packets are then passed to either of two
|
|
|
|
different objects, which implement the traffic regulation:
|
|
|
|
.Bl -hang -offset XXXX
|
|
|
|
.It Em pipe
|
2010-03-05 14:13:58 +00:00
|
|
|
A
|
|
|
|
.Em pipe
|
|
|
|
emulates a
|
|
|
|
.Em link
|
|
|
|
with given bandwidth and propagation delay,
|
|
|
|
driven by a FIFO scheduler and a single queue with programmable
|
2009-04-08 15:18:21 +00:00
|
|
|
queue size and packet loss rate.
|
2010-03-05 14:13:58 +00:00
|
|
|
Packets are appended to the queue as they come out from
|
|
|
|
.Nm ipfw ,
|
|
|
|
and then transferred in FIFO order to the link at the desired rate.
|
2009-04-08 15:18:21 +00:00
|
|
|
.It Em queue
|
2010-03-05 14:13:58 +00:00
|
|
|
A
|
|
|
|
.Em queue
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
is an abstraction used to implement packet scheduling
|
|
|
|
using one of several packet scheduling algorithms.
|
2010-03-05 14:13:58 +00:00
|
|
|
Packets sent to a
|
|
|
|
.Em queue
|
|
|
|
are first grouped into flows according to a mask on the 5-tuple.
|
|
|
|
Flows are then passed to the scheduler associated to the
|
|
|
|
.Em queue ,
|
|
|
|
and each flow uses scheduling parameters (weight and others)
|
|
|
|
as configured in the
|
|
|
|
.Em queue
|
|
|
|
itself.
|
|
|
|
A scheduler in turn is connected to an emulated link,
|
|
|
|
and arbitrates the link's bandwidth among backlogged flows according to
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
weights and to the features of the scheduling algorithm in use.
|
2009-04-08 15:18:21 +00:00
|
|
|
.El
|
|
|
|
.Pp
|
|
|
|
In practice,
|
|
|
|
.Em pipes
|
|
|
|
can be used to set hard limits to the bandwidth that a flow can use, whereas
|
|
|
|
.Em queues
|
|
|
|
can be used to determine how different flows share the available bandwidth.
|
2002-10-28 07:03:56 +00:00
|
|
|
.Pp
|
2010-03-05 14:13:58 +00:00
|
|
|
A graphical representation of the binding of queues,
|
|
|
|
flows, schedulers and links is below.
|
|
|
|
.Bd -literal -offset indent
|
|
|
|
(flow_mask|sched_mask) sched_mask
|
|
|
|
+---------+ weight Wx +-------------+
|
|
|
|
| |->-[flow]-->--| |-+
|
|
|
|
-->--| QUEUE x | ... | | |
|
|
|
|
| |->-[flow]-->--| SCHEDuler N | |
|
|
|
|
+---------+ | | |
|
|
|
|
... | +--[LINK N]-->--
|
|
|
|
+---------+ weight Wy | | +--[LINK N]-->--
|
|
|
|
| |->-[flow]-->--| | |
|
|
|
|
-->--| QUEUE y | ... | | |
|
|
|
|
| |->-[flow]-->--| | |
|
|
|
|
+---------+ +-------------+ |
|
|
|
|
+-------------+
|
|
|
|
.Ed
|
|
|
|
It is important to understand the role of the SCHED_MASK
|
|
|
|
and FLOW_MASK, which are configured through the commands
|
|
|
|
.Dl "ipfw sched N config mask SCHED_MASK ..."
|
|
|
|
and
|
|
|
|
.Dl "ipfw queue X config mask FLOW_MASK ..." .
|
|
|
|
.Pp
|
|
|
|
The SCHED_MASK is used to assign flows to one or more
|
|
|
|
scheduler instances, one for each
|
2010-08-16 15:18:30 +00:00
|
|
|
value of the packet's 5-tuple after applying SCHED_MASK.
|
2010-03-05 14:13:58 +00:00
|
|
|
As an example, using ``src-ip 0xffffff00'' creates one instance
|
|
|
|
for each /24 destination subnet.
|
|
|
|
.Pp
|
|
|
|
The FLOW_MASK, together with the SCHED_MASK, is used to split
|
2012-09-18 02:33:23 +00:00
|
|
|
packets into flows.
|
|
|
|
As an example, using
|
2010-03-05 14:13:58 +00:00
|
|
|
``src-ip 0x000000ff''
|
|
|
|
together with the previous SCHED_MASK makes a flow for
|
2012-09-18 02:33:23 +00:00
|
|
|
each individual source address.
|
|
|
|
In turn, flows for each /24
|
2010-03-05 14:13:58 +00:00
|
|
|
subnet will be sent to the same scheduler instance.
|
|
|
|
.Pp
|
|
|
|
The above diagram holds even for the
|
|
|
|
.Em pipe
|
|
|
|
case, with the only restriction that a
|
|
|
|
.Em pipe
|
|
|
|
only supports a SCHED_MASK, and forces the use of a FIFO
|
|
|
|
scheduler (these are for backward compatibility reasons;
|
|
|
|
in fact, internally, a
|
|
|
|
.Nm dummynet's
|
|
|
|
pipe is implemented exactly as above).
|
|
|
|
.Pp
|
2007-11-26 00:36:40 +00:00
|
|
|
There are two modes of
|
|
|
|
.Nm dummynet
|
|
|
|
operation:
|
|
|
|
.Dq normal
|
|
|
|
and
|
|
|
|
.Dq fast .
|
|
|
|
The
|
|
|
|
.Dq normal
|
|
|
|
mode tries to emulate a real link: the
|
|
|
|
.Nm dummynet
|
|
|
|
scheduler ensures that the packet will not leave the pipe faster than it
|
|
|
|
would on the real link with a given bandwidth.
|
|
|
|
The
|
|
|
|
.Dq fast
|
|
|
|
mode allows certain packets to bypass the
|
|
|
|
.Nm dummynet
|
|
|
|
scheduler (if packet flow does not exceed pipe's bandwidth).
|
|
|
|
This is the reason why the
|
|
|
|
.Dq fast
|
|
|
|
mode requires less CPU cycles per packet (on average) and packet latency
|
|
|
|
can be significantly lower in comparison to a real link with the same
|
|
|
|
bandwidth.
|
|
|
|
The default mode is
|
|
|
|
.Dq normal .
|
|
|
|
The
|
|
|
|
.Dq fast
|
|
|
|
mode can be enabled by setting the
|
|
|
|
.Va net.inet.ip.dummynet.io_fast
|
|
|
|
.Xr sysctl 8
|
|
|
|
variable to a non-zero value.
|
2007-11-17 21:54:57 +00:00
|
|
|
.Pp
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.Ss PIPE, QUEUE AND SCHEDULER CONFIGURATION
|
2000-01-08 11:19:19 +00:00
|
|
|
The
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.Em pipe ,
|
2002-10-28 07:03:56 +00:00
|
|
|
.Em queue
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
and
|
|
|
|
.Em scheduler
|
2002-10-28 07:03:56 +00:00
|
|
|
configuration commands are the following:
|
2002-08-10 15:04:40 +00:00
|
|
|
.Bd -ragged -offset indent
|
|
|
|
.Cm pipe Ar number Cm config Ar pipe-configuration
|
2000-01-08 11:19:19 +00:00
|
|
|
.Pp
|
2002-08-10 15:04:40 +00:00
|
|
|
.Cm queue Ar number Cm config Ar queue-configuration
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.Pp
|
|
|
|
.Cm sched Ar number Cm config Ar sched-configuration
|
2000-06-08 13:38:57 +00:00
|
|
|
.Ed
|
2000-06-12 09:43:00 +00:00
|
|
|
.Pp
|
2000-01-08 11:19:19 +00:00
|
|
|
The following parameters can be configured for a pipe:
|
2002-08-10 15:04:40 +00:00
|
|
|
.Pp
|
|
|
|
.Bl -tag -width indent -compact
|
2000-06-12 09:43:00 +00:00
|
|
|
.It Cm bw Ar bandwidth | device
|
2000-01-08 11:19:19 +00:00
|
|
|
Bandwidth, measured in
|
2000-02-28 15:21:12 +00:00
|
|
|
.Sm off
|
2001-10-01 14:13:36 +00:00
|
|
|
.Op Cm K | M
|
|
|
|
.Brq Cm bit/s | Byte/s .
|
2000-02-28 15:21:12 +00:00
|
|
|
.Sm on
|
|
|
|
.Pp
|
2000-01-08 11:19:19 +00:00
|
|
|
A value of 0 (default) means unlimited bandwidth.
|
2002-10-28 07:03:56 +00:00
|
|
|
The unit must immediately follow the number, as in
|
2000-06-12 09:43:00 +00:00
|
|
|
.Pp
|
2002-08-10 15:04:40 +00:00
|
|
|
.Dl "ipfw pipe 1 config bw 300Kbit/s"
|
2000-06-12 09:43:00 +00:00
|
|
|
.Pp
|
2002-10-28 07:03:56 +00:00
|
|
|
If a device name is specified instead of a numeric value, as in
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw pipe 1 config bw tun0"
|
|
|
|
.Pp
|
|
|
|
then the transmit clock is supplied by the specified device.
|
2000-06-12 09:43:00 +00:00
|
|
|
At the moment only the
|
|
|
|
.Xr tun 4
|
|
|
|
device supports this
|
|
|
|
functionality, for use in conjunction with
|
|
|
|
.Xr ppp 8 .
|
2002-08-10 15:04:40 +00:00
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
.It Cm delay Ar ms-delay
|
|
|
|
Propagation delay, measured in milliseconds.
|
|
|
|
The value is rounded to the next multiple of the clock tick
|
|
|
|
(typically 10ms, but it is a good practice to run kernels
|
|
|
|
with
|
|
|
|
.Dq "options HZ=1000"
|
|
|
|
to reduce
|
|
|
|
the granularity to 1ms or less).
|
2009-06-26 05:09:00 +00:00
|
|
|
The default value is 0, meaning no delay.
|
2009-04-09 12:46:00 +00:00
|
|
|
.Pp
|
2009-06-24 22:57:07 +00:00
|
|
|
.It Cm burst Ar size
|
2009-06-26 19:49:06 +00:00
|
|
|
If the data to be sent exceeds the pipe's bandwidth limit
|
|
|
|
(and the pipe was previously idle), up to
|
2009-06-24 22:57:07 +00:00
|
|
|
.Ar size
|
2009-06-26 19:49:06 +00:00
|
|
|
bytes of data are allowed to bypass the
|
2009-06-24 22:57:07 +00:00
|
|
|
.Nm dummynet
|
2009-06-26 19:49:06 +00:00
|
|
|
scheduler, and will be sent as fast as the physical link allows.
|
|
|
|
Any additional data will be transmitted at the rate specified
|
|
|
|
by the
|
|
|
|
.Nm pipe
|
|
|
|
bandwidth.
|
|
|
|
The burst size depends on how long the pipe has been idle;
|
|
|
|
the effective burst size is calculated as follows:
|
2009-06-24 22:57:07 +00:00
|
|
|
MAX(
|
|
|
|
.Ar size
|
|
|
|
,
|
|
|
|
.Nm bw
|
|
|
|
* pipe_idle_time).
|
|
|
|
.Pp
|
2009-04-09 12:46:00 +00:00
|
|
|
.It Cm profile Ar filename
|
|
|
|
A file specifying the additional overhead incurred in the transmission
|
|
|
|
of a packet on the link.
|
|
|
|
.Pp
|
|
|
|
Some link types introduce extra delays in the transmission
|
2012-09-18 02:33:23 +00:00
|
|
|
of a packet, e.g., because of MAC level framing, contention on
|
2009-04-09 12:46:00 +00:00
|
|
|
the use of the channel, MAC level retransmissions and so on.
|
|
|
|
From our point of view, the channel is effectively unavailable
|
|
|
|
for this extra time, which is constant or variable depending
|
2012-09-18 02:33:23 +00:00
|
|
|
on the link type.
|
|
|
|
Additionally, packets may be dropped after this
|
|
|
|
time (e.g., on a wireless link after too many retransmissions).
|
2009-04-09 12:46:00 +00:00
|
|
|
We can model the additional delay with an empirical curve
|
|
|
|
that represents its distribution.
|
|
|
|
.Bd -literal -offset indent
|
|
|
|
cumulative probability
|
|
|
|
1.0 ^
|
|
|
|
|
|
|
|
|
L +-- loss-level x
|
|
|
|
| ******
|
|
|
|
| *
|
|
|
|
| *****
|
|
|
|
| *
|
|
|
|
| **
|
|
|
|
| *
|
|
|
|
+-------*------------------->
|
|
|
|
delay
|
|
|
|
.Ed
|
|
|
|
The empirical curve may have both vertical and horizontal lines.
|
|
|
|
Vertical lines represent constant delay for a range of
|
|
|
|
probabilities.
|
2009-06-08 14:32:29 +00:00
|
|
|
Horizontal lines correspond to a discontinuity in the delay
|
2009-04-09 12:46:00 +00:00
|
|
|
distribution: the pipe will use the largest delay for a
|
|
|
|
given probability.
|
|
|
|
.Pp
|
|
|
|
The file format is the following, with whitespace acting as
|
|
|
|
a separator and '#' indicating the beginning a comment:
|
|
|
|
.Bl -tag -width indent
|
2009-06-08 14:32:29 +00:00
|
|
|
.It Cm name Ar identifier
|
|
|
|
optional name (listed by "ipfw pipe show")
|
|
|
|
to identify the delay distribution;
|
|
|
|
.It Cm bw Ar value
|
|
|
|
the bandwidth used for the pipe.
|
|
|
|
If not specified here, it must be present
|
|
|
|
explicitly as a configuration parameter for the pipe;
|
2009-04-09 12:46:00 +00:00
|
|
|
.It Cm loss-level Ar L
|
2009-06-08 14:32:29 +00:00
|
|
|
the probability above which packets are lost.
|
2012-09-18 02:33:23 +00:00
|
|
|
(0.0 <= L <= 1.0, default 1.0 i.e., no loss);
|
2009-06-08 14:32:29 +00:00
|
|
|
.It Cm samples Ar N
|
|
|
|
the number of samples used in the internal
|
|
|
|
representation of the curve (2..1024; default 100);
|
2009-04-09 12:46:00 +00:00
|
|
|
.It Cm "delay prob" | "prob delay"
|
|
|
|
One of these two lines is mandatory and defines
|
|
|
|
the format of the following lines with data points.
|
|
|
|
.It Ar XXX Ar YYY
|
|
|
|
2 or more lines representing points in the curve,
|
|
|
|
with either delay or probability first, according
|
|
|
|
to the chosen format.
|
|
|
|
The unit for delay is milliseconds.
|
2009-06-08 14:32:29 +00:00
|
|
|
Data points do not need to be sorted.
|
2010-08-16 15:18:30 +00:00
|
|
|
Also, the number of actual lines can be different
|
2009-06-08 14:32:29 +00:00
|
|
|
from the value of the "samples" parameter:
|
2009-04-11 08:52:02 +00:00
|
|
|
.Nm
|
|
|
|
utility will sort and interpolate
|
2009-04-09 12:46:00 +00:00
|
|
|
the curve as needed.
|
|
|
|
.El
|
|
|
|
.Pp
|
|
|
|
Example of a profile file:
|
|
|
|
.Bd -literal -offset indent
|
|
|
|
name bla_bla_bla
|
|
|
|
samples 100
|
|
|
|
loss-level 0.86
|
|
|
|
prob delay
|
|
|
|
0 200 # minimum overhead is 200ms
|
|
|
|
0.5 200
|
|
|
|
0.5 300
|
|
|
|
0.8 1000
|
|
|
|
0.9 1300
|
|
|
|
1 1300
|
|
|
|
#configuration file end
|
|
|
|
.Ed
|
2002-08-10 15:04:40 +00:00
|
|
|
.El
|
|
|
|
.Pp
|
|
|
|
The following parameters can be configured for a queue:
|
|
|
|
.Pp
|
|
|
|
.Bl -tag -width indent -compact
|
|
|
|
.It Cm pipe Ar pipe_nr
|
|
|
|
Connects a queue to the specified pipe.
|
2002-10-28 07:03:56 +00:00
|
|
|
Multiple queues (with the same or different weights) can be connected to
|
|
|
|
the same pipe, which specifies the aggregate rate for the set of queues.
|
2002-08-10 15:04:40 +00:00
|
|
|
.Pp
|
|
|
|
.It Cm weight Ar weight
|
|
|
|
Specifies the weight to be used for flows matching this queue.
|
|
|
|
The weight must be in the range 1..100, and defaults to 1.
|
|
|
|
.El
|
|
|
|
.Pp
|
2012-07-03 08:42:48 +00:00
|
|
|
The following case-insensitive parameters can be configured for a
|
|
|
|
scheduler:
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.Pp
|
|
|
|
.Bl -tag -width indent -compact
|
2012-07-03 08:42:48 +00:00
|
|
|
.It Cm type Ar {fifo | wf2q+ | rr | qfq}
|
2010-03-05 14:13:58 +00:00
|
|
|
specifies the scheduling algorithm to use.
|
|
|
|
.Bl -tag -width indent -compact
|
2012-07-03 08:42:48 +00:00
|
|
|
.It Cm fifo
|
2010-03-05 14:13:58 +00:00
|
|
|
is just a FIFO scheduler (which means that all packets
|
|
|
|
are stored in the same queue as they arrive to the scheduler).
|
|
|
|
FIFO has O(1) per-packet time complexity, with very low
|
2012-02-28 13:19:34 +00:00
|
|
|
constants (estimate 60-80ns on a 2GHz desktop machine)
|
2010-03-05 14:13:58 +00:00
|
|
|
but gives no service guarantees.
|
2012-07-03 08:42:48 +00:00
|
|
|
.It Cm wf2q+
|
2010-03-05 14:13:58 +00:00
|
|
|
implements the WF2Q+ algorithm, which is a Weighted Fair Queueing
|
|
|
|
algorithm which permits flows to share bandwidth according to
|
2012-09-18 02:33:23 +00:00
|
|
|
their weights.
|
|
|
|
Note that weights are not priorities; even a flow
|
2010-03-05 14:13:58 +00:00
|
|
|
with a minuscule weight will never starve.
|
|
|
|
WF2Q+ has O(log N) per-packet processing cost, where N is the number
|
|
|
|
of flows, and is the default algorithm used by previous versions
|
|
|
|
dummynet's queues.
|
|
|
|
.It Cm rr
|
|
|
|
implements the Deficit Round Robin algorithm, which has O(1) processing
|
|
|
|
costs (roughly, 100-150ns per packet)
|
|
|
|
and permits bandwidth allocation according to weights, but
|
|
|
|
with poor service guarantees.
|
|
|
|
.It Cm qfq
|
|
|
|
implements the QFQ algorithm, which is a very fast variant of
|
|
|
|
WF2Q+, with similar service guarantees and O(1) processing
|
|
|
|
costs (roughly, 200-250ns per packet).
|
|
|
|
.El
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.El
|
|
|
|
.Pp
|
2010-03-05 14:13:58 +00:00
|
|
|
In addition to the type, all parameters allowed for a pipe can also
|
|
|
|
be specified for a scheduler.
|
Bring in the most recent version of ipfw and dummynet, developed
and tested over the past two months in the ipfw3-head branch. This
also happens to be the same code available in the Linux and Windows
ports of ipfw and dummynet.
The major enhancement is a completely restructured version of
dummynet, with support for different packet scheduling algorithms
(loadable at runtime), faster queue/pipe lookup, and a much cleaner
internal architecture and kernel/userland ABI which simplifies
future extensions.
In addition to the existing schedulers (FIFO and WF2Q+), we include
a Deficit Round Robin (DRR or RR for brevity) scheduler, and a new,
very fast version of WF2Q+ called QFQ.
Some test code is also present (in sys/netinet/ipfw/test) that
lets you build and test schedulers in userland.
Also, we have added a compatibility layer that understands requests
from the RELENG_7 and RELENG_8 versions of the /sbin/ipfw binaries,
and replies correctly (at least, it does its best; sometimes you
just cannot tell who sent the request and how to answer).
The compatibility layer should make it possible to MFC this code in a
relatively short time.
Some minor glitches (e.g. handling of ipfw set enable/disable,
and a workaround for a bug in RELENG_7's /sbin/ipfw) will be
fixed with separate commits.
CREDITS:
This work has been partly supported by the ONELAB2 project, and
mostly developed by Riccardo Panicucci and myself.
The code for the qfq scheduler is mostly from Fabio Checconi,
and Marta Carbone and Francesco Magno have helped with testing,
debugging and some bug fixes.
2010-03-02 17:40:48 +00:00
|
|
|
.Pp
|
2002-08-10 15:04:40 +00:00
|
|
|
Finally, the following parameters can be configured for both
|
|
|
|
pipes and queues:
|
|
|
|
.Pp
|
2002-10-28 07:03:56 +00:00
|
|
|
.Bl -tag -width XXXX -compact
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm buckets Ar hash-table-size
|
|
|
|
Specifies the size of the hash table used for storing the
|
|
|
|
various queues.
|
|
|
|
Default value is 64 controlled by the
|
|
|
|
.Xr sysctl 8
|
|
|
|
variable
|
2007-11-26 00:36:40 +00:00
|
|
|
.Va net.inet.ip.dummynet.hash_size ,
|
2002-10-12 07:45:23 +00:00
|
|
|
allowed range is 16 to 65536.
|
2002-08-10 15:04:40 +00:00
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
.It Cm mask Ar mask-specifier
|
2002-10-28 07:03:56 +00:00
|
|
|
Packets sent to a given pipe or queue by an
|
|
|
|
.Nm
|
|
|
|
rule can be further classified into multiple flows, each of which is then
|
|
|
|
sent to a different
|
|
|
|
.Em dynamic
|
|
|
|
pipe or queue.
|
2000-02-28 15:21:12 +00:00
|
|
|
A flow identifier is constructed by masking the IP addresses,
|
2002-10-28 07:03:56 +00:00
|
|
|
ports and protocol types as specified with the
|
|
|
|
.Cm mask
|
|
|
|
options in the configuration of the pipe or queue.
|
|
|
|
For each different flow identifier, a new pipe or queue is created
|
|
|
|
with the same parameters as the original object, and matching packets
|
|
|
|
are sent to it.
|
|
|
|
.Pp
|
|
|
|
Thus, when
|
|
|
|
.Em dynamic pipes
|
|
|
|
are used, each flow will get the same bandwidth as defined by the pipe,
|
|
|
|
whereas when
|
|
|
|
.Em dynamic queues
|
|
|
|
are used, each flow will share the parent's pipe bandwidth evenly
|
|
|
|
with other flows generated by the same queue (note that other queues
|
|
|
|
with different weights might be connected to the same pipe).
|
|
|
|
.br
|
|
|
|
Available mask specifiers are a combination of one or more of the following:
|
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm dst-ip Ar mask ,
|
2005-04-18 18:35:05 +00:00
|
|
|
.Cm dst-ip6 Ar mask ,
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm src-ip Ar mask ,
|
2005-04-18 18:35:05 +00:00
|
|
|
.Cm src-ip6 Ar mask ,
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm dst-port Ar mask ,
|
|
|
|
.Cm src-port Ar mask ,
|
2005-04-18 18:35:05 +00:00
|
|
|
.Cm flow-id Ar mask ,
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm proto Ar mask
|
|
|
|
or
|
|
|
|
.Cm all ,
|
2002-10-28 07:03:56 +00:00
|
|
|
.Pp
|
2000-01-08 11:19:19 +00:00
|
|
|
where the latter means all bits in all fields are significant.
|
2002-08-10 15:04:40 +00:00
|
|
|
.Pp
|
2002-08-16 10:31:47 +00:00
|
|
|
.It Cm noerror
|
2007-11-26 00:36:40 +00:00
|
|
|
When a packet is dropped by a
|
|
|
|
.Nm dummynet
|
|
|
|
queue or pipe, the error
|
2002-08-16 10:31:47 +00:00
|
|
|
is normally reported to the caller routine in the kernel, in the
|
2004-07-02 21:45:06 +00:00
|
|
|
same way as it happens when a device queue fills up.
|
|
|
|
Setting this
|
2002-08-16 10:31:47 +00:00
|
|
|
option reports the packet as successfully delivered, which can be
|
|
|
|
needed for some experimental setups where you want to simulate
|
|
|
|
loss or congestion at a remote router.
|
|
|
|
.Pp
|
2002-08-10 15:04:40 +00:00
|
|
|
.It Cm plr Ar packet-loss-rate
|
|
|
|
Packet loss rate.
|
|
|
|
Argument
|
|
|
|
.Ar packet-loss-rate
|
|
|
|
is a floating-point number between 0 and 1, with 0 meaning no
|
|
|
|
loss, 1 meaning 100% loss.
|
|
|
|
The loss rate is internally represented on 31 bits.
|
|
|
|
.Pp
|
2002-08-16 10:31:47 +00:00
|
|
|
.It Cm queue Brq Ar slots | size Ns Cm Kbytes
|
|
|
|
Queue size, in
|
|
|
|
.Ar slots
|
|
|
|
or
|
|
|
|
.Cm KBytes .
|
|
|
|
Default value is 50 slots, which
|
|
|
|
is the typical queue size for Ethernet devices.
|
|
|
|
Note that for slow speed links you should keep the queue
|
|
|
|
size short or your traffic might be affected by a significant
|
|
|
|
queueing delay.
|
|
|
|
E.g., 50 max-sized ethernet packets (1500 bytes) mean 600Kbit
|
|
|
|
or 20s of queue on a 30Kbit/s pipe.
|
2004-01-23 06:37:19 +00:00
|
|
|
Even worse effects can result if you get packets from an
|
2004-07-02 21:45:06 +00:00
|
|
|
interface with a much larger MTU, e.g.\& the loopback interface
|
2002-08-16 10:31:47 +00:00
|
|
|
with its 16KB packets.
|
2008-02-27 13:52:33 +00:00
|
|
|
The
|
|
|
|
.Xr sysctl 8
|
|
|
|
variables
|
|
|
|
.Em net.inet.ip.dummynet.pipe_byte_limit
|
|
|
|
and
|
|
|
|
.Em net.inet.ip.dummynet.pipe_slot_limit
|
|
|
|
control the maximum lengths that can be specified.
|
2002-08-16 10:31:47 +00:00
|
|
|
.Pp
|
2001-10-01 14:13:36 +00:00
|
|
|
.It Cm red | gred Ar w_q Ns / Ns Ar min_th Ns / Ns Ar max_th Ns / Ns Ar max_p
|
2014-06-01 07:28:24 +00:00
|
|
|
[ecn]
|
2001-12-14 21:51:28 +00:00
|
|
|
Make use of the RED (Random Early Detection) queue management algorithm.
|
2000-06-12 09:43:00 +00:00
|
|
|
.Ar w_q
|
|
|
|
and
|
|
|
|
.Ar max_p
|
|
|
|
are floating
|
2014-06-01 07:28:24 +00:00
|
|
|
point numbers between 0 and 1 (inclusive), while
|
2000-06-12 09:43:00 +00:00
|
|
|
.Ar min_th
|
|
|
|
and
|
|
|
|
.Ar max_th
|
|
|
|
are integer numbers specifying thresholds for queue management
|
|
|
|
(thresholds are computed in bytes if the queue has been defined
|
|
|
|
in bytes, in slots otherwise).
|
2014-06-01 07:28:24 +00:00
|
|
|
The two parameters can also be of the same value if needed. The
|
2007-11-26 00:36:40 +00:00
|
|
|
.Nm dummynet
|
2014-06-01 07:28:24 +00:00
|
|
|
also supports the gentle RED variant (gred) and ECN (Explicit Congestion
|
|
|
|
Notification) as optional. Three
|
2000-06-12 09:43:00 +00:00
|
|
|
.Xr sysctl 8
|
|
|
|
variables can be used to control the RED behaviour:
|
|
|
|
.Bl -tag -width indent
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.dummynet.red_lookup_depth
|
2000-06-08 13:38:57 +00:00
|
|
|
specifies the accuracy in computing the average queue
|
2000-06-12 09:43:00 +00:00
|
|
|
when the link is idle (defaults to 256, must be greater than zero)
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.dummynet.red_avg_pkt_size
|
2000-06-12 09:43:00 +00:00
|
|
|
specifies the expected average packet size (defaults to 512, must be
|
|
|
|
greater than zero)
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.dummynet.red_max_pkt_size
|
2000-06-12 09:43:00 +00:00
|
|
|
specifies the expected maximum packet size, only used when queue
|
|
|
|
thresholds are in bytes (defaults to 1500, must be greater than zero).
|
|
|
|
.El
|
1996-02-24 13:39:46 +00:00
|
|
|
.El
|
2005-04-18 18:35:05 +00:00
|
|
|
.Pp
|
2007-11-26 00:36:40 +00:00
|
|
|
When used with IPv6 data,
|
|
|
|
.Nm dummynet
|
|
|
|
currently has several limitations.
|
2007-08-04 20:35:42 +00:00
|
|
|
Information necessary to route link-local packets to an
|
2007-11-26 00:36:40 +00:00
|
|
|
interface is not available after processing by
|
|
|
|
.Nm dummynet
|
|
|
|
so those packets are dropped in the output path.
|
2010-08-28 16:32:01 +00:00
|
|
|
Care should be taken to ensure that link-local packets are not passed to
|
2007-11-26 00:36:40 +00:00
|
|
|
.Nm dummynet .
|
1996-02-24 13:39:46 +00:00
|
|
|
.Sh CHECKLIST
|
|
|
|
Here are some important points to consider when designing your
|
|
|
|
rules:
|
2000-02-28 15:21:12 +00:00
|
|
|
.Bl -bullet
|
|
|
|
.It
|
|
|
|
Remember that you filter both packets going
|
|
|
|
.Cm in
|
|
|
|
and
|
|
|
|
.Cm out .
|
1996-06-15 01:38:51 +00:00
|
|
|
Most connections need packets going in both directions.
|
1996-02-24 13:39:46 +00:00
|
|
|
.It
|
|
|
|
Remember to test very carefully.
|
1996-06-15 01:38:51 +00:00
|
|
|
It is a good idea to be near the console when doing this.
|
2001-06-06 20:56:56 +00:00
|
|
|
If you cannot be near the console,
|
|
|
|
use an auto-recovery script such as the one in
|
|
|
|
.Pa /usr/share/examples/ipfw/change_rules.sh .
|
1996-02-24 13:39:46 +00:00
|
|
|
.It
|
2005-02-13 22:25:33 +00:00
|
|
|
Do not forget the loopback interface.
|
1996-02-24 13:39:46 +00:00
|
|
|
.El
|
|
|
|
.Sh FINE POINTS
|
2000-10-30 09:44:20 +00:00
|
|
|
.Bl -bullet
|
|
|
|
.It
|
2002-05-01 06:29:16 +00:00
|
|
|
There are circumstances where fragmented datagrams are unconditionally
|
|
|
|
dropped.
|
|
|
|
TCP packets are dropped if they do not contain at least 20 bytes of
|
|
|
|
TCP header, UDP packets are dropped if they do not contain a full 8
|
|
|
|
byte UDP header, and ICMP packets are dropped if they do not contain
|
|
|
|
4 bytes of ICMP header, enough to specify the ICMP type, code, and
|
|
|
|
checksum.
|
|
|
|
These packets are simply logged as
|
|
|
|
.Dq pullup failed
|
|
|
|
since there may not be enough good data in the packet to produce a
|
|
|
|
meaningful log entry.
|
|
|
|
.It
|
|
|
|
Another type of packet is unconditionally dropped, a TCP packet with a
|
|
|
|
fragment offset of one.
|
2000-02-28 15:21:12 +00:00
|
|
|
This is a valid packet, but it only has one use, to try
|
2001-03-16 07:39:46 +00:00
|
|
|
to circumvent firewalls.
|
|
|
|
When logging is enabled, these packets are
|
2001-03-16 01:28:11 +00:00
|
|
|
reported as being dropped by rule -1.
|
2000-10-30 09:44:20 +00:00
|
|
|
.It
|
2000-02-28 15:21:12 +00:00
|
|
|
If you are logged in over a network, loading the
|
|
|
|
.Xr kld 4
|
|
|
|
version of
|
1996-02-24 13:39:46 +00:00
|
|
|
.Nm
|
|
|
|
is probably not as straightforward as you would think.
|
2009-03-19 10:42:07 +00:00
|
|
|
The following command line is recommended:
|
2000-02-28 15:21:12 +00:00
|
|
|
.Bd -literal -offset indent
|
2003-03-03 22:46:36 +00:00
|
|
|
kldload ipfw && \e
|
2000-02-28 15:21:12 +00:00
|
|
|
ipfw add 32000 allow ip from any to any
|
1996-02-24 13:39:46 +00:00
|
|
|
.Ed
|
1996-12-23 02:03:15 +00:00
|
|
|
.Pp
|
1996-06-15 01:38:51 +00:00
|
|
|
Along the same lines, doing an
|
2000-02-28 15:21:12 +00:00
|
|
|
.Bd -literal -offset indent
|
1996-02-24 13:39:46 +00:00
|
|
|
ipfw flush
|
|
|
|
.Ed
|
1996-12-23 02:03:15 +00:00
|
|
|
.Pp
|
1996-02-24 13:39:46 +00:00
|
|
|
in similar surroundings is also a bad idea.
|
2000-10-30 09:44:20 +00:00
|
|
|
.It
|
2000-02-28 15:21:12 +00:00
|
|
|
The
|
|
|
|
.Nm
|
|
|
|
filter list may not be modified if the system security level
|
1999-04-28 02:49:29 +00:00
|
|
|
is set to 3 or higher
|
2001-08-07 15:48:51 +00:00
|
|
|
(see
|
1998-12-16 17:10:03 +00:00
|
|
|
.Xr init 8
|
2001-08-07 15:48:51 +00:00
|
|
|
for information on system security levels).
|
2000-10-30 09:44:20 +00:00
|
|
|
.El
|
1996-07-10 19:44:30 +00:00
|
|
|
.Sh PACKET DIVERSION
|
2000-02-28 15:21:12 +00:00
|
|
|
A
|
|
|
|
.Xr divert 4
|
|
|
|
socket bound to the specified port will receive all packets
|
|
|
|
diverted to that port.
|
2004-10-22 19:12:01 +00:00
|
|
|
If no socket is bound to the destination port, or if the divert module is
|
2005-02-13 22:25:33 +00:00
|
|
|
not loaded, or if the kernel was not compiled with divert socket support,
|
2004-10-22 19:12:01 +00:00
|
|
|
the packets are dropped.
|
2006-12-29 21:59:17 +00:00
|
|
|
.Sh NETWORK ADDRESS TRANSLATION (NAT)
|
2009-04-08 15:18:21 +00:00
|
|
|
.Nm
|
|
|
|
support in-kernel NAT using the kernel version of
|
|
|
|
.Xr libalias 3 .
|
|
|
|
.Pp
|
2006-12-29 21:59:17 +00:00
|
|
|
The nat configuration command is the following:
|
|
|
|
.Bd -ragged -offset indent
|
|
|
|
.Bk -words
|
2012-03-29 05:02:12 +00:00
|
|
|
.Cm nat
|
|
|
|
.Ar nat_number
|
|
|
|
.Cm config
|
2006-12-29 21:59:17 +00:00
|
|
|
.Ar nat-configuration
|
|
|
|
.Ek
|
|
|
|
.Ed
|
|
|
|
.Pp
|
|
|
|
The following parameters can be configured:
|
|
|
|
.Bl -tag -width indent
|
|
|
|
.It Cm ip Ar ip_address
|
|
|
|
Define an ip address to use for aliasing.
|
|
|
|
.It Cm if Ar nic
|
2009-03-19 10:42:07 +00:00
|
|
|
Use ip address of NIC for aliasing, dynamically changing
|
|
|
|
it if NIC's ip address changes.
|
2006-12-29 21:59:17 +00:00
|
|
|
.It Cm log
|
|
|
|
Enable logging on this nat instance.
|
|
|
|
.It Cm deny_in
|
|
|
|
Deny any incoming connection from outside world.
|
|
|
|
.It Cm same_ports
|
|
|
|
Try to leave the alias port numbers unchanged from
|
|
|
|
the actual local port numbers.
|
|
|
|
.It Cm unreg_only
|
|
|
|
Traffic on the local network not originating from an
|
|
|
|
unregistered address spaces will be ignored.
|
|
|
|
.It Cm reset
|
|
|
|
Reset table of the packet aliasing engine on address change.
|
|
|
|
.It Cm reverse
|
|
|
|
Reverse the way libalias handles aliasing.
|
|
|
|
.It Cm proxy_only
|
|
|
|
Obey transparent proxy rules only, packet aliasing is not performed.
|
2011-06-14 13:35:24 +00:00
|
|
|
.It Cm skip_global
|
|
|
|
Skip instance in case of global state lookup (see below).
|
|
|
|
.El
|
|
|
|
.Pp
|
|
|
|
Some specials value can be supplied instead of
|
|
|
|
.Va nat_number:
|
|
|
|
.Bl -tag -width indent
|
|
|
|
.It Cm global
|
|
|
|
Looks up translation state in all configured nat instances.
|
|
|
|
If an entry is found, packet is aliased according to that entry.
|
|
|
|
If no entry was found in any of the instances, packet is passed unchanged,
|
|
|
|
and no new entry will be created.
|
|
|
|
See section
|
|
|
|
.Sx MULTIPLE INSTANCES
|
|
|
|
in
|
|
|
|
.Xr natd 8
|
|
|
|
for more information.
|
|
|
|
.It Cm tablearg
|
2012-09-18 02:33:23 +00:00
|
|
|
Uses argument supplied in lookup table.
|
|
|
|
See
|
2011-06-14 13:35:24 +00:00
|
|
|
.Sx LOOKUP TABLES
|
|
|
|
section below for more information on lookup tables.
|
2006-12-29 21:59:17 +00:00
|
|
|
.El
|
|
|
|
.Pp
|
|
|
|
To let the packet continue after being (de)aliased, set the sysctl variable
|
2012-03-29 05:02:12 +00:00
|
|
|
.Va net.inet.ip.fw.one_pass
|
2006-12-29 21:59:17 +00:00
|
|
|
to 0.
|
|
|
|
For more information about aliasing modes, refer to
|
2009-03-19 10:42:07 +00:00
|
|
|
.Xr libalias 3 .
|
2006-12-29 21:59:17 +00:00
|
|
|
See Section
|
|
|
|
.Sx EXAMPLES
|
|
|
|
for some examples about nat usage.
|
2009-04-08 15:18:21 +00:00
|
|
|
.Ss REDIRECT AND LSNAT SUPPORT IN IPFW
|
2006-12-29 21:59:17 +00:00
|
|
|
Redirect and LSNAT support follow closely the syntax used in
|
2012-03-29 05:02:12 +00:00
|
|
|
.Xr natd 8 .
|
2006-12-29 21:59:17 +00:00
|
|
|
See Section
|
|
|
|
.Sx EXAMPLES
|
|
|
|
for some examples on how to do redirect and lsnat.
|
2009-04-08 15:18:21 +00:00
|
|
|
.Ss SCTP NAT SUPPORT
|
2009-03-19 10:42:07 +00:00
|
|
|
SCTP nat can be configured in a similar manner to TCP through the
|
|
|
|
.Nm
|
|
|
|
command line tool.
|
2012-03-29 05:02:12 +00:00
|
|
|
The main difference is that
|
|
|
|
.Nm sctp nat
|
2009-03-19 10:42:07 +00:00
|
|
|
does not do port translation.
|
|
|
|
Since the local and global side ports will be the same,
|
|
|
|
there is no need to specify both.
|
|
|
|
Ports are redirected as follows:
|
2009-02-07 18:49:42 +00:00
|
|
|
.Bd -ragged -offset indent
|
|
|
|
.Bk -words
|
2012-03-29 05:02:12 +00:00
|
|
|
.Cm nat
|
|
|
|
.Ar nat_number
|
2009-02-07 18:49:42 +00:00
|
|
|
.Cm config if
|
|
|
|
.Ar nic
|
|
|
|
.Cm redirect_port sctp
|
|
|
|
.Ar ip_address [,addr_list] {[port | port-port] [,ports]}
|
|
|
|
.Ek
|
|
|
|
.Ed
|
|
|
|
.Pp
|
|
|
|
Most
|
2009-03-19 10:42:07 +00:00
|
|
|
.Nm sctp nat
|
2009-02-07 18:49:42 +00:00
|
|
|
configuration can be done in real-time through the
|
2009-03-19 10:42:07 +00:00
|
|
|
.Xr sysctl 8
|
|
|
|
interface.
|
|
|
|
All may be changed dynamically, though the hash_table size will only
|
|
|
|
change for new
|
|
|
|
.Nm nat
|
|
|
|
instances.
|
|
|
|
See
|
2012-03-29 05:02:12 +00:00
|
|
|
.Sx SYSCTL VARIABLES
|
2009-02-07 18:49:42 +00:00
|
|
|
for more info.
|
2016-08-13 16:09:49 +00:00
|
|
|
.Sh IPv6/IPv4 NETWORK ADDRESS AND PROTOCOL TRANSLATION
|
|
|
|
.Nm
|
|
|
|
supports in-kernel IPv6/IPv4 network address and protocol translation.
|
|
|
|
Stateful NAT64 translation allows IPv6-only clients to contact IPv4 servers
|
|
|
|
using unicast TCP, UDP or ICMP protocols.
|
|
|
|
One or more IPv4 addresses assigned to a stateful NAT64 translator are shared
|
|
|
|
among serveral IPv6-only clients.
|
|
|
|
When stateful NAT64 is used in conjunction with DNS64, no changes are usually
|
|
|
|
required in the IPv6 client or the IPv4 server.
|
|
|
|
The kernel module
|
|
|
|
.Cm ipfw_nat64
|
|
|
|
should be loaded or kernel should have
|
|
|
|
.Cm options IPFIREWALL_NAT64
|
|
|
|
to be able use stateful NAT64 translator.
|
|
|
|
.Pp
|
|
|
|
Stateful NAT64 uses a bunch of memory for several types of objects.
|
|
|
|
When IPv6 client initiates connection, NAT64 translator creates a host entry
|
|
|
|
in the states table.
|
|
|
|
Each host entry has a number of ports group entries allocated on demand.
|
|
|
|
Ports group entries contains connection state entries.
|
|
|
|
There are several options to control limits and lifetime for these objects.
|
|
|
|
.Pp
|
|
|
|
NAT64 translator follows RFC7915 when does ICMPv6/ICMP translation,
|
|
|
|
unsupported message types will be silently dropped.
|
|
|
|
IPv6 needs several ICMPv6 message types to be explicitly allowed for correct
|
|
|
|
operation.
|
|
|
|
Make sure that ND6 neighbor solicitation (ICMPv6 type 135) and neighbor
|
|
|
|
advertisement (ICMPv6 type 136) messages will not be handled by translation
|
|
|
|
rules.
|
|
|
|
.Pp
|
|
|
|
After translation NAT64 translator sends packets through corresponding netisr
|
|
|
|
queue.
|
|
|
|
Thus translator host should be configured as IPv4 and IPv6 router.
|
|
|
|
.Pp
|
|
|
|
Currently both stateful and stateless NAT64 translators use Well-Known IPv6
|
|
|
|
Prefix
|
|
|
|
.Ar 64:ff9b::/96
|
|
|
|
to represent IPv4 addresses in the IPv6 address.
|
|
|
|
Thus DNS64 service and routing should be configured to use Well-Known IPv6
|
|
|
|
Prefix.
|
|
|
|
.Pp
|
|
|
|
The stateful NAT64 configuration command is the following:
|
|
|
|
.Bd -ragged -offset indent
|
|
|
|
.Bk -words
|
|
|
|
.Cm nat64lsn
|
|
|
|
.Ar name
|
|
|
|
.Cm create
|
|
|
|
.Ar create-options
|
|
|
|
.Ek
|
|
|
|
.Ed
|
|
|
|
.Pp
|
|
|
|
The following parameters can be configured:
|
|
|
|
.Bl -tag -width indent
|
|
|
|
.It Cm prefix4 Ar ipv4_prefix/mask
|
|
|
|
The IPv4 prefix with mask defines the pool of IPv4 addresses used as
|
|
|
|
source address after translation.
|
|
|
|
Stateful NAT64 module translates IPv6 source address of client to one
|
|
|
|
IPv4 address from this pool.
|
|
|
|
Note that incoming IPv4 packets that don't have corresponding state entry
|
|
|
|
in the states table will be dropped by translator.
|
|
|
|
Make sure that translation rules handle packets, destined to configured prefix.
|
|
|
|
.It Cm max_ports Ar number
|
|
|
|
Maximum number of ports reserved for upper level protocols to one IPv6 client.
|
|
|
|
All reserved ports are divided into chunks between supported protocols.
|
|
|
|
The number of connections from one IPv6 client is limited by this option.
|
|
|
|
Note that closed TCP connections still remain in the list of connections until
|
|
|
|
.Cm tcp_close_age
|
|
|
|
interval will not expire.
|
|
|
|
Default value is
|
|
|
|
.Ar 2048 .
|
|
|
|
.It Cm host_del_age Ar seconds
|
|
|
|
The number of seconds until the host entry for a IPv6 client will be deleted
|
|
|
|
and all its resources will be released due to inactivity.
|
|
|
|
Default value is
|
|
|
|
.Ar 3600 .
|
|
|
|
.It Cm pg_del_age Ar seconds
|
|
|
|
The number of seconds until a ports group with unused state entries will
|
|
|
|
be released.
|
|
|
|
Default value is
|
|
|
|
.Ar 900 .
|
|
|
|
.It Cm tcp_syn_age Ar seconds
|
|
|
|
The number of seconds while a state entry for TCP connection with only SYN
|
|
|
|
sent will be kept.
|
|
|
|
If TCP connection establishing will not be finished,
|
|
|
|
state entry will be deleted.
|
|
|
|
Default value is
|
|
|
|
.Ar 10 .
|
|
|
|
.It Cm tcp_est_age Ar seconds
|
|
|
|
The number of seconds while a state entry for established TCP connection
|
|
|
|
will be kept.
|
|
|
|
Default value is
|
|
|
|
.Ar 7200 .
|
|
|
|
.It Cm tcp_close_age Ar seconds
|
|
|
|
The number of seconds while a state entry for closed TCP connection
|
|
|
|
will be kept.
|
|
|
|
Keeping state entries for closed connections is needed, because IPv4 servers
|
|
|
|
typically keep closed connections in a TIME_WAIT state for a several minutes.
|
|
|
|
Since translator's IPv4 addresses are shared among all IPv6 clients,
|
|
|
|
new connections from the same addresses and ports may be rejected by server,
|
|
|
|
because these connections are still in a TIME_WAIT state.
|
|
|
|
Keeping them in translator's state table protects from such rejects.
|
|
|
|
Default value is
|
|
|
|
.Ar 180 .
|
|
|
|
.It Cm udp_age Ar seconds
|
|
|
|
The number of seconds while translator keeps state entry in a waiting for
|
|
|
|
reply to the sent UDP datagram.
|
|
|
|
Default value is
|
|
|
|
.Ar 120 .
|
|
|
|
.It Cm icmp_age Ar seconds
|
|
|
|
The number of seconds while translator keeps state entry in a waiting for
|
|
|
|
reply to the sent ICMP message.
|
|
|
|
Default value is
|
|
|
|
.Ar 60 .
|
|
|
|
.It Cm log
|
|
|
|
Turn on logging of all handled packets via BPF through
|
|
|
|
.Ar ipfwlog0
|
|
|
|
interface.
|
|
|
|
.Ar ipfwlog0
|
|
|
|
is a pseudo interface and can be created after a boot manually with
|
|
|
|
.Cm ifconfig
|
|
|
|
command.
|
|
|
|
Note that it has different purpose than
|
|
|
|
.Ar ipfw0
|
|
|
|
interface.
|
|
|
|
Translators sends to BPF an additional information with each packet.
|
|
|
|
With
|
|
|
|
.Cm tcpdump
|
|
|
|
you are able to see each handled packet before and after translation.
|
|
|
|
.It Cm -log
|
|
|
|
Turn off logging of all handled packets via BPF.
|
|
|
|
.El
|
|
|
|
.Pp
|
|
|
|
To inspect a states table of stateful NAT64 the following command can be used:
|
|
|
|
.Bd -ragged -offset indent
|
|
|
|
.Bk -words
|
|
|
|
.Cm nat64lsn
|
|
|
|
.Ar name
|
|
|
|
.Cm show Cm states
|
|
|
|
.Ek
|
|
|
|
.Ed
|
|
|
|
.Pp
|
|
|
|
.Pp
|
|
|
|
Stateless NAT64 translator doesn't use a states table for translation
|
|
|
|
and converts IPv4 addresses to IPv6 and vice versa solely based on the
|
|
|
|
mappings taken from configured lookup tables.
|
|
|
|
Since a states table doesn't used by stateless translator,
|
|
|
|
it can be configured to pass IPv4 clients to IPv6-only servers.
|
|
|
|
.Pp
|
|
|
|
The stateless NAT64 configuration command is the following:
|
|
|
|
.Bd -ragged -offset indent
|
|
|
|
.Bk -words
|
|
|
|
.Cm nat64stl
|
|
|
|
.Ar name
|
|
|
|
.Cm create
|
|
|
|
.Ar create-options
|
|
|
|
.Ek
|
|
|
|
.Ed
|
|
|
|
.Pp
|
|
|
|
The following parameters can be configured:
|
|
|
|
.Bl -tag -width indent
|
|
|
|
.It Cm table4 Ar table46
|
|
|
|
The lookup table
|
|
|
|
.Ar table46
|
|
|
|
contains mapping how IPv4 addresses should be translated to IPv6 addresses.
|
|
|
|
.It Cm table6 Ar table64
|
|
|
|
The lookup table
|
|
|
|
.Ar table64
|
|
|
|
contains mapping how IPv6 addresses should be translated to IPv4 addresses.
|
|
|
|
.It Cm log
|
|
|
|
Turn on logging of all handled packets via BPF through
|
|
|
|
.Ar ipfwlog0
|
|
|
|
interface.
|
|
|
|
.It Cm -log
|
|
|
|
Turn off logging of all handled packets via BPF.
|
|
|
|
.El
|
|
|
|
.Pp
|
|
|
|
Note that the behavior of stateless translator with respect to not matched
|
|
|
|
packets differs from stateful translator.
|
|
|
|
If corresponding addresses was not found in the lookup tables, the packet
|
|
|
|
will not be dropped and the search continues.
|
2016-07-18 19:46:31 +00:00
|
|
|
.Sh IPv6-to-IPv6 NETWORK PREFIX TRANSLATION (NPTv6)
|
|
|
|
.Nm
|
2016-08-13 16:09:49 +00:00
|
|
|
supports in-kernel IPv6-to-IPv6 network prefix translation as described
|
2016-07-18 19:46:31 +00:00
|
|
|
in RFC6296.
|
|
|
|
The kernel module
|
|
|
|
.Cm ipfw_nptv6
|
|
|
|
should be loaded or kernel should has
|
|
|
|
.Cm options IPFIREWALL_NPTV6
|
|
|
|
to be able use NPTv6 translator.
|
|
|
|
.Pp
|
|
|
|
The NPTv6 configuration command is the following:
|
|
|
|
.Bd -ragged -offset indent
|
|
|
|
.Bk -words
|
|
|
|
.Cm nptv6
|
|
|
|
.Ar name
|
|
|
|
.Cm create
|
|
|
|
.Ar create-options
|
|
|
|
.Ek
|
|
|
|
.Ed
|
|
|
|
.Pp
|
|
|
|
The following parameters can be configured:
|
|
|
|
.Bl -tag -width indent
|
|
|
|
.It Cm int_prefix Ar ipv6_prefix
|
|
|
|
IPv6 prefix used in internal network.
|
|
|
|
NPTv6 module translates source address when it matches this prefix.
|
|
|
|
.It Cm ext_prefix Ar ipv6_prefix
|
|
|
|
IPv6 prefix used in external network.
|
|
|
|
NPTv6 module translates destination address when it matches this prefix.
|
|
|
|
.It Cm prefixlen Ar length
|
|
|
|
The length of specified IPv6 prefixes. It must be in range from 8 to 64.
|
|
|
|
.El
|
|
|
|
.Pp
|
|
|
|
Note that the prefix translation rules are silently ignored when IPv6 packet
|
|
|
|
forwarding is disabled.
|
|
|
|
To enable the packet forwarding, set the sysctl variable
|
|
|
|
.Va net.inet6.ip6.forwarding
|
|
|
|
to 1.
|
|
|
|
.Pp
|
|
|
|
To let the packet continue after being translated, set the sysctl variable
|
|
|
|
.Va net.inet.ip.fw.one_pass
|
|
|
|
to 0.
|
2012-03-29 05:02:12 +00:00
|
|
|
.Sh LOADER TUNABLES
|
2012-03-12 14:07:57 +00:00
|
|
|
Tunables can be set in
|
|
|
|
.Xr loader 8
|
|
|
|
prompt,
|
|
|
|
.Xr loader.conf 5
|
|
|
|
or
|
|
|
|
.Xr kenv 1
|
|
|
|
before ipfw module gets loaded.
|
|
|
|
.Bl -tag -width indent
|
|
|
|
.It Va net.inet.ip.fw.default_to_accept: No 0
|
2012-09-18 02:33:23 +00:00
|
|
|
Defines ipfw last rule behavior.
|
|
|
|
This value overrides
|
2012-03-12 14:07:57 +00:00
|
|
|
.Cd "options IPFW_DEFAULT_TO_(ACCEPT|DENY)"
|
|
|
|
from kernel configuration file.
|
|
|
|
.It Va net.inet.ip.fw.tables_max: No 128
|
2012-09-18 02:33:23 +00:00
|
|
|
Defines number of tables available in ipfw.
|
|
|
|
Number cannot exceed 65534.
|
2012-03-12 14:07:57 +00:00
|
|
|
.El
|
2000-02-10 14:25:26 +00:00
|
|
|
.Sh SYSCTL VARIABLES
|
|
|
|
A set of
|
2000-02-28 15:21:12 +00:00
|
|
|
.Xr sysctl 8
|
2002-08-16 14:27:22 +00:00
|
|
|
variables controls the behaviour of the firewall and
|
2005-01-15 11:21:24 +00:00
|
|
|
associated modules
|
2009-02-07 18:49:42 +00:00
|
|
|
.Pq Nm dummynet , bridge , sctp nat .
|
2001-09-27 23:44:27 +00:00
|
|
|
These are shown below together with their default value
|
|
|
|
(but always check with the
|
2001-10-01 14:13:36 +00:00
|
|
|
.Xr sysctl 8
|
2001-09-27 23:44:27 +00:00
|
|
|
command what value is actually in use) and meaning:
|
2000-02-28 15:21:12 +00:00
|
|
|
.Bl -tag -width indent
|
2009-02-07 18:49:42 +00:00
|
|
|
.It Va net.inet.ip.alias.sctp.accept_global_ootb_addip: No 0
|
2012-03-29 05:02:12 +00:00
|
|
|
Defines how the
|
|
|
|
.Nm nat
|
2009-02-07 18:49:42 +00:00
|
|
|
responds to receipt of global OOTB ASCONF-AddIP:
|
|
|
|
.Bl -tag -width indent
|
|
|
|
.It Cm 0
|
|
|
|
No response (unless a partially matching association exists -
|
|
|
|
ports and vtags match but global address does not)
|
|
|
|
.It Cm 1
|
2012-03-29 05:02:12 +00:00
|
|
|
.Nm nat
|
2009-02-07 18:49:42 +00:00
|
|
|
will accept and process all OOTB global AddIP messages.
|
|
|
|
.El
|
|
|
|
.Pp
|
2009-03-19 10:42:07 +00:00
|
|
|
Option 1 should never be selected as this forms a security risk.
|
|
|
|
An attacker can
|
2009-02-07 18:49:42 +00:00
|
|
|
establish multiple fake associations by sending AddIP messages.
|
|
|
|
.It Va net.inet.ip.alias.sctp.chunk_proc_limit: No 5
|
2012-09-18 02:33:23 +00:00
|
|
|
Defines the maximum number of chunks in an SCTP packet that will be
|
|
|
|
parsed for a
|
2009-03-19 10:42:07 +00:00
|
|
|
packet that matches an existing association.
|
2012-03-29 05:02:12 +00:00
|
|
|
This value is enforced to be greater or equal than
|
|
|
|
.Cm net.inet.ip.alias.sctp.initialising_chunk_proc_limit .
|
2009-02-07 18:49:42 +00:00
|
|
|
A high value is
|
2012-09-18 02:33:23 +00:00
|
|
|
a DoS risk yet setting too low a value may result in
|
|
|
|
important control chunks in
|
2009-02-07 18:49:42 +00:00
|
|
|
the packet not being located and parsed.
|
|
|
|
.It Va net.inet.ip.alias.sctp.error_on_ootb: No 1
|
2009-03-19 10:42:07 +00:00
|
|
|
Defines when the
|
2012-03-29 05:02:12 +00:00
|
|
|
.Nm nat
|
2009-03-19 10:42:07 +00:00
|
|
|
responds to any Out-of-the-Blue (OOTB) packets with ErrorM packets.
|
|
|
|
An OOTB packet is a packet that arrives with no existing association
|
|
|
|
registered in the
|
2012-03-29 05:02:12 +00:00
|
|
|
.Nm nat
|
2009-02-07 18:49:42 +00:00
|
|
|
and is not an INIT or ASCONF-AddIP packet:
|
|
|
|
.Bl -tag -width indent
|
|
|
|
.It Cm 0
|
|
|
|
ErrorM is never sent in response to OOTB packets.
|
|
|
|
.It Cm 1
|
|
|
|
ErrorM is only sent to OOTB packets received on the local side.
|
|
|
|
.It Cm 2
|
|
|
|
ErrorM is sent to the local side and on the global side ONLY if there is a
|
2009-03-19 10:42:07 +00:00
|
|
|
partial match (ports and vtags match but the source global IP does not).
|
2012-03-29 05:02:12 +00:00
|
|
|
This value is only useful if the
|
|
|
|
.Nm nat
|
2009-02-07 18:49:42 +00:00
|
|
|
is tracking global IP addresses.
|
|
|
|
.It Cm 3
|
2012-09-18 02:33:23 +00:00
|
|
|
ErrorM is sent in response to all OOTB packets on both
|
|
|
|
the local and global side
|
2009-02-07 18:49:42 +00:00
|
|
|
(DoS risk).
|
|
|
|
.El
|
|
|
|
.Pp
|
|
|
|
At the moment the default is 0, since the ErrorM packet is not yet
|
2009-03-19 10:42:07 +00:00
|
|
|
supported by most SCTP stacks.
|
|
|
|
When it is supported, and if not tracking
|
2009-02-07 18:49:42 +00:00
|
|
|
global addresses, we recommend setting this value to 1 to allow
|
2012-03-29 05:02:12 +00:00
|
|
|
multi-homed local hosts to function with the
|
2009-02-07 18:49:42 +00:00
|
|
|
.Nm nat .
|
|
|
|
To track global addresses, we recommend setting this value to 2 to
|
|
|
|
allow global hosts to be informed when they need to (re)send an
|
2009-03-19 10:42:07 +00:00
|
|
|
ASCONF-AddIP.
|
|
|
|
Value 3 should never be chosen (except for debugging) as the
|
2012-03-29 05:02:12 +00:00
|
|
|
.Nm nat
|
2009-02-07 18:49:42 +00:00
|
|
|
will respond to all OOTB global packets (a DoS risk).
|
|
|
|
.It Va net.inet.ip.alias.sctp.hashtable_size: No 2003
|
2012-03-29 05:02:12 +00:00
|
|
|
Size of hash tables used for
|
|
|
|
.Nm nat
|
2009-03-19 10:42:07 +00:00
|
|
|
lookups (100 < prime_number > 1000001).
|
2012-03-29 05:02:12 +00:00
|
|
|
This value sets the
|
|
|
|
.Nm hash table
|
|
|
|
size for any future created
|
|
|
|
.Nm nat
|
|
|
|
instance and therefore must be set prior to creating a
|
2009-02-07 18:49:42 +00:00
|
|
|
.Nm nat
|
|
|
|
instance.
|
2009-03-19 10:42:07 +00:00
|
|
|
The table sizes may be changed to suit specific needs.
|
|
|
|
If there will be few
|
|
|
|
concurrent associations, and memory is scarce, you may make these smaller.
|
|
|
|
If there will be many thousands (or millions) of concurrent associations, you
|
|
|
|
should make these larger.
|
|
|
|
A prime number is best for the table size.
|
|
|
|
The sysctl
|
2009-02-07 18:49:42 +00:00
|
|
|
update function will adjust your input value to the next highest prime number.
|
|
|
|
.It Va net.inet.ip.alias.sctp.holddown_time: No 0
|
|
|
|
Hold association in table for this many seconds after receiving a
|
2009-03-19 10:42:07 +00:00
|
|
|
SHUTDOWN-COMPLETE.
|
|
|
|
This allows endpoints to correct shutdown gracefully if a
|
2009-02-07 18:49:42 +00:00
|
|
|
shutdown_complete is lost and retransmissions are required.
|
|
|
|
.It Va net.inet.ip.alias.sctp.init_timer: No 15
|
|
|
|
Timeout value while waiting for (INIT-ACK|AddIP-ACK).
|
|
|
|
This value cannot be 0.
|
|
|
|
.It Va net.inet.ip.alias.sctp.initialising_chunk_proc_limit: No 2
|
|
|
|
Defines the maximum number of chunks in an SCTP packet that will be parsed when
|
2009-03-19 10:42:07 +00:00
|
|
|
no existing association exists that matches that packet.
|
|
|
|
Ideally this packet
|
|
|
|
will only be an INIT or ASCONF-AddIP packet.
|
|
|
|
A higher value may become a DoS
|
2009-02-07 18:49:42 +00:00
|
|
|
risk as malformed packets can consume processing resources.
|
|
|
|
.It Va net.inet.ip.alias.sctp.param_proc_limit: No 25
|
2012-09-18 02:33:23 +00:00
|
|
|
Defines the maximum number of parameters within a chunk that will be
|
|
|
|
parsed in a
|
2009-03-19 10:42:07 +00:00
|
|
|
packet.
|
|
|
|
As for other similar sysctl variables, larger values pose a DoS risk.
|
2012-03-29 05:02:12 +00:00
|
|
|
.It Va net.inet.ip.alias.sctp.log_level: No 0
|
2009-02-07 18:49:42 +00:00
|
|
|
Level of detail in the system log messages (0 \- minimal, 1 \- event,
|
2012-09-18 02:33:23 +00:00
|
|
|
2 \- info, 3 \- detail, 4 \- debug, 5 \- max debug).
|
|
|
|
May be a good
|
2009-02-07 18:49:42 +00:00
|
|
|
option in high loss environments.
|
|
|
|
.It Va net.inet.ip.alias.sctp.shutdown_time: No 15
|
|
|
|
Timeout value while waiting for SHUTDOWN-COMPLETE.
|
|
|
|
This value cannot be 0.
|
|
|
|
.It Va net.inet.ip.alias.sctp.track_global_addresses: No 0
|
2012-03-29 05:02:12 +00:00
|
|
|
Enables/disables global IP address tracking within the
|
|
|
|
.Nm nat
|
2009-02-07 18:49:42 +00:00
|
|
|
and places an
|
|
|
|
upper limit on the number of addresses tracked for each association:
|
|
|
|
.Bl -tag -width indent
|
|
|
|
.It Cm 0
|
|
|
|
Global tracking is disabled
|
|
|
|
.It Cm >1
|
|
|
|
Enables tracking, the maximum number of addresses tracked for each
|
|
|
|
association is limited to this value
|
|
|
|
.El
|
|
|
|
.Pp
|
|
|
|
This variable is fully dynamic, the new value will be adopted for all newly
|
2012-09-18 02:33:23 +00:00
|
|
|
arriving associations, existing associations are treated
|
|
|
|
as they were previously.
|
2012-03-29 05:02:12 +00:00
|
|
|
Global tracking will decrease the number of collisions within the
|
|
|
|
.Nm nat
|
2009-02-07 18:49:42 +00:00
|
|
|
at a cost
|
2012-03-29 05:02:12 +00:00
|
|
|
of increased processing load, memory usage, complexity, and possible
|
|
|
|
.Nm nat
|
2009-02-07 18:49:42 +00:00
|
|
|
state
|
2012-03-29 05:02:12 +00:00
|
|
|
problems in complex networks with multiple
|
|
|
|
.Nm nats .
|
2009-02-07 18:49:42 +00:00
|
|
|
We recommend not tracking
|
2012-03-29 05:02:12 +00:00
|
|
|
global IP addresses, this will still result in a fully functional
|
2009-02-07 18:49:42 +00:00
|
|
|
.Nm nat .
|
|
|
|
.It Va net.inet.ip.alias.sctp.up_timer: No 300
|
|
|
|
Timeout value to keep an association up with no traffic.
|
|
|
|
This value cannot be 0.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.dummynet.expire : No 1
|
2002-08-16 14:27:22 +00:00
|
|
|
Lazily delete dynamic pipes/queue once they have no pending traffic.
|
|
|
|
You can disable this by setting the variable to 0, in which case
|
|
|
|
the pipes/queues will only be deleted when the threshold is reached.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.dummynet.hash_size : No 64
|
2002-08-16 14:27:22 +00:00
|
|
|
Default size of the hash table used for dynamic pipes/queues.
|
|
|
|
This value is used when no
|
|
|
|
.Cm buckets
|
|
|
|
option is specified when configuring a pipe/queue.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.dummynet.io_fast : No 0
|
|
|
|
If set to a non-zero value,
|
|
|
|
the
|
|
|
|
.Dq fast
|
|
|
|
mode of
|
|
|
|
.Nm dummynet
|
|
|
|
operation (see above) is enabled.
|
|
|
|
.It Va net.inet.ip.dummynet.io_pkt
|
|
|
|
Number of packets passed to
|
|
|
|
.Nm dummynet .
|
|
|
|
.It Va net.inet.ip.dummynet.io_pkt_drop
|
|
|
|
Number of packets dropped by
|
|
|
|
.Nm dummynet .
|
|
|
|
.It Va net.inet.ip.dummynet.io_pkt_fast
|
|
|
|
Number of packets bypassed by the
|
|
|
|
.Nm dummynet
|
|
|
|
scheduler.
|
|
|
|
.It Va net.inet.ip.dummynet.max_chain_len : No 16
|
2002-08-16 14:27:22 +00:00
|
|
|
Target value for the maximum number of pipes/queues in a hash bucket.
|
|
|
|
The product
|
|
|
|
.Cm max_chain_len*hash_size
|
|
|
|
is used to determine the threshold over which empty pipes/queues
|
|
|
|
will be expired even when
|
|
|
|
.Cm net.inet.ip.dummynet.expire=0 .
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.dummynet.red_lookup_depth : No 256
|
|
|
|
.It Va net.inet.ip.dummynet.red_avg_pkt_size : No 512
|
|
|
|
.It Va net.inet.ip.dummynet.red_max_pkt_size : No 1500
|
2002-08-16 14:27:22 +00:00
|
|
|
Parameters used in the computations of the drop probability
|
|
|
|
for the RED algorithm.
|
2008-02-27 13:52:33 +00:00
|
|
|
.It Va net.inet.ip.dummynet.pipe_byte_limit : No 1048576
|
|
|
|
.It Va net.inet.ip.dummynet.pipe_slot_limit : No 100
|
|
|
|
The maximum queue size that can be specified in bytes or packets.
|
|
|
|
These limits prevent accidental exhaustion of resources such as mbufs.
|
|
|
|
If you raise these limits,
|
|
|
|
you should make sure the system is configured so that sufficient resources
|
|
|
|
are available.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.fw.autoinc_step : No 100
|
2002-10-28 07:03:56 +00:00
|
|
|
Delta between rule numbers when auto-generating them.
|
2002-08-16 10:31:47 +00:00
|
|
|
The value must be in the range 1..1000.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.fw.curr_dyn_buckets : Va net.inet.ip.fw.dyn_buckets
|
2002-08-16 10:31:47 +00:00
|
|
|
The current number of buckets in the hash table for dynamic rules
|
|
|
|
(readonly).
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.fw.debug : No 1
|
2000-02-28 15:21:12 +00:00
|
|
|
Controls debugging messages produced by
|
2000-11-20 16:52:27 +00:00
|
|
|
.Nm .
|
2008-09-27 15:09:00 +00:00
|
|
|
.It Va net.inet.ip.fw.default_rule : No 65535
|
|
|
|
The default rule number (read-only).
|
|
|
|
By the design of
|
|
|
|
.Nm , the default rule is the last one, so its number
|
|
|
|
can also serve as the highest number allowed for a rule.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.fw.dyn_buckets : No 256
|
2002-08-16 10:31:47 +00:00
|
|
|
The number of buckets in the hash table for dynamic rules.
|
2002-08-16 14:27:22 +00:00
|
|
|
Must be a power of 2, up to 65536.
|
2002-08-16 10:31:47 +00:00
|
|
|
It only takes effect when all dynamic rules have expired, so you
|
|
|
|
are advised to use a
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm flush
|
2002-08-16 10:31:47 +00:00
|
|
|
command to make sure that the hash table is resized.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.fw.dyn_count : No 3
|
2000-02-28 15:21:12 +00:00
|
|
|
Current number of dynamic rules
|
2001-08-07 15:48:51 +00:00
|
|
|
(read-only).
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.fw.dyn_keepalive : No 1
|
2002-08-16 10:31:47 +00:00
|
|
|
Enables generation of keepalive packets for
|
|
|
|
.Cm keep-state
|
2004-07-02 21:45:06 +00:00
|
|
|
rules on TCP sessions.
|
|
|
|
A keepalive is generated to both
|
2002-08-16 10:31:47 +00:00
|
|
|
sides of the connection every 5 seconds for the last 20
|
|
|
|
seconds of the lifetime of the rule.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.fw.dyn_max : No 8192
|
2000-02-28 15:21:12 +00:00
|
|
|
Maximum number of dynamic rules.
|
|
|
|
When you hit this limit, no more dynamic rules can be
|
|
|
|
installed until old ones expire.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.fw.dyn_ack_lifetime : No 300
|
|
|
|
.It Va net.inet.ip.fw.dyn_syn_lifetime : No 20
|
|
|
|
.It Va net.inet.ip.fw.dyn_fin_lifetime : No 1
|
|
|
|
.It Va net.inet.ip.fw.dyn_rst_lifetime : No 1
|
|
|
|
.It Va net.inet.ip.fw.dyn_udp_lifetime : No 5
|
|
|
|
.It Va net.inet.ip.fw.dyn_short_lifetime : No 30
|
2000-02-28 15:21:12 +00:00
|
|
|
These variables control the lifetime, in seconds, of dynamic
|
|
|
|
rules.
|
2000-02-10 14:25:26 +00:00
|
|
|
Upon the initial SYN exchange the lifetime is kept short,
|
|
|
|
then increased after both SYN have been seen, then decreased
|
2002-08-16 10:31:47 +00:00
|
|
|
again during the final FIN exchange or when a RST is received.
|
|
|
|
Both
|
|
|
|
.Em dyn_fin_lifetime
|
|
|
|
and
|
|
|
|
.Em dyn_rst_lifetime
|
|
|
|
must be strictly lower than 5 seconds, the period of
|
2004-07-02 21:45:06 +00:00
|
|
|
repetition of keepalives.
|
|
|
|
The firewall enforces that.
|
2013-12-18 20:17:05 +00:00
|
|
|
.It Va net.inet.ip.fw.dyn_keep_states: No 0
|
|
|
|
Keep dynamic states on rule/set deletion.
|
|
|
|
States are relinked to default rule (65535).
|
|
|
|
This can be handly for ruleset reload.
|
|
|
|
Turned off by default.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.fw.enable : No 1
|
2002-08-16 10:31:47 +00:00
|
|
|
Enables the firewall.
|
|
|
|
Setting this variable to 0 lets you run your machine without
|
|
|
|
firewall even if compiled in.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet6.ip6.fw.enable : No 1
|
2006-05-12 18:09:33 +00:00
|
|
|
provides the same functionality as above for the IPv6 case.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.fw.one_pass : No 1
|
2002-08-16 10:31:47 +00:00
|
|
|
When set, the packet exiting from the
|
2007-11-26 00:36:40 +00:00
|
|
|
.Nm dummynet
|
2005-02-05 18:29:03 +00:00
|
|
|
pipe or from
|
|
|
|
.Xr ng_ipfw 4
|
|
|
|
node is not passed though the firewall again.
|
|
|
|
Otherwise, after an action, the packet is
|
2002-08-16 10:31:47 +00:00
|
|
|
reinjected into the firewall at the next rule.
|
2008-09-27 15:09:00 +00:00
|
|
|
.It Va net.inet.ip.fw.tables_max : No 128
|
2012-03-25 20:37:59 +00:00
|
|
|
Maximum number of tables.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.fw.verbose : No 1
|
2002-08-16 10:31:47 +00:00
|
|
|
Enables verbose messages.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet.ip.fw.verbose_limit : No 0
|
2002-08-16 10:31:47 +00:00
|
|
|
Limits the number of messages produced by a verbose firewall.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.inet6.ip6.fw.deny_unknown_exthdrs : No 1
|
2005-08-13 11:02:34 +00:00
|
|
|
If enabled packets with unknown IPv6 Extension Headers will be denied.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.link.ether.ipfw : No 0
|
2002-08-10 15:04:40 +00:00
|
|
|
Controls whether layer-2 packets are passed to
|
|
|
|
.Nm .
|
|
|
|
Default is no.
|
2007-11-26 00:36:40 +00:00
|
|
|
.It Va net.link.bridge.ipfw : No 0
|
2002-08-10 15:04:40 +00:00
|
|
|
Controls whether bridged packets are passed to
|
|
|
|
.Nm .
|
|
|
|
Default is no.
|
2000-02-10 14:25:26 +00:00
|
|
|
.El
|
2014-08-14 17:31:04 +00:00
|
|
|
.Sh INTERNAL DIAGNOSTICS
|
|
|
|
There are some commands that may be useful to understand current state
|
|
|
|
of certain subsystems inside kernel module.
|
|
|
|
These commands provide debugging output which may change without notice.
|
|
|
|
.Pp
|
|
|
|
Currently the following commands are available as
|
|
|
|
.Cm internal
|
|
|
|
sub-options:
|
|
|
|
.Bl -tag -width indent
|
|
|
|
.It Cm iflist
|
|
|
|
Lists all interface which are currently tracked by
|
|
|
|
.Nm
|
|
|
|
with their in-kernel status.
|
|
|
|
.It Cm talist
|
|
|
|
List all table lookup algorithms currently available.
|
|
|
|
.El
|
1994-11-17 09:50:30 +00:00
|
|
|
.Sh EXAMPLES
|
2002-08-16 10:31:47 +00:00
|
|
|
There are far too many possible uses of
|
|
|
|
.Nm
|
|
|
|
so this Section will only give a small set of examples.
|
|
|
|
.Pp
|
|
|
|
.Ss BASIC PACKET FILTERING
|
1995-10-26 05:36:24 +00:00
|
|
|
This command adds an entry which denies all tcp packets from
|
1998-04-08 12:00:48 +00:00
|
|
|
.Em cracker.evil.org
|
1995-10-26 05:36:24 +00:00
|
|
|
to the telnet port of
|
|
|
|
.Em wolf.tambov.su
|
|
|
|
from being forwarded by the host:
|
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
.Dl "ipfw add deny tcp from cracker.evil.org to wolf.tambov.su telnet"
|
|
|
|
.Pp
|
2002-10-28 07:03:56 +00:00
|
|
|
This one disallows any connection from the entire cracker's
|
2000-02-28 15:21:12 +00:00
|
|
|
network to my host:
|
1995-10-26 05:36:24 +00:00
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
.Dl "ipfw add deny ip from 123.45.67.0/24 to my.host.org"
|
1995-10-26 05:36:24 +00:00
|
|
|
.Pp
|
2000-02-10 14:25:26 +00:00
|
|
|
A first and efficient way to limit access (not using dynamic rules)
|
2000-02-28 15:21:12 +00:00
|
|
|
is the use of the following rules:
|
2000-02-10 14:25:26 +00:00
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add allow tcp from any to any established"
|
|
|
|
.Dl "ipfw add allow tcp from net1 portlist1 to net2 portlist2 setup"
|
|
|
|
.Dl "ipfw add allow tcp from net3 portlist3 to net3 portlist3 setup"
|
|
|
|
.Dl "..."
|
|
|
|
.Dl "ipfw add deny tcp from any to any"
|
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
The first rule will be a quick match for normal TCP packets,
|
|
|
|
but it will not match the initial SYN packet, which will be
|
2000-02-10 14:25:26 +00:00
|
|
|
matched by the
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm setup
|
2000-02-10 14:25:26 +00:00
|
|
|
rules only for selected source/destination pairs.
|
|
|
|
All other SYN packets will be rejected by the final
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm deny
|
2000-02-10 14:25:26 +00:00
|
|
|
rule.
|
|
|
|
.Pp
|
2006-01-13 16:44:56 +00:00
|
|
|
If you administer one or more subnets, you can take advantage
|
|
|
|
of the address sets and or-blocks and write extremely
|
2002-08-16 10:31:47 +00:00
|
|
|
compact rulesets which selectively enable services to blocks
|
|
|
|
of clients, as below:
|
|
|
|
.Pp
|
|
|
|
.Dl "goodguys=\*q{ 10.1.2.0/24{20,35,66,18} or 10.2.3.0/28{6,3,11} }\*q"
|
|
|
|
.Dl "badguys=\*q10.1.2.0/24{8,38,60}\*q"
|
|
|
|
.Dl ""
|
|
|
|
.Dl "ipfw add allow ip from ${goodguys} to any"
|
|
|
|
.Dl "ipfw add deny ip from ${badguys} to any"
|
|
|
|
.Dl "... normal policies ..."
|
|
|
|
.Pp
|
|
|
|
The
|
2003-03-15 01:13:00 +00:00
|
|
|
.Cm verrevpath
|
|
|
|
option could be used to do automated anti-spoofing by adding the
|
|
|
|
following to the top of a ruleset:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add deny ip from any to any not verrevpath in"
|
|
|
|
.Pp
|
|
|
|
This rule drops all incoming packets that appear to be coming to the
|
2004-07-02 21:45:06 +00:00
|
|
|
system on the wrong interface.
|
|
|
|
For example, a packet with a source
|
2003-03-15 01:13:00 +00:00
|
|
|
address belonging to a host on a protected internal network would be
|
|
|
|
dropped if it tried to enter the system from an external interface.
|
2004-08-09 16:12:10 +00:00
|
|
|
.Pp
|
|
|
|
The
|
|
|
|
.Cm antispoof
|
|
|
|
option could be used to do similar but more restricted anti-spoofing
|
|
|
|
by adding the following to the top of a ruleset:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add deny ip from any to any not antispoof in"
|
|
|
|
.Pp
|
|
|
|
This rule drops all incoming packets that appear to be coming from another
|
|
|
|
directly connected system but on the wrong interface.
|
|
|
|
For example, a packet with a source address of
|
2009-03-19 10:42:07 +00:00
|
|
|
.Li 192.168.0.0/24 ,
|
|
|
|
configured on
|
|
|
|
.Li fxp0 ,
|
|
|
|
but coming in on
|
2004-08-09 16:12:10 +00:00
|
|
|
.Li fxp1
|
|
|
|
would be dropped.
|
2013-03-20 10:35:33 +00:00
|
|
|
.Pp
|
|
|
|
The
|
|
|
|
.Cm setdscp
|
|
|
|
option could be used to (re)mark user traffic,
|
|
|
|
by adding the following to the appropriate place in ruleset:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add setdscp be ip from any to any dscp af11,af21"
|
2002-08-16 10:31:47 +00:00
|
|
|
.Ss DYNAMIC RULES
|
2000-02-10 14:25:26 +00:00
|
|
|
In order to protect a site from flood attacks involving fake
|
|
|
|
TCP packets, it is safer to use dynamic rules:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add check-state"
|
|
|
|
.Dl "ipfw add deny tcp from any to any established"
|
|
|
|
.Dl "ipfw add allow tcp from my-net to any setup keep-state"
|
|
|
|
.Pp
|
|
|
|
This will let the firewall install dynamic rules only for
|
2000-02-28 15:21:12 +00:00
|
|
|
those connection which start with a regular SYN packet coming
|
|
|
|
from the inside of our network.
|
|
|
|
Dynamic rules are checked when encountering the first
|
2012-07-16 22:15:30 +00:00
|
|
|
occurrence of a
|
|
|
|
.Cm check-state ,
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm keep-state
|
2012-07-16 22:15:30 +00:00
|
|
|
or
|
|
|
|
.Cm limit
|
2000-02-28 15:21:12 +00:00
|
|
|
rule.
|
|
|
|
A
|
|
|
|
.Cm check-state
|
2002-10-28 07:03:56 +00:00
|
|
|
rule should usually be placed near the beginning of the
|
2000-02-28 15:21:12 +00:00
|
|
|
ruleset to minimize the amount of work scanning the ruleset.
|
|
|
|
Your mileage may vary.
|
|
|
|
.Pp
|
2001-09-27 23:44:27 +00:00
|
|
|
To limit the number of connections a user can open
|
|
|
|
you can use the following type of rules:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add allow tcp from my-net/24 to any setup limit src-addr 10"
|
|
|
|
.Dl "ipfw add allow tcp from any to me setup limit src-addr 4"
|
|
|
|
.Pp
|
|
|
|
The former (assuming it runs on a gateway) will allow each host
|
2001-10-01 14:13:36 +00:00
|
|
|
on a /24 network to open at most 10 TCP connections.
|
2001-09-27 23:44:27 +00:00
|
|
|
The latter can be placed on a server to make sure that a single
|
|
|
|
client does not use more than 4 simultaneous connections.
|
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
.Em BEWARE :
|
2000-02-10 14:25:26 +00:00
|
|
|
stateful rules can be subject to denial-of-service attacks
|
|
|
|
by a SYN-flood which opens a huge number of dynamic rules.
|
2000-02-28 15:21:12 +00:00
|
|
|
The effects of such attacks can be partially limited by
|
|
|
|
acting on a set of
|
|
|
|
.Xr sysctl 8
|
2000-02-10 14:25:26 +00:00
|
|
|
variables which control the operation of the firewall.
|
|
|
|
.Pp
|
1999-04-28 02:49:29 +00:00
|
|
|
Here is a good usage of the
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm list
|
|
|
|
command to see accounting records and timestamp information:
|
1995-10-26 05:36:24 +00:00
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
.Dl ipfw -at list
|
1995-10-26 05:36:24 +00:00
|
|
|
.Pp
|
1997-05-15 00:51:08 +00:00
|
|
|
or in short form without timestamps:
|
1995-10-26 05:36:24 +00:00
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
.Dl ipfw -a list
|
1995-10-26 05:36:24 +00:00
|
|
|
.Pp
|
2002-01-02 20:16:15 +00:00
|
|
|
which is equivalent to:
|
|
|
|
.Pp
|
|
|
|
.Dl ipfw show
|
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
Next rule diverts all incoming packets from 192.168.2.0/24
|
|
|
|
to divert port 5000:
|
1996-07-10 19:44:30 +00:00
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
.Dl ipfw divert 5000 ip from 192.168.2.0/24 to any in
|
2002-08-16 10:31:47 +00:00
|
|
|
.Ss TRAFFIC SHAPING
|
2000-02-28 15:21:12 +00:00
|
|
|
The following rules show some of the applications of
|
|
|
|
.Nm
|
|
|
|
and
|
2007-11-26 00:36:40 +00:00
|
|
|
.Nm dummynet
|
2000-02-28 15:21:12 +00:00
|
|
|
for simulations and the like.
|
2000-01-08 11:19:19 +00:00
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
This rule drops random incoming packets with a probability
|
|
|
|
of 5%:
|
2000-01-08 11:19:19 +00:00
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add prob 0.05 deny ip from any to any in"
|
|
|
|
.Pp
|
2007-11-26 00:36:40 +00:00
|
|
|
A similar effect can be achieved making use of
|
|
|
|
.Nm dummynet
|
|
|
|
pipes:
|
2000-01-08 11:19:19 +00:00
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add pipe 10 ip from any to any"
|
|
|
|
.Dl "ipfw pipe 10 config plr 0.05"
|
|
|
|
.Pp
|
2004-07-02 21:45:06 +00:00
|
|
|
We can use pipes to artificially limit bandwidth, e.g.\& on a
|
2000-02-28 15:21:12 +00:00
|
|
|
machine acting as a router, if we want to limit traffic from
|
|
|
|
local clients on 192.168.2.0/24 we do:
|
2000-01-08 11:19:19 +00:00
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add pipe 1 ip from 192.168.2.0/24 to any out"
|
|
|
|
.Dl "ipfw pipe 1 config bw 300Kbit/s queue 50KBytes"
|
|
|
|
.Pp
|
|
|
|
note that we use the
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm out
|
|
|
|
modifier so that the rule is not used twice.
|
|
|
|
Remember in fact that
|
|
|
|
.Nm
|
|
|
|
rules are checked both on incoming and outgoing packets.
|
2000-01-08 11:19:19 +00:00
|
|
|
.Pp
|
2002-10-28 07:03:56 +00:00
|
|
|
Should we want to simulate a bidirectional link with bandwidth
|
2000-01-08 11:19:19 +00:00
|
|
|
limitations, the correct way is the following:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add pipe 1 ip from any to any out"
|
|
|
|
.Dl "ipfw add pipe 2 ip from any to any in"
|
|
|
|
.Dl "ipfw pipe 1 config bw 64Kbit/s queue 10Kbytes"
|
|
|
|
.Dl "ipfw pipe 2 config bw 64Kbit/s queue 10Kbytes"
|
|
|
|
.Pp
|
2004-07-02 21:45:06 +00:00
|
|
|
The above can be very useful, e.g.\& if you want to see how
|
2002-10-28 07:03:56 +00:00
|
|
|
your fancy Web page will look for a residential user who
|
2000-02-28 15:21:12 +00:00
|
|
|
is connected only through a slow link.
|
|
|
|
You should not use only one pipe for both directions, unless
|
2004-07-02 21:45:06 +00:00
|
|
|
you want to simulate a half-duplex medium (e.g.\& AppleTalk,
|
2000-02-28 15:21:12 +00:00
|
|
|
Ethernet, IRDA).
|
2000-01-08 11:19:19 +00:00
|
|
|
It is not necessary that both pipes have the same configuration,
|
|
|
|
so we can also simulate asymmetric links.
|
|
|
|
.Pp
|
2002-10-28 07:03:56 +00:00
|
|
|
Should we want to verify network performance with the RED queue
|
2000-06-12 09:43:00 +00:00
|
|
|
management algorithm:
|
2000-06-08 13:38:57 +00:00
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add pipe 1 ip from any to any"
|
|
|
|
.Dl "ipfw pipe 1 config bw 500Kbit/s queue 100 red 0.002/30/80/0.1"
|
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
Another typical application of the traffic shaper is to
|
|
|
|
introduce some delay in the communication.
|
2002-10-28 07:03:56 +00:00
|
|
|
This can significantly affect applications which do a lot of Remote
|
2000-02-28 15:21:12 +00:00
|
|
|
Procedure Calls, and where the round-trip-time of the
|
|
|
|
connection often becomes a limiting factor much more than
|
|
|
|
bandwidth:
|
2000-01-08 11:19:19 +00:00
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add pipe 1 ip from any to any out"
|
|
|
|
.Dl "ipfw add pipe 2 ip from any to any in"
|
|
|
|
.Dl "ipfw pipe 1 config delay 250ms bw 1Mbit/s"
|
|
|
|
.Dl "ipfw pipe 2 config delay 250ms bw 1Mbit/s"
|
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
Per-flow queueing can be useful for a variety of purposes.
|
|
|
|
A very simple one is counting traffic:
|
2000-01-08 11:19:19 +00:00
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add pipe 1 tcp from any to any"
|
|
|
|
.Dl "ipfw add pipe 1 udp from any to any"
|
|
|
|
.Dl "ipfw add pipe 1 ip from any to any"
|
|
|
|
.Dl "ipfw pipe 1 config mask all"
|
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
The above set of rules will create queues (and collect
|
|
|
|
statistics) for all traffic.
|
|
|
|
Because the pipes have no limitations, the only effect is
|
|
|
|
collecting statistics.
|
|
|
|
Note that we need 3 rules, not just the last one, because
|
|
|
|
when
|
|
|
|
.Nm
|
|
|
|
tries to match IP packets it will not consider ports, so we
|
|
|
|
would not see connections on separate ports as different
|
|
|
|
ones.
|
2000-01-08 11:19:19 +00:00
|
|
|
.Pp
|
2000-02-28 15:21:12 +00:00
|
|
|
A more sophisticated example is limiting the outbound traffic
|
|
|
|
on a net with per-host limits, rather than per-network limits:
|
2000-01-08 11:19:19 +00:00
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add pipe 1 ip from 192.168.2.0/24 to any out"
|
|
|
|
.Dl "ipfw add pipe 2 ip from any to 192.168.2.0/24 in"
|
|
|
|
.Dl "ipfw pipe 1 config mask src-ip 0x000000ff bw 200Kbit/s queue 20Kbytes"
|
|
|
|
.Dl "ipfw pipe 2 config mask dst-ip 0x000000ff bw 200Kbit/s queue 20Kbytes"
|
2006-01-13 15:48:38 +00:00
|
|
|
.Ss LOOKUP TABLES
|
|
|
|
In the following example, we need to create several traffic bandwidth
|
|
|
|
classes and we need different hosts/networks to fall into different classes.
|
|
|
|
We create one pipe for each class and configure them accordingly.
|
|
|
|
Then we create a single table and fill it with IP subnets and addresses.
|
|
|
|
For each subnet/host we set the argument equal to the number of the pipe
|
|
|
|
that it should use.
|
|
|
|
Then we classify traffic using a single rule:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw pipe 1 config bw 1000Kbyte/s"
|
|
|
|
.Dl "ipfw pipe 4 config bw 4000Kbyte/s"
|
|
|
|
.Dl "..."
|
2014-08-14 21:43:20 +00:00
|
|
|
.Dl "ipfw table T1 create type addr"
|
2014-08-13 00:19:18 +00:00
|
|
|
.Dl "ipfw table T1 add 192.168.2.0/24 1"
|
|
|
|
.Dl "ipfw table T1 add 192.168.0.0/27 4"
|
|
|
|
.Dl "ipfw table T1 add 192.168.0.2 1"
|
2006-01-13 15:48:38 +00:00
|
|
|
.Dl "..."
|
2014-08-13 00:19:18 +00:00
|
|
|
.Dl "ipfw add pipe tablearg ip from 'table(T1)' to any"
|
2006-08-17 22:49:50 +00:00
|
|
|
.Pp
|
2006-08-18 22:36:05 +00:00
|
|
|
Using the
|
2006-08-20 05:42:58 +00:00
|
|
|
.Cm fwd
|
2006-08-18 22:36:05 +00:00
|
|
|
action, the table entries may include hostnames and IP addresses.
|
2006-08-17 22:49:50 +00:00
|
|
|
.Pp
|
2014-08-14 21:43:20 +00:00
|
|
|
.Dl "ipfw table T2 create type addr ftype ip"
|
2014-08-13 00:19:18 +00:00
|
|
|
.Dl "ipfw table T2 add 192.168.2.0/24 10.23.2.1"
|
|
|
|
.Dl "ipfw table T21 add 192.168.0.0/27 router1.dmz"
|
2006-08-17 22:49:50 +00:00
|
|
|
.Dl "..."
|
|
|
|
.Dl "ipfw add 100 fwd tablearg ip from any to table(1)"
|
2012-03-12 14:07:57 +00:00
|
|
|
.Pp
|
|
|
|
In the following example per-interface firewall is created:
|
|
|
|
.Pp
|
2014-10-03 15:36:58 +00:00
|
|
|
.Dl "ipfw table IN create type iface valtype skipto,fib"
|
|
|
|
.Dl "ipfw table IN add vlan20 12000,12"
|
|
|
|
.Dl "ipfw table IN add vlan30 13000,13"
|
|
|
|
.Dl "ipfw table OUT create type iface valtype skipto"
|
2014-08-13 00:19:18 +00:00
|
|
|
.Dl "ipfw table OUT add vlan20 22000"
|
|
|
|
.Dl "ipfw table OUT add vlan30 23000"
|
|
|
|
.Dl ".."
|
2014-10-03 15:36:58 +00:00
|
|
|
.Dl "ipfw add 100 ipfw setfib tablearg ip from any to any recv 'table(IN)' in"
|
|
|
|
.Dl "ipfw add 200 ipfw skipto tablearg ip from any to any recv 'table(IN)' in"
|
|
|
|
.Dl "ipfw add 300 ipfw skipto tablearg ip from any to any xmit 'table(OUT)' out"
|
2014-08-13 00:19:18 +00:00
|
|
|
.Pp
|
|
|
|
The following example illustrate usage of flow tables:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw table fl create type flow:flow:src-ip,proto,dst-ip,dst-port"
|
|
|
|
.Dl "ipfw table fl add 2a02:6b8:77::88,tcp,2a02:6b8:77::99,80 11"
|
|
|
|
.Dl "ipfw table fl add 10.0.0.1,udp,10.0.0.2,53 12"
|
2012-03-12 14:07:57 +00:00
|
|
|
.Dl ".."
|
2014-08-13 00:19:18 +00:00
|
|
|
.Dl "ipfw add 100 allow ip from any to any flow 'table(fl,11)' recv ix0"
|
2002-08-16 10:31:47 +00:00
|
|
|
.Ss SETS OF RULES
|
2004-07-02 21:45:06 +00:00
|
|
|
To add a set of rules atomically, e.g.\& set 18:
|
2002-08-16 10:31:47 +00:00
|
|
|
.Pp
|
2003-06-23 07:48:32 +00:00
|
|
|
.Dl "ipfw set disable 18"
|
2002-08-16 10:31:47 +00:00
|
|
|
.Dl "ipfw add NN set 18 ... # repeat as needed"
|
2003-06-23 07:48:32 +00:00
|
|
|
.Dl "ipfw set enable 18"
|
2002-08-16 10:31:47 +00:00
|
|
|
.Pp
|
|
|
|
To delete a set of rules atomically the command is simply:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw delete set 18"
|
|
|
|
.Pp
|
|
|
|
To test a ruleset and disable it and regain control if something goes wrong:
|
|
|
|
.Pp
|
2003-06-23 07:48:32 +00:00
|
|
|
.Dl "ipfw set disable 18"
|
2002-08-16 10:31:47 +00:00
|
|
|
.Dl "ipfw add NN set 18 ... # repeat as needed"
|
2003-06-23 07:48:32 +00:00
|
|
|
.Dl "ipfw set enable 18; echo done; sleep 30 && ipfw set disable 18"
|
2002-08-16 10:31:47 +00:00
|
|
|
.Pp
|
|
|
|
Here if everything goes well, you press control-C before the "sleep"
|
2004-07-02 21:45:06 +00:00
|
|
|
terminates, and your ruleset will be left active.
|
|
|
|
Otherwise, e.g.\& if
|
2002-08-16 10:31:47 +00:00
|
|
|
you cannot access your box, the ruleset will be disabled after
|
|
|
|
the sleep terminates thus restoring the previous situation.
|
2007-06-18 17:52:37 +00:00
|
|
|
.Pp
|
|
|
|
To show rules of the specific set:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw set 18 show"
|
|
|
|
.Pp
|
|
|
|
To show rules of the disabled set:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw -S set 18 show"
|
|
|
|
.Pp
|
|
|
|
To clear a specific rule counters of the specific set:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw set 18 zero NN"
|
|
|
|
.Pp
|
|
|
|
To delete a specific rule of the specific set:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw set 18 delete NN"
|
2006-12-29 21:59:17 +00:00
|
|
|
.Ss NAT, REDIRECT AND LSNAT
|
|
|
|
First redirect all the traffic to nat instance 123:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw add nat 123 all from any to any"
|
|
|
|
.Pp
|
|
|
|
Then to configure nat instance 123 to alias all the outgoing traffic with ip
|
|
|
|
192.168.0.123, blocking all incoming connections, trying to keep
|
2012-03-29 05:02:12 +00:00
|
|
|
same ports on both sides, clearing aliasing table on address change
|
2006-12-29 21:59:17 +00:00
|
|
|
and keeping a log of traffic/link statistics:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw nat 123 config ip 192.168.0.123 log deny_in reset same_ports"
|
|
|
|
.Pp
|
|
|
|
Or to change address of instance 123, aliasing table will be cleared (see
|
|
|
|
reset option):
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw nat 123 config ip 10.0.0.1"
|
|
|
|
.Pp
|
|
|
|
To see configuration of nat instance 123:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw nat 123 show config"
|
|
|
|
.Pp
|
|
|
|
To show logs of all the instances in range 111-999:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw nat 111-999 show"
|
|
|
|
.Pp
|
|
|
|
To see configurations of all instances:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw nat show config"
|
|
|
|
.Pp
|
|
|
|
Or a redirect rule with mixed modes could looks like:
|
|
|
|
.Pp
|
|
|
|
.Dl "ipfw nat 123 config redirect_addr 10.0.0.1 10.0.0.66"
|
|
|
|
.Dl " redirect_port tcp 192.168.0.1:80 500"
|
|
|
|
.Dl " redirect_proto udp 192.168.1.43 192.168.1.1"
|
|
|
|
.Dl " redirect_addr 192.168.0.10,192.168.0.11"
|
|
|
|
.Dl " 10.0.0.100 # LSNAT"
|
2012-03-29 05:02:12 +00:00
|
|
|
.Dl " redirect_port tcp 192.168.0.1:80,192.168.0.10:22"
|
2006-12-29 21:59:17 +00:00
|
|
|
.Dl " 500 # LSNAT"
|
|
|
|
.Pp
|
2009-04-08 15:18:21 +00:00
|
|
|
or it could be split in:
|
2006-12-29 21:59:17 +00:00
|
|
|
.Pp
|
|
|
|
.Dl "ipfw nat 1 config redirect_addr 10.0.0.1 10.0.0.66"
|
|
|
|
.Dl "ipfw nat 2 config redirect_port tcp 192.168.0.1:80 500"
|
|
|
|
.Dl "ipfw nat 3 config redirect_proto udp 192.168.1.43 192.168.1.1"
|
2012-03-29 05:02:12 +00:00
|
|
|
.Dl "ipfw nat 4 config redirect_addr 192.168.0.10,192.168.0.11,192.168.0.12"
|
2006-12-29 21:59:17 +00:00
|
|
|
.Dl " 10.0.0.100"
|
|
|
|
.Dl "ipfw nat 5 config redirect_port tcp"
|
|
|
|
.Dl " 192.168.0.1:80,192.168.0.10:22,192.168.0.20:25 500"
|
1994-11-17 09:50:30 +00:00
|
|
|
.Sh SEE ALSO
|
1998-11-23 10:54:28 +00:00
|
|
|
.Xr cpp 1 ,
|
|
|
|
.Xr m4 1 ,
|
2004-10-08 03:31:09 +00:00
|
|
|
.Xr altq 4 ,
|
1997-09-29 19:11:55 +00:00
|
|
|
.Xr divert 4 ,
|
1999-08-11 15:36:13 +00:00
|
|
|
.Xr dummynet 4 ,
|
2005-11-18 10:36:29 +00:00
|
|
|
.Xr if_bridge 4 ,
|
1995-10-26 05:36:24 +00:00
|
|
|
.Xr ip 4 ,
|
1997-06-23 22:32:13 +00:00
|
|
|
.Xr ipfirewall 4 ,
|
2005-02-07 08:51:34 +00:00
|
|
|
.Xr ng_ipfw 4 ,
|
1996-08-05 02:38:51 +00:00
|
|
|
.Xr protocols 5 ,
|
|
|
|
.Xr services 5 ,
|
1998-12-16 17:10:03 +00:00
|
|
|
.Xr init 8 ,
|
1999-04-08 13:56:25 +00:00
|
|
|
.Xr kldload 8 ,
|
1995-10-26 05:36:24 +00:00
|
|
|
.Xr reboot 8 ,
|
1997-09-29 19:11:55 +00:00
|
|
|
.Xr sysctl 8 ,
|
2000-11-15 16:44:24 +00:00
|
|
|
.Xr syslogd 8
|
2005-01-18 10:09:38 +00:00
|
|
|
.Sh HISTORY
|
|
|
|
The
|
|
|
|
.Nm
|
|
|
|
utility first appeared in
|
|
|
|
.Fx 2.0 .
|
2007-11-26 00:36:40 +00:00
|
|
|
.Nm dummynet
|
2005-01-18 10:09:38 +00:00
|
|
|
was introduced in
|
|
|
|
.Fx 2.2.8 .
|
|
|
|
Stateful extensions were introduced in
|
|
|
|
.Fx 4.0 .
|
|
|
|
.Nm ipfw2
|
|
|
|
was introduced in Summer 2002.
|
|
|
|
.Sh AUTHORS
|
|
|
|
.An Ugen J. S. Antsilevich ,
|
|
|
|
.An Poul-Henning Kamp ,
|
|
|
|
.An Alex Nash ,
|
|
|
|
.An Archie Cobbs ,
|
|
|
|
.An Luigi Rizzo .
|
|
|
|
.Pp
|
|
|
|
.An -nosplit
|
|
|
|
API based upon code written by
|
|
|
|
.An Daniel Boulet
|
|
|
|
for BSDI.
|
|
|
|
.Pp
|
2009-04-09 12:46:00 +00:00
|
|
|
Dummynet has been introduced by Luigi Rizzo in 1997-1998.
|
|
|
|
.Pp
|
2009-04-08 15:18:21 +00:00
|
|
|
Some early work (1999-2000) on the
|
|
|
|
.Nm dummynet
|
|
|
|
traffic shaper supported by Akamba Corp.
|
|
|
|
.Pp
|
2009-04-09 12:46:00 +00:00
|
|
|
The ipfw core (ipfw2) has been completely redesigned and
|
2012-09-18 02:33:23 +00:00
|
|
|
reimplemented by Luigi Rizzo in summer 2002.
|
|
|
|
Further
|
2009-04-09 12:46:00 +00:00
|
|
|
actions and
|
|
|
|
options have been added by various developer over the years.
|
|
|
|
.Pp
|
2006-12-29 21:59:17 +00:00
|
|
|
.An -nosplit
|
|
|
|
In-kernel NAT support written by
|
2014-06-20 09:40:43 +00:00
|
|
|
.An Paolo Pisati Aq Mt piso@FreeBSD.org
|
2006-12-29 21:59:17 +00:00
|
|
|
as part of a Summer of Code 2005 project.
|
|
|
|
.Pp
|
2009-03-19 10:42:07 +00:00
|
|
|
SCTP
|
2009-02-07 18:49:42 +00:00
|
|
|
.Nm nat
|
|
|
|
support has been developed by
|
|
|
|
.An The Centre for Advanced Internet Architectures (CAIA) Aq http://www.caia.swin.edu.au .
|
|
|
|
The primary developers and maintainers are David Hayes and Jason But.
|
|
|
|
For further information visit:
|
|
|
|
.Aq http://www.caia.swin.edu.au/urp/SONATA
|
2009-04-09 12:46:00 +00:00
|
|
|
.Pp
|
|
|
|
Delay profiles have been developed by Alessandro Cerri and
|
|
|
|
Luigi Rizzo, supported by the
|
|
|
|
European Commission within Projects Onelab and Onelab2.
|
1994-11-17 09:50:30 +00:00
|
|
|
.Sh BUGS
|
2002-08-16 14:27:22 +00:00
|
|
|
The syntax has grown over the years and sometimes it might be confusing.
|
|
|
|
Unfortunately, backward compatibility prevents cleaning up mistakes
|
2002-10-28 07:03:56 +00:00
|
|
|
made in the definition of the syntax.
|
2000-01-08 11:19:19 +00:00
|
|
|
.Pp
|
2002-08-16 14:27:22 +00:00
|
|
|
.Em !!! WARNING !!!
|
1995-10-26 05:36:24 +00:00
|
|
|
.Pp
|
2002-08-10 15:04:40 +00:00
|
|
|
Misconfiguring the firewall can put your computer in an unusable state,
|
|
|
|
possibly shutting down network services and requiring console access to
|
2002-10-28 07:03:56 +00:00
|
|
|
regain control of it.
|
1997-06-02 05:02:37 +00:00
|
|
|
.Pp
|
|
|
|
Incoming packet fragments diverted by
|
2000-02-28 15:21:12 +00:00
|
|
|
.Cm divert
|
1999-12-06 01:00:24 +00:00
|
|
|
are reassembled before delivery to the socket.
|
2002-08-10 15:04:40 +00:00
|
|
|
The action used on those packet is the one from the
|
|
|
|
rule which matches the first fragment of the packet.
|
1997-06-23 22:32:13 +00:00
|
|
|
.Pp
|
2002-01-03 01:00:23 +00:00
|
|
|
Packets diverted to userland, and then reinserted by a userland process
|
2003-07-08 13:24:42 +00:00
|
|
|
may lose various packet attributes.
|
|
|
|
The packet source interface name
|
|
|
|
will be preserved if it is shorter than 8 bytes and the userland process
|
|
|
|
saves and reuses the sockaddr_in
|
|
|
|
(as does
|
|
|
|
.Xr natd 8 ) ;
|
|
|
|
otherwise, it may be lost.
|
2002-01-03 01:00:23 +00:00
|
|
|
If a packet is reinserted in this manner, later rules may be incorrectly
|
|
|
|
applied, making the order of
|
|
|
|
.Cm divert
|
|
|
|
rules in the rule sequence very important.
|
2005-04-18 18:35:05 +00:00
|
|
|
.Pp
|
|
|
|
Dummynet drops all packets with IPv6 link-local addresses.
|
2005-07-01 09:51:10 +00:00
|
|
|
.Pp
|
|
|
|
Rules using
|
|
|
|
.Cm uid
|
|
|
|
or
|
|
|
|
.Cm gid
|
2005-07-01 10:04:33 +00:00
|
|
|
may not behave as expected.
|
|
|
|
In particular, incoming SYN packets may
|
2005-07-01 09:51:10 +00:00
|
|
|
have no uid or gid associated with them since they do not yet belong
|
2005-07-01 10:04:33 +00:00
|
|
|
to a TCP connection, and the uid/gid associated with a packet may not
|
2005-07-01 09:51:10 +00:00
|
|
|
be as expected if the associated process calls
|
|
|
|
.Xr setuid 2
|
|
|
|
or similar system calls.
|
2005-10-23 16:15:02 +00:00
|
|
|
.Pp
|
2006-10-09 22:12:08 +00:00
|
|
|
Rule syntax is subject to the command line environment and some patterns
|
|
|
|
may need to be escaped with the backslash character
|
|
|
|
or quoted appropriately.
|
2006-12-29 21:59:17 +00:00
|
|
|
.Pp
|
2012-03-29 05:02:12 +00:00
|
|
|
Due to the architecture of
|
|
|
|
.Xr libalias 3 ,
|
2009-03-19 10:42:07 +00:00
|
|
|
ipfw nat is not compatible with the TCP segmentation offloading (TSO).
|
|
|
|
Thus, to reliably nat your network traffic, please disable TSO
|
2006-12-29 21:59:17 +00:00
|
|
|
on your NICs using
|
|
|
|
.Xr ifconfig 8 .
|
2008-02-07 11:00:42 +00:00
|
|
|
.Pp
|
|
|
|
ICMP error messages are not implicitly matched by dynamic rules
|
|
|
|
for the respective conversations.
|
|
|
|
To avoid failures of network error detection and path MTU discovery,
|
|
|
|
ICMP error messages may need to be allowed explicitly through static
|
|
|
|
rules.
|
2011-06-29 10:06:58 +00:00
|
|
|
.Pp
|
|
|
|
Rules using
|
|
|
|
.Cm call
|
|
|
|
and
|
|
|
|
.Cm return
|
|
|
|
actions may lead to confusing behaviour if ruleset has mistakes,
|
|
|
|
and/or interaction with other subsystems (netgraph, dummynet, etc.) is used.
|
|
|
|
One possible case for this is packet leaving
|
|
|
|
.Nm
|
|
|
|
in subroutine on the input pass, while later on output encountering unpaired
|
|
|
|
.Cm return
|
|
|
|
first.
|
|
|
|
As the call stack is kept intact after input pass, packet will suddenly
|
|
|
|
return to the rule number used on input pass, not on output one.
|
|
|
|
Order of processing should be checked carefully to avoid such mistakes.
|