sch_atm.c 19 KB

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