[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Message-ID: <Pine.LNX.4.64.0903181332140.13734@ondatra.tartu-labor>
Date: Wed, 18 Mar 2009 14:00:16 +0200 (EET)
From: Meelis Roos <mroos@...ux.ee>
To: Patrick McHardy <kaber@...sh.net>
cc: netdev@...r.kernel.org
Subject: Re: [ANNOUNCE]: First release of nftables
> Data is represented in a generic way inside the kernel and the
> operations are defined on the generic data representations, meaning
> its possible to use any matching feature (ranges, masks, set lookups
> etc.) with any kind of data. Semantic validation of the operation is
> performed in userspace, the kernel doesn't care as long as the
> operation doesn't potentially harm the kernel.
This sounds like a "script" downloaded to kernel and interpreted during
each packet match. This toubles me some - doesn't this use more memory
accesses to achieve the same work that was done in precompiled code
before?
Have you measured the fastpath performance of kernel matching of real-life
rulesets, compared to iptables?
--
Meelis Roos (mroos@...ux.ee)
--
To unsubscribe from this list: send the line "unsubscribe netdev" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Powered by blists - more mailing lists