sch_generic.h 19.0 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8
#ifndef __NET_SCHED_GENERIC_H
#define __NET_SCHED_GENERIC_H

#include <linux/netdevice.h>
#include <linux/types.h>
#include <linux/rcupdate.h>
#include <linux/pkt_sched.h>
#include <linux/pkt_cls.h>
9
#include <linux/percpu.h>
L
Linus Torvalds 已提交
10
#include <net/gen_stats.h>
11
#include <net/rtnetlink.h>
L
Linus Torvalds 已提交
12 13 14 15 16 17

struct Qdisc_ops;
struct qdisc_walker;
struct tcf_walker;
struct module;

E
Eric Dumazet 已提交
18
struct qdisc_rate_table {
L
Linus Torvalds 已提交
19 20 21 22 23 24
	struct tc_ratespec rate;
	u32		data[256];
	struct qdisc_rate_table *next;
	int		refcnt;
};

E
Eric Dumazet 已提交
25
enum qdisc_state_t {
26
	__QDISC_STATE_SCHED,
27
	__QDISC_STATE_DEACTIVATED,
28
	__QDISC_STATE_THROTTLED,
29 30
};

31 32 33 34
/*
 * following bits are only changed while qdisc lock is held
 */
enum qdisc___state_t {
35
	__QDISC___STATE_RUNNING = 1,
36 37
};

38
struct qdisc_size_table {
E
Eric Dumazet 已提交
39
	struct rcu_head		rcu;
40 41 42 43 44 45
	struct list_head	list;
	struct tc_sizespec	szopts;
	int			refcnt;
	u16			data[];
};

E
Eric Dumazet 已提交
46
struct Qdisc {
L
Linus Torvalds 已提交
47 48
	int 			(*enqueue)(struct sk_buff *skb, struct Qdisc *dev);
	struct sk_buff *	(*dequeue)(struct Qdisc *dev);
49
	unsigned int		flags;
50
#define TCQ_F_BUILTIN		1
51 52 53
#define TCQ_F_INGRESS		2
#define TCQ_F_CAN_BYPASS	4
#define TCQ_F_MQROOT		8
54 55 56 57 58 59 60
#define TCQ_F_ONETXQUEUE	0x10 /* dequeue_skb() can assume all skbs are for
				      * q->dev_queue : It can test
				      * netif_xmit_frozen_or_stopped() before
				      * dequeueing next packet.
				      * Its true for MQ/MQPRIO slaves, or non
				      * multiqueue device.
				      */
61
#define TCQ_F_WARN_NONWC	(1 << 16)
62
#define TCQ_F_CPUSTATS		0x20 /* run using percpu statistics */
63
	u32			limit;
64
	const struct Qdisc_ops	*ops;
E
Eric Dumazet 已提交
65
	struct qdisc_size_table	__rcu *stab;
66
	struct list_head	list;
L
Linus Torvalds 已提交
67 68 69 70 71
	u32			handle;
	u32			parent;
	int			(*reshape_fail)(struct sk_buff *skb,
					struct Qdisc *q);

72 73
	void			*u32_node;

L
Linus Torvalds 已提交
74 75 76 77
	/* This field is deprecated, but it is still used by CBQ
	 * and it will live until better solution will be invented.
	 */
	struct Qdisc		*__parent;
78 79
	struct netdev_queue	*dev_queue;

80 81
	struct gnet_stats_rate_est64	rate_est;
	struct Qdisc		*next_sched;
82 83 84 85 86 87
	struct sk_buff		*gso_skb;
	/*
	 * For performance sake on SMP, we put highly modified fields at the end
	 */
	unsigned long		state;
	struct sk_buff_head	q;
88 89 90 91
	union {
		struct gnet_stats_basic_packed bstats;
		struct gnet_stats_basic_cpu __percpu *cpu_bstats;
	} __packed;
92
	unsigned int		__state;
93
	struct gnet_stats_queue	qstats;
94
	struct rcu_head		rcu_head;
95 96 97 98
	int			padded;
	atomic_t		refcnt;

