Searched refs:rb_right (Results 1 - 25 of 237) sorted by relevance

12345678910

/linux-master/lib/
H A Drbtree.c38 * All stores to the tree structure (rb_left and rb_right) must be done using
115 tmp = gparent->rb_right;
139 tmp = parent->rb_right;
155 WRITE_ONCE(parent->rb_right, tmp);
163 tmp = node->rb_right;
176 WRITE_ONCE(gparent->rb_left, tmp); /* == parent->rb_right */
177 WRITE_ONCE(parent->rb_right, gparent);
198 tmp = node->rb_right;
200 WRITE_ONCE(node->rb_right, parent);
211 WRITE_ONCE(gparent->rb_right, tm
[all...]
H A Drbtree_test.c42 new = &parent->rb_right;
60 new = &parent->rb_right;
101 new = &parent->rb.rb_right;
126 new = &parent->rb.rb_right;
205 WARN_ON_ONCE((!rb->rb_left || !rb->rb_right) &&
232 if (node->rb.rb_right) {
233 subtree = rb_entry(node->rb.rb_right, struct test_node,
/linux-master/tools/lib/
H A Drbtree.c38 * All stores to the tree structure (rb_left and rb_right) must be done using
115 tmp = gparent->rb_right;
139 tmp = parent->rb_right;
155 WRITE_ONCE(parent->rb_right, tmp);
163 tmp = node->rb_right;
176 WRITE_ONCE(gparent->rb_left, tmp); /* == parent->rb_right */
177 WRITE_ONCE(parent->rb_right, gparent);
198 tmp = node->rb_right;
200 WRITE_ONCE(node->rb_right, parent);
211 WRITE_ONCE(gparent->rb_right, tm
[all...]
/linux-master/include/linux/
H A Drbtree_types.h7 struct rb_node *rb_right; member in struct:rb_node
H A Dinterval_tree_generic.h54 link = &parent->ITRB.rb_right; \
107 if (node->ITRB.rb_right) { \
108 node = rb_entry(node->ITRB.rb_right, \
154 struct rb_node *rb = node->ITRB.rb_right, *prev; \
160 * rb == node->ITRB.rb_right \
178 rb = node->ITRB.rb_right; \
H A Drbtree.h63 node->rb_left = node->rb_right = NULL;
72 node->rb_left = node->rb_right = NULL;
177 link = &parent->rb_right;
206 link = &parent->rb_right;
237 link = &parent->rb_right;
267 node = node->rb_right;
298 node = node->rb_right;
H A Drbtree_augmented.h77 link = &parent->rb_right;
157 if (node->RBFIELD.rb_right) { \
158 child = rb_entry(node->RBFIELD.rb_right, RBSTRUCT, RBFIELD); \
202 WRITE_ONCE(parent->rb_right, new);
215 rcu_assign_pointer(parent->rb_right, new);
227 struct rb_node *child = node->rb_right;
271 child2 = successor->rb_right;
294 child2 = successor->rb_right;
296 WRITE_ONCE(successor->rb_right, child);
H A Drbtree_latch.h92 link = &parent->rb_right;
120 node = rcu_dereference_raw(node->rb_right);
/linux-master/tools/include/linux/
H A Dinterval_tree_generic.h54 link = &parent->ITRB.rb_right; \
107 if (node->ITRB.rb_right) { \
108 node = rb_entry(node->ITRB.rb_right, \
154 struct rb_node *rb = node->ITRB.rb_right, *prev; \
160 * rb == node->ITRB.rb_right \
178 rb = node->ITRB.rb_right; \
H A Drbtree_augmented.h133 if (node->RBFIELD.rb_right) { \
134 child = rb_entry(node->RBFIELD.rb_right, RBSTRUCT, RBFIELD); \
178 WRITE_ONCE(parent->rb_right, new);
190 struct rb_node *child = node->rb_right;
234 child2 = successor->rb_right;
257 child2 = successor->rb_right;
259 WRITE_ONCE(successor->rb_right, child);
H A Drbtree.h25 struct rb_node *rb_right; member in struct:rb_node
70 node->rb_left = node->rb_right = NULL;
190 link = &parent->rb_right;
217 link = &parent->rb_right;
248 link = &parent->rb_right;
278 node = node->rb_right;
309 node = node->rb_right;
/linux-master/drivers/block/drbd/
H A Ddrbd_interval.c42 new = &(*new)->rb_right;
46 new = &(*new)->rb_right;
81 node = node->rb_right;
85 node = node->rb_right;
140 node = node->rb_right;
/linux-master/mm/
H A Dinterval_tree.c38 if (!prev->shared.rb.rb_right) {
40 link = &prev->shared.rb.rb_right;
42 parent = rb_entry(prev->shared.rb.rb_right,
H A Dshmem_quota.c136 node = node->rb_right;
189 n = &(*n)->rb_right;
288 node = node->rb_right;
/linux-master/fs/btrfs/
H A Dmisc.h80 node = node->rb_right;
113 node = node->rb_right;
136 p = &(*p)->rb_right;
H A Dulist.c131 n = n->rb_right;
160 p = &(*p)->rb_right;
/linux-master/net/ceph/
H A Dstring_table.c26 p = &(*p)->rb_right;
61 p = &(*p)->rb_right;
/linux-master/tools/perf/util/
H A Drblist.c28 p = &(*p)->rb_right;
70 p = &(*p)->rb_right;
H A Dblock-range.c42 p = &parent->rb_right;
55 p = &node->rb_right;
62 struct rb_node **p = &node->rb_right;
91 p = &parent->rb_right;
H A Dmem2node.c31 p = &(*p)->rb_right;
131 p = &(*p)->rb_right;
/linux-master/drivers/gpu/drm/
H A Ddrm_vma_manager.c155 iter = iter->rb_right;
270 iter = &(*iter)->rb_right;
375 iter = iter->rb_right;
412 iter = iter->rb_right;
/linux-master/net/rxrpc/
H A Dconn_service.c48 p = rcu_dereference_raw(p->rb_right);
83 pp = &(*pp)->rb_right;
/linux-master/arch/arm/xen/
H A Dp2m.c50 link = &(*link)->rb_right;
83 n = n->rb_right;
173 n = n->rb_right;
/linux-master/block/
H A Dbfq-wf2q.c392 node = &parent->rb_right;
435 bfq_update_min(entity, node->rb_right);
460 if (node == parent->rb_left && parent->rb_right)
461 bfq_update_active_node(parent->rb_right);
490 else if (node->rb_right)
491 node = node->rb_right;
548 if (!node->rb_right && !node->rb_left)
550 else if (!node->rb_right)
553 deepest = node->rb_right;
556 if (deepest->rb_right)
[all...]
/linux-master/drivers/infiniband/sw/rdmavt/
H A Dmcast.c126 n = n->rb_right;
175 n = &pn->rb_right;
331 n = n->rb_right;

Completed in 440 milliseconds

12345678910