sch_generic.h 17.4 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9
#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>
#include <net/gen_stats.h>
10
#include <net/rtnetlink.h>
L
Linus Torvalds 已提交
11 12 13 14 15 16

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

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

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

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

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

E
Eric Dumazet 已提交
45
struct Qdisc {
L
Linus Torvalds 已提交
46 47
	int 			(*enqueue)(struct sk_buff *skb, struct Qdisc *dev);
	struct sk_buff *	(*dequeue)(struct Qdisc *dev);
48
	unsigned int		flags;
49
#define TCQ_F_BUILTIN		1
50 51 52
#define TCQ_F_INGRESS		2
#define TCQ_F_CAN_BYPASS	4
#define TCQ_F_MQROOT		8
53 54 55 56 57 58 59
#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.
				      */
60
#define TCQ_F_WARN_NONWC	(1 << 16)
61
	u32			limit;
62
	const struct Qdisc_ops	*ops;
E
Eric Dumazet 已提交
63
	struct qdisc_size_table	__rcu *stab;
64
	struct list_head	list;
L
Linus Torvalds 已提交
65 66 67 68 69
	u32			handle;
	u32			parent;
	int			(*reshape_fail)(struct sk_buff *skb,
					struct Qdisc *q);

70 71
	void			*u32_node;

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

78 79
	struct gnet_stats_rate_est64	rate_est;
	struct Qdisc		*next_sched;
80 81 82 83 84 85
	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;
86
	struct gnet_stats_basic_packed bstats;
87
	unsigned int		__state;
88
	struct gnet_stats_queue	qstats;
89
	struct rcu_head		rcu_head;
90 91 92 93
	int			padded;
	atomic_t		refcnt;

	spinlock_t		busylock ____cacheline_aligned_in_smp;
L
Linus Torvalds 已提交
94 95
};

96
static inline bool qdisc_is_running(const struct Qdisc *qdisc)
97
{
98
	return (qdisc->__state & __QDISC___STATE_RUNNING) ? true : false;
99 100 101 102
}

static inline bool qdisc_run_begin(struct Qdisc *qdisc)
{
103 104 105 106
	if (qdisc_is_running(qdisc))
		return false;
	qdisc->__state |= __QDISC___STATE_RUNNING;
	return true;
107 108 109 110
}

static inline void qdisc_run_end(struct Qdisc *qdisc)
{
111 112 113 114 115
	qdisc->__state &= ~__QDISC___STATE_RUNNING;
}

static inline bool qdisc_is_throttled(const struct Qdisc *qdisc)
{
116
	return test_bit(__QDISC_STATE_THROTTLED, &qdisc->state) ? true : false;
117 118 119 120
}

static inline void qdisc_throttled(struct Qdisc *qdisc)
{
121
	set_bit(__QDISC_STATE_THROTTLED, &qdisc->state);
122 123 124 125
}

static inline void qdisc_unthrottled(struct Qdisc *qdisc)
{
126
	clear_bit(__QDISC_STATE_THROTTLED, &qdisc->state);
127 128
}

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

	/* Class manipulation routines */
	unsigned long		(*get)(struct Qdisc *, u32 classid);
	void			(*put)(struct Qdisc *, unsigned long);
	int			(*change)(struct Qdisc *, u32, u32,
141
					struct nlattr **, unsigned long *);
L
Linus Torvalds 已提交
142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157
	int			(*delete)(struct Qdisc *, unsigned long);
	void			(*walk)(struct Qdisc *, struct qdisc_walker * arg);

	/* Filter manipulation */
	struct tcf_proto **	(*tcf_chain)(struct Qdisc *, unsigned long);
	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 已提交
158
struct Qdisc_ops {
L
Linus Torvalds 已提交
159
	struct Qdisc_ops	*next;
160
	const struct Qdisc_class_ops	*cl_ops;
L
Linus Torvalds 已提交
161 162 163 164 165
	char			id[IFNAMSIZ];
	int			priv_size;

	int 			(*enqueue)(struct sk_buff *, struct Qdisc *);
	struct sk_buff *	(*dequeue)(struct Qdisc *);
166
	struct sk_buff *	(*peek)(struct Qdisc *);
L
Linus Torvalds 已提交
167 168
	unsigned int		(*drop)(struct Qdisc *);

169
	int			(*init)(struct Qdisc *, struct nlattr *arg);
L
Linus Torvalds 已提交
170 171
	void			(*reset)(struct Qdisc *);
	void			(*destroy)(struct Qdisc *);
172
	int			(*change)(struct Qdisc *, struct nlattr *arg);
173
	void			(*attach)(struct Qdisc *);
L
Linus Torvalds 已提交
174 175 176 177 178 179 180 181

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

