diff options
author | David S. Miller <davem@sunset.davemloft.net> | 2006-08-22 02:54:55 -0400 |
---|---|---|
committer | David S. Miller <davem@sunset.davemloft.net> | 2006-09-22 17:55:10 -0400 |
commit | e9ce1cd3cf6cf35b21d0ce990f2e738f35907386 (patch) | |
tree | 22a3ee7b78ae7cbf00520c66dcc389d87740069c /net/sched/act_pedit.c | |
parent | 2e4ca75b31b6851dcc036c2cdebf3ecfe279a653 (diff) |
[PKT_SCHED]: Kill pkt_act.h inlining.
This was simply making templates of functions and mostly causing a lot
of code duplication in the classifier action modules.
We solve this more cleanly by having a common "struct tcf_common" that
hash worker functions contained once in act_api.c can work with.
Callers work with real action objects that have the common struct
plus their module specific struct members. You go from a common
object to the higher level one using a "to_foo()" macro which makes
use of container_of() to do the dirty work.
This also kills off act_generic.h which was only used by act_simple.c
and keeping it around was more work than the it's value.
Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'net/sched/act_pedit.c')
-rw-r--r-- | net/sched/act_pedit.c | 166 |
1 files changed, 72 insertions, 94 deletions
diff --git a/net/sched/act_pedit.c b/net/sched/act_pedit.c index f257475e0e0c..8ac65c219b98 100644 --- a/net/sched/act_pedit.c +++ b/net/sched/act_pedit.c | |||
@@ -33,32 +33,25 @@ | |||
33 | #include <linux/tc_act/tc_pedit.h> | 33 | #include <linux/tc_act/tc_pedit.h> |
34 | #include <net/tc_act/tc_pedit.h> | 34 | #include <net/tc_act/tc_pedit.h> |
35 | 35 | ||
36 | 36 | #define PEDIT_TAB_MASK 15 | |
37 | #define PEDIT_DEB 1 | 37 | static struct tcf_common *tcf_pedit_ht[PEDIT_TAB_MASK + 1]; |
38 | 38 | static u32 pedit_idx_gen; | |
39 | /* use generic hash table */ | ||
40 | #define MY_TAB_SIZE 16 | ||
41 | #define MY_TAB_MASK 15 | ||
42 | static u32 idx_gen; | ||
43 | static struct tcf_pedit *tcf_pedit_ht[MY_TAB_SIZE]; | ||
44 | static DEFINE_RWLOCK(pedit_lock); | 39 | static DEFINE_RWLOCK(pedit_lock); |
45 | 40 | ||
46 | #define tcf_st tcf_pedit | 41 | static struct tcf_hashinfo pedit_hash_info = { |
47 | #define tc_st tc_pedit | 42 | .htab = tcf_pedit_ht, |
48 | #define tcf_t_lock pedit_lock | 43 | .hmask = PEDIT_TAB_MASK, |
49 | #define tcf_ht tcf_pedit_ht | 44 | .lock = &pedit_lock, |
50 | 45 | }; | |
51 | #define CONFIG_NET_ACT_INIT 1 | ||
52 | #include <net/pkt_act.h> | ||
53 | 46 | ||
54 | static int | 47 | static int tcf_pedit_init(struct rtattr *rta, struct rtattr *est, |
55 | tcf_pedit_init(struct rtattr *rta, struct rtattr *est, struct tc_action *a, | 48 | struct tc_action *a, int ovr, int bind) |
56 | int ovr, int bind) | ||
57 | { | 49 | { |
58 | struct rtattr *tb[TCA_PEDIT_MAX]; | 50 | struct rtattr *tb[TCA_PEDIT_MAX]; |
59 | struct tc_pedit *parm; | 51 | struct tc_pedit *parm; |
60 | int ret = 0; | 52 | int ret = 0; |
61 | struct tcf_pedit *p; | 53 | struct tcf_pedit *p; |
54 | struct tcf_common *pc; | ||
62 | struct tc_pedit_key *keys = NULL; | 55 | struct tc_pedit_key *keys = NULL; |
63 | int ksize; | 56 | int ksize; |
64 | 57 | ||
@@ -73,54 +66,56 @@ tcf_pedit_init(struct rtattr *rta, struct rtattr *est, struct tc_action *a, | |||
73 | if (RTA_PAYLOAD(tb[TCA_PEDIT_PARMS-1]) < sizeof(*parm) + ksize) | 66 | if (RTA_PAYLOAD(tb[TCA_PEDIT_PARMS-1]) < sizeof(*parm) + ksize) |
74 | return -EINVAL; | 67 | return -EINVAL; |
75 | 68 | ||
76 | p = tcf_hash_check(parm->index, a, ovr, bind); | 69 | pc = tcf_hash_check(parm->index, a, bind, &pedit_hash_info); |
77 | if (p == NULL) { | 70 | if (!pc) { |
78 | if (!parm->nkeys) | 71 | if (!parm->nkeys) |
79 | return -EINVAL; | 72 | return -EINVAL; |
80 | p = tcf_hash_create(parm->index, est, a, sizeof(*p), ovr, bind); | 73 | pc = tcf_hash_create(parm->index, est, a, sizeof(*p), bind, |
81 | if (p == NULL) | 74 | &pedit_idx_gen, &pedit_hash_info); |
75 | if (unlikely(!pc)) | ||
82 | return -ENOMEM; | 76 | return -ENOMEM; |
77 | p = to_pedit(pc); | ||
83 | keys = kmalloc(ksize, GFP_KERNEL); | 78 | keys = kmalloc(ksize, GFP_KERNEL); |
84 | if (keys == NULL) { | 79 | if (keys == NULL) { |
85 | kfree(p); | 80 | kfree(pc); |
86 | return -ENOMEM; | 81 | return -ENOMEM; |
87 | } | 82 | } |
88 | ret = ACT_P_CREATED; | 83 | ret = ACT_P_CREATED; |
89 | } else { | 84 | } else { |
85 | p = to_pedit(pc); | ||
90 | if (!ovr) { | 86 | if (!ovr) { |
91 | tcf_hash_release(p, bind); | 87 | tcf_hash_release(pc, bind, &pedit_hash_info); |
92 | return -EEXIST; | 88 | return -EEXIST; |
93 | } | 89 | } |
94 | if (p->nkeys && p->nkeys != parm->nkeys) { | 90 | if (p->tcfp_nkeys && p->tcfp_nkeys != parm->nkeys) { |
95 | keys = kmalloc(ksize, GFP_KERNEL); | 91 | keys = kmalloc(ksize, GFP_KERNEL); |
96 | if (keys == NULL) | 92 | if (keys == NULL) |
97 | return -ENOMEM; | 93 | return -ENOMEM; |
98 | } | 94 | } |
99 | } | 95 | } |
100 | 96 | ||
101 | spin_lock_bh(&p->lock); | 97 | spin_lock_bh(&p->tcf_lock); |
102 | p->flags = parm->flags; | 98 | p->tcfp_flags = parm->flags; |
103 | p->action = parm->action; | 99 | p->tcf_action = parm->action; |
104 | if (keys) { | 100 | if (keys) { |
105 | kfree(p->keys); | 101 | kfree(p->tcfp_keys); |
106 | p->keys = keys; | 102 | p->tcfp_keys = keys; |
107 | p->nkeys = parm->nkeys; | 103 | p->tcfp_nkeys = parm->nkeys; |
108 | } | 104 | } |
109 | memcpy(p->keys, parm->keys, ksize); | 105 | memcpy(p->tcfp_keys, parm->keys, ksize); |
110 | spin_unlock_bh(&p->lock); | 106 | spin_unlock_bh(&p->tcf_lock); |
111 | if (ret == ACT_P_CREATED) | 107 | if (ret == ACT_P_CREATED) |
112 | tcf_hash_insert(p); | 108 | tcf_hash_insert(pc, &pedit_hash_info); |
113 | return ret; | 109 | return ret; |
114 | } | 110 | } |
115 | 111 | ||
116 | static int | 112 | static int tcf_pedit_cleanup(struct tc_action *a, int bind) |
117 | tcf_pedit_cleanup(struct tc_action *a, int bind) | ||
118 | { | 113 | { |
119 | struct tcf_pedit *p = PRIV(a, pedit); | 114 | struct tcf_pedit *p = a->priv; |
120 | 115 | ||
121 | if (p != NULL) { | 116 | if (p) { |
122 | struct tc_pedit_key *keys = p->keys; | 117 | struct tc_pedit_key *keys = p->tcfp_keys; |
123 | if (tcf_hash_release(p, bind)) { | 118 | if (tcf_hash_release(&p->common, bind, &pedit_hash_info)) { |
124 | kfree(keys); | 119 | kfree(keys); |
125 | return 1; | 120 | return 1; |
126 | } | 121 | } |
@@ -128,30 +123,30 @@ tcf_pedit_cleanup(struct tc_action *a, int bind) | |||
128 | return 0; | 123 | return 0; |
129 | } | 124 | } |
130 | 125 | ||
131 | static int | 126 | static int tcf_pedit(struct sk_buff *skb, struct tc_action *a, |
132 | tcf_pedit(struct sk_buff *skb, struct tc_action *a, struct tcf_result *res) | 127 | struct tcf_result *res) |
133 | { | 128 | { |
134 | struct tcf_pedit *p = PRIV(a, pedit); | 129 | struct tcf_pedit *p = a->priv; |
135 | int i, munged = 0; | 130 | int i, munged = 0; |
136 | u8 *pptr; | 131 | u8 *pptr; |
137 | 132 | ||
138 | if (!(skb->tc_verd & TC_OK2MUNGE)) { | 133 | if (!(skb->tc_verd & TC_OK2MUNGE)) { |
139 | /* should we set skb->cloned? */ | 134 | /* should we set skb->cloned? */ |
140 | if (pskb_expand_head(skb, 0, 0, GFP_ATOMIC)) { | 135 | if (pskb_expand_head(skb, 0, 0, GFP_ATOMIC)) { |
141 | return p->action; | 136 | return p->tcf_action; |
142 | } | 137 | } |
143 | } | 138 | } |
144 | 139 | ||
145 | pptr = skb->nh.raw; | 140 | pptr = skb->nh.raw; |
146 | 141 | ||
147 | spin_lock(&p->lock); | 142 | spin_lock(&p->tcf_lock); |
148 | 143 | ||
149 | p->tm.lastuse = jiffies; | 144 | p->tcf_tm.lastuse = jiffies; |
150 | 145 | ||
151 | if (p->nkeys > 0) { | 146 | if (p->tcfp_nkeys > 0) { |
152 | struct tc_pedit_key *tkey = p->keys; | 147 | struct tc_pedit_key *tkey = p->tcfp_keys; |
153 | 148 | ||
154 | for (i = p->nkeys; i > 0; i--, tkey++) { | 149 | for (i = p->tcfp_nkeys; i > 0; i--, tkey++) { |
155 | u32 *ptr; | 150 | u32 *ptr; |
156 | int offset = tkey->off; | 151 | int offset = tkey->off; |
157 | 152 | ||
@@ -169,7 +164,8 @@ tcf_pedit(struct sk_buff *skb, struct tc_action *a, struct tcf_result *res) | |||
169 | printk("offset must be on 32 bit boundaries\n"); | 164 | printk("offset must be on 32 bit boundaries\n"); |
170 | goto bad; | 165 | goto bad; |
171 | } | 166 | } |
172 | if (skb->len < 0 || (offset > 0 && offset > skb->len)) { | 167 | if (skb->len < 0 || |
168 | (offset > 0 && offset > skb->len)) { | ||
173 | printk("offset %d cant exceed pkt length %d\n", | 169 | printk("offset %d cant exceed pkt length %d\n", |
174 | offset, skb->len); | 170 | offset, skb->len); |
175 | goto bad; | 171 | goto bad; |
@@ -185,63 +181,47 @@ tcf_pedit(struct sk_buff *skb, struct tc_action *a, struct tcf_result *res) | |||
185 | skb->tc_verd = SET_TC_MUNGED(skb->tc_verd); | 181 | skb->tc_verd = SET_TC_MUNGED(skb->tc_verd); |
186 | goto done; | 182 | goto done; |
187 | } else { | 183 | } else { |
188 | printk("pedit BUG: index %d\n",p->index); | 184 | printk("pedit BUG: index %d\n", p->tcf_index); |
189 | } | 185 | } |
190 | 186 | ||
191 | bad: | 187 | bad: |
192 | p->qstats.overlimits++; | 188 | p->tcf_qstats.overlimits++; |
193 | done: | 189 | done: |
194 | p->bstats.bytes += skb->len; | 190 | p->tcf_bstats.bytes += skb->len; |
195 | p->bstats.packets++; | 191 | p->tcf_bstats.packets++; |
196 | spin_unlock(&p->lock); | 192 | spin_unlock(&p->tcf_lock); |
197 | return p->action; | 193 | return p->tcf_action; |
198 | } | 194 | } |
199 | 195 | ||
200 | static int | 196 | static int tcf_pedit_dump(struct sk_buff *skb, struct tc_action *a, |
201 | tcf_pedit_dump(struct sk_buff *skb, struct tc_action *a,int bind, int ref) | 197 | int bind, int ref) |
202 | { | 198 | { |
203 | unsigned char *b = skb->tail; | 199 | unsigned char *b = skb->tail; |
200 | struct tcf_pedit *p = a->priv; | ||
204 | struct tc_pedit *opt; | 201 | struct tc_pedit *opt; |
205 | struct tcf_pedit *p = PRIV(a, pedit); | ||
206 | struct tcf_t t; | 202 | struct tcf_t t; |
207 | int s; | 203 | int s; |
208 | 204 | ||
209 | s = sizeof(*opt) + p->nkeys * sizeof(struct tc_pedit_key); | 205 | s = sizeof(*opt) + p->tcfp_nkeys * sizeof(struct tc_pedit_key); |
210 | 206 | ||
211 | /* netlink spinlocks held above us - must use ATOMIC */ | 207 | /* netlink spinlocks held above us - must use ATOMIC */ |
212 | opt = kzalloc(s, GFP_ATOMIC); | 208 | opt = kzalloc(s, GFP_ATOMIC); |
213 | if (opt == NULL) | 209 | if (unlikely(!opt)) |
214 | return -ENOBUFS; | 210 | return -ENOBUFS; |
215 | 211 | ||
216 | memcpy(opt->keys, p->keys, p->nkeys * sizeof(struct tc_pedit_key)); | 212 | memcpy(opt->keys, p->tcfp_keys, |
217 | opt->index = p->index; | 213 | p->tcfp_nkeys * sizeof(struct tc_pedit_key)); |
218 | opt->nkeys = p->nkeys; | 214 | opt->index = p->tcf_index; |
219 | opt->flags = p->flags; | 215 | opt->nkeys = p->tcfp_nkeys; |
220 | opt->action = p->action; | 216 | opt->flags = p->tcfp_flags; |
221 | opt->refcnt = p->refcnt - ref; | 217 | opt->action = p->tcf_action; |
222 | opt->bindcnt = p->bindcnt - bind; | 218 | opt->refcnt = p->tcf_refcnt - ref; |
223 | 219 | opt->bindcnt = p->tcf_bindcnt - bind; | |
224 | |||
225 | #ifdef PEDIT_DEB | ||
226 | { | ||
227 | /* Debug - get rid of later */ | ||
228 | int i; | ||
229 | struct tc_pedit_key *key = opt->keys; | ||
230 | |||
231 | for (i=0; i<opt->nkeys; i++, key++) { | ||
232 | printk( "\n key #%d",i); | ||
233 | printk( " at %d: val %08x mask %08x", | ||
234 | (unsigned int)key->off, | ||
235 | (unsigned int)key->val, | ||
236 | (unsigned int)key->mask); | ||
237 | } | ||
238 | } | ||
239 | #endif | ||
240 | 220 | ||
241 | RTA_PUT(skb, TCA_PEDIT_PARMS, s, opt); | 221 | RTA_PUT(skb, TCA_PEDIT_PARMS, s, opt); |
242 | t.install = jiffies_to_clock_t(jiffies - p->tm.install); | 222 | t.install = jiffies_to_clock_t(jiffies - p->tcf_tm.install); |
243 | t.lastuse = jiffies_to_clock_t(jiffies - p->tm.lastuse); | 223 | t.lastuse = jiffies_to_clock_t(jiffies - p->tcf_tm.lastuse); |
244 | t.expires = jiffies_to_clock_t(p->tm.expires); | 224 | t.expires = jiffies_to_clock_t(p->tcf_tm.expires); |
245 | RTA_PUT(skb, TCA_PEDIT_TM, sizeof(t), &t); | 225 | RTA_PUT(skb, TCA_PEDIT_TM, sizeof(t), &t); |
246 | kfree(opt); | 226 | kfree(opt); |
247 | return skb->len; | 227 | return skb->len; |
@@ -252,9 +232,9 @@ rtattr_failure: | |||
252 | return -1; | 232 | return -1; |
253 | } | 233 | } |
254 | 234 | ||
255 | static | 235 | static struct tc_action_ops act_pedit_ops = { |
256 | struct tc_action_ops act_pedit_ops = { | ||
257 | .kind = "pedit", | 236 | .kind = "pedit", |
237 | .hinfo = &pedit_hash_info, | ||
258 | .type = TCA_ACT_PEDIT, | 238 | .type = TCA_ACT_PEDIT, |
259 | .capab = TCA_CAP_NONE, | 239 | .capab = TCA_CAP_NONE, |
260 | .owner = THIS_MODULE, | 240 | .owner = THIS_MODULE, |
@@ -270,14 +250,12 @@ MODULE_AUTHOR("Jamal Hadi Salim(2002-4)"); | |||
270 | MODULE_DESCRIPTION("Generic Packet Editor actions"); | 250 | MODULE_DESCRIPTION("Generic Packet Editor actions"); |
271 | MODULE_LICENSE("GPL"); | 251 | MODULE_LICENSE("GPL"); |
272 | 252 | ||
273 | static int __init | 253 | static int __init pedit_init_module(void) |
274 | pedit_init_module(void) | ||
275 | { | 254 | { |
276 | return tcf_register_action(&act_pedit_ops); | 255 | return tcf_register_action(&act_pedit_ops); |
277 | } | 256 | } |
278 | 257 | ||
279 | static void __exit | 258 | static void __exit pedit_cleanup_module(void) |
280 | pedit_cleanup_module(void) | ||
281 | { | 259 | { |
282 | tcf_unregister_action(&act_pedit_ops); | 260 | tcf_unregister_action(&act_pedit_ops); |
283 | } | 261 | } |