/linux-master/fs/xfs/ |
H A D | xfs_extent_busy.h | 21 struct rb_node rb_node; /* ag by-bno indexed search tree */ member in struct:xfs_extent_busy
|
/linux-master/fs/btrfs/ |
H A D | ulist.h | 33 struct rb_node rb_node; /* used to speed up search */ member in struct:ulist_node
|
H A D | extent_map.h | 44 struct rb_node rb_node; member in struct:extent_map 114 return !RB_EMPTY_NODE(&em->rb_node);
|
/linux-master/include/linux/ |
H A D | interval_tree_generic.h | 16 * ITRB: name of struct rb_node field within ITSTRUCT 41 struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \ 124 if (!root->rb_root.rb_node) \ 140 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \ 154 struct rb_node *rb = node->ITRB.rb_right, *prev; \
|
H A D | iova.h | 19 struct rb_node node; 31 struct rb_node *cached_node; /* Save last alloced node */ 32 struct rb_node *cached32_node; /* Save last 32-bit alloced node */
|
H A D | interval_tree.h | 8 struct rb_node rb;
|
H A D | timerqueue.h | 25 struct rb_node *leftmost = rb_first_cached(&head->rb_root);
|
/linux-master/tools/include/linux/ |
H A D | interval_tree_generic.h | 16 * ITRB: name of struct rb_node field within ITSTRUCT 41 struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \ 124 if (!root->rb_root.rb_node) \ 140 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \ 154 struct rb_node *rb = node->ITRB.rb_right, *prev; \
|
/linux-master/tools/perf/ui/browsers/ |
H A D | map.c | 27 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); 45 return ((void *)browser) - sizeof(struct rb_node) - sizeof(u32); 67 browser->b.top = &sym->rb_node; 116 struct rb_node *nd; 121 struct symbol *pos = rb_entry(nd, struct symbol, rb_node);
|
/linux-master/tools/perf/util/ |
H A D | stream.c | 103 struct rb_node *rb_node = rb_first(root); local 106 while (rb_node) { 107 cnode = rb_entry(rb_node, struct callchain_node, rb_node); 109 rb_node = rb_next(rb_node); 115 struct rb_node *next = rb_first_cached(&hists->entries); 120 he = rb_entry(next, struct hist_entry, rb_node); 122 next = rb_next(&he->rb_node); [all...] |
H A D | srcline.c | 914 struct rb_node rb_node; member in struct:srcline_node 919 struct rb_node **p = &tree->rb_root.rb_node; 920 struct rb_node *parent = NULL; 935 i = rb_entry(parent, struct srcline_node, rb_node); 943 rb_link_node(&node->rb_node, parent, p); 944 rb_insert_color_cached(&node->rb_node, tree, leftmost); 949 struct rb_node *n = tree->rb_root.rb_node; [all...] |
/linux-master/mm/ |
H A D | shmem_quota.c | 49 struct rb_node node; 100 struct rb_node *node; 119 struct rb_node *node; 129 node = ((struct rb_root *)info->dqi_priv)->rb_node; 169 struct rb_node **n; 171 struct rb_node *parent = NULL, *new_node = NULL; 180 n = &((struct rb_root *)info->dqi_priv)->rb_node; 270 struct rb_node *node; 281 node = ((struct rb_root *)info->dqi_priv)->rb_node;
|
/linux-master/net/ceph/ |
H A D | string_table.c | 14 struct rb_node **p, *parent; 19 p = &string_tree.rb_node; 52 p = &string_tree.rb_node;
|
/linux-master/fs/proc/ |
H A D | nommu.c | 74 struct rb_node *p = _p; 81 struct rb_node *p; 100 return rb_next((struct rb_node *) v);
|
/linux-master/fs/f2fs/ |
H A D | extent_cache.c | 162 struct rb_node *node = root->rb_root.rb_node; 172 en = rb_entry(node, struct extent_node, rb_node); 198 struct rb_node ***insert_p, 199 struct rb_node **insert_parent, 202 struct rb_node **pnode = &root->rb_root.rb_node; 203 struct rb_node *parent = NULL, *tmp_node; 221 en = rb_entry(*pnode, struct extent_node, rb_node); 236 en = rb_entry(parent, struct extent_node, rb_node); [all...] |
/linux-master/drivers/infiniband/hw/usnic/ |
H A D | usnic_uiom_interval_tree.h | 40 struct rb_node rb;
|
/linux-master/arch/x86/mm/pat/ |
H A D | memtype.h | 15 struct rb_node rb;
|
/linux-master/fs/ocfs2/cluster/ |
H A D | nodemanager.h | 33 struct rb_node nd_ip_node;
|
/linux-master/fs/ocfs2/ |
H A D | reservations.h | 20 struct rb_node r_node;
|
/linux-master/drivers/block/drbd/ |
H A D | drbd_interval.h | 9 struct rb_node rb;
|
/linux-master/block/ |
H A D | elevator.c | 229 struct rb_node **p = &root->rb_node; 230 struct rb_node *parent = NULL; 235 __rq = rb_entry(parent, struct request, rb_node); 243 rb_link_node(&rq->rb_node, parent, p); 244 rb_insert_color(&rq->rb_node, root); 250 BUG_ON(RB_EMPTY_NODE(&rq->rb_node)); 251 rb_erase(&rq->rb_node, root); 252 RB_CLEAR_NODE(&rq->rb_node); 258 struct rb_node * [all...] |
/linux-master/drivers/infiniband/hw/hfi1/ |
H A D | mmu_rb.h | 16 struct rb_node node;
|
/linux-master/net/rxrpc/ |
H A D | conn_service.c | 27 struct rb_node *p; 41 p = rcu_dereference_raw(peer->service_conns.rb_node); 69 struct rb_node **pp, *parent; 73 pp = &peer->service_conns.rb_node;
|
/linux-master/drivers/dma-buf/ |
H A D | sync_debug.h | 63 struct rb_node node;
|
/linux-master/drivers/gpu/drm/xe/ |
H A D | xe_range_fence.h | 25 struct rb_node rb;
|