	struct module		*owner;
};


E
Eric Dumazet 已提交
182
struct tcf_result {
L
Linus Torvalds 已提交
183 184 185 186
	unsigned long	class;
	u32		classid;
};

E
Eric Dumazet 已提交
187
struct tcf_proto_ops {
L
Linus Torvalds 已提交
188 189 190
	struct tcf_proto_ops	*next;
	char			kind[IFNAMSIZ];

191 192 193
	int			(*classify)(struct sk_buff *,
					    const struct tcf_proto *,
					    struct tcf_result *);
L
Linus Torvalds 已提交
194 195 196 197 198
	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);
199
	int			(*change)(struct net *net, struct sk_buff *,
200
					struct tcf_proto*, unsigned long,
201
					u32 handle, struct nlattr **,
L
Linus Torvalds 已提交
202 203 204 205 206 207 208 209 210 211 212
					unsigned long *);
	int			(*delete)(struct tcf_proto*, unsigned long);
	void			(*walk)(struct tcf_proto*, struct tcf_walker *arg);

	/* rtnetlink specific */
	int			(*dump)(struct tcf_proto*, unsigned long,
					struct sk_buff *skb, struct tcmsg*);

	struct module		*owner;
};

E
Eric Dumazet 已提交
213
struct tcf_proto {
L
Linus Torvalds 已提交
214 215 216
	/* Fast access part */
	struct tcf_proto	*next;
	void			*root;
217 218 219
	int			(*classify)(struct sk_buff *,
					    const struct tcf_proto *,
					    struct tcf_result *);
A
Al Viro 已提交
220
	__be16			protocol;
L
Linus Torvalds 已提交
221 222 223 224 225 226

	/* All the rest */
	u32			prio;
	u32			classid;
	struct Qdisc		*q;
	void			*data;
227
	const struct tcf_proto_ops	*ops;
L
Linus Torvalds 已提交
228 229
};

230 231
struct qdisc_skb_cb {
	unsigned int		pkt_len;
232
	u16			slave_dev_queue_mapping;
233 234
	u16			_pad;
	unsigned char		data[20];
235 236
};

237 238 239
static inline void qdisc_cb_private_validate(const struct sk_buff *skb, int sz)
{
	struct qdisc_skb_cb *qcb;
240 241

	BUILD_BUG_ON(sizeof(skb->cb) < offsetof(struct qdisc_skb_cb, data) + sz);
242 243 244
	BUILD_BUG_ON(sizeof(qcb->data) < sz);
}

245
static inline int qdisc_qlen(const struct Qdisc *q)
246 247 248 249
{
	return q->q.qlen;
}

250
static inline struct qdisc_skb_cb *qdisc_skb_cb(const struct sk_buff *skb)
251 252 253 254
{
	return (struct qdisc_skb_cb *)skb->cb;
}

255 256 257 258 259
static inline spinlock_t *qdisc_lock(struct Qdisc *qdisc)
{
	return &qdisc->q.lock;
}

260
static inline struct Qdisc *qdisc_root(const struct Qdisc *qdisc)
261 262 263 264
{
	return qdisc->dev_queue->qdisc;
}

265
static inline struct Qdisc *qdisc_root_sleeping(const struct Qdisc *qdisc)
266 267 268 269
{
	return qdisc->dev_queue->qdisc_sleeping;
}

270 271 272 273 274 275 276 277 278 279 280
/* 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.
 */
281
static inline spinlock_t *qdisc_root_lock(const struct Qdisc *qdisc)
282 283 284
{
	struct Qdisc *root = qdisc_root(qdisc);

285
	ASSERT_RTNL();
286
	return qdisc_lock(root);
287 288
}

289
static inline spinlock_t *qdisc_root_sleeping_lock(const struct Qdisc *qdisc)
290 291 292 293 294 295 296
{
	struct Qdisc *root = qdisc_root_sleeping(qdisc);

	ASSERT_RTNL();
	return qdisc_lock(root);
}

297
static inline struct net_device *qdisc_dev(const struct Qdisc *qdisc)
298 299 300
{
	return qdisc->dev_queue->dev;
}
L
Linus Torvalds 已提交
301

302
static inline void sch_tree_lock(const struct Qdisc *q)
303
{
J
Jarek Poplawski 已提交
304
	spin_lock_bh(qdisc_root_sleeping_lock(q));
305 306
}

307
static inline void sch_tree_unlock(const struct Qdisc *q)
308
{
J
Jarek Poplawski 已提交
309
	spin_unlock_bh(qdisc_root_sleeping_lock(q));
310 311 312 313
}

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

