Date: Sun, 15 Jun 2014 22:01:00 +1000 (EST) From: Ian Smith <smithi@nimnet.asn.au> To: Julian Elischer <julian@freebsd.org> Cc: freebsd-net@freebsd.org, Michael Sierchio <kudzu@tenebras.com> Subject: Re: ipfw table matching algorithm question Message-ID: <20140615215526.U609@sola.nimnet.asn.au> In-Reply-To: <539D70BB.70203@freebsd.org> References: <CAHu1Y73LrdrWTZ4D_q=x67D3OdG9QpCy952-piwN0j6HRNsG9Q@mail.gmail.com> <539C9BD5.70302@FreeBSD.org> <539D70BB.70203@freebsd.org>
next in thread | previous in thread | raw e-mail | index | archive | help
On Sun, 15 Jun 2014 18:08:59 +0800, Julian Elischer wrote: > On 6/15/14, 3:00 AM, Alexander V. Chernikov wrote: > > On 14.06.2014 21:35, Michael Sierchio wrote: > > > Luigi - > > > > > > Does table entry matching use a longest prefix match? > > I'm not Luigi, but the answer is "yes" anyway :) > > this may be about to change, because tables are getting a rewrite, > but IP-based tables use the same code that the routing tables use. It'd be a bit anti-POLA for the longest prefix match behaviour to change, though, especially with some tablearg usage. Alexander? cheers, Ian
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20140615215526.U609>