| /dports/multimedia/v4l-utils/linux-5.13-rc2/drivers/base/regmap/ |
| H A D | regcache-rbtree.c | 45 *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()
324 rbnode = kzalloc(sizeof(*rbnode), GFP_KERNEL); in regcache_rbtree_node_alloc()
325 if (!rbnode) in regcache_rbtree_node_alloc()
360 return rbnode; in regcache_rbtree_node_alloc()
365 kfree(rbnode); in regcache_rbtree_node_alloc()
384 if (rbnode) { in regcache_rbtree_write()
[all …]
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/drivers/base/regmap/ |
| H A D | regcache-rbtree.c | 45 *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()
324 rbnode = kzalloc(sizeof(*rbnode), GFP_KERNEL); in regcache_rbtree_node_alloc()
325 if (!rbnode) in regcache_rbtree_node_alloc()
360 return rbnode; in regcache_rbtree_node_alloc()
365 kfree(rbnode); in regcache_rbtree_node_alloc()
384 if (rbnode) { in regcache_rbtree_write()
[all …]
|
| /dports/multimedia/libv4l/linux-5.13-rc2/drivers/base/regmap/ |
| H A D | regcache-rbtree.c | 45 *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()
324 rbnode = kzalloc(sizeof(*rbnode), GFP_KERNEL); in regcache_rbtree_node_alloc()
325 if (!rbnode) in regcache_rbtree_node_alloc()
360 return rbnode; in regcache_rbtree_node_alloc()
365 kfree(rbnode); in regcache_rbtree_node_alloc()
384 if (rbnode) { in regcache_rbtree_write()
[all …]
|
| /dports/security/silktools/silk-3.19.1/src/libsilk/redblack/ |
| H A D | redblack.c | 53 struct rbnode { struct
69 #define rb_alloc() ((struct rbnode *) malloc(sizeof(struct rbnode)))
76 static void rb_destroy(struct rbnode *, const struct rbnode *);
79 struct rbnode **,
80 struct rbnode *,
84 struct rbnode **,
85 struct rbnode *,
89 struct rbnode **,
90 struct rbnode *,
94 struct rbnode **,
[all …]
|
| H A D | redblack.h | 140 const struct rbnode *rootp;
141 const struct rbnode *nextp;
142 const struct rbnode *nullp;
156 struct rbnode *rb_root;
158 struct rbnode *rb_null;
|
| /dports/databases/twemproxy/twemproxy-0.5.0/src/ |
| H A D | nc_rbtree.h | 27 struct rbnode { struct
28 struct rbnode *left; /* left link */ argument
29 struct rbnode *right; /* right link */ argument
30 struct rbnode *parent; /* parent link */ argument
37 struct rbnode *root; /* root node */ argument
38 struct rbnode *sentinel; /* nil node */
41 void rbtree_node_init(struct rbnode *node);
42 void rbtree_init(struct rbtree *tree, struct rbnode *node);
43 struct rbnode *rbtree_min(const struct rbtree *tree);
44 void rbtree_insert(struct rbtree *tree, struct rbnode *node);
[all …]
|
| H A D | nc_rbtree.c | 21 rbtree_node_init(struct rbnode *node) in rbtree_node_init()
40 static struct rbnode *
41 rbtree_node_min(struct rbnode *node, const struct rbnode *sentinel) in rbtree_node_min()
52 struct rbnode *
55 struct rbnode *node = tree->root; in rbtree_min()
68 rbtree_left_rotate(struct rbnode **root, struct rbnode *sentinel, in rbtree_left_rotate()
71 struct rbnode *temp; in rbtree_left_rotate()
95 rbtree_right_rotate(struct rbnode **root, struct rbnode *sentinel, in rbtree_right_rotate()
98 struct rbnode *temp; in rbtree_right_rotate()
126 struct rbnode *temp, **p; in rbtree_insert()
[all …]
|
| /dports/security/sudo/sudo-1.9.8p2/plugins/sudoers/ |
| H A D | redblack.h | 34 struct rbnode { struct
35 struct rbnode *left, *right, *parent; argument
42 struct rbnode root; argument
43 struct rbnode nil;
52 void *rbdelete(struct rbtree *, struct rbnode *);
53 int rbapply_node(struct rbtree *, struct rbnode *,
55 struct rbnode *rbfind(struct rbtree *, void *);
56 int rbinsert(struct rbtree *, void *, struct rbnode **);
|
| H A D | redblack.c | 125 struct rbnode *child; in rotate_left()
151 struct rbnode *child; in rotate_right()
179 struct rbnode *node = rbfirst(tree); in rbinsert()
180 struct rbnode *parent = rbroot(tree); in rbinsert()
234 struct rbnode *uncle; in rbinsert()
277 struct rbnode *
280 struct rbnode *node = rbfirst(tree); in rbfind()
325 static struct rbnode *
328 struct rbnode *succ; in rbsuccessor()
379 struct rbnode *x, *y; in rbdelete()
[all …]
|
| /dports/multimedia/libv4l/linux-5.13-rc2/net/ipv4/ |
| H A D | inet_fragment.c | 48 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()
272 rb_erase(&skb->rbnode, root); in inet_frag_rbtree_purge()
451 if (RB_EMPTY_NODE(&skb->rbnode)) in inet_frag_reasm_prepare()
454 rb_replace_node(&skb->rbnode, &fp->rbnode, in inet_frag_reasm_prepare()
460 rb_replace_node(&head->rbnode, &skb->rbnode, in inet_frag_reasm_prepare()
520 rbn = rb_next(&head->rbnode); in inet_frag_reasm_finish()
545 memset(&fp->rbnode, 0, sizeof(fp->rbnode)); in inet_frag_reasm_finish()
585 rb_replace_node(&head->rbnode, &skb->rbnode, in inet_frag_pull_head()
[all …]
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/net/ipv4/ |
| H A D | inet_fragment.c | 48 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()
272 rb_erase(&skb->rbnode, root); in inet_frag_rbtree_purge()
451 if (RB_EMPTY_NODE(&skb->rbnode)) in inet_frag_reasm_prepare()
454 rb_replace_node(&skb->rbnode, &fp->rbnode, in inet_frag_reasm_prepare()
460 rb_replace_node(&head->rbnode, &skb->rbnode, in inet_frag_reasm_prepare()
520 rbn = rb_next(&head->rbnode); in inet_frag_reasm_finish()
545 memset(&fp->rbnode, 0, sizeof(fp->rbnode)); in inet_frag_reasm_finish()
585 rb_replace_node(&head->rbnode, &skb->rbnode, in inet_frag_pull_head()
[all …]
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/net/ipv4/ |
| H A D | inet_fragment.c | 48 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()
272 rb_erase(&skb->rbnode, root); in inet_frag_rbtree_purge()
451 if (RB_EMPTY_NODE(&skb->rbnode)) in inet_frag_reasm_prepare()
454 rb_replace_node(&skb->rbnode, &fp->rbnode, in inet_frag_reasm_prepare()
460 rb_replace_node(&head->rbnode, &skb->rbnode, in inet_frag_reasm_prepare()
520 rbn = rb_next(&head->rbnode); in inet_frag_reasm_finish()
545 memset(&fp->rbnode, 0, sizeof(fp->rbnode)); in inet_frag_reasm_finish()
585 rb_replace_node(&head->rbnode, &skb->rbnode, in inet_frag_pull_head()
[all …]
|
| /dports/devel/radare2/radare2-5.1.1/libr/util/ |
| H A D | intervaltree.c | 6 #define unwrap(rbnode) container_of (rbnode, RIntervalNode, node) argument
71 RBNode *rbnode = &intervalnode->node; in cmp_exact_node() local
72 if (rbnode->child[1]) { in cmp_exact_node()
74 for (rbnode = rbnode->child[1]; rbnode; rbnode = rbnode->child[0]) { in cmp_exact_node()
75 path_cache->path[path_cache->len++] = rbnode; in cmp_exact_node()
80 rbnode = path_cache->path[--path_cache->len]; in cmp_exact_node()
81 } while (path_cache->len && path_cache->path[path_cache->len - 1]->child[1] == rbnode); in cmp_exact_node()
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/drivers/infiniband/hw/hfi1/ |
| H A D | mmu_rb.c | 119 struct mmu_rb_node *rbnode; in hfi1_mmu_rb_unregister() local
137 rbnode = rb_entry(node, struct mmu_rb_node, node); in hfi1_mmu_rb_unregister()
140 list_move(&rbnode->list, &del_list); in hfi1_mmu_rb_unregister()
233 struct mmu_rb_node *rbnode, *ptr; in hfi1_mmu_rb_evict() local
244 list_for_each_entry_safe_reverse(rbnode, ptr, &handler->lru_list, in hfi1_mmu_rb_evict()
246 if (handler->ops->evict(handler->ops_arg, rbnode, evict_arg, in hfi1_mmu_rb_evict()
248 __mmu_int_rb_remove(rbnode, &handler->root); in hfi1_mmu_rb_evict()
250 list_move(&rbnode->list, &del_list); in hfi1_mmu_rb_evict()
258 rbnode = list_first_entry(&del_list, struct mmu_rb_node, list); in hfi1_mmu_rb_evict()
259 list_del(&rbnode->list); in hfi1_mmu_rb_evict()
[all …]
|
| /dports/multimedia/libv4l/linux-5.13-rc2/drivers/infiniband/hw/hfi1/ |
| H A D | mmu_rb.c | 119 struct mmu_rb_node *rbnode; in hfi1_mmu_rb_unregister() local
137 rbnode = rb_entry(node, struct mmu_rb_node, node); in hfi1_mmu_rb_unregister()
140 list_move(&rbnode->list, &del_list); in hfi1_mmu_rb_unregister()
233 struct mmu_rb_node *rbnode, *ptr; in hfi1_mmu_rb_evict() local
244 list_for_each_entry_safe_reverse(rbnode, ptr, &handler->lru_list, in hfi1_mmu_rb_evict()
246 if (handler->ops->evict(handler->ops_arg, rbnode, evict_arg, in hfi1_mmu_rb_evict()
248 __mmu_int_rb_remove(rbnode, &handler->root); in hfi1_mmu_rb_evict()
250 list_move(&rbnode->list, &del_list); in hfi1_mmu_rb_evict()
258 rbnode = list_first_entry(&del_list, struct mmu_rb_node, list); in hfi1_mmu_rb_evict()
259 list_del(&rbnode->list); in hfi1_mmu_rb_evict()
[all …]
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/drivers/infiniband/hw/hfi1/ |
| H A D | mmu_rb.c | 119 struct mmu_rb_node *rbnode; in hfi1_mmu_rb_unregister() local
137 rbnode = rb_entry(node, struct mmu_rb_node, node); in hfi1_mmu_rb_unregister()
140 list_move(&rbnode->list, &del_list); in hfi1_mmu_rb_unregister()
233 struct mmu_rb_node *rbnode, *ptr; in hfi1_mmu_rb_evict() local
244 list_for_each_entry_safe_reverse(rbnode, ptr, &handler->lru_list, in hfi1_mmu_rb_evict()
246 if (handler->ops->evict(handler->ops_arg, rbnode, evict_arg, in hfi1_mmu_rb_evict()
248 __mmu_int_rb_remove(rbnode, &handler->root); in hfi1_mmu_rb_evict()
250 list_move(&rbnode->list, &del_list); in hfi1_mmu_rb_evict()
258 rbnode = list_first_entry(&del_list, struct mmu_rb_node, list); in hfi1_mmu_rb_evict()
259 list_del(&rbnode->list); in hfi1_mmu_rb_evict()
[all …]
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/net/netfilter/ |
| H A D | nf_conncount.c | 309 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()
|
| /dports/multimedia/libv4l/linux-5.13-rc2/net/netfilter/ |
| H A D | nf_conncount.c | 309 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()
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/net/netfilter/ |
| H A D | nf_conncount.c | 309 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()
|
| /dports/dns/nsd/nsd-4.3.9/ |
| H A D | rbtree.h | 20 typedef struct rbnode rbnode_type;
21 struct rbnode { struct
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/mm/ |
| H A D | zswap.c | 172 struct rb_node rbnode; member
282 RB_CLEAR_NODE(&entry->rbnode); in zswap_entry_cache_alloc()
300 entry = rb_entry(node, struct zswap_entry, rbnode); in zswap_rb_search()
323 myentry = rb_entry(parent, struct zswap_entry, rbnode); in zswap_rb_insert()
333 rb_link_node(&entry->rbnode, parent, link); in zswap_rb_insert()
334 rb_insert_color(&entry->rbnode, root); in zswap_rb_insert()
340 if (!RB_EMPTY_NODE(&entry->rbnode)) { in zswap_rb_erase()
341 rb_erase(&entry->rbnode, root); in zswap_rb_erase()
342 RB_CLEAR_NODE(&entry->rbnode); in zswap_rb_erase()
1361 rbtree_postorder_for_each_entry_safe(entry, n, &tree->rbroot, rbnode) in zswap_frontswap_invalidate_area()
|
| /dports/multimedia/libv4l/linux-5.13-rc2/mm/ |
| H A D | zswap.c | 172 struct rb_node rbnode; member
282 RB_CLEAR_NODE(&entry->rbnode); in zswap_entry_cache_alloc()
300 entry = rb_entry(node, struct zswap_entry, rbnode); in zswap_rb_search()
323 myentry = rb_entry(parent, struct zswap_entry, rbnode); in zswap_rb_insert()
333 rb_link_node(&entry->rbnode, parent, link); in zswap_rb_insert()
334 rb_insert_color(&entry->rbnode, root); in zswap_rb_insert()
340 if (!RB_EMPTY_NODE(&entry->rbnode)) { in zswap_rb_erase()
341 rb_erase(&entry->rbnode, root); in zswap_rb_erase()
342 RB_CLEAR_NODE(&entry->rbnode); in zswap_rb_erase()
1361 rbtree_postorder_for_each_entry_safe(entry, n, &tree->rbroot, rbnode) in zswap_frontswap_invalidate_area()
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/mm/ |
| H A D | zswap.c | 172 struct rb_node rbnode; member
282 RB_CLEAR_NODE(&entry->rbnode); in zswap_entry_cache_alloc()
300 entry = rb_entry(node, struct zswap_entry, rbnode); in zswap_rb_search()
323 myentry = rb_entry(parent, struct zswap_entry, rbnode); in zswap_rb_insert()
333 rb_link_node(&entry->rbnode, parent, link); in zswap_rb_insert()
334 rb_insert_color(&entry->rbnode, root); in zswap_rb_insert()
340 if (!RB_EMPTY_NODE(&entry->rbnode)) { in zswap_rb_erase()
341 rb_erase(&entry->rbnode, root); in zswap_rb_erase()
342 RB_CLEAR_NODE(&entry->rbnode); in zswap_rb_erase()
1361 rbtree_postorder_for_each_entry_safe(entry, n, &tree->rbroot, rbnode) in zswap_frontswap_invalidate_area()
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/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()
430 rb_erase_cached(&skb->rbnode, &q->head); in timesortedlist_clear()
|
| /dports/multimedia/libv4l/linux-5.13-rc2/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()
430 rb_erase_cached(&skb->rbnode, &q->head); in timesortedlist_clear()
|