315 316
extern struct Qdisc noop_qdisc;
extern struct Qdisc_ops noop_qdisc_ops;
317 318
extern struct Qdisc_ops pfifo_fast_ops;
extern struct Qdisc_ops mq_qdisc_ops;
319

E
Eric Dumazet 已提交
320
struct Qdisc_class_common {
321 322 323 324
	u32			classid;
	struct hlist_node	hnode;
};

E
Eric Dumazet 已提交
325
struct Qdisc_class_hash {
326 327 328 329 330 331 332 333 334 335 336 337 338 339
	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 *
340
qdisc_class_find(const struct Qdisc_class_hash *hash, u32 id)
341 342 343 344 345
{
	struct Qdisc_class_common *cl;
	unsigned int h;

	h = qdisc_class_hash(id, hash->hashmask);
346
	hlist_for_each_entry(cl, &hash->hash[h], hnode) {
347 348 349 350 351 352
		if (cl->classid == id)
			return cl;
	}
	return NULL;
}

353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378
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,
			  struct Qdisc_ops *ops);
struct Qdisc *qdisc_create_dflt(struct netdev_queue *dev_queue,
				struct Qdisc_ops *ops, u32 parentid);
void __qdisc_calculate_pkt_len(struct sk_buff *skb,
			       const struct qdisc_size_table *stab);
void tcf_destroy(struct tcf_proto *tp);
void tcf_destroy_chain(struct tcf_proto **fl);
L
Linus Torvalds 已提交
379

380 381
/* 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)
382
{
383 384
	struct Qdisc *qdisc;

385
	for (; i < dev->num_tx_queues; i++) {
386 387 388 389 390 391 392
		qdisc = netdev_get_tx_queue(dev, i)->qdisc;
		if (qdisc) {
			spin_lock_bh(qdisc_lock(qdisc));
			qdisc_reset(qdisc);
			spin_unlock_bh(qdisc_lock(qdisc));
		}
	}
393 394 395 396
}

static inline void qdisc_reset_all_tx(struct net_device *dev)
{
397
	qdisc_reset_all_tx_gt(dev, 0);
398 399
}

400 401 402
/* Are all TX queues of the device empty?  */
static inline bool qdisc_all_tx_empty(const struct net_device *dev)
{
403 404 405 406
	unsigned int i;
	for (i = 0; i < dev->num_tx_queues; i++) {
		struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
		const struct Qdisc *q = txq->qdisc;
407

408 409 410 411
		if (q->q.qlen)
			return false;
	}
	return true;
412 413
}

414
/* Are any of the TX qdiscs changing?  */
415
static inline bool qdisc_tx_changing(const struct net_device *dev)
416
{
417 418 419 420 421 422 423
	unsigned int i;
	for (i = 0; i < dev->num_tx_queues; i++) {
		struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
		if (txq->qdisc != txq->qdisc_sleeping)
			return true;
	}
	return false;
424 425
}

426
/* Is the device using the noop qdisc on all queues?  */
427 428
static inline bool qdisc_tx_is_noop(const struct net_device *dev)
{
429 430 431 432 433 434 435
	unsigned int i;
	for (i = 0; i < dev->num_tx_queues; i++) {
		struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
		if (txq->qdisc != &noop_qdisc)
			return false;
	}
	return true;
436 437
}

438
static inline unsigned int qdisc_pkt_len(const struct sk_buff *skb)
439
{
440
	return qdisc_skb_cb(skb)->pkt_len;
441 442
}

443
/* additional qdisc xmit flags (NET_XMIT_MASK in linux/netdevice.h) */
444 445
enum net_xmit_qdisc_t {
	__NET_XMIT_STOLEN = 0x00010000,
446
	__NET_XMIT_BYPASS = 0x00020000,
447 448
};

449
#ifdef CONFIG_NET_CLS_ACT
450 451 452 453 454
#define net_xmit_drop_count(e)	((e) & __NET_XMIT_STOLEN ? 0 : 1)
#else
#define net_xmit_drop_count(e)	(1)
#endif

E
Eric Dumazet 已提交
455 456
static inline void qdisc_calculate_pkt_len(struct sk_buff *skb,
					   const struct Qdisc *sch)
457
{
458
#ifdef CONFIG_NET_SCHED
E
Eric Dumazet 已提交
459 460 461 462
	struct qdisc_size_table *stab = rcu_dereference_bh(sch->stab);

	if (stab)
		__qdisc_calculate_pkt_len(skb, stab);
463
#endif
E
Eric Dumazet 已提交
464 465 466 467 468
}

static inline int qdisc_enqueue(struct sk_buff *skb, struct Qdisc *sch)
{
	qdisc_calculate_pkt_len(skb, sch);
469 470 471 472 473
	return sch->enqueue(skb, sch);
}

