100 	u32			prio;		/* these two are used only by leaves... */  member
275 			       struct htb_class *cl, int prio)  in htb_add_to_id_tree()  argument
282 		c = rb_entry(parent, struct htb_class, node[prio]);  in htb_add_to_id_tree()
289 	rb_link_node(&cl->node[prio], parent, p);  in htb_add_to_id_tree()
290 	rb_insert_color(&cl->node[prio], root);  in htb_add_to_id_tree()
348 		int prio = ffz(~mask);  in htb_add_class_to_row()  local
349 		mask &= ~(1 << prio);  in htb_add_class_to_row()
350 		htb_add_to_id_tree(&q->hlevel[cl->level].hprio[prio].row, cl, prio);  in htb_add_class_to_row()
379 		int prio = ffz(~mask);  in htb_remove_class_from_row()  local
380 		struct htb_prio *hprio = &hlevel->hprio[prio];  in htb_remove_class_from_row()
382 		mask &= ~(1 << prio);  in htb_remove_class_from_row()
383 		if (hprio->ptr == cl->node + prio)  in htb_remove_class_from_row()
386 		htb_safe_rb_erase(cl->node + prio, &hprio->row);  in htb_remove_class_from_row()
388 			m |= 1 << prio;  in htb_remove_class_from_row()
408 			int prio = ffz(~m);  in htb_activate_prios()  local
409 			m &= ~(1 << prio);  in htb_activate_prios()
411 			if (p->inner.clprio[prio].feed.rb_node)  in htb_activate_prios()
415 				mask &= ~(1 << prio);  in htb_activate_prios()
417 			htb_add_to_id_tree(&p->inner.clprio[prio].feed, cl, prio);  in htb_activate_prios()
444 			int prio = ffz(~m);  in htb_deactivate_prios()  local
445 			m &= ~(1 << prio);  in htb_deactivate_prios()
447 			if (p->inner.clprio[prio].ptr == cl->node + prio) {  in htb_deactivate_prios()
452 				p->inner.clprio[prio].last_ptr_id = cl->common.classid;  in htb_deactivate_prios()
453 				p->inner.clprio[prio].ptr = NULL;  in htb_deactivate_prios()
456 			htb_safe_rb_erase(cl->node + prio,  in htb_deactivate_prios()
457 					  &p->inner.clprio[prio].feed);  in htb_deactivate_prios()
459 			if (!p->inner.clprio[prio].feed.rb_node)  in htb_deactivate_prios()
460 				mask |= 1 << prio;  in htb_deactivate_prios()
560 		cl->prio_activity = 1 << cl->prio;  in htb_activate()
741 static struct rb_node *htb_id_find_next_upper(int prio, struct rb_node *n,  in htb_id_find_next_upper()  argument
747 		    rb_entry(n, struct htb_class, node[prio]);  in htb_id_find_next_upper()
766 static struct htb_class *htb_lookup_leaf(struct htb_prio *hprio, const int prio)  in htb_lookup_leaf()  argument
786 			    htb_id_find_next_upper(prio, sp->root, *sp->pid);  in htb_lookup_leaf()
807 			cl = rb_entry(*sp->pptr, struct htb_class, node[prio]);  in htb_lookup_leaf()
810 			clp = &cl->inner.clprio[prio];  in htb_lookup_leaf()
823 static struct sk_buff *htb_dequeue_tree(struct htb_sched *q, const int prio,  in htb_dequeue_tree()  argument
829 	struct htb_prio *hprio = &hlevel->hprio[prio];  in htb_dequeue_tree()
832 	start = cl = htb_lookup_leaf(hprio, prio);  in htb_dequeue_tree()
849 			if ((q->row_mask[level] & (1 << prio)) == 0)  in htb_dequeue_tree()
852 			next = htb_lookup_leaf(hprio, prio);  in htb_dequeue_tree()
865 		htb_next_rb_node(level ? &cl->parent->inner.clprio[prio].ptr:  in htb_dequeue_tree()
866 					 &q->hlevel[0].hprio[prio].ptr);  in htb_dequeue_tree()
867 		cl = htb_lookup_leaf(hprio, prio);  in htb_dequeue_tree()
876 			htb_next_rb_node(level ? &cl->parent->inner.clprio[prio].ptr :  in htb_dequeue_tree()
877 						 &q->hlevel[0].hprio[prio].ptr);  in htb_dequeue_tree()
931 			int prio = ffz(m);  in htb_dequeue()  local
933 			m |= 1 << prio;  in htb_dequeue()
934 			skb = htb_dequeue_tree(q, prio, level);  in htb_dequeue()
1098 	opt.prio = cl->prio;  in htb_dump_class()
1338 		int prio;  in htb_change_class()  local
1390 		for (prio = 0; prio < TC_HTB_NUMPRIO; prio++)  in htb_change_class()
1391 			RB_CLEAR_NODE(&cl->node[prio]);  in htb_change_class()
1474 		if ((cl->prio = hopt->prio) >= TC_HTB_NUMPRIO)  in htb_change_class()
1475 			cl->prio = TC_HTB_NUMPRIO - 1;  in htb_change_class()