23 INTERVAL_TREE_DEFINE(struct vm_area_struct, shared.rb,
38 	if (!prev->shared.rb.rb_right) {  in vma_interval_tree_insert_after()
40 		link = &prev->shared.rb.rb_right;  in vma_interval_tree_insert_after()
42 		parent = rb_entry(prev->shared.rb.rb_right,  in vma_interval_tree_insert_after()
43 				  struct vm_area_struct, shared.rb);  in vma_interval_tree_insert_after()
46 		while (parent->shared.rb.rb_left) {  in vma_interval_tree_insert_after()
47 			parent = rb_entry(parent->shared.rb.rb_left,  in vma_interval_tree_insert_after()
48 				struct vm_area_struct, shared.rb);  in vma_interval_tree_insert_after()
52 		link = &parent->shared.rb.rb_left;  in vma_interval_tree_insert_after()
56 	rb_link_node(&node->shared.rb, &parent->shared.rb, link);  in vma_interval_tree_insert_after()
57 	rb_insert_augmented(&node->shared.rb, &root->rb_root,  in vma_interval_tree_insert_after()
71 INTERVAL_TREE_DEFINE(struct anon_vma_chain, rb, unsigned long, rb_subtree_last,  in INTERVAL_TREE_DEFINE()  argument