xfrm: policy: add inexact policy search tree infrastructure

At this time inexact policies are all searched in-order until the first
match is found.  After removal of the flow cache, this resolution has
to be performed for every packetm resulting in major slowdown when
number of inexact policies is high.

This adds infrastructure to later sort inexact policies into a tree.
This only introduces a single class: any:any.

Next patch will add a search tree to pre-sort policies that
have a fixed daddr/prefixlen, so in this patch the any:any class
will still be used for all policies.

Signed-off-by: Florian Westphal <fw@strlen.de>
Acked-by: David S. Miller <davem@davemloft.net>
Signed-off-by: Steffen Klassert <steffen.klassert@secunet.com>

This commit is contained in:

Florian Westphal

2018-11-09 11:57:59 +01:00

committed by

Steffen Klassert

parent b5fe22e233

commit 6be3b0db6d

2 changed files with 249 additions and 55 deletions

									
										include/net/xfrm.h
									
		+1
		
												View File
												
				@@ -577,6 +577,7 @@ struct xfrm_policy {

					/* This lock only affects elements except for entry. */

					rwlock_t		lock;

					refcount_t		refcnt;

					u32			pos;

					struct timer_list	timer;

					atomic_t		genid;