projects / deliverable / linux.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
[NET_SCHED]: Convert packet schedulers from rtnetlink to new netlink API
[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 || nla_parse_nested(tb, TCA_ATM_MAX, opt, NULL))
227 return -EINVAL;
228 if (!tb[TCA_ATM_FD] || nla_len(tb[TCA_ATM_FD]) < sizeof(fd))
229 return -EINVAL;
230 fd = *(int *)nla_data(tb[TCA_ATM_FD]);
231 pr_debug("atm_tc_change: fd %d\n", fd);
232 if (tb[TCA_ATM_HDR]) {
233 hdr_len = nla_len(tb[TCA_ATM_HDR]);
234 hdr = nla_data(tb[TCA_ATM_HDR]);
235 } else {
236 hdr_len = RFC1483LLC_LEN;
237 hdr = NULL; /* default LLC/SNAP for IP */
238 }
239 if (!tb[TCA_ATM_EXCESS])
240 excess = NULL;
241 else {
242 if (nla_len(tb[TCA_ATM_EXCESS]) != sizeof(u32))
243 return -EINVAL;
244 excess = (struct atm_flow_data *)
245 atm_tc_get(sch, *(u32 *)nla_data(tb[TCA_ATM_EXCESS]));
246 if (!excess)
247 return -ENOENT;
248 }
249 pr_debug("atm_tc_change: type %d, payload %lu, hdr_len %d\n",
250 opt->nla_type, nla_len(opt), hdr_len);
251 sock = sockfd_lookup(fd, &error);
252 if (!sock)
253 return error; /* f_count++ */
254 pr_debug("atm_tc_change: f_count %d\n", file_count(sock->file));
255 if (sock->ops->family != PF_ATMSVC && sock->ops->family != PF_ATMPVC) {
256 error = -EPROTOTYPE;
257 goto err_out;
258 }
259 /* @@@ should check if the socket is really operational or we'll crash
260 on vcc->send */
261 if (classid) {
262 if (TC_H_MAJ(classid ^ sch->handle)) {
263 pr_debug("atm_tc_change: classid mismatch\n");
264 error = -EINVAL;
265 goto err_out;
266 }
267 if (find_flow(p, flow)) {
268 error = -EEXIST;
269 goto err_out;
270 }
271 } else {
272 int i;
273 unsigned long cl;
274
275 for (i = 1; i < 0x8000; i++) {
276 classid = TC_H_MAKE(sch->handle, 0x8000 | i);
277 cl = atm_tc_get(sch, classid);
278 if (!cl)
279 break;
280 atm_tc_put(sch, cl);
281 }
282 }
283 pr_debug("atm_tc_change: new id %x\n", classid);
284 flow = kzalloc(sizeof(struct atm_flow_data) + hdr_len, GFP_KERNEL);
285 pr_debug("atm_tc_change: flow %p\n", flow);
286 if (!flow) {
287 error = -ENOBUFS;
288 goto err_out;
289 }
290 flow->filter_list = NULL;
291 flow->q = qdisc_create_dflt(sch->dev, &pfifo_qdisc_ops, classid);
292 if (!flow->q)
293 flow->q = &noop_qdisc;
294 pr_debug("atm_tc_change: qdisc %p\n", flow->q);
295 flow->sock = sock;
296 flow->vcc = ATM_SD(sock); /* speedup */
297 flow->vcc->user_back = flow;
298 pr_debug("atm_tc_change: vcc %p\n", flow->vcc);
299 flow->old_pop = flow->vcc->pop;
300 flow->parent = p;
301 flow->vcc->pop = sch_atm_pop;
302 flow->classid = classid;
303 flow->ref = 1;
304 flow->excess = excess;
305 flow->next = p->link.next;
306 p->link.next = flow;
307 flow->hdr_len = hdr_len;
308 if (hdr)
309 memcpy(flow->hdr, hdr, hdr_len);
310 else
311 memcpy(flow->hdr, llc_oui_ip, sizeof(llc_oui_ip));
312 *arg = (unsigned long)flow;
313 return 0;
314 err_out:
315 if (excess)
316 atm_tc_put(sch, (unsigned long)excess);
317 sockfd_put(sock);
318 return error;
319 }
320
321 static int atm_tc_delete(struct Qdisc *sch, unsigned long arg)
322 {
323 struct atm_qdisc_data *p = qdisc_priv(sch);
324 struct atm_flow_data *flow = (struct atm_flow_data *)arg;
325
326 pr_debug("atm_tc_delete(sch %p,[qdisc %p],flow %p)\n", sch, p, flow);
327 if (!find_flow(qdisc_priv(sch), flow))
328 return -EINVAL;
329 if (flow->filter_list || flow == &p->link)
330 return -EBUSY;
331 /*
332 * Reference count must be 2: one for "keepalive" (set at class
333 * creation), and one for the reference held when calling delete.
334 */
335 if (flow->ref < 2) {
336 printk(KERN_ERR "atm_tc_delete: flow->ref == %d\n", flow->ref);
337 return -EINVAL;
338 }
339 if (flow->ref > 2)
340 return -EBUSY; /* catch references via excess, etc. */
341 atm_tc_put(sch, arg);
342 return 0;
343 }
344
345 static void atm_tc_walk(struct Qdisc *sch, struct qdisc_walker *walker)
346 {
347 struct atm_qdisc_data *p = qdisc_priv(sch);
348 struct atm_flow_data *flow;
349
350 pr_debug("atm_tc_walk(sch %p,[qdisc %p],walker %p)\n", sch, p, walker);
351 if (walker->stop)
352 return;
353 for (flow = p->flows; flow; flow = flow->next) {
354 if (walker->count >= walker->skip)
355 if (walker->fn(sch, (unsigned long)flow, walker) < 0) {
356 walker->stop = 1;
357 break;
358 }
359 walker->count++;
360 }
361 }
362
363 static struct tcf_proto **atm_tc_find_tcf(struct Qdisc *sch, unsigned long cl)
364 {
365 struct atm_qdisc_data *p = qdisc_priv(sch);
366 struct atm_flow_data *flow = (struct atm_flow_data *)cl;
367
368 pr_debug("atm_tc_find_tcf(sch %p,[qdisc %p],flow %p)\n", sch, p, flow);
369 return flow ? &flow->filter_list : &p->link.filter_list;
370 }
371
372 /* --------------------------- Qdisc operations ---------------------------- */
373
374 static int atm_tc_enqueue(struct sk_buff *skb, struct Qdisc *sch)
375 {
376 struct atm_qdisc_data *p = qdisc_priv(sch);
377 struct atm_flow_data *flow = NULL; /* @@@ */
378 struct tcf_result res;
379 int result;
380 int ret = NET_XMIT_POLICED;
381
382 pr_debug("atm_tc_enqueue(skb %p,sch %p,[qdisc %p])\n", skb, sch, p);
383 result = TC_POLICE_OK; /* be nice to gcc */
384 if (TC_H_MAJ(skb->priority) != sch->handle ||
385 !(flow = (struct atm_flow_data *)atm_tc_get(sch, skb->priority)))
386 for (flow = p->flows; flow; flow = flow->next)
387 if (flow->filter_list) {
388 result = tc_classify_compat(skb,
389 flow->filter_list,
390 &res);
391 if (result < 0)
392 continue;
393 flow = (struct atm_flow_data *)res.class;
394 if (!flow)
395 flow = lookup_flow(sch, res.classid);
396 break;
397 }
398 if (!flow)
399 flow = &p->link;
400 else {
401 if (flow->vcc)
402 ATM_SKB(skb)->atm_options = flow->vcc->atm_options;
403 /*@@@ looks good ... but it's not supposed to work :-) */
404 #ifdef CONFIG_NET_CLS_ACT
405 switch (result) {
406 case TC_ACT_QUEUED:
407 case TC_ACT_STOLEN:
408 kfree_skb(skb);
409 return NET_XMIT_SUCCESS;
410 case TC_ACT_SHOT:
411 kfree_skb(skb);
412 goto drop;
413 case TC_POLICE_RECLASSIFY:
414 if (flow->excess)
415 flow = flow->excess;
416 else
417 ATM_SKB(skb)->atm_options |= ATM_ATMOPT_CLP;
418 break;
419 }
420 #endif
421 }
422
423 ret = flow->q->enqueue(skb, flow->q);
424 if (ret != 0) {
425 drop: __maybe_unused
426 sch->qstats.drops++;
427 if (flow)
428 flow->qstats.drops++;
429 return ret;
430 }
431 sch->bstats.bytes += skb->len;
432 sch->bstats.packets++;
433 flow->bstats.bytes += skb->len;
434 flow->bstats.packets++;
435 /*
436 * Okay, this may seem weird. We pretend we've dropped the packet if
437 * it goes via ATM. The reason for this is that the outer qdisc
438 * expects to be able to q->dequeue the packet later on if we return
439 * success at this place. Also, sch->q.qdisc needs to reflect whether
440 * there is a packet egligible for dequeuing or not. Note that the
441 * statistics of the outer qdisc are necessarily wrong because of all
442 * this. There's currently no correct solution for this.
443 */
444 if (flow == &p->link) {
445 sch->q.qlen++;
446 return 0;
447 }
448 tasklet_schedule(&p->task);
449 return NET_XMIT_BYPASS;
450 }
451
452 /*
453 * Dequeue packets and send them over ATM. Note that we quite deliberately
454 * avoid checking net_device's flow control here, simply because sch_atm
455 * uses its own channels, which have nothing to do with any CLIP/LANE/or
456 * non-ATM interfaces.
457 */
458
459 static void sch_atm_dequeue(unsigned long data)
460 {
461 struct Qdisc *sch = (struct Qdisc *)data;
462 struct atm_qdisc_data *p = qdisc_priv(sch);
463 struct atm_flow_data *flow;
464 struct sk_buff *skb;
465
466 pr_debug("sch_atm_dequeue(sch %p,[qdisc %p])\n", sch, p);
467 for (flow = p->link.next; flow; flow = flow->next)
468 /*
469 * If traffic is properly shaped, this won't generate nasty
470 * little bursts. Otherwise, it may ... (but that's okay)
471 */
472 while ((skb = flow->q->dequeue(flow->q))) {
473 if (!atm_may_send(flow->vcc, skb->truesize)) {
474 (void)flow->q->ops->requeue(skb, flow->q);
475 break;
476 }
477 pr_debug("atm_tc_dequeue: sending on class %p\n", flow);
478 /* remove any LL header somebody else has attached */
479 skb_pull(skb, skb_network_offset(skb));
480 if (skb_headroom(skb) < flow->hdr_len) {
481 struct sk_buff *new;
482
483 new = skb_realloc_headroom(skb, flow->hdr_len);
484 dev_kfree_skb(skb);
485 if (!new)
486 continue;
487 skb = new;
488 }
489 pr_debug("sch_atm_dequeue: ip %p, data %p\n",
490 skb_network_header(skb), skb->data);
491 ATM_SKB(skb)->vcc = flow->vcc;
492 memcpy(skb_push(skb, flow->hdr_len), flow->hdr,
493 flow->hdr_len);
494 atomic_add(skb->truesize,
495 &sk_atm(flow->vcc)->sk_wmem_alloc);
496 /* atm.atm_options are already set by atm_tc_enqueue */
497 flow->vcc->send(flow->vcc, skb);
498 }
499 }
500
501 static struct sk_buff *atm_tc_dequeue(struct Qdisc *sch)
502 {
503 struct atm_qdisc_data *p = qdisc_priv(sch);
504 struct sk_buff *skb;
505
506 pr_debug("atm_tc_dequeue(sch %p,[qdisc %p])\n", sch, p);
507 tasklet_schedule(&p->task);
508 skb = p->link.q->dequeue(p->link.q);
509 if (skb)
510 sch->q.qlen--;
511 return skb;
512 }
513
514 static int atm_tc_requeue(struct sk_buff *skb, struct Qdisc *sch)
515 {
516 struct atm_qdisc_data *p = qdisc_priv(sch);
517 int ret;
518
519 pr_debug("atm_tc_requeue(skb %p,sch %p,[qdisc %p])\n", skb, sch, p);
520 ret = p->link.q->ops->requeue(skb, p->link.q);
521 if (!ret) {
522 sch->q.qlen++;
523 sch->qstats.requeues++;
524 } else {
525 sch->qstats.drops++;
526 p->link.qstats.drops++;
527 }
528 return ret;
529 }
530
531 static unsigned int atm_tc_drop(struct Qdisc *sch)
532 {
533 struct atm_qdisc_data *p = qdisc_priv(sch);
534 struct atm_flow_data *flow;
535 unsigned int len;
536
537 pr_debug("atm_tc_drop(sch %p,[qdisc %p])\n", sch, p);
538 for (flow = p->flows; flow; flow = flow->next)
539 if (flow->q->ops->drop && (len = flow->q->ops->drop(flow->q)))
540 return len;
541 return 0;
542 }
543
544 static int atm_tc_init(struct Qdisc *sch, struct nlattr *opt)
545 {
546 struct atm_qdisc_data *p = qdisc_priv(sch);
547
548 pr_debug("atm_tc_init(sch %p,[qdisc %p],opt %p)\n", sch, p, opt);
549 p->flows = &p->link;
550 p->link.q = qdisc_create_dflt(sch->dev, &pfifo_qdisc_ops, sch->handle);
551 if (!p->link.q)
552 p->link.q = &noop_qdisc;
553 pr_debug("atm_tc_init: link (%p) qdisc %p\n", &p->link, p->link.q);
554 p->link.filter_list = NULL;
555 p->link.vcc = NULL;
556 p->link.sock = NULL;
557 p->link.classid = sch->handle;
558 p->link.ref = 1;
559 p->link.next = NULL;
560 tasklet_init(&p->task, sch_atm_dequeue, (unsigned long)sch);
561 return 0;
562 }
563
564 static void atm_tc_reset(struct Qdisc *sch)
565 {
566 struct atm_qdisc_data *p = qdisc_priv(sch);
567 struct atm_flow_data *flow;
568
569 pr_debug("atm_tc_reset(sch %p,[qdisc %p])\n", sch, p);
570 for (flow = p->flows; flow; flow = flow->next)
571 qdisc_reset(flow->q);
572 sch->q.qlen = 0;
573 }
574
575 static void atm_tc_destroy(struct Qdisc *sch)
576 {
577 struct atm_qdisc_data *p = qdisc_priv(sch);
578 struct atm_flow_data *flow;
579
580 pr_debug("atm_tc_destroy(sch %p,[qdisc %p])\n", sch, p);
581 /* races ? */
582 while ((flow = p->flows)) {
583 tcf_destroy_chain(flow->filter_list);
584 flow->filter_list = NULL;
585 if (flow->ref > 1)
586 printk(KERN_ERR "atm_destroy: %p->ref = %d\n", flow,
587 flow->ref);
588 atm_tc_put(sch, (unsigned long)flow);
589 if (p->flows == flow) {
590 printk(KERN_ERR "atm_destroy: putting flow %p didn't "
591 "kill it\n", flow);
592 p->flows = flow->next; /* brute force */
593 break;
594 }
595 }
596 tasklet_kill(&p->task);
597 }
598
599 static int atm_tc_dump_class(struct Qdisc *sch, unsigned long cl,
600 struct sk_buff *skb, struct tcmsg *tcm)
601 {
602 struct atm_qdisc_data *p = qdisc_priv(sch);
603 struct atm_flow_data *flow = (struct atm_flow_data *)cl;
604 unsigned char *b = skb_tail_pointer(skb);
605 struct nlattr *nla;
606
607 pr_debug("atm_tc_dump_class(sch %p,[qdisc %p],flow %p,skb %p,tcm %p)\n",
608 sch, p, flow, skb, tcm);
609 if (!find_flow(p, flow))
610 return -EINVAL;
611 tcm->tcm_handle = flow->classid;
612 tcm->tcm_info = flow->q->handle;
613 nla = (struct nlattr *)b;
614 NLA_PUT(skb, TCA_OPTIONS, 0, NULL);
615 NLA_PUT(skb, TCA_ATM_HDR, flow->hdr_len, flow->hdr);
616 if (flow->vcc) {
617 struct sockaddr_atmpvc pvc;
618 int state;
619
620 pvc.sap_family = AF_ATMPVC;
621 pvc.sap_addr.itf = flow->vcc->dev ? flow->vcc->dev->number : -1;
622 pvc.sap_addr.vpi = flow->vcc->vpi;
623 pvc.sap_addr.vci = flow->vcc->vci;
624 NLA_PUT(skb, TCA_ATM_ADDR, sizeof(pvc), &pvc);
625 state = ATM_VF2VS(flow->vcc->flags);
626 NLA_PUT(skb, TCA_ATM_STATE, sizeof(state), &state);
627 }
628 if (flow->excess)
629 NLA_PUT(skb, TCA_ATM_EXCESS, sizeof(u32), &flow->classid);
630 else {
631 static u32 zero;
632
633 NLA_PUT(skb, TCA_ATM_EXCESS, sizeof(zero), &zero);
634 }
635 nla->nla_len = skb_tail_pointer(skb) - b;
636 return skb->len;
637
638 nla_put_failure:
639 nlmsg_trim(skb, b);
640 return -1;
641 }
642 static int
643 atm_tc_dump_class_stats(struct Qdisc *sch, unsigned long arg,
644 struct gnet_dump *d)
645 {
646 struct atm_flow_data *flow = (struct atm_flow_data *)arg;
647
648 flow->qstats.qlen = flow->q->q.qlen;
649
650 if (gnet_stats_copy_basic(d, &flow->bstats) < 0 ||
651 gnet_stats_copy_queue(d, &flow->qstats) < 0)
652 return -1;
653
654 return 0;
655 }
656
657 static int atm_tc_dump(struct Qdisc *sch, struct sk_buff *skb)
658 {
659 return 0;
660 }
661
662 static const struct Qdisc_class_ops atm_class_ops = {
663 .graft = atm_tc_graft,
664 .leaf = atm_tc_leaf,
665 .get = atm_tc_get,
666 .put = atm_tc_put,
667 .change = atm_tc_change,
668 .delete = atm_tc_delete,
669 .walk = atm_tc_walk,
670 .tcf_chain = atm_tc_find_tcf,
671 .bind_tcf = atm_tc_bind_filter,
672 .unbind_tcf = atm_tc_put,
673 .dump = atm_tc_dump_class,
674 .dump_stats = atm_tc_dump_class_stats,
675 };
676
677 static struct Qdisc_ops atm_qdisc_ops __read_mostly = {
678 .cl_ops = &atm_class_ops,
679 .id = "atm",
680 .priv_size = sizeof(struct atm_qdisc_data),
681 .enqueue = atm_tc_enqueue,
682 .dequeue = atm_tc_dequeue,
683 .requeue = atm_tc_requeue,
684 .drop = atm_tc_drop,
685 .init = atm_tc_init,
686 .reset = atm_tc_reset,
687 .destroy = atm_tc_destroy,
688 .dump = atm_tc_dump,
689 .owner = THIS_MODULE,
690 };
691
692 static int __init atm_init(void)
693 {
694 return register_qdisc(&atm_qdisc_ops);
695 }
696
697 static void __exit atm_exit(void)
698 {
699 unregister_qdisc(&atm_qdisc_ops);
700 }
701
702 module_init(atm_init)
703 module_exit(atm_exit)
704 MODULE_LICENSE("GPL");
Linux kernel - Deliverables
This page took 0.058147 seconds and 5 git commands to generate.