sch_generic.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627
  1. /*
  2. * net/sched/sch_generic.c Generic packet scheduler routines.
  3. *
  4. * This program is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU General Public License
  6. * as published by the Free Software Foundation; either version
  7. * 2 of the License, or (at your option) any later version.
  8. *
  9. * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
  10. * Jamal Hadi Salim, <hadi@cyberus.ca> 990601
  11. * - Ingress support
  12. */
  13. #include <asm/uaccess.h>
  14. #include <asm/system.h>
  15. #include <linux/bitops.h>
  16. #include <linux/config.h>
  17. #include <linux/module.h>
  18. #include <linux/types.h>
  19. #include <linux/kernel.h>
  20. #include <linux/sched.h>
  21. #include <linux/string.h>
  22. #include <linux/mm.h>
  23. #include <linux/socket.h>
  24. #include <linux/sockios.h>
  25. #include <linux/in.h>
  26. #include <linux/errno.h>
  27. #include <linux/interrupt.h>
  28. #include <linux/netdevice.h>
  29. #include <linux/skbuff.h>
  30. #include <linux/rtnetlink.h>
  31. #include <linux/init.h>
  32. #include <linux/rcupdate.h>
  33. #include <linux/list.h>
  34. #include <net/sock.h>
  35. #include <net/pkt_sched.h>
  36. /* Main transmission queue. */
  37. /* Main qdisc structure lock.
  38. However, modifications
  39. to data, participating in scheduling must be additionally
  40. protected with dev->queue_lock spinlock.
  41. The idea is the following:
  42. - enqueue, dequeue are serialized via top level device
  43. spinlock dev->queue_lock.
  44. - tree walking is protected by read_lock_bh(qdisc_tree_lock)
  45. and this lock is used only in process context.
  46. - updates to tree are made under rtnl semaphore or
  47. from softirq context (__qdisc_destroy rcu-callback)
  48. hence this lock needs local bh disabling.
  49. qdisc_tree_lock must be grabbed BEFORE dev->queue_lock!
  50. */
  51. DEFINE_RWLOCK(qdisc_tree_lock);
  52. void qdisc_lock_tree(struct net_device *dev)
  53. {
  54. write_lock_bh(&qdisc_tree_lock);
  55. spin_lock_bh(&dev->queue_lock);
  56. }
  57. void qdisc_unlock_tree(struct net_device *dev)
  58. {
  59. spin_unlock_bh(&dev->queue_lock);
  60. write_unlock_bh(&qdisc_tree_lock);
  61. }
  62. /*
  63. dev->queue_lock serializes queue accesses for this device
  64. AND dev->qdisc pointer itself.
  65. dev->xmit_lock serializes accesses to device driver.
  66. dev->queue_lock and dev->xmit_lock are mutually exclusive,
  67. if one is grabbed, another must be free.
  68. */
  69. /* Kick device.
  70. Note, that this procedure can be called by a watchdog timer, so that
  71. we do not check dev->tbusy flag here.
  72. Returns: 0 - queue is empty.
  73. >0 - queue is not empty, but throttled.
  74. <0 - queue is not empty. Device is throttled, if dev->tbusy != 0.
  75. NOTE: Called under dev->queue_lock with locally disabled BH.
  76. */
  77. int qdisc_restart(struct net_device *dev)
  78. {
  79. struct Qdisc *q = dev->qdisc;
  80. struct sk_buff *skb;
  81. /* Dequeue packet */
  82. if ((skb = q->dequeue(q)) != NULL) {
  83. unsigned nolock = (dev->features & NETIF_F_LLTX);
  84. /*
  85. * When the driver has LLTX set it does its own locking
  86. * in start_xmit. No need to add additional overhead by
  87. * locking again. These checks are worth it because
  88. * even uncongested locks can be quite expensive.
  89. * The driver can do trylock like here too, in case
  90. * of lock congestion it should return -1 and the packet
  91. * will be requeued.
  92. */
  93. if (!nolock) {
  94. if (!spin_trylock(&dev->xmit_lock)) {
  95. collision:
  96. /* So, someone grabbed the driver. */
  97. /* It may be transient configuration error,
  98. when hard_start_xmit() recurses. We detect
  99. it by checking xmit owner and drop the
  100. packet when deadloop is detected.
  101. */
  102. if (dev->xmit_lock_owner == smp_processor_id()) {
  103. kfree_skb(skb);
  104. if (net_ratelimit())
  105. printk(KERN_DEBUG "Dead loop on netdevice %s, fix it urgently!\n", dev->name);
  106. return -1;
  107. }
  108. __get_cpu_var(netdev_rx_stat).cpu_collision++;
  109. goto requeue;
  110. }
  111. /* Remember that the driver is grabbed by us. */
  112. dev->xmit_lock_owner = smp_processor_id();
  113. }
  114. {
  115. /* And release queue */
  116. spin_unlock(&dev->queue_lock);
  117. if (!netif_queue_stopped(dev)) {
  118. int ret;
  119. if (netdev_nit)
  120. dev_queue_xmit_nit(skb, dev);
  121. ret = dev->hard_start_xmit(skb, dev);
  122. if (ret == NETDEV_TX_OK) {
  123. if (!nolock) {
  124. dev->xmit_lock_owner = -1;
  125. spin_unlock(&dev->xmit_lock);
  126. }
  127. spin_lock(&dev->queue_lock);
  128. return -1;
  129. }
  130. if (ret == NETDEV_TX_LOCKED && nolock) {
  131. spin_lock(&dev->queue_lock);
  132. goto collision;
  133. }
  134. }
  135. /* NETDEV_TX_BUSY - we need to requeue */
  136. /* Release the driver */
  137. if (!nolock) {
  138. dev->xmit_lock_owner = -1;
  139. spin_unlock(&dev->xmit_lock);
  140. }
  141. spin_lock(&dev->queue_lock);
  142. q = dev->qdisc;
  143. }
  144. /* Device kicked us out :(
  145. This is possible in three cases:
  146. 0. driver is locked
  147. 1. fastroute is enabled
  148. 2. device cannot determine busy state
  149. before start of transmission (f.e. dialout)
  150. 3. device is buggy (ppp)
  151. */
  152. requeue:
  153. q->ops->requeue(skb, q);
  154. netif_schedule(dev);
  155. return 1;
  156. }
  157. BUG_ON((int) q->q.qlen < 0);
  158. return q->q.qlen;
  159. }
  160. static void dev_watchdog(unsigned long arg)
  161. {
  162. struct net_device *dev = (struct net_device *)arg;
  163. spin_lock(&dev->xmit_lock);
  164. if (dev->qdisc != &noop_qdisc) {
  165. if (netif_device_present(dev) &&
  166. netif_running(dev) &&
  167. netif_carrier_ok(dev)) {
  168. if (netif_queue_stopped(dev) &&
  169. (jiffies - dev->trans_start) > dev->watchdog_timeo) {
  170. printk(KERN_INFO "NETDEV WATCHDOG: %s: transmit timed out\n", dev->name);
  171. dev->tx_timeout(dev);
  172. }
  173. if (!mod_timer(&dev->watchdog_timer, jiffies + dev->watchdog_timeo))
  174. dev_hold(dev);
  175. }
  176. }
  177. spin_unlock(&dev->xmit_lock);
  178. dev_put(dev);
  179. }
  180. static void dev_watchdog_init(struct net_device *dev)
  181. {
  182. init_timer(&dev->watchdog_timer);
  183. dev->watchdog_timer.data = (unsigned long)dev;
  184. dev->watchdog_timer.function = dev_watchdog;
  185. }
  186. void __netdev_watchdog_up(struct net_device *dev)
  187. {
  188. if (dev->tx_timeout) {
  189. if (dev->watchdog_timeo <= 0)
  190. dev->watchdog_timeo = 5*HZ;
  191. if (!mod_timer(&dev->watchdog_timer, jiffies + dev->watchdog_timeo))
  192. dev_hold(dev);
  193. }
  194. }
  195. static void dev_watchdog_up(struct net_device *dev)
  196. {
  197. spin_lock_bh(&dev->xmit_lock);
  198. __netdev_watchdog_up(dev);
  199. spin_unlock_bh(&dev->xmit_lock);
  200. }
  201. static void dev_watchdog_down(struct net_device *dev)
  202. {
  203. spin_lock_bh(&dev->xmit_lock);
  204. if (del_timer(&dev->watchdog_timer))
  205. __dev_put(dev);
  206. spin_unlock_bh(&dev->xmit_lock);
  207. }
  208. void netif_carrier_on(struct net_device *dev)
  209. {
  210. if (test_and_clear_bit(__LINK_STATE_NOCARRIER, &dev->state))
  211. linkwatch_fire_event(dev);
  212. if (netif_running(dev))
  213. __netdev_watchdog_up(dev);
  214. }
  215. void netif_carrier_off(struct net_device *dev)
  216. {
  217. if (!test_and_set_bit(__LINK_STATE_NOCARRIER, &dev->state))
  218. linkwatch_fire_event(dev);
  219. }
  220. /* "NOOP" scheduler: the best scheduler, recommended for all interfaces
  221. under all circumstances. It is difficult to invent anything faster or
  222. cheaper.
  223. */
  224. static int noop_enqueue(struct sk_buff *skb, struct Qdisc * qdisc)
  225. {
  226. kfree_skb(skb);
  227. return NET_XMIT_CN;
  228. }
  229. static struct sk_buff *noop_dequeue(struct Qdisc * qdisc)
  230. {
  231. return NULL;
  232. }
  233. static int noop_requeue(struct sk_buff *skb, struct Qdisc* qdisc)
  234. {
  235. if (net_ratelimit())
  236. printk(KERN_DEBUG "%s deferred output. It is buggy.\n",
  237. skb->dev->name);
  238. kfree_skb(skb);
  239. return NET_XMIT_CN;
  240. }
  241. struct Qdisc_ops noop_qdisc_ops = {
  242. .id = "noop",
  243. .priv_size = 0,
  244. .enqueue = noop_enqueue,
  245. .dequeue = noop_dequeue,
  246. .requeue = noop_requeue,
  247. .owner = THIS_MODULE,
  248. };
  249. struct Qdisc noop_qdisc = {
  250. .enqueue = noop_enqueue,
  251. .dequeue = noop_dequeue,
  252. .flags = TCQ_F_BUILTIN,
  253. .ops = &noop_qdisc_ops,
  254. .list = LIST_HEAD_INIT(noop_qdisc.list),
  255. };
  256. static struct Qdisc_ops noqueue_qdisc_ops = {
  257. .id = "noqueue",
  258. .priv_size = 0,
  259. .enqueue = noop_enqueue,
  260. .dequeue = noop_dequeue,
  261. .requeue = noop_requeue,
  262. .owner = THIS_MODULE,
  263. };
  264. static struct Qdisc noqueue_qdisc = {
  265. .enqueue = NULL,
  266. .dequeue = noop_dequeue,
  267. .flags = TCQ_F_BUILTIN,
  268. .ops = &noqueue_qdisc_ops,
  269. .list = LIST_HEAD_INIT(noqueue_qdisc.list),
  270. };
  271. static const u8 prio2band[TC_PRIO_MAX+1] =
  272. { 1, 2, 2, 2, 1, 2, 0, 0 , 1, 1, 1, 1, 1, 1, 1, 1 };
  273. /* 3-band FIFO queue: old style, but should be a bit faster than
  274. generic prio+fifo combination.
  275. */
  276. #define PFIFO_FAST_BANDS 3
  277. static inline struct sk_buff_head *prio2list(struct sk_buff *skb,
  278. struct Qdisc *qdisc)
  279. {
  280. struct sk_buff_head *list = qdisc_priv(qdisc);
  281. return list + prio2band[skb->priority & TC_PRIO_MAX];
  282. }
  283. static int pfifo_fast_enqueue(struct sk_buff *skb, struct Qdisc* qdisc)
  284. {
  285. struct sk_buff_head *list = prio2list(skb, qdisc);
  286. if (skb_queue_len(list) < qdisc->dev->tx_queue_len) {
  287. qdisc->q.qlen++;
  288. return __qdisc_enqueue_tail(skb, qdisc, list);
  289. }
  290. return qdisc_drop(skb, qdisc);
  291. }
  292. static struct sk_buff *pfifo_fast_dequeue(struct Qdisc* qdisc)
  293. {
  294. int prio;
  295. struct sk_buff_head *list = qdisc_priv(qdisc);
  296. for (prio = 0; prio < PFIFO_FAST_BANDS; prio++) {
  297. if (!skb_queue_empty(list + prio)) {
  298. qdisc->q.qlen--;
  299. return __qdisc_dequeue_head(qdisc, list + prio);
  300. }
  301. }
  302. return NULL;
  303. }
  304. static int pfifo_fast_requeue(struct sk_buff *skb, struct Qdisc* qdisc)
  305. {
  306. qdisc->q.qlen++;
  307. return __qdisc_requeue(skb, qdisc, prio2list(skb, qdisc));
  308. }
  309. static void pfifo_fast_reset(struct Qdisc* qdisc)
  310. {
  311. int prio;
  312. struct sk_buff_head *list = qdisc_priv(qdisc);
  313. for (prio = 0; prio < PFIFO_FAST_BANDS; prio++)
  314. __qdisc_reset_queue(qdisc, list + prio);
  315. qdisc->qstats.backlog = 0;
  316. qdisc->q.qlen = 0;
  317. }
  318. static int pfifo_fast_dump(struct Qdisc *qdisc, struct sk_buff *skb)
  319. {
  320. struct tc_prio_qopt opt = { .bands = PFIFO_FAST_BANDS };
  321. memcpy(&opt.priomap, prio2band, TC_PRIO_MAX+1);
  322. RTA_PUT(skb, TCA_OPTIONS, sizeof(opt), &opt);
  323. return skb->len;
  324. rtattr_failure:
  325. return -1;
  326. }
  327. static int pfifo_fast_init(struct Qdisc *qdisc, struct rtattr *opt)
  328. {
  329. int prio;
  330. struct sk_buff_head *list = qdisc_priv(qdisc);
  331. for (prio = 0; prio < PFIFO_FAST_BANDS; prio++)
  332. skb_queue_head_init(list + prio);
  333. return 0;
  334. }
  335. static struct Qdisc_ops pfifo_fast_ops = {
  336. .id = "pfifo_fast",
  337. .priv_size = PFIFO_FAST_BANDS * sizeof(struct sk_buff_head),
  338. .enqueue = pfifo_fast_enqueue,
  339. .dequeue = pfifo_fast_dequeue,
  340. .requeue = pfifo_fast_requeue,
  341. .init = pfifo_fast_init,
  342. .reset = pfifo_fast_reset,
  343. .dump = pfifo_fast_dump,
  344. .owner = THIS_MODULE,
  345. };
  346. struct Qdisc *qdisc_alloc(struct net_device *dev, struct Qdisc_ops *ops)
  347. {
  348. void *p;
  349. struct Qdisc *sch;
  350. unsigned int size;
  351. int err = -ENOBUFS;
  352. /* ensure that the Qdisc and the private data are 32-byte aligned */
  353. size = QDISC_ALIGN(sizeof(*sch));
  354. size += ops->priv_size + (QDISC_ALIGNTO - 1);
  355. p = kmalloc(size, GFP_KERNEL);
  356. if (!p)
  357. goto errout;
  358. memset(p, 0, size);
  359. sch = (struct Qdisc *) QDISC_ALIGN((unsigned long) p);
  360. sch->padded = (char *) sch - (char *) p;
  361. INIT_LIST_HEAD(&sch->list);
  362. skb_queue_head_init(&sch->q);
  363. sch->ops = ops;
  364. sch->enqueue = ops->enqueue;
  365. sch->dequeue = ops->dequeue;
  366. sch->dev = dev;
  367. dev_hold(dev);
  368. sch->stats_lock = &dev->queue_lock;
  369. atomic_set(&sch->refcnt, 1);
  370. return sch;
  371. errout:
  372. return ERR_PTR(-err);
  373. }
  374. struct Qdisc * qdisc_create_dflt(struct net_device *dev, struct Qdisc_ops *ops)
  375. {
  376. struct Qdisc *sch;
  377. sch = qdisc_alloc(dev, ops);
  378. if (IS_ERR(sch))
  379. goto errout;
  380. if (!ops->init || ops->init(sch, NULL) == 0)
  381. return sch;
  382. qdisc_destroy(sch);
  383. errout:
  384. return NULL;
  385. }
  386. /* Under dev->queue_lock and BH! */
  387. void qdisc_reset(struct Qdisc *qdisc)
  388. {
  389. struct Qdisc_ops *ops = qdisc->ops;
  390. if (ops->reset)
  391. ops->reset(qdisc);
  392. }
  393. /* this is the rcu callback function to clean up a qdisc when there
  394. * are no further references to it */
  395. static void __qdisc_destroy(struct rcu_head *head)
  396. {
  397. struct Qdisc *qdisc = container_of(head, struct Qdisc, q_rcu);
  398. struct Qdisc_ops *ops = qdisc->ops;
  399. #ifdef CONFIG_NET_ESTIMATOR
  400. gen_kill_estimator(&qdisc->bstats, &qdisc->rate_est);
  401. #endif
  402. write_lock(&qdisc_tree_lock);
  403. if (ops->reset)
  404. ops->reset(qdisc);
  405. if (ops->destroy)
  406. ops->destroy(qdisc);
  407. write_unlock(&qdisc_tree_lock);
  408. module_put(ops->owner);
  409. dev_put(qdisc->dev);
  410. kfree((char *) qdisc - qdisc->padded);
  411. }
  412. /* Under dev->queue_lock and BH! */
  413. void qdisc_destroy(struct Qdisc *qdisc)
  414. {
  415. struct list_head cql = LIST_HEAD_INIT(cql);
  416. struct Qdisc *cq, *q, *n;
  417. if (qdisc->flags & TCQ_F_BUILTIN ||
  418. !atomic_dec_and_test(&qdisc->refcnt))
  419. return;
  420. if (!list_empty(&qdisc->list)) {
  421. if (qdisc->ops->cl_ops == NULL)
  422. list_del(&qdisc->list);
  423. else
  424. list_move(&qdisc->list, &cql);
  425. }
  426. /* unlink inner qdiscs from dev->qdisc_list immediately */
  427. list_for_each_entry(cq, &cql, list)
  428. list_for_each_entry_safe(q, n, &qdisc->dev->qdisc_list, list)
  429. if (TC_H_MAJ(q->parent) == TC_H_MAJ(cq->handle)) {
  430. if (q->ops->cl_ops == NULL)
  431. list_del_init(&q->list);
  432. else
  433. list_move_tail(&q->list, &cql);
  434. }
  435. list_for_each_entry_safe(cq, n, &cql, list)
  436. list_del_init(&cq->list);
  437. call_rcu(&qdisc->q_rcu, __qdisc_destroy);
  438. }
  439. void dev_activate(struct net_device *dev)
  440. {
  441. /* No queueing discipline is attached to device;
  442. create default one i.e. pfifo_fast for devices,
  443. which need queueing and noqueue_qdisc for
  444. virtual interfaces
  445. */
  446. if (dev->qdisc_sleeping == &noop_qdisc) {
  447. struct Qdisc *qdisc;
  448. if (dev->tx_queue_len) {
  449. qdisc = qdisc_create_dflt(dev, &pfifo_fast_ops);
  450. if (qdisc == NULL) {
  451. printk(KERN_INFO "%s: activation failed\n", dev->name);
  452. return;
  453. }
  454. write_lock_bh(&qdisc_tree_lock);
  455. list_add_tail(&qdisc->list, &dev->qdisc_list);
  456. write_unlock_bh(&qdisc_tree_lock);
  457. } else {
  458. qdisc = &noqueue_qdisc;
  459. }
  460. write_lock_bh(&qdisc_tree_lock);
  461. dev->qdisc_sleeping = qdisc;
  462. write_unlock_bh(&qdisc_tree_lock);
  463. }
  464. if (!netif_carrier_ok(dev))
  465. /* Delay activation until next carrier-on event */
  466. return;
  467. spin_lock_bh(&dev->queue_lock);
  468. rcu_assign_pointer(dev->qdisc, dev->qdisc_sleeping);
  469. if (dev->qdisc != &noqueue_qdisc) {
  470. dev->trans_start = jiffies;
  471. dev_watchdog_up(dev);
  472. }
  473. spin_unlock_bh(&dev->queue_lock);
  474. }
  475. void dev_deactivate(struct net_device *dev)
  476. {
  477. struct Qdisc *qdisc;
  478. spin_lock_bh(&dev->queue_lock);
  479. qdisc = dev->qdisc;
  480. dev->qdisc = &noop_qdisc;
  481. qdisc_reset(qdisc);
  482. spin_unlock_bh(&dev->queue_lock);
  483. dev_watchdog_down(dev);
  484. while (test_bit(__LINK_STATE_SCHED, &dev->state))
  485. yield();
  486. spin_unlock_wait(&dev->xmit_lock);
  487. }
  488. void dev_init_scheduler(struct net_device *dev)
  489. {
  490. qdisc_lock_tree(dev);
  491. dev->qdisc = &noop_qdisc;
  492. dev->qdisc_sleeping = &noop_qdisc;
  493. INIT_LIST_HEAD(&dev->qdisc_list);
  494. qdisc_unlock_tree(dev);
  495. dev_watchdog_init(dev);
  496. }
  497. void dev_shutdown(struct net_device *dev)
  498. {
  499. struct Qdisc *qdisc;
  500. qdisc_lock_tree(dev);
  501. qdisc = dev->qdisc_sleeping;
  502. dev->qdisc = &noop_qdisc;
  503. dev->qdisc_sleeping = &noop_qdisc;
  504. qdisc_destroy(qdisc);
  505. #if defined(CONFIG_NET_SCH_INGRESS) || defined(CONFIG_NET_SCH_INGRESS_MODULE)
  506. if ((qdisc = dev->qdisc_ingress) != NULL) {
  507. dev->qdisc_ingress = NULL;
  508. qdisc_destroy(qdisc);
  509. }
  510. #endif
  511. BUG_TRAP(!timer_pending(&dev->watchdog_timer));
  512. qdisc_unlock_tree(dev);
  513. }
  514. EXPORT_SYMBOL(__netdev_watchdog_up);
  515. EXPORT_SYMBOL(netif_carrier_on);
  516. EXPORT_SYMBOL(netif_carrier_off);
  517. EXPORT_SYMBOL(noop_qdisc);
  518. EXPORT_SYMBOL(noop_qdisc_ops);
  519. EXPORT_SYMBOL(qdisc_create_dflt);
  520. EXPORT_SYMBOL(qdisc_alloc);
  521. EXPORT_SYMBOL(qdisc_destroy);
  522. EXPORT_SYMBOL(qdisc_reset);
  523. EXPORT_SYMBOL(qdisc_restart);
  524. EXPORT_SYMBOL(qdisc_lock_tree);
  525. EXPORT_SYMBOL(qdisc_unlock_tree);