Home
last modified time | relevance | path

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

/linux/lib/
H A 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()
488 while ((parent = rb_parent(node)) && node == parent->rb_right) in rb_next()
517 while ((parent = rb_parent(node)) && node == parent->rb_left) in rb_prev()
527 struct rb_node *parent = rb_parent(victim); in rb_replace_node()
544 struct rb_node *parent = rb_parent(victim); in rb_replace_node_rcu()
580 parent = rb_parent(node); in rb_next_postorder()
H A Drbtree_test.c89 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in RB_DECLARE_CALLBACKS_MAX() local
95 rb_parent = *new; in RB_DECLARE_CALLBACKS_MAX()
96 parent = rb_entry(rb_parent, struct test_node, rb); in RB_DECLARE_CALLBACKS_MAX()
106 rb_link_node(&node->rb, rb_parent, new); in RB_DECLARE_CALLBACKS_MAX()
113 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in insert_augmented_cached() local
120 rb_parent = *new; in insert_augmented_cached()
121 parent = rb_entry(rb_parent, struct test_node, rb); in insert_augmented_cached()
133 rb_link_node(&node->rb, rb_parent, new); in insert_augmented_cached()
167 for (count = 0; rb; rb = rb_parent(rb)) in black_path_count()
202 (!rb_parent(rb) || is_red(rb_parent(rb)))); in check()
/linux/tools/lib/
H A 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/scripts/gdb/linux/
H A Drbtree.py57 def rb_parent(node): function
81 parent = rb_parent(node)
84 parent = rb_parent(node)
104 parent = rb_parent(node)
107 parent = rb_parent(node)
/linux/Documentation/translations/zh_CN/core-api/
H A 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/block/
H A 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/mm/
H A Dkmemleak.c711 struct rb_node **link, *rb_parent; in __link_object() local
735 rb_parent = NULL; in __link_object()
737 rb_parent = *link; in __link_object()
738 parent = rb_entry(rb_parent, struct kmemleak_object, rb_node); in __link_object()
761 rb_link_node(&object->rb_node, rb_parent, link); in __link_object()
H A Dvmalloc.c1609 while ((node = rb_parent(node))) { in find_vmap_lowest_match()
/linux/fs/jffs2/
H A 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)
H A Dreadinode.c404 struct rb_node *parent = rb_parent(node); in eat_last()
/linux/tools/include/linux/
H A Drbtree.h34 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
H A Drbtree_augmented.h85 rb = rb_parent(&node->RBFIELD); \
/linux/include/linux/
H A Drbtree_augmented.h109 rb = rb_parent(&node->RBFIELD); \
H A Drbtree.h26 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
/linux/drivers/mtd/ubi/
H A Dattach.c1290 this = rb_parent(this); in destroy_av()
1348 rb = rb_parent(rb); in destroy_ai()
H A Dwl.c1650 rb = rb_parent(rb);
/linux/net/tipc/
H A Dname_table.c197 while ((p = rb_parent(n)) && n == p->rb_right) in service_range_match_next()
/linux/drivers/md/
H A Ddm-crypt.c1967 BUG_ON(rb_parent(write_tree.rb_node)); in dmcrypt_write()