	spinlock_t		busylock ____cacheline_aligned_in_smp;
L
Linus Torvalds 已提交
99 100
};

101
static inline bool qdisc_is_running(const struct Qdisc *qdisc)
102
{
103
	return (qdisc->__state & __QDISC___STATE_RUNNING) ? true : false;
104 105 106 107
}

static inline bool qdisc_run_begin(struct Qdisc *qdisc)
{
108 109 110 111
	if (qdisc_is_running(qdisc))
		return false;
	qdisc->__state |= __QDISC___STATE_RUNNING;
	return true;
112 113 114 115
}

static inline void qdisc_run_end(struct Qdisc *qdisc)
{
116 117 118 119 120
	qdisc->__state &= ~__QDISC___STATE_RUNNING;
}

static inline bool qdisc_is_throttled(const struct Qdisc *qdisc)
{
121
	return test_bit(__QDISC_STATE_THROTTLED, &qdisc->state) ? true : false;
122 123 124 125
}

static inline void qdisc_throttled(struct Qdisc *qdisc)
{
126
	set_bit(__QDISC_STATE_THROTTLED, &qdisc->state);
127 128 129 130
}

static inline void qdisc_unthrottled(struct Qdisc *qdisc)
{
131
	clear_bit(__QDISC_STATE_THROTTLED, &qdisc->state);
132 133
}

E
Eric Dumazet 已提交
134
struct Qdisc_class_ops {
L
Linus Torvalds 已提交
135
	/* Child qdisc manipulation */
136
	struct netdev_queue *	(*select_queue)(struct Qdisc *, struct tcmsg *);
L
Linus Torvalds 已提交
137 138 139
	int			(*graft)(struct Qdisc *, unsigned long cl,
					struct Qdisc *, struct Qdisc **);
	struct Qdisc *		(*leaf)(struct Qdisc *, unsigned long cl);
140
	void			(*qlen_notify)(struct Qdisc *, unsigned long);
L
Linus Torvalds 已提交
141 142 143 144 145

	/* Class manipulation routines */
	unsigned long		(*get)(struct Qdisc *, u32 classid);
	void			(*put)(struct Qdisc *, unsigned long);
	int			(*change)(struct Qdisc *, u32, u32,
146
					struct nlattr **, unsigned long *);
L
Linus Torvalds 已提交
147 148 149 150
	int			(*delete)(struct Qdisc *, unsigned long);
	void			(*walk)(struct Qdisc *, struct qdisc_walker * arg);

	/* Filter manipulation */
J
John Fastabend 已提交
151
	struct tcf_proto __rcu ** (*tcf_chain)(struct Qdisc *, unsigned long);
L
Linus Torvalds 已提交
152 153 154 155 156 157 158 159 160 161 162
	unsigned long		(*bind_tcf)(struct Qdisc *, unsigned long,
					u32 classid);
	void			(*unbind_tcf)(struct Qdisc *, unsigned long);

	/* rtnetlink specific */
	int			(*dump)(struct Qdisc *, unsigned long,
					struct sk_buff *skb, struct tcmsg*);
	int			(*dump_stats)(struct Qdisc *, unsigned long,
					struct gnet_dump *);
};

E
Eric Dumazet 已提交
163
struct Qdisc_ops {
L
Linus Torvalds 已提交
164
	struct Qdisc_ops	*next;
165
	const struct Qdisc_class_ops	*cl_ops;
L
Linus Torvalds 已提交
166 167 168 169 170
	char			id[IFNAMSIZ];
	int			priv_size;

