projects / deliverable / linux.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
[NET_SCHED]: Propagate nla_parse return value
[deliverable/linux.git] / net / sched / sch_atm.c
1 /* net/sched/sch_atm.c - ATM VC selection "queueing discipline" */
2
3 /* Written 1998-2000 by Werner Almesberger, EPFL ICA */
4
5 #include <linux/module.h>
6 #include <linux/init.h>
7 #include <linux/string.h>
8 #include <linux/errno.h>
9 #include <linux/skbuff.h>
10 #include <linux/atmdev.h>
11 #include <linux/atmclip.h>
12 #include <linux/rtnetlink.h>
13 #include <linux/file.h> /* for fput */
14 #include <net/netlink.h>
15 #include <net/pkt_sched.h>
16
17 extern struct socket *sockfd_lookup(int fd, int *err); /* @@@ fix this */
18
19 /*
20 * The ATM queuing discipline provides a framework for invoking classifiers
21 * (aka "filters"), which in turn select classes of this queuing discipline.
22 * Each class maps the flow(s) it is handling to a given VC. Multiple classes
23 * may share the same VC.
24 *
25 * When creating a class, VCs are specified by passing the number of the open
26 * socket descriptor by which the calling process references the VC. The kernel
27 * keeps the VC open at least until all classes using it are removed.
28 *
29 * In this file, most functions are named atm_tc_* to avoid confusion with all
30 * the atm_* in net/atm. This naming convention differs from what's used in the
31 * rest of net/sched.
32 *
33 * Known bugs:
34 * - sometimes messes up the IP stack
35 * - any manipulations besides the few operations described in the README, are
36 * untested and likely to crash the system
37 * - should lock the flow while there is data in the queue (?)
38 */
39
40 #define VCC2FLOW(vcc) ((struct atm_flow_data *) ((vcc)->user_back))
41
42 struct atm_flow_data {
43 struct Qdisc *q; /* FIFO, TBF, etc. */
44 struct tcf_proto *filter_list;
45 struct atm_vcc *vcc; /* VCC; NULL if VCC is closed */
46 void (*old_pop)(struct atm_vcc *vcc,
47 struct sk_buff *skb); /* chaining */
48 struct atm_qdisc_data *parent; /* parent qdisc */
49 struct socket *sock; /* for closing */
50 u32 classid; /* x:y type ID */
51 int ref; /* reference count */
52 struct gnet_stats_basic bstats;
53 struct gnet_stats_queue qstats;
54 struct atm_flow_data *next;
55 struct atm_flow_data *excess; /* flow for excess traffic;
56 NULL to set CLP instead */
57 int hdr_len;
58 unsigned char hdr[0]; /* header data; MUST BE LAST */
59 };
60
61 struct atm_qdisc_data {
62 struct atm_flow_data link; /* unclassified skbs go here */
63 struct atm_flow_data *flows; /* NB: "link" is also on this
64 list */
65 struct tasklet_struct task; /* requeue tasklet */
66 };
67
68 /* ------------------------- Class/flow operations ------------------------- */
69
70 static int find_flow(struct atm_qdisc_data *qdisc, struct atm_flow_data *flow)
71 {
72 struct atm_flow_data *walk;
73
74 pr_debug("find_flow(qdisc %p,flow %p)\n", qdisc, flow);
75 for (walk = qdisc->flows; walk; walk = walk->next)
76 if (walk == flow)
77 return 1;
78 pr_debug("find_flow: not found\n");
79 return 0;
80 }
81
82 static inline struct atm_flow_data *lookup_flow(struct Qdisc *sch, u32 classid)
83 {
84 struct atm_qdisc_data *p = qdisc_priv(sch);
85 struct atm_flow_data *flow;
86
87 for (flow = p->flows; flow; flow = flow->next)
88 if (flow->classid == classid)
89 break;
90 return flow;
91 }
92
93 static int atm_tc_graft(struct Qdisc *sch, unsigned long arg,
94 struct Qdisc *new, struct Qdisc **old)
95 {
96 struct atm_qdisc_data *p = qdisc_priv(sch);
97 struct atm_flow_data *flow = (struct atm_flow_data *)arg;
98
99 pr_debug("atm_tc_graft(sch %p,[qdisc %p],flow %p,new %p,old %p)\n",
100 sch, p, flow, new, old);
101 if (!find_flow(p, flow))
102 return -EINVAL;
103 if (!new)
104 new = &noop_qdisc;
105 *old = xchg(&flow->q, new);
106 if (*old)
107 qdisc_reset(*old);
108 return 0;
109 }
110
111 static struct Qdisc *atm_tc_leaf(struct Qdisc *sch, unsigned long cl)
112 {
113 struct atm_flow_data *flow = (struct atm_flow_data *)cl;
114
115 pr_debug("atm_tc_leaf(sch %p,flow %p)\n", sch, flow);
116 return flow ? flow->q : NULL;
117 }
118
119 static unsigned long atm_tc_get(struct Qdisc *sch, u32 classid)
120 {
121 struct atm_qdisc_data *p __maybe_unused = qdisc_priv(sch);
122 struct atm_flow_data *flow;
123
124 pr_debug("atm_tc_get(sch %p,[qdisc %p],classid %x)\n", sch, p, classid);
125 flow = lookup_flow(sch, classid);
126 if (flow)
127 flow->ref++;
128 pr_debug("atm_tc_get: flow %p\n", flow);
129 return (unsigned long)flow;
130 }
131
132 static unsigned long atm_tc_bind_filter(struct Qdisc *sch,
133 unsigned long parent, u32 classid)
134 {
135 return atm_tc_get(sch, classid);
136 }
137
138 /*
139 * atm_tc_put handles all destructions, including the ones that are explicitly
140 * requested (atm_tc_destroy, etc.). The assumption here is that we never drop
141 * anything that still seems to be in use.
142 */
143 static void atm_tc_put(struct Qdisc *sch, unsigned long cl)
144 {
145 struct atm_qdisc_data *p = qdisc_priv(sch);
146 struct atm_flow_data *flow = (struct atm_flow_data *)cl;
147 struct atm_flow_data **prev;
148
149 pr_debug("atm_tc_put(sch %p,[qdisc %p],flow %p)\n", sch, p, flow);
150 if (--flow->ref)
151 return;
152 pr_debug("atm_tc_put: destroying\n");
153 for (prev = &p->flows; *prev; prev = &(*prev)->next)
154 if (*prev == flow)
155 break;
156 if (!*prev) {
157 printk(KERN_CRIT "atm_tc_put: class %p not found\n", flow);
158 return;
159 }
160 *prev = flow->next;
161 pr_debug("atm_tc_put: qdisc %p\n", flow->q);
162 qdisc_destroy(flow->q);
163 tcf_destroy_chain(flow->filter_list);
164 if (flow->sock) {
165 pr_debug("atm_tc_put: f_count %d\n",
166 file_count(flow->sock->file));
167 flow->vcc->pop = flow->old_pop;
168 sockfd_put(flow->sock);
169 }
170 if (flow->excess)
171 atm_tc_put(sch, (unsigned long)flow->excess);
172 if (flow != &p->link)
173 kfree(flow);
174 /*
175 * If flow == &p->link, the qdisc no longer works at this point and
176 * needs to be removed. (By the caller of atm_tc_put.)
177 */
178 }
179
180 static void sch_atm_pop(struct atm_vcc *vcc, struct sk_buff *skb)
181 {
182 struct atm_qdisc_data *p = VCC2FLOW(vcc)->parent;
183
184 pr_debug("sch_atm_pop(vcc %p,skb %p,[qdisc %p])\n", vcc, skb, p);
185 VCC2FLOW(vcc)->old_pop(vcc, skb);
186 tasklet_schedule(&p->task);
187 }
188
189 static const u8 llc_oui_ip[] = {
190 0xaa, /* DSAP: non-ISO */
191 0xaa, /* SSAP: non-ISO */
192 0x03, /* Ctrl: Unnumbered Information Command PDU */
193 0x00, /* OUI: EtherType */
194 0x00, 0x00,
195 0x08, 0x00
196 }; /* Ethertype IP (0800) */
197
198 static int atm_tc_change(struct Qdisc *sch, u32 classid, u32 parent,
199 struct nlattr **tca, unsigned long *arg)
200 {
201 struct atm_qdisc_data *p = qdisc_priv(sch);
202 struct atm_flow_data *flow = (struct atm_flow_data *)*arg;
203 struct atm_flow_data *excess = NULL;
204 struct nlattr *opt = tca[TCA_OPTIONS];
205 struct nlattr *tb[TCA_ATM_MAX + 1];
206 struct socket *sock;
207 int fd, error, hdr_len;
208 void *hdr;
209
210 pr_debug("atm_tc_change(sch %p,[qdisc %p],classid %x,parent %x,"
211 "flow %p,opt %p)\n", sch, p, classid, parent, flow, opt);
212 /*
213 * The concept of parents doesn't apply for this qdisc.
214 */
215 if (parent && parent != TC_H_ROOT && parent != sch->handle)
216 return -EINVAL;
217 /*
218 * ATM classes cannot be changed. In order to change properties of the
219 * ATM connection, that socket needs to be modified directly (via the
220 * native ATM API. In order to send a flow to a different VC, the old
221 * class needs to be removed and a new one added. (This may be changed
222 * later.)
223 */
224 if (flow)
225 return -EBUSY;
226 if (opt == NULL)
227 return -EINVAL;
228 error = nla_parse_nested(tb, TCA_ATM_MAX, opt, NULL);
229 if (error < 0)
230 return error;
231
232 if (!tb[TCA_ATM_FD] || nla_len(tb[TCA_ATM_FD]) < sizeof(fd))
233 return -EINVAL;
234 fd = *(int *)nla_data(tb[TCA_ATM_FD]);
235 pr_debug("atm_tc_change: fd %d\n", fd);
236 if (tb[TCA_ATM_HDR]) {
237 hdr_len = nla_len(tb[TCA_ATM_HDR]);
238 hdr = nla_data(tb[TCA_ATM_HDR]);
239 } else {
240 hdr_len = RFC1483LLC_LEN;
241 hdr = NULL; /* default LLC/SNAP for IP */
242 }
243 if (!tb[TCA_ATM_EXCESS])
244 excess = NULL;
245 else {
246 if (nla_len(tb[TCA_ATM_EXCESS]) != sizeof(u32))
247 return -EINVAL;
248 excess = (struct atm_flow_data *)
249 atm_tc_get(sch, *(u32 *)nla_data(tb[TCA_ATM_EXCESS]));
250 if (!excess)
251 return -ENOENT;
252 }
253 pr_debug("atm_tc_change: type %d, payload %d, hdr_len %d\n",
254 opt->nla_type, nla_len(opt), hdr_len);
255 sock = sockfd_lookup(fd, &error);
256 if (!sock)
257 return error; /* f_count++ */
258 pr_debug("atm_tc_change: f_count %d\n", file_count(sock->file));
259 if (sock->ops->family != PF_ATMSVC && sock->ops->family != PF_ATMPVC) {
260 error = -EPROTOTYPE;
261 goto err_out;
262 }
263 /* @@@ should check if the socket is really operational or we'll crash
264 on vcc->send */
265 if (classid) {
266 if (TC_H_MAJ(classid ^ sch->handle)) {
267 pr_debug("atm_tc_change: classid mismatch\n");
268 error = -EINVAL;
269 goto err_out;
270 }
271 if (find_flow(p, flow)) {
272 error = -EEXIST;
273 goto err_out;
274 }
275 } else {
276 int i;
277 unsigned long cl;
278
279 for (i = 1; i < 0x8000; i++) {
280 classid = TC_H_MAKE(sch->handle, 0x8000 | i);
281 cl = atm_tc_get(sch, classid);
282 if (!cl)
283 break;
284 atm_tc_put(sch, cl);
285 }
286 }
287 pr_debug("atm_tc_change: new id %x\n", classid);
288 flow = kzalloc(sizeof(struct atm_flow_data) + hdr_len, GFP_KERNEL);
289 pr_debug("atm_tc_change: flow %p\n", flow);
290 if (!flow) {
291 error = -ENOBUFS;
292 goto err_out;
293 }
294 flow->filter_list = NULL;
295 flow->q = qdisc_create_dflt(sch->dev, &pfifo_qdisc_ops, classid);
296 if (!flow->q)
297 flow->q = &noop_qdisc;
298 pr_debug("atm_tc_change: qdisc %p\n", flow->q);
299 flow->sock = sock;
300 flow->vcc = ATM_SD(sock); /* speedup */
301 flow->vcc->user_back = flow;
302 pr_debug("atm_tc_change: vcc %p\n", flow->vcc);
303 flow->old_pop = flow->vcc->pop;
304 flow->parent = p;
305 flow->vcc->pop = sch_atm_pop;
306 flow->classid = classid;
307 flow->ref = 1;
308 flow->excess = excess;
309 flow->next = p->link.next;
310 p->link.next = flow;
311 flow->hdr_len = hdr_len;
312 if (hdr)
313 memcpy(flow->hdr, hdr, hdr_len);
314 else
315 memcpy(flow->hdr, llc_oui_ip, sizeof(llc_oui_ip));
316 *arg = (unsigned long)flow;
317 return 0;
318 err_out:
319 if (excess)
320 atm_tc_put(sch, (unsigned long)excess);
321 sockfd_put(sock);
322 return error;
323 }
324
325 static int atm_tc_delete(struct Qdisc *sch, unsigned long arg)
326 {
327 struct atm_qdisc_data *p = qdisc_priv(sch);
328 struct atm_flow_data *flow = (struct atm_flow_data *)arg;
329
330 pr_debug("atm_tc_delete(sch %p,[qdisc %p],flow %p)\n", sch, p, flow);
331 if (!find_flow(qdisc_priv(sch), flow))
332 return -EINVAL;
333 if (flow->filter_list || flow == &p->link)
334 return -EBUSY;
335 /*
336 * Reference count must be 2: one for "keepalive" (set at class
337 * creation), and one for the reference held when calling delete.
338 */
339 if (flow->ref < 2) {
340 printk(KERN_ERR "atm_tc_delete: flow->ref == %d\n", flow->ref);
341 return -EINVAL;
342 }
343 if (flow->ref > 2)
344 return -EBUSY; /* catch references via excess, etc. */
345 atm_tc_put(sch, arg);
346 return 0;
347 }
348
349 static void atm_tc_walk(struct Qdisc *sch, struct qdisc_walker *walker)
350 {
351 struct atm_qdisc_data *p = qdisc_priv(sch);
352 struct atm_flow_data *flow;
353
354 pr_debug("atm_tc_walk(sch %p,[qdisc %p],walker %p)\n", sch, p, walker);
355 if (walker->stop)
356 return;
357 for (flow = p->flows; flow; flow = flow->next) {
358 if (walker->count >= walker->skip)
359 if (walker->fn(sch, (unsigned long)flow, walker) < 0) {
360 walker->stop = 1;
361 break;
362 }
363 walker->count++;
364 }
365 }
366
367 static struct tcf_proto **atm_tc_find_tcf(struct Qdisc *sch, unsigned long cl)
368 {
369 struct atm_qdisc_data *p = qdisc_priv(sch);
370 struct atm_flow_data *flow = (struct atm_flow_data *)cl;
371
372 pr_debug("atm_tc_find_tcf(sch %p,[qdisc %p],flow %p)\n", sch, p, flow);
373 return flow ? &flow->filter_list : &p->link.filter_list;
374 }
375
376 /* --------------------------- Qdisc operations ---------------------------- */
377
378 static int atm_tc_enqueue(struct sk_buff *skb, struct Qdisc *sch)
379 {
380 struct atm_qdisc_data *p = qdisc_priv(sch);
381 struct atm_flow_data *flow = NULL; /* @@@ */
382 struct tcf_result res;
383 int result;
384 int ret = NET_XMIT_POLICED;
385
386 pr_debug("atm_tc_enqueue(skb %p,sch %p,[qdisc %p])\n", skb, sch, p);
387 result = TC_POLICE_OK; /* be nice to gcc */
388 if (TC_H_MAJ(skb->priority) != sch->handle ||
389 !(flow = (struct atm_flow_data *)atm_tc_get(sch, skb->priority)))
390 for (flow = p->flows; flow; flow = flow->next)
391 if (flow->filter_list) {
392 result = tc_classify_compat(skb,
393 flow->filter_list,
394 &res);
395 if (result < 0)
396 continue;
397 flow = (struct atm_flow_data *)res.class;
398 if (!flow)
399 flow = lookup_flow(sch, res.classid);
400 break;
401 }
402 if (!flow)
403 flow = &p->link;
404 else {
405 if (flow->vcc)
406 ATM_SKB(skb)->atm_options = flow->vcc->atm_options;
407 /*@@@ looks good ... but it's not supposed to work :-) */
408 #ifdef CONFIG_NET_CLS_ACT
409 switch (result) {
410 case TC_ACT_QUEUED:
411 case TC_ACT_STOLEN:
412 kfree_skb(skb);
413 return NET_XMIT_SUCCESS;
414 case TC_ACT_SHOT:
415 kfree_skb(skb);
416 goto drop;
417 case TC_POLICE_RECLASSIFY:
418 if (flow->excess)
419 flow = flow->excess;
420 else
421 ATM_SKB(skb)->atm_options |= ATM_ATMOPT_CLP;
422 break;
423 }
424 #endif
425 }
426
427 ret = flow->q->enqueue(skb, flow->q);
428 if (ret != 0) {
429 drop: __maybe_unused
430 sch->qstats.drops++;
431 if (flow)
432 flow->qstats.drops++;
433 return ret;
434 }
435 sch->bstats.bytes += skb->len;
436 sch->bstats.packets++;
437 flow->bstats.bytes += skb->len;
438 flow->bstats.packets++;
439 /*
440 * Okay, this may seem weird. We pretend we've dropped the packet if
441 * it goes via ATM. The reason for this is that the outer qdisc
442 * expects to be able to q->dequeue the packet later on if we return
443 * success at this place. Also, sch->q.qdisc needs to reflect whether
444 * there is a packet egligible for dequeuing or not. Note that the
445 * statistics of the outer qdisc are necessarily wrong because of all
446 * this. There's currently no correct solution for this.
447 */
448 if (flow == &p->link) {
449 sch->q.qlen++;
450 return 0;
451 }
452 tasklet_schedule(&p->task);
453 return NET_XMIT_BYPASS;
454 }
455
456 /*
457 * Dequeue packets and send them over ATM. Note that we quite deliberately
458 * avoid checking net_device's flow control here, simply because sch_atm
459 * uses its own channels, which have nothing to do with any CLIP/LANE/or
460 * non-ATM interfaces.
461 */
462
463 static void sch_atm_dequeue(unsigned long data)
464 {
465 struct Qdisc *sch = (struct Qdisc *)data;
466 struct atm_qdisc_data *p = qdisc_priv(sch);
467 struct atm_flow_data *flow;
468 struct sk_buff *skb;
469
470 pr_debug("sch_atm_dequeue(sch %p,[qdisc %p])\n", sch, p);
471 for (flow = p->link.next; flow; flow = flow->next)
472 /*
473 * If traffic is properly shaped, this won't generate nasty
474 * little bursts. Otherwise, it may ... (but that's okay)
475 */
476 while ((skb = flow->q->dequeue(flow->q))) {
477 if (!atm_may_send(flow->vcc, skb->truesize)) {
478 (void)flow->q->ops->requeue(skb, flow->q);
479 break;
480 }
481 pr_debug("atm_tc_dequeue: sending on class %p\n", flow);
482 /* remove any LL header somebody else has attached */
483 skb_pull(skb, skb_network_offset(skb));
484 if (skb_headroom(skb) < flow->hdr_len) {
485 struct sk_buff *new;
486
487 new = skb_realloc_headroom(skb, flow->hdr_len);
488 dev_kfree_skb(skb);
489 if (!new)
490 continue;
491 skb = new;
492 }
493 pr_debug("sch_atm_dequeue: ip %p, data %p\n",
494 skb_network_header(skb), skb->data);
495 ATM_SKB(skb)->vcc = flow->vcc;
496 memcpy(skb_push(skb, flow->hdr_len), flow->hdr,
497 flow->hdr_len);
498 atomic_add(skb->truesize,
499 &sk_atm(flow->vcc)->sk_wmem_alloc);
500 /* atm.atm_options are already set by atm_tc_enqueue */
501 flow->vcc->send(flow->vcc, skb);
502 }
503 }
504
505 static struct sk_buff *atm_tc_dequeue(struct Qdisc *sch)
506 {
507 struct atm_qdisc_data *p = qdisc_priv(sch);
508 struct sk_buff *skb;
509
510 pr_debug("atm_tc_dequeue(sch %p,[qdisc %p])\n", sch, p);
511 tasklet_schedule(&p->task);
512 skb = p->link.q->dequeue(p->link.q);
513 if (skb)
514 sch->q.qlen--;
515 return skb;
516 }
517
518 static int atm_tc_requeue(struct sk_buff *skb, struct Qdisc *sch)
519 {
520 struct atm_qdisc_data *p = qdisc_priv(sch);
521 int ret;
522
523 pr_debug("atm_tc_requeue(skb %p,sch %p,[qdisc %p])\n", skb, sch, p);
524 ret = p->link.q->ops->requeue(skb, p->link.q);
525 if (!ret) {
526 sch->q.qlen++;
527 sch->qstats.requeues++;
528 } else {
529 sch->qstats.drops++;
530 p->link.qstats.drops++;
531 }
532 return ret;
533 }
534
535 static unsigned int atm_tc_drop(struct Qdisc *sch)
536 {
537 struct atm_qdisc_data *p = qdisc_priv(sch);
538 struct atm_flow_data *flow;
539 unsigned int len;
540
541 pr_debug("atm_tc_drop(sch %p,[qdisc %p])\n", sch, p);
542 for (flow = p->flows; flow; flow = flow->next)
543 if (flow->q->ops->drop && (len = flow->q->ops->drop(flow->q)))
544 return len;
545 return 0;
546 }
547
548 static int atm_tc_init(struct Qdisc *sch, struct nlattr *opt)
549 {
550 struct atm_qdisc_data *p = qdisc_priv(sch);
551
552 pr_debug("atm_tc_init(sch %p,[qdisc %p],opt %p)\n", sch, p, opt);
553 p->flows = &p->link;
554 p->link.q = qdisc_create_dflt(sch->dev, &pfifo_qdisc_ops, sch->handle);
555 if (!p->link.q)
556 p->link.q = &noop_qdisc;
557 pr_debug("atm_tc_init: link (%p) qdisc %p\n", &p->link, p->link.q);
558 p->link.filter_list = NULL;
559 p->link.vcc = NULL;
560 p->link.sock = NULL;
561 p->link.classid = sch->handle;
562 p->link.ref = 1;
563 p->link.next = NULL;
564 tasklet_init(&p->task, sch_atm_dequeue, (unsigned long)sch);
565 return 0;
566 }
567
568 static void atm_tc_reset(struct Qdisc *sch)
569 {
570 struct atm_qdisc_data *p = qdisc_priv(sch);
571 struct atm_flow_data *flow;
572
573 pr_debug("atm_tc_reset(sch %p,[qdisc %p])\n", sch, p);
574 for (flow = p->flows; flow; flow = flow->next)
575 qdisc_reset(flow->q);
576 sch->q.qlen = 0;
577 }
578
579 static void atm_tc_destroy(struct Qdisc *sch)
580 {
581 struct atm_qdisc_data *p = qdisc_priv(sch);
582 struct atm_flow_data *flow;
583
584 pr_debug("atm_tc_destroy(sch %p,[qdisc %p])\n", sch, p);
585 /* races ? */
586 while ((flow = p->flows)) {
587 tcf_destroy_chain(flow->filter_list);
588 flow->filter_list = NULL;
589 if (flow->ref > 1)
590 printk(KERN_ERR "atm_destroy: %p->ref = %d\n", flow,
591 flow->ref);
592 atm_tc_put(sch, (unsigned long)flow);
593 if (p->flows == flow) {
594 printk(KERN_ERR "atm_destroy: putting flow %p didn't "
595 "kill it\n", flow);
596 p->flows = flow->next; /* brute force */
597 break;
598 }
599 }
600 tasklet_kill(&p->task);
601 }
602
603 static int atm_tc_dump_class(struct Qdisc *sch, unsigned long cl,
604 struct sk_buff *skb, struct tcmsg *tcm)
605 {
606 struct atm_qdisc_data *p = qdisc_priv(sch);
607 struct atm_flow_data *flow = (struct atm_flow_data *)cl;
608 unsigned char *b = skb_tail_pointer(skb);
609 struct nlattr *nla;
610
611 pr_debug("atm_tc_dump_class(sch %p,[qdisc %p],flow %p,skb %p,tcm %p)\n",
612 sch, p, flow, skb, tcm);
613 if (!find_flow(p, flow))
614 return -EINVAL;
615 tcm->tcm_handle = flow->classid;
616 tcm->tcm_info = flow->q->handle;
617 nla = (struct nlattr *)b;
618 NLA_PUT(skb, TCA_OPTIONS, 0, NULL);
619 NLA_PUT(skb, TCA_ATM_HDR, flow->hdr_len, flow->hdr);
620 if (flow->vcc) {
621 struct sockaddr_atmpvc pvc;
622 int state;
623
624 pvc.sap_family = AF_ATMPVC;
625 pvc.sap_addr.itf = flow->vcc->dev ? flow->vcc->dev->number : -1;
626 pvc.sap_addr.vpi = flow->vcc->vpi;
627 pvc.sap_addr.vci = flow->vcc->vci;
628 NLA_PUT(skb, TCA_ATM_ADDR, sizeof(pvc), &pvc);
629 state = ATM_VF2VS(flow->vcc->flags);
630 NLA_PUT(skb, TCA_ATM_STATE, sizeof(state), &state);
631 }
632 if (flow->excess)
633 NLA_PUT(skb, TCA_ATM_EXCESS, sizeof(u32), &flow->classid);
634 else {
635 static u32 zero;
636
637 NLA_PUT(skb, TCA_ATM_EXCESS, sizeof(zero), &zero);
638 }
639 nla->nla_len = skb_tail_pointer(skb) - b;
640 return skb->len;
641
642 nla_put_failure:
643 nlmsg_trim(skb, b);
644 return -1;
645 }
646 static int
647 atm_tc_dump_class_stats(struct Qdisc *sch, unsigned long arg,
648 struct gnet_dump *d)
649 {
650 struct atm_flow_data *flow = (struct atm_flow_data *)arg;
651
652 flow->qstats.qlen = flow->q->q.qlen;
653
654 if (gnet_stats_copy_basic(d, &flow->bstats) < 0 ||
655 gnet_stats_copy_queue(d, &flow->qstats) < 0)
656 return -1;
657
658 return 0;
659 }
660
661 static int atm_tc_dump(struct Qdisc *sch, struct sk_buff *skb)
662 {
663 return 0;
664 }
665
666 static const struct Qdisc_class_ops atm_class_ops = {
667 .graft = atm_tc_graft,
668 .leaf = atm_tc_leaf,
669 .get = atm_tc_get,
670 .put = atm_tc_put,
671 .change = atm_tc_change,
672 .delete = atm_tc_delete,
673 .walk = atm_tc_walk,
674 .tcf_chain = atm_tc_find_tcf,
675 .bind_tcf = atm_tc_bind_filter,
676 .unbind_tcf = atm_tc_put,
677 .dump = atm_tc_dump_class,
678 .dump_stats = atm_tc_dump_class_stats,
679 };
680
681 static struct Qdisc_ops atm_qdisc_ops __read_mostly = {
682 .cl_ops = &atm_class_ops,
683 .id = "atm",
684 .priv_size = sizeof(struct atm_qdisc_data),
685 .enqueue = atm_tc_enqueue,
686 .dequeue = atm_tc_dequeue,
687 .requeue = atm_tc_requeue,
688 .drop = atm_tc_drop,
689 .init = atm_tc_init,
690 .reset = atm_tc_reset,
691 .destroy = atm_tc_destroy,
692 .dump = atm_tc_dump,
693 .owner = THIS_MODULE,
694 };
695
696 static int __init atm_init(void)
697 {
698 return register_qdisc(&atm_qdisc_ops);
699 }
700
701 static void __exit atm_exit(void)
702 {
703 unregister_qdisc(&atm_qdisc_ops);
704 }
705
706 module_init(atm_init)
707 module_exit(atm_exit)
708 MODULE_LICENSE("GPL");
Linux kernel - Deliverables
This page took 0.067971 seconds and 5 git commands to generate.