sch_atm.c 20 KB

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