sch_atm.c 20 KB

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