sch_prio.c 8.4 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9
/*
 * net/sched/sch_prio.c	Simple 3-band priority "scheduler".
 *
 *		This program is free software; you can redistribute it and/or
 *		modify it under the terms of the GNU General Public License
 *		as published by the Free Software Foundation; either version
 *		2 of the License, or (at your option) any later version.
 *
 * Authors:	Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
10
 * Fixes:       19990609: J Hadi Salim <hadi@nortelnetworks.com>:
L
Linus Torvalds 已提交
11 12 13 14
 *              Init --  EINVAL when opt undefined
 */

#include <linux/module.h>
15
#include <linux/slab.h>
L
Linus Torvalds 已提交
16 17 18 19 20
#include <linux/types.h>
#include <linux/kernel.h>
#include <linux/string.h>
#include <linux/errno.h>
#include <linux/skbuff.h>
21
#include <net/netlink.h>
L
Linus Torvalds 已提交
22
#include <net/pkt_sched.h>
23
#include <net/pkt_cls.h>
L
Linus Torvalds 已提交
24

E
Eric Dumazet 已提交
25
struct prio_sched_data {
L
Linus Torvalds 已提交
26
	int bands;
J
John Fastabend 已提交
27
	struct tcf_proto __rcu *filter_list;
28
	struct tcf_block *block;
L
Linus Torvalds 已提交
29 30 31 32 33 34 35 36 37 38 39
	u8  prio2band[TC_PRIO_MAX+1];
	struct Qdisc *queues[TCQ_PRIO_BANDS];
};


static struct Qdisc *
prio_classify(struct sk_buff *skb, struct Qdisc *sch, int *qerr)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	u32 band = skb->priority;
	struct tcf_result res;
J
John Fastabend 已提交
40
	struct tcf_proto *fl;
41
	int err;
L
Linus Torvalds 已提交
42

43
	*qerr = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS;
L
Linus Torvalds 已提交
44
	if (TC_H_MAJ(skb->priority) != sch->handle) {
J
John Fastabend 已提交
45
		fl = rcu_dereference_bh(q->filter_list);
46
		err = tcf_classify(skb, fl, &res, false);
L
Linus Torvalds 已提交
47
#ifdef CONFIG_NET_CLS_ACT
48
		switch (err) {
L
Linus Torvalds 已提交
49 50
		case TC_ACT_STOLEN:
		case TC_ACT_QUEUED:
51
		case TC_ACT_TRAP:
52
			*qerr = NET_XMIT_SUCCESS | __NET_XMIT_STOLEN;
53
			/* fall through */
L
Linus Torvalds 已提交
54 55
		case TC_ACT_SHOT:
			return NULL;
56
		}
L
Linus Torvalds 已提交
57
#endif
J
John Fastabend 已提交
58
		if (!fl || err < 0) {
L
Linus Torvalds 已提交
59 60
			if (TC_H_MAJ(band))
				band = 0;
E
Eric Dumazet 已提交
61
			return q->queues[q->prio2band[band & TC_PRIO_MAX]];
L
Linus Torvalds 已提交
62 63 64 65
		}
		band = res.classid;
	}
	band = TC_H_MIN(band) - 1;
66
	if (band >= q->bands)
67 68
		return q->queues[q->prio2band[0]];

L
Linus Torvalds 已提交
69 70 71 72
	return q->queues[band];
}

static int
73
prio_enqueue(struct sk_buff *skb, struct Qdisc *sch, struct sk_buff **to_free)
L
Linus Torvalds 已提交
74 75 76 77 78 79 80
{
	struct Qdisc *qdisc;
	int ret;

	qdisc = prio_classify(skb, sch, &ret);
#ifdef CONFIG_NET_CLS_ACT
	if (qdisc == NULL) {
81

82
		if (ret & __NET_XMIT_BYPASS)
83
			qdisc_qstats_drop(sch);
84
		__qdisc_drop(skb, to_free);
L
Linus Torvalds 已提交
85 86 87 88
		return ret;
	}
#endif

89
	ret = qdisc_enqueue(skb, qdisc, to_free);
90
	if (ret == NET_XMIT_SUCCESS) {
W
WANG Cong 已提交
91
		qdisc_qstats_backlog_inc(sch, skb);
L
Linus Torvalds 已提交
92 93 94
		sch->q.qlen++;
		return NET_XMIT_SUCCESS;
	}
95
	if (net_xmit_drop_count(ret))
96
		qdisc_qstats_drop(sch);
97
	return ret;
L
Linus Torvalds 已提交
98 99
}

