/linux-master/fs/btrfs/ |
H A D | ulist.c | 125 struct rb_node *n = ulist->root.rb_node; 129 u = rb_entry(n, struct ulist_node, rb_node); 142 rb_erase(&node->rb_node, &ulist->root); 151 struct rb_node **p = &ulist->root.rb_node; 152 struct rb_node *parent = NULL; 157 cur = rb_entry(parent, struct ulist_node, rb_node); 166 rb_link_node(&ins->rb_node, parent, p); 167 rb_insert_color(&ins->rb_node, [all...] |
H A D | ordered-data.c | 35 static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset, 36 struct rb_node *node) 38 struct rb_node **p = &root->rb_node; 39 struct rb_node *parent = NULL; 44 entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node); 63 static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset, 64 struct rb_node **prev_ret) 66 struct rb_node *n = root->rb_node; [all...] |
H A D | extent_map.c | 50 RB_CLEAR_NODE(&em->rb_node); 81 struct rb_node **p = &root->rb_root.rb_node; 82 struct rb_node *parent = NULL; 84 struct rb_node *orig_parent = NULL; 90 entry = rb_entry(parent, struct extent_map, rb_node); 105 entry = rb_entry(parent, struct extent_map, rb_node); 112 entry = rb_entry(parent, struct extent_map, rb_node); 115 entry = rb_entry(parent, struct extent_map, rb_node); 121 rb_link_node(&em->rb_node, orig_paren 409 struct rb_node *rb_node; local [all...] |
H A D | extent-io-tree.c | 14 return !RB_EMPTY_NODE(&state->rb_node); 140 rbtree_postorder_for_each_entry_safe(state, tmp, &root, rb_node) { 142 RB_CLEAR_NODE(&state->rb_node); 174 RB_CLEAR_NODE(&state->rb_node); 222 struct rb_node *next = rb_next(&state->rb_node); 225 return rb_entry(next, struct extent_state, rb_node); 232 struct rb_node *next = rb_prev(&state->rb_node); 235 return rb_entry(next, struct extent_state, rb_node); [all...] |
/linux-master/tools/perf/util/ |
H A D | block-range.c | 15 struct rb_node *rb; 31 struct rb_node **p = &block_ranges.root.rb_node; 32 struct rb_node *parent = NULL; 50 static inline void rb_link_left_of_node(struct rb_node *left, struct rb_node *node) 52 struct rb_node **p = &node->rb_left; 60 static inline void rb_link_right_of_node(struct rb_node *right, struct rb_node *node) 62 struct rb_node ** [all...] |
H A D | call-path.h | 22 * @rb_node: node in parent's tree of called functions 34 struct rb_node rb_node; member in struct:call_path
|
H A D | env.c | 37 struct rb_node *parent = NULL; 38 struct rb_node **p; 40 p = &env->bpf_progs.infos.rb_node; 44 node = rb_entry(parent, struct bpf_prog_info_node, rb_node); 55 rb_link_node(&info_node->rb_node, parent, p); 56 rb_insert_color(&info_node->rb_node, &env->bpf_progs.infos); 64 struct rb_node *n; 67 n = env->bpf_progs.infos.rb_node; 70 node = rb_entry(n, struct bpf_prog_info_node, rb_node); 97 struct rb_node *paren [all...] |
H A D | hist.c | 255 struct rb_node *next = rb_first_cached(&hists->entries); 262 n = rb_entry(next, struct hist_entry, rb_node); 265 next = rb_next(&n->rb_node); 346 struct rb_node *node = rb_first_cached(&he->hroot_out); 348 child = rb_entry(node, struct hist_entry, rb_node); 376 rb_erase_cached(&he->rb_node, root_out); 387 struct rb_node *next = rb_first_cached(&hists->entries); 391 n = rb_entry(next, struct hist_entry, rb_node); 392 next = rb_next(&n->rb_node); 403 struct rb_node *nex [all...] |
H A D | block-range.h | 23 struct rb_node node; 40 struct rb_node *n = rb_next(&br->node);
|
H A D | srcline.h | 41 struct rb_node rb_node; member in struct:inline_node
|
/linux-master/drivers/block/drbd/ |
H A D | drbd_interval.c | 10 sector_t interval_end(struct rb_node *node) 27 struct rb_node **new = &root->rb_node, *parent = NULL; 72 struct rb_node *node = root->rb_node; 120 struct rb_node *node = root->rb_node; 151 struct rb_node *node;
|
/linux-master/security/keys/ |
H A D | proc.c | 64 static struct rb_node *key_serial_next(struct seq_file *p, struct rb_node *n) 81 struct rb_node *n = key_serial_tree.rb_node; 129 static inline key_serial_t key_node_serial(struct rb_node *n) 137 struct rb_node *n; 155 struct rb_node *_p = v; 252 static struct rb_node *__key_user_next(struct user_namespace *user_ns, struct rb_node *n) 263 static struct rb_node *key_user_nex [all...] |
/linux-master/lib/ |
H A D | timerqueue.c | 20 static inline bool __timerqueue_less(struct rb_node *a, const struct rb_node *b) 75 struct rb_node *next;
|
H A D | rbtree_test.c | 20 struct rb_node rb; 34 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; 51 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; 88 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; 112 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; 158 static bool is_red(struct rb_node *r [all...] |
/linux-master/net/ipv4/ |
H A D | inetpeer.c | 49 * rb_node: pool lock 93 struct rb_node **parent_p, 94 struct rb_node ***pp_p) 96 struct rb_node **pp, *parent, *next; 99 pp = &base->rb_root.rb_node; 108 p = rb_entry(parent, struct inet_peer, rb_node); 169 rb_erase(&p->rb_node, &base->rb_root); 181 struct rb_node **pp, *parent; 224 rb_link_node(&p->rb_node, parent, pp); 225 rb_insert_color(&p->rb_node, [all...] |
/linux-master/drivers/infiniband/sw/rdmavt/ |
H A D | mcast.c | 109 struct rb_node *n; 114 n = ibp->mcast_tree.rb_node; 119 mcast = rb_entry(n, struct rvt_mcast, rb_node); 154 struct rb_node **n = &ibp->mcast_tree.rb_node; 155 struct rb_node *pn = NULL; 165 tmcast = rb_entry(pn, struct rvt_mcast, rb_node); 219 rb_link_node(&mcast->rb_node, pn, n); 220 rb_insert_color(&mcast->rb_node, &ibp->mcast_tree); 308 struct rb_node * [all...] |
/linux-master/fs/ext4/ |
H A D | extents_status.c | 182 struct rb_node *node; 189 es = rb_entry(node, struct extent_status, rb_node); 214 struct rb_node *node = root->rb_node; 218 es = rb_entry(node, struct extent_status, rb_node); 231 node = rb_next(&es->rb_node); 232 return node ? rb_entry(node, struct extent_status, rb_node) : 264 struct rb_node *node; 285 while ((node = rb_next(&es1->rb_node)) != NULL) { 286 es1 = rb_entry(node, struct extent_status, rb_node); [all...] |
/linux-master/arch/sh/kernel/ |
H A D | dwarf.c | 305 struct rb_node **rb_node = &cie_root.rb_node; local 320 while (*rb_node) { 323 cie_tmp = rb_entry(*rb_node, struct dwarf_cie, node); 332 rb_node = &(*rb_node)->rb_left; 334 rb_node = &(*rb_node)->rb_right; 349 struct rb_node **rb_nod local 738 struct rb_node **rb_node = &cie_root.rb_node; local 869 struct rb_node **rb_node = &fde_root.rb_node; local [all...] |
/linux-master/fs/xfs/ |
H A D | xfs_extent_busy.c | 32 struct rb_node **rbp; 33 struct rb_node *parent = NULL; 47 rbp = &pag->pagb_tree.rb_node; 50 busyp = rb_entry(parent, struct xfs_extent_busy, rb_node); 63 rb_link_node(&new->rb_node, parent, rbp); 64 rb_insert_color(&new->rb_node, &pag->pagb_tree); 109 struct rb_node *rbp; 115 rbp = pag->pagb_tree.rb_node; 117 busyp = rb_entry(rbp, struct xfs_extent_busy, rb_node); 244 rb_erase(&busyp->rb_node, [all...] |
/linux-master/net/bridge/ |
H A D | br_multicast_eht.c | 47 struct rb_node *node = pg->eht_host_tree.rb_node; 54 rb_node); 83 struct rb_node *node = eht_set->entry_tree.rb_node; 90 rb_node); 107 struct rb_node *node = pg->eht_set_tree.rb_node; 114 rb_node); 133 rb_erase(&eht_host->rb_node, [all...] |
/linux-master/net/ceph/ |
H A D | auth_x.h | 16 struct rb_node node;
|
/linux-master/drivers/gpu/drm/ |
H A D | drm_vma_manager.c | 145 struct rb_node *iter; 148 iter = mgr->vm_addr_space_mm.interval_tree.rb_root.rb_node; 246 struct rb_node **iter; 247 struct rb_node *parent = NULL; 259 iter = &node->vm_files.rb_node; 361 struct rb_node *iter; 365 iter = node->vm_files.rb_node; 402 struct rb_node *iter; 406 iter = node->vm_files.rb_node;
|
/linux-master/drivers/android/ |
H A D | binder_alloc.c | 71 struct rb_node **p = &alloc->free_buffers.rb_node; 72 struct rb_node *parent = NULL; 87 buffer = rb_entry(parent, struct binder_buffer, rb_node); 97 rb_link_node(&new_buffer->rb_node, parent, p); 98 rb_insert_color(&new_buffer->rb_node, &alloc->free_buffers); 104 struct rb_node **p = &alloc->allocated_buffers.rb_node; 105 struct rb_node *parent = NULL; 112 buffer = rb_entry(parent, struct binder_buffer, rb_node); [all...] |
/linux-master/arch/arm/xen/ |
H A D | p2m.c | 26 struct rb_node rbnode_phys; 35 struct rb_node **link = &phys_to_mach.rb_node; 36 struct rb_node *parent = NULL; 66 struct rb_node *n; 71 n = phys_to_mach.rb_node; 156 struct rb_node *n; 160 n = phys_to_mach.rb_node;
|
/linux-master/block/ |
H A D | bfq-wf2q.c | 25 struct rb_node *node = tree->rb_node; 27 return rb_entry(node, struct bfq_entity, rb_node); 323 struct bfq_entity *bfq_entity_of(struct rb_node *node) 328 entity = rb_entry(node, struct bfq_entity, rb_node); 341 rb_erase(&entity->rb_node, root); 353 struct rb_node *next; 356 next = rb_next(&entity->rb_node); 361 next = rb_prev(&entity->rb_node); 382 struct rb_node **nod [all...] |