sch_atm.c 20 KB

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