	int 			(*enqueue)(struct sk_buff *, struct Qdisc *);
	struct sk_buff *	(*dequeue)(struct Qdisc *);
171
	struct sk_buff *	(*peek)(struct Qdisc *);
L
Linus Torvalds 已提交
172 173
	unsigned int		(*drop)(struct Qdisc *);

174
	int			(*init)(struct Qdisc *, struct nlattr *arg);
L
Linus Torvalds 已提交
175 176
	void			(*reset)(struct Qdisc *);
	void			(*destroy)(struct Qdisc *);
177
	int			(*change)(struct Qdisc *, struct nlattr *arg);
178
	void			(*attach)(struct Qdisc *);
L
Linus Torvalds 已提交
179 180 181 182 183 184 185 186

	int			(*dump)(struct Qdisc *, struct sk_buff *);
	int			(*dump_stats)(struct Qdisc *, struct gnet_dump *);

	struct module		*owner;
};


E
Eric Dumazet 已提交
187
struct tcf_result {
L
Linus Torvalds 已提交
188 189 190 191
	unsigned long	class;
	u32		classid;
};

E
Eric Dumazet 已提交
192
struct tcf_proto_ops {
193
	struct list_head	head;
L
Linus Torvalds 已提交
194 195
	char			kind[IFNAMSIZ];

196 197 198
	int			(*classify)(struct sk_buff *,
					    const struct tcf_proto *,
					    struct tcf_result *);
L
Linus Torvalds 已提交
199 200 201 202 203
	int			(*init)(struct tcf_proto*);
	void			(*destroy)(struct tcf_proto*);

	unsigned long		(*get)(struct tcf_proto*, u32 handle);
	void			(*put)(struct tcf_proto*, unsigned long);
204
	int			(*change)(struct net *net, struct sk_buff *,
205
					struct tcf_proto*, unsigned long,
206
					u32 handle, struct nlattr **,
207
					unsigned long *, bool);
L
Linus Torvalds 已提交
208 209 210 211
	int			(*delete)(struct tcf_proto*, unsigned long);
	void			(*walk)(struct tcf_proto*, struct tcf_walker *arg);

	/* rtnetlink specific */
212
	int			(*dump)(struct net*, struct tcf_proto*, unsigned long,
L
Linus Torvalds 已提交
213 214 215 216 217
					struct sk_buff *skb, struct tcmsg*);

	struct module		*owner;
};

E
Eric Dumazet 已提交
218
struct tcf_proto {
L
Linus Torvalds 已提交
219
	/* Fast access part */
J
John Fastabend 已提交
220 221
	struct tcf_proto __rcu	*next;
	void __rcu		*root;
222 223 224
	int			(*classify)(struct sk_buff *,
					    const struct tcf_proto *,
					    struct tcf_result *);
A
Al Viro 已提交
225
	__be16			protocol;
L
Linus Torvalds 已提交
226 227 228 229 230 231

	/* All the rest */
	u32			prio;
	u32			classid;
	struct Qdisc		*q;
	void			*data;
232
	const struct tcf_proto_ops	*ops;
J
John Fastabend 已提交
233
	struct rcu_head		rcu;
L
Linus Torvalds 已提交
234 235
};

236 237
struct qdisc_skb_cb {
	unsigned int		pkt_len;
238
	u16			slave_dev_queue_mapping;
239
	u16			_pad;
240 241
#define QDISC_CB_PRIV_LEN 20
	unsigned char		data[QDISC_CB_PRIV_LEN];
242 243
};

244 245 246
static inline void qdisc_cb_private_validate(const struct sk_buff *skb, int sz)
{
	struct qdisc_skb_cb *qcb;
247 248

	BUILD_BUG_ON(sizeof(skb->cb) < offsetof(struct qdisc_skb_cb, data) + sz);
249 250 251
	BUILD_BUG_ON(sizeof(qcb->data) < sz);
}

252
static inline int qdisc_qlen(const struct Qdisc *q)
253 254 255 256
{
	return q->q.qlen;
}

257
static inline struct qdisc_skb_cb *qdisc_skb_cb(const struct sk_buff *skb)
258 259 260 261
{
	return (struct qdisc_skb_cb *)skb->cb;
}

