Home
last modified time | relevance | path

Searched refs:rbnode (Results 1 – 15 of 15) sorted by relevance

/linux-6.15/drivers/base/regmap/
H A Dregcache-rbtree.c45 *top = rbnode->base_reg + ((rbnode->blklen - 1) * map->reg_stride); in regcache_rbtree_get_base_top_reg()
71 if (rbnode) { in regcache_rbtree_lookup()
75 return rbnode; in regcache_rbtree_lookup()
85 return rbnode; in regcache_rbtree_lookup()
249 if (rbnode) { in regcache_rbtree_read()
321 rbnode = kzalloc(sizeof(*rbnode), map->alloc_flags); in regcache_rbtree_node_alloc()
322 if (!rbnode) in regcache_rbtree_node_alloc()
357 return rbnode; in regcache_rbtree_node_alloc()
362 kfree(rbnode); in regcache_rbtree_node_alloc()
381 if (rbnode) { in regcache_rbtree_write()
[all …]
/linux-6.15/drivers/infiniband/hw/hfi1/
H A Dmmu_rb.c80 struct mmu_rb_node *rbnode; in hfi1_mmu_rb_unregister() local
101 rbnode = rb_entry(node, struct mmu_rb_node, node); in hfi1_mmu_rb_unregister()
104 list_move(&rbnode->list, &del_list); in hfi1_mmu_rb_unregister()
110 list_del(&rbnode->list); in hfi1_mmu_rb_unregister()
111 kref_put(&rbnode->refcount, release_immediate); in hfi1_mmu_rb_unregister()
228 struct mmu_rb_node *rbnode, *ptr; in hfi1_mmu_rb_evict() local
241 if (kref_read(&rbnode->refcount) > 1) in hfi1_mmu_rb_evict()
246 __mmu_int_rb_remove(rbnode, &handler->root); in hfi1_mmu_rb_evict()
248 list_move(&rbnode->list, &del_list); in hfi1_mmu_rb_evict()
256 trace_hfi1_mmu_rb_evict(rbnode); in hfi1_mmu_rb_evict()
[all …]
/linux-6.15/net/ipv4/
H A Dinet_fragment.c51 RB_CLEAR_NODE(&skb->rbnode); in fragcb_clear()
74 rb_link_node(&skb->rbnode, &q->last_run_head->rbnode, in fragrun_create()
75 &q->last_run_head->rbnode.rb_right); in fragrun_create()
276 rb_erase(&skb->rbnode, root); in inet_frag_rbtree_purge()
476 if (RB_EMPTY_NODE(&skb->rbnode)) in inet_frag_reasm_prepare()
479 rb_replace_node(&skb->rbnode, &fp->rbnode, in inet_frag_reasm_prepare()
491 rb_replace_node(&head->rbnode, &skb->rbnode, in inet_frag_reasm_prepare()
568 rbn = rb_next(&head->rbnode); in inet_frag_reasm_finish()
593 memset(&fp->rbnode, 0, sizeof(fp->rbnode)); in inet_frag_reasm_finish()
637 rb_replace_node(&head->rbnode, &skb->rbnode, in inet_frag_pull_head()
[all …]
H A Dtcp_input.c4985 rb_erase(&skb->rbnode, &tp->out_of_order_queue); in tcp_ofo_queue()
5066 rb_link_node(&skb->rbnode, NULL, p); in tcp_data_queue_ofo()
5089 parent = &tp->ooo_last_skb->rbnode; in tcp_data_queue_ofo()
5121 rb_replace_node(&skb1->rbnode, &skb->rbnode, in tcp_data_queue_ofo()
5140 rb_link_node(&skb->rbnode, parent, p); in tcp_data_queue_ofo()
5141 rb_insert_color(&skb->rbnode, &tp->out_of_order_queue); in tcp_data_queue_ofo()
5153 rb_erase(&skb1->rbnode, &tp->out_of_order_queue); in tcp_data_queue_ofo()
5401 rb_erase(&skb->rbnode, root); in tcp_collapse_one()
5424 rb_link_node(&skb->rbnode, parent, p); in tcp_rbtree_insert()
5425 rb_insert_color(&skb->rbnode, root); in tcp_rbtree_insert()
[all …]
/linux-6.15/net/netfilter/
H A Dnf_conncount.c320 struct rb_node **rbnode, *parent; in insert_tree() local
329 rbnode = &(root->rb_node); in insert_tree()
330 while (*rbnode) { in insert_tree()
332 rbconn = rb_entry(*rbnode, struct nf_conncount_rb, node); in insert_tree()
334 parent = *rbnode; in insert_tree()
337 rbnode = &((*rbnode)->rb_left); in insert_tree()
339 rbnode = &((*rbnode)->rb_right); in insert_tree()
389 rb_link_node_rcu(&rbconn->node, parent, rbnode); in insert_tree()
/linux-6.15/net/sched/
H A Dsch_etf.c188 rb_link_node(&nskb->rbnode, parent, p); in etf_enqueue_timesortedlist()
189 rb_insert_color_cached(&nskb->rbnode, &q->head, leftmost); in etf_enqueue_timesortedlist()
211 rb_erase_cached(&skb->rbnode, &q->head); in timesortedlist_drop()
235 rb_erase_cached(&skb->rbnode, &q->head); in timesortedlist_remove()
427 rb_erase_cached(&skb->rbnode, &q->head); in timesortedlist_clear()
H A Dsch_netem.c381 rb_erase(&skb->rbnode, &q->t_root); in tfifo_reset()
415 rb_link_node(&nskb->rbnode, parent, p); in tfifo_enqueue()
416 rb_insert_color(&nskb->rbnode, &q->t_root); in tfifo_enqueue()
697 rb_erase(&skb->rbnode, &q->t_root); in netem_erase_head()
H A Dsch_fq.c485 rb_erase(&skb->rbnode, &flow->t_root); in fq_erase_head()
530 rb_link_node(&skb->rbnode, parent, p); in flow_queue_add()
531 rb_insert_color(&skb->rbnode, &flow->t_root); in flow_queue_add()
791 rb_erase(&skb->rbnode, &flow->t_root); in fq_flow_purge()
/linux-6.15/fs/btrfs/
H A Dbackref.c257 rb_entry(new, struct prelim_ref, rbnode); in prelim_ref_rb_add_cmp()
259 rb_entry(exist, struct prelim_ref, rbnode); in prelim_ref_rb_add_cmp()
299 exist = rb_find_add_cached(&newref->rbnode, root, prelim_ref_rb_add_cmp); in prelim_ref_insert()
301 struct prelim_ref *ref = rb_entry(exist, struct prelim_ref, rbnode); in prelim_ref_insert()
340 &preftree->root.rb_root, rbnode) { in prelim_release()
454 ref = rb_entry(parent, struct prelim_ref, rbnode); in is_shared_data_backref()
756 ref = rb_entry(rnode, struct prelim_ref, rbnode); in resolve_indirect_refs()
763 rb_erase_cached(&ref->rbnode, &preftrees->indirect.root); in resolve_indirect_refs()
847 ref = rb_entry(node, struct prelim_ref, rbnode); in add_missing_keys()
1585 ref = rb_entry(node, struct prelim_ref, rbnode); in find_parent_nodes()
[all …]
H A Dbackref.h259 struct rb_node rbnode; member
/linux-6.15/net/mptcp/
H A Dprotocol.c188 rb_link_node(&skb->rbnode, NULL, p); in mptcp_data_queue_ofo()
189 rb_insert_color(&skb->rbnode, &msk->out_of_order_queue); in mptcp_data_queue_ofo()
206 parent = &msk->ooo_last_skb->rbnode; in mptcp_data_queue_ofo()
237 rb_replace_node(&skb1->rbnode, &skb->rbnode, in mptcp_data_queue_ofo()
252 rb_link_node(&skb->rbnode, parent, p); in mptcp_data_queue_ofo()
253 rb_insert_color(&skb->rbnode, &msk->out_of_order_queue); in mptcp_data_queue_ofo()
260 rb_erase(&skb1->rbnode, &msk->out_of_order_queue); in mptcp_data_queue_ofo()
658 rb_erase(&skb->rbnode, &msk->out_of_order_queue); in __mptcp_ofo_queue()
/linux-6.15/include/linux/
H A Dskbuff.h899 struct rb_node rbnode; /* used in netem, ip4 defrag, and tcp stack */ member
4039 #define rb_to_skb(rb) rb_entry_safe(rb, struct sk_buff, rbnode)
4042 #define skb_rb_next(skb) rb_to_skb(rb_next(&(skb)->rbnode))
4043 #define skb_rb_prev(skb) rb_to_skb(rb_prev(&(skb)->rbnode))
/linux-6.15/Documentation/networking/
H A Drds.rst318 wraps the raw congestion bitmap, contains rbnode, waitq, etc.
/linux-6.15/include/net/
H A Dtcp.h2156 rb_erase(&skb->rbnode, &sk->tcp_rtx_queue); in tcp_rtx_queue_unlink()
/linux-6.15/net/core/
H A Dskbuff.c3937 struct sk_buff *skb = rb_entry(p, struct sk_buff, rbnode); in skb_rbtree_purge()
3940 rb_erase(&skb->rbnode, root); in skb_rbtree_purge()