static inline int qdisc_enqueue_root(struct sk_buff *skb, struct Qdisc *sch)
{
474
	qdisc_skb_cb(skb)->pkt_len = skb->len;
475
	return qdisc_enqueue(skb, sch) & NET_XMIT_MASK;
476 477
}

478 479 480 481 482 483 484 485 486 487

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;
}

static inline void qdisc_bstats_update(struct Qdisc *sch,
				       const struct sk_buff *skb)
488
{
489
	bstats_update(&sch->bstats, skb);
490 491
}

492 493 494 495
static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
				       struct sk_buff_head *list)
{
	__skb_queue_tail(list, skb);
496
	sch->qstats.backlog += qdisc_pkt_len(skb);
497 498 499 500 501 502 503 504 505 506 507 508 509 510

	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);

511
	if (likely(skb != NULL)) {
512
		sch->qstats.backlog -= qdisc_pkt_len(skb);
513 514
		qdisc_bstats_update(sch, skb);
	}
515 516 517 518 519 520 521

	return skb;
}

static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
{
	return __qdisc_dequeue_head(sch, &sch->q);
522 523 524 525 526
}

static inline unsigned int __qdisc_queue_drop_head(struct Qdisc *sch,
					      struct sk_buff_head *list)
{
527
	struct sk_buff *skb = __skb_dequeue(list);
528 529 530

	if (likely(skb != NULL)) {
		unsigned int len = qdisc_pkt_len(skb);
531
		sch->qstats.backlog -= len;
532 533 534 535 536 537 538 539 540 541
		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);
542 543 544 545 546 547 548 549
}

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))
550
		sch->qstats.backlog -= qdisc_pkt_len(skb);
551 552 553 554 555 556 557 558 559

	return skb;
}

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

560 561 562 563 564
static inline struct sk_buff *qdisc_peek_head(struct Qdisc *sch)
{
	return skb_peek(&sch->q);
}

565 566 567 568
/* 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 */
569
	if (!sch->gso_skb) {
570
		sch->gso_skb = sch->dequeue(sch);
571 572 573 574
		if (sch->gso_skb)
			/* it's still part of the queue */
			sch->q.qlen++;
	}
575 576 577 578 579 580 581 582 583

	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;

584
	if (skb) {
585
		sch->gso_skb = NULL;
586 587
		sch->q.qlen--;
	} else {
588
		skb = sch->dequeue(sch);
589
	}
590 591 592 593

	return skb;
}

594 595 596 597 598 599 600
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
	 */
601
	__skb_queue_purge(list);
602 603 604 605 606 607 608 609 610 611 612 613 614 615
}

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)) {
616
		unsigned int len = qdisc_pkt_len(skb);
617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640
		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);
	sch->qstats.drops++;

	return NET_XMIT_DROP;
}

static inline int qdisc_reshape_fail(struct sk_buff *skb, struct Qdisc *sch)
{
	sch->qstats.drops++;

641
#ifdef CONFIG_NET_CLS_ACT
642 643 644 645 646 647 648 649 650 651 652
	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;
}

653 654 655 656 657
/* 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)
{
658 659 660
	int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
	if (slot < 0)
		slot = 0;
661 662
	slot >>= rtab->rate.cell_log;
	if (slot > 255)
E
Eric Dumazet 已提交
663
		return rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF];
664 665 666
	return rtab->data[slot];
}

667
#ifdef CONFIG_NET_CLS_ACT
668 669
static inline struct sk_buff *skb_act_clone(struct sk_buff *skb, gfp_t gfp_mask,
					    int action)
670
{
671 672
	struct sk_buff *n;

C
Changli Gao 已提交
673
	n = skb_clone(skb, gfp_mask);
674 675 676 677 678 679 680 681 682 683

	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

684
struct psched_ratecfg {
685
	u64	rate_bytes_ps; /* bytes per second */
686 687
	u32	mult;
	u16	overhead;
688
	u8	linklayer;
689
	u8	shift;
690 691 692 693 694
};

static inline u64 psched_l2t_ns(const struct psched_ratecfg *r,
				unsigned int len)
{
695 696 697 698 699 700
	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;
701 702
}

703 704
void psched_ratecfg_precompute(struct psched_ratecfg *r,
			       const struct tc_ratespec *conf);
705

706 707
static inline void psched_ratecfg_getrate(struct tc_ratespec *res,
					  const struct psched_ratecfg *r)
708
{
709
	memset(res, 0, sizeof(*res));
710
	res->rate = r->rate_bytes_ps;
711
	res->overhead = r->overhead;
712
	res->linklayer = (r->linklayer & TC_LINKLAYER_MASK);
713 714
}

L
Linus Torvalds 已提交
715
#endif