of: MSI: Simplify irqdomain lookup
[linux/fpc-iii.git] / net / sched / act_pedit.c
blobe38a7701f154c97db2070b1e0b8b54fabdb8b0f3
1 /*
2 * net/sched/act_pedit.c Generic packet editor
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version
7 * 2 of the License, or (at your option) any later version.
9 * Authors: Jamal Hadi Salim (2002-4)
12 #include <linux/types.h>
13 #include <linux/kernel.h>
14 #include <linux/string.h>
15 #include <linux/errno.h>
16 #include <linux/skbuff.h>
17 #include <linux/rtnetlink.h>
18 #include <linux/module.h>
19 #include <linux/init.h>
20 #include <linux/slab.h>
21 #include <net/netlink.h>
22 #include <net/pkt_sched.h>
23 #include <linux/tc_act/tc_pedit.h>
24 #include <net/tc_act/tc_pedit.h>
26 #define PEDIT_TAB_MASK 15
28 static const struct nla_policy pedit_policy[TCA_PEDIT_MAX + 1] = {
29 [TCA_PEDIT_PARMS] = { .len = sizeof(struct tc_pedit) },
32 static int tcf_pedit_init(struct net *net, struct nlattr *nla,
33 struct nlattr *est, struct tc_action *a,
34 int ovr, int bind)
36 struct nlattr *tb[TCA_PEDIT_MAX + 1];
37 struct tc_pedit *parm;
38 int ret = 0, err;
39 struct tcf_pedit *p;
40 struct tc_pedit_key *keys = NULL;
41 int ksize;
43 if (nla == NULL)
44 return -EINVAL;
46 err = nla_parse_nested(tb, TCA_PEDIT_MAX, nla, pedit_policy);
47 if (err < 0)
48 return err;
50 if (tb[TCA_PEDIT_PARMS] == NULL)
51 return -EINVAL;
52 parm = nla_data(tb[TCA_PEDIT_PARMS]);
53 ksize = parm->nkeys * sizeof(struct tc_pedit_key);
54 if (nla_len(tb[TCA_PEDIT_PARMS]) < sizeof(*parm) + ksize)
55 return -EINVAL;
57 if (!tcf_hash_check(parm->index, a, bind)) {
58 if (!parm->nkeys)
59 return -EINVAL;
60 ret = tcf_hash_create(parm->index, est, a, sizeof(*p),
61 bind, false);
62 if (ret)
63 return ret;
64 p = to_pedit(a);
65 keys = kmalloc(ksize, GFP_KERNEL);
66 if (keys == NULL) {
67 tcf_hash_cleanup(a, est);
68 return -ENOMEM;
70 ret = ACT_P_CREATED;
71 } else {
72 if (bind)
73 return 0;
74 tcf_hash_release(a, bind);
75 if (!ovr)
76 return -EEXIST;
77 p = to_pedit(a);
78 if (p->tcfp_nkeys && p->tcfp_nkeys != parm->nkeys) {
79 keys = kmalloc(ksize, GFP_KERNEL);
80 if (keys == NULL)
81 return -ENOMEM;
85 spin_lock_bh(&p->tcf_lock);
86 p->tcfp_flags = parm->flags;
87 p->tcf_action = parm->action;
88 if (keys) {
89 kfree(p->tcfp_keys);
90 p->tcfp_keys = keys;
91 p->tcfp_nkeys = parm->nkeys;
93 memcpy(p->tcfp_keys, parm->keys, ksize);
94 spin_unlock_bh(&p->tcf_lock);
95 if (ret == ACT_P_CREATED)
96 tcf_hash_insert(a);
97 return ret;
100 static void tcf_pedit_cleanup(struct tc_action *a, int bind)
102 struct tcf_pedit *p = a->priv;
103 struct tc_pedit_key *keys = p->tcfp_keys;
104 kfree(keys);
107 static int tcf_pedit(struct sk_buff *skb, const struct tc_action *a,
108 struct tcf_result *res)
110 struct tcf_pedit *p = a->priv;
111 int i;
112 unsigned int off;
114 if (skb_unclone(skb, GFP_ATOMIC))
115 return p->tcf_action;
117 off = skb_network_offset(skb);
119 spin_lock(&p->tcf_lock);
121 p->tcf_tm.lastuse = jiffies;
123 if (p->tcfp_nkeys > 0) {
124 struct tc_pedit_key *tkey = p->tcfp_keys;
126 for (i = p->tcfp_nkeys; i > 0; i--, tkey++) {
127 u32 *ptr, _data;
128 int offset = tkey->off;
130 if (tkey->offmask) {
131 char *d, _d;
133 d = skb_header_pointer(skb, off + tkey->at, 1,
134 &_d);
135 if (!d)
136 goto bad;
137 offset += (*d & tkey->offmask) >> tkey->shift;
140 if (offset % 4) {
141 pr_info("tc filter pedit"
142 " offset must be on 32 bit boundaries\n");
143 goto bad;
145 if (offset > 0 && offset > skb->len) {
146 pr_info("tc filter pedit"
147 " offset %d can't exceed pkt length %d\n",
148 offset, skb->len);
149 goto bad;
152 ptr = skb_header_pointer(skb, off + offset, 4, &_data);
153 if (!ptr)
154 goto bad;
155 /* just do it, baby */
156 *ptr = ((*ptr & tkey->mask) ^ tkey->val);
157 if (ptr == &_data)
158 skb_store_bits(skb, off + offset, ptr, 4);
161 goto done;
162 } else
163 WARN(1, "pedit BUG: index %d\n", p->tcf_index);
165 bad:
166 p->tcf_qstats.overlimits++;
167 done:
168 bstats_update(&p->tcf_bstats, skb);
169 spin_unlock(&p->tcf_lock);
170 return p->tcf_action;
173 static int tcf_pedit_dump(struct sk_buff *skb, struct tc_action *a,
174 int bind, int ref)
176 unsigned char *b = skb_tail_pointer(skb);
177 struct tcf_pedit *p = a->priv;
178 struct tc_pedit *opt;
179 struct tcf_t t;
180 int s;
182 s = sizeof(*opt) + p->tcfp_nkeys * sizeof(struct tc_pedit_key);
184 /* netlink spinlocks held above us - must use ATOMIC */
185 opt = kzalloc(s, GFP_ATOMIC);
186 if (unlikely(!opt))
187 return -ENOBUFS;
189 memcpy(opt->keys, p->tcfp_keys,
190 p->tcfp_nkeys * sizeof(struct tc_pedit_key));
191 opt->index = p->tcf_index;
192 opt->nkeys = p->tcfp_nkeys;
193 opt->flags = p->tcfp_flags;
194 opt->action = p->tcf_action;
195 opt->refcnt = p->tcf_refcnt - ref;
196 opt->bindcnt = p->tcf_bindcnt - bind;
198 if (nla_put(skb, TCA_PEDIT_PARMS, s, opt))
199 goto nla_put_failure;
200 t.install = jiffies_to_clock_t(jiffies - p->tcf_tm.install);
201 t.lastuse = jiffies_to_clock_t(jiffies - p->tcf_tm.lastuse);
202 t.expires = jiffies_to_clock_t(p->tcf_tm.expires);
203 if (nla_put(skb, TCA_PEDIT_TM, sizeof(t), &t))
204 goto nla_put_failure;
205 kfree(opt);
206 return skb->len;
208 nla_put_failure:
209 nlmsg_trim(skb, b);
210 kfree(opt);
211 return -1;
214 static struct tc_action_ops act_pedit_ops = {
215 .kind = "pedit",
216 .type = TCA_ACT_PEDIT,
217 .owner = THIS_MODULE,
218 .act = tcf_pedit,
219 .dump = tcf_pedit_dump,
220 .cleanup = tcf_pedit_cleanup,
221 .init = tcf_pedit_init,
224 MODULE_AUTHOR("Jamal Hadi Salim(2002-4)");
225 MODULE_DESCRIPTION("Generic Packet Editor actions");
226 MODULE_LICENSE("GPL");
228 static int __init pedit_init_module(void)
230 return tcf_register_action(&act_pedit_ops, PEDIT_TAB_MASK);
233 static void __exit pedit_cleanup_module(void)
235 tcf_unregister_action(&act_pedit_ops);
238 module_init(pedit_init_module);
239 module_exit(pedit_cleanup_module);