9  * This work is licensed under the terms of the GNU GPL, version 2 or later.
27     /* Map at the left of the hole, can be NULL if "this" is first one */
31     const DMAMap *this;  member
54     args->prev = args->this;  in iova_tree_alloc_args_iterate()
55     args->this = next;  in iova_tree_alloc_args_iterate()
154  * Try to find an unallocated IOVA range between prev and this elements.
160  * (1) !prev, !this: No entries allocated, always succeed
162  * (2) !prev, this: We're iterating at the 1st element.
164  * (3) prev, !this: We're iterating at the last element.
166  * (4) prev, this: this is the most common case, we'll try to find a hole
167  * between "prev" and "this" mapping.
169  * Note that this function assumes the last valid iova is HWADDR_MAX, but it
174     const DMAMap *prev = args->prev, *this = args->this;  in iova_tree_alloc_map_in_hole()  local
177     if (this && this->iova + this->size < args->iova_begin) {  in iova_tree_alloc_map_in_hole()
182     hole_last = this ? this->iova : HWADDR_MAX;  in iova_tree_alloc_map_in_hole()
231      * TODO: Replace all this with g_tree_node_first/next/last when available  in iova_tree_alloc_map()