Home
last modified time | relevance | path

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

/kernel/linux/linux-5.10/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.h35 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
Drbtree_augmented.h83 rb = rb_parent(&node->RBFIELD); \
/kernel/linux/linux-5.10/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()
/kernel/linux/linux-5.10/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)
/kernel/linux/linux-5.10/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()
/kernel/linux/linux-5.10/mm/
Dmmap.c534 struct rb_node ***rb_link, struct rb_node **rb_parent) in find_vma_links() argument
562 *rb_parent = __rb_parent; in find_vma_links()
639 struct rb_node **rb_link, struct rb_node *rb_parent) in __vma_link_rb() argument
656 rb_link_node(&vma->vm_rb, rb_parent, rb_link); in __vma_link_rb()
684 struct rb_node *rb_parent) in __vma_link() argument
687 __vma_link_rb(mm, vma, rb_link, rb_parent); in __vma_link()
692 struct rb_node *rb_parent) in vma_link() argument
701 __vma_link(mm, vma, prev, rb_link, rb_parent); in vma_link()
718 struct rb_node **rb_link, *rb_parent; in __insert_vm_struct() local
721 &prev, &rb_link, &rb_parent)) in __insert_vm_struct()
[all …]
Dkmemleak.c575 struct rb_node **link, *rb_parent; in create_object() local
626 rb_parent = NULL; in create_object()
628 rb_parent = *link; in create_object()
629 parent = rb_entry(rb_parent, struct kmemleak_object, rb_node); in create_object()
647 rb_link_node(&object->rb_node, rb_parent, link); in create_object()
Dvmalloc.c893 while ((node = rb_parent(node))) { in find_vmap_lowest_match()
/kernel/linux/linux-5.10/drivers/gpu/drm/
Ddrm_mm.c185 rb = rb_parent(rb); in drm_mm_interval_tree_add_node()
250 struct rb_node **link = &root->rb_node, *rb_parent = NULL; in RB_DECLARE_CALLBACKS_MAX() local
255 rb_parent = *link; in RB_DECLARE_CALLBACKS_MAX()
256 parent = rb_entry(rb_parent, struct drm_mm_node, rb_hole_addr); in RB_DECLARE_CALLBACKS_MAX()
265 rb_link_node(&node->rb_hole_addr, rb_parent, link); in RB_DECLARE_CALLBACKS_MAX()
407 while ((parent = rb_parent(node)) && node == parent->first) \
/kernel/linux/linux-5.10/tools/include/linux/
Drbtree.h34 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
Drbtree_augmented.h85 rb = rb_parent(&node->RBFIELD); \
/kernel/linux/linux-5.10/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);
/kernel/linux/linux-5.10/block/
Dbfq-wf2q.c448 parent = rb_parent(node); in bfq_update_active_tree()
553 deepest = rb_parent(node); in bfq_find_deepest()
562 else if (rb_parent(deepest) != node) in bfq_find_deepest()
563 deepest = rb_parent(deepest); in bfq_find_deepest()
/kernel/linux/linux-5.10/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()
/kernel/linux/linux-5.10/kernel/
Dfork.c480 struct rb_node **rb_link, *rb_parent; in dup_mmap() local
506 rb_parent = NULL; in dup_mmap()
594 __vma_link_rb(mm, tmp, rb_link, rb_parent); in dup_mmap()
596 rb_parent = &tmp->vm_rb; in dup_mmap()
/kernel/linux/linux-5.10/drivers/mtd/ubi/
Dattach.c1290 this = rb_parent(this); in destroy_av()
1348 rb = rb_parent(rb); in destroy_ai()
Dwl.c1603 rb = rb_parent(rb);
/kernel/linux/linux-5.10/net/tipc/
Dname_table.c193 while ((p = rb_parent(n)) && n == p->rb_right) in service_range_match_next()
/kernel/linux/linux-5.10/drivers/md/
Ddm-crypt.c1926 BUG_ON(rb_parent(write_tree.rb_node)); in dmcrypt_write()
/kernel/liteos_a/fs/jffs2/
Djffs2.patch5399 + rb_parent(node->rb_left) = parent;
5412 …n->ofs+this->fn->size, this->overlapped,this->rb.rb_left,this->rb.rb_right,rb_parent(&(this->rb)));