/linux-master/lib/ |
H A D | rbtree.c | 38 * All stores to the tree structure (rb_left and rb_right) must be done using 116 if (parent != tmp) { /* parent == gparent->rb_left */ 154 tmp = node->rb_left; 156 WRITE_ONCE(node->rb_left, parent); 176 WRITE_ONCE(gparent->rb_left, tmp); /* == parent->rb_right */ 184 tmp = gparent->rb_left; 195 tmp = parent->rb_left; 199 WRITE_ONCE(parent->rb_left, tmp); 207 tmp = node->rb_left; 211 WRITE_ONCE(gparent->rb_right, tmp); /* == parent->rb_left */ [all...] |
H A D | rbtree_test.c | 40 new = &parent->rb_left; 58 new = &parent->rb_left; 99 new = &parent->rb.rb_left; 124 new = &parent->rb.rb_left; 205 WARN_ON_ONCE((!rb->rb_left || !rb->rb_right) && 226 if (node->rb.rb_left) { 227 subtree = rb_entry(node->rb.rb_left, struct test_node,
|
/linux-master/tools/lib/ |
H A D | rbtree.c | 38 * All stores to the tree structure (rb_left and rb_right) must be done using 116 if (parent != tmp) { /* parent == gparent->rb_left */ 154 tmp = node->rb_left; 156 WRITE_ONCE(node->rb_left, parent); 176 WRITE_ONCE(gparent->rb_left, tmp); /* == parent->rb_right */ 184 tmp = gparent->rb_left; 195 tmp = parent->rb_left; 199 WRITE_ONCE(parent->rb_left, tmp); 207 tmp = node->rb_left; 211 WRITE_ONCE(gparent->rb_right, tmp); /* == parent->rb_left */ [all...] |
/linux-master/include/linux/ |
H A D | rbtree_types.h | 8 struct rb_node *rb_left; member in struct:rb_node
|
H A D | rbtree_augmented.h | 75 link = &parent->rb_left; 152 if (node->RBFIELD.rb_left) { \ 153 child = rb_entry(node->RBFIELD.rb_left, RBSTRUCT, RBFIELD); \ 199 if (parent->rb_left == old) 200 WRITE_ONCE(parent->rb_left, new); 212 if (parent->rb_left == old) 213 rcu_assign_pointer(parent->rb_left, new); 228 struct rb_node *tmp = node->rb_left; 250 /* Still case 1, but this time the child is node->rb_left */ 259 tmp = child->rb_left; [all...] |
H A D | rbtree.h | 63 node->rb_left = node->rb_right = NULL; 72 node->rb_left = node->rb_right = NULL; 175 link = &parent->rb_left; 204 link = &parent->rb_left; 235 link = &parent->rb_left; 265 node = node->rb_left; 296 node = node->rb_left;
|
H A D | interval_tree_generic.h | 52 link = &parent->ITRB.rb_left; \ 88 if (node->ITRB.rb_left) { \ 89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
|
H A D | rbtree_latch.h | 90 link = &parent->rb_left; 118 node = rcu_dereference_raw(node->rb_left);
|
/linux-master/drivers/block/drbd/ |
H A D | drbd_interval.c | 40 new = &(*new)->rb_left; 44 new = &(*new)->rb_left; 79 node = node->rb_left; 83 node = node->rb_left; 130 if (node->rb_left && 131 sector < interval_end(node->rb_left)) { 133 node = node->rb_left;
|
/linux-master/tools/include/linux/ |
H A D | rbtree_augmented.h | 128 if (node->RBFIELD.rb_left) { \ 129 child = rb_entry(node->RBFIELD.rb_left, RBSTRUCT, RBFIELD); \ 175 if (parent->rb_left == old) 176 WRITE_ONCE(parent->rb_left, new); 191 struct rb_node *tmp = node->rb_left; 213 /* Still case 1, but this time the child is node->rb_left */ 222 tmp = child->rb_left; 255 tmp = tmp->rb_left; 258 WRITE_ONCE(parent->rb_left, child2); 266 tmp = node->rb_left; [all...] |
H A D | rbtree.h | 26 struct rb_node *rb_left; member in struct:rb_node 70 node->rb_left = node->rb_right = NULL; 188 link = &parent->rb_left; 215 link = &parent->rb_left; 246 link = &parent->rb_left; 276 node = node->rb_left; 307 node = node->rb_left;
|
H A D | interval_tree_generic.h | 52 link = &parent->ITRB.rb_left; \ 88 if (node->ITRB.rb_left) { \ 89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
|
/linux-master/mm/ |
H A D | interval_tree.c | 46 while (parent->shared.rb.rb_left) { 47 parent = rb_entry(parent->shared.rb.rb_left, 52 link = &parent->shared.rb.rb_left;
|
/linux-master/fs/btrfs/ |
H A D | misc.h | 78 node = node->rb_left; 111 node = node->rb_left; 134 p = &(*p)->rb_left;
|
H A D | ulist.c | 133 n = n->rb_left; 162 p = &(*p)->rb_left;
|
/linux-master/net/ceph/ |
H A D | string_table.c | 24 p = &(*p)->rb_left; 59 p = &(*p)->rb_left;
|
/linux-master/tools/perf/util/ |
H A D | rblist.c | 26 p = &(*p)->rb_left; 68 p = &(*p)->rb_left;
|
H A D | block-range.c | 40 p = &parent->rb_left; 52 struct rb_node **p = &node->rb_left; 65 p = &node->rb_left; 89 p = &parent->rb_left;
|
H A D | mem2node.c | 29 p = &(*p)->rb_left; 129 p = &(*p)->rb_left;
|
/linux-master/drivers/gpu/drm/ |
H A D | drm_vma_manager.c | 160 iter = iter->rb_left; 272 iter = &(*iter)->rb_left; 377 iter = iter->rb_left; 414 iter = iter->rb_left;
|
/linux-master/block/ |
H A D | bfq-wf2q.c | 390 node = &parent->rb_left; 436 bfq_update_min(entity, node->rb_left); 460 if (node == parent->rb_left && parent->rb_right) 462 else if (parent->rb_left) 463 bfq_update_active_node(parent->rb_left); 488 if (node->rb_left) 489 node = node->rb_left; 548 if (!node->rb_right && !node->rb_left) 551 deepest = node->rb_left; 552 else if (!node->rb_left) [all...] |
/linux-master/net/netfilter/ |
H A D | nft_set_rbtree.c | 74 parent = rcu_dereference_raw(parent->rb_left); 85 parent = rcu_dereference_raw(parent->rb_left); 95 parent = rcu_dereference_raw(parent->rb_left); 156 parent = rcu_dereference_raw(parent->rb_left); 165 parent = rcu_dereference_raw(parent->rb_left); 182 parent = rcu_dereference_raw(parent->rb_left); 331 p = &parent->rb_left; 340 p = &parent->rb_left; 472 p = &parent->rb_left; 476 p = &parent->rb_left; [all...] |
/linux-master/net/rxrpc/ |
H A D | conn_service.c | 46 p = rcu_dereference_raw(p->rb_left); 81 pp = &(*pp)->rb_left;
|
/linux-master/arch/arm/xen/ |
H A D | p2m.c | 48 link = &(*link)->rb_left; 81 n = n->rb_left; 171 n = n->rb_left;
|
/linux-master/drivers/infiniband/sw/rdmavt/ |
H A D | mcast.c | 124 n = n->rb_left; 171 n = &pn->rb_left; 329 n = n->rb_left;
|