Hi,
i am looking at (minor) optimizations of the ipfw code in order to reduce
the running time in the common cases.
I have a few ideas (mostly along the lines of optimizing for the
most commonly-used rules). An obvious candidate is the 'match all'
rule (all from any to any), but can people suggest other common
usage of rules in ipfw ?
cheers
luigi
-----------------------------------+-------------------------------------
Luigi RIZZO, [EMAIL PROTECTED] . Dip. di Ing. dell'Informazione
http://www.iet.unipi.it/~luigi/ . Universita` di Pisa
TEL/FAX: +39-050-568.533/522 . via Diotisalvi 2, 56126 PISA (Italy)
Mobile +39-347-0373137
-----------------------------------+-------------------------------------
To Unsubscribe: send mail to [EMAIL PROTECTED]
with "unsubscribe freebsd-current" in the body of the message
