rb_parent         451 block/bfq-wf2q.c 	parent = rb_parent(node);
rb_parent         558 block/bfq-wf2q.c 		deepest = rb_parent(node);
rb_parent         567 block/bfq-wf2q.c 		else if (rb_parent(deepest) != node)
rb_parent         568 block/bfq-wf2q.c 			deepest = rb_parent(deepest);
rb_parent         185 drivers/gpu/drm/drm_mm.c 			rb = rb_parent(rb);
rb_parent        1546 drivers/md/dm-crypt.c 		BUG_ON(rb_parent(write_tree.rb_node));
rb_parent        1290 drivers/mtd/ubi/attach.c 			this = rb_parent(this);
rb_parent        1348 drivers/mtd/ubi/attach.c 			rb = rb_parent(rb);
rb_parent        1599 drivers/mtd/ubi/wl.c 			rb = rb_parent(rb);
rb_parent         349 fs/jffs2/nodelist.h #define frag_parent(frag) rb_entry(rb_parent(&(frag)->rb), struct jffs2_node_frag, rb)
rb_parent         356 fs/jffs2/nodelist.h #define tn_parent(tn) rb_entry(rb_parent(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)
rb_parent         404 fs/jffs2/readinode.c 	struct rb_node *parent = rb_parent(node);
rb_parent          41 include/linux/interval_tree_generic.h 	struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL;    \
rb_parent          47 include/linux/interval_tree_generic.h 		rb_parent = *link;					      \
rb_parent          48 include/linux/interval_tree_generic.h 		parent = rb_entry(rb_parent, ITSTRUCT, ITRB);		      \
rb_parent          60 include/linux/interval_tree_generic.h 	rb_link_node(&node->ITRB, rb_parent, link);			      \
rb_parent         173 include/linux/interval_tree_generic.h 			rb = rb_parent(&node->ITRB);			      \
rb_parent          83 include/linux/rbtree_augmented.h 		rb = rb_parent(&node->RBFIELD);				\
rb_parent         482 kernel/fork.c  	struct rb_node **rb_link, *rb_parent;
rb_parent         508 kernel/fork.c  	rb_parent = NULL;
rb_parent         595 kernel/fork.c  		__vma_link_rb(mm, tmp, rb_link, rb_parent);
rb_parent         597 kernel/fork.c  		rb_parent = &tmp->vm_rb;
rb_parent          78 lib/rbtree.c   	struct rb_node *parent = rb_parent(old);
rb_parent         134 lib/rbtree.c   				parent = rb_parent(node);
rb_parent         190 lib/rbtree.c   				parent = rb_parent(node);
rb_parent         286 lib/rbtree.c   						parent = rb_parent(node);
rb_parent         376 lib/rbtree.c   						parent = rb_parent(node);
rb_parent         517 lib/rbtree.c   	while ((parent = rb_parent(node)) && node == parent->rb_right)
rb_parent         546 lib/rbtree.c   	while ((parent = rb_parent(node)) && node == parent->rb_left)
rb_parent         556 lib/rbtree.c   	struct rb_node *parent = rb_parent(victim);
rb_parent         573 lib/rbtree.c   	struct rb_node *parent = rb_parent(victim);
rb_parent         609 lib/rbtree.c   	parent = rb_parent(node);
rb_parent          88 lib/rbtree_test.c 	struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;
rb_parent          94 lib/rbtree_test.c 		rb_parent = *new;
rb_parent          95 lib/rbtree_test.c 		parent = rb_entry(rb_parent, struct test_node, rb);
rb_parent         105 lib/rbtree_test.c 	rb_link_node(&node->rb, rb_parent, new);
rb_parent         112 lib/rbtree_test.c 	struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;
rb_parent         119 lib/rbtree_test.c 		rb_parent = *new;
rb_parent         120 lib/rbtree_test.c 		parent = rb_entry(rb_parent, struct test_node, rb);
rb_parent         132 lib/rbtree_test.c 	rb_link_node(&node->rb, rb_parent, new);
rb_parent         166 lib/rbtree_test.c 	for (count = 0; rb; rb = rb_parent(rb))
rb_parent         201 lib/rbtree_test.c 			     (!rb_parent(rb) || is_red(rb_parent(rb))));
rb_parent         293 mm/internal.h  		struct vm_area_struct *prev, struct rb_node *rb_parent);
rb_parent         575 mm/kmemleak.c  	struct rb_node **link, *rb_parent;
rb_parent         626 mm/kmemleak.c  	rb_parent = NULL;
rb_parent         628 mm/kmemleak.c  		rb_parent = *link;
rb_parent         629 mm/kmemleak.c  		parent = rb_entry(rb_parent, struct kmemleak_object, rb_node);
rb_parent         647 mm/kmemleak.c  	rb_link_node(&object->rb_node, rb_parent, link);
rb_parent         528 mm/mmap.c      		struct rb_node ***rb_link, struct rb_node **rb_parent)
rb_parent         556 mm/mmap.c      	*rb_parent = __rb_parent;
rb_parent         589 mm/mmap.c      		struct rb_node **rb_link, struct rb_node *rb_parent)
rb_parent         606 mm/mmap.c      	rb_link_node(&vma->vm_rb, rb_parent, rb_link);
rb_parent         634 mm/mmap.c      	struct rb_node *rb_parent)
rb_parent         636 mm/mmap.c      	__vma_link_list(mm, vma, prev, rb_parent);
rb_parent         637 mm/mmap.c      	__vma_link_rb(mm, vma, rb_link, rb_parent);
rb_parent         642 mm/mmap.c      			struct rb_node *rb_parent)
rb_parent         651 mm/mmap.c      	__vma_link(mm, vma, prev, rb_link, rb_parent);
rb_parent         668 mm/mmap.c      	struct rb_node **rb_link, *rb_parent;
rb_parent         671 mm/mmap.c      			   &prev, &rb_link, &rb_parent))
rb_parent         673 mm/mmap.c      	__vma_link(mm, vma, prev, rb_link, rb_parent);
rb_parent        1718 mm/mmap.c      	struct rb_node **rb_link, *rb_parent;
rb_parent        1738 mm/mmap.c      			      &rb_parent)) {
rb_parent        1819 mm/mmap.c      	vma_link(mm, vma, prev, rb_link, rb_parent);
rb_parent        1948 mm/mmap.c      			if (!rb_parent(prev))
rb_parent        1950 mm/mmap.c      			vma = rb_entry(rb_parent(prev),
rb_parent        2052 mm/mmap.c      			if (!rb_parent(prev))
rb_parent        2054 mm/mmap.c      			vma = rb_entry(rb_parent(prev),
rb_parent        2996 mm/mmap.c      	struct rb_node **rb_link, *rb_parent;
rb_parent        3017 mm/mmap.c      			      &rb_parent)) {
rb_parent        3053 mm/mmap.c      	vma_link(mm, vma, prev, rb_link, rb_parent);
rb_parent        3174 mm/mmap.c      	struct rb_node **rb_link, *rb_parent;
rb_parent        3177 mm/mmap.c      			   &prev, &rb_link, &rb_parent))
rb_parent        3200 mm/mmap.c      	vma_link(mm, vma, prev, rb_link, rb_parent);
rb_parent        3216 mm/mmap.c      	struct rb_node **rb_link, *rb_parent;
rb_parent        3228 mm/mmap.c      	if (find_vma_links(mm, addr, addr + len, &prev, &rb_link, &rb_parent))
rb_parent        3270 mm/mmap.c      		vma_link(mm, new_vma, prev, rb_link, rb_parent);
rb_parent         274 mm/util.c      		struct vm_area_struct *prev, struct rb_node *rb_parent)
rb_parent         284 mm/util.c      		if (rb_parent)
rb_parent         285 mm/util.c      			next = rb_entry(rb_parent,
rb_parent         644 mm/vmalloc.c   		node = rb_parent(&va->rb_node);
rb_parent         827 mm/vmalloc.c   			while ((node = rb_parent(node))) {
rb_parent          85 tools/include/linux/rbtree_augmented.h 		rb = rb_parent(&node->RBFIELD);				\
rb_parent          78 tools/lib/rbtree.c 	struct rb_node *parent = rb_parent(old);
rb_parent         134 tools/lib/rbtree.c 				parent = rb_parent(node);
rb_parent         190 tools/lib/rbtree.c 				parent = rb_parent(node);
rb_parent         286 tools/lib/rbtree.c 						parent = rb_parent(node);
rb_parent         376 tools/lib/rbtree.c 						parent = rb_parent(node);
rb_parent         511 tools/lib/rbtree.c 	while ((parent = rb_parent(node)) && node == parent->rb_right)
rb_parent         539 tools/lib/rbtree.c 	while ((parent = rb_parent(node)) && node == parent->rb_left)
rb_parent         548 tools/lib/rbtree.c 	struct rb_node *parent = rb_parent(victim);
rb_parent         578 tools/lib/rbtree.c 	parent = rb_parent(node);