262 263 264 265 266
static inline spinlock_t *qdisc_lock(struct Qdisc *qdisc)
{
	return &qdisc->q.lock;
}

267
static inline struct Qdisc *qdisc_root(const struct Qdisc *qdisc)
268
{
269 270 271
	struct Qdisc *q = rcu_dereference_rtnl(qdisc->dev_queue->qdisc);

	return q;
272 273
}

274
static inline struct Qdisc *qdisc_root_sleeping(const struct Qdisc *qdisc)
275 276 277 278
{
	return qdisc->dev_queue->qdisc_sleeping;
}

279 280 281 282 283 284 285 286 287 288 289
/* The qdisc root lock is a mechanism by which to top level
 * of a qdisc tree can be locked from any qdisc node in the
 * forest.  This allows changing the configuration of some
 * aspect of the qdisc tree while blocking out asynchronous
 * qdisc access in the packet processing paths.
 *
 * It is only legal to do this when the root will not change
 * on us.  Otherwise we'll potentially lock the wrong qdisc
 * root.  This is enforced by holding the RTNL semaphore, which
 * all users of this lock accessor must do.
 */
290
static inline spinlock_t *qdisc_root_lock(const struct Qdisc *qdisc)
291 292 293
{
	struct Qdisc *root = qdisc_root(qdisc);

294
	ASSERT_RTNL();
295
	return qdisc_lock(root);
296 297
}

298
static inline spinlock_t *qdisc_root_sleeping_lock(const struct Qdisc *qdisc)
299 300 301 302 303 304 305
{
	struct Qdisc *root = qdisc_root_sleeping(qdisc);

	ASSERT_RTNL();
	return qdisc_lock(root);
}

306
static inline struct net_device *qdisc_dev(const struct Qdisc *qdisc)
307 308 309
{
	return qdisc->dev_queue->dev;
}
L
Linus Torvalds 已提交
310

311
static inline void sch_tree_lock(const struct Qdisc *q)
312
{
J
Jarek Poplawski 已提交
313
	spin_lock_bh(qdisc_root_sleeping_lock(q));
314 315
}

316
static inline void sch_tree_unlock(const struct Qdisc *q)
317
{
J
Jarek Poplawski 已提交
318
	spin_unlock_bh(qdisc_root_sleeping_lock(q));
319 320 321 322
}

#define tcf_tree_lock(tp)	sch_tree_lock((tp)->q)
#define tcf_tree_unlock(tp)	sch_tree_unlock((tp)->q)
L
Linus Torvalds 已提交
323

324 325
extern struct Qdisc noop_qdisc;
extern struct Qdisc_ops noop_qdisc_ops;
326 327
extern struct Qdisc_ops pfifo_fast_ops;
extern struct Qdisc_ops mq_qdisc_ops;
328
extern const struct Qdisc_ops *default_qdisc_ops;
329

E
Eric Dumazet 已提交
330
struct Qdisc_class_common {
331 332 333 334
	u32			classid;
	struct hlist_node	hnode;
};

E
Eric Dumazet 已提交
335
struct Qdisc_class_hash {
336 337 338 339 340 341 342 343 344 345 346 347 348 349
	struct hlist_head	*hash;
	unsigned int		hashsize;
	unsigned int		hashmask;
	unsigned int		hashelems;
};

static inline unsigned int qdisc_class_hash(u32 id, u32 mask)
{
	id ^= id >> 8;
	id ^= id >> 4;
	return id & mask;
}

static inline struct Qdisc_class_common *
350
qdisc_class_find(const struct Qdisc_class_hash *hash, u32 id)
351 352 353 354 355
{
	struct Qdisc_class_common *cl;
	unsigned int h;

	h = qdisc_class_hash(id, hash->hashmask);
356
	hlist_for_each_entry(cl, &hash->hash[h], hnode) {
357 358 359 360 361 362
		if (cl->classid == id)
			return cl;
	}
	return NULL;
}

