act_skbedit.c 6.7 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13
/*
 * Copyright (c) 2008, Intel Corporation.
 *
 * This program is free software; you can redistribute it and/or modify it
 * under the terms and conditions of the GNU General Public License,
 * version 2, as published by the Free Software Foundation.
 *
 * This program is distributed in the hope it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License for
 * more details.
 *
 * You should have received a copy of the GNU General Public License along with
14
 * this program; if not, see <http://www.gnu.org/licenses/>.
15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
 *
 * Author: Alexander Duyck <alexander.h.duyck@intel.com>
 */

#include <linux/module.h>
#include <linux/init.h>
#include <linux/kernel.h>
#include <linux/skbuff.h>
#include <linux/rtnetlink.h>
#include <net/netlink.h>
#include <net/pkt_sched.h>

#include <linux/tc_act/tc_skbedit.h>
#include <net/tc_act/tc_skbedit.h>

#define SKBEDIT_TAB_MASK     15

32
static int skbedit_net_id;
33
static struct tc_action_ops act_skbedit_ops;
34

35
static int tcf_skbedit(struct sk_buff *skb, const struct tc_action *a,
36 37
		       struct tcf_result *res)
{
38
	struct tcf_skbedit *d = to_skbedit(a);
39 40

	spin_lock(&d->tcf_lock);
41
	tcf_lastuse_update(&d->tcf_tm);
42
	bstats_update(&d->tcf_bstats, skb);
43 44 45 46 47 48

	if (d->flags & SKBEDIT_F_PRIORITY)
		skb->priority = d->priority;
	if (d->flags & SKBEDIT_F_QUEUE_MAPPING &&
	    skb->dev->real_num_tx_queues > d->queue_mapping)
		skb_set_queue_mapping(skb, d->queue_mapping);
49 50
	if (d->flags & SKBEDIT_F_MARK)
		skb->mark = d->mark;
51 52
	if (d->flags & SKBEDIT_F_PTYPE)
		skb->pkt_type = d->ptype;
53 54 55 56 57 58 59 60 61

	spin_unlock(&d->tcf_lock);
	return d->tcf_action;
}

static const struct nla_policy skbedit_policy[TCA_SKBEDIT_MAX + 1] = {
	[TCA_SKBEDIT_PARMS]		= { .len = sizeof(struct tc_skbedit) },
	[TCA_SKBEDIT_PRIORITY]		= { .len = sizeof(u32) },
	[TCA_SKBEDIT_QUEUE_MAPPING]	= { .len = sizeof(u16) },
62
	[TCA_SKBEDIT_MARK]		= { .len = sizeof(u32) },
63
	[TCA_SKBEDIT_PTYPE]		= { .len = sizeof(u16) },
64 65
};

66
static int tcf_skbedit_init(struct net *net, struct nlattr *nla,
67
			    struct nlattr *est, struct tc_action **a,
68
			    int ovr, int bind)
69
{
70
	struct tc_action_net *tn = net_generic(net, skbedit_net_id);
71 72 73
	struct nlattr *tb[TCA_SKBEDIT_MAX + 1];
	struct tc_skbedit *parm;
	struct tcf_skbedit *d;
74
	u32 flags = 0, *priority = NULL, *mark = NULL;
75
	u16 *queue_mapping = NULL, *ptype = NULL;
76 77
	bool exists = false;
	int ret = 0, err;
78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97

	if (nla == NULL)
		return -EINVAL;

	err = nla_parse_nested(tb, TCA_SKBEDIT_MAX, nla, skbedit_policy);
	if (err < 0)
		return err;

	if (tb[TCA_SKBEDIT_PARMS] == NULL)
		return -EINVAL;

	if (tb[TCA_SKBEDIT_PRIORITY] != NULL) {
		flags |= SKBEDIT_F_PRIORITY;
		priority = nla_data(tb[TCA_SKBEDIT_PRIORITY]);
	}

	if (tb[TCA_SKBEDIT_QUEUE_MAPPING] != NULL) {
		flags |= SKBEDIT_F_QUEUE_MAPPING;
		queue_mapping = nla_data(tb[TCA_SKBEDIT_QUEUE_MAPPING]);
	}
98

99 100 101 102 103 104 105
	if (tb[TCA_SKBEDIT_PTYPE] != NULL) {
		ptype = nla_data(tb[TCA_SKBEDIT_PTYPE]);
		if (!skb_pkt_type_ok(*ptype))
			return -EINVAL;
		flags |= SKBEDIT_F_PTYPE;
	}

106 107 108 109 110
	if (tb[TCA_SKBEDIT_MARK] != NULL) {
		flags |= SKBEDIT_F_MARK;
		mark = nla_data(tb[TCA_SKBEDIT_MARK]);
	}

111 112
	parm = nla_data(tb[TCA_SKBEDIT_PARMS]);

113 114 115 116 117
	exists = tcf_hash_check(tn, parm->index, a, bind);
	if (exists && bind)
		return 0;

	if (!flags) {
118
		tcf_hash_release(*a, bind);
119 120 121 122
		return -EINVAL;
	}

	if (!exists) {
123
		ret = tcf_hash_create(tn, parm->index, est, a,
124
				      &act_skbedit_ops, bind, false);
125 126
		if (ret)
			return ret;
127

128
		d = to_skbedit(*a);
129 130
		ret = ACT_P_CREATED;
	} else {
131 132
		d = to_skbedit(*a);
		tcf_hash_release(*a, bind);
133
		if (!ovr)
134 135 136 137 138 139 140 141 142 143
			return -EEXIST;
	}

	spin_lock_bh(&d->tcf_lock);

	d->flags = flags;
	if (flags & SKBEDIT_F_PRIORITY)
		d->priority = *priority;
	if (flags & SKBEDIT_F_QUEUE_MAPPING)
		d->queue_mapping = *queue_mapping;
144 145
	if (flags & SKBEDIT_F_MARK)
		d->mark = *mark;
146 147
	if (flags & SKBEDIT_F_PTYPE)
		d->ptype = *ptype;
148

149 150 151 152 153
	d->tcf_action = parm->action;

	spin_unlock_bh(&d->tcf_lock);

	if (ret == ACT_P_CREATED)
154
		tcf_hash_insert(tn, *a);
155 156 157
	return ret;
}

