Home
last modified time | relevance | path

Searched refs:rbnode (Results 1 - 25 of 31) sorted by relevance

12

/kernel/linux/linux-5.10/drivers/base/regmap/
H A Dregcache-rbtree.c41 struct regcache_rbtree_node *rbnode, in regcache_rbtree_get_base_top_reg()
44 *base = rbnode->base_reg; in regcache_rbtree_get_base_top_reg()
45 *top = rbnode->base_reg + ((rbnode->blklen - 1) * map->reg_stride); in regcache_rbtree_get_base_top_reg()
49 struct regcache_rbtree_node *rbnode, unsigned int idx) in regcache_rbtree_get_register()
51 return regcache_get_val(map, rbnode->block, idx); in regcache_rbtree_get_register()
55 struct regcache_rbtree_node *rbnode, in regcache_rbtree_set_register()
58 set_bit(idx, rbnode->cache_present); in regcache_rbtree_set_register()
59 regcache_set_val(map, rbnode->block, idx, val); in regcache_rbtree_set_register()
67 struct regcache_rbtree_node *rbnode; in regcache_rbtree_lookup() local
39 regcache_rbtree_get_base_top_reg( struct regmap *map, struct regcache_rbtree_node *rbnode, unsigned int *base, unsigned int *top) regcache_rbtree_get_base_top_reg() argument
48 regcache_rbtree_get_register(struct regmap *map, struct regcache_rbtree_node *rbnode, unsigned int idx) regcache_rbtree_get_register() argument
54 regcache_rbtree_set_register(struct regmap *map, struct regcache_rbtree_node *rbnode, unsigned int idx, unsigned int val) regcache_rbtree_set_register() argument
96 regcache_rbtree_insert(struct regmap *map, struct rb_root *root, struct regcache_rbtree_node *rbnode) regcache_rbtree_insert() argument
245 struct regcache_rbtree_node *rbnode; regcache_rbtree_read() local
262 regcache_rbtree_insert_to_block(struct regmap *map, struct regcache_rbtree_node *rbnode, unsigned int base_reg, unsigned int top_reg, unsigned int reg, unsigned int value) regcache_rbtree_insert_to_block() argument
319 struct regcache_rbtree_node *rbnode; regcache_rbtree_node_alloc() local
372 struct regcache_rbtree_node *rbnode, *rbnode_tmp; regcache_rbtree_write() local
470 struct regcache_rbtree_node *rbnode; regcache_rbtree_sync() local
510 struct regcache_rbtree_node *rbnode; regcache_rbtree_drop() local
[all...]
/kernel/linux/linux-6.6/drivers/base/regmap/
H A Dregcache-rbtree.c41 struct regcache_rbtree_node *rbnode, in regcache_rbtree_get_base_top_reg()
44 *base = rbnode->base_reg; in regcache_rbtree_get_base_top_reg()
45 *top = rbnode->base_reg + ((rbnode->blklen - 1) * map->reg_stride); in regcache_rbtree_get_base_top_reg()
49 struct regcache_rbtree_node *rbnode, unsigned int idx) in regcache_rbtree_get_register()
51 return regcache_get_val(map, rbnode->block, idx); in regcache_rbtree_get_register()
55 struct regcache_rbtree_node *rbnode, in regcache_rbtree_set_register()
58 set_bit(idx, rbnode->cache_present); in regcache_rbtree_set_register()
59 regcache_set_val(map, rbnode->block, idx, val); in regcache_rbtree_set_register()
67 struct regcache_rbtree_node *rbnode; in regcache_rbtree_lookup() local
39 regcache_rbtree_get_base_top_reg( struct regmap *map, struct regcache_rbtree_node *rbnode, unsigned int *base, unsigned int *top) regcache_rbtree_get_base_top_reg() argument
48 regcache_rbtree_get_register(struct regmap *map, struct regcache_rbtree_node *rbnode, unsigned int idx) regcache_rbtree_get_register() argument
54 regcache_rbtree_set_register(struct regmap *map, struct regcache_rbtree_node *rbnode, unsigned int idx, unsigned int val) regcache_rbtree_set_register() argument
96 regcache_rbtree_insert(struct regmap *map, struct rb_root *root, struct regcache_rbtree_node *rbnode) regcache_rbtree_insert() argument
245 struct regcache_rbtree_node *rbnode; regcache_rbtree_read() local
262 regcache_rbtree_insert_to_block(struct regmap *map, struct regcache_rbtree_node *rbnode, unsigned int base_reg, unsigned int top_reg, unsigned int reg, unsigned int value) regcache_rbtree_insert_to_block() argument
319 struct regcache_rbtree_node *rbnode; regcache_rbtree_node_alloc() local
372 struct regcache_rbtree_node *rbnode, *rbnode_tmp; regcache_rbtree_write() local
470 struct regcache_rbtree_node *rbnode; regcache_rbtree_sync() local
514 struct regcache_rbtree_node *rbnode; regcache_rbtree_drop() local
[all...]
/kernel/linux/linux-6.6/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()
109 rbnode = list_first_entry(&del_list, struct mmu_rb_node, 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
239 list_for_each_entry_safe(rbnode, ptr, &handler->lru_list, list) { in hfi1_mmu_rb_evict()
240 /* refcount == 1 implies mmu_rb_handler has only rbnode ref */ in hfi1_mmu_rb_evict()
241 if (kref_read(&rbnode in hfi1_mmu_rb_evict()
[all...]
/kernel/linux/linux-5.10/drivers/infiniband/hw/hfi1/
H A Dmmu_rb.c118 struct mmu_rb_node *rbnode; in hfi1_mmu_rb_unregister() local
139 rbnode = rb_entry(node, struct mmu_rb_node, node); in hfi1_mmu_rb_unregister()
142 list_move(&rbnode->list, &del_list); in hfi1_mmu_rb_unregister()
147 rbnode = list_first_entry(&del_list, struct mmu_rb_node, list); in hfi1_mmu_rb_unregister()
148 list_del(&rbnode->list); in hfi1_mmu_rb_unregister()
149 kref_put(&rbnode->refcount, release_immediate); in hfi1_mmu_rb_unregister()
265 struct mmu_rb_node *rbnode, *ptr; in hfi1_mmu_rb_evict() local
276 list_for_each_entry_safe(rbnode, ptr, &handler->lru_list, list) { in hfi1_mmu_rb_evict()
277 /* refcount == 1 implies mmu_rb_handler has only rbnode ref */ in hfi1_mmu_rb_evict()
278 if (kref_read(&rbnode in hfi1_mmu_rb_evict()
[all...]
/kernel/linux/linux-5.10/net/ipv4/
H A Dinet_fragment.c48 RB_CLEAR_NODE(&skb->rbnode); in fragcb_clear()
71 rb_link_node(&skb->rbnode, &q->last_run_head->rbnode, in fragrun_create()
72 &q->last_run_head->rbnode.rb_right); in fragrun_create()
74 rb_link_node(&skb->rbnode, NULL, &q->rb_fragments.rb_node); in fragrun_create()
75 rb_insert_color(&skb->rbnode, &q->rb_fragments); in fragrun_create()
238 struct sk_buff *skb = rb_entry(p, struct sk_buff, rbnode); in inet_frag_rbtree_purge()
241 rb_erase(&skb->rbnode, root); in inet_frag_rbtree_purge()
400 rb_link_node(&skb->rbnode, parent, rbn); in inet_frag_queue_insert()
401 rb_insert_color(&skb->rbnode, in inet_frag_queue_insert()
[all...]
H A Dtcp_input.c4729 rb_erase(&skb->rbnode, &tp->out_of_order_queue); in tcp_ofo_queue()
4809 rb_link_node(&skb->rbnode, NULL, p); in tcp_data_queue_ofo()
4810 rb_insert_color(&skb->rbnode, &tp->out_of_order_queue); in tcp_data_queue_ofo()
4832 parent = &tp->ooo_last_skb->rbnode; in tcp_data_queue_ofo()
4863 rb_replace_node(&skb1->rbnode, &skb->rbnode, in tcp_data_queue_ofo()
4881 rb_link_node(&skb->rbnode, parent, p); in tcp_data_queue_ofo()
4882 rb_insert_color(&skb->rbnode, &tp->out_of_order_queue); in tcp_data_queue_ofo()
4894 rb_erase(&skb1->rbnode, &tp->out_of_order_queue); in tcp_data_queue_ofo()
5119 rb_erase(&skb->rbnode, roo in tcp_collapse_one()
[all...]
/kernel/linux/linux-6.6/net/ipv4/
H A Dinet_fragment.c48 RB_CLEAR_NODE(&skb->rbnode); in fragcb_clear()
71 rb_link_node(&skb->rbnode, &q->last_run_head->rbnode, in fragrun_create()
72 &q->last_run_head->rbnode.rb_right); in fragrun_create()
74 rb_link_node(&skb->rbnode, NULL, &q->rb_fragments.rb_node); in fragrun_create()
75 rb_insert_color(&skb->rbnode, &q->rb_fragments); in fragrun_create()
271 struct sk_buff *skb = rb_entry(p, struct sk_buff, rbnode); in inet_frag_rbtree_purge()
274 rb_erase(&skb->rbnode, root); in inet_frag_rbtree_purge()
437 rb_link_node(&skb->rbnode, parent, rbn); in inet_frag_queue_insert()
438 rb_insert_color(&skb->rbnode, in inet_frag_queue_insert()
[all...]
H A Dtcp_input.c4775 rb_erase(&skb->rbnode, &tp->out_of_order_queue); in tcp_ofo_queue()
4855 rb_link_node(&skb->rbnode, NULL, p); in tcp_data_queue_ofo()
4856 rb_insert_color(&skb->rbnode, &tp->out_of_order_queue); in tcp_data_queue_ofo()
4878 parent = &tp->ooo_last_skb->rbnode; in tcp_data_queue_ofo()
4910 rb_replace_node(&skb1->rbnode, &skb->rbnode, in tcp_data_queue_ofo()
4929 rb_link_node(&skb->rbnode, parent, p); in tcp_data_queue_ofo()
4930 rb_insert_color(&skb->rbnode, &tp->out_of_order_queue); in tcp_data_queue_ofo()
4942 rb_erase(&skb1->rbnode, &tp->out_of_order_queue); in tcp_data_queue_ofo()
5180 rb_erase(&skb->rbnode, roo in tcp_collapse_one()
[all...]
/kernel/linux/linux-5.10/net/netfilter/
H A Dnf_conncount.c309 struct rb_node **rbnode, *parent; in insert_tree() local
319 rbnode = &(root->rb_node); in insert_tree()
320 while (*rbnode) { in insert_tree()
322 rbconn = rb_entry(*rbnode, struct nf_conncount_rb, node); in insert_tree()
324 parent = *rbnode; in insert_tree()
327 rbnode = &((*rbnode)->rb_left); in insert_tree()
329 rbnode = &((*rbnode)->rb_right); in insert_tree()
377 rb_link_node_rcu(&rbconn->node, parent, rbnode); in insert_tree()
[all...]
/kernel/linux/linux-6.6/net/netfilter/
H A Dnf_conncount.c320 struct rb_node **rbnode, *parent; in insert_tree() local
330 rbnode = &(root->rb_node); in insert_tree()
331 while (*rbnode) { in insert_tree()
333 rbconn = rb_entry(*rbnode, struct nf_conncount_rb, node); in insert_tree()
335 parent = *rbnode; in insert_tree()
338 rbnode = &((*rbnode)->rb_left); in insert_tree()
340 rbnode = &((*rbnode)->rb_right); in insert_tree()
388 rb_link_node_rcu(&rbconn->node, parent, rbnode); in insert_tree()
[all...]
/kernel/linux/linux-5.10/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()
213 /* The rbnode field in the skb re-uses these fields, now that in timesortedlist_drop()
214 * we are done with the rbnode, reset them. in timesortedlist_drop()
235 rb_erase_cached(&skb->rbnode, &q->head); in timesortedlist_remove()
237 /* The rbnode field in the skb re-uses these fields, now that in timesortedlist_remove()
238 * we are done with the rbnode, reset them. in timesortedlist_remove()
430 rb_erase_cached(&skb->rbnode, &q->head); in timesortedlist_clear()
H A Dsch_netem.c153 * As skb->rbnode uses same storage than skb->next, skb->prev and skb->tstamp,
369 rb_erase(&skb->rbnode, &q->t_root); in tfifo_reset()
402 rb_link_node(&nskb->rbnode, parent, p); in tfifo_enqueue()
403 rb_insert_color(&nskb->rbnode, &q->t_root); in tfifo_enqueue()
672 rb_erase(&skb->rbnode, &q->t_root); in netem_erase_head()
705 /* skb->dev shares skb->rbnode area, in netem_dequeue()
H A Dsch_fq.c386 rb_erase(&skb->rbnode, &flow->t_root); in fq_erase_head()
432 rb_link_node(&skb->rbnode, parent, p); in flow_queue_add()
433 rb_insert_color(&skb->rbnode, &flow->t_root); in flow_queue_add()
654 rb_erase(&skb->rbnode, &flow->t_root); in fq_flow_purge()
/kernel/linux/linux-6.6/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()
213 /* The rbnode field in the skb re-uses these fields, now that in timesortedlist_drop()
214 * we are done with the rbnode, reset them. in timesortedlist_drop()
235 rb_erase_cached(&skb->rbnode, &q->head); in timesortedlist_remove()
237 /* The rbnode field in the skb re-uses these fields, now that in timesortedlist_remove()
238 * we are done with the rbnode, reset them. in timesortedlist_remove()
427 rb_erase_cached(&skb->rbnode, &q->head); in timesortedlist_clear()
H A Dsch_fq.c386 rb_erase(&skb->rbnode, &flow->t_root); in fq_erase_head()
432 rb_link_node(&skb->rbnode, parent, p); in flow_queue_add()
433 rb_insert_color(&skb->rbnode, &flow->t_root); in flow_queue_add()
654 rb_erase(&skb->rbnode, &flow->t_root); in fq_flow_purge()
H A Dsch_netem.c159 * As skb->rbnode uses same storage than skb->next, skb->prev and skb->tstamp,
378 rb_erase(&skb->rbnode, &q->t_root); in tfifo_reset()
411 rb_link_node(&nskb->rbnode, parent, p); in tfifo_enqueue()
412 rb_insert_color(&nskb->rbnode, &q->t_root); in tfifo_enqueue()
681 rb_erase(&skb->rbnode, &q->t_root); in netem_erase_head()
714 /* skb->dev shares skb->rbnode area, in netem_dequeue()
/kernel/linux/linux-6.6/mm/
H A Dzswap.c184 * rbnode - links the entry into red-black tree for the appropriate swap type
202 struct rb_node rbnode; member
303 RB_CLEAR_NODE(&entry->rbnode); in zswap_entry_cache_alloc()
322 entry = rb_entry(node, struct zswap_entry, rbnode); in zswap_rb_search()
347 myentry = rb_entry(parent, struct zswap_entry, rbnode); in zswap_rb_insert()
358 rb_link_node(&entry->rbnode, parent, link); in zswap_rb_insert()
359 rb_insert_color(&entry->rbnode, root); in zswap_rb_insert()
365 if (!RB_EMPTY_NODE(&entry->rbnode)) { in zswap_rb_erase()
366 rb_erase(&entry->rbnode, root); in zswap_rb_erase()
367 RB_CLEAR_NODE(&entry->rbnode); in zswap_rb_erase()
[all...]
/kernel/linux/linux-5.10/mm/
H A Dzswap.c147 * rbnode - links the entry into red-black tree for the appropriate swap type
162 struct rb_node rbnode; member
272 RB_CLEAR_NODE(&entry->rbnode); in zswap_entry_cache_alloc()
290 entry = rb_entry(node, struct zswap_entry, rbnode); in zswap_rb_search()
313 myentry = rb_entry(parent, struct zswap_entry, rbnode); in zswap_rb_insert()
323 rb_link_node(&entry->rbnode, parent, link); in zswap_rb_insert()
324 rb_insert_color(&entry->rbnode, root); in zswap_rb_insert()
330 if (!RB_EMPTY_NODE(&entry->rbnode)) { in zswap_rb_erase()
331 rb_erase(&entry->rbnode, root); in zswap_rb_erase()
332 RB_CLEAR_NODE(&entry->rbnode); in zswap_rb_erase()
[all...]
/kernel/linux/common_modules/newip/third_party/linux-5.10/net/newip/
H A Dtcp_nip_input.c328 rb_erase(&skb->rbnode, &tp->out_of_order_queue); in tcp_nip_ofo_queue()
396 rb_link_node(&skb->rbnode, NULL, p); in tcp_nip_data_queue_ofo()
397 rb_insert_color(&skb->rbnode, &tp->out_of_order_queue); in tcp_nip_data_queue_ofo()
419 parent = &tp->ooo_last_skb->rbnode; in tcp_nip_data_queue_ofo()
483 rb_replace_node(&skb1->rbnode, &skb->rbnode, in tcp_nip_data_queue_ofo()
498 rb_link_node(&skb->rbnode, parent, p); in tcp_nip_data_queue_ofo()
499 rb_insert_color(&skb->rbnode, &tp->out_of_order_queue); in tcp_nip_data_queue_ofo()
512 rb_erase(&skb1->rbnode, &tp->out_of_order_queue); in tcp_nip_data_queue_ofo()
/kernel/linux/linux-5.10/fs/btrfs/
H A Dbackref.c242 ref = rb_entry(parent, struct prelim_ref, rbnode); in prelim_ref_insert()
278 rb_link_node(&newref->rbnode, parent, p); in prelim_ref_insert()
279 rb_insert_color_cached(&newref->rbnode, root, leftmost); in prelim_ref_insert()
291 &preftree->root.rb_root, rbnode) { in prelim_release()
405 ref = rb_entry(parent, struct prelim_ref, rbnode); in is_shared_data_backref()
710 ref = rb_entry(rnode, struct prelim_ref, rbnode); in resolve_indirect_refs()
717 rb_erase_cached(&ref->rbnode, &preftrees->indirect.root); in resolve_indirect_refs()
802 ref = rb_entry(node, struct prelim_ref, rbnode); in add_missing_keys()
1345 ref = rb_entry(node, struct prelim_ref, rbnode);
1346 node = rb_next(&ref->rbnode);
[all...]
H A Dbackref.h71 struct rb_node rbnode; member
/kernel/linux/linux-5.10/net/mptcp/
H A Dprotocol.c179 rb_link_node(&skb->rbnode, NULL, p); in mptcp_data_queue_ofo()
180 rb_insert_color(&skb->rbnode, &msk->out_of_order_queue); in mptcp_data_queue_ofo()
197 parent = &msk->ooo_last_skb->rbnode; in mptcp_data_queue_ofo()
228 rb_replace_node(&skb1->rbnode, &skb->rbnode, in mptcp_data_queue_ofo()
243 rb_link_node(&skb->rbnode, parent, p); in mptcp_data_queue_ofo()
244 rb_insert_color(&skb->rbnode, &msk->out_of_order_queue); in mptcp_data_queue_ofo()
251 rb_erase(&skb1->rbnode, &msk->out_of_order_queue); in mptcp_data_queue_ofo()
562 rb_erase(&skb->rbnode, &msk->out_of_order_queue); in mptcp_ofo_queue()
/kernel/linux/linux-6.6/fs/btrfs/
H A Dbackref.c295 ref = rb_entry(parent, struct prelim_ref, rbnode); in prelim_ref_insert()
331 rb_link_node(&newref->rbnode, parent, p); in prelim_ref_insert()
332 rb_insert_color_cached(&newref->rbnode, root, leftmost); in prelim_ref_insert()
344 &preftree->root.rb_root, rbnode) { in prelim_release()
458 ref = rb_entry(parent, struct prelim_ref, rbnode); in is_shared_data_backref()
760 ref = rb_entry(rnode, struct prelim_ref, rbnode); in resolve_indirect_refs()
767 rb_erase_cached(&ref->rbnode, &preftrees->indirect.root); in resolve_indirect_refs()
851 ref = rb_entry(node, struct prelim_ref, rbnode); in add_missing_keys()
1591 ref = rb_entry(node, struct prelim_ref, rbnode); in find_parent_nodes()
1592 node = rb_next(&ref->rbnode); in find_parent_nodes()
[all...]
H A Dbackref.h247 struct rb_node rbnode; member
/kernel/linux/linux-6.6/net/mptcp/
H A Dprotocol.c251 rb_link_node(&skb->rbnode, NULL, p); in mptcp_data_queue_ofo()
252 rb_insert_color(&skb->rbnode, &msk->out_of_order_queue); in mptcp_data_queue_ofo()
269 parent = &msk->ooo_last_skb->rbnode; in mptcp_data_queue_ofo()
300 rb_replace_node(&skb1->rbnode, &skb->rbnode, in mptcp_data_queue_ofo()
315 rb_link_node(&skb->rbnode, parent, p); in mptcp_data_queue_ofo()
316 rb_insert_color(&skb->rbnode, &msk->out_of_order_queue); in mptcp_data_queue_ofo()
323 rb_erase(&skb1->rbnode, &msk->out_of_order_queue); in mptcp_data_queue_ofo()
744 rb_erase(&skb->rbnode, &msk->out_of_order_queue); in __mptcp_ofo_queue()

Completed in 49 milliseconds

12