Searched refs:rb_parent (Results 1 - 20 of 20) sorted by relevance
/linux-master/include/linux/ |
H A D | interval_tree_generic.h | 41 struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \ 47 rb_parent = *link; \ 48 parent = rb_entry(rb_parent, ITSTRUCT, ITRB); \ 60 rb_link_node(&node->ITRB, rb_parent, link); \ 173 rb = rb_parent(&node->ITRB); \
|
H A D | rbtree.h | 26 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
|
H A D | rbtree_augmented.h | 109 rb = rb_parent(&node->RBFIELD); \
|
/linux-master/scripts/gdb/linux/ |
H A D | rbtree.py | 45 def rb_parent(node): function 69 parent = rb_parent(node) 72 parent = rb_parent(node) 92 parent = rb_parent(node) 95 parent = rb_parent(node)
|
/linux-master/tools/include/linux/ |
H A D | interval_tree_generic.h | 41 struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \ 47 rb_parent = *link; \ 48 parent = rb_entry(rb_parent, ITSTRUCT, ITRB); \ 60 rb_link_node(&node->ITRB, rb_parent, link); \ 173 rb = rb_parent(&node->ITRB); \
|
H A D | rbtree_augmented.h | 85 rb = rb_parent(&node->RBFIELD); \
|
H A D | rbtree.h | 34 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
|
/linux-master/lib/ |
H A D | rbtree_test.c | 88 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; local 94 rb_parent = *new; 95 parent = rb_entry(rb_parent, struct test_node, rb); 105 rb_link_node(&node->rb, rb_parent, new); 112 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; local 119 rb_parent = *new; 120 parent = rb_entry(rb_parent, struct test_node, rb); 132 rb_link_node(&node->rb, rb_parent, new); 166 for (count = 0; rb; rb = rb_parent(rb)) 201 (!rb_parent(r [all...] |
H A D | rbtree.c | 78 struct rb_node *parent = rb_parent(old); 134 parent = rb_parent(node); 190 parent = rb_parent(node); 286 parent = rb_parent(node); 376 parent = rb_parent(node); 517 while ((parent = rb_parent(node)) && node == parent->rb_right) 546 while ((parent = rb_parent(node)) && node == parent->rb_left) 556 struct rb_node *parent = rb_parent(victim); 573 struct rb_node *parent = rb_parent(victim); 609 parent = rb_parent(nod [all...] |
/linux-master/tools/lib/ |
H A D | rbtree.c | 78 struct rb_node *parent = rb_parent(old); 134 parent = rb_parent(node); 190 parent = rb_parent(node); 286 parent = rb_parent(node); 376 parent = rb_parent(node); 511 while ((parent = rb_parent(node)) && node == parent->rb_right) 539 while ((parent = rb_parent(node)) && node == parent->rb_left) 548 struct rb_node *parent = rb_parent(victim); 578 parent = rb_parent(node);
|
/linux-master/drivers/gpu/drm/ |
H A D | drm_mm.c | 182 rb = rb_parent(rb); 247 struct rb_node **link = &root->rb_node, *rb_parent = NULL; local 252 rb_parent = *link; 253 parent = rb_entry(rb_parent, struct drm_mm_node, rb_hole_addr); 262 rb_link_node(&node->rb_hole_addr, rb_parent, link); 404 while ((parent = rb_parent(node)) && node == parent->first) \
|
/linux-master/fs/jffs2/ |
H A D | nodelist.h | 349 #define frag_parent(frag) rb_entry(rb_parent(&(frag)->rb), struct jffs2_node_frag, rb) 356 #define tn_parent(tn) rb_entry(rb_parent(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)
|
H A D | readinode.c | 404 struct rb_node *parent = rb_parent(node);
|
/linux-master/block/ |
H A D | bfq-wf2q.c | 456 parent = rb_parent(node); 549 deepest = rb_parent(node); 558 else if (rb_parent(deepest) != node) 559 deepest = rb_parent(deepest);
|
/linux-master/mm/ |
H A D | kmemleak.c | 691 struct rb_node **link, *rb_parent; local 711 rb_parent = NULL; 713 rb_parent = *link; 714 parent = rb_entry(rb_parent, struct kmemleak_object, rb_node); 731 rb_link_node(&object->rb_node, rb_parent, link);
|
H A D | vmalloc.c | 1523 while ((node = rb_parent(node))) {
|
/linux-master/drivers/mtd/ubi/ |
H A D | attach.c | 1290 this = rb_parent(this); 1348 rb = rb_parent(rb);
|
H A D | wl.c | 1643 rb = rb_parent(rb);
|
/linux-master/net/tipc/ |
H A D | name_table.c | 197 while ((p = rb_parent(n)) && n == p->rb_right)
|
/linux-master/drivers/md/ |
H A D | dm-crypt.c | 1976 BUG_ON(rb_parent(write_tree.rb_node));
|
Completed in 288 milliseconds