E
Eric Dumazet 已提交
158 159
static int tcf_skbedit_dump(struct sk_buff *skb, struct tc_action *a,
			    int bind, int ref)
160 161
{
	unsigned char *b = skb_tail_pointer(skb);
162
	struct tcf_skbedit *d = to_skbedit(a);
163 164 165 166 167 168
	struct tc_skbedit opt = {
		.index   = d->tcf_index,
		.refcnt  = d->tcf_refcnt - ref,
		.bindcnt = d->tcf_bindcnt - bind,
		.action  = d->tcf_action,
	};
169 170
	struct tcf_t t;

171 172 173
	if (nla_put(skb, TCA_SKBEDIT_PARMS, sizeof(opt), &opt))
		goto nla_put_failure;
	if ((d->flags & SKBEDIT_F_PRIORITY) &&
174
	    nla_put_u32(skb, TCA_SKBEDIT_PRIORITY, d->priority))
175 176
		goto nla_put_failure;
	if ((d->flags & SKBEDIT_F_QUEUE_MAPPING) &&
177
	    nla_put_u16(skb, TCA_SKBEDIT_QUEUE_MAPPING, d->queue_mapping))
178 179
		goto nla_put_failure;
	if ((d->flags & SKBEDIT_F_MARK) &&
180
	    nla_put_u32(skb, TCA_SKBEDIT_MARK, d->mark))
181
		goto nla_put_failure;
182
	if ((d->flags & SKBEDIT_F_PTYPE) &&
183
	    nla_put_u16(skb, TCA_SKBEDIT_PTYPE, d->ptype))
184
		goto nla_put_failure;
185 186

	tcf_tm_dump(&t, &d->tcf_tm);
187
	if (nla_put_64bit(skb, TCA_SKBEDIT_TM, sizeof(t), &t, TCA_SKBEDIT_PAD))
188
		goto nla_put_failure;
189 190 191 192 193 194 195
	return skb->len;

nla_put_failure:
	nlmsg_trim(skb, b);
	return -1;
}

196 197
static int tcf_skbedit_walker(struct net *net, struct sk_buff *skb,
			      struct netlink_callback *cb, int type,
198
			      const struct tc_action_ops *ops)
199 200 201
{
	struct tc_action_net *tn = net_generic(net, skbedit_net_id);

202
	return tcf_generic_walker(tn, skb, cb, type, ops);
203 204
}

205
static int tcf_skbedit_search(struct net *net, struct tc_action **a, u32 index)
206 207 208 209 210 211
{
	struct tc_action_net *tn = net_generic(net, skbedit_net_id);

	return tcf_hash_search(tn, a, index);
}

212 213 214 215 216 217 218
static struct tc_action_ops act_skbedit_ops = {
	.kind		=	"skbedit",
	.type		=	TCA_ACT_SKBEDIT,
	.owner		=	THIS_MODULE,
	.act		=	tcf_skbedit,
	.dump		=	tcf_skbedit_dump,
	.init		=	tcf_skbedit_init,
219 220
	.walk		=	tcf_skbedit_walker,
	.lookup		=	tcf_skbedit_search,
221
	.size		=	sizeof(struct tcf_skbedit),
222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242
};

static __net_init int skbedit_init_net(struct net *net)
{
	struct tc_action_net *tn = net_generic(net, skbedit_net_id);

	return tc_action_net_init(tn, &act_skbedit_ops, SKBEDIT_TAB_MASK);
}

static void __net_exit skbedit_exit_net(struct net *net)
{
	struct tc_action_net *tn = net_generic(net, skbedit_net_id);

	tc_action_net_exit(tn);
}

static struct pernet_operations skbedit_net_ops = {
	.init = skbedit_init_net,
	.exit = skbedit_exit_net,
	.id   = &skbedit_net_id,
	.size = sizeof(struct tc_action_net),
243 244 245 246 247 248 249 250
};

MODULE_AUTHOR("Alexander Duyck, <alexander.h.duyck@intel.com>");
MODULE_DESCRIPTION("SKB Editing");
MODULE_LICENSE("GPL");

static int __init skbedit_init_module(void)
{
251
	return tcf_register_action(&act_skbedit_ops, &skbedit_net_ops);
252 253 254 255
}

static void __exit skbedit_cleanup_module(void)
{
256
	tcf_unregister_action(&act_skbedit_ops, &skbedit_net_ops);
257 258 259 260
}

module_init(skbedit_init_module);
module_exit(skbedit_cleanup_module);