2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* net/sched/cls_basic.c Basic Packet Classifier.
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* Authors: Thomas Graf <tgraf@suug.ch>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/module.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 08:04:11 +00:00
|
|
|
#include <linux/slab.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/string.h>
|
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/rtnetlink.h>
|
|
|
|
#include <linux/skbuff.h>
|
2007-03-26 06:06:12 +00:00
|
|
|
#include <net/netlink.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <net/act_api.h>
|
|
|
|
#include <net/pkt_cls.h>
|
|
|
|
|
2011-01-19 19:26:56 +00:00
|
|
|
struct basic_head {
|
2005-04-16 22:20:36 +00:00
|
|
|
u32 hgenerator;
|
|
|
|
struct list_head flist;
|
|
|
|
};
|
|
|
|
|
2011-01-19 19:26:56 +00:00
|
|
|
struct basic_filter {
|
2005-04-16 22:20:36 +00:00
|
|
|
u32 handle;
|
|
|
|
struct tcf_exts exts;
|
|
|
|
struct tcf_ematch_tree ematches;
|
|
|
|
struct tcf_result res;
|
|
|
|
struct list_head link;
|
|
|
|
};
|
|
|
|
|
2008-02-01 02:36:18 +00:00
|
|
|
static const struct tcf_ext_map basic_ext_map = {
|
2005-04-16 22:20:36 +00:00
|
|
|
.action = TCA_BASIC_ACT,
|
|
|
|
.police = TCA_BASIC_POLICE
|
|
|
|
};
|
|
|
|
|
2011-07-05 23:25:42 +00:00
|
|
|
static int basic_classify(struct sk_buff *skb, const struct tcf_proto *tp,
|
2005-04-16 22:20:36 +00:00
|
|
|
struct tcf_result *res)
|
|
|
|
{
|
|
|
|
int r;
|
|
|
|
struct basic_head *head = (struct basic_head *) tp->root;
|
|
|
|
struct basic_filter *f;
|
|
|
|
|
|
|
|
list_for_each_entry(f, &head->flist, link) {
|
|
|
|
if (!tcf_em_tree_match(skb, &f->ematches, NULL))
|
|
|
|
continue;
|
|
|
|
*res = f->res;
|
|
|
|
r = tcf_exts_exec(skb, &f->exts, res);
|
|
|
|
if (r < 0)
|
|
|
|
continue;
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned long basic_get(struct tcf_proto *tp, u32 handle)
|
|
|
|
{
|
|
|
|
unsigned long l = 0UL;
|
|
|
|
struct basic_head *head = (struct basic_head *) tp->root;
|
|
|
|
struct basic_filter *f;
|
|
|
|
|
|
|
|
if (head == NULL)
|
|
|
|
return 0UL;
|
|
|
|
|
|
|
|
list_for_each_entry(f, &head->flist, link)
|
|
|
|
if (f->handle == handle)
|
|
|
|
l = (unsigned long) f;
|
|
|
|
|
|
|
|
return l;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void basic_put(struct tcf_proto *tp, unsigned long f)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
static int basic_init(struct tcf_proto *tp)
|
|
|
|
{
|
2007-03-25 05:13:06 +00:00
|
|
|
struct basic_head *head;
|
|
|
|
|
|
|
|
head = kzalloc(sizeof(*head), GFP_KERNEL);
|
|
|
|
if (head == NULL)
|
|
|
|
return -ENOBUFS;
|
|
|
|
INIT_LIST_HEAD(&head->flist);
|
|
|
|
tp->root = head;
|
2005-04-16 22:20:36 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-01-19 19:26:56 +00:00
|
|
|
static void basic_delete_filter(struct tcf_proto *tp, struct basic_filter *f)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
tcf_unbind_filter(tp, &f->res);
|
|
|
|
tcf_exts_destroy(tp, &f->exts);
|
|
|
|
tcf_em_tree_destroy(tp, &f->ematches);
|
|
|
|
kfree(f);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void basic_destroy(struct tcf_proto *tp)
|
|
|
|
{
|
2008-11-19 08:03:09 +00:00
|
|
|
struct basic_head *head = tp->root;
|
2005-04-16 22:20:36 +00:00
|
|
|
struct basic_filter *f, *n;
|
2007-02-09 14:25:16 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
list_for_each_entry_safe(f, n, &head->flist, link) {
|
|
|
|
list_del(&f->link);
|
|
|
|
basic_delete_filter(tp, f);
|
|
|
|
}
|
2007-03-30 20:36:23 +00:00
|
|
|
kfree(head);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int basic_delete(struct tcf_proto *tp, unsigned long arg)
|
|
|
|
{
|
|
|
|
struct basic_head *head = (struct basic_head *) tp->root;
|
|
|
|
struct basic_filter *t, *f = (struct basic_filter *) arg;
|
|
|
|
|
|
|
|
list_for_each_entry(t, &head->flist, link)
|
|
|
|
if (t == f) {
|
|
|
|
tcf_tree_lock(tp);
|
|
|
|
list_del(&t->link);
|
|
|
|
tcf_tree_unlock(tp);
|
|
|
|
basic_delete_filter(tp, t);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return -ENOENT;
|
|
|
|
}
|
|
|
|
|
2008-01-24 04:36:12 +00:00
|
|
|
static const struct nla_policy basic_policy[TCA_BASIC_MAX + 1] = {
|
|
|
|
[TCA_BASIC_CLASSID] = { .type = NLA_U32 },
|
|
|
|
[TCA_BASIC_EMATCHES] = { .type = NLA_NESTED },
|
|
|
|
};
|
|
|
|
|
2013-01-14 05:15:39 +00:00
|
|
|
static int basic_set_parms(struct net *net, struct tcf_proto *tp,
|
|
|
|
struct basic_filter *f, unsigned long base,
|
|
|
|
struct nlattr **tb,
|
2011-01-19 19:26:56 +00:00
|
|
|
struct nlattr *est)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2013-09-27 00:42:16 +00:00
|
|
|
int err;
|
2005-04-16 22:20:36 +00:00
|
|
|
struct tcf_exts e;
|
|
|
|
struct tcf_ematch_tree t;
|
|
|
|
|
2013-01-14 05:15:39 +00:00
|
|
|
err = tcf_exts_validate(net, tp, tb, est, &e, &basic_ext_map);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (err < 0)
|
|
|
|
return err;
|
|
|
|
|
2008-01-23 06:11:33 +00:00
|
|
|
err = tcf_em_tree_validate(tp, tb[TCA_BASIC_EMATCHES], &t);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (err < 0)
|
|
|
|
goto errout;
|
|
|
|
|
2008-01-23 06:11:33 +00:00
|
|
|
if (tb[TCA_BASIC_CLASSID]) {
|
2008-01-24 04:35:03 +00:00
|
|
|
f->res.classid = nla_get_u32(tb[TCA_BASIC_CLASSID]);
|
2005-04-16 22:20:36 +00:00
|
|
|
tcf_bind_filter(tp, &f->res, base);
|
|
|
|
}
|
|
|
|
|
|
|
|
tcf_exts_change(tp, &f->exts, &e);
|
|
|
|
tcf_em_tree_change(tp, &f->ematches, &t);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
errout:
|
|
|
|
tcf_exts_destroy(tp, &e);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2013-01-14 05:15:39 +00:00
|
|
|
static int basic_change(struct net *net, struct sk_buff *in_skb,
|
2012-05-25 19:42:45 +00:00
|
|
|
struct tcf_proto *tp, unsigned long base, u32 handle,
|
2008-01-23 06:11:33 +00:00
|
|
|
struct nlattr **tca, unsigned long *arg)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2008-01-24 04:33:32 +00:00
|
|
|
int err;
|
2005-04-16 22:20:36 +00:00
|
|
|
struct basic_head *head = (struct basic_head *) tp->root;
|
2008-01-23 06:11:33 +00:00
|
|
|
struct nlattr *tb[TCA_BASIC_MAX + 1];
|
2005-04-16 22:20:36 +00:00
|
|
|
struct basic_filter *f = (struct basic_filter *) *arg;
|
|
|
|
|
2008-01-23 06:11:33 +00:00
|
|
|
if (tca[TCA_OPTIONS] == NULL)
|
2005-04-16 22:20:36 +00:00
|
|
|
return -EINVAL;
|
|
|
|
|
2008-01-24 04:36:12 +00:00
|
|
|
err = nla_parse_nested(tb, TCA_BASIC_MAX, tca[TCA_OPTIONS],
|
|
|
|
basic_policy);
|
2008-01-24 04:33:32 +00:00
|
|
|
if (err < 0)
|
|
|
|
return err;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
if (f != NULL) {
|
|
|
|
if (handle && f->handle != handle)
|
|
|
|
return -EINVAL;
|
2013-01-14 05:15:39 +00:00
|
|
|
return basic_set_parms(net, tp, f, base, tb, tca[TCA_RATE]);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
err = -ENOBUFS;
|
2006-07-21 21:51:30 +00:00
|
|
|
f = kzalloc(sizeof(*f), GFP_KERNEL);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (f == NULL)
|
|
|
|
goto errout;
|
|
|
|
|
2013-12-16 04:15:05 +00:00
|
|
|
tcf_exts_init(&f->exts);
|
2005-04-16 22:20:36 +00:00
|
|
|
err = -EINVAL;
|
|
|
|
if (handle)
|
|
|
|
f->handle = handle;
|
|
|
|
else {
|
2006-09-27 23:19:53 +00:00
|
|
|
unsigned int i = 0x80000000;
|
2005-04-16 22:20:36 +00:00
|
|
|
do {
|
|
|
|
if (++head->hgenerator == 0x7FFFFFFF)
|
|
|
|
head->hgenerator = 1;
|
|
|
|
} while (--i > 0 && basic_get(tp, head->hgenerator));
|
|
|
|
|
|
|
|
if (i <= 0) {
|
2011-01-19 19:26:56 +00:00
|
|
|
pr_err("Insufficient number of handles\n");
|
2005-04-16 22:20:36 +00:00
|
|
|
goto errout;
|
|
|
|
}
|
|
|
|
|
|
|
|
f->handle = head->hgenerator;
|
|
|
|
}
|
|
|
|
|
2013-01-14 05:15:39 +00:00
|
|
|
err = basic_set_parms(net, tp, f, base, tb, tca[TCA_RATE]);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (err < 0)
|
|
|
|
goto errout;
|
|
|
|
|
|
|
|
tcf_tree_lock(tp);
|
|
|
|
list_add(&f->link, &head->flist);
|
|
|
|
tcf_tree_unlock(tp);
|
|
|
|
*arg = (unsigned long) f;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
errout:
|
|
|
|
if (*arg == 0UL && f)
|
|
|
|
kfree(f);
|
|
|
|
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void basic_walk(struct tcf_proto *tp, struct tcf_walker *arg)
|
|
|
|
{
|
|
|
|
struct basic_head *head = (struct basic_head *) tp->root;
|
|
|
|
struct basic_filter *f;
|
|
|
|
|
|
|
|
list_for_each_entry(f, &head->flist, link) {
|
|
|
|
if (arg->count < arg->skip)
|
|
|
|
goto skip;
|
|
|
|
|
|
|
|
if (arg->fn(tp, (unsigned long) f, arg) < 0) {
|
|
|
|
arg->stop = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
skip:
|
|
|
|
arg->count++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static int basic_dump(struct tcf_proto *tp, unsigned long fh,
|
|
|
|
struct sk_buff *skb, struct tcmsg *t)
|
|
|
|
{
|
|
|
|
struct basic_filter *f = (struct basic_filter *) fh;
|
2008-01-24 04:34:11 +00:00
|
|
|
struct nlattr *nest;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
if (f == NULL)
|
|
|
|
return skb->len;
|
|
|
|
|
|
|
|
t->tcm_handle = f->handle;
|
|
|
|
|
2008-01-24 04:34:11 +00:00
|
|
|
nest = nla_nest_start(skb, TCA_OPTIONS);
|
|
|
|
if (nest == NULL)
|
|
|
|
goto nla_put_failure;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2012-03-29 09:11:39 +00:00
|
|
|
if (f->res.classid &&
|
|
|
|
nla_put_u32(skb, TCA_BASIC_CLASSID, f->res.classid))
|
|
|
|
goto nla_put_failure;
|
2005-06-08 22:11:02 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
if (tcf_exts_dump(skb, &f->exts, &basic_ext_map) < 0 ||
|
|
|
|
tcf_em_tree_dump(skb, &f->ematches, TCA_BASIC_EMATCHES) < 0)
|
2008-01-23 06:11:33 +00:00
|
|
|
goto nla_put_failure;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2008-01-24 04:34:11 +00:00
|
|
|
nla_nest_end(skb, nest);
|
2010-11-04 11:47:04 +00:00
|
|
|
|
|
|
|
if (tcf_exts_dump_stats(skb, &f->exts, &basic_ext_map) < 0)
|
|
|
|
goto nla_put_failure;
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
return skb->len;
|
|
|
|
|
2008-01-23 06:11:33 +00:00
|
|
|
nla_put_failure:
|
2008-01-24 04:34:11 +00:00
|
|
|
nla_nest_cancel(skb, nest);
|
2005-04-16 22:20:36 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2008-01-23 06:10:42 +00:00
|
|
|
static struct tcf_proto_ops cls_basic_ops __read_mostly = {
|
2005-04-16 22:20:36 +00:00
|
|
|
.kind = "basic",
|
|
|
|
.classify = basic_classify,
|
|
|
|
.init = basic_init,
|
|
|
|
.destroy = basic_destroy,
|
|
|
|
.get = basic_get,
|
|
|
|
.put = basic_put,
|
|
|
|
.change = basic_change,
|
|
|
|
.delete = basic_delete,
|
|
|
|
.walk = basic_walk,
|
|
|
|
.dump = basic_dump,
|
|
|
|
.owner = THIS_MODULE,
|
|
|
|
};
|
|
|
|
|
|
|
|
static int __init init_basic(void)
|
|
|
|
{
|
|
|
|
return register_tcf_proto_ops(&cls_basic_ops);
|
|
|
|
}
|
|
|
|
|
2007-02-09 14:25:16 +00:00
|
|
|
static void __exit exit_basic(void)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
unregister_tcf_proto_ops(&cls_basic_ops);
|
|
|
|
}
|
|
|
|
|
|
|
|
module_init(init_basic)
|
|
|
|
module_exit(exit_basic)
|
|
|
|
MODULE_LICENSE("GPL");
|
|
|
|
|