sch_atm.c 19 KB

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