Home
last modified time | relevance | path

Searched refs:rb_parent (Results 1 – 22 of 22) sorted by relevance

/Linux-v6.6/tools/include/linux/
Dinterval_tree_generic.h41 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); \
Drbtree.h34 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
Drbtree_augmented.h85 rb = rb_parent(&node->RBFIELD); \
/Linux-v6.6/include/linux/
Dinterval_tree_generic.h41 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); \
Drbtree.h26 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
Drbtree_augmented.h109 rb = rb_parent(&node->RBFIELD); \
/Linux-v6.6/lib/
Drbtree_test.c88 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in RB_DECLARE_CALLBACKS_MAX() local
94 rb_parent = *new; in RB_DECLARE_CALLBACKS_MAX()
95 parent = rb_entry(rb_parent, struct test_node, rb); in RB_DECLARE_CALLBACKS_MAX()
105 rb_link_node(&node->rb, rb_parent, new); in RB_DECLARE_CALLBACKS_MAX()
112 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in insert_augmented_cached() local
119 rb_parent = *new; in insert_augmented_cached()
120 parent = rb_entry(rb_parent, struct test_node, rb); in insert_augmented_cached()
132 rb_link_node(&node->rb, rb_parent, new); in insert_augmented_cached()
166 for (count = 0; rb; rb = rb_parent(rb)) in black_path_count()
201 (!rb_parent(rb) || is_red(rb_parent(rb)))); in check()
Drbtree.c78 struct rb_node *parent = rb_parent(old); in __rb_rotate_set_parents()
134 parent = rb_parent(node); in __rb_insert()
190 parent = rb_parent(node); in __rb_insert()
286 parent = rb_parent(node); in ____rb_erase_color()
376 parent = rb_parent(node); in ____rb_erase_color()
517 while ((parent = rb_parent(node)) && node == parent->rb_right) in rb_next()
546 while ((parent = rb_parent(node)) && node == parent->rb_left) in rb_prev()
556 struct rb_node *parent = rb_parent(victim); in rb_replace_node()
573 struct rb_node *parent = rb_parent(victim); in rb_replace_node_rcu()
609 parent = rb_parent(node); in rb_next_postorder()
/Linux-v6.6/scripts/gdb/linux/
Drbtree.py45 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-v6.6/tools/lib/
Drbtree.c78 struct rb_node *parent = rb_parent(old); in __rb_rotate_set_parents()
134 parent = rb_parent(node); in __rb_insert()
190 parent = rb_parent(node); in __rb_insert()
286 parent = rb_parent(node); in ____rb_erase_color()
376 parent = rb_parent(node); in ____rb_erase_color()
511 while ((parent = rb_parent(node)) && node == parent->rb_right) in rb_next()
539 while ((parent = rb_parent(node)) && node == parent->rb_left) in rb_prev()
548 struct rb_node *parent = rb_parent(victim); in rb_replace_node()
578 parent = rb_parent(node); in rb_next_postorder()
/Linux-v6.6/Documentation/translations/zh_CN/core-api/
Drbtree.rst335 rb = rb_parent(&node->rb);
367 struct rb_node **link = &root->rb_node, *rb_parent = NULL;
372 rb_parent = *link;
373 parent = rb_entry(rb_parent, struct interval_tree_node, rb);
383 rb_link_node(&node->rb, rb_parent, link);
/Linux-v6.6/drivers/gpu/drm/
Ddrm_mm.c182 rb = rb_parent(rb); in drm_mm_interval_tree_add_node()
247 struct rb_node **link = &root->rb_node, *rb_parent = NULL; in RB_DECLARE_CALLBACKS_MAX() local
252 rb_parent = *link; in RB_DECLARE_CALLBACKS_MAX()
253 parent = rb_entry(rb_parent, struct drm_mm_node, rb_hole_addr); in RB_DECLARE_CALLBACKS_MAX()
262 rb_link_node(&node->rb_hole_addr, rb_parent, link); in RB_DECLARE_CALLBACKS_MAX()
404 while ((parent = rb_parent(node)) && node == parent->first) \
/Linux-v6.6/Documentation/core-api/
Drbtree.rst373 rb = rb_parent(&node->rb);
405 struct rb_node **link = &root->rb_node, *rb_parent = NULL;
410 rb_parent = *link;
411 parent = rb_entry(rb_parent, struct interval_tree_node, rb);
421 rb_link_node(&node->rb, rb_parent, link);
/Linux-v6.6/block/
Dbfq-wf2q.c456 parent = rb_parent(node); in bfq_update_active_tree()
549 deepest = rb_parent(node); in bfq_find_deepest()
558 else if (rb_parent(deepest) != node) in bfq_find_deepest()
559 deepest = rb_parent(deepest); in bfq_find_deepest()
/Linux-v6.6/mm/
Dkmemleak.c636 struct rb_node **link, *rb_parent; in __create_object() local
696 rb_parent = NULL; in __create_object()
698 rb_parent = *link; in __create_object()
699 parent = rb_entry(rb_parent, struct kmemleak_object, rb_node); in __create_object()
717 rb_link_node(&object->rb_node, rb_parent, link); in __create_object()
Dvmalloc.c1287 while ((node = rb_parent(node))) { in find_vmap_lowest_match()
/Linux-v6.6/fs/jffs2/
Dnodelist.h349 #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)
Dreadinode.c404 struct rb_node *parent = rb_parent(node); in eat_last()
/Linux-v6.6/drivers/mtd/ubi/
Dattach.c1290 this = rb_parent(this); in destroy_av()
1348 rb = rb_parent(rb); in destroy_ai()
Dwl.c1631 rb = rb_parent(rb);
/Linux-v6.6/net/tipc/
Dname_table.c197 while ((p = rb_parent(n)) && n == p->rb_right) in service_range_match_next()
/Linux-v6.6/drivers/md/
Ddm-crypt.c1957 BUG_ON(rb_parent(write_tree.rb_node)); in dmcrypt_write()