363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381
int qdisc_class_hash_init(struct Qdisc_class_hash *);
void qdisc_class_hash_insert(struct Qdisc_class_hash *,
			     struct Qdisc_class_common *);
void qdisc_class_hash_remove(struct Qdisc_class_hash *,
			     struct Qdisc_class_common *);
void qdisc_class_hash_grow(struct Qdisc *, struct Qdisc_class_hash *);
void qdisc_class_hash_destroy(struct Qdisc_class_hash *);

void dev_init_scheduler(struct net_device *dev);
void dev_shutdown(struct net_device *dev);
void dev_activate(struct net_device *dev);
void dev_deactivate(struct net_device *dev);
void dev_deactivate_many(struct list_head *head);
struct Qdisc *dev_graft_qdisc(struct netdev_queue *dev_queue,
			      struct Qdisc *qdisc);
void qdisc_reset(struct Qdisc *qdisc);
void qdisc_destroy(struct Qdisc *qdisc);
void qdisc_tree_decrease_qlen(struct Qdisc *qdisc, unsigned int n);
struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
382
			  const struct Qdisc_ops *ops);
383
struct Qdisc *qdisc_create_dflt(struct netdev_queue *dev_queue,
384
				const struct Qdisc_ops *ops, u32 parentid);
385 386 387
void __qdisc_calculate_pkt_len(struct sk_buff *skb,
			       const struct qdisc_size_table *stab);
void tcf_destroy(struct tcf_proto *tp);
J
John Fastabend 已提交
388
void tcf_destroy_chain(struct tcf_proto __rcu **fl);
L
Linus Torvalds 已提交
389

390 391
/* Reset all TX qdiscs greater then index of a device.  */
static inline void qdisc_reset_all_tx_gt(struct net_device *dev, unsigned int i)
392
{
393 394
	struct Qdisc *qdisc;

395
	for (; i < dev->num_tx_queues; i++) {
396
		qdisc = rtnl_dereference(netdev_get_tx_queue(dev, i)->qdisc);
397 398 399 400 401 402
		if (qdisc) {
			spin_lock_bh(qdisc_lock(qdisc));
			qdisc_reset(qdisc);
			spin_unlock_bh(qdisc_lock(qdisc));
		}
	}
403 404 405 406
}

static inline void qdisc_reset_all_tx(struct net_device *dev)
{
407
	qdisc_reset_all_tx_gt(dev, 0);
408 409
}

410 411 412
/* Are all TX queues of the device empty?  */
static inline bool qdisc_all_tx_empty(const struct net_device *dev)
{
413
	unsigned int i;
414 415

	rcu_read_lock();
416 417
	for (i = 0; i < dev->num_tx_queues; i++) {
		struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
418
		const struct Qdisc *q = rcu_dereference(txq->qdisc);
419

420 421
		if (q->q.qlen) {
			rcu_read_unlock();
422
			return false;
423
		}
424
	}
425
	rcu_read_unlock();
426
	return true;
427 428
}

429
/* Are any of the TX qdiscs changing?  */
430
static inline bool qdisc_tx_changing(const struct net_device *dev)
431
{
432
	unsigned int i;
433

434 435
	for (i = 0; i < dev->num_tx_queues; i++) {
		struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
436
		if (rcu_access_pointer(txq->qdisc) != txq->qdisc_sleeping)
437 438 439
			return true;
	}
	return false;
440 441
}

442
/* Is the device using the noop qdisc on all queues?  */
443 444
static inline bool qdisc_tx_is_noop(const struct net_device *dev)
{
445
	unsigned int i;
446

447 448
	for (i = 0; i < dev->num_tx_queues; i++) {
		struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
449
		if (rcu_access_pointer(txq->qdisc) != &noop_qdisc)
450 451 452
			return false;
	}
	return true;
453 454
}

