sch_fifo.c 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180
  1. /*
  2. * net/sched/sch_fifo.c The simplest FIFO queue.
  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. */
  11. #include <linux/module.h>
  12. #include <linux/slab.h>
  13. #include <linux/types.h>
  14. #include <linux/kernel.h>
  15. #include <linux/errno.h>
  16. #include <linux/skbuff.h>
  17. #include <net/pkt_sched.h>
  18. /* 1 band FIFO pseudo-"scheduler" */
  19. static int bfifo_enqueue(struct sk_buff *skb, struct Qdisc *sch)
  20. {
  21. if (likely(sch->qstats.backlog + qdisc_pkt_len(skb) <= sch->limit))
  22. return qdisc_enqueue_tail(skb, sch);
  23. return qdisc_reshape_fail(skb, sch);
  24. }
  25. static int pfifo_enqueue(struct sk_buff *skb, struct Qdisc *sch)
  26. {
  27. if (likely(skb_queue_len(&sch->q) < sch->limit))
  28. return qdisc_enqueue_tail(skb, sch);
  29. return qdisc_reshape_fail(skb, sch);
  30. }
  31. static int pfifo_tail_enqueue(struct sk_buff *skb, struct Qdisc *sch)
  32. {
  33. if (likely(skb_queue_len(&sch->q) < sch->limit))
  34. return qdisc_enqueue_tail(skb, sch);
  35. /* queue full, remove one skb to fulfill the limit */
  36. __qdisc_queue_drop_head(sch, &sch->q);
  37. sch->qstats.drops++;
  38. qdisc_enqueue_tail(skb, sch);
  39. return NET_XMIT_CN;
  40. }
  41. static int fifo_init(struct Qdisc *sch, struct nlattr *opt)
  42. {
  43. bool bypass;
  44. bool is_bfifo = sch->ops == &bfifo_qdisc_ops;
  45. if (opt == NULL) {
  46. u32 limit = qdisc_dev(sch)->tx_queue_len ? : 1;
  47. if (is_bfifo)
  48. limit *= psched_mtu(qdisc_dev(sch));
  49. sch->limit = limit;
  50. } else {
  51. struct tc_fifo_qopt *ctl = nla_data(opt);
  52. if (nla_len(opt) < sizeof(*ctl))
  53. return -EINVAL;
  54. sch->limit = ctl->limit;
  55. }
  56. if (is_bfifo)
  57. bypass = sch->limit >= psched_mtu(qdisc_dev(sch));
  58. else
  59. bypass = sch->limit >= 1;
  60. if (bypass)
  61. sch->flags |= TCQ_F_CAN_BYPASS;
  62. else
  63. sch->flags &= ~TCQ_F_CAN_BYPASS;
  64. return 0;
  65. }
  66. static int fifo_dump(struct Qdisc *sch, struct sk_buff *skb)
  67. {
  68. struct tc_fifo_qopt opt = { .limit = sch->limit };
  69. NLA_PUT(skb, TCA_OPTIONS, sizeof(opt), &opt);
  70. return skb->len;
  71. nla_put_failure:
  72. return -1;
  73. }
  74. struct Qdisc_ops pfifo_qdisc_ops __read_mostly = {
  75. .id = "pfifo",
  76. .priv_size = 0,
  77. .enqueue = pfifo_enqueue,
  78. .dequeue = qdisc_dequeue_head,
  79. .peek = qdisc_peek_head,
  80. .drop = qdisc_queue_drop,
  81. .init = fifo_init,
  82. .reset = qdisc_reset_queue,
  83. .change = fifo_init,
  84. .dump = fifo_dump,
  85. .owner = THIS_MODULE,
  86. };
  87. EXPORT_SYMBOL(pfifo_qdisc_ops);
  88. struct Qdisc_ops bfifo_qdisc_ops __read_mostly = {
  89. .id = "bfifo",
  90. .priv_size = 0,
  91. .enqueue = bfifo_enqueue,
  92. .dequeue = qdisc_dequeue_head,
  93. .peek = qdisc_peek_head,
  94. .drop = qdisc_queue_drop,
  95. .init = fifo_init,
  96. .reset = qdisc_reset_queue,
  97. .change = fifo_init,
  98. .dump = fifo_dump,
  99. .owner = THIS_MODULE,
  100. };
  101. EXPORT_SYMBOL(bfifo_qdisc_ops);
  102. struct Qdisc_ops pfifo_head_drop_qdisc_ops __read_mostly = {
  103. .id = "pfifo_head_drop",
  104. .priv_size = 0,
  105. .enqueue = pfifo_tail_enqueue,
  106. .dequeue = qdisc_dequeue_head,
  107. .peek = qdisc_peek_head,
  108. .drop = qdisc_queue_drop_head,
  109. .init = fifo_init,
  110. .reset = qdisc_reset_queue,
  111. .change = fifo_init,
  112. .dump = fifo_dump,
  113. .owner = THIS_MODULE,
  114. };
  115. /* Pass size change message down to embedded FIFO */
  116. int fifo_set_limit(struct Qdisc *q, unsigned int limit)
  117. {
  118. struct nlattr *nla;
  119. int ret = -ENOMEM;
  120. /* Hack to avoid sending change message to non-FIFO */
  121. if (strncmp(q->ops->id + 1, "fifo", 4) != 0)
  122. return 0;
  123. nla = kmalloc(nla_attr_size(sizeof(struct tc_fifo_qopt)), GFP_KERNEL);
  124. if (nla) {
  125. nla->nla_type = RTM_NEWQDISC;
  126. nla->nla_len = nla_attr_size(sizeof(struct tc_fifo_qopt));
  127. ((struct tc_fifo_qopt *)nla_data(nla))->limit = limit;
  128. ret = q->ops->change(q, nla);
  129. kfree(nla);
  130. }
  131. return ret;
  132. }
  133. EXPORT_SYMBOL(fifo_set_limit);
  134. struct Qdisc *fifo_create_dflt(struct Qdisc *sch, struct Qdisc_ops *ops,
  135. unsigned int limit)
  136. {
  137. struct Qdisc *q;
  138. int err = -ENOMEM;
  139. q = qdisc_create_dflt(sch->dev_queue, ops, TC_H_MAKE(sch->handle, 1));
  140. if (q) {
  141. err = fifo_set_limit(q, limit);
  142. if (err < 0) {
  143. qdisc_destroy(q);
  144. q = NULL;
  145. }
  146. }
  147. return q ? : ERR_PTR(err);
  148. }
  149. EXPORT_SYMBOL(fifo_create_dflt);