100 101 102 103 104 105 106 107 108 109 110 111 112
static struct sk_buff *prio_peek(struct Qdisc *sch)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	int prio;

	for (prio = 0; prio < q->bands; prio++) {
		struct Qdisc *qdisc = q->queues[prio];
		struct sk_buff *skb = qdisc->ops->peek(qdisc);
		if (skb)
			return skb;
	}
	return NULL;
}
L
Linus Torvalds 已提交
113

E
Eric Dumazet 已提交
114
static struct sk_buff *prio_dequeue(struct Qdisc *sch)
L
Linus Torvalds 已提交
115 116 117 118 119
{
	struct prio_sched_data *q = qdisc_priv(sch);
	int prio;

	for (prio = 0; prio < q->bands; prio++) {
120
		struct Qdisc *qdisc = q->queues[prio];
121
		struct sk_buff *skb = qdisc_dequeue_peeked(qdisc);
122
		if (skb) {
123
			qdisc_bstats_update(sch, skb);
W
WANG Cong 已提交
124
			qdisc_qstats_backlog_dec(sch, skb);
125 126
			sch->q.qlen--;
			return skb;
L
Linus Torvalds 已提交
127 128 129 130 131 132 133
		}
	}
	return NULL;

}

static void
E
Eric Dumazet 已提交
134
prio_reset(struct Qdisc *sch)
L
Linus Torvalds 已提交
135 136 137 138
{
	int prio;
	struct prio_sched_data *q = qdisc_priv(sch);

E
Eric Dumazet 已提交
139
	for (prio = 0; prio < q->bands; prio++)
L
Linus Torvalds 已提交
140
		qdisc_reset(q->queues[prio]);
W
WANG Cong 已提交
141
	sch->qstats.backlog = 0;
L
Linus Torvalds 已提交
142 143 144 145
	sch->q.qlen = 0;
}

static void
E
Eric Dumazet 已提交
146
prio_destroy(struct Qdisc *sch)
L
Linus Torvalds 已提交
147 148 149 150
{
	int prio;
	struct prio_sched_data *q = qdisc_priv(sch);

151
	tcf_block_put(q->block);
E
Eric Dumazet 已提交
152
	for (prio = 0; prio < q->bands; prio++)
L
Linus Torvalds 已提交
153 154 155
		qdisc_destroy(q->queues[prio]);
}

156 157
static int prio_tune(struct Qdisc *sch, struct nlattr *opt,
		     struct netlink_ext_ack *extack)
