Lines Matching defs:inner
106 } inner;
182 * filters in qdisc and in inner nodes (if higher filter points to the inner
228 /* we have got inner class; apply inner filter chain */
379 if (p->un.inner.feed[prio].rb_node)
384 htb_add_to_id_tree(p->un.inner.feed + prio, cl, prio);
414 if (p->un.inner.ptr[prio] == cl->node + prio) {
418 p->un.inner.last_ptr_id[prio] = cl->common.classid;
419 p->un.inner.ptr[prio] = NULL;
422 htb_safe_rb_erase(cl->node + prio, p->un.inner.feed + prio);
424 if (!p->un.inner.feed[prio].rb_node)
771 (++sp)->root = cl->un.inner.feed[prio].rb_node;
772 sp->pptr = cl->un.inner.ptr + prio;
773 sp->pid = cl->un.inner.last_ptr_id + prio;
824 htb_next_rb_node((level ? cl->parent->un.inner.ptr : q->
836 htb_next_rb_node((level ? cl->parent->un.inner.ptr : q->
944 memset(&cl->un.inner, 0, sizeof(cl->un.inner));
1184 memset(&parent->un.inner, 0, sizeof(parent->un.inner));
1386 /* turn parent into inner node */
1400 memset(&parent->un.inner, 0, sizeof(parent->un.inner));