/linux-master/drivers/base/regmap/ |
H A D | regcache-rbtree.c | 41 struct regcache_rbtree_node *rbnode, 44 *base = rbnode->base_reg; 45 *top = rbnode->base_reg + ((rbnode->blklen - 1) * map->reg_stride); 49 struct regcache_rbtree_node *rbnode, unsigned int idx) 51 return regcache_get_val(map, rbnode->block, idx); 55 struct regcache_rbtree_node *rbnode, 58 set_bit(idx, rbnode->cache_present); 59 regcache_set_val(map, rbnode->block, idx, val); 67 struct regcache_rbtree_node *rbnode; local 39 regcache_rbtree_get_base_top_reg( struct regmap *map, struct regcache_rbtree_node *rbnode, unsigned int *base, unsigned int *top) argument 48 regcache_rbtree_get_register(struct regmap *map, struct regcache_rbtree_node *rbnode, unsigned int idx) argument 54 regcache_rbtree_set_register(struct regmap *map, struct regcache_rbtree_node *rbnode, unsigned int idx, unsigned int val) argument 96 regcache_rbtree_insert(struct regmap *map, struct rb_root *root, struct regcache_rbtree_node *rbnode) argument 245 struct regcache_rbtree_node *rbnode; 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) argument 319 struct regcache_rbtree_node *rbnode; local 372 struct regcache_rbtree_node *rbnode, *rbnode_tmp; local 470 struct regcache_rbtree_node *rbnode; local 514 struct regcache_rbtree_node *rbnode; local [all...] |
/linux-master/drivers/infiniband/hw/hfi1/ |
H A D | mmu_rb.c | 80 struct mmu_rb_node *rbnode; local 101 rbnode = rb_entry(node, struct mmu_rb_node, node); 104 list_move(&rbnode->list, &del_list); 109 rbnode = list_first_entry(&del_list, struct mmu_rb_node, list); 110 list_del(&rbnode->list); 111 kref_put(&rbnode->refcount, release_immediate); 228 struct mmu_rb_node *rbnode, *ptr; local 239 list_for_each_entry_safe(rbnode, ptr, &handler->lru_list, list) { 240 /* refcount == 1 implies mmu_rb_handler has only rbnode ref */ 241 if (kref_read(&rbnode [all...] |
/linux-master/net/ipv4/ |
H A D | inet_fragment.c | 51 RB_CLEAR_NODE(&skb->rbnode); 74 rb_link_node(&skb->rbnode, &q->last_run_head->rbnode, 75 &q->last_run_head->rbnode.rb_right); 77 rb_link_node(&skb->rbnode, NULL, &q->rb_fragments.rb_node); 78 rb_insert_color(&skb->rbnode, &q->rb_fragments); 274 struct sk_buff *skb = rb_entry(p, struct sk_buff, rbnode); 277 rb_erase(&skb->rbnode, root); 440 rb_link_node(&skb->rbnode, parent, rbn); 441 rb_insert_color(&skb->rbnode, [all...] |
H A D | tcp_input.c | 4878 rb_erase(&skb->rbnode, &tp->out_of_order_queue); 4959 rb_link_node(&skb->rbnode, NULL, p); 4960 rb_insert_color(&skb->rbnode, &tp->out_of_order_queue); 4982 parent = &tp->ooo_last_skb->rbnode; 5014 rb_replace_node(&skb1->rbnode, &skb->rbnode, 5033 rb_link_node(&skb->rbnode, parent, p); 5034 rb_insert_color(&skb->rbnode, &tp->out_of_order_queue); 5046 rb_erase(&skb1->rbnode, &tp->out_of_order_queue); 5284 rb_erase(&skb->rbnode, roo [all...] |
/linux-master/net/netfilter/ |
H A D | nf_conncount.c | 320 struct rb_node **rbnode, *parent; local 330 rbnode = &(root->rb_node); 331 while (*rbnode) { 333 rbconn = rb_entry(*rbnode, struct nf_conncount_rb, node); 335 parent = *rbnode; 338 rbnode = &((*rbnode)->rb_left); 340 rbnode = &((*rbnode)->rb_right); 388 rb_link_node_rcu(&rbconn->node, parent, rbnode); [all...] |
/linux-master/net/sched/ |
H A D | sch_etf.c | 188 rb_link_node(&nskb->rbnode, parent, p); 189 rb_insert_color_cached(&nskb->rbnode, &q->head, leftmost); 211 rb_erase_cached(&skb->rbnode, &q->head); 213 /* The rbnode field in the skb re-uses these fields, now that 214 * we are done with the rbnode, reset them. 235 rb_erase_cached(&skb->rbnode, &q->head); 237 /* The rbnode field in the skb re-uses these fields, now that 238 * we are done with the rbnode, reset them. 427 rb_erase_cached(&skb->rbnode, &q->head);
|
H A D | sch_fq.c | 475 rb_erase(&skb->rbnode, &flow->t_root); 520 rb_link_node(&skb->rbnode, parent, p); 521 rb_insert_color(&skb->rbnode, &flow->t_root); 770 rb_erase(&skb->rbnode, &flow->t_root);
|
H A D | sch_netem.c | 159 * As skb->rbnode uses same storage than skb->next, skb->prev and skb->tstamp, 378 rb_erase(&skb->rbnode, &q->t_root); 411 rb_link_node(&nskb->rbnode, parent, p); 412 rb_insert_color(&nskb->rbnode, &q->t_root); 681 rb_erase(&skb->rbnode, &q->t_root); 714 /* skb->dev shares skb->rbnode area,
|
/linux-master/mm/ |
H A D | zswap.c | 201 * rbnode - links the entry into red-black tree for the appropriate swap type 213 struct rb_node rbnode; member in struct:zswap_entry 819 entry = rb_entry(node, struct zswap_entry, rbnode); 844 myentry = rb_entry(parent, struct zswap_entry, rbnode); 855 rb_link_node(&entry->rbnode, parent, link); 856 rb_insert_color(&entry->rbnode, root); 862 rb_erase(&entry->rbnode, root); 863 RB_CLEAR_NODE(&entry->rbnode); 877 RB_CLEAR_NODE(&entry->rbnode);
|
/linux-master/fs/btrfs/ |
H A D | backref.h | 259 struct rb_node rbnode; member in struct:prelim_ref
|
H A D | backref.c | 292 ref = rb_entry(parent, struct prelim_ref, rbnode); 328 rb_link_node(&newref->rbnode, parent, p); 329 rb_insert_color_cached(&newref->rbnode, root, leftmost); 341 &preftree->root.rb_root, rbnode) { 455 ref = rb_entry(parent, struct prelim_ref, rbnode); 757 ref = rb_entry(rnode, struct prelim_ref, rbnode); 764 rb_erase_cached(&ref->rbnode, &preftrees->indirect.root); 848 ref = rb_entry(node, struct prelim_ref, rbnode); 1591 ref = rb_entry(node, struct prelim_ref, rbnode); 1592 node = rb_next(&ref->rbnode); [all...] |
/linux-master/net/mptcp/ |
H A D | protocol.c | 234 rb_link_node(&skb->rbnode, NULL, p); 235 rb_insert_color(&skb->rbnode, &msk->out_of_order_queue); 252 parent = &msk->ooo_last_skb->rbnode; 283 rb_replace_node(&skb1->rbnode, &skb->rbnode, 298 rb_link_node(&skb->rbnode, parent, p); 299 rb_insert_color(&skb->rbnode, &msk->out_of_order_queue); 306 rb_erase(&skb1->rbnode, &msk->out_of_order_queue); 729 rb_erase(&skb->rbnode, &msk->out_of_order_queue);
|
/linux-master/include/linux/ |
H A D | skbuff.h | 752 * @rbnode: RB tree node, alternative to next/prev for netem/tcp 871 struct rb_node rbnode; /* used in netem, ip4 defrag, and tcp stack */ member in union:sk_buff::__anon80 3961 #define rb_to_skb(rb) rb_entry_safe(rb, struct sk_buff, rbnode) 3964 #define skb_rb_next(skb) rb_to_skb(rb_next(&(skb)->rbnode)) 3965 #define skb_rb_prev(skb) rb_to_skb(rb_prev(&(skb)->rbnode))
|
/linux-master/include/net/ |
H A D | tcp.h | 2091 rb_erase(&skb->rbnode, &sk->tcp_rtx_queue);
|
/linux-master/net/core/ |
H A D | skbuff.c | 3906 struct sk_buff *skb = rb_entry(p, struct sk_buff, rbnode); 3909 rb_erase(&skb->rbnode, root);
|