sch_fifo.c 4.3 KB

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