Linux Audio

Check our new training course

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