111 	int			level;		/* our level (see above) */  member
230 		if (cl->level == 0)  in htb_classify()
258 		if (!cl->level)  in htb_classify()
266 	if (!cl || cl->level)  in htb_classify()
306 	struct rb_node **p = &q->hlevel[cl->level].wait_pq.rb_node, *parent = NULL;  in htb_add_to_wait_tree()
313 	if (q->near_ev_cache[cl->level] > cl->pq_key)  in htb_add_to_wait_tree()
314 		q->near_ev_cache[cl->level] = cl->pq_key;  in htb_add_to_wait_tree()
326 	rb_insert_color(&cl->pq_node, &q->hlevel[cl->level].wait_pq);  in htb_add_to_wait_tree()
349 	q->row_mask[cl->level] |= mask;  in htb_add_class_to_row()
353 		htb_add_to_id_tree(&q->hlevel[cl->level].hprio[prio].row, cl, prio);  in htb_add_class_to_row()
379 	struct htb_level *hlevel = &q->hlevel[cl->level];  in htb_remove_class_from_row()
393 	q->row_mask[cl->level] &= ~m;  in htb_remove_class_from_row()
555 	WARN_ON(cl->level || !cl->un.leaf.q || !cl->un.leaf.q->q.qlen);  in htb_activate()
672 			     int level, struct sk_buff *skb)  in htb_charge_class()  argument
680 		if (cl->level >= level) {  in htb_charge_class()
681 			if (cl->level == level)  in htb_charge_class()
696 				htb_safe_rb_erase(&cl->pq_node, &q->hlevel[cl->level].wait_pq);  in htb_charge_class()
702 		if (cl->level)  in htb_charge_class()
716 static s64 htb_do_events(struct htb_sched *q, const int level,  in htb_do_events()  argument
724 	struct rb_root *wait_pq = &q->hlevel[level].wait_pq;  in htb_do_events()
824 			if (!cl->level)  in htb_lookup_leaf()
840 					const int level)  in htb_dequeue_tree()  argument
844 	struct htb_level *hlevel = &q->hlevel[level];  in htb_dequeue_tree()
865 			if ((q->row_mask[level] & (1 << prio)) == 0)  in htb_dequeue_tree()
881 		htb_next_rb_node(level ? &cl->parent->un.inner.clprio[prio].ptr:  in htb_dequeue_tree()
889 		cl->un.leaf.deficit[level] -= qdisc_pkt_len(skb);  in htb_dequeue_tree()
890 		if (cl->un.leaf.deficit[level] < 0) {  in htb_dequeue_tree()
891 			cl->un.leaf.deficit[level] += cl->quantum;  in htb_dequeue_tree()
892 			htb_next_rb_node(level ? &cl->parent->un.inner.clprio[prio].ptr :  in htb_dequeue_tree()
900 		htb_charge_class(q, cl, level, skb);  in htb_dequeue_tree()
909 	int level;  in htb_dequeue()  local
930 	for (level = 0; level < TC_HTB_MAXDEPTH; level++) {  in htb_dequeue()
933 		s64 event = q->near_ev_cache[level];  in htb_dequeue()
936 			event = htb_do_events(q, level, start_at);  in htb_dequeue()
939 			q->near_ev_cache[level] = event;  in htb_dequeue()
945 		m = ~q->row_mask[level];  in htb_dequeue()
950 			skb = htb_dequeue_tree(q, prio, level);  in htb_dequeue()
974 			if (cl->level)  in htb_reset()
1106 	if (!cl->level && cl->un.leaf.q)  in htb_dump_class()
1121 	opt.level = cl->level;  in htb_dump_class()
1149 	if (!cl->level && cl->un.leaf.q) {  in htb_dump_class_stats()
1172 	if (cl->level)  in htb_graft()
1186 	return !cl->level ? cl->un.leaf.q : NULL;  in htb_leaf()
1212 	WARN_ON(cl->level || !cl->un.leaf.q || cl->prio_activity);  in htb_parent_to_leaf()
1216 				  &q->hlevel[parent->level].wait_pq);  in htb_parent_to_leaf()
1218 	parent->level = 0;  in htb_parent_to_leaf()
1230 	if (!cl->level) {  in htb_destroy_class()
1284 	if (!cl->level && htb_parent_last_child(cl)) {  in htb_delete()
1292 	if (!cl->level) {  in htb_delete()
1310 				  &q->hlevel[cl->level].wait_pq);  in htb_delete()
1382 		if (parent && parent->parent && parent->parent->level < 2) {  in htb_change_class()
1423 		if (parent && !parent->level) {  in htb_change_class()
1439 			parent->level = (parent->parent ? parent->parent->level  in htb_change_class()
1485 	if (!cl->level) {  in htb_change_class()