Lines Matching defs:start
132 node->start, node->size);
139 node->start, node->size, buf);
152 #define START(node) ((node)->start)
153 #define LAST(node) ((node)->start + (node)->size - 1)
160 __drm_mm_interval_first(const struct drm_mm *mm, u64 start, u64 last)
163 start, last) ?: (struct drm_mm_node *)&mm->head_node;
202 if (node->start < parent->start) {
251 u64 start = HOLE_ADDR(node), subtree_max_hole = node->subtree_max_hole;
259 if (start < HOLE_ADDR(parent))
360 u64 start, u64 end, u64 size,
369 return find_hole_addr(mm, start, size);
445 * meaning that start, size and color must be set by the caller. All other
460 end = node->start + node->size;
461 if (unlikely(end <= node->start))
465 hole = find_hole_addr(mm, node->start, 0);
475 if (adj_start > node->start || adj_end < end)
486 if (node->start > hole_start)
508 * @range_start: start of the allowed range for this node
595 node->start = adj_start;
661 * and insert with the guarantee that the allocation start will match.
694 * efficient when we simply start to select all objects from the tail of an LRU
728 * @start: start of the allowed range for the allocation
744 u64 start,
748 DRM_MM_BUG_ON(start >= end);
749 DRM_MM_BUG_ON(!size || size > end - start);
763 DRM_MM_BUG_ON(end <= start);
764 scan->range_start = start;
799 * (distance between the end of our previous node and the start of
899 return (node->start + node->size > scan->hit_start &&
900 node->start < scan->hit_end);
961 * @start: start of the range managed by @mm
966 void drm_mm_init(struct drm_mm *mm, u64 start, u64 size)
968 DRM_MM_BUG_ON(start + size <= start);
981 mm->head_node.start = start + size;
1006 u64 start, size;
1010 start = drm_mm_hole_node_start(entry);
1012 start, start + size, size);
1030 drm_printf(p, "%#018llx-%#018llx: %llu: used\n", entry->start,
1031 entry->start + entry->size, entry->size);