L
Linus Torvalds 已提交
158 159
{
	struct prio_sched_data *q = qdisc_priv(sch);
160 161
	struct Qdisc *queues[TCQ_PRIO_BANDS];
	int oldbands = q->bands, i;
162
	struct tc_prio_qopt *qopt;
L
Linus Torvalds 已提交
163

164 165 166
	if (nla_len(opt) < sizeof(*qopt))
		return -EINVAL;
	qopt = nla_data(opt);
167

168
	if (qopt->bands > TCQ_PRIO_BANDS || qopt->bands < 2)
L
Linus Torvalds 已提交
169 170
		return -EINVAL;

E
Eric Dumazet 已提交
171
	for (i = 0; i <= TC_PRIO_MAX; i++) {
172
		if (qopt->priomap[i] >= qopt->bands)
L
Linus Torvalds 已提交
173 174 175
			return -EINVAL;
	}

176 177 178
	/* Before commit, make sure we can allocate all new qdiscs */
	for (i = oldbands; i < qopt->bands; i++) {
		queues[i] = qdisc_create_dflt(sch->dev_queue, &pfifo_qdisc_ops,
179 180
					      TC_H_MAKE(sch->handle, i + 1),
					      extack);
181 182 183 184 185 186 187
		if (!queues[i]) {
			while (i > oldbands)
				qdisc_destroy(queues[--i]);
			return -ENOMEM;
		}
	}

L
Linus Torvalds 已提交
188
	sch_tree_lock(sch);
189
	q->bands = qopt->bands;
L
Linus Torvalds 已提交
190 191
	memcpy(q->prio2band, qopt->priomap, TC_PRIO_MAX+1);

192
	for (i = q->bands; i < oldbands; i++) {
193
		struct Qdisc *child = q->queues[i];
L
Linus Torvalds 已提交
194

195 196 197
		qdisc_tree_reduce_backlog(child, child->q.qlen,
					  child->qstats.backlog);
		qdisc_destroy(child);
L
Linus Torvalds 已提交
198
	}
199

200
	for (i = oldbands; i < q->bands; i++) {
201
		q->queues[i] = queues[i];
202 203 204
		if (q->queues[i] != &noop_qdisc)
			qdisc_hash_add(q->queues[i], true);
	}
205

206
	sch_tree_unlock(sch);
L
Linus Torvalds 已提交
207 208 209
	return 0;
}

210 211
static int prio_init(struct Qdisc *sch, struct nlattr *opt,
		     struct netlink_ext_ack *extack)
L
Linus Torvalds 已提交
212
{
213 214 215
	struct prio_sched_data *q = qdisc_priv(sch);
	int err;

216
	if (!opt)
L
Linus Torvalds 已提交
217 218
		return -EINVAL;

219
	err = tcf_block_get(&q->block, &q->filter_list, sch, extack);
220 221 222
	if (err)
		return err;

223
	return prio_tune(sch, opt, extack);
L
Linus Torvalds 已提交
224 225 226 227 228
}

static int prio_dump(struct Qdisc *sch, struct sk_buff *skb)
{
	struct prio_sched_data *q = qdisc_priv(sch);
229
	unsigned char *b = skb_tail_pointer(skb);
L
Linus Torvalds 已提交
230 231 232
	struct tc_prio_qopt opt;

	opt.bands = q->bands;
E
Eric Dumazet 已提交
233
	memcpy(&opt.priomap, q->prio2band, TC_PRIO_MAX + 1);
234

235 236
	if (nla_put(skb, TCA_OPTIONS, sizeof(opt), &opt))
		goto nla_put_failure;
237

L
Linus Torvalds 已提交
238 239
	return skb->len;

240
nla_put_failure:
241
	nlmsg_trim(skb, b);
L
Linus Torvalds 已提交
242 243 244 245
	return -1;
}

static int prio_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new,
246
		      struct Qdisc **old, struct netlink_ext_ack *extack)
L
Linus Torvalds 已提交
247 248 249 250 251 252 253
{
	struct prio_sched_data *q = qdisc_priv(sch);
	unsigned long band = arg - 1;

	if (new == NULL)
		new = &noop_qdisc;

254
	*old = qdisc_replace(sch, new, &q->queues[band]);
L
Linus Torvalds 已提交
255 256 257 258 259 260 261 262 263 264 265 266
	return 0;
}

static struct Qdisc *
prio_leaf(struct Qdisc *sch, unsigned long arg)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	unsigned long band = arg - 1;

	return q->queues[band];
}

267
static unsigned long prio_find(struct Qdisc *sch, u32 classid)
L
Linus Torvalds 已提交
268 269 270 271 272 273 274 275 276 277 278
{
	struct prio_sched_data *q = qdisc_priv(sch);
	unsigned long band = TC_H_MIN(classid);

	if (band - 1 >= q->bands)
		return 0;
	return band;
}

static unsigned long prio_bind(struct Qdisc *sch, unsigned long parent, u32 classid)
{
279
	return prio_find(sch, classid);
L
Linus Torvalds 已提交
280 281 282
}


