36 	struct prio_sched_data *q = qdisc_priv(sch);  in prio_classify()  local
44 		fl = rcu_dereference_bh(q->filter_list);  in prio_classify()
58 			return q->queues[q->prio2band[band & TC_PRIO_MAX]];  in prio_classify()
63 	if (band >= q->bands)  in prio_classify()
64 		return q->queues[q->prio2band[0]];  in prio_classify()
66 	return q->queues[band];  in prio_classify()
88 		sch->q.qlen++;  in prio_enqueue()
98 	struct prio_sched_data *q = qdisc_priv(sch);  in prio_peek()  local
101 	for (prio = 0; prio < q->bands; prio++) {  in prio_peek()
102 		struct Qdisc *qdisc = q->queues[prio];  in prio_peek()
112 	struct prio_sched_data *q = qdisc_priv(sch);  in prio_dequeue()  local
115 	for (prio = 0; prio < q->bands; prio++) {  in prio_dequeue()
116 		struct Qdisc *qdisc = q->queues[prio];  in prio_dequeue()
120 			sch->q.qlen--;  in prio_dequeue()
130 	struct prio_sched_data *q = qdisc_priv(sch);  in prio_drop()  local
135 	for (prio = q->bands-1; prio >= 0; prio--) {  in prio_drop()
136 		qdisc = q->queues[prio];  in prio_drop()
138 			sch->q.qlen--;  in prio_drop()
150 	struct prio_sched_data *q = qdisc_priv(sch);  in prio_reset()  local
152 	for (prio = 0; prio < q->bands; prio++)  in prio_reset()
153 		qdisc_reset(q->queues[prio]);  in prio_reset()
154 	sch->q.qlen = 0;  in prio_reset()
161 	struct prio_sched_data *q = qdisc_priv(sch);  in prio_destroy()  local
163 	tcf_destroy_chain(&q->filter_list);  in prio_destroy()
164 	for (prio = 0; prio < q->bands; prio++)  in prio_destroy()
165 		qdisc_destroy(q->queues[prio]);  in prio_destroy()
170 	struct prio_sched_data *q = qdisc_priv(sch);  in prio_tune()  local
187 	q->bands = qopt->bands;  in prio_tune()
188 	memcpy(q->prio2band, qopt->priomap, TC_PRIO_MAX+1);  in prio_tune()
190 	for (i = q->bands; i < TCQ_PRIO_BANDS; i++) {  in prio_tune()
191 		struct Qdisc *child = q->queues[i];  in prio_tune()
192 		q->queues[i] = &noop_qdisc;  in prio_tune()
194 			qdisc_tree_decrease_qlen(child, child->q.qlen);  in prio_tune()
200 	for (i = 0; i < q->bands; i++) {  in prio_tune()
201 		if (q->queues[i] == &noop_qdisc) {  in prio_tune()
209 				old = q->queues[i];  in prio_tune()
210 				q->queues[i] = child;  in prio_tune()
214 								 old->q.qlen);  in prio_tune()
226 	struct prio_sched_data *q = qdisc_priv(sch);  in prio_init()  local
230 		q->queues[i] = &noop_qdisc;  in prio_init()
245 	struct prio_sched_data *q = qdisc_priv(sch);  in prio_dump()  local
249 	opt.bands = q->bands;  in prio_dump()
250 	memcpy(&opt.priomap, q->prio2band, TC_PRIO_MAX + 1);  in prio_dump()
265 	struct prio_sched_data *q = qdisc_priv(sch);  in prio_graft()  local
272 	*old = q->queues[band];  in prio_graft()
273 	q->queues[band] = new;  in prio_graft()
274 	qdisc_tree_decrease_qlen(*old, (*old)->q.qlen);  in prio_graft()
284 	struct prio_sched_data *q = qdisc_priv(sch);  in prio_leaf()  local
287 	return q->queues[band];  in prio_leaf()
292 	struct prio_sched_data *q = qdisc_priv(sch);  in prio_get()  local
295 	if (band - 1 >= q->bands)  in prio_get()
306 static void prio_put(struct Qdisc *q, unsigned long cl)  in prio_put()  argument
313 	struct prio_sched_data *q = qdisc_priv(sch);  in prio_dump_class()  local
316 	tcm->tcm_info = q->queues[cl-1]->handle;  in prio_dump_class()
323 	struct prio_sched_data *q = qdisc_priv(sch);  in prio_dump_class_stats()  local
326 	cl_q = q->queues[cl - 1];  in prio_dump_class_stats()
328 	    gnet_stats_copy_queue(d, NULL, &cl_q->qstats, cl_q->q.qlen) < 0)  in prio_dump_class_stats()
336 	struct prio_sched_data *q = qdisc_priv(sch);  in prio_walk()  local
342 	for (prio = 0; prio < q->bands; prio++) {  in prio_walk()
358 	struct prio_sched_data *q = qdisc_priv(sch);  in prio_find_tcf()  local
362 	return &q->filter_list;  in prio_find_tcf()