On Sun, Jan 10, 2010 at 11:55:54PM -0800, Julian Elischer wrote:
Maxim Ignatenko wrote:
2009/12/9 Luigi Rizzo ri...@iet.unipi.it:
3. a hash version of 'table's
Right now ipfw tables are implented as routing tables, which is
great if you have to lookup a longest matching prefix, but a
Maxim Ignatenko wrote:
2009/12/9 Luigi Rizzo ri...@iet.unipi.it:
3. a hash version of 'table's
Right now ipfw tables are implented as routing tables, which is
great if you have to lookup a longest matching prefix, but a
bit overkill if you care only for ports or jail ids, and
totally
2009/12/9 Luigi Rizzo ri...@iet.unipi.it:
3. a hash version of 'table's
Right now ipfw tables are implented as routing tables, which is
great if you have to lookup a longest matching prefix, but a
bit overkill if you care only for ports or jail ids, and
totally uninteresting if you
Hi,
I would like to discuss some new features that I am going to add to ipfw.
1. A new option lookup search-key T[,V] where
search-key ::= {src-ip|dst-ip|src-port|dst-port|proto|jail|...}
This extends the existing '{dst-ip|src-ip} table(T[,V])' options,
and allows a lookup of other