283
static void prio_unbind(struct Qdisc *q, unsigned long cl)
L
Linus Torvalds 已提交
284 285 286 287 288 289 290 291 292
{
}

static int prio_dump_class(struct Qdisc *sch, unsigned long cl, struct sk_buff *skb,
			   struct tcmsg *tcm)
{
	struct prio_sched_data *q = qdisc_priv(sch);

	tcm->tcm_handle |= TC_H_MIN(cl);
293
	tcm->tcm_info = q->queues[cl-1]->handle;
L
Linus Torvalds 已提交
294 295 296
	return 0;
}

297 298 299 300 301 302 303
static int prio_dump_class_stats(struct Qdisc *sch, unsigned long cl,
				 struct gnet_dump *d)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	struct Qdisc *cl_q;

	cl_q = q->queues[cl - 1];
304 305
	if (gnet_stats_copy_basic(qdisc_root_sleeping_running(sch),
				  d, NULL, &cl_q->bstats) < 0 ||
306
	    gnet_stats_copy_queue(d, NULL, &cl_q->qstats, cl_q->q.qlen) < 0)
307 308 309 310 311
		return -1;

	return 0;
}

L
Linus Torvalds 已提交
312 313 314 315 316 317 318 319 320 321 322 323 324
static void prio_walk(struct Qdisc *sch, struct qdisc_walker *arg)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	int prio;

	if (arg->stop)
		return;

	for (prio = 0; prio < q->bands; prio++) {
		if (arg->count < arg->skip) {
			arg->count++;
			continue;
		}
E
Eric Dumazet 已提交
325
		if (arg->fn(sch, prio + 1, arg) < 0) {
L
Linus Torvalds 已提交
326 327 328 329 330 331 332
			arg->stop = 1;
			break;
		}
		arg->count++;
	}
}

333 334
static struct tcf_block *prio_tcf_block(struct Qdisc *sch, unsigned long cl,
					struct netlink_ext_ack *extack)
L
Linus Torvalds 已提交
335 336 337 338 339
{
	struct prio_sched_data *q = qdisc_priv(sch);

	if (cl)
		return NULL;
340
	return q->block;
L
Linus Torvalds 已提交
341 342
}

343
static const struct Qdisc_class_ops prio_class_ops = {
L
Linus Torvalds 已提交
344 345
	.graft		=	prio_graft,
	.leaf		=	prio_leaf,
346
	.find		=	prio_find,
L
Linus Torvalds 已提交
347
	.walk		=	prio_walk,
348
	.tcf_block	=	prio_tcf_block,
L
Linus Torvalds 已提交
349
	.bind_tcf	=	prio_bind,
350
	.unbind_tcf	=	prio_unbind,
L
Linus Torvalds 已提交
351
	.dump		=	prio_dump_class,
352
	.dump_stats	=	prio_dump_class_stats,
L
Linus Torvalds 已提交
353 354
};

355
static struct Qdisc_ops prio_qdisc_ops __read_mostly = {
L
Linus Torvalds 已提交
356 357 358 359 360 361
	.next		=	NULL,
	.cl_ops		=	&prio_class_ops,
	.id		=	"prio",
	.priv_size	=	sizeof(struct prio_sched_data),
	.enqueue	=	prio_enqueue,
	.dequeue	=	prio_dequeue,
362
	.peek		=	prio_peek,
L
Linus Torvalds 已提交
363 364 365 366 367 368 369 370 371 372
	.init		=	prio_init,
	.reset		=	prio_reset,
	.destroy	=	prio_destroy,
	.change		=	prio_tune,
	.dump		=	prio_dump,
	.owner		=	THIS_MODULE,
};

static int __init prio_module_init(void)
{
373
	return register_qdisc(&prio_qdisc_ops);
L
Linus Torvalds 已提交
374 375
}

376
static void __exit prio_module_exit(void)
L
Linus Torvalds 已提交
377 378 379 380 381 382 383 384
{
	unregister_qdisc(&prio_qdisc_ops);
}

module_init(prio_module_init)
module_exit(prio_module_exit)

MODULE_LICENSE("GPL");