> Data is represented in a generic way inside the kernel and the
quoted text
> 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@linux.ee)
--
To unsubscribe from this list: send the line "unsubscribe netdev" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html