sch_generic.h 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609
  1. #ifndef __NET_SCHED_GENERIC_H
  2. #define __NET_SCHED_GENERIC_H
  3. #include <linux/netdevice.h>
  4. #include <linux/types.h>
  5. #include <linux/rcupdate.h>
  6. #include <linux/module.h>
  7. #include <linux/pkt_sched.h>
  8. #include <linux/pkt_cls.h>
  9. #include <net/gen_stats.h>
  10. #include <net/rtnetlink.h>
  11. struct Qdisc_ops;
  12. struct qdisc_walker;
  13. struct tcf_walker;
  14. struct module;
  15. struct qdisc_rate_table {
  16. struct tc_ratespec rate;
  17. u32 data[256];
  18. struct qdisc_rate_table *next;
  19. int refcnt;
  20. };
  21. enum qdisc_state_t {
  22. __QDISC_STATE_SCHED,
  23. __QDISC_STATE_DEACTIVATED,
  24. };
  25. /*
  26. * following bits are only changed while qdisc lock is held
  27. */
  28. enum qdisc___state_t {
  29. __QDISC___STATE_RUNNING,
  30. };
  31. struct qdisc_size_table {
  32. struct list_head list;
  33. struct tc_sizespec szopts;
  34. int refcnt;
  35. u16 data[];
  36. };
  37. struct Qdisc {
  38. int (*enqueue)(struct sk_buff *skb, struct Qdisc *dev);
  39. struct sk_buff * (*dequeue)(struct Qdisc *dev);
  40. unsigned flags;
  41. #define TCQ_F_BUILTIN 1
  42. #define TCQ_F_THROTTLED 2
  43. #define TCQ_F_INGRESS 4
  44. #define TCQ_F_CAN_BYPASS 8
  45. #define TCQ_F_MQROOT 16
  46. #define TCQ_F_WARN_NONWC (1 << 16)
  47. int padded;
  48. struct Qdisc_ops *ops;
  49. struct qdisc_size_table *stab;
  50. struct list_head list;
  51. u32 handle;
  52. u32 parent;
  53. atomic_t refcnt;
  54. struct gnet_stats_rate_est rate_est;
  55. int (*reshape_fail)(struct sk_buff *skb,
  56. struct Qdisc *q);
  57. void *u32_node;
  58. /* This field is deprecated, but it is still used by CBQ
  59. * and it will live until better solution will be invented.
  60. */
  61. struct Qdisc *__parent;
  62. struct netdev_queue *dev_queue;
  63. struct Qdisc *next_sched;
  64. struct sk_buff *gso_skb;
  65. /*
  66. * For performance sake on SMP, we put highly modified fields at the end
  67. */
  68. unsigned long state;
  69. struct sk_buff_head q;
  70. struct gnet_stats_basic_packed bstats;
  71. unsigned long __state;
  72. struct gnet_stats_queue qstats;
  73. struct rcu_head rcu_head;
  74. };
  75. static inline bool qdisc_is_running(struct Qdisc *qdisc)
  76. {
  77. return test_bit(__QDISC___STATE_RUNNING, &qdisc->__state);
  78. }
  79. static inline bool qdisc_run_begin(struct Qdisc *qdisc)
  80. {
  81. return !__test_and_set_bit(__QDISC___STATE_RUNNING, &qdisc->__state);
  82. }
  83. static inline void qdisc_run_end(struct Qdisc *qdisc)
  84. {
  85. __clear_bit(__QDISC___STATE_RUNNING, &qdisc->__state);
  86. }
  87. struct Qdisc_class_ops {
  88. /* Child qdisc manipulation */
  89. struct netdev_queue * (*select_queue)(struct Qdisc *, struct tcmsg *);
  90. int (*graft)(struct Qdisc *, unsigned long cl,
  91. struct Qdisc *, struct Qdisc **);
  92. struct Qdisc * (*leaf)(struct Qdisc *, unsigned long cl);
  93. void (*qlen_notify)(struct Qdisc *, unsigned long);
  94. /* Class manipulation routines */
  95. unsigned long (*get)(struct Qdisc *, u32 classid);
  96. void (*put)(struct Qdisc *, unsigned long);
  97. int (*change)(struct Qdisc *, u32, u32,
  98. struct nlattr **, unsigned long *);
  99. int (*delete)(struct Qdisc *, unsigned long);
  100. void (*walk)(struct Qdisc *, struct qdisc_walker * arg);
  101. /* Filter manipulation */
  102. struct tcf_proto ** (*tcf_chain)(struct Qdisc *, unsigned long);
  103. unsigned long (*bind_tcf)(struct Qdisc *, unsigned long,
  104. u32 classid);
  105. void (*unbind_tcf)(struct Qdisc *, unsigned long);
  106. /* rtnetlink specific */
  107. int (*dump)(struct Qdisc *, unsigned long,
  108. struct sk_buff *skb, struct tcmsg*);
  109. int (*dump_stats)(struct Qdisc *, unsigned long,
  110. struct gnet_dump *);
  111. };
  112. struct Qdisc_ops {
  113. struct Qdisc_ops *next;
  114. const struct Qdisc_class_ops *cl_ops;
  115. char id[IFNAMSIZ];
  116. int priv_size;
  117. int (*enqueue)(struct sk_buff *, struct Qdisc *);
  118. struct sk_buff * (*dequeue)(struct Qdisc *);
  119. struct sk_buff * (*peek)(struct Qdisc *);
  120. unsigned int (*drop)(struct Qdisc *);
  121. int (*init)(struct Qdisc *, struct nlattr *arg);
  122. void (*reset)(struct Qdisc *);
  123. void (*destroy)(struct Qdisc *);
  124. int (*change)(struct Qdisc *, struct nlattr *arg);
  125. void (*attach)(struct Qdisc *);
  126. int (*dump)(struct Qdisc *, struct sk_buff *);
  127. int (*dump_stats)(struct Qdisc *, struct gnet_dump *);
  128. struct module *owner;
  129. };
  130. struct tcf_result {
  131. unsigned long class;
  132. u32 classid;
  133. };
  134. struct tcf_proto_ops {
  135. struct tcf_proto_ops *next;
  136. char kind[IFNAMSIZ];
  137. int (*classify)(struct sk_buff*, struct tcf_proto*,
  138. struct tcf_result *);
  139. int (*init)(struct tcf_proto*);
  140. void (*destroy)(struct tcf_proto*);
  141. unsigned long (*get)(struct tcf_proto*, u32 handle);
  142. void (*put)(struct tcf_proto*, unsigned long);
  143. int (*change)(struct tcf_proto*, unsigned long,
  144. u32 handle, struct nlattr **,
  145. unsigned long *);
  146. int (*delete)(struct tcf_proto*, unsigned long);
  147. void (*walk)(struct tcf_proto*, struct tcf_walker *arg);
  148. /* rtnetlink specific */
  149. int (*dump)(struct tcf_proto*, unsigned long,
  150. struct sk_buff *skb, struct tcmsg*);
  151. struct module *owner;
  152. };
  153. struct tcf_proto {
  154. /* Fast access part */
  155. struct tcf_proto *next;
  156. void *root;
  157. int (*classify)(struct sk_buff*, struct tcf_proto*,
  158. struct tcf_result *);
  159. __be16 protocol;
  160. /* All the rest */
  161. u32 prio;
  162. u32 classid;
  163. struct Qdisc *q;
  164. void *data;
  165. struct tcf_proto_ops *ops;
  166. };
  167. struct qdisc_skb_cb {
  168. unsigned int pkt_len;
  169. char data[];
  170. };
  171. static inline int qdisc_qlen(struct Qdisc *q)
  172. {
  173. return q->q.qlen;
  174. }
  175. static inline struct qdisc_skb_cb *qdisc_skb_cb(struct sk_buff *skb)
  176. {
  177. return (struct qdisc_skb_cb *)skb->cb;
  178. }
  179. static inline spinlock_t *qdisc_lock(struct Qdisc *qdisc)
  180. {
  181. return &qdisc->q.lock;
  182. }
  183. static inline struct Qdisc *qdisc_root(struct Qdisc *qdisc)
  184. {
  185. return qdisc->dev_queue->qdisc;
  186. }
  187. static inline struct Qdisc *qdisc_root_sleeping(struct Qdisc *qdisc)
  188. {
  189. return qdisc->dev_queue->qdisc_sleeping;
  190. }
  191. /* The qdisc root lock is a mechanism by which to top level
  192. * of a qdisc tree can be locked from any qdisc node in the
  193. * forest. This allows changing the configuration of some
  194. * aspect of the qdisc tree while blocking out asynchronous
  195. * qdisc access in the packet processing paths.
  196. *
  197. * It is only legal to do this when the root will not change
  198. * on us. Otherwise we'll potentially lock the wrong qdisc
  199. * root. This is enforced by holding the RTNL semaphore, which
  200. * all users of this lock accessor must do.
  201. */
  202. static inline spinlock_t *qdisc_root_lock(struct Qdisc *qdisc)
  203. {
  204. struct Qdisc *root = qdisc_root(qdisc);
  205. ASSERT_RTNL();
  206. return qdisc_lock(root);
  207. }
  208. static inline spinlock_t *qdisc_root_sleeping_lock(struct Qdisc *qdisc)
  209. {
  210. struct Qdisc *root = qdisc_root_sleeping(qdisc);
  211. ASSERT_RTNL();
  212. return qdisc_lock(root);
  213. }
  214. static inline struct net_device *qdisc_dev(struct Qdisc *qdisc)
  215. {
  216. return qdisc->dev_queue->dev;
  217. }
  218. static inline void sch_tree_lock(struct Qdisc *q)
  219. {
  220. spin_lock_bh(qdisc_root_sleeping_lock(q));
  221. }
  222. static inline void sch_tree_unlock(struct Qdisc *q)
  223. {
  224. spin_unlock_bh(qdisc_root_sleeping_lock(q));
  225. }
  226. #define tcf_tree_lock(tp) sch_tree_lock((tp)->q)
  227. #define tcf_tree_unlock(tp) sch_tree_unlock((tp)->q)
  228. extern struct Qdisc noop_qdisc;
  229. extern struct Qdisc_ops noop_qdisc_ops;
  230. extern struct Qdisc_ops pfifo_fast_ops;
  231. extern struct Qdisc_ops mq_qdisc_ops;
  232. struct Qdisc_class_common {
  233. u32 classid;
  234. struct hlist_node hnode;
  235. };
  236. struct Qdisc_class_hash {
  237. struct hlist_head *hash;
  238. unsigned int hashsize;
  239. unsigned int hashmask;
  240. unsigned int hashelems;
  241. };
  242. static inline unsigned int qdisc_class_hash(u32 id, u32 mask)
  243. {
  244. id ^= id >> 8;
  245. id ^= id >> 4;
  246. return id & mask;
  247. }
  248. static inline struct Qdisc_class_common *
  249. qdisc_class_find(struct Qdisc_class_hash *hash, u32 id)
  250. {
  251. struct Qdisc_class_common *cl;
  252. struct hlist_node *n;
  253. unsigned int h;
  254. h = qdisc_class_hash(id, hash->hashmask);
  255. hlist_for_each_entry(cl, n, &hash->hash[h], hnode) {
  256. if (cl->classid == id)
  257. return cl;
  258. }
  259. return NULL;
  260. }
  261. extern int qdisc_class_hash_init(struct Qdisc_class_hash *);
  262. extern void qdisc_class_hash_insert(struct Qdisc_class_hash *, struct Qdisc_class_common *);
  263. extern void qdisc_class_hash_remove(struct Qdisc_class_hash *, struct Qdisc_class_common *);
  264. extern void qdisc_class_hash_grow(struct Qdisc *, struct Qdisc_class_hash *);
  265. extern void qdisc_class_hash_destroy(struct Qdisc_class_hash *);
  266. extern void dev_init_scheduler(struct net_device *dev);
  267. extern void dev_shutdown(struct net_device *dev);
  268. extern void dev_activate(struct net_device *dev);
  269. extern void dev_deactivate(struct net_device *dev);
  270. extern struct Qdisc *dev_graft_qdisc(struct netdev_queue *dev_queue,
  271. struct Qdisc *qdisc);
  272. extern void qdisc_reset(struct Qdisc *qdisc);
  273. extern void qdisc_destroy(struct Qdisc *qdisc);
  274. extern void qdisc_tree_decrease_qlen(struct Qdisc *qdisc, unsigned int n);
  275. extern struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
  276. struct Qdisc_ops *ops);
  277. extern struct Qdisc *qdisc_create_dflt(struct net_device *dev,
  278. struct netdev_queue *dev_queue,
  279. struct Qdisc_ops *ops, u32 parentid);
  280. extern void qdisc_calculate_pkt_len(struct sk_buff *skb,
  281. struct qdisc_size_table *stab);
  282. extern void tcf_destroy(struct tcf_proto *tp);
  283. extern void tcf_destroy_chain(struct tcf_proto **fl);
  284. /* Reset all TX qdiscs of a device. */
  285. static inline void qdisc_reset_all_tx(struct net_device *dev)
  286. {
  287. unsigned int i;
  288. for (i = 0; i < dev->num_tx_queues; i++)
  289. qdisc_reset(netdev_get_tx_queue(dev, i)->qdisc);
  290. }
  291. /* Are all TX queues of the device empty? */
  292. static inline bool qdisc_all_tx_empty(const struct net_device *dev)
  293. {
  294. unsigned int i;
  295. for (i = 0; i < dev->num_tx_queues; i++) {
  296. struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
  297. const struct Qdisc *q = txq->qdisc;
  298. if (q->q.qlen)
  299. return false;
  300. }
  301. return true;
  302. }
  303. /* Are any of the TX qdiscs changing? */
  304. static inline bool qdisc_tx_changing(struct net_device *dev)
  305. {
  306. unsigned int i;
  307. for (i = 0; i < dev->num_tx_queues; i++) {
  308. struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
  309. if (txq->qdisc != txq->qdisc_sleeping)
  310. return true;
  311. }
  312. return false;
  313. }
  314. /* Is the device using the noop qdisc on all queues? */
  315. static inline bool qdisc_tx_is_noop(const struct net_device *dev)
  316. {
  317. unsigned int i;
  318. for (i = 0; i < dev->num_tx_queues; i++) {
  319. struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
  320. if (txq->qdisc != &noop_qdisc)
  321. return false;
  322. }
  323. return true;
  324. }
  325. static inline unsigned int qdisc_pkt_len(struct sk_buff *skb)
  326. {
  327. return qdisc_skb_cb(skb)->pkt_len;
  328. }
  329. /* additional qdisc xmit flags (NET_XMIT_MASK in linux/netdevice.h) */
  330. enum net_xmit_qdisc_t {
  331. __NET_XMIT_STOLEN = 0x00010000,
  332. __NET_XMIT_BYPASS = 0x00020000,
  333. };
  334. #ifdef CONFIG_NET_CLS_ACT
  335. #define net_xmit_drop_count(e) ((e) & __NET_XMIT_STOLEN ? 0 : 1)
  336. #else
  337. #define net_xmit_drop_count(e) (1)
  338. #endif
  339. static inline int qdisc_enqueue(struct sk_buff *skb, struct Qdisc *sch)
  340. {
  341. #ifdef CONFIG_NET_SCHED
  342. if (sch->stab)
  343. qdisc_calculate_pkt_len(skb, sch->stab);
  344. #endif
  345. return sch->enqueue(skb, sch);
  346. }
  347. static inline int qdisc_enqueue_root(struct sk_buff *skb, struct Qdisc *sch)
  348. {
  349. qdisc_skb_cb(skb)->pkt_len = skb->len;
  350. return qdisc_enqueue(skb, sch) & NET_XMIT_MASK;
  351. }
  352. static inline void __qdisc_update_bstats(struct Qdisc *sch, unsigned int len)
  353. {
  354. sch->bstats.bytes += len;
  355. sch->bstats.packets++;
  356. }
  357. static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
  358. struct sk_buff_head *list)
  359. {
  360. __skb_queue_tail(list, skb);
  361. sch->qstats.backlog += qdisc_pkt_len(skb);
  362. __qdisc_update_bstats(sch, qdisc_pkt_len(skb));
  363. return NET_XMIT_SUCCESS;
  364. }
  365. static inline int qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch)
  366. {
  367. return __qdisc_enqueue_tail(skb, sch, &sch->q);
  368. }
  369. static inline struct sk_buff *__qdisc_dequeue_head(struct Qdisc *sch,
  370. struct sk_buff_head *list)
  371. {
  372. struct sk_buff *skb = __skb_dequeue(list);
  373. if (likely(skb != NULL))
  374. sch->qstats.backlog -= qdisc_pkt_len(skb);
  375. return skb;
  376. }
  377. static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
  378. {
  379. return __qdisc_dequeue_head(sch, &sch->q);
  380. }
  381. static inline unsigned int __qdisc_queue_drop_head(struct Qdisc *sch,
  382. struct sk_buff_head *list)
  383. {
  384. struct sk_buff *skb = __qdisc_dequeue_head(sch, list);
  385. if (likely(skb != NULL)) {
  386. unsigned int len = qdisc_pkt_len(skb);
  387. kfree_skb(skb);
  388. return len;
  389. }
  390. return 0;
  391. }
  392. static inline unsigned int qdisc_queue_drop_head(struct Qdisc *sch)
  393. {
  394. return __qdisc_queue_drop_head(sch, &sch->q);
  395. }
  396. static inline struct sk_buff *__qdisc_dequeue_tail(struct Qdisc *sch,
  397. struct sk_buff_head *list)
  398. {
  399. struct sk_buff *skb = __skb_dequeue_tail(list);
  400. if (likely(skb != NULL))
  401. sch->qstats.backlog -= qdisc_pkt_len(skb);
  402. return skb;
  403. }
  404. static inline struct sk_buff *qdisc_dequeue_tail(struct Qdisc *sch)
  405. {
  406. return __qdisc_dequeue_tail(sch, &sch->q);
  407. }
  408. static inline struct sk_buff *qdisc_peek_head(struct Qdisc *sch)
  409. {
  410. return skb_peek(&sch->q);
  411. }
  412. /* generic pseudo peek method for non-work-conserving qdisc */
  413. static inline struct sk_buff *qdisc_peek_dequeued(struct Qdisc *sch)
  414. {
  415. /* we can reuse ->gso_skb because peek isn't called for root qdiscs */
  416. if (!sch->gso_skb) {
  417. sch->gso_skb = sch->dequeue(sch);
  418. if (sch->gso_skb)
  419. /* it's still part of the queue */
  420. sch->q.qlen++;
  421. }
  422. return sch->gso_skb;
  423. }
  424. /* use instead of qdisc->dequeue() for all qdiscs queried with ->peek() */
  425. static inline struct sk_buff *qdisc_dequeue_peeked(struct Qdisc *sch)
  426. {
  427. struct sk_buff *skb = sch->gso_skb;
  428. if (skb) {
  429. sch->gso_skb = NULL;
  430. sch->q.qlen--;
  431. } else {
  432. skb = sch->dequeue(sch);
  433. }
  434. return skb;
  435. }
  436. static inline void __qdisc_reset_queue(struct Qdisc *sch,
  437. struct sk_buff_head *list)
  438. {
  439. /*
  440. * We do not know the backlog in bytes of this list, it
  441. * is up to the caller to correct it
  442. */
  443. __skb_queue_purge(list);
  444. }
  445. static inline void qdisc_reset_queue(struct Qdisc *sch)
  446. {
  447. __qdisc_reset_queue(sch, &sch->q);
  448. sch->qstats.backlog = 0;
  449. }
  450. static inline unsigned int __qdisc_queue_drop(struct Qdisc *sch,
  451. struct sk_buff_head *list)
  452. {
  453. struct sk_buff *skb = __qdisc_dequeue_tail(sch, list);
  454. if (likely(skb != NULL)) {
  455. unsigned int len = qdisc_pkt_len(skb);
  456. kfree_skb(skb);
  457. return len;
  458. }
  459. return 0;
  460. }
  461. static inline unsigned int qdisc_queue_drop(struct Qdisc *sch)
  462. {
  463. return __qdisc_queue_drop(sch, &sch->q);
  464. }
  465. static inline int qdisc_drop(struct sk_buff *skb, struct Qdisc *sch)
  466. {
  467. kfree_skb(skb);
  468. sch->qstats.drops++;
  469. return NET_XMIT_DROP;
  470. }
  471. static inline int qdisc_reshape_fail(struct sk_buff *skb, struct Qdisc *sch)
  472. {
  473. sch->qstats.drops++;
  474. #ifdef CONFIG_NET_CLS_ACT
  475. if (sch->reshape_fail == NULL || sch->reshape_fail(skb, sch))
  476. goto drop;
  477. return NET_XMIT_SUCCESS;
  478. drop:
  479. #endif
  480. kfree_skb(skb);
  481. return NET_XMIT_DROP;
  482. }
  483. /* Length to Time (L2T) lookup in a qdisc_rate_table, to determine how
  484. long it will take to send a packet given its size.
  485. */
  486. static inline u32 qdisc_l2t(struct qdisc_rate_table* rtab, unsigned int pktlen)
  487. {
  488. int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
  489. if (slot < 0)
  490. slot = 0;
  491. slot >>= rtab->rate.cell_log;
  492. if (slot > 255)
  493. return (rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF]);
  494. return rtab->data[slot];
  495. }
  496. #ifdef CONFIG_NET_CLS_ACT
  497. static inline struct sk_buff *skb_act_clone(struct sk_buff *skb, gfp_t gfp_mask)
  498. {
  499. struct sk_buff *n = skb_clone(skb, gfp_mask);
  500. if (n) {
  501. n->tc_verd = SET_TC_VERD(n->tc_verd, 0);
  502. n->tc_verd = CLR_TC_OK2MUNGE(n->tc_verd);
  503. n->tc_verd = CLR_TC_MUNGED(n->tc_verd);
  504. }
  505. return n;
  506. }
  507. #endif
  508. #endif