455
static inline unsigned int qdisc_pkt_len(const struct sk_buff *skb)
456
{
457
	return qdisc_skb_cb(skb)->pkt_len;
458 459
}

460
/* additional qdisc xmit flags (NET_XMIT_MASK in linux/netdevice.h) */
461 462
enum net_xmit_qdisc_t {
	__NET_XMIT_STOLEN = 0x00010000,
463
	__NET_XMIT_BYPASS = 0x00020000,
464 465
};

466
#ifdef CONFIG_NET_CLS_ACT
467 468 469 470 471
#define net_xmit_drop_count(e)	((e) & __NET_XMIT_STOLEN ? 0 : 1)
#else
#define net_xmit_drop_count(e)	(1)
#endif

E
Eric Dumazet 已提交
472 473
static inline void qdisc_calculate_pkt_len(struct sk_buff *skb,
					   const struct Qdisc *sch)
474
{
475
#ifdef CONFIG_NET_SCHED
E
Eric Dumazet 已提交
476 477 478 479
	struct qdisc_size_table *stab = rcu_dereference_bh(sch->stab);

	if (stab)
		__qdisc_calculate_pkt_len(skb, stab);
480
#endif
E
Eric Dumazet 已提交
481 482 483 484 485
}

static inline int qdisc_enqueue(struct sk_buff *skb, struct Qdisc *sch)
{
	qdisc_calculate_pkt_len(skb, sch);
486 487 488 489 490
	return sch->enqueue(skb, sch);
}

static inline int qdisc_enqueue_root(struct sk_buff *skb, struct Qdisc *sch)
{
491
	qdisc_skb_cb(skb)->pkt_len = skb->len;
492
	return qdisc_enqueue(skb, sch) & NET_XMIT_MASK;
493 494
}

495 496 497 498
static inline bool qdisc_is_percpu_stats(const struct Qdisc *q)
{
	return q->flags & TCQ_F_CPUSTATS;
}
499 500 501 502 503 504 505 506

static inline void bstats_update(struct gnet_stats_basic_packed *bstats,
				 const struct sk_buff *skb)
{
	bstats->bytes += qdisc_pkt_len(skb);
	bstats->packets += skb_is_gso(skb) ? skb_shinfo(skb)->gso_segs : 1;
}

507 508 509 510 511 512 513 514 515 516 517
static inline void qdisc_bstats_update_cpu(struct Qdisc *sch,
					   const struct sk_buff *skb)
{
	struct gnet_stats_basic_cpu *bstats =
				this_cpu_ptr(sch->cpu_bstats);

	u64_stats_update_begin(&bstats->syncp);
	bstats_update(&bstats->bstats, skb);
	u64_stats_update_end(&bstats->syncp);
}

518 519
static inline void qdisc_bstats_update(struct Qdisc *sch,
				       const struct sk_buff *skb)
520
{
521
	bstats_update(&sch->bstats, skb);
522 523
}

524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550
static inline void qdisc_qstats_backlog_dec(struct Qdisc *sch,
					    const struct sk_buff *skb)
{
	sch->qstats.backlog -= qdisc_pkt_len(skb);
}

static inline void qdisc_qstats_backlog_inc(struct Qdisc *sch,
					    const struct sk_buff *skb)
{
	sch->qstats.backlog += qdisc_pkt_len(skb);
}

static inline void __qdisc_qstats_drop(struct Qdisc *sch, int count)
{
	sch->qstats.drops += count;
}

static inline void qdisc_qstats_drop(struct Qdisc *sch)
{
	sch->qstats.drops++;
}

static inline void qdisc_qstats_overlimit(struct Qdisc *sch)
{
	sch->qstats.overlimits++;
}

551 552 553 554
static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
				       struct sk_buff_head *list)
{
	__skb_queue_tail(list, skb);
555
	qdisc_qstats_backlog_inc(sch, skb);
556 557 558 559 560 561 562 563 564 565 566 567 568 569

