Commit 07df3fc9 authored by Jason Baron's avatar Jason Baron Committed by Pablo Neira Ayuso

netfilter: x_tables: improve limit_mt scalability

We've seen this spin_lock show up high in profiles. Let's introduce a
lockless version. I've tested this using pktgen_sample01_simple.sh.
Signed-off-by: default avatarJason Baron <jbaron@akamai.com>
Signed-off-by: default avatarPablo Neira Ayuso <pablo@netfilter.org>
parent 06f02993
...@@ -8,16 +8,14 @@ ...@@ -8,16 +8,14 @@
#include <linux/slab.h> #include <linux/slab.h>
#include <linux/module.h> #include <linux/module.h>
#include <linux/skbuff.h> #include <linux/skbuff.h>
#include <linux/spinlock.h>
#include <linux/interrupt.h> #include <linux/interrupt.h>
#include <linux/netfilter/x_tables.h> #include <linux/netfilter/x_tables.h>
#include <linux/netfilter/xt_limit.h> #include <linux/netfilter/xt_limit.h>
struct xt_limit_priv { struct xt_limit_priv {
spinlock_t lock;
unsigned long prev; unsigned long prev;
uint32_t credit; u32 credit;
}; };
MODULE_LICENSE("GPL"); MODULE_LICENSE("GPL");
...@@ -66,22 +64,31 @@ limit_mt(const struct sk_buff *skb, struct xt_action_param *par) ...@@ -66,22 +64,31 @@ limit_mt(const struct sk_buff *skb, struct xt_action_param *par)
{ {
const struct xt_rateinfo *r = par->matchinfo; const struct xt_rateinfo *r = par->matchinfo;
struct xt_limit_priv *priv = r->master; struct xt_limit_priv *priv = r->master;
unsigned long now = jiffies; unsigned long now;
u32 old_credit, new_credit, credit_increase = 0;
spin_lock_bh(&priv->lock); bool ret;
priv->credit += (now - xchg(&priv->prev, now)) * CREDITS_PER_JIFFY;
if (priv->credit > r->credit_cap) /* fastpath if there is nothing to update */
priv->credit = r->credit_cap; if ((READ_ONCE(priv->credit) < r->cost) && (READ_ONCE(priv->prev) == jiffies))
return false;
if (priv->credit >= r->cost) {
/* We're not limited. */ do {
priv->credit -= r->cost; now = jiffies;
spin_unlock_bh(&priv->lock); credit_increase += (now - xchg(&priv->prev, now)) * CREDITS_PER_JIFFY;
return true; old_credit = READ_ONCE(priv->credit);
} new_credit = old_credit;
new_credit += credit_increase;
spin_unlock_bh(&priv->lock); if (new_credit > r->credit_cap)
return false; new_credit = r->credit_cap;
if (new_credit >= r->cost) {
ret = true;
new_credit -= r->cost;
} else {
ret = false;
}
} while (cmpxchg(&priv->credit, old_credit, new_credit) != old_credit);
return ret;
} }
/* Precision saver. */ /* Precision saver. */
...@@ -122,7 +129,6 @@ static int limit_mt_check(const struct xt_mtchk_param *par) ...@@ -122,7 +129,6 @@ static int limit_mt_check(const struct xt_mtchk_param *par)
r->credit_cap = priv->credit; /* Credits full. */ r->credit_cap = priv->credit; /* Credits full. */
r->cost = user2credits(r->avg); r->cost = user2credits(r->avg);
} }
spin_lock_init(&priv->lock);
return 0; return 0;
} }
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment