Merge branch 'master' of git://git.kernel.org/pub/scm/linux/kernel/git/klassert/ipsec-next
Steffen Klassert says: ==================== pull request (net-next): ipsec-next 2014-09-25 1) Remove useless hash_resize_mutex in xfrm_hash_resize(). This mutex is used only there, but xfrm_hash_resize() can't be called concurrently at all. From Ying Xue. 2) Extend policy hashing to prefixed policies based on prefix lenght thresholds. From Christophe Gouault. 3) Make the policy hash table thresholds configurable via netlink. From Christophe Gouault. 4) Remove the maximum authentication length for AH. This was needed to limit stack usage. We switched already to allocate space, so no need to keep the limit. From Herbert Xu. ==================== Signed-off-by: David S. Miller <davem@davemloft.net>
This commit is contained in:
David S. Miller
@@ -349,12 +349,39 @@ static inline unsigned int idx_hash(struct net *net, u32 index)
|
||||
return __idx_hash(index, net->xfrm.policy_idx_hmask);
|
||||
}
|
||||
|
||||
/* calculate policy hash thresholds */
|
||||
static void __get_hash_thresh(struct net *net,
|
||||
unsigned short family, int dir,
|
||||
u8 *dbits, u8 *sbits)
|
||||
{
|
||||
switch (family) {
|
||||
case AF_INET:
|
||||
*dbits = net->xfrm.policy_bydst[dir].dbits4;
|
||||
*sbits = net->xfrm.policy_bydst[dir].sbits4;
|
||||
break;
|
||||
|
||||
case AF_INET6:
|
||||
*dbits = net->xfrm.policy_bydst[dir].dbits6;
|
||||
*sbits = net->xfrm.policy_bydst[dir].sbits6;
|
||||
break;
|
||||
|
||||
default:
|
||||
*dbits = 0;
|
||||
*sbits = 0;
|
||||
}
|
||||
}
|
||||
|
||||
static struct hlist_head *policy_hash_bysel(struct net *net,
|
||||
const struct xfrm_selector *sel,
|
||||
unsigned short family, int dir)
|
||||
{
|
||||
unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
|
||||
unsigned int hash = __sel_hash(sel, family, hmask);
|
||||
unsigned int hash;
|
||||
u8 dbits;
|
||||
u8 sbits;
|
||||
|
||||
__get_hash_thresh(net, family, dir, &dbits, &sbits);
|
||||
hash = __sel_hash(sel, family, hmask, dbits, sbits);
|
||||
|
||||
return (hash == hmask + 1 ?
|
||||
&net->xfrm.policy_inexact[dir] :
|
||||
@@ -367,25 +394,35 @@ static struct hlist_head *policy_hash_direct(struct net *net,
|
||||
unsigned short family, int dir)
|
||||
{
|
||||
unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
|
||||
unsigned int hash = __addr_hash(daddr, saddr, family, hmask);
|
||||
unsigned int hash;
|
||||
u8 dbits;
|
||||
u8 sbits;
|
||||
|
||||
__get_hash_thresh(net, family, dir, &dbits, &sbits);
|
||||
hash = __addr_hash(daddr, saddr, family, hmask, dbits, sbits);
|
||||
|
||||
return net->xfrm.policy_bydst[dir].table + hash;
|
||||
}
|
||||
|
||||
static void xfrm_dst_hash_transfer(struct hlist_head *list,
|
||||
static void xfrm_dst_hash_transfer(struct net *net,
|
||||
struct hlist_head *list,
|
||||
struct hlist_head *ndsttable,
|
||||
unsigned int nhashmask)
|
||||
unsigned int nhashmask,
|
||||
int dir)
|
||||
{
|
||||
struct hlist_node *tmp, *entry0 = NULL;
|
||||
struct xfrm_policy *pol;
|
||||
unsigned int h0 = 0;
|
||||
u8 dbits;
|
||||
u8 sbits;
|
||||
|
||||
redo:
|
||||
hlist_for_each_entry_safe(pol, tmp, list, bydst) {
|
||||
unsigned int h;
|
||||
|
||||
__get_hash_thresh(net, pol->family, dir, &dbits, &sbits);
|
||||
h = __addr_hash(&pol->selector.daddr, &pol->selector.saddr,
|
||||
pol->family, nhashmask);
|
||||
pol->family, nhashmask, dbits, sbits);
|
||||
if (!entry0) {
|
||||
hlist_del(&pol->bydst);
|
||||
hlist_add_head(&pol->bydst, ndsttable+h);
|
||||
@@ -439,7 +476,7 @@ static void xfrm_bydst_resize(struct net *net, int dir)
|
||||
write_lock_bh(&net->xfrm.xfrm_policy_lock);
|
||||
|
||||
for (i = hmask; i >= 0; i--)
|
||||
xfrm_dst_hash_transfer(odst + i, ndst, nhashmask);
|
||||
xfrm_dst_hash_transfer(net, odst + i, ndst, nhashmask, dir);
|
||||
|
||||
net->xfrm.policy_bydst[dir].table = ndst;
|
||||
net->xfrm.policy_bydst[dir].hmask = nhashmask;
|
||||
@@ -534,6 +571,86 @@ static void xfrm_hash_resize(struct work_struct *work)
|
||||
mutex_unlock(&hash_resize_mutex);
|
||||
}
|
||||
|
||||
static void xfrm_hash_rebuild(struct work_struct *work)
|
||||
{
|
||||
struct net *net = container_of(work, struct net,
|
||||
xfrm.policy_hthresh.work);
|
||||
unsigned int hmask;
|
||||
struct xfrm_policy *pol;
|
||||
struct xfrm_policy *policy;
|
||||
struct hlist_head *chain;
|
||||
struct hlist_head *odst;
|
||||
struct hlist_node *newpos;
|
||||
int i;
|
||||
int dir;
|
||||
unsigned seq;
|
||||
u8 lbits4, rbits4, lbits6, rbits6;
|
||||
|
||||
mutex_lock(&hash_resize_mutex);
|
||||
|
||||
/* read selector prefixlen thresholds */
|
||||
do {
|
||||
seq = read_seqbegin(&net->xfrm.policy_hthresh.lock);
|
||||
|
||||
lbits4 = net->xfrm.policy_hthresh.lbits4;
|
||||
rbits4 = net->xfrm.policy_hthresh.rbits4;
|
||||
lbits6 = net->xfrm.policy_hthresh.lbits6;
|
||||
rbits6 = net->xfrm.policy_hthresh.rbits6;
|
||||
} while (read_seqretry(&net->xfrm.policy_hthresh.lock, seq));
|
||||
|
||||
write_lock_bh(&net->xfrm.xfrm_policy_lock);
|
||||
|
||||
/* reset the bydst and inexact table in all directions */
|
||||
for (dir = 0; dir < XFRM_POLICY_MAX * 2; dir++) {
|
||||
INIT_HLIST_HEAD(&net->xfrm.policy_inexact[dir]);
|
||||
hmask = net->xfrm.policy_bydst[dir].hmask;
|
||||
odst = net->xfrm.policy_bydst[dir].table;
|
||||
for (i = hmask; i >= 0; i--)
|
||||
INIT_HLIST_HEAD(odst + i);
|
||||
if ((dir & XFRM_POLICY_MASK) == XFRM_POLICY_OUT) {
|
||||
/* dir out => dst = remote, src = local */
|
||||
net->xfrm.policy_bydst[dir].dbits4 = rbits4;
|
||||
net->xfrm.policy_bydst[dir].sbits4 = lbits4;
|
||||
net->xfrm.policy_bydst[dir].dbits6 = rbits6;
|
||||
net->xfrm.policy_bydst[dir].sbits6 = lbits6;
|
||||
} else {
|
||||
/* dir in/fwd => dst = local, src = remote */
|
||||
net->xfrm.policy_bydst[dir].dbits4 = lbits4;
|
||||
net->xfrm.policy_bydst[dir].sbits4 = rbits4;
|
||||
net->xfrm.policy_bydst[dir].dbits6 = lbits6;
|
||||
net->xfrm.policy_bydst[dir].sbits6 = rbits6;
|
||||
}
|
||||
}
|
||||
|
||||
/* re-insert all policies by order of creation */
|
||||
list_for_each_entry_reverse(policy, &net->xfrm.policy_all, walk.all) {
|
||||
newpos = NULL;
|
||||
chain = policy_hash_bysel(net, &policy->selector,
|
||||
policy->family,
|
||||
xfrm_policy_id2dir(policy->index));
|
||||
hlist_for_each_entry(pol, chain, bydst) {
|
||||
if (policy->priority >= pol->priority)
|
||||
newpos = &pol->bydst;
|
||||
else
|
||||
break;
|
||||
}
|
||||
if (newpos)
|
||||
hlist_add_behind(&policy->bydst, newpos);
|
||||
else
|
||||
hlist_add_head(&policy->bydst, chain);
|
||||
}
|
||||
|
||||
write_unlock_bh(&net->xfrm.xfrm_policy_lock);
|
||||
|
||||
mutex_unlock(&hash_resize_mutex);
|
||||
}
|
||||
|
||||
void xfrm_policy_hash_rebuild(struct net *net)
|
||||
{
|
||||
schedule_work(&net->xfrm.policy_hthresh.work);
|
||||
}
|
||||
EXPORT_SYMBOL(xfrm_policy_hash_rebuild);
|
||||
|
||||
/* Generate new index... KAME seems to generate them ordered by cost
|
||||
* of an absolute inpredictability of ordering of rules. This will not pass. */
|
||||
static u32 xfrm_gen_index(struct net *net, int dir, u32 index)
|
||||
@@ -2862,10 +2979,21 @@ static int __net_init xfrm_policy_init(struct net *net)
|
||||
if (!htab->table)
|
||||
goto out_bydst;
|
||||
htab->hmask = hmask;
|
||||
htab->dbits4 = 32;
|
||||
htab->sbits4 = 32;
|
||||
htab->dbits6 = 128;
|
||||
htab->sbits6 = 128;
|
||||
}
|
||||
net->xfrm.policy_hthresh.lbits4 = 32;
|
||||
net->xfrm.policy_hthresh.rbits4 = 32;
|
||||
net->xfrm.policy_hthresh.lbits6 = 128;
|
||||
net->xfrm.policy_hthresh.rbits6 = 128;
|
||||
|
||||
seqlock_init(&net->xfrm.policy_hthresh.lock);
|
||||
|
||||
INIT_LIST_HEAD(&net->xfrm.policy_all);
|
||||
INIT_WORK(&net->xfrm.policy_hash_work, xfrm_hash_resize);
|
||||
INIT_WORK(&net->xfrm.policy_hthresh.work, xfrm_hash_rebuild);
|
||||
if (net_eq(net, &init_net))
|
||||
register_netdevice_notifier(&xfrm_dev_notifier);
|
||||
return 0;
|
||||
|
||||
Reference in New Issue
Block a user