Home
last modified time | relevance | path

Searched refs:rb_parent (Results 1 - 25 of 41) sorted by relevance

12

/kernel/linux/linux-5.10/scripts/gdb/linux/
H 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)
/kernel/linux/linux-5.10/include/linux/
H 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); \
H A Drbtree.h35 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
H A Drbtree_augmented.h83 rb = rb_parent(&node->RBFIELD); \
/kernel/linux/linux-6.6/include/linux/
H 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); \
H A Drbtree.h26 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
/kernel/linux/linux-6.6/scripts/gdb/linux/
H 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)
/kernel/linux/linux-6.6/tools/include/linux/
H 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); \
H A Drbtree.h34 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
/kernel/linux/linux-5.10/lib/
H A Drbtree_test.c88 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in insert_augmented() local
94 rb_parent = *new; in insert_augmented()
95 parent = rb_entry(rb_parent, struct test_node, rb); in insert_augmented()
105 rb_link_node(&node->rb, rb_parent, new); in insert_augmented()
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(r in check()
[all...]
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()
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(nod in rb_next_postorder()
[all...]
/kernel/linux/linux-6.6/lib/
H A Drbtree_test.c88 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in insert_augmented() local
94 rb_parent = *new; in insert_augmented()
95 parent = rb_entry(rb_parent, struct test_node, rb); in insert_augmented()
105 rb_link_node(&node->rb, rb_parent, new); in insert_augmented()
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(r in check()
[all...]
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()
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(nod in rb_next_postorder()
[all...]
/kernel/linux/linux-5.10/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()
/kernel/linux/linux-6.6/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()
/kernel/linux/linux-5.10/mm/
H A Dmmap.c536 struct rb_node ***rb_link, struct rb_node **rb_parent) in find_vma_links()
564 *rb_parent = __rb_parent; in find_vma_links()
593 * @rb_parent: the parent rb_node
641 struct rb_node **rb_link, struct rb_node *rb_parent) in __vma_link_rb()
658 rb_link_node(&vma->vm_rb, rb_parent, rb_link); in __vma_link_rb()
686 struct rb_node *rb_parent) in __vma_link()
689 __vma_link_rb(mm, vma, rb_link, rb_parent); in __vma_link()
694 struct rb_node *rb_parent) in vma_link()
703 __vma_link(mm, vma, prev, rb_link, rb_parent); in vma_link()
720 struct rb_node **rb_link, *rb_parent; in __insert_vm_struct() local
534 find_vma_links(struct mm_struct *mm, unsigned long addr, unsigned long end, struct vm_area_struct **pprev, struct rb_node ***rb_link, struct rb_node **rb_parent) find_vma_links() argument
640 __vma_link_rb(struct mm_struct *mm, struct vm_area_struct *vma, struct rb_node **rb_link, struct rb_node *rb_parent) __vma_link_rb() argument
684 __vma_link(struct mm_struct *mm, struct vm_area_struct *vma, struct vm_area_struct *prev, struct rb_node **rb_link, struct rb_node *rb_parent) __vma_link() argument
692 vma_link(struct mm_struct *mm, struct vm_area_struct *vma, struct vm_area_struct *prev, struct rb_node **rb_link, struct rb_node *rb_parent) vma_link() argument
1771 struct rb_node **rb_link, *rb_parent; mmap_region() local
3139 struct rb_node **rb_link, *rb_parent; do_brk_flags() local
3314 struct rb_node **rb_link, *rb_parent; insert_vm_struct() local
3356 struct rb_node **rb_link, *rb_parent; copy_vma() local
[all...]
H A 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()
/kernel/linux/linux-5.10/drivers/gpu/drm/
H A 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 insert_hole_addr() local
255 rb_parent = *link; in insert_hole_addr()
256 parent = rb_entry(rb_parent, struct drm_mm_node, rb_hole_addr); in insert_hole_addr()
265 rb_link_node(&node->rb_hole_addr, rb_parent, link); in insert_hole_addr()
407 while ((parent = rb_parent(node)) && node == parent->first) \
/kernel/linux/linux-6.6/drivers/gpu/drm/
H 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 insert_hole_addr() local
252 rb_parent = *link; in insert_hole_addr()
253 parent = rb_entry(rb_parent, struct drm_mm_node, rb_hole_addr); in insert_hole_addr()
262 rb_link_node(&node->rb_hole_addr, rb_parent, link); in insert_hole_addr()
404 while ((parent = rb_parent(node)) && node == parent->first) \
/kernel/linux/linux-5.10/tools/include/linux/
H A Drbtree.h34 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
/kernel/linux/linux-5.10/block/
H A 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-6.6/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()
/kernel/linux/linux-6.6/mm/
H A 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()
/kernel/linux/linux-5.10/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)
/kernel/linux/linux-6.6/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)

Completed in 26 milliseconds

12