Searched refs:t_root (Results 1 - 4 of 4) sorted by relevance
/kernel/linux/linux-5.10/net/sched/ |
H A D | sch_netem.c | 73 /* internal t(ime)fifo qdisc uses t_root and sch->limit */ 74 struct rb_root t_root; member 363 struct rb_node *p = rb_first(&q->t_root); in tfifo_reset() 369 rb_erase(&skb->rbnode, &q->t_root); in tfifo_reset() 390 struct rb_node **p = &q->t_root.rb_node, *parent = NULL; in tfifo_enqueue() 403 rb_insert_color(&nskb->rbnode, &q->t_root); in tfifo_enqueue() 546 if (q->t_root.rb_node) { in netem_enqueue() 550 t_skb = skb_rb_last(&q->t_root); in netem_enqueue() 650 struct sk_buff *skb = skb_rb_first(&q->t_root); in netem_peek() 672 rb_erase(&skb->rbnode, &q->t_root); in netem_erase_head() [all...] |
H A D | sch_fq.c | 66 * in linear list (head,tail), otherwise are placed in a rbtree (t_root). 70 struct rb_root t_root; member 344 /* f->t_root is already zeroed after kmem_cache_zalloc() */ in fq_classify() 366 struct sk_buff *skb = skb_rb_first(&flow->t_root); in fq_peek() 386 rb_erase(&skb->rbnode, &flow->t_root); in fq_erase_head() 421 p = &flow->t_root.rb_node; in flow_queue_add() 433 rb_insert_color(&skb->rbnode, &flow->t_root); in flow_queue_add() 648 struct rb_node *p = rb_first(&flow->t_root); in fq_flow_purge() 654 rb_erase(&skb->rbnode, &flow->t_root); in fq_flow_purge()
|
/kernel/linux/linux-6.6/net/sched/ |
H A D | sch_netem.c | 74 /* internal t(ime)fifo qdisc uses t_root and sch->limit */ 75 struct rb_root t_root; member 372 struct rb_node *p = rb_first(&q->t_root); in tfifo_reset() 378 rb_erase(&skb->rbnode, &q->t_root); in tfifo_reset() 399 struct rb_node **p = &q->t_root.rb_node, *parent = NULL; in tfifo_enqueue() 412 rb_insert_color(&nskb->rbnode, &q->t_root); in tfifo_enqueue() 555 if (q->t_root.rb_node) { in netem_enqueue() 559 t_skb = skb_rb_last(&q->t_root); in netem_enqueue() 659 struct sk_buff *skb = skb_rb_first(&q->t_root); in netem_peek() 681 rb_erase(&skb->rbnode, &q->t_root); in netem_erase_head() [all...] |
H A D | sch_fq.c | 66 * in linear list (head,tail), otherwise are placed in a rbtree (t_root). 70 struct rb_root t_root; member 344 /* f->t_root is already zeroed after kmem_cache_zalloc() */ in fq_classify() 366 struct sk_buff *skb = skb_rb_first(&flow->t_root); in fq_peek() 386 rb_erase(&skb->rbnode, &flow->t_root); in fq_erase_head() 421 p = &flow->t_root.rb_node; in flow_queue_add() 433 rb_insert_color(&skb->rbnode, &flow->t_root); in flow_queue_add() 648 struct rb_node *p = rb_first(&flow->t_root); in fq_flow_purge() 654 rb_erase(&skb->rbnode, &flow->t_root); in fq_flow_purge()
|
Completed in 6 milliseconds