112 	struct htb_class	*parent;	/* parent class */  member
272 	struct rb_node **p = &root->rb_node, *parent = NULL;  in htb_add_to_id_tree()  local
276 		parent = *p;  in htb_add_to_id_tree()
277 		c = rb_entry(parent, struct htb_class, node[prio]);  in htb_add_to_id_tree()
280 			p = &parent->rb_right;  in htb_add_to_id_tree()
282 			p = &parent->rb_left;  in htb_add_to_id_tree()
284 	rb_link_node(&cl->node[prio], parent, p);  in htb_add_to_id_tree()
298 	struct rb_node **p = &q->hlevel[cl->level].wait_pq.rb_node, *parent = NULL;  in htb_add_to_wait_tree()  local
310 		parent = *p;  in htb_add_to_wait_tree()
311 		c = rb_entry(parent, struct htb_class, pq_node);  in htb_add_to_wait_tree()
313 			p = &parent->rb_right;  in htb_add_to_wait_tree()
315 			p = &parent->rb_left;  in htb_add_to_wait_tree()
317 	rb_link_node(&cl->pq_node, parent, p);  in htb_add_to_wait_tree()
397 	struct htb_class *p = cl->parent;  in htb_activate_prios()
416 		p = cl->parent;  in htb_activate_prios()
432 	struct htb_class *p = cl->parent;  in htb_deactivate_prios()
460 		p = cl->parent;  in htb_deactivate_prios()
679 		cl = cl->parent;  in htb_charge_class()
855 		htb_next_rb_node(level ? &cl->parent->un.inner.clprio[prio].ptr:  in htb_dequeue_tree()
866 			htb_next_rb_node(level ? &cl->parent->un.inner.clprio[prio].ptr :  in htb_dequeue_tree()
1105 	tcm->tcm_parent = cl->parent ? cl->parent->common.classid : TC_H_ROOT;  in htb_dump_class()
1198 	if (!cl->parent)  in htb_parent_last_child()
1201 	if (cl->parent->children > 1)  in htb_parent_last_child()
1210 	struct htb_class *parent = cl->parent;  in htb_parent_to_leaf()  local
1214 	if (parent->cmode != HTB_CAN_SEND)  in htb_parent_to_leaf()
1215 		htb_safe_rb_erase(&parent->pq_node,  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()
1219 	memset(&parent->un.inner, 0, sizeof(parent->un.inner));  in htb_parent_to_leaf()
1220 	INIT_LIST_HEAD(&parent->un.leaf.drop_list);  in htb_parent_to_leaf()
1221 	parent->un.leaf.q = new_q ? new_q : &noop_qdisc;  in htb_parent_to_leaf()
1222 	parent->tokens = parent->buffer;  in htb_parent_to_leaf()
1223 	parent->ctokens = parent->cbuffer;  in htb_parent_to_leaf()
1224 	parent->t_c = ktime_get_ns();  in htb_parent_to_leaf()
1225 	parent->cmode = HTB_CAN_SEND;  in htb_parent_to_leaf()
1284 					  cl->parent->common.classid);  in htb_delete()
1300 	if (cl->parent)  in htb_delete()
1301 		cl->parent->children--;  in htb_delete()
1337 	struct htb_class *cl = (struct htb_class *)*arg, *parent;  in htb_change_class()  local
1355 	parent = parentid == TC_H_ROOT ? NULL : htb_find(parentid, sch);  in htb_change_class()
1392 		if (parent && parent->parent && parent->parent->level < 2) {  in htb_change_class()
1427 		if (parent && !parent->level) {  in htb_change_class()
1428 			unsigned int qlen = parent->un.leaf.q->q.qlen;  in htb_change_class()
1429 			unsigned int backlog = parent->un.leaf.q->qstats.backlog;  in htb_change_class()
1432 			qdisc_reset(parent->un.leaf.q);  in htb_change_class()
1433 			qdisc_tree_reduce_backlog(parent->un.leaf.q, qlen, backlog);  in htb_change_class()
1434 			qdisc_destroy(parent->un.leaf.q);  in htb_change_class()
1435 			if (parent->prio_activity)  in htb_change_class()
1436 				htb_deactivate(q, parent);  in htb_change_class()
1439 			if (parent->cmode != HTB_CAN_SEND) {  in htb_change_class()
1440 				htb_safe_rb_erase(&parent->pq_node, &q->hlevel[0].wait_pq);  in htb_change_class()
1441 				parent->cmode = HTB_CAN_SEND;  in htb_change_class()
1443 			parent->level = (parent->parent ? parent->parent->level  in htb_change_class()
1445 			memset(&parent->un.inner, 0, sizeof(parent->un.inner));  in htb_change_class()
1451 		cl->parent = parent;  in htb_change_class()
1462 		if (parent)  in htb_change_class()
1463 			parent->children++;  in htb_change_class()
1534 static unsigned long htb_bind_filter(struct Qdisc *sch, unsigned long parent,  in htb_bind_filter()  argument