Lines Matching refs:node
136 struct rb_node pq_node; /* node for event queue */
137 struct rb_node node[TC_HTB_NUMPRIO]; /* node for self or feed tree */
202 * node). If we end up with classid MAJOR:0 we enqueue the skb into special
282 c = rb_entry(parent, struct htb_class, node[prio]);
289 rb_link_node(&cl->node[prio], parent, p);
290 rb_insert_color(&cl->node[prio], root);
327 * htb_next_rb_node - finds next node in binary tree
383 if (hprio->ptr == cl->node + prio)
386 htb_safe_rb_erase(cl->node + prio, &hprio->row);
450 if (p->inner.clprio[prio].ptr == cl->node + prio) {
459 htb_safe_rb_erase(cl->node + prio,
741 /* Returns class->node+prio from id-tree where classe's id is >= id. NULL
750 rb_entry(n, struct htb_class, node[prio]);
810 cl = rb_entry(*sp->pptr, struct htb_class, node[prio]);
1394 RB_CLEAR_NODE(&cl->node[prio]);
1404 /* turn parent into inner node */
1458 /* it used to be a nasty bug here, we have to check that node