Home
last modified time | relevance | path

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

12

/include/linux/
Drbtree.h26 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3))
30 #define RB_EMPTY_ROOT(root) (READ_ONCE((root)->rb_node) == NULL)
39 extern void rb_insert_color(struct rb_node *, struct rb_root *);
40 extern void rb_erase(struct rb_node *, struct rb_root *);
44 extern struct rb_node *rb_next(const struct rb_node *);
45 extern struct rb_node *rb_prev(const struct rb_node *);
46 extern struct rb_node *rb_first(const struct rb_root *);
47 extern struct rb_node *rb_last(const struct rb_root *);
50 extern struct rb_node *rb_first_postorder(const struct rb_root *);
51 extern struct rb_node *rb_next_postorder(const struct rb_node *);
[all …]
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);
33 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
34 void (*augment_rotate)(struct rb_node *old, struct rb_node *new));
47 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented()
54 rb_insert_augmented_cached(struct rb_node *node, in rb_insert_augmented_cached()
77 RBNAME ## _propagate(struct rb_node *rb, struct rb_node *stop) \
87 RBNAME ## _copy(struct rb_node *rb_old, struct rb_node *rb_new) \
94 RBNAME ## _rotate(struct rb_node *rb_old, struct rb_node *rb_new) \
[all …]
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;
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()
Dinterval_tree_generic.h41 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; \
Dtimerqueue.h10 struct rb_node node;
36 struct rb_node *leftmost = rb_first_cached(&head->rb_root); in timerqueue_getnext()
Dinterval_tree.h8 struct rb_node rb;
Diova.h20 struct rb_node node;
71 struct rb_node *cached_node; /* Save last alloced node */
72 struct rb_node *cached32_node; /* Save last 32-bit alloced node */
Dpktcdvd.h144 struct rb_node rb_node; member
Dbacking-dev-defs.h175 struct rb_node rb_node; /* keyed by ->id */ member
Dvhost_iotlb.h8 struct rb_node rb;
Dvmalloc.h66 struct rb_node rb_node; /* address sorted rbtree */ member
Dmm_types.h296 struct rb_node vm_rb; /* link in global region tree */
352 struct rb_node vm_rb;
383 struct rb_node rb;
/include/linux/ceph/
Dosd_client.h38 struct rb_node o_node;
181 struct rb_node r_node;
182 struct rb_node r_mc_node; /* map check */
272 struct rb_node node; /* osd */
273 struct rb_node osdc_node; /* osdc */
274 struct rb_node mc_node; /* map check */
304 struct rb_node node;
336 struct rb_node spg_node;
337 struct rb_node id_node;
Dlibceph.h202 struct rb_node **n = &root->rb_node; \
203 struct rb_node *parent = NULL; \
245 struct rb_node *n = root->rb_node; \
Dstring_table.h13 struct rb_node node;
Dosdmap.h45 struct rb_node node;
152 struct rb_node node;
321 struct rb_node cl_node;
Dmon_client.h54 struct rb_node node;
/include/net/
Dinetpeer.h37 struct rb_node rb_node; member
Dgarp.h80 struct rb_node node;
Dmrp.h91 struct rb_node node;
/include/drm/
Ddrm_mm.h166 struct rb_node rb;
167 struct rb_node rb_hole_size;
168 struct rb_node rb_hole_addr;
Ddrm_vma_manager.h47 struct rb_node vm_rb;
/include/xen/arm/
Dpage.h62 if (phys_to_mach.rb_node != NULL) { in pfn_to_bfn()
/include/linux/crush/
Dcrush.h196 struct rb_node node;

12