| /Linux-v5.4/include/linux/ |
| D | interval_tree_generic.h | 41 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); \
|
| D | rbtree.h | 35 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
|
| D | rbtree_augmented.h | 83 rb = rb_parent(&node->RBFIELD); \
|
| /Linux-v5.4/lib/ |
| D | rbtree_test.c | 88 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()
|
| D | rbtree.c | 78 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-v5.4/scripts/gdb/linux/ |
| D | rbtree.py | 45 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-v5.4/tools/lib/ |
| D | rbtree.c | 78 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-v5.4/mm/ |
| D | mmap.c | 536 struct rb_node ***rb_link, struct rb_node **rb_parent) in find_vma_links() argument
564 *rb_parent = __rb_parent; in find_vma_links()
597 struct rb_node **rb_link, struct rb_node *rb_parent) in __vma_link_rb() argument
614 rb_link_node(&vma->vm_rb, rb_parent, rb_link); in __vma_link_rb()
642 struct rb_node *rb_parent) in __vma_link() argument
644 __vma_link_list(mm, vma, prev, rb_parent); in __vma_link()
645 __vma_link_rb(mm, vma, rb_link, rb_parent); in __vma_link()
650 struct rb_node *rb_parent) in vma_link() argument
659 __vma_link(mm, vma, prev, rb_link, rb_parent); in vma_link()
676 struct rb_node **rb_link, *rb_parent; in __insert_vm_struct() local
[all …]
|
| D | util.c | 274 struct vm_area_struct *prev, struct rb_node *rb_parent) in __vma_link_list() argument
284 if (rb_parent) in __vma_link_list()
285 next = rb_entry(rb_parent, in __vma_link_list()
|
| D | kmemleak.c | 575 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()
|
| D | internal.h | 293 struct vm_area_struct *prev, struct rb_node *rb_parent);
|
| D | vmalloc.c | 643 node = rb_parent(&va->rb_node); in augment_tree_propagate_from()
826 while ((node = rb_parent(node))) { in find_vmap_lowest_match()
|
| /Linux-v5.4/tools/include/linux/ |
| D | rbtree.h | 34 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
|
| D | rbtree_augmented.h | 85 rb = rb_parent(&node->RBFIELD); \
|
| /Linux-v5.4/Documentation/ |
| D | rbtree.txt | 373 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-v5.4/block/ |
| D | bfq-wf2q.c | 451 parent = rb_parent(node); in bfq_update_active_tree()
556 deepest = rb_parent(node); in bfq_find_deepest()
565 else if (rb_parent(deepest) != node) in bfq_find_deepest()
566 deepest = rb_parent(deepest); in bfq_find_deepest()
|
| /Linux-v5.4/fs/jffs2/ |
| D | nodelist.h | 349 #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)
|
| D | readinode.c | 404 struct rb_node *parent = rb_parent(node); in eat_last()
|
| /Linux-v5.4/kernel/ |
| D | fork.c | 482 struct rb_node **rb_link, *rb_parent; in dup_mmap() local
508 rb_parent = NULL; in dup_mmap()
595 __vma_link_rb(mm, tmp, rb_link, rb_parent); in dup_mmap()
597 rb_parent = &tmp->vm_rb; in dup_mmap()
|
| /Linux-v5.4/drivers/mtd/ubi/ |
| D | attach.c | 1290 this = rb_parent(this); in destroy_av()
1348 rb = rb_parent(rb); in destroy_ai()
|
| D | wl.c | 1599 rb = rb_parent(rb);
|
| /Linux-v5.4/drivers/gpu/drm/ |
| D | drm_mm.c | 185 rb = rb_parent(rb); in drm_mm_interval_tree_add_node()
|
| /Linux-v5.4/drivers/md/ |
| D | dm-crypt.c | 1540 BUG_ON(rb_parent(write_tree.rb_node)); in dmcrypt_write()
|
