223 	u32 prio = skb->priority;  in cbq_classify()  local
230 	if (TC_H_MAJ(prio ^ sch->handle) == 0 &&  in cbq_classify()
231 	    (cl = cbq_class_lookup(q, prio)) != NULL)  in cbq_classify()
287 	if (TC_H_MAJ(prio) == 0 &&  in cbq_classify()
288 	    !(cl = head->defaults[prio & TC_PRIO_MAX]) &&  in cbq_classify()
304 	int prio = cl->cpriority;  in cbq_activate_class()  local
307 	cl_tail = q->active[prio];  in cbq_activate_class()
308 	q->active[prio] = cl;  in cbq_activate_class()
315 		q->activemask |= (1<<prio);  in cbq_activate_class()
328 	int prio = this->cpriority;  in cbq_deactivate_class()  local
330 	struct cbq_class *cl_prev = q->active[prio];  in cbq_deactivate_class()
338 			if (cl == q->active[prio]) {  in cbq_deactivate_class()
339 				q->active[prio] = cl_prev;  in cbq_deactivate_class()
340 				if (cl == q->active[prio]) {  in cbq_deactivate_class()
341 					q->active[prio] = NULL;  in cbq_deactivate_class()
342 					q->activemask &= ~(1<<prio);  in cbq_deactivate_class()
348 	} while ((cl_prev = cl) != q->active[prio]);  in cbq_deactivate_class()
552 static psched_tdiff_t cbq_undelay_prio(struct cbq_sched_data *q, int prio,  in cbq_undelay_prio()  argument
556 	struct cbq_class *cl_prev = q->active[prio];  in cbq_undelay_prio()
571 			if (cl == q->active[prio]) {  in cbq_undelay_prio()
572 				q->active[prio] = cl_prev;  in cbq_undelay_prio()
573 				if (cl == q->active[prio]) {  in cbq_undelay_prio()
574 					q->active[prio] = NULL;  in cbq_undelay_prio()
582 	} while ((cl_prev = cl) != q->active[prio]);  in cbq_undelay_prio()
602 		int prio = ffz(~pmask);  in cbq_undelay()  local
605 		pmask &= ~(1<<prio);  in cbq_undelay()
607 		tmp = cbq_undelay_prio(q, prio, now);  in cbq_undelay()
609 			q->pmask |= 1<<prio;  in cbq_undelay()
822 cbq_dequeue_prio(struct Qdisc *sch, int prio)  in cbq_dequeue_prio()  argument
829 	cl_tail = cl_prev = q->active[prio];  in cbq_dequeue_prio()
876 				q->active[prio] = cl;  in cbq_dequeue_prio()
883 			if (cl->q->q.qlen == 0 || prio != cl->cpriority) {  in cbq_dequeue_prio()
898 						q->active[prio] = NULL;  in cbq_dequeue_prio()
899 						q->activemask &= ~(1<<prio);  in cbq_dequeue_prio()
905 					q->active[prio] = cl_tail;  in cbq_dequeue_prio()
919 	q->active[prio] = cl_prev;  in cbq_dequeue_prio()
933 		int prio = ffz(~activemask);  in cbq_dequeue_1()  local
934 		activemask &= ~(1<<prio);  in cbq_dequeue_1()
935 		skb = cbq_dequeue_prio(sch, prio);  in cbq_dequeue_1()
1028 static void cbq_normalize_quanta(struct cbq_sched_data *q, int prio)  in cbq_normalize_quanta()  argument
1033 	if (q->quanta[prio] == 0)  in cbq_normalize_quanta()
1041 			if (cl->priority == prio) {  in cbq_normalize_quanta()
1042 				cl->quantum = (cl->weight*cl->allot*q->nclasses[prio])/  in cbq_normalize_quanta()
1043 					q->quanta[prio];  in cbq_normalize_quanta()
1173 	int prio;  in cbq_drop()  local
1176 	for (prio = TC_CBQ_MAXPRIO; prio >= 0; prio--) {  in cbq_drop()
1177 		cl_head = q->active[prio];  in cbq_drop()
1199 	int prio;  in cbq_reset()  local
1211 	for (prio = 0; prio <= TC_CBQ_MAXPRIO; prio++)  in cbq_reset()
1212 		q->active[prio] = NULL;  in cbq_reset()