| /openbmc/linux/drivers/base/regmap/ |
| H A D | regcache-rbtree.c | 41 struct regcache_rbtree_node *rbnode, in regcache_rbtree_get_base_top_reg() argument
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() argument
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() argument
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
70 rbnode = rbtree_ctx->cached_rbnode; in regcache_rbtree_lookup()
[all …]
|
| /openbmc/linux/drivers/infiniband/hw/hfi1/ |
| H A D | mmu_rb.c | 80 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()
241 if (kref_read(&rbnode->refcount) > 1) in hfi1_mmu_rb_evict()
244 if (handler->ops->evict(handler->ops_arg, rbnode, evict_arg, in hfi1_mmu_rb_evict()
[all …]
|
| /openbmc/linux/net/ipv4/ |
| H A D | inet_fragment.c | 51 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()
77 rb_link_node(&skb->rbnode, NULL, &q->rb_fragments.rb_node); in fragrun_create()
78 rb_insert_color(&skb->rbnode, &q->rb_fragments); in fragrun_create()
274 struct sk_buff *skb = rb_entry(p, struct sk_buff, rbnode); in inet_frag_rbtree_purge()
277 rb_erase(&skb->rbnode, root); in inet_frag_rbtree_purge()
440 rb_link_node(&skb->rbnode, parent, rbn); in inet_frag_queue_insert()
441 rb_insert_color(&skb->rbnode, &q->rb_fragments); in inet_frag_queue_insert()
477 if (RB_EMPTY_NODE(&skb->rbnode)) in inet_frag_reasm_prepare()
[all …]
|
| H A D | tcp_input.c | 4865 rb_erase(&skb->rbnode, &tp->out_of_order_queue); in tcp_ofo_queue()
4945 rb_link_node(&skb->rbnode, NULL, p); in tcp_data_queue_ofo()
4946 rb_insert_color(&skb->rbnode, &tp->out_of_order_queue); in tcp_data_queue_ofo()
4968 parent = &tp->ooo_last_skb->rbnode; in tcp_data_queue_ofo()
5000 rb_replace_node(&skb1->rbnode, &skb->rbnode, in tcp_data_queue_ofo()
5019 rb_link_node(&skb->rbnode, parent, p); in tcp_data_queue_ofo()
5020 rb_insert_color(&skb->rbnode, &tp->out_of_order_queue); in tcp_data_queue_ofo()
5032 rb_erase(&skb1->rbnode, &tp->out_of_order_queue); in tcp_data_queue_ofo()
5270 rb_erase(&skb->rbnode, root); in tcp_collapse_one()
5293 rb_link_node(&skb->rbnode, parent, p); in tcp_rbtree_insert()
[all …]
|
| /openbmc/linux/net/netfilter/ |
| H A D | nf_conncount.c | 320 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()
387 rb_link_node_rcu(&rbconn->node, parent, rbnode); in insert_tree()
|
| /openbmc/linux/net/sched/ |
| H A D | sch_etf.c | 188 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 D | sch_fq.c | 386 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 D | sch_netem.c | 380 rb_erase(&skb->rbnode, &q->t_root); in tfifo_reset()
414 rb_link_node(&nskb->rbnode, parent, p); in tfifo_enqueue()
415 rb_insert_color(&nskb->rbnode, &q->t_root); in tfifo_enqueue()
696 rb_erase(&skb->rbnode, &q->t_root); in netem_erase_head()
|
| /openbmc/linux/mm/ |
| H A D | zswap.c | 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()
423 WARN_ON_ONCE(!RB_EMPTY_NODE(&entry->rbnode)); in zswap_entry_put()
[all …]
|
| /openbmc/linux/fs/btrfs/ |
| H A D | backref.c | 295 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()
|
| H A D | backref.h | 247 struct rb_node rbnode; member
|
| /openbmc/linux/net/mptcp/ |
| H A D | protocol.c | 238 rb_link_node(&skb->rbnode, NULL, p); in mptcp_data_queue_ofo()
239 rb_insert_color(&skb->rbnode, &msk->out_of_order_queue); in mptcp_data_queue_ofo()
256 parent = &msk->ooo_last_skb->rbnode; in mptcp_data_queue_ofo()
287 rb_replace_node(&skb1->rbnode, &skb->rbnode, in mptcp_data_queue_ofo()
302 rb_link_node(&skb->rbnode, parent, p); in mptcp_data_queue_ofo()
303 rb_insert_color(&skb->rbnode, &msk->out_of_order_queue); in mptcp_data_queue_ofo()
310 rb_erase(&skb1->rbnode, &msk->out_of_order_queue); in mptcp_data_queue_ofo()
751 rb_erase(&skb->rbnode, &msk->out_of_order_queue); in __mptcp_ofo_queue()
|
| /openbmc/linux/include/linux/ |
| H A D | skbuff.h | 856 struct rb_node rbnode; /* used in netem, ip4 defrag, and tcp stack */ member
3899 #define rb_to_skb(rb) rb_entry_safe(rb, struct sk_buff, rbnode)
3902 #define skb_rb_next(skb) rb_to_skb(rb_next(&(skb)->rbnode))
3903 #define skb_rb_prev(skb) rb_to_skb(rb_prev(&(skb)->rbnode))
|
| /openbmc/linux/Documentation/networking/ |
| H A D | rds.rst | 318 wraps the raw congestion bitmap, contains rbnode, waitq, etc.
|
| /openbmc/linux/include/net/ |
| H A D | tcp.h | 1997 rb_erase(&skb->rbnode, &sk->tcp_rtx_queue); in tcp_rtx_queue_unlink()
|
| /openbmc/linux/net/core/ |
| H A D | skbuff.c | 3755 struct sk_buff *skb = rb_entry(p, struct sk_buff, rbnode); in skb_rbtree_purge()
3758 rb_erase(&skb->rbnode, root); in skb_rbtree_purge()
|