Lines Matching defs:node
40 container_of(iovad->cached32_node, struct iova, node);
52 iovad->cached32_node = &new->node;
64 cached_iova = container_of(curr, struct iova, node);
67 iovad->cached32_node = rb_next(&free->node);
100 struct iova *curr_iova = container_of(curr, struct iova, node);
133 /* Add new node and rebalance tree. */
144 /* Figure out where to put new node */
147 struct iova, node);
158 /* Add new node and rebalance tree. */
159 rb_link_node(&new->node, parent, entry);
160 rb_insert_color(&new->node, &iovad->rbroot);
174 /* Figure out where to put new node */
176 struct iova *this = container_of(*new, struct iova, node);
186 /* Add new node and rebalance tree. */
187 rb_link_node(&iova->node, parent, new);
188 rb_insert_color(&iova->node, root);
241 struct rb_node *node;
245 node = iovad->rbroot.rb_node;
246 while (node) {
247 struct iova *iova = container_of(node, struct iova, node);
262 node = node->rb_left;
264 node = node->rb_right;
284 rb_erase(&iova->node, &iovad->rbroot);
312 struct rb_node *node;
316 node = rb_first(&iovad->rbroot);
317 while (node) {
318 struct iova *iova = container_of(node, struct iova, node);
319 rb_erase(node, &iovad->rbroot);
321 node = rb_first(&iovad->rbroot);
327 __is_range_overlap(struct rb_node *node,
330 struct iova *iova = container_of(node, struct iova, node);
375 struct rb_node *node;
381 for (node = rb_first(&iovad->rbroot); node; node = rb_next(node)) {
382 if (__is_range_overlap(node, pfn_lo, pfn_hi)) {
383 iova = container_of(node, struct iova, node);
394 /* We are here either becasue this is the first reserver node
415 struct rb_node *node;
418 for (node = rb_first(&from->rbroot); node; node = rb_next(node)) {
419 struct iova *iova = container_of(node, struct iova, node);