	return NET_XMIT_SUCCESS;
}

static inline int qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch)
{
	return __qdisc_enqueue_tail(skb, sch, &sch->q);
}

static inline struct sk_buff *__qdisc_dequeue_head(struct Qdisc *sch,
						   struct sk_buff_head *list)
{
	struct sk_buff *skb = __skb_dequeue(list);

570
	if (likely(skb != NULL)) {
571
		qdisc_qstats_backlog_dec(sch, skb);
572 573
		qdisc_bstats_update(sch, skb);
	}
574 575 576 577 578 579 580

	return skb;
}

static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
{
	return __qdisc_dequeue_head(sch, &sch->q);
581 582 583 584 585
}

static inline unsigned int __qdisc_queue_drop_head(struct Qdisc *sch,
					      struct sk_buff_head *list)
{
586
	struct sk_buff *skb = __skb_dequeue(list);
587 588 589

	if (likely(skb != NULL)) {
		unsigned int len = qdisc_pkt_len(skb);
590
		qdisc_qstats_backlog_dec(sch, skb);
591 592 593 594 595 596 597 598 599 600
		kfree_skb(skb);
		return len;
	}

	return 0;
}

static inline unsigned int qdisc_queue_drop_head(struct Qdisc *sch)
{
	return __qdisc_queue_drop_head(sch, &sch->q);
601 602 603 604 605 606 607 608
}

static inline struct sk_buff *__qdisc_dequeue_tail(struct Qdisc *sch,
						   struct sk_buff_head *list)
{
	struct sk_buff *skb = __skb_dequeue_tail(list);

	if (likely(skb != NULL))
609
		qdisc_qstats_backlog_dec(sch, skb);
610 611 612 613 614 615 616 617 618

	return skb;
}

static inline struct sk_buff *qdisc_dequeue_tail(struct Qdisc *sch)
{
	return __qdisc_dequeue_tail(sch, &sch->q);
}

619 620 621 622 623
static inline struct sk_buff *qdisc_peek_head(struct Qdisc *sch)
{
	return skb_peek(&sch->q);
}

624 625 626 627
/* generic pseudo peek method for non-work-conserving qdisc */
static inline struct sk_buff *qdisc_peek_dequeued(struct Qdisc *sch)
{
	/* we can reuse ->gso_skb because peek isn't called for root qdiscs */
628
	if (!sch->gso_skb) {
629
		sch->gso_skb = sch->dequeue(sch);
630 631 632 633
		if (sch->gso_skb)
			/* it's still part of the queue */
			sch->q.qlen++;
	}
634 635 636 637 638 639 640 641 642

	return sch->gso_skb;
}

/* use instead of qdisc->dequeue() for all qdiscs queried with ->peek() */
static inline struct sk_buff *qdisc_dequeue_peeked(struct Qdisc *sch)
{
	struct sk_buff *skb = sch->gso_skb;

643
	if (skb) {
644
		sch->gso_skb = NULL;
645 646
		sch->q.qlen--;
	} else {
647
		skb = sch->dequeue(sch);
648
	}
649 650 651 652

	return skb;
}

653 654 655 656 657 658 659
static inline void __qdisc_reset_queue(struct Qdisc *sch,
				       struct sk_buff_head *list)
{
	/*
	 * We do not know the backlog in bytes of this list, it
	 * is up to the caller to correct it
	 */
660
	__skb_queue_purge(list);
661 662 663 664 665 666 667 668 669 670 671 672 673 674
}

static inline void qdisc_reset_queue(struct Qdisc *sch)
{
	__qdisc_reset_queue(sch, &sch->q);
	sch->qstats.backlog = 0;
}

static inline unsigned int __qdisc_queue_drop(struct Qdisc *sch,
					      struct sk_buff_head *list)
{
	struct sk_buff *skb = __qdisc_dequeue_tail(sch, list);

