acl: introduce DFA nodes compression (group64) for identical entries
authorKonstantin Ananyev <konstantin.ananyev@intel.com>
Tue, 20 Jan 2015 18:40:55 +0000 (18:40 +0000)
committerThomas Monjalon <thomas.monjalon@6wind.com>
Wed, 28 Jan 2015 16:11:25 +0000 (17:11 +0100)
commitec51901a0b6632556b3c2d10998d72eaf1a54141
tree7099712ffb9de3015495dd27deef2eff58598153
parentd4132664d80b312a83814368d11d098d04d9e021
acl: introduce DFA nodes compression (group64) for identical entries

Introduced division of whole 256 child transition enties
into 4 sub-groups (64 kids per group).
So 2 groups within the same node with identical children,
can use one set of transition entries.
That allows to compact some DFA nodes and get space savings in the RT table,
without any negative performance impact.
>From what I've seen an average space savings: ~20%.

Signed-off-by: Konstantin Ananyev <konstantin.ananyev@intel.com>
Acked-by: Neil Horman <nhorman@tuxdriver.com>
lib/librte_acl/acl.h
lib/librte_acl/acl_gen.c
lib/librte_acl/acl_run_scalar.c
lib/librte_acl/acl_run_sse.c