93 	unsigned long limit_pfn, struct iova *new)  in __cached_rbnode_insert_update()  argument
97 	iovad->cached32_node = &new->node;  in __cached_rbnode_insert_update()
140 			struct iova *new, bool size_aligned)  in __alloc_and_insert_iova_range()  argument
182 	new->pfn_lo = limit_pfn - (size + pad_size) + 1;  in __alloc_and_insert_iova_range()
183 	new->pfn_hi = new->pfn_lo + size - 1;  in __alloc_and_insert_iova_range()
203 			if (new->pfn_lo < this->pfn_lo)  in __alloc_and_insert_iova_range()
205 			else if (new->pfn_lo > this->pfn_lo)  in __alloc_and_insert_iova_range()
212 		rb_link_node(&new->node, parent, entry);  in __alloc_and_insert_iova_range()
213 		rb_insert_color(&new->node, &iovad->rbroot);  in __alloc_and_insert_iova_range()
215 	__cached_rbnode_insert_update(iovad, saved_pfn, new);  in __alloc_and_insert_iova_range()
226 	struct rb_node **new = &(root->rb_node), *parent = NULL;  in iova_insert_rbtree()  local
228 	while (*new) {  in iova_insert_rbtree()
229 		struct iova *this = container_of(*new, struct iova, node);  in iova_insert_rbtree()
230 		parent = *new;  in iova_insert_rbtree()
233 			new = &((*new)->rb_left);  in iova_insert_rbtree()
235 			new = &((*new)->rb_right);  in iova_insert_rbtree()
240 	rb_link_node(&iova->node, parent, new);  in iova_insert_rbtree()