216 	u32 prio = skb->priority;  in cbq_classify()  local
223 	if (TC_H_MAJ(prio ^ sch->handle) == 0 &&  in cbq_classify()
224 	    (cl = cbq_class_lookup(q, prio)) != NULL)  in cbq_classify()
282 	if (TC_H_MAJ(prio) == 0 &&  in cbq_classify()
283 	    !(cl = head->defaults[prio & TC_PRIO_MAX]) &&  in cbq_classify()
299 	int prio = cl->cpriority;  in cbq_activate_class()  local
302 	cl_tail = q->active[prio];  in cbq_activate_class()
303 	q->active[prio] = cl;  in cbq_activate_class()
310 		q->activemask |= (1<<prio);  in cbq_activate_class()
323 	int prio = this->cpriority;  in cbq_deactivate_class()  local
325 	struct cbq_class *cl_prev = q->active[prio];  in cbq_deactivate_class()
333 			if (cl == q->active[prio]) {  in cbq_deactivate_class()
334 				q->active[prio] = cl_prev;  in cbq_deactivate_class()
335 				if (cl == q->active[prio]) {  in cbq_deactivate_class()
336 					q->active[prio] = NULL;  in cbq_deactivate_class()
337 					q->activemask &= ~(1<<prio);  in cbq_deactivate_class()
343 	} while ((cl_prev = cl) != q->active[prio]);  in cbq_deactivate_class()
449 static psched_tdiff_t cbq_undelay_prio(struct cbq_sched_data *q, int prio,  in cbq_undelay_prio()  argument
453 	struct cbq_class *cl_prev = q->active[prio];  in cbq_undelay_prio()
468 			if (cl == q->active[prio]) {  in cbq_undelay_prio()
469 				q->active[prio] = cl_prev;  in cbq_undelay_prio()
470 				if (cl == q->active[prio]) {  in cbq_undelay_prio()
471 					q->active[prio] = NULL;  in cbq_undelay_prio()
479 	} while ((cl_prev = cl) != q->active[prio]);  in cbq_undelay_prio()
499 		int prio = ffz(~pmask);  in cbq_undelay()  local
502 		pmask &= ~(1<<prio);  in cbq_undelay()
504 		tmp = cbq_undelay_prio(q, prio, now);  in cbq_undelay()
506 			q->pmask |= 1<<prio;  in cbq_undelay()
684 cbq_dequeue_prio(struct Qdisc *sch, int prio)  in cbq_dequeue_prio()  argument
691 	cl_tail = cl_prev = q->active[prio];  in cbq_dequeue_prio()
738 				q->active[prio] = cl;  in cbq_dequeue_prio()
745 			if (cl->q->q.qlen == 0 || prio != cl->cpriority) {  in cbq_dequeue_prio()
760 						q->active[prio] = NULL;  in cbq_dequeue_prio()
761 						q->activemask &= ~(1<<prio);  in cbq_dequeue_prio()
767 					q->active[prio] = cl_tail;  in cbq_dequeue_prio()
781 	q->active[prio] = cl_prev;  in cbq_dequeue_prio()
795 		int prio = ffz(~activemask);  in cbq_dequeue_1()  local
796 		activemask &= ~(1<<prio);  in cbq_dequeue_1()
797 		skb = cbq_dequeue_prio(sch, prio);  in cbq_dequeue_1()
889 static void cbq_normalize_quanta(struct cbq_sched_data *q, int prio)  in cbq_normalize_quanta()  argument
894 	if (q->quanta[prio] == 0)  in cbq_normalize_quanta()
902 			if (cl->priority == prio) {  in cbq_normalize_quanta()
903 				cl->quantum = (cl->weight*cl->allot*q->nclasses[prio])/  in cbq_normalize_quanta()
904 					q->quanta[prio];  in cbq_normalize_quanta()
1035 	int prio;  in cbq_reset()  local
1047 	for (prio = 0; prio <= TC_CBQ_MAXPRIO; prio++)  in cbq_reset()
1048 		q->active[prio] = NULL;  in cbq_reset()