Home
last modified time | relevance | path

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

/linux/lib/
A 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()
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()
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/include/linux/
A 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); \
A Drbtree.h26 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
A Drbtree_augmented.h83 rb = rb_parent(&node->RBFIELD); \
/linux/tools/lib/
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/
A 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/mm/
A Dmmap.c560 *rb_parent = __rb_parent; in find_vma_links()
680 struct rb_node *rb_parent) in __vma_link() argument
688 struct rb_node *rb_parent) in vma_link() argument
714 struct rb_node **rb_link, *rb_parent; in __insert_vm_struct() local
717 &prev, &rb_link, &rb_parent)) in __insert_vm_struct()
1722 struct rb_node **rb_link, *rb_parent; in mmap_region() local
1962 if (!rb_parent(prev)) in unmapped_area()
1964 vma = rb_entry(rb_parent(prev), in unmapped_area()
2066 if (!rb_parent(prev)) in unmapped_area_topdown()
2068 vma = rb_entry(rb_parent(prev), in unmapped_area_topdown()
[all …]
A Dkmemleak.c577 struct rb_node **link, *rb_parent; in create_object() local
628 rb_parent = NULL; in create_object()
630 rb_parent = *link; in create_object()
631 parent = rb_entry(rb_parent, struct kmemleak_object, rb_node); in create_object()
649 rb_link_node(&object->rb_node, rb_parent, link); in create_object()
A Dvmalloc.c1228 while ((node = rb_parent(node))) { in find_vmap_lowest_match()
/linux/drivers/gpu/drm/
A 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/Documentation/core-api/
A 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/block/
A Dbfq-wf2q.c445 parent = rb_parent(node); in bfq_update_active_tree()
550 deepest = rb_parent(node); in bfq_find_deepest()
559 else if (rb_parent(deepest) != node) in bfq_find_deepest()
560 deepest = rb_parent(deepest); in bfq_find_deepest()
/linux/fs/jffs2/
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)
A Dreadinode.c404 struct rb_node *parent = rb_parent(node); in eat_last()
/linux/tools/include/linux/
A Drbtree.h34 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
A Drbtree_augmented.h85 rb = rb_parent(&node->RBFIELD); \
/linux/kernel/
A Dfork.c492 struct rb_node **rb_link, *rb_parent; in dup_mmap() local
518 rb_parent = NULL; in dup_mmap()
603 __vma_link_rb(mm, tmp, rb_link, rb_parent); in dup_mmap()
605 rb_parent = &tmp->vm_rb; in dup_mmap()
/linux/drivers/mtd/ubi/
A Dattach.c1290 this = rb_parent(this); in destroy_av()
1348 rb = rb_parent(rb); in destroy_ai()
A Dwl.c1601 rb = rb_parent(rb);
/linux/net/tipc/
A Dname_table.c197 while ((p = rb_parent(n)) && n == p->rb_right) in service_range_match_next()
/linux/drivers/md/
A Ddm-crypt.c1934 BUG_ON(rb_parent(write_tree.rb_node)); in dmcrypt_write()

Completed in 53 milliseconds