Home
last modified time | relevance | path

Searched refs:rb_node (Results 1 – 25 of 49) sorted by relevance

12

/include/linux/
A Drbtree.h44 extern struct rb_node *rb_next(const struct rb_node *);
45 extern struct rb_node *rb_prev(const struct rb_node *);
168 struct rb_node **link = &tree->rb_root.rb_node; in rb_add_cached()
198 struct rb_node **link = &tree->rb_node; in rb_add()
227 struct rb_node **link = &tree->rb_root.rb_node; in rb_find_add_cached()
263 struct rb_node **link = &tree->rb_node; in rb_find_add()
297 int (*cmp)(struct rb_node *, const struct rb_node *)) in rb_find_add_rcu() argument
299 struct rb_node **link = &tree->rb_node; in rb_find_add_rcu()
332 struct rb_node *node = tree->rb_node; in rb_find()
363 struct rb_node *node = tree->rb_node; in rb_find_rcu()
[all …]
A Drbtree_augmented.h28 void (*propagate)(struct rb_node *node, struct rb_node *stop);
29 void (*copy)(struct rb_node *old, struct rb_node *new);
30 void (*rotate)(struct rb_node *old, struct rb_node *new);
34 void (*augment_rotate)(struct rb_node *old, struct rb_node *new));
65 bool (*less)(struct rb_node *, const struct rb_node *), in rb_add_augmented_cached() argument
68 struct rb_node **link = &tree->rb_root.rb_node; in rb_add_augmented_cached()
103 RBNAME ## _propagate(struct rb_node *rb, struct rb_node *stop) \
113 RBNAME ## _copy(struct rb_node *rb_old, struct rb_node *rb_new) \
120 RBNAME ## _rotate(struct rb_node *rb_old, struct rb_node *rb_new) \
195 __rb_change_child(struct rb_node *old, struct rb_node *new, in __rb_change_child()
[all …]
A Drbtree_types.h5 struct rb_node { struct
7 struct rb_node *rb_right; argument
8 struct rb_node *rb_left; argument
13 struct rb_node *rb_node; member
28 struct rb_node *rb_leftmost;
A Drbtree_latch.h41 struct rb_node node[2];
70 __lt_from_rb(struct rb_node *node, int idx) in __lt_from_rb()
80 struct rb_node **link = &root->rb_node; in __lt_insert()
81 struct rb_node *node = &ltn->node[idx]; in __lt_insert()
82 struct rb_node *parent = NULL; in __lt_insert()
109 struct rb_node *node = rcu_dereference_raw(ltr->tree[idx].rb_node); in __lt_find()
A Dinterval_tree_generic.h41 struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \
120 if (!root->rb_root.rb_node) \
136 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
150 struct rb_node *rb = node->ITRB.rb_right, *prev; \
A Dtimerqueue_types.h9 struct rb_node node;
A Diova.h19 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 */
A Dtimerqueue.h25 struct rb_node *leftmost = rb_first_cached(&head->rb_root); in timerqueue_getnext()
A Dxattr.h114 struct rb_node rb_node; member
A Dinterval_tree.h8 struct rb_node rb;
A Dbacking-dev-defs.h165 struct rb_node rb_node; /* keyed by ->id */ member
A Dvhost_iotlb.h8 struct rb_node rb;
A Dvmalloc.h71 struct rb_node rb_node; /* address sorted rbtree */ member
/include/linux/ceph/
A Dosd_client.h86 struct rb_node o_node;
238 struct rb_node r_node;
239 struct rb_node r_mc_node; /* map check */
330 struct rb_node node; /* osd */
331 struct rb_node osdc_node; /* osdc */
332 struct rb_node mc_node; /* map check */
362 struct rb_node node;
394 struct rb_node spg_node;
395 struct rb_node id_node;
A Dlibceph.h193 struct rb_node **n = &root->rb_node; \
194 struct rb_node *parent = NULL; \
236 struct rb_node *n = root->rb_node; \
A Dstring_table.h13 struct rb_node node;
A Dosdmap.h45 struct rb_node node;
152 struct rb_node node;
321 struct rb_node cl_node;
A Dmon_client.h54 struct rb_node node;
/include/net/
A Dinetpeer.h37 struct rb_node rb_node; member
A Dgarp.h82 struct rb_node node;
A Dmrp.h95 struct rb_node node;
/include/drm/
A Ddrm_mm.h168 struct rb_node rb;
169 struct rb_node rb_hole_size;
170 struct rb_node rb_hole_addr;
A Ddrm_vma_manager.h47 struct rb_node vm_rb;
/include/xen/arm/
A Dpage.h62 if (phys_to_mach.rb_node != NULL) { in pfn_to_bfn()
/include/linux/sched/
A Dext.h142 struct rb_node dsq_priq; /* p->scx.dsq_vtime order */

Completed in 829 milliseconds

12