Date: Thu, 26 Jul 2001 12:53:21 -0400 From: Brian Reichert <reichert@numachi.com> To: freebsd-net@freebsd.org Subject: filtering with netgraph? Message-ID: <20010726125321.D79454@numachi.com>
next in thread | raw e-mail | index | archive | help
I need to put together a bridging packet filter. I've done so in the past with bridge(4) and ipfw(8), and am willing to do so again. However, there seems to be a great deal of interest nowadays in using netgraph(4). Two things I haven't yet been able to glean from the archives (yet, pointers appreciated): - Is it currently achieveable? I get the impression from <http://www.daemonnews.org/200003/netgraph.html>; "here are many node types yet to be written: An implementation of the Dynamic Packet Filter as a netgraph node. DPF is sort of a hyper-speed JIT compiling version of BPF." that such an ability is not quite in place yet. - Would a netgraph-based bridge be limited to the set of interfaces documented in bridge(4)? Just fishing for info... -- Brian 'you Bastard' Reichert <reichert@numachi.com> 37 Crystal Ave. #303 Daytime number: (603) 434-6842 Derry NH 03038-1713 USA Intel architecture: the left-hand path To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-net" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20010726125321.D79454>