| /Linux-v4.19/lib/ |
| D | rbtree_test.c | 103 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in RB_DECLARE_CALLBACKS() local
109 rb_parent = *new; in RB_DECLARE_CALLBACKS()
110 parent = rb_entry(rb_parent, struct test_node, rb); in RB_DECLARE_CALLBACKS()
120 rb_link_node(&node->rb, rb_parent, new); in RB_DECLARE_CALLBACKS()
127 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in insert_augmented_cached() local
134 rb_parent = *new; in insert_augmented_cached()
135 parent = rb_entry(rb_parent, struct test_node, rb); in insert_augmented_cached()
147 rb_link_node(&node->rb, rb_parent, new); in insert_augmented_cached()
181 for (count = 0; rb; rb = rb_parent(rb)) in black_path_count()
216 (!rb_parent(rb) || is_red(rb_parent(rb)))); in check()
|
| D | rbtree.c | 90 struct rb_node *parent = rb_parent(old); in __rb_rotate_set_parents()
150 parent = rb_parent(node); in __rb_insert()
206 parent = rb_parent(node); in __rb_insert()
302 parent = rb_parent(node); in ____rb_erase_color()
392 parent = rb_parent(node); in ____rb_erase_color()
553 while ((parent = rb_parent(node)) && node == parent->rb_right) in rb_next()
582 while ((parent = rb_parent(node)) && node == parent->rb_left) in rb_prev()
592 struct rb_node *parent = rb_parent(victim); in rb_replace_node()
619 struct rb_node *parent = rb_parent(victim); in rb_replace_node_rcu()
655 parent = rb_parent(node); in rb_next_postorder()
|
| /Linux-v4.19/tools/lib/ |
| D | rbtree.c | 65 struct rb_node *parent = rb_parent(old); in __rb_rotate_set_parents()
112 parent = rb_parent(node); in __rb_insert()
165 parent = rb_parent(node); in __rb_insert()
259 parent = rb_parent(node); in ____rb_erase_color()
331 parent = rb_parent(node); in ____rb_erase_color()
462 while ((parent = rb_parent(node)) && node == parent->rb_right) in rb_next()
490 while ((parent = rb_parent(node)) && node == parent->rb_left) in rb_prev()
499 struct rb_node *parent = rb_parent(victim); in rb_replace_node()
529 parent = rb_parent(node); in rb_next_postorder()
|
| /Linux-v4.19/include/linux/ |
| D | interval_tree_generic.h | 71 struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \
77 rb_parent = *link; \
78 parent = rb_entry(rb_parent, ITSTRUCT, ITRB); \
90 rb_link_node(&node->ITRB, rb_parent, link); \
203 rb = rb_parent(&node->ITRB); \
|
| D | rbtree.h | 62 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
|
| D | rbtree_augmented.h | 86 rb = rb_parent(&node->rbfield); \
|
| /Linux-v4.19/mm/ |
| D | mmap.c | 501 struct rb_node ***rb_link, struct rb_node **rb_parent) in find_vma_links() argument
529 *rb_parent = __rb_parent; in find_vma_links()
562 struct rb_node **rb_link, struct rb_node *rb_parent) in __vma_link_rb() argument
579 rb_link_node(&vma->vm_rb, rb_parent, rb_link); in __vma_link_rb()
607 struct rb_node *rb_parent) in __vma_link() argument
609 __vma_link_list(mm, vma, prev, rb_parent); in __vma_link()
610 __vma_link_rb(mm, vma, rb_link, rb_parent); in __vma_link()
615 struct rb_node *rb_parent) in vma_link() argument
624 __vma_link(mm, vma, prev, rb_link, rb_parent); in vma_link()
641 struct rb_node **rb_link, *rb_parent; in __insert_vm_struct() local
[all …]
|
| D | util.c | 260 struct vm_area_struct *prev, struct rb_node *rb_parent) in __vma_link_list() argument
270 if (rb_parent) in __vma_link_list()
271 next = rb_entry(rb_parent, in __vma_link_list()
|
| D | kmemleak.c | 552 struct rb_node **link, *rb_parent; in create_object() local
601 rb_parent = NULL; in create_object()
603 rb_parent = *link; in create_object()
604 parent = rb_entry(rb_parent, struct kmemleak_object, rb_node); in create_object()
622 rb_link_node(&object->rb_node, rb_parent, link); in create_object()
|
| D | internal.h | 285 struct vm_area_struct *prev, struct rb_node *rb_parent);
|
| /Linux-v4.19/tools/include/linux/ |
| D | rbtree.h | 47 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) macro
|
| D | rbtree_augmented.h | 77 rb = rb_parent(&node->rbfield); \
|
| /Linux-v4.19/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-v4.19/block/ |
| D | bfq-wf2q.c | 454 parent = rb_parent(node); in bfq_update_active_tree()
559 deepest = rb_parent(node); in bfq_find_deepest()
568 else if (rb_parent(deepest) != node) in bfq_find_deepest()
569 deepest = rb_parent(deepest); in bfq_find_deepest()
|
| /Linux-v4.19/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-v4.19/kernel/ |
| D | fork.c | 425 struct rb_node **rb_link, *rb_parent; in dup_mmap() local
451 rb_parent = NULL; in dup_mmap()
538 __vma_link_rb(mm, tmp, rb_link, rb_parent); in dup_mmap()
540 rb_parent = &tmp->vm_rb; in dup_mmap()
|
| /Linux-v4.19/drivers/mtd/ubi/ |
| D | attach.c | 1302 this = rb_parent(this); in destroy_av()
1360 rb = rb_parent(rb); in destroy_ai()
|
| D | wl.c | 1441 rb = rb_parent(rb);
|
| /Linux-v4.19/drivers/gpu/drm/ |
| D | drm_mm.c | 195 rb = rb_parent(rb); in drm_mm_interval_tree_add_node()
|
| /Linux-v4.19/drivers/md/ |
| D | dm-crypt.c | 1646 BUG_ON(rb_parent(write_tree.rb_node)); in dmcrypt_write()
|
