Lines Matching defs:node
70 INTERVAL_TREE_DEFINE(struct mmu_rb_node, node, unsigned long, __last,
73 static unsigned long mmu_node_start(struct mmu_rb_node *node)
75 return node->addr & PAGE_MASK;
78 static unsigned long mmu_node_last(struct mmu_rb_node *node)
80 return PAGE_ALIGN(node->addr + node->len) - 1;
119 struct rb_node *node;
138 while ((node = rb_first_cached(&handler->root))) {
139 rbnode = rb_entry(node, struct mmu_rb_node, node);
140 rb_erase_cached(node, &handler->root);
161 struct mmu_rb_node *node;
171 node = __mmu_rb_search(handler, mnode->addr, mnode->len);
172 if (node) {
188 struct mmu_rb_node *node;
191 node = __mmu_int_rb_iter_first(&handler->root, addr, (addr + len) - 1);
192 if (node)
193 list_move_tail(&node->list, &handler->lru_list);
194 return node;
202 struct mmu_rb_node *node = NULL;
206 node = __mmu_int_rb_iter_first(&handler->root, addr,
209 for (node = __mmu_int_rb_iter_first(&handler->root, addr,
211 node;
212 node = __mmu_int_rb_iter_next(node, addr,
214 if (handler->ops->filter(node, addr, len))
215 return node;
218 return node;
303 struct mmu_rb_node *node, *ptr = NULL;
307 for (node = __mmu_int_rb_iter_first(root, range->start, range->end-1);
308 node; node = ptr) {
309 /* Guard against node removal. */
310 ptr = __mmu_int_rb_iter_next(node, range->start,
312 trace_hfi1_mmu_mem_invalidate(node->addr, node->len);
314 __mmu_int_rb_remove(node, root);
315 list_del_init(&node->list);
316 kref_put(&node->refcount, release_nolock);
335 struct mmu_rb_node *node;
343 node = list_first_entry(&del_list, struct mmu_rb_node, list);
344 list_del(&node->list);
345 handler->ops->remove(handler->ops_arg, node);