Date: Sat, 14 Jun 2014 23:00:37 +0400 From: "Alexander V. Chernikov" <melifaro@FreeBSD.org> To: Michael Sierchio <kudzu@tenebras.com>, "freebsd-net@freebsd.org" <freebsd-net@freebsd.org> Subject: Re: ipfw table matching algorithm question Message-ID: <539C9BD5.70302@FreeBSD.org> In-Reply-To: <CAHu1Y73LrdrWTZ4D_q=x67D3OdG9QpCy952-piwN0j6HRNsG9Q@mail.gmail.com> References: <CAHu1Y73LrdrWTZ4D_q=x67D3OdG9QpCy952-piwN0j6HRNsG9Q@mail.gmail.com>
next in thread | previous in thread | raw e-mail | index | archive | help
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 :) > > - M > _______________________________________________ > freebsd-net@freebsd.org mailing list > http://lists.freebsd.org/mailman/listinfo/freebsd-net > To unsubscribe, send any mail to "freebsd-net-unsubscribe@freebsd.org" >
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?539C9BD5.70302>