Searched refs:t_root (Results 1 – 2 of 2) sorted by relevance
76 struct rb_root t_root; member375 struct rb_node *p = rb_first(&q->t_root); in tfifo_reset()381 rb_erase(&skb->rbnode, &q->t_root); in tfifo_reset()403 struct rb_node **p = &q->t_root.rb_node, *parent = NULL; in tfifo_enqueue()416 rb_insert_color(&nskb->rbnode, &q->t_root); in tfifo_enqueue()569 if (q->t_root.rb_node) { in netem_enqueue()573 t_skb = skb_rb_last(&q->t_root); in netem_enqueue()676 struct sk_buff *skb = skb_rb_first(&q->t_root); in netem_peek()698 rb_erase(&skb->rbnode, &q->t_root); in netem_erase_head()
67 * in linear list (head,tail), otherwise are placed in a rbtree (t_root).71 struct rb_root t_root; member 441 /* f->t_root is already zeroed after kmem_cache_zalloc() */ in fq_classify() 463 struct sk_buff *skb = skb_rb_first(&flow->t_root); in fq_peek() 486 rb_erase(&skb->rbnode, &flow->t_root); in fq_erase_head() 521 p = &flow->t_root.rb_node; in flow_queue_add() 533 rb_insert_color(&skb->rbnode, &flow->t_root);786 struct rb_node *p = rb_first(&flow->t_root); in fq_flow_purge() 792 rb_erase(&skb->rbnode, &flow->t_root); in fq_flow_purge()