	if (likely(skb != NULL)) {
675
		unsigned int len = qdisc_pkt_len(skb);
676 677 678 679 680 681 682 683 684 685 686 687 688 689 690
		kfree_skb(skb);
		return len;
	}

	return 0;
}

static inline unsigned int qdisc_queue_drop(struct Qdisc *sch)
{
	return __qdisc_queue_drop(sch, &sch->q);
}

static inline int qdisc_drop(struct sk_buff *skb, struct Qdisc *sch)
{
	kfree_skb(skb);
691
	qdisc_qstats_drop(sch);
692 693 694 695 696 697

	return NET_XMIT_DROP;
}

static inline int qdisc_reshape_fail(struct sk_buff *skb, struct Qdisc *sch)
{
698
	qdisc_qstats_drop(sch);
699

700
#ifdef CONFIG_NET_CLS_ACT
701 702 703 704 705 706 707 708 709 710 711
	if (sch->reshape_fail == NULL || sch->reshape_fail(skb, sch))
		goto drop;

	return NET_XMIT_SUCCESS;

drop:
#endif
	kfree_skb(skb);
	return NET_XMIT_DROP;
}

712 713 714 715 716
/* Length to Time (L2T) lookup in a qdisc_rate_table, to determine how
   long it will take to send a packet given its size.
 */
static inline u32 qdisc_l2t(struct qdisc_rate_table* rtab, unsigned int pktlen)
{
717 718 719
	int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
	if (slot < 0)
		slot = 0;
720 721
	slot >>= rtab->rate.cell_log;
	if (slot > 255)
E
Eric Dumazet 已提交
722
		return rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF];
723 724 725
	return rtab->data[slot];
}

726
#ifdef CONFIG_NET_CLS_ACT
727 728
static inline struct sk_buff *skb_act_clone(struct sk_buff *skb, gfp_t gfp_mask,
					    int action)
729
{
730 731
	struct sk_buff *n;

C
Changli Gao 已提交
732
	n = skb_clone(skb, gfp_mask);
733 734 735 736 737 738 739 740 741 742

	if (n) {
		n->tc_verd = SET_TC_VERD(n->tc_verd, 0);
		n->tc_verd = CLR_TC_OK2MUNGE(n->tc_verd);
		n->tc_verd = CLR_TC_MUNGED(n->tc_verd);
	}
	return n;
}
#endif

743
struct psched_ratecfg {
744
	u64	rate_bytes_ps; /* bytes per second */
745 746
	u32	mult;
	u16	overhead;
747
	u8	linklayer;
748
	u8	shift;
749 750 751 752 753
};

static inline u64 psched_l2t_ns(const struct psched_ratecfg *r,
				unsigned int len)
{
754 755 756 757 758 759
	len += r->overhead;

	if (unlikely(r->linklayer == TC_LINKLAYER_ATM))
		return ((u64)(DIV_ROUND_UP(len,48)*53) * r->mult) >> r->shift;

	return ((u64)len * r->mult) >> r->shift;
760 761
}

762
void psched_ratecfg_precompute(struct psched_ratecfg *r,
763 764
			       const struct tc_ratespec *conf,
			       u64 rate64);
765

766 767
static inline void psched_ratecfg_getrate(struct tc_ratespec *res,
					  const struct psched_ratecfg *r)
768
{
769
	memset(res, 0, sizeof(*res));
770 771 772 773 774 775 776

	/* legacy struct tc_ratespec has a 32bit @rate field
	 * Qdisc using 64bit rate should add new attributes
	 * in order to maintain compatibility.
	 */
	res->rate = min_t(u64, r->rate_bytes_ps, ~0U);

777
	res->overhead = r->overhead;
778
	res->linklayer = (r->linklayer & TC_LINKLAYER_MASK);
779 780
}

L
Linus Torvalds 已提交
781
#endif