Lines Matching refs:node
137 struct rb_node pq_node; /* node for event queue */
138 struct rb_node node[TC_HTB_NUMPRIO]; /* node for self or feed tree */
214 * node). If we end up with classid MAJOR:0 we enqueue the skb into special
295 c = rb_entry(parent, struct htb_class, node[prio]);
302 rb_link_node(&cl->node[prio], parent, p);
303 rb_insert_color(&cl->node[prio], root);
343 * htb_next_rb_node - finds next node in binary tree
344 * @n: the current node in binary tree
406 if (hprio->ptr == cl->node + prio)
409 htb_safe_rb_erase(cl->node + prio, &hprio->row);
477 if (p->inner.clprio[prio].ptr == cl->node + prio) {
486 htb_safe_rb_erase(cl->node + prio,
784 /* Returns class->node+prio from id-tree where classe's id is >= id. NULL
793 rb_entry(n, struct htb_class, node[prio]);
855 cl = rb_entry(*sp->pptr, struct htb_class, node[prio]);
1884 RB_CLEAR_NODE(&cl->node[prio]);
1963 /* turn parent into inner node */
2039 /* it used to be a nasty bug here, we have to check that node