hw/hfi1/mmu_rb.c

29 INTERVAL_TREE_DEFINE(struct mmu_rb_node, node, unsigned long, __last,
32 static unsigned long mmu_node_start(struct mmu_rb_node *node)
34 	return node->addr & PAGE_MASK;
37 static unsigned long mmu_node_last(struct mmu_rb_node *node)
39 	return PAGE_ALIGN(node->addr + node->len) - 1;
81 	struct rb_node *node;
100 	while ((node = rb_first_cached(&handler->root))) {
101 		rbnode = rb_entry(node, struct mmu_rb_node, node);
102 		rb_erase_cached(node, &handler->root);
123 	struct mmu_rb_node *node;
133 	node = __mmu_rb_search(handler, mnode->addr, mnode->len);
134 	if (node) {
150 	struct mmu_rb_node *node;
153 	node = __mmu_int_rb_iter_first(&handler->root, addr, (addr + len) - 1);
154 	if (node)
155 		list_move_tail(&node->list, &handler->lru_list);
156 	return node;
164 	struct mmu_rb_node *node = NULL;
168 		node = __mmu_int_rb_iter_first(&handler->root, addr,
171 		for (node = __mmu_int_rb_iter_first(&handler->root, addr,
173 		     node;
174 		     node = __mmu_int_rb_iter_next(node, addr,
176 			if (handler->ops->filter(node, addr, len))
177 				return node;
180 	return node;
267 	struct mmu_rb_node *node, *ptr = NULL;
271 	for (node = __mmu_int_rb_iter_first(root, range->start, range->end-1);
272 	     node; node = ptr) {
273 		/* Guard against node removal. */
274 		ptr = __mmu_int_rb_iter_next(node, range->start,
276 		trace_hfi1_mmu_mem_invalidate(node);
278 		__mmu_int_rb_remove(node, root);
279 		list_del_init(&node->list);
280 		kref_put(&node->refcount, release_nolock);
299 	struct mmu_rb_node *node;
307 		node = list_first_entry(&del_list, struct mmu_rb_node, list);
308 		list_del(&node->list);
309 		trace_hfi1_mmu_release_node(node);
310 		handler->ops->remove(handler->ops_arg, node);